HEX
Server: Apache
System: Linux vps.mmtprep.com 4.18.0-477.21.1.el8_8.x86_64 #1 SMP Thu Aug 10 13:51:50 EDT 2023 x86_64
User: mmtprep (1001)
PHP: 8.1.34
Disabled: exec,passthru,shell_exec,system
$ pwd: /home/mmtprep/public_html/mathzen.mmtprep.com/assets/
Upload Files
File: /home/mmtprep/public_html/mathzen.mmtprep.com/assets/outilsMathjs-Jea_v8co.js.map
{"version":3,"file":"outilsMathjs-Jea_v8co.js","sources":["../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/ChangeTypes.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/interopRequireDefault.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/extends.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/core/config.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/typeof.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/utils/is.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/utils/object.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/core/function/config.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/configReadonly.js","../../node_modules/.pnpm/typed-function@4.1.1/node_modules/typed-function/lib/umd/typed-function.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/utils/number.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/utils/bignumber/formatter.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/utils/string.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/error/DimensionError.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/error/IndexError.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/utils/array.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/utils/factory.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/classCallCheck.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/toPrimitive.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/toPropertyKey.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/createClass.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/utils/customs.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/utils/map.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/core/function/typed.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/resultset/ResultSet.js","../../node_modules/.pnpm/decimal.js@10.4.3/node_modules/decimal.js/decimal.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/bignumber/BigNumber.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/complex/Complex.js","../../node_modules/.pnpm/fraction.js@4.3.7/node_modules/fraction.js/fraction.cjs","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/fraction/Fraction.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/Range.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/Matrix.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/regeneratorRuntime.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/regenerator/index.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/utils/lruQueue.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/utils/function.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/DenseMatrix.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/utils/clone.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/utils/switch.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/utils/collection.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/utils/isInteger.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/plain/number/arithmetic.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/plain/number/bitwise.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/utils/product.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/plain/number/combinations.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/plain/number/constants.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/plain/number/logical.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/plain/number/probability.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/plain/number/trigonometry.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/plain/number/utils.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/plain/number/index.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/utils/isNegative.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/utils/isNumeric.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/utils/hasNumericValue.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/utils/isPositive.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/utils/isZero.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/utils/isNaN.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/utils/typeOf.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/utils/bignumber/nearlyEqual.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/utils/complex.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/relational/compareUnits.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/relational/equalScalar.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/SparseMatrix.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/number.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/string.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/boolean.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/bignumber/function/bignumber.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/complex/function/complex.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/fraction/function/fraction.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/function/matrix.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/matrixFromFunction.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/matrixFromRows.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/matrixFromColumns.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/unit/function/splitUnit.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/unaryMinus.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/unaryPlus.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/abs.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/apply.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/addScalar.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/cbrt.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/arrayWithHoles.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/iterableToArrayLimit.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/arrayLikeToArray.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/unsupportedIterableToArray.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/nonIterableRest.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/slicedToArray.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo11xS0s.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo12xSfs.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo14xDs.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/ceil.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/cube.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/exp.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/expm1.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/fix.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/floor.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/defineProperty.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/arrayWithoutHoles.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/iterableToArray.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/nonIterableSpread.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/toConsumableArray.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo01xDSid.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo04xSidSid.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo10xSids.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo13xDD.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/utils/broadcast.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/utils/matrixAlgorithmSuite.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/error/ArgumentsError.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/gcd.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo02xDS0.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo06xS0S0.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/lcm.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/log10.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/log2.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo03xDSf.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo05xSfSf.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/mod.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/multiplyScalar.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/multiply.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/nthRoot.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/sign.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/sqrt.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/square.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/subtract.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/xgcd.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/invmod.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo09xS0Sf.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/dotMultiply.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/utils/bignumber/bitwise.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/bitwise/bitAnd.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/bitwise/bitNot.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/bitwise/bitOr.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo07xSSf.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/bitwise/bitXor.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/complex/arg.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/complex/conj.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/complex/im.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/complex/re.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/logical/not.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/logical/or.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/logical/xor.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/concat.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/column.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/count.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/cross.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/diag.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/filter.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/flatten.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/forEach.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/getMatrixDataType.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/identity.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/kron.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/map.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/diff.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/ones.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/utils/noop.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/range.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/reshape.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/resize.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/rotate.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/rotationMatrix.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/row.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/size.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/squeeze.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/subset.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/transpose.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/ctranspose.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/zeros.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/fft.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/ifft.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/special/erf.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/statistics/mode.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/statistics/utils/improveErrorMessage.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/statistics/prod.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/string/format.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/string/bin.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/string/oct.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/string/hex.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/string/print.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/unit/to.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/utils/isPrime.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/utils/numeric.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/divideScalar.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/pow.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/round.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/log.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/log1p.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/nthRoots.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/dotPow.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/dotDivide.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/solver/utils/solveValidation.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/solver/lsolve.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/solver/usolve.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/solver/lsolveAll.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/solver/usolveAll.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo08xS0Sid.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/bitwise/useMatrixForArrayScalar.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/bitwise/leftShift.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/bitwise/rightArithShift.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/bitwise/rightLogShift.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/logical/and.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/relational/compare.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/relational/compareNatural.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/relational/compareText.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/relational/equal.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/relational/equalText.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/relational/smaller.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/relational/smallerEq.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/relational/larger.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/relational/largerEq.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/relational/deepEqual.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/relational/unequal.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/partitionSelect.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/sort.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/statistics/max.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/statistics/min.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/ImmutableDenseMatrix.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/MatrixIndex.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/FibonacciHeap.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/Spa.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/utils/bignumber/constants.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/unit/Unit.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/unit/function/unit.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/function/sparse.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/unit/function/createUnit.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/acos.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/acosh.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/acot.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/acoth.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/acsc.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/acsch.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/asec.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/asech.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/asin.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/asinh.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/atan.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/atan2.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/atanh.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/trigUnit.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/cos.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/cosh.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/cot.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/coth.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/csc.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/csch.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/sec.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/sech.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/sin.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/sinh.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/tan.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/trigonometry/tanh.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/set/setCartesian.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/set/setDifference.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/set/setDistinct.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/set/setIntersect.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/set/setIsSubset.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/set/setMultiplicity.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/set/setPowerset.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/set/setSize.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/set/setSymDifference.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/set/setUnion.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/add.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/hypot.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/norm.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/dot.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/trace.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/matrix/function/index.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/keywords.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/node/Node.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/setPrototypeOf.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/inherits.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/assertThisInitialized.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/possibleConstructorReturn.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/getPrototypeOf.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/transform/utils/errorTransform.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/node/utils/access.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/node/AccessorNode.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/node/ArrayNode.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/node/utils/assign.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/operators.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/node/AssignmentNode.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/node/BlockNode.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/node/ConditionalNode.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/utils/latex.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/node/ConstantNode.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/node/FunctionAssignmentNode.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/node/IndexNode.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/node/ObjectNode.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/node/OperatorNode.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/node/ParenthesisNode.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/node/RangeNode.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/node/RelationalNode.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/node/SymbolNode.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/superPropBase.js","../../node_modules/.pnpm/@babel+runtime@7.23.9/node_modules/@babel/runtime/helpers/get.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/utils/scope.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/node/FunctionNode.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/parse.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/function/compile.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/function/evaluate.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/Parser.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/function/parser.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/decomposition/lup.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/decomposition/qr.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/sparse/csPermute.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/sparse/csTdfs.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/sparse/csPost.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/sparse/csEtree.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/sparse/csFkeep.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/sparse/csFlip.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/sparse/csAmd.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/sparse/csLeaf.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/sparse/csCounts.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/sparse/csSqr.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/sparse/csMarked.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/sparse/csMark.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/sparse/csUnflip.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/sparse/csDfs.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/sparse/csReach.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/sparse/csSpsolve.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/sparse/csLu.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/decomposition/slu.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/sparse/csIpvec.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/solver/lusolve.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/polynomialRoot.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/Help.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/chain/Chain.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/e.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/false.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/i.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/Infinity.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LN10.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LN2.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LOG10E.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LOG2E.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/NaN.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/null.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/phi.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/pi.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/SQRT1_2.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/SQRT2.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/tau.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/true.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/version.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/bignumber.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/boolean.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/complex.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/createUnit.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/fraction.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/index.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/matrix.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/number.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/sparse.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/splitUnit.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/string.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/unit.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/core/config.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/core/import.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/core/typed.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/derivative.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/leafCount.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lsolve.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lsolveAll.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lup.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lusolve.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/polynomialRoot.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/qr.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/rationalize.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/resolve.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/simplify.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/simplifyConstant.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/simplifyCore.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/slu.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/symbolicEqual.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/usolve.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/usolveAll.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/abs.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/add.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/cbrt.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/ceil.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/cube.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/divide.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/dotDivide.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/dotMultiply.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/dotPow.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/exp.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/expm.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/expm1.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/fix.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/floor.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/gcd.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/hypot.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/invmod.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/lcm.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log10.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log1p.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log2.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/mod.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/multiply.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/norm.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/nthRoot.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/nthRoots.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/pow.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/round.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/sign.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/sqrt.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/sqrtm.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/sylvester.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/schur.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/lyap.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/square.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/subtract.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/unaryMinus.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/unaryPlus.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/xgcd.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitAnd.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitNot.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitOr.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitXor.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/leftShift.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/rightArithShift.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/rightLogShift.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/bellNumbers.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/catalan.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/composition.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/stirlingS2.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/arg.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/conj.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/im.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/re.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/expression/evaluate.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/expression/help.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/geometry/distance.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/geometry/intersect.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/and.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/not.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/or.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/xor.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/column.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/concat.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/count.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/cross.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/ctranspose.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/det.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/diag.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/diff.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/dot.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/eigs.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/filter.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/flatten.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/forEach.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/getMatrixDataType.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/identity.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/inv.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/pinv.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/kron.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/map.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/matrixFromColumns.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/matrixFromFunction.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/matrixFromRows.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/ones.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/partitionSelect.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/range.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/reshape.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/resize.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/rotate.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/rotationMatrix.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/row.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/size.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/sort.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/squeeze.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/subset.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/trace.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/transpose.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/zeros.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/fft.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/ifft.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/combinations.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/combinationsWithRep.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/factorial.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/gamma.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/lgamma.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/kldivergence.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/multinomial.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/permutations.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/pickRandom.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/random.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/randomInt.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/compare.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/compareNatural.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/compareText.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/deepEqual.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/equal.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/equalText.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/larger.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/largerEq.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/smaller.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/smallerEq.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/unequal.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setCartesian.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setDifference.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setDistinct.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setIntersect.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setIsSubset.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setMultiplicity.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setPowerset.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setSize.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setSymDifference.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setUnion.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/special/erf.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/mad.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/max.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/mean.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/median.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/min.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/mode.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/prod.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/quantileSeq.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/std.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/cumsum.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/sum.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/variance.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acos.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acosh.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acot.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acoth.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acsc.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acsch.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asec.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asech.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asin.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asinh.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/atan.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/atan2.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/atanh.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/cos.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/cosh.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/cot.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/coth.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/csc.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/csch.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sec.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sech.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sin.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sinh.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/tan.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/tanh.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/units/to.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/bin.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/clone.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/format.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/hasNumericValue.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/hex.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isInteger.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isNaN.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isNegative.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isNumeric.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isPositive.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isPrime.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isZero.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/numeric.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/oct.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/print.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/typeOf.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/embeddedDocs/embeddedDocs.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/function/help.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/chain/function/chain.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/det.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/inv.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/pinv.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/eigs/complexEigs.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/eigs/realSymetric.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/eigs.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/expm.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/matrix/sqrtm.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/sylvester.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/decomposition/schur.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/lyap.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/arithmetic/divide.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/geometry/distance.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/geometry/intersect.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/statistics/sum.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/statistics/cumsum.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/statistics/mean.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/statistics/median.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/statistics/mad.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/statistics/variance.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/statistics/quantileSeq.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/statistics/std.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/probability/combinations.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/probability/combinationsWithRep.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/probability/gamma.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/probability/lgamma.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/probability/factorial.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/probability/kldivergence.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/probability/multinomial.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/probability/permutations.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/probability/util/seededRNG.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/probability/pickRandom.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/probability/util/randomMatrix.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/probability/random.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/probability/randomInt.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/combinatorics/stirlingS2.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/combinatorics/bellNumbers.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/combinatorics/catalan.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/combinatorics/composition.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/leafCount.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/simplify/wildcards.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/simplify/util.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/simplify.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/simplifyConstant.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/simplifyCore.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/resolve.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/symbolicEqual.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/derivative.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/function/algebra/rationalize.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/json/reviver.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/json/replacer.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/version.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/constants.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/type/unit/physicalConstants.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/transform/apply.transform.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/transform/column.transform.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/transform/utils/compileInlineExpression.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/transform/filter.transform.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/transform/forEach.transform.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/transform/index.transform.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/transform/map.transform.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/transform/utils/lastDimToZeroBase.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/transform/max.transform.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/transform/mean.transform.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/transform/min.transform.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/transform/range.transform.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/transform/row.transform.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/transform/subset.transform.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/transform/concat.transform.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/transform/diff.transform.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/transform/std.transform.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/transform/sum.transform.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/transform/cumsum.transform.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/expression/transform/variance.transform.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/factoriesAny.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/pureFunctionsAny.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/impureFunctionsAny.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/typeChecks.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBigNumberClass.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesComplexClass.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixClass.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDenseMatrixClass.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFractionClass.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTyped.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAbs.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNode.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEqualScalar.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSparseMatrixClass.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrix.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSubset.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAccessorNode.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcos.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcosh.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcot.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcoth.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcsc.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcsch.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAddScalar.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsInteger.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConcat.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAdd.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNot.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesZeros.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAnd.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesApply.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesApplyTransform.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesArg.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesArrayNode.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsec.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsech.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsin.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsinh.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAssignmentNode.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtan.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtan2.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtanh.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBignumber.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFraction.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNumber.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNumeric.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDivideScalar.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEqual.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRound.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCeil.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFloor.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFix.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFormat.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsNumeric.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMultiplyScalar.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIdentity.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsZero.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConj.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSize.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDot.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMultiply.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnaryMinus.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSubtract.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDet.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInv.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPow.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnitClass.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtomicMass.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAvogadro.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsNegative.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCombinations.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGamma.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFactorial.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLarger.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStirlingS2.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBellNumbers.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBin.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitAnd.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitNot.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitOr.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitXor.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesResultSet.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBlockNode.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBohrMagneton.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBohrRadius.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBoltzmann.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBoolean.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCatalan.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCbrt.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesChainClass.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesChain.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesClassicalElectronRadius.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesClone.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSmaller.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesImmutableDenseMatrixClass.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndexClass.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLargerEq.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSmallerEq.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRange.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesColumn.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesColumnTransform.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCombinationsWithRep.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompare.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompareNatural.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompareText.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConditionalNode.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConstantNode.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFunctionAssignmentNode.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSymbolNode.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFunctionNode.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndexNode.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesObjectNode.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOperatorNode.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParenthesisNode.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRangeNode.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRelationalNode.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParse.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompile.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesComplex.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsPositive.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesComposition.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConcatTransform.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConductanceQuantum.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCos.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCosh.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCot.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCoth.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCoulomb.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesProd.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCount.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCreateUnit.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCross.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCsc.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCsch.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTranspose.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCtranspose.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCube.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnaryPlus.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCumSum.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCumSumTransform.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDeepEqual.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDivide.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesResolve.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSimplifyConstant.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSimplifyCore.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSimplify.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDerivative.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDeuteronMass.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDiag.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDiff.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDiffTransform.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSqrt.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDistance.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDotDivide.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDotMultiply.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDotPow.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesE.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEfimovFactor.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFlatten.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIm.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixFromColumns.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSign.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesQr.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRe.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSin.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUsolve.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUsolveAll.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEigs.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesElectricConstant.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesElectronMass.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesElementaryCharge.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEqualText.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesErf.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEvaluate.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesExp.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesExpm.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesExpm1.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFalse.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFaraday.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFermiCoupling.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesI.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog2.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTau.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFft.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFibonacciHeapClass.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFilter.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFilterTransform.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFineStructure.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFirstRadiation.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesForEach.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesForEachTransform.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGasConstant.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGcd.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGetMatrixDataType.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGravitationConstant.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGravity.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHartreeEnergy.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHasNumericValue.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHelpClass.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHelp.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHex.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHypot.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIfft.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndex.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndexTransform.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInfinity.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIntersect.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInverseConductanceQuantum.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMod.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesXgcd.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInvmod.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsNaN.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsPrime.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMap.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSum.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesKldivergence.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesKlitzing.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesKron.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLN10.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLN2.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLOG10E.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLOG2E.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLcm.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLeafCount.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLeftShift.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLgamma.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog10.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog1p.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLoschmidt.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLsolve.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLsolveAll.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSpaClass.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLup.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSlu.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLusolve.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNorm.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSchur.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSylvester.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLyap.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPartitionSelect.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMedian.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMad.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMagneticConstant.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMagneticFluxQuantum.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMapTransform.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixFromFunction.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixFromRows.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMax.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMaxTransform.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMean.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMeanTransform.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMin.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMinTransform.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMode.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarMass.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarMassC12.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarPlanckConstant.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarVolume.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMultinomial.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNaN.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNeutronMass.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNthRoot.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNthRoots.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNuclearMagneton.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNull.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOct.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOnes.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOr.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParserClass.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParser.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPermutations.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPhi.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPi.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPickRandom.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPinv.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckCharge.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckConstant.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckLength.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckMass.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckTemperature.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckTime.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTypeOf.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPolynomialRoot.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPrint.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesProtonMass.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesQuantileSeq.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesQuantumOfCirculation.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRandom.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRandomInt.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRangeClass.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRangeTransform.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRationalize.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReducedPlanckConstant.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReplacer.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReshape.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesResize.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReviver.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRightArithShift.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRightLogShift.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRotationMatrix.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRotate.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRow.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRowTransform.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRydberg.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSQRT1_2.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSQRT2.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSackurTetrode.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSec.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSech.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSecondRadiation.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetCartesian.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetDifference.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetDistinct.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetIntersect.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetIsSubset.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetMultiplicity.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetPowerset.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetSize.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetSymDifference.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetUnion.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSinh.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSort.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSparse.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSpeedOfLight.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSplitUnit.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSqrtm.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSquare.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSqueeze.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVariance.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStd.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStdTransform.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStefanBoltzmann.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesString.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSubsetTransform.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSumTransform.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSymbolicEqual.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTan.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTanh.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesThomsonCrossSection.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTo.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTrace.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTrue.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnequal.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnitFunction.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUppercaseE.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUppercasePi.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVacuumImpedance.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVarianceTransform.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVersion.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesWeakMixingAngle.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesWienDisplacement.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesXor.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/allFactoriesAny.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/dependenciesAny.generated.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/utils/emitter.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/core/function/import.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/core/create.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/entry/mainAny.js","../../node_modules/.pnpm/mathjs@11.7.0/node_modules/mathjs/lib/cjs/index.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/node/Type.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/node/Creator.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/util/evaluate.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/node/Term.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/node/PolynomialTerm.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/Negative.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/node/CustomType.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/node/MixedNumber.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/node/NthRootTerm.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/node/Status.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/node/index.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/checks/canAddLikeTerms.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/checks/resolvesToConstant.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/checks/canFindRoots.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/collectAndCombineSearch/ConstantOrConstantPower.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/checks/canMultiplyLikeTermConstantNodes.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/checks/canMultiplyLikeTermPolynomialNodes.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/factor/ConstantFactors.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/util/flattenOperands.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/util/print.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/functionsSearch/nthRoot.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/checks/canMultiplyLikeTermsNthRoots.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/checks/canRearrangeCoefficient.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/checks/canSimplifyPolynomialTerms.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/checks/hasUnsupportedNodes.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/Symbols.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/checks/isQuadratic.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/checks/index.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/factor/factorQuadratic.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/util/Util.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/collectAndCombineSearch/LikeTermCollector.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/util/removeUnnecessaryParens.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/factor/stepThrough.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/factor/index.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/TreeSearch.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/arithmeticSearch/index.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/basicsSearch/convertMixedNumberToImproperFraction.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/basicsSearch/rearrangeCoefficient.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/basicsSearch/reduceExponentByZero.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/basicsSearch/reduceMultiplicationByZero.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/basicsSearch/reduceZeroDividedByAnything.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/basicsSearch/removeAdditionOfZero.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/basicsSearch/removeDivisionByOne.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/basicsSearch/removeExponentBaseOne.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/basicsSearch/removeExponentByOne.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/basicsSearch/removeMultiplicationByNegativeOne.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/basicsSearch/removeMultiplicationByOne.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/basicsSearch/simplifyDoubleUnaryMinus.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/basicsSearch/index.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/breakUpNumeratorSearch/index.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/fractionsSearch/divideByGCD.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/fractionsSearch/addConstantFractions.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/fractionsSearch/addConstantAndFraction.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/collectAndCombineSearch/evaluateConstantSum.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/collectAndCombineSearch/addLikeTerms.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/multiplyFractionsSearch/index.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/collectAndCombineSearch/multiplyLikeTerms.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/collectAndCombineSearch/index.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/distributeSearch/index.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/divisionSearch/index.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/fractionsSearch/cancelLikeTerms.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/fractionsSearch/simplifyFractionSigns.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/fractionsSearch/simplifyPolynomialFraction.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/fractionsSearch/index.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/functionsSearch/absoluteValue.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/functionsSearch/index.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/stepThrough.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/simplifyExpression/index.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/equation/Equation.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/equation/Status.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/solveEquation/EquationOperations.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/solveEquation/stepThrough.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/lib/solveEquation/index.js","../../node_modules/.pnpm/github.com+mathalea+mathsteps@88e77c00c92b2897c8959854fb5e9f6f978a7d7c/node_modules/mathsteps/index.js","../../src/modules/NodeType.js","../../src/modules/Change.js","../../src/modules/outilsMathjs.js"],"sourcesContent":["// The text to identify rules for each possible step that can be taken\n\nmodule.exports = {\n  NO_CHANGE: 'NO_CHANGE',\n\n  // ARITHMETIC\n\n  // e.g. 2 + 2 -> 4 or 2 * 2 -> 4\n  SIMPLIFY_ARITHMETIC: 'SIMPLIFY_ARITHMETIC',\n\n  // BASICS\n\n  // e.g. 2/-1 -> -2\n  DIVISION_BY_NEGATIVE_ONE: 'DIVISION_BY_NEGATIVE_ONE',\n  // e.g. 2/1 -> 2\n  DIVISION_BY_ONE: 'DIVISION_BY_ONE',\n  // e.g. x * 0 -> 0\n  MULTIPLY_BY_ZERO: 'MULTIPLY_BY_ZERO',\n  // e.g. x * 2 -> 2x\n  REARRANGE_COEFF: 'REARRANGE_COEFF',\n  // e.g. x ^ 0 -> 1\n  REDUCE_EXPONENT_BY_ZERO: 'REDUCE_EXPONENT_BY_ZERO',\n  // e.g. 0/1 -> 0\n  REDUCE_ZERO_NUMERATOR: 'REDUCE_ZERO_NUMERATOR',\n  // e.g. 2 + 0 -> 2\n  REMOVE_ADDING_ZERO: 'REMOVE_ADDING_ZERO',\n  // e.g. x ^ 1 -> x\n  REMOVE_EXPONENT_BY_ONE: 'REMOVE_EXPONENT_BY_ONE',\n  // e.g. 1 ^ x -> 1\n  REMOVE_EXPONENT_BASE_ONE: 'REMOVE_EXPONENT_BASE_ONE',\n  // e.g. x * -1 -> -x\n  REMOVE_MULTIPLYING_BY_NEGATIVE_ONE: 'REMOVE_MULTIPLYING_BY_NEGATIVE_ONE',\n  // e.g. x * 1 -> x\n  REMOVE_MULTIPLYING_BY_ONE: 'REMOVE_MULTIPLYING_BY_ONE',\n  // e.g. 2 - - 3 -> 2 + 3\n  RESOLVE_DOUBLE_MINUS: 'RESOLVE_DOUBLE_MINUS',\n\n  // COLLECT AND COMBINE AND BREAK UP\n\n  // e.g. 2 + x + 3 + x -> 5 + 2x\n  COLLECT_AND_COMBINE_LIKE_TERMS: 'COLLECT_AND_COMBINE_LIKE_TERMS',\n  // e.g. x + 2 + x^2 + x + 4 -> x^2 + (x + x) + (4 + 2)\n  COLLECT_LIKE_TERMS: 'COLLECT_LIKE_TERMS',\n\n  // MULTIPLYING CONSTANT POWERS\n  // e.g. 10^2 * 10^3 -> 10^(2+3)\n  COLLECT_CONSTANT_EXPONENTS: 'COLLECT_CONSTANT_EXPONENTS',\n\n  // ADDING POLYNOMIALS\n\n  // e.g. 2x + x -> 2x + 1x\n  ADD_COEFFICIENT_OF_ONE: 'ADD_COEFFICIENT_OF_ONE',\n  // e.g. x^2 + x^2 -> 2x^2\n  ADD_POLYNOMIAL_TERMS: 'ADD_POLYNOMIAL_TERMS',\n  // e.g. 2x^2 + 3x^2 + 5x^2 -> (2+3+5)x^2\n  GROUP_COEFFICIENTS: 'GROUP_COEFFICIENTS',\n  // e.g. -x + 2x => -1*x + 2x\n  UNARY_MINUS_TO_NEGATIVE_ONE: 'UNARY_MINUS_TO_NEGATIVE_ONE',\n\n  // MULTIPLYING POLYNOMIALS\n\n  // e.g. x^2 * x -> x^2 * x^1\n  ADD_EXPONENT_OF_ONE: 'ADD_EXPONENT_OF_ONE',\n  // e.g. x^2 * x^3 * x^1 -> x^(2 + 3 + 1)\n  COLLECT_POLYNOMIAL_EXPONENTS: 'COLLECT_POLYNOMIAL_EXPONENTS',\n  // e.g. 2x * 3x -> (2 * 3)(x * x)\n  MULTIPLY_COEFFICIENTS: 'MULTIPLY_COEFFICIENTS',\n  // e.g. 2x * x -> 2x ^ 2\n  MULTIPLY_POLYNOMIAL_TERMS: 'MULTIPLY_POLYNOMIAL_TERMS',\n\n  // FRACTIONS\n\n  // e.g. (x + 2)/2 -> x/2 + 2/2\n  BREAK_UP_FRACTION: 'BREAK_UP_FRACTION',\n  // e.g. -2/-3 => 2/3\n  CANCEL_MINUSES: 'CANCEL_MINUSES',\n  // e.g. 2x/2 -> x\n  CANCEL_TERMS: 'CANCEL_TERMS',\n  // e.g. 2/6 -> 1/3\n  SIMPLIFY_FRACTION: 'SIMPLIFY_FRACTION',\n  // e.g. 2/-3 -> -2/3\n  SIMPLIFY_SIGNS: 'SIMPLIFY_SIGNS',\n  // e.g. 15/6 -> (5*3)/(2*3)\n  FIND_GCD: 'FIND_GCD',\n  // e.g. (5*3)/(2*3) -> 5/2\n  CANCEL_GCD: 'CANCEL_GCD',\n  // e.g. 1 2/3 -> 5/3\n  CONVERT_MIXED_NUMBER_TO_IMPROPER_FRACTION: 'CONVERT_MIXED_NUMBER_TO_IMPROPER_FRACTION',\n  // e.g. 1 2/3 -> ((1 * 3) + 2) / 3\n  IMPROPER_FRACTION_NUMERATOR: 'IMPROPER_FRACTION_NUMERATOR',\n\n  // ADDING FRACTIONS\n\n  // e.g. 1/2 + 1/3 -> 5/6\n  ADD_FRACTIONS: 'ADD_FRACTIONS',\n  // e.g. (1 + 2)/3 -> 3/3\n  ADD_NUMERATORS: 'ADD_NUMERATORS',\n  // e.g. (2+1)/5\n  COMBINE_NUMERATORS: 'COMBINE_NUMERATORS',\n  // e.g. 2/6 + 1/4 -> (2*2)/(6*2) + (1*3)/(4*3)\n  COMMON_DENOMINATOR: 'COMMON_DENOMINATOR',\n  // e.g. 3 + 1/2 -> 6/2 + 1/2 (for addition)\n  CONVERT_INTEGER_TO_FRACTION: 'CONVERT_INTEGER_TO_FRACTION',\n  // e.g. 1.2 + 1/2 -> 1.2 + 0.5\n  DIVIDE_FRACTION_FOR_ADDITION: 'DIVIDE_FRACTION_FOR_ADDITION',\n  // e.g. (2*2)/(6*2) + (1*3)/(4*3) -> (2*2)/12 + (1*3)/12\n  MULTIPLY_DENOMINATORS: 'MULTIPLY_DENOMINATORS',\n  // e.g. (2*2)/12 + (1*3)/12 -> 4/12 + 3/12\n  MULTIPLY_NUMERATORS: 'MULTIPLY_NUMERATORS',\n\n  // MULTIPLYING FRACTIONS\n\n  // e.g. 1/2 * 2/3 -> 2/6\n  MULTIPLY_FRACTIONS: 'MULTIPLY_FRACTIONS',\n\n  // DIVISION\n\n  // e.g. 2/3/4 -> 2/(3*4)\n  SIMPLIFY_DIVISION: 'SIMPLIFY_DIVISION',\n  // e.g. x/(2/3) -> x * 3/2\n  MULTIPLY_BY_INVERSE: 'MULTIPLY_BY_INVERSE',\n\n  // DISTRIBUTION\n\n  // e.g. 2(x + y) -> 2x + 2y\n  DISTRIBUTE: 'DISTRIBUTE',\n  // e.g. -(2 + x) -> -2 - x\n  DISTRIBUTE_NEGATIVE_ONE: 'DISTRIBUTE_NEGATIVE_ONE',\n  // e.g. 2 * 4x + 2*5 --> 8x + 10 (as part of distribution)\n  SIMPLIFY_TERMS: 'SIMPLIFY_TERMS',\n  // e.g. (nthRoot(x, 2))^2 -> nthRoot(x, 2) * nthRoot(x, 2)\n  // e.g. (2x + 3)^2 -> (2x + 3) (2x + 3)\n  EXPAND_EXPONENT: 'EXPAND_EXPONENT',\n\n  // ABSOLUTE\n  // e.g. |-3| -> 3\n  ABSOLUTE_VALUE: 'ABSOLUTE_VALUE',\n\n  // ROOTS\n  // e.g. nthRoot(x ^ 2, 4) -> nthRoot(x, 2)\n  CANCEL_EXPONENT: 'CANCEL_EXPONENT',\n  // e.g. nthRoot(x ^ 2, 2) -> x\n  CANCEL_EXPONENT_AND_ROOT: 'CANCEL_EXPONENT_AND_ROOT',\n  // e.g. nthRoot(x ^ 4, 2) -> x ^ 2\n  CANCEL_ROOT: 'CANCEL_ROOT',\n  // e.g. nthRoot(2, 2) * nthRoot(3, 2) -> nthRoot(2 * 3, 2)\n  COMBINE_UNDER_ROOT: 'COMBINE_UNDER_ROOT',\n  // e.g. 2 * 2 * 2 -> 2 ^ 3\n  CONVERT_MULTIPLICATION_TO_EXPONENT: 'CONVERT_MULTIPLICATION_TO_EXPONENT',\n  // e.g. nthRoot(2 * x) -> nthRoot(2) * nthRoot(x)\n  DISTRIBUTE_NTH_ROOT: 'DISTRIBUTE_NTH_ROOT',\n  // e.g. nthRoot(4) * nthRoot(x^2) -> 2 * x\n  EVALUATE_DISTRIBUTED_NTH_ROOT: 'EVALUATE_DISTRIBUTED_NTH_ROOT',\n  // e.g. 12 -> 2 * 2 * 3\n  FACTOR_INTO_PRIMES: 'FACTOR_INTO_PRIMES',\n  // e.g. nthRoot(2 * 2 * 2, 2) -> nthRoot((2 * 2) * 2)\n  GROUP_TERMS_BY_ROOT: 'GROUP_TERMS_BY_ROOT',\n  // e.g. nthRoot(4) -> 2\n  NTH_ROOT_VALUE: 'NTH_ROOT_VALUE',\n  // e.g. nthRoot(4) + nthRoot(4) = 2*nthRoot(4)\n  ADD_NTH_ROOTS: 'ADD_NTH_ROOTS',\n  // e.g. nthRoot(x, 2) * nthRoot(x, 2) -> nthRoot(x^2, 2)\n  MULTIPLY_NTH_ROOTS: 'MULTIPLY_NTH_ROOTS',\n\n  // SOLVING FOR A VARIABLE\n\n  // e.g. x - 3 = 2 -> x - 3 + 3 = 2 + 3\n  ADD_TO_BOTH_SIDES: 'ADD_TO_BOTH_SIDES',\n  // e.g. 2x = 1 -> (2x)/2 = 1/2\n  DIVIDE_FROM_BOTH_SIDES: 'DIVIDE_FROM_BOTH_SIDES',\n  // e.g. (2/3)x = 1 -> (2/3)x * (3/2) = 1 * (3/2)\n  MULTIPLY_BOTH_SIDES_BY_INVERSE_FRACTION: 'MULTIPLY_BOTH_SIDES_BY_INVERSE_FRACTION',\n  // e.g. -x = 2 -> -1 * -x = -1 * 2\n  MULTIPLY_BOTH_SIDES_BY_NEGATIVE_ONE: 'MULTIPLY_BOTH_SIDES_BY_NEGATIVE_ONE',\n  // e.g. x/2 = 1 -> (x/2) * 2 = 1 * 2\n  MULTIPLY_TO_BOTH_SIDES: 'MULTIPLY_TO_BOTH_SIDES',\n  // e.g. x + 2 - 1 = 3 -> x + 1 = 3\n  SIMPLIFY_LEFT_SIDE: 'SIMPLIFY_LEFT_SIDE',\n  // e.g. x = 3 - 1 -> x = 2\n  SIMPLIFY_RIGHT_SIDE: 'SIMPLIFY_RIGHT_SIDE',\n  // e.g. x + 3 = 2 -> x + 3 - 3 = 2 - 3\n  SUBTRACT_FROM_BOTH_SIDES: 'SUBTRACT_FROM_BOTH_SIDES',\n  // e.g. 2 = x -> x = 2\n  SWAP_SIDES: 'SWAP_SIDES',\n  // e.g. (x - 2) (x + 2) = 0 => x = [-2, 2]\n  FIND_ROOTS: 'FIND_ROOTS',\n\n  // CONSTANT EQUATION\n\n  // e.g. 2 = 2\n  STATEMENT_IS_TRUE: 'STATEMENT_IS_TRUE',\n  // e.g. 2 = 3\n  STATEMENT_IS_FALSE: 'STATEMENT_IS_FALSE',\n\n  // FACTORING\n\n  // e.g. x^2 - 4x -> x(x - 4)\n  FACTOR_SYMBOL: 'FACTOR_SYMBOL',\n  // e.g. x^2 - 4 -> (x - 2)(x + 2)\n  FACTOR_DIFFERENCE_OF_SQUARES: 'FACTOR_DIFFERENCE_OF_SQUARES',\n  // e.g. x^2 + 2x + 1 -> (x + 1)^2\n  FACTOR_PERFECT_SQUARE: 'FACTOR_PERFECT_SQUARE',\n  // e.g. x^2 + 3x + 2 -> (x + 1)(x + 2)\n  FACTOR_SUM_PRODUCT_RULE: 'FACTOR_SUM_PRODUCT_RULE',\n  // e.g. 2x^2 + 4x + 2 -> 2x^2 + 2x + 2x + 2\n  BREAK_UP_TERM: 'BREAK_UP_TERM',\n};\n","function _interopRequireDefault(obj) {\n  return obj && obj.__esModule ? obj : {\n    \"default\": obj\n  };\n}\nmodule.exports = _interopRequireDefault, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","function _extends() {\n  module.exports = _extends = Object.assign ? Object.assign.bind() : function (target) {\n    for (var i = 1; i < arguments.length; i++) {\n      var source = arguments[i];\n      for (var key in source) {\n        if (Object.prototype.hasOwnProperty.call(source, key)) {\n          target[key] = source[key];\n        }\n      }\n    }\n    return target;\n  }, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;\n  return _extends.apply(this, arguments);\n}\nmodule.exports = _extends, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.DEFAULT_CONFIG = void 0;\nvar DEFAULT_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};\nexports.DEFAULT_CONFIG = DEFAULT_CONFIG;","function _typeof(o) {\n  \"@babel/helpers - typeof\";\n\n  return (module.exports = _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (o) {\n    return typeof o;\n  } : function (o) {\n    return o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o;\n  }, module.exports.__esModule = true, module.exports[\"default\"] = module.exports), _typeof(o);\n}\nmodule.exports = _typeof, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.isAccessorNode = isAccessorNode;\nexports.isArray = void 0;\nexports.isArrayNode = isArrayNode;\nexports.isAssignmentNode = isAssignmentNode;\nexports.isBigNumber = isBigNumber;\nexports.isBlockNode = isBlockNode;\nexports.isBoolean = isBoolean;\nexports.isChain = isChain;\nexports.isCollection = isCollection;\nexports.isComplex = isComplex;\nexports.isConditionalNode = isConditionalNode;\nexports.isConstantNode = isConstantNode;\nexports.isDate = isDate;\nexports.isDenseMatrix = isDenseMatrix;\nexports.isFraction = isFraction;\nexports.isFunction = isFunction;\nexports.isFunctionAssignmentNode = isFunctionAssignmentNode;\nexports.isFunctionNode = isFunctionNode;\nexports.isHelp = isHelp;\nexports.isIndex = isIndex;\nexports.isIndexNode = isIndexNode;\nexports.isMatrix = isMatrix;\nexports.isNode = isNode;\nexports.isNull = isNull;\nexports.isNumber = isNumber;\nexports.isObject = isObject;\nexports.isObjectNode = isObjectNode;\nexports.isOperatorNode = isOperatorNode;\nexports.isParenthesisNode = isParenthesisNode;\nexports.isRange = isRange;\nexports.isRangeNode = isRangeNode;\nexports.isRegExp = isRegExp;\nexports.isRelationalNode = isRelationalNode;\nexports.isResultSet = isResultSet;\nexports.isSparseMatrix = isSparseMatrix;\nexports.isString = isString;\nexports.isSymbolNode = isSymbolNode;\nexports.isUndefined = isUndefined;\nexports.isUnit = isUnit;\nexports.rule2Node = rule2Node;\nexports.typeOf = typeOf;\nvar _typeof2 = _interopRequireDefault(require(\"@babel/runtime/helpers/typeof\"));\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\nfunction isNumber(x) {\n  return typeof x === 'number';\n}\nfunction isBigNumber(x) {\n  if (!x || (0, _typeof2[\"default\"])(x) !== 'object' || typeof x.constructor !== 'function') {\n    return false;\n  }\n  if (x.isBigNumber === true && (0, _typeof2[\"default\"])(x.constructor.prototype) === 'object' && x.constructor.prototype.isBigNumber === true) {\n    return true;\n  }\n  if (typeof x.constructor.isDecimal === 'function' && x.constructor.isDecimal(x) === true) {\n    return true;\n  }\n  return false;\n}\nfunction isComplex(x) {\n  return x && (0, _typeof2[\"default\"])(x) === 'object' && Object.getPrototypeOf(x).isComplex === true || false;\n}\nfunction isFraction(x) {\n  return x && (0, _typeof2[\"default\"])(x) === 'object' && Object.getPrototypeOf(x).isFraction === true || false;\n}\nfunction isUnit(x) {\n  return x && x.constructor.prototype.isUnit === true || false;\n}\nfunction isString(x) {\n  return typeof x === 'string';\n}\nvar isArray = Array.isArray;\nexports.isArray = isArray;\nfunction isMatrix(x) {\n  return x && x.constructor.prototype.isMatrix === true || false;\n}\n\n/**\n * Test whether a value is a collection: an Array or Matrix\n * @param {*} x\n * @returns {boolean} isCollection\n */\nfunction isCollection(x) {\n  return Array.isArray(x) || isMatrix(x);\n}\nfunction isDenseMatrix(x) {\n  return x && x.isDenseMatrix && x.constructor.prototype.isMatrix === true || false;\n}\nfunction isSparseMatrix(x) {\n  return x && x.isSparseMatrix && x.constructor.prototype.isMatrix === true || false;\n}\nfunction isRange(x) {\n  return x && x.constructor.prototype.isRange === true || false;\n}\nfunction isIndex(x) {\n  return x && x.constructor.prototype.isIndex === true || false;\n}\nfunction isBoolean(x) {\n  return typeof x === 'boolean';\n}\nfunction isResultSet(x) {\n  return x && x.constructor.prototype.isResultSet === true || false;\n}\nfunction isHelp(x) {\n  return x && x.constructor.prototype.isHelp === true || false;\n}\nfunction isFunction(x) {\n  return typeof x === 'function';\n}\nfunction isDate(x) {\n  return x instanceof Date;\n}\nfunction isRegExp(x) {\n  return x instanceof RegExp;\n}\nfunction isObject(x) {\n  return !!(x && (0, _typeof2[\"default\"])(x) === 'object' && x.constructor === Object && !isComplex(x) && !isFraction(x));\n}\nfunction isNull(x) {\n  return x === null;\n}\nfunction isUndefined(x) {\n  return x === undefined;\n}\nfunction isAccessorNode(x) {\n  return x && x.isAccessorNode === true && x.constructor.prototype.isNode === true || false;\n}\nfunction isArrayNode(x) {\n  return x && x.isArrayNode === true && x.constructor.prototype.isNode === true || false;\n}\nfunction isAssignmentNode(x) {\n  return x && x.isAssignmentNode === true && x.constructor.prototype.isNode === true || false;\n}\nfunction isBlockNode(x) {\n  return x && x.isBlockNode === true && x.constructor.prototype.isNode === true || false;\n}\nfunction isConditionalNode(x) {\n  return x && x.isConditionalNode === true && x.constructor.prototype.isNode === true || false;\n}\nfunction isConstantNode(x) {\n  return x && x.isConstantNode === true && x.constructor.prototype.isNode === true || false;\n}\n\n/* Very specialized: returns true for those nodes which in the numerator of\n   a fraction means that the division in that fraction has precedence over implicit\n   multiplication, e.g. -2/3 x parses as (-2/3) x and 3/4 x parses as (3/4) x but\n   6!/8 x parses as 6! / (8x). It is located here because it is shared between\n   parse.js and OperatorNode.js (for parsing and printing, respectively).\n\n   This should *not* be exported from mathjs, unlike most of the tests here.\n   Its name does not start with 'is' to prevent utils/snapshot.js from thinking\n   it should be exported.\n*/\nfunction rule2Node(node) {\n  return isConstantNode(node) || isOperatorNode(node) && node.args.length === 1 && isConstantNode(node.args[0]) && '-+~'.includes(node.op);\n}\nfunction isFunctionAssignmentNode(x) {\n  return x && x.isFunctionAssignmentNode === true && x.constructor.prototype.isNode === true || false;\n}\nfunction isFunctionNode(x) {\n  return x && x.isFunctionNode === true && x.constructor.prototype.isNode === true || false;\n}\nfunction isIndexNode(x) {\n  return x && x.isIndexNode === true && x.constructor.prototype.isNode === true || false;\n}\nfunction isNode(x) {\n  return x && x.isNode === true && x.constructor.prototype.isNode === true || false;\n}\nfunction isObjectNode(x) {\n  return x && x.isObjectNode === true && x.constructor.prototype.isNode === true || false;\n}\nfunction isOperatorNode(x) {\n  return x && x.isOperatorNode === true && x.constructor.prototype.isNode === true || false;\n}\nfunction isParenthesisNode(x) {\n  return x && x.isParenthesisNode === true && x.constructor.prototype.isNode === true || false;\n}\nfunction isRangeNode(x) {\n  return x && x.isRangeNode === true && x.constructor.prototype.isNode === true || false;\n}\nfunction isRelationalNode(x) {\n  return x && x.isRelationalNode === true && x.constructor.prototype.isNode === true || false;\n}\nfunction isSymbolNode(x) {\n  return x && x.isSymbolNode === true && x.constructor.prototype.isNode === true || false;\n}\nfunction isChain(x) {\n  return x && x.constructor.prototype.isChain === true || false;\n}\nfunction typeOf(x) {\n  var t = (0, _typeof2[\"default\"])(x);\n  if (t === 'object') {\n    if (x === null) return 'null';\n    if (isBigNumber(x)) return 'BigNumber'; // Special: weird mashup with Decimal\n    if (x.constructor && x.constructor.name) return x.constructor.name;\n    return 'Object'; // just in case\n  }\n\n  return t; // can be 'string', 'number', 'boolean', 'function', 'bigint', ...\n}","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.canDefineProperty = canDefineProperty;\nexports.clone = clone;\nexports.deepExtend = deepExtend;\nexports.deepFlatten = deepFlatten;\nexports.deepStrictEqual = deepStrictEqual;\nexports.extend = extend;\nexports.get = get;\nexports.hasOwnProperty = hasOwnProperty;\nexports.isLegacyFactory = isLegacyFactory;\nexports.lazy = lazy;\nexports.mapObject = mapObject;\nexports.pick = pick;\nexports.pickShallow = pickShallow;\nexports.set = set;\nexports.traverse = traverse;\nexports.values = values;\nvar _typeof2 = _interopRequireDefault(require(\"@babel/runtime/helpers/typeof\"));\nvar _is = require(\"./is.js\");\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 */\nfunction clone(x) {\n  var type = (0, _typeof2[\"default\"])(x);\n\n  // immutable primitive types\n  if (type === 'number' || type === 'string' || type === 'boolean' || x === null || x === undefined) {\n    return x;\n  }\n\n  // use clone function of the object when available\n  if (typeof x.clone === 'function') {\n    return x.clone();\n  }\n\n  // array\n  if (Array.isArray(x)) {\n    return x.map(function (value) {\n      return clone(value);\n    });\n  }\n  if (x instanceof Date) return new Date(x.valueOf());\n  if ((0, _is.isBigNumber)(x)) return x; // bignumbers are immutable\n  if (x instanceof RegExp) throw new TypeError('Cannot clone ' + x); // TODO: clone a RegExp\n\n  // object\n  return mapObject(x, clone);\n}\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 */\nfunction mapObject(object, callback) {\n  var clone = {};\n  for (var key in object) {\n    if (hasOwnProperty(object, key)) {\n      clone[key] = callback(object[key]);\n    }\n  }\n  return clone;\n}\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 */\nfunction extend(a, b) {\n  for (var prop in b) {\n    if (hasOwnProperty(b, prop)) {\n      a[prop] = b[prop];\n    }\n  }\n  return a;\n}\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 */\nfunction 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  for (var prop in b) {\n    // We check against prop not being in Object.prototype or Function.prototype\n    // to prevent polluting for example Object.__proto__.\n    if (hasOwnProperty(b, prop) && !(prop in Object.prototype) && !(prop in Function.prototype)) {\n      if (b[prop] && b[prop].constructor === Object) {\n        if (a[prop] === undefined) {\n          a[prop] = {};\n        }\n        if (a[prop] && 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  return a;\n}\n\n/**\n * Deep test equality of all fields in two pairs of arrays or objects.\n * Compares values and functions strictly (ie. 2 is not the same as '2').\n * @param {Array | Object} a\n * @param {Array | Object} b\n * @returns {boolean}\n */\nfunction deepStrictEqual(a, b) {\n  var prop, i, len;\n  if (Array.isArray(a)) {\n    if (!Array.isArray(b)) {\n      return false;\n    }\n    if (a.length !== b.length) {\n      return false;\n    }\n    for (i = 0, len = a.length; i < len; i++) {\n      if (!deepStrictEqual(a[i], b[i])) {\n        return false;\n      }\n    }\n    return true;\n  } else if (typeof a === 'function') {\n    return a === b;\n  } else if (a instanceof Object) {\n    if (Array.isArray(b) || !(b instanceof Object)) {\n      return false;\n    }\n    for (prop in a) {\n      // noinspection JSUnfilteredForInLoop\n      if (!(prop in b) || !deepStrictEqual(a[prop], b[prop])) {\n        return false;\n      }\n    }\n    for (prop in b) {\n      // noinspection JSUnfilteredForInLoop\n      if (!(prop in a)) {\n        return false;\n      }\n    }\n    return true;\n  } else {\n    return a === b;\n  }\n}\n\n/**\n * Recursively flatten a nested object.\n * @param {Object} nestedObject\n * @return {Object} Returns the flattened object\n */\nfunction deepFlatten(nestedObject) {\n  var flattenedObject = {};\n  _deepFlatten(nestedObject, flattenedObject);\n  return flattenedObject;\n}\n\n// helper function used by deepFlatten\nfunction _deepFlatten(nestedObject, flattenedObject) {\n  for (var prop in nestedObject) {\n    if (hasOwnProperty(nestedObject, prop)) {\n      var value = nestedObject[prop];\n      if ((0, _typeof2[\"default\"])(value) === 'object' && value !== null) {\n        _deepFlatten(value, flattenedObject);\n      } else {\n        flattenedObject[prop] = value;\n      }\n    }\n  }\n}\n\n/**\n * Test whether the current JavaScript engine supports Object.defineProperty\n * @returns {boolean} returns true if supported\n */\nfunction canDefineProperty() {\n  // test needed for broken IE8 implementation\n  try {\n    if (Object.defineProperty) {\n      Object.defineProperty({}, 'x', {\n        get: function get() {\n          return null;\n        }\n      });\n      return true;\n    }\n  } catch (e) {}\n  return false;\n}\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 *\n * @param {Object} object         Object where to add the property\n * @param {string} prop           Property name\n * @param {Function} valueResolver Function returning the property value. Called\n *                                without arguments.\n */\nfunction lazy(object, prop, valueResolver) {\n  var _uninitialized = true;\n  var _value;\n  Object.defineProperty(object, prop, {\n    get: function get() {\n      if (_uninitialized) {\n        _value = valueResolver();\n        _uninitialized = false;\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}\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 | string[]} path   A dot separated string like 'name.space'\n * @return {Object} Returns the object at the end of the path\n */\nfunction traverse(object, path) {\n  if (path && typeof path === 'string') {\n    return traverse(object, path.split('.'));\n  }\n  var obj = object;\n  if (path) {\n    for (var i = 0; i < path.length; i++) {\n      var key = path[i];\n      if (!(key in obj)) {\n        obj[key] = {};\n      }\n      obj = obj[key];\n    }\n  }\n  return obj;\n}\n\n/**\n * A safe hasOwnProperty\n * @param {Object} object\n * @param {string} property\n */\nfunction hasOwnProperty(object, property) {\n  return object && Object.hasOwnProperty.call(object, property);\n}\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 */\nfunction isLegacyFactory(object) {\n  return object && typeof object.factory === 'function';\n}\n\n/**\n * Get a nested property from an object\n * @param {Object} object\n * @param {string | string[]} path\n * @returns {Object}\n */\nfunction get(object, path) {\n  if (typeof path === 'string') {\n    if (isPath(path)) {\n      return get(object, path.split('.'));\n    } else {\n      return object[path];\n    }\n  }\n  var child = object;\n  for (var i = 0; i < path.length; i++) {\n    var key = path[i];\n    child = child ? child[key] : undefined;\n  }\n  return child;\n}\n\n/**\n * Set a nested property in an object\n * Mutates the object itself\n * If the path doesn't exist, it will be created\n * @param {Object} object\n * @param {string | string[]} path\n * @param {*} value\n * @returns {Object}\n */\nfunction set(object, path, value) {\n  if (typeof path === 'string') {\n    if (isPath(path)) {\n      return set(object, path.split('.'), value);\n    } else {\n      object[path] = value;\n      return object;\n    }\n  }\n  var child = object;\n  for (var i = 0; i < path.length - 1; i++) {\n    var key = path[i];\n    if (child[key] === undefined) {\n      child[key] = {};\n    }\n    child = child[key];\n  }\n  if (path.length > 0) {\n    var lastKey = path[path.length - 1];\n    child[lastKey] = value;\n  }\n  return object;\n}\n\n/**\n * Create an object composed of the picked object properties\n * @param {Object} object\n * @param {string[]} properties\n * @param {function} [transform] Optional value to transform a value when picking it\n * @return {Object}\n */\nfunction pick(object, properties, transform) {\n  var copy = {};\n  for (var i = 0; i < properties.length; i++) {\n    var key = properties[i];\n    var value = get(object, key);\n    if (value !== undefined) {\n      set(copy, key, transform ? transform(value, key) : value);\n    }\n  }\n  return copy;\n}\n\n/**\n * Shallow version of pick, creating an object composed of the picked object properties\n * but not for nested properties\n * @param {Object} object\n * @param {string[]} properties\n * @return {Object}\n */\nfunction pickShallow(object, properties) {\n  var copy = {};\n  for (var i = 0; i < properties.length; i++) {\n    var key = properties[i];\n    var value = object[key];\n    if (value !== undefined) {\n      copy[key] = value;\n    }\n  }\n  return copy;\n}\nfunction values(object) {\n  return Object.keys(object).map(function (key) {\n    return object[key];\n  });\n}\n\n// helper function to test whether a string contains a path like 'user.name'\nfunction isPath(str) {\n  return str.indexOf('.') !== -1;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.NUMBER_OPTIONS = exports.MATRIX_OPTIONS = void 0;\nexports.configFactory = configFactory;\nvar _object = require(\"../../utils/object.js\");\nvar _config2 = require(\"../config.js\");\nvar MATRIX_OPTIONS = ['Matrix', 'Array']; // valid values for option matrix\nexports.MATRIX_OPTIONS = MATRIX_OPTIONS;\nvar NUMBER_OPTIONS = ['number', 'BigNumber', 'Fraction']; // valid values for option number\nexports.NUMBER_OPTIONS = NUMBER_OPTIONS;\nfunction configFactory(config, emit) {\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   * This function is only available on a mathjs instance created using `create`.\n   *\n   * Syntax:\n   *\n   *     math.config(config: Object): Object\n   *\n   * Examples:\n   *\n   *\n   *     import { create, all } from 'mathjs'\n   *\n   *     // create a mathjs instance\n   *     const math = create(all)\n   *\n   *     math.config().number                // outputs 'number'\n   *     math.evaluate('0.4')                // outputs number 0.4\n   *     math.config({number: 'Fraction'})\n   *     math.evaluate('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  function _config(options) {\n    if (options) {\n      var prev = (0, _object.mapObject)(config, _object.clone);\n\n      // validate some of the options\n      validateOption(options, 'matrix', MATRIX_OPTIONS);\n      validateOption(options, 'number', NUMBER_OPTIONS);\n\n      // merge options\n      (0, _object.deepExtend)(config, options);\n      var curr = (0, _object.mapObject)(config, _object.clone);\n      var changes = (0, _object.mapObject)(options, _object.clone);\n\n      // emit 'config' event\n      emit('config', curr, prev, changes);\n      return curr;\n    } else {\n      return (0, _object.mapObject)(config, _object.clone);\n    }\n  }\n\n  // attach the valid options to the function so they can be extended\n  _config.MATRIX_OPTIONS = MATRIX_OPTIONS;\n  _config.NUMBER_OPTIONS = NUMBER_OPTIONS;\n\n  // attach the config properties as readonly properties to the config function\n  Object.keys(_config2.DEFAULT_CONFIG).forEach(function (key) {\n    Object.defineProperty(_config, key, {\n      get: function get() {\n        return config[key];\n      },\n      enumerable: true,\n      configurable: true\n    });\n  });\n  return _config;\n}\n\n/**\n * Test whether an Array contains a specific item.\n * @param {Array.<string>} array\n * @param {string} item\n * @return {boolean}\n */\nfunction contains(array, item) {\n  return array.indexOf(item) !== -1;\n}\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 */\nfunction validateOption(options, name, values) {\n  if (options[name] !== undefined && !contains(values, options[name])) {\n    // unknown value\n    console.warn('Warning: Unknown value \"' + options[name] + '\" for configuration option \"' + name + '\". ' + 'Available options: ' + values.map(function (value) {\n      return JSON.stringify(value);\n    }).join(', ') + '.');\n  }\n}","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.config = void 0;\nvar _extends2 = _interopRequireDefault(require(\"@babel/runtime/helpers/extends\"));\nvar _config = require(\"../core/config.js\");\nvar _config2 = require(\"../core/function/config.js\");\n// create a read-only version of config\nvar config = /* #__PURE__ */function config(options) {\n  if (options) {\n    throw new Error('The global config is readonly. \\n' + 'Please create a mathjs instance if you want to change the default configuration. \\n' + 'Example:\\n' + '\\n' + '  import { create, all } from \\'mathjs\\';\\n' + '  const mathjs = create(all);\\n' + '  mathjs.config({ number: \\'BigNumber\\' });\\n');\n  }\n  return Object.freeze(_config.DEFAULT_CONFIG);\n};\nexports.config = config;\n(0, _extends2[\"default\"])(config, _config.DEFAULT_CONFIG, {\n  MATRIX_OPTIONS: _config2.MATRIX_OPTIONS,\n  NUMBER_OPTIONS: _config2.NUMBER_OPTIONS\n});","(function (global, factory) {\n  typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :\n  typeof define === 'function' && define.amd ? define(factory) :\n  (global = typeof globalThis !== 'undefined' ? globalThis : global || self, global[\"'typed'\"] = factory());\n})(this, (function () { 'use strict';\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  const NOT_TYPED_FUNCTION = 'Argument is not a typed-function.';\n  /**\n   * @typedef {{\n   *   params: Param[],\n   *   fn: function,\n   *   test: function,\n   *   implementation: function\n   * }} Signature\n   *\n   * @typedef {{\n   *   types: Type[],\n   *   hasAny: boolean,\n   *   hasConversion: boolean,\n   *   restParam: boolean\n   * }} Param\n   *\n   * @typedef {{\n   *   name: string,\n   *   typeIndex: number,\n   *   test: function,\n   *   isAny: boolean,\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   *   isAny?: boolean\n   * }} TypeDef\n   */\n\n  /**\n   * @returns {() => function}\n   */\n\n  function create() {\n    // data type tests\n\n    /**\n     * Returns true if the argument is a non-null \"plain\" object\n     */\n    function isPlainObject(x) {\n      return typeof x === 'object' && x !== null && x.constructor === Object;\n    }\n\n    const _types = [{\n      name: 'number',\n      test: function (x) {\n        return typeof x === 'number';\n      }\n    }, {\n      name: 'string',\n      test: function (x) {\n        return typeof x === 'string';\n      }\n    }, {\n      name: 'boolean',\n      test: function (x) {\n        return typeof x === 'boolean';\n      }\n    }, {\n      name: 'Function',\n      test: function (x) {\n        return typeof x === 'function';\n      }\n    }, {\n      name: 'Array',\n      test: Array.isArray\n    }, {\n      name: 'Date',\n      test: function (x) {\n        return x instanceof Date;\n      }\n    }, {\n      name: 'RegExp',\n      test: function (x) {\n        return x instanceof RegExp;\n      }\n    }, {\n      name: 'Object',\n      test: isPlainObject\n    }, {\n      name: 'null',\n      test: function (x) {\n        return x === null;\n      }\n    }, {\n      name: 'undefined',\n      test: function (x) {\n        return x === undefined;\n      }\n    }];\n    const anyType = {\n      name: 'any',\n      test: ok,\n      isAny: true\n    }; // Data structures to track the types. As these are local variables in\n    // create(), each typed universe will get its own copy, but the variables\n    // will only be accessible through the (closures of the) functions supplied\n    // as properties of the typed object, not directly.\n    // These will be initialized in clear() below\n\n    let typeMap; // primary store of all types\n\n    let typeList; // Array of just type names, for the sake of ordering\n    // And similar data structures for the type conversions:\n\n    let nConversions = 0; // the actual conversions are stored on a property of the destination types\n    // This is a temporary object, will be replaced with a function at the end\n\n    let typed = {\n      createCount: 0\n    };\n    /**\n     * Takes a type name and returns the corresponding official type object\n     * for that type.\n     *\n     * @param {string} typeName\n     * @returns {TypeDef} type\n     */\n\n    function findType(typeName) {\n      const type = typeMap.get(typeName);\n\n      if (type) {\n        return type;\n      } // Remainder is error handling\n\n\n      let message = 'Unknown type \"' + typeName + '\"';\n      const name = typeName.toLowerCase();\n      let otherName;\n\n      for (otherName of typeList) {\n        if (otherName.toLowerCase() === name) {\n          message += '. Did you mean \"' + otherName + '\" ?';\n          break;\n        }\n      }\n\n      throw new TypeError(message);\n    }\n    /**\n     * Adds an array `types` of type definitions to this typed instance.\n     * Each type definition should be an object with properties:\n     * 'name' - a string giving the name of the type; 'test' - function\n     * returning a boolean that tests membership in the type; and optionally\n     * 'isAny' - true only for the 'any' type.\n     *\n     * The second optional argument, `before`, gives the name of a type that\n     * these types should be added before. The new types are added in the\n     * order specified.\n     * @param {TypeDef[]} types\n     * @param {string | boolean} [beforeSpec='any'] before\n     */\n\n\n    function addTypes(types) {\n      let beforeSpec = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'any';\n      const beforeIndex = beforeSpec ? findType(beforeSpec).index : typeList.length;\n      const newTypes = [];\n\n      for (let i = 0; i < types.length; ++i) {\n        if (!types[i] || typeof types[i].name !== 'string' || typeof types[i].test !== 'function') {\n          throw new TypeError('Object with properties {name: string, test: function} expected');\n        }\n\n        const typeName = types[i].name;\n\n        if (typeMap.has(typeName)) {\n          throw new TypeError('Duplicate type name \"' + typeName + '\"');\n        }\n\n        newTypes.push(typeName);\n        typeMap.set(typeName, {\n          name: typeName,\n          test: types[i].test,\n          isAny: types[i].isAny,\n          index: beforeIndex + i,\n          conversionsTo: [] // Newly added type can't have any conversions to it\n\n        });\n      } // update the typeList\n\n\n      const affectedTypes = typeList.slice(beforeIndex);\n      typeList = typeList.slice(0, beforeIndex).concat(newTypes).concat(affectedTypes); // Fix the indices\n\n      for (let i = beforeIndex + newTypes.length; i < typeList.length; ++i) {\n        typeMap.get(typeList[i]).index = i;\n      }\n    }\n    /**\n     * Removes all types and conversions from this typed instance.\n     * May cause previously constructed typed-functions to throw\n     * strange errors when they are called with types that do not\n     * match any of their signatures.\n     */\n\n\n    function clear() {\n      typeMap = new Map();\n      typeList = [];\n      nConversions = 0;\n      addTypes([anyType], false);\n    } // initialize the types to the default list\n\n\n    clear();\n    addTypes(_types);\n    /**\n     * Removes all conversions, leaving the types alone.\n     */\n\n    function clearConversions() {\n      let typeName;\n\n      for (typeName of typeList) {\n        typeMap.get(typeName).conversionsTo = [];\n      }\n\n      nConversions = 0;\n    }\n    /**\n     * Find the type names that match a value.\n     * @param {*} value\n     * @return {string[]} Array of names of types for which\n     *                  the type test matches the value.\n     */\n\n\n    function findTypeNames(value) {\n      const matches = typeList.filter(name => {\n        const type = typeMap.get(name);\n        return !type.isAny && type.test(value);\n      });\n\n      if (matches.length) {\n        return matches;\n      }\n\n      return ['any'];\n    }\n    /**\n     * Check if an entity is a typed function created by any instance\n     * @param {any} entity\n     * @returns {boolean}\n     */\n\n\n    function isTypedFunction(entity) {\n      return entity && typeof entity === 'function' && '_typedFunctionData' in entity;\n    }\n    /**\n     * Find a specific signature from a (composed) typed function, for example:\n     *\n     *   typed.findSignature(fn, ['number', 'string'])\n     *   typed.findSignature(fn, 'number, string')\n     *   typed.findSignature(fn, 'number,string', {exact: true})\n     *\n     * This function findSignature will by default return the best match to\n     * the given signature, possibly employing type conversions.\n     *\n     * The (optional) third argument is a plain object giving options\n     * controlling the signature search. Currently the only implemented\n     * option is `exact`: if specified as true (default is false), only\n     * exact matches will be returned (i.e. signatures for which `fn` was\n     * directly defined). Note that a (possibly different) type matching\n     * `any`, or one or more instances of TYPE matching `...TYPE` are\n     * considered exact matches in this regard, as no conversions are used.\n     *\n     * This function returns a \"signature\" object, as does `typed.resolve()`,\n     * which is a plain object with four keys: `params` (the array of parameters\n     * for this signature), `fn` (the originally supplied function for this\n     * signature), `test` (a generated function that determines if an argument\n     * list matches this signature, and `implementation` (the function to call\n     * on a matching argument list, that performs conversions if necessary and\n     * then calls the originally supplied function).\n     *\n     * @param {Function} fn                   A typed-function\n     * @param {string | string[]} signature\n     *     Signature to be found, can be an array or a comma separated string.\n     * @param {object} options  Controls the signature search as documented\n     * @return {{ params: Param[], fn: function, test: function, implementation: function }}\n     *     Returns the matching signature, or throws an error when no signature\n     *     is found.\n     */\n\n\n    function findSignature(fn, signature, options) {\n      if (!isTypedFunction(fn)) {\n        throw new TypeError(NOT_TYPED_FUNCTION);\n      } // Canonicalize input\n\n\n      const exact = options && options.exact;\n      const stringSignature = Array.isArray(signature) ? signature.join(',') : signature;\n      const params = parseSignature(stringSignature);\n      const canonicalSignature = stringifyParams(params); // First hope we get lucky and exactly match a signature\n\n      if (!exact || canonicalSignature in fn.signatures) {\n        // OK, we can check the internal signatures\n        const match = fn._typedFunctionData.signatureMap.get(canonicalSignature);\n\n        if (match) {\n          return match;\n        }\n      } // Oh well, we did not; so we have to go back and check the parameters\n      // one by one, in order to catch things like `any` and rest params.\n      // Note here we can assume there is at least one parameter, because\n      // the empty signature would have matched successfully above.\n\n\n      const nParams = params.length;\n      let remainingSignatures;\n\n      if (exact) {\n        remainingSignatures = [];\n        let name;\n\n        for (name in fn.signatures) {\n          remainingSignatures.push(fn._typedFunctionData.signatureMap.get(name));\n        }\n      } else {\n        remainingSignatures = fn._typedFunctionData.signatures;\n      }\n\n      for (let i = 0; i < nParams; ++i) {\n        const want = params[i];\n        const filteredSignatures = [];\n        let possibility;\n\n        for (possibility of remainingSignatures) {\n          const have = getParamAtIndex(possibility.params, i);\n\n          if (!have || want.restParam && !have.restParam) {\n            continue;\n          }\n\n          if (!have.hasAny) {\n            // have to check all of the wanted types are available\n            const haveTypes = paramTypeSet(have);\n\n            if (want.types.some(wtype => !haveTypes.has(wtype.name))) {\n              continue;\n            }\n          } // OK, this looks good\n\n\n          filteredSignatures.push(possibility);\n        }\n\n        remainingSignatures = filteredSignatures;\n        if (remainingSignatures.length === 0) break;\n      } // Return the first remaining signature that was totally matched:\n\n\n      let candidate;\n\n      for (candidate of remainingSignatures) {\n        if (candidate.params.length <= nParams) {\n          return candidate;\n        }\n      }\n\n      throw new TypeError('Signature not found (signature: ' + (fn.name || 'unnamed') + '(' + stringifyParams(params, ', ') + '))');\n    }\n    /**\n     * Find the proper function to call for a specific signature from\n     * a (composed) typed function, for example:\n     *\n     *   typed.find(fn, ['number', 'string'])\n     *   typed.find(fn, 'number, string')\n     *   typed.find(fn, 'number,string', {exact: true})\n     *\n     * This function find will by default return the best match to\n     * the given signature, possibly employing type conversions (and returning\n     * a function that will perform those conversions as needed). The\n     * (optional) third argument is a plain object giving options contolling\n     * the signature search. Currently only the option `exact` is implemented,\n     * which defaults to \"false\". If `exact` is specified as true, then only\n     * exact matches will be returned (i.e. signatures for which `fn` was\n     * directly defined). Uses of `any` and `...TYPE` are considered exact if\n     * no conversions are necessary to apply the corresponding function.\n     *\n     * @param {Function} fn                   A typed-function\n     * @param {string | string[]} signature\n     *     Signature to be found, can be an array or a comma separated string.\n     * @param {object} options  Controls the signature match as documented\n     * @return {function}\n     *     Returns the function to call for the given signature, or throws an\n     *     error if no match is found.\n     */\n\n\n    function find(fn, signature, options) {\n      return findSignature(fn, signature, options).implementation;\n    }\n    /**\n     * Convert a given value to another data type, specified by type name.\n     *\n     * @param {*} value\n     * @param {string} typeName\n     */\n\n\n    function convert(value, typeName) {\n      // check conversion is needed\n      const type = findType(typeName);\n\n      if (type.test(value)) {\n        return value;\n      }\n\n      const conversions = type.conversionsTo;\n\n      if (conversions.length === 0) {\n        throw new Error('There are no conversions to ' + typeName + ' defined.');\n      }\n\n      for (let i = 0; i < conversions.length; i++) {\n        const fromType = findType(conversions[i].from);\n\n        if (fromType.test(value)) {\n          return conversions[i].convert(value);\n        }\n      }\n\n      throw new Error('Cannot convert ' + value + ' to ' + typeName);\n    }\n    /**\n     * Stringify parameters in a normalized way\n     * @param {Param[]} params\n     * @param {string} [','] separator\n     * @return {string}\n     */\n\n\n    function stringifyParams(params) {\n      let separator = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : ',';\n      return params.map(p => p.name).join(separator);\n    }\n    /**\n     * Parse a parameter, like \"...number | boolean\"\n     * @param {string} param\n     * @return {Param} param\n     */\n\n\n    function parseParam(param) {\n      const restParam = param.indexOf('...') === 0;\n      const types = !restParam ? param : param.length > 3 ? param.slice(3) : 'any';\n      const typeDefs = types.split('|').map(s => findType(s.trim()));\n      let hasAny = false;\n      let paramName = restParam ? '...' : '';\n      const exactTypes = typeDefs.map(function (type) {\n        hasAny = type.isAny || hasAny;\n        paramName += type.name + '|';\n        return {\n          name: type.name,\n          typeIndex: type.index,\n          test: type.test,\n          isAny: type.isAny,\n          conversion: null,\n          conversionIndex: -1\n        };\n      });\n      return {\n        types: exactTypes,\n        name: paramName.slice(0, -1),\n        // remove trailing '|' from above\n        hasAny,\n        hasConversion: false,\n        restParam\n      };\n    }\n    /**\n     * Expands a parsed parameter with the types available from currently\n     * defined conversions.\n     * @param {Param} param\n     * @return {Param} param\n     */\n\n\n    function expandParam(param) {\n      const typeNames = param.types.map(t => t.name);\n      const matchingConversions = availableConversions(typeNames);\n      let hasAny = param.hasAny;\n      let newName = param.name;\n      const convertibleTypes = matchingConversions.map(function (conversion) {\n        const type = findType(conversion.from);\n        hasAny = type.isAny || hasAny;\n        newName += '|' + conversion.from;\n        return {\n          name: conversion.from,\n          typeIndex: type.index,\n          test: type.test,\n          isAny: type.isAny,\n          conversion,\n          conversionIndex: conversion.index\n        };\n      });\n      return {\n        types: param.types.concat(convertibleTypes),\n        name: newName,\n        hasAny,\n        hasConversion: convertibleTypes.length > 0,\n        restParam: param.restParam\n      };\n    }\n    /**\n     * Return the set of type names in a parameter.\n     * Caches the result for efficiency\n     *\n     * @param {Param} param\n     * @return {Set<string>} typenames\n     */\n\n\n    function paramTypeSet(param) {\n      if (!param.typeSet) {\n        param.typeSet = new Set();\n        param.types.forEach(type => param.typeSet.add(type.name));\n      }\n\n      return param.typeSet;\n    }\n    /**\n     * Parse a signature with comma separated parameters,\n     * like \"number | boolean, ...string\"\n     *\n     * @param {string} signature\n     * @return {Param[]} params\n     */\n\n\n    function parseSignature(rawSignature) {\n      const params = [];\n\n      if (typeof rawSignature !== 'string') {\n        throw new TypeError('Signatures must be strings');\n      }\n\n      const signature = rawSignature.trim();\n\n      if (signature === '') {\n        return params;\n      }\n\n      const rawParams = signature.split(',');\n\n      for (let i = 0; i < rawParams.length; ++i) {\n        const parsedParam = parseParam(rawParams[i].trim());\n\n        if (parsedParam.restParam && i !== rawParams.length - 1) {\n          throw new SyntaxError('Unexpected rest parameter \"' + rawParams[i] + '\": ' + 'only allowed for the last parameter');\n        } // if invalid, short-circuit (all the types may have been filtered)\n\n\n        if (parsedParam.types.length === 0) {\n          return null;\n        }\n\n        params.push(parsedParam);\n      }\n\n      return params;\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\n\n    function hasRestParam(params) {\n      const param = last(params);\n      return param ? param.restParam : false;\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\n\n    function compileTest(param) {\n      if (!param || param.types.length === 0) {\n        // nothing to do\n        return ok;\n      } else if (param.types.length === 1) {\n        return findType(param.types[0].name).test;\n      } else if (param.types.length === 2) {\n        const test0 = findType(param.types[0].name).test;\n        const test1 = findType(param.types[1].name).test;\n        return function or(x) {\n          return test0(x) || test1(x);\n        };\n      } else {\n        // param.types.length > 2\n        const tests = param.types.map(function (type) {\n          return findType(type.name).test;\n        });\n        return function or(x) {\n          for (let i = 0; i < tests.length; i++) {\n            if (tests[i](x)) {\n              return true;\n            }\n          }\n\n          return false;\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\n\n    function compileTests(params) {\n      let tests, test0, test1;\n\n      if (hasRestParam(params)) {\n        // variable arguments like '...number'\n        tests = initial(params).map(compileTest);\n        const varIndex = tests.length;\n        const lastTest = compileTest(last(params));\n\n        const testRestParam = function (args) {\n          for (let i = varIndex; i < args.length; i++) {\n            if (!lastTest(args[i])) {\n              return false;\n            }\n          }\n\n          return true;\n        };\n\n        return function testArgs(args) {\n          for (let i = 0; i < tests.length; i++) {\n            if (!tests[i](args[i])) {\n              return false;\n            }\n          }\n\n          return testRestParam(args) && args.length >= varIndex + 1;\n        };\n      } else {\n        // no variable arguments\n        if (params.length === 0) {\n          return function testArgs(args) {\n            return args.length === 0;\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        } 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        } else {\n          // arguments.length > 2\n          tests = params.map(compileTest);\n          return function testArgs(args) {\n            for (let i = 0; i < tests.length; i++) {\n              if (!tests[i](args[i])) {\n                return false;\n              }\n            }\n\n            return args.length === tests.length;\n          };\n        }\n      }\n    }\n    /**\n     * Find the parameter at a specific index of a Params list.\n     * Handles rest parameters.\n     * @param {Param[]} params\n     * @param {number} index\n     * @return {Param | null} Returns the matching parameter when found,\n     *                        null otherwise.\n     */\n\n\n    function getParamAtIndex(params, index) {\n      return index < params.length ? params[index] : hasRestParam(params) ? last(params) : null;\n    }\n    /**\n     * Get all type names of a parameter\n     * @param {Params[]} params\n     * @param {number} index\n     * @return {string[]} Returns an array with type names\n     */\n\n\n    function getTypeSetAtIndex(params, index) {\n      const param = getParamAtIndex(params, index);\n\n      if (!param) {\n        return new Set();\n      }\n\n      return paramTypeSet(param);\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\n\n    function isExactType(type) {\n      return type.conversion === null || type.conversion === undefined;\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\n\n    function mergeExpectedParams(signatures, index) {\n      const typeSet = new Set();\n      signatures.forEach(signature => {\n        const paramSet = getTypeSetAtIndex(signature.params, index);\n        let name;\n\n        for (name of paramSet) {\n          typeSet.add(name);\n        }\n      });\n      return typeSet.has('any') ? ['any'] : Array.from(typeSet);\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\n\n    function createError(name, args, signatures) {\n      let err, expected;\n\n      const _name = name || 'unnamed'; // test for wrong type at some index\n\n\n      let matchingSignatures = signatures;\n      let index;\n\n      for (index = 0; index < args.length; index++) {\n        const nextMatchingDefs = [];\n        matchingSignatures.forEach(signature => {\n          const param = getParamAtIndex(signature.params, index);\n          const test = compileTest(param);\n\n          if ((index < signature.params.length || hasRestParam(signature.params)) && test(args[index])) {\n            nextMatchingDefs.push(signature);\n          }\n        });\n\n        if (nextMatchingDefs.length === 0) {\n          // no matching signatures anymore, throw error \"wrong type\"\n          expected = mergeExpectedParams(matchingSignatures, index);\n\n          if (expected.length > 0) {\n            const actualTypes = findTypeNames(args[index]);\n            err = new TypeError('Unexpected type of argument in function ' + _name + ' (expected: ' + expected.join(' or ') + ', actual: ' + actualTypes.join(' | ') + ', index: ' + index + ')');\n            err.data = {\n              category: 'wrongType',\n              fn: _name,\n              index,\n              actual: actualTypes,\n              expected\n            };\n            return err;\n          }\n        } else {\n          matchingSignatures = nextMatchingDefs;\n        }\n      } // test for too few arguments\n\n\n      const lengths = matchingSignatures.map(function (signature) {\n        return hasRestParam(signature.params) ? Infinity : signature.params.length;\n      });\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 + ' (expected: ' + expected.join(' or ') + ', index: ' + args.length + ')');\n        err.data = {\n          category: 'tooFewArgs',\n          fn: _name,\n          index: args.length,\n          expected\n        };\n        return err;\n      } // test for too many arguments\n\n\n      const maxLength = Math.max.apply(null, lengths);\n\n      if (args.length > maxLength) {\n        err = new TypeError('Too many arguments in function ' + _name + ' (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      } // Generic error\n\n\n      const argTypes = [];\n\n      for (let i = 0; i < args.length; ++i) {\n        argTypes.push(findTypeNames(args[i]).join('|'));\n      }\n\n      err = new TypeError('Arguments of type \"' + argTypes.join(', ') + '\" do not match any of the defined signatures of function ' + _name + '.');\n      err.data = {\n        category: 'mismatch',\n        actual: argTypes\n      };\n      return err;\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\n\n    function getLowestTypeIndex(param) {\n      let min = typeList.length + 1;\n\n      for (let 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     * 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\n\n    function getLowestConversionIndex(param) {\n      let min = nConversions + 1;\n\n      for (let 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     * Compare two params\n     * @param {Param} param1\n     * @param {Param} param2\n     * @return {number} returns -1 when param1 must get a lower\n     *                  index than param2, 1 when the opposite,\n     *                  or zero when both are equal\n     */\n\n\n    function compareParams(param1, param2) {\n      // We compare a number of metrics on a param in turn:\n      // 1) 'any' parameters are the least preferred\n      if (param1.hasAny) {\n        if (!param2.hasAny) {\n          return 1;\n        }\n      } else if (param2.hasAny) {\n        return -1;\n      } // 2) Prefer non-rest to rest parameters\n\n\n      if (param1.restParam) {\n        if (!param2.restParam) {\n          return 1;\n        }\n      } else if (param2.restParam) {\n        return -1;\n      } // 3) Prefer exact type match to conversions\n\n\n      if (param1.hasConversion) {\n        if (!param2.hasConversion) {\n          return 1;\n        }\n      } else if (param2.hasConversion) {\n        return -1;\n      } // 4) Prefer lower type index:\n\n\n      const typeDiff = getLowestTypeIndex(param1) - getLowestTypeIndex(param2);\n\n      if (typeDiff < 0) {\n        return -1;\n      }\n\n      if (typeDiff > 0) {\n        return 1;\n      } // 5) Prefer lower conversion index\n\n\n      const convDiff = getLowestConversionIndex(param1) - getLowestConversionIndex(param2);\n\n      if (convDiff < 0) {\n        return -1;\n      }\n\n      if (convDiff > 0) {\n        return 1;\n      } // Don't have a basis for preference\n\n\n      return 0;\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\n\n    function compareSignatures(signature1, signature2) {\n      const pars1 = signature1.params;\n      const pars2 = signature2.params;\n      const last1 = last(pars1);\n      const last2 = last(pars2);\n      const hasRest1 = hasRestParam(pars1);\n      const hasRest2 = hasRestParam(pars2); // We compare a number of metrics on signatures in turn:\n      // 1) An \"any rest param\" is least preferred\n\n      if (hasRest1 && last1.hasAny) {\n        if (!hasRest2 || !last2.hasAny) {\n          return 1;\n        }\n      } else if (hasRest2 && last2.hasAny) {\n        return -1;\n      } // 2) Minimize the number of 'any' parameters\n\n\n      let any1 = 0;\n      let conv1 = 0;\n      let par;\n\n      for (par of pars1) {\n        if (par.hasAny) ++any1;\n        if (par.hasConversion) ++conv1;\n      }\n\n      let any2 = 0;\n      let conv2 = 0;\n\n      for (par of pars2) {\n        if (par.hasAny) ++any2;\n        if (par.hasConversion) ++conv2;\n      }\n\n      if (any1 !== any2) {\n        return any1 - any2;\n      } // 3) A conversion rest param is less preferred\n\n\n      if (hasRest1 && last1.hasConversion) {\n        if (!hasRest2 || !last2.hasConversion) {\n          return 1;\n        }\n      } else if (hasRest2 && last2.hasConversion) {\n        return -1;\n      } // 4) Minimize the number of conversions\n\n\n      if (conv1 !== conv2) {\n        return conv1 - conv2;\n      } // 5) Prefer no rest param\n\n\n      if (hasRest1) {\n        if (!hasRest2) {\n          return 1;\n        }\n      } else if (hasRest2) {\n        return -1;\n      } // 6) Prefer shorter with rest param, longer without\n\n\n      const lengthCriterion = (pars1.length - pars2.length) * (hasRest1 ? -1 : 1);\n\n      if (lengthCriterion !== 0) {\n        return lengthCriterion;\n      } // Signatures are identical in each of the above metrics.\n      // In particular, they are the same length.\n      // We can therefore compare the parameters one by one.\n      // First we count which signature has more preferred parameters.\n\n\n      const comparisons = [];\n      let tc = 0;\n\n      for (let i = 0; i < pars1.length; ++i) {\n        const thisComparison = compareParams(pars1[i], pars2[i]);\n        comparisons.push(thisComparison);\n        tc += thisComparison;\n      }\n\n      if (tc !== 0) {\n        return tc;\n      } // They have the same number of preferred parameters, so go by the\n      // earliest parameter in which we have a preference.\n      // In other words, dispatch is driven somewhat more by earlier\n      // parameters than later ones.\n\n\n      let c;\n\n      for (c of comparisons) {\n        if (c !== 0) {\n          return c;\n        }\n      } // It's a tossup:\n\n\n      return 0;\n    }\n    /**\n     * Produce a list of all conversions from distinct types to one of\n     * the given types.\n     *\n     * @param {string[]} typeNames\n     * @return {ConversionDef[]} Returns the conversions that are available\n     *                        resulting in any given type (if any)\n     */\n\n\n    function availableConversions(typeNames) {\n      if (typeNames.length === 0) {\n        return [];\n      }\n\n      const types = typeNames.map(findType);\n\n      if (typeNames.length > 1) {\n        types.sort((t1, t2) => t1.index - t2.index);\n      }\n\n      let matches = types[0].conversionsTo;\n\n      if (typeNames.length === 1) {\n        return matches;\n      }\n\n      matches = matches.concat([]); // shallow copy the matches\n      // Since the types are now in index order, we just want the first\n      // occurrence of any from type:\n\n      const knownTypes = new Set(typeNames);\n\n      for (let i = 1; i < types.length; ++i) {\n        let newMatch;\n\n        for (newMatch of types[i].conversionsTo) {\n          if (!knownTypes.has(newMatch.from)) {\n            matches.push(newMatch);\n            knownTypes.add(newMatch.from);\n          }\n        }\n      }\n\n      return matches;\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\n\n    function compileArgsPreprocessing(params, fn) {\n      let fnConvert = fn; // TODO: can we make this wrapper function smarter/simpler?\n\n      if (params.some(p => p.hasConversion)) {\n        const restParam = hasRestParam(params);\n        const compiledConversions = params.map(compileArgConversion);\n\n        fnConvert = function convertArgs() {\n          const args = [];\n          const last = restParam ? arguments.length - 1 : arguments.length;\n\n          for (let i = 0; i < last; i++) {\n            args[i] = compiledConversions[i](arguments[i]);\n          }\n\n          if (restParam) {\n            args[last] = arguments[last].map(compiledConversions[last]);\n          }\n\n          return fn.apply(this, args);\n        };\n      }\n\n      let fnPreprocess = fnConvert;\n\n      if (hasRestParam(params)) {\n        const offset = params.length - 1;\n\n        fnPreprocess = function preprocessRestParams() {\n          return fnConvert.apply(this, slice(arguments, 0, offset).concat([slice(arguments, offset)]));\n        };\n      }\n\n      return fnPreprocess;\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\n\n    function compileArgConversion(param) {\n      let test0, test1, conversion0, conversion1;\n      const tests = [];\n      const conversions = [];\n      param.types.forEach(function (type) {\n        if (type.conversion) {\n          tests.push(findType(type.conversion.from).test);\n          conversions.push(type.conversion.convert);\n        }\n      }); // create optimized conversion functions depending on the number of conversions\n\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\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\n            if (test1(arg)) {\n              return conversion1(arg);\n            }\n\n            return arg;\n          };\n\n        default:\n          return function convertArg(arg) {\n            for (let i = 0; i < conversions.length; i++) {\n              if (tests[i](arg)) {\n                return conversions[i](arg);\n              }\n            }\n\n            return arg;\n          };\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     * @return {Param[]}\n     */\n\n\n    function splitParams(params) {\n      function _splitParams(params, index, paramsSoFar) {\n        if (index < params.length) {\n          const param = params[index];\n          let resultingParams = [];\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            const exactTypes = param.types.filter(isExactType);\n\n            if (exactTypes.length < param.types.length) {\n              resultingParams.push({\n                types: exactTypes,\n                name: '...' + exactTypes.map(t => t.name).join('|'),\n                hasAny: exactTypes.some(t => t.isAny),\n                hasConversion: false,\n                restParam: true\n              });\n            }\n\n            resultingParams.push(param);\n          } else {\n            // split all the types of a regular parameter into one type per param\n            resultingParams = param.types.map(function (type) {\n              return {\n                types: [type],\n                name: type.name,\n                hasAny: type.isAny,\n                hasConversion: type.conversion,\n                restParam: false\n              };\n            });\n          } // recurse over the groups with types\n\n\n          return flatMap(resultingParams, function (nextParam) {\n            return _splitParams(params, index + 1, paramsSoFar.concat([nextParam]));\n          });\n        } else {\n          // we've reached the end of the parameters.\n          return [paramsSoFar];\n        }\n      }\n\n      return _splitParams(params, 0, []);\n    }\n    /**\n     * Test whether two param lists represent conflicting signatures\n     * @param {Param[]} params1\n     * @param {Param[]} params2\n     * @return {boolean} Returns true when the signatures conflict, false otherwise.\n     */\n\n\n    function conflicting(params1, params2) {\n      const ii = Math.max(params1.length, params2.length);\n\n      for (let i = 0; i < ii; i++) {\n        const typeSet1 = getTypeSetAtIndex(params1, i);\n        const typeSet2 = getTypeSetAtIndex(params2, i);\n        let overlap = false;\n        let name;\n\n        for (name of typeSet2) {\n          if (typeSet1.has(name)) {\n            overlap = true;\n            break;\n          }\n        }\n\n        if (!overlap) {\n          return false;\n        }\n      }\n\n      const len1 = params1.length;\n      const len2 = params2.length;\n      const restParam1 = hasRestParam(params1);\n      const restParam2 = hasRestParam(params2);\n      return restParam1 ? restParam2 ? len1 === len2 : len2 >= len1 : restParam2 ? len1 >= len2 : len1 === len2;\n    }\n    /**\n     * Helper function for `resolveReferences` that returns a copy of\n     * functionList wihe any prior resolutions cleared out, in case we are\n     * recycling signatures from a prior typed function construction.\n     *\n     * @param {Array.<function|typed-reference>} functionList\n     * @return {Array.<function|typed-reference>}\n     */\n\n\n    function clearResolutions(functionList) {\n      return functionList.map(fn => {\n        if (isReferToSelf(fn)) {\n          return referToSelf(fn.referToSelf.callback);\n        }\n\n        if (isReferTo(fn)) {\n          return makeReferTo(fn.referTo.references, fn.referTo.callback);\n        }\n\n        return fn;\n      });\n    }\n    /**\n     * Take a list of references, a list of functions functionList, and a\n     * signatureMap indexing signatures into functionList, and return\n     * the list of resolutions, or a false-y value if they don't all\n     * resolve in a valid way (yet).\n     *\n     * @param {string[]} references\n     * @param {Array<function|typed-reference} functionList\n     * @param {Object.<string, integer>} signatureMap\n     * @return {function[] | false} resolutions\n     */\n\n\n    function collectResolutions(references, functionList, signatureMap) {\n      const resolvedReferences = [];\n      let reference;\n\n      for (reference of references) {\n        let resolution = signatureMap[reference];\n\n        if (typeof resolution !== 'number') {\n          throw new TypeError('No definition for referenced signature \"' + reference + '\"');\n        }\n\n        resolution = functionList[resolution];\n\n        if (typeof resolution !== 'function') {\n          return false;\n        }\n\n        resolvedReferences.push(resolution);\n      }\n\n      return resolvedReferences;\n    }\n    /**\n     * Resolve any references in the functionList for the typed function\n     * itself. The signatureMap tells which index in the functionList a\n     * given signature should be mapped to (for use in resolving typed.referTo)\n     * and self provides the destions of a typed.referToSelf.\n     *\n     * @param {Array<function | typed-reference-object>} functionList\n     * @param {Object.<string, function>} signatureMap\n     * @param {function} self  The typed-function itself\n     * @return {Array<function>} The list of resolved functions\n     */\n\n\n    function resolveReferences(functionList, signatureMap, self) {\n      const resolvedFunctions = clearResolutions(functionList);\n      const isResolved = new Array(resolvedFunctions.length).fill(false);\n      let leftUnresolved = true;\n\n      while (leftUnresolved) {\n        leftUnresolved = false;\n        let nothingResolved = true;\n\n        for (let i = 0; i < resolvedFunctions.length; ++i) {\n          if (isResolved[i]) continue;\n          const fn = resolvedFunctions[i];\n\n          if (isReferToSelf(fn)) {\n            resolvedFunctions[i] = fn.referToSelf.callback(self); // Preserve reference in case signature is reused someday:\n\n            resolvedFunctions[i].referToSelf = fn.referToSelf;\n            isResolved[i] = true;\n            nothingResolved = false;\n          } else if (isReferTo(fn)) {\n            const resolvedReferences = collectResolutions(fn.referTo.references, resolvedFunctions, signatureMap);\n\n            if (resolvedReferences) {\n              resolvedFunctions[i] = fn.referTo.callback.apply(this, resolvedReferences); // Preserve reference in case signature is reused someday:\n\n              resolvedFunctions[i].referTo = fn.referTo;\n              isResolved[i] = true;\n              nothingResolved = false;\n            } else {\n              leftUnresolved = true;\n            }\n          }\n        }\n\n        if (nothingResolved && leftUnresolved) {\n          throw new SyntaxError('Circular reference detected in resolving typed.referTo');\n        }\n      }\n\n      return resolvedFunctions;\n    }\n    /**\n     * Validate whether any of the function bodies contains a self-reference\n     * usage like `this(...)` or `this.signatures`. This self-referencing is\n     * deprecated since typed-function v3. It has been replaced with\n     * the functions typed.referTo and typed.referToSelf.\n     * @param {Object.<string, function>} signaturesMap\n     */\n\n\n    function validateDeprecatedThis(signaturesMap) {\n      // TODO: remove this deprecation warning logic some day (it's introduced in v3)\n      // match occurrences like 'this(' and 'this.signatures'\n      const deprecatedThisRegex = /\\bthis(\\(|\\.signatures\\b)/;\n      Object.keys(signaturesMap).forEach(signature => {\n        const fn = signaturesMap[signature];\n\n        if (deprecatedThisRegex.test(fn.toString())) {\n          throw new SyntaxError('Using `this` to self-reference a function ' + 'is deprecated since typed-function@3. ' + 'Use typed.referTo and typed.referToSelf instead.');\n        }\n      });\n    }\n    /**\n     * Create a typed function\n     * @param {String} name               The name for the typed function\n     * @param {Object.<string, function>} rawSignaturesMap\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\n\n    function createTypedFunction(name, rawSignaturesMap) {\n      typed.createCount++;\n\n      if (Object.keys(rawSignaturesMap).length === 0) {\n        throw new SyntaxError('No signatures provided');\n      }\n\n      if (typed.warnAgainstDeprecatedThis) {\n        validateDeprecatedThis(rawSignaturesMap);\n      } // Main processing loop for signatures\n\n\n      const parsedParams = [];\n      const originalFunctions = [];\n      const signaturesMap = {};\n      const preliminarySignatures = []; // may have duplicates from conversions\n\n      let signature;\n\n      for (signature in rawSignaturesMap) {\n        // A) Protect against polluted Object prototype:\n        if (!Object.prototype.hasOwnProperty.call(rawSignaturesMap, signature)) {\n          continue;\n        } // B) Parse the signature\n\n\n        const params = parseSignature(signature);\n        if (!params) continue; // C) Check for conflicts\n\n        parsedParams.forEach(function (pp) {\n          if (conflicting(pp, params)) {\n            throw new TypeError('Conflicting signatures \"' + stringifyParams(pp) + '\" and \"' + stringifyParams(params) + '\".');\n          }\n        });\n        parsedParams.push(params); // D) Store the provided function and add conversions\n\n        const functionIndex = originalFunctions.length;\n        originalFunctions.push(rawSignaturesMap[signature]);\n        const conversionParams = params.map(expandParam); // E) Split the signatures and collect them up\n\n        let sp;\n\n        for (sp of splitParams(conversionParams)) {\n          const spName = stringifyParams(sp);\n          preliminarySignatures.push({\n            params: sp,\n            name: spName,\n            fn: functionIndex\n          });\n\n          if (sp.every(p => !p.hasConversion)) {\n            signaturesMap[spName] = functionIndex;\n          }\n        }\n      }\n\n      preliminarySignatures.sort(compareSignatures); // Note the forward reference to theTypedFn\n\n      const resolvedFunctions = resolveReferences(originalFunctions, signaturesMap, theTypedFn); // Fill in the proper function for each signature\n\n      let s;\n\n      for (s in signaturesMap) {\n        if (Object.prototype.hasOwnProperty.call(signaturesMap, s)) {\n          signaturesMap[s] = resolvedFunctions[signaturesMap[s]];\n        }\n      }\n\n      const signatures = [];\n      const internalSignatureMap = new Map(); // benchmarks faster than object\n\n      for (s of preliminarySignatures) {\n        // Note it's only safe to eliminate duplicates like this\n        // _after_ the signature sorting step above; otherwise we might\n        // remove the wrong one.\n        if (!internalSignatureMap.has(s.name)) {\n          s.fn = resolvedFunctions[s.fn];\n          signatures.push(s);\n          internalSignatureMap.set(s.name, s);\n        }\n      } // we create a highly optimized checks for the first couple of signatures with max 2 arguments\n\n\n      const ok0 = signatures[0] && signatures[0].params.length <= 2 && !hasRestParam(signatures[0].params);\n      const ok1 = signatures[1] && signatures[1].params.length <= 2 && !hasRestParam(signatures[1].params);\n      const ok2 = signatures[2] && signatures[2].params.length <= 2 && !hasRestParam(signatures[2].params);\n      const ok3 = signatures[3] && signatures[3].params.length <= 2 && !hasRestParam(signatures[3].params);\n      const ok4 = signatures[4] && signatures[4].params.length <= 2 && !hasRestParam(signatures[4].params);\n      const ok5 = signatures[5] && signatures[5].params.length <= 2 && !hasRestParam(signatures[5].params);\n      const allOk = ok0 && ok1 && ok2 && ok3 && ok4 && ok5; // compile the tests\n\n      for (let i = 0; i < signatures.length; ++i) {\n        signatures[i].test = compileTests(signatures[i].params);\n      }\n\n      const test00 = ok0 ? compileTest(signatures[0].params[0]) : notOk;\n      const test10 = ok1 ? compileTest(signatures[1].params[0]) : notOk;\n      const test20 = ok2 ? compileTest(signatures[2].params[0]) : notOk;\n      const test30 = ok3 ? compileTest(signatures[3].params[0]) : notOk;\n      const test40 = ok4 ? compileTest(signatures[4].params[0]) : notOk;\n      const test50 = ok5 ? compileTest(signatures[5].params[0]) : notOk;\n      const test01 = ok0 ? compileTest(signatures[0].params[1]) : notOk;\n      const test11 = ok1 ? compileTest(signatures[1].params[1]) : notOk;\n      const test21 = ok2 ? compileTest(signatures[2].params[1]) : notOk;\n      const test31 = ok3 ? compileTest(signatures[3].params[1]) : notOk;\n      const test41 = ok4 ? compileTest(signatures[4].params[1]) : notOk;\n      const test51 = ok5 ? compileTest(signatures[5].params[1]) : notOk; // compile the functions\n\n      for (let i = 0; i < signatures.length; ++i) {\n        signatures[i].implementation = compileArgsPreprocessing(signatures[i].params, signatures[i].fn);\n      }\n\n      const fn0 = ok0 ? signatures[0].implementation : undef;\n      const fn1 = ok1 ? signatures[1].implementation : undef;\n      const fn2 = ok2 ? signatures[2].implementation : undef;\n      const fn3 = ok3 ? signatures[3].implementation : undef;\n      const fn4 = ok4 ? signatures[4].implementation : undef;\n      const fn5 = ok5 ? signatures[5].implementation : undef;\n      const len0 = ok0 ? signatures[0].params.length : -1;\n      const len1 = ok1 ? signatures[1].params.length : -1;\n      const len2 = ok2 ? signatures[2].params.length : -1;\n      const len3 = ok3 ? signatures[3].params.length : -1;\n      const len4 = ok4 ? signatures[4].params.length : -1;\n      const len5 = ok5 ? signatures[5].params.length : -1; // simple and generic, but also slow\n\n      const iStart = allOk ? 6 : 0;\n      const iEnd = signatures.length; // de-reference ahead for execution speed:\n\n      const tests = signatures.map(s => s.test);\n      const fns = signatures.map(s => s.implementation);\n\n      const generic = function generic() {\n\n        for (let i = iStart; i < iEnd; i++) {\n          if (tests[i](arguments)) {\n            return fns[i].apply(this, arguments);\n          }\n        }\n\n        return typed.onMismatch(name, arguments, signatures);\n      }; // create the typed function\n      // fast, specialized version. Falls back to the slower, generic one if needed\n\n\n      function theTypedFn(arg0, arg1) {\n\n        if (arguments.length === len0 && test00(arg0) && test01(arg1)) {\n          return fn0.apply(this, arguments);\n        }\n\n        if (arguments.length === len1 && test10(arg0) && test11(arg1)) {\n          return fn1.apply(this, arguments);\n        }\n\n        if (arguments.length === len2 && test20(arg0) && test21(arg1)) {\n          return fn2.apply(this, arguments);\n        }\n\n        if (arguments.length === len3 && test30(arg0) && test31(arg1)) {\n          return fn3.apply(this, arguments);\n        }\n\n        if (arguments.length === len4 && test40(arg0) && test41(arg1)) {\n          return fn4.apply(this, arguments);\n        }\n\n        if (arguments.length === len5 && test50(arg0) && test51(arg1)) {\n          return fn5.apply(this, arguments);\n        }\n\n        return generic.apply(this, arguments);\n      } // attach name the typed function\n\n\n      try {\n        Object.defineProperty(theTypedFn, 'name', {\n          value: name\n        });\n      } catch (err) {// 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      } // attach signatures to the function.\n      // This property is close to the original collection of signatures\n      // used to create the typed-function, just with unions split:\n\n\n      theTypedFn.signatures = signaturesMap; // Store internal data for functions like resolve, find, etc.\n      // Also serves as the flag that this is a typed-function\n\n      theTypedFn._typedFunctionData = {\n        signatures,\n        signatureMap: internalSignatureMap\n      };\n      return theTypedFn;\n    }\n    /**\n     * Action to take on mismatch\n     * @param {string} name      Name of function that was attempted to be called\n     * @param {Array} args       Actual arguments to the call\n     * @param {Array} signatures Known signatures of the named typed-function\n     */\n\n\n    function _onMismatch(name, args, signatures) {\n      throw createError(name, args, signatures);\n    }\n    /**\n     * Return all but the last items of an array or function Arguments\n     * @param {Array | Arguments} arr\n     * @return {Array}\n     */\n\n\n    function initial(arr) {\n      return slice(arr, 0, arr.length - 1);\n    }\n    /**\n     * return the last item of an array or function Arguments\n     * @param {Array | Arguments} arr\n     * @return {*}\n     */\n\n\n    function last(arr) {\n      return arr[arr.length - 1];\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\n\n    function slice(arr, start, end) {\n      return Array.prototype.slice.call(arr, start, end);\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\n\n    function findInArray(arr, test) {\n      for (let i = 0; i < arr.length; i++) {\n        if (test(arr[i])) {\n          return arr[i];\n        }\n      }\n\n      return undefined;\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\n\n    function flatMap(arr, callback) {\n      return Array.prototype.concat.apply([], arr.map(callback));\n    }\n    /**\n     * Create a reference callback to one or multiple signatures\n     *\n     * Syntax:\n     *\n     *     typed.referTo(signature1, signature2, ..., function callback(fn1, fn2, ...) {\n     *       // ...\n     *     })\n     *\n     * @returns {{referTo: {references: string[], callback}}}\n     */\n\n\n    function referTo() {\n      const references = initial(arguments).map(s => stringifyParams(parseSignature(s)));\n      const callback = last(arguments);\n\n      if (typeof callback !== 'function') {\n        throw new TypeError('Callback function expected as last argument');\n      }\n\n      return makeReferTo(references, callback);\n    }\n\n    function makeReferTo(references, callback) {\n      return {\n        referTo: {\n          references,\n          callback\n        }\n      };\n    }\n    /**\n     * Create a reference callback to the typed-function itself\n     *\n     * @param {(self: function) => function} callback\n     * @returns {{referToSelf: { callback: function }}}\n     */\n\n\n    function referToSelf(callback) {\n      if (typeof callback !== 'function') {\n        throw new TypeError('Callback function expected as first argument');\n      }\n\n      return {\n        referToSelf: {\n          callback\n        }\n      };\n    }\n    /**\n     * Test whether something is a referTo object, holding a list with reference\n     * signatures and a callback.\n     *\n     * @param {Object | function} objectOrFn\n     * @returns {boolean}\n     */\n\n\n    function isReferTo(objectOrFn) {\n      return objectOrFn && typeof objectOrFn.referTo === 'object' && Array.isArray(objectOrFn.referTo.references) && typeof objectOrFn.referTo.callback === 'function';\n    }\n    /**\n     * Test whether something is a referToSelf object, holding a callback where\n     * to pass `self`.\n     *\n     * @param {Object | function} objectOrFn\n     * @returns {boolean}\n     */\n\n\n    function isReferToSelf(objectOrFn) {\n      return objectOrFn && typeof objectOrFn.referToSelf === 'object' && typeof objectOrFn.referToSelf.callback === 'function';\n    }\n    /**\n     * Check if name is (A) new, (B) a match, or (C) a mismatch; and throw\n     * an error in case (C).\n     *\n     * @param { string | undefined } nameSoFar\n     * @param { string | undefined } newName\n     * @returns { string } updated name\n     */\n\n\n    function checkName(nameSoFar, newName) {\n      if (!nameSoFar) {\n        return newName;\n      }\n\n      if (newName && newName !== nameSoFar) {\n        const err = new Error('Function names do not match (expected: ' + nameSoFar + ', actual: ' + newName + ')');\n        err.data = {\n          actual: newName,\n          expected: nameSoFar\n        };\n        throw err;\n      }\n\n      return nameSoFar;\n    }\n    /**\n     * Retrieve the implied name from an object with signature keys\n     * and function values, checking whether all value names match\n     *\n     * @param { {string: function} } obj\n     */\n\n\n    function getObjectName(obj) {\n      let name;\n\n      for (const key in obj) {\n        // Only pay attention to own properties, and only if their values\n        // are typed functions or functions with a signature property\n        if (Object.prototype.hasOwnProperty.call(obj, key) && (isTypedFunction(obj[key]) || typeof obj[key].signature === 'string')) {\n          name = checkName(name, obj[key].name);\n        }\n      }\n\n      return name;\n    }\n    /**\n     * Copy all of the signatures from the second argument into the first,\n     * which is modified by side effect, checking for conflicts\n     *\n     * @param {Object.<string, function|typed-reference>} dest\n     * @param {Object.<string, function|typed-reference>} source\n     */\n\n\n    function mergeSignatures(dest, source) {\n      let key;\n\n      for (key in source) {\n        if (Object.prototype.hasOwnProperty.call(source, key)) {\n          if (key in dest) {\n            if (source[key] !== dest[key]) {\n              const err = new Error('Signature \"' + key + '\" is defined twice');\n              err.data = {\n                signature: key,\n                sourceFunction: source[key],\n                destFunction: dest[key]\n              };\n              throw err;\n            } // else: both signatures point to the same function, that's fine\n\n          }\n\n          dest[key] = source[key];\n        }\n      }\n    }\n\n    const saveTyped = typed;\n    /**\n     * Originally the main function was a typed function itself, but then\n     * it might not be able to generate error messages if the client\n     * replaced the type system with different names.\n     *\n     * Main entry: typed([name], functions/objects with signatures...)\n     *\n     * Assembles and returns a new typed-function from the given items\n     * that provide signatures and implementations, each of which may be\n     * * a plain object mapping (string) signatures to implementing functions,\n     * * a previously constructed typed function, or\n     * * any other single function with a string-valued property `signature`.\n      * The name of the resulting typed-function will be given by the\n     * string-valued name argument if present, or if not, by the name\n     * of any of the arguments that have one, as long as any that do are\n     * consistent with each other. If no name is specified, the name will be\n     * an empty string.\n     *\n     * @param {string} maybeName [optional]\n     * @param {(function|object)[]} signature providers\n     * @returns {typed-function}\n     */\n\n    typed = function (maybeName) {\n      const named = typeof maybeName === 'string';\n      const start = named ? 1 : 0;\n      let name = named ? maybeName : '';\n      const allSignatures = {};\n\n      for (let i = start; i < arguments.length; ++i) {\n        const item = arguments[i];\n        let theseSignatures = {};\n        let thisName;\n\n        if (typeof item === 'function') {\n          thisName = item.name;\n\n          if (typeof item.signature === 'string') {\n            // Case 1: Ordinary function with a string 'signature' property\n            theseSignatures[item.signature] = item;\n          } else if (isTypedFunction(item)) {\n            // Case 2: Existing typed function\n            theseSignatures = item.signatures;\n          }\n        } else if (isPlainObject(item)) {\n          // Case 3: Plain object, assume keys = signatures, values = functions\n          theseSignatures = item;\n\n          if (!named) {\n            thisName = getObjectName(item);\n          }\n        }\n\n        if (Object.keys(theseSignatures).length === 0) {\n          const err = new TypeError('Argument to \\'typed\\' at index ' + i + ' is not a (typed) function, ' + 'nor an object with signatures as keys and functions as values.');\n          err.data = {\n            index: i,\n            argument: item\n          };\n          throw err;\n        }\n\n        if (!named) {\n          name = checkName(name, thisName);\n        }\n\n        mergeSignatures(allSignatures, theseSignatures);\n      }\n\n      return createTypedFunction(name || '', allSignatures);\n    };\n\n    typed.create = create;\n    typed.createCount = saveTyped.createCount;\n    typed.onMismatch = _onMismatch;\n    typed.throwMismatchError = _onMismatch;\n    typed.createError = createError;\n    typed.clear = clear;\n    typed.clearConversions = clearConversions;\n    typed.addTypes = addTypes;\n    typed._findType = findType; // For unit testing only\n\n    typed.referTo = referTo;\n    typed.referToSelf = referToSelf;\n    typed.convert = convert;\n    typed.findSignature = findSignature;\n    typed.find = find;\n    typed.isTypedFunction = isTypedFunction;\n    typed.warnAgainstDeprecatedThis = true;\n    /**\n     * add a type (convenience wrapper for typed.addTypes)\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\n    typed.addType = function (type, beforeObjectTest) {\n      let before = 'any';\n\n      if (beforeObjectTest !== false && typeMap.has('Object')) {\n        before = 'Object';\n      }\n\n      typed.addTypes([type], before);\n    };\n    /**\n     * Verify that the ConversionDef conversion has a valid format.\n     *\n     * @param {conversionDef} conversion\n     * @return {void}\n     * @throws {TypeError|SyntaxError}\n     */\n\n\n    function _validateConversion(conversion) {\n      if (!conversion || typeof conversion.from !== 'string' || typeof conversion.to !== 'string' || typeof conversion.convert !== 'function') {\n        throw new TypeError('Object with properties {from: string, to: string, convert: function} expected');\n      }\n\n      if (conversion.to === conversion.from) {\n        throw new SyntaxError('Illegal to define conversion from \"' + conversion.from + '\" to itself.');\n      }\n    }\n    /**\n     * Add a conversion\n     *\n     * @param {ConversionDef} conversion\n     * @returns {void}\n     * @throws {TypeError}\n     */\n\n\n    typed.addConversion = function (conversion) {\n      _validateConversion(conversion);\n\n      const to = findType(conversion.to);\n\n      if (to.conversionsTo.every(function (other) {\n        return other.from !== conversion.from;\n      })) {\n        to.conversionsTo.push({\n          from: conversion.from,\n          convert: conversion.convert,\n          index: nConversions++\n        });\n      } else {\n        throw new Error('There is already a conversion from \"' + conversion.from + '\" to \"' + to.name + '\"');\n      }\n    };\n    /**\n     * Convenience wrapper to call addConversion on each conversion in a list.\n     *\n     @param {ConversionDef[]} conversions\n     @returns {void}\n     @throws {TypeError}\n     */\n\n\n    typed.addConversions = function (conversions) {\n      conversions.forEach(typed.addConversion);\n    };\n    /**\n     * Remove the specified conversion. The format is the same as for\n     * addConversion, and the convert function must match or an error\n     * is thrown.\n     *\n     * @param {{from: string, to: string, convert: function}} conversion\n     * @returns {void}\n     * @throws {TypeError|SyntaxError|Error}\n     */\n\n\n    typed.removeConversion = function (conversion) {\n      _validateConversion(conversion);\n\n      const to = findType(conversion.to);\n      const existingConversion = findInArray(to.conversionsTo, c => c.from === conversion.from);\n\n      if (!existingConversion) {\n        throw new Error('Attempt to remove nonexistent conversion from ' + conversion.from + ' to ' + conversion.to);\n      }\n\n      if (existingConversion.convert !== conversion.convert) {\n        throw new Error('Conversion to remove does not match existing conversion');\n      }\n\n      const index = to.conversionsTo.indexOf(existingConversion);\n      to.conversionsTo.splice(index, 1);\n    };\n    /**\n     * Produce the specific signature that a typed function\n     * will execute on the given arguments. Here, a \"signature\" is an\n     * object with properties 'params', 'test', 'fn', and 'implementation'.\n     * This last property is a function that converts params as necessary\n     * and then calls 'fn'. Returns null if there is no matching signature.\n     * @param {typed-function} tf\n     * @param {any[]} argList\n     * @returns {{params: string, test: function, fn: function, implementation: function}}\n     */\n\n\n    typed.resolve = function (tf, argList) {\n      if (!isTypedFunction(tf)) {\n        throw new TypeError(NOT_TYPED_FUNCTION);\n      }\n\n      const sigs = tf._typedFunctionData.signatures;\n\n      for (let i = 0; i < sigs.length; ++i) {\n        if (sigs[i].test(argList)) {\n          return sigs[i];\n        }\n      }\n\n      return null;\n    };\n\n    return typed;\n  }\n\n  var typedFunction = create();\n\n  return typedFunction;\n\n}));\n//# sourceMappingURL=typed-function.js.map\n","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.cbrt = exports.atanh = exports.asinh = exports.acosh = exports.DBL_EPSILON = void 0;\nexports.copysign = copysign;\nexports.cosh = void 0;\nexports.digits = digits;\nexports.expm1 = void 0;\nexports.format = format;\nexports.isInteger = isInteger;\nexports.log2 = exports.log1p = exports.log10 = void 0;\nexports.nearlyEqual = nearlyEqual;\nexports.roundDigits = roundDigits;\nexports.sinh = exports.sign = void 0;\nexports.splitNumber = splitNumber;\nexports.tanh = void 0;\nexports.toEngineering = toEngineering;\nexports.toExponential = toExponential;\nexports.toFixed = toFixed;\nexports.toPrecision = toPrecision;\nvar _is = require(\"./is.js\");\n/**\n * @typedef {{sign: '+' | '-' | '', coefficients: number[], exponent: number}} SplitValue\n */\n\n/**\n * Check if a number is integer\n * @param {number | boolean} value\n * @return {boolean} isInteger\n */\nfunction isInteger(value) {\n  if (typeof value === 'boolean') {\n    return true;\n  }\n  return isFinite(value) ? value === Math.round(value) : false;\n}\n\n/**\n * Calculate the sign of a number\n * @param {number} x\n * @returns {number}\n */\nvar sign = /* #__PURE__ */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/**\n * Calculate the base-2 logarithm of a number\n * @param {number} x\n * @returns {number}\n */\nexports.sign = sign;\nvar log2 = /* #__PURE__ */Math.log2 || function log2(x) {\n  return Math.log(x) / Math.LN2;\n};\n\n/**\n * Calculate the base-10 logarithm of a number\n * @param {number} x\n * @returns {number}\n */\nexports.log2 = log2;\nvar log10 = /* #__PURE__ */Math.log10 || function log10(x) {\n  return Math.log(x) / Math.LN10;\n};\n\n/**\n * Calculate the natural logarithm of a number + 1\n * @param {number} x\n * @returns {number}\n */\nexports.log10 = log10;\nvar log1p = /* #__PURE__ */Math.log1p || function (x) {\n  return Math.log(x + 1);\n};\n\n/**\n * Calculate cubic root 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} Returns the cubic root of x\n */\nexports.log1p = log1p;\nvar cbrt = /* #__PURE__ */Math.cbrt || function cbrt(x) {\n  if (x === 0) {\n    return x;\n  }\n  var negate = x < 0;\n  var result;\n  if (negate) {\n    x = -x;\n  }\n  if (isFinite(x)) {\n    result = Math.exp(Math.log(x) / 3);\n    // from https://en.wikipedia.org/wiki/Cube_root#Numerical_methods\n    result = (x / (result * result) + 2 * result) / 3;\n  } else {\n    result = x;\n  }\n  return negate ? -result : result;\n};\n\n/**\n * Calculates exponentiation minus 1\n * @param {number} x\n * @return {number} res\n */\nexports.cbrt = cbrt;\nvar expm1 = /* #__PURE__ */Math.expm1 || 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/**\n * Formats a number in a given base\n * @param {number} n\n * @param {number} base\n * @param {number} size\n * @returns {string}\n */\nexports.expm1 = expm1;\nfunction formatNumberToBase(n, base, size) {\n  var prefixes = {\n    2: '0b',\n    8: '0o',\n    16: '0x'\n  };\n  var prefix = prefixes[base];\n  var suffix = '';\n  if (size) {\n    if (size < 1) {\n      throw new Error('size must be in greater than 0');\n    }\n    if (!isInteger(size)) {\n      throw new Error('size must be an integer');\n    }\n    if (n > Math.pow(2, size - 1) - 1 || n < -Math.pow(2, size - 1)) {\n      throw new Error(\"Value must be in range [-2^\".concat(size - 1, \", 2^\").concat(size - 1, \"-1]\"));\n    }\n    if (!isInteger(n)) {\n      throw new Error('Value must be an integer');\n    }\n    if (n < 0) {\n      n = n + Math.pow(2, size);\n    }\n    suffix = \"i\".concat(size);\n  }\n  var sign = '';\n  if (n < 0) {\n    n = -n;\n    sign = '-';\n  }\n  return \"\".concat(sign).concat(prefix).concat(n.toString(base)).concat(suffix);\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 *                         'bin', 'oct, or\n *                         'hex'            Format the number using binary, octal,\n *                                          or hexadecimal notation.\n *                                          For example '0b1101' and '0x10fe'.\n *                     {number} wordSize    The word size in bits to use for formatting\n *                                          in binary, octal, or hexadecimal notation.\n *                                          To be used only with 'bin', 'oct', or 'hex'\n *                                          values for 'notation' option. When this option\n *                                          is defined the value is formatted as a signed\n *                                          twos complement integer of the given word size\n *                                          and the size suffix is appended to the output.\n *                                          For example\n *                                          format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.\n *                                          Default value is undefined.\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 */\nfunction format(value, options) {\n  if (typeof options === 'function') {\n    // handle format(value, fn)\n    return options(value);\n  }\n\n  // handle special cases\n  if (value === Infinity) {\n    return 'Infinity';\n  } else if (value === -Infinity) {\n    return '-Infinity';\n  } else if (isNaN(value)) {\n    return 'NaN';\n  }\n\n  // default values for options\n  var notation = 'auto';\n  var precision;\n  var wordSize;\n  if (options) {\n    // determine notation from options\n    if (options.notation) {\n      notation = options.notation;\n    }\n\n    // determine precision from options\n    if ((0, _is.isNumber)(options)) {\n      precision = options;\n    } else if ((0, _is.isNumber)(options.precision)) {\n      precision = options.precision;\n    }\n    if (options.wordSize) {\n      wordSize = options.wordSize;\n      if (typeof wordSize !== 'number') {\n        throw new Error('Option \"wordSize\" must be a number');\n      }\n    }\n  }\n\n  // handle the various notations\n  switch (notation) {\n    case 'fixed':\n      return toFixed(value, precision);\n    case 'exponential':\n      return toExponential(value, precision);\n    case 'engineering':\n      return toEngineering(value, precision);\n    case 'bin':\n      return formatNumberToBase(value, 2, wordSize);\n    case 'oct':\n      return formatNumberToBase(value, 8, wordSize);\n    case 'hex':\n      return formatNumberToBase(value, 16, wordSize);\n    case 'auto':\n      // remove trailing zeros after the decimal point\n      return toPrecision(value, precision, options && options).replace(/((\\.\\d*?)(0+))($|e)/, function () {\n        var digits = arguments[2];\n        var e = arguments[4];\n        return digits !== '.' ? digits + e : e;\n      });\n    default:\n      throw new Error('Unknown notation \"' + notation + '\". ' + 'Choose \"auto\", \"exponential\", \"fixed\", \"bin\", \"oct\", or \"hex.');\n  }\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 */\nfunction splitNumber(value) {\n  // parse the input value\n  var match = String(value).toLowerCase().match(/^(-?)(\\d+\\.?\\d*)(e([+-]?\\d+))?$/);\n  if (!match) {\n    throw new SyntaxError('Invalid number ' + value);\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  if (coefficients.length === 0) {\n    coefficients.push(0);\n    exponent++;\n  }\n  return {\n    sign: sign,\n    coefficients: coefficients,\n    exponent: exponent\n  };\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 */\nfunction toEngineering(value, precision) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  }\n  var split = splitNumber(value);\n  var rounded = roundDigits(split, precision);\n  var e = rounded.exponent;\n  var c = rounded.coefficients;\n\n  // find nearest lower multiple of 3 for exponent\n  var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3;\n  if ((0, _is.isNumber)(precision)) {\n    // add zeroes to give correct sig figs\n    while (precision > c.length || e - newExp + 1 > c.length) {\n      c.push(0);\n    }\n  } else {\n    // concatenate coefficients with necessary zeros\n    // add zeros if necessary (for example: 1e+8 -> 100e+6)\n    var missingZeros = Math.abs(e - newExp) - (c.length - 1);\n    for (var i = 0; i < missingZeros; i++) {\n      c.push(0);\n    }\n  }\n\n  // find difference in exponents\n  var expDiff = Math.abs(e - newExp);\n  var decimalIdx = 1;\n\n  // push decimal index over by expDiff times\n  while (expDiff > 0) {\n    decimalIdx++;\n    expDiff--;\n  }\n\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  var decimals = c.slice(decimalIdx).join('');\n  var decimalVal = (0, _is.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/**\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 */\nfunction toFixed(value, precision) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  }\n  var splitValue = splitNumber(value);\n  var rounded = typeof precision === 'number' ? roundDigits(splitValue, splitValue.exponent + 1 + precision) : splitValue;\n  var c = rounded.coefficients;\n  var p = rounded.exponent + 1; // exponent may have changed\n\n  // append zeros if needed\n  var pp = p + (precision || 0);\n  if (c.length < pp) {\n    c = c.concat(zeros(pp - c.length));\n  }\n\n  // prepend zeros if needed\n  if (p < 0) {\n    c = zeros(-p + 1).concat(c);\n    p = 1;\n  }\n\n  // insert a dot if needed\n  if (p < c.length) {\n    c.splice(p, 0, p === 0 ? '0.' : '.');\n  }\n  return rounded.sign + c.join('');\n}\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 */\nfunction toExponential(value, precision) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  }\n\n  // round if needed, else create a clone\n  var split = splitNumber(value);\n  var rounded = precision ? roundDigits(split, precision) : split;\n  var c = rounded.coefficients;\n  var e = rounded.exponent;\n\n  // append zeros if needed\n  if (c.length < precision) {\n    c = c.concat(zeros(precision - c.length));\n  }\n\n  // format as `C.CCCe+EEE` or `C.CCCe-EEE`\n  var first = c.shift();\n  return rounded.sign + first + (c.length > 0 ? '.' + c.join('') : '') + 'e' + (e >= 0 ? '+' : '') + e;\n}\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 */\nfunction toPrecision(value, precision, options) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  }\n\n  // determine lower and upper bound for exponential notation.\n  var lowerExp = options && options.lowerExp !== undefined ? options.lowerExp : -3;\n  var upperExp = options && options.upperExp !== undefined ? options.upperExp : 5;\n  var split = splitNumber(value);\n  var rounded = precision ? roundDigits(split, precision) : split;\n  if (rounded.exponent < lowerExp || rounded.exponent >= upperExp) {\n    // exponential notation\n    return toExponential(value, precision);\n  } else {\n    var c = rounded.coefficients;\n    var e = rounded.exponent;\n\n    // append trailing zeros\n    if (c.length < precision) {\n      c = c.concat(zeros(precision - c.length));\n    }\n\n    // append trailing zeros\n    // TODO: simplify the next statement\n    c = c.concat(zeros(e - c.length + 1 + (c.length < precision ? precision - c.length : 0)));\n\n    // prepend zeros\n    c = zeros(-e).concat(c);\n    var dot = e > 0 ? e : 0;\n    if (dot < c.length - 1) {\n      c.splice(dot + 1, 0, '.');\n    }\n    return rounded.sign + c.join('');\n  }\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 */\nfunction roundDigits(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;\n\n  // prepend zeros if needed\n  while (precision <= 0) {\n    c.unshift(0);\n    rounded.exponent++;\n    precision++;\n  }\n  if (c.length > precision) {\n    var removed = c.splice(precision, c.length - precision);\n    if (removed[0] >= 5) {\n      var i = precision - 1;\n      c[i]++;\n      while (c[i] === 10) {\n        c.pop();\n        if (i === 0) {\n          c.unshift(0);\n          rounded.exponent++;\n          i++;\n        }\n        i--;\n        c[i]++;\n      }\n    }\n  }\n  return rounded;\n}\n\n/**\n * Create an array filled with zeros.\n * @param {number} length\n * @return {Array}\n */\nfunction zeros(length) {\n  var arr = [];\n  for (var i = 0; i < length; i++) {\n    arr.push(0);\n  }\n  return arr;\n}\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 */\nfunction digits(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/**\n * Minimum number added to one that makes the result different than one\n */\nvar DBL_EPSILON = Number.EPSILON || 2.2204460492503130808472633361816E-16;\n\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*/\nexports.DBL_EPSILON = DBL_EPSILON;\nfunction 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 === y;\n  }\n  if (x === y) {\n    return true;\n  }\n\n  // NaN\n  if (isNaN(x) || isNaN(y)) {\n    return false;\n  }\n\n  // at this point x and y should be finite\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    if (diff < 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  }\n\n  // Infinite and Number or negative Infinite and positive Infinite cases\n  return false;\n}\n\n/**\n * Calculate the hyperbolic arccos of a number\n * @param {number} x\n * @return {number}\n */\nvar acosh = Math.acosh || function (x) {\n  return Math.log(Math.sqrt(x * x - 1) + x);\n};\nexports.acosh = acosh;\nvar asinh = Math.asinh || function (x) {\n  return Math.log(Math.sqrt(x * x + 1) + x);\n};\n\n/**\n * Calculate the hyperbolic arctangent of a number\n * @param {number} x\n * @return {number}\n */\nexports.asinh = asinh;\nvar atanh = Math.atanh || function (x) {\n  return Math.log((1 + x) / (1 - x)) / 2;\n};\n\n/**\n * Calculate the hyperbolic cosine of a number\n * @param {number} x\n * @returns {number}\n */\nexports.atanh = atanh;\nvar cosh = Math.cosh || function (x) {\n  return (Math.exp(x) + Math.exp(-x)) / 2;\n};\n\n/**\n * Calculate the hyperbolic sine of a number\n * @param {number} x\n * @returns {number}\n */\nexports.cosh = cosh;\nvar sinh = Math.sinh || function (x) {\n  return (Math.exp(x) - Math.exp(-x)) / 2;\n};\n\n/**\n * Calculate the hyperbolic tangent of a number\n * @param {number} x\n * @returns {number}\n */\nexports.sinh = sinh;\nvar tanh = Math.tanh || function (x) {\n  var e = Math.exp(2 * x);\n  return (e - 1) / (e + 1);\n};\n\n/**\n * Returns a value with the magnitude of x and the sign of y.\n * @param {number} x\n * @param {number} y\n * @returns {number}\n */\nexports.tanh = tanh;\nfunction copysign(x, y) {\n  var signx = x > 0 ? true : x < 0 ? false : 1 / x === Infinity;\n  var signy = y > 0 ? true : y < 0 ? false : 1 / y === Infinity;\n  return signx ^ signy ? -x : x;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.format = format;\nexports.toEngineering = toEngineering;\nexports.toExponential = toExponential;\nexports.toFixed = toFixed;\nvar _number = require(\"../number.js\");\n/**\n * Formats a BigNumber in a given base\n * @param {BigNumber} n\n * @param {number} base\n * @param {number} size\n * @returns {string}\n */\nfunction formatBigNumberToBase(n, base, size) {\n  var BigNumberCtor = n.constructor;\n  var big2 = new BigNumberCtor(2);\n  var suffix = '';\n  if (size) {\n    if (size < 1) {\n      throw new Error('size must be in greater than 0');\n    }\n    if (!(0, _number.isInteger)(size)) {\n      throw new Error('size must be an integer');\n    }\n    if (n.greaterThan(big2.pow(size - 1).sub(1)) || n.lessThan(big2.pow(size - 1).mul(-1))) {\n      throw new Error(\"Value must be in range [-2^\".concat(size - 1, \", 2^\").concat(size - 1, \"-1]\"));\n    }\n    if (!n.isInteger()) {\n      throw new Error('Value must be an integer');\n    }\n    if (n.lessThan(0)) {\n      n = n.add(big2.pow(size));\n    }\n    suffix = \"i\".concat(size);\n  }\n  switch (base) {\n    case 2:\n      return \"\".concat(n.toBinary()).concat(suffix);\n    case 8:\n      return \"\".concat(n.toOctal()).concat(suffix);\n    case 16:\n      return \"\".concat(n.toHexadecimal()).concat(suffix);\n    default:\n      throw new Error(\"Base \".concat(base, \" not supported \"));\n  }\n}\n\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 *                         'bin', 'oct, or\n *                         'hex'            Format the number using binary, octal,\n *                                          or hexadecimal notation.\n *                                          For example '0b1101' and '0x10fe'.\n *                     {number} wordSize    The word size in bits to use for formatting\n *                                          in binary, octal, or hexadecimal notation.\n *                                          To be used only with 'bin', 'oct', or 'hex'\n *                                          values for 'notation' option. When this option\n *                                          is defined the value is formatted as a signed\n *                                          twos complement integer of the given word size\n *                                          and the size suffix is appended to the output.\n *                                          For example\n *                                          format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.\n *                                          Default value is undefined.\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 */\nfunction format(value, options) {\n  if (typeof options === 'function') {\n    // handle format(value, fn)\n    return options(value);\n  }\n\n  // handle special cases\n  if (!value.isFinite()) {\n    return value.isNaN() ? 'NaN' : value.gt(0) ? 'Infinity' : '-Infinity';\n  }\n\n  // default values for options\n  var notation = 'auto';\n  var precision;\n  var wordSize;\n  if (options !== undefined) {\n    // determine notation from options\n    if (options.notation) {\n      notation = options.notation;\n    }\n\n    // determine precision from options\n    if (typeof options === 'number') {\n      precision = options;\n    } else if (options.precision) {\n      precision = options.precision;\n    }\n    if (options.wordSize) {\n      wordSize = options.wordSize;\n      if (typeof wordSize !== 'number') {\n        throw new Error('Option \"wordSize\" must be a number');\n      }\n    }\n  }\n\n  // handle the various notations\n  switch (notation) {\n    case 'fixed':\n      return toFixed(value, precision);\n    case 'exponential':\n      return toExponential(value, precision);\n    case 'engineering':\n      return toEngineering(value, precision);\n    case 'bin':\n      return formatBigNumberToBase(value, 2, wordSize);\n    case 'oct':\n      return formatBigNumberToBase(value, 8, wordSize);\n    case 'hex':\n      return formatBigNumberToBase(value, 16, wordSize);\n    case 'auto':\n      {\n        // determine lower and upper bound for exponential notation.\n        // TODO: implement support for upper and lower to be BigNumbers themselves\n        var lowerExp = options && options.lowerExp !== undefined ? options.lowerExp : -3;\n        var upperExp = options && options.upperExp !== undefined ? options.upperExp : 5;\n\n        // handle special case zero\n        if (value.isZero()) return '0';\n\n        // determine whether or not to output exponential notation\n        var str;\n        var rounded = value.toSignificantDigits(precision);\n        var exp = rounded.e;\n        if (exp >= lowerExp && exp < upperExp) {\n          // normal number notation\n          str = rounded.toFixed();\n        } else {\n          // exponential notation\n          str = toExponential(value, precision);\n        }\n\n        // remove trailing zeros after the decimal point\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\", \"fixed\", \"bin\", \"oct\", or \"hex.');\n  }\n}\n\n/**\n * Format a BigNumber in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'\n * @param {BigNumber | string} value\n * @param {number} [precision]        Optional number of significant figures to return.\n */\nfunction toEngineering(value, precision) {\n  // find nearest lower multiple of 3 for exponent\n  var e = value.e;\n  var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3;\n\n  // find difference in exponents, and calculate the value without exponent\n  var valueWithoutExp = value.mul(Math.pow(10, -newExp));\n  var valueStr = valueWithoutExp.toPrecision(precision);\n  if (valueStr.indexOf('e') !== -1) {\n    valueStr = valueWithoutExp.toString();\n  }\n  return valueStr + 'e' + (e >= 0 ? '+' : '') + newExp.toString();\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 */\nfunction toExponential(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/**\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 */\nfunction toFixed(value, precision) {\n  return value.toFixed(precision);\n}","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.compareText = compareText;\nexports.endsWith = endsWith;\nexports.escape = escape;\nexports.format = format;\nexports.stringify = stringify;\nvar _typeof2 = _interopRequireDefault(require(\"@babel/runtime/helpers/typeof\"));\nvar _is = require(\"./is.js\");\nvar _number = require(\"./number.js\");\nvar _formatter = require(\"./bignumber/formatter.js\");\n/**\n * Check if a text ends with a certain string.\n * @param {string} text\n * @param {string} search\n */\nfunction endsWith(text, search) {\n  var start = text.length - search.length;\n  var end = text.length;\n  return text.substring(start, end) === search;\n}\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 *     math.format(value, options)\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]\n *     Formatting options. See src/utils/number.js:format for a\n *     description of the available options controlling number output.\n *     This generic \"format\" also supports the option property `truncate: NN`\n *     giving the maximum number NN of characters to return (if there would\n *     have been more, they are deleted and replaced by an ellipsis).\n * @return {string} str\n */\nfunction format(value, options) {\n  var result = _format(value, options);\n  if (options && (0, _typeof2[\"default\"])(options) === 'object' && 'truncate' in options && result.length > options.truncate) {\n    return result.substring(0, options.truncate - 3) + '...';\n  }\n  return result;\n}\nfunction _format(value, options) {\n  if (typeof value === 'number') {\n    return (0, _number.format)(value, options);\n  }\n  if ((0, _is.isBigNumber)(value)) {\n    return (0, _formatter.format)(value, options);\n  }\n\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  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  if (Array.isArray(value)) {\n    return formatArray(value, options);\n  }\n  if ((0, _is.isString)(value)) {\n    return '\"' + value + '\"';\n  }\n  if (typeof value === 'function') {\n    return value.syntax ? String(value.syntax) : 'function';\n  }\n  if (value && (0, _typeof2[\"default\"])(value) === 'object') {\n    if (typeof value.format === 'function') {\n      return value.format(options);\n    } else if (value && value.toString(options) !== {}.toString()) {\n      // this object has a non-native toString method, use that one\n      return value.toString(options);\n    } else {\n      var entries = Object.keys(value).map(function (key) {\n        return '\"' + key + '\": ' + format(value[key], options);\n      });\n      return '{' + entries.join(', ') + '}';\n    }\n  }\n  return String(value);\n}\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 */\nfunction stringify(value) {\n  var text = String(value);\n  var escaped = '';\n  var i = 0;\n  while (i < text.length) {\n    var c = text.charAt(i);\n    if (c === '\\\\') {\n      escaped += c;\n      i++;\n      c = text.charAt(i);\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    i++;\n  }\n  return '\"' + escaped + '\"';\n}\n\n/**\n * Escape special HTML characters\n * @param {*} value\n * @return {string}\n */\nfunction escape(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/**\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 */\nfunction formatArray(array, options) {\n  if (Array.isArray(array)) {\n    var str = '[';\n    var len = array.length;\n    for (var i = 0; i < len; i++) {\n      if (i !== 0) {\n        str += ', ';\n      }\n      str += formatArray(array[i], options);\n    }\n    str += ']';\n    return str;\n  } else {\n    return format(array, options);\n  }\n}\n\n/**\n * Check whether a value looks like a Fraction (unsafe duck-type check)\n * @param {*} value\n * @return {boolean}\n */\nfunction looksLikeFraction(value) {\n  return value && (0, _typeof2[\"default\"])(value) === 'object' && typeof value.s === 'number' && typeof value.n === 'number' && typeof value.d === 'number' || false;\n}\n\n/**\n * Compare two strings\n * @param {string} x\n * @param {string} y\n * @returns {number}\n */\nfunction compareText(x, y) {\n  // we don't want to convert numbers to string, only accept string input\n  if (!(0, _is.isString)(x)) {\n    throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + (0, _is.typeOf)(x) + ', index: 0)');\n  }\n  if (!(0, _is.isString)(y)) {\n    throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + (0, _is.typeOf)(y) + ', index: 1)');\n  }\n  return x === y ? 0 : x > y ? 1 : -1;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.DimensionError = DimensionError;\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 */\nfunction DimensionError(actual, expected, relation) {\n  if (!(this instanceof DimensionError)) {\n    throw new SyntaxError('Constructor must be called with the new operator');\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}\nDimensionError.prototype = new RangeError();\nDimensionError.prototype.constructor = RangeError;\nDimensionError.prototype.name = 'DimensionError';\nDimensionError.prototype.isDimensionError = true;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.IndexError = IndexError;\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 */\nfunction IndexError(index, min, max) {\n  if (!(this instanceof IndexError)) {\n    throw new SyntaxError('Constructor must be called with the new operator');\n  }\n  this.index = index;\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  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  this.stack = new Error().stack;\n}\nIndexError.prototype = new RangeError();\nIndexError.prototype.constructor = RangeError;\nIndexError.prototype.name = 'IndexError';\nIndexError.prototype.isIndexError = true;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.arraySize = arraySize;\nexports.contains = contains;\nexports.filter = filter;\nexports.filterRegExp = filterRegExp;\nexports.flatten = flatten;\nexports.forEach = forEach;\nexports.generalize = generalize;\nexports.getArrayDataType = getArrayDataType;\nexports.identify = identify;\nexports.initial = initial;\nexports.join = join;\nexports.last = last;\nexports.map = map;\nexports.processSizesWildcard = processSizesWildcard;\nexports.reshape = reshape;\nexports.resize = resize;\nexports.squeeze = squeeze;\nexports.unsqueeze = unsqueeze;\nexports.validate = validate;\nexports.validateIndex = validateIndex;\nvar _number = require(\"./number.js\");\nvar _is = require(\"./is.js\");\nvar _string = require(\"./string.js\");\nvar _DimensionError = require(\"../error/DimensionError.js\");\nvar _IndexError = require(\"../error/IndexError.js\");\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 arraySize(x) {\n  var s = [];\n  while (Array.isArray(x)) {\n    s.push(x.length);\n    x = x[0];\n  }\n  return s;\n}\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 */\nfunction _validate(array, size, dim) {\n  var i;\n  var len = array.length;\n  if (len !== size[dim]) {\n    throw new _DimensionError.DimensionError(len, size[dim]);\n  }\n  if (dim < size.length - 1) {\n    // recursively validate each child array\n    var dimNext = dim + 1;\n    for (i = 0; i < len; i++) {\n      var child = array[i];\n      if (!Array.isArray(child)) {\n        throw new _DimensionError.DimensionError(size.length - 1, size.length, '<');\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.DimensionError(size.length + 1, size.length, '>');\n      }\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 */\nfunction validate(array, size) {\n  var isScalar = size.length === 0;\n  if (isScalar) {\n    // scalar\n    if (Array.isArray(array)) {\n      throw new _DimensionError.DimensionError(array.length, 0);\n    }\n  } else {\n    // array\n    _validate(array, size, 0);\n  }\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 */\nfunction validateIndex(index, length) {\n  if (!(0, _is.isNumber)(index) || !(0, _number.isInteger)(index)) {\n    throw new TypeError('Index must be an integer (value: ' + index + ')');\n  }\n  if (index < 0 || typeof length === 'number' && index >= length) {\n    throw new _IndexError.IndexError(index, length);\n  }\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 */\nfunction resize(array, size, defaultValue) {\n  // TODO: add support for scalars, having size=[] ?\n\n  // check the type of the arguments\n  if (!Array.isArray(array) || !Array.isArray(size)) {\n    throw new TypeError('Array expected');\n  }\n  if (size.length === 0) {\n    throw new Error('Resizing to scalar is not supported');\n  }\n\n  // check whether size contains positive integers\n  size.forEach(function (value) {\n    if (!(0, _is.isNumber)(value) || !(0, _number.isInteger)(value) || value < 0) {\n      throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + (0, _string.format)(size) + ')');\n    }\n  });\n\n  // recursively resize the array\n  var _defaultValue = defaultValue !== undefined ? defaultValue : 0;\n  _resize(array, size, 0, _defaultValue);\n  return array;\n}\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 */\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);\n\n  // apply new length\n  array.length = newLen;\n  if (dim < size.length - 1) {\n    // non-last dimension\n    var dimNext = dim + 1;\n\n    // resize existing child arrays\n    for (i = 0; i < minLen; i++) {\n      // resize child array\n      elem = array[i];\n      if (!Array.isArray(elem)) {\n        elem = [elem]; // add a dimension\n        array[i] = elem;\n      }\n      _resize(elem, size, dimNext, defaultValue);\n    }\n\n    // create new child arrays\n    for (i = minLen; i < newLen; i++) {\n      // get child array\n      elem = [];\n      array[i] = elem;\n\n      // resize new child array\n      _resize(elem, size, dimNext, defaultValue);\n    }\n  } else {\n    // last dimension\n\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    }\n\n    // fill new elements with the default value\n    for (i = minLen; i < newLen; i++) {\n      array[i] = defaultValue;\n    }\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 */\nfunction reshape(array, sizes) {\n  var flatArray = flatten(array);\n  var currentLength = flatArray.length;\n  if (!Array.isArray(array) || !Array.isArray(sizes)) {\n    throw new TypeError('Array expected');\n  }\n  if (sizes.length === 0) {\n    throw new _DimensionError.DimensionError(0, currentLength, '!=');\n  }\n  sizes = processSizesWildcard(sizes, currentLength);\n  var newLength = product(sizes);\n  if (currentLength !== newLength) {\n    throw new _DimensionError.DimensionError(newLength, currentLength, '!=');\n  }\n  try {\n    return _reshape(flatArray, sizes);\n  } catch (e) {\n    if (e instanceof _DimensionError.DimensionError) {\n      throw new _DimensionError.DimensionError(newLength, currentLength, '!=');\n    }\n    throw e;\n  }\n}\n\n/**\n * Replaces the wildcard -1 in the sizes array.\n * @param {Array.<number>} sizes  List of sizes for each dimension. At most on wildcard.\n * @param {number} currentLength  Number of elements in the array.\n * @throws {Error}                If more than one wildcard or unable to replace it.\n * @returns {Array.<number>}      The sizes array with wildcard replaced.\n */\nfunction processSizesWildcard(sizes, currentLength) {\n  var newLength = product(sizes);\n  var processedSizes = sizes.slice();\n  var WILDCARD = -1;\n  var wildCardIndex = sizes.indexOf(WILDCARD);\n  var isMoreThanOneWildcard = sizes.indexOf(WILDCARD, wildCardIndex + 1) >= 0;\n  if (isMoreThanOneWildcard) {\n    throw new Error('More than one wildcard in sizes');\n  }\n  var hasWildcard = wildCardIndex >= 0;\n  var canReplaceWildcard = currentLength % newLength === 0;\n  if (hasWildcard) {\n    if (canReplaceWildcard) {\n      processedSizes[wildCardIndex] = -currentLength / newLength;\n    } else {\n      throw new Error('Could not replace wildcard, since ' + currentLength + ' is no multiple of ' + -newLength);\n    }\n  }\n  return processedSizes;\n}\n\n/**\n * Computes the product of all array elements.\n * @param {Array<number>} array Array of factors\n * @returns {number}            Product of all elements\n */\nfunction product(array) {\n  return array.reduce(function (prev, curr) {\n    return prev * curr;\n  }, 1);\n}\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\nfunction _reshape(array, sizes) {\n  // testing if there are enough elements for the requested shape\n  var tmpArray = array;\n  var tmpArray2;\n  // for each dimensions starting by the last one and ignoring the first one\n  for (var sizeIndex = sizes.length - 1; sizeIndex > 0; sizeIndex--) {\n    var size = sizes[sizeIndex];\n    tmpArray2 = [];\n\n    // aggregate the elements of the current tmpArray in elements of the requested size\n    var length = tmpArray.length / size;\n    for (var i = 0; i < length; i++) {\n      tmpArray2.push(tmpArray.slice(i * size, (i + 1) * size));\n    }\n    // set it as the new tmpArray for the next loop turn or for return\n    tmpArray = tmpArray2;\n  }\n  return tmpArray;\n}\n\n/**\n * Squeeze a multi dimensional array\n * @param {Array} array\n * @param {Array} [size]\n * @returns {Array} returns the array itself\n */\nfunction squeeze(array, size) {\n  var s = size || arraySize(array);\n\n  // squeeze outer dimensions\n  while (Array.isArray(array) && array.length === 1) {\n    array = array[0];\n    s.shift();\n  }\n\n  // find the first dimension to be squeezed\n  var dims = s.length;\n  while (s[dims - 1] === 1) {\n    dims--;\n  }\n\n  // squeeze inner dimensions\n  if (dims < s.length) {\n    array = _squeeze(array, dims, 0);\n    s.length = dims;\n  }\n  return array;\n}\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 */\nfunction _squeeze(array, dims, dim) {\n  var i, ii;\n  if (dim < dims) {\n    var next = dim + 1;\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  return array;\n}\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} [size] Current size of array.\n * @returns {Array} returns the array itself\n * @private\n */\nfunction unsqueeze(array, dims, outer, size) {\n  var s = size || arraySize(array);\n\n  // unsqueeze outer dimensions\n  if (outer) {\n    for (var i = 0; i < outer; i++) {\n      array = [array];\n      s.unshift(1);\n    }\n  }\n\n  // unsqueeze inner dimensions\n  array = _unsqueeze(array, dims, 0);\n  while (s.length < dims) {\n    s.push(1);\n  }\n  return array;\n}\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 */\nfunction _unsqueeze(array, dims, dim) {\n  var i, ii;\n  if (Array.isArray(array)) {\n    var next = dim + 1;\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  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 */\nfunction flatten(array) {\n  if (!Array.isArray(array)) {\n    // if not an array, return as is\n    return array;\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/**\n * A safe map\n * @param {Array} array\n * @param {function} callback\n */\nfunction map(array, callback) {\n  return Array.prototype.map.call(array, callback);\n}\n\n/**\n * A safe forEach\n * @param {Array} array\n * @param {function} callback\n */\nfunction forEach(array, callback) {\n  Array.prototype.forEach.call(array, callback);\n}\n\n/**\n * A safe filter\n * @param {Array} array\n * @param {function} callback\n */\nfunction filter(array, callback) {\n  if (arraySize(array).length !== 1) {\n    throw new Error('Only one dimensional matrices supported');\n  }\n  return Array.prototype.filter.call(array, callback);\n}\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 */\nfunction filterRegExp(array, regexp) {\n  if (arraySize(array).length !== 1) {\n    throw new Error('Only one dimensional matrices supported');\n  }\n  return Array.prototype.filter.call(array, function (entry) {\n    return regexp.test(entry);\n  });\n}\n\n/**\n * A safe join\n * @param {Array} array\n * @param {string} separator\n */\nfunction join(array, separator) {\n  return Array.prototype.join.call(array, separator);\n}\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 */\nfunction identify(a) {\n  if (!Array.isArray(a)) {\n    throw new TypeError('Array input expected');\n  }\n  if (a.length === 0) {\n    return a;\n  }\n  var b = [];\n  var count = 0;\n  b[0] = {\n    value: a[0],\n    identifier: 0\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    b.push({\n      value: a[i],\n      identifier: count\n    });\n  }\n  return b;\n}\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 */\nfunction generalize(a) {\n  if (!Array.isArray(a)) {\n    throw new TypeError('Array input expected');\n  }\n  if (a.length === 0) {\n    return a;\n  }\n  var b = [];\n  for (var i = 0; i < a.length; i++) {\n    b.push(a[i].value);\n  }\n  return b;\n}\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} array\n * @param {function} typeOf   Callback function to use to determine the type of a value\n * @return {string}\n */\nfunction getArrayDataType(array, typeOf) {\n  var type; // to hold type info\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);\n\n    // Saving the target matrix row size\n    if (i === 0 && isArray) {\n      length = item.length;\n    }\n\n    // If the current item is an array but the length does not equal the targetVectorSize\n    if (isArray && item.length !== length) {\n      return undefined;\n    }\n    var itemType = isArray ? getArrayDataType(item, typeOf) // recurse into a nested array\n    : typeOf(item);\n    if (type === undefined) {\n      type = itemType; // first item\n    } else if (type !== itemType) {\n      return 'mixed';\n    } else {\n      // we're good, everything has the same type so far\n    }\n  }\n  return type;\n}\n\n/**\n * Return the last item from an array\n * @param array\n * @returns {*}\n */\nfunction last(array) {\n  return array[array.length - 1];\n}\n\n/**\n * Get all but the last element of array.\n */\nfunction initial(array) {\n  return array.slice(0, array.length - 1);\n}\n\n/**\n * Test whether an array or string contains an item\n * @param {Array | string} array\n * @param {*} item\n * @return {boolean}\n */\nfunction contains(array, item) {\n  return array.indexOf(item) !== -1;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.assertDependencies = assertDependencies;\nexports.create = create;\nexports.factory = factory;\nexports.isFactory = isFactory;\nexports.isOptionalDependency = isOptionalDependency;\nexports.sortFactories = sortFactories;\nexports.stripOptionalNotation = stripOptionalNotation;\nvar _array = require(\"./array.js\");\nvar _object = require(\"./object.js\");\n/**\n * Create a factory function, which can be used to inject dependencies.\n *\n * The created functions are memoized, a consecutive call of the factory\n * with the exact same inputs will return the same function instance.\n * The memoized cache is exposed on `factory.cache` and can be cleared\n * if needed.\n *\n * Example:\n *\n *     const name = 'log'\n *     const dependencies = ['config', 'typed', 'divideScalar', 'Complex']\n *\n *     export const createLog = factory(name, dependencies, ({ typed, config, divideScalar, Complex }) => {\n *       // ... create the function log here and return it\n *     }\n *\n * @param {string} name           Name of the function to be created\n * @param {string[]} dependencies The names of all required dependencies\n * @param {function} create       Callback function called with an object with all dependencies\n * @param {Object} [meta]         Optional object with meta information that will be attached\n *                                to the created factory function as property `meta`.\n * @returns {function}\n */\nfunction factory(name, dependencies, create, meta) {\n  function assertAndCreate(scope) {\n    // we only pass the requested dependencies to the factory function\n    // to prevent functions to rely on dependencies that are not explicitly\n    // requested.\n    var deps = (0, _object.pickShallow)(scope, dependencies.map(stripOptionalNotation));\n    assertDependencies(name, dependencies, scope);\n    return create(deps);\n  }\n  assertAndCreate.isFactory = true;\n  assertAndCreate.fn = name;\n  assertAndCreate.dependencies = dependencies.slice().sort();\n  if (meta) {\n    assertAndCreate.meta = meta;\n  }\n  return assertAndCreate;\n}\n\n/**\n * Sort all factories such that when loading in order, the dependencies are resolved.\n *\n * @param {Array} factories\n * @returns {Array} Returns a new array with the sorted factories.\n */\nfunction sortFactories(factories) {\n  var factoriesByName = {};\n  factories.forEach(function (factory) {\n    factoriesByName[factory.fn] = factory;\n  });\n  function containsDependency(factory, dependency) {\n    // TODO: detect circular references\n    if (isFactory(factory)) {\n      if ((0, _array.contains)(factory.dependencies, dependency.fn || dependency.name)) {\n        return true;\n      }\n      if (factory.dependencies.some(function (d) {\n        return containsDependency(factoriesByName[d], dependency);\n      })) {\n        return true;\n      }\n    }\n    return false;\n  }\n  var sorted = [];\n  function addFactory(factory) {\n    var index = 0;\n    while (index < sorted.length && !containsDependency(sorted[index], factory)) {\n      index++;\n    }\n    sorted.splice(index, 0, factory);\n  }\n\n  // sort regular factory functions\n  factories.filter(isFactory).forEach(addFactory);\n\n  // sort legacy factory functions AFTER the regular factory functions\n  factories.filter(function (factory) {\n    return !isFactory(factory);\n  }).forEach(addFactory);\n  return sorted;\n}\n\n// TODO: comment or cleanup if unused in the end\nfunction create(factories) {\n  var scope = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  sortFactories(factories).forEach(function (factory) {\n    return factory(scope);\n  });\n  return scope;\n}\n\n/**\n * Test whether an object is a factory. This is the case when it has\n * properties name, dependencies, and a function create.\n * @param {*} obj\n * @returns {boolean}\n */\nfunction isFactory(obj) {\n  return typeof obj === 'function' && typeof obj.fn === 'string' && Array.isArray(obj.dependencies);\n}\n\n/**\n * Assert that all dependencies of a list with dependencies are available in the provided scope.\n *\n * Will throw an exception when there are dependencies missing.\n *\n * @param {string} name   Name for the function to be created. Used to generate a useful error message\n * @param {string[]} dependencies\n * @param {Object} scope\n */\nfunction assertDependencies(name, dependencies, scope) {\n  var allDefined = dependencies.filter(function (dependency) {\n    return !isOptionalDependency(dependency);\n  }) // filter optionals\n  .every(function (dependency) {\n    return scope[dependency] !== undefined;\n  });\n  if (!allDefined) {\n    var missingDependencies = dependencies.filter(function (dependency) {\n      return scope[dependency] === undefined;\n    });\n\n    // TODO: create a custom error class for this, a MathjsError or something like that\n    throw new Error(\"Cannot create function \\\"\".concat(name, \"\\\", \") + \"some dependencies are missing: \".concat(missingDependencies.map(function (d) {\n      return \"\\\"\".concat(d, \"\\\"\");\n    }).join(', '), \".\"));\n  }\n}\nfunction isOptionalDependency(dependency) {\n  return dependency && dependency[0] === '?';\n}\nfunction stripOptionalNotation(dependency) {\n  return dependency && dependency[0] === '?' ? dependency.slice(1) : dependency;\n}","function _classCallCheck(instance, Constructor) {\n  if (!(instance instanceof Constructor)) {\n    throw new TypeError(\"Cannot call a class as a function\");\n  }\n}\nmodule.exports = _classCallCheck, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","var _typeof = require(\"./typeof.js\")[\"default\"];\nfunction toPrimitive(t, r) {\n  if (\"object\" != _typeof(t) || !t) return t;\n  var e = t[Symbol.toPrimitive];\n  if (void 0 !== e) {\n    var i = e.call(t, r || \"default\");\n    if (\"object\" != _typeof(i)) return i;\n    throw new TypeError(\"@@toPrimitive must return a primitive value.\");\n  }\n  return (\"string\" === r ? String : Number)(t);\n}\nmodule.exports = toPrimitive, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","var _typeof = require(\"./typeof.js\")[\"default\"];\nvar toPrimitive = require(\"./toPrimitive.js\");\nfunction toPropertyKey(t) {\n  var i = toPrimitive(t, \"string\");\n  return \"symbol\" == _typeof(i) ? i : String(i);\n}\nmodule.exports = toPropertyKey, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","var toPropertyKey = require(\"./toPropertyKey.js\");\nfunction _defineProperties(target, props) {\n  for (var i = 0; i < props.length; i++) {\n    var descriptor = props[i];\n    descriptor.enumerable = descriptor.enumerable || false;\n    descriptor.configurable = true;\n    if (\"value\" in descriptor) descriptor.writable = true;\n    Object.defineProperty(target, toPropertyKey(descriptor.key), descriptor);\n  }\n}\nfunction _createClass(Constructor, protoProps, staticProps) {\n  if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n  if (staticProps) _defineProperties(Constructor, staticProps);\n  Object.defineProperty(Constructor, \"prototype\", {\n    writable: false\n  });\n  return Constructor;\n}\nmodule.exports = _createClass, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.getSafeProperties = getSafeProperties;\nexports.getSafeProperty = getSafeProperty;\nexports.hasSafeProperty = hasSafeProperty;\nexports.isPlainObject = isPlainObject;\nexports.isSafeMethod = isSafeMethod;\nexports.isSafeProperty = isSafeProperty;\nexports.setSafeProperty = setSafeProperty;\nexports.validateSafeMethod = validateSafeMethod;\nvar _typeof2 = _interopRequireDefault(require(\"@babel/runtime/helpers/typeof\"));\nvar _object = require(\"./object.js\");\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 */\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  if (typeof object[prop] === 'function' && isSafeMethod(object, prop)) {\n    throw new Error('Cannot access method \"' + prop + '\" as a property');\n  }\n  throw new Error('No access to property \"' + prop + '\"');\n}\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?\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  throw new Error('No access to property \"' + prop + '\"');\n}\nfunction getSafeProperties(object) {\n  return Object.keys(object).filter(function (prop) {\n    return (0, _object.hasOwnProperty)(object, prop);\n  });\n}\nfunction hasSafeProperty(object, prop) {\n  return prop in object;\n}\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 */\nfunction isSafeProperty(object, prop) {\n  if (!object || (0, _typeof2[\"default\"])(object) !== 'object') {\n    return false;\n  }\n  // SAFE: whitelisted\n  // e.g length\n  if ((0, _object.hasOwnProperty)(safeNativeProperties, prop)) {\n    return true;\n  }\n  // UNSAFE: inherited from Object prototype\n  // e.g constructor\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  }\n  // UNSAFE: inherited from Function prototype\n  // e.g call, apply\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  return true;\n}\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?\nfunction validateSafeMethod(object, method) {\n  if (!isSafeMethod(object, method)) {\n    throw new Error('No access to method \"' + method + '\"');\n  }\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 */\nfunction isSafeMethod(object, method) {\n  if (object === null || object === undefined || typeof object[method] !== 'function') {\n    return false;\n  }\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  if ((0, _object.hasOwnProperty)(object, method) && Object.getPrototypeOf && method in Object.getPrototypeOf(object)) {\n    return false;\n  }\n  // SAFE: whitelisted\n  // e.g toString\n  if ((0, _object.hasOwnProperty)(safeNativeMethods, method)) {\n    return true;\n  }\n  // UNSAFE: inherited from Object prototype\n  // e.g constructor\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  }\n  // UNSAFE: inherited from Function prototype\n  // e.g call, apply\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  return true;\n}\nfunction isPlainObject(object) {\n  return (0, _typeof2[\"default\"])(object) === 'object' && object && object.constructor === Object;\n}\nvar safeNativeProperties = {\n  length: true,\n  name: true\n};\nvar safeNativeMethods = {\n  toString: true,\n  valueOf: true,\n  toLocaleString: true\n};","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.ObjectWrappingMap = void 0;\nexports.assign = assign;\nexports.createEmptyMap = createEmptyMap;\nexports.createMap = createMap;\nexports.isMap = isMap;\nexports.toObject = toObject;\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\nvar _customs = require(\"./customs.js\");\nvar _is = require(\"./is.js\");\nfunction _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it[\"return\"] != null) it[\"return\"](); } finally { if (didErr) throw err; } } }; }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }\n/**\n * A map facade on a bare object.\n *\n * The small number of methods needed to implement a scope,\n * forwarding on to the SafeProperty functions. Over time, the codebase\n * will stop using this method, as all objects will be Maps, rather than\n * more security prone objects.\n */\nvar ObjectWrappingMap = /*#__PURE__*/function () {\n  function ObjectWrappingMap(object) {\n    (0, _classCallCheck2[\"default\"])(this, ObjectWrappingMap);\n    this.wrappedObject = object;\n  }\n  (0, _createClass2[\"default\"])(ObjectWrappingMap, [{\n    key: \"keys\",\n    value: function keys() {\n      return Object.keys(this.wrappedObject);\n    }\n  }, {\n    key: \"get\",\n    value: function get(key) {\n      return (0, _customs.getSafeProperty)(this.wrappedObject, key);\n    }\n  }, {\n    key: \"set\",\n    value: function set(key, value) {\n      (0, _customs.setSafeProperty)(this.wrappedObject, key, value);\n      return this;\n    }\n  }, {\n    key: \"has\",\n    value: function has(key) {\n      return (0, _customs.hasSafeProperty)(this.wrappedObject, key);\n    }\n  }]);\n  return ObjectWrappingMap;\n}();\n/**\n * Creates an empty map, or whatever your platform's polyfill is.\n *\n * @returns an empty Map or Map like object.\n */\nexports.ObjectWrappingMap = ObjectWrappingMap;\nfunction createEmptyMap() {\n  return new Map();\n}\n\n/**\n * Creates a Map from the given object.\n *\n * @param { Map | { [key: string]: unknown } | undefined } mapOrObject\n * @returns\n */\nfunction createMap(mapOrObject) {\n  if (!mapOrObject) {\n    return createEmptyMap();\n  }\n  if (isMap(mapOrObject)) {\n    return mapOrObject;\n  }\n  if ((0, _is.isObject)(mapOrObject)) {\n    return new ObjectWrappingMap(mapOrObject);\n  }\n  throw new Error('createMap can create maps from objects or Maps');\n}\n\n/**\n * Unwraps a map into an object.\n *\n * @param {Map} map\n * @returns { [key: string]: unknown }\n */\nfunction toObject(map) {\n  if (map instanceof ObjectWrappingMap) {\n    return map.wrappedObject;\n  }\n  var object = {};\n  var _iterator = _createForOfIteratorHelper(map.keys()),\n    _step;\n  try {\n    for (_iterator.s(); !(_step = _iterator.n()).done;) {\n      var key = _step.value;\n      var value = map.get(key);\n      (0, _customs.setSafeProperty)(object, key, value);\n    }\n  } catch (err) {\n    _iterator.e(err);\n  } finally {\n    _iterator.f();\n  }\n  return object;\n}\n\n/**\n * Returns `true` if the passed object appears to be a Map (i.e. duck typing).\n *\n * Methods looked for are `get`, `set`, `keys` and `has`.\n *\n * @param {Map | object} object\n * @returns\n */\nfunction isMap(object) {\n  // We can use the fast instanceof, or a slower duck typing check.\n  // The duck typing method needs to cover enough methods to not be confused with DenseMatrix.\n  if (!object) {\n    return false;\n  }\n  return object instanceof Map || object instanceof ObjectWrappingMap || typeof object.set === 'function' && typeof object.get === 'function' && typeof object.keys === 'function' && typeof object.has === 'function';\n}\n\n/**\n * Copies the contents of key-value pairs from each `objects` in to `map`.\n *\n * Object is `objects` can be a `Map` or object.\n *\n * This is the `Map` analog to `Object.assign`.\n */\nfunction assign(map) {\n  for (var _len = arguments.length, objects = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n    objects[_key - 1] = arguments[_key];\n  }\n  for (var _i = 0, _objects = objects; _i < _objects.length; _i++) {\n    var args = _objects[_i];\n    if (!args) {\n      continue;\n    }\n    if (isMap(args)) {\n      var _iterator2 = _createForOfIteratorHelper(args.keys()),\n        _step2;\n      try {\n        for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {\n          var key = _step2.value;\n          map.set(key, args.get(key));\n        }\n      } catch (err) {\n        _iterator2.e(err);\n      } finally {\n        _iterator2.f();\n      }\n    } else if ((0, _is.isObject)(args)) {\n      for (var _i2 = 0, _Object$keys = Object.keys(args); _i2 < _Object$keys.length; _i2++) {\n        var _key2 = _Object$keys[_i2];\n        map.set(_key2, args[_key2]);\n      }\n    }\n  }\n  return map;\n}","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createTyped = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _typedFunction = _interopRequireDefault(require(\"typed-function\"));\nvar _number = require(\"../../utils/number.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _map = require(\"../../utils/map.js\");\n/**\n * Create a typed-function which checks the types of the arguments and\n * can match them against multiple provided signatures. The typed-function\n * automatically converts inputs in order to find a matching signature.\n * Typed functions throw informative errors in case of wrong input arguments.\n *\n * See the library [typed-function](https://github.com/josdejong/typed-function)\n * for detailed documentation.\n *\n * Syntax:\n *\n *     math.typed(name, signatures) : function\n *     math.typed(signatures) : function\n *\n * Examples:\n *\n *     // create a typed function with multiple types per argument (type union)\n *     const fn2 = typed({\n *       'number | boolean': function (b) {\n *         return 'b is a number or boolean'\n *       },\n *       'string, number | boolean': function (a, b) {\n *         return 'a is a string, b is a number or boolean'\n *       }\n *     })\n *\n *     // create a typed function with an any type argument\n *     const log = typed({\n *       'string, any': function (event, data) {\n *         console.log('event: ' + event + ', data: ' + JSON.stringify(data))\n *       }\n *     })\n *\n * @param {string} [name]                          Optional name for the typed-function\n * @param {Object<string, function>} signatures   Object with one or multiple function signatures\n * @returns {function} The created typed-function.\n */\n\n// returns a new instance of typed-function\nvar _createTyped2 = function _createTyped() {\n  // initially, return the original instance of typed-function\n  // consecutively, return a new instance from typed.create.\n  _createTyped2 = _typedFunction[\"default\"].create;\n  return _typedFunction[\"default\"];\n};\nvar dependencies = ['?BigNumber', '?Complex', '?DenseMatrix', '?Fraction'];\n\n/**\n * Factory function for creating a new typed instance\n * @param {Object} dependencies   Object with data types like Complex and BigNumber\n * @returns {Function}\n */\nvar createTyped = /* #__PURE__ */(0, _factory.factory)('typed', dependencies, function createTyped(_ref) {\n  var BigNumber = _ref.BigNumber,\n    Complex = _ref.Complex,\n    DenseMatrix = _ref.DenseMatrix,\n    Fraction = _ref.Fraction;\n  // TODO: typed-function must be able to silently ignore signatures with unknown data types\n\n  // get a new instance of typed-function\n  var typed = _createTyped2();\n\n  // 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  typed.clear();\n  typed.addTypes([{\n    name: 'number',\n    test: _is.isNumber\n  }, {\n    name: 'Complex',\n    test: _is.isComplex\n  }, {\n    name: 'BigNumber',\n    test: _is.isBigNumber\n  }, {\n    name: 'Fraction',\n    test: _is.isFraction\n  }, {\n    name: 'Unit',\n    test: _is.isUnit\n  },\n  // The following type matches a valid variable name, i.e., an alphanumeric\n  // string starting with an alphabetic character. It is used (at least)\n  // in the definition of the derivative() function, as the argument telling\n  // what to differentiate over must (currently) be a variable.\n  {\n    name: 'identifier',\n    test: function test(s) {\n      return _is.isString && /^(?:[A-Za-z\\xAA\\xB5\\xBA\\xC0-\\xD6\\xD8-\\xF6\\xF8-\\u02C1\\u02C6-\\u02D1\\u02E0-\\u02E4\\u02EC\\u02EE\\u0370-\\u0374\\u0376\\u0377\\u037A-\\u037D\\u037F\\u0386\\u0388-\\u038A\\u038C\\u038E-\\u03A1\\u03A3-\\u03F5\\u03F7-\\u0481\\u048A-\\u052F\\u0531-\\u0556\\u0559\\u0560-\\u0588\\u05D0-\\u05EA\\u05EF-\\u05F2\\u0620-\\u064A\\u066E\\u066F\\u0671-\\u06D3\\u06D5\\u06E5\\u06E6\\u06EE\\u06EF\\u06FA-\\u06FC\\u06FF\\u0710\\u0712-\\u072F\\u074D-\\u07A5\\u07B1\\u07CA-\\u07EA\\u07F4\\u07F5\\u07FA\\u0800-\\u0815\\u081A\\u0824\\u0828\\u0840-\\u0858\\u0860-\\u086A\\u0870-\\u0887\\u0889-\\u088E\\u08A0-\\u08C9\\u0904-\\u0939\\u093D\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098C\\u098F\\u0990\\u0993-\\u09A8\\u09AA-\\u09B0\\u09B2\\u09B6-\\u09B9\\u09BD\\u09CE\\u09DC\\u09DD\\u09DF-\\u09E1\\u09F0\\u09F1\\u09FC\\u0A05-\\u0A0A\\u0A0F\\u0A10\\u0A13-\\u0A28\\u0A2A-\\u0A30\\u0A32\\u0A33\\u0A35\\u0A36\\u0A38\\u0A39\\u0A59-\\u0A5C\\u0A5E\\u0A72-\\u0A74\\u0A85-\\u0A8D\\u0A8F-\\u0A91\\u0A93-\\u0AA8\\u0AAA-\\u0AB0\\u0AB2\\u0AB3\\u0AB5-\\u0AB9\\u0ABD\\u0AD0\\u0AE0\\u0AE1\\u0AF9\\u0B05-\\u0B0C\\u0B0F\\u0B10\\u0B13-\\u0B28\\u0B2A-\\u0B30\\u0B32\\u0B33\\u0B35-\\u0B39\\u0B3D\\u0B5C\\u0B5D\\u0B5F-\\u0B61\\u0B71\\u0B83\\u0B85-\\u0B8A\\u0B8E-\\u0B90\\u0B92-\\u0B95\\u0B99\\u0B9A\\u0B9C\\u0B9E\\u0B9F\\u0BA3\\u0BA4\\u0BA8-\\u0BAA\\u0BAE-\\u0BB9\\u0BD0\\u0C05-\\u0C0C\\u0C0E-\\u0C10\\u0C12-\\u0C28\\u0C2A-\\u0C39\\u0C3D\\u0C58-\\u0C5A\\u0C5D\\u0C60\\u0C61\\u0C80\\u0C85-\\u0C8C\\u0C8E-\\u0C90\\u0C92-\\u0CA8\\u0CAA-\\u0CB3\\u0CB5-\\u0CB9\\u0CBD\\u0CDD\\u0CDE\\u0CE0\\u0CE1\\u0CF1\\u0CF2\\u0D04-\\u0D0C\\u0D0E-\\u0D10\\u0D12-\\u0D3A\\u0D3D\\u0D4E\\u0D54-\\u0D56\\u0D5F-\\u0D61\\u0D7A-\\u0D7F\\u0D85-\\u0D96\\u0D9A-\\u0DB1\\u0DB3-\\u0DBB\\u0DBD\\u0DC0-\\u0DC6\\u0E01-\\u0E30\\u0E32\\u0E33\\u0E40-\\u0E46\\u0E81\\u0E82\\u0E84\\u0E86-\\u0E8A\\u0E8C-\\u0EA3\\u0EA5\\u0EA7-\\u0EB0\\u0EB2\\u0EB3\\u0EBD\\u0EC0-\\u0EC4\\u0EC6\\u0EDC-\\u0EDF\\u0F00\\u0F40-\\u0F47\\u0F49-\\u0F6C\\u0F88-\\u0F8C\\u1000-\\u102A\\u103F\\u1050-\\u1055\\u105A-\\u105D\\u1061\\u1065\\u1066\\u106E-\\u1070\\u1075-\\u1081\\u108E\\u10A0-\\u10C5\\u10C7\\u10CD\\u10D0-\\u10FA\\u10FC-\\u1248\\u124A-\\u124D\\u1250-\\u1256\\u1258\\u125A-\\u125D\\u1260-\\u1288\\u128A-\\u128D\\u1290-\\u12B0\\u12B2-\\u12B5\\u12B8-\\u12BE\\u12C0\\u12C2-\\u12C5\\u12C8-\\u12D6\\u12D8-\\u1310\\u1312-\\u1315\\u1318-\\u135A\\u1380-\\u138F\\u13A0-\\u13F5\\u13F8-\\u13FD\\u1401-\\u166C\\u166F-\\u167F\\u1681-\\u169A\\u16A0-\\u16EA\\u16F1-\\u16F8\\u1700-\\u1711\\u171F-\\u1731\\u1740-\\u1751\\u1760-\\u176C\\u176E-\\u1770\\u1780-\\u17B3\\u17D7\\u17DC\\u1820-\\u1878\\u1880-\\u1884\\u1887-\\u18A8\\u18AA\\u18B0-\\u18F5\\u1900-\\u191E\\u1950-\\u196D\\u1970-\\u1974\\u1980-\\u19AB\\u19B0-\\u19C9\\u1A00-\\u1A16\\u1A20-\\u1A54\\u1AA7\\u1B05-\\u1B33\\u1B45-\\u1B4C\\u1B83-\\u1BA0\\u1BAE\\u1BAF\\u1BBA-\\u1BE5\\u1C00-\\u1C23\\u1C4D-\\u1C4F\\u1C5A-\\u1C7D\\u1C80-\\u1C88\\u1C90-\\u1CBA\\u1CBD-\\u1CBF\\u1CE9-\\u1CEC\\u1CEE-\\u1CF3\\u1CF5\\u1CF6\\u1CFA\\u1D00-\\u1DBF\\u1E00-\\u1F15\\u1F18-\\u1F1D\\u1F20-\\u1F45\\u1F48-\\u1F4D\\u1F50-\\u1F57\\u1F59\\u1F5B\\u1F5D\\u1F5F-\\u1F7D\\u1F80-\\u1FB4\\u1FB6-\\u1FBC\\u1FBE\\u1FC2-\\u1FC4\\u1FC6-\\u1FCC\\u1FD0-\\u1FD3\\u1FD6-\\u1FDB\\u1FE0-\\u1FEC\\u1FF2-\\u1FF4\\u1FF6-\\u1FFC\\u2071\\u207F\\u2090-\\u209C\\u2102\\u2107\\u210A-\\u2113\\u2115\\u2119-\\u211D\\u2124\\u2126\\u2128\\u212A-\\u212D\\u212F-\\u2139\\u213C-\\u213F\\u2145-\\u2149\\u214E\\u2183\\u2184\\u2C00-\\u2CE4\\u2CEB-\\u2CEE\\u2CF2\\u2CF3\\u2D00-\\u2D25\\u2D27\\u2D2D\\u2D30-\\u2D67\\u2D6F\\u2D80-\\u2D96\\u2DA0-\\u2DA6\\u2DA8-\\u2DAE\\u2DB0-\\u2DB6\\u2DB8-\\u2DBE\\u2DC0-\\u2DC6\\u2DC8-\\u2DCE\\u2DD0-\\u2DD6\\u2DD8-\\u2DDE\\u2E2F\\u3005\\u3006\\u3031-\\u3035\\u303B\\u303C\\u3041-\\u3096\\u309D-\\u309F\\u30A1-\\u30FA\\u30FC-\\u30FF\\u3105-\\u312F\\u3131-\\u318E\\u31A0-\\u31BF\\u31F0-\\u31FF\\u3400-\\u4DBF\\u4E00-\\uA48C\\uA4D0-\\uA4FD\\uA500-\\uA60C\\uA610-\\uA61F\\uA62A\\uA62B\\uA640-\\uA66E\\uA67F-\\uA69D\\uA6A0-\\uA6E5\\uA717-\\uA71F\\uA722-\\uA788\\uA78B-\\uA7CA\\uA7D0\\uA7D1\\uA7D3\\uA7D5-\\uA7D9\\uA7F2-\\uA801\\uA803-\\uA805\\uA807-\\uA80A\\uA80C-\\uA822\\uA840-\\uA873\\uA882-\\uA8B3\\uA8F2-\\uA8F7\\uA8FB\\uA8FD\\uA8FE\\uA90A-\\uA925\\uA930-\\uA946\\uA960-\\uA97C\\uA984-\\uA9B2\\uA9CF\\uA9E0-\\uA9E4\\uA9E6-\\uA9EF\\uA9FA-\\uA9FE\\uAA00-\\uAA28\\uAA40-\\uAA42\\uAA44-\\uAA4B\\uAA60-\\uAA76\\uAA7A\\uAA7E-\\uAAAF\\uAAB1\\uAAB5\\uAAB6\\uAAB9-\\uAABD\\uAAC0\\uAAC2\\uAADB-\\uAADD\\uAAE0-\\uAAEA\\uAAF2-\\uAAF4\\uAB01-\\uAB06\\uAB09-\\uAB0E\\uAB11-\\uAB16\\uAB20-\\uAB26\\uAB28-\\uAB2E\\uAB30-\\uAB5A\\uAB5C-\\uAB69\\uAB70-\\uABE2\\uAC00-\\uD7A3\\uD7B0-\\uD7C6\\uD7CB-\\uD7FB\\uF900-\\uFA6D\\uFA70-\\uFAD9\\uFB00-\\uFB06\\uFB13-\\uFB17\\uFB1D\\uFB1F-\\uFB28\\uFB2A-\\uFB36\\uFB38-\\uFB3C\\uFB3E\\uFB40\\uFB41\\uFB43\\uFB44\\uFB46-\\uFBB1\\uFBD3-\\uFD3D\\uFD50-\\uFD8F\\uFD92-\\uFDC7\\uFDF0-\\uFDFB\\uFE70-\\uFE74\\uFE76-\\uFEFC\\uFF21-\\uFF3A\\uFF41-\\uFF5A\\uFF66-\\uFFBE\\uFFC2-\\uFFC7\\uFFCA-\\uFFCF\\uFFD2-\\uFFD7\\uFFDA-\\uFFDC]|\\uD800[\\uDC00-\\uDC0B\\uDC0D-\\uDC26\\uDC28-\\uDC3A\\uDC3C\\uDC3D\\uDC3F-\\uDC4D\\uDC50-\\uDC5D\\uDC80-\\uDCFA\\uDE80-\\uDE9C\\uDEA0-\\uDED0\\uDF00-\\uDF1F\\uDF2D-\\uDF40\\uDF42-\\uDF49\\uDF50-\\uDF75\\uDF80-\\uDF9D\\uDFA0-\\uDFC3\\uDFC8-\\uDFCF]|\\uD801[\\uDC00-\\uDC9D\\uDCB0-\\uDCD3\\uDCD8-\\uDCFB\\uDD00-\\uDD27\\uDD30-\\uDD63\\uDD70-\\uDD7A\\uDD7C-\\uDD8A\\uDD8C-\\uDD92\\uDD94\\uDD95\\uDD97-\\uDDA1\\uDDA3-\\uDDB1\\uDDB3-\\uDDB9\\uDDBB\\uDDBC\\uDE00-\\uDF36\\uDF40-\\uDF55\\uDF60-\\uDF67\\uDF80-\\uDF85\\uDF87-\\uDFB0\\uDFB2-\\uDFBA]|\\uD802[\\uDC00-\\uDC05\\uDC08\\uDC0A-\\uDC35\\uDC37\\uDC38\\uDC3C\\uDC3F-\\uDC55\\uDC60-\\uDC76\\uDC80-\\uDC9E\\uDCE0-\\uDCF2\\uDCF4\\uDCF5\\uDD00-\\uDD15\\uDD20-\\uDD39\\uDD80-\\uDDB7\\uDDBE\\uDDBF\\uDE00\\uDE10-\\uDE13\\uDE15-\\uDE17\\uDE19-\\uDE35\\uDE60-\\uDE7C\\uDE80-\\uDE9C\\uDEC0-\\uDEC7\\uDEC9-\\uDEE4\\uDF00-\\uDF35\\uDF40-\\uDF55\\uDF60-\\uDF72\\uDF80-\\uDF91]|\\uD803[\\uDC00-\\uDC48\\uDC80-\\uDCB2\\uDCC0-\\uDCF2\\uDD00-\\uDD23\\uDE80-\\uDEA9\\uDEB0\\uDEB1\\uDF00-\\uDF1C\\uDF27\\uDF30-\\uDF45\\uDF70-\\uDF81\\uDFB0-\\uDFC4\\uDFE0-\\uDFF6]|\\uD804[\\uDC03-\\uDC37\\uDC71\\uDC72\\uDC75\\uDC83-\\uDCAF\\uDCD0-\\uDCE8\\uDD03-\\uDD26\\uDD44\\uDD47\\uDD50-\\uDD72\\uDD76\\uDD83-\\uDDB2\\uDDC1-\\uDDC4\\uDDDA\\uDDDC\\uDE00-\\uDE11\\uDE13-\\uDE2B\\uDE80-\\uDE86\\uDE88\\uDE8A-\\uDE8D\\uDE8F-\\uDE9D\\uDE9F-\\uDEA8\\uDEB0-\\uDEDE\\uDF05-\\uDF0C\\uDF0F\\uDF10\\uDF13-\\uDF28\\uDF2A-\\uDF30\\uDF32\\uDF33\\uDF35-\\uDF39\\uDF3D\\uDF50\\uDF5D-\\uDF61]|\\uD805[\\uDC00-\\uDC34\\uDC47-\\uDC4A\\uDC5F-\\uDC61\\uDC80-\\uDCAF\\uDCC4\\uDCC5\\uDCC7\\uDD80-\\uDDAE\\uDDD8-\\uDDDB\\uDE00-\\uDE2F\\uDE44\\uDE80-\\uDEAA\\uDEB8\\uDF00-\\uDF1A\\uDF40-\\uDF46]|\\uD806[\\uDC00-\\uDC2B\\uDCA0-\\uDCDF\\uDCFF-\\uDD06\\uDD09\\uDD0C-\\uDD13\\uDD15\\uDD16\\uDD18-\\uDD2F\\uDD3F\\uDD41\\uDDA0-\\uDDA7\\uDDAA-\\uDDD0\\uDDE1\\uDDE3\\uDE00\\uDE0B-\\uDE32\\uDE3A\\uDE50\\uDE5C-\\uDE89\\uDE9D\\uDEB0-\\uDEF8]|\\uD807[\\uDC00-\\uDC08\\uDC0A-\\uDC2E\\uDC40\\uDC72-\\uDC8F\\uDD00-\\uDD06\\uDD08\\uDD09\\uDD0B-\\uDD30\\uDD46\\uDD60-\\uDD65\\uDD67\\uDD68\\uDD6A-\\uDD89\\uDD98\\uDEE0-\\uDEF2\\uDFB0]|\\uD808[\\uDC00-\\uDF99]|\\uD809[\\uDC80-\\uDD43]|\\uD80B[\\uDF90-\\uDFF0]|[\\uD80C\\uD81C-\\uD820\\uD822\\uD840-\\uD868\\uD86A-\\uD86C\\uD86F-\\uD872\\uD874-\\uD879\\uD880-\\uD883][\\uDC00-\\uDFFF]|\\uD80D[\\uDC00-\\uDC2E]|\\uD811[\\uDC00-\\uDE46]|\\uD81A[\\uDC00-\\uDE38\\uDE40-\\uDE5E\\uDE70-\\uDEBE\\uDED0-\\uDEED\\uDF00-\\uDF2F\\uDF40-\\uDF43\\uDF63-\\uDF77\\uDF7D-\\uDF8F]|\\uD81B[\\uDE40-\\uDE7F\\uDF00-\\uDF4A\\uDF50\\uDF93-\\uDF9F\\uDFE0\\uDFE1\\uDFE3]|\\uD821[\\uDC00-\\uDFF7]|\\uD823[\\uDC00-\\uDCD5\\uDD00-\\uDD08]|\\uD82B[\\uDFF0-\\uDFF3\\uDFF5-\\uDFFB\\uDFFD\\uDFFE]|\\uD82C[\\uDC00-\\uDD22\\uDD50-\\uDD52\\uDD64-\\uDD67\\uDD70-\\uDEFB]|\\uD82F[\\uDC00-\\uDC6A\\uDC70-\\uDC7C\\uDC80-\\uDC88\\uDC90-\\uDC99]|\\uD835[\\uDC00-\\uDC54\\uDC56-\\uDC9C\\uDC9E\\uDC9F\\uDCA2\\uDCA5\\uDCA6\\uDCA9-\\uDCAC\\uDCAE-\\uDCB9\\uDCBB\\uDCBD-\\uDCC3\\uDCC5-\\uDD05\\uDD07-\\uDD0A\\uDD0D-\\uDD14\\uDD16-\\uDD1C\\uDD1E-\\uDD39\\uDD3B-\\uDD3E\\uDD40-\\uDD44\\uDD46\\uDD4A-\\uDD50\\uDD52-\\uDEA5\\uDEA8-\\uDEC0\\uDEC2-\\uDEDA\\uDEDC-\\uDEFA\\uDEFC-\\uDF14\\uDF16-\\uDF34\\uDF36-\\uDF4E\\uDF50-\\uDF6E\\uDF70-\\uDF88\\uDF8A-\\uDFA8\\uDFAA-\\uDFC2\\uDFC4-\\uDFCB]|\\uD837[\\uDF00-\\uDF1E]|\\uD838[\\uDD00-\\uDD2C\\uDD37-\\uDD3D\\uDD4E\\uDE90-\\uDEAD\\uDEC0-\\uDEEB]|\\uD839[\\uDFE0-\\uDFE6\\uDFE8-\\uDFEB\\uDFED\\uDFEE\\uDFF0-\\uDFFE]|\\uD83A[\\uDC00-\\uDCC4\\uDD00-\\uDD43\\uDD4B]|\\uD83B[\\uDE00-\\uDE03\\uDE05-\\uDE1F\\uDE21\\uDE22\\uDE24\\uDE27\\uDE29-\\uDE32\\uDE34-\\uDE37\\uDE39\\uDE3B\\uDE42\\uDE47\\uDE49\\uDE4B\\uDE4D-\\uDE4F\\uDE51\\uDE52\\uDE54\\uDE57\\uDE59\\uDE5B\\uDE5D\\uDE5F\\uDE61\\uDE62\\uDE64\\uDE67-\\uDE6A\\uDE6C-\\uDE72\\uDE74-\\uDE77\\uDE79-\\uDE7C\\uDE7E\\uDE80-\\uDE89\\uDE8B-\\uDE9B\\uDEA1-\\uDEA3\\uDEA5-\\uDEA9\\uDEAB-\\uDEBB]|\\uD869[\\uDC00-\\uDEDF\\uDF00-\\uDFFF]|\\uD86D[\\uDC00-\\uDF38\\uDF40-\\uDFFF]|\\uD86E[\\uDC00-\\uDC1D\\uDC20-\\uDFFF]|\\uD873[\\uDC00-\\uDEA1\\uDEB0-\\uDFFF]|\\uD87A[\\uDC00-\\uDFE0]|\\uD87E[\\uDC00-\\uDE1D]|\\uD884[\\uDC00-\\uDF4A])(?:[0-9A-Za-z\\xAA\\xB5\\xBA\\xC0-\\xD6\\xD8-\\xF6\\xF8-\\u02C1\\u02C6-\\u02D1\\u02E0-\\u02E4\\u02EC\\u02EE\\u0370-\\u0374\\u0376\\u0377\\u037A-\\u037D\\u037F\\u0386\\u0388-\\u038A\\u038C\\u038E-\\u03A1\\u03A3-\\u03F5\\u03F7-\\u0481\\u048A-\\u052F\\u0531-\\u0556\\u0559\\u0560-\\u0588\\u05D0-\\u05EA\\u05EF-\\u05F2\\u0620-\\u064A\\u066E\\u066F\\u0671-\\u06D3\\u06D5\\u06E5\\u06E6\\u06EE\\u06EF\\u06FA-\\u06FC\\u06FF\\u0710\\u0712-\\u072F\\u074D-\\u07A5\\u07B1\\u07CA-\\u07EA\\u07F4\\u07F5\\u07FA\\u0800-\\u0815\\u081A\\u0824\\u0828\\u0840-\\u0858\\u0860-\\u086A\\u0870-\\u0887\\u0889-\\u088E\\u08A0-\\u08C9\\u0904-\\u0939\\u093D\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098C\\u098F\\u0990\\u0993-\\u09A8\\u09AA-\\u09B0\\u09B2\\u09B6-\\u09B9\\u09BD\\u09CE\\u09DC\\u09DD\\u09DF-\\u09E1\\u09F0\\u09F1\\u09FC\\u0A05-\\u0A0A\\u0A0F\\u0A10\\u0A13-\\u0A28\\u0A2A-\\u0A30\\u0A32\\u0A33\\u0A35\\u0A36\\u0A38\\u0A39\\u0A59-\\u0A5C\\u0A5E\\u0A72-\\u0A74\\u0A85-\\u0A8D\\u0A8F-\\u0A91\\u0A93-\\u0AA8\\u0AAA-\\u0AB0\\u0AB2\\u0AB3\\u0AB5-\\u0AB9\\u0ABD\\u0AD0\\u0AE0\\u0AE1\\u0AF9\\u0B05-\\u0B0C\\u0B0F\\u0B10\\u0B13-\\u0B28\\u0B2A-\\u0B30\\u0B32\\u0B33\\u0B35-\\u0B39\\u0B3D\\u0B5C\\u0B5D\\u0B5F-\\u0B61\\u0B71\\u0B83\\u0B85-\\u0B8A\\u0B8E-\\u0B90\\u0B92-\\u0B95\\u0B99\\u0B9A\\u0B9C\\u0B9E\\u0B9F\\u0BA3\\u0BA4\\u0BA8-\\u0BAA\\u0BAE-\\u0BB9\\u0BD0\\u0C05-\\u0C0C\\u0C0E-\\u0C10\\u0C12-\\u0C28\\u0C2A-\\u0C39\\u0C3D\\u0C58-\\u0C5A\\u0C5D\\u0C60\\u0C61\\u0C80\\u0C85-\\u0C8C\\u0C8E-\\u0C90\\u0C92-\\u0CA8\\u0CAA-\\u0CB3\\u0CB5-\\u0CB9\\u0CBD\\u0CDD\\u0CDE\\u0CE0\\u0CE1\\u0CF1\\u0CF2\\u0D04-\\u0D0C\\u0D0E-\\u0D10\\u0D12-\\u0D3A\\u0D3D\\u0D4E\\u0D54-\\u0D56\\u0D5F-\\u0D61\\u0D7A-\\u0D7F\\u0D85-\\u0D96\\u0D9A-\\u0DB1\\u0DB3-\\u0DBB\\u0DBD\\u0DC0-\\u0DC6\\u0E01-\\u0E30\\u0E32\\u0E33\\u0E40-\\u0E46\\u0E81\\u0E82\\u0E84\\u0E86-\\u0E8A\\u0E8C-\\u0EA3\\u0EA5\\u0EA7-\\u0EB0\\u0EB2\\u0EB3\\u0EBD\\u0EC0-\\u0EC4\\u0EC6\\u0EDC-\\u0EDF\\u0F00\\u0F40-\\u0F47\\u0F49-\\u0F6C\\u0F88-\\u0F8C\\u1000-\\u102A\\u103F\\u1050-\\u1055\\u105A-\\u105D\\u1061\\u1065\\u1066\\u106E-\\u1070\\u1075-\\u1081\\u108E\\u10A0-\\u10C5\\u10C7\\u10CD\\u10D0-\\u10FA\\u10FC-\\u1248\\u124A-\\u124D\\u1250-\\u1256\\u1258\\u125A-\\u125D\\u1260-\\u1288\\u128A-\\u128D\\u1290-\\u12B0\\u12B2-\\u12B5\\u12B8-\\u12BE\\u12C0\\u12C2-\\u12C5\\u12C8-\\u12D6\\u12D8-\\u1310\\u1312-\\u1315\\u1318-\\u135A\\u1380-\\u138F\\u13A0-\\u13F5\\u13F8-\\u13FD\\u1401-\\u166C\\u166F-\\u167F\\u1681-\\u169A\\u16A0-\\u16EA\\u16F1-\\u16F8\\u1700-\\u1711\\u171F-\\u1731\\u1740-\\u1751\\u1760-\\u176C\\u176E-\\u1770\\u1780-\\u17B3\\u17D7\\u17DC\\u1820-\\u1878\\u1880-\\u1884\\u1887-\\u18A8\\u18AA\\u18B0-\\u18F5\\u1900-\\u191E\\u1950-\\u196D\\u1970-\\u1974\\u1980-\\u19AB\\u19B0-\\u19C9\\u1A00-\\u1A16\\u1A20-\\u1A54\\u1AA7\\u1B05-\\u1B33\\u1B45-\\u1B4C\\u1B83-\\u1BA0\\u1BAE\\u1BAF\\u1BBA-\\u1BE5\\u1C00-\\u1C23\\u1C4D-\\u1C4F\\u1C5A-\\u1C7D\\u1C80-\\u1C88\\u1C90-\\u1CBA\\u1CBD-\\u1CBF\\u1CE9-\\u1CEC\\u1CEE-\\u1CF3\\u1CF5\\u1CF6\\u1CFA\\u1D00-\\u1DBF\\u1E00-\\u1F15\\u1F18-\\u1F1D\\u1F20-\\u1F45\\u1F48-\\u1F4D\\u1F50-\\u1F57\\u1F59\\u1F5B\\u1F5D\\u1F5F-\\u1F7D\\u1F80-\\u1FB4\\u1FB6-\\u1FBC\\u1FBE\\u1FC2-\\u1FC4\\u1FC6-\\u1FCC\\u1FD0-\\u1FD3\\u1FD6-\\u1FDB\\u1FE0-\\u1FEC\\u1FF2-\\u1FF4\\u1FF6-\\u1FFC\\u2071\\u207F\\u2090-\\u209C\\u2102\\u2107\\u210A-\\u2113\\u2115\\u2119-\\u211D\\u2124\\u2126\\u2128\\u212A-\\u212D\\u212F-\\u2139\\u213C-\\u213F\\u2145-\\u2149\\u214E\\u2183\\u2184\\u2C00-\\u2CE4\\u2CEB-\\u2CEE\\u2CF2\\u2CF3\\u2D00-\\u2D25\\u2D27\\u2D2D\\u2D30-\\u2D67\\u2D6F\\u2D80-\\u2D96\\u2DA0-\\u2DA6\\u2DA8-\\u2DAE\\u2DB0-\\u2DB6\\u2DB8-\\u2DBE\\u2DC0-\\u2DC6\\u2DC8-\\u2DCE\\u2DD0-\\u2DD6\\u2DD8-\\u2DDE\\u2E2F\\u3005\\u3006\\u3031-\\u3035\\u303B\\u303C\\u3041-\\u3096\\u309D-\\u309F\\u30A1-\\u30FA\\u30FC-\\u30FF\\u3105-\\u312F\\u3131-\\u318E\\u31A0-\\u31BF\\u31F0-\\u31FF\\u3400-\\u4DBF\\u4E00-\\uA48C\\uA4D0-\\uA4FD\\uA500-\\uA60C\\uA610-\\uA61F\\uA62A\\uA62B\\uA640-\\uA66E\\uA67F-\\uA69D\\uA6A0-\\uA6E5\\uA717-\\uA71F\\uA722-\\uA788\\uA78B-\\uA7CA\\uA7D0\\uA7D1\\uA7D3\\uA7D5-\\uA7D9\\uA7F2-\\uA801\\uA803-\\uA805\\uA807-\\uA80A\\uA80C-\\uA822\\uA840-\\uA873\\uA882-\\uA8B3\\uA8F2-\\uA8F7\\uA8FB\\uA8FD\\uA8FE\\uA90A-\\uA925\\uA930-\\uA946\\uA960-\\uA97C\\uA984-\\uA9B2\\uA9CF\\uA9E0-\\uA9E4\\uA9E6-\\uA9EF\\uA9FA-\\uA9FE\\uAA00-\\uAA28\\uAA40-\\uAA42\\uAA44-\\uAA4B\\uAA60-\\uAA76\\uAA7A\\uAA7E-\\uAAAF\\uAAB1\\uAAB5\\uAAB6\\uAAB9-\\uAABD\\uAAC0\\uAAC2\\uAADB-\\uAADD\\uAAE0-\\uAAEA\\uAAF2-\\uAAF4\\uAB01-\\uAB06\\uAB09-\\uAB0E\\uAB11-\\uAB16\\uAB20-\\uAB26\\uAB28-\\uAB2E\\uAB30-\\uAB5A\\uAB5C-\\uAB69\\uAB70-\\uABE2\\uAC00-\\uD7A3\\uD7B0-\\uD7C6\\uD7CB-\\uD7FB\\uF900-\\uFA6D\\uFA70-\\uFAD9\\uFB00-\\uFB06\\uFB13-\\uFB17\\uFB1D\\uFB1F-\\uFB28\\uFB2A-\\uFB36\\uFB38-\\uFB3C\\uFB3E\\uFB40\\uFB41\\uFB43\\uFB44\\uFB46-\\uFBB1\\uFBD3-\\uFD3D\\uFD50-\\uFD8F\\uFD92-\\uFDC7\\uFDF0-\\uFDFB\\uFE70-\\uFE74\\uFE76-\\uFEFC\\uFF21-\\uFF3A\\uFF41-\\uFF5A\\uFF66-\\uFFBE\\uFFC2-\\uFFC7\\uFFCA-\\uFFCF\\uFFD2-\\uFFD7\\uFFDA-\\uFFDC]|\\uD800[\\uDC00-\\uDC0B\\uDC0D-\\uDC26\\uDC28-\\uDC3A\\uDC3C\\uDC3D\\uDC3F-\\uDC4D\\uDC50-\\uDC5D\\uDC80-\\uDCFA\\uDE80-\\uDE9C\\uDEA0-\\uDED0\\uDF00-\\uDF1F\\uDF2D-\\uDF40\\uDF42-\\uDF49\\uDF50-\\uDF75\\uDF80-\\uDF9D\\uDFA0-\\uDFC3\\uDFC8-\\uDFCF]|\\uD801[\\uDC00-\\uDC9D\\uDCB0-\\uDCD3\\uDCD8-\\uDCFB\\uDD00-\\uDD27\\uDD30-\\uDD63\\uDD70-\\uDD7A\\uDD7C-\\uDD8A\\uDD8C-\\uDD92\\uDD94\\uDD95\\uDD97-\\uDDA1\\uDDA3-\\uDDB1\\uDDB3-\\uDDB9\\uDDBB\\uDDBC\\uDE00-\\uDF36\\uDF40-\\uDF55\\uDF60-\\uDF67\\uDF80-\\uDF85\\uDF87-\\uDFB0\\uDFB2-\\uDFBA]|\\uD802[\\uDC00-\\uDC05\\uDC08\\uDC0A-\\uDC35\\uDC37\\uDC38\\uDC3C\\uDC3F-\\uDC55\\uDC60-\\uDC76\\uDC80-\\uDC9E\\uDCE0-\\uDCF2\\uDCF4\\uDCF5\\uDD00-\\uDD15\\uDD20-\\uDD39\\uDD80-\\uDDB7\\uDDBE\\uDDBF\\uDE00\\uDE10-\\uDE13\\uDE15-\\uDE17\\uDE19-\\uDE35\\uDE60-\\uDE7C\\uDE80-\\uDE9C\\uDEC0-\\uDEC7\\uDEC9-\\uDEE4\\uDF00-\\uDF35\\uDF40-\\uDF55\\uDF60-\\uDF72\\uDF80-\\uDF91]|\\uD803[\\uDC00-\\uDC48\\uDC80-\\uDCB2\\uDCC0-\\uDCF2\\uDD00-\\uDD23\\uDE80-\\uDEA9\\uDEB0\\uDEB1\\uDF00-\\uDF1C\\uDF27\\uDF30-\\uDF45\\uDF70-\\uDF81\\uDFB0-\\uDFC4\\uDFE0-\\uDFF6]|\\uD804[\\uDC03-\\uDC37\\uDC71\\uDC72\\uDC75\\uDC83-\\uDCAF\\uDCD0-\\uDCE8\\uDD03-\\uDD26\\uDD44\\uDD47\\uDD50-\\uDD72\\uDD76\\uDD83-\\uDDB2\\uDDC1-\\uDDC4\\uDDDA\\uDDDC\\uDE00-\\uDE11\\uDE13-\\uDE2B\\uDE80-\\uDE86\\uDE88\\uDE8A-\\uDE8D\\uDE8F-\\uDE9D\\uDE9F-\\uDEA8\\uDEB0-\\uDEDE\\uDF05-\\uDF0C\\uDF0F\\uDF10\\uDF13-\\uDF28\\uDF2A-\\uDF30\\uDF32\\uDF33\\uDF35-\\uDF39\\uDF3D\\uDF50\\uDF5D-\\uDF61]|\\uD805[\\uDC00-\\uDC34\\uDC47-\\uDC4A\\uDC5F-\\uDC61\\uDC80-\\uDCAF\\uDCC4\\uDCC5\\uDCC7\\uDD80-\\uDDAE\\uDDD8-\\uDDDB\\uDE00-\\uDE2F\\uDE44\\uDE80-\\uDEAA\\uDEB8\\uDF00-\\uDF1A\\uDF40-\\uDF46]|\\uD806[\\uDC00-\\uDC2B\\uDCA0-\\uDCDF\\uDCFF-\\uDD06\\uDD09\\uDD0C-\\uDD13\\uDD15\\uDD16\\uDD18-\\uDD2F\\uDD3F\\uDD41\\uDDA0-\\uDDA7\\uDDAA-\\uDDD0\\uDDE1\\uDDE3\\uDE00\\uDE0B-\\uDE32\\uDE3A\\uDE50\\uDE5C-\\uDE89\\uDE9D\\uDEB0-\\uDEF8]|\\uD807[\\uDC00-\\uDC08\\uDC0A-\\uDC2E\\uDC40\\uDC72-\\uDC8F\\uDD00-\\uDD06\\uDD08\\uDD09\\uDD0B-\\uDD30\\uDD46\\uDD60-\\uDD65\\uDD67\\uDD68\\uDD6A-\\uDD89\\uDD98\\uDEE0-\\uDEF2\\uDFB0]|\\uD808[\\uDC00-\\uDF99]|\\uD809[\\uDC80-\\uDD43]|\\uD80B[\\uDF90-\\uDFF0]|[\\uD80C\\uD81C-\\uD820\\uD822\\uD840-\\uD868\\uD86A-\\uD86C\\uD86F-\\uD872\\uD874-\\uD879\\uD880-\\uD883][\\uDC00-\\uDFFF]|\\uD80D[\\uDC00-\\uDC2E]|\\uD811[\\uDC00-\\uDE46]|\\uD81A[\\uDC00-\\uDE38\\uDE40-\\uDE5E\\uDE70-\\uDEBE\\uDED0-\\uDEED\\uDF00-\\uDF2F\\uDF40-\\uDF43\\uDF63-\\uDF77\\uDF7D-\\uDF8F]|\\uD81B[\\uDE40-\\uDE7F\\uDF00-\\uDF4A\\uDF50\\uDF93-\\uDF9F\\uDFE0\\uDFE1\\uDFE3]|\\uD821[\\uDC00-\\uDFF7]|\\uD823[\\uDC00-\\uDCD5\\uDD00-\\uDD08]|\\uD82B[\\uDFF0-\\uDFF3\\uDFF5-\\uDFFB\\uDFFD\\uDFFE]|\\uD82C[\\uDC00-\\uDD22\\uDD50-\\uDD52\\uDD64-\\uDD67\\uDD70-\\uDEFB]|\\uD82F[\\uDC00-\\uDC6A\\uDC70-\\uDC7C\\uDC80-\\uDC88\\uDC90-\\uDC99]|\\uD835[\\uDC00-\\uDC54\\uDC56-\\uDC9C\\uDC9E\\uDC9F\\uDCA2\\uDCA5\\uDCA6\\uDCA9-\\uDCAC\\uDCAE-\\uDCB9\\uDCBB\\uDCBD-\\uDCC3\\uDCC5-\\uDD05\\uDD07-\\uDD0A\\uDD0D-\\uDD14\\uDD16-\\uDD1C\\uDD1E-\\uDD39\\uDD3B-\\uDD3E\\uDD40-\\uDD44\\uDD46\\uDD4A-\\uDD50\\uDD52-\\uDEA5\\uDEA8-\\uDEC0\\uDEC2-\\uDEDA\\uDEDC-\\uDEFA\\uDEFC-\\uDF14\\uDF16-\\uDF34\\uDF36-\\uDF4E\\uDF50-\\uDF6E\\uDF70-\\uDF88\\uDF8A-\\uDFA8\\uDFAA-\\uDFC2\\uDFC4-\\uDFCB]|\\uD837[\\uDF00-\\uDF1E]|\\uD838[\\uDD00-\\uDD2C\\uDD37-\\uDD3D\\uDD4E\\uDE90-\\uDEAD\\uDEC0-\\uDEEB]|\\uD839[\\uDFE0-\\uDFE6\\uDFE8-\\uDFEB\\uDFED\\uDFEE\\uDFF0-\\uDFFE]|\\uD83A[\\uDC00-\\uDCC4\\uDD00-\\uDD43\\uDD4B]|\\uD83B[\\uDE00-\\uDE03\\uDE05-\\uDE1F\\uDE21\\uDE22\\uDE24\\uDE27\\uDE29-\\uDE32\\uDE34-\\uDE37\\uDE39\\uDE3B\\uDE42\\uDE47\\uDE49\\uDE4B\\uDE4D-\\uDE4F\\uDE51\\uDE52\\uDE54\\uDE57\\uDE59\\uDE5B\\uDE5D\\uDE5F\\uDE61\\uDE62\\uDE64\\uDE67-\\uDE6A\\uDE6C-\\uDE72\\uDE74-\\uDE77\\uDE79-\\uDE7C\\uDE7E\\uDE80-\\uDE89\\uDE8B-\\uDE9B\\uDEA1-\\uDEA3\\uDEA5-\\uDEA9\\uDEAB-\\uDEBB]|\\uD869[\\uDC00-\\uDEDF\\uDF00-\\uDFFF]|\\uD86D[\\uDC00-\\uDF38\\uDF40-\\uDFFF]|\\uD86E[\\uDC00-\\uDC1D\\uDC20-\\uDFFF]|\\uD873[\\uDC00-\\uDEA1\\uDEB0-\\uDFFF]|\\uD87A[\\uDC00-\\uDFE0]|\\uD87E[\\uDC00-\\uDE1D]|\\uD884[\\uDC00-\\uDF4A])*$/.test(s);\n    }\n  }, {\n    name: 'string',\n    test: _is.isString\n  }, {\n    name: 'Chain',\n    test: _is.isChain\n  }, {\n    name: 'Array',\n    test: _is.isArray\n  }, {\n    name: 'Matrix',\n    test: _is.isMatrix\n  }, {\n    name: 'DenseMatrix',\n    test: _is.isDenseMatrix\n  }, {\n    name: 'SparseMatrix',\n    test: _is.isSparseMatrix\n  }, {\n    name: 'Range',\n    test: _is.isRange\n  }, {\n    name: 'Index',\n    test: _is.isIndex\n  }, {\n    name: 'boolean',\n    test: _is.isBoolean\n  }, {\n    name: 'ResultSet',\n    test: _is.isResultSet\n  }, {\n    name: 'Help',\n    test: _is.isHelp\n  }, {\n    name: 'function',\n    test: _is.isFunction\n  }, {\n    name: 'Date',\n    test: _is.isDate\n  }, {\n    name: 'RegExp',\n    test: _is.isRegExp\n  }, {\n    name: 'null',\n    test: _is.isNull\n  }, {\n    name: 'undefined',\n    test: _is.isUndefined\n  }, {\n    name: 'AccessorNode',\n    test: _is.isAccessorNode\n  }, {\n    name: 'ArrayNode',\n    test: _is.isArrayNode\n  }, {\n    name: 'AssignmentNode',\n    test: _is.isAssignmentNode\n  }, {\n    name: 'BlockNode',\n    test: _is.isBlockNode\n  }, {\n    name: 'ConditionalNode',\n    test: _is.isConditionalNode\n  }, {\n    name: 'ConstantNode',\n    test: _is.isConstantNode\n  }, {\n    name: 'FunctionNode',\n    test: _is.isFunctionNode\n  }, {\n    name: 'FunctionAssignmentNode',\n    test: _is.isFunctionAssignmentNode\n  }, {\n    name: 'IndexNode',\n    test: _is.isIndexNode\n  }, {\n    name: 'Node',\n    test: _is.isNode\n  }, {\n    name: 'ObjectNode',\n    test: _is.isObjectNode\n  }, {\n    name: 'OperatorNode',\n    test: _is.isOperatorNode\n  }, {\n    name: 'ParenthesisNode',\n    test: _is.isParenthesisNode\n  }, {\n    name: 'RangeNode',\n    test: _is.isRangeNode\n  }, {\n    name: 'RelationalNode',\n    test: _is.isRelationalNode\n  }, {\n    name: 'SymbolNode',\n    test: _is.isSymbolNode\n  }, {\n    name: 'Map',\n    test: _map.isMap\n  }, {\n    name: 'Object',\n    test: _is.isObject\n  } // order 'Object' last, it matches on other classes too\n  ]);\n\n  typed.addConversions([{\n    from: 'number',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      if (!BigNumber) {\n        throwNoBignumber(x);\n      }\n\n      // note: conversion from number to BigNumber can fail if x has >15 digits\n      if ((0, _number.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      return new BigNumber(x);\n    }\n  }, {\n    from: 'number',\n    to: 'Complex',\n    convert: function convert(x) {\n      if (!Complex) {\n        throwNoComplex(x);\n      }\n      return new Complex(x, 0);\n    }\n  }, {\n    from: 'BigNumber',\n    to: 'Complex',\n    convert: function convert(x) {\n      if (!Complex) {\n        throwNoComplex(x);\n      }\n      return new 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      if (!Complex) {\n        throwNoComplex(x);\n      }\n      return new Complex(x.valueOf(), 0);\n    }\n  }, {\n    from: 'number',\n    to: 'Fraction',\n    convert: function convert(x) {\n      if (!Fraction) {\n        throwNoFraction(x);\n      }\n      var f = new Fraction(x);\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      return f;\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      if (isNaN(n)) {\n        throw new Error('Cannot convert \"' + x + '\" to a number');\n      }\n      return n;\n    }\n  }, {\n    from: 'string',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      if (!BigNumber) {\n        throwNoBignumber(x);\n      }\n      try {\n        return new 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      if (!Fraction) {\n        throwNoFraction(x);\n      }\n      try {\n        return new 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      if (!Complex) {\n        throwNoComplex(x);\n      }\n      try {\n        return new 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      if (!BigNumber) {\n        throwNoBignumber(x);\n      }\n      return new BigNumber(+x);\n    }\n  }, {\n    from: 'boolean',\n    to: 'Fraction',\n    convert: function convert(x) {\n      if (!Fraction) {\n        throwNoFraction(x);\n      }\n      return new Fraction(+x);\n    }\n  }, {\n    from: 'boolean',\n    to: 'string',\n    convert: function convert(x) {\n      return String(x);\n    }\n  }, {\n    from: 'Array',\n    to: 'Matrix',\n    convert: function convert(array) {\n      if (!DenseMatrix) {\n        throwNoMatrix();\n      }\n      return new DenseMatrix(array);\n    }\n  }, {\n    from: 'Matrix',\n    to: 'Array',\n    convert: function convert(matrix) {\n      return matrix.valueOf();\n    }\n  }]);\n\n  // Provide a suggestion on how to call a function elementwise\n  // This was added primarily as guidance for the v10 -> v11 transition,\n  // and could potentially be removed in the future if it no longer seems\n  // to be helpful.\n  typed.onMismatch = function (name, args, signatures) {\n    var usualError = typed.createError(name, args, signatures);\n    if (['wrongType', 'mismatch'].includes(usualError.data.category) && args.length === 1 && (0, _is.isCollection)(args[0]) &&\n    // check if the function can be unary:\n    signatures.some(function (sig) {\n      return !sig.params.includes(',');\n    })) {\n      var err = new TypeError(\"Function '\".concat(name, \"' doesn't apply to matrices. To call it \") + \"elementwise on a matrix 'M', try 'map(M, \".concat(name, \")'.\"));\n      err.data = usualError.data;\n      throw err;\n    }\n    throw usualError;\n  };\n\n  // Provide a suggestion on how to call a function elementwise\n  // This was added primarily as guidance for the v10 -> v11 transition,\n  // and could potentially be removed in the future if it no longer seems\n  // to be helpful.\n  typed.onMismatch = function (name, args, signatures) {\n    var usualError = typed.createError(name, args, signatures);\n    if (['wrongType', 'mismatch'].includes(usualError.data.category) && args.length === 1 && (0, _is.isCollection)(args[0]) &&\n    // check if the function can be unary:\n    signatures.some(function (sig) {\n      return !sig.params.includes(',');\n    })) {\n      var err = new TypeError(\"Function '\".concat(name, \"' doesn't apply to matrices. To call it \") + \"elementwise on a matrix 'M', try 'map(M, \".concat(name, \")'.\"));\n      err.data = usualError.data;\n      throw err;\n    }\n    throw usualError;\n  };\n  return typed;\n});\nexports.createTyped = createTyped;\nfunction throwNoBignumber(x) {\n  throw new Error(\"Cannot convert value \".concat(x, \" into a BigNumber: no class 'BigNumber' provided\"));\n}\nfunction throwNoComplex(x) {\n  throw new Error(\"Cannot convert value \".concat(x, \" into a Complex number: no class 'Complex' provided\"));\n}\nfunction throwNoMatrix() {\n  throw new Error('Cannot convert array into a Matrix: no class \\'DenseMatrix\\' provided');\n}\nfunction throwNoFraction(x) {\n  throw new Error(\"Cannot convert value \".concat(x, \" into a Fraction, no class 'Fraction' provided.\"));\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createResultSet = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'ResultSet';\nvar dependencies = [];\nvar createResultSet = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function () {\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    this.entries = entries || [];\n  }\n\n  /**\n   * Attach type information\n   */\n  ResultSet.prototype.type = 'ResultSet';\n  ResultSet.prototype.isResultSet = true;\n\n  /**\n   * Returns the array with results hold by this ResultSet\n   * @memberof ResultSet\n   * @returns {Array} entries\n   */\n  ResultSet.prototype.valueOf = function () {\n    return this.entries;\n  };\n\n  /**\n   * Returns the stringified results of the ResultSet\n   * @memberof ResultSet\n   * @returns {string} string\n   */\n  ResultSet.prototype.toString = function () {\n    return '[' + this.entries.join(', ') + ']';\n  };\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  ResultSet.prototype.toJSON = function () {\n    return {\n      mathjs: 'ResultSet',\n      entries: this.entries\n    };\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  ResultSet.fromJSON = function (json) {\n    return new ResultSet(json.entries);\n  };\n  return ResultSet;\n}, {\n  isClass: true\n});\nexports.createResultSet = createResultSet;",";(function (globalScope) {\r\n  'use strict';\r\n\r\n\r\n  /*!\r\n   *  decimal.js v10.4.3\r\n   *  An arbitrary-precision Decimal type for JavaScript.\r\n   *  https://github.com/MikeMcl/decimal.js\r\n   *  Copyright (c) 2022 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    tag = '[object Decimal]',\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 = { toStringTag: tag };\r\n\r\n\r\n  // Decimal prototype methods\r\n\r\n\r\n  /*\r\n   *  absoluteValue             abs\r\n   *  ceil\r\n   *  clampedTo                 clamp\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 a new Decimal whose value is the value of this Decimal clamped to the range\r\n   * delineated by `min` and `max`.\r\n   *\r\n   * min {number|string|Decimal}\r\n   * max {number|string|Decimal}\r\n   *\r\n   */\r\n  P.clampedTo = P.clamp = function (min, max) {\r\n    var k,\r\n      x = this,\r\n      Ctor = x.constructor;\r\n    min = new Ctor(min);\r\n    max = new Ctor(max);\r\n    if (!min.s || !max.s) return new Ctor(NaN);\r\n    if (min.gt(max)) throw Error(invalidArgument + max);\r\n    k = x.cmp(min);\r\n    return k < 0 ? min : x.cmp(max) > 0 ? max : new Ctor(x);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return\r\n   *   1    if the value of this Decimal is greater than the value of `y`,\r\n   *  -1    if the value of this Decimal is less than the value of `y`,\r\n   *   0    if they have the same value,\r\n   *   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 * mathpow(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 = mathpow(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 = (1 / tinyPow(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(1 / tinyPow(5, k));\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 = '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    } 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  // 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, len, y;\r\n\r\n    if (x.isZero()) return x;\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    len = x.d.length;\r\n    if (len < 32) {\r\n      k = Math.ceil(len / 3);\r\n      y = (1 / tinyPow(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.indexOf('_') > -1) {\r\n      str = str.replace(/(\\d)_(?=\\d)/g, '$1');\r\n      if (isDecimal.test(str)) return parseDecimal(x, str);\r\n    } else 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 ? mathpow(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) {\r\n      return x.isZero() ? x : taylorSeries(Ctor, 2, x, x);\r\n    }\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    x = x.times(1 / tinyPow(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  // Exponent e must be positive and non-zero.\r\n  function tinyPow(b, e) {\r\n    var n = b;\r\n    while (--e) n *= b;\r\n    return n;\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   *  clamp\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   *  sum\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   * Return a new Decimal whose value is `x` clamped to the range delineated by `min` and `max`.\r\n   *\r\n   * x {number|string|Decimal}\r\n   * min {number|string|Decimal}\r\n   * max {number|string|Decimal}\r\n   *\r\n   */\r\n  function clamp(x, min, max) {\r\n    return new this(x).clamp(min, max);\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 (isDecimalInstance(v)) {\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 ((i = v.charCodeAt(0)) === 45) {\r\n        v = v.slice(1);\r\n        x.s = -1;\r\n      } else {\r\n        // Plus sign?\r\n        if (i === 43) v = v.slice(1);\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.clamp = clamp;\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.sum = sum;\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   * arguments {number|string|Decimal}\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.toStringTag === tag || 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   * x {number|string|Decimal}\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 sum of the arguments, rounded to `precision`\r\n   * significant digits using rounding mode `rounding`.\r\n   *\r\n   * Only the result is rounded, not the intermediate calculations.\r\n   *\r\n   * arguments {number|string|Decimal}\r\n   *\r\n   */\r\n  function sum() {\r\n    var i = 0,\r\n      args = arguments,\r\n      x = new this(args[i]);\r\n\r\n    external = false;\r\n    for (; x.s && ++i < args.length;) x = x.plus(args[i]);\r\n    external = true;\r\n\r\n    return finalise(x, this.precision, this.rounding);\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  Decimal.prototype.constructor = Decimal;\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\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createBigNumberClass = void 0;\nvar _decimal = _interopRequireDefault(require(\"decimal.js\"));\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'BigNumber';\nvar dependencies = ['?on', 'config'];\nvar createBigNumberClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var on = _ref.on,\n    config = _ref.config;\n  var BigNumber = _decimal[\"default\"].clone({\n    precision: config.precision,\n    modulo: _decimal[\"default\"].EUCLID\n  });\n  BigNumber.prototype = Object.create(BigNumber.prototype);\n\n  /**\n   * Attach type information\n   */\n  BigNumber.prototype.type = 'BigNumber';\n  BigNumber.prototype.isBigNumber = true;\n\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  BigNumber.prototype.toJSON = function () {\n    return {\n      mathjs: 'BigNumber',\n      value: this.toString()\n    };\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  BigNumber.fromJSON = function (json) {\n    return new BigNumber(json.value);\n  };\n  if (on) {\n    // listen for changed in the configuration, automatically apply changed precision\n    on('config', function (curr, prev) {\n      if (curr.precision !== prev.precision) {\n        BigNumber.config({\n          precision: curr.precision\n        });\n      }\n    });\n  }\n  return BigNumber;\n}, {\n  isClass: true\n});\nexports.createBigNumberClass = createBigNumberClass;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createComplexClass = void 0;\nvar _typeof2 = _interopRequireDefault(require(\"@babel/runtime/helpers/typeof\"));\nvar _complex = _interopRequireDefault(require(\"complex.js\"));\nvar _number = require(\"../../utils/number.js\");\nvar _is = require(\"../../utils/is.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'Complex';\nvar dependencies = [];\nvar createComplexClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function () {\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(_complex[\"default\"], 'name', {\n    value: 'Complex'\n  });\n  _complex[\"default\"].prototype.constructor = _complex[\"default\"];\n  _complex[\"default\"].prototype.type = 'Complex';\n  _complex[\"default\"].prototype.isComplex = true;\n\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  _complex[\"default\"].prototype.toJSON = function () {\n    return {\n      mathjs: 'Complex',\n      re: this.re,\n      im: this.im\n    };\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  _complex[\"default\"].prototype.toPolar = function () {\n    return {\n      r: this.abs(),\n      phi: this.arg()\n    };\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  _complex[\"default\"].prototype.format = function (options) {\n    var str = '';\n    var im = this.im;\n    var re = this.re;\n    var strRe = (0, _number.format)(this.re, options);\n    var strIm = (0, _number.format)(this.im, options);\n\n    // round either re or im when smaller than the configured precision\n    var precision = (0, _is.isNumber)(options) ? options : options ? options.precision : null;\n    if (precision !== null) {\n      var epsilon = Math.pow(10, -precision);\n      if (Math.abs(re / im) < epsilon) {\n        re = 0;\n      }\n      if (Math.abs(im / re) < epsilon) {\n        im = 0;\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    return str;\n  };\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  _complex[\"default\"].fromPolar = function (args) {\n    switch (arguments.length) {\n      case 1:\n        {\n          var arg = arguments[0];\n          if ((0, _typeof2[\"default\"])(arg) === 'object') {\n            return (0, _complex[\"default\"])(arg);\n          } else {\n            throw new TypeError('Input has to be an object with r and phi keys.');\n          }\n        }\n      case 2:\n        {\n          var r = arguments[0];\n          var phi = arguments[1];\n          if ((0, _is.isNumber)(r)) {\n            if ((0, _is.isUnit)(phi) && phi.hasBase('ANGLE')) {\n              // convert unit to a number in radians\n              phi = phi.toNumber('rad');\n            }\n            if ((0, _is.isNumber)(phi)) {\n              return new _complex[\"default\"]({\n                r: r,\n                phi: phi\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  _complex[\"default\"].prototype.valueOf = _complex[\"default\"].prototype.toString;\n\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  _complex[\"default\"].fromJSON = function (json) {\n    return new _complex[\"default\"](json);\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  _complex[\"default\"].compare = function (a, b) {\n    if (a.re > b.re) {\n      return 1;\n    }\n    if (a.re < b.re) {\n      return -1;\n    }\n    if (a.im > b.im) {\n      return 1;\n    }\n    if (a.im < b.im) {\n      return -1;\n    }\n    return 0;\n  };\n  return _complex[\"default\"];\n}, {\n  isClass: true\n});\nexports.createComplexClass = createComplexClass;","/**\n * @license Fraction.js v4.3.7 31/08/2023\n * https://www.xarg.org/2014/03/rational-numbers-in-javascript/\n *\n * Copyright (c) 2023, Robert Eisele (robert@raw.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 => <numerator>, 1 => <denominator> ]\n * [ n => <numerator>, 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 assign(n, s) {\n\n    if (isNaN(n = parseInt(n, 10))) {\n      throw InvalidParameter();\n    }\n    return n * s;\n  }\n\n  // Creates a new Fraction internally without the need of the bulky constructor\n  function newFraction(n, d) {\n\n    if (d === 0) {\n      throw DivisionByZero();\n    }\n\n    var f = Object.create(Fraction.prototype);\n    f[\"s\"] = n < 0 ? -1 : 1;\n\n    n = n < 0 ? -n : n;\n\n    var a = gcd(n, d);\n\n    f[\"n\"] = n / a;\n    f[\"d\"] = d / a;\n    return f;\n  }\n\n  function factorize(num) {\n\n    var factors = {};\n\n    var n = num;\n    var i = 2;\n    var s = 4;\n\n    while (s <= n) {\n\n      while (n % i === 0) {\n        n/= i;\n        factors[i] = (factors[i] || 0) + 1;\n      }\n      s+= 1 + 2 * i++;\n    }\n\n    if (n !== num) {\n      if (n > 1)\n        factors[n] = (factors[n] || 0) + 1;\n    } else {\n      factors[num] = (factors[num] || 0) + 1;\n    }\n    return factors;\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\n      if (n % 1 !== 0 || d % 1 !== 0) {\n        throw NonIntegerParameter();\n      }\n\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              throw InvalidParameter();\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              throw InvalidParameter();\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          throw InvalidParameter();\n      }\n\n    if (d === 0) {\n      throw 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    parse(a, b);\n\n    if (this instanceof Fraction) {\n      a = gcd(P[\"d\"], P[\"n\"]); // Abuse variable a\n      this[\"s\"] = P[\"s\"];\n      this[\"n\"] = P[\"n\"] / a;\n      this[\"d\"] = P[\"d\"] / a;\n    } else {\n      return newFraction(P['s'] * P['n'], P['d']);\n    }\n  }\n\n  var DivisionByZero = function() { return new Error(\"Division by Zero\"); };\n  var InvalidParameter = function() { return new Error(\"Invalid argument\"); };\n  var NonIntegerParameter = function() { return new Error(\"Parameters must be integer\"); };\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 newFraction(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 newFraction(-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 newFraction(\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 newFraction(\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 newFraction(\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 newFraction(\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 newFraction(this['s'] * this['n'], this['d']);\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 newFraction(this[\"s\"] * this[\"n\"] % this[\"d\"], 1);\n      }\n\n      parse(a, b);\n      if (0 === P[\"n\"] && 0 === this[\"d\"]) {\n        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 newFraction(\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 newFraction(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 newFraction(0, 1);\n      }\n      return newFraction(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 newFraction(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 newFraction(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 newFraction(Math.round(places * this[\"s\"] * this[\"n\"] / this[\"d\"]), places);\n    },\n\n    /**\n     * Rounds a rational number to a multiple of another rational number\n     *\n     * Ex: new Fraction('0.9').roundTo(\"1/8\") => 7 / 8\n     **/\n    \"roundTo\": function(a, b) {\n\n      /*\n      k * x/y ≤ a/b < (k+1) * x/y\n      ⇔ k ≤ a/b / (x/y) < (k+1)\n      ⇔ k = floor(a/b * y/x)\n      */\n\n      parse(a, b);\n\n      return newFraction(this['s'] * Math.round(this['n'] * P['d'] / (this['d'] * P['n'])) * P['n'], P['d']);\n    },\n\n    /**\n     * Gets the inverse of the fraction, means numerator and denominator are exchanged\n     *\n     * Ex: new Fraction([-3, 4]).inverse() => -4 / 3\n     **/\n    \"inverse\": function() {\n\n      return newFraction(this[\"s\"] * this[\"d\"], this[\"n\"]);\n    },\n\n    /**\n     * Calculates the fraction to some rational exponent, if possible\n     *\n     * Ex: new Fraction(-1,2).pow(-3) => -8\n     */\n    \"pow\": function(a, b) {\n\n      parse(a, b);\n\n      // Trivial case when exp is an integer\n\n      if (P['d'] === 1) {\n\n        if (P['s'] < 0) {\n          return newFraction(Math.pow(this['s'] * this[\"d\"], P['n']), Math.pow(this[\"n\"], P['n']));\n        } else {\n          return newFraction(Math.pow(this['s'] * this[\"n\"], P['n']), Math.pow(this[\"d\"], P['n']));\n        }\n      }\n\n      // Negative roots become complex\n      //     (-a/b)^(c/d) = x\n      // <=> (-1)^(c/d) * (a/b)^(c/d) = x\n      // <=> (cos(pi) + i*sin(pi))^(c/d) * (a/b)^(c/d) = x         # rotate 1 by 180°\n      // <=> (cos(c*pi/d) + i*sin(c*pi/d)) * (a/b)^(c/d) = x       # DeMoivre's formula in Q ( https://proofwiki.org/wiki/De_Moivre%27s_Formula/Rational_Index )\n      // From which follows that only for c=0 the root is non-complex. c/d is a reduced fraction, so that sin(c/dpi)=0 occurs for d=1, which is handled by our trivial case.\n      if (this['s'] < 0) return null;\n\n      // Now prime factor n and d\n      var N = factorize(this['n']);\n      var D = factorize(this['d']);\n\n      // Exponentiate and take root for n and d individually\n      var n = 1;\n      var d = 1;\n      for (var k in N) {\n        if (k === '1') continue;\n        if (k === '0') {\n          n = 0;\n          break;\n        }\n        N[k]*= P['n'];\n\n        if (N[k] % P['d'] === 0) {\n          N[k]/= P['d'];\n        } else return null;\n        n*= Math.pow(k, N[k]);\n      }\n\n      for (var k in D) {\n        if (k === '1') continue;\n        D[k]*= P['n'];\n\n        if (D[k] % P['d'] === 0) {\n          D[k]/= P['d'];\n        } else return null;\n        d*= Math.pow(k, D[k]);\n      }\n\n      if (P['s'] < 0) {\n        return newFraction(d, n);\n      }\n      return newFraction(n, d);\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      if (isNaN(this['n']) || isNaN(this['d'])) {\n        return this;\n      }\n\n      eps = eps || 0.001;\n\n      var thisABS = this['abs']();\n      var cont = thisABS['toContinued']();\n\n      for (var i = 1; i < cont.length; i++) {\n\n        var s = newFraction(cont[i - 1], 1);\n        for (var k = i - 2; k >= 0; k--) {\n          s = s['inverse']()['add'](cont[k]);\n        }\n\n        if (Math.abs(s['sub'](thisABS).valueOf()) < eps) {\n          return s['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(true) => \"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(a) || isNaN(b)) {\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 N = this[\"n\"];\n      var D = this[\"d\"];\n\n      if (isNaN(N) || isNaN(D)) {\n        return \"NaN\";\n      }\n\n      dec = dec || 15; // 15 = decimal places when no repetation\n\n      var cycLen = cycleLen(N, D); // Cycle length\n      var cycOff = cycleStart(N, D, cycLen); // Cycle start\n\n      var str = this['s'] < 0 ? \"-\" : \"\";\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 exports === \"object\") {\n    Object.defineProperty(exports, \"__esModule\", { 'value': true });\n    exports['default'] = Fraction;\n    module['exports'] = Fraction;\n  } else {\n    root['Fraction'] = Fraction;\n  }\n\n})(this);\n","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createFractionClass = void 0;\nvar _fraction = _interopRequireDefault(require(\"fraction.js\"));\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'Fraction';\nvar dependencies = [];\nvar createFractionClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function () {\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(_fraction[\"default\"], 'name', {\n    value: 'Fraction'\n  });\n  _fraction[\"default\"].prototype.constructor = _fraction[\"default\"];\n  _fraction[\"default\"].prototype.type = 'Fraction';\n  _fraction[\"default\"].prototype.isFraction = true;\n\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  _fraction[\"default\"].prototype.toJSON = function () {\n    return {\n      mathjs: 'Fraction',\n      n: this.s * this.n,\n      d: this.d\n    };\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  _fraction[\"default\"].fromJSON = function (json) {\n    return new _fraction[\"default\"](json);\n  };\n  return _fraction[\"default\"];\n}, {\n  isClass: true\n});\nexports.createFractionClass = createFractionClass;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createRangeClass = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _number = require(\"../../utils/number.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'Range';\nvar dependencies = [];\nvar createRangeClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function () {\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    var hasStart = start !== null && start !== undefined;\n    var hasEnd = end !== null && end !== undefined;\n    var hasStep = step !== null && step !== undefined;\n    if (hasStart) {\n      if ((0, _is.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    if (hasEnd) {\n      if ((0, _is.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    if (hasStep) {\n      if ((0, _is.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    this.start = hasStart ? parseFloat(start) : 0;\n    this.end = hasEnd ? parseFloat(end) : 0;\n    this.step = hasStep ? parseFloat(step) : 1;\n  }\n\n  /**\n   * Attach type information\n   */\n  Range.prototype.type = 'Range';\n  Range.prototype.isRange = true;\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   * @memberof Range\n   * @param {string} str\n   * @return {Range | null} range\n   */\n  Range.parse = function (str) {\n    if (typeof str !== 'string') {\n      return null;\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    if (invalid) {\n      return null;\n    }\n    switch (nums.length) {\n      case 2:\n        return new Range(nums[0], nums[1]);\n      case 3:\n        return new Range(nums[0], nums[2], nums[1]);\n      default:\n        return null;\n    }\n  };\n\n  /**\n   * Create a clone of the range\n   * @return {Range} clone\n   */\n  Range.prototype.clone = function () {\n    return new Range(this.start, this.end, this.step);\n  };\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  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    if ((0, _number.sign)(step) === (0, _number.sign)(diff)) {\n      len = Math.ceil(diff / step);\n    } else if (diff === 0) {\n      len = 0;\n    }\n    if (isNaN(len)) {\n      len = 0;\n    }\n    return [len];\n  };\n\n  /**\n   * Calculate the minimum value in the range\n   * @memberof Range\n   * @return {number | undefined} min\n   */\n  Range.prototype.min = function () {\n    var size = this.size()[0];\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  /**\n   * Calculate the maximum value in the range\n   * @memberof Range\n   * @return {number | undefined} max\n   */\n  Range.prototype.max = function () {\n    var size = this.size()[0];\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  /**\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  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    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  /**\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  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  /**\n   * Create an Array with a copy of the Ranges data\n   * @memberof Range\n   * @returns {Array} array\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  /**\n   * Get the primitive value of the Range, a one dimensional array\n   * @memberof Range\n   * @returns {Array} array\n   */\n  Range.prototype.valueOf = function () {\n    // TODO: implement a caching mechanism for range.valueOf()\n    return this.toArray();\n  };\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  Range.prototype.format = function (options) {\n    var str = (0, _number.format)(this.start, options);\n    if (this.step !== 1) {\n      str += ':' + (0, _number.format)(this.step, options);\n    }\n    str += ':' + (0, _number.format)(this.end, options);\n    return str;\n  };\n\n  /**\n   * Get a string representation of the range.\n   * @memberof Range\n   * @returns {string}\n   */\n  Range.prototype.toString = function () {\n    return this.format();\n  };\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  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  /**\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  Range.fromJSON = function (json) {\n    return new Range(json.start, json.end, json.step);\n  };\n  return Range;\n}, {\n  isClass: true\n});\nexports.createRangeClass = createRangeClass;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMatrixClass = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'Matrix';\nvar dependencies = [];\nvar createMatrixClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function () {\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  /**\n   * Attach type information\n   */\n  Matrix.prototype.type = 'Matrix';\n  Matrix.prototype.isMatrix = true;\n\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  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  /**\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  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  /**\n   * Create a new Matrix With the type of the current matrix instance\n   * @param {Array | Object} data\n   * @param {string} [datatype]\n   */\n  Matrix.prototype.create = function (data, datatype) {\n    throw new Error('Cannot invoke create on a Matrix interface');\n  };\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  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  /**\n   * Get a single element from the matrix.\n   * @param {number[]} index   Zero-based index\n   * @return {*} value\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  /**\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  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  /**\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  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  /**\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  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  /**\n   * Create a clone of the matrix\n   * @return {Matrix} clone\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  /**\n   * Retrieve the size of the matrix.\n   * @returns {number[]} size\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  /**\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  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  /**\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  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  /**\n   * Iterate over the matrix elements\n   * @return {Iterable<{ value, index: number[] }>}\n   */\n  Matrix.prototype[Symbol.iterator] = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot iterate a Matrix interface');\n  };\n\n  /**\n   * Create an Array with a copy of the data of the Matrix\n   * @returns {Array} array\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  /**\n   * Get the primitive value of the Matrix: a multidimensional array\n   * @returns {Array} array\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  /**\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  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  /**\n   * Get a string representation of the matrix\n   * @returns {string} str\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  };\n  return Matrix;\n}, {\n  isClass: true\n});\nexports.createMatrixClass = createMatrixClass;","var _typeof = require(\"./typeof.js\")[\"default\"];\nfunction _regeneratorRuntime() {\n  \"use strict\"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */\n  module.exports = _regeneratorRuntime = function _regeneratorRuntime() {\n    return e;\n  }, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;\n  var t,\n    e = {},\n    r = Object.prototype,\n    n = r.hasOwnProperty,\n    o = Object.defineProperty || function (t, e, r) {\n      t[e] = r.value;\n    },\n    i = \"function\" == typeof Symbol ? Symbol : {},\n    a = i.iterator || \"@@iterator\",\n    c = i.asyncIterator || \"@@asyncIterator\",\n    u = i.toStringTag || \"@@toStringTag\";\n  function define(t, e, r) {\n    return Object.defineProperty(t, e, {\n      value: r,\n      enumerable: !0,\n      configurable: !0,\n      writable: !0\n    }), t[e];\n  }\n  try {\n    define({}, \"\");\n  } catch (t) {\n    define = function define(t, e, r) {\n      return t[e] = r;\n    };\n  }\n  function wrap(t, e, r, n) {\n    var i = e && e.prototype instanceof Generator ? e : Generator,\n      a = Object.create(i.prototype),\n      c = new Context(n || []);\n    return o(a, \"_invoke\", {\n      value: makeInvokeMethod(t, r, c)\n    }), a;\n  }\n  function tryCatch(t, e, r) {\n    try {\n      return {\n        type: \"normal\",\n        arg: t.call(e, r)\n      };\n    } catch (t) {\n      return {\n        type: \"throw\",\n        arg: t\n      };\n    }\n  }\n  e.wrap = wrap;\n  var h = \"suspendedStart\",\n    l = \"suspendedYield\",\n    f = \"executing\",\n    s = \"completed\",\n    y = {};\n  function Generator() {}\n  function GeneratorFunction() {}\n  function GeneratorFunctionPrototype() {}\n  var p = {};\n  define(p, a, function () {\n    return this;\n  });\n  var d = Object.getPrototypeOf,\n    v = d && d(d(values([])));\n  v && v !== r && n.call(v, a) && (p = v);\n  var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p);\n  function defineIteratorMethods(t) {\n    [\"next\", \"throw\", \"return\"].forEach(function (e) {\n      define(t, e, function (t) {\n        return this._invoke(e, t);\n      });\n    });\n  }\n  function AsyncIterator(t, e) {\n    function invoke(r, o, i, a) {\n      var c = tryCatch(t[r], t, o);\n      if (\"throw\" !== c.type) {\n        var u = c.arg,\n          h = u.value;\n        return h && \"object\" == _typeof(h) && n.call(h, \"__await\") ? e.resolve(h.__await).then(function (t) {\n          invoke(\"next\", t, i, a);\n        }, function (t) {\n          invoke(\"throw\", t, i, a);\n        }) : e.resolve(h).then(function (t) {\n          u.value = t, i(u);\n        }, function (t) {\n          return invoke(\"throw\", t, i, a);\n        });\n      }\n      a(c.arg);\n    }\n    var r;\n    o(this, \"_invoke\", {\n      value: function value(t, n) {\n        function callInvokeWithMethodAndArg() {\n          return new e(function (e, r) {\n            invoke(t, n, e, r);\n          });\n        }\n        return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg();\n      }\n    });\n  }\n  function makeInvokeMethod(e, r, n) {\n    var o = h;\n    return function (i, a) {\n      if (o === f) throw new Error(\"Generator is already running\");\n      if (o === s) {\n        if (\"throw\" === i) throw a;\n        return {\n          value: t,\n          done: !0\n        };\n      }\n      for (n.method = i, n.arg = a;;) {\n        var c = n.delegate;\n        if (c) {\n          var u = maybeInvokeDelegate(c, n);\n          if (u) {\n            if (u === y) continue;\n            return u;\n          }\n        }\n        if (\"next\" === n.method) n.sent = n._sent = n.arg;else if (\"throw\" === n.method) {\n          if (o === h) throw o = s, n.arg;\n          n.dispatchException(n.arg);\n        } else \"return\" === n.method && n.abrupt(\"return\", n.arg);\n        o = f;\n        var p = tryCatch(e, r, n);\n        if (\"normal\" === p.type) {\n          if (o = n.done ? s : l, p.arg === y) continue;\n          return {\n            value: p.arg,\n            done: n.done\n          };\n        }\n        \"throw\" === p.type && (o = s, n.method = \"throw\", n.arg = p.arg);\n      }\n    };\n  }\n  function maybeInvokeDelegate(e, r) {\n    var n = r.method,\n      o = e.iterator[n];\n    if (o === t) return r.delegate = null, \"throw\" === n && e.iterator[\"return\"] && (r.method = \"return\", r.arg = t, maybeInvokeDelegate(e, r), \"throw\" === r.method) || \"return\" !== n && (r.method = \"throw\", r.arg = new TypeError(\"The iterator does not provide a '\" + n + \"' method\")), y;\n    var i = tryCatch(o, e.iterator, r.arg);\n    if (\"throw\" === i.type) return r.method = \"throw\", r.arg = i.arg, r.delegate = null, y;\n    var a = i.arg;\n    return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, \"return\" !== r.method && (r.method = \"next\", r.arg = t), r.delegate = null, y) : a : (r.method = \"throw\", r.arg = new TypeError(\"iterator result is not an object\"), r.delegate = null, y);\n  }\n  function pushTryEntry(t) {\n    var e = {\n      tryLoc: t[0]\n    };\n    1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e);\n  }\n  function resetTryEntry(t) {\n    var e = t.completion || {};\n    e.type = \"normal\", delete e.arg, t.completion = e;\n  }\n  function Context(t) {\n    this.tryEntries = [{\n      tryLoc: \"root\"\n    }], t.forEach(pushTryEntry, this), this.reset(!0);\n  }\n  function values(e) {\n    if (e || \"\" === e) {\n      var r = e[a];\n      if (r) return r.call(e);\n      if (\"function\" == typeof e.next) return e;\n      if (!isNaN(e.length)) {\n        var o = -1,\n          i = function next() {\n            for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next;\n            return next.value = t, next.done = !0, next;\n          };\n        return i.next = i;\n      }\n    }\n    throw new TypeError(_typeof(e) + \" is not iterable\");\n  }\n  return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, \"constructor\", {\n    value: GeneratorFunctionPrototype,\n    configurable: !0\n  }), o(GeneratorFunctionPrototype, \"constructor\", {\n    value: GeneratorFunction,\n    configurable: !0\n  }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, \"GeneratorFunction\"), e.isGeneratorFunction = function (t) {\n    var e = \"function\" == typeof t && t.constructor;\n    return !!e && (e === GeneratorFunction || \"GeneratorFunction\" === (e.displayName || e.name));\n  }, e.mark = function (t) {\n    return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, \"GeneratorFunction\")), t.prototype = Object.create(g), t;\n  }, e.awrap = function (t) {\n    return {\n      __await: t\n    };\n  }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () {\n    return this;\n  }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) {\n    void 0 === i && (i = Promise);\n    var a = new AsyncIterator(wrap(t, r, n, o), i);\n    return e.isGeneratorFunction(r) ? a : a.next().then(function (t) {\n      return t.done ? t.value : a.next();\n    });\n  }, defineIteratorMethods(g), define(g, u, \"Generator\"), define(g, a, function () {\n    return this;\n  }), define(g, \"toString\", function () {\n    return \"[object Generator]\";\n  }), e.keys = function (t) {\n    var e = Object(t),\n      r = [];\n    for (var n in e) r.push(n);\n    return r.reverse(), function next() {\n      for (; r.length;) {\n        var t = r.pop();\n        if (t in e) return next.value = t, next.done = !1, next;\n      }\n      return next.done = !0, next;\n    };\n  }, e.values = values, Context.prototype = {\n    constructor: Context,\n    reset: function reset(e) {\n      if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = \"next\", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) \"t\" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t);\n    },\n    stop: function stop() {\n      this.done = !0;\n      var t = this.tryEntries[0].completion;\n      if (\"throw\" === t.type) throw t.arg;\n      return this.rval;\n    },\n    dispatchException: function dispatchException(e) {\n      if (this.done) throw e;\n      var r = this;\n      function handle(n, o) {\n        return a.type = \"throw\", a.arg = e, r.next = n, o && (r.method = \"next\", r.arg = t), !!o;\n      }\n      for (var o = this.tryEntries.length - 1; o >= 0; --o) {\n        var i = this.tryEntries[o],\n          a = i.completion;\n        if (\"root\" === i.tryLoc) return handle(\"end\");\n        if (i.tryLoc <= this.prev) {\n          var c = n.call(i, \"catchLoc\"),\n            u = n.call(i, \"finallyLoc\");\n          if (c && u) {\n            if (this.prev < i.catchLoc) return handle(i.catchLoc, !0);\n            if (this.prev < i.finallyLoc) return handle(i.finallyLoc);\n          } else if (c) {\n            if (this.prev < i.catchLoc) return handle(i.catchLoc, !0);\n          } else {\n            if (!u) throw new Error(\"try statement without catch or finally\");\n            if (this.prev < i.finallyLoc) return handle(i.finallyLoc);\n          }\n        }\n      }\n    },\n    abrupt: function abrupt(t, e) {\n      for (var r = this.tryEntries.length - 1; r >= 0; --r) {\n        var o = this.tryEntries[r];\n        if (o.tryLoc <= this.prev && n.call(o, \"finallyLoc\") && this.prev < o.finallyLoc) {\n          var i = o;\n          break;\n        }\n      }\n      i && (\"break\" === t || \"continue\" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null);\n      var a = i ? i.completion : {};\n      return a.type = t, a.arg = e, i ? (this.method = \"next\", this.next = i.finallyLoc, y) : this.complete(a);\n    },\n    complete: function complete(t, e) {\n      if (\"throw\" === t.type) throw t.arg;\n      return \"break\" === t.type || \"continue\" === t.type ? this.next = t.arg : \"return\" === t.type ? (this.rval = this.arg = t.arg, this.method = \"return\", this.next = \"end\") : \"normal\" === t.type && e && (this.next = e), y;\n    },\n    finish: function finish(t) {\n      for (var e = this.tryEntries.length - 1; e >= 0; --e) {\n        var r = this.tryEntries[e];\n        if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y;\n      }\n    },\n    \"catch\": function _catch(t) {\n      for (var e = this.tryEntries.length - 1; e >= 0; --e) {\n        var r = this.tryEntries[e];\n        if (r.tryLoc === t) {\n          var n = r.completion;\n          if (\"throw\" === n.type) {\n            var o = n.arg;\n            resetTryEntry(r);\n          }\n          return o;\n        }\n      }\n      throw new Error(\"illegal catch attempt\");\n    },\n    delegateYield: function delegateYield(e, r, n) {\n      return this.delegate = {\n        iterator: values(e),\n        resultName: r,\n        nextLoc: n\n      }, \"next\" === this.method && (this.arg = t), y;\n    }\n  }, e;\n}\nmodule.exports = _regeneratorRuntime, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","// TODO(Babel 8): Remove this file.\n\nvar runtime = require(\"../helpers/regeneratorRuntime\")();\nmodule.exports = runtime;\n\n// Copied from https://github.com/facebook/regenerator/blob/main/packages/runtime/runtime.js#L736=\ntry {\n  regeneratorRuntime = runtime;\n} catch (accidentalStrictMode) {\n  if (typeof globalThis === \"object\") {\n    globalThis.regeneratorRuntime = runtime;\n  } else {\n    Function(\"r\", \"regeneratorRuntime = r\")(runtime);\n  }\n}\n","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.lruQueue = lruQueue;\n// (c) 2018, Mariusz Nowak\n// SPDX-License-Identifier: ISC\n// Derived from https://github.com/medikoo/lru-queue\nfunction lruQueue(limit) {\n  var size = 0;\n  var base = 1;\n  var queue = Object.create(null);\n  var map = Object.create(null);\n  var index = 0;\n  var del = function del(id) {\n    var oldIndex = map[id];\n    if (!oldIndex) return;\n    delete queue[oldIndex];\n    delete map[id];\n    --size;\n    if (base !== oldIndex) return;\n    if (!size) {\n      index = 0;\n      base = 1;\n      return;\n    }\n    while (!hasOwnProperty.call(queue, ++base)) {\n      continue;\n    }\n  };\n  limit = Math.abs(limit);\n  return {\n    hit: function hit(id) {\n      var oldIndex = map[id];\n      var nuIndex = ++index;\n      queue[nuIndex] = id;\n      map[id] = nuIndex;\n      if (!oldIndex) {\n        ++size;\n        if (size <= limit) return undefined;\n        id = queue[base];\n        del(id);\n        return id;\n      }\n      delete queue[oldIndex];\n      if (base !== oldIndex) return undefined;\n      while (!hasOwnProperty.call(queue, ++base)) {\n        continue;\n      }\n      return undefined;\n    },\n    \"delete\": del,\n    clear: function clear() {\n      size = index = 0;\n      base = 1;\n      queue = Object.create(null);\n      map = Object.create(null);\n    }\n  };\n}","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.maxArgumentCount = maxArgumentCount;\nexports.memoize = memoize;\nexports.memoizeCompare = memoizeCompare;\nvar _typeof2 = _interopRequireDefault(require(\"@babel/runtime/helpers/typeof\"));\nvar _lruQueue = require(\"./lruQueue.js\");\n// 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 {Object} [options]\n * @param {function(args: Array): string} [options.hasher]\n *    A custom hash builder. Is JSON.stringify by default.\n * @param {number | undefined} [options.limit]\n *    Maximum number of values that may be cached. Undefined indicates\n *    unlimited (default)\n * @return {function}                       Returns the memoized function\n */\nfunction memoize(fn) {\n  var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},\n    hasher = _ref.hasher,\n    limit = _ref.limit;\n  limit = limit == null ? Number.POSITIVE_INFINITY : limit;\n  hasher = hasher == null ? JSON.stringify : hasher;\n  return function memoize() {\n    if ((0, _typeof2[\"default\"])(memoize.cache) !== 'object') {\n      memoize.cache = {\n        values: new Map(),\n        lru: (0, _lruQueue.lruQueue)(limit || Number.POSITIVE_INFINITY)\n      };\n    }\n    var args = [];\n    for (var i = 0; i < arguments.length; i++) {\n      args[i] = arguments[i];\n    }\n    var hash = hasher(args);\n    if (memoize.cache.values.has(hash)) {\n      memoize.cache.lru.hit(hash);\n      return memoize.cache.values.get(hash);\n    }\n    var newVal = fn.apply(fn, args);\n    memoize.cache.values.set(hash, newVal);\n    memoize.cache.values[\"delete\"](memoize.cache.lru.hit(hash));\n    return newVal;\n  };\n}\n\n/**\n * Memoize a given function by caching all results and the arguments,\n * and comparing against the arguments of previous results before\n * executing again.\n * This is less performant than `memoize` which calculates a hash,\n * which is very fast to compare. Use `memoizeCompare` only when it is\n * not possible to create a unique serializable hash from the function\n * arguments.\n * The isEqual function must compare two sets of arguments\n * and return true when equal (can be a deep equality check for example).\n * @param {function} fn\n * @param {function(a: *, b: *) : boolean} isEqual\n * @returns {function}\n */\nfunction memoizeCompare(fn, isEqual) {\n  var memoize = function memoize() {\n    var args = [];\n    for (var i = 0; i < arguments.length; i++) {\n      args[i] = arguments[i];\n    }\n    for (var c = 0; c < memoize.cache.length; c++) {\n      var cached = memoize.cache[c];\n      if (isEqual(args, cached.args)) {\n        // TODO: move this cache entry to the top so recently used entries move up?\n        return cached.res;\n      }\n    }\n    var res = fn.apply(fn, args);\n    memoize.cache.unshift({\n      args: args,\n      res: res\n    });\n    return res;\n  };\n  memoize.cache = [];\n  return memoize;\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 */\nfunction maxArgumentCount(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}","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createDenseMatrixClass = void 0;\nvar _regenerator = _interopRequireDefault(require(\"@babel/runtime/regenerator\"));\nvar _is = require(\"../../utils/is.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _string = require(\"../../utils/string.js\");\nvar _number = require(\"../../utils/number.js\");\nvar _object = require(\"../../utils/object.js\");\nvar _DimensionError = require(\"../../error/DimensionError.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _function = require(\"../../utils/function.js\");\nfunction _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it[\"return\"] != null) it[\"return\"](); } finally { if (didErr) throw err; } } }; }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }\nvar name = 'DenseMatrix';\nvar dependencies = ['Matrix'];\nvar createDenseMatrixClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var Matrix = _ref.Matrix;\n  /**\n   * Dense Matrix implementation. A regular, dense matrix, supporting multi-dimensional matrices. This is the default matrix type.\n   * @class DenseMatrix\n   * @enum {{ value, index: number[] }}\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    if (datatype && !(0, _is.isString)(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\n    }\n    if ((0, _is.isMatrix)(data)) {\n      // check data is a DenseMatrix\n      if (data.type === 'DenseMatrix') {\n        // clone data & size\n        this._data = (0, _object.clone)(data._data);\n        this._size = (0, _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 && (0, _is.isArray)(data.data) && (0, _is.isArray)(data.size)) {\n      // initialize fields from JSON representation\n      this._data = data.data;\n      this._size = data.size;\n      // verify the dimensions of the array\n      (0, _array.validate)(this._data, this._size);\n      this._datatype = datatype || data.datatype;\n    } else if ((0, _is.isArray)(data)) {\n      // replace nested Matrices with Arrays\n      this._data = preprocess(data);\n      // get the dimensions of the array\n      this._size = (0, _array.arraySize)(this._data);\n      // verify the dimensions of the array, TODO: compute size while processing array\n      (0, _array.validate)(this._data, this._size);\n      // data type unknown\n      this._datatype = datatype;\n    } else if (data) {\n      // unsupported type\n      throw new TypeError('Unsupported type of data (' + (0, _is.typeOf)(data) + ')');\n    } else {\n      // nothing provided\n      this._data = [];\n      this._size = [0];\n      this._datatype = datatype;\n    }\n  }\n  DenseMatrix.prototype = new Matrix();\n\n  /**\n   * Create a new DenseMatrix\n   */\n  DenseMatrix.prototype.createDenseMatrix = function (data, datatype) {\n    return new DenseMatrix(data, datatype);\n  };\n\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(DenseMatrix, 'name', {\n    value: 'DenseMatrix'\n  });\n  DenseMatrix.prototype.constructor = DenseMatrix;\n  DenseMatrix.prototype.type = 'DenseMatrix';\n  DenseMatrix.prototype.isDenseMatrix = true;\n\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  DenseMatrix.prototype.getDataType = function () {\n    return (0, _array.getArrayDataType)(this._data, _is.typeOf);\n  };\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  DenseMatrix.prototype.storage = function () {\n    return 'dense';\n  };\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  DenseMatrix.prototype.datatype = function () {\n    return this._datatype;\n  };\n\n  /**\n   * Create a new DenseMatrix\n   * @memberof DenseMatrix\n   * @param {Array} data\n   * @param {string} [datatype]\n   */\n  DenseMatrix.prototype.create = function (data, datatype) {\n    return new DenseMatrix(data, datatype);\n  };\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 | 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  DenseMatrix.prototype.subset = function (index, replacement, defaultValue) {\n    switch (arguments.length) {\n      case 1:\n        return _get(this, index);\n\n      // intentional fall through\n      case 2:\n      case 3:\n        return _set(this, index, replacement, defaultValue);\n      default:\n        throw new SyntaxError('Wrong number of arguments');\n    }\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  DenseMatrix.prototype.get = function (index) {\n    if (!(0, _is.isArray)(index)) {\n      throw new TypeError('Array expected');\n    }\n    if (index.length !== this._size.length) {\n      throw new _DimensionError.DimensionError(index.length, this._size.length);\n    }\n\n    // check index\n    for (var x = 0; x < index.length; x++) {\n      (0, _array.validateIndex)(index[x], this._size[x]);\n    }\n    var data = this._data;\n    for (var i = 0, ii = index.length; i < ii; i++) {\n      var indexI = index[i];\n      (0, _array.validateIndex)(indexI, data.length);\n      data = data[indexI];\n    }\n    return data;\n  };\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  DenseMatrix.prototype.set = function (index, value, defaultValue) {\n    if (!(0, _is.isArray)(index)) {\n      throw new TypeError('Array expected');\n    }\n    if (index.length < this._size.length) {\n      throw new _DimensionError.DimensionError(index.length, this._size.length, '<');\n    }\n    var i, ii, indexI;\n\n    // enlarge matrix when needed\n    var size = index.map(function (i) {\n      return i + 1;\n    });\n    _fit(this, size, defaultValue);\n\n    // traverse over the dimensions\n    var data = this._data;\n    for (i = 0, ii = index.length - 1; i < ii; i++) {\n      indexI = index[i];\n      (0, _array.validateIndex)(indexI, data.length);\n      data = data[indexI];\n    }\n\n    // set new value\n    indexI = index[index.length - 1];\n    (0, _array.validateIndex)(indexI, data.length);\n    data[indexI] = value;\n    return this;\n  };\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  function _get(matrix, index) {\n    if (!(0, _is.isIndex)(index)) {\n      throw new TypeError('Invalid index');\n    }\n    var isScalar = index.isScalar();\n    if (isScalar) {\n      // return a scalar\n      return matrix.get(index.min());\n    } else {\n      // validate dimensions\n      var size = index.size();\n      if (size.length !== matrix._size.length) {\n        throw new _DimensionError.DimensionError(size.length, matrix._size.length);\n      }\n\n      // validate if any of the ranges in the index is out of range\n      var min = index.min();\n      var max = index.max();\n      for (var i = 0, ii = matrix._size.length; i < ii; i++) {\n        (0, _array.validateIndex)(min[i], matrix._size[i]);\n        (0, _array.validateIndex)(max[i], matrix._size[i]);\n      }\n\n      // retrieve submatrix\n      // TODO: more efficient when creating an empty matrix and setting _data and _size manually\n      return new DenseMatrix(_getSubmatrix(matrix._data, index, size.length, 0), matrix._datatype);\n    }\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  function _getSubmatrix(data, index, dims, dim) {\n    var last = dim === dims - 1;\n    var range = index.dimension(dim);\n    if (last) {\n      return range.map(function (i) {\n        (0, _array.validateIndex)(i, data.length);\n        return data[i];\n      }).valueOf();\n    } else {\n      return range.map(function (i) {\n        (0, _array.validateIndex)(i, data.length);\n        var child = data[i];\n        return _getSubmatrix(child, index, dims, dim + 1);\n      }).valueOf();\n    }\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  function _set(matrix, index, submatrix, defaultValue) {\n    if (!index || index.isIndex !== true) {\n      throw new TypeError('Invalid index');\n    }\n\n    // get index size and check whether the index contains a single value\n    var iSize = index.size();\n    var isScalar = index.isScalar();\n\n    // calculate the size of the submatrix, and convert it into an Array if needed\n    var sSize;\n    if ((0, _is.isMatrix)(submatrix)) {\n      sSize = submatrix.size();\n      submatrix = submatrix.valueOf();\n    } else {\n      sSize = (0, _array.arraySize)(submatrix);\n    }\n    if (isScalar) {\n      // set a scalar\n\n      // check whether submatrix is a scalar\n      if (sSize.length !== 0) {\n        throw new TypeError('Scalar expected');\n      }\n      matrix.set(index.min(), submatrix, defaultValue);\n    } else {\n      // set a submatrix\n\n      // validate dimensions\n      if (iSize.length < matrix._size.length) {\n        throw new _DimensionError.DimensionError(iSize.length, matrix._size.length, '<');\n      }\n      if (sSize.length < iSize.length) {\n        // calculate number of missing outer dimensions\n        var i = 0;\n        var outer = 0;\n        while (iSize[i] === 1 && sSize[i] === 1) {\n          i++;\n        }\n        while (iSize[i] === 1) {\n          outer++;\n          i++;\n        }\n\n        // unsqueeze both outer and inner dimensions\n        submatrix = (0, _array.unsqueeze)(submatrix, iSize.length, outer, sSize);\n      }\n\n      // check whether the size of the submatrix matches the index size\n      if (!(0, _object.deepStrictEqual)(iSize, sSize)) {\n        throw new _DimensionError.DimensionError(iSize, sSize, '>');\n      }\n\n      // enlarge matrix when needed\n      var size = index.max().map(function (i) {\n        return i + 1;\n      });\n      _fit(matrix, size, defaultValue);\n\n      // insert the sub matrix\n      var dims = iSize.length;\n      var dim = 0;\n      _setSubmatrix(matrix._data, index, submatrix, dims, dim);\n    }\n    return matrix;\n  }\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  function _setSubmatrix(data, index, submatrix, dims, dim) {\n    var last = dim === dims - 1;\n    var range = index.dimension(dim);\n    if (last) {\n      range.forEach(function (dataIndex, subIndex) {\n        (0, _array.validateIndex)(dataIndex);\n        data[dataIndex] = submatrix[subIndex[0]];\n      });\n    } else {\n      range.forEach(function (dataIndex, subIndex) {\n        (0, _array.validateIndex)(dataIndex);\n        _setSubmatrix(data[dataIndex], index, submatrix[subIndex[0]], dims, dim + 1);\n      });\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[] || Matrix} 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  DenseMatrix.prototype.resize = function (size, defaultValue, copy) {\n    // validate arguments\n    if (!(0, _is.isCollection)(size)) {\n      throw new TypeError('Array or Matrix expected');\n    }\n\n    // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector\n    var sizeArray = size.valueOf().map(function (value) {\n      return Array.isArray(value) && value.length === 1 ? value[0] : value;\n    });\n\n    // matrix to resize\n    var m = copy ? this.clone() : this;\n    // resize matrix\n    return _resize(m, sizeArray, defaultValue);\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;\n      // go deep\n      while ((0, _is.isArray)(v)) {\n        v = v[0];\n      }\n      return v;\n    }\n    // resize matrix\n    matrix._size = size.slice(0); // copy the array\n    matrix._data = (0, _array.resize)(matrix._data, matrix._size, defaultValue);\n    // return matrix\n    return matrix;\n  }\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  DenseMatrix.prototype.reshape = function (size, copy) {\n    var m = copy ? this.clone() : this;\n    m._data = (0, _array.reshape)(m._data, size);\n    var currentLength = m._size.reduce(function (length, size) {\n      return length * size;\n    });\n    m._size = (0, _array.processSizesWildcard)(size, currentLength);\n    return m;\n  };\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  function _fit(matrix, size, defaultValue) {\n    var\n    // copy the array\n    newSize = matrix._size.slice(0);\n    var changed = false;\n\n    // add dimensions when needed\n    while (newSize.length < size.length) {\n      newSize.push(0);\n      changed = true;\n    }\n\n    // enlarge size when needed\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    if (changed) {\n      // resize only when size is changed\n      _resize(matrix, newSize, defaultValue);\n    }\n  }\n\n  /**\n   * Create a clone of the matrix\n   * @memberof DenseMatrix\n   * @return {DenseMatrix} clone\n   */\n  DenseMatrix.prototype.clone = function () {\n    var m = new DenseMatrix({\n      data: (0, _object.clone)(this._data),\n      size: (0, _object.clone)(this._size),\n      datatype: this._datatype\n    });\n    return m;\n  };\n\n  /**\n   * Retrieve the size of the matrix.\n   * @memberof DenseMatrix\n   * @returns {number[]} size\n   */\n  DenseMatrix.prototype.size = function () {\n    return this._size.slice(0); // return a clone of _size\n  };\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  DenseMatrix.prototype.map = function (callback) {\n    // matrix instance\n    var me = this;\n    var args = (0, _function.maxArgumentCount)(callback);\n    var recurse = function recurse(value, index) {\n      if ((0, _is.isArray)(value)) {\n        return value.map(function (child, i) {\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, me);\n        }\n      }\n    };\n\n    // determine the new datatype when the original matrix has datatype defined\n    // TODO: should be done in matrix constructor instead\n    var data = recurse(this._data, []);\n    var datatype = this._datatype !== undefined ? (0, _array.getArrayDataType)(data, _is.typeOf) : undefined;\n    return new DenseMatrix(data, 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  DenseMatrix.prototype.forEach = function (callback) {\n    // matrix instance\n    var me = this;\n    var recurse = function recurse(value, index) {\n      if ((0, _is.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    recurse(this._data, []);\n  };\n\n  /**\n   * Iterate over the matrix elements\n   * @return {Iterable<{ value, index: number[] }>}\n   */\n  DenseMatrix.prototype[Symbol.iterator] = /*#__PURE__*/_regenerator[\"default\"].mark(function _callee() {\n    var recurse;\n    return _regenerator[\"default\"].wrap(function _callee$(_context2) {\n      while (1) {\n        switch (_context2.prev = _context2.next) {\n          case 0:\n            recurse = /*#__PURE__*/_regenerator[\"default\"].mark(function recurse(value, index) {\n              var i;\n              return _regenerator[\"default\"].wrap(function recurse$(_context) {\n                while (1) {\n                  switch (_context.prev = _context.next) {\n                    case 0:\n                      if (!(0, _is.isArray)(value)) {\n                        _context.next = 9;\n                        break;\n                      }\n                      i = 0;\n                    case 2:\n                      if (!(i < value.length)) {\n                        _context.next = 7;\n                        break;\n                      }\n                      return _context.delegateYield(recurse(value[i], index.concat(i)), \"t0\", 4);\n                    case 4:\n                      i++;\n                      _context.next = 2;\n                      break;\n                    case 7:\n                      _context.next = 11;\n                      break;\n                    case 9:\n                      _context.next = 11;\n                      return {\n                        value: value,\n                        index: index\n                      };\n                    case 11:\n                    case \"end\":\n                      return _context.stop();\n                  }\n                }\n              }, recurse);\n            });\n            return _context2.delegateYield(recurse(this._data, []), \"t0\", 2);\n          case 2:\n          case \"end\":\n            return _context2.stop();\n        }\n      }\n    }, _callee, this);\n  });\n\n  /**\n   * Returns an array containing the rows of a 2D matrix\n   * @returns {Array<Matrix>}\n   */\n  DenseMatrix.prototype.rows = function () {\n    var result = [];\n    var s = this.size();\n    if (s.length !== 2) {\n      throw new TypeError('Rows can only be returned for a 2D matrix.');\n    }\n    var data = this._data;\n    var _iterator = _createForOfIteratorHelper(data),\n      _step;\n    try {\n      for (_iterator.s(); !(_step = _iterator.n()).done;) {\n        var row = _step.value;\n        result.push(new DenseMatrix([row], this._datatype));\n      }\n    } catch (err) {\n      _iterator.e(err);\n    } finally {\n      _iterator.f();\n    }\n    return result;\n  };\n\n  /**\n   * Returns an array containing the columns of a 2D matrix\n   * @returns {Array<Matrix>}\n   */\n  DenseMatrix.prototype.columns = function () {\n    var _this = this;\n    var result = [];\n    var s = this.size();\n    if (s.length !== 2) {\n      throw new TypeError('Rows can only be returned for a 2D matrix.');\n    }\n    var data = this._data;\n    var _loop = function _loop(i) {\n      var col = data.map(function (row) {\n        return [row[i]];\n      });\n      result.push(new DenseMatrix(col, _this._datatype));\n    };\n    for (var i = 0; i < s[1]; i++) {\n      _loop(i);\n    }\n    return result;\n  };\n\n  /**\n   * Create an Array with a copy of the data of the DenseMatrix\n   * @memberof DenseMatrix\n   * @returns {Array} array\n   */\n  DenseMatrix.prototype.toArray = function () {\n    return (0, _object.clone)(this._data);\n  };\n\n  /**\n   * Get the primitive value of the DenseMatrix: a multidimensional array\n   * @memberof DenseMatrix\n   * @returns {Array} array\n   */\n  DenseMatrix.prototype.valueOf = function () {\n    return this._data;\n  };\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  DenseMatrix.prototype.format = function (options) {\n    return (0, _string.format)(this._data, options);\n  };\n\n  /**\n   * Get a string representation of the matrix\n   * @memberof DenseMatrix\n   * @returns {string} str\n   */\n  DenseMatrix.prototype.toString = function () {\n    return (0, _string.format)(this._data);\n  };\n\n  /**\n   * Get a JSON representation of the matrix\n   * @memberof DenseMatrix\n   * @returns {Object}\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  /**\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 {Matrix}                     The matrix with the diagonal values.\n   */\n  DenseMatrix.prototype.diagonal = function (k) {\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if ((0, _is.isBigNumber)(k)) {\n        k = k.toNumber();\n      }\n      // is must be an integer\n      if (!(0, _is.isNumber)(k) || !(0, _number.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    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0;\n\n    // rows & columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n\n    // number diagonal values\n    var n = Math.min(rows - kSub, columns - kSuper);\n\n    // x is a matrix get diagonal from matrix\n    var data = [];\n\n    // loop rows\n    for (var i = 0; i < n; i++) {\n      data[i] = this._data[i + kSub][i + kSuper];\n    }\n\n    // create DenseMatrix\n    return new DenseMatrix({\n      data: data,\n      size: [n],\n      datatype: this._datatype\n    });\n  };\n\n  /**\n   * Create a diagonal matrix.\n   *\n   * @memberof DenseMatrix\n   * @param {Array} size                     The matrix size.\n   * @param {number | Matrix | 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   * @param {string} [datatype]              The datatype for the diagonal\n   *\n   * @returns {DenseMatrix}\n   */\n  DenseMatrix.diagonal = function (size, value, k, defaultValue) {\n    if (!(0, _is.isArray)(size)) {\n      throw new TypeError('Array expected, size parameter');\n    }\n    if (size.length !== 2) {\n      throw new Error('Only two dimensions matrix are supported');\n    }\n\n    // map size & validate\n    size = size.map(function (s) {\n      // check it is a big number\n      if ((0, _is.isBigNumber)(s)) {\n        // convert it\n        s = s.toNumber();\n      }\n      // validate arguments\n      if (!(0, _is.isNumber)(s) || !(0, _number.isInteger)(s) || s < 1) {\n        throw new Error('Size values must be positive integers');\n      }\n      return s;\n    });\n\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if ((0, _is.isBigNumber)(k)) {\n        k = k.toNumber();\n      }\n      // is must be an integer\n      if (!(0, _is.isNumber)(k) || !(0, _number.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    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0;\n\n    // rows and columns\n    var rows = size[0];\n    var columns = size[1];\n\n    // number of non-zero items\n    var n = Math.min(rows - kSub, columns - kSuper);\n\n    // value extraction function\n    var _value;\n\n    // check value\n    if ((0, _is.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      }\n      // define function\n      _value = function _value(i) {\n        // return value @ i\n        return value[i];\n      };\n    } else if ((0, _is.isMatrix)(value)) {\n      // matrix size\n      var ms = value.size();\n      // validate matrix\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      }\n      // define function\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    }\n\n    // discover default value if needed\n    if (!defaultValue) {\n      // check first value in array\n      defaultValue = (0, _is.isBigNumber)(_value(0)) ? _value(0).mul(0) // trick to create a BigNumber with value zero\n      : 0;\n    }\n\n    // empty array\n    var data = [];\n\n    // check we need to resize array\n    if (size.length > 0) {\n      // resize array\n      data = (0, _array.resize)(data, size, defaultValue);\n      // fill diagonal\n      for (var d = 0; d < n; d++) {\n        data[d + kSub][d + kSuper] = _value(d);\n      }\n    }\n\n    // create DenseMatrix\n    return new DenseMatrix({\n      data: data,\n      size: [rows, columns]\n    });\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  DenseMatrix.fromJSON = function (json) {\n    return new DenseMatrix(json);\n  };\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  DenseMatrix.prototype.swapRows = function (i, j) {\n    // check index\n    if (!(0, _is.isNumber)(i) || !(0, _number.isInteger)(i) || !(0, _is.isNumber)(j) || !(0, _number.isInteger)(j)) {\n      throw new Error('Row index must be positive integers');\n    }\n    // check dimensions\n    if (this._size.length !== 2) {\n      throw new Error('Only two dimensional matrix is supported');\n    }\n    // validate index\n    (0, _array.validateIndex)(i, this._size[0]);\n    (0, _array.validateIndex)(j, this._size[0]);\n\n    // swap rows\n    DenseMatrix._swapRows(i, j, this._data);\n    // return current instance\n    return this;\n  };\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   * @param {Array} data     Matrix data\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  /**\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  function preprocess(data) {\n    for (var i = 0, ii = data.length; i < ii; i++) {\n      var elem = data[i];\n      if ((0, _is.isArray)(elem)) {\n        data[i] = preprocess(elem);\n      } else if (elem && elem.isMatrix === true) {\n        data[i] = preprocess(elem.valueOf());\n      }\n    }\n    return data;\n  }\n  return DenseMatrix;\n}, {\n  isClass: true\n});\nexports.createDenseMatrixClass = createDenseMatrixClass;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createClone = void 0;\nvar _object = require(\"../../utils/object.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'clone';\nvar dependencies = ['typed'];\nvar createClone = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\n  /**\n   * Clone an object. Will make a deep copy of the data.\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  return typed(name, {\n    any: _object.clone\n  });\n});\nexports.createClone = createClone;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports._switch = _switch;\n/**\n * Transpose a matrix\n * @param {Array} mat\n * @returns {Array} ret\n * @private\n */\nfunction _switch(mat) {\n  var I = mat.length;\n  var J = mat[0].length;\n  var i, j;\n  var ret = [];\n  for (j = 0; j < J; j++) {\n    var tmp = [];\n    for (i = 0; i < I; i++) {\n      tmp.push(mat[i][j]);\n    }\n    ret.push(tmp);\n  }\n  return ret;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.containsCollections = containsCollections;\nexports.deepForEach = deepForEach;\nexports.deepMap = deepMap;\nexports.reduce = reduce;\nexports.scatter = scatter;\nvar _is = require(\"./is.js\");\nvar _IndexError = require(\"../error/IndexError.js\");\nvar _array = require(\"./array.js\");\nvar _switch2 = require(\"./switch.js\");\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 */\nfunction containsCollections(array) {\n  for (var i = 0; i < array.length; i++) {\n    if ((0, _is.isCollection)(array[i])) {\n      return true;\n    }\n  }\n  return false;\n}\n\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 */\nfunction deepForEach(array, callback) {\n  if ((0, _is.isMatrix)(array)) {\n    array = array.valueOf();\n  }\n  for (var i = 0, ii = array.length; i < ii; i++) {\n    var value = array[i];\n    if (Array.isArray(value)) {\n      deepForEach(value, callback);\n    } else {\n      callback(value);\n    }\n  }\n}\n\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 */\nfunction 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}\n\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 */\nfunction reduce(mat, dim, callback) {\n  var size = Array.isArray(mat) ? (0, _array.arraySize)(mat) : mat.size();\n  if (dim < 0 || dim >= size.length) {\n    // TODO: would be more clear when throwing a DimensionError here\n    throw new _IndexError.IndexError(dim, size.length);\n  }\n  if ((0, _is.isMatrix)(mat)) {\n    return mat.create(_reduce(mat.valueOf(), dim, callback));\n  } else {\n    return _reduce(mat, dim, callback);\n  }\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 */\nfunction _reduce(mat, dim, callback) {\n  var i, ret, val, tran;\n  if (dim <= 0) {\n    if (!Array.isArray(mat[0])) {\n      val = mat[0];\n      for (i = 1; i < mat.length; i++) {\n        val = callback(val, mat[i]);\n      }\n      return val;\n    } else {\n      tran = (0, _switch2._switch)(mat);\n      ret = [];\n      for (i = 0; i < tran.length; i++) {\n        ret[i] = _reduce(tran[i], dim - 1, callback);\n      }\n      return ret;\n    }\n  } else {\n    ret = [];\n    for (i = 0; i < mat.length; i++) {\n      ret[i] = _reduce(mat[i], dim - 1, callback);\n    }\n    return ret;\n  }\n}\n\n// TODO: document function scatter\nfunction scatter(a, j, w, x, u, mark, cindex, f, inverse, update, value) {\n  // a arrays\n  var avalues = a._values;\n  var aindex = a._index;\n  var aptr = a._ptr;\n\n  // vars\n  var k, k0, k1, i;\n\n  // check we need to process values (pattern matrix)\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];\n      // check value exists in current j\n      if (w[i] !== mark) {\n        // i is new entry in j\n        w[i] = mark;\n        // add i to pattern of C\n        cindex.push(i);\n        // x(i) = A, check we need to call function this time\n        if (update) {\n          // copy value to workspace calling callback function\n          x[i] = inverse ? f(avalues[k], value) : f(value, avalues[k]);\n          // function was called on current row\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]);\n        // function was called on current row\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];\n      // check value exists in current j\n      if (w[i] !== mark) {\n        // i is new entry in j\n        w[i] = mark;\n        // add i to pattern of C\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\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createIsInteger = void 0;\nvar _collection = require(\"../../utils/collection.js\");\nvar _number = require(\"../../utils/number.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'isInteger';\nvar dependencies = ['typed'];\nvar createIsInteger = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.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  return typed(name, {\n    number: _number.isInteger,\n    // TODO: what to do with isInteger(add(0.1, 0.2))  ?\n\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': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self);\n      };\n    })\n  });\n});\nexports.createIsInteger = createIsInteger;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.absNumber = absNumber;\nexports.addNumber = addNumber;\nexports.cbrtNumber = cbrtNumber;\nexports.cubeNumber = cubeNumber;\nexports.divideNumber = divideNumber;\nexports.expNumber = expNumber;\nexports.expm1Number = expm1Number;\nexports.gcdNumber = gcdNumber;\nexports.lcmNumber = lcmNumber;\nexports.log10Number = log10Number;\nexports.log1pNumber = log1pNumber;\nexports.log2Number = log2Number;\nexports.logNumber = logNumber;\nexports.modNumber = modNumber;\nexports.multiplyNumber = multiplyNumber;\nexports.normNumber = normNumber;\nexports.nthRootNumber = nthRootNumber;\nexports.powNumber = powNumber;\nexports.roundNumber = roundNumber;\nexports.signNumber = signNumber;\nexports.sqrtNumber = sqrtNumber;\nexports.squareNumber = squareNumber;\nexports.subtractNumber = subtractNumber;\nexports.unaryMinusNumber = unaryMinusNumber;\nexports.unaryPlusNumber = unaryPlusNumber;\nexports.xgcdNumber = xgcdNumber;\nvar _number = require(\"../../utils/number.js\");\nvar n1 = 'number';\nvar n2 = 'number, number';\nfunction absNumber(a) {\n  return Math.abs(a);\n}\nabsNumber.signature = n1;\nfunction addNumber(a, b) {\n  return a + b;\n}\naddNumber.signature = n2;\nfunction subtractNumber(a, b) {\n  return a - b;\n}\nsubtractNumber.signature = n2;\nfunction multiplyNumber(a, b) {\n  return a * b;\n}\nmultiplyNumber.signature = n2;\nfunction divideNumber(a, b) {\n  return a / b;\n}\ndivideNumber.signature = n2;\nfunction unaryMinusNumber(x) {\n  return -x;\n}\nunaryMinusNumber.signature = n1;\nfunction unaryPlusNumber(x) {\n  return x;\n}\nunaryPlusNumber.signature = n1;\nfunction cbrtNumber(x) {\n  return (0, _number.cbrt)(x);\n}\ncbrtNumber.signature = n1;\nfunction cubeNumber(x) {\n  return x * x * x;\n}\ncubeNumber.signature = n1;\nfunction expNumber(x) {\n  return Math.exp(x);\n}\nexpNumber.signature = n1;\nfunction expm1Number(x) {\n  return (0, _number.expm1)(x);\n}\nexpm1Number.signature = n1;\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 */\nfunction gcdNumber(a, b) {\n  if (!(0, _number.isInteger)(a) || !(0, _number.isInteger)(b)) {\n    throw new Error('Parameters in function gcd must be integer numbers');\n  }\n\n  // https://en.wikipedia.org/wiki/Euclidean_algorithm\n  var r;\n  while (b !== 0) {\n    r = a % b;\n    a = b;\n    b = r;\n  }\n  return a < 0 ? -a : a;\n}\ngcdNumber.signature = n2;\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 */\nfunction lcmNumber(a, b) {\n  if (!(0, _number.isInteger)(a) || !(0, _number.isInteger)(b)) {\n    throw new Error('Parameters in function lcm must be integer numbers');\n  }\n  if (a === 0 || b === 0) {\n    return 0;\n  }\n\n  // https://en.wikipedia.org/wiki/Euclidean_algorithm\n  // evaluate lcm here inline to reduce overhead\n  var t;\n  var prod = a * b;\n  while (b !== 0) {\n    t = b;\n    b = a % t;\n    a = t;\n  }\n  return Math.abs(prod / a);\n}\nlcmNumber.signature = n2;\n\n/**\n * Calculate the logarithm of a value, optionally to a given base.\n * @param {number} x\n * @param {number | null | undefined} base\n * @return {number}\n */\nfunction logNumber(x, y) {\n  if (y) {\n    return Math.log(x) / Math.log(y);\n  }\n  return Math.log(x);\n}\n\n/**\n * Calculate the 10-base logarithm of a number\n * @param {number} x\n * @return {number}\n */\nfunction log10Number(x) {\n  return (0, _number.log10)(x);\n}\nlog10Number.signature = n1;\n\n/**\n * Calculate the 2-base logarithm of a number\n * @param {number} x\n * @return {number}\n */\nfunction log2Number(x) {\n  return (0, _number.log2)(x);\n}\nlog2Number.signature = n1;\n\n/**\n * Calculate the natural logarithm of a `number+1`\n * @param {number} x\n * @returns {number}\n */\nfunction log1pNumber(x) {\n  return (0, _number.log1p)(x);\n}\nlog1pNumber.signature = n1;\n\n/**\n * Calculate the modulus of two numbers\n * @param {number} x\n * @param {number} y\n * @returns {number} res\n * @private\n */\nfunction modNumber(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}\nmodNumber.signature = n2;\n\n/**\n * Calculate the nth root of a, solve x^root == a\n * http://rosettacode.org/wiki/Nth_root#JavaScript\n * @param {number} a\n * @param {number} [2] root\n * @private\n */\nfunction nthRootNumber(a) {\n  var root = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 2;\n  var inv = root < 0;\n  if (inv) {\n    root = -root;\n  }\n  if (root === 0) {\n    throw new Error('Root must be non-zero');\n  }\n  if (a < 0 && Math.abs(root) % 2 !== 1) {\n    throw new Error('Root must be odd when a is negative.');\n  }\n\n  // edge cases zero and infinity\n  if (a === 0) {\n    return inv ? Infinity : 0;\n  }\n  if (!isFinite(a)) {\n    return inv ? 0 : a;\n  }\n  var x = Math.pow(Math.abs(a), 1 / root);\n  // If a < 0, we require that root is an odd integer,\n  // so (-1) ^ (1/root) = -1\n  x = a < 0 ? -x : x;\n  return inv ? 1 / x : x;\n\n  // 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  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\nfunction signNumber(x) {\n  return (0, _number.sign)(x);\n}\nsignNumber.signature = n1;\nfunction sqrtNumber(x) {\n  return Math.sqrt(x);\n}\nsqrtNumber.signature = n1;\nfunction squareNumber(x) {\n  return x * x;\n}\nsquareNumber.signature = n1;\n\n/**\n * Calculate xgcd for two numbers\n * @param {number} a\n * @param {number} b\n * @return {number} result\n * @private\n */\nfunction xgcdNumber(a, b) {\n  // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm\n  var t; // used to swap two variables\n  var q; // quotient\n  var r; // remainder\n  var x = 0;\n  var lastx = 1;\n  var y = 1;\n  var lasty = 0;\n  if (!(0, _number.isInteger)(a) || !(0, _number.isInteger)(b)) {\n    throw new Error('Parameters in function xgcd must be integer numbers');\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  var res;\n  if (a < 0) {\n    res = [-a, -lastx, -lasty];\n  } else {\n    res = [a, a ? lastx : 0, lasty];\n  }\n  return res;\n}\nxgcdNumber.signature = n2;\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} res\n */\nfunction powNumber(x, y) {\n  // x^Infinity === 0 if -1 < x < 1\n  // A real number 0 is returned instead of complex(0)\n  if (x * x < 1 && y === Infinity || x * x > 1 && y === -Infinity) {\n    return 0;\n  }\n  return Math.pow(x, y);\n}\npowNumber.signature = n2;\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 */\nfunction roundNumber(value) {\n  var decimals = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n  if (!(0, _number.isInteger)(decimals) || decimals < 0 || decimals > 15) {\n    throw new Error('Number of decimals in function round must be an integer from 0 to 15 inclusive');\n  }\n  return parseFloat((0, _number.toFixed)(value, decimals));\n}\n\n/**\n * Calculate the norm of a number, the absolute value.\n * @param {number} x\n * @return {number}\n */\nfunction normNumber(x) {\n  return Math.abs(x);\n}\nnormNumber.signature = n1;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.bitAndNumber = bitAndNumber;\nexports.bitNotNumber = bitNotNumber;\nexports.bitOrNumber = bitOrNumber;\nexports.bitXorNumber = bitXorNumber;\nexports.leftShiftNumber = leftShiftNumber;\nexports.rightArithShiftNumber = rightArithShiftNumber;\nexports.rightLogShiftNumber = rightLogShiftNumber;\nvar _number = require(\"../../utils/number.js\");\nvar n1 = 'number';\nvar n2 = 'number, number';\nfunction bitAndNumber(x, y) {\n  if (!(0, _number.isInteger)(x) || !(0, _number.isInteger)(y)) {\n    throw new Error('Integers expected in function bitAnd');\n  }\n  return x & y;\n}\nbitAndNumber.signature = n2;\nfunction bitNotNumber(x) {\n  if (!(0, _number.isInteger)(x)) {\n    throw new Error('Integer expected in function bitNot');\n  }\n  return ~x;\n}\nbitNotNumber.signature = n1;\nfunction bitOrNumber(x, y) {\n  if (!(0, _number.isInteger)(x) || !(0, _number.isInteger)(y)) {\n    throw new Error('Integers expected in function bitOr');\n  }\n  return x | y;\n}\nbitOrNumber.signature = n2;\nfunction bitXorNumber(x, y) {\n  if (!(0, _number.isInteger)(x) || !(0, _number.isInteger)(y)) {\n    throw new Error('Integers expected in function bitXor');\n  }\n  return x ^ y;\n}\nbitXorNumber.signature = n2;\nfunction leftShiftNumber(x, y) {\n  if (!(0, _number.isInteger)(x) || !(0, _number.isInteger)(y)) {\n    throw new Error('Integers expected in function leftShift');\n  }\n  return x << y;\n}\nleftShiftNumber.signature = n2;\nfunction rightArithShiftNumber(x, y) {\n  if (!(0, _number.isInteger)(x) || !(0, _number.isInteger)(y)) {\n    throw new Error('Integers expected in function rightArithShift');\n  }\n  return x >> y;\n}\nrightArithShiftNumber.signature = n2;\nfunction rightLogShiftNumber(x, y) {\n  if (!(0, _number.isInteger)(x) || !(0, _number.isInteger)(y)) {\n    throw new Error('Integers expected in function rightLogShift');\n  }\n  return x >>> y;\n}\nrightLogShiftNumber.signature = n2;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.product = product;\n/** @param {number} i\n *  @param {number} n\n *  @returns {number} product of i to n\n */\nfunction product(i, n) {\n  if (n < i) {\n    return 1;\n  }\n  if (n === i) {\n    return n;\n  }\n  var half = n + i >> 1; // divide (n + i) by 2 and truncate to integer\n  return product(i, half) * product(half + 1, n);\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.combinationsNumber = combinationsNumber;\nvar _number = require(\"../../utils/number.js\");\nvar _product = require(\"../../utils/product.js\");\nfunction combinationsNumber(n, k) {\n  if (!(0, _number.isInteger)(n) || n < 0) {\n    throw new TypeError('Positive integer value expected in function combinations');\n  }\n  if (!(0, _number.isInteger)(k) || k < 0) {\n    throw new TypeError('Positive integer value expected in function combinations');\n  }\n  if (k > n) {\n    throw new TypeError('k must be less than or equal to n');\n  }\n  var nMinusk = n - k;\n  var answer = 1;\n  var firstnumerator = k < nMinusk ? nMinusk + 1 : k + 1;\n  var nextdivisor = 2;\n  var lastdivisor = k < nMinusk ? k : nMinusk;\n  // balance multiplications and divisions to try to keep intermediate values\n  // in exact-integer range as long as possible\n  for (var nextnumerator = firstnumerator; nextnumerator <= n; ++nextnumerator) {\n    answer *= nextnumerator;\n    while (nextdivisor <= lastdivisor && answer % nextdivisor === 0) {\n      answer /= nextdivisor;\n      ++nextdivisor;\n    }\n  }\n  // for big n, k, floating point may have caused weirdness in remainder\n  if (nextdivisor <= lastdivisor) {\n    answer /= (0, _product.product)(nextdivisor, lastdivisor);\n  }\n  return answer;\n}\ncombinationsNumber.signature = 'number, number';","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.tau = exports.pi = exports.phi = exports.e = void 0;\nvar pi = Math.PI;\nexports.pi = pi;\nvar tau = 2 * Math.PI;\nexports.tau = tau;\nvar e = Math.E;\nexports.e = e;\nvar phi = 1.6180339887498948; // eslint-disable-line no-loss-of-precision\nexports.phi = phi;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.andNumber = andNumber;\nexports.notNumber = notNumber;\nexports.orNumber = orNumber;\nexports.xorNumber = xorNumber;\nvar n1 = 'number';\nvar n2 = 'number, number';\nfunction notNumber(x) {\n  return !x;\n}\nnotNumber.signature = n1;\nfunction orNumber(x, y) {\n  return !!(x || y);\n}\norNumber.signature = n2;\nfunction xorNumber(x, y) {\n  return !!x !== !!y;\n}\nxorNumber.signature = n2;\nfunction andNumber(x, y) {\n  return !!(x && y);\n}\nandNumber.signature = n2;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.gammaG = void 0;\nexports.gammaNumber = gammaNumber;\nexports.lgammaN = exports.lgammaG = exports.gammaP = void 0;\nexports.lgammaNumber = lgammaNumber;\nexports.lnSqrt2PI = exports.lgammaSeries = void 0;\nvar _number = require(\"../../utils/number.js\");\nvar _product = require(\"../../utils/product.js\");\n/* eslint-disable no-loss-of-precision */\n\nfunction gammaNumber(n) {\n  var x;\n  if ((0, _number.isInteger)(n)) {\n    if (n <= 0) {\n      return isFinite(n) ? Infinity : NaN;\n    }\n    if (n > 171) {\n      return Infinity; // Will overflow\n    }\n\n    return (0, _product.product)(1, n - 1);\n  }\n  if (n < 0.5) {\n    return Math.PI / (Math.sin(Math.PI * n) * gammaNumber(1 - 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  x = gammaP[0];\n  for (var i = 1; i < gammaP.length; ++i) {\n    x += gammaP[i] / (n + i);\n  }\n  var t = n + gammaG + 0.5;\n  return Math.sqrt(2 * Math.PI) * Math.pow(t, n + 0.5) * Math.exp(-t) * x;\n}\ngammaNumber.signature = 'number';\n\n// TODO: comment on the variables g and p\n\nvar gammaG = 4.7421875;\nexports.gammaG = gammaG;\nvar gammaP = [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];\n\n// lgamma implementation ref: https://mrob.com/pub/ries/lanczos-gamma.html#code\n\n// log(2 * pi) / 2\nexports.gammaP = gammaP;\nvar lnSqrt2PI = 0.91893853320467274178;\nexports.lnSqrt2PI = lnSqrt2PI;\nvar lgammaG = 5; // Lanczos parameter \"g\"\nexports.lgammaG = lgammaG;\nvar lgammaN = 7; // Range of coefficients \"n\"\nexports.lgammaN = lgammaN;\nvar lgammaSeries = [1.000000000190015, 76.18009172947146, -86.50532032941677, 24.01409824083091, -1.231739572450155, 0.1208650973866179e-2, -0.5395239384953e-5];\nexports.lgammaSeries = lgammaSeries;\nfunction lgammaNumber(n) {\n  if (n < 0) return NaN;\n  if (n === 0) return Infinity;\n  if (!isFinite(n)) return n;\n  if (n < 0.5) {\n    // Use Euler's reflection formula:\n    // gamma(z) = PI / (sin(PI * z) * gamma(1 - z))\n    return Math.log(Math.PI / Math.sin(Math.PI * n)) - lgammaNumber(1 - n);\n  }\n\n  // Compute the logarithm of the Gamma function using the Lanczos method\n\n  n = n - 1;\n  var base = n + lgammaG + 0.5; // Base of the Lanczos exponential\n  var sum = lgammaSeries[0];\n\n  // We start with the terms that have the smallest coefficients and largest denominator\n  for (var i = lgammaN - 1; i >= 1; i--) {\n    sum += lgammaSeries[i] / (n + i);\n  }\n  return lnSqrt2PI + (n + 0.5) * Math.log(base) - base + Math.log(sum);\n}\nlgammaNumber.signature = 'number';","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.acosNumber = acosNumber;\nexports.acoshNumber = acoshNumber;\nexports.acotNumber = acotNumber;\nexports.acothNumber = acothNumber;\nexports.acscNumber = acscNumber;\nexports.acschNumber = acschNumber;\nexports.asecNumber = asecNumber;\nexports.asechNumber = asechNumber;\nexports.asinNumber = asinNumber;\nexports.asinhNumber = asinhNumber;\nexports.atan2Number = atan2Number;\nexports.atanNumber = atanNumber;\nexports.atanhNumber = atanhNumber;\nexports.cosNumber = cosNumber;\nexports.coshNumber = coshNumber;\nexports.cotNumber = cotNumber;\nexports.cothNumber = cothNumber;\nexports.cscNumber = cscNumber;\nexports.cschNumber = cschNumber;\nexports.secNumber = secNumber;\nexports.sechNumber = sechNumber;\nexports.sinNumber = sinNumber;\nexports.sinhNumber = sinhNumber;\nexports.tanNumber = tanNumber;\nexports.tanhNumber = tanhNumber;\nvar _number = require(\"../../utils/number.js\");\nvar n1 = 'number';\nvar n2 = 'number, number';\nfunction acosNumber(x) {\n  return Math.acos(x);\n}\nacosNumber.signature = n1;\nfunction acoshNumber(x) {\n  return (0, _number.acosh)(x);\n}\nacoshNumber.signature = n1;\nfunction acotNumber(x) {\n  return Math.atan(1 / x);\n}\nacotNumber.signature = n1;\nfunction acothNumber(x) {\n  return isFinite(x) ? (Math.log((x + 1) / x) + Math.log(x / (x - 1))) / 2 : 0;\n}\nacothNumber.signature = n1;\nfunction acscNumber(x) {\n  return Math.asin(1 / x);\n}\nacscNumber.signature = n1;\nfunction acschNumber(x) {\n  var xInv = 1 / x;\n  return Math.log(xInv + Math.sqrt(xInv * xInv + 1));\n}\nacschNumber.signature = n1;\nfunction asecNumber(x) {\n  return Math.acos(1 / x);\n}\nasecNumber.signature = n1;\nfunction asechNumber(x) {\n  var xInv = 1 / x;\n  var ret = Math.sqrt(xInv * xInv - 1);\n  return Math.log(ret + xInv);\n}\nasechNumber.signature = n1;\nfunction asinNumber(x) {\n  return Math.asin(x);\n}\nasinNumber.signature = n1;\nfunction asinhNumber(x) {\n  return (0, _number.asinh)(x);\n}\nasinhNumber.signature = n1;\nfunction atanNumber(x) {\n  return Math.atan(x);\n}\natanNumber.signature = n1;\nfunction atan2Number(y, x) {\n  return Math.atan2(y, x);\n}\natan2Number.signature = n2;\nfunction atanhNumber(x) {\n  return (0, _number.atanh)(x);\n}\natanhNumber.signature = n1;\nfunction cosNumber(x) {\n  return Math.cos(x);\n}\ncosNumber.signature = n1;\nfunction coshNumber(x) {\n  return (0, _number.cosh)(x);\n}\ncoshNumber.signature = n1;\nfunction cotNumber(x) {\n  return 1 / Math.tan(x);\n}\ncotNumber.signature = n1;\nfunction cothNumber(x) {\n  var e = Math.exp(2 * x);\n  return (e + 1) / (e - 1);\n}\ncothNumber.signature = n1;\nfunction cscNumber(x) {\n  return 1 / Math.sin(x);\n}\ncscNumber.signature = n1;\nfunction cschNumber(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))) * (0, _number.sign)(x);\n  }\n}\ncschNumber.signature = n1;\nfunction secNumber(x) {\n  return 1 / Math.cos(x);\n}\nsecNumber.signature = n1;\nfunction sechNumber(x) {\n  return 2 / (Math.exp(x) + Math.exp(-x));\n}\nsechNumber.signature = n1;\nfunction sinNumber(x) {\n  return Math.sin(x);\n}\nsinNumber.signature = n1;\nfunction sinhNumber(x) {\n  return (0, _number.sinh)(x);\n}\nsinhNumber.signature = n1;\nfunction tanNumber(x) {\n  return Math.tan(x);\n}\ntanNumber.signature = n1;\nfunction tanhNumber(x) {\n  return (0, _number.tanh)(x);\n}\ntanhNumber.signature = n1;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.isIntegerNumber = isIntegerNumber;\nexports.isNaNNumber = isNaNNumber;\nexports.isNegativeNumber = isNegativeNumber;\nexports.isPositiveNumber = isPositiveNumber;\nexports.isZeroNumber = isZeroNumber;\nvar _number = require(\"../../utils/number.js\");\nvar n1 = 'number';\nfunction isIntegerNumber(x) {\n  return (0, _number.isInteger)(x);\n}\nisIntegerNumber.signature = n1;\nfunction isNegativeNumber(x) {\n  return x < 0;\n}\nisNegativeNumber.signature = n1;\nfunction isPositiveNumber(x) {\n  return x > 0;\n}\nisPositiveNumber.signature = n1;\nfunction isZeroNumber(x) {\n  return x === 0;\n}\nisZeroNumber.signature = n1;\nfunction isNaNNumber(x) {\n  return Number.isNaN(x);\n}\nisNaNNumber.signature = n1;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nvar _arithmetic = require(\"./arithmetic.js\");\nObject.keys(_arithmetic).forEach(function (key) {\n  if (key === \"default\" || key === \"__esModule\") return;\n  if (key in exports && exports[key] === _arithmetic[key]) return;\n  Object.defineProperty(exports, key, {\n    enumerable: true,\n    get: function get() {\n      return _arithmetic[key];\n    }\n  });\n});\nvar _bitwise = require(\"./bitwise.js\");\nObject.keys(_bitwise).forEach(function (key) {\n  if (key === \"default\" || key === \"__esModule\") return;\n  if (key in exports && exports[key] === _bitwise[key]) return;\n  Object.defineProperty(exports, key, {\n    enumerable: true,\n    get: function get() {\n      return _bitwise[key];\n    }\n  });\n});\nvar _combinations = require(\"./combinations.js\");\nObject.keys(_combinations).forEach(function (key) {\n  if (key === \"default\" || key === \"__esModule\") return;\n  if (key in exports && exports[key] === _combinations[key]) return;\n  Object.defineProperty(exports, key, {\n    enumerable: true,\n    get: function get() {\n      return _combinations[key];\n    }\n  });\n});\nvar _constants = require(\"./constants.js\");\nObject.keys(_constants).forEach(function (key) {\n  if (key === \"default\" || key === \"__esModule\") return;\n  if (key in exports && exports[key] === _constants[key]) return;\n  Object.defineProperty(exports, key, {\n    enumerable: true,\n    get: function get() {\n      return _constants[key];\n    }\n  });\n});\nvar _logical = require(\"./logical.js\");\nObject.keys(_logical).forEach(function (key) {\n  if (key === \"default\" || key === \"__esModule\") return;\n  if (key in exports && exports[key] === _logical[key]) return;\n  Object.defineProperty(exports, key, {\n    enumerable: true,\n    get: function get() {\n      return _logical[key];\n    }\n  });\n});\nvar _relational = require(\"./relational.js\");\nObject.keys(_relational).forEach(function (key) {\n  if (key === \"default\" || key === \"__esModule\") return;\n  if (key in exports && exports[key] === _relational[key]) return;\n  Object.defineProperty(exports, key, {\n    enumerable: true,\n    get: function get() {\n      return _relational[key];\n    }\n  });\n});\nvar _probability = require(\"./probability.js\");\nObject.keys(_probability).forEach(function (key) {\n  if (key === \"default\" || key === \"__esModule\") return;\n  if (key in exports && exports[key] === _probability[key]) return;\n  Object.defineProperty(exports, key, {\n    enumerable: true,\n    get: function get() {\n      return _probability[key];\n    }\n  });\n});\nvar _trigonometry = require(\"./trigonometry.js\");\nObject.keys(_trigonometry).forEach(function (key) {\n  if (key === \"default\" || key === \"__esModule\") return;\n  if (key in exports && exports[key] === _trigonometry[key]) return;\n  Object.defineProperty(exports, key, {\n    enumerable: true,\n    get: function get() {\n      return _trigonometry[key];\n    }\n  });\n});\nvar _utils = require(\"./utils.js\");\nObject.keys(_utils).forEach(function (key) {\n  if (key === \"default\" || key === \"__esModule\") return;\n  if (key in exports && exports[key] === _utils[key]) return;\n  Object.defineProperty(exports, key, {\n    enumerable: true,\n    get: function get() {\n      return _utils[key];\n    }\n  });\n});","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createIsNegative = void 0;\nvar _collection = require(\"../../utils/collection.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'isNegative';\nvar dependencies = ['typed'];\nvar createIsNegative = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.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  return typed(name, {\n    number: _index.isNegativeNumber,\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\n    Unit: typed.referToSelf(function (self) {\n      return function (x) {\n        return typed.find(self, x.valueType())(x.value);\n      };\n    }),\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self);\n      };\n    })\n  });\n});\nexports.createIsNegative = createIsNegative;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createIsNumeric = void 0;\nvar _collection = require(\"../../utils/collection.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'isNumeric';\nvar dependencies = ['typed'];\nvar createIsNumeric = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.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 false\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  return typed(name, {\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': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self);\n      };\n    })\n  });\n});\nexports.createIsNumeric = createIsNumeric;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createHasNumericValue = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'hasNumericValue';\nvar dependencies = ['typed', 'isNumeric'];\nvar createHasNumericValue = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    isNumeric = _ref.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(false)                 // returns true\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  return typed(name, {\n    \"boolean\": function boolean() {\n      return true;\n    },\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});\nexports.createHasNumericValue = createHasNumericValue;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createIsPositive = void 0;\nvar _collection = require(\"../../utils/collection.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'isPositive';\nvar dependencies = ['typed'];\nvar createIsPositive = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.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 true\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  return typed(name, {\n    number: _index.isPositiveNumber,\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: typed.referToSelf(function (self) {\n      return function (x) {\n        return typed.find(self, x.valueType())(x.value);\n      };\n    }),\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self);\n      };\n    })\n  });\n});\nexports.createIsPositive = createIsPositive;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createIsZero = void 0;\nvar _collection = require(\"../../utils/collection.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'isZero';\nvar dependencies = ['typed'];\nvar createIsZero = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.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  return typed(name, {\n    number: _index.isZeroNumber,\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: typed.referToSelf(function (self) {\n      return function (x) {\n        return typed.find(self, x.valueType())(x.value);\n      };\n    }),\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self);\n      };\n    })\n  });\n});\nexports.createIsZero = createIsZero;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createIsNaN = void 0;\nvar _collection = require(\"../../utils/collection.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'isNaN';\nvar dependencies = ['typed'];\nvar createIsNaN = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.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  return typed(name, {\n    number: _index.isNaNNumber,\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 (0, _collection.deepMap)(x, Number.isNaN);\n    }\n  });\n});\nexports.createIsNaN = createIsNaN;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createTypeOf = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _is = require(\"../../utils/is.js\");\nvar name = 'typeOf';\nvar dependencies = ['typed'];\nvar createTypeOf = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\n  /**\n   * Determine the type of an entity.\n   *\n   * Syntax:\n   *\n   *    math.typeOf(x)\n   *\n   * Examples:\n   *\n   *    // This list is intended to include all relevant types, for testing\n   *    // purposes:\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   *    math.typeOf(null)                     // returns 'null'\n   *    math.typeOf(true)                     // returns 'boolean'\n   *    math.typeOf([1, 2, 3])                // returns 'Array'\n   *    math.typeOf(new Date())               // returns 'Date'\n   *    math.typeOf(function () {})           // returns 'function'\n   *    math.typeOf({a: 2, b: 3})             // returns 'Object'\n   *    math.typeOf(/a regexp/)               // returns 'RegExp'\n   *    math.typeOf(undefined)                // returns 'undefined'\n   *    math.typeOf(math.bignumber('23e99'))  // returns 'BigNumber'\n   *    math.typeOf(math.chain(2))            // returns 'Chain'\n   *    math.typeOf(math.fraction(1, 3))      // returns 'Fraction'\n   *    math.typeOf(math.help('sqrt'))        // returns 'Help'\n   *    math.typeOf(math.index(1, 3))         // returns 'Index'\n   *    math.typeOf(math.matrix([[1],[3]]))   // returns 'DenseMatrix'\n   *    math.typeOf(math.matrix([],'sparse')) // returns 'SparseMatrix'\n   *    math.typeOf(new math.Range(0, 10))    // returns 'Range'\n   *    math.typeOf(math.evaluate('a=2\\na'))  // returns 'ResultSet'\n   *    math.typeOf(math.parse('A[2]'))       // returns 'AccessorNode'\n   *    math.typeOf(math.parse('[1,2,3]'))    // returns 'ArrayNode'\n   *    math.typeOf(math.parse('x=2'))        // returns 'AssignmentNode'\n   *    math.typeOf(math.parse('a=2; b=3'))   // returns 'BlockNode'\n   *    math.typeOf(math.parse('x<0?-1:1'))   // returns 'ConditionalNode'\n   *    math.typeOf(math.parse('2.3'))        // returns 'ConstantNode'\n   *    math.typeOf(math.parse('f(x)=x^2'))   // returns 'FunctionAssignmentNode'\n   *    math.typeOf(math.parse('sqrt(4)'))    // returns 'FunctionNode'\n   *    math.typeOf(math.parse('A[2]').index) // returns 'IndexNode'\n   *    math.typeOf(math.parse('{a:2}'))      // returns 'ObjectNode'\n   *    math.typeOf(math.parse('(2+3)'))      // returns 'ParenthesisNode'\n   *    math.typeOf(math.parse('1:10'))       // returns 'RangeNode'\n   *    math.typeOf(math.parse('a<b<c'))      // returns 'RelationalNode'\n   *    math.typeOf(math.parse('x'))          // returns 'SymbolNode'\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  return typed(name, {\n    any: _is.typeOf\n  });\n});\nexports.createTypeOf = createTypeOf;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.nearlyEqual = nearlyEqual;\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 */\nfunction 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  }\n\n  // use \"==\" operator, handles infinities\n  if (x.eq(y)) {\n    return true;\n  }\n\n  // NaN\n  if (x.isNaN() || y.isNaN()) {\n    return false;\n  }\n\n  // at this point x and y should be finite\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    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  }\n\n  // Infinite and Number or negative Infinite and positive Infinite cases\n  return false;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.complexEquals = complexEquals;\nvar _number = require(\"./number.js\");\n/**\n * Test whether two complex values are equal provided a given epsilon.\n * Does not use or change the global Complex.EPSILON setting\n * @param {Complex} x\n * @param {Complex} y\n * @param {number} epsilon\n * @returns {boolean}\n */\nfunction complexEquals(x, y, epsilon) {\n  return (0, _number.nearlyEqual)(x.re, y.re, epsilon) && (0, _number.nearlyEqual)(x.im, y.im, epsilon);\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCompareUnits = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar createCompareUnits = /* #__PURE__ */(0, _factory.factory)('compareUnits', ['typed'], function (_ref) {\n  var typed = _ref.typed;\n  return {\n    'Unit, Unit': typed.referToSelf(function (self) {\n      return function (x, y) {\n        if (!x.equalBase(y)) {\n          throw new Error('Cannot compare units with different base');\n        }\n        return typed.find(self, [x.valueType(), y.valueType()])(x.value, y.value);\n      };\n    })\n  };\n});\nexports.createCompareUnits = createCompareUnits;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createEqualScalarNumber = exports.createEqualScalar = void 0;\nvar _nearlyEqual = require(\"../../utils/bignumber/nearlyEqual.js\");\nvar _number = require(\"../../utils/number.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _complex = require(\"../../utils/complex.js\");\nvar _compareUnits = require(\"./compareUnits.js\");\nvar name = 'equalScalar';\nvar dependencies = ['typed', 'config'];\nvar createEqualScalar = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config;\n  var compareUnits = (0, _compareUnits.createCompareUnits)({\n    typed: typed\n  });\n\n  /**\n   * Test whether two scalar values are nearly 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  return typed(name, {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x === y;\n    },\n    'number, number': function numberNumber(x, y) {\n      return (0, _number.nearlyEqual)(x, y, config.epsilon);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.eq(y) || (0, _nearlyEqual.nearlyEqual)(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 (0, _complex.complexEquals)(x, y, config.epsilon);\n    }\n  }, compareUnits);\n});\nexports.createEqualScalar = createEqualScalar;\nvar createEqualScalarNumber = (0, _factory.factory)(name, ['typed', 'config'], function (_ref2) {\n  var typed = _ref2.typed,\n    config = _ref2.config;\n  return typed(name, {\n    'number, number': function numberNumber(x, y) {\n      return (0, _number.nearlyEqual)(x, y, config.epsilon);\n    }\n  });\n});\nexports.createEqualScalarNumber = createEqualScalarNumber;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSparseMatrixClass = void 0;\nvar _regenerator = _interopRequireDefault(require(\"@babel/runtime/regenerator\"));\nvar _is = require(\"../../utils/is.js\");\nvar _number = require(\"../../utils/number.js\");\nvar _string = require(\"../../utils/string.js\");\nvar _object = require(\"../../utils/object.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _DimensionError = require(\"../../error/DimensionError.js\");\nvar _function = require(\"../../utils/function.js\");\nvar name = 'SparseMatrix';\nvar dependencies = ['typed', 'equalScalar', 'Matrix'];\nvar createSparseMatrixClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    equalScalar = _ref.equalScalar,\n    Matrix = _ref.Matrix;\n  /**\n   * Sparse Matrix implementation. This type implements\n   * a [Compressed Column Storage](https://en.wikipedia.org/wiki/Sparse_matrix#Compressed_sparse_column_(CSC_or_CCS))\n   * format for two-dimensional sparse matrices.\n   * @class SparseMatrix\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    if (datatype && !(0, _is.isString)(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\n    }\n    if ((0, _is.isMatrix)(data)) {\n      // create from matrix\n      _createFromMatrix(this, data, datatype);\n    } else if (data && (0, _is.isArray)(data.index) && (0, _is.isArray)(data.ptr) && (0, _is.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 ((0, _is.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 (' + (0, _is.typeOf)(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  function _createFromMatrix(matrix, source, datatype) {\n    // check matrix type\n    if (source.type === 'SparseMatrix') {\n      // clone arrays\n      matrix._values = source._values ? (0, _object.clone)(source._values) : undefined;\n      matrix._index = (0, _object.clone)(source._index);\n      matrix._ptr = (0, _object.clone)(source._ptr);\n      matrix._size = (0, _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  function _createFromArray(matrix, data, datatype) {\n    // initialize fields\n    matrix._values = [];\n    matrix._index = [];\n    matrix._ptr = [];\n    matrix._datatype = datatype;\n    // discover rows & columns, do not use math.size() to avoid looping array twice\n    var rows = data.length;\n    var columns = 0;\n\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if ((0, _is.isString)(datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, datatype);\n    }\n\n    // check we have rows (empty array)\n    if (rows > 0) {\n      // column index\n      var j = 0;\n      do {\n        // store pointer to values index\n        matrix._ptr.push(matrix._index.length);\n        // loop rows\n        for (var i = 0; i < rows; i++) {\n          // current row\n          var row = data[i];\n          // check row is an array\n          if ((0, _is.isArray)(row)) {\n            // update columns if needed (only on first column)\n            if (j === 0 && columns < row.length) {\n              columns = row.length;\n            }\n            // check row has column\n            if (j < row.length) {\n              // value\n              var v = row[j];\n              // check value != 0\n              if (!eq(v, zero)) {\n                // store value\n                matrix._values.push(v);\n                // index\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            }\n            // check value != 0 (row is a scalar)\n            if (!eq(row, zero)) {\n              // store value\n              matrix._values.push(row);\n              // index\n              matrix._index.push(i);\n            }\n          }\n        }\n        // increment index\n        j++;\n      } while (j < columns);\n    }\n    // store number of values in ptr\n    matrix._ptr.push(matrix._index.length);\n    // size\n    matrix._size = [rows, columns];\n  }\n  SparseMatrix.prototype = new Matrix();\n\n  /**\n   * Create a new SparseMatrix\n   */\n  SparseMatrix.prototype.createSparseMatrix = function (data, datatype) {\n    return new SparseMatrix(data, datatype);\n  };\n\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(SparseMatrix, 'name', {\n    value: 'SparseMatrix'\n  });\n  SparseMatrix.prototype.constructor = SparseMatrix;\n  SparseMatrix.prototype.type = 'SparseMatrix';\n  SparseMatrix.prototype.isSparseMatrix = true;\n\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  SparseMatrix.prototype.getDataType = function () {\n    return (0, _array.getArrayDataType)(this._values, _is.typeOf);\n  };\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  SparseMatrix.prototype.storage = function () {\n    return 'sparse';\n  };\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  SparseMatrix.prototype.datatype = function () {\n    return this._datatype;\n  };\n\n  /**\n   * Create a new SparseMatrix\n   * @memberof SparseMatrix\n   * @param {Array} data\n   * @param {string} [datatype]\n   */\n  SparseMatrix.prototype.create = function (data, datatype) {\n    return new SparseMatrix(data, datatype);\n  };\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  SparseMatrix.prototype.density = function () {\n    // rows & columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n    // calculate density\n    return rows !== 0 && columns !== 0 ? this._index.length / (rows * columns) : 0;\n  };\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 | 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  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    }\n\n    // check arguments\n    switch (arguments.length) {\n      case 1:\n        return _getsubset(this, index);\n\n      // intentional fall through\n      case 2:\n      case 3:\n        return _setsubset(this, index, replacement, defaultValue);\n      default:\n        throw new SyntaxError('Wrong number of arguments');\n    }\n  };\n  function _getsubset(matrix, idx) {\n    // check idx\n    if (!(0, _is.isIndex)(idx)) {\n      throw new TypeError('Invalid index');\n    }\n    var isScalar = idx.isScalar();\n    if (isScalar) {\n      // return a scalar\n      return matrix.get(idx.min());\n    }\n    // validate dimensions\n    var size = idx.size();\n    if (size.length !== matrix._size.length) {\n      throw new _DimensionError.DimensionError(size.length, matrix._size.length);\n    }\n\n    // vars\n    var i, ii, k, kk;\n\n    // validate if any of the ranges in the index is out of range\n    var min = idx.min();\n    var max = idx.max();\n    for (i = 0, ii = matrix._size.length; i < ii; i++) {\n      (0, _array.validateIndex)(min[i], matrix._size[i]);\n      (0, _array.validateIndex)(max[i], matrix._size[i]);\n    }\n\n    // matrix arrays\n    var mvalues = matrix._values;\n    var mindex = matrix._index;\n    var mptr = matrix._ptr;\n\n    // rows & columns dimensions for result matrix\n    var rows = idx.dimension(0);\n    var columns = idx.dimension(1);\n\n    // workspace & permutation vector\n    var w = [];\n    var pv = [];\n\n    // loop rows in resulting matrix\n    rows.forEach(function (i, r) {\n      // update permutation vector\n      pv[i] = r[0];\n      // mark i in workspace\n      w[i] = true;\n    });\n\n    // result matrix arrays\n    var values = mvalues ? [] : undefined;\n    var index = [];\n    var ptr = [];\n\n    // loop columns in result matrix\n    columns.forEach(function (j) {\n      // update ptr\n      ptr.push(index.length);\n      // loop values in column j\n      for (k = mptr[j], kk = mptr[j + 1]; k < kk; k++) {\n        // row\n        i = mindex[k];\n        // check row is in result matrix\n        if (w[i] === true) {\n          // push index\n          index.push(pv[i]);\n          // check we need to process values\n          if (values) {\n            values.push(mvalues[k]);\n          }\n        }\n      }\n    });\n    // update ptr\n    ptr.push(index.length);\n\n    // return matrix\n    return new SparseMatrix({\n      values: values,\n      index: index,\n      ptr: ptr,\n      size: size,\n      datatype: matrix._datatype\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    }\n\n    // get index size and check whether the index contains a single value\n    var iSize = index.size();\n    var isScalar = index.isScalar();\n\n    // calculate the size of the submatrix, and convert it into an Array if needed\n    var sSize;\n    if ((0, _is.isMatrix)(submatrix)) {\n      // submatrix size\n      sSize = submatrix.size();\n      // use array representation\n      submatrix = submatrix.toArray();\n    } else {\n      // get submatrix size (array, scalar)\n      sSize = (0, _array.arraySize)(submatrix);\n    }\n\n    // check index is a scalar\n    if (isScalar) {\n      // verify submatrix is a scalar\n      if (sSize.length !== 0) {\n        throw new TypeError('Scalar expected');\n      }\n      // set value\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.DimensionError(iSize.length, matrix._size.length, '<');\n      }\n\n      // check submatrix and index have the same dimensions\n      if (sSize.length < iSize.length) {\n        // calculate number of missing outer dimensions\n        var i = 0;\n        var outer = 0;\n        while (iSize[i] === 1 && sSize[i] === 1) {\n          i++;\n        }\n        while (iSize[i] === 1) {\n          outer++;\n          i++;\n        }\n        // unsqueeze both outer and inner dimensions\n        submatrix = (0, _array.unsqueeze)(submatrix, iSize.length, outer, sSize);\n      }\n\n      // check whether the size of the submatrix matches the index size\n      if (!(0, _object.deepStrictEqual)(iSize, sSize)) {\n        throw new _DimensionError.DimensionError(iSize, sSize, '>');\n      }\n\n      // insert the sub matrix\n      if (iSize.length === 1) {\n        // if the replacement index only has 1 dimension, go trough each one and set its value\n        var range = index.dimension(0);\n        range.forEach(function (dataIndex, subIndex) {\n          (0, _array.validateIndex)(dataIndex);\n          matrix.set([dataIndex, 0], submatrix[subIndex[0]], defaultValue);\n        });\n      } else {\n        // if the replacement index has 2 dimensions, go through each one and set the value in the correct index\n        var firstDimensionRange = index.dimension(0);\n        var secondDimensionRange = index.dimension(1);\n        firstDimensionRange.forEach(function (firstDataIndex, firstSubIndex) {\n          (0, _array.validateIndex)(firstDataIndex);\n          secondDimensionRange.forEach(function (secondDataIndex, secondSubIndex) {\n            (0, _array.validateIndex)(secondDataIndex);\n            matrix.set([firstDataIndex, secondDataIndex], submatrix[firstSubIndex[0]][secondSubIndex[0]], defaultValue);\n          });\n        });\n      }\n    }\n    return matrix;\n  }\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  SparseMatrix.prototype.get = function (index) {\n    if (!(0, _is.isArray)(index)) {\n      throw new TypeError('Array expected');\n    }\n    if (index.length !== this._size.length) {\n      throw new _DimensionError.DimensionError(index.length, this._size.length);\n    }\n\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke get on a Pattern only matrix');\n    }\n\n    // row and column\n    var i = index[0];\n    var j = index[1];\n\n    // check i, j are valid\n    (0, _array.validateIndex)(i, this._size[0]);\n    (0, _array.validateIndex)(j, this._size[1]);\n\n    // find value index\n    var k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index);\n    // check k is prior to next column k and it is in the correct row\n    if (k < this._ptr[j + 1] && this._index[k] === i) {\n      return this._values[k];\n    }\n    return 0;\n  };\n\n  /**\n   * Replace a single element in the matrix.\n   * @memberof SparseMatrix\n   * @param {number[]} index   Zero-based index\n   * @param {*} v\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  SparseMatrix.prototype.set = function (index, v, defaultValue) {\n    if (!(0, _is.isArray)(index)) {\n      throw new TypeError('Array expected');\n    }\n    if (index.length !== this._size.length) {\n      throw new _DimensionError.DimensionError(index.length, this._size.length);\n    }\n\n    // check it is a pattern matrix\n    if (!this._values) {\n      throw new Error('Cannot invoke set on a Pattern only matrix');\n    }\n\n    // row and column\n    var i = index[0];\n    var j = index[1];\n\n    // rows & columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if ((0, _is.isString)(this._datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [this._datatype, this._datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, this._datatype);\n    }\n\n    // check we need to resize matrix\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);\n      // update rows & columns\n      rows = this._size[0];\n      columns = this._size[1];\n    }\n\n    // check i, j are valid\n    (0, _array.validateIndex)(i, rows);\n    (0, _array.validateIndex)(j, columns);\n\n    // find value index\n    var k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index);\n    // check k is prior to next column k and it is in the correct row\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      if (!eq(v, zero)) {\n        // insert value @ (i, j)\n        _insert(k, i, j, v, this._values, this._index, this._ptr);\n      }\n    }\n    return this;\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    }\n    // loop rows [top, bottom[\n    for (var r = top; r < bottom; r++) {\n      // check we found value index\n      if (index[r] === i) {\n        return r;\n      }\n    }\n    // we did not find row\n    return top;\n  }\n  function _remove(k, j, values, index, ptr) {\n    // remove value @ k\n    values.splice(k, 1);\n    index.splice(k, 1);\n    // update pointers\n    for (var x = j + 1; x < ptr.length; x++) {\n      ptr[x]--;\n    }\n  }\n  function _insert(k, i, j, v, values, index, ptr) {\n    // insert value\n    values.splice(k, 0, v);\n    // update row for k\n    index.splice(k, 0, i);\n    // update column pointers\n    for (var x = j + 1; x < ptr.length; x++) {\n      ptr[x]++;\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 SparseMatrix\n   * @param {number[] | Matrix} size  The new size the matrix should have.\n   *                                  Since sparse matrices are always two-dimensional,\n   *                                  size must be two numbers in either an array or a matrix\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  SparseMatrix.prototype.resize = function (size, defaultValue, copy) {\n    // validate arguments\n    if (!(0, _is.isCollection)(size)) {\n      throw new TypeError('Array or Matrix expected');\n    }\n\n    // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector\n    var sizeArray = size.valueOf().map(function (value) {\n      return Array.isArray(value) && value.length === 1 ? value[0] : value;\n    });\n    if (sizeArray.length !== 2) {\n      throw new Error('Only two dimensions matrix are supported');\n    }\n\n    // check sizes\n    sizeArray.forEach(function (value) {\n      if (!(0, _is.isNumber)(value) || !(0, _number.isInteger)(value) || value < 0) {\n        throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + (0, _string.format)(sizeArray) + ')');\n      }\n    });\n\n    // matrix to resize\n    var m = copy ? this.clone() : this;\n    // resize matrix\n    return _resize(m, sizeArray[0], sizeArray[1], defaultValue);\n  };\n  function _resize(matrix, rows, columns, defaultValue) {\n    // value to insert at the time of growing matrix\n    var value = defaultValue || 0;\n\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if ((0, _is.isString)(matrix._datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, matrix._datatype);\n      // convert value to the same datatype\n      value = typed.convert(value, matrix._datatype);\n    }\n\n    // should we insert the value?\n    var ins = !eq(value, zero);\n\n    // old columns and rows\n    var r = matrix._size[0];\n    var c = matrix._size[1];\n    var i, j, k;\n\n    // check we need to increase columns\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;\n        // check we need to insert matrix._values\n        if (ins) {\n          // loop rows\n          for (i = 0; i < r; i++) {\n            // add new matrix._values\n            matrix._values.push(value);\n            // update matrix._index\n            matrix._index.push(i);\n          }\n        }\n      }\n      // store number of matrix._values in matrix._ptr\n      matrix._ptr[columns] = matrix._values.length;\n    } else if (columns < c) {\n      // truncate matrix._ptr\n      matrix._ptr.splice(columns + 1, c - columns);\n      // truncate matrix._values and matrix._index\n      matrix._values.splice(matrix._ptr[columns], matrix._values.length);\n      matrix._index.splice(matrix._ptr[columns], matrix._index.length);\n    }\n    // update columns\n    c = columns;\n\n    // check we need to increase rows\n    if (rows > r) {\n      // check we have to insert values\n      if (ins) {\n        // inserts\n        var n = 0;\n        // loop columns\n        for (j = 0; j < c; j++) {\n          // update matrix._ptr for current column\n          matrix._ptr[j] = matrix._ptr[j] + n;\n          // where to insert matrix._values\n          k = matrix._ptr[j + 1] + n;\n          // pointer\n          var p = 0;\n          // loop new rows, initialize pointer\n          for (i = r; i < rows; i++, p++) {\n            // add value\n            matrix._values.splice(k + p, 0, value);\n            // update matrix._index\n            matrix._index.splice(k + p, 0, i);\n            // increment inserts\n            n++;\n          }\n        }\n        // store number of matrix._values in matrix._ptr\n        matrix._ptr[c] = matrix._values.length;\n      }\n    } else if (rows < r) {\n      // deletes\n      var d = 0;\n      // loop columns\n      for (j = 0; j < c; j++) {\n        // update matrix._ptr for current column\n        matrix._ptr[j] = matrix._ptr[j] - d;\n        // where matrix._values start for next column\n        var k0 = matrix._ptr[j];\n        var k1 = matrix._ptr[j + 1] - d;\n        // loop matrix._index\n        for (k = k0; k < k1; k++) {\n          // row\n          i = matrix._index[k];\n          // check we need to delete value and matrix._index\n          if (i > rows - 1) {\n            // remove value\n            matrix._values.splice(k, 1);\n            // remove item from matrix._index\n            matrix._index.splice(k, 1);\n            // increase deletes\n            d++;\n          }\n        }\n      }\n      // update matrix._ptr for current column\n      matrix._ptr[j] = matrix._values.length;\n    }\n    // update matrix._size\n    matrix._size[0] = rows;\n    matrix._size[1] = columns;\n    // return matrix\n    return matrix;\n  }\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[]} sizes          The new size the matrix should have.\n   *                                  Since sparse matrices are always two-dimensional,\n   *                                  size must be two numbers in either an array or a matrix\n   * @param {boolean} [copy]          Return a reshaped copy of the matrix\n   *\n   * @return {Matrix}                 The reshaped matrix\n   */\n  SparseMatrix.prototype.reshape = function (sizes, copy) {\n    // validate arguments\n    if (!(0, _is.isArray)(sizes)) {\n      throw new TypeError('Array expected');\n    }\n    if (sizes.length !== 2) {\n      throw new Error('Sparse matrices can only be reshaped in two dimensions');\n    }\n\n    // check sizes\n    sizes.forEach(function (value) {\n      if (!(0, _is.isNumber)(value) || !(0, _number.isInteger)(value) || value <= -2 || value === 0) {\n        throw new TypeError('Invalid size, must contain positive integers or -1 ' + '(size: ' + (0, _string.format)(sizes) + ')');\n      }\n    });\n    var currentLength = this._size[0] * this._size[1];\n    sizes = (0, _array.processSizesWildcard)(sizes, currentLength);\n    var newLength = sizes[0] * sizes[1];\n\n    // m * n must not change\n    if (currentLength !== newLength) {\n      throw new Error('Reshaping sparse matrix will result in the wrong number of elements');\n    }\n\n    // matrix to reshape\n    var m = copy ? this.clone() : this;\n\n    // return unchanged if the same shape\n    if (this._size[0] === sizes[0] && this._size[1] === sizes[1]) {\n      return m;\n    }\n\n    // Convert to COO format (generate a column index)\n    var colIndex = [];\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    }\n\n    // Clone the values array\n    var values = m._values.slice();\n\n    // Clone the row index array\n    var rowIndex = m._index.slice();\n\n    // Transform the (row, column) indices\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 % sizes[1];\n      rowIndex[_i] = Math.floor(flat / sizes[1]);\n    }\n\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\n    // OR, we could easily just:\n\n    // 1. Remove all values from the matrix\n    m._values.length = 0;\n    m._index.length = 0;\n    m._ptr.length = sizes[1] + 1;\n    m._size = sizes.slice();\n    for (var _i2 = 0; _i2 < m._ptr.length; _i2++) {\n      m._ptr[_i2] = 0;\n    }\n\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    for (var h = 0; h < values.length; h++) {\n      var _i3 = rowIndex[h];\n      var _j = colIndex[h];\n      var v = values[h];\n      var k = _getValueIndex(_i3, m._ptr[_j], m._ptr[_j + 1], m._index);\n      _insert(k, _i3, _j, v, m._values, m._index, m._ptr);\n    }\n\n    // The value indices are inserted out of order, but apparently that's... still OK?\n\n    return m;\n  };\n\n  /**\n   * Create a clone of the matrix\n   * @memberof SparseMatrix\n   * @return {SparseMatrix} clone\n   */\n  SparseMatrix.prototype.clone = function () {\n    var m = new SparseMatrix({\n      values: this._values ? (0, _object.clone)(this._values) : undefined,\n      index: (0, _object.clone)(this._index),\n      ptr: (0, _object.clone)(this._ptr),\n      size: (0, _object.clone)(this._size),\n      datatype: this._datatype\n    });\n    return m;\n  };\n\n  /**\n   * Retrieve the size of the matrix.\n   * @memberof SparseMatrix\n   * @returns {number[]} size\n   */\n  SparseMatrix.prototype.size = function () {\n    return this._size.slice(0); // copy the Array\n  };\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  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    }\n    // matrix instance\n    var me = this;\n    // rows and columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n    // invoke callback\n    var args = (0, _function.maxArgumentCount)(callback);\n    var invoke = function invoke(v, i, j) {\n      // invoke callback\n      if (args === 1) return callback(v);\n      if (args === 2) return callback(v, [i, j]);\n      return callback(v, [i, j], me);\n    };\n    // invoke _map\n    return _map(this, 0, rows - 1, 0, columns - 1, invoke, skipZeros);\n  };\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  function _map(matrix, minRow, maxRow, minColumn, maxColumn, callback, skipZeros) {\n    // result arrays\n    var values = [];\n    var index = [];\n    var ptr = [];\n\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if ((0, _is.isString)(matrix._datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, matrix._datatype);\n    }\n\n    // invoke callback\n    var invoke = function invoke(v, x, y) {\n      // invoke callback\n      v = callback(v, x, y);\n      // check value != 0\n      if (!eq(v, zero)) {\n        // store value\n        values.push(v);\n        // index\n        index.push(x);\n      }\n    };\n    // loop columns\n    for (var j = minColumn; j <= maxColumn; j++) {\n      // store pointer to values index\n      ptr.push(values.length);\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = matrix._ptr[j];\n      var k1 = matrix._ptr[j + 1];\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];\n          // check i is in range\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        for (var _k = k0; _k < k1; _k++) {\n          var _i4 = matrix._index[_k];\n          _values[_i4] = matrix._values[_k];\n        }\n\n        // loop over all rows (indexes can be unordered so we can't use that),\n        // and either read the value or zero\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    }\n\n    // store number of values in ptr\n    ptr.push(values.length);\n    // return sparse matrix\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  /**\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   *                              If false, the indices are guaranteed to be in order,\n   *                              if true, the indices can be unordered.\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    }\n    // matrix instance\n    var me = this;\n    // rows and columns\n    var rows = this._size[0];\n    var columns = this._size[1];\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 = this._ptr[j];\n      var k1 = this._ptr[j + 1];\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];\n\n          // value @ k\n          callback(this._values[k], [i, j], me);\n        }\n      } else {\n        // create a cache holding all defined values\n        var values = {};\n        for (var _k2 = k0; _k2 < k1; _k2++) {\n          var _i6 = this._index[_k2];\n          values[_i6] = this._values[_k2];\n        }\n\n        // loop over all rows (indexes can be unordered so we can't use that),\n        // and either read the value or zero\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  /**\n   * Iterate over the matrix elements, skipping zeros\n   * @return {Iterable<{ value, index: number[] }>}\n   */\n  SparseMatrix.prototype[Symbol.iterator] = /*#__PURE__*/_regenerator[\"default\"].mark(function _callee() {\n    var columns, j, k0, k1, k, i;\n    return _regenerator[\"default\"].wrap(function _callee$(_context) {\n      while (1) {\n        switch (_context.prev = _context.next) {\n          case 0:\n            if (this._values) {\n              _context.next = 2;\n              break;\n            }\n            throw new Error('Cannot iterate a Pattern only matrix');\n          case 2:\n            columns = this._size[1];\n            j = 0;\n          case 4:\n            if (!(j < columns)) {\n              _context.next = 18;\n              break;\n            }\n            k0 = this._ptr[j];\n            k1 = this._ptr[j + 1];\n            k = k0;\n          case 8:\n            if (!(k < k1)) {\n              _context.next = 15;\n              break;\n            }\n            // row index\n            i = this._index[k];\n            _context.next = 12;\n            return {\n              value: this._values[k],\n              index: [i, j]\n            };\n          case 12:\n            k++;\n            _context.next = 8;\n            break;\n          case 15:\n            j++;\n            _context.next = 4;\n            break;\n          case 18:\n          case \"end\":\n            return _context.stop();\n        }\n      }\n    }, _callee, this);\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  SparseMatrix.prototype.toArray = function () {\n    return _toArray(this._values, this._index, this._ptr, this._size, true);\n  };\n\n  /**\n   * Get the primitive value of the SparseMatrix: a two dimensions array\n   * @memberof SparseMatrix\n   * @returns {Array} array\n   */\n  SparseMatrix.prototype.valueOf = function () {\n    return _toArray(this._values, this._index, this._ptr, this._size, false);\n  };\n  function _toArray(values, index, ptr, size, copy) {\n    // rows and columns\n    var rows = size[0];\n    var columns = size[1];\n    // result\n    var a = [];\n    // vars\n    var i, j;\n    // initialize array\n    for (i = 0; i < rows; i++) {\n      a[i] = [];\n      for (j = 0; j < columns; j++) {\n        a[i][j] = 0;\n      }\n    }\n\n    // loop columns\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];\n      // loop k within [k0, k1[\n      for (var k = k0; k < k1; k++) {\n        // row index\n        i = index[k];\n        // set value (use one for pattern matrix)\n        a[i][j] = values ? copy ? (0, _object.clone)(values[k]) : values[k] : 1;\n      }\n    }\n    return a;\n  }\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  SparseMatrix.prototype.format = function (options) {\n    // rows and columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n    // density\n    var density = this.density();\n    // rows & columns\n    var str = 'Sparse Matrix [' + (0, _string.format)(rows, options) + ' x ' + (0, _string.format)(columns, options) + '] density: ' + (0, _string.format)(density, options) + '\\n';\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 = this._ptr[j];\n      var k1 = this._ptr[j + 1];\n      // loop k within [k0, k1[\n      for (var k = k0; k < k1; k++) {\n        // row index\n        var i = this._index[k];\n        // append value\n        str += '\\n    (' + (0, _string.format)(i, options) + ', ' + (0, _string.format)(j, options) + ') ==> ' + (this._values ? (0, _string.format)(this._values[k], options) : 'X');\n      }\n    }\n    return str;\n  };\n\n  /**\n   * Get a string representation of the matrix\n   * @memberof SparseMatrix\n   * @returns {string} str\n   */\n  SparseMatrix.prototype.toString = function () {\n    return (0, _string.format)(this.toArray());\n  };\n\n  /**\n   * Get a JSON representation of the matrix\n   * @memberof SparseMatrix\n   * @returns {Object}\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  /**\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  SparseMatrix.prototype.diagonal = function (k) {\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if ((0, _is.isBigNumber)(k)) {\n        k = k.toNumber();\n      }\n      // is must be an integer\n      if (!(0, _is.isNumber)(k) || !(0, _number.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    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0;\n\n    // rows & columns\n    var rows = this._size[0];\n    var columns = this._size[1];\n\n    // number diagonal values\n    var n = Math.min(rows - kSub, columns - kSuper);\n\n    // diagonal arrays\n    var values = [];\n    var index = [];\n    var ptr = [];\n    // initial ptr value\n    ptr[0] = 0;\n    // loop columns\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];\n      // loop x within [k0, k1[\n      for (var x = k0; x < k1; x++) {\n        // row index\n        var i = this._index[x];\n        // check row\n        if (i === j - kSuper + kSub) {\n          // value on this column\n          values.push(this._values[x]);\n          // store row\n          index[values.length - 1] = i - kSub;\n          // exit loop\n          break;\n        }\n      }\n    }\n    // close ptr\n    ptr.push(values.length);\n    // return matrix\n    return new SparseMatrix({\n      values: values,\n      index: index,\n      ptr: ptr,\n      size: [n, 1]\n    });\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  SparseMatrix.fromJSON = function (json) {\n    return new SparseMatrix(json);\n  };\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 {number} [defaultValue]            The default value for non-diagonal\n   * @param {string} [datatype]                The Matrix datatype, values must be of this datatype.\n   *\n   * @returns {SparseMatrix}\n   */\n  SparseMatrix.diagonal = function (size, value, k, defaultValue, datatype) {\n    if (!(0, _is.isArray)(size)) {\n      throw new TypeError('Array expected, size parameter');\n    }\n    if (size.length !== 2) {\n      throw new Error('Only two dimensions matrix are supported');\n    }\n\n    // map size & validate\n    size = size.map(function (s) {\n      // check it is a big number\n      if ((0, _is.isBigNumber)(s)) {\n        // convert it\n        s = s.toNumber();\n      }\n      // validate arguments\n      if (!(0, _is.isNumber)(s) || !(0, _number.isInteger)(s) || s < 1) {\n        throw new Error('Size values must be positive integers');\n      }\n      return s;\n    });\n\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if ((0, _is.isBigNumber)(k)) {\n        k = k.toNumber();\n      }\n      // is must be an integer\n      if (!(0, _is.isNumber)(k) || !(0, _number.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    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if ((0, _is.isString)(datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, datatype);\n    }\n    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0;\n\n    // rows and columns\n    var rows = size[0];\n    var columns = size[1];\n\n    // number of non-zero items\n    var n = Math.min(rows - kSub, columns - kSuper);\n\n    // value extraction function\n    var _value;\n\n    // check value\n    if ((0, _is.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      }\n      // define function\n      _value = function _value(i) {\n        // return value @ i\n        return value[i];\n      };\n    } else if ((0, _is.isMatrix)(value)) {\n      // matrix size\n      var ms = value.size();\n      // validate matrix\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      }\n      // define function\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    }\n\n    // create arrays\n    var values = [];\n    var index = [];\n    var ptr = [];\n\n    // loop items\n    for (var j = 0; j < columns; j++) {\n      // number of rows with value\n      ptr.push(values.length);\n      // diagonal index\n      var i = j - kSuper;\n      // check we need to set diagonal value\n      if (i >= 0 && i < n) {\n        // get value @ i\n        var v = _value(i);\n        // check for zero\n        if (!eq(v, zero)) {\n          // column\n          index.push(i + kSub);\n          // add value\n          values.push(v);\n        }\n      }\n    }\n    // last value should be number of values\n    ptr.push(values.length);\n    // create SparseMatrix\n    return new SparseMatrix({\n      values: values,\n      index: index,\n      ptr: ptr,\n      size: [rows, columns]\n    });\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  SparseMatrix.prototype.swapRows = function (i, j) {\n    // check index\n    if (!(0, _is.isNumber)(i) || !(0, _number.isInteger)(i) || !(0, _is.isNumber)(j) || !(0, _number.isInteger)(j)) {\n      throw new Error('Row index must be positive integers');\n    }\n    // check dimensions\n    if (this._size.length !== 2) {\n      throw new Error('Only two dimensional matrix is supported');\n    }\n    // validate index\n    (0, _array.validateIndex)(i, this._size[0]);\n    (0, _array.validateIndex)(j, this._size[0]);\n\n    // swap rows\n    SparseMatrix._swapRows(i, j, this._size[1], this._values, this._index, this._ptr);\n    // return current instance\n    return this;\n  };\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  SparseMatrix._forEachRow = function (j, values, index, ptr, callback) {\n    // indeces for column j\n    var k0 = ptr[j];\n    var k1 = ptr[j + 1];\n    // loop\n    for (var k = k0; k < k1; k++) {\n      // invoke callback\n      callback(index[k], values[k]);\n    }\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  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];\n      // find value index @ x\n      var kx = _getValueIndex(x, k0, k1, index);\n      // find value index @ x\n      var ky = _getValueIndex(y, k0, k1, index);\n      // check both rows exist in matrix\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        }\n        // next column\n        continue;\n      }\n      // check x row exist & no y row\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;\n        // insert value @ y\n        index.splice(ky, 0, y);\n        if (values) {\n          values.splice(ky, 0, vx);\n        }\n        // remove value @ x (adjust array index if needed)\n        index.splice(ky <= kx ? kx + 1 : kx, 1);\n        if (values) {\n          values.splice(ky <= kx ? kx + 1 : kx, 1);\n        }\n        // next column\n        continue;\n      }\n      // check y row exist & no x row\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;\n        // insert value @ x\n        index.splice(kx, 0, x);\n        if (values) {\n          values.splice(kx, 0, vy);\n        }\n        // remove value @ y (adjust array index if needed)\n        index.splice(kx <= ky ? ky + 1 : ky, 1);\n        if (values) {\n          values.splice(kx <= ky ? ky + 1 : ky, 1);\n        }\n      }\n    }\n  };\n  return SparseMatrix;\n}, {\n  isClass: true\n});\nexports.createSparseMatrixClass = createSparseMatrixClass;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createNumber = void 0;\nvar _factory = require(\"../utils/factory.js\");\nvar _collection = require(\"../utils/collection.js\");\nvar name = 'number';\nvar dependencies = ['typed'];\n\n/**\n * Separates the radix, integer part, and fractional part of a non decimal number string\n * @param {string} input string to parse\n * @returns {object} the parts of the string or null if not a valid input\n */\nfunction getNonDecimalNumberParts(input) {\n  var nonDecimalWithRadixMatch = input.match(/(0[box])([0-9a-fA-F]*)\\.([0-9a-fA-F]*)/);\n  if (nonDecimalWithRadixMatch) {\n    var radix = {\n      '0b': 2,\n      '0o': 8,\n      '0x': 16\n    }[nonDecimalWithRadixMatch[1]];\n    var integerPart = nonDecimalWithRadixMatch[2];\n    var fractionalPart = nonDecimalWithRadixMatch[3];\n    return {\n      input: input,\n      radix: radix,\n      integerPart: integerPart,\n      fractionalPart: fractionalPart\n    };\n  } else {\n    return null;\n  }\n}\n\n/**\n * Makes a number from a radix, and integer part, and a fractional part\n * @param {parts} [x] parts of the number string (from getNonDecimalNumberParts)\n * @returns {number} the number\n */\nfunction makeNumberFromNonDecimalParts(parts) {\n  var n = parseInt(parts.integerPart, parts.radix);\n  var f = 0;\n  for (var i = 0; i < parts.fractionalPart.length; i++) {\n    var digitValue = parseInt(parts.fractionalPart[i], parts.radix);\n    f += digitValue / Math.pow(parts.radix, i + 1);\n  }\n  var result = n + f;\n  if (isNaN(result)) {\n    throw new SyntaxError('String \"' + parts.input + '\" is no valid number');\n  }\n  return result;\n}\nvar createNumber = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.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 nonDecimalNumberParts = getNonDecimalNumberParts(x);\n      if (nonDecimalNumberParts) {\n        return makeNumberFromNonDecimalParts(nonDecimalNumberParts);\n      }\n      var size = 0;\n      var wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);\n      if (wordSizeSuffixMatch) {\n        // x includes a size suffix like 0xffffi32, so we extract\n        // the suffix and remove it from x\n        size = Number(wordSizeSuffixMatch[2]);\n        x = wordSizeSuffixMatch[1];\n      }\n      var num = Number(x);\n      if (isNaN(num)) {\n        throw new SyntaxError('String \"' + x + '\" is no valid number');\n      }\n      if (wordSizeSuffixMatch) {\n        // x is a signed bin, oct, or hex literal\n        // num is the value of string x if x is interpreted as unsigned\n        if (num > Math.pow(2, size) - 1) {\n          // literal is too large for size suffix\n          throw new SyntaxError(\"String \\\"\".concat(x, \"\\\" is out of range\"));\n        }\n        // check if the bit at index size - 1 is set and if so do the twos complement\n        if (num >= Math.pow(2, size - 1)) {\n          num = num - Math.pow(2, size);\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': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self);\n      };\n    })\n  });\n\n  // reviver function to parse a JSON object like:\n  //\n  //     {\"mathjs\":\"number\",\"value\":\"2.3\"}\n  //\n  // into a number 2.3\n  number.fromJSON = function (json) {\n    return parseFloat(json.value);\n  };\n  return number;\n});\nexports.createNumber = createNumber;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createString = void 0;\nvar _factory = require(\"../utils/factory.js\");\nvar _collection = require(\"../utils/collection.js\");\nvar _number = require(\"../utils/number.js\");\nvar name = 'string';\nvar dependencies = ['typed'];\nvar createString = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.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  return typed(name, {\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': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self);\n      };\n    }),\n    any: function any(x) {\n      return String(x);\n    }\n  });\n});\nexports.createString = createString;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createBoolean = void 0;\nvar _factory = require(\"../utils/factory.js\");\nvar _collection = require(\"../utils/collection.js\");\nvar name = 'boolean';\nvar dependencies = ['typed'];\nvar createBoolean = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.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  return typed(name, {\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      if (lcase === 'true') {\n        return true;\n      } else if (lcase === 'false') {\n        return false;\n      }\n\n      // test whether value is a valid number\n      var num = Number(x);\n      if (x !== '' && !isNaN(num)) {\n        return !!num;\n      }\n      throw new Error('Cannot convert \"' + x + '\" to a boolean');\n    },\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self);\n      };\n    })\n  });\n});\nexports.createBoolean = createBoolean;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createBignumber = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar _collection = require(\"../../../utils/collection.js\");\nvar name = 'bignumber';\nvar dependencies = ['typed', 'BigNumber'];\nvar createBignumber = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    BigNumber = _ref.BigNumber;\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  return typed('bignumber', {\n    '': function _() {\n      return new BigNumber(0);\n    },\n    number: function number(x) {\n      // convert to string to prevent errors in case of >15 digits\n      return new BigNumber(x + '');\n    },\n    string: function string(x) {\n      var wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);\n      if (wordSizeSuffixMatch) {\n        // x has a word size suffix\n        var size = wordSizeSuffixMatch[2];\n        var n = BigNumber(wordSizeSuffixMatch[1]);\n        var twoPowSize = new BigNumber(2).pow(Number(size));\n        if (n.gt(twoPowSize.sub(1))) {\n          throw new SyntaxError(\"String \\\"\".concat(x, \"\\\" is out of range\"));\n        }\n        var twoPowSizeSubOne = new BigNumber(2).pow(Number(size) - 1);\n        if (n.gte(twoPowSizeSubOne)) {\n          return n.sub(twoPowSize);\n        } else {\n          return n;\n        }\n      }\n      return new 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 BigNumber(x.n).div(x.d).times(x.s);\n    },\n    \"null\": function _null(x) {\n      return new BigNumber(0);\n    },\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self);\n      };\n    })\n  });\n});\nexports.createBignumber = createBignumber;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createComplex = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar _collection = require(\"../../../utils/collection.js\");\nvar name = 'complex';\nvar dependencies = ['typed', 'Complex'];\nvar createComplex = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    Complex = _ref.Complex;\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  return typed('complex', {\n    '': function _() {\n      return Complex.ZERO;\n    },\n    number: function number(x) {\n      return new Complex(x, 0);\n    },\n    'number, number': function numberNumber(re, im) {\n      return new Complex(re, im);\n    },\n    // TODO: this signature should be redundant\n    'BigNumber, BigNumber': function BigNumberBigNumber(re, im) {\n      return new Complex(re.toNumber(), im.toNumber());\n    },\n    Fraction: function Fraction(x) {\n      return new Complex(x.valueOf(), 0);\n    },\n    Complex: function Complex(x) {\n      return x.clone();\n    },\n    string: function string(x) {\n      return Complex(x); // for example '2 + 3i'\n    },\n\n    \"null\": function _null(x) {\n      return Complex(0);\n    },\n    Object: function Object(x) {\n      if ('re' in x && 'im' in x) {\n        return new Complex(x.re, x.im);\n      }\n      if ('r' in x && 'phi' in x || 'abs' in x && 'arg' in x) {\n        return new Complex(x);\n      }\n      throw new Error('Expected object with properties (re and im) or (r and phi) or (abs and arg)');\n    },\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self);\n      };\n    })\n  });\n});\nexports.createComplex = createComplex;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createFraction = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar _collection = require(\"../../../utils/collection.js\");\nvar name = 'fraction';\nvar dependencies = ['typed', 'Fraction'];\nvar createFraction = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    Fraction = _ref.Fraction;\n  /**\n   * Create a fraction or convert a value to a fraction.\n   *\n   * With one numeric argument, produces the closest rational approximation to the\n   * input.\n   * With two arguments, the first is the numerator and the second is the denominator,\n   * and creates the corresponding fraction. Both numerator and denominator must be\n   * integers.\n   * With one object argument, looks for the integer numerator as the value of property\n   * 'n' and the integer denominator as the value of property 'd'.\n   * With a matrix argument, creates a matrix of the same shape with entries\n   * converted into fractions.\n   *\n   * Syntax:\n   *     math.fraction(value)\n   *     math.fraction(numerator, denominator)\n   *     math.fraction({n: numerator, d: denominator})\n   *     math.fraction(matrix: Array | Matrix)\n   *\n   * Examples:\n   *\n   *     math.fraction(6.283)             // returns Fraction 6283/1000\n   *     math.fraction(1, 3)              // returns Fraction 1/3\n   *     math.fraction('2/3')             // returns Fraction 2/3\n   *     math.fraction({n: 2, d: 3})      // returns Fraction 2/3\n   *     math.fraction([0.2, 0.25, 1.25]) // returns Array [1/5, 1/4, 5/4]\n   *     math.fraction(4, 5.1)            // throws Error: Parameters must be integer\n   *\n   * See also:\n   *\n   *    bignumber, number, string, unit\n   *\n   * @param {number | string | Fraction | BigNumber | Array | Matrix} [args]\n   *            Arguments specifying the value, or numerator and denominator of\n   *            the fraction\n   * @return {Fraction | Array | Matrix} Returns a fraction\n   */\n  return 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      return new Fraction(x);\n    },\n    string: function string(x) {\n      return new Fraction(x);\n    },\n    'number, number': function numberNumber(numerator, denominator) {\n      return new Fraction(numerator, denominator);\n    },\n    \"null\": function _null(x) {\n      return new Fraction(0);\n    },\n    BigNumber: function BigNumber(x) {\n      return new Fraction(x.toString());\n    },\n    Fraction: function Fraction(x) {\n      return x; // fractions are immutable\n    },\n\n    Object: function Object(x) {\n      return new Fraction(x);\n    },\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self);\n      };\n    })\n  });\n});\nexports.createFraction = createFraction;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMatrix = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar name = 'matrix';\nvar dependencies = ['typed', 'Matrix', 'DenseMatrix', 'SparseMatrix'];\nvar createMatrix = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    Matrix = _ref.Matrix,\n    DenseMatrix = _ref.DenseMatrix,\n    SparseMatrix = _ref.SparseMatrix;\n  /**\n   * Create a Matrix. The function creates a new `math.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, either `'dense'` or `'sparse'`\n   * @param {string} [datatype]        Type of the values\n   *\n   * @return {Matrix} The created matrix\n   */\n  return typed(name, {\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\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  function _create(data, format, datatype) {\n    // get storage format constructor\n    if (format === 'dense' || format === 'default' || format === undefined) {\n      return new DenseMatrix(data, datatype);\n    }\n    if (format === 'sparse') {\n      return new SparseMatrix(data, datatype);\n    }\n    throw new TypeError('Unknown matrix type ' + JSON.stringify(format) + '.');\n  }\n});\nexports.createMatrix = createMatrix;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMatrixFromFunction = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'matrixFromFunction';\nvar dependencies = ['typed', 'matrix', 'isZero'];\nvar createMatrixFromFunction = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    isZero = _ref.isZero;\n  /**\n   * Create a matrix by evaluating a generating function at each index.\n   * The simplest overload returns a multi-dimensional array as long as `size` is an array.\n   * Passing `size` as a Matrix or specifying a `format` will result in returning a Matrix.\n   *\n   * Syntax:\n   *\n   *    math.matrixFromFunction(size, fn)\n   *    math.matrixFromFunction(size, fn, format)\n   *    math.matrixFromFunction(size, fn, format, datatype)\n   *    math.matrixFromFunction(size, format, fn)\n   *    math.matrixFromFunction(size, format, datatype, fn)\n   *\n   * Examples:\n   *\n   *    math.matrixFromFunction([3,3], i => i[0] - i[1]) // an antisymmetric matrix\n   *    math.matrixFromFunction([100, 100], 'sparse', i => i[0] - i[1] === 1 ? 4 : 0) // a sparse subdiagonal matrix\n   *    math.matrixFromFunction([5], i => math.random()) // a random vector\n   *\n   * See also:\n   *\n   *    matrix, zeros\n   *\n   * @param {Array | Matrix} size   The size of the matrix to be created\n   * @param {function} fn           Callback function invoked for every entry in the matrix\n   * @param {string} [format]       The Matrix storage format, either `'dense'` or `'sparse'`\n   * @param {string} [datatype]     Type of the values\n   * @return {Array | Matrix} Returns the created matrix\n   */\n  return typed(name, {\n    'Array | Matrix, function, string, string': function ArrayMatrixFunctionStringString(size, fn, format, datatype) {\n      return _create(size, fn, format, datatype);\n    },\n    'Array | Matrix, function, string': function ArrayMatrixFunctionString(size, fn, format) {\n      return _create(size, fn, format);\n    },\n    'Matrix, function': function MatrixFunction(size, fn) {\n      return _create(size, fn, 'dense');\n    },\n    'Array, function': function ArrayFunction(size, fn) {\n      return _create(size, fn, 'dense').toArray();\n    },\n    'Array | Matrix, string, function': function ArrayMatrixStringFunction(size, format, fn) {\n      return _create(size, fn, format);\n    },\n    'Array | Matrix, string, string, function': function ArrayMatrixStringStringFunction(size, format, datatype, fn) {\n      return _create(size, fn, format, datatype);\n    }\n  });\n  function _create(size, fn, format, datatype) {\n    var m;\n    if (datatype !== undefined) {\n      m = matrix(format, datatype);\n    } else {\n      m = matrix(format);\n    }\n    m.resize(size);\n    m.forEach(function (_, index) {\n      var val = fn(index);\n      if (isZero(val)) return;\n      m.set(index, val);\n    });\n    return m;\n  }\n});\nexports.createMatrixFromFunction = createMatrixFromFunction;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMatrixFromRows = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nfunction _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it[\"return\"] != null) it[\"return\"](); } finally { if (didErr) throw err; } } }; }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }\nvar name = 'matrixFromRows';\nvar dependencies = ['typed', 'matrix', 'flatten', 'size'];\nvar createMatrixFromRows = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    flatten = _ref.flatten,\n    size = _ref.size;\n  /**\n   * Create a dense matrix from vectors as individual rows.\n   * If you pass column vectors, they will be transposed (but not conjugated!)\n   *\n   * Syntax:\n   *\n   *    math.matrixFromRows(...arr)\n   *    math.matrixFromRows(row1, row2)\n   *    math.matrixFromRows(row1, row2, row3)\n   *\n   * Examples:\n   *\n   *    math.matrixFromRows([1, 2, 3], [[4],[5],[6]])\n   *    math.matrixFromRows(...vectors)\n   *\n   * See also:\n   *\n   *    matrix, matrixFromColumns, matrixFromFunction, zeros\n   *\n   * @param {... Array | Matrix} rows  Multiple rows\n   * @return { number[][] | Matrix } if at least one of the arguments is an array, an array will be returned\n   */\n  return typed(name, {\n    '...Array': function Array(arr) {\n      return _createArray(arr);\n    },\n    '...Matrix': function Matrix(arr) {\n      return matrix(_createArray(arr.map(function (m) {\n        return m.toArray();\n      })));\n    }\n\n    // TODO implement this properly for SparseMatrix\n  });\n\n  function _createArray(arr) {\n    if (arr.length === 0) throw new TypeError('At least one row is needed to construct a matrix.');\n    var N = checkVectorTypeAndReturnLength(arr[0]);\n    var result = [];\n    var _iterator = _createForOfIteratorHelper(arr),\n      _step;\n    try {\n      for (_iterator.s(); !(_step = _iterator.n()).done;) {\n        var row = _step.value;\n        var rowLength = checkVectorTypeAndReturnLength(row);\n        if (rowLength !== N) {\n          throw new TypeError('The vectors had different length: ' + (N | 0) + ' ≠ ' + (rowLength | 0));\n        }\n        result.push(flatten(row));\n      }\n    } catch (err) {\n      _iterator.e(err);\n    } finally {\n      _iterator.f();\n    }\n    return result;\n  }\n  function checkVectorTypeAndReturnLength(vec) {\n    var s = size(vec);\n    if (s.length === 1) {\n      // 1D vector\n      return s[0];\n    } else if (s.length === 2) {\n      // 2D vector\n      if (s[0] === 1) {\n        // row vector\n        return s[1];\n      } else if (s[1] === 1) {\n        // col vector\n        return s[0];\n      } else {\n        throw new TypeError('At least one of the arguments is not a vector.');\n      }\n    } else {\n      throw new TypeError('Only one- or two-dimensional vectors are supported.');\n    }\n  }\n});\nexports.createMatrixFromRows = createMatrixFromRows;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMatrixFromColumns = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nfunction _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it[\"return\"] != null) it[\"return\"](); } finally { if (didErr) throw err; } } }; }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }\nvar name = 'matrixFromColumns';\nvar dependencies = ['typed', 'matrix', 'flatten', 'size'];\nvar createMatrixFromColumns = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    flatten = _ref.flatten,\n    size = _ref.size;\n  /**\n   * Create a dense matrix from vectors as individual columns.\n   * If you pass row vectors, they will be transposed (but not conjugated!)\n   *\n   * Syntax:\n   *\n   *    math.matrixFromColumns(...arr)\n   *    math.matrixFromColumns(col1, col2)\n   *    math.matrixFromColumns(col1, col2, col3)\n   *\n   * Examples:\n   *\n   *    math.matrixFromColumns([1, 2, 3], [[4],[5],[6]])\n   *    math.matrixFromColumns(...vectors)\n   *\n   * See also:\n   *\n   *    matrix, matrixFromRows, matrixFromFunction, zeros\n   *\n   * @param {... Array | Matrix} cols Multiple columns\n   * @return { number[][] | Matrix } if at least one of the arguments is an array, an array will be returned\n   */\n  return typed(name, {\n    '...Array': function Array(arr) {\n      return _createArray(arr);\n    },\n    '...Matrix': function Matrix(arr) {\n      return matrix(_createArray(arr.map(function (m) {\n        return m.toArray();\n      })));\n    }\n\n    // TODO implement this properly for SparseMatrix\n  });\n\n  function _createArray(arr) {\n    if (arr.length === 0) throw new TypeError('At least one column is needed to construct a matrix.');\n    var N = checkVectorTypeAndReturnLength(arr[0]);\n\n    // create an array with empty rows\n    var result = [];\n    for (var i = 0; i < N; i++) {\n      result[i] = [];\n    }\n\n    // loop columns\n    var _iterator = _createForOfIteratorHelper(arr),\n      _step;\n    try {\n      for (_iterator.s(); !(_step = _iterator.n()).done;) {\n        var col = _step.value;\n        var colLength = checkVectorTypeAndReturnLength(col);\n        if (colLength !== N) {\n          throw new TypeError('The vectors had different length: ' + (N | 0) + ' ≠ ' + (colLength | 0));\n        }\n        var f = flatten(col);\n\n        // push a value to each row\n        for (var _i = 0; _i < N; _i++) {\n          result[_i].push(f[_i]);\n        }\n      }\n    } catch (err) {\n      _iterator.e(err);\n    } finally {\n      _iterator.f();\n    }\n    return result;\n  }\n  function checkVectorTypeAndReturnLength(vec) {\n    var s = size(vec);\n    if (s.length === 1) {\n      // 1D vector\n      return s[0];\n    } else if (s.length === 2) {\n      // 2D vector\n      if (s[0] === 1) {\n        // row vector\n        return s[1];\n      } else if (s[1] === 1) {\n        // col vector\n        return s[0];\n      } else {\n        throw new TypeError('At least one of the arguments is not a vector.');\n      }\n    } else {\n      throw new TypeError('Only one- or two-dimensional vectors are supported.');\n    }\n  }\n});\nexports.createMatrixFromColumns = createMatrixFromColumns;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSplitUnit = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar name = 'splitUnit';\nvar dependencies = ['typed'];\nvar createSplitUnit = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.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  return typed(name, {\n    'Unit, Array': function UnitArray(unit, parts) {\n      return unit.splitUnit(parts);\n    }\n  });\n});\nexports.createSplitUnit = createSplitUnit;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createUnaryMinus = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _collection = require(\"../../utils/collection.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'unaryMinus';\nvar dependencies = ['typed'];\nvar createUnaryMinus = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\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  return typed(name, {\n    number: _index.unaryMinusNumber,\n    'Complex | BigNumber | Fraction': function ComplexBigNumberFraction(x) {\n      return x.neg();\n    },\n    Unit: typed.referToSelf(function (self) {\n      return function (x) {\n        var res = x.clone();\n        res.value = typed.find(self, res.valueType())(x.value);\n        return res;\n      };\n    }),\n    // deep map collection, skip zeros since unaryMinus(0) = 0\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self, true);\n      };\n    })\n\n    // TODO: add support for string\n  });\n});\nexports.createUnaryMinus = createUnaryMinus;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createUnaryPlus = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _collection = require(\"../../utils/collection.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'unaryPlus';\nvar dependencies = ['typed', 'config', 'BigNumber'];\nvar createUnaryPlus = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    BigNumber = _ref.BigNumber;\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  return typed(name, {\n    number: _index.unaryPlusNumber,\n    Complex: function Complex(x) {\n      return x; // complex numbers are immutable\n    },\n\n    BigNumber: function BigNumber(x) {\n      return x; // bignumbers are immutable\n    },\n\n    Fraction: function Fraction(x) {\n      return x; // fractions are immutable\n    },\n\n    Unit: function Unit(x) {\n      return x.clone();\n    },\n    // deep map collection, skip zeros since unaryPlus(0) = 0\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self, true);\n      };\n    }),\n    'boolean | string': function booleanString(x) {\n      // convert to a number or bignumber\n      return config.number === 'BigNumber' ? new BigNumber(+x) : +x;\n    }\n  });\n});\nexports.createUnaryPlus = createUnaryPlus;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createAbs = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _collection = require(\"../../utils/collection.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'abs';\nvar dependencies = ['typed'];\nvar createAbs = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.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  return typed(name, {\n    number: _index.absNumber,\n    'Complex | BigNumber | Fraction | Unit': function ComplexBigNumberFractionUnit(x) {\n      return x.abs();\n    },\n    // deep map collection, skip zeros since abs(0) = 0\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self, true);\n      };\n    })\n  });\n});\nexports.createAbs = createAbs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createApply = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _is = require(\"../../utils/is.js\");\nvar _IndexError = require(\"../../error/IndexError.js\");\nvar name = 'apply';\nvar dependencies = ['typed', 'isInteger'];\nvar createApply = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    isInteger = _ref.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  return typed(name, {\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      var size = Array.isArray(mat) ? (0, _array.arraySize)(mat) : mat.size();\n      if (dim < 0 || dim >= size.length) {\n        throw new _IndexError.IndexError(dim, size.length);\n      }\n      if ((0, _is.isMatrix)(mat)) {\n        return mat.create(_apply(mat.valueOf(), dim, callback));\n      } else {\n        return _apply(mat, dim, callback);\n      }\n    }\n  });\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 */\nexports.createApply = createApply;\nfunction _apply(mat, dim, callback) {\n  var i, ret, tran;\n  if (dim <= 0) {\n    if (!Array.isArray(mat[0])) {\n      return callback(mat);\n    } else {\n      tran = _switch(mat);\n      ret = [];\n      for (i = 0; i < tran.length; i++) {\n        ret[i] = _apply(tran[i], dim - 1, callback);\n      }\n      return ret;\n    }\n  } else {\n    ret = [];\n    for (i = 0; i < mat.length; i++) {\n      ret[i] = _apply(mat[i], dim - 1, callback);\n    }\n    return ret;\n  }\n}\n\n/**\n * Transpose a matrix\n * @param {Array} mat\n * @returns {Array} ret\n * @private\n */\nfunction _switch(mat) {\n  var I = mat.length;\n  var J = mat[0].length;\n  var i, j;\n  var ret = [];\n  for (j = 0; j < J; j++) {\n    var tmp = [];\n    for (i = 0; i < I; i++) {\n      tmp.push(mat[i][j]);\n    }\n    ret.push(tmp);\n  }\n  return ret;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createAddScalar = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'addScalar';\nvar dependencies = ['typed'];\nvar createAddScalar = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.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).\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  return typed(name, {\n    'number, number': _index.addNumber,\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': typed.referToSelf(function (self) {\n      return function (x, y) {\n        if (x.value === null || x.value === undefined) {\n          throw new Error('Parameter x contains a unit with undefined value');\n        }\n        if (y.value === null || y.value === undefined) {\n          throw new Error('Parameter y contains a unit with undefined value');\n        }\n        if (!x.equalBase(y)) throw new Error('Units do not match');\n        var res = x.clone();\n        res.value = typed.find(self, [res.valueType(), y.valueType()])(res.value, y.value);\n        res.fixPrefix = false;\n        return res;\n      };\n    })\n  });\n});\nexports.createAddScalar = createAddScalar;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCbrt = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _is = require(\"../../utils/is.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'cbrt';\nvar dependencies = ['config', 'typed', 'isNegative', 'unaryMinus', 'matrix', 'Complex', 'BigNumber', 'Fraction'];\nvar createCbrt = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var config = _ref.config,\n    typed = _ref.typed,\n    isNegative = _ref.isNegative,\n    unaryMinus = _ref.unaryMinus,\n    matrix = _ref.matrix,\n    Complex = _ref.Complex,\n    BigNumber = _ref.BigNumber,\n    Fraction = _ref.Fraction;\n  /**\n   * Calculate the cubic root of a value.\n   *\n   * To avoid confusion with the matrix cube root, this function does not\n   * apply to matrices. For a matrix, to take the cube root elementwise,\n   * see the examples.\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.map([27, 64, 125], x => math.cbrt(x))       // 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} 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}\n   *            Returns the cubic root of `x`\n   */\n  return typed(name, {\n    number: _index.cbrtNumber,\n    // note: signature 'number, boolean' is also supported,\n    //       created by typed as it knows how to convert number to Complex\n\n    Complex: _cbrtComplex,\n    'Complex, boolean': _cbrtComplex,\n    BigNumber: function BigNumber(x) {\n      return x.cbrt();\n    },\n    Unit: _cbrtUnit\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  function _cbrtComplex(x, allRoots) {\n    // https://www.wikiwand.com/en/Cube_root#/Complex_numbers\n\n    var arg3 = x.arg() / 3;\n    var abs = x.abs();\n\n    // principal root:\n    var principal = new Complex((0, _index.cbrtNumber)(abs), 0).mul(new Complex(0, arg3).exp());\n    if (allRoots) {\n      var all = [principal, new Complex((0, _index.cbrtNumber)(abs), 0).mul(new Complex(0, arg3 + Math.PI * 2 / 3).exp()), new Complex((0, _index.cbrtNumber)(abs), 0).mul(new 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  /**\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  function _cbrtUnit(x) {\n    if (x.value && (0, _is.isComplex)(x.value)) {\n      var result = x.clone();\n      result.value = 1.0;\n      result = result.pow(1.0 / 3); // Compute the units\n      result.value = _cbrtComplex(x.value); // Compute the value\n      return result;\n    } else {\n      var negate = isNegative(x.value);\n      if (negate) {\n        x.value = unaryMinus(x.value);\n      }\n\n      // TODO: create a helper function for this\n      var third;\n      if ((0, _is.isBigNumber)(x.value)) {\n        third = new BigNumber(1).div(3);\n      } else if ((0, _is.isFraction)(x.value)) {\n        third = new Fraction(1, 3);\n      } else {\n        third = 1 / 3;\n      }\n      var _result = x.pow(third);\n      if (negate) {\n        _result.value = unaryMinus(_result.value);\n      }\n      return _result;\n    }\n  }\n});\nexports.createCbrt = createCbrt;","function _arrayWithHoles(arr) {\n  if (Array.isArray(arr)) return arr;\n}\nmodule.exports = _arrayWithHoles, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","function _iterableToArrayLimit(r, l) {\n  var t = null == r ? null : \"undefined\" != typeof Symbol && r[Symbol.iterator] || r[\"@@iterator\"];\n  if (null != t) {\n    var e,\n      n,\n      i,\n      u,\n      a = [],\n      f = !0,\n      o = !1;\n    try {\n      if (i = (t = t.call(r)).next, 0 === l) {\n        if (Object(t) !== t) return;\n        f = !1;\n      } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0);\n    } catch (r) {\n      o = !0, n = r;\n    } finally {\n      try {\n        if (!f && null != t[\"return\"] && (u = t[\"return\"](), Object(u) !== u)) return;\n      } finally {\n        if (o) throw n;\n      }\n    }\n    return a;\n  }\n}\nmodule.exports = _iterableToArrayLimit, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","function _arrayLikeToArray(arr, len) {\n  if (len == null || len > arr.length) len = arr.length;\n  for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i];\n  return arr2;\n}\nmodule.exports = _arrayLikeToArray, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","var arrayLikeToArray = require(\"./arrayLikeToArray.js\");\nfunction _unsupportedIterableToArray(o, minLen) {\n  if (!o) return;\n  if (typeof o === \"string\") return arrayLikeToArray(o, minLen);\n  var n = Object.prototype.toString.call(o).slice(8, -1);\n  if (n === \"Object\" && o.constructor) n = o.constructor.name;\n  if (n === \"Map\" || n === \"Set\") return Array.from(o);\n  if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return arrayLikeToArray(o, minLen);\n}\nmodule.exports = _unsupportedIterableToArray, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","function _nonIterableRest() {\n  throw new TypeError(\"Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}\nmodule.exports = _nonIterableRest, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","var arrayWithHoles = require(\"./arrayWithHoles.js\");\nvar iterableToArrayLimit = require(\"./iterableToArrayLimit.js\");\nvar unsupportedIterableToArray = require(\"./unsupportedIterableToArray.js\");\nvar nonIterableRest = require(\"./nonIterableRest.js\");\nfunction _slicedToArray(arr, i) {\n  return arrayWithHoles(arr) || iterableToArrayLimit(arr, i) || unsupportedIterableToArray(arr, i) || nonIterableRest();\n}\nmodule.exports = _slicedToArray, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMatAlgo11xS0s = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar name = 'matAlgo11xS0s';\nvar dependencies = ['typed', 'equalScalar'];\nvar createMatAlgo11xS0s = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    equalScalar = _ref.equalScalar;\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  return function matAlgo11xS0s(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;\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!avalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // find signature that matches (dt, dt)\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n      // convert b to the same datatype\n      b = typed.convert(b, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result arrays\n    var cvalues = [];\n    var cindex = [];\n    var cptr = [];\n\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // initialize ptr\n      cptr[j] = cindex.length;\n      // values in j\n      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var i = aindex[k];\n        // invoke callback\n        var v = inverse ? cf(b, avalues[k]) : cf(avalues[k], b);\n        // check value is zero\n        if (!eq(v, zero)) {\n          // push index & value\n          cindex.push(i);\n          cvalues.push(v);\n        }\n      }\n    }\n    // update ptr\n    cptr[columns] = cindex.length;\n\n    // return sparse matrix\n    return s.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});\nexports.createMatAlgo11xS0s = createMatAlgo11xS0s;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMatAlgo12xSfs = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar name = 'matAlgo12xSfs';\nvar dependencies = ['typed', 'DenseMatrix'];\nvar createMatAlgo12xSfs = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    DenseMatrix = _ref.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  return function matAlgo12xSfs(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;\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!avalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // convert b to the same datatype\n      b = typed.convert(b, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result arrays\n    var cdata = [];\n\n    // workspaces\n    var x = [];\n    // marks indicating we have a value in x for a given column\n    var w = [];\n\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // columns mark\n      var mark = j + 1;\n      // values in j\n      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var r = aindex[k];\n        // update workspace\n        x[r] = avalues[k];\n        w[r] = mark;\n      }\n      // loop rows\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        }\n        // check sparse matrix has a value @ i,j\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    }\n\n    // return dense matrix\n    return new DenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});\nexports.createMatAlgo12xSfs = createMatAlgo12xSfs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMatAlgo14xDs = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar _object = require(\"../../../utils/object.js\");\nvar name = 'matAlgo14xDs';\nvar dependencies = ['typed'];\nvar createMatAlgo14xDs = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\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  return function matAlgo14xDs(a, b, callback, inverse) {\n    // a arrays\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype;\n\n    // datatype\n    var dt;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // convert b to the same datatype\n      b = typed.convert(b, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // populate cdata, iterate through dimensions\n    var cdata = asize.length > 0 ? _iterate(cf, 0, asize, asize[0], adata, b, inverse) : [];\n\n    // c matrix\n    return a.createDenseMatrix({\n      data: cdata,\n      size: (0, _object.clone)(asize),\n      datatype: dt\n    });\n  };\n\n  // recursive function\n  function _iterate(f, level, s, n, av, bv, inverse) {\n    // initialize array for this level\n    var cv = [];\n    // check we reach the last level\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    return cv;\n  }\n});\nexports.createMatAlgo14xDs = createMatAlgo14xDs;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCeilNumber = exports.createCeil = void 0;\nvar _slicedToArray2 = _interopRequireDefault(require(\"@babel/runtime/helpers/slicedToArray\"));\nvar _decimal = _interopRequireDefault(require(\"decimal.js\"));\nvar _factory = require(\"../../utils/factory.js\");\nvar _collection = require(\"../../utils/collection.js\");\nvar _number = require(\"../../utils/number.js\");\nvar _nearlyEqual = require(\"../../utils/bignumber/nearlyEqual.js\");\nvar _matAlgo11xS0s = require(\"../../type/matrix/utils/matAlgo11xS0s.js\");\nvar _matAlgo12xSfs = require(\"../../type/matrix/utils/matAlgo12xSfs.js\");\nvar _matAlgo14xDs = require(\"../../type/matrix/utils/matAlgo14xDs.js\");\nvar name = 'ceil';\nvar dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];\nvar createCeilNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'config', 'round'], function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    round = _ref.round;\n  return typed(name, {\n    number: function number(x) {\n      if ((0, _number.nearlyEqual)(x, round(x), config.epsilon)) {\n        return round(x);\n      } else {\n        return Math.ceil(x);\n      }\n    },\n    'number, number': function numberNumber(x, n) {\n      if ((0, _number.nearlyEqual)(x, round(x, n), config.epsilon)) {\n        return round(x, n);\n      } else {\n        var _split = \"\".concat(x, \"e\").split('e'),\n          _split2 = (0, _slicedToArray2[\"default\"])(_split, 2),\n          number = _split2[0],\n          exponent = _split2[1];\n        var result = Math.ceil(Number(\"\".concat(number, \"e\").concat(Number(exponent) + n)));\n        var _split3 = \"\".concat(result, \"e\").split('e');\n        var _split4 = (0, _slicedToArray2[\"default\"])(_split3, 2);\n        number = _split4[0];\n        exponent = _split4[1];\n        return Number(\"\".concat(number, \"e\").concat(Number(exponent) - n));\n      }\n    }\n  });\n});\nexports.createCeilNumber = createCeilNumber;\nvar createCeil = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref2) {\n  var typed = _ref2.typed,\n    config = _ref2.config,\n    round = _ref2.round,\n    matrix = _ref2.matrix,\n    equalScalar = _ref2.equalScalar,\n    zeros = _ref2.zeros,\n    DenseMatrix = _ref2.DenseMatrix;\n  var matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({\n    typed: typed\n  });\n  var ceilNumber = createCeilNumber({\n    typed: typed,\n    config: config,\n    round: round\n  });\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   *    math.ceil(x, n)\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   *    math.ceil(3.212, 2)          // returns number 3.22\n   *    math.ceil(3.288, 2)          // returns number 3.29\n   *    math.ceil(-4.212, 2)         // returns number -4.21\n   *    math.ceil(-4.782, 2)         // returns number -4.78\n   *\n   *    const c = math.complex(3.24, -2.71)\n   *    math.ceil(c)                 // returns Complex 4 - 2i\n   *    math.ceil(c, 1)              // returns Complex 3.3 - 2.7i\n   *\n   *    math.ceil([3.2, 3.8, -4.7])  // returns Array [4, 4, -4]\n   *    math.ceil([3.21, 3.82, -4.71], 1)  // returns Array [3.3, 3.9, -4.7]\n   *\n   * See also:\n   *\n   *    floor, fix, round\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  return typed('ceil', {\n    number: ceilNumber.signatures.number,\n    'number,number': ceilNumber.signatures['number,number'],\n    Complex: function Complex(x) {\n      return x.ceil();\n    },\n    'Complex, number': function ComplexNumber(x, n) {\n      return x.ceil(n);\n    },\n    'Complex, BigNumber': function ComplexBigNumber(x, n) {\n      return x.ceil(n.toNumber());\n    },\n    BigNumber: function BigNumber(x) {\n      if ((0, _nearlyEqual.nearlyEqual)(x, round(x), config.epsilon)) {\n        return round(x);\n      } else {\n        return x.ceil();\n      }\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, n) {\n      if ((0, _nearlyEqual.nearlyEqual)(x, round(x, n), config.epsilon)) {\n        return round(x, n);\n      } else {\n        return x.toDecimalPlaces(n.toNumber(), _decimal[\"default\"].ROUND_CEIL);\n      }\n    },\n    Fraction: function Fraction(x) {\n      return x.ceil();\n    },\n    'Fraction, number': function FractionNumber(x, n) {\n      return x.ceil(n);\n    },\n    'Fraction, BigNumber': function FractionBigNumber(x, n) {\n      return x.ceil(n.toNumber());\n    },\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        // deep map collection, skip zeros since ceil(0) = 0\n        return (0, _collection.deepMap)(x, self, true);\n      };\n    }),\n    'Array, number | BigNumber': typed.referToSelf(function (self) {\n      return function (x, n) {\n        // deep map collection, skip zeros since ceil(0) = 0\n        return (0, _collection.deepMap)(x, function (i) {\n          return self(i, n);\n        }, true);\n      };\n    }),\n    'SparseMatrix, number | BigNumber': typed.referToSelf(function (self) {\n      return function (x, y) {\n        return matAlgo11xS0s(x, y, self, false);\n      };\n    }),\n    'DenseMatrix, number | BigNumber': typed.referToSelf(function (self) {\n      return function (x, y) {\n        return matAlgo14xDs(x, y, self, false);\n      };\n    }),\n    'number | Complex | Fraction | BigNumber, Array': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // use matrix implementation\n        return matAlgo14xDs(matrix(y), x, self, true).valueOf();\n      };\n    }),\n    'number | Complex | Fraction | BigNumber, Matrix': typed.referToSelf(function (self) {\n      return function (x, y) {\n        if (equalScalar(x, 0)) return zeros(y.size(), y.storage());\n        if (y.storage() === 'dense') {\n          return matAlgo14xDs(y, x, self, true);\n        }\n        return matAlgo12xSfs(y, x, self, true);\n      };\n    })\n  });\n});\nexports.createCeil = createCeil;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCube = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'cube';\nvar dependencies = ['typed'];\nvar createCube = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\n  /**\n   * Compute the cube of a value, `x * x * x`.\n   * To avoid confusion with `pow(M,3)`, this function does not apply to matrices.\n   * If you wish to cube every entry of a matrix, see the examples.\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.map([1, 2, 3, 4], math.cube) // returns Array [1, 8, 27, 64]\n   *\n   * See also:\n   *\n   *    multiply, square, pow, cbrt\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit} x  Number for which to calculate the cube\n   * @return {number | BigNumber | Fraction | Complex | Unit} Cube of x\n   */\n  return typed(name, {\n    number: _index.cubeNumber,\n    Complex: function Complex(x) {\n      return x.mul(x).mul(x); // Is faster than pow(x, 3)\n    },\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\n    Unit: function Unit(x) {\n      return x.pow(3);\n    }\n  });\n});\nexports.createCube = createCube;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createExp = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'exp';\nvar dependencies = ['typed'];\nvar createExp = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\n  /**\n   * Calculate the exponential of a value.\n   * For matrices, if you want the matrix exponential of square matrix, use\n   * the `expm` function; if you want to take the exponential of each element,\n   * see the examples.\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.map([1, 2, 3], math.exp)\n   *    // returns Array [\n   *    //   2.718281828459045,\n   *    //   7.3890560989306495,\n   *    //   20.085536923187668\n   *    // ]\n   *\n   * See also:\n   *\n   *    expm1, expm, log, pow\n   *\n   * @param {number | BigNumber | Complex} x  A number to exponentiate\n   * @return {number | BigNumber | Complex} Exponential of `x`\n   */\n  return typed(name, {\n    number: _index.expNumber,\n    Complex: function Complex(x) {\n      return x.exp();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.exp();\n    }\n  });\n});\nexports.createExp = createExp;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createExpm1 = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'expm1';\nvar dependencies = ['typed', 'Complex'];\nvar createExpm1 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    _Complex = _ref.Complex;\n  /**\n   * Calculate the value of subtracting 1 from the exponential value.\n   * This function is more accurate than `math.exp(x)-1` when `x` is near 0\n   * To avoid ambiguity with the matrix exponential `expm`, this function\n   * does not operate on matrices; if you wish to apply it elementwise, see\n   * the examples.\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.expm1(1e-8)                   // returns number 1.0000000050000001e-8\n   *    math.exp(1e-8) - 1                 // returns number 9.9999999392253e-9\n   *    math.log(math.expm1(2) + 1)        // returns number 2\n   *\n   *    math.map([1, 2, 3], math.expm1)\n   *    // returns Array [\n   *    //   1.718281828459045,\n   *    //   6.3890560989306495,\n   *    //   19.085536923187668\n   *    // ]\n   *\n   * See also:\n   *\n   *    exp, expm, log, pow\n   *\n   * @param {number | BigNumber | Complex} x  The number to exponentiate\n   * @return {number | BigNumber | Complex} Exponential of `x`, minus one\n   */\n  return typed(name, {\n    number: _index.expm1Number,\n    Complex: function Complex(x) {\n      var r = Math.exp(x.re);\n      return new _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  });\n});\nexports.createExpm1 = createExpm1;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createFixNumber = exports.createFix = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _collection = require(\"../../utils/collection.js\");\nvar _matAlgo12xSfs = require(\"../../type/matrix/utils/matAlgo12xSfs.js\");\nvar _matAlgo14xDs = require(\"../../type/matrix/utils/matAlgo14xDs.js\");\nvar name = 'fix';\nvar dependencies = ['typed', 'Complex', 'matrix', 'ceil', 'floor', 'equalScalar', 'zeros', 'DenseMatrix'];\nvar createFixNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'ceil', 'floor'], function (_ref) {\n  var typed = _ref.typed,\n    ceil = _ref.ceil,\n    floor = _ref.floor;\n  return typed(name, {\n    number: function number(x) {\n      return x > 0 ? floor(x) : ceil(x);\n    },\n    'number, number': function numberNumber(x, n) {\n      return x > 0 ? floor(x, n) : ceil(x, n);\n    }\n  });\n});\nexports.createFixNumber = createFixNumber;\nvar createFix = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref2) {\n  var typed = _ref2.typed,\n    _Complex = _ref2.Complex,\n    matrix = _ref2.matrix,\n    ceil = _ref2.ceil,\n    floor = _ref2.floor,\n    equalScalar = _ref2.equalScalar,\n    zeros = _ref2.zeros,\n    DenseMatrix = _ref2.DenseMatrix;\n  var matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({\n    typed: typed\n  });\n  var fixNumber = createFixNumber({\n    typed: typed,\n    ceil: ceil,\n    floor: floor\n  });\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   *    math.fix(x,n)\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   *    math.fix(3.12, 1)                // returns number 3.1\n   *    math.fix(3.18, 1)                // returns number 3.1\n   *    math.fix(-4.12, 1)               // returns number -4.1\n   *    math.fix(-4.17, 1)               // returns number -4.1\n   *\n   *    const c = math.complex(3.22, -2.78)\n   *    math.fix(c)                  // returns Complex 3 - 2i\n   *    math.fix(c, 1)               // returns Complex 3.2 -2.7i\n   *\n   *    math.fix([3.2, 3.8, -4.7])      // returns Array [3, 3, -4]\n   *    math.fix([3.2, 3.8, -4.7], 1)   // returns Array [3.2, 3.8, -4.7]\n   *\n   * See also:\n   *\n   *    ceil, floor, round\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  return typed('fix', {\n    number: fixNumber.signatures.number,\n    'number, number | BigNumber': fixNumber.signatures['number,number'],\n    Complex: function Complex(x) {\n      return new _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    'Complex, number': function ComplexNumber(x, n) {\n      return new _Complex(x.re > 0 ? floor(x.re, n) : ceil(x.re, n), x.im > 0 ? floor(x.im, n) : ceil(x.im, n));\n    },\n    'Complex, BigNumber': function ComplexBigNumber(x, bn) {\n      var n = bn.toNumber();\n      return new _Complex(x.re > 0 ? floor(x.re, n) : ceil(x.re, n), x.im > 0 ? floor(x.im, n) : ceil(x.im, n));\n    },\n    BigNumber: function BigNumber(x) {\n      return x.isNegative() ? ceil(x) : floor(x);\n    },\n    'BigNumber, number | BigNumber': function BigNumberNumberBigNumber(x, n) {\n      return x.isNegative() ? ceil(x, n) : floor(x, n);\n    },\n    Fraction: function Fraction(x) {\n      return x.s < 0 ? x.ceil() : x.floor();\n    },\n    'Fraction, number | BigNumber': function FractionNumberBigNumber(x, n) {\n      return x.s < 0 ? ceil(x, n) : floor(x, n);\n    },\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        // deep map collection, skip zeros since fix(0) = 0\n        return (0, _collection.deepMap)(x, self, true);\n      };\n    }),\n    'Array | Matrix, number | BigNumber': typed.referToSelf(function (self) {\n      return function (x, n) {\n        // deep map collection, skip zeros since fix(0) = 0\n        return (0, _collection.deepMap)(x, function (i) {\n          return self(i, n);\n        }, true);\n      };\n    }),\n    'number | Complex | Fraction | BigNumber, Array': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // use matrix implementation\n        return matAlgo14xDs(matrix(y), x, self, true).valueOf();\n      };\n    }),\n    'number | Complex | Fraction | BigNumber, Matrix': typed.referToSelf(function (self) {\n      return function (x, y) {\n        if (equalScalar(x, 0)) return zeros(y.size(), y.storage());\n        if (y.storage() === 'dense') {\n          return matAlgo14xDs(y, x, self, true);\n        }\n        return matAlgo12xSfs(y, x, self, true);\n      };\n    })\n  });\n});\nexports.createFix = createFix;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createFloorNumber = exports.createFloor = void 0;\nvar _slicedToArray2 = _interopRequireDefault(require(\"@babel/runtime/helpers/slicedToArray\"));\nvar _decimal = _interopRequireDefault(require(\"decimal.js\"));\nvar _factory = require(\"../../utils/factory.js\");\nvar _collection = require(\"../../utils/collection.js\");\nvar _number = require(\"../../utils/number.js\");\nvar _nearlyEqual = require(\"../../utils/bignumber/nearlyEqual.js\");\nvar _matAlgo11xS0s = require(\"../../type/matrix/utils/matAlgo11xS0s.js\");\nvar _matAlgo12xSfs = require(\"../../type/matrix/utils/matAlgo12xSfs.js\");\nvar _matAlgo14xDs = require(\"../../type/matrix/utils/matAlgo14xDs.js\");\nvar name = 'floor';\nvar dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];\nvar createFloorNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'config', 'round'], function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    round = _ref.round;\n  return typed(name, {\n    number: function number(x) {\n      if ((0, _number.nearlyEqual)(x, round(x), config.epsilon)) {\n        return round(x);\n      } else {\n        return Math.floor(x);\n      }\n    },\n    'number, number': function numberNumber(x, n) {\n      if ((0, _number.nearlyEqual)(x, round(x, n), config.epsilon)) {\n        return round(x, n);\n      } else {\n        var _split = \"\".concat(x, \"e\").split('e'),\n          _split2 = (0, _slicedToArray2[\"default\"])(_split, 2),\n          number = _split2[0],\n          exponent = _split2[1];\n        var result = Math.floor(Number(\"\".concat(number, \"e\").concat(Number(exponent) + n)));\n        var _split3 = \"\".concat(result, \"e\").split('e');\n        var _split4 = (0, _slicedToArray2[\"default\"])(_split3, 2);\n        number = _split4[0];\n        exponent = _split4[1];\n        return Number(\"\".concat(number, \"e\").concat(Number(exponent) - n));\n      }\n    }\n  });\n});\nexports.createFloorNumber = createFloorNumber;\nvar createFloor = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref2) {\n  var typed = _ref2.typed,\n    config = _ref2.config,\n    round = _ref2.round,\n    matrix = _ref2.matrix,\n    equalScalar = _ref2.equalScalar,\n    zeros = _ref2.zeros,\n    DenseMatrix = _ref2.DenseMatrix;\n  var matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({\n    typed: typed\n  });\n  var floorNumber = createFloorNumber({\n    typed: typed,\n    config: config,\n    round: round\n  });\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   *    math.floor(x, n)\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   *    math.floor(3.212, 2)          // returns number 3.21\n   *    math.floor(3.288, 2)          // returns number 3.28\n   *    math.floor(-4.212, 2)         // returns number -4.22\n   *    math.floor(-4.782, 2)         // returns number -4.79\n   *\n   *    const c = math.complex(3.24, -2.71)\n   *    math.floor(c)                 // returns Complex 3 - 3i\n   *    math.floor(c, 1)              // returns Complex 3.2 -2.8i\n   *\n   *    math.floor([3.2, 3.8, -4.7])       // returns Array [3, 3, -5]\n   *    math.floor([3.21, 3.82, -4.71], 1)  // returns Array [3.2, 3.8, -4.8]\n   *\n   *    math.floor(math.tau, [2, 3])  // returns Array [6.28, 6.283]\n   *\n   *    // Note that floor(array, array) currently not implemented.\n   *\n   * See also:\n   *\n   *    ceil, fix, round\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  return typed('floor', {\n    number: floorNumber.signatures.number,\n    'number,number': floorNumber.signatures['number,number'],\n    Complex: function Complex(x) {\n      return x.floor();\n    },\n    'Complex, number': function ComplexNumber(x, n) {\n      return x.floor(n);\n    },\n    'Complex, BigNumber': function ComplexBigNumber(x, n) {\n      return x.floor(n.toNumber());\n    },\n    BigNumber: function BigNumber(x) {\n      if ((0, _nearlyEqual.nearlyEqual)(x, round(x), config.epsilon)) {\n        return round(x);\n      } else {\n        return x.floor();\n      }\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, n) {\n      if ((0, _nearlyEqual.nearlyEqual)(x, round(x, n), config.epsilon)) {\n        return round(x, n);\n      } else {\n        return x.toDecimalPlaces(n.toNumber(), _decimal[\"default\"].ROUND_FLOOR);\n      }\n    },\n    Fraction: function Fraction(x) {\n      return x.floor();\n    },\n    'Fraction, number': function FractionNumber(x, n) {\n      return x.floor(n);\n    },\n    'Fraction, BigNumber': function FractionBigNumber(x, n) {\n      return x.floor(n.toNumber());\n    },\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        // deep map collection, skip zeros since floor(0) = 0\n        return (0, _collection.deepMap)(x, self, true);\n      };\n    }),\n    'Array, number | BigNumber': typed.referToSelf(function (self) {\n      return function (x, n) {\n        // deep map collection, skip zeros since ceil(0) = 0\n        return (0, _collection.deepMap)(x, function (i) {\n          return self(i, n);\n        }, true);\n      };\n    }),\n    'SparseMatrix, number | BigNumber': typed.referToSelf(function (self) {\n      return function (x, y) {\n        return matAlgo11xS0s(x, y, self, false);\n      };\n    }),\n    'DenseMatrix, number | BigNumber': typed.referToSelf(function (self) {\n      return function (x, y) {\n        return matAlgo14xDs(x, y, self, false);\n      };\n    }),\n    'number | Complex | Fraction | BigNumber, Array': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // use matrix implementation\n        return matAlgo14xDs(matrix(y), x, self, true).valueOf();\n      };\n    }),\n    'number | Complex | Fraction | BigNumber, Matrix': typed.referToSelf(function (self) {\n      return function (x, y) {\n        if (equalScalar(x, 0)) return zeros(y.size(), y.storage());\n        if (y.storage() === 'dense') {\n          return matAlgo14xDs(y, x, self, true);\n        }\n        return matAlgo12xSfs(y, x, self, true);\n      };\n    })\n  });\n});\nexports.createFloor = createFloor;","var toPropertyKey = require(\"./toPropertyKey.js\");\nfunction _defineProperty(obj, key, value) {\n  key = toPropertyKey(key);\n  if (key in obj) {\n    Object.defineProperty(obj, key, {\n      value: value,\n      enumerable: true,\n      configurable: true,\n      writable: true\n    });\n  } else {\n    obj[key] = value;\n  }\n  return obj;\n}\nmodule.exports = _defineProperty, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","var arrayLikeToArray = require(\"./arrayLikeToArray.js\");\nfunction _arrayWithoutHoles(arr) {\n  if (Array.isArray(arr)) return arrayLikeToArray(arr);\n}\nmodule.exports = _arrayWithoutHoles, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","function _iterableToArray(iter) {\n  if (typeof Symbol !== \"undefined\" && iter[Symbol.iterator] != null || iter[\"@@iterator\"] != null) return Array.from(iter);\n}\nmodule.exports = _iterableToArray, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","function _nonIterableSpread() {\n  throw new TypeError(\"Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}\nmodule.exports = _nonIterableSpread, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","var arrayWithoutHoles = require(\"./arrayWithoutHoles.js\");\nvar iterableToArray = require(\"./iterableToArray.js\");\nvar unsupportedIterableToArray = require(\"./unsupportedIterableToArray.js\");\nvar nonIterableSpread = require(\"./nonIterableSpread.js\");\nfunction _toConsumableArray(arr) {\n  return arrayWithoutHoles(arr) || iterableToArray(arr) || unsupportedIterableToArray(arr) || nonIterableSpread();\n}\nmodule.exports = _toConsumableArray, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMatAlgo01xDSid = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar _DimensionError = require(\"../../../error/DimensionError.js\");\nvar name = 'matAlgo01xDSid';\nvar dependencies = ['typed'];\nvar createMatAlgo01xDSid = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\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  return function algorithm1(denseMatrix, sparseMatrix, callback, inverse) {\n    // dense matrix arrays\n    var adata = denseMatrix._data;\n    var asize = denseMatrix._size;\n    var adt = denseMatrix._datatype;\n    // sparse matrix arrays\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;\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new _DimensionError.DimensionError(asize.length, bsize.length);\n    }\n\n    // check rows & columns\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    }\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!bvalues) {\n      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // process data types\n    var dt = typeof adt === 'string' && adt === bdt ? adt : undefined;\n    // callback function\n    var cf = dt ? typed.find(callback, [dt, dt]) : callback;\n\n    // vars\n    var i, j;\n\n    // result (DenseMatrix)\n    var cdata = [];\n    // initialize c\n    for (i = 0; i < rows; i++) {\n      cdata[i] = [];\n    }\n\n    // workspace\n    var x = [];\n    // marks indicating we have a value in x for a given column\n    var w = [];\n\n    // loop columns in b\n    for (j = 0; j < columns; j++) {\n      // column mark\n      var mark = j + 1;\n      // values in column j\n      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = bindex[k];\n        // update workspace\n        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]);\n        // mark i as updated\n        w[i] = mark;\n      }\n      // loop rows\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    }\n\n    // return dense matrix\n    return denseMatrix.createDenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});\nexports.createMatAlgo01xDSid = createMatAlgo01xDSid;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMatAlgo04xSidSid = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar _DimensionError = require(\"../../../error/DimensionError.js\");\nvar name = 'matAlgo04xSidSid';\nvar dependencies = ['typed', 'equalScalar'];\nvar createMatAlgo04xSidSid = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    equalScalar = _ref.equalScalar;\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 && B(i,j) === 0\n   *          └  B(i,j)       ; A(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  return function matAlgo04xSidSid(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;\n    // sparse matrix arrays\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;\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new _DimensionError.DimensionError(asize.length, bsize.length);\n    }\n\n    // check rows & columns\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    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt;\n      // find signature that matches (dt, dt)\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result arrays\n    var cvalues = avalues && bvalues ? [] : undefined;\n    var cindex = [];\n    var cptr = [];\n\n    // workspace\n    var xa = avalues && bvalues ? [] : undefined;\n    var xb = avalues && bvalues ? [] : undefined;\n    // marks indicating we have a value in x for a given column\n    var wa = [];\n    var wb = [];\n\n    // vars\n    var i, j, k, k0, k1;\n\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length;\n      // columns mark\n      var mark = j + 1;\n      // loop A(:,j)\n      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = aindex[k];\n        // update c\n        cindex.push(i);\n        // update workspace\n        wa[i] = mark;\n        // check we need to process values\n        if (xa) {\n          xa[i] = avalues[k];\n        }\n      }\n      // loop B(:,j)\n      for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = bindex[k];\n        // check row exists in A\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]);\n            // check for zero\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);\n          // update workspace\n          wb[i] = mark;\n          // check we need to process values\n          if (xb) {\n            xb[i] = bvalues[k];\n          }\n        }\n      }\n      // check we need to process values (non pattern matrix)\n      if (xa && xb) {\n        // initialize first index in j\n        k = cptr[j];\n        // loop index in j\n        while (k < cindex.length) {\n          // row\n          i = cindex[k];\n          // check workspace has value @ i\n          if (wa[i] === mark) {\n            // push value (Aij != 0 || (Aij != 0 && Bij != 0))\n            cvalues[k] = xa[i];\n            // increment pointer\n            k++;\n          } else if (wb[i] === mark) {\n            // push value (bij != 0)\n            cvalues[k] = xb[i];\n            // increment pointer\n            k++;\n          } else {\n            // remove index @ k\n            cindex.splice(k, 1);\n          }\n        }\n      }\n    }\n    // update cptr\n    cptr[columns] = cindex.length;\n\n    // return sparse matrix\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});\nexports.createMatAlgo04xSidSid = createMatAlgo04xSidSid;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMatAlgo10xSids = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar name = 'matAlgo10xSids';\nvar dependencies = ['typed', 'DenseMatrix'];\nvar createMatAlgo10xSids = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    DenseMatrix = _ref.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  return function matAlgo10xSids(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;\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!avalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // convert b to the same datatype\n      b = typed.convert(b, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result arrays\n    var cdata = [];\n\n    // workspaces\n    var x = [];\n    // marks indicating we have a value in x for a given column\n    var w = [];\n\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // columns mark\n      var mark = j + 1;\n      // values in j\n      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var r = aindex[k];\n        // update workspace\n        x[r] = avalues[k];\n        w[r] = mark;\n      }\n      // loop rows\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        }\n        // check sparse matrix has a value @ i,j\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    }\n\n    // return dense matrix\n    return new DenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});\nexports.createMatAlgo10xSids = createMatAlgo10xSids;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMatAlgo13xDD = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar _DimensionError = require(\"../../../error/DimensionError.js\");\nvar name = 'matAlgo13xDD';\nvar dependencies = ['typed'];\nvar createMatAlgo13xDD = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\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  return function matAlgo13xDD(a, b, callback) {\n    // a arrays\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype;\n    // b arrays\n    var bdata = b._data;\n    var bsize = b._size;\n    var bdt = b._datatype;\n    // c arrays\n    var csize = [];\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new _DimensionError.DimensionError(asize.length, bsize.length);\n    }\n\n    // validate each one of the dimension sizes\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      }\n      // update dimension in c\n      csize[s] = asize[s];\n    }\n\n    // datatype\n    var dt;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt;\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // populate cdata, iterate through dimensions\n    var cdata = csize.length > 0 ? _iterate(cf, 0, csize, csize[0], adata, bdata) : [];\n\n    // c matrix\n    return a.createDenseMatrix({\n      data: cdata,\n      size: csize,\n      datatype: dt\n    });\n  };\n\n  // recursive function\n  function _iterate(f, level, s, n, av, bv) {\n    // initialize array for this level\n    var cv = [];\n    // check we reach the last level\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    return cv;\n  }\n});\nexports.createMatAlgo13xDD = createMatAlgo13xDD;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createBroadcast = void 0;\nvar _toConsumableArray2 = _interopRequireDefault(require(\"@babel/runtime/helpers/toConsumableArray\"));\nvar _factory = require(\"../../../utils/factory.js\");\nvar name = 'broadcast';\nvar dependancies = ['concat'];\nvar createBroadcast = /* #__PURE__ */(0, _factory.factory)(name, dependancies, function (_ref) {\n  var concat = _ref.concat;\n  /**\n  * Broadcasts two matrices, and return both in an array\n  * It checks if it's possible with broadcasting rules\n  *\n  * @param {Matrix}   A      First Matrix\n  * @param {Matrix}   B      Second Matrix\n  *\n  * @return {Matrix[]}      [ broadcastedA, broadcastedB ]\n  */\n  return function (A, B) {\n    var N = Math.max(A._size.length, B._size.length); // max number of dims\n    if (A._size.length === B._size.length) {\n      if (A._size.every(function (dim, i) {\n        return dim === B._size[i];\n      })) {\n        // If matrices have the same size return them\n        return [A, B];\n      }\n    }\n    var sizeA = _padLeft(A._size, N, 0); // pad to the left to align dimensions to the right\n    var sizeB = _padLeft(B._size, N, 0); // pad to the left to align dimensions to the right\n\n    // calculate the max dimensions\n    var sizeMax = [];\n    for (var dim = 0; dim < N; dim++) {\n      sizeMax[dim] = Math.max(sizeA[dim], sizeB[dim]);\n    }\n\n    // check if the broadcasting rules applyes for both matrices\n    for (var _dim = 0; _dim < N; _dim++) {\n      _checkRules(sizeA, sizeMax, _dim);\n      _checkRules(sizeB, sizeMax, _dim);\n    }\n\n    // reshape A or B if needed to make them ready for concat\n    var AA = A.clone();\n    var BB = B.clone();\n    if (AA._size.length < N) {\n      AA.reshape(_padLeft(AA._size, N, 1));\n    } else if (BB._size.length < N) {\n      BB.reshape(_padLeft(BB._size, N, 1));\n    }\n\n    // stretches the matrices on each dimension to make them the same size\n    for (var _dim2 = 0; _dim2 < N; _dim2++) {\n      if (AA._size[_dim2] < sizeMax[_dim2]) {\n        AA = _stretch(AA, sizeMax[_dim2], _dim2);\n      }\n      if (BB._size[_dim2] < sizeMax[_dim2]) {\n        BB = _stretch(BB, sizeMax[_dim2], _dim2);\n      }\n    }\n\n    // return the array with the two broadcasted matrices\n    return [AA, BB];\n  };\n  function _padLeft(shape, N, filler) {\n    // pads an array of dimensions with numbers to the left, unitl the number of dimensions is N\n    return [].concat((0, _toConsumableArray2[\"default\"])(Array(N - shape.length).fill(filler)), (0, _toConsumableArray2[\"default\"])(shape));\n  }\n  function _stretch(arrayToStretch, sizeToStretch, dimToStretch) {\n    // stretches a matrix up to a certain size in a certain dimension\n    return concat.apply(void 0, (0, _toConsumableArray2[\"default\"])(Array(sizeToStretch).fill(arrayToStretch)).concat([dimToStretch]));\n  }\n  function _checkRules(shape, sizeMax, dim) {\n    if (shape[dim] < sizeMax[dim] & shape[dim] > 1) {\n      throw new Error(\"shape missmatch: missmatch is found in arg with shape (\".concat(shape, \") not possible to broadcast dimension \").concat(dim, \" with size \").concat(shape[dim], \" to size \").concat(sizeMax[dim]));\n    }\n  }\n});\nexports.createBroadcast = createBroadcast;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMatrixAlgorithmSuite = void 0;\nvar _toConsumableArray2 = _interopRequireDefault(require(\"@babel/runtime/helpers/toConsumableArray\"));\nvar _factory = require(\"../../../utils/factory.js\");\nvar _object = require(\"../../../utils/object.js\");\nvar _matAlgo13xDD = require(\"./matAlgo13xDD.js\");\nvar _matAlgo14xDs = require(\"./matAlgo14xDs.js\");\nvar _broadcast = require(\"./broadcast.js\");\nvar name = 'matrixAlgorithmSuite';\nvar dependencies = ['typed', 'matrix', 'concat'];\nvar createMatrixAlgorithmSuite = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    concat = _ref.concat;\n  var matAlgo13xDD = (0, _matAlgo13xDD.createMatAlgo13xDD)({\n    typed: typed\n  });\n  var matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({\n    typed: typed\n  });\n  var broadcast = (0, _broadcast.createBroadcast)({\n    concat: concat\n  });\n\n  /**\n   * Return a signatures object with the usual boilerplate of\n   * matrix algorithms, based on a plain options object with the\n   * following properties:\n   *   elop: function -- the elementwise operation to use, defaults to self\n   *   SS: function -- the algorithm to apply for two sparse matrices\n   *   DS: function -- the algorithm to apply for a dense and a sparse matrix\n   *   SD: function -- algo for a sparse and a dense; defaults to SD flipped\n   *   Ss: function -- the algorithm to apply for a sparse matrix and scalar\n   *   sS: function -- algo for scalar and sparse; defaults to Ss flipped\n   *   scalar: string -- typed-function type for scalars, defaults to 'any'\n   *\n   * If Ss is not specified, no matrix-scalar signatures are generated.\n   *\n   * @param {object} options\n   * @return {Object<string, function>} signatures\n   */\n  return function matrixAlgorithmSuite(options) {\n    var elop = options.elop;\n    var SD = options.SD || options.DS;\n    var matrixSignatures;\n    if (elop) {\n      // First the dense ones\n      matrixSignatures = {\n        'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {\n          return matAlgo13xDD.apply(void 0, (0, _toConsumableArray2[\"default\"])(broadcast(x, y)).concat([elop]));\n        },\n        'Array, Array': function ArrayArray(x, y) {\n          return matAlgo13xDD.apply(void 0, (0, _toConsumableArray2[\"default\"])(broadcast(matrix(x), matrix(y))).concat([elop])).valueOf();\n        },\n        'Array, DenseMatrix': function ArrayDenseMatrix(x, y) {\n          return matAlgo13xDD.apply(void 0, (0, _toConsumableArray2[\"default\"])(broadcast(matrix(x), y)).concat([elop]));\n        },\n        'DenseMatrix, Array': function DenseMatrixArray(x, y) {\n          return matAlgo13xDD.apply(void 0, (0, _toConsumableArray2[\"default\"])(broadcast(x, matrix(y))).concat([elop]));\n        }\n      };\n      // Now incorporate sparse matrices\n      if (options.SS) {\n        matrixSignatures['SparseMatrix, SparseMatrix'] = function (x, y) {\n          return options.SS.apply(options, (0, _toConsumableArray2[\"default\"])(broadcast(x, y)).concat([elop, false]));\n        };\n      }\n      if (options.DS) {\n        matrixSignatures['DenseMatrix, SparseMatrix'] = function (x, y) {\n          return options.DS.apply(options, (0, _toConsumableArray2[\"default\"])(broadcast(x, y)).concat([elop, false]));\n        };\n        matrixSignatures['Array, SparseMatrix'] = function (x, y) {\n          return options.DS.apply(options, (0, _toConsumableArray2[\"default\"])(broadcast(matrix(x), y)).concat([elop, false]));\n        };\n      }\n      if (SD) {\n        matrixSignatures['SparseMatrix, DenseMatrix'] = function (x, y) {\n          return SD.apply(void 0, (0, _toConsumableArray2[\"default\"])(broadcast(y, x)).concat([elop, true]));\n        };\n        matrixSignatures['SparseMatrix, Array'] = function (x, y) {\n          return SD.apply(void 0, (0, _toConsumableArray2[\"default\"])(broadcast(matrix(y), x)).concat([elop, true]));\n        };\n      }\n    } else {\n      // No elop, use this\n      // First the dense ones\n      matrixSignatures = {\n        'DenseMatrix, DenseMatrix': typed.referToSelf(function (self) {\n          return function (x, y) {\n            return matAlgo13xDD.apply(void 0, (0, _toConsumableArray2[\"default\"])(broadcast(x, y)).concat([self]));\n          };\n        }),\n        'Array, Array': typed.referToSelf(function (self) {\n          return function (x, y) {\n            return matAlgo13xDD.apply(void 0, (0, _toConsumableArray2[\"default\"])(broadcast(matrix(x), matrix(y))).concat([self])).valueOf();\n          };\n        }),\n        'Array, DenseMatrix': typed.referToSelf(function (self) {\n          return function (x, y) {\n            return matAlgo13xDD.apply(void 0, (0, _toConsumableArray2[\"default\"])(broadcast(matrix(x), y)).concat([self]));\n          };\n        }),\n        'DenseMatrix, Array': typed.referToSelf(function (self) {\n          return function (x, y) {\n            return matAlgo13xDD.apply(void 0, (0, _toConsumableArray2[\"default\"])(broadcast(x, matrix(y))).concat([self]));\n          };\n        })\n      };\n      // Now incorporate sparse matrices\n      if (options.SS) {\n        matrixSignatures['SparseMatrix, SparseMatrix'] = typed.referToSelf(function (self) {\n          return function (x, y) {\n            return options.SS.apply(options, (0, _toConsumableArray2[\"default\"])(broadcast(x, y)).concat([self, false]));\n          };\n        });\n      }\n      if (options.DS) {\n        matrixSignatures['DenseMatrix, SparseMatrix'] = typed.referToSelf(function (self) {\n          return function (x, y) {\n            return options.DS.apply(options, (0, _toConsumableArray2[\"default\"])(broadcast(x, y)).concat([self, false]));\n          };\n        });\n        matrixSignatures['Array, SparseMatrix'] = typed.referToSelf(function (self) {\n          return function (x, y) {\n            return options.DS.apply(options, (0, _toConsumableArray2[\"default\"])(broadcast(matrix(x), y)).concat([self, false]));\n          };\n        });\n      }\n      if (SD) {\n        matrixSignatures['SparseMatrix, DenseMatrix'] = typed.referToSelf(function (self) {\n          return function (x, y) {\n            return SD.apply(void 0, (0, _toConsumableArray2[\"default\"])(broadcast(y, x)).concat([self, true]));\n          };\n        });\n        matrixSignatures['SparseMatrix, Array'] = typed.referToSelf(function (self) {\n          return function (x, y) {\n            return SD.apply(void 0, (0, _toConsumableArray2[\"default\"])(broadcast(matrix(y), x)).concat([self, true]));\n          };\n        });\n      }\n    }\n\n    // Now add the scalars\n    var scalar = options.scalar || 'any';\n    var Ds = options.Ds || options.Ss;\n    if (Ds) {\n      if (elop) {\n        matrixSignatures['DenseMatrix,' + scalar] = function (x, y) {\n          return matAlgo14xDs(x, y, elop, false);\n        };\n        matrixSignatures[scalar + ', DenseMatrix'] = function (x, y) {\n          return matAlgo14xDs(y, x, elop, true);\n        };\n        matrixSignatures['Array,' + scalar] = function (x, y) {\n          return matAlgo14xDs(matrix(x), y, elop, false).valueOf();\n        };\n        matrixSignatures[scalar + ', Array'] = function (x, y) {\n          return matAlgo14xDs(matrix(y), x, elop, true).valueOf();\n        };\n      } else {\n        matrixSignatures['DenseMatrix,' + scalar] = typed.referToSelf(function (self) {\n          return function (x, y) {\n            return matAlgo14xDs(x, y, self, false);\n          };\n        });\n        matrixSignatures[scalar + ', DenseMatrix'] = typed.referToSelf(function (self) {\n          return function (x, y) {\n            return matAlgo14xDs(y, x, self, true);\n          };\n        });\n        matrixSignatures['Array,' + scalar] = typed.referToSelf(function (self) {\n          return function (x, y) {\n            return matAlgo14xDs(matrix(x), y, self, false).valueOf();\n          };\n        });\n        matrixSignatures[scalar + ', Array'] = typed.referToSelf(function (self) {\n          return function (x, y) {\n            return matAlgo14xDs(matrix(y), x, self, true).valueOf();\n          };\n        });\n      }\n    }\n    var sS = options.sS !== undefined ? options.sS : options.Ss;\n    if (elop) {\n      if (options.Ss) {\n        matrixSignatures['SparseMatrix,' + scalar] = function (x, y) {\n          return options.Ss(x, y, elop, false);\n        };\n      }\n      if (sS) {\n        matrixSignatures[scalar + ', SparseMatrix'] = function (x, y) {\n          return sS(y, x, elop, true);\n        };\n      }\n    } else {\n      if (options.Ss) {\n        matrixSignatures['SparseMatrix,' + scalar] = typed.referToSelf(function (self) {\n          return function (x, y) {\n            return options.Ss(x, y, self, false);\n          };\n        });\n      }\n      if (sS) {\n        matrixSignatures[scalar + ', SparseMatrix'] = typed.referToSelf(function (self) {\n          return function (x, y) {\n            return sS(y, x, self, true);\n          };\n        });\n      }\n    }\n    // Also pull in the scalar signatures if the operator is a typed function\n    if (elop && elop.signatures) {\n      (0, _object.extend)(matrixSignatures, elop.signatures);\n    }\n    return matrixSignatures;\n  };\n});\nexports.createMatrixAlgorithmSuite = createMatrixAlgorithmSuite;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.ArgumentsError = ArgumentsError;\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 */\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  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}\nArgumentsError.prototype = new Error();\nArgumentsError.prototype.constructor = Error;\nArgumentsError.prototype.name = 'ArgumentsError';\nArgumentsError.prototype.isArgumentsError = true;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createGcd = void 0;\nvar _defineProperty2 = _interopRequireDefault(require(\"@babel/runtime/helpers/defineProperty\"));\nvar _toConsumableArray2 = _interopRequireDefault(require(\"@babel/runtime/helpers/toConsumableArray\"));\nvar _factory = require(\"../../utils/factory.js\");\nvar _matAlgo01xDSid = require(\"../../type/matrix/utils/matAlgo01xDSid.js\");\nvar _matAlgo04xSidSid = require(\"../../type/matrix/utils/matAlgo04xSidSid.js\");\nvar _matAlgo10xSids = require(\"../../type/matrix/utils/matAlgo10xSids.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar _ArgumentsError = require(\"../../error/ArgumentsError.js\");\nvar name = 'gcd';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber', 'DenseMatrix', 'concat'];\nvar gcdTypes = 'number | BigNumber | Fraction | Matrix | Array';\nvar gcdManyTypesSignature = \"\".concat(gcdTypes, \", \").concat(gcdTypes, \", ...\").concat(gcdTypes);\nfunction is1d(array) {\n  return !array.some(function (element) {\n    return Array.isArray(element);\n  });\n}\nvar createGcd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var _typed;\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    equalScalar = _ref.equalScalar,\n    BigNumber = _ref.BigNumber,\n    DenseMatrix = _ref.DenseMatrix,\n    concat = _ref.concat;\n  var matAlgo01xDSid = (0, _matAlgo01xDSid.createMatAlgo01xDSid)({\n    typed: typed\n  });\n  var matAlgo04xSidSid = (0, _matAlgo04xSidSid.createMatAlgo04xSidSid)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo10xSids = (0, _matAlgo10xSids.createMatAlgo10xSids)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n\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  return typed(name, {\n    'number, number': _index.gcdNumber,\n    'BigNumber, BigNumber': _gcdBigNumber,\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.gcd(y);\n    }\n  }, matrixAlgorithmSuite({\n    SS: matAlgo04xSidSid,\n    DS: matAlgo01xDSid,\n    Ss: matAlgo10xSids\n  }), (_typed = {}, (0, _defineProperty2[\"default\"])(_typed, gcdManyTypesSignature, typed.referToSelf(function (self) {\n    return function (a, b, args) {\n      var res = self(a, b);\n      for (var i = 0; i < args.length; i++) {\n        res = self(res, args[i]);\n      }\n      return res;\n    };\n  })), (0, _defineProperty2[\"default\"])(_typed, \"Array\", typed.referToSelf(function (self) {\n    return function (array) {\n      if (array.length === 1 && Array.isArray(array[0]) && is1d(array[0])) {\n        return self.apply(void 0, (0, _toConsumableArray2[\"default\"])(array[0]));\n      }\n      if (is1d(array)) {\n        return self.apply(void 0, (0, _toConsumableArray2[\"default\"])(array));\n      }\n      throw new _ArgumentsError.ArgumentsError('gcd() supports only 1d matrices!');\n    };\n  })), (0, _defineProperty2[\"default\"])(_typed, \"Matrix\", typed.referToSelf(function (self) {\n    return function (matrix) {\n      return self(matrix.toArray());\n    };\n  })), _typed));\n\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  function _gcdBigNumber(a, b) {\n    if (!a.isInt() || !b.isInt()) {\n      throw new Error('Parameters in function gcd must be integer numbers');\n    }\n\n    // https://en.wikipedia.org/wiki/Euclidean_algorithm\n    var zero = new BigNumber(0);\n    while (!b.isZero()) {\n      var r = a.mod(b);\n      a = b;\n      b = r;\n    }\n    return a.lt(zero) ? a.neg() : a;\n  }\n});\nexports.createGcd = createGcd;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMatAlgo02xDS0 = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar _DimensionError = require(\"../../../error/DimensionError.js\");\nvar name = 'matAlgo02xDS0';\nvar dependencies = ['typed', 'equalScalar'];\nvar createMatAlgo02xDS0 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    equalScalar = _ref.equalScalar;\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  return function matAlgo02xDS0(denseMatrix, sparseMatrix, callback, inverse) {\n    // dense matrix arrays\n    var adata = denseMatrix._data;\n    var asize = denseMatrix._size;\n    var adt = denseMatrix._datatype;\n    // sparse matrix arrays\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;\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new _DimensionError.DimensionError(asize.length, bsize.length);\n    }\n\n    // check rows & columns\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    }\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!bvalues) {\n      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt;\n      // find signature that matches (dt, dt)\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result (SparseMatrix)\n    var cvalues = [];\n    var cindex = [];\n    var cptr = [];\n\n    // loop columns in b\n    for (var j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length;\n      // values in column j\n      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var i = bindex[k];\n        // update C(i,j)\n        var cij = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]);\n        // check for nonzero\n        if (!eq(cij, zero)) {\n          // push i & v\n          cindex.push(i);\n          cvalues.push(cij);\n        }\n      }\n    }\n    // update cptr\n    cptr[columns] = cindex.length;\n\n    // return sparse matrix\n    return sparseMatrix.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});\nexports.createMatAlgo02xDS0 = createMatAlgo02xDS0;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMatAlgo06xS0S0 = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar _DimensionError = require(\"../../../error/DimensionError.js\");\nvar _collection = require(\"../../../utils/collection.js\");\nvar name = 'matAlgo06xS0S0';\nvar dependencies = ['typed', 'equalScalar'];\nvar createMatAlgo06xS0S0 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    equalScalar = _ref.equalScalar;\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  return function matAlgo06xS0S0(a, b, callback) {\n    // sparse matrix arrays\n    var avalues = a._values;\n    var asize = a._size;\n    var adt = a._datatype;\n    // sparse matrix arrays\n    var bvalues = b._values;\n    var bsize = b._size;\n    var bdt = b._datatype;\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new _DimensionError.DimensionError(asize.length, bsize.length);\n    }\n\n    // check rows & columns\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    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt;\n      // find signature that matches (dt, dt)\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result arrays\n    var cvalues = avalues && bvalues ? [] : undefined;\n    var cindex = [];\n    var cptr = [];\n\n    // workspaces\n    var x = cvalues ? [] : undefined;\n    // marks indicating we have a value in x for a given column\n    var w = [];\n    // marks indicating value in a given row has been updated\n    var u = [];\n\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length;\n      // columns mark\n      var mark = j + 1;\n      // scatter the values of A(:,j) into workspace\n      (0, _collection.scatter)(a, j, w, x, u, mark, cindex, cf);\n      // scatter the values of B(:,j) into workspace\n      (0, _collection.scatter)(b, j, w, x, u, mark, cindex, cf);\n      // check we need to process values (non pattern matrix)\n      if (x) {\n        // initialize first index in j\n        var k = cptr[j];\n        // loop index in j\n        while (k < cindex.length) {\n          // row\n          var i = cindex[k];\n          // check function was invoked on current row (Aij !=0 && Bij != 0)\n          if (u[i] === mark) {\n            // value @ i\n            var v = x[i];\n            // check for zero value\n            if (!eq(v, zero)) {\n              // push value\n              cvalues.push(v);\n              // increment pointer\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];\n        // loop index in j\n        while (p < cindex.length) {\n          // row\n          var r = cindex[p];\n          // check function was invoked on current row (Aij !=0 && Bij != 0)\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    }\n    // update cptr\n    cptr[columns] = cindex.length;\n\n    // return sparse matrix\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});\nexports.createMatAlgo06xS0S0 = createMatAlgo06xS0S0;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createLcm = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _matAlgo02xDS = require(\"../../type/matrix/utils/matAlgo02xDS0.js\");\nvar _matAlgo06xS0S = require(\"../../type/matrix/utils/matAlgo06xS0S0.js\");\nvar _matAlgo11xS0s = require(\"../../type/matrix/utils/matAlgo11xS0s.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'lcm';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'concat'];\nvar createLcm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    equalScalar = _ref.equalScalar,\n    concat = _ref.concat;\n  var matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo06xS0S0 = (0, _matAlgo06xS0S.createMatAlgo06xS0S0)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n  var lcmTypes = 'number | BigNumber | Fraction | Matrix | Array';\n  var lcmManySignature = {};\n  lcmManySignature[\"\".concat(lcmTypes, \", \").concat(lcmTypes, \", ...\").concat(lcmTypes)] = typed.referToSelf(function (self) {\n    return function (a, b, args) {\n      var res = self(a, b);\n      for (var i = 0; i < args.length; i++) {\n        res = self(res, args[i]);\n      }\n      return res;\n    };\n  });\n\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  return typed(name, {\n    'number, number': _index.lcmNumber,\n    'BigNumber, BigNumber': _lcmBigNumber,\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return x.lcm(y);\n    }\n  }, matrixAlgorithmSuite({\n    SS: matAlgo06xS0S0,\n    DS: matAlgo02xDS0,\n    Ss: matAlgo11xS0s\n  }), lcmManySignature);\n\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  function _lcmBigNumber(a, b) {\n    if (!a.isInt() || !b.isInt()) {\n      throw new Error('Parameters in function lcm must be integer numbers');\n    }\n    if (a.isZero()) {\n      return a;\n    }\n    if (b.isZero()) {\n      return b;\n    }\n\n    // https://en.wikipedia.org/wiki/Euclidean_algorithm\n    // evaluate lcm here inline to reduce overhead\n    var prod = a.times(b);\n    while (!b.isZero()) {\n      var t = b;\n      b = a.mod(t);\n      a = t;\n    }\n    return prod.div(a).abs();\n  }\n});\nexports.createLcm = createLcm;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createLog10 = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _collection = require(\"../../utils/collection.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'log10';\nvar dependencies = ['typed', 'config', 'Complex'];\nvar createLog10 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    _Complex = _ref.Complex;\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  return typed(name, {\n    number: function number(x) {\n      if (x >= 0 || config.predictable) {\n        return (0, _index.log10Number)(x);\n      } else {\n        // negative value -> complex value computation\n        return new _Complex(x, 0).log().div(Math.LN10);\n      }\n    },\n    Complex: function Complex(x) {\n      return new _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 _Complex(x.toNumber(), 0).log().div(Math.LN10);\n      }\n    },\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self);\n      };\n    })\n  });\n});\nexports.createLog10 = createLog10;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createLog2 = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _collection = require(\"../../utils/collection.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'log2';\nvar dependencies = ['typed', 'config', 'Complex'];\nvar createLog2 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    Complex = _ref.Complex;\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  return typed(name, {\n    number: function number(x) {\n      if (x >= 0 || config.predictable) {\n        return (0, _index.log2Number)(x);\n      } else {\n        // negative value -> complex value computation\n        return _log2Complex(new 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 Complex(x.toNumber(), 0));\n      }\n    },\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self);\n      };\n    })\n  });\n\n  /**\n   * Calculate log2 for a complex value\n   * @param {Complex} x\n   * @returns {Complex}\n   * @private\n   */\n  function _log2Complex(x) {\n    var newX = Math.sqrt(x.re * x.re + x.im * x.im);\n    return new Complex(Math.log2 ? Math.log2(newX) : Math.log(newX) / Math.LN2, Math.atan2(x.im, x.re) / Math.LN2);\n  }\n});\nexports.createLog2 = createLog2;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMatAlgo03xDSf = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar _DimensionError = require(\"../../../error/DimensionError.js\");\nvar name = 'matAlgo03xDSf';\nvar dependencies = ['typed'];\nvar createMatAlgo03xDSf = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\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  return function matAlgo03xDSf(denseMatrix, sparseMatrix, callback, inverse) {\n    // dense matrix arrays\n    var adata = denseMatrix._data;\n    var asize = denseMatrix._size;\n    var adt = denseMatrix._datatype;\n    // sparse matrix arrays\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;\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new _DimensionError.DimensionError(asize.length, bsize.length);\n    }\n\n    // check rows & columns\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    }\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!bvalues) {\n      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // zero value\n    var zero = 0;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result (DenseMatrix)\n    var cdata = [];\n\n    // initialize dense matrix\n    for (var z = 0; z < rows; z++) {\n      // initialize row\n      cdata[z] = [];\n    }\n\n    // workspace\n    var x = [];\n    // marks indicating we have a value in x for a given column\n    var w = [];\n\n    // loop columns in b\n    for (var j = 0; j < columns; j++) {\n      // column mark\n      var mark = j + 1;\n      // values in column j\n      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var i = bindex[k];\n        // update workspace\n        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]);\n        w[i] = mark;\n      }\n      // process workspace\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    }\n\n    // return dense matrix\n    return denseMatrix.createDenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});\nexports.createMatAlgo03xDSf = createMatAlgo03xDSf;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMatAlgo05xSfSf = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar _DimensionError = require(\"../../../error/DimensionError.js\");\nvar name = 'matAlgo05xSfSf';\nvar dependencies = ['typed', 'equalScalar'];\nvar createMatAlgo05xSfSf = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    equalScalar = _ref.equalScalar;\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  return function matAlgo05xSfSf(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;\n    // sparse matrix arrays\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;\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new _DimensionError.DimensionError(asize.length, bsize.length);\n    }\n\n    // check rows & columns\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    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt;\n      // find signature that matches (dt, dt)\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result arrays\n    var cvalues = avalues && bvalues ? [] : undefined;\n    var cindex = [];\n    var cptr = [];\n\n    // workspaces\n    var xa = cvalues ? [] : undefined;\n    var xb = cvalues ? [] : undefined;\n    // marks indicating we have a value in x for a given column\n    var wa = [];\n    var wb = [];\n\n    // vars\n    var i, j, k, k1;\n\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length;\n      // columns mark\n      var mark = j + 1;\n      // loop values A(:,j)\n      for (k = aptr[j], k1 = aptr[j + 1]; k < k1; k++) {\n        // row\n        i = aindex[k];\n        // push index\n        cindex.push(i);\n        // update workspace\n        wa[i] = mark;\n        // check we need to process values\n        if (xa) {\n          xa[i] = avalues[k];\n        }\n      }\n      // loop values B(:,j)\n      for (k = bptr[j], k1 = bptr[j + 1]; k < k1; k++) {\n        // row\n        i = bindex[k];\n        // check row existed in A\n        if (wa[i] !== mark) {\n          // push index\n          cindex.push(i);\n        }\n        // update workspace\n        wb[i] = mark;\n        // check we need to process values\n        if (xb) {\n          xb[i] = bvalues[k];\n        }\n      }\n      // check we need to process values (non pattern matrix)\n      if (cvalues) {\n        // initialize first index in j\n        k = cptr[j];\n        // loop index in j\n        while (k < cindex.length) {\n          // row\n          i = cindex[k];\n          // marks\n          var wai = wa[i];\n          var wbi = wb[i];\n          // check Aij or Bij are nonzero\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;\n            // Cij\n            var vc = cf(va, vb);\n            // check for zero\n            if (!eq(vc, zero)) {\n              // push value\n              cvalues.push(vc);\n              // increment pointer\n              k++;\n            } else {\n              // remove value @ i, do not increment pointer\n              cindex.splice(k, 1);\n            }\n          }\n        }\n      }\n    }\n    // update cptr\n    cptr[columns] = cindex.length;\n\n    // return sparse matrix\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});\nexports.createMatAlgo05xSfSf = createMatAlgo05xSfSf;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMod = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _matAlgo02xDS = require(\"../../type/matrix/utils/matAlgo02xDS0.js\");\nvar _matAlgo03xDSf = require(\"../../type/matrix/utils/matAlgo03xDSf.js\");\nvar _matAlgo05xSfSf = require(\"../../type/matrix/utils/matAlgo05xSfSf.js\");\nvar _matAlgo11xS0s = require(\"../../type/matrix/utils/matAlgo11xS0s.js\");\nvar _matAlgo12xSfs = require(\"../../type/matrix/utils/matAlgo12xSfs.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar name = 'mod';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix', 'concat'];\nvar createMod = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    equalScalar = _ref.equalScalar,\n    DenseMatrix = _ref.DenseMatrix,\n    concat = _ref.concat;\n  var matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({\n    typed: typed\n  });\n  var matAlgo05xSfSf = (0, _matAlgo05xSfSf.createMatAlgo05xSfSf)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n\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  return typed(name, {\n    'number, number': _index.modNumber,\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      if (y.isNeg()) {\n        throw new Error('Cannot calculate mod for a negative divisor');\n      }\n      return y.isZero() ? x : x.mod(y);\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      if (y.compare(0) < 0) {\n        throw new Error('Cannot calculate mod for a negative divisor');\n      }\n      // Workaround suggested in Fraction.js library to calculate correct modulo for negative dividend\n      return x.compare(0) >= 0 ? x.mod(y) : x.mod(y).add(y).mod(y);\n    }\n  }, matrixAlgorithmSuite({\n    SS: matAlgo05xSfSf,\n    DS: matAlgo03xDSf,\n    SD: matAlgo02xDS0,\n    Ss: matAlgo11xS0s,\n    sS: matAlgo12xSfs\n  }));\n});\nexports.createMod = createMod;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMultiplyScalar = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'multiplyScalar';\nvar dependencies = ['typed'];\nvar createMultiplyScalar = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.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).\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  return typed('multiplyScalar', {\n    'number, number': _index.multiplyNumber,\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      return y.multiply(x);\n    },\n    'Unit, number | Fraction | BigNumber | Complex | Unit': function UnitNumberFractionBigNumberComplexUnit(x, y) {\n      return x.multiply(y);\n    }\n  });\n});\nexports.createMultiplyScalar = createMultiplyScalar;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMultiply = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _is = require(\"../../utils/is.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _matAlgo11xS0s = require(\"../../type/matrix/utils/matAlgo11xS0s.js\");\nvar _matAlgo14xDs = require(\"../../type/matrix/utils/matAlgo14xDs.js\");\nvar name = 'multiply';\nvar dependencies = ['typed', 'matrix', 'addScalar', 'multiplyScalar', 'equalScalar', 'dot'];\nvar createMultiply = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    addScalar = _ref.addScalar,\n    multiplyScalar = _ref.multiplyScalar,\n    equalScalar = _ref.equalScalar,\n    dot = _ref.dot;\n  var matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({\n    typed: typed\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            break;\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            break;\n          default:\n            throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');\n        }\n        break;\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            break;\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            break;\n          default:\n            throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');\n        }\n        break;\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  /**\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  function _multiplyVectorVector(a, b, n) {\n    // check empty vector\n    if (n === 0) {\n      throw new Error('Cannot multiply two empty vectors');\n    }\n    return dot(a, b);\n  }\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  function _multiplyVectorMatrix(a, b) {\n    // process storage\n    if (b.storage() !== 'dense') {\n      throw new Error('Support for SparseMatrix not implemented');\n    }\n    return _multiplyVectorDenseMatrix(a, b);\n  }\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  function _multiplyVectorDenseMatrix(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype;\n    // b dense\n    var bdata = b._data;\n    var bsize = b._size;\n    var bdt = b._datatype;\n    // rows & columns\n    var alength = asize[0];\n    var bcolumns = bsize[1];\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    }\n\n    // result\n    var c = [];\n\n    // loop matrix columns\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]);\n      // loop vector\n      for (var i = 1; i < alength; i++) {\n        // multiply & accumulate\n        sum = af(sum, mf(adata[i], bdata[i][j]));\n      }\n      c[j] = sum;\n    }\n\n    // return matrix\n    return a.createDenseMatrix({\n      data: c,\n      size: [bcolumns],\n      datatype: dt\n    });\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  var _multiplyMatrixVector = typed('_multiplyMatrixVector', {\n    'DenseMatrix, any': _multiplyDenseMatrixVector,\n    'SparseMatrix, any': _multiplySparseMatrixVector\n  });\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  var _multiplyMatrixMatrix = typed('_multiplyMatrixMatrix', {\n    'DenseMatrix, DenseMatrix': _multiplyDenseMatrixDenseMatrix,\n    'DenseMatrix, SparseMatrix': _multiplyDenseMatrixSparseMatrix,\n    'SparseMatrix, DenseMatrix': _multiplySparseMatrixDenseMatrix,\n    'SparseMatrix, SparseMatrix': _multiplySparseMatrixSparseMatrix\n  });\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  function _multiplyDenseMatrixVector(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype;\n    // b dense\n    var bdata = b._data;\n    var bdt = b._datatype;\n    // rows & columns\n    var arows = asize[0];\n    var acolumns = asize[1];\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    }\n\n    // result\n    var c = [];\n\n    // loop matrix a rows\n    for (var i = 0; i < arows; i++) {\n      // current row\n      var row = adata[i];\n      // sum (do not initialize it with zero)\n      var sum = mf(row[0], bdata[0]);\n      // loop matrix a columns\n      for (var j = 1; j < acolumns; j++) {\n        // multiply & accumulate\n        sum = af(sum, mf(row[j], bdata[j]));\n      }\n      c[i] = sum;\n    }\n\n    // return matrix\n    return a.createDenseMatrix({\n      data: c,\n      size: [arows],\n      datatype: dt\n    });\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  function _multiplyDenseMatrixDenseMatrix(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype;\n    // b dense\n    var bdata = b._data;\n    var bsize = b._size;\n    var bdt = b._datatype;\n    // rows & columns\n    var arows = asize[0];\n    var acolumns = asize[1];\n    var bcolumns = bsize[1];\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    }\n\n    // result\n    var c = [];\n\n    // loop matrix a rows\n    for (var i = 0; i < arows; i++) {\n      // current row\n      var row = adata[i];\n      // initialize row array\n      c[i] = [];\n      // loop matrix b columns\n      for (var j = 0; j < bcolumns; j++) {\n        // sum (avoid initializing sum to zero)\n        var sum = mf(row[0], bdata[0][j]);\n        // loop matrix a columns\n        for (var x = 1; x < acolumns; x++) {\n          // multiply & accumulate\n          sum = af(sum, mf(row[x], bdata[x][j]));\n        }\n        c[i][j] = sum;\n      }\n    }\n\n    // return matrix\n    return a.createDenseMatrix({\n      data: c,\n      size: [arows, bcolumns],\n      datatype: dt\n    });\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  function _multiplyDenseMatrixSparseMatrix(a, b) {\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype;\n    // b sparse\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;\n    // validate b matrix\n    if (!bvalues) {\n      throw new Error('Cannot multiply Dense Matrix times Pattern only Matrix');\n    }\n    // rows & columns\n    var arows = asize[0];\n    var bcolumns = bsize[1];\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n    // equalScalar signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n    }\n\n    // result\n    var cvalues = [];\n    var cindex = [];\n    var cptr = [];\n    // c matrix\n    var c = b.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: dt\n    });\n\n    // loop b columns\n    for (var jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length;\n      // indeces in column jb\n      var kb0 = bptr[jb];\n      var kb1 = bptr[jb + 1];\n      // do not process column jb if no data exists\n      if (kb1 > kb0) {\n        // last row mark processed\n        var last = 0;\n        // loop a rows\n        for (var i = 0; i < arows; i++) {\n          // column mark\n          var mark = i + 1;\n          // C[i, jb]\n          var cij = void 0;\n          // values in b column j\n          for (var kb = kb0; kb < kb1; kb++) {\n            // row\n            var ib = bindex[kb];\n            // check value has been initialized\n            if (last !== mark) {\n              // first value in column jb\n              cij = mf(adata[i][ib], bvalues[kb]);\n              // update mark\n              last = mark;\n            } else {\n              // accumulate value\n              cij = af(cij, mf(adata[i][ib], bvalues[kb]));\n            }\n          }\n          // check column has been processed and value != 0\n          if (last === mark && !eq(cij, zero)) {\n            // push row & value\n            cindex.push(i);\n            cvalues.push(cij);\n          }\n        }\n      }\n    }\n    // update ptr\n    cptr[bcolumns] = cindex.length;\n\n    // return sparse matrix\n    return c;\n  }\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  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;\n    // validate a matrix\n    if (!avalues) {\n      throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');\n    }\n    // b dense\n    var bdata = b._data;\n    var bdt = b._datatype;\n    // rows & columns\n    var arows = a._size[0];\n    var brows = b._size[0];\n    // result\n    var cvalues = [];\n    var cindex = [];\n    var cptr = [];\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n    // equalScalar signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n    }\n\n    // workspace\n    var x = [];\n    // vector with marks indicating a value x[i] exists in a given column\n    var w = [];\n\n    // update ptr\n    cptr[0] = 0;\n    // rows in b\n    for (var ib = 0; ib < brows; ib++) {\n      // b[ib]\n      var vbi = bdata[ib];\n      // check b[ib] != 0, avoid loops\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];\n          // check value exists in current j\n          if (!w[ia]) {\n            // ia is new entry in j\n            w[ia] = true;\n            // add i to pattern of C\n            cindex.push(ia);\n            // x(ia) = A\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    }\n    // copy values from x to column jb of c\n    for (var p1 = cindex.length, p = 0; p < p1; p++) {\n      // row\n      var ic = cindex[p];\n      // copy value\n      cvalues[p] = x[ic];\n    }\n    // update ptr\n    cptr[1] = cindex.length;\n\n    // return sparse matrix\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, 1],\n      datatype: dt\n    });\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  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;\n    // validate a matrix\n    if (!avalues) {\n      throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');\n    }\n    // b dense\n    var bdata = b._data;\n    var bdt = b._datatype;\n    // rows & columns\n    var arows = a._size[0];\n    var brows = b._size[0];\n    var bcolumns = b._size[1];\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n    // equalScalar signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n    }\n\n    // result\n    var cvalues = [];\n    var cindex = [];\n    var cptr = [];\n    // c matrix\n    var c = a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: dt\n    });\n\n    // workspace\n    var x = [];\n    // vector with marks indicating a value x[i] exists in a given column\n    var w = [];\n\n    // loop b columns\n    for (var jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length;\n      // mark in workspace for current column\n      var mark = jb + 1;\n      // rows in jb\n      for (var ib = 0; ib < brows; ib++) {\n        // b[ib, jb]\n        var vbij = bdata[ib][jb];\n        // check b[ib, jb] != 0, avoid loops\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];\n            // check value exists in current j\n            if (w[ia] !== mark) {\n              // ia is new entry in j\n              w[ia] = mark;\n              // add i to pattern of C\n              cindex.push(ia);\n              // x(ia) = A\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      }\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];\n        // copy value\n        cvalues[p] = x[ic];\n      }\n    }\n    // update ptr\n    cptr[bcolumns] = cindex.length;\n\n    // return sparse matrix\n    return c;\n  }\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  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;\n    // b sparse\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bdt = b._datatype;\n\n    // rows & columns\n    var arows = a._size[0];\n    var bcolumns = b._size[1];\n    // flag indicating both matrices (a & b) contain data\n    var values = avalues && bvalues;\n\n    // datatype\n    var dt;\n    // addScalar signature to use\n    var af = addScalar;\n    // multiplyScalar signature to use\n    var mf = multiplyScalar;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt]);\n      mf = typed.find(multiplyScalar, [dt, dt]);\n    }\n\n    // result\n    var cvalues = values ? [] : undefined;\n    var cindex = [];\n    var cptr = [];\n    // c matrix\n    var c = a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: dt\n    });\n\n    // workspace\n    var x = values ? [] : undefined;\n    // vector with marks indicating a value x[i] exists in a given column\n    var w = [];\n    // variables\n    var ka, ka0, ka1, kb, kb0, kb1, ia, ib;\n    // loop b columns\n    for (var jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length;\n      // mark in workspace for current column\n      var mark = jb + 1;\n      // B values & index in j\n      for (kb0 = bptr[jb], kb1 = bptr[jb + 1], kb = kb0; kb < kb1; kb++) {\n        // b row\n        ib = bindex[kb];\n        // check we need to process values\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];\n            // check value exists in current j\n            if (w[ia] !== mark) {\n              // ia is new entry in j\n              w[ia] = mark;\n              // add i to pattern of C\n              cindex.push(ia);\n              // x(ia) = A\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];\n            // check value exists in current j\n            if (w[ia] !== mark) {\n              // ia is new entry in j\n              w[ia] = mark;\n              // add i to pattern of C\n              cindex.push(ia);\n            }\n          }\n        }\n      }\n      // check we need to process matrix values (pattern matrix)\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];\n          // copy value\n          cvalues[p] = x[ic];\n        }\n      }\n    }\n    // update ptr\n    cptr[bcolumns] = cindex.length;\n\n    // return sparse matrix\n    return c;\n  }\n\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  return typed(name, multiplyScalar, {\n    // we extend the signatures of multiplyScalar with signatures dealing with matrices\n\n    'Array, Array': typed.referTo('Matrix, Matrix', function (selfMM) {\n      return function (x, y) {\n        // check dimensions\n        _validateMatrixDimensions((0, _array.arraySize)(x), (0, _array.arraySize)(y));\n\n        // use dense matrix implementation\n        var m = selfMM(matrix(x), matrix(y));\n        // return array or scalar\n        return (0, _is.isMatrix)(m) ? m.valueOf() : m;\n      };\n    }),\n    'Matrix, Matrix': function MatrixMatrix(x, y) {\n      // dimensions\n      var xsize = x.size();\n      var ysize = y.size();\n\n      // check dimensions\n      _validateMatrixDimensions(xsize, ysize);\n\n      // process dimensions\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        }\n        // Vector * Matrix\n        return _multiplyVectorMatrix(x, y);\n      }\n      // process y dimensions\n      if (ysize.length === 1) {\n        // Matrix * Vector\n        return _multiplyMatrixVector(x, y);\n      }\n      // Matrix * Matrix\n      return _multiplyMatrixMatrix(x, y);\n    },\n    'Matrix, Array': typed.referTo('Matrix,Matrix', function (selfMM) {\n      return function (x, y) {\n        return selfMM(x, matrix(y));\n      };\n    }),\n    'Array, Matrix': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // use Matrix * Matrix implementation\n        return self(matrix(x, y.storage()), y);\n      };\n    }),\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return matAlgo11xS0s(x, y, multiplyScalar, false);\n    },\n    'DenseMatrix, any': function DenseMatrixAny(x, y) {\n      return matAlgo14xDs(x, y, multiplyScalar, false);\n    },\n    'any, SparseMatrix': function anySparseMatrix(x, y) {\n      return matAlgo11xS0s(y, x, multiplyScalar, true);\n    },\n    'any, DenseMatrix': function anyDenseMatrix(x, y) {\n      return matAlgo14xDs(y, x, multiplyScalar, true);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return matAlgo14xDs(matrix(x), y, multiplyScalar, false).valueOf();\n    },\n    'any, Array': function anyArray(x, y) {\n      // use matrix implementation\n      return matAlgo14xDs(matrix(y), x, multiplyScalar, true).valueOf();\n    },\n    'any, any': multiplyScalar,\n    'any, any, ...any': typed.referToSelf(function (self) {\n      return function (x, y, rest) {\n        var result = self(x, y);\n        for (var i = 0; i < rest.length; i++) {\n          result = self(result, rest[i]);\n        }\n        return result;\n      };\n    })\n  });\n});\nexports.createMultiply = createMultiply;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createNthRootNumber = exports.createNthRoot = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _matAlgo01xDSid = require(\"../../type/matrix/utils/matAlgo01xDSid.js\");\nvar _matAlgo02xDS = require(\"../../type/matrix/utils/matAlgo02xDS0.js\");\nvar _matAlgo06xS0S = require(\"../../type/matrix/utils/matAlgo06xS0S0.js\");\nvar _matAlgo11xS0s = require(\"../../type/matrix/utils/matAlgo11xS0s.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'nthRoot';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber', 'concat'];\nvar createNthRoot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    equalScalar = _ref.equalScalar,\n    _BigNumber = _ref.BigNumber,\n    concat = _ref.concat;\n  var matAlgo01xDSid = (0, _matAlgo01xDSid.createMatAlgo01xDSid)({\n    typed: typed\n  });\n  var matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo06xS0S0 = (0, _matAlgo06xS0S.createMatAlgo06xS0S0)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n\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 (since 3^2 == 9)\n   *     math.sqrt(9)          // returns 3 (since 3^2 == 9)\n   *     math.nthRoot(64, 3)   // returns 4 (since 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  function complexErr() {\n    throw new Error('Complex number not supported in function nthRoot. Use nthRoots instead.');\n  }\n  return typed(name, {\n    number: _index.nthRootNumber,\n    'number, number': _index.nthRootNumber,\n    BigNumber: function BigNumber(x) {\n      return _bigNthRoot(x, new _BigNumber(2));\n    },\n    'BigNumber, BigNumber': _bigNthRoot,\n    Complex: complexErr,\n    'Complex, number': complexErr,\n    Array: typed.referTo('DenseMatrix,number', function (selfDn) {\n      return function (x) {\n        return selfDn(matrix(x), 2).valueOf();\n      };\n    }),\n    DenseMatrix: typed.referTo('DenseMatrix,number', function (selfDn) {\n      return function (x) {\n        return selfDn(x, 2);\n      };\n    }),\n    SparseMatrix: typed.referTo('SparseMatrix,number', function (selfSn) {\n      return function (x) {\n        return selfSn(x, 2);\n      };\n    }),\n    'SparseMatrix, SparseMatrix': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // density must be one (no zeros in matrix)\n        if (y.density() === 1) {\n          // sparse + sparse\n          return matAlgo06xS0S0(x, y, self);\n        } else {\n          // throw exception\n          throw new Error('Root must be non-zero');\n        }\n      };\n    }),\n    'DenseMatrix, SparseMatrix': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // density must be one (no zeros in matrix)\n        if (y.density() === 1) {\n          // dense + sparse\n          return matAlgo01xDSid(x, y, self, false);\n        } else {\n          // throw exception\n          throw new Error('Root must be non-zero');\n        }\n      };\n    }),\n    'Array, SparseMatrix': typed.referTo('DenseMatrix,SparseMatrix', function (selfDS) {\n      return function (x, y) {\n        return selfDS(matrix(x), y);\n      };\n    }),\n    'number | BigNumber, SparseMatrix': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // density must be one (no zeros in matrix)\n        if (y.density() === 1) {\n          // sparse - scalar\n          return matAlgo11xS0s(y, x, self, true);\n        } else {\n          // throw exception\n          throw new Error('Root must be non-zero');\n        }\n      };\n    })\n  }, matrixAlgorithmSuite({\n    scalar: 'number | BigNumber',\n    SD: matAlgo02xDS0,\n    Ss: matAlgo11xS0s,\n    sS: false\n  }));\n\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  function _bigNthRoot(a, root) {\n    var precision = _BigNumber.precision;\n    var Big = _BigNumber.clone({\n      precision: precision + 2\n    });\n    var zero = new _BigNumber(0);\n    var one = new Big(1);\n    var inv = root.isNegative();\n    if (inv) {\n      root = root.neg();\n    }\n    if (root.isZero()) {\n      throw new Error('Root must be non-zero');\n    }\n    if (a.isNegative() && !root.abs().mod(2).equals(1)) {\n      throw new Error('Root must be odd when a is negative.');\n    }\n\n    // edge cases zero and infinity\n    if (a.isZero()) {\n      return inv ? new Big(Infinity) : 0;\n    }\n    if (!a.isFinite()) {\n      return inv ? zero : a;\n    }\n    var x = a.abs().pow(one.div(root));\n    // If a < 0, we require that root is an odd integer,\n    // so (-1) ^ (1/root) = -1\n    x = a.isNeg() ? x.neg() : x;\n    return new _BigNumber((inv ? one.div(x) : x).toPrecision(precision));\n  }\n});\nexports.createNthRoot = createNthRoot;\nvar createNthRootNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed'], function (_ref2) {\n  var typed = _ref2.typed;\n  return typed(name, {\n    number: _index.nthRootNumber,\n    'number, number': _index.nthRootNumber\n  });\n});\nexports.createNthRootNumber = createNthRootNumber;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSign = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _collection = require(\"../../utils/collection.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'sign';\nvar dependencies = ['typed', 'BigNumber', 'Fraction', 'complex'];\nvar createSign = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    _BigNumber = _ref.BigNumber,\n    complex = _ref.complex,\n    _Fraction = _ref.Fraction;\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}\n   *            The sign of `x`\n   */\n  return typed(name, {\n    number: _index.signNumber,\n    Complex: function Complex(x) {\n      return x.im === 0 ? complex((0, _index.signNumber)(x.re)) : x.sign();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(x.cmp(0));\n    },\n    Fraction: function Fraction(x) {\n      return new _Fraction(x.s, 1);\n    },\n    // deep map collection, skip zeros since sign(0) = 0\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self, true);\n      };\n    }),\n    Unit: typed.referToSelf(function (self) {\n      return function (x) {\n        if (!x._isDerived() && x.units[0].unit.offset !== 0) {\n          throw new TypeError('sign is ambiguous for units with offset');\n        }\n        return typed.find(self, x.valueType())(x.value);\n      };\n    })\n  });\n});\nexports.createSign = createSign;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSqrt = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'sqrt';\nvar dependencies = ['config', 'typed', 'Complex'];\nvar createSqrt = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var config = _ref.config,\n    typed = _ref.typed,\n    Complex = _ref.Complex;\n  /**\n   * Calculate the square root of a value.\n   *\n   * For matrices, if you want the matrix square root of a square matrix,\n   * use the `sqrtm` function. If you wish to apply `sqrt` elementwise to\n   * a matrix M, use `math.map(M, math.sqrt)`.\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 | Unit} x\n   *            Value for which to calculate the square root.\n   * @return {number | BigNumber | Complex | Unit}\n   *            Returns the square root of `x`\n   */\n  return 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    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  /**\n   * Calculate sqrt for a number\n   * @param {number} x\n   * @returns {number | Complex} Returns the square root of x\n   * @private\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 Complex(x, 0).sqrt();\n    }\n  }\n});\nexports.createSqrt = createSqrt;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSquare = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'square';\nvar dependencies = ['typed'];\nvar createSquare = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\n  /**\n   * Compute the square of a value, `x * x`.\n   * To avoid confusion with multiplying a square matrix by itself,\n   * this function does not apply to matrices. If you wish to square\n   * every element of a matrix, see the examples.\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.map([1, 2, 3, 4], math.square)  // returns Array [1, 4, 9, 16]\n   *\n   * See also:\n   *\n   *    multiply, cube, sqrt, pow\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit} x\n   *            Number for which to calculate the square\n   * @return {number | BigNumber | Fraction | Complex | Unit}\n   *            Squared value\n   */\n  return typed(name, {\n    number: _index.squareNumber,\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    Unit: function Unit(x) {\n      return x.pow(2);\n    }\n  });\n});\nexports.createSquare = createSquare;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSubtract = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _matAlgo01xDSid = require(\"../../type/matrix/utils/matAlgo01xDSid.js\");\nvar _matAlgo03xDSf = require(\"../../type/matrix/utils/matAlgo03xDSf.js\");\nvar _matAlgo05xSfSf = require(\"../../type/matrix/utils/matAlgo05xSfSf.js\");\nvar _matAlgo10xSids = require(\"../../type/matrix/utils/matAlgo10xSids.js\");\nvar _matAlgo12xSfs = require(\"../../type/matrix/utils/matAlgo12xSfs.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar name = 'subtract';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'addScalar', 'unaryMinus', 'DenseMatrix', 'concat'];\nvar createSubtract = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    equalScalar = _ref.equalScalar,\n    addScalar = _ref.addScalar,\n    unaryMinus = _ref.unaryMinus,\n    DenseMatrix = _ref.DenseMatrix,\n    concat = _ref.concat;\n  // TODO: split function subtract in two: subtract and subtractScalar\n\n  var matAlgo01xDSid = (0, _matAlgo01xDSid.createMatAlgo01xDSid)({\n    typed: typed\n  });\n  var matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({\n    typed: typed\n  });\n  var matAlgo05xSfSf = (0, _matAlgo05xSfSf.createMatAlgo05xSfSf)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo10xSids = (0, _matAlgo10xSids.createMatAlgo10xSids)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\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  return typed(name, {\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': typed.referToSelf(function (self) {\n      return function (x, y) {\n        if (x.value === null) {\n          throw new Error('Parameter x contains a unit with undefined value');\n        }\n        if (y.value === null) {\n          throw new Error('Parameter y contains a unit with undefined value');\n        }\n        if (!x.equalBase(y)) {\n          throw new Error('Units do not match');\n        }\n        var res = x.clone();\n        res.value = typed.find(self, [res.valueType(), y.valueType()])(res.value, y.value);\n        res.fixPrefix = false;\n        return res;\n      };\n    })\n  }, matrixAlgorithmSuite({\n    SS: matAlgo05xSfSf,\n    DS: matAlgo01xDSid,\n    SD: matAlgo03xDSf,\n    Ss: matAlgo12xSfs,\n    sS: matAlgo10xSids\n  }));\n});\nexports.createSubtract = createSubtract;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createXgcd = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'xgcd';\nvar dependencies = ['typed', 'config', 'matrix', 'BigNumber'];\nvar createXgcd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    matrix = _ref.matrix,\n    BigNumber = _ref.BigNumber;\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  return typed(name, {\n    'number, number': function numberNumber(a, b) {\n      var res = (0, _index.xgcdNumber)(a, b);\n      return config.matrix === 'Array' ? res : matrix(res);\n    },\n    'BigNumber, BigNumber': _xgcdBigNumber\n    // TODO: implement support for Fraction\n  });\n\n  /**\n   * Calculate xgcd for two BigNumbers\n   * @param {BigNumber} a\n   * @param {BigNumber} b\n   * @return {BigNumber[]} result\n   * @private\n   */\n  function _xgcdBigNumber(a, b) {\n    // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm\n    var\n    // used to swap two variables\n    t;\n    var\n    // quotient\n    q;\n    var\n    // remainder\n    r;\n    var zero = new BigNumber(0);\n    var one = new BigNumber(1);\n    var x = zero;\n    var lastx = one;\n    var y = one;\n    var lasty = zero;\n    if (!a.isInt() || !b.isInt()) {\n      throw new Error('Parameters in function xgcd must be integer numbers');\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    var res;\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    return config.matrix === 'Array' ? res : matrix(res);\n  }\n});\nexports.createXgcd = createXgcd;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createInvmod = void 0;\nvar _slicedToArray2 = _interopRequireDefault(require(\"@babel/runtime/helpers/slicedToArray\"));\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'invmod';\nvar dependencies = ['typed', 'config', 'BigNumber', 'xgcd', 'equal', 'smaller', 'mod', 'add', 'isInteger'];\nvar createInvmod = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    BigNumber = _ref.BigNumber,\n    xgcd = _ref.xgcd,\n    equal = _ref.equal,\n    smaller = _ref.smaller,\n    mod = _ref.mod,\n    add = _ref.add,\n    isInteger = _ref.isInteger;\n  /**\n   * Calculate the (modular) multiplicative inverse of a modulo b. Solution to the equation `ax ≣ 1 (mod b)`\n   * See https://en.wikipedia.org/wiki/Modular_multiplicative_inverse.\n   *\n   * Syntax:\n   *\n   *    math.invmod(a, b)\n   *\n   * Examples:\n   *\n   *    math.invmod(8, 12)             // returns NaN\n   *    math.invmod(7, 13)             // returns 2\n   *    math.invmod(15151, 15122)      // returns 10429\n   *\n   * See also:\n   *\n   *    gcd, xgcd\n   *\n   * @param {number | BigNumber} a  An integer number\n   * @param {number | BigNumber} b  An integer number\n   * @return {number | BigNumber }  Returns an integer number\n   *                              where `invmod(a,b)*a ≣ 1 (mod b)`\n   */\n  return typed(name, {\n    'number, number': invmod,\n    'BigNumber, BigNumber': invmod\n  });\n  function invmod(a, b) {\n    if (!isInteger(a) || !isInteger(b)) throw new Error('Parameters in function invmod must be integer numbers');\n    a = mod(a, b);\n    if (equal(b, 0)) throw new Error('Divisor must be non zero');\n    var res = xgcd(a, b);\n    res = res.valueOf();\n    var _res = res,\n      _res2 = (0, _slicedToArray2[\"default\"])(_res, 2),\n      gcd = _res2[0],\n      inv = _res2[1];\n    if (!equal(gcd, BigNumber(1))) return NaN;\n    inv = mod(inv, b);\n    if (smaller(inv, BigNumber(0))) inv = add(inv, b);\n    return inv;\n  }\n});\nexports.createInvmod = createInvmod;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMatAlgo09xS0Sf = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar _DimensionError = require(\"../../../error/DimensionError.js\");\nvar name = 'matAlgo09xS0Sf';\nvar dependencies = ['typed', 'equalScalar'];\nvar createMatAlgo09xS0Sf = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    equalScalar = _ref.equalScalar;\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  return function matAlgo09xS0Sf(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;\n    // sparse matrix arrays\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;\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new _DimensionError.DimensionError(asize.length, bsize.length);\n    }\n\n    // check rows & columns\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    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt;\n      // find signature that matches (dt, dt)\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result arrays\n    var cvalues = avalues && bvalues ? [] : undefined;\n    var cindex = [];\n    var cptr = [];\n\n    // workspaces\n    var x = cvalues ? [] : undefined;\n    // marks indicating we have a value in x for a given column\n    var w = [];\n\n    // vars\n    var i, j, k, k0, k1;\n\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length;\n      // column mark\n      var mark = j + 1;\n      // check we need to process values\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];\n          // update workspace\n          w[i] = mark;\n          x[i] = bvalues[k];\n        }\n      }\n      // loop A(:,j)\n      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = aindex[k];\n        // check we need to process values\n        if (x) {\n          // b value @ i,j\n          var vb = w[i] === mark ? x[i] : zero;\n          // invoke f\n          var vc = cf(avalues[k], vb);\n          // check zero value\n          if (!eq(vc, zero)) {\n            // push index\n            cindex.push(i);\n            // push value\n            cvalues.push(vc);\n          }\n        } else {\n          // push index\n          cindex.push(i);\n        }\n      }\n    }\n    // update cptr\n    cptr[columns] = cindex.length;\n\n    // return sparse matrix\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});\nexports.createMatAlgo09xS0Sf = createMatAlgo09xS0Sf;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createDotMultiply = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _matAlgo02xDS = require(\"../../type/matrix/utils/matAlgo02xDS0.js\");\nvar _matAlgo09xS0Sf = require(\"../../type/matrix/utils/matAlgo09xS0Sf.js\");\nvar _matAlgo11xS0s = require(\"../../type/matrix/utils/matAlgo11xS0s.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar name = 'dotMultiply';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'multiplyScalar', 'concat'];\nvar createDotMultiply = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    equalScalar = _ref.equalScalar,\n    multiplyScalar = _ref.multiplyScalar,\n    concat = _ref.concat;\n  var matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo09xS0Sf = (0, _matAlgo09xS0Sf.createMatAlgo09xS0Sf)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n\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  return typed(name, matrixAlgorithmSuite({\n    elop: multiplyScalar,\n    SS: matAlgo09xS0Sf,\n    DS: matAlgo02xDS0,\n    Ss: matAlgo11xS0s\n  }));\n});\nexports.createDotMultiply = createDotMultiply;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.bitAndBigNumber = bitAndBigNumber;\nexports.bitNotBigNumber = bitNotBigNumber;\nexports.bitOrBigNumber = bitOrBigNumber;\nexports.bitXor = bitXor;\nexports.bitwise = bitwise;\nexports.leftShiftBigNumber = leftShiftBigNumber;\nexports.rightArithShiftBigNumber = rightArithShiftBigNumber;\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 */\nfunction bitAndBigNumber(x, y) {\n  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {\n    throw new Error('Integers expected in function bitAnd');\n  }\n  var BigNumber = x.constructor;\n  if (x.isNaN() || y.isNaN()) {\n    return new BigNumber(NaN);\n  }\n  if (x.isZero() || y.eq(-1) || x.eq(y)) {\n    return x;\n  }\n  if (y.isZero() || x.eq(-1)) {\n    return y;\n  }\n  if (!x.isFinite() || !y.isFinite()) {\n    if (!x.isFinite() && !y.isFinite()) {\n      if (x.isNegative() === y.isNegative()) {\n        return x;\n      }\n      return new BigNumber(0);\n    }\n    if (!x.isFinite()) {\n      if (y.isNegative()) {\n        return x;\n      }\n      if (x.isNegative()) {\n        return new BigNumber(0);\n      }\n      return y;\n    }\n    if (!y.isFinite()) {\n      if (x.isNegative()) {\n        return y;\n      }\n      if (y.isNegative()) {\n        return new BigNumber(0);\n      }\n      return x;\n    }\n  }\n  return bitwise(x, y, function (a, b) {\n    return a & b;\n  });\n}\n\n/**\n * Bitwise not\n * @param {BigNumber} x\n * @return {BigNumber} Result of ~`x`, fully precise\n *\n */\nfunction bitNotBigNumber(x) {\n  if (x.isFinite() && !x.isInteger()) {\n    throw new Error('Integer expected in function bitNot');\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}\n\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 */\nfunction bitOrBigNumber(x, y) {\n  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {\n    throw new Error('Integers expected in function bitOr');\n  }\n  var BigNumber = x.constructor;\n  if (x.isNaN() || y.isNaN()) {\n    return new BigNumber(NaN);\n  }\n  var negOne = new BigNumber(-1);\n  if (x.isZero() || y.eq(negOne) || x.eq(y)) {\n    return y;\n  }\n  if (y.isZero() || x.eq(negOne)) {\n    return x;\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    if (x.isNegative() && y.isNegative()) {\n      return x.isFinite() ? x : y;\n    }\n    return x.isFinite() ? y : x;\n  }\n  return bitwise(x, y, function (a, b) {\n    return a | b;\n  });\n}\n\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 */\nfunction 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  if (xSign) {\n    xBits = decCoefficientToBinaryString(bitNotBigNumber(x));\n    for (var i = 0; i < xBits.length; ++i) {\n      xBits[i] ^= 1;\n    }\n  } else {\n    xBits = decCoefficientToBinaryString(x);\n  }\n  if (ySign) {\n    yBits = decCoefficientToBinaryString(bitNotBigNumber(y));\n    for (var _i = 0; _i < yBits.length; ++_i) {\n      yBits[_i] ^= 1;\n    }\n  } else {\n    yBits = decCoefficientToBinaryString(y);\n  }\n  var minBits, maxBits, minSign;\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  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  while (shortLen > 0) {\n    if (func(minBits[--shortLen], maxBits[--longLen]) === expFuncVal) {\n      outVal = outVal.plus(twoPower);\n    }\n    twoPower = twoPower.times(two);\n  }\n  while (longLen > 0) {\n    if (func(minSign, maxBits[--longLen]) === expFuncVal) {\n      outVal = outVal.plus(twoPower);\n    }\n    twoPower = twoPower.times(two);\n  }\n  BigNumber.config({\n    precision: prevPrec\n  });\n  if (expFuncVal === 0) {\n    outVal.s = -outVal.s;\n  }\n  return outVal;\n}\n\n/* Extracted from decimal.js, and edited to specialize. */\nfunction decCoefficientToBinaryString(x) {\n  // Convert to string\n  var a = x.d; // array with digits\n  var r = a[0] + '';\n  for (var i = 1; i < a.length; ++i) {\n    var s = a[i] + '';\n    for (var z = 7 - s.length; z--;) {\n      s = '0' + s;\n    }\n    r += s;\n  }\n  var j = r.length;\n  while (r.charAt(j) === '0') {\n    j--;\n  }\n  var xe = x.e;\n  var str = r.slice(0, j + 1 || 1);\n  var strL = str.length;\n  if (xe > 0) {\n    if (++xe > strL) {\n      // Append zeros.\n      xe -= strL;\n      while (xe--) {\n        str += '0';\n      }\n    } else if (xe < strL) {\n      str = str.slice(0, xe) + '.' + str.slice(xe);\n    }\n  }\n\n  // Convert from base 10 (decimal) to base 2\n  var arr = [0];\n  for (var _i2 = 0; _i2 < str.length;) {\n    var arrL = arr.length;\n    while (arrL--) {\n      arr[arrL] *= 10;\n    }\n    arr[0] += parseInt(str.charAt(_i2++)); // convert to int\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        arr[_j + 1] += arr[_j] >> 1;\n        arr[_j] &= 1;\n      }\n    }\n  }\n  return arr.reverse();\n}\n\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 */\nfunction bitXor(x, y) {\n  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {\n    throw new Error('Integers expected in function bitXor');\n  }\n  var BigNumber = x.constructor;\n  if (x.isNaN() || y.isNaN()) {\n    return new BigNumber(NaN);\n  }\n  if (x.isZero()) {\n    return y;\n  }\n  if (y.isZero()) {\n    return x;\n  }\n  if (x.eq(y)) {\n    return new BigNumber(0);\n  }\n  var negOne = new BigNumber(-1);\n  if (x.eq(negOne)) {\n    return bitNotBigNumber(y);\n  }\n  if (y.eq(negOne)) {\n    return bitNotBigNumber(x);\n  }\n  if (!x.isFinite() || !y.isFinite()) {\n    if (!x.isFinite() && !y.isFinite()) {\n      return negOne;\n    }\n    return new BigNumber(x.isNegative() === y.isNegative() ? Infinity : -Infinity);\n  }\n  return bitwise(x, y, function (a, b) {\n    return a ^ b;\n  });\n}\n\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 */\nfunction leftShiftBigNumber(x, y) {\n  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {\n    throw new Error('Integers expected in function leftShift');\n  }\n  var BigNumber = x.constructor;\n  if (x.isNaN() || y.isNaN() || y.isNegative() && !y.isZero()) {\n    return new BigNumber(NaN);\n  }\n  if (x.isZero() || y.isZero()) {\n    return x;\n  }\n  if (!x.isFinite() && !y.isFinite()) {\n    return new BigNumber(NaN);\n  }\n\n  // Math.pow(2, y) is fully precise for y < 55, and fast\n  if (y.lt(55)) {\n    return x.times(Math.pow(2, y.toNumber()) + '');\n  }\n  return x.times(new BigNumber(2).pow(y));\n}\n\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 */\nfunction rightArithShiftBigNumber(x, y) {\n  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {\n    throw new Error('Integers expected in function rightArithShift');\n  }\n  var BigNumber = x.constructor;\n  if (x.isNaN() || y.isNaN() || y.isNegative() && !y.isZero()) {\n    return new BigNumber(NaN);\n  }\n  if (x.isZero() || y.isZero()) {\n    return x;\n  }\n  if (!y.isFinite()) {\n    if (x.isNegative()) {\n      return new BigNumber(-1);\n    }\n    if (!x.isFinite()) {\n      return new BigNumber(NaN);\n    }\n    return new BigNumber(0);\n  }\n\n  // Math.pow(2, y) is fully precise for y < 55, and fast\n  if (y.lt(55)) {\n    return x.div(Math.pow(2, y.toNumber()) + '').floor();\n  }\n  return x.div(new BigNumber(2).pow(y)).floor();\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createBitAnd = void 0;\nvar _bitwise = require(\"../../utils/bignumber/bitwise.js\");\nvar _matAlgo02xDS = require(\"../../type/matrix/utils/matAlgo02xDS0.js\");\nvar _matAlgo11xS0s = require(\"../../type/matrix/utils/matAlgo11xS0s.js\");\nvar _matAlgo06xS0S = require(\"../../type/matrix/utils/matAlgo06xS0S0.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'bitAnd';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'concat'];\nvar createBitAnd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    equalScalar = _ref.equalScalar,\n    concat = _ref.concat;\n  var matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo06xS0S0 = (0, _matAlgo06xS0S.createMatAlgo06xS0S0)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n\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  return typed(name, {\n    'number, number': _index.bitAndNumber,\n    'BigNumber, BigNumber': _bitwise.bitAndBigNumber\n  }, matrixAlgorithmSuite({\n    SS: matAlgo06xS0S0,\n    DS: matAlgo02xDS0,\n    Ss: matAlgo11xS0s\n  }));\n});\nexports.createBitAnd = createBitAnd;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createBitNot = void 0;\nvar _bitwise = require(\"../../utils/bignumber/bitwise.js\");\nvar _collection = require(\"../../utils/collection.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'bitNot';\nvar dependencies = ['typed'];\nvar createBitNot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\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  return typed(name, {\n    number: _index.bitNotNumber,\n    BigNumber: _bitwise.bitNotBigNumber,\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self);\n      };\n    })\n  });\n});\nexports.createBitNot = createBitNot;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createBitOr = void 0;\nvar _bitwise = require(\"../../utils/bignumber/bitwise.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _matAlgo10xSids = require(\"../../type/matrix/utils/matAlgo10xSids.js\");\nvar _matAlgo04xSidSid = require(\"../../type/matrix/utils/matAlgo04xSidSid.js\");\nvar _matAlgo01xDSid = require(\"../../type/matrix/utils/matAlgo01xDSid.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'bitOr';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix', 'concat'];\nvar createBitOr = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    equalScalar = _ref.equalScalar,\n    DenseMatrix = _ref.DenseMatrix,\n    concat = _ref.concat;\n  var matAlgo01xDSid = (0, _matAlgo01xDSid.createMatAlgo01xDSid)({\n    typed: typed\n  });\n  var matAlgo04xSidSid = (0, _matAlgo04xSidSid.createMatAlgo04xSidSid)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo10xSids = (0, _matAlgo10xSids.createMatAlgo10xSids)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n\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  return typed(name, {\n    'number, number': _index.bitOrNumber,\n    'BigNumber, BigNumber': _bitwise.bitOrBigNumber\n  }, matrixAlgorithmSuite({\n    SS: matAlgo04xSidSid,\n    DS: matAlgo01xDSid,\n    Ss: matAlgo10xSids\n  }));\n});\nexports.createBitOr = createBitOr;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMatAlgo07xSSf = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar _DimensionError = require(\"../../../error/DimensionError.js\");\nvar name = 'matAlgo07xSSf';\nvar dependencies = ['typed', 'DenseMatrix'];\nvar createMatAlgo07xSSf = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    DenseMatrix = _ref.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  return function matAlgo07xSSf(a, b, callback) {\n    // sparse matrix arrays\n    var asize = a._size;\n    var adt = a._datatype;\n    // sparse matrix arrays\n    var bsize = b._size;\n    var bdt = b._datatype;\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new _DimensionError.DimensionError(asize.length, bsize.length);\n    }\n\n    // check rows & columns\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    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // zero value\n    var zero = 0;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt;\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // vars\n    var i, j;\n\n    // result arrays\n    var cdata = [];\n    // initialize c\n    for (i = 0; i < rows; i++) {\n      cdata[i] = [];\n    }\n\n    // workspaces\n    var xa = [];\n    var xb = [];\n    // marks indicating we have a value in x for a given column\n    var wa = [];\n    var wb = [];\n\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // columns mark\n      var mark = j + 1;\n      // scatter the values of A(:,j) into workspace\n      _scatter(a, j, wa, xa, mark);\n      // scatter the values of B(:,j) into workspace\n      _scatter(b, j, wb, xb, mark);\n      // loop rows\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;\n        // invoke callback\n        cdata[i][j] = cf(va, vb);\n      }\n    }\n\n    // return dense matrix\n    return new DenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\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;\n    // loop values in column j\n    for (var k = ptr[j], k1 = ptr[j + 1]; k < k1; k++) {\n      // row\n      var i = index[k];\n      // update workspace\n      w[i] = mark;\n      x[i] = values[k];\n    }\n  }\n});\nexports.createMatAlgo07xSSf = createMatAlgo07xSSf;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createBitXor = void 0;\nvar _bitwise = require(\"../../utils/bignumber/bitwise.js\");\nvar _matAlgo03xDSf = require(\"../../type/matrix/utils/matAlgo03xDSf.js\");\nvar _matAlgo07xSSf = require(\"../../type/matrix/utils/matAlgo07xSSf.js\");\nvar _matAlgo12xSfs = require(\"../../type/matrix/utils/matAlgo12xSfs.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'bitXor';\nvar dependencies = ['typed', 'matrix', 'DenseMatrix', 'concat'];\nvar createBitXor = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    DenseMatrix = _ref.DenseMatrix,\n    concat = _ref.concat;\n  var matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({\n    typed: typed\n  });\n  var matAlgo07xSSf = (0, _matAlgo07xSSf.createMatAlgo07xSSf)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n\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  return typed(name, {\n    'number, number': _index.bitXorNumber,\n    'BigNumber, BigNumber': _bitwise.bitXor\n  }, matrixAlgorithmSuite({\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo12xSfs\n  }));\n});\nexports.createBitXor = createBitXor;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createArg = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _collection = require(\"../../utils/collection.js\");\nvar name = 'arg';\nvar dependencies = ['typed'];\nvar createArg = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.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  return typed(name, {\n    number: function number(x) {\n      return Math.atan2(0, x);\n    },\n    BigNumber: function BigNumber(x) {\n      return x.constructor.atan2(0, x);\n    },\n    Complex: function Complex(x) {\n      return x.arg();\n    },\n    // TODO: implement BigNumber support for function arg\n\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self);\n      };\n    })\n  });\n});\nexports.createArg = createArg;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createConj = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _collection = require(\"../../utils/collection.js\");\nvar name = 'conj';\nvar dependencies = ['typed'];\nvar createConj = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.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  return typed(name, {\n    'number | BigNumber | Fraction': function numberBigNumberFraction(x) {\n      return x;\n    },\n    Complex: function Complex(x) {\n      return x.conjugate();\n    },\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self);\n      };\n    })\n  });\n});\nexports.createConj = createConj;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createIm = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _collection = require(\"../../utils/collection.js\");\nvar name = 'im';\nvar dependencies = ['typed'];\nvar createIm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.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  return typed(name, {\n    number: function number() {\n      return 0;\n    },\n    'BigNumber | Fraction': function BigNumberFraction(x) {\n      return x.mul(0);\n    },\n    Complex: function Complex(x) {\n      return x.im;\n    },\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self);\n      };\n    })\n  });\n});\nexports.createIm = createIm;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createRe = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _collection = require(\"../../utils/collection.js\");\nvar name = 're';\nvar dependencies = ['typed'];\nvar createRe = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.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  return typed(name, {\n    'number | BigNumber | Fraction': function numberBigNumberFraction(x) {\n      return x;\n    },\n    Complex: function Complex(x) {\n      return x.re;\n    },\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self);\n      };\n    })\n  });\n});\nexports.createRe = createRe;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createNot = void 0;\nvar _collection = require(\"../../utils/collection.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'not';\nvar dependencies = ['typed'];\nvar createNot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\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  return typed(name, {\n    'null | undefined': function nullUndefined() {\n      return true;\n    },\n    number: _index.notNumber,\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: typed.referToSelf(function (self) {\n      return function (x) {\n        return typed.find(self, x.valueType())(x.value);\n      };\n    }),\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self);\n      };\n    })\n  });\n});\nexports.createNot = createNot;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createOr = void 0;\nvar _matAlgo03xDSf = require(\"../../type/matrix/utils/matAlgo03xDSf.js\");\nvar _matAlgo12xSfs = require(\"../../type/matrix/utils/matAlgo12xSfs.js\");\nvar _matAlgo05xSfSf = require(\"../../type/matrix/utils/matAlgo05xSfSf.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'or';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix', 'concat'];\nvar createOr = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    equalScalar = _ref.equalScalar,\n    DenseMatrix = _ref.DenseMatrix,\n    concat = _ref.concat;\n  var matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({\n    typed: typed\n  });\n  var matAlgo05xSfSf = (0, _matAlgo05xSfSf.createMatAlgo05xSfSf)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n\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  return typed(name, {\n    'number, number': _index.orNumber,\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': typed.referToSelf(function (self) {\n      return function (x, y) {\n        return self(x.value || 0, y.value || 0);\n      };\n    })\n  }, matrixAlgorithmSuite({\n    SS: matAlgo05xSfSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo12xSfs\n  }));\n});\nexports.createOr = createOr;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createXor = void 0;\nvar _matAlgo03xDSf = require(\"../../type/matrix/utils/matAlgo03xDSf.js\");\nvar _matAlgo07xSSf = require(\"../../type/matrix/utils/matAlgo07xSSf.js\");\nvar _matAlgo12xSfs = require(\"../../type/matrix/utils/matAlgo12xSfs.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'xor';\nvar dependencies = ['typed', 'matrix', 'DenseMatrix', 'concat'];\nvar createXor = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    DenseMatrix = _ref.DenseMatrix,\n    concat = _ref.concat;\n  var matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({\n    typed: typed\n  });\n  var matAlgo07xSSf = (0, _matAlgo07xSSf.createMatAlgo07xSSf)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n\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  return typed(name, {\n    'number, number': _index.xorNumber,\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': typed.referToSelf(function (self) {\n      return function (x, y) {\n        return self(x.value || 0, y.value || 0);\n      };\n    })\n  }, matrixAlgorithmSuite({\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo12xSfs\n  }));\n});\nexports.createXor = createXor;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createConcat = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _object = require(\"../../utils/object.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _IndexError = require(\"../../error/IndexError.js\");\nvar _DimensionError = require(\"../../error/DimensionError.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'concat';\nvar dependencies = ['typed', 'matrix', 'isInteger'];\nvar createConcat = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    isInteger = _ref.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  return typed(name, {\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      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];\n\n        // test whether we need to return a Matrix (if not we return an Array)\n        if ((0, _is.isMatrix)(arg)) {\n          asMatrix = true;\n        }\n        if ((0, _is.isNumber)(arg) || (0, _is.isBigNumber)(arg)) {\n          if (i !== len - 1) {\n            throw new Error('Dimension must be specified as last argument');\n          }\n\n          // last argument contains the dimension on which to concatenate\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          if (dim < 0 || i > 0 && dim > prevDim) {\n            // TODO: would be more clear when throwing a DimensionError here\n            throw new _IndexError.IndexError(dim, prevDim + 1);\n          }\n        } else {\n          // this is a matrix or array\n          var m = (0, _object.clone)(arg).valueOf();\n          var size = (0, _array.arraySize)(m);\n          matrices[i] = m;\n          prevDim = dim;\n          dim = size.length - 1;\n\n          // verify whether each of the matrices has the same number of dimensions\n          if (i > 0 && dim !== prevDim) {\n            throw new _DimensionError.DimensionError(prevDim + 1, dim + 1);\n          }\n        }\n      }\n      if (matrices.length === 0) {\n        throw new SyntaxError('At least one matrix expected');\n      }\n      var res = matrices.shift();\n      while (matrices.length) {\n        res = _concat(res, matrices.shift(), dim, 0);\n      }\n      return asMatrix ? matrix(res) : res;\n    },\n    '...string': function string(args) {\n      return args.join('');\n    }\n  });\n});\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 */\nexports.createConcat = createConcat;\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.DimensionError(a.length, b.length);\n    }\n    var c = [];\n    for (var i = 0; i < a.length; i++) {\n      c[i] = _concat(a[i], b[i], concatDim, dim + 1);\n    }\n    return c;\n  } else {\n    // concatenate this dimension\n    return a.concat(b);\n  }\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createColumn = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _is = require(\"../../utils/is.js\");\nvar _object = require(\"../../utils/object.js\");\nvar _array = require(\"../../utils/array.js\");\nvar name = 'column';\nvar dependencies = ['typed', 'Index', 'matrix', 'range'];\nvar createColumn = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    Index = _ref.Index,\n    matrix = _ref.matrix,\n    range = _ref.range;\n  /**\n   * Return a column from a Matrix.\n   *\n   * Syntax:\n   *\n   *     math.column(value, index)\n   *\n   * Example:\n   *\n   *     // get a column\n   *     const d = [[1, 2], [3, 4]]\n   *     math.column(d, 1) // returns [[2], [4]]\n   *\n   * See also:\n   *\n   *     row\n   *\n   * @param {Array | Matrix } value   An array or matrix\n   * @param {number} column           The index of the column\n   * @return {Array | Matrix}         The retrieved column\n   */\n  return typed(name, {\n    'Matrix, number': _column,\n    'Array, number': function ArrayNumber(value, column) {\n      return _column(matrix((0, _object.clone)(value)), column).valueOf();\n    }\n  });\n\n  /**\n   * Retrieve a column of a matrix\n   * @param {Matrix } value  A matrix\n   * @param {number} column  The index of the column\n   * @return {Matrix}        The retrieved column\n   */\n  function _column(value, column) {\n    // check dimensions\n    if (value.size().length !== 2) {\n      throw new Error('Only two dimensional matrix is supported');\n    }\n    (0, _array.validateIndex)(column, value.size()[1]);\n    var rowRange = range(0, value.size()[0]);\n    var index = new Index(rowRange, column);\n    var result = value.subset(index);\n    return (0, _is.isMatrix)(result) ? result : matrix([[result]]);\n  }\n});\nexports.createColumn = createColumn;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCount = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'count';\nvar dependencies = ['typed', 'size', 'prod'];\nvar createCount = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    size = _ref.size,\n    prod = _ref.prod;\n  /**\n   * Count the number of elements of a matrix, array or string.\n   *\n   * Syntax:\n   *\n   *     math.count(x)\n   *\n   * Examples:\n   *\n   *     math.count('hello world')        // returns 11\n   *     const A = [[1, 2, 3], [4, 5, 6]]\n   *     math.count(A)                    // returns 6\n   *     math.count(math.range(1,6))      // returns 5\n   *\n   * See also:\n   *\n   *     size\n   *\n   * @param {string | Array | Matrix} x  A matrix or string\n   * @return {number} An integer with the elements in `x`.\n   */\n  return typed(name, {\n    string: function string(x) {\n      return x.length;\n    },\n    'Matrix | Array': function MatrixArray(x) {\n      return prod(size(x));\n    }\n  });\n});\nexports.createCount = createCount;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCross = void 0;\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'cross';\nvar dependencies = ['typed', 'matrix', 'subtract', 'multiply'];\nvar createCross = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    subtract = _ref.subtract,\n    multiply = _ref.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  return typed(name, {\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\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  function _cross(x, y) {\n    var highestDimension = Math.max((0, _array.arraySize)(x).length, (0, _array.arraySize)(y).length);\n    x = (0, _array.squeeze)(x);\n    y = (0, _array.squeeze)(y);\n    var xSize = (0, _array.arraySize)(x);\n    var ySize = (0, _array.arraySize)(y);\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    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    if (highestDimension > 1) {\n      return [product];\n    } else {\n      return product;\n    }\n  }\n});\nexports.createCross = createCross;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createDiag = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _number = require(\"../../utils/number.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'diag';\nvar dependencies = ['typed', 'matrix', 'DenseMatrix', 'SparseMatrix'];\nvar createDiag = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    DenseMatrix = _ref.DenseMatrix,\n    SparseMatrix = _ref.SparseMatrix;\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  return typed(name, {\n    // FIXME: simplify this huge amount of signatures as soon as typed-function supports optional arguments\n\n    Array: function Array(x) {\n      return _diag(x, 0, (0, _array.arraySize)(x), null);\n    },\n    'Array, number': function ArrayNumber(x, k) {\n      return _diag(x, k, (0, _array.arraySize)(x), null);\n    },\n    'Array, BigNumber': function ArrayBigNumber(x, k) {\n      return _diag(x, k.toNumber(), (0, _array.arraySize)(x), null);\n    },\n    'Array, string': function ArrayString(x, format) {\n      return _diag(x, 0, (0, _array.arraySize)(x), format);\n    },\n    'Array, number, string': function ArrayNumberString(x, k, format) {\n      return _diag(x, k, (0, _array.arraySize)(x), format);\n    },\n    'Array, BigNumber, string': function ArrayBigNumberString(x, k, format) {\n      return _diag(x, k.toNumber(), (0, _array.arraySize)(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\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  function _diag(x, k, size, format) {\n    if (!(0, _number.isInteger)(k)) {\n      throw new TypeError('Second parameter in function diag must be an integer');\n    }\n    var kSuper = k > 0 ? k : 0;\n    var kSub = k < 0 ? -k : 0;\n\n    // check dimensions\n    switch (size.length) {\n      case 1:\n        return _createDiagonalMatrix(x, k, format, size[0], kSub, kSuper);\n      case 2:\n        return _getDiagonal(x, k, format, size, kSub, kSuper);\n    }\n    throw new RangeError('Matrix for function diag must be 2 dimensional');\n  }\n  function _createDiagonalMatrix(x, k, format, l, kSub, kSuper) {\n    // matrix size\n    var ms = [l + kSub, l + kSuper];\n    if (format && format !== 'sparse' && format !== 'dense') {\n      throw new TypeError(\"Unknown matrix type \".concat(format, \"\\\"\"));\n    }\n\n    // create diagonal matrix\n    var m = format === 'sparse' ? SparseMatrix.diagonal(ms, x, k) : DenseMatrix.diagonal(ms, x, k);\n    // check we need to return a matrix\n    return format !== null ? m : m.valueOf();\n  }\n  function _getDiagonal(x, k, format, s, kSub, kSuper) {\n    // check x is a Matrix\n    if ((0, _is.isMatrix)(x)) {\n      // get diagonal matrix\n      var dm = x.diagonal(k);\n      // check we need to return a matrix\n      if (format !== null) {\n        // check we need to change matrix format\n        if (format !== dm.storage()) {\n          return matrix(dm, format);\n        }\n        return dm;\n      }\n      return dm.valueOf();\n    }\n    // vector size\n    var n = Math.min(s[0] - kSub, s[1] - kSuper);\n    // diagonal values\n    var vector = [];\n    // loop diagonal\n    for (var i = 0; i < n; i++) {\n      vector[i] = x[i + kSub][i + kSuper];\n    }\n    // check we need to return a matrix\n    return format !== null ? matrix(vector) : vector;\n  }\n});\nexports.createDiag = createDiag;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createFilter = void 0;\nvar _array = require(\"../../utils/array.js\");\nvar _function = require(\"../../utils/function.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'filter';\nvar dependencies = ['typed'];\nvar createFilter = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\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  return typed('filter', {\n    'Array, function': _filterCallback,\n    'Matrix, function': function MatrixFunction(x, test) {\n      return x.create(_filterCallback(x.toArray(), test));\n    },\n    'Array, RegExp': _array.filterRegExp,\n    'Matrix, RegExp': function MatrixRegExp(x, test) {\n      return x.create((0, _array.filterRegExp)(x.toArray(), test));\n    }\n  });\n});\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 */\nexports.createFilter = createFilter;\nfunction _filterCallback(x, callback) {\n  // figure out what number of arguments the callback function expects\n  var args = (0, _function.maxArgumentCount)(callback);\n  return (0, _array.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}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createFlatten = void 0;\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'flatten';\nvar dependencies = ['typed', 'matrix'];\nvar createFlatten = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix;\n  /**\n   * Flatten a multidimensional matrix into a single dimensional matrix.\n   * A new matrix is returned, the original matrix is left untouched.\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  return typed(name, {\n    Array: function Array(x) {\n      return (0, _array.flatten)(x);\n    },\n    Matrix: function Matrix(x) {\n      var flat = (0, _array.flatten)(x.toArray());\n      // TODO: return the same matrix type as x (Dense or Sparse Matrix)\n      return matrix(flat);\n    }\n  });\n});\nexports.createFlatten = createFlatten;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createForEach = void 0;\nvar _function = require(\"../../utils/function.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'forEach';\nvar dependencies = ['typed'];\nvar createForEach = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.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  return typed(name, {\n    'Array, function': _forEach,\n    'Matrix, function': function MatrixFunction(x, callback) {\n      x.forEach(callback);\n    }\n  });\n});\n\n/**\n * forEach for a multi dimensional array\n * @param {Array} array\n * @param {Function} callback\n * @private\n */\nexports.createForEach = createForEach;\nfunction _forEach(array, callback) {\n  // figure out what number of arguments the callback function expects\n  var args = (0, _function.maxArgumentCount)(callback);\n  var recurse = function recurse(value, index) {\n    if (Array.isArray(value)) {\n      (0, _array.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  recurse(array, []);\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createGetMatrixDataType = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _is = require(\"../../utils/is.js\");\nvar name = 'getMatrixDataType';\nvar dependencies = ['typed'];\nvar createGetMatrixDataType = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\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  return typed(name, {\n    Array: function Array(x) {\n      return (0, _array.getArrayDataType)(x, _is.typeOf);\n    },\n    Matrix: function Matrix(x) {\n      return x.getDataType();\n    }\n  });\n});\nexports.createGetMatrixDataType = createGetMatrixDataType;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createIdentity = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _number = require(\"../../utils/number.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'identity';\nvar dependencies = ['typed', 'config', 'matrix', 'BigNumber', 'DenseMatrix', 'SparseMatrix'];\nvar createIdentity = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    matrix = _ref.matrix,\n    BigNumber = _ref.BigNumber,\n    DenseMatrix = _ref.DenseMatrix,\n    SparseMatrix = _ref.SparseMatrix;\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  return typed(name, {\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' ? 'dense' : 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' ? 'dense' : 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  function _identityVector(size, format) {\n    switch (size.length) {\n      case 0:\n        return format ? matrix(format) : [];\n      case 1:\n        return _identity(size[0], size[0], format);\n      case 2:\n        return _identity(size[0], size[1], format);\n      default:\n        throw new Error('Vector containing two values expected');\n    }\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  function _identity(rows, cols, format) {\n    // BigNumber constructor with the right precision\n    var Big = (0, _is.isBigNumber)(rows) || (0, _is.isBigNumber)(cols) ? BigNumber : null;\n    if ((0, _is.isBigNumber)(rows)) rows = rows.toNumber();\n    if ((0, _is.isBigNumber)(cols)) cols = cols.toNumber();\n    if (!(0, _number.isInteger)(rows) || rows < 1) {\n      throw new Error('Parameters in function identity must be positive integers');\n    }\n    if (!(0, _number.isInteger)(cols) || cols < 1) {\n      throw new Error('Parameters in function identity must be positive integers');\n    }\n    var one = Big ? new BigNumber(1) : 1;\n    var defaultValue = Big ? new Big(0) : 0;\n    var size = [rows, cols];\n\n    // check we need to return a matrix\n    if (format) {\n      // create diagonal matrix (use optimized implementation for storage format)\n      if (format === 'sparse') {\n        return SparseMatrix.diagonal(size, one, 0, defaultValue);\n      }\n      if (format === 'dense') {\n        return DenseMatrix.diagonal(size, one, 0, defaultValue);\n      }\n      throw new TypeError(\"Unknown matrix type \\\"\".concat(format, \"\\\"\"));\n    }\n\n    // create and resize array\n    var res = (0, _array.resize)([], size, defaultValue);\n    // fill in ones on the diagonal\n    var minimum = rows < cols ? rows : cols;\n    // fill diagonal\n    for (var d = 0; d < minimum; d++) {\n      res[d][d] = one;\n    }\n    return res;\n  }\n});\nexports.createIdentity = createIdentity;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createKron = void 0;\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'kron';\nvar dependencies = ['typed', 'matrix', 'multiplyScalar'];\nvar createKron = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    multiplyScalar = _ref.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  return typed(name, {\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\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  function _kron(a, b) {\n    // Deal with the dimensions of the matricies.\n    if ((0, _array.arraySize)(a).length === 1) {\n      // Wrap it in a 2D Matrix\n      a = [a];\n    }\n    if ((0, _array.arraySize)(b).length === 1) {\n      // Wrap it in a 2D Matrix\n      b = [b];\n    }\n    if ((0, _array.arraySize)(a).length > 2 || (0, _array.arraySize)(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    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});\nexports.createKron = createKron;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMap = void 0;\nvar _function = require(\"../../utils/function.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'map';\nvar dependencies = ['typed'];\nvar createMap = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\n  /**\n   * Create a new matrix or array with the results of a callback function executed on\n   * each entry of a given matrix/array.\n   *\n   * For each entry of the input, the callback is invoked with three arguments:\n   * the value of the entry, the index at which that entry occurs, and the full\n   * matrix/array being traversed. Note that because the matrix/array might be\n   * multidimensional, the \"index\" argument is always an array of numbers giving\n   * the index in each dimension. This is true even for vectors: the \"index\"\n   * argument is an array of length 1, rather than simply a number.\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   *    // The calling convention for the callback can cause subtleties:\n   *    math.map([1, 2, 3], math.format)\n   *    // throws TypeError: map attempted to call 'format(1,[0])' but argument 2 of type Array does not match expected type number or function or Object or string or boolean\n   *    // [This happens because `format` _can_ take a second argument,\n   *    // but its semantics don't match that of the 2nd argument `map` provides]\n   *\n   *    // To avoid this error, use a function that takes exactly the\n   *    // desired arguments:\n   *    math.map([1, 2, 3], x => math.format(x)) // returns ['1', '2', '3']\n   *\n   * See also:\n   *\n   *    filter, forEach, sort\n   *\n   * @param {Matrix | Array} x    The input to iterate on.\n   * @param {Function} callback\n   *     The function to call (as described above) on each entry of the input\n   * @return {Matrix | array}\n   *     Transformed map of x; always has the same type and shape as x\n   */\n  return typed(name, {\n    'Array, function': _map,\n    'Matrix, function': function MatrixFunction(x, callback) {\n      return x.map(callback);\n    }\n  });\n});\n\n/**\n * Map for a multi dimensional array\n * @param {Array} array\n * @param {Function} callback\n * @return {Array}\n * @private\n */\nexports.createMap = createMap;\nfunction _map(array, callback) {\n  // figure out what number of arguments the callback function expects\n  var args = (0, _function.maxArgumentCount)(callback);\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      try {\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      } catch (err) {\n        // But maybe the arguments still weren't right\n        if (err instanceof TypeError && 'data' in err && err.data.category === 'wrongType') {\n          var newmsg = \"map attempted to call '\".concat(err.data.fn, \"(\").concat(value);\n          var indexString = JSON.stringify(index);\n          if (args === 2) {\n            newmsg += ',' + indexString;\n          } else if (args !== 1) {\n            newmsg += \",\".concat(indexString, \",\").concat(array);\n          }\n          newmsg += \")' but argument \".concat(err.data.index + 1, \" of type \");\n          newmsg += \"\".concat(err.data.actual, \" does not match expected type \");\n          newmsg += err.data.expected.join(' or ');\n          throw new TypeError(newmsg);\n        }\n        throw err;\n      }\n    }\n  };\n  return recurse(array, []);\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createDiff = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _number = require(\"../../utils/number.js\");\nvar _is = require(\"../../utils/is.js\");\nvar name = 'diff';\nvar dependencies = ['typed', 'matrix', 'subtract', 'number'];\nvar createDiff = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    subtract = _ref.subtract,\n    number = _ref.number;\n  /**\n   * Create a new matrix or array of the difference between elements of the given array\n   * The optional dim parameter lets you specify the dimension to evaluate the difference of\n   * If no dimension parameter is passed it is assumed as dimension 0\n   *\n   * Dimension is zero-based in javascript and one-based in the parser and can be a number or bignumber\n   * Arrays must be 'rectangular' meaning arrays like [1, 2]\n   * If something is passed as a matrix it will be returned as a matrix but other than that all matrices are converted to arrays\n   *\n   * Syntax:\n   *\n   *     math.diff(arr)\n   *     math.diff(arr, dim)\n   *\n   * Examples:\n   *\n   *     const arr = [1, 2, 4, 7, 0]\n   *     math.diff(arr) // returns [1, 2, 3, -7] (no dimension passed so 0 is assumed)\n   *     math.diff(math.matrix(arr)) // returns Matrix [1, 2, 3, -7]\n   *\n   *     const arr = [[1, 2, 3, 4, 5], [1, 2, 3, 4, 5], [9, 8, 7, 6, 4]]\n   *     math.diff(arr) // returns [[0, 0, 0, 0, 0], [8, 6, 4, 2, -1]]\n   *     math.diff(arr, 0) // returns [[0, 0, 0, 0, 0], [8, 6, 4, 2, -1]]\n   *     math.diff(arr, 1) // returns [[1, 1, 1, 1], [1, 1, 1, 1], [-1, -1, -1, -2]]\n   *     math.diff(arr, math.bignumber(1)) // returns [[1, 1, 1, 1], [1, 1, 1, 1], [-1, -1, -1, -2]]\n   *\n   *     math.diff(arr, 2) // throws RangeError as arr is 2 dimensional not 3\n   *     math.diff(arr, -1) // throws RangeError as negative dimensions are not allowed\n   *\n   *     // These will all produce the same result\n   *     math.diff([[1, 2], [3, 4]])\n   *     math.diff([math.matrix([1, 2]), math.matrix([3, 4])])\n   *     math.diff([[1, 2], math.matrix([3, 4])])\n   *     math.diff([math.matrix([1, 2]), [3, 4]])\n   *     // They do not produce the same result as  math.diff(math.matrix([[1, 2], [3, 4]])) as this returns a matrix\n   *\n   * See Also:\n   *\n   *      sum\n   *      subtract\n   *      partitionSelect\n   *\n   * @param {Array | Matrix} arr      An array or matrix\n   * @param {number | BigNumber} dim  Dimension\n   * @return {Array | Matrix}         Difference between array elements in given dimension\n   */\n  return typed(name, {\n    'Array | Matrix': function ArrayMatrix(arr) {\n      // No dimension specified => assume dimension 0\n      if ((0, _is.isMatrix)(arr)) {\n        return matrix(_diff(arr.toArray()));\n      } else {\n        return _diff(arr);\n      }\n    },\n    'Array | Matrix, number': function ArrayMatrixNumber(arr, dim) {\n      if (!(0, _number.isInteger)(dim)) throw new RangeError('Dimension must be a whole number');\n      if ((0, _is.isMatrix)(arr)) {\n        return matrix(_recursive(arr.toArray(), dim));\n      } else {\n        return _recursive(arr, dim);\n      }\n    },\n    'Array, BigNumber': typed.referTo('Array,number', function (selfAn) {\n      return function (arr, dim) {\n        return selfAn(arr, number(dim));\n      };\n    }),\n    'Matrix, BigNumber': typed.referTo('Matrix,number', function (selfMn) {\n      return function (arr, dim) {\n        return selfMn(arr, number(dim));\n      };\n    })\n  });\n\n  /**\n   * Recursively find the correct dimension in the array/matrix\n   * Then Apply _diff to that dimension\n   *\n   * @param {Array} arr      The array\n   * @param {number} dim     Dimension\n   * @return {Array}         resulting array\n   */\n  function _recursive(arr, dim) {\n    if ((0, _is.isMatrix)(arr)) {\n      arr = arr.toArray(); // Makes sure arrays like [ matrix([0, 1]), matrix([1, 0]) ] are processed properly\n    }\n\n    if (!Array.isArray(arr)) {\n      throw RangeError('Array/Matrix does not have that many dimensions');\n    }\n    if (dim > 0) {\n      var result = [];\n      arr.forEach(function (element) {\n        result.push(_recursive(element, dim - 1));\n      });\n      return result;\n    } else if (dim === 0) {\n      return _diff(arr);\n    } else {\n      throw RangeError('Cannot have negative dimension');\n    }\n  }\n\n  /**\n   * Difference between elements in the array\n   *\n   * @param {Array} arr      An array\n   * @return {Array}         resulting array\n   */\n  function _diff(arr) {\n    var result = [];\n    var size = arr.length;\n    for (var i = 1; i < size; i++) {\n      result.push(_ElementDiff(arr[i - 1], arr[i]));\n    }\n    return result;\n  }\n\n  /**\n   * Difference between 2 objects\n   *\n   * @param {Object} obj1    First object\n   * @param {Object} obj2    Second object\n   * @return {Array}         resulting array\n   */\n  function _ElementDiff(obj1, obj2) {\n    // Convert matrices to arrays\n    if ((0, _is.isMatrix)(obj1)) obj1 = obj1.toArray();\n    if ((0, _is.isMatrix)(obj2)) obj2 = obj2.toArray();\n    var obj1IsArray = Array.isArray(obj1);\n    var obj2IsArray = Array.isArray(obj2);\n    if (obj1IsArray && obj2IsArray) {\n      return _ArrayDiff(obj1, obj2);\n    }\n    if (!obj1IsArray && !obj2IsArray) {\n      return subtract(obj2, obj1); // Difference is (second - first) NOT (first - second)\n    }\n\n    throw TypeError('Cannot calculate difference between 1 array and 1 non-array');\n  }\n\n  /**\n   * Difference of elements in 2 arrays\n   *\n   * @param {Array} arr1     Array 1\n   * @param {Array} arr2     Array 2\n   * @return {Array}         resulting array\n   */\n  function _ArrayDiff(arr1, arr2) {\n    if (arr1.length !== arr2.length) {\n      throw RangeError('Not all sub-arrays have the same length');\n    }\n    var result = [];\n    var size = arr1.length;\n    for (var i = 0; i < size; i++) {\n      result.push(_ElementDiff(arr1[i], arr2[i]));\n    }\n    return result;\n  }\n});\nexports.createDiff = createDiff;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createOnes = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _number = require(\"../../utils/number.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'ones';\nvar dependencies = ['typed', 'config', 'matrix', 'BigNumber'];\nvar createOnes = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    matrix = _ref.matrix,\n    BigNumber = _ref.BigNumber;\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()                    // returns []\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|BigNumber) | 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  return 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      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\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  function _ones(size, format) {\n    var hasBigNumbers = _normalize(size);\n    var defaultValue = hasBigNumbers ? new BigNumber(1) : 1;\n    _validate(size);\n    if (format) {\n      // return a matrix\n      var m = matrix(format);\n      if (size.length > 0) {\n        return m.resize(size, defaultValue);\n      }\n      return m;\n    } else {\n      // return an Array\n      var arr = [];\n      if (size.length > 0) {\n        return (0, _array.resize)(arr, size, defaultValue);\n      }\n      return arr;\n    }\n  }\n\n  // replace BigNumbers with numbers, returns true if size contained BigNumbers\n  function _normalize(size) {\n    var hasBigNumbers = false;\n    size.forEach(function (value, index, arr) {\n      if ((0, _is.isBigNumber)(value)) {\n        hasBigNumbers = true;\n        arr[index] = value.toNumber();\n      }\n    });\n    return hasBigNumbers;\n  }\n\n  // validate arguments\n  function _validate(size) {\n    size.forEach(function (value) {\n      if (typeof value !== 'number' || !(0, _number.isInteger)(value) || value < 0) {\n        throw new Error('Parameters in function ones must be positive integers');\n      }\n    });\n  }\n});\nexports.createOnes = createOnes;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.noBignumber = noBignumber;\nexports.noFraction = noFraction;\nexports.noIndex = noIndex;\nexports.noMatrix = noMatrix;\nexports.noSubset = noSubset;\nfunction noBignumber() {\n  throw new Error('No \"bignumber\" implementation available');\n}\nfunction noFraction() {\n  throw new Error('No \"fraction\" implementation available');\n}\nfunction noMatrix() {\n  throw new Error('No \"matrix\" implementation available');\n}\nfunction noIndex() {\n  throw new Error('No \"index\" implementation available');\n}\nfunction noSubset() {\n  throw new Error('No \"matrix\" implementation available');\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createRange = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _noop = require(\"../../utils/noop.js\");\nvar name = 'range';\nvar dependencies = ['typed', 'config', '?matrix', '?bignumber', 'smaller', 'smallerEq', 'larger', 'largerEq'];\nvar createRange = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    matrix = _ref.matrix,\n    bignumber = _ref.bignumber,\n    smaller = _ref.smaller,\n    smallerEq = _ref.smallerEq,\n    larger = _ref.larger,\n    largerEq = _ref.largerEq;\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  return typed(name, {\n    // TODO: simplify signatures when typed-function supports default values and optional arguments\n\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      var BigNumber = start.constructor;\n      return _out(_bigRangeEx(start, end, new BigNumber(1)));\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      var BigNumber = start.constructor;\n      return includeEnd ? _out(_bigRangeInc(start, end, new BigNumber(1))) : _out(_bigRangeEx(start, end, new BigNumber(1)));\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  function _out(arr) {\n    if (config.matrix === 'Matrix') {\n      return matrix ? matrix(arr) : (0, _noop.noMatrix)();\n    }\n    return arr;\n  }\n  function _strRange(str, includeEnd) {\n    var r = _parse(str);\n    if (!r) {\n      throw new SyntaxError('String \"' + str + '\" is no valid range');\n    }\n    var fn;\n    if (config.number === 'BigNumber') {\n      if (bignumber === undefined) {\n        (0, _noop.noBignumber)();\n      }\n      fn = includeEnd ? _bigRangeInc : _bigRangeEx;\n      return _out(fn(bignumber(r.start), bignumber(r.end), bignumber(r.step)));\n    } else {\n      fn = includeEnd ? _rangeInc : _rangeEx;\n      return _out(fn(r.start, r.end, r.step));\n    }\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  function _rangeEx(start, end, step) {\n    var array = [];\n    var x = start;\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    return array;\n  }\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  function _rangeInc(start, end, step) {\n    var array = [];\n    var x = start;\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    return array;\n  }\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  function _bigRangeEx(start, end, step) {\n    var zero = bignumber(0);\n    var array = [];\n    var x = start;\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    return array;\n  }\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  function _bigRangeInc(start, end, step) {\n    var zero = bignumber(0);\n    var array = [];\n    var x = start;\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    return array;\n  }\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  function _parse(str) {\n    var args = str.split(':');\n\n    // number\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    if (invalid) {\n      return null;\n    }\n    switch (nums.length) {\n      case 2:\n        return {\n          start: nums[0],\n          end: nums[1],\n          step: 1\n        };\n      case 3:\n        return {\n          start: nums[0],\n          end: nums[2],\n          step: nums[1]\n        };\n      default:\n        return null;\n    }\n  }\n});\nexports.createRange = createRange;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createReshape = void 0;\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'reshape';\nvar dependencies = ['typed', 'isInteger', 'matrix'];\nvar createReshape = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    isInteger = _ref.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   *    math.reshape([1, 2, 3, 4], [-1, 2])\n   *    // returns Matrix [[1, 2], [3, 4]]\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. One -1 is allowed as wildcard,\n   *                                which calculates this dimension automatically.\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  return typed(name, {\n    'Matrix, Array': function MatrixArray(x, sizes) {\n      return x.reshape(sizes, true);\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 (0, _array.reshape)(x, sizes);\n    }\n  });\n});\nexports.createReshape = createReshape;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createResize = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _DimensionError = require(\"../../error/DimensionError.js\");\nvar _ArgumentsError = require(\"../../error/ArgumentsError.js\");\nvar _number = require(\"../../utils/number.js\");\nvar _string = require(\"../../utils/string.js\");\nvar _object = require(\"../../utils/object.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'resize';\nvar dependencies = ['config', 'matrix'];\nvar createResize = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var config = _ref.config,\n    matrix = _ref.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  return function resize(x, size, defaultValue) {\n    if (arguments.length !== 2 && arguments.length !== 3) {\n      throw new _ArgumentsError.ArgumentsError('resize', arguments.length, 2, 3);\n    }\n    if ((0, _is.isMatrix)(size)) {\n      size = size.valueOf(); // get Array\n    }\n\n    if ((0, _is.isBigNumber)(size[0])) {\n      // convert bignumbers to numbers\n      size = size.map(function (value) {\n        return !(0, _is.isBigNumber)(value) ? value : value.toNumber();\n      });\n    }\n\n    // check x is a Matrix\n    if ((0, _is.isMatrix)(x)) {\n      // use optimized matrix implementation, return copy\n      return x.resize(size, defaultValue, true);\n    }\n    if (typeof x === 'string') {\n      // resize string\n      return _resizeString(x, size, defaultValue);\n    }\n\n    // check result should be a matrix\n    var asMatrix = Array.isArray(x) ? false : config.matrix !== 'Array';\n    if (size.length === 0) {\n      // output a scalar\n      while (Array.isArray(x)) {\n        x = x[0];\n      }\n      return (0, _object.clone)(x);\n    } else {\n      // output an array/matrix\n      if (!Array.isArray(x)) {\n        x = [x];\n      }\n      x = (0, _object.clone)(x);\n      var res = (0, _array.resize)(x, size, defaultValue);\n      return asMatrix ? matrix(res) : res;\n    }\n  };\n\n  /**\n   * Resize a string\n   * @param {string} str\n   * @param {number[]} size\n   * @param {string} [defaultChar=' ']\n   * @private\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    if (size.length !== 1) {\n      throw new _DimensionError.DimensionError(size.length, 1);\n    }\n    var len = size[0];\n    if (typeof len !== 'number' || !(0, _number.isInteger)(len)) {\n      throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + (0, _string.format)(size) + ')');\n    }\n    if (str.length > len) {\n      return str.substring(0, len);\n    } else if (str.length < len) {\n      var res = str;\n      for (var i = 0, ii = len - str.length; i < ii; i++) {\n        res += defaultChar;\n      }\n      return res;\n    } else {\n      return str;\n    }\n  }\n});\nexports.createResize = createResize;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createRotate = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _array = require(\"../../utils/array.js\");\nvar name = 'rotate';\nvar dependencies = ['typed', 'multiply', 'rotationMatrix'];\nvar createRotate = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    multiply = _ref.multiply,\n    rotationMatrix = _ref.rotationMatrix;\n  /**\n     * Rotate a vector of size 1x2 counter-clockwise by a given angle\n     * Rotate a vector of size 1x3 counter-clockwise by a given angle around the given axis\n     *\n     * Syntax:\n     *\n     *    math.rotate(w, theta)\n     *    math.rotate(w, theta, v)\n     *\n     * Examples:\n     *\n     *    math.rotate([11, 12], math.pi / 2)                           // returns [-12, 11]\n     *    math.rotate(matrix([11, 12]), math.pi / 2)                   // returns [-12, 11]\n     *\n     *    math.rotate([1, 0, 0], unit('90deg'), [0, 0, 1])             // returns [0, 1, 0]\n     *    math.rotate(matrix([1, 0, 0]), unit('90deg'), [0, 0, 1])     // returns Matrix [0, 1, 0]\n     *\n     *    math.rotate([1, 0], math.complex(1 + i))                     // returns [cos(1 + i) - sin(1 + i), sin(1 + i) + cos(1 + i)]\n     *\n     * See also:\n     *\n     *    matrix, rotationMatrix\n     *\n     * @param {Array | Matrix} w                             Vector to rotate\n     * @param {number | BigNumber | Complex | Unit} theta    Rotation angle\n     * @param {Array | Matrix} [v]                           Rotation axis\n     * @return {Array | Matrix}                              Multiplication of the rotation matrix and w\n     */\n  return typed(name, {\n    'Array , number | BigNumber | Complex | Unit': function ArrayNumberBigNumberComplexUnit(w, theta) {\n      _validateSize(w, 2);\n      var matrixRes = multiply(rotationMatrix(theta), w);\n      return matrixRes.toArray();\n    },\n    'Matrix , number | BigNumber | Complex | Unit': function MatrixNumberBigNumberComplexUnit(w, theta) {\n      _validateSize(w, 2);\n      return multiply(rotationMatrix(theta), w);\n    },\n    'Array, number | BigNumber | Complex | Unit, Array | Matrix': function ArrayNumberBigNumberComplexUnitArrayMatrix(w, theta, v) {\n      _validateSize(w, 3);\n      var matrixRes = multiply(rotationMatrix(theta, v), w);\n      return matrixRes;\n    },\n    'Matrix, number | BigNumber | Complex | Unit, Array | Matrix': function MatrixNumberBigNumberComplexUnitArrayMatrix(w, theta, v) {\n      _validateSize(w, 3);\n      return multiply(rotationMatrix(theta, v), w);\n    }\n  });\n  function _validateSize(v, expectedSize) {\n    var actualSize = Array.isArray(v) ? (0, _array.arraySize)(v) : v.size();\n    if (actualSize.length > 2) {\n      throw new RangeError(\"Vector must be of dimensions 1x\".concat(expectedSize));\n    }\n    if (actualSize.length === 2 && actualSize[1] !== 1) {\n      throw new RangeError(\"Vector must be of dimensions 1x\".concat(expectedSize));\n    }\n    if (actualSize[0] !== expectedSize) {\n      throw new RangeError(\"Vector must be of dimensions 1x\".concat(expectedSize));\n    }\n  }\n});\nexports.createRotate = createRotate;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createRotationMatrix = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'rotationMatrix';\nvar dependencies = ['typed', 'config', 'multiplyScalar', 'addScalar', 'unaryMinus', 'norm', 'matrix', 'BigNumber', 'DenseMatrix', 'SparseMatrix', 'cos', 'sin'];\nvar createRotationMatrix = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    multiplyScalar = _ref.multiplyScalar,\n    addScalar = _ref.addScalar,\n    unaryMinus = _ref.unaryMinus,\n    norm = _ref.norm,\n    BigNumber = _ref.BigNumber,\n    matrix = _ref.matrix,\n    DenseMatrix = _ref.DenseMatrix,\n    SparseMatrix = _ref.SparseMatrix,\n    cos = _ref.cos,\n    sin = _ref.sin;\n  /**\n   * Create a 2-dimensional counter-clockwise rotation matrix (2x2) for a given angle (expressed in radians).\n   * Create a 2-dimensional counter-clockwise rotation matrix (3x3) by a given angle (expressed in radians) around a given axis (1x3).\n   *\n   * Syntax:\n   *\n   *    math.rotationMatrix(theta)\n   *    math.rotationMatrix(theta, format)\n   *    math.rotationMatrix(theta, [v])\n   *    math.rotationMatrix(theta, [v], format)\n   *\n   * Examples:\n   *\n   *    math.rotationMatrix(math.pi / 2)                      // returns [[0, -1], [1, 0]]\n   *    math.rotationMatrix(math.bignumber(1))                // returns [[bignumber(cos(1)), bignumber(-sin(1))], [bignumber(sin(1)), bignumber(cos(1))]]\n   *    math.rotationMatrix(math.complex(1 + i))              // returns [[cos(1 + i), -sin(1 + i)], [sin(1 + i), cos(1 + i)]]\n   *    math.rotationMatrix(math.unit('1rad'))                // returns [[cos(1), -sin(1)], [sin(1), cos(1)]]\n   *\n   *    math.rotationMatrix(math.pi / 2, [0, 1, 0])           // returns [[0, 0, 1], [0, 1, 0], [-1, 0, 0]]\n   *    math.rotationMatrix(math.pi / 2, matrix([0, 1, 0]))   // returns matrix([[0, 0, 1], [0, 1, 0], [-1, 0, 0]])\n   *\n   *\n   * See also:\n   *\n   *    matrix, cos, sin\n   *\n   *\n   * @param {number | BigNumber | Complex | Unit} theta    Rotation angle\n   * @param {Array | Matrix} [v]                           Rotation axis\n   * @param {string} [format]                              Result Matrix storage format\n   * @return {Array | Matrix}                              Rotation matrix\n   */\n\n  return typed(name, {\n    '': function _() {\n      return config.matrix === 'Matrix' ? matrix([]) : [];\n    },\n    string: function string(format) {\n      return matrix(format);\n    },\n    'number | BigNumber | Complex | Unit': function numberBigNumberComplexUnit(theta) {\n      return _rotationMatrix2x2(theta, config.matrix === 'Matrix' ? 'dense' : undefined);\n    },\n    'number | BigNumber | Complex | Unit, string': function numberBigNumberComplexUnitString(theta, format) {\n      return _rotationMatrix2x2(theta, format);\n    },\n    'number | BigNumber | Complex | Unit, Array': function numberBigNumberComplexUnitArray(theta, v) {\n      var matrixV = matrix(v);\n      _validateVector(matrixV);\n      return _rotationMatrix3x3(theta, matrixV, undefined);\n    },\n    'number | BigNumber | Complex | Unit, Matrix': function numberBigNumberComplexUnitMatrix(theta, v) {\n      _validateVector(v);\n      var storageType = v.storage() || (config.matrix === 'Matrix' ? 'dense' : undefined);\n      return _rotationMatrix3x3(theta, v, storageType);\n    },\n    'number | BigNumber | Complex | Unit, Array, string': function numberBigNumberComplexUnitArrayString(theta, v, format) {\n      var matrixV = matrix(v);\n      _validateVector(matrixV);\n      return _rotationMatrix3x3(theta, matrixV, format);\n    },\n    'number | BigNumber | Complex | Unit, Matrix, string': function numberBigNumberComplexUnitMatrixString(theta, v, format) {\n      _validateVector(v);\n      return _rotationMatrix3x3(theta, v, format);\n    }\n  });\n\n  /**\n   * Returns 2x2 matrix of 2D rotation of angle theta\n   *\n   * @param {number | BigNumber | Complex | Unit} theta  The rotation angle\n   * @param {string} format                              The result Matrix storage format\n   * @returns {Matrix}\n   * @private\n   */\n  function _rotationMatrix2x2(theta, format) {\n    var Big = (0, _is.isBigNumber)(theta);\n    var minusOne = Big ? new BigNumber(-1) : -1;\n    var cosTheta = cos(theta);\n    var sinTheta = sin(theta);\n    var data = [[cosTheta, multiplyScalar(minusOne, sinTheta)], [sinTheta, cosTheta]];\n    return _convertToFormat(data, format);\n  }\n  function _validateVector(v) {\n    var size = v.size();\n    if (size.length < 1 || size[0] !== 3) {\n      throw new RangeError('Vector must be of dimensions 1x3');\n    }\n  }\n  function _mul(array) {\n    return array.reduce(function (p, curr) {\n      return multiplyScalar(p, curr);\n    });\n  }\n  function _convertToFormat(data, format) {\n    if (format) {\n      if (format === 'sparse') {\n        return new SparseMatrix(data);\n      }\n      if (format === 'dense') {\n        return new DenseMatrix(data);\n      }\n      throw new TypeError(\"Unknown matrix type \\\"\".concat(format, \"\\\"\"));\n    }\n    return data;\n  }\n\n  /**\n   * Returns a 3x3 matrix of rotation of angle theta around vector v\n   *\n   * @param {number | BigNumber | Complex | Unit} theta The rotation angle\n   * @param {Matrix} v                                  The rotation axis vector\n   * @param {string} format                             The storage format of the resulting matrix\n   * @returns {Matrix}\n   * @private\n   */\n  function _rotationMatrix3x3(theta, v, format) {\n    var normV = norm(v);\n    if (normV === 0) {\n      throw new RangeError('Rotation around zero vector');\n    }\n    var Big = (0, _is.isBigNumber)(theta) ? BigNumber : null;\n    var one = Big ? new Big(1) : 1;\n    var minusOne = Big ? new Big(-1) : -1;\n    var vx = Big ? new Big(v.get([0]) / normV) : v.get([0]) / normV;\n    var vy = Big ? new Big(v.get([1]) / normV) : v.get([1]) / normV;\n    var vz = Big ? new Big(v.get([2]) / normV) : v.get([2]) / normV;\n    var c = cos(theta);\n    var oneMinusC = addScalar(one, unaryMinus(c));\n    var s = sin(theta);\n    var r11 = addScalar(c, _mul([vx, vx, oneMinusC]));\n    var r12 = addScalar(_mul([vx, vy, oneMinusC]), _mul([minusOne, vz, s]));\n    var r13 = addScalar(_mul([vx, vz, oneMinusC]), _mul([vy, s]));\n    var r21 = addScalar(_mul([vx, vy, oneMinusC]), _mul([vz, s]));\n    var r22 = addScalar(c, _mul([vy, vy, oneMinusC]));\n    var r23 = addScalar(_mul([vy, vz, oneMinusC]), _mul([minusOne, vx, s]));\n    var r31 = addScalar(_mul([vx, vz, oneMinusC]), _mul([minusOne, vy, s]));\n    var r32 = addScalar(_mul([vy, vz, oneMinusC]), _mul([vx, s]));\n    var r33 = addScalar(c, _mul([vz, vz, oneMinusC]));\n    var data = [[r11, r12, r13], [r21, r22, r23], [r31, r32, r33]];\n    return _convertToFormat(data, format);\n  }\n});\nexports.createRotationMatrix = createRotationMatrix;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createRow = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _is = require(\"../../utils/is.js\");\nvar _object = require(\"../../utils/object.js\");\nvar _array = require(\"../../utils/array.js\");\nvar name = 'row';\nvar dependencies = ['typed', 'Index', 'matrix', 'range'];\nvar createRow = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    Index = _ref.Index,\n    matrix = _ref.matrix,\n    range = _ref.range;\n  /**\n   * Return a row from a Matrix.\n   *\n   * Syntax:\n   *\n   *     math.row(value, index)\n   *\n   * Example:\n   *\n   *     // get a row\n   *     const d = [[1, 2], [3, 4]]\n   *     math.row(d, 1) // returns [[3, 4]]\n   *\n   * See also:\n   *\n   *     column\n   *\n   * @param {Array | Matrix } value   An array or matrix\n   * @param {number} row              The index of the row\n   * @return {Array | Matrix}         The retrieved row\n   */\n  return typed(name, {\n    'Matrix, number': _row,\n    'Array, number': function ArrayNumber(value, row) {\n      return _row(matrix((0, _object.clone)(value)), row).valueOf();\n    }\n  });\n\n  /**\n   * Retrieve a row of a matrix\n   * @param {Matrix } value  A matrix\n   * @param {number} row     The index of the row\n   * @return {Matrix}        The retrieved row\n   */\n  function _row(value, row) {\n    // check dimensions\n    if (value.size().length !== 2) {\n      throw new Error('Only two dimensional matrix is supported');\n    }\n    (0, _array.validateIndex)(row, value.size()[0]);\n    var columnRange = range(0, value.size()[1]);\n    var index = new Index(row, columnRange);\n    var result = value.subset(index);\n    return (0, _is.isMatrix)(result) ? result : matrix([[result]]);\n  }\n});\nexports.createRow = createRow;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSize = void 0;\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _noop = require(\"../../utils/noop.js\");\nvar name = 'size';\nvar dependencies = ['typed', 'config', '?matrix'];\nvar createSize = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    matrix = _ref.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   *     count, 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  return typed(name, {\n    Matrix: function Matrix(x) {\n      return x.create(x.size());\n    },\n    Array: _array.arraySize,\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 ? matrix([]) : (0, _noop.noMatrix)();\n    }\n  });\n});\nexports.createSize = createSize;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSqueeze = void 0;\nvar _object = require(\"../../utils/object.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'squeeze';\nvar dependencies = ['typed', 'matrix'];\nvar createSqueeze = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.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  return typed(name, {\n    Array: function Array(x) {\n      return (0, _array.squeeze)((0, _object.clone)(x));\n    },\n    Matrix: function Matrix(x) {\n      var res = (0, _array.squeeze)(x.toArray());\n      // FIXME: return the same type of matrix as the input\n      return Array.isArray(res) ? matrix(res) : res;\n    },\n    any: function any(x) {\n      // scalar\n      return (0, _object.clone)(x);\n    }\n  });\n});\nexports.createSqueeze = createSqueeze;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSubset = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _object = require(\"../../utils/object.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _customs = require(\"../../utils/customs.js\");\nvar _DimensionError = require(\"../../error/DimensionError.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'subset';\nvar dependencies = ['typed', 'matrix'];\nvar createSubset = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.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   *     // get submatrix using ranges\n   *     const M = [\n   *       [1,2,3],\n   *       [4,5,6],\n   *       [7,8,9]\n   *     ]\n   *     math.subset(M, math.index(math.range(0,2), math.range(0,3))) // [[1,2,3],[4,5,6]]\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\n   *    For each dimension of the target, specifies an index or a list of\n   *    indices to fetch or set. `subset` uses the cartesian product of\n   *    the indices specified in each 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  return typed(name, {\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      return index.isScalar() ? subset : subset.valueOf(); // return an Array (like the input)\n    },\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((0, _object.clone)(value)).subset(index, replacement, undefined).valueOf();\n    },\n    'Array, Index, any, any': function ArrayIndexAnyAny(value, index, replacement, defaultValue) {\n      return matrix((0, _object.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});\n\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 or list of indices (character positions)\n * @returns {string} substring\n * @private\n */\nexports.createSubset = createSubset;\nfunction _getSubstring(str, index) {\n  if (!(0, _is.isIndex)(index)) {\n    // TODO: better error message\n    throw new TypeError('Index expected');\n  }\n  if (index.size().length !== 1) {\n    throw new _DimensionError.DimensionError(index.size().length, 1);\n  }\n\n  // validate whether the range is out of range\n  var strLen = str.length;\n  (0, _array.validateIndex)(index.min()[0], strLen);\n  (0, _array.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/**\n * Replace a substring in a string\n * @param {string} str            string to be replaced\n * @param {Index} index           An index or list of indices (character positions)\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 */\nfunction _setSubstring(str, index, replacement, defaultValue) {\n  if (!index || index.isIndex !== true) {\n    // TODO: better error message\n    throw new TypeError('Index expected');\n  }\n  if (index.size().length !== 1) {\n    throw new _DimensionError.DimensionError(index.size().length, 1);\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  var range = index.dimension(0);\n  var len = range.size()[0];\n  if (len !== replacement.length) {\n    throw new _DimensionError.DimensionError(range.size()[0], replacement.length);\n  }\n\n  // validate whether the range is out of range\n  var strLen = str.length;\n  (0, _array.validateIndex)(index.min()[0]);\n  (0, _array.validateIndex)(index.max()[0]);\n\n  // copy the string into an array with characters\n  var chars = [];\n  for (var i = 0; i < strLen; i++) {\n    chars[i] = str.charAt(i);\n  }\n  range.forEach(function (v, i) {\n    chars[v] = replacement.charAt(i[0]);\n  });\n\n  // initialize undefined characters with a space\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  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 */\nfunction _getObjectProperty(object, index) {\n  if (index.size().length !== 1) {\n    throw new _DimensionError.DimensionError(index.size(), 1);\n  }\n  var key = index.dimension(0);\n  if (typeof key !== 'string') {\n    throw new TypeError('String expected as index to retrieve an object property');\n  }\n  return (0, _customs.getSafeProperty)(object, key);\n}\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 */\nfunction _setObjectProperty(object, index, replacement) {\n  if (index.size().length !== 1) {\n    throw new _DimensionError.DimensionError(index.size(), 1);\n  }\n  var key = index.dimension(0);\n  if (typeof key !== 'string') {\n    throw new TypeError('String expected as index to retrieve an object property');\n  }\n\n  // clone the object, and apply the property to the clone\n  var updated = (0, _object.clone)(object);\n  (0, _customs.setSafeProperty)(updated, key, replacement);\n  return updated;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createTranspose = void 0;\nvar _object = require(\"../../utils/object.js\");\nvar _string = require(\"../../utils/string.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'transpose';\nvar dependencies = ['typed', 'matrix'];\nvar createTranspose = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix;\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  return typed(name, {\n    Array: function Array(x) {\n      return transposeMatrix(matrix(x)).valueOf();\n    },\n    Matrix: transposeMatrix,\n    any: _object.clone // scalars\n  });\n\n  function transposeMatrix(x) {\n    // matrix size\n    var size = x.size();\n\n    // result\n    var c;\n\n    // process dimensions\n    switch (size.length) {\n      case 1:\n        // vector\n        c = x.clone();\n        break;\n      case 2:\n        {\n          // rows and columns\n          var rows = size[0];\n          var columns = size[1];\n\n          // check columns\n          if (columns === 0) {\n            // throw exception\n            throw new RangeError('Cannot transpose a 2D matrix with no columns (size: ' + (0, _string.format)(size) + ')');\n          }\n\n          // process storage format\n          switch (x.storage()) {\n            case 'dense':\n              c = _denseTranspose(x, rows, columns);\n              break;\n            case 'sparse':\n              c = _sparseTranspose(x, rows, columns);\n              break;\n          }\n        }\n        break;\n      default:\n        // multi dimensional\n        throw new RangeError('Matrix must be a vector or two dimensional (size: ' + (0, _string.format)(size) + ')');\n    }\n    return c;\n  }\n  function _denseTranspose(m, rows, columns) {\n    // matrix array\n    var data = m._data;\n    // transposed matrix data\n    var transposed = [];\n    var transposedRow;\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // initialize row\n      transposedRow = transposed[j] = [];\n      // loop rows\n      for (var i = 0; i < rows; i++) {\n        // set data\n        transposedRow[i] = (0, _object.clone)(data[i][j]);\n      }\n    }\n    // return matrix\n    return m.createDenseMatrix({\n      data: transposed,\n      size: [columns, rows],\n      datatype: m._datatype\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;\n    // result matrices\n    var cvalues = values ? [] : undefined;\n    var cindex = [];\n    var cptr = [];\n    // row counts\n    var w = [];\n    for (var x = 0; x < rows; x++) {\n      w[x] = 0;\n    }\n    // vars\n    var p, l, j;\n    // loop values in matrix\n    for (p = 0, l = index.length; p < l; p++) {\n      // number of values in row\n      w[index[p]]++;\n    }\n    // cumulative sum\n    var sum = 0;\n    // initialize cptr with the cummulative sum of row counts\n    for (var i = 0; i < rows; i++) {\n      // update cptr\n      cptr.push(sum);\n      // update sum\n      sum += w[i];\n      // update w\n      w[i] = cptr[i];\n    }\n    // update cptr\n    cptr.push(sum);\n    // loop columns\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]]++;\n        // C[j, i] = A[i, j]\n        cindex[q] = j;\n        // check we need to process values (pattern matrix)\n        if (values) {\n          cvalues[q] = (0, _object.clone)(values[k]);\n        }\n      }\n    }\n    // return matrix\n    return m.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [columns, rows],\n      datatype: m._datatype\n    });\n  }\n});\nexports.createTranspose = createTranspose;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCtranspose = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'ctranspose';\nvar dependencies = ['typed', 'transpose', 'conj'];\nvar createCtranspose = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    transpose = _ref.transpose,\n    conj = _ref.conj;\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  return typed(name, {\n    any: function any(x) {\n      return conj(transpose(x));\n    }\n  });\n});\nexports.createCtranspose = createCtranspose;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createZeros = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _number = require(\"../../utils/number.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'zeros';\nvar dependencies = ['typed', 'config', 'matrix', 'BigNumber'];\nvar createZeros = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    matrix = _ref.matrix,\n    BigNumber = _ref.BigNumber;\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()                   // returns []\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|BigNumber) | 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  return typed(name, {\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      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\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  function _zeros(size, format) {\n    var hasBigNumbers = _normalize(size);\n    var defaultValue = hasBigNumbers ? new BigNumber(0) : 0;\n    _validate(size);\n    if (format) {\n      // return a matrix\n      var m = matrix(format);\n      if (size.length > 0) {\n        return m.resize(size, defaultValue);\n      }\n      return m;\n    } else {\n      // return an Array\n      var arr = [];\n      if (size.length > 0) {\n        return (0, _array.resize)(arr, size, defaultValue);\n      }\n      return arr;\n    }\n  }\n\n  // replace BigNumbers with numbers, returns true if size contained BigNumbers\n  function _normalize(size) {\n    var hasBigNumbers = false;\n    size.forEach(function (value, index, arr) {\n      if ((0, _is.isBigNumber)(value)) {\n        hasBigNumbers = true;\n        arr[index] = value.toNumber();\n      }\n    });\n    return hasBigNumbers;\n  }\n\n  // validate arguments\n  function _validate(size) {\n    size.forEach(function (value) {\n      if (typeof value !== 'number' || !(0, _number.isInteger)(value) || value < 0) {\n        throw new Error('Parameters in function zeros must be positive integers');\n      }\n    });\n  }\n});\n\n// TODO: zeros contains almost the same code as ones. Reuse this?\nexports.createZeros = createZeros;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createFft = void 0;\nvar _toConsumableArray2 = _interopRequireDefault(require(\"@babel/runtime/helpers/toConsumableArray\"));\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'fft';\nvar dependencies = ['typed', 'matrix', 'addScalar', 'multiplyScalar', 'divideScalar', 'exp', 'tau', 'i', 'dotDivide', 'conj', 'pow', 'ceil', 'log2'];\nvar createFft = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    addScalar = _ref.addScalar,\n    multiplyScalar = _ref.multiplyScalar,\n    divideScalar = _ref.divideScalar,\n    exp = _ref.exp,\n    tau = _ref.tau,\n    I = _ref.i,\n    dotDivide = _ref.dotDivide,\n    conj = _ref.conj,\n    pow = _ref.pow,\n    ceil = _ref.ceil,\n    log2 = _ref.log2;\n  /**\n   * Calculate N-dimensional fourier transform\n   *\n   * Syntax:\n   *\n   *     math.fft(arr)\n   *\n   * Examples:\n   *\n   *    math.fft([[1, 0], [1, 0]]) // returns [[{re:2, im:0}, {re:2, im:0}], [{re:0, im:0}, {re:0, im:0}]]\n   *\n   *\n   * See Also:\n   *\n   *      ifft\n   *\n   * @param {Array | Matrix} arr    An array or matrix\n   * @return {Array | Matrix}       N-dimensional fourier transformation of the array\n   */\n  return typed(name, {\n    Array: _ndFft,\n    Matrix: function Matrix(matrix) {\n      return matrix.create(_ndFft(matrix.toArray()));\n    }\n  });\n\n  /**\n   * Perform an N-dimensional Fourier transform\n   *\n   * @param {Array} arr      The array\n   * @return {Array}         resulting array\n   */\n  function _ndFft(arr) {\n    var size = (0, _array.arraySize)(arr);\n    if (size.length === 1) return _fft(arr, size[0]);\n    // ndFft along dimension 1,...,N-1 then 1dFft along dimension 0\n    return _1dFft(arr.map(function (slice) {\n      return _ndFft(slice, size.slice(1));\n    }), 0);\n  }\n\n  /**\n   * Perform an 1-dimensional Fourier transform\n   *\n   * @param {Array} arr      The array\n   * @param {number} dim     dimension of the array to perform on\n   * @return {Array}         resulting array\n   */\n  function _1dFft(arr, dim) {\n    var size = (0, _array.arraySize)(arr);\n    if (dim !== 0) return new Array(size[0]).fill(0).map(function (_, i) {\n      return _1dFft(arr[i], dim - 1);\n    });\n    if (size.length === 1) return _fft(arr);\n    function _transpose(arr) {\n      // Swap first 2 dimensions\n      var size = (0, _array.arraySize)(arr);\n      return new Array(size[1]).fill(0).map(function (_, j) {\n        return new Array(size[0]).fill(0).map(function (_, i) {\n          return arr[i][j];\n        });\n      });\n    }\n    return _transpose(_1dFft(_transpose(arr), 1));\n  }\n  /**\n   * Perform an 1-dimensional non-power-of-2 Fourier transform using Chirp-Z Transform\n   *\n   * @param {Array} arr      The array\n   * @return {Array}         resulting array\n   */\n  function _czt(arr) {\n    var n = arr.length;\n    var w = exp(divideScalar(multiplyScalar(-1, multiplyScalar(I, tau)), n));\n    var chirp = [];\n    for (var i = 1 - n; i < n; i++) {\n      chirp.push(pow(w, divideScalar(pow(i, 2), 2)));\n    }\n    var N2 = pow(2, ceil(log2(n + n - 1)));\n    var xp = [].concat((0, _toConsumableArray2[\"default\"])(new Array(n).fill(0).map(function (_, i) {\n      return multiplyScalar(arr[i], chirp[n - 1 + i]);\n    })), (0, _toConsumableArray2[\"default\"])(new Array(N2 - n).fill(0)));\n    var ichirp = [].concat((0, _toConsumableArray2[\"default\"])(new Array(n + n - 1).fill(0).map(function (_, i) {\n      return divideScalar(1, chirp[i]);\n    })), (0, _toConsumableArray2[\"default\"])(new Array(N2 - (n + n - 1)).fill(0)));\n    var fftXp = _fft(xp);\n    var fftIchirp = _fft(ichirp);\n    var fftProduct = new Array(N2).fill(0).map(function (_, i) {\n      return multiplyScalar(fftXp[i], fftIchirp[i]);\n    });\n    var ifftProduct = dotDivide(conj(_ndFft(conj(fftProduct))), N2);\n    var ret = [];\n    for (var _i = n - 1; _i < n + n - 1; _i++) {\n      ret.push(multiplyScalar(ifftProduct[_i], chirp[_i]));\n    }\n    return ret;\n  }\n  /**\n   * Perform an 1-dimensional Fourier transform\n   *\n   * @param {Array} arr      The array\n   * @return {Array}         resulting array\n   */\n  function _fft(arr) {\n    var len = arr.length;\n    if (len === 1) return [arr[0]];\n    if (len % 2 === 0) {\n      var ret = [].concat((0, _toConsumableArray2[\"default\"])(_fft(arr.filter(function (_, i) {\n        return i % 2 === 0;\n      }), len / 2)), (0, _toConsumableArray2[\"default\"])(_fft(arr.filter(function (_, i) {\n        return i % 2 === 1;\n      }), len / 2)));\n      for (var k = 0; k < len / 2; k++) {\n        var p = ret[k];\n        var q = multiplyScalar(ret[k + len / 2], exp(multiplyScalar(multiplyScalar(tau, I), divideScalar(-k, len))));\n        ret[k] = addScalar(p, q);\n        ret[k + len / 2] = addScalar(p, multiplyScalar(-1, q));\n      }\n      return ret;\n    } else {\n      // use chirp-z transform for non-power-of-2 FFT\n      return _czt(arr);\n    }\n    // throw new Error('Can only calculate FFT of power-of-two size')\n  }\n});\nexports.createFft = createFft;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createIfft = void 0;\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _is = require(\"../../utils/is.js\");\nvar name = 'ifft';\nvar dependencies = ['typed', 'fft', 'dotDivide', 'conj'];\nvar createIfft = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    fft = _ref.fft,\n    dotDivide = _ref.dotDivide,\n    conj = _ref.conj;\n  /**\n   * Calculate N-dimensional inverse fourier transform\n   *\n   * Syntax:\n   *\n   *     math.ifft(arr)\n   *\n   * Examples:\n   *\n   *    math.ifft([[2, 2], [0, 0]]) // returns [[{re:1, im:0}, {re:0, im:0}], [{re:1, im:0}, {re:0, im:0}]]\n   *\n   * See Also:\n   *\n   *      fft\n   *\n   * @param {Array | Matrix} arr    An array or matrix\n   * @return {Array | Matrix}       N-dimensional fourier transformation of the array\n   */\n  return typed(name, {\n    'Array | Matrix': function ArrayMatrix(arr) {\n      var size = (0, _is.isMatrix)(arr) ? arr.size() : (0, _array.arraySize)(arr);\n      return dotDivide(conj(fft(conj(arr))), size.reduce(function (acc, curr) {\n        return acc * curr;\n      }, 1));\n    }\n  });\n});\nexports.createIfft = createIfft;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createErf = void 0;\nvar _collection = require(\"../../utils/collection.js\");\nvar _number = require(\"../../utils/number.js\");\nvar _factory = require(\"../../utils/factory.js\");\n/* eslint-disable no-loss-of-precision */\n\nvar name = 'erf';\nvar dependencies = ['typed'];\nvar createErf = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.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  return typed('name', {\n    number: function number(x) {\n      var y = Math.abs(x);\n      if (y >= MAX_NUM) {\n        return (0, _number.sign)(x);\n      }\n      if (y <= THRESH) {\n        return (0, _number.sign)(x) * erf1(y);\n      }\n      if (y <= 4.0) {\n        return (0, _number.sign)(x) * (1 - erfc2(y));\n      }\n      return (0, _number.sign)(x) * (1 - erfc3(y));\n    },\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (n) {\n        return (0, _collection.deepMap)(n, self);\n      };\n    })\n\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  function erf1(y) {\n    var ysq = y * y;\n    var xnum = P[0][4] * ysq;\n    var xden = ysq;\n    var i;\n    for (i = 0; i < 3; i += 1) {\n      xnum = (xnum + P[0][i]) * ysq;\n      xden = (xden + Q[0][i]) * ysq;\n    }\n    return y * (xnum + P[0][3]) / (xden + Q[0][3]);\n  }\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  function erfc2(y) {\n    var xnum = P[1][8] * y;\n    var xden = y;\n    var i;\n    for (i = 0; i < 7; i += 1) {\n      xnum = (xnum + P[1][i]) * y;\n      xden = (xden + Q[1][i]) * y;\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  /**\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  function erfc3(y) {\n    var ysq = 1 / (y * y);\n    var xnum = P[2][5] * ysq;\n    var xden = ysq;\n    var i;\n    for (i = 0; i < 4; i += 1) {\n      xnum = (xnum + P[2][i]) * ysq;\n      xden = (xden + Q[2][i]) * ysq;\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\n/**\n * Upper bound for the first approximation interval, 0 <= x <= THRESH\n * @constant\n */\nexports.createErf = createErf;\nvar THRESH = 0.46875;\n\n/**\n * Constant used by W. J. Cody's Fortran77 implementation to denote sqrt(pi)\n * @constant\n */\nvar SQRPI = 5.6418958354775628695e-1;\n\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 */\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/**\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 */\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/**\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 */\nvar MAX_NUM = Math.pow(2, 53);","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMode = void 0;\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'mode';\nvar dependencies = ['typed', 'isNaN', 'isNumeric'];\nvar createMode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    isNaN = _ref.isNaN,\n    isNumeric = _ref.isNumeric;\n  /**\n  * Computes the mode of a set of numbers or a list with values(numbers or characters).\n  * If there are multiple 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  return typed(name, {\n    'Array | Matrix': _mode,\n    '...': function _(args) {\n      return _mode(args);\n    }\n  });\n\n  /**\n   * Calculates the mode in an 1-dimensional array\n   * @param {Array} values\n   * @return {Array} mode\n   * @private\n   */\n  function _mode(values) {\n    values = (0, _array.flatten)(values.valueOf());\n    var num = values.length;\n    if (num === 0) {\n      throw new Error('Cannot calculate mode of an empty array');\n    }\n    var count = {};\n    var mode = [];\n    var max = 0;\n    for (var i = 0; i < values.length; i++) {\n      var value = values[i];\n      if (isNumeric(value) && isNaN(value)) {\n        throw new Error('Cannot calculate mode of an array containing NaN values');\n      }\n      if (!(value in count)) {\n        count[value] = 0;\n      }\n      count[value]++;\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    return mode;\n  }\n});\nexports.createMode = createMode;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.improveErrorMessage = improveErrorMessage;\nvar _is = require(\"../../../utils/is.js\");\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 */\nfunction improveErrorMessage(err, fnName, value) {\n  // TODO: add information with the index (also needs transform in expression parser)\n  var details;\n  if (String(err).indexOf('Unexpected type') !== -1) {\n    details = arguments.length > 2 ? ' (type: ' + (0, _is.typeOf)(value) + ', value: ' + JSON.stringify(value) + ')' : ' (type: ' + err.data.actual + ')';\n    return new TypeError('Cannot calculate ' + fnName + ', unexpected type of argument' + details);\n  }\n  if (String(err).indexOf('complex numbers') !== -1) {\n    details = arguments.length > 2 ? ' (type: ' + (0, _is.typeOf)(value) + ', value: ' + JSON.stringify(value) + ')' : '';\n    return new TypeError('Cannot calculate ' + fnName + ', no ordering relation is defined for complex numbers' + details);\n  }\n  return err;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createProd = void 0;\nvar _collection = require(\"../../utils/collection.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _improveErrorMessage = require(\"./utils/improveErrorMessage.js\");\nvar name = 'prod';\nvar dependencies = ['typed', 'config', 'multiplyScalar', 'numeric'];\nvar createProd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    multiplyScalar = _ref.multiplyScalar,\n    numeric = _ref.numeric;\n  /**\n   * Compute the product of a matrix or a list with values.\n   * In case of a multidimensional 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, variance\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The product of all values\n   */\n  return typed(name, {\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');\n      // return reduce(arguments[0], arguments[1], math.prod)\n    },\n\n    // prod(a, b, c, d, ...)\n    '...': function _(args) {\n      return _prod(args);\n    }\n  });\n\n  /**\n   * Recursively calculate the product of an n-dimensional array\n   * @param {Array} array\n   * @return {number} prod\n   * @private\n   */\n  function _prod(array) {\n    var prod;\n    (0, _collection.deepForEach)(array, function (value) {\n      try {\n        prod = prod === undefined ? value : multiplyScalar(prod, value);\n      } catch (err) {\n        throw (0, _improveErrorMessage.improveErrorMessage)(err, 'prod', value);\n      }\n    });\n\n    // make sure returning numeric value: parse a string into a numeric value\n    if (typeof prod === 'string') {\n      prod = numeric(prod, config.number);\n    }\n    if (prod === undefined) {\n      throw new Error('Cannot calculate prod of an empty array');\n    }\n    return prod;\n  }\n});\nexports.createProd = createProd;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createFormat = void 0;\nvar _string = require(\"../../utils/string.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'format';\nvar dependencies = ['typed'];\nvar createFormat = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.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: always have exponential notation,\n   *        and select the exponent to be a multiple of `3`.\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   *      - `'bin'`, `'oct'`, or `'hex'`\n   *        Format the number using binary, octal, or hexadecimal notation.\n   *        For example `'0b1101'` and `'0x10fe'`.\n   *    - `wordSize: number`\n   *      The word size in bits to use for formatting in binary, octal, or\n   *      hexadecimal notation. To be used only with `'bin'`, `'oct'`, or `'hex'`\n   *      values for `notation` option. When this option is defined the value\n   *      is formatted as a signed twos complement integer of the given word\n   *      size and the size suffix is appended to the output.\n   *      For example `format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'`.\n   *      Default value is undefined.\n   *    - `precision: number`\n   *      Limit the number of digits of the formatted value.\n   *      For regular numbers, must be a number between `0` and `16`.\n   *      For bignumbers, the maximum depends on the configured precision,\n   *      see function `config()`.\n   *      In case of notations `'exponential'`, `'engineering'`, and `'auto'`,\n   *      `precision` 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'`\n   *      is configured, and will output `'0.(3)'` when `'decimal'` is configured.\n   *    - `truncate: number`. Specifies the maximum allowed length of the\n   *      returned string. If it had been longer, the excess characters\n   *      are deleted and replaced with `'...'`.\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.24e+6'\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.4e+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  return typed(name, {\n    any: _string.format,\n    'any, Object | function | number': _string.format\n  });\n});\nexports.createFormat = createFormat;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createBin = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'bin';\nvar dependencies = ['typed', 'format'];\n\n/**\n * Format a number as binary.\n *\n * Syntax:\n *\n *    math.bin(value)\n *\n * Examples:\n *\n *    //the following outputs \"0b10\"\n *    math.bin(2)\n *\n * See also:\n *\n *    oct\n *    hex\n *\n * @param {number} value    Value to be stringified\n * @param {number} wordSize Optional word size (see `format`)\n * @return {string}         The formatted value\n */\nvar createBin = (0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    format = _ref.format;\n  return typed(name, {\n    'number | BigNumber': function numberBigNumber(n) {\n      return format(n, {\n        notation: 'bin'\n      });\n    },\n    'number | BigNumber, number': function numberBigNumberNumber(n, wordSize) {\n      return format(n, {\n        notation: 'bin',\n        wordSize: wordSize\n      });\n    }\n  });\n});\nexports.createBin = createBin;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createOct = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'oct';\nvar dependencies = ['typed', 'format'];\n\n/**\n * Format a number as octal.\n *\n * Syntax:\n *\n *    math.oct(value)\n *\n * Examples:\n *\n *    //the following outputs \"0o70\"\n *    math.oct(56)\n *\n * See also:\n *\n *    bin\n *    hex\n *\n * @param {number} value    Value to be stringified\n * @param {number} wordSize Optional word size (see `format`)\n * @return {string}         The formatted value\n */\n\nvar createOct = (0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    format = _ref.format;\n  return typed(name, {\n    'number | BigNumber': function numberBigNumber(n) {\n      return format(n, {\n        notation: 'oct'\n      });\n    },\n    'number | BigNumber, number': function numberBigNumberNumber(n, wordSize) {\n      return format(n, {\n        notation: 'oct',\n        wordSize: wordSize\n      });\n    }\n  });\n});\nexports.createOct = createOct;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createHex = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'hex';\nvar dependencies = ['typed', 'format'];\n\n/**\n * Format a number as hexadecimal.\n *\n * Syntax:\n *\n *    math.hex(value)\n *\n * Examples:\n *\n *    math.hex(240) // returns \"0xF0\"\n *\n * See also:\n *\n *    oct\n *    bin\n *\n * @param {number} value    Value to be stringified\n * @param {number} wordSize Optional word size (see `format`)\n * @return {string}         The formatted value\n */\nvar createHex = (0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    format = _ref.format;\n  return typed(name, {\n    'number | BigNumber': function numberBigNumber(n) {\n      return format(n, {\n        notation: 'hex'\n      });\n    },\n    'number | BigNumber, number': function numberBigNumberNumber(n, wordSize) {\n      return format(n, {\n        notation: 'hex',\n        wordSize: wordSize\n      });\n    }\n  });\n});\nexports.createHex = createHex;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createPrint = void 0;\nvar _string = require(\"../../utils/string.js\");\nvar _is = require(\"../../utils/is.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'print';\nvar dependencies = ['typed'];\nvar createPrint = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.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  return typed(name, {\n    // note: Matrix will be converted automatically to an Array\n    'string, Object | Array': _print,\n    'string, Object | Array, number | Object': _print\n  });\n});\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 */\nexports.createPrint = createPrint;\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    while (keys.length && value !== undefined) {\n      var k = keys.shift();\n      value = k ? value[k] : value + '.';\n    }\n    if (value !== undefined) {\n      if (!(0, _is.isString)(value)) {\n        return (0, _string.format)(value, options);\n      } else {\n        return value;\n      }\n    }\n    return original;\n  });\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createTo = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar name = 'to';\nvar dependencies = ['typed', 'matrix', 'concat'];\nvar createTo = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    concat = _ref.concat;\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n\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('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  return typed(name, {\n    'Unit, Unit | string': function UnitUnitString(x, unit) {\n      return x.to(unit);\n    }\n  }, matrixAlgorithmSuite({\n    Ds: true\n  }));\n});\nexports.createTo = createTo;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createIsPrime = void 0;\nvar _collection = require(\"../../utils/collection.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'isPrime';\nvar dependencies = ['typed'];\nvar createIsPrime = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.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  return typed(name, {\n    number: function number(x) {\n      if (x * 0 !== 0) {\n        return false;\n      }\n      if (x <= 3) {\n        return x > 1;\n      }\n      if (x % 2 === 0 || x % 3 === 0) {\n        return false;\n      }\n      for (var i = 5; i * i <= x; i += 6) {\n        if (x % i === 0 || x % (i + 2) === 0) {\n          return false;\n        }\n      }\n      return true;\n    },\n    BigNumber: function BigNumber(n) {\n      if (n.toNumber() * 0 !== 0) {\n        return false;\n      }\n      if (n.lte(3)) return n.gt(1);\n      if (n.mod(2).eq(0) || n.mod(3).eq(0)) return false;\n      if (n.lt(Math.pow(2, 32))) {\n        var x = n.toNumber();\n        for (var i = 5; i * i <= x; i += 6) {\n          if (x % i === 0 || x % (i + 2) === 0) {\n            return false;\n          }\n        }\n        return true;\n      }\n      function modPow(base, exponent, modulus) {\n        // exponent can be huge, use non-recursive variant\n        var accumulator = 1;\n        while (!exponent.eq(0)) {\n          if (exponent.mod(2).eq(0)) {\n            exponent = exponent.div(2);\n            base = base.mul(base).mod(modulus);\n          } else {\n            exponent = exponent.sub(1);\n            accumulator = base.mul(accumulator).mod(modulus);\n          }\n        }\n        return accumulator;\n      }\n\n      // https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test#Deterministic_variants\n      var Decimal = n.constructor.clone({\n        precision: n.toFixed(0).length * 2\n      });\n      n = new Decimal(n);\n      var r = 0;\n      var d = n.sub(1);\n      while (d.mod(2).eq(0)) {\n        d = d.div(2);\n        r += 1;\n      }\n      var bases = null;\n      // https://en.wikipedia.org/wiki/Miller–Rabin_primality_test#Testing_against_small_sets_of_bases\n      if (n.lt('3317044064679887385961981')) {\n        bases = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41].filter(function (x) {\n          return x < n;\n        });\n      } else {\n        var max = Math.min(n.toNumber() - 2, Math.floor(2 * Math.pow(n.toFixed(0).length * Math.log(10), 2)));\n        bases = [];\n        for (var _i = 2; _i <= max; _i += 1) {\n          bases.push(max);\n        }\n      }\n      for (var _i2 = 0; _i2 < bases.length; _i2 += 1) {\n        var a = bases[_i2];\n        var adn = modPow(n.sub(n).add(a), d, n);\n        if (!adn.eq(1)) {\n          for (var _i3 = 0, _x = adn; !_x.eq(n.sub(1)); _i3 += 1, _x = _x.mul(_x).mod(n)) {\n            if (_i3 === r - 1) {\n              return false;\n            }\n          }\n        }\n      }\n      return true;\n    },\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self);\n      };\n    })\n  });\n});\nexports.createIsPrime = createIsPrime;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createNumeric = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _noop = require(\"../../utils/noop.js\");\nvar name = 'numeric';\nvar dependencies = ['number', '?bignumber', '?fraction'];\nvar createNumeric = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var _number = _ref.number,\n    bignumber = _ref.bignumber,\n    fraction = _ref.fraction;\n  var validInputTypes = {\n    string: true,\n    number: true,\n    BigNumber: true,\n    Fraction: true\n  };\n\n  // Load the conversion functions for each output type\n  var validOutputTypes = {\n    number: function number(x) {\n      return _number(x);\n    },\n    BigNumber: bignumber ? function (x) {\n      return bignumber(x);\n    } : _noop.noBignumber,\n    Fraction: fraction ? function (x) {\n      return fraction(x);\n    } : _noop.noFraction\n  };\n\n  /**\n   * Convert a numeric input to a specific numeric type: number, BigNumber, or Fraction.\n   *\n   * Syntax:\n   *\n   *    math.numeric(x)\n   *\n   * Examples:\n   *\n   *    math.numeric('4')                           // returns 4\n   *    math.numeric('4', 'number')                 // returns 4\n   *    math.numeric('4', 'BigNumber')              // returns BigNumber 4\n   *    math.numeric('4', 'Fraction')               // returns Fraction 4\n   *    math.numeric(4, 'Fraction')                 // returns Fraction 4\n   *    math.numeric(math.fraction(2, 5), 'number') // returns 0.4\n   *\n   * See also:\n   *\n   *    number, fraction, bignumber, string, format\n   *\n   * @param {string | number | BigNumber | Fraction } value\n   *              A numeric value or a string containing a numeric value\n   * @param {string} outputType\n   *              Desired numeric output type.\n   *              Available values: 'number', 'BigNumber', or 'Fraction'\n   * @return {number | BigNumber | Fraction}\n   *              Returns an instance of the numeric in the requested type\n   */\n  return function numeric(value) {\n    var outputType = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'number';\n    var check = arguments.length > 2 ? arguments[2] : undefined;\n    if (check !== undefined) {\n      throw new SyntaxError('numeric() takes one or two arguments');\n    }\n    var inputType = (0, _is.typeOf)(value);\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    if (!(outputType in validOutputTypes)) {\n      throw new TypeError('Cannot convert ' + value + ' to type \"' + outputType + '\"; valid output types are ' + Object.keys(validOutputTypes).join(', '));\n    }\n    if (outputType === inputType) {\n      return value;\n    } else {\n      return validOutputTypes[outputType](value);\n    }\n  };\n});\nexports.createNumeric = createNumeric;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createDivideScalar = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'divideScalar';\nvar dependencies = ['typed', 'numeric'];\nvar createDivideScalar = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    numeric = _ref.numeric;\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).\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  return typed(name, {\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 | Complex | Fraction | BigNumber | Unit': function UnitNumberComplexFractionBigNumberUnit(x, y) {\n      return x.divide(y);\n    },\n    'number | Fraction | Complex | BigNumber, Unit': function numberFractionComplexBigNumberUnit(x, y) {\n      return y.divideInto(x);\n    }\n  });\n});\nexports.createDivideScalar = createDivideScalar;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createPow = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _number = require(\"../../utils/number.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'pow';\nvar dependencies = ['typed', 'config', 'identity', 'multiply', 'matrix', 'inv', 'fraction', 'number', 'Complex'];\nvar createPow = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    identity = _ref.identity,\n    multiply = _ref.multiply,\n    matrix = _ref.matrix,\n    inv = _ref.inv,\n    number = _ref.number,\n    fraction = _ref.fraction,\n    Complex = _ref.Complex;\n  /**\n   * Calculates the power of x to y, `x ^ y`.\n   *\n   * Matrix exponentiation is supported for square matrices `x` and integers `y`:\n   * when `y` is nonnegative, `x` may be any square matrix; and when `y` is\n   * negative, `x` must be invertible, and then this function returns\n   * inv(x)^(-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   *    const c = [[1, 2], [4, 3]]\n   *    math.pow(c, -1)               // returns Array [[-0.6, 0.4], [0.8, -0.2]]\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  return typed(name, {\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 Complex(x.toNumber(), 0).pow(y.toNumber(), 0);\n      }\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      var result = x.pow(y);\n      if (result != null) {\n        return result;\n      }\n      if (config.predictable) {\n        throw new Error('Result of pow is non-rational and cannot be expressed as a fraction');\n      } else {\n        return _pow(x.valueOf(), y.valueOf());\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  /**\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  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 && !(0, _number.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        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) {\n        // fraction() throws an error if y is Infinity, etc.\n      }\n\n      // Unable to express y as a fraction, so continue on\n    }\n\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    if (config.predictable && (x < -1 && y === Infinity || x > -1 && x < 0 && y === -Infinity)) {\n      return NaN;\n    }\n    if ((0, _number.isInteger)(y) || x >= 0 || config.predictable) {\n      return (0, _index.powNumber)(x, y);\n    } else {\n      // TODO: the following infinity checks are duplicated from powNumber. Deduplicate this somehow\n\n      // x^Infinity === 0 if -1 < x < 1\n      // A real number 0 is returned instead of complex(0)\n      if (x * x < 1 && y === Infinity || x * x > 1 && y === -Infinity) {\n        return 0;\n      }\n      return new Complex(x, 0).pow(y, 0);\n    }\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 integer value (positive if `x` is not invertible)\n   * @returns {Array}\n   * @private\n   */\n  function _powArray(x, y) {\n    if (!(0, _number.isInteger)(y)) {\n      throw new TypeError('For A^b, b must be an integer (value is ' + y + ')');\n    }\n    // verify that A is a 2 dimensional square matrix\n    var s = (0, _array.arraySize)(x);\n    if (s.length !== 2) {\n      throw new Error('For A^b, A must be 2 dimensional (A has ' + s.length + ' dimensions)');\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    if (y < 0) {\n      try {\n        return _powArray(inv(x), -y);\n      } catch (error) {\n        if (error.message === 'Cannot calculate inverse, determinant is zero') {\n          throw new TypeError('For A^b, when A is not invertible, b must be a positive integer (value is ' + y + ')');\n        }\n        throw error;\n      }\n    }\n    var res = identity(s[0]).valueOf();\n    var px = x;\n    while (y >= 1) {\n      if ((y & 1) === 1) {\n        res = multiply(px, res);\n      }\n      y >>= 1;\n      px = multiply(px, px);\n    }\n    return res;\n  }\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  function _powMatrix(x, y) {\n    return matrix(_powArray(x.valueOf(), y));\n  }\n});\nexports.createPow = createPow;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createRound = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _collection = require(\"../../utils/collection.js\");\nvar _matAlgo11xS0s = require(\"../../type/matrix/utils/matAlgo11xS0s.js\");\nvar _matAlgo12xSfs = require(\"../../type/matrix/utils/matAlgo12xSfs.js\");\nvar _matAlgo14xDs = require(\"../../type/matrix/utils/matAlgo14xDs.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar NO_INT = 'Number of decimals in function round must be an integer';\nvar name = 'round';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'BigNumber', 'DenseMatrix'];\nvar createRound = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    equalScalar = _ref.equalScalar,\n    zeros = _ref.zeros,\n    BigNumber = _ref.BigNumber,\n    DenseMatrix = _ref.DenseMatrix;\n  var matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({\n    typed: typed\n  });\n\n  /**\n   * Round a value towards the nearest rounded value.\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.22)             // returns number 3\n   *    math.round(3.82)             // returns number 4\n   *    math.round(-4.2)             // returns number -4\n   *    math.round(-4.7)             // returns number -5\n   *    math.round(3.22, 1)          // returns number 3.2\n   *    math.round(3.88, 1)          // returns number 3.9\n   *    math.round(-4.21, 1)         // returns number -4.2\n   *    math.round(-4.71, 1)         // returns number -4.7\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  return typed(name, {\n    number: _index.roundNumber,\n    'number, number': _index.roundNumber,\n    'number, BigNumber': function numberBigNumber(x, n) {\n      if (!n.isInteger()) {\n        throw new TypeError(NO_INT);\n      }\n      return new BigNumber(x).toDecimalPlaces(n.toNumber());\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      return x.round(n);\n    },\n    'Complex, BigNumber': function ComplexBigNumber(x, n) {\n      if (!n.isInteger()) {\n        throw new TypeError(NO_INT);\n      }\n      var _n = n.toNumber();\n      return x.round(_n);\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      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      return x.round(n);\n    },\n    'Fraction, BigNumber': function FractionBigNumber(x, n) {\n      if (!n.isInteger()) {\n        throw new TypeError(NO_INT);\n      }\n      return x.round(n.toNumber());\n    },\n    // deep map collection, skip zeros since round(0) = 0\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self, true);\n      };\n    }),\n    'SparseMatrix, number | BigNumber': typed.referToSelf(function (self) {\n      return function (x, y) {\n        return matAlgo11xS0s(x, y, self, false);\n      };\n    }),\n    'DenseMatrix, number | BigNumber': typed.referToSelf(function (self) {\n      return function (x, y) {\n        return matAlgo14xDs(x, y, self, false);\n      };\n    }),\n    'Array, number | BigNumber': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // use matrix implementation\n        return matAlgo14xDs(matrix(x), y, self, false).valueOf();\n      };\n    }),\n    'number | Complex | BigNumber | Fraction, SparseMatrix': typed.referToSelf(function (self) {\n      return function (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        return matAlgo12xSfs(y, x, self, true);\n      };\n    }),\n    'number | Complex | BigNumber | Fraction, DenseMatrix': typed.referToSelf(function (self) {\n      return function (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        return matAlgo14xDs(y, x, self, true);\n      };\n    }),\n    'number | Complex | BigNumber | Fraction, Array': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // use matrix implementation\n        return matAlgo14xDs(matrix(y), x, self, true).valueOf();\n      };\n    })\n  });\n});\nexports.createRound = createRound;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createLog = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'log';\nvar dependencies = ['config', 'typed', 'divideScalar', 'Complex'];\nvar createLog = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    divideScalar = _ref.divideScalar,\n    Complex = _ref.Complex;\n  /**\n   * Calculate the logarithm of a value.\n   *\n   * To avoid confusion with the matrix logarithm, this function does not\n   * apply to matrices.\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} 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}\n   *            Returns the logarithm of `x`\n   */\n  return typed(name, {\n    number: function number(x) {\n      if (x >= 0 || config.predictable) {\n        return (0, _index.logNumber)(x);\n      } else {\n        // negative value -> complex value computation\n        return new 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 Complex(x.toNumber(), 0).log();\n      }\n    },\n    'any, any': typed.referToSelf(function (self) {\n      return function (x, base) {\n        // calculate logarithm for a specified base, log(x, base)\n        return divideScalar(self(x), self(base));\n      };\n    })\n  });\n});\nexports.createLog = createLog;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createLog1p = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _collection = require(\"../../utils/collection.js\");\nvar _number = require(\"../../utils/number.js\");\nvar name = 'log1p';\nvar dependencies = ['typed', 'config', 'divideScalar', 'log', 'Complex'];\nvar createLog1p = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    divideScalar = _ref.divideScalar,\n    log = _ref.log,\n    Complex = _ref.Complex;\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  return typed(name, {\n    number: function number(x) {\n      if (x >= -1 || config.predictable) {\n        return (0, _number.log1p)(x);\n      } else {\n        // negative value -> complex value computation\n        return _log1pComplex(new Complex(x, 0));\n      }\n    },\n    Complex: _log1pComplex,\n    BigNumber: function BigNumber(x) {\n      var y = x.plus(1);\n      if (!y.isNegative() || config.predictable) {\n        return y.ln();\n      } else {\n        // downgrade to number, return Complex valued result\n        return _log1pComplex(new Complex(x.toNumber(), 0));\n      }\n    },\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self);\n      };\n    }),\n    'any, any': typed.referToSelf(function (self) {\n      return function (x, base) {\n        // calculate logarithm for a specified base, log1p(x, base)\n        return divideScalar(self(x), log(base));\n      };\n    })\n  });\n\n  /**\n   * Calculate the natural logarithm of a complex number + 1\n   * @param {Complex} x\n   * @returns {Complex}\n   * @private\n   */\n  function _log1pComplex(x) {\n    var xRe1p = x.re + 1;\n    return new Complex(Math.log(Math.sqrt(xRe1p * xRe1p + x.im * x.im)), Math.atan2(x.im, xRe1p));\n  }\n});\nexports.createLog1p = createLog1p;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createNthRoots = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'nthRoots';\nvar dependencies = ['config', 'typed', 'divideScalar', 'Complex'];\nvar createNthRoots = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    divideScalar = _ref.divideScalar,\n    Complex = _ref.Complex;\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  var _calculateExactResult = [function realPos(val) {\n    return new Complex(val, 0);\n  }, function imagPos(val) {\n    return new Complex(0, val);\n  }, function realNeg(val) {\n    return new Complex(-val, 0);\n  }, function imagNeg(val) {\n    return new Complex(0, -val);\n  }];\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  function _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 [new Complex(0, 0)];\n    var aIsNumeric = typeof a === 'number';\n    var offset;\n    // determine the offset (argument of a)/(pi/2)\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    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      if (halfPiFactor === Math.round(halfPiFactor)) {\n        roots.push(_calculateExactResult[halfPiFactor % 4](r));\n        continue;\n      }\n      roots.push(new Complex({\n        r: r,\n        phi: (arg + 2 * Math.PI * k) / root\n      }));\n    }\n    return roots;\n  }\n\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   *    math.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} x Number to be rounded\n   * @param {number} [root=2] Optional root, default value is 2\n   * @return {number | BigNumber | Fraction | Complex} Returns the nth roots\n   */\n  return typed(name, {\n    Complex: function Complex(x) {\n      return _nthComplexRoots(x, 2);\n    },\n    'Complex, number': _nthComplexRoots\n  });\n});\nexports.createNthRoots = createNthRoots;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createDotPow = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _matAlgo03xDSf = require(\"../../type/matrix/utils/matAlgo03xDSf.js\");\nvar _matAlgo07xSSf = require(\"../../type/matrix/utils/matAlgo07xSSf.js\");\nvar _matAlgo11xS0s = require(\"../../type/matrix/utils/matAlgo11xS0s.js\");\nvar _matAlgo12xSfs = require(\"../../type/matrix/utils/matAlgo12xSfs.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar name = 'dotPow';\nvar dependencies = ['typed', 'equalScalar', 'matrix', 'pow', 'DenseMatrix', 'concat'];\nvar createDotPow = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    equalScalar = _ref.equalScalar,\n    matrix = _ref.matrix,\n    pow = _ref.pow,\n    DenseMatrix = _ref.DenseMatrix,\n    concat = _ref.concat;\n  var matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({\n    typed: typed\n  });\n  var matAlgo07xSSf = (0, _matAlgo07xSSf.createMatAlgo07xSSf)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n  var powScalarSignatures = {};\n  for (var signature in pow.signatures) {\n    if (Object.prototype.hasOwnProperty.call(pow.signatures, signature)) {\n      if (!signature.includes('Matrix') && !signature.includes('Array')) {\n        powScalarSignatures[signature] = pow.signatures[signature];\n      }\n    }\n  }\n  var powScalar = typed(powScalarSignatures);\n\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  return typed(name, matrixAlgorithmSuite({\n    elop: powScalar,\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo11xS0s,\n    sS: matAlgo12xSfs\n  }));\n});\nexports.createDotPow = createDotPow;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createDotDivide = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _matAlgo02xDS = require(\"../../type/matrix/utils/matAlgo02xDS0.js\");\nvar _matAlgo03xDSf = require(\"../../type/matrix/utils/matAlgo03xDSf.js\");\nvar _matAlgo07xSSf = require(\"../../type/matrix/utils/matAlgo07xSSf.js\");\nvar _matAlgo11xS0s = require(\"../../type/matrix/utils/matAlgo11xS0s.js\");\nvar _matAlgo12xSfs = require(\"../../type/matrix/utils/matAlgo12xSfs.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar name = 'dotDivide';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'divideScalar', 'DenseMatrix', 'concat'];\nvar createDotDivide = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    equalScalar = _ref.equalScalar,\n    divideScalar = _ref.divideScalar,\n    DenseMatrix = _ref.DenseMatrix,\n    concat = _ref.concat;\n  var matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({\n    typed: typed\n  });\n  var matAlgo07xSSf = (0, _matAlgo07xSSf.createMatAlgo07xSSf)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n\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  return typed(name, matrixAlgorithmSuite({\n    elop: divideScalar,\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    SD: matAlgo02xDS0,\n    Ss: matAlgo11xS0s,\n    sS: matAlgo12xSfs\n  }));\n});\nexports.createDotDivide = createDotDivide;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSolveValidation = createSolveValidation;\nvar _is = require(\"../../../../utils/is.js\");\nvar _array = require(\"../../../../utils/array.js\");\nvar _string = require(\"../../../../utils/string.js\");\nfunction createSolveValidation(_ref) {\n  var DenseMatrix = _ref.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  return function solveValidation(m, b, copy) {\n    var mSize = m.size();\n    if (mSize.length !== 2) {\n      throw new RangeError('Matrix must be two dimensional (size: ' + (0, _string.format)(mSize) + ')');\n    }\n    var rows = mSize[0];\n    var columns = mSize[1];\n    if (rows !== columns) {\n      throw new RangeError('Matrix must be square (size: ' + (0, _string.format)(mSize) + ')');\n    }\n    var data = [];\n    if ((0, _is.isMatrix)(b)) {\n      var bSize = b.size();\n      var bdata = b._data;\n\n      // 1-dim vector\n      if (bSize.length === 1) {\n        if (bSize[0] !== rows) {\n          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');\n        }\n        for (var i = 0; i < rows; i++) {\n          data[i] = [bdata[i]];\n        }\n        return new DenseMatrix({\n          data: data,\n          size: [rows, 1],\n          datatype: b._datatype\n        });\n      }\n\n      // 2-dim column\n      if (bSize.length === 2) {\n        if (bSize[0] !== rows || bSize[1] !== 1) {\n          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');\n        }\n        if ((0, _is.isDenseMatrix)(b)) {\n          if (copy) {\n            data = [];\n            for (var _i = 0; _i < rows; _i++) {\n              data[_i] = [bdata[_i][0]];\n            }\n            return new DenseMatrix({\n              data: data,\n              size: [rows, 1],\n              datatype: b._datatype\n            });\n          }\n          return b;\n        }\n        if ((0, _is.isSparseMatrix)(b)) {\n          for (var _i2 = 0; _i2 < rows; _i2++) {\n            data[_i2] = [0];\n          }\n          var values = b._values;\n          var index = b._index;\n          var ptr = b._ptr;\n          for (var k1 = ptr[1], k = ptr[0]; k < k1; k++) {\n            var _i3 = index[k];\n            data[_i3][0] = values[k];\n          }\n          return new DenseMatrix({\n            data: data,\n            size: [rows, 1],\n            datatype: b._datatype\n          });\n        }\n      }\n      throw new RangeError('Dimension mismatch. The right side has to be either 1- or 2-dimensional vector.');\n    }\n    if ((0, _is.isArray)(b)) {\n      var bsize = (0, _array.arraySize)(b);\n      if (bsize.length === 1) {\n        if (bsize[0] !== rows) {\n          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');\n        }\n        for (var _i4 = 0; _i4 < rows; _i4++) {\n          data[_i4] = [b[_i4]];\n        }\n        return new DenseMatrix({\n          data: data,\n          size: [rows, 1]\n        });\n      }\n      if (bsize.length === 2) {\n        if (bsize[0] !== rows || bsize[1] !== 1) {\n          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');\n        }\n        for (var _i5 = 0; _i5 < rows; _i5++) {\n          data[_i5] = [b[_i5][0]];\n        }\n        return new DenseMatrix({\n          data: data,\n          size: [rows, 1]\n        });\n      }\n      throw new RangeError('Dimension mismatch. The right side has to be either 1- or 2-dimensional vector.');\n    }\n  };\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createLsolve = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar _solveValidation = require(\"./utils/solveValidation.js\");\nvar name = 'lsolve';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtract', 'equalScalar', 'DenseMatrix'];\nvar createLsolve = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    divideScalar = _ref.divideScalar,\n    multiplyScalar = _ref.multiplyScalar,\n    subtract = _ref.subtract,\n    equalScalar = _ref.equalScalar,\n    DenseMatrix = _ref.DenseMatrix;\n  var solveValidation = (0, _solveValidation.createSolveValidation)({\n    DenseMatrix: DenseMatrix\n  });\n\n  /**\n   * Finds one solution of a linear equation system by forwards substitution. Matrix must be a lower triangular matrix. Throws an error if there's no solution.\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   *    lsolveAll, 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  return typed(name, {\n    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {\n      return _sparseForwardSubstitution(m, b);\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {\n      return _denseForwardSubstitution(m, b);\n    },\n    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {\n      var m = matrix(a);\n      var r = _denseForwardSubstitution(m, b);\n      return r.valueOf();\n    }\n  });\n  function _denseForwardSubstitution(m, b) {\n    // validate matrix and vector, return copy of column vector b\n    b = solveValidation(m, b, true);\n    var bdata = b._data;\n    var rows = m._size[0];\n    var columns = m._size[1];\n\n    // result\n    var x = [];\n    var mdata = m._data;\n\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      var bj = bdata[j][0] || 0;\n      var xj = void 0;\n      if (!equalScalar(bj, 0)) {\n        // non-degenerate row, find solution\n\n        var vjj = mdata[j][j];\n        if (equalScalar(vjj, 0)) {\n          throw new Error('Linear system cannot be solved since matrix is singular');\n        }\n        xj = divideScalar(bj, vjj);\n\n        // loop rows\n        for (var i = j + 1; i < rows; i++) {\n          bdata[i] = [subtract(bdata[i][0] || 0, multiplyScalar(xj, mdata[i][j]))];\n        }\n      } else {\n        // degenerate row, we can choose any value\n        xj = 0;\n      }\n      x[j] = [xj];\n    }\n    return new DenseMatrix({\n      data: x,\n      size: [rows, 1]\n    });\n  }\n  function _sparseForwardSubstitution(m, b) {\n    // validate matrix and vector, return copy of column vector b\n    b = solveValidation(m, b, true);\n    var bdata = b._data;\n    var rows = m._size[0];\n    var columns = m._size[1];\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr;\n\n    // result\n    var x = [];\n\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      var bj = bdata[j][0] || 0;\n      if (!equalScalar(bj, 0)) {\n        // non-degenerate row, find solution\n\n        var vjj = 0;\n        // matrix values & indices (column j)\n        var jValues = [];\n        var jIndices = [];\n\n        // first and last index in the column\n        var firstIndex = ptr[j];\n        var lastIndex = ptr[j + 1];\n\n        // values in column, find value at [j, j]\n        for (var k = firstIndex; k < lastIndex; k++) {\n          var i = index[k];\n\n          // check row (rows are not sorted!)\n          if (i === j) {\n            vjj = values[k];\n          } else if (i > j) {\n            // store lower triangular\n            jValues.push(values[k]);\n            jIndices.push(i);\n          }\n        }\n\n        // at this point we must have a value in vjj\n        if (equalScalar(vjj, 0)) {\n          throw new Error('Linear system cannot be solved since matrix is singular');\n        }\n        var xj = divideScalar(bj, vjj);\n        for (var _k = 0, l = jIndices.length; _k < l; _k++) {\n          var _i = jIndices[_k];\n          bdata[_i] = [subtract(bdata[_i][0] || 0, multiplyScalar(xj, jValues[_k]))];\n        }\n        x[j] = [xj];\n      } else {\n        // degenerate row, we can choose any value\n        x[j] = [0];\n      }\n    }\n    return new DenseMatrix({\n      data: x,\n      size: [rows, 1]\n    });\n  }\n});\nexports.createLsolve = createLsolve;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createUsolve = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar _solveValidation = require(\"./utils/solveValidation.js\");\nvar name = 'usolve';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtract', 'equalScalar', 'DenseMatrix'];\nvar createUsolve = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    divideScalar = _ref.divideScalar,\n    multiplyScalar = _ref.multiplyScalar,\n    subtract = _ref.subtract,\n    equalScalar = _ref.equalScalar,\n    DenseMatrix = _ref.DenseMatrix;\n  var solveValidation = (0, _solveValidation.createSolveValidation)({\n    DenseMatrix: DenseMatrix\n  });\n\n  /**\n   * Finds one solution of a linear equation system by backward substitution. Matrix must be an upper triangular matrix. Throws an error if there's no solution.\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   *    usolveAll, 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  return typed(name, {\n    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {\n      return _sparseBackwardSubstitution(m, b);\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {\n      return _denseBackwardSubstitution(m, b);\n    },\n    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {\n      var m = matrix(a);\n      var r = _denseBackwardSubstitution(m, b);\n      return r.valueOf();\n    }\n  });\n  function _denseBackwardSubstitution(m, b) {\n    // make b into a column vector\n    b = solveValidation(m, b, true);\n    var bdata = b._data;\n    var rows = m._size[0];\n    var columns = m._size[1];\n\n    // result\n    var x = [];\n    var mdata = m._data;\n    // loop columns backwards\n    for (var j = columns - 1; j >= 0; j--) {\n      // b[j]\n      var bj = bdata[j][0] || 0;\n      // x[j]\n      var xj = void 0;\n      if (!equalScalar(bj, 0)) {\n        // value at [j, j]\n        var vjj = mdata[j][j];\n        if (equalScalar(vjj, 0)) {\n          // system cannot be solved\n          throw new Error('Linear system cannot be solved since matrix is singular');\n        }\n        xj = divideScalar(bj, vjj);\n\n        // loop rows\n        for (var i = j - 1; i >= 0; i--) {\n          // update copy of b\n          bdata[i] = [subtract(bdata[i][0] || 0, multiplyScalar(xj, mdata[i][j]))];\n        }\n      } else {\n        // zero value at j\n        xj = 0;\n      }\n      // update x\n      x[j] = [xj];\n    }\n    return new DenseMatrix({\n      data: x,\n      size: [rows, 1]\n    });\n  }\n  function _sparseBackwardSubstitution(m, b) {\n    // make b into a column vector\n    b = solveValidation(m, b, true);\n    var bdata = b._data;\n    var rows = m._size[0];\n    var columns = m._size[1];\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr;\n\n    // result\n    var x = [];\n\n    // loop columns backwards\n    for (var j = columns - 1; j >= 0; j--) {\n      var bj = bdata[j][0] || 0;\n      if (!equalScalar(bj, 0)) {\n        // non-degenerate row, find solution\n\n        var vjj = 0;\n\n        // upper triangular matrix values & index (column j)\n        var jValues = [];\n        var jIndices = [];\n\n        // first & last indeces in column\n        var firstIndex = ptr[j];\n        var lastIndex = ptr[j + 1];\n\n        // values in column, find value at [j, j], loop backwards\n        for (var k = lastIndex - 1; k >= firstIndex; k--) {\n          var i = index[k];\n\n          // check row (rows are not sorted!)\n          if (i === j) {\n            vjj = values[k];\n          } else if (i < j) {\n            // store upper triangular\n            jValues.push(values[k]);\n            jIndices.push(i);\n          }\n        }\n\n        // at this point we must have a value in vjj\n        if (equalScalar(vjj, 0)) {\n          throw new Error('Linear system cannot be solved since matrix is singular');\n        }\n        var xj = divideScalar(bj, vjj);\n        for (var _k = 0, _lastIndex = jIndices.length; _k < _lastIndex; _k++) {\n          var _i = jIndices[_k];\n          bdata[_i] = [subtract(bdata[_i][0], multiplyScalar(xj, jValues[_k]))];\n        }\n        x[j] = [xj];\n      } else {\n        // degenerate row, we can choose any value\n        x[j] = [0];\n      }\n    }\n    return new DenseMatrix({\n      data: x,\n      size: [rows, 1]\n    });\n  }\n});\nexports.createUsolve = createUsolve;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createLsolveAll = void 0;\nvar _toConsumableArray2 = _interopRequireDefault(require(\"@babel/runtime/helpers/toConsumableArray\"));\nvar _factory = require(\"../../../utils/factory.js\");\nvar _solveValidation = require(\"./utils/solveValidation.js\");\nvar name = 'lsolveAll';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtract', 'equalScalar', 'DenseMatrix'];\nvar createLsolveAll = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    divideScalar = _ref.divideScalar,\n    multiplyScalar = _ref.multiplyScalar,\n    subtract = _ref.subtract,\n    equalScalar = _ref.equalScalar,\n    DenseMatrix = _ref.DenseMatrix;\n  var solveValidation = (0, _solveValidation.createSolveValidation)({\n    DenseMatrix: DenseMatrix\n  });\n\n  /**\n   * Finds all solutions of a linear equation system by forwards substitution. Matrix must be a lower triangular matrix.\n   *\n   * `L * x = b`\n   *\n   * Syntax:\n   *\n   *    math.lsolveAll(L, b)\n   *\n   * Examples:\n   *\n   *    const a = [[-2, 3], [2, 1]]\n   *    const b = [11, 9]\n   *    const x = lsolveAll(a, b)  // [ [[-5.5], [20]] ]\n   *\n   * See also:\n   *\n   *    lsolve, 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[]}  An array of affine-independent column vectors (x) that solve the linear system\n   */\n  return typed(name, {\n    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {\n      return _sparseForwardSubstitution(m, b);\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {\n      return _denseForwardSubstitution(m, b);\n    },\n    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {\n      var m = matrix(a);\n      var R = _denseForwardSubstitution(m, b);\n      return R.map(function (r) {\n        return r.valueOf();\n      });\n    }\n  });\n  function _denseForwardSubstitution(m, b_) {\n    // the algorithm is derived from\n    // https://www.overleaf.com/read/csvgqdxggyjv\n\n    // array of right-hand sides\n    var B = [solveValidation(m, b_, true)._data.map(function (e) {\n      return e[0];\n    })];\n    var M = m._data;\n    var rows = m._size[0];\n    var columns = m._size[1];\n\n    // loop columns\n    for (var i = 0; i < columns; i++) {\n      var L = B.length;\n\n      // loop right-hand sides\n      for (var k = 0; k < L; k++) {\n        var b = B[k];\n        if (!equalScalar(M[i][i], 0)) {\n          // non-singular row\n\n          b[i] = divideScalar(b[i], M[i][i]);\n          for (var j = i + 1; j < columns; j++) {\n            // b[j] -= b[i] * M[j,i]\n            b[j] = subtract(b[j], multiplyScalar(b[i], M[j][i]));\n          }\n        } else if (!equalScalar(b[i], 0)) {\n          // singular row, nonzero RHS\n\n          if (k === 0) {\n            // There is no valid solution\n            return [];\n          } else {\n            // This RHS is invalid but other solutions may still exist\n            B.splice(k, 1);\n            k -= 1;\n            L -= 1;\n          }\n        } else if (k === 0) {\n          // singular row, RHS is zero\n\n          var bNew = (0, _toConsumableArray2[\"default\"])(b);\n          bNew[i] = 1;\n          for (var _j = i + 1; _j < columns; _j++) {\n            bNew[_j] = subtract(bNew[_j], M[_j][i]);\n          }\n          B.push(bNew);\n        }\n      }\n    }\n    return B.map(function (x) {\n      return new DenseMatrix({\n        data: x.map(function (e) {\n          return [e];\n        }),\n        size: [rows, 1]\n      });\n    });\n  }\n  function _sparseForwardSubstitution(m, b_) {\n    // array of right-hand sides\n    var B = [solveValidation(m, b_, true)._data.map(function (e) {\n      return e[0];\n    })];\n    var rows = m._size[0];\n    var columns = m._size[1];\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr;\n\n    // loop columns\n    for (var i = 0; i < columns; i++) {\n      var L = B.length;\n\n      // loop right-hand sides\n      for (var k = 0; k < L; k++) {\n        var b = B[k];\n\n        // values & indices (column i)\n        var iValues = [];\n        var iIndices = [];\n\n        // first & last indeces in column\n        var firstIndex = ptr[i];\n        var lastIndex = ptr[i + 1];\n\n        // find the value at [i, i]\n        var Mii = 0;\n        for (var j = firstIndex; j < lastIndex; j++) {\n          var J = index[j];\n          // check row\n          if (J === i) {\n            Mii = values[j];\n          } else if (J > i) {\n            // store lower triangular\n            iValues.push(values[j]);\n            iIndices.push(J);\n          }\n        }\n        if (!equalScalar(Mii, 0)) {\n          // non-singular row\n\n          b[i] = divideScalar(b[i], Mii);\n          for (var _j2 = 0, _lastIndex = iIndices.length; _j2 < _lastIndex; _j2++) {\n            var _J = iIndices[_j2];\n            b[_J] = subtract(b[_J], multiplyScalar(b[i], iValues[_j2]));\n          }\n        } else if (!equalScalar(b[i], 0)) {\n          // singular row, nonzero RHS\n\n          if (k === 0) {\n            // There is no valid solution\n            return [];\n          } else {\n            // This RHS is invalid but other solutions may still exist\n            B.splice(k, 1);\n            k -= 1;\n            L -= 1;\n          }\n        } else if (k === 0) {\n          // singular row, RHS is zero\n\n          var bNew = (0, _toConsumableArray2[\"default\"])(b);\n          bNew[i] = 1;\n          for (var _j3 = 0, _lastIndex2 = iIndices.length; _j3 < _lastIndex2; _j3++) {\n            var _J2 = iIndices[_j3];\n            bNew[_J2] = subtract(bNew[_J2], iValues[_j3]);\n          }\n          B.push(bNew);\n        }\n      }\n    }\n    return B.map(function (x) {\n      return new DenseMatrix({\n        data: x.map(function (e) {\n          return [e];\n        }),\n        size: [rows, 1]\n      });\n    });\n  }\n});\nexports.createLsolveAll = createLsolveAll;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createUsolveAll = void 0;\nvar _toConsumableArray2 = _interopRequireDefault(require(\"@babel/runtime/helpers/toConsumableArray\"));\nvar _factory = require(\"../../../utils/factory.js\");\nvar _solveValidation = require(\"./utils/solveValidation.js\");\nvar name = 'usolveAll';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtract', 'equalScalar', 'DenseMatrix'];\nvar createUsolveAll = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    divideScalar = _ref.divideScalar,\n    multiplyScalar = _ref.multiplyScalar,\n    subtract = _ref.subtract,\n    equalScalar = _ref.equalScalar,\n    DenseMatrix = _ref.DenseMatrix;\n  var solveValidation = (0, _solveValidation.createSolveValidation)({\n    DenseMatrix: DenseMatrix\n  });\n\n  /**\n   * Finds all solutions of a linear equation system by backward substitution. Matrix must be an upper triangular matrix.\n   *\n   * `U * x = b`\n   *\n   * Syntax:\n   *\n   *    math.usolveAll(U, b)\n   *\n   * Examples:\n   *\n   *    const a = [[-2, 3], [2, 1]]\n   *    const b = [11, 9]\n   *    const x = usolveAll(a, b)  // [ [[8], [9]] ]\n   *\n   * See also:\n   *\n   *    usolve, 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[]}  An array of affine-independent column vectors (x) that solve the linear system\n   */\n  return typed(name, {\n    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(m, b) {\n      return _sparseBackwardSubstitution(m, b);\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(m, b) {\n      return _denseBackwardSubstitution(m, b);\n    },\n    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {\n      var m = matrix(a);\n      var R = _denseBackwardSubstitution(m, b);\n      return R.map(function (r) {\n        return r.valueOf();\n      });\n    }\n  });\n  function _denseBackwardSubstitution(m, b_) {\n    // the algorithm is derived from\n    // https://www.overleaf.com/read/csvgqdxggyjv\n\n    // array of right-hand sides\n    var B = [solveValidation(m, b_, true)._data.map(function (e) {\n      return e[0];\n    })];\n    var M = m._data;\n    var rows = m._size[0];\n    var columns = m._size[1];\n\n    // loop columns backwards\n    for (var i = columns - 1; i >= 0; i--) {\n      var L = B.length;\n\n      // loop right-hand sides\n      for (var k = 0; k < L; k++) {\n        var b = B[k];\n        if (!equalScalar(M[i][i], 0)) {\n          // non-singular row\n\n          b[i] = divideScalar(b[i], M[i][i]);\n          for (var j = i - 1; j >= 0; j--) {\n            // b[j] -= b[i] * M[j,i]\n            b[j] = subtract(b[j], multiplyScalar(b[i], M[j][i]));\n          }\n        } else if (!equalScalar(b[i], 0)) {\n          // singular row, nonzero RHS\n\n          if (k === 0) {\n            // There is no valid solution\n            return [];\n          } else {\n            // This RHS is invalid but other solutions may still exist\n            B.splice(k, 1);\n            k -= 1;\n            L -= 1;\n          }\n        } else if (k === 0) {\n          // singular row, RHS is zero\n\n          var bNew = (0, _toConsumableArray2[\"default\"])(b);\n          bNew[i] = 1;\n          for (var _j = i - 1; _j >= 0; _j--) {\n            bNew[_j] = subtract(bNew[_j], M[_j][i]);\n          }\n          B.push(bNew);\n        }\n      }\n    }\n    return B.map(function (x) {\n      return new DenseMatrix({\n        data: x.map(function (e) {\n          return [e];\n        }),\n        size: [rows, 1]\n      });\n    });\n  }\n  function _sparseBackwardSubstitution(m, b_) {\n    // array of right-hand sides\n    var B = [solveValidation(m, b_, true)._data.map(function (e) {\n      return e[0];\n    })];\n    var rows = m._size[0];\n    var columns = m._size[1];\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr;\n\n    // loop columns backwards\n    for (var i = columns - 1; i >= 0; i--) {\n      var L = B.length;\n\n      // loop right-hand sides\n      for (var k = 0; k < L; k++) {\n        var b = B[k];\n\n        // values & indices (column i)\n        var iValues = [];\n        var iIndices = [];\n\n        // first & last indeces in column\n        var firstIndex = ptr[i];\n        var lastIndex = ptr[i + 1];\n\n        // find the value at [i, i]\n        var Mii = 0;\n        for (var j = lastIndex - 1; j >= firstIndex; j--) {\n          var J = index[j];\n          // check row\n          if (J === i) {\n            Mii = values[j];\n          } else if (J < i) {\n            // store upper triangular\n            iValues.push(values[j]);\n            iIndices.push(J);\n          }\n        }\n        if (!equalScalar(Mii, 0)) {\n          // non-singular row\n\n          b[i] = divideScalar(b[i], Mii);\n\n          // loop upper triangular\n          for (var _j2 = 0, _lastIndex = iIndices.length; _j2 < _lastIndex; _j2++) {\n            var _J = iIndices[_j2];\n            b[_J] = subtract(b[_J], multiplyScalar(b[i], iValues[_j2]));\n          }\n        } else if (!equalScalar(b[i], 0)) {\n          // singular row, nonzero RHS\n\n          if (k === 0) {\n            // There is no valid solution\n            return [];\n          } else {\n            // This RHS is invalid but other solutions may still exist\n            B.splice(k, 1);\n            k -= 1;\n            L -= 1;\n          }\n        } else if (k === 0) {\n          // singular row, RHS is zero\n\n          var bNew = (0, _toConsumableArray2[\"default\"])(b);\n          bNew[i] = 1;\n\n          // loop upper triangular\n          for (var _j3 = 0, _lastIndex2 = iIndices.length; _j3 < _lastIndex2; _j3++) {\n            var _J2 = iIndices[_j3];\n            bNew[_J2] = subtract(bNew[_J2], iValues[_j3]);\n          }\n          B.push(bNew);\n        }\n      }\n    }\n    return B.map(function (x) {\n      return new DenseMatrix({\n        data: x.map(function (e) {\n          return [e];\n        }),\n        size: [rows, 1]\n      });\n    });\n  }\n});\nexports.createUsolveAll = createUsolveAll;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMatAlgo08xS0Sid = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar _DimensionError = require(\"../../../error/DimensionError.js\");\nvar name = 'matAlgo08xS0Sid';\nvar dependencies = ['typed', 'equalScalar'];\nvar createMatAlgo08xS0Sid = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    equalScalar = _ref.equalScalar;\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 && B(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  return function matAlgo08xS0Sid(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;\n    // sparse matrix arrays\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;\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new _DimensionError.DimensionError(asize.length, bsize.length);\n    }\n\n    // check rows & columns\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    }\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!avalues || !bvalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrices');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt;\n      // find signature that matches (dt, dt)\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result arrays\n    var cvalues = [];\n    var cindex = [];\n    var cptr = [];\n\n    // workspace\n    var x = [];\n    // marks indicating we have a value in x for a given column\n    var w = [];\n\n    // vars\n    var k, k0, k1, i;\n\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length;\n      // columns mark\n      var mark = j + 1;\n      // loop values in a\n      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = aindex[k];\n        // mark workspace\n        w[i] = mark;\n        // set value\n        x[i] = avalues[k];\n        // add index\n        cindex.push(i);\n      }\n      // loop values in b\n      for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = bindex[k];\n        // check value exists in workspace\n        if (w[i] === mark) {\n          // evaluate callback\n          x[i] = cf(x[i], bvalues[k]);\n        }\n      }\n      // initialize first index in j\n      k = cptr[j];\n      // loop index in j\n      while (k < cindex.length) {\n        // row\n        i = cindex[k];\n        // value @ i\n        var v = x[i];\n        // check for zero value\n        if (!eq(v, zero)) {\n          // push value\n          cvalues.push(v);\n          // increment pointer\n          k++;\n        } else {\n          // remove value @ i, do not increment pointer\n          cindex.splice(k, 1);\n        }\n      }\n    }\n    // update cptr\n    cptr[columns] = cindex.length;\n\n    // return sparse matrix\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});\nexports.createMatAlgo08xS0Sid = createMatAlgo08xS0Sid;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createUseMatrixForArrayScalar = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar createUseMatrixForArrayScalar = /* #__PURE__ */(0, _factory.factory)('useMatrixForArrayScalar', ['typed', 'matrix'], function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix;\n  return {\n    'Array, number': typed.referTo('DenseMatrix, number', function (selfDn) {\n      return function (x, y) {\n        return selfDn(matrix(x), y).valueOf();\n      };\n    }),\n    'Array, BigNumber': typed.referTo('DenseMatrix, BigNumber', function (selfDB) {\n      return function (x, y) {\n        return selfDB(matrix(x), y).valueOf();\n      };\n    }),\n    'number, Array': typed.referTo('number, DenseMatrix', function (selfnD) {\n      return function (x, y) {\n        return selfnD(x, matrix(y)).valueOf();\n      };\n    }),\n    'BigNumber, Array': typed.referTo('BigNumber, DenseMatrix', function (selfBD) {\n      return function (x, y) {\n        return selfBD(x, matrix(y)).valueOf();\n      };\n    })\n  };\n});\nexports.createUseMatrixForArrayScalar = createUseMatrixForArrayScalar;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createLeftShift = void 0;\nvar _matAlgo02xDS = require(\"../../type/matrix/utils/matAlgo02xDS0.js\");\nvar _matAlgo11xS0s = require(\"../../type/matrix/utils/matAlgo11xS0s.js\");\nvar _matAlgo14xDs = require(\"../../type/matrix/utils/matAlgo14xDs.js\");\nvar _matAlgo01xDSid = require(\"../../type/matrix/utils/matAlgo01xDSid.js\");\nvar _matAlgo10xSids = require(\"../../type/matrix/utils/matAlgo10xSids.js\");\nvar _matAlgo08xS0Sid = require(\"../../type/matrix/utils/matAlgo08xS0Sid.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar _useMatrixForArrayScalar = require(\"./useMatrixForArrayScalar.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar _bitwise = require(\"../../utils/bignumber/bitwise.js\");\nvar name = 'leftShift';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix', 'concat'];\nvar createLeftShift = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    equalScalar = _ref.equalScalar,\n    zeros = _ref.zeros,\n    DenseMatrix = _ref.DenseMatrix,\n    concat = _ref.concat;\n  var matAlgo01xDSid = (0, _matAlgo01xDSid.createMatAlgo01xDSid)({\n    typed: typed\n  });\n  var matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo08xS0Sid = (0, _matAlgo08xS0Sid.createMatAlgo08xS0Sid)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo10xSids = (0, _matAlgo10xSids.createMatAlgo10xSids)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({\n    typed: typed\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n  var useMatrixForArrayScalar = (0, _useMatrixForArrayScalar.createUseMatrixForArrayScalar)({\n    typed: typed,\n    matrix: matrix\n  });\n\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, 4], 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  return typed(name, {\n    'number, number': _index.leftShiftNumber,\n    'BigNumber, BigNumber': _bitwise.leftShiftBigNumber,\n    'SparseMatrix, number | BigNumber': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // check scalar\n        if (equalScalar(y, 0)) {\n          return x.clone();\n        }\n        return matAlgo11xS0s(x, y, self, false);\n      };\n    }),\n    'DenseMatrix, number | BigNumber': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // check scalar\n        if (equalScalar(y, 0)) {\n          return x.clone();\n        }\n        return matAlgo14xDs(x, y, self, false);\n      };\n    }),\n    'number | BigNumber, SparseMatrix': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // check scalar\n        if (equalScalar(x, 0)) {\n          return zeros(y.size(), y.storage());\n        }\n        return matAlgo10xSids(y, x, self, true);\n      };\n    }),\n    'number | BigNumber, DenseMatrix': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // check scalar\n        if (equalScalar(x, 0)) {\n          return zeros(y.size(), y.storage());\n        }\n        return matAlgo14xDs(y, x, self, true);\n      };\n    })\n  }, useMatrixForArrayScalar, matrixAlgorithmSuite({\n    SS: matAlgo08xS0Sid,\n    DS: matAlgo01xDSid,\n    SD: matAlgo02xDS0\n  }));\n});\nexports.createLeftShift = createLeftShift;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createRightArithShift = void 0;\nvar _bitwise = require(\"../../utils/bignumber/bitwise.js\");\nvar _matAlgo02xDS = require(\"../../type/matrix/utils/matAlgo02xDS0.js\");\nvar _matAlgo11xS0s = require(\"../../type/matrix/utils/matAlgo11xS0s.js\");\nvar _matAlgo14xDs = require(\"../../type/matrix/utils/matAlgo14xDs.js\");\nvar _matAlgo01xDSid = require(\"../../type/matrix/utils/matAlgo01xDSid.js\");\nvar _matAlgo10xSids = require(\"../../type/matrix/utils/matAlgo10xSids.js\");\nvar _matAlgo08xS0Sid = require(\"../../type/matrix/utils/matAlgo08xS0Sid.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar _useMatrixForArrayScalar = require(\"./useMatrixForArrayScalar.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'rightArithShift';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix', 'concat'];\nvar createRightArithShift = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    equalScalar = _ref.equalScalar,\n    zeros = _ref.zeros,\n    DenseMatrix = _ref.DenseMatrix,\n    concat = _ref.concat;\n  var matAlgo01xDSid = (0, _matAlgo01xDSid.createMatAlgo01xDSid)({\n    typed: typed\n  });\n  var matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo08xS0Sid = (0, _matAlgo08xS0Sid.createMatAlgo08xS0Sid)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo10xSids = (0, _matAlgo10xSids.createMatAlgo10xSids)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({\n    typed: typed\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n  var useMatrixForArrayScalar = (0, _useMatrixForArrayScalar.createUseMatrixForArrayScalar)({\n    typed: typed,\n    matrix: matrix\n  });\n\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, 4]\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` zero-filled shifted right `y` times\n   */\n  return typed(name, {\n    'number, number': _index.rightArithShiftNumber,\n    'BigNumber, BigNumber': _bitwise.rightArithShiftBigNumber,\n    'SparseMatrix, number | BigNumber': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // check scalar\n        if (equalScalar(y, 0)) {\n          return x.clone();\n        }\n        return matAlgo11xS0s(x, y, self, false);\n      };\n    }),\n    'DenseMatrix, number | BigNumber': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // check scalar\n        if (equalScalar(y, 0)) {\n          return x.clone();\n        }\n        return matAlgo14xDs(x, y, self, false);\n      };\n    }),\n    'number | BigNumber, SparseMatrix': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // check scalar\n        if (equalScalar(x, 0)) {\n          return zeros(y.size(), y.storage());\n        }\n        return matAlgo10xSids(y, x, self, true);\n      };\n    }),\n    'number | BigNumber, DenseMatrix': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // check scalar\n        if (equalScalar(x, 0)) {\n          return zeros(y.size(), y.storage());\n        }\n        return matAlgo14xDs(y, x, self, true);\n      };\n    })\n  }, useMatrixForArrayScalar, matrixAlgorithmSuite({\n    SS: matAlgo08xS0Sid,\n    DS: matAlgo01xDSid,\n    SD: matAlgo02xDS0\n  }));\n});\nexports.createRightArithShift = createRightArithShift;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createRightLogShift = void 0;\nvar _matAlgo02xDS = require(\"../../type/matrix/utils/matAlgo02xDS0.js\");\nvar _matAlgo11xS0s = require(\"../../type/matrix/utils/matAlgo11xS0s.js\");\nvar _matAlgo14xDs = require(\"../../type/matrix/utils/matAlgo14xDs.js\");\nvar _matAlgo01xDSid = require(\"../../type/matrix/utils/matAlgo01xDSid.js\");\nvar _matAlgo10xSids = require(\"../../type/matrix/utils/matAlgo10xSids.js\");\nvar _matAlgo08xS0Sid = require(\"../../type/matrix/utils/matAlgo08xS0Sid.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar _useMatrixForArrayScalar = require(\"./useMatrixForArrayScalar.js\");\nvar name = 'rightLogShift';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix', 'concat'];\nvar createRightLogShift = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    equalScalar = _ref.equalScalar,\n    zeros = _ref.zeros,\n    DenseMatrix = _ref.DenseMatrix,\n    concat = _ref.concat;\n  var matAlgo01xDSid = (0, _matAlgo01xDSid.createMatAlgo01xDSid)({\n    typed: typed\n  });\n  var matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo08xS0Sid = (0, _matAlgo08xS0Sid.createMatAlgo08xS0Sid)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo10xSids = (0, _matAlgo10xSids.createMatAlgo10xSids)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({\n    typed: typed\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n  var useMatrixForArrayScalar = (0, _useMatrixForArrayScalar.createUseMatrixForArrayScalar)({\n    typed: typed,\n    matrix: matrix\n  });\n\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, 4]\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  return typed(name, {\n    'number, number': _index.rightLogShiftNumber,\n    // 'BigNumber, BigNumber': ..., // TODO: implement BigNumber support for rightLogShift\n\n    'SparseMatrix, number | BigNumber': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // check scalar\n        if (equalScalar(y, 0)) {\n          return x.clone();\n        }\n        return matAlgo11xS0s(x, y, self, false);\n      };\n    }),\n    'DenseMatrix, number | BigNumber': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // check scalar\n        if (equalScalar(y, 0)) {\n          return x.clone();\n        }\n        return matAlgo14xDs(x, y, self, false);\n      };\n    }),\n    'number | BigNumber, SparseMatrix': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // check scalar\n        if (equalScalar(x, 0)) {\n          return zeros(y.size(), y.storage());\n        }\n        return matAlgo10xSids(y, x, self, true);\n      };\n    }),\n    'number | BigNumber, DenseMatrix': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // check scalar\n        if (equalScalar(x, 0)) {\n          return zeros(y.size(), y.storage());\n        }\n        return matAlgo14xDs(y, x, self, true);\n      };\n    })\n  }, useMatrixForArrayScalar, matrixAlgorithmSuite({\n    SS: matAlgo08xS0Sid,\n    DS: matAlgo01xDSid,\n    SD: matAlgo02xDS0\n  }));\n});\nexports.createRightLogShift = createRightLogShift;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createAnd = void 0;\nvar _matAlgo02xDS = require(\"../../type/matrix/utils/matAlgo02xDS0.js\");\nvar _matAlgo11xS0s = require(\"../../type/matrix/utils/matAlgo11xS0s.js\");\nvar _matAlgo14xDs = require(\"../../type/matrix/utils/matAlgo14xDs.js\");\nvar _matAlgo06xS0S = require(\"../../type/matrix/utils/matAlgo06xS0S0.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'and';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'not', 'concat'];\nvar createAnd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    equalScalar = _ref.equalScalar,\n    zeros = _ref.zeros,\n    not = _ref.not,\n    concat = _ref.concat;\n  var matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo06xS0S0 = (0, _matAlgo06xS0S.createMatAlgo06xS0S0)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({\n    typed: typed\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n\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  return typed(name, {\n    'number, number': _index.andNumber,\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': typed.referToSelf(function (self) {\n      return function (x, y) {\n        return self(x.value || 0, y.value || 0);\n      };\n    }),\n    'SparseMatrix, any': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // check scalar\n        if (not(y)) {\n          // return zero matrix\n          return zeros(x.size(), x.storage());\n        }\n        return matAlgo11xS0s(x, y, self, false);\n      };\n    }),\n    'DenseMatrix, any': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // check scalar\n        if (not(y)) {\n          // return zero matrix\n          return zeros(x.size(), x.storage());\n        }\n        return matAlgo14xDs(x, y, self, false);\n      };\n    }),\n    'any, SparseMatrix': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // check scalar\n        if (not(x)) {\n          // return zero matrix\n          return zeros(x.size(), x.storage());\n        }\n        return matAlgo11xS0s(y, x, self, true);\n      };\n    }),\n    'any, DenseMatrix': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // check scalar\n        if (not(x)) {\n          // return zero matrix\n          return zeros(x.size(), x.storage());\n        }\n        return matAlgo14xDs(y, x, self, true);\n      };\n    }),\n    'Array, any': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // use matrix implementation\n        return self(matrix(x), y).valueOf();\n      };\n    }),\n    'any, Array': typed.referToSelf(function (self) {\n      return function (x, y) {\n        // use matrix implementation\n        return self(x, matrix(y)).valueOf();\n      };\n    })\n  }, matrixAlgorithmSuite({\n    SS: matAlgo06xS0S0,\n    DS: matAlgo02xDS0\n  }));\n});\nexports.createAnd = createAnd;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCompareNumber = exports.createCompare = void 0;\nvar _nearlyEqual = require(\"../../utils/bignumber/nearlyEqual.js\");\nvar _number = require(\"../../utils/number.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _matAlgo03xDSf = require(\"../../type/matrix/utils/matAlgo03xDSf.js\");\nvar _matAlgo12xSfs = require(\"../../type/matrix/utils/matAlgo12xSfs.js\");\nvar _matAlgo05xSfSf = require(\"../../type/matrix/utils/matAlgo05xSfSf.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar _compareUnits = require(\"./compareUnits.js\");\nvar name = 'compare';\nvar dependencies = ['typed', 'config', 'matrix', 'equalScalar', 'BigNumber', 'Fraction', 'DenseMatrix', 'concat'];\nvar createCompare = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    equalScalar = _ref.equalScalar,\n    matrix = _ref.matrix,\n    BigNumber = _ref.BigNumber,\n    Fraction = _ref.Fraction,\n    DenseMatrix = _ref.DenseMatrix,\n    concat = _ref.concat;\n  var matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({\n    typed: typed\n  });\n  var matAlgo05xSfSf = (0, _matAlgo05xSfSf.createMatAlgo05xSfSf)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n  var compareUnits = (0, _compareUnits.createCompareUnits)({\n    typed: typed\n  });\n\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  return typed(name, createCompareNumber({\n    typed: typed,\n    config: config\n  }), {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x === y ? 0 : x > y ? 1 : -1;\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return (0, _nearlyEqual.nearlyEqual)(x, y, config.epsilon) ? new BigNumber(0) : new BigNumber(x.cmp(y));\n    },\n    'Fraction, Fraction': function FractionFraction(x, y) {\n      return new Fraction(x.compare(y));\n    },\n    'Complex, Complex': function ComplexComplex() {\n      throw new TypeError('No ordering relation is defined for complex numbers');\n    }\n  }, compareUnits, matrixAlgorithmSuite({\n    SS: matAlgo05xSfSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo12xSfs\n  }));\n});\nexports.createCompare = createCompare;\nvar createCompareNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'config'], function (_ref2) {\n  var typed = _ref2.typed,\n    config = _ref2.config;\n  return typed(name, {\n    'number, number': function numberNumber(x, y) {\n      return (0, _number.nearlyEqual)(x, y, config.epsilon) ? 0 : x > y ? 1 : -1;\n    }\n  });\n});\nexports.createCompareNumber = createCompareNumber;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCompareNatural = void 0;\nvar _javascriptNaturalSort = _interopRequireDefault(require(\"javascript-natural-sort\"));\nvar _is = require(\"../../utils/is.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'compareNatural';\nvar dependencies = ['typed', 'compare'];\nvar createCompareNatural = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    compare = _ref.compare;\n  var compareBooleans = compare.signatures['boolean,boolean'];\n\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  return typed(name, {\n    'any, any': _compareNatural\n  }); // just to check # args\n\n  function _compareNatural(x, y) {\n    var typeX = (0, _is.typeOf)(x);\n    var typeY = (0, _is.typeOf)(y);\n    var c;\n\n    // numeric types\n    if ((typeX === 'number' || typeX === 'BigNumber' || typeX === 'Fraction') && (typeY === 'number' || typeY === 'BigNumber' || typeY === 'Fraction')) {\n      c = compare(x, y);\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 (0, _javascriptNaturalSort[\"default\"])(typeX, typeY);\n      }\n    }\n\n    // matrix types\n    var matTypes = ['Array', 'DenseMatrix', 'SparseMatrix'];\n    if (matTypes.includes(typeX) || matTypes.includes(typeY)) {\n      c = compareMatricesAndArrays(_compareNatural, x, y);\n      if (c !== 0) {\n        return c;\n      } else {\n        return (0, _javascriptNaturalSort[\"default\"])(typeX, typeY);\n      }\n    }\n\n    // in case of different types, order by name of type, i.e. 'BigNumber' < 'Complex'\n    if (typeX !== typeY) {\n      return (0, _javascriptNaturalSort[\"default\"])(typeX, typeY);\n    }\n    if (typeX === 'Complex') {\n      return compareComplexNumbers(x, y);\n    }\n    if (typeX === 'Unit') {\n      if (x.equalBase(y)) {\n        return _compareNatural(x.value, y.value);\n      }\n\n      // compare by units\n      return compareArrays(_compareNatural, x.formatUnits(), y.formatUnits());\n    }\n    if (typeX === 'boolean') {\n      return compareBooleans(x, y);\n    }\n    if (typeX === 'string') {\n      return (0, _javascriptNaturalSort[\"default\"])(x, y);\n    }\n    if (typeX === 'Object') {\n      return compareObjects(_compareNatural, x, y);\n    }\n    if (typeX === 'null') {\n      return 0;\n    }\n    if (typeX === 'undefined') {\n      return 0;\n    }\n\n    // this should not occur...\n    throw new TypeError('Unsupported type of value \"' + typeX + '\"');\n  }\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  function compareMatricesAndArrays(compareNatural, x, y) {\n    if ((0, _is.isSparseMatrix)(x) && (0, _is.isSparseMatrix)(y)) {\n      return compareArrays(compareNatural, x.toJSON().values, y.toJSON().values);\n    }\n    if ((0, _is.isSparseMatrix)(x)) {\n      // note: convert to array is expensive\n      return compareMatricesAndArrays(compareNatural, x.toArray(), y);\n    }\n    if ((0, _is.isSparseMatrix)(y)) {\n      // note: convert to array is expensive\n      return compareMatricesAndArrays(compareNatural, x, y.toArray());\n    }\n\n    // convert DenseArray into Array\n    if ((0, _is.isDenseMatrix)(x)) {\n      return compareMatricesAndArrays(compareNatural, x.toJSON().data, y);\n    }\n    if ((0, _is.isDenseMatrix)(y)) {\n      return compareMatricesAndArrays(compareNatural, x, y.toJSON().data);\n    }\n\n    // convert scalars to array\n    if (!Array.isArray(x)) {\n      return compareMatricesAndArrays(compareNatural, [x], y);\n    }\n    if (!Array.isArray(y)) {\n      return compareMatricesAndArrays(compareNatural, x, [y]);\n    }\n    return compareArrays(compareNatural, x, y);\n  }\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  function compareArrays(compareNatural, 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      if (v !== 0) {\n        return v;\n      }\n    }\n\n    // compare the size of the arrays\n    if (x.length > y.length) {\n      return 1;\n    }\n    if (x.length < y.length) {\n      return -1;\n    }\n\n    // both Arrays have equal size and content\n    return 0;\n  }\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  function compareObjects(compareNatural, x, y) {\n    var keysX = Object.keys(x);\n    var keysY = Object.keys(y);\n\n    // compare keys\n    keysX.sort(_javascriptNaturalSort[\"default\"]);\n    keysY.sort(_javascriptNaturalSort[\"default\"]);\n    var c = compareArrays(compareNatural, keysX, keysY);\n    if (c !== 0) {\n      return c;\n    }\n\n    // compare values\n    for (var i = 0; i < keysX.length; i++) {\n      var v = compareNatural(x[keysX[i]], y[keysY[i]]);\n      if (v !== 0) {\n        return v;\n      }\n    }\n    return 0;\n  }\n});\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 */\nexports.createCompareNatural = createCompareNatural;\nfunction compareComplexNumbers(x, y) {\n  if (x.re > y.re) {\n    return 1;\n  }\n  if (x.re < y.re) {\n    return -1;\n  }\n  if (x.im > y.im) {\n    return 1;\n  }\n  if (x.im < y.im) {\n    return -1;\n  }\n  return 0;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCompareTextNumber = exports.createCompareText = void 0;\nvar _string = require(\"../../utils/string.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar name = 'compareText';\nvar dependencies = ['typed', 'matrix', 'concat'];\n_string.compareText.signature = 'any, any';\nvar createCompareText = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    concat = _ref.concat;\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n\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  return typed(name, _string.compareText, matrixAlgorithmSuite({\n    elop: _string.compareText,\n    Ds: true\n  }));\n});\nexports.createCompareText = createCompareText;\nvar createCompareTextNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed'], function (_ref2) {\n  var typed = _ref2.typed;\n  return typed(name, _string.compareText);\n});\nexports.createCompareTextNumber = createCompareTextNumber;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createEqualNumber = exports.createEqual = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _matAlgo03xDSf = require(\"../../type/matrix/utils/matAlgo03xDSf.js\");\nvar _matAlgo07xSSf = require(\"../../type/matrix/utils/matAlgo07xSSf.js\");\nvar _matAlgo12xSfs = require(\"../../type/matrix/utils/matAlgo12xSfs.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar name = 'equal';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix', 'concat'];\nvar createEqual = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    equalScalar = _ref.equalScalar,\n    DenseMatrix = _ref.DenseMatrix,\n    concat = _ref.concat;\n  var matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({\n    typed: typed\n  });\n  var matAlgo07xSSf = (0, _matAlgo07xSSf.createMatAlgo07xSSf)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n\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  return typed(name, createEqualNumber({\n    typed: typed,\n    equalScalar: equalScalar\n  }), matrixAlgorithmSuite({\n    elop: equalScalar,\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo12xSfs\n  }));\n});\nexports.createEqual = createEqual;\nvar createEqualNumber = (0, _factory.factory)(name, ['typed', 'equalScalar'], function (_ref2) {\n  var typed = _ref2.typed,\n    equalScalar = _ref2.equalScalar;\n  return typed(name, {\n    'any, any': function anyAny(x, y) {\n      // strict equality for null and undefined?\n      if (x === null) {\n        return y === null;\n      }\n      if (y === null) {\n        return x === null;\n      }\n      if (x === undefined) {\n        return y === undefined;\n      }\n      if (y === undefined) {\n        return x === undefined;\n      }\n      return equalScalar(x, y);\n    }\n  });\n});\nexports.createEqualNumber = createEqualNumber;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createEqualText = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'equalText';\nvar dependencies = ['typed', 'compareText', 'isZero'];\nvar createEqualText = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    compareText = _ref.compareText,\n    isZero = _ref.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  return typed(name, {\n    'any, any': function anyAny(x, y) {\n      return isZero(compareText(x, y));\n    }\n  });\n});\nexports.createEqualText = createEqualText;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSmallerNumber = exports.createSmaller = void 0;\nvar _nearlyEqual = require(\"../../utils/bignumber/nearlyEqual.js\");\nvar _number = require(\"../../utils/number.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _matAlgo03xDSf = require(\"../../type/matrix/utils/matAlgo03xDSf.js\");\nvar _matAlgo07xSSf = require(\"../../type/matrix/utils/matAlgo07xSSf.js\");\nvar _matAlgo12xSfs = require(\"../../type/matrix/utils/matAlgo12xSfs.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar _compareUnits = require(\"./compareUnits.js\");\nvar name = 'smaller';\nvar dependencies = ['typed', 'config', 'matrix', 'DenseMatrix', 'concat'];\nvar createSmaller = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    matrix = _ref.matrix,\n    DenseMatrix = _ref.DenseMatrix,\n    concat = _ref.concat;\n  var matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({\n    typed: typed\n  });\n  var matAlgo07xSSf = (0, _matAlgo07xSSf.createMatAlgo07xSSf)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n  var compareUnits = (0, _compareUnits.createCompareUnits)({\n    typed: typed\n  });\n\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  return typed(name, createSmallerNumber({\n    typed: typed,\n    config: config\n  }), {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x < y;\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.lt(y) && !(0, _nearlyEqual.nearlyEqual)(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  }, compareUnits, matrixAlgorithmSuite({\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo12xSfs\n  }));\n});\nexports.createSmaller = createSmaller;\nvar createSmallerNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'config'], function (_ref2) {\n  var typed = _ref2.typed,\n    config = _ref2.config;\n  return typed(name, {\n    'number, number': function numberNumber(x, y) {\n      return x < y && !(0, _number.nearlyEqual)(x, y, config.epsilon);\n    }\n  });\n});\nexports.createSmallerNumber = createSmallerNumber;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSmallerEqNumber = exports.createSmallerEq = void 0;\nvar _nearlyEqual = require(\"../../utils/bignumber/nearlyEqual.js\");\nvar _number = require(\"../../utils/number.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _matAlgo03xDSf = require(\"../../type/matrix/utils/matAlgo03xDSf.js\");\nvar _matAlgo07xSSf = require(\"../../type/matrix/utils/matAlgo07xSSf.js\");\nvar _matAlgo12xSfs = require(\"../../type/matrix/utils/matAlgo12xSfs.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar _compareUnits = require(\"./compareUnits.js\");\nvar name = 'smallerEq';\nvar dependencies = ['typed', 'config', 'matrix', 'DenseMatrix', 'concat'];\nvar createSmallerEq = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    matrix = _ref.matrix,\n    DenseMatrix = _ref.DenseMatrix,\n    concat = _ref.concat;\n  var matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({\n    typed: typed\n  });\n  var matAlgo07xSSf = (0, _matAlgo07xSSf.createMatAlgo07xSSf)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n  var compareUnits = (0, _compareUnits.createCompareUnits)({\n    typed: typed\n  });\n\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  return typed(name, createSmallerEqNumber({\n    typed: typed,\n    config: config\n  }), {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x <= y;\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.lte(y) || (0, _nearlyEqual.nearlyEqual)(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  }, compareUnits, matrixAlgorithmSuite({\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo12xSfs\n  }));\n});\nexports.createSmallerEq = createSmallerEq;\nvar createSmallerEqNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'config'], function (_ref2) {\n  var typed = _ref2.typed,\n    config = _ref2.config;\n  return typed(name, {\n    'number, number': function numberNumber(x, y) {\n      return x <= y || (0, _number.nearlyEqual)(x, y, config.epsilon);\n    }\n  });\n});\nexports.createSmallerEqNumber = createSmallerEqNumber;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createLargerNumber = exports.createLarger = void 0;\nvar _nearlyEqual = require(\"../../utils/bignumber/nearlyEqual.js\");\nvar _number = require(\"../../utils/number.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _matAlgo03xDSf = require(\"../../type/matrix/utils/matAlgo03xDSf.js\");\nvar _matAlgo07xSSf = require(\"../../type/matrix/utils/matAlgo07xSSf.js\");\nvar _matAlgo12xSfs = require(\"../../type/matrix/utils/matAlgo12xSfs.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar _compareUnits = require(\"./compareUnits.js\");\nvar name = 'larger';\nvar dependencies = ['typed', 'config', 'matrix', 'DenseMatrix', 'concat'];\nvar createLarger = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    matrix = _ref.matrix,\n    DenseMatrix = _ref.DenseMatrix,\n    concat = _ref.concat;\n  var matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({\n    typed: typed\n  });\n  var matAlgo07xSSf = (0, _matAlgo07xSSf.createMatAlgo07xSSf)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n  var compareUnits = (0, _compareUnits.createCompareUnits)({\n    typed: typed\n  });\n\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  return typed(name, createLargerNumber({\n    typed: typed,\n    config: config\n  }), {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x > y;\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.gt(y) && !(0, _nearlyEqual.nearlyEqual)(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  }, compareUnits, matrixAlgorithmSuite({\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo12xSfs\n  }));\n});\nexports.createLarger = createLarger;\nvar createLargerNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'config'], function (_ref2) {\n  var typed = _ref2.typed,\n    config = _ref2.config;\n  return typed(name, {\n    'number, number': function numberNumber(x, y) {\n      return x > y && !(0, _number.nearlyEqual)(x, y, config.epsilon);\n    }\n  });\n});\nexports.createLargerNumber = createLargerNumber;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createLargerEqNumber = exports.createLargerEq = void 0;\nvar _nearlyEqual = require(\"../../utils/bignumber/nearlyEqual.js\");\nvar _number = require(\"../../utils/number.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _matAlgo03xDSf = require(\"../../type/matrix/utils/matAlgo03xDSf.js\");\nvar _matAlgo07xSSf = require(\"../../type/matrix/utils/matAlgo07xSSf.js\");\nvar _matAlgo12xSfs = require(\"../../type/matrix/utils/matAlgo12xSfs.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar _compareUnits = require(\"./compareUnits.js\");\nvar name = 'largerEq';\nvar dependencies = ['typed', 'config', 'matrix', 'DenseMatrix', 'concat'];\nvar createLargerEq = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    matrix = _ref.matrix,\n    DenseMatrix = _ref.DenseMatrix,\n    concat = _ref.concat;\n  var matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({\n    typed: typed\n  });\n  var matAlgo07xSSf = (0, _matAlgo07xSSf.createMatAlgo07xSSf)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n  var compareUnits = (0, _compareUnits.createCompareUnits)({\n    typed: typed\n  });\n\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  return typed(name, createLargerEqNumber({\n    typed: typed,\n    config: config\n  }), {\n    'boolean, boolean': function booleanBoolean(x, y) {\n      return x >= y;\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {\n      return x.gte(y) || (0, _nearlyEqual.nearlyEqual)(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  }, compareUnits, matrixAlgorithmSuite({\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo12xSfs\n  }));\n});\nexports.createLargerEq = createLargerEq;\nvar createLargerEqNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'config'], function (_ref2) {\n  var typed = _ref2.typed,\n    config = _ref2.config;\n  return typed(name, {\n    'number, number': function numberNumber(x, y) {\n      return x >= y || (0, _number.nearlyEqual)(x, y, config.epsilon);\n    }\n  });\n});\nexports.createLargerEqNumber = createLargerEqNumber;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createDeepEqual = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'deepEqual';\nvar dependencies = ['typed', 'equal'];\nvar createDeepEqual = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    equal = _ref.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  return typed(name, {\n    'any, any': function anyAny(x, y) {\n      return _deepEqual(x.valueOf(), y.valueOf());\n    }\n  });\n\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  function _deepEqual(x, y) {\n    if (Array.isArray(x)) {\n      if (Array.isArray(y)) {\n        var len = x.length;\n        if (len !== y.length) {\n          return false;\n        }\n        for (var i = 0; i < len; i++) {\n          if (!_deepEqual(x[i], y[i])) {\n            return false;\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});\nexports.createDeepEqual = createDeepEqual;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createUnequalNumber = exports.createUnequal = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _matAlgo03xDSf = require(\"../../type/matrix/utils/matAlgo03xDSf.js\");\nvar _matAlgo07xSSf = require(\"../../type/matrix/utils/matAlgo07xSSf.js\");\nvar _matAlgo12xSfs = require(\"../../type/matrix/utils/matAlgo12xSfs.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar name = 'unequal';\nvar dependencies = ['typed', 'config', 'equalScalar', 'matrix', 'DenseMatrix', 'concat'];\nvar createUnequal = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    equalScalar = _ref.equalScalar,\n    matrix = _ref.matrix,\n    DenseMatrix = _ref.DenseMatrix,\n    concat = _ref.concat;\n  var matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({\n    typed: typed\n  });\n  var matAlgo07xSSf = (0, _matAlgo07xSSf.createMatAlgo07xSSf)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n\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  return typed(name, createUnequalNumber({\n    typed: typed,\n    equalScalar: equalScalar\n  }), matrixAlgorithmSuite({\n    elop: _unequal,\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo12xSfs\n  }));\n  function _unequal(x, y) {\n    return !equalScalar(x, y);\n  }\n});\nexports.createUnequal = createUnequal;\nvar createUnequalNumber = (0, _factory.factory)(name, ['typed', 'equalScalar'], function (_ref2) {\n  var typed = _ref2.typed,\n    equalScalar = _ref2.equalScalar;\n  return typed(name, {\n    'any, any': function anyAny(x, y) {\n      // strict equality for null and undefined?\n      if (x === null) {\n        return y !== null;\n      }\n      if (y === null) {\n        return x !== null;\n      }\n      if (x === undefined) {\n        return y !== undefined;\n      }\n      if (y === undefined) {\n        return x !== undefined;\n      }\n      return !equalScalar(x, y);\n    }\n  });\n});\nexports.createUnequalNumber = createUnequalNumber;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createPartitionSelect = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _number = require(\"../../utils/number.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'partitionSelect';\nvar dependencies = ['typed', 'isNumeric', 'isNaN', 'compare'];\nvar createPartitionSelect = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    isNumeric = _ref.isNumeric,\n    isNaN = _ref.isNaN,\n    compare = _ref.compare;\n  var asc = compare;\n  var desc = function desc(a, b) {\n    return -compare(a, b);\n  };\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, math.compareText)   // 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   *    // the input array is mutated\n   *    arr = [5, 2, 1]\n   *    math.partitionSelect(arr, 0) // returns 1, arr is now: [1, 2, 5]\n   *    math.partitionSelect(arr, 1, 'desc') // returns 2, arr is now: [5, 2, 1]\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  return typed(name, {\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  function _partitionSelect(x, k, compare) {\n    if (!(0, _number.isInteger)(k) || k < 0) {\n      throw new Error('k must be a non-negative integer');\n    }\n    if ((0, _is.isMatrix)(x)) {\n      var size = x.size();\n      if (size.length > 1) {\n        throw new Error('Only one dimensional matrices supported');\n      }\n      return quickSelect(x.valueOf(), k, compare);\n    }\n    if (Array.isArray(x)) {\n      return quickSelect(x, k, compare);\n    }\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  function quickSelect(arr, k, compare) {\n    if (k >= arr.length) {\n      throw new Error('k out of bounds');\n    }\n\n    // check for NaN values since these can cause an infinite while loop\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;\n\n    // if from == to we reached the kth element\n    while (from < to) {\n      var r = from;\n      var w = to;\n      var pivot = arr[Math.floor(Math.random() * (to - from + 1)) + from];\n\n      // stop if the reader and writer meets\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      }\n\n      // if we stepped up (r++) we need to step one down (arr[r] > pivot)\n      if (compare(arr[r], pivot) > 0) {\n        --r;\n      }\n\n      // the r pointer is on the end of the first k elements\n      if (k <= r) {\n        to = r;\n      } else {\n        from = r + 1;\n      }\n    }\n    return arr[k];\n  }\n});\nexports.createPartitionSelect = createPartitionSelect;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSort = void 0;\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'sort';\nvar dependencies = ['typed', 'matrix', 'compare', 'compareNatural'];\nvar createSort = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    compare = _ref.compare,\n    compareNatural = _ref.compareNatural;\n  var compareAsc = compare;\n  var compareDesc = function compareDesc(a, b) {\n    return -compare(a, b);\n  };\n\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  return typed(name, {\n    Array: function Array(x) {\n      _arrayIsVector(x);\n      return x.sort(compareAsc);\n    },\n    Matrix: function Matrix(x) {\n      _matrixIsVector(x);\n      return matrix(x.toArray().sort(compareAsc), x.storage());\n    },\n    'Array, function': function ArrayFunction(x, _comparator) {\n      _arrayIsVector(x);\n      return x.sort(_comparator);\n    },\n    'Matrix, function': function MatrixFunction(x, _comparator) {\n      _matrixIsVector(x);\n      return matrix(x.toArray().sort(_comparator), x.storage());\n    },\n    'Array, string': function ArrayString(x, order) {\n      _arrayIsVector(x);\n      return x.sort(_comparator(order));\n    },\n    'Matrix, string': function MatrixString(x, order) {\n      _matrixIsVector(x);\n      return matrix(x.toArray().sort(_comparator(order)), x.storage());\n    }\n  });\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  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  /**\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  function _arrayIsVector(array) {\n    if ((0, _array.arraySize)(array).length !== 1) {\n      throw new Error('One dimensional array expected');\n    }\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  function _matrixIsVector(matrix) {\n    if (matrix.size().length !== 1) {\n      throw new Error('One dimensional matrix expected');\n    }\n  }\n});\nexports.createSort = createSort;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMax = void 0;\nvar _collection = require(\"../../utils/collection.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _improveErrorMessage = require(\"./utils/improveErrorMessage.js\");\nvar name = 'max';\nvar dependencies = ['typed', 'config', 'numeric', 'larger'];\nvar createMax = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    numeric = _ref.numeric,\n    larger = _ref.larger;\n  /**\n   * Compute the maximum value of a matrix or a  list with values.\n   * In case of a multidimensional 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, dimension)\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, variance\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The maximum value\n   */\n  return typed(name, {\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 (0, _collection.reduce)(array, dim.valueOf(), _largest);\n    },\n    // max(a, b, c, d, ...)\n    '...': function _(args) {\n      if ((0, _collection.containsCollections)(args)) {\n        throw new TypeError('Scalar values expected in function max');\n      }\n      return _max(args);\n    }\n  });\n\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  function _largest(x, y) {\n    try {\n      return larger(x, y) ? x : y;\n    } catch (err) {\n      throw (0, _improveErrorMessage.improveErrorMessage)(err, 'max', y);\n    }\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  function _max(array) {\n    var res;\n    (0, _collection.deepForEach)(array, function (value) {\n      try {\n        if (isNaN(value) && typeof value === 'number') {\n          res = NaN;\n        } else if (res === undefined || larger(value, res)) {\n          res = value;\n        }\n      } catch (err) {\n        throw (0, _improveErrorMessage.improveErrorMessage)(err, 'max', value);\n      }\n    });\n    if (res === undefined) {\n      throw new Error('Cannot calculate max of an empty array');\n    }\n\n    // make sure returning numeric value: parse a string into a numeric value\n    if (typeof res === 'string') {\n      res = numeric(res, config.number);\n    }\n    return res;\n  }\n});\nexports.createMax = createMax;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMin = void 0;\nvar _collection = require(\"../../utils/collection.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _improveErrorMessage = require(\"./utils/improveErrorMessage.js\");\nvar name = 'min';\nvar dependencies = ['typed', 'config', 'numeric', 'smaller'];\nvar createMin = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    numeric = _ref.numeric,\n    smaller = _ref.smaller;\n  /**\n   * Compute the minimum value of a matrix or a  list of values.\n   * In case of a multidimensional 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, dimension)\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, variance\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The minimum value\n   */\n  return typed(name, {\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 (0, _collection.reduce)(array, dim.valueOf(), _smallest);\n    },\n    // min(a, b, c, d, ...)\n    '...': function _(args) {\n      if ((0, _collection.containsCollections)(args)) {\n        throw new TypeError('Scalar values expected in function min');\n      }\n      return _min(args);\n    }\n  });\n\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  function _smallest(x, y) {\n    try {\n      return smaller(x, y) ? x : y;\n    } catch (err) {\n      throw (0, _improveErrorMessage.improveErrorMessage)(err, 'min', y);\n    }\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  function _min(array) {\n    var min;\n    (0, _collection.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 (0, _improveErrorMessage.improveErrorMessage)(err, 'min', value);\n      }\n    });\n    if (min === undefined) {\n      throw new Error('Cannot calculate min of an empty array');\n    }\n\n    // make sure returning numeric value: parse a string into a numeric value\n    if (typeof min === 'string') {\n      min = numeric(min, config.number);\n    }\n    return min;\n  }\n});\nexports.createMin = createMin;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createImmutableDenseMatrixClass = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _object = require(\"../../utils/object.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'ImmutableDenseMatrix';\nvar dependencies = ['smaller', 'DenseMatrix'];\nvar createImmutableDenseMatrixClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var smaller = _ref.smaller,\n    DenseMatrix = _ref.DenseMatrix;\n  function ImmutableDenseMatrix(data, datatype) {\n    if (!(this instanceof ImmutableDenseMatrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n    if (datatype && !(0, _is.isString)(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\n    }\n    if ((0, _is.isMatrix)(data) || (0, _is.isArray)(data)) {\n      // use DenseMatrix implementation\n      var matrix = new DenseMatrix(data, datatype);\n      // internal structures\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 && (0, _is.isArray)(data.data) && (0, _is.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 (' + (0, _is.typeOf)(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  ImmutableDenseMatrix.prototype = new DenseMatrix();\n\n  /**\n   * Attach type information\n   */\n  ImmutableDenseMatrix.prototype.type = 'ImmutableDenseMatrix';\n  ImmutableDenseMatrix.prototype.isImmutableDenseMatrix = true;\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 | 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  ImmutableDenseMatrix.prototype.subset = function (index) {\n    switch (arguments.length) {\n      case 1:\n        {\n          // use base implementation\n          var m = DenseMatrix.prototype.subset.call(this, index);\n          // check result is a matrix\n          if ((0, _is.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          return m;\n        }\n      // intentional fall through\n      case 2:\n      case 3:\n        throw new Error('Cannot invoke set subset on an Immutable Matrix instance');\n      default:\n        throw new SyntaxError('Wrong number of arguments');\n    }\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  ImmutableDenseMatrix.prototype.set = function () {\n    throw new Error('Cannot invoke set on an Immutable Matrix instance');\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   * @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  ImmutableDenseMatrix.prototype.resize = function () {\n    throw new Error('Cannot invoke resize on an Immutable Matrix instance');\n  };\n\n  /**\n   * Disallows reshaping in favor of immutability.\n   *\n   * @throws {Error} Operation not allowed\n   */\n  ImmutableDenseMatrix.prototype.reshape = function () {\n    throw new Error('Cannot invoke reshape on an Immutable Matrix instance');\n  };\n\n  /**\n   * Create a clone of the matrix\n   * @return {ImmutableDenseMatrix} clone\n   */\n  ImmutableDenseMatrix.prototype.clone = function () {\n    return new ImmutableDenseMatrix({\n      data: (0, _object.clone)(this._data),\n      size: (0, _object.clone)(this._size),\n      datatype: this._datatype\n    });\n  };\n\n  /**\n   * Get a JSON representation of the matrix\n   * @returns {Object}\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  /**\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  ImmutableDenseMatrix.fromJSON = function (json) {\n    return new ImmutableDenseMatrix(json);\n  };\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  ImmutableDenseMatrix.prototype.swapRows = function () {\n    throw new Error('Cannot invoke swapRows on an Immutable Matrix instance');\n  };\n\n  /**\n   * Calculate the minimum value in the set\n   * @return {Number | undefined} min\n   */\n  ImmutableDenseMatrix.prototype.min = function () {\n    // check min has been calculated before\n    if (this._min === null) {\n      // minimum\n      var m = null;\n      // compute min\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    return this._min;\n  };\n\n  /**\n   * Calculate the maximum value in the set\n   * @return {Number | undefined} max\n   */\n  ImmutableDenseMatrix.prototype.max = function () {\n    // check max has been calculated before\n    if (this._max === null) {\n      // maximum\n      var m = null;\n      // compute max\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    return this._max;\n  };\n  return ImmutableDenseMatrix;\n}, {\n  isClass: true\n});\nexports.createImmutableDenseMatrixClass = createImmutableDenseMatrixClass;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createIndexClass = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _object = require(\"../../utils/object.js\");\nvar _number = require(\"../../utils/number.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'Index';\nvar dependencies = ['ImmutableDenseMatrix'];\nvar createIndexClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var ImmutableDenseMatrix = _ref.ImmutableDenseMatrix;\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    this._dimensions = [];\n    this._isScalar = true;\n    for (var i = 0, ii = arguments.length; i < ii; i++) {\n      var arg = arguments[i];\n      if ((0, _is.isRange)(arg)) {\n        this._dimensions.push(arg);\n        this._isScalar = false;\n      } else if (Array.isArray(arg) || (0, _is.isMatrix)(arg)) {\n        // create matrix\n        var m = _createImmutableMatrix(arg.valueOf());\n        this._dimensions.push(m);\n        // size\n        var size = m.size();\n        // scalar\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      }\n      // TODO: implement support for wildcard '*'\n    }\n  }\n\n  /**\n   * Attach type information\n   */\n  Index.prototype.type = 'Index';\n  Index.prototype.isIndex = true;\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' || !(0, _number.isInteger)(arg[i])) {\n        throw new TypeError('Index parameters must be positive integer numbers');\n      }\n    }\n    // create matrix\n    return new ImmutableDenseMatrix(arg);\n  }\n\n  /**\n   * Create a clone of the index\n   * @memberof Index\n   * @return {Index} clone\n   */\n  Index.prototype.clone = function () {\n    var index = new Index();\n    index._dimensions = (0, _object.clone)(this._dimensions);\n    index._isScalar = this._isScalar;\n    return index;\n  };\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  Index.create = function (ranges) {\n    var index = new Index();\n    Index.apply(index, ranges);\n    return index;\n  };\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  Index.prototype.size = function () {\n    var size = [];\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    return size;\n  };\n\n  /**\n   * Get the maximum value for each of the indexes ranges.\n   * @memberof Index\n   * @returns {number[]} max\n   */\n  Index.prototype.max = function () {\n    var values = [];\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    return values;\n  };\n\n  /**\n   * Get the minimum value for each of the indexes ranges.\n   * @memberof Index\n   * @returns {number[]} min\n   */\n  Index.prototype.min = function () {\n    var values = [];\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    return values;\n  };\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  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  /**\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  Index.prototype.dimension = function (dim) {\n    return this._dimensions[dim] || null;\n  };\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  Index.prototype.isObjectProperty = function () {\n    return this._dimensions.length === 1 && typeof this._dimensions[0] === 'string';\n  };\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  Index.prototype.getObjectProperty = function () {\n    return this.isObjectProperty() ? this._dimensions[0] : null;\n  };\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  Index.prototype.isScalar = function () {\n    return this._isScalar;\n  };\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  Index.prototype.toArray = function () {\n    var array = [];\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    return array;\n  };\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  Index.prototype.valueOf = Index.prototype.toArray;\n\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  Index.prototype.toString = function () {\n    var strings = [];\n    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {\n      var dimension = this._dimensions[i];\n      if (typeof dimension === 'string') {\n        strings.push(JSON.stringify(dimension));\n      } else {\n        strings.push(dimension.toString());\n      }\n    }\n    return '[' + strings.join(', ') + ']';\n  };\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  Index.prototype.toJSON = function () {\n    return {\n      mathjs: 'Index',\n      dimensions: this._dimensions\n    };\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  Index.fromJSON = function (json) {\n    return Index.create(json.dimensions);\n  };\n  return Index;\n}, {\n  isClass: true\n});\nexports.createIndexClass = createIndexClass;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createFibonacciHeapClass = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'FibonacciHeap';\nvar dependencies = ['smaller', 'larger'];\nvar createFibonacciHeapClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var smaller = _ref.smaller,\n    larger = _ref.larger;\n  var oneOverLogPhi = 1.0 / Math.log((1.0 + Math.sqrt(5.0)) / 2.0);\n\n  /**\n   * Fibonacci Heap implementation, used interally for Matrix math.\n   * @class FibonacciHeap\n   * @constructor FibonacciHeap\n   */\n  function FibonacciHeap() {\n    if (!(this instanceof FibonacciHeap)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    // initialize fields\n    this._minimum = null;\n    this._size = 0;\n  }\n\n  /**\n   * Attach type information\n   */\n  FibonacciHeap.prototype.type = 'FibonacciHeap';\n  FibonacciHeap.prototype.isFibonacciHeap = true;\n\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  FibonacciHeap.prototype.insert = function (key, value) {\n    // create node\n    var node = {\n      key: key,\n      value: value,\n      degree: 0\n    };\n    // check we have a node in the minimum\n    if (this._minimum) {\n      // minimum node\n      var minimum = this._minimum;\n      // update left & right of node\n      node.left = minimum;\n      node.right = minimum.right;\n      minimum.right = node;\n      node.right.left = node;\n      // update minimum node in heap if needed\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;\n      // this is the first node\n      this._minimum = node;\n    }\n    // increment number of nodes in heap\n    this._size++;\n    // return node\n    return node;\n  };\n\n  /**\n   * Returns the number of nodes in heap. Running time: O(1) actual.\n   * @memberof FibonacciHeap\n   */\n  FibonacciHeap.prototype.size = function () {\n    return this._size;\n  };\n\n  /**\n   * Removes all elements from this heap.\n   * @memberof FibonacciHeap\n   */\n  FibonacciHeap.prototype.clear = function () {\n    this._minimum = null;\n    this._size = 0;\n  };\n\n  /**\n   * Returns true if the heap is empty, otherwise false.\n   * @memberof FibonacciHeap\n   */\n  FibonacciHeap.prototype.isEmpty = function () {\n    return this._size === 0;\n  };\n\n  /**\n   * Extracts the node with minimum key from heap. Amortized running\n   * time: O(log n).\n   * @memberof FibonacciHeap\n   */\n  FibonacciHeap.prototype.extractMinimum = function () {\n    // node to remove\n    var node = this._minimum;\n    // check we have a minimum\n    if (node === null) {\n      return node;\n    }\n    // current minimum\n    var minimum = this._minimum;\n    // get number of children\n    var numberOfChildren = node.degree;\n    // pointer to the first child\n    var x = node.child;\n    // for each child of node do...\n    while (numberOfChildren > 0) {\n      // store node in right side\n      var tempRight = x.right;\n      // remove x from child list\n      x.left.right = x.right;\n      x.right.left = x.left;\n      // add x to root list of heap\n      x.left = minimum;\n      x.right = minimum.right;\n      minimum.right = x;\n      x.right.left = x;\n      // set Parent[x] to null\n      x.parent = null;\n      x = tempRight;\n      numberOfChildren--;\n    }\n    // remove node from root list of heap\n    node.left.right = node.right;\n    node.right.left = node.left;\n    // update minimum\n    if (node === node.right) {\n      // empty\n      minimum = null;\n    } else {\n      // update minimum\n      minimum = node.right;\n      // we need to update the pointer to the root with minimum key\n      minimum = _findMinimumNode(minimum, this._size);\n    }\n    // decrement size of heap\n    this._size--;\n    // update minimum\n    this._minimum = minimum;\n    // return node\n    return node;\n  };\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  FibonacciHeap.prototype.remove = function (node) {\n    // decrease key value\n    this._minimum = _decreaseKey(this._minimum, node, -1);\n    // remove the smallest\n    this.extractMinimum();\n  };\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  function _decreaseKey(minimum, node, key) {\n    // set node key\n    node.key = key;\n    // get parent node\n    var parent = node.parent;\n    if (parent && smaller(node.key, parent.key)) {\n      // remove node from parent\n      _cut(minimum, node, parent);\n      // remove all nodes from parent to the root parent\n      _cascadingCut(minimum, parent);\n    }\n    // update minimum node if needed\n    if (smaller(node.key, minimum.key)) {\n      minimum = node;\n    }\n    // return minimum\n    return minimum;\n  }\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  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--;\n    // reset y.child if necessary\n    if (parent.child === node) {\n      parent.child = node.right;\n    }\n    // remove child if degree is 0\n    if (parent.degree === 0) {\n      parent.child = null;\n    }\n    // add node to root list of heap\n    node.left = minimum;\n    node.right = minimum.right;\n    minimum.right = node;\n    node.right.left = node;\n    // set parent[node] to null\n    node.parent = null;\n    // set mark[node] to false\n    node.mark = false;\n  }\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  function _cascadingCut(minimum, node) {\n    // store parent node\n    var parent = node.parent;\n    // if there's a parent...\n    if (!parent) {\n      return;\n    }\n    // if node is unmarked, set it marked\n    if (!node.mark) {\n      node.mark = true;\n    } else {\n      // it's marked, cut it from parent\n      _cut(minimum, node, parent);\n      // cut its parent as well\n      _cascadingCut(parent);\n    }\n  }\n\n  /**\n   * Make the first node a child of the second one. Running time: O(1) actual.\n   * @memberof FibonacciHeap\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;\n    // make node a Child of parent\n    node.parent = parent;\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    }\n    // increase degree[parent]\n    parent.degree++;\n    // set mark[node] false\n    node.mark = false;\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;\n    // create list with initial capacity\n    var array = new Array(arraySize);\n    // find the number of root nodes.\n    var numRoots = 0;\n    var x = minimum;\n    if (x) {\n      numRoots++;\n      x = x.right;\n      while (x !== minimum) {\n        numRoots++;\n        x = x.right;\n      }\n    }\n    // vars\n    var y;\n    // For each node in root list do...\n    while (numRoots > 0) {\n      // access this node's degree..\n      var d = x.degree;\n      // get next node\n      var next = x.right;\n      // check if there is a node already in array with the same degree\n      while (true) {\n        // get node with the same degree is any\n        y = array[d];\n        if (!y) {\n          break;\n        }\n        // make one node with the same degree a child of the other, do this based on the key value.\n        if (larger(x.key, y.key)) {\n          var temp = y;\n          y = x;\n          x = temp;\n        }\n        // make y a child of x\n        _linkNodes(y, x);\n        // we have handled this degree, go to next one.\n        array[d] = null;\n        d++;\n      }\n      // save this node for later when we might encounter another of the same degree.\n      array[d] = x;\n      // move forward through list.\n      x = next;\n      numRoots--;\n    }\n    // Set min to null (effectively losing the root list) and reconstruct the root list from the array entries in array[].\n    minimum = null;\n    // loop nodes in array\n    for (var i = 0; i < arraySize; i++) {\n      // get current node\n      y = array[i];\n      if (!y) {\n        continue;\n      }\n      // check if we have a linked list\n      if (minimum) {\n        // First remove node from root list.\n        y.left.right = y.right;\n        y.right.left = y.left;\n        // now add to root list, again.\n        y.left = minimum;\n        y.right = minimum.right;\n        minimum.right = y;\n        y.right.left = y;\n        // check if this is a new min.\n        if (smaller(y.key, minimum.key)) {\n          minimum = y;\n        }\n      } else {\n        minimum = y;\n      }\n    }\n    return minimum;\n  }\n  return FibonacciHeap;\n}, {\n  isClass: true\n});\nexports.createFibonacciHeapClass = createFibonacciHeapClass;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSpaClass = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'Spa';\nvar dependencies = ['addScalar', 'equalScalar', 'FibonacciHeap'];\nvar createSpaClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var addScalar = _ref.addScalar,\n    equalScalar = _ref.equalScalar,\n    FibonacciHeap = _ref.FibonacciHeap;\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  function Spa() {\n    if (!(this instanceof Spa)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n\n    // allocate vector, TODO use typed arrays\n    this._values = [];\n    this._heap = new FibonacciHeap();\n  }\n\n  /**\n   * Attach type information\n   */\n  Spa.prototype.type = 'Spa';\n  Spa.prototype.isSpa = true;\n\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  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);\n      // set the value @ i\n      this._values[i] = node;\n    } else {\n      // update the value @ i\n      this._values[i].value = v;\n    }\n  };\n  Spa.prototype.get = function (i) {\n    var node = this._values[i];\n    if (node) {\n      return node.value;\n    }\n    return 0;\n  };\n  Spa.prototype.accumulate = function (i, v) {\n    // node @ i\n    var node = this._values[i];\n    if (!node) {\n      // insert in heap\n      node = this._heap.insert(i, v);\n      // initialize value\n      this._values[i] = node;\n    } else {\n      // accumulate value\n      node.value = addScalar(node.value, v);\n    }\n  };\n  Spa.prototype.forEach = function (from, to, callback) {\n    // references\n    var heap = this._heap;\n    var values = this._values;\n    // nodes\n    var nodes = [];\n    // node with minimum key, save it\n    var node = heap.extractMinimum();\n    if (node) {\n      nodes.push(node);\n    }\n    // extract nodes from heap (ordered)\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      }\n      // extract next node, save it\n      node = heap.extractMinimum();\n      if (node) {\n        nodes.push(node);\n      }\n    }\n    // reinsert all nodes in heap\n    for (var i = 0; i < nodes.length; i++) {\n      // current node\n      var n = nodes[i];\n      // insert node in heap\n      node = heap.insert(n.key, n.value);\n      // update values\n      values[node.key] = node;\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];\n    // check we need to insert indeces\n    if (!nodei && nodej) {\n      // insert in heap\n      nodei = this._heap.insert(i, nodej.value);\n      // remove from heap\n      this._heap.remove(nodej);\n      // set values\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);\n      // remove from heap\n      this._heap.remove(nodei);\n      // set values\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  return Spa;\n}, {\n  isClass: true\n});\nexports.createSpaClass = createSpaClass;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createBigNumberTau = exports.createBigNumberPi = exports.createBigNumberPhi = exports.createBigNumberE = void 0;\nvar _function = require(\"../function.js\");\n/**\n * Calculate BigNumber e\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns e\n */\nvar createBigNumberE = (0, _function.memoize)(function (BigNumber) {\n  return new BigNumber(1).exp();\n}, {\n  hasher: hasher\n});\n\n/**\n * Calculate BigNumber golden ratio, phi = (1+sqrt(5))/2\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns phi\n */\nexports.createBigNumberE = createBigNumberE;\nvar createBigNumberPhi = (0, _function.memoize)(function (BigNumber) {\n  return new BigNumber(1).plus(new BigNumber(5).sqrt()).div(2);\n}, {\n  hasher: hasher\n});\n\n/**\n * Calculate BigNumber pi.\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns pi\n */\nexports.createBigNumberPhi = createBigNumberPhi;\nvar createBigNumberPi = (0, _function.memoize)(function (BigNumber) {\n  return BigNumber.acos(-1);\n}, {\n  hasher: hasher\n});\n\n/**\n * Calculate BigNumber tau, tau = 2 * pi\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns tau\n */\nexports.createBigNumberPi = createBigNumberPi;\nvar createBigNumberTau = (0, _function.memoize)(function (BigNumber) {\n  return createBigNumberPi(BigNumber).times(2);\n}, {\n  hasher: hasher\n});\n\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 */\nexports.createBigNumberTau = createBigNumberTau;\nfunction hasher(args) {\n  return args[0].precision;\n}","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createUnitClass = void 0;\nvar _typeof2 = _interopRequireDefault(require(\"@babel/runtime/helpers/typeof\"));\nvar _defineProperty2 = _interopRequireDefault(require(\"@babel/runtime/helpers/defineProperty\"));\nvar _extends2 = _interopRequireDefault(require(\"@babel/runtime/helpers/extends\"));\nvar _is = require(\"../../utils/is.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _function = require(\"../../utils/function.js\");\nvar _string = require(\"../../utils/string.js\");\nvar _object = require(\"../../utils/object.js\");\nvar _constants = require(\"../../utils/bignumber/constants.js\");\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { (0, _defineProperty2[\"default\"])(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }\nvar name = 'Unit';\nvar dependencies = ['?on', 'config', 'addScalar', 'subtract', 'multiplyScalar', 'divideScalar', 'pow', 'abs', 'fix', 'round', 'equal', 'isNumeric', 'format', 'number', 'Complex', 'BigNumber', 'Fraction'];\nvar createUnitClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var on = _ref.on,\n    config = _ref.config,\n    addScalar = _ref.addScalar,\n    subtract = _ref.subtract,\n    multiplyScalar = _ref.multiplyScalar,\n    divideScalar = _ref.divideScalar,\n    pow = _ref.pow,\n    abs = _ref.abs,\n    fix = _ref.fix,\n    round = _ref.round,\n    equal = _ref.equal,\n    isNumeric = _ref.isNumeric,\n    format = _ref.format,\n    number = _ref.number,\n    Complex = _ref.Complex,\n    _BigNumber = _ref.BigNumber,\n    _Fraction = _ref.Fraction;\n  var toNumber = number;\n  /**\n   * A unit can be constructed in the following ways:\n   *\n   *     const a = new Unit(value, valuelessUnit)\n   *     const b = new Unit(null, valuelessUnit)\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 | Unit} valuelessUnit   A unit without value. Can have prefix, like \"cm\"\n   */\n  function Unit(value, valuelessUnit) {\n    if (!(this instanceof Unit)) {\n      throw new Error('Constructor must be called with the new operator');\n    }\n    if (!(value === null || value === undefined || isNumeric(value) || (0, _is.isComplex)(value))) {\n      throw new TypeError('First parameter in Unit constructor must be number, BigNumber, Fraction, Complex, or undefined');\n    }\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\n    // The justification behind this is that if the constructor is explicitly called,\n    // the caller wishes the units to be returned exactly as supplied.\n    this.skipAutomaticSimplification = true;\n    if (valuelessUnit === undefined) {\n      this.units = [];\n      this.dimensions = BASE_DIMENSIONS.map(function (x) {\n        return 0;\n      });\n    } else if (typeof valuelessUnit === 'string') {\n      var u = Unit.parse(valuelessUnit);\n      this.units = u.units;\n      this.dimensions = u.dimensions;\n    } else if ((0, _is.isUnit)(valuelessUnit) && valuelessUnit.value === null) {\n      // clone from valuelessUnit\n      this.fixPrefix = valuelessUnit.fixPrefix;\n      this.skipAutomaticSimplification = valuelessUnit.skipAutomaticSimplification;\n      this.dimensions = valuelessUnit.dimensions.slice(0);\n      this.units = valuelessUnit.units.map(function (u) {\n        return (0, _extends2[\"default\"])({}, u);\n      });\n    } else {\n      throw new TypeError('Second parameter in Unit constructor must be a string or valueless Unit');\n    }\n    this.value = this._normalize(value);\n  }\n\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(Unit, 'name', {\n    value: 'Unit'\n  });\n  Unit.prototype.constructor = Unit;\n  Unit.prototype.type = 'Unit';\n  Unit.prototype.isUnit = true;\n\n  // private variables and functions for the Unit parser\n  var text, index, c;\n  function skipWhitespace() {\n    while (c === ' ' || c === '\\t') {\n      next();\n    }\n  }\n  function isDigitDot(c) {\n    return c >= '0' && c <= '9' || c === '.';\n  }\n  function isDigit(c) {\n    return c >= '0' && c <= '9';\n  }\n  function next() {\n    index++;\n    c = text.charAt(index);\n  }\n  function revert(oldIndex) {\n    index = oldIndex;\n    c = text.charAt(index);\n  }\n  function parseNumber() {\n    var number = '';\n    var oldIndex = index;\n    if (c === '+') {\n      next();\n    } else if (c === '-') {\n      number += c;\n      next();\n    }\n    if (!isDigitDot(c)) {\n      // a + or - must be followed by a digit\n      revert(oldIndex);\n      return null;\n    }\n\n    // get number, can have a single dot\n    if (c === '.') {\n      number += c;\n      next();\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      if (c === '.') {\n        number += c;\n        next();\n      }\n    }\n    while (isDigit(c)) {\n      number += c;\n      next();\n    }\n\n    // check for exponential notation like \"2.3e-4\" or \"1.23e50\"\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\n      var tentativeNumber = '';\n      var tentativeIndex = index;\n      tentativeNumber += c;\n      next();\n      if (c === '+' || c === '-') {\n        tentativeNumber += c;\n        next();\n      }\n\n      // Scientific notation MUST be followed by an exponent (otherwise we assume it is not scientific notation)\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      }\n\n      // We can now safely say that this is scientific notation.\n      number = number + tentativeNumber;\n      while (isDigit(c)) {\n        number += c;\n        next();\n      }\n    }\n    return number;\n  }\n  function parseUnit() {\n    var unitName = '';\n\n    // Alphanumeric characters only; matches [a-zA-Z0-9]\n    while (isDigit(c) || Unit.isValidAlpha(c)) {\n      unitName += c;\n      next();\n    }\n\n    // Must begin with [a-zA-Z]\n    var firstC = unitName.charAt(0);\n    if (Unit.isValidAlpha(firstC)) {\n      return unitName;\n    } else {\n      return null;\n    }\n  }\n  function parseCharacter(toFind) {\n    if (c === toFind) {\n      next();\n      return toFind;\n    } else {\n      return null;\n    }\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  Unit.parse = function (str, options) {\n    options = options || {};\n    text = str;\n    index = -1;\n    c = '';\n    if (typeof text !== 'string') {\n      throw new TypeError('Invalid argument in Unit.parse, string expected');\n    }\n    var unit = new Unit();\n    unit.units = [];\n    var powerMultiplierCurrent = 1;\n    var expectingUnit = false;\n\n    // A unit should follow this pattern:\n    // [number] ...[ [*/] unit[^number] ]\n    // unit[^number] ... [ [*/] unit[^number] ]\n\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();\n\n    // Optional number at the start of the string\n    var valueStr = parseNumber();\n    var value = null;\n    if (valueStr) {\n      if (config.number === 'BigNumber') {\n        value = new _BigNumber(valueStr);\n      } else if (config.number === 'Fraction') {\n        try {\n          // not all numbers can be turned in Fractions, for example very small numbers not\n          value = new _Fraction(valueStr);\n        } catch (err) {\n          value = parseFloat(valueStr);\n        }\n      } else {\n        // number\n        value = parseFloat(valueStr);\n      }\n      skipWhitespace(); // Whitespace is not required here\n\n      // handle multiplication or division right after the value, like '1/s'\n      if (parseCharacter('*')) {\n        powerMultiplierCurrent = 1;\n        expectingUnit = true;\n      } else if (parseCharacter('/')) {\n        powerMultiplierCurrent = -1;\n        expectingUnit = true;\n      }\n    }\n\n    // Stack to keep track of powerMultipliers applied to each parentheses group\n    var powerMultiplierStack = [];\n\n    // Running product of all elements in powerMultiplierStack\n    var powerMultiplierStackProduct = 1;\n    while (true) {\n      skipWhitespace();\n\n      // Check for and consume opening parentheses, pushing powerMultiplierCurrent to the stack\n      // A '(' will always appear directly before a unit.\n      while (c === '(') {\n        powerMultiplierStack.push(powerMultiplierCurrent);\n        powerMultiplierStackProduct *= powerMultiplierCurrent;\n        powerMultiplierCurrent = 1;\n        next();\n        skipWhitespace();\n      }\n\n      // Is there something here?\n      var uStr = void 0;\n      if (c) {\n        var oldC = c;\n        uStr = parseUnit();\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      }\n\n      // Verify the unit exists and get the prefix (if any)\n      var res = _findUnit(uStr);\n      if (res === null) {\n        // Unit not found.\n        throw new SyntaxError('Unit \"' + uStr + '\" not found.');\n      }\n      var power = powerMultiplierCurrent * powerMultiplierStackProduct;\n      // Is there a \"^ number\"?\n      skipWhitespace();\n      if (parseCharacter('^')) {\n        skipWhitespace();\n        var p = parseNumber();\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        power *= p;\n      }\n\n      // Add the unit to the list\n      unit.units.push({\n        unit: res.unit,\n        prefix: res.prefix,\n        power: power\n      });\n      for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n        unit.dimensions[i] += (res.unit.dimensions[i] || 0) * power;\n      }\n\n      // Check for and consume closing parentheses, popping from the stack.\n      // A ')' will always follow a unit.\n      skipWhitespace();\n      while (c === ')') {\n        if (powerMultiplierStack.length === 0) {\n          throw new SyntaxError('Unmatched \")\" in \"' + text + '\" at index ' + index.toString());\n        }\n        powerMultiplierStackProduct /= powerMultiplierStack.pop();\n        next();\n        skipWhitespace();\n      }\n\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      expectingUnit = false;\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      }\n\n      // Replace the unit into the auto unit system\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    }\n\n    // Has the string been entirely consumed?\n    skipWhitespace();\n    if (c) {\n      throw new SyntaxError('Could not parse: \"' + str + '\"');\n    }\n\n    // Is there a trailing slash?\n    if (expectingUnit) {\n      throw new SyntaxError('Trailing characters: \"' + str + '\"');\n    }\n\n    // Is the parentheses stack empty?\n    if (powerMultiplierStack.length !== 0) {\n      throw new SyntaxError('Unmatched \"(\" in \"' + text + '\"');\n    }\n\n    // Are there any units at all?\n    if (unit.units.length === 0 && !options.allowNoUnits) {\n      throw new SyntaxError('\"' + str + '\" contains no units');\n    }\n    unit.value = value !== undefined ? unit._normalize(value) : null;\n    return unit;\n  };\n\n  /**\n   * create a copy of this unit\n   * @memberof Unit\n   * @return {Unit} Returns a cloned version of the unit\n   */\n  Unit.prototype.clone = function () {\n    var unit = new Unit();\n    unit.fixPrefix = this.fixPrefix;\n    unit.skipAutomaticSimplification = this.skipAutomaticSimplification;\n    unit.value = (0, _object.clone)(this.value);\n    unit.dimensions = this.dimensions.slice(0);\n    unit.units = [];\n    for (var i = 0; i < this.units.length; i++) {\n      unit.units[i] = {};\n      for (var p in this.units[i]) {\n        if ((0, _object.hasOwnProperty)(this.units[i], p)) {\n          unit.units[i][p] = this.units[i][p];\n        }\n      }\n    }\n    return unit;\n  };\n\n  /**\n   * Return the type of the value of this unit\n   *\n   * @memberof Unit\n   * @ return {string} type of the value of the unit\n   */\n  Unit.prototype.valueType = function () {\n    return (0, _is.typeOf)(this.value);\n  };\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  Unit.prototype._isDerived = function () {\n    if (this.units.length === 0) {\n      return false;\n    }\n    return this.units.length > 1 || Math.abs(this.units[0].power - 1.0) > 1e-15;\n  };\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  Unit.prototype._normalize = function (value) {\n    if (value === null || value === undefined || this.units.length === 0) {\n      return value;\n    }\n    var res = value;\n    var convert = Unit._getNumberConverter((0, _is.typeOf)(value)); // convert to Fraction or BigNumber if needed\n\n    for (var i = 0; i < this.units.length; i++) {\n      var unitValue = convert(this.units[i].unit.value);\n      var unitPrefixValue = convert(this.units[i].prefix.value);\n      var unitPower = convert(this.units[i].power);\n      res = multiplyScalar(res, pow(multiplyScalar(unitValue, unitPrefixValue), unitPower));\n    }\n    return res;\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  Unit.prototype._denormalize = function (value, prefixValue) {\n    if (value === null || value === undefined || this.units.length === 0) {\n      return value;\n    }\n    var res = value;\n    var convert = Unit._getNumberConverter((0, _is.typeOf)(value)); // convert to Fraction or BigNumber if needed\n\n    for (var i = 0; i < this.units.length; i++) {\n      var unitValue = convert(this.units[i].unit.value);\n      var unitPrefixValue = convert(this.units[i].prefix.value);\n      var unitPower = convert(this.units[i].power);\n      res = divideScalar(res, pow(multiplyScalar(unitValue, unitPrefixValue), unitPower));\n    }\n    return res;\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  var _findUnit = (0, _function.memoize)(function (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 ((0, _object.hasOwnProperty)(UNITS, str)) {\n      var unit = UNITS[str];\n      var prefix = unit.prefixes[''];\n      return {\n        unit: unit,\n        prefix: prefix\n      };\n    }\n    for (var _name in UNITS) {\n      if ((0, _object.hasOwnProperty)(UNITS, _name)) {\n        if ((0, _string.endsWith)(str, _name)) {\n          var _unit = UNITS[_name];\n          var prefixLen = str.length - _name.length;\n          var prefixName = str.substring(0, prefixLen);\n          var _prefix = (0, _object.hasOwnProperty)(_unit.prefixes, prefixName) ? _unit.prefixes[prefixName] : undefined;\n          if (_prefix !== undefined) {\n            // store unit, prefix, and value\n            return {\n              unit: _unit,\n              prefix: _prefix\n            };\n          }\n        }\n      }\n    }\n    return null;\n  }, {\n    hasher: function hasher(args) {\n      return args[0];\n    },\n    limit: 100\n  });\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  Unit.isValuelessUnit = function (name) {\n    return _findUnit(name) !== null;\n  };\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  Unit.prototype.hasBase = function (base) {\n    if (typeof base === 'string') {\n      base = BASE_UNITS[base];\n    }\n    if (!base) {\n      return false;\n    }\n\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) - (base.dimensions[i] || 0)) > 1e-12) {\n        return false;\n      }\n    }\n    return true;\n  };\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  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    return true;\n  };\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  Unit.prototype.equals = function (other) {\n    return this.equalBase(other) && equal(this.value, other.value);\n  };\n\n  /**\n   * Multiply this unit with another one or with a scalar\n   * @memberof Unit\n   * @param {Unit} other\n   * @return {Unit} product of this unit and the other unit\n   */\n  Unit.prototype.multiply = function (_other) {\n    var res = this.clone();\n    var other = (0, _is.isUnit)(_other) ? _other : new Unit(_other);\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    }\n\n    // Append other's units list onto res\n    for (var _i = 0; _i < other.units.length; _i++) {\n      // Make a shallow copy of every unit\n      var inverted = _objectSpread({}, other.units[_i]);\n      res.units.push(inverted);\n    }\n\n    // If at least one operand has a value, then the result should also have a value\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 = multiplyScalar(valThis, valOther);\n    } else {\n      res.value = null;\n    }\n    if ((0, _is.isUnit)(_other)) {\n      res.skipAutomaticSimplification = false;\n    }\n    return getNumericIfUnitless(res);\n  };\n\n  /**\n   * Divide a number by this unit\n   *\n   * @memberof Unit\n   * @param {numeric} numerator\n   * @param {unit} result of dividing numerator by this unit\n   */\n  Unit.prototype.divideInto = function (numerator) {\n    return new Unit(numerator).divide(this);\n  };\n\n  /**\n   * Divide this unit by another one\n   * @memberof Unit\n   * @param {Unit | numeric} other\n   * @return {Unit} result of dividing this unit by the other unit\n   */\n  Unit.prototype.divide = function (_other) {\n    var res = this.clone();\n    var other = (0, _is.isUnit)(_other) ? _other : new Unit(_other);\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    }\n\n    // Invert and append other's units list onto res\n    for (var _i2 = 0; _i2 < other.units.length; _i2++) {\n      // Make a shallow copy of every unit\n      var inverted = _objectSpread(_objectSpread({}, other.units[_i2]), {}, {\n        power: -other.units[_i2].power\n      });\n      res.units.push(inverted);\n    }\n\n    // If at least one operand has a value, the result should have a value\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 = divideScalar(valThis, valOther);\n    } else {\n      res.value = null;\n    }\n    if ((0, _is.isUnit)(_other)) {\n      res.skipAutomaticSimplification = false;\n    }\n    return getNumericIfUnitless(res);\n  };\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  Unit.prototype.pow = function (p) {\n    var res = this.clone();\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    }\n\n    // Adjust the power of each unit in the list\n    for (var _i3 = 0; _i3 < res.units.length; _i3++) {\n      res.units[_i3].power *= p;\n    }\n    if (res.value !== null) {\n      res.value = pow(res.value, p);\n\n      // 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    res.skipAutomaticSimplification = false;\n    return getNumericIfUnitless(res);\n  };\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  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  /**\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  Unit.prototype.abs = function () {\n    var ret = this.clone();\n    if (ret.value !== null) {\n      if (ret._isDerived() || ret.units[0].unit.offset === 0) {\n        ret.value = abs(ret.value);\n      } else {\n        // To give the correct, but unexpected, results for units with an offset.\n        // For example, abs(-283.15 degC) = -263.15 degC !!!\n        // We must take the offset into consideration here\n        var convert = ret._numberConverter(); // convert to Fraction or BigNumber if needed\n        var unitValue = convert(ret.units[0].unit.value);\n        var nominalOffset = convert(ret.units[0].unit.offset);\n        var unitOffset = multiplyScalar(unitValue, nominalOffset);\n        ret.value = subtract(abs(addScalar(ret.value, unitOffset)), unitOffset);\n      }\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    return ret;\n  };\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  Unit.prototype.to = function (valuelessUnit) {\n    var value = this.value === null ? this._normalize(1) : this.value;\n    var other;\n    if (typeof valuelessUnit === 'string') {\n      other = Unit.parse(valuelessUnit);\n    } else if ((0, _is.isUnit)(valuelessUnit)) {\n      other = valuelessUnit.clone();\n    } else {\n      throw new Error('String or Unit expected as parameter');\n    }\n    if (!this.equalBase(other)) {\n      throw new Error(\"Units do not match ('\".concat(other.toString(), \"' != '\").concat(this.toString(), \"')\"));\n    }\n    if (other.value !== null) {\n      throw new Error('Cannot convert to a unit with a value');\n    }\n    if (this.value === null || this._isDerived() || this.units[0].unit.offset === other.units[0].unit.offset) {\n      other.value = (0, _object.clone)(value);\n    } else {\n      /* Need to adjust value by difference in offset to convert */\n      var convert = Unit._getNumberConverter((0, _is.typeOf)(value)); // convert to Fraction or BigNumber if needed\n\n      var thisUnitValue = convert(this.units[0].unit.value);\n      var thisNominalOffset = convert(this.units[0].unit.offset);\n      var thisUnitOffset = multiplyScalar(thisUnitValue, thisNominalOffset);\n      var otherUnitValue = convert(other.units[0].unit.value);\n      var otherNominalOffset = convert(other.units[0].unit.offset);\n      var otherUnitOffset = multiplyScalar(otherUnitValue, otherNominalOffset);\n      other.value = subtract(addScalar(value, thisUnitOffset), otherUnitOffset);\n    }\n    other.fixPrefix = true;\n    other.skipAutomaticSimplification = true;\n    return other;\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  Unit.prototype.toNumber = function (valuelessUnit) {\n    return toNumber(this.toNumeric(valuelessUnit));\n  };\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  Unit.prototype.toNumeric = function (valuelessUnit) {\n    var other;\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    if (other._isDerived() || other.units.length === 0) {\n      return other._denormalize(other.value);\n    } else {\n      return other._denormalize(other.value, other.units[0].prefix.value);\n    }\n  };\n\n  /**\n   * Get a string representation of the unit.\n   * @memberof Unit\n   * @return {string}\n   */\n  Unit.prototype.toString = function () {\n    return this.format();\n  };\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  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  /**\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  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  /**\n   * Returns the string representation of the unit.\n   * @memberof Unit\n   * @return {string}\n   */\n  Unit.prototype.valueOf = Unit.prototype.toString;\n\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  Unit.prototype.simplify = function () {\n    var ret = this.clone();\n    var proposedUnitList = [];\n\n    // Search for a matching base\n    var matchingBase;\n    for (var key in currentUnitSystem) {\n      if ((0, _object.hasOwnProperty)(currentUnitSystem, key)) {\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      if (matchingBase) {\n        // Does the unit system have a matching unit?\n        if ((0, _object.hasOwnProperty)(currentUnitSystem, matchingBase)) {\n          matchingUnit = currentUnitSystem[matchingBase];\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        for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n          var baseDim = BASE_DIMENSIONS[i];\n          if (Math.abs(ret.dimensions[i] || 0) > 1e-12) {\n            if ((0, _object.hasOwnProperty)(currentUnitSystem, 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        }\n\n        // Is the proposed unit list \"simpler\" than the existing one?\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    return ret;\n  };\n\n  /**\n   * Returns a new Unit in the SI system with the same value as this one\n   */\n  Unit.prototype.toSI = function () {\n    var ret = this.clone();\n    var proposedUnitList = [];\n\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 SI unit system\n    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {\n      var baseDim = BASE_DIMENSIONS[i];\n      if (Math.abs(ret.dimensions[i] || 0) > 1e-12) {\n        if ((0, _object.hasOwnProperty)(UNIT_SYSTEMS.si, 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    }\n\n    // Replace this unit list with the proposed list\n    ret.units = proposedUnitList;\n    ret.fixPrefix = true;\n    ret.skipAutomaticSimplification = true;\n    return ret;\n  };\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  Unit.prototype.formatUnits = function () {\n    var strNum = '';\n    var strDen = '';\n    var nNum = 0;\n    var nDen = 0;\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        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    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            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    }\n    // Remove leading \" \"\n    strNum = strNum.substr(1);\n    strDen = strDen.substr(1);\n\n    // Add parans for better copy/paste back into evaluate, for example, or for better pretty print formatting\n    if (nNum > 1 && nDen > 0) {\n      strNum = '(' + strNum + ')';\n    }\n    if (nDen > 1 && nNum > 0) {\n      strDen = '(' + strDen + ')';\n    }\n    var str = strNum;\n    if (nNum > 0 && nDen > 0) {\n      str += ' / ';\n    }\n    str += strDen;\n    return str;\n  };\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  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();\n\n    // 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    var isImaginary = false;\n    if (typeof simp.value !== 'undefined' && simp.value !== null && (0, _is.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    for (var i in simp.units) {\n      if ((0, _object.hasOwnProperty)(simp.units, i)) {\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      }\n    }\n\n    // Now apply the best prefix\n    // Units must have only one unit and not have the fixPrefix flag set\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    var value = simp._denormalize(simp.value);\n    var str = simp.value !== null ? format(value, options || {}) : '';\n    var unitStr = simp.formatUnits();\n    if (simp.value && (0, _is.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    str += unitStr;\n    return str;\n  };\n\n  /**\n   * Calculate the best prefix using current value.\n   * @memberof Unit\n   * @returns {Object} prefix\n   * @private\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    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    }\n\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\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    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    if (absValue === 0) {\n      return bestPrefix;\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    bestDiff = Math.abs(bestDiff);\n    var prefixes = this.units[0].unit.prefixes;\n    for (var p in prefixes) {\n      if ((0, _object.hasOwnProperty)(prefixes, p)) {\n        var prefix = prefixes[p];\n        if (prefix.scientific) {\n          var diff = Math.abs(Math.log(absValue / Math.pow(prefix.value * absUnitValue, power)) / Math.LN10 - 1.2);\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    return bestPrefix;\n  };\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  Unit.prototype.splitUnit = function (parts) {\n    var x = this.clone();\n    var ret = [];\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;\n\n      // Get the numeric value of this unit\n      var xNumeric = x.toNumeric();\n\n      // 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      var xRounded = round(xNumeric);\n      var xFixed = void 0;\n      var isNearlyEqual = equal(xRounded, xNumeric);\n      if (isNearlyEqual) {\n        xFixed = xRounded;\n      } else {\n        xFixed = fix(x.toNumeric());\n      }\n      var y = new Unit(xFixed, parts[i].toString());\n      ret.push(y);\n      x = subtract(x, y);\n    }\n\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    var testSum = 0;\n    for (var _i5 = 0; _i5 < ret.length; _i5++) {\n      testSum = addScalar(testSum, ret[_i5].value);\n    }\n    if (equal(testSum, this.value)) {\n      x.value = 0;\n    }\n    ret.push(x);\n    return ret;\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 = (0, _extends2[\"default\"])({}, PREFIXES.SHORT, PREFIXES.LONG);\n  PREFIXES.BINARY_SHORT = (0, _extends2[\"default\"])({}, PREFIXES.BINARY_SHORT_SI, PREFIXES.BINARY_SHORT_IEC);\n  PREFIXES.BINARY_LONG = (0, _extends2[\"default\"])({}, PREFIXES.BINARY_LONG_SI, PREFIXES.BINARY_LONG_IEC);\n\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  for (var key in BASE_UNITS) {\n    if ((0, _object.hasOwnProperty)(BASE_UNITS, key)) {\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\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\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\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\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\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    t: {\n      name: 't',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.SHORT,\n      value: 1000,\n      offset: 0\n    },\n    tonne: {\n      name: 'tonne',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.LONG,\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.SHORT,\n      value: 1,\n      offset: 0\n    },\n    degC: {\n      name: 'degC',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 273.15\n    },\n    degF: {\n      name: 'degF',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.SHORT,\n      value: 1 / 1.8,\n      offset: 459.67\n    },\n    degR: {\n      name: 'degR',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.SHORT,\n      value: 1 / 1.8,\n      offset: 0\n    },\n    kelvin: {\n      name: 'kelvin',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    celsius: {\n      name: 'celsius',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 273.15\n    },\n    fahrenheit: {\n      name: 'fahrenheit',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.LONG,\n      value: 1 / 1.8,\n      offset: 459.67\n    },\n    rankine: {\n      name: 'rankine',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.LONG,\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.SHORT,\n      value: 1,\n      offset: 0\n    },\n    candela: {\n      name: 'candela',\n      base: BASE_UNITS.LUMINOUS_INTENSITY,\n      prefixes: PREFIXES.LONG,\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\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    kilogramforce: {\n      name: 'kilogramforce',\n      base: BASE_UNITS.FORCE,\n      prefixes: PREFIXES.NONE,\n      value: 9.80665,\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     * 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    }\n  };\n\n  // aliases (formerly plurals)\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    kgf: 'kilogramforce',\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    bit: 'bits',\n    \"byte\": 'bytes'\n  };\n\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  function calculateAngleValues(config) {\n    if (config.number === 'BigNumber') {\n      var pi = (0, _constants.createBigNumberPi)(_BigNumber);\n      UNITS.rad.value = new _BigNumber(1);\n      UNITS.deg.value = pi.div(180); // 2 * pi / 360\n      UNITS.grad.value = pi.div(200); // 2 * pi / 400\n      UNITS.cycle.value = pi.times(2); // 2 * pi\n      UNITS.arcsec.value = pi.div(648000); // 2 * pi / 360 / 3600\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      UNITS.grad.value = Math.PI / 200; // 2 * pi / 400\n      UNITS.cycle.value = Math.PI * 2; // 2 * pi\n      UNITS.arcsec.value = Math.PI / 648000; // 2 * pi / 360 / 3600\n      UNITS.arcmin.value = Math.PI / 10800; // 2 * pi / 360 / 60\n    }\n\n    // copy to the full names of the angles\n    UNITS.radian.value = UNITS.rad.value;\n    UNITS.degree.value = UNITS.deg.value;\n    UNITS.gradian.value = UNITS.grad.value;\n  }\n\n  // apply the angle values now\n  calculateAngleValues(config);\n  if (on) {\n    // recalculate the values on change of configuration\n    on('config', function (curr, prev) {\n      if (curr.number !== prev.number) {\n        calculateAngleValues(curr);\n      }\n    });\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  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.bits,\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    }\n  };\n\n  // Clone to create the other unit systems\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['']\n  };\n  // there are wholly 4 unique cgs systems for electricity and magnetism,\n  // so let's not worry about it unless somebody complains\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['']\n  };\n\n  // Add additional unit systems here.\n\n  // Choose a unit system to seed the auto unit system.\n  UNIT_SYSTEMS.auto = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si));\n\n  // Set the current unit system\n  var currentUnitSystem = UNIT_SYSTEMS.auto;\n\n  /**\n   * Set a unit system for formatting derived units.\n   * @param {string} [name] The name of the unit system.\n   */\n  Unit.setUnitSystem = function (name) {\n    if ((0, _object.hasOwnProperty)(UNIT_SYSTEMS, 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  /**\n   * Return the current unit system.\n   * @return {string} The current unit system.\n   */\n  Unit.getUnitSystem = function () {\n    for (var _key in UNIT_SYSTEMS) {\n      if ((0, _object.hasOwnProperty)(UNIT_SYSTEMS, _key)) {\n        if (UNIT_SYSTEMS[_key] === currentUnitSystem) {\n          return _key;\n        }\n      }\n    }\n  };\n\n  /**\n   * Converters to convert from number to an other numeric type like BigNumber\n   * or Fraction\n   */\n  Unit.typeConverters = {\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(x + ''); // stringify to prevent constructor error\n    },\n\n    Fraction: function Fraction(x) {\n      return new _Fraction(x);\n    },\n    Complex: function Complex(x) {\n      return x;\n    },\n    number: function number(x) {\n      return x;\n    }\n  };\n\n  /**\n   * Retrieve the right converter function corresponding with this unit's\n   * value\n   *\n   * @memberof Unit\n   * @return {Function}\n   */\n  Unit.prototype._numberConverter = function () {\n    var convert = Unit.typeConverters[this.valueType()];\n    if (convert) {\n      return convert;\n    }\n    throw new TypeError('Unsupported Unit value type \"' + this.valueType() + '\"');\n  };\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  Unit._getNumberConverter = function (type) {\n    if (!Unit.typeConverters[type]) {\n      throw new TypeError('Unsupported type \"' + type + '\"');\n    }\n    return Unit.typeConverters[type];\n  };\n\n  // Add dimensions to each built-in unit\n  for (var _key2 in UNITS) {\n    if ((0, _object.hasOwnProperty)(UNITS, _key2)) {\n      var unit = UNITS[_key2];\n      unit.dimensions = unit.base.dimensions;\n    }\n  }\n\n  // Create aliases\n  for (var _name2 in ALIASES) {\n    if ((0, _object.hasOwnProperty)(ALIASES, _name2)) {\n      var _unit2 = UNITS[ALIASES[_name2]];\n      var alias = {};\n      for (var _key3 in _unit2) {\n        if ((0, _object.hasOwnProperty)(_unit2, _key3)) {\n          alias[_key3] = _unit2[_key3];\n        }\n      }\n      alias.name = _name2;\n      UNITS[_name2] = alias;\n    }\n  }\n\n  /**\n   * Checks if a character is a valid latin letter (upper or lower case).\n   * Note that this function can be overridden, for example to allow support of other alphabets.\n   * @param {string} c Tested character\n   */\n  Unit.isValidAlpha = function isValidAlpha(c) {\n    return /^[a-zA-Z]$/.test(c);\n  };\n  function assertUnitNameIsValid(name) {\n    for (var i = 0; i < name.length; i++) {\n      c = name.charAt(i);\n      if (i === 0 && !Unit.isValidAlpha(c)) {\n        throw new Error('Invalid unit name (must begin with alpha character): \"' + name + '\"');\n      }\n      if (i > 0 && !(Unit.isValidAlpha(c) || isDigit(c))) {\n        throw new Error('Invalid unit name (only alphanumeric characters are allowed): \"' + name + '\"');\n      }\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  Unit.createUnit = function (obj, options) {\n    if ((0, _typeof2[\"default\"])(obj) !== 'object') {\n      throw new TypeError(\"createUnit expects first parameter to be of type 'Object'\");\n    }\n\n    // Remove all units and aliases we are overriding\n    if (options && options.override) {\n      for (var _key4 in obj) {\n        if ((0, _object.hasOwnProperty)(obj, _key4)) {\n          Unit.deleteUnit(_key4);\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    }\n\n    // TODO: traverse multiple times until all units have been added\n    var lastUnit;\n    for (var _key5 in obj) {\n      if ((0, _object.hasOwnProperty)(obj, _key5)) {\n        lastUnit = Unit.createUnitSingle(_key5, obj[_key5]);\n      }\n    }\n    return lastUnit;\n  };\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, Object} definition      Definition of the unit in terms\n   * of existing units. For example, '0.514444444 m / s'. Can be a Unit, a string,\n   * or an Object. If an Object, may have the following properties:\n   *   - definition {string|Unit} The definition of this unit.\n   *   - prefixes {string} \"none\", \"short\", \"long\", \"binary_short\", or \"binary_long\".\n   *     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\n   *     example, the offset for celsius is 273.15 and the offset for farhenheit\n   *     is 459.67. Default is 0.\n   *   - baseName {string} If the unit's dimension does not match that of any other\n   *     base unit, the name of the newly create base unit. Otherwise, this property\n   *     has no effect.\n   *\n   * @return {Unit}\n   */\n  Unit.createUnitSingle = function (name, obj) {\n    if (typeof obj === 'undefined' || obj === null) {\n      obj = {};\n    }\n    if (typeof name !== 'string') {\n      throw new TypeError(\"createUnitSingle expects first parameter to be of type 'string'\");\n    }\n\n    // Check collisions with existing units\n    if ((0, _object.hasOwnProperty)(UNITS, name)) {\n      throw new Error('Cannot create unit \"' + name + '\": a unit with that name already exists');\n    }\n\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    assertUnitNameIsValid(name);\n    var defUnit = null; // The Unit from which the new unit will be created.\n    var aliases = [];\n    var offset = 0;\n    var definition;\n    var prefixes;\n    var baseName;\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 ((0, _typeof2[\"default\"])(obj) === 'object') {\n      definition = obj.definition;\n      prefixes = obj.prefixes;\n      offset = obj.offset;\n      baseName = obj.baseName;\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    if (aliases) {\n      for (var i = 0; i < aliases.length; i++) {\n        if ((0, _object.hasOwnProperty)(UNITS, aliases[i])) {\n          throw new Error('Cannot create alias \"' + aliases[i] + '\": a unit with that name already exists');\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    aliases = aliases || [];\n    offset = offset || 0;\n    if (prefixes && prefixes.toUpperCase) {\n      prefixes = PREFIXES[prefixes.toUpperCase()] || PREFIXES.NONE;\n    } else {\n      prefixes = PREFIXES.NONE;\n    }\n\n    // If defUnit is null, it is because the user did not\n    // specify a defintion. So create a new base dimension.\n    var newUnit = {};\n    if (!defUnit) {\n      // Add a new base dimension\n      baseName = baseName || name + '_STUFF'; // foo --> foo_STUFF, or the essence of foo\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      BASE_DIMENSIONS.push(baseName);\n\n      // Push 0 onto existing base units\n      for (var b in BASE_UNITS) {\n        if ((0, _object.hasOwnProperty)(BASE_UNITS, b)) {\n          BASE_UNITS[b].dimensions[BASE_DIMENSIONS.length - 1] = 0;\n        }\n      }\n\n      // Add the new base unit\n      var newBaseUnit = {\n        dimensions: []\n      };\n      for (var _i6 = 0; _i6 < BASE_DIMENSIONS.length; _i6++) {\n        newBaseUnit.dimensions[_i6] = 0;\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\n      };\n\n      // Create a new base if no matching base exists\n      var anyMatch = false;\n      for (var _i7 in BASE_UNITS) {\n        if ((0, _object.hasOwnProperty)(BASE_UNITS, _i7)) {\n          var match = true;\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          if (match) {\n            anyMatch = true;\n            newUnit.base = BASE_UNITS[_i7];\n            break;\n          }\n        }\n      }\n      if (!anyMatch) {\n        baseName = baseName || name + '_STUFF'; // foo --> foo_STUFF, or the essence of foo\n        // Add the new base unit\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    Unit.UNITS[name] = newUnit;\n    for (var _i8 = 0; _i8 < aliases.length; _i8++) {\n      var aliasName = aliases[_i8];\n      var _alias = {};\n      for (var _key6 in newUnit) {\n        if ((0, _object.hasOwnProperty)(newUnit, _key6)) {\n          _alias[_key6] = newUnit[_key6];\n        }\n      }\n      _alias.name = aliasName;\n      Unit.UNITS[aliasName] = _alias;\n    }\n    // delete the memoization cache, since adding a new unit to the array\n    // invalidates all old results\n    delete _findUnit.cache;\n    return new Unit(null, name);\n  };\n  Unit.deleteUnit = function (name) {\n    delete Unit.UNITS[name];\n  };\n\n  // expose arrays with prefixes, dimensions, units, systems\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  isClass: true\n});\nexports.createUnitClass = createUnitClass;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createUnitFunction = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar _collection = require(\"../../../utils/collection.js\");\nvar name = 'unit';\nvar dependencies = ['typed', 'Unit'];\n\n// This function is named createUnitFunction to prevent a naming conflict with createUnit\nvar createUnitFunction = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    Unit = _ref.Unit;\n  /**\n   * Create a unit. Depending on the passed arguments, the function\n   * will create and return a new math.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, valuelessUnit : Unit)\n   *     math.unit(value : number, valuelessUnit : string)\n   *\n   * Examples:\n   *\n   *    const kph = math.unit('km/h')   // returns Unit km/h (valueless)\n   *    const v = math.unit(25, kph)    // returns Unit 25 km/h\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\n  return typed(name, {\n    Unit: function Unit(x) {\n      return x.clone();\n    },\n    string: function string(x) {\n      if (Unit.isValuelessUnit(x)) {\n        return new Unit(null, x); // a pure unit\n      }\n\n      return Unit.parse(x, {\n        allowNoUnits: true\n      }); // a unit with value, like '5cm'\n    },\n\n    'number | BigNumber | Fraction | Complex, string | Unit': function numberBigNumberFractionComplexStringUnit(value, unit) {\n      return new Unit(value, unit);\n    },\n    'number | BigNumber | Fraction': function numberBigNumberFraction(value) {\n      // dimensionless\n      return new Unit(value);\n    },\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (x) {\n        return (0, _collection.deepMap)(x, self);\n      };\n    })\n  });\n});\nexports.createUnitFunction = createUnitFunction;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSparse = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar name = 'sparse';\nvar dependencies = ['typed', 'SparseMatrix'];\nvar createSparse = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    SparseMatrix = _ref.SparseMatrix;\n  /**\n   * Create a Sparse Matrix. The function creates a new `math.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   * Note that a Sparse Matrix is always 2-dimensional, so for example if\n   * you create one from a plain array of _n_ numbers, you get an _n_ by 1\n   * Sparse \"column vector\".\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   *    let v = math.sparse([0, 0, 1])\n   *    v.size()                        // Array [3, 1]\n   *    v.get([2, 0])                   // number 1\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  return typed(name, {\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});\nexports.createSparse = createSparse;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCreateUnit = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar name = 'createUnit';\nvar dependencies = ['typed', 'Unit'];\nvar createCreateUnit = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    Unit = _ref.Unit;\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   *     math.createUnit('km', math.unit(1000, 'm'))\n   *\n   * @param {string} name      The name of the new unit. Must be unique. Example: 'knot'\n   * @param {string, UnitDefinition, 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  return typed(name, {\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 Unit.createUnit(obj, options);\n    },\n    // Same as above but without the options.\n    Object: function Object(obj) {\n      return 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 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 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 Unit.createUnit(obj, {});\n    }\n  });\n});\nexports.createCreateUnit = createCreateUnit;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createAcos = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'acos';\nvar dependencies = ['typed', 'config', 'Complex'];\nvar createAcos = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    Complex = _ref.Complex;\n  /**\n   * Calculate the inverse cosine of a value.\n   *\n   * To avoid confusion with the matrix arccosine, this function does not\n   * apply to matrices.\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} x  Function input\n   * @return {number | BigNumber | Complex} The arc cosine of x\n   */\n  return typed(name, {\n    number: function number(x) {\n      if (x >= -1 && x <= 1 || config.predictable) {\n        return Math.acos(x);\n      } else {\n        return new 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  });\n});\nexports.createAcos = createAcos;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createAcosh = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'acosh';\nvar dependencies = ['typed', 'config', 'Complex'];\nvar createAcosh = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    Complex = _ref.Complex;\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 | BigNumber | Complex} x  Function input\n   * @return {number | BigNumber | Complex} Hyperbolic arccosine of x\n   */\n  return typed(name, {\n    number: function number(x) {\n      if (x >= 1 || config.predictable) {\n        return (0, _index.acoshNumber)(x);\n      }\n      if (x <= -1) {\n        return new Complex(Math.log(Math.sqrt(x * x - 1) - x), Math.PI);\n      }\n      return new 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  });\n});\nexports.createAcosh = createAcosh;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createAcot = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'acot';\nvar dependencies = ['typed', 'BigNumber'];\nvar createAcot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    _BigNumber = _ref.BigNumber;\n  /**\n   * Calculate the inverse cotangent of a value, defined as `acot(x) = atan(1/x)`.\n   *\n   * To avoid confusion with the matrix arccotanget, this function does not\n   * apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.acot(x)\n   *\n   * Examples:\n   *\n   *    math.acot(0.5)           // returns number 1.1071487177940904\n   *    math.acot(2)             // returns number 0.4636476090008061\n   *    math.acot(math.cot(1.5)) // returns number 1.5\n   *\n   * See also:\n   *\n   *    cot, atan\n   *\n   * @param {number | BigNumber| Complex} x   Function input\n   * @return {number | BigNumber| Complex} The arc cotangent of x\n   */\n  return typed(name, {\n    number: _index.acotNumber,\n    Complex: function Complex(x) {\n      return x.acot();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x).atan();\n    }\n  });\n});\nexports.createAcot = createAcot;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createAcoth = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'acoth';\nvar dependencies = ['typed', 'config', 'Complex', 'BigNumber'];\nvar createAcoth = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    Complex = _ref.Complex,\n    _BigNumber = _ref.BigNumber;\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   * To avoid confusion with the matrix hyperbolic arccotangent, this\n   * function does not apply to matrices.\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 | BigNumber | Complex} x  Function input\n   * @return {number | BigNumber | Complex} Hyperbolic arccotangent of x\n   */\n  return typed(name, {\n    number: function number(x) {\n      if (x >= 1 || x <= -1 || config.predictable) {\n        return (0, _index.acothNumber)(x);\n      }\n      return new Complex(x, 0).acoth();\n    },\n    Complex: function Complex(x) {\n      return x.acoth();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x).atanh();\n    }\n  });\n});\nexports.createAcoth = createAcoth;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createAcsc = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'acsc';\nvar dependencies = ['typed', 'config', 'Complex', 'BigNumber'];\nvar createAcsc = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    Complex = _ref.Complex,\n    _BigNumber = _ref.BigNumber;\n  /**\n   * Calculate the inverse cosecant of a value, defined as `acsc(x) = asin(1/x)`.\n   *\n   * To avoid confusion with the matrix arccosecant, this function does not\n   * apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.acsc(x)\n   *\n   * Examples:\n   *\n   *    math.acsc(2)             // returns 0.5235987755982989\n   *    math.acsc(0.5)           // returns Complex 1.5707963267948966 -1.3169578969248166i\n   *    math.acsc(math.csc(1.5)) // returns number ~1.5\n   *\n   * See also:\n   *\n   *    csc, asin, asec\n   *\n   * @param {number | BigNumber | Complex} x   Function input\n   * @return {number | BigNumber | Complex} The arc cosecant of x\n   */\n  return typed(name, {\n    number: function number(x) {\n      if (x <= -1 || x >= 1 || config.predictable) {\n        return (0, _index.acscNumber)(x);\n      }\n      return new Complex(x, 0).acsc();\n    },\n    Complex: function Complex(x) {\n      return x.acsc();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x).asin();\n    }\n  });\n});\nexports.createAcsc = createAcsc;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createAcsch = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'acsch';\nvar dependencies = ['typed', 'BigNumber'];\nvar createAcsch = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    _BigNumber = _ref.BigNumber;\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   * To avoid confusion with the matrix hyperbolic arccosecant, this function\n   * does not apply to matrices.\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 | BigNumber | Complex} x  Function input\n   * @return {number | BigNumber | Complex} Hyperbolic arccosecant of x\n   */\n  return typed(name, {\n    number: _index.acschNumber,\n    Complex: function Complex(x) {\n      return x.acsch();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x).asinh();\n    }\n  });\n});\nexports.createAcsch = createAcsch;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createAsec = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'asec';\nvar dependencies = ['typed', 'config', 'Complex', 'BigNumber'];\nvar createAsec = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    Complex = _ref.Complex,\n    _BigNumber = _ref.BigNumber;\n  /**\n   * Calculate the inverse secant of a value. Defined as `asec(x) = acos(1/x)`.\n   *\n   * To avoid confusion with the matrix arcsecant, this function does not\n   * apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.asec(x)\n   *\n   * Examples:\n   *\n   *    math.asec(2)             // returns 1.0471975511965979\n   *    math.asec(math.sec(1.5)) // returns 1.5\n   *\n   *    math.asec(0.5)           // returns Complex 0 + 1.3169578969248166i\n   *\n   * See also:\n   *\n   *    acos, acot, acsc\n   *\n   * @param {number | BigNumber | Complex} x  Function input\n   * @return {number | BigNumber | Complex} The arc secant of x\n   */\n  return typed(name, {\n    number: function number(x) {\n      if (x <= -1 || x >= 1 || config.predictable) {\n        return (0, _index.asecNumber)(x);\n      }\n      return new Complex(x, 0).asec();\n    },\n    Complex: function Complex(x) {\n      return x.asec();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x).acos();\n    }\n  });\n});\nexports.createAsec = createAsec;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createAsech = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'asech';\nvar dependencies = ['typed', 'config', 'Complex', 'BigNumber'];\nvar createAsech = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    Complex = _ref.Complex,\n    _BigNumber = _ref.BigNumber;\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   * To avoid confusion with the matrix hyperbolic arcsecant, this function\n   * does not apply to matrices.\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 | BigNumber | Complex} x  Function input\n   * @return {number | BigNumber | Complex} Hyperbolic arcsecant of x\n   */\n  return typed(name, {\n    number: function number(x) {\n      if (x <= 1 && x >= -1 || config.predictable) {\n        var xInv = 1 / x;\n        if (xInv > 0 || config.predictable) {\n          return (0, _index.asechNumber)(x);\n        }\n        var ret = Math.sqrt(xInv * xInv - 1);\n        return new Complex(Math.log(ret - xInv), Math.PI);\n      }\n      return new Complex(x, 0).asech();\n    },\n    Complex: function Complex(x) {\n      return x.asech();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x).acosh();\n    }\n  });\n});\nexports.createAsech = createAsech;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createAsin = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'asin';\nvar dependencies = ['typed', 'config', 'Complex'];\nvar createAsin = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    Complex = _ref.Complex;\n  /**\n   * Calculate the inverse sine of a value.\n   *\n   * To avoid confusion with the matric arcsine, this function does not apply\n   * to matrices.\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.3169578969248166i\n   *\n   * See also:\n   *\n   *    sin, atan, acos\n   *\n   * @param {number | BigNumber | Complex} x   Function input\n   * @return {number | BigNumber | Complex} The arc sine of x\n   */\n  return typed(name, {\n    number: function number(x) {\n      if (x >= -1 && x <= 1 || config.predictable) {\n        return Math.asin(x);\n      } else {\n        return new 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  });\n});\nexports.createAsin = createAsin;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createAsinh = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'asinh';\nvar dependencies = ['typed'];\nvar createAsinh = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\n  /**\n   * Calculate the hyperbolic arcsine of a value,\n   * defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.\n   *\n   * To avoid confusion with the matrix hyperbolic arcsine, this function\n   * does not apply to matrices.\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 | BigNumber | Complex} x  Function input\n   * @return {number | BigNumber | Complex} Hyperbolic arcsine of x\n   */\n  return typed('asinh', {\n    number: _index.asinhNumber,\n    Complex: function Complex(x) {\n      return x.asinh();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.asinh();\n    }\n  });\n});\nexports.createAsinh = createAsinh;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createAtan = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'atan';\nvar dependencies = ['typed'];\nvar createAtan = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\n  /**\n   * Calculate the inverse tangent of a value.\n   *\n   * To avoid confusion with matrix arctangent, this function does not apply\n   * to matrices.\n   *\n   * Syntax:\n   *\n   *    math.atan(x)\n   *\n   * Examples:\n   *\n   *    math.atan(0.5)           // returns number 0.4636476090008061\n   *    math.atan(2)             // returns number 1.1071487177940904\n   *    math.atan(math.tan(1.5)) // returns number 1.5\n   *\n   * See also:\n   *\n   *    tan, asin, acos\n   *\n   * @param {number | BigNumber | Complex} x   Function input\n   * @return {number | BigNumber | Complex} The arc tangent of x\n   */\n  return 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  });\n});\nexports.createAtan = createAtan;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createAtan2 = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _matAlgo02xDS = require(\"../../type/matrix/utils/matAlgo02xDS0.js\");\nvar _matAlgo03xDSf = require(\"../../type/matrix/utils/matAlgo03xDSf.js\");\nvar _matAlgo09xS0Sf = require(\"../../type/matrix/utils/matAlgo09xS0Sf.js\");\nvar _matAlgo11xS0s = require(\"../../type/matrix/utils/matAlgo11xS0s.js\");\nvar _matAlgo12xSfs = require(\"../../type/matrix/utils/matAlgo12xSfs.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar name = 'atan2';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber', 'DenseMatrix', 'concat'];\nvar createAtan2 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    equalScalar = _ref.equalScalar,\n    BigNumber = _ref.BigNumber,\n    DenseMatrix = _ref.DenseMatrix,\n    concat = _ref.concat;\n  var matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({\n    typed: typed\n  });\n  var matAlgo09xS0Sf = (0, _matAlgo09xS0Sf.createMatAlgo09xS0Sf)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\n\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 number 1.1071487177940904\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  return typed(name, {\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\n    // the imaginary.\n\n    'BigNumber, BigNumber': function BigNumberBigNumber(y, x) {\n      return BigNumber.atan2(y, x);\n    }\n  }, matrixAlgorithmSuite({\n    scalar: 'number | BigNumber',\n    SS: matAlgo09xS0Sf,\n    DS: matAlgo03xDSf,\n    SD: matAlgo02xDS0,\n    Ss: matAlgo11xS0s,\n    sS: matAlgo12xSfs\n  }));\n});\nexports.createAtan2 = createAtan2;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createAtanh = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'atanh';\nvar dependencies = ['typed', 'config', 'Complex'];\nvar createAtanh = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    Complex = _ref.Complex;\n  /**\n   * Calculate the hyperbolic arctangent of a value,\n   * defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.\n   *\n   * To avoid confusion with the matrix hyperbolic arctangent, this function\n   * does not apply to matrices.\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 | BigNumber | Complex} x  Function input\n   * @return {number | BigNumber | Complex} Hyperbolic arctangent of x\n   */\n  return typed(name, {\n    number: function number(x) {\n      if (x <= 1 && x >= -1 || config.predictable) {\n        return (0, _index.atanhNumber)(x);\n      }\n      return new 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  });\n});\nexports.createAtanh = createAtanh;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createTrigUnit = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar createTrigUnit = /* #__PURE__ */(0, _factory.factory)('trigUnit', ['typed'], function (_ref) {\n  var typed = _ref.typed;\n  return {\n    Unit: typed.referToSelf(function (self) {\n      return function (x) {\n        if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n          throw new TypeError('Unit in function cot is no angle');\n        }\n        return typed.find(self, x.valueType())(x.value);\n      };\n    })\n  };\n});\nexports.createTrigUnit = createTrigUnit;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCos = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _trigUnit = require(\"./trigUnit.js\");\nvar name = 'cos';\nvar dependencies = ['typed'];\nvar createCos = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\n  var trigUnit = (0, _trigUnit.createTrigUnit)({\n    typed: typed\n  });\n\n  /**\n   * Calculate the cosine of a value.\n   *\n   * To avoid confusion with the matrix cosine, this function does not\n   * apply to matrices.\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} x  Function input\n   * @return {number | BigNumber | Complex} Cosine of x\n   */\n  return typed(name, {\n    number: Math.cos,\n    'Complex | BigNumber': function ComplexBigNumber(x) {\n      return x.cos();\n    }\n  }, trigUnit);\n});\nexports.createCos = createCos;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCosh = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _number = require(\"../../utils/number.js\");\nvar name = 'cosh';\nvar dependencies = ['typed'];\nvar createCosh = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\n  /**\n   * Calculate the hyperbolic cosine of a value,\n   * defined as `cosh(x) = 1/2 * (exp(x) + exp(-x))`.\n   *\n   * To avoid confusion with the matrix hyperbolic cosine, this function does\n   * not apply to matrices.\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} x  Function input\n   * @return {number | BigNumber | Complex} Hyperbolic cosine of x\n   */\n  return typed(name, {\n    number: _number.cosh,\n    'Complex | BigNumber': function ComplexBigNumber(x) {\n      return x.cosh();\n    }\n  });\n});\nexports.createCosh = createCosh;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCot = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar _trigUnit = require(\"./trigUnit.js\");\nvar name = 'cot';\nvar dependencies = ['typed', 'BigNumber'];\nvar createCot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    _BigNumber = _ref.BigNumber;\n  var trigUnit = (0, _trigUnit.createTrigUnit)({\n    typed: typed\n  });\n\n  /**\n   * Calculate the cotangent of a value. Defined as `cot(x) = 1 / tan(x)`.\n   *\n   * To avoid confusion with the matrix cotangent, this function does not\n   * apply to matrices.\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  return typed(name, {\n    number: _index.cotNumber,\n    Complex: function Complex(x) {\n      return x.cot();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x.tan());\n    }\n  }, trigUnit);\n});\nexports.createCot = createCot;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCoth = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'coth';\nvar dependencies = ['typed', 'BigNumber'];\nvar createCoth = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    _BigNumber = _ref.BigNumber;\n  /**\n   * Calculate the hyperbolic cotangent of a value,\n   * defined as `coth(x) = 1 / tanh(x)`.\n   *\n   * To avoid confusion with the matrix hyperbolic cotangent, this function\n   * does not apply to matrices.\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 | BigNumber | Complex} x  Function input\n   * @return {number | BigNumber | Complex} Hyperbolic cotangent of x\n   */\n  return typed(name, {\n    number: _index.cothNumber,\n    Complex: function Complex(x) {\n      return x.coth();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x.tanh());\n    }\n  });\n});\nexports.createCoth = createCoth;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCsc = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar _trigUnit = require(\"./trigUnit.js\");\nvar name = 'csc';\nvar dependencies = ['typed', 'BigNumber'];\nvar createCsc = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    _BigNumber = _ref.BigNumber;\n  var trigUnit = (0, _trigUnit.createTrigUnit)({\n    typed: typed\n  });\n\n  /**\n   * Calculate the cosecant of a value, defined as `csc(x) = 1/sin(x)`.\n   *\n   * To avoid confusion with the matrix cosecant, this function does not\n   * apply to matrices.\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 | BigNumber | Complex | Unit} x  Function input\n   * @return {number | BigNumber | Complex} Cosecant of x\n   */\n  return typed(name, {\n    number: _index.cscNumber,\n    Complex: function Complex(x) {\n      return x.csc();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x.sin());\n    }\n  }, trigUnit);\n});\nexports.createCsc = createCsc;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCsch = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'csch';\nvar dependencies = ['typed', 'BigNumber'];\nvar createCsch = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    _BigNumber = _ref.BigNumber;\n  /**\n   * Calculate the hyperbolic cosecant of a value,\n   * defined as `csch(x) = 1 / sinh(x)`.\n   *\n   * To avoid confusion with the matrix hyperbolic cosecant, this function\n   * does not apply to matrices.\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 | BigNumber | Complex} x  Function input\n   * @return {number | BigNumber | Complex} Hyperbolic cosecant of x\n   */\n  return typed(name, {\n    number: _index.cschNumber,\n    Complex: function Complex(x) {\n      return x.csch();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x.sinh());\n    }\n  });\n});\nexports.createCsch = createCsch;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSec = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar _trigUnit = require(\"./trigUnit.js\");\nvar name = 'sec';\nvar dependencies = ['typed', 'BigNumber'];\nvar createSec = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    _BigNumber = _ref.BigNumber;\n  var trigUnit = (0, _trigUnit.createTrigUnit)({\n    typed: typed\n  });\n\n  /**\n   * Calculate the secant of a value, defined as `sec(x) = 1/cos(x)`.\n   *\n   * To avoid confusion with the matrix secant, this function does not\n   * apply to matrices.\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 | BigNumber | Complex | Unit} x  Function input\n   * @return {number | BigNumber | Complex} Secant of x\n   */\n  return typed(name, {\n    number: _index.secNumber,\n    Complex: function Complex(x) {\n      return x.sec();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x.cos());\n    }\n  }, trigUnit);\n});\nexports.createSec = createSec;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSech = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'sech';\nvar dependencies = ['typed', 'BigNumber'];\nvar createSech = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    _BigNumber = _ref.BigNumber;\n  /**\n   * Calculate the hyperbolic secant of a value,\n   * defined as `sech(x) = 1 / cosh(x)`.\n   *\n   * To avoid confusion with the matrix hyperbolic secant, this function does\n   * not apply to matrices.\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 | BigNumber | Complex} x  Function input\n   * @return {number | BigNumber | Complex} Hyperbolic secant of x\n   */\n  return typed(name, {\n    number: _index.sechNumber,\n    Complex: function Complex(x) {\n      return x.sech();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(1).div(x.cosh());\n    }\n  });\n});\nexports.createSech = createSech;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSin = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _trigUnit = require(\"./trigUnit.js\");\nvar name = 'sin';\nvar dependencies = ['typed'];\nvar createSin = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\n  var trigUnit = (0, _trigUnit.createTrigUnit)({\n    typed: typed\n  });\n\n  /**\n   * Calculate the sine of a value.\n   *\n   * To avoid confusion with the matrix sine, this function does not apply\n   * to matrices.\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} x  Function input\n   * @return {number | BigNumber | Complex} Sine of x\n   */\n  return typed(name, {\n    number: Math.sin,\n    'Complex | BigNumber': function ComplexBigNumber(x) {\n      return x.sin();\n    }\n  }, trigUnit);\n});\nexports.createSin = createSin;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSinh = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'sinh';\nvar dependencies = ['typed'];\nvar createSinh = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\n  /**\n   * Calculate the hyperbolic sine of a value,\n   * defined as `sinh(x) = 1/2 * (exp(x) - exp(-x))`.\n   *\n   * To avoid confusion with the matrix hyperbolic sine, this function does\n   * not apply to matrices.\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} x  Function input\n   * @return {number | BigNumber | Complex} Hyperbolic sine of x\n   */\n  return typed(name, {\n    number: _index.sinhNumber,\n    'Complex | BigNumber': function ComplexBigNumber(x) {\n      return x.sinh();\n    }\n  });\n});\nexports.createSinh = createSinh;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createTan = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _trigUnit = require(\"./trigUnit.js\");\nvar name = 'tan';\nvar dependencies = ['typed'];\nvar createTan = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\n  var trigUnit = (0, _trigUnit.createTrigUnit)({\n    typed: typed\n  });\n\n  /**\n   * Calculate the tangent of a value. `tan(x)` is equal to `sin(x) / cos(x)`.\n   *\n   * To avoid confusion with the matrix tangent, this function does not apply\n   * to matrices.\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} x  Function input\n   * @return {number | BigNumber | Complex} Tangent of x\n   */\n  return typed(name, {\n    number: Math.tan,\n    'Complex | BigNumber': function ComplexBigNumber(x) {\n      return x.tan();\n    }\n  }, trigUnit);\n});\nexports.createTan = createTan;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createTanh = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _number = require(\"../../utils/number.js\");\nvar name = 'tanh';\nvar dependencies = ['typed'];\nvar createTanh = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.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   * To avoid confusion with matrix hyperbolic tangent, this function does\n   * not apply to matrices.\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} x  Function input\n   * @return {number | BigNumber | Complex} Hyperbolic tangent of x\n   */\n  return typed('tanh', {\n    number: _number.tanh,\n    'Complex | BigNumber': function ComplexBigNumber(x) {\n      return x.tanh();\n    }\n  });\n});\nexports.createTanh = createTanh;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSetCartesian = void 0;\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'setCartesian';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];\nvar createSetCartesian = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    size = _ref.size,\n    subset = _ref.subset,\n    compareNatural = _ref.compareNatural,\n    Index = _ref.Index,\n    DenseMatrix = _ref.DenseMatrix;\n  /**\n   * Create the cartesian product of two (multi)sets.\n   * Multi-dimension arrays will be converted to single-dimension arrays\n   * and the values will be sorted in ascending order 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   *    math.setCartesian([4, 3], [2, 1])        // returns [[3, 1], [3, 2], [4, 1], [4, 2]]\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  return typed(name, {\n    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {\n      var result = [];\n      if (subset(size(a1), new Index(0)) !== 0 && subset(size(a2), new Index(0)) !== 0) {\n        // if any of them is empty, return empty\n        var b1 = (0, _array.flatten)(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural);\n        var b2 = (0, _array.flatten)(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural);\n        result = [];\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      }\n      // return an array, if both inputs were arrays\n      if (Array.isArray(a1) && Array.isArray(a2)) {\n        return result;\n      }\n      // return a matrix otherwise\n      return new DenseMatrix(result);\n    }\n  });\n});\nexports.createSetCartesian = createSetCartesian;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSetDifference = void 0;\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'setDifference';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];\nvar createSetDifference = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    size = _ref.size,\n    subset = _ref.subset,\n    compareNatural = _ref.compareNatural,\n    Index = _ref.Index,\n    DenseMatrix = _ref.DenseMatrix;\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  return typed(name, {\n    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {\n      var result;\n      if (subset(size(a1), new Index(0)) === 0) {\n        // empty-anything=empty\n        result = [];\n      } else if (subset(size(a2), new Index(0)) === 0) {\n        // anything-empty=anything\n        return (0, _array.flatten)(a1.toArray());\n      } else {\n        var b1 = (0, _array.identify)((0, _array.flatten)(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));\n        var b2 = (0, _array.identify)((0, _array.flatten)(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));\n        result = [];\n        var inb2;\n        for (var i = 0; i < b1.length; i++) {\n          inb2 = false;\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          if (!inb2) {\n            result.push(b1[i]);\n          }\n        }\n      }\n      // return an array, if both inputs were arrays\n      if (Array.isArray(a1) && Array.isArray(a2)) {\n        return (0, _array.generalize)(result);\n      }\n      // return a matrix otherwise\n      return new DenseMatrix((0, _array.generalize)(result));\n    }\n  });\n});\nexports.createSetDifference = createSetDifference;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSetDistinct = void 0;\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'setDistinct';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];\nvar createSetDistinct = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    size = _ref.size,\n    subset = _ref.subset,\n    compareNatural = _ref.compareNatural,\n    Index = _ref.Index,\n    DenseMatrix = _ref.DenseMatrix;\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  return typed(name, {\n    'Array | Matrix': function ArrayMatrix(a) {\n      var result;\n      if (subset(size(a), new Index(0)) === 0) {\n        // if empty, return empty\n        result = [];\n      } else {\n        var b = (0, _array.flatten)(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);\n        result = [];\n        result.push(b[0]);\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      }\n      // return an array, if the input was an array\n      if (Array.isArray(a)) {\n        return result;\n      }\n      // return a matrix otherwise\n      return new DenseMatrix(result);\n    }\n  });\n});\nexports.createSetDistinct = createSetDistinct;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSetIntersect = void 0;\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'setIntersect';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];\nvar createSetIntersect = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    size = _ref.size,\n    subset = _ref.subset,\n    compareNatural = _ref.compareNatural,\n    Index = _ref.Index,\n    DenseMatrix = _ref.DenseMatrix;\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  return typed(name, {\n    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {\n      var result;\n      if (subset(size(a1), new Index(0)) === 0 || subset(size(a2), new Index(0)) === 0) {\n        // of any of them is empty, return empty\n        result = [];\n      } else {\n        var b1 = (0, _array.identify)((0, _array.flatten)(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));\n        var b2 = (0, _array.identify)((0, _array.flatten)(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));\n        result = [];\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      }\n      // return an array, if both inputs were arrays\n      if (Array.isArray(a1) && Array.isArray(a2)) {\n        return (0, _array.generalize)(result);\n      }\n      // return a matrix otherwise\n      return new DenseMatrix((0, _array.generalize)(result));\n    }\n  });\n});\nexports.createSetIntersect = createSetIntersect;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSetIsSubset = void 0;\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'setIsSubset';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];\nvar createSetIsSubset = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    size = _ref.size,\n    subset = _ref.subset,\n    compareNatural = _ref.compareNatural,\n    Index = _ref.Index;\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} Returns true when a1 is a subset of a2, returns false otherwise\n   */\n  return typed(name, {\n    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {\n      if (subset(size(a1), new Index(0)) === 0) {\n        // empty is a subset of anything\n        return true;\n      } else if (subset(size(a2), new Index(0)) === 0) {\n        // anything is not a subset of empty\n        return false;\n      }\n      var b1 = (0, _array.identify)((0, _array.flatten)(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));\n      var b2 = (0, _array.identify)((0, _array.flatten)(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));\n      var inb2;\n      for (var i = 0; i < b1.length; i++) {\n        inb2 = false;\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        if (inb2 === false) {\n          return false;\n        }\n      }\n      return true;\n    }\n  });\n});\nexports.createSetIsSubset = createSetIsSubset;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSetMultiplicity = void 0;\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'setMultiplicity';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];\nvar createSetMultiplicity = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    size = _ref.size,\n    subset = _ref.subset,\n    compareNatural = _ref.compareNatural,\n    Index = _ref.Index;\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  return typed(name, {\n    'number | BigNumber | Fraction | Complex, Array | Matrix': function numberBigNumberFractionComplexArrayMatrix(e, a) {\n      if (subset(size(a), new Index(0)) === 0) {\n        // if empty, return 0\n        return 0;\n      }\n      var b = (0, _array.flatten)(Array.isArray(a) ? a : a.toArray());\n      var count = 0;\n      for (var i = 0; i < b.length; i++) {\n        if (compareNatural(b[i], e) === 0) {\n          count++;\n        }\n      }\n      return count;\n    }\n  });\n});\nexports.createSetMultiplicity = createSetMultiplicity;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSetPowerset = void 0;\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'setPowerset';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];\nvar createSetPowerset = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    size = _ref.size,\n    subset = _ref.subset,\n    compareNatural = _ref.compareNatural,\n    Index = _ref.Index;\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  return typed(name, {\n    'Array | Matrix': function ArrayMatrix(a) {\n      if (subset(size(a), new Index(0)) === 0) {\n        // if empty, return empty\n        return [];\n      }\n      var b = (0, _array.flatten)(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);\n      var result = [];\n      var number = 0;\n      while (number.toString(2).length <= b.length) {\n        result.push(_subset(b, number.toString(2).split('').reverse()));\n        number++;\n      }\n      // can not return a matrix, because of the different size of the subarrays\n      return _sort(result);\n    }\n  });\n\n  // create subset\n  function _subset(array, bitarray) {\n    var result = [];\n    for (var i = 0; i < bitarray.length; i++) {\n      if (bitarray[i] === '1') {\n        result.push(array[i]);\n      }\n    }\n    return result;\n  }\n\n  // sort subsests by length\n  function _sort(array) {\n    var temp = [];\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    return array;\n  }\n});\nexports.createSetPowerset = createSetPowerset;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSetSize = void 0;\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'setSize';\nvar dependencies = ['typed', 'compareNatural'];\nvar createSetSize = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    compareNatural = _ref.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   * @param {boolean} [unique]  If true, only the unique values are counted. False by default\n   * @return {number}           The number of elements of the (multi)set\n   */\n  return typed(name, {\n    'Array | Matrix': function ArrayMatrix(a) {\n      return Array.isArray(a) ? (0, _array.flatten)(a).length : (0, _array.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) ? (0, _array.flatten)(a).length : (0, _array.flatten)(a.toArray()).length;\n      } else {\n        var b = (0, _array.flatten)(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);\n        var count = 1;\n        for (var i = 1; i < b.length; i++) {\n          if (compareNatural(b[i], b[i - 1]) !== 0) {\n            count++;\n          }\n        }\n        return count;\n      }\n    }\n  });\n});\nexports.createSetSize = createSetSize;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSetSymDifference = void 0;\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'setSymDifference';\nvar dependencies = ['typed', 'size', 'concat', 'subset', 'setDifference', 'Index'];\nvar createSetSymDifference = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    size = _ref.size,\n    concat = _ref.concat,\n    subset = _ref.subset,\n    setDifference = _ref.setDifference,\n    Index = _ref.Index;\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  return typed(name, {\n    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {\n      if (subset(size(a1), new Index(0)) === 0) {\n        // if any of them is empty, return the other one\n        return (0, _array.flatten)(a2);\n      } else if (subset(size(a2), new Index(0)) === 0) {\n        return (0, _array.flatten)(a1);\n      }\n      var b1 = (0, _array.flatten)(a1);\n      var b2 = (0, _array.flatten)(a2);\n      return concat(setDifference(b1, b2), setDifference(b2, b1));\n    }\n  });\n});\nexports.createSetSymDifference = createSetSymDifference;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSetUnion = void 0;\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'setUnion';\nvar dependencies = ['typed', 'size', 'concat', 'subset', 'setIntersect', 'setSymDifference', 'Index'];\nvar createSetUnion = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    size = _ref.size,\n    concat = _ref.concat,\n    subset = _ref.subset,\n    setIntersect = _ref.setIntersect,\n    setSymDifference = _ref.setSymDifference,\n    Index = _ref.Index;\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  return typed(name, {\n    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {\n      if (subset(size(a1), new Index(0)) === 0) {\n        // if any of them is empty, return the other one\n        return (0, _array.flatten)(a2);\n      } else if (subset(size(a2), new Index(0)) === 0) {\n        return (0, _array.flatten)(a1);\n      }\n      var b1 = (0, _array.flatten)(a1);\n      var b2 = (0, _array.flatten)(a2);\n      return concat(setSymDifference(b1, b2), setIntersect(b1, b2));\n    }\n  });\n});\nexports.createSetUnion = createSetUnion;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createAdd = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _matAlgo01xDSid = require(\"../../type/matrix/utils/matAlgo01xDSid.js\");\nvar _matAlgo04xSidSid = require(\"../../type/matrix/utils/matAlgo04xSidSid.js\");\nvar _matAlgo10xSids = require(\"../../type/matrix/utils/matAlgo10xSids.js\");\nvar _matrixAlgorithmSuite = require(\"../../type/matrix/utils/matrixAlgorithmSuite.js\");\nvar name = 'add';\nvar dependencies = ['typed', 'matrix', 'addScalar', 'equalScalar', 'DenseMatrix', 'SparseMatrix', 'concat'];\nvar createAdd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    addScalar = _ref.addScalar,\n    equalScalar = _ref.equalScalar,\n    DenseMatrix = _ref.DenseMatrix,\n    SparseMatrix = _ref.SparseMatrix,\n    concat = _ref.concat;\n  var matAlgo01xDSid = (0, _matAlgo01xDSid.createMatAlgo01xDSid)({\n    typed: typed\n  });\n  var matAlgo04xSidSid = (0, _matAlgo04xSidSid.createMatAlgo04xSidSid)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo10xSids = (0, _matAlgo10xSids.createMatAlgo10xSids)({\n    typed: typed,\n    DenseMatrix: DenseMatrix\n  });\n  var matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({\n    typed: typed,\n    matrix: matrix,\n    concat: concat\n  });\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  return typed(name, {\n    'any, any': addScalar,\n    'any, any, ...any': typed.referToSelf(function (self) {\n      return function (x, y, rest) {\n        var result = self(x, y);\n        for (var i = 0; i < rest.length; i++) {\n          result = self(result, rest[i]);\n        }\n        return result;\n      };\n    })\n  }, matrixAlgorithmSuite({\n    elop: addScalar,\n    DS: matAlgo01xDSid,\n    SS: matAlgo04xSidSid,\n    Ss: matAlgo10xSids\n  }));\n});\nexports.createAdd = createAdd;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createHypot = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _is = require(\"../../utils/is.js\");\nvar name = 'hypot';\nvar dependencies = ['typed', 'abs', 'addScalar', 'divideScalar', 'multiplyScalar', 'sqrt', 'smaller', 'isPositive'];\nvar createHypot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    abs = _ref.abs,\n    addScalar = _ref.addScalar,\n    divideScalar = _ref.divideScalar,\n    multiplyScalar = _ref.multiplyScalar,\n    sqrt = _ref.sqrt,\n    smaller = _ref.smaller,\n    isPositive = _ref.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  return typed(name, {\n    '... number | BigNumber': _hypot,\n    Array: _hypot,\n    Matrix: function Matrix(M) {\n      return _hypot((0, _array.flatten)(M.toArray()));\n    }\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  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    for (var i = 0; i < args.length; i++) {\n      if ((0, _is.isComplex)(args[i])) {\n        throw new TypeError('Unexpected type of argument to hypot');\n      }\n      var value = abs(args[i]);\n      if (smaller(largest, value)) {\n        result = multiplyScalar(result, multiplyScalar(divideScalar(largest, value), divideScalar(largest, value)));\n        result = addScalar(result, 1);\n        largest = value;\n      } else {\n        result = addScalar(result, isPositive(value) ? multiplyScalar(divideScalar(value, largest), divideScalar(value, largest)) : value);\n      }\n    }\n    return multiplyScalar(largest, sqrt(result));\n  }\n});\nexports.createHypot = createHypot;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createNorm = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'norm';\nvar dependencies = ['typed', 'abs', 'add', 'pow', 'conj', 'sqrt', 'multiply', 'equalScalar', 'larger', 'smaller', 'matrix', 'ctranspose', 'eigs'];\nvar createNorm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    abs = _ref.abs,\n    add = _ref.add,\n    pow = _ref.pow,\n    conj = _ref.conj,\n    sqrt = _ref.sqrt,\n    multiply = _ref.multiply,\n    equalScalar = _ref.equalScalar,\n    larger = _ref.larger,\n    smaller = _ref.smaller,\n    matrix = _ref.matrix,\n    ctranspose = _ref.ctranspose,\n    eigs = _ref.eigs;\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  return typed(name, {\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    '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  /**\n   * Calculate the plus infinity norm for a vector\n   * @param {Matrix} x\n   * @returns {number} Returns the norm\n   * @private\n   */\n  function _vectorNormPlusInfinity(x) {\n    // norm(x, Infinity) = max(abs(x))\n    var pinf = 0;\n    // skip zeros since abs(0) === 0\n    x.forEach(function (value) {\n      var v = abs(value);\n      if (larger(v, pinf)) {\n        pinf = v;\n      }\n    }, true);\n    return pinf;\n  }\n\n  /**\n   * Calculate the minus infinity norm for a vector\n   * @param {Matrix} x\n   * @returns {number} Returns the norm\n   * @private\n   */\n  function _vectorNormMinusInfinity(x) {\n    // norm(x, -Infinity) = min(abs(x))\n    var ninf;\n    // skip zeros since abs(0) === 0\n    x.forEach(function (value) {\n      var v = abs(value);\n      if (!ninf || smaller(v, ninf)) {\n        ninf = v;\n      }\n    }, true);\n    return ninf || 0;\n  }\n\n  /**\n   * Calculate the norm for a vector\n   * @param {Matrix} x\n   * @param {number | string} p\n   * @returns {number} Returns the norm\n   * @private\n   */\n  function _vectorNorm(x, p) {\n    // check p\n    if (p === Number.POSITIVE_INFINITY || p === 'inf') {\n      return _vectorNormPlusInfinity(x);\n    }\n    if (p === Number.NEGATIVE_INFINITY || p === '-inf') {\n      return _vectorNormMinusInfinity(x);\n    }\n    if (p === 'fro') {\n      return _norm(x, 2);\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;\n        // skip zeros since abs(0) === 0\n        x.forEach(function (value) {\n          n = add(pow(abs(value), p), n);\n        }, true);\n        return pow(n, 1 / p);\n      }\n      return Number.POSITIVE_INFINITY;\n    }\n    // invalid parameter value\n    throw new Error('Unsupported parameter value');\n  }\n\n  /**\n   * Calculate the Frobenius norm for a matrix\n   * @param {Matrix} x\n   * @returns {number} Returns the norm\n   * @private\n   */\n  function _matrixNormFrobenius(x) {\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  /**\n   * Calculate the norm L1 for a matrix\n   * @param {Matrix} x\n   * @returns {number} Returns the norm\n   * @private\n   */\n  function _matrixNormOne(x) {\n    // norm(x) = the largest column sum\n    var c = [];\n    // result\n    var maxc = 0;\n    // skip zeros since abs(0) == 0\n    x.forEach(function (value, index) {\n      var j = index[1];\n      var cj = add(c[j] || 0, abs(value));\n      if (larger(cj, maxc)) {\n        maxc = cj;\n      }\n      c[j] = cj;\n    }, true);\n    return maxc;\n  }\n\n  /**\n   * Calculate the norm L2 for a matrix\n   * @param {Matrix} x\n   * @returns {number} Returns the norm\n   * @private\n   */\n  function _matrixNormTwo(x) {\n    // norm(x) = sqrt( max eigenvalue of A*.A)\n    var sizeX = x.size();\n    if (sizeX[0] !== sizeX[1]) {\n      throw new RangeError('Invalid matrix dimensions');\n    }\n    var tx = ctranspose(x);\n    var squaredX = multiply(tx, x);\n    var eigenVals = eigs(squaredX).values.toArray();\n    var rho = eigenVals[eigenVals.length - 1];\n    return abs(sqrt(rho));\n  }\n\n  /**\n   * Calculate the infinity norm for a matrix\n   * @param {Matrix} x\n   * @returns {number} Returns the norm\n   * @private\n   */\n  function _matrixNormInfinity(x) {\n    // norm(x) = the largest row sum\n    var r = [];\n    // result\n    var maxr = 0;\n    // skip zeros since abs(0) == 0\n    x.forEach(function (value, index) {\n      var i = index[0];\n      var ri = add(r[i] || 0, abs(value));\n      if (larger(ri, maxr)) {\n        maxr = ri;\n      }\n      r[i] = ri;\n    }, true);\n    return maxr;\n  }\n\n  /**\n   * Calculate the norm for a 2D Matrix (M*N)\n   * @param {Matrix} x\n   * @param {number | string} p\n   * @returns {number} Returns the norm\n   * @private\n   */\n  function _matrixNorm(x, p) {\n    // check p\n    if (p === 1) {\n      return _matrixNormOne(x);\n    }\n    if (p === Number.POSITIVE_INFINITY || p === 'inf') {\n      return _matrixNormInfinity(x);\n    }\n    if (p === 'fro') {\n      return _matrixNormFrobenius(x);\n    }\n    if (p === 2) {\n      return _matrixNormTwo(x);\n    } // invalid parameter value\n\n    throw new Error('Unsupported parameter value ' + 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  function _norm(x, p) {\n    // size\n    var sizeX = x.size();\n\n    // check if it is a vector\n    if (sizeX.length === 1) {\n      return _vectorNorm(x, p);\n    }\n    // MxN matrix\n    if (sizeX.length === 2) {\n      if (sizeX[0] && sizeX[1]) {\n        return _matrixNorm(x, p);\n      } else {\n        throw new RangeError('Invalid matrix dimensions');\n      }\n    }\n  }\n});\nexports.createNorm = createNorm;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createDot = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _is = require(\"../../utils/is.js\");\nvar name = 'dot';\nvar dependencies = ['typed', 'addScalar', 'multiplyScalar', 'conj', 'size'];\nvar createDot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    addScalar = _ref.addScalar,\n    multiplyScalar = _ref.multiplyScalar,\n    conj = _ref.conj,\n    size = _ref.size;\n  /**\n   * Calculate the dot product of two vectors. The dot product of\n   * `A = [a1, a2, ..., an]` and `B = [b1, b2, ..., bn]` is defined as:\n   *\n   *    dot(A, B) = conj(a1) * b1 + conj(a2) * b2 + ... + conj(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  return typed(name, {\n    'Array | DenseMatrix, Array | DenseMatrix': _denseDot,\n    'SparseMatrix, SparseMatrix': _sparseDot\n  });\n  function _validateDim(x, y) {\n    var xSize = _size(x);\n    var ySize = _size(y);\n    var xLen, yLen;\n    if (xSize.length === 1) {\n      xLen = xSize[0];\n    } else if (xSize.length === 2 && xSize[1] === 1) {\n      xLen = xSize[0];\n    } else {\n      throw new RangeError('Expected a column vector, instead got a matrix of size (' + xSize.join(', ') + ')');\n    }\n    if (ySize.length === 1) {\n      yLen = ySize[0];\n    } else if (ySize.length === 2 && ySize[1] === 1) {\n      yLen = ySize[0];\n    } else {\n      throw new RangeError('Expected a column vector, instead got a matrix of size (' + ySize.join(', ') + ')');\n    }\n    if (xLen !== yLen) throw new RangeError('Vectors must have equal length (' + xLen + ' != ' + yLen + ')');\n    if (xLen === 0) throw new RangeError('Cannot calculate the dot product of empty vectors');\n    return xLen;\n  }\n  function _denseDot(a, b) {\n    var N = _validateDim(a, b);\n    var adata = (0, _is.isMatrix)(a) ? a._data : a;\n    var adt = (0, _is.isMatrix)(a) ? a._datatype : undefined;\n    var bdata = (0, _is.isMatrix)(b) ? b._data : b;\n    var bdt = (0, _is.isMatrix)(b) ? b._datatype : undefined;\n\n    // are these 2-dimensional column vectors? (as opposed to 1-dimensional vectors)\n    var aIsColumn = _size(a).length === 2;\n    var bIsColumn = _size(b).length === 2;\n    var add = addScalar;\n    var mul = multiplyScalar;\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string') {\n      var dt = adt;\n      // find signatures that matches (dt, dt)\n      add = typed.find(addScalar, [dt, dt]);\n      mul = typed.find(multiplyScalar, [dt, dt]);\n    }\n\n    // both vectors 1-dimensional\n    if (!aIsColumn && !bIsColumn) {\n      var c = mul(conj(adata[0]), bdata[0]);\n      for (var i = 1; i < N; i++) {\n        c = add(c, mul(conj(adata[i]), bdata[i]));\n      }\n      return c;\n    }\n\n    // a is 1-dim, b is column\n    if (!aIsColumn && bIsColumn) {\n      var _c = mul(conj(adata[0]), bdata[0][0]);\n      for (var _i = 1; _i < N; _i++) {\n        _c = add(_c, mul(conj(adata[_i]), bdata[_i][0]));\n      }\n      return _c;\n    }\n\n    // a is column, b is 1-dim\n    if (aIsColumn && !bIsColumn) {\n      var _c2 = mul(conj(adata[0][0]), bdata[0]);\n      for (var _i2 = 1; _i2 < N; _i2++) {\n        _c2 = add(_c2, mul(conj(adata[_i2][0]), bdata[_i2]));\n      }\n      return _c2;\n    }\n\n    // both vectors are column\n    if (aIsColumn && bIsColumn) {\n      var _c3 = mul(conj(adata[0][0]), bdata[0][0]);\n      for (var _i3 = 1; _i3 < N; _i3++) {\n        _c3 = add(_c3, mul(conj(adata[_i3][0]), bdata[_i3][0]));\n      }\n      return _c3;\n    }\n  }\n  function _sparseDot(x, y) {\n    _validateDim(x, y);\n    var xindex = x._index;\n    var xvalues = x._values;\n    var yindex = y._index;\n    var yvalues = y._values;\n\n    // TODO optimize add & mul using datatype\n    var c = 0;\n    var add = addScalar;\n    var mul = multiplyScalar;\n    var i = 0;\n    var j = 0;\n    while (i < xindex.length && j < yindex.length) {\n      var I = xindex[i];\n      var J = yindex[j];\n      if (I < J) {\n        i++;\n        continue;\n      }\n      if (I > J) {\n        j++;\n        continue;\n      }\n      if (I === J) {\n        c = add(c, mul(xvalues[i], yvalues[j]));\n        i++;\n        j++;\n      }\n    }\n    return c;\n  }\n\n  // TODO remove this once #1771 is fixed\n  function _size(x) {\n    return (0, _is.isMatrix)(x) ? x.size() : size(x);\n  }\n});\nexports.createDot = createDot;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createTrace = void 0;\nvar _object = require(\"../../utils/object.js\");\nvar _string = require(\"../../utils/string.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'trace';\nvar dependencies = ['typed', 'matrix', 'add'];\nvar createTrace = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    add = _ref.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  return 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: _object.clone\n  });\n  function _denseTrace(m) {\n    // matrix size & data\n    var size = m._size;\n    var data = m._data;\n\n    // process dimensions\n    switch (size.length) {\n      case 1:\n        // vector\n        if (size[0] === 1) {\n          // return data[0]\n          return (0, _object.clone)(data[0]);\n        }\n        throw new RangeError('Matrix must be square (size: ' + (0, _string.format)(size) + ')');\n      case 2:\n        {\n          // two dimensional\n          var rows = size[0];\n          var cols = size[1];\n          if (rows === cols) {\n            // calulate sum\n            var sum = 0;\n            // loop diagonal\n            for (var i = 0; i < rows; i++) {\n              sum = add(sum, data[i][i]);\n            }\n            // return trace\n            return sum;\n          } else {\n            throw new RangeError('Matrix must be square (size: ' + (0, _string.format)(size) + ')');\n          }\n        }\n      default:\n        // multi dimensional\n        throw new RangeError('Matrix must be two dimensional (size: ' + (0, _string.format)(size) + ')');\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;\n    // check dimensions\n    var rows = size[0];\n    var columns = size[1];\n    // matrix must be square\n    if (rows === columns) {\n      // calulate sum\n      var sum = 0;\n      // check we have data (avoid looping columns)\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];\n          // loop k within [k0, k1[\n          for (var k = k0; k < k1; k++) {\n            // row index\n            var i = index[k];\n            // check row\n            if (i === j) {\n              // accumulate value\n              sum = add(sum, values[k]);\n              // exit loop\n              break;\n            }\n            if (i > j) {\n              // exit loop, no value on the diagonal for column j\n              break;\n            }\n          }\n        }\n      }\n      // return trace\n      return sum;\n    }\n    throw new RangeError('Matrix must be square (size: ' + (0, _string.format)(size) + ')');\n  }\n});\nexports.createTrace = createTrace;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createIndex = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar _is = require(\"../../../utils/is.js\");\nvar name = 'index';\nvar dependencies = ['typed', 'Index'];\nvar createIndex = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    Index = _ref.Index;\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 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(name, {\n    '...number | string | BigNumber | Range | Array | Matrix': function numberStringBigNumberRangeArrayMatrix(args) {\n      var ranges = args.map(function (arg) {\n        if ((0, _is.isBigNumber)(arg)) {\n          return arg.toNumber(); // convert BigNumber to Number\n        } else if (Array.isArray(arg) || (0, _is.isMatrix)(arg)) {\n          return arg.map(function (elem) {\n            // convert BigNumber to Number\n            return (0, _is.isBigNumber)(elem) ? elem.toNumber() : elem;\n          });\n        } else {\n          return arg;\n        }\n      });\n      var res = new Index();\n      Index.apply(res, ranges);\n      return res;\n    }\n  });\n});\nexports.createIndex = createIndex;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.keywords = void 0;\n// Reserved keywords not allowed to use in the parser\nvar keywords = new Set(['end']);\nexports.keywords = keywords;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createNode = void 0;\nvar _typeof2 = _interopRequireDefault(require(\"@babel/runtime/helpers/typeof\"));\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\nvar _toConsumableArray2 = _interopRequireDefault(require(\"@babel/runtime/helpers/toConsumableArray\"));\nvar _is = require(\"../../utils/is.js\");\nvar _keywords = require(\"../keywords.js\");\nvar _object = require(\"../../utils/object.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _map = require(\"../../utils/map.js\");\nvar name = 'Node';\nvar dependencies = ['mathWithTransform'];\nvar createNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var mathWithTransform = _ref.mathWithTransform;\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  function _validateScope(scope) {\n    for (var _i = 0, _arr = (0, _toConsumableArray2[\"default\"])(_keywords.keywords); _i < _arr.length; _i++) {\n      var symbol = _arr[_i];\n      if (scope.has(symbol)) {\n        throw new Error('Scope contains an illegal symbol, \"' + symbol + '\" is a reserved keyword');\n      }\n    }\n  }\n  var Node = /*#__PURE__*/function () {\n    function Node() {\n      (0, _classCallCheck2[\"default\"])(this, Node);\n    }\n    (0, _createClass2[\"default\"])(Node, [{\n      key: \"type\",\n      get: function get() {\n        return 'Node';\n      }\n    }, {\n      key: \"isNode\",\n      get: function get() {\n        return true;\n      }\n\n      /**\n       * Evaluate the node\n       * @param {Object} [scope]  Scope to read/write variables\n       * @return {*}              Returns the result\n       */\n    }, {\n      key: \"evaluate\",\n      value: function evaluate(scope) {\n        return this.compile().evaluate(scope);\n      }\n\n      /**\n       * Compile the node into an optimized, evauatable JavaScript function\n       * @return {{evaluate: function([Object])}} object\n       *                Returns an object with a function 'evaluate',\n       *                which can be invoked as expr.evaluate([scope: Object]),\n       *                where scope is an optional object with\n       *                variables.\n       */\n    }, {\n      key: \"compile\",\n      value: function compile() {\n        var expr = this._compile(mathWithTransform, {});\n        var args = {};\n        var context = null;\n        function evaluate(scope) {\n          var s = (0, _map.createMap)(scope);\n          _validateScope(s);\n          return expr(s, args, context);\n        }\n        return {\n          evaluate: evaluate\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      key: \"_compile\",\n      value: function _compile(math, argNames) {\n        throw new Error('Method _compile must be implemented by type ' + this.type);\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      key: \"forEach\",\n      value: function forEach(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      /**\n       * Create a new Node whose children are the results of calling the\n       * provided callback function for each child 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      key: \"map\",\n      value: function map(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      /**\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      key: \"_ifNode\",\n      value: function _ifNode(node) {\n        if (!(0, _is.isNode)(node)) {\n          throw new TypeError('Callback function must return a Node');\n        }\n        return node;\n      }\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      key: \"traverse\",\n      value: function traverse(callback) {\n        // execute callback for itself\n        // eslint-disable-next-line\n        callback(this, null, null);\n\n        // recursively traverse over all children of a node\n        function _traverse(node, callback) {\n          node.forEach(function (child, path, parent) {\n            callback(child, path, parent);\n            _traverse(child, callback);\n          });\n        }\n        _traverse(this, callback);\n      }\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\n       * a 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. The \"signature\"\n       *          of the callback must be:\n       *          callback(node: Node, index: string, parent: Node) : Node\n       * @return {Node} Returns the original node or its replacement\n       */\n    }, {\n      key: \"transform\",\n      value: function transform(callback) {\n        function _transform(child, path, parent) {\n          var replacement = callback(child, path, parent);\n          if (replacement !== child) {\n            // stop iterating when the node is replaced\n            return replacement;\n          }\n          return child.map(_transform);\n        }\n        return _transform(this, null, null);\n      }\n\n      /**\n       * Find any node in the node tree matching given filter function. For\n       * example, to 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\n       *            An array with nodes matching given filter criteria\n       */\n    }, {\n      key: \"filter\",\n      value: function filter(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      }\n\n      /**\n       * Create a shallow clone of this node\n       * @return {Node}\n       */\n    }, {\n      key: \"clone\",\n      value: function clone() {\n        // must be implemented by each of the Node implementations\n        throw new Error('Cannot clone a Node interface');\n      }\n\n      /**\n       * Create a deep clone of this node\n       * @return {Node}\n       */\n    }, {\n      key: \"cloneDeep\",\n      value: function cloneDeep() {\n        return this.map(function (node) {\n          return node.cloneDeep();\n        });\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      key: \"equals\",\n      value: function equals(other) {\n        return other ? this.type === other.type && (0, _object.deepStrictEqual)(this, other) : false;\n      }\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      key: \"toString\",\n      value: function toString(options) {\n        var customString = this._getCustomString(options);\n        if (typeof customString !== 'undefined') {\n          return customString;\n        }\n        return this._toString(options);\n      }\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      key: \"toJSON\",\n      value: function toJSON() {\n        throw new Error('Cannot serialize object: toJSON not implemented by ' + this.type);\n      }\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      key: \"toHTML\",\n      value: function toHTML(options) {\n        var customString = this._getCustomString(options);\n        if (typeof customString !== 'undefined') {\n          return customString;\n        }\n        return this.toHTML(options);\n      }\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      key: \"_toString\",\n      value: function _toString() {\n        // must be implemented by each of the Node implementations\n        throw new Error('_toString not implemented for ' + this.type);\n      }\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      key: \"toTex\",\n      value: function toTex(options) {\n        var customString = this._getCustomString(options);\n        if (typeof customString !== 'undefined') {\n          return customString;\n        }\n        return this._toTex(options);\n      }\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      key: \"_toTex\",\n      value: function _toTex(options) {\n        // must be implemented by each of the Node implementations\n        throw new Error('_toTex not implemented for ' + this.type);\n      }\n\n      /**\n       * Helper used by `to...` functions.\n       */\n    }, {\n      key: \"_getCustomString\",\n      value: function _getCustomString(options) {\n        if (options && (0, _typeof2[\"default\"])(options) === 'object') {\n          switch ((0, _typeof2[\"default\"])(options.handler)) {\n            case 'object':\n            case 'undefined':\n              return;\n            case 'function':\n              return options.handler(this, options);\n            default:\n              throw new TypeError('Object or function expected as callback');\n          }\n        }\n      }\n\n      /**\n       * Get identifier.\n       * @return {string}\n       */\n    }, {\n      key: \"getIdentifier\",\n      value: function getIdentifier() {\n        return this.type;\n      }\n\n      /**\n       * Get the content of the current Node.\n       * @return {Node} node\n       **/\n    }, {\n      key: \"getContent\",\n      value: function getContent() {\n        return this;\n      }\n    }]);\n    return Node;\n  }();\n  return Node;\n}, {\n  isClass: true,\n  isNode: true\n});\nexports.createNode = createNode;","function _setPrototypeOf(o, p) {\n  module.exports = _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) {\n    o.__proto__ = p;\n    return o;\n  }, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;\n  return _setPrototypeOf(o, p);\n}\nmodule.exports = _setPrototypeOf, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","var setPrototypeOf = require(\"./setPrototypeOf.js\");\nfunction _inherits(subClass, superClass) {\n  if (typeof superClass !== \"function\" && superClass !== null) {\n    throw new TypeError(\"Super expression must either be null or a function\");\n  }\n  subClass.prototype = Object.create(superClass && superClass.prototype, {\n    constructor: {\n      value: subClass,\n      writable: true,\n      configurable: true\n    }\n  });\n  Object.defineProperty(subClass, \"prototype\", {\n    writable: false\n  });\n  if (superClass) setPrototypeOf(subClass, superClass);\n}\nmodule.exports = _inherits, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","function _assertThisInitialized(self) {\n  if (self === void 0) {\n    throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");\n  }\n  return self;\n}\nmodule.exports = _assertThisInitialized, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","var _typeof = require(\"./typeof.js\")[\"default\"];\nvar assertThisInitialized = require(\"./assertThisInitialized.js\");\nfunction _possibleConstructorReturn(self, call) {\n  if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) {\n    return call;\n  } else if (call !== void 0) {\n    throw new TypeError(\"Derived constructors may only return object or undefined\");\n  }\n  return assertThisInitialized(self);\n}\nmodule.exports = _possibleConstructorReturn, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","function _getPrototypeOf(o) {\n  module.exports = _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) {\n    return o.__proto__ || Object.getPrototypeOf(o);\n  }, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;\n  return _getPrototypeOf(o);\n}\nmodule.exports = _getPrototypeOf, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.errorTransform = errorTransform;\nvar _IndexError = require(\"../../../error/IndexError.js\");\n/**\n * Transform zero-based indices to one-based indices in errors\n * @param {Error} err\n * @returns {Error | IndexError} Returns the transformed error\n */\nfunction errorTransform(err) {\n  if (err && err.isIndexError) {\n    return new _IndexError.IndexError(err.index + 1, err.min + 1, err.max !== undefined ? err.max + 1 : undefined);\n  }\n  return err;\n}","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.accessFactory = accessFactory;\nvar _typeof2 = _interopRequireDefault(require(\"@babel/runtime/helpers/typeof\"));\nvar _errorTransform = require(\"../../transform/utils/errorTransform.js\");\nvar _customs = require(\"../../../utils/customs.js\");\nfunction accessFactory(_ref) {\n  var subset = _ref.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  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 ((0, _typeof2[\"default\"])(object) === 'object') {\n        if (!index.isObjectProperty()) {\n          throw new TypeError('Cannot apply a numeric index as object property');\n        }\n        return (0, _customs.getSafeProperty)(object, index.getObjectProperty());\n      } else {\n        throw new TypeError('Cannot apply index: unsupported type of object');\n      }\n    } catch (err) {\n      throw (0, _errorTransform.errorTransform)(err);\n    }\n  };\n}","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createAccessorNode = void 0;\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\nvar _defineProperty2 = _interopRequireDefault(require(\"@babel/runtime/helpers/defineProperty\"));\nvar _is = require(\"../../utils/is.js\");\nvar _customs = require(\"../../utils/customs.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _access = require(\"./utils/access.js\");\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nvar name = 'AccessorNode';\nvar dependencies = ['subset', 'Node'];\nvar createAccessorNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var subset = _ref.subset,\n    Node = _ref.Node;\n  var access = (0, _access.accessFactory)({\n    subset: subset\n  });\n\n  /**\n   * Are parenthesis needed?\n   * @private\n   */\n  function needParenthesis(node) {\n    // TODO: maybe make a method on the nodes which tells whether they need parenthesis?\n    return !((0, _is.isAccessorNode)(node) || (0, _is.isArrayNode)(node) || (0, _is.isConstantNode)(node) || (0, _is.isFunctionNode)(node) || (0, _is.isObjectNode)(node) || (0, _is.isParenthesisNode)(node) || (0, _is.isSymbolNode)(node));\n  }\n  var AccessorNode = /*#__PURE__*/function (_Node) {\n    (0, _inherits2[\"default\"])(AccessorNode, _Node);\n    var _super = _createSuper(AccessorNode);\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    function AccessorNode(object, index) {\n      var _this;\n      (0, _classCallCheck2[\"default\"])(this, AccessorNode);\n      _this = _super.call(this);\n      if (!(0, _is.isNode)(object)) {\n        throw new TypeError('Node expected for parameter \"object\"');\n      }\n      if (!(0, _is.isIndexNode)(index)) {\n        throw new TypeError('IndexNode expected for parameter \"index\"');\n      }\n      _this.object = object;\n      _this.index = index;\n      return _this;\n    }\n\n    // readonly property name\n    (0, _createClass2[\"default\"])(AccessorNode, [{\n      key: \"name\",\n      get: function get() {\n        if (this.index) {\n          return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';\n        } else {\n          return this.object.name || '';\n        }\n      }\n    }, {\n      key: \"type\",\n      get: function get() {\n        return name;\n      }\n    }, {\n      key: \"isAccessorNode\",\n      get: function get() {\n        return true;\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      key: \"_compile\",\n      value: function _compile(math, argNames) {\n        var evalObject = this.object._compile(math, argNames);\n        var evalIndex = this.index._compile(math, argNames);\n        if (this.index.isObjectProperty()) {\n          var prop = this.index.getObjectProperty();\n          return function evalAccessorNode(scope, args, context) {\n            // get a property from an object evaluated using the scope.\n            return (0, _customs.getSafeProperty)(evalObject(scope, args, context), prop);\n          };\n        } else {\n          return function evalAccessorNode(scope, args, context) {\n            var object = evalObject(scope, args, context);\n            // we pass just object here instead of context:\n            var index = evalIndex(scope, args, object);\n            return access(object, index);\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      key: \"forEach\",\n      value: function forEach(callback) {\n        callback(this.object, 'object', this);\n        callback(this.index, 'index', this);\n      }\n\n      /**\n       * Create a new AccessorNode whose children are the results of calling\n       * the provided callback function for each child 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      key: \"map\",\n      value: function map(callback) {\n        return new AccessorNode(this._ifNode(callback(this.object, 'object', this)), this._ifNode(callback(this.index, 'index', this)));\n      }\n\n      /**\n       * Create a clone of this node, a shallow copy\n       * @return {AccessorNode}\n       */\n    }, {\n      key: \"clone\",\n      value: function clone() {\n        return new AccessorNode(this.object, this.index);\n      }\n\n      /**\n       * Get string representation\n       * @param {Object} options\n       * @return {string}\n       */\n    }, {\n      key: \"_toString\",\n      value: function _toString(options) {\n        var object = this.object.toString(options);\n        if (needParenthesis(this.object)) {\n          object = '(' + object + ')';\n        }\n        return object + this.index.toString(options);\n      }\n\n      /**\n       * Get HTML representation\n       * @param {Object} options\n       * @return {string}\n       */\n    }, {\n      key: \"toHTML\",\n      value: function toHTML(options) {\n        var object = this.object.toHTML(options);\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        return object + this.index.toHTML(options);\n      }\n\n      /**\n       * Get LaTeX representation\n       * @param {Object} options\n       * @return {string}\n       */\n    }, {\n      key: \"_toTex\",\n      value: function _toTex(options) {\n        var object = this.object.toTex(options);\n        if (needParenthesis(this.object)) {\n          object = '\\\\left(\\' + object + \\'\\\\right)';\n        }\n        return object + this.index.toTex(options);\n      }\n\n      /**\n       * Get a JSON representation of the node\n       * @returns {Object}\n       */\n    }, {\n      key: \"toJSON\",\n      value: function toJSON() {\n        return {\n          mathjs: name,\n          object: this.object,\n          index: this.index\n        };\n      }\n\n      /**\n       * Instantiate an AccessorNode from its JSON representation\n       * @param {Object} json\n       *     An object structured like\n       *     `{\"mathjs\": \"AccessorNode\", object: ..., index: ...}`,\n       *     where mathjs is optional\n       * @returns {AccessorNode}\n       */\n    }], [{\n      key: \"fromJSON\",\n      value: function fromJSON(json) {\n        return new AccessorNode(json.object, json.index);\n      }\n    }]);\n    return AccessorNode;\n  }(Node);\n  (0, _defineProperty2[\"default\"])(AccessorNode, \"name\", name);\n  return AccessorNode;\n}, {\n  isClass: true,\n  isNode: true\n});\nexports.createAccessorNode = createAccessorNode;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createArrayNode = void 0;\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\nvar _defineProperty2 = _interopRequireDefault(require(\"@babel/runtime/helpers/defineProperty\"));\nvar _is = require(\"../../utils/is.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nvar name = 'ArrayNode';\nvar dependencies = ['Node'];\nvar createArrayNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var Node = _ref.Node;\n  var ArrayNode = /*#__PURE__*/function (_Node) {\n    (0, _inherits2[\"default\"])(ArrayNode, _Node);\n    var _super = _createSuper(ArrayNode);\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    function ArrayNode(items) {\n      var _this;\n      (0, _classCallCheck2[\"default\"])(this, ArrayNode);\n      _this = _super.call(this);\n      _this.items = items || [];\n\n      // validate input\n      if (!Array.isArray(_this.items) || !_this.items.every(_is.isNode)) {\n        throw new TypeError('Array containing Nodes expected');\n      }\n      return _this;\n    }\n    (0, _createClass2[\"default\"])(ArrayNode, [{\n      key: \"type\",\n      get: function get() {\n        return name;\n      }\n    }, {\n      key: \"isArrayNode\",\n      get: function get() {\n        return true;\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      key: \"_compile\",\n      value: function _compile(math, argNames) {\n        var evalItems = (0, _array.map)(this.items, function (item) {\n          return item._compile(math, argNames);\n        });\n        var asMatrix = math.config.matrix !== 'Array';\n        if (asMatrix) {\n          var matrix = math.matrix;\n          return function evalArrayNode(scope, args, context) {\n            return matrix((0, _array.map)(evalItems, function (evalItem) {\n              return evalItem(scope, args, context);\n            }));\n          };\n        } else {\n          return function evalArrayNode(scope, args, context) {\n            return (0, _array.map)(evalItems, function (evalItem) {\n              return evalItem(scope, args, context);\n            });\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      key: \"forEach\",\n      value: function forEach(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      /**\n       * Create a new ArrayNode whose children are the results of calling\n       * the provided callback function for each child 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      key: \"map\",\n      value: function map(callback) {\n        var items = [];\n        for (var i = 0; i < this.items.length; i++) {\n          items[i] = this._ifNode(callback(this.items[i], 'items[' + i + ']', this));\n        }\n        return new ArrayNode(items);\n      }\n\n      /**\n       * Create a clone of this node, a shallow copy\n       * @return {ArrayNode}\n       */\n    }, {\n      key: \"clone\",\n      value: function clone() {\n        return new ArrayNode(this.items.slice(0));\n      }\n\n      /**\n       * Get string representation\n       * @param {Object} options\n       * @return {string} str\n       * @override\n       */\n    }, {\n      key: \"_toString\",\n      value: function _toString(options) {\n        var items = this.items.map(function (node) {\n          return node.toString(options);\n        });\n        return '[' + items.join(', ') + ']';\n      }\n\n      /**\n       * Get a JSON representation of the node\n       * @returns {Object}\n       */\n    }, {\n      key: \"toJSON\",\n      value: function toJSON() {\n        return {\n          mathjs: name,\n          items: this.items\n        };\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      key: \"toHTML\",\n      value:\n      /**\n       * Get HTML representation\n       * @param {Object} options\n       * @return {string} str\n       * @override\n       */\n      function toHTML(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      /**\n       * Get LaTeX representation\n       * @param {Object} options\n       * @return {string} str\n       */\n    }, {\n      key: \"_toTex\",\n      value: function _toTex(options) {\n        function itemsToTex(items, nested) {\n          var mixedItems = items.some(_is.isArrayNode) && !items.every(_is.isArrayNode);\n          var itemsFormRow = nested || mixedItems;\n          var itemSep = itemsFormRow ? '&' : '\\\\\\\\';\n          var itemsTex = items.map(function (node) {\n            if (node.items) {\n              return itemsToTex(node.items, !nested);\n            } else {\n              return node.toTex(options);\n            }\n          }).join(itemSep);\n          return mixedItems || !itemsFormRow || itemsFormRow && !nested ? '\\\\begin{bmatrix}' + itemsTex + '\\\\end{bmatrix}' : itemsTex;\n        }\n        return itemsToTex(this.items, false);\n      }\n    }], [{\n      key: \"fromJSON\",\n      value: function fromJSON(json) {\n        return new ArrayNode(json.items);\n      }\n    }]);\n    return ArrayNode;\n  }(Node);\n  (0, _defineProperty2[\"default\"])(ArrayNode, \"name\", name);\n  return ArrayNode;\n}, {\n  isClass: true,\n  isNode: true\n});\nexports.createArrayNode = createArrayNode;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.assignFactory = assignFactory;\nvar _typeof2 = _interopRequireDefault(require(\"@babel/runtime/helpers/typeof\"));\nvar _errorTransform = require(\"../../transform/utils/errorTransform.js\");\nvar _customs = require(\"../../../utils/customs.js\");\nfunction assignFactory(_ref) {\n  var subset = _ref.subset,\n    matrix = _ref.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  return function assign(object, index, value) {\n    try {\n      if (Array.isArray(object)) {\n        // we use matrix.subset here instead of the function subset because we must not clone the contents\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 ((0, _typeof2[\"default\"])(object) === 'object') {\n        if (!index.isObjectProperty()) {\n          throw TypeError('Cannot apply a numeric index as object property');\n        }\n        (0, _customs.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 (0, _errorTransform.errorTransform)(err);\n    }\n  };\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.getAssociativity = getAssociativity;\nexports.getOperator = getOperator;\nexports.getPrecedence = getPrecedence;\nexports.isAssociativeWith = isAssociativeWith;\nexports.properties = void 0;\nvar _object = require(\"../utils/object.js\");\nvar _is = require(\"../utils/is.js\");\nfunction _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it[\"return\"] != null) it[\"return\"](); } finally { if (didErr) throw err; } } }; }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }\nvar properties = [{\n  // assignment\n  AssignmentNode: {},\n  FunctionAssignmentNode: {}\n}, {\n  // conditional expression\n  ConditionalNode: {\n    latexLeftParens: false,\n    latexRightParens: false,\n    latexParens: false\n    // conditionals don't need parentheses in LaTeX because\n    // they are 2 dimensional\n  }\n}, {\n  // logical or\n  'OperatorNode:or': {\n    op: 'or',\n    associativity: 'left',\n    associativeWith: []\n  }\n}, {\n  // logical xor\n  'OperatorNode:xor': {\n    op: 'xor',\n    associativity: 'left',\n    associativeWith: []\n  }\n}, {\n  // logical and\n  'OperatorNode:and': {\n    op: 'and',\n    associativity: 'left',\n    associativeWith: []\n  }\n}, {\n  // bitwise or\n  'OperatorNode:bitOr': {\n    op: '|',\n    associativity: 'left',\n    associativeWith: []\n  }\n}, {\n  // bitwise xor\n  'OperatorNode:bitXor': {\n    op: '^|',\n    associativity: 'left',\n    associativeWith: []\n  }\n}, {\n  // bitwise and\n  'OperatorNode:bitAnd': {\n    op: '&',\n    associativity: 'left',\n    associativeWith: []\n  }\n}, {\n  // relational operators\n  'OperatorNode:equal': {\n    op: '==',\n    associativity: 'left',\n    associativeWith: []\n  },\n  'OperatorNode:unequal': {\n    op: '!=',\n    associativity: 'left',\n    associativeWith: []\n  },\n  'OperatorNode:smaller': {\n    op: '<',\n    associativity: 'left',\n    associativeWith: []\n  },\n  'OperatorNode:larger': {\n    op: '>',\n    associativity: 'left',\n    associativeWith: []\n  },\n  'OperatorNode:smallerEq': {\n    op: '<=',\n    associativity: 'left',\n    associativeWith: []\n  },\n  'OperatorNode:largerEq': {\n    op: '>=',\n    associativity: 'left',\n    associativeWith: []\n  },\n  RelationalNode: {\n    associativity: 'left',\n    associativeWith: []\n  }\n}, {\n  // bitshift operators\n  'OperatorNode:leftShift': {\n    op: '<<',\n    associativity: 'left',\n    associativeWith: []\n  },\n  'OperatorNode:rightArithShift': {\n    op: '>>',\n    associativity: 'left',\n    associativeWith: []\n  },\n  'OperatorNode:rightLogShift': {\n    op: '>>>',\n    associativity: 'left',\n    associativeWith: []\n  }\n}, {\n  // unit conversion\n  'OperatorNode:to': {\n    op: 'to',\n    associativity: 'left',\n    associativeWith: []\n  }\n}, {\n  // range\n  RangeNode: {}\n}, {\n  // addition, subtraction\n  'OperatorNode:add': {\n    op: '+',\n    associativity: 'left',\n    associativeWith: ['OperatorNode:add', 'OperatorNode:subtract']\n  },\n  'OperatorNode:subtract': {\n    op: '-',\n    associativity: 'left',\n    associativeWith: []\n  }\n}, {\n  // multiply, divide, modulus\n  'OperatorNode:multiply': {\n    op: '*',\n    associativity: 'left',\n    associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'Operator:dotMultiply', 'Operator:dotDivide']\n  },\n  'OperatorNode:divide': {\n    op: '/',\n    associativity: 'left',\n    associativeWith: [],\n    latexLeftParens: false,\n    latexRightParens: false,\n    latexParens: false\n    // 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    op: '.*',\n    associativity: 'left',\n    associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'OperatorNode:dotMultiply', 'OperatorNode:doDivide']\n  },\n  'OperatorNode:dotDivide': {\n    op: './',\n    associativity: 'left',\n    associativeWith: []\n  },\n  'OperatorNode:mod': {\n    op: 'mod',\n    associativity: 'left',\n    associativeWith: []\n  }\n}, {\n  // Repeat multiplication for implicit multiplication\n  'OperatorNode:multiply': {\n    associativity: 'left',\n    associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'Operator:dotMultiply', 'Operator:dotDivide']\n  }\n}, {\n  // unary prefix operators\n  'OperatorNode:unaryPlus': {\n    op: '+',\n    associativity: 'right'\n  },\n  'OperatorNode:unaryMinus': {\n    op: '-',\n    associativity: 'right'\n  },\n  'OperatorNode:bitNot': {\n    op: '~',\n    associativity: 'right'\n  },\n  'OperatorNode:not': {\n    op: 'not',\n    associativity: 'right'\n  }\n}, {\n  // exponentiation\n  'OperatorNode:pow': {\n    op: '^',\n    associativity: 'right',\n    associativeWith: [],\n    latexRightParens: false\n    // 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    op: '.^',\n    associativity: 'right',\n    associativeWith: []\n  }\n}, {\n  // factorial\n  'OperatorNode:factorial': {\n    op: '!',\n    associativity: 'left'\n  }\n}, {\n  // matrix transpose\n  'OperatorNode:ctranspose': {\n    op: \"'\",\n    associativity: 'left'\n  }\n}];\n\n/**\n * Returns the first non-parenthesis internal node, but only\n * when the 'parenthesis' option is unset or auto.\n * @param {Node} _node\n * @param {string} parenthesis\n * @return {Node}\n */\nexports.properties = properties;\nfunction unwrapParen(_node, parenthesis) {\n  if (!parenthesis || parenthesis !== 'auto') return _node;\n  var node = _node;\n  while ((0, _is.isParenthesisNode)(node)) {\n    node = node.content;\n  }\n  return node;\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} _node\n * @param {string} parenthesis\n * @param {string} implicit\n * @param {Node} parent (for determining context for implicit multiplication)\n * @return {number | null}\n */\nfunction getPrecedence(_node, parenthesis, implicit, parent) {\n  var node = _node;\n  if (parenthesis !== 'keep') {\n    // ParenthesisNodes are only ignored when not in 'keep' mode\n    node = _node.getContent();\n  }\n  var identifier = node.getIdentifier();\n  var precedence = null;\n  for (var i = 0; i < properties.length; i++) {\n    if (identifier in properties[i]) {\n      precedence = i;\n      break;\n    }\n  }\n  // Bump up precedence of implicit multiplication, except when preceded\n  // by a \"Rule 2\" fraction ( [unaryOp]constant / constant )\n  if (identifier === 'OperatorNode:multiply' && node.implicit && implicit !== 'show') {\n    var leftArg = unwrapParen(node.args[0], parenthesis);\n    if (!((0, _is.isConstantNode)(leftArg) && parent && parent.getIdentifier() === 'OperatorNode:divide' && (0, _is.rule2Node)(unwrapParen(parent.args[0], parenthesis))) && !(leftArg.getIdentifier() === 'OperatorNode:divide' && (0, _is.rule2Node)(unwrapParen(leftArg.args[0], parenthesis)) && (0, _is.isConstantNode)(unwrapParen(leftArg.args[1])))) {\n      precedence += 1;\n    }\n  }\n  return precedence;\n}\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} _node\n * @param {string} parenthesis\n * @return {string|null}\n * @throws {Error}\n */\nfunction getAssociativity(_node, parenthesis) {\n  var node = _node;\n  if (parenthesis !== 'keep') {\n    // ParenthesisNodes are only ignored when not in 'keep' mode\n    node = _node.getContent();\n  }\n  var identifier = node.getIdentifier();\n  var index = getPrecedence(node, parenthesis);\n  if (index === null) {\n    // node isn't in the list\n    return null;\n  }\n  var property = properties[index][identifier];\n  if ((0, _object.hasOwnProperty)(property, 'associativity')) {\n    if (property.associativity === 'left') {\n      return 'left';\n    }\n    if (property.associativity === 'right') {\n      return 'right';\n    }\n    // associativity is invalid\n    throw Error('\\'' + identifier + '\\' has the invalid associativity \\'' + property.associativity + '\\'.');\n  }\n\n  // associativity is undefined\n  return null;\n}\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 {boolean | null}\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  if (index === null) {\n    // node isn't in the list\n    return null;\n  }\n  var property = properties[index][identifierA];\n  if ((0, _object.hasOwnProperty)(property, '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    return false;\n  }\n\n  // associativeWith is not defined\n  return null;\n}\n\n/**\n * Get the operator associated with a function name.\n * Returns a string with the operator symbol, or null if the\n * input is not the name of a function associated with an\n * operator.\n *\n * @param {string} Function name\n * @return {string | null} Associated operator symbol, if any\n */\nfunction getOperator(fn) {\n  var identifier = 'OperatorNode:' + fn;\n  var _iterator = _createForOfIteratorHelper(properties),\n    _step;\n  try {\n    for (_iterator.s(); !(_step = _iterator.n()).done;) {\n      var group = _step.value;\n      if (identifier in group) {\n        return group[identifier].op;\n      }\n    }\n  } catch (err) {\n    _iterator.e(err);\n  } finally {\n    _iterator.f();\n  }\n  return null;\n}","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createAssignmentNode = void 0;\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\nvar _defineProperty2 = _interopRequireDefault(require(\"@babel/runtime/helpers/defineProperty\"));\nvar _is = require(\"../../utils/is.js\");\nvar _customs = require(\"../../utils/customs.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _access = require(\"./utils/access.js\");\nvar _assign = require(\"./utils/assign.js\");\nvar _operators = require(\"../operators.js\");\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nvar name = 'AssignmentNode';\nvar dependencies = ['subset', '?matrix',\n// FIXME: should not be needed at all, should be handled by subset\n'Node'];\nvar createAssignmentNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var subset = _ref.subset,\n    matrix = _ref.matrix,\n    Node = _ref.Node;\n  var access = (0, _access.accessFactory)({\n    subset: subset\n  });\n  var assign = (0, _assign.assignFactory)({\n    subset: subset,\n    matrix: matrix\n  });\n\n  /*\n   * Is parenthesis needed?\n   * @param {node} node\n   * @param {string} [parenthesis='keep']\n   * @param {string} implicit\n   * @private\n   */\n  function needParenthesis(node, parenthesis, implicit) {\n    if (!parenthesis) {\n      parenthesis = 'keep';\n    }\n    var precedence = (0, _operators.getPrecedence)(node, parenthesis, implicit);\n    var exprPrecedence = (0, _operators.getPrecedence)(node.value, parenthesis, implicit);\n    return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;\n  }\n  var AssignmentNode = /*#__PURE__*/function (_Node) {\n    (0, _inherits2[\"default\"])(AssignmentNode, _Node);\n    var _super = _createSuper(AssignmentNode);\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'),\n     *                       new IndexNode('b'),\n     *                       new ConstantNode(2))   // a.b=2\n     *    new AssignmentNode(new SymbolNode('a'),\n     *                       new IndexNode(1, 2),\n     *                       new ConstantNode(3))  // a[1,2]=3\n     *\n     * @param {SymbolNode | AccessorNode} object\n     *     Object on which to assign a value\n     * @param {IndexNode} [index=null]\n     *     Index, property name or matrix index. Optional. If not provided\n     *     and `object` is a SymbolNode, the property is assigned to the\n     *     global scope.\n     * @param {Node} value\n     *     The value to be assigned\n     */\n    function AssignmentNode(object, index, value) {\n      var _this;\n      (0, _classCallCheck2[\"default\"])(this, AssignmentNode);\n      _this = _super.call(this);\n      _this.object = object;\n      _this.index = value ? index : null;\n      _this.value = value || index;\n\n      // validate input\n      if (!(0, _is.isSymbolNode)(object) && !(0, _is.isAccessorNode)(object)) {\n        throw new TypeError('SymbolNode or AccessorNode expected as \"object\"');\n      }\n      if ((0, _is.isSymbolNode)(object) && object.name === 'end') {\n        throw new Error('Cannot assign to symbol \"end\"');\n      }\n      if (_this.index && !(0, _is.isIndexNode)(_this.index)) {\n        // index is optional\n        throw new TypeError('IndexNode expected as \"index\"');\n      }\n      if (!(0, _is.isNode)(_this.value)) {\n        throw new TypeError('Node expected as \"value\"');\n      }\n      return _this;\n    }\n\n    // class name for typing purposes:\n    (0, _createClass2[\"default\"])(AssignmentNode, [{\n      key: \"name\",\n      get:\n      // readonly property name\n      function get() {\n        if (this.index) {\n          return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';\n        } else {\n          return this.object.name || '';\n        }\n      }\n    }, {\n      key: \"type\",\n      get: function get() {\n        return name;\n      }\n    }, {\n      key: \"isAssignmentNode\",\n      get: function get() {\n        return true;\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      key: \"_compile\",\n      value: function _compile(math, argNames) {\n        var evalObject = this.object._compile(math, argNames);\n        var evalIndex = this.index ? this.index._compile(math, argNames) : null;\n        var evalValue = this.value._compile(math, argNames);\n        var name = this.object.name;\n        if (!this.index) {\n          // apply a variable to the scope, for example `a=2`\n          if (!(0, _is.isSymbolNode)(this.object)) {\n            throw new TypeError('SymbolNode expected as object');\n          }\n          return function evalAssignmentNode(scope, args, context) {\n            var value = evalValue(scope, args, context);\n            scope.set(name, value);\n            return value;\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            (0, _customs.setSafeProperty)(object, prop, value);\n            return value;\n          };\n        } else if ((0, _is.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            // Important:  we pass childObject instead of context:\n            var index = evalIndex(scope, args, childObject);\n            scope.set(name, assign(childObject, index, value));\n            return value;\n          };\n        } else {\n          // isAccessorNode(node.object) === true\n          // update a matrix subset, for example `a.b[2]=3`\n\n          // we will not use the compile function of the AccessorNode, but\n          // compile it ourselves here as we need the parent object of the\n          // AccessorNode:\n          // wee need to apply the updated object to parent object\n          var evalParentObject = this.object.object._compile(math, argNames);\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 = (0, _customs.getSafeProperty)(parent, parentProp);\n              // Important: we pass childObject instead of context:\n              var index = evalIndex(scope, args, childObject);\n              var value = evalValue(scope, args, context);\n              (0, _customs.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\n            // the size\n            var evalParentIndex = this.object.index._compile(math, argNames);\n            return function evalAssignmentNode(scope, args, context) {\n              var parent = evalParentObject(scope, args, context);\n              // Important: we pass parent instead of context:\n              var parentIndex = evalParentIndex(scope, args, parent);\n              var childObject = access(parent, parentIndex);\n              // Important:  we pass childObject instead of context\n              var index = evalIndex(scope, args, childObject);\n              var value = evalValue(scope, args, context);\n              assign(parent, parentIndex, assign(childObject, index, value));\n              return value;\n            };\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      key: \"forEach\",\n      value: function forEach(callback) {\n        callback(this.object, 'object', this);\n        if (this.index) {\n          callback(this.index, 'index', this);\n        }\n        callback(this.value, 'value', this);\n      }\n\n      /**\n       * Create a new AssignmentNode whose children are the results of calling\n       * the provided callback function for each child 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      key: \"map\",\n      value: function map(callback) {\n        var object = this._ifNode(callback(this.object, 'object', this));\n        var index = this.index ? this._ifNode(callback(this.index, 'index', this)) : null;\n        var value = this._ifNode(callback(this.value, 'value', this));\n        return new AssignmentNode(object, index, value);\n      }\n\n      /**\n       * Create a clone of this node, a shallow copy\n       * @return {AssignmentNode}\n       */\n    }, {\n      key: \"clone\",\n      value: function clone() {\n        return new AssignmentNode(this.object, this.index, this.value);\n      }\n\n      /**\n       * Get string representation\n       * @param {Object} options\n       * @return {string}\n       */\n    }, {\n      key: \"_toString\",\n      value: function _toString(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        if (needParenthesis(this, options && options.parenthesis, options && options.implicit)) {\n          value = '(' + value + ')';\n        }\n        return object + index + ' = ' + value;\n      }\n\n      /**\n       * Get a JSON representation of the node\n       * @returns {Object}\n       */\n    }, {\n      key: \"toJSON\",\n      value: function toJSON() {\n        return {\n          mathjs: name,\n          object: this.object,\n          index: this.index,\n          value: this.value\n        };\n      }\n\n      /**\n       * Instantiate an AssignmentNode from its JSON representation\n       * @param {Object} json\n       *     An object structured like\n       *     `{\"mathjs\": \"AssignmentNode\", object: ..., index: ..., value: ...}`,\n       *     where mathjs is optional\n       * @returns {AssignmentNode}\n       */\n    }, {\n      key: \"toHTML\",\n      value:\n      /**\n       * Get HTML representation\n       * @param {Object} options\n       * @return {string}\n       */\n      function toHTML(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        if (needParenthesis(this, options && options.parenthesis, options && options.implicit)) {\n          value = '<span class=\"math-paranthesis math-round-parenthesis\">(</span>' + value + '<span class=\"math-paranthesis math-round-parenthesis\">)</span>';\n        }\n        return object + index + '<span class=\"math-operator math-assignment-operator ' + 'math-variable-assignment-operator math-binary-operator\">=</span>' + value;\n      }\n\n      /**\n       * Get LaTeX representation\n       * @param {Object} options\n       * @return {string}\n       */\n    }, {\n      key: \"_toTex\",\n      value: function _toTex(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        if (needParenthesis(this, options && options.parenthesis, options && options.implicit)) {\n          value = \"\\\\left(\".concat(value, \"\\\\right)\");\n        }\n        return object + index + ':=' + value;\n      }\n    }], [{\n      key: \"fromJSON\",\n      value: function fromJSON(json) {\n        return new AssignmentNode(json.object, json.index, json.value);\n      }\n    }]);\n    return AssignmentNode;\n  }(Node);\n  (0, _defineProperty2[\"default\"])(AssignmentNode, \"name\", name);\n  return AssignmentNode;\n}, {\n  isClass: true,\n  isNode: true\n});\nexports.createAssignmentNode = createAssignmentNode;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createBlockNode = void 0;\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\nvar _defineProperty2 = _interopRequireDefault(require(\"@babel/runtime/helpers/defineProperty\"));\nvar _is = require(\"../../utils/is.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nvar name = 'BlockNode';\nvar dependencies = ['ResultSet', 'Node'];\nvar createBlockNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var ResultSet = _ref.ResultSet,\n    Node = _ref.Node;\n  var BlockNode = /*#__PURE__*/function (_Node) {\n    (0, _inherits2[\"default\"])(BlockNode, _Node);\n    var _super = _createSuper(BlockNode);\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\n     *            Object with properties block, which is a Node, and visible,\n     *            which is a boolean. The property visible is optional and\n     *            is true by default\n     */\n    function BlockNode(blocks) {\n      var _this;\n      (0, _classCallCheck2[\"default\"])(this, BlockNode);\n      _this = _super.call(this);\n      // validate input, copy blocks\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 (!(0, _is.isNode)(node)) throw new TypeError('Property \"node\" must be a Node');\n        if (typeof visible !== 'boolean') {\n          throw new TypeError('Property \"visible\" must be a boolean');\n        }\n        return {\n          node: node,\n          visible: visible\n        };\n      });\n      return _this;\n    }\n    (0, _createClass2[\"default\"])(BlockNode, [{\n      key: \"type\",\n      get: function get() {\n        return name;\n      }\n    }, {\n      key: \"isBlockNode\",\n      get: function get() {\n        return true;\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      key: \"_compile\",\n      value: function _compile(math, argNames) {\n        var evalBlocks = (0, _array.map)(this.blocks, function (block) {\n          return {\n            evaluate: block.node._compile(math, argNames),\n            visible: block.visible\n          };\n        });\n        return function evalBlockNodes(scope, args, context) {\n          var results = [];\n          (0, _array.forEach)(evalBlocks, function evalBlockNode(block) {\n            var result = block.evaluate(scope, args, context);\n            if (block.visible) {\n              results.push(result);\n            }\n          });\n          return new ResultSet(results);\n        };\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      key: \"forEach\",\n      value: function forEach(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      /**\n       * Create a new BlockNode whose children are the results of calling\n       * the provided callback function for each child 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      key: \"map\",\n      value: function map(callback) {\n        var blocks = [];\n        for (var i = 0; i < this.blocks.length; i++) {\n          var block = this.blocks[i];\n          var node = this._ifNode(callback(block.node, 'blocks[' + i + '].node', this));\n          blocks[i] = {\n            node: node,\n            visible: block.visible\n          };\n        }\n        return new BlockNode(blocks);\n      }\n\n      /**\n       * Create a clone of this node, a shallow copy\n       * @return {BlockNode}\n       */\n    }, {\n      key: \"clone\",\n      value: function clone() {\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      /**\n       * Get string representation\n       * @param {Object} options\n       * @return {string} str\n       * @override\n       */\n    }, {\n      key: \"_toString\",\n      value: function _toString(options) {\n        return this.blocks.map(function (param) {\n          return param.node.toString(options) + (param.visible ? '' : ';');\n        }).join('\\n');\n      }\n\n      /**\n       * Get a JSON representation of the node\n       * @returns {Object}\n       */\n    }, {\n      key: \"toJSON\",\n      value: function toJSON() {\n        return {\n          mathjs: name,\n          blocks: this.blocks\n        };\n      }\n\n      /**\n       * Instantiate an BlockNode from its JSON representation\n       * @param {Object} json\n       *     An object structured like\n       *     `{\"mathjs\": \"BlockNode\", blocks: [{node: ..., visible: false}, ...]}`,\n       *     where mathjs is optional\n       * @returns {BlockNode}\n       */\n    }, {\n      key: \"toHTML\",\n      value:\n      /**\n       * Get HTML representation\n       * @param {Object} options\n       * @return {string} str\n       * @override\n       */\n      function toHTML(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      /**\n       * Get LaTeX representation\n       * @param {Object} options\n       * @return {string} str\n       */\n    }, {\n      key: \"_toTex\",\n      value: function _toTex(options) {\n        return this.blocks.map(function (param) {\n          return param.node.toTex(options) + (param.visible ? '' : ';');\n        }).join('\\\\;\\\\;\\n');\n      }\n    }], [{\n      key: \"fromJSON\",\n      value: function fromJSON(json) {\n        return new BlockNode(json.blocks);\n      }\n    }]);\n    return BlockNode;\n  }(Node);\n  (0, _defineProperty2[\"default\"])(BlockNode, \"name\", name);\n  return BlockNode;\n}, {\n  isClass: true,\n  isNode: true\n});\nexports.createBlockNode = createBlockNode;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createConditionalNode = void 0;\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\nvar _defineProperty2 = _interopRequireDefault(require(\"@babel/runtime/helpers/defineProperty\"));\nvar _is = require(\"../../utils/is.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _operators = require(\"../operators.js\");\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nvar name = 'ConditionalNode';\nvar dependencies = ['Node'];\nvar createConditionalNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var Node = _ref.Node;\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  function testCondition(condition) {\n    if (typeof condition === 'number' || typeof condition === 'boolean' || typeof condition === 'string') {\n      return !!condition;\n    }\n    if (condition) {\n      if ((0, _is.isBigNumber)(condition)) {\n        return !condition.isZero();\n      }\n      if ((0, _is.isComplex)(condition)) {\n        return !!(condition.re || condition.im);\n      }\n      if ((0, _is.isUnit)(condition)) {\n        return !!condition.value;\n      }\n    }\n    if (condition === null || condition === undefined) {\n      return false;\n    }\n    throw new TypeError('Unsupported type of condition \"' + (0, _is.typeOf)(condition) + '\"');\n  }\n  var ConditionalNode = /*#__PURE__*/function (_Node) {\n    (0, _inherits2[\"default\"])(ConditionalNode, _Node);\n    var _super = _createSuper(ConditionalNode);\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    function ConditionalNode(condition, trueExpr, falseExpr) {\n      var _this;\n      (0, _classCallCheck2[\"default\"])(this, ConditionalNode);\n      _this = _super.call(this);\n      if (!(0, _is.isNode)(condition)) {\n        throw new TypeError('Parameter condition must be a Node');\n      }\n      if (!(0, _is.isNode)(trueExpr)) {\n        throw new TypeError('Parameter trueExpr must be a Node');\n      }\n      if (!(0, _is.isNode)(falseExpr)) {\n        throw new TypeError('Parameter falseExpr must be a Node');\n      }\n      _this.condition = condition;\n      _this.trueExpr = trueExpr;\n      _this.falseExpr = falseExpr;\n      return _this;\n    }\n    (0, _createClass2[\"default\"])(ConditionalNode, [{\n      key: \"type\",\n      get: function get() {\n        return name;\n      }\n    }, {\n      key: \"isConditionalNode\",\n      get: function get() {\n        return true;\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      key: \"_compile\",\n      value: function _compile(math, argNames) {\n        var evalCondition = this.condition._compile(math, argNames);\n        var evalTrueExpr = this.trueExpr._compile(math, argNames);\n        var evalFalseExpr = this.falseExpr._compile(math, argNames);\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      /**\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      key: \"forEach\",\n      value: function forEach(callback) {\n        callback(this.condition, 'condition', this);\n        callback(this.trueExpr, 'trueExpr', this);\n        callback(this.falseExpr, 'falseExpr', this);\n      }\n\n      /**\n       * Create a new ConditionalNode whose children are the results of calling\n       * the provided callback function for each child 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      key: \"map\",\n      value: function map(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      /**\n       * Create a clone of this node, a shallow copy\n       * @return {ConditionalNode}\n       */\n    }, {\n      key: \"clone\",\n      value: function clone() {\n        return new ConditionalNode(this.condition, this.trueExpr, this.falseExpr);\n      }\n\n      /**\n       * Get string representation\n       * @param {Object} options\n       * @return {string} str\n       */\n    }, {\n      key: \"_toString\",\n      value: function _toString(options) {\n        var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n        var precedence = (0, _operators.getPrecedence)(this, parenthesis, options && options.implicit);\n\n        // 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        var condition = this.condition.toString(options);\n        var conditionPrecedence = (0, _operators.getPrecedence)(this.condition, parenthesis, options && options.implicit);\n        if (parenthesis === 'all' || this.condition.type === 'OperatorNode' || conditionPrecedence !== null && conditionPrecedence <= precedence) {\n          condition = '(' + condition + ')';\n        }\n        var trueExpr = this.trueExpr.toString(options);\n        var truePrecedence = (0, _operators.getPrecedence)(this.trueExpr, parenthesis, options && options.implicit);\n        if (parenthesis === 'all' || this.trueExpr.type === 'OperatorNode' || truePrecedence !== null && truePrecedence <= precedence) {\n          trueExpr = '(' + trueExpr + ')';\n        }\n        var falseExpr = this.falseExpr.toString(options);\n        var falsePrecedence = (0, _operators.getPrecedence)(this.falseExpr, parenthesis, options && options.implicit);\n        if (parenthesis === 'all' || this.falseExpr.type === 'OperatorNode' || falsePrecedence !== null && falsePrecedence <= precedence) {\n          falseExpr = '(' + falseExpr + ')';\n        }\n        return condition + ' ? ' + trueExpr + ' : ' + falseExpr;\n      }\n\n      /**\n       * Get a JSON representation of the node\n       * @returns {Object}\n       */\n    }, {\n      key: \"toJSON\",\n      value: function toJSON() {\n        return {\n          mathjs: name,\n          condition: this.condition,\n          trueExpr: this.trueExpr,\n          falseExpr: this.falseExpr\n        };\n      }\n\n      /**\n       * Instantiate an ConditionalNode from its JSON representation\n       * @param {Object} json\n       *     An object structured like\n       *     ```\n       *     {\"mathjs\": \"ConditionalNode\",\n       *      \"condition\": ...,\n       *      \"trueExpr\": ...,\n       *      \"falseExpr\": ...}\n       *     ```\n       *     where mathjs is optional\n       * @returns {ConditionalNode}\n       */\n    }, {\n      key: \"toHTML\",\n      value:\n      /**\n       * Get HTML representation\n       * @param {Object} options\n       * @return {string} str\n       */\n      function toHTML(options) {\n        var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n        var precedence = (0, _operators.getPrecedence)(this, parenthesis, options && options.implicit);\n\n        // 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        var condition = this.condition.toHTML(options);\n        var conditionPrecedence = (0, _operators.getPrecedence)(this.condition, parenthesis, options && options.implicit);\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        var trueExpr = this.trueExpr.toHTML(options);\n        var truePrecedence = (0, _operators.getPrecedence)(this.trueExpr, parenthesis, options && options.implicit);\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        var falseExpr = this.falseExpr.toHTML(options);\n        var falsePrecedence = (0, _operators.getPrecedence)(this.falseExpr, parenthesis, options && options.implicit);\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        return condition + '<span class=\"math-operator math-conditional-operator\">?</span>' + trueExpr + '<span class=\"math-operator math-conditional-operator\">:</span>' + falseExpr;\n      }\n\n      /**\n       * Get LaTeX representation\n       * @param {Object} options\n       * @return {string} str\n       */\n    }, {\n      key: \"_toTex\",\n      value: function _toTex(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      key: \"fromJSON\",\n      value: function fromJSON(json) {\n        return new ConditionalNode(json.condition, json.trueExpr, json.falseExpr);\n      }\n    }]);\n    return ConditionalNode;\n  }(Node);\n  (0, _defineProperty2[\"default\"])(ConditionalNode, \"name\", name);\n  return ConditionalNode;\n}, {\n  isClass: true,\n  isNode: true\n});\nexports.createConditionalNode = createConditionalNode;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.defaultTemplate = void 0;\nexports.escapeLatex = escapeLatex;\nexports.latexSymbols = exports.latexOperators = exports.latexFunctions = void 0;\nexports.toSymbol = toSymbol;\nvar _escapeLatex = _interopRequireDefault(require(\"escape-latex\"));\nvar _object = require(\"./object.js\");\n/* eslint no-template-curly-in-string: \"off\" */\n\nvar latexSymbols = {\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.latexSymbols = latexSymbols;\nvar latexOperators = {\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.latexOperators = latexOperators;\nvar latexFunctions = {\n  // arithmetic\n  abs: {\n    1: '\\\\left|${args[0]}\\\\right|'\n  },\n  add: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.add, \"${args[1]}\\\\right)\")\n  },\n  cbrt: {\n    1: '\\\\sqrt[3]{${args[0]}}'\n  },\n  ceil: {\n    1: '\\\\left\\\\lceil${args[0]}\\\\right\\\\rceil'\n  },\n  cube: {\n    1: '\\\\left(${args[0]}\\\\right)^3'\n  },\n  divide: {\n    2: '\\\\frac{${args[0]}}{${args[1]}}'\n  },\n  dotDivide: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.dotDivide, \"${args[1]}\\\\right)\")\n  },\n  dotMultiply: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.dotMultiply, \"${args[1]}\\\\right)\")\n  },\n  dotPow: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.dotPow, \"${args[1]}\\\\right)\")\n  },\n  exp: {\n    1: '\\\\exp\\\\left(${args[0]}\\\\right)'\n  },\n  expm1: \"\\\\left(e\".concat(latexOperators.pow, \"{${args[0]}}-1\\\\right)\"),\n  fix: {\n    1: '\\\\mathrm{${name}}\\\\left(${args[0]}\\\\right)'\n  },\n  floor: {\n    1: '\\\\left\\\\lfloor${args[0]}\\\\right\\\\rfloor'\n  },\n  gcd: '\\\\gcd\\\\left(${args}\\\\right)',\n  hypot: '\\\\hypot\\\\left(${args}\\\\right)',\n  log: {\n    1: '\\\\ln\\\\left(${args[0]}\\\\right)',\n    2: '\\\\log_{${args[1]}}\\\\left(${args[0]}\\\\right)'\n  },\n  log10: {\n    1: '\\\\log_{10}\\\\left(${args[0]}\\\\right)'\n  },\n  log1p: {\n    1: '\\\\ln\\\\left(${args[0]}+1\\\\right)',\n    2: '\\\\log_{${args[1]}}\\\\left(${args[0]}+1\\\\right)'\n  },\n  log2: '\\\\log_{2}\\\\left(${args[0]}\\\\right)',\n  mod: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.mod, \"${args[1]}\\\\right)\")\n  },\n  multiply: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.multiply, \"${args[1]}\\\\right)\")\n  },\n  norm: {\n    1: '\\\\left\\\\|${args[0]}\\\\right\\\\|',\n    2: undefined // use default template\n  },\n\n  nthRoot: {\n    2: '\\\\sqrt[${args[1]}]{${args[0]}}'\n  },\n  nthRoots: {\n    2: '\\\\{y : $y^{args[1]} = {${args[0]}}\\\\}'\n  },\n  pow: {\n    2: \"\\\\left(${args[0]}\\\\right)\".concat(latexOperators.pow, \"{${args[1]}}\")\n  },\n  round: {\n    1: '\\\\left\\\\lfloor${args[0]}\\\\right\\\\rceil',\n    2: undefined // use default template\n  },\n\n  sign: {\n    1: '\\\\mathrm{${name}}\\\\left(${args[0]}\\\\right)'\n  },\n  sqrt: {\n    1: '\\\\sqrt{${args[0]}}'\n  },\n  square: {\n    1: '\\\\left(${args[0]}\\\\right)^2'\n  },\n  subtract: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.subtract, \"${args[1]}\\\\right)\")\n  },\n  unaryMinus: {\n    1: \"\".concat(latexOperators.unaryMinus, \"\\\\left(${args[0]}\\\\right)\")\n  },\n  unaryPlus: {\n    1: \"\".concat(latexOperators.unaryPlus, \"\\\\left(${args[0]}\\\\right)\")\n  },\n  // bitwise\n  bitAnd: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.bitAnd, \"${args[1]}\\\\right)\")\n  },\n  bitNot: {\n    1: latexOperators.bitNot + '\\\\left(${args[0]}\\\\right)'\n  },\n  bitOr: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.bitOr, \"${args[1]}\\\\right)\")\n  },\n  bitXor: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.bitXor, \"${args[1]}\\\\right)\")\n  },\n  leftShift: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.leftShift, \"${args[1]}\\\\right)\")\n  },\n  rightArithShift: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.rightArithShift, \"${args[1]}\\\\right)\")\n  },\n  rightLogShift: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.rightLogShift, \"${args[1]}\\\\right)\")\n  },\n  // combinatorics\n  bellNumbers: {\n    1: '\\\\mathrm{B}_{${args[0]}}'\n  },\n  catalan: {\n    1: '\\\\mathrm{C}_{${args[0]}}'\n  },\n  stirlingS2: {\n    2: '\\\\mathrm{S}\\\\left(${args}\\\\right)'\n  },\n  // complex\n  arg: {\n    1: '\\\\arg\\\\left(${args[0]}\\\\right)'\n  },\n  conj: {\n    1: '\\\\left(${args[0]}\\\\right)^*'\n  },\n  im: {\n    1: '\\\\Im\\\\left\\\\lbrace${args[0]}\\\\right\\\\rbrace'\n  },\n  re: {\n    1: '\\\\Re\\\\left\\\\lbrace${args[0]}\\\\right\\\\rbrace'\n  },\n  // logical\n  and: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.and, \"${args[1]}\\\\right)\")\n  },\n  not: {\n    1: latexOperators.not + '\\\\left(${args[0]}\\\\right)'\n  },\n  or: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.or, \"${args[1]}\\\\right)\")\n  },\n  xor: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.xor, \"${args[1]}\\\\right)\")\n  },\n  // matrix\n  cross: {\n    2: '\\\\left(${args[0]}\\\\right)\\\\times\\\\left(${args[1]}\\\\right)'\n  },\n  ctranspose: {\n    1: \"\\\\left(${args[0]}\\\\right)\".concat(latexOperators.ctranspose)\n  },\n  det: {\n    1: '\\\\det\\\\left(${args[0]}\\\\right)'\n  },\n  dot: {\n    2: '\\\\left(${args[0]}\\\\cdot${args[1]}\\\\right)'\n  },\n  expm: {\n    1: '\\\\exp\\\\left(${args[0]}\\\\right)'\n  },\n  inv: {\n    1: '\\\\left(${args[0]}\\\\right)^{-1}'\n  },\n  pinv: {\n    1: '\\\\left(${args[0]}\\\\right)^{+}'\n  },\n  sqrtm: {\n    1: \"{${args[0]}}\".concat(latexOperators.pow, \"{\\\\frac{1}{2}}\")\n  },\n  trace: {\n    1: '\\\\mathrm{tr}\\\\left(${args[0]}\\\\right)'\n  },\n  transpose: {\n    1: \"\\\\left(${args[0]}\\\\right)\".concat(latexOperators.transpose)\n  },\n  // probability\n  combinations: {\n    2: '\\\\binom{${args[0]}}{${args[1]}}'\n  },\n  combinationsWithRep: {\n    2: '\\\\left(\\\\!\\\\!{\\\\binom{${args[0]}}{${args[1]}}}\\\\!\\\\!\\\\right)'\n  },\n  factorial: {\n    1: \"\\\\left(${args[0]}\\\\right)\".concat(latexOperators.factorial)\n  },\n  gamma: {\n    1: '\\\\Gamma\\\\left(${args[0]}\\\\right)'\n  },\n  lgamma: {\n    1: '\\\\ln\\\\Gamma\\\\left(${args[0]}\\\\right)'\n  },\n  // relational\n  equal: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.equal, \"${args[1]}\\\\right)\")\n  },\n  larger: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.larger, \"${args[1]}\\\\right)\")\n  },\n  largerEq: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.largerEq, \"${args[1]}\\\\right)\")\n  },\n  smaller: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.smaller, \"${args[1]}\\\\right)\")\n  },\n  smallerEq: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.smallerEq, \"${args[1]}\\\\right)\")\n  },\n  unequal: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.unequal, \"${args[1]}\\\\right)\")\n  },\n  // special\n  erf: {\n    1: 'erf\\\\left(${args[0]}\\\\right)'\n  },\n  // statistics\n  max: '\\\\max\\\\left(${args}\\\\right)',\n  min: '\\\\min\\\\left(${args}\\\\right)',\n  variance: '\\\\mathrm{Var}\\\\left(${args}\\\\right)',\n  // trigonometry\n  acos: {\n    1: '\\\\cos^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  acosh: {\n    1: '\\\\cosh^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  acot: {\n    1: '\\\\cot^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  acoth: {\n    1: '\\\\coth^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  acsc: {\n    1: '\\\\csc^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  acsch: {\n    1: '\\\\mathrm{csch}^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  asec: {\n    1: '\\\\sec^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  asech: {\n    1: '\\\\mathrm{sech}^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  asin: {\n    1: '\\\\sin^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  asinh: {\n    1: '\\\\sinh^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  atan: {\n    1: '\\\\tan^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  atan2: {\n    2: '\\\\mathrm{atan2}\\\\left(${args}\\\\right)'\n  },\n  atanh: {\n    1: '\\\\tanh^{-1}\\\\left(${args[0]}\\\\right)'\n  },\n  cos: {\n    1: '\\\\cos\\\\left(${args[0]}\\\\right)'\n  },\n  cosh: {\n    1: '\\\\cosh\\\\left(${args[0]}\\\\right)'\n  },\n  cot: {\n    1: '\\\\cot\\\\left(${args[0]}\\\\right)'\n  },\n  coth: {\n    1: '\\\\coth\\\\left(${args[0]}\\\\right)'\n  },\n  csc: {\n    1: '\\\\csc\\\\left(${args[0]}\\\\right)'\n  },\n  csch: {\n    1: '\\\\mathrm{csch}\\\\left(${args[0]}\\\\right)'\n  },\n  sec: {\n    1: '\\\\sec\\\\left(${args[0]}\\\\right)'\n  },\n  sech: {\n    1: '\\\\mathrm{sech}\\\\left(${args[0]}\\\\right)'\n  },\n  sin: {\n    1: '\\\\sin\\\\left(${args[0]}\\\\right)'\n  },\n  sinh: {\n    1: '\\\\sinh\\\\left(${args[0]}\\\\right)'\n  },\n  tan: {\n    1: '\\\\tan\\\\left(${args[0]}\\\\right)'\n  },\n  tanh: {\n    1: '\\\\tanh\\\\left(${args[0]}\\\\right)'\n  },\n  // unit\n  to: {\n    2: \"\\\\left(${args[0]}\".concat(latexOperators.to, \"${args[1]}\\\\right)\")\n  },\n  // utils\n  numeric: function numeric(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  // type\n  number: {\n    0: '0',\n    1: '\\\\left(${args[0]}\\\\right)',\n    2: '\\\\left(\\\\left(${args[0]}\\\\right)${args[1]}\\\\right)'\n  },\n  string: {\n    0: '\\\\mathtt{\"\"}',\n    1: '\\\\mathrm{string}\\\\left(${args[0]}\\\\right)'\n  },\n  bignumber: {\n    0: '0',\n    1: '\\\\left(${args[0]}\\\\right)'\n  },\n  complex: {\n    0: '0',\n    1: '\\\\left(${args[0]}\\\\right)',\n    2: \"\\\\left(\\\\left(${args[0]}\\\\right)+\".concat(latexSymbols.i, \"\\\\cdot\\\\left(${args[1]}\\\\right)\\\\right)\")\n  },\n  matrix: {\n    0: '\\\\begin{bmatrix}\\\\end{bmatrix}',\n    1: '\\\\left(${args[0]}\\\\right)',\n    2: '\\\\left(${args[0]}\\\\right)'\n  },\n  sparse: {\n    0: '\\\\begin{bsparse}\\\\end{bsparse}',\n    1: '\\\\left(${args[0]}\\\\right)'\n  },\n  unit: {\n    1: '\\\\left(${args[0]}\\\\right)',\n    2: '\\\\left(\\\\left(${args[0]}\\\\right)${args[1]}\\\\right)'\n  }\n};\nexports.latexFunctions = latexFunctions;\nvar defaultTemplate = '\\\\mathrm{${name}}\\\\left(${args}\\\\right)';\nexports.defaultTemplate = defaultTemplate;\nvar latexUnits = {\n  deg: '^\\\\circ'\n};\nfunction escapeLatex(string) {\n  return (0, _escapeLatex[\"default\"])(string, {\n    preserveFormatting: true\n  });\n}\n\n// @param {string} name\n// @param {boolean} isUnit\nfunction toSymbol(name, isUnit) {\n  isUnit = typeof isUnit === 'undefined' ? false : isUnit;\n  if (isUnit) {\n    if ((0, _object.hasOwnProperty)(latexUnits, name)) {\n      return latexUnits[name];\n    }\n    return '\\\\mathrm{' + escapeLatex(name) + '}';\n  }\n  if ((0, _object.hasOwnProperty)(latexSymbols, name)) {\n    return latexSymbols[name];\n  }\n  return escapeLatex(name);\n}","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createConstantNode = void 0;\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\nvar _defineProperty2 = _interopRequireDefault(require(\"@babel/runtime/helpers/defineProperty\"));\nvar _string = require(\"../../utils/string.js\");\nvar _is = require(\"../../utils/is.js\");\nvar _latex = require(\"../../utils/latex.js\");\nvar _factory = require(\"../../utils/factory.js\");\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nvar name = 'ConstantNode';\nvar dependencies = ['Node'];\nvar createConstantNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var Node = _ref.Node;\n  var ConstantNode = /*#__PURE__*/function (_Node) {\n    (0, _inherits2[\"default\"])(ConstantNode, _Node);\n    var _super = _createSuper(ConstantNode);\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    function ConstantNode(value) {\n      var _this;\n      (0, _classCallCheck2[\"default\"])(this, ConstantNode);\n      _this = _super.call(this);\n      _this.value = value;\n      return _this;\n    }\n    (0, _createClass2[\"default\"])(ConstantNode, [{\n      key: \"type\",\n      get: function get() {\n        return name;\n      }\n    }, {\n      key: \"isConstantNode\",\n      get: function get() {\n        return true;\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      key: \"_compile\",\n      value: function _compile(math, argNames) {\n        var value = this.value;\n        return function evalConstantNode() {\n          return value;\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      key: \"forEach\",\n      value: function forEach(callback) {\n        // nothing to do, we don't have any children\n      }\n\n      /**\n       * Create a new ConstantNode with children produced by the given callback.\n       * Trivial because there are no children.\n       * @param {function(child: Node, path: string, parent: Node) : Node} callback\n       * @returns {ConstantNode} Returns a clone of the node\n       */\n    }, {\n      key: \"map\",\n      value: function map(callback) {\n        return this.clone();\n      }\n\n      /**\n       * Create a clone of this node, a shallow copy\n       * @return {ConstantNode}\n       */\n    }, {\n      key: \"clone\",\n      value: function clone() {\n        return new ConstantNode(this.value);\n      }\n\n      /**\n       * Get string representation\n       * @param {Object} options\n       * @return {string} str\n       */\n    }, {\n      key: \"_toString\",\n      value: function _toString(options) {\n        return (0, _string.format)(this.value, options);\n      }\n\n      /**\n       * Get HTML representation\n       * @param {Object} options\n       * @return {string} str\n       */\n    }, {\n      key: \"toHTML\",\n      value: function toHTML(options) {\n        var value = this._toString(options);\n        switch ((0, _is.typeOf)(this.value)) {\n          case 'number':\n          case 'BigNumber':\n          case 'Fraction':\n            return '<span class=\"math-number\">' + value + '</span>';\n          case 'string':\n            return '<span class=\"math-string\">' + value + '</span>';\n          case 'boolean':\n            return '<span class=\"math-boolean\">' + value + '</span>';\n          case 'null':\n            return '<span class=\"math-null-symbol\">' + value + '</span>';\n          case 'undefined':\n            return '<span class=\"math-undefined\">' + value + '</span>';\n          default:\n            return '<span class=\"math-symbol\">' + value + '</span>';\n        }\n      }\n\n      /**\n       * Get a JSON representation of the node\n       * @returns {Object}\n       */\n    }, {\n      key: \"toJSON\",\n      value: function toJSON() {\n        return {\n          mathjs: name,\n          value: this.value\n        };\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      key: \"_toTex\",\n      value:\n      /**\n       * Get LaTeX representation\n       * @param {Object} options\n       * @return {string} str\n       */\n      function _toTex(options) {\n        var value = this._toString(options);\n        switch ((0, _is.typeOf)(this.value)) {\n          case 'string':\n            return '\\\\mathtt{' + (0, _latex.escapeLatex)(value) + '}';\n          case 'number':\n          case 'BigNumber':\n            {\n              if (!isFinite(this.value)) {\n                return this.value.valueOf() < 0 ? '-\\\\infty' : '\\\\infty';\n              }\n              var index = value.toLowerCase().indexOf('e');\n              if (index !== -1) {\n                return value.substring(0, index) + '\\\\cdot10^{' + value.substring(index + 1) + '}';\n              }\n            }\n            return value;\n          case 'Fraction':\n            return this.value.toLatex();\n          default:\n            return value;\n        }\n      }\n    }], [{\n      key: \"fromJSON\",\n      value: function fromJSON(json) {\n        return new ConstantNode(json.value);\n      }\n    }]);\n    return ConstantNode;\n  }(Node);\n  (0, _defineProperty2[\"default\"])(ConstantNode, \"name\", name);\n  return ConstantNode;\n}, {\n  isClass: true,\n  isNode: true\n});\nexports.createConstantNode = createConstantNode;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createFunctionAssignmentNode = void 0;\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\nvar _defineProperty2 = _interopRequireDefault(require(\"@babel/runtime/helpers/defineProperty\"));\nvar _is = require(\"../../utils/is.js\");\nvar _keywords = require(\"../keywords.js\");\nvar _string = require(\"../../utils/string.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _latex = require(\"../../utils/latex.js\");\nvar _operators = require(\"../operators.js\");\nvar _factory = require(\"../../utils/factory.js\");\nfunction _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it[\"return\"] != null) it[\"return\"](); } finally { if (didErr) throw err; } } }; }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nvar name = 'FunctionAssignmentNode';\nvar dependencies = ['typed', 'Node'];\nvar createFunctionAssignmentNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    Node = _ref.Node;\n  /**\n   * Is parenthesis needed?\n   * @param {Node} node\n   * @param {Object} parenthesis\n   * @param {string} implicit\n   * @private\n   */\n  function needParenthesis(node, parenthesis, implicit) {\n    var precedence = (0, _operators.getPrecedence)(node, parenthesis, implicit);\n    var exprPrecedence = (0, _operators.getPrecedence)(node.expr, parenthesis, implicit);\n    return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;\n  }\n  var FunctionAssignmentNode = /*#__PURE__*/function (_Node) {\n    (0, _inherits2[\"default\"])(FunctionAssignmentNode, _Node);\n    var _super = _createSuper(FunctionAssignmentNode);\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    function FunctionAssignmentNode(name, params, expr) {\n      var _this;\n      (0, _classCallCheck2[\"default\"])(this, FunctionAssignmentNode);\n      _this = _super.call(this);\n      // validate input\n      if (typeof name !== 'string') {\n        throw new TypeError('String expected for parameter \"name\"');\n      }\n      if (!Array.isArray(params)) {\n        throw new TypeError('Array containing strings or objects expected for parameter \"params\"');\n      }\n      if (!(0, _is.isNode)(expr)) {\n        throw new TypeError('Node expected for parameter \"expr\"');\n      }\n      if (_keywords.keywords.has(name)) {\n        throw new Error('Illegal function name, \"' + name + '\" is a reserved keyword');\n      }\n      var paramNames = new Set();\n      var _iterator = _createForOfIteratorHelper(params),\n        _step;\n      try {\n        for (_iterator.s(); !(_step = _iterator.n()).done;) {\n          var param = _step.value;\n          var _name = typeof param === 'string' ? param : param.name;\n          if (paramNames.has(_name)) {\n            throw new Error(\"Duplicate parameter name \\\"\".concat(_name, \"\\\"\"));\n          } else {\n            paramNames.add(_name);\n          }\n        }\n      } catch (err) {\n        _iterator.e(err);\n      } finally {\n        _iterator.f();\n      }\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      return _this;\n    }\n    (0, _createClass2[\"default\"])(FunctionAssignmentNode, [{\n      key: \"type\",\n      get: function get() {\n        return name;\n      }\n    }, {\n      key: \"isFunctionAssignmentNode\",\n      get: function get() {\n        return true;\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      key: \"_compile\",\n      value: function _compile(math, argNames) {\n        var childArgNames = Object.create(argNames);\n        (0, _array.forEach)(this.params, function (param) {\n          childArgNames[param] = true;\n        });\n\n        // compile the function expression with the child args\n        var evalExpr = this.expr._compile(math, childArgNames);\n        var name = this.name;\n        var params = this.params;\n        var signature = (0, _array.join)(this.types, ',');\n        var syntax = name + '(' + (0, _array.join)(this.params, ', ') + ')';\n        return function evalFunctionAssignmentNode(scope, args, context) {\n          var signatures = {};\n          signatures[signature] = function () {\n            var childArgs = Object.create(args);\n            for (var i = 0; i < params.length; i++) {\n              childArgs[params[i]] = arguments[i];\n            }\n            return evalExpr(scope, childArgs, context);\n          };\n          var fn = typed(name, signatures);\n          fn.syntax = syntax;\n          scope.set(name, fn);\n          return fn;\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      key: \"forEach\",\n      value: function forEach(callback) {\n        callback(this.expr, 'expr', this);\n      }\n\n      /**\n       * Create a new FunctionAssignmentNode whose children are the results of\n       * calling the provided callback function for each child of the original\n       * 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      key: \"map\",\n      value: function map(callback) {\n        var expr = this._ifNode(callback(this.expr, 'expr', this));\n        return new FunctionAssignmentNode(this.name, this.params.slice(0), expr);\n      }\n\n      /**\n       * Create a clone of this node, a shallow copy\n       * @return {FunctionAssignmentNode}\n       */\n    }, {\n      key: \"clone\",\n      value: function clone() {\n        return new FunctionAssignmentNode(this.name, this.params.slice(0), this.expr);\n      }\n\n      /**\n       * get string representation\n       * @param {Object} options\n       * @return {string} str\n       */\n    }, {\n      key: \"_toString\",\n      value: function _toString(options) {\n        var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n        var expr = this.expr.toString(options);\n        if (needParenthesis(this, parenthesis, options && options.implicit)) {\n          expr = '(' + expr + ')';\n        }\n        return this.name + '(' + this.params.join(', ') + ') = ' + expr;\n      }\n\n      /**\n       * Get a JSON representation of the node\n       * @returns {Object}\n       */\n    }, {\n      key: \"toJSON\",\n      value: function toJSON() {\n        var types = this.types;\n        return {\n          mathjs: name,\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      /**\n       * Instantiate an FunctionAssignmentNode from its JSON representation\n       * @param {Object} json\n       *     An object structured like\n       *     ```\n       *     {\"mathjs\": \"FunctionAssignmentNode\",\n       *      name: ..., params: ..., expr: ...}\n       *     ```\n       *     where mathjs is optional\n       * @returns {FunctionAssignmentNode}\n       */\n    }, {\n      key: \"toHTML\",\n      value:\n      /**\n       * get HTML representation\n       * @param {Object} options\n       * @return {string} str\n       */\n      function toHTML(options) {\n        var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n        var params = [];\n        for (var i = 0; i < this.params.length; i++) {\n          params.push('<span class=\"math-symbol math-parameter\">' + (0, _string.escape)(this.params[i]) + '</span>');\n        }\n        var expr = this.expr.toHTML(options);\n        if (needParenthesis(this, parenthesis, options && options.implicit)) {\n          expr = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' + expr + '<span class=\"math-parenthesis math-round-parenthesis\">)</span>';\n        }\n        return '<span class=\"math-function\">' + (0, _string.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      /**\n       * get LaTeX representation\n       * @param {Object} options\n       * @return {string} str\n       */\n    }, {\n      key: \"_toTex\",\n      value: function _toTex(options) {\n        var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n        var expr = this.expr.toTex(options);\n        if (needParenthesis(this, parenthesis, options && options.implicit)) {\n          expr = \"\\\\left(\".concat(expr, \"\\\\right)\");\n        }\n        return '\\\\mathrm{' + this.name + '}\\\\left(' + this.params.map(_latex.toSymbol).join(',') + '\\\\right):=' + expr;\n      }\n    }], [{\n      key: \"fromJSON\",\n      value: function fromJSON(json) {\n        return new FunctionAssignmentNode(json.name, json.params, json.expr);\n      }\n    }]);\n    return FunctionAssignmentNode;\n  }(Node);\n  (0, _defineProperty2[\"default\"])(FunctionAssignmentNode, \"name\", name);\n  return FunctionAssignmentNode;\n}, {\n  isClass: true,\n  isNode: true\n});\nexports.createFunctionAssignmentNode = createFunctionAssignmentNode;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createIndexNode = void 0;\nvar _toConsumableArray2 = _interopRequireDefault(require(\"@babel/runtime/helpers/toConsumableArray\"));\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\nvar _defineProperty2 = _interopRequireDefault(require(\"@babel/runtime/helpers/defineProperty\"));\nvar _array = require(\"../../utils/array.js\");\nvar _customs = require(\"../../utils/customs.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _is = require(\"../../utils/is.js\");\nvar _string = require(\"../../utils/string.js\");\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nvar name = 'IndexNode';\nvar dependencies = ['Node', 'size'];\nvar createIndexNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var Node = _ref.Node,\n    size = _ref.size;\n  var IndexNode = /*#__PURE__*/function (_Node) {\n    (0, _inherits2[\"default\"])(IndexNode, _Node);\n    var _super = _createSuper(IndexNode);\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]\n     *     Optional property describing whether this index was written using dot\n     *     notation like `a.b`, or using bracket notation like `a[\"b\"]`\n     *     (which is the default). This property is used for string conversion.\n     */\n    function IndexNode(dimensions, dotNotation) {\n      var _this;\n      (0, _classCallCheck2[\"default\"])(this, IndexNode);\n      _this = _super.call(this);\n      _this.dimensions = dimensions;\n      _this.dotNotation = dotNotation || false;\n\n      // validate input\n      if (!Array.isArray(dimensions) || !dimensions.every(_is.isNode)) {\n        throw new TypeError('Array containing Nodes expected for parameter \"dimensions\"');\n      }\n      if (_this.dotNotation && !_this.isObjectProperty()) {\n        throw new Error('dotNotation only applicable for object properties');\n      }\n      return _this;\n    }\n    (0, _createClass2[\"default\"])(IndexNode, [{\n      key: \"type\",\n      get: function get() {\n        return name;\n      }\n    }, {\n      key: \"isIndexNode\",\n      get: function get() {\n        return true;\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      key: \"_compile\",\n      value: function _compile(math, argNames) {\n        // TODO: implement support for bignumber (currently bignumbers are silently\n        //       reduced to numbers when changing the value to zero-based)\n\n        // TODO: Optimization: when the range values are ConstantNodes,\n        //       we can beforehand resolve the zero-based value\n\n        // optimization for a simple object property\n        var evalDimensions = (0, _array.map)(this.dimensions, function (dimension, i) {\n          var needsEnd = dimension.filter(function (node) {\n            return node.isSymbolNode && node.name === 'end';\n          }).length > 0;\n          if (needsEnd) {\n            // SymbolNode 'end' is used inside the index,\n            // like in `A[end]` or `A[end - 2]`\n            var childArgNames = Object.create(argNames);\n            childArgNames.end = true;\n            var _evalDimension = dimension._compile(math, childArgNames);\n            return function evalDimension(scope, args, context) {\n              if (!(0, _is.isMatrix)(context) && !(0, _is.isArray)(context) && !(0, _is.isString)(context)) {\n                throw new TypeError('Cannot resolve \"end\": ' + 'context must be a Matrix, Array, or string but is ' + (0, _is.typeOf)(context));\n              }\n              var s = size(context).valueOf();\n              var childArgs = Object.create(args);\n              childArgs.end = s[i];\n              return _evalDimension(scope, childArgs, context);\n            };\n          } else {\n            // SymbolNode `end` not used\n            return dimension._compile(math, argNames);\n          }\n        });\n        var index = (0, _customs.getSafeProperty)(math, 'index');\n        return function evalIndexNode(scope, args, context) {\n          var dimensions = (0, _array.map)(evalDimensions, function (evalDimension) {\n            return evalDimension(scope, args, context);\n          });\n          return index.apply(void 0, (0, _toConsumableArray2[\"default\"])(dimensions));\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      key: \"forEach\",\n      value: function forEach(callback) {\n        for (var i = 0; i < this.dimensions.length; i++) {\n          callback(this.dimensions[i], 'dimensions[' + i + ']', this);\n        }\n      }\n\n      /**\n       * Create a new IndexNode whose children are the results of calling\n       * the provided callback function for each child 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      key: \"map\",\n      value: function map(callback) {\n        var dimensions = [];\n        for (var i = 0; i < this.dimensions.length; i++) {\n          dimensions[i] = this._ifNode(callback(this.dimensions[i], 'dimensions[' + i + ']', this));\n        }\n        return new IndexNode(dimensions, this.dotNotation);\n      }\n\n      /**\n       * Create a clone of this node, a shallow copy\n       * @return {IndexNode}\n       */\n    }, {\n      key: \"clone\",\n      value: function clone() {\n        return new IndexNode(this.dimensions.slice(0), this.dotNotation);\n      }\n\n      /**\n       * Test whether this IndexNode contains a single property name\n       * @return {boolean}\n       */\n    }, {\n      key: \"isObjectProperty\",\n      value: function isObjectProperty() {\n        return this.dimensions.length === 1 && (0, _is.isConstantNode)(this.dimensions[0]) && typeof this.dimensions[0].value === 'string';\n      }\n\n      /**\n       * Returns the property name if IndexNode contains a property.\n       * If not, returns null.\n       * @return {string | null}\n       */\n    }, {\n      key: \"getObjectProperty\",\n      value: function getObjectProperty() {\n        return this.isObjectProperty() ? this.dimensions[0].value : null;\n      }\n\n      /**\n       * Get string representation\n       * @param {Object} options\n       * @return {string} str\n       */\n    }, {\n      key: \"_toString\",\n      value: function _toString(options) {\n        // format the parameters like \"[1, 0:5]\"\n        return this.dotNotation ? '.' + this.getObjectProperty() : '[' + this.dimensions.join(', ') + ']';\n      }\n\n      /**\n       * Get a JSON representation of the node\n       * @returns {Object}\n       */\n    }, {\n      key: \"toJSON\",\n      value: function toJSON() {\n        return {\n          mathjs: name,\n          dimensions: this.dimensions,\n          dotNotation: this.dotNotation\n        };\n      }\n\n      /**\n       * Instantiate an IndexNode from its JSON representation\n       * @param {Object} json\n       *     An object structured like\n       *     `{\"mathjs\": \"IndexNode\", dimensions: [...], dotNotation: false}`,\n       *     where mathjs is optional\n       * @returns {IndexNode}\n       */\n    }, {\n      key: \"toHTML\",\n      value:\n      /**\n       * Get HTML representation\n       * @param {Object} options\n       * @return {string} str\n       */\n      function toHTML(options) {\n        // format the parameters like \"[1, 0:5]\"\n        var dimensions = [];\n        for (var i = 0; i < this.dimensions.length; i++) {\n          dimensions[i] = this.dimensions[i].toHTML();\n        }\n        if (this.dotNotation) {\n          return '<span class=\"math-operator math-accessor-operator\">.</span>' + '<span class=\"math-symbol math-property\">' + (0, _string.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      /**\n       * Get LaTeX representation\n       * @param {Object} options\n       * @return {string} str\n       */\n    }, {\n      key: \"_toTex\",\n      value: function _toTex(options) {\n        var dimensions = this.dimensions.map(function (range) {\n          return range.toTex(options);\n        });\n        return this.dotNotation ? '.' + this.getObjectProperty() + '' : '_{' + dimensions.join(',') + '}';\n      }\n    }], [{\n      key: \"fromJSON\",\n      value: function fromJSON(json) {\n        return new IndexNode(json.dimensions, json.dotNotation);\n      }\n    }]);\n    return IndexNode;\n  }(Node);\n  (0, _defineProperty2[\"default\"])(IndexNode, \"name\", name);\n  return IndexNode;\n}, {\n  isClass: true,\n  isNode: true\n});\nexports.createIndexNode = createIndexNode;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createObjectNode = void 0;\nvar _typeof2 = _interopRequireDefault(require(\"@babel/runtime/helpers/typeof\"));\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\nvar _defineProperty2 = _interopRequireDefault(require(\"@babel/runtime/helpers/defineProperty\"));\nvar _is = require(\"../../utils/is.js\");\nvar _string = require(\"../../utils/string.js\");\nvar _customs = require(\"../../utils/customs.js\");\nvar _object = require(\"../../utils/object.js\");\nvar _factory = require(\"../../utils/factory.js\");\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nvar name = 'ObjectNode';\nvar dependencies = ['Node'];\nvar createObjectNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var Node = _ref.Node;\n  var ObjectNode = /*#__PURE__*/function (_Node) {\n    (0, _inherits2[\"default\"])(ObjectNode, _Node);\n    var _super = _createSuper(ObjectNode);\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    function ObjectNode(properties) {\n      var _this;\n      (0, _classCallCheck2[\"default\"])(this, ObjectNode);\n      _this = _super.call(this);\n      _this.properties = properties || {};\n\n      // validate input\n      if (properties) {\n        if (!((0, _typeof2[\"default\"])(properties) === 'object') || !Object.keys(properties).every(function (key) {\n          return (0, _is.isNode)(properties[key]);\n        })) {\n          throw new TypeError('Object containing Nodes expected');\n        }\n      }\n      return _this;\n    }\n    (0, _createClass2[\"default\"])(ObjectNode, [{\n      key: \"type\",\n      get: function get() {\n        return name;\n      }\n    }, {\n      key: \"isObjectNode\",\n      get: function get() {\n        return true;\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      key: \"_compile\",\n      value: function _compile(math, argNames) {\n        var evalEntries = {};\n        for (var key in this.properties) {\n          if ((0, _object.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 = (0, _string.stringify)(key);\n            var parsedKey = JSON.parse(stringifiedKey);\n            if (!(0, _customs.isSafeProperty)(this.properties, parsedKey)) {\n              throw new Error('No access to property \"' + parsedKey + '\"');\n            }\n            evalEntries[parsedKey] = this.properties[key]._compile(math, argNames);\n          }\n        }\n        return function evalObjectNode(scope, args, context) {\n          var obj = {};\n          for (var _key in evalEntries) {\n            if ((0, _object.hasOwnProperty)(evalEntries, _key)) {\n              obj[_key] = evalEntries[_key](scope, args, context);\n            }\n          }\n          return obj;\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      key: \"forEach\",\n      value: function forEach(callback) {\n        for (var key in this.properties) {\n          if ((0, _object.hasOwnProperty)(this.properties, key)) {\n            callback(this.properties[key], 'properties[' + (0, _string.stringify)(key) + ']', this);\n          }\n        }\n      }\n\n      /**\n       * Create a new ObjectNode whose children are the results of calling\n       * the provided callback function for each child 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      key: \"map\",\n      value: function map(callback) {\n        var properties = {};\n        for (var key in this.properties) {\n          if ((0, _object.hasOwnProperty)(this.properties, key)) {\n            properties[key] = this._ifNode(callback(this.properties[key], 'properties[' + (0, _string.stringify)(key) + ']', this));\n          }\n        }\n        return new ObjectNode(properties);\n      }\n\n      /**\n       * Create a clone of this node, a shallow copy\n       * @return {ObjectNode}\n       */\n    }, {\n      key: \"clone\",\n      value: function clone() {\n        var properties = {};\n        for (var key in this.properties) {\n          if ((0, _object.hasOwnProperty)(this.properties, key)) {\n            properties[key] = this.properties[key];\n          }\n        }\n        return new ObjectNode(properties);\n      }\n\n      /**\n       * Get string representation\n       * @param {Object} options\n       * @return {string} str\n       * @override\n       */\n    }, {\n      key: \"_toString\",\n      value: function _toString(options) {\n        var entries = [];\n        for (var key in this.properties) {\n          if ((0, _object.hasOwnProperty)(this.properties, key)) {\n            entries.push((0, _string.stringify)(key) + ': ' + this.properties[key].toString(options));\n          }\n        }\n        return '{' + entries.join(', ') + '}';\n      }\n\n      /**\n       * Get a JSON representation of the node\n       * @returns {Object}\n       */\n    }, {\n      key: \"toJSON\",\n      value: function toJSON() {\n        return {\n          mathjs: name,\n          properties: this.properties\n        };\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      key: \"toHTML\",\n      value:\n      /**\n       * Get HTML representation\n       * @param {Object} options\n       * @return {string} str\n       * @override\n       */\n      function toHTML(options) {\n        var entries = [];\n        for (var key in this.properties) {\n          if ((0, _object.hasOwnProperty)(this.properties, key)) {\n            entries.push('<span class=\"math-symbol math-property\">' + (0, _string.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        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      /**\n       * Get LaTeX representation\n       * @param {Object} options\n       * @return {string} str\n       */\n    }, {\n      key: \"_toTex\",\n      value: function _toTex(options) {\n        var entries = [];\n        for (var key in this.properties) {\n          if ((0, _object.hasOwnProperty)(this.properties, key)) {\n            entries.push('\\\\mathbf{' + key + ':} & ' + this.properties[key].toTex(options) + '\\\\\\\\');\n          }\n        }\n        var tex = '\\\\left\\\\{\\\\begin{array}{ll}' + entries.join('\\n') + '\\\\end{array}\\\\right\\\\}';\n        return tex;\n      }\n    }], [{\n      key: \"fromJSON\",\n      value: function fromJSON(json) {\n        return new ObjectNode(json.properties);\n      }\n    }]);\n    return ObjectNode;\n  }(Node);\n  (0, _defineProperty2[\"default\"])(ObjectNode, \"name\", name);\n  return ObjectNode;\n}, {\n  isClass: true,\n  isNode: true\n});\nexports.createObjectNode = createObjectNode;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createOperatorNode = void 0;\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\nvar _defineProperty2 = _interopRequireDefault(require(\"@babel/runtime/helpers/defineProperty\"));\nvar _is = require(\"../../utils/is.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _string = require(\"../../utils/string.js\");\nvar _customs = require(\"../../utils/customs.js\");\nvar _operators = require(\"../operators.js\");\nvar _latex = require(\"../../utils/latex.js\");\nvar _factory = require(\"../../utils/factory.js\");\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nvar name = 'OperatorNode';\nvar dependencies = ['Node'];\nvar createOperatorNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var Node = _ref.Node;\n  /**\n   * Returns true if the expression starts with a constant, under\n   * the current parenthesization:\n   * @param {Node} expression\n   * @param {string} parenthesis\n   * @return {boolean}\n   */\n  function startsWithConstant(expr, parenthesis) {\n    var curNode = expr;\n    if (parenthesis === 'auto') {\n      while ((0, _is.isParenthesisNode)(curNode)) {\n        curNode = curNode.content;\n      }\n    }\n    if ((0, _is.isConstantNode)(curNode)) return true;\n    if ((0, _is.isOperatorNode)(curNode)) {\n      return startsWithConstant(curNode.args[0], parenthesis);\n    }\n    return false;\n  }\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  function calculateNecessaryParentheses(root, parenthesis, implicit, args, latex) {\n    // precedence of the root OperatorNode\n    var precedence = (0, _operators.getPrecedence)(root, parenthesis, implicit);\n    var associativity = (0, _operators.getAssociativity)(root, parenthesis);\n    if (parenthesis === 'all' || args.length > 2 && root.getIdentifier() !== 'OperatorNode:add' && root.getIdentifier() !== 'OperatorNode:multiply') {\n      return 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          default:\n            return true;\n        }\n      });\n    }\n    var result;\n    switch (args.length) {\n      case 0:\n        result = [];\n        break;\n      case 1:\n        // unary operators\n        {\n          // precedence of the operand\n          var operandPrecedence = (0, _operators.getPrecedence)(args[0], parenthesis, implicit, root);\n\n          // handle special cases for LaTeX, where some of the parentheses aren't needed\n          if (latex && operandPrecedence !== null) {\n            var operandIdentifier;\n            var rootIdentifier;\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            if (_operators.properties[precedence][rootIdentifier].latexLeftParens === false) {\n              result = [false];\n              break;\n            }\n            if (_operators.properties[operandPrecedence][operandIdentifier].latexParens === false) {\n              result = [false];\n              break;\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          if (operandPrecedence <= precedence) {\n            // if the operands precedence is lower, parens are needed\n            result = [true];\n            break;\n          }\n\n          // otherwise, no parens needed\n          result = [false];\n        }\n        break;\n      case 2:\n        // binary operators\n        {\n          var lhsParens; // left hand side needs parenthesis?\n          // precedence of the left hand side\n          var lhsPrecedence = (0, _operators.getPrecedence)(args[0], parenthesis, implicit, root);\n          // is the root node associative with the left hand side\n          var assocWithLhs = (0, _operators.isAssociativeWith)(root, args[0], parenthesis);\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          var rhsParens; // right hand side needs parenthesis?\n          // precedence of the right hand side\n          var rhsPrecedence = (0, _operators.getPrecedence)(args[1], parenthesis, implicit, root);\n          // is the root node associative with the right hand side?\n          var assocWithRhs = (0, _operators.isAssociativeWith)(root, args[1], parenthesis);\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          }\n\n          // handle special cases for LaTeX, where some of the parentheses aren't needed\n          if (latex) {\n            var _rootIdentifier;\n            var lhsIdentifier;\n            var rhsIdentifier;\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            if (lhsPrecedence !== null) {\n              if (_operators.properties[precedence][_rootIdentifier].latexLeftParens === false) {\n                lhsParens = false;\n              }\n              if (_operators.properties[lhsPrecedence][lhsIdentifier].latexParens === false) {\n                lhsParens = false;\n              }\n            }\n            if (rhsPrecedence !== null) {\n              if (_operators.properties[precedence][_rootIdentifier].latexRightParens === false) {\n                rhsParens = false;\n              }\n              if (_operators.properties[rhsPrecedence][rhsIdentifier].latexParens === false) {\n                rhsParens = false;\n              }\n            }\n          }\n          result = [lhsParens, rhsParens];\n        }\n        break;\n      default:\n        if (root.getIdentifier() === 'OperatorNode:add' || root.getIdentifier() === 'OperatorNode:multiply') {\n          result = args.map(function (arg) {\n            var argPrecedence = (0, _operators.getPrecedence)(arg, parenthesis, implicit, root);\n            var assocWithArg = (0, _operators.isAssociativeWith)(root, arg, parenthesis);\n            var argAssociativity = (0, _operators.getAssociativity)(arg, parenthesis);\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            return false;\n          });\n        }\n        break;\n    }\n\n    // Handles an edge case of parentheses with implicit multiplication\n    // of ConstantNode.\n    // In that case, parenthesize ConstantNodes that follow an unparenthesized\n    // expression, even though they normally wouldn't be printed.\n    if (args.length >= 2 && root.getIdentifier() === 'OperatorNode:multiply' && root.implicit && parenthesis !== 'all' && implicit === 'hide') {\n      for (var i = 1; i < result.length; ++i) {\n        if (startsWithConstant(args[i], parenthesis) && !result[i - 1] && (parenthesis !== 'keep' || !(0, _is.isParenthesisNode)(args[i - 1]))) {\n          result[i] = true;\n        }\n      }\n    }\n    return result;\n  }\n  var OperatorNode = /*#__PURE__*/function (_Node) {\n    (0, _inherits2[\"default\"])(OperatorNode, _Node);\n    var _super = _createSuper(OperatorNode);\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     * @param {boolean} [isPercentage] Is this an percentage Operation?\n     */\n    function OperatorNode(op, fn, args, implicit, isPercentage) {\n      var _this;\n      (0, _classCallCheck2[\"default\"])(this, OperatorNode);\n      _this = _super.call(this);\n      // validate input\n      if (typeof op !== 'string') {\n        throw new TypeError('string expected for parameter \"op\"');\n      }\n      if (typeof fn !== 'string') {\n        throw new TypeError('string expected for parameter \"fn\"');\n      }\n      if (!Array.isArray(args) || !args.every(_is.isNode)) {\n        throw new TypeError('Array containing Nodes expected for parameter \"args\"');\n      }\n      _this.implicit = implicit === true;\n      _this.isPercentage = isPercentage === true;\n      _this.op = op;\n      _this.fn = fn;\n      _this.args = args || [];\n      return _this;\n    }\n    (0, _createClass2[\"default\"])(OperatorNode, [{\n      key: \"type\",\n      get: function get() {\n        return name;\n      }\n    }, {\n      key: \"isOperatorNode\",\n      get: function get() {\n        return true;\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      key: \"_compile\",\n      value: function _compile(math, argNames) {\n        // validate fn\n        if (typeof this.fn !== 'string' || !(0, _customs.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        var fn = (0, _customs.getSafeProperty)(math, this.fn);\n        var evalArgs = (0, _array.map)(this.args, function (arg) {\n          return arg._compile(math, argNames);\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, (0, _array.map)(evalArgs, function (evalArg) {\n              return evalArg(scope, args, context);\n            }));\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      key: \"forEach\",\n      value: function forEach(callback) {\n        for (var i = 0; i < this.args.length; i++) {\n          callback(this.args[i], 'args[' + i + ']', this);\n        }\n      }\n\n      /**\n       * Create a new OperatorNode whose children are the results of calling\n       * the provided callback function for each child 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      key: \"map\",\n      value: function map(callback) {\n        var args = [];\n        for (var i = 0; i < this.args.length; i++) {\n          args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this));\n        }\n        return new OperatorNode(this.op, this.fn, args, this.implicit, this.isPercentage);\n      }\n\n      /**\n       * Create a clone of this node, a shallow copy\n       * @return {OperatorNode}\n       */\n    }, {\n      key: \"clone\",\n      value: function clone() {\n        return new OperatorNode(this.op, this.fn, this.args.slice(0), this.implicit, this.isPercentage);\n      }\n\n      /**\n       * Check whether this is an unary OperatorNode:\n       * has exactly one argument, like `-a`.\n       * @return {boolean}\n       *     Returns true when an unary operator node, false otherwise.\n       */\n    }, {\n      key: \"isUnary\",\n      value: function isUnary() {\n        return this.args.length === 1;\n      }\n\n      /**\n       * Check whether this is a binary OperatorNode:\n       * has exactly two arguments, like `a + b`.\n       * @return {boolean}\n       *     Returns true when a binary operator node, false otherwise.\n       */\n    }, {\n      key: \"isBinary\",\n      value: function isBinary() {\n        return this.args.length === 2;\n      }\n\n      /**\n       * Get string representation.\n       * @param {Object} options\n       * @return {string} str\n       */\n    }, {\n      key: \"_toString\",\n      value: function _toString(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        if (args.length === 1) {\n          // unary operators\n          var assoc = (0, _operators.getAssociativity)(this, parenthesis);\n          var operand = args[0].toString(options);\n          if (parens[0]) {\n            operand = '(' + operand + ')';\n          }\n\n          // for example for \"not\", we want a space between operand and argument\n          var opIsNamed = /[a-zA-Z]+/.test(this.op);\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          }\n\n          // fall back to postfix\n          return operand + this.op;\n        } else if (args.length === 2) {\n          var lhs = args[0].toString(options); // left hand side\n          var rhs = args[1].toString(options); // right hand side\n          if (parens[0]) {\n            // left hand side in parenthesis?\n            lhs = '(' + lhs + ')';\n          }\n          if (parens[1]) {\n            // right hand side in parenthesis?\n            rhs = '(' + rhs + ')';\n          }\n          if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {\n            return lhs + ' ' + rhs;\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            if (parens[index]) {\n              // put in parenthesis?\n              arg = '(' + arg + ')';\n            }\n            return arg;\n          });\n          if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {\n            return stringifiedArgs.join(' ');\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      /**\n       * Get a JSON representation of the node\n       * @returns {Object}\n       */\n    }, {\n      key: \"toJSON\",\n      value: function toJSON() {\n        return {\n          mathjs: name,\n          op: this.op,\n          fn: this.fn,\n          args: this.args,\n          implicit: this.implicit,\n          isPercentage: this.isPercentage\n        };\n      }\n\n      /**\n       * Instantiate an OperatorNode from its JSON representation\n       * @param {Object} json\n       *     An object structured like\n       *     ```\n       *     {\"mathjs\": \"OperatorNode\",\n       *      \"op\": \"+\", \"fn\": \"add\", \"args\": [...],\n       *      \"implicit\": false,\n       *      \"isPercentage\":false}\n       *     ```\n       *     where mathjs is optional\n       * @returns {OperatorNode}\n       */\n    }, {\n      key: \"toHTML\",\n      value:\n      /**\n       * Get HTML representation.\n       * @param {Object} options\n       * @return {string} str\n       */\n      function toHTML(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        if (args.length === 1) {\n          // unary operators\n          var assoc = (0, _operators.getAssociativity)(this, parenthesis);\n          var operand = args[0].toHTML(options);\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          if (assoc === 'right') {\n            // prefix operator\n            return '<span class=\"math-operator math-unary-operator ' + 'math-lefthand-unary-operator\">' + (0, _string.escape)(this.op) + '</span>' + operand;\n          } else {\n            // postfix when assoc === 'left' or undefined\n            return operand + '<span class=\"math-operator math-unary-operator ' + 'math-righthand-unary-operator\">' + (0, _string.escape)(this.op) + '</span>';\n          }\n        } else if (args.length === 2) {\n          // binary operatoes\n          var lhs = args[0].toHTML(options); // left hand side\n          var rhs = args[1].toHTML(options); // right hand side\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          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          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          return lhs + '<span class=\"math-operator math-binary-operator ' + 'math-explicit-binary-operator\">' + (0, _string.escape)(this.op) + '</span>' + rhs;\n        } else {\n          var stringifiedArgs = args.map(function (arg, index) {\n            arg = arg.toHTML(options);\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            return arg;\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            return stringifiedArgs.join('<span class=\"math-operator math-binary-operator ' + 'math-explicit-binary-operator\">' + (0, _string.escape)(this.op) + '</span>');\n          } else {\n            // fallback to formatting as a function call\n            return '<span class=\"math-function\">' + (0, _string.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      /**\n       * Get LaTeX representation\n       * @param {Object} options\n       * @return {string} str\n       */\n    }, {\n      key: \"_toTex\",\n      value: function _toTex(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.latexOperators[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 = (0, _operators.getAssociativity)(this, parenthesis);\n          var operand = args[0].toTex(options);\n          if (parens[0]) {\n            operand = \"\\\\left(\".concat(operand, \"\\\\right)\");\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          }\n\n          // fall back to postfix\n          return operand + op;\n        } else if (args.length === 2) {\n          // binary operators\n          var lhs = args[0]; // left hand side\n          var lhsTex = lhs.toTex(options);\n          if (parens[0]) {\n            lhsTex = \"\\\\left(\".concat(lhsTex, \"\\\\right)\");\n          }\n          var rhs = args[1]; // right hand side\n          var rhsTex = rhs.toTex(options);\n          if (parens[1]) {\n            rhsTex = \"\\\\left(\".concat(rhsTex, \"\\\\right)\");\n          }\n\n          // handle some exceptions (due to the way LaTeX works)\n          var lhsIdentifier;\n          if (parenthesis === 'keep') {\n            lhsIdentifier = lhs.getIdentifier();\n          } else {\n            // Ignore ParenthesisNodes if in 'keep' mode\n            lhsIdentifier = lhs.getContent().getIdentifier();\n          }\n          switch (this.getIdentifier()) {\n            case 'OperatorNode:divide':\n              // op contains '\\\\frac' at this point\n              return op + '{' + lhsTex + '}' + '{' + rhsTex + '}';\n            case 'OperatorNode:pow':\n              lhsTex = '{' + lhsTex + '}';\n              rhsTex = '{' + rhsTex + '}';\n              switch (lhsIdentifier) {\n                case 'ConditionalNode': //\n                case 'OperatorNode:divide':\n                  lhsTex = \"\\\\left(\".concat(lhsTex, \"\\\\right)\");\n              }\n              break;\n            case 'OperatorNode:multiply':\n              if (this.implicit && implicit === 'hide') {\n                return lhsTex + '~' + rhsTex;\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            if (parens[index]) {\n              arg = \"\\\\left(\".concat(arg, \"\\\\right)\");\n            }\n            return arg;\n          });\n          if (this.getIdentifier() === 'OperatorNode:multiply' && this.implicit && implicit === 'hide') {\n            return texifiedArgs.join('~');\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      /**\n       * Get identifier.\n       * @return {string}\n       */\n    }, {\n      key: \"getIdentifier\",\n      value: function getIdentifier() {\n        return this.type + ':' + this.fn;\n      }\n    }], [{\n      key: \"fromJSON\",\n      value: function fromJSON(json) {\n        return new OperatorNode(json.op, json.fn, json.args, json.implicit, json.isPercentage);\n      }\n    }]);\n    return OperatorNode;\n  }(Node);\n  (0, _defineProperty2[\"default\"])(OperatorNode, \"name\", name);\n  return OperatorNode;\n}, {\n  isClass: true,\n  isNode: true\n});\nexports.createOperatorNode = createOperatorNode;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createParenthesisNode = void 0;\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\nvar _defineProperty2 = _interopRequireDefault(require(\"@babel/runtime/helpers/defineProperty\"));\nvar _is = require(\"../../utils/is.js\");\nvar _factory = require(\"../../utils/factory.js\");\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nvar name = 'ParenthesisNode';\nvar dependencies = ['Node'];\nvar createParenthesisNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var Node = _ref.Node;\n  var ParenthesisNode = /*#__PURE__*/function (_Node) {\n    (0, _inherits2[\"default\"])(ParenthesisNode, _Node);\n    var _super = _createSuper(ParenthesisNode);\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    function ParenthesisNode(content) {\n      var _this;\n      (0, _classCallCheck2[\"default\"])(this, ParenthesisNode);\n      _this = _super.call(this);\n      // validate input\n      if (!(0, _is.isNode)(content)) {\n        throw new TypeError('Node expected for parameter \"content\"');\n      }\n      _this.content = content;\n      return _this;\n    }\n    (0, _createClass2[\"default\"])(ParenthesisNode, [{\n      key: \"type\",\n      get: function get() {\n        return name;\n      }\n    }, {\n      key: \"isParenthesisNode\",\n      get: function get() {\n        return true;\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      key: \"_compile\",\n      value: function _compile(math, argNames) {\n        return this.content._compile(math, argNames);\n      }\n\n      /**\n       * Get the content of the current Node.\n       * @return {Node} content\n       * @override\n       **/\n    }, {\n      key: \"getContent\",\n      value: function getContent() {\n        return this.content.getContent();\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      key: \"forEach\",\n      value: function forEach(callback) {\n        callback(this.content, 'content', this);\n      }\n\n      /**\n       * Create a new ParenthesisNode whose child is the result of calling\n       * the provided callback function on the child of this node.\n       * @param {function(child: Node, path: string, parent: Node) : Node} callback\n       * @returns {ParenthesisNode} Returns a clone of the node\n       */\n    }, {\n      key: \"map\",\n      value: function map(callback) {\n        var content = callback(this.content, 'content', this);\n        return new ParenthesisNode(content);\n      }\n\n      /**\n       * Create a clone of this node, a shallow copy\n       * @return {ParenthesisNode}\n       */\n    }, {\n      key: \"clone\",\n      value: function clone() {\n        return new ParenthesisNode(this.content);\n      }\n\n      /**\n       * Get string representation\n       * @param {Object} options\n       * @return {string} str\n       * @override\n       */\n    }, {\n      key: \"_toString\",\n      value: function _toString(options) {\n        if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {\n          return '(' + this.content.toString(options) + ')';\n        }\n        return this.content.toString(options);\n      }\n\n      /**\n       * Get a JSON representation of the node\n       * @returns {Object}\n       */\n    }, {\n      key: \"toJSON\",\n      value: function toJSON() {\n        return {\n          mathjs: name,\n          content: this.content\n        };\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      key: \"toHTML\",\n      value:\n      /**\n       * Get HTML representation\n       * @param {Object} options\n       * @return {string} str\n       * @override\n       */\n      function toHTML(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        return this.content.toHTML(options);\n      }\n\n      /**\n       * Get LaTeX representation\n       * @param {Object} options\n       * @return {string} str\n       * @override\n       */\n    }, {\n      key: \"_toTex\",\n      value: function _toTex(options) {\n        if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {\n          return \"\\\\left(\".concat(this.content.toTex(options), \"\\\\right)\");\n        }\n        return this.content.toTex(options);\n      }\n    }], [{\n      key: \"fromJSON\",\n      value: function fromJSON(json) {\n        return new ParenthesisNode(json.content);\n      }\n    }]);\n    return ParenthesisNode;\n  }(Node);\n  (0, _defineProperty2[\"default\"])(ParenthesisNode, \"name\", name);\n  return ParenthesisNode;\n}, {\n  isClass: true,\n  isNode: true\n});\nexports.createParenthesisNode = createParenthesisNode;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createRangeNode = void 0;\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\nvar _defineProperty2 = _interopRequireDefault(require(\"@babel/runtime/helpers/defineProperty\"));\nvar _is = require(\"../../utils/is.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _operators = require(\"../operators.js\");\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nvar name = 'RangeNode';\nvar dependencies = ['Node'];\nvar createRangeNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var Node = _ref.Node;\n  /**\n   * Calculate the necessary parentheses\n   * @param {Node} node\n   * @param {string} parenthesis\n   * @param {string} implicit\n   * @return {Object} parentheses\n   * @private\n   */\n  function calculateNecessaryParentheses(node, parenthesis, implicit) {\n    var precedence = (0, _operators.getPrecedence)(node, parenthesis, implicit);\n    var parens = {};\n    var startPrecedence = (0, _operators.getPrecedence)(node.start, parenthesis, implicit);\n    parens.start = startPrecedence !== null && startPrecedence <= precedence || parenthesis === 'all';\n    if (node.step) {\n      var stepPrecedence = (0, _operators.getPrecedence)(node.step, parenthesis, implicit);\n      parens.step = stepPrecedence !== null && stepPrecedence <= precedence || parenthesis === 'all';\n    }\n    var endPrecedence = (0, _operators.getPrecedence)(node.end, parenthesis, implicit);\n    parens.end = endPrecedence !== null && endPrecedence <= precedence || parenthesis === 'all';\n    return parens;\n  }\n  var RangeNode = /*#__PURE__*/function (_Node) {\n    (0, _inherits2[\"default\"])(RangeNode, _Node);\n    var _super = _createSuper(RangeNode);\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    function RangeNode(start, end, step) {\n      var _this;\n      (0, _classCallCheck2[\"default\"])(this, RangeNode);\n      _this = _super.call(this);\n      // validate inputs\n      if (!(0, _is.isNode)(start)) throw new TypeError('Node expected');\n      if (!(0, _is.isNode)(end)) throw new TypeError('Node expected');\n      if (step && !(0, _is.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      _this.end = end; // included upper-bound\n      _this.step = step || null; // optional step\n      return _this;\n    }\n    (0, _createClass2[\"default\"])(RangeNode, [{\n      key: \"type\",\n      get: function get() {\n        return name;\n      }\n    }, {\n      key: \"isRangeNode\",\n      get: function get() {\n        return true;\n      }\n\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      key: \"needsEnd\",\n      value: function needsEnd() {\n        // find all `end` symbols in this RangeNode\n        var endSymbols = this.filter(function (node) {\n          return (0, _is.isSymbolNode)(node) && node.name === 'end';\n        });\n        return endSymbols.length > 0;\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      key: \"_compile\",\n      value: function _compile(math, argNames) {\n        var range = math.range;\n        var evalStart = this.start._compile(math, argNames);\n        var evalEnd = this.end._compile(math, argNames);\n        if (this.step) {\n          var evalStep = this.step._compile(math, argNames);\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      /**\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      key: \"forEach\",\n      value: function forEach(callback) {\n        callback(this.start, 'start', this);\n        callback(this.end, 'end', this);\n        if (this.step) {\n          callback(this.step, 'step', this);\n        }\n      }\n\n      /**\n       * Create a new RangeNode whose children are the results of calling\n       * the provided callback function for each child 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      key: \"map\",\n      value: function map(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      /**\n       * Create a clone of this node, a shallow copy\n       * @return {RangeNode}\n       */\n    }, {\n      key: \"clone\",\n      value: function clone() {\n        return new RangeNode(this.start, this.end, this.step && this.step);\n      }\n\n      /**\n       * Get string representation\n       * @param {Object} options\n       * @return {string} str\n       */\n    }, {\n      key: \"_toString\",\n      value: function _toString(options) {\n        var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n        var parens = calculateNecessaryParentheses(this, parenthesis, options && options.implicit);\n\n        // format string as start:step:stop\n        var str;\n        var start = this.start.toString(options);\n        if (parens.start) {\n          start = '(' + start + ')';\n        }\n        str = start;\n        if (this.step) {\n          var step = this.step.toString(options);\n          if (parens.step) {\n            step = '(' + step + ')';\n          }\n          str += ':' + step;\n        }\n        var end = this.end.toString(options);\n        if (parens.end) {\n          end = '(' + end + ')';\n        }\n        str += ':' + end;\n        return str;\n      }\n\n      /**\n       * Get a JSON representation of the node\n       * @returns {Object}\n       */\n    }, {\n      key: \"toJSON\",\n      value: function toJSON() {\n        return {\n          mathjs: name,\n          start: this.start,\n          end: this.end,\n          step: this.step\n        };\n      }\n\n      /**\n       * Instantiate an RangeNode from its JSON representation\n       * @param {Object} json\n       *     An object structured like\n       *     `{\"mathjs\": \"RangeNode\", \"start\": ..., \"end\": ..., \"step\": ...}`,\n       *     where mathjs is optional\n       * @returns {RangeNode}\n       */\n    }, {\n      key: \"toHTML\",\n      value:\n      /**\n       * Get HTML representation\n       * @param {Object} options\n       * @return {string} str\n       */\n      function toHTML(options) {\n        var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n        var parens = calculateNecessaryParentheses(this, parenthesis, options && options.implicit);\n\n        // format string as start:step:stop\n        var str;\n        var start = this.start.toHTML(options);\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        str = start;\n        if (this.step) {\n          var step = this.step.toHTML(options);\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          str += '<span class=\"math-operator math-range-operator\">:</span>' + step;\n        }\n        var end = this.end.toHTML(options);\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        str += '<span class=\"math-operator math-range-operator\">:</span>' + end;\n        return str;\n      }\n\n      /**\n       * Get LaTeX representation\n       * @params {Object} options\n       * @return {string} str\n       */\n    }, {\n      key: \"_toTex\",\n      value: function _toTex(options) {\n        var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n        var parens = calculateNecessaryParentheses(this, parenthesis, options && options.implicit);\n        var str = this.start.toTex(options);\n        if (parens.start) {\n          str = \"\\\\left(\".concat(str, \"\\\\right)\");\n        }\n        if (this.step) {\n          var step = this.step.toTex(options);\n          if (parens.step) {\n            step = \"\\\\left(\".concat(step, \"\\\\right)\");\n          }\n          str += ':' + step;\n        }\n        var end = this.end.toTex(options);\n        if (parens.end) {\n          end = \"\\\\left(\".concat(end, \"\\\\right)\");\n        }\n        str += ':' + end;\n        return str;\n      }\n    }], [{\n      key: \"fromJSON\",\n      value: function fromJSON(json) {\n        return new RangeNode(json.start, json.end, json.step);\n      }\n    }]);\n    return RangeNode;\n  }(Node);\n  (0, _defineProperty2[\"default\"])(RangeNode, \"name\", name);\n  return RangeNode;\n}, {\n  isClass: true,\n  isNode: true\n});\nexports.createRangeNode = createRangeNode;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createRelationalNode = void 0;\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\nvar _defineProperty2 = _interopRequireDefault(require(\"@babel/runtime/helpers/defineProperty\"));\nvar _operators = require(\"../operators.js\");\nvar _string = require(\"../../utils/string.js\");\nvar _customs = require(\"../../utils/customs.js\");\nvar _latex = require(\"../../utils/latex.js\");\nvar _factory = require(\"../../utils/factory.js\");\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nvar name = 'RelationalNode';\nvar dependencies = ['Node'];\nvar createRelationalNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var Node = _ref.Node;\n  var operatorMap = {\n    equal: '==',\n    unequal: '!=',\n    smaller: '<',\n    larger: '>',\n    smallerEq: '<=',\n    largerEq: '>='\n  };\n  var RelationalNode = /*#__PURE__*/function (_Node) {\n    (0, _inherits2[\"default\"])(RelationalNode, _Node);\n    var _super = _createSuper(RelationalNode);\n    /**\n     * A node representing a chained conditional expression, such as 'x > y > z'\n     *\n     * @param {String[]} conditionals\n     *     An array of conditional operators used to compare the parameters\n     * @param {Node[]} params\n     *     The parameters that will be compared\n     *\n     * @constructor RelationalNode\n     * @extends {Node}\n     */\n    function RelationalNode(conditionals, params) {\n      var _this;\n      (0, _classCallCheck2[\"default\"])(this, RelationalNode);\n      _this = _super.call(this);\n      if (!Array.isArray(conditionals)) {\n        throw new TypeError('Parameter conditionals must be an array');\n      }\n      if (!Array.isArray(params)) {\n        throw new TypeError('Parameter params must be an array');\n      }\n      if (conditionals.length !== params.length - 1) {\n        throw new TypeError('Parameter params must contain exactly one more element ' + 'than parameter conditionals');\n      }\n      _this.conditionals = conditionals;\n      _this.params = params;\n      return _this;\n    }\n    (0, _createClass2[\"default\"])(RelationalNode, [{\n      key: \"type\",\n      get: function get() {\n        return name;\n      }\n    }, {\n      key: \"isRelationalNode\",\n      get: function get() {\n        return true;\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      key: \"_compile\",\n      value: function _compile(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          for (var i = 0; i < self.conditionals.length; i++) {\n            evalLhs = evalRhs;\n            evalRhs = compiled[i + 1](scope, args, context);\n            var condFn = (0, _customs.getSafeProperty)(math, self.conditionals[i]);\n            if (!condFn(evalLhs, evalRhs)) {\n              return false;\n            }\n          }\n          return true;\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      key: \"forEach\",\n      value: function forEach(callback) {\n        var _this2 = this;\n        this.params.forEach(function (n, i) {\n          return callback(n, 'params[' + i + ']', _this2);\n        }, this);\n      }\n\n      /**\n       * Create a new RelationalNode whose children are the results of calling\n       * the provided callback function for each child 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      key: \"map\",\n      value: function map(callback) {\n        var _this3 = this;\n        return new RelationalNode(this.conditionals.slice(), this.params.map(function (n, i) {\n          return _this3._ifNode(callback(n, 'params[' + i + ']', _this3));\n        }, this));\n      }\n\n      /**\n       * Create a clone of this node, a shallow copy\n       * @return {RelationalNode}\n       */\n    }, {\n      key: \"clone\",\n      value: function clone() {\n        return new RelationalNode(this.conditionals, this.params);\n      }\n\n      /**\n       * Get string representation.\n       * @param {Object} options\n       * @return {string} str\n       */\n    }, {\n      key: \"_toString\",\n      value: function _toString(options) {\n        var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n        var precedence = (0, _operators.getPrecedence)(this, parenthesis, options && options.implicit);\n        var paramStrings = this.params.map(function (p, index) {\n          var paramPrecedence = (0, _operators.getPrecedence)(p, parenthesis, options && options.implicit);\n          return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '(' + p.toString(options) + ')' : p.toString(options);\n        });\n        var ret = paramStrings[0];\n        for (var i = 0; i < this.conditionals.length; i++) {\n          ret += ' ' + operatorMap[this.conditionals[i]];\n          ret += ' ' + paramStrings[i + 1];\n        }\n        return ret;\n      }\n\n      /**\n       * Get a JSON representation of the node\n       * @returns {Object}\n       */\n    }, {\n      key: \"toJSON\",\n      value: function toJSON() {\n        return {\n          mathjs: name,\n          conditionals: this.conditionals,\n          params: this.params\n        };\n      }\n\n      /**\n       * Instantiate a RelationalNode from its JSON representation\n       * @param {Object} json\n       *     An object structured like\n       *     `{\"mathjs\": \"RelationalNode\", \"conditionals\": ..., \"params\": ...}`,\n       *     where mathjs is optional\n       * @returns {RelationalNode}\n       */\n    }, {\n      key: \"toHTML\",\n      value:\n      /**\n       * Get HTML representation\n       * @param {Object} options\n       * @return {string} str\n       */\n      function toHTML(options) {\n        var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n        var precedence = (0, _operators.getPrecedence)(this, parenthesis, options && options.implicit);\n        var paramStrings = this.params.map(function (p, index) {\n          var paramPrecedence = (0, _operators.getPrecedence)(p, parenthesis, options && options.implicit);\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 ret = paramStrings[0];\n        for (var i = 0; i < this.conditionals.length; i++) {\n          ret += '<span class=\"math-operator math-binary-operator ' + 'math-explicit-binary-operator\">' + (0, _string.escape)(operatorMap[this.conditionals[i]]) + '</span>' + paramStrings[i + 1];\n        }\n        return ret;\n      }\n\n      /**\n       * Get LaTeX representation\n       * @param {Object} options\n       * @return {string} str\n       */\n    }, {\n      key: \"_toTex\",\n      value: function _toTex(options) {\n        var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n        var precedence = (0, _operators.getPrecedence)(this, parenthesis, options && options.implicit);\n        var paramStrings = this.params.map(function (p, index) {\n          var paramPrecedence = (0, _operators.getPrecedence)(p, parenthesis, options && options.implicit);\n          return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '\\\\left(' + p.toTex(options) + '\\right)' : p.toTex(options);\n        });\n        var ret = paramStrings[0];\n        for (var i = 0; i < this.conditionals.length; i++) {\n          ret += _latex.latexOperators[this.conditionals[i]] + paramStrings[i + 1];\n        }\n        return ret;\n      }\n    }], [{\n      key: \"fromJSON\",\n      value: function fromJSON(json) {\n        return new RelationalNode(json.conditionals, json.params);\n      }\n    }]);\n    return RelationalNode;\n  }(Node);\n  (0, _defineProperty2[\"default\"])(RelationalNode, \"name\", name);\n  return RelationalNode;\n}, {\n  isClass: true,\n  isNode: true\n});\nexports.createRelationalNode = createRelationalNode;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSymbolNode = void 0;\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\nvar _string = require(\"../../utils/string.js\");\nvar _customs = require(\"../../utils/customs.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _latex = require(\"../../utils/latex.js\");\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nvar name = 'SymbolNode';\nvar dependencies = ['math', '?Unit', 'Node'];\nvar createSymbolNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var math = _ref.math,\n    Unit = _ref.Unit,\n    Node = _ref.Node;\n  /**\n   * Check whether some name is a valueless unit like \"inch\".\n   * @param {string} name\n   * @return {boolean}\n   */\n  function isValuelessUnit(name) {\n    return Unit ? Unit.isValuelessUnit(name) : false;\n  }\n  var SymbolNode = /*#__PURE__*/function (_Node) {\n    (0, _inherits2[\"default\"])(SymbolNode, _Node);\n    var _super = _createSuper(SymbolNode);\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    function SymbolNode(name) {\n      var _this;\n      (0, _classCallCheck2[\"default\"])(this, SymbolNode);\n      _this = _super.call(this);\n      // validate input\n      if (typeof name !== 'string') {\n        throw new TypeError('String expected for parameter \"name\"');\n      }\n      _this.name = name;\n      return _this;\n    }\n    (0, _createClass2[\"default\"])(SymbolNode, [{\n      key: \"type\",\n      get: function get() {\n        return 'SymbolNode';\n      }\n    }, {\n      key: \"isSymbolNode\",\n      get: function get() {\n        return true;\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      key: \"_compile\",\n      value: function _compile(math, argNames) {\n        var name = this.name;\n        if (argNames[name] === true) {\n          // this is a FunctionAssignment argument\n          // (like an x when inside the expression of a function\n          // 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 scope.has(name) ? scope.get(name) : (0, _customs.getSafeProperty)(math, name);\n          };\n        } else {\n          var isUnit = isValuelessUnit(name);\n          return function (scope, args, context) {\n            return scope.has(name) ? scope.get(name) : isUnit ? new Unit(null, name) : SymbolNode.onUndefinedSymbol(name);\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      key: \"forEach\",\n      value: function forEach(callback) {\n        // nothing to do, we don't have any children\n      }\n\n      /**\n       * Create a new SymbolNode with children produced by the given callback.\n       * Trivial since a SymbolNode has no children\n       * @param {function(child: Node, path: string, parent: Node) : Node} callback\n       * @returns {SymbolNode} Returns a clone of the node\n       */\n    }, {\n      key: \"map\",\n      value: function map(callback) {\n        return this.clone();\n      }\n\n      /**\n       * Throws an error 'Undefined symbol {name}'\n       * @param {string} name\n       */\n    }, {\n      key: \"clone\",\n      value:\n      /**\n       * Create a clone of this node, a shallow copy\n       * @return {SymbolNode}\n       */\n      function clone() {\n        return new SymbolNode(this.name);\n      }\n\n      /**\n       * Get string representation\n       * @param {Object} options\n       * @return {string} str\n       * @override\n       */\n    }, {\n      key: \"_toString\",\n      value: function _toString(options) {\n        return this.name;\n      }\n\n      /**\n       * Get HTML representation\n       * @param {Object} options\n       * @return {string} str\n       * @override\n       */\n    }, {\n      key: \"toHTML\",\n      value: function toHTML(options) {\n        var name = (0, _string.escape)(this.name);\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        return '<span class=\"math-symbol\">' + name + '</span>';\n      }\n\n      /**\n       * Get a JSON representation of the node\n       * @returns {Object}\n       */\n    }, {\n      key: \"toJSON\",\n      value: function toJSON() {\n        return {\n          mathjs: 'SymbolNode',\n          name: this.name\n        };\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      key: \"_toTex\",\n      value:\n      /**\n       * Get LaTeX representation\n       * @param {Object} options\n       * @return {string} str\n       * @override\n       */\n      function _toTex(options) {\n        var isUnit = false;\n        if (typeof math[this.name] === 'undefined' && isValuelessUnit(this.name)) {\n          isUnit = true;\n        }\n        var symbol = (0, _latex.toSymbol)(this.name, isUnit);\n        if (symbol[0] === '\\\\') {\n          // no space needed if the symbol starts with '\\'\n          return symbol;\n        }\n        // the space prevents symbols from breaking stuff like '\\cdot'\n        // if it's written right before the symbol\n        return ' ' + symbol;\n      }\n    }], [{\n      key: \"onUndefinedSymbol\",\n      value: function onUndefinedSymbol(name) {\n        throw new Error('Undefined symbol ' + name);\n      }\n    }, {\n      key: \"fromJSON\",\n      value: function fromJSON(json) {\n        return new SymbolNode(json.name);\n      }\n    }]);\n    return SymbolNode;\n  }(Node);\n  return SymbolNode;\n}, {\n  isClass: true,\n  isNode: true\n});\nexports.createSymbolNode = createSymbolNode;","var getPrototypeOf = require(\"./getPrototypeOf.js\");\nfunction _superPropBase(object, property) {\n  while (!Object.prototype.hasOwnProperty.call(object, property)) {\n    object = getPrototypeOf(object);\n    if (object === null) break;\n  }\n  return object;\n}\nmodule.exports = _superPropBase, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","var superPropBase = require(\"./superPropBase.js\");\nfunction _get() {\n  if (typeof Reflect !== \"undefined\" && Reflect.get) {\n    module.exports = _get = Reflect.get.bind(), module.exports.__esModule = true, module.exports[\"default\"] = module.exports;\n  } else {\n    module.exports = _get = function _get(target, property, receiver) {\n      var base = superPropBase(target, property);\n      if (!base) return;\n      var desc = Object.getOwnPropertyDescriptor(base, property);\n      if (desc.get) {\n        return desc.get.call(arguments.length < 3 ? target : receiver);\n      }\n      return desc.value;\n    }, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;\n  }\n  return _get.apply(this, arguments);\n}\nmodule.exports = _get, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSubScope = createSubScope;\nvar _map = require(\"./map.js\");\n/**\n * Create a new scope which can access the parent scope,\n * but does not affect it when written. This is suitable for variable definitions\n * within a block node, or function definition.\n *\n * If parent scope has a createSubScope method, it delegates to that. Otherwise,\n * creates an empty map, and copies the parent scope to it, adding in\n * the remaining `args`.\n *\n * @param {Map} parentScope\n * @param  {...any} args\n * @returns {Map}\n */\nfunction createSubScope(parentScope) {\n  for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n    args[_key - 1] = arguments[_key];\n  }\n  if (typeof parentScope.createSubScope === 'function') {\n    return _map.assign.apply(void 0, [parentScope.createSubScope()].concat(args));\n  }\n  return _map.assign.apply(void 0, [(0, _map.createEmptyMap)(), parentScope].concat(args));\n}","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createFunctionNode = void 0;\nvar _toConsumableArray2 = _interopRequireDefault(require(\"@babel/runtime/helpers/toConsumableArray\"));\nvar _classCallCheck2 = _interopRequireDefault(require(\"@babel/runtime/helpers/classCallCheck\"));\nvar _createClass2 = _interopRequireDefault(require(\"@babel/runtime/helpers/createClass\"));\nvar _get2 = _interopRequireDefault(require(\"@babel/runtime/helpers/get\"));\nvar _inherits2 = _interopRequireDefault(require(\"@babel/runtime/helpers/inherits\"));\nvar _possibleConstructorReturn2 = _interopRequireDefault(require(\"@babel/runtime/helpers/possibleConstructorReturn\"));\nvar _getPrototypeOf2 = _interopRequireDefault(require(\"@babel/runtime/helpers/getPrototypeOf\"));\nvar _defineProperty2 = _interopRequireDefault(require(\"@babel/runtime/helpers/defineProperty\"));\nvar _typeof2 = _interopRequireDefault(require(\"@babel/runtime/helpers/typeof\"));\nvar _is = require(\"../../utils/is.js\");\nvar _string = require(\"../../utils/string.js\");\nvar _object = require(\"../../utils/object.js\");\nvar _customs = require(\"../../utils/customs.js\");\nvar _scope = require(\"../../utils/scope.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _latex = require(\"../../utils/latex.js\");\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = (0, _getPrototypeOf2[\"default\"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0, _getPrototypeOf2[\"default\"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0, _possibleConstructorReturn2[\"default\"])(this, result); }; }\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }\nvar name = 'FunctionNode';\nvar dependencies = ['math', 'Node', 'SymbolNode'];\nvar createFunctionNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var math = _ref.math,\n    Node = _ref.Node,\n    SymbolNode = _ref.SymbolNode;\n  /* format to fixed length */\n  var strin = function strin(entity) {\n    return (0, _string.format)(entity, {\n      truncate: 78\n    });\n  };\n\n  /*\n   * Expand a LaTeX template\n   *\n   * @param {string} template\n   * @param {Node} node\n   * @param {Object} options\n   * @private\n   **/\n  function expandTemplate(template, node, options) {\n    var latex = '';\n\n    // Match everything of the form ${identifier} or ${identifier[2]} or $$\n    // while submatching identifier and 2 (in the second case)\n    var regex = /\\$(?:\\{([a-z_][a-z_0-9]*)(?:\\[([0-9]+)\\])?\\}|\\$)/gi;\n    var inputPos = 0; // position in the input string\n    var match;\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      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        if (!property) {\n          throw new ReferenceError('Template: Property ' + match[1] + ' does not exist.');\n        }\n        if (match[2] === undefined) {\n          // no square brackets\n          switch ((0, _typeof2[\"default\"])(property)) {\n            case 'string':\n              latex += property;\n              break;\n            case 'object':\n              if ((0, _is.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 ((0, _is.isNode)(arg)) {\n                    return arg.toTex(options);\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              break;\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 ((0, _is.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    latex += template.slice(inputPos); // append rest of the template\n\n    return latex;\n  }\n  var FunctionNode = /*#__PURE__*/function (_Node) {\n    (0, _inherits2[\"default\"])(FunctionNode, _Node);\n    var _super = _createSuper(FunctionNode);\n    /**\n     * @constructor FunctionNode\n     * @extends {./Node}\n     * invoke a list with arguments on a node\n     * @param {./Node | string} fn\n     *     Item resolving to a function on which to invoke\n     *     the arguments, typically a SymboNode or AccessorNode\n     * @param {./Node[]} args\n     */\n    function FunctionNode(fn, args) {\n      var _this;\n      (0, _classCallCheck2[\"default\"])(this, FunctionNode);\n      _this = _super.call(this);\n      if (typeof fn === 'string') {\n        fn = new SymbolNode(fn);\n      }\n\n      // validate input\n      if (!(0, _is.isNode)(fn)) throw new TypeError('Node expected as parameter \"fn\"');\n      if (!Array.isArray(args) || !args.every(_is.isNode)) {\n        throw new TypeError('Array containing Nodes expected for parameter \"args\"');\n      }\n      _this.fn = fn;\n      _this.args = args || [];\n      return _this;\n    }\n\n    // readonly property name\n    (0, _createClass2[\"default\"])(FunctionNode, [{\n      key: \"name\",\n      get: function get() {\n        return this.fn.name || '';\n      }\n    }, {\n      key: \"type\",\n      get: function get() {\n        return name;\n      }\n    }, {\n      key: \"isFunctionNode\",\n      get: function get() {\n        return true;\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      key: \"_compile\",\n      value: function _compile(math, argNames) {\n        // compile arguments\n        var evalArgs = this.args.map(function (arg) {\n          return arg._compile(math, argNames);\n        });\n        if ((0, _is.isSymbolNode)(this.fn)) {\n          var _name = this.fn.name;\n          if (!argNames[_name]) {\n            // we can statically determine whether the function\n            // has the rawArgs property\n            var fn = _name in math ? (0, _customs.getSafeProperty)(math, _name) : undefined;\n            var isRaw = typeof fn === 'function' && fn.rawArgs === true;\n            var resolveFn = function resolveFn(scope) {\n              var value;\n              if (scope.has(_name)) {\n                value = scope.get(_name);\n              } else if (_name in math) {\n                value = (0, _customs.getSafeProperty)(math, _name);\n              } else {\n                return FunctionNode.onUndefinedFunction(_name);\n              }\n              if (typeof value === 'function') {\n                return value;\n              }\n              throw new TypeError(\"'\".concat(_name, \"' is not a function; its value is:\\n  \").concat(strin(value)));\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                var fn = resolveFn(scope);\n                return fn(rawArgs, math, (0, _scope.createSubScope)(scope, args), scope);\n              };\n            } else {\n              // \"regular\" evaluation\n              switch (evalArgs.length) {\n                case 0:\n                  return function evalFunctionNode(scope, args, context) {\n                    var fn = resolveFn(scope);\n                    return fn();\n                  };\n                case 1:\n                  return function evalFunctionNode(scope, args, context) {\n                    var fn = resolveFn(scope);\n                    var evalArg0 = evalArgs[0];\n                    return fn(evalArg0(scope, args, context));\n                  };\n                case 2:\n                  return function evalFunctionNode(scope, args, context) {\n                    var fn = resolveFn(scope);\n                    var evalArg0 = evalArgs[0];\n                    var evalArg1 = evalArgs[1];\n                    return fn(evalArg0(scope, args, context), evalArg1(scope, args, context));\n                  };\n                default:\n                  return function evalFunctionNode(scope, args, context) {\n                    var fn = resolveFn(scope);\n                    var values = evalArgs.map(function (evalArg) {\n                      return evalArg(scope, args, context);\n                    });\n                    return fn.apply(void 0, (0, _toConsumableArray2[\"default\"])(values));\n                  };\n              }\n            }\n          } else {\n            // the function symbol is an argName\n            var _rawArgs = this.args;\n            return function evalFunctionNode(scope, args, context) {\n              var fn = args[_name];\n              if (typeof fn !== 'function') {\n                throw new TypeError(\"Argument '\".concat(_name, \"' was not a function; received: \").concat(strin(fn)));\n              }\n              if (fn.rawArgs) {\n                // \"Raw\" evaluation\n                return fn(_rawArgs, math, (0, _scope.createSubScope)(scope, args), scope);\n              } else {\n                var values = evalArgs.map(function (evalArg) {\n                  return evalArg(scope, args, context);\n                });\n                return fn.apply(fn, values);\n              }\n            };\n          }\n        } else if ((0, _is.isAccessorNode)(this.fn) && (0, _is.isIndexNode)(this.fn.index) && this.fn.index.isObjectProperty()) {\n          // execute the function with the right context:\n          // the object of the AccessorNode\n\n          var evalObject = this.fn.object._compile(math, argNames);\n          var prop = this.fn.index.getObjectProperty();\n          var _rawArgs2 = this.args;\n          return function evalFunctionNode(scope, args, context) {\n            var object = evalObject(scope, args, context);\n            (0, _customs.validateSafeMethod)(object, prop);\n            var isRaw = object[prop] && object[prop].rawArgs;\n            if (isRaw) {\n              // \"Raw\" evaluation\n              return object[prop](_rawArgs2, math, (0, _scope.createSubScope)(scope, args), scope);\n            } else {\n              // \"regular\" evaluation\n              var values = evalArgs.map(function (evalArg) {\n                return evalArg(scope, args, context);\n              });\n              return object[prop].apply(object, values);\n            }\n          };\n        } else {\n          // node.fn.isAccessorNode && !node.fn.index.isObjectProperty()\n          // we have to dynamically determine whether the function has the\n          // rawArgs property\n          var fnExpr = this.fn.toString();\n          var evalFn = this.fn._compile(math, argNames);\n          var _rawArgs3 = this.args;\n          return function evalFunctionNode(scope, args, context) {\n            var fn = evalFn(scope, args, context);\n            if (typeof fn !== 'function') {\n              throw new TypeError(\"Expression '\".concat(fnExpr, \"' did not evaluate to a function; value is:\") + \"\\n  \".concat(strin(fn)));\n            }\n            if (fn.rawArgs) {\n              // \"Raw\" evaluation\n              return fn(_rawArgs3, math, (0, _scope.createSubScope)(scope, args), scope);\n            } else {\n              // \"regular\" evaluation\n              var values = evalArgs.map(function (evalArg) {\n                return evalArg(scope, args, context);\n              });\n              return fn.apply(fn, values);\n            }\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      key: \"forEach\",\n      value: function forEach(callback) {\n        callback(this.fn, 'fn', this);\n        for (var i = 0; i < this.args.length; i++) {\n          callback(this.args[i], 'args[' + i + ']', this);\n        }\n      }\n\n      /**\n       * Create a new FunctionNode whose children are the results of calling\n       * the provided callback function for each child 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      key: \"map\",\n      value: function map(callback) {\n        var fn = this._ifNode(callback(this.fn, 'fn', this));\n        var args = [];\n        for (var i = 0; i < this.args.length; i++) {\n          args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this));\n        }\n        return new FunctionNode(fn, args);\n      }\n\n      /**\n       * Create a clone of this node, a shallow copy\n       * @return {FunctionNode}\n       */\n    }, {\n      key: \"clone\",\n      value: function clone() {\n        return new FunctionNode(this.fn, this.args.slice(0));\n      }\n\n      /**\n       * Throws an error 'Undefined function {name}'\n       * @param {string} name\n       */\n    }, {\n      key: \"toString\",\n      value:\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      function toString(options) {\n        var customString;\n        var name = this.fn.toString(options);\n        if (options && (0, _typeof2[\"default\"])(options.handler) === 'object' && (0, _object.hasOwnProperty)(options.handler, name)) {\n          // callback is a map of callback functions\n          customString = options.handler[name](this, options);\n        }\n        if (typeof customString !== 'undefined') {\n          return customString;\n        }\n\n        // fall back to Node's toString\n        return (0, _get2[\"default\"])((0, _getPrototypeOf2[\"default\"])(FunctionNode.prototype), \"toString\", this).call(this, options);\n      }\n\n      /**\n       * Get string representation\n       * @param {Object} options\n       * @return {string} str\n       */\n    }, {\n      key: \"_toString\",\n      value: function _toString(options) {\n        var args = this.args.map(function (arg) {\n          return arg.toString(options);\n        });\n        var fn = (0, _is.isFunctionAssignmentNode)(this.fn) ? '(' + this.fn.toString(options) + ')' : this.fn.toString(options);\n\n        // format the arguments like \"add(2, 4.2)\"\n        return fn + '(' + args.join(', ') + ')';\n      }\n\n      /**\n       * Get a JSON representation of the node\n       * @returns {Object}\n       */\n    }, {\n      key: \"toJSON\",\n      value: function toJSON() {\n        return {\n          mathjs: name,\n          fn: this.fn,\n          args: this.args\n        };\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      key: \"toHTML\",\n      value:\n      /**\n       * Get HTML representation\n       * @param {Object} options\n       * @return {string} str\n       */\n      function toHTML(options) {\n        var args = this.args.map(function (arg) {\n          return arg.toHTML(options);\n        });\n\n        // format the arguments like \"add(2, 4.2)\"\n        return '<span class=\"math-function\">' + (0, _string.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      /**\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      key: \"toTex\",\n      value: function toTex(options) {\n        var customTex;\n        if (options && (0, _typeof2[\"default\"])(options.handler) === 'object' && (0, _object.hasOwnProperty)(options.handler, this.name)) {\n          // callback is a map of callback functions\n          customTex = options.handler[this.name](this, options);\n        }\n        if (typeof customTex !== 'undefined') {\n          return customTex;\n        }\n\n        // fall back to Node's toTex\n        return (0, _get2[\"default\"])((0, _getPrototypeOf2[\"default\"])(FunctionNode.prototype), \"toTex\", this).call(this, options);\n      }\n\n      /**\n       * Get LaTeX representation\n       * @param {Object} options\n       * @return {string} str\n       */\n    }, {\n      key: \"_toTex\",\n      value: function _toTex(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        if (_latex.latexFunctions[this.name]) {\n          latexConverter = _latex.latexFunctions[this.name];\n        }\n\n        // toTex property on the function itself\n        if (math[this.name] && (typeof math[this.name].toTex === 'function' || (0, _typeof2[\"default\"])(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        var customToTex;\n        switch ((0, _typeof2[\"default\"])(latexConverter)) {\n          case 'function':\n            // a callback function\n            customToTex = latexConverter(this, options);\n            break;\n          case 'string':\n            // a template string\n            customToTex = expandTemplate(latexConverter, this, options);\n            break;\n          case 'object':\n            // an object with different \"converters\" for different\n            // numbers of arguments\n            switch ((0, _typeof2[\"default\"])(latexConverter[args.length])) {\n              case 'function':\n                customToTex = latexConverter[args.length](this, options);\n                break;\n              case 'string':\n                customToTex = expandTemplate(latexConverter[args.length], this, options);\n                break;\n            }\n        }\n        if (typeof customToTex !== 'undefined') {\n          return customToTex;\n        }\n        return expandTemplate(_latex.defaultTemplate, this, options);\n      }\n\n      /**\n       * Get identifier.\n       * @return {string}\n       */\n    }, {\n      key: \"getIdentifier\",\n      value: function getIdentifier() {\n        return this.type + ':' + this.name;\n      }\n    }]);\n    return FunctionNode;\n  }(Node);\n  (0, _defineProperty2[\"default\"])(FunctionNode, \"name\", name);\n  (0, _defineProperty2[\"default\"])(FunctionNode, \"onUndefinedFunction\", function (name) {\n    throw new Error('Undefined function ' + name);\n  });\n  (0, _defineProperty2[\"default\"])(FunctionNode, \"fromJSON\", function (json) {\n    return new FunctionNode(json.fn, json.args);\n  });\n  return FunctionNode;\n}, {\n  isClass: true,\n  isNode: true\n});\nexports.createFunctionNode = createFunctionNode;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createParse = void 0;\nvar _extends2 = _interopRequireDefault(require(\"@babel/runtime/helpers/extends\"));\nvar _factory = require(\"../utils/factory.js\");\nvar _is = require(\"../utils/is.js\");\nvar _collection = require(\"../utils/collection.js\");\nvar _object = require(\"../utils/object.js\");\nvar name = 'parse';\nvar dependencies = ['typed', 'numeric', 'config', 'AccessorNode', 'ArrayNode', 'AssignmentNode', 'BlockNode', 'ConditionalNode', 'ConstantNode', 'FunctionAssignmentNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'ParenthesisNode', 'RangeNode', 'RelationalNode', 'SymbolNode'];\nvar createParse = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    numeric = _ref.numeric,\n    config = _ref.config,\n    AccessorNode = _ref.AccessorNode,\n    ArrayNode = _ref.ArrayNode,\n    AssignmentNode = _ref.AssignmentNode,\n    BlockNode = _ref.BlockNode,\n    ConditionalNode = _ref.ConditionalNode,\n    ConstantNode = _ref.ConstantNode,\n    FunctionAssignmentNode = _ref.FunctionAssignmentNode,\n    FunctionNode = _ref.FunctionNode,\n    IndexNode = _ref.IndexNode,\n    ObjectNode = _ref.ObjectNode,\n    OperatorNode = _ref.OperatorNode,\n    ParenthesisNode = _ref.ParenthesisNode,\n    RangeNode = _ref.RangeNode,\n    RelationalNode = _ref.RelationalNode,\n    SymbolNode = _ref.SymbolNode;\n  /**\n   * Parse an expression. Returns a node tree, which can be evaluated by\n   * invoking node.evaluate().\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().evaluate() // 5\n   *\n   *     let scope = {a:3, b:4}\n   *     const node2 = math.parse('a * b') // 12\n   *     const code2 = node2.compile()\n   *     code2.evaluate(scope) // 12\n   *     scope.a = 5\n   *     code2.evaluate(scope) // 20\n   *\n   *     const nodes = math.parse(['a = 3', 'b = 4', 'a * b'])\n   *     nodes[2].compile().evaluate() // 12\n   *\n   * See also:\n   *\n   *     evaluate, 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  var parse = typed(name, {\n    string: function string(expression) {\n      return parseStart(expression, {});\n    },\n    'Array | Matrix': function ArrayMatrix(expressions) {\n      return parseMultiple(expressions, {});\n    },\n    'string, Object': function stringObject(expression, options) {\n      var extraNodes = options.nodes !== undefined ? options.nodes : {};\n      return parseStart(expression, extraNodes);\n    },\n    'Array | Matrix, Object': parseMultiple\n  });\n  function parseMultiple(expressions) {\n    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n    var extraNodes = options.nodes !== undefined ? options.nodes : {};\n\n    // parse an array or matrix with expressions\n    return (0, _collection.deepMap)(expressions, function (elem) {\n      if (typeof elem !== 'string') throw new TypeError('String expected');\n      return parseStart(elem, extraNodes);\n    });\n  }\n\n  // token types enumeration\n  var TOKENTYPE = {\n    NULL: 0,\n    DELIMITER: 1,\n    NUMBER: 2,\n    SYMBOL: 3,\n    UNKNOWN: 4\n  };\n\n  // map with all delimiters\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\n  };\n\n  // map with all named delimiters\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  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 {Object} state\n   * @param {number} [length=1] Number of characters to view\n   * @returns {string}\n   * @private\n   */\n  function currentString(state, length) {\n    return state.expression.substr(state.index, length);\n  }\n\n  /**\n   * View the current character. Returns '' if end of expression is reached.\n   *\n   * @param {Object} state\n   * @returns {string}\n   * @private\n   */\n  function currentCharacter(state) {\n    return currentString(state, 1);\n  }\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  function next(state) {\n    state.index++;\n  }\n\n  /**\n   * Preview the previous character from the expression.\n   * @return {string} cNext\n   * @private\n   */\n  function prevCharacter(state) {\n    return state.expression.charAt(state.index - 1);\n  }\n\n  /**\n   * Preview the next character from the expression.\n   * @return {string} cNext\n   * @private\n   */\n  function nextCharacter(state) {\n    return state.expression.charAt(state.index + 1);\n  }\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  function getToken(state) {\n    state.tokenType = TOKENTYPE.NULL;\n    state.token = '';\n    state.comment = '';\n\n    // skip over ignored characters:\n    while (true) {\n      // comments:\n      if (currentCharacter(state) === '#') {\n        while (currentCharacter(state) !== '\\n' && currentCharacter(state) !== '') {\n          state.comment += currentCharacter(state);\n          next(state);\n        }\n      }\n      // whitespace: space, tab, and newline when inside parameters\n      if (parse.isWhitespace(currentCharacter(state), state.nestingLevel)) {\n        next(state);\n      } else {\n        break;\n      }\n    }\n\n    // check for end of expression\n    if (currentCharacter(state) === '') {\n      // token is still empty\n      state.tokenType = TOKENTYPE.DELIMITER;\n      return;\n    }\n\n    // check for new line character\n    if (currentCharacter(state) === '\\n' && !state.nestingLevel) {\n      state.tokenType = TOKENTYPE.DELIMITER;\n      state.token = currentCharacter(state);\n      next(state);\n      return;\n    }\n    var c1 = currentCharacter(state);\n    var c2 = currentString(state, 2);\n    var c3 = currentString(state, 3);\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    }\n\n    // check for delimiters consisting of 2 characters\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    }\n\n    // check for delimiters consisting of 1 character\n    if (DELIMITERS[c1]) {\n      state.tokenType = TOKENTYPE.DELIMITER;\n      state.token = c1;\n      next(state);\n      return;\n    }\n\n    // check for a number\n    if (parse.isDigitDot(c1)) {\n      state.tokenType = TOKENTYPE.NUMBER;\n\n      // check for binary, octal, or hex\n      var _c = currentString(state, 2);\n      if (_c === '0b' || _c === '0o' || _c === '0x') {\n        state.token += currentCharacter(state);\n        next(state);\n        state.token += currentCharacter(state);\n        next(state);\n        while (parse.isHexDigit(currentCharacter(state))) {\n          state.token += currentCharacter(state);\n          next(state);\n        }\n        if (currentCharacter(state) === '.') {\n          // this number has a radix point\n          state.token += '.';\n          next(state);\n          // get the digits after the radix\n          while (parse.isHexDigit(currentCharacter(state))) {\n            state.token += currentCharacter(state);\n            next(state);\n          }\n        } else if (currentCharacter(state) === 'i') {\n          // this number has a word size suffix\n          state.token += 'i';\n          next(state);\n          // get the word size\n          while (parse.isDigit(currentCharacter(state))) {\n            state.token += currentCharacter(state);\n            next(state);\n          }\n        }\n        return;\n      }\n\n      // get number, can have a single dot\n      if (currentCharacter(state) === '.') {\n        state.token += currentCharacter(state);\n        next(state);\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          return;\n        }\n      } else {\n        while (parse.isDigit(currentCharacter(state))) {\n          state.token += currentCharacter(state);\n          next(state);\n        }\n        if (parse.isDecimalMark(currentCharacter(state), nextCharacter(state))) {\n          state.token += currentCharacter(state);\n          next(state);\n        }\n      }\n      while (parse.isDigit(currentCharacter(state))) {\n        state.token += currentCharacter(state);\n        next(state);\n      }\n      // check for exponential notation like \"2.3e-4\", \"1.23e50\" or \"2e+4\"\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          if (currentCharacter(state) === '+' || currentCharacter(state) === '-') {\n            state.token += currentCharacter(state);\n            next(state);\n          }\n          // Scientific notation MUST be followed by an exponent\n          if (!parse.isDigit(currentCharacter(state))) {\n            throw createSyntaxError(state, 'Digit expected, got \"' + currentCharacter(state) + '\"');\n          }\n          while (parse.isDigit(currentCharacter(state))) {\n            state.token += currentCharacter(state);\n            next(state);\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      return;\n    }\n\n    // check for variables, functions, named operators\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      if ((0, _object.hasOwnProperty)(NAMED_DELIMITERS, state.token)) {\n        state.tokenType = TOKENTYPE.DELIMITER;\n      } else {\n        state.tokenType = TOKENTYPE.SYMBOL;\n      }\n      return;\n    }\n\n    // something unknown is found, wrong characters -> a syntax error\n    state.tokenType = TOKENTYPE.UNKNOWN;\n    while (currentCharacter(state) !== '') {\n      state.token += currentCharacter(state);\n      next(state);\n    }\n    throw createSyntaxError(state, 'Syntax error in part \"' + state.token + '\"');\n  }\n\n  /**\n   * Get next token and skip newline tokens\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  function openParams(state) {\n    state.nestingLevel++;\n  }\n\n  /**\n   * Close parameters.\n   * New line characters will no longer be ignored\n   */\n  function closeParams(state) {\n    state.nestingLevel--;\n  }\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  parse.isAlpha = function isAlpha(c, cPrev, cNext) {\n    return parse.isValidLatinOrGreek(c) || parse.isValidMathSymbol(c, cNext) || parse.isValidMathSymbol(cPrev, c);\n  };\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  parse.isValidLatinOrGreek = function isValidLatinOrGreek(c) {\n    return /^[a-zA-Z_$\\u00C0-\\u02AF\\u0370-\\u03FF\\u2100-\\u214F]$/.test(c);\n  };\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  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  /**\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  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  /**\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  parse.isDecimalMark = function isDecimalMark(c, cNext) {\n    return c === '.' && cNext !== '/' && cNext !== '*' && cNext !== '^';\n  };\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  parse.isDigitDot = function isDigitDot(c) {\n    return c >= '0' && c <= '9' || c === '.';\n  };\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  parse.isDigit = function isDigit(c) {\n    return c >= '0' && c <= '9';\n  };\n\n  /**\n   * checks if the given char c is a hex digit\n   * @param {string} c   a string with one character\n   * @return {boolean}\n   */\n  parse.isHexDigit = function isHexDigit(c) {\n    return c >= '0' && c <= '9' || c >= 'a' && c <= 'f' || c >= 'A' && c <= 'F';\n  };\n\n  /**\n   * Start of the parse levels below, in order of precedence\n   * @return {Node} node\n   * @private\n   */\n  function parseStart(expression, extraNodes) {\n    var state = initialState();\n    (0, _extends2[\"default\"])(state, {\n      expression: expression,\n      extraNodes: extraNodes\n    });\n    getToken(state);\n    var node = parseBlock(state);\n\n    // check for garbage at the end of the expression\n    // an expression ends with a empty character '' and tokenType DELIMITER\n    if (state.token !== '') {\n      if (state.tokenType === TOKENTYPE.DELIMITER) {\n        // user entered a not existing operator like \"//\"\n\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    return node;\n  }\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  function parseBlock(state) {\n    var node;\n    var blocks = [];\n    var visible;\n    if (state.token !== '' && state.token !== '\\n' && state.token !== ';') {\n      node = parseAssignment(state);\n      if (state.comment) {\n        node.comment = state.comment;\n      }\n    }\n\n    // TODO: simplify this loop\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      getToken(state);\n      if (state.token !== '\\n' && state.token !== ';' && state.token !== '') {\n        node = parseAssignment(state);\n        if (state.comment) {\n          node.comment = state.comment;\n        }\n        visible = state.token !== ';';\n        blocks.push({\n          node: node,\n          visible: visible\n        });\n      }\n    }\n    if (blocks.length > 0) {\n      return new BlockNode(blocks);\n    } else {\n      if (!node) {\n        node = new ConstantNode(undefined);\n        if (state.comment) {\n          node.comment = state.comment;\n        }\n      }\n      return node;\n    }\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  function parseAssignment(state) {\n    var name, args, value, valid;\n    var node = parseConditional(state);\n    if (state.token === '=') {\n      if ((0, _is.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 ((0, _is.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 ((0, _is.isFunctionNode)(node) && (0, _is.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 ((0, _is.isSymbolNode)(arg)) {\n            args[index] = arg.name;\n          } else {\n            valid = false;\n          }\n        });\n        if (valid) {\n          getTokenSkipNewline(state);\n          value = parseAssignment(state);\n          return new FunctionAssignmentNode(name, args, value);\n        }\n      }\n      throw createSyntaxError(state, 'Invalid left hand side of assignment operator =');\n    }\n    return node;\n  }\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  function parseConditional(state) {\n    var node = parseLogicalOr(state);\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);\n\n      // restore the previous conditional level\n      state.conditionalLevel = prev;\n    }\n    return node;\n  }\n\n  /**\n   * logical or, 'x or y'\n   * @return {Node} node\n   * @private\n   */\n  function parseLogicalOr(state) {\n    var node = parseLogicalXor(state);\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    return node;\n  }\n\n  /**\n   * logical exclusive or, 'x xor y'\n   * @return {Node} node\n   * @private\n   */\n  function parseLogicalXor(state) {\n    var node = parseLogicalAnd(state);\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    return node;\n  }\n\n  /**\n   * logical and, 'x and y'\n   * @return {Node} node\n   * @private\n   */\n  function parseLogicalAnd(state) {\n    var node = parseBitwiseOr(state);\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    return node;\n  }\n\n  /**\n   * bitwise or, 'x | y'\n   * @return {Node} node\n   * @private\n   */\n  function parseBitwiseOr(state) {\n    var node = parseBitwiseXor(state);\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    return node;\n  }\n\n  /**\n   * bitwise exclusive or (xor), 'x ^| y'\n   * @return {Node} node\n   * @private\n   */\n  function parseBitwiseXor(state) {\n    var node = parseBitwiseAnd(state);\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    return node;\n  }\n\n  /**\n   * bitwise and, 'x & y'\n   * @return {Node} node\n   * @private\n   */\n  function parseBitwiseAnd(state) {\n    var node = parseRelational(state);\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    return node;\n  }\n\n  /**\n   * Parse a chained conditional, like 'a > b >= c'\n   * @return {Node} node\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    while ((0, _object.hasOwnProperty)(operators, 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    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  /**\n   * Bitwise left shift, bitwise right arithmetic shift, bitwise right logical shift\n   * @return {Node} node\n   * @private\n   */\n  function parseShift(state) {\n    var node, name, fn, params;\n    node = parseConversion(state);\n    var operators = {\n      '<<': 'leftShift',\n      '>>': 'rightArithShift',\n      '>>>': 'rightLogShift'\n    };\n    while ((0, _object.hasOwnProperty)(operators, 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    return node;\n  }\n\n  /**\n   * conversion operators 'to' and 'in'\n   * @return {Node} node\n   * @private\n   */\n  function parseConversion(state) {\n    var node, name, fn, params;\n    node = parseRange(state);\n    var operators = {\n      to: 'to',\n      \"in\": 'to' // alias of 'to'\n    };\n\n    while ((0, _object.hasOwnProperty)(operators, state.token)) {\n      name = state.token;\n      fn = operators[name];\n      getTokenSkipNewline(state);\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    return node;\n  }\n\n  /**\n   * parse range, \"start:end\", \"start:step:end\", \":\", \"start:\", \":end\", etc\n   * @return {Node} node\n   * @private\n   */\n  function parseRange(state) {\n    var node;\n    var params = [];\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    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);\n\n      // parse step and end\n      while (state.token === ':' && params.length < 3) {\n        // eslint-disable-line no-unmodified-loop-condition\n        getTokenSkipNewline(state);\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      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  /**\n   * add or subtract\n   * @return {Node} node\n   * @private\n   */\n  function parseAddSubtract(state) {\n    var node, name, fn, params;\n    node = parseMultiplyDivide(state);\n    var operators = {\n      '+': 'add',\n      '-': 'subtract'\n    };\n    while ((0, _object.hasOwnProperty)(operators, state.token)) {\n      name = state.token;\n      fn = operators[name];\n      getTokenSkipNewline(state);\n      var rightNode = parseMultiplyDivide(state);\n      if (rightNode.isPercentage) {\n        params = [node, new OperatorNode('*', 'multiply', [node, rightNode])];\n      } else {\n        params = [node, rightNode];\n      }\n      node = new OperatorNode(name, fn, params);\n    }\n    return node;\n  }\n\n  /**\n   * multiply, divide, modulus\n   * @return {Node} node\n   * @private\n   */\n  function parseMultiplyDivide(state) {\n    var node, last, name, fn;\n    node = parseImplicitMultiplication(state);\n    last = node;\n    var operators = {\n      '*': 'multiply',\n      '.*': 'dotMultiply',\n      '/': 'divide',\n      './': 'dotDivide'\n    };\n    while (true) {\n      if ((0, _object.hasOwnProperty)(operators, 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    return node;\n  }\n\n  /**\n   * implicit multiplication\n   * @return {Node} node\n   * @private\n   */\n  function parseImplicitMultiplication(state) {\n    var node, last;\n    node = parseRule2(state);\n    last = node;\n    while (true) {\n      if (state.tokenType === TOKENTYPE.SYMBOL || state.token === 'in' && (0, _is.isConstantNode)(node) || state.tokenType === TOKENTYPE.NUMBER && !(0, _is.isConstantNode)(last) && (!(0, _is.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 /* implicit */);\n      } else {\n        break;\n      }\n    }\n    return node;\n  }\n\n  /**\n   * Infamous \"rule 2\" as described in https://github.com/josdejong/mathjs/issues/792#issuecomment-361065370\n   * And as amended in https://github.com/josdejong/mathjs/issues/2370#issuecomment-1054052164\n   * Explicit division gets higher precedence than implicit multiplication\n   * when the division matches this pattern:\n   *   [unaryPrefixOp]?[number] / [number] [symbol]\n   * @return {Node} node\n   * @private\n   */\n  function parseRule2(state) {\n    var node = parsePercentage(state);\n    var last = node;\n    var tokenStates = [];\n    while (true) {\n      // Match the \"number /\" part of the pattern \"number / number symbol\"\n      if (state.token === '/' && (0, _is.rule2Node)(last)) {\n        // Look ahead to see if the next token is a number\n        tokenStates.push((0, _extends2[\"default\"])({}, state));\n        getTokenSkipNewline(state);\n\n        // Match the \"number / number\" part of the pattern\n        if (state.tokenType === TOKENTYPE.NUMBER) {\n          // Look ahead again\n          tokenStates.push((0, _extends2[\"default\"])({}, state));\n          getTokenSkipNewline(state);\n\n          // Match the \"symbol\" part of the pattern, or a left parenthesis\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            (0, _extends2[\"default\"])(state, tokenStates.pop());\n            tokenStates.pop();\n            last = parsePercentage(state);\n            node = new OperatorNode('/', 'divide', [node, last]);\n          } else {\n            // Not a match, so rewind\n            tokenStates.pop();\n            (0, _extends2[\"default\"])(state, tokenStates.pop());\n            break;\n          }\n        } else {\n          // Not a match, so rewind\n          (0, _extends2[\"default\"])(state, tokenStates.pop());\n          break;\n        }\n      } else {\n        break;\n      }\n    }\n    return node;\n  }\n\n  /**\n   * percentage or mod\n   * @return {Node} node\n   * @private\n   */\n  function parsePercentage(state) {\n    var node, name, fn, params;\n    node = parseUnary(state);\n    var operators = {\n      '%': 'mod',\n      mod: 'mod'\n    };\n    while ((0, _object.hasOwnProperty)(operators, state.token)) {\n      name = state.token;\n      fn = operators[name];\n      getTokenSkipNewline(state);\n      if (name === '%' && state.tokenType === TOKENTYPE.DELIMITER && state.token !== '(') {\n        // If the expression contains only %, then treat that as /100\n        node = new OperatorNode('/', 'divide', [node, new ConstantNode(100)], false, true);\n      } else {\n        params = [node, parseUnary(state)];\n        node = new OperatorNode(name, fn, params);\n      }\n    }\n    return node;\n  }\n\n  /**\n   * Unary plus and minus, and logical and bitwise not\n   * @return {Node} node\n   * @private\n   */\n  function parseUnary(state) {\n    var name, params, fn;\n    var operators = {\n      '-': 'unaryMinus',\n      '+': 'unaryPlus',\n      '~': 'bitNot',\n      not: 'not'\n    };\n    if ((0, _object.hasOwnProperty)(operators, 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    return parsePow(state);\n  }\n\n  /**\n   * power\n   * Note: power operator is right associative\n   * @return {Node} node\n   * @private\n   */\n  function parsePow(state) {\n    var node, name, fn, params;\n    node = parseLeftHandOperators(state);\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      node = new OperatorNode(name, fn, params);\n    }\n    return node;\n  }\n\n  /**\n   * Left hand operators: factorial x!, ctranspose x'\n   * @return {Node} node\n   * @private\n   */\n  function parseLeftHandOperators(state) {\n    var node, name, fn, params;\n    node = parseCustomNodes(state);\n    var operators = {\n      '!': 'factorial',\n      '\\'': 'ctranspose'\n    };\n    while ((0, _object.hasOwnProperty)(operators, 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    return node;\n  }\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.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  function parseCustomNodes(state) {\n    var params = [];\n    if (state.tokenType === TOKENTYPE.SYMBOL && (0, _object.hasOwnProperty)(state.extraNodes, state.token)) {\n      var CustomNode = state.extraNodes[state.token];\n      getToken(state);\n\n      // parse parameters\n      if (state.token === '(') {\n        params = [];\n        openParams(state);\n        getToken(state);\n        if (state.token !== ')') {\n          params.push(parseAssignment(state));\n\n          // parse a list with parameters\n          while (state.token === ',') {\n            // eslint-disable-line no-unmodified-loop-condition\n            getToken(state);\n            params.push(parseAssignment(state));\n          }\n        }\n        if (state.token !== ')') {\n          throw createSyntaxError(state, 'Parenthesis ) expected');\n        }\n        closeParams(state);\n        getToken(state);\n      }\n\n      // create a new custom node\n      // noinspection JSValidateTypes\n      return new CustomNode(params);\n    }\n    return parseSymbol(state);\n  }\n\n  /**\n   * parse symbols: functions, variables, constants, units\n   * @return {Node} node\n   * @private\n   */\n  function parseSymbol(state) {\n    var node, name;\n    if (state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS) {\n      name = state.token;\n      getToken(state);\n      if ((0, _object.hasOwnProperty)(CONSTANTS, 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      }\n\n      // parse function parameters and matrix index\n      node = parseAccessors(state, node);\n      return node;\n    }\n    return parseDoubleQuotesString(state);\n  }\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 {Object} state\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  function parseAccessors(state, node, types) {\n    var params;\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      if (state.token === '(') {\n        if ((0, _is.isSymbolNode)(node) || (0, _is.isAccessorNode)(node)) {\n          // function invocation like fn(2, 3) or obj.fn(2, 3)\n          openParams(state);\n          getToken(state);\n          if (state.token !== ')') {\n            params.push(parseAssignment(state));\n\n            // parse a list with parameters\n            while (state.token === ',') {\n              // eslint-disable-line no-unmodified-loop-condition\n              getToken(state);\n              params.push(parseAssignment(state));\n            }\n          }\n          if (state.token !== ')') {\n            throw createSyntaxError(state, 'Parenthesis ) expected');\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        if (state.token !== ']') {\n          params.push(parseAssignment(state));\n\n          // parse a list with parameters\n          while (state.token === ',') {\n            // eslint-disable-line no-unmodified-loop-condition\n            getToken(state);\n            params.push(parseAssignment(state));\n          }\n        }\n        if (state.token !== ']') {\n          throw createSyntaxError(state, 'Parenthesis ] expected');\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        if (state.tokenType !== TOKENTYPE.SYMBOL) {\n          throw createSyntaxError(state, 'Property name expected after dot');\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    return node;\n  }\n\n  /**\n   * Parse a double quotes string.\n   * @return {Node} node\n   * @private\n   */\n  function parseDoubleQuotesString(state) {\n    var node, str;\n    if (state.token === '\"') {\n      str = parseDoubleQuotesStringToken(state);\n\n      // create constant\n      node = new ConstantNode(str);\n\n      // parse index parameters\n      node = parseAccessors(state, node);\n      return node;\n    }\n    return parseSingleQuotesString(state);\n  }\n\n  /**\n   * Parse a string surrounded by double quotes \"...\"\n   * @return {string}\n   */\n  function parseDoubleQuotesStringToken(state) {\n    var str = '';\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      str += currentCharacter(state);\n      next(state);\n    }\n    getToken(state);\n    if (state.token !== '\"') {\n      throw createSyntaxError(state, 'End of string \" expected');\n    }\n    getToken(state);\n    return JSON.parse('\"' + str + '\"'); // unescape escaped characters\n  }\n\n  /**\n   * Parse a single quotes string.\n   * @return {Node} node\n   * @private\n   */\n  function parseSingleQuotesString(state) {\n    var node, str;\n    if (state.token === '\\'') {\n      str = parseSingleQuotesStringToken(state);\n\n      // create constant\n      node = new ConstantNode(str);\n\n      // parse index parameters\n      node = parseAccessors(state, node);\n      return node;\n    }\n    return parseMatrix(state);\n  }\n\n  /**\n   * Parse a string surrounded by single quotes '...'\n   * @return {string}\n   */\n  function parseSingleQuotesStringToken(state) {\n    var str = '';\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      str += currentCharacter(state);\n      next(state);\n    }\n    getToken(state);\n    if (state.token !== '\\'') {\n      throw createSyntaxError(state, 'End of string \\' expected');\n    }\n    getToken(state);\n    return JSON.parse('\"' + str + '\"'); // unescape escaped characters\n  }\n\n  /**\n   * parse the matrix\n   * @return {Node} node\n   * @private\n   */\n  function parseMatrix(state) {\n    var array, params, rows, cols;\n    if (state.token === '[') {\n      // matrix [...]\n      openParams(state);\n      getToken(state);\n      if (state.token !== ']') {\n        // this is a non-empty matrix\n        var row = parseRow(state);\n        if (state.token === ';') {\n          // 2 dimensional array\n          rows = 1;\n          params = [row];\n\n          // the rows of the matrix are separated by dot-comma's\n          while (state.token === ';') {\n            // eslint-disable-line no-unmodified-loop-condition\n            getToken(state);\n            params[rows] = parseRow(state);\n            rows++;\n          }\n          if (state.token !== ']') {\n            throw createSyntaxError(state, 'End of matrix ] expected');\n          }\n          closeParams(state);\n          getToken(state);\n\n          // check if the number of columns matches in all rows\n          cols = params[0].items.length;\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          array = new ArrayNode(params);\n        } else {\n          // 1 dimensional vector\n          if (state.token !== ']') {\n            throw createSyntaxError(state, 'End of matrix ] expected');\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      return parseAccessors(state, array);\n    }\n    return parseObject(state);\n  }\n\n  /**\n   * Parse a single comma-separated row from a matrix, like 'a, b, c'\n   * @return {ArrayNode} node\n   */\n  function parseRow(state) {\n    var params = [parseAssignment(state)];\n    var len = 1;\n    while (state.token === ',') {\n      // eslint-disable-line no-unmodified-loop-condition\n      getToken(state);\n\n      // parse expression\n      params[len] = parseAssignment(state);\n      len++;\n    }\n    return new ArrayNode(params);\n  }\n\n  /**\n   * parse an object, enclosed in angle brackets{...}, for example {value: 2}\n   * @return {Node} node\n   * @private\n   */\n  function parseObject(state) {\n    if (state.token === '{') {\n      openParams(state);\n      var key;\n      var properties = {};\n      do {\n        getToken(state);\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 || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS) {\n            key = state.token;\n            getToken(state);\n          } else {\n            throw createSyntaxError(state, 'Symbol or string expected as object key');\n          }\n\n          // parse key/value separator\n          if (state.token !== ':') {\n            throw createSyntaxError(state, 'Colon : expected after object key');\n          }\n          getToken(state);\n\n          // parse key\n          properties[key] = parseAssignment(state);\n        }\n      } while (state.token === ','); // eslint-disable-line no-unmodified-loop-condition\n\n      if (state.token !== '}') {\n        throw createSyntaxError(state, 'Comma , or bracket } expected after object value');\n      }\n      closeParams(state);\n      getToken(state);\n      var node = new ObjectNode(properties);\n\n      // parse index parameters\n      node = parseAccessors(state, node);\n      return node;\n    }\n    return parseNumber(state);\n  }\n\n  /**\n   * parse a number\n   * @return {Node} node\n   * @private\n   */\n  function parseNumber(state) {\n    var numberStr;\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    return parseParentheses(state);\n  }\n\n  /**\n   * parentheses\n   * @return {Node} node\n   * @private\n   */\n  function parseParentheses(state) {\n    var node;\n\n    // check if it is a parenthesized expression\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      closeParams(state);\n      getToken(state);\n      node = new ParenthesisNode(node);\n      node = parseAccessors(state, node);\n      return node;\n    }\n    return parseEnd(state);\n  }\n\n  /**\n   * Evaluated when the expression is not yet ended but expected to end\n   * @return {Node} res\n   * @private\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  /**\n   * Shortcut for getting the current row value (one based)\n   * Returns the line of the currently handled expression\n   * @private\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  function col(state) {\n    return state.index - state.token.length + 1;\n  }\n\n  /**\n   * Create an error\n   * @param {Object} state\n   * @param {string} message\n   * @return {SyntaxError} instantiated error\n   * @private\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  /**\n   * Create an error\n   * @param {Object} state\n   * @param {string} message\n   * @return {Error} instantiated error\n   * @private\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  // Now that we can parse, automatically convert strings to Nodes by parsing\n  typed.addConversion({\n    from: 'string',\n    to: 'Node',\n    convert: parse\n  });\n  return parse;\n});\nexports.createParse = createParse;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCompile = void 0;\nvar _collection = require(\"../../utils/collection.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'compile';\nvar dependencies = ['typed', 'parse'];\nvar createCompile = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    parse = _ref.parse;\n  /**\n   * Parse and compile an expression.\n   * Returns a an object with a function `evaluate([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.evaluate() // 5\n   *\n   *     let scope = {a: 3, b: 4}\n   *     const code2 = math.compile('a * b') // 12\n   *     code2.evaluate(scope) // 12\n   *     scope.a = 5\n   *     code2.evaluate(scope) // 20\n   *\n   *     const nodes = math.compile(['a = 3', 'b = 4', 'a * b'])\n   *     nodes[2].evaluate() // 12\n   *\n   * See also:\n   *\n   *    parse, evaluate\n   *\n   * @param {string | string[] | Array | Matrix} expr\n   *            The expression to be compiled\n   * @return {{evaluate: Function} | Array.<{evaluate: Function}>} code\n   *            An object with the compiled expression\n   * @throws {Error}\n   */\n  return typed(name, {\n    string: function string(expr) {\n      return parse(expr).compile();\n    },\n    'Array | Matrix': function ArrayMatrix(expr) {\n      return (0, _collection.deepMap)(expr, function (entry) {\n        return parse(entry).compile();\n      });\n    }\n  });\n});\nexports.createCompile = createCompile;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createEvaluate = void 0;\nvar _collection = require(\"../../utils/collection.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _map = require(\"../../utils/map.js\");\nvar name = 'evaluate';\nvar dependencies = ['typed', 'parse'];\nvar createEvaluate = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    parse = _ref.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.evaluate(expr)\n   *     math.evaluate(expr, scope)\n   *     math.evaluate([expr1, expr2, expr3, ...])\n   *     math.evaluate([expr1, expr2, expr3, ...], scope)\n   *\n   * Example:\n   *\n   *     math.evaluate('(2+3)/4')                // 1.25\n   *     math.evaluate('sqrt(3^2 + 4^2)')        // 5\n   *     math.evaluate('sqrt(-4)')               // 2i\n   *     math.evaluate(['a=3', 'b=4', 'a*b'])    // [3, 4, 12]\n   *\n   *     let scope = {a:3, b:4}\n   *     math.evaluate('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  return typed(name, {\n    string: function string(expr) {\n      var scope = (0, _map.createEmptyMap)();\n      return parse(expr).compile().evaluate(scope);\n    },\n    'string, Map | Object': function stringMapObject(expr, scope) {\n      return parse(expr).compile().evaluate(scope);\n    },\n    'Array | Matrix': function ArrayMatrix(expr) {\n      var scope = (0, _map.createEmptyMap)();\n      return (0, _collection.deepMap)(expr, function (entry) {\n        return parse(entry).compile().evaluate(scope);\n      });\n    },\n    'Array | Matrix, Map | Object': function ArrayMatrixMapObject(expr, scope) {\n      return (0, _collection.deepMap)(expr, function (entry) {\n        return parse(entry).compile().evaluate(scope);\n      });\n    }\n  });\n});\nexports.createEvaluate = createEvaluate;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createParserClass = void 0;\nvar _factory = require(\"../utils/factory.js\");\nvar _map = require(\"../utils/map.js\");\nvar name = 'Parser';\nvar dependencies = ['evaluate'];\nvar createParserClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var evaluate = _ref.evaluate;\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.evaluate(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.evaluate('sqrt(3^2 + 4^2)')        // 5\n   *    parser.evaluate('sqrt(-4)')               // 2i\n   *    parser.evaluate('2 inch in cm')           // 5.08 cm\n   *    parser.evaluate('cos(45 deg)')            // 0.7071067811865476\n   *\n   *    // define variables and functions\n   *    parser.evaluate('x = 7 / 2')              // 3.5\n   *    parser.evaluate('x + 3')                  // 6.5\n   *    parser.evaluate('f(x, y) = x^y')          // f(x, y)\n   *    parser.evaluate('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.evaluate('h / 2')        // 250\n   *    parser.set('hello', function (name) {\n   *        return 'hello, ' + name + '!'\n   *    })\n   *    parser.evaluate('hello(\"user\")')          // \"hello, user!\"\n   *\n   *    // clear defined functions and variables\n   *    parser.clear()\n   *\n   */\n  function Parser() {\n    if (!(this instanceof Parser)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n    Object.defineProperty(this, 'scope', {\n      value: (0, _map.createEmptyMap)(),\n      writable: false\n    });\n  }\n\n  /**\n   * Attach type information\n   */\n  Parser.prototype.type = 'Parser';\n  Parser.prototype.isParser = true;\n\n  /**\n   * Parse and evaluate the given expression\n   * @param {string | string[]} expr   A string containing an expression,\n   *                                   for example \"2+3\", or a list with expressions\n   * @return {*} result     The result, or undefined when the expression was empty\n   * @throws {Error}\n   */\n  Parser.prototype.evaluate = function (expr) {\n    // TODO: validate arguments\n    return evaluate(expr, this.scope);\n  };\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  Parser.prototype.get = function (name) {\n    // TODO: validate arguments\n    if (this.scope.has(name)) {\n      return this.scope.get(name);\n    }\n  };\n\n  /**\n   * Get a map with all defined variables\n   * @return {Object} values\n   */\n  Parser.prototype.getAll = function () {\n    return (0, _map.toObject)(this.scope);\n  };\n\n  /**\n   * Get a map with all defined variables\n   * @return {Map} values\n   */\n  Parser.prototype.getAllAsMap = function () {\n    return this.scope;\n  };\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  Parser.prototype.set = function (name, value) {\n    this.scope.set(name, value);\n    return value;\n  };\n\n  /**\n   * Remove a variable from the parsers scope\n   * @param {string} name\n   */\n  Parser.prototype.remove = function (name) {\n    this.scope[\"delete\"](name);\n  };\n\n  /**\n   * Clear the scope with variables and functions\n   */\n  Parser.prototype.clear = function () {\n    this.scope.clear();\n  };\n  return Parser;\n}, {\n  isClass: true\n});\nexports.createParserClass = createParserClass;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createParser = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'parser';\nvar dependencies = ['typed', 'Parser'];\nvar createParser = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    Parser = _ref.Parser;\n  /**\n   * Create a parser. The function creates a new `math.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.evaluate('sqrt(3^2 + 4^2)') // 5\n   *     const b = parser.evaluate('sqrt(-4)')        // 2i\n   *     const c = parser.evaluate('2 inch in cm')    // 5.08 cm\n   *     const d = parser.evaluate('cos(45 deg)')     // 0.7071067811865476\n   *\n   *     // define variables and functions\n   *     parser.evaluate('x = 7 / 2')             // 3.5\n   *     parser.evaluate('x + 3')                 // 6.5\n   *     parser.evaluate('f(x, y) = x^y')         // f(x, y)\n   *     parser.evaluate('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.evaluate('h / 2')       // 250\n   *     parser.set('hello', function (name) {\n   *       return 'hello, ' + name + '!'\n   *     })\n   *     parser.evaluate('hello(\"user\")')         // \"hello, user!\"\n   *\n   *     // clear defined functions and variables\n   *     parser.clear()\n   *\n   * See also:\n   *\n   *    evaluate, compile, parse\n   *\n   * @return {Parser} Parser\n   */\n  return typed(name, {\n    '': function _() {\n      return new Parser();\n    }\n  });\n});\nexports.createParser = createParser;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createLup = void 0;\nvar _object = require(\"../../../utils/object.js\");\nvar _factory = require(\"../../../utils/factory.js\");\nvar name = 'lup';\nvar dependencies = ['typed', 'matrix', 'abs', 'addScalar', 'divideScalar', 'multiplyScalar', 'subtract', 'larger', 'equalScalar', 'unaryMinus', 'DenseMatrix', 'SparseMatrix', 'Spa'];\nvar createLup = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    abs = _ref.abs,\n    addScalar = _ref.addScalar,\n    divideScalar = _ref.divideScalar,\n    multiplyScalar = _ref.multiplyScalar,\n    subtract = _ref.subtract,\n    larger = _ref.larger,\n    equalScalar = _ref.equalScalar,\n    unaryMinus = _ref.unaryMinus,\n    DenseMatrix = _ref.DenseMatrix,\n    SparseMatrix = _ref.SparseMatrix,\n    Spa = _ref.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  return typed(name, {\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);\n      // lup, use matrix implementation\n      var r = _denseLUP(m);\n      // result\n      return {\n        L: r.L.valueOf(),\n        U: r.U.valueOf(),\n        p: r.p\n      };\n    }\n  });\n  function _denseLUP(m) {\n    // rows & columns\n    var rows = m._size[0];\n    var columns = m._size[1];\n    // minimum rows and columns\n    var n = Math.min(rows, columns);\n    // matrix array, clone original data\n    var data = (0, _object.clone)(m._data);\n    // l matrix arrays\n    var ldata = [];\n    var lsize = [rows, n];\n    // u matrix arrays\n    var udata = [];\n    var usize = [n, columns];\n    // vars\n    var i, j, k;\n    // permutation vector\n    var p = [];\n    for (i = 0; i < rows; i++) {\n      p[i] = i;\n    }\n    // loop columns\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);\n          // v[i, j]\n          var s = 0;\n          // loop up to min\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          data[i][j] = subtract(data[i][j], s);\n        }\n      }\n      // row with larger value in cvector, row >= j\n      var pi = j;\n      var pabsv = 0;\n      var vjj = 0;\n      // loop rows\n      for (i = j; i < rows; i++) {\n        // data @ i, j\n        var v = data[i][j];\n        // absolute value\n        var absv = abs(v);\n        // value is greater than pivote value\n        if (larger(absv, pabsv)) {\n          // store row\n          pi = i;\n          // update max value\n          pabsv = absv;\n          // value @ [j, j]\n          vjj = v;\n        }\n      }\n      // swap rows (j <-> pi)\n      if (j !== pi) {\n        // swap values j <-> pi in p\n        p[j] = [p[pi], p[pi] = p[j]][0];\n        // swap j <-> pi in data\n        DenseMatrix._swapRows(j, pi, data);\n      }\n      // check column is in lower triangular matrix\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          if (!equalScalar(vij, 0)) {\n            // update data\n            data[i][j] = divideScalar(data[i][j], vjj);\n          }\n        }\n      }\n    }\n    // loop columns\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          }\n          // L\n          ldata[i] = [];\n        }\n        // check we are in the upper triangular matrix\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          }\n          // check column exists in lower triangular matrix\n          if (j < rows) {\n            // L\n            ldata[i][j] = 0;\n          }\n          continue;\n        }\n        // diagonal value\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          }\n          // check column exists in lower triangular matrix\n          if (j < rows) {\n            // L\n            ldata[i][j] = 1;\n          }\n          continue;\n        }\n        // check row exists in upper triangular matrix\n        if (i < columns) {\n          // U\n          udata[i][j] = 0;\n        }\n        // check column exists in lower triangular matrix\n        if (j < rows) {\n          // L\n          ldata[i][j] = data[i][j];\n        }\n      }\n    }\n    // l matrix\n    var l = new DenseMatrix({\n      data: ldata,\n      size: lsize\n    });\n    // u matrix\n    var u = new DenseMatrix({\n      data: udata,\n      size: usize\n    });\n    // p vector\n    var pv = [];\n    for (i = 0, n = p.length; i < n; i++) {\n      pv[p[i]] = i;\n    }\n    // return matrices\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  function _sparseLUP(m) {\n    // rows & columns\n    var rows = m._size[0];\n    var columns = m._size[1];\n    // minimum rows and columns\n    var n = Math.min(rows, columns);\n    // matrix arrays (will not be modified, thanks to permutation vector)\n    var values = m._values;\n    var index = m._index;\n    var ptr = m._ptr;\n    // l matrix arrays\n    var lvalues = [];\n    var lindex = [];\n    var lptr = [];\n    var lsize = [rows, n];\n    // u matrix arrays\n    var uvalues = [];\n    var uindex = [];\n    var uptr = [];\n    var usize = [n, columns];\n    // vars\n    var i, j, k;\n    // permutation vectors, (current index -> original index) and (original index -> current index)\n    var pvCo = [];\n    var pvOc = [];\n    for (i = 0; i < rows; i++) {\n      pvCo[i] = i;\n      pvOc[i] = i;\n    }\n    // swap indices in permutation vectors (condition x < y)!\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];\n      // update permutation vector current -> original\n      pvCo[kx] = y;\n      pvCo[ky] = x;\n      // update permutation vector original -> current\n      pvOc[x] = ky;\n      pvOc[y] = kx;\n    };\n    // loop columns\n    var _loop = function _loop() {\n      // sparse accumulator\n      var spa = new Spa();\n      // check lower triangular matrix has a value @ column j\n      if (j < rows) {\n        // update ptr\n        lptr.push(lvalues.length);\n        // first value in j column for lower triangular matrix\n        lvalues.push(1);\n        lindex.push(j);\n      }\n      // update ptr\n      uptr.push(uvalues.length);\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      var k0 = ptr[j];\n      var k1 = ptr[j + 1];\n      // copy column j into sparse accumulator\n      for (k = k0; k < k1; k++) {\n        // row\n        i = index[k];\n        // copy column values into sparse accumulator (use permutation vector)\n        spa.set(pvCo[i], values[k]);\n      }\n      // skip first column in upper triangular matrix\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      }\n      // row with larger value in spa, row >= j\n      var pi = j;\n      var vjj = spa.get(j);\n      var pabsv = abs(vjj);\n      // loop values in spa (order by row, below diagonal)\n      spa.forEach(j + 1, rows - 1, function (x, v) {\n        // absolute value\n        var absv = abs(v);\n        // value is greater than pivote value\n        if (larger(absv, pabsv)) {\n          // store row\n          pi = x;\n          // update max value\n          pabsv = absv;\n          // value @ [j, j]\n          vjj = v;\n        }\n      });\n      // swap rows (j <-> pi)\n      if (j !== pi) {\n        // swap values j <-> pi in L\n        SparseMatrix._swapRows(j, pi, lsize[1], lvalues, lindex, lptr);\n        // swap values j <-> pi in U\n        SparseMatrix._swapRows(j, pi, usize[1], uvalues, uindex, uptr);\n        // swap values in spa\n        spa.swap(j, pi);\n        // update permutation vector (swap values @ j, pi)\n        swapIndeces(j, pi);\n      }\n      // loop values in spa (order by row)\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);\n          // check value is non zero\n          if (!equalScalar(v, 0)) {\n            // update lower triangular matrix\n            lvalues.push(v);\n            lindex.push(x);\n          }\n        }\n      });\n    };\n    for (j = 0; j < columns; j++) {\n      _loop();\n    }\n    // update ptrs\n    uptr.push(uvalues.length);\n    lptr.push(lvalues.length);\n\n    // return matrices\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});\nexports.createLup = createLup;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createQr = void 0;\nvar _extends2 = _interopRequireDefault(require(\"@babel/runtime/helpers/extends\"));\nvar _factory = require(\"../../../utils/factory.js\");\nvar name = 'qr';\nvar dependencies = ['typed', 'matrix', 'zeros', 'identity', 'isZero', 'equal', 'sign', 'sqrt', 'conj', 'unaryMinus', 'addScalar', 'divideScalar', 'multiplyScalar', 'subtract', 'complex'];\nvar createQr = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    zeros = _ref.zeros,\n    identity = _ref.identity,\n    isZero = _ref.isZero,\n    equal = _ref.equal,\n    sign = _ref.sign,\n    sqrt = _ref.sqrt,\n    conj = _ref.conj,\n    unaryMinus = _ref.unaryMinus,\n    addScalar = _ref.addScalar,\n    divideScalar = _ref.divideScalar,\n    multiplyScalar = _ref.multiplyScalar,\n    subtract = _ref.subtract,\n    complex = _ref.complex;\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  return (0, _extends2[\"default\"])(typed(name, {\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);\n      // lup, use matrix implementation\n      var r = _denseQR(m);\n      // result\n      return {\n        Q: r.Q.valueOf(),\n        R: r.R.valueOf()\n      };\n    }\n  }), {\n    _denseQRimpl: _denseQRimpl\n  });\n  function _denseQRimpl(m) {\n    // rows & columns (m x n)\n    var rows = m._size[0]; // m\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;\n\n    // vars\n    var i, j, k;\n    var w = zeros([rows], '');\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\n      var pivot = Rdata[k][k];\n      var sgn = unaryMinus(equal(pivot, 0) ? 1 : sign(pivot));\n      var conjSgn = conj(sgn);\n      var alphaSquared = 0;\n      for (i = k; i < rows; i++) {\n        alphaSquared = addScalar(alphaSquared, multiplyScalar(Rdata[i][k], conj(Rdata[i][k])));\n      }\n      var alpha = multiplyScalar(sgn, sqrt(alphaSquared));\n      if (!isZero(alpha)) {\n        // first element in vector u\n        var u1 = subtract(pivot, alpha);\n\n        // w = v * u1 / |u|    (only elements k to (rows-1) are used)\n        w[k] = 1;\n        for (i = k + 1; i < rows; i++) {\n          w[i] = divideScalar(Rdata[i][k], u1);\n        }\n\n        // tau = - conj(u1 / alpha)\n        var tau = unaryMinus(conj(divideScalar(u1, alpha)));\n        var s = void 0;\n\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        for (j = k; j < cols; j++) {\n          s = 0.0;\n\n          // calculate jth element of [tranpose(w) * R]\n          for (i = k; i < rows; i++) {\n            s = addScalar(s, multiplyScalar(conj(w[i]), Rdata[i][j]));\n          }\n\n          // calculate the jth element of [tau * transpose(w) * R]\n          s = multiplyScalar(s, tau);\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        for (i = 0; i < rows; i++) {\n          s = 0.0;\n\n          // calculate ith element of [Q * w]\n          for (j = k; j < rows; j++) {\n            s = addScalar(s, multiplyScalar(Qdata[i][j], w[j]));\n          }\n\n          // calculate the ith element of [tau * Q * w]\n          s = multiplyScalar(s, tau);\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    }\n\n    // return matrices\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  function _denseQR(m) {\n    var ret = _denseQRimpl(m);\n    var Rdata = ret.R._data;\n    if (m._data.length > 0) {\n      var zero = Rdata[0][0].type === 'Complex' ? complex(0) : 0;\n      for (var i = 0; i < Rdata.length; ++i) {\n        for (var j = 0; j < i && j < (Rdata[0] || []).length; ++j) {\n          Rdata[i][j] = zero;\n        }\n      }\n    }\n    return ret;\n  }\n  function _sparseQR(m) {\n    throw new Error('qr not implemented for sparse matrices yet');\n  }\n});\nexports.createQr = createQr;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.csPermute = csPermute;\n/**\n * Permutes a sparse matrix C = P * A * Q\n *\n * @param {SparseMatrix}  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 */\nfunction 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;\n  // rows & columns\n  var m = asize[0];\n  var n = asize[1];\n  // c arrays\n  var cvalues = values && a._values ? [] : null;\n  var cindex = []; // (aptr[n])\n  var cptr = []; // (n + 1)\n  // initialize vars\n  var nz = 0;\n  // loop columns\n  for (var k = 0; k < n; k++) {\n    // column k of C is column q[k] of A\n    cptr[k] = nz;\n    // apply column permutation\n    var j = q ? q[k] : k;\n    // loop values in column j of A\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];\n      // index\n      cindex[nz] = r;\n      // check we need to populate values\n      if (cvalues) {\n        cvalues[nz] = avalues[t];\n      }\n      // increment number of nonzero elements\n      nz++;\n    }\n  }\n  // finalize the last column of C\n  cptr[n] = nz;\n  // return C matrix\n  return a.createSparseMatrix({\n    values: cvalues,\n    index: cindex,\n    ptr: cptr,\n    size: [m, n],\n    datatype: adt\n  });\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.csTdfs = csTdfs;\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 */\nfunction csTdfs(j, k, w, head, next, post, stack) {\n  // variables\n  var top = 0;\n  // place j on the stack\n  w[stack] = j;\n  // while (stack is not empty)\n  while (top >= 0) {\n    // p = top of stack\n    var p = w[stack + top];\n    // i = youngest child of p\n    var i = w[head + p];\n    if (i === -1) {\n      // p has no unordered children left\n      top--;\n      // node p is the kth postordered node\n      post[k++] = p;\n    } else {\n      // remove i from children of p\n      w[head + p] = w[next + i];\n      // increment top\n      ++top;\n      // start dfs on child node i\n      w[stack + top] = i;\n    }\n  }\n  return k;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.csPost = csPost;\nvar _csTdfs = require(\"./csTdfs.js\");\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 */\nfunction csPost(parent, n) {\n  // check inputs\n  if (!parent) {\n    return null;\n  }\n  // vars\n  var k = 0;\n  var j;\n  // allocate result\n  var post = []; // (n)\n  // workspace, head: first n entries, next: next n entries, stack: last n entries\n  var w = []; // (3 * n)\n  var head = 0;\n  var next = n;\n  var stack = 2 * n;\n  // initialize workspace\n  for (j = 0; j < n; j++) {\n    // empty linked lists\n    w[head + j] = -1;\n  }\n  // traverse nodes in reverse order\n  for (j = n - 1; j >= 0; j--) {\n    // check j is a root\n    if (parent[j] === -1) {\n      continue;\n    }\n    // add j to list of its parent\n    w[next + j] = w[head + parent[j]];\n    w[head + parent[j]] = j;\n  }\n  // loop nodes\n  for (j = 0; j < n; j++) {\n    // skip j if it is not a root\n    if (parent[j] !== -1) {\n      continue;\n    }\n    // depth-first search\n    k = (0, _csTdfs.csTdfs)(j, k, w, head, next, post, stack);\n  }\n  return post;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.csEtree = csEtree;\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 */\nfunction csEtree(a, ata) {\n  // check inputs\n  if (!a) {\n    return null;\n  }\n  // a arrays\n  var aindex = a._index;\n  var aptr = a._ptr;\n  var asize = a._size;\n  // rows & columns\n  var m = asize[0];\n  var n = asize[1];\n\n  // allocate result\n  var parent = []; // (n)\n\n  // allocate workspace\n  var w = []; // (n + (ata ? m : 0))\n  var ancestor = 0; // first n entries in w\n  var prev = n; // last m entries (ata = true)\n\n  var i, inext;\n\n  // check we are calculating A'A\n  if (ata) {\n    // initialize workspace\n    for (i = 0; i < m; i++) {\n      w[prev + i] = -1;\n    }\n  }\n  // loop columns\n  for (var k = 0; k < n; k++) {\n    // node k has no parent yet\n    parent[k] = -1;\n    // nor does k have an ancestor\n    w[ancestor + k] = -1;\n    // values in column k\n    for (var p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {\n      // row\n      var r = aindex[p];\n      // node\n      i = ata ? w[prev + r] : r;\n      // traverse from i to k\n      for (; i !== -1 && i < k; i = inext) {\n        // inext = ancestor of i\n        inext = w[ancestor + i];\n        // path compression\n        w[ancestor + i] = k;\n        // check no anc., parent is k\n        if (inext === -1) {\n          parent[i] = k;\n        }\n      }\n      if (ata) {\n        w[prev + r] = k;\n      }\n    }\n  }\n  return parent;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.csFkeep = csFkeep;\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 */\nfunction 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;\n  // columns\n  var n = asize[1];\n  // nonzero items\n  var nz = 0;\n  // loop columns\n  for (var j = 0; j < n; j++) {\n    // get current location of col j\n    var p = aptr[j];\n    // record new location of col j\n    aptr[j] = nz;\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];\n        // check we need to process values (pattern only)\n        if (avalues) {\n          avalues[nz] = avalues[p];\n        }\n        // increment nonzero items\n        nz++;\n      }\n    }\n  }\n  // finalize A\n  aptr[n] = nz;\n  // trim arrays\n  aindex.splice(nz, aindex.length - nz);\n  // check we need to process values (pattern only)\n  if (avalues) {\n    avalues.splice(nz, avalues.length - nz);\n  }\n  // return number of nonzero items\n  return nz;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.csFlip = csFlip;\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 */\nfunction csFlip(i) {\n  // flip the value\n  return -i - 2;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCsAmd = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar _csFkeep = require(\"./csFkeep.js\");\nvar _csFlip = require(\"./csFlip.js\");\nvar _csTdfs = require(\"./csTdfs.js\");\nvar name = 'csAmd';\nvar dependencies = ['add', 'multiply', 'transpose'];\nvar createCsAmd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var add = _ref.add,\n    multiply = _ref.multiply,\n    transpose = _ref.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  return function csAmd(order, a) {\n    // check input parameters\n    if (!a || order <= 0 || order > 3) {\n      return null;\n    }\n    // a matrix arrays\n    var asize = a._size;\n    // rows and columns\n    var m = asize[0];\n    var n = asize[1];\n    // initialize vars\n    var lemax = 0;\n    // dense threshold\n    var dense = Math.max(16, 10 * Math.sqrt(n));\n    dense = Math.min(n - 2, dense);\n    // create target matrix C\n    var cm = _createTargetMatrix(order, a, m, n, dense);\n    // drop diagonal entries\n    (0, _csFkeep.csFkeep)(cm, _diag, null);\n    // C matrix arrays\n    var cindex = cm._index;\n    var cptr = cm._ptr;\n\n    // number of nonzero elements in C\n    var cnz = cptr[n];\n\n    // allocate result (n+1)\n    var P = [];\n\n    // create workspace (8 * (n + 1))\n    var W = [];\n    var len = 0; // first n + 1 entries\n    var nv = n + 1; // next n + 1 entries\n    var next = 2 * (n + 1); // next n + 1 entries\n    var head = 3 * (n + 1); // next n + 1 entries\n    var elen = 4 * (n + 1); // next n + 1 entries\n    var degree = 5 * (n + 1); // next n + 1 entries\n    var w = 6 * (n + 1); // next n + 1 entries\n    var hhead = 7 * (n + 1); // last n + 1 entries\n\n    // use P as workspace for last\n    var last = P;\n\n    // initialize quotient graph\n    var mark = _initializeQuotientGraph(n, cptr, W, len, head, last, next, hhead, nv, w, elen, degree);\n\n    // initialize degree lists\n    var nel = _initializeDegreeLists(n, cptr, W, degree, elen, w, dense, nv, head, last, next);\n\n    // minimum degree node\n    var mindeg = 0;\n\n    // vars\n    var i, j, k, k1, k2, e, pj, ln, nvi, pk, eln, p1, p2, pn, h, d;\n\n    // while (selecting pivots) do\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      if (W[next + k] !== -1) {\n        last[W[next + k]] = -1;\n      }\n      // remove k from degree list\n      W[head + mindeg] = W[next + k];\n      // elenk = |Ek|\n      var elenk = W[elen + k];\n      // # of nodes k represents\n      var nvk = W[nv + k];\n      // W[nv + k] nodes of A eliminated\n      nel += nvk;\n\n      // 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      var dk = 0;\n      // flag k as in Lk\n      W[nv + k] = -nvk;\n      var p = cptr[k];\n      // do in place if W[elen + k] === 0\n      var pk1 = elenk === 0 ? p : cnz;\n      var pk2 = pk1;\n      for (k1 = 1; k1 <= elenk + 1; k1++) {\n        if (k1 > elenk) {\n          // search the nodes in k\n          e = k;\n          // list of nodes starts at cindex[pj]\n          pj = p;\n          // length of list of nodes in k\n          ln = W[len + k] - elenk;\n        } else {\n          // search the nodes in e\n          e = cindex[p++];\n          pj = cptr[e];\n          // length of list of nodes in e\n          ln = W[len + e];\n        }\n        for (k2 = 1; k2 <= ln; k2++) {\n          i = cindex[pj++];\n          // check  node i dead, or seen\n          if ((nvi = W[nv + i]) <= 0) {\n            continue;\n          }\n          // W[degree + Lk] += size of node i\n          dk += nvi;\n          // negate W[nv + i] to denote i in Lk\n          W[nv + i] = -nvi;\n          // place i in Lk\n          cindex[pk2++] = i;\n          if (W[next + i] !== -1) {\n            last[W[next + i]] = last[i];\n          }\n          // check we need to remove i from degree list\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        if (e !== k) {\n          // absorb e into k\n          cptr[e] = (0, _csFlip.csFlip)(k);\n          // e is now a dead element\n          W[w + e] = 0;\n        }\n      }\n      // cindex[cnz...nzmax] is free\n      if (elenk !== 0) {\n        cnz = pk2;\n      }\n      // external degree of k - |Lk\\i|\n      W[degree + k] = dk;\n      // element k is in cindex[pk1..pk2-1]\n      cptr[k] = pk1;\n      W[len + k] = pk2 - pk1;\n      // k is now an element\n      W[elen + k] = -2;\n\n      // 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\n      // clear w if necessary\n      mark = _wclear(mark, lemax, W, w, n);\n      // scan 1: find |Le\\Lk|\n      for (pk = pk1; pk < pk2; pk++) {\n        i = cindex[pk];\n        // check if W[elen + i] empty, skip it\n        if ((eln = W[elen + i]) <= 0) {\n          continue;\n        }\n        // W[nv + i] was negated\n        nvi = -W[nv + i];\n        var wnvi = mark - nvi;\n        // scan Ei\n        for (p = cptr[i], p1 = cptr[i] + eln - 1; p <= p1; p++) {\n          e = cindex[p];\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      }\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\n      // scan2: degree update\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;\n        // scan Ei\n        for (h = 0, d = 0, p = p1; p <= p2; p++) {\n          e = cindex[p];\n          // check e is an unabsorbed element\n          if (W[w + e] !== 0) {\n            // dext = |Le\\Lk|\n            var dext = W[w + e] - mark;\n            if (dext > 0) {\n              // sum up the set differences\n              d += dext;\n              // keep e in Ei\n              cindex[pn++] = e;\n              // compute the hash of node i\n              h += e;\n            } else {\n              // aggressive absorb. e->k\n              cptr[e] = (0, _csFlip.csFlip)(k);\n              // e is a dead element\n              W[w + e] = 0;\n            }\n          }\n        }\n        // W[elen + i] = |Ei|\n        W[elen + i] = pn - p1 + 1;\n        var p3 = pn;\n        var p4 = p1 + W[len + i];\n        // prune edges in Ai\n        for (p = p2 + 1; p < p4; p++) {\n          j = cindex[p];\n          // check node j dead or in Lk\n          var nvj = W[nv + j];\n          if (nvj <= 0) {\n            continue;\n          }\n          // degree(i) += |j|\n          d += nvj;\n          // place j in node list of i\n          cindex[pn++] = j;\n          // compute hash for node i\n          h += j;\n        }\n        // check for mass elimination\n        if (d === 0) {\n          // absorb i into k\n          cptr[i] = (0, _csFlip.csFlip)(k);\n          nvi = -W[nv + i];\n          // |Lk| -= |i|\n          dk -= nvi;\n          // |k| += W[nv + i]\n          nvk += nvi;\n          nel += nvi;\n          W[nv + i] = 0;\n          // node i is dead\n          W[elen + i] = -1;\n        } else {\n          // update degree(i)\n          W[degree + i] = Math.min(W[degree + i], d);\n          // move first node to end\n          cindex[pn] = cindex[p3];\n          // move 1st el. to end of Ei\n          cindex[p3] = cindex[p1];\n          // add k as 1st element in of Ei\n          cindex[p1] = k;\n          // new len of adj. list of node i\n          W[len + i] = pn - p1 + 1;\n          // finalize hash of i\n          h = (h < 0 ? -h : h) % n;\n          // place i in hash bucket\n          W[next + i] = W[hhead + h];\n          W[hhead + h] = i;\n          // save hash of i in last[i]\n          last[i] = h;\n        }\n      }\n      // finalize |Lk|\n      W[degree + k] = dk;\n      lemax = Math.max(lemax, dk);\n      // clear w\n      mark = _wclear(mark + lemax, lemax, W, w, n);\n\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      for (pk = pk1; pk < pk2; pk++) {\n        i = cindex[pk];\n        // check i is dead, skip it\n        if (W[nv + i] >= 0) {\n          continue;\n        }\n        // scan hash bucket of node i\n        h = last[i];\n        i = W[hhead + h];\n        // hash bucket will be empty\n        W[hhead + h] = -1;\n        for (; i !== -1 && W[next + i] !== -1; i = W[next + i], mark++) {\n          ln = W[len + i];\n          eln = W[elen + i];\n          for (p = cptr[i] + 1; p <= cptr[i] + ln - 1; p++) {\n            W[w + cindex[p]] = mark;\n          }\n          var jlast = i;\n          // compare i with all j\n          for (j = W[next + i]; j !== -1;) {\n            var ok = W[len + j] === ln && W[elen + j] === eln;\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            }\n            // check i and j are identical\n            if (ok) {\n              // absorb j into i\n              cptr[j] = (0, _csFlip.csFlip)(i);\n              W[nv + i] += W[nv + j];\n              W[nv + j] = 0;\n              // node j is dead\n              W[elen + j] = -1;\n              // delete j from hash bucket\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      }\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      for (p = pk1, pk = pk1; pk < pk2; pk++) {\n        i = cindex[pk];\n        // check  i is dead, skip it\n        if ((nvi = -W[nv + i]) <= 0) {\n          continue;\n        }\n        // restore W[nv + i]\n        W[nv + i] = nvi;\n        // compute external degree(i)\n        d = W[degree + i] + dk - nvi;\n        d = Math.min(d, n - nel - nvi);\n        if (W[head + d] !== -1) {\n          last[W[head + d]] = i;\n        }\n        // put i back in degree list\n        W[next + i] = W[head + d];\n        last[i] = -1;\n        W[head + d] = i;\n        // find new minimum degree\n        mindeg = Math.min(mindeg, d);\n        W[degree + i] = d;\n        // place i in Lk\n        cindex[p++] = i;\n      }\n      // # nodes absorbed into k\n      W[nv + k] = nvk;\n      // length of adj list of element k\n      if ((W[len + k] = p - pk1) === 0) {\n        // k is a root of the tree\n        cptr[k] = -1;\n        // k is now a dead element\n        W[w + k] = 0;\n      }\n      if (elenk !== 0) {\n        // free unused space in Lk\n        cnz = p;\n      }\n    }\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\n    // fix assembly tree\n    for (i = 0; i < n; i++) {\n      cptr[i] = (0, _csFlip.csFlip)(cptr[i]);\n    }\n    for (j = 0; j <= n; j++) {\n      W[head + j] = -1;\n    }\n    // place unordered nodes in lists\n    for (j = n; j >= 0; j--) {\n      // skip if j is an element\n      if (W[nv + j] > 0) {\n        continue;\n      }\n      // place j in list of its parent\n      W[next + j] = W[head + cptr[j]];\n      W[head + cptr[j]] = j;\n    }\n    // place elements in lists\n    for (e = n; e >= 0; e--) {\n      // skip unless e is an element\n      if (W[nv + e] <= 0) {\n        continue;\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    }\n    // postorder the assembly tree\n    for (k = 0, i = 0; i <= n; i++) {\n      if (cptr[i] === -1) {\n        k = (0, _csTdfs.csTdfs)(i, k, W, head, next, P, w);\n      }\n    }\n    // remove last item in array\n    P.splice(P.length - 1, 1);\n    // return P\n    return P;\n  };\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  function _createTargetMatrix(order, a, m, n, dense) {\n    // compute A'\n    var at = transpose(a);\n\n    // check order = 1, matrix must be square\n    if (order === 1 && n === m) {\n      // C = A + A'\n      return add(a, at);\n    }\n\n    // check order = 2, drop dense columns from M'\n    if (order === 2) {\n      // transpose arrays\n      var tindex = at._index;\n      var tptr = at._ptr;\n      // new column index\n      var p2 = 0;\n      // loop A' columns (rows)\n      for (var j = 0; j < m; j++) {\n        // column j of AT starts here\n        var p = tptr[j];\n        // new column j starts here\n        tptr[j] = p2;\n        // skip dense col j\n        if (tptr[j + 1] - p > dense) {\n          continue;\n        }\n        // map rows in column j of A\n        for (var p1 = tptr[j + 1]; p < p1; p++) {\n          tindex[p2++] = tindex[p];\n        }\n      }\n      // finalize AT\n      tptr[m] = p2;\n      // recreate A from new transpose matrix\n      a = transpose(at);\n      // use A' * A\n      return multiply(at, a);\n    }\n\n    // use A' * A, square or rectangular matrix\n    return multiply(at, a);\n  }\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  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    W[len + n] = 0;\n    // initialize workspace\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;\n      // hash list i is empty\n      W[hhead + i] = -1;\n      // node i is just one node\n      W[nv + i] = 1;\n      // node i is alive\n      W[w + i] = 1;\n      // Ek of node i is empty\n      W[elen + i] = 0;\n      // degree of node i\n      W[degree + i] = W[len + i];\n    }\n    // clear w\n    var mark = _wclear(0, 0, W, w, n);\n    // n is a dead element\n    W[elen + n] = -2;\n    // n is a root of assembly tree\n    cptr[n] = -1;\n    // n is a dead element\n    W[w + n] = 0;\n    // return mark\n    return mark;\n  }\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  function _initializeDegreeLists(n, cptr, W, degree, elen, w, dense, nv, head, last, next) {\n    // result\n    var nel = 0;\n    // loop columns\n    for (var i = 0; i < n; i++) {\n      // degree @ i\n      var d = W[degree + i];\n      // check node i is empty\n      if (d === 0) {\n        // element i is dead\n        W[elen + i] = -2;\n        nel++;\n        // i is a root of assembly tree\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;\n        // node i is dead\n        W[elen + i] = -1;\n        nel++;\n        cptr[i] = (0, _csFlip.csFlip)(n);\n        W[nv + n]++;\n      } else {\n        var h = W[head + d];\n        if (h !== -1) {\n          last[h] = i;\n        }\n        // put node i in degree list d\n        W[next + i] = W[head + d];\n        W[head + d] = i;\n      }\n    }\n    return nel;\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      mark = 2;\n    }\n    // at this point, W [0..n-1] < mark holds\n    return mark;\n  }\n  function _diag(i, j) {\n    return i !== j;\n  }\n});\nexports.createCsAmd = createCsAmd;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.csLeaf = csLeaf;\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 */\nfunction csLeaf(i, j, w, first, maxfirst, prevleaf, ancestor) {\n  var s, sparent;\n\n  // our result\n  var jleaf = 0;\n  var q;\n\n  // check j is a leaf\n  if (i <= j || w[first + j] <= w[maxfirst + i]) {\n    return -1;\n  }\n  // update max first[j] seen so far\n  w[maxfirst + i] = w[first + j];\n  // jprev = previous leaf of ith subtree\n  var jprev = w[prevleaf + i];\n  w[prevleaf + i] = j;\n\n  // check j is first or subsequent leaf\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;\n    // q = least common ancester (jprev,j)\n    for (q = jprev; q !== w[ancestor + q]; q = w[ancestor + q]) {\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  return {\n    jleaf: jleaf,\n    q: q\n  };\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCsCounts = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar _csLeaf = require(\"./csLeaf.js\");\nvar name = 'csCounts';\nvar dependencies = ['transpose'];\nvar createCsCounts = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var transpose = _ref.transpose;\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  return function (a, parent, post, ata) {\n    // check inputs\n    if (!a || !parent || !post) {\n      return null;\n    }\n    // a matrix arrays\n    var asize = a._size;\n    // rows and columns\n    var m = asize[0];\n    var n = asize[1];\n    // variables\n    var i, j, k, J, p, p0, p1;\n\n    // workspace size\n    var s = 4 * n + (ata ? n + m + 1 : 0);\n    // allocate workspace\n    var w = []; // (s)\n    var ancestor = 0; // first n entries\n    var maxfirst = n; // next n entries\n    var prevleaf = 2 * n; // next n entries\n    var first = 3 * n; // next n entries\n    var head = 4 * n; // next n + 1 entries (used when ata is true)\n    var next = 5 * n + 1; // last entries in workspace\n    // clear workspace w[0..s-1]\n    for (k = 0; k < s; k++) {\n      w[k] = -1;\n    }\n\n    // allocate result\n    var colcount = []; // (n)\n\n    // AT = A'\n    var at = transpose(a);\n    // at arrays\n    var tindex = at._index;\n    var tptr = at._ptr;\n\n    // find w[first + j]\n    for (k = 0; k < n; k++) {\n      j = post[k];\n      // colcount[j]=1 if j is a leaf\n      colcount[j] = w[first + j] === -1 ? 1 : 0;\n      for (; j !== -1 && w[first + j] === -1; j = parent[j]) {\n        w[first + j] = k;\n      }\n    }\n\n    // initialize ata if needed\n    if (ata) {\n      // invert post\n      for (k = 0; k < n; k++) {\n        w[post[k]] = k;\n      }\n      // loop rows (columns in AT)\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        }\n        // place row i in linked list k\n        w[next + i] = w[head + k];\n        w[head + k] = i;\n      }\n    }\n\n    // each node in its own set\n    for (i = 0; i < n; i++) {\n      w[ancestor + i] = i;\n    }\n    for (k = 0; k < n; k++) {\n      // j is the kth node in postordered etree\n      j = post[k];\n      // check j is not a root\n      if (parent[j] !== -1) {\n        colcount[parent[j]]--;\n      }\n\n      // J=j for LL'=A case\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 = (0, _csLeaf.csLeaf)(i, j, w, first, maxfirst, prevleaf, ancestor);\n          // check A(i,j) is in skeleton\n          if (r.jleaf >= 1) {\n            colcount[j]++;\n          }\n          // check account for overlap in q\n          if (r.jleaf === 2) {\n            colcount[r.q]--;\n          }\n        }\n      }\n      if (parent[j] !== -1) {\n        w[ancestor + j] = parent[j];\n      }\n    }\n    // sum up colcount's of each child\n    for (j = 0; j < n; j++) {\n      if (parent[j] !== -1) {\n        colcount[parent[j]] += colcount[j];\n      }\n    }\n    return colcount;\n  };\n});\nexports.createCsCounts = createCsCounts;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCsSqr = void 0;\nvar _csPermute = require(\"./csPermute.js\");\nvar _csPost = require(\"./csPost.js\");\nvar _csEtree = require(\"./csEtree.js\");\nvar _csAmd = require(\"./csAmd.js\");\nvar _csCounts = require(\"./csCounts.js\");\nvar _factory = require(\"../../../utils/factory.js\");\nvar name = 'csSqr';\nvar dependencies = ['add', 'multiply', 'transpose'];\nvar createCsSqr = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var add = _ref.add,\n    multiply = _ref.multiply,\n    transpose = _ref.transpose;\n  var csAmd = (0, _csAmd.createCsAmd)({\n    add: add,\n    multiply: multiply,\n    transpose: transpose\n  });\n  var csCounts = (0, _csCounts.createCsCounts)({\n    transpose: transpose\n  });\n\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  return function csSqr(order, a, qr) {\n    // a arrays\n    var aptr = a._ptr;\n    var asize = a._size;\n    // columns\n    var n = asize[1];\n    // vars\n    var k;\n    // symbolic analysis result\n    var s = {};\n    // fill-reducing ordering\n    s.q = csAmd(order, a);\n    // validate results\n    if (order && !s.q) {\n      return null;\n    }\n    // QR symbolic analysis\n    if (qr) {\n      // apply permutations if needed\n      var c = order ? (0, _csPermute.csPermute)(a, null, s.q, 0) : a;\n      // etree of C'*C, where C=A(:,q)\n      s.parent = (0, _csEtree.csEtree)(c, 1);\n      // post order elimination tree\n      var post = (0, _csPost.csPost)(s.parent, n);\n      // col counts chol(C'*C)\n      s.cp = csCounts(c, s.parent, post, 1);\n      // check we have everything needed to calculate number of nonzero elements\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    }\n    // return result S\n    return s;\n  };\n\n  /**\n   * Compute nnz(V) = s.lnz, s.pinv, s.leftmost, s.m2 from A and s.parent\n   */\n  function _vcount(a, s) {\n    // a arrays\n    var aptr = a._ptr;\n    var aindex = a._index;\n    var asize = a._size;\n    // rows & columns\n    var m = asize[0];\n    var n = asize[1];\n    // initialize s arrays\n    s.pinv = []; // (m + n)\n    s.leftmost = []; // (m)\n    // vars\n    var parent = s.parent;\n    var pinv = s.pinv;\n    var leftmost = s.leftmost;\n    // workspace, next: first m entries, head: next n entries, tail: next n entries, nque: next n entries\n    var w = []; // (m + 3 * n)\n    var next = 0;\n    var head = m;\n    var tail = m + n;\n    var nque = m + 2 * n;\n    // vars\n    var i, k, p, p0, p1;\n    // initialize w\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    }\n    // initialize row arrays\n    for (i = 0; i < m; i++) {\n      leftmost[i] = -1;\n    }\n    // loop columns backwards\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    }\n    // scan rows in reverse order\n    for (i = m - 1; i >= 0; i--) {\n      // row i is not yet ordered\n      pinv[i] = -1;\n      k = leftmost[i];\n      // check row i is empty\n      if (k === -1) {\n        continue;\n      }\n      // first row in queue k\n      if (w[nque + k]++ === 0) {\n        w[tail + k] = i;\n      }\n      // put i at head of queue k\n      w[next + i] = w[head + k];\n      w[head + k] = i;\n    }\n    s.lnz = 0;\n    s.m2 = m;\n    // find row permutation and nnz(V)\n    for (k = 0; k < n; k++) {\n      // remove row i from queue k\n      i = w[head + k];\n      // count V(k,k) as nonzero\n      s.lnz++;\n      // add a fictitious row\n      if (i < 0) {\n        i = s.m2++;\n      }\n      // associate row i with V(:,k)\n      pinv[i] = k;\n      // skip if V(k+1:m,k) is empty\n      if (--nque[k] <= 0) {\n        continue;\n      }\n      // nque[k] is nnz (V(k+1:m,k))\n      s.lnz += w[nque + k];\n      // move all rows to parent of k\n      var pa = parent[k];\n      if (pa !== -1) {\n        if (w[nque + pa] === 0) {\n          w[tail + pa] = w[tail + k];\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    for (i = 0; i < m; i++) {\n      if (pinv[i] < 0) {\n        pinv[i] = k++;\n      }\n    }\n    return true;\n  }\n});\nexports.createCsSqr = createCsSqr;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.csMarked = csMarked;\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 */\nfunction csMarked(w, j) {\n  // check node is marked\n  return w[j] < 0;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.csMark = csMark;\nvar _csFlip = require(\"./csFlip.js\");\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 */\nfunction csMark(w, j) {\n  // mark w[j]\n  w[j] = (0, _csFlip.csFlip)(w[j]);\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.csUnflip = csUnflip;\nvar _csFlip = require(\"./csFlip.js\");\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 */\nfunction csUnflip(i) {\n  // flip the value if it is negative\n  return i < 0 ? (0, _csFlip.csFlip)(i) : i;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.csDfs = csDfs;\nvar _csMarked = require(\"./csMarked.js\");\nvar _csMark = require(\"./csMark.js\");\nvar _csUnflip = require(\"./csUnflip.js\");\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 */\nfunction csDfs(j, g, top, xi, pinv) {\n  // g arrays\n  var index = g._index;\n  var ptr = g._ptr;\n  var size = g._size;\n  // columns\n  var n = size[1];\n  // vars\n  var i, p, p2;\n  // initialize head\n  var head = 0;\n  // initialize the recursion stack\n  xi[0] = j;\n  // loop\n  while (head >= 0) {\n    // get j from the top of the recursion stack\n    j = xi[head];\n    // apply permutation vector\n    var jnew = pinv ? pinv[j] : j;\n    // check node j is marked\n    if (!(0, _csMarked.csMarked)(ptr, j)) {\n      // mark node j as visited\n      (0, _csMark.csMark)(ptr, j);\n      // update stack (last n entries in xi)\n      xi[n + head] = jnew < 0 ? 0 : (0, _csUnflip.csUnflip)(ptr[jnew]);\n    }\n    // node j done if no unvisited neighbors\n    var done = 1;\n    // examine all neighbors of j, stack (last n entries in xi)\n    for (p = xi[n + head], p2 = jnew < 0 ? 0 : (0, _csUnflip.csUnflip)(ptr[jnew + 1]); p < p2; p++) {\n      // consider neighbor node i\n      i = index[p];\n      // check we have visited node i, skip it\n      if ((0, _csMarked.csMarked)(ptr, i)) {\n        continue;\n      }\n      // pause depth-first search of node j, update stack (last n entries in xi)\n      xi[n + head] = p;\n      // start dfs at node i\n      xi[++head] = i;\n      // node j is not done\n      done = 0;\n      // break, to start dfs(i)\n      break;\n    }\n    // check depth-first search at node j is done\n    if (done) {\n      // remove j from the recursion stack\n      head--;\n      // and place in the output stack\n      xi[--top] = j;\n    }\n  }\n  return top;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.csReach = csReach;\nvar _csMarked = require(\"./csMarked.js\");\nvar _csMark = require(\"./csMark.js\");\nvar _csDfs = require(\"./csDfs.js\");\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 */\nfunction csReach(g, b, k, xi, pinv) {\n  // g arrays\n  var gptr = g._ptr;\n  var gsize = g._size;\n  // b arrays\n  var bindex = b._index;\n  var bptr = b._ptr;\n  // columns\n  var n = gsize[1];\n  // vars\n  var p, p0, p1;\n  // initialize top\n  var top = n;\n  // loop column indeces in B\n  for (p0 = bptr[k], p1 = bptr[k + 1], p = p0; p < p1; p++) {\n    // node i\n    var i = bindex[p];\n    // check node i is marked\n    if (!(0, _csMarked.csMarked)(gptr, i)) {\n      // start a dfs at unmarked node i\n      top = (0, _csDfs.csDfs)(i, g, top, xi, pinv);\n    }\n  }\n  // loop columns from top -> n - 1\n  for (p = top; p < n; p++) {\n    // restore G\n    (0, _csMark.csMark)(gptr, xi[p]);\n  }\n  return top;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCsSpsolve = void 0;\nvar _csReach = require(\"./csReach.js\");\nvar _factory = require(\"../../../utils/factory.js\");\nvar name = 'csSpsolve';\nvar dependencies = ['divideScalar', 'multiply', 'subtract'];\nvar createCsSpsolve = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var divideScalar = _ref.divideScalar,\n    multiply = _ref.multiply,\n    subtract = _ref.subtract;\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  return 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;\n    // columns\n    var n = gsize[1];\n    // b arrays\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    // vars\n    var p, p0, p1, q;\n    // xi[top..n-1] = csReach(B(:,k))\n    var top = (0, _csReach.csReach)(g, b, k, xi, pinv);\n    // clear x\n    for (p = top; p < n; p++) {\n      x[xi[p]] = 0;\n    }\n    // scatter b\n    for (p0 = bptr[k], p1 = bptr[k + 1], p = p0; p < p1; p++) {\n      x[bindex[p]] = bvalues[p];\n    }\n    // loop columns\n    for (var px = top; px < n; px++) {\n      // x array index for px\n      var j = xi[px];\n      // apply permutation vector (U x = b), j maps to column J of G\n      var J = pinv ? pinv[j] : j;\n      // check column J is empty\n      if (J < 0) {\n        continue;\n      }\n      // column value indeces in G, p0 <= p < p1\n      p0 = gptr[J];\n      p1 = gptr[J + 1];\n      // x(j) /= G(j,j)\n      x[j] = divideScalar(x[j], gvalues[lo ? p0 : p1 - 1]);\n      // first entry L(j,j)\n      p = lo ? p0 + 1 : p0;\n      q = lo ? p1 : p1 - 1;\n      // loop\n      for (; p < q; p++) {\n        // row\n        var i = gindex[p];\n        // x(i) -= G(i,j) * x(j)\n        x[i] = subtract(x[i], multiply(gvalues[p], x[j]));\n      }\n    }\n    // return top of stack\n    return top;\n  };\n});\nexports.createCsSpsolve = createCsSpsolve;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCsLu = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar _csSpsolve = require(\"./csSpsolve.js\");\nvar name = 'csLu';\nvar dependencies = ['abs', 'divideScalar', 'multiply', 'subtract', 'larger', 'largerEq', 'SparseMatrix'];\nvar createCsLu = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var abs = _ref.abs,\n    divideScalar = _ref.divideScalar,\n    multiply = _ref.multiply,\n    subtract = _ref.subtract,\n    larger = _ref.larger,\n    largerEq = _ref.largerEq,\n    SparseMatrix = _ref.SparseMatrix;\n  var csSpsolve = (0, _csSpsolve.createCsSpsolve)({\n    divideScalar: divideScalar,\n    multiply: multiply,\n    subtract: subtract\n  });\n\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  return function csLu(m, s, tol) {\n    // validate input\n    if (!m) {\n      return null;\n    }\n    // m arrays\n    var size = m._size;\n    // columns\n    var n = size[1];\n    // symbolic analysis result\n    var q;\n    var lnz = 100;\n    var unz = 100;\n    // update symbolic analysis parameters\n    if (s) {\n      q = s.q;\n      lnz = s.lnz || lnz;\n      unz = s.unz || unz;\n    }\n    // L arrays\n    var lvalues = []; // (lnz)\n    var lindex = []; // (lnz)\n    var lptr = []; // (n + 1)\n    // L\n    var L = new SparseMatrix({\n      values: lvalues,\n      index: lindex,\n      ptr: lptr,\n      size: [n, n]\n    });\n    // U arrays\n    var uvalues = []; // (unz)\n    var uindex = []; // (unz)\n    var uptr = []; // (n + 1)\n    // U\n    var U = new SparseMatrix({\n      values: uvalues,\n      index: uindex,\n      ptr: uptr,\n      size: [n, n]\n    });\n    // inverse of permutation vector\n    var pinv = []; // (n)\n    // vars\n    var i, p;\n    // allocate arrays\n    var x = []; // (n)\n    var xi = []; // (2 * n)\n    // initialize variables\n    for (i = 0; i < n; i++) {\n      // clear workspace\n      x[i] = 0;\n      // no rows pivotal yet\n      pinv[i] = -1;\n      // no cols of L yet\n      lptr[i + 1] = 0;\n    }\n    // reset number of nonzero elements in L and U\n    lnz = 0;\n    unz = 0;\n    // compute L(:,k) and U(:,k)\n    for (var k = 0; k < n; k++) {\n      // update ptr\n      lptr[k] = lnz;\n      uptr[k] = unz;\n      // apply column permutations if needed\n      var col = q ? q[k] : k;\n      // solve triangular system, x = L\\A(:,col)\n      var top = csSpsolve(L, m, col, xi, x, pinv, 1);\n      // find pivot\n      var ipiv = -1;\n      var a = -1;\n      // loop xi[] from top -> n\n      for (p = top; p < n; p++) {\n        // x[i] is nonzero\n        i = xi[p];\n        // check row i is not yet pivotal\n        if (pinv[i] < 0) {\n          // absolute value of x[i]\n          var xabs = abs(x[i]);\n          // check absoulte value is greater than pivot value\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      }\n      // validate we found a valid pivot\n      if (ipiv === -1 || a <= 0) {\n        return null;\n      }\n      // update actual pivot column, give preference to diagonal value\n      if (pinv[col] < 0 && largerEq(abs(x[col]), multiply(a, tol))) {\n        ipiv = col;\n      }\n      // the chosen pivot\n      var pivot = x[ipiv];\n      // last entry in U(:,k) is U(k,k)\n      uindex[unz] = k;\n      uvalues[unz++] = pivot;\n      // ipiv is the kth pivot row\n      pinv[ipiv] = k;\n      // first entry in L(:,k) is L(k,k) = 1\n      lindex[lnz] = ipiv;\n      lvalues[lnz++] = 1;\n      // L(k+1:n,k) = x / pivot\n      for (p = top; p < n; p++) {\n        // row\n        i = xi[p];\n        // check x(i) is an entry in L(:,k)\n        if (pinv[i] < 0) {\n          // save unpermuted row in L\n          lindex[lnz] = i;\n          // scale pivot column\n          lvalues[lnz++] = divideScalar(x[i], pivot);\n        }\n        // x[0..n-1] = 0 for next k\n        x[i] = 0;\n      }\n    }\n    // update ptr\n    lptr[n] = lnz;\n    uptr[n] = unz;\n    // fix row indices of L for final pinv\n    for (p = 0; p < lnz; p++) {\n      lindex[p] = pinv[lindex[p]];\n    }\n    // trim arrays\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);\n    // return LU factor\n    return {\n      L: L,\n      U: U,\n      pinv: pinv\n    };\n  };\n});\nexports.createCsLu = createCsLu;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSlu = void 0;\nvar _number = require(\"../../../utils/number.js\");\nvar _factory = require(\"../../../utils/factory.js\");\nvar _csSqr = require(\"../sparse/csSqr.js\");\nvar _csLu = require(\"../sparse/csLu.js\");\nvar name = 'slu';\nvar dependencies = ['typed', 'abs', 'add', 'multiply', 'transpose', 'divideScalar', 'subtract', 'larger', 'largerEq', 'SparseMatrix'];\nvar createSlu = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    abs = _ref.abs,\n    add = _ref.add,\n    multiply = _ref.multiply,\n    transpose = _ref.transpose,\n    divideScalar = _ref.divideScalar,\n    subtract = _ref.subtract,\n    larger = _ref.larger,\n    largerEq = _ref.largerEq,\n    SparseMatrix = _ref.SparseMatrix;\n  var csSqr = (0, _csSqr.createCsSqr)({\n    add: add,\n    multiply: multiply,\n    transpose: transpose\n  });\n  var csLu = (0, _csLu.createCsLu)({\n    abs: abs,\n    divideScalar: divideScalar,\n    multiply: multiply,\n    subtract: subtract,\n    larger: larger,\n    largerEq: largerEq,\n    SparseMatrix: SparseMatrix\n  });\n\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  return typed(name, {\n    'SparseMatrix, number, number': function SparseMatrixNumberNumber(a, order, threshold) {\n      // verify order\n      if (!(0, _number.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      }\n      // verify threshold\n      if (threshold < 0 || threshold > 1) {\n        throw new Error('Partial pivoting threshold must be a number from 0 to 1');\n      }\n\n      // perform symbolic ordering and analysis\n      var s = csSqr(order, a, false);\n\n      // perform lu decomposition\n      var f = csLu(a, s, threshold);\n\n      // return decomposition\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});\nexports.createSlu = createSlu;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.csIpvec = csIpvec;\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 */\nfunction csIpvec(p, b) {\n  // vars\n  var k;\n  var n = b.length;\n  var x = [];\n  // check permutation vector was provided, p = null denotes identity\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  return x;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createLusolve = void 0;\nvar _is = require(\"../../../utils/is.js\");\nvar _factory = require(\"../../../utils/factory.js\");\nvar _solveValidation = require(\"./utils/solveValidation.js\");\nvar _csIpvec = require(\"../sparse/csIpvec.js\");\nvar name = 'lusolve';\nvar dependencies = ['typed', 'matrix', 'lup', 'slu', 'usolve', 'lsolve', 'DenseMatrix'];\nvar createLusolve = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    lup = _ref.lup,\n    slu = _ref.slu,\n    usolve = _ref.usolve,\n    lsolve = _ref.lsolve,\n    DenseMatrix = _ref.DenseMatrix;\n  var solveValidation = (0, _solveValidation.createSolveValidation)({\n    DenseMatrix: DenseMatrix\n  });\n\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  return typed(name, {\n    'Array, Array | Matrix': function ArrayArrayMatrix(a, b) {\n      a = matrix(a);\n      var d = lup(a);\n      var x = _lusolve(d.L, d.U, d.p, null, b);\n      return x.valueOf();\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrixArrayMatrix(a, b) {\n      var d = lup(a);\n      return _lusolve(d.L, d.U, d.p, null, b);\n    },\n    'SparseMatrix, Array | Matrix': function SparseMatrixArrayMatrix(a, b) {\n      var d = lup(a);\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      var d = slu(a, order, threshold);\n      return _lusolve(d.L, d.U, d.p, d.q, b);\n    },\n    'Object, Array | Matrix': function ObjectArrayMatrix(d, b) {\n      return _lusolve(d.L, d.U, d.p, d.q, b);\n    }\n  });\n  function _toMatrix(a) {\n    if ((0, _is.isMatrix)(a)) {\n      return a;\n    }\n    if ((0, _is.isArray)(a)) {\n      return matrix(a);\n    }\n    throw new TypeError('Invalid Matrix LU decomposition');\n  }\n  function _lusolve(l, u, p, q, b) {\n    // verify decomposition\n    l = _toMatrix(l);\n    u = _toMatrix(u);\n\n    // apply row permutations if needed (b is a DenseMatrix)\n    if (p) {\n      b = solveValidation(l, b, true);\n      b._data = (0, _csIpvec.csIpvec)(p, b._data);\n    }\n\n    // use forward substitution to resolve L * y = b\n    var y = lsolve(l, b);\n    // use backward substitution to resolve U * x = y\n    var x = usolve(u, y);\n\n    // apply column permutations if needed (x is a DenseMatrix)\n    if (q) {\n      x._data = (0, _csIpvec.csIpvec)(q, x._data);\n    }\n    return x;\n  }\n});\nexports.createLusolve = createLusolve;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createPolynomialRoot = void 0;\nvar _slicedToArray2 = _interopRequireDefault(require(\"@babel/runtime/helpers/slicedToArray\"));\nvar _toConsumableArray2 = _interopRequireDefault(require(\"@babel/runtime/helpers/toConsumableArray\"));\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'polynomialRoot';\nvar dependencies = ['typed', 'isZero', 'equalScalar', 'add', 'subtract', 'multiply', 'divide', 'sqrt', 'unaryMinus', 'cbrt', 'typeOf', 'im', 're'];\nvar createPolynomialRoot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    isZero = _ref.isZero,\n    equalScalar = _ref.equalScalar,\n    add = _ref.add,\n    subtract = _ref.subtract,\n    multiply = _ref.multiply,\n    divide = _ref.divide,\n    sqrt = _ref.sqrt,\n    unaryMinus = _ref.unaryMinus,\n    cbrt = _ref.cbrt,\n    typeOf = _ref.typeOf,\n    im = _ref.im,\n    re = _ref.re;\n  /**\n   * Finds the numerical values of the distinct roots of a polynomial with real or complex coefficients.\n   * Currently operates only on linear, quadratic, and cubic polynomials using the standard\n   * formulas for the roots.\n   *\n   * Syntax:\n   *\n   *     polynomialRoot(constant, linearCoeff, quadraticCoeff, cubicCoeff)\n   *\n   * Examples:\n   *     // linear\n   *     math.polynomialRoot(6, 3)                                        // [-2]\n   *     math.polynomialRoot(math.complex(6,3), 3)                        // [-2 - i]\n   *     math.polynomialRoot(math.complex(6,3), math.complex(2,1))        // [-3 + 0i]\n   *     // quadratic\n   *     math.polynomialRoot(2, -3, 1)                                    // [2, 1]\n   *     math.polynomialRoot(8, 8, 2)                                     // [-2]\n   *     math.polynomialRoot(-2, 0, 1)                                    // [1.4142135623730951, -1.4142135623730951]\n   *     math.polynomialRoot(2, -2, 1)                                    // [1 + i, 1 - i]\n   *     math.polynomialRoot(math.complex(1,3), math.complex(-3, -2), 1)  // [2 + i, 1 + i]\n   *     // cubic\n   *     math.polynomialRoot(-6, 11, -6, 1)                               // [1, 3, 2]\n   *     math.polynomialRoot(-8, 0, 0, 1)                                 // [-1 - 1.7320508075688774i, 2, -1 + 1.7320508075688774i]\n   *     math.polynomialRoot(0, 8, 8, 2)                                  // [0, -2]\n   *     math.polynomialRoot(1, 1, 1, 1)                                  // [-1 + 0i, 0 - i, 0 + i]\n   *\n   * See also:\n   *     cbrt, sqrt\n   *\n   * @param {... number | Complex} coeffs\n   *     The coefficients of the polynomial, starting with with the constant coefficent, followed\n   *     by the linear coefficient and subsequent coefficients of increasing powers.\n   * @return {Array} The distinct roots of the polynomial\n   */\n\n  return typed(name, {\n    'number|Complex, ...number|Complex': function numberComplexNumberComplex(constant, restCoeffs) {\n      var coeffs = [constant].concat((0, _toConsumableArray2[\"default\"])(restCoeffs));\n      while (coeffs.length > 0 && isZero(coeffs[coeffs.length - 1])) {\n        coeffs.pop();\n      }\n      if (coeffs.length < 2) {\n        throw new RangeError(\"Polynomial [\".concat(constant, \", \").concat(restCoeffs, \"] must have a non-zero non-constant coefficient\"));\n      }\n      switch (coeffs.length) {\n        case 2:\n          // linear\n          return [unaryMinus(divide(coeffs[0], coeffs[1]))];\n        case 3:\n          {\n            // quadratic\n            var _coeffs = (0, _slicedToArray2[\"default\"])(coeffs, 3),\n              c = _coeffs[0],\n              b = _coeffs[1],\n              a = _coeffs[2];\n            var denom = multiply(2, a);\n            var d1 = multiply(b, b);\n            var d2 = multiply(4, a, c);\n            if (equalScalar(d1, d2)) return [divide(unaryMinus(b), denom)];\n            var discriminant = sqrt(subtract(d1, d2));\n            return [divide(subtract(discriminant, b), denom), divide(subtract(unaryMinus(discriminant), b), denom)];\n          }\n        case 4:\n          {\n            // cubic, cf. https://en.wikipedia.org/wiki/Cubic_equation\n            var _coeffs2 = (0, _slicedToArray2[\"default\"])(coeffs, 4),\n              d = _coeffs2[0],\n              _c = _coeffs2[1],\n              _b = _coeffs2[2],\n              _a = _coeffs2[3];\n            var _denom = unaryMinus(multiply(3, _a));\n            var D0_1 = multiply(_b, _b);\n            var D0_2 = multiply(3, _a, _c);\n            var D1_1 = add(multiply(2, _b, _b, _b), multiply(27, _a, _a, d));\n            var D1_2 = multiply(9, _a, _b, _c);\n            if (equalScalar(D0_1, D0_2) && equalScalar(D1_1, D1_2)) {\n              return [divide(_b, _denom)];\n            }\n            var Delta0 = subtract(D0_1, D0_2);\n            var Delta1 = subtract(D1_1, D1_2);\n            var discriminant1 = add(multiply(18, _a, _b, _c, d), multiply(_b, _b, _c, _c));\n            var discriminant2 = add(multiply(4, _b, _b, _b, d), multiply(4, _a, _c, _c, _c), multiply(27, _a, _a, d, d));\n            if (equalScalar(discriminant1, discriminant2)) {\n              return [divide(subtract(multiply(4, _a, _b, _c), add(multiply(9, _a, _a, d), multiply(_b, _b, _b))), multiply(_a, Delta0)),\n              // simple root\n              divide(subtract(multiply(9, _a, d), multiply(_b, _c)), multiply(2, Delta0)) // double root\n              ];\n            }\n            // OK, we have three distinct roots\n            var Ccubed;\n            if (equalScalar(D0_1, D0_2)) {\n              Ccubed = Delta1;\n            } else {\n              Ccubed = divide(add(Delta1, sqrt(subtract(multiply(Delta1, Delta1), multiply(4, Delta0, Delta0, Delta0)))), 2);\n            }\n            var allRoots = true;\n            var rawRoots = cbrt(Ccubed, allRoots).toArray().map(function (C) {\n              return divide(add(_b, C, divide(Delta0, C)), _denom);\n            });\n            return rawRoots.map(function (r) {\n              if (typeOf(r) === 'Complex' && equalScalar(re(r), re(r) + im(r))) {\n                return re(r);\n              }\n              return r;\n            });\n          }\n        default:\n          throw new RangeError(\"only implemented for cubic or lower-order polynomials, not \".concat(coeffs));\n      }\n    }\n  });\n});\nexports.createPolynomialRoot = createPolynomialRoot;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createHelpClass = void 0;\nvar _is = require(\"../utils/is.js\");\nvar _object = require(\"../utils/object.js\");\nvar _string = require(\"../utils/string.js\");\nvar _factory = require(\"../utils/factory.js\");\nvar name = 'Help';\nvar dependencies = ['parse'];\nvar createHelpClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var parse = _ref.parse;\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  function Help(doc) {\n    if (!(this instanceof Help)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n    if (!doc) throw new Error('Argument \"doc\" missing');\n    this.doc = doc;\n  }\n\n  /**\n   * Attach type information\n   */\n  Help.prototype.type = 'Help';\n  Help.prototype.isHelp = true;\n\n  /**\n   * Generate a string representation of the Help object\n   * @return {string} Returns a string\n   * @private\n   */\n  Help.prototype.toString = function () {\n    var doc = this.doc || {};\n    var desc = '\\n';\n    if (doc.name) {\n      desc += 'Name: ' + doc.name + '\\n\\n';\n    }\n    if (doc.category) {\n      desc += 'Category: ' + doc.category + '\\n\\n';\n    }\n    if (doc.description) {\n      desc += 'Description:\\n    ' + doc.description + '\\n\\n';\n    }\n    if (doc.syntax) {\n      desc += 'Syntax:\\n    ' + doc.syntax.join('\\n    ') + '\\n\\n';\n    }\n    if (doc.examples) {\n      desc += 'Examples:\\n';\n      var scope = {};\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        try {\n          // note: res can be undefined when `expr` is an empty string\n          res = parse(expr).compile().evaluate(scope);\n        } catch (e) {\n          res = e;\n        }\n        if (res !== undefined && !(0, _is.isHelp)(res)) {\n          desc += '        ' + (0, _string.format)(res, {\n            precision: 14\n          }) + '\\n';\n        }\n      }\n      desc += '\\n';\n    }\n    if (doc.mayThrow && doc.mayThrow.length) {\n      desc += 'Throws: ' + doc.mayThrow.join(', ') + '\\n\\n';\n    }\n    if (doc.seealso && doc.seealso.length) {\n      desc += 'See also: ' + doc.seealso.join(', ') + '\\n';\n    }\n    return desc;\n  };\n\n  /**\n   * Export the help object to JSON\n   */\n  Help.prototype.toJSON = function () {\n    var obj = (0, _object.clone)(this.doc);\n    obj.mathjs = 'Help';\n    return obj;\n  };\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  Help.fromJSON = function (json) {\n    var doc = {};\n    Object.keys(json).filter(function (prop) {\n      return prop !== 'mathjs';\n    }).forEach(function (prop) {\n      doc[prop] = json[prop];\n    });\n    return new Help(doc);\n  };\n\n  /**\n   * Returns a string representation of the Help object\n   */\n  Help.prototype.valueOf = Help.prototype.toString;\n  return Help;\n}, {\n  isClass: true\n});\nexports.createHelpClass = createHelpClass;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createChainClass = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _string = require(\"../../utils/string.js\");\nvar _object = require(\"../../utils/object.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'Chain';\nvar dependencies = ['?on', 'math', 'typed'];\nvar createChainClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var on = _ref.on,\n    math = _ref.math,\n    typed = _ref.typed;\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    if ((0, _is.isChain)(value)) {\n      this.value = value.value;\n    } else {\n      this.value = value;\n    }\n  }\n\n  /**\n   * Attach type information\n   */\n  Chain.prototype.type = 'Chain';\n  Chain.prototype.isChain = true;\n\n  /**\n   * Close the chain. Returns the final value.\n   * Does the same as method valueOf()\n   * @returns {*} value\n   */\n  Chain.prototype.done = function () {\n    return this.value;\n  };\n\n  /**\n   * Close the chain. Returns the final value.\n   * Does the same as method done()\n   * @returns {*} value\n   */\n  Chain.prototype.valueOf = function () {\n    return this.value;\n  };\n\n  /**\n   * Get a string representation of the value in the chain\n   * @returns {string}\n   */\n  Chain.prototype.toString = function () {\n    return (0, _string.format)(this.value);\n  };\n\n  /**\n   * Get a JSON representation of the chain\n   * @returns {Object}\n   */\n  Chain.prototype.toJSON = function () {\n    return {\n      mathjs: 'Chain',\n      value: this.value\n    };\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  Chain.fromJSON = function (json) {\n    return new Chain(json.value);\n  };\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  function createProxy(name, fn) {\n    if (typeof fn === 'function') {\n      Chain.prototype[name] = chainify(fn);\n    }\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  function createLazyProxy(name, resolver) {\n    (0, _object.lazy)(Chain.prototype, name, function outerResolver() {\n      var fn = resolver();\n      if (typeof fn === 'function') {\n        return chainify(fn);\n      }\n      return undefined; // if not a function, ignore\n    });\n  }\n\n  /**\n   * Make a function chainable\n   * @param {function} fn\n   * @return {Function} chain function\n   * @private\n   */\n  function chainify(fn) {\n    return function () {\n      // Here, `this` will be the context of a Chain instance\n      if (arguments.length === 0) {\n        return new Chain(fn(this.value));\n      }\n      var args = [this.value];\n      for (var i = 0; i < arguments.length; i++) {\n        args[i + 1] = arguments[i];\n      }\n      if (typed.isTypedFunction(fn)) {\n        var sigObject = typed.resolve(fn, args);\n        // We want to detect if a rest parameter has matched across the\n        // value in the chain and the current arguments of this call.\n        // That is the case if and only if the matching signature has\n        // exactly one parameter (which then must be a rest parameter\n        // as it is matching at least two actual arguments).\n        if (sigObject.params.length === 1) {\n          throw new Error('chain function ' + fn.name + ' cannot match rest parameter between chain value and additional arguments.');\n        }\n        return new Chain(sigObject.implementation.apply(fn, args));\n      }\n      return new Chain(fn.apply(fn, args));\n    };\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  Chain.createProxy = function (arg0, arg1) {\n    if (typeof arg0 === 'string') {\n      // createProxy(name, value)\n      createProxy(arg0, arg1);\n    } else {\n      var _loop = function _loop(_name) {\n        if ((0, _object.hasOwnProperty)(arg0, _name) && excludedNames[_name] === undefined) {\n          createLazyProxy(_name, function () {\n            return arg0[_name];\n          });\n        }\n      };\n      // createProxy(values)\n      for (var _name in arg0) {\n        _loop(_name);\n      }\n    }\n  };\n  var excludedNames = {\n    expression: true,\n    docs: true,\n    type: true,\n    classes: true,\n    json: true,\n    error: true,\n    isChain: true // conflicts with the property isChain of a Chain instance\n  };\n\n  // create proxy for everything that is in math.js\n  Chain.createProxy(math);\n\n  // register on the import event, automatically add a proxy for every imported function.\n  if (on) {\n    on('import', function (name, resolver, path) {\n      if (!path) {\n        // an imported function (not a data type or something special)\n        createLazyProxy(name, resolver);\n      }\n    });\n  }\n  return Chain;\n}, {\n  isClass: true\n});\nexports.createChainClass = createChainClass;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.eDocs = void 0;\nvar eDocs = {\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};\nexports.eDocs = eDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.falseDocs = void 0;\nvar falseDocs = {\n  name: 'false',\n  category: 'Constants',\n  syntax: ['false'],\n  description: 'Boolean value false',\n  examples: ['false'],\n  seealso: ['true']\n};\nexports.falseDocs = falseDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.iDocs = void 0;\nvar iDocs = {\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};\nexports.iDocs = iDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.InfinityDocs = void 0;\nvar InfinityDocs = {\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};\nexports.InfinityDocs = InfinityDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.LN10Docs = void 0;\nvar LN10Docs = {\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};\nexports.LN10Docs = LN10Docs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.LN2Docs = void 0;\nvar LN2Docs = {\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};\nexports.LN2Docs = LN2Docs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.LOG10EDocs = void 0;\nvar LOG10EDocs = {\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};\nexports.LOG10EDocs = LOG10EDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.LOG2EDocs = void 0;\nvar LOG2EDocs = {\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};\nexports.LOG2EDocs = LOG2EDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.NaNDocs = void 0;\nvar NaNDocs = {\n  name: 'NaN',\n  category: 'Constants',\n  syntax: ['NaN'],\n  description: 'Not a number',\n  examples: ['NaN', '0 / 0'],\n  seealso: []\n};\nexports.NaNDocs = NaNDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.nullDocs = void 0;\nvar nullDocs = {\n  name: 'null',\n  category: 'Constants',\n  syntax: ['null'],\n  description: 'Value null',\n  examples: ['null'],\n  seealso: ['true', 'false']\n};\nexports.nullDocs = nullDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.phiDocs = void 0;\nvar phiDocs = {\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};\nexports.phiDocs = phiDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.piDocs = void 0;\nvar piDocs = {\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};\nexports.piDocs = piDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.SQRT12Docs = void 0;\nvar SQRT12Docs = {\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};\nexports.SQRT12Docs = SQRT12Docs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.SQRT2Docs = void 0;\nvar SQRT2Docs = {\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};\nexports.SQRT2Docs = SQRT2Docs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.tauDocs = void 0;\nvar tauDocs = {\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};\nexports.tauDocs = tauDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.trueDocs = void 0;\nvar trueDocs = {\n  name: 'true',\n  category: 'Constants',\n  syntax: ['true'],\n  description: 'Boolean value true',\n  examples: ['true'],\n  seealso: ['false']\n};\nexports.trueDocs = trueDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.versionDocs = void 0;\nvar versionDocs = {\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};\nexports.versionDocs = versionDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.bignumberDocs = void 0;\nvar bignumberDocs = {\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};\nexports.bignumberDocs = bignumberDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.booleanDocs = void 0;\nvar booleanDocs = {\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};\nexports.booleanDocs = booleanDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.complexDocs = void 0;\nvar complexDocs = {\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};\nexports.complexDocs = complexDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createUnitDocs = void 0;\nvar createUnitDocs = {\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};\nexports.createUnitDocs = createUnitDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.fractionDocs = void 0;\nvar fractionDocs = {\n  name: 'fraction',\n  category: 'Construction',\n  syntax: ['fraction(num)', 'fraction(matrix)', 'fraction(num,den)', 'fraction({n: num, d: den})'],\n  description: 'Create a fraction from a number or from integer numerator and denominator.',\n  examples: ['fraction(0.125)', 'fraction(1, 3) + fraction(2, 5)', 'fraction({n: 333, d: 53})', 'fraction([sqrt(9), sqrt(10), sqrt(11)])'],\n  seealso: ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'string', 'unit']\n};\nexports.fractionDocs = fractionDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.indexDocs = void 0;\nvar indexDocs = {\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[1:2, 1:2] = ones(2, 2)'],\n  seealso: ['bignumber', 'boolean', 'complex', 'matrix,', 'number', 'range', 'string', 'unit']\n};\nexports.indexDocs = indexDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.matrixDocs = void 0;\nvar matrixDocs = {\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};\nexports.matrixDocs = matrixDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.numberDocs = void 0;\nvar numberDocs = {\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};\nexports.numberDocs = numberDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.sparseDocs = void 0;\nvar sparseDocs = {\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};\nexports.sparseDocs = sparseDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.splitUnitDocs = void 0;\nvar splitUnitDocs = {\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};\nexports.splitUnitDocs = splitUnitDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.stringDocs = void 0;\nvar stringDocs = {\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};\nexports.stringDocs = stringDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.unitDocs = void 0;\nvar unitDocs = {\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};\nexports.unitDocs = unitDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.configDocs = void 0;\nvar configDocs = {\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};\nexports.configDocs = configDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.importDocs = void 0;\nvar importDocs = {\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};\nexports.importDocs = importDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.typedDocs = void 0;\nvar typedDocs = {\n  name: 'typed',\n  category: 'Core',\n  syntax: ['typed(signatures)', 'typed(name, signatures)'],\n  description: 'Create a typed function.',\n  examples: ['double = typed({ \"number\": f(x)=x+x })', 'double(2)', 'double(\"hello\")'],\n  seealso: []\n};\nexports.typedDocs = typedDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.derivativeDocs = void 0;\nvar derivativeDocs = {\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.evaluate({x: 3})'],\n  seealso: ['simplify', 'parse', 'evaluate']\n};\nexports.derivativeDocs = derivativeDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.leafCountDocs = void 0;\nvar leafCountDocs = {\n  name: 'leafCount',\n  category: 'Algebra',\n  syntax: ['leafCount(expr)'],\n  description: 'Computes the number of leaves in the parse tree of the given expression',\n  examples: ['leafCount(\"e^(i*pi)-1\")', 'leafCount(parse(\"{a: 22/7, b: 10^(1/2)}\"))'],\n  seealso: ['simplify']\n};\nexports.leafCountDocs = leafCountDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.lsolveDocs = void 0;\nvar lsolveDocs = {\n  name: 'lsolve',\n  category: 'Algebra',\n  syntax: ['x=lsolve(L, b)'],\n  description: 'Finds one solution of 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: ['lsolveAll', 'lup', 'lusolve', 'usolve', 'matrix', 'sparse']\n};\nexports.lsolveDocs = lsolveDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.lsolveAllDocs = void 0;\nvar lsolveAllDocs = {\n  name: 'lsolveAll',\n  category: 'Algebra',\n  syntax: ['x=lsolveAll(L, b)'],\n  description: 'Finds all solutions of 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: ['lsolve', 'lup', 'lusolve', 'usolve', 'matrix', 'sparse']\n};\nexports.lsolveAllDocs = lsolveAllDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.lupDocs = void 0;\nvar lupDocs = {\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};\nexports.lupDocs = lupDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.lusolveDocs = void 0;\nvar lusolveDocs = {\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};\nexports.lusolveDocs = lusolveDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.polynomialRootDocs = void 0;\nvar polynomialRootDocs = {\n  name: 'polynomialRoot',\n  category: 'Algebra',\n  syntax: ['x=polynomialRoot(-6, 3)', 'x=polynomialRoot(4, -4, 1)', 'x=polynomialRoot(-8, 12, -6, 1)'],\n  description: 'Finds the roots of a univariate polynomial given by its coefficients starting from constant, linear, and so on, increasing in degree.',\n  examples: ['a = polynomialRoot(-6, 11, -6 1)'],\n  seealso: ['cbrt', 'sqrt']\n};\nexports.polynomialRootDocs = polynomialRootDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.qrDocs = void 0;\nvar qrDocs = {\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};\nexports.qrDocs = qrDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.rationalizeDocs = void 0;\nvar rationalizeDocs = {\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};\nexports.rationalizeDocs = rationalizeDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.resolveDocs = void 0;\nvar resolveDocs = {\n  name: 'resolve',\n  category: 'Algebra',\n  syntax: ['resolve(node, scope)'],\n  description: 'Recursively substitute variables in an expression tree.',\n  examples: ['resolve(parse(\"1 + x\"), { x: 7 })', 'resolve(parse(\"size(text)\"), { text: \"Hello World\" })', 'resolve(parse(\"x + y\"), { x: parse(\"3z\") })', 'resolve(parse(\"3x\"), { x: parse(\"y+z\"), z: parse(\"w^y\") })'],\n  seealso: ['simplify', 'evaluate'],\n  mayThrow: ['ReferenceError']\n};\nexports.resolveDocs = resolveDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.simplifyDocs = void 0;\nvar simplifyDocs = {\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.evaluate({x: 2})'],\n  seealso: ['simplifyCore', 'derivative', 'evaluate', 'parse', 'rationalize', 'resolve']\n};\nexports.simplifyDocs = simplifyDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.simplifyConstantDocs = void 0;\nvar simplifyConstantDocs = {\n  name: 'simplifyConstant',\n  category: 'Algebra',\n  syntax: ['simplifyConstant(expr)', 'simplifyConstant(expr, options)'],\n  description: 'Replace constant subexpressions of node with their values.',\n  examples: ['simplifyConatant(\"(3-3)*x\")', 'simplifyConstant(parse(\"z-cos(tau/8)\"))'],\n  seealso: ['simplify', 'simplifyCore', 'evaluate']\n};\nexports.simplifyConstantDocs = simplifyConstantDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.simplifyCoreDocs = void 0;\nvar simplifyCoreDocs = {\n  name: 'simplifyCore',\n  category: 'Algebra',\n  syntax: ['simplifyCore(node)'],\n  description: 'Perform simple one-pass simplifications on an expression tree.',\n  examples: ['simplifyCore(parse(\"0*x\"))', 'simplifyCore(parse(\"(x+0)*2\"))'],\n  seealso: ['simplify', 'simplifyConstant', 'evaluate']\n};\nexports.simplifyCoreDocs = simplifyCoreDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.sluDocs = void 0;\nvar sluDocs = {\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};\nexports.sluDocs = sluDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.symbolicEqualDocs = void 0;\nvar symbolicEqualDocs = {\n  name: 'symbolicEqual',\n  category: 'Algebra',\n  syntax: ['symbolicEqual(expr1, expr2)', 'symbolicEqual(expr1, expr2, options)'],\n  description: 'Returns true if the difference of the expressions simplifies to 0',\n  examples: ['symbolicEqual(\"x*y\",\"y*x\")', 'symbolicEqual(\"abs(x^2)\", \"x^2\")', 'symbolicEqual(\"abs(x)\", \"x\", {context: {abs: {trivial: true}}})'],\n  seealso: ['simplify', 'evaluate']\n};\nexports.symbolicEqualDocs = symbolicEqualDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.usolveDocs = void 0;\nvar usolveDocs = {\n  name: 'usolve',\n  category: 'Algebra',\n  syntax: ['x=usolve(U, b)'],\n  description: 'Finds one solution of 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: ['usolveAll', 'lup', 'lusolve', 'lsolve', 'matrix', 'sparse']\n};\nexports.usolveDocs = usolveDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.usolveAllDocs = void 0;\nvar usolveAllDocs = {\n  name: 'usolveAll',\n  category: 'Algebra',\n  syntax: ['x=usolve(U, b)'],\n  description: 'Finds all solutions of 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: ['usolve', 'lup', 'lusolve', 'lsolve', 'matrix', 'sparse']\n};\nexports.usolveAllDocs = usolveAllDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.absDocs = void 0;\nvar absDocs = {\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};\nexports.absDocs = absDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.addDocs = void 0;\nvar addDocs = {\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};\nexports.addDocs = addDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.cbrtDocs = void 0;\nvar cbrtDocs = {\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};\nexports.cbrtDocs = cbrtDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.ceilDocs = void 0;\nvar ceilDocs = {\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};\nexports.ceilDocs = ceilDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.cubeDocs = void 0;\nvar cubeDocs = {\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};\nexports.cubeDocs = cubeDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.divideDocs = void 0;\nvar divideDocs = {\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};\nexports.divideDocs = divideDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.dotDivideDocs = void 0;\nvar dotDivideDocs = {\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};\nexports.dotDivideDocs = dotDivideDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.dotMultiplyDocs = void 0;\nvar dotMultiplyDocs = {\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};\nexports.dotMultiplyDocs = dotMultiplyDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.dotPowDocs = void 0;\nvar dotPowDocs = {\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};\nexports.dotPowDocs = dotPowDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.expDocs = void 0;\nvar expDocs = {\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};\nexports.expDocs = expDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.expmDocs = void 0;\nvar expmDocs = {\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};\nexports.expmDocs = expmDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.expm1Docs = void 0;\nvar expm1Docs = {\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};\nexports.expm1Docs = expm1Docs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.fixDocs = void 0;\nvar fixDocs = {\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};\nexports.fixDocs = fixDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.floorDocs = void 0;\nvar floorDocs = {\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};\nexports.floorDocs = floorDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.gcdDocs = void 0;\nvar gcdDocs = {\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};\nexports.gcdDocs = gcdDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.hypotDocs = void 0;\nvar hypotDocs = {\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};\nexports.hypotDocs = hypotDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.invmodDocs = void 0;\nvar invmodDocs = {\n  name: 'invmod',\n  category: 'Arithmetic',\n  syntax: ['invmod(a, b)'],\n  description: 'Calculate the (modular) multiplicative inverse of a modulo b. Solution to the equation ax ≣ 1 (mod b)',\n  examples: ['invmod(8, 12)=NaN', 'invmod(7, 13)=2', 'invmod(15151, 15122)=10429'],\n  seealso: ['gcd', 'xgcd']\n};\nexports.invmodDocs = invmodDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.lcmDocs = void 0;\nvar lcmDocs = {\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};\nexports.lcmDocs = lcmDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.logDocs = void 0;\nvar logDocs = {\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};\nexports.logDocs = logDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.log10Docs = void 0;\nvar log10Docs = {\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};\nexports.log10Docs = log10Docs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.log1pDocs = void 0;\nvar log1pDocs = {\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};\nexports.log1pDocs = log1pDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.log2Docs = void 0;\nvar log2Docs = {\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};\nexports.log2Docs = log2Docs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.modDocs = void 0;\nvar modDocs = {\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};\nexports.modDocs = modDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.multiplyDocs = void 0;\nvar multiplyDocs = {\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};\nexports.multiplyDocs = multiplyDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.normDocs = void 0;\nvar normDocs = {\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};\nexports.normDocs = normDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.nthRootDocs = void 0;\nvar nthRootDocs = {\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};\nexports.nthRootDocs = nthRootDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.nthRootsDocs = void 0;\nvar nthRootsDocs = {\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};\nexports.nthRootsDocs = nthRootsDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.powDocs = void 0;\nvar powDocs = {\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)', 'pow([[1, 2], [4, 3]], 2)', 'pow([[1, 2], [4, 3]], -1)'],\n  seealso: ['multiply', 'nthRoot', 'nthRoots', 'sqrt']\n};\nexports.powDocs = powDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.roundDocs = void 0;\nvar roundDocs = {\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};\nexports.roundDocs = roundDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.signDocs = void 0;\nvar signDocs = {\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};\nexports.signDocs = signDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.sqrtDocs = void 0;\nvar sqrtDocs = {\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};\nexports.sqrtDocs = sqrtDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.sqrtmDocs = void 0;\nvar sqrtmDocs = {\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([[33, 24], [48, 57]])'],\n  seealso: ['sqrt', 'abs', 'square', 'multiply']\n};\nexports.sqrtmDocs = sqrtmDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.sylvesterDocs = void 0;\nvar sylvesterDocs = {\n  name: 'sylvester',\n  category: 'Matrix',\n  syntax: ['sylvester(A,B,C)'],\n  description: 'Solves the real-valued Sylvester equation AX+XB=C for X',\n  examples: ['sylvester([[-1, -2], [1, 1]], [[-2, 1], [-1, 2]], [[-3, 2], [3, 0]])', 'sylvester(A,B,C)'],\n  seealso: ['schur', 'lyap']\n};\nexports.sylvesterDocs = sylvesterDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.schurDocs = void 0;\nvar schurDocs = {\n  name: 'schur',\n  category: 'Matrix',\n  syntax: ['schur(A)'],\n  description: 'Performs a real Schur decomposition of the real matrix A = UTU\\'',\n  examples: ['schur([[1, 0], [-4, 3]])', 'schur(A)'],\n  seealso: ['lyap', 'sylvester']\n};\nexports.schurDocs = schurDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.lyapDocs = void 0;\nvar lyapDocs = {\n  name: 'lyap',\n  category: 'Matrix',\n  syntax: ['lyap(A,Q)'],\n  description: 'Solves the Continuous-time Lyapunov equation AP+PA\\'+Q=0 for P',\n  examples: ['lyap([[-2, 0], [1, -4]], [[3, 1], [1, 3]])', 'lyap(A,Q)'],\n  seealso: ['schur', 'sylvester']\n};\nexports.lyapDocs = lyapDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.squareDocs = void 0;\nvar squareDocs = {\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};\nexports.squareDocs = squareDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.subtractDocs = void 0;\nvar subtractDocs = {\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};\nexports.subtractDocs = subtractDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.unaryMinusDocs = void 0;\nvar unaryMinusDocs = {\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};\nexports.unaryMinusDocs = unaryMinusDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.unaryPlusDocs = void 0;\nvar unaryPlusDocs = {\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};\nexports.unaryPlusDocs = unaryPlusDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.xgcdDocs = void 0;\nvar xgcdDocs = {\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};\nexports.xgcdDocs = xgcdDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.bitAndDocs = void 0;\nvar bitAndDocs = {\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};\nexports.bitAndDocs = bitAndDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.bitNotDocs = void 0;\nvar bitNotDocs = {\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};\nexports.bitNotDocs = bitNotDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.bitOrDocs = void 0;\nvar bitOrDocs = {\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};\nexports.bitOrDocs = bitOrDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.bitXorDocs = void 0;\nvar bitXorDocs = {\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};\nexports.bitXorDocs = bitXorDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.leftShiftDocs = void 0;\nvar leftShiftDocs = {\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};\nexports.leftShiftDocs = leftShiftDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.rightArithShiftDocs = void 0;\nvar rightArithShiftDocs = {\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};\nexports.rightArithShiftDocs = rightArithShiftDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.rightLogShiftDocs = void 0;\nvar rightLogShiftDocs = {\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};\nexports.rightLogShiftDocs = rightLogShiftDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.bellNumbersDocs = void 0;\nvar bellNumbersDocs = {\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};\nexports.bellNumbersDocs = bellNumbersDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.catalanDocs = void 0;\nvar catalanDocs = {\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};\nexports.catalanDocs = catalanDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.compositionDocs = void 0;\nvar compositionDocs = {\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};\nexports.compositionDocs = compositionDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.stirlingS2Docs = void 0;\nvar stirlingS2Docs = {\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};\nexports.stirlingS2Docs = stirlingS2Docs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.argDocs = void 0;\nvar argDocs = {\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};\nexports.argDocs = argDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.conjDocs = void 0;\nvar conjDocs = {\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};\nexports.conjDocs = conjDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.imDocs = void 0;\nvar imDocs = {\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};\nexports.imDocs = imDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.reDocs = void 0;\nvar reDocs = {\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};\nexports.reDocs = reDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.evaluateDocs = void 0;\nvar evaluateDocs = {\n  name: 'evaluate',\n  category: 'Expression',\n  syntax: ['evaluate(expression)', 'evaluate([expr1, expr2, expr3, ...])'],\n  description: 'Evaluate an expression or an array with expressions.',\n  examples: ['evaluate(\"2 + 3\")', 'evaluate(\"sqrt(\" + 4 + \")\")'],\n  seealso: []\n};\nexports.evaluateDocs = evaluateDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.helpDocs = void 0;\nvar helpDocs = {\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};\nexports.helpDocs = helpDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.distanceDocs = void 0;\nvar distanceDocs = {\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};\nexports.distanceDocs = distanceDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.intersectDocs = void 0;\nvar intersectDocs = {\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};\nexports.intersectDocs = intersectDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.andDocs = void 0;\nvar andDocs = {\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};\nexports.andDocs = andDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.notDocs = void 0;\nvar notDocs = {\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};\nexports.notDocs = notDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.orDocs = void 0;\nvar orDocs = {\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};\nexports.orDocs = orDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.xorDocs = void 0;\nvar xorDocs = {\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};\nexports.xorDocs = xorDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.columnDocs = void 0;\nvar columnDocs = {\n  name: 'column',\n  category: 'Matrix',\n  syntax: ['column(x, index)'],\n  description: 'Return a column from a matrix or array.',\n  examples: ['A = [[1, 2], [3, 4]]', 'column(A, 1)', 'column(A, 2)'],\n  seealso: ['row', 'matrixFromColumns']\n};\nexports.columnDocs = columnDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.concatDocs = void 0;\nvar concatDocs = {\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};\nexports.concatDocs = concatDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.countDocs = void 0;\nvar countDocs = {\n  name: 'count',\n  category: 'Matrix',\n  syntax: ['count(x)'],\n  description: 'Count the number of elements of a matrix, array or string.',\n  examples: ['a = [1, 2; 3, 4; 5, 6]', 'count(a)', 'size(a)', 'count(\"hello world\")'],\n  seealso: ['size']\n};\nexports.countDocs = countDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.crossDocs = void 0;\nvar crossDocs = {\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};\nexports.crossDocs = crossDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.ctransposeDocs = void 0;\nvar ctransposeDocs = {\n  name: 'ctranspose',\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};\nexports.ctransposeDocs = ctransposeDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.detDocs = void 0;\nvar detDocs = {\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};\nexports.detDocs = detDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.diagDocs = void 0;\nvar diagDocs = {\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};\nexports.diagDocs = diagDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.diffDocs = void 0;\nvar diffDocs = {\n  name: 'diff',\n  category: 'Matrix',\n  syntax: ['diff(arr)', 'diff(arr, dim)'],\n  description: ['Create a new matrix or array with the difference of the passed matrix or array.', 'Dim parameter is optional and used to indicant the dimension of the array/matrix to apply the difference', 'If no dimension parameter is passed it is assumed as dimension 0', 'Dimension is zero-based in javascript and one-based in the parser', 'Arrays must be \\'rectangular\\' meaning arrays like [1, 2]', 'If something is passed as a matrix it will be returned as a matrix but other than that all matrices are converted to arrays'],\n  examples: ['diff([1, 2, 4, 7, 0])', 'diff([1, 2, 4, 7, 0], 0)', 'diff(matrix([1, 2, 4, 7, 0]))', 'diff([[1, 2], [3, 4]])', 'diff([[1, 2], [3, 4]], 0)', 'diff([[1, 2], [3, 4]], 1)', 'diff([[1, 2], [3, 4]], bignumber(1))', 'diff(matrix([[1, 2], [3, 4]]), 1)', 'diff([[1, 2], matrix([3, 4])], 1)'],\n  seealso: ['subtract', 'partitionSelect']\n};\nexports.diffDocs = diffDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.dotDocs = void 0;\nvar dotDocs = {\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};\nexports.dotDocs = dotDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.eigsDocs = void 0;\nvar eigsDocs = {\n  name: 'eigs',\n  category: 'Matrix',\n  syntax: ['eigs(x)'],\n  description: 'Calculate the eigenvalues and eigenvectors of a real symmetric matrix',\n  examples: ['eigs([[5, 2.3], [2.3, 1]])'],\n  seealso: ['inv']\n};\nexports.eigsDocs = eigsDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.filterDocs = void 0;\nvar filterDocs = {\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};\nexports.filterDocs = filterDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.flattenDocs = void 0;\nvar flattenDocs = {\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};\nexports.flattenDocs = flattenDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.forEachDocs = void 0;\nvar forEachDocs = {\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: ['numberOfPets = {}', 'addPet(n) = numberOfPets[n] = (numberOfPets[n] ? numberOfPets[n]:0 ) + 1;', 'forEach([\"Dog\",\"Cat\",\"Cat\"], addPet)', 'numberOfPets'],\n  seealso: ['map', 'sort', 'filter']\n};\nexports.forEachDocs = forEachDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.getMatrixDataTypeDocs = void 0;\nvar getMatrixDataTypeDocs = {\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};\nexports.getMatrixDataTypeDocs = getMatrixDataTypeDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.identityDocs = void 0;\nvar identityDocs = {\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};\nexports.identityDocs = identityDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.invDocs = void 0;\nvar invDocs = {\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};\nexports.invDocs = invDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.pinvDocs = void 0;\nvar pinvDocs = {\n  name: 'pinv',\n  category: 'Matrix',\n  syntax: ['pinv(x)'],\n  description: 'Calculate the Moore–Penrose inverse of a matrix',\n  examples: ['pinv([1, 2; 3, 4])', 'pinv([[1, 0], [0, 1], [0, 1]])', 'pinv(4)'],\n  seealso: ['inv']\n};\nexports.pinvDocs = pinvDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.kronDocs = void 0;\nvar kronDocs = {\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};\nexports.kronDocs = kronDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.mapDocs = void 0;\nvar mapDocs = {\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};\nexports.mapDocs = mapDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.matrixFromColumnsDocs = void 0;\nvar matrixFromColumnsDocs = {\n  name: 'matrixFromColumns',\n  category: 'Matrix',\n  syntax: ['matrixFromColumns(...arr)', 'matrixFromColumns(row1, row2)', 'matrixFromColumns(row1, row2, row3)'],\n  description: 'Create a dense matrix from vectors as individual columns.',\n  examples: ['matrixFromColumns([1, 2, 3], [[4],[5],[6]])'],\n  seealso: ['matrix', 'matrixFromRows', 'matrixFromFunction', 'zeros']\n};\nexports.matrixFromColumnsDocs = matrixFromColumnsDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.matrixFromFunctionDocs = void 0;\nvar matrixFromFunctionDocs = {\n  name: 'matrixFromFunction',\n  category: 'Matrix',\n  syntax: ['matrixFromFunction(size, fn)', 'matrixFromFunction(size, fn, format)', 'matrixFromFunction(size, fn, format, datatype)', 'matrixFromFunction(size, format, fn)', 'matrixFromFunction(size, format, datatype, fn)'],\n  description: 'Create a matrix by evaluating a generating function at each index.',\n  examples: ['f(I) = I[1] - I[2]', 'matrixFromFunction([3,3], f)', 'g(I) = I[1] - I[2] == 1 ? 4 : 0', 'matrixFromFunction([100, 100], \"sparse\", g)', 'matrixFromFunction([5], random)'],\n  seealso: ['matrix', 'matrixFromRows', 'matrixFromColumns', 'zeros']\n};\nexports.matrixFromFunctionDocs = matrixFromFunctionDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.matrixFromRowsDocs = void 0;\nvar matrixFromRowsDocs = {\n  name: 'matrixFromRows',\n  category: 'Matrix',\n  syntax: ['matrixFromRows(...arr)', 'matrixFromRows(row1, row2)', 'matrixFromRows(row1, row2, row3)'],\n  description: 'Create a dense matrix from vectors as individual rows.',\n  examples: ['matrixFromRows([1, 2, 3], [[4],[5],[6]])'],\n  seealso: ['matrix', 'matrixFromColumns', 'matrixFromFunction', 'zeros']\n};\nexports.matrixFromRowsDocs = matrixFromRowsDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.onesDocs = void 0;\nvar onesDocs = {\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};\nexports.onesDocs = onesDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.partitionSelectDocs = void 0;\nvar partitionSelectDocs = {\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, compareText)', 'arr = [5, 2, 1]', 'partitionSelect(arr, 0) # returns 1, arr is now: [1, 2, 5]', 'arr', 'partitionSelect(arr, 1, \\'desc\\') # returns 2, arr is now: [5, 2, 1]', 'arr'],\n  seealso: ['sort']\n};\nexports.partitionSelectDocs = partitionSelectDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.rangeDocs = void 0;\nvar rangeDocs = {\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};\nexports.rangeDocs = rangeDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.reshapeDocs = void 0;\nvar reshapeDocs = {\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])', 'reshape([1, 2, 3, 4], [-1, 2])'],\n  seealso: ['size', 'squeeze', 'resize']\n};\nexports.reshapeDocs = reshapeDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.resizeDocs = void 0;\nvar resizeDocs = {\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};\nexports.resizeDocs = resizeDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.rotateDocs = void 0;\nvar rotateDocs = {\n  name: 'rotate',\n  category: 'Matrix',\n  syntax: ['rotate(w, theta)', 'rotate(w, theta, v)'],\n  description: 'Returns a 2-D rotation matrix (2x2) for a given angle (in radians). ' + 'Returns a 2-D rotation matrix (3x3) of a given angle (in radians) around given axis.',\n  examples: ['rotate([1, 0], pi / 2)', 'rotate(matrix([1, 0]), unit(\"35deg\"))', 'rotate([1, 0, 0], unit(\"90deg\"), [0, 0, 1])', 'rotate(matrix([1, 0, 0]), unit(\"90deg\"), matrix([0, 0, 1]))'],\n  seealso: ['matrix', 'rotationMatrix']\n};\nexports.rotateDocs = rotateDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.rotationMatrixDocs = void 0;\nvar rotationMatrixDocs = {\n  name: 'rotationMatrix',\n  category: 'Matrix',\n  syntax: ['rotationMatrix(theta)', 'rotationMatrix(theta, v)', 'rotationMatrix(theta, v, format)'],\n  description: 'Returns a 2-D rotation matrix (2x2) for a given angle (in radians). ' + 'Returns a 2-D rotation matrix (3x3) of a given angle (in radians) around given axis.',\n  examples: ['rotationMatrix(pi / 2)', 'rotationMatrix(unit(\"45deg\"), [0, 0, 1])', 'rotationMatrix(1, matrix([0, 0, 1]), \"sparse\")'],\n  seealso: ['cos', 'sin']\n};\nexports.rotationMatrixDocs = rotationMatrixDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.rowDocs = void 0;\nvar rowDocs = {\n  name: 'row',\n  category: 'Matrix',\n  syntax: ['row(x, index)'],\n  description: 'Return a row from a matrix or array.',\n  examples: ['A = [[1, 2], [3, 4]]', 'row(A, 1)', 'row(A, 2)'],\n  seealso: ['column', 'matrixFromRows']\n};\nexports.rowDocs = rowDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.sizeDocs = void 0;\nvar sizeDocs = {\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', 'count', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']\n};\nexports.sizeDocs = sizeDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.sortDocs = void 0;\nvar sortDocs = {\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\"], \"natural\")', '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};\nexports.sortDocs = sortDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.squeezeDocs = void 0;\nvar squeezeDocs = {\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};\nexports.squeezeDocs = squeezeDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.subsetDocs = void 0;\nvar subsetDocs = {\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 the entries of a matrix or ' + 'characters of a string. ' + 'Indexes are one-based. There should be one index specification for ' + 'each dimension of the target. Each specification can be a single ' + 'index, a list of indices, or a range in colon notation `l:u`. ' + 'In a range, both the lower bound l and upper bound u are included; ' + 'and if a bound is omitted it defaults to the most extreme valid value. ' + 'The cartesian product of the indices specified in each dimension ' + 'determines the target of the operation.',\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]', 'f[[1,2], [1,3]] = [9, 10; 11, 12]', 'f'],\n  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'trace', 'transpose', 'zeros']\n};\nexports.subsetDocs = subsetDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.traceDocs = void 0;\nvar traceDocs = {\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};\nexports.traceDocs = traceDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.transposeDocs = void 0;\nvar transposeDocs = {\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};\nexports.transposeDocs = transposeDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.zerosDocs = void 0;\nvar zerosDocs = {\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};\nexports.zerosDocs = zerosDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.fftDocs = void 0;\nvar fftDocs = {\n  name: 'fft',\n  category: 'Matrix',\n  syntax: ['fft(x)'],\n  description: 'Calculate N-dimensional fourier transform',\n  examples: ['fft([[1, 0], [1, 0]])'],\n  seealso: ['ifft']\n};\nexports.fftDocs = fftDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.ifftDocs = void 0;\nvar ifftDocs = {\n  name: 'ifft',\n  category: 'Matrix',\n  syntax: ['ifft(x)'],\n  description: 'Calculate N-dimensional inverse fourier transform',\n  examples: ['ifft([[2, 2], [0, 0]])'],\n  seealso: ['fft']\n};\nexports.ifftDocs = ifftDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.combinationsDocs = void 0;\nvar combinationsDocs = {\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: ['combinationsWithRep', 'permutations', 'factorial']\n};\nexports.combinationsDocs = combinationsDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.combinationsWithRepDocs = void 0;\nvar combinationsWithRepDocs = {\n  name: 'combinationsWithRep',\n  category: 'Probability',\n  syntax: ['combinationsWithRep(n, k)'],\n  description: 'Compute the number of combinations of n items taken k at a time with replacements.',\n  examples: ['combinationsWithRep(7, 5)'],\n  seealso: ['combinations', 'permutations', 'factorial']\n};\nexports.combinationsWithRepDocs = combinationsWithRepDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.factorialDocs = void 0;\nvar factorialDocs = {\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', 'combinationsWithRep', 'permutations', 'gamma']\n};\nexports.factorialDocs = factorialDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.gammaDocs = void 0;\nvar gammaDocs = {\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};\nexports.gammaDocs = gammaDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.lgammaDocs = void 0;\nvar lgammaDocs = {\n  name: 'lgamma',\n  category: 'Probability',\n  syntax: ['lgamma(n)'],\n  description: 'Logarithm of the gamma function for real, positive numbers and complex numbers, ' + 'using Lanczos approximation for numbers and Stirling series for complex numbers.',\n  examples: ['lgamma(4)', 'lgamma(1/2)', 'lgamma(i)', 'lgamma(complex(1.1, 2))'],\n  seealso: ['gamma']\n};\nexports.lgammaDocs = lgammaDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.kldivergenceDocs = void 0;\nvar kldivergenceDocs = {\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};\nexports.kldivergenceDocs = kldivergenceDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.multinomialDocs = void 0;\nvar multinomialDocs = {\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};\nexports.multinomialDocs = multinomialDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.permutationsDocs = void 0;\nvar permutationsDocs = {\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', 'combinationsWithRep', 'factorial']\n};\nexports.permutationsDocs = permutationsDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.pickRandomDocs = void 0;\nvar pickRandomDocs = {\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};\nexports.pickRandomDocs = pickRandomDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.randomDocs = void 0;\nvar randomDocs = {\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};\nexports.randomDocs = randomDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.randomIntDocs = void 0;\nvar randomIntDocs = {\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};\nexports.randomIntDocs = randomIntDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.compareDocs = void 0;\nvar compareDocs = {\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};\nexports.compareDocs = compareDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.compareNaturalDocs = void 0;\nvar compareNaturalDocs = {\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};\nexports.compareNaturalDocs = compareNaturalDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.compareTextDocs = void 0;\nvar compareTextDocs = {\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};\nexports.compareTextDocs = compareTextDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.deepEqualDocs = void 0;\nvar deepEqualDocs = {\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};\nexports.deepEqualDocs = deepEqualDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.equalDocs = void 0;\nvar equalDocs = {\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};\nexports.equalDocs = equalDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.equalTextDocs = void 0;\nvar equalTextDocs = {\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};\nexports.equalTextDocs = equalTextDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.largerDocs = void 0;\nvar largerDocs = {\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};\nexports.largerDocs = largerDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.largerEqDocs = void 0;\nvar largerEqDocs = {\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};\nexports.largerEqDocs = largerEqDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.smallerDocs = void 0;\nvar smallerDocs = {\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};\nexports.smallerDocs = smallerDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.smallerEqDocs = void 0;\nvar smallerEqDocs = {\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};\nexports.smallerEqDocs = smallerEqDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.unequalDocs = void 0;\nvar unequalDocs = {\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};\nexports.unequalDocs = unequalDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.setCartesianDocs = void 0;\nvar setCartesianDocs = {\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 and the values will be sorted in ascending order before the operation.',\n  examples: ['setCartesian([1, 2], [3, 4])'],\n  seealso: ['setUnion', 'setIntersect', 'setDifference', 'setPowerset']\n};\nexports.setCartesianDocs = setCartesianDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.setDifferenceDocs = void 0;\nvar setDifferenceDocs = {\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};\nexports.setDifferenceDocs = setDifferenceDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.setDistinctDocs = void 0;\nvar setDistinctDocs = {\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};\nexports.setDistinctDocs = setDistinctDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.setIntersectDocs = void 0;\nvar setIntersectDocs = {\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};\nexports.setIntersectDocs = setIntersectDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.setIsSubsetDocs = void 0;\nvar setIsSubsetDocs = {\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};\nexports.setIsSubsetDocs = setIsSubsetDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.setMultiplicityDocs = void 0;\nvar setMultiplicityDocs = {\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};\nexports.setMultiplicityDocs = setMultiplicityDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.setPowersetDocs = void 0;\nvar setPowersetDocs = {\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};\nexports.setPowersetDocs = setPowersetDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.setSizeDocs = void 0;\nvar setSizeDocs = {\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};\nexports.setSizeDocs = setSizeDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.setSymDifferenceDocs = void 0;\nvar setSymDifferenceDocs = {\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};\nexports.setSymDifferenceDocs = setSymDifferenceDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.setUnionDocs = void 0;\nvar setUnionDocs = {\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};\nexports.setUnionDocs = setUnionDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.erfDocs = void 0;\nvar erfDocs = {\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};\nexports.erfDocs = erfDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.madDocs = void 0;\nvar madDocs = {\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};\nexports.madDocs = madDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.maxDocs = void 0;\nvar maxDocs = {\n  name: 'max',\n  category: 'Statistics',\n  syntax: ['max(a, b, c, ...)', 'max(A)', 'max(A, dimension)'],\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', 'variance']\n};\nexports.maxDocs = maxDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.meanDocs = void 0;\nvar meanDocs = {\n  name: 'mean',\n  category: 'Statistics',\n  syntax: ['mean(a, b, c, ...)', 'mean(A)', 'mean(A, dimension)'],\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', 'variance']\n};\nexports.meanDocs = meanDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.medianDocs = void 0;\nvar medianDocs = {\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', 'variance', 'quantileSeq']\n};\nexports.medianDocs = medianDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.minDocs = void 0;\nvar minDocs = {\n  name: 'min',\n  category: 'Statistics',\n  syntax: ['min(a, b, c, ...)', 'min(A)', 'min(A, dimension)'],\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', 'variance']\n};\nexports.minDocs = minDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.modeDocs = void 0;\nvar modeDocs = {\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', 'variance']\n};\nexports.modeDocs = modeDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.prodDocs = void 0;\nvar prodDocs = {\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', 'variance']\n};\nexports.prodDocs = prodDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.quantileSeqDocs = void 0;\nvar quantileSeqDocs = {\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', 'variance']\n};\nexports.quantileSeqDocs = quantileSeqDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.stdDocs = void 0;\nvar stdDocs = {\n  name: 'std',\n  category: 'Statistics',\n  syntax: ['std(a, b, c, ...)', 'std(A)', 'std(A, dimension)', 'std(A, normalization)', 'std(A, dimension, normalization)'],\n  description: 'Compute the standard deviation of all values, defined as std(A) = sqrt(variance(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', 'prod', 'sum', 'variance']\n};\nexports.stdDocs = stdDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.cumSumDocs = void 0;\nvar cumSumDocs = {\n  name: 'cumsum',\n  category: 'Statistics',\n  syntax: ['cumsum(a, b, c, ...)', 'cumsum(A)'],\n  description: 'Compute the cumulative sum of all values.',\n  examples: ['cumsum(2, 3, 4, 1)', 'cumsum([2, 3, 4, 1])', 'cumsum([1, 2; 3, 4])', 'cumsum([1, 2; 3, 4], 1)', 'cumsum([1, 2; 3, 4], 2)'],\n  seealso: ['max', 'mean', 'median', 'min', 'prod', 'std', 'sum', 'variance']\n};\nexports.cumSumDocs = cumSumDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.sumDocs = void 0;\nvar sumDocs = {\n  name: 'sum',\n  category: 'Statistics',\n  syntax: ['sum(a, b, c, ...)', 'sum(A)', 'sum(A, dimension)'],\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', 'variance']\n};\nexports.sumDocs = sumDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.varianceDocs = void 0;\nvar varianceDocs = {\n  name: 'variance',\n  category: 'Statistics',\n  syntax: ['variance(a, b, c, ...)', 'variance(A)', 'variance(A, dimension)', 'variance(A, normalization)', 'variance(A, dimension, normalization)'],\n  description: 'Compute the variance of all values. Optional parameter normalization can be \"unbiased\" (default), \"uncorrected\", or \"biased\".',\n  examples: ['variance(2, 4, 6)', 'variance([2, 4, 6, 8])', 'variance([2, 4, 6, 8], \"uncorrected\")', 'variance([2, 4, 6, 8], \"biased\")', 'variance([1, 2, 3; 4, 5, 6])'],\n  seealso: ['max', 'mean', 'min', 'median', 'min', 'prod', 'std', 'sum']\n};\nexports.varianceDocs = varianceDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.acosDocs = void 0;\nvar acosDocs = {\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};\nexports.acosDocs = acosDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.acoshDocs = void 0;\nvar acoshDocs = {\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};\nexports.acoshDocs = acoshDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.acotDocs = void 0;\nvar acotDocs = {\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};\nexports.acotDocs = acotDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.acothDocs = void 0;\nvar acothDocs = {\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};\nexports.acothDocs = acothDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.acscDocs = void 0;\nvar acscDocs = {\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};\nexports.acscDocs = acscDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.acschDocs = void 0;\nvar acschDocs = {\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};\nexports.acschDocs = acschDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.asecDocs = void 0;\nvar asecDocs = {\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};\nexports.asecDocs = asecDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.asechDocs = void 0;\nvar asechDocs = {\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};\nexports.asechDocs = asechDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.asinDocs = void 0;\nvar asinDocs = {\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};\nexports.asinDocs = asinDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.asinhDocs = void 0;\nvar asinhDocs = {\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};\nexports.asinhDocs = asinhDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.atanDocs = void 0;\nvar atanDocs = {\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};\nexports.atanDocs = atanDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.atan2Docs = void 0;\nvar atan2Docs = {\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};\nexports.atan2Docs = atan2Docs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.atanhDocs = void 0;\nvar atanhDocs = {\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};\nexports.atanhDocs = atanhDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.cosDocs = void 0;\nvar cosDocs = {\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};\nexports.cosDocs = cosDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.coshDocs = void 0;\nvar coshDocs = {\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};\nexports.coshDocs = coshDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.cotDocs = void 0;\nvar cotDocs = {\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};\nexports.cotDocs = cotDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.cothDocs = void 0;\nvar cothDocs = {\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};\nexports.cothDocs = cothDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.cscDocs = void 0;\nvar cscDocs = {\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};\nexports.cscDocs = cscDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.cschDocs = void 0;\nvar cschDocs = {\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};\nexports.cschDocs = cschDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.secDocs = void 0;\nvar secDocs = {\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};\nexports.secDocs = secDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.sechDocs = void 0;\nvar sechDocs = {\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};\nexports.sechDocs = sechDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.sinDocs = void 0;\nvar sinDocs = {\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};\nexports.sinDocs = sinDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.sinhDocs = void 0;\nvar sinhDocs = {\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};\nexports.sinhDocs = sinhDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.tanDocs = void 0;\nvar tanDocs = {\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};\nexports.tanDocs = tanDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.tanhDocs = void 0;\nvar tanhDocs = {\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};\nexports.tanhDocs = tanhDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.toDocs = void 0;\nvar toDocs = {\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};\nexports.toDocs = toDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.binDocs = void 0;\nvar binDocs = {\n  name: 'bin',\n  category: 'Utils',\n  syntax: ['bin(value)'],\n  description: 'Format a number as binary',\n  examples: ['bin(2)'],\n  seealso: ['oct', 'hex']\n};\nexports.binDocs = binDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.cloneDocs = void 0;\nvar cloneDocs = {\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};\nexports.cloneDocs = cloneDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.formatDocs = void 0;\nvar formatDocs = {\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};\nexports.formatDocs = formatDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.hasNumericValueDocs = void 0;\nvar hasNumericValueDocs = {\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};\nexports.hasNumericValueDocs = hasNumericValueDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.hexDocs = void 0;\nvar hexDocs = {\n  name: 'hex',\n  category: 'Utils',\n  syntax: ['hex(value)'],\n  description: 'Format a number as hexadecimal',\n  examples: ['hex(240)'],\n  seealso: ['bin', 'oct']\n};\nexports.hexDocs = hexDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.isIntegerDocs = void 0;\nvar isIntegerDocs = {\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};\nexports.isIntegerDocs = isIntegerDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.isNaNDocs = void 0;\nvar isNaNDocs = {\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};\nexports.isNaNDocs = isNaNDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.isNegativeDocs = void 0;\nvar isNegativeDocs = {\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};\nexports.isNegativeDocs = isNegativeDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.isNumericDocs = void 0;\nvar isNumericDocs = {\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};\nexports.isNumericDocs = isNumericDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.isPositiveDocs = void 0;\nvar isPositiveDocs = {\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};\nexports.isPositiveDocs = isPositiveDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.isPrimeDocs = void 0;\nvar isPrimeDocs = {\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};\nexports.isPrimeDocs = isPrimeDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.isZeroDocs = void 0;\nvar isZeroDocs = {\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};\nexports.isZeroDocs = isZeroDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.numericDocs = void 0;\nvar numericDocs = {\n  name: 'numeric',\n  category: 'Utils',\n  syntax: ['numeric(x)'],\n  description: 'Convert a numeric input to a specific numeric type: number, BigNumber, or Fraction.',\n  examples: ['numeric(\"4\")', 'numeric(\"4\", \"number\")', 'numeric(\"4\", \"BigNumber\")', 'numeric(\"4\", \"Fraction)', 'numeric(4, \"Fraction\")', 'numeric(fraction(2, 5), \"number)'],\n  seealso: ['number', 'fraction', 'bignumber', 'string', 'format']\n};\nexports.numericDocs = numericDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.octDocs = void 0;\nvar octDocs = {\n  name: 'oct',\n  category: 'Utils',\n  syntax: ['oct(value)'],\n  description: 'Format a number as octal',\n  examples: ['oct(56)'],\n  seealso: ['bin', 'hex']\n};\nexports.octDocs = octDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.printDocs = void 0;\nvar printDocs = {\n  name: 'print',\n  category: 'Utils',\n  syntax: ['print(template, values)', 'print(template, values, precision)'],\n  description: 'Interpolate values into a string template.',\n  examples: ['print(\"Lucy is $age years old\", {age: 5})', 'print(\"The value of pi is $pi\", {pi: pi}, 3)', 'print(\"Hello, $user.name!\", {user: {name: \"John\"}})', 'print(\"Values: $0, $1, $2\", [6, 9, 4])'],\n  seealso: ['format']\n};\nexports.printDocs = printDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.typeOfDocs = void 0;\nvar typeOfDocs = {\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};\nexports.typeOfDocs = typeOfDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.embeddedDocs = void 0;\nvar _e = require(\"./constants/e.js\");\nvar _false = require(\"./constants/false.js\");\nvar _i = require(\"./constants/i.js\");\nvar _Infinity = require(\"./constants/Infinity.js\");\nvar _LN = require(\"./constants/LN10.js\");\nvar _LN2 = require(\"./constants/LN2.js\");\nvar _LOG10E = require(\"./constants/LOG10E.js\");\nvar _LOG2E = require(\"./constants/LOG2E.js\");\nvar _NaN = require(\"./constants/NaN.js\");\nvar _null = require(\"./constants/null.js\");\nvar _phi = require(\"./constants/phi.js\");\nvar _pi = require(\"./constants/pi.js\");\nvar _SQRT1_ = require(\"./constants/SQRT1_2.js\");\nvar _SQRT = require(\"./constants/SQRT2.js\");\nvar _tau = require(\"./constants/tau.js\");\nvar _true = require(\"./constants/true.js\");\nvar _version = require(\"./constants/version.js\");\nvar _bignumber = require(\"./construction/bignumber.js\");\nvar _boolean = require(\"./construction/boolean.js\");\nvar _complex = require(\"./construction/complex.js\");\nvar _createUnit = require(\"./construction/createUnit.js\");\nvar _fraction = require(\"./construction/fraction.js\");\nvar _index = require(\"./construction/index.js\");\nvar _matrix = require(\"./construction/matrix.js\");\nvar _number = require(\"./construction/number.js\");\nvar _sparse = require(\"./construction/sparse.js\");\nvar _splitUnit = require(\"./construction/splitUnit.js\");\nvar _string = require(\"./construction/string.js\");\nvar _unit = require(\"./construction/unit.js\");\nvar _config = require(\"./core/config.js\");\nvar _import = require(\"./core/import.js\");\nvar _typed = require(\"./core/typed.js\");\nvar _derivative = require(\"./function/algebra/derivative.js\");\nvar _leafCount = require(\"./function/algebra/leafCount.js\");\nvar _lsolve = require(\"./function/algebra/lsolve.js\");\nvar _lsolveAll = require(\"./function/algebra/lsolveAll.js\");\nvar _lup = require(\"./function/algebra/lup.js\");\nvar _lusolve = require(\"./function/algebra/lusolve.js\");\nvar _polynomialRoot = require(\"./function/algebra/polynomialRoot.js\");\nvar _qr = require(\"./function/algebra/qr.js\");\nvar _rationalize = require(\"./function/algebra/rationalize.js\");\nvar _resolve = require(\"./function/algebra/resolve.js\");\nvar _simplify = require(\"./function/algebra/simplify.js\");\nvar _simplifyConstant = require(\"./function/algebra/simplifyConstant.js\");\nvar _simplifyCore = require(\"./function/algebra/simplifyCore.js\");\nvar _slu = require(\"./function/algebra/slu.js\");\nvar _symbolicEqual = require(\"./function/algebra/symbolicEqual.js\");\nvar _usolve = require(\"./function/algebra/usolve.js\");\nvar _usolveAll = require(\"./function/algebra/usolveAll.js\");\nvar _abs = require(\"./function/arithmetic/abs.js\");\nvar _add = require(\"./function/arithmetic/add.js\");\nvar _cbrt = require(\"./function/arithmetic/cbrt.js\");\nvar _ceil = require(\"./function/arithmetic/ceil.js\");\nvar _cube = require(\"./function/arithmetic/cube.js\");\nvar _divide = require(\"./function/arithmetic/divide.js\");\nvar _dotDivide = require(\"./function/arithmetic/dotDivide.js\");\nvar _dotMultiply = require(\"./function/arithmetic/dotMultiply.js\");\nvar _dotPow = require(\"./function/arithmetic/dotPow.js\");\nvar _exp = require(\"./function/arithmetic/exp.js\");\nvar _expm = require(\"./function/arithmetic/expm.js\");\nvar _expm2 = require(\"./function/arithmetic/expm1.js\");\nvar _fix = require(\"./function/arithmetic/fix.js\");\nvar _floor = require(\"./function/arithmetic/floor.js\");\nvar _gcd = require(\"./function/arithmetic/gcd.js\");\nvar _hypot = require(\"./function/arithmetic/hypot.js\");\nvar _invmod = require(\"./function/arithmetic/invmod.js\");\nvar _lcm = require(\"./function/arithmetic/lcm.js\");\nvar _log = require(\"./function/arithmetic/log.js\");\nvar _log2 = require(\"./function/arithmetic/log10.js\");\nvar _log1p = require(\"./function/arithmetic/log1p.js\");\nvar _log3 = require(\"./function/arithmetic/log2.js\");\nvar _mod = require(\"./function/arithmetic/mod.js\");\nvar _multiply = require(\"./function/arithmetic/multiply.js\");\nvar _norm = require(\"./function/arithmetic/norm.js\");\nvar _nthRoot = require(\"./function/arithmetic/nthRoot.js\");\nvar _nthRoots = require(\"./function/arithmetic/nthRoots.js\");\nvar _pow = require(\"./function/arithmetic/pow.js\");\nvar _round = require(\"./function/arithmetic/round.js\");\nvar _sign = require(\"./function/arithmetic/sign.js\");\nvar _sqrt = require(\"./function/arithmetic/sqrt.js\");\nvar _sqrtm = require(\"./function/arithmetic/sqrtm.js\");\nvar _sylvester = require(\"./function/matrix/sylvester.js\");\nvar _schur = require(\"./function/matrix/schur.js\");\nvar _lyap = require(\"./function/matrix/lyap.js\");\nvar _square = require(\"./function/arithmetic/square.js\");\nvar _subtract = require(\"./function/arithmetic/subtract.js\");\nvar _unaryMinus = require(\"./function/arithmetic/unaryMinus.js\");\nvar _unaryPlus = require(\"./function/arithmetic/unaryPlus.js\");\nvar _xgcd = require(\"./function/arithmetic/xgcd.js\");\nvar _bitAnd = require(\"./function/bitwise/bitAnd.js\");\nvar _bitNot = require(\"./function/bitwise/bitNot.js\");\nvar _bitOr = require(\"./function/bitwise/bitOr.js\");\nvar _bitXor = require(\"./function/bitwise/bitXor.js\");\nvar _leftShift = require(\"./function/bitwise/leftShift.js\");\nvar _rightArithShift = require(\"./function/bitwise/rightArithShift.js\");\nvar _rightLogShift = require(\"./function/bitwise/rightLogShift.js\");\nvar _bellNumbers = require(\"./function/combinatorics/bellNumbers.js\");\nvar _catalan = require(\"./function/combinatorics/catalan.js\");\nvar _composition = require(\"./function/combinatorics/composition.js\");\nvar _stirlingS = require(\"./function/combinatorics/stirlingS2.js\");\nvar _arg = require(\"./function/complex/arg.js\");\nvar _conj = require(\"./function/complex/conj.js\");\nvar _im = require(\"./function/complex/im.js\");\nvar _re = require(\"./function/complex/re.js\");\nvar _evaluate = require(\"./function/expression/evaluate.js\");\nvar _help = require(\"./function/expression/help.js\");\nvar _distance = require(\"./function/geometry/distance.js\");\nvar _intersect = require(\"./function/geometry/intersect.js\");\nvar _and = require(\"./function/logical/and.js\");\nvar _not = require(\"./function/logical/not.js\");\nvar _or = require(\"./function/logical/or.js\");\nvar _xor = require(\"./function/logical/xor.js\");\nvar _column = require(\"./function/matrix/column.js\");\nvar _concat = require(\"./function/matrix/concat.js\");\nvar _count = require(\"./function/matrix/count.js\");\nvar _cross = require(\"./function/matrix/cross.js\");\nvar _ctranspose = require(\"./function/matrix/ctranspose.js\");\nvar _det = require(\"./function/matrix/det.js\");\nvar _diag = require(\"./function/matrix/diag.js\");\nvar _diff = require(\"./function/matrix/diff.js\");\nvar _dot = require(\"./function/matrix/dot.js\");\nvar _eigs = require(\"./function/matrix/eigs.js\");\nvar _filter = require(\"./function/matrix/filter.js\");\nvar _flatten = require(\"./function/matrix/flatten.js\");\nvar _forEach = require(\"./function/matrix/forEach.js\");\nvar _getMatrixDataType = require(\"./function/matrix/getMatrixDataType.js\");\nvar _identity = require(\"./function/matrix/identity.js\");\nvar _inv = require(\"./function/matrix/inv.js\");\nvar _pinv = require(\"./function/matrix/pinv.js\");\nvar _kron = require(\"./function/matrix/kron.js\");\nvar _map = require(\"./function/matrix/map.js\");\nvar _matrixFromColumns = require(\"./function/matrix/matrixFromColumns.js\");\nvar _matrixFromFunction = require(\"./function/matrix/matrixFromFunction.js\");\nvar _matrixFromRows = require(\"./function/matrix/matrixFromRows.js\");\nvar _ones = require(\"./function/matrix/ones.js\");\nvar _partitionSelect = require(\"./function/matrix/partitionSelect.js\");\nvar _range = require(\"./function/matrix/range.js\");\nvar _reshape = require(\"./function/matrix/reshape.js\");\nvar _resize = require(\"./function/matrix/resize.js\");\nvar _rotate = require(\"./function/matrix/rotate.js\");\nvar _rotationMatrix = require(\"./function/matrix/rotationMatrix.js\");\nvar _row = require(\"./function/matrix/row.js\");\nvar _size = require(\"./function/matrix/size.js\");\nvar _sort = require(\"./function/matrix/sort.js\");\nvar _squeeze = require(\"./function/matrix/squeeze.js\");\nvar _subset = require(\"./function/matrix/subset.js\");\nvar _trace = require(\"./function/matrix/trace.js\");\nvar _transpose = require(\"./function/matrix/transpose.js\");\nvar _zeros = require(\"./function/matrix/zeros.js\");\nvar _fft = require(\"./function/matrix/fft.js\");\nvar _ifft = require(\"./function/matrix/ifft.js\");\nvar _combinations = require(\"./function/probability/combinations.js\");\nvar _combinationsWithRep = require(\"./function/probability/combinationsWithRep.js\");\nvar _factorial = require(\"./function/probability/factorial.js\");\nvar _gamma = require(\"./function/probability/gamma.js\");\nvar _lgamma = require(\"./function/probability/lgamma.js\");\nvar _kldivergence = require(\"./function/probability/kldivergence.js\");\nvar _multinomial = require(\"./function/probability/multinomial.js\");\nvar _permutations = require(\"./function/probability/permutations.js\");\nvar _pickRandom = require(\"./function/probability/pickRandom.js\");\nvar _random = require(\"./function/probability/random.js\");\nvar _randomInt = require(\"./function/probability/randomInt.js\");\nvar _compare = require(\"./function/relational/compare.js\");\nvar _compareNatural = require(\"./function/relational/compareNatural.js\");\nvar _compareText = require(\"./function/relational/compareText.js\");\nvar _deepEqual = require(\"./function/relational/deepEqual.js\");\nvar _equal = require(\"./function/relational/equal.js\");\nvar _equalText = require(\"./function/relational/equalText.js\");\nvar _larger = require(\"./function/relational/larger.js\");\nvar _largerEq = require(\"./function/relational/largerEq.js\");\nvar _smaller = require(\"./function/relational/smaller.js\");\nvar _smallerEq = require(\"./function/relational/smallerEq.js\");\nvar _unequal = require(\"./function/relational/unequal.js\");\nvar _setCartesian = require(\"./function/set/setCartesian.js\");\nvar _setDifference = require(\"./function/set/setDifference.js\");\nvar _setDistinct = require(\"./function/set/setDistinct.js\");\nvar _setIntersect = require(\"./function/set/setIntersect.js\");\nvar _setIsSubset = require(\"./function/set/setIsSubset.js\");\nvar _setMultiplicity = require(\"./function/set/setMultiplicity.js\");\nvar _setPowerset = require(\"./function/set/setPowerset.js\");\nvar _setSize = require(\"./function/set/setSize.js\");\nvar _setSymDifference = require(\"./function/set/setSymDifference.js\");\nvar _setUnion = require(\"./function/set/setUnion.js\");\nvar _erf = require(\"./function/special/erf.js\");\nvar _mad = require(\"./function/statistics/mad.js\");\nvar _max = require(\"./function/statistics/max.js\");\nvar _mean = require(\"./function/statistics/mean.js\");\nvar _median = require(\"./function/statistics/median.js\");\nvar _min = require(\"./function/statistics/min.js\");\nvar _mode = require(\"./function/statistics/mode.js\");\nvar _prod = require(\"./function/statistics/prod.js\");\nvar _quantileSeq = require(\"./function/statistics/quantileSeq.js\");\nvar _std = require(\"./function/statistics/std.js\");\nvar _cumsum = require(\"./function/statistics/cumsum.js\");\nvar _sum = require(\"./function/statistics/sum.js\");\nvar _variance = require(\"./function/statistics/variance.js\");\nvar _acos = require(\"./function/trigonometry/acos.js\");\nvar _acosh = require(\"./function/trigonometry/acosh.js\");\nvar _acot = require(\"./function/trigonometry/acot.js\");\nvar _acoth = require(\"./function/trigonometry/acoth.js\");\nvar _acsc = require(\"./function/trigonometry/acsc.js\");\nvar _acsch = require(\"./function/trigonometry/acsch.js\");\nvar _asec = require(\"./function/trigonometry/asec.js\");\nvar _asech = require(\"./function/trigonometry/asech.js\");\nvar _asin = require(\"./function/trigonometry/asin.js\");\nvar _asinh = require(\"./function/trigonometry/asinh.js\");\nvar _atan = require(\"./function/trigonometry/atan.js\");\nvar _atan2 = require(\"./function/trigonometry/atan2.js\");\nvar _atanh = require(\"./function/trigonometry/atanh.js\");\nvar _cos = require(\"./function/trigonometry/cos.js\");\nvar _cosh = require(\"./function/trigonometry/cosh.js\");\nvar _cot = require(\"./function/trigonometry/cot.js\");\nvar _coth = require(\"./function/trigonometry/coth.js\");\nvar _csc = require(\"./function/trigonometry/csc.js\");\nvar _csch = require(\"./function/trigonometry/csch.js\");\nvar _sec = require(\"./function/trigonometry/sec.js\");\nvar _sech = require(\"./function/trigonometry/sech.js\");\nvar _sin = require(\"./function/trigonometry/sin.js\");\nvar _sinh = require(\"./function/trigonometry/sinh.js\");\nvar _tan = require(\"./function/trigonometry/tan.js\");\nvar _tanh = require(\"./function/trigonometry/tanh.js\");\nvar _to = require(\"./function/units/to.js\");\nvar _bin = require(\"./function/utils/bin.js\");\nvar _clone = require(\"./function/utils/clone.js\");\nvar _format = require(\"./function/utils/format.js\");\nvar _hasNumericValue = require(\"./function/utils/hasNumericValue.js\");\nvar _hex = require(\"./function/utils/hex.js\");\nvar _isInteger = require(\"./function/utils/isInteger.js\");\nvar _isNaN = require(\"./function/utils/isNaN.js\");\nvar _isNegative = require(\"./function/utils/isNegative.js\");\nvar _isNumeric = require(\"./function/utils/isNumeric.js\");\nvar _isPositive = require(\"./function/utils/isPositive.js\");\nvar _isPrime = require(\"./function/utils/isPrime.js\");\nvar _isZero = require(\"./function/utils/isZero.js\");\nvar _numeric = require(\"./function/utils/numeric.js\");\nvar _oct = require(\"./function/utils/oct.js\");\nvar _print = require(\"./function/utils/print.js\");\nvar _typeOf = require(\"./function/utils/typeOf.js\");\nvar embeddedDocs = {\n  // construction functions\n  bignumber: _bignumber.bignumberDocs,\n  \"boolean\": _boolean.booleanDocs,\n  complex: _complex.complexDocs,\n  createUnit: _createUnit.createUnitDocs,\n  fraction: _fraction.fractionDocs,\n  index: _index.indexDocs,\n  matrix: _matrix.matrixDocs,\n  number: _number.numberDocs,\n  sparse: _sparse.sparseDocs,\n  splitUnit: _splitUnit.splitUnitDocs,\n  string: _string.stringDocs,\n  unit: _unit.unitDocs,\n  // constants\n  e: _e.eDocs,\n  E: _e.eDocs,\n  \"false\": _false.falseDocs,\n  i: _i.iDocs,\n  Infinity: _Infinity.InfinityDocs,\n  LN2: _LN2.LN2Docs,\n  LN10: _LN.LN10Docs,\n  LOG2E: _LOG2E.LOG2EDocs,\n  LOG10E: _LOG10E.LOG10EDocs,\n  NaN: _NaN.NaNDocs,\n  \"null\": _null.nullDocs,\n  pi: _pi.piDocs,\n  PI: _pi.piDocs,\n  phi: _phi.phiDocs,\n  SQRT1_2: _SQRT1_.SQRT12Docs,\n  SQRT2: _SQRT.SQRT2Docs,\n  tau: _tau.tauDocs,\n  \"true\": _true.trueDocs,\n  version: _version.versionDocs,\n  // physical constants\n  // TODO: more detailed docs for physical constants\n  speedOfLight: {\n    description: 'Speed of light in vacuum',\n    examples: ['speedOfLight']\n  },\n  gravitationConstant: {\n    description: 'Newtonian constant of gravitation',\n    examples: ['gravitationConstant']\n  },\n  planckConstant: {\n    description: 'Planck constant',\n    examples: ['planckConstant']\n  },\n  reducedPlanckConstant: {\n    description: 'Reduced Planck constant',\n    examples: ['reducedPlanckConstant']\n  },\n  magneticConstant: {\n    description: 'Magnetic constant (vacuum permeability)',\n    examples: ['magneticConstant']\n  },\n  electricConstant: {\n    description: 'Electric constant (vacuum permeability)',\n    examples: ['electricConstant']\n  },\n  vacuumImpedance: {\n    description: 'Characteristic impedance of vacuum',\n    examples: ['vacuumImpedance']\n  },\n  coulomb: {\n    description: 'Coulomb\\'s constant',\n    examples: ['coulomb']\n  },\n  elementaryCharge: {\n    description: 'Elementary charge',\n    examples: ['elementaryCharge']\n  },\n  bohrMagneton: {\n    description: 'Borh magneton',\n    examples: ['bohrMagneton']\n  },\n  conductanceQuantum: {\n    description: 'Conductance quantum',\n    examples: ['conductanceQuantum']\n  },\n  inverseConductanceQuantum: {\n    description: 'Inverse conductance quantum',\n    examples: ['inverseConductanceQuantum']\n  },\n  // josephson: {description: 'Josephson constant', examples: ['josephson']},\n  magneticFluxQuantum: {\n    description: 'Magnetic flux quantum',\n    examples: ['magneticFluxQuantum']\n  },\n  nuclearMagneton: {\n    description: 'Nuclear magneton',\n    examples: ['nuclearMagneton']\n  },\n  klitzing: {\n    description: 'Von Klitzing constant',\n    examples: ['klitzing']\n  },\n  bohrRadius: {\n    description: 'Borh radius',\n    examples: ['bohrRadius']\n  },\n  classicalElectronRadius: {\n    description: 'Classical electron radius',\n    examples: ['classicalElectronRadius']\n  },\n  electronMass: {\n    description: 'Electron mass',\n    examples: ['electronMass']\n  },\n  fermiCoupling: {\n    description: 'Fermi coupling constant',\n    examples: ['fermiCoupling']\n  },\n  fineStructure: {\n    description: 'Fine-structure constant',\n    examples: ['fineStructure']\n  },\n  hartreeEnergy: {\n    description: 'Hartree energy',\n    examples: ['hartreeEnergy']\n  },\n  protonMass: {\n    description: 'Proton mass',\n    examples: ['protonMass']\n  },\n  deuteronMass: {\n    description: 'Deuteron Mass',\n    examples: ['deuteronMass']\n  },\n  neutronMass: {\n    description: 'Neutron mass',\n    examples: ['neutronMass']\n  },\n  quantumOfCirculation: {\n    description: 'Quantum of circulation',\n    examples: ['quantumOfCirculation']\n  },\n  rydberg: {\n    description: 'Rydberg constant',\n    examples: ['rydberg']\n  },\n  thomsonCrossSection: {\n    description: 'Thomson cross section',\n    examples: ['thomsonCrossSection']\n  },\n  weakMixingAngle: {\n    description: 'Weak mixing angle',\n    examples: ['weakMixingAngle']\n  },\n  efimovFactor: {\n    description: 'Efimov factor',\n    examples: ['efimovFactor']\n  },\n  atomicMass: {\n    description: 'Atomic mass constant',\n    examples: ['atomicMass']\n  },\n  avogadro: {\n    description: 'Avogadro\\'s number',\n    examples: ['avogadro']\n  },\n  boltzmann: {\n    description: 'Boltzmann constant',\n    examples: ['boltzmann']\n  },\n  faraday: {\n    description: 'Faraday constant',\n    examples: ['faraday']\n  },\n  firstRadiation: {\n    description: 'First radiation constant',\n    examples: ['firstRadiation']\n  },\n  loschmidt: {\n    description: 'Loschmidt constant at T=273.15 K and p=101.325 kPa',\n    examples: ['loschmidt']\n  },\n  gasConstant: {\n    description: 'Gas constant',\n    examples: ['gasConstant']\n  },\n  molarPlanckConstant: {\n    description: 'Molar Planck constant',\n    examples: ['molarPlanckConstant']\n  },\n  molarVolume: {\n    description: 'Molar volume of an ideal gas at T=273.15 K and p=101.325 kPa',\n    examples: ['molarVolume']\n  },\n  sackurTetrode: {\n    description: 'Sackur-Tetrode constant at T=1 K and p=101.325 kPa',\n    examples: ['sackurTetrode']\n  },\n  secondRadiation: {\n    description: 'Second radiation constant',\n    examples: ['secondRadiation']\n  },\n  stefanBoltzmann: {\n    description: 'Stefan-Boltzmann constant',\n    examples: ['stefanBoltzmann']\n  },\n  wienDisplacement: {\n    description: 'Wien displacement law constant',\n    examples: ['wienDisplacement']\n  },\n  // spectralRadiance: {description: 'First radiation constant for spectral radiance', examples: ['spectralRadiance']},\n\n  molarMass: {\n    description: 'Molar mass constant',\n    examples: ['molarMass']\n  },\n  molarMassC12: {\n    description: 'Molar mass constant of carbon-12',\n    examples: ['molarMassC12']\n  },\n  gravity: {\n    description: 'Standard acceleration of gravity (standard acceleration of free-fall on Earth)',\n    examples: ['gravity']\n  },\n  planckLength: {\n    description: 'Planck length',\n    examples: ['planckLength']\n  },\n  planckMass: {\n    description: 'Planck mass',\n    examples: ['planckMass']\n  },\n  planckTime: {\n    description: 'Planck time',\n    examples: ['planckTime']\n  },\n  planckCharge: {\n    description: 'Planck charge',\n    examples: ['planckCharge']\n  },\n  planckTemperature: {\n    description: 'Planck temperature',\n    examples: ['planckTemperature']\n  },\n  // functions - algebra\n  derivative: _derivative.derivativeDocs,\n  lsolve: _lsolve.lsolveDocs,\n  lsolveAll: _lsolveAll.lsolveAllDocs,\n  lup: _lup.lupDocs,\n  lusolve: _lusolve.lusolveDocs,\n  leafCount: _leafCount.leafCountDocs,\n  polynomialRoot: _polynomialRoot.polynomialRootDocs,\n  resolve: _resolve.resolveDocs,\n  simplify: _simplify.simplifyDocs,\n  simplifyConstant: _simplifyConstant.simplifyConstantDocs,\n  simplifyCore: _simplifyCore.simplifyCoreDocs,\n  symbolicEqual: _symbolicEqual.symbolicEqualDocs,\n  rationalize: _rationalize.rationalizeDocs,\n  slu: _slu.sluDocs,\n  usolve: _usolve.usolveDocs,\n  usolveAll: _usolveAll.usolveAllDocs,\n  qr: _qr.qrDocs,\n  // functions - arithmetic\n  abs: _abs.absDocs,\n  add: _add.addDocs,\n  cbrt: _cbrt.cbrtDocs,\n  ceil: _ceil.ceilDocs,\n  cube: _cube.cubeDocs,\n  divide: _divide.divideDocs,\n  dotDivide: _dotDivide.dotDivideDocs,\n  dotMultiply: _dotMultiply.dotMultiplyDocs,\n  dotPow: _dotPow.dotPowDocs,\n  exp: _exp.expDocs,\n  expm: _expm.expmDocs,\n  expm1: _expm2.expm1Docs,\n  fix: _fix.fixDocs,\n  floor: _floor.floorDocs,\n  gcd: _gcd.gcdDocs,\n  hypot: _hypot.hypotDocs,\n  lcm: _lcm.lcmDocs,\n  log: _log.logDocs,\n  log2: _log3.log2Docs,\n  log1p: _log1p.log1pDocs,\n  log10: _log2.log10Docs,\n  mod: _mod.modDocs,\n  multiply: _multiply.multiplyDocs,\n  norm: _norm.normDocs,\n  nthRoot: _nthRoot.nthRootDocs,\n  nthRoots: _nthRoots.nthRootsDocs,\n  pow: _pow.powDocs,\n  round: _round.roundDocs,\n  sign: _sign.signDocs,\n  sqrt: _sqrt.sqrtDocs,\n  sqrtm: _sqrtm.sqrtmDocs,\n  square: _square.squareDocs,\n  subtract: _subtract.subtractDocs,\n  unaryMinus: _unaryMinus.unaryMinusDocs,\n  unaryPlus: _unaryPlus.unaryPlusDocs,\n  xgcd: _xgcd.xgcdDocs,\n  invmod: _invmod.invmodDocs,\n  // functions - bitwise\n  bitAnd: _bitAnd.bitAndDocs,\n  bitNot: _bitNot.bitNotDocs,\n  bitOr: _bitOr.bitOrDocs,\n  bitXor: _bitXor.bitXorDocs,\n  leftShift: _leftShift.leftShiftDocs,\n  rightArithShift: _rightArithShift.rightArithShiftDocs,\n  rightLogShift: _rightLogShift.rightLogShiftDocs,\n  // functions - combinatorics\n  bellNumbers: _bellNumbers.bellNumbersDocs,\n  catalan: _catalan.catalanDocs,\n  composition: _composition.compositionDocs,\n  stirlingS2: _stirlingS.stirlingS2Docs,\n  // functions - core\n  config: _config.configDocs,\n  \"import\": _import.importDocs,\n  typed: _typed.typedDocs,\n  // functions - complex\n  arg: _arg.argDocs,\n  conj: _conj.conjDocs,\n  re: _re.reDocs,\n  im: _im.imDocs,\n  // functions - expression\n  evaluate: _evaluate.evaluateDocs,\n  help: _help.helpDocs,\n  // functions - geometry\n  distance: _distance.distanceDocs,\n  intersect: _intersect.intersectDocs,\n  // functions - logical\n  and: _and.andDocs,\n  not: _not.notDocs,\n  or: _or.orDocs,\n  xor: _xor.xorDocs,\n  // functions - matrix\n  concat: _concat.concatDocs,\n  count: _count.countDocs,\n  cross: _cross.crossDocs,\n  column: _column.columnDocs,\n  ctranspose: _ctranspose.ctransposeDocs,\n  det: _det.detDocs,\n  diag: _diag.diagDocs,\n  diff: _diff.diffDocs,\n  dot: _dot.dotDocs,\n  getMatrixDataType: _getMatrixDataType.getMatrixDataTypeDocs,\n  identity: _identity.identityDocs,\n  filter: _filter.filterDocs,\n  flatten: _flatten.flattenDocs,\n  forEach: _forEach.forEachDocs,\n  inv: _inv.invDocs,\n  pinv: _pinv.pinvDocs,\n  eigs: _eigs.eigsDocs,\n  kron: _kron.kronDocs,\n  matrixFromFunction: _matrixFromFunction.matrixFromFunctionDocs,\n  matrixFromRows: _matrixFromRows.matrixFromRowsDocs,\n  matrixFromColumns: _matrixFromColumns.matrixFromColumnsDocs,\n  map: _map.mapDocs,\n  ones: _ones.onesDocs,\n  partitionSelect: _partitionSelect.partitionSelectDocs,\n  range: _range.rangeDocs,\n  resize: _resize.resizeDocs,\n  reshape: _reshape.reshapeDocs,\n  rotate: _rotate.rotateDocs,\n  rotationMatrix: _rotationMatrix.rotationMatrixDocs,\n  row: _row.rowDocs,\n  size: _size.sizeDocs,\n  sort: _sort.sortDocs,\n  squeeze: _squeeze.squeezeDocs,\n  subset: _subset.subsetDocs,\n  trace: _trace.traceDocs,\n  transpose: _transpose.transposeDocs,\n  zeros: _zeros.zerosDocs,\n  fft: _fft.fftDocs,\n  ifft: _ifft.ifftDocs,\n  sylvester: _sylvester.sylvesterDocs,\n  schur: _schur.schurDocs,\n  lyap: _lyap.lyapDocs,\n  // functions - probability\n  combinations: _combinations.combinationsDocs,\n  combinationsWithRep: _combinationsWithRep.combinationsWithRepDocs,\n  // distribution: distributionDocs,\n  factorial: _factorial.factorialDocs,\n  gamma: _gamma.gammaDocs,\n  kldivergence: _kldivergence.kldivergenceDocs,\n  lgamma: _lgamma.lgammaDocs,\n  multinomial: _multinomial.multinomialDocs,\n  permutations: _permutations.permutationsDocs,\n  pickRandom: _pickRandom.pickRandomDocs,\n  random: _random.randomDocs,\n  randomInt: _randomInt.randomIntDocs,\n  // functions - relational\n  compare: _compare.compareDocs,\n  compareNatural: _compareNatural.compareNaturalDocs,\n  compareText: _compareText.compareTextDocs,\n  deepEqual: _deepEqual.deepEqualDocs,\n  equal: _equal.equalDocs,\n  equalText: _equalText.equalTextDocs,\n  larger: _larger.largerDocs,\n  largerEq: _largerEq.largerEqDocs,\n  smaller: _smaller.smallerDocs,\n  smallerEq: _smallerEq.smallerEqDocs,\n  unequal: _unequal.unequalDocs,\n  // functions - set\n  setCartesian: _setCartesian.setCartesianDocs,\n  setDifference: _setDifference.setDifferenceDocs,\n  setDistinct: _setDistinct.setDistinctDocs,\n  setIntersect: _setIntersect.setIntersectDocs,\n  setIsSubset: _setIsSubset.setIsSubsetDocs,\n  setMultiplicity: _setMultiplicity.setMultiplicityDocs,\n  setPowerset: _setPowerset.setPowersetDocs,\n  setSize: _setSize.setSizeDocs,\n  setSymDifference: _setSymDifference.setSymDifferenceDocs,\n  setUnion: _setUnion.setUnionDocs,\n  // functions - special\n  erf: _erf.erfDocs,\n  // functions - statistics\n  cumsum: _cumsum.cumSumDocs,\n  mad: _mad.madDocs,\n  max: _max.maxDocs,\n  mean: _mean.meanDocs,\n  median: _median.medianDocs,\n  min: _min.minDocs,\n  mode: _mode.modeDocs,\n  prod: _prod.prodDocs,\n  quantileSeq: _quantileSeq.quantileSeqDocs,\n  std: _std.stdDocs,\n  sum: _sum.sumDocs,\n  variance: _variance.varianceDocs,\n  // functions - trigonometry\n  acos: _acos.acosDocs,\n  acosh: _acosh.acoshDocs,\n  acot: _acot.acotDocs,\n  acoth: _acoth.acothDocs,\n  acsc: _acsc.acscDocs,\n  acsch: _acsch.acschDocs,\n  asec: _asec.asecDocs,\n  asech: _asech.asechDocs,\n  asin: _asin.asinDocs,\n  asinh: _asinh.asinhDocs,\n  atan: _atan.atanDocs,\n  atanh: _atanh.atanhDocs,\n  atan2: _atan2.atan2Docs,\n  cos: _cos.cosDocs,\n  cosh: _cosh.coshDocs,\n  cot: _cot.cotDocs,\n  coth: _coth.cothDocs,\n  csc: _csc.cscDocs,\n  csch: _csch.cschDocs,\n  sec: _sec.secDocs,\n  sech: _sech.sechDocs,\n  sin: _sin.sinDocs,\n  sinh: _sinh.sinhDocs,\n  tan: _tan.tanDocs,\n  tanh: _tanh.tanhDocs,\n  // functions - units\n  to: _to.toDocs,\n  // functions - utils\n  clone: _clone.cloneDocs,\n  format: _format.formatDocs,\n  bin: _bin.binDocs,\n  oct: _oct.octDocs,\n  hex: _hex.hexDocs,\n  isNaN: _isNaN.isNaNDocs,\n  isInteger: _isInteger.isIntegerDocs,\n  isNegative: _isNegative.isNegativeDocs,\n  isNumeric: _isNumeric.isNumericDocs,\n  hasNumericValue: _hasNumericValue.hasNumericValueDocs,\n  isPositive: _isPositive.isPositiveDocs,\n  isPrime: _isPrime.isPrimeDocs,\n  isZero: _isZero.isZeroDocs,\n  print: _print.printDocs,\n  typeOf: _typeOf.typeOfDocs,\n  numeric: _numeric.numericDocs\n};\nexports.embeddedDocs = embeddedDocs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createHelp = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _customs = require(\"../../utils/customs.js\");\nvar _embeddedDocs = require(\"../embeddedDocs/embeddedDocs.js\");\nvar _object = require(\"../../utils/object.js\");\nvar name = 'help';\nvar dependencies = ['typed', 'mathWithTransform', 'Help'];\nvar createHelp = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    mathWithTransform = _ref.mathWithTransform,\n    Help = _ref.Help;\n  /**\n   * Retrieve help on a function or data type.\n   * Help files are retrieved from the embedded documentation in math.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  return typed(name, {\n    any: function any(search) {\n      var prop;\n      var searchName = search;\n      if (typeof search !== 'string') {\n        for (prop in mathWithTransform) {\n          // search in functions and constants\n          if ((0, _object.hasOwnProperty)(mathWithTransform, prop) && search === mathWithTransform[prop]) {\n            searchName = prop;\n            break;\n          }\n        }\n\n        /* TODO: implement help for data types\n         if (!text) {\n         // search data type\n         for (prop in math.type) {\n         if (hasOwnProperty(math, prop)) {\n         if (search === math.type[prop]) {\n         text = prop\n         break\n         }\n         }\n         }\n         }\n         */\n      }\n\n      var doc = (0, _customs.getSafeProperty)(_embeddedDocs.embeddedDocs, searchName);\n      if (!doc) {\n        var searchText = typeof searchName === 'function' ? searchName.name : searchName;\n        throw new Error('No documentation found on \"' + searchText + '\"');\n      }\n      return new Help(doc);\n    }\n  });\n});\nexports.createHelp = createHelp;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createChain = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar name = 'chain';\nvar dependencies = ['typed', 'Chain'];\nvar createChain = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    Chain = _ref.Chain;\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.Chain} The created chain\n   */\n  return typed(name, {\n    '': function _() {\n      return new Chain();\n    },\n    any: function any(value) {\n      return new Chain(value);\n    }\n  });\n});\nexports.createChain = createChain;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createDet = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _object = require(\"../../utils/object.js\");\nvar _string = require(\"../../utils/string.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'det';\nvar dependencies = ['typed', 'matrix', 'subtract', 'multiply', 'divideScalar', 'isZero', 'unaryMinus'];\nvar createDet = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    subtract = _ref.subtract,\n    multiply = _ref.multiply,\n    divideScalar = _ref.divideScalar,\n    isZero = _ref.isZero,\n    unaryMinus = _ref.unaryMinus;\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  return typed(name, {\n    any: function any(x) {\n      return (0, _object.clone)(x);\n    },\n    'Array | Matrix': function det(x) {\n      var size;\n      if ((0, _is.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      switch (size.length) {\n        case 0:\n          // scalar\n          return (0, _object.clone)(x);\n        case 1:\n          // vector\n          if (size[0] === 1) {\n            return (0, _object.clone)(x.valueOf()[0]);\n          }\n          if (size[0] === 0) {\n            return 1; // det of an empty matrix is per definition 1\n          } else {\n            throw new RangeError('Matrix must be square ' + '(size: ' + (0, _string.format)(size) + ')');\n          }\n        case 2:\n          {\n            // two-dimensional array\n            var rows = size[0];\n            var cols = size[1];\n            if (rows === cols) {\n              return _det(x.clone().valueOf(), rows, cols);\n            }\n            if (cols === 0) {\n              return 1; // det of an empty matrix is per definition 1\n            } else {\n              throw new RangeError('Matrix must be square ' + '(size: ' + (0, _string.format)(size) + ')');\n            }\n          }\n        default:\n          // multi dimensional array\n          throw new RangeError('Matrix must be two dimensional ' + '(size: ' + (0, _string.format)(size) + ')');\n      }\n    }\n  });\n\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  function _det(matrix, rows, cols) {\n    if (rows === 1) {\n      // this is a 1 x 1 matrix\n      return (0, _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      // Bareiss algorithm\n      // this algorithm have same complexity as LUP decomposition (O(n^3))\n      // but it preserve precision of floating point more relative to the LUP decomposition\n      var negated = false;\n      var rowIndices = new Array(rows).fill(0).map(function (_, i) {\n        return i;\n      }); // matrix index of row i\n      for (var k = 0; k < rows; k++) {\n        var k_ = rowIndices[k];\n        if (isZero(matrix[k_][k])) {\n          var _k = void 0;\n          for (_k = k + 1; _k < rows; _k++) {\n            if (!isZero(matrix[rowIndices[_k]][k])) {\n              k_ = rowIndices[_k];\n              rowIndices[_k] = rowIndices[k];\n              rowIndices[k] = k_;\n              negated = !negated;\n              break;\n            }\n          }\n          if (_k === rows) return matrix[k_][k]; // some zero of the type\n        }\n\n        var piv = matrix[k_][k];\n        var piv_ = k === 0 ? 1 : matrix[rowIndices[k - 1]][k - 1];\n        for (var i = k + 1; i < rows; i++) {\n          var i_ = rowIndices[i];\n          for (var j = k + 1; j < rows; j++) {\n            matrix[i_][j] = divideScalar(subtract(multiply(matrix[i_][j], piv), multiply(matrix[i_][k], matrix[k_][j])), piv_);\n          }\n        }\n      }\n      var det = matrix[rowIndices[rows - 1]][rows - 1];\n      return negated ? unaryMinus(det) : det;\n    }\n  }\n});\nexports.createDet = createDet;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createInv = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _string = require(\"../../utils/string.js\");\nvar name = 'inv';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'addScalar', 'multiply', 'unaryMinus', 'det', 'identity', 'abs'];\nvar createInv = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    divideScalar = _ref.divideScalar,\n    addScalar = _ref.addScalar,\n    multiply = _ref.multiply,\n    unaryMinus = _ref.unaryMinus,\n    det = _ref.det,\n    identity = _ref.identity,\n    abs = _ref.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  return typed(name, {\n    'Array | Matrix': function ArrayMatrix(x) {\n      var size = (0, _is.isMatrix)(x) ? x.size() : (0, _array.arraySize)(x);\n      switch (size.length) {\n        case 1:\n          // vector\n          if (size[0] === 1) {\n            if ((0, _is.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: ' + (0, _string.format)(size) + ')');\n          }\n        case 2:\n          // two dimensional array\n          {\n            var rows = size[0];\n            var cols = size[1];\n            if (rows === cols) {\n              if ((0, _is.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: ' + (0, _string.format)(size) + ')');\n            }\n          }\n        default:\n          // multi dimensional array\n          throw new RangeError('Matrix must be two dimensional ' + '(size: ' + (0, _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  /**\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  function _inv(mat, rows, cols) {\n    var r, s, f, value, temp;\n    if (rows === 1) {\n      // this is a 1 x 1 matrix\n      value = mat[0][0];\n      if (value === 0) {\n        throw Error('Cannot calculate inverse, determinant is zero');\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      if (d === 0) {\n        throw Error('Cannot calculate inverse, determinant is zero');\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\n      // make a copy of the matrix (only the arrays, not of the elements)\n      var A = mat.concat();\n      for (r = 0; r < rows; r++) {\n        A[r] = A[r].concat();\n      }\n\n      // create an identity matrix which in the end will contain the\n      // matrix inverse\n      var B = identity(rows).valueOf();\n\n      // loop over all columns, and perform row reductions\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        while (r < rows) {\n          if (abs(A[r][c]) > ABig) {\n            ABig = abs(A[r][c]);\n            rBig = r;\n          }\n          r++;\n        }\n        if (ABig === 0) {\n          throw Error('Cannot calculate inverse, determinant is zero');\n        }\n        r = rBig;\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        }\n\n        // eliminate non-zero values on the other rows at column c\n        var Ac = A[c];\n        var Bc = B[c];\n        for (r = 0; r < rows; r++) {\n          var Ar = A[r];\n          var Br = B[r];\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]);\n\n              // add (f * row c) to row r to eliminate the value\n              // at column c\n              for (s = c; s < cols; s++) {\n                Ar[s] = addScalar(Ar[s], multiply(f, Ac[s]));\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            for (s = c; s < cols; s++) {\n              Ar[s] = divideScalar(Ar[s], f);\n            }\n            for (s = 0; s < cols; s++) {\n              Br[s] = divideScalar(Br[s], f);\n            }\n          }\n        }\n      }\n      return B;\n    }\n  }\n});\nexports.createInv = createInv;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createPinv = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _string = require(\"../../utils/string.js\");\nvar _object = require(\"../../utils/object.js\");\nvar name = 'pinv';\nvar dependencies = ['typed', 'matrix', 'inv', 'deepEqual', 'equal', 'dotDivide', 'dot', 'ctranspose', 'divideScalar', 'multiply', 'add', 'Complex'];\nvar createPinv = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    inv = _ref.inv,\n    deepEqual = _ref.deepEqual,\n    equal = _ref.equal,\n    dotDivide = _ref.dotDivide,\n    dot = _ref.dot,\n    ctranspose = _ref.ctranspose,\n    divideScalar = _ref.divideScalar,\n    multiply = _ref.multiply,\n    add = _ref.add,\n    Complex = _ref.Complex;\n  /**\n   * Calculate the Moore–Penrose inverse of a matrix.\n   *\n   * Syntax:\n   *\n   *     math.pinv(x)\n   *\n   * Examples:\n   *\n   *     math.pinv([[1, 2], [3, 4]])          // returns [[-2, 1], [1.5, -0.5]]\n   *     math.pinv([[1, 0], [0, 1], [0, 1]])  // returns [[1, 0, 0], [0, 0.5, 0.5]]\n   *     math.pinv(4)                         // returns 0.25\n   *\n   * See also:\n   *\n   *     inv\n   *\n   * @param {number | Complex | Array | Matrix} x     Matrix to be inversed\n   * @return {number | Complex | Array | Matrix} The inverse of `x`.\n   */\n  return typed(name, {\n    'Array | Matrix': function ArrayMatrix(x) {\n      var size = (0, _is.isMatrix)(x) ? x.size() : (0, _array.arraySize)(x);\n      switch (size.length) {\n        case 1:\n          // vector\n          if (_isZeros(x)) return ctranspose(x); // null vector\n          if (size[0] === 1) {\n            return inv(x); // invertible matrix\n          } else {\n            return dotDivide(ctranspose(x), dot(x, x));\n          }\n        case 2:\n          // two dimensional array\n          {\n            if (_isZeros(x)) return ctranspose(x); // zero matrixx\n            var rows = size[0];\n            var cols = size[1];\n            if (rows === cols) {\n              try {\n                return inv(x); // invertible matrix\n              } catch (err) {\n                if (err instanceof Error && err.message.match(/Cannot calculate inverse, determinant is zero/)) {\n                  // Expected\n                } else {\n                  throw err;\n                }\n              }\n            }\n            if ((0, _is.isMatrix)(x)) {\n              return matrix(_pinv(x.valueOf(), rows, cols), x.storage());\n            } else {\n              // return an Array\n              return _pinv(x, rows, cols);\n            }\n          }\n        default:\n          // multi dimensional array\n          throw new RangeError('Matrix must be two dimensional ' + '(size: ' + (0, _string.format)(size) + ')');\n      }\n    },\n    any: function any(x) {\n      // scalar\n      if (equal(x, 0)) return (0, _object.clone)(x); // zero\n      return divideScalar(1, x);\n    }\n  });\n\n  /**\n   * Calculate the Moore–Penrose inverse of a matrix\n   * @param {Array[]} mat     A matrix\n   * @param {number} rows     Number of rows\n   * @param {number} cols     Number of columns\n   * @return {Array[]} pinv    Pseudoinverse matrix\n   * @private\n   */\n  function _pinv(mat, rows, cols) {\n    var _rankFact2 = _rankFact(mat, rows, cols),\n      C = _rankFact2.C,\n      F = _rankFact2.F; // TODO: Use SVD instead (may improve precision)\n    var Cpinv = multiply(inv(multiply(ctranspose(C), C)), ctranspose(C));\n    var Fpinv = multiply(ctranspose(F), inv(multiply(F, ctranspose(F))));\n    return multiply(Fpinv, Cpinv);\n  }\n\n  /**\n   * Calculate the reduced row echelon form of a matrix\n   *\n   * Modified from https://rosettacode.org/wiki/Reduced_row_echelon_form\n   *\n   * @param {Array[]} mat     A matrix\n   * @param {number} rows     Number of rows\n   * @param {number} cols     Number of columns\n   * @return {Array[]}        Reduced row echelon form\n   * @private\n   */\n  function _rref(mat, rows, cols) {\n    var M = (0, _object.clone)(mat);\n    var lead = 0;\n    for (var r = 0; r < rows; r++) {\n      if (cols <= lead) {\n        return M;\n      }\n      var i = r;\n      while (_isZero(M[i][lead])) {\n        i++;\n        if (rows === i) {\n          i = r;\n          lead++;\n          if (cols === lead) {\n            return M;\n          }\n        }\n      }\n      var _ref2 = [M[r], M[i]];\n      M[i] = _ref2[0];\n      M[r] = _ref2[1];\n      var val = M[r][lead];\n      for (var j = 0; j < cols; j++) {\n        M[r][j] = dotDivide(M[r][j], val);\n      }\n      for (var _i = 0; _i < rows; _i++) {\n        if (_i === r) continue;\n        val = M[_i][lead];\n        for (var _j = 0; _j < cols; _j++) {\n          M[_i][_j] = add(M[_i][_j], multiply(-1, multiply(val, M[r][_j])));\n        }\n      }\n      lead++;\n    }\n    return M;\n  }\n\n  /**\n   * Calculate the rank factorization of a matrix\n   *\n   * @param {Array[]} mat                  A matrix (M)\n   * @param {number} rows                  Number of rows\n   * @param {number} cols                  Number of columns\n   * @return {{C: Array, F: Array}}        rank factorization where M = C F\n   * @private\n   */\n  function _rankFact(mat, rows, cols) {\n    var rref = _rref(mat, rows, cols);\n    var C = mat.map(function (_, i) {\n      return _.filter(function (_, j) {\n        return j < rows && !_isZero(dot(rref[j], rref[j]));\n      });\n    });\n    var F = rref.filter(function (_, i) {\n      return !_isZero(dot(rref[i], rref[i]));\n    });\n    return {\n      C: C,\n      F: F\n    };\n  }\n  function _isZero(x) {\n    return equal(add(x, Complex(1, 1)), add(0, Complex(1, 1)));\n  }\n  function _isZeros(arr) {\n    return deepEqual(add(arr, Complex(1, 1)), add(multiply(arr, 0), Complex(1, 1)));\n  }\n});\nexports.createPinv = createPinv;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createComplexEigs = createComplexEigs;\nvar _toConsumableArray2 = _interopRequireDefault(require(\"@babel/runtime/helpers/toConsumableArray\"));\nvar _object = require(\"../../../utils/object.js\");\nfunction _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it[\"return\"] != null) it[\"return\"](); } finally { if (didErr) throw err; } } }; }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }\nfunction createComplexEigs(_ref) {\n  var addScalar = _ref.addScalar,\n    subtract = _ref.subtract,\n    flatten = _ref.flatten,\n    multiply = _ref.multiply,\n    multiplyScalar = _ref.multiplyScalar,\n    divideScalar = _ref.divideScalar,\n    sqrt = _ref.sqrt,\n    abs = _ref.abs,\n    bignumber = _ref.bignumber,\n    diag = _ref.diag,\n    inv = _ref.inv,\n    qr = _ref.qr,\n    usolve = _ref.usolve,\n    usolveAll = _ref.usolveAll,\n    equal = _ref.equal,\n    complex = _ref.complex,\n    larger = _ref.larger,\n    smaller = _ref.smaller,\n    matrixFromColumns = _ref.matrixFromColumns,\n    dot = _ref.dot;\n  /**\n   * @param {number[][]} arr the matrix to find eigenvalues of\n   * @param {number} N size of the matrix\n   * @param {number|BigNumber} prec precision, anything lower will be considered zero\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @param {boolean} findVectors should we find eigenvectors?\n   *\n   * @returns {{ values: number[], vectors: number[][] }}\n   */\n  function complexEigs(arr, N, prec, type, findVectors) {\n    if (findVectors === undefined) {\n      findVectors = true;\n    }\n\n    // TODO check if any row/col are zero except the diagonal\n\n    // make sure corresponding rows and columns have similar magnitude\n    // important because of numerical stability\n    // MODIFIES arr by side effect!\n    var R = balance(arr, N, prec, type, findVectors);\n\n    // R is the row transformation matrix\n    // arr = A' = R A R⁻¹, A is the original matrix\n    // (if findVectors is false, R is undefined)\n    // (And so to return to original matrix: A = R⁻¹ arr R)\n\n    // TODO if magnitudes of elements vary over many orders,\n    // move greatest elements to the top left corner\n\n    // using similarity transformations, reduce the matrix\n    // to Hessenberg form (upper triangular plus one subdiagonal row)\n    // updates the transformation matrix R with new row operationsq\n    // MODIFIES arr by side effect!\n    reduceToHessenberg(arr, N, prec, type, findVectors, R);\n    // still true that original A = R⁻¹ arr R)\n\n    // find eigenvalues\n    var _iterateUntilTriangul = iterateUntilTriangular(arr, N, prec, type, findVectors),\n      values = _iterateUntilTriangul.values,\n      C = _iterateUntilTriangul.C;\n\n    // values is the list of eigenvalues, C is the column\n    // transformation matrix that transforms arr, the hessenberg\n    // matrix, to upper triangular\n    // (So U = C⁻¹ arr C and the relationship between current arr\n    // and original A is unchanged.)\n\n    var vectors;\n    if (findVectors) {\n      vectors = findEigenvectors(arr, N, C, R, values, prec, type);\n      vectors = matrixFromColumns.apply(void 0, (0, _toConsumableArray2[\"default\"])(vectors));\n    }\n    return {\n      values: values,\n      vectors: vectors\n    };\n  }\n\n  /**\n   * @param {number[][]} arr\n   * @param {number} N\n   * @param {number} prec\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @returns {number[][]}\n   */\n  function balance(arr, N, prec, type, findVectors) {\n    var big = type === 'BigNumber';\n    var cplx = type === 'Complex';\n    var realzero = big ? bignumber(0) : 0;\n    var one = big ? bignumber(1) : cplx ? complex(1) : 1;\n    var realone = big ? bignumber(1) : 1;\n\n    // base of the floating-point arithmetic\n    var radix = big ? bignumber(10) : 2;\n    var radixSq = multiplyScalar(radix, radix);\n\n    // the diagonal transformation matrix R\n    var Rdiag;\n    if (findVectors) {\n      Rdiag = Array(N).fill(one);\n    }\n\n    // this isn't the only time we loop thru the matrix...\n    var last = false;\n    while (!last) {\n      // ...haha I'm joking! unless...\n      last = true;\n      for (var i = 0; i < N; i++) {\n        // compute the taxicab norm of i-th column and row\n        // TODO optimize for complex numbers\n        var colNorm = realzero;\n        var rowNorm = realzero;\n        for (var j = 0; j < N; j++) {\n          if (i === j) continue;\n          var c = abs(arr[i][j]); // should be real\n          colNorm = addScalar(colNorm, c);\n          rowNorm = addScalar(rowNorm, c);\n        }\n        if (!equal(colNorm, 0) && !equal(rowNorm, 0)) {\n          // find integer power closest to balancing the matrix\n          // (we want to scale only by integer powers of radix,\n          // so that we don't lose any precision due to round-off)\n\n          var f = realone;\n          var _c = colNorm;\n          var rowDivRadix = divideScalar(rowNorm, radix);\n          var rowMulRadix = multiplyScalar(rowNorm, radix);\n          while (smaller(_c, rowDivRadix)) {\n            _c = multiplyScalar(_c, radixSq);\n            f = multiplyScalar(f, radix);\n          }\n          while (larger(_c, rowMulRadix)) {\n            _c = divideScalar(_c, radixSq);\n            f = divideScalar(f, radix);\n          }\n\n          // check whether balancing is needed\n          // condition = (c + rowNorm) / f < 0.95 * (colNorm + rowNorm)\n          var condition = smaller(divideScalar(addScalar(_c, rowNorm), f), multiplyScalar(addScalar(colNorm, rowNorm), 0.95));\n\n          // apply balancing similarity transformation\n          if (condition) {\n            // we should loop once again to check whether\n            // another rebalancing is needed\n            last = false;\n            var g = divideScalar(1, f);\n            for (var _j = 0; _j < N; _j++) {\n              if (i === _j) {\n                continue;\n              }\n              arr[i][_j] = multiplyScalar(arr[i][_j], f);\n              arr[_j][i] = multiplyScalar(arr[_j][i], g);\n            }\n\n            // keep track of transformations\n            if (findVectors) {\n              Rdiag[i] = multiplyScalar(Rdiag[i], f);\n            }\n          }\n        }\n      }\n    }\n\n    // return the diagonal row transformation matrix\n    return diag(Rdiag);\n  }\n\n  /**\n   * @param {number[][]} arr\n   * @param {number} N\n   * @param {number} prec\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @param {boolean} findVectors\n   * @param {number[][]} R the row transformation matrix that will be modified\n   */\n  function reduceToHessenberg(arr, N, prec, type, findVectors, R) {\n    var big = type === 'BigNumber';\n    var cplx = type === 'Complex';\n    var zero = big ? bignumber(0) : cplx ? complex(0) : 0;\n    if (big) {\n      prec = bignumber(prec);\n    }\n    for (var i = 0; i < N - 2; i++) {\n      // Find the largest subdiag element in the i-th col\n\n      var maxIndex = 0;\n      var max = zero;\n      for (var j = i + 1; j < N; j++) {\n        var el = arr[j][i];\n        if (smaller(abs(max), abs(el))) {\n          max = el;\n          maxIndex = j;\n        }\n      }\n\n      // This col is pivoted, no need to do anything\n      if (smaller(abs(max), prec)) {\n        continue;\n      }\n      if (maxIndex !== i + 1) {\n        // Interchange maxIndex-th and (i+1)-th row\n        var tmp1 = arr[maxIndex];\n        arr[maxIndex] = arr[i + 1];\n        arr[i + 1] = tmp1;\n\n        // Interchange maxIndex-th and (i+1)-th column\n        for (var _j2 = 0; _j2 < N; _j2++) {\n          var tmp2 = arr[_j2][maxIndex];\n          arr[_j2][maxIndex] = arr[_j2][i + 1];\n          arr[_j2][i + 1] = tmp2;\n        }\n\n        // keep track of transformations\n        if (findVectors) {\n          var tmp3 = R[maxIndex];\n          R[maxIndex] = R[i + 1];\n          R[i + 1] = tmp3;\n        }\n      }\n\n      // Reduce following rows and columns\n      for (var _j3 = i + 2; _j3 < N; _j3++) {\n        var n = divideScalar(arr[_j3][i], max);\n        if (n === 0) {\n          continue;\n        }\n\n        // from j-th row subtract n-times (i+1)th row\n        for (var k = 0; k < N; k++) {\n          arr[_j3][k] = subtract(arr[_j3][k], multiplyScalar(n, arr[i + 1][k]));\n        }\n\n        // to (i+1)th column add n-times j-th column\n        for (var _k = 0; _k < N; _k++) {\n          arr[_k][i + 1] = addScalar(arr[_k][i + 1], multiplyScalar(n, arr[_k][_j3]));\n        }\n\n        // keep track of transformations\n        if (findVectors) {\n          for (var _k2 = 0; _k2 < N; _k2++) {\n            R[_j3][_k2] = subtract(R[_j3][_k2], multiplyScalar(n, R[i + 1][_k2]));\n          }\n        }\n      }\n    }\n    return R;\n  }\n\n  /**\n   * @returns {{values: values, C: Matrix}}\n   * @see Press, Wiliams: Numerical recipes in Fortran 77\n   * @see https://en.wikipedia.org/wiki/QR_algorithm\n   */\n  function iterateUntilTriangular(A, N, prec, type, findVectors) {\n    var big = type === 'BigNumber';\n    var cplx = type === 'Complex';\n    var one = big ? bignumber(1) : cplx ? complex(1) : 1;\n    if (big) {\n      prec = bignumber(prec);\n    }\n\n    // The Francis Algorithm\n    // The core idea of this algorithm is that doing successive\n    // A' = Q⁺AQ transformations will eventually converge to block-\n    // upper-triangular with diagonal blocks either 1x1 or 2x2.\n    // The Q here is the one from the QR decomposition, A = QR.\n    // Since the eigenvalues of a block-upper-triangular matrix are\n    // the eigenvalues of its diagonal blocks and we know how to find\n    // eigenvalues of a 2x2 matrix, we know the eigenvalues of A.\n\n    var arr = (0, _object.clone)(A);\n\n    // the list of converged eigenvalues\n    var lambdas = [];\n\n    // size of arr, which will get smaller as eigenvalues converge\n    var n = N;\n\n    // the diagonal of the block-diagonal matrix that turns\n    // converged 2x2 matrices into upper triangular matrices\n    var Sdiag = [];\n\n    // N×N matrix describing the overall transformation done during the QR algorithm\n    var Qtotal = findVectors ? diag(Array(N).fill(one)) : undefined;\n\n    // n×n matrix describing the QR transformations done since last convergence\n    var Qpartial = findVectors ? diag(Array(n).fill(one)) : undefined;\n\n    // last eigenvalue converged before this many steps\n    var lastConvergenceBefore = 0;\n    while (lastConvergenceBefore <= 100) {\n      lastConvergenceBefore += 1;\n\n      // TODO if the convergence is slow, do something clever\n\n      // Perform the factorization\n\n      var k = 0; // TODO set close to an eigenvalue\n\n      for (var i = 0; i < n; i++) {\n        arr[i][i] = subtract(arr[i][i], k);\n      }\n\n      // TODO do an implicit QR transformation\n      var _qr = qr(arr),\n        Q = _qr.Q,\n        R = _qr.R;\n      arr = multiply(R, Q);\n      for (var _i = 0; _i < n; _i++) {\n        arr[_i][_i] = addScalar(arr[_i][_i], k);\n      }\n\n      // keep track of transformations\n      if (findVectors) {\n        Qpartial = multiply(Qpartial, Q);\n      }\n\n      // The rightmost diagonal element converged to an eigenvalue\n      if (n === 1 || smaller(abs(arr[n - 1][n - 2]), prec)) {\n        lastConvergenceBefore = 0;\n        lambdas.push(arr[n - 1][n - 1]);\n\n        // keep track of transformations\n        if (findVectors) {\n          Sdiag.unshift([[1]]);\n          inflateMatrix(Qpartial, N);\n          Qtotal = multiply(Qtotal, Qpartial);\n          if (n > 1) {\n            Qpartial = diag(Array(n - 1).fill(one));\n          }\n        }\n\n        // reduce the matrix size\n        n -= 1;\n        arr.pop();\n        for (var _i2 = 0; _i2 < n; _i2++) {\n          arr[_i2].pop();\n        }\n\n        // The rightmost diagonal 2x2 block converged\n      } else if (n === 2 || smaller(abs(arr[n - 2][n - 3]), prec)) {\n        lastConvergenceBefore = 0;\n        var ll = eigenvalues2x2(arr[n - 2][n - 2], arr[n - 2][n - 1], arr[n - 1][n - 2], arr[n - 1][n - 1]);\n        lambdas.push.apply(lambdas, (0, _toConsumableArray2[\"default\"])(ll));\n\n        // keep track of transformations\n        if (findVectors) {\n          Sdiag.unshift(jordanBase2x2(arr[n - 2][n - 2], arr[n - 2][n - 1], arr[n - 1][n - 2], arr[n - 1][n - 1], ll[0], ll[1], prec, type));\n          inflateMatrix(Qpartial, N);\n          Qtotal = multiply(Qtotal, Qpartial);\n          if (n > 2) {\n            Qpartial = diag(Array(n - 2).fill(one));\n          }\n        }\n\n        // reduce the matrix size\n        n -= 2;\n        arr.pop();\n        arr.pop();\n        for (var _i3 = 0; _i3 < n; _i3++) {\n          arr[_i3].pop();\n          arr[_i3].pop();\n        }\n      }\n      if (n === 0) {\n        break;\n      }\n    }\n\n    // standard sorting\n    lambdas.sort(function (a, b) {\n      return +subtract(abs(a), abs(b));\n    });\n\n    // the algorithm didn't converge\n    if (lastConvergenceBefore > 100) {\n      var err = Error('The eigenvalues failed to converge. Only found these eigenvalues: ' + lambdas.join(', '));\n      err.values = lambdas;\n      err.vectors = [];\n      throw err;\n    }\n\n    // combine the overall QR transformation Qtotal with the subsequent\n    // transformation S that turns the diagonal 2x2 blocks to upper triangular\n    var C = findVectors ? multiply(Qtotal, blockDiag(Sdiag, N)) : undefined;\n    return {\n      values: lambdas,\n      C: C\n    };\n  }\n\n  /**\n   * @param {Matrix} A hessenberg-form matrix\n   * @param {number} N size of A\n   * @param {Matrix} C column transformation matrix that turns A into upper triangular\n   * @param {Matrix} R similarity that turns original matrix into A\n   * @param {number[]} values array of eigenvalues of A\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @returns {number[][]} eigenvalues\n   */\n  function findEigenvectors(A, N, C, R, values, prec, type) {\n    var Cinv = inv(C);\n    var U = multiply(Cinv, A, C);\n    var big = type === 'BigNumber';\n    var cplx = type === 'Complex';\n    var zero = big ? bignumber(0) : cplx ? complex(0) : 0;\n    var one = big ? bignumber(1) : cplx ? complex(1) : 1;\n\n    // turn values into a kind of \"multiset\"\n    // this way it is easier to find eigenvectors\n    var uniqueValues = [];\n    var multiplicities = [];\n    var _iterator = _createForOfIteratorHelper(values),\n      _step;\n    try {\n      for (_iterator.s(); !(_step = _iterator.n()).done;) {\n        var λ = _step.value;\n        var _i4 = indexOf(uniqueValues, λ, equal);\n        if (_i4 === -1) {\n          uniqueValues.push(λ);\n          multiplicities.push(1);\n        } else {\n          multiplicities[_i4] += 1;\n        }\n      }\n\n      // find eigenvectors by solving U − λE = 0\n      // TODO replace with an iterative eigenvector algorithm\n      // (this one might fail for imprecise eigenvalues)\n    } catch (err) {\n      _iterator.e(err);\n    } finally {\n      _iterator.f();\n    }\n    var vectors = [];\n    var len = uniqueValues.length;\n    var b = Array(N).fill(zero);\n    var E = diag(Array(N).fill(one));\n\n    // eigenvalues for which usolve failed (due to numerical error)\n    var failedLambdas = [];\n    var _loop = function _loop(i) {\n      var λ = uniqueValues[i];\n      var S = subtract(U, multiply(λ, E)); // the characteristic matrix\n\n      var solutions = usolveAll(S, b);\n      solutions.shift(); // ignore the null vector\n\n      // looks like we missed something, try inverse iteration\n      while (solutions.length < multiplicities[i]) {\n        var approxVec = inverseIterate(S, N, solutions, prec, type);\n        if (approxVec == null) {\n          // no more vectors were found\n          failedLambdas.push(λ);\n          break;\n        }\n        solutions.push(approxVec);\n      }\n\n      // Transform back into original array coordinates\n      var correction = multiply(inv(R), C);\n      solutions = solutions.map(function (v) {\n        return multiply(correction, v);\n      });\n      vectors.push.apply(vectors, (0, _toConsumableArray2[\"default\"])(solutions.map(function (v) {\n        return flatten(v);\n      })));\n    };\n    for (var i = 0; i < len; i++) {\n      _loop(i);\n    }\n    if (failedLambdas.length !== 0) {\n      var err = new Error('Failed to find eigenvectors for the following eigenvalues: ' + failedLambdas.join(', '));\n      err.values = values;\n      err.vectors = vectors;\n      throw err;\n    }\n    return vectors;\n  }\n\n  /**\n   * Compute the eigenvalues of an 2x2 matrix\n   * @return {[number,number]}\n   */\n  function eigenvalues2x2(a, b, c, d) {\n    // λ± = ½ trA ± ½ √( tr²A - 4 detA )\n    var trA = addScalar(a, d);\n    var detA = subtract(multiplyScalar(a, d), multiplyScalar(b, c));\n    var x = multiplyScalar(trA, 0.5);\n    var y = multiplyScalar(sqrt(subtract(multiplyScalar(trA, trA), multiplyScalar(4, detA))), 0.5);\n    return [addScalar(x, y), subtract(x, y)];\n  }\n\n  /**\n   * For an 2x2 matrix compute the transformation matrix S,\n   * so that SAS⁻¹ is an upper triangular matrix\n   * @return {[[number,number],[number,number]]}\n   * @see https://math.berkeley.edu/~ogus/old/Math_54-05/webfoils/jordan.pdf\n   * @see http://people.math.harvard.edu/~knill/teaching/math21b2004/exhibits/2dmatrices/index.html\n   */\n  function jordanBase2x2(a, b, c, d, l1, l2, prec, type) {\n    var big = type === 'BigNumber';\n    var cplx = type === 'Complex';\n    var zero = big ? bignumber(0) : cplx ? complex(0) : 0;\n    var one = big ? bignumber(1) : cplx ? complex(1) : 1;\n\n    // matrix is already upper triangular\n    // return an identity matrix\n    if (smaller(abs(c), prec)) {\n      return [[one, zero], [zero, one]];\n    }\n\n    // matrix is diagonalizable\n    // return its eigenvectors as columns\n    if (larger(abs(subtract(l1, l2)), prec)) {\n      return [[subtract(l1, d), subtract(l2, d)], [c, c]];\n    }\n\n    // matrix is not diagonalizable\n    // compute off-diagonal elements of N = A - λI\n    // N₁₂ = 0 ⇒ S = ( N⃗₁, I⃗₁ )\n    // N₁₂ ≠ 0 ⇒ S = ( N⃗₂, I⃗₂ )\n\n    var na = subtract(a, l1);\n    var nb = subtract(b, l1);\n    var nc = subtract(c, l1);\n    var nd = subtract(d, l1);\n    if (smaller(abs(nb), prec)) {\n      return [[na, one], [nc, zero]];\n    } else {\n      return [[nb, zero], [nd, one]];\n    }\n  }\n\n  /**\n   * Enlarge the matrix from n×n to N×N, setting the new\n   * elements to 1 on diagonal and 0 elsewhere\n   */\n  function inflateMatrix(arr, N) {\n    // add columns\n    for (var i = 0; i < arr.length; i++) {\n      var _arr$i;\n      (_arr$i = arr[i]).push.apply(_arr$i, (0, _toConsumableArray2[\"default\"])(Array(N - arr[i].length).fill(0)));\n    }\n\n    // add rows\n    for (var _i5 = arr.length; _i5 < N; _i5++) {\n      arr.push(Array(N).fill(0));\n      arr[_i5][_i5] = 1;\n    }\n    return arr;\n  }\n\n  /**\n   * Create a block-diagonal matrix with the given square matrices on the diagonal\n   * @param {Matrix[] | number[][][]} arr array of matrices to be placed on the diagonal\n   * @param {number} N the size of the resulting matrix\n   */\n  function blockDiag(arr, N) {\n    var M = [];\n    for (var i = 0; i < N; i++) {\n      M[i] = Array(N).fill(0);\n    }\n    var I = 0;\n    var _iterator2 = _createForOfIteratorHelper(arr),\n      _step2;\n    try {\n      for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {\n        var sub = _step2.value;\n        var n = sub.length;\n        for (var _i6 = 0; _i6 < n; _i6++) {\n          for (var j = 0; j < n; j++) {\n            M[I + _i6][I + j] = sub[_i6][j];\n          }\n        }\n        I += n;\n      }\n    } catch (err) {\n      _iterator2.e(err);\n    } finally {\n      _iterator2.f();\n    }\n    return M;\n  }\n\n  /**\n   * Finds the index of an element in an array using a custom equality function\n   * @template T\n   * @param {Array<T>} arr array in which to search\n   * @param {T} el the element to find\n   * @param {function(T, T): boolean} fn the equality function, first argument is an element of `arr`, the second is always `el`\n   * @returns {number} the index of `el`, or -1 when it's not in `arr`\n   */\n  function indexOf(arr, el, fn) {\n    for (var i = 0; i < arr.length; i++) {\n      if (fn(arr[i], el)) {\n        return i;\n      }\n    }\n    return -1;\n  }\n\n  /**\n   * Provided a near-singular upper-triangular matrix A and a list of vectors,\n   * finds an eigenvector of A with the smallest eigenvalue, which is orthogonal\n   * to each vector in the list\n   * @template T\n   * @param {T[][]} A near-singular square matrix\n   * @param {number} N dimension\n   * @param {T[][]} orthog list of vectors\n   * @param {number} prec epsilon\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @return {T[] | null} eigenvector\n   *\n   * @see Numerical Recipes for Fortran 77 – 11.7 Eigenvalues or Eigenvectors by Inverse Iteration\n   */\n  function inverseIterate(A, N, orthog, prec, type) {\n    var largeNum = type === 'BigNumber' ? bignumber(1000) : 1000;\n    var b; // the vector\n\n    // you better choose a random vector before I count to five\n    var i = 0;\n    while (true) {\n      b = randomOrthogonalVector(N, orthog, type);\n      b = usolve(A, b);\n      if (larger(norm(b), largeNum)) {\n        break;\n      }\n      if (++i >= 5) {\n        return null;\n      }\n    }\n\n    // you better converge before I count to ten\n    i = 0;\n    while (true) {\n      var c = usolve(A, b);\n      if (smaller(norm(orthogonalComplement(b, [c])), prec)) {\n        break;\n      }\n      if (++i >= 10) {\n        return null;\n      }\n      b = normalize(c);\n    }\n    return b;\n  }\n\n  /**\n   * Generates a random unit vector of dimension N, orthogonal to each vector in the list\n   * @template T\n   * @param {number} N dimension\n   * @param {T[][]} orthog list of vectors\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @returns {T[]} random vector\n   */\n  function randomOrthogonalVector(N, orthog, type) {\n    var big = type === 'BigNumber';\n    var cplx = type === 'Complex';\n\n    // generate random vector with the correct type\n    var v = Array(N).fill(0).map(function (_) {\n      return 2 * Math.random() - 1;\n    });\n    if (big) {\n      v = v.map(function (n) {\n        return bignumber(n);\n      });\n    }\n    if (cplx) {\n      v = v.map(function (n) {\n        return complex(n);\n      });\n    }\n\n    // project to orthogonal complement\n    v = orthogonalComplement(v, orthog);\n\n    // normalize\n    return normalize(v, type);\n  }\n\n  /**\n   * Project vector v to the orthogonal complement of an array of vectors\n   */\n  function orthogonalComplement(v, orthog) {\n    var _iterator3 = _createForOfIteratorHelper(orthog),\n      _step3;\n    try {\n      for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {\n        var w = _step3.value;\n        // v := v − (w, v)/∥w∥² w\n        v = subtract(v, multiply(divideScalar(dot(w, v), dot(w, w)), w));\n      }\n    } catch (err) {\n      _iterator3.e(err);\n    } finally {\n      _iterator3.f();\n    }\n    return v;\n  }\n\n  /**\n   * Calculate the norm of a vector.\n   * We can't use math.norm because factory can't handle circular dependency.\n   * Seriously, I'm really fed up with factory.\n   */\n  function norm(v) {\n    return abs(sqrt(dot(v, v)));\n  }\n\n  /**\n   * Normalize a vector\n   * @template T\n   * @param {T[]} v\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @returns {T[]} normalized vec\n   */\n  function normalize(v, type) {\n    var big = type === 'BigNumber';\n    var cplx = type === 'Complex';\n    var one = big ? bignumber(1) : cplx ? complex(1) : 1;\n    return multiply(divideScalar(one, norm(v)), v);\n  }\n  return complexEigs;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createRealSymmetric = createRealSymmetric;\nvar _object = require(\"../../../utils/object.js\");\nfunction createRealSymmetric(_ref) {\n  var config = _ref.config,\n    addScalar = _ref.addScalar,\n    subtract = _ref.subtract,\n    abs = _ref.abs,\n    atan = _ref.atan,\n    cos = _ref.cos,\n    sin = _ref.sin,\n    multiplyScalar = _ref.multiplyScalar,\n    inv = _ref.inv,\n    bignumber = _ref.bignumber,\n    multiply = _ref.multiply,\n    add = _ref.add;\n  /**\n   * @param {number[] | BigNumber[]} arr\n   * @param {number} N\n   * @param {number} prec\n   * @param {'number' | 'BigNumber'} type\n   */\n  function main(arr, N) {\n    var prec = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : config.epsilon;\n    var type = arguments.length > 3 ? arguments[3] : undefined;\n    if (type === 'number') {\n      return diag(arr, prec);\n    }\n    if (type === 'BigNumber') {\n      return diagBig(arr, prec);\n    }\n    throw TypeError('Unsupported data type: ' + type);\n  }\n\n  // diagonalization implementation for number (efficient)\n  function diag(x, precision) {\n    var N = x.length;\n    var e0 = Math.abs(precision / N);\n    var psi;\n    var Sij = new Array(N);\n    // Sij is Identity Matrix\n    for (var i = 0; i < N; i++) {\n      Sij[i] = createArray(N, 0);\n      Sij[i][i] = 1.0;\n    }\n    // initial error\n    var Vab = getAij(x);\n    while (Math.abs(Vab[1]) >= Math.abs(e0)) {\n      var _i = Vab[0][0];\n      var j = Vab[0][1];\n      psi = getTheta(x[_i][_i], x[j][j], x[_i][j]);\n      x = x1(x, psi, _i, j);\n      Sij = Sij1(Sij, psi, _i, j);\n      Vab = getAij(x);\n    }\n    var Ei = createArray(N, 0); // eigenvalues\n    for (var _i2 = 0; _i2 < N; _i2++) {\n      Ei[_i2] = x[_i2][_i2];\n    }\n    return sorting((0, _object.clone)(Ei), (0, _object.clone)(Sij));\n  }\n\n  // diagonalization implementation for bigNumber\n  function diagBig(x, precision) {\n    var N = x.length;\n    var e0 = abs(precision / N);\n    var psi;\n    var Sij = new Array(N);\n    // Sij is Identity Matrix\n    for (var i = 0; i < N; i++) {\n      Sij[i] = createArray(N, 0);\n      Sij[i][i] = 1.0;\n    }\n    // initial error\n    var Vab = getAijBig(x);\n    while (abs(Vab[1]) >= abs(e0)) {\n      var _i3 = Vab[0][0];\n      var j = Vab[0][1];\n      psi = getThetaBig(x[_i3][_i3], x[j][j], x[_i3][j]);\n      x = x1Big(x, psi, _i3, j);\n      Sij = Sij1Big(Sij, psi, _i3, j);\n      Vab = getAijBig(x);\n    }\n    var Ei = createArray(N, 0); // eigenvalues\n    for (var _i4 = 0; _i4 < N; _i4++) {\n      Ei[_i4] = x[_i4][_i4];\n    }\n    // return [clone(Ei), clone(Sij)]\n    return sorting((0, _object.clone)(Ei), (0, _object.clone)(Sij));\n  }\n\n  // get angle\n  function getTheta(aii, ajj, aij) {\n    var denom = ajj - aii;\n    if (Math.abs(denom) <= config.epsilon) {\n      return Math.PI / 4.0;\n    } else {\n      return 0.5 * Math.atan(2.0 * aij / (ajj - aii));\n    }\n  }\n\n  // get angle\n  function getThetaBig(aii, ajj, aij) {\n    var denom = subtract(ajj, aii);\n    if (abs(denom) <= config.epsilon) {\n      return bignumber(-1).acos().div(4);\n    } else {\n      return multiplyScalar(0.5, atan(multiply(2.0, aij, inv(denom))));\n    }\n  }\n\n  // update eigvec\n  function Sij1(Sij, theta, i, j) {\n    var N = Sij.length;\n    var c = Math.cos(theta);\n    var s = Math.sin(theta);\n    var Ski = createArray(N, 0);\n    var Skj = createArray(N, 0);\n    for (var k = 0; k < N; k++) {\n      Ski[k] = c * Sij[k][i] - s * Sij[k][j];\n      Skj[k] = s * Sij[k][i] + c * Sij[k][j];\n    }\n    for (var _k = 0; _k < N; _k++) {\n      Sij[_k][i] = Ski[_k];\n      Sij[_k][j] = Skj[_k];\n    }\n    return Sij;\n  }\n  // update eigvec for overlap\n  function Sij1Big(Sij, theta, i, j) {\n    var N = Sij.length;\n    var c = cos(theta);\n    var s = sin(theta);\n    var Ski = createArray(N, bignumber(0));\n    var Skj = createArray(N, bignumber(0));\n    for (var k = 0; k < N; k++) {\n      Ski[k] = subtract(multiplyScalar(c, Sij[k][i]), multiplyScalar(s, Sij[k][j]));\n      Skj[k] = addScalar(multiplyScalar(s, Sij[k][i]), multiplyScalar(c, Sij[k][j]));\n    }\n    for (var _k2 = 0; _k2 < N; _k2++) {\n      Sij[_k2][i] = Ski[_k2];\n      Sij[_k2][j] = Skj[_k2];\n    }\n    return Sij;\n  }\n\n  // update matrix\n  function x1Big(Hij, theta, i, j) {\n    var N = Hij.length;\n    var c = bignumber(cos(theta));\n    var s = bignumber(sin(theta));\n    var c2 = multiplyScalar(c, c);\n    var s2 = multiplyScalar(s, s);\n    var Aki = createArray(N, bignumber(0));\n    var Akj = createArray(N, bignumber(0));\n    // 2cs Hij\n    var csHij = multiply(bignumber(2), c, s, Hij[i][j]);\n    //  Aii\n    var Aii = addScalar(subtract(multiplyScalar(c2, Hij[i][i]), csHij), multiplyScalar(s2, Hij[j][j]));\n    var Ajj = add(multiplyScalar(s2, Hij[i][i]), csHij, multiplyScalar(c2, Hij[j][j]));\n    // 0  to i\n    for (var k = 0; k < N; k++) {\n      Aki[k] = subtract(multiplyScalar(c, Hij[i][k]), multiplyScalar(s, Hij[j][k]));\n      Akj[k] = addScalar(multiplyScalar(s, Hij[i][k]), multiplyScalar(c, Hij[j][k]));\n    }\n    // Modify Hij\n    Hij[i][i] = Aii;\n    Hij[j][j] = Ajj;\n    Hij[i][j] = bignumber(0);\n    Hij[j][i] = bignumber(0);\n    // 0  to i\n    for (var _k3 = 0; _k3 < N; _k3++) {\n      if (_k3 !== i && _k3 !== j) {\n        Hij[i][_k3] = Aki[_k3];\n        Hij[_k3][i] = Aki[_k3];\n        Hij[j][_k3] = Akj[_k3];\n        Hij[_k3][j] = Akj[_k3];\n      }\n    }\n    return Hij;\n  }\n\n  // update matrix\n  function x1(Hij, theta, i, j) {\n    var N = Hij.length;\n    var c = Math.cos(theta);\n    var s = Math.sin(theta);\n    var c2 = c * c;\n    var s2 = s * s;\n    var Aki = createArray(N, 0);\n    var Akj = createArray(N, 0);\n    //  Aii\n    var Aii = c2 * Hij[i][i] - 2 * c * s * Hij[i][j] + s2 * Hij[j][j];\n    var Ajj = s2 * Hij[i][i] + 2 * c * s * Hij[i][j] + c2 * Hij[j][j];\n    // 0  to i\n    for (var k = 0; k < N; k++) {\n      Aki[k] = c * Hij[i][k] - s * Hij[j][k];\n      Akj[k] = s * Hij[i][k] + c * Hij[j][k];\n    }\n    // Modify Hij\n    Hij[i][i] = Aii;\n    Hij[j][j] = Ajj;\n    Hij[i][j] = 0;\n    Hij[j][i] = 0;\n    // 0  to i\n    for (var _k4 = 0; _k4 < N; _k4++) {\n      if (_k4 !== i && _k4 !== j) {\n        Hij[i][_k4] = Aki[_k4];\n        Hij[_k4][i] = Aki[_k4];\n        Hij[j][_k4] = Akj[_k4];\n        Hij[_k4][j] = Akj[_k4];\n      }\n    }\n    return Hij;\n  }\n\n  // get max off-diagonal value from Upper Diagonal\n  function getAij(Mij) {\n    var N = Mij.length;\n    var maxMij = 0;\n    var maxIJ = [0, 1];\n    for (var i = 0; i < N; i++) {\n      for (var j = i + 1; j < N; j++) {\n        if (Math.abs(maxMij) < Math.abs(Mij[i][j])) {\n          maxMij = Math.abs(Mij[i][j]);\n          maxIJ = [i, j];\n        }\n      }\n    }\n    return [maxIJ, maxMij];\n  }\n\n  // get max off-diagonal value from Upper Diagonal\n  function getAijBig(Mij) {\n    var N = Mij.length;\n    var maxMij = 0;\n    var maxIJ = [0, 1];\n    for (var i = 0; i < N; i++) {\n      for (var j = i + 1; j < N; j++) {\n        if (abs(maxMij) < abs(Mij[i][j])) {\n          maxMij = abs(Mij[i][j]);\n          maxIJ = [i, j];\n        }\n      }\n    }\n    return [maxIJ, maxMij];\n  }\n\n  // sort results\n  function sorting(E, S) {\n    var N = E.length;\n    var values = Array(N);\n    var vectors = Array(N);\n    for (var k = 0; k < N; k++) {\n      vectors[k] = Array(N);\n    }\n    for (var i = 0; i < N; i++) {\n      var minID = 0;\n      var minE = E[0];\n      for (var j = 0; j < E.length; j++) {\n        if (abs(E[j]) < abs(minE)) {\n          minID = j;\n          minE = E[minID];\n        }\n      }\n      values[i] = E.splice(minID, 1)[0];\n      for (var _k5 = 0; _k5 < N; _k5++) {\n        vectors[_k5][i] = S[_k5][minID];\n        S[_k5].splice(minID, 1);\n      }\n    }\n    return {\n      values: values,\n      vectors: vectors\n    };\n  }\n\n  /**\n   * Create an array of a certain size and fill all items with an initial value\n   * @param {number} size\n   * @param {number} value\n   * @return {number[]}\n   */\n  function createArray(size, value) {\n    // TODO: as soon as all browsers support Array.fill, use that instead (IE doesn't support it)\n    var array = new Array(size);\n    for (var i = 0; i < size; i++) {\n      array[i] = value;\n    }\n    return array;\n  }\n  return main;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createEigs = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _string = require(\"../../utils/string.js\");\nvar _complexEigs = require(\"./eigs/complexEigs.js\");\nvar _realSymetric = require(\"./eigs/realSymetric.js\");\nvar _is = require(\"../../utils/is.js\");\nvar name = 'eigs';\n\n// The absolute state of math.js's dependency system:\nvar dependencies = ['config', 'typed', 'matrix', 'addScalar', 'equal', 'subtract', 'abs', 'atan', 'cos', 'sin', 'multiplyScalar', 'divideScalar', 'inv', 'bignumber', 'multiply', 'add', 'larger', 'column', 'flatten', 'number', 'complex', 'sqrt', 'diag', 'qr', 'usolve', 'usolveAll', 'im', 're', 'smaller', 'matrixFromColumns', 'dot'];\nvar createEigs = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var config = _ref.config,\n    typed = _ref.typed,\n    matrix = _ref.matrix,\n    addScalar = _ref.addScalar,\n    subtract = _ref.subtract,\n    equal = _ref.equal,\n    abs = _ref.abs,\n    atan = _ref.atan,\n    cos = _ref.cos,\n    sin = _ref.sin,\n    multiplyScalar = _ref.multiplyScalar,\n    divideScalar = _ref.divideScalar,\n    inv = _ref.inv,\n    bignumber = _ref.bignumber,\n    multiply = _ref.multiply,\n    add = _ref.add,\n    larger = _ref.larger,\n    column = _ref.column,\n    flatten = _ref.flatten,\n    number = _ref.number,\n    complex = _ref.complex,\n    sqrt = _ref.sqrt,\n    diag = _ref.diag,\n    qr = _ref.qr,\n    usolve = _ref.usolve,\n    usolveAll = _ref.usolveAll,\n    im = _ref.im,\n    re = _ref.re,\n    smaller = _ref.smaller,\n    matrixFromColumns = _ref.matrixFromColumns,\n    dot = _ref.dot;\n  var doRealSymetric = (0, _realSymetric.createRealSymmetric)({\n    config: config,\n    addScalar: addScalar,\n    subtract: subtract,\n    column: column,\n    flatten: flatten,\n    equal: equal,\n    abs: abs,\n    atan: atan,\n    cos: cos,\n    sin: sin,\n    multiplyScalar: multiplyScalar,\n    inv: inv,\n    bignumber: bignumber,\n    complex: complex,\n    multiply: multiply,\n    add: add\n  });\n  var doComplexEigs = (0, _complexEigs.createComplexEigs)({\n    config: config,\n    addScalar: addScalar,\n    subtract: subtract,\n    multiply: multiply,\n    multiplyScalar: multiplyScalar,\n    flatten: flatten,\n    divideScalar: divideScalar,\n    sqrt: sqrt,\n    abs: abs,\n    bignumber: bignumber,\n    diag: diag,\n    qr: qr,\n    inv: inv,\n    usolve: usolve,\n    usolveAll: usolveAll,\n    equal: equal,\n    complex: complex,\n    larger: larger,\n    smaller: smaller,\n    matrixFromColumns: matrixFromColumns,\n    dot: dot\n  });\n\n  /**\n   * Compute eigenvalues and eigenvectors of a matrix. The eigenvalues are sorted by their absolute value, ascending.\n   * An eigenvalue with multiplicity k will be listed k times. The eigenvectors are returned as columns of a matrix –\n   * the eigenvector that belongs to the j-th eigenvalue in the list (eg. `values[j]`) is the j-th column (eg. `column(vectors, j)`).\n   * If the algorithm fails to converge, it will throw an error – in that case, however, you may still find useful information\n   * in `err.values` and `err.vectors`.\n   *\n   * Syntax:\n   *\n   *     math.eigs(x, [prec])\n   *\n   * Examples:\n   *\n   *     const { eigs, multiply, column, transpose } = math\n   *     const H = [[5, 2.3], [2.3, 1]]\n   *     const ans = eigs(H) // returns {values: [E1,E2...sorted], vectors: [v1,v2.... corresponding vectors as columns]}\n   *     const E = ans.values\n   *     const U = ans.vectors\n   *     multiply(H, column(U, 0)) // returns multiply(E[0], column(U, 0))\n   *     const UTxHxU = multiply(transpose(U), H, U) // diagonalizes H\n   *     E[0] == UTxHxU[0][0]  // returns true\n   *\n   * See also:\n   *\n   *     inv\n   *\n   * @param {Array | Matrix} x  Matrix to be diagonalized\n   *\n   * @param {number | BigNumber} [prec] Precision, default value: 1e-15\n   * @return {{values: Array|Matrix, vectors: Array|Matrix}} Object containing an array of eigenvalues and a matrix with eigenvectors as columns.\n   *\n   */\n  return typed('eigs', {\n    Array: function Array(x) {\n      var mat = matrix(x);\n      return computeValuesAndVectors(mat);\n    },\n    'Array, number|BigNumber': function ArrayNumberBigNumber(x, prec) {\n      var mat = matrix(x);\n      return computeValuesAndVectors(mat, prec);\n    },\n    Matrix: function Matrix(mat) {\n      var _computeValuesAndVect = computeValuesAndVectors(mat),\n        values = _computeValuesAndVect.values,\n        vectors = _computeValuesAndVect.vectors;\n      return {\n        values: matrix(values),\n        vectors: matrix(vectors)\n      };\n    },\n    'Matrix, number|BigNumber': function MatrixNumberBigNumber(mat, prec) {\n      var _computeValuesAndVect2 = computeValuesAndVectors(mat, prec),\n        values = _computeValuesAndVect2.values,\n        vectors = _computeValuesAndVect2.vectors;\n      return {\n        values: matrix(values),\n        vectors: matrix(vectors)\n      };\n    }\n  });\n  function computeValuesAndVectors(mat, prec) {\n    if (prec === undefined) {\n      prec = config.epsilon;\n    }\n    var size = mat.size();\n    if (size.length !== 2 || size[0] !== size[1]) {\n      throw new RangeError('Matrix must be square (size: ' + (0, _string.format)(size) + ')');\n    }\n    var arr = mat.toArray();\n    var N = size[0];\n    if (isReal(arr, N, prec)) {\n      coerceReal(arr, N);\n      if (isSymmetric(arr, N, prec)) {\n        var _type = coerceTypes(mat, arr, N);\n        return doRealSymetric(arr, N, prec, _type);\n      }\n    }\n    var type = coerceTypes(mat, arr, N);\n    return doComplexEigs(arr, N, prec, type);\n  }\n\n  /** @return {boolean} */\n  function isSymmetric(arr, N, prec) {\n    for (var i = 0; i < N; i++) {\n      for (var j = i; j < N; j++) {\n        // TODO proper comparison of bignum and frac\n        if (larger(bignumber(abs(subtract(arr[i][j], arr[j][i]))), prec)) {\n          return false;\n        }\n      }\n    }\n    return true;\n  }\n\n  /** @return {boolean} */\n  function isReal(arr, N, prec) {\n    for (var i = 0; i < N; i++) {\n      for (var j = 0; j < N; j++) {\n        // TODO proper comparison of bignum and frac\n        if (larger(bignumber(abs(im(arr[i][j]))), prec)) {\n          return false;\n        }\n      }\n    }\n    return true;\n  }\n  function coerceReal(arr, N) {\n    for (var i = 0; i < N; i++) {\n      for (var j = 0; j < N; j++) {\n        arr[i][j] = re(arr[i][j]);\n      }\n    }\n  }\n\n  /** @return {'number' | 'BigNumber' | 'Complex'} */\n  function coerceTypes(mat, arr, N) {\n    /** @type {string} */\n    var type = mat.datatype();\n    if (type === 'number' || type === 'BigNumber' || type === 'Complex') {\n      return type;\n    }\n    var hasNumber = false;\n    var hasBig = false;\n    var hasComplex = false;\n    for (var i = 0; i < N; i++) {\n      for (var j = 0; j < N; j++) {\n        var el = arr[i][j];\n        if ((0, _is.isNumber)(el) || (0, _is.isFraction)(el)) {\n          hasNumber = true;\n        } else if ((0, _is.isBigNumber)(el)) {\n          hasBig = true;\n        } else if ((0, _is.isComplex)(el)) {\n          hasComplex = true;\n        } else {\n          throw TypeError('Unsupported type in Matrix: ' + (0, _is.typeOf)(el));\n        }\n      }\n    }\n    if (hasBig && hasComplex) {\n      console.warn('Complex BigNumbers not supported, this operation will lose precission.');\n    }\n    if (hasComplex) {\n      for (var _i = 0; _i < N; _i++) {\n        for (var _j = 0; _j < N; _j++) {\n          arr[_i][_j] = complex(arr[_i][_j]);\n        }\n      }\n      return 'Complex';\n    }\n    if (hasBig) {\n      for (var _i2 = 0; _i2 < N; _i2++) {\n        for (var _j2 = 0; _j2 < N; _j2++) {\n          arr[_i2][_j2] = bignumber(arr[_i2][_j2]);\n        }\n      }\n      return 'BigNumber';\n    }\n    if (hasNumber) {\n      for (var _i3 = 0; _i3 < N; _i3++) {\n        for (var _j3 = 0; _j3 < N; _j3++) {\n          arr[_i3][_j3] = number(arr[_i3][_j3]);\n        }\n      }\n      return 'number';\n    } else {\n      throw TypeError('Matrix contains unsupported types only.');\n    }\n  }\n});\nexports.createEigs = createEigs;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createExpm = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _string = require(\"../../utils/string.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'expm';\nvar dependencies = ['typed', 'abs', 'add', 'identity', 'inv', 'multiply'];\nvar createExpm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    abs = _ref.abs,\n    add = _ref.add,\n    identity = _ref.identity,\n    inv = _ref.inv,\n    multiply = _ref.multiply;\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  return typed(name, {\n    Matrix: function Matrix(A) {\n      // Check matrix size\n      var size = A.size();\n      if (size.length !== 2 || size[0] !== size[1]) {\n        throw new RangeError('Matrix must be square ' + '(size: ' + (0, _string.format)(size) + ')');\n      }\n      var n = size[0];\n\n      // Desired accuracy of the approximant (The actual accuracy\n      // will be affected by round-off error)\n      var eps = 1e-15;\n\n      // 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\n      // Compute infinity-norm of A, ||A||, to see how \"big\" it is\n      var infNorm = infinityNorm(A);\n\n      // Find the optimal scaling factor and number of terms in the\n      // Padé approximant to reach the desired accuracy\n      var params = findParams(infNorm, eps);\n      var q = params.q;\n      var j = params.j;\n\n      // 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\n      // Scale A by 1 / 2^j\n      var Apos = multiply(A, Math.pow(2, -j));\n\n      // The i=0 term is just the identity matrix\n      var N = identity(n);\n      var D = identity(n);\n\n      // Initialization (i=0)\n      var factor = 1;\n\n      // Initialization (i=1)\n      var AposToI = Apos; // Cloning not necessary\n      var alternate = -1;\n      for (var i = 1; i <= q; i++) {\n        if (i > 1) {\n          AposToI = multiply(AposToI, Apos);\n          alternate = -alternate;\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      var R = multiply(inv(D), N);\n\n      // Square j times\n      for (var _i = 0; _i < j; _i++) {\n        R = multiply(R, R);\n      }\n      return (0, _is.isSparseMatrix)(A) ? A.createSparseMatrix(R) : R;\n    }\n  });\n  function infinityNorm(A) {\n    var n = A.size()[0];\n    var infNorm = 0;\n    for (var i = 0; i < n; i++) {\n      var rowSum = 0;\n      for (var j = 0; j < n; j++) {\n        rowSum += abs(A.get([i, j]));\n      }\n      infNorm = Math.max(rowSum, infNorm);\n    }\n    return infNorm;\n  }\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  function findParams(infNorm, eps) {\n    var maxSearchSize = 30;\n    for (var k = 0; k < maxSearchSize; k++) {\n      for (var q = 0; q <= k; q++) {\n        var j = k - q;\n        if (errorEstimate(infNorm, q, j) < eps) {\n          return {\n            q: q,\n            j: j\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  /**\n   * Returns the estimated error of the Pade approximant for the given\n   * parameters.\n   */\n  function errorEstimate(infNorm, q, j) {\n    var qfac = 1;\n    for (var i = 2; i <= q; i++) {\n      qfac *= i;\n    }\n    var twoqfac = qfac;\n    for (var _i2 = q + 1; _i2 <= 2 * q; _i2++) {\n      twoqfac *= _i2;\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});\nexports.createExpm = createExpm;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSqrtm = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _string = require(\"../../utils/string.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'sqrtm';\nvar dependencies = ['typed', 'abs', 'add', 'multiply', 'map', 'sqrt', 'subtract', 'inv', 'size', 'max', 'identity'];\nvar createSqrtm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    abs = _ref.abs,\n    add = _ref.add,\n    multiply = _ref.multiply,\n    map = _ref.map,\n    sqrt = _ref.sqrt,\n    subtract = _ref.subtract,\n    inv = _ref.inv,\n    size = _ref.size,\n    max = _ref.max,\n    identity = _ref.identity;\n  var _maxIterations = 1e3;\n  var _tolerance = 1e-6;\n\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  function _denmanBeavers(A) {\n    var error;\n    var iterations = 0;\n    var Y = A;\n    var Z = identity(size(A));\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      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    return Y;\n  }\n\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([[33, 24], [48, 57]]) // returns [[5, 2], [4, 7]]\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  return typed(name, {\n    'Array | Matrix': function ArrayMatrix(A) {\n      var size = (0, _is.isMatrix)(A) ? A.size() : (0, _array.arraySize)(A);\n      switch (size.length) {\n        case 1:\n          // Single element Array | Matrix\n          if (size[0] === 1) {\n            return map(A, sqrt);\n          } else {\n            throw new RangeError('Matrix must be square ' + '(size: ' + (0, _string.format)(size) + ')');\n          }\n        case 2:\n          {\n            // Two-dimensional Array | Matrix\n            var rows = size[0];\n            var cols = size[1];\n            if (rows === cols) {\n              return _denmanBeavers(A);\n            } else {\n              throw new RangeError('Matrix must be square ' + '(size: ' + (0, _string.format)(size) + ')');\n            }\n          }\n        default:\n          // Multi dimensional array\n          throw new RangeError('Matrix must be at most two dimensional ' + '(size: ' + (0, _string.format)(size) + ')');\n      }\n    }\n  });\n});\nexports.createSqrtm = createSqrtm;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSylvester = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'sylvester';\nvar dependencies = ['typed', 'schur', 'matrixFromColumns', 'matrix', 'multiply', 'range', 'concat', 'transpose', 'index', 'subset', 'add', 'subtract', 'identity', 'lusolve', 'abs'];\nvar createSylvester = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    schur = _ref.schur,\n    matrixFromColumns = _ref.matrixFromColumns,\n    matrix = _ref.matrix,\n    multiply = _ref.multiply,\n    range = _ref.range,\n    concat = _ref.concat,\n    transpose = _ref.transpose,\n    index = _ref.index,\n    subset = _ref.subset,\n    add = _ref.add,\n    subtract = _ref.subtract,\n    identity = _ref.identity,\n    lusolve = _ref.lusolve,\n    abs = _ref.abs;\n  /**\n   *\n   * Solves the real-valued Sylvester equation AX+XB=C for X, where A, B and C are\n   * matrices of appropriate dimensions, being A and B squared. Notice that other\n   * equivalent definitions for the Sylvester equation exist and this function\n   * assumes the one presented in the original publication of the the Bartels-\n   * Stewart algorithm, which is implemented by this function.\n   * https://en.wikipedia.org/wiki/Sylvester_equation\n   *\n   * Syntax:\n   *\n   *     math.sylvester(A, B, C)\n   *\n   * Examples:\n   *\n   *     const A = [[-1, -2], [1, 1]]\n   *     const B = [[2, -1], [1, -2]]\n   *     const C = [[-3, 2], [3, 0]]\n   *     math.sylvester(A, B, C)      // returns DenseMatrix [[-0.25, 0.25], [1.5, -1.25]]\n   *\n   * See also:\n   *\n   *     schur, lyap\n   *\n   * @param {Matrix | Array} A  Matrix A\n   * @param {Matrix | Array} B  Matrix B\n   * @param {Matrix | Array} C  Matrix C\n   * @return {Matrix | Array}   Matrix X, solving the Sylvester equation\n   */\n  return typed(name, {\n    'Matrix, Matrix, Matrix': _sylvester,\n    'Array, Matrix, Matrix': function ArrayMatrixMatrix(A, B, C) {\n      return _sylvester(matrix(A), B, C);\n    },\n    'Array, Array, Matrix': function ArrayArrayMatrix(A, B, C) {\n      return _sylvester(matrix(A), matrix(B), C);\n    },\n    'Array, Matrix, Array': function ArrayMatrixArray(A, B, C) {\n      return _sylvester(matrix(A), B, matrix(C));\n    },\n    'Matrix, Array, Matrix': function MatrixArrayMatrix(A, B, C) {\n      return _sylvester(A, matrix(B), C);\n    },\n    'Matrix, Array, Array': function MatrixArrayArray(A, B, C) {\n      return _sylvester(A, matrix(B), matrix(C));\n    },\n    'Matrix, Matrix, Array': function MatrixMatrixArray(A, B, C) {\n      return _sylvester(A, B, matrix(C));\n    },\n    'Array, Array, Array': function ArrayArrayArray(A, B, C) {\n      return _sylvester(matrix(A), matrix(B), matrix(C)).toArray();\n    }\n  });\n  function _sylvester(A, B, C) {\n    var n = B.size()[0];\n    var m = A.size()[0];\n    var sA = schur(A);\n    var F = sA.T;\n    var U = sA.U;\n    var sB = schur(multiply(-1, B));\n    var G = sB.T;\n    var V = sB.U;\n    var D = multiply(multiply(transpose(U), C), V);\n    var all = range(0, m);\n    var y = [];\n    var hc = function hc(a, b) {\n      return concat(a, b, 1);\n    };\n    var vc = function vc(a, b) {\n      return concat(a, b, 0);\n    };\n    for (var k = 0; k < n; k++) {\n      if (k < n - 1 && abs(subset(G, index(k + 1, k))) > 1e-5) {\n        var RHS = vc(subset(D, index(all, k)), subset(D, index(all, k + 1)));\n        for (var j = 0; j < k; j++) {\n          RHS = add(RHS, vc(multiply(y[j], subset(G, index(j, k))), multiply(y[j], subset(G, index(j, k + 1)))));\n        }\n        var gkk = multiply(identity(m), multiply(-1, subset(G, index(k, k))));\n        var gmk = multiply(identity(m), multiply(-1, subset(G, index(k + 1, k))));\n        var gkm = multiply(identity(m), multiply(-1, subset(G, index(k, k + 1))));\n        var gmm = multiply(identity(m), multiply(-1, subset(G, index(k + 1, k + 1))));\n        var LHS = vc(hc(add(F, gkk), gmk), hc(gkm, add(F, gmm)));\n        var yAux = lusolve(LHS, RHS);\n        y[k] = yAux.subset(index(range(0, m), 0));\n        y[k + 1] = yAux.subset(index(range(m, 2 * m), 0));\n        k++;\n      } else {\n        var _RHS = subset(D, index(all, k));\n        for (var _j = 0; _j < k; _j++) {\n          _RHS = add(_RHS, multiply(y[_j], subset(G, index(_j, k))));\n        }\n        var _gkk = subset(G, index(k, k));\n        var _LHS = subtract(F, multiply(_gkk, identity(m)));\n        y[k] = lusolve(_LHS, _RHS);\n      }\n    }\n    var Y = matrix(matrixFromColumns.apply(void 0, y));\n    var X = multiply(U, multiply(Y, transpose(V)));\n    return X;\n  }\n});\nexports.createSylvester = createSylvester;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSchur = void 0;\nvar _factory = require(\"../../../utils/factory.js\");\nvar name = 'schur';\nvar dependencies = ['typed', 'matrix', 'identity', 'multiply', 'qr', 'norm', 'subtract'];\nvar createSchur = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    identity = _ref.identity,\n    multiply = _ref.multiply,\n    qr = _ref.qr,\n    norm = _ref.norm,\n    subtract = _ref.subtract;\n  /**\n   *\n   * Performs a real Schur decomposition of the real matrix A = UTU' where U is orthogonal\n   * and T is upper quasi-triangular.\n   * https://en.wikipedia.org/wiki/Schur_decomposition\n   *\n   * Syntax:\n   *\n   *     math.schur(A)\n   *\n   * Examples:\n   *\n   *     const A = [[1, 0], [-4, 3]]\n   *     math.schur(A) // returns {T: [[3, 4], [0, 1]], R: [[0, 1], [-1, 0]]}\n   *\n   * See also:\n   *\n   *     sylvester, lyap, qr\n   *\n   * @param {Array | Matrix} A  Matrix A\n   * @return {{U: Array | Matrix, T: Array | Matrix}} Object containing both matrix U and T of the Schur Decomposition A=UTU'\n   */\n  return typed(name, {\n    Array: function Array(X) {\n      var r = _schur(matrix(X));\n      return {\n        U: r.U.valueOf(),\n        T: r.T.valueOf()\n      };\n    },\n    Matrix: function Matrix(X) {\n      return _schur(X);\n    }\n  });\n  function _schur(X) {\n    var n = X.size()[0];\n    var A = X;\n    var U = identity(n);\n    var k = 0;\n    var A0;\n    do {\n      A0 = A;\n      var QR = qr(A);\n      var Q = QR.Q;\n      var R = QR.R;\n      A = multiply(R, Q);\n      U = multiply(U, Q);\n      if (k++ > 100) {\n        break;\n      }\n    } while (norm(subtract(A, A0)) > 1e-4);\n    return {\n      U: U,\n      T: A\n    };\n  }\n});\nexports.createSchur = createSchur;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createLyap = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'lyap';\nvar dependencies = ['typed', 'matrix', 'sylvester', 'multiply', 'transpose'];\nvar createLyap = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    sylvester = _ref.sylvester,\n    multiply = _ref.multiply,\n    transpose = _ref.transpose;\n  /**\n   *\n   * Solves the Continuous-time Lyapunov equation AP+PA'+Q=0 for P, where\n   * Q is an input matrix. When Q is symmetric, P is also symmetric. Notice\n   * that different equivalent definitions exist for the Continuous-time\n   * Lyapunov equation.\n   * https://en.wikipedia.org/wiki/Lyapunov_equation\n   *\n   * Syntax:\n   *\n   *     math.lyap(A, Q)\n   *\n   * Examples:\n   *\n   *     const A = [[-2, 0], [1, -4]]\n   *     const Q = [[3, 1], [1, 3]]\n   *     const P = math.lyap(A, Q)\n   *\n   * See also:\n   *\n   *     sylvester, schur\n   *\n   * @param {Matrix | Array} A  Matrix A\n   * @param {Matrix | Array} Q  Matrix Q\n   * @return {Matrix | Array} Matrix P solution to the Continuous-time Lyapunov equation AP+PA'=Q\n   */\n  return typed(name, {\n    'Matrix, Matrix': function MatrixMatrix(A, Q) {\n      return sylvester(A, transpose(A), multiply(-1, Q));\n    },\n    'Array, Matrix': function ArrayMatrix(A, Q) {\n      return sylvester(matrix(A), transpose(matrix(A)), multiply(-1, Q));\n    },\n    'Matrix, Array': function MatrixArray(A, Q) {\n      return sylvester(A, transpose(matrix(A)), matrix(multiply(-1, Q)));\n    },\n    'Array, Array': function ArrayArray(A, Q) {\n      return sylvester(matrix(A), transpose(matrix(A)), matrix(multiply(-1, Q))).toArray();\n    }\n  });\n});\nexports.createLyap = createLyap;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createDivide = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _object = require(\"../../utils/object.js\");\nvar _matAlgo11xS0s = require(\"../../type/matrix/utils/matAlgo11xS0s.js\");\nvar _matAlgo14xDs = require(\"../../type/matrix/utils/matAlgo14xDs.js\");\nvar name = 'divide';\nvar dependencies = ['typed', 'matrix', 'multiply', 'equalScalar', 'divideScalar', 'inv'];\nvar createDivide = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    multiply = _ref.multiply,\n    equalScalar = _ref.equalScalar,\n    divideScalar = _ref.divideScalar,\n    inv = _ref.inv;\n  var matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({\n    typed: typed,\n    equalScalar: equalScalar\n  });\n  var matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({\n    typed: typed\n  });\n\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  return typed('divide', (0, _object.extend)({\n    // we extend the signatures of divideScalar with signatures dealing with matrices\n\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 matAlgo14xDs(x, y, divideScalar, false);\n    },\n    'SparseMatrix, any': function SparseMatrixAny(x, y) {\n      return matAlgo11xS0s(x, y, divideScalar, false);\n    },\n    'Array, any': function ArrayAny(x, y) {\n      // use matrix implementation\n      return matAlgo14xDs(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});\nexports.createDivide = createDivide;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createDistance = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'distance';\nvar dependencies = ['typed', 'addScalar', 'subtract', 'divideScalar', 'multiplyScalar', 'unaryMinus', 'sqrt', 'abs'];\nvar createDistance = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    addScalar = _ref.addScalar,\n    subtract = _ref.subtract,\n    multiplyScalar = _ref.multiplyScalar,\n    divideScalar = _ref.divideScalar,\n    unaryMinus = _ref.unaryMinus,\n    sqrt = _ref.sqrt,\n    abs = _ref.abs;\n  /**\n    * Calculates:\n    *    The eucledian distance between two points in N-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([x1, y1, ... , N1], [x2, y2, ... , N2])\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.656854249492381\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.7416573867739413\n    *    math.distance(\n    *     {pointOneX: 4, pointOneY: 5, pointOneZ: 8},\n    *     {pointTwoX: 2, pointTwoY: 7, pointTwoZ: 9})    // Returns 3\n    *    math.distance([1, 0, 1, 0], [0, -1, 0, -1])     // Returns 2\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  return typed(name, {\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        if (!_2d(y)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for second argument');\n        }\n        if (!_2d(z)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for third argument');\n        }\n        var m = divideScalar(subtract(z[1], z[0]), subtract(y[1], y[0]));\n        var xCoeff = multiplyScalar(multiplyScalar(m, m), y[0]);\n        var yCoeff = unaryMinus(multiplyScalar(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        if (!_2d(y)) {\n          throw new TypeError('Values of lineOnePtX and lineOnePtY should be numbers or BigNumbers');\n        }\n        if (!_2d(z)) {\n          throw new TypeError('Values of lineTwoPtX and lineTwoPtY should be numbers or BigNumbers');\n        }\n        if ('pointX' in x && 'pointY' in x && 'lineOnePtX' in y && 'lineOnePtY' in y && 'lineTwoPtX' in z && 'lineTwoPtY' in z) {\n          var m = divideScalar(subtract(z.lineTwoPtY, z.lineTwoPtX), subtract(y.lineOnePtY, y.lineOnePtX));\n          var xCoeff = multiplyScalar(multiplyScalar(m, m), y.lineOnePtX);\n          var yCoeff = unaryMinus(multiplyScalar(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        if (!_3d(y)) {\n          throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');\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        if (!_parametricLine(y)) {\n          throw new TypeError('Array with 6 numbers or BigNumbers expected for second argument');\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 === y.length && x.length > 0) {\n        // Point to Point N-dimensions\n        if (!_containsOnlyNumbers(x)) {\n          throw new TypeError('All values of an array should be numbers or BigNumbers');\n        }\n        if (!_containsOnlyNumbers(y)) {\n          throw new TypeError('All values of an array should be numbers or BigNumbers');\n        }\n        return _euclideanDistance(x, y);\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        if (!_3d(y)) {\n          throw new TypeError('Values of xCoeffLine, yCoeffLine and constant should be numbers or BigNumbers');\n        }\n        if ('pointX' in x && 'pointY' in x && 'xCoeffLine' in y && 'yCoeffLine' in y && 'constant' in y) {\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        if (!_parametricLine(y)) {\n          throw new TypeError('Values of x0, y0, z0, a, b and c should be numbers or BigNumbers');\n        }\n        if ('pointX' in x && 'pointY' in x && 'x0' in y && 'y0' in y && 'z0' in y && 'a' in y && 'b' in y && 'c' in y) {\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        if (!_2d(y)) {\n          throw new TypeError('Values of pointTwoX and pointTwoY should be numbers or BigNumbers');\n        }\n        if ('pointOneX' in x && 'pointOneY' in x && 'pointTwoX' in y && 'pointTwoY' in y) {\n          return _euclideanDistance([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        if (!_3d(y)) {\n          throw new TypeError('Values of pointTwoX, pointTwoY and pointTwoZ should be numbers or BigNumbers');\n        }\n        if ('pointOneX' in x && 'pointOneY' in x && 'pointOneZ' in x && 'pointTwoX' in y && 'pointTwoY' in y && 'pointTwoZ' in y) {\n          return _euclideanDistance([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      return _distancePairwise(arr);\n    }\n  });\n  function _isNumber(a) {\n    // distance supports numbers and bignumbers\n    return typeof a === 'number' || (0, _is.isBigNumber)(a);\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    return _isNumber(a[0]) && _isNumber(a[1]);\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    return _isNumber(a[0]) && _isNumber(a[1]) && _isNumber(a[2]);\n  }\n  function _containsOnlyNumbers(a) {\n    // checks if the number of arguments are correct in count and are valid (should be numbers)\n    if (!Array.isArray(a)) {\n      a = _objectToArray(a);\n    }\n    return a.every(_isNumber);\n  }\n  function _parametricLine(a) {\n    if (a.constructor !== Array) {\n      a = _objectToArray(a);\n    }\n    return _isNumber(a[0]) && _isNumber(a[1]) && _isNumber(a[2]) && _isNumber(a[3]) && _isNumber(a[4]) && _isNumber(a[5]);\n  }\n  function _objectToArray(o) {\n    var keys = Object.keys(o);\n    var a = [];\n    for (var i = 0; i < keys.length; i++) {\n      a.push(o[keys[i]]);\n    }\n    return a;\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      if (a.some(function (aI) {\n        return aI.length !== 2 || !_isNumber(aI[0]) || !_isNumber(aI[1]);\n      })) {\n        return false;\n      }\n    } else if (a[0].length === 3 && _isNumber(a[0][0]) && _isNumber(a[0][1]) && _isNumber(a[0][2])) {\n      if (a.some(function (aI) {\n        return aI.length !== 3 || !_isNumber(aI[0]) || !_isNumber(aI[1]) || !_isNumber(aI[2]);\n      })) {\n        return false;\n      }\n    } else {\n      return false;\n    }\n    return true;\n  }\n  function _distancePointLine2D(x, y, a, b, c) {\n    var num = abs(addScalar(addScalar(multiplyScalar(a, x), multiplyScalar(b, y)), c));\n    var den = sqrt(addScalar(multiplyScalar(a, a), multiplyScalar(b, b)));\n    return divideScalar(num, den);\n  }\n  function _distancePointLine3D(x, y, z, x0, y0, z0, a, b, c) {\n    var num = [subtract(multiplyScalar(subtract(y0, y), c), multiplyScalar(subtract(z0, z), b)), subtract(multiplyScalar(subtract(z0, z), a), multiplyScalar(subtract(x0, x), c)), subtract(multiplyScalar(subtract(x0, x), b), multiplyScalar(subtract(y0, y), a))];\n    num = sqrt(addScalar(addScalar(multiplyScalar(num[0], num[0]), multiplyScalar(num[1], num[1])), multiplyScalar(num[2], num[2])));\n    var den = sqrt(addScalar(addScalar(multiplyScalar(a, a), multiplyScalar(b, b)), multiplyScalar(c, c)));\n    return divideScalar(num, den);\n  }\n  function _euclideanDistance(x, y) {\n    var vectorSize = x.length;\n    var result = 0;\n    var diff = 0;\n    for (var i = 0; i < vectorSize; i++) {\n      diff = subtract(x[i], y[i]);\n      result = addScalar(multiplyScalar(diff, diff), result);\n    }\n    return sqrt(result);\n  }\n  function _distancePairwise(a) {\n    var result = [];\n    var pointA = [];\n    var pointB = [];\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          pointA = [a[i][0], a[i][1]];\n          pointB = [a[j][0], a[j][1]];\n        } else if (a[0].length === 3) {\n          pointA = [a[i][0], a[i][1], a[i][2]];\n          pointB = [a[j][0], a[j][1], a[j][2]];\n        }\n        result.push(_euclideanDistance(pointA, pointB));\n      }\n    }\n    return result;\n  }\n});\nexports.createDistance = createDistance;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createIntersect = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'intersect';\nvar dependencies = ['typed', 'config', 'abs', 'add', 'addScalar', 'matrix', 'multiply', 'multiplyScalar', 'divideScalar', 'subtract', 'smaller', 'equalScalar', 'flatten', 'isZero', 'isNumeric'];\nvar createIntersect = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    abs = _ref.abs,\n    add = _ref.add,\n    addScalar = _ref.addScalar,\n    matrix = _ref.matrix,\n    multiply = _ref.multiply,\n    multiplyScalar = _ref.multiplyScalar,\n    divideScalar = _ref.divideScalar,\n    subtract = _ref.subtract,\n    smaller = _ref.smaller,\n    equalScalar = _ref.equalScalar,\n    flatten = _ref.flatten,\n    isZero = _ref.isZero,\n    isNumeric = _ref.isNumeric;\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 undefined if the calculation is for line and plane\n   * @return {Array}              Returns the point of intersection of lines/lines-planes\n   */\n  return typed('intersect', {\n    'Array, Array, Array': _AAA,\n    'Array, Array, Array, Array': _AAAA,\n    'Matrix, Matrix, Matrix': function MatrixMatrixMatrix(x, y, plane) {\n      var arr = _AAA(x.valueOf(), y.valueOf(), plane.valueOf());\n      return arr === null ? null : matrix(arr);\n    },\n    'Matrix, Matrix, Matrix, Matrix': function MatrixMatrixMatrixMatrix(w, x, y, z) {\n      // TODO: output matrix type should match input matrix type\n      var arr = _AAAA(w.valueOf(), x.valueOf(), y.valueOf(), z.valueOf());\n      return arr === null ? null : matrix(arr);\n    }\n  });\n  function _AAA(x, y, plane) {\n    x = _coerceArr(x);\n    y = _coerceArr(y);\n    plane = _coerceArr(plane);\n    if (!_3d(x)) {\n      throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument');\n    }\n    if (!_3d(y)) {\n      throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');\n    }\n    if (!_4d(plane)) {\n      throw new TypeError('Array with 4 numbers expected as third argument');\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  function _AAAA(w, x, y, z) {\n    w = _coerceArr(w);\n    x = _coerceArr(x);\n    y = _coerceArr(y);\n    z = _coerceArr(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      if (!_2d(x)) {\n        throw new TypeError('Array with 2 numbers or BigNumbers expected for second argument');\n      }\n      if (!_2d(y)) {\n        throw new TypeError('Array with 2 numbers or BigNumbers expected for third argument');\n      }\n      if (!_2d(z)) {\n        throw new TypeError('Array with 2 numbers or BigNumbers expected for fourth argument');\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      if (!_3d(x)) {\n        throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');\n      }\n      if (!_3d(y)) {\n        throw new TypeError('Array with 3 numbers or BigNumbers expected for third argument');\n      }\n      if (!_3d(z)) {\n        throw new TypeError('Array with 3 numbers or BigNumbers expected for fourth argument');\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\n  /** Coerce row and column 2-dim arrays to 1-dim array */\n  function _coerceArr(arr) {\n    // row matrix\n    if (arr.length === 1) return arr[0];\n\n    // column matrix\n    if (arr.length > 1 && Array.isArray(arr[0])) {\n      if (arr.every(function (el) {\n        return Array.isArray(el) && el.length === 1;\n      })) return flatten(arr);\n    }\n    return arr;\n  }\n  function _2d(x) {\n    return x.length === 2 && isNumeric(x[0]) && isNumeric(x[1]);\n  }\n  function _3d(x) {\n    return x.length === 3 && isNumeric(x[0]) && isNumeric(x[1]) && isNumeric(x[2]);\n  }\n  function _4d(x) {\n    return x.length === 4 && isNumeric(x[0]) && isNumeric(x[1]) && isNumeric(x[2]) && isNumeric(x[3]);\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    if (isZero(det)) return null;\n    if (smaller(abs(det), config.epsilon)) {\n      return null;\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  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  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    var d4321 = _intersect3dHelper(x4, x3, x2, x1, y4, y3, y2, y1, z4, z3, z2, z1);\n    var d1321 = _intersect3dHelper(x1, x3, x2, x1, y1, y3, y2, y1, z1, z3, z2, z1);\n    var d4343 = _intersect3dHelper(x4, x3, x4, x3, y4, y3, y4, y3, z4, z3, z4, z3);\n    var d2121 = _intersect3dHelper(x2, x1, x2, x1, y2, y1, y2, y1, z2, z1, z2, z1);\n    var numerator = subtract(multiplyScalar(d1343, d4321), multiplyScalar(d1321, d4343));\n    var denominator = subtract(multiplyScalar(d2121, d4343), multiplyScalar(d4321, d4321));\n    if (isZero(denominator)) return null;\n    var ta = divideScalar(numerator, denominator);\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    if (equalScalar(pax, pbx) && equalScalar(pay, pby) && equalScalar(paz, pbz)) {\n      return [pax, pay, paz];\n    } else {\n      return null;\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 numerator = subtract(subtract(subtract(c, x1x), y1y), z1z);\n    var denominator = subtract(subtract(subtract(addScalar(addScalar(x2x, y2y), z2z), x1x), y1y), z1z);\n    var t = divideScalar(numerator, denominator);\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];\n    // TODO: Add cases when line is parallel to the plane:\n    //       (a) no intersection,\n    //       (b) line contained in plane\n  }\n});\nexports.createIntersect = createIntersect;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSum = void 0;\nvar _collection = require(\"../../utils/collection.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _improveErrorMessage = require(\"./utils/improveErrorMessage.js\");\nvar name = 'sum';\nvar dependencies = ['typed', 'config', 'add', 'numeric'];\nvar createSum = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    add = _ref.add,\n    numeric = _ref.numeric;\n  /**\n   * Compute the sum of a matrix or a list with values.\n   * In case of a multidimensional 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   *     math.sum(A, dimension)\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, variance, cumsum\n   *\n   * @param {... *} args  A single matrix or multiple scalar values\n   * @return {*} The sum of all values\n   */\n  return typed(name, {\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 ((0, _collection.containsCollections)(args)) {\n        throw new TypeError('Scalar values expected in function sum');\n      }\n      return _sum(args);\n    }\n  });\n\n  /**\n   * Recursively calculate the sum of an n-dimensional array\n   * @param {Array | Matrix} array\n   * @return {number} sum\n   * @private\n   */\n  function _sum(array) {\n    var sum;\n    (0, _collection.deepForEach)(array, function (value) {\n      try {\n        sum = sum === undefined ? value : add(sum, value);\n      } catch (err) {\n        throw (0, _improveErrorMessage.improveErrorMessage)(err, 'sum', value);\n      }\n    });\n\n    // make sure returning numeric value: parse a string into a numeric value\n    if (sum === undefined) {\n      sum = numeric(0, config.number);\n    }\n    if (typeof sum === 'string') {\n      sum = numeric(sum, config.number);\n    }\n    return sum;\n  }\n  function _nsumDim(array, dim) {\n    try {\n      var sum = (0, _collection.reduce)(array, dim, add);\n      return sum;\n    } catch (err) {\n      throw (0, _improveErrorMessage.improveErrorMessage)(err, 'sum');\n    }\n  }\n});\nexports.createSum = createSum;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCumSum = void 0;\nvar _collection = require(\"../../utils/collection.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _switch2 = require(\"../../utils/switch.js\");\nvar _improveErrorMessage = require(\"./utils/improveErrorMessage.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _IndexError = require(\"../../error/IndexError.js\");\nvar name = 'cumsum';\nvar dependencies = ['typed', 'add', 'unaryPlus'];\nvar createCumSum = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    add = _ref.add,\n    unaryPlus = _ref.unaryPlus;\n  /**\n   * Compute the cumulative sum of a matrix or a list with values.\n   * In case of a (multi dimensional) array or matrix, the cumulative sums\n   * along a specified dimension (defaulting to the first) will be calculated.\n   *\n   * Syntax:\n   *\n   *     math.cumsum(a, b, c, ...)\n   *     math.cumsum(A)\n   *\n   * Examples:\n   *\n   *     math.cumsum(2, 1, 4, 3)               // returns [2, 3, 7, 10]\n   *     math.cumsum([2, 1, 4, 3])             // returns [2, 3, 7, 10]\n   *     math.cumsum([[1, 2], [3, 4]])         // returns [[1, 2], [4, 6]]\n   *     math.cumsum([[1, 2], [3, 4]], 0)      // returns [[1, 2], [4, 6]]\n   *     math.cumsum([[1, 2], [3, 4]], 1)      // returns [[1, 3], [3, 7]]\n   *     math.cumsum([[2, 5], [4, 3], [1, 7]]) // returns [[2, 5], [6, 8], [7, 15]]\n   *\n   * See also:\n   *\n   *    mean, median, min, max, prod, std, variance, sum\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The cumulative sum of all values\n   */\n  return typed(name, {\n    // sum([a, b, c, d, ...])\n    Array: _cumsum,\n    Matrix: function Matrix(matrix) {\n      return matrix.create(_cumsum(matrix.valueOf()));\n    },\n    // sum([a, b, c, d, ...], dim)\n    'Array, number | BigNumber': _ncumSumDim,\n    'Matrix, number | BigNumber': function MatrixNumberBigNumber(matrix, dim) {\n      return matrix.create(_ncumSumDim(matrix.valueOf(), dim));\n    },\n    // cumsum(a, b, c, d, ...)\n    '...': function _(args) {\n      if ((0, _collection.containsCollections)(args)) {\n        throw new TypeError('All values expected to be scalar in function cumsum');\n      }\n      return _cumsum(args);\n    }\n  });\n\n  /**\n     * Recursively calculate the cumulative sum of an n-dimensional array\n     * @param {Array} array\n     * @return {number} cumsum\n     * @private\n     */\n  function _cumsum(array) {\n    try {\n      return _cumsummap(array);\n    } catch (err) {\n      throw (0, _improveErrorMessage.improveErrorMessage)(err, name);\n    }\n  }\n  function _cumsummap(array) {\n    if (array.length === 0) {\n      return [];\n    }\n    var sums = [unaryPlus(array[0])]; // unaryPlus converts to number if need be\n    for (var i = 1; i < array.length; ++i) {\n      // Must use add below and not addScalar for the case of summing a\n      // 2+-dimensional array along the 0th dimension (the row vectors,\n      // or higher-d analogues, are literally added to each other).\n      sums.push(add(sums[i - 1], array[i]));\n    }\n    return sums;\n  }\n  function _ncumSumDim(array, dim) {\n    var size = (0, _array.arraySize)(array);\n    if (dim < 0 || dim >= size.length) {\n      // TODO: would be more clear when throwing a DimensionError here\n      throw new _IndexError.IndexError(dim, size.length);\n    }\n    try {\n      return _cumsumDimensional(array, dim);\n    } catch (err) {\n      throw (0, _improveErrorMessage.improveErrorMessage)(err, name);\n    }\n  }\n\n  /* Possible TODO: Refactor _reduce in collection.js to be able to work here as well */\n  function _cumsumDimensional(mat, dim) {\n    var i, ret, tran;\n    if (dim <= 0) {\n      var initialValue = mat[0][0];\n      if (!Array.isArray(initialValue)) {\n        return _cumsummap(mat);\n      } else {\n        tran = (0, _switch2._switch)(mat);\n        ret = [];\n        for (i = 0; i < tran.length; i++) {\n          ret[i] = _cumsumDimensional(tran[i], dim - 1);\n        }\n        return ret;\n      }\n    } else {\n      ret = [];\n      for (i = 0; i < mat.length; i++) {\n        ret[i] = _cumsumDimensional(mat[i], dim - 1);\n      }\n      return ret;\n    }\n  }\n});\nexports.createCumSum = createCumSum;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMean = void 0;\nvar _collection = require(\"../../utils/collection.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _improveErrorMessage = require(\"./utils/improveErrorMessage.js\");\nvar name = 'mean';\nvar dependencies = ['typed', 'add', 'divide'];\nvar createMean = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    add = _ref.add,\n    divide = _ref.divide;\n  /**\n   * Compute the mean value of matrix or a list with values.\n   * In case of a multidimensional 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, dimension)\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, variance\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The mean of all values\n   */\n  return typed(name, {\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 ((0, _collection.containsCollections)(args)) {\n        throw new TypeError('Scalar values expected in function mean');\n      }\n      return _mean(args);\n    }\n  });\n\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  function _nmeanDim(array, dim) {\n    try {\n      var sum = (0, _collection.reduce)(array, dim, add);\n      var s = Array.isArray(array) ? (0, _array.arraySize)(array) : array.size();\n      return divide(sum, s[dim]);\n    } catch (err) {\n      throw (0, _improveErrorMessage.improveErrorMessage)(err, 'mean');\n    }\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  function _mean(array) {\n    var sum;\n    var num = 0;\n    (0, _collection.deepForEach)(array, function (value) {\n      try {\n        sum = sum === undefined ? value : add(sum, value);\n        num++;\n      } catch (err) {\n        throw (0, _improveErrorMessage.improveErrorMessage)(err, 'mean', value);\n      }\n    });\n    if (num === 0) {\n      throw new Error('Cannot calculate the mean of an empty array');\n    }\n    return divide(sum, num);\n  }\n});\nexports.createMean = createMean;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMedian = void 0;\nvar _collection = require(\"../../utils/collection.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _improveErrorMessage = require(\"./utils/improveErrorMessage.js\");\nvar name = 'median';\nvar dependencies = ['typed', 'add', 'divide', 'compare', 'partitionSelect'];\nvar createMedian = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    add = _ref.add,\n    divide = _ref.divide,\n    compare = _ref.compare,\n    partitionSelect = _ref.partitionSelect;\n  /**\n   * Recursively calculate the median of an n-dimensional array\n   * @param {Array} array\n   * @return {Number} median\n   * @private\n   */\n  function _median(array) {\n    try {\n      array = (0, _array.flatten)(array.valueOf());\n      var num = array.length;\n      if (num === 0) {\n        throw new Error('Cannot calculate median of an empty array');\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);\n\n        // array now partitioned at mid + 1, take max of left part\n        var left = array[mid];\n        for (var i = 0; i < mid; ++i) {\n          if (compare(array[i], left) > 0) {\n            left = array[i];\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 (0, _improveErrorMessage.improveErrorMessage)(err, 'median');\n    }\n  }\n\n  // helper function to type check the middle value of the array\n  var middle = typed({\n    'number | BigNumber | Complex | Unit': function numberBigNumberComplexUnit(value) {\n      return value;\n    }\n  });\n\n  // helper function to type check the two middle value of the array\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\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, variance, quantileSeq\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The median\n   */\n  return typed(name, {\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');\n      // return reduce(arguments[0], arguments[1], ...)\n    },\n\n    // median(a, b, c, d, ...)\n    '...': function _(args) {\n      if ((0, _collection.containsCollections)(args)) {\n        throw new TypeError('Scalar values expected in function median');\n      }\n      return _median(args);\n    }\n  });\n});\nexports.createMedian = createMedian;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMad = void 0;\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _improveErrorMessage = require(\"./utils/improveErrorMessage.js\");\nvar name = 'mad';\nvar dependencies = ['typed', 'abs', 'map', 'median', 'subtract'];\nvar createMad = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    abs = _ref.abs,\n    map = _ref.map,\n    median = _ref.median,\n    subtract = _ref.subtract;\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  return typed(name, {\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  function _mad(array) {\n    array = (0, _array.flatten)(array.valueOf());\n    if (array.length === 0) {\n      throw new Error('Cannot calculate median absolute deviation (mad) of an empty array');\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 (0, _improveErrorMessage.improveErrorMessage)(err, 'mad');\n      }\n    }\n  }\n});\nexports.createMad = createMad;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createVariance = void 0;\nvar _collection = require(\"../../utils/collection.js\");\nvar _is = require(\"../../utils/is.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _improveErrorMessage = require(\"./utils/improveErrorMessage.js\");\nvar DEFAULT_NORMALIZATION = 'unbiased';\nvar name = 'variance';\nvar dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'apply', 'isNaN'];\nvar createVariance = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    add = _ref.add,\n    subtract = _ref.subtract,\n    multiply = _ref.multiply,\n    divide = _ref.divide,\n    apply = _ref.apply,\n    isNaN = _ref.isNaN;\n  /**\n   * Compute the variance of a matrix or a  list with values.\n   * In case of a multidimensional 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.variance(a, b, c, ...)\n   *     math.variance(A)\n   *     math.variance(A, normalization)\n   *     math.variance(A, dimension)\n   *     math.variance(A, dimension, normalization)\n   *\n   * Examples:\n   *\n   *     math.variance(2, 4, 6)                     // returns 4\n   *     math.variance([2, 4, 6, 8])                // returns 6.666666666666667\n   *     math.variance([2, 4, 6, 8], 'uncorrected') // returns 5\n   *     math.variance([2, 4, 6, 8], 'biased')      // returns 4\n   *\n   *     math.variance([[1, 2, 3], [4, 5, 6]])      // returns 3.5\n   *     math.variance([[1, 2, 3], [4, 6, 8]], 0)   // returns [4.5, 8, 12.5]\n   *     math.variance([[1, 2, 3], [4, 6, 8]], 1)   // returns [1, 4]\n   *     math.variance([[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  return typed(name, {\n    // variance([a, b, c, d, ...])\n    'Array | Matrix': function ArrayMatrix(array) {\n      return _var(array, DEFAULT_NORMALIZATION);\n    },\n    // variance([a, b, c, d, ...], normalization)\n    'Array | Matrix, string': _var,\n    // variance([a, b, c, c, ...], dim)\n    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {\n      return _varDim(array, dim, DEFAULT_NORMALIZATION);\n    },\n    // variance([a, b, c, c, ...], dim, normalization)\n    'Array | Matrix, number | BigNumber, string': _varDim,\n    // variance(a, b, c, d, ...)\n    '...': function _(args) {\n      return _var(args, DEFAULT_NORMALIZATION);\n    }\n  });\n\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  function _var(array, normalization) {\n    var sum;\n    var num = 0;\n    if (array.length === 0) {\n      throw new SyntaxError('Function variance requires one or more parameters (0 provided)');\n    }\n\n    // calculate the mean and number of elements\n    (0, _collection.deepForEach)(array, function (value) {\n      try {\n        sum = sum === undefined ? value : add(sum, value);\n        num++;\n      } catch (err) {\n        throw (0, _improveErrorMessage.improveErrorMessage)(err, 'variance', value);\n      }\n    });\n    if (num === 0) throw new Error('Cannot calculate variance of an empty array');\n    var mean = divide(sum, num);\n\n    // calculate the variance\n    sum = undefined;\n    (0, _collection.deepForEach)(array, function (value) {\n      var diff = subtract(value, mean);\n      sum = sum === undefined ? multiply(diff, diff) : add(sum, multiply(diff, diff));\n    });\n    if (isNaN(sum)) {\n      return sum;\n    }\n    switch (normalization) {\n      case 'uncorrected':\n        return divide(sum, num);\n      case 'biased':\n        return divide(sum, num + 1);\n      case 'unbiased':\n        {\n          var zero = (0, _is.isBigNumber)(sum) ? sum.mul(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  function _varDim(array, dim, normalization) {\n    try {\n      if (array.length === 0) {\n        throw new SyntaxError('Function variance requires one or more parameters (0 provided)');\n      }\n      return apply(array, dim, function (x) {\n        return _var(x, normalization);\n      });\n    } catch (err) {\n      throw (0, _improveErrorMessage.improveErrorMessage)(err, 'variance');\n    }\n  }\n});\nexports.createVariance = createVariance;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createQuantileSeq = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _number = require(\"../../utils/number.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'quantileSeq';\nvar dependencies = ['typed', 'add', 'multiply', 'partitionSelect', 'compare'];\nvar createQuantileSeq = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    add = _ref.add,\n    multiply = _ref.multiply,\n    partitionSelect = _ref.partitionSelect,\n    compare = _ref.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 multidimensional 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, variance\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  function quantileSeq(data, probOrN, sorted) {\n    var probArr, dataArr, one;\n    if (arguments.length < 2 || arguments.length > 3) {\n      throw new SyntaxError('Function quantileSeq requires two or three parameters');\n    }\n    if ((0, _is.isCollection)(data)) {\n      sorted = sorted || false;\n      if (typeof sorted === 'boolean') {\n        dataArr = data.valueOf();\n        if ((0, _is.isNumber)(probOrN)) {\n          if (probOrN < 0) {\n            throw new Error('N/prob must be non-negative');\n          }\n          if (probOrN <= 1) {\n            // quantileSeq([a, b, c, d, ...], prob[,sorted])\n            return _quantileSeq(dataArr, probOrN, sorted);\n          }\n          if (probOrN > 1) {\n            // quantileSeq([a, b, c, d, ...], N[,sorted])\n            if (!(0, _number.isInteger)(probOrN)) {\n              throw new Error('N must be a positive integer');\n            }\n            var nPlusOne = probOrN + 1;\n            probArr = new Array(probOrN);\n            for (var i = 0; i < probOrN;) {\n              probArr[i] = _quantileSeq(dataArr, ++i / nPlusOne, sorted);\n            }\n            return probArr;\n          }\n        }\n        if ((0, _is.isBigNumber)(probOrN)) {\n          var BigNumber = probOrN.constructor;\n          if (probOrN.isNegative()) {\n            throw new Error('N/prob must be non-negative');\n          }\n          one = new BigNumber(1);\n          if (probOrN.lte(one)) {\n            // quantileSeq([a, b, c, d, ...], prob[,sorted])\n            return new BigNumber(_quantileSeq(dataArr, probOrN, sorted));\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            }\n\n            // largest possible Array length is 2^32-1\n            // 2^32 < 10^15, thus safe conversion guaranteed\n            var intN = probOrN.toNumber();\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            var _nPlusOne = new BigNumber(intN + 1);\n            probArr = new Array(intN);\n            for (var _i = 0; _i < intN;) {\n              probArr[_i] = new BigNumber(_quantileSeq(dataArr, new BigNumber(++_i).div(_nPlusOne), sorted));\n            }\n            return probArr;\n          }\n        }\n        if ((0, _is.isCollection)(probOrN)) {\n          // quantileSeq([a, b, c, d, ...], [prob1, prob2, ...][,sorted])\n          var probOrNArr = probOrN.valueOf();\n          probArr = new Array(probOrNArr.length);\n          for (var _i2 = 0; _i2 < probArr.length; ++_i2) {\n            var currProb = probOrNArr[_i2];\n            if ((0, _is.isNumber)(currProb)) {\n              if (currProb < 0 || currProb > 1) {\n                throw new Error('Probability must be between 0 and 1, inclusive');\n              }\n            } else if ((0, _is.isBigNumber)(currProb)) {\n              one = new currProb.constructor(1);\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          return probArr;\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  /**\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  function _quantileSeq(array, prob, sorted) {\n    var flat = (0, _array.flatten)(array);\n    var len = flat.length;\n    if (len === 0) {\n      throw new Error('Cannot calculate quantile of an empty sequence');\n    }\n    if ((0, _is.isNumber)(prob)) {\n      var _index = prob * (len - 1);\n      var _fracPart = _index % 1;\n      if (_fracPart === 0) {\n        var value = sorted ? flat[_index] : partitionSelect(flat, _index);\n        validate(value);\n        return value;\n      }\n      var _integerPart = Math.floor(_index);\n      var _left;\n      var _right;\n      if (sorted) {\n        _left = flat[_integerPart];\n        _right = flat[_integerPart + 1];\n      } else {\n        _right = partitionSelect(flat, _integerPart + 1);\n\n        // max of partition is kth largest\n        _left = flat[_integerPart];\n        for (var i = 0; i < _integerPart; ++i) {\n          if (compare(flat[i], _left) > 0) {\n            _left = flat[i];\n          }\n        }\n      }\n      validate(_left);\n      validate(_right);\n\n      // Q(prob) = (1-f)*A[floor(index)] + f*A[floor(index)+1]\n      return add(multiply(_left, 1 - _fracPart), multiply(_right, _fracPart));\n    }\n\n    // If prob is a BigNumber\n    var index = prob.times(len - 1);\n    if (index.isInteger()) {\n      index = index.toNumber();\n      var _value = sorted ? flat[index] : partitionSelect(flat, index);\n      validate(_value);\n      return _value;\n    }\n    var integerPart = index.floor();\n    var fracPart = index.minus(integerPart);\n    var integerPartNumber = integerPart.toNumber();\n    var left;\n    var right;\n    if (sorted) {\n      left = flat[integerPartNumber];\n      right = flat[integerPartNumber + 1];\n    } else {\n      right = partitionSelect(flat, integerPartNumber + 1);\n\n      // max of partition is kth largest\n      left = flat[integerPartNumber];\n      for (var _i3 = 0; _i3 < integerPartNumber; ++_i3) {\n        if (compare(flat[_i3], left) > 0) {\n          left = flat[_i3];\n        }\n      }\n    }\n    validate(left);\n    validate(right);\n\n    // Q(prob) = (1-f)*A[floor(index)] + f*A[floor(index)+1]\n    var one = new fracPart.constructor(1);\n    return add(multiply(left, one.minus(fracPart)), multiply(right, fracPart));\n  }\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  var validate = typed({\n    'number | BigNumber | Unit': function numberBigNumberUnit(x) {\n      return x;\n    }\n  });\n  return quantileSeq;\n});\nexports.createQuantileSeq = createQuantileSeq;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createStd = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _is = require(\"../../utils/is.js\");\nvar name = 'std';\nvar dependencies = ['typed', 'map', 'sqrt', 'variance'];\nvar createStd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    map = _ref.map,\n    sqrt = _ref.sqrt,\n    variance = _ref.variance;\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(variance(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, variance\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  return typed(name, {\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  function _std(array, normalization) {\n    if (array.length === 0) {\n      throw new SyntaxError('Function std requires one or more parameters (0 provided)');\n    }\n    try {\n      var v = variance.apply(null, arguments);\n      if ((0, _is.isCollection)(v)) {\n        return map(v, sqrt);\n      } else {\n        return sqrt(v);\n      }\n    } catch (err) {\n      if (err instanceof TypeError && err.message.indexOf(' variance') !== -1) {\n        throw new TypeError(err.message.replace(' variance', ' std'));\n      } else {\n        throw err;\n      }\n    }\n  }\n});\nexports.createStd = createStd;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCombinations = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _combinations = require(\"../../plain/number/combinations.js\");\nvar name = 'combinations';\nvar dependencies = ['typed'];\nvar createCombinations = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.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   *    combinationsWithRep, 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  return typed(name, {\n    'number, number': _combinations.combinationsNumber,\n    'BigNumber, BigNumber': function BigNumberBigNumber(n, k) {\n      var BigNumber = n.constructor;\n      var result, i;\n      var nMinusk = n.minus(k);\n      var one = new BigNumber(1);\n      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {\n        throw new TypeError('Positive integer value expected in function combinations');\n      }\n      if (k.gt(n)) {\n        throw new TypeError('k must be less than n in function combinations');\n      }\n      result = one;\n      if (k.lt(nMinusk)) {\n        for (i = one; i.lte(nMinusk); i = i.plus(one)) {\n          result = result.times(k.plus(i)).dividedBy(i);\n        }\n      } else {\n        for (i = one; i.lte(k); i = i.plus(one)) {\n          result = result.times(nMinusk.plus(i)).dividedBy(i);\n        }\n      }\n      return result;\n    }\n\n    // TODO: implement support for collection in combinations\n  });\n});\n\n/**\n * Test whether BigNumber n is a positive integer\n * @param {BigNumber} n\n * @returns {boolean} isPositiveInteger\n */\nexports.createCombinations = createCombinations;\nfunction isPositiveInteger(n) {\n  return n.isInteger() && n.gte(0);\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCombinationsWithRep = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _number = require(\"../../utils/number.js\");\nvar _product = require(\"../../utils/product.js\");\nvar name = 'combinationsWithRep';\nvar dependencies = ['typed'];\nvar createCombinationsWithRep = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\n  /**\n   * Compute the number of ways of picking `k` unordered outcomes from `n`\n   * possibilities, allowing individual outcomes to be repeated more than once.\n   *\n   * CombinationsWithRep only takes integer arguments.\n   * The following condition must be enforced: k <= n + k -1.\n   *\n   * Syntax:\n   *\n   *     math.combinationsWithRep(n, k)\n   *\n   * Examples:\n   *\n   *    math.combinationsWithRep(7, 5) // returns 462\n   *\n   * See also:\n   *\n   *    combinations, 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 with replacement.\n   */\n  return typed(name, {\n    'number, number': function numberNumber(n, k) {\n      if (!(0, _number.isInteger)(n) || n < 0) {\n        throw new TypeError('Positive integer value expected in function combinationsWithRep');\n      }\n      if (!(0, _number.isInteger)(k) || k < 0) {\n        throw new TypeError('Positive integer value expected in function combinationsWithRep');\n      }\n      if (n < 1) {\n        throw new TypeError('k must be less than or equal to n + k - 1');\n      }\n      if (k < n - 1) {\n        var _prodrange = (0, _product.product)(n, n + k - 1);\n        return _prodrange / (0, _product.product)(1, k);\n      }\n      var prodrange = (0, _product.product)(k + 1, n + k - 1);\n      return prodrange / (0, _product.product)(1, n - 1);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(n, k) {\n      var BigNumber = n.constructor;\n      var result, i;\n      var one = new BigNumber(1);\n      var nMinusOne = n.minus(one);\n      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {\n        throw new TypeError('Positive integer value expected in function combinationsWithRep');\n      }\n      if (n.lt(one)) {\n        throw new TypeError('k must be less than or equal to n + k - 1 in function combinationsWithRep');\n      }\n      result = one;\n      if (k.lt(nMinusOne)) {\n        for (i = one; i.lte(nMinusOne); i = i.plus(one)) {\n          result = result.times(k.plus(i)).dividedBy(i);\n        }\n      } else {\n        for (i = one; i.lte(k); i = i.plus(one)) {\n          result = result.times(nMinusOne.plus(i)).dividedBy(i);\n        }\n      }\n      return result;\n    }\n  });\n});\n\n/**\n * Test whether BigNumber n is a positive integer\n * @param {BigNumber} n\n * @returns {boolean} isPositiveInteger\n */\nexports.createCombinationsWithRep = createCombinationsWithRep;\nfunction isPositiveInteger(n) {\n  return n.isInteger() && n.gte(0);\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createGamma = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _index = require(\"../../plain/number/index.js\");\nvar name = 'gamma';\nvar dependencies = ['typed', 'config', 'multiplyScalar', 'pow', 'BigNumber', 'Complex'];\nvar createGamma = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    multiplyScalar = _ref.multiplyScalar,\n    pow = _ref.pow,\n    _BigNumber = _ref.BigNumber,\n    Complex = _ref.Complex;\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   * To avoid confusion with the matrix Gamma function, this function does\n   * not apply to matrices.\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 | BigNumber | Complex} n   A real or complex number\n   * @return {number | BigNumber | Complex}    The gamma of `n`\n   */\n\n  function gammaComplex(n) {\n    if (n.im === 0) {\n      return (0, _index.gammaNumber)(n.re);\n    }\n\n    // Lanczos approximation doesn't work well with real part lower than 0.5\n    // So reflection formula is required\n    if (n.re < 0.5) {\n      // Euler's reflection formula\n      // gamma(1-z) * gamma(z) = PI / sin(PI * z)\n      // real part of Z should not be integer [sin(PI) == 0 -> 1/0 - undefined]\n      // thanks to imperfect sin implementation sin(PI * n) != 0\n      // we can safely use it anyway\n      var _t = new Complex(1 - n.re, -n.im);\n      var r = new Complex(Math.PI * n.re, Math.PI * n.im);\n      return new Complex(Math.PI).div(r.sin()).div(gammaComplex(_t));\n    }\n\n    // Lanczos approximation\n    // z -= 1\n    n = new Complex(n.re - 1, n.im);\n\n    // x = gammaPval[0]\n    var x = new Complex(_index.gammaP[0], 0);\n    // for (i, gammaPval) in enumerate(gammaP):\n    for (var i = 1; i < _index.gammaP.length; ++i) {\n      // x += gammaPval / (z + i)\n      var gammaPval = new Complex(_index.gammaP[i], 0);\n      x = x.add(gammaPval.div(n.add(i)));\n    }\n    // t = z + gammaG + 0.5\n    var t = new Complex(n.re + _index.gammaG + 0.5, n.im);\n\n    // y = sqrt(2 * pi) * t ** (z + 0.5) * exp(-t) * x\n    var twoPiSqrt = Math.sqrt(2 * Math.PI);\n    var tpow = t.pow(n.add(0.5));\n    var expt = t.neg().exp();\n\n    // y = [x] * [sqrt(2 * pi)] * [t ** (z + 0.5)] * [exp(-t)]\n    return x.mul(twoPiSqrt).mul(tpow).mul(expt);\n  }\n  return typed(name, {\n    number: _index.gammaNumber,\n    Complex: gammaComplex,\n    BigNumber: function BigNumber(n) {\n      if (n.isInteger()) {\n        return n.isNegative() || n.isZero() ? new _BigNumber(Infinity) : bigFactorial(n.minus(1));\n      }\n      if (!n.isFinite()) {\n        return new _BigNumber(n.isNegative() ? NaN : Infinity);\n      }\n      throw new Error('Integer BigNumber expected');\n    }\n  });\n\n  /**\n   * Calculate factorial for a BigNumber\n   * @param {BigNumber} n\n   * @returns {BigNumber} Returns the factorial of n\n   */\n  function bigFactorial(n) {\n    if (n < 8) {\n      return new _BigNumber([1, 1, 2, 6, 24, 120, 720, 5040][n]);\n    }\n    var precision = config.precision + (Math.log(n.toNumber()) | 0);\n    var Big = _BigNumber.clone({\n      precision: precision\n    });\n    if (n % 2 === 1) {\n      return n.times(bigFactorial(new _BigNumber(n - 1)));\n    }\n    var p = n;\n    var prod = new Big(n);\n    var sum = n.toNumber();\n    while (p > 2) {\n      p -= 2;\n      sum += p;\n      prod = prod.times(sum);\n    }\n    return new _BigNumber(prod.toPrecision(_BigNumber.precision));\n  }\n});\nexports.createGamma = createGamma;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createLgamma = void 0;\nvar _index = require(\"../../plain/number/index.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _number = require(\"../../utils/number.js\");\n/* eslint-disable no-loss-of-precision */\n\n// References\n// ----------\n// [1] Hare, \"Computing the Principal Branch of log-Gamma\", Journal of Algorithms, 1997.\n// [2] https://math.stackexchange.com/questions/1338753/how-do-i-calculate-values-for-gamma-function-with-complex-arguments\n\nvar name = 'lgamma';\nvar dependencies = ['Complex', 'typed'];\nvar createLgamma = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var Complex = _ref.Complex,\n    typed = _ref.typed;\n  // Stirling series is non-convergent, we need to use the recurrence `lgamma(z) = lgamma(z+1) - log z` to get\n  // sufficient accuracy.\n  //\n  // These two values are copied from Scipy implementation:\n  // https://github.com/scipy/scipy/blob/v1.8.0/scipy/special/_loggamma.pxd#L37\n  var SMALL_RE = 7;\n  var SMALL_IM = 7;\n\n  /**\n   * The coefficients are B[2*n]/(2*n*(2*n - 1)) where B[2*n] is the (2*n)th Bernoulli number. See (1.1) in [1].\n   *\n   * If you cannot access the paper, can also get these values from the formula in [2].\n   *\n   *    1 /     12 = 0.00833333333333333333333333333333\n   *    1 /    360 = 0.00277777777777777777777777777778\n   * ...\n   * 3617 / 133400 = 0.02955065359477124183006535947712\n   */\n  var coeffs = [-2.955065359477124183e-2, 6.4102564102564102564e-3, -1.9175269175269175269e-3, 8.4175084175084175084e-4, -5.952380952380952381e-4, 7.9365079365079365079e-4, -2.7777777777777777778e-3, 8.3333333333333333333e-2];\n\n  /**\n   * Logarithm of the gamma function for real, positive numbers and complex numbers,\n   * using Lanczos approximation for numbers and Stirling series for complex numbers.\n   *\n   * Syntax:\n   *\n   *    math.lgamma(n)\n   *\n   * Examples:\n   *\n   *    math.lgamma(5)       // returns 3.178053830347945\n   *    math.lgamma(0)       // returns Infinity\n   *    math.lgamma(-0.5)    // returns NaN\n   *    math.lgamma(math.i)  // returns -0.6509231993018536 - 1.8724366472624294i\n   *\n   * See also:\n   *\n   *    gamma\n   *\n   * @param {number | Complex} n   A real or complex number\n   * @return {number | Complex}    The log gamma of `n`\n   */\n  return typed(name, {\n    number: _index.lgammaNumber,\n    Complex: lgammaComplex,\n    BigNumber: function BigNumber() {\n      throw new Error(\"mathjs doesn't yet provide an implementation of the algorithm lgamma for BigNumber\");\n    }\n  });\n  function lgammaComplex(n) {\n    var TWOPI = 6.2831853071795864769252842; // 2*pi\n    var LOGPI = 1.1447298858494001741434262; // log(pi)\n\n    var REFLECTION = 0.1;\n    if (n.isNaN()) {\n      return new Complex(NaN, NaN);\n    } else if (n.im === 0) {\n      return new Complex((0, _index.lgammaNumber)(n.re), 0);\n    } else if (n.re >= SMALL_RE || Math.abs(n.im) >= SMALL_IM) {\n      return lgammaStirling(n);\n    } else if (n.re <= REFLECTION) {\n      // Reflection formula. see Proposition 3.1 in [1]\n      var tmp = (0, _number.copysign)(TWOPI, n.im) * Math.floor(0.5 * n.re + 0.25);\n      var a = n.mul(Math.PI).sin().log();\n      var b = lgammaComplex(new Complex(1 - n.re, -n.im));\n      return new Complex(LOGPI, tmp).sub(a).sub(b);\n    } else if (n.im >= 0) {\n      return lgammaRecurrence(n);\n    } else {\n      return lgammaRecurrence(n.conjugate()).conjugate();\n    }\n  }\n  function lgammaStirling(z) {\n    // formula ref in [2]\n    // computation ref:\n    // https://github.com/scipy/scipy/blob/v1.8.0/scipy/special/_loggamma.pxd#L101\n\n    // left part\n\n    // x (log(x) - 1) + 1/2 (log(2PI) - log(x))\n    // => (x - 0.5) * log(x) - x + log(2PI) / 2\n    var leftPart = z.sub(0.5).mul(z.log()).sub(z).add(_index.lnSqrt2PI);\n\n    // right part\n\n    var rz = new Complex(1, 0).div(z);\n    var rzz = rz.div(z);\n    var a = coeffs[0];\n    var b = coeffs[1];\n    var r = 2 * rzz.re;\n    var s = rzz.re * rzz.re + rzz.im * rzz.im;\n    for (var i = 2; i < 8; i++) {\n      var tmp = b;\n      b = -s * a + coeffs[i];\n      a = r * a + tmp;\n    }\n    var rightPart = rz.mul(rzz.mul(a).add(b));\n\n    // plus left and right\n\n    return leftPart.add(rightPart);\n  }\n  function lgammaRecurrence(z) {\n    // computation ref:\n    // https://github.com/scipy/scipy/blob/v1.8.0/scipy/special/_loggamma.pxd#L78\n\n    var signflips = 0;\n    var sb = 0;\n    var shiftprod = z;\n    z = z.add(1);\n    while (z.re <= SMALL_RE) {\n      shiftprod = shiftprod.mul(z);\n      var nsb = shiftprod.im < 0 ? 1 : 0;\n      if (nsb !== 0 && sb === 0) signflips++;\n      sb = nsb;\n      z = z.add(1);\n    }\n    return lgammaStirling(z).sub(shiftprod.log()).sub(new Complex(0, signflips * 2 * Math.PI * 1));\n  }\n});\nexports.createLgamma = createLgamma;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createFactorial = void 0;\nvar _collection = require(\"../../utils/collection.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'factorial';\nvar dependencies = ['typed', 'gamma'];\nvar createFactorial = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    gamma = _ref.gamma;\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, combinationsWithRep, 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  return typed(name, {\n    number: function number(n) {\n      if (n < 0) {\n        throw new Error('Value must be non-negative');\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      return gamma(n.plus(1));\n    },\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (n) {\n        return (0, _collection.deepMap)(n, self);\n      };\n    })\n  });\n});\nexports.createFactorial = createFactorial;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createKldivergence = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'kldivergence';\nvar dependencies = ['typed', 'matrix', 'divide', 'sum', 'multiply', 'map', 'dotDivide', 'log', 'isNumeric'];\nvar createKldivergence = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    divide = _ref.divide,\n    sum = _ref.sum,\n    multiply = _ref.multiply,\n    map = _ref.map,\n    dotDivide = _ref.dotDivide,\n    log = _ref.log,\n    isNumeric = _ref.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  return typed(name, {\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  function _kldiv(q, p) {\n    var plength = p.size().length;\n    var qlength = q.size().length;\n    if (plength > 1) {\n      throw new Error('first object must be one dimensional');\n    }\n    if (qlength > 1) {\n      throw new Error('second object must be one dimensional');\n    }\n    if (plength !== qlength) {\n      throw new Error('Length of two vectors must be equal');\n    }\n\n    // Before calculation, apply normalization\n    var sumq = sum(q);\n    if (sumq === 0) {\n      throw new Error('Sum of elements in first object must be non zero');\n    }\n    var sump = sum(p);\n    if (sump === 0) {\n      throw new Error('Sum of elements in second object must be non zero');\n    }\n    var qnorm = divide(q, sum(q));\n    var pnorm = divide(p, sum(p));\n    var result = sum(multiply(qnorm, map(dotDivide(qnorm, pnorm), function (x) {\n      return log(x);\n    })));\n    if (isNumeric(result)) {\n      return result;\n    } else {\n      return Number.NaN;\n    }\n  }\n});\nexports.createKldivergence = createKldivergence;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMultinomial = void 0;\nvar _collection = require(\"../../utils/collection.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'multinomial';\nvar dependencies = ['typed', 'add', 'divide', 'multiply', 'factorial', 'isInteger', 'isPositive'];\nvar createMultinomial = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    add = _ref.add,\n    divide = _ref.divide,\n    multiply = _ref.multiply,\n    factorial = _ref.factorial,\n    isInteger = _ref.isInteger,\n    isPositive = _ref.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  return typed(name, {\n    'Array | Matrix': function ArrayMatrix(a) {\n      var sum = 0;\n      var denom = 1;\n      (0, _collection.deepForEach)(a, function (ai) {\n        if (!isInteger(ai) || !isPositive(ai)) {\n          throw new TypeError('Positive integer value expected in function multinomial');\n        }\n        sum = add(sum, ai);\n        denom = multiply(denom, factorial(ai));\n      });\n      return divide(factorial(sum), denom);\n    }\n  });\n});\nexports.createMultinomial = createMultinomial;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createPermutations = void 0;\nvar _number = require(\"../../utils/number.js\");\nvar _product = require(\"../../utils/product.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'permutations';\nvar dependencies = ['typed', 'factorial'];\nvar createPermutations = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    factorial = _ref.factorial;\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, combinationsWithRep, 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  return typed(name, {\n    'number | BigNumber': factorial,\n    'number, number': function numberNumber(n, k) {\n      if (!(0, _number.isInteger)(n) || n < 0) {\n        throw new TypeError('Positive integer value expected in function permutations');\n      }\n      if (!(0, _number.isInteger)(k) || k < 0) {\n        throw new TypeError('Positive integer value expected in function permutations');\n      }\n      if (k > n) {\n        throw new TypeError('second argument k must be less than or equal to first argument n');\n      }\n      // Permute n objects, k at a time\n      return (0, _product.product)(n - k + 1, n);\n    },\n    'BigNumber, BigNumber': function BigNumberBigNumber(n, k) {\n      var result, i;\n      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {\n        throw new TypeError('Positive integer value expected in function permutations');\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      var one = n.mul(0).add(1);\n      result = one;\n      for (i = n.minus(k).plus(1); i.lte(n); i = i.plus(1)) {\n        result = result.times(i);\n      }\n      return result;\n    }\n\n    // TODO: implement support for collection in permutations\n  });\n});\n\n/**\n * Test whether BigNumber n is a positive integer\n * @param {BigNumber} n\n * @returns {boolean} isPositiveInteger\n */\nexports.createPermutations = createPermutations;\nfunction isPositiveInteger(n) {\n  return n.isInteger() && n.gte(0);\n}","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createRng = createRng;\nvar _seedrandom = _interopRequireDefault(require(\"seedrandom\"));\nvar singletonRandom = /* #__PURE__ */(0, _seedrandom[\"default\"])(Date.now());\nfunction createRng(randomSeed) {\n  var random;\n\n  // create a new random generator with given seed\n  function setSeed(seed) {\n    random = seed === null ? singletonRandom : (0, _seedrandom[\"default\"])(String(seed));\n  }\n\n  // initialize a seeded pseudo random number generator with config's random seed\n  setSeed(randomSeed);\n\n  // wrapper function so the rng can be updated via generator\n  function rng() {\n    return random();\n  }\n  return rng;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createPickRandom = void 0;\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _is = require(\"../../utils/is.js\");\nvar _seededRNG = require(\"./util/seededRNG.js\");\nvar name = 'pickRandom';\nvar dependencies = ['typed', 'config', '?on'];\nvar createPickRandom = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    on = _ref.on;\n  // seeded pseudo random number generator\n  var rng = (0, _seededRNG.createRng)(config.randomSeed);\n  if (on) {\n    on('config', function (curr, prev) {\n      if (curr.randomSeed !== prev.randomSeed) {\n        rng = (0, _seededRNG.createRng)(curr.randomSeed);\n      }\n    });\n  }\n\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   *     math.pickRandom(array, { weights, number, elementWise })\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], { number: 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   *     math.pickRandom([{x: 1.0, y: 2.0}, {x: 1.1, y: 2.0}], { elementWise: false })\n   *         // returns one of the items in the array\n   *\n   * See also:\n   *\n   *     random, randomInt\n   *\n   * @param {Array | Matrix} array     A one dimensional array\n   * @param {Int} number               An int or float\n   * @param {Array | Matrix} 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  return typed(name, {\n    'Array | Matrix': function ArrayMatrix(possibles) {\n      return _pickRandom(possibles, {});\n    },\n    'Array | Matrix, Object': function ArrayMatrixObject(possibles, options) {\n      return _pickRandom(possibles, options);\n    },\n    'Array | Matrix, number': function ArrayMatrixNumber(possibles, number) {\n      return _pickRandom(possibles, {\n        number: number\n      });\n    },\n    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(possibles, weights) {\n      return _pickRandom(possibles, {\n        weights: weights\n      });\n    },\n    'Array | Matrix, Array | Matrix, number': function ArrayMatrixArrayMatrixNumber(possibles, weights, number) {\n      return _pickRandom(possibles, {\n        number: number,\n        weights: weights\n      });\n    },\n    'Array | Matrix, number, Array | Matrix': function ArrayMatrixNumberArrayMatrix(possibles, number, weights) {\n      return _pickRandom(possibles, {\n        number: number,\n        weights: weights\n      });\n    }\n  });\n\n  /**\n   * @param {Array | Matrix} possibles\n   * @param {{\n   *   number?: number,\n   *   weights?: Array | Matrix,\n   *   elementWise: boolean\n   * }} options\n   * @returns {number | Array}\n   * @private\n   */\n  function _pickRandom(possibles, _ref2) {\n    var number = _ref2.number,\n      weights = _ref2.weights,\n      _ref2$elementWise = _ref2.elementWise,\n      elementWise = _ref2$elementWise === void 0 ? true : _ref2$elementWise;\n    var single = typeof number === 'undefined';\n    if (single) {\n      number = 1;\n    }\n    var createMatrix = (0, _is.isMatrix)(possibles) ? possibles.create : (0, _is.isMatrix)(weights) ? weights.create : null;\n    possibles = possibles.valueOf(); // get Array\n    if (weights) {\n      weights = weights.valueOf(); // get Array\n    }\n\n    if (elementWise === true) {\n      possibles = (0, _array.flatten)(possibles);\n      weights = (0, _array.flatten)(weights);\n    }\n    var totalWeights = 0;\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      for (var i = 0, len = weights.length; i < len; i++) {\n        if (!(0, _is.isNumber)(weights[i]) || weights[i] < 0) {\n          throw new Error('Weights must be an array of positive numbers');\n        }\n        totalWeights += weights[i];\n      }\n    }\n    var length = possibles.length;\n    var result = [];\n    var pick;\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        for (var _i = 0, _len = possibles.length; _i < _len; _i++) {\n          randKey -= weights[_i];\n          if (randKey < 0) {\n            pick = possibles[_i];\n            break;\n          }\n        }\n      }\n      result.push(pick);\n    }\n    return single ? result[0] : createMatrix ? createMatrix(result) : result;\n  }\n});\nexports.createPickRandom = createPickRandom;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.randomMatrix = randomMatrix;\n/**\n * This is a util function for generating a random matrix recursively.\n * @param {number[]} size\n * @param {function} random\n * @returns {Array}\n */\nfunction randomMatrix(size, random) {\n  var data = [];\n  size = size.slice(0);\n  if (size.length > 1) {\n    for (var i = 0, length = size.shift(); i < length; i++) {\n      data.push(randomMatrix(size, random));\n    }\n  } else {\n    for (var _i = 0, _length = size.shift(); _i < _length; _i++) {\n      data.push(random());\n    }\n  }\n  return data;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createRandomNumber = exports.createRandom = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _is = require(\"../../utils/is.js\");\nvar _seededRNG = require(\"./util/seededRNG.js\");\nvar _randomMatrix2 = require(\"./util/randomMatrix.js\");\nvar name = 'random';\nvar dependencies = ['typed', 'config', '?on'];\nvar createRandom = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    on = _ref.on;\n  // seeded pseudo random number generator\n  var rng = (0, _seededRNG.createRng)(config.randomSeed);\n  if (on) {\n    on('config', function (curr, prev) {\n      if (curr.randomSeed !== prev.randomSeed) {\n        rng = (0, _seededRNG.createRng)(curr.randomSeed);\n      }\n    });\n  }\n\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  return typed(name, {\n    '': function _() {\n      return _random(0, 1);\n    },\n    number: function number(max) {\n      return _random(0, max);\n    },\n    'number, number': function numberNumber(min, max) {\n      return _random(min, max);\n    },\n    'Array | Matrix': function ArrayMatrix(size) {\n      return _randomMatrix(size, 0, 1);\n    },\n    'Array | Matrix, number': function ArrayMatrixNumber(size, max) {\n      return _randomMatrix(size, 0, max);\n    },\n    'Array | Matrix, number, number': function ArrayMatrixNumberNumber(size, min, max) {\n      return _randomMatrix(size, min, max);\n    }\n  });\n  function _randomMatrix(size, min, max) {\n    var res = (0, _randomMatrix2.randomMatrix)(size.valueOf(), function () {\n      return _random(min, max);\n    });\n    return (0, _is.isMatrix)(size) ? size.create(res) : res;\n  }\n  function _random(min, max) {\n    return min + rng() * (max - min);\n  }\n});\n\n// number only implementation of random, no matrix support\n// TODO: there is quite some duplicate code in both createRandom and createRandomNumber, can we improve that?\nexports.createRandom = createRandom;\nvar createRandomNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'config', '?on'], function (_ref2) {\n  var typed = _ref2.typed,\n    config = _ref2.config,\n    on = _ref2.on,\n    matrix = _ref2.matrix;\n  // seeded pseudo random number generator1\n  var rng = (0, _seededRNG.createRng)(config.randomSeed);\n  if (on) {\n    on('config', function (curr, prev) {\n      if (curr.randomSeed !== prev.randomSeed) {\n        rng = (0, _seededRNG.createRng)(curr.randomSeed);\n      }\n    });\n  }\n  return typed(name, {\n    '': function _() {\n      return _random(0, 1);\n    },\n    number: function number(max) {\n      return _random(0, max);\n    },\n    'number, number': function numberNumber(min, max) {\n      return _random(min, max);\n    }\n  });\n  function _random(min, max) {\n    return min + rng() * (max - min);\n  }\n});\nexports.createRandomNumber = createRandomNumber;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createRandomInt = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _randomMatrix = require(\"./util/randomMatrix.js\");\nvar _seededRNG = require(\"./util/seededRNG.js\");\nvar _is = require(\"../../utils/is.js\");\nvar name = 'randomInt';\nvar dependencies = ['typed', 'config', '?on'];\nvar createRandomInt = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    on = _ref.on;\n  // seeded pseudo random number generator\n  var rng = (0, _seededRNG.createRng)(config.randomSeed);\n  if (on) {\n    on('config', function (curr, prev) {\n      if (curr.randomSeed !== prev.randomSeed) {\n        rng = (0, _seededRNG.createRng)(curr.randomSeed);\n      }\n    });\n  }\n\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()                // generate a random integer between 0 and 1\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  return typed(name, {\n    '': function _() {\n      return _randomInt(0, 1);\n    },\n    number: function number(max) {\n      return _randomInt(0, max);\n    },\n    'number, number': function numberNumber(min, max) {\n      return _randomInt(min, max);\n    },\n    'Array | Matrix': function ArrayMatrix(size) {\n      return _randomIntMatrix(size, 0, 1);\n    },\n    'Array | Matrix, number': function ArrayMatrixNumber(size, max) {\n      return _randomIntMatrix(size, 0, max);\n    },\n    'Array | Matrix, number, number': function ArrayMatrixNumberNumber(size, min, max) {\n      return _randomIntMatrix(size, min, max);\n    }\n  });\n  function _randomIntMatrix(size, min, max) {\n    var res = (0, _randomMatrix.randomMatrix)(size.valueOf(), function () {\n      return _randomInt(min, max);\n    });\n    return (0, _is.isMatrix)(size) ? size.create(res) : res;\n  }\n  function _randomInt(min, max) {\n    return Math.floor(min + rng() * (max - min));\n  }\n});\nexports.createRandomInt = createRandomInt;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createStirlingS2 = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _is = require(\"../../utils/is.js\");\nvar name = 'stirlingS2';\nvar dependencies = ['typed', 'addScalar', 'subtract', 'multiplyScalar', 'divideScalar', 'pow', 'factorial', 'combinations', 'isNegative', 'isInteger', 'number', '?bignumber', 'larger'];\nvar createStirlingS2 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    addScalar = _ref.addScalar,\n    subtract = _ref.subtract,\n    multiplyScalar = _ref.multiplyScalar,\n    divideScalar = _ref.divideScalar,\n    pow = _ref.pow,\n    factorial = _ref.factorial,\n    combinations = _ref.combinations,\n    isNegative = _ref.isNegative,\n    isInteger = _ref.isInteger,\n    number = _ref.number,\n    bignumber = _ref.bignumber,\n    larger = _ref.larger;\n  var smallCache = [];\n  var bigCache = [];\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 <= n, then s(n,k) = 1\n   *  If k = 0 < n, then s(n,k) = 0\n   *\n   * Note that if either n or k is supplied as a BigNumber, the result will be\n   * as well.\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  return typed(name, {\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      }\n      var big = !((0, _is.isNumber)(n) && (0, _is.isNumber)(k));\n      var cache = big ? bigCache : smallCache;\n      var make = big ? bignumber : number;\n      var nn = number(n);\n      var nk = number(k);\n      /* See if we already have the value: */\n      if (cache[nn] && cache[nn].length > nk) {\n        return cache[nn][nk];\n      }\n      /* Fill the cache */\n      for (var m = 0; m <= nn; ++m) {\n        if (!cache[m]) {\n          cache[m] = [m === 0 ? make(1) : make(0)];\n        }\n        if (m === 0) continue;\n        var row = cache[m];\n        var prev = cache[m - 1];\n        for (var i = row.length; i <= m && i <= nk; ++i) {\n          if (i === m) {\n            row[i] = 1;\n          } else {\n            row[i] = addScalar(multiplyScalar(make(i), prev[i]), prev[i - 1]);\n          }\n        }\n      }\n      return cache[nn][nk];\n    }\n  });\n});\nexports.createStirlingS2 = createStirlingS2;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createBellNumbers = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'bellNumbers';\nvar dependencies = ['typed', 'addScalar', 'isNegative', 'isInteger', 'stirlingS2'];\nvar createBellNumbers = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    addScalar = _ref.addScalar,\n    isNegative = _ref.isNegative,\n    isInteger = _ref.isInteger,\n    stirlingS2 = _ref.stirlingS2;\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  return typed(name, {\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      }\n\n      // Sum (k=0, n) S(n,k).\n      var result = 0;\n      for (var i = 0; i <= n; i++) {\n        result = addScalar(result, stirlingS2(n, i));\n      }\n      return result;\n    }\n  });\n});\nexports.createBellNumbers = createBellNumbers;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCatalan = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'catalan';\nvar dependencies = ['typed', 'addScalar', 'divideScalar', 'multiplyScalar', 'combinations', 'isNegative', 'isInteger'];\nvar createCatalan = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    addScalar = _ref.addScalar,\n    divideScalar = _ref.divideScalar,\n    multiplyScalar = _ref.multiplyScalar,\n    combinations = _ref.combinations,\n    isNegative = _ref.isNegative,\n    isInteger = _ref.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  return typed(name, {\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      return divideScalar(combinations(multiplyScalar(n, 2), n), addScalar(n, 1));\n    }\n  });\n});\nexports.createCatalan = createCatalan;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createComposition = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'composition';\nvar dependencies = ['typed', 'addScalar', 'combinations', 'isNegative', 'isPositive', 'isInteger', 'larger'];\nvar createComposition = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    addScalar = _ref.addScalar,\n    combinations = _ref.combinations,\n    isPositive = _ref.isPositive,\n    isNegative = _ref.isNegative,\n    isInteger = _ref.isInteger,\n    larger = _ref.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  return typed(name, {\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      return combinations(addScalar(n, -1), addScalar(k, -1));\n    }\n  });\n});\nexports.createComposition = createComposition;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createLeafCount = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'leafCount';\nvar dependencies = ['parse', 'typed'];\nvar createLeafCount = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var parse = _ref.parse,\n    typed = _ref.typed;\n  // This does the real work, but we don't have to recurse through\n  // a typed call if we separate it out\n  function countLeaves(node) {\n    var count = 0;\n    node.forEach(function (n) {\n      count += countLeaves(n);\n    });\n    return count || 1;\n  }\n\n  /**\n   * Gives the number of \"leaf nodes\" in the parse tree of the given expression\n   * A leaf node is one that has no subexpressions, essentially either a\n   * symbol or a constant. Note that `5!` has just one leaf, the '5'; the\n   * unary factorial operator does not add a leaf. On the other hand,\n   * function symbols do add leaves, so `sin(x)/cos(x)` has four leaves.\n   *\n   * The `simplify()` function should generally not increase the `leafCount()`\n   * of an expression, although currently there is no guarantee that it never\n   * does so. In many cases, `simplify()` reduces the leaf count.\n   *\n   * Syntax:\n   *\n   *     leafCount(expr)\n   *\n   * Examples:\n   *\n   *     math.leafCount('x') // 1\n   *     math.leafCount(math.parse('a*d-b*c')) // 4\n   *     math.leafCount('[a,b;c,d][0,1]') // 6\n   *\n   * See also:\n   *\n   *     simplify\n   *\n   * @param {Node|string} expr    The expression to count the leaves of\n   *\n   * @return {number}  The number of leaves of `expr`\n   *\n   */\n  return typed(name, {\n    Node: function Node(expr) {\n      return countLeaves(expr);\n    }\n  });\n});\nexports.createLeafCount = createLeafCount;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.isConstantExpression = isConstantExpression;\nObject.defineProperty(exports, \"isConstantNode\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isConstantNode;\n  }\n});\nexports.isNumericNode = isNumericNode;\nObject.defineProperty(exports, \"isVariableNode\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isSymbolNode;\n  }\n});\nvar _is = require(\"../../../utils/is.js\");\nfunction isNumericNode(x) {\n  return (0, _is.isConstantNode)(x) || (0, _is.isOperatorNode)(x) && x.isUnary() && (0, _is.isConstantNode)(x.args[0]);\n}\nfunction isConstantExpression(x) {\n  if ((0, _is.isConstantNode)(x)) {\n    // Basic Constant types\n    return true;\n  }\n  if (((0, _is.isFunctionNode)(x) || (0, _is.isOperatorNode)(x)) && x.args.every(isConstantExpression)) {\n    // Can be constant depending on arguments\n    return true;\n  }\n  if ((0, _is.isParenthesisNode)(x) && isConstantExpression(x.content)) {\n    // Parenthesis are transparent\n    return true;\n  }\n  return false; // Probably missing some edge cases\n}","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createUtil = void 0;\nvar _defineProperty2 = _interopRequireDefault(require(\"@babel/runtime/helpers/defineProperty\"));\nvar _is = require(\"../../../utils/is.js\");\nvar _factory = require(\"../../../utils/factory.js\");\nvar _object = require(\"../../../utils/object.js\");\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { (0, _defineProperty2[\"default\"])(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }\nvar name = 'simplifyUtil';\nvar dependencies = ['FunctionNode', 'OperatorNode', 'SymbolNode'];\nvar createUtil = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var FunctionNode = _ref.FunctionNode,\n    OperatorNode = _ref.OperatorNode,\n    SymbolNode = _ref.SymbolNode;\n  // 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  /* So that properties of an operator fit on one line: */\n  var T = true;\n  var F = false;\n  var defaultName = 'defaultF';\n  var defaultContext = {\n    /*      */add: {\n      trivial: T,\n      total: T,\n      commutative: T,\n      associative: T\n    },\n    /**/unaryPlus: {\n      trivial: T,\n      total: T,\n      commutative: T,\n      associative: T\n    },\n    /* */subtract: {\n      trivial: F,\n      total: T,\n      commutative: F,\n      associative: F\n    },\n    /* */multiply: {\n      trivial: T,\n      total: T,\n      commutative: T,\n      associative: T\n    },\n    /*   */divide: {\n      trivial: F,\n      total: T,\n      commutative: F,\n      associative: F\n    },\n    /*    */paren: {\n      trivial: T,\n      total: T,\n      commutative: T,\n      associative: F\n    },\n    /* */defaultF: {\n      trivial: F,\n      total: T,\n      commutative: F,\n      associative: F\n    }\n  };\n  var realContext = {\n    divide: {\n      total: F\n    },\n    log: {\n      total: F\n    }\n  };\n  var positiveContext = {\n    subtract: {\n      total: F\n    },\n    abs: {\n      trivial: T\n    },\n    log: {\n      total: T\n    }\n  };\n  function hasProperty(nodeOrName, property) {\n    var context = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : defaultContext;\n    var name = defaultName;\n    if (typeof nodeOrName === 'string') {\n      name = nodeOrName;\n    } else if ((0, _is.isOperatorNode)(nodeOrName)) {\n      name = nodeOrName.fn.toString();\n    } else if ((0, _is.isFunctionNode)(nodeOrName)) {\n      name = nodeOrName.name;\n    } else if ((0, _is.isParenthesisNode)(nodeOrName)) {\n      name = 'paren';\n    }\n    if ((0, _object.hasOwnProperty)(context, name)) {\n      var properties = context[name];\n      if ((0, _object.hasOwnProperty)(properties, property)) {\n        return properties[property];\n      }\n      if ((0, _object.hasOwnProperty)(defaultContext, name)) {\n        return defaultContext[name][property];\n      }\n    }\n    if ((0, _object.hasOwnProperty)(context, defaultName)) {\n      var _properties = context[defaultName];\n      if ((0, _object.hasOwnProperty)(_properties, property)) {\n        return _properties[property];\n      }\n      return defaultContext[defaultName][property];\n    }\n    /* name not found in context and context has no global default */\n    /* So use default context. */\n    if ((0, _object.hasOwnProperty)(defaultContext, name)) {\n      var _properties2 = defaultContext[name];\n      if ((0, _object.hasOwnProperty)(_properties2, property)) {\n        return _properties2[property];\n      }\n    }\n    return defaultContext[defaultName][property];\n  }\n  function isCommutative(node) {\n    var context = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : defaultContext;\n    return hasProperty(node, 'commutative', context);\n  }\n  function isAssociative(node) {\n    var context = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : defaultContext;\n    return hasProperty(node, 'associative', context);\n  }\n\n  /**\n   * Merge the given contexts, with primary overriding secondary\n   * wherever they might conflict\n   */\n  function mergeContext(primary, secondary) {\n    var merged = _objectSpread({}, primary);\n    for (var prop in secondary) {\n      if ((0, _object.hasOwnProperty)(primary, prop)) {\n        merged[prop] = _objectSpread(_objectSpread({}, secondary[prop]), primary[prop]);\n      } else {\n        merged[prop] = secondary[prop];\n      }\n    }\n    return merged;\n  }\n\n  /**\n   * Flatten all associative operators in an expression tree.\n   * Assumes parentheses have already been removed.\n   */\n  function flatten(node, context) {\n    if (!node.args || node.args.length === 0) {\n      return node;\n    }\n    node.args = allChildren(node, context);\n    for (var i = 0; i < node.args.length; i++) {\n      flatten(node.args[i], context);\n    }\n  }\n\n  /**\n   * Get the children of a node as if it has been flattened.\n   * TODO implement for FunctionNodes\n   */\n  function allChildren(node, context) {\n    var op;\n    var children = [];\n    var findChildren = function findChildren(node) {\n      for (var i = 0; i < node.args.length; i++) {\n        var child = node.args[i];\n        if ((0, _is.isOperatorNode)(child) && op === child.op) {\n          findChildren(child);\n        } else {\n          children.push(child);\n        }\n      }\n    };\n    if (isAssociative(node, context)) {\n      op = node.op;\n      findChildren(node);\n      return children;\n    } else {\n      return node.args;\n    }\n  }\n\n  /**\n   *  Unflatten all flattened operators to a right-heavy binary tree.\n   */\n  function unflattenr(node, context) {\n    if (!node.args || node.args.length === 0) {\n      return;\n    }\n    var makeNode = createMakeNodeFunction(node);\n    var l = node.args.length;\n    for (var i = 0; i < l; i++) {\n      unflattenr(node.args[i], context);\n    }\n    if (l > 2 && isAssociative(node, context)) {\n      var curnode = node.args.pop();\n      while (node.args.length > 0) {\n        curnode = makeNode([node.args.pop(), curnode]);\n      }\n      node.args = curnode.args;\n    }\n  }\n\n  /**\n   *  Unflatten all flattened operators to a left-heavy binary tree.\n   */\n  function unflattenl(node, context) {\n    if (!node.args || node.args.length === 0) {\n      return;\n    }\n    var makeNode = createMakeNodeFunction(node);\n    var l = node.args.length;\n    for (var i = 0; i < l; i++) {\n      unflattenl(node.args[i], context);\n    }\n    if (l > 2 && isAssociative(node, context)) {\n      var curnode = node.args.shift();\n      while (node.args.length > 0) {\n        curnode = makeNode([curnode, node.args.shift()]);\n      }\n      node.args = curnode.args;\n    }\n  }\n  function createMakeNodeFunction(node) {\n    if ((0, _is.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  return {\n    createMakeNodeFunction: createMakeNodeFunction,\n    hasProperty: hasProperty,\n    isCommutative: isCommutative,\n    isAssociative: isAssociative,\n    mergeContext: mergeContext,\n    flatten: flatten,\n    allChildren: allChildren,\n    unflattenr: unflattenr,\n    unflattenl: unflattenl,\n    defaultContext: defaultContext,\n    realContext: realContext,\n    positiveContext: positiveContext\n  };\n});\nexports.createUtil = createUtil;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSimplify = void 0;\nvar _typeof2 = _interopRequireDefault(require(\"@babel/runtime/helpers/typeof\"));\nvar _is = require(\"../../utils/is.js\");\nvar _wildcards = require(\"./simplify/wildcards.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _util = require(\"./simplify/util.js\");\nvar _object = require(\"../../utils/object.js\");\nvar _map = require(\"../../utils/map.js\");\nvar name = 'simplify';\nvar dependencies = ['config', 'typed', 'parse', 'add', 'subtract', 'multiply', 'divide', 'pow', 'isZero', 'equal', 'resolve', 'simplifyConstant', 'simplifyCore', '?fraction', '?bignumber', 'mathWithTransform', 'matrix', 'AccessorNode', 'ArrayNode', 'ConstantNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode'];\nvar createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var config = _ref.config,\n    typed = _ref.typed,\n    parse = _ref.parse,\n    add = _ref.add,\n    subtract = _ref.subtract,\n    multiply = _ref.multiply,\n    divide = _ref.divide,\n    pow = _ref.pow,\n    isZero = _ref.isZero,\n    equal = _ref.equal,\n    resolve = _ref.resolve,\n    simplifyConstant = _ref.simplifyConstant,\n    simplifyCore = _ref.simplifyCore,\n    fraction = _ref.fraction,\n    bignumber = _ref.bignumber,\n    mathWithTransform = _ref.mathWithTransform,\n    matrix = _ref.matrix,\n    AccessorNode = _ref.AccessorNode,\n    ArrayNode = _ref.ArrayNode,\n    ConstantNode = _ref.ConstantNode,\n    FunctionNode = _ref.FunctionNode,\n    IndexNode = _ref.IndexNode,\n    ObjectNode = _ref.ObjectNode,\n    OperatorNode = _ref.OperatorNode,\n    ParenthesisNode = _ref.ParenthesisNode,\n    SymbolNode = _ref.SymbolNode;\n  var _createUtil = (0, _util.createUtil)({\n      FunctionNode: FunctionNode,\n      OperatorNode: OperatorNode,\n      SymbolNode: SymbolNode\n    }),\n    hasProperty = _createUtil.hasProperty,\n    isCommutative = _createUtil.isCommutative,\n    isAssociative = _createUtil.isAssociative,\n    mergeContext = _createUtil.mergeContext,\n    flatten = _createUtil.flatten,\n    unflattenr = _createUtil.unflattenr,\n    unflattenl = _createUtil.unflattenl,\n    createMakeNodeFunction = _createUtil.createMakeNodeFunction,\n    defaultContext = _createUtil.defaultContext,\n    realContext = _createUtil.realContext,\n    positiveContext = _createUtil.positiveContext;\n\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 [Node]\n   * - 'c' - Matches a constant literal (5 or 3.2) [ConstantNode]\n   * - 'cl' - Matches a constant literal; same as c [ConstantNode]\n   * - 'cd' - Matches a decimal literal (5 or -3.2) [ConstantNode or unaryMinus wrapping a ConstantNode]\n   * - 'ce' - Matches a constant expression (-5 or √3) [Expressions consisting of only ConstantNodes, functions, and operators]\n   * - 'v' - Matches a variable; anything not matched by c (-5 or x) [Node that is not a ConstantNode]\n   * - 'vl' - Matches a variable literal (x or y) [SymbolNode]\n   * - 'vd' - Matches a non-decimal expression; anything not matched by cd (x or √3) [Node that is not a ConstantNode or unaryMinus that is wrapping a ConstantNode]\n   * - 've' - Matches a variable expression; anything not matched by ce (x or 2x) [Expressions that contain a SymbolNode or other non-constant term]\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. Note that since\n   * the `simplifyCore` function is in the default list of rules, by default\n   * simplify will convert any function calls in the expression that have\n   * operator equivalents to their operator forms.\n   *\n   * To specify a rule as a string, separate the left and right pattern by '->'\n   * When specifying a rule as an object, the following keys are meaningful:\n   * - l - the left pattern\n   * - r - the right pattern\n   * - s - in lieu of l and r, the string form that is broken at -> to give them\n   * - repeat - whether to repeat this rule until the expression stabilizes\n   * - assuming - gives a context object, as in the 'context' option to\n   *     simplify. Every property in the context object must match the current\n   *     context in order, or else the rule will not be applied.\n   * - imposeContext - gives a context object, as in the 'context' option to\n   *     simplify. Any settings specified will override the incoming context\n   *     for all matches of this rule.\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   *  Currently available options (defaults in parentheses):\n   *  - `consoleDebug` (false): whether to write the expression being simplified\n   *    and any changes to it, along with the rule responsible, to console\n   *  - `context` (simplify.defaultContext): an object giving properties of\n   *    each operator, which determine what simplifications are allowed. The\n   *    currently meaningful properties are commutative, associative,\n   *    total (whether the operation is defined for all arguments), and\n   *    trivial (whether the operation applied to a single argument leaves\n   *    that argument unchanged). The default context is very permissive and\n   *    allows almost all simplifications. Only properties differing from\n   *    the default need to be specified; the default context is used as a\n   *    fallback. Additional contexts `simplify.realContext` and\n   *    `simplify.positiveContext` are supplied to cause simplify to perform\n   *    just simplifications guaranteed to preserve all values of the expression\n   *    assuming all variables and subexpressions are real numbers or\n   *    positive real numbers, respectively. (Note that these are in some cases\n   *    more restrictive than the default context; for example, the default\n   *    context will allow `x/x` to simplify to 1, whereas\n   *    `simplify.realContext` will not, as `0/0` is not equal to 1.)\n   *  - `exactFractions` (true): whether to try to convert all constants to\n   *    exact rational numbers.\n   *  - `fractionsLimit` (10000): when `exactFractions` is true, constants will\n   *    be expressed as fractions only when both numerator and denominator\n   *    are smaller than `fractionsLimit`.\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   *     simplifyCore, derivative, evaluate, parse, rationalize, resolve\n   *\n   * @param {Node | string} expr\n   *            The expression to be simplified\n   * @param {SimplifyRule[]} [rules]\n   *            Optional list with custom rules\n   * @param {Object} [scope] Optional scope with variables\n   * @param {SimplifyOptions} [options] Optional configuration settings\n   * @return {Node} Returns the simplified form of `expr`\n   */\n  typed.addConversion({\n    from: 'Object',\n    to: 'Map',\n    convert: _map.createMap\n  });\n  var simplify = typed('simplify', {\n    Node: _simplify,\n    'Node, Map': function NodeMap(expr, scope) {\n      return _simplify(expr, false, scope);\n    },\n    'Node, Map, Object': function NodeMapObject(expr, scope, options) {\n      return _simplify(expr, false, scope, options);\n    },\n    'Node, Array': _simplify,\n    'Node, Array, Map': _simplify,\n    'Node, Array, Map, Object': _simplify\n  });\n  typed.removeConversion({\n    from: 'Object',\n    to: 'Map',\n    convert: _map.createMap\n  });\n  simplify.defaultContext = defaultContext;\n  simplify.realContext = realContext;\n  simplify.positiveContext = positiveContext;\n  function removeParens(node) {\n    return node.transform(function (node, path, parent) {\n      return (0, _is.isParenthesisNode)(node) ? removeParens(node.content) : node;\n    });\n  }\n\n  // All constants that are allowed in rules\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\n    // null: false,\n    // undefined: false,\n    // version: false,\n  };\n\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  simplify.rules = [simplifyCore,\n  // { 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  },\n  // temporary rules\n  // Note initially we tend constants to the right because like-term\n  // collection prefers the left, and we would rather collect nonconstants\n  {\n    s: 'n-n1 -> n+-n1',\n    // temporarily replace 'subtract' so we can further flatten the 'add' operator\n    assuming: {\n      subtract: {\n        total: true\n      }\n    }\n  }, {\n    s: 'n-n -> 0',\n    // partial alternative when we can't always subtract\n    assuming: {\n      subtract: {\n        total: false\n      }\n    }\n  }, {\n    s: '-(cl*v) -> v * (-cl)',\n    // make non-constant terms positive\n    assuming: {\n      multiply: {\n        commutative: true\n      },\n      subtract: {\n        total: true\n      }\n    }\n  }, {\n    s: '-(cl*v) -> (-cl) * v',\n    // non-commutative version, part 1\n    assuming: {\n      multiply: {\n        commutative: false\n      },\n      subtract: {\n        total: true\n      }\n    }\n  }, {\n    s: '-(v*cl) -> v * (-cl)',\n    // non-commutative version, part 2\n    assuming: {\n      multiply: {\n        commutative: false\n      },\n      subtract: {\n        total: true\n      }\n    }\n  }, {\n    l: '-(n1/n2)',\n    r: '-n1/n2'\n  }, {\n    l: '-v',\n    r: 'v * (-1)'\n  },\n  // finish making non-constant terms positive\n  {\n    l: '(n1 + n2)*(-1)',\n    r: 'n1*(-1) + n2*(-1)',\n    repeat: true\n  },\n  // expand negations to achieve as much sign cancellation as possible\n  {\n    l: 'n/n1^n2',\n    r: 'n*n1^-n2'\n  },\n  // temporarily replace 'divide' so we can further flatten the 'multiply' operator\n  {\n    l: 'n/n1',\n    r: 'n*n1^-1'\n  }, {\n    s: '(n1*n2)^n3 -> n1^n3 * n2^n3',\n    assuming: {\n      multiply: {\n        commutative: true\n      }\n    }\n  }, {\n    s: '(n1*n2)^(-1) -> n2^(-1) * n1^(-1)',\n    assuming: {\n      multiply: {\n        commutative: false\n      }\n    }\n  },\n  // expand nested exponentiation\n  {\n    s: '(n ^ n1) ^ n2 -> n ^ (n1 * n2)',\n    assuming: {\n      divide: {\n        total: true\n      }\n    } // 1/(1/n) = n needs 1/n to exist\n  },\n  // collect like factors; into a sum, only do this for nonconstants\n  {\n    l: ' vd   * ( vd   * n1 + n2)',\n    r: 'vd^2       * n1 +  vd   * n2'\n  }, {\n    s: ' vd   * (vd^n4 * n1 + n2)   ->  vd^(1+n4)  * n1 +  vd   * n2',\n    assuming: {\n      divide: {\n        total: true\n      }\n    } // v*1/v = v^(1+-1) needs 1/v\n  }, {\n    s: 'vd^n3 * ( vd   * n1 + n2)   ->  vd^(n3+1)  * n1 + vd^n3 * n2',\n    assuming: {\n      divide: {\n        total: true\n      }\n    }\n  }, {\n    s: 'vd^n3 * (vd^n4 * n1 + n2)   ->  vd^(n3+n4) * n1 + vd^n3 * n2',\n    assuming: {\n      divide: {\n        total: true\n      }\n    }\n  }, {\n    l: 'n*n',\n    r: 'n^2'\n  }, {\n    s: 'n * n^n1 -> n^(n1+1)',\n    assuming: {\n      divide: {\n        total: true\n      }\n    } // n*1/n = n^(-1+1) needs 1/n\n  }, {\n    s: 'n^n1 * n^n2 -> n^(n1+n2)',\n    assuming: {\n      divide: {\n        total: true\n      }\n    } // ditto for n^2*1/n^2\n  },\n  // Unfortunately, to deal with more complicated cancellations, it\n  // becomes necessary to simplify constants twice per pass. It's not\n  // terribly expensive compared to matching rules, so this should not\n  // pose a performance problem.\n  simplifyConstant,\n  // First: before collecting like terms\n\n  // collect like terms\n  {\n    s: 'n+n -> 2*n',\n    assuming: {\n      add: {\n        total: true\n      }\n    } // 2 = 1 + 1 needs to exist\n  }, {\n    l: 'n+-n',\n    r: '0'\n  }, {\n    l: 'vd*n + vd',\n    r: 'vd*(n+1)'\n  },\n  // NOTE: leftmost position is special:\n  {\n    l: 'n3*n1 + n3*n2',\n    r: 'n3*(n1+n2)'\n  },\n  // All sub-monomials tried there.\n  {\n    l: 'n3^(-n4)*n1 +   n3  * n2',\n    r: 'n3^(-n4)*(n1 + n3^(n4+1) *n2)'\n  }, {\n    l: 'n3^(-n4)*n1 + n3^n5 * n2',\n    r: 'n3^(-n4)*(n1 + n3^(n4+n5)*n2)'\n  },\n  // noncommutative additional cases (term collection & factoring)\n  {\n    s: 'n*vd + vd -> (n+1)*vd',\n    assuming: {\n      multiply: {\n        commutative: false\n      }\n    }\n  }, {\n    s: 'vd + n*vd -> (1+n)*vd',\n    assuming: {\n      multiply: {\n        commutative: false\n      }\n    }\n  }, {\n    s: 'n1*n3 + n2*n3 -> (n1+n2)*n3',\n    assuming: {\n      multiply: {\n        commutative: false\n      }\n    }\n  }, {\n    s: 'n^n1 * n -> n^(n1+1)',\n    assuming: {\n      divide: {\n        total: true\n      },\n      multiply: {\n        commutative: false\n      }\n    }\n  }, {\n    s: 'n1*n3^(-n4) + n2 * n3    -> (n1 + n2*n3^(n4 +  1))*n3^(-n4)',\n    assuming: {\n      multiply: {\n        commutative: false\n      }\n    }\n  }, {\n    s: 'n1*n3^(-n4) + n2 * n3^n5 -> (n1 + n2*n3^(n4 + n5))*n3^(-n4)',\n    assuming: {\n      multiply: {\n        commutative: false\n      }\n    }\n  }, {\n    l: 'n*cd + cd',\n    r: '(n+1)*cd'\n  }, {\n    s: 'cd*n + cd -> cd*(n+1)',\n    assuming: {\n      multiply: {\n        commutative: false\n      }\n    }\n  }, {\n    s: 'cd + cd*n -> cd*(1+n)',\n    assuming: {\n      multiply: {\n        commutative: false\n      }\n    }\n  }, simplifyConstant,\n  // Second: before returning expressions to \"standard form\"\n\n  // make factors positive (and undo 'make non-constant terms positive')\n  {\n    s: '(-n)*n1 -> -(n*n1)',\n    assuming: {\n      subtract: {\n        total: true\n      }\n    }\n  }, {\n    s: 'n1*(-n) -> -(n1*n)',\n    // in case * non-commutative\n    assuming: {\n      subtract: {\n        total: true\n      },\n      multiply: {\n        commutative: false\n      }\n    }\n  },\n  // final ordering of constants\n  {\n    s: 'ce+ve -> ve+ce',\n    assuming: {\n      add: {\n        commutative: true\n      }\n    },\n    imposeContext: {\n      add: {\n        commutative: false\n      }\n    }\n  }, {\n    s: 'vd*cd -> cd*vd',\n    assuming: {\n      multiply: {\n        commutative: true\n      }\n    },\n    imposeContext: {\n      multiply: {\n        commutative: false\n      }\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  },\n  // undo replace 'subtract'\n  {\n    s: 'n*(n1^-1) -> n/n1',\n    // undo replace 'divide'; for * commutative\n    assuming: {\n      multiply: {\n        commutative: true\n      }\n    } // o.w. / not conventional\n  }, {\n    s: 'n*n1^-n2 -> n/n1^n2',\n    assuming: {\n      multiply: {\n        commutative: true\n      }\n    } // o.w. / not conventional\n  }, {\n    s: 'n^-1 -> 1/n',\n    assuming: {\n      multiply: {\n        commutative: true\n      }\n    } // o.w. / not conventional\n  }, {\n    l: 'n^1',\n    r: 'n'\n  },\n  // can be produced by power cancellation\n  {\n    s: 'n*(n1/n2) -> (n*n1)/n2',\n    // '*' before '/'\n    assuming: {\n      multiply: {\n        associative: true\n      }\n    }\n  }, {\n    s: 'n-(n1+n2) -> n-n1-n2',\n    // '-' before '+'\n    assuming: {\n      addition: {\n        associative: true,\n        commutative: true\n      }\n    }\n  },\n  // { l: '(n1/n2)/n3', r: 'n1/(n2*n3)' },\n  // { l: '(n*n1)/(n*n2)', r: 'n1/n2' },\n\n  // simplifyConstant can leave an extra factor of 1, which can always\n  // be eliminated, since the identity always commutes\n  {\n    l: '1*n',\n    r: 'n',\n    imposeContext: {\n      multiply: {\n        commutative: true\n      }\n    }\n  }, {\n    s: 'n1/(n2/n3) -> (n1*n3)/n2',\n    assuming: {\n      multiply: {\n        associative: true\n      }\n    }\n  }, {\n    l: 'n1/(-n2)',\n    r: '-n1/n2'\n  }];\n\n  /**\n   * Takes any rule object as allowed by the specification in simplify\n   * and puts it in a standard form used by applyRule\n   */\n  function _canonicalizeRule(ruleObject, context) {\n    var newRule = {};\n    if (ruleObject.s) {\n      var lr = ruleObject.s.split('->');\n      if (lr.length === 2) {\n        newRule.l = lr[0];\n        newRule.r = lr[1];\n      } else {\n        throw SyntaxError('Could not parse rule: ' + ruleObject.s);\n      }\n    } else {\n      newRule.l = ruleObject.l;\n      newRule.r = ruleObject.r;\n    }\n    newRule.l = removeParens(parse(newRule.l));\n    newRule.r = removeParens(parse(newRule.r));\n    for (var _i = 0, _arr = ['imposeContext', 'repeat', 'assuming']; _i < _arr.length; _i++) {\n      var prop = _arr[_i];\n      if (prop in ruleObject) {\n        newRule[prop] = ruleObject[prop];\n      }\n    }\n    if (ruleObject.evaluate) {\n      newRule.evaluate = parse(ruleObject.evaluate);\n    }\n    if (isAssociative(newRule.l, context)) {\n      var nonCommutative = !isCommutative(newRule.l, context);\n      var leftExpandsym;\n      // Gen. the LHS placeholder used in this NC-context specific expansion rules\n      if (nonCommutative) leftExpandsym = _getExpandPlaceholderSymbol();\n      var makeNode = createMakeNodeFunction(newRule.l);\n      var expandsym = _getExpandPlaceholderSymbol();\n      newRule.expanded = {};\n      newRule.expanded.l = makeNode([newRule.l, expandsym]);\n      // Push the expandsym into the deepest possible branch.\n      // This helps to match the newRule against nodes returned from getSplits() later on.\n      flatten(newRule.expanded.l, context);\n      unflattenr(newRule.expanded.l, context);\n      newRule.expanded.r = makeNode([newRule.r, expandsym]);\n\n      // In and for a non-commutative context, attempting with yet additional expansion rules makes\n      // way for more matches cases of multi-arg expressions; such that associative rules (such as\n      // 'n*n -> n^2') can be applied to exprs. such as 'a * b * b' and 'a * b * b * a'.\n      if (nonCommutative) {\n        // 'Non-commutative' 1: LHS (placeholder) only\n        newRule.expandedNC1 = {};\n        newRule.expandedNC1.l = makeNode([leftExpandsym, newRule.l]);\n        newRule.expandedNC1.r = makeNode([leftExpandsym, newRule.r]);\n        // 'Non-commutative' 2: farmost LHS and RHS placeholders\n        newRule.expandedNC2 = {};\n        newRule.expandedNC2.l = makeNode([leftExpandsym, newRule.expanded.l]);\n        newRule.expandedNC2.r = makeNode([leftExpandsym, newRule.expanded.r]);\n      }\n    }\n    return newRule;\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  function _buildRules(rules, context) {\n    // Array of rules to be used to simplify expressions\n    var ruleSet = [];\n    for (var i = 0; i < rules.length; i++) {\n      var rule = rules[i];\n      var newRule = void 0;\n      var ruleType = (0, _typeof2[\"default\"])(rule);\n      switch (ruleType) {\n        case 'string':\n          rule = {\n            s: rule\n          };\n        /* falls through */\n        case 'object':\n          newRule = _canonicalizeRule(rule, context);\n          break;\n        case 'function':\n          newRule = rule;\n          break;\n        default:\n          throw TypeError('Unsupported type of rule: ' + ruleType);\n      }\n      // console.log('Adding rule: ' + rules[i])\n      // console.log(newRule)\n      ruleSet.push(newRule);\n    }\n    return ruleSet;\n  }\n  var _lastsym = 0;\n  function _getExpandPlaceholderSymbol() {\n    return new SymbolNode('_p' + _lastsym++);\n  }\n  function _simplify(expr, rules) {\n    var scope = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : (0, _map.createEmptyMap)();\n    var options = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {};\n    var debug = options.consoleDebug;\n    rules = _buildRules(rules || simplify.rules, options.context);\n    var res = resolve(expr, scope);\n    res = removeParens(res);\n    var visited = {};\n    var str = res.toString({\n      parenthesis: 'all'\n    });\n    while (!visited[str]) {\n      visited[str] = true;\n      _lastsym = 0; // counter for placeholder symbols\n      var laststr = str;\n      if (debug) console.log('Working on: ', str);\n      for (var i = 0; i < rules.length; i++) {\n        var rulestr = '';\n        if (typeof rules[i] === 'function') {\n          res = rules[i](res, options);\n          if (debug) rulestr = rules[i].name;\n        } else {\n          flatten(res, options.context);\n          res = applyRule(res, rules[i], options.context);\n          if (debug) {\n            rulestr = \"\".concat(rules[i].l.toString(), \" -> \").concat(rules[i].r.toString());\n          }\n        }\n        if (debug) {\n          var newstr = res.toString({\n            parenthesis: 'all'\n          });\n          if (newstr !== laststr) {\n            console.log('Applying', rulestr, 'produced', newstr);\n            laststr = newstr;\n          }\n        }\n        /* Use left-heavy binary tree internally,\n         * since custom rule functions may expect it\n         */\n        unflattenl(res, options.context);\n      }\n      str = res.toString({\n        parenthesis: 'all'\n      });\n    }\n    return res;\n  }\n  function mapRule(nodes, rule, context) {\n    var resNodes = nodes;\n    if (nodes) {\n      for (var i = 0; i < nodes.length; ++i) {\n        var newNode = applyRule(nodes[i], rule, context);\n        if (newNode !== nodes[i]) {\n          if (resNodes === nodes) {\n            resNodes = nodes.slice();\n          }\n          resNodes[i] = newNode;\n        }\n      }\n    }\n    return resNodes;\n  }\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   * @param  {Object | Function} rule\n   * @param  {Object} context -- information about assumed properties of operators\n   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} The simplified form of `expr`, or the original node if no simplification was possible.\n   */\n  function applyRule(node, rule, context) {\n    //    console.log('Entering applyRule(\"', rule.l.toString({parenthesis:'all'}), '->', rule.r.toString({parenthesis:'all'}), '\",', node.toString({parenthesis:'all'}),')')\n\n    // check that the assumptions for this rule are satisfied by the current\n    // context:\n    if (rule.assuming) {\n      for (var symbol in rule.assuming) {\n        for (var property in rule.assuming[symbol]) {\n          if (hasProperty(symbol, property, context) !== rule.assuming[symbol][property]) {\n            return node;\n          }\n        }\n      }\n    }\n    var mergedContext = mergeContext(rule.imposeContext, context);\n\n    // Do not clone node unless we find a match\n    var res = node;\n\n    // First replace our child nodes with their simplified versions\n    // If a child could not be simplified, applying the rule to it\n    // will have no effect since the node is returned unchanged\n    if (res instanceof OperatorNode || res instanceof FunctionNode) {\n      var newArgs = mapRule(res.args, rule, context);\n      if (newArgs !== res.args) {\n        res = res.clone();\n        res.args = newArgs;\n      }\n    } else if (res instanceof ParenthesisNode) {\n      if (res.content) {\n        var newContent = applyRule(res.content, rule, context);\n        if (newContent !== res.content) {\n          res = new ParenthesisNode(newContent);\n        }\n      }\n    } else if (res instanceof ArrayNode) {\n      var newItems = mapRule(res.items, rule, context);\n      if (newItems !== res.items) {\n        res = new ArrayNode(newItems);\n      }\n    } else if (res instanceof AccessorNode) {\n      var newObj = res.object;\n      if (res.object) {\n        newObj = applyRule(res.object, rule, context);\n      }\n      var newIndex = res.index;\n      if (res.index) {\n        newIndex = applyRule(res.index, rule, context);\n      }\n      if (newObj !== res.object || newIndex !== res.index) {\n        res = new AccessorNode(newObj, newIndex);\n      }\n    } else if (res instanceof IndexNode) {\n      var newDims = mapRule(res.dimensions, rule, context);\n      if (newDims !== res.dimensions) {\n        res = new IndexNode(newDims);\n      }\n    } else if (res instanceof ObjectNode) {\n      var changed = false;\n      var newProps = {};\n      for (var prop in res.properties) {\n        newProps[prop] = applyRule(res.properties[prop], rule, context);\n        if (newProps[prop] !== res.properties[prop]) {\n          changed = true;\n        }\n      }\n      if (changed) {\n        res = new ObjectNode(newProps);\n      }\n    }\n\n    // Try to match a rule against this node\n    var repl = rule.r;\n    var matches = _ruleMatch(rule.l, res, mergedContext)[0];\n\n    // 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    if (!matches && rule.expanded) {\n      repl = rule.expanded.r;\n      matches = _ruleMatch(rule.expanded.l, res, mergedContext)[0];\n    }\n    // Additional, non-commutative context expansion-rules\n    if (!matches && rule.expandedNC1) {\n      repl = rule.expandedNC1.r;\n      matches = _ruleMatch(rule.expandedNC1.l, res, mergedContext)[0];\n      if (!matches) {\n        // Existence of NC1 implies NC2\n        repl = rule.expandedNC2.r;\n        matches = _ruleMatch(rule.expandedNC2.l, res, mergedContext)[0];\n      }\n    }\n    if (matches) {\n      // const before = res.toString({parenthesis: 'all'})\n\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      if (implicit && 'implicit' in repl) {\n        res.implicit = true;\n      }\n\n      // Replace placeholders with their respective nodes without traversing deeper into the replaced nodes\n      res = res.transform(function (node) {\n        if (node.isSymbolNode && (0, _object.hasOwnProperty)(matches.placeholders, node.name)) {\n          return matches.placeholders[node.name].clone();\n        } else {\n          return node;\n        }\n      });\n\n      // const after = res.toString({parenthesis: 'all'})\n      // console.log('Simplified ' + before + ' to ' + after)\n    }\n\n    if (rule.repeat && res !== node) {\n      res = applyRule(res, rule, context);\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  function getSplits(node, context) {\n    var res = [];\n    var right, rightArgs;\n    var makeNode = createMakeNodeFunction(node);\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      // Keep order, but try all parenthesizations\n      for (var _i2 = 1; _i2 < node.args.length; _i2++) {\n        var left = node.args[0];\n        if (_i2 > 1) {\n          left = makeNode(node.args.slice(0, _i2));\n        }\n        rightArgs = node.args.slice(_i2);\n        right = rightArgs.length === 1 ? rightArgs[0] : makeNode(rightArgs);\n        res.push(makeNode([left, right]));\n      }\n    }\n    return res;\n  }\n\n  /**\n   * Returns the set union of two match-placeholders or null if there is a conflict.\n   */\n  function mergeMatch(match1, match2) {\n    var res = {\n      placeholders: {}\n    };\n\n    // Some matches may not have placeholders; this is OK\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    }\n\n    // Placeholders with the same key must match exactly\n    for (var key in match1.placeholders) {\n      if ((0, _object.hasOwnProperty)(match1.placeholders, key)) {\n        res.placeholders[key] = match1.placeholders[key];\n        if ((0, _object.hasOwnProperty)(match2.placeholders, 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      if ((0, _object.hasOwnProperty)(match2.placeholders, _key)) {\n        res.placeholders[_key] = match2.placeholders[_key];\n      }\n    }\n    return res;\n  }\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  function combineChildMatches(list1, list2) {\n    var res = [];\n    if (list1.length === 0 || list2.length === 0) {\n      return res;\n    }\n    var merged;\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        if (merged) {\n          res.push(merged);\n        }\n      }\n    }\n    return res;\n  }\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  function mergeChildMatches(childMatches) {\n    if (childMatches.length === 0) {\n      return childMatches;\n    }\n    var sets = childMatches.reduce(combineChildMatches);\n    var uniqueSets = [];\n    var unique = {};\n    for (var i = 0; i < sets.length; i++) {\n      var s = JSON.stringify(sets[i]);\n      if (!unique[s]) {\n        unique[s] = true;\n        uniqueSets.push(sets[i]);\n      }\n    }\n    return uniqueSets;\n  }\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   * @param {Object} context -- provides assumed properties of operators\n   * @param {Boolean} isSplit -- whether we are in process of splitting an\n   *                    n-ary operator node into possible binary combinations.\n   *                    Defaults to false.\n   * @return {Object} Information about the match, if it exists.\n   */\n  function _ruleMatch(rule, node, context, isSplit) {\n    //    console.log('Entering _ruleMatch(' + JSON.stringify(rule) + ', ' + JSON.stringify(node) + ')')\n    //    console.log('rule = ' + rule)\n    //    console.log('node = ' + node)\n\n    //    console.log('Entering _ruleMatch(', rule.toString({parenthesis:'all'}), ', ', node.toString({parenthesis:'all'}), ', ', context, ')')\n    var res = [{\n      placeholders: {}\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      }\n\n      // rule and node match. Search the children of rule and node.\n      if (node.args.length === 1 && rule.args.length === 1 || !isAssociative(node, context) && node.args.length === rule.args.length || isSplit) {\n        // Expect non-associative operators to match exactly,\n        // except in any order if operator is commutative\n        var childMatches = [];\n        for (var i = 0; i < rule.args.length; i++) {\n          var childMatch = _ruleMatch(rule.args[i], node.args[i], context);\n          if (childMatch.length === 0) {\n            // Child did not match, so stop searching immediately\n            break;\n          }\n          // The child matched, so add the information returned from the child to our result\n          childMatches.push(childMatch);\n        }\n        if (childMatches.length !== rule.args.length) {\n          if (!isCommutative(node, context) ||\n          // exact match in order needed\n          rule.args.length === 1) {\n            // nothing to commute\n            return [];\n          }\n          if (rule.args.length > 2) {\n            /* Need to generate all permutations and try them.\n             * It's a bit complicated, and unlikely to come up since there\n             * are very few ternary or higher operators. So punt for now.\n             */\n            throw new Error('permuting >2 commutative non-associative rule arguments not yet implemented');\n          }\n          /* Exactly two arguments, try them reversed */\n          var leftMatch = _ruleMatch(rule.args[0], node.args[1], context);\n          if (leftMatch.length === 0) {\n            return [];\n          }\n          var rightMatch = _ruleMatch(rule.args[1], node.args[0], context);\n          if (rightMatch.length === 0) {\n            return [];\n          }\n          childMatches = [leftMatch, rightMatch];\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\n        // matches for each of them and return their union.\n        var splits = getSplits(node, context);\n        var splitMatches = [];\n        for (var _i3 = 0; _i3 < splits.length; _i3++) {\n          var matchSet = _ruleMatch(rule, splits[_i3], context, true); // recursing at the same tree depth here\n          splitMatches = splitMatches.concat(matchSet);\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 one or two characters of the symbol node name.\n      // These meanings are expalined in the documentation for simplify()\n      if (rule.name.length === 0) {\n        throw new Error('Symbol in rule has 0 length...!?');\n      }\n      if (SUPPORTED_CONSTANTS[rule.name]) {\n        // built-in constant must match exactly\n        if (rule.name !== node.name) {\n          return [];\n        }\n      } else {\n        // wildcards are composed of up to two alphabetic or underscore characters\n        switch (rule.name[1] >= 'a' && rule.name[1] <= 'z' ? rule.name.substring(0, 2) : rule.name[0]) {\n          case 'n':\n          case '_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            break;\n          case 'c':\n          case 'cl':\n            // rule matches a ConstantNode\n            if ((0, _wildcards.isConstantNode)(node)) {\n              res[0].placeholders[rule.name] = node;\n            } else {\n              // mis-match: rule does not encompass current node\n              return [];\n            }\n            break;\n          case 'v':\n            // rule matches anything other than a ConstantNode\n            if (!(0, _wildcards.isConstantNode)(node)) {\n              res[0].placeholders[rule.name] = node;\n            } else {\n              // mis-match: rule does not encompass current node\n              return [];\n            }\n            break;\n          case 'vl':\n            // rule matches VariableNode\n            if ((0, _wildcards.isVariableNode)(node)) {\n              res[0].placeholders[rule.name] = node;\n            } else {\n              // mis-match: rule does not encompass current node\n              return [];\n            }\n            break;\n          case 'cd':\n            // rule matches a ConstantNode or unaryMinus-wrapped ConstantNode\n            if ((0, _wildcards.isNumericNode)(node)) {\n              res[0].placeholders[rule.name] = node;\n            } else {\n              // mis-match: rule does not encompass current node\n              return [];\n            }\n            break;\n          case 'vd':\n            // rule matches anything other than a ConstantNode or unaryMinus-wrapped ConstantNode\n            if (!(0, _wildcards.isNumericNode)(node)) {\n              res[0].placeholders[rule.name] = node;\n            } else {\n              // mis-match: rule does not encompass current node\n              return [];\n            }\n            break;\n          case 'ce':\n            // rule matches expressions that have a constant value\n            if ((0, _wildcards.isConstantExpression)(node)) {\n              res[0].placeholders[rule.name] = node;\n            } else {\n              // mis-match: rule does not encompass current node\n              return [];\n            }\n            break;\n          case 've':\n            // rule matches expressions that do not have a constant value\n            if (!(0, _wildcards.isConstantExpression)(node)) {\n              res[0].placeholders[rule.name] = node;\n            } else {\n              // mis-match: rule does not encompass current node\n              return [];\n            }\n            break;\n          default:\n            throw new Error('Invalid symbol in rule: ' + rule.name);\n        }\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    }\n\n    // It's a match!\n\n    // console.log('_ruleMatch(' + rule.toString() + ', ' + node.toString() + ') found a match')\n    return res;\n  }\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  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      if (p.args.length !== q.args.length) {\n        return false;\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    return true;\n  }\n  return simplify;\n});\nexports.createSimplify = createSimplify;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSimplifyConstant = void 0;\nvar _typeof2 = _interopRequireDefault(require(\"@babel/runtime/helpers/typeof\"));\nvar _is = require(\"../../utils/is.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _util = require(\"./simplify/util.js\");\nvar _noop = require(\"../../utils/noop.js\");\nfunction _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== \"undefined\" && o[Symbol.iterator] || o[\"@@iterator\"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === \"number\") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\"); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it[\"return\"] != null) it[\"return\"](); } finally { if (didErr) throw err; } } }; }\nfunction _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === \"string\") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === \"Object\" && o.constructor) n = o.constructor.name; if (n === \"Map\" || n === \"Set\") return Array.from(o); if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }\nfunction _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }\nvar name = 'simplifyConstant';\nvar dependencies = ['typed', 'config', 'mathWithTransform', 'matrix', '?fraction', '?bignumber', 'AccessorNode', 'ArrayNode', 'ConstantNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'SymbolNode'];\nvar createSimplifyConstant = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    mathWithTransform = _ref.mathWithTransform,\n    matrix = _ref.matrix,\n    fraction = _ref.fraction,\n    bignumber = _ref.bignumber,\n    AccessorNode = _ref.AccessorNode,\n    ArrayNode = _ref.ArrayNode,\n    ConstantNode = _ref.ConstantNode,\n    FunctionNode = _ref.FunctionNode,\n    IndexNode = _ref.IndexNode,\n    ObjectNode = _ref.ObjectNode,\n    OperatorNode = _ref.OperatorNode,\n    SymbolNode = _ref.SymbolNode;\n  var _createUtil = (0, _util.createUtil)({\n      FunctionNode: FunctionNode,\n      OperatorNode: OperatorNode,\n      SymbolNode: SymbolNode\n    }),\n    isCommutative = _createUtil.isCommutative,\n    isAssociative = _createUtil.isAssociative,\n    allChildren = _createUtil.allChildren,\n    createMakeNodeFunction = _createUtil.createMakeNodeFunction;\n\n  /**\n   * simplifyConstant() takes a mathjs expression (either a Node representing\n   * a parse tree or a string which it parses to produce a node), and replaces\n   * any subexpression of it consisting entirely of constants with the computed\n   * value of that subexpression.\n   *\n   * Syntax:\n   *\n   *     simplifyConstant(expr)\n   *     simplifyConstant(expr, options)\n   *\n   * Examples:\n   *\n   *     math.simplifyConstant('x + 4*3/6')  // Node \"x + 2\"\n   *     math.simplifyConstant('z cos(0)')   // Node \"z 1\"\n   *     math.simplifyConstant('(5.2 + 1.08)t', {exactFractions: false})  // Node \"6.28 t\"\n   *\n   * See also:\n   *\n   *     simplify, simplifyCore, resolve, derivative\n   *\n   * @param {Node | string} node\n   *     The expression to be simplified\n   * @param {Object} options\n   *     Simplification options, as per simplify()\n   * @return {Node} Returns expression with constant subexpressions evaluated\n   */\n  var simplifyConstant = typed('simplifyConstant', {\n    Node: function Node(node) {\n      return _ensureNode(foldFraction(node, {}));\n    },\n    'Node, Object': function NodeObject(expr, options) {\n      return _ensureNode(foldFraction(expr, options));\n    }\n  });\n  function _removeFractions(thing) {\n    if ((0, _is.isFraction)(thing)) {\n      return thing.valueOf();\n    }\n    if (thing instanceof Array) {\n      return thing.map(_removeFractions);\n    }\n    if ((0, _is.isMatrix)(thing)) {\n      return matrix(_removeFractions(thing.valueOf()));\n    }\n    return thing;\n  }\n  function _eval(fnname, args, options) {\n    try {\n      return mathWithTransform[fnname].apply(null, args);\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(_removeFractions);\n      return _toNumber(mathWithTransform[fnname].apply(null, args), options);\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      return new ConstantNode(n);\n    },\n    BigNumber: function BigNumber(n) {\n      if (n < 0) {\n        return unaryMinusNode(new ConstantNode(-n));\n      }\n      return new ConstantNode(n); // old parameters: (n.toString(), 'number')\n    },\n\n    Complex: function Complex(s) {\n      throw new Error('Cannot convert Complex number to Node');\n    },\n    string: function string(s) {\n      return new ConstantNode(s);\n    },\n    Matrix: function Matrix(m) {\n      return new ArrayNode(m.valueOf().map(function (e) {\n        return _toNode(e);\n      }));\n    }\n  });\n  function _ensureNode(thing) {\n    if ((0, _is.isNode)(thing)) {\n      return thing;\n    }\n    return _toNode(thing);\n  }\n\n  // convert a number to a fraction only if it can be expressed exactly,\n  // and when both numerator and denominator are small enough\n  function _exactFraction(n, options) {\n    var exactFractions = options && options.exactFractions !== false;\n    if (exactFractions && isFinite(n) && fraction) {\n      var f = fraction(n);\n      var fractionsLimit = options && typeof options.fractionsLimit === 'number' ? options.fractionsLimit : Infinity; // no limit by default\n\n      if (f.valueOf() === n && f.n < fractionsLimit && f.d < fractionsLimit) {\n        return f;\n      }\n    }\n    return n;\n  }\n\n  // Convert numbers to a preferred number type in preference order: Fraction, number, Complex\n  // BigNumbers are left alone\n  var _toNumber = typed({\n    'string, Object': function stringObject(s, options) {\n      if (config.number === 'BigNumber') {\n        if (bignumber === undefined) {\n          (0, _noop.noBignumber)();\n        }\n        return bignumber(s);\n      } else if (config.number === 'Fraction') {\n        if (fraction === undefined) {\n          (0, _noop.noFraction)();\n        }\n        return 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\n    'BigNumber, Object': function BigNumberObject(s, options) {\n      return s;\n    },\n    // we don't need options here\n\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      return _exactFraction(s.re, options);\n    },\n    'Matrix, Object': function MatrixObject(s, options) {\n      return matrix(_exactFraction(s.valueOf()));\n    },\n    'Array, Object': function ArrayObject(s, options) {\n      return s.map(_exactFraction);\n    }\n  });\n  function unaryMinusNode(n) {\n    return new OperatorNode('-', 'unaryMinus', [n]);\n  }\n  function _fractionToNode(f) {\n    var n;\n    var vn = f.s * f.n;\n    if (vn < 0) {\n      n = new OperatorNode('-', 'unaryMinus', [new ConstantNode(-vn)]);\n    } else {\n      n = new ConstantNode(vn);\n    }\n    if (f.d === 1) {\n      return n;\n    }\n    return new OperatorNode('/', 'divide', [n, new ConstantNode(f.d)]);\n  }\n\n  /* Handles constant indexing of ArrayNodes, matrices, and ObjectNodes */\n  function _foldAccessor(obj, index, options) {\n    if (!(0, _is.isIndexNode)(index)) {\n      // don't know what to do with that...\n      return new AccessorNode(_ensureNode(obj), _ensureNode(index));\n    }\n    if ((0, _is.isArrayNode)(obj) || (0, _is.isMatrix)(obj)) {\n      var remainingDims = Array.from(index.dimensions);\n      /* We will resolve constant indices one at a time, looking\n       * just in the first or second dimensions because (a) arrays\n       * of more than two dimensions are likely rare, and (b) pulling\n       * out the third or higher dimension would be pretty intricate.\n       * The price is that we miss simplifying [..3d array][x,y,1]\n       */\n      while (remainingDims.length > 0) {\n        if ((0, _is.isConstantNode)(remainingDims[0]) && typeof remainingDims[0].value !== 'string') {\n          var first = _toNumber(remainingDims.shift().value, options);\n          if ((0, _is.isArrayNode)(obj)) {\n            obj = obj.items[first - 1];\n          } else {\n            // matrix\n            obj = obj.valueOf()[first - 1];\n            if (obj instanceof Array) {\n              obj = matrix(obj);\n            }\n          }\n        } else if (remainingDims.length > 1 && (0, _is.isConstantNode)(remainingDims[1]) && typeof remainingDims[1].value !== 'string') {\n          var second = _toNumber(remainingDims[1].value, options);\n          var tryItems = [];\n          var fromItems = (0, _is.isArrayNode)(obj) ? obj.items : obj.valueOf();\n          var _iterator = _createForOfIteratorHelper(fromItems),\n            _step;\n          try {\n            for (_iterator.s(); !(_step = _iterator.n()).done;) {\n              var item = _step.value;\n              if ((0, _is.isArrayNode)(item)) {\n                tryItems.push(item.items[second - 1]);\n              } else if ((0, _is.isMatrix)(obj)) {\n                tryItems.push(item[second - 1]);\n              } else {\n                break;\n              }\n            }\n          } catch (err) {\n            _iterator.e(err);\n          } finally {\n            _iterator.f();\n          }\n          if (tryItems.length === fromItems.length) {\n            if ((0, _is.isArrayNode)(obj)) {\n              obj = new ArrayNode(tryItems);\n            } else {\n              // matrix\n              obj = matrix(tryItems);\n            }\n            remainingDims.splice(1, 1);\n          } else {\n            // extracting slice along 2nd dimension failed, give up\n            break;\n          }\n        } else {\n          // neither 1st or 2nd dimension is constant, give up\n          break;\n        }\n      }\n      if (remainingDims.length === index.dimensions.length) {\n        /* No successful constant indexing */\n        return new AccessorNode(_ensureNode(obj), index);\n      }\n      if (remainingDims.length > 0) {\n        /* Indexed some but not all dimensions */\n        index = new IndexNode(remainingDims);\n        return new AccessorNode(_ensureNode(obj), index);\n      }\n      /* All dimensions were constant, access completely resolved */\n      return obj;\n    }\n    if ((0, _is.isObjectNode)(obj) && index.dimensions.length === 1 && (0, _is.isConstantNode)(index.dimensions[0])) {\n      var key = index.dimensions[0].value;\n      if (key in obj.properties) {\n        return obj.properties[key];\n      }\n      return new ConstantNode(); // undefined\n    }\n    /* Don't know how to index this sort of obj, at least not with this index */\n    return new AccessorNode(_ensureNode(obj), index);\n  }\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  function foldOp(fn, args, makeNode, options) {\n    var first = args.shift();\n\n    // In the following reduction, sofar always has one of the three following\n    // forms: [NODE], [CONSTANT], or [NODE, CONSTANT]\n    var reduction = args.reduce(function (sofar, next) {\n      if (!(0, _is.isNode)(next)) {\n        var last = sofar.pop();\n        if ((0, _is.isNode)(last)) {\n          return [last, next];\n        }\n        // Two constants in a row, try to fold them into one\n        try {\n          sofar.push(_eval(fn, [last, next], options));\n          return sofar;\n        } catch (ignoreandcontinue) {\n          sofar.push(last);\n          // fall through to Node case\n        }\n      }\n\n      // Encountered a Node, or failed folding --\n      // collapse everything so far into a single tree:\n      sofar.push(_ensureNode(sofar.pop()));\n      var newtree = sofar.length === 1 ? sofar[0] : makeNode(sofar);\n      return [makeNode([newtree, _ensureNode(next)])];\n    }, [first]);\n    if (reduction.length === 1) {\n      return reduction[0];\n    }\n    // Might end up with a tree and a constant at the end:\n    return makeNode([reduction[0], _toNode(reduction[1])]);\n  }\n\n  // destroys the original node and returns a folded one\n  function foldFraction(node, options) {\n    switch (node.type) {\n      case 'SymbolNode':\n        return node;\n      case 'ConstantNode':\n        switch ((0, _typeof2[\"default\"])(node.value)) {\n          case 'number':\n            return _toNumber(node.value, options);\n          case 'string':\n            return node.value;\n          default:\n            if (!isNaN(node.value)) return _toNumber(node.value, options);\n        }\n        return node;\n      case 'FunctionNode':\n        if (mathWithTransform[node.name] && mathWithTransform[node.name].rawArgs) {\n          return node;\n        }\n        {\n          // Process operators as OperatorNode\n          var operatorFunctions = ['add', 'multiply'];\n          if (operatorFunctions.indexOf(node.name) === -1) {\n            var args = node.args.map(function (arg) {\n              return foldFraction(arg, options);\n            });\n\n            // If all args are numbers\n            if (!args.some(_is.isNode)) {\n              try {\n                return _eval(node.name, args, options);\n              } catch (ignoreandcontinue) {}\n            }\n\n            // Size of a matrix does not depend on entries\n            if (node.name === 'size' && args.length === 1 && (0, _is.isArrayNode)(args[0])) {\n              var sz = [];\n              var section = args[0];\n              while ((0, _is.isArrayNode)(section)) {\n                sz.push(section.items.length);\n                section = section.items[0];\n              }\n              return matrix(sz);\n            }\n\n            // Convert all args to nodes and construct a symbolic function call\n            return new FunctionNode(node.name, args.map(_ensureNode));\n          } else {\n            // treat as operator\n          }\n        }\n      /* falls through */\n      case 'OperatorNode':\n        {\n          var fn = node.fn.toString();\n          var _args;\n          var res;\n          var makeNode = createMakeNodeFunction(node);\n          if ((0, _is.isOperatorNode)(node) && node.isUnary()) {\n            _args = [foldFraction(node.args[0], options)];\n            if (!(0, _is.isNode)(_args[0])) {\n              res = _eval(fn, _args, options);\n            } else {\n              res = makeNode(_args);\n            }\n          } else if (isAssociative(node, options.context)) {\n            _args = allChildren(node, options.context);\n            _args = _args.map(function (arg) {\n              return foldFraction(arg, options);\n            });\n            if (isCommutative(fn, options.context)) {\n              // commutative binary operator\n              var consts = [];\n              var vars = [];\n              for (var i = 0; i < _args.length; i++) {\n                if (!(0, _is.isNode)(_args[i])) {\n                  consts.push(_args[i]);\n                } else {\n                  vars.push(_args[i]);\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          return res;\n        }\n      case 'ParenthesisNode':\n        // remove the uneccessary parenthesis\n        return foldFraction(node.content, options);\n      case 'AccessorNode':\n        return _foldAccessor(foldFraction(node.object, options), foldFraction(node.index, options), options);\n      case 'ArrayNode':\n        {\n          var foldItems = node.items.map(function (item) {\n            return foldFraction(item, options);\n          });\n          if (foldItems.some(_is.isNode)) {\n            return new ArrayNode(foldItems.map(_ensureNode));\n          }\n          /* All literals -- return a Matrix so we can operate on it */\n          return matrix(foldItems);\n        }\n      case 'IndexNode':\n        {\n          return new IndexNode(node.dimensions.map(function (n) {\n            return simplifyConstant(n, options);\n          }));\n        }\n      case 'ObjectNode':\n        {\n          var foldProps = {};\n          for (var prop in node.properties) {\n            foldProps[prop] = simplifyConstant(node.properties[prop], options);\n          }\n          return new ObjectNode(foldProps);\n        }\n      case 'AssignmentNode':\n      /* falls through */\n      case 'BlockNode':\n      /* falls through */\n      case 'FunctionAssignmentNode':\n      /* falls through */\n      case 'RangeNode':\n      /* falls through */\n      case 'ConditionalNode':\n      /* falls through */\n      default:\n        throw new Error(\"Unimplemented node type in simplifyConstant: \".concat(node.type));\n    }\n  }\n  return simplifyConstant;\n});\nexports.createSimplifyConstant = createSimplifyConstant;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSimplifyCore = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _operators = require(\"../../expression/operators.js\");\nvar _util = require(\"./simplify/util.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'simplifyCore';\nvar dependencies = ['typed', 'parse', 'equal', 'isZero', 'add', 'subtract', 'multiply', 'divide', 'pow', 'AccessorNode', 'ArrayNode', 'ConstantNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode'];\nvar createSimplifyCore = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    parse = _ref.parse,\n    equal = _ref.equal,\n    isZero = _ref.isZero,\n    add = _ref.add,\n    subtract = _ref.subtract,\n    multiply = _ref.multiply,\n    divide = _ref.divide,\n    pow = _ref.pow,\n    AccessorNode = _ref.AccessorNode,\n    ArrayNode = _ref.ArrayNode,\n    ConstantNode = _ref.ConstantNode,\n    FunctionNode = _ref.FunctionNode,\n    IndexNode = _ref.IndexNode,\n    ObjectNode = _ref.ObjectNode,\n    OperatorNode = _ref.OperatorNode,\n    ParenthesisNode = _ref.ParenthesisNode,\n    SymbolNode = _ref.SymbolNode;\n  var node0 = new ConstantNode(0);\n  var node1 = new ConstantNode(1);\n  var nodeT = new ConstantNode(true);\n  var nodeF = new ConstantNode(false);\n  // test if a node will always have a boolean value (true/false)\n  // not sure if this list is complete\n  function isAlwaysBoolean(node) {\n    return (0, _is.isOperatorNode)(node) && ['and', 'not', 'or'].includes(node.op);\n  }\n  var _createUtil = (0, _util.createUtil)({\n      FunctionNode: FunctionNode,\n      OperatorNode: OperatorNode,\n      SymbolNode: SymbolNode\n    }),\n    hasProperty = _createUtil.hasProperty,\n    isCommutative = _createUtil.isCommutative;\n  /**\n   * simplifyCore() performs single pass simplification suitable for\n   * applications requiring ultimate performance. To roughly summarize,\n   * it handles cases along the lines of simplifyConstant() but where\n   * knowledge of a single argument is sufficient to determine the value.\n   * In contrast, simplify() extends simplifyCore() with additional passes\n   * to provide deeper simplification (such as gathering like terms).\n   *\n   * Specifically, simplifyCore:\n   *\n   * * Converts all function calls with operator equivalents to their\n   *   operator forms.\n   * * Removes operators or function calls that are guaranteed to have no\n   *   effect (such as unary '+').\n   * * Removes double unary '-', '~', and 'not'\n   * * Eliminates addition/subtraction of 0 and multiplication/division/powers\n   *   by 1 or 0.\n   * * Converts addition of a negation into subtraction.\n   * * Eliminates logical operations with constant true or false leading\n   *   arguments.\n   * * Puts constants on the left of a product, if multiplication is\n   *   considered commutative by the options (which is the default)\n   *\n   * Syntax:\n   *\n   *     simplifyCore(expr)\n   *     simplifyCore(expr, options)\n   *\n   * Examples:\n   *\n   *     const f = math.parse('2 * 1 * x ^ (1 - 0)')\n   *     math.simplifyCore(f)                          // Node \"2 * x\"\n   *     math.simplify('2 * 1 * x ^ (1 - 0)', [math.simplifyCore]) // Node \"2 * x\"\n   *\n   * See also:\n   *\n   *     simplify, simplifyConstant, resolve, derivative\n   *\n   * @param {Node | string} node\n   *     The expression to be simplified\n   * @param {Object} options\n   *     Simplification options, as per simplify()\n   * @return {Node} Returns expression with basic simplifications applied\n   */\n  function _simplifyCore(nodeToSimplify) {\n    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n    var context = options ? options.context : undefined;\n    if (hasProperty(nodeToSimplify, 'trivial', context)) {\n      // This node does nothing if it has only one argument, so if so,\n      // return that argument simplified\n      if ((0, _is.isFunctionNode)(nodeToSimplify) && nodeToSimplify.args.length === 1) {\n        return _simplifyCore(nodeToSimplify.args[0], options);\n      }\n      // For other node types, we try the generic methods\n      var simpChild = false;\n      var childCount = 0;\n      nodeToSimplify.forEach(function (c) {\n        ++childCount;\n        if (childCount === 1) {\n          simpChild = _simplifyCore(c, options);\n        }\n      });\n      if (childCount === 1) {\n        return simpChild;\n      }\n    }\n    var node = nodeToSimplify;\n    if ((0, _is.isFunctionNode)(node)) {\n      var op = (0, _operators.getOperator)(node.name);\n      if (op) {\n        // Replace FunctionNode with a new OperatorNode\n        if (node.args.length > 2 && hasProperty(node, 'associative', context)) {\n          // unflatten into binary operations since that's what simplifyCore handles\n          while (node.args.length > 2) {\n            var last = node.args.pop();\n            var seclast = node.args.pop();\n            node.args.push(new OperatorNode(op, node.name, [last, seclast]));\n          }\n        }\n        node = new OperatorNode(op, node.name, node.args);\n      } else {\n        return new FunctionNode(_simplifyCore(node.fn), node.args.map(function (n) {\n          return _simplifyCore(n, options);\n        }));\n      }\n    }\n    if ((0, _is.isOperatorNode)(node) && node.isUnary()) {\n      var a0 = _simplifyCore(node.args[0], options);\n      if (node.op === '~') {\n        // bitwise not\n        if ((0, _is.isOperatorNode)(a0) && a0.isUnary() && a0.op === '~') {\n          return a0.args[0];\n        }\n      }\n      if (node.op === 'not') {\n        // logical not\n        if ((0, _is.isOperatorNode)(a0) && a0.isUnary() && a0.op === 'not') {\n          // Has the effect of turning the argument into a boolean\n          // So can only eliminate the double negation if\n          // the inside is already boolean\n          if (isAlwaysBoolean(a0.args[0])) {\n            return a0.args[0];\n          }\n        }\n      }\n      var finish = true;\n      if (node.op === '-') {\n        // unary minus\n        if ((0, _is.isOperatorNode)(a0)) {\n          if (a0.isBinary() && a0.fn === 'subtract') {\n            node = new OperatorNode('-', 'subtract', [a0.args[1], a0.args[0]]);\n            finish = false; // continue to process the new binary node\n          }\n\n          if (a0.isUnary() && a0.op === '-') {\n            return a0.args[0];\n          }\n        }\n      }\n      if (finish) return new OperatorNode(node.op, node.fn, [a0]);\n    }\n    if ((0, _is.isOperatorNode)(node) && node.isBinary()) {\n      var _a = _simplifyCore(node.args[0], options);\n      var a1 = _simplifyCore(node.args[1], options);\n      if (node.op === '+') {\n        if ((0, _is.isConstantNode)(_a) && isZero(_a.value)) {\n          return a1;\n        }\n        if ((0, _is.isConstantNode)(a1) && isZero(a1.value)) {\n          return _a;\n        }\n        if ((0, _is.isOperatorNode)(a1) && a1.isUnary() && a1.op === '-') {\n          a1 = a1.args[0];\n          node = new OperatorNode('-', 'subtract', [_a, a1]);\n        }\n      }\n      if (node.op === '-') {\n        if ((0, _is.isOperatorNode)(a1) && a1.isUnary() && a1.op === '-') {\n          return _simplifyCore(new OperatorNode('+', 'add', [_a, a1.args[0]]), options);\n        }\n        if ((0, _is.isConstantNode)(_a) && isZero(_a.value)) {\n          return _simplifyCore(new OperatorNode('-', 'unaryMinus', [a1]));\n        }\n        if ((0, _is.isConstantNode)(a1) && isZero(a1.value)) {\n          return _a;\n        }\n        return new OperatorNode(node.op, node.fn, [_a, a1]);\n      }\n      if (node.op === '*') {\n        if ((0, _is.isConstantNode)(_a)) {\n          if (isZero(_a.value)) {\n            return node0;\n          } else if (equal(_a.value, 1)) {\n            return a1;\n          }\n        }\n        if ((0, _is.isConstantNode)(a1)) {\n          if (isZero(a1.value)) {\n            return node0;\n          } else if (equal(a1.value, 1)) {\n            return _a;\n          }\n          if (isCommutative(node, context)) {\n            return new OperatorNode(node.op, node.fn, [a1, _a], node.implicit); // constants on left\n          }\n        }\n\n        return new OperatorNode(node.op, node.fn, [_a, a1], node.implicit);\n      }\n      if (node.op === '/') {\n        if ((0, _is.isConstantNode)(_a) && isZero(_a.value)) {\n          return node0;\n        }\n        if ((0, _is.isConstantNode)(a1) && equal(a1.value, 1)) {\n          return _a;\n        }\n        return new OperatorNode(node.op, node.fn, [_a, a1]);\n      }\n      if (node.op === '^') {\n        if ((0, _is.isConstantNode)(a1)) {\n          if (isZero(a1.value)) {\n            return node1;\n          } else if (equal(a1.value, 1)) {\n            return _a;\n          }\n        }\n      }\n      if (node.op === 'and') {\n        if ((0, _is.isConstantNode)(_a)) {\n          if (_a.value) {\n            if (isAlwaysBoolean(a1)) return a1;\n          } else {\n            return nodeF;\n          }\n        }\n        if ((0, _is.isConstantNode)(a1)) {\n          if (a1.value) {\n            if (isAlwaysBoolean(_a)) return _a;\n          } else {\n            return nodeF;\n          }\n        }\n      }\n      if (node.op === 'or') {\n        if ((0, _is.isConstantNode)(_a)) {\n          if (_a.value) {\n            return nodeT;\n          } else {\n            if (isAlwaysBoolean(a1)) return a1;\n          }\n        }\n        if ((0, _is.isConstantNode)(a1)) {\n          if (a1.value) {\n            return nodeT;\n          } else {\n            if (isAlwaysBoolean(_a)) return _a;\n          }\n        }\n      }\n      return new OperatorNode(node.op, node.fn, [_a, a1]);\n    }\n    if ((0, _is.isOperatorNode)(node)) {\n      return new OperatorNode(node.op, node.fn, node.args.map(function (a) {\n        return _simplifyCore(a, options);\n      }));\n    }\n    if ((0, _is.isArrayNode)(node)) {\n      return new ArrayNode(node.items.map(function (n) {\n        return _simplifyCore(n, options);\n      }));\n    }\n    if ((0, _is.isAccessorNode)(node)) {\n      return new AccessorNode(_simplifyCore(node.object, options), _simplifyCore(node.index, options));\n    }\n    if ((0, _is.isIndexNode)(node)) {\n      return new IndexNode(node.dimensions.map(function (n) {\n        return _simplifyCore(n, options);\n      }));\n    }\n    if ((0, _is.isObjectNode)(node)) {\n      var newProps = {};\n      for (var prop in node.properties) {\n        newProps[prop] = _simplifyCore(node.properties[prop], options);\n      }\n      return new ObjectNode(newProps);\n    }\n    // cannot simplify\n    return node;\n  }\n  return typed(name, {\n    Node: _simplifyCore,\n    'Node,Object': _simplifyCore\n  });\n});\nexports.createSimplifyCore = createSimplifyCore;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createResolve = void 0;\nvar _map = require(\"../../utils/map.js\");\nvar _is = require(\"../../utils/is.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'resolve';\nvar dependencies = ['typed', 'parse', 'ConstantNode', 'FunctionNode', 'OperatorNode', 'ParenthesisNode'];\nvar createResolve = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    parse = _ref.parse,\n    ConstantNode = _ref.ConstantNode,\n    FunctionNode = _ref.FunctionNode,\n    OperatorNode = _ref.OperatorNode,\n    ParenthesisNode = _ref.ParenthesisNode;\n  /**\n   * resolve(expr, scope) replaces variable nodes with their scoped values\n   *\n   * Syntax:\n   *\n   *     resolve(expr, scope)\n   *\n   * Examples:\n   *\n   *     math.resolve('x + y', {x:1, y:2})           // Node '1 + 2'\n   *     math.resolve(math.parse('x+y'), {x:1, y:2}) // Node '1 + 2'\n   *     math.simplify('x+y', {x:2, y: math.parse('x+x')}).toString() // \"6\"\n   *\n   * See also:\n   *\n   *     simplify, evaluate\n   *\n   * @param {Node | Node[]} node\n   *     The expression tree (or trees) to be simplified\n   * @param {Object} scope\n   *     Scope specifying variables to be resolved\n   * @return {Node | Node[]} Returns `node` with variables recursively substituted.\n   * @throws {ReferenceError}\n   *     If there is a cyclic dependency among the variables in `scope`,\n   *     resolution is impossible and a ReferenceError is thrown.\n   */\n  function _resolve(node, scope) {\n    var within = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : new Set();\n    // note `within`:\n    // `within` is not documented, since it is for internal cycle\n    // detection only\n    if (!scope) {\n      return node;\n    }\n    if ((0, _is.isSymbolNode)(node)) {\n      if (within.has(node.name)) {\n        var variables = Array.from(within).join(', ');\n        throw new ReferenceError(\"recursive loop of variable definitions among {\".concat(variables, \"}\"));\n      }\n      var value = scope.get(node.name);\n      if ((0, _is.isNode)(value)) {\n        var nextWithin = new Set(within);\n        nextWithin.add(node.name);\n        return _resolve(value, scope, nextWithin);\n      } else if (typeof value === 'number') {\n        return parse(String(value));\n      } else if (value !== undefined) {\n        return new ConstantNode(value);\n      } else {\n        return node;\n      }\n    } else if ((0, _is.isOperatorNode)(node)) {\n      var args = node.args.map(function (arg) {\n        return _resolve(arg, scope, within);\n      });\n      return new OperatorNode(node.op, node.fn, args, node.implicit);\n    } else if ((0, _is.isParenthesisNode)(node)) {\n      return new ParenthesisNode(_resolve(node.content, scope, within));\n    } else if ((0, _is.isFunctionNode)(node)) {\n      var _args = node.args.map(function (arg) {\n        return _resolve(arg, scope, within);\n      });\n      return new FunctionNode(node.name, _args);\n    }\n\n    // Otherwise just recursively resolve any children (might also work\n    // for some of the above special cases)\n    return node.map(function (child) {\n      return _resolve(child, scope, within);\n    });\n  }\n  return typed('resolve', {\n    Node: _resolve,\n    'Node, Map | null | undefined': _resolve,\n    'Node, Object': function NodeObject(n, scope) {\n      return _resolve(n, (0, _map.createMap)(scope));\n    },\n    // For arrays and matrices, we map `self` rather than `_resolve`\n    // because resolve is fairly expensive anyway, and this way\n    // we get nice error messages if one entry in the array has wrong type.\n    'Array | Matrix': typed.referToSelf(function (self) {\n      return function (A) {\n        return A.map(function (n) {\n          return self(n);\n        });\n      };\n    }),\n    'Array | Matrix, null | undefined': typed.referToSelf(function (self) {\n      return function (A) {\n        return A.map(function (n) {\n          return self(n);\n        });\n      };\n    }),\n    'Array, Object': typed.referTo('Array,Map', function (selfAM) {\n      return function (A, scope) {\n        return selfAM(A, (0, _map.createMap)(scope));\n      };\n    }),\n    'Matrix, Object': typed.referTo('Matrix,Map', function (selfMM) {\n      return function (A, scope) {\n        return selfMM(A, (0, _map.createMap)(scope));\n      };\n    }),\n    'Array | Matrix, Map': typed.referToSelf(function (self) {\n      return function (A, scope) {\n        return A.map(function (n) {\n          return self(n, scope);\n        });\n      };\n    })\n  });\n});\nexports.createResolve = createResolve;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSymbolicEqual = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'symbolicEqual';\nvar dependencies = ['parse', 'simplify', 'typed', 'OperatorNode'];\nvar createSymbolicEqual = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var parse = _ref.parse,\n    simplify = _ref.simplify,\n    typed = _ref.typed,\n    OperatorNode = _ref.OperatorNode;\n  /**\n   * Attempts to determine if two expressions are symbolically equal, i.e.\n   * one is the result of valid algebraic manipulations on the other.\n   * Currently, this simply checks if the difference of the two expressions\n   * simplifies down to 0. So there are two important caveats:\n   * 1. whether two expressions are symbolically equal depends on the\n   *     manipulations allowed. Therefore, this function takes an optional\n   *     third argument, which are the options that control the behavior\n   *     as documented for the `simplify()` function.\n   * 2. it is in general intractable to find the minimal simplification of\n   *     an arbitrarily complicated expression. So while a `true` value\n   *     of `symbolicEqual` ensures that the two expressions can be manipulated\n   *     to match each other, a `false` value does not absolutely rule this out.\n   *\n   * Syntax:\n   *\n   *    symbolicEqual(expr1, expr2)\n   *    symbolicEqual(expr1, expr2, options)\n   *\n   * Examples:\n   *\n   *    symbolicEqual('x*y', 'y*x') // Returns true\n   *    symbolicEqual('x*y', 'y*x', {context: {multiply: {commutative: false}}}) // Returns false\n   *    symbolicEqual('x/y', '(y*x^(-1))^(-1)') // Returns true\n   *    symbolicEqual('abs(x)','x') // Returns false\n   *    symbolicEqual('abs(x)','x', simplify.positiveContext) // Returns true\n   *\n   * See also:\n   *\n   *    simplify, evaluate\n   *\n   * @param {Node|string} expr1  The first expression to compare\n   * @param {Node|string} expr2  The second expression to compare\n   * @param {Object} [options] Optional option object, passed to simplify\n   * @returns {boolean}\n   *     Returns true if a valid manipulation making the expressions equal\n   *     is found.\n   */\n  function _symbolicEqual(e1, e2) {\n    var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n    var diff = new OperatorNode('-', 'subtract', [e1, e2]);\n    var simplified = simplify(diff, {}, options);\n    return (0, _is.isConstantNode)(simplified) && !simplified.value;\n  }\n  return typed(name, {\n    'Node, Node': _symbolicEqual,\n    'Node, Node, Object': _symbolicEqual\n  });\n});\nexports.createSymbolicEqual = createSymbolicEqual;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createDerivative = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'derivative';\nvar dependencies = ['typed', 'config', 'parse', 'simplify', 'equal', 'isZero', 'numeric', 'ConstantNode', 'FunctionNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode'];\nvar createDerivative = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    parse = _ref.parse,\n    simplify = _ref.simplify,\n    equal = _ref.equal,\n    isZero = _ref.isZero,\n    numeric = _ref.numeric,\n    ConstantNode = _ref.ConstantNode,\n    FunctionNode = _ref.FunctionNode,\n    OperatorNode = _ref.OperatorNode,\n    ParenthesisNode = _ref.ParenthesisNode,\n    SymbolNode = _ref.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').evaluate()          // number 2\n   *     math.derivative('x^2', 'x').evaluate({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, evaluate\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  function plainDerivative(expr, variable) {\n    var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {\n      simplify: true\n    };\n    var constNodes = {};\n    constTag(constNodes, expr, variable.name);\n    var res = _derivative(expr, constNodes);\n    return options.simplify ? simplify(res) : res;\n  }\n  typed.addConversion({\n    from: 'identifier',\n    to: 'SymbolNode',\n    convert: parse\n  });\n  var derivative = typed(name, {\n    'Node, SymbolNode': plainDerivative,\n    'Node, SymbolNode, Object': plainDerivative\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  typed.removeConversion({\n    from: 'identifier',\n    to: 'SymbolNode',\n    convert: parse\n  });\n  derivative._simplify = true;\n  derivative.toTex = function (deriv) {\n    return _derivTex.apply(null, deriv.args);\n  };\n\n  // FIXME: move the toTex method of derivative to latex.js. Difficulty is that it relies on parse.\n  // NOTE: the optional \"order\" parameter here is currently unused\n  var _derivTex = typed('_derivTex', {\n    'Node, SymbolNode': function NodeSymbolNode(expr, x) {\n      if ((0, _is.isConstantNode)(expr) && (0, _is.typeOf)(expr.value) === 'string') {\n        return _derivTex(parse(expr.value).toString(), x.toString(), 1);\n      } else {\n        return _derivTex(expr.toTex(), x.toString(), 1);\n      }\n    },\n    'Node, ConstantNode': function NodeConstantNode(expr, x) {\n      if ((0, _is.typeOf)(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      if (order === 1) {\n        d = '{d\\\\over d' + x + '}';\n      } else {\n        d = '{d^{' + order + '}\\\\over d' + x + '^{' + order + '}}';\n      }\n      return d + \"\\\\left[\".concat(expr, \"\\\\right]\");\n    }\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  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      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      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        for (var i = 1; i < node.args.length; ++i) {\n          isConst = constTag(constNodes, node.args[i], varName) && isConst;\n        }\n        if (isConst) {\n          constNodes[node] = true;\n          return true;\n        }\n      }\n      return false;\n    }\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  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      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      return _derivative(node.expr, constNodes);\n    },\n    'FunctionNode, Object': function FunctionNodeObject(node, constNodes) {\n      if (node.args.length !== 1) {\n        funcArgsCheck(node);\n      }\n      if (constNodes[node] !== undefined) {\n        return createConstantNode(0);\n      }\n      var arg0 = node.args[0];\n      var arg1;\n      var div = false; // is output a fraction?\n      var negative = false; // is output negative?\n\n      var funcDerivative;\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        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]]);\n\n            // Is a variable?\n            constNodes[arg1] = constNodes[node.args[1]];\n            return _derivative(new OperatorNode('^', 'pow', [arg0, arg1]), constNodes);\n          }\n          break;\n        case 'log10':\n          arg1 = createConstantNode(10);\n        /* fall through! */\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          break;\n        case 'pow':\n          constNodes[arg1] = constNodes[node.args[1]];\n          // Pass to pow operator node parser\n          return _derivative(new OperatorNode('^', 'pow', [arg0, node.args[1]]), constNodes);\n        case 'exp':\n          // d/dx(e^x) = e^x\n          funcDerivative = new FunctionNode('exp', [arg0.clone()]);\n          break;\n        case 'sin':\n          // d/dx(sin(x)) = cos(x)\n          funcDerivative = new FunctionNode('cos', [arg0.clone()]);\n          break;\n        case 'cos':\n          // d/dx(cos(x)) = -sin(x)\n          funcDerivative = new OperatorNode('-', 'unaryMinus', [new FunctionNode('sin', [arg0.clone()])]);\n          break;\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        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        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        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        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        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        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        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        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        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        case 'sinh':\n          // d/dx(sinh(x)) = cosh(x)\n          funcDerivative = new FunctionNode('cosh', [arg0.clone()]);\n          break;\n        case 'cosh':\n          // d/dx(cosh(x)) = sinh(x)\n          funcDerivative = new FunctionNode('sinh', [arg0.clone()]);\n          break;\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        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        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        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        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        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        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        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        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        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        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        case 'gamma': // Needs digamma function, d/dx(gamma(x)) = gamma(x)digamma(x)\n        default:\n          throw new Error('Function \"' + node.name + '\" is not supported by derivative, or a wrong number of arguments is passed');\n      }\n      var op, func;\n      if (div) {\n        op = '/';\n        func = 'divide';\n      } else {\n        op = '*';\n        func = 'multiply';\n      }\n\n      /* Apply chain rule to all functions:\n         F(x)  = f(g(x))\n         F'(x) = g'(x)*f'(g(x)) */\n      var chainDerivative = _derivative(arg0, constNodes);\n      if (negative) {\n        chainDerivative = new OperatorNode('-', 'unaryMinus', [chainDerivative]);\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      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      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        }\n\n        // Linearity of differentiation, d/dx(f(x) +/- g(x)) = f'(x) +/- g'(x)\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      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        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        }\n\n        // Product Rule, d/dx(f(x)*g(x)) = f'(x)*g(x) + f(x)*g'(x)\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      if (node.op === '/' && node.isBinary()) {\n        var arg0 = node.args[0];\n        var arg1 = node.args[1];\n\n        // d/dx(f(x) / c) = f'(x) / c\n        if (constNodes[arg1] !== undefined) {\n          return new OperatorNode('/', 'divide', [_derivative(arg0, constNodes), arg1]);\n        }\n\n        // Reciprocal Rule, d/dx(c / f(x)) = -c(f'(x)/f(x)^2)\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        }\n\n        // Quotient rule, d/dx(f(x) / g(x)) = (f'(x)g(x) - f(x)g'(x)) / g(x)^2\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      if (node.op === '^' && node.isBinary()) {\n        var _arg = node.args[0];\n        var _arg2 = node.args[1];\n        if (constNodes[_arg] !== undefined) {\n          // If is secretly constant; 0^f(x) = 1 (in JS), 1^f(x) = 1\n          if ((0, _is.isConstantNode)(_arg) && (isZero(_arg.value) || equal(_arg.value, 1))) {\n            return createConstantNode(0);\n          }\n\n          // d/dx(c^f(x)) = c^f(x)*ln(c)*f'(x)\n          return new OperatorNode('*', 'multiply', [node, new OperatorNode('*', 'multiply', [new FunctionNode('log', [_arg.clone()]), _derivative(_arg2.clone(), constNodes)])]);\n        }\n        if (constNodes[_arg2] !== undefined) {\n          if ((0, _is.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            }\n            // Ignore exponent; f(x)^1 = f(x)\n            if (equal(_arg2.value, 1)) {\n              return _derivative(_arg, constNodes);\n            }\n          }\n\n          // Elementary Power Rule, d/dx(f(x)^c) = c*f'(x)*f(x)^(c-1)\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        }\n\n        // Functional Power Rule, d/dx(f^g) = f^g*[f'*(g/f) + g'ln(f)]\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      throw new Error('Operator \"' + node.op + '\" is not supported by derivative, or a wrong number of arguments is passed');\n    }\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  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    }\n\n    // There should be an incorrect number of arguments if we reach here\n\n    // Change all args to constants to avoid unidentified\n    // symbol error when compiling function\n    for (var i = 0; i < node.args.length; ++i) {\n      node.args[i] = createConstantNode(0);\n    }\n    node.compile().evaluate();\n    throw new Error('Expected TypeError, but none found');\n  }\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  function createConstantNode(value, valueType) {\n    return new ConstantNode(numeric(value, valueType || config.number));\n  }\n  return derivative;\n});\nexports.createDerivative = createDerivative;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createRationalize = void 0;\nvar _number = require(\"../../utils/number.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'rationalize';\nvar dependencies = ['config', 'typed', 'equal', 'isZero', 'add', 'subtract', 'multiply', 'divide', 'pow', 'parse', 'simplifyConstant', 'simplifyCore', 'simplify', '?bignumber', '?fraction', 'mathWithTransform', 'matrix', 'AccessorNode', 'ArrayNode', 'ConstantNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'SymbolNode', 'ParenthesisNode'];\nvar createRationalize = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var config = _ref.config,\n    typed = _ref.typed,\n    equal = _ref.equal,\n    isZero = _ref.isZero,\n    add = _ref.add,\n    subtract = _ref.subtract,\n    multiply = _ref.multiply,\n    divide = _ref.divide,\n    pow = _ref.pow,\n    parse = _ref.parse,\n    simplifyConstant = _ref.simplifyConstant,\n    simplifyCore = _ref.simplifyCore,\n    simplify = _ref.simplify,\n    fraction = _ref.fraction,\n    bignumber = _ref.bignumber,\n    mathWithTransform = _ref.mathWithTransform,\n    matrix = _ref.matrix,\n    AccessorNode = _ref.AccessorNode,\n    ArrayNode = _ref.ArrayNode,\n    ConstantNode = _ref.ConstantNode,\n    FunctionNode = _ref.FunctionNode,\n    IndexNode = _ref.IndexNode,\n    ObjectNode = _ref.ObjectNode,\n    OperatorNode = _ref.OperatorNode,\n    SymbolNode = _ref.SymbolNode,\n    ParenthesisNode = _ref.ParenthesisNode;\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 | Node}    The rational polynomial of `expr` or an object\n   *            `{expression, numerator, denominator, variables, coefficients}`, where\n   *              `expression` is a `Node` with the node simplified expression,\n   *              `numerator` is a `Node` with the simplified numerator of expression,\n   *              `denominator` is a `Node` or `boolean` with the simplified denominator or `false` (if there is no denominator),\n   *              `variables` is an array with variable names,\n   *              and `coefficients` is an array with coefficients of numerator sorted by increased exponent\n   *           {Expression Node}  node simplified expression\n   *\n   */\n  function _rationalize(expr) {\n    var scope = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n    var detailed = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n    var setRules = rulesRationalize(); // Rules for change polynomial in near canonical form\n    var polyRet = polynomial(expr, scope, true, setRules.firstRules); // Check if expression is a rationalizable polynomial\n    var nVars = polyRet.variables.length;\n    var noExactFractions = {\n      exactFractions: false\n    };\n    var withExactFractions = {\n      exactFractions: true\n    };\n    expr = polyRet.expression;\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      var sBefore; // Previous expression\n      var rules;\n      var eDistrDiv = true;\n      var redoInic = false;\n      // Apply the initial rules, including succ div rules:\n      expr = simplify(expr, setRules.firstRules, {}, noExactFractions);\n      var s;\n      while (true) {\n        // Alternate applying successive division rules and distr.div.rules\n        // until there are no more changes:\n        rules = eDistrDiv ? setRules.distrDivRules : setRules.sucDivRules;\n        expr = simplify(expr, rules, {}, withExactFractions);\n        eDistrDiv = !eDistrDiv; // Swap between Distr.Div and Succ. Div. Rules\n\n        s = expr.toString();\n        if (s === sBefore) {\n          break; // No changes : end of the loop\n        }\n\n        redoInic = true;\n        sBefore = s;\n      }\n      if (redoInic) {\n        // Apply first rules again without succ div rules (if there are changes)\n        expr = simplify(expr, setRules.firstRulesAgain, {}, noExactFractions);\n      }\n      // Apply final rules:\n      expr = simplify(expr, setRules.finalRules, {}, noExactFractions);\n    } // NVars >= 1\n\n    var coefficients = [];\n    var retRationalize = {};\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      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      if (detailed) {\n        retRationalize.numerator = expr;\n        retRationalize.denominator = null;\n      }\n    }\n    // nVars\n\n    if (!detailed) return expr;\n    retRationalize.coefficients = coefficients;\n    retRationalize.variables = polyRet.variables;\n    retRationalize.expression = expr;\n    return retRationalize;\n  }\n  return typed(name, {\n    Node: _rationalize,\n    'Node, boolean': function NodeBoolean(expr, detailed) {\n      return _rationalize(expr, {}, detailed);\n    },\n    'Node, Object': _rationalize,\n    'Node, Object, boolean': _rationalize\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  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    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\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    function recPoly(node) {\n      var tp = node.type; // node type\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          // TODO: handle negative exponents like in '1/x^(-2)'\n          if (node.args[1].type !== 'ConstantNode' || !(0, _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          for (var i = 0; i < node.args.length; i++) {\n            recPoly(node.args[i]);\n          }\n        } // type of operator\n      } else if (tp === 'SymbolNode') {\n        var _name = node.name; // variable name\n        var pos = variables.indexOf(_name);\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  } // 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  function rulesRationalize() {\n    var oldRules = [simplifyCore,\n    // sCore\n    {\n      l: 'n+n',\n      r: '2*n'\n    }, {\n      l: 'n+-n',\n      r: '0'\n    }, simplifyConstant,\n    // 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    },\n    // Unary division\n    {\n      l: '(-n1)*(-n2)',\n      r: 'n1*n2'\n    },\n    // Unary multiplication\n    {\n      l: 'n1--n2',\n      r: 'n1+n2'\n    },\n    // '--' elimination\n    {\n      l: 'n1-n2',\n      r: 'n1+(-n2)'\n    },\n    // Subtraction turn into add with un�ry minus\n    {\n      l: '(n1+n2)*n3',\n      r: '(n1*n3 + n2*n3)'\n    },\n    // Distributive 1\n    {\n      l: 'n1*(n2+n3)',\n      r: '(n1*n2+n1*n3)'\n    },\n    // Distributive 2\n    {\n      l: 'c1*n + c2*n',\n      r: '(c1+c2)*n'\n    },\n    // Joining constants\n    {\n      l: 'c1*n + n',\n      r: '(c1+1)*n'\n    },\n    // Joining constants\n    {\n      l: 'c1*n - c2*n',\n      r: '(c1-c2)*n'\n    },\n    // Joining constants\n    {\n      l: 'c1*n - n',\n      r: '(c1-1)*n'\n    },\n    // Joining constants\n    {\n      l: 'v/c',\n      r: '(1/c)*v'\n    },\n    // variable/constant (new!)\n    {\n      l: 'v/-c',\n      r: '-(1/c)*v'\n    },\n    // variable/constant (new!)\n    {\n      l: '-v*-c',\n      r: 'c*v'\n    },\n    // Inversion constant and variable 1\n    {\n      l: '-v*c',\n      r: '-c*v'\n    },\n    // Inversion constant and variable 2\n    {\n      l: 'v*-c',\n      r: '-c*v'\n    },\n    // Inversion constant and variable 3\n    {\n      l: 'v*c',\n      r: 'c*v'\n    },\n    // Inversion constant and variable 4\n    {\n      l: '-(-n1*n2)',\n      r: '(n1*n2)'\n    },\n    // Unary propagation\n    {\n      l: '-(n1*n2)',\n      r: '(-n1*n2)'\n    },\n    // Unary propagation\n    {\n      l: '-(-n1+n2)',\n      r: '(n1-n2)'\n    },\n    // Unary propagation\n    {\n      l: '-(n1+n2)',\n      r: '(-n1-n2)'\n    },\n    // Unary propagation\n    {\n      l: '(n1^n2)^n3',\n      r: '(n1^(n2*n3))'\n    },\n    // Power to Power\n    {\n      l: '-(-n1/n2)',\n      r: '(n1/n2)'\n    },\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    },\n    // Sum of fractions\n    {\n      l: '(n1/n2 + n3)',\n      r: '((n1 + n3*n2)/n2)'\n    },\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    },\n    // Division simplification\n    {\n      l: '(n1/n2/n3)',\n      r: '(n1/(n2*n3))'\n    }];\n    var setRules = {}; // rules set in 4 steps.\n\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    setRules.distrDivRules = rulesDistrDiv; // Just distr. div. rules\n    setRules.sucDivRules = rulesSucDiv; // Jus succ. div. rules\n    setRules.firstRulesAgain = oldRules.concat(rulesFirst); // Last rules set without succ. div.\n\n    // Division simplification\n\n    // Second rule set.\n    // There is no aggregate expression with parentesis, but the only variable can be scattered.\n    setRules.finalRules = [simplifyCore,\n    // simplify.rules[0]\n    {\n      l: 'n*-n',\n      r: '-n^2'\n    },\n    // Joining multiply with power 1\n    {\n      l: 'n*n',\n      r: 'n^2'\n    },\n    // Joining multiply with power 2\n    simplifyConstant,\n    // simplify.rules[14] old 3rd index in oldRules\n    {\n      l: 'n*-n^n1',\n      r: '-n^(n1+1)'\n    },\n    // Joining multiply with power 3\n    {\n      l: 'n*n^n1',\n      r: 'n^(n1+1)'\n    },\n    // Joining multiply with power 4\n    {\n      l: 'n^n1*-n^n2',\n      r: '-n^(n1+n2)'\n    },\n    // Joining multiply with power 5\n    {\n      l: 'n^n1*n^n2',\n      r: 'n^(n1+n2)'\n    },\n    // Joining multiply with power 6\n    {\n      l: 'n^n1*-n',\n      r: '-n^(n1+1)'\n    },\n    // Joining multiply with power 7\n    {\n      l: 'n^n1*n',\n      r: 'n^(n1+1)'\n    },\n    // Joining multiply with power 8\n    {\n      l: 'n^n1/-n',\n      r: '-n^(n1-1)'\n    },\n    // Joining multiply with power 8\n    {\n      l: 'n^n1/n',\n      r: 'n^(n1-1)'\n    },\n    // Joining division with power 1\n    {\n      l: 'n/-n^n1',\n      r: '-n^(1-n1)'\n    },\n    // Joining division with power 2\n    {\n      l: 'n/n^n1',\n      r: 'n^(1-n1)'\n    },\n    // Joining division with power 3\n    {\n      l: 'n^n1/-n^n2',\n      r: 'n^(n1-n2)'\n    },\n    // Joining division with power 4\n    {\n      l: 'n^n1/n^n2',\n      r: 'n^(n1-n2)'\n    },\n    // Joining division with power 5\n    {\n      l: 'n1+(-n2*n3)',\n      r: 'n1-n2*n3'\n    },\n    // Solving useless parenthesis 1\n    {\n      l: 'v*(-c)',\n      r: '-c*v'\n    },\n    // Solving useless unary 2\n    {\n      l: 'n1+-n2',\n      r: 'n1-n2'\n    },\n    // Solving +- together (new!)\n    {\n      l: 'v*c',\n      r: 'c*v'\n    },\n    // inversion constant with variable\n    {\n      l: '(n1^n2)^n3',\n      r: '(n1^(n2*n3))'\n    } // 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  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      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 && (0, _number.isInteger)(val);\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        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    } // binary OperatorNode\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    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  function polyToCanonical(node, coefficients) {\n    if (coefficients === undefined) {\n      coefficients = [];\n    } // coefficients.\n\n    coefficients[0] = 0; // index is the exponent\n    var o = {};\n    o.cte = 1;\n    o.oper = '+';\n\n    // 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    o.fire = '';\n    var maxExpo = 0; // maximum exponent\n    var varname = ''; // variable name\n\n    recurPol(node, null, o);\n    maxExpo = coefficients.length - 1;\n    var first = true;\n    var no;\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      if (i > 0) {\n        // Is not a constant without variable\n        var n2 = new SymbolNode(varname);\n        if (i > 1) {\n          var n3 = new ConstantNode(i);\n          n2 = new OperatorNode('^', 'pow', [n2, n3]);\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      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      first = false;\n    } // for\n\n    if (first) {\n      return new ConstantNode(0);\n    } else {\n      return no;\n    }\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    function recurPol(node, noPai, o) {\n      var tp = node.type;\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        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          }\n\n          // -,+,* : children of +,-\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          }\n\n          // -,+ : first child\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\n        // Firers: ^,*       Old:   ^,&,-(unary): firers\n        if (node.op === '^' || node.op === '*') {\n          o.fire = node.op;\n        }\n        for (var _i = 0; _i < node.args.length; _i++) {\n          // +,-: reset fire\n          if (node.fn === 'unaryMinus') o.oper = '-';\n          if (node.op === '+' || node.fn === 'subtract') {\n            o.fire = '';\n            o.cte = 1; // default if there is no constant\n            o.oper = _i === 0 ? '+' : node.op;\n          }\n          o.noFil = _i; // number of son\n          recurPol(node.args[_i], node, o);\n        } // for in children\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        varname = node.name;\n        if (noPai === null) {\n          coefficients[1] = 1;\n          return;\n        }\n\n        // ^: Symbol is First child\n        if (noPai.op === '^' && o.noFil !== 0) {\n          throw new Error('In power the variable should be the first parameter');\n        }\n\n        // *: Symbol is Second child\n        if (noPai.op === '*' && o.noFil !== 1) {\n          throw new Error('In multiply the variable should be the second parameter');\n        }\n\n        // Symbol: firers '',* => it means there is no exponent above, so it's 1 (cte * var)\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        if (noPai === null) {\n          coefficients[0] = valor;\n          return;\n        }\n        if (noPai.op === '^') {\n          // cte: second  child of power\n          if (o.noFil !== 1) throw new Error('Constant cannot be powered');\n          if (!(0, _number.isInteger)(valor) || valor <= 0) {\n            throw new Error('Non-integer exponent is not allowed');\n          }\n          for (var _i2 = maxExpo + 1; _i2 < valor; _i2++) {\n            coefficients[_i2] = 0;\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        o.cte = valor;\n\n        // Cte: firer '' => There is no exponent and no multiplication, so the exponent is 0.\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  } // End of polyToCanonical\n});\nexports.createRationalize = createRationalize;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createReviver = void 0;\nvar _factory = require(\"../utils/factory.js\");\nvar name = 'reviver';\nvar dependencies = ['classes'];\nvar createReviver = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var classes = _ref.classes;\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 = classes[value && value.mathjs];\n    if (constructor && typeof constructor.fromJSON === 'function') {\n      return constructor.fromJSON(value);\n    }\n    return value;\n  };\n});\nexports.createReviver = createReviver;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createReplacer = void 0;\nvar _factory = require(\"../utils/factory.js\");\nvar name = 'replacer';\nvar dependencies = [];\nvar createReplacer = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function () {\n  /**\n   * Stringify data types into their JSON representation.\n   * Most data types can be serialized using their `.toJSON` method,\n   * but not all, for example the number `Infinity`. For these cases you have\n   * to use the replacer. Example usage:\n   *\n   *     JSON.stringify([2, Infinity], math.replacer)\n   *\n   * @param {string} key\n   * @param {*} value\n   * @returns {*} Returns the replaced object\n   */\n  return function replacer(key, value) {\n    // the numeric values Infinitiy, -Infinity, and NaN cannot be serialized to JSON\n    if (typeof value === 'number' && (!isFinite(value) || isNaN(value))) {\n      return {\n        mathjs: 'number',\n        value: String(value)\n      };\n    }\n    return value;\n  };\n});\nexports.createReplacer = createReplacer;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.version = void 0;\nvar version = '11.7.0';\n// Note: This file is automatically generated when building math.js.\n// Changes made in this file will be overwritten.\nexports.version = version;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createVersion = exports.createUppercasePi = exports.createUppercaseE = exports.createTrue = exports.createTau = exports.createSQRT2 = exports.createSQRT1_2 = exports.createPi = exports.createPhi = exports.createNull = exports.createNaN = exports.createLOG2E = exports.createLOG10E = exports.createLN2 = exports.createLN10 = exports.createInfinity = exports.createI = exports.createFalse = exports.createE = void 0;\nvar _factory = require(\"./utils/factory.js\");\nvar _version = require(\"./version.js\");\nvar _constants = require(\"./utils/bignumber/constants.js\");\nvar _index = require(\"./plain/number/index.js\");\nvar createTrue = /* #__PURE__ */(0, _factory.factory)('true', [], function () {\n  return true;\n});\nexports.createTrue = createTrue;\nvar createFalse = /* #__PURE__ */(0, _factory.factory)('false', [], function () {\n  return false;\n});\nexports.createFalse = createFalse;\nvar createNull = /* #__PURE__ */(0, _factory.factory)('null', [], function () {\n  return null;\n});\nexports.createNull = createNull;\nvar createInfinity = /* #__PURE__ */recreateFactory('Infinity', ['config', '?BigNumber'], function (_ref) {\n  var config = _ref.config,\n    BigNumber = _ref.BigNumber;\n  return config.number === 'BigNumber' ? new BigNumber(Infinity) : Infinity;\n});\nexports.createInfinity = createInfinity;\nvar createNaN = /* #__PURE__ */recreateFactory('NaN', ['config', '?BigNumber'], function (_ref2) {\n  var config = _ref2.config,\n    BigNumber = _ref2.BigNumber;\n  return config.number === 'BigNumber' ? new BigNumber(NaN) : NaN;\n});\nexports.createNaN = createNaN;\nvar createPi = /* #__PURE__ */recreateFactory('pi', ['config', '?BigNumber'], function (_ref3) {\n  var config = _ref3.config,\n    BigNumber = _ref3.BigNumber;\n  return config.number === 'BigNumber' ? (0, _constants.createBigNumberPi)(BigNumber) : _index.pi;\n});\nexports.createPi = createPi;\nvar createTau = /* #__PURE__ */recreateFactory('tau', ['config', '?BigNumber'], function (_ref4) {\n  var config = _ref4.config,\n    BigNumber = _ref4.BigNumber;\n  return config.number === 'BigNumber' ? (0, _constants.createBigNumberTau)(BigNumber) : _index.tau;\n});\nexports.createTau = createTau;\nvar createE = /* #__PURE__ */recreateFactory('e', ['config', '?BigNumber'], function (_ref5) {\n  var config = _ref5.config,\n    BigNumber = _ref5.BigNumber;\n  return config.number === 'BigNumber' ? (0, _constants.createBigNumberE)(BigNumber) : _index.e;\n});\n\n// golden ratio, (1+sqrt(5))/2\nexports.createE = createE;\nvar createPhi = /* #__PURE__ */recreateFactory('phi', ['config', '?BigNumber'], function (_ref6) {\n  var config = _ref6.config,\n    BigNumber = _ref6.BigNumber;\n  return config.number === 'BigNumber' ? (0, _constants.createBigNumberPhi)(BigNumber) : _index.phi;\n});\nexports.createPhi = createPhi;\nvar createLN2 = /* #__PURE__ */recreateFactory('LN2', ['config', '?BigNumber'], function (_ref7) {\n  var config = _ref7.config,\n    BigNumber = _ref7.BigNumber;\n  return config.number === 'BigNumber' ? new BigNumber(2).ln() : Math.LN2;\n});\nexports.createLN2 = createLN2;\nvar createLN10 = /* #__PURE__ */recreateFactory('LN10', ['config', '?BigNumber'], function (_ref8) {\n  var config = _ref8.config,\n    BigNumber = _ref8.BigNumber;\n  return config.number === 'BigNumber' ? new BigNumber(10).ln() : Math.LN10;\n});\nexports.createLN10 = createLN10;\nvar createLOG2E = /* #__PURE__ */recreateFactory('LOG2E', ['config', '?BigNumber'], function (_ref9) {\n  var config = _ref9.config,\n    BigNumber = _ref9.BigNumber;\n  return config.number === 'BigNumber' ? new BigNumber(1).div(new BigNumber(2).ln()) : Math.LOG2E;\n});\nexports.createLOG2E = createLOG2E;\nvar createLOG10E = /* #__PURE__ */recreateFactory('LOG10E', ['config', '?BigNumber'], function (_ref10) {\n  var config = _ref10.config,\n    BigNumber = _ref10.BigNumber;\n  return config.number === 'BigNumber' ? new BigNumber(1).div(new BigNumber(10).ln()) : Math.LOG10E;\n});\nexports.createLOG10E = createLOG10E;\nvar createSQRT1_2 = /* #__PURE__ */recreateFactory(\n// eslint-disable-line camelcase\n'SQRT1_2', ['config', '?BigNumber'], function (_ref11) {\n  var config = _ref11.config,\n    BigNumber = _ref11.BigNumber;\n  return config.number === 'BigNumber' ? new BigNumber('0.5').sqrt() : Math.SQRT1_2;\n});\nexports.createSQRT1_2 = createSQRT1_2;\nvar createSQRT2 = /* #__PURE__ */recreateFactory('SQRT2', ['config', '?BigNumber'], function (_ref12) {\n  var config = _ref12.config,\n    BigNumber = _ref12.BigNumber;\n  return config.number === 'BigNumber' ? new BigNumber(2).sqrt() : Math.SQRT2;\n});\nexports.createSQRT2 = createSQRT2;\nvar createI = /* #__PURE__ */recreateFactory('i', ['Complex'], function (_ref13) {\n  var Complex = _ref13.Complex;\n  return Complex.I;\n});\n\n// for backward compatibility with v5\nexports.createI = createI;\nvar createUppercasePi = /* #__PURE__ */(0, _factory.factory)('PI', ['pi'], function (_ref14) {\n  var pi = _ref14.pi;\n  return pi;\n});\nexports.createUppercasePi = createUppercasePi;\nvar createUppercaseE = /* #__PURE__ */(0, _factory.factory)('E', ['e'], function (_ref15) {\n  var e = _ref15.e;\n  return e;\n});\nexports.createUppercaseE = createUppercaseE;\nvar createVersion = /* #__PURE__ */(0, _factory.factory)('version', [], function () {\n  return _version.version;\n});\n\n// helper function to create a factory with a flag recreateOnConfigChange\n// idea: allow passing optional properties to be attached to the factory function as 4th argument?\nexports.createVersion = createVersion;\nfunction recreateFactory(name, dependencies, create) {\n  return (0, _factory.factory)(name, dependencies, create, {\n    recreateOnConfigChange: true\n  });\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createWienDisplacement = exports.createWeakMixingAngle = exports.createVacuumImpedance = exports.createThomsonCrossSection = exports.createStefanBoltzmann = exports.createSpeedOfLight = exports.createSecondRadiation = exports.createSackurTetrode = exports.createRydberg = exports.createReducedPlanckConstant = exports.createQuantumOfCirculation = exports.createProtonMass = exports.createPlanckTime = exports.createPlanckTemperature = exports.createPlanckMass = exports.createPlanckLength = exports.createPlanckConstant = exports.createPlanckCharge = exports.createNuclearMagneton = exports.createNeutronMass = exports.createMolarVolume = exports.createMolarPlanckConstant = exports.createMolarMassC12 = exports.createMolarMass = exports.createMagneticFluxQuantum = exports.createMagneticConstant = exports.createLoschmidt = exports.createKlitzing = exports.createJosephson = exports.createInverseConductanceQuantum = exports.createHartreeEnergy = exports.createGravity = exports.createGravitationConstant = exports.createGasConstant = exports.createFirstRadiation = exports.createFineStructure = exports.createFermiCoupling = exports.createFaraday = exports.createElementaryCharge = exports.createElectronMass = exports.createElectricConstant = exports.createEfimovFactor = exports.createDeuteronMass = exports.createCoulomb = exports.createConductanceQuantum = exports.createClassicalElectronRadius = exports.createBoltzmann = exports.createBohrRadius = exports.createBohrMagneton = exports.createAvogadro = exports.createAtomicMass = void 0;\nvar _factory = require(\"../../utils/factory.js\");\n// Source: https://en.wikipedia.org/wiki/Physical_constant\n\n// Universal constants\nvar createSpeedOfLight = /* #__PURE__ */unitFactory('speedOfLight', '299792458', 'm s^-1');\nexports.createSpeedOfLight = createSpeedOfLight;\nvar createGravitationConstant = /* #__PURE__ */unitFactory('gravitationConstant', '6.67430e-11', 'm^3 kg^-1 s^-2');\nexports.createGravitationConstant = createGravitationConstant;\nvar createPlanckConstant = /* #__PURE__ */unitFactory('planckConstant', '6.62607015e-34', 'J s');\nexports.createPlanckConstant = createPlanckConstant;\nvar createReducedPlanckConstant = /* #__PURE__ */unitFactory('reducedPlanckConstant', '1.0545718176461565e-34', 'J s');\n\n// Electromagnetic constants\nexports.createReducedPlanckConstant = createReducedPlanckConstant;\nvar createMagneticConstant = /* #__PURE__ */unitFactory('magneticConstant', '1.25663706212e-6', 'N A^-2');\nexports.createMagneticConstant = createMagneticConstant;\nvar createElectricConstant = /* #__PURE__ */unitFactory('electricConstant', '8.8541878128e-12', 'F m^-1');\nexports.createElectricConstant = createElectricConstant;\nvar createVacuumImpedance = /* #__PURE__ */unitFactory('vacuumImpedance', '376.730313667', 'ohm');\nexports.createVacuumImpedance = createVacuumImpedance;\nvar createCoulomb = /* #__PURE__ */unitFactory('coulomb', '8.987551792261171e9', 'N m^2 C^-2');\nexports.createCoulomb = createCoulomb;\nvar createElementaryCharge = /* #__PURE__ */unitFactory('elementaryCharge', '1.602176634e-19', 'C');\nexports.createElementaryCharge = createElementaryCharge;\nvar createBohrMagneton = /* #__PURE__ */unitFactory('bohrMagneton', '9.2740100783e-24', 'J T^-1');\nexports.createBohrMagneton = createBohrMagneton;\nvar createConductanceQuantum = /* #__PURE__ */unitFactory('conductanceQuantum', '7.748091729863649e-5', 'S');\nexports.createConductanceQuantum = createConductanceQuantum;\nvar createInverseConductanceQuantum = /* #__PURE__ */unitFactory('inverseConductanceQuantum', '12906.403729652257', 'ohm');\nexports.createInverseConductanceQuantum = createInverseConductanceQuantum;\nvar createMagneticFluxQuantum = /* #__PURE__ */unitFactory('magneticFluxQuantum', '2.0678338484619295e-15', 'Wb');\nexports.createMagneticFluxQuantum = createMagneticFluxQuantum;\nvar createNuclearMagneton = /* #__PURE__ */unitFactory('nuclearMagneton', '5.0507837461e-27', 'J T^-1');\nexports.createNuclearMagneton = createNuclearMagneton;\nvar createKlitzing = /* #__PURE__ */unitFactory('klitzing', '25812.807459304513', 'ohm');\nexports.createKlitzing = createKlitzing;\nvar createJosephson = /* #__PURE__ */unitFactory('josephson', '4.835978484169836e14 Hz V', 'Hz V^-1'); // TODO: support for Hz needed\n\n// Atomic and nuclear constants\nexports.createJosephson = createJosephson;\nvar createBohrRadius = /* #__PURE__ */unitFactory('bohrRadius', '5.29177210903e-11', 'm');\nexports.createBohrRadius = createBohrRadius;\nvar createClassicalElectronRadius = /* #__PURE__ */unitFactory('classicalElectronRadius', '2.8179403262e-15', 'm');\nexports.createClassicalElectronRadius = createClassicalElectronRadius;\nvar createElectronMass = /* #__PURE__ */unitFactory('electronMass', '9.1093837015e-31', 'kg');\nexports.createElectronMass = createElectronMass;\nvar createFermiCoupling = /* #__PURE__ */unitFactory('fermiCoupling', '1.1663787e-5', 'GeV^-2');\nexports.createFermiCoupling = createFermiCoupling;\nvar createFineStructure = numberFactory('fineStructure', 7.2973525693e-3);\nexports.createFineStructure = createFineStructure;\nvar createHartreeEnergy = /* #__PURE__ */unitFactory('hartreeEnergy', '4.3597447222071e-18', 'J');\nexports.createHartreeEnergy = createHartreeEnergy;\nvar createProtonMass = /* #__PURE__ */unitFactory('protonMass', '1.67262192369e-27', 'kg');\nexports.createProtonMass = createProtonMass;\nvar createDeuteronMass = /* #__PURE__ */unitFactory('deuteronMass', '3.3435830926e-27', 'kg');\nexports.createDeuteronMass = createDeuteronMass;\nvar createNeutronMass = /* #__PURE__ */unitFactory('neutronMass', '1.6749271613e-27', 'kg');\nexports.createNeutronMass = createNeutronMass;\nvar createQuantumOfCirculation = /* #__PURE__ */unitFactory('quantumOfCirculation', '3.6369475516e-4', 'm^2 s^-1');\nexports.createQuantumOfCirculation = createQuantumOfCirculation;\nvar createRydberg = /* #__PURE__ */unitFactory('rydberg', '10973731.568160', 'm^-1');\nexports.createRydberg = createRydberg;\nvar createThomsonCrossSection = /* #__PURE__ */unitFactory('thomsonCrossSection', '6.6524587321e-29', 'm^2');\nexports.createThomsonCrossSection = createThomsonCrossSection;\nvar createWeakMixingAngle = numberFactory('weakMixingAngle', 0.22290);\nexports.createWeakMixingAngle = createWeakMixingAngle;\nvar createEfimovFactor = numberFactory('efimovFactor', 22.7);\n\n// Physico-chemical constants\nexports.createEfimovFactor = createEfimovFactor;\nvar createAtomicMass = /* #__PURE__ */unitFactory('atomicMass', '1.66053906660e-27', 'kg');\nexports.createAtomicMass = createAtomicMass;\nvar createAvogadro = /* #__PURE__ */unitFactory('avogadro', '6.02214076e23', 'mol^-1');\nexports.createAvogadro = createAvogadro;\nvar createBoltzmann = /* #__PURE__ */unitFactory('boltzmann', '1.380649e-23', 'J K^-1');\nexports.createBoltzmann = createBoltzmann;\nvar createFaraday = /* #__PURE__ */unitFactory('faraday', '96485.33212331001', 'C mol^-1');\nexports.createFaraday = createFaraday;\nvar createFirstRadiation = /* #__PURE__ */unitFactory('firstRadiation', '3.7417718521927573e-16', 'W m^2');\n// export const createSpectralRadiance = /* #__PURE__ */ unitFactory('spectralRadiance', '1.1910429723971881e-16', 'W m^2 sr^-1') // TODO spectralRadiance\nexports.createFirstRadiation = createFirstRadiation;\nvar createLoschmidt = /* #__PURE__ */unitFactory('loschmidt', '2.686780111798444e25', 'm^-3');\nexports.createLoschmidt = createLoschmidt;\nvar createGasConstant = /* #__PURE__ */unitFactory('gasConstant', '8.31446261815324', 'J K^-1 mol^-1');\nexports.createGasConstant = createGasConstant;\nvar createMolarPlanckConstant = /* #__PURE__ */unitFactory('molarPlanckConstant', '3.990312712893431e-10', 'J s mol^-1');\nexports.createMolarPlanckConstant = createMolarPlanckConstant;\nvar createMolarVolume = /* #__PURE__ */unitFactory('molarVolume', '0.022413969545014137', 'm^3 mol^-1');\nexports.createMolarVolume = createMolarVolume;\nvar createSackurTetrode = numberFactory('sackurTetrode', -1.16487052358);\nexports.createSackurTetrode = createSackurTetrode;\nvar createSecondRadiation = /* #__PURE__ */unitFactory('secondRadiation', '0.014387768775039337', 'm K');\nexports.createSecondRadiation = createSecondRadiation;\nvar createStefanBoltzmann = /* #__PURE__ */unitFactory('stefanBoltzmann', '5.67037441918443e-8', 'W m^-2 K^-4');\nexports.createStefanBoltzmann = createStefanBoltzmann;\nvar createWienDisplacement = /* #__PURE__ */unitFactory('wienDisplacement', '2.897771955e-3', 'm K');\n\n// Adopted values\nexports.createWienDisplacement = createWienDisplacement;\nvar createMolarMass = /* #__PURE__ */unitFactory('molarMass', '0.99999999965e-3', 'kg mol^-1');\nexports.createMolarMass = createMolarMass;\nvar createMolarMassC12 = /* #__PURE__ */unitFactory('molarMassC12', '11.9999999958e-3', 'kg mol^-1');\nexports.createMolarMassC12 = createMolarMassC12;\nvar createGravity = /* #__PURE__ */unitFactory('gravity', '9.80665', 'm s^-2');\n// atm is defined in Unit.js\n\n// Natural units\nexports.createGravity = createGravity;\nvar createPlanckLength = /* #__PURE__ */unitFactory('planckLength', '1.616255e-35', 'm');\nexports.createPlanckLength = createPlanckLength;\nvar createPlanckMass = /* #__PURE__ */unitFactory('planckMass', '2.176435e-8', 'kg');\nexports.createPlanckMass = createPlanckMass;\nvar createPlanckTime = /* #__PURE__ */unitFactory('planckTime', '5.391245e-44', 's');\nexports.createPlanckTime = createPlanckTime;\nvar createPlanckCharge = /* #__PURE__ */unitFactory('planckCharge', '1.87554603778e-18', 'C');\nexports.createPlanckCharge = createPlanckCharge;\nvar createPlanckTemperature = /* #__PURE__ */unitFactory('planckTemperature', '1.416785e+32', 'K');\n\n// helper function to create a factory function which creates a physical constant,\n// a Unit with either a number value or a BigNumber value depending on the configuration\nexports.createPlanckTemperature = createPlanckTemperature;\nfunction unitFactory(name, valueStr, unitStr) {\n  var dependencies = ['config', 'Unit', 'BigNumber'];\n  return (0, _factory.factory)(name, dependencies, function (_ref) {\n    var config = _ref.config,\n      Unit = _ref.Unit,\n      BigNumber = _ref.BigNumber;\n    // Note that we can parse into number or BigNumber.\n    // We do not parse into Fractions as that doesn't make sense: we would lose precision of the values\n    // Therefore we dont use Unit.parse()\n    var value = config.number === 'BigNumber' ? new BigNumber(valueStr) : parseFloat(valueStr);\n    var unit = new Unit(value, unitStr);\n    unit.fixPrefix = true;\n    return unit;\n  });\n}\n\n// helper function to create a factory function which creates a numeric constant,\n// either a number or BigNumber depending on the configuration\nfunction numberFactory(name, value) {\n  var dependencies = ['config', 'BigNumber'];\n  return (0, _factory.factory)(name, dependencies, function (_ref2) {\n    var config = _ref2.config,\n      BigNumber = _ref2.BigNumber;\n    return config.number === 'BigNumber' ? new BigNumber(value) : value;\n  });\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createApplyTransform = void 0;\nvar _errorTransform = require(\"./utils/errorTransform.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _apply = require(\"../../function/matrix/apply.js\");\nvar _is = require(\"../../utils/is.js\");\nvar name = 'apply';\nvar dependencies = ['typed', 'isInteger'];\n\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 */\nvar createApplyTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    isInteger = _ref.isInteger;\n  var apply = (0, _apply.createApply)({\n    typed: typed,\n    isInteger: isInteger\n  });\n\n  // @see: comment of concat itself\n  return typed('apply', {\n    '...any': function any(args) {\n      // change dim from one-based to zero-based\n      var dim = args[1];\n      if ((0, _is.isNumber)(dim)) {\n        args[1] = dim - 1;\n      } else if ((0, _is.isBigNumber)(dim)) {\n        args[1] = dim.minus(1);\n      }\n      try {\n        return apply.apply(null, args);\n      } catch (err) {\n        throw (0, _errorTransform.errorTransform)(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});\nexports.createApplyTransform = createApplyTransform;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createColumnTransform = void 0;\nvar _errorTransform = require(\"./utils/errorTransform.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _column = require(\"../../function/matrix/column.js\");\nvar _is = require(\"../../utils/is.js\");\nvar name = 'column';\nvar dependencies = ['typed', 'Index', 'matrix', 'range'];\n\n/**\n * Attach a transform function to matrix.column\n * Adds a property transform containing the transform function.\n *\n * This transform changed the last `index` parameter of function column\n * from zero-based to one-based\n */\nvar createColumnTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    Index = _ref.Index,\n    matrix = _ref.matrix,\n    range = _ref.range;\n  var column = (0, _column.createColumn)({\n    typed: typed,\n    Index: Index,\n    matrix: matrix,\n    range: range\n  });\n\n  // @see: comment of column itself\n  return typed('column', {\n    '...any': function any(args) {\n      // change last argument from zero-based to one-based\n      var lastIndex = args.length - 1;\n      var last = args[lastIndex];\n      if ((0, _is.isNumber)(last)) {\n        args[lastIndex] = last - 1;\n      }\n      try {\n        return column.apply(null, args);\n      } catch (err) {\n        throw (0, _errorTransform.errorTransform)(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});\nexports.createColumnTransform = createColumnTransform;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.compileInlineExpression = compileInlineExpression;\nvar _is = require(\"../../../utils/is.js\");\nvar _scope = require(\"../../../utils/scope.js\");\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 */\nfunction compileInlineExpression(expression, math, scope) {\n  // find an undefined symbol\n  var symbol = expression.filter(function (node) {\n    return (0, _is.isSymbolNode)(node) && !(node.name in math) && !scope.has(node.name);\n  })[0];\n  if (!symbol) {\n    throw new Error('No undefined variable found in inline expression \"' + expression + '\"');\n  }\n\n  // create a test function for this equation\n  var name = symbol.name; // variable name\n  var subScope = (0, _scope.createSubScope)(scope);\n  var eq = expression.compile();\n  return function inlineExpression(x) {\n    subScope.set(name, x);\n    return eq.evaluate(subScope);\n  };\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createFilterTransform = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _function = require(\"../../utils/function.js\");\nvar _compileInlineExpression = require(\"./utils/compileInlineExpression.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'filter';\nvar dependencies = ['typed'];\nvar createFilterTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\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  function filterTransform(args, math, scope) {\n    var x, callback;\n    if (args[0]) {\n      x = args[0].compile().evaluate(scope);\n    }\n    if (args[1]) {\n      if ((0, _is.isSymbolNode)(args[1]) || (0, _is.isFunctionAssignmentNode)(args[1])) {\n        // a function pointer, like filter([3, -2, 5], myTestFunction)\n        callback = args[1].compile().evaluate(scope);\n      } else {\n        // an expression like filter([3, -2, 5], x > 0)\n        callback = (0, _compileInlineExpression.compileInlineExpression)(args[1], math, scope);\n      }\n    }\n    return filter(x, callback);\n  }\n  filterTransform.rawArgs = true;\n\n  // one based version of function filter\n  var filter = typed('filter', {\n    'Array, function': _filter,\n    'Matrix, function': function MatrixFunction(x, test) {\n      return x.create(_filter(x.toArray(), test));\n    },\n    'Array, RegExp': _array.filterRegExp,\n    'Matrix, RegExp': function MatrixRegExp(x, test) {\n      return x.create((0, _array.filterRegExp)(x.toArray(), test));\n    }\n  });\n  return filterTransform;\n}, {\n  isTransformFunction: true\n});\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 */\nexports.createFilterTransform = createFilterTransform;\nfunction _filter(x, callback) {\n  // figure out what number of arguments the callback function expects\n  var args = (0, _function.maxArgumentCount)(callback);\n  return (0, _array.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}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createForEachTransform = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _function = require(\"../../utils/function.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _compileInlineExpression = require(\"./utils/compileInlineExpression.js\");\nvar name = 'forEach';\nvar dependencies = ['typed'];\nvar createForEachTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\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  function forEachTransform(args, math, scope) {\n    var x, callback;\n    if (args[0]) {\n      x = args[0].compile().evaluate(scope);\n    }\n    if (args[1]) {\n      if ((0, _is.isSymbolNode)(args[1]) || (0, _is.isFunctionAssignmentNode)(args[1])) {\n        // a function pointer, like forEach([3, -2, 5], myTestFunction)\n        callback = args[1].compile().evaluate(scope);\n      } else {\n        // an expression like forEach([3, -2, 5], x > 0 ? callback1(x) : callback2(x) )\n        callback = (0, _compileInlineExpression.compileInlineExpression)(args[1], math, scope);\n      }\n    }\n    return _forEach(x, callback);\n  }\n  forEachTransform.rawArgs = true;\n\n  // one-based version of forEach\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 = (0, _function.maxArgumentCount)(callback);\n      var recurse = function recurse(value, index) {\n        if (Array.isArray(value)) {\n          (0, _array.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      recurse(array.valueOf(), []); // pass Array\n    }\n  });\n\n  return forEachTransform;\n}, {\n  isTransformFunction: true\n});\nexports.createForEachTransform = createForEachTransform;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createIndexTransform = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar name = 'index';\nvar dependencies = ['Index'];\nvar createIndexTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var Index = _ref.Index;\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  return function indexTransform() {\n    var args = [];\n    for (var i = 0, ii = arguments.length; i < ii; i++) {\n      var arg = arguments[i];\n\n      // change from one-based to zero based, and convert BigNumber to number\n      if ((0, _is.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 ((0, _is.isArray)(arg) || (0, _is.isMatrix)(arg)) {\n        arg = arg.map(function (v) {\n          return v - 1;\n        });\n      } else if ((0, _is.isNumber)(arg)) {\n        arg--;\n      } else if ((0, _is.isBigNumber)(arg)) {\n        arg = arg.toNumber() - 1;\n      } else if (typeof arg === 'string') {\n        // leave as is\n      } else {\n        throw new TypeError('Dimension must be an Array, Matrix, number, string, or Range');\n      }\n      args[i] = arg;\n    }\n    var res = new Index();\n    Index.apply(res, args);\n    return res;\n  };\n}, {\n  isTransformFunction: true\n});\nexports.createIndexTransform = createIndexTransform;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMapTransform = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _function = require(\"../../utils/function.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _compileInlineExpression = require(\"./utils/compileInlineExpression.js\");\nvar name = 'map';\nvar dependencies = ['typed'];\nvar createMapTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed;\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  function mapTransform(args, math, scope) {\n    var x, callback;\n    if (args[0]) {\n      x = args[0].compile().evaluate(scope);\n    }\n    if (args[1]) {\n      if ((0, _is.isSymbolNode)(args[1]) || (0, _is.isFunctionAssignmentNode)(args[1])) {\n        // a function pointer, like filter([3, -2, 5], myTestFunction)\n        callback = args[1].compile().evaluate(scope);\n      } else {\n        // an expression like filter([3, -2, 5], x > 0)\n        callback = (0, _compileInlineExpression.compileInlineExpression)(args[1], math, scope);\n      }\n    }\n    return map(x, callback);\n  }\n  mapTransform.rawArgs = true;\n\n  // one-based version of map function\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 x.create(_map(x.valueOf(), callback, x));\n    }\n  });\n  return mapTransform;\n}, {\n  isTransformFunction: true\n});\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 */\nexports.createMapTransform = createMapTransform;\nfunction _map(array, callback, orig) {\n  // figure out what number of arguments the callback function expects\n  var argsCount = (0, _function.maxArgumentCount)(callback);\n  function recurse(value, index) {\n    if (Array.isArray(value)) {\n      return (0, _array.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  return recurse(array, []);\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.lastDimToZeroBase = lastDimToZeroBase;\nvar _is = require(\"../../../utils/is.js\");\n/**\n * Change last argument dim from one-based to zero-based.\n */\nfunction lastDimToZeroBase(args) {\n  if (args.length === 2 && (0, _is.isCollection)(args[0])) {\n    args = args.slice();\n    var dim = args[1];\n    if ((0, _is.isNumber)(dim)) {\n      args[1] = dim - 1;\n    } else if ((0, _is.isBigNumber)(dim)) {\n      args[1] = dim.minus(1);\n    }\n  }\n  return args;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMaxTransform = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _errorTransform = require(\"./utils/errorTransform.js\");\nvar _max = require(\"../../function/statistics/max.js\");\nvar _lastDimToZeroBase = require(\"./utils/lastDimToZeroBase.js\");\nvar name = 'max';\nvar dependencies = ['typed', 'config', 'numeric', 'larger'];\nvar createMaxTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    numeric = _ref.numeric,\n    larger = _ref.larger;\n  var max = (0, _max.createMax)({\n    typed: typed,\n    config: config,\n    numeric: numeric,\n    larger: larger\n  });\n\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  return typed('max', {\n    '...any': function any(args) {\n      args = (0, _lastDimToZeroBase.lastDimToZeroBase)(args);\n      try {\n        return max.apply(null, args);\n      } catch (err) {\n        throw (0, _errorTransform.errorTransform)(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});\nexports.createMaxTransform = createMaxTransform;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMeanTransform = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _errorTransform = require(\"./utils/errorTransform.js\");\nvar _mean = require(\"../../function/statistics/mean.js\");\nvar _lastDimToZeroBase = require(\"./utils/lastDimToZeroBase.js\");\nvar name = 'mean';\nvar dependencies = ['typed', 'add', 'divide'];\nvar createMeanTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    add = _ref.add,\n    divide = _ref.divide;\n  var mean = (0, _mean.createMean)({\n    typed: typed,\n    add: add,\n    divide: divide\n  });\n\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  return typed('mean', {\n    '...any': function any(args) {\n      args = (0, _lastDimToZeroBase.lastDimToZeroBase)(args);\n      try {\n        return mean.apply(null, args);\n      } catch (err) {\n        throw (0, _errorTransform.errorTransform)(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});\nexports.createMeanTransform = createMeanTransform;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createMinTransform = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _errorTransform = require(\"./utils/errorTransform.js\");\nvar _min = require(\"../../function/statistics/min.js\");\nvar _lastDimToZeroBase = require(\"./utils/lastDimToZeroBase.js\");\nvar name = 'min';\nvar dependencies = ['typed', 'config', 'numeric', 'smaller'];\nvar createMinTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    numeric = _ref.numeric,\n    smaller = _ref.smaller;\n  var min = (0, _min.createMin)({\n    typed: typed,\n    config: config,\n    numeric: numeric,\n    smaller: smaller\n  });\n\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  return typed('min', {\n    '...any': function any(args) {\n      args = (0, _lastDimToZeroBase.lastDimToZeroBase)(args);\n      try {\n        return min.apply(null, args);\n      } catch (err) {\n        throw (0, _errorTransform.errorTransform)(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});\nexports.createMinTransform = createMinTransform;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createRangeTransform = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _range = require(\"../../function/matrix/range.js\");\nvar name = 'range';\nvar dependencies = ['typed', 'config', '?matrix', '?bignumber', 'smaller', 'smallerEq', 'larger', 'largerEq'];\nvar createRangeTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    matrix = _ref.matrix,\n    bignumber = _ref.bignumber,\n    smaller = _ref.smaller,\n    smallerEq = _ref.smallerEq,\n    larger = _ref.larger,\n    largerEq = _ref.largerEq;\n  var range = (0, _range.createRange)({\n    typed: typed,\n    config: config,\n    matrix: matrix,\n    bignumber: bignumber,\n    smaller: smaller,\n    smallerEq: smallerEq,\n    larger: larger,\n    largerEq: largerEq\n  });\n\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  return typed('range', {\n    '...any': function any(args) {\n      var lastIndex = args.length - 1;\n      var last = args[lastIndex];\n      if (typeof last !== 'boolean') {\n        // append a parameter includeEnd=true\n        args.push(true);\n      }\n      return range.apply(null, args);\n    }\n  });\n}, {\n  isTransformFunction: true\n});\nexports.createRangeTransform = createRangeTransform;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createRowTransform = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _row = require(\"../../function/matrix/row.js\");\nvar _errorTransform = require(\"./utils/errorTransform.js\");\nvar _is = require(\"../../utils/is.js\");\nvar name = 'row';\nvar dependencies = ['typed', 'Index', 'matrix', 'range'];\n\n/**\n * Attach a transform function to matrix.column\n * Adds a property transform containing the transform function.\n *\n * This transform changed the last `index` parameter of function column\n * from zero-based to one-based\n */\nvar createRowTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    Index = _ref.Index,\n    matrix = _ref.matrix,\n    range = _ref.range;\n  var row = (0, _row.createRow)({\n    typed: typed,\n    Index: Index,\n    matrix: matrix,\n    range: range\n  });\n\n  // @see: comment of row itself\n  return typed('row', {\n    '...any': function any(args) {\n      // change last argument from zero-based to one-based\n      var lastIndex = args.length - 1;\n      var last = args[lastIndex];\n      if ((0, _is.isNumber)(last)) {\n        args[lastIndex] = last - 1;\n      }\n      try {\n        return row.apply(null, args);\n      } catch (err) {\n        throw (0, _errorTransform.errorTransform)(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});\nexports.createRowTransform = createRowTransform;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSubsetTransform = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _errorTransform = require(\"./utils/errorTransform.js\");\nvar _subset = require(\"../../function/matrix/subset.js\");\nvar name = 'subset';\nvar dependencies = ['typed', 'matrix'];\nvar createSubsetTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix;\n  var subset = (0, _subset.createSubset)({\n    typed: typed,\n    matrix: matrix\n  });\n\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  return typed('subset', {\n    '...any': function any(args) {\n      try {\n        return subset.apply(null, args);\n      } catch (err) {\n        throw (0, _errorTransform.errorTransform)(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});\nexports.createSubsetTransform = createSubsetTransform;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createConcatTransform = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _errorTransform = require(\"./utils/errorTransform.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _concat = require(\"../../function/matrix/concat.js\");\nvar name = 'concat';\nvar dependencies = ['typed', 'matrix', 'isInteger'];\nvar createConcatTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    isInteger = _ref.isInteger;\n  var concat = (0, _concat.createConcat)({\n    typed: typed,\n    matrix: matrix,\n    isInteger: isInteger\n  });\n\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  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      if ((0, _is.isNumber)(last)) {\n        args[lastIndex] = last - 1;\n      } else if ((0, _is.isBigNumber)(last)) {\n        args[lastIndex] = last.minus(1);\n      }\n      try {\n        return concat.apply(null, args);\n      } catch (err) {\n        throw (0, _errorTransform.errorTransform)(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});\nexports.createConcatTransform = createConcatTransform;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createDiffTransform = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _errorTransform = require(\"./utils/errorTransform.js\");\nvar _diff = require(\"../../function/matrix/diff.js\");\nvar _lastDimToZeroBase = require(\"./utils/lastDimToZeroBase.js\");\nvar name = 'diff';\nvar dependencies = ['typed', 'matrix', 'subtract', 'number', 'bignumber'];\nvar createDiffTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    matrix = _ref.matrix,\n    subtract = _ref.subtract,\n    number = _ref.number,\n    bignumber = _ref.bignumber;\n  var diff = (0, _diff.createDiff)({\n    typed: typed,\n    matrix: matrix,\n    subtract: subtract,\n    number: number,\n    bignumber: bignumber\n  });\n\n  /**\n   * Attach a transform function to math.diff\n   * Adds a property transform containing the transform function.\n   *\n   * This transform creates a range which includes the end value\n   */\n  return typed(name, {\n    '...any': function any(args) {\n      args = (0, _lastDimToZeroBase.lastDimToZeroBase)(args);\n      try {\n        return diff.apply(null, args);\n      } catch (err) {\n        throw (0, _errorTransform.errorTransform)(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});\nexports.createDiffTransform = createDiffTransform;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createStdTransform = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _std = require(\"../../function/statistics/std.js\");\nvar _errorTransform = require(\"./utils/errorTransform.js\");\nvar _lastDimToZeroBase = require(\"./utils/lastDimToZeroBase.js\");\nvar name = 'std';\nvar dependencies = ['typed', 'map', 'sqrt', 'variance'];\n\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 */\nvar createStdTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    map = _ref.map,\n    sqrt = _ref.sqrt,\n    variance = _ref.variance;\n  var std = (0, _std.createStd)({\n    typed: typed,\n    map: map,\n    sqrt: sqrt,\n    variance: variance\n  });\n  return typed('std', {\n    '...any': function any(args) {\n      args = (0, _lastDimToZeroBase.lastDimToZeroBase)(args);\n      try {\n        return std.apply(null, args);\n      } catch (err) {\n        throw (0, _errorTransform.errorTransform)(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});\nexports.createStdTransform = createStdTransform;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createSumTransform = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _errorTransform = require(\"./utils/errorTransform.js\");\nvar _sum = require(\"../../function/statistics/sum.js\");\nvar _lastDimToZeroBase = require(\"./utils/lastDimToZeroBase.js\");\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 sum\n * from one-based to zero based\n */\nvar name = 'sum';\nvar dependencies = ['typed', 'config', 'add', 'numeric'];\nvar createSumTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    config = _ref.config,\n    add = _ref.add,\n    numeric = _ref.numeric;\n  var sum = (0, _sum.createSum)({\n    typed: typed,\n    config: config,\n    add: add,\n    numeric: numeric\n  });\n  return typed(name, {\n    '...any': function any(args) {\n      args = (0, _lastDimToZeroBase.lastDimToZeroBase)(args);\n      try {\n        return sum.apply(null, args);\n      } catch (err) {\n        throw (0, _errorTransform.errorTransform)(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});\nexports.createSumTransform = createSumTransform;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createCumSumTransform = void 0;\nvar _is = require(\"../../utils/is.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _errorTransform = require(\"./utils/errorTransform.js\");\nvar _cumsum = require(\"../../function/statistics/cumsum.js\");\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 sum\n * from one-based to zero based\n */\nvar name = 'cumsum';\nvar dependencies = ['typed', 'add', 'unaryPlus'];\nvar createCumSumTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    add = _ref.add,\n    unaryPlus = _ref.unaryPlus;\n  var cumsum = (0, _cumsum.createCumSum)({\n    typed: typed,\n    add: add,\n    unaryPlus: unaryPlus\n  });\n  return typed(name, {\n    '...any': function any(args) {\n      // change last argument dim from one-based to zero-based\n      if (args.length === 2 && (0, _is.isCollection)(args[0])) {\n        var dim = args[1];\n        if ((0, _is.isNumber)(dim)) {\n          args[1] = dim - 1;\n        } else if ((0, _is.isBigNumber)(dim)) {\n          args[1] = dim.minus(1);\n        }\n      }\n      try {\n        return cumsum.apply(null, args);\n      } catch (err) {\n        throw (0, _errorTransform.errorTransform)(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});\nexports.createCumSumTransform = createCumSumTransform;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createVarianceTransform = void 0;\nvar _factory = require(\"../../utils/factory.js\");\nvar _errorTransform = require(\"./utils/errorTransform.js\");\nvar _variance = require(\"../../function/statistics/variance.js\");\nvar _lastDimToZeroBase = require(\"./utils/lastDimToZeroBase.js\");\nvar name = 'variance';\nvar dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'apply', 'isNaN'];\n\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 */\nvar createVarianceTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {\n  var typed = _ref.typed,\n    add = _ref.add,\n    subtract = _ref.subtract,\n    multiply = _ref.multiply,\n    divide = _ref.divide,\n    apply = _ref.apply,\n    isNaN = _ref.isNaN;\n  var variance = (0, _variance.createVariance)({\n    typed: typed,\n    add: add,\n    subtract: subtract,\n    multiply: multiply,\n    divide: divide,\n    apply: apply,\n    isNaN: isNaN\n  });\n  return typed(name, {\n    '...any': function any(args) {\n      args = (0, _lastDimToZeroBase.lastDimToZeroBase)(args);\n      try {\n        return variance.apply(null, args);\n      } catch (err) {\n        throw (0, _errorTransform.errorTransform)(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});\nexports.createVarianceTransform = createVarianceTransform;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nObject.defineProperty(exports, \"createAbs\", {\n  enumerable: true,\n  get: function get() {\n    return _abs.createAbs;\n  }\n});\nObject.defineProperty(exports, \"createAccessorNode\", {\n  enumerable: true,\n  get: function get() {\n    return _AccessorNode.createAccessorNode;\n  }\n});\nObject.defineProperty(exports, \"createAcos\", {\n  enumerable: true,\n  get: function get() {\n    return _acos.createAcos;\n  }\n});\nObject.defineProperty(exports, \"createAcosh\", {\n  enumerable: true,\n  get: function get() {\n    return _acosh.createAcosh;\n  }\n});\nObject.defineProperty(exports, \"createAcot\", {\n  enumerable: true,\n  get: function get() {\n    return _acot.createAcot;\n  }\n});\nObject.defineProperty(exports, \"createAcoth\", {\n  enumerable: true,\n  get: function get() {\n    return _acoth.createAcoth;\n  }\n});\nObject.defineProperty(exports, \"createAcsc\", {\n  enumerable: true,\n  get: function get() {\n    return _acsc.createAcsc;\n  }\n});\nObject.defineProperty(exports, \"createAcsch\", {\n  enumerable: true,\n  get: function get() {\n    return _acsch.createAcsch;\n  }\n});\nObject.defineProperty(exports, \"createAdd\", {\n  enumerable: true,\n  get: function get() {\n    return _add.createAdd;\n  }\n});\nObject.defineProperty(exports, \"createAddScalar\", {\n  enumerable: true,\n  get: function get() {\n    return _addScalar.createAddScalar;\n  }\n});\nObject.defineProperty(exports, \"createAnd\", {\n  enumerable: true,\n  get: function get() {\n    return _and.createAnd;\n  }\n});\nObject.defineProperty(exports, \"createApply\", {\n  enumerable: true,\n  get: function get() {\n    return _apply.createApply;\n  }\n});\nObject.defineProperty(exports, \"createApplyTransform\", {\n  enumerable: true,\n  get: function get() {\n    return _applyTransform.createApplyTransform;\n  }\n});\nObject.defineProperty(exports, \"createArg\", {\n  enumerable: true,\n  get: function get() {\n    return _arg.createArg;\n  }\n});\nObject.defineProperty(exports, \"createArrayNode\", {\n  enumerable: true,\n  get: function get() {\n    return _ArrayNode.createArrayNode;\n  }\n});\nObject.defineProperty(exports, \"createAsec\", {\n  enumerable: true,\n  get: function get() {\n    return _asec.createAsec;\n  }\n});\nObject.defineProperty(exports, \"createAsech\", {\n  enumerable: true,\n  get: function get() {\n    return _asech.createAsech;\n  }\n});\nObject.defineProperty(exports, \"createAsin\", {\n  enumerable: true,\n  get: function get() {\n    return _asin.createAsin;\n  }\n});\nObject.defineProperty(exports, \"createAsinh\", {\n  enumerable: true,\n  get: function get() {\n    return _asinh.createAsinh;\n  }\n});\nObject.defineProperty(exports, \"createAssignmentNode\", {\n  enumerable: true,\n  get: function get() {\n    return _AssignmentNode.createAssignmentNode;\n  }\n});\nObject.defineProperty(exports, \"createAtan\", {\n  enumerable: true,\n  get: function get() {\n    return _atan.createAtan;\n  }\n});\nObject.defineProperty(exports, \"createAtan2\", {\n  enumerable: true,\n  get: function get() {\n    return _atan2.createAtan2;\n  }\n});\nObject.defineProperty(exports, \"createAtanh\", {\n  enumerable: true,\n  get: function get() {\n    return _atanh.createAtanh;\n  }\n});\nObject.defineProperty(exports, \"createAtomicMass\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createAtomicMass;\n  }\n});\nObject.defineProperty(exports, \"createAvogadro\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createAvogadro;\n  }\n});\nObject.defineProperty(exports, \"createBellNumbers\", {\n  enumerable: true,\n  get: function get() {\n    return _bellNumbers.createBellNumbers;\n  }\n});\nObject.defineProperty(exports, \"createBigNumberClass\", {\n  enumerable: true,\n  get: function get() {\n    return _BigNumber.createBigNumberClass;\n  }\n});\nObject.defineProperty(exports, \"createBignumber\", {\n  enumerable: true,\n  get: function get() {\n    return _bignumber.createBignumber;\n  }\n});\nObject.defineProperty(exports, \"createBin\", {\n  enumerable: true,\n  get: function get() {\n    return _bin.createBin;\n  }\n});\nObject.defineProperty(exports, \"createBitAnd\", {\n  enumerable: true,\n  get: function get() {\n    return _bitAnd.createBitAnd;\n  }\n});\nObject.defineProperty(exports, \"createBitNot\", {\n  enumerable: true,\n  get: function get() {\n    return _bitNot.createBitNot;\n  }\n});\nObject.defineProperty(exports, \"createBitOr\", {\n  enumerable: true,\n  get: function get() {\n    return _bitOr.createBitOr;\n  }\n});\nObject.defineProperty(exports, \"createBitXor\", {\n  enumerable: true,\n  get: function get() {\n    return _bitXor.createBitXor;\n  }\n});\nObject.defineProperty(exports, \"createBlockNode\", {\n  enumerable: true,\n  get: function get() {\n    return _BlockNode.createBlockNode;\n  }\n});\nObject.defineProperty(exports, \"createBohrMagneton\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createBohrMagneton;\n  }\n});\nObject.defineProperty(exports, \"createBohrRadius\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createBohrRadius;\n  }\n});\nObject.defineProperty(exports, \"createBoltzmann\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createBoltzmann;\n  }\n});\nObject.defineProperty(exports, \"createBoolean\", {\n  enumerable: true,\n  get: function get() {\n    return _boolean.createBoolean;\n  }\n});\nObject.defineProperty(exports, \"createCatalan\", {\n  enumerable: true,\n  get: function get() {\n    return _catalan.createCatalan;\n  }\n});\nObject.defineProperty(exports, \"createCbrt\", {\n  enumerable: true,\n  get: function get() {\n    return _cbrt.createCbrt;\n  }\n});\nObject.defineProperty(exports, \"createCeil\", {\n  enumerable: true,\n  get: function get() {\n    return _ceil.createCeil;\n  }\n});\nObject.defineProperty(exports, \"createChain\", {\n  enumerable: true,\n  get: function get() {\n    return _chain.createChain;\n  }\n});\nObject.defineProperty(exports, \"createChainClass\", {\n  enumerable: true,\n  get: function get() {\n    return _Chain.createChainClass;\n  }\n});\nObject.defineProperty(exports, \"createClassicalElectronRadius\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createClassicalElectronRadius;\n  }\n});\nObject.defineProperty(exports, \"createClone\", {\n  enumerable: true,\n  get: function get() {\n    return _clone.createClone;\n  }\n});\nObject.defineProperty(exports, \"createColumn\", {\n  enumerable: true,\n  get: function get() {\n    return _column.createColumn;\n  }\n});\nObject.defineProperty(exports, \"createColumnTransform\", {\n  enumerable: true,\n  get: function get() {\n    return _columnTransform.createColumnTransform;\n  }\n});\nObject.defineProperty(exports, \"createCombinations\", {\n  enumerable: true,\n  get: function get() {\n    return _combinations.createCombinations;\n  }\n});\nObject.defineProperty(exports, \"createCombinationsWithRep\", {\n  enumerable: true,\n  get: function get() {\n    return _combinationsWithRep.createCombinationsWithRep;\n  }\n});\nObject.defineProperty(exports, \"createCompare\", {\n  enumerable: true,\n  get: function get() {\n    return _compare.createCompare;\n  }\n});\nObject.defineProperty(exports, \"createCompareNatural\", {\n  enumerable: true,\n  get: function get() {\n    return _compareNatural.createCompareNatural;\n  }\n});\nObject.defineProperty(exports, \"createCompareText\", {\n  enumerable: true,\n  get: function get() {\n    return _compareText.createCompareText;\n  }\n});\nObject.defineProperty(exports, \"createCompile\", {\n  enumerable: true,\n  get: function get() {\n    return _compile.createCompile;\n  }\n});\nObject.defineProperty(exports, \"createComplex\", {\n  enumerable: true,\n  get: function get() {\n    return _complex.createComplex;\n  }\n});\nObject.defineProperty(exports, \"createComplexClass\", {\n  enumerable: true,\n  get: function get() {\n    return _Complex.createComplexClass;\n  }\n});\nObject.defineProperty(exports, \"createComposition\", {\n  enumerable: true,\n  get: function get() {\n    return _composition.createComposition;\n  }\n});\nObject.defineProperty(exports, \"createConcat\", {\n  enumerable: true,\n  get: function get() {\n    return _concat.createConcat;\n  }\n});\nObject.defineProperty(exports, \"createConcatTransform\", {\n  enumerable: true,\n  get: function get() {\n    return _concatTransform.createConcatTransform;\n  }\n});\nObject.defineProperty(exports, \"createConditionalNode\", {\n  enumerable: true,\n  get: function get() {\n    return _ConditionalNode.createConditionalNode;\n  }\n});\nObject.defineProperty(exports, \"createConductanceQuantum\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createConductanceQuantum;\n  }\n});\nObject.defineProperty(exports, \"createConj\", {\n  enumerable: true,\n  get: function get() {\n    return _conj.createConj;\n  }\n});\nObject.defineProperty(exports, \"createConstantNode\", {\n  enumerable: true,\n  get: function get() {\n    return _ConstantNode.createConstantNode;\n  }\n});\nObject.defineProperty(exports, \"createCos\", {\n  enumerable: true,\n  get: function get() {\n    return _cos.createCos;\n  }\n});\nObject.defineProperty(exports, \"createCosh\", {\n  enumerable: true,\n  get: function get() {\n    return _cosh.createCosh;\n  }\n});\nObject.defineProperty(exports, \"createCot\", {\n  enumerable: true,\n  get: function get() {\n    return _cot.createCot;\n  }\n});\nObject.defineProperty(exports, \"createCoth\", {\n  enumerable: true,\n  get: function get() {\n    return _coth.createCoth;\n  }\n});\nObject.defineProperty(exports, \"createCoulomb\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createCoulomb;\n  }\n});\nObject.defineProperty(exports, \"createCount\", {\n  enumerable: true,\n  get: function get() {\n    return _count.createCount;\n  }\n});\nObject.defineProperty(exports, \"createCreateUnit\", {\n  enumerable: true,\n  get: function get() {\n    return _createUnit.createCreateUnit;\n  }\n});\nObject.defineProperty(exports, \"createCross\", {\n  enumerable: true,\n  get: function get() {\n    return _cross.createCross;\n  }\n});\nObject.defineProperty(exports, \"createCsc\", {\n  enumerable: true,\n  get: function get() {\n    return _csc.createCsc;\n  }\n});\nObject.defineProperty(exports, \"createCsch\", {\n  enumerable: true,\n  get: function get() {\n    return _csch.createCsch;\n  }\n});\nObject.defineProperty(exports, \"createCtranspose\", {\n  enumerable: true,\n  get: function get() {\n    return _ctranspose.createCtranspose;\n  }\n});\nObject.defineProperty(exports, \"createCube\", {\n  enumerable: true,\n  get: function get() {\n    return _cube.createCube;\n  }\n});\nObject.defineProperty(exports, \"createCumSum\", {\n  enumerable: true,\n  get: function get() {\n    return _cumsum.createCumSum;\n  }\n});\nObject.defineProperty(exports, \"createCumSumTransform\", {\n  enumerable: true,\n  get: function get() {\n    return _cumsumTransform.createCumSumTransform;\n  }\n});\nObject.defineProperty(exports, \"createDeepEqual\", {\n  enumerable: true,\n  get: function get() {\n    return _deepEqual.createDeepEqual;\n  }\n});\nObject.defineProperty(exports, \"createDenseMatrixClass\", {\n  enumerable: true,\n  get: function get() {\n    return _DenseMatrix.createDenseMatrixClass;\n  }\n});\nObject.defineProperty(exports, \"createDerivative\", {\n  enumerable: true,\n  get: function get() {\n    return _derivative.createDerivative;\n  }\n});\nObject.defineProperty(exports, \"createDet\", {\n  enumerable: true,\n  get: function get() {\n    return _det.createDet;\n  }\n});\nObject.defineProperty(exports, \"createDeuteronMass\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createDeuteronMass;\n  }\n});\nObject.defineProperty(exports, \"createDiag\", {\n  enumerable: true,\n  get: function get() {\n    return _diag.createDiag;\n  }\n});\nObject.defineProperty(exports, \"createDiff\", {\n  enumerable: true,\n  get: function get() {\n    return _diff.createDiff;\n  }\n});\nObject.defineProperty(exports, \"createDiffTransform\", {\n  enumerable: true,\n  get: function get() {\n    return _diffTransform.createDiffTransform;\n  }\n});\nObject.defineProperty(exports, \"createDistance\", {\n  enumerable: true,\n  get: function get() {\n    return _distance.createDistance;\n  }\n});\nObject.defineProperty(exports, \"createDivide\", {\n  enumerable: true,\n  get: function get() {\n    return _divide.createDivide;\n  }\n});\nObject.defineProperty(exports, \"createDivideScalar\", {\n  enumerable: true,\n  get: function get() {\n    return _divideScalar.createDivideScalar;\n  }\n});\nObject.defineProperty(exports, \"createDot\", {\n  enumerable: true,\n  get: function get() {\n    return _dot.createDot;\n  }\n});\nObject.defineProperty(exports, \"createDotDivide\", {\n  enumerable: true,\n  get: function get() {\n    return _dotDivide.createDotDivide;\n  }\n});\nObject.defineProperty(exports, \"createDotMultiply\", {\n  enumerable: true,\n  get: function get() {\n    return _dotMultiply.createDotMultiply;\n  }\n});\nObject.defineProperty(exports, \"createDotPow\", {\n  enumerable: true,\n  get: function get() {\n    return _dotPow.createDotPow;\n  }\n});\nObject.defineProperty(exports, \"createE\", {\n  enumerable: true,\n  get: function get() {\n    return _constants.createE;\n  }\n});\nObject.defineProperty(exports, \"createEfimovFactor\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createEfimovFactor;\n  }\n});\nObject.defineProperty(exports, \"createEigs\", {\n  enumerable: true,\n  get: function get() {\n    return _eigs.createEigs;\n  }\n});\nObject.defineProperty(exports, \"createElectricConstant\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createElectricConstant;\n  }\n});\nObject.defineProperty(exports, \"createElectronMass\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createElectronMass;\n  }\n});\nObject.defineProperty(exports, \"createElementaryCharge\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createElementaryCharge;\n  }\n});\nObject.defineProperty(exports, \"createEqual\", {\n  enumerable: true,\n  get: function get() {\n    return _equal.createEqual;\n  }\n});\nObject.defineProperty(exports, \"createEqualScalar\", {\n  enumerable: true,\n  get: function get() {\n    return _equalScalar.createEqualScalar;\n  }\n});\nObject.defineProperty(exports, \"createEqualText\", {\n  enumerable: true,\n  get: function get() {\n    return _equalText.createEqualText;\n  }\n});\nObject.defineProperty(exports, \"createErf\", {\n  enumerable: true,\n  get: function get() {\n    return _erf.createErf;\n  }\n});\nObject.defineProperty(exports, \"createEvaluate\", {\n  enumerable: true,\n  get: function get() {\n    return _evaluate.createEvaluate;\n  }\n});\nObject.defineProperty(exports, \"createExp\", {\n  enumerable: true,\n  get: function get() {\n    return _exp.createExp;\n  }\n});\nObject.defineProperty(exports, \"createExpm\", {\n  enumerable: true,\n  get: function get() {\n    return _expm2.createExpm;\n  }\n});\nObject.defineProperty(exports, \"createExpm1\", {\n  enumerable: true,\n  get: function get() {\n    return _expm.createExpm1;\n  }\n});\nObject.defineProperty(exports, \"createFactorial\", {\n  enumerable: true,\n  get: function get() {\n    return _factorial.createFactorial;\n  }\n});\nObject.defineProperty(exports, \"createFalse\", {\n  enumerable: true,\n  get: function get() {\n    return _constants.createFalse;\n  }\n});\nObject.defineProperty(exports, \"createFaraday\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createFaraday;\n  }\n});\nObject.defineProperty(exports, \"createFermiCoupling\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createFermiCoupling;\n  }\n});\nObject.defineProperty(exports, \"createFft\", {\n  enumerable: true,\n  get: function get() {\n    return _fft.createFft;\n  }\n});\nObject.defineProperty(exports, \"createFibonacciHeapClass\", {\n  enumerable: true,\n  get: function get() {\n    return _FibonacciHeap.createFibonacciHeapClass;\n  }\n});\nObject.defineProperty(exports, \"createFilter\", {\n  enumerable: true,\n  get: function get() {\n    return _filter.createFilter;\n  }\n});\nObject.defineProperty(exports, \"createFilterTransform\", {\n  enumerable: true,\n  get: function get() {\n    return _filterTransform.createFilterTransform;\n  }\n});\nObject.defineProperty(exports, \"createFineStructure\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createFineStructure;\n  }\n});\nObject.defineProperty(exports, \"createFirstRadiation\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createFirstRadiation;\n  }\n});\nObject.defineProperty(exports, \"createFix\", {\n  enumerable: true,\n  get: function get() {\n    return _fix.createFix;\n  }\n});\nObject.defineProperty(exports, \"createFlatten\", {\n  enumerable: true,\n  get: function get() {\n    return _flatten.createFlatten;\n  }\n});\nObject.defineProperty(exports, \"createFloor\", {\n  enumerable: true,\n  get: function get() {\n    return _floor.createFloor;\n  }\n});\nObject.defineProperty(exports, \"createForEach\", {\n  enumerable: true,\n  get: function get() {\n    return _forEach.createForEach;\n  }\n});\nObject.defineProperty(exports, \"createForEachTransform\", {\n  enumerable: true,\n  get: function get() {\n    return _forEachTransform.createForEachTransform;\n  }\n});\nObject.defineProperty(exports, \"createFormat\", {\n  enumerable: true,\n  get: function get() {\n    return _format.createFormat;\n  }\n});\nObject.defineProperty(exports, \"createFraction\", {\n  enumerable: true,\n  get: function get() {\n    return _fraction.createFraction;\n  }\n});\nObject.defineProperty(exports, \"createFractionClass\", {\n  enumerable: true,\n  get: function get() {\n    return _Fraction.createFractionClass;\n  }\n});\nObject.defineProperty(exports, \"createFunctionAssignmentNode\", {\n  enumerable: true,\n  get: function get() {\n    return _FunctionAssignmentNode.createFunctionAssignmentNode;\n  }\n});\nObject.defineProperty(exports, \"createFunctionNode\", {\n  enumerable: true,\n  get: function get() {\n    return _FunctionNode.createFunctionNode;\n  }\n});\nObject.defineProperty(exports, \"createGamma\", {\n  enumerable: true,\n  get: function get() {\n    return _gamma.createGamma;\n  }\n});\nObject.defineProperty(exports, \"createGasConstant\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createGasConstant;\n  }\n});\nObject.defineProperty(exports, \"createGcd\", {\n  enumerable: true,\n  get: function get() {\n    return _gcd.createGcd;\n  }\n});\nObject.defineProperty(exports, \"createGetMatrixDataType\", {\n  enumerable: true,\n  get: function get() {\n    return _getMatrixDataType.createGetMatrixDataType;\n  }\n});\nObject.defineProperty(exports, \"createGravitationConstant\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createGravitationConstant;\n  }\n});\nObject.defineProperty(exports, \"createGravity\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createGravity;\n  }\n});\nObject.defineProperty(exports, \"createHartreeEnergy\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createHartreeEnergy;\n  }\n});\nObject.defineProperty(exports, \"createHasNumericValue\", {\n  enumerable: true,\n  get: function get() {\n    return _hasNumericValue.createHasNumericValue;\n  }\n});\nObject.defineProperty(exports, \"createHelp\", {\n  enumerable: true,\n  get: function get() {\n    return _help.createHelp;\n  }\n});\nObject.defineProperty(exports, \"createHelpClass\", {\n  enumerable: true,\n  get: function get() {\n    return _Help.createHelpClass;\n  }\n});\nObject.defineProperty(exports, \"createHex\", {\n  enumerable: true,\n  get: function get() {\n    return _hex.createHex;\n  }\n});\nObject.defineProperty(exports, \"createHypot\", {\n  enumerable: true,\n  get: function get() {\n    return _hypot.createHypot;\n  }\n});\nObject.defineProperty(exports, \"createI\", {\n  enumerable: true,\n  get: function get() {\n    return _constants.createI;\n  }\n});\nObject.defineProperty(exports, \"createIdentity\", {\n  enumerable: true,\n  get: function get() {\n    return _identity.createIdentity;\n  }\n});\nObject.defineProperty(exports, \"createIfft\", {\n  enumerable: true,\n  get: function get() {\n    return _ifft.createIfft;\n  }\n});\nObject.defineProperty(exports, \"createIm\", {\n  enumerable: true,\n  get: function get() {\n    return _im.createIm;\n  }\n});\nObject.defineProperty(exports, \"createImmutableDenseMatrixClass\", {\n  enumerable: true,\n  get: function get() {\n    return _ImmutableDenseMatrix.createImmutableDenseMatrixClass;\n  }\n});\nObject.defineProperty(exports, \"createIndex\", {\n  enumerable: true,\n  get: function get() {\n    return _index.createIndex;\n  }\n});\nObject.defineProperty(exports, \"createIndexClass\", {\n  enumerable: true,\n  get: function get() {\n    return _MatrixIndex.createIndexClass;\n  }\n});\nObject.defineProperty(exports, \"createIndexNode\", {\n  enumerable: true,\n  get: function get() {\n    return _IndexNode.createIndexNode;\n  }\n});\nObject.defineProperty(exports, \"createIndexTransform\", {\n  enumerable: true,\n  get: function get() {\n    return _indexTransform.createIndexTransform;\n  }\n});\nObject.defineProperty(exports, \"createInfinity\", {\n  enumerable: true,\n  get: function get() {\n    return _constants.createInfinity;\n  }\n});\nObject.defineProperty(exports, \"createIntersect\", {\n  enumerable: true,\n  get: function get() {\n    return _intersect.createIntersect;\n  }\n});\nObject.defineProperty(exports, \"createInv\", {\n  enumerable: true,\n  get: function get() {\n    return _inv.createInv;\n  }\n});\nObject.defineProperty(exports, \"createInverseConductanceQuantum\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createInverseConductanceQuantum;\n  }\n});\nObject.defineProperty(exports, \"createInvmod\", {\n  enumerable: true,\n  get: function get() {\n    return _invmod.createInvmod;\n  }\n});\nObject.defineProperty(exports, \"createIsInteger\", {\n  enumerable: true,\n  get: function get() {\n    return _isInteger.createIsInteger;\n  }\n});\nObject.defineProperty(exports, \"createIsNaN\", {\n  enumerable: true,\n  get: function get() {\n    return _isNaN.createIsNaN;\n  }\n});\nObject.defineProperty(exports, \"createIsNegative\", {\n  enumerable: true,\n  get: function get() {\n    return _isNegative.createIsNegative;\n  }\n});\nObject.defineProperty(exports, \"createIsNumeric\", {\n  enumerable: true,\n  get: function get() {\n    return _isNumeric.createIsNumeric;\n  }\n});\nObject.defineProperty(exports, \"createIsPositive\", {\n  enumerable: true,\n  get: function get() {\n    return _isPositive.createIsPositive;\n  }\n});\nObject.defineProperty(exports, \"createIsPrime\", {\n  enumerable: true,\n  get: function get() {\n    return _isPrime.createIsPrime;\n  }\n});\nObject.defineProperty(exports, \"createIsZero\", {\n  enumerable: true,\n  get: function get() {\n    return _isZero.createIsZero;\n  }\n});\nObject.defineProperty(exports, \"createKldivergence\", {\n  enumerable: true,\n  get: function get() {\n    return _kldivergence.createKldivergence;\n  }\n});\nObject.defineProperty(exports, \"createKlitzing\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createKlitzing;\n  }\n});\nObject.defineProperty(exports, \"createKron\", {\n  enumerable: true,\n  get: function get() {\n    return _kron.createKron;\n  }\n});\nObject.defineProperty(exports, \"createLN10\", {\n  enumerable: true,\n  get: function get() {\n    return _constants.createLN10;\n  }\n});\nObject.defineProperty(exports, \"createLN2\", {\n  enumerable: true,\n  get: function get() {\n    return _constants.createLN2;\n  }\n});\nObject.defineProperty(exports, \"createLOG10E\", {\n  enumerable: true,\n  get: function get() {\n    return _constants.createLOG10E;\n  }\n});\nObject.defineProperty(exports, \"createLOG2E\", {\n  enumerable: true,\n  get: function get() {\n    return _constants.createLOG2E;\n  }\n});\nObject.defineProperty(exports, \"createLarger\", {\n  enumerable: true,\n  get: function get() {\n    return _larger.createLarger;\n  }\n});\nObject.defineProperty(exports, \"createLargerEq\", {\n  enumerable: true,\n  get: function get() {\n    return _largerEq.createLargerEq;\n  }\n});\nObject.defineProperty(exports, \"createLcm\", {\n  enumerable: true,\n  get: function get() {\n    return _lcm.createLcm;\n  }\n});\nObject.defineProperty(exports, \"createLeafCount\", {\n  enumerable: true,\n  get: function get() {\n    return _leafCount.createLeafCount;\n  }\n});\nObject.defineProperty(exports, \"createLeftShift\", {\n  enumerable: true,\n  get: function get() {\n    return _leftShift.createLeftShift;\n  }\n});\nObject.defineProperty(exports, \"createLgamma\", {\n  enumerable: true,\n  get: function get() {\n    return _lgamma.createLgamma;\n  }\n});\nObject.defineProperty(exports, \"createLog\", {\n  enumerable: true,\n  get: function get() {\n    return _log3.createLog;\n  }\n});\nObject.defineProperty(exports, \"createLog10\", {\n  enumerable: true,\n  get: function get() {\n    return _log.createLog10;\n  }\n});\nObject.defineProperty(exports, \"createLog1p\", {\n  enumerable: true,\n  get: function get() {\n    return _log1p.createLog1p;\n  }\n});\nObject.defineProperty(exports, \"createLog2\", {\n  enumerable: true,\n  get: function get() {\n    return _log2.createLog2;\n  }\n});\nObject.defineProperty(exports, \"createLoschmidt\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createLoschmidt;\n  }\n});\nObject.defineProperty(exports, \"createLsolve\", {\n  enumerable: true,\n  get: function get() {\n    return _lsolve.createLsolve;\n  }\n});\nObject.defineProperty(exports, \"createLsolveAll\", {\n  enumerable: true,\n  get: function get() {\n    return _lsolveAll.createLsolveAll;\n  }\n});\nObject.defineProperty(exports, \"createLup\", {\n  enumerable: true,\n  get: function get() {\n    return _lup.createLup;\n  }\n});\nObject.defineProperty(exports, \"createLusolve\", {\n  enumerable: true,\n  get: function get() {\n    return _lusolve.createLusolve;\n  }\n});\nObject.defineProperty(exports, \"createLyap\", {\n  enumerable: true,\n  get: function get() {\n    return _lyap.createLyap;\n  }\n});\nObject.defineProperty(exports, \"createMad\", {\n  enumerable: true,\n  get: function get() {\n    return _mad.createMad;\n  }\n});\nObject.defineProperty(exports, \"createMagneticConstant\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createMagneticConstant;\n  }\n});\nObject.defineProperty(exports, \"createMagneticFluxQuantum\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createMagneticFluxQuantum;\n  }\n});\nObject.defineProperty(exports, \"createMap\", {\n  enumerable: true,\n  get: function get() {\n    return _map.createMap;\n  }\n});\nObject.defineProperty(exports, \"createMapTransform\", {\n  enumerable: true,\n  get: function get() {\n    return _mapTransform.createMapTransform;\n  }\n});\nObject.defineProperty(exports, \"createMatrix\", {\n  enumerable: true,\n  get: function get() {\n    return _matrix.createMatrix;\n  }\n});\nObject.defineProperty(exports, \"createMatrixClass\", {\n  enumerable: true,\n  get: function get() {\n    return _Matrix.createMatrixClass;\n  }\n});\nObject.defineProperty(exports, \"createMatrixFromColumns\", {\n  enumerable: true,\n  get: function get() {\n    return _matrixFromColumns.createMatrixFromColumns;\n  }\n});\nObject.defineProperty(exports, \"createMatrixFromFunction\", {\n  enumerable: true,\n  get: function get() {\n    return _matrixFromFunction.createMatrixFromFunction;\n  }\n});\nObject.defineProperty(exports, \"createMatrixFromRows\", {\n  enumerable: true,\n  get: function get() {\n    return _matrixFromRows.createMatrixFromRows;\n  }\n});\nObject.defineProperty(exports, \"createMax\", {\n  enumerable: true,\n  get: function get() {\n    return _max.createMax;\n  }\n});\nObject.defineProperty(exports, \"createMaxTransform\", {\n  enumerable: true,\n  get: function get() {\n    return _maxTransform.createMaxTransform;\n  }\n});\nObject.defineProperty(exports, \"createMean\", {\n  enumerable: true,\n  get: function get() {\n    return _mean.createMean;\n  }\n});\nObject.defineProperty(exports, \"createMeanTransform\", {\n  enumerable: true,\n  get: function get() {\n    return _meanTransform.createMeanTransform;\n  }\n});\nObject.defineProperty(exports, \"createMedian\", {\n  enumerable: true,\n  get: function get() {\n    return _median.createMedian;\n  }\n});\nObject.defineProperty(exports, \"createMin\", {\n  enumerable: true,\n  get: function get() {\n    return _min.createMin;\n  }\n});\nObject.defineProperty(exports, \"createMinTransform\", {\n  enumerable: true,\n  get: function get() {\n    return _minTransform.createMinTransform;\n  }\n});\nObject.defineProperty(exports, \"createMod\", {\n  enumerable: true,\n  get: function get() {\n    return _mod.createMod;\n  }\n});\nObject.defineProperty(exports, \"createMode\", {\n  enumerable: true,\n  get: function get() {\n    return _mode.createMode;\n  }\n});\nObject.defineProperty(exports, \"createMolarMass\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createMolarMass;\n  }\n});\nObject.defineProperty(exports, \"createMolarMassC12\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createMolarMassC12;\n  }\n});\nObject.defineProperty(exports, \"createMolarPlanckConstant\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createMolarPlanckConstant;\n  }\n});\nObject.defineProperty(exports, \"createMolarVolume\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createMolarVolume;\n  }\n});\nObject.defineProperty(exports, \"createMultinomial\", {\n  enumerable: true,\n  get: function get() {\n    return _multinomial.createMultinomial;\n  }\n});\nObject.defineProperty(exports, \"createMultiply\", {\n  enumerable: true,\n  get: function get() {\n    return _multiply.createMultiply;\n  }\n});\nObject.defineProperty(exports, \"createMultiplyScalar\", {\n  enumerable: true,\n  get: function get() {\n    return _multiplyScalar.createMultiplyScalar;\n  }\n});\nObject.defineProperty(exports, \"createNaN\", {\n  enumerable: true,\n  get: function get() {\n    return _constants.createNaN;\n  }\n});\nObject.defineProperty(exports, \"createNeutronMass\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createNeutronMass;\n  }\n});\nObject.defineProperty(exports, \"createNode\", {\n  enumerable: true,\n  get: function get() {\n    return _Node.createNode;\n  }\n});\nObject.defineProperty(exports, \"createNorm\", {\n  enumerable: true,\n  get: function get() {\n    return _norm.createNorm;\n  }\n});\nObject.defineProperty(exports, \"createNot\", {\n  enumerable: true,\n  get: function get() {\n    return _not.createNot;\n  }\n});\nObject.defineProperty(exports, \"createNthRoot\", {\n  enumerable: true,\n  get: function get() {\n    return _nthRoot.createNthRoot;\n  }\n});\nObject.defineProperty(exports, \"createNthRoots\", {\n  enumerable: true,\n  get: function get() {\n    return _nthRoots.createNthRoots;\n  }\n});\nObject.defineProperty(exports, \"createNuclearMagneton\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createNuclearMagneton;\n  }\n});\nObject.defineProperty(exports, \"createNull\", {\n  enumerable: true,\n  get: function get() {\n    return _constants.createNull;\n  }\n});\nObject.defineProperty(exports, \"createNumber\", {\n  enumerable: true,\n  get: function get() {\n    return _number.createNumber;\n  }\n});\nObject.defineProperty(exports, \"createNumeric\", {\n  enumerable: true,\n  get: function get() {\n    return _numeric.createNumeric;\n  }\n});\nObject.defineProperty(exports, \"createObjectNode\", {\n  enumerable: true,\n  get: function get() {\n    return _ObjectNode.createObjectNode;\n  }\n});\nObject.defineProperty(exports, \"createOct\", {\n  enumerable: true,\n  get: function get() {\n    return _oct.createOct;\n  }\n});\nObject.defineProperty(exports, \"createOnes\", {\n  enumerable: true,\n  get: function get() {\n    return _ones.createOnes;\n  }\n});\nObject.defineProperty(exports, \"createOperatorNode\", {\n  enumerable: true,\n  get: function get() {\n    return _OperatorNode.createOperatorNode;\n  }\n});\nObject.defineProperty(exports, \"createOr\", {\n  enumerable: true,\n  get: function get() {\n    return _or.createOr;\n  }\n});\nObject.defineProperty(exports, \"createParenthesisNode\", {\n  enumerable: true,\n  get: function get() {\n    return _ParenthesisNode.createParenthesisNode;\n  }\n});\nObject.defineProperty(exports, \"createParse\", {\n  enumerable: true,\n  get: function get() {\n    return _parse.createParse;\n  }\n});\nObject.defineProperty(exports, \"createParser\", {\n  enumerable: true,\n  get: function get() {\n    return _parser.createParser;\n  }\n});\nObject.defineProperty(exports, \"createParserClass\", {\n  enumerable: true,\n  get: function get() {\n    return _Parser.createParserClass;\n  }\n});\nObject.defineProperty(exports, \"createPartitionSelect\", {\n  enumerable: true,\n  get: function get() {\n    return _partitionSelect.createPartitionSelect;\n  }\n});\nObject.defineProperty(exports, \"createPermutations\", {\n  enumerable: true,\n  get: function get() {\n    return _permutations.createPermutations;\n  }\n});\nObject.defineProperty(exports, \"createPhi\", {\n  enumerable: true,\n  get: function get() {\n    return _constants.createPhi;\n  }\n});\nObject.defineProperty(exports, \"createPi\", {\n  enumerable: true,\n  get: function get() {\n    return _constants.createPi;\n  }\n});\nObject.defineProperty(exports, \"createPickRandom\", {\n  enumerable: true,\n  get: function get() {\n    return _pickRandom.createPickRandom;\n  }\n});\nObject.defineProperty(exports, \"createPinv\", {\n  enumerable: true,\n  get: function get() {\n    return _pinv.createPinv;\n  }\n});\nObject.defineProperty(exports, \"createPlanckCharge\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createPlanckCharge;\n  }\n});\nObject.defineProperty(exports, \"createPlanckConstant\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createPlanckConstant;\n  }\n});\nObject.defineProperty(exports, \"createPlanckLength\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createPlanckLength;\n  }\n});\nObject.defineProperty(exports, \"createPlanckMass\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createPlanckMass;\n  }\n});\nObject.defineProperty(exports, \"createPlanckTemperature\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createPlanckTemperature;\n  }\n});\nObject.defineProperty(exports, \"createPlanckTime\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createPlanckTime;\n  }\n});\nObject.defineProperty(exports, \"createPolynomialRoot\", {\n  enumerable: true,\n  get: function get() {\n    return _polynomialRoot.createPolynomialRoot;\n  }\n});\nObject.defineProperty(exports, \"createPow\", {\n  enumerable: true,\n  get: function get() {\n    return _pow.createPow;\n  }\n});\nObject.defineProperty(exports, \"createPrint\", {\n  enumerable: true,\n  get: function get() {\n    return _print.createPrint;\n  }\n});\nObject.defineProperty(exports, \"createProd\", {\n  enumerable: true,\n  get: function get() {\n    return _prod.createProd;\n  }\n});\nObject.defineProperty(exports, \"createProtonMass\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createProtonMass;\n  }\n});\nObject.defineProperty(exports, \"createQr\", {\n  enumerable: true,\n  get: function get() {\n    return _qr.createQr;\n  }\n});\nObject.defineProperty(exports, \"createQuantileSeq\", {\n  enumerable: true,\n  get: function get() {\n    return _quantileSeq.createQuantileSeq;\n  }\n});\nObject.defineProperty(exports, \"createQuantumOfCirculation\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createQuantumOfCirculation;\n  }\n});\nObject.defineProperty(exports, \"createRandom\", {\n  enumerable: true,\n  get: function get() {\n    return _random.createRandom;\n  }\n});\nObject.defineProperty(exports, \"createRandomInt\", {\n  enumerable: true,\n  get: function get() {\n    return _randomInt.createRandomInt;\n  }\n});\nObject.defineProperty(exports, \"createRange\", {\n  enumerable: true,\n  get: function get() {\n    return _range.createRange;\n  }\n});\nObject.defineProperty(exports, \"createRangeClass\", {\n  enumerable: true,\n  get: function get() {\n    return _Range.createRangeClass;\n  }\n});\nObject.defineProperty(exports, \"createRangeNode\", {\n  enumerable: true,\n  get: function get() {\n    return _RangeNode.createRangeNode;\n  }\n});\nObject.defineProperty(exports, \"createRangeTransform\", {\n  enumerable: true,\n  get: function get() {\n    return _rangeTransform.createRangeTransform;\n  }\n});\nObject.defineProperty(exports, \"createRationalize\", {\n  enumerable: true,\n  get: function get() {\n    return _rationalize.createRationalize;\n  }\n});\nObject.defineProperty(exports, \"createRe\", {\n  enumerable: true,\n  get: function get() {\n    return _re.createRe;\n  }\n});\nObject.defineProperty(exports, \"createReducedPlanckConstant\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createReducedPlanckConstant;\n  }\n});\nObject.defineProperty(exports, \"createRelationalNode\", {\n  enumerable: true,\n  get: function get() {\n    return _RelationalNode.createRelationalNode;\n  }\n});\nObject.defineProperty(exports, \"createReplacer\", {\n  enumerable: true,\n  get: function get() {\n    return _replacer.createReplacer;\n  }\n});\nObject.defineProperty(exports, \"createReshape\", {\n  enumerable: true,\n  get: function get() {\n    return _reshape.createReshape;\n  }\n});\nObject.defineProperty(exports, \"createResize\", {\n  enumerable: true,\n  get: function get() {\n    return _resize.createResize;\n  }\n});\nObject.defineProperty(exports, \"createResolve\", {\n  enumerable: true,\n  get: function get() {\n    return _resolve.createResolve;\n  }\n});\nObject.defineProperty(exports, \"createResultSet\", {\n  enumerable: true,\n  get: function get() {\n    return _ResultSet.createResultSet;\n  }\n});\nObject.defineProperty(exports, \"createReviver\", {\n  enumerable: true,\n  get: function get() {\n    return _reviver.createReviver;\n  }\n});\nObject.defineProperty(exports, \"createRightArithShift\", {\n  enumerable: true,\n  get: function get() {\n    return _rightArithShift.createRightArithShift;\n  }\n});\nObject.defineProperty(exports, \"createRightLogShift\", {\n  enumerable: true,\n  get: function get() {\n    return _rightLogShift.createRightLogShift;\n  }\n});\nObject.defineProperty(exports, \"createRotate\", {\n  enumerable: true,\n  get: function get() {\n    return _rotate.createRotate;\n  }\n});\nObject.defineProperty(exports, \"createRotationMatrix\", {\n  enumerable: true,\n  get: function get() {\n    return _rotationMatrix.createRotationMatrix;\n  }\n});\nObject.defineProperty(exports, \"createRound\", {\n  enumerable: true,\n  get: function get() {\n    return _round.createRound;\n  }\n});\nObject.defineProperty(exports, \"createRow\", {\n  enumerable: true,\n  get: function get() {\n    return _row.createRow;\n  }\n});\nObject.defineProperty(exports, \"createRowTransform\", {\n  enumerable: true,\n  get: function get() {\n    return _rowTransform.createRowTransform;\n  }\n});\nObject.defineProperty(exports, \"createRydberg\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createRydberg;\n  }\n});\nObject.defineProperty(exports, \"createSQRT1_2\", {\n  enumerable: true,\n  get: function get() {\n    return _constants.createSQRT1_2;\n  }\n});\nObject.defineProperty(exports, \"createSQRT2\", {\n  enumerable: true,\n  get: function get() {\n    return _constants.createSQRT2;\n  }\n});\nObject.defineProperty(exports, \"createSackurTetrode\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createSackurTetrode;\n  }\n});\nObject.defineProperty(exports, \"createSchur\", {\n  enumerable: true,\n  get: function get() {\n    return _schur.createSchur;\n  }\n});\nObject.defineProperty(exports, \"createSec\", {\n  enumerable: true,\n  get: function get() {\n    return _sec.createSec;\n  }\n});\nObject.defineProperty(exports, \"createSech\", {\n  enumerable: true,\n  get: function get() {\n    return _sech.createSech;\n  }\n});\nObject.defineProperty(exports, \"createSecondRadiation\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createSecondRadiation;\n  }\n});\nObject.defineProperty(exports, \"createSetCartesian\", {\n  enumerable: true,\n  get: function get() {\n    return _setCartesian.createSetCartesian;\n  }\n});\nObject.defineProperty(exports, \"createSetDifference\", {\n  enumerable: true,\n  get: function get() {\n    return _setDifference.createSetDifference;\n  }\n});\nObject.defineProperty(exports, \"createSetDistinct\", {\n  enumerable: true,\n  get: function get() {\n    return _setDistinct.createSetDistinct;\n  }\n});\nObject.defineProperty(exports, \"createSetIntersect\", {\n  enumerable: true,\n  get: function get() {\n    return _setIntersect.createSetIntersect;\n  }\n});\nObject.defineProperty(exports, \"createSetIsSubset\", {\n  enumerable: true,\n  get: function get() {\n    return _setIsSubset.createSetIsSubset;\n  }\n});\nObject.defineProperty(exports, \"createSetMultiplicity\", {\n  enumerable: true,\n  get: function get() {\n    return _setMultiplicity.createSetMultiplicity;\n  }\n});\nObject.defineProperty(exports, \"createSetPowerset\", {\n  enumerable: true,\n  get: function get() {\n    return _setPowerset.createSetPowerset;\n  }\n});\nObject.defineProperty(exports, \"createSetSize\", {\n  enumerable: true,\n  get: function get() {\n    return _setSize.createSetSize;\n  }\n});\nObject.defineProperty(exports, \"createSetSymDifference\", {\n  enumerable: true,\n  get: function get() {\n    return _setSymDifference.createSetSymDifference;\n  }\n});\nObject.defineProperty(exports, \"createSetUnion\", {\n  enumerable: true,\n  get: function get() {\n    return _setUnion.createSetUnion;\n  }\n});\nObject.defineProperty(exports, \"createSign\", {\n  enumerable: true,\n  get: function get() {\n    return _sign.createSign;\n  }\n});\nObject.defineProperty(exports, \"createSimplify\", {\n  enumerable: true,\n  get: function get() {\n    return _simplify.createSimplify;\n  }\n});\nObject.defineProperty(exports, \"createSimplifyConstant\", {\n  enumerable: true,\n  get: function get() {\n    return _simplifyConstant.createSimplifyConstant;\n  }\n});\nObject.defineProperty(exports, \"createSimplifyCore\", {\n  enumerable: true,\n  get: function get() {\n    return _simplifyCore.createSimplifyCore;\n  }\n});\nObject.defineProperty(exports, \"createSin\", {\n  enumerable: true,\n  get: function get() {\n    return _sin.createSin;\n  }\n});\nObject.defineProperty(exports, \"createSinh\", {\n  enumerable: true,\n  get: function get() {\n    return _sinh.createSinh;\n  }\n});\nObject.defineProperty(exports, \"createSize\", {\n  enumerable: true,\n  get: function get() {\n    return _size.createSize;\n  }\n});\nObject.defineProperty(exports, \"createSlu\", {\n  enumerable: true,\n  get: function get() {\n    return _slu.createSlu;\n  }\n});\nObject.defineProperty(exports, \"createSmaller\", {\n  enumerable: true,\n  get: function get() {\n    return _smaller.createSmaller;\n  }\n});\nObject.defineProperty(exports, \"createSmallerEq\", {\n  enumerable: true,\n  get: function get() {\n    return _smallerEq.createSmallerEq;\n  }\n});\nObject.defineProperty(exports, \"createSort\", {\n  enumerable: true,\n  get: function get() {\n    return _sort.createSort;\n  }\n});\nObject.defineProperty(exports, \"createSpaClass\", {\n  enumerable: true,\n  get: function get() {\n    return _Spa.createSpaClass;\n  }\n});\nObject.defineProperty(exports, \"createSparse\", {\n  enumerable: true,\n  get: function get() {\n    return _sparse.createSparse;\n  }\n});\nObject.defineProperty(exports, \"createSparseMatrixClass\", {\n  enumerable: true,\n  get: function get() {\n    return _SparseMatrix.createSparseMatrixClass;\n  }\n});\nObject.defineProperty(exports, \"createSpeedOfLight\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createSpeedOfLight;\n  }\n});\nObject.defineProperty(exports, \"createSplitUnit\", {\n  enumerable: true,\n  get: function get() {\n    return _splitUnit.createSplitUnit;\n  }\n});\nObject.defineProperty(exports, \"createSqrt\", {\n  enumerable: true,\n  get: function get() {\n    return _sqrt.createSqrt;\n  }\n});\nObject.defineProperty(exports, \"createSqrtm\", {\n  enumerable: true,\n  get: function get() {\n    return _sqrtm.createSqrtm;\n  }\n});\nObject.defineProperty(exports, \"createSquare\", {\n  enumerable: true,\n  get: function get() {\n    return _square.createSquare;\n  }\n});\nObject.defineProperty(exports, \"createSqueeze\", {\n  enumerable: true,\n  get: function get() {\n    return _squeeze.createSqueeze;\n  }\n});\nObject.defineProperty(exports, \"createStd\", {\n  enumerable: true,\n  get: function get() {\n    return _std.createStd;\n  }\n});\nObject.defineProperty(exports, \"createStdTransform\", {\n  enumerable: true,\n  get: function get() {\n    return _stdTransform.createStdTransform;\n  }\n});\nObject.defineProperty(exports, \"createStefanBoltzmann\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createStefanBoltzmann;\n  }\n});\nObject.defineProperty(exports, \"createStirlingS2\", {\n  enumerable: true,\n  get: function get() {\n    return _stirlingS.createStirlingS2;\n  }\n});\nObject.defineProperty(exports, \"createString\", {\n  enumerable: true,\n  get: function get() {\n    return _string.createString;\n  }\n});\nObject.defineProperty(exports, \"createSubset\", {\n  enumerable: true,\n  get: function get() {\n    return _subset.createSubset;\n  }\n});\nObject.defineProperty(exports, \"createSubsetTransform\", {\n  enumerable: true,\n  get: function get() {\n    return _subsetTransform.createSubsetTransform;\n  }\n});\nObject.defineProperty(exports, \"createSubtract\", {\n  enumerable: true,\n  get: function get() {\n    return _subtract.createSubtract;\n  }\n});\nObject.defineProperty(exports, \"createSum\", {\n  enumerable: true,\n  get: function get() {\n    return _sum.createSum;\n  }\n});\nObject.defineProperty(exports, \"createSumTransform\", {\n  enumerable: true,\n  get: function get() {\n    return _sumTransform.createSumTransform;\n  }\n});\nObject.defineProperty(exports, \"createSylvester\", {\n  enumerable: true,\n  get: function get() {\n    return _sylvester.createSylvester;\n  }\n});\nObject.defineProperty(exports, \"createSymbolNode\", {\n  enumerable: true,\n  get: function get() {\n    return _SymbolNode.createSymbolNode;\n  }\n});\nObject.defineProperty(exports, \"createSymbolicEqual\", {\n  enumerable: true,\n  get: function get() {\n    return _symbolicEqual.createSymbolicEqual;\n  }\n});\nObject.defineProperty(exports, \"createTan\", {\n  enumerable: true,\n  get: function get() {\n    return _tan.createTan;\n  }\n});\nObject.defineProperty(exports, \"createTanh\", {\n  enumerable: true,\n  get: function get() {\n    return _tanh.createTanh;\n  }\n});\nObject.defineProperty(exports, \"createTau\", {\n  enumerable: true,\n  get: function get() {\n    return _constants.createTau;\n  }\n});\nObject.defineProperty(exports, \"createThomsonCrossSection\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createThomsonCrossSection;\n  }\n});\nObject.defineProperty(exports, \"createTo\", {\n  enumerable: true,\n  get: function get() {\n    return _to.createTo;\n  }\n});\nObject.defineProperty(exports, \"createTrace\", {\n  enumerable: true,\n  get: function get() {\n    return _trace.createTrace;\n  }\n});\nObject.defineProperty(exports, \"createTranspose\", {\n  enumerable: true,\n  get: function get() {\n    return _transpose.createTranspose;\n  }\n});\nObject.defineProperty(exports, \"createTrue\", {\n  enumerable: true,\n  get: function get() {\n    return _constants.createTrue;\n  }\n});\nObject.defineProperty(exports, \"createTypeOf\", {\n  enumerable: true,\n  get: function get() {\n    return _typeOf.createTypeOf;\n  }\n});\nObject.defineProperty(exports, \"createTyped\", {\n  enumerable: true,\n  get: function get() {\n    return _typed.createTyped;\n  }\n});\nObject.defineProperty(exports, \"createUnaryMinus\", {\n  enumerable: true,\n  get: function get() {\n    return _unaryMinus.createUnaryMinus;\n  }\n});\nObject.defineProperty(exports, \"createUnaryPlus\", {\n  enumerable: true,\n  get: function get() {\n    return _unaryPlus.createUnaryPlus;\n  }\n});\nObject.defineProperty(exports, \"createUnequal\", {\n  enumerable: true,\n  get: function get() {\n    return _unequal.createUnequal;\n  }\n});\nObject.defineProperty(exports, \"createUnitClass\", {\n  enumerable: true,\n  get: function get() {\n    return _Unit.createUnitClass;\n  }\n});\nObject.defineProperty(exports, \"createUnitFunction\", {\n  enumerable: true,\n  get: function get() {\n    return _unit.createUnitFunction;\n  }\n});\nObject.defineProperty(exports, \"createUppercaseE\", {\n  enumerable: true,\n  get: function get() {\n    return _constants.createUppercaseE;\n  }\n});\nObject.defineProperty(exports, \"createUppercasePi\", {\n  enumerable: true,\n  get: function get() {\n    return _constants.createUppercasePi;\n  }\n});\nObject.defineProperty(exports, \"createUsolve\", {\n  enumerable: true,\n  get: function get() {\n    return _usolve.createUsolve;\n  }\n});\nObject.defineProperty(exports, \"createUsolveAll\", {\n  enumerable: true,\n  get: function get() {\n    return _usolveAll.createUsolveAll;\n  }\n});\nObject.defineProperty(exports, \"createVacuumImpedance\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createVacuumImpedance;\n  }\n});\nObject.defineProperty(exports, \"createVariance\", {\n  enumerable: true,\n  get: function get() {\n    return _variance.createVariance;\n  }\n});\nObject.defineProperty(exports, \"createVarianceTransform\", {\n  enumerable: true,\n  get: function get() {\n    return _varianceTransform.createVarianceTransform;\n  }\n});\nObject.defineProperty(exports, \"createVersion\", {\n  enumerable: true,\n  get: function get() {\n    return _constants.createVersion;\n  }\n});\nObject.defineProperty(exports, \"createWeakMixingAngle\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createWeakMixingAngle;\n  }\n});\nObject.defineProperty(exports, \"createWienDisplacement\", {\n  enumerable: true,\n  get: function get() {\n    return _physicalConstants.createWienDisplacement;\n  }\n});\nObject.defineProperty(exports, \"createXgcd\", {\n  enumerable: true,\n  get: function get() {\n    return _xgcd.createXgcd;\n  }\n});\nObject.defineProperty(exports, \"createXor\", {\n  enumerable: true,\n  get: function get() {\n    return _xor.createXor;\n  }\n});\nObject.defineProperty(exports, \"createZeros\", {\n  enumerable: true,\n  get: function get() {\n    return _zeros.createZeros;\n  }\n});\nvar _typed = require(\"./core/function/typed.js\");\nvar _ResultSet = require(\"./type/resultset/ResultSet.js\");\nvar _BigNumber = require(\"./type/bignumber/BigNumber.js\");\nvar _Complex = require(\"./type/complex/Complex.js\");\nvar _Fraction = require(\"./type/fraction/Fraction.js\");\nvar _Range = require(\"./type/matrix/Range.js\");\nvar _Matrix = require(\"./type/matrix/Matrix.js\");\nvar _DenseMatrix = require(\"./type/matrix/DenseMatrix.js\");\nvar _clone = require(\"./function/utils/clone.js\");\nvar _isInteger = require(\"./function/utils/isInteger.js\");\nvar _isNegative = require(\"./function/utils/isNegative.js\");\nvar _isNumeric = require(\"./function/utils/isNumeric.js\");\nvar _hasNumericValue = require(\"./function/utils/hasNumericValue.js\");\nvar _isPositive = require(\"./function/utils/isPositive.js\");\nvar _isZero = require(\"./function/utils/isZero.js\");\nvar _isNaN = require(\"./function/utils/isNaN.js\");\nvar _typeOf = require(\"./function/utils/typeOf.js\");\nvar _equalScalar = require(\"./function/relational/equalScalar.js\");\nvar _SparseMatrix = require(\"./type/matrix/SparseMatrix.js\");\nvar _number = require(\"./type/number.js\");\nvar _string = require(\"./type/string.js\");\nvar _boolean = require(\"./type/boolean.js\");\nvar _bignumber = require(\"./type/bignumber/function/bignumber.js\");\nvar _complex = require(\"./type/complex/function/complex.js\");\nvar _fraction = require(\"./type/fraction/function/fraction.js\");\nvar _matrix = require(\"./type/matrix/function/matrix.js\");\nvar _matrixFromFunction = require(\"./function/matrix/matrixFromFunction.js\");\nvar _matrixFromRows = require(\"./function/matrix/matrixFromRows.js\");\nvar _matrixFromColumns = require(\"./function/matrix/matrixFromColumns.js\");\nvar _splitUnit = require(\"./type/unit/function/splitUnit.js\");\nvar _unaryMinus = require(\"./function/arithmetic/unaryMinus.js\");\nvar _unaryPlus = require(\"./function/arithmetic/unaryPlus.js\");\nvar _abs = require(\"./function/arithmetic/abs.js\");\nvar _apply = require(\"./function/matrix/apply.js\");\nvar _addScalar = require(\"./function/arithmetic/addScalar.js\");\nvar _cbrt = require(\"./function/arithmetic/cbrt.js\");\nvar _ceil = require(\"./function/arithmetic/ceil.js\");\nvar _cube = require(\"./function/arithmetic/cube.js\");\nvar _exp = require(\"./function/arithmetic/exp.js\");\nvar _expm = require(\"./function/arithmetic/expm1.js\");\nvar _fix = require(\"./function/arithmetic/fix.js\");\nvar _floor = require(\"./function/arithmetic/floor.js\");\nvar _gcd = require(\"./function/arithmetic/gcd.js\");\nvar _lcm = require(\"./function/arithmetic/lcm.js\");\nvar _log = require(\"./function/arithmetic/log10.js\");\nvar _log2 = require(\"./function/arithmetic/log2.js\");\nvar _mod = require(\"./function/arithmetic/mod.js\");\nvar _multiplyScalar = require(\"./function/arithmetic/multiplyScalar.js\");\nvar _multiply = require(\"./function/arithmetic/multiply.js\");\nvar _nthRoot = require(\"./function/arithmetic/nthRoot.js\");\nvar _sign = require(\"./function/arithmetic/sign.js\");\nvar _sqrt = require(\"./function/arithmetic/sqrt.js\");\nvar _square = require(\"./function/arithmetic/square.js\");\nvar _subtract = require(\"./function/arithmetic/subtract.js\");\nvar _xgcd = require(\"./function/arithmetic/xgcd.js\");\nvar _invmod = require(\"./function/arithmetic/invmod.js\");\nvar _dotMultiply = require(\"./function/arithmetic/dotMultiply.js\");\nvar _bitAnd = require(\"./function/bitwise/bitAnd.js\");\nvar _bitNot = require(\"./function/bitwise/bitNot.js\");\nvar _bitOr = require(\"./function/bitwise/bitOr.js\");\nvar _bitXor = require(\"./function/bitwise/bitXor.js\");\nvar _arg = require(\"./function/complex/arg.js\");\nvar _conj = require(\"./function/complex/conj.js\");\nvar _im = require(\"./function/complex/im.js\");\nvar _re = require(\"./function/complex/re.js\");\nvar _not = require(\"./function/logical/not.js\");\nvar _or = require(\"./function/logical/or.js\");\nvar _xor = require(\"./function/logical/xor.js\");\nvar _concat = require(\"./function/matrix/concat.js\");\nvar _column = require(\"./function/matrix/column.js\");\nvar _count = require(\"./function/matrix/count.js\");\nvar _cross = require(\"./function/matrix/cross.js\");\nvar _diag = require(\"./function/matrix/diag.js\");\nvar _filter = require(\"./function/matrix/filter.js\");\nvar _flatten = require(\"./function/matrix/flatten.js\");\nvar _forEach = require(\"./function/matrix/forEach.js\");\nvar _getMatrixDataType = require(\"./function/matrix/getMatrixDataType.js\");\nvar _identity = require(\"./function/matrix/identity.js\");\nvar _kron = require(\"./function/matrix/kron.js\");\nvar _map = require(\"./function/matrix/map.js\");\nvar _diff = require(\"./function/matrix/diff.js\");\nvar _ones = require(\"./function/matrix/ones.js\");\nvar _range = require(\"./function/matrix/range.js\");\nvar _reshape = require(\"./function/matrix/reshape.js\");\nvar _resize = require(\"./function/matrix/resize.js\");\nvar _rotate = require(\"./function/matrix/rotate.js\");\nvar _rotationMatrix = require(\"./function/matrix/rotationMatrix.js\");\nvar _row = require(\"./function/matrix/row.js\");\nvar _size = require(\"./function/matrix/size.js\");\nvar _squeeze = require(\"./function/matrix/squeeze.js\");\nvar _subset = require(\"./function/matrix/subset.js\");\nvar _transpose = require(\"./function/matrix/transpose.js\");\nvar _ctranspose = require(\"./function/matrix/ctranspose.js\");\nvar _zeros = require(\"./function/matrix/zeros.js\");\nvar _fft = require(\"./function/matrix/fft.js\");\nvar _ifft = require(\"./function/matrix/ifft.js\");\nvar _erf = require(\"./function/special/erf.js\");\nvar _mode = require(\"./function/statistics/mode.js\");\nvar _prod = require(\"./function/statistics/prod.js\");\nvar _format = require(\"./function/string/format.js\");\nvar _bin = require(\"./function/string/bin.js\");\nvar _oct = require(\"./function/string/oct.js\");\nvar _hex = require(\"./function/string/hex.js\");\nvar _print = require(\"./function/string/print.js\");\nvar _to = require(\"./function/unit/to.js\");\nvar _isPrime = require(\"./function/utils/isPrime.js\");\nvar _numeric = require(\"./function/utils/numeric.js\");\nvar _divideScalar = require(\"./function/arithmetic/divideScalar.js\");\nvar _pow = require(\"./function/arithmetic/pow.js\");\nvar _round = require(\"./function/arithmetic/round.js\");\nvar _log3 = require(\"./function/arithmetic/log.js\");\nvar _log1p = require(\"./function/arithmetic/log1p.js\");\nvar _nthRoots = require(\"./function/arithmetic/nthRoots.js\");\nvar _dotPow = require(\"./function/arithmetic/dotPow.js\");\nvar _dotDivide = require(\"./function/arithmetic/dotDivide.js\");\nvar _lsolve = require(\"./function/algebra/solver/lsolve.js\");\nvar _usolve = require(\"./function/algebra/solver/usolve.js\");\nvar _lsolveAll = require(\"./function/algebra/solver/lsolveAll.js\");\nvar _usolveAll = require(\"./function/algebra/solver/usolveAll.js\");\nvar _leftShift = require(\"./function/bitwise/leftShift.js\");\nvar _rightArithShift = require(\"./function/bitwise/rightArithShift.js\");\nvar _rightLogShift = require(\"./function/bitwise/rightLogShift.js\");\nvar _and = require(\"./function/logical/and.js\");\nvar _compare = require(\"./function/relational/compare.js\");\nvar _compareNatural = require(\"./function/relational/compareNatural.js\");\nvar _compareText = require(\"./function/relational/compareText.js\");\nvar _equal = require(\"./function/relational/equal.js\");\nvar _equalText = require(\"./function/relational/equalText.js\");\nvar _smaller = require(\"./function/relational/smaller.js\");\nvar _smallerEq = require(\"./function/relational/smallerEq.js\");\nvar _larger = require(\"./function/relational/larger.js\");\nvar _largerEq = require(\"./function/relational/largerEq.js\");\nvar _deepEqual = require(\"./function/relational/deepEqual.js\");\nvar _unequal = require(\"./function/relational/unequal.js\");\nvar _partitionSelect = require(\"./function/matrix/partitionSelect.js\");\nvar _sort = require(\"./function/matrix/sort.js\");\nvar _max = require(\"./function/statistics/max.js\");\nvar _min = require(\"./function/statistics/min.js\");\nvar _ImmutableDenseMatrix = require(\"./type/matrix/ImmutableDenseMatrix.js\");\nvar _MatrixIndex = require(\"./type/matrix/MatrixIndex.js\");\nvar _FibonacciHeap = require(\"./type/matrix/FibonacciHeap.js\");\nvar _Spa = require(\"./type/matrix/Spa.js\");\nvar _Unit = require(\"./type/unit/Unit.js\");\nvar _unit = require(\"./type/unit/function/unit.js\");\nvar _sparse = require(\"./type/matrix/function/sparse.js\");\nvar _createUnit = require(\"./type/unit/function/createUnit.js\");\nvar _acos = require(\"./function/trigonometry/acos.js\");\nvar _acosh = require(\"./function/trigonometry/acosh.js\");\nvar _acot = require(\"./function/trigonometry/acot.js\");\nvar _acoth = require(\"./function/trigonometry/acoth.js\");\nvar _acsc = require(\"./function/trigonometry/acsc.js\");\nvar _acsch = require(\"./function/trigonometry/acsch.js\");\nvar _asec = require(\"./function/trigonometry/asec.js\");\nvar _asech = require(\"./function/trigonometry/asech.js\");\nvar _asin = require(\"./function/trigonometry/asin.js\");\nvar _asinh = require(\"./function/trigonometry/asinh.js\");\nvar _atan = require(\"./function/trigonometry/atan.js\");\nvar _atan2 = require(\"./function/trigonometry/atan2.js\");\nvar _atanh = require(\"./function/trigonometry/atanh.js\");\nvar _cos = require(\"./function/trigonometry/cos.js\");\nvar _cosh = require(\"./function/trigonometry/cosh.js\");\nvar _cot = require(\"./function/trigonometry/cot.js\");\nvar _coth = require(\"./function/trigonometry/coth.js\");\nvar _csc = require(\"./function/trigonometry/csc.js\");\nvar _csch = require(\"./function/trigonometry/csch.js\");\nvar _sec = require(\"./function/trigonometry/sec.js\");\nvar _sech = require(\"./function/trigonometry/sech.js\");\nvar _sin = require(\"./function/trigonometry/sin.js\");\nvar _sinh = require(\"./function/trigonometry/sinh.js\");\nvar _tan = require(\"./function/trigonometry/tan.js\");\nvar _tanh = require(\"./function/trigonometry/tanh.js\");\nvar _setCartesian = require(\"./function/set/setCartesian.js\");\nvar _setDifference = require(\"./function/set/setDifference.js\");\nvar _setDistinct = require(\"./function/set/setDistinct.js\");\nvar _setIntersect = require(\"./function/set/setIntersect.js\");\nvar _setIsSubset = require(\"./function/set/setIsSubset.js\");\nvar _setMultiplicity = require(\"./function/set/setMultiplicity.js\");\nvar _setPowerset = require(\"./function/set/setPowerset.js\");\nvar _setSize = require(\"./function/set/setSize.js\");\nvar _setSymDifference = require(\"./function/set/setSymDifference.js\");\nvar _setUnion = require(\"./function/set/setUnion.js\");\nvar _add = require(\"./function/arithmetic/add.js\");\nvar _hypot = require(\"./function/arithmetic/hypot.js\");\nvar _norm = require(\"./function/arithmetic/norm.js\");\nvar _dot = require(\"./function/matrix/dot.js\");\nvar _trace = require(\"./function/matrix/trace.js\");\nvar _index = require(\"./type/matrix/function/index.js\");\nvar _Node = require(\"./expression/node/Node.js\");\nvar _AccessorNode = require(\"./expression/node/AccessorNode.js\");\nvar _ArrayNode = require(\"./expression/node/ArrayNode.js\");\nvar _AssignmentNode = require(\"./expression/node/AssignmentNode.js\");\nvar _BlockNode = require(\"./expression/node/BlockNode.js\");\nvar _ConditionalNode = require(\"./expression/node/ConditionalNode.js\");\nvar _ConstantNode = require(\"./expression/node/ConstantNode.js\");\nvar _FunctionAssignmentNode = require(\"./expression/node/FunctionAssignmentNode.js\");\nvar _IndexNode = require(\"./expression/node/IndexNode.js\");\nvar _ObjectNode = require(\"./expression/node/ObjectNode.js\");\nvar _OperatorNode = require(\"./expression/node/OperatorNode.js\");\nvar _ParenthesisNode = require(\"./expression/node/ParenthesisNode.js\");\nvar _RangeNode = require(\"./expression/node/RangeNode.js\");\nvar _RelationalNode = require(\"./expression/node/RelationalNode.js\");\nvar _SymbolNode = require(\"./expression/node/SymbolNode.js\");\nvar _FunctionNode = require(\"./expression/node/FunctionNode.js\");\nvar _parse = require(\"./expression/parse.js\");\nvar _compile = require(\"./expression/function/compile.js\");\nvar _evaluate = require(\"./expression/function/evaluate.js\");\nvar _Parser = require(\"./expression/Parser.js\");\nvar _parser = require(\"./expression/function/parser.js\");\nvar _lup = require(\"./function/algebra/decomposition/lup.js\");\nvar _qr = require(\"./function/algebra/decomposition/qr.js\");\nvar _slu = require(\"./function/algebra/decomposition/slu.js\");\nvar _lusolve = require(\"./function/algebra/solver/lusolve.js\");\nvar _polynomialRoot = require(\"./function/algebra/polynomialRoot.js\");\nvar _Help = require(\"./expression/Help.js\");\nvar _Chain = require(\"./type/chain/Chain.js\");\nvar _help = require(\"./expression/function/help.js\");\nvar _chain = require(\"./type/chain/function/chain.js\");\nvar _det = require(\"./function/matrix/det.js\");\nvar _inv = require(\"./function/matrix/inv.js\");\nvar _pinv = require(\"./function/matrix/pinv.js\");\nvar _eigs = require(\"./function/matrix/eigs.js\");\nvar _expm2 = require(\"./function/matrix/expm.js\");\nvar _sqrtm = require(\"./function/matrix/sqrtm.js\");\nvar _sylvester = require(\"./function/algebra/sylvester.js\");\nvar _schur = require(\"./function/algebra/decomposition/schur.js\");\nvar _lyap = require(\"./function/algebra/lyap.js\");\nvar _divide = require(\"./function/arithmetic/divide.js\");\nvar _distance = require(\"./function/geometry/distance.js\");\nvar _intersect = require(\"./function/geometry/intersect.js\");\nvar _sum = require(\"./function/statistics/sum.js\");\nvar _cumsum = require(\"./function/statistics/cumsum.js\");\nvar _mean = require(\"./function/statistics/mean.js\");\nvar _median = require(\"./function/statistics/median.js\");\nvar _mad = require(\"./function/statistics/mad.js\");\nvar _variance = require(\"./function/statistics/variance.js\");\nvar _quantileSeq = require(\"./function/statistics/quantileSeq.js\");\nvar _std = require(\"./function/statistics/std.js\");\nvar _combinations = require(\"./function/probability/combinations.js\");\nvar _combinationsWithRep = require(\"./function/probability/combinationsWithRep.js\");\nvar _gamma = require(\"./function/probability/gamma.js\");\nvar _lgamma = require(\"./function/probability/lgamma.js\");\nvar _factorial = require(\"./function/probability/factorial.js\");\nvar _kldivergence = require(\"./function/probability/kldivergence.js\");\nvar _multinomial = require(\"./function/probability/multinomial.js\");\nvar _permutations = require(\"./function/probability/permutations.js\");\nvar _pickRandom = require(\"./function/probability/pickRandom.js\");\nvar _random = require(\"./function/probability/random.js\");\nvar _randomInt = require(\"./function/probability/randomInt.js\");\nvar _stirlingS = require(\"./function/combinatorics/stirlingS2.js\");\nvar _bellNumbers = require(\"./function/combinatorics/bellNumbers.js\");\nvar _catalan = require(\"./function/combinatorics/catalan.js\");\nvar _composition = require(\"./function/combinatorics/composition.js\");\nvar _leafCount = require(\"./function/algebra/leafCount.js\");\nvar _simplify = require(\"./function/algebra/simplify.js\");\nvar _simplifyConstant = require(\"./function/algebra/simplifyConstant.js\");\nvar _simplifyCore = require(\"./function/algebra/simplifyCore.js\");\nvar _resolve = require(\"./function/algebra/resolve.js\");\nvar _symbolicEqual = require(\"./function/algebra/symbolicEqual.js\");\nvar _derivative = require(\"./function/algebra/derivative.js\");\nvar _rationalize = require(\"./function/algebra/rationalize.js\");\nvar _reviver = require(\"./json/reviver.js\");\nvar _replacer = require(\"./json/replacer.js\");\nvar _constants = require(\"./constants.js\");\nvar _physicalConstants = require(\"./type/unit/physicalConstants.js\");\nvar _applyTransform = require(\"./expression/transform/apply.transform.js\");\nvar _columnTransform = require(\"./expression/transform/column.transform.js\");\nvar _filterTransform = require(\"./expression/transform/filter.transform.js\");\nvar _forEachTransform = require(\"./expression/transform/forEach.transform.js\");\nvar _indexTransform = require(\"./expression/transform/index.transform.js\");\nvar _mapTransform = require(\"./expression/transform/map.transform.js\");\nvar _maxTransform = require(\"./expression/transform/max.transform.js\");\nvar _meanTransform = require(\"./expression/transform/mean.transform.js\");\nvar _minTransform = require(\"./expression/transform/min.transform.js\");\nvar _rangeTransform = require(\"./expression/transform/range.transform.js\");\nvar _rowTransform = require(\"./expression/transform/row.transform.js\");\nvar _subsetTransform = require(\"./expression/transform/subset.transform.js\");\nvar _concatTransform = require(\"./expression/transform/concat.transform.js\");\nvar _diffTransform = require(\"./expression/transform/diff.transform.js\");\nvar _stdTransform = require(\"./expression/transform/std.transform.js\");\nvar _sumTransform = require(\"./expression/transform/sum.transform.js\");\nvar _cumsumTransform = require(\"./expression/transform/cumsum.transform.js\");\nvar _varianceTransform = require(\"./expression/transform/variance.transform.js\");","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.eigs = exports.efimovFactor = exports.e = exports.dotPow = exports.dotMultiply = exports.dotDivide = exports.dot = exports.divideScalar = exports.divide = exports.distance = exports.diff = exports.diag = exports.deuteronMass = exports.det = exports.deepEqual = exports.cumsum = exports.cube = exports.ctranspose = exports.csch = exports.csc = exports.cross = exports.createUnit = exports.count = exports.coulomb = exports.coth = exports.cot = exports.cosh = exports.cos = exports.conj = exports.conductanceQuantum = exports.concat = exports.composition = exports.complex = exports.compareText = exports.compareNatural = exports.compare = exports.combinationsWithRep = exports.combinations = exports.column = exports.clone = exports.classicalElectronRadius = exports.ceil = exports.cbrt = exports.catalan = exports[\"boolean\"] = exports.boltzmann = exports.bohrRadius = exports.bohrMagneton = exports.bitXor = exports.bitOr = exports.bitNot = exports.bitAnd = exports.bin = exports.bignumber = exports.bellNumbers = exports.avogadro = exports.atomicMass = exports.atanh = exports.atan2 = exports.atan = exports.asinh = exports.asin = exports.asech = exports.asec = exports.arg = exports.apply = exports.and = exports.addScalar = exports.add = exports.acsch = exports.acsc = exports.acoth = exports.acot = exports.acosh = exports.acos = exports.abs = exports._true = exports._null = exports._false = exports._NaN = exports._Infinity = exports.Unit = exports.SparseMatrix = exports.Spa = exports.SQRT2 = exports.SQRT1_2 = exports.ResultSet = exports.Range = exports.Matrix = exports.LOG2E = exports.LOG10E = exports.LN2 = exports.LN10 = exports.Index = exports.ImmutableDenseMatrix = exports.Fraction = exports.FibonacciHeap = exports.DenseMatrix = exports.Complex = exports.BigNumber = void 0;\nexports.partitionSelect = exports.or = exports.ones = exports.oct = exports.numeric = exports.number = exports.nuclearMagneton = exports.nthRoots = exports.nthRoot = exports.not = exports.norm = exports.neutronMass = exports.multiplyScalar = exports.multiply = exports.multinomial = exports.molarVolume = exports.molarPlanckConstant = exports.molarMassC12 = exports.molarMass = exports.mode = exports.mod = exports.min = exports.median = exports.mean = exports.max = exports.matrixFromRows = exports.matrixFromFunction = exports.matrixFromColumns = exports.matrix = exports.map = exports.magneticFluxQuantum = exports.magneticConstant = exports.mad = exports.lyap = exports.lusolve = exports.lup = exports.lsolveAll = exports.lsolve = exports.loschmidt = exports.log2 = exports.log1p = exports.log10 = exports.log = exports.lgamma = exports.leftShift = exports.lcm = exports.largerEq = exports.larger = exports.kron = exports.klitzing = exports.kldivergence = exports.isZero = exports.isPrime = exports.isPositive = exports.isNumeric = exports.isNegative = exports.isNaN = exports.isInteger = exports.invmod = exports.inverseConductanceQuantum = exports.inv = exports.intersect = exports.index = exports.im = exports.ifft = exports.identity = exports.i = exports.hypot = exports.hex = exports.hasNumericValue = exports.hartreeEnergy = exports.gravity = exports.gravitationConstant = exports.getMatrixDataType = exports.gcd = exports.gasConstant = exports.gamma = exports.fraction = exports.format = exports.forEach = exports.floor = exports.flatten = exports.fix = exports.firstRadiation = exports.fineStructure = exports.filter = exports.fft = exports.fermiCoupling = exports.faraday = exports.factorial = exports.expm1 = exports.expm = exports.exp = exports.erf = exports.equalText = exports.equalScalar = exports.equal = exports.elementaryCharge = exports.electronMass = exports.electricConstant = void 0;\nexports.zeros = exports.xor = exports.xgcd = exports.wienDisplacement = exports.weakMixingAngle = exports.version = exports.variance = exports.vacuumImpedance = exports.usolveAll = exports.usolve = exports.unit = exports.unequal = exports.unaryPlus = exports.unaryMinus = exports.typed = exports.typeOf = exports.transpose = exports.trace = exports.to = exports.thomsonCrossSection = exports.tau = exports.tanh = exports.tan = exports.sylvester = exports.sum = exports.subtract = exports.subset = exports.string = exports.stirlingS2 = exports.stefanBoltzmann = exports.std = exports.squeeze = exports.square = exports.sqrtm = exports.sqrt = exports.splitUnit = exports.speedOfLight = exports.sparse = exports.sort = exports.smallerEq = exports.smaller = exports.slu = exports.size = exports.sinh = exports.sin = exports.sign = exports.setUnion = exports.setSymDifference = exports.setSize = exports.setPowerset = exports.setMultiplicity = exports.setIsSubset = exports.setIntersect = exports.setDistinct = exports.setDifference = exports.setCartesian = exports.secondRadiation = exports.sech = exports.sec = exports.schur = exports.sackurTetrode = exports.rydberg = exports.row = exports.round = exports.rotationMatrix = exports.rotate = exports.rightLogShift = exports.rightArithShift = exports.resize = exports.reshape = exports.replacer = exports.reducedPlanckConstant = exports.re = exports.range = exports.randomInt = exports.random = exports.quantumOfCirculation = exports.quantileSeq = exports.qr = exports.protonMass = exports.prod = exports.print = exports.pow = exports.polynomialRoot = exports.planckTime = exports.planckTemperature = exports.planckMass = exports.planckLength = exports.planckConstant = exports.planckCharge = exports.pinv = exports.pickRandom = exports.pi = exports.phi = exports.permutations = void 0;\nvar _configReadonly = require(\"./configReadonly.js\");\nvar _factoriesAny = require(\"../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar BigNumber = /* #__PURE__ */(0, _factoriesAny.createBigNumberClass)({\n  config: _configReadonly.config\n});\nexports.BigNumber = BigNumber;\nvar Complex = /* #__PURE__ */(0, _factoriesAny.createComplexClass)({});\nexports.Complex = Complex;\nvar e = /* #__PURE__ */(0, _factoriesAny.createE)({\n  BigNumber: BigNumber,\n  config: _configReadonly.config\n});\nexports.e = e;\nvar _false = /* #__PURE__ */(0, _factoriesAny.createFalse)({});\nexports._false = _false;\nvar fineStructure = /* #__PURE__ */(0, _factoriesAny.createFineStructure)({\n  BigNumber: BigNumber,\n  config: _configReadonly.config\n});\nexports.fineStructure = fineStructure;\nvar Fraction = /* #__PURE__ */(0, _factoriesAny.createFractionClass)({});\nexports.Fraction = Fraction;\nvar i = /* #__PURE__ */(0, _factoriesAny.createI)({\n  Complex: Complex\n});\nexports.i = i;\nvar _Infinity = /* #__PURE__ */(0, _factoriesAny.createInfinity)({\n  BigNumber: BigNumber,\n  config: _configReadonly.config\n});\nexports._Infinity = _Infinity;\nvar LN10 = /* #__PURE__ */(0, _factoriesAny.createLN10)({\n  BigNumber: BigNumber,\n  config: _configReadonly.config\n});\nexports.LN10 = LN10;\nvar LOG10E = /* #__PURE__ */(0, _factoriesAny.createLOG10E)({\n  BigNumber: BigNumber,\n  config: _configReadonly.config\n});\nexports.LOG10E = LOG10E;\nvar Matrix = /* #__PURE__ */(0, _factoriesAny.createMatrixClass)({});\nexports.Matrix = Matrix;\nvar _NaN = /* #__PURE__ */(0, _factoriesAny.createNaN)({\n  BigNumber: BigNumber,\n  config: _configReadonly.config\n});\nexports._NaN = _NaN;\nvar _null = /* #__PURE__ */(0, _factoriesAny.createNull)({});\nexports._null = _null;\nvar phi = /* #__PURE__ */(0, _factoriesAny.createPhi)({\n  BigNumber: BigNumber,\n  config: _configReadonly.config\n});\nexports.phi = phi;\nvar Range = /* #__PURE__ */(0, _factoriesAny.createRangeClass)({});\nexports.Range = Range;\nvar ResultSet = /* #__PURE__ */(0, _factoriesAny.createResultSet)({});\nexports.ResultSet = ResultSet;\nvar SQRT1_2 = /* #__PURE__ */(0, _factoriesAny.createSQRT1_2)({\n  BigNumber: BigNumber,\n  config: _configReadonly.config\n});\nexports.SQRT1_2 = SQRT1_2;\nvar sackurTetrode = /* #__PURE__ */(0, _factoriesAny.createSackurTetrode)({\n  BigNumber: BigNumber,\n  config: _configReadonly.config\n});\nexports.sackurTetrode = sackurTetrode;\nvar tau = /* #__PURE__ */(0, _factoriesAny.createTau)({\n  BigNumber: BigNumber,\n  config: _configReadonly.config\n});\nexports.tau = tau;\nvar _true = /* #__PURE__ */(0, _factoriesAny.createTrue)({});\nexports._true = _true;\nvar version = /* #__PURE__ */(0, _factoriesAny.createVersion)({});\nexports.version = version;\nvar DenseMatrix = /* #__PURE__ */(0, _factoriesAny.createDenseMatrixClass)({\n  Matrix: Matrix\n});\nexports.DenseMatrix = DenseMatrix;\nvar efimovFactor = /* #__PURE__ */(0, _factoriesAny.createEfimovFactor)({\n  BigNumber: BigNumber,\n  config: _configReadonly.config\n});\nexports.efimovFactor = efimovFactor;\nvar LN2 = /* #__PURE__ */(0, _factoriesAny.createLN2)({\n  BigNumber: BigNumber,\n  config: _configReadonly.config\n});\nexports.LN2 = LN2;\nvar pi = /* #__PURE__ */(0, _factoriesAny.createPi)({\n  BigNumber: BigNumber,\n  config: _configReadonly.config\n});\nexports.pi = pi;\nvar replacer = /* #__PURE__ */(0, _factoriesAny.createReplacer)({});\nexports.replacer = replacer;\nvar SQRT2 = /* #__PURE__ */(0, _factoriesAny.createSQRT2)({\n  BigNumber: BigNumber,\n  config: _configReadonly.config\n});\nexports.SQRT2 = SQRT2;\nvar typed = /* #__PURE__ */(0, _factoriesAny.createTyped)({\n  BigNumber: BigNumber,\n  Complex: Complex,\n  DenseMatrix: DenseMatrix,\n  Fraction: Fraction\n});\nexports.typed = typed;\nvar unaryPlus = /* #__PURE__ */(0, _factoriesAny.createUnaryPlus)({\n  BigNumber: BigNumber,\n  config: _configReadonly.config,\n  typed: typed\n});\nexports.unaryPlus = unaryPlus;\nvar weakMixingAngle = /* #__PURE__ */(0, _factoriesAny.createWeakMixingAngle)({\n  BigNumber: BigNumber,\n  config: _configReadonly.config\n});\nexports.weakMixingAngle = weakMixingAngle;\nvar abs = /* #__PURE__ */(0, _factoriesAny.createAbs)({\n  typed: typed\n});\nexports.abs = abs;\nvar acos = /* #__PURE__ */(0, _factoriesAny.createAcos)({\n  Complex: Complex,\n  config: _configReadonly.config,\n  typed: typed\n});\nexports.acos = acos;\nvar acot = /* #__PURE__ */(0, _factoriesAny.createAcot)({\n  BigNumber: BigNumber,\n  typed: typed\n});\nexports.acot = acot;\nvar acsc = /* #__PURE__ */(0, _factoriesAny.createAcsc)({\n  BigNumber: BigNumber,\n  Complex: Complex,\n  config: _configReadonly.config,\n  typed: typed\n});\nexports.acsc = acsc;\nvar addScalar = /* #__PURE__ */(0, _factoriesAny.createAddScalar)({\n  typed: typed\n});\nexports.addScalar = addScalar;\nvar arg = /* #__PURE__ */(0, _factoriesAny.createArg)({\n  typed: typed\n});\nexports.arg = arg;\nvar asech = /* #__PURE__ */(0, _factoriesAny.createAsech)({\n  BigNumber: BigNumber,\n  Complex: Complex,\n  config: _configReadonly.config,\n  typed: typed\n});\nexports.asech = asech;\nvar asinh = /* #__PURE__ */(0, _factoriesAny.createAsinh)({\n  typed: typed\n});\nexports.asinh = asinh;\nvar atan = /* #__PURE__ */(0, _factoriesAny.createAtan)({\n  typed: typed\n});\nexports.atan = atan;\nvar atanh = /* #__PURE__ */(0, _factoriesAny.createAtanh)({\n  Complex: Complex,\n  config: _configReadonly.config,\n  typed: typed\n});\nexports.atanh = atanh;\nvar bignumber = /* #__PURE__ */(0, _factoriesAny.createBignumber)({\n  BigNumber: BigNumber,\n  typed: typed\n});\nexports.bignumber = bignumber;\nvar bitNot = /* #__PURE__ */(0, _factoriesAny.createBitNot)({\n  typed: typed\n});\nexports.bitNot = bitNot;\nvar _boolean = /* #__PURE__ */(0, _factoriesAny.createBoolean)({\n  typed: typed\n});\nexports[\"boolean\"] = _boolean;\nvar clone = /* #__PURE__ */(0, _factoriesAny.createClone)({\n  typed: typed\n});\nexports.clone = clone;\nvar combinations = /* #__PURE__ */(0, _factoriesAny.createCombinations)({\n  typed: typed\n});\nexports.combinations = combinations;\nvar complex = /* #__PURE__ */(0, _factoriesAny.createComplex)({\n  Complex: Complex,\n  typed: typed\n});\nexports.complex = complex;\nvar conj = /* #__PURE__ */(0, _factoriesAny.createConj)({\n  typed: typed\n});\nexports.conj = conj;\nvar cosh = /* #__PURE__ */(0, _factoriesAny.createCosh)({\n  typed: typed\n});\nexports.cosh = cosh;\nvar coth = /* #__PURE__ */(0, _factoriesAny.createCoth)({\n  BigNumber: BigNumber,\n  typed: typed\n});\nexports.coth = coth;\nvar csc = /* #__PURE__ */(0, _factoriesAny.createCsc)({\n  BigNumber: BigNumber,\n  typed: typed\n});\nexports.csc = csc;\nvar cube = /* #__PURE__ */(0, _factoriesAny.createCube)({\n  typed: typed\n});\nexports.cube = cube;\nvar equalScalar = /* #__PURE__ */(0, _factoriesAny.createEqualScalar)({\n  config: _configReadonly.config,\n  typed: typed\n});\nexports.equalScalar = equalScalar;\nvar erf = /* #__PURE__ */(0, _factoriesAny.createErf)({\n  typed: typed\n});\nexports.erf = erf;\nvar exp = /* #__PURE__ */(0, _factoriesAny.createExp)({\n  typed: typed\n});\nexports.exp = exp;\nvar expm1 = /* #__PURE__ */(0, _factoriesAny.createExpm1)({\n  Complex: Complex,\n  typed: typed\n});\nexports.expm1 = expm1;\nvar filter = /* #__PURE__ */(0, _factoriesAny.createFilter)({\n  typed: typed\n});\nexports.filter = filter;\nvar forEach = /* #__PURE__ */(0, _factoriesAny.createForEach)({\n  typed: typed\n});\nexports.forEach = forEach;\nvar format = /* #__PURE__ */(0, _factoriesAny.createFormat)({\n  typed: typed\n});\nexports.format = format;\nvar getMatrixDataType = /* #__PURE__ */(0, _factoriesAny.createGetMatrixDataType)({\n  typed: typed\n});\nexports.getMatrixDataType = getMatrixDataType;\nvar hex = /* #__PURE__ */(0, _factoriesAny.createHex)({\n  format: format,\n  typed: typed\n});\nexports.hex = hex;\nvar im = /* #__PURE__ */(0, _factoriesAny.createIm)({\n  typed: typed\n});\nexports.im = im;\nvar isInteger = /* #__PURE__ */(0, _factoriesAny.createIsInteger)({\n  typed: typed\n});\nexports.isInteger = isInteger;\nvar isNegative = /* #__PURE__ */(0, _factoriesAny.createIsNegative)({\n  typed: typed\n});\nexports.isNegative = isNegative;\nvar isPositive = /* #__PURE__ */(0, _factoriesAny.createIsPositive)({\n  typed: typed\n});\nexports.isPositive = isPositive;\nvar isZero = /* #__PURE__ */(0, _factoriesAny.createIsZero)({\n  typed: typed\n});\nexports.isZero = isZero;\nvar LOG2E = /* #__PURE__ */(0, _factoriesAny.createLOG2E)({\n  BigNumber: BigNumber,\n  config: _configReadonly.config\n});\nexports.LOG2E = LOG2E;\nvar lgamma = /* #__PURE__ */(0, _factoriesAny.createLgamma)({\n  Complex: Complex,\n  typed: typed\n});\nexports.lgamma = lgamma;\nvar log10 = /* #__PURE__ */(0, _factoriesAny.createLog10)({\n  Complex: Complex,\n  config: _configReadonly.config,\n  typed: typed\n});\nexports.log10 = log10;\nvar log2 = /* #__PURE__ */(0, _factoriesAny.createLog2)({\n  Complex: Complex,\n  config: _configReadonly.config,\n  typed: typed\n});\nexports.log2 = log2;\nvar map = /* #__PURE__ */(0, _factoriesAny.createMap)({\n  typed: typed\n});\nexports.map = map;\nvar multiplyScalar = /* #__PURE__ */(0, _factoriesAny.createMultiplyScalar)({\n  typed: typed\n});\nexports.multiplyScalar = multiplyScalar;\nvar not = /* #__PURE__ */(0, _factoriesAny.createNot)({\n  typed: typed\n});\nexports.not = not;\nvar number = /* #__PURE__ */(0, _factoriesAny.createNumber)({\n  typed: typed\n});\nexports.number = number;\nvar oct = /* #__PURE__ */(0, _factoriesAny.createOct)({\n  format: format,\n  typed: typed\n});\nexports.oct = oct;\nvar pickRandom = /* #__PURE__ */(0, _factoriesAny.createPickRandom)({\n  config: _configReadonly.config,\n  typed: typed\n});\nexports.pickRandom = pickRandom;\nvar print = /* #__PURE__ */(0, _factoriesAny.createPrint)({\n  typed: typed\n});\nexports.print = print;\nvar random = /* #__PURE__ */(0, _factoriesAny.createRandom)({\n  config: _configReadonly.config,\n  typed: typed\n});\nexports.random = random;\nvar re = /* #__PURE__ */(0, _factoriesAny.createRe)({\n  typed: typed\n});\nexports.re = re;\nvar sec = /* #__PURE__ */(0, _factoriesAny.createSec)({\n  BigNumber: BigNumber,\n  typed: typed\n});\nexports.sec = sec;\nvar sign = /* #__PURE__ */(0, _factoriesAny.createSign)({\n  BigNumber: BigNumber,\n  Fraction: Fraction,\n  complex: complex,\n  typed: typed\n});\nexports.sign = sign;\nvar sin = /* #__PURE__ */(0, _factoriesAny.createSin)({\n  typed: typed\n});\nexports.sin = sin;\nvar SparseMatrix = /* #__PURE__ */(0, _factoriesAny.createSparseMatrixClass)({\n  Matrix: Matrix,\n  equalScalar: equalScalar,\n  typed: typed\n});\nexports.SparseMatrix = SparseMatrix;\nvar splitUnit = /* #__PURE__ */(0, _factoriesAny.createSplitUnit)({\n  typed: typed\n});\nexports.splitUnit = splitUnit;\nvar square = /* #__PURE__ */(0, _factoriesAny.createSquare)({\n  typed: typed\n});\nexports.square = square;\nvar string = /* #__PURE__ */(0, _factoriesAny.createString)({\n  typed: typed\n});\nexports.string = string;\nvar tan = /* #__PURE__ */(0, _factoriesAny.createTan)({\n  typed: typed\n});\nexports.tan = tan;\nvar typeOf = /* #__PURE__ */(0, _factoriesAny.createTypeOf)({\n  typed: typed\n});\nexports.typeOf = typeOf;\nvar acosh = /* #__PURE__ */(0, _factoriesAny.createAcosh)({\n  Complex: Complex,\n  config: _configReadonly.config,\n  typed: typed\n});\nexports.acosh = acosh;\nvar acsch = /* #__PURE__ */(0, _factoriesAny.createAcsch)({\n  BigNumber: BigNumber,\n  typed: typed\n});\nexports.acsch = acsch;\nvar apply = /* #__PURE__ */(0, _factoriesAny.createApply)({\n  isInteger: isInteger,\n  typed: typed\n});\nexports.apply = apply;\nvar asec = /* #__PURE__ */(0, _factoriesAny.createAsec)({\n  BigNumber: BigNumber,\n  Complex: Complex,\n  config: _configReadonly.config,\n  typed: typed\n});\nexports.asec = asec;\nvar bin = /* #__PURE__ */(0, _factoriesAny.createBin)({\n  format: format,\n  typed: typed\n});\nexports.bin = bin;\nvar combinationsWithRep = /* #__PURE__ */(0, _factoriesAny.createCombinationsWithRep)({\n  typed: typed\n});\nexports.combinationsWithRep = combinationsWithRep;\nvar cos = /* #__PURE__ */(0, _factoriesAny.createCos)({\n  typed: typed\n});\nexports.cos = cos;\nvar csch = /* #__PURE__ */(0, _factoriesAny.createCsch)({\n  BigNumber: BigNumber,\n  typed: typed\n});\nexports.csch = csch;\nvar isNaN = /* #__PURE__ */(0, _factoriesAny.createIsNaN)({\n  typed: typed\n});\nexports.isNaN = isNaN;\nvar isPrime = /* #__PURE__ */(0, _factoriesAny.createIsPrime)({\n  typed: typed\n});\nexports.isPrime = isPrime;\nvar randomInt = /* #__PURE__ */(0, _factoriesAny.createRandomInt)({\n  config: _configReadonly.config,\n  typed: typed\n});\nexports.randomInt = randomInt;\nvar sech = /* #__PURE__ */(0, _factoriesAny.createSech)({\n  BigNumber: BigNumber,\n  typed: typed\n});\nexports.sech = sech;\nvar sinh = /* #__PURE__ */(0, _factoriesAny.createSinh)({\n  typed: typed\n});\nexports.sinh = sinh;\nvar sparse = /* #__PURE__ */(0, _factoriesAny.createSparse)({\n  SparseMatrix: SparseMatrix,\n  typed: typed\n});\nexports.sparse = sparse;\nvar sqrt = /* #__PURE__ */(0, _factoriesAny.createSqrt)({\n  Complex: Complex,\n  config: _configReadonly.config,\n  typed: typed\n});\nexports.sqrt = sqrt;\nvar tanh = /* #__PURE__ */(0, _factoriesAny.createTanh)({\n  typed: typed\n});\nexports.tanh = tanh;\nvar unaryMinus = /* #__PURE__ */(0, _factoriesAny.createUnaryMinus)({\n  typed: typed\n});\nexports.unaryMinus = unaryMinus;\nvar acoth = /* #__PURE__ */(0, _factoriesAny.createAcoth)({\n  BigNumber: BigNumber,\n  Complex: Complex,\n  config: _configReadonly.config,\n  typed: typed\n});\nexports.acoth = acoth;\nvar cot = /* #__PURE__ */(0, _factoriesAny.createCot)({\n  BigNumber: BigNumber,\n  typed: typed\n});\nexports.cot = cot;\nvar fraction = /* #__PURE__ */(0, _factoriesAny.createFraction)({\n  Fraction: Fraction,\n  typed: typed\n});\nexports.fraction = fraction;\nvar isNumeric = /* #__PURE__ */(0, _factoriesAny.createIsNumeric)({\n  typed: typed\n});\nexports.isNumeric = isNumeric;\nvar matrix = /* #__PURE__ */(0, _factoriesAny.createMatrix)({\n  DenseMatrix: DenseMatrix,\n  Matrix: Matrix,\n  SparseMatrix: SparseMatrix,\n  typed: typed\n});\nexports.matrix = matrix;\nvar matrixFromFunction = /* #__PURE__ */(0, _factoriesAny.createMatrixFromFunction)({\n  isZero: isZero,\n  matrix: matrix,\n  typed: typed\n});\nexports.matrixFromFunction = matrixFromFunction;\nvar mode = /* #__PURE__ */(0, _factoriesAny.createMode)({\n  isNaN: isNaN,\n  isNumeric: isNumeric,\n  typed: typed\n});\nexports.mode = mode;\nvar numeric = /* #__PURE__ */(0, _factoriesAny.createNumeric)({\n  bignumber: bignumber,\n  fraction: fraction,\n  number: number\n});\nexports.numeric = numeric;\nvar prod = /* #__PURE__ */(0, _factoriesAny.createProd)({\n  config: _configReadonly.config,\n  multiplyScalar: multiplyScalar,\n  numeric: numeric,\n  typed: typed\n});\nexports.prod = prod;\nvar reshape = /* #__PURE__ */(0, _factoriesAny.createReshape)({\n  isInteger: isInteger,\n  matrix: matrix,\n  typed: typed\n});\nexports.reshape = reshape;\nvar size = /* #__PURE__ */(0, _factoriesAny.createSize)({\n  matrix: matrix,\n  config: _configReadonly.config,\n  typed: typed\n});\nexports.size = size;\nvar squeeze = /* #__PURE__ */(0, _factoriesAny.createSqueeze)({\n  matrix: matrix,\n  typed: typed\n});\nexports.squeeze = squeeze;\nvar subset = /* #__PURE__ */(0, _factoriesAny.createSubset)({\n  matrix: matrix,\n  typed: typed\n});\nexports.subset = subset;\nvar transpose = /* #__PURE__ */(0, _factoriesAny.createTranspose)({\n  matrix: matrix,\n  typed: typed\n});\nexports.transpose = transpose;\nvar xgcd = /* #__PURE__ */(0, _factoriesAny.createXgcd)({\n  BigNumber: BigNumber,\n  config: _configReadonly.config,\n  matrix: matrix,\n  typed: typed\n});\nexports.xgcd = xgcd;\nvar zeros = /* #__PURE__ */(0, _factoriesAny.createZeros)({\n  BigNumber: BigNumber,\n  config: _configReadonly.config,\n  matrix: matrix,\n  typed: typed\n});\nexports.zeros = zeros;\nvar asin = /* #__PURE__ */(0, _factoriesAny.createAsin)({\n  Complex: Complex,\n  config: _configReadonly.config,\n  typed: typed\n});\nexports.asin = asin;\nvar cbrt = /* #__PURE__ */(0, _factoriesAny.createCbrt)({\n  BigNumber: BigNumber,\n  Complex: Complex,\n  Fraction: Fraction,\n  config: _configReadonly.config,\n  isNegative: isNegative,\n  matrix: matrix,\n  typed: typed,\n  unaryMinus: unaryMinus\n});\nexports.cbrt = cbrt;\nvar concat = /* #__PURE__ */(0, _factoriesAny.createConcat)({\n  isInteger: isInteger,\n  matrix: matrix,\n  typed: typed\n});\nexports.concat = concat;\nvar count = /* #__PURE__ */(0, _factoriesAny.createCount)({\n  prod: prod,\n  size: size,\n  typed: typed\n});\nexports.count = count;\nvar ctranspose = /* #__PURE__ */(0, _factoriesAny.createCtranspose)({\n  conj: conj,\n  transpose: transpose,\n  typed: typed\n});\nexports.ctranspose = ctranspose;\nvar diag = /* #__PURE__ */(0, _factoriesAny.createDiag)({\n  DenseMatrix: DenseMatrix,\n  SparseMatrix: SparseMatrix,\n  matrix: matrix,\n  typed: typed\n});\nexports.diag = diag;\nvar divideScalar = /* #__PURE__ */(0, _factoriesAny.createDivideScalar)({\n  numeric: numeric,\n  typed: typed\n});\nexports.divideScalar = divideScalar;\nvar dotDivide = /* #__PURE__ */(0, _factoriesAny.createDotDivide)({\n  DenseMatrix: DenseMatrix,\n  concat: concat,\n  divideScalar: divideScalar,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  typed: typed\n});\nexports.dotDivide = dotDivide;\nvar equal = /* #__PURE__ */(0, _factoriesAny.createEqual)({\n  DenseMatrix: DenseMatrix,\n  concat: concat,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  typed: typed\n});\nexports.equal = equal;\nvar flatten = /* #__PURE__ */(0, _factoriesAny.createFlatten)({\n  matrix: matrix,\n  typed: typed\n});\nexports.flatten = flatten;\nvar gcd = /* #__PURE__ */(0, _factoriesAny.createGcd)({\n  BigNumber: BigNumber,\n  DenseMatrix: DenseMatrix,\n  concat: concat,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  typed: typed\n});\nexports.gcd = gcd;\nvar hasNumericValue = /* #__PURE__ */(0, _factoriesAny.createHasNumericValue)({\n  isNumeric: isNumeric,\n  typed: typed\n});\nexports.hasNumericValue = hasNumericValue;\nvar identity = /* #__PURE__ */(0, _factoriesAny.createIdentity)({\n  BigNumber: BigNumber,\n  DenseMatrix: DenseMatrix,\n  SparseMatrix: SparseMatrix,\n  config: _configReadonly.config,\n  matrix: matrix,\n  typed: typed\n});\nexports.identity = identity;\nvar kron = /* #__PURE__ */(0, _factoriesAny.createKron)({\n  matrix: matrix,\n  multiplyScalar: multiplyScalar,\n  typed: typed\n});\nexports.kron = kron;\nvar largerEq = /* #__PURE__ */(0, _factoriesAny.createLargerEq)({\n  DenseMatrix: DenseMatrix,\n  concat: concat,\n  config: _configReadonly.config,\n  matrix: matrix,\n  typed: typed\n});\nexports.largerEq = largerEq;\nvar leftShift = /* #__PURE__ */(0, _factoriesAny.createLeftShift)({\n  DenseMatrix: DenseMatrix,\n  concat: concat,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  typed: typed,\n  zeros: zeros\n});\nexports.leftShift = leftShift;\nvar matrixFromColumns = /* #__PURE__ */(0, _factoriesAny.createMatrixFromColumns)({\n  flatten: flatten,\n  matrix: matrix,\n  size: size,\n  typed: typed\n});\nexports.matrixFromColumns = matrixFromColumns;\nvar mod = /* #__PURE__ */(0, _factoriesAny.createMod)({\n  DenseMatrix: DenseMatrix,\n  concat: concat,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  typed: typed\n});\nexports.mod = mod;\nvar nthRoot = /* #__PURE__ */(0, _factoriesAny.createNthRoot)({\n  BigNumber: BigNumber,\n  concat: concat,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  typed: typed\n});\nexports.nthRoot = nthRoot;\nvar ones = /* #__PURE__ */(0, _factoriesAny.createOnes)({\n  BigNumber: BigNumber,\n  config: _configReadonly.config,\n  matrix: matrix,\n  typed: typed\n});\nexports.ones = ones;\nvar resize = /* #__PURE__ */(0, _factoriesAny.createResize)({\n  config: _configReadonly.config,\n  matrix: matrix\n});\nexports.resize = resize;\nvar rightArithShift = /* #__PURE__ */(0, _factoriesAny.createRightArithShift)({\n  DenseMatrix: DenseMatrix,\n  concat: concat,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  typed: typed,\n  zeros: zeros\n});\nexports.rightArithShift = rightArithShift;\nvar round = /* #__PURE__ */(0, _factoriesAny.createRound)({\n  BigNumber: BigNumber,\n  DenseMatrix: DenseMatrix,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  typed: typed,\n  zeros: zeros\n});\nexports.round = round;\nvar smaller = /* #__PURE__ */(0, _factoriesAny.createSmaller)({\n  DenseMatrix: DenseMatrix,\n  concat: concat,\n  config: _configReadonly.config,\n  matrix: matrix,\n  typed: typed\n});\nexports.smaller = smaller;\nvar to = /* #__PURE__ */(0, _factoriesAny.createTo)({\n  concat: concat,\n  matrix: matrix,\n  typed: typed\n});\nexports.to = to;\nvar unequal = /* #__PURE__ */(0, _factoriesAny.createUnequal)({\n  DenseMatrix: DenseMatrix,\n  concat: concat,\n  config: _configReadonly.config,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  typed: typed\n});\nexports.unequal = unequal;\nvar xor = /* #__PURE__ */(0, _factoriesAny.createXor)({\n  DenseMatrix: DenseMatrix,\n  concat: concat,\n  matrix: matrix,\n  typed: typed\n});\nexports.xor = xor;\nvar add = /* #__PURE__ */(0, _factoriesAny.createAdd)({\n  DenseMatrix: DenseMatrix,\n  SparseMatrix: SparseMatrix,\n  addScalar: addScalar,\n  concat: concat,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  typed: typed\n});\nexports.add = add;\nvar bitAnd = /* #__PURE__ */(0, _factoriesAny.createBitAnd)({\n  concat: concat,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  typed: typed\n});\nexports.bitAnd = bitAnd;\nvar bitXor = /* #__PURE__ */(0, _factoriesAny.createBitXor)({\n  DenseMatrix: DenseMatrix,\n  concat: concat,\n  matrix: matrix,\n  typed: typed\n});\nexports.bitXor = bitXor;\nvar catalan = /* #__PURE__ */(0, _factoriesAny.createCatalan)({\n  addScalar: addScalar,\n  combinations: combinations,\n  divideScalar: divideScalar,\n  isInteger: isInteger,\n  isNegative: isNegative,\n  multiplyScalar: multiplyScalar,\n  typed: typed\n});\nexports.catalan = catalan;\nvar compare = /* #__PURE__ */(0, _factoriesAny.createCompare)({\n  BigNumber: BigNumber,\n  DenseMatrix: DenseMatrix,\n  Fraction: Fraction,\n  concat: concat,\n  config: _configReadonly.config,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  typed: typed\n});\nexports.compare = compare;\nvar compareText = /* #__PURE__ */(0, _factoriesAny.createCompareText)({\n  concat: concat,\n  matrix: matrix,\n  typed: typed\n});\nexports.compareText = compareText;\nvar cumsum = /* #__PURE__ */(0, _factoriesAny.createCumSum)({\n  add: add,\n  typed: typed,\n  unaryPlus: unaryPlus\n});\nexports.cumsum = cumsum;\nvar deepEqual = /* #__PURE__ */(0, _factoriesAny.createDeepEqual)({\n  equal: equal,\n  typed: typed\n});\nexports.deepEqual = deepEqual;\nvar dot = /* #__PURE__ */(0, _factoriesAny.createDot)({\n  addScalar: addScalar,\n  conj: conj,\n  multiplyScalar: multiplyScalar,\n  size: size,\n  typed: typed\n});\nexports.dot = dot;\nvar equalText = /* #__PURE__ */(0, _factoriesAny.createEqualText)({\n  compareText: compareText,\n  isZero: isZero,\n  typed: typed\n});\nexports.equalText = equalText;\nvar floor = /* #__PURE__ */(0, _factoriesAny.createFloor)({\n  DenseMatrix: DenseMatrix,\n  config: _configReadonly.config,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  round: round,\n  typed: typed,\n  zeros: zeros\n});\nexports.floor = floor;\nvar hypot = /* #__PURE__ */(0, _factoriesAny.createHypot)({\n  abs: abs,\n  addScalar: addScalar,\n  divideScalar: divideScalar,\n  isPositive: isPositive,\n  multiplyScalar: multiplyScalar,\n  smaller: smaller,\n  sqrt: sqrt,\n  typed: typed\n});\nexports.hypot = hypot;\nvar ImmutableDenseMatrix = /* #__PURE__ */(0, _factoriesAny.createImmutableDenseMatrixClass)({\n  DenseMatrix: DenseMatrix,\n  smaller: smaller\n});\nexports.ImmutableDenseMatrix = ImmutableDenseMatrix;\nvar Index = /* #__PURE__ */(0, _factoriesAny.createIndexClass)({\n  ImmutableDenseMatrix: ImmutableDenseMatrix\n});\nexports.Index = Index;\nvar invmod = /* #__PURE__ */(0, _factoriesAny.createInvmod)({\n  BigNumber: BigNumber,\n  add: add,\n  config: _configReadonly.config,\n  equal: equal,\n  isInteger: isInteger,\n  mod: mod,\n  smaller: smaller,\n  typed: typed,\n  xgcd: xgcd\n});\nexports.invmod = invmod;\nvar larger = /* #__PURE__ */(0, _factoriesAny.createLarger)({\n  DenseMatrix: DenseMatrix,\n  concat: concat,\n  config: _configReadonly.config,\n  matrix: matrix,\n  typed: typed\n});\nexports.larger = larger;\nvar log = /* #__PURE__ */(0, _factoriesAny.createLog)({\n  Complex: Complex,\n  config: _configReadonly.config,\n  divideScalar: divideScalar,\n  typed: typed\n});\nexports.log = log;\nvar matrixFromRows = /* #__PURE__ */(0, _factoriesAny.createMatrixFromRows)({\n  flatten: flatten,\n  matrix: matrix,\n  size: size,\n  typed: typed\n});\nexports.matrixFromRows = matrixFromRows;\nvar min = /* #__PURE__ */(0, _factoriesAny.createMin)({\n  config: _configReadonly.config,\n  numeric: numeric,\n  smaller: smaller,\n  typed: typed\n});\nexports.min = min;\nvar multiply = /* #__PURE__ */(0, _factoriesAny.createMultiply)({\n  addScalar: addScalar,\n  dot: dot,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  multiplyScalar: multiplyScalar,\n  typed: typed\n});\nexports.multiply = multiply;\nvar nthRoots = /* #__PURE__ */(0, _factoriesAny.createNthRoots)({\n  Complex: Complex,\n  config: _configReadonly.config,\n  divideScalar: divideScalar,\n  typed: typed\n});\nexports.nthRoots = nthRoots;\nvar or = /* #__PURE__ */(0, _factoriesAny.createOr)({\n  DenseMatrix: DenseMatrix,\n  concat: concat,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  typed: typed\n});\nexports.or = or;\nvar partitionSelect = /* #__PURE__ */(0, _factoriesAny.createPartitionSelect)({\n  compare: compare,\n  isNaN: isNaN,\n  isNumeric: isNumeric,\n  typed: typed\n});\nexports.partitionSelect = partitionSelect;\nvar quantileSeq = /* #__PURE__ */(0, _factoriesAny.createQuantileSeq)({\n  add: add,\n  compare: compare,\n  multiply: multiply,\n  partitionSelect: partitionSelect,\n  typed: typed\n});\nexports.quantileSeq = quantileSeq;\nvar rightLogShift = /* #__PURE__ */(0, _factoriesAny.createRightLogShift)({\n  DenseMatrix: DenseMatrix,\n  concat: concat,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  typed: typed,\n  zeros: zeros\n});\nexports.rightLogShift = rightLogShift;\nvar smallerEq = /* #__PURE__ */(0, _factoriesAny.createSmallerEq)({\n  DenseMatrix: DenseMatrix,\n  concat: concat,\n  config: _configReadonly.config,\n  matrix: matrix,\n  typed: typed\n});\nexports.smallerEq = smallerEq;\nvar subtract = /* #__PURE__ */(0, _factoriesAny.createSubtract)({\n  DenseMatrix: DenseMatrix,\n  addScalar: addScalar,\n  concat: concat,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  typed: typed,\n  unaryMinus: unaryMinus\n});\nexports.subtract = subtract;\nvar trace = /* #__PURE__ */(0, _factoriesAny.createTrace)({\n  add: add,\n  matrix: matrix,\n  typed: typed\n});\nexports.trace = trace;\nvar usolve = /* #__PURE__ */(0, _factoriesAny.createUsolve)({\n  DenseMatrix: DenseMatrix,\n  divideScalar: divideScalar,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  multiplyScalar: multiplyScalar,\n  subtract: subtract,\n  typed: typed\n});\nexports.usolve = usolve;\nvar and = /* #__PURE__ */(0, _factoriesAny.createAnd)({\n  concat: concat,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  not: not,\n  typed: typed,\n  zeros: zeros\n});\nexports.and = and;\nvar bitOr = /* #__PURE__ */(0, _factoriesAny.createBitOr)({\n  DenseMatrix: DenseMatrix,\n  concat: concat,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  typed: typed\n});\nexports.bitOr = bitOr;\nvar ceil = /* #__PURE__ */(0, _factoriesAny.createCeil)({\n  DenseMatrix: DenseMatrix,\n  config: _configReadonly.config,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  round: round,\n  typed: typed,\n  zeros: zeros\n});\nexports.ceil = ceil;\nvar compareNatural = /* #__PURE__ */(0, _factoriesAny.createCompareNatural)({\n  compare: compare,\n  typed: typed\n});\nexports.compareNatural = compareNatural;\nvar composition = /* #__PURE__ */(0, _factoriesAny.createComposition)({\n  addScalar: addScalar,\n  combinations: combinations,\n  isInteger: isInteger,\n  isNegative: isNegative,\n  isPositive: isPositive,\n  larger: larger,\n  typed: typed\n});\nexports.composition = composition;\nvar cross = /* #__PURE__ */(0, _factoriesAny.createCross)({\n  matrix: matrix,\n  multiply: multiply,\n  subtract: subtract,\n  typed: typed\n});\nexports.cross = cross;\nvar det = /* #__PURE__ */(0, _factoriesAny.createDet)({\n  divideScalar: divideScalar,\n  isZero: isZero,\n  matrix: matrix,\n  multiply: multiply,\n  subtract: subtract,\n  typed: typed,\n  unaryMinus: unaryMinus\n});\nexports.det = det;\nvar diff = /* #__PURE__ */(0, _factoriesAny.createDiff)({\n  matrix: matrix,\n  number: number,\n  subtract: subtract,\n  typed: typed\n});\nexports.diff = diff;\nvar distance = /* #__PURE__ */(0, _factoriesAny.createDistance)({\n  abs: abs,\n  addScalar: addScalar,\n  divideScalar: divideScalar,\n  multiplyScalar: multiplyScalar,\n  sqrt: sqrt,\n  subtract: subtract,\n  typed: typed,\n  unaryMinus: unaryMinus\n});\nexports.distance = distance;\nvar dotMultiply = /* #__PURE__ */(0, _factoriesAny.createDotMultiply)({\n  concat: concat,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  multiplyScalar: multiplyScalar,\n  typed: typed\n});\nexports.dotMultiply = dotMultiply;\nvar FibonacciHeap = /* #__PURE__ */(0, _factoriesAny.createFibonacciHeapClass)({\n  larger: larger,\n  smaller: smaller\n});\nexports.FibonacciHeap = FibonacciHeap;\nvar fix = /* #__PURE__ */(0, _factoriesAny.createFix)({\n  Complex: Complex,\n  DenseMatrix: DenseMatrix,\n  ceil: ceil,\n  equalScalar: equalScalar,\n  floor: floor,\n  matrix: matrix,\n  typed: typed,\n  zeros: zeros\n});\nexports.fix = fix;\nvar index = /* #__PURE__ */(0, _factoriesAny.createIndex)({\n  Index: Index,\n  typed: typed\n});\nexports.index = index;\nvar intersect = /* #__PURE__ */(0, _factoriesAny.createIntersect)({\n  abs: abs,\n  add: add,\n  addScalar: addScalar,\n  config: _configReadonly.config,\n  divideScalar: divideScalar,\n  equalScalar: equalScalar,\n  flatten: flatten,\n  isNumeric: isNumeric,\n  isZero: isZero,\n  matrix: matrix,\n  multiply: multiply,\n  multiplyScalar: multiplyScalar,\n  smaller: smaller,\n  subtract: subtract,\n  typed: typed\n});\nexports.intersect = intersect;\nvar lcm = /* #__PURE__ */(0, _factoriesAny.createLcm)({\n  concat: concat,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  typed: typed\n});\nexports.lcm = lcm;\nvar log1p = /* #__PURE__ */(0, _factoriesAny.createLog1p)({\n  Complex: Complex,\n  config: _configReadonly.config,\n  divideScalar: divideScalar,\n  log: log,\n  typed: typed\n});\nexports.log1p = log1p;\nvar lsolve = /* #__PURE__ */(0, _factoriesAny.createLsolve)({\n  DenseMatrix: DenseMatrix,\n  divideScalar: divideScalar,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  multiplyScalar: multiplyScalar,\n  subtract: subtract,\n  typed: typed\n});\nexports.lsolve = lsolve;\nvar max = /* #__PURE__ */(0, _factoriesAny.createMax)({\n  config: _configReadonly.config,\n  larger: larger,\n  numeric: numeric,\n  typed: typed\n});\nexports.max = max;\nvar qr = /* #__PURE__ */(0, _factoriesAny.createQr)({\n  addScalar: addScalar,\n  complex: complex,\n  conj: conj,\n  divideScalar: divideScalar,\n  equal: equal,\n  identity: identity,\n  isZero: isZero,\n  matrix: matrix,\n  multiplyScalar: multiplyScalar,\n  sign: sign,\n  sqrt: sqrt,\n  subtract: subtract,\n  typed: typed,\n  unaryMinus: unaryMinus,\n  zeros: zeros\n});\nexports.qr = qr;\nvar range = /* #__PURE__ */(0, _factoriesAny.createRange)({\n  bignumber: bignumber,\n  matrix: matrix,\n  config: _configReadonly.config,\n  larger: larger,\n  largerEq: largerEq,\n  smaller: smaller,\n  smallerEq: smallerEq,\n  typed: typed\n});\nexports.range = range;\nvar row = /* #__PURE__ */(0, _factoriesAny.createRow)({\n  Index: Index,\n  matrix: matrix,\n  range: range,\n  typed: typed\n});\nexports.row = row;\nvar setCartesian = /* #__PURE__ */(0, _factoriesAny.createSetCartesian)({\n  DenseMatrix: DenseMatrix,\n  Index: Index,\n  compareNatural: compareNatural,\n  size: size,\n  subset: subset,\n  typed: typed\n});\nexports.setCartesian = setCartesian;\nvar setDistinct = /* #__PURE__ */(0, _factoriesAny.createSetDistinct)({\n  DenseMatrix: DenseMatrix,\n  Index: Index,\n  compareNatural: compareNatural,\n  size: size,\n  subset: subset,\n  typed: typed\n});\nexports.setDistinct = setDistinct;\nvar setIsSubset = /* #__PURE__ */(0, _factoriesAny.createSetIsSubset)({\n  Index: Index,\n  compareNatural: compareNatural,\n  size: size,\n  subset: subset,\n  typed: typed\n});\nexports.setIsSubset = setIsSubset;\nvar setPowerset = /* #__PURE__ */(0, _factoriesAny.createSetPowerset)({\n  Index: Index,\n  compareNatural: compareNatural,\n  size: size,\n  subset: subset,\n  typed: typed\n});\nexports.setPowerset = setPowerset;\nvar slu = /* #__PURE__ */(0, _factoriesAny.createSlu)({\n  SparseMatrix: SparseMatrix,\n  abs: abs,\n  add: add,\n  divideScalar: divideScalar,\n  larger: larger,\n  largerEq: largerEq,\n  multiply: multiply,\n  subtract: subtract,\n  transpose: transpose,\n  typed: typed\n});\nexports.slu = slu;\nvar Spa = /* #__PURE__ */(0, _factoriesAny.createSpaClass)({\n  FibonacciHeap: FibonacciHeap,\n  addScalar: addScalar,\n  equalScalar: equalScalar\n});\nexports.Spa = Spa;\nvar sum = /* #__PURE__ */(0, _factoriesAny.createSum)({\n  add: add,\n  config: _configReadonly.config,\n  numeric: numeric,\n  typed: typed\n});\nexports.sum = sum;\nvar usolveAll = /* #__PURE__ */(0, _factoriesAny.createUsolveAll)({\n  DenseMatrix: DenseMatrix,\n  divideScalar: divideScalar,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  multiplyScalar: multiplyScalar,\n  subtract: subtract,\n  typed: typed\n});\nexports.usolveAll = usolveAll;\nvar atan2 = /* #__PURE__ */(0, _factoriesAny.createAtan2)({\n  BigNumber: BigNumber,\n  DenseMatrix: DenseMatrix,\n  concat: concat,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  typed: typed\n});\nexports.atan2 = atan2;\nvar column = /* #__PURE__ */(0, _factoriesAny.createColumn)({\n  Index: Index,\n  matrix: matrix,\n  range: range,\n  typed: typed\n});\nexports.column = column;\nvar lsolveAll = /* #__PURE__ */(0, _factoriesAny.createLsolveAll)({\n  DenseMatrix: DenseMatrix,\n  divideScalar: divideScalar,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  multiplyScalar: multiplyScalar,\n  subtract: subtract,\n  typed: typed\n});\nexports.lsolveAll = lsolveAll;\nvar setDifference = /* #__PURE__ */(0, _factoriesAny.createSetDifference)({\n  DenseMatrix: DenseMatrix,\n  Index: Index,\n  compareNatural: compareNatural,\n  size: size,\n  subset: subset,\n  typed: typed\n});\nexports.setDifference = setDifference;\nvar setMultiplicity = /* #__PURE__ */(0, _factoriesAny.createSetMultiplicity)({\n  Index: Index,\n  compareNatural: compareNatural,\n  size: size,\n  subset: subset,\n  typed: typed\n});\nexports.setMultiplicity = setMultiplicity;\nvar setSymDifference = /* #__PURE__ */(0, _factoriesAny.createSetSymDifference)({\n  Index: Index,\n  concat: concat,\n  setDifference: setDifference,\n  size: size,\n  subset: subset,\n  typed: typed\n});\nexports.setSymDifference = setSymDifference;\nvar sort = /* #__PURE__ */(0, _factoriesAny.createSort)({\n  compare: compare,\n  compareNatural: compareNatural,\n  matrix: matrix,\n  typed: typed\n});\nexports.sort = sort;\nvar inv = /* #__PURE__ */(0, _factoriesAny.createInv)({\n  abs: abs,\n  addScalar: addScalar,\n  det: det,\n  divideScalar: divideScalar,\n  identity: identity,\n  matrix: matrix,\n  multiply: multiply,\n  typed: typed,\n  unaryMinus: unaryMinus\n});\nexports.inv = inv;\nvar lup = /* #__PURE__ */(0, _factoriesAny.createLup)({\n  DenseMatrix: DenseMatrix,\n  Spa: Spa,\n  SparseMatrix: SparseMatrix,\n  abs: abs,\n  addScalar: addScalar,\n  divideScalar: divideScalar,\n  equalScalar: equalScalar,\n  larger: larger,\n  matrix: matrix,\n  multiplyScalar: multiplyScalar,\n  subtract: subtract,\n  typed: typed,\n  unaryMinus: unaryMinus\n});\nexports.lup = lup;\nvar pinv = /* #__PURE__ */(0, _factoriesAny.createPinv)({\n  Complex: Complex,\n  add: add,\n  ctranspose: ctranspose,\n  deepEqual: deepEqual,\n  divideScalar: divideScalar,\n  dot: dot,\n  dotDivide: dotDivide,\n  equal: equal,\n  inv: inv,\n  matrix: matrix,\n  multiply: multiply,\n  typed: typed\n});\nexports.pinv = pinv;\nvar pow = /* #__PURE__ */(0, _factoriesAny.createPow)({\n  Complex: Complex,\n  config: _configReadonly.config,\n  fraction: fraction,\n  identity: identity,\n  inv: inv,\n  matrix: matrix,\n  multiply: multiply,\n  number: number,\n  typed: typed\n});\nexports.pow = pow;\nvar setIntersect = /* #__PURE__ */(0, _factoriesAny.createSetIntersect)({\n  DenseMatrix: DenseMatrix,\n  Index: Index,\n  compareNatural: compareNatural,\n  size: size,\n  subset: subset,\n  typed: typed\n});\nexports.setIntersect = setIntersect;\nvar setUnion = /* #__PURE__ */(0, _factoriesAny.createSetUnion)({\n  Index: Index,\n  concat: concat,\n  setIntersect: setIntersect,\n  setSymDifference: setSymDifference,\n  size: size,\n  subset: subset,\n  typed: typed\n});\nexports.setUnion = setUnion;\nvar sqrtm = /* #__PURE__ */(0, _factoriesAny.createSqrtm)({\n  abs: abs,\n  add: add,\n  identity: identity,\n  inv: inv,\n  map: map,\n  max: max,\n  multiply: multiply,\n  size: size,\n  sqrt: sqrt,\n  subtract: subtract,\n  typed: typed\n});\nexports.sqrtm = sqrtm;\nvar Unit = /* #__PURE__ */(0, _factoriesAny.createUnitClass)({\n  BigNumber: BigNumber,\n  Complex: Complex,\n  Fraction: Fraction,\n  abs: abs,\n  addScalar: addScalar,\n  config: _configReadonly.config,\n  divideScalar: divideScalar,\n  equal: equal,\n  fix: fix,\n  format: format,\n  isNumeric: isNumeric,\n  multiplyScalar: multiplyScalar,\n  number: number,\n  pow: pow,\n  round: round,\n  subtract: subtract\n});\nexports.Unit = Unit;\nvar vacuumImpedance = /* #__PURE__ */(0, _factoriesAny.createVacuumImpedance)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.vacuumImpedance = vacuumImpedance;\nvar wienDisplacement = /* #__PURE__ */(0, _factoriesAny.createWienDisplacement)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.wienDisplacement = wienDisplacement;\nvar atomicMass = /* #__PURE__ */(0, _factoriesAny.createAtomicMass)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.atomicMass = atomicMass;\nvar bohrMagneton = /* #__PURE__ */(0, _factoriesAny.createBohrMagneton)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.bohrMagneton = bohrMagneton;\nvar boltzmann = /* #__PURE__ */(0, _factoriesAny.createBoltzmann)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.boltzmann = boltzmann;\nvar conductanceQuantum = /* #__PURE__ */(0, _factoriesAny.createConductanceQuantum)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.conductanceQuantum = conductanceQuantum;\nvar createUnit = /* #__PURE__ */(0, _factoriesAny.createCreateUnit)({\n  Unit: Unit,\n  typed: typed\n});\nexports.createUnit = createUnit;\nvar deuteronMass = /* #__PURE__ */(0, _factoriesAny.createDeuteronMass)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.deuteronMass = deuteronMass;\nvar dotPow = /* #__PURE__ */(0, _factoriesAny.createDotPow)({\n  DenseMatrix: DenseMatrix,\n  concat: concat,\n  equalScalar: equalScalar,\n  matrix: matrix,\n  pow: pow,\n  typed: typed\n});\nexports.dotPow = dotPow;\nvar electricConstant = /* #__PURE__ */(0, _factoriesAny.createElectricConstant)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.electricConstant = electricConstant;\nvar elementaryCharge = /* #__PURE__ */(0, _factoriesAny.createElementaryCharge)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.elementaryCharge = elementaryCharge;\nvar expm = /* #__PURE__ */(0, _factoriesAny.createExpm)({\n  abs: abs,\n  add: add,\n  identity: identity,\n  inv: inv,\n  multiply: multiply,\n  typed: typed\n});\nexports.expm = expm;\nvar faraday = /* #__PURE__ */(0, _factoriesAny.createFaraday)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.faraday = faraday;\nvar fft = /* #__PURE__ */(0, _factoriesAny.createFft)({\n  addScalar: addScalar,\n  ceil: ceil,\n  conj: conj,\n  divideScalar: divideScalar,\n  dotDivide: dotDivide,\n  exp: exp,\n  i: i,\n  log2: log2,\n  matrix: matrix,\n  multiplyScalar: multiplyScalar,\n  pow: pow,\n  tau: tau,\n  typed: typed\n});\nexports.fft = fft;\nvar gamma = /* #__PURE__ */(0, _factoriesAny.createGamma)({\n  BigNumber: BigNumber,\n  Complex: Complex,\n  config: _configReadonly.config,\n  multiplyScalar: multiplyScalar,\n  pow: pow,\n  typed: typed\n});\nexports.gamma = gamma;\nvar gravitationConstant = /* #__PURE__ */(0, _factoriesAny.createGravitationConstant)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.gravitationConstant = gravitationConstant;\nvar hartreeEnergy = /* #__PURE__ */(0, _factoriesAny.createHartreeEnergy)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.hartreeEnergy = hartreeEnergy;\nvar ifft = /* #__PURE__ */(0, _factoriesAny.createIfft)({\n  conj: conj,\n  dotDivide: dotDivide,\n  fft: fft,\n  typed: typed\n});\nexports.ifft = ifft;\nvar klitzing = /* #__PURE__ */(0, _factoriesAny.createKlitzing)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.klitzing = klitzing;\nvar loschmidt = /* #__PURE__ */(0, _factoriesAny.createLoschmidt)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.loschmidt = loschmidt;\nvar magneticConstant = /* #__PURE__ */(0, _factoriesAny.createMagneticConstant)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.magneticConstant = magneticConstant;\nvar molarMass = /* #__PURE__ */(0, _factoriesAny.createMolarMass)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.molarMass = molarMass;\nvar molarPlanckConstant = /* #__PURE__ */(0, _factoriesAny.createMolarPlanckConstant)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.molarPlanckConstant = molarPlanckConstant;\nvar neutronMass = /* #__PURE__ */(0, _factoriesAny.createNeutronMass)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.neutronMass = neutronMass;\nvar nuclearMagneton = /* #__PURE__ */(0, _factoriesAny.createNuclearMagneton)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.nuclearMagneton = nuclearMagneton;\nvar planckCharge = /* #__PURE__ */(0, _factoriesAny.createPlanckCharge)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.planckCharge = planckCharge;\nvar planckLength = /* #__PURE__ */(0, _factoriesAny.createPlanckLength)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.planckLength = planckLength;\nvar planckTemperature = /* #__PURE__ */(0, _factoriesAny.createPlanckTemperature)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.planckTemperature = planckTemperature;\nvar protonMass = /* #__PURE__ */(0, _factoriesAny.createProtonMass)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.protonMass = protonMass;\nvar reducedPlanckConstant = /* #__PURE__ */(0, _factoriesAny.createReducedPlanckConstant)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.reducedPlanckConstant = reducedPlanckConstant;\nvar rydberg = /* #__PURE__ */(0, _factoriesAny.createRydberg)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.rydberg = rydberg;\nvar secondRadiation = /* #__PURE__ */(0, _factoriesAny.createSecondRadiation)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.secondRadiation = secondRadiation;\nvar speedOfLight = /* #__PURE__ */(0, _factoriesAny.createSpeedOfLight)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.speedOfLight = speedOfLight;\nvar stefanBoltzmann = /* #__PURE__ */(0, _factoriesAny.createStefanBoltzmann)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.stefanBoltzmann = stefanBoltzmann;\nvar thomsonCrossSection = /* #__PURE__ */(0, _factoriesAny.createThomsonCrossSection)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.thomsonCrossSection = thomsonCrossSection;\nvar avogadro = /* #__PURE__ */(0, _factoriesAny.createAvogadro)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.avogadro = avogadro;\nvar bohrRadius = /* #__PURE__ */(0, _factoriesAny.createBohrRadius)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.bohrRadius = bohrRadius;\nvar coulomb = /* #__PURE__ */(0, _factoriesAny.createCoulomb)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.coulomb = coulomb;\nvar divide = /* #__PURE__ */(0, _factoriesAny.createDivide)({\n  divideScalar: divideScalar,\n  equalScalar: equalScalar,\n  inv: inv,\n  matrix: matrix,\n  multiply: multiply,\n  typed: typed\n});\nexports.divide = divide;\nvar electronMass = /* #__PURE__ */(0, _factoriesAny.createElectronMass)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.electronMass = electronMass;\nvar factorial = /* #__PURE__ */(0, _factoriesAny.createFactorial)({\n  gamma: gamma,\n  typed: typed\n});\nexports.factorial = factorial;\nvar firstRadiation = /* #__PURE__ */(0, _factoriesAny.createFirstRadiation)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.firstRadiation = firstRadiation;\nvar gasConstant = /* #__PURE__ */(0, _factoriesAny.createGasConstant)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.gasConstant = gasConstant;\nvar inverseConductanceQuantum = /* #__PURE__ */(0, _factoriesAny.createInverseConductanceQuantum)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.inverseConductanceQuantum = inverseConductanceQuantum;\nvar lusolve = /* #__PURE__ */(0, _factoriesAny.createLusolve)({\n  DenseMatrix: DenseMatrix,\n  lsolve: lsolve,\n  lup: lup,\n  matrix: matrix,\n  slu: slu,\n  typed: typed,\n  usolve: usolve\n});\nexports.lusolve = lusolve;\nvar magneticFluxQuantum = /* #__PURE__ */(0, _factoriesAny.createMagneticFluxQuantum)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.magneticFluxQuantum = magneticFluxQuantum;\nvar molarMassC12 = /* #__PURE__ */(0, _factoriesAny.createMolarMassC12)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.molarMassC12 = molarMassC12;\nvar multinomial = /* #__PURE__ */(0, _factoriesAny.createMultinomial)({\n  add: add,\n  divide: divide,\n  factorial: factorial,\n  isInteger: isInteger,\n  isPositive: isPositive,\n  multiply: multiply,\n  typed: typed\n});\nexports.multinomial = multinomial;\nvar permutations = /* #__PURE__ */(0, _factoriesAny.createPermutations)({\n  factorial: factorial,\n  typed: typed\n});\nexports.permutations = permutations;\nvar planckMass = /* #__PURE__ */(0, _factoriesAny.createPlanckMass)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.planckMass = planckMass;\nvar polynomialRoot = /* #__PURE__ */(0, _factoriesAny.createPolynomialRoot)({\n  add: add,\n  cbrt: cbrt,\n  divide: divide,\n  equalScalar: equalScalar,\n  im: im,\n  isZero: isZero,\n  multiply: multiply,\n  re: re,\n  sqrt: sqrt,\n  subtract: subtract,\n  typeOf: typeOf,\n  typed: typed,\n  unaryMinus: unaryMinus\n});\nexports.polynomialRoot = polynomialRoot;\nvar setSize = /* #__PURE__ */(0, _factoriesAny.createSetSize)({\n  compareNatural: compareNatural,\n  typed: typed\n});\nexports.setSize = setSize;\nvar stirlingS2 = /* #__PURE__ */(0, _factoriesAny.createStirlingS2)({\n  bignumber: bignumber,\n  addScalar: addScalar,\n  combinations: combinations,\n  divideScalar: divideScalar,\n  factorial: factorial,\n  isInteger: isInteger,\n  isNegative: isNegative,\n  larger: larger,\n  multiplyScalar: multiplyScalar,\n  number: number,\n  pow: pow,\n  subtract: subtract,\n  typed: typed\n});\nexports.stirlingS2 = stirlingS2;\nvar unit = /* #__PURE__ */(0, _factoriesAny.createUnitFunction)({\n  Unit: Unit,\n  typed: typed\n});\nexports.unit = unit;\nvar bellNumbers = /* #__PURE__ */(0, _factoriesAny.createBellNumbers)({\n  addScalar: addScalar,\n  isInteger: isInteger,\n  isNegative: isNegative,\n  stirlingS2: stirlingS2,\n  typed: typed\n});\nexports.bellNumbers = bellNumbers;\nvar eigs = /* #__PURE__ */(0, _factoriesAny.createEigs)({\n  abs: abs,\n  add: add,\n  addScalar: addScalar,\n  atan: atan,\n  bignumber: bignumber,\n  column: column,\n  complex: complex,\n  config: _configReadonly.config,\n  cos: cos,\n  diag: diag,\n  divideScalar: divideScalar,\n  dot: dot,\n  equal: equal,\n  flatten: flatten,\n  im: im,\n  inv: inv,\n  larger: larger,\n  matrix: matrix,\n  matrixFromColumns: matrixFromColumns,\n  multiply: multiply,\n  multiplyScalar: multiplyScalar,\n  number: number,\n  qr: qr,\n  re: re,\n  sin: sin,\n  smaller: smaller,\n  sqrt: sqrt,\n  subtract: subtract,\n  typed: typed,\n  usolve: usolve,\n  usolveAll: usolveAll\n});\nexports.eigs = eigs;\nvar fermiCoupling = /* #__PURE__ */(0, _factoriesAny.createFermiCoupling)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.fermiCoupling = fermiCoupling;\nvar gravity = /* #__PURE__ */(0, _factoriesAny.createGravity)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.gravity = gravity;\nvar kldivergence = /* #__PURE__ */(0, _factoriesAny.createKldivergence)({\n  divide: divide,\n  dotDivide: dotDivide,\n  isNumeric: isNumeric,\n  log: log,\n  map: map,\n  matrix: matrix,\n  multiply: multiply,\n  sum: sum,\n  typed: typed\n});\nexports.kldivergence = kldivergence;\nvar mean = /* #__PURE__ */(0, _factoriesAny.createMean)({\n  add: add,\n  divide: divide,\n  typed: typed\n});\nexports.mean = mean;\nvar molarVolume = /* #__PURE__ */(0, _factoriesAny.createMolarVolume)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.molarVolume = molarVolume;\nvar planckConstant = /* #__PURE__ */(0, _factoriesAny.createPlanckConstant)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.planckConstant = planckConstant;\nvar quantumOfCirculation = /* #__PURE__ */(0, _factoriesAny.createQuantumOfCirculation)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.quantumOfCirculation = quantumOfCirculation;\nvar variance = /* #__PURE__ */(0, _factoriesAny.createVariance)({\n  add: add,\n  apply: apply,\n  divide: divide,\n  isNaN: isNaN,\n  multiply: multiply,\n  subtract: subtract,\n  typed: typed\n});\nexports.variance = variance;\nvar classicalElectronRadius = /* #__PURE__ */(0, _factoriesAny.createClassicalElectronRadius)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.classicalElectronRadius = classicalElectronRadius;\nvar median = /* #__PURE__ */(0, _factoriesAny.createMedian)({\n  add: add,\n  compare: compare,\n  divide: divide,\n  partitionSelect: partitionSelect,\n  typed: typed\n});\nexports.median = median;\nvar planckTime = /* #__PURE__ */(0, _factoriesAny.createPlanckTime)({\n  BigNumber: BigNumber,\n  Unit: Unit,\n  config: _configReadonly.config\n});\nexports.planckTime = planckTime;\nvar std = /* #__PURE__ */(0, _factoriesAny.createStd)({\n  map: map,\n  sqrt: sqrt,\n  typed: typed,\n  variance: variance\n});\nexports.std = std;\nvar mad = /* #__PURE__ */(0, _factoriesAny.createMad)({\n  abs: abs,\n  map: map,\n  median: median,\n  subtract: subtract,\n  typed: typed\n});\nexports.mad = mad;\nvar norm = /* #__PURE__ */(0, _factoriesAny.createNorm)({\n  abs: abs,\n  add: add,\n  conj: conj,\n  ctranspose: ctranspose,\n  eigs: eigs,\n  equalScalar: equalScalar,\n  larger: larger,\n  matrix: matrix,\n  multiply: multiply,\n  pow: pow,\n  smaller: smaller,\n  sqrt: sqrt,\n  typed: typed\n});\nexports.norm = norm;\nvar rotationMatrix = /* #__PURE__ */(0, _factoriesAny.createRotationMatrix)({\n  BigNumber: BigNumber,\n  DenseMatrix: DenseMatrix,\n  SparseMatrix: SparseMatrix,\n  addScalar: addScalar,\n  config: _configReadonly.config,\n  cos: cos,\n  matrix: matrix,\n  multiplyScalar: multiplyScalar,\n  norm: norm,\n  sin: sin,\n  typed: typed,\n  unaryMinus: unaryMinus\n});\nexports.rotationMatrix = rotationMatrix;\nvar rotate = /* #__PURE__ */(0, _factoriesAny.createRotate)({\n  multiply: multiply,\n  rotationMatrix: rotationMatrix,\n  typed: typed\n});\nexports.rotate = rotate;\nvar schur = /* #__PURE__ */(0, _factoriesAny.createSchur)({\n  identity: identity,\n  matrix: matrix,\n  multiply: multiply,\n  norm: norm,\n  qr: qr,\n  subtract: subtract,\n  typed: typed\n});\nexports.schur = schur;\nvar sylvester = /* #__PURE__ */(0, _factoriesAny.createSylvester)({\n  abs: abs,\n  add: add,\n  concat: concat,\n  identity: identity,\n  index: index,\n  lusolve: lusolve,\n  matrix: matrix,\n  matrixFromColumns: matrixFromColumns,\n  multiply: multiply,\n  range: range,\n  schur: schur,\n  subset: subset,\n  subtract: subtract,\n  transpose: transpose,\n  typed: typed\n});\nexports.sylvester = sylvester;\nvar lyap = /* #__PURE__ */(0, _factoriesAny.createLyap)({\n  matrix: matrix,\n  multiply: multiply,\n  sylvester: sylvester,\n  transpose: transpose,\n  typed: typed\n});\nexports.lyap = lyap;","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.derivative = exports.compile = exports.chain = exports.SymbolNode = exports.RelationalNode = exports.RangeNode = exports.Parser = exports.ParenthesisNode = exports.OperatorNode = exports.ObjectNode = exports.Node = exports.IndexNode = exports.Help = exports.FunctionNode = exports.FunctionAssignmentNode = exports.ConstantNode = exports.ConditionalNode = exports.Chain = exports.BlockNode = exports.AssignmentNode = exports.ArrayNode = exports.AccessorNode = void 0;\nObject.defineProperty(exports, \"docs\", {\n  enumerable: true,\n  get: function get() {\n    return _embeddedDocs.embeddedDocs;\n  }\n});\nexports.symbolicEqual = exports.simplifyCore = exports.simplifyConstant = exports.simplify = exports.reviver = exports.resolve = exports.rationalize = exports.parser = exports.parse = exports.leafCount = exports.help = exports.evaluate = void 0;\nvar _extends2 = _interopRequireDefault(require(\"@babel/runtime/helpers/extends\"));\nvar _configReadonly = require(\"./configReadonly.js\");\nvar _factoriesAny = require(\"../factoriesAny.js\");\nvar _pureFunctionsAnyGenerated = require(\"./pureFunctionsAny.generated.js\");\nvar _embeddedDocs = require(\"../expression/embeddedDocs/embeddedDocs.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar math = {}; // NOT pure!\nvar mathWithTransform = {}; // NOT pure!\nvar classes = {}; // NOT pure!\n\nvar Node = (0, _factoriesAny.createNode)({\n  mathWithTransform: mathWithTransform\n});\nexports.Node = Node;\nvar ObjectNode = (0, _factoriesAny.createObjectNode)({\n  Node: Node\n});\nexports.ObjectNode = ObjectNode;\nvar OperatorNode = (0, _factoriesAny.createOperatorNode)({\n  Node: Node\n});\nexports.OperatorNode = OperatorNode;\nvar ParenthesisNode = (0, _factoriesAny.createParenthesisNode)({\n  Node: Node\n});\nexports.ParenthesisNode = ParenthesisNode;\nvar RelationalNode = (0, _factoriesAny.createRelationalNode)({\n  Node: Node\n});\nexports.RelationalNode = RelationalNode;\nvar ArrayNode = (0, _factoriesAny.createArrayNode)({\n  Node: Node\n});\nexports.ArrayNode = ArrayNode;\nvar BlockNode = (0, _factoriesAny.createBlockNode)({\n  Node: Node,\n  ResultSet: _pureFunctionsAnyGenerated.ResultSet\n});\nexports.BlockNode = BlockNode;\nvar ConditionalNode = (0, _factoriesAny.createConditionalNode)({\n  Node: Node\n});\nexports.ConditionalNode = ConditionalNode;\nvar ConstantNode = (0, _factoriesAny.createConstantNode)({\n  Node: Node\n});\nexports.ConstantNode = ConstantNode;\nvar RangeNode = (0, _factoriesAny.createRangeNode)({\n  Node: Node\n});\nexports.RangeNode = RangeNode;\nvar reviver = (0, _factoriesAny.createReviver)({\n  classes: classes\n});\nexports.reviver = reviver;\nvar Chain = (0, _factoriesAny.createChainClass)({\n  math: math,\n  typed: _pureFunctionsAnyGenerated.typed\n});\nexports.Chain = Chain;\nvar FunctionAssignmentNode = (0, _factoriesAny.createFunctionAssignmentNode)({\n  Node: Node,\n  typed: _pureFunctionsAnyGenerated.typed\n});\nexports.FunctionAssignmentNode = FunctionAssignmentNode;\nvar chain = (0, _factoriesAny.createChain)({\n  Chain: Chain,\n  typed: _pureFunctionsAnyGenerated.typed\n});\nexports.chain = chain;\nvar AccessorNode = (0, _factoriesAny.createAccessorNode)({\n  Node: Node,\n  subset: _pureFunctionsAnyGenerated.subset\n});\nexports.AccessorNode = AccessorNode;\nvar IndexNode = (0, _factoriesAny.createIndexNode)({\n  Node: Node,\n  size: _pureFunctionsAnyGenerated.size\n});\nexports.IndexNode = IndexNode;\nvar AssignmentNode = (0, _factoriesAny.createAssignmentNode)({\n  matrix: _pureFunctionsAnyGenerated.matrix,\n  Node: Node,\n  subset: _pureFunctionsAnyGenerated.subset\n});\nexports.AssignmentNode = AssignmentNode;\nvar SymbolNode = (0, _factoriesAny.createSymbolNode)({\n  Unit: _pureFunctionsAnyGenerated.Unit,\n  Node: Node,\n  math: math\n});\nexports.SymbolNode = SymbolNode;\nvar FunctionNode = (0, _factoriesAny.createFunctionNode)({\n  Node: Node,\n  SymbolNode: SymbolNode,\n  math: math\n});\nexports.FunctionNode = FunctionNode;\nvar parse = (0, _factoriesAny.createParse)({\n  AccessorNode: AccessorNode,\n  ArrayNode: ArrayNode,\n  AssignmentNode: AssignmentNode,\n  BlockNode: BlockNode,\n  ConditionalNode: ConditionalNode,\n  ConstantNode: ConstantNode,\n  FunctionAssignmentNode: FunctionAssignmentNode,\n  FunctionNode: FunctionNode,\n  IndexNode: IndexNode,\n  ObjectNode: ObjectNode,\n  OperatorNode: OperatorNode,\n  ParenthesisNode: ParenthesisNode,\n  RangeNode: RangeNode,\n  RelationalNode: RelationalNode,\n  SymbolNode: SymbolNode,\n  config: _configReadonly.config,\n  numeric: _pureFunctionsAnyGenerated.numeric,\n  typed: _pureFunctionsAnyGenerated.typed\n});\nexports.parse = parse;\nvar resolve = (0, _factoriesAny.createResolve)({\n  ConstantNode: ConstantNode,\n  FunctionNode: FunctionNode,\n  OperatorNode: OperatorNode,\n  ParenthesisNode: ParenthesisNode,\n  parse: parse,\n  typed: _pureFunctionsAnyGenerated.typed\n});\nexports.resolve = resolve;\nvar simplifyConstant = (0, _factoriesAny.createSimplifyConstant)({\n  bignumber: _pureFunctionsAnyGenerated.bignumber,\n  fraction: _pureFunctionsAnyGenerated.fraction,\n  AccessorNode: AccessorNode,\n  ArrayNode: ArrayNode,\n  ConstantNode: ConstantNode,\n  FunctionNode: FunctionNode,\n  IndexNode: IndexNode,\n  ObjectNode: ObjectNode,\n  OperatorNode: OperatorNode,\n  SymbolNode: SymbolNode,\n  config: _configReadonly.config,\n  mathWithTransform: mathWithTransform,\n  matrix: _pureFunctionsAnyGenerated.matrix,\n  typed: _pureFunctionsAnyGenerated.typed\n});\nexports.simplifyConstant = simplifyConstant;\nvar compile = (0, _factoriesAny.createCompile)({\n  parse: parse,\n  typed: _pureFunctionsAnyGenerated.typed\n});\nexports.compile = compile;\nvar evaluate = (0, _factoriesAny.createEvaluate)({\n  parse: parse,\n  typed: _pureFunctionsAnyGenerated.typed\n});\nexports.evaluate = evaluate;\nvar Help = (0, _factoriesAny.createHelpClass)({\n  parse: parse\n});\nexports.Help = Help;\nvar Parser = (0, _factoriesAny.createParserClass)({\n  evaluate: evaluate\n});\nexports.Parser = Parser;\nvar simplifyCore = (0, _factoriesAny.createSimplifyCore)({\n  AccessorNode: AccessorNode,\n  ArrayNode: ArrayNode,\n  ConstantNode: ConstantNode,\n  FunctionNode: FunctionNode,\n  IndexNode: IndexNode,\n  ObjectNode: ObjectNode,\n  OperatorNode: OperatorNode,\n  ParenthesisNode: ParenthesisNode,\n  SymbolNode: SymbolNode,\n  add: _pureFunctionsAnyGenerated.add,\n  divide: _pureFunctionsAnyGenerated.divide,\n  equal: _pureFunctionsAnyGenerated.equal,\n  isZero: _pureFunctionsAnyGenerated.isZero,\n  multiply: _pureFunctionsAnyGenerated.multiply,\n  parse: parse,\n  pow: _pureFunctionsAnyGenerated.pow,\n  subtract: _pureFunctionsAnyGenerated.subtract,\n  typed: _pureFunctionsAnyGenerated.typed\n});\nexports.simplifyCore = simplifyCore;\nvar help = (0, _factoriesAny.createHelp)({\n  Help: Help,\n  mathWithTransform: mathWithTransform,\n  typed: _pureFunctionsAnyGenerated.typed\n});\nexports.help = help;\nvar simplify = (0, _factoriesAny.createSimplify)({\n  bignumber: _pureFunctionsAnyGenerated.bignumber,\n  fraction: _pureFunctionsAnyGenerated.fraction,\n  AccessorNode: AccessorNode,\n  ArrayNode: ArrayNode,\n  ConstantNode: ConstantNode,\n  FunctionNode: FunctionNode,\n  IndexNode: IndexNode,\n  ObjectNode: ObjectNode,\n  OperatorNode: OperatorNode,\n  ParenthesisNode: ParenthesisNode,\n  SymbolNode: SymbolNode,\n  add: _pureFunctionsAnyGenerated.add,\n  config: _configReadonly.config,\n  divide: _pureFunctionsAnyGenerated.divide,\n  equal: _pureFunctionsAnyGenerated.equal,\n  isZero: _pureFunctionsAnyGenerated.isZero,\n  mathWithTransform: mathWithTransform,\n  matrix: _pureFunctionsAnyGenerated.matrix,\n  multiply: _pureFunctionsAnyGenerated.multiply,\n  parse: parse,\n  pow: _pureFunctionsAnyGenerated.pow,\n  resolve: resolve,\n  simplifyConstant: simplifyConstant,\n  simplifyCore: simplifyCore,\n  subtract: _pureFunctionsAnyGenerated.subtract,\n  typed: _pureFunctionsAnyGenerated.typed\n});\nexports.simplify = simplify;\nvar symbolicEqual = (0, _factoriesAny.createSymbolicEqual)({\n  OperatorNode: OperatorNode,\n  parse: parse,\n  simplify: simplify,\n  typed: _pureFunctionsAnyGenerated.typed\n});\nexports.symbolicEqual = symbolicEqual;\nvar derivative = (0, _factoriesAny.createDerivative)({\n  ConstantNode: ConstantNode,\n  FunctionNode: FunctionNode,\n  OperatorNode: OperatorNode,\n  ParenthesisNode: ParenthesisNode,\n  SymbolNode: SymbolNode,\n  config: _configReadonly.config,\n  equal: _pureFunctionsAnyGenerated.equal,\n  isZero: _pureFunctionsAnyGenerated.isZero,\n  numeric: _pureFunctionsAnyGenerated.numeric,\n  parse: parse,\n  simplify: simplify,\n  typed: _pureFunctionsAnyGenerated.typed\n});\nexports.derivative = derivative;\nvar parser = (0, _factoriesAny.createParser)({\n  Parser: Parser,\n  typed: _pureFunctionsAnyGenerated.typed\n});\nexports.parser = parser;\nvar leafCount = (0, _factoriesAny.createLeafCount)({\n  parse: parse,\n  typed: _pureFunctionsAnyGenerated.typed\n});\nexports.leafCount = leafCount;\nvar rationalize = (0, _factoriesAny.createRationalize)({\n  bignumber: _pureFunctionsAnyGenerated.bignumber,\n  fraction: _pureFunctionsAnyGenerated.fraction,\n  AccessorNode: AccessorNode,\n  ArrayNode: ArrayNode,\n  ConstantNode: ConstantNode,\n  FunctionNode: FunctionNode,\n  IndexNode: IndexNode,\n  ObjectNode: ObjectNode,\n  OperatorNode: OperatorNode,\n  ParenthesisNode: ParenthesisNode,\n  SymbolNode: SymbolNode,\n  add: _pureFunctionsAnyGenerated.add,\n  config: _configReadonly.config,\n  divide: _pureFunctionsAnyGenerated.divide,\n  equal: _pureFunctionsAnyGenerated.equal,\n  isZero: _pureFunctionsAnyGenerated.isZero,\n  mathWithTransform: mathWithTransform,\n  matrix: _pureFunctionsAnyGenerated.matrix,\n  multiply: _pureFunctionsAnyGenerated.multiply,\n  parse: parse,\n  pow: _pureFunctionsAnyGenerated.pow,\n  simplify: simplify,\n  simplifyConstant: simplifyConstant,\n  simplifyCore: simplifyCore,\n  subtract: _pureFunctionsAnyGenerated.subtract,\n  typed: _pureFunctionsAnyGenerated.typed\n});\nexports.rationalize = rationalize;\n(0, _extends2[\"default\"])(math, {\n  e: _pureFunctionsAnyGenerated.e,\n  \"false\": _pureFunctionsAnyGenerated._false,\n  fineStructure: _pureFunctionsAnyGenerated.fineStructure,\n  i: _pureFunctionsAnyGenerated.i,\n  Infinity: _pureFunctionsAnyGenerated._Infinity,\n  LN10: _pureFunctionsAnyGenerated.LN10,\n  LOG10E: _pureFunctionsAnyGenerated.LOG10E,\n  NaN: _pureFunctionsAnyGenerated._NaN,\n  \"null\": _pureFunctionsAnyGenerated._null,\n  phi: _pureFunctionsAnyGenerated.phi,\n  SQRT1_2: _pureFunctionsAnyGenerated.SQRT1_2,\n  sackurTetrode: _pureFunctionsAnyGenerated.sackurTetrode,\n  tau: _pureFunctionsAnyGenerated.tau,\n  \"true\": _pureFunctionsAnyGenerated._true,\n  'E': _pureFunctionsAnyGenerated.e,\n  version: _pureFunctionsAnyGenerated.version,\n  efimovFactor: _pureFunctionsAnyGenerated.efimovFactor,\n  LN2: _pureFunctionsAnyGenerated.LN2,\n  pi: _pureFunctionsAnyGenerated.pi,\n  replacer: _pureFunctionsAnyGenerated.replacer,\n  reviver: reviver,\n  SQRT2: _pureFunctionsAnyGenerated.SQRT2,\n  typed: _pureFunctionsAnyGenerated.typed,\n  unaryPlus: _pureFunctionsAnyGenerated.unaryPlus,\n  'PI': _pureFunctionsAnyGenerated.pi,\n  weakMixingAngle: _pureFunctionsAnyGenerated.weakMixingAngle,\n  abs: _pureFunctionsAnyGenerated.abs,\n  acos: _pureFunctionsAnyGenerated.acos,\n  acot: _pureFunctionsAnyGenerated.acot,\n  acsc: _pureFunctionsAnyGenerated.acsc,\n  addScalar: _pureFunctionsAnyGenerated.addScalar,\n  arg: _pureFunctionsAnyGenerated.arg,\n  asech: _pureFunctionsAnyGenerated.asech,\n  asinh: _pureFunctionsAnyGenerated.asinh,\n  atan: _pureFunctionsAnyGenerated.atan,\n  atanh: _pureFunctionsAnyGenerated.atanh,\n  bignumber: _pureFunctionsAnyGenerated.bignumber,\n  bitNot: _pureFunctionsAnyGenerated.bitNot,\n  \"boolean\": _pureFunctionsAnyGenerated[\"boolean\"],\n  clone: _pureFunctionsAnyGenerated.clone,\n  combinations: _pureFunctionsAnyGenerated.combinations,\n  complex: _pureFunctionsAnyGenerated.complex,\n  conj: _pureFunctionsAnyGenerated.conj,\n  cosh: _pureFunctionsAnyGenerated.cosh,\n  coth: _pureFunctionsAnyGenerated.coth,\n  csc: _pureFunctionsAnyGenerated.csc,\n  cube: _pureFunctionsAnyGenerated.cube,\n  equalScalar: _pureFunctionsAnyGenerated.equalScalar,\n  erf: _pureFunctionsAnyGenerated.erf,\n  exp: _pureFunctionsAnyGenerated.exp,\n  expm1: _pureFunctionsAnyGenerated.expm1,\n  filter: _pureFunctionsAnyGenerated.filter,\n  forEach: _pureFunctionsAnyGenerated.forEach,\n  format: _pureFunctionsAnyGenerated.format,\n  getMatrixDataType: _pureFunctionsAnyGenerated.getMatrixDataType,\n  hex: _pureFunctionsAnyGenerated.hex,\n  im: _pureFunctionsAnyGenerated.im,\n  isInteger: _pureFunctionsAnyGenerated.isInteger,\n  isNegative: _pureFunctionsAnyGenerated.isNegative,\n  isPositive: _pureFunctionsAnyGenerated.isPositive,\n  isZero: _pureFunctionsAnyGenerated.isZero,\n  LOG2E: _pureFunctionsAnyGenerated.LOG2E,\n  lgamma: _pureFunctionsAnyGenerated.lgamma,\n  log10: _pureFunctionsAnyGenerated.log10,\n  log2: _pureFunctionsAnyGenerated.log2,\n  map: _pureFunctionsAnyGenerated.map,\n  multiplyScalar: _pureFunctionsAnyGenerated.multiplyScalar,\n  not: _pureFunctionsAnyGenerated.not,\n  number: _pureFunctionsAnyGenerated.number,\n  oct: _pureFunctionsAnyGenerated.oct,\n  pickRandom: _pureFunctionsAnyGenerated.pickRandom,\n  print: _pureFunctionsAnyGenerated.print,\n  random: _pureFunctionsAnyGenerated.random,\n  re: _pureFunctionsAnyGenerated.re,\n  sec: _pureFunctionsAnyGenerated.sec,\n  sign: _pureFunctionsAnyGenerated.sign,\n  sin: _pureFunctionsAnyGenerated.sin,\n  splitUnit: _pureFunctionsAnyGenerated.splitUnit,\n  square: _pureFunctionsAnyGenerated.square,\n  string: _pureFunctionsAnyGenerated.string,\n  tan: _pureFunctionsAnyGenerated.tan,\n  typeOf: _pureFunctionsAnyGenerated.typeOf,\n  acosh: _pureFunctionsAnyGenerated.acosh,\n  acsch: _pureFunctionsAnyGenerated.acsch,\n  apply: _pureFunctionsAnyGenerated.apply,\n  asec: _pureFunctionsAnyGenerated.asec,\n  bin: _pureFunctionsAnyGenerated.bin,\n  chain: chain,\n  combinationsWithRep: _pureFunctionsAnyGenerated.combinationsWithRep,\n  cos: _pureFunctionsAnyGenerated.cos,\n  csch: _pureFunctionsAnyGenerated.csch,\n  isNaN: _pureFunctionsAnyGenerated.isNaN,\n  isPrime: _pureFunctionsAnyGenerated.isPrime,\n  randomInt: _pureFunctionsAnyGenerated.randomInt,\n  sech: _pureFunctionsAnyGenerated.sech,\n  sinh: _pureFunctionsAnyGenerated.sinh,\n  sparse: _pureFunctionsAnyGenerated.sparse,\n  sqrt: _pureFunctionsAnyGenerated.sqrt,\n  tanh: _pureFunctionsAnyGenerated.tanh,\n  unaryMinus: _pureFunctionsAnyGenerated.unaryMinus,\n  acoth: _pureFunctionsAnyGenerated.acoth,\n  cot: _pureFunctionsAnyGenerated.cot,\n  fraction: _pureFunctionsAnyGenerated.fraction,\n  isNumeric: _pureFunctionsAnyGenerated.isNumeric,\n  matrix: _pureFunctionsAnyGenerated.matrix,\n  matrixFromFunction: _pureFunctionsAnyGenerated.matrixFromFunction,\n  mode: _pureFunctionsAnyGenerated.mode,\n  numeric: _pureFunctionsAnyGenerated.numeric,\n  prod: _pureFunctionsAnyGenerated.prod,\n  reshape: _pureFunctionsAnyGenerated.reshape,\n  size: _pureFunctionsAnyGenerated.size,\n  squeeze: _pureFunctionsAnyGenerated.squeeze,\n  subset: _pureFunctionsAnyGenerated.subset,\n  transpose: _pureFunctionsAnyGenerated.transpose,\n  xgcd: _pureFunctionsAnyGenerated.xgcd,\n  zeros: _pureFunctionsAnyGenerated.zeros,\n  asin: _pureFunctionsAnyGenerated.asin,\n  cbrt: _pureFunctionsAnyGenerated.cbrt,\n  concat: _pureFunctionsAnyGenerated.concat,\n  count: _pureFunctionsAnyGenerated.count,\n  ctranspose: _pureFunctionsAnyGenerated.ctranspose,\n  diag: _pureFunctionsAnyGenerated.diag,\n  divideScalar: _pureFunctionsAnyGenerated.divideScalar,\n  dotDivide: _pureFunctionsAnyGenerated.dotDivide,\n  equal: _pureFunctionsAnyGenerated.equal,\n  flatten: _pureFunctionsAnyGenerated.flatten,\n  gcd: _pureFunctionsAnyGenerated.gcd,\n  hasNumericValue: _pureFunctionsAnyGenerated.hasNumericValue,\n  identity: _pureFunctionsAnyGenerated.identity,\n  kron: _pureFunctionsAnyGenerated.kron,\n  largerEq: _pureFunctionsAnyGenerated.largerEq,\n  leftShift: _pureFunctionsAnyGenerated.leftShift,\n  matrixFromColumns: _pureFunctionsAnyGenerated.matrixFromColumns,\n  mod: _pureFunctionsAnyGenerated.mod,\n  nthRoot: _pureFunctionsAnyGenerated.nthRoot,\n  ones: _pureFunctionsAnyGenerated.ones,\n  resize: _pureFunctionsAnyGenerated.resize,\n  rightArithShift: _pureFunctionsAnyGenerated.rightArithShift,\n  round: _pureFunctionsAnyGenerated.round,\n  smaller: _pureFunctionsAnyGenerated.smaller,\n  to: _pureFunctionsAnyGenerated.to,\n  unequal: _pureFunctionsAnyGenerated.unequal,\n  xor: _pureFunctionsAnyGenerated.xor,\n  add: _pureFunctionsAnyGenerated.add,\n  bitAnd: _pureFunctionsAnyGenerated.bitAnd,\n  bitXor: _pureFunctionsAnyGenerated.bitXor,\n  catalan: _pureFunctionsAnyGenerated.catalan,\n  compare: _pureFunctionsAnyGenerated.compare,\n  compareText: _pureFunctionsAnyGenerated.compareText,\n  cumsum: _pureFunctionsAnyGenerated.cumsum,\n  deepEqual: _pureFunctionsAnyGenerated.deepEqual,\n  dot: _pureFunctionsAnyGenerated.dot,\n  equalText: _pureFunctionsAnyGenerated.equalText,\n  floor: _pureFunctionsAnyGenerated.floor,\n  hypot: _pureFunctionsAnyGenerated.hypot,\n  invmod: _pureFunctionsAnyGenerated.invmod,\n  larger: _pureFunctionsAnyGenerated.larger,\n  log: _pureFunctionsAnyGenerated.log,\n  matrixFromRows: _pureFunctionsAnyGenerated.matrixFromRows,\n  min: _pureFunctionsAnyGenerated.min,\n  multiply: _pureFunctionsAnyGenerated.multiply,\n  nthRoots: _pureFunctionsAnyGenerated.nthRoots,\n  or: _pureFunctionsAnyGenerated.or,\n  partitionSelect: _pureFunctionsAnyGenerated.partitionSelect,\n  quantileSeq: _pureFunctionsAnyGenerated.quantileSeq,\n  rightLogShift: _pureFunctionsAnyGenerated.rightLogShift,\n  smallerEq: _pureFunctionsAnyGenerated.smallerEq,\n  subtract: _pureFunctionsAnyGenerated.subtract,\n  trace: _pureFunctionsAnyGenerated.trace,\n  usolve: _pureFunctionsAnyGenerated.usolve,\n  and: _pureFunctionsAnyGenerated.and,\n  bitOr: _pureFunctionsAnyGenerated.bitOr,\n  ceil: _pureFunctionsAnyGenerated.ceil,\n  compareNatural: _pureFunctionsAnyGenerated.compareNatural,\n  composition: _pureFunctionsAnyGenerated.composition,\n  cross: _pureFunctionsAnyGenerated.cross,\n  det: _pureFunctionsAnyGenerated.det,\n  diff: _pureFunctionsAnyGenerated.diff,\n  distance: _pureFunctionsAnyGenerated.distance,\n  dotMultiply: _pureFunctionsAnyGenerated.dotMultiply,\n  fix: _pureFunctionsAnyGenerated.fix,\n  index: _pureFunctionsAnyGenerated.index,\n  intersect: _pureFunctionsAnyGenerated.intersect,\n  lcm: _pureFunctionsAnyGenerated.lcm,\n  log1p: _pureFunctionsAnyGenerated.log1p,\n  lsolve: _pureFunctionsAnyGenerated.lsolve,\n  max: _pureFunctionsAnyGenerated.max,\n  qr: _pureFunctionsAnyGenerated.qr,\n  range: _pureFunctionsAnyGenerated.range,\n  row: _pureFunctionsAnyGenerated.row,\n  setCartesian: _pureFunctionsAnyGenerated.setCartesian,\n  setDistinct: _pureFunctionsAnyGenerated.setDistinct,\n  setIsSubset: _pureFunctionsAnyGenerated.setIsSubset,\n  setPowerset: _pureFunctionsAnyGenerated.setPowerset,\n  slu: _pureFunctionsAnyGenerated.slu,\n  sum: _pureFunctionsAnyGenerated.sum,\n  usolveAll: _pureFunctionsAnyGenerated.usolveAll,\n  atan2: _pureFunctionsAnyGenerated.atan2,\n  column: _pureFunctionsAnyGenerated.column,\n  lsolveAll: _pureFunctionsAnyGenerated.lsolveAll,\n  setDifference: _pureFunctionsAnyGenerated.setDifference,\n  setMultiplicity: _pureFunctionsAnyGenerated.setMultiplicity,\n  setSymDifference: _pureFunctionsAnyGenerated.setSymDifference,\n  sort: _pureFunctionsAnyGenerated.sort,\n  inv: _pureFunctionsAnyGenerated.inv,\n  lup: _pureFunctionsAnyGenerated.lup,\n  pinv: _pureFunctionsAnyGenerated.pinv,\n  pow: _pureFunctionsAnyGenerated.pow,\n  setIntersect: _pureFunctionsAnyGenerated.setIntersect,\n  setUnion: _pureFunctionsAnyGenerated.setUnion,\n  sqrtm: _pureFunctionsAnyGenerated.sqrtm,\n  vacuumImpedance: _pureFunctionsAnyGenerated.vacuumImpedance,\n  wienDisplacement: _pureFunctionsAnyGenerated.wienDisplacement,\n  atomicMass: _pureFunctionsAnyGenerated.atomicMass,\n  bohrMagneton: _pureFunctionsAnyGenerated.bohrMagneton,\n  boltzmann: _pureFunctionsAnyGenerated.boltzmann,\n  conductanceQuantum: _pureFunctionsAnyGenerated.conductanceQuantum,\n  createUnit: _pureFunctionsAnyGenerated.createUnit,\n  deuteronMass: _pureFunctionsAnyGenerated.deuteronMass,\n  dotPow: _pureFunctionsAnyGenerated.dotPow,\n  electricConstant: _pureFunctionsAnyGenerated.electricConstant,\n  elementaryCharge: _pureFunctionsAnyGenerated.elementaryCharge,\n  expm: _pureFunctionsAnyGenerated.expm,\n  faraday: _pureFunctionsAnyGenerated.faraday,\n  fft: _pureFunctionsAnyGenerated.fft,\n  gamma: _pureFunctionsAnyGenerated.gamma,\n  gravitationConstant: _pureFunctionsAnyGenerated.gravitationConstant,\n  hartreeEnergy: _pureFunctionsAnyGenerated.hartreeEnergy,\n  ifft: _pureFunctionsAnyGenerated.ifft,\n  klitzing: _pureFunctionsAnyGenerated.klitzing,\n  loschmidt: _pureFunctionsAnyGenerated.loschmidt,\n  magneticConstant: _pureFunctionsAnyGenerated.magneticConstant,\n  molarMass: _pureFunctionsAnyGenerated.molarMass,\n  molarPlanckConstant: _pureFunctionsAnyGenerated.molarPlanckConstant,\n  neutronMass: _pureFunctionsAnyGenerated.neutronMass,\n  nuclearMagneton: _pureFunctionsAnyGenerated.nuclearMagneton,\n  planckCharge: _pureFunctionsAnyGenerated.planckCharge,\n  planckLength: _pureFunctionsAnyGenerated.planckLength,\n  planckTemperature: _pureFunctionsAnyGenerated.planckTemperature,\n  protonMass: _pureFunctionsAnyGenerated.protonMass,\n  reducedPlanckConstant: _pureFunctionsAnyGenerated.reducedPlanckConstant,\n  rydberg: _pureFunctionsAnyGenerated.rydberg,\n  secondRadiation: _pureFunctionsAnyGenerated.secondRadiation,\n  speedOfLight: _pureFunctionsAnyGenerated.speedOfLight,\n  stefanBoltzmann: _pureFunctionsAnyGenerated.stefanBoltzmann,\n  thomsonCrossSection: _pureFunctionsAnyGenerated.thomsonCrossSection,\n  avogadro: _pureFunctionsAnyGenerated.avogadro,\n  bohrRadius: _pureFunctionsAnyGenerated.bohrRadius,\n  coulomb: _pureFunctionsAnyGenerated.coulomb,\n  divide: _pureFunctionsAnyGenerated.divide,\n  electronMass: _pureFunctionsAnyGenerated.electronMass,\n  factorial: _pureFunctionsAnyGenerated.factorial,\n  firstRadiation: _pureFunctionsAnyGenerated.firstRadiation,\n  gasConstant: _pureFunctionsAnyGenerated.gasConstant,\n  inverseConductanceQuantum: _pureFunctionsAnyGenerated.inverseConductanceQuantum,\n  lusolve: _pureFunctionsAnyGenerated.lusolve,\n  magneticFluxQuantum: _pureFunctionsAnyGenerated.magneticFluxQuantum,\n  molarMassC12: _pureFunctionsAnyGenerated.molarMassC12,\n  multinomial: _pureFunctionsAnyGenerated.multinomial,\n  permutations: _pureFunctionsAnyGenerated.permutations,\n  planckMass: _pureFunctionsAnyGenerated.planckMass,\n  polynomialRoot: _pureFunctionsAnyGenerated.polynomialRoot,\n  setSize: _pureFunctionsAnyGenerated.setSize,\n  stirlingS2: _pureFunctionsAnyGenerated.stirlingS2,\n  unit: _pureFunctionsAnyGenerated.unit,\n  bellNumbers: _pureFunctionsAnyGenerated.bellNumbers,\n  eigs: _pureFunctionsAnyGenerated.eigs,\n  fermiCoupling: _pureFunctionsAnyGenerated.fermiCoupling,\n  gravity: _pureFunctionsAnyGenerated.gravity,\n  kldivergence: _pureFunctionsAnyGenerated.kldivergence,\n  mean: _pureFunctionsAnyGenerated.mean,\n  molarVolume: _pureFunctionsAnyGenerated.molarVolume,\n  planckConstant: _pureFunctionsAnyGenerated.planckConstant,\n  quantumOfCirculation: _pureFunctionsAnyGenerated.quantumOfCirculation,\n  variance: _pureFunctionsAnyGenerated.variance,\n  classicalElectronRadius: _pureFunctionsAnyGenerated.classicalElectronRadius,\n  median: _pureFunctionsAnyGenerated.median,\n  parse: parse,\n  planckTime: _pureFunctionsAnyGenerated.planckTime,\n  resolve: resolve,\n  simplifyConstant: simplifyConstant,\n  std: _pureFunctionsAnyGenerated.std,\n  compile: compile,\n  evaluate: evaluate,\n  mad: _pureFunctionsAnyGenerated.mad,\n  simplifyCore: simplifyCore,\n  help: help,\n  norm: _pureFunctionsAnyGenerated.norm,\n  rotationMatrix: _pureFunctionsAnyGenerated.rotationMatrix,\n  simplify: simplify,\n  symbolicEqual: symbolicEqual,\n  derivative: derivative,\n  parser: parser,\n  rotate: _pureFunctionsAnyGenerated.rotate,\n  leafCount: leafCount,\n  rationalize: rationalize,\n  schur: _pureFunctionsAnyGenerated.schur,\n  sylvester: _pureFunctionsAnyGenerated.sylvester,\n  lyap: _pureFunctionsAnyGenerated.lyap,\n  config: _configReadonly.config\n});\n(0, _extends2[\"default\"])(mathWithTransform, math, {\n  filter: (0, _factoriesAny.createFilterTransform)({\n    typed: _pureFunctionsAnyGenerated.typed\n  }),\n  forEach: (0, _factoriesAny.createForEachTransform)({\n    typed: _pureFunctionsAnyGenerated.typed\n  }),\n  map: (0, _factoriesAny.createMapTransform)({\n    typed: _pureFunctionsAnyGenerated.typed\n  }),\n  apply: (0, _factoriesAny.createApplyTransform)({\n    isInteger: _pureFunctionsAnyGenerated.isInteger,\n    typed: _pureFunctionsAnyGenerated.typed\n  }),\n  subset: (0, _factoriesAny.createSubsetTransform)({\n    matrix: _pureFunctionsAnyGenerated.matrix,\n    typed: _pureFunctionsAnyGenerated.typed\n  }),\n  concat: (0, _factoriesAny.createConcatTransform)({\n    isInteger: _pureFunctionsAnyGenerated.isInteger,\n    matrix: _pureFunctionsAnyGenerated.matrix,\n    typed: _pureFunctionsAnyGenerated.typed\n  }),\n  max: (0, _factoriesAny.createMaxTransform)({\n    config: _configReadonly.config,\n    larger: _pureFunctionsAnyGenerated.larger,\n    numeric: _pureFunctionsAnyGenerated.numeric,\n    typed: _pureFunctionsAnyGenerated.typed\n  }),\n  sum: (0, _factoriesAny.createSumTransform)({\n    add: _pureFunctionsAnyGenerated.add,\n    config: _configReadonly.config,\n    numeric: _pureFunctionsAnyGenerated.numeric,\n    typed: _pureFunctionsAnyGenerated.typed\n  }),\n  min: (0, _factoriesAny.createMinTransform)({\n    config: _configReadonly.config,\n    numeric: _pureFunctionsAnyGenerated.numeric,\n    smaller: _pureFunctionsAnyGenerated.smaller,\n    typed: _pureFunctionsAnyGenerated.typed\n  }),\n  cumsum: (0, _factoriesAny.createCumSumTransform)({\n    add: _pureFunctionsAnyGenerated.add,\n    typed: _pureFunctionsAnyGenerated.typed,\n    unaryPlus: _pureFunctionsAnyGenerated.unaryPlus\n  }),\n  diff: (0, _factoriesAny.createDiffTransform)({\n    bignumber: _pureFunctionsAnyGenerated.bignumber,\n    matrix: _pureFunctionsAnyGenerated.matrix,\n    number: _pureFunctionsAnyGenerated.number,\n    subtract: _pureFunctionsAnyGenerated.subtract,\n    typed: _pureFunctionsAnyGenerated.typed\n  }),\n  index: (0, _factoriesAny.createIndexTransform)({\n    Index: _pureFunctionsAnyGenerated.Index\n  }),\n  range: (0, _factoriesAny.createRangeTransform)({\n    bignumber: _pureFunctionsAnyGenerated.bignumber,\n    matrix: _pureFunctionsAnyGenerated.matrix,\n    config: _configReadonly.config,\n    larger: _pureFunctionsAnyGenerated.larger,\n    largerEq: _pureFunctionsAnyGenerated.largerEq,\n    smaller: _pureFunctionsAnyGenerated.smaller,\n    smallerEq: _pureFunctionsAnyGenerated.smallerEq,\n    typed: _pureFunctionsAnyGenerated.typed\n  }),\n  row: (0, _factoriesAny.createRowTransform)({\n    Index: _pureFunctionsAnyGenerated.Index,\n    matrix: _pureFunctionsAnyGenerated.matrix,\n    range: _pureFunctionsAnyGenerated.range,\n    typed: _pureFunctionsAnyGenerated.typed\n  }),\n  column: (0, _factoriesAny.createColumnTransform)({\n    Index: _pureFunctionsAnyGenerated.Index,\n    matrix: _pureFunctionsAnyGenerated.matrix,\n    range: _pureFunctionsAnyGenerated.range,\n    typed: _pureFunctionsAnyGenerated.typed\n  }),\n  mean: (0, _factoriesAny.createMeanTransform)({\n    add: _pureFunctionsAnyGenerated.add,\n    divide: _pureFunctionsAnyGenerated.divide,\n    typed: _pureFunctionsAnyGenerated.typed\n  }),\n  variance: (0, _factoriesAny.createVarianceTransform)({\n    add: _pureFunctionsAnyGenerated.add,\n    apply: _pureFunctionsAnyGenerated.apply,\n    divide: _pureFunctionsAnyGenerated.divide,\n    isNaN: _pureFunctionsAnyGenerated.isNaN,\n    multiply: _pureFunctionsAnyGenerated.multiply,\n    subtract: _pureFunctionsAnyGenerated.subtract,\n    typed: _pureFunctionsAnyGenerated.typed\n  }),\n  std: (0, _factoriesAny.createStdTransform)({\n    map: _pureFunctionsAnyGenerated.map,\n    sqrt: _pureFunctionsAnyGenerated.sqrt,\n    typed: _pureFunctionsAnyGenerated.typed,\n    variance: _pureFunctionsAnyGenerated.variance\n  })\n});\n(0, _extends2[\"default\"])(classes, {\n  BigNumber: _pureFunctionsAnyGenerated.BigNumber,\n  Complex: _pureFunctionsAnyGenerated.Complex,\n  Fraction: _pureFunctionsAnyGenerated.Fraction,\n  Matrix: _pureFunctionsAnyGenerated.Matrix,\n  Node: Node,\n  ObjectNode: ObjectNode,\n  OperatorNode: OperatorNode,\n  ParenthesisNode: ParenthesisNode,\n  Range: _pureFunctionsAnyGenerated.Range,\n  RelationalNode: RelationalNode,\n  ResultSet: _pureFunctionsAnyGenerated.ResultSet,\n  ArrayNode: ArrayNode,\n  BlockNode: BlockNode,\n  ConditionalNode: ConditionalNode,\n  ConstantNode: ConstantNode,\n  DenseMatrix: _pureFunctionsAnyGenerated.DenseMatrix,\n  RangeNode: RangeNode,\n  Chain: Chain,\n  FunctionAssignmentNode: FunctionAssignmentNode,\n  SparseMatrix: _pureFunctionsAnyGenerated.SparseMatrix,\n  AccessorNode: AccessorNode,\n  IndexNode: IndexNode,\n  AssignmentNode: AssignmentNode,\n  ImmutableDenseMatrix: _pureFunctionsAnyGenerated.ImmutableDenseMatrix,\n  Index: _pureFunctionsAnyGenerated.Index,\n  FibonacciHeap: _pureFunctionsAnyGenerated.FibonacciHeap,\n  Spa: _pureFunctionsAnyGenerated.Spa,\n  Unit: _pureFunctionsAnyGenerated.Unit,\n  SymbolNode: SymbolNode,\n  FunctionNode: FunctionNode,\n  Help: Help,\n  Parser: Parser\n});\nChain.createProxy(math);","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nObject.defineProperty(exports, \"isAccessorNode\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isAccessorNode;\n  }\n});\nObject.defineProperty(exports, \"isArray\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isArray;\n  }\n});\nObject.defineProperty(exports, \"isArrayNode\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isArrayNode;\n  }\n});\nObject.defineProperty(exports, \"isAssignmentNode\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isAssignmentNode;\n  }\n});\nObject.defineProperty(exports, \"isBigNumber\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isBigNumber;\n  }\n});\nObject.defineProperty(exports, \"isBlockNode\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isBlockNode;\n  }\n});\nObject.defineProperty(exports, \"isBoolean\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isBoolean;\n  }\n});\nObject.defineProperty(exports, \"isChain\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isChain;\n  }\n});\nObject.defineProperty(exports, \"isCollection\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isCollection;\n  }\n});\nObject.defineProperty(exports, \"isComplex\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isComplex;\n  }\n});\nObject.defineProperty(exports, \"isConditionalNode\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isConditionalNode;\n  }\n});\nObject.defineProperty(exports, \"isConstantNode\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isConstantNode;\n  }\n});\nObject.defineProperty(exports, \"isDate\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isDate;\n  }\n});\nObject.defineProperty(exports, \"isDenseMatrix\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isDenseMatrix;\n  }\n});\nObject.defineProperty(exports, \"isFraction\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isFraction;\n  }\n});\nObject.defineProperty(exports, \"isFunction\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isFunction;\n  }\n});\nObject.defineProperty(exports, \"isFunctionAssignmentNode\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isFunctionAssignmentNode;\n  }\n});\nObject.defineProperty(exports, \"isFunctionNode\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isFunctionNode;\n  }\n});\nObject.defineProperty(exports, \"isHelp\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isHelp;\n  }\n});\nObject.defineProperty(exports, \"isIndex\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isIndex;\n  }\n});\nObject.defineProperty(exports, \"isIndexNode\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isIndexNode;\n  }\n});\nObject.defineProperty(exports, \"isMatrix\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isMatrix;\n  }\n});\nObject.defineProperty(exports, \"isNode\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isNode;\n  }\n});\nObject.defineProperty(exports, \"isNull\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isNull;\n  }\n});\nObject.defineProperty(exports, \"isNumber\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isNumber;\n  }\n});\nObject.defineProperty(exports, \"isObject\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isObject;\n  }\n});\nObject.defineProperty(exports, \"isObjectNode\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isObjectNode;\n  }\n});\nObject.defineProperty(exports, \"isOperatorNode\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isOperatorNode;\n  }\n});\nObject.defineProperty(exports, \"isParenthesisNode\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isParenthesisNode;\n  }\n});\nObject.defineProperty(exports, \"isRange\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isRange;\n  }\n});\nObject.defineProperty(exports, \"isRangeNode\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isRangeNode;\n  }\n});\nObject.defineProperty(exports, \"isRegExp\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isRegExp;\n  }\n});\nObject.defineProperty(exports, \"isRelationalNode\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isRelationalNode;\n  }\n});\nObject.defineProperty(exports, \"isResultSet\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isResultSet;\n  }\n});\nObject.defineProperty(exports, \"isSparseMatrix\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isSparseMatrix;\n  }\n});\nObject.defineProperty(exports, \"isString\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isString;\n  }\n});\nObject.defineProperty(exports, \"isSymbolNode\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isSymbolNode;\n  }\n});\nObject.defineProperty(exports, \"isUndefined\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isUndefined;\n  }\n});\nObject.defineProperty(exports, \"isUnit\", {\n  enumerable: true,\n  get: function get() {\n    return _is.isUnit;\n  }\n});\nvar _is = require(\"../utils/is.js\");","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.BigNumberDependencies = void 0;\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar BigNumberDependencies = {\n  createBigNumberClass: _factoriesAny.createBigNumberClass\n};\nexports.BigNumberDependencies = BigNumberDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.ComplexDependencies = void 0;\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar ComplexDependencies = {\n  createComplexClass: _factoriesAny.createComplexClass\n};\nexports.ComplexDependencies = ComplexDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.MatrixDependencies = void 0;\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar MatrixDependencies = {\n  createMatrixClass: _factoriesAny.createMatrixClass\n};\nexports.MatrixDependencies = MatrixDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.DenseMatrixDependencies = void 0;\nvar _dependenciesMatrixClassGenerated = require(\"./dependenciesMatrixClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar DenseMatrixDependencies = {\n  MatrixDependencies: _dependenciesMatrixClassGenerated.MatrixDependencies,\n  createDenseMatrixClass: _factoriesAny.createDenseMatrixClass\n};\nexports.DenseMatrixDependencies = DenseMatrixDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.FractionDependencies = void 0;\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar FractionDependencies = {\n  createFractionClass: _factoriesAny.createFractionClass\n};\nexports.FractionDependencies = FractionDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.typedDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesFractionClassGenerated = require(\"./dependenciesFractionClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar typedDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  FractionDependencies: _dependenciesFractionClassGenerated.FractionDependencies,\n  createTyped: _factoriesAny.createTyped\n};\nexports.typedDependencies = typedDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.absDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar absDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createAbs: _factoriesAny.createAbs\n};\nexports.absDependencies = absDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.NodeDependencies = void 0;\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar NodeDependencies = {\n  createNode: _factoriesAny.createNode\n};\nexports.NodeDependencies = NodeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.equalScalarDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar equalScalarDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createEqualScalar: _factoriesAny.createEqualScalar\n};\nexports.equalScalarDependencies = equalScalarDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.SparseMatrixDependencies = void 0;\nvar _dependenciesMatrixClassGenerated = require(\"./dependenciesMatrixClass.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar SparseMatrixDependencies = {\n  MatrixDependencies: _dependenciesMatrixClassGenerated.MatrixDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSparseMatrixClass: _factoriesAny.createSparseMatrixClass\n};\nexports.SparseMatrixDependencies = SparseMatrixDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.matrixDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesMatrixClassGenerated = require(\"./dependenciesMatrixClass.generated.js\");\nvar _dependenciesSparseMatrixClassGenerated = require(\"./dependenciesSparseMatrixClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar matrixDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  MatrixDependencies: _dependenciesMatrixClassGenerated.MatrixDependencies,\n  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createMatrix: _factoriesAny.createMatrix\n};\nexports.matrixDependencies = matrixDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.subsetDependencies = void 0;\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar subsetDependencies = {\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSubset: _factoriesAny.createSubset\n};\nexports.subsetDependencies = subsetDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.AccessorNodeDependencies = void 0;\nvar _dependenciesNodeGenerated = require(\"./dependenciesNode.generated.js\");\nvar _dependenciesSubsetGenerated = require(\"./dependenciesSubset.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar AccessorNodeDependencies = {\n  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,\n  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,\n  createAccessorNode: _factoriesAny.createAccessorNode\n};\nexports.AccessorNodeDependencies = AccessorNodeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.acosDependencies = void 0;\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar acosDependencies = {\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createAcos: _factoriesAny.createAcos\n};\nexports.acosDependencies = acosDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.acoshDependencies = void 0;\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar acoshDependencies = {\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createAcosh: _factoriesAny.createAcosh\n};\nexports.acoshDependencies = acoshDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.acotDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar acotDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createAcot: _factoriesAny.createAcot\n};\nexports.acotDependencies = acotDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.acothDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar acothDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createAcoth: _factoriesAny.createAcoth\n};\nexports.acothDependencies = acothDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.acscDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar acscDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createAcsc: _factoriesAny.createAcsc\n};\nexports.acscDependencies = acscDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.acschDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar acschDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createAcsch: _factoriesAny.createAcsch\n};\nexports.acschDependencies = acschDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.addScalarDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar addScalarDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createAddScalar: _factoriesAny.createAddScalar\n};\nexports.addScalarDependencies = addScalarDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.isIntegerDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar isIntegerDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createIsInteger: _factoriesAny.createIsInteger\n};\nexports.isIntegerDependencies = isIntegerDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.concatDependencies = void 0;\nvar _dependenciesIsIntegerGenerated = require(\"./dependenciesIsInteger.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar concatDependencies = {\n  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createConcat: _factoriesAny.createConcat\n};\nexports.concatDependencies = concatDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.addDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesSparseMatrixClassGenerated = require(\"./dependenciesSparseMatrixClass.generated.js\");\nvar _dependenciesAddScalarGenerated = require(\"./dependenciesAddScalar.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar addDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,\n  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createAdd: _factoriesAny.createAdd\n};\nexports.addDependencies = addDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.notDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar notDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createNot: _factoriesAny.createNot\n};\nexports.notDependencies = notDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.zerosDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar zerosDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createZeros: _factoriesAny.createZeros\n};\nexports.zerosDependencies = zerosDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.andDependencies = void 0;\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesNotGenerated = require(\"./dependenciesNot.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _dependenciesZerosGenerated = require(\"./dependenciesZeros.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar andDependencies = {\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  notDependencies: _dependenciesNotGenerated.notDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,\n  createAnd: _factoriesAny.createAnd\n};\nexports.andDependencies = andDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.applyDependencies = void 0;\nvar _dependenciesIsIntegerGenerated = require(\"./dependenciesIsInteger.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar applyDependencies = {\n  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createApply: _factoriesAny.createApply\n};\nexports.applyDependencies = applyDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.applyTransformDependencies = void 0;\nvar _dependenciesIsIntegerGenerated = require(\"./dependenciesIsInteger.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar applyTransformDependencies = {\n  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createApplyTransform: _factoriesAny.createApplyTransform\n};\nexports.applyTransformDependencies = applyTransformDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.argDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar argDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createArg: _factoriesAny.createArg\n};\nexports.argDependencies = argDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.ArrayNodeDependencies = void 0;\nvar _dependenciesNodeGenerated = require(\"./dependenciesNode.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar ArrayNodeDependencies = {\n  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,\n  createArrayNode: _factoriesAny.createArrayNode\n};\nexports.ArrayNodeDependencies = ArrayNodeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.asecDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar asecDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createAsec: _factoriesAny.createAsec\n};\nexports.asecDependencies = asecDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.asechDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar asechDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createAsech: _factoriesAny.createAsech\n};\nexports.asechDependencies = asechDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.asinDependencies = void 0;\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar asinDependencies = {\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createAsin: _factoriesAny.createAsin\n};\nexports.asinDependencies = asinDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.asinhDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar asinhDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createAsinh: _factoriesAny.createAsinh\n};\nexports.asinhDependencies = asinhDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.AssignmentNodeDependencies = void 0;\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesNodeGenerated = require(\"./dependenciesNode.generated.js\");\nvar _dependenciesSubsetGenerated = require(\"./dependenciesSubset.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar AssignmentNodeDependencies = {\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,\n  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,\n  createAssignmentNode: _factoriesAny.createAssignmentNode\n};\nexports.AssignmentNodeDependencies = AssignmentNodeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.atanDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar atanDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createAtan: _factoriesAny.createAtan\n};\nexports.atanDependencies = atanDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.atan2Dependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar atan2Dependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createAtan2: _factoriesAny.createAtan2\n};\nexports.atan2Dependencies = atan2Dependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.atanhDependencies = void 0;\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar atanhDependencies = {\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createAtanh: _factoriesAny.createAtanh\n};\nexports.atanhDependencies = atanhDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.bignumberDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar bignumberDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createBignumber: _factoriesAny.createBignumber\n};\nexports.bignumberDependencies = bignumberDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.fractionDependencies = void 0;\nvar _dependenciesFractionClassGenerated = require(\"./dependenciesFractionClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar fractionDependencies = {\n  FractionDependencies: _dependenciesFractionClassGenerated.FractionDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createFraction: _factoriesAny.createFraction\n};\nexports.fractionDependencies = fractionDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.numberDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar numberDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createNumber: _factoriesAny.createNumber\n};\nexports.numberDependencies = numberDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.numericDependencies = void 0;\nvar _dependenciesBignumberGenerated = require(\"./dependenciesBignumber.generated.js\");\nvar _dependenciesFractionGenerated = require(\"./dependenciesFraction.generated.js\");\nvar _dependenciesNumberGenerated = require(\"./dependenciesNumber.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar numericDependencies = {\n  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,\n  fractionDependencies: _dependenciesFractionGenerated.fractionDependencies,\n  numberDependencies: _dependenciesNumberGenerated.numberDependencies,\n  createNumeric: _factoriesAny.createNumeric\n};\nexports.numericDependencies = numericDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.divideScalarDependencies = void 0;\nvar _dependenciesNumericGenerated = require(\"./dependenciesNumeric.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar divideScalarDependencies = {\n  numericDependencies: _dependenciesNumericGenerated.numericDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createDivideScalar: _factoriesAny.createDivideScalar\n};\nexports.divideScalarDependencies = divideScalarDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.equalDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar equalDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createEqual: _factoriesAny.createEqual\n};\nexports.equalDependencies = equalDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.roundDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _dependenciesZerosGenerated = require(\"./dependenciesZeros.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar roundDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,\n  createRound: _factoriesAny.createRound\n};\nexports.roundDependencies = roundDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.ceilDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesRoundGenerated = require(\"./dependenciesRound.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _dependenciesZerosGenerated = require(\"./dependenciesZeros.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar ceilDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  roundDependencies: _dependenciesRoundGenerated.roundDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,\n  createCeil: _factoriesAny.createCeil\n};\nexports.ceilDependencies = ceilDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.floorDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesRoundGenerated = require(\"./dependenciesRound.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _dependenciesZerosGenerated = require(\"./dependenciesZeros.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar floorDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  roundDependencies: _dependenciesRoundGenerated.roundDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,\n  createFloor: _factoriesAny.createFloor\n};\nexports.floorDependencies = floorDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.fixDependencies = void 0;\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesCeilGenerated = require(\"./dependenciesCeil.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesFloorGenerated = require(\"./dependenciesFloor.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _dependenciesZerosGenerated = require(\"./dependenciesZeros.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar fixDependencies = {\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  ceilDependencies: _dependenciesCeilGenerated.ceilDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  floorDependencies: _dependenciesFloorGenerated.floorDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,\n  createFix: _factoriesAny.createFix\n};\nexports.fixDependencies = fixDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.formatDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar formatDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createFormat: _factoriesAny.createFormat\n};\nexports.formatDependencies = formatDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.isNumericDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar isNumericDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createIsNumeric: _factoriesAny.createIsNumeric\n};\nexports.isNumericDependencies = isNumericDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.multiplyScalarDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar multiplyScalarDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createMultiplyScalar: _factoriesAny.createMultiplyScalar\n};\nexports.multiplyScalarDependencies = multiplyScalarDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.identityDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesSparseMatrixClassGenerated = require(\"./dependenciesSparseMatrixClass.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar identityDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createIdentity: _factoriesAny.createIdentity\n};\nexports.identityDependencies = identityDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.isZeroDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar isZeroDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createIsZero: _factoriesAny.createIsZero\n};\nexports.isZeroDependencies = isZeroDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.conjDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar conjDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createConj: _factoriesAny.createConj\n};\nexports.conjDependencies = conjDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.sizeDependencies = void 0;\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar sizeDependencies = {\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSize: _factoriesAny.createSize\n};\nexports.sizeDependencies = sizeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.dotDependencies = void 0;\nvar _dependenciesAddScalarGenerated = require(\"./dependenciesAddScalar.generated.js\");\nvar _dependenciesConjGenerated = require(\"./dependenciesConj.generated.js\");\nvar _dependenciesMultiplyScalarGenerated = require(\"./dependenciesMultiplyScalar.generated.js\");\nvar _dependenciesSizeGenerated = require(\"./dependenciesSize.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar dotDependencies = {\n  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,\n  conjDependencies: _dependenciesConjGenerated.conjDependencies,\n  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,\n  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createDot: _factoriesAny.createDot\n};\nexports.dotDependencies = dotDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.multiplyDependencies = void 0;\nvar _dependenciesAddScalarGenerated = require(\"./dependenciesAddScalar.generated.js\");\nvar _dependenciesDotGenerated = require(\"./dependenciesDot.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMultiplyScalarGenerated = require(\"./dependenciesMultiplyScalar.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar multiplyDependencies = {\n  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,\n  dotDependencies: _dependenciesDotGenerated.dotDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createMultiply: _factoriesAny.createMultiply\n};\nexports.multiplyDependencies = multiplyDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.unaryMinusDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar unaryMinusDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createUnaryMinus: _factoriesAny.createUnaryMinus\n};\nexports.unaryMinusDependencies = unaryMinusDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.subtractDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesAddScalarGenerated = require(\"./dependenciesAddScalar.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _dependenciesUnaryMinusGenerated = require(\"./dependenciesUnaryMinus.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar subtractDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,\n  createSubtract: _factoriesAny.createSubtract\n};\nexports.subtractDependencies = subtractDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.detDependencies = void 0;\nvar _dependenciesDivideScalarGenerated = require(\"./dependenciesDivideScalar.generated.js\");\nvar _dependenciesIsZeroGenerated = require(\"./dependenciesIsZero.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _dependenciesUnaryMinusGenerated = require(\"./dependenciesUnaryMinus.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar detDependencies = {\n  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,\n  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,\n  createDet: _factoriesAny.createDet\n};\nexports.detDependencies = detDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.invDependencies = void 0;\nvar _dependenciesAbsGenerated = require(\"./dependenciesAbs.generated.js\");\nvar _dependenciesAddScalarGenerated = require(\"./dependenciesAddScalar.generated.js\");\nvar _dependenciesDetGenerated = require(\"./dependenciesDet.generated.js\");\nvar _dependenciesDivideScalarGenerated = require(\"./dependenciesDivideScalar.generated.js\");\nvar _dependenciesIdentityGenerated = require(\"./dependenciesIdentity.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _dependenciesUnaryMinusGenerated = require(\"./dependenciesUnaryMinus.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar invDependencies = {\n  absDependencies: _dependenciesAbsGenerated.absDependencies,\n  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,\n  detDependencies: _dependenciesDetGenerated.detDependencies,\n  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,\n  identityDependencies: _dependenciesIdentityGenerated.identityDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,\n  createInv: _factoriesAny.createInv\n};\nexports.invDependencies = invDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.powDependencies = void 0;\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _dependenciesFractionGenerated = require(\"./dependenciesFraction.generated.js\");\nvar _dependenciesIdentityGenerated = require(\"./dependenciesIdentity.generated.js\");\nvar _dependenciesInvGenerated = require(\"./dependenciesInv.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesNumberGenerated = require(\"./dependenciesNumber.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar powDependencies = {\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  fractionDependencies: _dependenciesFractionGenerated.fractionDependencies,\n  identityDependencies: _dependenciesIdentityGenerated.identityDependencies,\n  invDependencies: _dependenciesInvGenerated.invDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  numberDependencies: _dependenciesNumberGenerated.numberDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createPow: _factoriesAny.createPow\n};\nexports.powDependencies = powDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.UnitDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _dependenciesFractionClassGenerated = require(\"./dependenciesFractionClass.generated.js\");\nvar _dependenciesAbsGenerated = require(\"./dependenciesAbs.generated.js\");\nvar _dependenciesAddScalarGenerated = require(\"./dependenciesAddScalar.generated.js\");\nvar _dependenciesDivideScalarGenerated = require(\"./dependenciesDivideScalar.generated.js\");\nvar _dependenciesEqualGenerated = require(\"./dependenciesEqual.generated.js\");\nvar _dependenciesFixGenerated = require(\"./dependenciesFix.generated.js\");\nvar _dependenciesFormatGenerated = require(\"./dependenciesFormat.generated.js\");\nvar _dependenciesIsNumericGenerated = require(\"./dependenciesIsNumeric.generated.js\");\nvar _dependenciesMultiplyScalarGenerated = require(\"./dependenciesMultiplyScalar.generated.js\");\nvar _dependenciesNumberGenerated = require(\"./dependenciesNumber.generated.js\");\nvar _dependenciesPowGenerated = require(\"./dependenciesPow.generated.js\");\nvar _dependenciesRoundGenerated = require(\"./dependenciesRound.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar UnitDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  FractionDependencies: _dependenciesFractionClassGenerated.FractionDependencies,\n  absDependencies: _dependenciesAbsGenerated.absDependencies,\n  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,\n  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,\n  equalDependencies: _dependenciesEqualGenerated.equalDependencies,\n  fixDependencies: _dependenciesFixGenerated.fixDependencies,\n  formatDependencies: _dependenciesFormatGenerated.formatDependencies,\n  isNumericDependencies: _dependenciesIsNumericGenerated.isNumericDependencies,\n  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,\n  numberDependencies: _dependenciesNumberGenerated.numberDependencies,\n  powDependencies: _dependenciesPowGenerated.powDependencies,\n  roundDependencies: _dependenciesRoundGenerated.roundDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  createUnitClass: _factoriesAny.createUnitClass\n};\nexports.UnitDependencies = UnitDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.atomicMassDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar atomicMassDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createAtomicMass: _factoriesAny.createAtomicMass\n};\nexports.atomicMassDependencies = atomicMassDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.avogadroDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar avogadroDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createAvogadro: _factoriesAny.createAvogadro\n};\nexports.avogadroDependencies = avogadroDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.isNegativeDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar isNegativeDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createIsNegative: _factoriesAny.createIsNegative\n};\nexports.isNegativeDependencies = isNegativeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.combinationsDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar combinationsDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createCombinations: _factoriesAny.createCombinations\n};\nexports.combinationsDependencies = combinationsDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.gammaDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _dependenciesMultiplyScalarGenerated = require(\"./dependenciesMultiplyScalar.generated.js\");\nvar _dependenciesPowGenerated = require(\"./dependenciesPow.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar gammaDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,\n  powDependencies: _dependenciesPowGenerated.powDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createGamma: _factoriesAny.createGamma\n};\nexports.gammaDependencies = gammaDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.factorialDependencies = void 0;\nvar _dependenciesGammaGenerated = require(\"./dependenciesGamma.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar factorialDependencies = {\n  gammaDependencies: _dependenciesGammaGenerated.gammaDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createFactorial: _factoriesAny.createFactorial\n};\nexports.factorialDependencies = factorialDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.largerDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar largerDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createLarger: _factoriesAny.createLarger\n};\nexports.largerDependencies = largerDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.stirlingS2Dependencies = void 0;\nvar _dependenciesBignumberGenerated = require(\"./dependenciesBignumber.generated.js\");\nvar _dependenciesAddScalarGenerated = require(\"./dependenciesAddScalar.generated.js\");\nvar _dependenciesCombinationsGenerated = require(\"./dependenciesCombinations.generated.js\");\nvar _dependenciesDivideScalarGenerated = require(\"./dependenciesDivideScalar.generated.js\");\nvar _dependenciesFactorialGenerated = require(\"./dependenciesFactorial.generated.js\");\nvar _dependenciesIsIntegerGenerated = require(\"./dependenciesIsInteger.generated.js\");\nvar _dependenciesIsNegativeGenerated = require(\"./dependenciesIsNegative.generated.js\");\nvar _dependenciesLargerGenerated = require(\"./dependenciesLarger.generated.js\");\nvar _dependenciesMultiplyScalarGenerated = require(\"./dependenciesMultiplyScalar.generated.js\");\nvar _dependenciesNumberGenerated = require(\"./dependenciesNumber.generated.js\");\nvar _dependenciesPowGenerated = require(\"./dependenciesPow.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar stirlingS2Dependencies = {\n  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,\n  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,\n  combinationsDependencies: _dependenciesCombinationsGenerated.combinationsDependencies,\n  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,\n  factorialDependencies: _dependenciesFactorialGenerated.factorialDependencies,\n  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,\n  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,\n  largerDependencies: _dependenciesLargerGenerated.largerDependencies,\n  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,\n  numberDependencies: _dependenciesNumberGenerated.numberDependencies,\n  powDependencies: _dependenciesPowGenerated.powDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createStirlingS2: _factoriesAny.createStirlingS2\n};\nexports.stirlingS2Dependencies = stirlingS2Dependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.bellNumbersDependencies = void 0;\nvar _dependenciesAddScalarGenerated = require(\"./dependenciesAddScalar.generated.js\");\nvar _dependenciesIsIntegerGenerated = require(\"./dependenciesIsInteger.generated.js\");\nvar _dependenciesIsNegativeGenerated = require(\"./dependenciesIsNegative.generated.js\");\nvar _dependenciesStirlingS2Generated = require(\"./dependenciesStirlingS2.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar bellNumbersDependencies = {\n  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,\n  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,\n  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,\n  stirlingS2Dependencies: _dependenciesStirlingS2Generated.stirlingS2Dependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createBellNumbers: _factoriesAny.createBellNumbers\n};\nexports.bellNumbersDependencies = bellNumbersDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.binDependencies = void 0;\nvar _dependenciesFormatGenerated = require(\"./dependenciesFormat.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar binDependencies = {\n  formatDependencies: _dependenciesFormatGenerated.formatDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createBin: _factoriesAny.createBin\n};\nexports.binDependencies = binDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.bitAndDependencies = void 0;\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar bitAndDependencies = {\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createBitAnd: _factoriesAny.createBitAnd\n};\nexports.bitAndDependencies = bitAndDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.bitNotDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar bitNotDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createBitNot: _factoriesAny.createBitNot\n};\nexports.bitNotDependencies = bitNotDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.bitOrDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar bitOrDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createBitOr: _factoriesAny.createBitOr\n};\nexports.bitOrDependencies = bitOrDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.bitXorDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar bitXorDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createBitXor: _factoriesAny.createBitXor\n};\nexports.bitXorDependencies = bitXorDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.ResultSetDependencies = void 0;\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar ResultSetDependencies = {\n  createResultSet: _factoriesAny.createResultSet\n};\nexports.ResultSetDependencies = ResultSetDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.BlockNodeDependencies = void 0;\nvar _dependenciesNodeGenerated = require(\"./dependenciesNode.generated.js\");\nvar _dependenciesResultSetGenerated = require(\"./dependenciesResultSet.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar BlockNodeDependencies = {\n  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,\n  ResultSetDependencies: _dependenciesResultSetGenerated.ResultSetDependencies,\n  createBlockNode: _factoriesAny.createBlockNode\n};\nexports.BlockNodeDependencies = BlockNodeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.bohrMagnetonDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar bohrMagnetonDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createBohrMagneton: _factoriesAny.createBohrMagneton\n};\nexports.bohrMagnetonDependencies = bohrMagnetonDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.bohrRadiusDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar bohrRadiusDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createBohrRadius: _factoriesAny.createBohrRadius\n};\nexports.bohrRadiusDependencies = bohrRadiusDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.boltzmannDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar boltzmannDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createBoltzmann: _factoriesAny.createBoltzmann\n};\nexports.boltzmannDependencies = boltzmannDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.booleanDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar booleanDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createBoolean: _factoriesAny.createBoolean\n};\nexports.booleanDependencies = booleanDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.catalanDependencies = void 0;\nvar _dependenciesAddScalarGenerated = require(\"./dependenciesAddScalar.generated.js\");\nvar _dependenciesCombinationsGenerated = require(\"./dependenciesCombinations.generated.js\");\nvar _dependenciesDivideScalarGenerated = require(\"./dependenciesDivideScalar.generated.js\");\nvar _dependenciesIsIntegerGenerated = require(\"./dependenciesIsInteger.generated.js\");\nvar _dependenciesIsNegativeGenerated = require(\"./dependenciesIsNegative.generated.js\");\nvar _dependenciesMultiplyScalarGenerated = require(\"./dependenciesMultiplyScalar.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar catalanDependencies = {\n  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,\n  combinationsDependencies: _dependenciesCombinationsGenerated.combinationsDependencies,\n  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,\n  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,\n  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,\n  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createCatalan: _factoriesAny.createCatalan\n};\nexports.catalanDependencies = catalanDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.cbrtDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _dependenciesFractionClassGenerated = require(\"./dependenciesFractionClass.generated.js\");\nvar _dependenciesIsNegativeGenerated = require(\"./dependenciesIsNegative.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _dependenciesUnaryMinusGenerated = require(\"./dependenciesUnaryMinus.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar cbrtDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  FractionDependencies: _dependenciesFractionClassGenerated.FractionDependencies,\n  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,\n  createCbrt: _factoriesAny.createCbrt\n};\nexports.cbrtDependencies = cbrtDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.ChainDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar ChainDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createChainClass: _factoriesAny.createChainClass\n};\nexports.ChainDependencies = ChainDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.chainDependencies = void 0;\nvar _dependenciesChainClassGenerated = require(\"./dependenciesChainClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar chainDependencies = {\n  ChainDependencies: _dependenciesChainClassGenerated.ChainDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createChain: _factoriesAny.createChain\n};\nexports.chainDependencies = chainDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.classicalElectronRadiusDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar classicalElectronRadiusDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createClassicalElectronRadius: _factoriesAny.createClassicalElectronRadius\n};\nexports.classicalElectronRadiusDependencies = classicalElectronRadiusDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.cloneDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar cloneDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createClone: _factoriesAny.createClone\n};\nexports.cloneDependencies = cloneDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.smallerDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar smallerDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSmaller: _factoriesAny.createSmaller\n};\nexports.smallerDependencies = smallerDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.ImmutableDenseMatrixDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesSmallerGenerated = require(\"./dependenciesSmaller.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar ImmutableDenseMatrixDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,\n  createImmutableDenseMatrixClass: _factoriesAny.createImmutableDenseMatrixClass\n};\nexports.ImmutableDenseMatrixDependencies = ImmutableDenseMatrixDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.IndexDependencies = void 0;\nvar _dependenciesImmutableDenseMatrixClassGenerated = require(\"./dependenciesImmutableDenseMatrixClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar IndexDependencies = {\n  ImmutableDenseMatrixDependencies: _dependenciesImmutableDenseMatrixClassGenerated.ImmutableDenseMatrixDependencies,\n  createIndexClass: _factoriesAny.createIndexClass\n};\nexports.IndexDependencies = IndexDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.largerEqDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar largerEqDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createLargerEq: _factoriesAny.createLargerEq\n};\nexports.largerEqDependencies = largerEqDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.smallerEqDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar smallerEqDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSmallerEq: _factoriesAny.createSmallerEq\n};\nexports.smallerEqDependencies = smallerEqDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.rangeDependencies = void 0;\nvar _dependenciesBignumberGenerated = require(\"./dependenciesBignumber.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesLargerGenerated = require(\"./dependenciesLarger.generated.js\");\nvar _dependenciesLargerEqGenerated = require(\"./dependenciesLargerEq.generated.js\");\nvar _dependenciesSmallerGenerated = require(\"./dependenciesSmaller.generated.js\");\nvar _dependenciesSmallerEqGenerated = require(\"./dependenciesSmallerEq.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar rangeDependencies = {\n  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  largerDependencies: _dependenciesLargerGenerated.largerDependencies,\n  largerEqDependencies: _dependenciesLargerEqGenerated.largerEqDependencies,\n  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,\n  smallerEqDependencies: _dependenciesSmallerEqGenerated.smallerEqDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createRange: _factoriesAny.createRange\n};\nexports.rangeDependencies = rangeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.columnDependencies = void 0;\nvar _dependenciesIndexClassGenerated = require(\"./dependenciesIndexClass.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesRangeGenerated = require(\"./dependenciesRange.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar columnDependencies = {\n  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  rangeDependencies: _dependenciesRangeGenerated.rangeDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createColumn: _factoriesAny.createColumn\n};\nexports.columnDependencies = columnDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.columnTransformDependencies = void 0;\nvar _dependenciesIndexClassGenerated = require(\"./dependenciesIndexClass.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesRangeGenerated = require(\"./dependenciesRange.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar columnTransformDependencies = {\n  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  rangeDependencies: _dependenciesRangeGenerated.rangeDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createColumnTransform: _factoriesAny.createColumnTransform\n};\nexports.columnTransformDependencies = columnTransformDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.combinationsWithRepDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar combinationsWithRepDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createCombinationsWithRep: _factoriesAny.createCombinationsWithRep\n};\nexports.combinationsWithRepDependencies = combinationsWithRepDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.compareDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesFractionClassGenerated = require(\"./dependenciesFractionClass.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar compareDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  FractionDependencies: _dependenciesFractionClassGenerated.FractionDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createCompare: _factoriesAny.createCompare\n};\nexports.compareDependencies = compareDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.compareNaturalDependencies = void 0;\nvar _dependenciesCompareGenerated = require(\"./dependenciesCompare.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar compareNaturalDependencies = {\n  compareDependencies: _dependenciesCompareGenerated.compareDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createCompareNatural: _factoriesAny.createCompareNatural\n};\nexports.compareNaturalDependencies = compareNaturalDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.compareTextDependencies = void 0;\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar compareTextDependencies = {\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createCompareText: _factoriesAny.createCompareText\n};\nexports.compareTextDependencies = compareTextDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.ConditionalNodeDependencies = void 0;\nvar _dependenciesNodeGenerated = require(\"./dependenciesNode.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar ConditionalNodeDependencies = {\n  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,\n  createConditionalNode: _factoriesAny.createConditionalNode\n};\nexports.ConditionalNodeDependencies = ConditionalNodeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.ConstantNodeDependencies = void 0;\nvar _dependenciesNodeGenerated = require(\"./dependenciesNode.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar ConstantNodeDependencies = {\n  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,\n  createConstantNode: _factoriesAny.createConstantNode\n};\nexports.ConstantNodeDependencies = ConstantNodeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.FunctionAssignmentNodeDependencies = void 0;\nvar _dependenciesNodeGenerated = require(\"./dependenciesNode.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar FunctionAssignmentNodeDependencies = {\n  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createFunctionAssignmentNode: _factoriesAny.createFunctionAssignmentNode\n};\nexports.FunctionAssignmentNodeDependencies = FunctionAssignmentNodeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.SymbolNodeDependencies = void 0;\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _dependenciesNodeGenerated = require(\"./dependenciesNode.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar SymbolNodeDependencies = {\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,\n  createSymbolNode: _factoriesAny.createSymbolNode\n};\nexports.SymbolNodeDependencies = SymbolNodeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.FunctionNodeDependencies = void 0;\nvar _dependenciesNodeGenerated = require(\"./dependenciesNode.generated.js\");\nvar _dependenciesSymbolNodeGenerated = require(\"./dependenciesSymbolNode.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar FunctionNodeDependencies = {\n  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,\n  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,\n  createFunctionNode: _factoriesAny.createFunctionNode\n};\nexports.FunctionNodeDependencies = FunctionNodeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.IndexNodeDependencies = void 0;\nvar _dependenciesNodeGenerated = require(\"./dependenciesNode.generated.js\");\nvar _dependenciesSizeGenerated = require(\"./dependenciesSize.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar IndexNodeDependencies = {\n  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,\n  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,\n  createIndexNode: _factoriesAny.createIndexNode\n};\nexports.IndexNodeDependencies = IndexNodeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.ObjectNodeDependencies = void 0;\nvar _dependenciesNodeGenerated = require(\"./dependenciesNode.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar ObjectNodeDependencies = {\n  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,\n  createObjectNode: _factoriesAny.createObjectNode\n};\nexports.ObjectNodeDependencies = ObjectNodeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.OperatorNodeDependencies = void 0;\nvar _dependenciesNodeGenerated = require(\"./dependenciesNode.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar OperatorNodeDependencies = {\n  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,\n  createOperatorNode: _factoriesAny.createOperatorNode\n};\nexports.OperatorNodeDependencies = OperatorNodeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.ParenthesisNodeDependencies = void 0;\nvar _dependenciesNodeGenerated = require(\"./dependenciesNode.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar ParenthesisNodeDependencies = {\n  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,\n  createParenthesisNode: _factoriesAny.createParenthesisNode\n};\nexports.ParenthesisNodeDependencies = ParenthesisNodeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.RangeNodeDependencies = void 0;\nvar _dependenciesNodeGenerated = require(\"./dependenciesNode.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar RangeNodeDependencies = {\n  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,\n  createRangeNode: _factoriesAny.createRangeNode\n};\nexports.RangeNodeDependencies = RangeNodeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.RelationalNodeDependencies = void 0;\nvar _dependenciesNodeGenerated = require(\"./dependenciesNode.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar RelationalNodeDependencies = {\n  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,\n  createRelationalNode: _factoriesAny.createRelationalNode\n};\nexports.RelationalNodeDependencies = RelationalNodeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.parseDependencies = void 0;\nvar _dependenciesAccessorNodeGenerated = require(\"./dependenciesAccessorNode.generated.js\");\nvar _dependenciesArrayNodeGenerated = require(\"./dependenciesArrayNode.generated.js\");\nvar _dependenciesAssignmentNodeGenerated = require(\"./dependenciesAssignmentNode.generated.js\");\nvar _dependenciesBlockNodeGenerated = require(\"./dependenciesBlockNode.generated.js\");\nvar _dependenciesConditionalNodeGenerated = require(\"./dependenciesConditionalNode.generated.js\");\nvar _dependenciesConstantNodeGenerated = require(\"./dependenciesConstantNode.generated.js\");\nvar _dependenciesFunctionAssignmentNodeGenerated = require(\"./dependenciesFunctionAssignmentNode.generated.js\");\nvar _dependenciesFunctionNodeGenerated = require(\"./dependenciesFunctionNode.generated.js\");\nvar _dependenciesIndexNodeGenerated = require(\"./dependenciesIndexNode.generated.js\");\nvar _dependenciesObjectNodeGenerated = require(\"./dependenciesObjectNode.generated.js\");\nvar _dependenciesOperatorNodeGenerated = require(\"./dependenciesOperatorNode.generated.js\");\nvar _dependenciesParenthesisNodeGenerated = require(\"./dependenciesParenthesisNode.generated.js\");\nvar _dependenciesRangeNodeGenerated = require(\"./dependenciesRangeNode.generated.js\");\nvar _dependenciesRelationalNodeGenerated = require(\"./dependenciesRelationalNode.generated.js\");\nvar _dependenciesSymbolNodeGenerated = require(\"./dependenciesSymbolNode.generated.js\");\nvar _dependenciesNumericGenerated = require(\"./dependenciesNumeric.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar parseDependencies = {\n  AccessorNodeDependencies: _dependenciesAccessorNodeGenerated.AccessorNodeDependencies,\n  ArrayNodeDependencies: _dependenciesArrayNodeGenerated.ArrayNodeDependencies,\n  AssignmentNodeDependencies: _dependenciesAssignmentNodeGenerated.AssignmentNodeDependencies,\n  BlockNodeDependencies: _dependenciesBlockNodeGenerated.BlockNodeDependencies,\n  ConditionalNodeDependencies: _dependenciesConditionalNodeGenerated.ConditionalNodeDependencies,\n  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,\n  FunctionAssignmentNodeDependencies: _dependenciesFunctionAssignmentNodeGenerated.FunctionAssignmentNodeDependencies,\n  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,\n  IndexNodeDependencies: _dependenciesIndexNodeGenerated.IndexNodeDependencies,\n  ObjectNodeDependencies: _dependenciesObjectNodeGenerated.ObjectNodeDependencies,\n  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,\n  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,\n  RangeNodeDependencies: _dependenciesRangeNodeGenerated.RangeNodeDependencies,\n  RelationalNodeDependencies: _dependenciesRelationalNodeGenerated.RelationalNodeDependencies,\n  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,\n  numericDependencies: _dependenciesNumericGenerated.numericDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createParse: _factoriesAny.createParse\n};\nexports.parseDependencies = parseDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.compileDependencies = void 0;\nvar _dependenciesParseGenerated = require(\"./dependenciesParse.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar compileDependencies = {\n  parseDependencies: _dependenciesParseGenerated.parseDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createCompile: _factoriesAny.createCompile\n};\nexports.compileDependencies = compileDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.complexDependencies = void 0;\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar complexDependencies = {\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createComplex: _factoriesAny.createComplex\n};\nexports.complexDependencies = complexDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.isPositiveDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar isPositiveDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createIsPositive: _factoriesAny.createIsPositive\n};\nexports.isPositiveDependencies = isPositiveDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.compositionDependencies = void 0;\nvar _dependenciesAddScalarGenerated = require(\"./dependenciesAddScalar.generated.js\");\nvar _dependenciesCombinationsGenerated = require(\"./dependenciesCombinations.generated.js\");\nvar _dependenciesIsIntegerGenerated = require(\"./dependenciesIsInteger.generated.js\");\nvar _dependenciesIsNegativeGenerated = require(\"./dependenciesIsNegative.generated.js\");\nvar _dependenciesIsPositiveGenerated = require(\"./dependenciesIsPositive.generated.js\");\nvar _dependenciesLargerGenerated = require(\"./dependenciesLarger.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar compositionDependencies = {\n  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,\n  combinationsDependencies: _dependenciesCombinationsGenerated.combinationsDependencies,\n  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,\n  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,\n  isPositiveDependencies: _dependenciesIsPositiveGenerated.isPositiveDependencies,\n  largerDependencies: _dependenciesLargerGenerated.largerDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createComposition: _factoriesAny.createComposition\n};\nexports.compositionDependencies = compositionDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.concatTransformDependencies = void 0;\nvar _dependenciesIsIntegerGenerated = require(\"./dependenciesIsInteger.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar concatTransformDependencies = {\n  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createConcatTransform: _factoriesAny.createConcatTransform\n};\nexports.concatTransformDependencies = concatTransformDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.conductanceQuantumDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar conductanceQuantumDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createConductanceQuantum: _factoriesAny.createConductanceQuantum\n};\nexports.conductanceQuantumDependencies = conductanceQuantumDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.cosDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar cosDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createCos: _factoriesAny.createCos\n};\nexports.cosDependencies = cosDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.coshDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar coshDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createCosh: _factoriesAny.createCosh\n};\nexports.coshDependencies = coshDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.cotDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar cotDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createCot: _factoriesAny.createCot\n};\nexports.cotDependencies = cotDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.cothDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar cothDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createCoth: _factoriesAny.createCoth\n};\nexports.cothDependencies = cothDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.coulombDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar coulombDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createCoulomb: _factoriesAny.createCoulomb\n};\nexports.coulombDependencies = coulombDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.prodDependencies = void 0;\nvar _dependenciesMultiplyScalarGenerated = require(\"./dependenciesMultiplyScalar.generated.js\");\nvar _dependenciesNumericGenerated = require(\"./dependenciesNumeric.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar prodDependencies = {\n  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,\n  numericDependencies: _dependenciesNumericGenerated.numericDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createProd: _factoriesAny.createProd\n};\nexports.prodDependencies = prodDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.countDependencies = void 0;\nvar _dependenciesProdGenerated = require(\"./dependenciesProd.generated.js\");\nvar _dependenciesSizeGenerated = require(\"./dependenciesSize.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar countDependencies = {\n  prodDependencies: _dependenciesProdGenerated.prodDependencies,\n  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createCount: _factoriesAny.createCount\n};\nexports.countDependencies = countDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createUnitDependencies = void 0;\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar createUnitDependencies = {\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createCreateUnit: _factoriesAny.createCreateUnit\n};\nexports.createUnitDependencies = createUnitDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.crossDependencies = void 0;\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar crossDependencies = {\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createCross: _factoriesAny.createCross\n};\nexports.crossDependencies = crossDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.cscDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar cscDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createCsc: _factoriesAny.createCsc\n};\nexports.cscDependencies = cscDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.cschDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar cschDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createCsch: _factoriesAny.createCsch\n};\nexports.cschDependencies = cschDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.transposeDependencies = void 0;\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar transposeDependencies = {\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createTranspose: _factoriesAny.createTranspose\n};\nexports.transposeDependencies = transposeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.ctransposeDependencies = void 0;\nvar _dependenciesConjGenerated = require(\"./dependenciesConj.generated.js\");\nvar _dependenciesTransposeGenerated = require(\"./dependenciesTranspose.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar ctransposeDependencies = {\n  conjDependencies: _dependenciesConjGenerated.conjDependencies,\n  transposeDependencies: _dependenciesTransposeGenerated.transposeDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createCtranspose: _factoriesAny.createCtranspose\n};\nexports.ctransposeDependencies = ctransposeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.cubeDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar cubeDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createCube: _factoriesAny.createCube\n};\nexports.cubeDependencies = cubeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.unaryPlusDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar unaryPlusDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createUnaryPlus: _factoriesAny.createUnaryPlus\n};\nexports.unaryPlusDependencies = unaryPlusDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.cumsumDependencies = void 0;\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _dependenciesUnaryPlusGenerated = require(\"./dependenciesUnaryPlus.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar cumsumDependencies = {\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  unaryPlusDependencies: _dependenciesUnaryPlusGenerated.unaryPlusDependencies,\n  createCumSum: _factoriesAny.createCumSum\n};\nexports.cumsumDependencies = cumsumDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.cumsumTransformDependencies = void 0;\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _dependenciesUnaryPlusGenerated = require(\"./dependenciesUnaryPlus.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar cumsumTransformDependencies = {\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  unaryPlusDependencies: _dependenciesUnaryPlusGenerated.unaryPlusDependencies,\n  createCumSumTransform: _factoriesAny.createCumSumTransform\n};\nexports.cumsumTransformDependencies = cumsumTransformDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.deepEqualDependencies = void 0;\nvar _dependenciesEqualGenerated = require(\"./dependenciesEqual.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar deepEqualDependencies = {\n  equalDependencies: _dependenciesEqualGenerated.equalDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createDeepEqual: _factoriesAny.createDeepEqual\n};\nexports.deepEqualDependencies = deepEqualDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.divideDependencies = void 0;\nvar _dependenciesDivideScalarGenerated = require(\"./dependenciesDivideScalar.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesInvGenerated = require(\"./dependenciesInv.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar divideDependencies = {\n  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  invDependencies: _dependenciesInvGenerated.invDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createDivide: _factoriesAny.createDivide\n};\nexports.divideDependencies = divideDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.resolveDependencies = void 0;\nvar _dependenciesConstantNodeGenerated = require(\"./dependenciesConstantNode.generated.js\");\nvar _dependenciesFunctionNodeGenerated = require(\"./dependenciesFunctionNode.generated.js\");\nvar _dependenciesOperatorNodeGenerated = require(\"./dependenciesOperatorNode.generated.js\");\nvar _dependenciesParenthesisNodeGenerated = require(\"./dependenciesParenthesisNode.generated.js\");\nvar _dependenciesParseGenerated = require(\"./dependenciesParse.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar resolveDependencies = {\n  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,\n  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,\n  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,\n  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,\n  parseDependencies: _dependenciesParseGenerated.parseDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createResolve: _factoriesAny.createResolve\n};\nexports.resolveDependencies = resolveDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.simplifyConstantDependencies = void 0;\nvar _dependenciesBignumberGenerated = require(\"./dependenciesBignumber.generated.js\");\nvar _dependenciesFractionGenerated = require(\"./dependenciesFraction.generated.js\");\nvar _dependenciesAccessorNodeGenerated = require(\"./dependenciesAccessorNode.generated.js\");\nvar _dependenciesArrayNodeGenerated = require(\"./dependenciesArrayNode.generated.js\");\nvar _dependenciesConstantNodeGenerated = require(\"./dependenciesConstantNode.generated.js\");\nvar _dependenciesFunctionNodeGenerated = require(\"./dependenciesFunctionNode.generated.js\");\nvar _dependenciesIndexNodeGenerated = require(\"./dependenciesIndexNode.generated.js\");\nvar _dependenciesObjectNodeGenerated = require(\"./dependenciesObjectNode.generated.js\");\nvar _dependenciesOperatorNodeGenerated = require(\"./dependenciesOperatorNode.generated.js\");\nvar _dependenciesSymbolNodeGenerated = require(\"./dependenciesSymbolNode.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar simplifyConstantDependencies = {\n  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,\n  fractionDependencies: _dependenciesFractionGenerated.fractionDependencies,\n  AccessorNodeDependencies: _dependenciesAccessorNodeGenerated.AccessorNodeDependencies,\n  ArrayNodeDependencies: _dependenciesArrayNodeGenerated.ArrayNodeDependencies,\n  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,\n  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,\n  IndexNodeDependencies: _dependenciesIndexNodeGenerated.IndexNodeDependencies,\n  ObjectNodeDependencies: _dependenciesObjectNodeGenerated.ObjectNodeDependencies,\n  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,\n  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSimplifyConstant: _factoriesAny.createSimplifyConstant\n};\nexports.simplifyConstantDependencies = simplifyConstantDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.simplifyCoreDependencies = void 0;\nvar _dependenciesAccessorNodeGenerated = require(\"./dependenciesAccessorNode.generated.js\");\nvar _dependenciesArrayNodeGenerated = require(\"./dependenciesArrayNode.generated.js\");\nvar _dependenciesConstantNodeGenerated = require(\"./dependenciesConstantNode.generated.js\");\nvar _dependenciesFunctionNodeGenerated = require(\"./dependenciesFunctionNode.generated.js\");\nvar _dependenciesIndexNodeGenerated = require(\"./dependenciesIndexNode.generated.js\");\nvar _dependenciesObjectNodeGenerated = require(\"./dependenciesObjectNode.generated.js\");\nvar _dependenciesOperatorNodeGenerated = require(\"./dependenciesOperatorNode.generated.js\");\nvar _dependenciesParenthesisNodeGenerated = require(\"./dependenciesParenthesisNode.generated.js\");\nvar _dependenciesSymbolNodeGenerated = require(\"./dependenciesSymbolNode.generated.js\");\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesDivideGenerated = require(\"./dependenciesDivide.generated.js\");\nvar _dependenciesEqualGenerated = require(\"./dependenciesEqual.generated.js\");\nvar _dependenciesIsZeroGenerated = require(\"./dependenciesIsZero.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesParseGenerated = require(\"./dependenciesParse.generated.js\");\nvar _dependenciesPowGenerated = require(\"./dependenciesPow.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar simplifyCoreDependencies = {\n  AccessorNodeDependencies: _dependenciesAccessorNodeGenerated.AccessorNodeDependencies,\n  ArrayNodeDependencies: _dependenciesArrayNodeGenerated.ArrayNodeDependencies,\n  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,\n  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,\n  IndexNodeDependencies: _dependenciesIndexNodeGenerated.IndexNodeDependencies,\n  ObjectNodeDependencies: _dependenciesObjectNodeGenerated.ObjectNodeDependencies,\n  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,\n  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,\n  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  divideDependencies: _dependenciesDivideGenerated.divideDependencies,\n  equalDependencies: _dependenciesEqualGenerated.equalDependencies,\n  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  parseDependencies: _dependenciesParseGenerated.parseDependencies,\n  powDependencies: _dependenciesPowGenerated.powDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSimplifyCore: _factoriesAny.createSimplifyCore\n};\nexports.simplifyCoreDependencies = simplifyCoreDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.simplifyDependencies = void 0;\nvar _dependenciesBignumberGenerated = require(\"./dependenciesBignumber.generated.js\");\nvar _dependenciesFractionGenerated = require(\"./dependenciesFraction.generated.js\");\nvar _dependenciesAccessorNodeGenerated = require(\"./dependenciesAccessorNode.generated.js\");\nvar _dependenciesArrayNodeGenerated = require(\"./dependenciesArrayNode.generated.js\");\nvar _dependenciesConstantNodeGenerated = require(\"./dependenciesConstantNode.generated.js\");\nvar _dependenciesFunctionNodeGenerated = require(\"./dependenciesFunctionNode.generated.js\");\nvar _dependenciesIndexNodeGenerated = require(\"./dependenciesIndexNode.generated.js\");\nvar _dependenciesObjectNodeGenerated = require(\"./dependenciesObjectNode.generated.js\");\nvar _dependenciesOperatorNodeGenerated = require(\"./dependenciesOperatorNode.generated.js\");\nvar _dependenciesParenthesisNodeGenerated = require(\"./dependenciesParenthesisNode.generated.js\");\nvar _dependenciesSymbolNodeGenerated = require(\"./dependenciesSymbolNode.generated.js\");\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesDivideGenerated = require(\"./dependenciesDivide.generated.js\");\nvar _dependenciesEqualGenerated = require(\"./dependenciesEqual.generated.js\");\nvar _dependenciesIsZeroGenerated = require(\"./dependenciesIsZero.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesParseGenerated = require(\"./dependenciesParse.generated.js\");\nvar _dependenciesPowGenerated = require(\"./dependenciesPow.generated.js\");\nvar _dependenciesResolveGenerated = require(\"./dependenciesResolve.generated.js\");\nvar _dependenciesSimplifyConstantGenerated = require(\"./dependenciesSimplifyConstant.generated.js\");\nvar _dependenciesSimplifyCoreGenerated = require(\"./dependenciesSimplifyCore.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar simplifyDependencies = {\n  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,\n  fractionDependencies: _dependenciesFractionGenerated.fractionDependencies,\n  AccessorNodeDependencies: _dependenciesAccessorNodeGenerated.AccessorNodeDependencies,\n  ArrayNodeDependencies: _dependenciesArrayNodeGenerated.ArrayNodeDependencies,\n  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,\n  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,\n  IndexNodeDependencies: _dependenciesIndexNodeGenerated.IndexNodeDependencies,\n  ObjectNodeDependencies: _dependenciesObjectNodeGenerated.ObjectNodeDependencies,\n  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,\n  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,\n  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  divideDependencies: _dependenciesDivideGenerated.divideDependencies,\n  equalDependencies: _dependenciesEqualGenerated.equalDependencies,\n  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  parseDependencies: _dependenciesParseGenerated.parseDependencies,\n  powDependencies: _dependenciesPowGenerated.powDependencies,\n  resolveDependencies: _dependenciesResolveGenerated.resolveDependencies,\n  simplifyConstantDependencies: _dependenciesSimplifyConstantGenerated.simplifyConstantDependencies,\n  simplifyCoreDependencies: _dependenciesSimplifyCoreGenerated.simplifyCoreDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSimplify: _factoriesAny.createSimplify\n};\nexports.simplifyDependencies = simplifyDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.derivativeDependencies = void 0;\nvar _dependenciesConstantNodeGenerated = require(\"./dependenciesConstantNode.generated.js\");\nvar _dependenciesFunctionNodeGenerated = require(\"./dependenciesFunctionNode.generated.js\");\nvar _dependenciesOperatorNodeGenerated = require(\"./dependenciesOperatorNode.generated.js\");\nvar _dependenciesParenthesisNodeGenerated = require(\"./dependenciesParenthesisNode.generated.js\");\nvar _dependenciesSymbolNodeGenerated = require(\"./dependenciesSymbolNode.generated.js\");\nvar _dependenciesEqualGenerated = require(\"./dependenciesEqual.generated.js\");\nvar _dependenciesIsZeroGenerated = require(\"./dependenciesIsZero.generated.js\");\nvar _dependenciesNumericGenerated = require(\"./dependenciesNumeric.generated.js\");\nvar _dependenciesParseGenerated = require(\"./dependenciesParse.generated.js\");\nvar _dependenciesSimplifyGenerated = require(\"./dependenciesSimplify.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar derivativeDependencies = {\n  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,\n  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,\n  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,\n  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,\n  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,\n  equalDependencies: _dependenciesEqualGenerated.equalDependencies,\n  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,\n  numericDependencies: _dependenciesNumericGenerated.numericDependencies,\n  parseDependencies: _dependenciesParseGenerated.parseDependencies,\n  simplifyDependencies: _dependenciesSimplifyGenerated.simplifyDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createDerivative: _factoriesAny.createDerivative\n};\nexports.derivativeDependencies = derivativeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.deuteronMassDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar deuteronMassDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createDeuteronMass: _factoriesAny.createDeuteronMass\n};\nexports.deuteronMassDependencies = deuteronMassDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.diagDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesSparseMatrixClassGenerated = require(\"./dependenciesSparseMatrixClass.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar diagDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createDiag: _factoriesAny.createDiag\n};\nexports.diagDependencies = diagDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.diffDependencies = void 0;\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesNumberGenerated = require(\"./dependenciesNumber.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar diffDependencies = {\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  numberDependencies: _dependenciesNumberGenerated.numberDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createDiff: _factoriesAny.createDiff\n};\nexports.diffDependencies = diffDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.diffTransformDependencies = void 0;\nvar _dependenciesBignumberGenerated = require(\"./dependenciesBignumber.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesNumberGenerated = require(\"./dependenciesNumber.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar diffTransformDependencies = {\n  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  numberDependencies: _dependenciesNumberGenerated.numberDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createDiffTransform: _factoriesAny.createDiffTransform\n};\nexports.diffTransformDependencies = diffTransformDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.sqrtDependencies = void 0;\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar sqrtDependencies = {\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSqrt: _factoriesAny.createSqrt\n};\nexports.sqrtDependencies = sqrtDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.distanceDependencies = void 0;\nvar _dependenciesAbsGenerated = require(\"./dependenciesAbs.generated.js\");\nvar _dependenciesAddScalarGenerated = require(\"./dependenciesAddScalar.generated.js\");\nvar _dependenciesDivideScalarGenerated = require(\"./dependenciesDivideScalar.generated.js\");\nvar _dependenciesMultiplyScalarGenerated = require(\"./dependenciesMultiplyScalar.generated.js\");\nvar _dependenciesSqrtGenerated = require(\"./dependenciesSqrt.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _dependenciesUnaryMinusGenerated = require(\"./dependenciesUnaryMinus.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar distanceDependencies = {\n  absDependencies: _dependenciesAbsGenerated.absDependencies,\n  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,\n  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,\n  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,\n  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,\n  createDistance: _factoriesAny.createDistance\n};\nexports.distanceDependencies = distanceDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.dotDivideDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesDivideScalarGenerated = require(\"./dependenciesDivideScalar.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar dotDivideDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createDotDivide: _factoriesAny.createDotDivide\n};\nexports.dotDivideDependencies = dotDivideDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.dotMultiplyDependencies = void 0;\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMultiplyScalarGenerated = require(\"./dependenciesMultiplyScalar.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar dotMultiplyDependencies = {\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createDotMultiply: _factoriesAny.createDotMultiply\n};\nexports.dotMultiplyDependencies = dotMultiplyDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.dotPowDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesPowGenerated = require(\"./dependenciesPow.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar dotPowDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  powDependencies: _dependenciesPowGenerated.powDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createDotPow: _factoriesAny.createDotPow\n};\nexports.dotPowDependencies = dotPowDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.eDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar eDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  createE: _factoriesAny.createE\n};\nexports.eDependencies = eDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.efimovFactorDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar efimovFactorDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  createEfimovFactor: _factoriesAny.createEfimovFactor\n};\nexports.efimovFactorDependencies = efimovFactorDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.flattenDependencies = void 0;\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar flattenDependencies = {\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createFlatten: _factoriesAny.createFlatten\n};\nexports.flattenDependencies = flattenDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.imDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar imDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createIm: _factoriesAny.createIm\n};\nexports.imDependencies = imDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.matrixFromColumnsDependencies = void 0;\nvar _dependenciesFlattenGenerated = require(\"./dependenciesFlatten.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesSizeGenerated = require(\"./dependenciesSize.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar matrixFromColumnsDependencies = {\n  flattenDependencies: _dependenciesFlattenGenerated.flattenDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createMatrixFromColumns: _factoriesAny.createMatrixFromColumns\n};\nexports.matrixFromColumnsDependencies = matrixFromColumnsDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.signDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesFractionClassGenerated = require(\"./dependenciesFractionClass.generated.js\");\nvar _dependenciesComplexGenerated = require(\"./dependenciesComplex.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar signDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  FractionDependencies: _dependenciesFractionClassGenerated.FractionDependencies,\n  complexDependencies: _dependenciesComplexGenerated.complexDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSign: _factoriesAny.createSign\n};\nexports.signDependencies = signDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.qrDependencies = void 0;\nvar _dependenciesAddScalarGenerated = require(\"./dependenciesAddScalar.generated.js\");\nvar _dependenciesComplexGenerated = require(\"./dependenciesComplex.generated.js\");\nvar _dependenciesConjGenerated = require(\"./dependenciesConj.generated.js\");\nvar _dependenciesDivideScalarGenerated = require(\"./dependenciesDivideScalar.generated.js\");\nvar _dependenciesEqualGenerated = require(\"./dependenciesEqual.generated.js\");\nvar _dependenciesIdentityGenerated = require(\"./dependenciesIdentity.generated.js\");\nvar _dependenciesIsZeroGenerated = require(\"./dependenciesIsZero.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMultiplyScalarGenerated = require(\"./dependenciesMultiplyScalar.generated.js\");\nvar _dependenciesSignGenerated = require(\"./dependenciesSign.generated.js\");\nvar _dependenciesSqrtGenerated = require(\"./dependenciesSqrt.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _dependenciesUnaryMinusGenerated = require(\"./dependenciesUnaryMinus.generated.js\");\nvar _dependenciesZerosGenerated = require(\"./dependenciesZeros.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar qrDependencies = {\n  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,\n  complexDependencies: _dependenciesComplexGenerated.complexDependencies,\n  conjDependencies: _dependenciesConjGenerated.conjDependencies,\n  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,\n  equalDependencies: _dependenciesEqualGenerated.equalDependencies,\n  identityDependencies: _dependenciesIdentityGenerated.identityDependencies,\n  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,\n  signDependencies: _dependenciesSignGenerated.signDependencies,\n  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,\n  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,\n  createQr: _factoriesAny.createQr\n};\nexports.qrDependencies = qrDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.reDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar reDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createRe: _factoriesAny.createRe\n};\nexports.reDependencies = reDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.sinDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar sinDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSin: _factoriesAny.createSin\n};\nexports.sinDependencies = sinDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.usolveDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesDivideScalarGenerated = require(\"./dependenciesDivideScalar.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMultiplyScalarGenerated = require(\"./dependenciesMultiplyScalar.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar usolveDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createUsolve: _factoriesAny.createUsolve\n};\nexports.usolveDependencies = usolveDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.usolveAllDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesDivideScalarGenerated = require(\"./dependenciesDivideScalar.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMultiplyScalarGenerated = require(\"./dependenciesMultiplyScalar.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar usolveAllDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createUsolveAll: _factoriesAny.createUsolveAll\n};\nexports.usolveAllDependencies = usolveAllDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.eigsDependencies = void 0;\nvar _dependenciesAbsGenerated = require(\"./dependenciesAbs.generated.js\");\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesAddScalarGenerated = require(\"./dependenciesAddScalar.generated.js\");\nvar _dependenciesAtanGenerated = require(\"./dependenciesAtan.generated.js\");\nvar _dependenciesBignumberGenerated = require(\"./dependenciesBignumber.generated.js\");\nvar _dependenciesColumnGenerated = require(\"./dependenciesColumn.generated.js\");\nvar _dependenciesComplexGenerated = require(\"./dependenciesComplex.generated.js\");\nvar _dependenciesCosGenerated = require(\"./dependenciesCos.generated.js\");\nvar _dependenciesDiagGenerated = require(\"./dependenciesDiag.generated.js\");\nvar _dependenciesDivideScalarGenerated = require(\"./dependenciesDivideScalar.generated.js\");\nvar _dependenciesDotGenerated = require(\"./dependenciesDot.generated.js\");\nvar _dependenciesEqualGenerated = require(\"./dependenciesEqual.generated.js\");\nvar _dependenciesFlattenGenerated = require(\"./dependenciesFlatten.generated.js\");\nvar _dependenciesImGenerated = require(\"./dependenciesIm.generated.js\");\nvar _dependenciesInvGenerated = require(\"./dependenciesInv.generated.js\");\nvar _dependenciesLargerGenerated = require(\"./dependenciesLarger.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMatrixFromColumnsGenerated = require(\"./dependenciesMatrixFromColumns.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesMultiplyScalarGenerated = require(\"./dependenciesMultiplyScalar.generated.js\");\nvar _dependenciesNumberGenerated = require(\"./dependenciesNumber.generated.js\");\nvar _dependenciesQrGenerated = require(\"./dependenciesQr.generated.js\");\nvar _dependenciesReGenerated = require(\"./dependenciesRe.generated.js\");\nvar _dependenciesSinGenerated = require(\"./dependenciesSin.generated.js\");\nvar _dependenciesSmallerGenerated = require(\"./dependenciesSmaller.generated.js\");\nvar _dependenciesSqrtGenerated = require(\"./dependenciesSqrt.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _dependenciesUsolveGenerated = require(\"./dependenciesUsolve.generated.js\");\nvar _dependenciesUsolveAllGenerated = require(\"./dependenciesUsolveAll.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar eigsDependencies = {\n  absDependencies: _dependenciesAbsGenerated.absDependencies,\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,\n  atanDependencies: _dependenciesAtanGenerated.atanDependencies,\n  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,\n  columnDependencies: _dependenciesColumnGenerated.columnDependencies,\n  complexDependencies: _dependenciesComplexGenerated.complexDependencies,\n  cosDependencies: _dependenciesCosGenerated.cosDependencies,\n  diagDependencies: _dependenciesDiagGenerated.diagDependencies,\n  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,\n  dotDependencies: _dependenciesDotGenerated.dotDependencies,\n  equalDependencies: _dependenciesEqualGenerated.equalDependencies,\n  flattenDependencies: _dependenciesFlattenGenerated.flattenDependencies,\n  imDependencies: _dependenciesImGenerated.imDependencies,\n  invDependencies: _dependenciesInvGenerated.invDependencies,\n  largerDependencies: _dependenciesLargerGenerated.largerDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  matrixFromColumnsDependencies: _dependenciesMatrixFromColumnsGenerated.matrixFromColumnsDependencies,\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,\n  numberDependencies: _dependenciesNumberGenerated.numberDependencies,\n  qrDependencies: _dependenciesQrGenerated.qrDependencies,\n  reDependencies: _dependenciesReGenerated.reDependencies,\n  sinDependencies: _dependenciesSinGenerated.sinDependencies,\n  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,\n  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  usolveDependencies: _dependenciesUsolveGenerated.usolveDependencies,\n  usolveAllDependencies: _dependenciesUsolveAllGenerated.usolveAllDependencies,\n  createEigs: _factoriesAny.createEigs\n};\nexports.eigsDependencies = eigsDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.electricConstantDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar electricConstantDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createElectricConstant: _factoriesAny.createElectricConstant\n};\nexports.electricConstantDependencies = electricConstantDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.electronMassDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar electronMassDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createElectronMass: _factoriesAny.createElectronMass\n};\nexports.electronMassDependencies = electronMassDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.elementaryChargeDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar elementaryChargeDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createElementaryCharge: _factoriesAny.createElementaryCharge\n};\nexports.elementaryChargeDependencies = elementaryChargeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.equalTextDependencies = void 0;\nvar _dependenciesCompareTextGenerated = require(\"./dependenciesCompareText.generated.js\");\nvar _dependenciesIsZeroGenerated = require(\"./dependenciesIsZero.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar equalTextDependencies = {\n  compareTextDependencies: _dependenciesCompareTextGenerated.compareTextDependencies,\n  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createEqualText: _factoriesAny.createEqualText\n};\nexports.equalTextDependencies = equalTextDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.erfDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar erfDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createErf: _factoriesAny.createErf\n};\nexports.erfDependencies = erfDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.evaluateDependencies = void 0;\nvar _dependenciesParseGenerated = require(\"./dependenciesParse.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar evaluateDependencies = {\n  parseDependencies: _dependenciesParseGenerated.parseDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createEvaluate: _factoriesAny.createEvaluate\n};\nexports.evaluateDependencies = evaluateDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.expDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar expDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createExp: _factoriesAny.createExp\n};\nexports.expDependencies = expDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.expmDependencies = void 0;\nvar _dependenciesAbsGenerated = require(\"./dependenciesAbs.generated.js\");\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesIdentityGenerated = require(\"./dependenciesIdentity.generated.js\");\nvar _dependenciesInvGenerated = require(\"./dependenciesInv.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar expmDependencies = {\n  absDependencies: _dependenciesAbsGenerated.absDependencies,\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  identityDependencies: _dependenciesIdentityGenerated.identityDependencies,\n  invDependencies: _dependenciesInvGenerated.invDependencies,\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createExpm: _factoriesAny.createExpm\n};\nexports.expmDependencies = expmDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.expm1Dependencies = void 0;\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar expm1Dependencies = {\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createExpm1: _factoriesAny.createExpm1\n};\nexports.expm1Dependencies = expm1Dependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.falseDependencies = void 0;\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar falseDependencies = {\n  createFalse: _factoriesAny.createFalse\n};\nexports.falseDependencies = falseDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.faradayDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar faradayDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createFaraday: _factoriesAny.createFaraday\n};\nexports.faradayDependencies = faradayDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.fermiCouplingDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar fermiCouplingDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createFermiCoupling: _factoriesAny.createFermiCoupling\n};\nexports.fermiCouplingDependencies = fermiCouplingDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.iDependencies = void 0;\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar iDependencies = {\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  createI: _factoriesAny.createI\n};\nexports.iDependencies = iDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.log2Dependencies = void 0;\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar log2Dependencies = {\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createLog2: _factoriesAny.createLog2\n};\nexports.log2Dependencies = log2Dependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.tauDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar tauDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  createTau: _factoriesAny.createTau\n};\nexports.tauDependencies = tauDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.fftDependencies = void 0;\nvar _dependenciesAddScalarGenerated = require(\"./dependenciesAddScalar.generated.js\");\nvar _dependenciesCeilGenerated = require(\"./dependenciesCeil.generated.js\");\nvar _dependenciesConjGenerated = require(\"./dependenciesConj.generated.js\");\nvar _dependenciesDivideScalarGenerated = require(\"./dependenciesDivideScalar.generated.js\");\nvar _dependenciesDotDivideGenerated = require(\"./dependenciesDotDivide.generated.js\");\nvar _dependenciesExpGenerated = require(\"./dependenciesExp.generated.js\");\nvar _dependenciesIGenerated = require(\"./dependenciesI.generated.js\");\nvar _dependenciesLog2Generated = require(\"./dependenciesLog2.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMultiplyScalarGenerated = require(\"./dependenciesMultiplyScalar.generated.js\");\nvar _dependenciesPowGenerated = require(\"./dependenciesPow.generated.js\");\nvar _dependenciesTauGenerated = require(\"./dependenciesTau.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar fftDependencies = {\n  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,\n  ceilDependencies: _dependenciesCeilGenerated.ceilDependencies,\n  conjDependencies: _dependenciesConjGenerated.conjDependencies,\n  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,\n  dotDivideDependencies: _dependenciesDotDivideGenerated.dotDivideDependencies,\n  expDependencies: _dependenciesExpGenerated.expDependencies,\n  iDependencies: _dependenciesIGenerated.iDependencies,\n  log2Dependencies: _dependenciesLog2Generated.log2Dependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,\n  powDependencies: _dependenciesPowGenerated.powDependencies,\n  tauDependencies: _dependenciesTauGenerated.tauDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createFft: _factoriesAny.createFft\n};\nexports.fftDependencies = fftDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.FibonacciHeapDependencies = void 0;\nvar _dependenciesLargerGenerated = require(\"./dependenciesLarger.generated.js\");\nvar _dependenciesSmallerGenerated = require(\"./dependenciesSmaller.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar FibonacciHeapDependencies = {\n  largerDependencies: _dependenciesLargerGenerated.largerDependencies,\n  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,\n  createFibonacciHeapClass: _factoriesAny.createFibonacciHeapClass\n};\nexports.FibonacciHeapDependencies = FibonacciHeapDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.filterDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar filterDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createFilter: _factoriesAny.createFilter\n};\nexports.filterDependencies = filterDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.filterTransformDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar filterTransformDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createFilterTransform: _factoriesAny.createFilterTransform\n};\nexports.filterTransformDependencies = filterTransformDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.fineStructureDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar fineStructureDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  createFineStructure: _factoriesAny.createFineStructure\n};\nexports.fineStructureDependencies = fineStructureDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.firstRadiationDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar firstRadiationDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createFirstRadiation: _factoriesAny.createFirstRadiation\n};\nexports.firstRadiationDependencies = firstRadiationDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.forEachDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar forEachDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createForEach: _factoriesAny.createForEach\n};\nexports.forEachDependencies = forEachDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.forEachTransformDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar forEachTransformDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createForEachTransform: _factoriesAny.createForEachTransform\n};\nexports.forEachTransformDependencies = forEachTransformDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.gasConstantDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar gasConstantDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createGasConstant: _factoriesAny.createGasConstant\n};\nexports.gasConstantDependencies = gasConstantDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.gcdDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar gcdDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createGcd: _factoriesAny.createGcd\n};\nexports.gcdDependencies = gcdDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.getMatrixDataTypeDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar getMatrixDataTypeDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createGetMatrixDataType: _factoriesAny.createGetMatrixDataType\n};\nexports.getMatrixDataTypeDependencies = getMatrixDataTypeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.gravitationConstantDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar gravitationConstantDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createGravitationConstant: _factoriesAny.createGravitationConstant\n};\nexports.gravitationConstantDependencies = gravitationConstantDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.gravityDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar gravityDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createGravity: _factoriesAny.createGravity\n};\nexports.gravityDependencies = gravityDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.hartreeEnergyDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar hartreeEnergyDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createHartreeEnergy: _factoriesAny.createHartreeEnergy\n};\nexports.hartreeEnergyDependencies = hartreeEnergyDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.hasNumericValueDependencies = void 0;\nvar _dependenciesIsNumericGenerated = require(\"./dependenciesIsNumeric.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar hasNumericValueDependencies = {\n  isNumericDependencies: _dependenciesIsNumericGenerated.isNumericDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createHasNumericValue: _factoriesAny.createHasNumericValue\n};\nexports.hasNumericValueDependencies = hasNumericValueDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.HelpDependencies = void 0;\nvar _dependenciesParseGenerated = require(\"./dependenciesParse.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar HelpDependencies = {\n  parseDependencies: _dependenciesParseGenerated.parseDependencies,\n  createHelpClass: _factoriesAny.createHelpClass\n};\nexports.HelpDependencies = HelpDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.helpDependencies = void 0;\nvar _dependenciesHelpClassGenerated = require(\"./dependenciesHelpClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar helpDependencies = {\n  HelpDependencies: _dependenciesHelpClassGenerated.HelpDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createHelp: _factoriesAny.createHelp\n};\nexports.helpDependencies = helpDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.hexDependencies = void 0;\nvar _dependenciesFormatGenerated = require(\"./dependenciesFormat.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar hexDependencies = {\n  formatDependencies: _dependenciesFormatGenerated.formatDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createHex: _factoriesAny.createHex\n};\nexports.hexDependencies = hexDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.hypotDependencies = void 0;\nvar _dependenciesAbsGenerated = require(\"./dependenciesAbs.generated.js\");\nvar _dependenciesAddScalarGenerated = require(\"./dependenciesAddScalar.generated.js\");\nvar _dependenciesDivideScalarGenerated = require(\"./dependenciesDivideScalar.generated.js\");\nvar _dependenciesIsPositiveGenerated = require(\"./dependenciesIsPositive.generated.js\");\nvar _dependenciesMultiplyScalarGenerated = require(\"./dependenciesMultiplyScalar.generated.js\");\nvar _dependenciesSmallerGenerated = require(\"./dependenciesSmaller.generated.js\");\nvar _dependenciesSqrtGenerated = require(\"./dependenciesSqrt.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar hypotDependencies = {\n  absDependencies: _dependenciesAbsGenerated.absDependencies,\n  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,\n  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,\n  isPositiveDependencies: _dependenciesIsPositiveGenerated.isPositiveDependencies,\n  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,\n  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,\n  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createHypot: _factoriesAny.createHypot\n};\nexports.hypotDependencies = hypotDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.ifftDependencies = void 0;\nvar _dependenciesConjGenerated = require(\"./dependenciesConj.generated.js\");\nvar _dependenciesDotDivideGenerated = require(\"./dependenciesDotDivide.generated.js\");\nvar _dependenciesFftGenerated = require(\"./dependenciesFft.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar ifftDependencies = {\n  conjDependencies: _dependenciesConjGenerated.conjDependencies,\n  dotDivideDependencies: _dependenciesDotDivideGenerated.dotDivideDependencies,\n  fftDependencies: _dependenciesFftGenerated.fftDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createIfft: _factoriesAny.createIfft\n};\nexports.ifftDependencies = ifftDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.indexDependencies = void 0;\nvar _dependenciesIndexClassGenerated = require(\"./dependenciesIndexClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar indexDependencies = {\n  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createIndex: _factoriesAny.createIndex\n};\nexports.indexDependencies = indexDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.indexTransformDependencies = void 0;\nvar _dependenciesIndexClassGenerated = require(\"./dependenciesIndexClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar indexTransformDependencies = {\n  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,\n  createIndexTransform: _factoriesAny.createIndexTransform\n};\nexports.indexTransformDependencies = indexTransformDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.InfinityDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar InfinityDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  createInfinity: _factoriesAny.createInfinity\n};\nexports.InfinityDependencies = InfinityDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.intersectDependencies = void 0;\nvar _dependenciesAbsGenerated = require(\"./dependenciesAbs.generated.js\");\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesAddScalarGenerated = require(\"./dependenciesAddScalar.generated.js\");\nvar _dependenciesDivideScalarGenerated = require(\"./dependenciesDivideScalar.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesFlattenGenerated = require(\"./dependenciesFlatten.generated.js\");\nvar _dependenciesIsNumericGenerated = require(\"./dependenciesIsNumeric.generated.js\");\nvar _dependenciesIsZeroGenerated = require(\"./dependenciesIsZero.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesMultiplyScalarGenerated = require(\"./dependenciesMultiplyScalar.generated.js\");\nvar _dependenciesSmallerGenerated = require(\"./dependenciesSmaller.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar intersectDependencies = {\n  absDependencies: _dependenciesAbsGenerated.absDependencies,\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,\n  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  flattenDependencies: _dependenciesFlattenGenerated.flattenDependencies,\n  isNumericDependencies: _dependenciesIsNumericGenerated.isNumericDependencies,\n  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,\n  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createIntersect: _factoriesAny.createIntersect\n};\nexports.intersectDependencies = intersectDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.inverseConductanceQuantumDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar inverseConductanceQuantumDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createInverseConductanceQuantum: _factoriesAny.createInverseConductanceQuantum\n};\nexports.inverseConductanceQuantumDependencies = inverseConductanceQuantumDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.modDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar modDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createMod: _factoriesAny.createMod\n};\nexports.modDependencies = modDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.xgcdDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar xgcdDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createXgcd: _factoriesAny.createXgcd\n};\nexports.xgcdDependencies = xgcdDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.invmodDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesEqualGenerated = require(\"./dependenciesEqual.generated.js\");\nvar _dependenciesIsIntegerGenerated = require(\"./dependenciesIsInteger.generated.js\");\nvar _dependenciesModGenerated = require(\"./dependenciesMod.generated.js\");\nvar _dependenciesSmallerGenerated = require(\"./dependenciesSmaller.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _dependenciesXgcdGenerated = require(\"./dependenciesXgcd.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar invmodDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  equalDependencies: _dependenciesEqualGenerated.equalDependencies,\n  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,\n  modDependencies: _dependenciesModGenerated.modDependencies,\n  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  xgcdDependencies: _dependenciesXgcdGenerated.xgcdDependencies,\n  createInvmod: _factoriesAny.createInvmod\n};\nexports.invmodDependencies = invmodDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.isNaNDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar isNaNDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createIsNaN: _factoriesAny.createIsNaN\n};\nexports.isNaNDependencies = isNaNDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.isPrimeDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar isPrimeDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createIsPrime: _factoriesAny.createIsPrime\n};\nexports.isPrimeDependencies = isPrimeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.logDependencies = void 0;\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _dependenciesDivideScalarGenerated = require(\"./dependenciesDivideScalar.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar logDependencies = {\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createLog: _factoriesAny.createLog\n};\nexports.logDependencies = logDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.mapDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar mapDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createMap: _factoriesAny.createMap\n};\nexports.mapDependencies = mapDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.sumDependencies = void 0;\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesNumericGenerated = require(\"./dependenciesNumeric.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar sumDependencies = {\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  numericDependencies: _dependenciesNumericGenerated.numericDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSum: _factoriesAny.createSum\n};\nexports.sumDependencies = sumDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.kldivergenceDependencies = void 0;\nvar _dependenciesDivideGenerated = require(\"./dependenciesDivide.generated.js\");\nvar _dependenciesDotDivideGenerated = require(\"./dependenciesDotDivide.generated.js\");\nvar _dependenciesIsNumericGenerated = require(\"./dependenciesIsNumeric.generated.js\");\nvar _dependenciesLogGenerated = require(\"./dependenciesLog.generated.js\");\nvar _dependenciesMapGenerated = require(\"./dependenciesMap.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesSumGenerated = require(\"./dependenciesSum.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar kldivergenceDependencies = {\n  divideDependencies: _dependenciesDivideGenerated.divideDependencies,\n  dotDivideDependencies: _dependenciesDotDivideGenerated.dotDivideDependencies,\n  isNumericDependencies: _dependenciesIsNumericGenerated.isNumericDependencies,\n  logDependencies: _dependenciesLogGenerated.logDependencies,\n  mapDependencies: _dependenciesMapGenerated.mapDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  sumDependencies: _dependenciesSumGenerated.sumDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createKldivergence: _factoriesAny.createKldivergence\n};\nexports.kldivergenceDependencies = kldivergenceDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.klitzingDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar klitzingDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createKlitzing: _factoriesAny.createKlitzing\n};\nexports.klitzingDependencies = klitzingDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.kronDependencies = void 0;\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMultiplyScalarGenerated = require(\"./dependenciesMultiplyScalar.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar kronDependencies = {\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createKron: _factoriesAny.createKron\n};\nexports.kronDependencies = kronDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.LN10Dependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar LN10Dependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  createLN10: _factoriesAny.createLN10\n};\nexports.LN10Dependencies = LN10Dependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.LN2Dependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar LN2Dependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  createLN2: _factoriesAny.createLN2\n};\nexports.LN2Dependencies = LN2Dependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.LOG10EDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar LOG10EDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  createLOG10E: _factoriesAny.createLOG10E\n};\nexports.LOG10EDependencies = LOG10EDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.LOG2EDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar LOG2EDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  createLOG2E: _factoriesAny.createLOG2E\n};\nexports.LOG2EDependencies = LOG2EDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.lcmDependencies = void 0;\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar lcmDependencies = {\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createLcm: _factoriesAny.createLcm\n};\nexports.lcmDependencies = lcmDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.leafCountDependencies = void 0;\nvar _dependenciesParseGenerated = require(\"./dependenciesParse.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar leafCountDependencies = {\n  parseDependencies: _dependenciesParseGenerated.parseDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createLeafCount: _factoriesAny.createLeafCount\n};\nexports.leafCountDependencies = leafCountDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.leftShiftDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _dependenciesZerosGenerated = require(\"./dependenciesZeros.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar leftShiftDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,\n  createLeftShift: _factoriesAny.createLeftShift\n};\nexports.leftShiftDependencies = leftShiftDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.lgammaDependencies = void 0;\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar lgammaDependencies = {\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createLgamma: _factoriesAny.createLgamma\n};\nexports.lgammaDependencies = lgammaDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.log10Dependencies = void 0;\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar log10Dependencies = {\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createLog10: _factoriesAny.createLog10\n};\nexports.log10Dependencies = log10Dependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.log1pDependencies = void 0;\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _dependenciesDivideScalarGenerated = require(\"./dependenciesDivideScalar.generated.js\");\nvar _dependenciesLogGenerated = require(\"./dependenciesLog.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar log1pDependencies = {\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,\n  logDependencies: _dependenciesLogGenerated.logDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createLog1p: _factoriesAny.createLog1p\n};\nexports.log1pDependencies = log1pDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.loschmidtDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar loschmidtDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createLoschmidt: _factoriesAny.createLoschmidt\n};\nexports.loschmidtDependencies = loschmidtDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.lsolveDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesDivideScalarGenerated = require(\"./dependenciesDivideScalar.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMultiplyScalarGenerated = require(\"./dependenciesMultiplyScalar.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar lsolveDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createLsolve: _factoriesAny.createLsolve\n};\nexports.lsolveDependencies = lsolveDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.lsolveAllDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesDivideScalarGenerated = require(\"./dependenciesDivideScalar.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMultiplyScalarGenerated = require(\"./dependenciesMultiplyScalar.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar lsolveAllDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createLsolveAll: _factoriesAny.createLsolveAll\n};\nexports.lsolveAllDependencies = lsolveAllDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.SpaDependencies = void 0;\nvar _dependenciesFibonacciHeapClassGenerated = require(\"./dependenciesFibonacciHeapClass.generated.js\");\nvar _dependenciesAddScalarGenerated = require(\"./dependenciesAddScalar.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar SpaDependencies = {\n  FibonacciHeapDependencies: _dependenciesFibonacciHeapClassGenerated.FibonacciHeapDependencies,\n  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  createSpaClass: _factoriesAny.createSpaClass\n};\nexports.SpaDependencies = SpaDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.lupDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesSpaClassGenerated = require(\"./dependenciesSpaClass.generated.js\");\nvar _dependenciesSparseMatrixClassGenerated = require(\"./dependenciesSparseMatrixClass.generated.js\");\nvar _dependenciesAbsGenerated = require(\"./dependenciesAbs.generated.js\");\nvar _dependenciesAddScalarGenerated = require(\"./dependenciesAddScalar.generated.js\");\nvar _dependenciesDivideScalarGenerated = require(\"./dependenciesDivideScalar.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesLargerGenerated = require(\"./dependenciesLarger.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMultiplyScalarGenerated = require(\"./dependenciesMultiplyScalar.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _dependenciesUnaryMinusGenerated = require(\"./dependenciesUnaryMinus.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar lupDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  SpaDependencies: _dependenciesSpaClassGenerated.SpaDependencies,\n  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,\n  absDependencies: _dependenciesAbsGenerated.absDependencies,\n  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,\n  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  largerDependencies: _dependenciesLargerGenerated.largerDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,\n  createLup: _factoriesAny.createLup\n};\nexports.lupDependencies = lupDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.sluDependencies = void 0;\nvar _dependenciesSparseMatrixClassGenerated = require(\"./dependenciesSparseMatrixClass.generated.js\");\nvar _dependenciesAbsGenerated = require(\"./dependenciesAbs.generated.js\");\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesDivideScalarGenerated = require(\"./dependenciesDivideScalar.generated.js\");\nvar _dependenciesLargerGenerated = require(\"./dependenciesLarger.generated.js\");\nvar _dependenciesLargerEqGenerated = require(\"./dependenciesLargerEq.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTransposeGenerated = require(\"./dependenciesTranspose.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar sluDependencies = {\n  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,\n  absDependencies: _dependenciesAbsGenerated.absDependencies,\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,\n  largerDependencies: _dependenciesLargerGenerated.largerDependencies,\n  largerEqDependencies: _dependenciesLargerEqGenerated.largerEqDependencies,\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  transposeDependencies: _dependenciesTransposeGenerated.transposeDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSlu: _factoriesAny.createSlu\n};\nexports.sluDependencies = sluDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.lusolveDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesLsolveGenerated = require(\"./dependenciesLsolve.generated.js\");\nvar _dependenciesLupGenerated = require(\"./dependenciesLup.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesSluGenerated = require(\"./dependenciesSlu.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _dependenciesUsolveGenerated = require(\"./dependenciesUsolve.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar lusolveDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  lsolveDependencies: _dependenciesLsolveGenerated.lsolveDependencies,\n  lupDependencies: _dependenciesLupGenerated.lupDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  sluDependencies: _dependenciesSluGenerated.sluDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  usolveDependencies: _dependenciesUsolveGenerated.usolveDependencies,\n  createLusolve: _factoriesAny.createLusolve\n};\nexports.lusolveDependencies = lusolveDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.normDependencies = void 0;\nvar _dependenciesAbsGenerated = require(\"./dependenciesAbs.generated.js\");\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesConjGenerated = require(\"./dependenciesConj.generated.js\");\nvar _dependenciesCtransposeGenerated = require(\"./dependenciesCtranspose.generated.js\");\nvar _dependenciesEigsGenerated = require(\"./dependenciesEigs.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesLargerGenerated = require(\"./dependenciesLarger.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesPowGenerated = require(\"./dependenciesPow.generated.js\");\nvar _dependenciesSmallerGenerated = require(\"./dependenciesSmaller.generated.js\");\nvar _dependenciesSqrtGenerated = require(\"./dependenciesSqrt.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar normDependencies = {\n  absDependencies: _dependenciesAbsGenerated.absDependencies,\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  conjDependencies: _dependenciesConjGenerated.conjDependencies,\n  ctransposeDependencies: _dependenciesCtransposeGenerated.ctransposeDependencies,\n  eigsDependencies: _dependenciesEigsGenerated.eigsDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  largerDependencies: _dependenciesLargerGenerated.largerDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  powDependencies: _dependenciesPowGenerated.powDependencies,\n  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,\n  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createNorm: _factoriesAny.createNorm\n};\nexports.normDependencies = normDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.schurDependencies = void 0;\nvar _dependenciesIdentityGenerated = require(\"./dependenciesIdentity.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesNormGenerated = require(\"./dependenciesNorm.generated.js\");\nvar _dependenciesQrGenerated = require(\"./dependenciesQr.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar schurDependencies = {\n  identityDependencies: _dependenciesIdentityGenerated.identityDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  normDependencies: _dependenciesNormGenerated.normDependencies,\n  qrDependencies: _dependenciesQrGenerated.qrDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSchur: _factoriesAny.createSchur\n};\nexports.schurDependencies = schurDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.sylvesterDependencies = void 0;\nvar _dependenciesAbsGenerated = require(\"./dependenciesAbs.generated.js\");\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesIdentityGenerated = require(\"./dependenciesIdentity.generated.js\");\nvar _dependenciesIndexGenerated = require(\"./dependenciesIndex.generated.js\");\nvar _dependenciesLusolveGenerated = require(\"./dependenciesLusolve.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMatrixFromColumnsGenerated = require(\"./dependenciesMatrixFromColumns.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesRangeGenerated = require(\"./dependenciesRange.generated.js\");\nvar _dependenciesSchurGenerated = require(\"./dependenciesSchur.generated.js\");\nvar _dependenciesSubsetGenerated = require(\"./dependenciesSubset.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTransposeGenerated = require(\"./dependenciesTranspose.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar sylvesterDependencies = {\n  absDependencies: _dependenciesAbsGenerated.absDependencies,\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  identityDependencies: _dependenciesIdentityGenerated.identityDependencies,\n  indexDependencies: _dependenciesIndexGenerated.indexDependencies,\n  lusolveDependencies: _dependenciesLusolveGenerated.lusolveDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  matrixFromColumnsDependencies: _dependenciesMatrixFromColumnsGenerated.matrixFromColumnsDependencies,\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  rangeDependencies: _dependenciesRangeGenerated.rangeDependencies,\n  schurDependencies: _dependenciesSchurGenerated.schurDependencies,\n  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  transposeDependencies: _dependenciesTransposeGenerated.transposeDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSylvester: _factoriesAny.createSylvester\n};\nexports.sylvesterDependencies = sylvesterDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.lyapDependencies = void 0;\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesSylvesterGenerated = require(\"./dependenciesSylvester.generated.js\");\nvar _dependenciesTransposeGenerated = require(\"./dependenciesTranspose.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar lyapDependencies = {\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  sylvesterDependencies: _dependenciesSylvesterGenerated.sylvesterDependencies,\n  transposeDependencies: _dependenciesTransposeGenerated.transposeDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createLyap: _factoriesAny.createLyap\n};\nexports.lyapDependencies = lyapDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.partitionSelectDependencies = void 0;\nvar _dependenciesCompareGenerated = require(\"./dependenciesCompare.generated.js\");\nvar _dependenciesIsNaNGenerated = require(\"./dependenciesIsNaN.generated.js\");\nvar _dependenciesIsNumericGenerated = require(\"./dependenciesIsNumeric.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar partitionSelectDependencies = {\n  compareDependencies: _dependenciesCompareGenerated.compareDependencies,\n  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,\n  isNumericDependencies: _dependenciesIsNumericGenerated.isNumericDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createPartitionSelect: _factoriesAny.createPartitionSelect\n};\nexports.partitionSelectDependencies = partitionSelectDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.medianDependencies = void 0;\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesCompareGenerated = require(\"./dependenciesCompare.generated.js\");\nvar _dependenciesDivideGenerated = require(\"./dependenciesDivide.generated.js\");\nvar _dependenciesPartitionSelectGenerated = require(\"./dependenciesPartitionSelect.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar medianDependencies = {\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  compareDependencies: _dependenciesCompareGenerated.compareDependencies,\n  divideDependencies: _dependenciesDivideGenerated.divideDependencies,\n  partitionSelectDependencies: _dependenciesPartitionSelectGenerated.partitionSelectDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createMedian: _factoriesAny.createMedian\n};\nexports.medianDependencies = medianDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.madDependencies = void 0;\nvar _dependenciesAbsGenerated = require(\"./dependenciesAbs.generated.js\");\nvar _dependenciesMapGenerated = require(\"./dependenciesMap.generated.js\");\nvar _dependenciesMedianGenerated = require(\"./dependenciesMedian.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar madDependencies = {\n  absDependencies: _dependenciesAbsGenerated.absDependencies,\n  mapDependencies: _dependenciesMapGenerated.mapDependencies,\n  medianDependencies: _dependenciesMedianGenerated.medianDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createMad: _factoriesAny.createMad\n};\nexports.madDependencies = madDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.magneticConstantDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar magneticConstantDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createMagneticConstant: _factoriesAny.createMagneticConstant\n};\nexports.magneticConstantDependencies = magneticConstantDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.magneticFluxQuantumDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar magneticFluxQuantumDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createMagneticFluxQuantum: _factoriesAny.createMagneticFluxQuantum\n};\nexports.magneticFluxQuantumDependencies = magneticFluxQuantumDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.mapTransformDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar mapTransformDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createMapTransform: _factoriesAny.createMapTransform\n};\nexports.mapTransformDependencies = mapTransformDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.matrixFromFunctionDependencies = void 0;\nvar _dependenciesIsZeroGenerated = require(\"./dependenciesIsZero.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar matrixFromFunctionDependencies = {\n  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createMatrixFromFunction: _factoriesAny.createMatrixFromFunction\n};\nexports.matrixFromFunctionDependencies = matrixFromFunctionDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.matrixFromRowsDependencies = void 0;\nvar _dependenciesFlattenGenerated = require(\"./dependenciesFlatten.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesSizeGenerated = require(\"./dependenciesSize.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar matrixFromRowsDependencies = {\n  flattenDependencies: _dependenciesFlattenGenerated.flattenDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createMatrixFromRows: _factoriesAny.createMatrixFromRows\n};\nexports.matrixFromRowsDependencies = matrixFromRowsDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.maxDependencies = void 0;\nvar _dependenciesLargerGenerated = require(\"./dependenciesLarger.generated.js\");\nvar _dependenciesNumericGenerated = require(\"./dependenciesNumeric.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar maxDependencies = {\n  largerDependencies: _dependenciesLargerGenerated.largerDependencies,\n  numericDependencies: _dependenciesNumericGenerated.numericDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createMax: _factoriesAny.createMax\n};\nexports.maxDependencies = maxDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.maxTransformDependencies = void 0;\nvar _dependenciesLargerGenerated = require(\"./dependenciesLarger.generated.js\");\nvar _dependenciesNumericGenerated = require(\"./dependenciesNumeric.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar maxTransformDependencies = {\n  largerDependencies: _dependenciesLargerGenerated.largerDependencies,\n  numericDependencies: _dependenciesNumericGenerated.numericDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createMaxTransform: _factoriesAny.createMaxTransform\n};\nexports.maxTransformDependencies = maxTransformDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.meanDependencies = void 0;\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesDivideGenerated = require(\"./dependenciesDivide.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar meanDependencies = {\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  divideDependencies: _dependenciesDivideGenerated.divideDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createMean: _factoriesAny.createMean\n};\nexports.meanDependencies = meanDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.meanTransformDependencies = void 0;\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesDivideGenerated = require(\"./dependenciesDivide.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar meanTransformDependencies = {\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  divideDependencies: _dependenciesDivideGenerated.divideDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createMeanTransform: _factoriesAny.createMeanTransform\n};\nexports.meanTransformDependencies = meanTransformDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.minDependencies = void 0;\nvar _dependenciesNumericGenerated = require(\"./dependenciesNumeric.generated.js\");\nvar _dependenciesSmallerGenerated = require(\"./dependenciesSmaller.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar minDependencies = {\n  numericDependencies: _dependenciesNumericGenerated.numericDependencies,\n  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createMin: _factoriesAny.createMin\n};\nexports.minDependencies = minDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.minTransformDependencies = void 0;\nvar _dependenciesNumericGenerated = require(\"./dependenciesNumeric.generated.js\");\nvar _dependenciesSmallerGenerated = require(\"./dependenciesSmaller.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar minTransformDependencies = {\n  numericDependencies: _dependenciesNumericGenerated.numericDependencies,\n  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createMinTransform: _factoriesAny.createMinTransform\n};\nexports.minTransformDependencies = minTransformDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.modeDependencies = void 0;\nvar _dependenciesIsNaNGenerated = require(\"./dependenciesIsNaN.generated.js\");\nvar _dependenciesIsNumericGenerated = require(\"./dependenciesIsNumeric.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar modeDependencies = {\n  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,\n  isNumericDependencies: _dependenciesIsNumericGenerated.isNumericDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createMode: _factoriesAny.createMode\n};\nexports.modeDependencies = modeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.molarMassDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar molarMassDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createMolarMass: _factoriesAny.createMolarMass\n};\nexports.molarMassDependencies = molarMassDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.molarMassC12Dependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar molarMassC12Dependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createMolarMassC12: _factoriesAny.createMolarMassC12\n};\nexports.molarMassC12Dependencies = molarMassC12Dependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.molarPlanckConstantDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar molarPlanckConstantDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createMolarPlanckConstant: _factoriesAny.createMolarPlanckConstant\n};\nexports.molarPlanckConstantDependencies = molarPlanckConstantDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.molarVolumeDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar molarVolumeDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createMolarVolume: _factoriesAny.createMolarVolume\n};\nexports.molarVolumeDependencies = molarVolumeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.multinomialDependencies = void 0;\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesDivideGenerated = require(\"./dependenciesDivide.generated.js\");\nvar _dependenciesFactorialGenerated = require(\"./dependenciesFactorial.generated.js\");\nvar _dependenciesIsIntegerGenerated = require(\"./dependenciesIsInteger.generated.js\");\nvar _dependenciesIsPositiveGenerated = require(\"./dependenciesIsPositive.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar multinomialDependencies = {\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  divideDependencies: _dependenciesDivideGenerated.divideDependencies,\n  factorialDependencies: _dependenciesFactorialGenerated.factorialDependencies,\n  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,\n  isPositiveDependencies: _dependenciesIsPositiveGenerated.isPositiveDependencies,\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createMultinomial: _factoriesAny.createMultinomial\n};\nexports.multinomialDependencies = multinomialDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.NaNDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar NaNDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  createNaN: _factoriesAny.createNaN\n};\nexports.NaNDependencies = NaNDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.neutronMassDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar neutronMassDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createNeutronMass: _factoriesAny.createNeutronMass\n};\nexports.neutronMassDependencies = neutronMassDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.nthRootDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar nthRootDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createNthRoot: _factoriesAny.createNthRoot\n};\nexports.nthRootDependencies = nthRootDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.nthRootsDependencies = void 0;\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _dependenciesDivideScalarGenerated = require(\"./dependenciesDivideScalar.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar nthRootsDependencies = {\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createNthRoots: _factoriesAny.createNthRoots\n};\nexports.nthRootsDependencies = nthRootsDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.nuclearMagnetonDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar nuclearMagnetonDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createNuclearMagneton: _factoriesAny.createNuclearMagneton\n};\nexports.nuclearMagnetonDependencies = nuclearMagnetonDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.nullDependencies = void 0;\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar nullDependencies = {\n  createNull: _factoriesAny.createNull\n};\nexports.nullDependencies = nullDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.octDependencies = void 0;\nvar _dependenciesFormatGenerated = require(\"./dependenciesFormat.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar octDependencies = {\n  formatDependencies: _dependenciesFormatGenerated.formatDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createOct: _factoriesAny.createOct\n};\nexports.octDependencies = octDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.onesDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar onesDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createOnes: _factoriesAny.createOnes\n};\nexports.onesDependencies = onesDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.orDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar orDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createOr: _factoriesAny.createOr\n};\nexports.orDependencies = orDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.ParserDependencies = void 0;\nvar _dependenciesEvaluateGenerated = require(\"./dependenciesEvaluate.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar ParserDependencies = {\n  evaluateDependencies: _dependenciesEvaluateGenerated.evaluateDependencies,\n  createParserClass: _factoriesAny.createParserClass\n};\nexports.ParserDependencies = ParserDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.parserDependencies = void 0;\nvar _dependenciesParserClassGenerated = require(\"./dependenciesParserClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar parserDependencies = {\n  ParserDependencies: _dependenciesParserClassGenerated.ParserDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createParser: _factoriesAny.createParser\n};\nexports.parserDependencies = parserDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.permutationsDependencies = void 0;\nvar _dependenciesFactorialGenerated = require(\"./dependenciesFactorial.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar permutationsDependencies = {\n  factorialDependencies: _dependenciesFactorialGenerated.factorialDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createPermutations: _factoriesAny.createPermutations\n};\nexports.permutationsDependencies = permutationsDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.phiDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar phiDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  createPhi: _factoriesAny.createPhi\n};\nexports.phiDependencies = phiDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.piDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar piDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  createPi: _factoriesAny.createPi\n};\nexports.piDependencies = piDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.pickRandomDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar pickRandomDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createPickRandom: _factoriesAny.createPickRandom\n};\nexports.pickRandomDependencies = pickRandomDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.pinvDependencies = void 0;\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesComplexClass.generated.js\");\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesCtransposeGenerated = require(\"./dependenciesCtranspose.generated.js\");\nvar _dependenciesDeepEqualGenerated = require(\"./dependenciesDeepEqual.generated.js\");\nvar _dependenciesDivideScalarGenerated = require(\"./dependenciesDivideScalar.generated.js\");\nvar _dependenciesDotGenerated = require(\"./dependenciesDot.generated.js\");\nvar _dependenciesDotDivideGenerated = require(\"./dependenciesDotDivide.generated.js\");\nvar _dependenciesEqualGenerated = require(\"./dependenciesEqual.generated.js\");\nvar _dependenciesInvGenerated = require(\"./dependenciesInv.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar pinvDependencies = {\n  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  ctransposeDependencies: _dependenciesCtransposeGenerated.ctransposeDependencies,\n  deepEqualDependencies: _dependenciesDeepEqualGenerated.deepEqualDependencies,\n  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,\n  dotDependencies: _dependenciesDotGenerated.dotDependencies,\n  dotDivideDependencies: _dependenciesDotDivideGenerated.dotDivideDependencies,\n  equalDependencies: _dependenciesEqualGenerated.equalDependencies,\n  invDependencies: _dependenciesInvGenerated.invDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createPinv: _factoriesAny.createPinv\n};\nexports.pinvDependencies = pinvDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.planckChargeDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar planckChargeDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createPlanckCharge: _factoriesAny.createPlanckCharge\n};\nexports.planckChargeDependencies = planckChargeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.planckConstantDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar planckConstantDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createPlanckConstant: _factoriesAny.createPlanckConstant\n};\nexports.planckConstantDependencies = planckConstantDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.planckLengthDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar planckLengthDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createPlanckLength: _factoriesAny.createPlanckLength\n};\nexports.planckLengthDependencies = planckLengthDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.planckMassDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar planckMassDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createPlanckMass: _factoriesAny.createPlanckMass\n};\nexports.planckMassDependencies = planckMassDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.planckTemperatureDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar planckTemperatureDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createPlanckTemperature: _factoriesAny.createPlanckTemperature\n};\nexports.planckTemperatureDependencies = planckTemperatureDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.planckTimeDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar planckTimeDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createPlanckTime: _factoriesAny.createPlanckTime\n};\nexports.planckTimeDependencies = planckTimeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.typeOfDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar typeOfDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createTypeOf: _factoriesAny.createTypeOf\n};\nexports.typeOfDependencies = typeOfDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.polynomialRootDependencies = void 0;\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesCbrtGenerated = require(\"./dependenciesCbrt.generated.js\");\nvar _dependenciesDivideGenerated = require(\"./dependenciesDivide.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesImGenerated = require(\"./dependenciesIm.generated.js\");\nvar _dependenciesIsZeroGenerated = require(\"./dependenciesIsZero.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesReGenerated = require(\"./dependenciesRe.generated.js\");\nvar _dependenciesSqrtGenerated = require(\"./dependenciesSqrt.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTypeOfGenerated = require(\"./dependenciesTypeOf.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _dependenciesUnaryMinusGenerated = require(\"./dependenciesUnaryMinus.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar polynomialRootDependencies = {\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  cbrtDependencies: _dependenciesCbrtGenerated.cbrtDependencies,\n  divideDependencies: _dependenciesDivideGenerated.divideDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  imDependencies: _dependenciesImGenerated.imDependencies,\n  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  reDependencies: _dependenciesReGenerated.reDependencies,\n  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  typeOfDependencies: _dependenciesTypeOfGenerated.typeOfDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,\n  createPolynomialRoot: _factoriesAny.createPolynomialRoot\n};\nexports.polynomialRootDependencies = polynomialRootDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.printDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar printDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createPrint: _factoriesAny.createPrint\n};\nexports.printDependencies = printDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.protonMassDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar protonMassDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createProtonMass: _factoriesAny.createProtonMass\n};\nexports.protonMassDependencies = protonMassDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.quantileSeqDependencies = void 0;\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesCompareGenerated = require(\"./dependenciesCompare.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesPartitionSelectGenerated = require(\"./dependenciesPartitionSelect.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar quantileSeqDependencies = {\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  compareDependencies: _dependenciesCompareGenerated.compareDependencies,\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  partitionSelectDependencies: _dependenciesPartitionSelectGenerated.partitionSelectDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createQuantileSeq: _factoriesAny.createQuantileSeq\n};\nexports.quantileSeqDependencies = quantileSeqDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.quantumOfCirculationDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar quantumOfCirculationDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createQuantumOfCirculation: _factoriesAny.createQuantumOfCirculation\n};\nexports.quantumOfCirculationDependencies = quantumOfCirculationDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.randomDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar randomDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createRandom: _factoriesAny.createRandom\n};\nexports.randomDependencies = randomDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.randomIntDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar randomIntDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createRandomInt: _factoriesAny.createRandomInt\n};\nexports.randomIntDependencies = randomIntDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.RangeDependencies = void 0;\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar RangeDependencies = {\n  createRangeClass: _factoriesAny.createRangeClass\n};\nexports.RangeDependencies = RangeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.rangeTransformDependencies = void 0;\nvar _dependenciesBignumberGenerated = require(\"./dependenciesBignumber.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesLargerGenerated = require(\"./dependenciesLarger.generated.js\");\nvar _dependenciesLargerEqGenerated = require(\"./dependenciesLargerEq.generated.js\");\nvar _dependenciesSmallerGenerated = require(\"./dependenciesSmaller.generated.js\");\nvar _dependenciesSmallerEqGenerated = require(\"./dependenciesSmallerEq.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar rangeTransformDependencies = {\n  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  largerDependencies: _dependenciesLargerGenerated.largerDependencies,\n  largerEqDependencies: _dependenciesLargerEqGenerated.largerEqDependencies,\n  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,\n  smallerEqDependencies: _dependenciesSmallerEqGenerated.smallerEqDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createRangeTransform: _factoriesAny.createRangeTransform\n};\nexports.rangeTransformDependencies = rangeTransformDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.rationalizeDependencies = void 0;\nvar _dependenciesBignumberGenerated = require(\"./dependenciesBignumber.generated.js\");\nvar _dependenciesFractionGenerated = require(\"./dependenciesFraction.generated.js\");\nvar _dependenciesAccessorNodeGenerated = require(\"./dependenciesAccessorNode.generated.js\");\nvar _dependenciesArrayNodeGenerated = require(\"./dependenciesArrayNode.generated.js\");\nvar _dependenciesConstantNodeGenerated = require(\"./dependenciesConstantNode.generated.js\");\nvar _dependenciesFunctionNodeGenerated = require(\"./dependenciesFunctionNode.generated.js\");\nvar _dependenciesIndexNodeGenerated = require(\"./dependenciesIndexNode.generated.js\");\nvar _dependenciesObjectNodeGenerated = require(\"./dependenciesObjectNode.generated.js\");\nvar _dependenciesOperatorNodeGenerated = require(\"./dependenciesOperatorNode.generated.js\");\nvar _dependenciesParenthesisNodeGenerated = require(\"./dependenciesParenthesisNode.generated.js\");\nvar _dependenciesSymbolNodeGenerated = require(\"./dependenciesSymbolNode.generated.js\");\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesDivideGenerated = require(\"./dependenciesDivide.generated.js\");\nvar _dependenciesEqualGenerated = require(\"./dependenciesEqual.generated.js\");\nvar _dependenciesIsZeroGenerated = require(\"./dependenciesIsZero.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesParseGenerated = require(\"./dependenciesParse.generated.js\");\nvar _dependenciesPowGenerated = require(\"./dependenciesPow.generated.js\");\nvar _dependenciesSimplifyGenerated = require(\"./dependenciesSimplify.generated.js\");\nvar _dependenciesSimplifyConstantGenerated = require(\"./dependenciesSimplifyConstant.generated.js\");\nvar _dependenciesSimplifyCoreGenerated = require(\"./dependenciesSimplifyCore.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar rationalizeDependencies = {\n  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,\n  fractionDependencies: _dependenciesFractionGenerated.fractionDependencies,\n  AccessorNodeDependencies: _dependenciesAccessorNodeGenerated.AccessorNodeDependencies,\n  ArrayNodeDependencies: _dependenciesArrayNodeGenerated.ArrayNodeDependencies,\n  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,\n  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,\n  IndexNodeDependencies: _dependenciesIndexNodeGenerated.IndexNodeDependencies,\n  ObjectNodeDependencies: _dependenciesObjectNodeGenerated.ObjectNodeDependencies,\n  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,\n  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,\n  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  divideDependencies: _dependenciesDivideGenerated.divideDependencies,\n  equalDependencies: _dependenciesEqualGenerated.equalDependencies,\n  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  parseDependencies: _dependenciesParseGenerated.parseDependencies,\n  powDependencies: _dependenciesPowGenerated.powDependencies,\n  simplifyDependencies: _dependenciesSimplifyGenerated.simplifyDependencies,\n  simplifyConstantDependencies: _dependenciesSimplifyConstantGenerated.simplifyConstantDependencies,\n  simplifyCoreDependencies: _dependenciesSimplifyCoreGenerated.simplifyCoreDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createRationalize: _factoriesAny.createRationalize\n};\nexports.rationalizeDependencies = rationalizeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.reducedPlanckConstantDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar reducedPlanckConstantDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createReducedPlanckConstant: _factoriesAny.createReducedPlanckConstant\n};\nexports.reducedPlanckConstantDependencies = reducedPlanckConstantDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.replacerDependencies = void 0;\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar replacerDependencies = {\n  createReplacer: _factoriesAny.createReplacer\n};\nexports.replacerDependencies = replacerDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.reshapeDependencies = void 0;\nvar _dependenciesIsIntegerGenerated = require(\"./dependenciesIsInteger.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar reshapeDependencies = {\n  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createReshape: _factoriesAny.createReshape\n};\nexports.reshapeDependencies = reshapeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.resizeDependencies = void 0;\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar resizeDependencies = {\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  createResize: _factoriesAny.createResize\n};\nexports.resizeDependencies = resizeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.reviverDependencies = void 0;\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar reviverDependencies = {\n  createReviver: _factoriesAny.createReviver\n};\nexports.reviverDependencies = reviverDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.rightArithShiftDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _dependenciesZerosGenerated = require(\"./dependenciesZeros.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar rightArithShiftDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,\n  createRightArithShift: _factoriesAny.createRightArithShift\n};\nexports.rightArithShiftDependencies = rightArithShiftDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.rightLogShiftDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _dependenciesZerosGenerated = require(\"./dependenciesZeros.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar rightLogShiftDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,\n  createRightLogShift: _factoriesAny.createRightLogShift\n};\nexports.rightLogShiftDependencies = rightLogShiftDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.rotationMatrixDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesSparseMatrixClassGenerated = require(\"./dependenciesSparseMatrixClass.generated.js\");\nvar _dependenciesAddScalarGenerated = require(\"./dependenciesAddScalar.generated.js\");\nvar _dependenciesCosGenerated = require(\"./dependenciesCos.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesMultiplyScalarGenerated = require(\"./dependenciesMultiplyScalar.generated.js\");\nvar _dependenciesNormGenerated = require(\"./dependenciesNorm.generated.js\");\nvar _dependenciesSinGenerated = require(\"./dependenciesSin.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _dependenciesUnaryMinusGenerated = require(\"./dependenciesUnaryMinus.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar rotationMatrixDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,\n  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,\n  cosDependencies: _dependenciesCosGenerated.cosDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,\n  normDependencies: _dependenciesNormGenerated.normDependencies,\n  sinDependencies: _dependenciesSinGenerated.sinDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,\n  createRotationMatrix: _factoriesAny.createRotationMatrix\n};\nexports.rotationMatrixDependencies = rotationMatrixDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.rotateDependencies = void 0;\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesRotationMatrixGenerated = require(\"./dependenciesRotationMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar rotateDependencies = {\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  rotationMatrixDependencies: _dependenciesRotationMatrixGenerated.rotationMatrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createRotate: _factoriesAny.createRotate\n};\nexports.rotateDependencies = rotateDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.rowDependencies = void 0;\nvar _dependenciesIndexClassGenerated = require(\"./dependenciesIndexClass.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesRangeGenerated = require(\"./dependenciesRange.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar rowDependencies = {\n  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  rangeDependencies: _dependenciesRangeGenerated.rangeDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createRow: _factoriesAny.createRow\n};\nexports.rowDependencies = rowDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.rowTransformDependencies = void 0;\nvar _dependenciesIndexClassGenerated = require(\"./dependenciesIndexClass.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesRangeGenerated = require(\"./dependenciesRange.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar rowTransformDependencies = {\n  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  rangeDependencies: _dependenciesRangeGenerated.rangeDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createRowTransform: _factoriesAny.createRowTransform\n};\nexports.rowTransformDependencies = rowTransformDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.rydbergDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar rydbergDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createRydberg: _factoriesAny.createRydberg\n};\nexports.rydbergDependencies = rydbergDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.SQRT1_2Dependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\n// eslint-disable-line camelcase\n\nvar SQRT1_2Dependencies = {\n  // eslint-disable-line camelcase\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  createSQRT1_2: _factoriesAny.createSQRT1_2\n};\nexports.SQRT1_2Dependencies = SQRT1_2Dependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.SQRT2Dependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar SQRT2Dependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  createSQRT2: _factoriesAny.createSQRT2\n};\nexports.SQRT2Dependencies = SQRT2Dependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.sackurTetrodeDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar sackurTetrodeDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  createSackurTetrode: _factoriesAny.createSackurTetrode\n};\nexports.sackurTetrodeDependencies = sackurTetrodeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.secDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar secDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSec: _factoriesAny.createSec\n};\nexports.secDependencies = secDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.sechDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar sechDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSech: _factoriesAny.createSech\n};\nexports.sechDependencies = sechDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.secondRadiationDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar secondRadiationDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createSecondRadiation: _factoriesAny.createSecondRadiation\n};\nexports.secondRadiationDependencies = secondRadiationDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.setCartesianDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesIndexClassGenerated = require(\"./dependenciesIndexClass.generated.js\");\nvar _dependenciesCompareNaturalGenerated = require(\"./dependenciesCompareNatural.generated.js\");\nvar _dependenciesSizeGenerated = require(\"./dependenciesSize.generated.js\");\nvar _dependenciesSubsetGenerated = require(\"./dependenciesSubset.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar setCartesianDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,\n  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,\n  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,\n  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSetCartesian: _factoriesAny.createSetCartesian\n};\nexports.setCartesianDependencies = setCartesianDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.setDifferenceDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesIndexClassGenerated = require(\"./dependenciesIndexClass.generated.js\");\nvar _dependenciesCompareNaturalGenerated = require(\"./dependenciesCompareNatural.generated.js\");\nvar _dependenciesSizeGenerated = require(\"./dependenciesSize.generated.js\");\nvar _dependenciesSubsetGenerated = require(\"./dependenciesSubset.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar setDifferenceDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,\n  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,\n  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,\n  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSetDifference: _factoriesAny.createSetDifference\n};\nexports.setDifferenceDependencies = setDifferenceDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.setDistinctDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesIndexClassGenerated = require(\"./dependenciesIndexClass.generated.js\");\nvar _dependenciesCompareNaturalGenerated = require(\"./dependenciesCompareNatural.generated.js\");\nvar _dependenciesSizeGenerated = require(\"./dependenciesSize.generated.js\");\nvar _dependenciesSubsetGenerated = require(\"./dependenciesSubset.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar setDistinctDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,\n  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,\n  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,\n  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSetDistinct: _factoriesAny.createSetDistinct\n};\nexports.setDistinctDependencies = setDistinctDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.setIntersectDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesIndexClassGenerated = require(\"./dependenciesIndexClass.generated.js\");\nvar _dependenciesCompareNaturalGenerated = require(\"./dependenciesCompareNatural.generated.js\");\nvar _dependenciesSizeGenerated = require(\"./dependenciesSize.generated.js\");\nvar _dependenciesSubsetGenerated = require(\"./dependenciesSubset.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar setIntersectDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,\n  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,\n  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,\n  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSetIntersect: _factoriesAny.createSetIntersect\n};\nexports.setIntersectDependencies = setIntersectDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.setIsSubsetDependencies = void 0;\nvar _dependenciesIndexClassGenerated = require(\"./dependenciesIndexClass.generated.js\");\nvar _dependenciesCompareNaturalGenerated = require(\"./dependenciesCompareNatural.generated.js\");\nvar _dependenciesSizeGenerated = require(\"./dependenciesSize.generated.js\");\nvar _dependenciesSubsetGenerated = require(\"./dependenciesSubset.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar setIsSubsetDependencies = {\n  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,\n  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,\n  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,\n  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSetIsSubset: _factoriesAny.createSetIsSubset\n};\nexports.setIsSubsetDependencies = setIsSubsetDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.setMultiplicityDependencies = void 0;\nvar _dependenciesIndexClassGenerated = require(\"./dependenciesIndexClass.generated.js\");\nvar _dependenciesCompareNaturalGenerated = require(\"./dependenciesCompareNatural.generated.js\");\nvar _dependenciesSizeGenerated = require(\"./dependenciesSize.generated.js\");\nvar _dependenciesSubsetGenerated = require(\"./dependenciesSubset.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar setMultiplicityDependencies = {\n  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,\n  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,\n  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,\n  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSetMultiplicity: _factoriesAny.createSetMultiplicity\n};\nexports.setMultiplicityDependencies = setMultiplicityDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.setPowersetDependencies = void 0;\nvar _dependenciesIndexClassGenerated = require(\"./dependenciesIndexClass.generated.js\");\nvar _dependenciesCompareNaturalGenerated = require(\"./dependenciesCompareNatural.generated.js\");\nvar _dependenciesSizeGenerated = require(\"./dependenciesSize.generated.js\");\nvar _dependenciesSubsetGenerated = require(\"./dependenciesSubset.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar setPowersetDependencies = {\n  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,\n  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,\n  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,\n  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSetPowerset: _factoriesAny.createSetPowerset\n};\nexports.setPowersetDependencies = setPowersetDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.setSizeDependencies = void 0;\nvar _dependenciesCompareNaturalGenerated = require(\"./dependenciesCompareNatural.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar setSizeDependencies = {\n  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSetSize: _factoriesAny.createSetSize\n};\nexports.setSizeDependencies = setSizeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.setSymDifferenceDependencies = void 0;\nvar _dependenciesIndexClassGenerated = require(\"./dependenciesIndexClass.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesSetDifferenceGenerated = require(\"./dependenciesSetDifference.generated.js\");\nvar _dependenciesSizeGenerated = require(\"./dependenciesSize.generated.js\");\nvar _dependenciesSubsetGenerated = require(\"./dependenciesSubset.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar setSymDifferenceDependencies = {\n  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  setDifferenceDependencies: _dependenciesSetDifferenceGenerated.setDifferenceDependencies,\n  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,\n  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSetSymDifference: _factoriesAny.createSetSymDifference\n};\nexports.setSymDifferenceDependencies = setSymDifferenceDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.setUnionDependencies = void 0;\nvar _dependenciesIndexClassGenerated = require(\"./dependenciesIndexClass.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesSetIntersectGenerated = require(\"./dependenciesSetIntersect.generated.js\");\nvar _dependenciesSetSymDifferenceGenerated = require(\"./dependenciesSetSymDifference.generated.js\");\nvar _dependenciesSizeGenerated = require(\"./dependenciesSize.generated.js\");\nvar _dependenciesSubsetGenerated = require(\"./dependenciesSubset.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar setUnionDependencies = {\n  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  setIntersectDependencies: _dependenciesSetIntersectGenerated.setIntersectDependencies,\n  setSymDifferenceDependencies: _dependenciesSetSymDifferenceGenerated.setSymDifferenceDependencies,\n  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,\n  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSetUnion: _factoriesAny.createSetUnion\n};\nexports.setUnionDependencies = setUnionDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.sinhDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar sinhDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSinh: _factoriesAny.createSinh\n};\nexports.sinhDependencies = sinhDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.sortDependencies = void 0;\nvar _dependenciesCompareGenerated = require(\"./dependenciesCompare.generated.js\");\nvar _dependenciesCompareNaturalGenerated = require(\"./dependenciesCompareNatural.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar sortDependencies = {\n  compareDependencies: _dependenciesCompareGenerated.compareDependencies,\n  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSort: _factoriesAny.createSort\n};\nexports.sortDependencies = sortDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.sparseDependencies = void 0;\nvar _dependenciesSparseMatrixClassGenerated = require(\"./dependenciesSparseMatrixClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar sparseDependencies = {\n  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSparse: _factoriesAny.createSparse\n};\nexports.sparseDependencies = sparseDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.speedOfLightDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar speedOfLightDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createSpeedOfLight: _factoriesAny.createSpeedOfLight\n};\nexports.speedOfLightDependencies = speedOfLightDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.splitUnitDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar splitUnitDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSplitUnit: _factoriesAny.createSplitUnit\n};\nexports.splitUnitDependencies = splitUnitDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.sqrtmDependencies = void 0;\nvar _dependenciesAbsGenerated = require(\"./dependenciesAbs.generated.js\");\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesIdentityGenerated = require(\"./dependenciesIdentity.generated.js\");\nvar _dependenciesInvGenerated = require(\"./dependenciesInv.generated.js\");\nvar _dependenciesMapGenerated = require(\"./dependenciesMap.generated.js\");\nvar _dependenciesMaxGenerated = require(\"./dependenciesMax.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesSizeGenerated = require(\"./dependenciesSize.generated.js\");\nvar _dependenciesSqrtGenerated = require(\"./dependenciesSqrt.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar sqrtmDependencies = {\n  absDependencies: _dependenciesAbsGenerated.absDependencies,\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  identityDependencies: _dependenciesIdentityGenerated.identityDependencies,\n  invDependencies: _dependenciesInvGenerated.invDependencies,\n  mapDependencies: _dependenciesMapGenerated.mapDependencies,\n  maxDependencies: _dependenciesMaxGenerated.maxDependencies,\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,\n  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSqrtm: _factoriesAny.createSqrtm\n};\nexports.sqrtmDependencies = sqrtmDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.squareDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar squareDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSquare: _factoriesAny.createSquare\n};\nexports.squareDependencies = squareDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.squeezeDependencies = void 0;\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar squeezeDependencies = {\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSqueeze: _factoriesAny.createSqueeze\n};\nexports.squeezeDependencies = squeezeDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.varianceDependencies = void 0;\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesApplyGenerated = require(\"./dependenciesApply.generated.js\");\nvar _dependenciesDivideGenerated = require(\"./dependenciesDivide.generated.js\");\nvar _dependenciesIsNaNGenerated = require(\"./dependenciesIsNaN.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar varianceDependencies = {\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  applyDependencies: _dependenciesApplyGenerated.applyDependencies,\n  divideDependencies: _dependenciesDivideGenerated.divideDependencies,\n  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createVariance: _factoriesAny.createVariance\n};\nexports.varianceDependencies = varianceDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.stdDependencies = void 0;\nvar _dependenciesMapGenerated = require(\"./dependenciesMap.generated.js\");\nvar _dependenciesSqrtGenerated = require(\"./dependenciesSqrt.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _dependenciesVarianceGenerated = require(\"./dependenciesVariance.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar stdDependencies = {\n  mapDependencies: _dependenciesMapGenerated.mapDependencies,\n  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  varianceDependencies: _dependenciesVarianceGenerated.varianceDependencies,\n  createStd: _factoriesAny.createStd\n};\nexports.stdDependencies = stdDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.stdTransformDependencies = void 0;\nvar _dependenciesMapGenerated = require(\"./dependenciesMap.generated.js\");\nvar _dependenciesSqrtGenerated = require(\"./dependenciesSqrt.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _dependenciesVarianceGenerated = require(\"./dependenciesVariance.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar stdTransformDependencies = {\n  mapDependencies: _dependenciesMapGenerated.mapDependencies,\n  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  varianceDependencies: _dependenciesVarianceGenerated.varianceDependencies,\n  createStdTransform: _factoriesAny.createStdTransform\n};\nexports.stdTransformDependencies = stdTransformDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.stefanBoltzmannDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar stefanBoltzmannDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createStefanBoltzmann: _factoriesAny.createStefanBoltzmann\n};\nexports.stefanBoltzmannDependencies = stefanBoltzmannDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.stringDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar stringDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createString: _factoriesAny.createString\n};\nexports.stringDependencies = stringDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.subsetTransformDependencies = void 0;\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar subsetTransformDependencies = {\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSubsetTransform: _factoriesAny.createSubsetTransform\n};\nexports.subsetTransformDependencies = subsetTransformDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.sumTransformDependencies = void 0;\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesNumericGenerated = require(\"./dependenciesNumeric.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar sumTransformDependencies = {\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  numericDependencies: _dependenciesNumericGenerated.numericDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSumTransform: _factoriesAny.createSumTransform\n};\nexports.sumTransformDependencies = sumTransformDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.symbolicEqualDependencies = void 0;\nvar _dependenciesOperatorNodeGenerated = require(\"./dependenciesOperatorNode.generated.js\");\nvar _dependenciesParseGenerated = require(\"./dependenciesParse.generated.js\");\nvar _dependenciesSimplifyGenerated = require(\"./dependenciesSimplify.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar symbolicEqualDependencies = {\n  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,\n  parseDependencies: _dependenciesParseGenerated.parseDependencies,\n  simplifyDependencies: _dependenciesSimplifyGenerated.simplifyDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createSymbolicEqual: _factoriesAny.createSymbolicEqual\n};\nexports.symbolicEqualDependencies = symbolicEqualDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.tanDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar tanDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createTan: _factoriesAny.createTan\n};\nexports.tanDependencies = tanDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.tanhDependencies = void 0;\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar tanhDependencies = {\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createTanh: _factoriesAny.createTanh\n};\nexports.tanhDependencies = tanhDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.thomsonCrossSectionDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar thomsonCrossSectionDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createThomsonCrossSection: _factoriesAny.createThomsonCrossSection\n};\nexports.thomsonCrossSectionDependencies = thomsonCrossSectionDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.toDependencies = void 0;\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar toDependencies = {\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createTo: _factoriesAny.createTo\n};\nexports.toDependencies = toDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.traceDependencies = void 0;\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar traceDependencies = {\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createTrace: _factoriesAny.createTrace\n};\nexports.traceDependencies = traceDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.trueDependencies = void 0;\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar trueDependencies = {\n  createTrue: _factoriesAny.createTrue\n};\nexports.trueDependencies = trueDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.unequalDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesEqualScalar.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar unequalDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createUnequal: _factoriesAny.createUnequal\n};\nexports.unequalDependencies = unequalDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.unitDependencies = void 0;\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar unitDependencies = {\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createUnitFunction: _factoriesAny.createUnitFunction\n};\nexports.unitDependencies = unitDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.EDependencies = void 0;\nvar _dependenciesEGenerated = require(\"./dependenciesE.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar EDependencies = {\n  eDependencies: _dependenciesEGenerated.eDependencies,\n  createUppercaseE: _factoriesAny.createUppercaseE\n};\nexports.EDependencies = EDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.PIDependencies = void 0;\nvar _dependenciesPiGenerated = require(\"./dependenciesPi.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar PIDependencies = {\n  piDependencies: _dependenciesPiGenerated.piDependencies,\n  createUppercasePi: _factoriesAny.createUppercasePi\n};\nexports.PIDependencies = PIDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.vacuumImpedanceDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar vacuumImpedanceDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createVacuumImpedance: _factoriesAny.createVacuumImpedance\n};\nexports.vacuumImpedanceDependencies = vacuumImpedanceDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.varianceTransformDependencies = void 0;\nvar _dependenciesAddGenerated = require(\"./dependenciesAdd.generated.js\");\nvar _dependenciesApplyGenerated = require(\"./dependenciesApply.generated.js\");\nvar _dependenciesDivideGenerated = require(\"./dependenciesDivide.generated.js\");\nvar _dependenciesIsNaNGenerated = require(\"./dependenciesIsNaN.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesMultiply.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesSubtract.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar varianceTransformDependencies = {\n  addDependencies: _dependenciesAddGenerated.addDependencies,\n  applyDependencies: _dependenciesApplyGenerated.applyDependencies,\n  divideDependencies: _dependenciesDivideGenerated.divideDependencies,\n  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,\n  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,\n  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createVarianceTransform: _factoriesAny.createVarianceTransform\n};\nexports.varianceTransformDependencies = varianceTransformDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.versionDependencies = void 0;\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar versionDependencies = {\n  createVersion: _factoriesAny.createVersion\n};\nexports.versionDependencies = versionDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.weakMixingAngleDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar weakMixingAngleDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  createWeakMixingAngle: _factoriesAny.createWeakMixingAngle\n};\nexports.weakMixingAngleDependencies = weakMixingAngleDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.wienDisplacementDependencies = void 0;\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesBigNumberClass.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesUnitClass.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar wienDisplacementDependencies = {\n  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,\n  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,\n  createWienDisplacement: _factoriesAny.createWienDisplacement\n};\nexports.wienDisplacementDependencies = wienDisplacementDependencies;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.xorDependencies = void 0;\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesConcat.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesMatrix.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesTyped.generated.js\");\nvar _factoriesAny = require(\"../../factoriesAny.js\");\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\n\nvar xorDependencies = {\n  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,\n  concatDependencies: _dependenciesConcatGenerated.concatDependencies,\n  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,\n  typedDependencies: _dependenciesTypedGenerated.typedDependencies,\n  createXor: _factoriesAny.createXor\n};\nexports.xorDependencies = xorDependencies;","\"use strict\";\n\nvar _typeof = require(\"@babel/runtime/helpers/typeof\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.all = void 0;\nvar allFactories = _interopRequireWildcard(require(\"../factoriesAny.js\"));\nfunction _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== \"function\") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }\nfunction _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || _typeof(obj) !== \"object\" && typeof obj !== \"function\") { return { \"default\": obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== \"default\" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj[\"default\"] = obj; if (cache) { cache.set(obj, newObj); } return newObj; }\n// creating all factories here in a separate file is needed to get tree-shaking working\n\nvar all = allFactories;\nexports.all = all;","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nObject.defineProperty(exports, \"AccessorNodeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesAccessorNodeGenerated.AccessorNodeDependencies;\n  }\n});\nObject.defineProperty(exports, \"ArrayNodeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesArrayNodeGenerated.ArrayNodeDependencies;\n  }\n});\nObject.defineProperty(exports, \"AssignmentNodeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesAssignmentNodeGenerated.AssignmentNodeDependencies;\n  }\n});\nObject.defineProperty(exports, \"BigNumberDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesBigNumberClassGenerated.BigNumberDependencies;\n  }\n});\nObject.defineProperty(exports, \"BlockNodeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesBlockNodeGenerated.BlockNodeDependencies;\n  }\n});\nObject.defineProperty(exports, \"ChainDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesChainClassGenerated.ChainDependencies;\n  }\n});\nObject.defineProperty(exports, \"ComplexDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesComplexClassGenerated.ComplexDependencies;\n  }\n});\nObject.defineProperty(exports, \"ConditionalNodeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesConditionalNodeGenerated.ConditionalNodeDependencies;\n  }\n});\nObject.defineProperty(exports, \"ConstantNodeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesConstantNodeGenerated.ConstantNodeDependencies;\n  }\n});\nObject.defineProperty(exports, \"DenseMatrixDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies;\n  }\n});\nObject.defineProperty(exports, \"EDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesUppercaseEGenerated.EDependencies;\n  }\n});\nObject.defineProperty(exports, \"FibonacciHeapDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesFibonacciHeapClassGenerated.FibonacciHeapDependencies;\n  }\n});\nObject.defineProperty(exports, \"FractionDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesFractionClassGenerated.FractionDependencies;\n  }\n});\nObject.defineProperty(exports, \"FunctionAssignmentNodeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesFunctionAssignmentNodeGenerated.FunctionAssignmentNodeDependencies;\n  }\n});\nObject.defineProperty(exports, \"FunctionNodeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesFunctionNodeGenerated.FunctionNodeDependencies;\n  }\n});\nObject.defineProperty(exports, \"HelpDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesHelpClassGenerated.HelpDependencies;\n  }\n});\nObject.defineProperty(exports, \"ImmutableDenseMatrixDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesImmutableDenseMatrixClassGenerated.ImmutableDenseMatrixDependencies;\n  }\n});\nObject.defineProperty(exports, \"IndexDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesIndexClassGenerated.IndexDependencies;\n  }\n});\nObject.defineProperty(exports, \"IndexNodeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesIndexNodeGenerated.IndexNodeDependencies;\n  }\n});\nObject.defineProperty(exports, \"InfinityDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesInfinityGenerated.InfinityDependencies;\n  }\n});\nObject.defineProperty(exports, \"LN10Dependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesLN10Generated.LN10Dependencies;\n  }\n});\nObject.defineProperty(exports, \"LN2Dependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesLN2Generated.LN2Dependencies;\n  }\n});\nObject.defineProperty(exports, \"LOG10EDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesLOG10EGenerated.LOG10EDependencies;\n  }\n});\nObject.defineProperty(exports, \"LOG2EDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesLOG2EGenerated.LOG2EDependencies;\n  }\n});\nObject.defineProperty(exports, \"MatrixDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesMatrixClassGenerated.MatrixDependencies;\n  }\n});\nObject.defineProperty(exports, \"NaNDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesNaNGenerated.NaNDependencies;\n  }\n});\nObject.defineProperty(exports, \"NodeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesNodeGenerated.NodeDependencies;\n  }\n});\nObject.defineProperty(exports, \"ObjectNodeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesObjectNodeGenerated.ObjectNodeDependencies;\n  }\n});\nObject.defineProperty(exports, \"OperatorNodeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesOperatorNodeGenerated.OperatorNodeDependencies;\n  }\n});\nObject.defineProperty(exports, \"PIDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesUppercasePiGenerated.PIDependencies;\n  }\n});\nObject.defineProperty(exports, \"ParenthesisNodeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies;\n  }\n});\nObject.defineProperty(exports, \"ParserDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesParserClassGenerated.ParserDependencies;\n  }\n});\nObject.defineProperty(exports, \"RangeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesRangeClassGenerated.RangeDependencies;\n  }\n});\nObject.defineProperty(exports, \"RangeNodeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesRangeNodeGenerated.RangeNodeDependencies;\n  }\n});\nObject.defineProperty(exports, \"RelationalNodeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesRelationalNodeGenerated.RelationalNodeDependencies;\n  }\n});\nObject.defineProperty(exports, \"ResultSetDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesResultSetGenerated.ResultSetDependencies;\n  }\n});\nObject.defineProperty(exports, \"SQRT1_2Dependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSQRT1_2Generated.SQRT1_2Dependencies;\n  }\n});\nObject.defineProperty(exports, \"SQRT2Dependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSQRT2Generated.SQRT2Dependencies;\n  }\n});\nObject.defineProperty(exports, \"SpaDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSpaClassGenerated.SpaDependencies;\n  }\n});\nObject.defineProperty(exports, \"SparseMatrixDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies;\n  }\n});\nObject.defineProperty(exports, \"SymbolNodeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSymbolNodeGenerated.SymbolNodeDependencies;\n  }\n});\nObject.defineProperty(exports, \"UnitDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesUnitClassGenerated.UnitDependencies;\n  }\n});\nObject.defineProperty(exports, \"absDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesAbsGenerated.absDependencies;\n  }\n});\nObject.defineProperty(exports, \"acosDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesAcosGenerated.acosDependencies;\n  }\n});\nObject.defineProperty(exports, \"acoshDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesAcoshGenerated.acoshDependencies;\n  }\n});\nObject.defineProperty(exports, \"acotDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesAcotGenerated.acotDependencies;\n  }\n});\nObject.defineProperty(exports, \"acothDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesAcothGenerated.acothDependencies;\n  }\n});\nObject.defineProperty(exports, \"acscDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesAcscGenerated.acscDependencies;\n  }\n});\nObject.defineProperty(exports, \"acschDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesAcschGenerated.acschDependencies;\n  }\n});\nObject.defineProperty(exports, \"addDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesAddGenerated.addDependencies;\n  }\n});\nObject.defineProperty(exports, \"addScalarDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesAddScalarGenerated.addScalarDependencies;\n  }\n});\nObject.defineProperty(exports, \"all\", {\n  enumerable: true,\n  get: function get() {\n    return _allFactoriesAny.all;\n  }\n});\nObject.defineProperty(exports, \"andDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesAndGenerated.andDependencies;\n  }\n});\nObject.defineProperty(exports, \"applyDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesApplyGenerated.applyDependencies;\n  }\n});\nObject.defineProperty(exports, \"applyTransformDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesApplyTransformGenerated.applyTransformDependencies;\n  }\n});\nObject.defineProperty(exports, \"argDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesArgGenerated.argDependencies;\n  }\n});\nObject.defineProperty(exports, \"asecDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesAsecGenerated.asecDependencies;\n  }\n});\nObject.defineProperty(exports, \"asechDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesAsechGenerated.asechDependencies;\n  }\n});\nObject.defineProperty(exports, \"asinDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesAsinGenerated.asinDependencies;\n  }\n});\nObject.defineProperty(exports, \"asinhDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesAsinhGenerated.asinhDependencies;\n  }\n});\nObject.defineProperty(exports, \"atan2Dependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesAtan2Generated.atan2Dependencies;\n  }\n});\nObject.defineProperty(exports, \"atanDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesAtanGenerated.atanDependencies;\n  }\n});\nObject.defineProperty(exports, \"atanhDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesAtanhGenerated.atanhDependencies;\n  }\n});\nObject.defineProperty(exports, \"atomicMassDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesAtomicMassGenerated.atomicMassDependencies;\n  }\n});\nObject.defineProperty(exports, \"avogadroDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesAvogadroGenerated.avogadroDependencies;\n  }\n});\nObject.defineProperty(exports, \"bellNumbersDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesBellNumbersGenerated.bellNumbersDependencies;\n  }\n});\nObject.defineProperty(exports, \"bignumberDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesBignumberGenerated.bignumberDependencies;\n  }\n});\nObject.defineProperty(exports, \"binDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesBinGenerated.binDependencies;\n  }\n});\nObject.defineProperty(exports, \"bitAndDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesBitAndGenerated.bitAndDependencies;\n  }\n});\nObject.defineProperty(exports, \"bitNotDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesBitNotGenerated.bitNotDependencies;\n  }\n});\nObject.defineProperty(exports, \"bitOrDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesBitOrGenerated.bitOrDependencies;\n  }\n});\nObject.defineProperty(exports, \"bitXorDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesBitXorGenerated.bitXorDependencies;\n  }\n});\nObject.defineProperty(exports, \"bohrMagnetonDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesBohrMagnetonGenerated.bohrMagnetonDependencies;\n  }\n});\nObject.defineProperty(exports, \"bohrRadiusDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesBohrRadiusGenerated.bohrRadiusDependencies;\n  }\n});\nObject.defineProperty(exports, \"boltzmannDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesBoltzmannGenerated.boltzmannDependencies;\n  }\n});\nObject.defineProperty(exports, \"booleanDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesBooleanGenerated.booleanDependencies;\n  }\n});\nObject.defineProperty(exports, \"catalanDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCatalanGenerated.catalanDependencies;\n  }\n});\nObject.defineProperty(exports, \"cbrtDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCbrtGenerated.cbrtDependencies;\n  }\n});\nObject.defineProperty(exports, \"ceilDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCeilGenerated.ceilDependencies;\n  }\n});\nObject.defineProperty(exports, \"chainDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesChainGenerated.chainDependencies;\n  }\n});\nObject.defineProperty(exports, \"classicalElectronRadiusDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesClassicalElectronRadiusGenerated.classicalElectronRadiusDependencies;\n  }\n});\nObject.defineProperty(exports, \"cloneDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCloneGenerated.cloneDependencies;\n  }\n});\nObject.defineProperty(exports, \"columnDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesColumnGenerated.columnDependencies;\n  }\n});\nObject.defineProperty(exports, \"columnTransformDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesColumnTransformGenerated.columnTransformDependencies;\n  }\n});\nObject.defineProperty(exports, \"combinationsDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCombinationsGenerated.combinationsDependencies;\n  }\n});\nObject.defineProperty(exports, \"combinationsWithRepDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCombinationsWithRepGenerated.combinationsWithRepDependencies;\n  }\n});\nObject.defineProperty(exports, \"compareDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCompareGenerated.compareDependencies;\n  }\n});\nObject.defineProperty(exports, \"compareNaturalDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCompareNaturalGenerated.compareNaturalDependencies;\n  }\n});\nObject.defineProperty(exports, \"compareTextDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCompareTextGenerated.compareTextDependencies;\n  }\n});\nObject.defineProperty(exports, \"compileDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCompileGenerated.compileDependencies;\n  }\n});\nObject.defineProperty(exports, \"complexDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesComplexGenerated.complexDependencies;\n  }\n});\nObject.defineProperty(exports, \"compositionDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCompositionGenerated.compositionDependencies;\n  }\n});\nObject.defineProperty(exports, \"concatDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesConcatGenerated.concatDependencies;\n  }\n});\nObject.defineProperty(exports, \"concatTransformDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesConcatTransformGenerated.concatTransformDependencies;\n  }\n});\nObject.defineProperty(exports, \"conductanceQuantumDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesConductanceQuantumGenerated.conductanceQuantumDependencies;\n  }\n});\nObject.defineProperty(exports, \"conjDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesConjGenerated.conjDependencies;\n  }\n});\nObject.defineProperty(exports, \"cosDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCosGenerated.cosDependencies;\n  }\n});\nObject.defineProperty(exports, \"coshDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCoshGenerated.coshDependencies;\n  }\n});\nObject.defineProperty(exports, \"cotDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCotGenerated.cotDependencies;\n  }\n});\nObject.defineProperty(exports, \"cothDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCothGenerated.cothDependencies;\n  }\n});\nObject.defineProperty(exports, \"coulombDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCoulombGenerated.coulombDependencies;\n  }\n});\nObject.defineProperty(exports, \"countDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCountGenerated.countDependencies;\n  }\n});\nObject.defineProperty(exports, \"createUnitDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCreateUnitGenerated.createUnitDependencies;\n  }\n});\nObject.defineProperty(exports, \"crossDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCrossGenerated.crossDependencies;\n  }\n});\nObject.defineProperty(exports, \"cscDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCscGenerated.cscDependencies;\n  }\n});\nObject.defineProperty(exports, \"cschDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCschGenerated.cschDependencies;\n  }\n});\nObject.defineProperty(exports, \"ctransposeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCtransposeGenerated.ctransposeDependencies;\n  }\n});\nObject.defineProperty(exports, \"cubeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCubeGenerated.cubeDependencies;\n  }\n});\nObject.defineProperty(exports, \"cumsumDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCumSumGenerated.cumsumDependencies;\n  }\n});\nObject.defineProperty(exports, \"cumsumTransformDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesCumSumTransformGenerated.cumsumTransformDependencies;\n  }\n});\nObject.defineProperty(exports, \"deepEqualDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesDeepEqualGenerated.deepEqualDependencies;\n  }\n});\nObject.defineProperty(exports, \"derivativeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesDerivativeGenerated.derivativeDependencies;\n  }\n});\nObject.defineProperty(exports, \"detDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesDetGenerated.detDependencies;\n  }\n});\nObject.defineProperty(exports, \"deuteronMassDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesDeuteronMassGenerated.deuteronMassDependencies;\n  }\n});\nObject.defineProperty(exports, \"diagDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesDiagGenerated.diagDependencies;\n  }\n});\nObject.defineProperty(exports, \"diffDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesDiffGenerated.diffDependencies;\n  }\n});\nObject.defineProperty(exports, \"diffTransformDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesDiffTransformGenerated.diffTransformDependencies;\n  }\n});\nObject.defineProperty(exports, \"distanceDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesDistanceGenerated.distanceDependencies;\n  }\n});\nObject.defineProperty(exports, \"divideDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesDivideGenerated.divideDependencies;\n  }\n});\nObject.defineProperty(exports, \"divideScalarDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesDivideScalarGenerated.divideScalarDependencies;\n  }\n});\nObject.defineProperty(exports, \"dotDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesDotGenerated.dotDependencies;\n  }\n});\nObject.defineProperty(exports, \"dotDivideDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesDotDivideGenerated.dotDivideDependencies;\n  }\n});\nObject.defineProperty(exports, \"dotMultiplyDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesDotMultiplyGenerated.dotMultiplyDependencies;\n  }\n});\nObject.defineProperty(exports, \"dotPowDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesDotPowGenerated.dotPowDependencies;\n  }\n});\nObject.defineProperty(exports, \"eDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesEGenerated.eDependencies;\n  }\n});\nObject.defineProperty(exports, \"efimovFactorDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesEfimovFactorGenerated.efimovFactorDependencies;\n  }\n});\nObject.defineProperty(exports, \"eigsDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesEigsGenerated.eigsDependencies;\n  }\n});\nObject.defineProperty(exports, \"electricConstantDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesElectricConstantGenerated.electricConstantDependencies;\n  }\n});\nObject.defineProperty(exports, \"electronMassDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesElectronMassGenerated.electronMassDependencies;\n  }\n});\nObject.defineProperty(exports, \"elementaryChargeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesElementaryChargeGenerated.elementaryChargeDependencies;\n  }\n});\nObject.defineProperty(exports, \"equalDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesEqualGenerated.equalDependencies;\n  }\n});\nObject.defineProperty(exports, \"equalScalarDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesEqualScalarGenerated.equalScalarDependencies;\n  }\n});\nObject.defineProperty(exports, \"equalTextDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesEqualTextGenerated.equalTextDependencies;\n  }\n});\nObject.defineProperty(exports, \"erfDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesErfGenerated.erfDependencies;\n  }\n});\nObject.defineProperty(exports, \"evaluateDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesEvaluateGenerated.evaluateDependencies;\n  }\n});\nObject.defineProperty(exports, \"expDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesExpGenerated.expDependencies;\n  }\n});\nObject.defineProperty(exports, \"expm1Dependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesExpm1Generated.expm1Dependencies;\n  }\n});\nObject.defineProperty(exports, \"expmDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesExpmGenerated.expmDependencies;\n  }\n});\nObject.defineProperty(exports, \"factorialDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesFactorialGenerated.factorialDependencies;\n  }\n});\nObject.defineProperty(exports, \"falseDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesFalseGenerated.falseDependencies;\n  }\n});\nObject.defineProperty(exports, \"faradayDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesFaradayGenerated.faradayDependencies;\n  }\n});\nObject.defineProperty(exports, \"fermiCouplingDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesFermiCouplingGenerated.fermiCouplingDependencies;\n  }\n});\nObject.defineProperty(exports, \"fftDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesFftGenerated.fftDependencies;\n  }\n});\nObject.defineProperty(exports, \"filterDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesFilterGenerated.filterDependencies;\n  }\n});\nObject.defineProperty(exports, \"filterTransformDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesFilterTransformGenerated.filterTransformDependencies;\n  }\n});\nObject.defineProperty(exports, \"fineStructureDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesFineStructureGenerated.fineStructureDependencies;\n  }\n});\nObject.defineProperty(exports, \"firstRadiationDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesFirstRadiationGenerated.firstRadiationDependencies;\n  }\n});\nObject.defineProperty(exports, \"fixDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesFixGenerated.fixDependencies;\n  }\n});\nObject.defineProperty(exports, \"flattenDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesFlattenGenerated.flattenDependencies;\n  }\n});\nObject.defineProperty(exports, \"floorDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesFloorGenerated.floorDependencies;\n  }\n});\nObject.defineProperty(exports, \"forEachDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesForEachGenerated.forEachDependencies;\n  }\n});\nObject.defineProperty(exports, \"forEachTransformDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesForEachTransformGenerated.forEachTransformDependencies;\n  }\n});\nObject.defineProperty(exports, \"formatDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesFormatGenerated.formatDependencies;\n  }\n});\nObject.defineProperty(exports, \"fractionDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesFractionGenerated.fractionDependencies;\n  }\n});\nObject.defineProperty(exports, \"gammaDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesGammaGenerated.gammaDependencies;\n  }\n});\nObject.defineProperty(exports, \"gasConstantDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesGasConstantGenerated.gasConstantDependencies;\n  }\n});\nObject.defineProperty(exports, \"gcdDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesGcdGenerated.gcdDependencies;\n  }\n});\nObject.defineProperty(exports, \"getMatrixDataTypeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesGetMatrixDataTypeGenerated.getMatrixDataTypeDependencies;\n  }\n});\nObject.defineProperty(exports, \"gravitationConstantDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesGravitationConstantGenerated.gravitationConstantDependencies;\n  }\n});\nObject.defineProperty(exports, \"gravityDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesGravityGenerated.gravityDependencies;\n  }\n});\nObject.defineProperty(exports, \"hartreeEnergyDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesHartreeEnergyGenerated.hartreeEnergyDependencies;\n  }\n});\nObject.defineProperty(exports, \"hasNumericValueDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesHasNumericValueGenerated.hasNumericValueDependencies;\n  }\n});\nObject.defineProperty(exports, \"helpDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesHelpGenerated.helpDependencies;\n  }\n});\nObject.defineProperty(exports, \"hexDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesHexGenerated.hexDependencies;\n  }\n});\nObject.defineProperty(exports, \"hypotDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesHypotGenerated.hypotDependencies;\n  }\n});\nObject.defineProperty(exports, \"iDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesIGenerated.iDependencies;\n  }\n});\nObject.defineProperty(exports, \"identityDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesIdentityGenerated.identityDependencies;\n  }\n});\nObject.defineProperty(exports, \"ifftDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesIfftGenerated.ifftDependencies;\n  }\n});\nObject.defineProperty(exports, \"imDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesImGenerated.imDependencies;\n  }\n});\nObject.defineProperty(exports, \"indexDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesIndexGenerated.indexDependencies;\n  }\n});\nObject.defineProperty(exports, \"indexTransformDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesIndexTransformGenerated.indexTransformDependencies;\n  }\n});\nObject.defineProperty(exports, \"intersectDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesIntersectGenerated.intersectDependencies;\n  }\n});\nObject.defineProperty(exports, \"invDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesInvGenerated.invDependencies;\n  }\n});\nObject.defineProperty(exports, \"inverseConductanceQuantumDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesInverseConductanceQuantumGenerated.inverseConductanceQuantumDependencies;\n  }\n});\nObject.defineProperty(exports, \"invmodDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesInvmodGenerated.invmodDependencies;\n  }\n});\nObject.defineProperty(exports, \"isIntegerDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesIsIntegerGenerated.isIntegerDependencies;\n  }\n});\nObject.defineProperty(exports, \"isNaNDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesIsNaNGenerated.isNaNDependencies;\n  }\n});\nObject.defineProperty(exports, \"isNegativeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesIsNegativeGenerated.isNegativeDependencies;\n  }\n});\nObject.defineProperty(exports, \"isNumericDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesIsNumericGenerated.isNumericDependencies;\n  }\n});\nObject.defineProperty(exports, \"isPositiveDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesIsPositiveGenerated.isPositiveDependencies;\n  }\n});\nObject.defineProperty(exports, \"isPrimeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesIsPrimeGenerated.isPrimeDependencies;\n  }\n});\nObject.defineProperty(exports, \"isZeroDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesIsZeroGenerated.isZeroDependencies;\n  }\n});\nObject.defineProperty(exports, \"kldivergenceDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesKldivergenceGenerated.kldivergenceDependencies;\n  }\n});\nObject.defineProperty(exports, \"klitzingDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesKlitzingGenerated.klitzingDependencies;\n  }\n});\nObject.defineProperty(exports, \"kronDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesKronGenerated.kronDependencies;\n  }\n});\nObject.defineProperty(exports, \"largerDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesLargerGenerated.largerDependencies;\n  }\n});\nObject.defineProperty(exports, \"largerEqDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesLargerEqGenerated.largerEqDependencies;\n  }\n});\nObject.defineProperty(exports, \"lcmDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesLcmGenerated.lcmDependencies;\n  }\n});\nObject.defineProperty(exports, \"leafCountDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesLeafCountGenerated.leafCountDependencies;\n  }\n});\nObject.defineProperty(exports, \"leftShiftDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesLeftShiftGenerated.leftShiftDependencies;\n  }\n});\nObject.defineProperty(exports, \"lgammaDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesLgammaGenerated.lgammaDependencies;\n  }\n});\nObject.defineProperty(exports, \"log10Dependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesLog10Generated.log10Dependencies;\n  }\n});\nObject.defineProperty(exports, \"log1pDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesLog1pGenerated.log1pDependencies;\n  }\n});\nObject.defineProperty(exports, \"log2Dependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesLog2Generated.log2Dependencies;\n  }\n});\nObject.defineProperty(exports, \"logDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesLogGenerated.logDependencies;\n  }\n});\nObject.defineProperty(exports, \"loschmidtDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesLoschmidtGenerated.loschmidtDependencies;\n  }\n});\nObject.defineProperty(exports, \"lsolveAllDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesLsolveAllGenerated.lsolveAllDependencies;\n  }\n});\nObject.defineProperty(exports, \"lsolveDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesLsolveGenerated.lsolveDependencies;\n  }\n});\nObject.defineProperty(exports, \"lupDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesLupGenerated.lupDependencies;\n  }\n});\nObject.defineProperty(exports, \"lusolveDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesLusolveGenerated.lusolveDependencies;\n  }\n});\nObject.defineProperty(exports, \"lyapDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesLyapGenerated.lyapDependencies;\n  }\n});\nObject.defineProperty(exports, \"madDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesMadGenerated.madDependencies;\n  }\n});\nObject.defineProperty(exports, \"magneticConstantDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesMagneticConstantGenerated.magneticConstantDependencies;\n  }\n});\nObject.defineProperty(exports, \"magneticFluxQuantumDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesMagneticFluxQuantumGenerated.magneticFluxQuantumDependencies;\n  }\n});\nObject.defineProperty(exports, \"mapDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesMapGenerated.mapDependencies;\n  }\n});\nObject.defineProperty(exports, \"mapTransformDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesMapTransformGenerated.mapTransformDependencies;\n  }\n});\nObject.defineProperty(exports, \"matrixDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesMatrixGenerated.matrixDependencies;\n  }\n});\nObject.defineProperty(exports, \"matrixFromColumnsDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesMatrixFromColumnsGenerated.matrixFromColumnsDependencies;\n  }\n});\nObject.defineProperty(exports, \"matrixFromFunctionDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesMatrixFromFunctionGenerated.matrixFromFunctionDependencies;\n  }\n});\nObject.defineProperty(exports, \"matrixFromRowsDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesMatrixFromRowsGenerated.matrixFromRowsDependencies;\n  }\n});\nObject.defineProperty(exports, \"maxDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesMaxGenerated.maxDependencies;\n  }\n});\nObject.defineProperty(exports, \"maxTransformDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesMaxTransformGenerated.maxTransformDependencies;\n  }\n});\nObject.defineProperty(exports, \"meanDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesMeanGenerated.meanDependencies;\n  }\n});\nObject.defineProperty(exports, \"meanTransformDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesMeanTransformGenerated.meanTransformDependencies;\n  }\n});\nObject.defineProperty(exports, \"medianDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesMedianGenerated.medianDependencies;\n  }\n});\nObject.defineProperty(exports, \"minDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesMinGenerated.minDependencies;\n  }\n});\nObject.defineProperty(exports, \"minTransformDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesMinTransformGenerated.minTransformDependencies;\n  }\n});\nObject.defineProperty(exports, \"modDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesModGenerated.modDependencies;\n  }\n});\nObject.defineProperty(exports, \"modeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesModeGenerated.modeDependencies;\n  }\n});\nObject.defineProperty(exports, \"molarMassC12Dependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesMolarMassC12Generated.molarMassC12Dependencies;\n  }\n});\nObject.defineProperty(exports, \"molarMassDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesMolarMassGenerated.molarMassDependencies;\n  }\n});\nObject.defineProperty(exports, \"molarPlanckConstantDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesMolarPlanckConstantGenerated.molarPlanckConstantDependencies;\n  }\n});\nObject.defineProperty(exports, \"molarVolumeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesMolarVolumeGenerated.molarVolumeDependencies;\n  }\n});\nObject.defineProperty(exports, \"multinomialDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesMultinomialGenerated.multinomialDependencies;\n  }\n});\nObject.defineProperty(exports, \"multiplyDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesMultiplyGenerated.multiplyDependencies;\n  }\n});\nObject.defineProperty(exports, \"multiplyScalarDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies;\n  }\n});\nObject.defineProperty(exports, \"neutronMassDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesNeutronMassGenerated.neutronMassDependencies;\n  }\n});\nObject.defineProperty(exports, \"normDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesNormGenerated.normDependencies;\n  }\n});\nObject.defineProperty(exports, \"notDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesNotGenerated.notDependencies;\n  }\n});\nObject.defineProperty(exports, \"nthRootDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesNthRootGenerated.nthRootDependencies;\n  }\n});\nObject.defineProperty(exports, \"nthRootsDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesNthRootsGenerated.nthRootsDependencies;\n  }\n});\nObject.defineProperty(exports, \"nuclearMagnetonDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesNuclearMagnetonGenerated.nuclearMagnetonDependencies;\n  }\n});\nObject.defineProperty(exports, \"nullDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesNullGenerated.nullDependencies;\n  }\n});\nObject.defineProperty(exports, \"numberDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesNumberGenerated.numberDependencies;\n  }\n});\nObject.defineProperty(exports, \"numericDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesNumericGenerated.numericDependencies;\n  }\n});\nObject.defineProperty(exports, \"octDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesOctGenerated.octDependencies;\n  }\n});\nObject.defineProperty(exports, \"onesDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesOnesGenerated.onesDependencies;\n  }\n});\nObject.defineProperty(exports, \"orDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesOrGenerated.orDependencies;\n  }\n});\nObject.defineProperty(exports, \"parseDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesParseGenerated.parseDependencies;\n  }\n});\nObject.defineProperty(exports, \"parserDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesParserGenerated.parserDependencies;\n  }\n});\nObject.defineProperty(exports, \"partitionSelectDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesPartitionSelectGenerated.partitionSelectDependencies;\n  }\n});\nObject.defineProperty(exports, \"permutationsDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesPermutationsGenerated.permutationsDependencies;\n  }\n});\nObject.defineProperty(exports, \"phiDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesPhiGenerated.phiDependencies;\n  }\n});\nObject.defineProperty(exports, \"piDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesPiGenerated.piDependencies;\n  }\n});\nObject.defineProperty(exports, \"pickRandomDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesPickRandomGenerated.pickRandomDependencies;\n  }\n});\nObject.defineProperty(exports, \"pinvDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesPinvGenerated.pinvDependencies;\n  }\n});\nObject.defineProperty(exports, \"planckChargeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesPlanckChargeGenerated.planckChargeDependencies;\n  }\n});\nObject.defineProperty(exports, \"planckConstantDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesPlanckConstantGenerated.planckConstantDependencies;\n  }\n});\nObject.defineProperty(exports, \"planckLengthDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesPlanckLengthGenerated.planckLengthDependencies;\n  }\n});\nObject.defineProperty(exports, \"planckMassDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesPlanckMassGenerated.planckMassDependencies;\n  }\n});\nObject.defineProperty(exports, \"planckTemperatureDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesPlanckTemperatureGenerated.planckTemperatureDependencies;\n  }\n});\nObject.defineProperty(exports, \"planckTimeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesPlanckTimeGenerated.planckTimeDependencies;\n  }\n});\nObject.defineProperty(exports, \"polynomialRootDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesPolynomialRootGenerated.polynomialRootDependencies;\n  }\n});\nObject.defineProperty(exports, \"powDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesPowGenerated.powDependencies;\n  }\n});\nObject.defineProperty(exports, \"printDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesPrintGenerated.printDependencies;\n  }\n});\nObject.defineProperty(exports, \"prodDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesProdGenerated.prodDependencies;\n  }\n});\nObject.defineProperty(exports, \"protonMassDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesProtonMassGenerated.protonMassDependencies;\n  }\n});\nObject.defineProperty(exports, \"qrDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesQrGenerated.qrDependencies;\n  }\n});\nObject.defineProperty(exports, \"quantileSeqDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesQuantileSeqGenerated.quantileSeqDependencies;\n  }\n});\nObject.defineProperty(exports, \"quantumOfCirculationDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesQuantumOfCirculationGenerated.quantumOfCirculationDependencies;\n  }\n});\nObject.defineProperty(exports, \"randomDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesRandomGenerated.randomDependencies;\n  }\n});\nObject.defineProperty(exports, \"randomIntDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesRandomIntGenerated.randomIntDependencies;\n  }\n});\nObject.defineProperty(exports, \"rangeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesRangeGenerated.rangeDependencies;\n  }\n});\nObject.defineProperty(exports, \"rangeTransformDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesRangeTransformGenerated.rangeTransformDependencies;\n  }\n});\nObject.defineProperty(exports, \"rationalizeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesRationalizeGenerated.rationalizeDependencies;\n  }\n});\nObject.defineProperty(exports, \"reDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesReGenerated.reDependencies;\n  }\n});\nObject.defineProperty(exports, \"reducedPlanckConstantDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesReducedPlanckConstantGenerated.reducedPlanckConstantDependencies;\n  }\n});\nObject.defineProperty(exports, \"replacerDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesReplacerGenerated.replacerDependencies;\n  }\n});\nObject.defineProperty(exports, \"reshapeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesReshapeGenerated.reshapeDependencies;\n  }\n});\nObject.defineProperty(exports, \"resizeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesResizeGenerated.resizeDependencies;\n  }\n});\nObject.defineProperty(exports, \"resolveDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesResolveGenerated.resolveDependencies;\n  }\n});\nObject.defineProperty(exports, \"reviverDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesReviverGenerated.reviverDependencies;\n  }\n});\nObject.defineProperty(exports, \"rightArithShiftDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesRightArithShiftGenerated.rightArithShiftDependencies;\n  }\n});\nObject.defineProperty(exports, \"rightLogShiftDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesRightLogShiftGenerated.rightLogShiftDependencies;\n  }\n});\nObject.defineProperty(exports, \"rotateDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesRotateGenerated.rotateDependencies;\n  }\n});\nObject.defineProperty(exports, \"rotationMatrixDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesRotationMatrixGenerated.rotationMatrixDependencies;\n  }\n});\nObject.defineProperty(exports, \"roundDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesRoundGenerated.roundDependencies;\n  }\n});\nObject.defineProperty(exports, \"rowDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesRowGenerated.rowDependencies;\n  }\n});\nObject.defineProperty(exports, \"rowTransformDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesRowTransformGenerated.rowTransformDependencies;\n  }\n});\nObject.defineProperty(exports, \"rydbergDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesRydbergGenerated.rydbergDependencies;\n  }\n});\nObject.defineProperty(exports, \"sackurTetrodeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSackurTetrodeGenerated.sackurTetrodeDependencies;\n  }\n});\nObject.defineProperty(exports, \"schurDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSchurGenerated.schurDependencies;\n  }\n});\nObject.defineProperty(exports, \"secDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSecGenerated.secDependencies;\n  }\n});\nObject.defineProperty(exports, \"sechDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSechGenerated.sechDependencies;\n  }\n});\nObject.defineProperty(exports, \"secondRadiationDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSecondRadiationGenerated.secondRadiationDependencies;\n  }\n});\nObject.defineProperty(exports, \"setCartesianDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSetCartesianGenerated.setCartesianDependencies;\n  }\n});\nObject.defineProperty(exports, \"setDifferenceDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSetDifferenceGenerated.setDifferenceDependencies;\n  }\n});\nObject.defineProperty(exports, \"setDistinctDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSetDistinctGenerated.setDistinctDependencies;\n  }\n});\nObject.defineProperty(exports, \"setIntersectDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSetIntersectGenerated.setIntersectDependencies;\n  }\n});\nObject.defineProperty(exports, \"setIsSubsetDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSetIsSubsetGenerated.setIsSubsetDependencies;\n  }\n});\nObject.defineProperty(exports, \"setMultiplicityDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSetMultiplicityGenerated.setMultiplicityDependencies;\n  }\n});\nObject.defineProperty(exports, \"setPowersetDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSetPowersetGenerated.setPowersetDependencies;\n  }\n});\nObject.defineProperty(exports, \"setSizeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSetSizeGenerated.setSizeDependencies;\n  }\n});\nObject.defineProperty(exports, \"setSymDifferenceDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSetSymDifferenceGenerated.setSymDifferenceDependencies;\n  }\n});\nObject.defineProperty(exports, \"setUnionDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSetUnionGenerated.setUnionDependencies;\n  }\n});\nObject.defineProperty(exports, \"signDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSignGenerated.signDependencies;\n  }\n});\nObject.defineProperty(exports, \"simplifyConstantDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSimplifyConstantGenerated.simplifyConstantDependencies;\n  }\n});\nObject.defineProperty(exports, \"simplifyCoreDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSimplifyCoreGenerated.simplifyCoreDependencies;\n  }\n});\nObject.defineProperty(exports, \"simplifyDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSimplifyGenerated.simplifyDependencies;\n  }\n});\nObject.defineProperty(exports, \"sinDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSinGenerated.sinDependencies;\n  }\n});\nObject.defineProperty(exports, \"sinhDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSinhGenerated.sinhDependencies;\n  }\n});\nObject.defineProperty(exports, \"sizeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSizeGenerated.sizeDependencies;\n  }\n});\nObject.defineProperty(exports, \"sluDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSluGenerated.sluDependencies;\n  }\n});\nObject.defineProperty(exports, \"smallerDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSmallerGenerated.smallerDependencies;\n  }\n});\nObject.defineProperty(exports, \"smallerEqDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSmallerEqGenerated.smallerEqDependencies;\n  }\n});\nObject.defineProperty(exports, \"sortDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSortGenerated.sortDependencies;\n  }\n});\nObject.defineProperty(exports, \"sparseDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSparseGenerated.sparseDependencies;\n  }\n});\nObject.defineProperty(exports, \"speedOfLightDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSpeedOfLightGenerated.speedOfLightDependencies;\n  }\n});\nObject.defineProperty(exports, \"splitUnitDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSplitUnitGenerated.splitUnitDependencies;\n  }\n});\nObject.defineProperty(exports, \"sqrtDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSqrtGenerated.sqrtDependencies;\n  }\n});\nObject.defineProperty(exports, \"sqrtmDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSqrtmGenerated.sqrtmDependencies;\n  }\n});\nObject.defineProperty(exports, \"squareDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSquareGenerated.squareDependencies;\n  }\n});\nObject.defineProperty(exports, \"squeezeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSqueezeGenerated.squeezeDependencies;\n  }\n});\nObject.defineProperty(exports, \"stdDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesStdGenerated.stdDependencies;\n  }\n});\nObject.defineProperty(exports, \"stdTransformDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesStdTransformGenerated.stdTransformDependencies;\n  }\n});\nObject.defineProperty(exports, \"stefanBoltzmannDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesStefanBoltzmannGenerated.stefanBoltzmannDependencies;\n  }\n});\nObject.defineProperty(exports, \"stirlingS2Dependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesStirlingS2Generated.stirlingS2Dependencies;\n  }\n});\nObject.defineProperty(exports, \"stringDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesStringGenerated.stringDependencies;\n  }\n});\nObject.defineProperty(exports, \"subsetDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSubsetGenerated.subsetDependencies;\n  }\n});\nObject.defineProperty(exports, \"subsetTransformDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSubsetTransformGenerated.subsetTransformDependencies;\n  }\n});\nObject.defineProperty(exports, \"subtractDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSubtractGenerated.subtractDependencies;\n  }\n});\nObject.defineProperty(exports, \"sumDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSumGenerated.sumDependencies;\n  }\n});\nObject.defineProperty(exports, \"sumTransformDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSumTransformGenerated.sumTransformDependencies;\n  }\n});\nObject.defineProperty(exports, \"sylvesterDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSylvesterGenerated.sylvesterDependencies;\n  }\n});\nObject.defineProperty(exports, \"symbolicEqualDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesSymbolicEqualGenerated.symbolicEqualDependencies;\n  }\n});\nObject.defineProperty(exports, \"tanDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesTanGenerated.tanDependencies;\n  }\n});\nObject.defineProperty(exports, \"tanhDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesTanhGenerated.tanhDependencies;\n  }\n});\nObject.defineProperty(exports, \"tauDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesTauGenerated.tauDependencies;\n  }\n});\nObject.defineProperty(exports, \"thomsonCrossSectionDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesThomsonCrossSectionGenerated.thomsonCrossSectionDependencies;\n  }\n});\nObject.defineProperty(exports, \"toDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesToGenerated.toDependencies;\n  }\n});\nObject.defineProperty(exports, \"traceDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesTraceGenerated.traceDependencies;\n  }\n});\nObject.defineProperty(exports, \"transposeDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesTransposeGenerated.transposeDependencies;\n  }\n});\nObject.defineProperty(exports, \"trueDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesTrueGenerated.trueDependencies;\n  }\n});\nObject.defineProperty(exports, \"typeOfDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesTypeOfGenerated.typeOfDependencies;\n  }\n});\nObject.defineProperty(exports, \"typedDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesTypedGenerated.typedDependencies;\n  }\n});\nObject.defineProperty(exports, \"unaryMinusDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesUnaryMinusGenerated.unaryMinusDependencies;\n  }\n});\nObject.defineProperty(exports, \"unaryPlusDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesUnaryPlusGenerated.unaryPlusDependencies;\n  }\n});\nObject.defineProperty(exports, \"unequalDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesUnequalGenerated.unequalDependencies;\n  }\n});\nObject.defineProperty(exports, \"unitDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesUnitFunctionGenerated.unitDependencies;\n  }\n});\nObject.defineProperty(exports, \"usolveAllDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesUsolveAllGenerated.usolveAllDependencies;\n  }\n});\nObject.defineProperty(exports, \"usolveDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesUsolveGenerated.usolveDependencies;\n  }\n});\nObject.defineProperty(exports, \"vacuumImpedanceDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesVacuumImpedanceGenerated.vacuumImpedanceDependencies;\n  }\n});\nObject.defineProperty(exports, \"varianceDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesVarianceGenerated.varianceDependencies;\n  }\n});\nObject.defineProperty(exports, \"varianceTransformDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesVarianceTransformGenerated.varianceTransformDependencies;\n  }\n});\nObject.defineProperty(exports, \"versionDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesVersionGenerated.versionDependencies;\n  }\n});\nObject.defineProperty(exports, \"weakMixingAngleDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesWeakMixingAngleGenerated.weakMixingAngleDependencies;\n  }\n});\nObject.defineProperty(exports, \"wienDisplacementDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesWienDisplacementGenerated.wienDisplacementDependencies;\n  }\n});\nObject.defineProperty(exports, \"xgcdDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesXgcdGenerated.xgcdDependencies;\n  }\n});\nObject.defineProperty(exports, \"xorDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesXorGenerated.xorDependencies;\n  }\n});\nObject.defineProperty(exports, \"zerosDependencies\", {\n  enumerable: true,\n  get: function get() {\n    return _dependenciesZerosGenerated.zerosDependencies;\n  }\n});\nvar _dependenciesAbsGenerated = require(\"./dependenciesAny/dependenciesAbs.generated.js\");\nvar _dependenciesAccessorNodeGenerated = require(\"./dependenciesAny/dependenciesAccessorNode.generated.js\");\nvar _dependenciesAcosGenerated = require(\"./dependenciesAny/dependenciesAcos.generated.js\");\nvar _dependenciesAcoshGenerated = require(\"./dependenciesAny/dependenciesAcosh.generated.js\");\nvar _dependenciesAcotGenerated = require(\"./dependenciesAny/dependenciesAcot.generated.js\");\nvar _dependenciesAcothGenerated = require(\"./dependenciesAny/dependenciesAcoth.generated.js\");\nvar _dependenciesAcscGenerated = require(\"./dependenciesAny/dependenciesAcsc.generated.js\");\nvar _dependenciesAcschGenerated = require(\"./dependenciesAny/dependenciesAcsch.generated.js\");\nvar _dependenciesAddGenerated = require(\"./dependenciesAny/dependenciesAdd.generated.js\");\nvar _dependenciesAddScalarGenerated = require(\"./dependenciesAny/dependenciesAddScalar.generated.js\");\nvar _dependenciesAndGenerated = require(\"./dependenciesAny/dependenciesAnd.generated.js\");\nvar _dependenciesApplyGenerated = require(\"./dependenciesAny/dependenciesApply.generated.js\");\nvar _dependenciesApplyTransformGenerated = require(\"./dependenciesAny/dependenciesApplyTransform.generated.js\");\nvar _dependenciesArgGenerated = require(\"./dependenciesAny/dependenciesArg.generated.js\");\nvar _dependenciesArrayNodeGenerated = require(\"./dependenciesAny/dependenciesArrayNode.generated.js\");\nvar _dependenciesAsecGenerated = require(\"./dependenciesAny/dependenciesAsec.generated.js\");\nvar _dependenciesAsechGenerated = require(\"./dependenciesAny/dependenciesAsech.generated.js\");\nvar _dependenciesAsinGenerated = require(\"./dependenciesAny/dependenciesAsin.generated.js\");\nvar _dependenciesAsinhGenerated = require(\"./dependenciesAny/dependenciesAsinh.generated.js\");\nvar _dependenciesAssignmentNodeGenerated = require(\"./dependenciesAny/dependenciesAssignmentNode.generated.js\");\nvar _dependenciesAtanGenerated = require(\"./dependenciesAny/dependenciesAtan.generated.js\");\nvar _dependenciesAtan2Generated = require(\"./dependenciesAny/dependenciesAtan2.generated.js\");\nvar _dependenciesAtanhGenerated = require(\"./dependenciesAny/dependenciesAtanh.generated.js\");\nvar _dependenciesAtomicMassGenerated = require(\"./dependenciesAny/dependenciesAtomicMass.generated.js\");\nvar _dependenciesAvogadroGenerated = require(\"./dependenciesAny/dependenciesAvogadro.generated.js\");\nvar _dependenciesBellNumbersGenerated = require(\"./dependenciesAny/dependenciesBellNumbers.generated.js\");\nvar _dependenciesBigNumberClassGenerated = require(\"./dependenciesAny/dependenciesBigNumberClass.generated.js\");\nvar _dependenciesBignumberGenerated = require(\"./dependenciesAny/dependenciesBignumber.generated.js\");\nvar _dependenciesBinGenerated = require(\"./dependenciesAny/dependenciesBin.generated.js\");\nvar _dependenciesBitAndGenerated = require(\"./dependenciesAny/dependenciesBitAnd.generated.js\");\nvar _dependenciesBitNotGenerated = require(\"./dependenciesAny/dependenciesBitNot.generated.js\");\nvar _dependenciesBitOrGenerated = require(\"./dependenciesAny/dependenciesBitOr.generated.js\");\nvar _dependenciesBitXorGenerated = require(\"./dependenciesAny/dependenciesBitXor.generated.js\");\nvar _dependenciesBlockNodeGenerated = require(\"./dependenciesAny/dependenciesBlockNode.generated.js\");\nvar _dependenciesBohrMagnetonGenerated = require(\"./dependenciesAny/dependenciesBohrMagneton.generated.js\");\nvar _dependenciesBohrRadiusGenerated = require(\"./dependenciesAny/dependenciesBohrRadius.generated.js\");\nvar _dependenciesBoltzmannGenerated = require(\"./dependenciesAny/dependenciesBoltzmann.generated.js\");\nvar _dependenciesBooleanGenerated = require(\"./dependenciesAny/dependenciesBoolean.generated.js\");\nvar _dependenciesCatalanGenerated = require(\"./dependenciesAny/dependenciesCatalan.generated.js\");\nvar _dependenciesCbrtGenerated = require(\"./dependenciesAny/dependenciesCbrt.generated.js\");\nvar _dependenciesCeilGenerated = require(\"./dependenciesAny/dependenciesCeil.generated.js\");\nvar _dependenciesChainGenerated = require(\"./dependenciesAny/dependenciesChain.generated.js\");\nvar _dependenciesChainClassGenerated = require(\"./dependenciesAny/dependenciesChainClass.generated.js\");\nvar _dependenciesClassicalElectronRadiusGenerated = require(\"./dependenciesAny/dependenciesClassicalElectronRadius.generated.js\");\nvar _dependenciesCloneGenerated = require(\"./dependenciesAny/dependenciesClone.generated.js\");\nvar _dependenciesColumnGenerated = require(\"./dependenciesAny/dependenciesColumn.generated.js\");\nvar _dependenciesColumnTransformGenerated = require(\"./dependenciesAny/dependenciesColumnTransform.generated.js\");\nvar _dependenciesCombinationsGenerated = require(\"./dependenciesAny/dependenciesCombinations.generated.js\");\nvar _dependenciesCombinationsWithRepGenerated = require(\"./dependenciesAny/dependenciesCombinationsWithRep.generated.js\");\nvar _dependenciesCompareGenerated = require(\"./dependenciesAny/dependenciesCompare.generated.js\");\nvar _dependenciesCompareNaturalGenerated = require(\"./dependenciesAny/dependenciesCompareNatural.generated.js\");\nvar _dependenciesCompareTextGenerated = require(\"./dependenciesAny/dependenciesCompareText.generated.js\");\nvar _dependenciesCompileGenerated = require(\"./dependenciesAny/dependenciesCompile.generated.js\");\nvar _dependenciesComplexGenerated = require(\"./dependenciesAny/dependenciesComplex.generated.js\");\nvar _dependenciesComplexClassGenerated = require(\"./dependenciesAny/dependenciesComplexClass.generated.js\");\nvar _dependenciesCompositionGenerated = require(\"./dependenciesAny/dependenciesComposition.generated.js\");\nvar _dependenciesConcatGenerated = require(\"./dependenciesAny/dependenciesConcat.generated.js\");\nvar _dependenciesConcatTransformGenerated = require(\"./dependenciesAny/dependenciesConcatTransform.generated.js\");\nvar _dependenciesConditionalNodeGenerated = require(\"./dependenciesAny/dependenciesConditionalNode.generated.js\");\nvar _dependenciesConductanceQuantumGenerated = require(\"./dependenciesAny/dependenciesConductanceQuantum.generated.js\");\nvar _dependenciesConjGenerated = require(\"./dependenciesAny/dependenciesConj.generated.js\");\nvar _dependenciesConstantNodeGenerated = require(\"./dependenciesAny/dependenciesConstantNode.generated.js\");\nvar _dependenciesCosGenerated = require(\"./dependenciesAny/dependenciesCos.generated.js\");\nvar _dependenciesCoshGenerated = require(\"./dependenciesAny/dependenciesCosh.generated.js\");\nvar _dependenciesCotGenerated = require(\"./dependenciesAny/dependenciesCot.generated.js\");\nvar _dependenciesCothGenerated = require(\"./dependenciesAny/dependenciesCoth.generated.js\");\nvar _dependenciesCoulombGenerated = require(\"./dependenciesAny/dependenciesCoulomb.generated.js\");\nvar _dependenciesCountGenerated = require(\"./dependenciesAny/dependenciesCount.generated.js\");\nvar _dependenciesCreateUnitGenerated = require(\"./dependenciesAny/dependenciesCreateUnit.generated.js\");\nvar _dependenciesCrossGenerated = require(\"./dependenciesAny/dependenciesCross.generated.js\");\nvar _dependenciesCscGenerated = require(\"./dependenciesAny/dependenciesCsc.generated.js\");\nvar _dependenciesCschGenerated = require(\"./dependenciesAny/dependenciesCsch.generated.js\");\nvar _dependenciesCtransposeGenerated = require(\"./dependenciesAny/dependenciesCtranspose.generated.js\");\nvar _dependenciesCubeGenerated = require(\"./dependenciesAny/dependenciesCube.generated.js\");\nvar _dependenciesCumSumGenerated = require(\"./dependenciesAny/dependenciesCumSum.generated.js\");\nvar _dependenciesCumSumTransformGenerated = require(\"./dependenciesAny/dependenciesCumSumTransform.generated.js\");\nvar _dependenciesDeepEqualGenerated = require(\"./dependenciesAny/dependenciesDeepEqual.generated.js\");\nvar _dependenciesDenseMatrixClassGenerated = require(\"./dependenciesAny/dependenciesDenseMatrixClass.generated.js\");\nvar _dependenciesDerivativeGenerated = require(\"./dependenciesAny/dependenciesDerivative.generated.js\");\nvar _dependenciesDetGenerated = require(\"./dependenciesAny/dependenciesDet.generated.js\");\nvar _dependenciesDeuteronMassGenerated = require(\"./dependenciesAny/dependenciesDeuteronMass.generated.js\");\nvar _dependenciesDiagGenerated = require(\"./dependenciesAny/dependenciesDiag.generated.js\");\nvar _dependenciesDiffGenerated = require(\"./dependenciesAny/dependenciesDiff.generated.js\");\nvar _dependenciesDiffTransformGenerated = require(\"./dependenciesAny/dependenciesDiffTransform.generated.js\");\nvar _dependenciesDistanceGenerated = require(\"./dependenciesAny/dependenciesDistance.generated.js\");\nvar _dependenciesDivideGenerated = require(\"./dependenciesAny/dependenciesDivide.generated.js\");\nvar _dependenciesDivideScalarGenerated = require(\"./dependenciesAny/dependenciesDivideScalar.generated.js\");\nvar _dependenciesDotGenerated = require(\"./dependenciesAny/dependenciesDot.generated.js\");\nvar _dependenciesDotDivideGenerated = require(\"./dependenciesAny/dependenciesDotDivide.generated.js\");\nvar _dependenciesDotMultiplyGenerated = require(\"./dependenciesAny/dependenciesDotMultiply.generated.js\");\nvar _dependenciesDotPowGenerated = require(\"./dependenciesAny/dependenciesDotPow.generated.js\");\nvar _dependenciesEGenerated = require(\"./dependenciesAny/dependenciesE.generated.js\");\nvar _dependenciesEfimovFactorGenerated = require(\"./dependenciesAny/dependenciesEfimovFactor.generated.js\");\nvar _dependenciesEigsGenerated = require(\"./dependenciesAny/dependenciesEigs.generated.js\");\nvar _dependenciesElectricConstantGenerated = require(\"./dependenciesAny/dependenciesElectricConstant.generated.js\");\nvar _dependenciesElectronMassGenerated = require(\"./dependenciesAny/dependenciesElectronMass.generated.js\");\nvar _dependenciesElementaryChargeGenerated = require(\"./dependenciesAny/dependenciesElementaryCharge.generated.js\");\nvar _dependenciesEqualGenerated = require(\"./dependenciesAny/dependenciesEqual.generated.js\");\nvar _dependenciesEqualScalarGenerated = require(\"./dependenciesAny/dependenciesEqualScalar.generated.js\");\nvar _dependenciesEqualTextGenerated = require(\"./dependenciesAny/dependenciesEqualText.generated.js\");\nvar _dependenciesErfGenerated = require(\"./dependenciesAny/dependenciesErf.generated.js\");\nvar _dependenciesEvaluateGenerated = require(\"./dependenciesAny/dependenciesEvaluate.generated.js\");\nvar _dependenciesExpGenerated = require(\"./dependenciesAny/dependenciesExp.generated.js\");\nvar _dependenciesExpmGenerated = require(\"./dependenciesAny/dependenciesExpm.generated.js\");\nvar _dependenciesExpm1Generated = require(\"./dependenciesAny/dependenciesExpm1.generated.js\");\nvar _dependenciesFactorialGenerated = require(\"./dependenciesAny/dependenciesFactorial.generated.js\");\nvar _dependenciesFalseGenerated = require(\"./dependenciesAny/dependenciesFalse.generated.js\");\nvar _dependenciesFaradayGenerated = require(\"./dependenciesAny/dependenciesFaraday.generated.js\");\nvar _dependenciesFermiCouplingGenerated = require(\"./dependenciesAny/dependenciesFermiCoupling.generated.js\");\nvar _dependenciesFftGenerated = require(\"./dependenciesAny/dependenciesFft.generated.js\");\nvar _dependenciesFibonacciHeapClassGenerated = require(\"./dependenciesAny/dependenciesFibonacciHeapClass.generated.js\");\nvar _dependenciesFilterGenerated = require(\"./dependenciesAny/dependenciesFilter.generated.js\");\nvar _dependenciesFilterTransformGenerated = require(\"./dependenciesAny/dependenciesFilterTransform.generated.js\");\nvar _dependenciesFineStructureGenerated = require(\"./dependenciesAny/dependenciesFineStructure.generated.js\");\nvar _dependenciesFirstRadiationGenerated = require(\"./dependenciesAny/dependenciesFirstRadiation.generated.js\");\nvar _dependenciesFixGenerated = require(\"./dependenciesAny/dependenciesFix.generated.js\");\nvar _dependenciesFlattenGenerated = require(\"./dependenciesAny/dependenciesFlatten.generated.js\");\nvar _dependenciesFloorGenerated = require(\"./dependenciesAny/dependenciesFloor.generated.js\");\nvar _dependenciesForEachGenerated = require(\"./dependenciesAny/dependenciesForEach.generated.js\");\nvar _dependenciesForEachTransformGenerated = require(\"./dependenciesAny/dependenciesForEachTransform.generated.js\");\nvar _dependenciesFormatGenerated = require(\"./dependenciesAny/dependenciesFormat.generated.js\");\nvar _dependenciesFractionGenerated = require(\"./dependenciesAny/dependenciesFraction.generated.js\");\nvar _dependenciesFractionClassGenerated = require(\"./dependenciesAny/dependenciesFractionClass.generated.js\");\nvar _dependenciesFunctionAssignmentNodeGenerated = require(\"./dependenciesAny/dependenciesFunctionAssignmentNode.generated.js\");\nvar _dependenciesFunctionNodeGenerated = require(\"./dependenciesAny/dependenciesFunctionNode.generated.js\");\nvar _dependenciesGammaGenerated = require(\"./dependenciesAny/dependenciesGamma.generated.js\");\nvar _dependenciesGasConstantGenerated = require(\"./dependenciesAny/dependenciesGasConstant.generated.js\");\nvar _dependenciesGcdGenerated = require(\"./dependenciesAny/dependenciesGcd.generated.js\");\nvar _dependenciesGetMatrixDataTypeGenerated = require(\"./dependenciesAny/dependenciesGetMatrixDataType.generated.js\");\nvar _dependenciesGravitationConstantGenerated = require(\"./dependenciesAny/dependenciesGravitationConstant.generated.js\");\nvar _dependenciesGravityGenerated = require(\"./dependenciesAny/dependenciesGravity.generated.js\");\nvar _dependenciesHartreeEnergyGenerated = require(\"./dependenciesAny/dependenciesHartreeEnergy.generated.js\");\nvar _dependenciesHasNumericValueGenerated = require(\"./dependenciesAny/dependenciesHasNumericValue.generated.js\");\nvar _dependenciesHelpGenerated = require(\"./dependenciesAny/dependenciesHelp.generated.js\");\nvar _dependenciesHelpClassGenerated = require(\"./dependenciesAny/dependenciesHelpClass.generated.js\");\nvar _dependenciesHexGenerated = require(\"./dependenciesAny/dependenciesHex.generated.js\");\nvar _dependenciesHypotGenerated = require(\"./dependenciesAny/dependenciesHypot.generated.js\");\nvar _dependenciesIGenerated = require(\"./dependenciesAny/dependenciesI.generated.js\");\nvar _dependenciesIdentityGenerated = require(\"./dependenciesAny/dependenciesIdentity.generated.js\");\nvar _dependenciesIfftGenerated = require(\"./dependenciesAny/dependenciesIfft.generated.js\");\nvar _dependenciesImGenerated = require(\"./dependenciesAny/dependenciesIm.generated.js\");\nvar _dependenciesImmutableDenseMatrixClassGenerated = require(\"./dependenciesAny/dependenciesImmutableDenseMatrixClass.generated.js\");\nvar _dependenciesIndexGenerated = require(\"./dependenciesAny/dependenciesIndex.generated.js\");\nvar _dependenciesIndexClassGenerated = require(\"./dependenciesAny/dependenciesIndexClass.generated.js\");\nvar _dependenciesIndexNodeGenerated = require(\"./dependenciesAny/dependenciesIndexNode.generated.js\");\nvar _dependenciesIndexTransformGenerated = require(\"./dependenciesAny/dependenciesIndexTransform.generated.js\");\nvar _dependenciesInfinityGenerated = require(\"./dependenciesAny/dependenciesInfinity.generated.js\");\nvar _dependenciesIntersectGenerated = require(\"./dependenciesAny/dependenciesIntersect.generated.js\");\nvar _dependenciesInvGenerated = require(\"./dependenciesAny/dependenciesInv.generated.js\");\nvar _dependenciesInverseConductanceQuantumGenerated = require(\"./dependenciesAny/dependenciesInverseConductanceQuantum.generated.js\");\nvar _dependenciesInvmodGenerated = require(\"./dependenciesAny/dependenciesInvmod.generated.js\");\nvar _dependenciesIsIntegerGenerated = require(\"./dependenciesAny/dependenciesIsInteger.generated.js\");\nvar _dependenciesIsNaNGenerated = require(\"./dependenciesAny/dependenciesIsNaN.generated.js\");\nvar _dependenciesIsNegativeGenerated = require(\"./dependenciesAny/dependenciesIsNegative.generated.js\");\nvar _dependenciesIsNumericGenerated = require(\"./dependenciesAny/dependenciesIsNumeric.generated.js\");\nvar _dependenciesIsPositiveGenerated = require(\"./dependenciesAny/dependenciesIsPositive.generated.js\");\nvar _dependenciesIsPrimeGenerated = require(\"./dependenciesAny/dependenciesIsPrime.generated.js\");\nvar _dependenciesIsZeroGenerated = require(\"./dependenciesAny/dependenciesIsZero.generated.js\");\nvar _dependenciesKldivergenceGenerated = require(\"./dependenciesAny/dependenciesKldivergence.generated.js\");\nvar _dependenciesKlitzingGenerated = require(\"./dependenciesAny/dependenciesKlitzing.generated.js\");\nvar _dependenciesKronGenerated = require(\"./dependenciesAny/dependenciesKron.generated.js\");\nvar _dependenciesLN10Generated = require(\"./dependenciesAny/dependenciesLN10.generated.js\");\nvar _dependenciesLN2Generated = require(\"./dependenciesAny/dependenciesLN2.generated.js\");\nvar _dependenciesLOG10EGenerated = require(\"./dependenciesAny/dependenciesLOG10E.generated.js\");\nvar _dependenciesLOG2EGenerated = require(\"./dependenciesAny/dependenciesLOG2E.generated.js\");\nvar _dependenciesLargerGenerated = require(\"./dependenciesAny/dependenciesLarger.generated.js\");\nvar _dependenciesLargerEqGenerated = require(\"./dependenciesAny/dependenciesLargerEq.generated.js\");\nvar _dependenciesLcmGenerated = require(\"./dependenciesAny/dependenciesLcm.generated.js\");\nvar _dependenciesLeafCountGenerated = require(\"./dependenciesAny/dependenciesLeafCount.generated.js\");\nvar _dependenciesLeftShiftGenerated = require(\"./dependenciesAny/dependenciesLeftShift.generated.js\");\nvar _dependenciesLgammaGenerated = require(\"./dependenciesAny/dependenciesLgamma.generated.js\");\nvar _dependenciesLogGenerated = require(\"./dependenciesAny/dependenciesLog.generated.js\");\nvar _dependenciesLog10Generated = require(\"./dependenciesAny/dependenciesLog10.generated.js\");\nvar _dependenciesLog1pGenerated = require(\"./dependenciesAny/dependenciesLog1p.generated.js\");\nvar _dependenciesLog2Generated = require(\"./dependenciesAny/dependenciesLog2.generated.js\");\nvar _dependenciesLoschmidtGenerated = require(\"./dependenciesAny/dependenciesLoschmidt.generated.js\");\nvar _dependenciesLsolveGenerated = require(\"./dependenciesAny/dependenciesLsolve.generated.js\");\nvar _dependenciesLsolveAllGenerated = require(\"./dependenciesAny/dependenciesLsolveAll.generated.js\");\nvar _dependenciesLupGenerated = require(\"./dependenciesAny/dependenciesLup.generated.js\");\nvar _dependenciesLusolveGenerated = require(\"./dependenciesAny/dependenciesLusolve.generated.js\");\nvar _dependenciesLyapGenerated = require(\"./dependenciesAny/dependenciesLyap.generated.js\");\nvar _dependenciesMadGenerated = require(\"./dependenciesAny/dependenciesMad.generated.js\");\nvar _dependenciesMagneticConstantGenerated = require(\"./dependenciesAny/dependenciesMagneticConstant.generated.js\");\nvar _dependenciesMagneticFluxQuantumGenerated = require(\"./dependenciesAny/dependenciesMagneticFluxQuantum.generated.js\");\nvar _dependenciesMapGenerated = require(\"./dependenciesAny/dependenciesMap.generated.js\");\nvar _dependenciesMapTransformGenerated = require(\"./dependenciesAny/dependenciesMapTransform.generated.js\");\nvar _dependenciesMatrixGenerated = require(\"./dependenciesAny/dependenciesMatrix.generated.js\");\nvar _dependenciesMatrixClassGenerated = require(\"./dependenciesAny/dependenciesMatrixClass.generated.js\");\nvar _dependenciesMatrixFromColumnsGenerated = require(\"./dependenciesAny/dependenciesMatrixFromColumns.generated.js\");\nvar _dependenciesMatrixFromFunctionGenerated = require(\"./dependenciesAny/dependenciesMatrixFromFunction.generated.js\");\nvar _dependenciesMatrixFromRowsGenerated = require(\"./dependenciesAny/dependenciesMatrixFromRows.generated.js\");\nvar _dependenciesMaxGenerated = require(\"./dependenciesAny/dependenciesMax.generated.js\");\nvar _dependenciesMaxTransformGenerated = require(\"./dependenciesAny/dependenciesMaxTransform.generated.js\");\nvar _dependenciesMeanGenerated = require(\"./dependenciesAny/dependenciesMean.generated.js\");\nvar _dependenciesMeanTransformGenerated = require(\"./dependenciesAny/dependenciesMeanTransform.generated.js\");\nvar _dependenciesMedianGenerated = require(\"./dependenciesAny/dependenciesMedian.generated.js\");\nvar _dependenciesMinGenerated = require(\"./dependenciesAny/dependenciesMin.generated.js\");\nvar _dependenciesMinTransformGenerated = require(\"./dependenciesAny/dependenciesMinTransform.generated.js\");\nvar _dependenciesModGenerated = require(\"./dependenciesAny/dependenciesMod.generated.js\");\nvar _dependenciesModeGenerated = require(\"./dependenciesAny/dependenciesMode.generated.js\");\nvar _dependenciesMolarMassGenerated = require(\"./dependenciesAny/dependenciesMolarMass.generated.js\");\nvar _dependenciesMolarMassC12Generated = require(\"./dependenciesAny/dependenciesMolarMassC12.generated.js\");\nvar _dependenciesMolarPlanckConstantGenerated = require(\"./dependenciesAny/dependenciesMolarPlanckConstant.generated.js\");\nvar _dependenciesMolarVolumeGenerated = require(\"./dependenciesAny/dependenciesMolarVolume.generated.js\");\nvar _dependenciesMultinomialGenerated = require(\"./dependenciesAny/dependenciesMultinomial.generated.js\");\nvar _dependenciesMultiplyGenerated = require(\"./dependenciesAny/dependenciesMultiply.generated.js\");\nvar _dependenciesMultiplyScalarGenerated = require(\"./dependenciesAny/dependenciesMultiplyScalar.generated.js\");\nvar _dependenciesNaNGenerated = require(\"./dependenciesAny/dependenciesNaN.generated.js\");\nvar _dependenciesNeutronMassGenerated = require(\"./dependenciesAny/dependenciesNeutronMass.generated.js\");\nvar _dependenciesNodeGenerated = require(\"./dependenciesAny/dependenciesNode.generated.js\");\nvar _dependenciesNormGenerated = require(\"./dependenciesAny/dependenciesNorm.generated.js\");\nvar _dependenciesNotGenerated = require(\"./dependenciesAny/dependenciesNot.generated.js\");\nvar _dependenciesNthRootGenerated = require(\"./dependenciesAny/dependenciesNthRoot.generated.js\");\nvar _dependenciesNthRootsGenerated = require(\"./dependenciesAny/dependenciesNthRoots.generated.js\");\nvar _dependenciesNuclearMagnetonGenerated = require(\"./dependenciesAny/dependenciesNuclearMagneton.generated.js\");\nvar _dependenciesNullGenerated = require(\"./dependenciesAny/dependenciesNull.generated.js\");\nvar _dependenciesNumberGenerated = require(\"./dependenciesAny/dependenciesNumber.generated.js\");\nvar _dependenciesNumericGenerated = require(\"./dependenciesAny/dependenciesNumeric.generated.js\");\nvar _dependenciesObjectNodeGenerated = require(\"./dependenciesAny/dependenciesObjectNode.generated.js\");\nvar _dependenciesOctGenerated = require(\"./dependenciesAny/dependenciesOct.generated.js\");\nvar _dependenciesOnesGenerated = require(\"./dependenciesAny/dependenciesOnes.generated.js\");\nvar _dependenciesOperatorNodeGenerated = require(\"./dependenciesAny/dependenciesOperatorNode.generated.js\");\nvar _dependenciesOrGenerated = require(\"./dependenciesAny/dependenciesOr.generated.js\");\nvar _dependenciesParenthesisNodeGenerated = require(\"./dependenciesAny/dependenciesParenthesisNode.generated.js\");\nvar _dependenciesParseGenerated = require(\"./dependenciesAny/dependenciesParse.generated.js\");\nvar _dependenciesParserGenerated = require(\"./dependenciesAny/dependenciesParser.generated.js\");\nvar _dependenciesParserClassGenerated = require(\"./dependenciesAny/dependenciesParserClass.generated.js\");\nvar _dependenciesPartitionSelectGenerated = require(\"./dependenciesAny/dependenciesPartitionSelect.generated.js\");\nvar _dependenciesPermutationsGenerated = require(\"./dependenciesAny/dependenciesPermutations.generated.js\");\nvar _dependenciesPhiGenerated = require(\"./dependenciesAny/dependenciesPhi.generated.js\");\nvar _dependenciesPiGenerated = require(\"./dependenciesAny/dependenciesPi.generated.js\");\nvar _dependenciesPickRandomGenerated = require(\"./dependenciesAny/dependenciesPickRandom.generated.js\");\nvar _dependenciesPinvGenerated = require(\"./dependenciesAny/dependenciesPinv.generated.js\");\nvar _dependenciesPlanckChargeGenerated = require(\"./dependenciesAny/dependenciesPlanckCharge.generated.js\");\nvar _dependenciesPlanckConstantGenerated = require(\"./dependenciesAny/dependenciesPlanckConstant.generated.js\");\nvar _dependenciesPlanckLengthGenerated = require(\"./dependenciesAny/dependenciesPlanckLength.generated.js\");\nvar _dependenciesPlanckMassGenerated = require(\"./dependenciesAny/dependenciesPlanckMass.generated.js\");\nvar _dependenciesPlanckTemperatureGenerated = require(\"./dependenciesAny/dependenciesPlanckTemperature.generated.js\");\nvar _dependenciesPlanckTimeGenerated = require(\"./dependenciesAny/dependenciesPlanckTime.generated.js\");\nvar _dependenciesPolynomialRootGenerated = require(\"./dependenciesAny/dependenciesPolynomialRoot.generated.js\");\nvar _dependenciesPowGenerated = require(\"./dependenciesAny/dependenciesPow.generated.js\");\nvar _dependenciesPrintGenerated = require(\"./dependenciesAny/dependenciesPrint.generated.js\");\nvar _dependenciesProdGenerated = require(\"./dependenciesAny/dependenciesProd.generated.js\");\nvar _dependenciesProtonMassGenerated = require(\"./dependenciesAny/dependenciesProtonMass.generated.js\");\nvar _dependenciesQrGenerated = require(\"./dependenciesAny/dependenciesQr.generated.js\");\nvar _dependenciesQuantileSeqGenerated = require(\"./dependenciesAny/dependenciesQuantileSeq.generated.js\");\nvar _dependenciesQuantumOfCirculationGenerated = require(\"./dependenciesAny/dependenciesQuantumOfCirculation.generated.js\");\nvar _dependenciesRandomGenerated = require(\"./dependenciesAny/dependenciesRandom.generated.js\");\nvar _dependenciesRandomIntGenerated = require(\"./dependenciesAny/dependenciesRandomInt.generated.js\");\nvar _dependenciesRangeGenerated = require(\"./dependenciesAny/dependenciesRange.generated.js\");\nvar _dependenciesRangeClassGenerated = require(\"./dependenciesAny/dependenciesRangeClass.generated.js\");\nvar _dependenciesRangeNodeGenerated = require(\"./dependenciesAny/dependenciesRangeNode.generated.js\");\nvar _dependenciesRangeTransformGenerated = require(\"./dependenciesAny/dependenciesRangeTransform.generated.js\");\nvar _dependenciesRationalizeGenerated = require(\"./dependenciesAny/dependenciesRationalize.generated.js\");\nvar _dependenciesReGenerated = require(\"./dependenciesAny/dependenciesRe.generated.js\");\nvar _dependenciesReducedPlanckConstantGenerated = require(\"./dependenciesAny/dependenciesReducedPlanckConstant.generated.js\");\nvar _dependenciesRelationalNodeGenerated = require(\"./dependenciesAny/dependenciesRelationalNode.generated.js\");\nvar _dependenciesReplacerGenerated = require(\"./dependenciesAny/dependenciesReplacer.generated.js\");\nvar _dependenciesReshapeGenerated = require(\"./dependenciesAny/dependenciesReshape.generated.js\");\nvar _dependenciesResizeGenerated = require(\"./dependenciesAny/dependenciesResize.generated.js\");\nvar _dependenciesResolveGenerated = require(\"./dependenciesAny/dependenciesResolve.generated.js\");\nvar _dependenciesResultSetGenerated = require(\"./dependenciesAny/dependenciesResultSet.generated.js\");\nvar _dependenciesReviverGenerated = require(\"./dependenciesAny/dependenciesReviver.generated.js\");\nvar _dependenciesRightArithShiftGenerated = require(\"./dependenciesAny/dependenciesRightArithShift.generated.js\");\nvar _dependenciesRightLogShiftGenerated = require(\"./dependenciesAny/dependenciesRightLogShift.generated.js\");\nvar _dependenciesRotateGenerated = require(\"./dependenciesAny/dependenciesRotate.generated.js\");\nvar _dependenciesRotationMatrixGenerated = require(\"./dependenciesAny/dependenciesRotationMatrix.generated.js\");\nvar _dependenciesRoundGenerated = require(\"./dependenciesAny/dependenciesRound.generated.js\");\nvar _dependenciesRowGenerated = require(\"./dependenciesAny/dependenciesRow.generated.js\");\nvar _dependenciesRowTransformGenerated = require(\"./dependenciesAny/dependenciesRowTransform.generated.js\");\nvar _dependenciesRydbergGenerated = require(\"./dependenciesAny/dependenciesRydberg.generated.js\");\nvar _dependenciesSQRT1_2Generated = require(\"./dependenciesAny/dependenciesSQRT1_2.generated.js\");\nvar _dependenciesSQRT2Generated = require(\"./dependenciesAny/dependenciesSQRT2.generated.js\");\nvar _dependenciesSackurTetrodeGenerated = require(\"./dependenciesAny/dependenciesSackurTetrode.generated.js\");\nvar _dependenciesSchurGenerated = require(\"./dependenciesAny/dependenciesSchur.generated.js\");\nvar _dependenciesSecGenerated = require(\"./dependenciesAny/dependenciesSec.generated.js\");\nvar _dependenciesSechGenerated = require(\"./dependenciesAny/dependenciesSech.generated.js\");\nvar _dependenciesSecondRadiationGenerated = require(\"./dependenciesAny/dependenciesSecondRadiation.generated.js\");\nvar _dependenciesSetCartesianGenerated = require(\"./dependenciesAny/dependenciesSetCartesian.generated.js\");\nvar _dependenciesSetDifferenceGenerated = require(\"./dependenciesAny/dependenciesSetDifference.generated.js\");\nvar _dependenciesSetDistinctGenerated = require(\"./dependenciesAny/dependenciesSetDistinct.generated.js\");\nvar _dependenciesSetIntersectGenerated = require(\"./dependenciesAny/dependenciesSetIntersect.generated.js\");\nvar _dependenciesSetIsSubsetGenerated = require(\"./dependenciesAny/dependenciesSetIsSubset.generated.js\");\nvar _dependenciesSetMultiplicityGenerated = require(\"./dependenciesAny/dependenciesSetMultiplicity.generated.js\");\nvar _dependenciesSetPowersetGenerated = require(\"./dependenciesAny/dependenciesSetPowerset.generated.js\");\nvar _dependenciesSetSizeGenerated = require(\"./dependenciesAny/dependenciesSetSize.generated.js\");\nvar _dependenciesSetSymDifferenceGenerated = require(\"./dependenciesAny/dependenciesSetSymDifference.generated.js\");\nvar _dependenciesSetUnionGenerated = require(\"./dependenciesAny/dependenciesSetUnion.generated.js\");\nvar _dependenciesSignGenerated = require(\"./dependenciesAny/dependenciesSign.generated.js\");\nvar _dependenciesSimplifyGenerated = require(\"./dependenciesAny/dependenciesSimplify.generated.js\");\nvar _dependenciesSimplifyConstantGenerated = require(\"./dependenciesAny/dependenciesSimplifyConstant.generated.js\");\nvar _dependenciesSimplifyCoreGenerated = require(\"./dependenciesAny/dependenciesSimplifyCore.generated.js\");\nvar _dependenciesSinGenerated = require(\"./dependenciesAny/dependenciesSin.generated.js\");\nvar _dependenciesSinhGenerated = require(\"./dependenciesAny/dependenciesSinh.generated.js\");\nvar _dependenciesSizeGenerated = require(\"./dependenciesAny/dependenciesSize.generated.js\");\nvar _dependenciesSluGenerated = require(\"./dependenciesAny/dependenciesSlu.generated.js\");\nvar _dependenciesSmallerGenerated = require(\"./dependenciesAny/dependenciesSmaller.generated.js\");\nvar _dependenciesSmallerEqGenerated = require(\"./dependenciesAny/dependenciesSmallerEq.generated.js\");\nvar _dependenciesSortGenerated = require(\"./dependenciesAny/dependenciesSort.generated.js\");\nvar _dependenciesSpaClassGenerated = require(\"./dependenciesAny/dependenciesSpaClass.generated.js\");\nvar _dependenciesSparseGenerated = require(\"./dependenciesAny/dependenciesSparse.generated.js\");\nvar _dependenciesSparseMatrixClassGenerated = require(\"./dependenciesAny/dependenciesSparseMatrixClass.generated.js\");\nvar _dependenciesSpeedOfLightGenerated = require(\"./dependenciesAny/dependenciesSpeedOfLight.generated.js\");\nvar _dependenciesSplitUnitGenerated = require(\"./dependenciesAny/dependenciesSplitUnit.generated.js\");\nvar _dependenciesSqrtGenerated = require(\"./dependenciesAny/dependenciesSqrt.generated.js\");\nvar _dependenciesSqrtmGenerated = require(\"./dependenciesAny/dependenciesSqrtm.generated.js\");\nvar _dependenciesSquareGenerated = require(\"./dependenciesAny/dependenciesSquare.generated.js\");\nvar _dependenciesSqueezeGenerated = require(\"./dependenciesAny/dependenciesSqueeze.generated.js\");\nvar _dependenciesStdGenerated = require(\"./dependenciesAny/dependenciesStd.generated.js\");\nvar _dependenciesStdTransformGenerated = require(\"./dependenciesAny/dependenciesStdTransform.generated.js\");\nvar _dependenciesStefanBoltzmannGenerated = require(\"./dependenciesAny/dependenciesStefanBoltzmann.generated.js\");\nvar _dependenciesStirlingS2Generated = require(\"./dependenciesAny/dependenciesStirlingS2.generated.js\");\nvar _dependenciesStringGenerated = require(\"./dependenciesAny/dependenciesString.generated.js\");\nvar _dependenciesSubsetGenerated = require(\"./dependenciesAny/dependenciesSubset.generated.js\");\nvar _dependenciesSubsetTransformGenerated = require(\"./dependenciesAny/dependenciesSubsetTransform.generated.js\");\nvar _dependenciesSubtractGenerated = require(\"./dependenciesAny/dependenciesSubtract.generated.js\");\nvar _dependenciesSumGenerated = require(\"./dependenciesAny/dependenciesSum.generated.js\");\nvar _dependenciesSumTransformGenerated = require(\"./dependenciesAny/dependenciesSumTransform.generated.js\");\nvar _dependenciesSylvesterGenerated = require(\"./dependenciesAny/dependenciesSylvester.generated.js\");\nvar _dependenciesSymbolNodeGenerated = require(\"./dependenciesAny/dependenciesSymbolNode.generated.js\");\nvar _dependenciesSymbolicEqualGenerated = require(\"./dependenciesAny/dependenciesSymbolicEqual.generated.js\");\nvar _dependenciesTanGenerated = require(\"./dependenciesAny/dependenciesTan.generated.js\");\nvar _dependenciesTanhGenerated = require(\"./dependenciesAny/dependenciesTanh.generated.js\");\nvar _dependenciesTauGenerated = require(\"./dependenciesAny/dependenciesTau.generated.js\");\nvar _dependenciesThomsonCrossSectionGenerated = require(\"./dependenciesAny/dependenciesThomsonCrossSection.generated.js\");\nvar _dependenciesToGenerated = require(\"./dependenciesAny/dependenciesTo.generated.js\");\nvar _dependenciesTraceGenerated = require(\"./dependenciesAny/dependenciesTrace.generated.js\");\nvar _dependenciesTransposeGenerated = require(\"./dependenciesAny/dependenciesTranspose.generated.js\");\nvar _dependenciesTrueGenerated = require(\"./dependenciesAny/dependenciesTrue.generated.js\");\nvar _dependenciesTypeOfGenerated = require(\"./dependenciesAny/dependenciesTypeOf.generated.js\");\nvar _dependenciesTypedGenerated = require(\"./dependenciesAny/dependenciesTyped.generated.js\");\nvar _dependenciesUnaryMinusGenerated = require(\"./dependenciesAny/dependenciesUnaryMinus.generated.js\");\nvar _dependenciesUnaryPlusGenerated = require(\"./dependenciesAny/dependenciesUnaryPlus.generated.js\");\nvar _dependenciesUnequalGenerated = require(\"./dependenciesAny/dependenciesUnequal.generated.js\");\nvar _dependenciesUnitClassGenerated = require(\"./dependenciesAny/dependenciesUnitClass.generated.js\");\nvar _dependenciesUnitFunctionGenerated = require(\"./dependenciesAny/dependenciesUnitFunction.generated.js\");\nvar _dependenciesUppercaseEGenerated = require(\"./dependenciesAny/dependenciesUppercaseE.generated.js\");\nvar _dependenciesUppercasePiGenerated = require(\"./dependenciesAny/dependenciesUppercasePi.generated.js\");\nvar _dependenciesUsolveGenerated = require(\"./dependenciesAny/dependenciesUsolve.generated.js\");\nvar _dependenciesUsolveAllGenerated = require(\"./dependenciesAny/dependenciesUsolveAll.generated.js\");\nvar _dependenciesVacuumImpedanceGenerated = require(\"./dependenciesAny/dependenciesVacuumImpedance.generated.js\");\nvar _dependenciesVarianceGenerated = require(\"./dependenciesAny/dependenciesVariance.generated.js\");\nvar _dependenciesVarianceTransformGenerated = require(\"./dependenciesAny/dependenciesVarianceTransform.generated.js\");\nvar _dependenciesVersionGenerated = require(\"./dependenciesAny/dependenciesVersion.generated.js\");\nvar _dependenciesWeakMixingAngleGenerated = require(\"./dependenciesAny/dependenciesWeakMixingAngle.generated.js\");\nvar _dependenciesWienDisplacementGenerated = require(\"./dependenciesAny/dependenciesWienDisplacement.generated.js\");\nvar _dependenciesXgcdGenerated = require(\"./dependenciesAny/dependenciesXgcd.generated.js\");\nvar _dependenciesXorGenerated = require(\"./dependenciesAny/dependenciesXor.generated.js\");\nvar _dependenciesZerosGenerated = require(\"./dependenciesAny/dependenciesZeros.generated.js\");\nvar _allFactoriesAny = require(\"./allFactoriesAny.js\");","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.mixin = mixin;\nvar _tinyEmitter = _interopRequireDefault(require(\"tiny-emitter\"));\n/**\n * Extend given object with emitter functions `on`, `off`, `once`, `emit`\n * @param {Object} obj\n * @return {Object} obj\n */\nfunction mixin(obj) {\n  // create event emitter\n  var emitter = new _tinyEmitter[\"default\"]();\n\n  // bind methods to obj (we don't want to expose the emitter.e Array...)\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\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.importFactory = importFactory;\nvar _defineProperty2 = _interopRequireDefault(require(\"@babel/runtime/helpers/defineProperty\"));\nvar _typeof2 = _interopRequireDefault(require(\"@babel/runtime/helpers/typeof\"));\nvar _is = require(\"../../utils/is.js\");\nvar _factory = require(\"../../utils/factory.js\");\nvar _object = require(\"../../utils/object.js\");\nvar _array = require(\"../../utils/array.js\");\nvar _ArgumentsError = require(\"../../error/ArgumentsError.js\");\nfunction importFactory(typed, load, math, importedFactories) {\n  /**\n   * Import functions from an object or a module.\n   *\n   * This function is only available on a mathjs instance created using `create`.\n   *\n   * Syntax:\n   *\n   *    math.import(functions)\n   *    math.import(functions, options)\n   *\n   * Where:\n   *\n   * - `functions: Object`\n   *   An object with functions or factories 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   *    import { create, all } from 'mathjs'\n   *    import * as numbers from 'numbers'\n   *\n   *    // create a mathjs instance\n   *    const math = create(all)\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(numbers, {wrap: true})\n   *\n   *    math.fibonacci(7) // returns 13\n   *\n   * @param {Object | Array} functions  Object with functions to be imported.\n   * @param {Object} [options]          Import options.\n   */\n  function mathImport(functions, options) {\n    var num = arguments.length;\n    if (num !== 1 && num !== 2) {\n      throw new _ArgumentsError.ArgumentsError('import', num, 1, 2);\n    }\n    if (!options) {\n      options = {};\n    }\n    function flattenImports(flatValues, value, name) {\n      if (Array.isArray(value)) {\n        value.forEach(function (item) {\n          return flattenImports(flatValues, item);\n        });\n      } else if ((0, _typeof2[\"default\"])(value) === 'object') {\n        for (var _name in value) {\n          if ((0, _object.hasOwnProperty)(value, _name)) {\n            flattenImports(flatValues, value[_name], _name);\n          }\n        }\n      } else if ((0, _factory.isFactory)(value) || name !== undefined) {\n        var flatName = (0, _factory.isFactory)(value) ? isTransformFunctionFactory(value) ? value.fn + '.transform' // TODO: this is ugly\n        : value.fn : name;\n\n        // we allow importing the same function twice if it points to the same implementation\n        if ((0, _object.hasOwnProperty)(flatValues, flatName) && flatValues[flatName] !== value && !options.silent) {\n          throw new Error('Cannot import \"' + flatName + '\" twice');\n        }\n        flatValues[flatName] = value;\n      } else {\n        if (!options.silent) {\n          throw new TypeError('Factory, Object, or Array expected');\n        }\n      }\n    }\n    var flatValues = {};\n    flattenImports(flatValues, functions);\n    for (var name in flatValues) {\n      if ((0, _object.hasOwnProperty)(flatValues, name)) {\n        // console.log('import', name)\n        var value = flatValues[name];\n        if ((0, _factory.isFactory)(value)) {\n          // we ignore name here and enforce the name of the factory\n          // maybe at some point we do want to allow overriding it\n          // in that case we can implement an option overrideFactoryNames: true\n          _importFactory(value, options);\n        } else if (isSupportedType(value)) {\n          _import(name, value, options);\n        } else {\n          if (!options.silent) {\n            throw new TypeError('Factory, Object, or Array expected');\n          }\n        }\n      }\n    }\n  }\n\n  /**\n   * Add a property to the math namespace\n   * @param {string} name\n   * @param {*} value\n   * @param {Object} options  See import for a description of the options\n   * @private\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    // turn a plain function with a typed-function signature into a typed-function\n    if (hasTypedFunctionSignature(value)) {\n      value = typed(name, (0, _defineProperty2[\"default\"])({}, value.signature, value));\n    }\n    if (typed.isTypedFunction(math[name]) && typed.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      math[name] = value;\n      delete importedFactories[name];\n      _importTransform(name, value);\n      math.emit('import', name, function resolver() {\n        return value;\n      });\n      return;\n    }\n    if (math[name] === undefined || options.override) {\n      math[name] = value;\n      delete importedFactories[name];\n      _importTransform(name, value);\n      math.emit('import', name, function resolver() {\n        return value;\n      });\n      return;\n    }\n    if (!options.silent) {\n      throw new Error('Cannot import \"' + name + '\": already exists');\n    }\n  }\n  function _importTransform(name, value) {\n    if (value && typeof value.transform === 'function') {\n      math.expression.transform[name] = value.transform;\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      if (allowedInExpressions(name)) {\n        math.expression.mathWithTransform[name] = value;\n      }\n    }\n  }\n  function _deleteTransform(name) {\n    delete math.expression.transform[name];\n    if (allowedInExpressions(name)) {\n      math.expression.mathWithTransform[name] = math[name];\n    } else {\n      delete math.expression.mathWithTransform[name];\n    }\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  function _wrap(fn) {\n    var wrapper = function wrapper() {\n      var args = [];\n      for (var i = 0, len = arguments.length; i < len; i++) {\n        var arg = arguments[i];\n        args[i] = arg && arg.valueOf();\n      }\n      return fn.apply(math, args);\n    };\n    if (fn.transform) {\n      wrapper.transform = fn.transform;\n    }\n    return wrapper;\n  }\n\n  /**\n   * Import an instance of a factory into math.js\n   * @param {function(scope: object)} factory\n   * @param {Object} options  See import for a description of the options\n   * @param {string} [name=factory.name] Optional custom name\n   * @private\n   */\n  function _importFactory(factory, options) {\n    var name = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : factory.fn;\n    if ((0, _array.contains)(name, '.')) {\n      throw new Error('Factory name should not contain a nested path. ' + 'Name: ' + JSON.stringify(name));\n    }\n    var namespace = isTransformFunctionFactory(factory) ? math.expression.transform : math;\n    var existingTransform = (name in math.expression.transform);\n    var existing = (0, _object.hasOwnProperty)(namespace, name) ? namespace[name] : undefined;\n    var resolver = function resolver() {\n      // collect all dependencies, handle finding both functions and classes and other special cases\n      var dependencies = {};\n      factory.dependencies.map(_factory.stripOptionalNotation).forEach(function (dependency) {\n        if ((0, _array.contains)(dependency, '.')) {\n          throw new Error('Factory dependency should not contain a nested path. ' + 'Name: ' + JSON.stringify(dependency));\n        }\n        if (dependency === 'math') {\n          dependencies.math = math;\n        } else if (dependency === 'mathWithTransform') {\n          dependencies.mathWithTransform = math.expression.mathWithTransform;\n        } else if (dependency === 'classes') {\n          // special case for json reviver\n          dependencies.classes = math;\n        } else {\n          dependencies[dependency] = math[dependency];\n        }\n      });\n      var instance = /* #__PURE__ */factory(dependencies);\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      if (existing === undefined || options.override) {\n        return instance;\n      }\n      if (typed.isTypedFunction(existing) && typed.isTypedFunction(instance)) {\n        // merge the existing and new typed function\n        return typed(existing, instance);\n      }\n      if (options.silent) {\n        // keep existing, ignore imported function\n        return existing;\n      } else {\n        throw new Error('Cannot import \"' + name + '\": already exists');\n      }\n    };\n\n    // TODO: add unit test with non-lazy factory\n    if (!factory.meta || factory.meta.lazy !== false) {\n      (0, _object.lazy)(namespace, name, resolver);\n\n      // FIXME: remove the `if (existing &&` condition again. Can we make sure subset is loaded before subset.transform? (Name collision, and no dependencies between the two)\n      if (existing && existingTransform) {\n        _deleteTransform(name);\n      } else {\n        if (isTransformFunctionFactory(factory) || factoryAllowedInExpressions(factory)) {\n          (0, _object.lazy)(math.expression.mathWithTransform, name, function () {\n            return namespace[name];\n          });\n        }\n      }\n    } else {\n      namespace[name] = resolver();\n\n      // FIXME: remove the `if (existing &&` condition again. Can we make sure subset is loaded before subset.transform? (Name collision, and no dependencies between the two)\n      if (existing && existingTransform) {\n        _deleteTransform(name);\n      } else {\n        if (isTransformFunctionFactory(factory) || factoryAllowedInExpressions(factory)) {\n          (0, _object.lazy)(math.expression.mathWithTransform, name, function () {\n            return namespace[name];\n          });\n        }\n      }\n    }\n\n    // TODO: improve factories, store a list with imports instead which can be re-played\n    importedFactories[name] = factory;\n    math.emit('import', name, resolver);\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  function isSupportedType(object) {\n    return typeof object === 'function' || typeof object === 'number' || typeof object === 'string' || typeof object === 'boolean' || object === null || (0, _is.isUnit)(object) || (0, _is.isComplex)(object) || (0, _is.isBigNumber)(object) || (0, _is.isFraction)(object) || (0, _is.isMatrix)(object) || Array.isArray(object);\n  }\n  function hasTypedFunctionSignature(fn) {\n    return typeof fn === 'function' && typeof fn.signature === 'string';\n  }\n  function allowedInExpressions(name) {\n    return !(0, _object.hasOwnProperty)(unsafe, name);\n  }\n  function factoryAllowedInExpressions(factory) {\n    return factory.fn.indexOf('.') === -1 &&\n    // FIXME: make checking on path redundant, check on meta data instead\n    !(0, _object.hasOwnProperty)(unsafe, factory.fn) && (!factory.meta || !factory.meta.isClass);\n  }\n  function isTransformFunctionFactory(factory) {\n    return factory !== undefined && factory.meta !== undefined && factory.meta.isTransformFunction === true || false;\n  }\n\n  // namespaces and functions not available in the parser for safety reasons\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}","\"use strict\";\n\nvar _interopRequireDefault = require(\"@babel/runtime/helpers/interopRequireDefault\");\nvar _typeof = require(\"@babel/runtime/helpers/typeof\");\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.create = create;\nvar _extends2 = _interopRequireDefault(require(\"@babel/runtime/helpers/extends\"));\nvar _typedFunction = _interopRequireDefault(require(\"typed-function\"));\nvar _object = require(\"../utils/object.js\");\nvar emitter = _interopRequireWildcard(require(\"./../utils/emitter.js\"));\nvar _import = require(\"./function/import.js\");\nvar _config = require(\"./function/config.js\");\nvar _factory = require(\"../utils/factory.js\");\nvar _is = require(\"../utils/is.js\");\nvar _ArgumentsError = require(\"../error/ArgumentsError.js\");\nvar _DimensionError = require(\"../error/DimensionError.js\");\nvar _IndexError = require(\"../error/IndexError.js\");\nvar _config2 = require(\"./config.js\");\nfunction _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== \"function\") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }\nfunction _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || _typeof(obj) !== \"object\" && typeof obj !== \"function\") { return { \"default\": obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== \"default\" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj[\"default\"] = obj; if (cache) { cache.set(obj, newObj); } return newObj; }\n/**\n * Create a mathjs instance from given factory functions and optionally config\n *\n * Usage:\n *\n *     const mathjs1 = create({ createAdd, createMultiply, ...})\n *     const config = { number: 'BigNumber' }\n *     const mathjs2 = create(all, config)\n *\n * @param {Object} [factories] An object with factory functions\n *                             The object can contain nested objects,\n *                             all nested objects will be flattened.\n * @param {Object} [config]    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 */\nfunction create(factories, config) {\n  var configInternal = (0, _extends2[\"default\"])({}, _config2.DEFAULT_CONFIG, config);\n\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  }\n\n  // create the mathjs instance\n  var math = emitter.mixin({\n    // only here for backward compatibility for legacy factory functions\n    isNumber: _is.isNumber,\n    isComplex: _is.isComplex,\n    isBigNumber: _is.isBigNumber,\n    isFraction: _is.isFraction,\n    isUnit: _is.isUnit,\n    isString: _is.isString,\n    isArray: _is.isArray,\n    isMatrix: _is.isMatrix,\n    isCollection: _is.isCollection,\n    isDenseMatrix: _is.isDenseMatrix,\n    isSparseMatrix: _is.isSparseMatrix,\n    isRange: _is.isRange,\n    isIndex: _is.isIndex,\n    isBoolean: _is.isBoolean,\n    isResultSet: _is.isResultSet,\n    isHelp: _is.isHelp,\n    isFunction: _is.isFunction,\n    isDate: _is.isDate,\n    isRegExp: _is.isRegExp,\n    isObject: _is.isObject,\n    isNull: _is.isNull,\n    isUndefined: _is.isUndefined,\n    isAccessorNode: _is.isAccessorNode,\n    isArrayNode: _is.isArrayNode,\n    isAssignmentNode: _is.isAssignmentNode,\n    isBlockNode: _is.isBlockNode,\n    isConditionalNode: _is.isConditionalNode,\n    isConstantNode: _is.isConstantNode,\n    isFunctionAssignmentNode: _is.isFunctionAssignmentNode,\n    isFunctionNode: _is.isFunctionNode,\n    isIndexNode: _is.isIndexNode,\n    isNode: _is.isNode,\n    isObjectNode: _is.isObjectNode,\n    isOperatorNode: _is.isOperatorNode,\n    isParenthesisNode: _is.isParenthesisNode,\n    isRangeNode: _is.isRangeNode,\n    isRelationalNode: _is.isRelationalNode,\n    isSymbolNode: _is.isSymbolNode,\n    isChain: _is.isChain\n  });\n\n  // load config function and apply provided config\n  math.config = (0, _config.configFactory)(configInternal, math.emit);\n  math.expression = {\n    transform: {},\n    mathWithTransform: {\n      config: math.config\n    }\n  };\n\n  // cached factories and instances used by function load\n  var legacyFactories = [];\n  var legacyInstances = [];\n\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 {Function} factory\n   * @returns {*}\n   */\n  function load(factory) {\n    if ((0, _factory.isFactory)(factory)) {\n      return factory(math);\n    }\n    var firstProperty = factory[Object.keys(factory)[0]];\n    if ((0, _factory.isFactory)(firstProperty)) {\n      return firstProperty(math);\n    }\n    if (!(0, _object.isLegacyFactory)(factory)) {\n      console.warn('Factory object with properties `type`, `name`, and `factory` expected', factory);\n      throw new Error('Factory object with properties `type`, `name`, and `factory` expected');\n    }\n    var index = legacyFactories.indexOf(factory);\n    var instance;\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, configInternal, load, math.typed, math);\n      } else {\n        instance = factory.factory(math.type, configInternal, load, math.typed);\n      }\n\n      // append to the cache\n      legacyFactories.push(factory);\n      legacyInstances.push(instance);\n    } else {\n      // already existing function, return the cached instance\n      instance = legacyInstances[index];\n    }\n    return instance;\n  }\n  var importedFactories = {};\n\n  // load the import function\n  function lazyTyped() {\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n    return math.typed.apply(math.typed, args);\n  }\n  lazyTyped.isTypedFunction = _typedFunction[\"default\"].isTypedFunction;\n  var internalImport = (0, _import.importFactory)(lazyTyped, load, math, importedFactories);\n  math[\"import\"] = internalImport;\n\n  // listen for changes in config, import all functions again when changed\n  // TODO: move this listener into the import function?\n  math.on('config', function () {\n    (0, _object.values)(importedFactories).forEach(function (factory) {\n      if (factory && factory.meta && factory.meta.recreateOnConfigChange) {\n        // FIXME: only re-create when the current instance is the same as was initially created\n        // FIXME: delete the functions/constants before importing them again?\n        internalImport(factory, {\n          override: true\n        });\n      }\n    });\n  });\n\n  // the create function exposed on the mathjs instance is bound to\n  // the factory functions passed before\n  math.create = create.bind(null, factories);\n\n  // export factory function\n  math.factory = _factory.factory;\n\n  // import the factory functions like createAdd as an array instead of object,\n  // else they will get a different naming (`createAdd` instead of `add`).\n  math[\"import\"]((0, _object.values)((0, _object.deepFlatten)(factories)));\n  math.ArgumentsError = _ArgumentsError.ArgumentsError;\n  math.DimensionError = _DimensionError.DimensionError;\n  math.IndexError = _IndexError.IndexError;\n  return math;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nvar _exportNames = {\n  config: true,\n  IndexError: true,\n  DimensionError: true,\n  ArgumentsError: true,\n  create: true,\n  factory: true\n};\nObject.defineProperty(exports, \"ArgumentsError\", {\n  enumerable: true,\n  get: function get() {\n    return _ArgumentsError.ArgumentsError;\n  }\n});\nObject.defineProperty(exports, \"DimensionError\", {\n  enumerable: true,\n  get: function get() {\n    return _DimensionError.DimensionError;\n  }\n});\nObject.defineProperty(exports, \"IndexError\", {\n  enumerable: true,\n  get: function get() {\n    return _IndexError.IndexError;\n  }\n});\nObject.defineProperty(exports, \"config\", {\n  enumerable: true,\n  get: function get() {\n    return _configReadonly.config;\n  }\n});\nObject.defineProperty(exports, \"create\", {\n  enumerable: true,\n  get: function get() {\n    return _create.create;\n  }\n});\nObject.defineProperty(exports, \"factory\", {\n  enumerable: true,\n  get: function get() {\n    return _factory.factory;\n  }\n});\nvar _configReadonly = require(\"./configReadonly.js\");\nvar _pureFunctionsAnyGenerated = require(\"./pureFunctionsAny.generated.js\");\nObject.keys(_pureFunctionsAnyGenerated).forEach(function (key) {\n  if (key === \"default\" || key === \"__esModule\") return;\n  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;\n  if (key in exports && exports[key] === _pureFunctionsAnyGenerated[key]) return;\n  Object.defineProperty(exports, key, {\n    enumerable: true,\n    get: function get() {\n      return _pureFunctionsAnyGenerated[key];\n    }\n  });\n});\nvar _impureFunctionsAnyGenerated = require(\"./impureFunctionsAny.generated.js\");\nObject.keys(_impureFunctionsAnyGenerated).forEach(function (key) {\n  if (key === \"default\" || key === \"__esModule\") return;\n  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;\n  if (key in exports && exports[key] === _impureFunctionsAnyGenerated[key]) return;\n  Object.defineProperty(exports, key, {\n    enumerable: true,\n    get: function get() {\n      return _impureFunctionsAnyGenerated[key];\n    }\n  });\n});\nvar _typeChecks = require(\"./typeChecks.js\");\nObject.keys(_typeChecks).forEach(function (key) {\n  if (key === \"default\" || key === \"__esModule\") return;\n  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;\n  if (key in exports && exports[key] === _typeChecks[key]) return;\n  Object.defineProperty(exports, key, {\n    enumerable: true,\n    get: function get() {\n      return _typeChecks[key];\n    }\n  });\n});\nvar _IndexError = require(\"../error/IndexError.js\");\nvar _DimensionError = require(\"../error/DimensionError.js\");\nvar _ArgumentsError = require(\"../error/ArgumentsError.js\");\nvar _dependenciesAnyGenerated = require(\"./dependenciesAny.generated.js\");\nObject.keys(_dependenciesAnyGenerated).forEach(function (key) {\n  if (key === \"default\" || key === \"__esModule\") return;\n  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;\n  if (key in exports && exports[key] === _dependenciesAnyGenerated[key]) return;\n  Object.defineProperty(exports, key, {\n    enumerable: true,\n    get: function get() {\n      return _dependenciesAnyGenerated[key];\n    }\n  });\n});\nvar _factoriesAny = require(\"../factoriesAny.js\");\nObject.keys(_factoriesAny).forEach(function (key) {\n  if (key === \"default\" || key === \"__esModule\") return;\n  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;\n  if (key in exports && exports[key] === _factoriesAny[key]) return;\n  Object.defineProperty(exports, key, {\n    enumerable: true,\n    get: function get() {\n      return _factoriesAny[key];\n    }\n  });\n});\nvar _create = require(\"../core/create.js\");\nvar _factory = require(\"../utils/factory.js\");","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nvar _mainAny = require(\"./entry/mainAny.js\");\nObject.keys(_mainAny).forEach(function (key) {\n  if (key === \"default\" || key === \"__esModule\") return;\n  if (key in exports && exports[key] === _mainAny[key]) return;\n  Object.defineProperty(exports, key, {\n    enumerable: true,\n    get: function get() {\n      return _mainAny[key];\n    }\n  });\n});","/*\n  For determining the type of a mathJS node.\n */\n\nconst NodeType = {};\n\nNodeType.isOperator = function(node, operator=null) {\n  return node.type === 'OperatorNode' &&\n         node.fn !== 'unaryMinus' &&\n         '*+-/^'.includes(node.op) &&\n         (operator ? node.op === operator : true);\n};\n\nNodeType.isParenthesis = function(node) {\n  return node.type === 'ParenthesisNode';\n};\n\nNodeType.isUnaryMinus = function(node) {\n  return node.type === 'OperatorNode' && node.fn === 'unaryMinus';\n};\n\nNodeType.isFunction = function(node, functionName=null) {\n  if (node.type !== 'FunctionNode') {\n    return false;\n  }\n  if (functionName && node.fn.name !== functionName) {\n    return false;\n  }\n  return true;\n};\n\nNodeType.isSymbol = function(node, allowUnaryMinus=false) {\n  if (node.type === 'SymbolNode') {\n    return true;\n  }\n  else if (allowUnaryMinus && NodeType.isUnaryMinus(node)) {\n    return NodeType.isSymbol(node.args[0], false);\n  }\n  else {\n    return false;\n  }\n};\n\nNodeType.isConstant = function(node, allowUnaryMinus=false) {\n  if (node.type === 'ConstantNode') {\n    return true;\n  }\n  else if (allowUnaryMinus && NodeType.isUnaryMinus(node)) {\n    if (NodeType.isConstant(node.args[0], false)) {\n      const value = parseFloat(node.args[0].value);\n      return value >= 0;\n    }\n    else {\n      return false;\n    }\n  }\n  else {\n    return false;\n  }\n};\n\nNodeType.isConstantFraction = function(node, allowUnaryMinus=false) {\n  if (NodeType.isOperator(node, '/')) {\n    return node.args.every(n => NodeType.isConstant(n, allowUnaryMinus));\n  }\n  else {\n    return false;\n  }\n};\n\nNodeType.isConstantOrConstantFraction = function(node, allowUnaryMinus=false) {\n  if (NodeType.isConstant(node, allowUnaryMinus) ||\n      NodeType.isConstantFraction(node, allowUnaryMinus)) {\n    return true;\n  }\n  else {\n    return false;\n  }\n};\n\nNodeType.isIntegerFraction = function(node, allowUnaryMinus=false) {\n  if (!NodeType.isConstantFraction(node, allowUnaryMinus)) {\n    return false;\n  }\n  let numerator = node.args[0];\n  let denominator = node.args[1];\n  if (allowUnaryMinus) {\n    if (NodeType.isUnaryMinus(numerator)) {\n      numerator = numerator.args[0];\n    }\n    if (NodeType.isUnaryMinus(denominator)) {\n      denominator = denominator.args[0];\n    }\n  }\n  return (Number.isInteger(parseFloat(numerator.value)) &&\n          Number.isInteger(parseFloat(denominator.value)));\n};\n\nmodule.exports = NodeType;\n","/*\n  Functions to generate any mathJS node supported by the stepper\n  see http://mathjs.org/docs/expressions/expression_trees.html#nodes for more\n  information on nodes in mathJS\n*/\n\nconst math = require('mathjs');\nconst NodeType = require('./Type');\n\nconst NodeCreator = {\n  operator (op, args, implicit=false) {\n    switch (op) {\n    case '+':\n      return new math.OperatorNode('+', 'add', args);\n    case '-':\n      return new math.OperatorNode('-', 'subtract', args);\n    case '/':\n      return new math.OperatorNode('/', 'divide', args);\n    case '*':\n      return new math.OperatorNode(\n        '*', 'multiply', args, implicit);\n    case '^':\n      return new math.OperatorNode('^', 'pow', args);\n    default:\n      throw Error('Unsupported operation: ' + op);\n    }\n  },\n\n  // In almost all cases, use Negative.negate (with naive = true) to add a\n  // unary minus to your node, rather than calling this constructor directly\n  unaryMinus (content) {\n    return new math.OperatorNode(\n      '-', 'unaryMinus', [content]);\n  },\n\n  constant (val) {\n    return new math.ConstantNode(val);\n  },\n\n  symbol (name) {\n    return new math.SymbolNode(name);\n  },\n\n  parenthesis (content) {\n    return new math.ParenthesisNode(content);\n  },\n\n  list (content) {\n    return new math.ArrayNode(content);\n  },\n\n  // exponent might be null, which means there's no exponent node.\n  // similarly, coefficient might be null, which means there's no coefficient\n  // the base node can never be null.\n  term (base, exponent, coeff, explicitCoeff=false) {\n    let term = base;\n    if (exponent) {\n      term = this.operator('^', [term, exponent]);\n    }\n    if (coeff && (explicitCoeff || parseFloat(coeff.value) !== 1)) {\n      if (NodeType.isConstant(coeff) &&\n          parseFloat(coeff.value) === -1 &&\n          !explicitCoeff) {\n        // if you actually want -1 as the coefficient, set explicitCoeff to true\n        term = this.unaryMinus(term);\n      }\n      else {\n        term = this.operator('*', [coeff, term], true);\n      }\n    }\n    return term;\n  },\n\n  polynomialTerm (symbol, exponent, coeff, explicitCoeff=false) {\n    return this.term(symbol, exponent, coeff, explicitCoeff);\n  },\n\n  // Given a root value and a radicand (what is under the radical)\n  nthRoot (radicandNode, rootNode) {\n    const symbol = NodeCreator.symbol('nthRoot');\n    return new math.FunctionNode(symbol, [radicandNode, rootNode]);\n  }\n};\n\nmodule.exports = NodeCreator;\n","// Evaluates a node to a numerical value\n// e.g. the tree representing (2 + 2) * 5 would be evaluated to the number 20\n// it's important that `node` does not contain any symbol nodes\n\nfunction evaluate(node) {\nif (node.evaluate != null) return node.evaluate()\n  else if (node.eval != null) return node.eval()\n  else throw Error(`Problem, no method for evaluate this : ${node}`)\n}\n\nmodule.exports = evaluate;\n","const NodeCreator = require('./Creator');\nconst NodeType = require('./Type');\n\nconst evaluate = require('../util/evaluate');\n\n// For storing term that have a base node, maybe an exponent,\n// and maybe a coefficient.\n// These expressions are Terms:\n//   -- x^2, 2y, z, 3x/5 (PolynomialTerm)\n//   -- nthRoot(4), 5*nthRoot(x) (NthRootTerm)\n// These expressions are not: 4, x^(3+4), 2+x, 3*7, x-z\n/* Fields:\n - coeff: either a constant node or a fraction of two constant nodes\n   (might be null if no coefficient)\n - base: the base node (e.g. in x^2, the node x)\n - exponent: a node that can take any form, e.g. x^(2+x^2)\n   (might be null if no exponent)\n*/\nclass Term {\n  // Params:\n  // -- node: The node from which to construct the Term\n  // -- baseNodeFunc: A boolean function returning true if the base node\n  //    is of the right type\n  //    e.g., for PolynomialTerms, baseNodeFunc checks if the base is a symbol\n  //    for NthRootTerms, baseNodeFunc checks if the base node is an nth root\n  // -- onlyImplicitMultiplication: If onlyImplicitMultiplication is true,\n  //    we throw an error if `node` is a term without implicit multiplication\n  //    (i.e. 2*x instead of 2x) and therefore isTerm will return false.\n  constructor(node, baseNodeFunc, onlyImplicitMultiplication=false) {\n    const values = Term.parseNode(node, baseNodeFunc, onlyImplicitMultiplication);\n    this.base = values.base;\n    this.exponent = values.exponent;\n    this.coeff = values.coeff;\n  }\n  /* GETTER FUNCTIONS */\n  getBaseNode() {\n    return this.base;\n  }\n\n  getCoeffNode(defaultOne=false) {\n    if (!this.coeff && defaultOne) {\n      return NodeCreator.constant(1);\n    }\n    else {\n      return this.coeff;\n    }\n  }\n\n  getCoeffValue() {\n    if (this.coeff) {\n      return evaluate(this.coeff);\n    }\n    else {\n      return 1; // no coefficient is like a coeff of 1\n    }\n  }\n\n  getExponentNode(defaultOne=false) {\n    if (!this.exponent && defaultOne) {\n      return NodeCreator.constant(1);\n    }\n    else {\n      return this.exponent;\n    }\n  }\n\n  // note: there is no exponent value getter function because the exponent\n  // can be any expression and not necessarily a number.\n\n  /* CHECKER FUNCTIONS (returns true / false for certain conditions) */\n\n  // Returns true if the coefficient is a fraction\n  hasFractionCoeff() {\n    // coeffNode is either a constant or a division operation.\n    return this.coeff && NodeType.isOperator(this.coeff);\n  }\n\n  hasCoeff() {\n    return !!this.coeff;\n  }\n}\n\n// Returns if the node represents an expression that can be considered\n// a term with a coefficient.\nTerm.isTerm = function(\n  node, baseNodeFunc, onlyImplicitMultiplication=false) {\n  try {\n    // will throw error if node isn't term with coefficient\n    new Term(node, baseNodeFunc, onlyImplicitMultiplication);\n    return true;\n  }\n  catch (err) {\n    return false;\n  }\n};\n\nTerm.parseNode = function(node, baseNodeFunc, onlyImplicitMultiplication) {\n  let base, exponent, coeff;\n  if (NodeType.isOperator(node)) {\n    if (node.op === '^') {\n      const baseNode = node.args[0];\n      if (!baseNodeFunc(baseNode)) {\n        throw Error('Expected base term, got ' + baseNode);\n      }\n      base = baseNode;\n      exponent = node.args[1];\n    }\n    // it's '*' ie it has a coefficient\n    else if (node.op === '*') {\n      if (onlyImplicitMultiplication && !node.implicit) {\n        throw Error('Expected implicit multiplication');\n      }\n      if (node.args.length !== 2) {\n        throw Error('Expected two arguments to *');\n      }\n      const coeffNode = node.args[0];\n      if (!NodeType.isConstantOrConstantFraction(coeffNode)) {\n        throw Error('Expected coefficient to be constant or fraction of ' +\n          'constants term, got ' + coeffNode);\n      }\n      coeff = coeffNode;\n      const nonCoefficientTerm = new Term(\n        node.args[1], baseNodeFunc, onlyImplicitMultiplication);\n      if (nonCoefficientTerm.hasCoeff()) {\n        throw Error('Cannot have two coefficients ' + coeffNode +\n          ' and ' + nonCoefficientTerm.getCoeffNode());\n      }\n      base = nonCoefficientTerm.getBaseNode();\n      exponent = nonCoefficientTerm.getExponentNode();\n    }\n    // this means there's a fraction coefficient\n    else if (node.op === '/') {\n      const denominatorNode = node.args[1];\n      if (!NodeType.isConstant(denominatorNode)) {\n        throw Error('denominator must be constant node, instead of ' +\n          denominatorNode);\n      }\n      const numeratorNode = new Term(\n        node.args[0], baseNodeFunc, onlyImplicitMultiplication);\n      if (numeratorNode.hasFractionCoeff()) {\n        throw Error('Terms with coefficients cannot have nested fractions');\n      }\n      exponent = numeratorNode.getExponentNode();\n      base = numeratorNode.getBaseNode();\n      const numeratorConstantNode = numeratorNode.getCoeffNode(true);\n      coeff = NodeCreator.operator(\n        '/', [numeratorConstantNode, denominatorNode]);\n    }\n    else {\n      throw Error('Unsupported operatation for term with coefficent: ' + node.op);\n    }\n  }\n  else if (NodeType.isUnaryMinus(node)) {\n    var arg = node.args[0];\n    if (NodeType.isParenthesis(arg)) {\n      arg = arg.content;\n    }\n    const termNode = new Term(\n      arg, baseNodeFunc, onlyImplicitMultiplication);\n    exponent = termNode.getExponentNode();\n    base = termNode.getBaseNode();\n    if (!termNode.hasCoeff()) {\n      coeff = NodeCreator.constant(-1);\n    }\n    else {\n      coeff = negativeCoefficient(termNode.getCoeffNode());\n    }\n  }\n  else if (baseNodeFunc(node)) {\n    base = node;\n  }\n  else if (NodeType.isParenthesis(node)) {\n    return Term.parseNode(node.content, baseNodeFunc, onlyImplicitMultiplication);\n  }\n  else {\n    throw Error('Unsupported node type: ' + node.type);\n  }\n\n  return {\n    base,\n    exponent,\n    coeff,\n  };\n};\n\n\n// Multiplies `node`, a constant or fraction of two constant nodes, by -1\n// Returns a node\nfunction negativeCoefficient(node) {\n  if (NodeType.isConstant(node)) {\n    // Node is a constant\n    node = NodeCreator.constant(0 - parseFloat(node.value));\n  }\n  else {\n    // Node is a constant fraction\n    const numeratorValue = 0 - parseFloat(node.args[0].value);\n    node.args[0] = NodeCreator.constant(numeratorValue);\n  }\n  return node;\n}\n\nmodule.exports = Term;\n","const NodeType = require('./Type');\nconst Term = require('./Term');\n\n// For storing polynomial terms, which are a subclass of Term\n// where the base node is a symbol\nclass PolynomialTerm extends Term {\n  constructor(node, onlyImplicitMultiplication=false) {\n    super(node, PolynomialTerm.baseNodeFunc, onlyImplicitMultiplication);\n  }\n\n  getSymbolNode() {\n    return this.base;\n  }\n\n  getSymbolName() {\n    return this.base.name;\n  }\n}\n\n// Returns true if the term has a base node that makes it a polynomial term\n// e.g. 4x^2 has a base of x, so it is a polynomial\n// 4*sqrt(x)^2 has a base of sqrt(x), so it is not\nPolynomialTerm.baseNodeFunc = function(node) {\n  return NodeType.isSymbol(node);\n};\n\n// Returns true if the node is a polynomial term.\n// e.g. x^2, 2y, z, 3x/5 are all polynomial terms.\n// 4, 2+x, 3*7, x-z are all not polynomial terms.\n// See the tests for some more thorough examples.\nPolynomialTerm.isPolynomialTerm = function(\n  node, onlyImplicitMultiplication=false) {\n  return Term.isTerm(\n    node, PolynomialTerm.baseNodeFunc, onlyImplicitMultiplication);\n};\n\nmodule.exports = PolynomialTerm;\n","const NodeCreator = require('./node/Creator');\nconst NodeType = require('./node/Type');\nconst PolynomialTerm = require('./node/PolynomialTerm');\n\nconst Negative = {};\n\n// Returns if the given node is negative. Treats a unary minus as a negative,\n// as well as a negative constant value or a constant fraction that would\n// evaluate to a negative number\nNegative.isNegative = function(node) {\n  if (NodeType.isUnaryMinus(node)) {\n    return !Negative.isNegative(node.args[0]);\n  }\n  else if (NodeType.isConstant(node)) {\n    return parseFloat(node.value) < 0;\n  }\n  else if (NodeType.isConstantFraction(node)) {\n    const numeratorValue = parseFloat(node.args[0].value);\n    const denominatorValue = parseFloat(node.args[1].value);\n    if (numeratorValue < 0 || denominatorValue < 0) {\n      return !(numeratorValue < 0 && denominatorValue < 0);\n    }\n  }\n  else if (PolynomialTerm.isPolynomialTerm(node)) {\n    const polyNode = new PolynomialTerm(node);\n    return Negative.isNegative(polyNode.getCoeffNode(true));\n  }\n\n  return false;\n};\n\n// Given a node, returns the negated node\n// If naive is true, then we just add an extra unary minus to the expression\n// otherwise, we do the actual negation\n// E.g.\n//    not naive: -3 -> 3, x -> -x\n//    naive: -3 -> --3, x -> -x\nNegative.negate = function(node, naive=false) {\n  if (NodeType.isConstantFraction(node)) {\n    node.args[0] = Negative.negate(node.args[0], naive);\n    return node;\n  }\n  else if (PolynomialTerm.isPolynomialTerm(node)) {\n    return Negative.negatePolynomialTerm(node, naive);\n  }\n  else if (!naive) {\n    if (NodeType.isUnaryMinus(node)) {\n      return node.args[0];\n    }\n    else if (NodeType.isConstant(node)) {\n      return NodeCreator.constant(0 - parseFloat(node.value));\n    }\n  }\n  return NodeCreator.unaryMinus(node);\n};\n\n// Multiplies a polynomial term by -1 and returns the new node\n// If naive is true, then we just add an extra unary minus to the expression\n// otherwise, we do the actual negation\n// E.g.\n//    not naive: -3x -> 3x, x -> -x\n//    naive: -3x -> --3x, x -> -x\nNegative.negatePolynomialTerm = function(node, naive=false) {\n  if (!PolynomialTerm.isPolynomialTerm(node)) {\n    throw Error('node is not a polynomial term');\n  }\n  const polyNode = new PolynomialTerm(node);\n\n  let newCoeff;\n  if (!polyNode.hasCoeff()) {\n    newCoeff = NodeCreator.constant(-1);\n  }\n  else {\n    const oldCoeff = polyNode.getCoeffNode();\n    if (oldCoeff.value === '-1') {\n      newCoeff = null;\n    }\n    else if (polyNode.hasFractionCoeff()) {\n      let numerator = oldCoeff.args[0];\n      numerator = Negative.negate(numerator, naive);\n\n      const denominator = oldCoeff.args[1];\n      newCoeff = NodeCreator.operator('/', [numerator, denominator]);\n    }\n    else {\n      newCoeff = Negative.negate(oldCoeff, naive);\n      if (newCoeff.value === '1') {\n        newCoeff = null;\n      }\n    }\n  }\n  return NodeCreator.polynomialTerm(\n    polyNode.getSymbolNode(), polyNode.getExponentNode(), newCoeff);\n};\n\nmodule.exports = Negative;\n","const Negative = require('../Negative');\nconst NodeCreator = require('./Creator');\nconst NodeType = require('./Type');\n\nconst NodeCustomType = {};\n\n// Returns true if `node` belongs to the type specified by boolean `isTypeFunc`.\n// If `allowUnaryMinus/allowParens` is true, we allow for the node to be nested.\nNodeCustomType.isType = function(node, isTypeFunc, allowUnaryMinus=true, allowParens=true) {\n  if (isTypeFunc(node)) {\n    return true;\n  }\n  else if (allowUnaryMinus && NodeType.isUnaryMinus(node)) {\n    return NodeCustomType.isType(node.args[0], isTypeFunc, allowUnaryMinus, allowParens);\n  }\n  else if (allowParens && NodeType.isParenthesis(node)) {\n    return NodeCustomType.isType(node.content, isTypeFunc, allowUnaryMinus, allowParens);\n  }\n\n  return false;\n};\n\n// Returns `node` if `node` belongs to the type specified by boolean `isTypeFunc`.\n// If `allowUnaryMinus/allowParens` is true, we check for an inner node of this type.\n// `moveUnaryMinus` should be defined if `allowUnaryMinus` is true, and should\n// move the unaryMinus into the inside of the type\n// e.g. for fractions, this function will negate the numerator\nNodeCustomType.getType = function(\n  node, isTypeFunc, allowUnaryMinus=true, allowParens=true, moveUnaryMinus=undefined) {\n  if (allowUnaryMinus === true && moveUnaryMinus === undefined) {\n    throw Error('Error in `getType`: moveUnaryMinus is undefined');\n  }\n\n  if (isTypeFunc(node)) {\n    return node;\n  }\n  else if (allowUnaryMinus && NodeType.isUnaryMinus(node)) {\n    return moveUnaryMinus(\n      NodeCustomType.getType(\n        node.args[0], isTypeFunc, allowUnaryMinus, allowParens, moveUnaryMinus));\n  }\n  else if (allowParens && NodeType.isParenthesis(node)) {\n    return NodeCustomType.getType(\n      node.content, isTypeFunc, allowUnaryMinus, allowParens, moveUnaryMinus);\n  }\n\n  throw Error('`getType` called on a node that does not belong to specified type');\n};\n\nNodeCustomType.isFraction = function(node, allowUnaryMinus=true, allowParens=true) {\n  return NodeCustomType.isType(\n    node,\n    (node) => NodeType.isOperator(node, '/'),\n    allowUnaryMinus,\n    allowParens);\n};\n\nNodeCustomType.getFraction = function(node,  allowUnaryMinus=true, allowParens=true) {\n  const moveUnaryMinus = function(node) {\n    if (!(NodeType.isOperator(node, '/'))) {\n      throw Error('Expected a fraction');\n    }\n\n    const numerator = node.args[0];\n    const denominator = node.args[1];\n    const newNumerator = Negative.negate(numerator);\n    return NodeCreator.operator('/', [newNumerator, denominator]);\n  };\n\n  return NodeCustomType.getType(\n    node,\n    (node) => NodeType.isOperator(node, '/'),\n    allowParens,\n    allowUnaryMinus,\n    moveUnaryMinus);\n};\n\nmodule.exports = NodeCustomType;\n","const Negative = require('../Negative');\nconst NodeType = require('./Type');\n\n// Returns true if `node` is a mixed number\n// e.g. 2 1/2, 19 2/3\n// Right now mathjs cannot parse the above examples;\n// instead it expects the input to look like e.g. 2(1)/(2),\n// which is division with implicit multiplication in the numerator\n// TODO: Add better support for mixed numbers in the future\nfunction isMixedNumber(node) {\n  if (!NodeType.isOperator(node, '/')) {\n    return false;\n  }\n\n  if (node.args.length !== 2) {\n    return false;\n  }\n\n  const numerator = node.args[0];\n  const denominator = node.args[1];\n\n  // check for implicit multiplication between two constants in the numerator\n  // first can be wrapped in unary minus\n  // second one can be optionally wrapped in parenthesis\n  if (!(NodeType.isOperator(numerator, '*') && numerator.implicit)) {\n    return false;\n  }\n\n  const numeratorFirstArg = NodeType.isUnaryMinus(numerator.args[0]) ?\n        Negative.negate(numerator.args[0].args[0])\n        : numerator.args[0];\n\n  const numeratorSecondArg = NodeType.isParenthesis(numerator.args[1]) ?\n        numerator.args[1].content\n        : numerator.args[1];\n\n  if (!(NodeType.isConstant(numeratorFirstArg) &&\n        NodeType.isConstant(numeratorSecondArg))) {\n    return false;\n  }\n\n  // check for a constant in the denominator,\n  // optionally wrapped in parenthesis\n  const denominatorValue = NodeType.isParenthesis(denominator) ?\n        denominator.content\n        : denominator;\n\n  if (!NodeType.isConstant(denominatorValue)) {\n    return false;\n  }\n\n  return true;\n}\n\n// Returns true if the mixed number is negative,\n// in which case we have to ignore the negative while converting to an\n// improper fraction, and instead we negate the whole thing at the end\n// e.g. -1 2/3 !== ((-1 * 3) + 2)/3 = -1/3\n//      -1 2/3 == -((1 * 3) + 2)/3 = -5/2\nfunction isNegativeMixedNumber(node) {\n  if (!isMixedNumber(node)) {\n    throw Error('Expected a mixed number');\n  }\n\n  return NodeType.isUnaryMinus(node.args[0].args[0]);\n}\n\n// Get the whole number part of a mixed number\n// e.g. 1 2/3 -> 1\n// Negatives are ignored; e.g. -1 2/3 -> 1\nfunction getWholeNumberValue(node) {\n  if (!isMixedNumber(node)) {\n    throw Error('Expected a mixed number');\n  }\n\n  const wholeNumberNode = NodeType.isUnaryMinus(node.args[0].args[0]) ?\n        node.args[0].args[0].args[0]\n        : node.args[0].args[0];\n\n  return parseInt(wholeNumberNode.value);\n}\n\n// Get the numerator part of a mixed number\n// e.g. 1 2/3 -> 2\nfunction getNumeratorValue(node) {\n  if (!isMixedNumber(node)) {\n    throw Error('Expected a mixed number');\n  }\n\n  const numeratorNode = NodeType.isParenthesis(node.args[0].args[1]) ?\n        node.args[0].args[1].content\n        : node.args[0].args[1];\n\n  return parseInt(numeratorNode.value);\n}\n\n// Get the denominator part of a mixed number\n// e.g. 1 2/3 -> 3\nfunction getDenominatorValue(node) {\n  if (!isMixedNumber(node)) {\n    throw Error('Expected a mixed number');\n  }\n\n  const denominatorNode = NodeType.isParenthesis(node.args[1]) ?\n        node.args[1].content\n        : node.args[1];\n\n  return parseInt(denominatorNode.value);\n}\n\nmodule.exports = {\n  isMixedNumber,\n  isNegativeMixedNumber,\n  getWholeNumberValue,\n  getNumeratorValue,\n  getDenominatorValue\n};\n","const NodeType = require('./Type');\nconst Term = require('./Term');\n\n// For storing nth root terms, which are a subclass of Term\n// where the base node is an nth root\nclass NthRootTerm extends Term {\n  constructor(node, onlyImplicitMultiplication=false) {\n    super(node, NthRootTerm.baseNodeFunc, onlyImplicitMultiplication);\n  }\n}\n\n// Returns true if the term has a base node that makes it an nth root term\n// e.g. 4x^2 has a base of x, so it is not an nth root term\n// 4*sqrt(x)^2 has a base of sqrt(x), so it is an nth root term\nNthRootTerm.baseNodeFunc = function(node) {\n  return NodeType.isFunction(node, 'nthRoot');\n};\n\n// Returns true if the node represents an nth root term.\n// e.g. nthRoot(4), nthRoot(x^2), 4*nthRoot(10)^2\nNthRootTerm.isNthRootTerm = function(\n  node, onlyImplicitMultiplication=false) {\n  return Term.isTerm(\n    node, NthRootTerm.baseNodeFunc, onlyImplicitMultiplication);\n};\n\nmodule.exports = NthRootTerm;\n","const ChangeTypes = require('../ChangeTypes');\nconst Type = require('./Type');\n\n// This represents the current (sub)expression we're simplifying.\n// As we move step by step, a node might be updated. Functions return this\n// status object to pass on the updated node and information on if/how it was\n// changed.\n// Status(node) creates a Status object that signals no change\nclass Status {\n  constructor(changeType, oldNode, newNode, substeps=[]) {\n    if (!newNode) {\n      throw Error('node is not defined');\n    }\n    if (changeType === undefined || typeof(changeType) !== 'string') {\n      throw Error('changetype isn\\'t valid');\n    }\n\n    this.changeType = changeType;\n    this.oldNode = oldNode;\n    this.newNode = newNode;\n    this.substeps = substeps;\n  }\n\n  hasChanged() {\n    return this.changeType !== ChangeTypes.NO_CHANGE;\n  }\n}\n\nStatus.resetChangeGroups = function(node) {\n  node = node.cloneDeep();\n  node.filter(node => node.changeGroup).forEach(change => {\n    delete change.changeGroup;\n  });\n  return node;\n};\n\n// A wrapper around the Status constructor for the case where node hasn't\n// been changed.\nStatus.noChange = function(node) {\n  return new Status(ChangeTypes.NO_CHANGE, null, node);\n};\n\n// A wrapper around the Status constructor for the case of a change\n// that is happening at the level of oldNode + newNode\n// e.g. 2 + 2 --> 4 (an addition node becomes a constant node)\nStatus.nodeChanged = function(\n  changeType, oldNode, newNode, defaultChangeGroup=true, steps=[]) {\n  if (defaultChangeGroup) {\n    oldNode.changeGroup = 1;\n    newNode.changeGroup = 1;\n  }\n\n  return new Status(changeType, oldNode, newNode, steps);\n};\n\n// A wrapper around the Status constructor for the case where there was\n// a change that happened deeper `node`'s tree, and `node`'s children must be\n// updated to have the newNode/oldNode metadata (changeGroups)\n// e.g. (2 + 2) + x --> 4 + x has to update the left argument\nStatus.childChanged = function(node, childStatus, childArgIndex=null) {\n  const oldNode = node.cloneDeep();\n  const newNode = node.cloneDeep();\n  let substeps = childStatus.substeps;\n\n  if (!childStatus.oldNode) {\n    throw Error ('Expected old node for changeType: ' + childStatus.changeType);\n  }\n\n  function updateSubsteps(substeps, fn) {\n    substeps.map((step) => {\n      step = fn(step);\n      step.substeps = updateSubsteps(step.substeps, fn);\n    });\n    return substeps;\n  }\n\n  if (Type.isParenthesis(node)) {\n    oldNode.content = childStatus.oldNode;\n    newNode.content = childStatus.newNode;\n    substeps = updateSubsteps(substeps, (step) => {\n      const oldNode = node.cloneDeep();\n      const newNode = node.cloneDeep();\n      oldNode.content = step.oldNode;\n      newNode.content = step.newNode;\n      step.oldNode = oldNode;\n      step.newNode = newNode;\n      return step;\n    });\n  }\n  else if ((Type.isOperator(node) || Type.isFunction(node) &&\n            childArgIndex !== null)) {\n    oldNode.args[childArgIndex] = childStatus.oldNode;\n    newNode.args[childArgIndex] = childStatus.newNode;\n    substeps = updateSubsteps(substeps, (step) => {\n      const oldNode = node.cloneDeep();\n      const newNode = node.cloneDeep();\n      oldNode.args[childArgIndex] = step.oldNode;\n      newNode.args[childArgIndex] = step.newNode;\n      step.oldNode = oldNode;\n      step.newNode = newNode;\n      return step;\n    });\n  }\n  else if (Type.isUnaryMinus(node)) {\n    oldNode.args[0] = childStatus.oldNode;\n    newNode.args[0] = childStatus.newNode;\n    substeps = updateSubsteps(substeps, (step) => {\n      const oldNode = node.cloneDeep();\n      const newNode = node.cloneDeep();\n      oldNode.args[0] = step.oldNode;\n      newNode.args[0] = step.newNode;\n      step.oldNode = oldNode;\n      step.newNode = newNode;\n      return step;\n    });\n  }\n  else {\n    throw Error('Unexpected node type: ' + node.type);\n  }\n\n  return new Status(childStatus.changeType, oldNode, newNode, substeps);\n};\n\nmodule.exports = Status;\n","const Creator = require('./Creator');\nconst CustomType = require('./CustomType');\nconst MixedNumber = require('./MixedNumber');\nconst NthRootTerm = require('./NthRootTerm');\nconst PolynomialTerm = require('./PolynomialTerm');\nconst Status = require('./Status');\nconst Term = require('./Term');\nconst Type = require('./Type');\n\nmodule.exports = {\n  Creator,\n  CustomType,\n  MixedNumber,\n  NthRootTerm,\n  PolynomialTerm,\n  Status,\n  Term,\n  Type,\n};\n","const Node = require('../node');\n\n// Returns true if the nodes are terms that can be added together.\n// The nodes need to have the same base and exponent\n// e.g. 2x + 5x, 6x^2 + x^2, nthRoot(4,2) + nthRoot(4,2)\nfunction canAddLikeTermNodes(node, termSubclass) {\n  if (!Node.Type.isOperator(node, '+')) {\n    return false;\n  }\n  const args = node.args;\n  if (!args.every(n => Node.Term.isTerm(n, termSubclass.baseNodeFunc))) {\n    return false;\n  }\n  if (args.length === 1) {\n    return false;\n  }\n\n  const termList = args.map(n => new termSubclass(n));\n\n  // to add terms, they must have the same base *and* exponent\n  const firstTerm = termList[0];\n  const sharedBase = firstTerm.getBaseNode();\n  const sharedExponentNode = firstTerm.getExponentNode(true);\n\n  const restTerms = termList.slice(1);\n  return restTerms.every(term => {\n    const haveSameBase = sharedBase.equals(term.getBaseNode());\n    const exponentNode = term.getExponentNode(true);\n    const haveSameExponent = exponentNode.equals(sharedExponentNode);\n    return haveSameBase && haveSameExponent;\n  });\n}\n\n// Returns true if the nodes are nth roots that can be added together\nfunction canAddLikeTermNthRootNodes(node) {\n  return canAddLikeTermNodes(node, Node.NthRootTerm);\n}\n\n// Returns true if the nodes are polynomial terms that can be added together.\nfunction canAddLikeTermPolynomialNodes(node) {\n  return canAddLikeTermNodes(node, Node.PolynomialTerm);\n}\n\nmodule.exports = {\n  canAddLikeTermNodes,\n  canAddLikeTermNthRootNodes,\n  canAddLikeTermPolynomialNodes,\n};\n","const Node = require('../node');\n\n// Returns true if the node is a constant or can eventually be resolved to\n// a constant.\n// e.g. 2, 2+4, (2+4)^2 would all return true. x + 4 would return false\nfunction resolvesToConstant(node) {\n  if (Node.Type.isOperator(node) || Node.Type.isFunction(node)) {\n    return node.args.every(\n      (child) => resolvesToConstant(child));\n  }\n  else if (Node.Type.isParenthesis(node)) {\n    return resolvesToConstant(node.content);\n  }\n  else if (Node.Type.isConstant(node, true)) {\n    return true;\n  }\n  else if (Node.Type.isSymbol(node)) {\n    return false;\n  }\n  else if (Node.Type.isUnaryMinus(node)) {\n    return resolvesToConstant(node.args[0]);\n  }\n  else {\n    throw Error('Unsupported node type: ' + node.type);\n  }\n}\n\nmodule.exports = resolvesToConstant;\n","const Node = require('../node');\nconst resolvesToConstant = require('./resolvesToConstant.js');\n/*\n  Return true if the equation is of the form factor * factor = 0 or factor^power = 0\n  // e.g (x - 2)^2 = 0, x(x + 2)(x - 2) = 0\n*/\nfunction canFindRoots(equation) {\n  const left = equation.leftNode;\n  const right = equation.rightNode;\n\n  const zeroRightSide = Node.Type.isConstant(right)\n        && parseFloat(right.value) === 0;\n\n  const isMulOrPower = Node.Type.isOperator(left, '*') || Node.Type.isOperator(left, '^');\n\n  if (!(zeroRightSide && isMulOrPower)) {\n    return false;\n  }\n\n  // If the left side of the equation is multiplication, filter out all the factors\n  // that do evaluate to constants because they do not have roots. If the\n  // resulting array is empty, there is no roots to be found. Do a similiar check\n  // for when the left side is a power node.\n  // e.g 2^7 and (33 + 89) do not have solutions when set equal to 0\n\n  if (Node.Type.isOperator(left, '*')) {\n    const factors = left.args.filter(arg => !resolvesToConstant(arg));\n    return factors.length >= 1;\n  }\n  else if (Node.Type.isOperator(left, '^')) {\n    return !resolvesToConstant(left);\n  }\n}\n\nmodule.exports = canFindRoots;\n","const NodeCreator = require('../../node/Creator');\nconst NodeType = require('../../node/Type');\n\n// This module is needed when simplifying multiplication of constant powers\n// as it contains functions to get different parts of the node instead of\n// creating a new class, like polynomialTerm. The functions can return the base\n// and the exponent of the power, it can also check if the node is constant or\n// constant power.\n// e.g 2^10 is an constant power, while x^10 is not\n// e.g 2 is an constant, while x is not\n\n// Returns the base if the node is on power form\n// else returns the node as it is constant.\n// e.g 2^4 returns 2\n// e.g 3 returns 3, since 3 is equal to 3^1 which has a base of 3\nfunction getBaseNode(node) {\n  if (node.args) {\n    return node.args[0];\n  }\n  else {\n    return node;\n  }\n}\n\n// Returns the node that is an exponent to a constant, or a constant node with\n// value 1 if there's no exponent.\n// e.g. on the node representing 2^3, returns a constant node with value 3\n// e.g 3 returns 1, since 3 is equal to 3^1 which has an exponent of 1\nfunction getExponentNode(node) {\n  if (NodeType.isConstant(node)) {\n    return NodeCreator.constant(1);\n  }\n  else {\n    return node.args[1];\n  }\n}\n\n// Checks if the node is an constant or a power with constant base.\n// e.g. 2^3 is a constant power node, 5 is a constant node, x and x^2 are not\nfunction isConstantOrConstantPower(node) {\n  return ((NodeType.isOperator(node, '^') &&\n           NodeType.isConstant(node.args[0])) ||\n          NodeType.isConstant(node));\n}\n\nmodule.exports = {\n  getBaseNode,\n  getExponentNode,\n  isConstantOrConstantPower\n};\n","const ConstantOrPowerTerm = require('../simplifyExpression/collectAndCombineSearch/ConstantOrConstantPower');\nconst Node = require('../node');\n\n// Returns true if node is a multiplication of constant power nodes\n// where you can combine their exponents, e.g. 10^2 * 10^4 * 10 can become 10^7.\n// The node can either be on form c^n or c, as long as c is the same for all.\nfunction canMultiplyLikeTermConstantNodes(node) {\n  if (!Node.Type.isOperator(node) || node.op !== '*') {\n    return false;\n  }\n  const args = node.args;\n  if (!args.every(n => ConstantOrPowerTerm.isConstantOrConstantPower(n))) {\n    return false;\n  }\n\n  // if none of the terms have exponents, return false here,\n  // else e.g. 6*6 will become 6^1 * 6^1 => 6^2\n  if (args.every(arg => !Node.Type.isOperator(arg, '^'))) {\n    return false;\n  }\n\n  const constantTermBaseList = args.map(n => ConstantOrPowerTerm.getBaseNode(n));\n  const firstTerm = constantTermBaseList[0];\n  const restTerms = constantTermBaseList.slice(1);\n  // they're considered like terms if they have the same base value\n  return restTerms.every(term => firstTerm.value === term.value);\n}\n\nmodule.exports = canMultiplyLikeTermConstantNodes;\n","const Node = require('../node');\n\n// Returns true if the nodes are symbolic terms with the same symbol and no\n// coefficients.\nfunction canMultiplyLikeTermPolynomialNodes(node) {\n  if (!Node.Type.isOperator(node) || node.op !== '*') {\n    return false;\n  }\n  const args = node.args;\n  if (!args.every(n => Node.PolynomialTerm.isPolynomialTerm(n))) {\n    return false;\n  }\n  if (args.length === 1) {\n    return false;\n  }\n\n  const polynomialTermList = node.args.map(n => new Node.PolynomialTerm(n));\n  if (!polynomialTermList.every(polyTerm => !polyTerm.hasCoeff())) {\n    return false;\n  }\n\n  const firstTerm = polynomialTermList[0];\n  const restTerms = polynomialTermList.slice(1);\n  // they're considered like terms if they have the same symbol name\n  return restTerms.every(term => firstTerm.getSymbolName() === term.getSymbolName());\n}\n\nmodule.exports = canMultiplyLikeTermPolynomialNodes;\n","// This module deals with getting constant factors, including prime factors\n// and factor pairs of a number\n\nconst ConstantFactors = {};\n\n// Given a number, will return all the prime factors of that number as a list\n// sorted from smallest to largest\nConstantFactors.getPrimeFactors = function(number){\n  let factors = [];\n  if (number < 0) {\n    factors = [-1];\n    factors = factors.concat(ConstantFactors.getPrimeFactors(-1 * number));\n    return factors;\n  }\n\n  const root = Math.sqrt(number);\n  let candidate = 2;\n  if (number % 2) {\n    candidate = 3; // assign first odd\n    while (number % candidate && candidate <= root) {\n      candidate = candidate + 2;\n    }\n  }\n\n  // if no factor found then the number is prime\n  if (candidate > root) {\n    factors.push(number);\n  }\n  // if we find a factor, make a recursive call on the quotient of the number and\n  // our newly found prime factor in order to find more factors\n  else {\n    factors.push(candidate);\n    factors = factors.concat(ConstantFactors.getPrimeFactors(number/candidate));\n  }\n\n  return factors;\n};\n\n// Given a number, will return all the factor pairs for that number as a list\n// of 2-item lists\nConstantFactors.getFactorPairs = function(number){\n  const factors = [];\n\n  const bound = Math.floor(Math.sqrt(Math.abs(number)));\n  for (var divisor = -bound; divisor <= bound; divisor++) {\n    if (divisor === 0) {\n      continue;\n    }\n    if (number % divisor === 0) {\n      const quotient = number / divisor;\n      factors.push([divisor, quotient]);\n    }\n  }\n\n  return factors;\n};\n\nmodule.exports = ConstantFactors;\n","const evaluate = require('./evaluate');\n\nconst Negative = require('../Negative');\nconst Node = require('../node');\n\n/*\nBackground:\n\nExpression trees are commonly parsed as binary trees, and mathjs does this too.\nThat means that a mathjs expression tree likely looks like:\nhttp://collegelabs.co/clabs/nld/images/524px-Expression_Tree.svg.png\n\ne.g. 2+2+2 is parsed by mathjs as 2 + 2+2 (a plus node with children 2 and 2+2)\nHowever...\n1. This is more complicated than needed. 2+2+2 is the same as 2+(2+2)\n2. To collect like terms, we actually *need* it to be flat. e.g. with 2x+(2+2x),\n   there's no easy way to know that there are two 2x's to collect without\n   running up and down the tree. If we flatten to 2x+2+2x, it becomes a lot\n   easier to collect like terms to (2x+2x) + 2, which would then be combined to\n   4x + 2\nThe purpose of flatteOperands is to flatten the tree in this way.\n\ne.g. an expression that is grouped in the tree like\n(2 + ((4 * ((1 + 2) + (3 + 4))) * 8))\nshould be flattened to look like:\n(2 + (4 * (1 + 2 + 3 + 4) * 8))\n\nSubtraction and division are also flattened, though that gets a bit more\ncomplicated and you may as well start reading through the code if you're\ninterested in how that works\n*/\n\n// Flattens the tree accross the same operation (just + and * for now)\n// e.g. 2+2+2 is parsed by mathjs as 2+(2+2), but this would change that to\n// 2+2+2, ie one + node that has three children.\n// Input: an expression tree\n// Output: the expression tree updated with flattened operations\nfunction flattenOperands(node) {\n  // If the node is a mixed number, do not perform any flattening\n  // -- Flattening will take out the implicit multiplication, and so\n  //    it will be impossible to tell if the node is a mixed number or\n  //    if it is legitimate multiplication\n  // -- Converting fractions happens before any other simplification step,\n  //    so the tree *will* get flattened before any other changes happen\n  if (Node.MixedNumber.isMixedNumber(node)) {\n    return node;\n  }\n\n  if (Node.Type.isConstant(node, true)) {\n    // the evaluate() changes unary minuses around constant nodes to constant nodes\n    // with negative values.\n    const constNode = Node.Creator.constant(evaluate(node));\n    if (node.changeGroup) {\n      constNode.changeGroup = node.changeGroup;\n    }\n    return constNode;\n  }\n  else if (Node.Type.isOperator(node)) {\n    if ('+-/*'.includes(node.op)) {\n      let parentOp;\n      if (node.op === '/') {\n        // Division is flattened in partner with multiplication. This means\n        // that after collecting the operands, they'll be children args of *\n        parentOp = '*';\n      }\n      else if (node.op === '-') {\n        // Subtraction is flattened in partner with addition, This means that\n        // after collecting the operands, they'll be children args of +\n        parentOp = '+';\n      }\n      else {\n        parentOp = node.op;\n      }\n      return flattenSupportedOperation(node, parentOp);\n    }\n    // If the operation is not supported, just recurse on the children\n    else {\n      node.args.forEach((child, i) => {\n        node.args[i] = flattenOperands(child);\n      });\n    }\n    return node;\n  }\n  else if (Node.Type.isParenthesis(node)) {\n    node.content = flattenOperands(node.content);\n    return node;\n  }\n  else if (Node.Type.isUnaryMinus(node)) {\n    const arg = flattenOperands(node.args[0]);\n    const flattenedNode = Negative.negate(arg, true);\n    if (node.changeGroup) {\n      flattenedNode.changeGroup = node.changeGroup;\n    }\n    return flattenedNode;\n  }\n  else if (Node.Type.isFunction(node) && node.fn.args) {\n    // node.fn.args will only be populated in the case where a function node is\n    // followed by a node in parenthesis\n    // mathjs parses this incorrectly; we want to convert the node to be\n    // multiplication between the function and the node in parenthesis\n    // e.g. nthRoot(11)(x+y) -> nthRoot(11) * (x+y)\n    //      abs(3)(1+2) -> abs(3) * (1+2)\n    const flattenedFn = flattenOperands(node.fn); // e.g. nthRoot(11)\n    const flattenedArg = flattenOperands(node.args[0]); // e.g. x+y\n    const newNode = Node.Creator.operator(\n      '*', [flattenedFn, Node.Creator.parenthesis(flattenedArg)]);\n    return newNode;\n  }\n  else if (Node.Type.isFunction(node, 'abs')) {\n    node.args[0] = flattenOperands(node.args[0]);\n    return node;\n  }\n  else if (Node.Type.isFunction(node, 'nthRoot')) {\n    node.args[0] = flattenOperands(node.args[0]);\n    if (node.args[1]) {\n      node.args[1] = flattenOperands(node.args[1]);\n    }\n    return node;\n  }\n  else {\n    return node;\n  }\n}\n\n// Flattens operations (see flattenOperands docstring) for an operator node\n// with an operation type that can be flattened. Currently * + / are supported.\n// Returns the updated, flattened node.\n// NOTE: the returned node will be of operation type `parentOp`, regardless of\n// the operation type of `node`, unless `node` wasn't changed\n// e.g. 2 * 3 / 4 would be * of 2 and 3/4, but 2/3 would stay 2/3 and division\nfunction flattenSupportedOperation(node, parentOp) {\n  // First get the list of operands that this operator operates on.\n  // e.g. 2 + 3 + 4 + 5 is stored as (((2 + 3) + 4) + 5) in the tree and we\n  // want to get the list [2, 3, 4, 5]\n  const operands = getOperands(node, parentOp);\n\n  // If there's only one operand (possible if 2*x was flattened to 2x)\n  // then it's no longer an operation, so we should replace the node\n  // with the one operand.\n  if (operands.length === 1) {\n    node = operands[0];\n  }\n  else {\n    // When we are dealing with flattening division, and there's also\n    // multiplication involved, we might end up with a top level * instead.\n    // e.g. 2*4/5 is parsed with / at the top, but in the end we want 2 * (4/5)\n    // Check for this by first checking if we have more than two operands\n    // (which is impossible for division), then by recursing through the\n    // original tree for any multiplication node - if there was one, it would\n    // have ended up at the root.\n    if (node.op === '/' && (operands.length > 2 ||\n                            hasMultiplicationBesideDivision(node))) {\n      node = Node.Creator.operator('*', operands);\n    }\n    // similarily, - will become + always\n    else if (node.op === '-') {\n      node = Node.Creator.operator('+', operands);\n    }\n    // otherwise keep the operator, replace operands\n    else {\n      node.args = operands;\n    }\n    // When we collect operands to flatten multiplication, the\n    // multiplication of those operands should never be implicit\n    if (node.op === '*') {\n      node.implicit = false;\n    }\n  }\n  return node;\n}\n\n// Recursively finds the operands under `parentOp` in the input tree `node`.\n// The input tree `node` will always have a parent that is an operation\n// of type `op`.\n// Op is a string e.g. '+' or '*'\n// returns the list of all the node operated on by `parentOp`\nfunction getOperands(node, parentOp) {\n  // We can only recurse on operations of type op.\n  // If the node is not an operator node or of the right operation type,\n  // we can't break up or flatten this tree any further, so we return just\n  // the current node, and recurse on it to flatten its ops.\n  if (!Node.Type.isOperator(node)) {\n    return [flattenOperands(node)];\n  }\n  switch (node.op) {\n  // division is part of flattening multiplication\n  case '*':\n  case '/':\n    if (parentOp !== '*') {\n      return [flattenOperands(node)];\n    }\n    break;\n  case '+':\n  case '-':\n    if (parentOp !== '+') {\n      return [flattenOperands(node)];\n    }\n    break;\n  default:\n    return [flattenOperands(node)];\n  }\n  if (Node.PolynomialTerm.isPolynomialTerm(node, true)) {\n    node.args.forEach((arg, i) => {\n      node.args[i] = flattenOperands(node.args[i]);\n    });\n    return [node];\n  }\n\n  // If we're flattening over *, check for a polynomial term (ie a\n  // coefficient multiplied by a symbol such as 2x^2 or 3y)\n  // This is true if there's an implicit multiplication and the right operand\n  // is a symbol or a symbol to an exponent.\n  else if (parentOp === '*' && isPolynomialTermMultiplication(node)) {\n    return maybeFlattenPolynomialTerm(node);\n  }\n  else if (parentOp === '*' && node.op === '/') {\n    return flattenDivision(node);\n  }\n  else if (node.op === '-') {\n    // this operation will become addition e.g. 2 - 3 -> 2 + -(-3)\n    const secondOperand = node.args[1];\n    const negativeSecondOperand = Negative.negate(secondOperand, true);\n    const operands = [\n      getOperands(node.args[0], parentOp),\n      getOperands(negativeSecondOperand, parentOp)\n    ];\n    return [].concat.apply([], operands);\n  }\n  else {\n    const operands = [];\n    node.args.forEach((child) => {\n      // This will make an array of arrays\n      operands.push(getOperands(child, parentOp));\n    });\n    return [].concat.apply([], operands);\n  }\n}\n\n// Return true iff node is a candidate for simplifying to a polynomial\n// term. This function is a helper function for getOperands.\n// Context: Usually we'd flatten 2*2*x to a multiplication node with 3 children\n// (2, 2, and x) but if we got 2*2x, we want to keep 2x together.\n// 2*2*x (a tree stored in two levels because initially nodes only have two\n// children) in the flattening process should be turned into 2*2x instead of\n// 2*2*x (which has three children).\n// So this function would return true for the input 2*2x, if it was stored as\n// an expression tree with root node * and children 2*2 and x\nfunction isPolynomialTermMultiplication(node) {\n  // This concept only applies when we're flattening multiplication operations\n  if (node.op !== '*') {\n    return false;\n  }\n  // This only makes sense when we're flattening two arguments\n  if (node.args.length !== 2) {\n    return false;\n  }\n  // The second node should be for the form x or x^2 (ie a polynomial term\n  // with no coefficient)\n  const secondOperand = node.args[1];\n  if (Node.PolynomialTerm.isPolynomialTerm(secondOperand)) {\n    const polyNode = new Node.PolynomialTerm(secondOperand);\n    return !polyNode.hasCoeff();\n  }\n  else {\n    return false;\n  }\n}\n\n// Takes a node that might represent a multiplication with a polynomial term\n// and flattens it appropriately so the coefficient and symbol are grouped\n// together. Returns a new list of operands from this node that should be\n// multiplied together.\nfunction maybeFlattenPolynomialTerm(node) {\n  // We recurse on the left side of the tree to find operands so far\n  const operands = getOperands(node.args[0], '*');\n\n  // If the last operand (so far) under * was a constant, then it's a\n  // polynomial term.\n  // e.g. 2*5*6x creates a tree where the top node is implicit multiplcation\n  // and the left branch goes to the tree with 2*5*6, and the right operand\n  // is the symbol x. We want to check that the last argument on the left (in\n  // this example 6) is a constant.\n  const lastOperand = operands.pop();\n\n  // in the above example, node.args[1] would be the symbol x\n  const nextOperand = flattenOperands(node.args[1]);\n\n  // a coefficient can be constant or a fraction of constants\n  if (Node.Type.isConstantOrConstantFraction(lastOperand)) {\n    // we replace the constant (which we popped) with constant*symbol\n    operands.push(\n      Node.Creator.operator('*', [lastOperand, nextOperand], false));\n  }\n  // Now we know it isn't a polynomial term, it's just another seperate operand\n  else {\n    operands.push(lastOperand);\n    operands.push(nextOperand);\n  }\n  return operands;\n}\n\n// Takes a division node and returns a list of operands\n// If there is multiplication in the numerator, the operands returned\n// are to be multiplied together. Otherwise, a list of length one with\n// just the division node is returned. getOperands might change the\n// operator accordingly.\nfunction flattenDivision(node) {\n  // We recurse on the left side of the tree to find operands so far\n  // Flattening division is always considered part of a bigger picture\n  // of multiplication, so we get operands with '*'\n  let operands = getOperands(node.args[0], '*');\n\n  if (operands.length === 1) {\n    node.args[0] = operands.pop();\n    node.args[1] = flattenOperands(node.args[1]);\n    operands = [node];\n  }\n  else {\n    // This is the last operand, the term we'll want to add our division to\n    const numerator = operands.pop();\n    // This is the denominator of the current division node we're recursing on\n    const denominator = flattenOperands(node.args[1]);\n    // Note that this means 2 * 3 * 4 / 5 / 6 * 7 will flatten but keep the 4/5/6\n    // as an operand - in simplifyDivision.js this is changed to 4/(5*6)\n    const divisionNode = Node.Creator.operator('/', [numerator, denominator]);\n    operands.push(divisionNode);\n  }\n\n  return operands;\n}\n\n// Returns true if there is a * node nested in some division, with no other\n// operators or parentheses between them.\n// e.g. returns true: 2*3/4, 2 / 5 / 6 * 7 / 8\n// e.g. returns false: 3/4/5, ((3*2) - 5) / 7, (2*5)/6\nfunction hasMultiplicationBesideDivision(node) {\n  if (!Node.Type.isOperator(node)) {\n    return false;\n  }\n  if (node.op === '*') {\n    return true;\n  }\n  // we ony recurse through division\n  if (node.op !== '/') {\n    return false;\n  }\n  return node.args.some(hasMultiplicationBesideDivision);\n}\n\nmodule.exports = flattenOperands;\n","const flatten = require('./flattenOperands');\nconst Node = require('../node');\n\n// Prints an expression node in asciimath\n// If showPlusMinus is true, print + - (e.g. 2 + -3)\n// If it's false (the default) 2 + -3 would print as 2 - 3\n// (The + - is needed to support the conversion of subtraction to addition of\n// negative terms. See flattenOperands for more details if you're curious.)\nfunction printAscii(node, showPlusMinus=false) {\n  node = flatten(node.cloneDeep());\n\n  let string = printTreeTraversal(node);\n  if (!showPlusMinus) {\n    string = string.replace(/\\s*?\\+\\s*?\\-\\s*?/g, ' - ');\n  }\n  return string;\n}\n\nfunction printTreeTraversal(node, parentNode) {\n  if (Node.PolynomialTerm.isPolynomialTerm(node)) {\n    const polyTerm = new Node.PolynomialTerm(node);\n    // This is so we don't print 2/3 x^2 as 2 / 3x^2\n    // Still print x/2 as x/2 and not 1/2 x though\n    if (polyTerm.hasFractionCoeff() && node.op !== '/') {\n      const coeffTerm = polyTerm.getCoeffNode();\n      const coeffStr = printTreeTraversal(coeffTerm);\n\n      const nonCoeffTerm = Node.Creator.polynomialTerm(\n        polyTerm.getSymbolNode(), polyTerm.exponent, null);\n      const nonCoeffStr = printTreeTraversal(nonCoeffTerm);\n\n      return `${coeffStr} ${nonCoeffStr}`;\n    }\n  }\n\n  if (Node.Type.isIntegerFraction(node)) {\n    return `${node.args[0]}/${node.args[1]}`;\n  }\n\n  if (Node.Type.isOperator(node)) {\n    if (node.op === '/' && Node.Type.isOperator(node.args[1])) {\n      return `${printTreeTraversal(node.args[0])} / (${printTreeTraversal(node.args[1])})`;\n    }\n\n    let opString = '';\n\n    switch (node.op) {\n    case '+':\n    case '-':\n      // add space between operator and operands\n      opString = ` ${node.op} `;\n      break;\n    case '*':\n      if (node.implicit) {\n        break;\n      }\n      opString = ` ${node.op} `;\n      break;\n    case '/':\n      // no space for constant fraction divisions (slightly easier to read)\n      if (Node.Type.isConstantFraction(node, true)) {\n        opString = `${node.op}`;\n      }\n      else {\n        opString = ` ${node.op} `;\n      }\n      break;\n    case '^':\n      // no space for exponents\n      opString = `${node.op}`;\n      break;\n    }\n\n    let str = node.args.map(arg => printTreeTraversal(arg, node)).join(opString);\n\n    // Need to add parens around any [+, -] operation\n    // nested in [/, *, ^] operation\n    // Check #120, #126 issues for more details.\n    // { \"/\" [{ \"+\" [\"x\", \"2\"] }, \"2\"] } -> (x + 2) / 2.\n    if (parentNode &&\n        Node.Type.isOperator(parentNode) &&\n        node.op && parentNode.op &&\n        '*/^'.indexOf(parentNode.op) >= 0 &&\n        '+-'.indexOf(node.op) >= 0) {\n      str = `(${str})`;\n    }\n\n    return str;\n  }\n  else if (Node.Type.isParenthesis(node)) {\n    return `(${printTreeTraversal(node.content)})`;\n  }\n  else if (Node.Type.isUnaryMinus(node)) {\n    if (Node.Type.isOperator(node.args[0]) &&\n        '*/^'.indexOf(node.args[0].op) === -1 &&\n        !Node.PolynomialTerm.isPolynomialTerm(node)) {\n      return `-(${printTreeTraversal(node.args[0])})`;\n    }\n    else {\n      return `-${printTreeTraversal(node.args[0])}`;\n    }\n  }\n  else {\n    return node.toString();\n  }\n}\n\n// Prints an expression node in LaTeX\n// (The + - is needed to support the conversion of subtraction to addition of\n// negative terms. See flattenOperands for more details if you're curious.)\nfunction printLatex(node, showPlusMinus=false) {\n  let nodeTex = node.toTex({implicit: 'hide', parenthesis: true});\n\n  if (!showPlusMinus) {\n    // Replaces '+ -' with '-'\n    nodeTex = nodeTex.replace(/\\s*?\\+\\s*?\\-\\s*?/g, ' - ').replaceAll('\\\\frac', '\\\\dfrac').replaceAll('\\\\cdot', '');\n  }\n\n  return nodeTex;\n}\n\nmodule.exports = {\n  ascii: printAscii,\n  latex: printLatex,\n};\n","const math = require('mathjs');\n\nconst ChangeTypes = require('../../ChangeTypes');\nconst ConstantFactors = require('../../factor/ConstantFactors');\nconst Negative = require('../../Negative');\nconst Node = require('../../node');\nconst print = require('../../util/print');\n\n// Evaluate nthRoot() function.\n// Returns a Node.Status object.\nfunction nthRoot(node) {\n  if (!Node.Type.isFunction(node, 'nthRoot')) {\n    return Node.Status.noChange(node);\n  }\n\n  const radicandNode = getRadicandNode(node);\n\n  if (Node.Type.isOperator(radicandNode)) {\n    if (radicandNode.op === '^') {\n      return nthRootExponent(node);\n    }\n    else if (radicandNode.op === '*') {\n      return nthRootMultiplication(node);\n    }\n  }\n  else if (Node.Type.isConstant(radicandNode)) {\n    return nthRootConstant(node);\n  }\n\n  return Node.Status.noChange(node);\n}\n\n// Returns the nthRoot evaluated for an exponent node. Expects an exponent under\n// the radicand. Cancels the root and the exponent if possible. Three cases:\n// equal: nthRoot(2^x, x) = 2\n// root > exponent: nthRoot(x^2, 4) = nthRoot(x, 2)\n// exponent > root: nthRoot(x^4, 2) = x^2\nfunction nthRootExponent(node) {\n  let newNode = node.cloneDeep();\n\n  const radicandNode = getRadicandNode(node);\n  const rootNode = getRootNode(node);\n  const baseNode = radicandNode.args[0];\n  const exponentNode = Node.Type.isParenthesis(radicandNode.args[1])\n        ? radicandNode.args[1].content\n        : radicandNode.args[1];\n  if (rootNode.equals(exponentNode)) {\n    newNode = baseNode;\n    return Node.Status.nodeChanged(\n      ChangeTypes.CANCEL_EXPONENT_AND_ROOT, node, newNode);\n  }\n  else if (Node.Type.isConstant(rootNode) && Node.Type.isConstant(exponentNode)) {\n    const rootValue = parseFloat(rootNode.value);\n    const exponentValue = parseFloat(exponentNode.value);\n    if (rootValue % exponentValue === 0) {\n      const newRootValue = rootValue/exponentValue;\n      const newRootNode = Node.Creator.constant(newRootValue);\n\n      newNode = Node.Creator.nthRoot(baseNode, newRootNode);\n      return Node.Status.nodeChanged(\n        ChangeTypes.CANCEL_EXPONENT, node, newNode);\n    }\n    else if (exponentValue % rootValue === 0) {\n      const newExponentValue = exponentValue/rootValue;\n      const newExponentNode = Node.Creator.constant(newExponentValue);\n\n      newNode = Node.Creator.operator('^', [baseNode, newExponentNode]);\n      return Node.Status.nodeChanged(\n        ChangeTypes.CANCEL_ROOT, node, newNode);\n    }\n  }\n\n  return Node.Status.noChange(node);\n}\n\n// Returns the nthRoot evaluated for a multiplication node.\n// Expects a multiplication node uder the radicand.\n// If the root is a positive constant, it:\n//  1A: factors the multiplicands\n//  1B: groups them into groups whose length is the root value\n//  1C: converts the multiplications into exponents.\n// If it's possible to simplify further, it:\n//  2A: Distributes the nthRoot into the children nodes,\n//  2B: evaluates those nthRoots\n//  2C: combines them\nfunction nthRootMultiplication(node) {\n  let newNode = node.cloneDeep();\n  const rootNode = getRootNode(node);\n\n  const substeps = [];\n  let status;\n  if (Node.Type.isConstant(rootNode) && !Negative.isNegative(rootNode)) {\n    // Step 1A\n    status = factorMultiplicands(newNode);\n    if (status.hasChanged()) {\n      substeps.push(status);\n      newNode = Node.Status.resetChangeGroups(status.newNode);\n    }\n\n    // Step 1B\n    status = groupTermsByRoot(newNode);\n    if (status.hasChanged()) {\n      substeps.push(status);\n      newNode = Node.Status.resetChangeGroups(status.newNode);\n    }\n\n    // Step 1C\n    status = convertMultiplicationToExponent(newNode);\n    if (status.hasChanged()) {\n      substeps.push(status);\n      newNode = Node.Status.resetChangeGroups(status.newNode);\n      if (newNode.args[0].op === '^') {\n        status = nthRootExponent(newNode);\n        substeps.push(status);\n        return Node.Status.nodeChanged(\n          ChangeTypes.NTH_ROOT_VALUE, node, status.newNode, true, substeps);\n      }\n    }\n  }\n\n  // Step 2A\n  status = distributeNthRoot(newNode);\n  substeps.push(status);\n  newNode = Node.Status.resetChangeGroups(status.newNode);\n\n  // Step 2B\n  status = evaluateNthRootForChildren(newNode);\n  if (status.hasChanged()) {\n    substeps.push(status);\n    newNode = Node.Status.resetChangeGroups(status.newNode);\n\n    // Step 2C\n    status = combineRoots(newNode);\n    if (status.hasChanged()) {\n      substeps.push(status);\n      newNode = Node.Status.resetChangeGroups(status.newNode);\n    }\n\n    return Node.Status.nodeChanged(\n      ChangeTypes.NTH_ROOT_VALUE, node, newNode, true, substeps);\n  }\n\n  return Node.Status.noChange(node);\n}\n\n// Given an nthRoot node with a constant positive root, will do the step of\n// factoring all the multiplicands under the radicand\n// e.g. nthRoot(2 * 9 * 5 * 12) = nthRoot(2 * 3 * 3 * 5 * 2 * 2 * 3)\nfunction factorMultiplicands(node) {\n  const newNode = node.cloneDeep();\n  const radicandNode = getRadicandNode(node);\n  let children = [];\n  let factored = false;\n  radicandNode.args.forEach(child => {\n    if (Node.PolynomialTerm.isPolynomialTerm(child)) {\n      const polyTerm = new Node.PolynomialTerm(child);\n      const coeffNode = polyTerm.getCoeffNode();\n      const polyTermNoCoeff = Node.Creator.polynomialTerm(\n        polyTerm.getSymbolNode(), polyTerm.getExponentNode(), null);\n      if (coeffNode) {\n        const factorNodes = getFactorNodes(coeffNode);\n        if (factorNodes.length > 1) {\n          factored = true;\n        }\n        children = children.concat(factorNodes);\n      }\n      children.push(polyTermNoCoeff);\n    }\n    else {\n      const factorNodes = getFactorNodes(child);\n      if (factorNodes.length > 1) {\n        factored = true;\n      }\n      children = children.concat(factorNodes);\n    }\n  });\n\n  if (factored) {\n    newNode.args[0] = Node.Creator.operator('*', children);\n    return Node.Status.nodeChanged(\n      ChangeTypes.FACTOR_INTO_PRIMES, node, newNode);\n  }\n\n  return Node.Status.noChange(node);\n}\n\nfunction getFactorNodes(node) {\n  if (Node.Type.isConstant(node) && !Negative.isNegative(node)) {\n    const value = parseFloat(node.value);\n    const factors = ConstantFactors.getPrimeFactors(value);\n    const factorNodes = factors.map(Node.Creator.constant);\n    return factorNodes;\n  }\n  return [node];\n}\n\n// Given an nthRoot node with a constant positive root, will group the arguments\n// into groups of the root as a step\n// e.g. nthRoot(2 * 2 * 2, 2) -> nthRoot((2 * 2) * 2, 2)\nfunction groupTermsByRoot(node) {\n  let newNode = node.cloneDeep();\n  const radicandNode = getRadicandNode(node);\n  const rootNode = getRootNode(node);\n  const rootValue = parseFloat(rootNode.value);\n\n  radicandNode.args.sort(sortNodes);\n\n  const termStrings = radicandNode.args.map(arg => print.ascii(arg));\n\n\n  // there is nothing to simplify when there are no duplicates of factors in the radicand\n  if ([...new Set(termStrings)].length === termStrings.length) {\n    return Node.Status.noChange(node);\n  }\n\n  // dictionary storing the number of times a constant appears\n  // e.g. 2 * 2 * 2 => {'2': 3} , 2 appears 3 times\n  const count = {};\n\n  radicandNode.args.forEach(arg => {\n    const argString = print.ascii(arg);\n    count[argString] ? count[argString]++ : count[argString] = 1;\n  });\n\n  const termString = Object.keys(count);\n\n  const newTermGroups = termString.map(key => {\n    let leftover = count[key];\n    const term = math.parse(key);\n    const times = rootValue;\n\n    const args = [];\n\n    // Recursively create groups\n    while (leftover - times > 0) {\n      leftover -= times;\n      args.push(Node.Creator.parenthesis(\n        Node.Creator.operator('*', Array(times).fill(term))));\n    }\n\n    // Remaining terms after groups have been created\n    const remainder = leftover === 1\n      ? term\n      : Node.Creator.parenthesis(\n        Node.Creator.operator('*', Array(leftover).fill(term)));\n    args.push(remainder);\n\n    return args;\n  });\n\n  // Compress array of arrays\n  const newTerms = newTermGroups.reduce((acc, val) => acc.concat(val), []);\n\n  const newBase = Node.Creator.operator('*', newTerms);\n\n  newNode = Node.Creator.nthRoot(newBase, rootNode);\n\n  return Node.Status.nodeChanged(\n    ChangeTypes.GROUP_TERMS_BY_ROOT, node, newNode);\n}\n\n// Given an nthRoot node with a constant positive root,\n// will convert any grouped factors into exponent nodes as a step\n// e.g. nthRoot((2 * 2) * 2, 2) -> nthRoot(2^2 * 2, 2)\nfunction convertMultiplicationToExponent(node) {\n  const newNode = node.cloneDeep();\n\n  const radicandNode = getRadicandNode(node);\n\n  if (Node.Type.isParenthesis(radicandNode)) {\n    const child = radicandNode.content;\n    if (isMultiplicationOfEqualNodes(child)) {\n      const baseNode = child.args[0];\n      const exponentNode = Node.Creator.constant(child.args.length);\n      newNode.args[0] = Node.Creator.operator('^', [baseNode, exponentNode]);\n      return Node.Status.nodeChanged(\n        ChangeTypes.CONVERT_MULTIPLICATION_TO_EXPONENT, node, newNode);\n    }\n  }\n  else if (Node.Type.isOperator(radicandNode, '*')) {\n    const children = [];\n    radicandNode.args.forEach(child => {\n      if (Node.Type.isParenthesis(child)) {\n        const grandChild = child.content;\n        if (isMultiplicationOfEqualNodes(grandChild)) {\n          const baseNode = grandChild.args[0];\n          const exponentNode = Node.Creator.constant(grandChild.args.length);\n          children.push(Node.Creator.operator('^', [baseNode, exponentNode]));\n          return;\n        }\n      }\n      children.push(child);\n    });\n\n    newNode.args[0] = Node.Creator.operator('*', children);\n    return Node.Status.nodeChanged(\n      ChangeTypes.CONVERT_MULTIPLICATION_TO_EXPONENT, node, newNode);\n  }\n\n  return Node.Status.noChange(node);\n}\n\n// Given an nthRoot node with a multiplication under the radicand, will\n// distribute the nthRoot to all the arguments under the radicand as a step\n// e.g. nthRoot(2 * x^2, 2) -> nthRoot(2) * nthRoot(x^2)\nfunction distributeNthRoot(node) {\n  let newNode = node.cloneDeep();\n  const radicandNode = getRadicandNode(node);\n  const rootNode = getRootNode(node);\n\n  const children = [];\n  for (let i = 0; i < radicandNode.args.length; i++) {\n    const child = radicandNode.args[i];\n    children.push(Node.Creator.nthRoot(child, rootNode));\n  }\n\n  newNode = Node.Creator.operator('*', children);\n  return Node.Status.nodeChanged(\n    ChangeTypes.DISTRIBUTE_NTH_ROOT, node, newNode);\n}\n\n// Given a multiplication node of nthRoots (with the same root)\n// will evaluate the nthRoot of each child as a substep\n// e.g. nthRoot(2) * nthRoot(x^2) -> nthRoot(2) * x\nfunction evaluateNthRootForChildren(node) {\n  const newNode = node.cloneDeep();\n\n  const substeps = [];\n  for (let i = 0; i < newNode.args.length; i++) {\n    const child = newNode.args[i];\n    const childNodeStatus = nthRoot(child);\n    if (childNodeStatus.hasChanged()) {\n      newNode.args[i] = childNodeStatus.newNode;\n      substeps.push(Node.Status.childChanged(newNode, childNodeStatus, i));\n    }\n  }\n\n  if (substeps.length === 0) {\n    return Node.Status.noChange(node);\n  }\n  else if (substeps.length === 1) {\n    return substeps[0];\n  }\n  else {\n    return Node.Status.nodeChanged(\n      ChangeTypes.EVALUATE_DISTRIBUTED_NTH_ROOT, node, newNode, true, substeps);\n  }\n}\n\n// Given a multiplication node, with children including nthRoots, will combine\n// the nodes with the same radicand as a step\n// e.g. 2 * nthRoot(2) * nthRoot(x) -> 2 * nthRoot(2 * x)\n// Assumes that all the roots are the same (that this is occuring right\n// after distributeNthRoot and evaluateNthRootForChildren)\nfunction combineRoots(node) {\n  let newNode = node.cloneDeep();\n\n  let rootNode;\n  const children = [];\n  const radicandArgs = [];\n  for (let i = 0; i < newNode.args.length; i++) {\n    const child = newNode.args[i];\n    if (Node.Type.isFunction(child, 'nthRoot')) {\n      radicandArgs.push(child.args[0]);\n      rootNode = getRootNode(child);\n    }\n    else {\n      children.push(child);\n    }\n  }\n\n  if (children.length > 0) {\n    if (radicandArgs.length > 0) {\n      const radicandNode = radicandArgs.length === 1 ?\n        radicandArgs[0] : Node.Creator.operator('*', radicandArgs);\n      children.push(Node.Creator.nthRoot(radicandNode, rootNode));\n    }\n\n    newNode = Node.Creator.operator('*', children);\n    if (!newNode.equals(node)) {\n      return Node.Status.nodeChanged(\n        ChangeTypes.COMBINE_UNDER_ROOT, node, newNode);\n    }\n  }\n\n  // if there are no items moved out of the root, then nothing has changed\n  return Node.Status.noChange(node);\n}\n\n// Returns the nthRoot evaluated on a constant node\n// Potentially factors the constant node into primes, and calls\n// nthRootMultiplication on the new nthRoot\nfunction nthRootConstant(node) {\n  let newNode = node.cloneDeep();\n  const radicandNode = getRadicandNode(node);\n  const rootNode = getRootNode(node);\n\n  if (Negative.isNegative(radicandNode)) {\n    return Node.Status.noChange(node);\n  }\n  else if (!Node.Type.isConstant(rootNode) || Negative.isNegative(rootNode)) {\n    return Node.Status.noChange(node);\n  }\n\n  const radicandValue = parseFloat(radicandNode.value);\n  const rootValue = parseFloat(rootNode.value);\n  const nthRootValue = math.nthRoot(radicandValue, rootValue);\n  const roundedNthRootValue = math.round(nthRootValue);\n  // Perfect root e.g. nthRoot(4, 2) = 2\n  // nthRoot may have round-off error, so we'll check for perfect roots by rounding to the nearest integer\n  // and checking if that value that satisfies the root expression\n  if (math.pow(roundedNthRootValue, rootValue) === radicandValue) {\n    newNode = Node.Creator.constant(roundedNthRootValue);\n    return Node.Status.nodeChanged(\n      ChangeTypes.NTH_ROOT_VALUE, node, newNode);\n  }\n  // Try to find if we can simplify by finding factors that can be\n  // pulled out of the radical\n  else {\n    // convert the number into the product of its prime factors\n    const factors = ConstantFactors.getPrimeFactors(radicandValue);\n    if (factors.length > 1) {\n      let substeps = [];\n      const factorNodes = factors.map(Node.Creator.constant);\n\n      newNode.args[0] = Node.Creator.operator('*', factorNodes);\n      substeps.push(Node.Status.nodeChanged(\n        ChangeTypes.FACTOR_INTO_PRIMES, node, newNode));\n\n      // run nthRoot on the new node\n      const nodeStatus = nthRootMultiplication(newNode);\n      if (nodeStatus.hasChanged()) {\n        substeps = substeps.concat(nodeStatus.substeps);\n        newNode = nodeStatus.newNode;\n\n        return Node.Status.nodeChanged(\n          ChangeTypes.NTH_ROOT_VALUE, node, newNode, true, substeps);\n      }\n    }\n  }\n\n  return Node.Status.noChange(node);\n}\n\n// Helpers\n\n// Given an nthRoot node, will return the root node.\n// The root node is the second child of the nthRoot node, but if one doesn't\n// exist, we assume it's a square root and return 2.\nfunction getRootNode(node) {\n  if (!Node.Type.isFunction(node, 'nthRoot')) {\n    throw Error('Expected nthRoot');\n  }\n\n  return node.args.length === 2 ? node.args[1] : Node.Creator.constant(2);\n}\n\n// Given an nthRoot node, will return the radicand node.\nfunction getRadicandNode(node) {\n  if (!Node.Type.isFunction(node, 'nthRoot')) {\n    throw Error('Expected nthRoot');\n  }\n\n  return node.args[0];\n}\n\n// Sorts nodes, ordering constants nodes from smallest to largest and symbol\n// nodes after\nfunction sortNodes(a, b) {\n  if (Node.Type.isConstant(a) && Node.Type.isConstant(b)) {\n    return parseFloat(a.value) - parseFloat(b.value);\n  }\n  else if (Node.Type.isConstant(a)) {\n    return -1;\n  }\n  else if (Node.Type.isConstant(b)) {\n    return 1;\n  }\n  return 0;\n}\n\n// Simple helper function which determines a node is a multiplication node\n// of all equal nodes\nfunction isMultiplicationOfEqualNodes(node) {\n  if (!Node.Type.isOperator(node) || node.op !== '*') {\n    return false;\n  }\n\n  const termStrings = node.args.map(print.ascii);\n\n  // return if they are all equal nodes\n  return [...new Set(termStrings)].length === 1;\n}\n\nmodule.exports = {\n  getRadicandNode,\n  getRootNode,\n  nthRoot,\n};\n","const Node = require('../node');\nconst NthRoot = require('../simplifyExpression/functionsSearch/nthRoot');\n\n// Function to check if nthRoot nodes can be multiplied\n// e.g. nthRoot(x, 2) * nthRoot(x, 2) -> true\n// e.g. nthRoot(x, 2) * nthRoot(x, 3) -> false\nfunction canMultiplyLikeTermsNthRoots(node) {\n  // checks if node is a multiplication of nthRoot nodes\n  // all the terms has to have the same root node to be multiplied\n\n  if (!Node.Type.isOperator(node, '*')\n      || !(node.args.every(term => Node.Type.isFunction(term, 'nthRoot')))){\n    return false;\n  }\n\n  // Take arbitrary root node\n  const firstTerm = node.args[0];\n  const rootNode = NthRoot.getRootNode(firstTerm);\n\n  return node.args.every(\n    term => NthRoot.getRootNode(term).equals(rootNode));\n}\n\nmodule.exports = canMultiplyLikeTermsNthRoots;\n","const Node = require('../node');\n\n// Returns true if the expression is a multiplication between a constant\n// and polynomial without a coefficient.\nfunction canRearrangeCoefficient(node) {\n  // implicit multiplication doesn't count as multiplication here, since it\n  // represents a single term.\n  if (node.op !== '*' || node.implicit) {\n    return false;\n  }\n  if (node.args.length !== 2) {\n    return false;\n  }\n  if (!Node.Type.isConstantOrConstantFraction(node.args[1])) {\n    return false;\n  }\n  if (!Node.PolynomialTerm.isPolynomialTerm(node.args[0])) {\n    return false;\n  }\n\n  const polyNode = new Node.PolynomialTerm(node.args[0]);\n  return !polyNode.hasCoeff();\n}\n\nmodule.exports = canRearrangeCoefficient;\n","const canAddLikeTerms = require('./canAddLikeTerms');\nconst canMultiplyLikeTermPolynomialNodes = require('./canMultiplyLikeTermPolynomialNodes');\nconst canRearrangeCoefficient = require('./canRearrangeCoefficient');\n\n// Returns true if the node is an operation node with parameters that are\n// polynomial terms that can be combined in some way.\nfunction canSimplifyPolynomialTerms(node) {\n  return (canAddLikeTerms.canAddLikeTermPolynomialNodes(node) ||\n          canMultiplyLikeTermPolynomialNodes(node) ||\n          canRearrangeCoefficient(node));\n}\n\nmodule.exports = canSimplifyPolynomialTerms;\n","const Node = require('../node');\nconst resolvesToConstant = require('./resolvesToConstant');\n\nfunction hasUnsupportedNodes(node) {\n  if (Node.Type.isParenthesis(node)) {\n    return hasUnsupportedNodes(node.content);\n  }\n  else if (Node.Type.isUnaryMinus(node)) {\n    return hasUnsupportedNodes(node.args[0]);\n  }\n  else if (Node.Type.isOperator(node)) {\n    return node.args.some(hasUnsupportedNodes);\n  }\n  else if (Node.Type.isSymbol(node) || Node.Type.isConstant(node)) {\n    return false;\n  }\n  else if (Node.Type.isFunction(node, 'abs')) {\n    if (node.args.length !== 1) {\n      return true;\n    }\n    if (node.args.some(hasUnsupportedNodes)) {\n      return true;\n    }\n    return !resolvesToConstant(node.args[0]);\n  }\n  else if (Node.Type.isFunction(node, 'nthRoot')) {\n    return node.args.some(hasUnsupportedNodes) || node.args.length < 1;\n  }\n  else {\n    return true;\n  }\n}\n\nmodule.exports = hasUnsupportedNodes;\n","const Node = require('./node');\n\nconst Symbols = {};\n\n// returns the set of all the symbols in an equation\nSymbols.getSymbolsInEquation = function(equation) {\n  const leftSymbols = Symbols.getSymbolsInExpression(equation.leftNode);\n  const rightSymbols = Symbols.getSymbolsInExpression(equation.rightNode);\n  const symbols = new Set([...leftSymbols, ...rightSymbols]);\n  return symbols;\n};\n\n// return the set of symbols in the expression tree\nSymbols.getSymbolsInExpression = function(expression) {\n  const symbolNodes = expression.filter(node => node.isSymbolNode); // all the symbol nodes\n  const symbols = symbolNodes.map(node => node.name); // all the symbol nodes' names\n  const symbolSet = new Set(symbols); // to get rid of duplicates\n  return symbolSet;\n};\n\n// Iterates through a node and returns the last term with the symbol name\n// Returns null if no terms with the symbol name are in the node.\n// e.g. 4x^2 + 2x + y + 2 with `symbolName=x` would return 2x\nSymbols.getLastSymbolTerm = function(node, symbolName) {\n  // First check if the node itself is a polyomial term with symbolName\n  if (isSymbolTerm(node, symbolName)) {\n    return node;\n  }\n  // If it's a sum of terms, look through the operands for a term\n  // with `symbolName`\n  else if (Node.Type.isOperator(node, '+') || Node.Type.isOperator(node, '*')) {\n    for (let i = node.args.length - 1; i >= 0 ; i--) {\n      const child = node.args[i];\n      if (Node.Type.isOperator(child, '+')) {\n        return Symbols.getLastSymbolTerm(child, symbolName);\n      }\n      else if (isSymbolTerm(child, symbolName)) {\n        return child;\n      }\n    }\n  }\n  else if (Node.Type.isParenthesis(node)) {\n    return Symbols.getLastSymbolTerm(node.content, symbolName);\n  }\n\n  return null;\n};\n\n// Iterates through a node and returns the last term that does not have the\n// symbolName including other polynomial terms, and constants or constant\n// fractions\n// e.g. 4x^2 with `symbolName=x` would return 4\n// e.g. 4x^2 + 2x + 2/4 with `symbolName=x` would return 2/4\n// e.g. 4x^2 + 2x + y with `symbolName=x` would return y\nSymbols.getLastNonSymbolTerm = function(node, symbolName) {\n  if (isPolynomialTermWithSymbol(node, symbolName)) {\n    return new Node.PolynomialTerm(node).getCoeffNode();\n  }\n  else if (hasDenominatorSymbol(node, symbolName)) {\n    return null;\n  }\n  else if (Node.Type.isOperator(node)) {\n    for (let i = node.args.length - 1; i >= 0 ; i--) {\n      const child = node.args[i];\n      if (Node.Type.isOperator(child, '+')) {\n        return Symbols.getLastNonSymbolTerm(child, symbolName);\n      }\n      else if (!isSymbolTerm(child, symbolName)) {\n        return child;\n      }\n    }\n  }\n\n  return null;\n};\n\n// Iterates through a node and returns the denominator if it has a\n// symbolName in its denominator\n// e.g. 1/(2x) with `symbolName=x` would return 2x\n// e.g. 1/(x+2) with `symbolName=x` would return x+2\n// e.g. 1/(x+2) + (x+1)/(2x+3) with `symbolName=x` would return (2x+3)\nSymbols.getLastDenominatorWithSymbolTerm = function(node, symbolName) {\n  // First check if the node itself has a symbol in the denominator\n  if (hasDenominatorSymbol(node, symbolName)) {\n    return node.args[1];\n  }\n  // Otherwise, it's a sum of terms. e.g. 1/x + 1(2+x)\n  // Look through the operands for a\n  // denominator term with `symbolName`\n  else if (Node.Type.isOperator(node, '+')) {\n    for (let i = node.args.length - 1; i >= 0 ; i--) {\n      const child = node.args[i];\n      if (Node.Type.isOperator(child, '+')) {\n        return Symbols.getLastDenominatorWithSymbolTerm(child, symbolName);\n      }\n      else if (hasDenominatorSymbol(child, symbolName)) {\n        return child.args[1];\n      }\n    }\n  }\n  return null;\n};\n\n// Returns if `node` is a term with symbol `symbolName`\nfunction isSymbolTerm(node, symbolName) {\n  return isPolynomialTermWithSymbol(node, symbolName) ||\n    hasDenominatorSymbol(node, symbolName);\n}\n\nfunction isPolynomialTermWithSymbol(node, symbolName) {\n  if (Node.PolynomialTerm.isPolynomialTerm(node)) {\n    const polyTerm = new Node.PolynomialTerm(node);\n    if (polyTerm.getSymbolName() === symbolName) {\n      return true;\n    }\n  }\n\n  return false;\n}\n\n// Return if `node` has a symbol in its denominator\n// e.g. true for 1/(2x)\n// e.g. false for 5x\nfunction hasDenominatorSymbol(node, symbolName) {\n  if (Node.Type.isOperator(node) && node.op === '/') {\n    const allSymbols = Symbols.getSymbolsInExpression(node.args[1]);\n    return allSymbols.has(symbolName);\n  }\n\n  return false;\n}\n\nmodule.exports = Symbols;\n","const Node = require('../node');\nconst Symbols = require('../Symbols');\n\n// Given a node, will determine if the expression is in the form of a quadratic\n// e.g. `x^2 + 2x + 1` OR `x^2 - 1` but not `x^3 + x^2 + x + 1`\nfunction isQuadratic(node) {\n  if (!Node.Type.isOperator(node, '+')) {\n    return false;\n  }\n\n  if (node.args.length > 3) {\n    return false;\n  }\n\n  // make sure only one symbol appears in the expression\n  const symbolSet = Symbols.getSymbolsInExpression(node);\n  if (symbolSet.size !== 1) {\n    return false;\n  }\n\n  const secondDegreeTerms = node.args.filter(isPolynomialTermOfDegree(2));\n  const firstDegreeTerms = node.args.filter(isPolynomialTermOfDegree(1));\n  const constantTerms = node.args.filter(Node.Type.isConstant);\n\n  // Check that there is one second degree term and at most one first degree\n  // term and at most one constant term\n  if (secondDegreeTerms.length !== 1 || firstDegreeTerms.length > 1 ||\n    constantTerms.length > 1) {\n    return false;\n  }\n\n  // check that there are no terms that don't fall into these groups\n  if ((secondDegreeTerms.length + firstDegreeTerms.length +\n      constantTerms.length) !== node.args.length) {\n    return false;\n  }\n\n  return true;\n}\n\n// Given a degree, returns a function that checks if a node\n// is a polynomial term of the given degree.\nfunction isPolynomialTermOfDegree(degree) {\n  return function(node) {\n    if (Node.PolynomialTerm.isPolynomialTerm(node)) {\n      const polyTerm = new Node.PolynomialTerm(node);\n      const exponent = polyTerm.getExponentNode(true);\n      return exponent && parseFloat(exponent.value) === degree;\n    }\n    return false;\n  };\n}\n\nmodule.exports = isQuadratic;\n","const canAddLikeTerms = require('./canAddLikeTerms');\nconst canFindRoots = require('./canFindRoots');\nconst canMultiplyLikeTermConstantNodes = require('./canMultiplyLikeTermConstantNodes');\nconst canMultiplyLikeTermPolynomialNodes = require('./canMultiplyLikeTermPolynomialNodes');\nconst canMultiplyLikeTermsNthRoots = require('./canMultiplyLikeTermsNthRoots');\nconst canRearrangeCoefficient = require('./canRearrangeCoefficient');\nconst canSimplifyPolynomialTerms = require('./canSimplifyPolynomialTerms');\nconst hasUnsupportedNodes = require('./hasUnsupportedNodes');\nconst isQuadratic = require('./isQuadratic');\nconst resolvesToConstant = require('./resolvesToConstant');\n\nmodule.exports = {\n  canFindRoots,\n  canAddLikeTerms,\n  canMultiplyLikeTermConstantNodes,\n  canMultiplyLikeTermPolynomialNodes,\n  canMultiplyLikeTermsNthRoots,\n  canRearrangeCoefficient,\n  canSimplifyPolynomialTerms,\n  hasUnsupportedNodes,\n  isQuadratic,\n  resolvesToConstant,\n};\n","const math = require('mathjs');\n\nconst ConstantFactors = require('./ConstantFactors');\n\nconst ChangeTypes = require('../ChangeTypes');\nconst evaluate = require('../util/evaluate');\nconst Negative = require('../Negative');\nconst Node = require('../node');\n\nconst FACTOR_FUNCTIONS = [\n  // factor just the symbol e.g. x^2 + 2x -> x(x + 2)\n  factorSymbol,\n  // factor difference of squares e.g. x^2 - 4\n  factorDifferenceOfSquares,\n  // factor perfect square e.g. x^2 + 2x + 1\n  factorPerfectSquare,\n  // factor sum product rule e.g. x^2 + 3x + 2\n  factorSumProductRule\n];\n\n// Given a node, will check if it's in the form of a quadratic equation\n// `ax^2 + bx + c`, and\n// if it is, will factor it using one of the following rules:\n//    - Factor out the symbol e.g. x^2 + 2x -> x(x + 2)\n//    - Difference of squares e.g. x^2 - 4 -> (x+2)(x-2)\n//    - Perfect square e.g. x^2 + 2x + 1 -> (x+1)^2\n//    - Sum/product rule e.g. x^2 + 3x + 2 -> (x+1)(x+2)\n//    - TODO: quadratic formula\n//        requires us simplify the following only within the parens:\n//        a(x - (-b + sqrt(b^2 - 4ac)) / 2a)(x - (-b - sqrt(b^2 - 4ac)) / 2a)\nfunction factorQuadratic(node) {\n  // get a, b and c\n  let symbol, aValue = 0, bValue = 0, cValue = 0;\n  for (const term of node.args) {\n    if (Node.Type.isConstant(term)) {\n      cValue = evaluate(term);\n    }\n    else if (Node.PolynomialTerm.isPolynomialTerm(term)) {\n      const polyTerm = new Node.PolynomialTerm(term);\n      const exponent = polyTerm.getExponentNode(true);\n      if (exponent.value === '2') {\n        symbol = polyTerm.getSymbolNode();\n        aValue = polyTerm.getCoeffValue();\n      }\n      else if (exponent.value === '1') {\n        bValue = polyTerm.getCoeffValue();\n      }\n      else {\n        return Node.Status.noChange(node);\n      }\n    }\n    else {\n      return Node.Status.noChange(node);\n    }\n  }\n\n  if (!symbol || !aValue) {\n    return Node.Status.noChange(node);\n  }\n\n  let negate = false;\n  if (aValue < 0) {\n    negate = true;\n    aValue = -aValue;\n    bValue = -bValue;\n    cValue = -cValue;\n  }\n\n  for (let i = 0; i < FACTOR_FUNCTIONS.length; i++) {\n    const nodeStatus = FACTOR_FUNCTIONS[i](node, symbol, aValue, bValue, cValue, negate);\n    if (nodeStatus.hasChanged()) {\n      return nodeStatus;\n    }\n  }\n\n  return Node.Status.noChange(node);\n}\n\n// Will factor the node if it's in the form of ax^2 + bx\nfunction factorSymbol(node, symbol, aValue, bValue, cValue, negate) {\n  if (!bValue || cValue) {\n    return Node.Status.noChange(node);\n  }\n\n  const gcd = math.gcd(aValue, bValue);\n  const gcdNode = Node.Creator.constant(gcd);\n  const aNode = Node.Creator.constant(aValue/gcd);\n  const bNode = Node.Creator.constant(bValue/gcd);\n\n  const factoredNode = Node.Creator.polynomialTerm(symbol, null, gcdNode);\n  const polyTerm = Node.Creator.polynomialTerm(symbol, null, aNode);\n  const paren = Node.Creator.parenthesis(\n    Node.Creator.operator('+', [polyTerm, bNode]));\n\n  let newNode = Node.Creator.operator('*', [factoredNode, paren], true);\n  if (negate) {\n    newNode = Negative.negate(newNode);\n  }\n\n  return Node.Status.nodeChanged(ChangeTypes.FACTOR_SYMBOL, node, newNode);\n}\n\n// Will factor the node if it's in the form of ax^2 - c, and the aValue\n// and cValue are perfect squares\n// e.g. 4x^2 - 4 -> (2x + 2)(2x - 2)\nfunction factorDifferenceOfSquares(node, symbol, aValue, bValue, cValue, negate) {\n  // check if difference of squares:\n  //    (i) abs(a) and abs(c) are squares,\n  //    (ii) b = 0,\n  //    (iii) c is negative\n  if (bValue || !cValue) {\n    return Node.Status.noChange(node);\n  }\n\n  // we factor out the gcd first, providing us with a modified expression to\n  // factor with new a and c values\n  const gcd = math.gcd(aValue, cValue);\n  aValue = aValue/gcd;\n  cValue = cValue/gcd;\n  const aRootValue = Math.sqrt(Math.abs(aValue));\n  const cRootValue = Math.sqrt(Math.abs(cValue));\n\n  // must be a difference of squares\n  if (Number.isInteger(aRootValue) &&\n      Number.isInteger(cRootValue) &&\n      cValue < 0) {\n\n    const aRootNode = Node.Creator.constant(aRootValue);\n    const cRootNode = Node.Creator.constant(cRootValue);\n\n    const polyTerm = Node.Creator.polynomialTerm(symbol, null, aRootNode);\n    const firstParen = Node.Creator.parenthesis(\n      Node.Creator.operator('+', [polyTerm, cRootNode]));\n    const secondParen = Node.Creator.parenthesis(\n      Node.Creator.operator('-', [polyTerm, cRootNode]));\n\n    // create node in difference of squares form\n    let newNode = Node.Creator.operator('*', [firstParen, secondParen], true);\n    if (gcd !== 1) {\n      const gcdNode = Node.Creator.constant(gcd);\n      newNode = Node.Creator.operator('*', [gcdNode, newNode], true);\n    }\n    if (negate) {\n      newNode = Negative.negate(newNode);\n    }\n\n    return Node.Status.nodeChanged(\n      ChangeTypes.FACTOR_DIFFERENCE_OF_SQUARES, node, newNode);\n  }\n\n  return Node.Status.noChange(node);\n}\n\n// Will factor the node if it's in the form of ax^2 + bx + c, where a and c\n// are perfect squares and b = 2*sqrt(a)*sqrt(c)\n// e.g. x^2 + 2x + 1 -> (x + 1)^2\nfunction factorPerfectSquare(node, symbol, aValue, bValue, cValue, negate) {\n  // check if perfect square: (i) a and c squares, (ii) b = 2*sqrt(a)*sqrt(c)\n  if (!bValue || !cValue) {\n    return Node.Status.noChange(node);\n  }\n\n  // we factor out the gcd first, providing us with a modified expression to\n  // factor with new a and c values\n  const gcd = math.gcd(aValue, bValue, cValue);\n  aValue = aValue/gcd;\n  cValue = cValue/gcd;\n  const aRootValue = Math.sqrt(Math.abs(aValue));\n  let cRootValue = Math.sqrt(Math.abs(cValue));\n\n  // if the second term is negative, then the constant in the parens is\n  // subtracted: e.g. x^2 - 2x + 1 -> (x - 1)^2\n  if (bValue < 0) {\n    cRootValue = cRootValue * -1;\n  }\n\n  // apply the perfect square test\n  const perfectProduct = 2 * aRootValue * cRootValue;\n  if (Number.isInteger(aRootValue) &&\n      Number.isInteger(cRootValue) &&\n      (bValue/gcd) === perfectProduct) {\n    const aRootNode = Node.Creator.constant(aRootValue);\n    const cRootNode = Node.Creator.constant(cRootValue);\n\n    const polyTerm = Node.Creator.polynomialTerm(symbol, null, aRootNode);\n    const paren = Node.Creator.parenthesis(\n      Node.Creator.operator('+', [polyTerm, cRootNode]));\n    const exponent = Node.Creator.constant(2);\n\n    // create node in perfect square form\n    let newNode = Node.Creator.operator('^', [paren, exponent]);\n    if (gcd !== 1) {\n      const gcdNode = Node.Creator.constant(gcd);\n      newNode = Node.Creator.operator('*', [gcdNode, newNode], true);\n    }\n    if (negate) {\n      newNode = Negative.negate(newNode);\n    }\n\n    return Node.Status.nodeChanged(\n      ChangeTypes.FACTOR_PERFECT_SQUARE, node, newNode);\n  }\n\n  return Node.Status.noChange(node);\n}\n\n// Will factor the node if it's in the form of ax^2 + bx + c, by\n// applying the sum product rule: finding factors of a*c that add up to b.\n// e.g. x^2 + 3x + 2 -> (x + 1)(x + 2) or\n// or   2x^2 + 5x + 3 -> (2x - 1)(x + 3)\nfunction factorSumProductRule(node, symbol, aValue, bValue, cValue, negate) {\n  let newNode;\n\n  if (bValue && cValue) {\n    // we factor out the gcd first, providing us with a modified expression to\n    // factor with new a, b and c values\n    const gcd = math.gcd(aValue, bValue, cValue);\n    const gcdNode = Node.Creator.constant(gcd);\n\n    aValue = aValue/gcd;\n    bValue = bValue/gcd;\n    cValue = cValue/gcd;\n\n    // try sum/product rule: find a factor pair of a*c that adds up to b\n    const product = aValue * cValue;\n    const factorPairs = ConstantFactors.getFactorPairs(product, true);\n    for (const pair of factorPairs) {\n      if (pair[0] + pair[1] === bValue) {\n        // To factor, we go through some transformations\n        // 1. Break apart the middle term into two terms using our factor pair\n        //    (p and q): e.g. ax^2 + bx + c -> ax^2 + px + qx + c\n        // 2. Consider the first two terms together and the second two terms\n        //    together (this doesn't require any actual change to the expression)\n        //    e.g. first group: [ax^2 + px] and second group: [qx + c]\n        // 3. Factor both groups separately\n        //    e.g first group: [ux(rx + s)] and second group [v(rx + s)]\n        // 4. Finish factoring by combining the factored terms through grouping:\n        //    e.g. (ux + v)(rx + s)\n        const substeps = [];\n        let status;\n\n        const a = Node.Creator.constant(aValue);\n        const b = Node.Creator.constant(bValue);\n        const c = Node.Creator.constant(cValue);\n        const ax2 = Node.Creator.polynomialTerm(symbol, Node.Creator.constant(2), a);\n        const bx = Node.Creator.polynomialTerm(symbol, null, b);\n\n        // OPTIONAL SUBSTEP (this happens iff a is negative)\n        // ax^2 + bx + c -> -(-ax^2 - bx - c)\n        if (negate) {\n          newNode = Node.Creator.operator('+', [ax2, bx, c], true);\n          newNode = Negative.negate(newNode);\n          status = Node.Status.nodeChanged(\n            ChangeTypes.REARRANGE_COEFF, node, newNode);\n          substeps.push(status);\n          newNode = Node.Status.resetChangeGroups(status.newNode);\n        }\n\n        // SUBSTEP 1: ax^2 + bx + c -> ax^2 + px + qx + c\n        const pValue = pair[0];\n        const qValue = pair[1];\n        const p = Node.Creator.constant(pValue);\n        const q = Node.Creator.constant(qValue);\n        const px = Node.Creator.polynomialTerm(symbol, null, p);\n        const qx = Node.Creator.polynomialTerm(symbol, null, q);\n\n        newNode = Node.Creator.operator('+', [ax2, px, qx, c], true);\n        if (negate) {\n          newNode = Negative.negate(newNode);\n        }\n        status = Node.Status.nodeChanged(\n          ChangeTypes.BREAK_UP_TERM, node, newNode);\n        substeps.push(status);\n        newNode = Node.Status.resetChangeGroups(status.newNode);\n\n        // STEP 2: ax^2 + px + qx + c -> (ax^2 + px) + (qx + c)\n        const firstTerm = Node.Creator.parenthesis(\n          Node.Creator.operator('+', [ax2, px]));\n        const secondTerm = Node.Creator.parenthesis(\n          Node.Creator.operator('+', [qx, c]));\n\n        newNode = Node.Creator.operator('+', [firstTerm, secondTerm], true);\n        if (negate) {\n          newNode = Negative.negate(newNode);\n        }\n        status = Node.Status.nodeChanged(\n          ChangeTypes.COLLECT_LIKE_TERMS, node, newNode);\n        substeps.push(status);\n        newNode = Node.Status.resetChangeGroups(status.newNode);\n\n        // SUBSTEP 3A: (ax^2 + px) + (qx + c) -> ux(rx + s) + (qx + c)\n        const u = Node.Creator.constant(math.gcd(aValue, pValue));\n        const r = Node.Creator.constant(aValue/u);\n        const s = Node.Creator.constant(pValue/u);\n        const ux = Node.Creator.polynomialTerm(symbol, null, u);\n\n        // create the first group's part that's in parentheses: (rx + s)\n        const rx = Node.Creator.polynomialTerm(symbol, null, r);\n        const firstParen = Node.Creator.parenthesis(\n          Node.Creator.operator('+', [rx, s]));\n\n        const firstFactoredGroup = Node.Creator.operator('*', [ux, firstParen], true);\n        newNode = Node.Creator.operator('+', [firstFactoredGroup, secondTerm], true);\n        if (negate) {\n          newNode = Negative.negate(newNode);\n        }\n        status = Node.Status.nodeChanged(\n          ChangeTypes.FACTOR_SYMBOL, node, newNode);\n        substeps.push(status);\n        newNode = Node.Status.resetChangeGroups(status.newNode);\n\n        // STEP 3B: ux(rx + s) + (qx + c) -> ux(rx + s) + v(rx + s)\n        let vValue = math.gcd(cValue, qValue);\n        if (qValue < 0) {\n          vValue = vValue * -1;\n        }\n        const v = Node.Creator.constant(vValue);\n\n        // create the second parenthesis\n        const secondParen = Node.Creator.parenthesis(\n          Node.Creator.operator('+', [ux, v]));\n\n        const secondFactoredGroup = Node.Creator.operator('*', [v, firstParen], true);\n        newNode = Node.Creator.operator('+', [firstFactoredGroup, secondFactoredGroup], true);\n        if (negate) {\n          newNode = Negative.negate(newNode);\n        }\n        status = Node.Status.nodeChanged(\n          ChangeTypes.FACTOR_SYMBOL, node, newNode);\n        substeps.push(status);\n        newNode = Node.Status.resetChangeGroups(status.newNode);\n\n        // STEP 4: ux(rx + s) + v(rx + s) -> (ux + v)(rx + s)\n        if (gcd === 1) {\n          newNode = Node.Creator.operator(\n            '*', [firstParen, secondParen], true);\n        }\n        else {\n          newNode = Node.Creator.operator(\n            '*', [gcdNode, firstParen, secondParen], true);\n        }\n\n        if (negate) {\n          newNode = Negative.negate(newNode);\n        }\n\n        status = Node.Status.nodeChanged(\n          ChangeTypes.FACTOR_SUM_PRODUCT_RULE, node, newNode);\n        substeps.push(status);\n        newNode = Node.Status.resetChangeGroups(status.newNode);\n\n        return Node.Status.nodeChanged(\n          ChangeTypes.FACTOR_SUM_PRODUCT_RULE, node, newNode, true, substeps);\n      }\n    }\n  }\n\n  return Node.Status.noChange(node);\n}\n\nmodule.exports = factorQuadratic;\n","/*\n  Various utility functions used in the math stepper\n */\nconst Util = {};\n\n// Adds `value` to a list in `dict`, creating a new list if the key isn't in\n// the dictionary yet. Returns the updated dictionary.\nUtil.appendToArrayInObject = function(dict, key, value) {\n  if (dict[key]) {\n    dict[key].push(value);\n  }\n  else {\n    dict[key] = [value];\n  }\n  return dict;\n};\n\nmodule.exports = Util;\n","const print = require('../../util/print');\n\nconst ChangeTypes = require('../../ChangeTypes');\nconst Node = require('../../node');\nconst NthRoot = require('../functionsSearch/nthRoot');\nconst Util = require('../../util/Util');\n\nconst CONSTANT = 'constant';\nconst CONSTANT_FRACTION = 'constantFraction';\nconst NTH_ROOT = 'nthRoot';\nconst OTHER = 'other';\n\nconst LikeTermCollector = {};\n\n// Given an expression tree, returns true if there are terms that can be\n// collected\nLikeTermCollector.canCollectLikeTerms = function(node) {\n  // We can collect like terms through + or through *\n  // Note that we never collect like terms with - or /, those expressions will\n  // always be manipulated in flattenOperands so that the top level operation is\n  // + or *.\n  if (!(Node.Type.isOperator(node, '+') || Node.Type.isOperator(node, '*'))) {\n    return false;\n  }\n\n  let terms;\n  if (node.op === '+') {\n    terms = getTermsForCollectingAddition(node);\n  }\n  else if (node.op === '*') {\n    terms = getTermsForCollectingMultiplication(node);\n  }\n  else {\n    throw Error('Operation not supported: ' + node.op);\n  }\n\n  // Conditions we need to meet to decide to to reorganize (collect) the terms:\n  // - more than 1 term type\n  // - more than 1 of at least one type (not including other)\n  // (note that this means x^2 + x + x + 2 -> x^2 + (x + x) + 2,\n  // which will be recorded as a step, but doesn't change the order of terms)\n  const termTypes = Object.keys(terms);\n  const filteredTermTypes = termTypes.filter(x => x !== OTHER);\n  return (termTypes.length > 1 &&\n    filteredTermTypes.some(x => terms[x].length > 1));\n};\n\n// Collects like terms for an operation node and returns a Node.Status object.\nLikeTermCollector.collectLikeTerms = function(node) {\n  if (!LikeTermCollector.canCollectLikeTerms(node)) {\n    return Node.Status.noChange(node);\n  }\n\n  const op = node.op;\n  let terms = [];\n  if (op === '+') {\n    terms = getTermsForCollectingAddition(node);\n  }\n  else if (op === '*') {\n    terms = getTermsForCollectingMultiplication(node);\n  }\n  else {\n    throw Error('Operation not supported: ' + op);\n  }\n\n  // List the symbols alphabetically\n  const termTypesSorted = Object.keys(terms)\n      .filter(x => (x !== CONSTANT && x !== CONSTANT_FRACTION && x !== OTHER))\n      .sort(sortTerms);\n\n\n  // Then add const\n  if (terms[CONSTANT]) {\n    // at the end for addition (since we'd expect x^2 + (x + x) + 4)\n    if (op === '+') {\n      termTypesSorted.push(CONSTANT);\n    }\n    // for multipliation it should be at the front (e.g. (3*4) * x^2)\n    if (op === '*') {\n      termTypesSorted.unshift(CONSTANT);\n    }\n  }\n  if (terms[CONSTANT_FRACTION]) {\n    termTypesSorted.push(CONSTANT_FRACTION);\n  }\n\n  // Collect the new operands under op.\n  let newOperands = [];\n  let changeGroup = 1;\n  termTypesSorted.forEach(termType => {\n    const termsOfType = terms[termType];\n    if (termsOfType.length === 1) {\n      const singleTerm = termsOfType[0].cloneDeep();\n      singleTerm.changeGroup = changeGroup;\n      newOperands.push(singleTerm);\n    }\n    // Any like terms should be wrapped in parens.\n    else {\n      const termList = Node.Creator.parenthesis(\n        Node.Creator.operator(op, termsOfType)).cloneDeep();\n      termList.changeGroup = changeGroup;\n      newOperands.push(termList);\n    }\n    termsOfType.forEach(term => {\n      term.changeGroup = changeGroup;\n    });\n    changeGroup++;\n  });\n\n  // then stick anything else (paren nodes, operator nodes) at the end\n  if (terms[OTHER]) {\n    newOperands = newOperands.concat(terms[OTHER]);\n  }\n\n  const newNode = node.cloneDeep();\n  newNode.args = newOperands;\n  return Node.Status.nodeChanged(\n    ChangeTypes.COLLECT_LIKE_TERMS, node, newNode, false);\n};\n\n// Terms with coefficients are collected by categorizing them by their 'name'\n// which is used to separate them into groups that can be combined. getTermName\n// returns this group 'name'\nfunction getTermName(node, termSubclass, op) {\n  const term = new termSubclass(node);\n  // we 'name' terms by their base node name\n  let termName = print.ascii(term.getBaseNode());\n  // when adding terms, the exponent matters too (e.g. 2x^2 + 5x^3 can't be combined)\n  if (op === '+') {\n    const exponent = print.ascii(term.getExponentNode(true));\n    termName += '^' + exponent;\n  }\n  return termName;\n}\n\n// Collects like terms in an addition expression tree into categories.\n// Returns a dictionary of termname to lists of nodes with that name\n// e.g. 2x + 4 + 5x would return {'x': [2x, 5x], CONSTANT: [4]}\n// (where 2x, 5x, and 4 would actually be expression trees)\nfunction getTermsForCollectingAddition(node) {\n  let terms = {};\n\n  for (let i = 0; i < node.args.length; i++) {\n    const child = node.args[i];\n\n    if (Node.PolynomialTerm.isPolynomialTerm(child)) {\n      const termName = getTermName(child, Node.PolynomialTerm, '+');\n      terms = Util.appendToArrayInObject(terms, termName, child);\n    }\n    else if (Node.NthRootTerm.isNthRootTerm(child)) {\n      const termName = getTermName(child, Node.NthRootTerm, '+');\n      terms = Util.appendToArrayInObject(terms, termName, child);\n    }\n    else if (Node.Type.isIntegerFraction(child)) {\n      terms = Util.appendToArrayInObject(terms, CONSTANT_FRACTION, child);\n    }\n    else if (Node.Type.isConstant(child)) {\n      terms = Util.appendToArrayInObject(terms, CONSTANT, child);\n    }\n    else if (Node.Type.isOperator(node) ||\n             Node.Type.isFunction(node) ||\n             Node.Type.isParenthesis(node) ||\n             Node.Type.isUnaryMinus(node)) {\n      terms = Util.appendToArrayInObject(terms, OTHER, child);\n    }\n    else {\n      // Note that we shouldn't get any symbol nodes in the switch statement\n      // since they would have been handled by isPolynomialTerm\n      throw Error('Unsupported node type: ' + child.type);\n    }\n  }\n  // If there's exactly one constant and one fraction, we collect them\n  // to add them together.\n  // e.g. 2 + 1/3 + 5 would collect the constants (2+5) + 1/3\n  // but 2 + 1/3 + x would collect (2 + 1/3) + x so we can add them together\n  if (terms[CONSTANT] && terms[CONSTANT].length === 1 &&\n     terms[CONSTANT_FRACTION] && terms[CONSTANT_FRACTION].length === 1) {\n    const fraction = terms[CONSTANT_FRACTION][0];\n    terms = Util.appendToArrayInObject(terms, CONSTANT, fraction);\n    delete terms[CONSTANT_FRACTION];\n  }\n\n  return terms;\n}\n\n// Collects like terms in a multiplication expression tree into categories.\n// For multiplication, polynomial terms with constants are separated into\n// a symbolic term and a constant term.\n// Returns a dictionary of termname to lists of nodes with that name\n// e.g. 2x + 4 + 5x^2 would return {'x': [x, x^2], CONSTANT: [2, 4, 5]}\n// (where x, x^2, 2, 4, and 5 would actually be expression trees)\nfunction getTermsForCollectingMultiplication(node) {\n  let terms = {};\n\n  for (let i = 0; i < node.args.length; i++) {\n    let child = node.args[i];\n\n    if (Node.Type.isUnaryMinus(child)) {\n      terms = Util.appendToArrayInObject(\n        terms, CONSTANT, Node.Creator.constant(-1));\n      child = child.args[0];\n    }\n    if (Node.PolynomialTerm.isPolynomialTerm(child)) {\n      terms = addToTermsforPolynomialMultiplication(terms, child);\n    }\n    else if (Node.Type.isFunction(child, 'nthRoot')) {\n      terms = addToTermsforNthRootMultiplication(terms, child);\n    }\n    else if (Node.Type.isIntegerFraction(child)) {\n      terms = Util.appendToArrayInObject(terms, CONSTANT, child);\n    }\n    else if (Node.Type.isConstant(child)) {\n      terms = Util.appendToArrayInObject(terms, CONSTANT, child);\n    }\n    else if (Node.Type.isOperator(node) ||\n             Node.Type.isFunction(node) ||\n             Node.Type.isParenthesis(node) ||\n             Node.Type.isUnaryMinus(node)) {\n      terms = Util.appendToArrayInObject(terms, OTHER, child);\n    }\n    else {\n      // Note that we shouldn't get any symbol nodes in the switch statement\n      // since they would have been handled by isPolynomialTerm\n      throw Error('Unsupported node type: ' + child.type);\n    }\n  }\n  return terms;\n}\n\n// A helper function for getTermsForCollectingMultiplication\n// e.g. nthRoot(x, 2), append 'nthRoot2': nthRootNode to terms dictionary\n// Takes the terms dictionary and the nthRoot node, and returns an updated\n// terms dictionary.\nfunction addToTermsforNthRootMultiplication(terms, node) {\n  const rootNode = NthRoot.getRootNode(node);\n  const rootNodeValue = rootNode.value;\n\n  terms = Util.appendToArrayInObject(terms, NTH_ROOT + rootNodeValue , node);\n\n  return terms;\n}\n\n// A helper function for getTermsForCollectingMultiplication\n// Polynomial terms need to be divided into their coefficient + symbolic parts.\n// e.g. 2x^4 -> 2 (coeffient) and x^4 (symbolic, named after the symbol node)\n// Takes the terms list and the polynomial term node, and returns an updated\n// terms list.\nfunction addToTermsforPolynomialMultiplication(terms, node) {\n  const polyNode = new Node.PolynomialTerm(node);\n  let termName;\n\n  if (!polyNode.hasCoeff()) {\n    termName = getTermName(node, Node.PolynomialTerm, '*');\n    terms = Util.appendToArrayInObject(terms, termName, node);\n  }\n  else {\n    const coefficient = polyNode.getCoeffNode();\n    let termWithoutCoefficient = polyNode.getSymbolNode();\n    if (polyNode.getExponentNode()) {\n      termWithoutCoefficient = Node.Creator.operator(\n        '^', [termWithoutCoefficient, polyNode.getExponentNode()]);\n    }\n\n    terms = Util.appendToArrayInObject(terms, CONSTANT, coefficient);\n    termName = getTermName(termWithoutCoefficient, Node.PolynomialTerm, '*');\n    terms = Util.appendToArrayInObject(terms, termName, termWithoutCoefficient);\n  }\n  return terms;\n}\n\n// Sort function for termnames. Sort first by symbol name, and then by exponent.\nfunction sortTerms(a, b) {\n  if (a === b) {\n    return 0;\n  }\n  // if no exponent, sort alphabetically\n  if (a.indexOf('^') === -1) {\n    return a < b ? -1 : 1;\n  }\n  // if exponent: sort by symbol, but then exponent decreasing\n  else {\n    const symbA = a.split('^')[0];\n    const expA = a.split('^')[1];\n    const symbB = b.split('^')[0];\n    const expB = b.split('^')[1];\n    if (symbA !== symbB) {\n      return symbA < symbB ? -1 : 1;\n    }\n    else {\n      return expA > expB ? -1 : 1;\n    }\n  }\n}\n\nmodule.exports = LikeTermCollector;\n","const checks = require('../checks');\nconst LikeTermCollector = require('../simplifyExpression/collectAndCombineSearch/LikeTermCollector');\nconst Node = require('../node');\n\n// Removes any parenthesis around nodes that can't be resolved further.\n// Input must be a top level expression.\n// Returns a node.\nfunction removeUnnecessaryParens(node, rootNode=false) {\n  // Parens that wrap everything are redundant.\n  // NOTE: removeUnnecessaryParensSearch recursively removes parens that aren't\n  // needed, while this step only applies to the very top level expression.\n  // e.g. (2 + 3) * 4 can't become 2 + 3 * 4, but if (2 + 3) as a top level\n  // expression can become 2 + 3\n  if (rootNode) {\n    while (Node.Type.isParenthesis(node)) {\n      node = node.content;\n    }\n  }\n  return removeUnnecessaryParensSearch(node);\n}\n\n// Recursively moves parenthesis around nodes that can't be resolved further if\n// it doesn't change the value of the expression. Returns a node.\n// NOTE: after this function is called, every parenthesis node in the\n// tree should always have an operator node or unary minus as its child.\nfunction removeUnnecessaryParensSearch(node) {\n  if (Node.Type.isOperator(node)) {\n    return removeUnnecessaryParensInOperatorNode(node);\n  }\n  else if (Node.Type.isFunction(node)) {\n    return removeUnnecessaryParensInFunctionNode(node);\n  }\n  else if (Node.Type.isParenthesis(node)) {\n    return removeUnnecessaryParensInParenthesisNode(node);\n  }\n  else if (Node.Type.isConstant(node, true) || Node.Type.isSymbol(node)) {\n    return node;\n  }\n  else if (Node.Type.isUnaryMinus(node)) {\n    const content = node.args[0];\n    node.args[0] = removeUnnecessaryParensSearch(content);\n    return node;\n  }\n  else {\n    throw Error('Unsupported node type: ' + node.type);\n  }\n}\n\n// Removes unncessary parens for each operator in an operator node, and removes\n// unncessary parens around operators that can't be simplified further.\n// Returns a node.\nfunction removeUnnecessaryParensInOperatorNode(node) {\n  // Special case: if the node is an exponent node and the base\n  // is an operator, we should keep the parentheses for the base.\n  // e.g. (2x)^2 -> (2x)^2 instead of 2x^2\n  if (node.op === '^' && Node.Type.isParenthesis(node.args[0])) {\n    const base = node.args[0];\n    if (Node.Type.isOperator(base.content)) {\n      base.content = removeUnnecessaryParensSearch(base.content);\n      node.args[1] = removeUnnecessaryParensSearch(node.args[1]);\n\n      return node;\n    }\n  }\n\n  node.args.forEach((child, i) => {\n    node.args[i] = removeUnnecessaryParensSearch(child);\n  });\n\n  // Sometimes, parens are around expressions that have been simplified\n  // all they can be. If that expression is part of an addition or subtraction\n  // operation, we can remove the parenthesis.\n  // e.g. (x+4) + 12 -> x+4 + 12\n  if (node.op === '+') {\n    node.args.forEach((child, i) => {\n      if (Node.Type.isParenthesis(child) &&\n          !canCollectOrCombine(child.content)) {\n        // remove the parens by replacing the child node (in its args list)\n        // with its content\n        node.args[i] = child.content;\n      }\n    });\n  }\n  // This is different from addition because when subtracting a group of terms\n  //in parenthesis, we want to distribute the subtraction.\n  // e.g. `(2 + x) - (1 + x)` => `2 + x - (1 + x)` not `2 + x - 1 + x`\n  else if (node.op === '-') {\n    if (Node.Type.isParenthesis(node.args[0]) &&\n        !canCollectOrCombine(node.args[0].content)) {\n      node.args[0] = node.args[0].content;\n    }\n  }\n\n  return node;\n}\n\n// Removes unncessary parens for each argument in a function node.\n// Returns a node.\nfunction removeUnnecessaryParensInFunctionNode(node) {\n  node.args.forEach((child, i) => {\n    if (Node.Type.isParenthesis(child)) {\n      child = child.content;\n    }\n    node.args[i] = removeUnnecessaryParensSearch(child);\n  });\n\n  return node;\n}\n\n\n// Parentheses are unnecessary when their content is a constant e.g. (2)\n// or also a parenthesis node, e.g. ((2+3)) - this removes those parentheses.\n// Note that this means that the type of the content of a ParenthesisNode after\n// this step should now always be an OperatorNode (including unary minus).\n// Returns a node.\nfunction removeUnnecessaryParensInParenthesisNode(node) {\n  // polynomials terms can be complex trees (e.g. 3x^2/5) but don't need parens\n  // around them\n  if (Node.PolynomialTerm.isPolynomialTerm(node.content)) {\n    // also recurse to remove any unnecessary parens within the term\n    // (e.g. the exponent might have parens around it)\n    if (node.content.args) {\n      node.content.args.forEach((arg, i) => {\n        node.content.args[i] = removeUnnecessaryParensSearch(arg);\n      });\n    }\n    node = node.content;\n  }\n  // If the content is just one symbol or constant, the parens are not\n  // needed.\n  else if (Node.Type.isConstant(node.content, true) ||\n           Node.Type.isIntegerFraction(node.content) ||\n           Node.Type.isSymbol(node.content)) {\n    node = node.content;\n  }\n  // If the content is just one function call, the parens are not needed.\n  else if (Node.Type.isFunction(node.content)) {\n    node = node.content;\n    node = removeUnnecessaryParensSearch(node);\n  }\n  // If there is an operation within the parens, then the parens are\n  // likely needed. So, recurse.\n  else if (Node.Type.isOperator(node.content)) {\n    node.content = removeUnnecessaryParensSearch(node.content);\n    // exponent nodes don't need parens around them\n    if (node.content.op === '^') {\n      node = node.content;\n    }\n  }\n  // If the content is also parens, we have doubly nested parens. First\n  // recurse on the child node, then set the current node equal to its child\n  // to get rid of the extra parens.\n  else if (Node.Type.isParenthesis(node.content)) {\n    node = removeUnnecessaryParensSearch(node.content);\n  }\n  else if (Node.Type.isUnaryMinus(node.content)) {\n    node.content = removeUnnecessaryParensSearch(node.content);\n  }\n  else {\n    throw Error('Unsupported node type: ' + node.content.type);\n  }\n\n  return node;\n}\n\n// Returns true if any of the collect or combine steps can be applied to the\n// expression tree `node`.\nfunction canCollectOrCombine(node) {\n  return LikeTermCollector.canCollectLikeTerms(node) ||\n    checks.resolvesToConstant(node) ||\n    checks.canSimplifyPolynomialTerms(node);\n}\n\nmodule.exports = removeUnnecessaryParens;\n","const checks = require('../checks');\n\nconst factorQuadratic = require('./factorQuadratic');\n\nconst flattenOperands = require('../util/flattenOperands');\nconst removeUnnecessaryParens = require('../util/removeUnnecessaryParens');\n\n// Given a mathjs expression node, steps through factoring the expression.\n// Currently only supports factoring quadratics.\n// Returns a list of details about each step.\nfunction stepThrough(node, debug=false) {\n  if (debug) {\n    // eslint-disable-next-line\n    console.log('\\n\\nFactoring: ' + print.ascii(node, false, true));\n  }\n\n  if (checks.hasUnsupportedNodes(node)) {\n    return [];\n  }\n\n  let nodeStatus;\n  const steps = [];\n\n  node = flattenOperands(node);\n  node = removeUnnecessaryParens(node, true);\n  if (checks.isQuadratic(node)) {\n    nodeStatus = factorQuadratic(node);\n    if (nodeStatus.hasChanged()) {\n      steps.push(nodeStatus);\n    }\n  }\n  // Add factoring higher order polynomials...\n\n  return steps;\n}\n\nmodule.exports = stepThrough;\n","const math = require('mathjs');\nconst stepThrough = require('./stepThrough');\n\nfunction factorString(expressionString, debug=false) {\n  let node;\n  try {\n    node = math.parse(expressionString);\n  }\n  catch (err) {\n    return [];\n  }\n\n  if (node) {\n    return stepThrough(node, debug);\n  }\n  return [];\n}\n\nmodule.exports = factorString;\n","const Node = require('./node');\n\nconst TreeSearch = {};\n\n// Returns a function that performs a preorder search on the tree for the given\n// simplification function\nTreeSearch.preOrder = function(simplificationFunction) {\n  return function (node) {\n    return search(simplificationFunction, node, true);\n  };\n};\n\n// Returns a function that performs a postorder search on the tree for the given\n// simplification function\nTreeSearch.postOrder = function(simplificationFunction) {\n  return function (node) {\n    return search(simplificationFunction, node, false);\n  };\n};\n\n// A helper function for performing a tree search with a function\nfunction search(simplificationFunction, node, preOrder) {\n  let status;\n\n  if (preOrder) {\n    status = simplificationFunction(node);\n    if (status.hasChanged()) {\n      return status;\n    }\n  }\n\n  if (Node.Type.isConstant(node) || Node.Type.isSymbol(node)) {\n    return Node.Status.noChange(node);\n  }\n  else if (Node.Type.isUnaryMinus(node)) {\n    status = search(simplificationFunction, node.args[0], preOrder);\n    if (status.hasChanged()) {\n      return Node.Status.childChanged(node, status);\n    }\n  }\n  else if (Node.Type.isOperator(node) || Node.Type.isFunction(node)) {\n    for (let i = 0; i < node.args.length; i++) {\n      const child = node.args[i];\n      const childNodeStatus = search(simplificationFunction, child, preOrder);\n      if (childNodeStatus.hasChanged()) {\n        return  Node.Status.childChanged(node, childNodeStatus, i);\n      }\n    }\n  }\n  else if (Node.Type.isParenthesis(node)) {\n    status = search(simplificationFunction, node.content, preOrder);\n    if (status.hasChanged()) {\n      return Node.Status.childChanged(node, status);\n    }\n  }\n  else {\n    throw Error('Unsupported node type: ' + node);\n  }\n\n  if (!preOrder) {\n    return simplificationFunction(node);\n  }\n  else {\n    return Node.Status.noChange(node);\n  }\n}\n\n\nmodule.exports = TreeSearch;\n","const ChangeTypes = require('../../ChangeTypes');\nconst evaluate = require('../../util/evaluate');\nconst Node = require('../../node');\nconst TreeSearch = require('../../TreeSearch');\n\n// Searches through the tree, prioritizing deeper nodes, and evaluates\n// arithmetic (e.g. 2+2 or 3*5*2) on an operation node if possible.\n// Returns a Node.Status object.\nconst search = TreeSearch.postOrder(arithmetic);\n\n// evaluates arithmetic (e.g. 2+2 or 3*5*2) on an operation node.\n// Returns a Node.Status object.\nfunction arithmetic(node) {\n  if (!Node.Type.isOperator(node)) {\n    return Node.Status.noChange(node);\n  }\n  if (!node.args.every(child => Node.Type.isConstant(child, true))) {\n    return Node.Status.noChange(node);\n  }\n\n  // we want to eval each arg so unary minuses around constant nodes become\n  // constant nodes with negative values\n  node.args.forEach((arg, i) => {\n    node.args[i] = Node.Creator.constant(evaluate(arg));\n  });\n\n  // Only resolve division of integers if we get an integer result.\n  // Note that a fraction of decimals will be divided out.\n  if (Node.Type.isIntegerFraction(node)) {\n    const numeratorValue = parseInt(node.args[0]);\n    const denominatorValue = parseInt(node.args[1]);\n    if (numeratorValue % denominatorValue === 0) {\n      const newNode = Node.Creator.constant(numeratorValue/denominatorValue);\n      return Node.Status.nodeChanged(\n        ChangeTypes.SIMPLIFY_ARITHMETIC, node, newNode);\n    }\n    else {\n      return Node.Status.noChange(node);\n    }\n  }\n  else {\n    const evaluatedValue = evaluateAndRound(node);\n    const newNode = Node.Creator.constant(evaluatedValue);\n    return Node.Status.nodeChanged(ChangeTypes.SIMPLIFY_ARITHMETIC, node, newNode);\n  }\n}\n\n// Evaluates a math expression to a constant, e.g. 3+4 -> 7 and rounds if\n// necessary\nfunction evaluateAndRound(node) {\n  let result = evaluate(node);\n  if (Math.abs(result) < 1) {\n    result  = parseFloat(result.toPrecision(4));\n  }\n  else {\n    result  = parseFloat(result.toFixed(4));\n  }\n  return result;\n}\n\nmodule.exports = search;\n","const ChangeTypes = require('../../ChangeTypes');\nconst Node = require('../../node');\n\n// Converts a mixed number to an improper fraction\n// e.g. 1 2/3 -> 5/3\n// All comments in the function are based on this example\nfunction convertMixedNumberToImproperFraction(node) {\n  if (!Node.MixedNumber.isMixedNumber(node)) {\n    return Node.Status.noChange(node);\n  }\n\n  const substeps = [];\n  let newNode = node.cloneDeep();\n\n  // e.g. 1 2/3\n  const wholeNumber = Node.MixedNumber.getWholeNumberValue(node); // 1\n  const numerator = Node.MixedNumber.getNumeratorValue(node); // 2\n  const denominator = Node.MixedNumber.getDenominatorValue(node); // 3\n  const isNegativeMixedNumber = Node.MixedNumber.isNegativeMixedNumber(node);\n\n  // STEP 1: Convert to unsimplified improper fraction\n  // e.g. 1 2/3 -> ((1 * 3) + 2) / 3\n  let status = convertToUnsimplifiedImproperFraction(\n    newNode, wholeNumber, numerator, denominator, isNegativeMixedNumber);\n  substeps.push(status);\n  newNode = Node.Status.resetChangeGroups(status.newNode);\n\n  // STEP 2: Simplify multiplication in numerator\n  // e.g. ((1 * 3) + 2) / 3 -> (3 + 2) / 3\n  status = simplifyMultiplicationInImproperFraction(\n    newNode, wholeNumber, numerator, denominator, isNegativeMixedNumber);\n  substeps.push(status);\n  newNode = Node.Status.resetChangeGroups(status.newNode);\n\n  // STEP 3: Simplify addition in numerator\n  // e.g. (3 + 2) / 3 -> 5/3\n  status = simplifyAdditionInImproperFraction(\n    newNode, wholeNumber, numerator, denominator, isNegativeMixedNumber);\n  substeps.push(status);\n  newNode = Node.Status.resetChangeGroups(status.newNode);\n\n  return Node.Status.nodeChanged(\n    ChangeTypes.CONVERT_MIXED_NUMBER_TO_IMPROPER_FRACTION,\n    node, newNode, true, substeps);\n}\n\n// Convert a mixed number to an unsimplified proper fraction\n// e.g. 1 2/3 -> ((1 * 3) + 2) / 3\nfunction convertToUnsimplifiedImproperFraction(\n  oldNode, wholeNumber, numerator, denominator, isNegativeMixedNumber) {\n  // (wholeNumber * denominator)\n  // e.g. (1 * 3)\n  const newNumeratorMultiplication = Node.Creator.parenthesis(\n    Node.Creator.operator(\n      '*',\n      [Node.Creator.constant(wholeNumber),\n        Node.Creator.constant(denominator)]));\n\n  // (wholeNumber * denominator) + numerator\n  // e.g. (1 * 3) + 2\n  const newNumerator = Node.Creator.operator(\n    '+',\n    [newNumeratorMultiplication, Node.Creator.constant(numerator)]);\n  oldNode.args[0].args[0].changeGroup = 1;\n  newNumerator.changeGroup = 1;\n\n  // e.g. 3\n  const newDenominator = Node.Creator.constant(denominator);\n\n  let newNode = Node.Creator.operator(\n    '/', [newNumerator, newDenominator]);\n\n  if (isNegativeMixedNumber) {\n    newNode = Node.Creator.unaryMinus(newNode);\n  }\n\n  return Node.Status.nodeChanged(\n    ChangeTypes.IMPROPER_FRACTION_NUMERATOR, oldNode, newNode, false);\n}\n\n// Simplify multiplication in the numerator of an improper fraction\n// e.g. ((1 * 3) + 2) / 3 -> (3 + 2) / 3\nfunction simplifyMultiplicationInImproperFraction(\n  oldNode, wholeNumber, numerator, denominator, isNegativeMixedNumber) {\n  // (wholeNumber * denominator) + numerator\n  // e.g. 3 + 2\n  const newNumerator = Node.Creator.operator(\n    '+',\n    [Node.Creator.constant(wholeNumber * denominator),\n      Node.Creator.constant(numerator)]);\n  oldNode.args[0].changeGroup = 1;\n  newNumerator.changeGroup = 1;\n\n  // e.g. 3\n  const newDenominator = Node.Creator.constant(denominator);\n\n  let newNode = Node.Creator.operator(\n    '/', [newNumerator, newDenominator]);\n\n  if (isNegativeMixedNumber) {\n    newNode = Node.Creator.unaryMinus(newNode);\n  }\n\n  return Node.Status.nodeChanged(\n    ChangeTypes.SIMPLIFY_ARITHMETIC, oldNode, newNode, false);\n}\n\n// Simplify addition in the numerator of an improper fraction\n// e.g. (3 + 2) / 3 -> 5/3\nfunction simplifyAdditionInImproperFraction(\n  oldNode, wholeNumber, numerator, denominator, isNegativeMixedNumber) {\n  // (wholeNumber * denominator) + numerator\n  // e.g. 5\n  const newNumerator = Node.Creator.constant(\n    wholeNumber * denominator + numerator);\n  oldNode.args[0].changeGroup = 1;\n  newNumerator.changeGroup = 1;\n\n  // e.g. 3\n  const newDenominator = Node.Creator.constant(denominator);\n\n  let newNode = Node.Creator.operator(\n    '/', [newNumerator, newDenominator]);\n\n  if (isNegativeMixedNumber) {\n    newNode = Node.Creator.unaryMinus(newNode);\n  }\n\n  return Node.Status.nodeChanged(\n    ChangeTypes.SIMPLIFY_ARITHMETIC, oldNode, newNode, false);\n}\n\nmodule.exports = convertMixedNumberToImproperFraction;\n","const checks = require('../../checks');\n\nconst ChangeTypes = require('../../ChangeTypes');\nconst Node = require('../../node');\n\n// Rearranges something of the form x * 5 to be 5x, ie putting the coefficient\n// in the right place.\n// Returns a Node.Status object\nfunction rearrangeCoefficient(node) {\n  if (!checks.canRearrangeCoefficient(node)) {\n    return Node.Status.noChange(node);\n  }\n\n  let newNode = node.cloneDeep();\n\n  const polyNode = new Node.PolynomialTerm(newNode.args[0]);\n  const constNode = newNode.args[1];\n  const exponentNode = polyNode.getExponentNode();\n  newNode = Node.Creator.polynomialTerm(\n    polyNode.getSymbolNode(), exponentNode, constNode);\n\n  return Node.Status.nodeChanged(\n    ChangeTypes.REARRANGE_COEFF, node, newNode);\n}\n\nmodule.exports = rearrangeCoefficient;\n","const ChangeTypes = require('../../ChangeTypes');\nconst Node = require('../../node');\n\n// If `node` is an exponent of something to 0, we can reduce that to just 1.\n// Returns a Node.Status object.\nfunction reduceExponentByZero(node) {\n  if (node.op !== '^') {\n    return Node.Status.noChange(node);\n  }\n  const exponent = node.args[1];\n  if (Node.Type.isConstant(exponent) && exponent.value === '0') {\n    const newNode = Node.Creator.constant(1);\n    return Node.Status.nodeChanged(\n      ChangeTypes.REDUCE_EXPONENT_BY_ZERO, node, newNode);\n  }\n  else {\n    return Node.Status.noChange(node);\n  }\n}\n\nmodule.exports = reduceExponentByZero;\n","const ChangeTypes = require('../../ChangeTypes');\nconst Node = require('../../node');\n\n// If `node` is a multiplication node with 0 as one of its operands,\n// reduce the node to 0. Returns a Node.Status object.\nfunction reduceMultiplicationByZero(node) {\n  if (node.op !== '*') {\n    return Node.Status.noChange(node);\n  }\n  const zeroIndex = node.args.findIndex(arg => {\n    if (Node.Type.isConstant(arg) && arg.value === 0) {\n      return true;\n    }\n    if (Node.PolynomialTerm.isPolynomialTerm(arg)) {\n      const polyTerm = new Node.PolynomialTerm(arg);\n      return polyTerm.getCoeffValue() === 0;\n    }\n    return false;\n  });\n  if (zeroIndex >= 0) {\n    // reduce to just the 0 node\n    const newNode = Node.Creator.constant(0);\n    return Node.Status.nodeChanged(\n      ChangeTypes.MULTIPLY_BY_ZERO, node, newNode);\n  }\n  else {\n    return Node.Status.noChange(node);\n  }\n}\n\nmodule.exports = reduceMultiplicationByZero;\n","const ChangeTypes = require('../../ChangeTypes');\nconst Node = require('../../node');\n\n// If `node` is a fraction with 0 as the numerator, reduce the node to 0.\n// Returns a Node.Status object.\nfunction reduceZeroDividedByAnything(node) {\n  if (node.op !== '/') {\n    return Node.Status.noChange(node);\n  }\n  if (node.args[0].value === '0') {\n    const newNode = Node.Creator.constant(0);\n    return Node.Status.nodeChanged(\n      ChangeTypes.REDUCE_ZERO_NUMERATOR, node, newNode);\n  }\n  else {\n    return Node.Status.noChange(node);\n  }\n}\n\nmodule.exports = reduceZeroDividedByAnything;\n","const ChangeTypes = require('../../ChangeTypes');\nconst Node = require('../../node');\n\n// If `node` is an addition node with 0 as one of its operands,\n// remove 0 from the operands list. Returns a Node.Status object.\nfunction removeAdditionOfZero(node) {\n  if (node.op !== '+') {\n    return Node.Status.noChange(node);\n  }\n  const zeroIndex = node.args.findIndex(arg => {\n    return Node.Type.isConstant(arg) && arg.value === 0;\n  });\n  let newNode = node.cloneDeep();\n  if (zeroIndex >= 0) {\n    // remove the 0 node\n    newNode.args.splice(zeroIndex, 1);\n    // if there's only one operand left, there's nothing left to add it to,\n    // so move it up the tree\n    if (newNode.args.length === 1) {\n      newNode = newNode.args[0];\n    }\n    return Node.Status.nodeChanged(\n      ChangeTypes.REMOVE_ADDING_ZERO, node, newNode);\n  }\n  return Node.Status.noChange(node);\n}\n\nmodule.exports = removeAdditionOfZero;\n","const ChangeTypes = require('../../ChangeTypes');\nconst Negative = require('../../Negative');\nconst Node = require('../../node');\n\n// If `node` is a division operation of something by 1 or -1, we can remove the\n// denominator. Returns a Node.Status object.\nfunction removeDivisionByOne(node) {\n  if (node.op !== '/') {\n    return Node.Status.noChange(node);\n  }\n  const denominator = node.args[1];\n  if (!Node.Type.isConstant(denominator)) {\n    return Node.Status.noChange(node);\n  }\n  // It's taken 40ms on average to pass distribution test,\n  // TODO: see if we should keep using utils/clone here\n  let numerator = node.args[0].cloneDeep();\n\n  // if denominator is -1, we make the numerator negative\n  if (parseFloat(denominator.value) === -1) {\n    // If the numerator was an operation, wrap it in parens before adding -\n    // to the front.\n    // e.g. 2+3 / -1 ---> -(2+3)\n    if (Node.Type.isOperator(numerator)) {\n      numerator = Node.Creator.parenthesis(numerator);\n    }\n    const changeType = Negative.isNegative(numerator) ?\n      ChangeTypes.RESOLVE_DOUBLE_MINUS :\n      ChangeTypes.DIVISION_BY_NEGATIVE_ONE;\n    numerator = Negative.negate(numerator);\n    return Node.Status.nodeChanged(changeType, node, numerator);\n  }\n  else if (parseFloat(denominator.value) === 1) {\n    return Node.Status.nodeChanged(\n      ChangeTypes.DIVISION_BY_ONE, node, numerator);\n  }\n  else {\n    return Node.Status.noChange(node);\n  }\n}\n\nmodule.exports = removeDivisionByOne;\n","const checks = require('../../checks');\n\nconst ChangeTypes = require('../../ChangeTypes');\nconst Node = require('../../node');\n\n// If `node` is of the form 1^x, reduces it to a node of the form 1.\n// Returns a Node.Status object.\nfunction removeExponentBaseOne(node) {\n  if (node.op === '^' &&                         // an exponent with\n      checks.resolvesToConstant(node.args[1]) && // a power not a symbol and\n      Node.Type.isConstant(node.args[0]) &&      // a constant base\n      node.args[0].value === '1') {              // of value 1\n    const newNode = node.args[0].cloneDeep();\n    return Node.Status.nodeChanged(\n      ChangeTypes.REMOVE_EXPONENT_BASE_ONE, node, newNode);\n  }\n  return Node.Status.noChange(node);\n}\n\nmodule.exports = removeExponentBaseOne;\n","const ChangeTypes = require('../../ChangeTypes');\nconst Node = require('../../node');\n\n// If `node` is of the form x^1, reduces it to a node of the form x.\n// Returns a Node.Status object.\nfunction removeExponentByOne(node) {\n  if (node.op === '^' &&                   // exponent of anything\n      Node.Type.isConstant(node.args[1]) && // to a constant\n      node.args[1].value === '1') {        // of value 1\n    const newNode = node.args[0].cloneDeep();\n    return Node.Status.nodeChanged(\n      ChangeTypes.REMOVE_EXPONENT_BY_ONE, node, newNode);\n  }\n  return Node.Status.noChange(node);\n}\n\nmodule.exports = removeExponentByOne;\n","const ChangeTypes = require('../../ChangeTypes');\nconst Negative = require('../../Negative');\nconst Node = require('../../node');\n\n// If `node` is a multiplication node with -1 as one of its operands,\n// and a non constant as the next operand, remove -1 from the operands\n// list and make the next term have a unary minus.\n// Returns a Node.Status object.\nfunction removeMultiplicationByNegativeOne(node) {\n  if (node.op !== '*') {\n    return Node.Status.noChange(node);\n  }\n  const minusOneIndex = node.args.findIndex(arg => {\n    return Node.Type.isConstant(arg) && arg.value === -1;\n  });\n  if (minusOneIndex < 0) {\n    return Node.Status.noChange(node);\n  }\n\n  // We might merge/combine the negative one into another node. This stores\n  // the index of that other node in the arg list.\n  let nodeToCombineIndex;\n  // If minus one is the last term, maybe combine with the term before\n  if (minusOneIndex + 1 === node.args.length) {\n    nodeToCombineIndex = minusOneIndex - 1;\n  }\n  else {\n    nodeToCombineIndex = minusOneIndex + 1;\n  }\n\n  let nodeToCombine = node.args[nodeToCombineIndex];\n  // If it's a constant, the combining of those terms is handled elsewhere.\n  if (Node.Type.isConstant(nodeToCombine)) {\n    return Node.Status.noChange(node);\n  }\n\n  let newNode = node.cloneDeep();\n\n  // Get rid of the -1\n  nodeToCombine = Negative.negate(nodeToCombine.cloneDeep());\n\n  // replace the node next to -1 and remove -1\n  newNode.args[nodeToCombineIndex] = nodeToCombine;\n  newNode.args.splice(minusOneIndex, 1);\n\n  // if there's only one operand left, move it up the tree\n  if (newNode.args.length === 1) {\n    newNode = newNode.args[0];\n  }\n  return Node.Status.nodeChanged(\n    ChangeTypes.REMOVE_MULTIPLYING_BY_NEGATIVE_ONE, node, newNode);\n}\n\nmodule.exports = removeMultiplicationByNegativeOne;\n","const ChangeTypes = require('../../ChangeTypes');\nconst Node = require('../../node');\n\n// If `node` is a multiplication node with 1 as one of its operands,\n// remove 1 from the operands list. Returns a Node.Status object.\nfunction removeMultiplicationByOne(node) {\n  if (node.op !== '*') {\n    return Node.Status.noChange(node);\n  }\n  const oneIndex = node.args.findIndex(arg => {\n    return Node.Type.isConstant(arg) && arg.value === 1;\n  });\n  if (oneIndex >= 0) {\n    let newNode = node.cloneDeep();\n    // remove the 1 node\n    newNode.args.splice(oneIndex, 1);\n    // if there's only one operand left, there's nothing left to multiply it\n    // to, so move it up the tree\n    if (newNode.args.length === 1) {\n      newNode = newNode.args[0];\n    }\n    return Node.Status.nodeChanged(\n      ChangeTypes.REMOVE_MULTIPLYING_BY_ONE, node, newNode);\n  }\n  return Node.Status.noChange(node);\n}\n\nmodule.exports = removeMultiplicationByOne;\n","const ChangeTypes = require('../../ChangeTypes');\nconst Node = require('../../node');\n\n// Simplifies two unary minuses in a row by removing both of them.\n// e.g. -(- 4) --> 4\nfunction simplifyDoubleUnaryMinus(node) {\n  if (!Node.Type.isUnaryMinus(node)) {\n    return Node.Status.noChange(node);\n  }\n  const unaryArg = node.args[0];\n  // e.g. in - -x, -x is the unary arg, and we'd want to reduce to just x\n  if (Node.Type.isUnaryMinus(unaryArg)) {\n    const newNode = unaryArg.args[0].cloneDeep();\n    return Node.Status.nodeChanged(\n      ChangeTypes.RESOLVE_DOUBLE_MINUS, node, newNode);\n  }\n  // e.g. - -4, -4 could be a constant with negative value\n  else if (Node.Type.isConstant(unaryArg) && parseFloat(unaryArg.value) < 0) {\n    const newNode = Node.Creator.constant(parseFloat(unaryArg.value) * -1);\n    return Node.Status.nodeChanged(\n      ChangeTypes.RESOLVE_DOUBLE_MINUS, node, newNode);\n  }\n  // e.g. -(-(5+2))\n  else if (Node.Type.isParenthesis(unaryArg)) {\n    const parenthesisNode = unaryArg;\n    const parenthesisContent = parenthesisNode.content;\n    if (Node.Type.isUnaryMinus(parenthesisContent)) {\n      const newNode = Node.Creator.parenthesis(parenthesisContent.args[0]);\n      return Node.Status.nodeChanged(\n        ChangeTypes.RESOLVE_DOUBLE_MINUS, node, newNode);\n    }\n  }\n  return Node.Status.noChange(node);\n}\n\nmodule.exports = simplifyDoubleUnaryMinus;\n","/*\n * Performs simpifications that are more basic and overaching like (...)^0 => 1\n * These are always the first simplifications that are attempted.\n */\n\nconst Node = require('../../node');\nconst TreeSearch = require('../../TreeSearch');\n\nconst convertMixedNumberToImproperFraction = require('./convertMixedNumberToImproperFraction');\nconst rearrangeCoefficient = require('./rearrangeCoefficient');\nconst reduceExponentByZero = require('./reduceExponentByZero');\nconst reduceMultiplicationByZero = require('./reduceMultiplicationByZero');\nconst reduceZeroDividedByAnything = require('./reduceZeroDividedByAnything');\nconst removeAdditionOfZero = require('./removeAdditionOfZero');\nconst removeDivisionByOne = require('./removeDivisionByOne');\nconst removeExponentBaseOne = require('./removeExponentBaseOne');\nconst removeExponentByOne = require('./removeExponentByOne');\nconst removeMultiplicationByNegativeOne = require('./removeMultiplicationByNegativeOne');\nconst removeMultiplicationByOne = require('./removeMultiplicationByOne');\nconst simplifyDoubleUnaryMinus = require('./simplifyDoubleUnaryMinus');\n\nconst SIMPLIFICATION_FUNCTIONS = [\n  // convert mixed numbers to improper fractions\n  convertMixedNumberToImproperFraction,\n  // multiplication by 0 yields 0\n  reduceMultiplicationByZero,\n  // division of 0 by something yields 0\n  reduceZeroDividedByAnything,\n  // ____^0 --> 1\n  reduceExponentByZero,\n  // Check for x^1 which should be reduced to x\n  removeExponentByOne,\n  // Check for 1^x which should be reduced to 1\n  // if x can be simplified to a constant\n  removeExponentBaseOne,\n  // - - becomes +\n  simplifyDoubleUnaryMinus,\n  // If this is a + node and one of the operands is 0, get rid of the 0\n  removeAdditionOfZero,\n  // If this is a * node and one of the operands is 1, get rid of the 1\n  removeMultiplicationByOne,\n  // In some cases, remove multiplying by -1\n  removeMultiplicationByNegativeOne,\n  // If this is a / node and the denominator is 1 or -1, get rid of it\n  removeDivisionByOne,\n  // e.g. x*5 -> 5x\n  rearrangeCoefficient,\n];\n\nconst search = TreeSearch.preOrder(basics);\n\n// Look for basic step(s) to perform on a node. Returns a Node.Status object.\nfunction basics(node) {\n  for (let i = 0; i < SIMPLIFICATION_FUNCTIONS.length; i++) {\n    const nodeStatus = SIMPLIFICATION_FUNCTIONS[i](node);\n    if (nodeStatus.hasChanged()) {\n      return nodeStatus;\n    }\n    else {\n      node = nodeStatus.newNode;\n    }\n  }\n  return Node.Status.noChange(node);\n}\n\nmodule.exports = search;\n","const ChangeTypes = require('../../ChangeTypes');\nconst Node = require('../../node');\nconst TreeSearch = require('../../TreeSearch');\n\n// Breaks up any fraction (deeper nodes getting priority) that has a numerator\n// that is a sum. e.g. (2+x)/5 -> (2/5 + x/5)\n// This step must happen after things have been collected and combined, or\n// else things will infinite loop, so it's a tree search of its own.\n// Returns a Node.Status object\nconst search = TreeSearch.postOrder(breakUpNumerator);\n\n// If `node` is a fraction with a numerator that is a sum, breaks up the\n// fraction e.g. (2+x)/5 -> (2/5 + x/5)\n// Returns a Node.Status object\nfunction breakUpNumerator(node) {\n  if (!Node.Type.isOperator(node) || node.op !== '/') {\n    return Node.Status.noChange(node);\n  }\n  let numerator = node.args[0];\n  if (Node.Type.isParenthesis(numerator)) {\n    numerator = numerator.content;\n  }\n  if (!Node.Type.isOperator(numerator) || numerator.op !== '+') {\n    return Node.Status.noChange(node);\n  }\n\n  // At this point, we know that node is a fraction and its numerator is a sum\n  // of terms that can't be collected or combined, so we should break it up.\n  const fractionList = [];\n  const denominator = node.args[1];\n  numerator.args.forEach(arg => {\n    const newFraction = Node.Creator.operator('/', [arg, denominator]);\n    newFraction.changeGroup = 1;\n    fractionList.push(newFraction);\n  });\n\n  let newNode = Node.Creator.operator('+', fractionList);\n  // Wrap in parens for cases like 2*(2+3)/5 => 2*(2/5 + 3/5)\n  newNode = Node.Creator.parenthesis(newNode);\n  node.changeGroup = 1;\n  return Node.Status.nodeChanged(\n    ChangeTypes.BREAK_UP_FRACTION, node, newNode, false);\n}\n\nmodule.exports = search;\n","const math = require('mathjs');\n\nconst ChangeTypes = require('../../ChangeTypes');\nconst evaluate = require('../../util/evaluate');\nconst Node = require('../../node');\n\n// Simplifies a fraction (with constant numerator and denominator) by dividing\n// the top and bottom by the GCD, if possible.\n// e.g. 2/4 --> 1/2    10/5 --> 2x\n// Also simplified negative signs\n// e.g. -1/-3 --> 1/3   4/-5 --> -4/5\n// Note that -4/5 doesn't need to be simplified.\n// Note that our goal is for the denominator to always be positive. If it\n// isn't, we can simplify signs.\n// Returns a Node.Status object\nfunction divideByGCD(fraction) {\n  if (!Node.Type.isOperator(fraction) || fraction.op !== '/') {\n    return Node.Status.noChange(fraction);\n  }\n  // If it's not an integer fraction, all we can do is simplify signs\n  if (!Node.Type.isIntegerFraction(fraction, true)) {\n    return Node.Status.noChange(fraction);\n  }\n\n  const substeps = [];\n  let newNode = fraction.cloneDeep();\n\n  const numeratorValue = parseInt(evaluate(fraction.args[0]));\n  const denominatorValue = parseInt(evaluate(fraction.args[1]));\n\n  // The gcd is what we're dividing the numerator and denominator by.\n  let gcd = math.gcd(numeratorValue, denominatorValue);\n  // A greatest common denominator is technically defined as always positive,\n  // but since our goal is to reduce negative signs or move them to the\n  // numerator, a negative denominator always means we want to flip signs\n  // of both numerator and denominator.\n  // e.g. -1/-3 --> 1/3   4/-5 --> -4/5\n  if (denominatorValue < 0) {\n    gcd *= -1;\n  }\n\n  if (gcd === 1) {\n    return Node.Status.noChange(fraction);\n  }\n\n  // STEP 1: Find GCD\n  // e.g. 15/6 -> (5*3)/(2*3)\n  let status = findGCD(newNode, gcd, numeratorValue, denominatorValue);\n  substeps.push(status);\n  newNode = Node.Status.resetChangeGroups(status.newNode);\n\n  // STEP 2: Cancel GCD\n  // (5*3)/(2*3) -> 5/2\n  status = cancelGCD(newNode, gcd, numeratorValue, denominatorValue);\n  substeps.push(status);\n  newNode = Node.Status.resetChangeGroups(status.newNode);\n\n  return Node.Status.nodeChanged(\n      ChangeTypes.SIMPLIFY_FRACTION, fraction, newNode, true, substeps);\n}\n\n// Returns a substep where the GCD is factored out of numerator and denominator\n// e.g. 15/6 -> (5*3)/(2*3)\nfunction findGCD(node, gcd, numeratorValue, denominatorValue) {\n  let newNode = node.cloneDeep();\n\n  // manually set change group of the GCD nodes to be the same\n  const gcdNode = Node.Creator.constant(gcd);\n  gcdNode.changeGroup = 1;\n\n  const intermediateNumerator = Node.Creator.parenthesis(Node.Creator.operator(\n    '*', [Node.Creator.constant(numeratorValue/gcd), gcdNode]));\n  const intermediateDenominator = Node.Creator.parenthesis(Node.Creator.operator(\n    '*', [Node.Creator.constant(denominatorValue/gcd), gcdNode]));\n  newNode = Node.Creator.operator(\n    '/', [intermediateNumerator, intermediateDenominator]);\n\n  return Node.Status.nodeChanged(\n    ChangeTypes.FIND_GCD, node, newNode, false);\n}\n\n// Returns a substep where the GCD is cancelled out of numerator and denominator\n// e.g. (5*3)/(2*3) -> 5/2\nfunction cancelGCD(node, gcd, numeratorValue, denominatorValue) {\n  let newNode;\n  const newNumeratorNode = Node.Creator.constant(numeratorValue/gcd);\n  const newDenominatorNode = Node.Creator.constant(denominatorValue/gcd);\n\n  if (parseFloat(newDenominatorNode.value) === 1) {\n    newNode = newNumeratorNode;\n  }\n  else {\n    newNode = Node.Creator.operator(\n      '/', [newNumeratorNode, newDenominatorNode]);\n  }\n\n  return Node.Status.nodeChanged(\n    ChangeTypes.CANCEL_GCD, node, newNode, false);\n}\n\nmodule.exports = divideByGCD;\n","const divideByGCD = require('./divideByGCD');\nconst math = require('mathjs');\n\nconst ChangeTypes = require('../../ChangeTypes');\nconst evaluate = require('../../util/evaluate');\nconst Node = require('../../node');\n\n// Adds constant fractions -- can start from either step 1 or 2\n// 1A. Find the LCD if denominators are different and multiplies to make\n//     denominators equal, e.g. 2/3 + 4/6 --> (2*2)/(3*2) + 4/6\n// 1B. Multiplies out to make constant fractions again\n//     e.g. (2*2)/(3*2) + 4/6 -> 4/6 + 4/6\n// 2A. Combines numerators, e.g. 4/6 + 4/6 ->  e.g. 2/5 + 4/5 --> (2+4)/5\n// 2B. Adds numerators together, e.g. (2+4)/5 -> 6/5\n// Returns a Node.Status object with substeps\nfunction addConstantFractions(node) {\n  let newNode = node.cloneDeep();\n\n  if (!Node.Type.isOperator(node) || node.op !== '+') {\n    return Node.Status.noChange(node);\n  }\n  if (!node.args.every(n => Node.Type.isIntegerFraction(n, true))) {\n    return Node.Status.noChange(node);\n  }\n  const denominators = node.args.map(fraction => {\n    return parseFloat(evaluate(fraction.args[1]));\n  });\n\n  const substeps = [];\n  let status;\n\n  // 1A. First create the common denominator if needed\n  // e.g. 2/6 + 1/4 -> (2*2)/(6*2) + (1*3)/(4*3)\n  if (!denominators.every(denominator => denominator === denominators[0])) {\n    status = makeCommonDenominator(newNode);\n    substeps.push(status);\n    newNode = Node.Status.resetChangeGroups(status.newNode);\n\n    // 1B. Multiply out the denominators\n    status = evaluateDenominators(newNode);\n    substeps.push(status);\n    newNode = Node.Status.resetChangeGroups(status.newNode);\n\n    // 1B. Multiply out the numerators\n    status = evaluateNumerators(newNode);\n    substeps.push(status);\n    newNode = Node.Status.resetChangeGroups(status.newNode);\n  }\n\n  // 2A. Now that they all have the same denominator, combine the numerators\n  // e.g. 2/3 + 5/3 -> (2+5)/3\n  status = combineNumeratorsAboveCommonDenominator(newNode);\n  substeps.push(status);\n  newNode = Node.Status.resetChangeGroups(status.newNode);\n\n  // 2B. Finally, add the numerators together\n  status = addNumeratorsTogether(newNode);\n  substeps.push(status);\n  newNode = Node.Status.resetChangeGroups(status.newNode);\n\n  // 2C. If the numerator is 0, simplify to just 0\n  status = reduceNumerator(newNode);\n  if (status.hasChanged()) {\n    substeps.push(status);\n    newNode = Node.Status.resetChangeGroups(status.newNode);\n  }\n\n  // 2D. If we can simplify the fraction, do so\n  status = divideByGCD(newNode);\n  if (status.hasChanged()) {\n    substeps.push(status);\n    newNode = Node.Status.resetChangeGroups(status.newNode);\n  }\n\n  return Node.Status.nodeChanged(\n    ChangeTypes.ADD_FRACTIONS, node, newNode, true, substeps);\n}\n\n// Given a + operation node with a list of fraction nodes as args that all have\n// the same denominator, add them together. e.g. 2/3 + 5/3 -> (2+5)/3\n// Returns the new node.\nfunction combineNumeratorsAboveCommonDenominator(node) {\n  let newNode = node.cloneDeep();\n\n  const commonDenominator = newNode.args[0].args[1];\n  const numeratorArgs = [];\n  newNode.args.forEach(fraction => {\n    numeratorArgs.push(fraction.args[0]);\n  });\n  const newNumerator = Node.Creator.parenthesis(\n    Node.Creator.operator('+', numeratorArgs));\n\n  newNode = Node.Creator.operator('/', [newNumerator, commonDenominator]);\n  return Node.Status.nodeChanged(\n    ChangeTypes.COMBINE_NUMERATORS, node, newNode);\n}\n\n// Given a node with a numerator that is an addition node, will add\n// all the numerators and return the result\nfunction addNumeratorsTogether(node) {\n  const newNode = node.cloneDeep();\n\n  newNode.args[0] = Node.Creator.constant(evaluate(newNode.args[0]));\n  return Node.Status.nodeChanged(\n    ChangeTypes.ADD_NUMERATORS, node, newNode);\n}\n\nfunction reduceNumerator(node) {\n  let newNode = node.cloneDeep();\n\n  if (newNode.args[0].value === '0') {\n    newNode = Node.Creator.constant(0);\n    return Node.Status.nodeChanged(\n      ChangeTypes.REDUCE_ZERO_NUMERATOR, node, newNode);\n  }\n\n  return Node.Status.noChange(node);\n}\n\n// Takes `node`, a sum of fractions, and returns a node that's a sum of\n// fractions with denominators that evaluate to the same common denominator\n// e.g. 2/6 + 1/4 -> (2*2)/(6*2) + (1*3)/(4*3)\n// Returns the new node.\nfunction makeCommonDenominator(node) {\n  const newNode = node.cloneDeep();\n\n  const denominators = newNode.args.map(fraction => {\n    return parseFloat(fraction.args[1].value);\n  });\n  const commonDenominator = math.lcm(...denominators);\n\n  newNode.args.forEach((child, i) => {\n    // missingFactor is what we need to multiply the top and bottom by\n    // so that the denominator is the LCD\n    const missingFactor = commonDenominator / denominators[i];\n    if (missingFactor !== 1) {\n      const missingFactorNode = Node.Creator.constant(missingFactor);\n      const newNumerator = Node.Creator.parenthesis(\n        Node.Creator.operator('*', [child.args[0], missingFactorNode]));\n      const newDeominator = Node.Creator.parenthesis(\n        Node.Creator.operator('*', [child.args[1], missingFactorNode]));\n      newNode.args[i] = Node.Creator.operator('/', [newNumerator, newDeominator]);\n    }\n  });\n\n  return Node.Status.nodeChanged(\n    ChangeTypes.COMMON_DENOMINATOR, node, newNode);\n}\n\nfunction evaluateDenominators(node) {\n  const newNode = node.cloneDeep();\n\n  newNode.args.map(fraction => {\n    fraction.args[1] = Node.Creator.constant(evaluate(fraction.args[1]));\n  });\n\n  return Node.Status.nodeChanged(\n    ChangeTypes.MULTIPLY_DENOMINATORS, node, newNode);\n}\n\nfunction evaluateNumerators(node) {\n  const newNode = node.cloneDeep();\n\n  newNode.args.map(fraction => {\n    fraction.args[0] = Node.Creator.constant(evaluate(fraction.args[0]));\n  });\n\n  return Node.Status.nodeChanged(\n    ChangeTypes.MULTIPLY_NUMERATORS, node, newNode);\n}\n\nmodule.exports = addConstantFractions;\n","const addConstantFractions = require('./addConstantFractions');\n\nconst ChangeTypes = require('../../ChangeTypes');\nconst evaluate = require('../../util/evaluate');\nconst Node = require('../../node');\n\n// Adds a constant to a fraction by:\n// - collapsing the fraction to decimal if the constant is not an integer\n//   e.g. 5.3 + 1/2 -> 5.3 + 0.2\n// - turning the constant into a fraction with the same denominator if it is\n//   an integer, e.g. 5 + 1/2 -> 10/2 + 1/2\nfunction addConstantAndFraction(node) {\n  if (!Node.Type.isOperator(node) || node.op !== '+' || node.args.length !== 2) {\n    return Node.Status.noChange(node);\n  }\n\n  const firstArg = node.args[0];\n  const secondArg = node.args[1];\n  let constNode, fractionNode;\n  if (Node.Type.isConstant(firstArg)) {\n    if (Node.Type.isIntegerFraction(secondArg)) {\n      constNode = firstArg;\n      fractionNode = secondArg;\n    }\n    else {\n      return Node.Status.noChange(node);\n    }\n  }\n  else if (Node.Type.isConstant(secondArg)) {\n    if (Node.Type.isIntegerFraction(firstArg)) {\n      constNode = secondArg;\n      fractionNode = firstArg;\n    }\n    else {\n      return Node.Status.noChange(node);\n    }\n  }\n  else {\n    return Node.Status.noChange(node);\n  }\n\n  let newNode = node.cloneDeep();\n  let substeps = [];\n  // newConstNode and newFractionNode will end up both constants, or both\n  // fractions. I'm naming them based on their original form so we can keep\n  // track of which is which.\n  let newConstNode, newFractionNode;\n  let changeType;\n  if (Number.isInteger(parseFloat(constNode.value))) {\n    const denominatorNode = fractionNode.args[1];\n    const denominatorValue = parseInt(denominatorNode);\n    const constNodeValue = parseInt(constNode.value);\n    const newNumeratorNode = Node.Creator.constant(\n      constNodeValue * denominatorValue);\n    newConstNode = Node.Creator.operator(\n      '/', [newNumeratorNode, denominatorNode]);\n    newFractionNode = fractionNode;\n    changeType = ChangeTypes.CONVERT_INTEGER_TO_FRACTION;\n  }\n  else {\n    // round to 4 decimal places\n    let dividedValue = evaluate(fractionNode);\n    if (dividedValue < 1) {\n      dividedValue = parseFloat(dividedValue.toPrecision(4));\n    }\n    else {\n      dividedValue = parseFloat(dividedValue.toFixed(4));\n    }\n    newFractionNode = Node.Creator.constant(dividedValue);\n    newConstNode = constNode;\n    changeType = ChangeTypes.DIVIDE_FRACTION_FOR_ADDITION;\n  }\n\n  if (Node.Type.isConstant(firstArg)) {\n    newNode.args[0] = newConstNode;\n    newNode.args[1] = newFractionNode;\n  }\n  else {\n    newNode.args[0] = newFractionNode;\n    newNode.args[1] = newConstNode;\n  }\n\n  substeps.push(Node.Status.nodeChanged(changeType, node, newNode));\n  newNode = Node.Status.resetChangeGroups(newNode);\n\n  // If we changed an integer to a fraction, we need to add the steps for\n  // adding the fractions.\n  if (changeType === ChangeTypes.CONVERT_INTEGER_TO_FRACTION) {\n    const addFractionStatus = addConstantFractions(newNode);\n    substeps = substeps.concat(addFractionStatus.substeps);\n  }\n  // Otherwise, add the two constants\n  else {\n    const evalNode = Node.Creator.constant(evaluate(newNode));\n    substeps.push(Node.Status.nodeChanged(\n      ChangeTypes.SIMPLIFY_ARITHMETIC, newNode, evalNode));\n  }\n\n  const lastStep = substeps[substeps.length - 1];\n  newNode = Node.Status.resetChangeGroups(lastStep.newNode);\n\n  return Node.Status.nodeChanged(\n    ChangeTypes.SIMPLIFY_ARITHMETIC, node, newNode, true, substeps);\n}\n\nmodule.exports = addConstantAndFraction;\n","const addConstantAndFraction = require('../fractionsSearch/addConstantAndFraction');\nconst addConstantFractions = require('../fractionsSearch/addConstantFractions');\nconst arithmeticSearch = require('../arithmeticSearch');\n\nconst ChangeTypes = require('../../ChangeTypes');\nconst Node = require('../../node');\n\n// Evaluates a sum of constant numbers and integer fractions to a single\n// constant number or integer fraction. e.g. e.g. 2/3 + 5 + 5/2 => 49/6\n// Returns a Node.Status object.\nfunction evaluateConstantSum(node) {\n  if (Node.Type.isParenthesis(node)) {\n    node = node.content;\n  }\n  if (!Node.Type.isOperator(node) || node.op !== '+') {\n    return Node.Status.noChange(node);\n  }\n  if (node.args.some(node => !Node.Type.isConstantOrConstantFraction(node))) {\n    return Node.Status.noChange(node);\n  }\n\n  // functions needed to evaluate the sum\n  const summingFunctions = [\n    arithmeticSearch,\n    addConstantFractions,\n    addConstantAndFraction,\n  ];\n  for (let i = 0; i < summingFunctions.length; i++) {\n    const status = summingFunctions[i](node);\n    if (status.hasChanged()) {\n      if (Node.Type.isConstantOrConstantFraction(status.newNode)) {\n        return status;\n      }\n    }\n  }\n\n  let newNode = node.cloneDeep();\n  const substeps = [];\n  let status;\n\n  // STEP 1: group fractions and constants separately\n  status = groupConstantsAndFractions(newNode);\n  substeps.push(status);\n  newNode = Node.Status.resetChangeGroups(status.newNode);\n\n  const constants = newNode.args[0];\n  const fractions = newNode.args[1];\n\n  // STEP 2A: evaluate arithmetic IF there's > 1 constant\n  // (which is the case if it's a list surrounded by parenthesis)\n  if (Node.Type.isParenthesis(constants)) {\n    const constantList = constants.content;\n    const evaluateStatus = arithmeticSearch(constantList);\n    status = Node.Status.childChanged(newNode, evaluateStatus, 0);\n    substeps.push(status);\n    newNode = Node.Status.resetChangeGroups(status.newNode);\n  }\n\n  // STEP 2B: add fractions IF there's > 1 fraction\n  // (which is the case if it's a list surrounded by parenthesis)\n  if (Node.Type.isParenthesis(fractions)) {\n    const fractionList = fractions.content;\n    const evaluateStatus = addConstantFractions(fractionList);\n    status = Node.Status.childChanged(newNode, evaluateStatus, 1);\n    substeps.push(status);\n    newNode = Node.Status.resetChangeGroups(status.newNode);\n  }\n\n  // STEP 3: combine the evaluated constant and fraction\n  // the fraction might have simplified to a constant (e.g. 1/3 + 2/3 -> 2)\n  // so we just call evaluateConstantSum again to cycle through\n  status = evaluateConstantSum(newNode);\n  substeps.push(status);\n  newNode = Node.Status.resetChangeGroups(status.newNode);\n\n  return Node.Status.nodeChanged(\n    ChangeTypes.SIMPLIFY_ARITHMETIC, node, newNode, true, substeps);\n}\n\n// If we can't combine using one of those functions, there's a mix of > 2\n// fractions and constants. So we need to group them together so we can later\n// add them.\n// Expects a node that is a sum of integer fractions and constants.\n// Returns a Node.Status object.\n// e.g. 2/3 + 5 + 5/2 => (2/3 + 5/2) + 5\nfunction groupConstantsAndFractions(node) {\n  let fractions = node.args.filter(Node.Type.isIntegerFraction);\n  let constants = node.args.filter(Node.Type.isConstant);\n\n  if (fractions.length === 0 || constants.length === 0) {\n    throw Error('expected both integer fractions and constants, got ' + node);\n  }\n\n  if (fractions.length + constants.length !== node.args.length) {\n    throw Error('can only evaluate integer fractions and constants');\n  }\n\n  constants = constants.map(node => {\n    // set the changeGroup - this affects both the old and new node\n    node.changeGroup = 1;\n    // clone so that node and newNode aren't stored in the same memory\n    return node.cloneDeep();\n  });\n  // wrap in parenthesis if there's more than one, to group them\n  if (constants.length > 1) {\n    constants = Node.Creator.parenthesis(Node.Creator.operator('+', constants));\n  }\n  else {\n    constants = constants[0];\n  }\n\n  fractions = fractions.map(node => {\n    // set the changeGroup - this affects both the old and new node\n    node.changeGroup = 2;\n    // clone so that node and newNode aren't stored in the same memory\n    return node.cloneDeep();\n  });\n  // wrap in parenthesis if there's more than one, to group them\n  if (fractions.length > 1) {\n    fractions = Node.Creator.parenthesis(Node.Creator.operator('+', fractions));\n  }\n  else {\n    fractions = fractions[0];\n  }\n\n  const newNode = Node.Creator.operator('+', [constants, fractions]);\n  return Node.Status.nodeChanged(\n    ChangeTypes.COLLECT_LIKE_TERMS, node, newNode);\n}\n\nmodule.exports = evaluateConstantSum;\n","const checks = require('../../checks');\nconst evaluateConstantSum = require('./evaluateConstantSum');\n\nconst ChangeTypes = require('../../ChangeTypes');\nconst Node = require('../../node');\n\n// If possible, adds together a list of nodes . Returns a Node.Status object.\nfunction addLikeTerms(node, polynomialOnly=false) {\n  if (!Node.Type.isOperator(node)) {\n    return Node.Status.noChange(node);\n  }\n  let status;\n\n  if (!polynomialOnly) {\n    status = evaluateConstantSum(node);\n    if (status.hasChanged()) {\n      return status;\n    }\n  }\n\n  status = addLikePolynomialTerms(node);\n  if (status.hasChanged()) {\n    return status;\n  }\n\n  status = addLikeNthRootTerms(node);\n  if (status.hasChanged()) {\n    return status;\n  }\n\n  return Node.Status.noChange(node);\n}\n\n// If possible, adds together a list of polynomial term nodes.\nfunction addLikePolynomialTerms(node) {\n  if (!checks.canAddLikeTerms.canAddLikeTermPolynomialNodes(node)) {\n    return Node.Status.noChange(node);\n  }\n\n  return addLikeTermNodes(\n    node, Node.PolynomialTerm, ChangeTypes.ADD_POLYNOMIAL_TERMS);\n}\n\n// If possible, adds together a list of nth root term nodes.\nfunction addLikeNthRootTerms(node) {\n  if (!checks.canAddLikeTerms.canAddLikeTermNthRootNodes(node)) {\n    return Node.Status.noChange(node);\n  }\n\n  return addLikeTermNodes(\n    node, Node.NthRootTerm, ChangeTypes.ADD_NTH_ROOTS);\n}\n\n// Helper function for adding together a list of nodes\n// belonging to a subclass of Term\nfunction addLikeTermNodes(node, termSubclass, changeType) {\n  const substeps = [];\n  let newNode = node.cloneDeep();\n\n  // STEP 1: If any nodes have no coefficient, make it have coefficient 1\n  // (this step only happens under certain conditions and later steps might\n  // happen even if step 1 does not)\n  let status = addPositiveOneCoefficient(newNode, termSubclass);\n  if (status.hasChanged()) {\n    substeps.push(status);\n    newNode = Node.Status.resetChangeGroups(status.newNode);\n  }\n\n  // STEP 2: If any nodes have a unary minus, make it have coefficient -1\n  // (this step only happens under certain conditions and later steps might\n  // happen even if step 2 does not)\n  status = addNegativeOneCoefficient(newNode, termSubclass);\n  if (status.hasChanged()) {\n    substeps.push(status);\n    newNode = Node.Status.resetChangeGroups(status.newNode);\n  }\n\n  // STEP 3: group the coefficients in a sum\n  status = groupCoefficientsForAdding(newNode, termSubclass);\n  substeps.push(status);\n  newNode = Node.Status.resetChangeGroups(status.newNode);\n\n  // STEP 4: evaluate the sum (could include fractions)\n  status = evaluateCoefficientSum(newNode, termSubclass);\n  substeps.push(status);\n  newNode = Node.Status.resetChangeGroups(status.newNode);\n\n  return Node.Status.nodeChanged(\n    changeType, node, newNode, true, substeps);\n}\n\n// Given a sum of like terms, changes any term with no coefficient\n// into a term with an explicit coefficient of 1. This is for pedagogy, and\n// makes the adding coefficients step clearer.\n// e.g. 2x + x -> 2x + 1x\n// Returns a Node.Status object.\nfunction addPositiveOneCoefficient(node, termSubclass) {\n  const newNode = node.cloneDeep();\n  let change = false;\n\n  let changeGroup = 1;\n  newNode.args.forEach((child, i) => {\n    const term = new termSubclass(child);\n    if (term.getCoeffValue() === 1) {\n      newNode.args[i] = Node.Creator.term(\n        term.getBaseNode(),\n        term.getExponentNode(),\n        Node.Creator.constant(1),\n        true /* explicit coefficient */);\n\n      newNode.args[i].changeGroup = changeGroup;\n      node.args[i].changeGroup = changeGroup; // note that this is the \"oldNode\"\n\n      change = true;\n      changeGroup++;\n    }\n  });\n\n  if (change) {\n    return Node.Status.nodeChanged(\n        ChangeTypes.ADD_COEFFICIENT_OF_ONE, node, newNode, false);\n  }\n  else {\n    return Node.Status.noChange(node);\n  }\n}\n\n// Given a sum of like terms, changes any term with a unary minus\n// coefficient into a term with an explicit coefficient of -1. This is for\n// pedagogy, and makes the adding coefficients step clearer.\n// e.g. 2x - x -> 2x - 1x\n// Returns a Node.Status object.\nfunction addNegativeOneCoefficient(node, termSubclass) {\n  const newNode = node.cloneDeep();\n  let change = false;\n\n  let changeGroup = 1;\n  newNode.args.forEach((child, i) => {\n    const term = new termSubclass(child);\n    if (term.getCoeffValue() === -1) {\n      newNode.args[i] = Node.Creator.term(\n        term.getBaseNode(),\n        term.getExponentNode(),\n        term.getCoeffNode(),\n        true /* explicit -1 coefficient */);\n\n      node.args[i].changeGroup = changeGroup; // note that this is the \"oldNode\"\n      newNode.args[i].changeGroup = changeGroup;\n\n      change = true;\n      changeGroup++;\n    }\n  });\n\n  if (change) {\n    return Node.Status.nodeChanged(\n      ChangeTypes.UNARY_MINUS_TO_NEGATIVE_ONE, node, newNode, false);\n  }\n  else {\n    return Node.Status.noChange(node);\n  }\n}\n\n// Given a sum of like terms, groups the coefficients\n// e.g. 2x^2 + 3x^2 + 5x^2 -> (2+3+5)x^2\n// Returns a Node.Status object.\nfunction groupCoefficientsForAdding(node, termSubclass) {\n  let newNode = node.cloneDeep();\n\n  const termList = newNode.args.map(n => new termSubclass(n));\n  const coefficientList = termList.map(term => term.getCoeffNode(true));\n  const sumOfCoefficents = Node.Creator.parenthesis(\n    Node.Creator.operator('+', coefficientList));\n  // TODO: changegroups should also be on the before node, on all the\n  // coefficients, but changegroups with term gets messy so let's tackle\n  // that later.\n  sumOfCoefficents.changeGroup = 1;\n\n  // terms that can be added together must share the same base\n  // name and exponent. Get that base and exponent from the first term\n  const firstTerm = termList[0];\n  const exponentNode = firstTerm.getExponentNode();\n  const baseNode = firstTerm.getBaseNode();\n  newNode = Node.Creator.term(\n    baseNode, exponentNode, sumOfCoefficents);\n\n  return Node.Status.nodeChanged(\n    ChangeTypes.GROUP_COEFFICIENTS, node, newNode, false);\n}\n\n// Given a node of the form (2 + 4 + 5)x -- ie the coefficients have been\n// grouped for adding -- add the coefficients together to make a new coeffient\n// that is a constant or constant fraction.\nfunction evaluateCoefficientSum(node) {\n  // the node is now always a * node with the left child the coefficent sum\n  // e.g. (2 + 4 + 5) and the right node the symbol part e.g. x or y^2\n  // so we want to evaluate args[0]\n  const coefficientSum = node.cloneDeep().args[0];\n  const childStatus = evaluateConstantSum(coefficientSum);\n  return Node.Status.childChanged(node, childStatus, 0);\n}\n\nmodule.exports = addLikeTerms;\n","const ChangeTypes = require('../../ChangeTypes');\nconst Node = require('../../node');\nconst TreeSearch = require('../../TreeSearch');\n\n// If `node` is a product of terms where:\n// 1) at least one is a fraction\n// 2) either none are polynomial terms, OR\n//    at least one has a symbol in the denominator\n// then multiply them together.\n// e.g. 2 * 5/x -> (2*5)/x\n// e.g. 3 * 1/5 * 5/9 = (3*1*5)/(5*9)\n// e.g. 2x * 1/x -> (2x*1) / x\n// NOTE: The reason we exclude the case of polynomial terms is because\n// we do not want to combine 9/2 * x -> 9x / 2 (which is less readable).\n// Cases like 5/2 * x * y/5 will be handled in collect and combine.\n// TODO: add a step somewhere to remove common terms in numerator and\n// denominator (so the 5s would cancel out on the next step after this)\n// This step must happen after things have been distributed, or else the answer\n// will be formatted badly, so it's a tree search of its own.\n// Returns a Node.Status object.\nconst search = TreeSearch.postOrder(multiplyFractions);\n\nfunction multiplyFractions(node) {\n  if (!Node.Type.isOperator(node) || node.op !== '*') {\n    return Node.Status.noChange(node);\n  }\n\n  // we need to use the verbose syntax for `some` here because isFraction\n  // can take more than one parameter\n  const atLeastOneFraction = node.args.some(\n    arg => Node.CustomType.isFraction(arg));\n  const hasPolynomialTerms = node.args.some(Node.PolynomialTerm.isPolynomialTerm);\n  const hasPolynomialInDenominatorTerms = node.args.some(hasPolynomialInDenominator);\n\n  if (!atLeastOneFraction || (hasPolynomialTerms && !hasPolynomialInDenominatorTerms)) {\n    return Node.Status.noChange(node);\n  }\n\n  const numeratorArgs = [];\n  const denominatorArgs = [];\n  node.args.forEach(operand => {\n    if (Node.CustomType.isFraction(operand)) {\n      const fraction = Node.CustomType.getFraction(operand);\n      numeratorArgs.push(fraction.args[0]);\n      denominatorArgs.push(fraction.args[1]);\n    }\n    else {\n      numeratorArgs.push(operand);\n    }\n  });\n\n  const newNumerator = Node.Creator.parenthesis(\n    Node.Creator.operator('*', numeratorArgs));\n  const newDenominator = denominatorArgs.length === 1\n    ? denominatorArgs[0]\n    : Node.Creator.parenthesis(Node.Creator.operator('*', denominatorArgs));\n\n  const newNode = Node.Creator.operator('/', [newNumerator, newDenominator]);\n  return Node.Status.nodeChanged(\n    ChangeTypes.MULTIPLY_FRACTIONS, node, newNode);\n}\n\n// Returns true if `node` has a polynomial in the denominator,\n// e.g. 5/x or 1/2x^2\nfunction hasPolynomialInDenominator(node) {\n  if (!(Node.CustomType.isFraction(node))) {\n    return false;\n  }\n\n  const fraction = Node.CustomType.getFraction(node);\n  const denominator = fraction.args[1];\n  return Node.PolynomialTerm.isPolynomialTerm(denominator);\n}\n\nmodule.exports = search;\n","const arithmeticSearch = require('../arithmeticSearch');\nconst checks = require('../../checks');\nconst ConstantOrConstantPower = require('./ConstantOrConstantPower');\nconst multiplyFractionsSearch = require('../multiplyFractionsSearch');\n\nconst ChangeTypes = require('../../ChangeTypes');\nconst Node = require('../../node');\nconst NthRoot = require('../functionsSearch/nthRoot');\n\n// Multiplies a list of nodes that are polynomial or constant power like terms.\n// Returns a node.\n// The polynomial nodes should *not* have coefficients. (multiplying\n// coefficients is handled in collecting like terms for multiplication)\nfunction multiplyLikeTerms(node, polynomialOnly=false) {\n  if (!Node.Type.isOperator(node)) {\n    return Node.Status.noChange(node);\n  }\n  let status;\n\n  if (!polynomialOnly && !checks.canMultiplyLikeTermConstantNodes(node)) {\n    status = arithmeticSearch(node);\n    if (status.hasChanged()) {\n      status.changeType = ChangeTypes.MULTIPLY_COEFFICIENTS;\n      return status;\n    }\n\n    status = multiplyFractionsSearch(node);\n    if (status.hasChanged()) {\n      status.changeType = ChangeTypes.MULTIPLY_COEFFICIENTS;\n      return status;\n    }\n  }\n\n  status = multiplyPolynomialTerms(node);\n  if (status.hasChanged()) {\n    status.changeType = ChangeTypes.MULTIPLY_COEFFICIENTS;\n    return status;\n  }\n\n  status = multiplyNthRoots(node);\n  if (status.hasChanged()) {\n    return status;\n  }\n\n  return Node.Status.noChange(node);\n}\n\nfunction multiplyNthRoots(node) {\n  if (!checks.canMultiplyLikeTermsNthRoots(node)){\n    return Node.Status.noChange(node);\n  }\n\n  let newNode = node.cloneDeep();\n\n  // Array of radicands of all the nthRoot terms being multiplied\n  const radicands = node.args.map(term => NthRoot.getRadicandNode(term));\n\n  // Multiply them\n  const newRadicandNode = Node.Creator.operator('*', radicands);\n\n  // All the args at this point have the same root,\n  // so we arbitrarily take the first one\n  const firstArg = node.args[0];\n  const rootNode = NthRoot.getRootNode(firstArg);\n\n  newNode = Node.Creator.nthRoot(newRadicandNode, rootNode);\n\n  return Node.Status.nodeChanged(ChangeTypes.MULTIPLY_NTH_ROOTS, node, newNode, false);\n}\n\nfunction multiplyPolynomialTerms(node) {\n  if (!checks.canMultiplyLikeTermPolynomialNodes(node) &&\n      !checks.canMultiplyLikeTermConstantNodes(node)) {\n    return Node.Status.noChange(node);\n  }\n\n  const substeps = [];\n  let newNode = node.cloneDeep();\n\n  // STEP 1: If any term has no exponent, make it have exponent 1\n  // e.g. x -> x^1 (this is for pedagogy reasons)\n  // (this step only happens under certain conditions and later steps might\n  // happen even if step 1 does not)\n  let status = addOneExponent(newNode);\n  if (status.hasChanged()) {\n    substeps.push(status);\n    newNode = Node.Status.resetChangeGroups(status.newNode);\n  }\n\n  // STEP 2: collect exponents to a single exponent sum\n  // e.g. x^1 * x^3 -> x^(1+3)\n  // e.g. 10^2 * 10^3 -> 10^(2+3)\n  if (checks.canMultiplyLikeTermConstantNodes(node)) {\n    status = collectConstantExponents(newNode);\n  }\n  else {\n    status = collectPolynomialExponents(newNode);\n  }\n  substeps.push(status);\n  newNode = Node.Status.resetChangeGroups(status.newNode);\n\n  // STEP 3: add exponents together.\n  // NOTE: This might not be a step if the exponents aren't all constants,\n  // but this case isn't that common and can be caught in other steps.\n  // e.g. x^(2+4+z)\n  // TODO: handle fractions, combining and collecting like terms, etc, here\n  const exponentSum = newNode.args[1].content;\n  const sumStatus = arithmeticSearch(exponentSum);\n  if (sumStatus.hasChanged()) {\n    status = Node.Status.childChanged(newNode, sumStatus, 1);\n    substeps.push(status);\n    newNode = Node.Status.resetChangeGroups(status.newNode);\n  }\n\n  if (substeps.length === 1) { // possible if only step 2 happens\n    return substeps[0];\n  }\n  else {\n    return Node.Status.nodeChanged(\n      ChangeTypes.MULTIPLY_POLYNOMIAL_TERMS,\n      node, newNode, true, substeps);\n  }\n}\n\n// Given a product of polynomial or constant terms, changes any\n// term with no exponent\n// into a term with an explicit exponent of 1. This is for pedagogy, and\n// makes the adding exponents step clearer.\n// e.g. x^2 * x -> x^2 * x^1\n// e.g. 10^2 * 10 -> 10^2 * 10^1\n// Returns a Node.Status object.\nfunction addOneExponent(node) {\n  const newNode = node.cloneDeep();\n  let change = false;\n\n  let changeGroup = 1;\n  if (checks.canMultiplyLikeTermConstantNodes(node)) {\n    newNode.args.forEach((child, i) => {\n      if (Node.Type.isConstant(child)) { // true if child is a constant node, e.g 3\n        const base = ConstantOrConstantPower.getBaseNode(child);\n        const exponent = Node.Creator.constant(1);\n        newNode.args[i] = Node.Creator.operator('^', [base, exponent]);\n\n        newNode.args[i].changeGroup = changeGroup;\n        node.args[i].changeGroup = changeGroup; // note that this is the \"oldNode\"\n\n        change = true;\n        changeGroup++;\n      }\n    });\n  }\n  else {\n    newNode.args.forEach((child, i) => {\n      const polyTerm = new Node.PolynomialTerm(child);\n      if (!polyTerm.getExponentNode()) {\n        newNode.args[i] = Node.Creator.polynomialTerm(\n          polyTerm.getSymbolNode(),\n          Node.Creator.constant(1),\n          polyTerm.getCoeffNode());\n\n        newNode.args[i].changeGroup = changeGroup;\n        node.args[i].changeGroup = changeGroup; // note that this is the \"oldNode\"\n\n        change = true;\n        changeGroup++;\n      }\n    });\n  }\n\n  if (change) {\n    return Node.Status.nodeChanged(\n      ChangeTypes.ADD_EXPONENT_OF_ONE, node, newNode, false);\n  }\n  else {\n    return Node.Status.noChange(node);\n  }\n}\n\n// Given a product of constant terms, groups the exponents into a sum\n// e.g. 10^2 * 10^3 -> 10^(2+3)\n// Returns a Node.Status object.\nfunction collectConstantExponents(node) {\n  // If we're multiplying constant nodes together, they all share the same\n  // base. Get that from the first node.\n  const baseNode = ConstantOrConstantPower.getBaseNode(node.args[0]);\n  // The new exponent will be a sum of exponents (an operation, wrapped in\n  // parens) e.g. 10^(3+4+5)\n  const exponentNodeList = node.args.map(\n    ConstantOrConstantPower.getExponentNode);\n  const newExponent = Node.Creator.parenthesis(\n    Node.Creator.operator('+', exponentNodeList));\n  const newNode = Node.Creator.operator('^', [baseNode, newExponent]);\n  return Node.Status.nodeChanged(\n    ChangeTypes.COLLECT_CONSTANT_EXPONENTS, node, newNode);\n}\n\n// Given a product of polynomial terms, groups the exponents into a sum\n// e.g. x^2 * x^3 * x^1 -> x^(2 + 3 + 1)\n// Returns a Node.Status object.\nfunction collectPolynomialExponents(node) {\n  const polynomialTermList = node.args.map(n => new Node.PolynomialTerm(n));\n\n  // If we're multiplying polynomial nodes together, they all share the same\n  // symbol. Get that from the first node.\n  const symbolNode = polynomialTermList[0].getSymbolNode();\n\n  // The new exponent will be a sum of exponents (an operation, wrapped in\n  // parens) e.g. x^(3+4+5)\n  const exponentNodeList = polynomialTermList.map(p => p.getExponentNode(true));\n  const newExponent = Node.Creator.parenthesis(\n    Node.Creator.operator('+', exponentNodeList));\n  const newNode = Node.Creator.polynomialTerm(symbolNode, newExponent, null);\n  return Node.Status.nodeChanged(\n    ChangeTypes.COLLECT_POLYNOMIAL_EXPONENTS, node, newNode);\n}\n\nmodule.exports = multiplyLikeTerms;\n","// Collects and combines like terms\n\nconst addLikeTerms = require('./addLikeTerms');\nconst checks = require('../../checks');\nconst multiplyLikeTerms = require('./multiplyLikeTerms');\n\nconst ChangeTypes = require('../../ChangeTypes');\nconst LikeTermCollector = require('./LikeTermCollector');\nconst Node = require('../../node');\nconst TreeSearch = require('../../TreeSearch');\n\nconst termCollectorFunctions = {\n  '+': addLikeTerms,\n  '*': multiplyLikeTerms\n};\n\n// Iterates through the tree looking for like terms to collect and combine.\n// Will prioritize deeper expressions. Returns a Node.Status object.\nconst search = TreeSearch.postOrder(collectAndCombineLikeTerms);\n\n// Given an operator node, maybe collects and then combines if possible\n// e.g. 2x + 4x + y => 6x + y\n// e.g. 2x * x^2 * 5x => 10 x^4\nfunction collectAndCombineLikeTerms(node) {\n  if (node.op === '+') {\n    const status = collectAndCombineOperation(node);\n    if (status.hasChanged()) {\n      return status;\n    }\n    // we might also be able to just combine if they're all the same term\n    // e.g. 2x + 4x + x (doesn't need collecting)\n    return addLikeTerms(node, true);\n  }\n  else if (node.op === '*') {\n    // collect and combine involves there being coefficients pulled the front\n    // e.g. 2x * x^2 * 5x => (2*5) * (x * x^2 * x) => ... => 10 x^4\n    if (checks.canMultiplyLikeTermConstantNodes(node)) {\n      return multiplyLikeTerms(node, true);\n    }\n    const status = collectAndCombineOperation(node);\n    if (status.hasChanged()) {\n      // make sure there's no * between the coefficient and the symbol part\n      status.newNode.implicit = true;\n      return status;\n    }\n    // we might also be able to just combine polynomial terms\n    // e.g. x * x^2 * x => ... => x^4\n    return multiplyLikeTerms(node, true);\n  }\n  else {\n    return Node.Status.noChange(node);\n  }\n}\n\n// Collects and combines (if possible) the arguments of an addition or\n// multiplication\nfunction collectAndCombineOperation(node) {\n  let substeps = [];\n\n  const status = LikeTermCollector.collectLikeTerms(node.cloneDeep());\n  if (!status.hasChanged()) {\n    return status;\n  }\n\n  // STEP 1: collect like terms, e.g. 2x + 4x^2 + 5x => 4x^2 + (2x + 5x)\n  substeps.push(status);\n  let newNode = Node.Status.resetChangeGroups(status.newNode);\n\n  // STEP 2 onwards: combine like terms for each group that can be combined\n  // e.g. (x + 3x) + (2 + 2) has two groups\n  const combineSteps = combineLikeTerms(newNode);\n  if (combineSteps.length > 0) {\n    substeps = substeps.concat(combineSteps);\n    const lastStep = combineSteps[combineSteps.length - 1];\n    newNode = Node.Status.resetChangeGroups(lastStep.newNode);\n  }\n\n  return Node.Status.nodeChanged(\n    ChangeTypes.COLLECT_AND_COMBINE_LIKE_TERMS,\n    node, newNode, true, substeps);\n}\n\n// step 2 onwards for collectAndCombineOperation\n// combine like terms for each group that can be combined\n// e.g. (x + 3x) + (2 + 2) has two groups\n// returns a list of combine steps\nfunction combineLikeTerms(node) {\n  const steps = [];\n  let newNode = node.cloneDeep();\n\n  for (let i = 0; i < node.args.length; i++) {\n    let child = node.args[i];\n    // All groups of terms will be surrounded by parenthesis\n    if (!Node.Type.isParenthesis(child)) {\n      continue;\n    }\n    child = child.content;\n    const childStatus = termCollectorFunctions[newNode.op](child);\n    if (childStatus.hasChanged()) {\n      const status = Node.Status.childChanged(newNode, childStatus, i);\n      steps.push(status);\n      newNode = Node.Status.resetChangeGroups(status.newNode);\n    }\n  }\n\n  return steps;\n}\n\nmodule.exports = search;\n","const arithmeticSearch = require('../arithmeticSearch');\nconst collectAndCombineSearch = require('../collectAndCombineSearch');\nconst rearrangeCoefficient = require('../basicsSearch/rearrangeCoefficient');\n\nconst ChangeTypes = require('../../ChangeTypes');\nconst Negative = require('../../Negative');\nconst Node = require('../../node');\nconst TreeSearch = require('../../TreeSearch');\n\nconst search = TreeSearch.postOrder(distribute);\n\n// Distributes through parenthesis.\n// e.g. 2(x+3) -> (2*x + 2*3)\n// e.g. -(x+5) -> (-x + -5)\n// Returns a Node.Status object.\nfunction distribute(node) {\n  if (Node.Type.isUnaryMinus(node)) {\n    return distributeUnaryMinus(node);\n  }\n  else if (Node.Type.isOperator(node, '*')) {\n    return distributeAndSimplifyMultiplication(node);\n  }\n  else if (Node.Type.isOperator(node, '^')) {\n    return expandBase(node);\n  }\n  else {\n    return Node.Status.noChange(node);\n  }\n}\n\n// Expand a power node with a non-constant base and a positive exponent > 1\n// e.g. (nthRoot(x, 2))^2 -> nthRoot(x, 2) * nthRoot(x, 2)\n// e.g. (2x + 3)^2 -> (2x + 3) (2x + 3)\nfunction expandBase (node) {\n  // Must be a power node and the exponent must be a constant\n  // Base must either be an nthRoot or sum of terms\n  if (!Node.Type.isOperator(node, '^')) {\n    return Node.Status.noChange(node);\n  }\n\n  const base = Node.Type.isParenthesis(node.args[0])\n        ? node.args[0].content\n        : node.args[0];\n\n  const exponent = Node.Type.isParenthesis(node.args[1])\n        ? node.args[1].content\n        : node.args[1];\n\n  const exponentValue = parseFloat(exponent.value);\n\n  // Exponent should be a positive integer\n  if (!(Number.isInteger(exponentValue) && exponentValue > 1)) {\n    return Node.Status.noChange(node);\n  }\n\n  if (!Node.Type.isFunction(base, 'nthRoot') && !(Node.Type.isOperator(base, '+') || Node.Type.isOperator(base, '*') || Node.Type.isOperator(base, '/'))) {\n    return Node.Status.noChange(node);\n  }\n\n  // If the base is an nthRoot node, it doesn't need the parenthesis\n  const expandedBase = Node.Type.isFunction(base, 'nthRoot')\n        ? base\n        : node.args[0];\n  let expandedNode\n  const substeps = [];\n  let status;\n\n\n  if (Node.Type.isFunction(base, 'nthRoot')) {\n    expandedNode = Node.Creator.operator('*', Array(parseFloat(exponent.value)).fill(expandedBase));\n    return Node.Status.nodeChanged(\n      ChangeTypes.EXPAND_EXPONENT, node, expandedNode, false);\n  } else if (Node.Type.isOperator(base, '+')) {\n    // fpiou (modification du code pour permettre le développement (a+b)^2 = a^2+2*a*b+b^2))\n    acarre = Node.Creator.operator('^',[base.args[0],exponent])\n    bcarre = Node.Creator.operator('^',[base.args[1],exponent]) \n    doubleproduit = Node.Creator.operator('*',[ Node.Creator.constant(2),Node.Creator.operator('*',base.args)])\n    expandedNode = Node.Creator.operator('+',[acarre,doubleproduit,bcarre])\n    status = Node.Status.nodeChanged(\n      ChangeTypes.EXPAND_EXPONENT, node, expandedNode, false)\n    substeps.push(status);\n    newNode = Node.Status.resetChangeGroups(status.newNode);\n    const childStatus = simplify(newNode);\n    if (childStatus.hasChanged()) {\n      status = Node.Status.childChanged(newNode, childStatus);\n      substeps.push(status);\n      newNode = Node.Status.resetChangeGroups(status.newNode);\n    }\n    if (substeps.length === 1) {\n      return substeps[0];\n    }\n    return Node.Status.nodeChanged(\n      ChangeTypes.DISTRIBUTE, node, newNode, false, substeps);\n  } else if (Node.Type.isOperator(base, '*')) {\n    // fpiou (modification du code pour permettre le \"développement\" (a*b)^2 = a^2*b^2))\n    for (let i=0;i<base.args.length;i++) {\n      base.args[i] = Node.Creator.operator('^',[base.args[i],exponent])\n    }\n    return Node.Status.nodeChanged(\n      ChangeTypes.EXPAND_EXPONENT, node, base, false);\n  } else if (Node.Type.isOperator(base, '/')) {\n    for (let i=0;i<2;i++) {\n      base.args[i] = Node.Creator.operator('^',[base.args[i],exponent])\n    }\n    return Node.Status.nodeChanged(\n      ChangeTypes.EXPAND_EXPONENT, node, base, false);\n  }\n}\n\n// Distributes unary minus into a parenthesis node.\n// e.g. -(4*9*x^2) --> (-4 * 9  * x^2)\n// e.g. -(x + y - 5) --> (-x + -y + 5)\n// Returns a Node.Status object.\nfunction distributeUnaryMinus(node) {\n  if (!Node.Type.isUnaryMinus(node)) {\n    return Node.Status.noChange(node);\n  }\n  const unaryContent = node.args[0];\n  if (!Node.Type.isParenthesis(unaryContent)) {\n    return Node.Status.noChange(node);\n  }\n  const content = unaryContent.content;\n  if (!Node.Type.isOperator(content)) {\n    return Node.Status.noChange(node);\n  }\n  const newContent = content.cloneDeep();\n  node.changeGroup = 1;\n  // For multiplication and division, we can push the unary minus in to\n  // the first argument.\n  // e.g. -(2/3) -> (-2/3)    -(4*9*x^2) --> (-4 * 9  * x^2)\n  if (content.op === '*' || content.op === '/') {\n    newContent.args[0] = Negative.negate(newContent.args[0]);\n    newContent.args[0].changeGroup = 1;\n    const newNode = Node.Creator.parenthesis(newContent);\n    return Node.Status.nodeChanged(\n      ChangeTypes.DISTRIBUTE_NEGATIVE_ONE, node, newNode, false);\n  }\n  else if (content.op === '+') {\n    // Now we know `node` is of the form -(x + y + ...).\n    // We want to now return (-x + -y + ....)\n    // If any term is negative, we make it positive it right away\n    // e.g. -(2-4) => -2 + 4\n    const newArgs = newContent.args.map(arg => {\n      const newArg = Negative.negate(arg);\n      newArg.changeGroup = 1;\n      return newArg;\n    });\n    newContent.args = newArgs;\n    const newNode = Node.Creator.parenthesis(newContent);\n    return Node.Status.nodeChanged(\n      ChangeTypes.DISTRIBUTE_NEGATIVE_ONE, node, newNode, false);\n  }\n  else {\n    return Node.Status.noChange(node);\n  }\n}\n\n// Distributes a pair of terms in a multiplication operation, if a pair\n// can be distributed. To be distributed, there must be two terms beside\n// each other, and at least one of them must be a parenthesis node.\n// e.g. 2*(3+x) or (4+x^2+x^3)*(x+3)\n// Returns a Node.Status object with substeps\nfunction distributeAndSimplifyMultiplication(node) {\n  if (!Node.Type.isOperator(node) || node.op !== '*') {\n    return Node.Status.noChange(node);\n  }\n\n  // STEP 1: distribute with `distributeTwoNodes`\n  // e.g. x*(2+x) -> x*2 + x*x\n  // STEP 2: simplifications of each operand in the new sum with `simplify`\n  // e.g. x*2 + x*x -> ... -> 2x + x^2\n  for (let i = 0; i+1 < node.args.length; i++) {\n    if (!isParenthesisOfAddition(node.args[i]) &&\n        !isParenthesisOfAddition(node.args[i+1])) {\n      continue;\n    }\n    let newNode = node.cloneDeep();\n    const substeps = [];\n    let status;\n\n    const combinedNode = distributeTwoNodes(newNode.args[i], newNode.args[i+1]);\n    node.args[i].changeGroup = 1;\n    node.args[i+1].changeGroup = 1;\n    combinedNode.changeGroup = 1;\n\n    if (newNode.args.length > 2) {\n      newNode.args.splice(i, 2, combinedNode);\n      newNode.args[i].changeGroup = 1;\n    }\n    else {\n      newNode = combinedNode;\n      newNode.changeGroup = 1;\n    }\n\n    status = Node.Status.nodeChanged(\n      ChangeTypes.DISTRIBUTE, node, newNode, false);\n    substeps.push(status);\n    newNode = Node.Status.resetChangeGroups(status.newNode);\n\n    // case 1: there were more than two operands in this multiplication\n    // e.g. 3*7*(2+x)*(3+x)*(4+x) is a multiplication node with 5 children\n    // and the new node will be 3*(14+7x)*(3+x)*(4+x) with 4 children.\n    if (Node.Type.isOperator(newNode, '*')) {\n      const childStatus = simplifyWithParens(newNode.args[i]);\n      if (childStatus.hasChanged()) {\n        status = Node.Status.childChanged(newNode, childStatus, i);\n        substeps.push(status);\n        newNode = Node.Status.resetChangeGroups(status.newNode);\n      }\n    }\n    // case 2: there were only two operands and we multiplied them together.\n    // e.g. 7*(2+x) -> (7*2 + 7*x)\n    // Now we can just simplify it.\n    else if (Node.Type.isParenthesis(newNode)){\n      status = simplifyWithParens(newNode);\n      if (status.hasChanged()) {\n        substeps.push(status);\n        newNode = Node.Status.resetChangeGroups(status.newNode);\n      }\n    }\n    else {\n      throw Error('Unsupported node type for distribution: ' + node);\n    }\n\n    if (substeps.length === 1) {\n      return substeps[0];\n    }\n\n    return Node.Status.nodeChanged(\n      ChangeTypes.DISTRIBUTE, node, newNode, false, substeps);\n  }\n  return Node.Status.noChange(node);\n}\n\n// Distributes two nodes together. At least one node must be parenthesis node\n// e.g. 2*(x+3) -> (2*x + 2*3)       (5+x)*x -> 5*x + x*x\n// e.g. (5+x)*(x+3) -> (5*x + 5*3 + x*x + x*3)\n// Returns a node.\nfunction distributeTwoNodes(firstNode, secondNode) {\n  // lists of terms we'll be multiplying together from each node\n  let firstArgs, secondArgs;\n  if (isParenthesisOfAddition(firstNode)) {\n    firstArgs = firstNode.content.args;\n  }\n  else {\n    firstArgs = [firstNode];\n  }\n\n  if (isParenthesisOfAddition(secondNode)) {\n    secondArgs = secondNode.content.args;\n  }\n  else {\n    secondArgs = [secondNode];\n  }\n  // the new operands under addition, now products of terms\n  const newArgs = [];\n\n  // if exactly one group contains at least one fraction, multiply the\n  // non-fraction group into the numerators of the fraction group\n  if ([firstArgs, secondArgs].filter(hasFraction).length === 1) {\n    const firstArgsHasFraction = hasFraction(firstArgs);\n    const fractionNodes = firstArgsHasFraction ? firstArgs : secondArgs;\n    const nonFractionTerm = firstArgsHasFraction ? secondNode : firstNode;\n    fractionNodes.forEach((node) => {\n      let arg;\n      if (isFraction(node)) {\n        let numerator = Node.Creator.operator('*', [node.args[0], nonFractionTerm]);\n        numerator = Node.Creator.parenthesis(numerator);\n        arg = Node.Creator.operator('/', [numerator, node.args[1]]);\n      }\n      else {\n        arg = Node.Creator.operator('*', [node, nonFractionTerm]);\n      }\n      arg.changeGroup = 1;\n      newArgs.push(arg);\n    });\n  }\n  // e.g. (4+x)(x+y+z) will become 4(x+y+z) + x(x+y+z) as an intermediate\n  // step.\n  else if (firstArgs.length > 1 && secondArgs.length > 1) {\n    firstArgs.forEach(leftArg => {\n      const arg = Node.Creator.operator('*', [leftArg, secondNode]);\n      arg.changeGroup = 1;\n      newArgs.push(arg);\n    });\n  }\n  else {\n    // a list of all pairs of nodes between the two arg lists\n    firstArgs.forEach(leftArg => {\n      secondArgs.forEach(rightArg => {\n        const arg = Node.Creator.operator('*', [leftArg, rightArg]);\n        arg.changeGroup = 1;\n        newArgs.push(arg);\n      });\n    });\n  }\n  return Node.Creator.parenthesis(Node.Creator.operator('+', newArgs));\n}\n\nfunction hasFraction(args) {\n  return args.filter(isFraction).length > 0;\n}\n\nfunction isFraction(node) {\n  return Node.Type.isOperator(node, '/');\n}\n\n// Simplifies a sum of terms (a result of distribution) that's in parens\n// (note that all results of distribution are in parens)\n// e.g. 2x*(4 + x) distributes to (2x*4 + 2x*x)\n// This is a separate function from simplify to make the flow more readable,\n// but this is literally just a wrapper around 'simplify'.\n// Returns a Node.Status object\nfunction simplifyWithParens(node) {\n  if (!Node.Type.isParenthesis(node)) {\n    throw Error('expected ' + node + ' to be a parenthesis node');\n  }\n\n  const status = simplify(node.content);\n  if (status.hasChanged()) {\n    return Node.Status.childChanged(node, status);\n  }\n  else {\n    return Node.Status.noChange(node);\n  }\n}\n\n// Simplifies a sum of terms that are a result of distribution.\n// e.g. (2x+3)*(4x+5) -distribute-> 2x*(4x+5) + 3*(4x+5) <- 2 terms to simplify\n// e.g. 2x*(4x+5) --distribute--> 2x*4x + 2x*5 --simplify--> 8x^2 + 10x\n// Returns a Node.Status object.\nfunction simplify(node) {\n  const substeps = [];\n  const simplifyFunctions = [\n    arithmeticSearch,                       // e.g. 2*9 -> 18\n    rearrangeCoefficient,  // e.g. x*5 -> 5x\n    collectAndCombineSearch,                        // e.g 2x*4x -> 8x^2\n    distributeAndSimplifyMultiplication, // e.g. (2+x)(3+x) -> 2*(3+x) recurses\n    expandBase\n  ];\n\n  let newNode = node.cloneDeep();\n  for (let i = 0; i < newNode.args.length; i++) {\n    for (let j = 0; j < simplifyFunctions.length; j++) {\n      const childStatus = simplifyFunctions[j](newNode.args[i]);\n      if (childStatus.hasChanged()) {\n        const status = Node.Status.childChanged(newNode, childStatus, i);\n        substeps.push(status);\n        newNode = Node.Status.resetChangeGroups(status.newNode);\n      }\n    }\n  }\n\n  // possible in cases like 2(x + y) -> 2x + 2y -> doesn't need simplifying\n  if (substeps.length === 0) {\n    return Node.Status.noChange(node);\n  }\n  else {\n    return Node.Status.nodeChanged(\n      ChangeTypes.SIMPLIFY_TERMS, node, newNode, false, substeps);\n  }\n}\n\n// returns true if `node` is of the type (node + node + ...)\nfunction isParenthesisOfAddition(node) {\n  if (!Node.Type.isParenthesis(node)) {\n    return false;\n  }\n  const content = node.content;\n  return Node.Type.isOperator(content, '+');\n}\n\nmodule.exports = search;\n","const ChangeTypes = require('../../ChangeTypes');\nconst Node = require('../../node');\nconst TreeSearch = require('../../TreeSearch');\n\n// Searches for and simplifies any chains of division or nested division.\n// Returns a Node.Status object\nconst search = TreeSearch.preOrder(division);\n\nfunction division(node) {\n  if (!Node.Type.isOperator(node) || node.op !== '/') {\n    return Node.Status.noChange(node);\n  }\n  // e.g. 2/(x/6) => 2 * 6/x\n  let nodeStatus =  multiplyByInverse(node);\n  if (nodeStatus.hasChanged()) {\n    return nodeStatus;\n  }\n  // e.g. 2/x/6 -> 2/(x*6)\n  nodeStatus = simplifyDivisionChain(node);\n  if (nodeStatus.hasChanged()) {\n    return nodeStatus;\n  }\n  return Node.Status.noChange(node);\n}\n\n// If `node` is a fraction with a denominator that is also a fraction, multiply\n// by the inverse.\n// e.g. x/(2/3) -> x * 3/2\nfunction multiplyByInverse(node) {\n  let denominator = node.args[1];\n  if (Node.Type.isParenthesis(denominator)) {\n    denominator = denominator.content;\n  }\n  if (!Node.Type.isOperator(denominator) || denominator.op !== '/') {\n    return Node.Status.noChange(node);\n  }\n  // At this point, we know that node is a fraction and denonimator is the\n  // fraction we need to inverse.\n  const inverseNumerator = denominator.args[1];\n  const inverseDenominator = denominator.args[0];\n  const inverseFraction = Node.Creator.operator(\n    '/', [inverseNumerator, inverseDenominator]);\n\n  const newNode = Node.Creator.operator('*', [node.args[0], inverseFraction]);\n  return Node.Status.nodeChanged(\n    ChangeTypes.MULTIPLY_BY_INVERSE, node, newNode);\n}\n\n// Simplifies any chains of division into a single division operation.\n// e.g. 2/x/6 -> 2/(x*6)\n// Returns a Node.Status object\nfunction simplifyDivisionChain(node) {\n  // check for a chain of division\n  const denominatorList = getDenominatorList(node);\n  // one for the numerator, and at least two terms in the denominator\n  if (denominatorList.length > 2) {\n    const numerator = denominatorList.shift();\n    // the new single denominator is all the chained denominators\n    // multiplied together, in parentheses.\n    const denominator = Node.Creator.parenthesis(\n      Node.Creator.operator('*', denominatorList));\n    const newNode = Node.Creator.operator('/', [numerator, denominator]);\n    return Node.Status.nodeChanged(\n      ChangeTypes.SIMPLIFY_DIVISION, node, newNode);\n  }\n  return Node.Status.noChange(node);\n}\n\n// Given a the denominator of a division node, returns all the nested\n// denominator nodess. e.g. 2/3/4/5 would return [2,3,4,5]\n// (note: all the numbers in the example are actually constant nodes)\nfunction getDenominatorList(denominator) {\n  let node = denominator;\n  const denominatorList = [];\n  while (node.op === '/') {\n    // unshift the denominator to the front of the list, and recurse on\n    // the numerator\n    denominatorList.unshift(node.args[1]);\n    node = node.args[0];\n  }\n  // unshift the final node, which wasn't a / node\n  denominatorList.unshift(node);\n  return denominatorList;\n}\n\nmodule.exports = search;\n","const divideByGCD = require('./divideByGCD');\nconst print = require('../../util/print');\n\nconst ChangeTypes = require('../../ChangeTypes');\nconst Negative = require('../../Negative');\nconst Node = require('../../node');\n\n// Used for cancelTerms to return a (possibly updated) numerator and denominator\nclass CancelOutStatus {\n  constructor(numerator, denominator, hasChanged=false) {\n    this.numerator = numerator;\n    this.denominator = denominator;\n    this.hasChanged = hasChanged;\n  }\n}\n\n// Cancels like terms in a fraction node\n// e.g. (2x^2 * 5) / 2x^2 => 5 / 1\n// Returns a Node.Status object\nfunction cancelLikeTerms(node) {\n  if (!Node.Type.isOperator(node) || node.op !== '/') {\n    return Node.Status.noChange(node);\n  }\n\n  let newNode = node.cloneDeep();\n  const numerator = newNode.args[0];\n  const denominator = newNode.args[1];\n\n  // case 1: neither the numerator or denominator is a multiplication of terms\n  if (!isMultiplicationOfTerms(numerator) &&\n      !isMultiplicationOfTerms(denominator)) {\n    const cancelStatus = cancelTerms(numerator, denominator);\n\n    if (cancelStatus.hasChanged) {\n      newNode.args[0] = cancelStatus.numerator || Node.Creator.constant(1);\n      if (cancelStatus.denominator) {\n        newNode.args[1] = cancelStatus.denominator;\n      }\n      else {\n        // If we cancelled out the denominator, the node is now its numerator\n        // e.g. (2x*y) / 2x => y (note y isn't a fraction)\n        newNode = newNode.args[0];\n      }\n      return Node.Status.nodeChanged(\n        ChangeTypes.CANCEL_TERMS, node, newNode);\n    }\n    else {\n      return Node.Status.noChange(node);\n    }\n  }\n\n  // case 2: numerator is a multiplication of terms and denominator is not\n  // e.g. (2x^2 * 5) / 2x^2 => 5 / 1\n  // e.g. (x^2*y) / x  => x^(2 - 1) * y (<-- note that the denominator goes\n  // away because we always adjust the exponent in the numerator)\n  else if (isMultiplicationOfTerms(numerator) &&\n           !isMultiplicationOfTerms(denominator)) {\n    const numeratorArgs = Node.Type.isParenthesis(numerator) ?\n          numerator.content.args : numerator.args;\n    for (let i = 0; i < numeratorArgs.length; i++) {\n      const cancelStatus = cancelTerms(numeratorArgs[i], denominator);\n      if (cancelStatus.hasChanged) {\n        if (cancelStatus.numerator) {\n          numeratorArgs[i] = cancelStatus.numerator;\n        }\n        // if the cancelling out got rid of the numerator node, we remove it from\n        // the list\n        else {\n          numeratorArgs.splice(i, 1);\n          // if the numerator is now a \"multiplication\" of only one term,\n          // change it to just that term\n          if (numeratorArgs.length === 1) {\n            newNode.args[0] = numeratorArgs[0];\n          }\n        }\n        if (cancelStatus.denominator) {\n          newNode.args[1] = cancelStatus.denominator;\n        }\n        else {\n          // If we cancelled out the denominator, the node is now its numerator\n          // e.g. (2x*y) / 2x => y (note y isn't a fraction)\n          newNode = newNode.args[0];\n        }\n        return Node.Status.nodeChanged(\n          ChangeTypes.CANCEL_TERMS, node, newNode);\n      }\n    }\n    return Node.Status.noChange(node);\n  }\n\n  // case 3: denominator is a multiplication of terms and numerator is not\n  // e.g. 2x^2 / (2x^2 * 5) => 1 / 5\n  // e.g. x / (x^2*y) => x^(1-2) / y\n  else if (isMultiplicationOfTerms(denominator)\n           && !isMultiplicationOfTerms(numerator)) {\n    const denominatorArgs = Node.Type.isParenthesis(denominator) ?\n      denominator.content.args : denominator.args;\n    for (let i = 0; i < denominatorArgs.length; i++) {\n      const cancelStatus = cancelTerms(numerator, denominatorArgs[i]);\n      if (cancelStatus.hasChanged) {\n        newNode.args[0] = cancelStatus.numerator || Node.Creator.constant(1);\n        if (cancelStatus.denominator) {\n          denominatorArgs[i] = cancelStatus.denominator;\n        }\n        // if the cancelling out got rid of the denominator node, we remove it\n        // from the list\n        else {\n          denominatorArgs.splice(i, 1);\n          // if the denominator is now a \"multiplication\" of only one term,\n          // change it to just that term\n          if (denominatorArgs.length === 1) {\n            newNode.args[1] = denominatorArgs[0];\n          }\n        }\n        return Node.Status.nodeChanged(\n          ChangeTypes.CANCEL_TERMS, node, newNode);\n      }\n    }\n    return Node.Status.noChange(node);\n  }\n\n  // case 4: the numerator and denominator are both multiplications of terms\n  else {\n    const numeratorArgs = Node.Type.isParenthesis(numerator) ?\n      numerator.content.args : numerator.args;\n    const denominatorArgs = Node.Type.isParenthesis(denominator) ?\n      denominator.content.args : denominator.args;\n    for (let i = 0; i < numeratorArgs.length; i++) {\n      for (let j = 0; j < denominatorArgs.length; j++) {\n        const cancelStatus = cancelTerms(numeratorArgs[i], denominatorArgs[j]);\n        if (cancelStatus.hasChanged) {\n          if (cancelStatus.numerator) {\n            numeratorArgs[i] = cancelStatus.numerator;\n          }\n          // if the cancelling out got rid of the numerator node, we remove it\n          // from the list\n          else {\n            numeratorArgs.splice(i, 1);\n            // if the numerator is now a \"multiplication\" of only one term,\n            // change it to just that term\n            if (numeratorArgs.length === 1) {\n              newNode.args[0] = numeratorArgs[0];\n            }\n          }\n          if (cancelStatus.denominator) {\n            denominatorArgs[j] = cancelStatus.denominator;\n          }\n          // if the cancelling out got rid of the denominator node, we remove it\n          // from the list\n          else {\n            denominatorArgs.splice(j, 1);\n            // if the denominator is now a \"multiplication\" of only one term,\n            // change it to just that term\n            if (denominatorArgs.length === 1) {\n              newNode.args[1] = denominatorArgs[0];\n            }\n          }\n          return Node.Status.nodeChanged(\n            ChangeTypes.CANCEL_TERMS, node, newNode);\n        }\n      }\n    }\n    return Node.Status.noChange(node);\n  }\n}\n\n// Given a term in the numerator and a term in the denominator, cancels out\n// like terms if possible. See the cases below for possible things that can\n// be cancelled out and how they are cancelled out.\n// Returns the new nodes for numerator and denominator with the common terms\n// removed. If the entire numerator or denominator is cancelled out, it is\n// returned as null. e.g. 4, 4x => null, x\nfunction cancelTerms(numerator, denominator) {\n  // Deal with unary minuses by recursing on the argument\n  if (Node.Type.isUnaryMinus(numerator)) {\n    const cancelStatus = cancelTerms(numerator.args[0], denominator);\n    if (!cancelStatus.numerator) {\n      numerator = Node.Creator.constant(-1);\n    }\n    else if (Negative.isNegative(cancelStatus.numerator)) {\n      numerator = Negative.negate(cancelStatus.numerator);\n    }\n    else {\n      numerator.args[0] = cancelStatus.numerator;\n    }\n    denominator = cancelTerms.denominator;\n    return new CancelOutStatus(numerator, denominator, cancelStatus.hasChanged);\n  }\n  if (Node.Type.isUnaryMinus(denominator)) {\n    const cancelStatus = cancelTerms(numerator, denominator.args[0]);\n    numerator = cancelStatus.numerator;\n    if (cancelStatus.denominator) {\n      denominator.args[0] = cancelStatus.denominator;\n    }\n    else {\n      denominator = cancelStatus.denominator;\n      if (numerator) {\n        numerator = Negative.negate(numerator);\n      }\n      else {\n        numerator = Node.Creator.constant(-1);\n      }\n    }\n    return new CancelOutStatus(numerator, denominator, cancelStatus.hasChanged);\n  }\n\n  // Deal with parens similarily\n  if (Node.Type.isParenthesis(numerator)) {\n    const cancelStatus = cancelTerms(numerator.content, denominator);\n    if (cancelStatus.numerator) {\n      numerator.content = cancelStatus.numerator;\n    }\n    else {\n      // if the numerator was cancelled out, the numerator should be null\n      // and not null in parens.\n      numerator = cancelStatus.numerator;\n    }\n    denominator = cancelStatus.denominator;\n    return new CancelOutStatus(numerator, denominator, cancelStatus.hasChanged);\n  }\n  if (Node.Type.isParenthesis(denominator)) {\n    const cancelStatus = cancelTerms(numerator, denominator.content);\n    if (cancelStatus.denominator) {\n      denominator.content = cancelStatus.denominator;\n    }\n    else {\n      // if the denominator was cancelled out, the denominator should be null\n      // and not null in parens.\n      denominator = cancelStatus.denominator;\n    }\n    numerator = cancelStatus.numerator;\n    return new CancelOutStatus(numerator, denominator, cancelStatus.hasChanged);\n  }\n\n  // Now for the term cancelling ----\n\n  // case 1: the numerator term and denominator term are the same, so we cancel\n  // them out. e.g. (x+5)^100 / (x+5)^100 => null / null\n  if (print.ascii(numerator) === print.ascii(denominator)) {\n    return new CancelOutStatus(null, null, true);\n  }\n  // case 2: they're both exponent nodes with the same base\n  // e.g. (2x+5)^8 and (2x+5)^2\n  if (Node.Type.isOperator(numerator, '^') &&\n      Node.Type.isOperator(denominator, '^') &&\n      print.ascii(numerator.args[0]) === print.ascii(denominator.args[0])) {\n    const numeratorExponent = numerator.args[1];\n    let denominatorExponent =  denominator.args[1];\n    // wrap the denominatorExponent in parens, in case it's complicated.\n    // If the parens aren't needed, they'll be removed with\n    // removeUnnecessaryParens at the end of this step.\n    denominatorExponent = Node.Creator.parenthesis(denominatorExponent);\n    const newExponent = Node.Creator.parenthesis(\n      Node.Creator.operator('-', [numeratorExponent, denominatorExponent]));\n    numerator.args[1] = newExponent;\n    return new CancelOutStatus(numerator, null, true);\n  }\n  // case 3: they're both polynomial terms, check if they have the same symbol\n  // e.g. 4x^2 / 5x^2 => 4 / 5\n  // e.g. 4x^3 / 5x^2 => 4x^(3-2) / 5\n  // case 3.1: they're both polynomial terms with different symbols but with coefficients\n  // e.g 20x / 40y => x / 2y\n  // e.g 60x / 40y => 3x / 2y\n  // e.g 4x / 2y => 2x / y\n  if (Node.PolynomialTerm.isPolynomialTerm(numerator) &&\n      Node.PolynomialTerm.isPolynomialTerm(denominator)) {\n    const numeratorTerm = new Node.PolynomialTerm(numerator);\n    const denominatorTerm = new Node.PolynomialTerm(denominator);\n    if (numeratorTerm.getSymbolName() !== denominatorTerm.getSymbolName()) {\n      if (Node.Type.isOperator(numerator, '*') && Node.Type.isOperator(denominator, '*')) {\n        // case 3.1\n        return cancelCoeffs(numerator, denominator);\n      }\n      else {\n        return new CancelOutStatus(numerator, denominator);\n      }\n    }\n    const numeratorExponent = numeratorTerm.getExponentNode(true);\n    let denominatorExponent =  denominatorTerm.getExponentNode(true);\n    if (print.ascii(numeratorExponent) === print.ascii(denominatorExponent)) {\n      // note this returns null if there's no coefficient (ie it's 1)\n      numerator = numeratorTerm.getCoeffNode();\n    }\n    else {\n      // wrap the denominatorExponent in parens, in case it's complicated.\n      // If the parens aren't needed, they'll be removed with\n      // removeUnnecessaryParens at the end of this step.\n      denominatorExponent = Node.Creator.parenthesis(denominatorExponent);\n      const newExponent = Node.Creator.parenthesis(\n        Node.Creator.operator('-', [numeratorExponent, denominatorExponent]));\n      numerator = Node.Creator.polynomialTerm(\n        numeratorTerm.getSymbolNode(),\n        newExponent,\n        numeratorTerm.getCoeffNode());\n    }\n    denominator = denominatorTerm.getCoeffNode();\n    return new CancelOutStatus(numerator, denominator, true);\n  }\n\n  // case 4: the numerator is a constant and denominator is a polynomial term that has a coefficient\n  // or is multiplication node\n  // e.g. 2 / 4x -> 1 / 2x\n  // e.g. ignore cases like:  2 / a and 2 / x^2\n  if (Node.Type.isConstant(numerator)\n      && Node.Type.isOperator(denominator, '*')\n      && Node.PolynomialTerm.isPolynomialTerm(denominator)) {\n    const denominatorTerm = new Node.PolynomialTerm(denominator);\n\n    const coeff = denominatorTerm.getCoeffNode();\n    const variable = denominatorTerm.getSymbolNode();\n    const exponent = denominatorTerm.getExponentNode();\n\n    // simplify a constant fraction (e.g 2 / 4)\n    const frac = Node.Creator.operator('/', [numerator, coeff]);\n\n    let newCoeff = coeff.cloneDeep();\n    const reduceStatus = divideByGCD(frac);\n\n    if (!reduceStatus.hasChanged()) {\n      return new CancelOutStatus(numerator, denominator, false);\n    }\n\n    // Sometimes the fraction reduces to a constant e.g. 6 / 2 -> 3,\n    // in which case `newCoeff` (the denominator coefficient) should be null\n    if (Node.Type.isConstant(reduceStatus.newNode)) {\n      numerator = reduceStatus.newNode;\n      newCoeff = null;\n    }\n    else {\n      [numerator, newCoeff] = reduceStatus.newNode.args;\n    }\n    denominator = Node.Creator.polynomialTerm(variable, exponent, newCoeff);\n\n    return new CancelOutStatus(numerator, denominator, true);\n  }\n\n  // case 5: both numerator and denominator are numbers within a more complicated fraction\n  // e.g. (35 * nthRoot (7)) / (5 * nthRoot(5)) -> (7 * nthRoot(7)) / nthRoot(5)\n  if (Node.Type.isConstant(numerator) && Node.Type.isConstant(denominator)) {\n    const frac = Node.Creator.operator('/', [numerator, denominator]);\n    const reduceStatus = divideByGCD(frac);\n    if (!reduceStatus.hasChanged()) {\n      return new CancelOutStatus(numerator, denominator, false);\n    }\n    if (Node.Type.isConstant(reduceStatus.newNode)) {\n      // Denominator is a factor of numerator (e.g 4 / 2 -> 2)\n      return new CancelOutStatus(reduceStatus.newNode, null, true);\n    }\n\n    // Sometimes the fraction reduces to a constant e.g. 6 / 2 -> 3,\n    // in which case `newCoeff` (the denominator coefficient) should be null\n    if (Node.Type.isConstant(reduceStatus.newNode)) {\n      numerator = reduceStatus.newNode;\n      denominator = null;\n    }\n    else {\n      [numerator, denominator] = reduceStatus.newNode.args;\n    }\n\n    return new CancelOutStatus(numerator, denominator, true);\n  }\n\n  return new CancelOutStatus(numerator, denominator);\n}\n\n// Returns true if node is a multiplication of terms that can be cancelled out\n// e.g. 2 * 6^y => true\n// e.g. 2 + 6 => false\n// e.g. (2 * 6^y) => true\n// e.g. 2x^2 => false (polynomial terms are considered as one single term)\nfunction isMultiplicationOfTerms(node) {\n  if (Node.Type.isParenthesis(node)) {\n    return isMultiplicationOfTerms(node.content);\n  }\n  return (Node.Type.isOperator(node, '*') &&\n          !Node.PolynomialTerm.isPolynomialTerm(node));\n}\n\nfunction cancelCoeffs(numerator, denominator){\n  const denominatorTerm = new Node.PolynomialTerm(denominator);\n  const numeratorTerm = new Node.PolynomialTerm(numerator);\n\n  const denominatorCoeff = denominatorTerm.getCoeffNode();\n  const denominatorVariable = denominatorTerm.getSymbolNode();\n  const denominatorExponent = denominatorTerm.getExponentNode();\n\n  const numeratorCoeff = numeratorTerm.getCoeffNode();\n  const numeratorVariable = numeratorTerm.getSymbolNode();\n  const numeratorExponent = numeratorTerm.getExponentNode();\n\n  // simplify a constant fraction (e.g 2 / 4)\n  const frac = Node.Creator.operator('/', [numeratorCoeff, denominatorCoeff]);\n\n  const reduceStatus = divideByGCD(frac);\n\n  if (!reduceStatus.hasChanged()) {\n    return new CancelOutStatus(numerator, denominator, false);\n  }\n\n  // Sometimes the fraction reduces to a constant e.g. 6 / 2 -> 3,\n  // in which case the denominator coefficient should be null\n  let newDenominatorCoeff = null;\n  let newNumerator = null;\n  if (Node.Type.isConstant(reduceStatus.newNode)) {\n    newNumerator = Node.Creator.polynomialTerm(numeratorVariable, numeratorExponent, reduceStatus.newNode);\n    newDenominatorCoeff = null;\n  }\n  else {\n    newNumerator = Node.Creator.polynomialTerm(numeratorVariable, numeratorExponent, reduceStatus.newNode.args[0]);\n    newDenominatorCoeff = reduceStatus.newNode.args[1];\n  }\n  const newDenominator = Node.Creator.polynomialTerm(denominatorVariable, denominatorExponent, newDenominatorCoeff);\n\n  return new CancelOutStatus(newNumerator, newDenominator, true);\n}\n\nmodule.exports = cancelLikeTerms;\n","const ChangeTypes = require('../../ChangeTypes');\nconst Negative = require('../../Negative');\nconst Node = require('../../node');\n\n// Simplifies negative signs if possible\n// e.g. -1/-3 --> 1/3   4/-5 --> -4/5\n// Note that -4/5 doesn't need to be simplified.\n// Note that our goal is for the denominator to always be positive. If it\n// isn't, we can simplify signs.\n// Returns a Node.Status object\nfunction simplifySigns(fraction) {\n  if (!Node.Type.isOperator(fraction) || fraction.op !== '/') {\n    return Node.Status.noChange(fraction);\n  }\n  const oldFraction = fraction.cloneDeep();\n  let numerator = fraction.args[0];\n  let denominator = fraction.args[1];\n  // The denominator should never be negative.\n  if (Negative.isNegative(denominator)) {\n    denominator = Negative.negate(denominator);\n    const changeType = Negative.isNegative(numerator) ?\n      ChangeTypes.CANCEL_MINUSES :\n      ChangeTypes.SIMPLIFY_SIGNS;\n    numerator = Negative.negate(numerator);\n    const newFraction = Node.Creator.operator('/', [numerator, denominator]);\n    return Node.Status.nodeChanged(changeType, oldFraction, newFraction);\n  }\n  else {\n    return Node.Status.noChange(fraction);\n  }\n}\n\nmodule.exports = simplifySigns;\n","const arithmeticSearch = require('../arithmeticSearch');\nconst divideByGCD = require('./divideByGCD');\nconst Node = require('../../node');\n\n// Simplifies a polynomial term with a fraction as its coefficients.\n// e.g. 2x/4 --> x/2    10x/5 --> 2x\n// Also simplified negative signs\n// e.g. -y/-3 --> y/3   4x/-5 --> -4x/5\n// returns the new simplified node in a Node.Status object\nfunction simplifyPolynomialFraction(node) {\n  if (!Node.PolynomialTerm.isPolynomialTerm(node)) {\n    return Node.Status.noChange(node);\n  }\n\n  const polyNode = new Node.PolynomialTerm(node.cloneDeep());\n  if (!polyNode.hasFractionCoeff()) {\n    return Node.Status.noChange(node);\n  }\n\n  const coefficientSimplifications = [\n    divideByGCD, // for integer fractions\n    arithmeticSearch, // for decimal fractions\n  ];\n\n  for (let i = 0; i < coefficientSimplifications.length; i++) {\n    const coefficientFraction = polyNode.getCoeffNode(); // a division node\n    const newCoeffStatus = coefficientSimplifications[i](coefficientFraction);\n    if (newCoeffStatus.hasChanged()) {\n      // we need to reset change groups because we're creating a new node\n      let newCoeff = Node.Status.resetChangeGroups(newCoeffStatus.newNode);\n      if (newCoeff.value === '1') {\n        newCoeff = null;\n      }\n      const exponentNode = polyNode.getExponentNode();\n      const newNode = Node.Creator.polynomialTerm(\n          polyNode.getSymbolNode(), exponentNode, newCoeff);\n      return Node.Status.nodeChanged(newCoeffStatus.changeType, node, newNode);\n    }\n  }\n\n  return Node.Status.noChange(node);\n}\n\nmodule.exports = simplifyPolynomialFraction;\n","/*\n * Performs simpifications on fractions: adding and cancelling out.\n *\n * Note: division is represented in mathjs as an operator node with op '/'\n * and two args, where arg[0] is the numerator and arg[1] is the denominator\n\n// This module manipulates fractions with constants in the numerator and\n// denominator. For more complex/general fractions, see Fraction.js\n\n */\n\nconst addConstantAndFraction = require('./addConstantAndFraction');\nconst addConstantFractions = require('./addConstantFractions');\nconst cancelLikeTerms = require('./cancelLikeTerms');\nconst divideByGCD = require('./divideByGCD');\nconst simplifyFractionSigns = require('./simplifyFractionSigns');\nconst simplifyPolynomialFraction = require('./simplifyPolynomialFraction');\n\nconst Node = require('../../node');\nconst TreeSearch = require('../../TreeSearch');\n\nconst SIMPLIFICATION_FUNCTIONS = [\n  // e.g. 2/3 + 5/6\n  addConstantFractions,\n  // e.g. 4 + 5/6 or 4.5 + 6/8\n  addConstantAndFraction,\n  // e.g. 2/-9  ->  -2/9      e.g. -2/-9  ->  2/9\n  simplifyFractionSigns,\n  // e.g. 8/12  ->  2/3 (divide by GCD 4)\n  divideByGCD,\n  // e.g. 2x/4 -> x/2 (divideByGCD but for coefficients of polynomial terms)\n  simplifyPolynomialFraction,\n  // e.g. (2x * 5) / 2x  ->  5\n  cancelLikeTerms,\n];\n\nconst search = TreeSearch.preOrder(simplifyFractions);\n\n// Look for step(s) to perform on a node. Returns a Node.Status object.\nfunction simplifyFractions(node) {\n  for (let i = 0; i < SIMPLIFICATION_FUNCTIONS.length; i++) {\n    const nodeStatus = SIMPLIFICATION_FUNCTIONS[i](node);\n    if (nodeStatus.hasChanged()) {\n      return nodeStatus;\n    }\n    else {\n      node = nodeStatus.newNode;\n    }\n  }\n  return Node.Status.noChange(node);\n}\n\n\nmodule.exports = search;\n","const math = require('mathjs');\n\nconst ChangeTypes = require('../../ChangeTypes');\nconst evaluate = require('../../util/evaluate');\nconst Node = require('../../node');\n\n// Evaluates abs() function if it's on a single constant value.\n// Returns a Node.Status object.\nfunction absoluteValue(node) {\n  if (!Node.Type.isFunction(node, 'abs')) {\n    return Node.Status.noChange(node);\n  }\n  if (node.args.length > 1) {\n    return Node.Status.noChange(node);\n  }\n  let newNode = node.cloneDeep();\n  const argument = newNode.args[0];\n  if (Node.Type.isConstant(argument, true)) {\n    newNode = Node.Creator.constant(math.abs(evaluate(argument)));\n    return Node.Status.nodeChanged(\n      ChangeTypes.ABSOLUTE_VALUE, node, newNode);\n  }\n  else if (Node.Type.isConstantFraction(argument, true)) {\n    const newNumerator = Node.Creator.constant(\n      math.abs(evaluate(argument.args[0])));\n    const newDenominator =  Node.Creator.constant(\n      math.abs(evaluate(argument.args[1])));\n    newNode = Node.Creator.operator('/', [newNumerator, newDenominator]);\n    return Node.Status.nodeChanged(\n      ChangeTypes.ABSOLUTE_VALUE, node, newNode);\n  }\n  else {\n    return Node.Status.noChange(node);\n  }\n}\n\nmodule.exports = absoluteValue;\n","const absoluteValue = require('./absoluteValue');\n\nconst Node = require('../../node');\nconst NthRoot = require('./nthRoot');\nconst TreeSearch = require('../../TreeSearch');\n\nconst FUNCTIONS = [\n  NthRoot.nthRoot,\n  absoluteValue\n];\n\n// Searches through the tree, prioritizing deeper nodes, and evaluates\n// functions (e.g. abs(-4)) if possible.\n// Returns a Node.Status object.\nconst search = TreeSearch.postOrder(functions);\n\n// Evaluates a function call if possible. Returns a Node.Status object.\nfunction functions(node) {\n  if (!Node.Type.isFunction(node)) {\n    return Node.Status.noChange(node);\n  }\n\n  for (let i = 0; i < FUNCTIONS.length; i++) {\n    const nodeStatus = FUNCTIONS[i](node);\n    if (nodeStatus.hasChanged()) {\n      return nodeStatus;\n    }\n  }\n  return Node.Status.noChange(node);\n}\n\nmodule.exports = search;\n","const checks = require('../checks');\nconst Node = require('../node');\nconst Status = require('../node/Status');\n\nconst arithmeticSearch = require('./arithmeticSearch');\nconst basicsSearch = require('./basicsSearch');\nconst breakUpNumeratorSearch = require('./breakUpNumeratorSearch');\nconst collectAndCombineSearch = require('./collectAndCombineSearch');\nconst distributeSearch = require('./distributeSearch');\nconst divisionSearch = require('./divisionSearch');\nconst fractionsSearch = require('./fractionsSearch');\nconst functionsSearch = require('./functionsSearch');\nconst multiplyFractionsSearch = require('./multiplyFractionsSearch');\n\nconst flattenOperands = require('../util/flattenOperands');\nconst print = require('../util/print');\nconst removeUnnecessaryParens = require('../util/removeUnnecessaryParens');\n\n// Given a mathjs expression node, steps through simplifying the expression.\n// Returns a list of details about each step.\nfunction stepThrough(node, debug=false) {\n  if (debug) {\n    // eslint-disable-next-line\n    console.log('\\n\\nSimplifying: ' + print.ascii(node, false, true));\n  }\n\n  if (checks.hasUnsupportedNodes(node)) {\n    return [];\n  }\n\n  let nodeStatus;\n  const steps = [];\n\n  const originalExpressionStr = print.ascii(node);\n  const MAX_STEP_COUNT = 20;\n  let iters = 0;\n\n  // Now, step through the math expression until nothing changes\n  nodeStatus = step(node);\n  while (nodeStatus.hasChanged()) {\n    if (debug) {\n      logSteps(nodeStatus);\n    }\n    steps.push(removeUnnecessaryParensInStep(nodeStatus));\n\n    node = Status.resetChangeGroups(nodeStatus.newNode);\n    nodeStatus = step(node);\n\n    if (iters++ === MAX_STEP_COUNT) {\n      // eslint-disable-next-line\n      console.error('Math error: Potential infinite loop for expression: ' +\n                    originalExpressionStr + ', returning no steps');\n      return [];\n    }\n  }\n\n  return steps;\n}\n\n// Given a mathjs expression node, performs a single step to simplify the\n// expression. Returns a Node.Status object.\nfunction step(node) {\n  let nodeStatus;\n\n  node = flattenOperands(node);\n  node = removeUnnecessaryParens(node, true);\n\n  const simplificationTreeSearches = [\n    // Basic simplifications that we always try first e.g. (...)^0 => 1\n    basicsSearch,\n    // Simplify any division chains so there's at most one division operation.\n    // e.g. 2/x/6 -> 2/(x*6)        e.g. 2/(x/6) => 2 * 6/x\n    divisionSearch,\n    // Adding fractions, cancelling out things in fractions\n    fractionsSearch,\n    // e.g. addition of polynomial terms: 2x + 4x^2 + x => 4x^2 + 3x\n    // e.g. multiplication of polynomial terms: 2x * x * x^2 => 2x^3\n    // e.g. multiplication of constants: 10^3 * 10^2 => 10^5\n    collectAndCombineSearch,\n    // e.g. 2 + 2 => 4\n    arithmeticSearch,\n    // e.g. (2 + x) / 4 => 2/4 + x/4\n    breakUpNumeratorSearch,\n    // e.g. 3/x * 2x/5 => (3 * 2x) / (x * 5)\n    multiplyFractionsSearch,\n    // e.g. (2x + 3)(x + 4) => 2x^2 + 11x + 12\n    distributeSearch,\n    // e.g. abs(-4) => 4\n    functionsSearch,\n  ];\n\n  for (let i = 0; i < simplificationTreeSearches.length; i++) {\n    nodeStatus = simplificationTreeSearches[i](node);\n    // Always update node, since there might be changes that didn't count as\n    // a step. Remove unnecessary parens, in case one a step results in more\n    // parens than needed.\n    node = removeUnnecessaryParens(nodeStatus.newNode, true);\n    if (nodeStatus.hasChanged()) {\n      node = flattenOperands(node);\n      nodeStatus.newNode = node.cloneDeep();\n      return nodeStatus;\n    }\n    else {\n      node = flattenOperands(node);\n    }\n  }\n  return Node.Status.noChange(node);\n}\n\n// Removes unnecessary parens throughout the steps.\n// TODO: Ideally this would happen in NodeStatus instead.\nfunction removeUnnecessaryParensInStep(nodeStatus) {\n  if (nodeStatus.substeps.length > 0) {\n    nodeStatus.substeps.map(removeUnnecessaryParensInStep);\n  }\n\n  nodeStatus.oldNode = removeUnnecessaryParens(nodeStatus.oldNode, true);\n  nodeStatus.newNode = removeUnnecessaryParens(nodeStatus.newNode, true);\n  return nodeStatus;\n}\n\nfunction logSteps(nodeStatus) {\n  // eslint-disable-next-line\n  console.log(nodeStatus.changeType);\n  // eslint-disable-next-line\n  console.log(print.ascii(nodeStatus.newNode) + '\\n');\n\n  if (nodeStatus.substeps.length > 0) {\n    // eslint-disable-next-line\n    console.log('\\nsubsteps: ');\n    nodeStatus.substeps.forEach(substep => substep);\n  }\n}\n\nmodule.exports = stepThrough;\n","const math = require('mathjs');\nconst stepThrough = require('./stepThrough');\n\nfunction simplifyExpressionString(expressionString, debug=false) {\n  let exprNode;\n  try {\n    exprNode = math.parse(expressionString);\n  }\n  catch (err) {\n    return [];\n  }\n  if (exprNode) {\n    return stepThrough(exprNode, debug);\n  }\n  return [];\n}\n\nmodule.exports = simplifyExpressionString;\n","const math = require('mathjs');\n\nconst printNode = require('../util/print');\n\n// This represents an equation, made up of the leftNode (LHS), the\n// rightNode (RHS) and a comparator (=, <, >, <=, or >=)\nclass Equation {\n  constructor(leftNode, rightNode, comparator) {\n    this.leftNode = leftNode;\n    this.rightNode = rightNode;\n    this.comparator = comparator;\n  }\n\n  // Prints an Equation properly using the print module\n  ascii(showPlusMinus=false) {\n    const leftSide = printNode.ascii(this.leftNode, showPlusMinus);\n    const rightSide = printNode.ascii(this.rightNode, showPlusMinus);\n    const comparator = this.comparator;\n\n    return `${leftSide} ${comparator} ${rightSide}`;\n  }\n\n  // Prints an Equation properly using LaTeX\n  latex(showPlusMinus=false) {\n    const leftSide = printNode.latex(this.leftNode, showPlusMinus);\n    const rightSide = printNode.latex(this.rightNode, showPlusMinus);\n    const comparator = this.comparator;\n\n    return `${leftSide} ${comparator} ${rightSide}`;\n  }\n\n  clone() {\n    const newLeft = this.leftNode.cloneDeep();\n    const newRight = this.rightNode.cloneDeep();\n    return new Equation(newLeft, newRight, this.comparator);\n  }\n}\n\n// Splits a string on the given comparator and returns a new Equation object\n// from the left and right hand sides\nEquation.createEquationFromString = function(str, comparator) {\n  const sides = str.split(comparator);\n  if (sides.length !== 2) {\n    throw Error('Expected two sides of an equation using comparator: ' +\n      comparator);\n  }\n  const leftNode = math.parse(sides[0]);\n  const rightNode = math.parse(sides[1]);\n\n  return new Equation(leftNode, rightNode, comparator);\n};\n\nmodule.exports = Equation;\n","const ChangeTypes = require('../ChangeTypes');\nconst Equation = require('./Equation');\nconst Node = require('../node');\n\n// This represents the current equation we're solving.\n// As we move step by step, an equation might be updated. Functions return this\n// status object to pass on the updated equation and information on if/how it was\n// changed.\nclass Status {\n  constructor(changeType, oldEquation, newEquation, substeps=[]) {\n    if (!newEquation) {\n      throw Error('new equation isn\\'t defined');\n    }\n    if (changeType === undefined || typeof(changeType) !== 'string') {\n      throw Error('changetype isn\\'t valid');\n    }\n\n    this.changeType = changeType;\n    this.oldEquation = oldEquation;\n    this.newEquation = newEquation;\n    this.substeps = substeps;\n  }\n\n  hasChanged() {\n    return this.changeType !== ChangeTypes.NO_CHANGE;\n  }\n}\n\n// A wrapper around the Status constructor for the case where equation\n// hasn't been changed.\nStatus.noChange = function(equation) {\n  return new Status(ChangeTypes.NO_CHANGE, null, equation);\n};\n\nStatus.addLeftStep = function(equation, leftStep) {\n  const substeps = [];\n  leftStep.substeps.forEach(substep => {\n    substeps.push(Status.addLeftStep(equation, substep));\n  });\n  let oldEquation = null;\n  if (leftStep.oldNode) {\n    oldEquation = equation.clone();\n    oldEquation.leftNode = leftStep.oldNode;\n  }\n  const newEquation = equation.clone();\n  newEquation.leftNode = leftStep.newNode;\n  return new Status(\n    leftStep.changeType, oldEquation, newEquation, substeps);\n};\n\nStatus.addRightStep = function(equation, rightStep) {\n  const substeps = [];\n  rightStep.substeps.forEach(substep => {\n    substeps.push(Status.addRightStep(equation, substep));\n  });\n  let oldEquation = null;\n  if (rightStep.oldNode) {\n    oldEquation = equation.clone();\n    oldEquation.rightNode = rightStep.oldNode;\n  }\n  const newEquation = equation.clone();\n  newEquation.rightNode = rightStep.newNode;\n  return new Status(\n    rightStep.changeType, oldEquation, newEquation, substeps);\n};\n\nStatus.resetChangeGroups = function(equation) {\n  const leftNode = Node.Status.resetChangeGroups(equation.leftNode);\n  const rightNode = Node.Status.resetChangeGroups(equation.rightNode);\n  return new Equation(leftNode, rightNode, equation.comparator);\n};\n\nmodule.exports = Status;\n","// Operations on equation nodes\n\nconst ChangeTypes = require('../ChangeTypes');\nconst Equation = require('../equation/Equation');\nconst EquationStatus = require('../equation/Status');\nconst Negative = require('../Negative');\nconst Node = require('../node');\nconst Symbols = require('../Symbols');\n\nconst COMPARATOR_TO_INVERSE = {\n  '>': '<',\n  '>=': '<=',\n  '<': '>',\n  '<=': '>=',\n  '=': '='\n};\n\nconst EquationOperations = {};\n\n// Ensures that the given equation has the given symbolName on the left side,\n// by swapping the right and left sides if it is only in the right side.\n// So 3 = x would become x = 3.\nEquationOperations.ensureSymbolInLeftNode = function(equation, symbolName) {\n  const leftSideSymbolTerm = Symbols.getLastSymbolTerm(\n    equation.leftNode, symbolName);\n  const rightSideSymbolTerm = Symbols.getLastSymbolTerm(\n    equation.rightNode, symbolName);\n\n  if (!leftSideSymbolTerm) {\n    if (rightSideSymbolTerm) {\n      const comparator = COMPARATOR_TO_INVERSE[equation.comparator];\n      const oldEquation = equation;\n      const newEquation = new Equation(\n        equation.rightNode, equation.leftNode, comparator);\n      // no change groups are set for this step because everything changes, so\n      // they wouldn't be pedagogically helpful.\n      return new EquationStatus(\n        ChangeTypes.SWAP_SIDES, oldEquation, newEquation);\n    }\n    else {\n      throw Error('No term with symbol: ' + symbolName);\n    }\n  }\n  return EquationStatus.noChange(equation);\n};\n\n// Ensures that a symbol is not in the denominator by multiplying\n// both sides by the denominator if there is a symbol present.\nEquationOperations.removeSymbolFromDenominator = function(equation, symbolName) {\n  // Can't multiply a symbol across non-equal comparators\n  // because you don't know if it's negative and need to flip the sign\n  if (equation.comparator !== '=') {\n    return EquationStatus.noChange(equation);\n  }\n  const leftNode = equation.leftNode;\n  const denominator = Symbols.getLastDenominatorWithSymbolTerm(leftNode, symbolName);\n  if (denominator) {\n    return performTermOperationOnEquation(\n      equation, '*', denominator, ChangeTypes.MULTIPLY_TO_BOTH_SIDES);\n  }\n  return EquationStatus.noChange(equation);\n};\n\n// Removes the given symbolName from the right side by adding or subtracting\n// it from both sides as appropriate.\n// e.g. 2x = 3x + 5 --> 2x - 3x = 5\n// There are actually no cases where we'd remove symbols from the right side\n// by multiplying or dividing by a symbol term.\n// TODO: support inverting functions e.g. sqrt, ^, log etc.\nEquationOperations.removeSymbolFromRightSide = function(equation, symbolName) {\n  const rightNode = equation.rightNode;\n  let symbolTerm = Symbols.getLastSymbolTerm(rightNode, symbolName);\n\n  let inverseOp, inverseTerm, changeType;\n  if (!symbolTerm){\n    return EquationStatus.noChange(equation);\n  }\n\n  // Clone it so that any operations on it don't affect the node already\n  // in the equation\n  symbolTerm = symbolTerm.cloneDeep();\n\n  if (Node.PolynomialTerm.isPolynomialTerm(rightNode)) {\n    if (Negative.isNegative(symbolTerm)) {\n      inverseOp = '+';\n      changeType = ChangeTypes.ADD_TO_BOTH_SIDES;\n      inverseTerm = Negative.negate(symbolTerm);\n    }\n    else {\n      inverseOp = '-';\n      changeType = ChangeTypes.SUBTRACT_FROM_BOTH_SIDES;\n      inverseTerm = symbolTerm;\n    }\n  }\n  else if (Node.Type.isOperator(rightNode)) {\n    if (rightNode.op === '+') {\n      if (Negative.isNegative(symbolTerm)) {\n        inverseOp = '+';\n        changeType = ChangeTypes.ADD_TO_BOTH_SIDES;\n        inverseTerm = Negative.negate(symbolTerm);\n      }\n      else {\n        inverseOp = '-';\n        changeType = ChangeTypes.SUBTRACT_FROM_BOTH_SIDES;\n        inverseTerm = symbolTerm;\n      }\n    }\n    else {\n      // Note that operator '-' won't show up here because subtraction is\n      // flattened into adding the negative. See 'TRICKY catch' in the README\n      // for more details.\n      throw Error('Unsupported operation: ' + symbolTerm.op);\n    }\n  }\n  else if (Node.Type.isUnaryMinus(rightNode)) {\n    inverseOp = '+';\n    changeType = ChangeTypes.ADD_TO_BOTH_SIDES;\n    inverseTerm = symbolTerm.args[0];\n  }\n  else {\n    throw Error('Unsupported node type: ' + rightNode.type);\n  }\n  return performTermOperationOnEquation(\n      equation, inverseOp, inverseTerm, changeType);\n};\n\n// Isolates the given symbolName to the left side by adding, multiplying, subtracting\n// or dividing all other symbols and constants from both sides appropriately\n// TODO: support inverting functions e.g. sqrt, ^, log etc.\nEquationOperations.isolateSymbolOnLeftSide = function(equation, symbolName) {\n  let leftNode = equation.leftNode;\n\n  if (Node.Type.isParenthesis(leftNode)) {\n    // if entire left node is a parenthesis, we can ignore the parenthesis\n    leftNode = leftNode.content;\n  }\n\n  let nonSymbolTerm = Symbols.getLastNonSymbolTerm(leftNode, symbolName);\n  let inverseOp, inverseTerm, changeType;\n\n  if (!nonSymbolTerm) {\n    return EquationStatus.noChange(equation);\n  }\n\n  // Clone it so that any operations on it don't affect the node already\n  // in the equation\n  nonSymbolTerm = nonSymbolTerm.cloneDeep();\n\n  if (Node.Type.isOperator(leftNode)) {\n    if (leftNode.op === '+') {\n      if (Negative.isNegative(nonSymbolTerm)) {\n        inverseOp = '+';\n        changeType = ChangeTypes.ADD_TO_BOTH_SIDES;\n        inverseTerm = Negative.negate(nonSymbolTerm);\n      }\n      else {\n        inverseOp = '-';\n        changeType = ChangeTypes.SUBTRACT_FROM_BOTH_SIDES;\n        inverseTerm = nonSymbolTerm;\n      }\n    }\n    else if (leftNode.op === '*') {\n      if (Node.Type.isConstantFraction(nonSymbolTerm)) {\n        inverseOp = '*';\n        changeType = ChangeTypes.MULTIPLY_BOTH_SIDES_BY_INVERSE_FRACTION;\n        inverseTerm = Node.Creator.operator(\n          '/', [nonSymbolTerm.args[1], nonSymbolTerm.args[0]]);\n      }\n      else {\n        inverseOp = '/';\n        changeType = ChangeTypes.DIVIDE_FROM_BOTH_SIDES;\n        inverseTerm = nonSymbolTerm;\n      }\n    }\n    else if (leftNode.op === '/') {\n      // The non symbol term is always a fraction because it's the\n      // coefficient of our symbol term.\n      // If the numerator is 1, we multiply both sides by the denominator,\n      // otherwise we multiply by the inverse\n      if (['1', '-1'].indexOf(nonSymbolTerm.args[0].value) !== -1) {\n        inverseOp = '*';\n        changeType = ChangeTypes.MULTIPLY_TO_BOTH_SIDES;\n        inverseTerm = nonSymbolTerm.args[1];\n      }\n      else {\n        inverseOp = '*';\n        changeType = ChangeTypes.MULTIPLY_BOTH_SIDES_BY_INVERSE_FRACTION;\n        inverseTerm = Node.Creator.operator(\n          '/', [nonSymbolTerm.args[1], nonSymbolTerm.args[0]]);\n      }\n    }\n    else if (leftNode.op === '^') {\n      // TODO: support roots\n      return EquationStatus.noChange(equation);\n    }\n    else {\n      throw Error('Unsupported operation: ' + leftNode.op);\n    }\n  }\n  else if (Node.Type.isUnaryMinus(leftNode)) {\n    inverseOp = '*';\n    changeType = ChangeTypes.MULTIPLY_BOTH_SIDES_BY_NEGATIVE_ONE;\n    inverseTerm =  Node.Creator.constant(-1);\n  }\n  else {\n    throw Error('Unsupported node type: ' + leftNode.type);\n  }\n\n  return performTermOperationOnEquation(\n      equation, inverseOp, inverseTerm, changeType);\n};\n\n// Modifies the left and right sides of an equation by `op`-ing `term`\n// to both sides. Returns an Status object.\nfunction performTermOperationOnEquation(equation, op, term, changeType) {\n  const oldEquation = equation.clone();\n\n  const leftTerm = term.cloneDeep();\n  const rightTerm = term.cloneDeep();\n  const leftNode = performTermOperationOnExpression(\n    equation.leftNode, op, leftTerm);\n  const rightNode = performTermOperationOnExpression(\n    equation.rightNode, op, rightTerm);\n\n  let comparator = equation.comparator;\n  if (Negative.isNegative(term) && (op === '*' || op === '/')) {\n    comparator = COMPARATOR_TO_INVERSE[comparator];\n  }\n\n  const newEquation = new Equation(leftNode, rightNode, comparator);\n  return new EquationStatus(changeType, oldEquation, newEquation);\n}\n\n// Performs an operation of a term on an entire given expression\nfunction performTermOperationOnExpression(expression, op, term) {\n  const node = (Node.Type.isOperator(expression) ?\n    Node.Creator.parenthesis(expression) : expression);\n\n  term.changeGroup = 1;\n  term = (Node.Type.isOperator(term) ? Node.Creator.parenthesis(term) : term);\n  const newNode = Node.Creator.operator(op, [node, term]);\n\n  return newNode;\n}\n\nmodule.exports = EquationOperations;\n","const ChangeTypes = require('../ChangeTypes');\nconst checks = require('../checks');\nconst Equation = require('../equation/Equation');\nconst EquationOperations = require('./EquationOperations');\nconst EquationStatus = require('../equation/Status');\nconst evaluate = require('../util/evaluate');\nconst factor = require('../factor/stepThrough');\nconst flattenOperands = require('../util/flattenOperands');\nconst Node = require('../node');\nconst removeUnnecessaryParens = require('../util/removeUnnecessaryParens');\nconst simplifyExpressionNode = require('../simplifyExpression/stepThrough');\nconst Symbols = require('../Symbols');\n\nconst COMPARATOR_TO_FUNCTION = {\n  '=': function(left, right) { return left === right; },\n  '>': function(left, right) { return left > right; },\n  '>=': function(left, right) { return left >= right; },\n  '<': function(left, right) { return left < right; },\n  '<=': function(left, right) { return left <= right; },\n};\n\n// Given a leftNode, rightNode and a comparator, will return the steps to get\n// the solution. Possible solutions include:\n// - solving for a variable (e.g. 'x=3' for '3x=4+5')\n// - the result of comparing values (e.g. 'true' for 3 = 3, 'false' for 3 < 2)\nfunction stepThrough(leftNode, rightNode, comparator, debug=false) {\n  let equation = new Equation(leftNode, rightNode, comparator);\n\n  if (debug) {\n    // eslint-disable-next-line\n    console.log('\\n\\nSolving: ' + equation.ascii(false, true));\n  }\n\n  // we can't solve/find steps if there are any unsupported nodes\n  if (checks.hasUnsupportedNodes(equation.leftNode) ||\n      checks.hasUnsupportedNodes(equation.rightNode)) {\n    return [];\n  }\n\n  const symbolSet = Symbols.getSymbolsInEquation(equation);\n\n  if (symbolSet.size === 0) {\n    return solveConstantEquation(equation, debug);\n  }\n  const symbolName = symbolSet.values().next().value;\n\n  let equationStatus;\n  let steps = [];\n\n  const originalEquationStr = equation.ascii();\n  const MAX_STEP_COUNT = 20;\n  let iters = 0;\n\n  // Remove unnecessary parentheses here, before doing the find roots check\n  // If we have roots, we return early and do not go through simplification,\n  // so we can't rely on that flow for parentheses removal\n  // e.g. x^(2) = 0 -> x^2 = 0\n  equation.leftNode = removeUnnecessaryParens(equation.leftNode);\n  equation.rightNode = removeUnnecessaryParens(equation.rightNode);\n\n  // Checks if there are roots in the original equation before we\n  // do any simplification.\n  // E.g. (33 + 89) (x - 99) = 0\n  if (checks.canFindRoots(equation)) {\n    steps.push(getRootsStatus(equation));\n    return steps;\n  }\n\n  // Step through the math equation until nothing changes\n  do {\n    steps = addSimplificationSteps(steps, equation, debug);\n\n    if (steps.length > 0) {\n      const lastStep = steps[steps.length - 1];\n      equation = Equation.createEquationFromString(\n        lastStep.newEquation.ascii(), equation.comparator);\n    }\n\n    equation.leftNode = flattenOperands(equation.leftNode);\n    equation.rightNode = flattenOperands(equation.rightNode);\n\n    // at this point, the symbols might have cancelled out.\n    if (Symbols.getSymbolsInEquation(equation).size === 0) {\n      return solveConstantEquation(equation, debug, steps);\n    }\n\n    // The left side of the equation is either factored or simplified.\n    // If it is factor and we can find roots, return them.\n    // e.g. x^2 + 3x + 2 = 0 -> (x + 1) (x + 2) = 0 -> x = -1\n    if (checks.canFindRoots(equation)) {\n      steps.push(getRootsStatus(equation));\n      return steps;\n    }\n\n    try {\n      equationStatus = step(equation, symbolName);\n    }\n    catch (e) {\n      // This error happens for some math that we don't support\n      if (e.message.startsWith('No term with symbol: ')) {\n        // eslint-disable-next-line\n        console.error('Math error: ' + e.message + ', returning no steps');\n        return [];\n      }\n      else {\n        throw e; // bubble up\n      }\n    }\n\n    if (equationStatus.hasChanged()) {\n      if (equationStatus.newEquation.ascii().length > 300) {\n        // eslint-disable-next-line\n        throw Error('Math error: Potential infinite loop for equation ' +\n                    originalEquationStr +  '. It reached over 300 characters '+\n                    ' long, so returning no steps');\n      }\n      if (debug) {\n        logSteps(equationStatus);\n      }\n      steps.push(equationStatus);\n    }\n\n    equation = EquationStatus.resetChangeGroups(equationStatus.newEquation);\n    if (iters++ === MAX_STEP_COUNT) {\n      // eslint-disable-next-line\n      console.error('Math error: Potential infinite loop for equation: ' +\n                    originalEquationStr + ', returning no steps');\n      return [];\n    }\n  } while (equationStatus.hasChanged());\n\n  return steps;\n}\n\n/*\n  Helper function to return the roots to a factor of an equation\n  e.g. (x + 2) (x - 2) = 0 -> getRootsStatus (x + 2 = 0) will return\n  a new EquationStatus with x = -2 as the roots\n  Similarly getRootsStatus(x - 2 = 0) will return x = 2\n*/\nfunction getRootsStatus(equation) {\n  const [solutions, symbol] = getSolutionsAndSymbol(equation);\n\n  let allSolutions;\n\n  if (solutions.length > 1) {\n    const flattenSolutionsList = [];\n    solutions.forEach(s => s.items\n                      ? flattenSolutionsList.push(...s.items)\n                      : flattenSolutionsList.push(s));\n    allSolutions =  Node.Creator.list(flattenSolutionsList);\n  }\n  else if (solutions.length === 1) {\n    allSolutions = solutions[0];\n  }\n  else {\n    allSolutions = Node.Creator.list([]);\n  }\n\n  const roots = new Equation(symbol, allSolutions, '=');\n\n  return new EquationStatus(ChangeTypes.FIND_ROOTS, equation, roots);\n}\n\n/*\n  Helper function that returns the roots and symbol of an input equation\n  that has roots to be found. (We check if the equation has roots first)\n  For every factor on the left hand side, solve a new equation that is factor = 0\n  for the symbol.\n  TODO: handle multiple variable solutions e.g (x + 2) (y + 2) = 0\n*/\n\nfunction getSolutionsAndSymbol (equation) {\n  const leftNode = equation.leftNode;\n\n  const solutions = [];\n\n  let symbol, steps, factorsWithSymbols;\n\n  // If left hand side is a power node and it does not resolve to a constant\n  // then it is a factor. (e.g. 2^7 resolves to a constant so it is not a factor, but\n  // x^2 would have factors x = 0)\n  // If left hand side is a multiplication node, return a list of all the valid factors.\n  if (Node.Type.isOperator(leftNode, '^') && !checks.resolvesToConstant(leftNode)){\n    factorsWithSymbols = [leftNode];\n  }\n  else {\n    factorsWithSymbols = equation.leftNode.args.filter(arg => !checks.resolvesToConstant(arg));\n  }\n\n  /*\n    For each factor, solve the equation factor = 0 for the symbol\n    If the factor is a power node, solve the equation base = 0 for the symbol\n    Show duplicate roots when factor is a power node\n    e.g. (x + 1)^2 -> x = [-1, -1]\n  */\n\n  for (var f in factorsWithSymbols) {\n    let factor = factorsWithSymbols[f];\n    let exponent = 1;\n\n    if (Node.Type.isOperator(factor, '^')) {\n      exponent = parseFloat(factor.args[1].value);\n      factor = factor.args[0];\n    }\n\n    const leftNode = Node.Type.isParenthesis(factor)\n          ? factor.content\n          : factor;\n\n    steps = stepThrough(leftNode, equation.rightNode, '=');\n\n    if (steps.length === 0 && Node.Type.isSymbol(leftNode)) {\n      // e.g. x = 0\n      symbol = leftNode;\n\n      // Push the solution multiple times when we have duplicate roots\n      // e.g. (x + 1)^2 -> x = [-1, -1]\n      solutions.push(...Array(exponent).fill(equation.rightNode));\n    }\n    else if (steps.length !== 0) {\n      // Solving for the variable on one side may sometimes\n      // result in more than one step\n      // e.g. x - 2 = 0\n      const lastStep = steps.slice(-1)[0];\n\n      // Append to a list of roots\n      if (Node.Type.isSymbol(lastStep.newEquation.leftNode)) {\n        symbol = lastStep.newEquation.leftNode;\n        solutions.push(...Array(exponent).fill(lastStep.newEquation.rightNode));\n      }\n    }\n  }\n\n  return [solutions, symbol];\n}\n\n// Given an equation of constants, will simplify both sides, returning\n// the steps and the result of the equation e.g. 'True' or 'False'\nfunction solveConstantEquation(equation, debug, steps=[]) {\n  const compareFunction = COMPARATOR_TO_FUNCTION[equation.comparator];\n\n  if (!compareFunction) {\n    throw Error('Unexpected comparator');\n  }\n\n  steps = addSimplificationSteps(steps, equation, true, debug);\n  if (steps.length > 0) {\n    const lastStep = steps[steps.length - 1];\n    equation = Equation.createEquationFromString(\n      lastStep.newEquation.ascii(), equation.comparator);\n  }\n\n  // If the left or right side didn't have any steps, unnecessary parens\n  // might not have been removed, so do that now.\n  equation.leftNode = removeUnnecessaryParens(equation.leftNode);\n  equation.rightNode = removeUnnecessaryParens(equation.rightNode);\n\n  if (!Node.Type.isConstantOrConstantFraction(equation.leftNode, true) ||\n      !Node.Type.isConstantOrConstantFraction(equation.rightNode, true)) {\n    throw Error('Expected both nodes to be constants, instead got: ' +\n                equation.ascii());\n  }\n\n  const leftValue = evaluate(equation.leftNode);\n  const rightValue = evaluate(equation.rightNode);\n  let changeType;\n  if (compareFunction(leftValue, rightValue)) {\n    changeType = ChangeTypes.STATEMENT_IS_TRUE;\n  }\n  else {\n    changeType = ChangeTypes.STATEMENT_IS_FALSE;\n  }\n\n  // there's no oldEquation or change groups because nothing actually changes\n  // here, it's just a final step that states the solution\n  const equationStatus = new EquationStatus(changeType, null, equation);\n  if (debug) {\n    logSteps(equationStatus);\n  }\n  steps.push(equationStatus);\n  return steps;\n}\n\n// Given a symbol and an equation, performs a single step to\n// solve for the symbol. Returns an Status object.\nfunction step(equation, symbolName) {\n  const solveFunctions = [\n    // ensure the symbol is always on the left node\n    EquationOperations.ensureSymbolInLeftNode,\n    // get rid of denominators that have the symbol\n    EquationOperations.removeSymbolFromDenominator,\n    // remove the symbol from the right side\n    EquationOperations.removeSymbolFromRightSide,\n    // isolate the symbol on the left side\n    EquationOperations.isolateSymbolOnLeftSide,\n  ];\n\n  for (let i = 0; i < solveFunctions.length; i++) {\n    const equationStatus = solveFunctions[i](equation, symbolName);\n\n    if (equationStatus.hasChanged()) {\n      return equationStatus;\n    }\n  }\n  return EquationStatus.noChange(equation);\n}\n\n// Simplifies the equation and returns the simplification steps\nfunction addSimplificationSteps(steps, equation, debug=false) {\n  let oldEquation = equation.clone();\n\n  /*\n    1. On the left side, we should first simplify,\n    and add all those simplify substeps to a list of leftSteps.\n    2. Then we should factor the simplified equation, and add all\n    those factoring substeps to the leftSteps list.\n    3. On the right side, there should be no need to factor,\n    because we always move everything to the left side first\n    e.g. x^2 + 3x + 2 = 0 <- factor the left side\n    e.g. x + 4 + 2 = 0 <- simplify the left side\n    e.g. 0 = x^2 + 3x + 2 -> x^2 + 3x + 2 = 0 <- swap to the left side\n  */\n  const leftSimplifySteps = simplifyExpressionNode(equation.leftNode, false);\n  const simplifiedLeftNode = leftSimplifySteps.length !== 0\n        ? leftSimplifySteps.slice(-1)[0].newNode\n        : equation.leftNode;\n  const leftFactorSteps = factor(simplifiedLeftNode, false);\n\n  const leftSubSteps = [];\n\n  for (let i = 0; i < leftSimplifySteps.length; i++) {\n    const step = leftSimplifySteps[i];\n    leftSubSteps.push(EquationStatus.addLeftStep(equation, step));\n  }\n\n  for (let i = 0; i < leftFactorSteps.length; i++) {\n    const step = leftFactorSteps[i];\n    leftSubSteps.push(EquationStatus.addLeftStep(equation, step));\n  }\n\n  if (leftSubSteps.length === 1) {\n    const step = leftSubSteps[0];\n    if (debug) {\n      logSteps(step);\n    }\n    steps.push(step);\n  }\n  else if (leftSubSteps.length > 1) {\n    const lastStep = leftSubSteps[leftSubSteps.length - 1];\n    const finalEquation = EquationStatus.resetChangeGroups(lastStep.newEquation);\n    // no change groups are set here - too much is changing for it to be useful\n    const simplifyStatus = new EquationStatus(\n      ChangeTypes.SIMPLIFY_LEFT_SIDE,\n      oldEquation, finalEquation, leftSubSteps);\n    if (debug) {\n      logSteps(simplifyStatus);\n    }\n    steps.push(simplifyStatus);\n  }\n\n  // update `equation` to have the new simplified left node\n  if (steps.length > 0) {\n    equation = EquationStatus.resetChangeGroups(\n      steps[steps.length - 1].newEquation);\n  }\n\n  // the updated equation from simplifing the left side is the old equation\n  // (ie the \"before\" of the before and after) for simplifying the right side.\n  oldEquation = equation.clone();\n\n  const rightSteps = simplifyExpressionNode(equation.rightNode, false);\n  const rightSubSteps = [];\n\n  for (let i = 0; i < rightSteps.length; i++) {\n    const step = rightSteps[i];\n    rightSubSteps.push(EquationStatus.addRightStep(equation, step));\n  }\n\n  if (rightSubSteps.length === 1) {\n    const step = rightSubSteps[0];\n    if (debug) {\n      logSteps(step);\n    }\n    steps.push(step);\n  }\n  else if (rightSubSteps.length > 1) {\n    const lastStep = rightSubSteps[rightSubSteps.length - 1];\n    const finalEquation = EquationStatus.resetChangeGroups(lastStep.newEquation);\n    // no change groups are set here - too much is changing for it to be useful\n    const simplifyStatus = new EquationStatus(\n      ChangeTypes.SIMPLIFY_RIGHT_SIDE,\n      oldEquation, finalEquation, rightSubSteps);\n    if (debug) {\n      logSteps(simplifyStatus);\n    }\n    steps.push(simplifyStatus);\n  }\n\n  return steps;\n}\n\nfunction logSteps(equationStatus) {\n  // eslint-disable-next-line\n  console.log('\\n' + equationStatus.changeType);\n  // eslint-disable-next-line\n  console.log(equationStatus.newEquation.ascii());\n  if (equationStatus.substeps.length > 0) {\n    // eslint-disable-next-line\n    console.log('\\n substeps: ');\n    equationStatus.substeps.forEach(logSteps);\n  }\n}\n\n\nmodule.exports = stepThrough;\n","const math = require('mathjs');\n\nconst stepThrough = require('./stepThrough');\n\nfunction solveEquationString(equationString, debug=false) {\n  const comparators = ['<=', '>=', '=', '<', '>'];\n\n  for (let i = 0; i < comparators.length; i++) {\n    const comparator = comparators[i];\n    const sides = equationString.split(comparator);\n    if (sides.length !== 2) {\n      continue;\n    }\n    let leftNode, rightNode;\n    const leftSide = sides[0].trim();\n    const rightSide = sides[1].trim();\n\n    if (!leftSide || !rightSide) {\n      return [];\n    }\n\n    try {\n      leftNode = math.parse(leftSide);\n      rightNode = math.parse(rightSide);\n    }\n    catch (err) {\n      return [];\n    }\n    if (leftNode && rightNode) {\n      return stepThrough(leftNode, rightNode, comparator, debug);\n    }\n  }\n\n  return [];\n}\n\nmodule.exports = solveEquationString;\n","const ChangeTypes = require('./lib/ChangeTypes');\nconst factor = require('./lib/factor');\nconst simplifyExpression = require('./lib/simplifyExpression');\nconst solveEquation = require('./lib/solveEquation');\nconst printMS = require('./lib/util/print');\nconst Node = require('./lib/node');\nconst Negative = require('./lib/Negative')\nconst flatten = require('./lib/util/flattenOperands');\n\nmodule.exports = {\n  factor,\n  simplifyExpression,\n  solveEquation,\n  Node,\n  Negative,\n  printMS,\n  flatten,\n  ChangeTypes,\n};\n","/*\n  For determining the type of a mathJS node.\n */\n\nexport const NodeType = {}\n\nNodeType.isOperator = function (node, operator = null) {\n  return node.type === 'OperatorNode' &&\n         node.fn !== 'unaryMinus' &&\n         '*+-/^'.includes(node.op) &&\n         (operator ? node.op === operator : true)\n}\n\nNodeType.isParenthesis = function (node) {\n  return node.type === 'ParenthesisNode'\n}\n\nNodeType.isUnaryMinus = function (node) {\n  return node.type === 'OperatorNode' && node.fn === 'unaryMinus'\n}\n\nNodeType.isFunction = function (node, functionName = null) {\n  if (node.type !== 'FunctionNode') {\n    return false\n  }\n  if (functionName && node.fn.name !== functionName) {\n    return false\n  }\n  return true\n}\n\nNodeType.isSymbol = function (node, allowUnaryMinus = false) {\n  if (node.type === 'SymbolNode') {\n    return true\n  } else if (allowUnaryMinus && NodeType.isUnaryMinus(node)) {\n    return NodeType.isSymbol(node.args[0], false)\n  } else {\n    return false\n  }\n}\n\nNodeType.isConstant = function (node, allowUnaryMinus = false) {\n  if (node.type === 'ConstantNode') {\n    return true\n  } else if (allowUnaryMinus && NodeType.isUnaryMinus(node)) {\n    if (NodeType.isConstant(node.args[0], false)) {\n      const value = parseFloat(node.args[0].value)\n      return value >= 0\n    } else {\n      return false\n    }\n  } else {\n    return false\n  }\n}\n\nNodeType.isConstantFraction = function (node, allowUnaryMinus = false) {\n  if (NodeType.isOperator(node, '/')) {\n    return node.args.every(n => NodeType.isConstant(n, allowUnaryMinus))\n  } else {\n    return false\n  }\n}\n\nNodeType.isConstantOrConstantFraction = function (node, allowUnaryMinus = false) {\n  if (NodeType.isConstant(node, allowUnaryMinus) ||\n      NodeType.isConstantFraction(node, allowUnaryMinus)) {\n    return true\n  } else {\n    return false\n  }\n}\n\nNodeType.isIntegerFraction = function (node, allowUnaryMinus = false) {\n  if (!NodeType.isConstantFraction(node, allowUnaryMinus)) {\n    return false\n  }\n  let numerator = node.args[0]\n  let denominator = node.args[1]\n  if (allowUnaryMinus) {\n    if (NodeType.isUnaryMinus(numerator)) {\n      numerator = numerator.args[0]\n    }\n    if (NodeType.isUnaryMinus(denominator)) {\n      denominator = denominator.args[0]\n    }\n  }\n  return (Number.isInteger(parseFloat(numerator.value)) &&\n          Number.isInteger(parseFloat(denominator.value)))\n}\n","import { ChangeTypes } from 'mathsteps'\nimport { NodeType } from './NodeType.js'\n\nconst Change = {\n  changeFormatFunctionMap: {}\n}\n\nconst OP_TO_STRING = {\n  '+': 'Combine',\n  '-': 'Combine',\n  '*': 'Multiply',\n  '/': 'Divide'\n}\n\nconst COMPARATOR_TO_STRING = {\n  '=': 'equal to',\n  '>': 'greater than',\n  '>=': 'greater than or equal to',\n  '<': 'less than',\n  '<=': 'less than or equal to'\n}\n\n// Given a step, will return the change and explanation for the change\n// from the oldNode, newNode, and changeType\nChange.formatChange = function (step) {\n  if (!(step.changeType in Change.changeFormatFunctionMap)) {\n    // TODO: add tests that will alert us when a new change type doesn't\n    // have a change function yet\n    console.error(step.changeType + ' does not have a change function!')\n    return step.changeType\n  }\n\n  const changeFormatFunctionMap = Change.changeFormatFunctionMap[step.changeType]\n  const changeDescription = changeFormatFunctionMap(step)\n  if (!changeDescription) {\n    return `\\\\text{${Change.ChangeText[step.changeType]}}`\n  }\n\n  return changeDescription\n}\n\nfunction getChangeNodes (node) {\n  return node.filter(node => node.changeGroup)\n}\n\nfunction getOldChangeNodes (step) {\n  if (step.oldNode) {\n    return getChangeNodes(step.oldNode)\n  } else if (step.oldEquation) {\n    const leftChangeNodeStrings = getChangeNodes(step.oldEquation.leftNode)\n    const rightChangeNodeStrings = getChangeNodes(step.oldEquation.rightNode)\n    return [...leftChangeNodeStrings, ...rightChangeNodeStrings]\n  }\n  return null\n}\n\nexport function getNewChangeNodes (step) {\n  if (step.newNode) {\n    return getChangeNodes(step.newNode)\n  } else if (step.newEquation) {\n    const leftChangeNodeStrings = getChangeNodes(step.newEquation.leftNode)\n    const rightChangeNodeStrings = getChangeNodes(step.newEquation.rightNode)\n    return [...leftChangeNodeStrings, ...rightChangeNodeStrings]\n  }\n  return null\n}\n\nfunction nodesToString (nodes, duplicates = false) {\n  // get rid of changeGroup so we can find duplicates\n  nodes.forEach(node => { node.changeGroup = undefined })\n\n  let strings = nodes.map(node => node.toTex())\n  if (!duplicates) {\n    strings = [...new Set(strings)]\n  }\n\n  if (strings.length === 0) {\n    return ''\n  } else if (strings.length === 1) {\n    return strings[0]\n  } else {\n    return `${strings.slice(0, -1).join(', ')} \\\\text{ and } ${strings.slice(-1)}`\n  }\n}\n\n// e.g. |-3| -> 3\nChange.changeFormatFunctionMap[ChangeTypes.ABSOLUTE_VALUE] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  if (oldNodes.length !== 1) {\n    return null\n  }\n\n  const absNode = oldNodes[0]\n  if (!NodeType.isFunction(absNode, 'abs')) {\n    return null\n  }\n\n  const string = absNode.args[0].toTex()\n  return `\\\\text{Take the absolute value of } ${string}`\n}\n\n// e.g. 2x + x -> 2x + 1x\nChange.changeFormatFunctionMap[ChangeTypes.ADD_COEFFICIENT_OF_ONE] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  const newNodes = getNewChangeNodes(step)\n  if (oldNodes.length === 0 || newNodes.length !== oldNodes.length) {\n    return null\n  }\n\n  const before = nodesToString(oldNodes)\n  const after = nodesToString(newNodes)\n  return `\\\\text{Rewrite } ${before} \\\\text{ as } ${after}`\n}\n\n// e.g. x^2 * x -> x^2 * x^1\nChange.changeFormatFunctionMap[ChangeTypes.ADD_EXPONENT_OF_ONE] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  const newNodes = getNewChangeNodes(step)\n  if (oldNodes.length === 0 || newNodes.length !== oldNodes.length) {\n    return null\n  }\n\n  const before = nodesToString(oldNodes)\n  const after = nodesToString(newNodes)\n  return `\\\\text{Rewrite } ${before} \\\\text{ as } ${after}`\n}\n\n// e.g. 1/2 + 1/3 -> 5/6\nChange.changeFormatFunctionMap[ChangeTypes.ADD_FRACTIONS] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  const newNodes = getNewChangeNodes(step)\n  if (oldNodes.length !== 1 || newNodes.length !== 1) {\n    return null\n  }\n\n  const opNode = oldNodes[0]\n  if (!NodeType.isOperator(opNode) || opNode.op !== '+' || opNode.args.length > 3) {\n    return null\n  }\n\n  const before = nodesToString(opNode.args, true)\n  const after = newNodes[0].toTex()\n  return `\\\\text{Add } ${before} \\\\text{ to get } ${after}`\n}\n\n// e.g. (1 + 2)/3 -> 3/3\nChange.changeFormatFunctionMap[ChangeTypes.ADD_NUMERATORS] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. x^2 + x^2 -> 2x^2\nChange.changeFormatFunctionMap[ChangeTypes.ADD_POLYNOMIAL_TERMS] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  const newNodes = getNewChangeNodes(step)\n  if (oldNodes.length !== 1 || newNodes.length !== 1) {\n    return null\n  }\n\n  const opNode = oldNodes[0]\n  if (!NodeType.isOperator(opNode) || opNode.op !== '+') {\n    return null\n  }\n\n  const before = nodesToString(opNode.args, true)\n  const after = newNodes[0].toTex()\n  return `\\\\text{Add } ${before} \\\\text{ to get } ${after}`\n}\n\n// e.g. x - 3 = 2 -> x - 3 + 3 = 2 + 3\nChange.changeFormatFunctionMap[ChangeTypes.ADD_TO_BOTH_SIDES] = function (step) {\n  // there is a term node on each side of the equation\n  const termNodes = getNewChangeNodes(step)\n  if (termNodes.length !== 2) {\n    return null\n  }\n\n  const term = termNodes[0].toTex()\n  return `\\\\text{Add } ${term} \\\\text{ to both sides}`\n}\n\n// e.g. (x + 2)/2 -> x/2 + 2/2\nChange.changeFormatFunctionMap[ChangeTypes.BREAK_UP_FRACTION] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  if (oldNodes.length !== 1) {\n    return null\n  }\n\n  const before = nodesToString(oldNodes)\n  return `\\\\text{Break up the fraction } ${before}`\n}\n\n// e.g. nthRoot(x ^ 2, 4) -> nthRoot(x, 2)\nChange.changeFormatFunctionMap[ChangeTypes.CANCEL_EXPONENT] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. nthRoot(x ^ 2, 2) -> x\nChange.changeFormatFunctionMap[ChangeTypes.CANCEL_EXPONENT_AND_ROOT] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. nthRoot(x ^ 2, 2) -> x\nChange.changeFormatFunctionMap[ChangeTypes.CANCEL_MINUSES] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. nthRoot(x ^ 4, 2) -> x ^ 2\nChange.changeFormatFunctionMap[ChangeTypes.CANCEL_ROOT] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. 2x/2 -> x\nChange.changeFormatFunctionMap[ChangeTypes.CANCEL_TERMS] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  if (oldNodes.length !== 1) {\n    return null\n  }\n\n  const before = nodesToString(oldNodes)\n  return `\\\\text{Cancel } ${before} \\\\text{ from the numerator and denominator}`\n}\n\n// e.g. 2 + x + 3 + x -> 5 + 2x\nChange.changeFormatFunctionMap[ChangeTypes.COLLECT_AND_COMBINE_LIKE_TERMS] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. x^2 * x^3 * x^1 -> x^(2 + 3 + 1)\nChange.changeFormatFunctionMap[ChangeTypes.COLLECT_EXPONENTS] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. x + 2 + x^2 + x + 4 -> x^2 + (x + x) + (4 + 2)\nChange.changeFormatFunctionMap[ChangeTypes.COLLECT_LIKE_TERMS] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. 2/5 + 1/5 -> (2+1)/5\nChange.changeFormatFunctionMap[ChangeTypes.COMBINE_NUMERATORS] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. nthRoot(2, 2) * nthRoot(3, 2) -> nthRoot(2 * 3, 2)\nChange.changeFormatFunctionMap[ChangeTypes.COMBINE_UNDER_ROOT] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. 2/6 + 1/4 -> (2*2)/(6*2) + (1*3)/(4*3)\nChange.changeFormatFunctionMap[ChangeTypes.COMMON_DENOMINATOR] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. 3 + 1/2 -> 6/2 + 1/2\nChange.changeFormatFunctionMap[ChangeTypes.CONVERT_INTEGER_TO_FRACTION] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  const newNodes = getNewChangeNodes(step)\n  if (oldNodes.length !== 1 || newNodes.length !== 1) {\n    return null\n  }\n\n  const before = nodesToString(oldNodes)\n  const after = nodesToString(newNodes)\n  return `\\\\text{Change } ${before} \\\\text{ to } ${after} \\\\text{ so that it has a shared denominator}`\n}\n\n// e.g. 2 * 2 * 2 -> 2 ^ 3\nChange.changeFormatFunctionMap[ChangeTypes.CONVERT_MULTIPLICATION_TO_EXPONENT] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  const newNodes = getNewChangeNodes(step)\n  if (oldNodes.length !== 1 || newNodes.length !== 1) {\n    return null\n  }\n\n  const before = nodesToString(oldNodes)\n  const after = nodesToString(newNodes)\n  return `\\\\text{Rewrite } ${before} \\\\text{ as } ${after}`\n}\n\n// e.g. 2(x + y) -> 2x + 2y\nChange.changeFormatFunctionMap[ChangeTypes.DISTRIBUTE] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. -(2 + x) -> -2 - x\nChange.changeFormatFunctionMap[ChangeTypes.DISTRIBUTE_NEGATIVE_ONE] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. nthRoot(2 * x) -> nthRoot(2) * nthRoot(x)\nChange.changeFormatFunctionMap[ChangeTypes.DISTRIBUTE_NTH_ROOT] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// 1.2 + 1/2 -> 1.2 + 0.5\nChange.changeFormatFunctionMap[ChangeTypes.DIVIDE_FRACTION_FOR_ADDITION] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  const newNodes = getNewChangeNodes(step)\n  if (oldNodes.length !== 1 || newNodes.length !== 1) {\n    return null\n  }\n\n  const before = nodesToString(oldNodes)\n  const after = nodesToString(newNodes)\n  return `\\\\text{Divide } ${before} \\\\text{ so it's in the decimal form } ${after}`\n}\n\n// e.g. 2x = 1 -> (2x)/2 = 1/2\nChange.changeFormatFunctionMap[ChangeTypes.DIVIDE_FROM_BOTH_SIDES] = function (step) {\n  const termNodes = getNewChangeNodes(step)\n  if (termNodes.length !== 2) {\n    return null\n  }\n\n  const term = termNodes[0].toTex()\n  return `\\\\text{Divide both sides by } ${term}`\n}\n\n// e.g. 2/-1 -> -2\nChange.changeFormatFunctionMap[ChangeTypes.DIVISION_BY_NEGATIVE_ONE] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  const newNodes = getNewChangeNodes(step)\n  if (oldNodes.length !== 1 || newNodes.length !== 1) {\n    return null\n  }\n\n  const before = nodesToString(oldNodes)\n  const after = nodesToString(newNodes)\n  return `${before} \\\\text{ divided by -1 is } ${after}`\n}\n\n// e.g. 2/1 -> 2\nChange.changeFormatFunctionMap[ChangeTypes.DIVISION_BY_ONE] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  const newNodes = getNewChangeNodes(step)\n  if (oldNodes.length !== 1 || newNodes.length !== 1) {\n    return null\n  }\n\n  const before = nodesToString(oldNodes)\n  const after = nodesToString(newNodes)\n  return `${before} \\\\text{ divided by 1 is } ${after}`\n}\n\n// e.g. nthRoot(4) * nthRoot(x^2) -> 2 * x\nChange.changeFormatFunctionMap[ChangeTypes.EVALUATE_DISTRIBUTED_NTH_ROOT] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. 12 -> 2 * 2 * 3\nChange.changeFormatFunctionMap[ChangeTypes.FACTOR_INTO_PRIMES] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  const newNodes = getNewChangeNodes(step)\n  if (oldNodes.length !== 1 || newNodes.length < oldNodes.length || newNodes.length > 5) {\n    return null\n  }\n\n  const before = nodesToString(oldNodes)\n  const after = nodesToString(newNodes)\n  return `\\\\text{Factor } ${before} \\\\text{ into its prime factors: } ${after}`\n}\n\n// e.g. 2x^2 + 3x^2 + 5x^2 -> (2+3+5)x^2\nChange.changeFormatFunctionMap[ChangeTypes.GROUP_COEFFICIENTS] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. nthRoot(2 * 2 * 2, 2) -> nthRoot((2 * 2) * 2)\nChange.changeFormatFunctionMap[ChangeTypes.GROUP_TERMS_BY_ROOT] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. (2/3)x = 1 -> (2/3)x * (3/2) = 1 * (3/2)\nChange.changeFormatFunctionMap[ChangeTypes.MULTIPLY_BOTH_SIDES_BY_INVERSE_FRACTION] = function (step) {\n  const termNodes = getNewChangeNodes(step)\n  if (termNodes.length !== 2) {\n    return null\n  }\n\n  const term = termNodes[0].toTex()\n  return `\\\\text{Multiply both sides by the inverse } ${term}`\n}\n\n// e.g. -x = 2 -> -1 * -x = -1 * 2\nChange.changeFormatFunctionMap[ChangeTypes.MULTIPLY_BOTH_SIDES_BY_NEGATIVE_ONE] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. x/(2/3) -> x * 3/2\nChange.changeFormatFunctionMap[ChangeTypes.MULTIPLY_BY_INVERSE] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  const newNodes = getNewChangeNodes(step)\n  if (oldNodes.length !== 1 || newNodes.length !== 1) {\n    return null\n  }\n\n  const before = nodesToString(oldNodes, true)\n  const after = nodesToString(newNodes)\n  return `\\\\text{Rewrite } ${before} \\\\text{ as } ${after}`\n}\n\n// e.g. x * 0 -> 0\nChange.changeFormatFunctionMap[ChangeTypes.MULTIPLY_BY_ZERO] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  const newNodes = getNewChangeNodes(step)\n  if (oldNodes.length !== 1 || newNodes.length !== 1) {\n    return null\n  }\n\n  const before = nodesToString(oldNodes)\n  const after = nodesToString(newNodes)\n  return `\\\\text{Rewrite } ${before} \\\\text{ as } ${after}`\n}\n\n// e.g. (2 * 3)(x * x) -> 6(x*x)\nChange.changeFormatFunctionMap[ChangeTypes.MULTIPLY_COEFFICIENTS] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  const newNodes = getNewChangeNodes(step)\n  if (oldNodes.length !== 1 || newNodes.length !== 1) {\n    return null\n  }\n\n  const opNode = oldNodes[0]\n  if (!NodeType.isOperator(opNode) || opNode.op !== '*') {\n    return null\n  }\n\n  const before = nodesToString(oldNodes, true)\n  const after = newNodes[0].toTex()\n  return `\\\\text{Multiply the coefficients } ${before} \\\\text{ to get } ${after}`\n}\n\n// e.g. (2*2)/(6*2) + (1*3)/(4*3) -> (2*2)/12 + (1*3)/12\nChange.changeFormatFunctionMap[ChangeTypes.MULTIPLY_DENOMINATORS] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. 1/2 * 2/3 -> 2/6\nChange.changeFormatFunctionMap[ChangeTypes.MULTIPLY_FRACTIONS] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  const newNodes = getNewChangeNodes(step)\n  if (oldNodes.length !== 1 || newNodes.length !== 1) {\n    return null\n  }\n\n  const opNode = oldNodes[0]\n  if (!NodeType.isOperator(opNode) || opNode.op !== '*') {\n    return null\n  }\n\n  const before = nodesToString(opNode.args, true)\n  const after = newNodes[0].toTex()\n  return `\\\\text{Multiply } ${before} \\\\text{ to get } ${after}`\n}\n\n// e.g. (2*2)/12 + (1*3)/12 -> 4/12 + 3/12\nChange.changeFormatFunctionMap[ChangeTypes.MULTIPLY_NUMERATORS] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. 2x * x -> 2x ^ 2\nChange.changeFormatFunctionMap[ChangeTypes.MULTIPLY_POLYNOMIAL_TERMS] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  const newNodes = getNewChangeNodes(step)\n  if (oldNodes.length !== 1 || newNodes.length !== 1) {\n    return null\n  }\n\n  const opNode = oldNodes[0]\n  if (!NodeType.isOperator(opNode) || opNode.op !== '*') {\n    return null\n  }\n\n  const before = nodesToString(opNode.args, true)\n  const after = newNodes[0].toTex()\n  return `\\\\text{Multiply } ${before} \\\\text{ to get } ${after}`\n}\n\n// e.g. x/2 = 1 -> (x/2) * 2 = 1 * 2\nChange.changeFormatFunctionMap[ChangeTypes.MULTIPLY_TO_BOTH_SIDES] = function (step) {\n  const termNodes = getNewChangeNodes(step)\n  if (termNodes.length !== 2) {\n    return null\n  }\n\n  const term = termNodes[0].toTex()\n  return `\\\\text{Multiply both sides by } ${term}`\n}\n\n// This should never happen\nChange.changeFormatFunctionMap[ChangeTypes.NO_CHANGE] = function () {\n  return null\n}\n\n// e.g. nthRoot(4) -> 2\nChange.changeFormatFunctionMap[ChangeTypes.NTH_ROOT_VALUE] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  if (oldNodes.length !== 1) {\n    return null\n  }\n\n  const before = nodesToString(oldNodes)\n  return `\\\\text{Take the root of } ${before}`\n}\n\n// e.g. x * 2 -> 2x\nChange.changeFormatFunctionMap[ChangeTypes.REARRANGE_COEFF] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. x ^ 0 -> 1\nChange.changeFormatFunctionMap[ChangeTypes.REDUCE_EXPONENT_BY_ZERO] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  const newNodes = getNewChangeNodes(step)\n  if (oldNodes.length !== 1 || newNodes.length !== 1) {\n    return null\n  }\n\n  const before = nodesToString(oldNodes)\n  const after = nodesToString(newNodes)\n  return `\\\\text{Rewrite } ${before} \\\\text{ as } ${after}`\n}\n\n// e.g. 0/1 -> 0\nChange.changeFormatFunctionMap[ChangeTypes.REDUCE_ZERO_NUMERATOR] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  const newNodes = getNewChangeNodes(step)\n  if (oldNodes.length !== 1 || newNodes.length !== 1) {\n    return null\n  }\n\n  const before = nodesToString(oldNodes)\n  const after = nodesToString(newNodes)\n  return `\\\\text{Rewrite } ${before} \\\\text{ as } ${after}`\n}\n\n// e.g. 2 + 0 -> 2\nChange.changeFormatFunctionMap[ChangeTypes.REMOVE_ADDING_ZERO] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. x ^ 1 -> x\nChange.changeFormatFunctionMap[ChangeTypes.REMOVE_EXPONENT_BY_ONE] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  const newNodes = getNewChangeNodes(step)\n  if (oldNodes.length !== 1 || newNodes.length !== 1) {\n    return null\n  }\n\n  const before = nodesToString(oldNodes)\n  const after = nodesToString(newNodes)\n  return `\\\\text{Rewrite } ${before} \\\\text{ as } ${after}`\n}\n\n// e.g. x * -1 -> -x\nChange.changeFormatFunctionMap[ChangeTypes.REMOVE_MULTIPLYING_BY_NEGATIVE_ONE] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  const newNodes = getNewChangeNodes(step)\n  if (oldNodes.length !== 1 || newNodes.length !== 1) {\n    return null\n  }\n\n  const before = nodesToString(oldNodes)\n  const after = nodesToString(newNodes)\n  return `\\\\text{Rewrite } ${before} \\\\text{ as } ${after}`\n}\n\n// e.g. x * 1 -> x\nChange.changeFormatFunctionMap[ChangeTypes.REMOVE_MULTIPLYING_BY_ONE] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  const newNodes = getNewChangeNodes(step)\n  if (oldNodes.length !== 1 || newNodes.length !== 1) {\n    return null\n  }\n\n  const before = nodesToString(oldNodes)\n  const after = nodesToString(newNodes)\n  return `\\\\text{Rewrite } ${before} \\\\text{ as } ${after}`\n}\n\n// e.g. 2 - - 3 -> 2 + 3\nChange.changeFormatFunctionMap[ChangeTypes.RESOLVE_DOUBLE_MINUS] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. 2 + 2 -> 4 or 2 * 2 -> 4\nChange.changeFormatFunctionMap[ChangeTypes.SIMPLIFY_ARITHMETIC] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  const newNodes = getNewChangeNodes(step)\n  if (oldNodes.length !== 1 || newNodes.length !== 1) {\n    return null\n  }\n\n  const opNode = oldNodes[0]\n  if (!NodeType.isOperator(opNode) || '+-*/^'.indexOf(opNode.op) === -1) {\n    return null\n  }\n\n  const before = nodesToString(opNode.args, true)\n  const after = newNodes[0].toTex()\n  return `\\\\text{${OP_TO_STRING[opNode.op]} } ${before} \\\\text{ to get } ${after}`\n}\n\n// e.g. 2/3/4 -> 2/(3*4)\nChange.changeFormatFunctionMap[ChangeTypes.SIMPLIFY_DIVISION] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  const newNodes = getNewChangeNodes(step)\n  if (oldNodes.length !== 1 || newNodes.length !== 1) {\n    return null\n  }\n\n  const before = nodesToString(oldNodes)\n  const after = nodesToString(newNodes)\n  return `\\\\text{Rewrite } ${before} \\\\text{ as } ${after}`\n}\n\n// e.g. 2/6 -> 1/3\nChange.changeFormatFunctionMap[ChangeTypes.SIMPLIFY_FRACTION] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  const newNodes = getNewChangeNodes(step)\n  if (oldNodes.length !== 1 || newNodes.length !== 1) {\n    return null\n  }\n\n  const before = nodesToString(oldNodes)\n  const after = nodesToString(newNodes)\n  return `\\\\text{Simplify } ${before} \\\\text{ to } ${after}`\n}\n\n// e.g. x + 2 - 1 = 3 -> x + 1 = 3\nChange.changeFormatFunctionMap[ChangeTypes.SIMPLIFY_LEFT_SIDE] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. x = 3 - 1 -> x = 2\nChange.changeFormatFunctionMap[ChangeTypes.SIMPLIFY_RIGHT_SIDE] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. 2/-3 -> -2/3\nChange.changeFormatFunctionMap[ChangeTypes.SIMPLIFY_SIGNS] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. 2 * 4x + 2*5 --> 8x + 10\nChange.changeFormatFunctionMap[ChangeTypes.SIMPLIFY_TERMS] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. 2 = 2\nChange.changeFormatFunctionMap[ChangeTypes.STATEMENT_IS_FALSE] = function (step) {\n  const comparator = step.newEquation.comparator\n  return `\\\\text{The left side is not ${COMPARATOR_TO_STRING[comparator]} the right side}`\n}\n\n// e.g. 2 = 3\nChange.changeFormatFunctionMap[ChangeTypes.STATEMENT_IS_TRUE] = function (step) {\n  const comparator = step.newEquation.comparator\n  return `\\\\text{The left side is ${COMPARATOR_TO_STRING[comparator]} the right side}`\n}\n\n// e.g. x + 3 = 2 -> x + 3 - 3 = 2 - 3\nChange.changeFormatFunctionMap[ChangeTypes.SUBTRACT_FROM_BOTH_SIDES] = function (step) {\n  const termNodes = getNewChangeNodes(step)\n  if (termNodes.length !== 2) {\n    return null\n  }\n\n  const term = termNodes[0].toTex()\n  return `\\\\text{Subtract } ${term} \\\\text{ from both sides}`\n}\n\n// e.g. 2 = x -> x = 2\nChange.changeFormatFunctionMap[ChangeTypes.SWAP_SIDES] = function (step) {\n  return `\\\\text{${Change.ChangeText[step.changeType]}}`\n}\n\n// e.g. 2x - x -> 2x - 1x\nChange.changeFormatFunctionMap[ChangeTypes.UNARY_MINUS_TO_NEGATIVE_ONE] = function (step) {\n  const oldNodes = getOldChangeNodes(step)\n  const newNodes = getNewChangeNodes(step)\n  if (oldNodes.length === 0 || newNodes.length !== oldNodes.length) {\n    return null\n  }\n\n  const before = nodesToString(oldNodes)\n  const after = nodesToString(newNodes)\n  return `\\\\text{Rewrite } ${before} \\\\text{ as } ${after}`\n}\n\nChange.ChangeText = {\n  ABSOLUTE_VALUE: 'Take the absolute value',\n  ADD_COEFFICIENT_OF_ONE: 'Rewrite term to have a coefficient of 1',\n  ADD_EXPONENT_OF_ONE: 'Rewrite term to have an exponent of 1',\n  ADD_FRACTIONS: 'Add the fractions together',\n  ADD_NUMERATORS: 'Add the terms in the numerator',\n  ADD_POLYNOMIAL_TERMS: 'Add the polynomial terms together',\n  ADD_TO_BOTH_SIDES: 'Add the term to both sides',\n  BREAK_UP_FRACTION: 'Break up the fraction',\n  CANCEL_EXPONENT: 'Cancel the exponent',\n  CANCEL_EXPONENT_AND_ROOT: 'Cancel the exponent and the root',\n  CANCEL_MINUSES: 'Cancel the negatives in the numerator and denominator',\n  CANCEL_ROOT: 'Cancel the root',\n  CANCEL_TERMS: 'Cancel like terms in the numerator and denominator',\n  COLLECT_AND_COMBINE_LIKE_TERMS: 'Collect and combine like terms',\n  COLLECT_EXPONENTS: 'Collect the exponents',\n  COLLECT_LIKE_TERMS: 'Identify the like terms and group them together',\n  COMBINE_NUMERATORS: 'Combine the numerators with a shared denominator',\n  COMMON_DENOMINATOR: 'Multiply the terms so they share a common denominator',\n  COMBINE_UNDER_ROOT: 'Combine terms with the same root',\n  CONVERT_INTEGER_TO_FRACTION: 'Change the number to a fraction with the same denominator',\n  CONVERT_MULTIPLICATION_TO_EXPONENT: 'Change repeatedly multiplying a term to an exponent',\n  DISTRIBUTE: 'Distribute into the parentheses',\n  DISTRIBUTE_NEGATIVE_ONE: 'Distribute -1 into the parentheses',\n  DISTRIBUTE_NTH_ROOT: 'Distribute the root into each term',\n  DIVIDE_FRACTION_FOR_ADDITION: 'Divide any fractions to convert it to decimal form',\n  DIVIDE_FROM_BOTH_SIDES: 'Divide the term from both sides',\n  DIVISION_BY_NEGATIVE_ONE: 'Rewrite any term divided by -1 as the negative of the term',\n  DIVISION_BY_ONE: 'Rewrite any term divided by 1 as just the term',\n  EVALUATE_DISTRIBUTED_NTH_ROOT: 'Take the root of all the terms',\n  FACTOR_INTO_PRIMES: 'Factor the number into its prime factors',\n  GROUP_COEFFICIENTS: 'Group the coefficients together',\n  GROUP_TERMS_BY_ROOT: 'Group repeating factors',\n  MULTIPLY_BOTH_SIDES_BY_INVERSE_FRACTION: 'Multiply both sides by the inverse of the fraction',\n  MULTIPLY_BOTH_SIDES_BY_NEGATIVE_ONE: 'Multiply both sides by -1',\n  MULTIPLY_BY_INVERSE: 'Rewrite division as multiplication by the inverse',\n  MULTIPLY_BY_ZERO: 'Rewrite any term multiplied by 0 as 0',\n  MULTIPLY_COEFFICIENTS: 'Multiply the coefficients together',\n  MULTIPLY_DENOMINATORS: 'Multiply the terms in the denominators',\n  MULTIPLY_FRACTIONS: 'Multiply the fractions together',\n  MULTIPLY_NUMERATORS: 'Multiply the terms in the numerators',\n  MULTIPLY_POLYNOMIAL_TERMS: 'Multiply the polynomial terms together',\n  MULTIPLY_TO_BOTH_SIDES: 'Multiply the term to both sides',\n  NTH_ROOT_VALUE: 'Take the root of the number',\n  NO_CHANGE: 'No change',\n  REARRANGE_COEFF: 'Move the coefficient to the front of the term',\n  REDUCE_ZERO_NUMERATOR: 'Rewrite zero divided by anything as zero',\n  REMOVE_EXPONENT_BY_ONE: 'Rewrite any term to the power of 1 as itself',\n  REDUCE_EXPONENT_BY_ZERO: 'Rewrite any term to the power of 0 as 1',\n  REMOVE_ADDING_ZERO: 'Remove zero when adding',\n  REMOVE_MULTIPLYING_BY_NEGATIVE_ONE: 'Rewrite any term multiplied by -1 as the negative of the term',\n  REMOVE_MULTIPLYING_BY_ONE: 'Rewrite any term multiplied 1 as just the term',\n  RESOLVE_DOUBLE_MINUS: 'Change subtracting a negative to addition',\n  SIMPLIFY_ARITHMETIC: 'Evaluate the arithmetic',\n  SIMPLIFY_DIVISION: 'Rewrite the chain of division',\n  SIMPLIFY_FRACTION: 'Simplify by dividing the top and bottom by the greatest common denominator',\n  SIMPLIFY_LEFT_SIDE: 'Simplify the left hand side',\n  SIMPLIFY_RIGHT_SIDE: 'Simplify the right hand side',\n  SIMPLIFY_SIGNS: 'Move the negative sign to the numerator',\n  SIMPLIFY_TERMS: 'Simplify after distributing',\n  STATEMENT_IS_FALSE: 'The statement is False',\n  STATEMENT_IS_TRUE: 'The statement is True',\n  SUBTRACT_FROM_BOTH_SIDES: 'Subtract the term from both sides',\n  SWAP_SIDES: 'Swap sides',\n  UNARY_MINUS_TO_NEGATIVE_ONE: 'Rewrite minus as a coefficient of -1'\n}\n\nexport default Change\n","import { obtenirListeFacteursPremiers } from '../lib/outils/primalite.js'\nimport { texNombre2 } from '../lib/outils/texNombre.js'\nimport { context } from './context.js'\nimport { all, create } from 'mathjs'\nimport { Node, Negative, solveEquation, simplifyExpression, factor } from 'mathsteps'\nimport { getNewChangeNodes } from './Change.js'\nimport Decimal from 'decimal.js'\n\nconst math = create(all)\n\nfunction searchFirstNode (node, op) {\n  if (node.type === 'OperatorNode') {\n    return searchFirstNode(node.args[0], node.op)\n  } else if (node.type === 'ParenthesisNode') {\n    return searchFirstNode(node.content, node.op)\n  } else {\n    return { node, op }\n  }\n}\n\nfunction searchLastNode (node, op) {\n  if (node.type === 'OperatorNode') {\n    return searchLastNode(node.args[node.args.length - 1], node.op)\n  } else if (node.type === 'ParenthesisNode') {\n    return searchLastNode(node.content, node.op)\n  } else {\n    return { node, op }\n  }\n}\n\n/**\n * Assignation de variables\n * @param {string} expression\n * @param {Object} variables\n * @returns {string}\n */\nexport function assignVariables (expression, variables) {\n  const node = math.parse(expression).transform(\n    function (node) {\n      if (node.isSymbolNode && variables[node.name] !== undefined) {\n        return math.parse(variables[node.name].toString())\n      } else {\n        return node\n      }\n    }\n  )\n  return node.toString({ parenthesis: 'keep' })\n}\n\nfunction transformNode (node, parent, oldNode, params = { suppr1: true, suppr0: true, supprPlusMoins: true }) {\n  params = Object.assign({ suppr1: true, suppr0: true, supprPlusMoins: true }, params)\n  if (parent === null && node.isParenthesisNode) node = node.content\n  if (oldNode === undefined || node.toString() !== oldNode.toString()) {\n    oldNode = node.clone()\n    /*\n    * Retirer les parenthèses au dividende et diviseur d'un quotient\n    * (n1)/(n2) devient n1/n2\n    */\n    if (node.isOperatorNode && node.op === '/') {\n      if (node.args[0].isParenthesisNode) {\n        node.args[0] = node.args[0].content\n      }\n      if (node.args[1].isParenthesisNode) {\n        node.args[1] = node.args[1].content\n      }\n    }\n    /*\n    * Transformer -2/n en -(2/n)\n    * Ne touche pas à (-2)/(-n)\n    */\n    if (node.isOperatorNode && node.op === '/') {\n      if (\n        node.args[0].type === 'OperatorNode' &&\n        node.args[0].fn === 'unaryMinus' &&\n        (node.args[0].args[0].type === 'ConstantNode' || node.args[0].args[0].type === 'SymbolNode') &&\n        !(\n          node.args[1].type === 'OperatorNode' &&\n          node.args[1].fn === 'unaryMinus'\n        )\n      ) {\n        let frac = Node.Creator.operator('/', [node.args[0].args[0], node.args[1]])\n        frac = Node.Creator.parenthesis(frac)\n        node = math.parse('-' + frac.toString())\n      }\n    }\n    /* (Flatten divisions comme dans Mathsteps)\n    * Transformer (1/2*3)/4 en 1/2*(3/4)\n    */\n    if (node.isOperatorNode && node.op === '/') {\n      if (node.args[0].isOperatorNode && node.args[0].op === '*') {\n        if (node.args[0].args[0].isOperatorNode && node.args[0].args[0].op === '/') {\n          const frac1 = Node.Creator.operator('/', node.args[0].args[0].args)\n          const frac2 = Node.Creator.operator('/', [node.args[0].args[1], node.args[1]])\n          node = Node.Creator.operator('*', [frac1, frac2])\n        }\n      }\n    }\n    /*\n    * Transformer (n1)+(n2) en n1+n2\n    * Utile si n1 et/ou n2 sont des unaryMinus ou des fractions\n    */\n    if (node.isOperatorNode && node.op === '+') {\n      if (params.supprPlusMoins) {\n        if (node.args[0].isParenthesisNode) node.args[0] = node.args[0].content\n        if (node.args.length > 1 && node.args[1].isParenthesisNode) node.args[1] = node.args[1].content\n      } else {\n        if (node.args[0].isParenthesisNode && node.args[0].content.toString()[0] !== '-' && node.args[0].content.toString()[0] !== '+') node.args[0] = node.args[0].content\n        if (node.args.length > 1 && node.args[1].isParenthesisNode && node.args[1].content.toString()[0] !== '-' && node.args[1].content.toString()[0] !== '+') node.args[1] = node.args[1].content\n      }\n    }\n    /*\n    * Transformer n+0 en n\n    */\n    if (params.suppr0 && node.isOperatorNode && node.op === '+' && node.fn !== 'unaryPlus') {\n      if (node.args[1].toString() === '0') {\n        node = node.args[0]\n      }\n    }\n    /*\n    * Transformer n1+0*n2 en n1\n    */\n    if (params.suppr0 && node.isOperatorNode && node.op === '+' && node.fn !== 'unaryPlus') {\n      if (\n        node.args[1].isOperatorNode &&\n        node.args[1].op === '*' &&\n        (\n          node.args[1].args[0].toString() === '0'\n        )\n      ) {\n        node = node.args[0]\n      }\n    }\n    /*\n    * Transformer 1*n en n et -1*n en -n\n    */\n    if (params.suppr1 && node.isOperatorNode && node.op === '*' && searchFirstNode(node.args[1]).node.type !== 'ConstantNode') {\n      if (node.args[0].toString() === '1') {\n        node = node.args[1]\n      } else if (node.args[0].toString() === '-1') {\n        node = math.parse('-' + node.args[1].toString())\n      }\n    }\n    /*\n    * Transformer n/1 en n et n/-1 en -n\n    */\n    if (params.suppr1 && node.isOperatorNode && node.op === '/') {\n      if (node.args[1].toString() === '1') {\n        node = node.args[0]\n      } else if (node.args[1].toString() === '-1') {\n        node = math.parse('-' + node.args[0].toString())\n      }\n    }\n    /*\n    * Transformer (n1)-n2 en n1-n2\n    * Transformer --c en -(-c)\n    * transformer n1-(n2/n3) en n1-n2/n3\n    */\n    if (node.isOperatorNode && node.op === '-') { // Enlève les parenthèses au premier terme d'une soustraction et au second sous condition d'une /\n      if (node.args[0].isParenthesisNode) node.args[0] = node.args[0].content\n      if (node.args.length === 1 && node.args[0].isConstantNode && node.args[0].value < 0) { // Pour corriger --3 en -(-3)\n        node.args[0] = Node.Creator.parenthesis(node.args[0])\n      }\n      if (node.args.length === 2 && node.args[1].isConstantNode && node.args[1].value < 0) { // Pour corriger 7--3 en 7-(-3)\n        node.args[1] = Node.Creator.parenthesis(node.args[1])\n      }\n      if (node.args.length === 2 && node.args[1].isParenthesisNode && node.args[1].content.toString()[0] !== '-') node.args[1] = node.args[1].content\n      /*\n      * Code à simplifier ?\n      */\n      if (\n        node.fn !== 'unaryMinus' && // On vérifie si c'est une vraie soustraction (avec deux termes)\n    node.args[1].isParenthesisNode && // On vérifie que le second terme possède une parenthèse\n    node.args[1].content.isOperatorNode && // On vérifie que le second terme contient une opération\n    (\n      node.args[1].content.op === '/' || // On teste si cette opération est une division\n      (\n        node.args[1].content.op === '*' && // On teste si c'est une multiplication\n        (\n          !node.args[1].content.args[0].isOperatorNode || // Si le premier facteur n'est pas une opération\n          (\n            node.args[1].content.args[0].isOperatorNode && // Ou si c'est une opération\n            node.args[1].content.args[0].fn !== 'unaryMinus' // mais que le premier argument n'est pas -blabla\n          )\n        )\n      )\n    )\n      ) node.args[1] = node.args[1].content\n    }\n    if (node.isOperatorNode && node.op === '*') { // Enlève les parenthèses aux deux facteurs d'une multiplication\n      if (node.args[0].isParenthesisNode && // On cherche à l'intérieur d'une parenthèse\n    (\n      !node.args[0].content.isOperatorNode || // Il ne faut pas d'opération\n      (node.args[0].content.isOperatorNode && node.args[0].content.op === '/') || // ou alors une divisions\n      (node.args[0].content.isOperatorNode && node.args[0].content.fn === 'unaryMinus' && params.supprPlusMoins) // ou alors un -n\n    )\n      ) { // Si l'une des conditions est vérifiée alors :\n        node.args[0] = node.args[0].content // on enlève la parenthèse\n        node.implicit = false // on fait en sorte que la multiplication soit visible\n      }\n      if (node.args[1].isParenthesisNode &&\n    (\n      !node.args[1].content.isOperatorNode ||\n      (\n        node.args[1].content.isOperatorNode &&\n        node.args[1].content.op === '/' &&\n        !(\n          node.args[1].content.args[0].type === 'OperatorNode' &&\n          node.args[1].content.args[0].fn === 'unaryMinus' &&\n          node.args[1].content.args[0].args[0].type === 'ConstantNode' &&\n          !(node.args[1].content.args[1].type === 'OperatorNode' && node.args[1].content.args[1].fn === 'unaryMinus')\n        )\n      )\n    )) {\n        node.args[1] = node.args[1].content\n        node.implicit = false\n      }\n    }\n    if (node.type === 'OperatorNode' && node.op === '*') { // Corrige n*-c en n*(-c)\n      if (node.args[1].toString()[0] === '-') {\n        node.args[1] = Node.Creator.parenthesis(node.args[1])\n      }\n    }\n    // Peut-être faut-il mettre à jour le mathjs de mathsteps car il semble que le code suivant ne fonctionne pas\n    // dans mathsteps lorsqu'il est placé dans print.js de mathsteps\n    // alors qu'il fonctionne avec la version mathjs de mathalea\n    if (node.isOperatorNode && node.op === '*') { // Multiplication implicite 2*x devient 2x et 2*(x+3) devient 2(x+3)\n      if ((node.args[1].isParenthesisNode || node.args[1].isSymbolNode) && !(searchLastNode(node.args[0]).node.isSymbolNode)) node.implicit = true\n      if (node.args[1].isOperatorNode && node.args[1].op === '^' && node.args[1].args[0].isSymbolNode) node.implicit = true\n    }\n    if (node.isOperatorNode && node.op === '*') { // Multiplication explicite x*2 ou x*2/3\n      if (node.args[1].isConstantNode) node.implicit = false\n      if (node.args[1].isOperatorNode && node.args[1].args[0].isConstantNode) node.implicit = false\n      if (node.args[1].isOperatorNode && node.args[1].op === '/') node.implicit = false\n      if (node.args[1].isOperatorNode && node.args[1].args[0].isOperatorNode && node.args[1].args[0].op === '/') node.implicit = false\n      if (node.args[1].isParenthesisNode && node.args[1].content.isOperatorNode && node.args[1].content.fn === 'unaryMinus') node.implicit = false\n    }\n    if (\n      node.isParenthesisNode &&\n      node.content.isOperatorNode &&\n        (\n          (node.content.op === '*' || node.content.op === '^') &&\n          (node.content.toString()[0] !== '-')\n        )\n    ) {\n      node = node.content\n    }\n    if (node.isParenthesisNode && node.content.isOperatorNode && node.content.op === '/') node = node.content\n    if (node.isOperatorNode && node.fn === 'unaryMinus' && node.args[0].isParenthesisNode && node.args[0].content.isOperatorNode && node.args[0].content.op === '*') node.args[0] = node.args[0].content\n    if (node.isOperatorNode && node.fn === 'unaryMinus' && node.args[0].isOperatorNode && node.args[0].op === '*') node = Node.Creator.operator('*', [Negative.negate(node.args[0].args[0]), node.args[0].args[1]])\n    // n(c*n) = n*(c*n) Je ne sais plus pourquoi !\n    if (\n      node.isOperatorNode && node.op === '*') {\n      const firstNode = searchFirstNode(node.args[1])\n      if (\n        firstNode.node.type === 'ConstantNode' &&\n        firstNode.op === '*'\n      ) { node.implicit = false }\n    }\n    return transformNode(node, parent, oldNode, params)\n  } else {\n    return node\n  }\n}\n\n/* Corrige le problème lié au conversions de (-3)² en -3² si on passe du format mathsteps au format mathjs\n*/\nfunction correctifNodeMathsteps (node) {\n  node = node.transform(\n    function (node) {\n      if (node.type === 'ConstantNode') {\n        return math.parse(node.value.toString())\n      }\n      return node\n    }\n  )\n  return node\n}\n\n/**\n * Retourne le format Latex d'un node mathjs ou mathsteps ou d'une expression ascii\n * Supprime les parenthèses inutiles, les 1 et les 0 inutiles, transforme les +- en -\n * @param {string|Object} node // Chaine de caractères décrivant une expression mathématique, une équation, une inéquation ou bien node mathjs\n * @param {Object} params // Paramètres\n * @returns {string} // Format latex\n * @example\n * toTex('3/2+4*x') -> \\dfrac{3}{2}+4x\n * toTex('1*x+-3=6*x+0') -> x-3=6x\n * toTex('-3/4') -> -\\dfrac{3}{4}\n * toTex('OA/OM=OB/ON',{OA: 1.2, OM: 1.5, OB: 1.7}) -> \\dfrac{1{.}2}{1{.}5}=\\dfrac{1{.}7}{OB}\n */\nexport function toTex (node, params = { suppr1: true, suppr0: true, supprPlusMoins: true, variables: undefined }) {\n  params = Object.assign({ suppr1: true, suppr0: true, supprPlusMoins: true }, params)\n  // On commence par convertir l'expression en arbre au format mathjs\n  let comparator\n  let sides = []\n  const comparators = ['=', '<', '>', '<=', '>=']\n  if (typeof node === 'string') {\n    for (let i = 0; i < comparators.length; i++) {\n      sides = node.split(comparators[i])\n      if (sides.length > 1) {\n        comparator = comparators[i]\n      }\n    }\n    if (comparator !== undefined) {\n      sides = node.split(comparator)\n    } else {\n      if (params.variables === undefined) {\n        node = math.parse(node)\n      } else {\n        node = math.parse(aleaExpression(node, params.variables))\n      }\n    }\n  } else {\n    // Le format mathsteps s'il est en entrée ne permet pas a priori de modifier les implicit\n    // De plus comme les multiplications peuvent avoir 3 ou plus de facteurs dans mathsteps\n    // et que le paramètre implicit s'applique alors à tous les facteurs\n    // cela devient impossible à traiter pour 4*x*(-5) qui donnerait 4x-5 avec implicit = true.\n    // Mais il faut un pré-traitement car sinon le passage de mathsteps à mathjs\n    // transforme les (-3)^2 en -3^2\n    node = correctifNodeMathsteps(node) // Convertit d'abord tous les ConstantNode au format mathjs\n    // node = math.parse(node.toString({ parenthesis: 'all' })) // Permet d'utiliser correctement les implicit\n    node = math.parse(math.format(node, { notation: 'fixed' })) // Permet d'utiliser correctement les implicit\n  }\n  /* if (sides.length === 2) {\n    const leftSide = toTex(sides[0], params)\n    const rightSide = toTex(sides[1], params)\n    return leftSide + comparator + rightSide\n  } */\n  if (sides.length > 1) {\n    const members = []\n    for (let i = 0; i < sides.length; i++) {\n      members.push(toTex(sides[i], params))\n    }\n    return members.join(comparator.replaceAll('>=', '\\\\geqslant').replaceAll('<=', '\\\\leqslant'))\n  }\n  let nodeClone\n  do { // À étudier, pour 79 et 85 et 50 cette boucle doit être maintenue\n    nodeClone = node.cloneDeep() // Vérifier le fonctionnement de .clone() et .cloneDeep() (peut-être y a-t-il un problème avec implicit avec cloneDeep())\n    node = node.transform(\n      function (node, path, parent) {\n        node = transformNode(node, parent, undefined, params)\n        return node\n      }\n    )\n  } while (node.toString() !== nodeClone.toString())\n\n  let nodeTex = node.toTex({ implicit: 'hide', parenthesis: 'keep', notation: 'fixed' }).replaceAll('\\\\cdot', '\\\\times ').replaceAll('.', '{,}').replaceAll('\\\\frac', '\\\\dfrac')\n\n  nodeTex = nodeTex.replace(/\\s*?\\+\\s*?-\\s*?/g, ' - ')\n  // Mathjs ajoute de manière non contrôlée des \\mathrm pour certaines ConstantNode\n  // En attendant de comprendre on les enlève (au risque d'avoir les {} restantes)\n  nodeTex = nodeTex.replaceAll('\\\\mathrm', '')\n  // Exclure les ~\n  nodeTex = nodeTex.replaceAll('~', '')\n  if (node.isConstantNode && node.value === undefined) nodeTex = ''\n  return nodeTex\n}\n\nexport function toString (node, params = { suppr1: true, suppr0: true, supprPlusMoins: true, variables: undefined }) {\n  params = Object.assign({ suppr1: true, suppr0: true, supprPlusMoins: true }, params)\n  // On commence par convertir l'expression en arbre au format mathjs\n  let comparator\n  let sides = []\n  const comparators = ['=', '<', '>', '<=', '>=']\n  if (typeof node === 'string') {\n    for (let i = 0; i < comparators.length; i++) {\n      sides = node.split(comparators[i])\n      if (sides.length > 1) {\n        comparator = comparators[i]\n      }\n    }\n    if (comparator !== undefined) {\n      sides = node.split(comparator)\n    } else {\n      if (params.variables === undefined) {\n        node = math.parse(node.toString())\n      } else {\n        node = math.parse(aleaExpression(node, params.variables))\n      }\n    }\n  } else {\n    // Le format mathsteps s'il est en entrée ne permet pas a priori de modifier les implicit\n    // De plus comme les multiplications peuvent avoir 3 ou plus de facteurs dans mathsteps\n    // et que le paramètre implicit s'applique alors à tous les facteurs\n    // cela devient impossible à traiter pour 4*x*(-5) qui donnerait 4x-5 avec implicit = true.\n    // Mais il faut un pré-traitement car sinon le passage de mathsteps à mathjs\n    // transforme les (-3)^2 en -3^2\n    node = correctifNodeMathsteps(node) // Convertit d'abord tous les ConstantNode au format mathjs\n    node = math.parse(node.toString({ parenthesis: 'all' })) // Permet d'utiliser correctement les implicit\n  }\n  /* if (sides.length === 2) {\n    const leftSide = toTex(sides[0], params)\n    const rightSide = toTex(sides[1], params)\n    return leftSide + comparator + rightSide\n  } */\n  if (sides.length > 1) {\n    const members = []\n    for (let i = 0; i < sides.length; i++) {\n      members.push(toTex(sides[i], params))\n    }\n    return members.join(comparator.replaceAll('>=', '\\\\geqslant').replaceAll('<=', '\\\\leqslant'))\n  }\n  let nodeClone\n  do { // À étudier, pour 79 et 85 et 50 cette boucle doit être maintenue\n    nodeClone = node.cloneDeep() // Vérifier le fonctionnement de .clone() et .cloneDeep() (peut-être y a-t-il un problème avec implicit avec cloneDeep())\n    node = node.transform(\n      function (node, path, parent) {\n        node = transformNode(node, parent, undefined, params)\n        return node\n      }\n    )\n  } while (node.toString() !== nodeClone.toString())\n\n  // if (node.isConstantNode && node.value === undefined) nodeTex = ''\n  return node.toString({ implicit: 'show', parenthesis: 'keep' }).replace(/\\s*?\\+\\s*?-\\s*?/g, ' - ')\n}\n\nexport function expressionLitterale (expression = '(a*x+b)*(c*x-d)', assignations = { a: 1, b: 2, c: 3, d: -6 }) {\n  // Ne pas oublier le signe de la multiplication\n  return math.simplify(expression, [{ l: '1*n', r: 'n' }, { l: '-1*n', r: '-n' }, { l: 'n/1', r: 'n' }, { l: 'c/c', r: '1' }, { l: '0*v', r: '0' }, { l: '0+v', r: 'v' }], assignations)\n}\n\nexport function aleaExpression (expression = '(a*x+b)*(c*x-d)', assignations = { a: 1, b: 2, c: 3, d: -6 }) {\n  // const assignationsDecimales = Object.assign({}, assignations)\n  const assignationsDecimales = Object.assign({}, aleaVariables(assignations))\n  for (const v of Object.keys(assignationsDecimales)) {\n    if (typeof assignationsDecimales[v] !== 'number') {\n      assignationsDecimales[v] = assignationsDecimales[v].valueOf()\n    }\n  }\n  return assignVariables(expression, assignationsDecimales).toString({ parenthesis: 'keep' })\n  // return math.simplify(expression, [], assignationsDecimales).toString({ parenthesis: 'all' })\n}\n\n/**\n * @description Retourne des valeurs aléatoires sous certaines contraintes données.\n * Les calculs se font si possible avec mathjs au format fraction\n * @param {Object} variables // Propriété réservée : test\n * @param {Object} params // valueOf à true pour avoir les valeurs décimales, format à true pour appliquer texNombre2\n * // type à 'decimal' et valueOf à true pour obtenir des instances de Decimal()\n * @returns {Object}\n * @see {@link https://mathjs.org/docs/expressions/syntax.html|Mathjs}\n * @see {@link https://coopmaths.fr/documentation/tutorial-Outils_Mathjs.html|Mathjs}\n * @example\n * aleaVariable({a: true}, {valueOf: true}) --> {a: -3} // Génère un entier non nul entre -10 et 10\n * aleaVariable({a: true, b: true}, {valueOf: true}) --> {a: 5, b: -7}\n * aleaVariable({a: false, b: false}, {valueOf: true}) --> {a: 4, b: 1} // false => entier entre 1 et 10\n * aleaVariable({a: true, b: true, test: 'a>b'}, {valueOf: true}) --> {a: 3, b: 1}\n * aleaVariable({a: true, b: true, test: 'a+b>2'}, {valueOf: true}) --> {a: 10, b: -6}\n * aleaVariables({a: true}) --> {a: Fraction} // Fraction est un objet de mathjs\n * @author Frédéric PIOU\n */\nexport function aleaVariables (variables = { a: true, b: true, c: true, d: true }, params = { valueOf: true, format: false, type: 'number' }) {\n  // Conservation de la graine aléatoire\n  math.config({ randomSeed: context.graine })\n  // Placer dans cet objet chacune des variables après calcul\n  const assignations = {}\n  // Un compteur pour vérifier que les contraintes ne sont pas excessives\n  let cpt = 0\n  // Le test pour vérifier que les contraintes sont respectées\n  // Remarque : Il serait plus pratique de pouvoir écrire le test en plusieurs lignes\n  let test = true\n  do { // Une boucle tant que les contraintes ne sont pas vérifiées et tant qu'on ne dépasse pas 1000 essais.\n    cpt++\n    for (const v of Object.keys(variables)) { // On parcourt chaque variable\n      switch (typeof variables[v]) {\n        case 'object':\n          break\n        case 'boolean': // On génère un nombre aléatoire non nul entre 1 et 10 si false et entre -10 et 10 si true\n          assignations[v] = math.fraction( // On contraint le résultat à être une fraction\n            math.evaluate(\n              '(pickRandom([-1,1]))^(n)*randomInt(1,10)',\n              { n: variables[v] }\n            )\n          )\n          break\n        case 'number': // On ne fait que le convertir en fraction\n          if (params.type === 'decimal') assignations[v] = math.bignumber(variables[v])\n          else assignations[v] = math.fraction(variables[v])\n          break\n        case 'string':\n          // Parser l'expression\n          // Parcourir le noeud et repérer les points sensibles (division, décimaux)\n          try { // On tente les calculs exacts avec mathjs\n            if (params.type === 'decimal') {\n              math.config({ number: 'BigNumber' })\n              assignations[v] = math.evaluate(variables[v], assignations)\n              math.config({ number: 'number' })\n            } else if (params.type === 'fraction') {\n              math.config({ number: 'Fraction' })\n              assignations[v] = math.evaluate(variables[v], assignations)\n              math.config({ number: 'number' })\n            } else {\n              assignations[v] = math.evaluate(variables[v], assignations)\n            }\n          } catch { // Sinon on cherche à la transformer en fraction après coup\n            try {\n              if (params.type === 'decimal') assignations[v] = math.bignumber(math.evaluate(variables[v], assignations))\n              else assignations[v] = math.fraction(math.evaluate(variables[v], assignations))\n            } catch { // Sinon on fait sans mais on revient à des nombres de type 'number'\n              const values = Object.assign({}, assignations)\n              for (const v of Object.keys(values)) {\n                values[v] = values[v].valueOf()\n              }\n              if (params.type === 'decimal') {\n                math.config({ number: 'BigNumber' })\n                assignations[v] = math.evaluate(variables[v], values)\n                math.config({ number: 'number' })\n              } else assignations[v] = math.evaluate(variables[v], values)\n            }\n          }\n          break\n      }\n    }\n    // On teste maintenant si les contraintes sont vérifiées\n    if (variables.test !== undefined) test = math.evaluate(variables.test, assignations)\n  } while (!test && cpt < 1000)\n  if (cpt === 1000) window.notify('Attention ! 1000 essais dépassés.\\n Trop de contraintes.\\n Le résultat ne vérifiera pas le test.')\n  if (params.valueOf) {\n    for (const v of Object.keys(assignations)) {\n      if (typeof assignations[v] !== 'number') {\n        if (!(assignations[v] instanceof Decimal)) assignations[v] = assignations[v].valueOf()\n      }\n    }\n  }\n  if (params.format) {\n    for (const v of Object.keys(assignations)) {\n      assignations[v] = texNombre2(assignations[v])\n    }\n  }\n  return assignations\n}\n\n/*\n* Objet mathsteps : Permet de traverser toutes les étapes et sous-étapes\n*/\nexport function traverserEtapes (steps, changeType = [], result = []) {\n  steps.forEach(function (step) {\n    if (changeType.length === 0) {\n      if (step.substeps.length === 0) result.push(step)\n      return traverserEtapes(step.substeps, changeType, result)\n    } else {\n      result.push(step)\n      if (changeType.some(x => step.changeType === x)) {\n        return traverserEtapes(step.substeps, changeType, result)\n      }\n    }\n  })\n  return result\n}\n\n/**\n * @description Retourne toutes les étapes de calculs d'une expression numérique ou de développement-réduction d'une expression littérale\n * @param {string} expression // Une expression à calculer ou à développer\n * @param {object} params // Les paramètres (commentaires visibles , sous-étapes visibles, fraction-solution au format MixedNumber)\n*/\nexport function calculer (expression, params) {\n  params = Object.assign({ comment: false, comments: {}, substeps: false, mixed: false, name: undefined, suppr1: true }, params)\n  // La fonction simplifyExpression est une fonction mathsteps\n  // Elle renvoie toutes les étapes d'un calcul numérique ou d'un développement-réduction\n  // L'addition de deux fractions est classée dans les sous-étapes bizarrement\n  // Les calculs se font de la gauche vers la droite et dès que c'est possible dans le respect des priorités\n  // Les termes de même nature sont regroupés avant d'effectuer les calculs :\n  // Les SymbolNode par exposant décroissant, puis Les constantes et enfin les fractions\n  // Parfois les COLLECT LIKE TERMS ne donnent pas de changement ???\n  // A faire : Virer l'étape précédent un REMOVE MULTIPLYING BY ONE et lui prendre son commentaire\n  // A faire : Même chose pour REMOVE ADDING ZERO\n  // La suite de CANCEL TERMS peut être applanie\n  // Refaire la méthode transform() pour qu'elle ne modifie rien d'autre de notre noeud que ce qu'on souhaite\n  // Si ça fonctionne on peut régler le problème des implicit qui disparaissent ? des (-3)² qui deviennent -3² ?\n  // A faire : Ajouter un paramètre parenthesis à chaque noeud, ou il faudrait le faire dans Mathjs ?\n  // BUG : http://localhost:8080/mathalea.html?ex=betaEquations,s=125\n  if (params.variables !== undefined) expression = aleaExpression(expression, params.variables)\n  const expressionPrint = toTex(expression, params)\n  const steps = params.substeps ? traverserEtapes(simplifyExpression(expression)) : simplifyExpression(expression)\n  const stepsExpression = []\n  // const commentaires = []\n  const comments = []\n  steps.forEach(function (step, i) {\n    const oldNode = step.oldNode !== null ? toTex(step.oldNode, params) : ''\n    const newNode = toTex(step.newNode, params)\n    if (newNode === oldNode) stepsExpression.pop()\n    if (params.comment) {\n      const comment = commentStep(step, params.comments)\n      // const commentaire = `\\\\text{${step.changeType}}`.replaceAll('_', ' ')\n      // commentaires.push(commentaire)\n      comments.push(comment)\n      if (stepsExpression.length === 0 || i === steps.length - 1) {\n        if (params.name === undefined) {\n          stepsExpression.push(`${expressionPrint}&=${newNode}&&${comment}`)\n        } else {\n          if (stepsExpression.length === 0) {\n            stepsExpression.push(`${params.name}&=${expressionPrint}&&${comment}`)\n            stepsExpression.push(`&=${newNode}&&${comment}`)\n          } else {\n            stepsExpression.push(`${params.name}&=${newNode}&&${comment}`)\n          }\n        }\n      } else {\n        stepsExpression.push(`&=${newNode}&&${comment}`)\n      }\n    } else {\n      if (stepsExpression.length === 0 || i === steps.length - 1) {\n        if (params.name === undefined) {\n          stepsExpression.push(`${expressionPrint}&=${newNode}`)\n        } else {\n          if (stepsExpression.length === 0) {\n            stepsExpression.push(`${params.name}&=${expressionPrint}`)\n            stepsExpression.push(`&=${newNode}`)\n          } else {\n            stepsExpression.push(`${params.name}&=${newNode}`)\n          }\n        }\n      } else {\n        stepsExpression.push(`&=${newNode}`)\n      }\n    }\n  })\n  if (params.mixed === true && steps[steps.length - 1].newNode.type === 'OperatorNode' &&\n  steps[steps.length - 1].newNode.op === '/' &&\n  steps[steps.length - 1].newNode.args[0].type === 'ConstantNode' &&\n  steps[steps.length - 1].newNode.args[1].type === 'ConstantNode' &&\n  (\n    Math.abs(steps[steps.length - 1].newNode.args[0].value) > steps[steps.length - 1].newNode.args[1].value ||\n    steps[steps.length - 1].newNode.args[0].value < 0\n  )\n  ) {\n    const plus = steps[steps.length - 1].newNode.args[0].value < 0 ? '-' : '+'\n    stepsExpression.push(\n      '&=' + toTex(\n        math.parse(\n          math.fraction(\n            steps[steps.length - 1].newNode.args[0].value,\n            steps[steps.length - 1].newNode.args[1].value\n          ).toFraction(true).replace(' ', plus)\n        ), params\n      )\n    )\n  }\n  const texte = `Calculer $${expressionPrint}$.`\n  const texteCorr = `$\\\\begin{aligned}\\n${stepsExpression.join('\\\\\\\\\\n')}\\n\\\\end{aligned}$`\n  return { result: steps.length > 0 ? steps[steps.length - 1].newNode.toString() : expressionPrint, printResult: steps.length > 0 ? toTex(steps[steps.length - 1].newNode, params.totex) : expressionPrint, netapes: stepsExpression.length, texteDebug: texte + texteCorr, texte, texteCorr, stepsLatex: stepsExpression, steps, commentaires: comments, printExpression: expressionPrint, name: params.name }\n}\n\nexport function aleaEquation (equation = 'a*x+b=c*x-d', variables = { a: false, b: false, c: false, d: false, test: 'a>b or true' }, debug = false) { // Ne pas oublier le signe de la multiplication\n  const comparators = ['<=', '>=', '=', '<', '>']\n  const assignations = aleaVariables(variables, debug)\n  for (const v of Object.keys(assignations)) {\n    assignations[v] = math.number(assignations[v])\n  }\n  let comparator\n  let sides\n  for (let i = 0; i < comparators.length; i++) {\n    const comparatorSearch = comparators[i]\n    sides = equation.split(comparatorSearch)\n    if (sides.length === 2) {\n      comparator = comparatorSearch\n    }\n  }\n  sides = equation.split(comparator)\n  const leftNode = expressionLitterale(sides[0], assignations, debug).toString()\n  const rightNode = expressionLitterale(sides[1], assignations, debug).toString()\n  if (debug) {\n    console.log('Équation à résoudre : ', `${leftNode}${comparator}${rightNode}`)\n  }\n  return `${leftNode}${comparator}${rightNode}`\n}\n\nexport function resoudreEquation (equation = '5(x-7)=3(x+1)', debug = false) {\n  const comparators = ['<=', '>=', '=', '<', '>']\n  let comparator\n  let sides\n  for (let i = 0; i < comparators.length; i++) {\n    const comparatorSearch = comparators[i]\n    sides = equation.split(comparatorSearch)\n    if (sides.length === 2) {\n      comparator = comparatorSearch\n    }\n  }\n  sides = equation.split(comparator)\n  // const equation0 = equation.replace(comparator, `+0${comparator}0+`)\n  let equationPrint\n  const steps = solveEquation(equation)\n  if (debug) {\n    console.log('* steps :')\n    console.log(steps)\n  }\n  const stepsNewEquation = []\n  let repetition = 0\n  steps.forEach(function (step, i) {\n    const changement = step.changeType\n    if (step.oldEquation !== null) {\n      if (step.oldEquation.leftNode.toString() === step.newEquation.leftNode.toString() || step.oldEquation.rightNode.toString() === step.newEquation.rightNode.toString()) {\n        if (changement !== 'REMOVE_ADDING_ZEROS') repetition = (repetition + 1) % 3\n      } else {\n        repetition = 0\n      }\n    }\n    const oldLeftNode = step.oldEquation !== null ? toTex(step.oldEquation.leftNode) : ''\n    let newLeftNode = toTex(step.newEquation.leftNode)\n    const oldRightNode = step.oldEquation !== null ? toTex(step.oldEquation.rightNode) : ''\n    let newRightNode = toTex(step.newEquation.rightNode)\n    /* const oldLeftNode = step.oldEquation !== null ? printMS.latex(step.oldEquation.leftNode, false) : ''\n    let newLeftNode = printMS.latex(step.newEquation.leftNode, false)\n    const oldRightNode = step.oldEquation !== null ? printMS.latex(step.oldEquation.rightNode, false) : ''\n    let newRightNode = printMS.latex(step.newEquation.rightNode, false) */\n    if (debug) {\n      console.log(changement)\n      console.log(newLeftNode.toString() + step.newEquation.comparator + newRightNode.toString())\n    }\n    if (i === 0) {\n      equationPrint = `${oldLeftNode}${step.newEquation.comparator}${oldRightNode}`\n    }\n    const color = repetition === 2 ? 'black' : 'red'\n    newLeftNode = `{\\\\color{${color}}${newLeftNode.replace(oldLeftNode, `{\\\\color{black}${oldLeftNode}}`)}}`\n    newRightNode = `{\\\\color{${color}}${newRightNode.replace(oldRightNode, `{\\\\color{black}${oldRightNode}}`)}}`\n    if (debug) console.log(newLeftNode + step.newEquation.comparator + newRightNode)\n    const stepChange = getNewChangeNodes(step).length > 0 ? toTex(math.parse(getNewChangeNodes(step)[0].toString(), { parenthesis: 'auto' })) : ''\n    let commentaires = {\n      MULTIPLY_BOTH_SIDES_BY_NEGATIVE_ONE: String.raw`\\text{Multiplier les deux membres par }-1`,\n      SUBTRACT_FROM_BOTH_SIDES: String.raw`\\text{Soustraire }${stepChange}\\text{ à chaque membre}`,\n      ADD_TO_BOTH_SIDES: String.raw`\\text{Ajouter }${stepChange}\\text{ à chaque membre}`,\n      MULTIPLY_TO_BOTH_SIDES: String.raw`\\text{Multiplier chaque membre par }${stepChange}`,\n      DIVIDE_FROM_BOTH_SIDES: String.raw`\\text{Diviser chaque membre par }${stepChange}`,\n      MULTIPLY_BOTH_SIDES_BY_INVERSE_FRACTION: String.raw`\\text{Multiplier chaque membre par }${stepChange}`\n    }\n    if (debug) {\n      commentaires = Object.assign(commentaires, {\n        STATEMENT_IS_FALSE: String.raw`\\text{L'égalité est fausse}`,\n        STATEMENT_IS_TRUE: String.raw`\\text{L'égalité est vraie}`,\n        DISTRIBUTE: String.raw`\\text{Distribution}`,\n        SIMPLIFY_RIGHT_SIDE: String.raw`\\text{Simplifier le membre de droite}`,\n        SIMPLIFY_LEFT_SIDE: String.raw`\\text{Simplifier le membre de gauche}`,\n        COLLECT_AND_COMBINE_LIKE_TERMS: String.raw`\\text{Regrouper et réduire les termes de même nature}`,\n        SIMPLIFY_ARITHMETIC: String.raw`\\text{Calcul arithmétique}`,\n        SIMPLIFY_FRACTION: String.raw`\\text{Simplifier une fraction}`,\n        REMOVE_MULTIPLYING_BY_NEGATIVE_ONE: String.raw`\\text{Calculer la multiplication par }-1`,\n        REMOVE_ADDING_ZERO: String.raw`\\text{Enlever des zéros}`,\n        SWAP_SIDES: String.raw`\\text{Echanger les deux membres}`,\n        CANCEL_MINUSES: String.raw`\\text{Annuler les signes moins}`,\n        FIND_ROOTS: String.raw`\\text{Trouver la (ou les) solution(s)}`,\n        SIMPLIFY_SIGNS: String.raw`\\text{Simplifier le signe}`,\n        MULTIPLY_BY_ZERO: String.raw`\\text{Multiplication par zéro}`,\n        ADD_FRACTIONS: String.raw`\\text{Additionner des fractions}`,\n        BREAK_UP_FRACTION: String.raw`\\text{Séparer une fraction}`,\n        CANCEL_TERMS: String.raw`\\text{Annuler les termes}`,\n        REMOVE_MULTIPLYING_BY_ONE: String.raw`\\text{Retirer la multiplication par } 1`\n      })\n    }\n    if (commentaires[changement] === undefined) commentaires[changement] = ''\n    if (repetition === 2) {\n      repetition = 0\n      stepsNewEquation.pop()\n      if (changement !== 'REMOVE_ADDING_ZERO') stepsNewEquation.push(String.raw`${newLeftNode}&${step.newEquation.comparator}${newRightNode}&&${commentaires[changement]}`)\n    } else {\n      if (changement !== 'REMOVE_ADDING_ZERO') stepsNewEquation.push(String.raw`${newLeftNode}&${step.newEquation.comparator}${newRightNode}&&${commentaires[changement]}`)\n    }\n    if (debug) console.log('changement', commentaires[changement])\n  })\n  let texte = String.raw`Résoudre $${equationPrint}$`\n  const texteCorr = String.raw`\n  $\\begin{aligned}\n  ${stepsNewEquation.join('\\\\\\\\')}\n  \\end{aligned}$\n  `\n  if (debug) texte = texteCorr\n  return { texte, texteCorr, equation: equationPrint }\n}\n\nexport function commentStep (step, comments) {\n  const changement = step.changeType\n  const stepChange = step.stepChange\n  // const stepChange = getNewChangeNodes(step).length > 0 ? toTex(math.parse(getNewChangeNodes(step)[0].toString(), { parenthesis: 'auto' })) : ''\n  const defaultComments = {\n    CROSS_PRODUCT_EQUALITY: `Cross product equality if $${stepChange}$.`,\n    MULTIPLY_BOTH_SIDES_BY_NEGATIVE_ONE: 'Multiply both sides by $-1$.',\n    SUBTRACT_FROM_BOTH_SIDES: `Subtract $${stepChange}$ from each member.`,\n    ADD_TO_BOTH_SIDES: `Add $${stepChange}$ to each member`,\n    MULTIPLY_TO_BOTH_SIDES: `Multiply each member by $${stepChange}$.`,\n    DIVIDE_FROM_BOTH_SIDES: `Divide each member by $${stepChange}$.`,\n    MULTIPLY_BOTH_SIDES_BY_INVERSE_FRACTION: `Multiply each side by $${stepChange}$.`,\n    SWAP_SIDES: 'Swap both members.',\n    STATEMENT_IS_FALSE: 'Equality is false.',\n    STATEMENT_IS_TRUE: 'Equality is true.',\n    DISTRIBUTE: 'Distribution.',\n    SIMPLIFY_RIGHT_SIDE: 'Simplify the right side.',\n    SIMPLIFY_LEFT_SIDE: 'Simplify left side.',\n    COLLECT_AND_COMBINE_LIKE_TERMS: 'Group and collapse terms of the same nature.',\n    SIMPLIFY_ARITHMETIC: 'Arithmetic calculation.',\n    SIMPLIFY_FRACTION: 'Simplify a fraction.',\n    REMOVE_MULTIPLYING_BY_NEGATIVE_ONE: 'Calculate multiplication by $-1$.',\n    REMOVE_ADDING_ZERO: 'Remove zeros.',\n    CANCEL_MINUSES: 'Cancel minus signs.',\n    FIND_ROOTS: 'Find the solution(s).',\n    SIMPLIFY_SIGNS: 'Simplify sign.',\n    MULTIPLY_BY_ZERO: 'Multiply by zero.',\n    ADD_FRACTIONS: 'Add fractions.',\n    BREAK_UP_FRACTION: 'Separate a fraction.',\n    CANCEL_TERMS: 'Cancel terms.',\n    REMOVE_MULTIPLYING_BY_ONE: 'Remove multiplication by $1$.',\n    COLLECT_LIKE_TERMS: 'Collect terms.',\n    MULTIPLY_DENOMINATORS: 'Calculate denominators.',\n    ADD_EXPONENT_OF_ONE: 'Add exponent 1.',\n    COLLECT_POLYNOMIAL_EXPONENTS: 'Add exponent 1.',\n    COMMON_DENOMINATOR: 'Get the same denominator.',\n    MULTIPLY_NUMERATORS: 'Calculate.',\n    COMBINE_NUMERATORS: 'Combine numerators.',\n    ADD_NUMERATORS: 'Add the numerators.',\n    ADD_COEFFICIENT_OF_ONE: 'Add coefficient $1$',\n    GROUP_COEFFICIENTS: 'Group coefficients.',\n    FIND_GCD: 'Find the greatest common divisor.',\n    CANCEL_GCD: 'Simplify by PGCD.',\n    MULTIPLY_FRACTIONS: 'Multiply two fractions.'\n  }\n  comments = Object.assign(defaultComments, comments)\n  return (comments[changement] !== undefined) ? `\\\\text{${comments[changement].replaceAll('{stepChange}', `$${stepChange}$`)}}` : ''\n}\n\n/**\n * Check if x is a decimal number\n * @param {Object} x // Object type = Fraction (mathjs)\n * @returns {boolean}\n */\nexport function isDecimal (value) {\n  let f\n  if (typeof value === 'number') {\n    f = math.fraction(value)\n  } else if (typeof value === 'string') {\n    f = math.fraction(value.replaceAll(' ', ''))\n  } else {\n    f = value.clone()\n  }\n  return f.d !== 1 && !obtenirListeFacteursPremiers(f.d).some(x => x !== 2 && x !== 5)\n}\n\n/**\n * Find if there is a SymbolNode in the node\n * @param {Mathnode} node\n * @returns {boolean}\n */\nfunction isContentSymbolNode (node) {\n  let result = false\n  node.traverse(x => { if (x.isSymbolNode) result = true })\n  return result\n}\n\n/**\n* @description Retourne toutes les étapes de résolution d'une équation ou d'une inéquation\n* @param {Objet} params // Les paramètres (commentaires visibles)\n* @param {string} equation // Une équation ou une inéquation\n* @example\n* resoudre('2*x+4=4*x-5') --> Donne les étapes de la résolution de l'équation\n* resoudre('2*x+4=4*x-5'), {comment: true}) --> Ajoute les commentaires\n* resoudre('2*x+4=4*x-5', {color: blue}) -> Met en bleu les changements à chaque étape\n* resoudre('2*x+4=4*x-5', {substeps: true}) --> Ajoute les sous-étapes\n* resoudre('2*x+4=4*x-5', {produitsencroix: true}) --> Utilise les produits en croix lorsque l'inconnue est au dénominateur a/f(x)=b/c\n* resoudre('2*x+4=4*x-5', {verifications: true}) --> Ajoute les vérifications de la solution\n* resoudre('a*x+c=b*x+d', {variables: {a: true, b: true, c: true, d: true, test: 'a!=b'}}) --> a, b, c et d sont choisis au hasard voir la fonction aleaVariables()\n* resoudre('2*x+4=4*x-5', {comment: true, comments: commentairesPersonnalises}) --> commentairesPersonnalises est un tableau avec des commentaires personnalisés (voir fonction commentStep())\n*/\nexport function resoudre (equation, params) {\n  /*\n    formatSolution\n      2 (défaut) : décimal si la solution a 2 chiffres ou moins après la virgule, fraction sinon\n      n : décimal si la solution a n chiffres ou moins après la virgule, fraction sinon\n      'decimal' : decimal lorsque c'est possible, sinon fraction\n      'fraction' : fraction (ou entier lorsque c'est possible)\n  */\n  params = Object.assign({ comment: false, color: 'red', comments: {}, reduceSteps: true, formatSolution: 2, substeps: false, changeType: [], produitsencroix: false, verifications: false }, params)\n  // Un bug de mathsteps ne permet pas de résoudre 2/x=2 d'où la ligne suivante qui permettait de le contourner\n  // const equation0 = equation.replace(comparator, `+0${comparator}0+`)\n  // A priori le traitement actuel n'occure plus ce bug (raison ?).\n  if (params.variables !== undefined) equation = aleaEquation(equation, params.variables)\n  let printEquation\n  let steps = params.substeps ? traverserEtapes(solveEquation(equation), params.changeType) : solveEquation(equation)\n  // Rechercher une équation de la forme a/x=b/c ou a/b=c/x et utiliser l'égalité des produits en croix\n  let newSteps = []\n  if (params.produitsencroix && steps[0].oldEquation.comparator === '=') {\n    let i = 0\n    do {\n      const leftNode = steps[i].oldEquation.leftNode.cloneDeep()\n      const rightNode = steps[i].oldEquation.rightNode.cloneDeep()\n      if (leftNode.isOperatorNode && leftNode.fn === 'divide' && isContentSymbolNode(leftNode.args[1])) {\n        if (rightNode.isOperatorNode && rightNode.fn === 'divide') {\n          steps[i].newEquation.rightNode = new math.OperatorNode('*', 'multiply', [leftNode.args[0], rightNode.args[1]])\n          steps[i].newEquation.leftNode = new math.OperatorNode('*', 'multiply', [rightNode.args[0], leftNode.args[1]])\n          steps[i].changeType = 'CROSS_PRODUCT_EQUALITY'\n          const stepChanges = []\n          if (isContentSymbolNode(leftNode.args[1])) stepChanges.push(toTex(leftNode.args[1].toString()) + '\\\\neq 0')\n          if (isContentSymbolNode(rightNode.args[1])) stepChanges.push(toTex(rightNode.args[1].toString()) + '\\\\neq 0')\n          steps[i].stepChange = stepChanges.join('\\\\text{ et }')\n          const newEquation = steps[i].newEquation.ascii()\n          newSteps = params.substeps ? traverserEtapes(solveEquation(newEquation), params.changeType) : solveEquation(newEquation)\n          steps = steps.slice(0, i + 1).concat(newSteps)\n        }\n      } else if (rightNode.isOperatorNode && rightNode.fn === 'divide' && isContentSymbolNode(rightNode.args[1])) {\n        if (leftNode.isOperatorNode && leftNode.fn === 'divide') {\n          steps[i].newEquation.rightNode = new math.OperatorNode('*', 'multiply', [rightNode.args[0], leftNode.args[1]])\n          steps[i].newEquation.leftNode = new math.OperatorNode('*', 'multiply', [leftNode.args[0], rightNode.args[1]])\n          steps[i].changeType = 'CROSS_PRODUCT_EQUALITY'\n          const stepChanges = []\n          if (isContentSymbolNode(leftNode.args[1])) stepChanges.push(toTex(leftNode.args[1].toString()) + '\\\\neq 0')\n          if (isContentSymbolNode(rightNode.args[1])) stepChanges.push(toTex(rightNode.args[1].toString()) + '\\\\neq 0')\n          steps[i].stepChange = stepChanges.join('\\\\text{ et }')\n          const newEquation = steps[i].newEquation.ascii()\n          newSteps = params.substeps ? traverserEtapes(solveEquation(newEquation), params.changeType) : solveEquation(newEquation)\n          steps = steps.slice(0, i + 1).concat(newSteps)\n        }\n      }\n      i += 1\n    } while (i < steps.length && newSteps.length < 1)\n  }\n  const stepsNewEquation = []\n  let repetition = 0\n  steps.forEach(function (step, i) {\n    const changement = step.changeType\n    if (step.changeType !== 'CROSS_PRODUCT_EQUALITY') step.stepChange = getNewChangeNodes(step).length > 0 ? toTex(math.parse(getNewChangeNodes(step)[0].toString(), { parenthesis: 'auto' })) : ''\n    if (step.oldEquation !== null) {\n      if (params.reduceSteps && (step.oldEquation.leftNode.toString() === step.newEquation.leftNode.toString() || step.oldEquation.rightNode.toString() === step.newEquation.rightNode.toString())) {\n        if (changement !== 'REMOVE_ADDING_ZEROS') repetition = (repetition + 1) % 3\n      } else {\n        repetition = 0\n      }\n    }\n    const oldLeftNode = step.oldEquation !== null ? toTex(step.oldEquation.leftNode, params) : ''\n    let newLeftNode = toTex(step.newEquation.leftNode, params)\n    const oldRightNode = step.oldEquation !== null ? toTex(step.oldEquation.rightNode, params) : ''\n    let newRightNode = toTex(step.newEquation.rightNode, params)\n    const newEquationComparator = toTex(step.newEquation.comparator)\n    if (i === 0) {\n      // printEquation = `${oldLeftNode}${step.newEquation.comparator}${oldRightNode}`\n      printEquation = `${toTex(step.oldEquation.ascii())}`\n      stepsNewEquation.push(\n        String.raw`${oldLeftNode}&${toTex(step.oldEquation.comparator)}${oldRightNode}`)\n    }\n    if (params.color !== 'black') {\n      const color = repetition === 2 ? 'black' : params.color\n      newLeftNode = `{\\\\color{${color}}${newLeftNode.replace(oldLeftNode, `{\\\\color{black}${oldLeftNode}}`)}}`\n      newRightNode = `{\\\\color{${color}}${newRightNode.replace(oldRightNode, `{\\\\color{black}${oldRightNode}}`)}}`\n    }\n    const comment = commentStep(step, params.comments)\n    if (repetition === 2) {\n      repetition = 0\n      stepsNewEquation.pop()\n      stepsNewEquation.push(`${newLeftNode}&${newEquationComparator}${newRightNode}${params.comment ? `&&${comment}` : ''}`)\n    } else {\n      stepsNewEquation.push(`${newLeftNode}&${newEquationComparator}${newRightNode}${params.comment ? `&&${comment}` : ''}`)\n    }\n  })\n  const lastEquation = steps[steps.length - 1].newEquation\n  let answer = lastEquation.rightNode\n  if (params.formatSolution !== 'fraction' && !(answer.isConstantNode)) {\n    try {\n      // On ve tenter d'obtenir le résultat sous forme de fraction, si ce n'est pas possible on quitte le try\n      math.config({ number: 'Fraction' })\n      answer = math.evaluate(answer.eval())\n      math.config({ number: 'number' })\n      // On regarde si le résultat a un nombre fini de chiffres après la virgule et n'est pas un entier\n      if (isDecimal(answer)) {\n        answer = math.round(answer.valueOf(), 15) // convertit la fraction en nombre décimal en évitant les problèmes de float\n        if (params.formatSolution === 'decimal' || (typeof params.formatSolution === 'number' && answer.toString().split('.')[1].length <= params.formatSolution)) {\n          // On rajoute une étape de conversion de la fraction en nombre décimal\n          stepsNewEquation.push(`${toTex(lastEquation.leftNode, params)}&${toTex(lastEquation.comparator + answer.toString())}`)\n        }\n      }\n    } catch (e) {}\n  }\n\n  const texte = `Résoudre $${printEquation}$.`\n  let texteCorr = `$\\\\begin{aligned}\\n${stepsNewEquation.join('\\\\\\\\\\n')}\\n\\\\end{aligned}$`\n  const solution = {\n    printDecimal: texNombre2(math.evaluate(steps[steps.length - 1].newEquation.ascii().split(steps[steps.length - 1].newEquation.comparator)[1])),\n    decimal: math.evaluate(steps[steps.length - 1].newEquation.ascii().split(steps[steps.length - 1].newEquation.comparator)[1]),\n    exact: steps[steps.length - 1].newEquation.ascii().split(steps[steps.length - 1].newEquation.comparator)[1],\n    print: toTex(steps[steps.length - 1].newEquation.ascii())\n  }\n  let calculateLeftSide, calculateRightSide\n  if (steps[steps.length - 1].newEquation.leftNode.isSymbolNode) {\n    const sides = equation.split(steps[0].oldEquation.comparator)\n    const SymbolNode = steps[steps.length - 1].newEquation.leftNode.toString()\n    const thesolution = steps[steps.length - 1].newEquation.rightNode.toString()\n    calculateLeftSide = calculer(sides[0].replaceAll(SymbolNode, `(${thesolution})`))\n    calculateRightSide = calculer(sides[1].replaceAll(SymbolNode, `(${thesolution})`))\n  }\n  if (params.verifications) {\n    texteCorr = `<br>\n          ${texteCorr}<br>\n          La solution est $${solution.print}$.\n          <br>\n          $\\\\textit{Vérification :}$\n          <br>\n          $\\\\bullet$ D'une part : $${calculateLeftSide.printExpression}=${calculateLeftSide.printResult}$\n          <br>\n          $\\\\bullet$ D'autre part : $${calculateRightSide.printExpression}=${calculateRightSide.printResult}$\n          `\n  }\n  return {\n    solution,\n    texte,\n    texteCorr,\n    equation: printEquation,\n    verifLeftSide: calculateLeftSide,\n    verifRightSide: calculateRightSide,\n    steps,\n    printSteps: stepsNewEquation\n  }\n}\n\nexport function programmeCalcul (stepProg = ['+', '-', '*', '/', '^2', '2*x', '3*x', '-2*x', '-3*x', 'x^2', '-x^2', 'x', '-x', '*x', '/x'], nombreChoisi, debug = false) {\n  const rules = math.simplify.rules\n  rules[13] = { l: 'n', r: 'n' } // Pour éviter la factorisation\n  rules[14] = { l: 'n', r: 'n' } // Pour éviter la factorisation\n  // rules.push({ l: 'n1+-n2', r: 'n1-n2' }) // Peut être utile pour des nombres négatifs\n  const variables = {}\n  variables.symbolsOp = Object.values(stepProg)\n  const symbolsOp = ['+', '-', '*', '/', '^2', '2*x', '3*x', '-2*x', '-3*x', 'x^2', '-x^2', 'x', '-x', '*x', '/x']\n  const op = ['+', '-', '*', '/', '^', '+', '+', '-', '-', '+', '-', '+', '-', '*', '/']\n  const namesOp = [\n    'add', 'subtract', 'multiply', 'divide',\n    'pow',\n    'add', 'add',\n    'subtract', 'subtract',\n    'add', 'subtract',\n    'add', 'subtract',\n    'multiply', 'divide']\n  const namesOpInv = {\n    add: 'subtract',\n    subtract: 'add',\n    multiply: 'divide',\n    divide: 'multiply'\n  }\n  const symbolsOpInv = {\n    add: '-',\n    subtract: '+',\n    multiply: '/',\n    divide: '*'\n  }\n  const debutsPhrase = [\n    'Ajouter ', 'Soustraire ', 'Multiplier par ', 'Diviser par ',\n    'Elever au carré',\n    'Ajouter le double du nombre choisi', 'Ajouter le triple du nombre choisi',\n    'Soustraire le double du nombre choisi', 'Soustraire le triple du nombre choisi',\n    'Ajouter le carré du nombre choisi', 'Soustraire le carré du nombre choisi',\n    'Ajouter le nombre choisi', 'Soustraire le nombre choisi',\n    'Multiplier par le nombre choisi', 'Diviser par le nombre choisi'\n  ]\n  const debutsPhraseInv = [\n    'Soustraire ', 'Ajouter ', 'Diviser par ', 'Multiplier par ',\n    'Prendre la racine carré',\n    'Soustraire le double du nombre choisi', 'Soustraire le triple du nombre choisi',\n    'Ajouter le double du nombre choisi', 'Ajouter le triple du nombre choisi',\n    'Soustraire le carré du nombre choisi', 'Ajouter le carré du nombre choisi',\n    'Soustraire le nombre choisi', 'Ajouter le nombre choisi',\n    'Diviser par le nombre choisi', 'Multiplier par le nombre choisi'\n  ]\n  const nombresAutorises1 = [1, 2, 3, 4, 5, 6, 7, 8, 9]\n  const nombresAutorises2 = [2, 3, 4, 5, 6, 7, 8, 9]\n  variables.namesOp = Object.values(variables.symbolsOp)\n  variables.debutsPhrase = Object.values(variables.symbolsOp)\n  variables.debutsPhraseInv = Object.values(variables.symbolsOp)\n  variables.op = Object.values(variables.symbolsOp)\n  variables.namesOp.forEach(function (n, i) {\n    variables.namesOp[i] = namesOp[symbolsOp.indexOf(n)]\n  })\n  variables.debutsPhrase.forEach(function (n, i) {\n    variables.debutsPhrase[i] = debutsPhrase[symbolsOp.indexOf(n)]\n  })\n  variables.debutsPhraseInv.forEach(function (n, i) {\n    variables.debutsPhraseInv[i] = debutsPhraseInv[symbolsOp.indexOf(n)]\n  })\n  variables.op.forEach(function (n, i) {\n    variables.op[i] = op[symbolsOp.indexOf(n)]\n  })\n  const nodes = [new math.SymbolNode('x')]\n  const nodesInv = []\n  const phrases = ['Choisir un nombre.']\n  const steps = ['x']\n  const stepsNode = [new math.SymbolNode('x')]\n  const stepsSimplified = ['x']\n  const stepsInv = ['x']\n  const stepsSimplifiedInv = ['x']\n  const phrasesInv = ['On obtient le nombre choisi.']\n  nombreChoisi = math.simplify(math.format(nombreChoisi))\n  const resultatIntermediaire = [nombreChoisi]\n  const calculIntermediaire = [nombreChoisi]\n  let step\n  const longueur = variables.symbolsOp.length + 1\n  for (let i = 1; i < longueur; i++) {\n    const choix = i - 1\n    let symbolOp = variables.symbolsOp[choix]\n    const nameOp = variables.namesOp[choix]\n    const debutPhrase = variables.debutsPhrase[choix]\n    const debutPhraseInv = variables.debutsPhraseInv[choix]\n    const op = variables.op[choix]\n    let stepPrint = ''\n    switch (symbolOp) {\n      case '/':\n        step = new math.ConstantNode(math.pickRandom(nombresAutorises2))\n        break\n      case '*':\n        step = new math.ConstantNode(math.pickRandom(nombresAutorises2))\n        break\n      case '^':\n        step = new math.ConstantNode(2)\n        break\n      case '-':\n        step = new math.ConstantNode(math.pickRandom(nombresAutorises1))\n        break\n      case '+':\n        step = new math.ConstantNode(math.pickRandom(nombresAutorises2))\n        break\n      default :\n        if (symbolOp[0] === '-') symbolOp = symbolOp.replace('-', '')\n        step = math.parse(symbolOp)\n    }\n    stepsNode.push(step)\n    if (step.isConstantNode) stepPrint = `$${step.toString()}$`\n    let nodeSimplifie = math.simplify(nodes[i - 1].toString({ parenthesis: 'keep' }), rules)\n    nodes.push(new math.OperatorNode(op, nameOp, [new math.ParenthesisNode(nodeSimplifie), step]))\n    steps.push(toTex(nodes[i], { suppr1: false }, debug))\n    nodeSimplifie = math.simplify(nodes[i].toString({ parenthesis: 'auto' }), rules)\n    nodesInv.push(new math.OperatorNode(symbolsOpInv[nameOp], namesOpInv[nameOp], [new math.ParenthesisNode(nodeSimplifie), step]))\n    stepsInv.push(toTex(nodesInv[i - 1], { suppr1: false }, debug))\n    stepsSimplified.push(toTex(nodeSimplifie, { suppr1: false }, debug))\n    const nodeSimplifieInv = math.parse(nodesInv[i - 1].toString({ parenthesis: 'auto' }))\n    stepsSimplifiedInv.push(toTex(nodeSimplifieInv, { suppr1: false }, debug))\n    phrases.push(debutPhrase + stepPrint)\n    phrasesInv.push(debutPhraseInv + stepPrint)\n    if (i === variables.symbolsOp.length) {\n      steps.push(toTex(nodes[i], { suppr1: false }, debug))\n      stepsSimplified.push(toTex(nodeSimplifie, { suppr1: false }, debug))\n      stepsInv.push(toTex(nodesInv[i - 1], { suppr1: false }, debug))\n      stepsSimplifiedInv.push(toTex(nodeSimplifie, { suppr1: false }, debug))\n      phrases.push('Écrire le résultat')\n      // phrasesInv.push(debutPhraseInv + stepPrint)\n      phrasesInv.push('Résultat du programme')\n    }\n    if (i === longueur) {\n      calculIntermediaire.push(calculIntermediaire[i - 1])\n      resultatIntermediaire.push(calculIntermediaire[i - 1])\n    } else if (i > 0) {\n      calculIntermediaire.push(new math.OperatorNode(variables.op[choix], nameOp, [resultatIntermediaire[i - 1], math.simplify(step, [{ l: 'n', r: 'n' }], { x: nombreChoisi })]))\n      resultatIntermediaire.push(math.simplify(calculIntermediaire[i], { x: nombreChoisi }))\n    }\n  }\n  const resultatIntermediaireInv = [resultatIntermediaire[longueur - 1]]\n  const calculIntermediaireInv = [resultatIntermediaire[longueur - 1]]\n  for (let i = 1; i < longueur; i++) {\n    const choix = i - 1\n    const nameOp = variables.namesOp[longueur - 2 - choix]\n    if (i === longueur) {\n      calculIntermediaireInv.push(calculIntermediaireInv[i])\n      resultatIntermediaireInv.push(calculIntermediaireInv[i])\n    } else if (i < longueur) {\n      calculIntermediaireInv.push(new math.OperatorNode(symbolsOpInv[nameOp], namesOpInv[nameOp], [resultatIntermediaireInv[i - 1], math.simplify(stepsNode[longueur - i], [{ l: 'n', r: 'n' }], { x: nombreChoisi })]))\n      resultatIntermediaireInv.push(math.simplify(calculIntermediaireInv[i], { x: nombreChoisi }))\n    }\n  }\n  return { phrases, steps, stepsSimplified, stepsInv, stepsSimplifiedInv, phrasesInv, nodes, stepProg, calculIntermediaire, resultatIntermediaire, calculIntermediaireInv, resultatIntermediaireInv }\n}\n\nexport function traduireProgrammeCalcul (stepProg = ['+', '-', '*', '/', '^2', '2*x', '3*x', '-2*x', '-3*x', 'x^2', '-x^2', 'x', '-x', '*x', '/x'], nombreChoisi, debug = false) {\n  const programme = programmeCalcul(stepProg, nombreChoisi, debug)\n  const stepsSolutionDetaillee = Object.values(programme.phrases) // Clone de phrases pour ne pas être touchée par les modifications\n  stepsSolutionDetaillee.forEach(function (step, i) {\n    stepsSolutionDetaillee[i] = '&\\\\bullet~\\\\text{' + programme.phrases[i] + '}&'\n    programme.phrases[i] = '&\\\\bullet~\\\\text{' + programme.phrases[i] + '}'\n    stepsSolutionDetaillee[i] += '&' + programme.steps[i]\n    if (programme.steps[i] !== programme.stepsSimplified[i]) stepsSolutionDetaillee[i] += '&=' + programme.stepsSimplified[i]\n  })\n  let texte = String.raw` Voici un programme de calcul.\n          <br>\n          $\\begin{aligned}\n          ${programme.phrases.join('\\\\\\\\')}\n          \\end{aligned}$\n          <br>\n          Notons $x$ le nombre choisi.\n          <br>\n          Écrire le résultat du programme de calcul en fonction de $x$.\n          `\n  const texteCorr = String.raw`Solution détaillée\n          <br>\n          $\\begin{aligned}\n          ${stepsSolutionDetaillee.join('\\\\\\\\')}\n          \\end{aligned}$`\n  if (debug) texte = `${texte}<br>${texteCorr}`\n  return { texte, texteCorr }\n}\n\nexport function ecrireProgrammeCalcul (stepProg = ['+', '-', '*', '/', '^2', '2*x', '3*x', '-2*x', '-3*x', 'x^2', '-x^2', 'x', '-x', '*x', '/x'], nombreChoisi, debug = false) {\n  const programme = programmeCalcul(stepProg, nombreChoisi, debug)\n  const stepsSolutionDetaillee = Object.values(programme.phrases) // Clone de phrases pour ne pas être touchée par les modifications\n  stepsSolutionDetaillee.forEach(function (step, i) {\n    stepsSolutionDetaillee[i] = '&\\\\bullet~\\\\text{' + programme.phrases[i] + '}&'\n    programme.phrases[i] = '&\\\\bullet~\\\\text{' + programme.phrases[i] + '}'\n    stepsSolutionDetaillee[i] += '&' + programme.steps[i]\n    if (programme.steps[i] !== programme.stepsSimplified[i]) stepsSolutionDetaillee[i] += '&=' + programme.stepsSimplified[i]\n  })\n  let texte = String.raw`Voici une expression. Écrire le programme de calcul correspondant.\n          <br>\n          $${programme.stepsSimplified[programme.stepsSimplified.length - 1]}$\n          `\n  const texteCorr = String.raw`Solution détaillée\n          <br>\n          $\\begin{aligned}\n          ${stepsSolutionDetaillee.join('\\\\\\\\')}\n          \\end{aligned}$`\n  if (debug) texte = `${texte}<br>${texteCorr}`\n  return { texte, texteCorr }\n}\n\nexport function remonterProgrammeCalcul (stepProg = ['+', '-', '*', '/', '^2', '2*x', '3*x', '-2*x', '-3*x', 'x^2', '-x^2', 'x', '-x', '*x', '/x'], nombreChoisi, debug = false) {\n  const programme = programmeCalcul(stepProg, nombreChoisi, debug)\n  const stepsSolutionDetaillee = Object.values(programme.phrases) // Clone de phrases pour ne pas être touchée par les modifications\n  const stepsSolutionDetailleeInv = Object.values(programme.phrases) // Clone de phrases pour ne pas être touchée par les modifications\n  const longueur = stepsSolutionDetaillee.length\n  stepsSolutionDetaillee.forEach(function (step, i) {\n    stepsSolutionDetaillee[i] = '&\\\\bullet~\\\\text{' + programme.phrases[i] + '}&'\n    programme.phrases[i] = '&\\\\bullet~\\\\text{' + programme.phrases[i] + '}'\n    stepsSolutionDetaillee[i] += '&' + programme.steps[i]\n    stepsSolutionDetailleeInv[i] = '&\\\\bullet~\\\\text{' + programme.phrasesInv[i] + '}&'\n    programme.phrasesInv[i] = '&\\\\bullet~\\\\text{' + programme.phrasesInv[i] + '}'\n    if (i === 0) {\n      stepsSolutionDetailleeInv[i] += '&' + toTex(programme.resultatIntermediaireInv[longueur - 2])\n    } else if (i < stepsSolutionDetaillee.length - 1) {\n      stepsSolutionDetailleeInv[i] += '&' + toTex(programme.calculIntermediaireInv[longueur - 1 - i]) + '&&=' + toTex(programme.resultatIntermediaireInv[longueur - 1 - i])\n    } else {\n      stepsSolutionDetailleeInv[i] += '&' + toTex(programme.resultatIntermediaireInv[0])\n    }\n  })\n  nombreChoisi = math.simplify(math.format(nombreChoisi))\n  let texte = String.raw`On obtient le nombre $${toTex(programme.resultatIntermediaireInv[0])}$ avec le programme suivant.\n          <br>\n          $\\begin{aligned}\n          ${programme.phrases.join('\\\\\\\\')}\n          \\end{aligned}$\n          <br>\n          Quel était le nombre choisi ?\n          `\n  const texteCorr = String.raw`Solution détaillée\n          <br>\n          $\\begin{aligned}\n          ${stepsSolutionDetailleeInv.reverse().join('\\\\\\\\')}\n          \\end{aligned}$\n          <br>\n          Le nombre choisi était donc $${toTex(nombreChoisi)}$.\n          `\n  if (debug) texte = `${texte}<br>${texteCorr}`\n  return { texte, texteCorr }\n}\n\nexport function appliquerProgrammeCalcul (stepProg = ['+', '-', '*', '/', '^2', '2*x', '3*x', '-2*x', '-3*x', 'x^2', '-x^2', 'x', '-x', '*x', '/x'], nombreChoisi, debug = false) {\n  const programme = programmeCalcul(stepProg, nombreChoisi, debug)\n  const stepsSolutionDetaillee = Object.values(programme.phrases) // Clone de phrases pour ne pas être touchée par les modifications\n  stepsSolutionDetaillee.forEach(function (step, i) {\n    stepsSolutionDetaillee[i] = '&\\\\bullet~\\\\text{' + programme.phrases[i] + '}&'\n    programme.phrases[i] = '&\\\\bullet~\\\\text{' + programme.phrases[i] + '}'\n    // stepsSolutionDetaillee[i] += '&' + programme.steps[i]\n    if (i === 0) {\n      stepsSolutionDetaillee[i] += '&' + toTex(programme.resultatIntermediaire[0])\n    } else if (i < stepsSolutionDetaillee.length - 1) {\n      stepsSolutionDetaillee[i] += '&' + toTex(programme.calculIntermediaire[i]) + '&&=' + toTex(programme.resultatIntermediaire[i])\n    } else {\n      stepsSolutionDetaillee[i] += '&' + toTex(programme.resultatIntermediaire[i - 1])\n    }\n  })\n  nombreChoisi = math.simplify(math.format(nombreChoisi))\n  let texte = String.raw`Choisir le nombre $${toTex(nombreChoisi)}$ et effectuer le programme de calcul suivant.\n          <br>\n          $\\begin{aligned}\n          ${programme.phrases.join('\\\\\\\\')}\n          \\end{aligned}$\n          <br>\n          `\n  const texteCorr = String.raw`Solution détaillée\n          <br>\n          $\\begin{aligned}\n          ${stepsSolutionDetaillee.join('\\\\\\\\')}\n          \\end{aligned}$`\n  if (debug) texte = `${texte}<br>${texteCorr}`\n  return { texte, texteCorr }\n}\n\nexport function calculExpression2 (expression = '4/3+5/6', factoriser = false, debug = false) {\n  const steps = factoriser ? traverserEtapes(factor(expression)) : traverserEtapes(simplifyExpression(expression))\n  if (debug) {\n    console.log('* steps :')\n    console.log(steps)\n  }\n  let repetition = 0\n  const stepsExpression = []\n  let expressionPrint = ''\n  steps.forEach(function (step, i) {\n    const changement = step.changeType\n    if (step.oldNode !== null) {\n      if (step.oldNode.toString() === step.newNode.toString()) {\n        if (changement !== 'REMOVE_ADDING_ZEROS') repetition = (repetition + 1) % 2\n      } else {\n        repetition = 0\n      }\n    }\n    if (debug) {\n      console.log(changement)\n      console.log(step.newNode.toString())\n    }\n    const oldNode = step.oldNode !== null ? toTex(step.oldNode, { suppr1: true }, debug) : ''\n    const newNode = toTex(step.newNode, { suppr1: true }, debug)\n    if (debug) {\n      console.log(newNode.toString())\n    }\n    if (i === 0) {\n      expressionPrint = `${oldNode}`\n    }\n    if (debug) console.log(newNode)\n    const commentairesExclus = {\n      REMOVE_ADDING_ZERO: String.raw`\\text{Enlever des zéros}`,\n      EXPAND_EXPONENT: String.raw`\\text{Signification des exposants}`,\n      MULTIPLY_COEFFICIENTS: String.raw`\\text{Multiplier les coefficients}`,\n      COLLECT_LIKE_TERMS: String.raw`\\text{Regrouper les termes}`,\n      MULTIPLY_DENOMINATORS: String.raw`\\text{Calculer les dénominateurs}`,\n      ADD_EXPONENT_OF_ONE: String.raw`\\text{Ajouter l'exposant 1}`,\n      COLLECT_POLYNOMIAL_EXPONENTS: String.raw`\\text{Ajouter l'exposant 1}`,\n      DISTRIBUTE: String.raw`\\text{Distribution}`,\n      ADD_COEFFICIENT_OF_ONE: String.raw`\\text{Ajouter le coefficient }1`,\n      GROUP_COEFFICIENTS: String.raw`\\text{Regrouper les coefficients}`,\n      REMOVE_MULTIPLYING_BY_ONE: String.raw`\\text{Retirer la multiplication par } 1`\n    }\n    let commentaires = {\n      COMMON_DENOMINATOR: String.raw`\\text{Obtenir le même dénominateur}`,\n      MULTIPLY_NUMERATORS: String.raw`\\text{Calculer}`,\n      COMBINE_NUMERATORS: String.raw`\\text{Combiner les numérateurs}`,\n      ADD_NUMERATORS: String.raw`\\text{Additionner les numérateurs}`,\n      FIND_GCD: String.raw`\\text{Trouver le plus grand diviseur commun.}`,\n      CANCEL_GCD: String.raw`\\text{Simplifier par le PGCD.}`\n    }\n    if (debug) {\n      commentaires = Object.assign(commentaires, {\n        STATEMENT_IS_FALSE: String.raw`\\text{L'égalité est fausse}`,\n        STATEMENT_IS_TRUE: String.raw`\\text{L'égalité est vraie}`,\n        SIMPLIFY_RIGHT_SIDE: String.raw`\\text{Simplifier le membre de droite}`,\n        SIMPLIFY_LEFT_SIDE: String.raw`\\text{Simplifier le membre de gauche}`,\n        COLLECT_AND_COMBINE_LIKE_TERMS: String.raw`\\text{Regrouper et réduire les termes de même nature}`,\n        SIMPLIFY_ARITHMETIC: String.raw`\\text{Calcul arithmétique}`,\n        SIMPLIFY_FRACTION: String.raw`\\text{Simplifier une fraction}`,\n        REMOVE_MULTIPLYING_BY_NEGATIVE_ONE: String.raw`\\text{Calculer la multiplication par }-1`,\n        REMOVE_ADDING_ZERO: String.raw`\\text{Enlever des zéros}`,\n        SWAP_SIDES: String.raw`\\text{Echanger les deux membres}`,\n        CANCEL_MINUSES: String.raw`\\text{Annuler les signes moins}`,\n        FIND_ROOTS: String.raw`\\text{Trouver la (ou les) solution(s)}`,\n        SIMPLIFY_SIGNS: String.raw`\\text{Simplifier le signe}`,\n        MULTIPLY_BY_ZERO: String.raw`\\text{Multiplication par zéro}`,\n        ADD_FRACTIONS: String.raw`\\text{Additionner des fractions}`,\n        BREAK_UP_FRACTION: String.raw`\\text{Séparer une fraction}`,\n        CANCEL_TERMS: String.raw`\\text{Annuler les termes}`\n      })\n    }\n    if (commentaires[changement] === undefined) commentaires[changement] = ''\n    if (commentairesExclus[changement] === undefined) stepsExpression.push(String.raw`&=${newNode}`)\n    if (debug) console.log('changement', commentaires[changement])\n  })\n  let texte = String.raw`Développer et réduire $${expressionPrint}$.`\n  const texteCorr = String.raw`Simplifier $${expressionPrint}$.\n  <br>\n  $\\begin{aligned}\n  ${expressionPrint}${stepsExpression.slice(stepsExpression.length - 4, stepsExpression.length).join('\\\\\\\\')}\n  \\end{aligned}$\n  `\n  if (debug) texte = texteCorr\n  return { texte, texteCorr }\n}\n\n/**\n * Retourne des noms de points (ou des objets) dans un ordre aléatoire.\n * @param {string|Array} names // Liste des lettres sous format string ou array\n * @param {number} n // Nombre de lettres à retourner\n * @param {string|Array} result // S'il n'y a qu'un seul nom en sortie c'est un string sinon c'est un array\n * @remarque // Les lettres Q,W,X,Y,Z ont été exclues par défaut\n * @example\n * aleaName() --> 'F'\n * aleaName(3) --> ['G', 'J', 'K']\n * aleaName('ABC') --> ['B','A','C']\n * aleaName(['chat','chien','poisson']) --> ['chien','poisson','chat']\n * aleaName(['chat','chien','poisson'],2) --> ['poisson','chat']\n * aleaName([Objet1,Objet2,Objet3]) --> [Objet2,Objet1,Objet3] où Objet peut être un Object, un Array etc.\n * @returns {Array}\n */\nexport function aleaName (names, n = names.length, result = []) {\n  if (typeof names === 'string') {\n    names = names.split('')\n  } else if (typeof names === 'number') {\n    n = 0 + names\n    names = 'ABCDEFGHIJKLMNOPRSTUV'.split('')\n  } else if (Array.isArray(names) && names.length === 0) {\n    n = 1\n    names = 'ABCDEFGHIJKLMNOPRSTUV'.split('')\n  }\n  result.push(names.splice(Math.floor(Math.random() * names.length), 1)[0])\n  if (result.length === n) {\n    return result\n  } else {\n    return aleaName(names, n, result)\n  }\n}\n"],"names":["ChangeTypes","_interopRequireDefault","obj","module","_extends","target","i","source","key","config","DEFAULT_CONFIG","_typeof","o","require$$0","is","isAccessorNode","isArrayNode","isAssignmentNode","isBigNumber","isBlockNode","isBoolean","isChain","isCollection","isComplex","isConditionalNode","isConstantNode","isDate","isDenseMatrix","isFraction","isFunction","isFunctionAssignmentNode","isFunctionNode","isHelp","isIndex","isIndexNode","isMatrix","isNode","isNull","isNumber","isObject","isObjectNode","isOperatorNode","isParenthesisNode","isRange","isRangeNode","isRegExp","isRelationalNode","isResultSet","isSparseMatrix","isString","isSymbolNode","isUndefined","isUnit","rule2Node","typeOf","_typeof2","require$$1","x","isArray","node","t","object","canDefineProperty","clone","deepExtend","deepFlatten","deepStrictEqual","extend","get","hasOwnProperty","isLegacyFactory","lazy","mapObject","pick","pickShallow","set","traverse","values","_is","require$$2","type","value","callback","a","b","prop","len","nestedObject","flattenedObject","_deepFlatten","valueResolver","_uninitialized","_value","path","property","isPath","child","lastKey","properties","transform","copy","str","configFactory","_object","_config2","MATRIX_OPTIONS","NUMBER_OPTIONS","emit","_config","options","prev","validateOption","curr","changes","contains","array","item","name","configReadonly","_extends2","require$$3","global","factory","this","ok","notOk","undef","NOT_TYPED_FUNCTION","create","isPlainObject","_types","anyType","typeMap","typeList","nConversions","typed","findType","typeName","message","otherName","addTypes","types","beforeSpec","beforeIndex","newTypes","affectedTypes","clear","clearConversions","findTypeNames","matches","isTypedFunction","entity","findSignature","fn","signature","exact","stringSignature","params","parseSignature","canonicalSignature","stringifyParams","match","nParams","remainingSignatures","want","filteredSignatures","possibility","have","getParamAtIndex","haveTypes","paramTypeSet","wtype","candidate","find","convert","conversions","separator","p","parseParam","param","restParam","typeDefs","s","hasAny","paramName","expandParam","typeNames","matchingConversions","availableConversions","newName","convertibleTypes","conversion","rawSignature","rawParams","parsedParam","hasRestParam","last","compileTest","test0","test1","tests","compileTests","initial","varIndex","lastTest","testRestParam","args","index","getTypeSetAtIndex","isExactType","mergeExpectedParams","signatures","typeSet","paramSet","createError","err","expected","_name","matchingSignatures","nextMatchingDefs","test","actualTypes","lengths","maxLength","argTypes","getLowestTypeIndex","min","getLowestConversionIndex","compareParams","param1","param2","typeDiff","convDiff","compareSignatures","signature1","signature2","pars1","pars2","last1","last2","hasRest1","hasRest2","any1","conv1","par","any2","conv2","lengthCriterion","comparisons","tc","thisComparison","c","t1","t2","knownTypes","newMatch","compileArgsPreprocessing","fnConvert","compiledConversions","compileArgConversion","fnPreprocess","offset","slice","conversion0","conversion1","arg","splitParams","_splitParams","paramsSoFar","resultingParams","exactTypes","flatMap","nextParam","conflicting","params1","params2","ii","typeSet1","typeSet2","overlap","len1","len2","restParam1","restParam2","clearResolutions","functionList","isReferToSelf","referToSelf","isReferTo","makeReferTo","collectResolutions","references","signatureMap","resolvedReferences","reference","resolution","resolveReferences","self","resolvedFunctions","isResolved","leftUnresolved","nothingResolved","validateDeprecatedThis","signaturesMap","deprecatedThisRegex","createTypedFunction","rawSignaturesMap","parsedParams","originalFunctions","preliminarySignatures","pp","functionIndex","conversionParams","sp","spName","theTypedFn","internalSignatureMap","ok0","ok1","ok2","ok3","ok4","ok5","allOk","test00","test10","test20","test30","test40","test50","test01","test11","test21","test31","test41","test51","fn0","fn1","fn2","fn3","fn4","fn5","len0","len3","len4","len5","iStart","iEnd","fns","generic","arg0","arg1","_onMismatch","arr","start","end","findInArray","referTo","objectOrFn","checkName","nameSoFar","getObjectName","mergeSignatures","dest","saveTyped","maybeName","named","allSignatures","theseSignatures","thisName","beforeObjectTest","before","_validateConversion","to","other","existingConversion","tf","argList","sigs","typedFunction","number","copysign","digits","format","isInteger","nearlyEqual","roundDigits","splitNumber","toEngineering","toExponential","toFixed","toPrecision","sign","log2","log10","log1p","cbrt","negate","result","expm1","formatNumberToBase","n","base","size","prefixes","prefix","suffix","notation","precision","wordSize","e","exponent","dot","coefficients","zeros","split","rounded","newExp","missingZeros","expDiff","decimalIdx","decimals","decimalVal","splitValue","first","lowerExp","upperExp","removed","length","DBL_EPSILON","y","epsilon","diff","acosh","asinh","atanh","cosh","sinh","tanh","signx","signy","formatter","_number","formatBigNumberToBase","BigNumberCtor","big2","exp","valueWithoutExp","valueStr","string","compareText","endsWith","escape","stringify","_formatter","require$$4","text","search","_format","looksLikeFraction","formatArray","entries","escaped","DimensionError_1","DimensionError","actual","relation","IndexError_1","IndexError","max","arraySize","filter","filterRegExp","flatten","forEach","generalize","getArrayDataType","identify","join","map","processSizesWildcard","reshape","resize","squeeze","unsqueeze","validate","validateIndex","_string","_DimensionError","_IndexError","_validate","dim","dimNext","isScalar","defaultValue","_defaultValue","_resize","elem","oldLen","newLen","minLen","sizes","flatArray","currentLength","newLength","product","_reshape","processedSizes","WILDCARD","wildCardIndex","isMoreThanOneWildcard","hasWildcard","canReplaceWildcard","tmpArray","tmpArray2","sizeIndex","dims","_squeeze","next","outer","_unsqueeze","d","flat","regexp","entry","count","itemType","factory_1","assertDependencies","isFactory","isOptionalDependency","sortFactories","stripOptionalNotation","_array","dependencies","meta","assertAndCreate","scope","deps","factories","factoriesByName","containsDependency","dependency","sorted","addFactory","allDefined","missingDependencies","_classCallCheck","instance","Constructor","toPrimitive","r","toPropertyKey","_defineProperties","props","descriptor","_createClass","protoProps","staticProps","customs","getSafeProperties","getSafeProperty","hasSafeProperty","isSafeMethod","isSafeProperty","setSafeProperty","validateSafeMethod","safeNativeProperties","method","safeNativeMethods","assign","createEmptyMap","createMap","isMap","toObject","_classCallCheck2","_createClass2","_customs","_createForOfIteratorHelper","allowArrayLike","it","_unsupportedIterableToArray","F","_e","normalCompletion","didErr","step","_e2","_arrayLikeToArray","arr2","ObjectWrappingMap","mapOrObject","_iterator","_step","_len","objects","_key","_i","_objects","_iterator2","_step2","_i2","_Object$keys","_key2","_typedFunction","_factory","_map","require$$5","_createTyped2","createTyped","_ref","BigNumber","Complex","DenseMatrix","Fraction","throwNoBignumber","throwNoComplex","throwNoFraction","f","throwNoMatrix","matrix","usualError","sig","ResultSet","createResultSet","json","globalScope","EXP_LIMIT","MAX_DIGITS","NUMERALS","LN10","PI","DEFAULTS","Decimal","inexact","noConflict","quadrant","external","decimalError","invalidArgument","precisionLimitExceeded","cryptoUnavailable","tag","mathfloor","mathpow","isBinary","isHex","isOctal","isDecimal","BASE","LOG_BASE","MAX_SAFE_INTEGER","LN10_PRECISION","PI_PRECISION","finalise","k","Ctor","j","xdL","ydL","xd","yd","xs","ys","pr","rm","cosine","toLessThanHalfPi","m","rep","sd","t3","t3plusx","digitsToString","divide","one","tinyPow","taylorSeries","cosh2_x","d8","sinh2_x","d5","d16","d20","halfPi","getPi","wpr","xsd","px","x2","isBase10","denominator","inf","num","guard","naturalLogarithm","getLn10","checkRoundingDigits","xe","xLTy","getBase10Exponent","q","naturalExponential","carry","z","getPrecision","sine","rL","toStringBinary","dp","checkInt32","finiteToString","maxD","d0","d1","d2","n0","n1","yn","intPow","ws","indexOfLastWord","w","getZeroString","repeating","di","rd","convertBase","baseIn","baseOut","arrL","strL","cos2x","multiplyInteger","temp","compare","aL","bL","subtract","cmp","logBase","more","prod","prodL","qd","rem","remL","rem0","xi","xL","yd0","yL","yz","isTruncated","roundUp","xdi","out","isExp","nonFiniteToString","zs","truncate","isOdd","maxOrMin","ltgt","pow","sum","c0","numerator","x1","parseDecimal","parseOther","divisor","isFloat","sin2_x","isHyperbolic","u","isNeg","pi","abs","acos","add","asin","atan","atan2","ceil","clamp","v","useDefaults","ps","cos","isDecimalInstance","div","floor","hypot","ln","log","mod","mul","random","round","sin","sqrt","sub","tan","trunc","_decimal","createBigNumberClass","on","_complex","createComplexClass","im","re","strRe","strIm","phi","root","MAX_CYCLE_LEN","P","InvalidParameter","newFraction","DivisionByZero","gcd","factorize","factors","parse","p1","p2","A","B","C","D","N","M","NonIntegerParameter","modpow","cycleLen","cycleStart","rem1","rem2","places","eps","thisABS","cont","excludeWhole","whole","res","dec","cycLen","cycOff","exports","_fraction","createFractionClass","Range","createRangeClass","hasStart","hasEnd","hasStep","nums","invalid","Matrix","createMatrixClass","data","datatype","replacement","skipZeros","_regeneratorRuntime","define","wrap","Generator","Context","makeInvokeMethod","tryCatch","h","l","GeneratorFunction","GeneratorFunctionPrototype","g","defineIteratorMethods","AsyncIterator","invoke","callInvokeWithMethodAndArg","maybeInvokeDelegate","pushTryEntry","resetTryEntry","handle","runtime","regenerator","lruQueue_1","lruQueue","limit","queue","del","id","oldIndex","nuIndex","_function","maxArgumentCount","memoize","memoizeCompare","_lruQueue","hasher","hash","newVal","isEqual","cached","_regenerator","require$$6","require$$7","require$$8","require$$9","createDenseMatrixClass","preprocess","_get","_set","indexI","_fit","_getSubmatrix","range","submatrix","iSize","sSize","_setSubmatrix","dataIndex","subIndex","sizeArray","newSize","changed","me","recurse","_callee","_context2","_context","row","_this","_loop","col","kSuper","kSub","rows","columns","ms","vi","createClone","_switch_1","_switch","mat","I","J","ret","tmp","collection","containsCollections","deepForEach","deepMap","reduce","scatter","_switch2","_reduce","val","tran","mark","cindex","inverse","update","avalues","aindex","aptr","k0","k1","_collection","createIsInteger","arithmetic","absNumber","addNumber","cbrtNumber","cubeNumber","divideNumber","expNumber","expm1Number","gcdNumber","lcmNumber","log10Number","log1pNumber","log2Number","logNumber","modNumber","multiplyNumber","normNumber","nthRootNumber","powNumber","roundNumber","signNumber","sqrtNumber","squareNumber","subtractNumber","unaryMinusNumber","unaryPlusNumber","xgcdNumber","n2","inv","lastx","lasty","bitwise","bitAndNumber","bitNotNumber","bitOrNumber","bitXorNumber","leftShiftNumber","rightArithShiftNumber","rightLogShiftNumber","product_1","half","combinations","combinationsNumber","_product","nMinusk","answer","firstnumerator","nextdivisor","lastdivisor","nextnumerator","constants","tau","logical","andNumber","notNumber","orNumber","xorNumber","probability","gammaNumber","lgammaNumber","twoN","threeN","fourN","fiveN","gammaP","gammaG","lnSqrt2PI","lgammaG","lgammaN","lgammaSeries","trigonometry","acosNumber","acoshNumber","acotNumber","acothNumber","acscNumber","acschNumber","asecNumber","asechNumber","asinNumber","asinhNumber","atan2Number","atanNumber","atanhNumber","cosNumber","coshNumber","cotNumber","cothNumber","cscNumber","cschNumber","secNumber","sechNumber","sinNumber","sinhNumber","tanNumber","tanhNumber","xInv","utils","isIntegerNumber","isNaNNumber","isNegativeNumber","isPositiveNumber","isZeroNumber","_arithmetic","_bitwise","_combinations","_constants","_logical","_relational","_probability","_trigonometry","_utils","isNegative","_index","createIsNegative","isNumeric","createIsNumeric","hasNumericValue","createHasNumericValue","isPositive","createIsPositive","isZero","createIsZero","_isNaN","createIsNaN","createTypeOf","nearlyEqual_1","complex","complexEquals","compareUnits","createCompareUnits","equalScalar","_nearlyEqual","_compareUnits","createEqualScalar","createEqualScalarNumber","_ref2","SparseMatrix","createSparseMatrixClass","_createFromMatrix","_createFromArray","eq","zero","_getsubset","_setsubset","idx","kk","mvalues","mindex","mptr","pv","ptr","firstDimensionRange","secondDimensionRange","firstDataIndex","firstSubIndex","secondDataIndex","secondSubIndex","_getValueIndex","_remove","_insert","top","bottom","ins","colIndex","rowIndex","r1","c1","_i3","_j","minRow","maxRow","minColumn","maxColumn","_values","_k","_i4","_i5","_k2","_i6","_i7","_toArray","density","kx","ky","vx","vy","getNonDecimalNumberParts","input","nonDecimalWithRadixMatch","radix","integerPart","fractionalPart","makeNumberFromNonDecimalParts","parts","digitValue","createNumber","nonDecimalNumberParts","wordSizeSuffixMatch","unit","valuelessUnit","createString","boolean","createBoolean","lcase","bignumber","createBignumber","twoPowSize","twoPowSizeSubOne","createComplex","fraction","createFraction","createMatrix","_create","matrixFromFunction","createMatrixFromFunction","_","matrixFromRows","createMatrixFromRows","_createArray","checkVectorTypeAndReturnLength","rowLength","vec","matrixFromColumns","createMatrixFromColumns","colLength","splitUnit","createSplitUnit","unaryMinus","createUnaryMinus","unaryPlus","createUnaryPlus","createAbs","apply","createApply","_apply","addScalar","createAddScalar","createCbrt","_cbrtComplex","_cbrtUnit","allRoots","arg3","principal","all","third","_result","_arrayWithHoles","_iterableToArrayLimit","arrayLikeToArray","_nonIterableRest","arrayWithHoles","iterableToArrayLimit","unsupportedIterableToArray","nonIterableRest","_slicedToArray","matAlgo11xS0s","createMatAlgo11xS0s","asize","adt","dt","cf","cvalues","cptr","matAlgo12xSfs","createMatAlgo12xSfs","cdata","matAlgo14xDs","createMatAlgo14xDs","adata","_iterate","level","av","bv","cv","_slicedToArray2","_matAlgo11xS0s","_matAlgo12xSfs","_matAlgo14xDs","createCeilNumber","_split","_split2","_split3","_split4","createCeil","ceilNumber","cube","createCube","createExp","createExpm1","_Complex","fix","createFixNumber","createFix","fixNumber","bn","createFloorNumber","createFloor","floorNumber","_defineProperty","_arrayWithoutHoles","_iterableToArray","iter","_nonIterableSpread","arrayWithoutHoles","iterableToArray","nonIterableSpread","_toConsumableArray","matAlgo01xDSid","createMatAlgo01xDSid","denseMatrix","sparseMatrix","bvalues","bindex","bptr","bsize","bdt","matAlgo04xSidSid","createMatAlgo04xSidSid","xa","xb","wa","wb","matAlgo10xSids","createMatAlgo10xSids","matAlgo13xDD","createMatAlgo13xDD","bdata","csize","broadcast","_toConsumableArray2","dependancies","createBroadcast","concat","sizeA","_padLeft","sizeB","sizeMax","_dim","_checkRules","AA","BB","_dim2","_stretch","shape","filler","arrayToStretch","sizeToStretch","dimToStretch","matrixAlgorithmSuite","_matAlgo13xDD","_broadcast","createMatrixAlgorithmSuite","elop","SD","matrixSignatures","scalar","Ds","sS","ArgumentsError_1","ArgumentsError","_defineProperty2","_matAlgo01xDSid","_matAlgo04xSidSid","_matAlgo10xSids","_matrixAlgorithmSuite","_ArgumentsError","gcdTypes","gcdManyTypesSignature","is1d","element","createGcd","_typed","_gcdBigNumber","matAlgo02xDS0","createMatAlgo02xDS0","cij","matAlgo06xS0S0","createMatAlgo06xS0S0","lcm","_matAlgo02xDS","_matAlgo06xS0S","createLcm","lcmTypes","lcmManySignature","_lcmBigNumber","createLog10","createLog2","_log2Complex","newX","matAlgo03xDSf","createMatAlgo03xDSf","matAlgo05xSfSf","createMatAlgo05xSfSf","wai","wbi","va","vb","vc","_matAlgo03xDSf","_matAlgo05xSfSf","createMod","multiplyScalar","createMultiplyScalar","multiply","createMultiply","_validateMatrixDimensions","size1","size2","_multiplyVectorVector","_multiplyVectorMatrix","_multiplyVectorDenseMatrix","alength","bcolumns","af","mf","_multiplyMatrixVector","_multiplyDenseMatrixVector","_multiplySparseMatrixVector","_multiplyMatrixMatrix","_multiplyDenseMatrixDenseMatrix","_multiplyDenseMatrixSparseMatrix","_multiplySparseMatrixDenseMatrix","_multiplySparseMatrixSparseMatrix","arows","acolumns","jb","kb0","kb1","kb","ib","brows","vbi","ka0","ka1","ka","ia","ic","vbij","p0","selfMM","xsize","ysize","rest","nthRoot","createNthRoot","_BigNumber","complexErr","_bigNthRoot","selfDn","selfSn","selfDS","Big","createNthRootNumber","createSign","_Fraction","createSqrt","_sqrtNumber","square","createSquare","createSubtract","xgcd","createXgcd","_xgcdBigNumber","invmod","createInvmod","equal","smaller","_res","_res2","matAlgo09xS0Sf","createMatAlgo09xS0Sf","dotMultiply","_matAlgo09xS0Sf","createDotMultiply","bitwise_1","bitAndBigNumber","bitNotBigNumber","bitOrBigNumber","bitXor","leftShiftBigNumber","rightArithShiftBigNumber","prevPrec","negOne","func","xBits","yBits","xSign","ySign","decCoefficientToBinaryString","minBits","maxBits","minSign","shortLen","longLen","expFuncVal","outVal","twoPower","two","bitAnd","createBitAnd","bitNot","createBitNot","bitOr","createBitOr","matAlgo07xSSf","createMatAlgo07xSSf","_scatter","_matAlgo07xSSf","createBitXor","createArg","conj","createConj","createIm","createRe","not","createNot","or","createOr","xor","createXor","createConcat","prevDim","asMatrix","matrices","_concat","concatDim","column","createColumn","Index","_column","rowRange","createCount","cross","createCross","_cross","highestDimension","xSize","ySize","diag","createDiag","_diag","_createDiagonalMatrix","_getDiagonal","dm","vector","createFilter","_filterCallback","createFlatten","createForEach","_forEach","getMatrixDataType","createGetMatrixDataType","identity","createIdentity","_identity","cols","_identityVector","minimum","kron","createKron","_kron","newmsg","indexString","createDiff","_diff","_recursive","selfAn","selfMn","_ElementDiff","obj1","obj2","obj1IsArray","obj2IsArray","_ArrayDiff","arr1","ones","createOnes","_ones","hasBigNumbers","_normalize","noop","noBignumber","noFraction","noIndex","noMatrix","noSubset","_noop","createRange","smallerEq","larger","largerEq","_strRange","_out","_rangeEx","includeEnd","_rangeInc","_bigRangeEx","_bigRangeInc","_parse","createReshape","createResize","_resizeString","defaultChar","rotate","createRotate","rotationMatrix","theta","_validateSize","matrixRes","expectedSize","actualSize","createRotationMatrix","norm","_rotationMatrix2x2","matrixV","_validateVector","_rotationMatrix3x3","storageType","minusOne","cosTheta","sinTheta","_convertToFormat","_mul","normV","vz","oneMinusC","r11","r12","r13","r21","r22","r23","r31","r32","r33","createRow","_row","columnRange","createSize","createSqueeze","subset","createSubset","_getObjectProperty","_getSubstring","_setSubstring","_setObjectProperty","strLen","substr","chars","updated","transpose","createTranspose","transposeMatrix","_denseTranspose","_sparseTranspose","transposed","transposedRow","ctranspose","createCtranspose","createZeros","_zeros","fft","createFft","divideScalar","dotDivide","_ndFft","_fft","_1dFft","_transpose","_czt","chirp","N2","xp","ichirp","fftXp","fftIchirp","fftProduct","ifftProduct","ifft","createIfft","acc","erf","createErf","MAX_NUM","THRESH","erf1","erfc2","erfc3","ysq","xnum","xden","Q","SQRPI","mode","createMode","isNaN","_mode","improveErrorMessage_1","improveErrorMessage","fnName","details","_improveErrorMessage","createProd","numeric","_prod","createFormat","bin","createBin","oct","createOct","hex","createHex","print","createPrint","_print","template","original","keys","createTo","isPrime","createIsPrime","modPow","modulus","accumulator","bases","adn","_x","createNumeric","validInputTypes","validOutputTypes","outputType","check","inputType","createDivideScalar","createPow","_pow","_powArray","_powMatrix","yFrac","yNum","error","NO_INT","createRound","_n","createLog","createLog1p","_log1pComplex","xRe1p","nthRoots","createNthRoots","_calculateExactResult","_nthComplexRoots","aIsNumeric","roots","halfPiFactor","dotPow","createDotPow","powScalarSignatures","powScalar","createDotDivide","solveValidation","createSolveValidation","mSize","bSize","lsolve","_solveValidation","createLsolve","_sparseForwardSubstitution","_denseForwardSubstitution","mdata","bj","xj","vjj","jValues","jIndices","firstIndex","lastIndex","usolve","createUsolve","_sparseBackwardSubstitution","_denseBackwardSubstitution","_lastIndex","lsolveAll","createLsolveAll","R","b_","L","bNew","iValues","iIndices","Mii","_j3","_lastIndex2","_J2","_j2","_J","usolveAll","createUsolveAll","matAlgo08xS0Sid","createMatAlgo08xS0Sid","useMatrixForArrayScalar","createUseMatrixForArrayScalar","selfDB","selfnD","selfBD","leftShift","_matAlgo08xS0Sid","_useMatrixForArrayScalar","require$$10","createLeftShift","rightArithShift","createRightArithShift","rightLogShift","createRightLogShift","and","createAnd","createCompare","createCompareNumber","compareNatural","_javascriptNaturalSort","createCompareNatural","compareBooleans","_compareNatural","typeX","typeY","matTypes","compareMatricesAndArrays","compareComplexNumbers","compareArrays","compareObjects","keysX","keysY","createCompareText","createCompareTextNumber","createEqual","createEqualNumber","equalText","createEqualText","createSmaller","createSmallerNumber","createSmallerEq","createSmallerEqNumber","createLarger","createLargerNumber","createLargerEq","createLargerEqNumber","deepEqual","createDeepEqual","_deepEqual","unequal","createUnequal","createUnequalNumber","_unequal","partitionSelect","createPartitionSelect","asc","desc","_partitionSelect","quickSelect","from","pivot","sort","createSort","compareAsc","compareDesc","_arrayIsVector","_matrixIsVector","_comparator","order","createMax","_max","_largest","createMin","_min","_smallest","ImmutableDenseMatrix","createImmutableDenseMatrixClass","MatrixIndex","createIndexClass","ranges","_createImmutableMatrix","dimension","strings","FibonacciHeap","createFibonacciHeapClass","oneOverLogPhi","numberOfChildren","tempRight","_findMinimumNode","_decreaseKey","parent","_cut","_cascadingCut","_linkNodes","numRoots","Spa","createSpaClass","heap","nodes","nodei","nodej","createBigNumberE","createBigNumberPhi","createBigNumberPi","createBigNumberTau","Unit","ownKeys","enumerableOnly","symbols","sym","_objectSpread","createUnitClass","toNumber","BASE_DIMENSIONS","skipWhitespace","isDigitDot","isDigit","revert","parseNumber","tentativeNumber","tentativeIndex","parseUnit","unitName","firstC","parseCharacter","toFind","powerMultiplierCurrent","expectingUnit","powerMultiplierStack","powerMultiplierStackProduct","uStr","oldC","_findUnit","power","baseDim","UNIT_SYSTEMS","unitValue","unitPrefixValue","unitPower","prefixValue","UNITS","_unit","prefixLen","prefixName","_prefix","BASE_UNITS","_other","inverted","valThis","valOther","getNumericIfUnitless","nominalOffset","unitOffset","thisUnitValue","thisNominalOffset","thisUnitOffset","otherUnitValue","otherNominalOffset","otherUnitOffset","proposedUnitList","matchingBase","currentUnitSystem","matchingUnit","missingBaseDim","strNum","strDen","nNum","nDen","simp","isImaginary","unitStr","absValue","absUnitValue","bestPrefix","bestDiff","xNumeric","xRounded","xFixed","isNearlyEqual","testSum","PREFIXES","BASE_UNIT_NONE","UNIT_NONE","ALIASES","calculateAngleValues","_name2","_unit2","alias","_key3","assertUnitNameIsValid","_key4","lastUnit","_key5","defUnit","aliases","definition","baseName","ex","newUnit","anyMatch","_newBaseUnit","newBaseUnit","_i8","aliasName","_alias","_key6","createUnitFunction","sparse","createSparse","createUnit","createCreateUnit","def","createAcos","createAcosh","acot","createAcot","acoth","createAcoth","acsc","createAcsc","acsch","createAcsch","asec","createAsec","asech","createAsech","createAsin","createAsinh","createAtan","createAtan2","createAtanh","trigUnit","createTrigUnit","_trigUnit","createCos","createCosh","cot","createCot","coth","createCoth","csc","createCsc","csch","createCsch","sec","createSec","sech","createSech","createSin","createSinh","createTan","createTanh","setCartesian","createSetCartesian","a1","a2","b1","b2","setDifference","createSetDifference","inb2","setDistinct","createSetDistinct","setIntersect","createSetIntersect","setIsSubset","createSetIsSubset","setMultiplicity","createSetMultiplicity","setPowerset","createSetPowerset","_subset","_sort","bitarray","setSize","createSetSize","unique","setSymDifference","createSetSymDifference","setUnion","createSetUnion","createAdd","createHypot","_hypot","largest","createNorm","eigs","_norm","_vectorNormPlusInfinity","pinf","_vectorNormMinusInfinity","ninf","_vectorNorm","_matrixNormFrobenius","fro","_matrixNormOne","maxc","cj","_matrixNormTwo","sizeX","tx","squaredX","eigenVals","rho","_matrixNormInfinity","maxr","ri","_matrixNorm","createDot","_denseDot","_sparseDot","_validateDim","_size","xLen","yLen","aIsColumn","bIsColumn","_c","_c2","_c3","xindex","xvalues","yindex","yvalues","trace","createTrace","_denseTrace","_sparseTrace","createIndex","keywords_1","keywords","Node","_keywords","createNode","mathWithTransform","_validateScope","_arr","symbol","expr","context","evaluate","math","argNames","_traverse","_transform","customString","_setPrototypeOf","setPrototypeOf","_inherits","subClass","superClass","_assertThisInitialized","assertThisInitialized","_possibleConstructorReturn","call","_getPrototypeOf","errorTransform_1","errorTransform","access","accessFactory","_errorTransform","AccessorNode","_inherits2","_possibleConstructorReturn2","_getPrototypeOf2","_access","_createSuper","Derived","hasNativeReflectConstruct","_isNativeReflectConstruct","Super","NewTarget","createAccessorNode","needParenthesis","_Node","_super","evalObject","evalIndex","ArrayNode","createArrayNode","items","evalItems","evalItem","itemsToTex","nested","mixedItems","itemsFormRow","itemSep","itemsTex","assignFactory","operators","getAssociativity","getOperator","getPrecedence","isAssociativeWith","unwrapParen","_node","parenthesis","implicit","identifier","precedence","leftArg","nodeA","nodeB","identifierA","identifierB","group","AssignmentNode","_assign","require$$11","_operators","require$$12","createAssignmentNode","exprPrecedence","evalValue","childObject","evalParentObject","parentProp","evalParentIndex","parentIndex","BlockNode","createBlockNode","blocks","block","visible","evalBlocks","results","ConditionalNode","createConditionalNode","testCondition","condition","trueExpr","falseExpr","evalCondition","evalTrueExpr","evalFalseExpr","conditionPrecedence","truePrecedence","falsePrecedence","latex","escapeLatex","toSymbol","_escapeLatex","latexSymbols","latexOperators","latexFunctions","defaultTemplate","latexUnits","ConstantNode","_latex","createConstantNode","FunctionAssignmentNode","require$$13","createFunctionAssignmentNode","paramNames","childArgNames","evalExpr","syntax","childArgs","IndexNode","createIndexNode","dimensions","dotNotation","evalDimensions","needsEnd","_evalDimension","evalDimension","ObjectNode","createObjectNode","evalEntries","stringifiedKey","parsedKey","tex","OperatorNode","createOperatorNode","startsWithConstant","curNode","calculateNecessaryParentheses","associativity","operandPrecedence","operandIdentifier","rootIdentifier","lhsParens","lhsPrecedence","assocWithLhs","rhsParens","rhsPrecedence","assocWithRhs","_rootIdentifier","lhsIdentifier","rhsIdentifier","argPrecedence","assocWithArg","argAssociativity","op","isPercentage","evalArgs","evalArg0","_evalArg","evalArg1","evalArg","parens","assoc","operand","opIsNamed","lhs","rhs","stringifiedArgs","lhsTex","rhsTex","texifiedArgs","ParenthesisNode","createParenthesisNode","content","RangeNode","createRangeNode","startPrecedence","stepPrecedence","endPrecedence","endSymbols","evalStart","evalEnd","evalStep","RelationalNode","createRelationalNode","operatorMap","conditionals","compiled","evalLhs","evalRhs","condFn","_this2","_this3","paramStrings","paramPrecedence","SymbolNode","createSymbolNode","isValuelessUnit","getPrototypeOf","_superPropBase","superPropBase","receiver","createSubScope","parentScope","FunctionNode","_get2","_scope","require$$14","require$$15","require$$16","createFunctionNode","strin","expandTemplate","regex","inputPos","_rawArgs","isRaw","resolveFn","rawArgs","_rawArgs2","fnExpr","evalFn","_rawArgs3","customTex","latexConverter","customToTex","createParse","expression","parseStart","expressions","parseMultiple","extraNodes","TOKENTYPE","DELIMITERS","NAMED_DELIMITERS","CONSTANTS","NUMERIC_CONSTANTS","initialState","currentString","state","currentCharacter","prevCharacter","nextCharacter","getToken","c2","c3","createSyntaxError","getTokenSkipNewline","openParams","closeParams","cPrev","cNext","high","low","nestingLevel","parseBlock","parseAssignment","valid","parseConditional","parseLogicalOr","parseLogicalXor","parseLogicalAnd","parseBitwiseOr","parseBitwiseXor","parseBitwiseAnd","parseRelational","parseShift","cond","parseConversion","parseRange","parseAddSubtract","parseMultiplyDivide","rightNode","parseImplicitMultiplication","parseRule2","parsePercentage","tokenStates","parseUnary","parsePow","parseLeftHandOperators","parseCustomNodes","parseAccessors","CustomNode","parseSymbol","parseDoubleQuotesString","parseDoubleQuotesStringToken","parseSingleQuotesString","parseSingleQuotesStringToken","parseMatrix","parseRow","parseObject","numberStr","parseParentheses","parseEnd","compile","createCompile","createEvaluate","Parser","createParserClass","parser","createParser","lup","createLup","_denseLUP","_sparseLUP","ldata","lsize","udata","usize","pabsv","absv","vij","lvalues","lindex","lptr","uvalues","uindex","uptr","pvCo","pvOc","swapIndeces","spa","vkj","vik","qr","createQr","_denseQR","_sparseQR","_denseQRimpl","Qdata","Rdata","sgn","conjSgn","alphaSquared","alpha","u1","csPermute_1","csPermute","pinv","nz","t0","csTdfs_1","csTdfs","head","post","stack","csPost_1","csPost","_csTdfs","csEtree_1","csEtree","ata","ancestor","inext","csFkeep_1","csFkeep","csFlip_1","csFlip","csAmd","_csFkeep","_csFlip","createCsAmd","lemax","dense","cm","_createTargetMatrix","cnz","W","nv","elen","degree","hhead","_initializeQuotientGraph","nel","_initializeDegreeLists","mindeg","k2","pj","nvi","pk","eln","pn","elenk","nvk","dk","pk1","pk2","_wclear","wnvi","dext","p3","p4","nvj","jlast","at","tindex","tptr","csLeaf_1","csLeaf","maxfirst","prevleaf","sparent","jleaf","jprev","csCounts","_csLeaf","createCsCounts","colcount","csSqr","_csPermute","_csPost","_csEtree","_csAmd","_csCounts","createCsSqr","_vcount","leftmost","tail","nque","pa","csMarked_1","csMarked","csMark_1","csMark","csUnflip_1","csUnflip","csDfs_1","csDfs","_csMarked","_csMark","_csUnflip","jnew","done","csReach_1","csReach","_csDfs","gptr","gsize","csSpsolve","_csReach","createCsSpsolve","lo","gvalues","gindex","csLu","_csSpsolve","createCsLu","tol","lnz","unz","U","ipiv","xabs","slu","_csSqr","_csLu","createSlu","threshold","csIpvec_1","csIpvec","lusolve","_csIpvec","createLusolve","_lusolve","_toMatrix","polynomialRoot","createPolynomialRoot","constant","restCoeffs","coeffs","_coeffs","denom","discriminant","_coeffs2","_b","_a","_denom","D0_1","D0_2","D1_1","D1_2","Delta0","Delta1","discriminant1","discriminant2","Ccubed","rawRoots","Help","createHelpClass","doc","Chain","createChainClass","createProxy","chainify","createLazyProxy","resolver","sigObject","excludedNames","eDocs","_false","falseDocs","iDocs","_Infinity","InfinityDocs","LN10Docs","LN2","LN2Docs","LOG10E","LOG10EDocs","LOG2E","LOG2EDocs","_NaN","NaNDocs","_null","nullDocs","phiDocs","piDocs","SQRT1_2","SQRT12Docs","SQRT2","SQRT2Docs","tauDocs","_true","trueDocs","version","versionDocs","bignumberDocs","booleanDocs","complexDocs","createUnitDocs","fractionDocs","construction","indexDocs","matrixDocs","numberDocs","sparseDocs","splitUnitDocs","stringDocs","unitDocs","configDocs","_import","importDocs","typedDocs","derivative","derivativeDocs","leafCount","leafCountDocs","lsolveDocs","lsolveAllDocs","lupDocs","lusolveDocs","polynomialRootDocs","qrDocs","rationalize","rationalizeDocs","resolve","resolveDocs","simplify","simplifyDocs","simplifyConstant","simplifyConstantDocs","simplifyCore","simplifyCoreDocs","sluDocs","symbolicEqual","symbolicEqualDocs","usolveDocs","usolveAllDocs","absDocs","addDocs","cbrtDocs","ceilDocs","cubeDocs","divideDocs","dotDivideDocs","dotMultiplyDocs","dotPowDocs","expDocs","expm","expmDocs","expm1Docs","fixDocs","floorDocs","gcdDocs","hypotDocs","invmodDocs","lcmDocs","logDocs","log10Docs","log1pDocs","log2Docs","modDocs","multiplyDocs","normDocs","nthRootDocs","nthRootsDocs","powDocs","roundDocs","signDocs","sqrtDocs","sqrtm","sqrtmDocs","sylvester","sylvesterDocs","schur","schurDocs","lyap","lyapDocs","squareDocs","subtractDocs","unaryMinusDocs","unaryPlusDocs","xgcdDocs","bitAndDocs","bitNotDocs","bitOrDocs","bitXorDocs","leftShiftDocs","rightArithShiftDocs","rightLogShiftDocs","bellNumbers","bellNumbersDocs","catalan","catalanDocs","composition","compositionDocs","stirlingS2","stirlingS2Docs","argDocs","conjDocs","imDocs","reDocs","evaluateDocs","help","helpDocs","distance","distanceDocs","intersect","intersectDocs","andDocs","notDocs","orDocs","xorDocs","columnDocs","concatDocs","countDocs","crossDocs","ctransposeDocs","det","detDocs","diagDocs","diffDocs","dotDocs","eigsDocs","filterDocs","flattenDocs","forEachDocs","getMatrixDataTypeDocs","identityDocs","invDocs","pinvDocs","kronDocs","mapDocs","matrixFromColumnsDocs","matrixFromFunctionDocs","matrixFromRowsDocs","onesDocs","partitionSelectDocs","rangeDocs","reshapeDocs","resizeDocs","rotateDocs","rotationMatrixDocs","rowDocs","sizeDocs","sortDocs","squeezeDocs","subsetDocs","traceDocs","transposeDocs","zerosDocs","fftDocs","ifftDocs","combinationsDocs","combinationsWithRep","combinationsWithRepDocs","factorial","factorialDocs","gamma","gammaDocs","lgamma","lgammaDocs","kldivergence","kldivergenceDocs","multinomial","multinomialDocs","permutations","permutationsDocs","pickRandom","pickRandomDocs","randomDocs","randomInt","randomIntDocs","compareDocs","compareNaturalDocs","compareTextDocs","deepEqualDocs","equalDocs","equalTextDocs","largerDocs","largerEqDocs","smallerDocs","smallerEqDocs","unequalDocs","setCartesianDocs","setDifferenceDocs","setDistinctDocs","setIntersectDocs","setIsSubsetDocs","setMultiplicityDocs","setPowersetDocs","setSizeDocs","setSymDifferenceDocs","setUnionDocs","erfDocs","mad","madDocs","maxDocs","mean","meanDocs","median","medianDocs","minDocs","modeDocs","prodDocs","quantileSeq","quantileSeqDocs","std","stdDocs","cumsum","cumSumDocs","sumDocs","variance","varianceDocs","acosDocs","acoshDocs","acotDocs","acothDocs","acscDocs","acschDocs","asecDocs","asechDocs","asinDocs","asinhDocs","atanDocs","atan2Docs","atanhDocs","cosDocs","coshDocs","cotDocs","cothDocs","cscDocs","cschDocs","secDocs","sechDocs","sinDocs","sinhDocs","tanDocs","tanhDocs","toDocs","binDocs","cloneDocs","formatDocs","hasNumericValueDocs","hexDocs","isIntegerDocs","isNaNDocs","isNegativeDocs","isNumericDocs","isPositiveDocs","isPrimeDocs","isZeroDocs","numericDocs","octDocs","printDocs","typeOfDocs","embeddedDocs_1","_LN","_LN2","_LOG10E","_LOG2E","_phi","_pi","_SQRT1_","_SQRT","_tau","_version","_bignumber","require$$17","_boolean","require$$18","require$$19","_createUnit","require$$20","require$$21","require$$22","_matrix","require$$23","require$$24","_sparse","require$$25","_splitUnit","require$$26","require$$27","require$$28","require$$29","require$$30","require$$31","_derivative","require$$32","_leafCount","require$$33","_lsolve","require$$34","_lsolveAll","require$$35","_lup","require$$36","require$$37","_polynomialRoot","require$$38","_qr","require$$39","_rationalize","require$$40","_resolve","require$$41","_simplify","require$$42","_simplifyConstant","require$$43","_simplifyCore","require$$44","_slu","require$$45","_symbolicEqual","require$$46","_usolve","require$$47","_usolveAll","require$$48","_abs","require$$49","_add","require$$50","_cbrt","require$$51","_ceil","require$$52","_cube","require$$53","_divide","require$$54","_dotDivide","require$$55","_dotMultiply","require$$56","_dotPow","require$$57","_exp","require$$58","_expm","require$$59","_expm2","require$$60","_fix","require$$61","_floor","require$$62","_gcd","require$$63","require$$64","_invmod","require$$65","_lcm","require$$66","_log","require$$67","_log2","require$$68","_log1p","require$$69","_log3","require$$70","_mod","require$$71","_multiply","require$$72","require$$73","_nthRoot","require$$74","_nthRoots","require$$75","require$$76","_round","require$$77","_sign","require$$78","_sqrt","require$$79","_sqrtm","require$$80","_sylvester","require$$81","_schur","require$$82","_lyap","require$$83","_square","require$$84","_subtract","require$$85","_unaryMinus","require$$86","_unaryPlus","require$$87","_xgcd","require$$88","_bitAnd","require$$89","_bitNot","require$$90","_bitOr","require$$91","_bitXor","require$$92","_leftShift","require$$93","_rightArithShift","require$$94","_rightLogShift","require$$95","_bellNumbers","require$$96","_catalan","require$$97","_composition","require$$98","_stirlingS","require$$99","_arg","require$$100","_conj","require$$101","_im","require$$102","_re","require$$103","_evaluate","require$$104","_help","require$$105","_distance","require$$106","_intersect","require$$107","_and","require$$108","_not","require$$109","_or","require$$110","_xor","require$$111","require$$112","require$$113","_count","require$$114","require$$115","_ctranspose","require$$116","_det","require$$117","require$$118","require$$119","_dot","require$$120","_eigs","require$$121","_filter","require$$122","_flatten","require$$123","require$$124","_getMatrixDataType","require$$125","require$$126","_inv","require$$127","_pinv","require$$128","require$$129","require$$130","_matrixFromColumns","require$$131","_matrixFromFunction","require$$132","_matrixFromRows","require$$133","require$$134","require$$135","_range","require$$136","require$$137","require$$138","_rotate","require$$139","_rotationMatrix","require$$140","require$$141","require$$142","require$$143","require$$144","require$$145","_trace","require$$146","require$$147","require$$148","require$$149","_ifft","require$$150","require$$151","_combinationsWithRep","require$$152","_factorial","require$$153","_gamma","require$$154","_lgamma","require$$155","_kldivergence","require$$156","_multinomial","require$$157","_permutations","require$$158","_pickRandom","require$$159","_random","require$$160","_randomInt","require$$161","_compare","require$$162","require$$163","_compareText","require$$164","require$$165","_equal","require$$166","_equalText","require$$167","_larger","require$$168","_largerEq","require$$169","_smaller","require$$170","_smallerEq","require$$171","require$$172","_setCartesian","require$$173","_setDifference","require$$174","_setDistinct","require$$175","_setIntersect","require$$176","_setIsSubset","require$$177","_setMultiplicity","require$$178","_setPowerset","require$$179","_setSize","require$$180","_setSymDifference","require$$181","_setUnion","require$$182","_erf","require$$183","_mad","require$$184","require$$185","_mean","require$$186","_median","require$$187","require$$188","require$$189","require$$190","_quantileSeq","require$$191","_std","require$$192","_cumsum","require$$193","_sum","require$$194","_variance","require$$195","_acos","require$$196","_acosh","require$$197","_acot","require$$198","_acoth","require$$199","_acsc","require$$200","_acsch","require$$201","_asec","require$$202","_asech","require$$203","_asin","require$$204","_asinh","require$$205","_atan","require$$206","_atan2","require$$207","_atanh","require$$208","_cos","require$$209","_cosh","require$$210","_cot","require$$211","_coth","require$$212","_csc","require$$213","_csch","require$$214","_sec","require$$215","_sech","require$$216","_sin","require$$217","_sinh","require$$218","_tan","require$$219","_tanh","require$$220","_to","require$$221","_bin","require$$222","_clone","require$$223","require$$224","_hasNumericValue","require$$225","_hex","require$$226","_isInteger","require$$227","require$$228","_isNegative","require$$229","_isNumeric","require$$230","_isPositive","require$$231","_isPrime","require$$232","_isZero","require$$233","_numeric","require$$234","_oct","require$$235","require$$236","_typeOf","require$$237","embeddedDocs","_embeddedDocs","createHelp","searchName","searchText","chain","createChain","createDet","negated","rowIndices","k_","piv","piv_","i_","createInv","ABig","rBig","Ac","Bc","Ar","Br","createPinv","_isZeros","_rankFact2","_rankFact","Cpinv","Fpinv","_rref","lead","rref","complexEigs","createComplexEigs","prec","findVectors","balance","reduceToHessenberg","_iterateUntilTriangul","iterateUntilTriangular","vectors","findEigenvectors","big","cplx","realzero","realone","radixSq","Rdiag","colNorm","rowNorm","rowDivRadix","rowMulRadix","maxIndex","el","tmp1","tmp2","tmp3","lambdas","Sdiag","Qtotal","Qpartial","lastConvergenceBefore","inflateMatrix","ll","eigenvalues2x2","jordanBase2x2","blockDiag","Cinv","uniqueValues","multiplicities","λ","indexOf","E","failedLambdas","S","solutions","approxVec","inverseIterate","correction","trA","detA","l1","l2","na","nb","nc","nd","_arr$i","orthog","largeNum","randomOrthogonalVector","orthogonalComplement","normalize","_iterator3","_step3","realSymetric","createRealSymmetric","main","diagBig","e0","psi","Sij","createArray","Vab","getAij","getTheta","Sij1","Ei","sorting","getAijBig","getThetaBig","x1Big","Sij1Big","aii","ajj","aij","Ski","Skj","Hij","s2","Aki","Akj","csHij","Aii","Ajj","_k3","_k4","Mij","maxMij","maxIJ","minID","minE","_k5","_complexEigs","_realSymetric","createEigs","doRealSymetric","doComplexEigs","computeValuesAndVectors","_computeValuesAndVect","_computeValuesAndVect2","isReal","coerceReal","isSymmetric","_type","coerceTypes","hasNumber","hasBig","hasComplex","createExpm","infNorm","infinityNorm","findParams","Apos","factor","AposToI","alternate","rowSum","maxSearchSize","errorEstimate","qfac","twoqfac","twoqp1fac","createSqrtm","_maxIterations","_tolerance","_denmanBeavers","iterations","Y","Z","Yk","createSylvester","sA","sB","G","V","hc","RHS","gkk","gmk","gkm","gmm","LHS","yAux","_RHS","_gkk","_LHS","X","createSchur","A0","QR","createLyap","createDivide","createDistance","_2d","xCoeff","yCoeff","_distancePointLine2D","_3d","_parametricLine","_distancePointLine3D","_containsOnlyNumbers","_euclideanDistance","_pairwise","_distancePairwise","_isNumber","_objectToArray","aI","den","x0","y0","z0","vectorSize","pointA","pointB","createIntersect","_AAA","_AAAA","plane","_coerceArr","_4d","_intersectLinePlane","_intersect2d","_intersect3d","p1a","p1b","p2a","p2b","o1","o2","d20o11","d21o10","d20o21","d21o20","_intersect3dHelper","add1","add2","add3","y1","z1","y2","z2","x3","y3","z3","x4","y4","z4","d1343","d4321","d1321","d4343","d2121","ta","tb","pax","pay","paz","pbx","pby","pbz","x1x","x2x","y1y","y2y","z1z","z2z","py","pz","createSum","_nsumDim","createCumSum","_ncumSumDim","_cumsummap","sums","_cumsumDimensional","initialValue","createMean","_nmeanDim","createMedian","mid","right","left","middle2","middle","createMad","med","DEFAULT_NORMALIZATION","createVariance","_var","_varDim","normalization","createQuantileSeq","probOrN","probArr","dataArr","nPlusOne","intN","_nPlusOne","probOrNArr","currProb","prob","_fracPart","_integerPart","_left","_right","fracPart","integerPartNumber","createStd","createCombinations","isPositiveInteger","createCombinationsWithRep","_prodrange","prodrange","nMinusOne","createGamma","gammaComplex","_t","gammaPval","twoPiSqrt","tpow","expt","bigFactorial","createLgamma","SMALL_RE","SMALL_IM","lgammaComplex","TWOPI","LOGPI","REFLECTION","lgammaStirling","lgammaRecurrence","leftPart","rz","rzz","rightPart","signflips","sb","shiftprod","nsb","createFactorial","createKldivergence","_kldiv","plength","qlength","sumq","sump","qnorm","pnorm","createMultinomial","ai","createPermutations","seededRNG","createRng","_seedrandom","singletonRandom","randomSeed","setSeed","seed","rng","_seededRNG","createPickRandom","possibles","weights","_ref2$elementWise","elementWise","single","totalWeights","randKey","randomMatrix_1","randomMatrix","_length","_randomMatrix2","createRandom","_randomMatrix","createRandomNumber","createRandomInt","_randomIntMatrix","createStirlingS2","smallCache","bigCache","cache","make","nn","nk","createBellNumbers","createCatalan","createComposition","createLeafCount","countLeaves","isConstantExpression","isNumericNode","util","createUtil","T","defaultName","defaultContext","realContext","positiveContext","hasProperty","nodeOrName","_properties","_properties2","isCommutative","isAssociative","mergeContext","primary","secondary","merged","allChildren","children","findChildren","unflattenr","makeNode","createMakeNodeFunction","curnode","unflattenl","_wildcards","_util","createSimplify","_createUtil","removeParens","SUPPORTED_CONSTANTS","_canonicalizeRule","ruleObject","newRule","lr","nonCommutative","leftExpandsym","_getExpandPlaceholderSymbol","expandsym","_buildRules","rules","ruleSet","rule","ruleType","_lastsym","debug","visited","laststr","rulestr","applyRule","newstr","mapRule","resNodes","newNode","mergedContext","newArgs","newContent","newItems","newObj","newIndex","newDims","newProps","repl","_ruleMatch","getSplits","rightArgs","mergeMatch","match1","match2","_exactMatch","combineChildMatches","list1","list2","i1","i2","mergeChildMatches","childMatches","sets","uniqueSets","isSplit","childMatch","leftMatch","rightMatch","splits","splitMatches","matchSet","createSimplifyConstant","_ensureNode","foldFraction","_removeFractions","thing","_eval","fnname","_toNumber","_toNode","_fractionToNode","unaryMinusNode","_exactFraction","exactFractions","fractionsLimit","vn","_foldAccessor","remainingDims","second","tryItems","fromItems","foldOp","reduction","sofar","newtree","operatorFunctions","sz","section","_args","consts","vars","foldItems","foldProps","createSimplifyCore","node0","node1","nodeT","nodeF","isAlwaysBoolean","nodeToSimplify","simpChild","childCount","seclast","a0","finish","createResolve","within","variables","nextWithin","selfAM","createSymbolicEqual","e1","e2","simplified","createDerivative","plainDerivative","variable","constNodes","constTag","deriv","_derivTex","varName","isConst","funcArgsCheck","negative","funcDerivative","chainDerivative","constantTerms","nonConstantTerms","nonConstantNode","argOuter","argInner","_arg2","powMinusOne","valueType","createRationalize","detailed","setRules","rulesRationalize","polyRet","polynomial","nVars","noExactFractions","withExactFractions","expandPower","sBefore","eDistrDiv","redoInic","retRationalize","polyToCanonical","extended","oper","recPoly","retFunc","tp","pos","oldRules","rulesFirst","rulesDistrDiv","rulesSucDiv","indParent","internal","does","nEsqTopo","nDirTopo","maxExpo","varname","recurPol","no","n3","noPai","valor","reviver","createReviver","classes","constructor","replacer","createReplacer","version_1","createTrue","createFalse","createNull","createInfinity","recreateFactory","createNaN","createPi","_ref3","createTau","_ref4","createE","_ref5","createPhi","_ref6","createLN2","_ref7","createLN10","_ref8","createLOG2E","_ref9","createLOG10E","_ref10","createSQRT1_2","_ref11","createSQRT2","_ref12","createI","_ref13","createUppercasePi","_ref14","createUppercaseE","_ref15","createVersion","physicalConstants","createSpeedOfLight","unitFactory","createGravitationConstant","createPlanckConstant","createReducedPlanckConstant","createMagneticConstant","createElectricConstant","createVacuumImpedance","createCoulomb","createElementaryCharge","createBohrMagneton","createConductanceQuantum","createInverseConductanceQuantum","createMagneticFluxQuantum","createNuclearMagneton","createKlitzing","createJosephson","createBohrRadius","createClassicalElectronRadius","createElectronMass","createFermiCoupling","createFineStructure","numberFactory","createHartreeEnergy","createProtonMass","createDeuteronMass","createNeutronMass","createQuantumOfCirculation","createRydberg","createThomsonCrossSection","createWeakMixingAngle","createEfimovFactor","createAtomicMass","createAvogadro","createBoltzmann","createFaraday","createFirstRadiation","createLoschmidt","createGasConstant","createMolarPlanckConstant","createMolarVolume","createSackurTetrode","createSecondRadiation","createStefanBoltzmann","createWienDisplacement","createMolarMass","createMolarMassC12","createGravity","createPlanckLength","createPlanckMass","createPlanckTime","createPlanckCharge","createPlanckTemperature","apply_transform","createApplyTransform","column_transform","createColumnTransform","compileInlineExpression_1","compileInlineExpression","subScope","filter_transform","_compileInlineExpression","createFilterTransform","filterTransform","forEach_transform","createForEachTransform","forEachTransform","index_transform","createIndexTransform","map_transform","createMapTransform","mapTransform","orig","argsCount","lastDimToZeroBase_1","lastDimToZeroBase","max_transform","_lastDimToZeroBase","createMaxTransform","mean_transform","createMeanTransform","min_transform","createMinTransform","range_transform","createRangeTransform","row_transform","createRowTransform","subset_transform","createSubsetTransform","concat_transform","createConcatTransform","diff_transform","createDiffTransform","std_transform","createStdTransform","sum_transform","createSumTransform","cumsum_transform","createCumSumTransform","variance_transform","createVarianceTransform","_AccessorNode","_addScalar","_applyTransform","_ArrayNode","_AssignmentNode","_physicalConstants","_BlockNode","_chain","_Chain","_columnTransform","_compile","_concatTransform","_ConditionalNode","_ConstantNode","_cumsumTransform","_DenseMatrix","_diffTransform","_divideScalar","_equalScalar","_FibonacciHeap","_filterTransform","_forEachTransform","_FunctionAssignmentNode","_FunctionNode","_Help","_ImmutableDenseMatrix","_MatrixIndex","_IndexNode","_indexTransform","_mapTransform","_Matrix","_maxTransform","_meanTransform","_minTransform","_multiplyScalar","_ObjectNode","_OperatorNode","_ParenthesisNode","_parser","_Parser","_Range","_RangeNode","_rangeTransform","_RelationalNode","_replacer","_ResultSet","_reviver","_rowTransform","_Spa","_SparseMatrix","_stdTransform","_subsetTransform","_sumTransform","_SymbolNode","_Unit","_varianceTransform","require$$238","require$$239","require$$240","require$$241","require$$242","require$$243","require$$244","require$$245","require$$246","require$$247","require$$248","require$$249","require$$250","require$$251","require$$252","require$$253","require$$254","require$$255","require$$256","require$$257","require$$258","require$$259","require$$260","require$$261","require$$262","require$$263","require$$264","require$$265","require$$266","require$$267","require$$268","require$$269","require$$270","require$$271","require$$272","require$$273","require$$274","require$$275","require$$276","require$$277","require$$278","require$$279","require$$280","require$$281","_configReadonly","_factoriesAny","fineStructure","sackurTetrode","efimovFactor","weakMixingAngle","vacuumImpedance","wienDisplacement","atomicMass","bohrMagneton","boltzmann","conductanceQuantum","deuteronMass","electricConstant","elementaryCharge","faraday","gravitationConstant","hartreeEnergy","klitzing","loschmidt","magneticConstant","molarMass","molarPlanckConstant","neutronMass","nuclearMagneton","planckCharge","planckLength","planckTemperature","protonMass","reducedPlanckConstant","rydberg","secondRadiation","speedOfLight","stefanBoltzmann","thomsonCrossSection","avogadro","bohrRadius","coulomb","electronMass","firstRadiation","gasConstant","inverseConductanceQuantum","magneticFluxQuantum","molarMassC12","planckMass","fermiCoupling","gravity","molarVolume","planckConstant","quantumOfCirculation","classicalElectronRadius","planckTime","_pureFunctionsAnyGenerated","dependenciesBigNumberClass_generated","BigNumberDependencies","dependenciesComplexClass_generated","ComplexDependencies","dependenciesMatrixClass_generated","MatrixDependencies","dependenciesDenseMatrixClass_generated","_dependenciesMatrixClassGenerated","DenseMatrixDependencies","dependenciesFractionClass_generated","FractionDependencies","dependenciesTyped_generated","_dependenciesBigNumberClassGenerated","_dependenciesComplexClassGenerated","_dependenciesDenseMatrixClassGenerated","_dependenciesFractionClassGenerated","typedDependencies","dependenciesAbs_generated","_dependenciesTypedGenerated","absDependencies","dependenciesNode_generated","NodeDependencies","dependenciesEqualScalar_generated","equalScalarDependencies","dependenciesSparseMatrixClass_generated","_dependenciesEqualScalarGenerated","SparseMatrixDependencies","dependenciesMatrix_generated","_dependenciesSparseMatrixClassGenerated","matrixDependencies","dependenciesSubset_generated","_dependenciesMatrixGenerated","subsetDependencies","dependenciesAccessorNode_generated","_dependenciesNodeGenerated","_dependenciesSubsetGenerated","AccessorNodeDependencies","dependenciesAcos_generated","acosDependencies","dependenciesAcosh_generated","acoshDependencies","dependenciesAcot_generated","acotDependencies","dependenciesAcoth_generated","acothDependencies","dependenciesAcsc_generated","acscDependencies","dependenciesAcsch_generated","acschDependencies","dependenciesAddScalar_generated","addScalarDependencies","dependenciesIsInteger_generated","isIntegerDependencies","dependenciesConcat_generated","_dependenciesIsIntegerGenerated","concatDependencies","dependenciesAdd_generated","_dependenciesAddScalarGenerated","_dependenciesConcatGenerated","addDependencies","dependenciesNot_generated","notDependencies","dependenciesZeros_generated","zerosDependencies","dependenciesAnd_generated","_dependenciesNotGenerated","_dependenciesZerosGenerated","andDependencies","dependenciesApply_generated","applyDependencies","dependenciesApplyTransform_generated","applyTransformDependencies","dependenciesArg_generated","argDependencies","dependenciesArrayNode_generated","ArrayNodeDependencies","dependenciesAsec_generated","asecDependencies","dependenciesAsech_generated","asechDependencies","dependenciesAsin_generated","asinDependencies","dependenciesAsinh_generated","asinhDependencies","dependenciesAssignmentNode_generated","AssignmentNodeDependencies","dependenciesAtan_generated","atanDependencies","dependenciesAtan2_generated","atan2Dependencies","dependenciesAtanh_generated","atanhDependencies","dependenciesBignumber_generated","bignumberDependencies","dependenciesFraction_generated","fractionDependencies","dependenciesNumber_generated","numberDependencies","dependenciesNumeric_generated","_dependenciesBignumberGenerated","_dependenciesFractionGenerated","_dependenciesNumberGenerated","numericDependencies","dependenciesDivideScalar_generated","_dependenciesNumericGenerated","divideScalarDependencies","dependenciesEqual_generated","equalDependencies","dependenciesRound_generated","roundDependencies","dependenciesCeil_generated","_dependenciesRoundGenerated","ceilDependencies","dependenciesFloor_generated","floorDependencies","dependenciesFix_generated","_dependenciesCeilGenerated","_dependenciesFloorGenerated","fixDependencies","dependenciesFormat_generated","formatDependencies","dependenciesIsNumeric_generated","isNumericDependencies","dependenciesMultiplyScalar_generated","multiplyScalarDependencies","dependenciesIdentity_generated","identityDependencies","dependenciesIsZero_generated","isZeroDependencies","dependenciesConj_generated","conjDependencies","dependenciesSize_generated","sizeDependencies","dependenciesDot_generated","_dependenciesConjGenerated","_dependenciesMultiplyScalarGenerated","_dependenciesSizeGenerated","dotDependencies","dependenciesMultiply_generated","_dependenciesDotGenerated","multiplyDependencies","dependenciesUnaryMinus_generated","unaryMinusDependencies","dependenciesSubtract_generated","_dependenciesUnaryMinusGenerated","subtractDependencies","dependenciesDet_generated","_dependenciesDivideScalarGenerated","_dependenciesIsZeroGenerated","_dependenciesMultiplyGenerated","_dependenciesSubtractGenerated","detDependencies","dependenciesInv_generated","_dependenciesAbsGenerated","_dependenciesDetGenerated","_dependenciesIdentityGenerated","invDependencies","dependenciesPow_generated","_dependenciesInvGenerated","powDependencies","dependenciesUnitClass_generated","_dependenciesEqualGenerated","_dependenciesFixGenerated","_dependenciesFormatGenerated","_dependenciesIsNumericGenerated","_dependenciesPowGenerated","UnitDependencies","dependenciesAtomicMass_generated","_dependenciesUnitClassGenerated","atomicMassDependencies","dependenciesAvogadro_generated","avogadroDependencies","dependenciesIsNegative_generated","isNegativeDependencies","dependenciesCombinations_generated","combinationsDependencies","dependenciesGamma_generated","gammaDependencies","dependenciesFactorial_generated","_dependenciesGammaGenerated","factorialDependencies","dependenciesLarger_generated","largerDependencies","dependenciesStirlingS2_generated","_dependenciesCombinationsGenerated","_dependenciesFactorialGenerated","_dependenciesIsNegativeGenerated","_dependenciesLargerGenerated","stirlingS2Dependencies","dependenciesBellNumbers_generated","_dependenciesStirlingS2Generated","bellNumbersDependencies","dependenciesBin_generated","binDependencies","dependenciesBitAnd_generated","bitAndDependencies","dependenciesBitNot_generated","bitNotDependencies","dependenciesBitOr_generated","bitOrDependencies","dependenciesBitXor_generated","bitXorDependencies","dependenciesResultSet_generated","ResultSetDependencies","dependenciesBlockNode_generated","_dependenciesResultSetGenerated","BlockNodeDependencies","dependenciesBohrMagneton_generated","bohrMagnetonDependencies","dependenciesBohrRadius_generated","bohrRadiusDependencies","dependenciesBoltzmann_generated","boltzmannDependencies","dependenciesBoolean_generated","booleanDependencies","dependenciesCatalan_generated","catalanDependencies","dependenciesCbrt_generated","cbrtDependencies","dependenciesChainClass_generated","ChainDependencies","dependenciesChain_generated","_dependenciesChainClassGenerated","chainDependencies","dependenciesClassicalElectronRadius_generated","classicalElectronRadiusDependencies","dependenciesClone_generated","cloneDependencies","dependenciesSmaller_generated","smallerDependencies","dependenciesImmutableDenseMatrixClass_generated","_dependenciesSmallerGenerated","ImmutableDenseMatrixDependencies","dependenciesIndexClass_generated","_dependenciesImmutableDenseMatrixClassGenerated","IndexDependencies","dependenciesLargerEq_generated","largerEqDependencies","dependenciesSmallerEq_generated","smallerEqDependencies","dependenciesRange_generated","_dependenciesLargerEqGenerated","_dependenciesSmallerEqGenerated","rangeDependencies","dependenciesColumn_generated","_dependenciesIndexClassGenerated","_dependenciesRangeGenerated","columnDependencies","dependenciesColumnTransform_generated","columnTransformDependencies","dependenciesCombinationsWithRep_generated","combinationsWithRepDependencies","dependenciesCompare_generated","compareDependencies","dependenciesCompareNatural_generated","_dependenciesCompareGenerated","compareNaturalDependencies","dependenciesCompareText_generated","compareTextDependencies","dependenciesConditionalNode_generated","ConditionalNodeDependencies","dependenciesConstantNode_generated","ConstantNodeDependencies","dependenciesFunctionAssignmentNode_generated","FunctionAssignmentNodeDependencies","dependenciesSymbolNode_generated","SymbolNodeDependencies","dependenciesFunctionNode_generated","_dependenciesSymbolNodeGenerated","FunctionNodeDependencies","dependenciesIndexNode_generated","IndexNodeDependencies","dependenciesObjectNode_generated","ObjectNodeDependencies","dependenciesOperatorNode_generated","OperatorNodeDependencies","dependenciesParenthesisNode_generated","ParenthesisNodeDependencies","dependenciesRangeNode_generated","RangeNodeDependencies","dependenciesRelationalNode_generated","RelationalNodeDependencies","dependenciesParse_generated","_dependenciesAccessorNodeGenerated","_dependenciesArrayNodeGenerated","_dependenciesAssignmentNodeGenerated","_dependenciesBlockNodeGenerated","_dependenciesConditionalNodeGenerated","_dependenciesConstantNodeGenerated","_dependenciesFunctionAssignmentNodeGenerated","_dependenciesFunctionNodeGenerated","_dependenciesIndexNodeGenerated","_dependenciesObjectNodeGenerated","_dependenciesOperatorNodeGenerated","_dependenciesParenthesisNodeGenerated","_dependenciesRangeNodeGenerated","_dependenciesRelationalNodeGenerated","parseDependencies","dependenciesCompile_generated","_dependenciesParseGenerated","compileDependencies","dependenciesComplex_generated","complexDependencies","dependenciesIsPositive_generated","isPositiveDependencies","dependenciesComposition_generated","_dependenciesIsPositiveGenerated","compositionDependencies","dependenciesConcatTransform_generated","concatTransformDependencies","dependenciesConductanceQuantum_generated","conductanceQuantumDependencies","dependenciesCos_generated","cosDependencies","dependenciesCosh_generated","coshDependencies","dependenciesCot_generated","cotDependencies","dependenciesCoth_generated","cothDependencies","dependenciesCoulomb_generated","coulombDependencies","dependenciesProd_generated","prodDependencies","dependenciesCount_generated","_dependenciesProdGenerated","countDependencies","dependenciesCreateUnit_generated","createUnitDependencies","dependenciesCross_generated","crossDependencies","dependenciesCsc_generated","cscDependencies","dependenciesCsch_generated","cschDependencies","dependenciesTranspose_generated","transposeDependencies","dependenciesCtranspose_generated","_dependenciesTransposeGenerated","ctransposeDependencies","dependenciesCube_generated","cubeDependencies","dependenciesUnaryPlus_generated","unaryPlusDependencies","dependenciesCumSum_generated","_dependenciesAddGenerated","_dependenciesUnaryPlusGenerated","cumsumDependencies","dependenciesCumSumTransform_generated","cumsumTransformDependencies","dependenciesDeepEqual_generated","deepEqualDependencies","dependenciesDivide_generated","divideDependencies","dependenciesResolve_generated","resolveDependencies","dependenciesSimplifyConstant_generated","simplifyConstantDependencies","dependenciesSimplifyCore_generated","_dependenciesDivideGenerated","simplifyCoreDependencies","dependenciesSimplify_generated","_dependenciesResolveGenerated","_dependenciesSimplifyConstantGenerated","_dependenciesSimplifyCoreGenerated","simplifyDependencies","dependenciesDerivative_generated","_dependenciesSimplifyGenerated","derivativeDependencies","dependenciesDeuteronMass_generated","deuteronMassDependencies","dependenciesDiag_generated","diagDependencies","dependenciesDiff_generated","diffDependencies","dependenciesDiffTransform_generated","diffTransformDependencies","dependenciesSqrt_generated","sqrtDependencies","dependenciesDistance_generated","_dependenciesSqrtGenerated","distanceDependencies","dependenciesDotDivide_generated","dotDivideDependencies","dependenciesDotMultiply_generated","dotMultiplyDependencies","dependenciesDotPow_generated","dotPowDependencies","dependenciesE_generated","eDependencies","dependenciesEfimovFactor_generated","efimovFactorDependencies","dependenciesFlatten_generated","flattenDependencies","dependenciesIm_generated","imDependencies","dependenciesMatrixFromColumns_generated","_dependenciesFlattenGenerated","matrixFromColumnsDependencies","dependenciesSign_generated","_dependenciesComplexGenerated","signDependencies","dependenciesQr_generated","_dependenciesSignGenerated","qrDependencies","dependenciesRe_generated","reDependencies","dependenciesSin_generated","sinDependencies","dependenciesUsolve_generated","usolveDependencies","dependenciesUsolveAll_generated","usolveAllDependencies","dependenciesEigs_generated","_dependenciesAtanGenerated","_dependenciesColumnGenerated","_dependenciesCosGenerated","_dependenciesDiagGenerated","_dependenciesImGenerated","_dependenciesMatrixFromColumnsGenerated","_dependenciesQrGenerated","_dependenciesReGenerated","_dependenciesSinGenerated","_dependenciesUsolveGenerated","_dependenciesUsolveAllGenerated","eigsDependencies","dependenciesElectricConstant_generated","electricConstantDependencies","dependenciesElectronMass_generated","electronMassDependencies","dependenciesElementaryCharge_generated","elementaryChargeDependencies","dependenciesEqualText_generated","_dependenciesCompareTextGenerated","equalTextDependencies","dependenciesErf_generated","erfDependencies","dependenciesEvaluate_generated","evaluateDependencies","dependenciesExp_generated","expDependencies","dependenciesExpm_generated","expmDependencies","dependenciesExpm1_generated","expm1Dependencies","dependenciesFalse_generated","falseDependencies","dependenciesFaraday_generated","faradayDependencies","dependenciesFermiCoupling_generated","fermiCouplingDependencies","dependenciesI_generated","iDependencies","dependenciesLog2_generated","log2Dependencies","dependenciesTau_generated","tauDependencies","dependenciesFft_generated","_dependenciesDotDivideGenerated","_dependenciesExpGenerated","_dependenciesIGenerated","_dependenciesLog2Generated","_dependenciesTauGenerated","fftDependencies","dependenciesFibonacciHeapClass_generated","FibonacciHeapDependencies","dependenciesFilter_generated","filterDependencies","dependenciesFilterTransform_generated","filterTransformDependencies","dependenciesFineStructure_generated","fineStructureDependencies","dependenciesFirstRadiation_generated","firstRadiationDependencies","dependenciesForEach_generated","forEachDependencies","dependenciesForEachTransform_generated","forEachTransformDependencies","dependenciesGasConstant_generated","gasConstantDependencies","dependenciesGcd_generated","gcdDependencies","dependenciesGetMatrixDataType_generated","getMatrixDataTypeDependencies","dependenciesGravitationConstant_generated","gravitationConstantDependencies","dependenciesGravity_generated","gravityDependencies","dependenciesHartreeEnergy_generated","hartreeEnergyDependencies","dependenciesHasNumericValue_generated","hasNumericValueDependencies","dependenciesHelpClass_generated","HelpDependencies","dependenciesHelp_generated","_dependenciesHelpClassGenerated","helpDependencies","dependenciesHex_generated","hexDependencies","dependenciesHypot_generated","hypotDependencies","dependenciesIfft_generated","_dependenciesFftGenerated","ifftDependencies","dependenciesIndex_generated","indexDependencies","dependenciesIndexTransform_generated","indexTransformDependencies","dependenciesInfinity_generated","InfinityDependencies","dependenciesIntersect_generated","intersectDependencies","dependenciesInverseConductanceQuantum_generated","inverseConductanceQuantumDependencies","dependenciesMod_generated","modDependencies","dependenciesXgcd_generated","xgcdDependencies","dependenciesInvmod_generated","_dependenciesModGenerated","_dependenciesXgcdGenerated","invmodDependencies","dependenciesIsNaN_generated","isNaNDependencies","dependenciesIsPrime_generated","isPrimeDependencies","dependenciesLog_generated","logDependencies","dependenciesMap_generated","mapDependencies","dependenciesSum_generated","sumDependencies","dependenciesKldivergence_generated","_dependenciesLogGenerated","_dependenciesMapGenerated","_dependenciesSumGenerated","kldivergenceDependencies","dependenciesKlitzing_generated","klitzingDependencies","dependenciesKron_generated","kronDependencies","dependenciesLN10_generated","LN10Dependencies","dependenciesLN2_generated","LN2Dependencies","dependenciesLOG10E_generated","LOG10EDependencies","dependenciesLOG2E_generated","LOG2EDependencies","dependenciesLcm_generated","lcmDependencies","dependenciesLeafCount_generated","leafCountDependencies","dependenciesLeftShift_generated","leftShiftDependencies","dependenciesLgamma_generated","lgammaDependencies","dependenciesLog10_generated","log10Dependencies","dependenciesLog1p_generated","log1pDependencies","dependenciesLoschmidt_generated","loschmidtDependencies","dependenciesLsolve_generated","lsolveDependencies","dependenciesLsolveAll_generated","lsolveAllDependencies","dependenciesSpaClass_generated","_dependenciesFibonacciHeapClassGenerated","SpaDependencies","dependenciesLup_generated","_dependenciesSpaClassGenerated","lupDependencies","dependenciesSlu_generated","sluDependencies","dependenciesLusolve_generated","_dependenciesLsolveGenerated","_dependenciesLupGenerated","_dependenciesSluGenerated","lusolveDependencies","dependenciesNorm_generated","_dependenciesCtransposeGenerated","_dependenciesEigsGenerated","normDependencies","dependenciesSchur_generated","_dependenciesNormGenerated","schurDependencies","dependenciesSylvester_generated","_dependenciesIndexGenerated","_dependenciesLusolveGenerated","_dependenciesSchurGenerated","sylvesterDependencies","dependenciesLyap_generated","_dependenciesSylvesterGenerated","lyapDependencies","dependenciesPartitionSelect_generated","_dependenciesIsNaNGenerated","partitionSelectDependencies","dependenciesMedian_generated","_dependenciesPartitionSelectGenerated","medianDependencies","dependenciesMad_generated","_dependenciesMedianGenerated","madDependencies","dependenciesMagneticConstant_generated","magneticConstantDependencies","dependenciesMagneticFluxQuantum_generated","magneticFluxQuantumDependencies","dependenciesMapTransform_generated","mapTransformDependencies","dependenciesMatrixFromFunction_generated","matrixFromFunctionDependencies","dependenciesMatrixFromRows_generated","matrixFromRowsDependencies","dependenciesMax_generated","maxDependencies","dependenciesMaxTransform_generated","maxTransformDependencies","dependenciesMean_generated","meanDependencies","dependenciesMeanTransform_generated","meanTransformDependencies","dependenciesMin_generated","minDependencies","dependenciesMinTransform_generated","minTransformDependencies","dependenciesMode_generated","modeDependencies","dependenciesMolarMass_generated","molarMassDependencies","dependenciesMolarMassC12_generated","molarMassC12Dependencies","dependenciesMolarPlanckConstant_generated","molarPlanckConstantDependencies","dependenciesMolarVolume_generated","molarVolumeDependencies","dependenciesMultinomial_generated","multinomialDependencies","dependenciesNaN_generated","NaNDependencies","dependenciesNeutronMass_generated","neutronMassDependencies","dependenciesNthRoot_generated","nthRootDependencies","dependenciesNthRoots_generated","nthRootsDependencies","dependenciesNuclearMagneton_generated","nuclearMagnetonDependencies","dependenciesNull_generated","nullDependencies","dependenciesOct_generated","octDependencies","dependenciesOnes_generated","onesDependencies","dependenciesOr_generated","orDependencies","dependenciesParserClass_generated","_dependenciesEvaluateGenerated","ParserDependencies","dependenciesParser_generated","_dependenciesParserClassGenerated","parserDependencies","dependenciesPermutations_generated","permutationsDependencies","dependenciesPhi_generated","phiDependencies","dependenciesPi_generated","piDependencies","dependenciesPickRandom_generated","pickRandomDependencies","dependenciesPinv_generated","_dependenciesDeepEqualGenerated","pinvDependencies","dependenciesPlanckCharge_generated","planckChargeDependencies","dependenciesPlanckConstant_generated","planckConstantDependencies","dependenciesPlanckLength_generated","planckLengthDependencies","dependenciesPlanckMass_generated","planckMassDependencies","dependenciesPlanckTemperature_generated","planckTemperatureDependencies","dependenciesPlanckTime_generated","planckTimeDependencies","dependenciesTypeOf_generated","typeOfDependencies","dependenciesPolynomialRoot_generated","_dependenciesCbrtGenerated","_dependenciesTypeOfGenerated","polynomialRootDependencies","dependenciesPrint_generated","printDependencies","dependenciesProtonMass_generated","protonMassDependencies","dependenciesQuantileSeq_generated","quantileSeqDependencies","dependenciesQuantumOfCirculation_generated","quantumOfCirculationDependencies","dependenciesRandom_generated","randomDependencies","dependenciesRandomInt_generated","randomIntDependencies","dependenciesRangeClass_generated","RangeDependencies","dependenciesRangeTransform_generated","rangeTransformDependencies","dependenciesRationalize_generated","rationalizeDependencies","dependenciesReducedPlanckConstant_generated","reducedPlanckConstantDependencies","dependenciesReplacer_generated","replacerDependencies","dependenciesReshape_generated","reshapeDependencies","dependenciesResize_generated","resizeDependencies","dependenciesReviver_generated","reviverDependencies","dependenciesRightArithShift_generated","rightArithShiftDependencies","dependenciesRightLogShift_generated","rightLogShiftDependencies","dependenciesRotationMatrix_generated","rotationMatrixDependencies","dependenciesRotate_generated","_dependenciesRotationMatrixGenerated","rotateDependencies","dependenciesRow_generated","rowDependencies","dependenciesRowTransform_generated","rowTransformDependencies","dependenciesRydberg_generated","rydbergDependencies","dependenciesSQRT1_2_generated","SQRT1_2Dependencies","dependenciesSQRT2_generated","SQRT2Dependencies","dependenciesSackurTetrode_generated","sackurTetrodeDependencies","dependenciesSec_generated","secDependencies","dependenciesSech_generated","sechDependencies","dependenciesSecondRadiation_generated","secondRadiationDependencies","dependenciesSetCartesian_generated","_dependenciesCompareNaturalGenerated","setCartesianDependencies","dependenciesSetDifference_generated","setDifferenceDependencies","dependenciesSetDistinct_generated","setDistinctDependencies","dependenciesSetIntersect_generated","setIntersectDependencies","dependenciesSetIsSubset_generated","setIsSubsetDependencies","dependenciesSetMultiplicity_generated","setMultiplicityDependencies","dependenciesSetPowerset_generated","setPowersetDependencies","dependenciesSetSize_generated","setSizeDependencies","dependenciesSetSymDifference_generated","_dependenciesSetDifferenceGenerated","setSymDifferenceDependencies","dependenciesSetUnion_generated","_dependenciesSetIntersectGenerated","_dependenciesSetSymDifferenceGenerated","setUnionDependencies","dependenciesSinh_generated","sinhDependencies","dependenciesSort_generated","sortDependencies","dependenciesSparse_generated","sparseDependencies","dependenciesSpeedOfLight_generated","speedOfLightDependencies","dependenciesSplitUnit_generated","splitUnitDependencies","dependenciesSqrtm_generated","_dependenciesMaxGenerated","sqrtmDependencies","dependenciesSquare_generated","squareDependencies","dependenciesSqueeze_generated","squeezeDependencies","dependenciesVariance_generated","_dependenciesApplyGenerated","varianceDependencies","dependenciesStd_generated","_dependenciesVarianceGenerated","stdDependencies","dependenciesStdTransform_generated","stdTransformDependencies","dependenciesStefanBoltzmann_generated","stefanBoltzmannDependencies","dependenciesString_generated","stringDependencies","dependenciesSubsetTransform_generated","subsetTransformDependencies","dependenciesSumTransform_generated","sumTransformDependencies","dependenciesSymbolicEqual_generated","symbolicEqualDependencies","dependenciesTan_generated","tanDependencies","dependenciesTanh_generated","tanhDependencies","dependenciesThomsonCrossSection_generated","thomsonCrossSectionDependencies","dependenciesTo_generated","toDependencies","dependenciesTrace_generated","traceDependencies","dependenciesTrue_generated","trueDependencies","dependenciesUnequal_generated","unequalDependencies","dependenciesUnitFunction_generated","unitDependencies","dependenciesUppercaseE_generated","_dependenciesEGenerated","EDependencies","dependenciesUppercasePi_generated","_dependenciesPiGenerated","PIDependencies","dependenciesVacuumImpedance_generated","vacuumImpedanceDependencies","dependenciesVarianceTransform_generated","varianceTransformDependencies","dependenciesVersion_generated","versionDependencies","dependenciesWeakMixingAngle_generated","weakMixingAngleDependencies","dependenciesWienDisplacement_generated","wienDisplacementDependencies","dependenciesXor_generated","xorDependencies","allFactoriesAny","allFactories","_interopRequireWildcard","_getRequireWildcardCache","nodeInterop","cacheBabelInterop","cacheNodeInterop","hasPropertyDescriptor","_dependenciesUppercaseEGenerated","_dependenciesInfinityGenerated","_dependenciesLN10Generated","_dependenciesLN2Generated","_dependenciesLOG10EGenerated","_dependenciesLOG2EGenerated","_dependenciesNaNGenerated","_dependenciesUppercasePiGenerated","_dependenciesRangeClassGenerated","_dependenciesSQRT1_2Generated","_dependenciesSQRT2Generated","_dependenciesAcosGenerated","_dependenciesAcoshGenerated","_dependenciesAcotGenerated","_dependenciesAcothGenerated","_dependenciesAcscGenerated","_dependenciesAcschGenerated","_allFactoriesAny","_dependenciesAndGenerated","_dependenciesApplyTransformGenerated","_dependenciesArgGenerated","_dependenciesAsecGenerated","_dependenciesAsechGenerated","_dependenciesAsinGenerated","_dependenciesAsinhGenerated","_dependenciesAtan2Generated","_dependenciesAtanhGenerated","_dependenciesAtomicMassGenerated","_dependenciesAvogadroGenerated","_dependenciesBellNumbersGenerated","_dependenciesBinGenerated","_dependenciesBitAndGenerated","_dependenciesBitNotGenerated","_dependenciesBitOrGenerated","_dependenciesBitXorGenerated","_dependenciesBohrMagnetonGenerated","_dependenciesBohrRadiusGenerated","_dependenciesBoltzmannGenerated","_dependenciesBooleanGenerated","_dependenciesCatalanGenerated","_dependenciesChainGenerated","_dependenciesClassicalElectronRadiusGenerated","_dependenciesCloneGenerated","_dependenciesColumnTransformGenerated","_dependenciesCombinationsWithRepGenerated","_dependenciesCompileGenerated","_dependenciesCompositionGenerated","_dependenciesConcatTransformGenerated","_dependenciesConductanceQuantumGenerated","_dependenciesCoshGenerated","_dependenciesCotGenerated","_dependenciesCothGenerated","_dependenciesCoulombGenerated","_dependenciesCountGenerated","_dependenciesCreateUnitGenerated","_dependenciesCrossGenerated","_dependenciesCscGenerated","_dependenciesCschGenerated","_dependenciesCubeGenerated","_dependenciesCumSumGenerated","_dependenciesCumSumTransformGenerated","_dependenciesDerivativeGenerated","_dependenciesDeuteronMassGenerated","_dependenciesDiffGenerated","_dependenciesDiffTransformGenerated","_dependenciesDistanceGenerated","_dependenciesDotMultiplyGenerated","_dependenciesDotPowGenerated","_dependenciesEfimovFactorGenerated","_dependenciesElectricConstantGenerated","_dependenciesElectronMassGenerated","_dependenciesElementaryChargeGenerated","_dependenciesEqualTextGenerated","_dependenciesErfGenerated","_dependenciesExpm1Generated","_dependenciesExpmGenerated","_dependenciesFalseGenerated","_dependenciesFaradayGenerated","_dependenciesFermiCouplingGenerated","_dependenciesFilterGenerated","_dependenciesFilterTransformGenerated","_dependenciesFineStructureGenerated","_dependenciesFirstRadiationGenerated","_dependenciesForEachGenerated","_dependenciesForEachTransformGenerated","_dependenciesGasConstantGenerated","_dependenciesGcdGenerated","_dependenciesGetMatrixDataTypeGenerated","_dependenciesGravitationConstantGenerated","_dependenciesGravityGenerated","_dependenciesHartreeEnergyGenerated","_dependenciesHasNumericValueGenerated","_dependenciesHelpGenerated","_dependenciesHexGenerated","_dependenciesHypotGenerated","_dependenciesIfftGenerated","_dependenciesIndexTransformGenerated","_dependenciesIntersectGenerated","_dependenciesInverseConductanceQuantumGenerated","_dependenciesInvmodGenerated","_dependenciesIsPrimeGenerated","_dependenciesKldivergenceGenerated","_dependenciesKlitzingGenerated","_dependenciesKronGenerated","_dependenciesLcmGenerated","_dependenciesLeafCountGenerated","_dependenciesLeftShiftGenerated","_dependenciesLgammaGenerated","_dependenciesLog10Generated","_dependenciesLog1pGenerated","_dependenciesLoschmidtGenerated","_dependenciesLsolveAllGenerated","_dependenciesLyapGenerated","_dependenciesMadGenerated","_dependenciesMagneticConstantGenerated","_dependenciesMagneticFluxQuantumGenerated","_dependenciesMapTransformGenerated","_dependenciesMatrixFromFunctionGenerated","_dependenciesMatrixFromRowsGenerated","_dependenciesMaxTransformGenerated","_dependenciesMeanGenerated","_dependenciesMeanTransformGenerated","_dependenciesMinGenerated","_dependenciesMinTransformGenerated","_dependenciesModeGenerated","_dependenciesMolarMassC12Generated","_dependenciesMolarMassGenerated","_dependenciesMolarPlanckConstantGenerated","_dependenciesMolarVolumeGenerated","_dependenciesMultinomialGenerated","_dependenciesNeutronMassGenerated","_dependenciesNthRootGenerated","_dependenciesNthRootsGenerated","_dependenciesNuclearMagnetonGenerated","_dependenciesNullGenerated","_dependenciesOctGenerated","_dependenciesOnesGenerated","_dependenciesOrGenerated","_dependenciesParserGenerated","_dependenciesPermutationsGenerated","_dependenciesPhiGenerated","_dependenciesPickRandomGenerated","_dependenciesPinvGenerated","_dependenciesPlanckChargeGenerated","_dependenciesPlanckConstantGenerated","_dependenciesPlanckLengthGenerated","_dependenciesPlanckMassGenerated","_dependenciesPlanckTemperatureGenerated","_dependenciesPlanckTimeGenerated","_dependenciesPolynomialRootGenerated","_dependenciesPrintGenerated","_dependenciesProtonMassGenerated","_dependenciesQuantileSeqGenerated","_dependenciesQuantumOfCirculationGenerated","_dependenciesRandomGenerated","_dependenciesRandomIntGenerated","_dependenciesRangeTransformGenerated","_dependenciesRationalizeGenerated","_dependenciesReducedPlanckConstantGenerated","_dependenciesReplacerGenerated","_dependenciesReshapeGenerated","_dependenciesResizeGenerated","_dependenciesReviverGenerated","_dependenciesRightArithShiftGenerated","_dependenciesRightLogShiftGenerated","_dependenciesRotateGenerated","_dependenciesRowGenerated","_dependenciesRowTransformGenerated","_dependenciesRydbergGenerated","_dependenciesSackurTetrodeGenerated","_dependenciesSecGenerated","_dependenciesSechGenerated","_dependenciesSecondRadiationGenerated","_dependenciesSetCartesianGenerated","_dependenciesSetDistinctGenerated","_dependenciesSetIsSubsetGenerated","_dependenciesSetMultiplicityGenerated","_dependenciesSetPowersetGenerated","_dependenciesSetSizeGenerated","_dependenciesSetUnionGenerated","_dependenciesSinhGenerated","_dependenciesSortGenerated","_dependenciesSparseGenerated","_dependenciesSpeedOfLightGenerated","_dependenciesSplitUnitGenerated","_dependenciesSqrtmGenerated","_dependenciesSquareGenerated","_dependenciesSqueezeGenerated","_dependenciesStdGenerated","_dependenciesStdTransformGenerated","_dependenciesStefanBoltzmannGenerated","_dependenciesStringGenerated","_dependenciesSubsetTransformGenerated","_dependenciesSumTransformGenerated","_dependenciesSymbolicEqualGenerated","_dependenciesTanGenerated","_dependenciesTanhGenerated","_dependenciesThomsonCrossSectionGenerated","_dependenciesToGenerated","_dependenciesTraceGenerated","_dependenciesTrueGenerated","_dependenciesUnequalGenerated","_dependenciesUnitFunctionGenerated","_dependenciesVacuumImpedanceGenerated","_dependenciesVarianceTransformGenerated","_dependenciesVersionGenerated","_dependenciesWeakMixingAngleGenerated","_dependenciesWienDisplacementGenerated","_dependenciesXorGenerated","require$$282","require$$283","require$$284","require$$285","require$$286","require$$287","require$$288","require$$289","require$$290","require$$291","require$$292","require$$293","require$$294","require$$295","require$$296","require$$297","require$$298","require$$299","require$$300","require$$301","require$$302","require$$303","require$$304","require$$305","require$$306","require$$307","require$$308","require$$309","require$$310","require$$311","require$$312","require$$313","require$$314","require$$315","require$$316","require$$317","require$$318","require$$319","require$$320","require$$321","require$$322","require$$323","require$$324","require$$325","require$$326","require$$327","require$$328","require$$329","require$$330","require$$331","require$$332","require$$333","require$$334","require$$335","require$$336","require$$337","require$$338","require$$339","require$$340","require$$341","require$$342","require$$343","require$$344","require$$345","require$$346","require$$347","require$$348","require$$349","emitter","mixin","_tinyEmitter","importFactory","load","importedFactories","mathImport","functions","flattenImports","flatValues","flatName","isTransformFunctionFactory","_importFactory","isSupportedType","_wrap","hasTypedFunctionSignature","_importTransform","allowedInExpressions","_deleteTransform","wrapper","namespace","existingTransform","existing","factoryAllowedInExpressions","unsafe","create_1","configInternal","legacyFactories","legacyInstances","firstProperty","lazyTyped","internalImport","_exportNames","_impureFunctionsAnyGenerated","_typeChecks","_dependenciesAnyGenerated","_mainAny","NodeType","operator","functionName","allowUnaryMinus","Type","NodeCreator","coeff","explicitCoeff","term","radicandNode","rootNode","Creator","evaluate_1","Term$3","Term","baseNodeFunc","onlyImplicitMultiplication","defaultOne","baseNode","coeffNode","nonCoefficientTerm","denominatorNode","numeratorNode","numeratorConstantNode","termNode","negativeCoefficient","numeratorValue","Term_1","PolynomialTerm","PolynomialTerm_1","Negative","denominatorValue","polyNode","naive","newCoeff","oldCoeff","Negative_1","NodeCustomType","isTypeFunc","allowParens","moveUnaryMinus","newNumerator","CustomType","isMixedNumber","numeratorFirstArg","numeratorSecondArg","isNegativeMixedNumber","getWholeNumberValue","wholeNumberNode","getNumeratorValue","getDenominatorValue","MixedNumber","NthRootTerm","NthRootTerm_1","Status$3","changeType","oldNode","substeps","Status","change","defaultChangeGroup","steps","childStatus","childArgIndex","updateSubsteps","Status_1","canAddLikeTermNodes","termSubclass","termList","firstTerm","sharedBase","sharedExponentNode","haveSameBase","haveSameExponent","canAddLikeTermNthRootNodes","canAddLikeTermPolynomialNodes","canAddLikeTerms","resolvesToConstant","resolvesToConstant_1","canFindRoots","equation","zeroRightSide","isMulOrPower","canFindRoots_1","getBaseNode","getExponentNode","isConstantOrConstantPower","ConstantOrConstantPower","ConstantOrPowerTerm","canMultiplyLikeTermConstantNodes","constantTermBaseList","canMultiplyLikeTermConstantNodes_1","canMultiplyLikeTermPolynomialNodes","polynomialTermList","polyTerm","canMultiplyLikeTermPolynomialNodes_1","ConstantFactors","bound","quotient","ConstantFactors_1","flattenOperands","constNode","parentOp","flattenSupportedOperation","flattenedNode","flattenedFn","flattenedArg","operands","getOperands","hasMultiplicationBesideDivision","isPolynomialTermMultiplication","maybeFlattenPolynomialTerm","flattenDivision","secondOperand","negativeSecondOperand","lastOperand","nextOperand","divisionNode","flattenOperands_1","printAscii","showPlusMinus","printTreeTraversal","parentNode","coeffTerm","coeffStr","nonCoeffTerm","nonCoeffStr","opString","printLatex","nodeTex","getRadicandNode","nthRootExponent","nthRootMultiplication","nthRootConstant","getRootNode","exponentNode","rootValue","exponentValue","newRootValue","newRootNode","newExponentValue","newExponentNode","status","factorMultiplicands","groupTermsByRoot","convertMultiplicationToExponent","distributeNthRoot","evaluateNthRootForChildren","combineRoots","factored","polyTermNoCoeff","factorNodes","getFactorNodes","sortNodes","termStrings","argString","newTerms","leftover","times","remainder","newBase","isMultiplicationOfEqualNodes","grandChild","childNodeStatus","radicandArgs","radicandValue","nthRootValue","roundedNthRootValue","nodeStatus","nthRoot_1","NthRoot","canMultiplyLikeTermsNthRoots","canMultiplyLikeTermsNthRoots_1","canRearrangeCoefficient","canRearrangeCoefficient_1","canSimplifyPolynomialTerms","canSimplifyPolynomialTerms_1","hasUnsupportedNodes","hasUnsupportedNodes_1","Symbols","leftSymbols","rightSymbols","symbolName","isSymbolTerm","isPolynomialTermWithSymbol","hasDenominatorSymbol","Symbols_1","isQuadratic","secondDegreeTerms","isPolynomialTermOfDegree","firstDegreeTerms","isQuadratic_1","checks","FACTOR_FUNCTIONS","factorSymbol","factorDifferenceOfSquares","factorPerfectSquare","factorSumProductRule","factorQuadratic","aValue","bValue","cValue","gcdNode","aNode","bNode","factoredNode","paren","aRootValue","cRootValue","aRootNode","cRootNode","firstParen","secondParen","perfectProduct","factorPairs","pair","ax2","bx","pValue","qValue","qx","secondTerm","ux","rx","firstFactoredGroup","vValue","secondFactoredGroup","factorQuadratic_1","Util","dict","Util_1","CONSTANT","CONSTANT_FRACTION","NTH_ROOT","OTHER","LikeTermCollector","terms","getTermsForCollectingAddition","getTermsForCollectingMultiplication","termTypes","filteredTermTypes","termTypesSorted","sortTerms","newOperands","changeGroup","termType","termsOfType","singleTerm","getTermName","termName","addToTermsforPolynomialMultiplication","addToTermsforNthRootMultiplication","rootNodeValue","coefficient","termWithoutCoefficient","symbA","expA","symbB","expB","LikeTermCollector_1","removeUnnecessaryParens","removeUnnecessaryParensSearch","removeUnnecessaryParensInOperatorNode","removeUnnecessaryParensInFunctionNode","removeUnnecessaryParensInParenthesisNode","canCollectOrCombine","removeUnnecessaryParens_1","stepThrough","stepThrough_1","factorString","expressionString","TreeSearch","simplificationFunction","preOrder","TreeSearch_1","evaluatedValue","evaluateAndRound","arithmeticSearch","convertMixedNumberToImproperFraction","wholeNumber","convertToUnsimplifiedImproperFraction","simplifyMultiplicationInImproperFraction","simplifyAdditionInImproperFraction","newNumeratorMultiplication","newDenominator","convertMixedNumberToImproperFraction_1","rearrangeCoefficient","rearrangeCoefficient_1","reduceExponentByZero","reduceExponentByZero_1","reduceMultiplicationByZero","reduceMultiplicationByZero_1","reduceZeroDividedByAnything","reduceZeroDividedByAnything_1","removeAdditionOfZero","zeroIndex","removeAdditionOfZero_1","removeDivisionByOne","removeDivisionByOne_1","removeExponentBaseOne","removeExponentBaseOne_1","removeExponentByOne","removeExponentByOne_1","removeMultiplicationByNegativeOne","minusOneIndex","nodeToCombineIndex","nodeToCombine","removeMultiplicationByNegativeOne_1","removeMultiplicationByOne","oneIndex","removeMultiplicationByOne_1","simplifyDoubleUnaryMinus","unaryArg","parenthesisContent","simplifyDoubleUnaryMinus_1","SIMPLIFICATION_FUNCTIONS","basics","basicsSearch","breakUpNumerator","fractionList","breakUpNumeratorSearch","divideByGCD","findGCD","cancelGCD","intermediateNumerator","intermediateDenominator","newNumeratorNode","newDenominatorNode","divideByGCD_1","addConstantFractions","denominators","makeCommonDenominator","evaluateDenominators","evaluateNumerators","combineNumeratorsAboveCommonDenominator","addNumeratorsTogether","reduceNumerator","commonDenominator","numeratorArgs","missingFactor","missingFactorNode","newDeominator","addConstantFractions_1","addConstantAndFraction","firstArg","secondArg","fractionNode","newConstNode","newFractionNode","constNodeValue","dividedValue","addFractionStatus","evalNode","lastStep","addConstantAndFraction_1","evaluateConstantSum","summingFunctions","groupConstantsAndFractions","fractions","constantList","evaluateStatus","evaluateConstantSum_1","addLikeTerms","polynomialOnly","addLikePolynomialTerms","addLikeNthRootTerms","addLikeTermNodes","addPositiveOneCoefficient","addNegativeOneCoefficient","groupCoefficientsForAdding","evaluateCoefficientSum","coefficientList","sumOfCoefficents","coefficientSum","addLikeTerms_1","multiplyFractions","atLeastOneFraction","hasPolynomialTerms","hasPolynomialInDenominatorTerms","hasPolynomialInDenominator","denominatorArgs","multiplyFractionsSearch","multiplyLikeTerms","multiplyPolynomialTerms","multiplyNthRoots","radicands","newRadicandNode","addOneExponent","collectConstantExponents","collectPolynomialExponents","exponentSum","sumStatus","exponentNodeList","newExponent","symbolNode","multiplyLikeTerms_1","termCollectorFunctions","collectAndCombineLikeTerms","collectAndCombineOperation","combineSteps","combineLikeTerms","collectAndCombineSearch","distribute","distributeUnaryMinus","distributeAndSimplifyMultiplication","expandBase","expandedBase","expandedNode","unaryContent","newArg","isParenthesisOfAddition","combinedNode","distributeTwoNodes","simplifyWithParens","firstNode","secondNode","firstArgs","secondArgs","hasFraction","firstArgsHasFraction","fractionNodes","nonFractionTerm","rightArg","simplifyFunctions","distributeSearch","division","multiplyByInverse","simplifyDivisionChain","inverseNumerator","inverseDenominator","inverseFraction","denominatorList","getDenominatorList","divisionSearch","CancelOutStatus","hasChanged","cancelLikeTerms","isMultiplicationOfTerms","cancelStatus","cancelTerms","numeratorExponent","denominatorExponent","numeratorTerm","denominatorTerm","cancelCoeffs","frac","reduceStatus","denominatorCoeff","denominatorVariable","numeratorCoeff","numeratorVariable","newDenominatorCoeff","cancelLikeTerms_1","simplifySigns","oldFraction","simplifyFractionSigns","simplifyPolynomialFraction","coefficientSimplifications","coefficientFraction","newCoeffStatus","simplifyPolynomialFraction_1","simplifyFractions","fractionsSearch","absoluteValue","argument","absoluteValue_1","FUNCTIONS","functionsSearch","originalExpressionStr","MAX_STEP_COUNT","iters","logSteps","removeUnnecessaryParensInStep","simplificationTreeSearches","substep","simplifyExpressionString","exprNode","simplifyExpression","printNode","Equation$3","Equation","leftNode","comparator","leftSide","rightSide","newLeft","newRight","sides","Equation_1","oldEquation","newEquation","leftStep","rightStep","EquationStatus","COMPARATOR_TO_INVERSE","EquationOperations","leftSideSymbolTerm","rightSideSymbolTerm","performTermOperationOnEquation","symbolTerm","inverseOp","inverseTerm","nonSymbolTerm","leftTerm","rightTerm","performTermOperationOnExpression","EquationOperations_1","simplifyExpressionNode","COMPARATOR_TO_FUNCTION","symbolSet","solveConstantEquation","equationStatus","originalEquationStr","getRootsStatus","addSimplificationSteps","getSolutionsAndSymbol","allSolutions","flattenSolutionsList","factorsWithSymbols","compareFunction","leftValue","rightValue","solveFunctions","leftSimplifySteps","simplifiedLeftNode","leftFactorSteps","leftSubSteps","finalEquation","simplifyStatus","rightSteps","rightSubSteps","solveEquationString","equationString","comparators","solveEquation","printMS","mathsteps","Change","OP_TO_STRING","COMPARATOR_TO_STRING","changeFormatFunctionMap","changeDescription","getChangeNodes","getOldChangeNodes","leftChangeNodeStrings","rightChangeNodeStrings","getNewChangeNodes","nodesToString","duplicates","oldNodes","absNode","newNodes","after","opNode","termNodes","searchFirstNode","searchLastNode","assignVariables","transformNode","frac1","frac2","correctifNodeMathsteps","toTex","aleaExpression","members","nodeClone","toString","expressionLitterale","assignations","assignationsDecimales","aleaVariables","cpt","texNombre2","traverserEtapes","calculer","expressionPrint","stepsExpression","comments","comment","commentStep","plus","texte","texteCorr","aleaEquation","comparatorSearch","resoudreEquation","equationPrint","stepsNewEquation","repetition","changement","oldLeftNode","newLeftNode","oldRightNode","newRightNode","color","stepChange","commentaires","defaultComments","obtenirListeFacteursPremiers","isContentSymbolNode","resoudre","printEquation","newSteps","stepChanges","newEquationComparator","lastEquation","solution","calculateLeftSide","calculateRightSide","thesolution","programmeCalcul","stepProg","nombreChoisi","symbolsOp","namesOp","namesOpInv","symbolsOpInv","debutsPhrase","debutsPhraseInv","nombresAutorises1","nombresAutorises2","nodesInv","phrases","stepsNode","stepsSimplified","stepsInv","stepsSimplifiedInv","phrasesInv","resultatIntermediaire","calculIntermediaire","longueur","choix","symbolOp","nameOp","debutPhrase","debutPhraseInv","stepPrint","nodeSimplifie","nodeSimplifieInv","resultatIntermediaireInv","calculIntermediaireInv","traduireProgrammeCalcul","programme","stepsSolutionDetaillee","ecrireProgrammeCalcul","remonterProgrammeCalcul","stepsSolutionDetailleeInv","appliquerProgrammeCalcul","calculExpression2","factoriser","commentairesExclus","aleaName","names"],"mappings":"0KAEA,IAAAA,GAAiB,CACf,UAAW,YAKX,oBAAqB,sBAKrB,yBAA0B,2BAE1B,gBAAiB,kBAEjB,iBAAkB,mBAElB,gBAAiB,kBAEjB,wBAAyB,0BAEzB,sBAAuB,wBAEvB,mBAAoB,qBAEpB,uBAAwB,yBAExB,yBAA0B,2BAE1B,mCAAoC,qCAEpC,0BAA2B,4BAE3B,qBAAsB,uBAKtB,+BAAgC,iCAEhC,mBAAoB,qBAIpB,2BAA4B,6BAK5B,uBAAwB,yBAExB,qBAAsB,uBAEtB,mBAAoB,qBAEpB,4BAA6B,8BAK7B,oBAAqB,sBAErB,6BAA8B,+BAE9B,sBAAuB,wBAEvB,0BAA2B,4BAK3B,kBAAmB,oBAEnB,eAAgB,iBAEhB,aAAc,eAEd,kBAAmB,oBAEnB,eAAgB,iBAEhB,SAAU,WAEV,WAAY,aAEZ,0CAA2C,4CAE3C,4BAA6B,8BAK7B,cAAe,gBAEf,eAAgB,iBAEhB,mBAAoB,qBAEpB,mBAAoB,qBAEpB,4BAA6B,8BAE7B,6BAA8B,+BAE9B,sBAAuB,wBAEvB,oBAAqB,sBAKrB,mBAAoB,qBAKpB,kBAAmB,oBAEnB,oBAAqB,sBAKrB,WAAY,aAEZ,wBAAyB,0BAEzB,eAAgB,iBAGhB,gBAAiB,kBAIjB,eAAgB,iBAIhB,gBAAiB,kBAEjB,yBAA0B,2BAE1B,YAAa,cAEb,mBAAoB,qBAEpB,mCAAoC,qCAEpC,oBAAqB,sBAErB,8BAA+B,gCAE/B,mBAAoB,qBAEpB,oBAAqB,sBAErB,eAAgB,iBAEhB,cAAe,gBAEf,mBAAoB,qBAKpB,kBAAmB,oBAEnB,uBAAwB,yBAExB,wCAAyC,0CAEzC,oCAAqC,sCAErC,uBAAwB,yBAExB,mBAAoB,qBAEpB,oBAAqB,sBAErB,yBAA0B,2BAE1B,WAAY,aAEZ,WAAY,aAKZ,kBAAmB,oBAEnB,mBAAoB,qBAKpB,cAAe,gBAEf,6BAA8B,+BAE9B,sBAAuB,wBAEvB,wBAAyB,0BAEzB,cAAe,eACjB,iDC9MA,SAASC,EAAuBC,EAAK,CACnC,OAAOA,GAAOA,EAAI,WAAaA,EAAM,CACnC,QAAWA,CACf,CACC,CACDC,EAAA,QAAiBF,EAAwBE,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,8FCL9G,SAASC,GAAW,CAClB,OAAAD,UAAiBC,EAAW,OAAO,OAAS,OAAO,OAAO,OAAS,SAAUC,EAAQ,CACnF,QAASC,EAAI,EAAGA,EAAI,UAAU,OAAQA,IAAK,CACzC,IAAIC,EAAS,UAAUD,CAAC,EACxB,QAASE,KAAOD,EACV,OAAO,UAAU,eAAe,KAAKA,EAAQC,CAAG,IAClDH,EAAOG,CAAG,EAAID,EAAOC,CAAG,EAG7B,CACD,OAAOH,CACX,EAAKF,EAAA,QAAA,WAA4B,GAAMA,EAAO,QAAQ,QAAaA,EAAO,QACjEC,EAAS,MAAM,KAAM,SAAS,CACtC,CACDD,EAAA,QAAiBC,EAAUD,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,yECZhG,OAAO,eAAeM,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAIC,EAAiB,CAGnB,QAAS,MAET,OAAQ,SAER,OAAQ,SAER,UAAW,GAKX,YAAa,GAGb,WAAY,IACd,EACAD,OAAAA,GAAA,eAAyBC,kDCzBzB,SAASC,EAAQC,EAAG,CAClB,0BAEA,OAAQT,EAAA,QAAiBQ,EAAwB,OAAO,QAArB,YAA2C,OAAO,OAAO,UAA1B,SAAqC,SAAUC,EAAG,CAClH,OAAO,OAAOA,CACf,EAAG,SAAUA,EAAG,CACf,OAAOA,GAAmB,OAAO,QAArB,YAA+BA,EAAE,cAAgB,QAAUA,IAAM,OAAO,UAAY,SAAW,OAAOA,CACnH,EAAET,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,QAAUQ,EAAQC,CAAC,CAC5F,CACDT,EAAA,QAAiBQ,EAASR,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,sCCP3FF,GAAyBY,GAC7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAGC,GACVD,GAAA,QAAG,OACCA,GAAA,YAAGE,GACEF,GAAA,iBAAGG,GACRH,GAAA,YAAGI,GACHJ,GAAA,YAAGK,GACLL,GAAA,UAAGM,GACLN,GAAA,QAAGO,GACEP,GAAA,aAAGQ,GACNR,GAAA,UAAGS,GACKT,GAAA,kBAAGU,GACNV,GAAA,eAAGW,GACXX,GAAA,OAAGY,GACIZ,GAAA,cAAGa,GACNb,GAAA,WAAGc,GACHd,GAAA,WAAGe,GACWf,GAAA,yBAAGgB,GACbhB,GAAA,eAAGiB,GACXjB,GAAA,OAAGkB,GACFlB,GAAA,QAAGmB,GACCnB,GAAA,YAAGoB,GACNpB,GAAA,SAAGqB,GACLrB,GAAA,OAAGsB,GACHtB,GAAA,OAAGuB,GACDvB,GAAA,SAAGwB,GACHxB,GAAA,SAAGyB,GACCzB,GAAA,aAAG0B,GACD1B,GAAA,eAAG2B,GACA3B,GAAA,kBAAG4B,GACb5B,GAAA,QAAG6B,GACC7B,GAAA,YAAG8B,GACN9B,GAAA,SAAG+B,GACK/B,GAAA,iBAAGgC,GACRhC,GAAA,YAAGiC,GACAjC,GAAA,eAAGkC,GACTlC,GAAA,SAAGmC,GACCnC,GAAA,aAAGoC,GACJpC,GAAA,YAAGqC,GACRrC,GAAA,OAAGsC,GACAtC,GAAA,UAAGuC,GACNvC,GAAA,OAAGwC,GACjB,IAAIC,GAAWtD,GAAuBuD,EAAwC,EAe9E,SAASlB,GAASmB,EAAG,CACnB,OAAO,OAAOA,GAAM,QACtB,CACA,SAASvC,GAAYuC,EAAG,CACtB,MAAI,CAACA,MAASF,GAAS,SAAYE,CAAC,IAAM,UAAY,OAAOA,EAAE,aAAgB,WACtE,GAELA,EAAE,cAAgB,OAAYF,GAAS,SAAYE,EAAE,YAAY,SAAS,IAAM,UAAYA,EAAE,YAAY,UAAU,cAAgB,IAGpI,OAAOA,EAAE,YAAY,WAAc,YAAcA,EAAE,YAAY,UAAUA,CAAC,IAAM,EAItF,CACA,SAASlC,GAAUkC,EAAG,CACpB,OAAOA,MAASF,GAAS,SAAYE,CAAC,IAAM,UAAY,OAAO,eAAeA,CAAC,EAAE,YAAc,IAAQ,EACzG,CACA,SAAS7B,GAAW6B,EAAG,CACrB,OAAOA,MAASF,GAAS,SAAYE,CAAC,IAAM,UAAY,OAAO,eAAeA,CAAC,EAAE,aAAe,IAAQ,EAC1G,CACA,SAASL,GAAOK,EAAG,CACjB,OAAOA,GAAKA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACzD,CACA,SAASR,GAASQ,EAAG,CACnB,OAAO,OAAOA,GAAM,QACtB,CACA,IAAIC,GAAU,MAAM,QACL5C,GAAA,QAAG4C,GAClB,SAASvB,GAASsB,EAAG,CACnB,OAAOA,GAAKA,EAAE,YAAY,UAAU,WAAa,IAAQ,EAC3D,CAOA,SAASnC,GAAamC,EAAG,CACvB,OAAO,MAAM,QAAQA,CAAC,GAAKtB,GAASsB,CAAC,CACvC,CACA,SAAS9B,GAAc8B,EAAG,CACxB,OAAOA,GAAKA,EAAE,eAAiBA,EAAE,YAAY,UAAU,WAAa,IAAQ,EAC9E,CACA,SAAST,GAAeS,EAAG,CACzB,OAAOA,GAAKA,EAAE,gBAAkBA,EAAE,YAAY,UAAU,WAAa,IAAQ,EAC/E,CACA,SAASd,GAAQc,EAAG,CAClB,OAAOA,GAAKA,EAAE,YAAY,UAAU,UAAY,IAAQ,EAC1D,CACA,SAASxB,GAAQwB,EAAG,CAClB,OAAOA,GAAKA,EAAE,YAAY,UAAU,UAAY,IAAQ,EAC1D,CACA,SAASrC,GAAUqC,EAAG,CACpB,OAAO,OAAOA,GAAM,SACtB,CACA,SAASV,GAAYU,EAAG,CACtB,OAAOA,GAAKA,EAAE,YAAY,UAAU,cAAgB,IAAQ,EAC9D,CACA,SAASzB,GAAOyB,EAAG,CACjB,OAAOA,GAAKA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACzD,CACA,SAAS5B,GAAW4B,EAAG,CACrB,OAAO,OAAOA,GAAM,UACtB,CACA,SAAS/B,GAAO+B,EAAG,CACjB,OAAOA,aAAa,IACtB,CACA,SAASZ,GAASY,EAAG,CACnB,OAAOA,aAAa,MACtB,CACA,SAASlB,GAASkB,EAAG,CACnB,MAAO,CAAC,EAAEA,MAASF,GAAS,SAAYE,CAAC,IAAM,UAAYA,EAAE,cAAgB,QAAU,CAAClC,GAAUkC,CAAC,GAAK,CAAC7B,GAAW6B,CAAC,EACvH,CACA,SAASpB,GAAOoB,EAAG,CACjB,OAAOA,IAAM,IACf,CACA,SAASN,GAAYM,EAAG,CACtB,OAAOA,IAAM,MACf,CACA,SAAS1C,GAAe0C,EAAG,CACzB,OAAOA,GAAKA,EAAE,iBAAmB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACtF,CACA,SAASzC,GAAYyC,EAAG,CACtB,OAAOA,GAAKA,EAAE,cAAgB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACnF,CACA,SAASxC,GAAiBwC,EAAG,CAC3B,OAAOA,GAAKA,EAAE,mBAAqB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACxF,CACA,SAAStC,GAAYsC,EAAG,CACtB,OAAOA,GAAKA,EAAE,cAAgB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACnF,CACA,SAASjC,GAAkBiC,EAAG,CAC5B,OAAOA,GAAKA,EAAE,oBAAsB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACzF,CACA,SAAShC,GAAegC,EAAG,CACzB,OAAOA,GAAKA,EAAE,iBAAmB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACtF,CAYA,SAASJ,GAAUM,EAAM,CACvB,OAAOlC,GAAekC,CAAI,GAAKlB,GAAekB,CAAI,GAAKA,EAAK,KAAK,SAAW,GAAKlC,GAAekC,EAAK,KAAK,CAAC,CAAC,GAAK,MAAM,SAASA,EAAK,EAAE,CACzI,CACA,SAAS7B,GAAyB2B,EAAG,CACnC,OAAOA,GAAKA,EAAE,2BAA6B,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EAChG,CACA,SAAS1B,GAAe0B,EAAG,CACzB,OAAOA,GAAKA,EAAE,iBAAmB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACtF,CACA,SAASvB,GAAYuB,EAAG,CACtB,OAAOA,GAAKA,EAAE,cAAgB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACnF,CACA,SAASrB,GAAOqB,EAAG,CACjB,OAAOA,GAAKA,EAAE,SAAW,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EAC9E,CACA,SAASjB,GAAaiB,EAAG,CACvB,OAAOA,GAAKA,EAAE,eAAiB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACpF,CACA,SAAShB,GAAegB,EAAG,CACzB,OAAOA,GAAKA,EAAE,iBAAmB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACtF,CACA,SAASf,GAAkBe,EAAG,CAC5B,OAAOA,GAAKA,EAAE,oBAAsB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACzF,CACA,SAASb,GAAYa,EAAG,CACtB,OAAOA,GAAKA,EAAE,cAAgB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACnF,CACA,SAASX,GAAiBW,EAAG,CAC3B,OAAOA,GAAKA,EAAE,mBAAqB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACxF,CACA,SAASP,GAAaO,EAAG,CACvB,OAAOA,GAAKA,EAAE,eAAiB,IAAQA,EAAE,YAAY,UAAU,SAAW,IAAQ,EACpF,CACA,SAASpC,GAAQoC,EAAG,CAClB,OAAOA,GAAKA,EAAE,YAAY,UAAU,UAAY,IAAQ,EAC1D,CACA,SAASH,GAAOG,EAAG,CACjB,IAAIG,KAAQL,GAAS,SAAYE,CAAC,EAClC,OAAIG,IAAM,SACJH,IAAM,KAAa,OACnBvC,GAAYuC,CAAC,EAAU,YACvBA,EAAE,aAAeA,EAAE,YAAY,KAAaA,EAAE,YAAY,KACvD,SAGFG,CACT,CCvNA,IAAI3D,GAAyBY,GAC7B,OAAO,eAAegD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAGC,GACfD,GAAA,MAAGE,GACEF,GAAA,WAAGG,GACFH,GAAA,YAAGI,GACCJ,GAAA,gBAAGK,GACZL,GAAA,OAAGM,GACNN,GAAA,IAAGO,GACQP,GAAA,eAAGQ,GACFR,GAAA,gBAAGS,GACdT,GAAA,KAAGU,GACEV,GAAA,UAAGW,GACRX,GAAA,KAAGY,GACIZ,GAAA,YAAGa,GACXb,GAAA,IAAGc,GACEd,GAAA,SAAGe,GACLf,GAAA,OAAGgB,GACjB,IAAItB,GAAWtD,GAAuBuD,EAAwC,EAC1EsB,GAAMC,GAYV,SAAShB,GAAMN,EAAG,CAChB,IAAIuB,KAAWzB,GAAS,SAAYE,CAAC,EAGrC,GAAIuB,IAAS,UAAYA,IAAS,UAAYA,IAAS,WAAavB,IAAM,MAAQA,IAAM,OACtF,OAAOA,EAIT,GAAI,OAAOA,EAAE,OAAU,WACrB,OAAOA,EAAE,QAIX,GAAI,MAAM,QAAQA,CAAC,EACjB,OAAOA,EAAE,IAAI,SAAUwB,EAAO,CAC5B,OAAOlB,GAAMkB,CAAK,CACxB,CAAK,EAEH,GAAIxB,aAAa,KAAM,OAAO,IAAI,KAAKA,EAAE,QAAO,CAAE,EAClD,MAAQqB,GAAI,aAAarB,CAAC,EAAG,OAAOA,EACpC,GAAIA,aAAa,OAAQ,MAAM,IAAI,UAAU,gBAAkBA,CAAC,EAGhE,OAAOe,GAAUf,EAAGM,EAAK,CAC3B,CAQA,SAASS,GAAUX,EAAQqB,EAAU,CACnC,IAAInB,EAAQ,CAAA,EACZ,QAASvD,KAAOqD,EACVQ,GAAeR,EAAQrD,CAAG,IAC5BuD,EAAMvD,CAAG,EAAI0E,EAASrB,EAAOrD,CAAG,CAAC,GAGrC,OAAOuD,CACT,CAQA,SAASI,GAAOgB,EAAGC,EAAG,CACpB,QAASC,KAAQD,EACXf,GAAee,EAAGC,CAAI,IACxBF,EAAEE,CAAI,EAAID,EAAEC,CAAI,GAGpB,OAAOF,CACT,CAQA,SAASnB,GAAWmB,EAAGC,EAAG,CAExB,GAAI,MAAM,QAAQA,CAAC,EACjB,MAAM,IAAI,UAAU,wCAAwC,EAE9D,QAASC,KAAQD,EAGf,GAAIf,GAAee,EAAGC,CAAI,GAAK,EAAEA,KAAQ,OAAO,YAAc,EAAEA,KAAQ,SAAS,WAC/E,GAAID,EAAEC,CAAI,GAAKD,EAAEC,CAAI,EAAE,cAAgB,OACjCF,EAAEE,CAAI,IAAM,SACdF,EAAEE,CAAI,EAAI,IAERF,EAAEE,CAAI,GAAKF,EAAEE,CAAI,EAAE,cAAgB,OACrCrB,GAAWmB,EAAEE,CAAI,EAAGD,EAAEC,CAAI,CAAC,EAE3BF,EAAEE,CAAI,EAAID,EAAEC,CAAI,MAEb,IAAI,MAAM,QAAQD,EAAEC,CAAI,CAAC,EAC9B,MAAM,IAAI,UAAU,wCAAwC,EAE5DF,EAAEE,CAAI,EAAID,EAAEC,CAAI,EAItB,OAAOF,CACT,CASA,SAASjB,GAAgBiB,EAAGC,EAAG,CAC7B,IAAIC,EAAM/E,EAAGgF,EACb,GAAI,MAAM,QAAQH,CAAC,EAAG,CAIpB,GAHI,CAAC,MAAM,QAAQC,CAAC,GAGhBD,EAAE,SAAWC,EAAE,OACjB,MAAO,GAET,IAAK9E,EAAI,EAAGgF,EAAMH,EAAE,OAAQ7E,EAAIgF,EAAKhF,IACnC,GAAI,CAAC4D,GAAgBiB,EAAE7E,CAAC,EAAG8E,EAAE9E,CAAC,CAAC,EAC7B,MAAO,GAGX,MAAO,EACX,KAAS,IAAI,OAAO6E,GAAM,WACtB,OAAOA,IAAMC,EACR,GAAID,aAAa,OAAQ,CAC9B,GAAI,MAAM,QAAQC,CAAC,GAAK,EAAEA,aAAa,QACrC,MAAO,GAET,IAAKC,KAAQF,EAEX,GAAI,EAAEE,KAAQD,IAAM,CAAClB,GAAgBiB,EAAEE,CAAI,EAAGD,EAAEC,CAAI,CAAC,EACnD,MAAO,GAGX,IAAKA,KAAQD,EAEX,GAAI,EAAEC,KAAQF,GACZ,MAAO,GAGX,MAAO,EACX,KACI,QAAOA,IAAMC,EAEjB,CAOA,SAASnB,GAAYsB,EAAc,CACjC,IAAIC,EAAkB,CAAA,EACtB,OAAAC,GAAaF,EAAcC,CAAe,EACnCA,CACT,CAGA,SAASC,GAAaF,EAAcC,EAAiB,CACnD,QAASH,KAAQE,EACf,GAAIlB,GAAekB,EAAcF,CAAI,EAAG,CACtC,IAAIJ,EAAQM,EAAaF,CAAI,KACrB9B,GAAS,SAAY0B,CAAK,IAAM,UAAYA,IAAU,KAC5DQ,GAAaR,EAAOO,CAAe,EAEnCA,EAAgBH,CAAI,EAAIJ,CAE3B,CAEL,CAMA,SAASnB,IAAoB,CAE3B,GAAI,CACF,GAAI,OAAO,eACT,cAAO,eAAe,CAAE,EAAE,IAAK,CAC7B,IAAK,UAAe,CAClB,OAAO,IACR,CACT,CAAO,EACM,EAEb,MAAc,CAAE,CACd,MAAO,EACT,CAWA,SAASS,GAAKV,EAAQwB,EAAMK,EAAe,CACzC,IAAIC,EAAiB,GACjBC,EACJ,OAAO,eAAe/B,EAAQwB,EAAM,CAClC,IAAK,UAAe,CAClB,OAAIM,IACFC,EAASF,EAAa,EACtBC,EAAiB,IAEZC,CACR,EACD,IAAK,SAAaX,EAAO,CACvBW,EAASX,EACTU,EAAiB,EAClB,EACD,aAAc,GACd,WAAY,EAChB,CAAG,CACH,CASA,SAASf,GAASf,EAAQgC,EAAM,CAC9B,GAAIA,GAAQ,OAAOA,GAAS,SAC1B,OAAOjB,GAASf,EAAQgC,EAAK,MAAM,GAAG,CAAC,EAEzC,IAAI3F,EAAM2D,EACV,GAAIgC,EACF,QAASvF,EAAI,EAAGA,EAAIuF,EAAK,OAAQvF,IAAK,CACpC,IAAIE,EAAMqF,EAAKvF,CAAC,EACVE,KAAON,IACXA,EAAIM,CAAG,EAAI,IAEbN,EAAMA,EAAIM,CAAG,CACd,CAEH,OAAON,CACT,CAOA,SAASmE,GAAeR,EAAQiC,EAAU,CACxC,OAAOjC,GAAU,OAAO,eAAe,KAAKA,EAAQiC,CAAQ,CAC9D,CAcA,SAASxB,GAAgBT,EAAQ,CAC/B,OAAOA,GAAU,OAAOA,EAAO,SAAY,UAC7C,CAQA,SAASO,GAAIP,EAAQgC,EAAM,CACzB,GAAI,OAAOA,GAAS,SAClB,OAAIE,GAAOF,CAAI,EACNzB,GAAIP,EAAQgC,EAAK,MAAM,GAAG,CAAC,EAE3BhC,EAAOgC,CAAI,EAItB,QADIG,EAAQnC,EACHvD,EAAI,EAAGA,EAAIuF,EAAK,OAAQvF,IAAK,CACpC,IAAIE,EAAMqF,EAAKvF,CAAC,EAChB0F,EAAQA,EAAQA,EAAMxF,CAAG,EAAI,MAC9B,CACD,OAAOwF,CACT,CAWA,SAASrB,GAAId,EAAQgC,EAAMZ,EAAO,CAChC,GAAI,OAAOY,GAAS,SAClB,OAAIE,GAAOF,CAAI,EACNlB,GAAId,EAAQgC,EAAK,MAAM,GAAG,EAAGZ,CAAK,GAEzCpB,EAAOgC,CAAI,EAAIZ,EACRpB,GAIX,QADImC,EAAQnC,EACHvD,EAAI,EAAGA,EAAIuF,EAAK,OAAS,EAAGvF,IAAK,CACxC,IAAIE,EAAMqF,EAAKvF,CAAC,EACZ0F,EAAMxF,CAAG,IAAM,SACjBwF,EAAMxF,CAAG,EAAI,IAEfwF,EAAQA,EAAMxF,CAAG,CAClB,CACD,GAAIqF,EAAK,OAAS,EAAG,CACnB,IAAII,EAAUJ,EAAKA,EAAK,OAAS,CAAC,EAClCG,EAAMC,CAAO,EAAIhB,CAClB,CACD,OAAOpB,CACT,CASA,SAASY,GAAKZ,EAAQqC,EAAYC,EAAW,CAE3C,QADIC,EAAO,CAAA,EACF9F,EAAI,EAAGA,EAAI4F,EAAW,OAAQ5F,IAAK,CAC1C,IAAIE,EAAM0F,EAAW5F,CAAC,EAClB2E,EAAQb,GAAIP,EAAQrD,CAAG,EACvByE,IAAU,QACZN,GAAIyB,EAAM5F,EAAK2F,EAAYA,EAAUlB,EAAOzE,CAAG,EAAIyE,CAAK,CAE3D,CACD,OAAOmB,CACT,CASA,SAAS1B,GAAYb,EAAQqC,EAAY,CAEvC,QADIE,EAAO,CAAA,EACF9F,EAAI,EAAGA,EAAI4F,EAAW,OAAQ5F,IAAK,CAC1C,IAAIE,EAAM0F,EAAW5F,CAAC,EAClB2E,EAAQpB,EAAOrD,CAAG,EAClByE,IAAU,SACZmB,EAAK5F,CAAG,EAAIyE,EAEf,CACD,OAAOmB,CACT,CACA,SAASvB,GAAOhB,EAAQ,CACtB,OAAO,OAAO,KAAKA,CAAM,EAAE,IAAI,SAAUrD,EAAK,CAC5C,OAAOqD,EAAOrD,CAAG,CACrB,CAAG,CACH,CAGA,SAASuF,GAAOM,EAAK,CACnB,OAAOA,EAAI,QAAQ,GAAG,IAAM,EAC9B,2CC1YA,OAAO,eAAe5F,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACDA,GAAA,eAAyBA,GAAA,eAAyB,OAC7BA,GAAA,cAAG6F,EACxB,IAAIC,EAAU1F,GACV2F,EAAWhD,KACXiD,EAAiB,CAAC,SAAU,OAAO,EACjBhG,GAAA,eAAGgG,EACzB,IAAIC,EAAiB,CAAC,SAAU,YAAa,UAAU,EACjCjG,GAAA,eAAGiG,EACzB,SAASJ,EAAc7F,EAAQkG,EAAM,CA2CnC,SAASC,EAAQC,EAAS,CACxB,GAAIA,EAAS,CACX,IAAIC,KAAWP,EAAQ,WAAW9F,EAAQ8F,EAAQ,KAAK,EAGvDQ,EAAeF,EAAS,SAAUJ,CAAc,EAChDM,EAAeF,EAAS,SAAUH,CAAc,KAG5CH,EAAQ,YAAY9F,EAAQoG,CAAO,EACvC,IAAIG,KAAWT,EAAQ,WAAW9F,EAAQ8F,EAAQ,KAAK,EACnDU,KAAcV,EAAQ,WAAWM,EAASN,EAAQ,KAAK,EAG3D,OAAAI,EAAK,SAAUK,EAAMF,EAAMG,CAAO,EAC3BD,CACb,KACM,UAAWT,EAAQ,WAAW9F,EAAQ8F,EAAQ,KAAK,CAEtD,CAGD,OAAAK,EAAQ,eAAiBH,EACzBG,EAAQ,eAAiBF,EAGzB,OAAO,KAAKF,EAAS,cAAc,EAAE,QAAQ,SAAUhG,EAAK,CAC1D,OAAO,eAAeoG,EAASpG,EAAK,CAClC,IAAK,UAAe,CAClB,OAAOC,EAAOD,CAAG,CAClB,EACD,WAAY,GACZ,aAAc,EACpB,CAAK,CACL,CAAG,EACMoG,CACR,CAQD,SAASM,EAASC,EAAOC,EAAM,CAC7B,OAAOD,EAAM,QAAQC,CAAI,IAAM,EAChC,CAQD,SAASL,EAAeF,EAASQ,EAAMxC,EAAQ,CACzCgC,EAAQQ,CAAI,IAAM,QAAa,CAACH,EAASrC,EAAQgC,EAAQQ,CAAI,CAAC,GAEhE,QAAQ,KAAK,2BAA6BR,EAAQQ,CAAI,EAAI,+BAAiCA,EAAO,yBAAgCxC,EAAO,IAAI,SAAUI,EAAO,CAC5J,OAAO,KAAK,UAAUA,CAAK,CAC5B,CAAA,EAAE,KAAK,IAAI,EAAI,GAAG,CAEvB,WCnHA,IAAIhF,GAAyBY,GAC7B,OAAO,eAAeyG,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACaA,GAAA,OAAG,OACjB,IAAIC,GAAYtH,GAAuBuD,GAAA,CAAyC,EAC5EoD,GAAU7B,GAAA,EACVyB,GAAWgB,GAAA,EAEX/G,GAAwB,SAAgBoG,EAAS,CACnD,GAAIA,EACF,MAAM,IAAI,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,CAAuR,EAEzS,OAAO,OAAO,OAAOD,GAAQ,cAAc,CAC7C,EACcU,GAAA,OAAG7G,MACb8G,GAAU,SAAY9G,GAAQmG,GAAQ,eAAgB,CACxD,eAAgBJ,GAAS,eACzB,eAAgBA,GAAS,cAC3B,CAAC,wFCrBA,SAAUiB,EAAQC,EAAS,CACqCvH,EAAiB,QAAAuH,EAAO,CAGzF,GAAGC,GAAO,UAAY,CAEpB,SAASC,GAAK,CACZ,MAAO,EACR,CAED,SAASC,GAAQ,CACf,MAAO,EACR,CAED,SAASC,GAAQ,CAEhB,CAED,MAAMC,EAAqB,oCA0C3B,SAASC,GAAS,CAMhB,SAASC,EAAcxE,EAAG,CACxB,OAAO,OAAOA,GAAM,UAAYA,IAAM,MAAQA,EAAE,cAAgB,MACjE,CAED,MAAMyE,EAAS,CAAC,CACd,KAAM,SACN,KAAM,SAAUzE,EAAG,CACjB,OAAO,OAAOA,GAAM,QACrB,CACP,EAAO,CACD,KAAM,SACN,KAAM,SAAUA,EAAG,CACjB,OAAO,OAAOA,GAAM,QACrB,CACP,EAAO,CACD,KAAM,UACN,KAAM,SAAUA,EAAG,CACjB,OAAO,OAAOA,GAAM,SACrB,CACP,EAAO,CACD,KAAM,WACN,KAAM,SAAUA,EAAG,CACjB,OAAO,OAAOA,GAAM,UACrB,CACP,EAAO,CACD,KAAM,QACN,KAAM,MAAM,OAClB,EAAO,CACD,KAAM,OACN,KAAM,SAAUA,EAAG,CACjB,OAAOA,aAAa,IACrB,CACP,EAAO,CACD,KAAM,SACN,KAAM,SAAUA,EAAG,CACjB,OAAOA,aAAa,MACrB,CACP,EAAO,CACD,KAAM,SACN,KAAMwE,CACZ,EAAO,CACD,KAAM,OACN,KAAM,SAAUxE,EAAG,CACjB,OAAOA,IAAM,IACd,CACP,EAAO,CACD,KAAM,YACN,KAAM,SAAUA,EAAG,CACjB,OAAOA,IAAM,MACd,CACP,CAAK,EACK0E,EAAU,CACd,KAAM,MACN,KAAMP,EACN,MAAO,EACb,EAMI,IAAIQ,EAEAC,EAGAC,EAAe,EAGfC,EAAQ,CACV,YAAa,CACnB,EASI,SAASC,EAASC,EAAU,CAC1B,MAAMzD,GAAOoD,EAAQ,IAAIK,CAAQ,EAEjC,GAAIzD,GACF,OAAOA,GAIT,IAAI0D,GAAU,iBAAmBD,EAAW,IAC5C,MAAMpB,GAAOoB,EAAS,cACtB,IAAIE,GAEJ,IAAKA,MAAaN,EAChB,GAAIM,GAAU,YAAa,IAAKtB,GAAM,CACpCqB,IAAW,mBAAqBC,GAAY,MAC5C,KACD,CAGH,MAAM,IAAI,UAAUD,EAAO,CAC5B,CAgBD,SAASE,EAASC,EAAO,CACvB,IAAIC,GAAa,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,MACrF,MAAMC,GAAcD,GAAaN,EAASM,EAAU,EAAE,MAAQT,EAAS,OACjEW,GAAW,CAAA,EAEjB,QAAS1I,GAAI,EAAGA,GAAIuI,EAAM,OAAQ,EAAEvI,GAAG,CACrC,GAAI,CAACuI,EAAMvI,EAAC,GAAK,OAAOuI,EAAMvI,EAAC,EAAE,MAAS,UAAY,OAAOuI,EAAMvI,EAAC,EAAE,MAAS,WAC7E,MAAM,IAAI,UAAU,gEAAgE,EAGtF,MAAMmI,GAAWI,EAAMvI,EAAC,EAAE,KAE1B,GAAI8H,EAAQ,IAAIK,EAAQ,EACtB,MAAM,IAAI,UAAU,wBAA0BA,GAAW,GAAG,EAG9DO,GAAS,KAAKP,EAAQ,EACtBL,EAAQ,IAAIK,GAAU,CACpB,KAAMA,GACN,KAAMI,EAAMvI,EAAC,EAAE,KACf,MAAOuI,EAAMvI,EAAC,EAAE,MAChB,MAAOyI,GAAczI,GACrB,cAAe,CAAE,CAE3B,CAAS,CACF,CAGD,MAAM2I,GAAgBZ,EAAS,MAAMU,EAAW,EAChDV,EAAWA,EAAS,MAAM,EAAGU,EAAW,EAAE,OAAOC,EAAQ,EAAE,OAAOC,EAAa,EAE/E,QAAS3I,GAAIyI,GAAcC,GAAS,OAAQ1I,GAAI+H,EAAS,OAAQ,EAAE/H,GACjE8H,EAAQ,IAAIC,EAAS/H,EAAC,CAAC,EAAE,MAAQA,EAEpC,CASD,SAAS4I,GAAQ,CACfd,EAAU,IAAI,IACdC,EAAW,CAAA,EACXC,EAAe,EACfM,EAAS,CAACT,CAAO,EAAG,EAAK,CAC1B,CAGDe,IACAN,EAASV,CAAM,EAKf,SAASiB,GAAmB,CAC1B,IAAIV,EAEJ,IAAKA,KAAYJ,EACfD,EAAQ,IAAIK,CAAQ,EAAE,cAAgB,CAAA,EAGxCH,EAAe,CAChB,CASD,SAASc,EAAcnE,EAAO,CAC5B,MAAMoE,GAAUhB,EAAS,OAAOhB,IAAQ,CACtC,MAAMrC,GAAOoD,EAAQ,IAAIf,EAAI,EAC7B,MAAO,CAACrC,GAAK,OAASA,GAAK,KAAKC,CAAK,CAC7C,CAAO,EAED,OAAIoE,GAAQ,OACHA,GAGF,CAAC,KAAK,CACd,CAQD,SAASC,EAAgBC,EAAQ,CAC/B,OAAOA,GAAU,OAAOA,GAAW,YAAc,uBAAwBA,CAC1E,CAqCD,SAASC,EAAcC,EAAIC,GAAW7C,GAAS,CAC7C,GAAI,CAACyC,EAAgBG,CAAE,EACrB,MAAM,IAAI,UAAU1B,CAAkB,EAIxC,MAAM4B,GAAQ9C,IAAWA,GAAQ,MAC3B+C,GAAkB,MAAM,QAAQF,EAAS,EAAIA,GAAU,KAAK,GAAG,EAAIA,GACnEG,GAASC,EAAeF,EAAe,EACvCG,GAAqBC,EAAgBH,EAAM,EAEjD,GAAI,CAACF,IAASI,MAAsBN,EAAG,WAAY,CAEjD,MAAMQ,GAAQR,EAAG,mBAAmB,aAAa,IAAIM,EAAkB,EAEvE,GAAIE,GACF,OAAOA,EAEV,CAMD,MAAMC,EAAUL,GAAO,OACvB,IAAIM,EAEJ,GAAIR,GAAO,CACTQ,EAAsB,CAAA,EACtB,IAAI9C,GAEJ,IAAKA,MAAQoC,EAAG,WACdU,EAAoB,KAAKV,EAAG,mBAAmB,aAAa,IAAIpC,EAAI,CAAC,CAE/E,MACQ8C,EAAsBV,EAAG,mBAAmB,WAG9C,QAASnJ,GAAI,EAAGA,GAAI4J,EAAS,EAAE5J,GAAG,CAChC,MAAM8J,GAAOP,GAAOvJ,EAAC,EACf+J,GAAqB,CAAA,EAC3B,IAAIC,GAEJ,IAAKA,MAAeH,EAAqB,CACvC,MAAMI,GAAOC,EAAgBF,GAAY,OAAQhK,EAAC,EAElD,GAAI,GAACiK,IAAQH,GAAK,WAAa,CAACG,GAAK,WAIrC,IAAI,CAACA,GAAK,OAAQ,CAEhB,MAAME,GAAYC,EAAaH,EAAI,EAEnC,GAAIH,GAAK,MAAM,KAAKO,IAAS,CAACF,GAAU,IAAIE,GAAM,IAAI,CAAC,EACrD,QAEH,CAGDN,GAAmB,KAAKC,EAAW,EACpC,CAGD,GADAH,EAAsBE,GAClBF,EAAoB,SAAW,EAAG,KACvC,CAGD,IAAIS,GAEJ,IAAKA,MAAaT,EAChB,GAAIS,GAAU,OAAO,QAAUV,EAC7B,OAAOU,GAIX,MAAM,IAAI,UAAU,oCAAsCnB,EAAG,MAAQ,WAAa,IAAMO,EAAgBH,GAAQ,IAAI,EAAI,IAAI,CAC7H,CA6BD,SAASgB,EAAKpB,EAAIC,GAAW7C,GAAS,CACpC,OAAO2C,EAAcC,EAAIC,GAAW7C,EAAO,EAAE,cAC9C,CASD,SAASiE,EAAQ7F,EAAOwD,GAAU,CAEhC,MAAMzD,GAAOwD,EAASC,EAAQ,EAE9B,GAAIzD,GAAK,KAAKC,CAAK,EACjB,OAAOA,EAGT,MAAM8F,GAAc/F,GAAK,cAEzB,GAAI+F,GAAY,SAAW,EACzB,MAAM,IAAI,MAAM,+BAAiCtC,GAAW,WAAW,EAGzE,QAASnI,GAAI,EAAGA,GAAIyK,GAAY,OAAQzK,KAGtC,GAFiBkI,EAASuC,GAAYzK,EAAC,EAAE,IAAI,EAEhC,KAAK2E,CAAK,EACrB,OAAO8F,GAAYzK,EAAC,EAAE,QAAQ2E,CAAK,EAIvC,MAAM,IAAI,MAAM,kBAAoBA,EAAQ,OAASwD,EAAQ,CAC9D,CASD,SAASuB,EAAgBH,EAAQ,CAC/B,IAAImB,GAAY,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,IACpF,OAAOnB,EAAO,IAAIoB,IAAKA,GAAE,IAAI,EAAE,KAAKD,EAAS,CAC9C,CAQD,SAASE,EAAWC,EAAO,CACzB,MAAMC,GAAYD,EAAM,QAAQ,KAAK,IAAM,EAErCE,IADSD,GAAoBD,EAAM,OAAS,EAAIA,EAAM,MAAM,CAAC,EAAI,MAA5CA,GACJ,MAAM,GAAG,EAAE,IAAIG,GAAK9C,EAAS8C,EAAE,KAAI,CAAE,CAAC,EAC7D,IAAIC,GAAS,GACTC,GAAYJ,GAAY,MAAQ,GAapC,MAAO,CACL,MAbiBC,GAAS,IAAI,SAAUrG,EAAM,CAC9C,OAAAuG,GAASvG,EAAK,OAASuG,GACvBC,IAAaxG,EAAK,KAAO,IAClB,CACL,KAAMA,EAAK,KACX,UAAWA,EAAK,MAChB,KAAMA,EAAK,KACX,MAAOA,EAAK,MACZ,WAAY,KACZ,gBAAiB,EAC3B,CACA,CAAO,EAGC,KAAMwG,GAAU,MAAM,EAAG,EAAE,EAE3B,OAAAD,GACA,cAAe,GACf,UAAAH,EACR,CACK,CASD,SAASK,EAAYN,EAAO,CAC1B,MAAMO,GAAYP,EAAM,MAAM,IAAIvH,IAAKA,GAAE,IAAI,EACvC+H,GAAsBC,GAAqBF,EAAS,EAC1D,IAAIH,GAASJ,EAAM,OACfU,GAAUV,EAAM,KACpB,MAAMW,GAAmBH,GAAoB,IAAI,SAAUI,GAAY,CACrE,MAAM/G,EAAOwD,EAASuD,GAAW,IAAI,EACrC,OAAAR,GAASvG,EAAK,OAASuG,GACvBM,IAAW,IAAME,GAAW,KACrB,CACL,KAAMA,GAAW,KACjB,UAAW/G,EAAK,MAChB,KAAMA,EAAK,KACX,MAAOA,EAAK,MACZ,WAAA+G,GACA,gBAAiBA,GAAW,KACtC,CACA,CAAO,EACD,MAAO,CACL,MAAOZ,EAAM,MAAM,OAAOW,EAAgB,EAC1C,KAAMD,GACN,OAAAN,GACA,cAAeO,GAAiB,OAAS,EACzC,UAAWX,EAAM,SACzB,CACK,CAUD,SAAST,EAAaS,EAAO,CAC3B,OAAKA,EAAM,UACTA,EAAM,QAAU,IAAI,IACpBA,EAAM,MAAM,QAAQnG,IAAQmG,EAAM,QAAQ,IAAInG,GAAK,IAAI,CAAC,GAGnDmG,EAAM,OACd,CAUD,SAASrB,EAAekC,EAAc,CACpC,MAAMnC,GAAS,CAAA,EAEf,GAAI,OAAOmC,GAAiB,SAC1B,MAAM,IAAI,UAAU,4BAA4B,EAGlD,MAAMtC,GAAYsC,EAAa,OAE/B,GAAItC,KAAc,GAChB,OAAOG,GAGT,MAAMoC,GAAYvC,GAAU,MAAM,GAAG,EAErC,QAASpJ,GAAI,EAAGA,GAAI2L,GAAU,OAAQ,EAAE3L,GAAG,CACzC,MAAM4L,GAAchB,EAAWe,GAAU3L,EAAC,EAAE,KAAI,CAAE,EAElD,GAAI4L,GAAY,WAAa5L,KAAM2L,GAAU,OAAS,EACpD,MAAM,IAAI,YAAY,8BAAgCA,GAAU3L,EAAC,EAAI,wCAA6C,EAIpH,GAAI4L,GAAY,MAAM,SAAW,EAC/B,OAAO,KAGTrC,GAAO,KAAKqC,EAAW,CACxB,CAED,OAAOrC,EACR,CAQD,SAASsC,EAAatC,EAAQ,CAC5B,MAAMsB,GAAQiB,GAAKvC,CAAM,EACzB,OAAOsB,GAAQA,GAAM,UAAY,EAClC,CASD,SAASkB,EAAYlB,EAAO,CAC1B,GAAI,CAACA,GAASA,EAAM,MAAM,SAAW,EAEnC,OAAOvD,EACF,GAAIuD,EAAM,MAAM,SAAW,EAChC,OAAO3C,EAAS2C,EAAM,MAAM,CAAC,EAAE,IAAI,EAAE,KAChC,GAAIA,EAAM,MAAM,SAAW,EAAG,CACnC,MAAMmB,GAAQ9D,EAAS2C,EAAM,MAAM,CAAC,EAAE,IAAI,EAAE,KACtCoB,GAAQ/D,EAAS2C,EAAM,MAAM,CAAC,EAAE,IAAI,EAAE,KAC5C,OAAO,SAAY1H,GAAG,CACpB,OAAO6I,GAAM7I,EAAC,GAAK8I,GAAM9I,EAAC,CACpC,CACA,KAAa,CAEL,MAAM+I,GAAQrB,EAAM,MAAM,IAAI,SAAUnG,GAAM,CAC5C,OAAOwD,EAASxD,GAAK,IAAI,EAAE,IACrC,CAAS,EACD,OAAO,SAAYvB,GAAG,CACpB,QAASnD,GAAI,EAAGA,GAAIkM,GAAM,OAAQlM,KAChC,GAAIkM,GAAMlM,EAAC,EAAEmD,EAAC,EACZ,MAAO,GAIX,MAAO,EACjB,CACO,CACF,CAQD,SAASgJ,EAAa5C,EAAQ,CAC5B,IAAI2C,GAAOF,GAAOC,GAElB,GAAIJ,EAAatC,CAAM,EAAG,CAExB2C,GAAQE,GAAQ7C,CAAM,EAAE,IAAIwC,CAAW,EACvC,MAAMM,GAAWH,GAAM,OACjBI,GAAWP,EAAYD,GAAKvC,CAAM,CAAC,EAEnCgD,GAAgB,SAAUC,EAAM,CACpC,QAASxM,EAAIqM,GAAUrM,EAAIwM,EAAK,OAAQxM,IACtC,GAAI,CAACsM,GAASE,EAAKxM,CAAC,CAAC,EACnB,MAAO,GAIX,MAAO,EACjB,EAEQ,OAAO,SAAkBwM,EAAM,CAC7B,QAASxM,GAAI,EAAGA,GAAIkM,GAAM,OAAQlM,KAChC,GAAI,CAACkM,GAAMlM,EAAC,EAAEwM,EAAKxM,EAAC,CAAC,EACnB,MAAO,GAIX,OAAOuM,GAAcC,CAAI,GAAKA,EAAK,QAAUH,GAAW,CAClE,CACA,KAEQ,QAAI9C,EAAO,SAAW,EACb,SAAkBiD,GAAM,CAC7B,OAAOA,GAAK,SAAW,CACnC,EACmBjD,EAAO,SAAW,GAC3ByC,GAAQD,EAAYxC,EAAO,CAAC,CAAC,EACtB,SAAkBiD,GAAM,CAC7B,OAAOR,GAAMQ,GAAK,CAAC,CAAC,GAAKA,GAAK,SAAW,CACrD,GACmBjD,EAAO,SAAW,GAC3ByC,GAAQD,EAAYxC,EAAO,CAAC,CAAC,EAC7B0C,GAAQF,EAAYxC,EAAO,CAAC,CAAC,EACtB,SAAkBiD,GAAM,CAC7B,OAAOR,GAAMQ,GAAK,CAAC,CAAC,GAAKP,GAAMO,GAAK,CAAC,CAAC,GAAKA,GAAK,SAAW,CACvE,IAGUN,GAAQ3C,EAAO,IAAIwC,CAAW,EACvB,SAAkBS,GAAM,CAC7B,QAASxM,GAAI,EAAGA,GAAIkM,GAAM,OAAQlM,KAChC,GAAI,CAACkM,GAAMlM,EAAC,EAAEwM,GAAKxM,EAAC,CAAC,EACnB,MAAO,GAIX,OAAOwM,GAAK,SAAWN,GAAM,MACzC,EAGK,CAWD,SAAShC,EAAgBX,EAAQkD,GAAO,CACtC,OAAOA,GAAQlD,EAAO,OAASA,EAAOkD,EAAK,EAAIZ,EAAatC,CAAM,EAAIuC,GAAKvC,CAAM,EAAI,IACtF,CASD,SAASmD,EAAkBnD,EAAQkD,GAAO,CACxC,MAAM5B,GAAQX,EAAgBX,EAAQkD,EAAK,EAE3C,OAAK5B,GAIET,EAAaS,EAAK,EAHhB,IAAI,GAId,CAQD,SAAS8B,EAAYjI,EAAM,CACzB,OAAOA,EAAK,aAAe,MAAQA,EAAK,aAAe,MACxD,CAUD,SAASkI,EAAoBC,EAAYJ,GAAO,CAC9C,MAAMK,GAAU,IAAI,IACpB,OAAAD,EAAW,QAAQzD,IAAa,CAC9B,MAAM2D,GAAWL,EAAkBtD,GAAU,OAAQqD,EAAK,EAC1D,IAAI1F,GAEJ,IAAKA,MAAQgG,GACXD,GAAQ,IAAI/F,EAAI,CAE1B,CAAO,EACM+F,GAAQ,IAAI,KAAK,EAAI,CAAC,KAAK,EAAI,MAAM,KAAKA,EAAO,CACzD,CAWD,SAASE,EAAYjG,EAAMyF,GAAMK,GAAY,CAC3C,IAAII,GAAKC,GAET,MAAMC,GAAQpG,GAAQ,UAGtB,IAAIqG,GAAqBP,GACrBJ,EAEJ,IAAKA,EAAQ,EAAGA,EAAQD,GAAK,OAAQC,IAAS,CAC5C,MAAMY,GAAmB,CAAA,EAUzB,GATAD,GAAmB,QAAQhE,IAAa,CACtC,MAAMyB,GAAQX,EAAgBd,GAAU,OAAQqD,CAAK,EAC/Ca,GAAOvB,EAAYlB,EAAK,GAEzB4B,EAAQrD,GAAU,OAAO,QAAUyC,EAAazC,GAAU,MAAM,IAAMkE,GAAKd,GAAKC,CAAK,CAAC,GACzFY,GAAiB,KAAKjE,EAAS,CAE3C,CAAS,EAEGiE,GAAiB,SAAW,GAI9B,GAFAH,GAAWN,EAAoBQ,GAAoBX,CAAK,EAEpDS,GAAS,OAAS,EAAG,CACvB,MAAMK,GAAczE,EAAc0D,GAAKC,CAAK,CAAC,EAC7C,OAAAQ,GAAM,IAAI,UAAU,2CAA6CE,GAAQ,eAAiBD,GAAS,KAAK,MAAM,EAAI,aAAeK,GAAY,KAAK,KAAK,EAAI,YAAcd,EAAQ,GAAG,EACpLQ,GAAI,KAAO,CACT,SAAU,YACV,GAAIE,GACJ,MAAAV,EACA,OAAQc,GACR,SAAAL,EACd,EACmBD,EACR,OAEDG,GAAqBC,EAExB,CAGD,MAAMG,EAAUJ,GAAmB,IAAI,SAAUhE,GAAW,CAC1D,OAAOyC,EAAazC,GAAU,MAAM,EAAI,IAAWA,GAAU,OAAO,MAC5E,CAAO,EAED,GAAIoD,GAAK,OAAS,KAAK,IAAI,MAAM,KAAMgB,CAAO,EAC5C,OAAAN,GAAWN,EAAoBQ,GAAoBX,CAAK,EACxDQ,GAAM,IAAI,UAAU,iCAAmCE,GAAQ,eAAiBD,GAAS,KAAK,MAAM,EAAI,YAAcV,GAAK,OAAS,GAAG,EACvIS,GAAI,KAAO,CACT,SAAU,aACV,GAAIE,GACJ,MAAOX,GAAK,OACZ,SAAAU,EACV,EACeD,GAIT,MAAMQ,GAAY,KAAK,IAAI,MAAM,KAAMD,CAAO,EAE9C,GAAIhB,GAAK,OAASiB,GAChB,OAAAR,GAAM,IAAI,UAAU,kCAAoCE,GAAQ,eAAiBM,GAAY,aAAejB,GAAK,OAAS,GAAG,EAC7HS,GAAI,KAAO,CACT,SAAU,cACV,GAAIE,GACJ,MAAOX,GAAK,OACZ,eAAgBiB,EAC1B,EACeR,GAIT,MAAMS,GAAW,CAAA,EAEjB,QAAS1N,GAAI,EAAGA,GAAIwM,GAAK,OAAQ,EAAExM,GACjC0N,GAAS,KAAK5E,EAAc0D,GAAKxM,EAAC,CAAC,EAAE,KAAK,GAAG,CAAC,EAGhD,OAAAiN,GAAM,IAAI,UAAU,sBAAwBS,GAAS,KAAK,IAAI,EAAI,4DAA8DP,GAAQ,GAAG,EAC3IF,GAAI,KAAO,CACT,SAAU,WACV,OAAQS,EAChB,EACaT,EACR,CAQD,SAASU,EAAmB9C,EAAO,CACjC,IAAI+C,GAAM7F,EAAS,OAAS,EAE5B,QAAS/H,GAAI,EAAGA,GAAI6K,EAAM,MAAM,OAAQ7K,KAClC2M,EAAY9B,EAAM,MAAM7K,EAAC,CAAC,IAC5B4N,GAAM,KAAK,IAAIA,GAAK/C,EAAM,MAAM7K,EAAC,EAAE,SAAS,GAIhD,OAAO4N,EACR,CASD,SAASC,GAAyBhD,EAAO,CACvC,IAAI+C,GAAM5F,EAAe,EAEzB,QAAShI,GAAI,EAAGA,GAAI6K,EAAM,MAAM,OAAQ7K,KACjC2M,EAAY9B,EAAM,MAAM7K,EAAC,CAAC,IAC7B4N,GAAM,KAAK,IAAIA,GAAK/C,EAAM,MAAM7K,EAAC,EAAE,eAAe,GAItD,OAAO4N,EACR,CAWD,SAASE,EAAcC,EAAQC,GAAQ,CAGrC,GAAID,EAAO,QACT,GAAI,CAACC,GAAO,OACV,MAAO,WAEAA,GAAO,OAChB,MAAO,GAIT,GAAID,EAAO,WACT,GAAI,CAACC,GAAO,UACV,MAAO,WAEAA,GAAO,UAChB,MAAO,GAIT,GAAID,EAAO,eACT,GAAI,CAACC,GAAO,cACV,MAAO,WAEAA,GAAO,cAChB,MAAO,GAIT,MAAMC,GAAWN,EAAmBI,CAAM,EAAIJ,EAAmBK,EAAM,EAEvE,GAAIC,GAAW,EACb,MAAO,GAGT,GAAIA,GAAW,EACb,MAAO,GAIT,MAAMC,GAAWL,GAAyBE,CAAM,EAAIF,GAAyBG,EAAM,EAEnF,OAAIE,GAAW,EACN,GAGLA,GAAW,EACN,EAIF,CACR,CAWD,SAASC,EAAkBC,EAAYC,GAAY,CACjD,MAAMC,GAAQF,EAAW,OACnBG,GAAQF,GAAW,OACnBG,GAAQ1C,GAAKwC,EAAK,EAClBG,GAAQ3C,GAAKyC,EAAK,EAClBG,GAAW7C,EAAayC,EAAK,EAC7BK,EAAW9C,EAAa0C,EAAK,EAGnC,GAAIG,IAAYF,GAAM,QACpB,GAAI,CAACG,GAAY,CAACF,GAAM,OACtB,MAAO,WAEAE,GAAYF,GAAM,OAC3B,MAAO,GAIT,IAAIG,EAAO,EACPC,GAAQ,EACRC,GAEJ,IAAKA,MAAOR,GACNQ,GAAI,QAAQ,EAAEF,EACdE,GAAI,eAAe,EAAED,GAG3B,IAAIE,GAAO,EACPC,GAAQ,EAEZ,IAAKF,MAAOP,GACNO,GAAI,QAAQ,EAAEC,GACdD,GAAI,eAAe,EAAEE,GAG3B,GAAIJ,IAASG,GACX,OAAOH,EAAOG,GAIhB,GAAIL,IAAYF,GAAM,eACpB,GAAI,CAACG,GAAY,CAACF,GAAM,cACtB,MAAO,WAEAE,GAAYF,GAAM,cAC3B,MAAO,GAIT,GAAII,KAAUG,GACZ,OAAOH,GAAQG,GAIjB,GAAIN,IACF,GAAI,CAACC,EACH,MAAO,WAEAA,EACT,MAAO,GAIT,MAAMM,IAAmBX,GAAM,OAASC,GAAM,SAAWG,GAAW,GAAK,GAEzE,GAAIO,KAAoB,EACtB,OAAOA,GAOT,MAAMC,GAAc,CAAA,EACpB,IAAIC,GAAK,EAET,QAASnP,GAAI,EAAGA,GAAIsO,GAAM,OAAQ,EAAEtO,GAAG,CACrC,MAAMoP,GAAiBtB,EAAcQ,GAAMtO,EAAC,EAAGuO,GAAMvO,EAAC,CAAC,EACvDkP,GAAY,KAAKE,EAAc,EAC/BD,IAAMC,EACP,CAED,GAAID,KAAO,EACT,OAAOA,GAOT,IAAIE,GAEJ,IAAKA,MAAKH,GACR,GAAIG,KAAM,EACR,OAAOA,GAKX,MAAO,EACR,CAWD,SAAS/D,GAAqBF,EAAW,CACvC,GAAIA,EAAU,SAAW,EACvB,MAAO,GAGT,MAAM7C,GAAQ6C,EAAU,IAAIlD,CAAQ,EAEhCkD,EAAU,OAAS,GACrB7C,GAAM,KAAK,CAAC+G,GAAIC,KAAOD,GAAG,MAAQC,GAAG,KAAK,EAG5C,IAAIxG,GAAUR,GAAM,CAAC,EAAE,cAEvB,GAAI6C,EAAU,SAAW,EACvB,OAAOrC,GAGTA,GAAUA,GAAQ,OAAO,CAAA,CAAE,EAI3B,MAAMyG,GAAa,IAAI,IAAIpE,CAAS,EAEpC,QAASpL,GAAI,EAAGA,GAAIuI,GAAM,OAAQ,EAAEvI,GAAG,CACrC,IAAIyP,GAEJ,IAAKA,MAAYlH,GAAMvI,EAAC,EAAE,cACnBwP,GAAW,IAAIC,GAAS,IAAI,IAC/B1G,GAAQ,KAAK0G,EAAQ,EACrBD,GAAW,IAAIC,GAAS,IAAI,EAGjC,CAED,OAAO1G,EACR,CAWD,SAAS2G,GAAyBnG,EAAQJ,GAAI,CAC5C,IAAIwG,GAAYxG,GAEhB,GAAII,EAAO,KAAKoB,IAAKA,GAAE,aAAa,EAAG,CACrC,MAAMG,GAAYe,EAAatC,CAAM,EAC/BqG,GAAsBrG,EAAO,IAAIsG,EAAoB,EAE3DF,GAAY,UAAuB,CACjC,MAAMnD,EAAO,CAAA,EACPV,EAAOhB,GAAY,UAAU,OAAS,EAAI,UAAU,OAE1D,QAAS9K,GAAI,EAAGA,GAAI8L,EAAM9L,KACxBwM,EAAKxM,EAAC,EAAI4P,GAAoB5P,EAAC,EAAE,UAAUA,EAAC,CAAC,EAG/C,OAAI8K,KACF0B,EAAKV,CAAI,EAAI,UAAUA,CAAI,EAAE,IAAI8D,GAAoB9D,CAAI,CAAC,GAGrD3C,GAAG,MAAM,KAAMqD,CAAI,CACpC,CACO,CAED,IAAIsD,GAAeH,GAEnB,GAAI9D,EAAatC,CAAM,EAAG,CACxB,MAAMwG,GAASxG,EAAO,OAAS,EAE/BuG,GAAe,UAAgC,CAC7C,OAAOH,GAAU,MAAM,KAAMK,GAAM,UAAW,EAAGD,EAAM,EAAE,OAAO,CAACC,GAAM,UAAWD,EAAM,CAAC,CAAC,CAAC,CACrG,CACO,CAED,OAAOD,EACR,CASD,SAASD,GAAqBhF,EAAO,CACnC,IAAImB,GAAOC,GAAOgE,GAAaC,GAC/B,MAAMhE,GAAQ,CAAA,EACRzB,GAAc,CAAA,EAQpB,OAPAI,EAAM,MAAM,QAAQ,SAAUnG,EAAM,CAC9BA,EAAK,aACPwH,GAAM,KAAKhE,EAASxD,EAAK,WAAW,IAAI,EAAE,IAAI,EAC9C+F,GAAY,KAAK/F,EAAK,WAAW,OAAO,EAElD,CAAO,EAEO+F,GAAY,OAAM,CACxB,IAAK,GACH,OAAO,SAAoB0F,EAAK,CAC9B,OAAOA,CACnB,EAEQ,IAAK,GACH,OAAAnE,GAAQE,GAAM,CAAC,EACf+D,GAAcxF,GAAY,CAAC,EACpB,SAAoB0F,EAAK,CAC9B,OAAInE,GAAMmE,CAAG,EACJF,GAAYE,CAAG,EAGjBA,CACnB,EAEQ,IAAK,GACH,OAAAnE,GAAQE,GAAM,CAAC,EACfD,GAAQC,GAAM,CAAC,EACf+D,GAAcxF,GAAY,CAAC,EAC3ByF,GAAczF,GAAY,CAAC,EACpB,SAAoB0F,EAAK,CAC9B,OAAInE,GAAMmE,CAAG,EACJF,GAAYE,CAAG,EAGpBlE,GAAMkE,CAAG,EACJD,GAAYC,CAAG,EAGjBA,CACnB,EAEQ,QACE,OAAO,SAAoBA,EAAK,CAC9B,QAASnQ,GAAI,EAAGA,GAAIyK,GAAY,OAAQzK,KACtC,GAAIkM,GAAMlM,EAAC,EAAEmQ,CAAG,EACd,OAAO1F,GAAYzK,EAAC,EAAEmQ,CAAG,EAI7B,OAAOA,CACnB,CACO,CACF,CAoBD,SAASC,GAAY7G,EAAQ,CAC3B,SAAS8G,GAAa9G,GAAQkD,GAAO6D,GAAa,CAChD,GAAI7D,GAAQlD,GAAO,OAAQ,CACzB,MAAMsB,GAAQtB,GAAOkD,EAAK,EAC1B,IAAI8D,GAAkB,CAAA,EAEtB,GAAI1F,GAAM,UAAW,CAGnB,MAAM2F,EAAa3F,GAAM,MAAM,OAAO8B,CAAW,EAE7C6D,EAAW,OAAS3F,GAAM,MAAM,QAClC0F,GAAgB,KAAK,CACnB,MAAOC,EACP,KAAM,MAAQA,EAAW,IAAIlN,GAAKA,EAAE,IAAI,EAAE,KAAK,GAAG,EAClD,OAAQkN,EAAW,KAAKlN,GAAKA,EAAE,KAAK,EACpC,cAAe,GACf,UAAW,EAC3B,CAAe,EAGHiN,GAAgB,KAAK1F,EAAK,CACtC,MAEY0F,GAAkB1F,GAAM,MAAM,IAAI,SAAUnG,EAAM,CAChD,MAAO,CACL,MAAO,CAACA,CAAI,EACZ,KAAMA,EAAK,KACX,OAAQA,EAAK,MACb,cAAeA,EAAK,WACpB,UAAW,EAC3B,CACA,CAAa,EAIH,OAAO+L,GAAQF,GAAiB,SAAUG,EAAW,CACnD,OAAOL,GAAa9G,GAAQkD,GAAQ,EAAG6D,GAAY,OAAO,CAACI,CAAS,CAAC,CAAC,CAClF,CAAW,CACX,KAEU,OAAO,CAACJ,EAAW,CAEtB,CAED,OAAOD,GAAa9G,EAAQ,EAAG,CAAE,CAAA,CAClC,CASD,SAASoH,GAAYC,EAASC,GAAS,CACrC,MAAMC,GAAK,KAAK,IAAIF,EAAQ,OAAQC,GAAQ,MAAM,EAElD,QAAS7Q,EAAI,EAAGA,EAAI8Q,GAAI9Q,IAAK,CAC3B,MAAM+Q,EAAWrE,EAAkBkE,EAAS5Q,CAAC,EACvCgR,GAAWtE,EAAkBmE,GAAS7Q,CAAC,EAC7C,IAAIiR,GAAU,GACVlK,GAEJ,IAAKA,MAAQiK,GACX,GAAID,EAAS,IAAIhK,EAAI,EAAG,CACtBkK,GAAU,GACV,KACD,CAGH,GAAI,CAACA,GACH,MAAO,EAEV,CAED,MAAMC,GAAON,EAAQ,OACfO,GAAON,GAAQ,OACfO,GAAavF,EAAa+E,CAAO,EACjCS,GAAaxF,EAAagF,EAAO,EACvC,OAAOO,GAAaC,GAAaH,KAASC,GAAOA,IAAQD,GAAOG,GAAaH,IAAQC,GAAOD,KAASC,EACtG,CAWD,SAASG,GAAiBC,EAAc,CACtC,OAAOA,EAAa,IAAIpI,IAClBqI,GAAcrI,EAAE,EACXsI,GAAYtI,GAAG,YAAY,QAAQ,EAGxCuI,GAAUvI,EAAE,EACPwI,GAAYxI,GAAG,QAAQ,WAAYA,GAAG,QAAQ,QAAQ,EAGxDA,EACR,CACF,CAcD,SAASyI,GAAmBC,EAAYN,GAAcO,GAAc,CAClE,MAAMC,GAAqB,CAAA,EAC3B,IAAIC,GAEJ,IAAKA,MAAaH,EAAY,CAC5B,IAAII,GAAaH,GAAaE,EAAS,EAEvC,GAAI,OAAOC,IAAe,SACxB,MAAM,IAAI,UAAU,2CAA6CD,GAAY,GAAG,EAKlF,GAFAC,GAAaV,GAAaU,EAAU,EAEhC,OAAOA,IAAe,WACxB,MAAO,GAGTF,GAAmB,KAAKE,EAAU,CACnC,CAED,OAAOF,EACR,CAcD,SAASG,GAAkBX,EAAcO,GAAcK,GAAM,CAC3D,MAAMC,GAAoBd,GAAiBC,CAAY,EACjDc,GAAa,IAAI,MAAMD,GAAkB,MAAM,EAAE,KAAK,EAAK,EACjE,IAAIE,GAAiB,GAErB,KAAOA,IAAgB,CACrBA,GAAiB,GACjB,IAAIC,GAAkB,GAEtB,QAASvS,EAAI,EAAGA,EAAIoS,GAAkB,OAAQ,EAAEpS,EAAG,CACjD,GAAIqS,GAAWrS,CAAC,EAAG,SACnB,MAAMmJ,EAAKiJ,GAAkBpS,CAAC,EAE9B,GAAIwR,GAAcrI,CAAE,EAClBiJ,GAAkBpS,CAAC,EAAImJ,EAAG,YAAY,SAASgJ,EAAI,EAEnDC,GAAkBpS,CAAC,EAAE,YAAcmJ,EAAG,YACtCkJ,GAAWrS,CAAC,EAAI,GAChBuS,GAAkB,WACTb,GAAUvI,CAAE,EAAG,CACxB,MAAM4I,GAAqBH,GAAmBzI,EAAG,QAAQ,WAAYiJ,GAAmBN,EAAY,EAEhGC,IACFK,GAAkBpS,CAAC,EAAImJ,EAAG,QAAQ,SAAS,MAAM,KAAM4I,EAAkB,EAEzEK,GAAkBpS,CAAC,EAAE,QAAUmJ,EAAG,QAClCkJ,GAAWrS,CAAC,EAAI,GAChBuS,GAAkB,IAElBD,GAAiB,EAEpB,CACF,CAED,GAAIC,IAAmBD,GACrB,MAAM,IAAI,YAAY,wDAAwD,CAEjF,CAED,OAAOF,EACR,CAUD,SAASI,GAAuBC,EAAe,CAG7C,MAAMC,GAAsB,4BAC5B,OAAO,KAAKD,CAAa,EAAE,QAAQrJ,IAAa,CAC9C,MAAMD,GAAKsJ,EAAcrJ,EAAS,EAElC,GAAIsJ,GAAoB,KAAKvJ,GAAG,SAAU,CAAA,EACxC,MAAM,IAAI,YAAY,kIAA4I,CAE5K,CAAO,CACF,CAaD,SAASwJ,GAAoB5L,EAAM6L,GAAkB,CAGnD,GAFA3K,EAAM,cAEF,OAAO,KAAK2K,EAAgB,EAAE,SAAW,EAC3C,MAAM,IAAI,YAAY,wBAAwB,EAG5C3K,EAAM,2BACRuK,GAAuBI,EAAgB,EAIzC,MAAMC,GAAe,CAAA,EACfC,GAAoB,CAAA,EACpBL,GAAgB,CAAA,EAChBM,GAAwB,CAAA,EAE9B,IAAI3J,GAEJ,IAAKA,MAAawJ,GAAkB,CAElC,GAAI,CAAC,OAAO,UAAU,eAAe,KAAKA,GAAkBxJ,EAAS,EACnE,SAIF,MAAMG,GAASC,EAAeJ,EAAS,EACvC,GAAI,CAACG,GAAQ,SAEbsJ,GAAa,QAAQ,SAAUG,GAAI,CACjC,GAAIrC,GAAYqC,GAAIzJ,EAAM,EACxB,MAAM,IAAI,UAAU,2BAA6BG,EAAgBsJ,EAAE,EAAI,UAAYtJ,EAAgBH,EAAM,EAAI,IAAI,CAE7H,CAAS,EACDsJ,GAAa,KAAKtJ,EAAM,EAExB,MAAM0J,GAAgBH,GAAkB,OACxCA,GAAkB,KAAKF,GAAiBxJ,EAAS,CAAC,EAClD,MAAM8J,GAAmB3J,GAAO,IAAI4B,CAAW,EAE/C,IAAIgI,GAEJ,IAAKA,MAAM/C,GAAY8C,EAAgB,EAAG,CACxC,MAAME,GAAS1J,EAAgByJ,EAAE,EACjCJ,GAAsB,KAAK,CACzB,OAAQI,GACR,KAAMC,GACN,GAAIH,EAChB,CAAW,EAEGE,GAAG,MAAMxI,IAAK,CAACA,GAAE,aAAa,IAChC8H,GAAcW,EAAM,EAAIH,GAE3B,CACF,CAEDF,GAAsB,KAAK5E,CAAiB,EAE5C,MAAMiE,EAAoBF,GAAkBY,GAAmBL,GAAeY,EAAU,EAExF,IAAIrI,EAEJ,IAAKA,KAAKyH,GACJ,OAAO,UAAU,eAAe,KAAKA,GAAezH,CAAC,IACvDyH,GAAczH,CAAC,EAAIoH,EAAkBK,GAAczH,CAAC,CAAC,GAIzD,MAAM6B,GAAa,CAAA,EACbyG,GAAuB,IAAI,IAEjC,IAAKtI,KAAK+H,GAIHO,GAAqB,IAAItI,EAAE,IAAI,IAClCA,EAAE,GAAKoH,EAAkBpH,EAAE,EAAE,EAC7B6B,GAAW,KAAK7B,CAAC,EACjBsI,GAAqB,IAAItI,EAAE,KAAMA,CAAC,GAKtC,MAAMuI,GAAM1G,GAAW,CAAC,GAAKA,GAAW,CAAC,EAAE,OAAO,QAAU,GAAK,CAAChB,EAAagB,GAAW,CAAC,EAAE,MAAM,EAC7F2G,GAAM3G,GAAW,CAAC,GAAKA,GAAW,CAAC,EAAE,OAAO,QAAU,GAAK,CAAChB,EAAagB,GAAW,CAAC,EAAE,MAAM,EAC7F4G,GAAM5G,GAAW,CAAC,GAAKA,GAAW,CAAC,EAAE,OAAO,QAAU,GAAK,CAAChB,EAAagB,GAAW,CAAC,EAAE,MAAM,EAC7F6G,GAAM7G,GAAW,CAAC,GAAKA,GAAW,CAAC,EAAE,OAAO,QAAU,GAAK,CAAChB,EAAagB,GAAW,CAAC,EAAE,MAAM,EAC7F8G,GAAM9G,GAAW,CAAC,GAAKA,GAAW,CAAC,EAAE,OAAO,QAAU,GAAK,CAAChB,EAAagB,GAAW,CAAC,EAAE,MAAM,EAC7F+G,GAAM/G,GAAW,CAAC,GAAKA,GAAW,CAAC,EAAE,OAAO,QAAU,GAAK,CAAChB,EAAagB,GAAW,CAAC,EAAE,MAAM,EAC7FgH,GAAQN,IAAOC,IAAOC,IAAOC,IAAOC,IAAOC,GAEjD,QAAS5T,GAAI,EAAGA,GAAI6M,GAAW,OAAQ,EAAE7M,GACvC6M,GAAW7M,EAAC,EAAE,KAAOmM,EAAaU,GAAW7M,EAAC,EAAE,MAAM,EAGxD,MAAM8T,GAASP,GAAMxH,EAAYc,GAAW,CAAC,EAAE,OAAO,CAAC,CAAC,EAAItF,EACtDwM,GAASP,GAAMzH,EAAYc,GAAW,CAAC,EAAE,OAAO,CAAC,CAAC,EAAItF,EACtDyM,GAASP,GAAM1H,EAAYc,GAAW,CAAC,EAAE,OAAO,CAAC,CAAC,EAAItF,EACtD0M,GAASP,GAAM3H,EAAYc,GAAW,CAAC,EAAE,OAAO,CAAC,CAAC,EAAItF,EACtD2M,GAASP,GAAM5H,EAAYc,GAAW,CAAC,EAAE,OAAO,CAAC,CAAC,EAAItF,EACtD4M,GAASP,GAAM7H,EAAYc,GAAW,CAAC,EAAE,OAAO,CAAC,CAAC,EAAItF,EACtD6M,GAASb,GAAMxH,EAAYc,GAAW,CAAC,EAAE,OAAO,CAAC,CAAC,EAAItF,EACtD8M,GAASb,GAAMzH,EAAYc,GAAW,CAAC,EAAE,OAAO,CAAC,CAAC,EAAItF,EACtD+M,GAASb,GAAM1H,EAAYc,GAAW,CAAC,EAAE,OAAO,CAAC,CAAC,EAAItF,EACtDgN,GAASb,GAAM3H,EAAYc,GAAW,CAAC,EAAE,OAAO,CAAC,CAAC,EAAItF,EACtDiN,GAASb,GAAM5H,EAAYc,GAAW,CAAC,EAAE,OAAO,CAAC,CAAC,EAAItF,EACtDkN,GAASb,GAAM7H,EAAYc,GAAW,CAAC,EAAE,OAAO,CAAC,CAAC,EAAItF,EAE5D,QAASvH,GAAI,EAAGA,GAAI6M,GAAW,OAAQ,EAAE7M,GACvC6M,GAAW7M,EAAC,EAAE,eAAiB0P,GAAyB7C,GAAW7M,EAAC,EAAE,OAAQ6M,GAAW7M,EAAC,EAAE,EAAE,EAGhG,MAAM0U,GAAMnB,GAAM1G,GAAW,CAAC,EAAE,eAAiBrF,EAC3CmN,EAAMnB,GAAM3G,GAAW,CAAC,EAAE,eAAiBrF,EAC3CoN,EAAMnB,GAAM5G,GAAW,CAAC,EAAE,eAAiBrF,EAC3CqN,EAAMnB,GAAM7G,GAAW,CAAC,EAAE,eAAiBrF,EAC3CsN,EAAMnB,GAAM9G,GAAW,CAAC,EAAE,eAAiBrF,EAC3CuN,EAAMnB,GAAM/G,GAAW,CAAC,EAAE,eAAiBrF,EAC3CwN,EAAOzB,GAAM1G,GAAW,CAAC,EAAE,OAAO,OAAS,GAC3CqE,GAAOsC,GAAM3G,GAAW,CAAC,EAAE,OAAO,OAAS,GAC3CsE,GAAOsC,GAAM5G,GAAW,CAAC,EAAE,OAAO,OAAS,GAC3CoI,GAAOvB,GAAM7G,GAAW,CAAC,EAAE,OAAO,OAAS,GAC3CqI,GAAOvB,GAAM9G,GAAW,CAAC,EAAE,OAAO,OAAS,GAC3CsI,GAAOvB,GAAM/G,GAAW,CAAC,EAAE,OAAO,OAAS,GAE3CuI,GAASvB,GAAQ,EAAI,EACrBwB,GAAOxI,GAAW,OAElBX,GAAQW,GAAW,IAAI7B,IAAKA,GAAE,IAAI,EAClCsK,GAAMzI,GAAW,IAAI7B,IAAKA,GAAE,cAAc,EAE1CuK,GAAU,UAAmB,CAEjC,QAASvV,GAAIoV,GAAQpV,GAAIqV,GAAMrV,KAC7B,GAAIkM,GAAMlM,EAAC,EAAE,SAAS,EACpB,OAAOsV,GAAItV,EAAC,EAAE,MAAM,KAAM,SAAS,EAIvC,OAAOiI,EAAM,WAAWlB,EAAM,UAAW8F,EAAU,CAC3D,EAIM,SAASwG,GAAWmC,GAAMC,GAAM,CAE9B,OAAI,UAAU,SAAWT,GAAQlB,GAAO0B,EAAI,GAAKpB,GAAOqB,EAAI,EACnDf,GAAI,MAAM,KAAM,SAAS,EAG9B,UAAU,SAAWxD,IAAQ6C,GAAOyB,EAAI,GAAKnB,GAAOoB,EAAI,EACnDd,EAAI,MAAM,KAAM,SAAS,EAG9B,UAAU,SAAWxD,IAAQ6C,GAAOwB,EAAI,GAAKlB,GAAOmB,EAAI,EACnDb,EAAI,MAAM,KAAM,SAAS,EAG9B,UAAU,SAAWK,IAAQhB,GAAOuB,EAAI,GAAKjB,GAAOkB,EAAI,EACnDZ,EAAI,MAAM,KAAM,SAAS,EAG9B,UAAU,SAAWK,IAAQhB,GAAOsB,EAAI,GAAKhB,GAAOiB,EAAI,EACnDX,EAAI,MAAM,KAAM,SAAS,EAG9B,UAAU,SAAWK,IAAQhB,GAAOqB,EAAI,GAAKf,GAAOgB,EAAI,EACnDV,EAAI,MAAM,KAAM,SAAS,EAG3BQ,GAAQ,MAAM,KAAM,SAAS,CACrC,CAGD,GAAI,CACF,OAAO,eAAelC,GAAY,OAAQ,CACxC,MAAOtM,CACjB,CAAS,CACF,MAAa,CAGb,CAKD,OAAAsM,GAAW,WAAaZ,GAGxBY,GAAW,mBAAqB,CAC9B,WAAAxG,GACA,aAAcyG,EACtB,EACaD,EACR,CASD,SAASqC,EAAY3O,EAAMyF,GAAMK,GAAY,CAC3C,MAAMG,EAAYjG,EAAMyF,GAAMK,EAAU,CACzC,CAQD,SAAST,GAAQuJ,EAAK,CACpB,OAAO3F,GAAM2F,EAAK,EAAGA,EAAI,OAAS,CAAC,CACpC,CAQD,SAAS7J,GAAK6J,EAAK,CACjB,OAAOA,EAAIA,EAAI,OAAS,CAAC,CAC1B,CAUD,SAAS3F,GAAM2F,EAAKC,GAAOC,GAAK,CAC9B,OAAO,MAAM,UAAU,MAAM,KAAKF,EAAKC,GAAOC,EAAG,CAClD,CAUD,SAASC,GAAYH,EAAKrI,GAAM,CAC9B,QAAStN,GAAI,EAAGA,GAAI2V,EAAI,OAAQ3V,KAC9B,GAAIsN,GAAKqI,EAAI3V,EAAC,CAAC,EACb,OAAO2V,EAAI3V,EAAC,CAKjB,CAUD,SAASyQ,GAAQkF,EAAK/Q,GAAU,CAC9B,OAAO,MAAM,UAAU,OAAO,MAAM,CAAE,EAAE+Q,EAAI,IAAI/Q,EAAQ,CAAC,CAC1D,CAcD,SAASmR,IAAU,CACjB,MAAMlE,EAAazF,GAAQ,SAAS,EAAE,IAAIpB,IAAKtB,EAAgBF,EAAewB,EAAC,CAAC,CAAC,EAC3EpG,GAAWkH,GAAK,SAAS,EAE/B,GAAI,OAAOlH,IAAa,WACtB,MAAM,IAAI,UAAU,6CAA6C,EAGnE,OAAO+M,GAAYE,EAAYjN,EAAQ,CACxC,CAED,SAAS+M,GAAYE,EAAYjN,GAAU,CACzC,MAAO,CACL,QAAS,CACP,WAAAiN,EACA,SAAAjN,EACD,CACT,CACK,CASD,SAAS6M,GAAY7M,EAAU,CAC7B,GAAI,OAAOA,GAAa,WACtB,MAAM,IAAI,UAAU,8CAA8C,EAGpE,MAAO,CACL,YAAa,CACX,SAAAA,CACD,CACT,CACK,CAUD,SAAS8M,GAAUsE,EAAY,CAC7B,OAAOA,GAAc,OAAOA,EAAW,SAAY,UAAY,MAAM,QAAQA,EAAW,QAAQ,UAAU,GAAK,OAAOA,EAAW,QAAQ,UAAa,UACvJ,CAUD,SAASxE,GAAcwE,EAAY,CACjC,OAAOA,GAAc,OAAOA,EAAW,aAAgB,UAAY,OAAOA,EAAW,YAAY,UAAa,UAC/G,CAWD,SAASC,GAAUC,EAAW3K,GAAS,CACrC,GAAI,CAAC2K,EACH,OAAO3K,GAGT,GAAIA,IAAWA,KAAY2K,EAAW,CACpC,MAAMjJ,GAAM,IAAI,MAAM,0CAA4CiJ,EAAY,aAAe3K,GAAU,GAAG,EAC1G,MAAA0B,GAAI,KAAO,CACT,OAAQ1B,GACR,SAAU2K,CACpB,EACcjJ,EACP,CAED,OAAOiJ,CACR,CASD,SAASC,GAAcvW,EAAK,CAC1B,IAAImH,GAEJ,UAAW7G,MAAON,EAGZ,OAAO,UAAU,eAAe,KAAKA,EAAKM,EAAG,IAAM8I,EAAgBpJ,EAAIM,EAAG,CAAC,GAAK,OAAON,EAAIM,EAAG,EAAE,WAAc,YAChH6G,GAAOkP,GAAUlP,GAAMnH,EAAIM,EAAG,EAAE,IAAI,GAIxC,OAAO6G,EACR,CAUD,SAASqP,GAAgBC,EAAMpW,GAAQ,CACrC,IAAIC,GAEJ,IAAKA,MAAOD,GACV,GAAI,OAAO,UAAU,eAAe,KAAKA,GAAQC,EAAG,EAAG,CACrD,GAAIA,MAAOmW,GACLpW,GAAOC,EAAG,IAAMmW,EAAKnW,EAAG,EAAG,CAC7B,MAAM+M,GAAM,IAAI,MAAM,cAAgB/M,GAAM,oBAAoB,EAChE,MAAA+M,GAAI,KAAO,CACT,UAAW/M,GACX,eAAgBD,GAAOC,EAAG,EAC1B,aAAcmW,EAAKnW,EAAG,CACtC,EACoB+M,EACP,CAIHoJ,EAAKnW,EAAG,EAAID,GAAOC,EAAG,CACvB,CAEJ,CAED,MAAMoW,GAAYrO,EAwBlBA,EAAQ,SAAUsO,EAAW,CAC3B,MAAMC,GAAQ,OAAOD,GAAc,SAC7BX,GAAQY,GAAQ,EAAI,EAC1B,IAAIzP,GAAOyP,GAAQD,EAAY,GAC/B,MAAME,GAAgB,CAAA,EAEtB,QAASzW,GAAI4V,GAAO5V,GAAI,UAAU,OAAQ,EAAEA,GAAG,CAC7C,MAAM8G,GAAO,UAAU9G,EAAC,EACxB,IAAI0W,EAAkB,CAAA,EAClBC,EAqBJ,GAnBI,OAAO7P,IAAS,YAClB6P,EAAW7P,GAAK,KAEZ,OAAOA,GAAK,WAAc,SAE5B4P,EAAgB5P,GAAK,SAAS,EAAIA,GACzBkC,EAAgBlC,EAAI,IAE7B4P,EAAkB5P,GAAK,aAEhBa,EAAcb,EAAI,IAE3B4P,EAAkB5P,GAEb0P,KACHG,EAAWR,GAAcrP,EAAI,IAI7B,OAAO,KAAK4P,CAAe,EAAE,SAAW,EAAG,CAC7C,MAAMzJ,GAAM,IAAI,UAAU,gCAAoCjN,GAAI,4FAAiG,EACnK,MAAAiN,GAAI,KAAO,CACT,MAAOjN,GACP,SAAU8G,EACtB,EACgBmG,EACP,CAEIuJ,KACHzP,GAAOkP,GAAUlP,GAAM4P,CAAQ,GAGjCP,GAAgBK,GAAeC,CAAe,CAC/C,CAED,OAAO/D,GAAoB5L,IAAQ,GAAI0P,EAAa,CAC1D,EAEIxO,EAAM,OAASP,EACfO,EAAM,YAAcqO,GAAU,YAC9BrO,EAAM,WAAayN,EACnBzN,EAAM,mBAAqByN,EAC3BzN,EAAM,YAAc+E,EACpB/E,EAAM,MAAQW,EACdX,EAAM,iBAAmBY,EACzBZ,EAAM,SAAWK,EACjBL,EAAM,UAAYC,EAElBD,EAAM,QAAU8N,GAChB9N,EAAM,YAAcwJ,GACpBxJ,EAAM,QAAUuC,EAChBvC,EAAM,cAAgBiB,EACtBjB,EAAM,KAAOsC,EACbtC,EAAM,gBAAkBe,EACxBf,EAAM,0BAA4B,GAUlCA,EAAM,QAAU,SAAUvD,EAAMkS,GAAkB,CAChD,IAAIC,GAAS,MAETD,KAAqB,IAAS9O,EAAQ,IAAI,QAAQ,IACpD+O,GAAS,UAGX5O,EAAM,SAAS,CAACvD,CAAI,EAAGmS,EAAM,CACnC,EAUI,SAASC,GAAoBrL,EAAY,CACvC,GAAI,CAACA,GAAc,OAAOA,EAAW,MAAS,UAAY,OAAOA,EAAW,IAAO,UAAY,OAAOA,EAAW,SAAY,WAC3H,MAAM,IAAI,UAAU,+EAA+E,EAGrG,GAAIA,EAAW,KAAOA,EAAW,KAC/B,MAAM,IAAI,YAAY,sCAAwCA,EAAW,KAAO,cAAc,CAEjG,CAUD,OAAAxD,EAAM,cAAgB,SAAUwD,EAAY,CAC1CqL,GAAoBrL,CAAU,EAE9B,MAAMsL,GAAK7O,EAASuD,EAAW,EAAE,EAEjC,GAAIsL,GAAG,cAAc,MAAM,SAAUC,GAAO,CAC1C,OAAOA,GAAM,OAASvL,EAAW,IACzC,CAAO,EACCsL,GAAG,cAAc,KAAK,CACpB,KAAMtL,EAAW,KACjB,QAASA,EAAW,QACpB,MAAOzD,GACjB,CAAS,MAED,OAAM,IAAI,MAAM,uCAAyCyD,EAAW,KAAO,SAAWsL,GAAG,KAAO,GAAG,CAE3G,EAUI9O,EAAM,eAAiB,SAAUwC,EAAa,CAC5CA,EAAY,QAAQxC,EAAM,aAAa,CAC7C,EAYIA,EAAM,iBAAmB,SAAUwD,EAAY,CAC7CqL,GAAoBrL,CAAU,EAE9B,MAAMsL,GAAK7O,EAASuD,EAAW,EAAE,EAC3BwL,GAAqBnB,GAAYiB,GAAG,cAAe1H,IAAKA,GAAE,OAAS5D,EAAW,IAAI,EAExF,GAAI,CAACwL,GACH,MAAM,IAAI,MAAM,iDAAmDxL,EAAW,KAAO,OAASA,EAAW,EAAE,EAG7G,GAAIwL,GAAmB,UAAYxL,EAAW,QAC5C,MAAM,IAAI,MAAM,yDAAyD,EAG3E,MAAMgB,GAAQsK,GAAG,cAAc,QAAQE,EAAkB,EACzDF,GAAG,cAAc,OAAOtK,GAAO,CAAC,CACtC,EAaIxE,EAAM,QAAU,SAAUiP,EAAIC,GAAS,CACrC,GAAI,CAACnO,EAAgBkO,CAAE,EACrB,MAAM,IAAI,UAAUzP,CAAkB,EAGxC,MAAM2P,GAAOF,EAAG,mBAAmB,WAEnC,QAASlX,GAAI,EAAGA,GAAIoX,GAAK,OAAQ,EAAEpX,GACjC,GAAIoX,GAAKpX,EAAC,EAAE,KAAKmX,EAAO,EACtB,OAAOC,GAAKpX,EAAC,EAIjB,OAAO,IACb,EAEWiI,CACR,CAED,IAAIoP,EAAgB3P,IAEpB,OAAO2P,CAET,8BC7kEA,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACWA,GAAA,KAAgBA,GAAA,MAAgBA,GAAA,MAAgBA,GAAA,MAAsBA,GAAA,YAAG,OACrEA,GAAA,SAAGC,GACPD,GAAA,KAAG,OACDA,GAAA,OAAGE,GACJF,GAAA,MAAG,OACFA,GAAA,OAAGG,GACAH,GAAA,UAAGI,GACpBJ,GAAA,KAA4BA,GAAA,eAAmB,OAC5BA,GAAA,YAAGK,GACHL,GAAA,YAAGM,GACtBN,GAAA,KAAeA,GAAA,KAAe,OACXA,GAAA,YAAGO,GACVP,GAAA,KAAG,OACMA,GAAA,cAAGQ,GACHR,GAAA,cAAGS,GACTT,GAAA,QAAGU,GACCV,GAAA,YAAGW,GACtB,IAAIzT,GAAMjE,GAUV,SAASmX,GAAU/S,EAAO,CACxB,OAAI,OAAOA,GAAU,UACZ,GAEF,SAASA,CAAK,EAAIA,IAAU,KAAK,MAAMA,CAAK,EAAI,EACzD,CAOA,IAAIuT,GAAsB,KAAK,MAAQ,SAAU/U,EAAG,CAClD,OAAIA,EAAI,EACC,EACEA,EAAI,EACN,GAEA,CAEX,EAOYmU,GAAA,KAAGY,GACf,IAAIC,GAAsB,KAAK,MAAQ,SAAchV,EAAG,CACtD,OAAO,KAAK,IAAIA,CAAC,EAAI,KAAK,GAC5B,EAOYmU,GAAA,KAAGa,GACf,IAAIC,GAAuB,KAAK,OAAS,SAAejV,EAAG,CACzD,OAAO,KAAK,IAAIA,CAAC,EAAI,KAAK,IAC5B,EAOamU,GAAA,MAAGc,GAChB,IAAIC,GAAuB,KAAK,OAAS,SAAUlV,EAAG,CACpD,OAAO,KAAK,IAAIA,EAAI,CAAC,CACvB,EAWamU,GAAA,MAAGe,GAChB,IAAIC,GAAsB,KAAK,MAAQ,SAAcnV,EAAG,CACtD,GAAIA,IAAM,EACR,OAAOA,EAET,IAAIoV,EAASpV,EAAI,EACbqV,EACJ,OAAID,IACFpV,EAAI,CAACA,GAEH,SAASA,CAAC,GACZqV,EAAS,KAAK,IAAI,KAAK,IAAIrV,CAAC,EAAI,CAAC,EAEjCqV,GAAUrV,GAAKqV,EAASA,GAAU,EAAIA,GAAU,GAEhDA,EAASrV,EAEJoV,EAAS,CAACC,EAASA,CAC5B,EAOYlB,GAAA,KAAGgB,GACf,IAAIG,GAAuB,KAAK,OAAS,SAAetV,EAAG,CACzD,OAAOA,GAAK,MAAQA,GAAK,MAAQ,KAAK,IAAIA,CAAC,EAAI,EAAIA,EAAIA,EAAIA,EAAI,EAAIA,EAAIA,EAAIA,EAAI,CACjF,EASamU,GAAA,MAAGmB,GAChB,SAASC,GAAmBC,EAAGC,EAAMC,EAAM,CACzC,IAAIC,EAAW,CACb,EAAG,KACH,EAAG,KACH,GAAI,IACR,EACMC,EAASD,EAASF,CAAI,EACtBI,EAAS,GACb,GAAIH,EAAM,CACR,GAAIA,EAAO,EACT,MAAM,IAAI,MAAM,gCAAgC,EAElD,GAAI,CAACnB,GAAUmB,CAAI,EACjB,MAAM,IAAI,MAAM,yBAAyB,EAE3C,GAAIF,EAAI,KAAK,IAAI,EAAGE,EAAO,CAAC,EAAI,GAAKF,EAAI,CAAC,KAAK,IAAI,EAAGE,EAAO,CAAC,EAC5D,MAAM,IAAI,MAAM,8BAA8B,OAAOA,EAAO,EAAG,MAAM,EAAE,OAAOA,EAAO,EAAG,KAAK,CAAC,EAEhG,GAAI,CAACnB,GAAUiB,CAAC,EACd,MAAM,IAAI,MAAM,0BAA0B,EAExCA,EAAI,IACNA,EAAIA,EAAI,KAAK,IAAI,EAAGE,CAAI,GAE1BG,EAAS,IAAI,OAAOH,CAAI,CACzB,CACD,IAAIX,EAAO,GACX,OAAIS,EAAI,IACNA,EAAI,CAACA,EACLT,EAAO,KAEF,GAAG,OAAOA,CAAI,EAAE,OAAOa,CAAM,EAAE,OAAOJ,EAAE,SAASC,CAAI,CAAC,EAAE,OAAOI,CAAM,CAC9E,CAsFA,SAASvB,GAAO9S,EAAO4B,EAAS,CAC9B,GAAI,OAAOA,GAAY,WAErB,OAAOA,EAAQ5B,CAAK,EAItB,GAAIA,IAAU,IACZ,MAAO,WACF,GAAIA,IAAU,KACnB,MAAO,YACF,GAAI,MAAMA,CAAK,EACpB,MAAO,MAIT,IAAIsU,EAAW,OACXC,EACAC,EACJ,GAAI5S,IAEEA,EAAQ,WACV0S,EAAW1S,EAAQ,aAIb/B,GAAI,UAAU+B,CAAO,EAC3B2S,EAAY3S,KACC/B,GAAI,UAAU+B,EAAQ,SAAS,IAC5C2S,EAAY3S,EAAQ,WAElBA,EAAQ,WACV4S,EAAW5S,EAAQ,SACf,OAAO4S,GAAa,WACtB,MAAM,IAAI,MAAM,oCAAoC,EAM1D,OAAQF,EAAQ,CACd,IAAK,QACH,OAAOjB,GAAQrT,EAAOuU,CAAS,EACjC,IAAK,cACH,OAAOnB,GAAcpT,EAAOuU,CAAS,EACvC,IAAK,cACH,OAAOpB,GAAcnT,EAAOuU,CAAS,EACvC,IAAK,MACH,OAAOR,GAAmB/T,EAAO,EAAGwU,CAAQ,EAC9C,IAAK,MACH,OAAOT,GAAmB/T,EAAO,EAAGwU,CAAQ,EAC9C,IAAK,MACH,OAAOT,GAAmB/T,EAAO,GAAIwU,CAAQ,EAC/C,IAAK,OAEH,OAAOlB,GAAYtT,EAAOuU,EAAW3S,GAAWA,CAAO,EAAE,QAAQ,sBAAuB,UAAY,CAClG,IAAIiR,EAAS,UAAU,CAAC,EACpB4B,EAAI,UAAU,CAAC,EACnB,OAAO5B,IAAW,IAAMA,EAAS4B,EAAIA,CAC7C,CAAO,EACH,QACE,MAAM,IAAI,MAAM,qBAAuBH,EAAW,kEAAuE,CAC5H,CACH,CAQA,SAASpB,GAAYlT,EAAO,CAE1B,IAAIgF,EAAQ,OAAOhF,CAAK,EAAE,cAAc,MAAM,iCAAiC,EAC/E,GAAI,CAACgF,EACH,MAAM,IAAI,YAAY,kBAAoBhF,CAAK,EAEjD,IAAIuT,EAAOvO,EAAM,CAAC,EACd6N,EAAS7N,EAAM,CAAC,EAChB0P,EAAW,WAAW1P,EAAM,CAAC,GAAK,GAAG,EACrC2P,EAAM9B,EAAO,QAAQ,GAAG,EAC5B6B,GAAYC,IAAQ,GAAKA,EAAM,EAAI9B,EAAO,OAAS,EACnD,IAAI+B,EAAe/B,EAAO,QAAQ,IAAK,EAAE,EACxC,QAAQ,MAAO,SAAUgC,EAAO,CAE/B,OAAAH,GAAYG,EAAM,OACX,EACX,CAAG,EAAE,QAAQ,MAAO,EAAE,EACnB,MAAM,EAAE,EAAE,IAAI,SAAU,EAAG,CAC1B,OAAO,SAAS,CAAC,CACrB,CAAG,EACD,OAAID,EAAa,SAAW,IAC1BA,EAAa,KAAK,CAAC,EACnBF,KAEK,CACL,KAAMnB,EACN,aAAcqB,EACd,SAAUF,CACd,CACA,CAOA,SAASvB,GAAcnT,EAAOuU,EAAW,CACvC,GAAI,MAAMvU,CAAK,GAAK,CAAC,SAASA,CAAK,EACjC,OAAO,OAAOA,CAAK,EAErB,IAAI8U,EAAQ5B,GAAYlT,CAAK,EACzB+U,EAAU9B,GAAY6B,EAAOP,CAAS,EACtCE,EAAIM,EAAQ,SACZrK,EAAIqK,EAAQ,aAGZC,EAASP,EAAI,IAAM,EAAIA,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAIA,EAAI,EAC/D,MAAQ5U,GAAI,UAAU0U,CAAS,EAE7B,KAAOA,EAAY7J,EAAE,QAAU+J,EAAIO,EAAS,EAAItK,EAAE,QAChDA,EAAE,KAAK,CAAC,MAMV,SADIuK,EAAe,KAAK,IAAIR,EAAIO,CAAM,GAAKtK,EAAE,OAAS,GAC7CrP,EAAI,EAAGA,EAAI4Z,EAAc5Z,IAChCqP,EAAE,KAAK,CAAC,EASZ,QAJIwK,EAAU,KAAK,IAAIT,EAAIO,CAAM,EAC7BG,EAAa,EAGVD,EAAU,GACfC,IACAD,IAKF,IAAIE,EAAW1K,EAAE,MAAMyK,CAAU,EAAE,KAAK,EAAE,EACtCE,KAAiBxV,GAAI,UAAU0U,CAAS,GAAKa,EAAS,QAAUA,EAAS,MAAM,OAAO,EAAI,IAAMA,EAAW,GAC3GhU,EAAMsJ,EAAE,MAAM,EAAGyK,CAAU,EAAE,KAAK,EAAE,EAAIE,EAAa,KAAOZ,GAAK,EAAI,IAAM,IAAMO,EAAO,WAC5F,OAAOD,EAAQ,KAAO3T,CACxB,CAQA,SAASiS,GAAQrT,EAAOuU,EAAW,CACjC,GAAI,MAAMvU,CAAK,GAAK,CAAC,SAASA,CAAK,EACjC,OAAO,OAAOA,CAAK,EAErB,IAAIsV,EAAapC,GAAYlT,CAAK,EAC9B+U,EAAU,OAAOR,GAAc,SAAWtB,GAAYqC,EAAYA,EAAW,SAAW,EAAIf,CAAS,EAAIe,EACzG5K,EAAIqK,EAAQ,aACZ/O,EAAI+O,EAAQ,SAAW,EAGvB1G,EAAKrI,GAAKuO,GAAa,GAC3B,OAAI7J,EAAE,OAAS2D,IACb3D,EAAIA,EAAE,OAAOmK,GAAMxG,EAAK3D,EAAE,MAAM,CAAC,GAI/B1E,EAAI,IACN0E,EAAImK,GAAM,CAAC7O,EAAI,CAAC,EAAE,OAAO0E,CAAC,EAC1B1E,EAAI,GAIFA,EAAI0E,EAAE,QACRA,EAAE,OAAO1E,EAAG,EAAGA,IAAM,EAAI,KAAO,GAAG,EAE9B+O,EAAQ,KAAOrK,EAAE,KAAK,EAAE,CACjC,CASA,SAAS0I,GAAcpT,EAAOuU,EAAW,CACvC,GAAI,MAAMvU,CAAK,GAAK,CAAC,SAASA,CAAK,EACjC,OAAO,OAAOA,CAAK,EAIrB,IAAI8U,EAAQ5B,GAAYlT,CAAK,EACzB+U,EAAUR,EAAYtB,GAAY6B,EAAOP,CAAS,EAAIO,EACtDpK,EAAIqK,EAAQ,aACZN,EAAIM,EAAQ,SAGZrK,EAAE,OAAS6J,IACb7J,EAAIA,EAAE,OAAOmK,GAAMN,EAAY7J,EAAE,MAAM,CAAC,GAI1C,IAAI6K,EAAQ7K,EAAE,QACd,OAAOqK,EAAQ,KAAOQ,GAAS7K,EAAE,OAAS,EAAI,IAAMA,EAAE,KAAK,EAAE,EAAI,IAAM,KAAO+J,GAAK,EAAI,IAAM,IAAMA,CACrG,CAYA,SAASnB,GAAYtT,EAAOuU,EAAW3S,EAAS,CAC9C,GAAI,MAAM5B,CAAK,GAAK,CAAC,SAASA,CAAK,EACjC,OAAO,OAAOA,CAAK,EAIrB,IAAIwV,EAAW5T,GAAWA,EAAQ,WAAa,OAAYA,EAAQ,SAAW,GAC1E6T,EAAW7T,GAAWA,EAAQ,WAAa,OAAYA,EAAQ,SAAW,EAC1EkT,EAAQ5B,GAAYlT,CAAK,EACzB+U,EAAUR,EAAYtB,GAAY6B,EAAOP,CAAS,EAAIO,EAC1D,GAAIC,EAAQ,SAAWS,GAAYT,EAAQ,UAAYU,EAErD,OAAOrC,GAAcpT,EAAOuU,CAAS,EAErC,IAAI7J,EAAIqK,EAAQ,aACZN,EAAIM,EAAQ,SAGZrK,EAAE,OAAS6J,IACb7J,EAAIA,EAAE,OAAOmK,GAAMN,EAAY7J,EAAE,MAAM,CAAC,GAK1CA,EAAIA,EAAE,OAAOmK,GAAMJ,EAAI/J,EAAE,OAAS,GAAKA,EAAE,OAAS6J,EAAYA,EAAY7J,EAAE,OAAS,EAAE,CAAC,EAGxFA,EAAImK,GAAM,CAACJ,CAAC,EAAE,OAAO/J,CAAC,EACtB,IAAIiK,EAAMF,EAAI,EAAIA,EAAI,EACtB,OAAIE,EAAMjK,EAAE,OAAS,GACnBA,EAAE,OAAOiK,EAAM,EAAG,EAAG,GAAG,EAEnBI,EAAQ,KAAOrK,EAAE,KAAK,EAAE,CAEnC,CAUA,SAASuI,GAAY6B,EAAOP,EAAW,CAUrC,QARIQ,EAAU,CACZ,KAAMD,EAAM,KACZ,aAAcA,EAAM,aACpB,SAAUA,EAAM,QACpB,EACMpK,EAAIqK,EAAQ,aAGTR,GAAa,GAClB7J,EAAE,QAAQ,CAAC,EACXqK,EAAQ,WACRR,IAEF,GAAI7J,EAAE,OAAS6J,EAAW,CACxB,IAAImB,EAAUhL,EAAE,OAAO6J,EAAW7J,EAAE,OAAS6J,CAAS,EACtD,GAAImB,EAAQ,CAAC,GAAK,EAAG,CACnB,IAAI,EAAInB,EAAY,EAEpB,IADA7J,EAAE,CAAC,IACIA,EAAE,CAAC,IAAM,IACdA,EAAE,IAAG,EACD,IAAM,IACRA,EAAE,QAAQ,CAAC,EACXqK,EAAQ,WACR,KAEF,IACArK,EAAE,CAAC,GAEN,CACF,CACD,OAAOqK,CACT,CAOA,SAASF,GAAMc,EAAQ,CAErB,QADI3E,EAAM,CAAA,EACD3V,EAAI,EAAGA,EAAIsa,EAAQta,IAC1B2V,EAAI,KAAK,CAAC,EAEZ,OAAOA,CACT,CAaA,SAAS6B,GAAO7S,EAAO,CACrB,OAAOA,EAAM,cAAa,EAAG,QAAQ,OAAQ,EAAE,EAC9C,QAAQ,aAAc,EAAE,EACxB,MACH,CAKA,IAAI4V,GAAc,OAAO,SAAW,qBAWjBjD,GAAA,YAAGiD,GACtB,SAAS5C,GAAYxU,EAAGqX,EAAGC,EAAS,CAElC,GAAIA,GAAY,KACd,OAAOtX,IAAMqX,EAEf,GAAIrX,IAAMqX,EACR,MAAO,GAIT,GAAI,MAAMrX,CAAC,GAAK,MAAMqX,CAAC,EACrB,MAAO,GAIT,GAAI,SAASrX,CAAC,GAAK,SAASqX,CAAC,EAAG,CAE9B,IAAIE,EAAO,KAAK,IAAIvX,EAAIqX,CAAC,EACzB,OAAIE,EAAOH,GACF,GAGAG,GAAQ,KAAK,IAAI,KAAK,IAAIvX,CAAC,EAAG,KAAK,IAAIqX,CAAC,CAAC,EAAIC,CAEvD,CAGD,MAAO,EACT,CAOA,IAAIE,GAAQ,KAAK,OAAS,SAAUxX,EAAG,CACrC,OAAO,KAAK,IAAI,KAAK,KAAKA,EAAIA,EAAI,CAAC,EAAIA,CAAC,CAC1C,EACamU,GAAA,MAAGqD,GAChB,IAAIC,GAAQ,KAAK,OAAS,SAAUzX,EAAG,CACrC,OAAO,KAAK,IAAI,KAAK,KAAKA,EAAIA,EAAI,CAAC,EAAIA,CAAC,CAC1C,EAOamU,GAAA,MAAGsD,GAChB,IAAIC,GAAQ,KAAK,OAAS,SAAU1X,EAAG,CACrC,OAAO,KAAK,KAAK,EAAIA,IAAM,EAAIA,EAAE,EAAI,CACvC,EAOamU,GAAA,MAAGuD,GAChB,IAAIC,GAAO,KAAK,MAAQ,SAAU3X,EAAG,CACnC,OAAQ,KAAK,IAAIA,CAAC,EAAI,KAAK,IAAI,CAACA,CAAC,GAAK,CACxC,EAOYmU,GAAA,KAAGwD,GACf,IAAIC,GAAO,KAAK,MAAQ,SAAU5X,EAAG,CACnC,OAAQ,KAAK,IAAIA,CAAC,EAAI,KAAK,IAAI,CAACA,CAAC,GAAK,CACxC,EAOYmU,GAAA,KAAGyD,GACf,IAAIC,GAAO,KAAK,MAAQ,SAAU7X,EAAG,CACnC,IAAIiW,EAAI,KAAK,IAAI,EAAIjW,CAAC,EACtB,OAAQiW,EAAI,IAAMA,EAAI,EACxB,EAQY9B,GAAA,KAAG0D,GACf,SAASzD,GAASpU,EAAGqX,EAAG,CACtB,IAAIS,EAAQ9X,EAAI,EAAI,GAAOA,EAAI,EAAI,GAAQ,EAAIA,IAAM,IACjD+X,EAAQV,EAAI,EAAI,GAAOA,EAAI,EAAI,GAAQ,EAAIA,IAAM,IACrD,OAAOS,EAAQC,EAAQ,CAAC/X,EAAIA,CAC9B,kEChrBA,OAAO,eAAegY,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACaA,GAAA,OAAG1D,EACI0D,GAAA,cAAGrD,EACHqD,GAAA,cAAGpD,EACToD,GAAA,QAAGnD,EAClB,IAAIoD,EAAU7a,GAQd,SAAS8a,EAAsB1C,EAAGC,EAAMC,EAAM,CAC5C,IAAIyC,EAAgB3C,EAAE,YAClB4C,EAAO,IAAID,EAAc,CAAC,EAC1BtC,EAAS,GACb,GAAIH,EAAM,CACR,GAAIA,EAAO,EACT,MAAM,IAAI,MAAM,gCAAgC,EAElD,GAAI,IAAKuC,EAAQ,WAAWvC,CAAI,EAC9B,MAAM,IAAI,MAAM,yBAAyB,EAE3C,GAAIF,EAAE,YAAY4C,EAAK,IAAI1C,EAAO,CAAC,EAAE,IAAI,CAAC,CAAC,GAAKF,EAAE,SAAS4C,EAAK,IAAI1C,EAAO,CAAC,EAAE,IAAI,EAAE,CAAC,EACnF,MAAM,IAAI,MAAM,8BAA8B,OAAOA,EAAO,EAAG,MAAM,EAAE,OAAOA,EAAO,EAAG,KAAK,CAAC,EAEhG,GAAI,CAACF,EAAE,YACL,MAAM,IAAI,MAAM,0BAA0B,EAExCA,EAAE,SAAS,CAAC,IACdA,EAAIA,EAAE,IAAI4C,EAAK,IAAI1C,CAAI,CAAC,GAE1BG,EAAS,IAAI,OAAOH,CAAI,CACzB,CACD,OAAQD,EAAI,CACV,IAAK,GACH,MAAO,GAAG,OAAOD,EAAE,SAAQ,CAAE,EAAE,OAAOK,CAAM,EAC9C,IAAK,GACH,MAAO,GAAG,OAAOL,EAAE,QAAO,CAAE,EAAE,OAAOK,CAAM,EAC7C,IAAK,IACH,MAAO,GAAG,OAAOL,EAAE,cAAa,CAAE,EAAE,OAAOK,CAAM,EACnD,QACE,MAAM,IAAI,MAAM,QAAQ,OAAOJ,EAAM,iBAAiB,CAAC,CAC1D,CACF,CAmFD,SAASnB,EAAO9S,EAAO4B,EAAS,CAC9B,GAAI,OAAOA,GAAY,WAErB,OAAOA,EAAQ5B,CAAK,EAItB,GAAI,CAACA,EAAM,WACT,OAAOA,EAAM,MAAO,EAAG,MAAQA,EAAM,GAAG,CAAC,EAAI,WAAa,YAI5D,IAAIsU,EAAW,OACXC,EACAC,EACJ,GAAI5S,IAAY,SAEVA,EAAQ,WACV0S,EAAW1S,EAAQ,UAIjB,OAAOA,GAAY,SACrB2S,EAAY3S,EACHA,EAAQ,YACjB2S,EAAY3S,EAAQ,WAElBA,EAAQ,WACV4S,EAAW5S,EAAQ,SACf,OAAO4S,GAAa,WACtB,MAAM,IAAI,MAAM,oCAAoC,EAM1D,OAAQF,EAAQ,CACd,IAAK,QACH,OAAOjB,EAAQrT,EAAOuU,CAAS,EACjC,IAAK,cACH,OAAOnB,EAAcpT,EAAOuU,CAAS,EACvC,IAAK,cACH,OAAOpB,EAAcnT,EAAOuU,CAAS,EACvC,IAAK,MACH,OAAOmC,EAAsB1W,EAAO,EAAGwU,CAAQ,EACjD,IAAK,MACH,OAAOkC,EAAsB1W,EAAO,EAAGwU,CAAQ,EACjD,IAAK,MACH,OAAOkC,EAAsB1W,EAAO,GAAIwU,CAAQ,EAClD,IAAK,OACH,CAGE,IAAIgB,EAAW5T,GAAWA,EAAQ,WAAa,OAAYA,EAAQ,SAAW,GAC1E6T,EAAW7T,GAAWA,EAAQ,WAAa,OAAYA,EAAQ,SAAW,EAG9E,GAAI5B,EAAM,SAAU,MAAO,IAG3B,IAAIoB,EACA2T,EAAU/U,EAAM,oBAAoBuU,CAAS,EAC7CsC,EAAM9B,EAAQ,EAClB,OAAI8B,GAAOrB,GAAYqB,EAAMpB,EAE3BrU,EAAM2T,EAAQ,UAGd3T,EAAMgS,EAAcpT,EAAOuU,CAAS,EAI/BnT,EAAI,QAAQ,sBAAuB,UAAY,CACpD,IAAIyR,EAAS,UAAU,CAAC,EACpB4B,EAAI,UAAU,CAAC,EACnB,OAAO5B,IAAW,IAAMA,EAAS4B,EAAIA,CAC/C,CAAS,CACF,CACH,QACE,MAAM,IAAI,MAAM,qBAAuBH,EAAW,kEAAuE,CAC5H,CACF,CAOD,SAASnB,EAAcnT,EAAOuU,EAAW,CAEvC,IAAIE,EAAIzU,EAAM,EACVgV,EAASP,EAAI,IAAM,EAAIA,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAIA,EAAI,EAG3DqC,EAAkB9W,EAAM,IAAI,KAAK,IAAI,GAAI,CAACgV,CAAM,CAAC,EACjD+B,EAAWD,EAAgB,YAAYvC,CAAS,EACpD,OAAIwC,EAAS,QAAQ,GAAG,IAAM,KAC5BA,EAAWD,EAAgB,YAEtBC,EAAW,KAAOtC,GAAK,EAAI,IAAM,IAAMO,EAAO,UACtD,CAUD,SAAS5B,EAAcpT,EAAOuU,EAAW,CACvC,OAAIA,IAAc,OACTvU,EAAM,cAAcuU,EAAY,CAAC,EAEjCvU,EAAM,eAEhB,CAQD,SAASqT,EAAQrT,EAAOuU,EAAW,CACjC,OAAOvU,EAAM,QAAQuU,CAAS,CAChC,WChQA,IAAIvZ,GAAyBY,GAC7B,OAAO,eAAeob,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAGC,GACND,GAAA,SAAGE,GACLF,GAAA,OAAGG,GACHH,GAAA,OAAGlE,GACAkE,GAAA,UAAGI,GACpB,IAAI9Y,GAAWtD,GAAuBuD,EAAwC,EAC1EsB,GAAMC,GACN2W,GAAUlU,GACV8U,GAAaC,GAAA,EAMjB,SAASJ,GAASK,EAAMC,EAAQ,CAC9B,IAAIvG,EAAQsG,EAAK,OAASC,EAAO,OAC7BtG,EAAMqG,EAAK,OACf,OAAOA,EAAK,UAAUtG,EAAOC,CAAG,IAAMsG,CACxC,CAwCA,SAAS1E,GAAO9S,EAAO4B,EAAS,CAC9B,IAAIiS,EAAS4D,GAAQzX,EAAO4B,CAAO,EACnC,OAAIA,MAAetD,GAAS,SAAYsD,CAAO,IAAM,UAAY,aAAcA,GAAWiS,EAAO,OAASjS,EAAQ,SACzGiS,EAAO,UAAU,EAAGjS,EAAQ,SAAW,CAAC,EAAI,MAE9CiS,CACT,CACA,SAAS4D,GAAQzX,EAAO4B,EAAS,CAC/B,GAAI,OAAO5B,GAAU,SACnB,SAAWyW,GAAQ,QAAQzW,EAAO4B,CAAO,EAE3C,MAAQ/B,GAAI,aAAaG,CAAK,EAC5B,SAAWqX,GAAW,QAAQrX,EAAO4B,CAAO,EAK9C,GAAI8V,GAAkB1X,CAAK,EACzB,MAAI,CAAC4B,GAAWA,EAAQ,WAAa,UAE5B5B,EAAM,EAAIA,EAAM,EAAI,IAAMA,EAAM,EAGhCA,EAAM,WAGjB,GAAI,MAAM,QAAQA,CAAK,EACrB,OAAO2X,GAAY3X,EAAO4B,CAAO,EAEnC,MAAQ/B,GAAI,UAAUG,CAAK,EACzB,MAAO,IAAMA,EAAQ,IAEvB,GAAI,OAAOA,GAAU,WACnB,OAAOA,EAAM,OAAS,OAAOA,EAAM,MAAM,EAAI,WAE/C,GAAIA,MAAa1B,GAAS,SAAY0B,CAAK,IAAM,SAAU,CACzD,GAAI,OAAOA,EAAM,QAAW,WAC1B,OAAOA,EAAM,OAAO4B,CAAO,EACtB,GAAI5B,GAASA,EAAM,SAAS4B,CAAO,IAAM,CAAA,EAAG,WAEjD,OAAO5B,EAAM,SAAS4B,CAAO,EAE7B,IAAIgW,EAAU,OAAO,KAAK5X,CAAK,EAAE,IAAI,SAAUzE,EAAK,CAClD,MAAO,IAAMA,EAAM,MAAQuX,GAAO9S,EAAMzE,CAAG,EAAGqG,CAAO,CAC7D,CAAO,EACD,MAAO,IAAMgW,EAAQ,KAAK,IAAI,EAAI,GAErC,CACD,OAAO,OAAO5X,CAAK,CACrB,CAQA,SAASoX,GAAUpX,EAAO,CAIxB,QAHIuX,EAAO,OAAOvX,CAAK,EACnB6X,EAAU,GACVxc,EAAI,EACDA,EAAIkc,EAAK,QAAQ,CACtB,IAAI7M,EAAI6M,EAAK,OAAOlc,CAAC,EACjBqP,IAAM,MACRmN,GAAWnN,EACXrP,IACAqP,EAAI6M,EAAK,OAAOlc,CAAC,GACbqP,IAAM,IAAM,aAAa,QAAQA,CAAC,IAAM,MAC1CmN,GAAW,MAGbA,GAAWnN,GACFA,IAAM,IACfmN,GAAW,MAEXA,GAAWnN,EAEbrP,GACD,CACD,MAAO,IAAMwc,EAAU,GACzB,CAOA,SAASV,GAAOnX,EAAO,CACrB,IAAIuX,EAAO,OAAOvX,CAAK,EACvB,OAAAuX,EAAOA,EAAK,QAAQ,KAAM,OAAO,EAAE,QAAQ,KAAM,QAAQ,EAAE,QAAQ,KAAM,OAAO,EAAE,QAAQ,KAAM,MAAM,EAAE,QAAQ,KAAM,MAAM,EACrHA,CACT,CAYA,SAASI,GAAYzV,EAAON,EAAS,CACnC,GAAI,MAAM,QAAQM,CAAK,EAAG,CAGxB,QAFId,EAAM,IACNf,EAAM6B,EAAM,OACP7G,EAAI,EAAGA,EAAIgF,EAAKhF,IACnBA,IAAM,IACR+F,GAAO,MAETA,GAAOuW,GAAYzV,EAAM7G,CAAC,EAAGuG,CAAO,EAEtC,OAAAR,GAAO,IACAA,CACX,KACI,QAAO0R,GAAO5Q,EAAON,CAAO,CAEhC,CAOA,SAAS8V,GAAkB1X,EAAO,CAChC,OAAOA,MAAa1B,GAAS,SAAY0B,CAAK,IAAM,UAAY,OAAOA,EAAM,GAAM,UAAY,OAAOA,EAAM,GAAM,UAAY,OAAOA,EAAM,GAAM,UAAY,EAC/J,CAQA,SAASiX,GAAYzY,EAAGqX,EAAG,CAEzB,GAAI,IAAKhW,GAAI,UAAUrB,CAAC,EACtB,MAAM,IAAI,UAAU,wGAAgHqB,GAAI,QAAQrB,CAAC,EAAI,aAAa,EAEpK,GAAI,IAAKqB,GAAI,UAAUgW,CAAC,EACtB,MAAM,IAAI,UAAU,wGAAgHhW,GAAI,QAAQgW,CAAC,EAAI,aAAa,EAEpK,OAAOrX,IAAMqX,EAAI,EAAIrX,EAAIqX,EAAI,EAAI,EACnC,WC9MA,OAAO,eAAeiC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAGC,GAUzB,SAASA,GAAeC,EAAQzP,EAAU0P,EAAU,CAClD,GAAI,EAAE,gBAAgBF,IACpB,MAAM,IAAI,YAAY,kDAAkD,EAE1E,KAAK,OAASC,EACd,KAAK,SAAWzP,EAChB,KAAK,SAAW0P,EAChB,KAAK,QAAU,wBAA0B,MAAM,QAAQD,CAAM,EAAI,IAAMA,EAAO,KAAK,IAAI,EAAI,IAAMA,GAAU,KAAO,KAAK,UAAY,MAAQ,KAAO,MAAM,QAAQzP,CAAQ,EAAI,IAAMA,EAAS,KAAK,IAAI,EAAI,IAAMA,GAAY,IAC1N,KAAK,MAAQ,IAAI,MAAK,EAAG,KAC3B,CACAwP,GAAe,UAAY,IAAI,WAC/BA,GAAe,UAAU,YAAc,WACvCA,GAAe,UAAU,KAAO,iBAChCA,GAAe,UAAU,iBAAmB,aC1B5C,OAAO,eAAeG,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAGC,GAWrB,SAASA,GAAWrQ,EAAOmB,EAAKmP,EAAK,CACnC,GAAI,EAAE,gBAAgBD,IACpB,MAAM,IAAI,YAAY,kDAAkD,EAE1E,KAAK,MAAQrQ,EACT,UAAU,OAAS,GACrB,KAAK,IAAM,EACX,KAAK,IAAMmB,IAEX,KAAK,IAAMA,EACX,KAAK,IAAMmP,GAET,KAAK,MAAQ,QAAa,KAAK,MAAQ,KAAK,IAC9C,KAAK,QAAU,uBAAyB,KAAK,MAAQ,MAAQ,KAAK,IAAM,IAC/D,KAAK,MAAQ,QAAa,KAAK,OAAS,KAAK,IACtD,KAAK,QAAU,uBAAyB,KAAK,MAAQ,OAAS,KAAK,IAAM,GAAK,IAE9E,KAAK,QAAU,uBAAyB,KAAK,MAAQ,IAEvD,KAAK,MAAQ,IAAI,MAAK,EAAG,KAC3B,CACAD,GAAW,UAAY,IAAI,WAC3BA,GAAW,UAAU,YAAc,WACnCA,GAAW,UAAU,KAAO,aAC5BA,GAAW,UAAU,aAAe,GCtCpC,OAAO,eAAejW,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAGmW,GACJnW,GAAA,SAAGD,GACLC,GAAA,OAAGoW,GACGpW,GAAA,aAAGqW,GACRrW,GAAA,QAAGsW,GACHtW,GAAA,QAAGuW,GACAvW,GAAA,WAAGwW,GACGxW,GAAA,iBAAGyW,GACXzW,GAAA,SAAG0W,GACJ1W,GAAA,QAAGuF,GACNvF,GAAA,KAAG2W,GACH3W,GAAA,KAAGiF,GACJjF,GAAA,IAAG4W,GACc5W,GAAA,qBAAG6W,GAChB7W,GAAA,QAAG8W,GACJ9W,GAAA,OAAG+W,GACF/W,GAAA,QAAGgX,GACDhX,GAAA,UAAGiX,GACJjX,GAAA,SAAGkX,GACElX,GAAA,cAAGmX,GACxB,IAAI5C,GAAU7a,GACViE,GAAMtB,GACN+a,GAAUxZ,GACVyZ,GAAkBhX,GAClBiX,GAAclC,GAQlB,SAASe,GAAU7Z,EAAG,CAEpB,QADI6H,EAAI,CAAA,EACD,MAAM,QAAQ7H,CAAC,GACpB6H,EAAE,KAAK7H,EAAE,MAAM,EACfA,EAAIA,EAAE,CAAC,EAET,OAAO6H,CACT,CAWA,SAASoT,GAAUvX,EAAOgS,EAAMwF,EAAK,CACnC,IAAIre,EACAgF,EAAM6B,EAAM,OAChB,GAAI7B,IAAQ6T,EAAKwF,CAAG,EAClB,MAAM,IAAIH,GAAgB,eAAelZ,EAAK6T,EAAKwF,CAAG,CAAC,EAEzD,GAAIA,EAAMxF,EAAK,OAAS,EAAG,CAEzB,IAAIyF,EAAUD,EAAM,EACpB,IAAKre,EAAI,EAAGA,EAAIgF,EAAKhF,IAAK,CACxB,IAAI0F,EAAQmB,EAAM7G,CAAC,EACnB,GAAI,CAAC,MAAM,QAAQ0F,CAAK,EACtB,MAAM,IAAIwY,GAAgB,eAAerF,EAAK,OAAS,EAAGA,EAAK,OAAQ,GAAG,EAE5EuF,GAAUvX,EAAM7G,CAAC,EAAG6Y,EAAMyF,CAAO,CAClC,CACL,KAEI,KAAKte,EAAI,EAAGA,EAAIgF,EAAKhF,IACnB,GAAI,MAAM,QAAQ6G,EAAM7G,CAAC,CAAC,EACxB,MAAM,IAAIke,GAAgB,eAAerF,EAAK,OAAS,EAAGA,EAAK,OAAQ,GAAG,CAIlF,CASA,SAASkF,GAASlX,EAAOgS,EAAM,CAC7B,IAAI0F,EAAW1F,EAAK,SAAW,EAC/B,GAAI0F,GAEF,GAAI,MAAM,QAAQ1X,CAAK,EACrB,MAAM,IAAIqX,GAAgB,eAAerX,EAAM,OAAQ,CAAC,OAI1DuX,GAAUvX,EAAOgS,EAAM,CAAC,CAE5B,CAQA,SAASmF,GAAcvR,EAAO6N,EAAQ,CACpC,GAAI,IAAK9V,GAAI,UAAUiI,CAAK,GAAK,IAAK2O,GAAQ,WAAW3O,CAAK,EAC5D,MAAM,IAAI,UAAU,oCAAsCA,EAAQ,GAAG,EAEvE,GAAIA,EAAQ,GAAK,OAAO6N,GAAW,UAAY7N,GAAS6N,EACtD,MAAM,IAAI6D,GAAY,WAAW1R,EAAO6N,CAAM,CAElD,CAYA,SAASsD,GAAO/W,EAAOgS,EAAM2F,EAAc,CAIzC,GAAI,CAAC,MAAM,QAAQ3X,CAAK,GAAK,CAAC,MAAM,QAAQgS,CAAI,EAC9C,MAAM,IAAI,UAAU,gBAAgB,EAEtC,GAAIA,EAAK,SAAW,EAClB,MAAM,IAAI,MAAM,qCAAqC,EAIvDA,EAAK,QAAQ,SAAUlU,EAAO,CAC5B,GAAI,IAAKH,GAAI,UAAUG,CAAK,GAAK,IAAKyW,GAAQ,WAAWzW,CAAK,GAAKA,EAAQ,EACzE,MAAM,IAAI,UAAU,0DAAkEsZ,GAAQ,QAAQpF,CAAI,EAAI,GAAG,CAEvH,CAAG,EAGD,IAAI4F,EAAgBD,IAAiB,OAAYA,EAAe,EAChE,OAAAE,GAAQ7X,EAAOgS,EAAM,EAAG4F,CAAa,EAC9B5X,CACT,CAWA,SAAS6X,GAAQ7X,EAAOgS,EAAMwF,EAAKG,EAAc,CAC/C,IAAIxe,EACA2e,EACAC,EAAS/X,EAAM,OACfgY,EAAShG,EAAKwF,CAAG,EACjBS,EAAS,KAAK,IAAIF,EAAQC,CAAM,EAIpC,GADAhY,EAAM,OAASgY,EACXR,EAAMxF,EAAK,OAAS,EAAG,CAEzB,IAAIyF,EAAUD,EAAM,EAGpB,IAAKre,EAAI,EAAGA,EAAI8e,EAAQ9e,IAEtB2e,EAAO9X,EAAM7G,CAAC,EACT,MAAM,QAAQ2e,CAAI,IACrBA,EAAO,CAACA,CAAI,EACZ9X,EAAM7G,CAAC,EAAI2e,GAEbD,GAAQC,EAAM9F,EAAMyF,EAASE,CAAY,EAI3C,IAAKxe,EAAI8e,EAAQ9e,EAAI6e,EAAQ7e,IAE3B2e,EAAO,CAAA,EACP9X,EAAM7G,CAAC,EAAI2e,EAGXD,GAAQC,EAAM9F,EAAMyF,EAASE,CAAY,CAE/C,KAAS,CAIL,IAAKxe,EAAI,EAAGA,EAAI8e,EAAQ9e,IACtB,KAAO,MAAM,QAAQ6G,EAAM7G,CAAC,CAAC,GAC3B6G,EAAM7G,CAAC,EAAI6G,EAAM7G,CAAC,EAAE,CAAC,EAKzB,IAAKA,EAAI8e,EAAQ9e,EAAI6e,EAAQ7e,IAC3B6G,EAAM7G,CAAC,EAAIwe,CAEd,CACH,CAYA,SAASb,GAAQ9W,EAAOkY,EAAO,CAC7B,IAAIC,EAAY7B,GAAQtW,CAAK,EACzBoY,EAAgBD,EAAU,OAC9B,GAAI,CAAC,MAAM,QAAQnY,CAAK,GAAK,CAAC,MAAM,QAAQkY,CAAK,EAC/C,MAAM,IAAI,UAAU,gBAAgB,EAEtC,GAAIA,EAAM,SAAW,EACnB,MAAM,IAAIb,GAAgB,eAAe,EAAGe,EAAe,IAAI,EAEjEF,EAAQrB,GAAqBqB,EAAOE,CAAa,EACjD,IAAIC,EAAYC,GAAQJ,CAAK,EAC7B,GAAIE,IAAkBC,EACpB,MAAM,IAAIhB,GAAgB,eAAegB,EAAWD,EAAe,IAAI,EAEzE,GAAI,CACF,OAAOG,GAASJ,EAAWD,CAAK,CACjC,OAAQ3F,EAAG,CACV,MAAIA,aAAa8E,GAAgB,eACzB,IAAIA,GAAgB,eAAegB,EAAWD,EAAe,IAAI,EAEnE7F,CACP,CACH,CASA,SAASsE,GAAqBqB,EAAOE,EAAe,CAClD,IAAIC,EAAYC,GAAQJ,CAAK,EACzBM,EAAiBN,EAAM,QACvBO,EAAW,GACXC,EAAgBR,EAAM,QAAQO,CAAQ,EACtCE,EAAwBT,EAAM,QAAQO,EAAUC,EAAgB,CAAC,GAAK,EAC1E,GAAIC,EACF,MAAM,IAAI,MAAM,iCAAiC,EAEnD,IAAIC,EAAcF,GAAiB,EAC/BG,EAAqBT,EAAgBC,IAAc,EACvD,GAAIO,EACF,GAAIC,EACFL,EAAeE,CAAa,EAAI,CAACN,EAAgBC,MAEjD,OAAM,IAAI,MAAM,qCAAuCD,EAAgB,sBAAwB,CAACC,CAAS,EAG7G,OAAOG,CACT,CAOA,SAASF,GAAQtY,EAAO,CACtB,OAAOA,EAAM,OAAO,SAAUL,EAAME,EAAM,CACxC,OAAOF,EAAOE,CACf,EAAE,CAAC,CACN,CAUA,SAAS0Y,GAASvY,EAAOkY,EAAO,CAK9B,QAHIY,EAAW9Y,EACX+Y,EAEKC,EAAYd,EAAM,OAAS,EAAGc,EAAY,EAAGA,IAAa,CACjE,IAAIhH,EAAOkG,EAAMc,CAAS,EAC1BD,EAAY,CAAA,EAIZ,QADItF,EAASqF,EAAS,OAAS9G,EACtB7Y,EAAI,EAAGA,EAAIsa,EAAQta,IAC1B4f,EAAU,KAAKD,EAAS,MAAM3f,EAAI6Y,GAAO7Y,EAAI,GAAK6Y,CAAI,CAAC,EAGzD8G,EAAWC,CACZ,CACD,OAAOD,CACT,CAQA,SAAS9B,GAAQhX,EAAOgS,EAAM,CAI5B,QAHI7N,EAAI6N,GAAQmE,GAAUnW,CAAK,EAGxB,MAAM,QAAQA,CAAK,GAAKA,EAAM,SAAW,GAC9CA,EAAQA,EAAM,CAAC,EACfmE,EAAE,MAAK,EAKT,QADI8U,EAAO9U,EAAE,OACNA,EAAE8U,EAAO,CAAC,IAAM,GACrBA,IAIF,OAAIA,EAAO9U,EAAE,SACXnE,EAAQkZ,GAASlZ,EAAOiZ,EAAM,CAAC,EAC/B9U,EAAE,OAAS8U,GAENjZ,CACT,CAUA,SAASkZ,GAASlZ,EAAOiZ,EAAMzB,EAAK,CAClC,IAAIre,EAAG8Q,EACP,GAAIuN,EAAMyB,EAAM,CACd,IAAIE,EAAO3B,EAAM,EACjB,IAAKre,EAAI,EAAG8Q,EAAKjK,EAAM,OAAQ7G,EAAI8Q,EAAI9Q,IACrC6G,EAAM7G,CAAC,EAAI+f,GAASlZ,EAAM7G,CAAC,EAAG8f,EAAME,CAAI,CAE9C,KACI,MAAO,MAAM,QAAQnZ,CAAK,GACxBA,EAAQA,EAAM,CAAC,EAGnB,OAAOA,CACT,CAcA,SAASiX,GAAUjX,EAAOiZ,EAAMG,EAAOpH,EAAM,CAC3C,IAAI7N,EAAI6N,GAAQmE,GAAUnW,CAAK,EAG/B,GAAIoZ,EACF,QAAS,EAAI,EAAG,EAAIA,EAAO,IACzBpZ,EAAQ,CAACA,CAAK,EACdmE,EAAE,QAAQ,CAAC,EAMf,IADAnE,EAAQqZ,GAAWrZ,EAAOiZ,EAAM,CAAC,EAC1B9U,EAAE,OAAS8U,GAChB9U,EAAE,KAAK,CAAC,EAEV,OAAOnE,CACT,CAUA,SAASqZ,GAAWrZ,EAAOiZ,EAAMzB,EAAK,CACpC,IAAIre,EAAG8Q,EACP,GAAI,MAAM,QAAQjK,CAAK,EAAG,CACxB,IAAImZ,EAAO3B,EAAM,EACjB,IAAKre,EAAI,EAAG8Q,EAAKjK,EAAM,OAAQ7G,EAAI8Q,EAAI9Q,IACrC6G,EAAM7G,CAAC,EAAIkgB,GAAWrZ,EAAM7G,CAAC,EAAG8f,EAAME,CAAI,CAEhD,KACI,SAASG,EAAI9B,EAAK8B,EAAIL,EAAMK,IAC1BtZ,EAAQ,CAACA,CAAK,EAGlB,OAAOA,CACT,CAOA,SAASsW,GAAQtW,EAAO,CACtB,GAAI,CAAC,MAAM,QAAQA,CAAK,EAEtB,OAAOA,EAET,IAAIuZ,EAAO,CAAA,EACX,OAAAvZ,EAAM,QAAQ,SAASjC,EAASD,EAAO,CACjC,MAAM,QAAQA,CAAK,EACrBA,EAAM,QAAQC,CAAQ,EAEtBwb,EAAK,KAAKzb,CAAK,CAErB,CAAG,EACMyb,CACT,CAOA,SAAS3C,GAAI5W,EAAOjC,EAAU,CAC5B,OAAO,MAAM,UAAU,IAAI,KAAKiC,EAAOjC,CAAQ,CACjD,CAOA,SAASwY,GAAQvW,EAAOjC,EAAU,CAChC,MAAM,UAAU,QAAQ,KAAKiC,EAAOjC,CAAQ,CAC9C,CAOA,SAASqY,GAAOpW,EAAOjC,EAAU,CAC/B,GAAIoY,GAAUnW,CAAK,EAAE,SAAW,EAC9B,MAAM,IAAI,MAAM,yCAAyC,EAE3D,OAAO,MAAM,UAAU,OAAO,KAAKA,EAAOjC,CAAQ,CACpD,CASA,SAASsY,GAAarW,EAAOwZ,EAAQ,CACnC,GAAIrD,GAAUnW,CAAK,EAAE,SAAW,EAC9B,MAAM,IAAI,MAAM,yCAAyC,EAE3D,OAAO,MAAM,UAAU,OAAO,KAAKA,EAAO,SAAUyZ,EAAO,CACzD,OAAOD,EAAO,KAAKC,CAAK,CAC5B,CAAG,CACH,CAOA,SAAS9C,GAAK3W,EAAO6D,EAAW,CAC9B,OAAO,MAAM,UAAU,KAAK,KAAK7D,EAAO6D,CAAS,CACnD,CAOA,SAAS6S,GAAS1Y,EAAG,CACnB,GAAI,CAAC,MAAM,QAAQA,CAAC,EAClB,MAAM,IAAI,UAAU,sBAAsB,EAE5C,GAAIA,EAAE,SAAW,EACf,OAAOA,EAET,IAAIC,EAAI,CAAA,EACJyb,EAAQ,EACZzb,EAAE,CAAC,EAAI,CACL,MAAOD,EAAE,CAAC,EACV,WAAY,CAChB,EACE,QAAS7E,EAAI,EAAGA,EAAI6E,EAAE,OAAQ7E,IACxB6E,EAAE7E,CAAC,IAAM6E,EAAE7E,EAAI,CAAC,EAClBugB,IAEAA,EAAQ,EAEVzb,EAAE,KAAK,CACL,MAAOD,EAAE7E,CAAC,EACV,WAAYugB,CAClB,CAAK,EAEH,OAAOzb,CACT,CAOA,SAASuY,GAAWxY,EAAG,CACrB,GAAI,CAAC,MAAM,QAAQA,CAAC,EAClB,MAAM,IAAI,UAAU,sBAAsB,EAE5C,GAAIA,EAAE,SAAW,EACf,OAAOA,EAGT,QADIC,EAAI,CAAA,EACC9E,EAAI,EAAGA,EAAI6E,EAAE,OAAQ7E,IAC5B8E,EAAE,KAAKD,EAAE7E,CAAC,EAAE,KAAK,EAEnB,OAAO8E,CACT,CAWA,SAASwY,GAAiBzW,EAAO7D,EAAQ,CAIvC,QAHI0B,EACA4V,EAAS,EAEJta,EAAI,EAAGA,EAAI6G,EAAM,OAAQ7G,IAAK,CACrC,IAAI8G,EAAOD,EAAM7G,CAAC,EACdoD,EAAU,MAAM,QAAQ0D,CAAI,EAQhC,GALI9G,IAAM,GAAKoD,IACbkX,EAASxT,EAAK,QAIZ1D,GAAW0D,EAAK,SAAWwT,EAC7B,OAEF,IAAIkG,EAAWpd,EAAUka,GAAiBxW,EAAM9D,CAAM,EACpDA,EAAO8D,CAAI,EACb,GAAIpC,IAAS,OACXA,EAAO8b,UACE9b,IAAS8b,EAClB,MAAO,OAIV,CACD,OAAO9b,CACT,CAOA,SAASoH,GAAKjF,EAAO,CACnB,OAAOA,EAAMA,EAAM,OAAS,CAAC,CAC/B,CAKA,SAASuF,GAAQvF,EAAO,CACtB,OAAOA,EAAM,MAAM,EAAGA,EAAM,OAAS,CAAC,CACxC,CAQA,SAASD,GAASC,EAAOC,EAAM,CAC7B,OAAOD,EAAM,QAAQC,CAAI,IAAM,EACjC,CC5lBA,OAAO,eAAe2Z,EAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,EAAA,mBAAGC,GACfD,EAAA,OAAG/Y,GACF+Y,EAAA,QAAGrZ,GACDqZ,EAAA,UAAGE,GACQF,EAAA,qBAAGG,GACVH,EAAA,cAAGI,GACKJ,EAAA,sBAAGK,GAChC,IAAIC,GAASxgB,GACT0F,GAAU/C,GAyBd,SAASkE,GAAQL,EAAMia,EAActZ,EAAQuZ,EAAM,CACjD,SAASC,EAAgBC,EAAO,CAI9B,IAAIC,KAAWnb,GAAQ,aAAakb,EAAOH,EAAa,IAAIF,EAAqB,CAAC,EAClF,OAAAJ,GAAmB3Z,EAAMia,EAAcG,CAAK,EACrCzZ,EAAO0Z,CAAI,CACnB,CACD,OAAAF,EAAgB,UAAY,GAC5BA,EAAgB,GAAKna,EACrBma,EAAgB,aAAeF,EAAa,MAAO,EAAC,KAAI,EACpDC,IACFC,EAAgB,KAAOD,GAElBC,CACT,CAQA,SAASL,GAAcQ,EAAW,CAChC,IAAIC,EAAkB,CAAA,EACtBD,EAAU,QAAQ,SAAUja,EAAS,CACnCka,EAAgBla,EAAQ,EAAE,EAAIA,CAClC,CAAG,EACD,SAASma,EAAmBna,EAASoa,EAAY,CAE/C,MAAI,GAAAb,GAAUvZ,CAAO,OACX2Z,GAAO,UAAU3Z,EAAQ,aAAcoa,EAAW,IAAMA,EAAW,IAAI,GAG3Epa,EAAQ,aAAa,KAAK,SAAU,EAAG,CACzC,OAAOma,EAAmBD,EAAgB,CAAC,EAAGE,CAAU,CAChE,CAAO,GAKJ,CACD,IAAIC,EAAS,CAAA,EACb,SAASC,EAAWta,EAAS,CAE3B,QADIqF,EAAQ,EACLA,EAAQgV,EAAO,QAAU,CAACF,EAAmBE,EAAOhV,CAAK,EAAGrF,CAAO,GACxEqF,IAEFgV,EAAO,OAAOhV,EAAO,EAAGrF,CAAO,CAChC,CAGD,OAAAia,EAAU,OAAOV,EAAS,EAAE,QAAQe,CAAU,EAG9CL,EAAU,OAAO,SAAUja,EAAS,CAClC,MAAO,CAACuZ,GAAUvZ,CAAO,CAC7B,CAAG,EAAE,QAAQsa,CAAU,EACdD,CACT,CAGA,SAAS/Z,GAAO2Z,EAAW,CACzB,IAAIF,EAAQ,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,CAAA,EAChF,OAAAN,GAAcQ,CAAS,EAAE,QAAQ,SAAUja,EAAS,CAClD,OAAOA,EAAQ+Z,CAAK,CACxB,CAAG,EACMA,CACT,CAQA,SAASR,GAAU/gB,EAAK,CACtB,OAAO,OAAOA,GAAQ,YAAc,OAAOA,EAAI,IAAO,UAAY,MAAM,QAAQA,EAAI,YAAY,CAClG,CAWA,SAAS8gB,GAAmB3Z,EAAMia,EAAcG,EAAO,CACrD,IAAIQ,EAAaX,EAAa,OAAO,SAAUQ,EAAY,CACzD,MAAO,CAACZ,GAAqBY,CAAU,CAC3C,CAAG,EACA,MAAM,SAAUA,EAAY,CAC3B,OAAOL,EAAMK,CAAU,IAAM,MACjC,CAAG,EACD,GAAI,CAACG,EAAY,CACf,IAAIC,EAAsBZ,EAAa,OAAO,SAAUQ,EAAY,CAClE,OAAOL,EAAMK,CAAU,IAAM,MACnC,CAAK,EAGD,MAAM,IAAI,MAAM,2BAA4B,OAAOza,EAAM,KAAM,EAAI,kCAAkC,OAAO6a,EAAoB,IAAI,SAAUzB,EAAG,CAC/I,MAAO,IAAK,OAAOA,EAAG,GAAI,CAC3B,CAAA,EAAE,KAAK,IAAI,EAAG,GAAG,CAAC,CACpB,CACH,CACA,SAASS,GAAqBY,EAAY,CACxC,OAAOA,GAAcA,EAAW,CAAC,IAAM,GACzC,CACA,SAASV,GAAsBU,EAAY,CACzC,OAAOA,GAAcA,EAAW,CAAC,IAAM,IAAMA,EAAW,MAAM,CAAC,EAAIA,CACrE,yECvJA,SAASK,EAAgBC,EAAUC,EAAa,CAC9C,GAAI,EAAED,aAAoBC,GACxB,MAAM,IAAI,UAAU,mCAAmC,CAE1D,CACDliB,EAAA,QAAiBgiB,EAAiBhiB,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,2HCLvG,IAAIQ,EAAUE,GAAuB,QACrC,SAASyhB,EAAY,EAAGC,EAAG,CACzB,GAAgB5hB,EAAQ,CAAC,GAArB,UAA0B,CAAC,EAAG,OAAO,EACzC,IAAI+Y,EAAI,EAAE,OAAO,WAAW,EAC5B,GAAeA,IAAX,OAAc,CAChB,IAAIpZ,EAAIoZ,EAAE,KAAK,EAAG6I,GAAK,SAAS,EAChC,GAAgB5hB,EAAQL,CAAC,GAArB,SAAwB,OAAOA,EACnC,MAAM,IAAI,UAAU,8CAA8C,CACnE,CACD,OAAqBiiB,IAAb,SAAiB,OAAS,QAAQ,CAAC,CAC5C,CACDpiB,EAAA,QAAiBmiB,EAAaniB,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,2ECXnG,IAAIQ,EAAUE,GAAuB,QACjCyhB,EAAc9e,KAClB,SAASgf,EAAc5e,EAAG,CACxB,IAAI,EAAI0e,EAAY1e,EAAG,QAAQ,EAC/B,OAAmBjD,EAAQ,CAAC,GAArB,SAAyB,EAAI,OAAO,CAAC,CAC7C,CACDR,EAAA,QAAiBqiB,EAAeriB,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,2ECNrG,IAAIqiB,EAAgB3hB,KACpB,SAAS4hB,EAAkBpiB,EAAQqiB,EAAO,CACxC,QAASpiB,EAAI,EAAGA,EAAIoiB,EAAM,OAAQpiB,IAAK,CACrC,IAAIqiB,EAAaD,EAAMpiB,CAAC,EACxBqiB,EAAW,WAAaA,EAAW,YAAc,GACjDA,EAAW,aAAe,GACtB,UAAWA,IAAYA,EAAW,SAAW,IACjD,OAAO,eAAetiB,EAAQmiB,EAAcG,EAAW,GAAG,EAAGA,CAAU,CACxE,CACF,CACD,SAASC,EAAaP,EAAaQ,EAAYC,EAAa,CAC1D,OAAID,GAAYJ,EAAkBJ,EAAY,UAAWQ,CAAU,EAC/DC,GAAaL,EAAkBJ,EAAaS,CAAW,EAC3D,OAAO,eAAeT,EAAa,YAAa,CAC9C,SAAU,EACd,CAAG,EACMA,CACR,CACDliB,EAAA,QAAiByiB,EAAcziB,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,mCChBhGF,GAAyBY,GAC7B,OAAO,eAAekiB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAGC,GACLD,GAAA,gBAAGE,GACHF,GAAA,gBAAGG,GACLH,GAAA,cAAG9a,GACJ8a,GAAA,aAAGI,GACDJ,GAAA,eAAGK,GACFL,GAAA,gBAAGM,GACAN,GAAA,mBAAGO,GAC7B,IAAI/f,GAAWtD,GAAuBuD,EAAwC,EAC1E+C,GAAUxB,GASd,SAASke,GAAgBpf,EAAQwB,EAAM,CAErC,GAAI4C,GAAcpE,CAAM,GAAKuf,GAAevf,EAAQwB,CAAI,EACtD,OAAOxB,EAAOwB,CAAI,EAEpB,MAAI,OAAOxB,EAAOwB,CAAI,GAAM,YAAc8d,GAAatf,EAAQwB,CAAI,EAC3D,IAAI,MAAM,yBAA2BA,EAAO,iBAAiB,EAE/D,IAAI,MAAM,0BAA4BA,EAAO,GAAG,CACxD,CAYA,SAASge,GAAgBxf,EAAQwB,EAAMJ,EAAO,CAE5C,GAAIgD,GAAcpE,CAAM,GAAKuf,GAAevf,EAAQwB,CAAI,EACtD,OAAAxB,EAAOwB,CAAI,EAAIJ,EACRA,EAET,MAAM,IAAI,MAAM,0BAA4BI,EAAO,GAAG,CACxD,CACA,SAAS2d,GAAkBnf,EAAQ,CACjC,OAAO,OAAO,KAAKA,CAAM,EAAE,OAAO,SAAUwB,EAAM,CAChD,SAAWkB,GAAQ,gBAAgB1C,EAAQwB,CAAI,CACnD,CAAG,CACH,CACA,SAAS6d,GAAgBrf,EAAQwB,EAAM,CACrC,OAAOA,KAAQxB,CACjB,CAQA,SAASuf,GAAevf,EAAQwB,EAAM,CACpC,MAAI,CAACxB,MAAcN,GAAS,SAAYM,CAAM,IAAM,SAC3C,MAID0C,GAAQ,gBAAgBgd,GAAsBle,CAAI,EACjD,GAIL,EAAAA,KAAQ,OAAO,WAQfA,KAAQ,SAAS,UAOvB,CASA,SAASie,GAAmBzf,EAAQ2f,EAAQ,CAC1C,GAAI,CAACL,GAAatf,EAAQ2f,CAAM,EAC9B,MAAM,IAAI,MAAM,wBAA0BA,EAAS,GAAG,CAE1D,CASA,SAASL,GAAatf,EAAQ2f,EAAQ,CAOpC,OANI3f,GAAW,MAAgC,OAAOA,EAAO2f,CAAM,GAAM,eAMjEjd,GAAQ,gBAAgB1C,EAAQ2f,CAAM,GAAK,OAAO,gBAAkBA,KAAU,OAAO,eAAe3f,CAAM,EACzG,MAID0C,GAAQ,gBAAgBkd,GAAmBD,CAAM,EAChD,GAIL,EAAAA,KAAU,OAAO,WAQjBA,KAAU,SAAS,UAOzB,CACA,SAASvb,GAAcpE,EAAQ,CAC7B,SAAWN,GAAS,SAAYM,CAAM,IAAM,UAAYA,GAAUA,EAAO,cAAgB,MAC3F,CACA,IAAI0f,GAAuB,CACzB,OAAQ,GACR,KAAM,EACR,EACIE,GAAoB,CACtB,SAAU,GACV,QAAS,GACT,eAAgB,EAClB,EC9JIxjB,GAAyBY,GAC7B,OAAO,eAAekd,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OACdA,GAAA,OAAG2F,GACK3F,GAAA,eAAG4F,GACR5F,GAAA,UAAG6F,GACP7F,GAAA,MAAG8F,GACA9F,GAAA,SAAG+F,GACnB,IAAIC,GAAmB9jB,GAAuBuD,GAAA,CAAgD,EAC1FwgB,GAAgB/jB,GAAuB8E,GAAA,CAA6C,EACpFkf,GAAWzc,GACX1C,GAAMyX,GACV,SAAS2H,GAA2BtjB,EAAGujB,EAAgB,CAAE,IAAIC,EAAK,OAAO,OAAW,KAAexjB,EAAE,OAAO,QAAQ,GAAKA,EAAE,YAAY,EAAG,GAAI,CAACwjB,EAAI,CAAE,GAAI,MAAM,QAAQxjB,CAAC,IAAMwjB,EAAKC,GAA4BzjB,CAAC,IAAMujB,GAAkBvjB,GAAK,OAAOA,EAAE,QAAW,SAAU,CAAMwjB,IAAIxjB,EAAIwjB,GAAI,IAAI9jB,EAAI,EAAOgkB,EAAI,UAAa,GAAI,MAAO,CAAE,EAAGA,EAAG,EAAG,UAAa,CAAE,OAAIhkB,GAAKM,EAAE,OAAe,CAAE,KAAM,EAAI,EAAW,CAAE,KAAM,GAAO,MAAOA,EAAEN,GAAG,EAAI,EAAI,EAAG,SAAWikB,EAAI,CAAE,MAAMA,CAAG,EAAI,EAAGD,CAAG,CAAG,CAAC,MAAM,IAAI,UAAU;AAAA,mFAAuI,CAAI,CAAC,IAAIE,EAAmB,GAAMC,EAAS,GAAOlX,EAAK,MAAO,CAAE,EAAG,UAAa,CAAE6W,EAAKA,EAAG,KAAKxjB,CAAC,CAAE,EAAI,EAAG,UAAa,CAAE,IAAI8jB,EAAON,EAAG,KAAM,EAAE,OAAAI,EAAmBE,EAAK,KAAaA,CAAO,EAAE,EAAG,SAAWC,EAAK,CAAEF,EAAS,GAAMlX,EAAMoX,CAAM,EAAE,EAAG,UAAa,CAAE,GAAI,CAAM,CAACH,GAAoBJ,EAAG,QAAa,MAAMA,EAAG,OAAS,CAAG,QAAW,CAAE,GAAIK,EAAQ,MAAMlX,CAAI,CAAI,CAAA,CAAK,CAC5+B,SAAS8W,GAA4BzjB,EAAGwe,EAAQ,CAAE,GAAKxe,EAAW,IAAI,OAAOA,GAAM,SAAU,OAAOgkB,GAAkBhkB,EAAGwe,CAAM,EAAG,IAAI,EAAI,OAAO,UAAU,SAAS,KAAKxe,CAAC,EAAE,MAAM,EAAG,EAAE,EAAgE,GAAzD,IAAM,UAAYA,EAAE,cAAa,EAAIA,EAAE,YAAY,MAAU,IAAM,OAAS,IAAM,MAAO,OAAO,MAAM,KAAKA,CAAC,EAAG,GAAI,IAAM,aAAe,2CAA2C,KAAK,CAAC,EAAG,OAAOgkB,GAAkBhkB,EAAGwe,CAAM,EAAI,CACha,SAASwF,GAAkB3O,EAAK3Q,EAAK,EAAMA,GAAO,MAAQA,EAAM2Q,EAAI,UAAQ3Q,EAAM2Q,EAAI,QAAQ,QAAS3V,EAAI,EAAGukB,EAAO,IAAI,MAAMvf,CAAG,EAAGhF,EAAIgF,EAAKhF,IAAOukB,EAAKvkB,CAAC,EAAI2V,EAAI3V,CAAC,EAAK,OAAOukB,CAAO,CASvL,IAAIC,GAAiC,UAAY,CAC/C,SAASA,EAAkBjhB,EAAQ,IAC7BkgB,GAAiB,SAAY,KAAMe,CAAiB,EACxD,KAAK,cAAgBjhB,CACtB,CACD,SAAImgB,GAAc,SAAYc,EAAmB,CAAC,CAChD,IAAK,OACL,MAAO,UAAgB,CACrB,OAAO,OAAO,KAAK,KAAK,aAAa,CACtC,CACL,EAAK,CACD,IAAK,MACL,MAAO,SAAatkB,EAAK,CACvB,SAAWyjB,GAAS,iBAAiB,KAAK,cAAezjB,CAAG,CAC7D,CACL,EAAK,CACD,IAAK,MACL,MAAO,SAAaA,EAAKyE,EAAO,CAC9B,SAAIgf,GAAS,iBAAiB,KAAK,cAAezjB,EAAKyE,CAAK,EACrD,IACR,CACL,EAAK,CACD,IAAK,MACL,MAAO,SAAazE,EAAK,CACvB,SAAWyjB,GAAS,iBAAiB,KAAK,cAAezjB,CAAG,CAC7D,CACF,CAAA,CAAC,EACKskB,CACT,IAMyB/G,GAAA,kBAAG+G,GAC5B,SAASnB,IAAiB,CACxB,OAAO,IAAI,GACb,CAQA,SAASC,GAAUmB,EAAa,CAC9B,GAAI,CAACA,EACH,OAAOpB,GAAc,EAEvB,GAAIE,GAAMkB,CAAW,EACnB,OAAOA,EAET,MAAQjgB,GAAI,UAAUigB,CAAW,EAC/B,OAAO,IAAID,GAAkBC,CAAW,EAE1C,MAAM,IAAI,MAAM,gDAAgD,CAClE,CAQA,SAASjB,GAAS/F,EAAK,CACrB,GAAIA,aAAe+G,GACjB,OAAO/G,EAAI,cAEb,IAAIla,EAAS,CAAA,EACTmhB,EAAYd,GAA2BnG,EAAI,KAAI,CAAE,EACnDkH,EACF,GAAI,CACF,IAAKD,EAAU,EAAC,EAAI,EAAEC,EAAQD,EAAU,EAAG,GAAE,MAAO,CAClD,IAAIxkB,EAAMykB,EAAM,MACZhgB,EAAQ8Y,EAAI,IAAIvd,CAAG,KACnByjB,GAAS,iBAAiBpgB,EAAQrD,EAAKyE,CAAK,CACjD,CACF,OAAQsI,EAAK,CACZyX,EAAU,EAAEzX,CAAG,CACnB,QAAY,CACRyX,EAAU,EAAC,CACZ,CACD,OAAOnhB,CACT,CAUA,SAASggB,GAAMhgB,EAAQ,CAGrB,OAAKA,EAGEA,aAAkB,KAAOA,aAAkBihB,IAAqB,OAAOjhB,EAAO,KAAQ,YAAc,OAAOA,EAAO,KAAQ,YAAc,OAAOA,EAAO,MAAS,YAAc,OAAOA,EAAO,KAAQ,WAFjM,EAGX,CASA,SAAS6f,GAAO3F,EAAK,CACnB,QAASmH,EAAO,UAAU,OAAQC,EAAU,IAAI,MAAMD,EAAO,EAAIA,EAAO,EAAI,CAAC,EAAGE,EAAO,EAAGA,EAAOF,EAAME,IACrGD,EAAQC,EAAO,CAAC,EAAI,UAAUA,CAAI,EAEpC,QAASC,EAAK,EAAGC,EAAWH,EAASE,EAAKC,EAAS,OAAQD,IAAM,CAC/D,IAAIvY,EAAOwY,EAASD,CAAE,EACtB,GAAKvY,GAGL,GAAI+W,GAAM/W,CAAI,EAAG,CACf,IAAIyY,EAAarB,GAA2BpX,EAAK,KAAI,CAAE,EACrD0Y,EACF,GAAI,CACF,IAAKD,EAAW,EAAC,EAAI,EAAEC,EAASD,EAAW,EAAG,GAAE,MAAO,CACrD,IAAI/kB,EAAMglB,EAAO,MACjBzH,EAAI,IAAIvd,EAAKsM,EAAK,IAAItM,CAAG,CAAC,CAC3B,CACF,OAAQ+M,EAAK,CACZgY,EAAW,EAAEhY,CAAG,CACxB,QAAgB,CACRgY,EAAW,EAAC,CACb,CACF,YAAczgB,GAAI,UAAUgI,CAAI,EAC/B,QAAS2Y,EAAM,EAAGC,EAAe,OAAO,KAAK5Y,CAAI,EAAG2Y,EAAMC,EAAa,OAAQD,IAAO,CACpF,IAAIE,EAAQD,EAAaD,CAAG,EAC5B1H,EAAI,IAAI4H,EAAO7Y,EAAK6Y,CAAK,CAAC,CAC3B,EAEJ,CACD,OAAO5H,CACT,CCpKA,IAAI9d,GAAyBY,GAC7B,OAAO,eAAe0H,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIzD,GAAMtB,GACNoiB,GAAiB3lB,GAAuB8E,GAAA,CAAyB,EACjE2W,GAAUlU,GACVqe,GAAWtJ,EACXuJ,GAAOC,GAwCPC,GAAgB,UAAwB,CAG1C,OAAAA,GAAgBJ,GAAe,QAAW,OACnCA,GAAe,OACxB,EACItE,GAAe,CAAC,aAAc,WAAY,eAAgB,WAAW,EAOrE2E,MAAiCJ,GAAS,SAAS,QAASvE,GAAc,SAAqB4E,EAAM,CACvG,IAAIC,EAAYD,EAAK,UACnBE,EAAUF,EAAK,QACfG,EAAcH,EAAK,YACnBI,EAAWJ,EAAK,SAId3d,EAAQyd,KAKZ,OAAAzd,EAAM,MAAK,EACXA,EAAM,SAAS,CAAC,CACd,KAAM,SACN,KAAMzD,GAAI,QACd,EAAK,CACD,KAAM,UACN,KAAMA,GAAI,SACd,EAAK,CACD,KAAM,YACN,KAAMA,GAAI,WACd,EAAK,CACD,KAAM,WACN,KAAMA,GAAI,UACd,EAAK,CACD,KAAM,OACN,KAAMA,GAAI,MACX,EAKD,CACE,KAAM,aACN,KAAM,SAAcwG,EAAG,CACrB,OAAOxG,GAAI,UAAY,+1eAA+1e,KAAKwG,CAAC,CAC73e,CACL,EAAK,CACD,KAAM,SACN,KAAMxG,GAAI,QACd,EAAK,CACD,KAAM,QACN,KAAMA,GAAI,OACd,EAAK,CACD,KAAM,QACN,KAAMA,GAAI,OACd,EAAK,CACD,KAAM,SACN,KAAMA,GAAI,QACd,EAAK,CACD,KAAM,cACN,KAAMA,GAAI,aACd,EAAK,CACD,KAAM,eACN,KAAMA,GAAI,cACd,EAAK,CACD,KAAM,QACN,KAAMA,GAAI,OACd,EAAK,CACD,KAAM,QACN,KAAMA,GAAI,OACd,EAAK,CACD,KAAM,UACN,KAAMA,GAAI,SACd,EAAK,CACD,KAAM,YACN,KAAMA,GAAI,WACd,EAAK,CACD,KAAM,OACN,KAAMA,GAAI,MACd,EAAK,CACD,KAAM,WACN,KAAMA,GAAI,UACd,EAAK,CACD,KAAM,OACN,KAAMA,GAAI,MACd,EAAK,CACD,KAAM,SACN,KAAMA,GAAI,QACd,EAAK,CACD,KAAM,OACN,KAAMA,GAAI,MACd,EAAK,CACD,KAAM,YACN,KAAMA,GAAI,WACd,EAAK,CACD,KAAM,eACN,KAAMA,GAAI,cACd,EAAK,CACD,KAAM,YACN,KAAMA,GAAI,WACd,EAAK,CACD,KAAM,iBACN,KAAMA,GAAI,gBACd,EAAK,CACD,KAAM,YACN,KAAMA,GAAI,WACd,EAAK,CACD,KAAM,kBACN,KAAMA,GAAI,iBACd,EAAK,CACD,KAAM,eACN,KAAMA,GAAI,cACd,EAAK,CACD,KAAM,eACN,KAAMA,GAAI,cACd,EAAK,CACD,KAAM,yBACN,KAAMA,GAAI,wBACd,EAAK,CACD,KAAM,YACN,KAAMA,GAAI,WACd,EAAK,CACD,KAAM,OACN,KAAMA,GAAI,MACd,EAAK,CACD,KAAM,aACN,KAAMA,GAAI,YACd,EAAK,CACD,KAAM,eACN,KAAMA,GAAI,cACd,EAAK,CACD,KAAM,kBACN,KAAMA,GAAI,iBACd,EAAK,CACD,KAAM,YACN,KAAMA,GAAI,WACd,EAAK,CACD,KAAM,iBACN,KAAMA,GAAI,gBACd,EAAK,CACD,KAAM,aACN,KAAMA,GAAI,YACd,EAAK,CACD,KAAM,MACN,KAAMghB,GAAK,KACf,EAAK,CACD,KAAM,SACN,KAAMhhB,GAAI,QACX,CACH,CAAG,EAEDyD,EAAM,eAAe,CAAC,CACpB,KAAM,SACN,GAAI,YACJ,QAAS,SAAiB9E,EAAG,CAM3B,GALK0iB,GACHI,GAAiB9iB,CAAC,KAIZiY,GAAQ,QAAQjY,CAAC,EAAI,GAC3B,MAAM,IAAI,UAAU,uFAA8FA,EAAI,uDAA4D,EAEpL,OAAO,IAAI0iB,EAAU1iB,CAAC,CACvB,CACL,EAAK,CACD,KAAM,SACN,GAAI,UACJ,QAAS,SAAiBA,EAAG,CAC3B,OAAK2iB,GACHI,GAAe/iB,CAAC,EAEX,IAAI2iB,EAAQ3iB,EAAG,CAAC,CACxB,CACL,EAAK,CACD,KAAM,YACN,GAAI,UACJ,QAAS,SAAiBA,EAAG,CAC3B,OAAK2iB,GACHI,GAAe/iB,CAAC,EAEX,IAAI2iB,EAAQ3iB,EAAE,SAAU,EAAE,CAAC,CACnC,CACL,EAAK,CACD,KAAM,WACN,GAAI,YACJ,QAAS,SAAiBA,EAAG,CAC3B,MAAM,IAAI,UAAU,2JAAgK,CACrL,CACL,EAAK,CACD,KAAM,WACN,GAAI,UACJ,QAAS,SAAiBA,EAAG,CAC3B,OAAK2iB,GACHI,GAAe/iB,CAAC,EAEX,IAAI2iB,EAAQ3iB,EAAE,QAAS,EAAE,CAAC,CAClC,CACL,EAAK,CACD,KAAM,SACN,GAAI,WACJ,QAAS,SAAiBA,EAAG,CACtB6iB,GACHG,GAAgBhjB,CAAC,EAEnB,IAAIijB,EAAI,IAAIJ,EAAS7iB,CAAC,EACtB,GAAIijB,EAAE,QAAS,IAAKjjB,EAClB,MAAM,IAAI,UAAU,mGAA0GA,EAAI,qDAA0D,EAE9L,OAAOijB,CACR,CACL,EAAK,CAQD,KAAM,SACN,GAAI,SACJ,QAAS,SAAiBjjB,EAAG,CAC3B,IAAIwV,EAAI,OAAOxV,CAAC,EAChB,GAAI,MAAMwV,CAAC,EACT,MAAM,IAAI,MAAM,mBAAqBxV,EAAI,eAAe,EAE1D,OAAOwV,CACR,CACL,EAAK,CACD,KAAM,SACN,GAAI,YACJ,QAAS,SAAiBxV,EAAG,CACtB0iB,GACHI,GAAiB9iB,CAAC,EAEpB,GAAI,CACF,OAAO,IAAI0iB,EAAU1iB,CAAC,CACvB,MAAa,CACZ,MAAM,IAAI,MAAM,mBAAqBA,EAAI,gBAAgB,CAC1D,CACF,CACL,EAAK,CACD,KAAM,SACN,GAAI,WACJ,QAAS,SAAiBA,EAAG,CACtB6iB,GACHG,GAAgBhjB,CAAC,EAEnB,GAAI,CACF,OAAO,IAAI6iB,EAAS7iB,CAAC,CACtB,MAAa,CACZ,MAAM,IAAI,MAAM,mBAAqBA,EAAI,eAAe,CACzD,CACF,CACL,EAAK,CACD,KAAM,SACN,GAAI,UACJ,QAAS,SAAiBA,EAAG,CACtB2iB,GACHI,GAAe/iB,CAAC,EAElB,GAAI,CACF,OAAO,IAAI2iB,EAAQ3iB,CAAC,CACrB,MAAa,CACZ,MAAM,IAAI,MAAM,mBAAqBA,EAAI,cAAc,CACxD,CACF,CACL,EAAK,CACD,KAAM,UACN,GAAI,SACJ,QAAS,SAAiBA,EAAG,CAC3B,MAAO,CAACA,CACT,CACL,EAAK,CACD,KAAM,UACN,GAAI,YACJ,QAAS,SAAiBA,EAAG,CAC3B,OAAK0iB,GACHI,GAAiB9iB,CAAC,EAEb,IAAI0iB,EAAU,CAAC1iB,CAAC,CACxB,CACL,EAAK,CACD,KAAM,UACN,GAAI,WACJ,QAAS,SAAiBA,EAAG,CAC3B,OAAK6iB,GACHG,GAAgBhjB,CAAC,EAEZ,IAAI6iB,EAAS,CAAC7iB,CAAC,CACvB,CACL,EAAK,CACD,KAAM,UACN,GAAI,SACJ,QAAS,SAAiBA,EAAG,CAC3B,OAAO,OAAOA,CAAC,CAChB,CACL,EAAK,CACD,KAAM,QACN,GAAI,SACJ,QAAS,SAAiB0D,EAAO,CAC/B,OAAKkf,GACHM,KAEK,IAAIN,EAAYlf,CAAK,CAC7B,CACL,EAAK,CACD,KAAM,SACN,GAAI,QACJ,QAAS,SAAiByf,EAAQ,CAChC,OAAOA,EAAO,SACf,CACF,CAAA,CAAC,EAMFre,EAAM,WAAa,SAAUlB,EAAMyF,EAAMK,EAAY,CACnD,IAAI0Z,EAAate,EAAM,YAAYlB,EAAMyF,EAAMK,CAAU,EACzD,GAAI,CAAC,YAAa,UAAU,EAAE,SAAS0Z,EAAW,KAAK,QAAQ,GAAK/Z,EAAK,SAAW,MAAShI,GAAI,cAAcgI,EAAK,CAAC,CAAC,GAEtHK,EAAW,KAAK,SAAU2Z,EAAK,CAC7B,MAAO,CAACA,EAAI,OAAO,SAAS,GAAG,CACrC,CAAK,EAAG,CACF,IAAIvZ,EAAM,IAAI,UAAU,aAAa,OAAOlG,EAAM,0CAA0C,EAAI,4CAA4C,OAAOA,EAAM,KAAK,CAAC,EAC/J,MAAAkG,EAAI,KAAOsZ,EAAW,KAChBtZ,CACP,CACD,MAAMsZ,CACV,EAMEte,EAAM,WAAa,SAAUlB,EAAMyF,EAAMK,EAAY,CACnD,IAAI0Z,EAAate,EAAM,YAAYlB,EAAMyF,EAAMK,CAAU,EACzD,GAAI,CAAC,YAAa,UAAU,EAAE,SAAS0Z,EAAW,KAAK,QAAQ,GAAK/Z,EAAK,SAAW,MAAShI,GAAI,cAAcgI,EAAK,CAAC,CAAC,GAEtHK,EAAW,KAAK,SAAU2Z,EAAK,CAC7B,MAAO,CAACA,EAAI,OAAO,SAAS,GAAG,CACrC,CAAK,EAAG,CACF,IAAIvZ,EAAM,IAAI,UAAU,aAAa,OAAOlG,EAAM,0CAA0C,EAAI,4CAA4C,OAAOA,EAAM,KAAK,CAAC,EAC/J,MAAAkG,EAAI,KAAOsZ,EAAW,KAChBtZ,CACP,CACD,MAAMsZ,CACV,EACSte,CACT,CAAC,EACkBA,GAAA,YAAG0d,GACtB,SAASM,GAAiB9iB,EAAG,CAC3B,MAAM,IAAI,MAAM,wBAAwB,OAAOA,EAAG,kDAAkD,CAAC,CACvG,CACA,SAAS+iB,GAAe/iB,EAAG,CACzB,MAAM,IAAI,MAAM,wBAAwB,OAAOA,EAAG,qDAAqD,CAAC,CAC1G,CACA,SAASkjB,IAAgB,CACvB,MAAM,IAAI,MAAM,qEAAuE,CACzF,CACA,SAASF,GAAgBhjB,EAAG,CAC1B,MAAM,IAAI,MAAM,wBAAwB,OAAOA,EAAG,iDAAiD,CAAC,CACtG,WClaA,OAAO,eAAesjB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIlB,GAAWhlB,EACXwG,GAAO,YACPia,GAAe,CAAA,EACf0F,MAAqCnB,GAAS,SAASxe,GAAMia,GAAc,UAAY,CAOzF,SAASyF,EAAUlK,EAAS,CAC1B,GAAI,EAAE,gBAAgBkK,GACpB,MAAM,IAAI,YAAY,kDAAkD,EAE1E,KAAK,QAAUlK,GAAW,EAC3B,CAKD,OAAAkK,EAAU,UAAU,KAAO,YAC3BA,EAAU,UAAU,YAAc,GAOlCA,EAAU,UAAU,QAAU,UAAY,CACxC,OAAO,KAAK,OAChB,EAOEA,EAAU,UAAU,SAAW,UAAY,CACzC,MAAO,IAAM,KAAK,QAAQ,KAAK,IAAI,EAAI,GAC3C,EAQEA,EAAU,UAAU,OAAS,UAAY,CACvC,MAAO,CACL,OAAQ,YACR,QAAS,KAAK,OACpB,CACA,EASEA,EAAU,SAAW,SAAUE,EAAM,CACnC,OAAO,IAAIF,EAAUE,EAAK,OAAO,CACrC,EACSF,CACT,EAAG,CACD,QAAS,EACX,CAAC,EACDA,GAAA,gBAA0BC,4EC1ExB,SAAUE,EAAa,CAIzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAcE,IAAIC,EAAY,KAIdC,EAAa,IAGbC,EAAW,mBAGXC,EAAO,qgCAGPC,EAAK,qgCAILC,EAAW,CAOT,UAAW,GAiBX,SAAU,EAeV,OAAQ,EAIR,SAAU,GAIV,SAAW,GAIX,KAAM,CAACL,EAIP,KAAMA,EAGN,OAAQ,EACT,EAMDM,EAASC,EAASC,EAAYC,EAC9BC,EAAW,GAEXC,EAAe,kBACfC,EAAkBD,EAAe,qBACjCE,EAAyBF,EAAe,2BACxCG,EAAoBH,EAAe,qBACnCI,EAAM,mBAENC,EAAY,KAAK,MACjBC,EAAU,KAAK,IAEfC,EAAW,6CACXC,EAAQ,yDACRC,EAAU,gDACVC,EAAY,qCAEZC,EAAO,IACPC,EAAW,EACXC,EAAmB,iBAEnBC,EAAiBtB,EAAK,OAAS,EAC/BuB,EAAetB,EAAG,OAAS,EAG3B,EAAI,CAAE,YAAaW,GA0ErB,EAAE,cAAgB,EAAE,IAAM,UAAY,CACpC,IAAIzkB,EAAI,IAAI,KAAK,YAAY,IAAI,EACjC,OAAIA,EAAE,EAAI,IAAGA,EAAE,EAAI,GACZqlB,EAASrlB,CAAC,CACrB,EAQE,EAAE,KAAO,UAAY,CACnB,OAAOqlB,EAAS,IAAI,KAAK,YAAY,IAAI,EAAG,KAAK,EAAI,EAAG,CAAC,CAC7D,EAWE,EAAE,UAAY,EAAE,MAAQ,SAAU5a,EAAKmP,EAAK,CAC1C,IAAI0L,EACFtlB,EAAI,KACJulB,EAAOvlB,EAAE,YAGX,GAFAyK,EAAM,IAAI8a,EAAK9a,CAAG,EAClBmP,EAAM,IAAI2L,EAAK3L,CAAG,EACd,CAACnP,EAAI,GAAK,CAACmP,EAAI,EAAG,OAAO,IAAI2L,EAAK,GAAG,EACzC,GAAI9a,EAAI,GAAGmP,CAAG,EAAG,MAAM,MAAM0K,EAAkB1K,CAAG,EAClD,OAAA0L,EAAItlB,EAAE,IAAIyK,CAAG,EACN6a,EAAI,EAAI7a,EAAMzK,EAAE,IAAI4Z,CAAG,EAAI,EAAIA,EAAM,IAAI2L,EAAKvlB,CAAC,CAC1D,EAWE,EAAE,WAAa,EAAE,IAAM,SAAUqX,EAAG,CAClC,IAAIxa,EAAG2oB,EAAGC,EAAKC,EACb1lB,EAAI,KACJ2lB,GAAK3lB,EAAE,EACP4lB,IAAMvO,EAAI,IAAIrX,EAAE,YAAYqX,CAAC,GAAG,EAChCwO,GAAK7lB,EAAE,EACP8lB,GAAKzO,EAAE,EAGT,GAAI,CAACsO,IAAM,CAACC,GACV,MAAO,CAACC,IAAM,CAACC,GAAK,IAAMD,KAAOC,GAAKD,GAAKF,KAAOC,GAAK,EAAI,CAACD,GAAKE,GAAK,EAAI,EAAI,GAIhF,GAAI,CAACF,GAAG,CAAC,GAAK,CAACC,GAAG,CAAC,EAAG,OAAOD,GAAG,CAAC,EAAIE,GAAKD,GAAG,CAAC,EAAI,CAACE,GAAK,EAGxD,GAAID,KAAOC,GAAI,OAAOD,GAGtB,GAAI7lB,EAAE,IAAMqX,EAAE,EAAG,OAAOrX,EAAE,EAAIqX,EAAE,EAAIwO,GAAK,EAAI,EAAI,GAMjD,IAJAJ,EAAME,GAAG,OACTD,EAAME,GAAG,OAGJ/oB,EAAI,EAAG2oB,EAAIC,EAAMC,EAAMD,EAAMC,EAAK7oB,EAAI2oB,EAAG,EAAE3oB,EAC9C,GAAI8oB,GAAG9oB,CAAC,IAAM+oB,GAAG/oB,CAAC,EAAG,OAAO8oB,GAAG9oB,CAAC,EAAI+oB,GAAG/oB,CAAC,EAAIgpB,GAAK,EAAI,EAAI,GAI3D,OAAOJ,IAAQC,EAAM,EAAID,EAAMC,EAAMG,GAAK,EAAI,EAAI,EACtD,EAgBE,EAAE,OAAS,EAAE,IAAM,UAAY,CAC7B,IAAIE,EAAIC,EACNhmB,EAAI,KACJulB,EAAOvlB,EAAE,YAEX,OAAKA,EAAE,EAGFA,EAAE,EAAE,CAAC,GAEV+lB,EAAKR,EAAK,UACVS,EAAKT,EAAK,SACVA,EAAK,UAAYQ,EAAK,KAAK,IAAI/lB,EAAE,EAAGA,EAAE,GAAI,CAAA,EAAIilB,EAC9CM,EAAK,SAAW,EAEhBvlB,EAAIimB,EAAOV,EAAMW,GAAiBX,EAAMvlB,CAAC,CAAC,EAE1CulB,EAAK,UAAYQ,EACjBR,EAAK,SAAWS,EAETX,EAASlB,GAAY,GAAKA,GAAY,EAAInkB,EAAE,IAAG,EAAKA,EAAG+lB,EAAIC,EAAI,EAAI,GAZtD,IAAIT,EAAK,CAAC,EAHb,IAAIA,EAAK,GAAG,CAgBjC,EAmBE,EAAE,SAAW,EAAE,KAAO,UAAY,CAChC,IAAItP,EAAGkQ,EAAG3Q,EAAGsJ,EAAGsH,EAAKve,EAAGwe,GAAIlmB,GAAGmmB,GAAIC,GACjCvmB,GAAI,KACJulB,GAAOvlB,GAAE,YAEX,GAAI,CAACA,GAAE,SAAQ,GAAMA,GAAE,OAAM,EAAI,OAAO,IAAIulB,GAAKvlB,EAAC,EAoClD,IAnCAokB,EAAW,GAGXvc,EAAI7H,GAAE,EAAI2kB,EAAQ3kB,GAAE,EAAIA,GAAG,EAAI,CAAC,EAI5B,CAAC6H,GAAK,KAAK,IAAIA,CAAC,GAAK,KACvB2N,EAAIgR,EAAexmB,GAAE,CAAC,EACtBiW,EAAIjW,GAAE,GAGF6H,GAAKoO,EAAIT,EAAE,OAAS,GAAK,KAAGA,GAAM3N,GAAK,GAAKA,GAAK,GAAK,IAAM,MAChEA,EAAI8c,EAAQnP,EAAG,EAAI,CAAC,EAGpBS,EAAIyO,GAAWzO,EAAI,GAAK,CAAC,GAAKA,EAAI,IAAMA,EAAI,EAAI,GAAK,IAEjDpO,GAAK,IACP2N,EAAI,KAAOS,GAEXT,EAAI3N,EAAE,gBACN2N,EAAIA,EAAE,MAAM,EAAGA,EAAE,QAAQ,GAAG,EAAI,CAAC,EAAIS,GAGvC6I,EAAI,IAAIyG,GAAK/P,CAAC,EACdsJ,EAAE,EAAI9e,GAAE,GAER8e,EAAI,IAAIyG,GAAK1d,EAAE,SAAU,CAAA,EAG3Bwe,IAAMpQ,EAAIsP,GAAK,WAAa,IAW1B,GANAplB,GAAI2e,EACJwH,GAAKnmB,GAAE,MAAMA,EAAC,EAAE,MAAMA,EAAC,EACvBomB,GAAUD,GAAG,KAAKtmB,EAAC,EACnB8e,EAAI2H,EAAOF,GAAQ,KAAKvmB,EAAC,EAAE,MAAMG,EAAC,EAAGomB,GAAQ,KAAKD,EAAE,EAAGD,GAAK,EAAG,CAAC,EAG5DG,EAAermB,GAAE,CAAC,EAAE,MAAM,EAAGkmB,EAAE,KAAO7Q,EAAIgR,EAAe1H,EAAE,CAAC,GAAG,MAAM,EAAGuH,EAAE,EAK5E,GAJA7Q,EAAIA,EAAE,MAAM6Q,GAAK,EAAGA,GAAK,CAAC,EAItB7Q,GAAK,QAAU,CAAC4Q,GAAO5Q,GAAK,OAAQ,CAItC,GAAI,CAAC4Q,IACHf,EAASllB,GAAG8V,EAAI,EAAG,CAAC,EAEhB9V,GAAE,MAAMA,EAAC,EAAE,MAAMA,EAAC,EAAE,GAAGH,EAAC,GAAG,CAC7B8e,EAAI3e,GACJ,KACD,CAGHkmB,IAAM,EACND,EAAM,CAChB,KAAe,EAID,CAAC,CAAC5Q,GAAK,CAAC,CAACA,EAAE,MAAM,CAAC,GAAKA,EAAE,OAAO,CAAC,GAAK,OAGxC6P,EAASvG,EAAG7I,EAAI,EAAG,CAAC,EACpBkQ,EAAI,CAACrH,EAAE,MAAMA,CAAC,EAAE,MAAMA,CAAC,EAAE,GAAG9e,EAAC,GAG/B,KACD,CAIL,OAAAokB,EAAW,GAEJiB,EAASvG,EAAG7I,EAAGsP,GAAK,SAAUY,CAAC,CAC1C,EAOE,EAAE,cAAgB,EAAE,GAAK,UAAY,CACnC,IAAI,EACFnJ,EAAI,KAAK,EACTxH,EAAI,IAEN,GAAIwH,EAAG,CAML,GALA,EAAIA,EAAE,OAAS,EACfxH,GAAK,EAAIkP,EAAU,KAAK,EAAIO,CAAQ,GAAKA,EAGzC,EAAIjI,EAAE,CAAC,EACH,EAAG,KAAO,EAAI,IAAM,EAAG,GAAK,GAAIxH,IAChCA,EAAI,IAAGA,EAAI,EAChB,CAED,OAAOA,CACX,EAwBE,EAAE,UAAY,EAAE,IAAM,SAAU6B,EAAG,CACjC,OAAOoP,EAAO,KAAM,IAAI,KAAK,YAAYpP,CAAC,CAAC,CAC/C,EAQE,EAAE,mBAAqB,EAAE,SAAW,SAAUA,EAAG,CAC/C,IAAIrX,EAAI,KACNulB,EAAOvlB,EAAE,YACX,OAAOqlB,EAASoB,EAAOzmB,EAAG,IAAIulB,EAAKlO,CAAC,EAAG,EAAG,EAAG,CAAC,EAAGkO,EAAK,UAAWA,EAAK,QAAQ,CAClF,EAOE,EAAE,OAAS,EAAE,GAAK,SAAUlO,EAAG,CAC7B,OAAO,KAAK,IAAIA,CAAC,IAAM,CAC3B,EAQE,EAAE,MAAQ,UAAY,CACpB,OAAOgO,EAAS,IAAI,KAAK,YAAY,IAAI,EAAG,KAAK,EAAI,EAAG,CAAC,CAC7D,EAQE,EAAE,YAAc,EAAE,GAAK,SAAUhO,EAAG,CAClC,OAAO,KAAK,IAAIA,CAAC,EAAI,CACzB,EAQE,EAAE,qBAAuB,EAAE,IAAM,SAAUA,EAAG,CAC5C,IAAIiO,EAAI,KAAK,IAAIjO,CAAC,EAClB,OAAOiO,GAAK,GAAKA,IAAM,CAC3B,EA4BE,EAAE,iBAAmB,EAAE,KAAO,UAAY,CACxC,IAAIA,EAAG9P,EAAGuQ,EAAIC,EAAInkB,EAChB7B,EAAI,KACJulB,GAAOvlB,EAAE,YACT0mB,GAAM,IAAInB,GAAK,CAAC,EAElB,GAAI,CAACvlB,EAAE,SAAU,EAAE,OAAO,IAAIulB,GAAKvlB,EAAE,EAAI,IAAQ,GAAG,EACpD,GAAIA,EAAE,SAAU,OAAO0mB,GAEvBX,EAAKR,GAAK,UACVS,EAAKT,GAAK,SACVA,GAAK,UAAYQ,EAAK,KAAK,IAAI/lB,EAAE,EAAGA,EAAE,GAAI,CAAA,EAAI,EAC9CulB,GAAK,SAAW,EAChB1jB,EAAM7B,EAAE,EAAE,OAON6B,EAAM,IACRyjB,EAAI,KAAK,KAAKzjB,EAAM,CAAC,EACrB2T,GAAK,EAAImR,GAAQ,EAAGrB,CAAC,GAAG,aAExBA,EAAI,GACJ9P,EAAI,gCAGNxV,EAAI4mB,GAAarB,GAAM,EAAGvlB,EAAE,MAAMwV,CAAC,EAAG,IAAI+P,GAAK,CAAC,EAAG,EAAI,EAMvD,QAHIsB,GACFhqB,GAAIyoB,EACJwB,GAAK,IAAIvB,GAAK,CAAC,EACV1oB,MACLgqB,GAAU7mB,EAAE,MAAMA,CAAC,EACnBA,EAAI0mB,GAAI,MAAMG,GAAQ,MAAMC,GAAG,MAAMD,GAAQ,MAAMC,EAAE,CAAC,CAAC,CAAC,EAG1D,OAAOzB,EAASrlB,EAAGulB,GAAK,UAAYQ,EAAIR,GAAK,SAAWS,EAAI,EAAI,CACpE,EAiCE,EAAE,eAAiB,EAAE,KAAO,UAAY,CACtC,IAAIV,EAAGS,EAAIC,EAAInkB,EACb7B,EAAI,KACJulB,EAAOvlB,EAAE,YAEX,GAAI,CAACA,EAAE,SAAQ,GAAMA,EAAE,OAAM,EAAI,OAAO,IAAIulB,EAAKvlB,CAAC,EAQlD,GANA+lB,EAAKR,EAAK,UACVS,EAAKT,EAAK,SACVA,EAAK,UAAYQ,EAAK,KAAK,IAAI/lB,EAAE,EAAGA,EAAE,GAAI,CAAA,EAAI,EAC9CulB,EAAK,SAAW,EAChB1jB,EAAM7B,EAAE,EAAE,OAEN6B,EAAM,EACR7B,EAAI4mB,GAAarB,EAAM,EAAGvlB,EAAGA,EAAG,EAAI,MAC/B,CAWLslB,EAAI,IAAM,KAAK,KAAKzjB,CAAG,EACvByjB,EAAIA,EAAI,GAAK,GAAKA,EAAI,EAEtBtlB,EAAIA,EAAE,MAAM,EAAI2mB,GAAQ,EAAGrB,CAAC,CAAC,EAC7BtlB,EAAI4mB,GAAarB,EAAM,EAAGvlB,EAAGA,EAAG,EAAI,EAOpC,QAJI+mB,GACFC,GAAK,IAAIzB,EAAK,CAAC,EACf0B,GAAM,IAAI1B,EAAK,EAAE,EACjB2B,GAAM,IAAI3B,EAAK,EAAE,EACZD,KACLyB,GAAU/mB,EAAE,MAAMA,CAAC,EACnBA,EAAIA,EAAE,MAAMgnB,GAAG,KAAKD,GAAQ,MAAME,GAAI,MAAMF,EAAO,EAAE,KAAKG,EAAG,CAAC,CAAC,CAAC,CAEnE,CAED,OAAA3B,EAAK,UAAYQ,EACjBR,EAAK,SAAWS,EAETX,EAASrlB,EAAG+lB,EAAIC,EAAI,EAAI,CACnC,EAmBE,EAAE,kBAAoB,EAAE,KAAO,UAAY,CACzC,IAAID,EAAIC,EACNhmB,EAAI,KACJulB,EAAOvlB,EAAE,YAEX,OAAKA,EAAE,SAAU,EACbA,EAAE,OAAQ,EAAS,IAAIulB,EAAKvlB,CAAC,GAEjC+lB,EAAKR,EAAK,UACVS,EAAKT,EAAK,SACVA,EAAK,UAAYQ,EAAK,EACtBR,EAAK,SAAW,EAETkB,EAAOzmB,EAAE,KAAM,EAAEA,EAAE,KAAI,EAAIulB,EAAK,UAAYQ,EAAIR,EAAK,SAAWS,CAAE,GAR/C,IAAIT,EAAKvlB,EAAE,CAAC,CAS1C,EAsBE,EAAE,cAAgB,EAAE,KAAO,UAAY,CACrC,IAAImnB,EACFnnB,EAAI,KACJulB,EAAOvlB,EAAE,YACTslB,EAAItlB,EAAE,MAAM,IAAI,CAAC,EACjB+lB,EAAKR,EAAK,UACVS,EAAKT,EAAK,SAEZ,OAAID,IAAM,GACDA,IAAM,EAETtlB,EAAE,QAAUonB,EAAM7B,EAAMQ,EAAIC,CAAE,EAAI,IAAIT,EAAK,CAAC,EAE5C,IAAIA,EAAK,GAAG,EAGdvlB,EAAE,SAAiBonB,EAAM7B,EAAMQ,EAAK,EAAGC,CAAE,EAAE,MAAM,EAAG,GAIxDT,EAAK,UAAYQ,EAAK,EACtBR,EAAK,SAAW,EAEhBvlB,EAAIA,EAAE,OACNmnB,EAASC,EAAM7B,EAAMQ,EAAK,EAAGC,CAAE,EAAE,MAAM,EAAG,EAE1CT,EAAK,UAAYQ,EACjBR,EAAK,SAAWS,EAETmB,EAAO,MAAMnnB,CAAC,EACzB,EAsBE,EAAE,wBAA0B,EAAE,MAAQ,UAAY,CAChD,IAAI+lB,EAAIC,EACNhmB,EAAI,KACJulB,EAAOvlB,EAAE,YAEX,OAAIA,EAAE,IAAI,CAAC,EAAU,IAAIulB,EAAKvlB,EAAE,GAAG,CAAC,EAAI,EAAI,GAAG,EAC1CA,EAAE,SAAQ,GAEf+lB,EAAKR,EAAK,UACVS,EAAKT,EAAK,SACVA,EAAK,UAAYQ,EAAK,KAAK,IAAI,KAAK,IAAI/lB,EAAE,CAAC,EAAGA,EAAE,GAAI,CAAA,EAAI,EACxDulB,EAAK,SAAW,EAChBnB,EAAW,GAEXpkB,EAAIA,EAAE,MAAMA,CAAC,EAAE,MAAM,CAAC,EAAE,KAAI,EAAG,KAAKA,CAAC,EAErCokB,EAAW,GACXmB,EAAK,UAAYQ,EACjBR,EAAK,SAAWS,EAEThmB,EAAE,MAdiB,IAAIulB,EAAKvlB,CAAC,CAexC,EAmBE,EAAE,sBAAwB,EAAE,MAAQ,UAAY,CAC9C,IAAI+lB,EAAIC,EACNhmB,EAAI,KACJulB,EAAOvlB,EAAE,YAEX,MAAI,CAACA,EAAE,SAAQ,GAAMA,EAAE,OAAM,EAAW,IAAIulB,EAAKvlB,CAAC,GAElD+lB,EAAKR,EAAK,UACVS,EAAKT,EAAK,SACVA,EAAK,UAAYQ,EAAK,EAAI,KAAK,IAAI,KAAK,IAAI/lB,EAAE,CAAC,EAAGA,EAAE,GAAI,CAAA,EAAI,EAC5DulB,EAAK,SAAW,EAChBnB,EAAW,GAEXpkB,EAAIA,EAAE,MAAMA,CAAC,EAAE,KAAK,CAAC,EAAE,KAAI,EAAG,KAAKA,CAAC,EAEpCokB,EAAW,GACXmB,EAAK,UAAYQ,EACjBR,EAAK,SAAWS,EAEThmB,EAAE,KACb,EAsBE,EAAE,yBAA2B,EAAE,MAAQ,UAAY,CACjD,IAAI+lB,EAAIC,EAAIqB,EAAKC,EACftnB,EAAI,KACJulB,EAAOvlB,EAAE,YAEX,OAAKA,EAAE,SAAQ,EACXA,EAAE,GAAK,EAAU,IAAIulB,EAAKvlB,EAAE,IAAG,EAAG,GAAG,CAAC,EAAIA,EAAE,EAAI,EAAIA,EAAE,SAAWA,EAAI,GAAG,GAE5E+lB,EAAKR,EAAK,UACVS,EAAKT,EAAK,SACV+B,EAAMtnB,EAAE,KAEJ,KAAK,IAAIsnB,EAAKvB,CAAE,EAAI,EAAI,CAAC/lB,EAAE,EAAI,EAAUqlB,EAAS,IAAIE,EAAKvlB,CAAC,EAAG+lB,EAAIC,EAAI,EAAI,GAE/ET,EAAK,UAAY8B,EAAMC,EAAMtnB,EAAE,EAE/BA,EAAIymB,EAAOzmB,EAAE,KAAK,CAAC,EAAG,IAAIulB,EAAK,CAAC,EAAE,MAAMvlB,CAAC,EAAGqnB,EAAMtB,EAAI,CAAC,EAEvDR,EAAK,UAAYQ,EAAK,EACtBR,EAAK,SAAW,EAEhBvlB,EAAIA,EAAE,KAENulB,EAAK,UAAYQ,EACjBR,EAAK,SAAWS,EAEThmB,EAAE,MAAM,EAAG,IArBQ,IAAIulB,EAAK,GAAG,CAsB1C,EAwBE,EAAE,YAAc,EAAE,KAAO,UAAY,CACnC,IAAI4B,EAAQ7B,EACVS,EAAIC,EACJhmB,EAAI,KACJulB,EAAOvlB,EAAE,YAEX,OAAIA,EAAE,OAAQ,EAAS,IAAIulB,EAAKvlB,CAAC,GAEjCslB,EAAItlB,EAAE,IAAK,EAAC,IAAI,CAAC,EACjB+lB,EAAKR,EAAK,UACVS,EAAKT,EAAK,SAEND,IAAM,GAGJA,IAAM,GACR6B,EAASC,EAAM7B,EAAMQ,EAAK,EAAGC,CAAE,EAAE,MAAM,EAAG,EAC1CmB,EAAO,EAAInnB,EAAE,EACNmnB,GAIF,IAAI5B,EAAK,GAAG,GAKrBA,EAAK,UAAYQ,EAAK,EACtBR,EAAK,SAAW,EAEhBvlB,EAAIA,EAAE,IAAI,IAAIulB,EAAK,CAAC,EAAE,MAAMvlB,EAAE,MAAMA,CAAC,CAAC,EAAE,KAAM,EAAC,KAAK,CAAC,CAAC,EAAE,OAExDulB,EAAK,UAAYQ,EACjBR,EAAK,SAAWS,EAEThmB,EAAE,MAAM,CAAC,GACpB,EAqBE,EAAE,eAAiB,EAAE,KAAO,UAAY,CACtC,IAAInD,EAAG2oB,EAAGF,EAAG9P,EAAG+R,EAAIpnB,EAAG2e,GAAGuI,GAAKG,GAC7BxnB,GAAI,KACJulB,GAAOvlB,GAAE,YACT+lB,GAAKR,GAAK,UACVS,GAAKT,GAAK,SAEZ,GAAKvlB,GAAE,WAOA,IAAIA,GAAE,SACX,OAAO,IAAIulB,GAAKvlB,EAAC,EACZ,GAAIA,GAAE,MAAM,GAAG,CAAC,GAAK+lB,GAAK,GAAKX,EACpC,OAAAtG,GAAIsI,EAAM7B,GAAMQ,GAAK,EAAGC,EAAE,EAAE,MAAM,GAAI,EACtClH,GAAE,EAAI9e,GAAE,EACD8e,OAZU,CACjB,GAAI,CAAC9e,GAAE,EAAG,OAAO,IAAIulB,GAAK,GAAG,EAC7B,GAAIQ,GAAK,GAAKX,EACZ,OAAAtG,GAAIsI,EAAM7B,GAAMQ,GAAK,EAAGC,EAAE,EAAE,MAAM,EAAG,EACrClH,GAAE,EAAI9e,GAAE,EACD8e,EAEf,CAmBI,IAXAyG,GAAK,UAAY8B,GAAMtB,GAAK,GAC5BR,GAAK,SAAW,EAQhBD,EAAI,KAAK,IAAI,GAAI+B,GAAMpC,EAAW,EAAI,CAAC,EAElCpoB,EAAIyoB,EAAGzoB,EAAG,EAAEA,EAAGmD,GAAIA,GAAE,IAAIA,GAAE,MAAMA,EAAC,EAAE,KAAK,CAAC,EAAE,KAAI,EAAG,KAAK,CAAC,CAAC,EAW/D,IATAokB,EAAW,GAEXoB,EAAI,KAAK,KAAK6B,GAAMpC,CAAQ,EAC5BzP,EAAI,EACJgS,GAAKxnB,GAAE,MAAMA,EAAC,EACd8e,GAAI,IAAIyG,GAAKvlB,EAAC,EACdunB,EAAKvnB,GAGEnD,IAAM,IAOX,GANA0qB,EAAKA,EAAG,MAAMC,EAAE,EAChBrnB,EAAI2e,GAAE,MAAMyI,EAAG,IAAI/R,GAAK,CAAC,CAAC,EAE1B+R,EAAKA,EAAG,MAAMC,EAAE,EAChB1I,GAAI3e,EAAE,KAAKonB,EAAG,IAAI/R,GAAK,CAAC,CAAC,EAErBsJ,GAAE,EAAE0G,CAAC,IAAM,OAAQ,IAAK3oB,EAAI2oB,EAAG1G,GAAE,EAAEjiB,CAAC,IAAMsD,EAAE,EAAEtD,CAAC,GAAKA,KAAK,CAG/D,OAAIyoB,IAAGxG,GAAIA,GAAE,MAAM,GAAMwG,EAAI,CAAE,GAE/BlB,EAAW,GAEJiB,EAASvG,GAAGyG,GAAK,UAAYQ,GAAIR,GAAK,SAAWS,GAAI,EAAI,CACpE,EAOE,EAAE,SAAW,UAAY,CACvB,MAAO,CAAC,CAAC,KAAK,CAClB,EAOE,EAAE,UAAY,EAAE,MAAQ,UAAY,CAClC,MAAO,CAAC,CAAC,KAAK,GAAKtB,EAAU,KAAK,EAAIO,CAAQ,EAAI,KAAK,EAAE,OAAS,CACtE,EAOE,EAAE,MAAQ,UAAY,CACpB,MAAO,CAAC,KAAK,CACjB,EAOE,EAAE,WAAa,EAAE,MAAQ,UAAY,CACnC,OAAO,KAAK,EAAI,CACpB,EAOE,EAAE,WAAa,EAAE,MAAQ,UAAY,CACnC,OAAO,KAAK,EAAI,CACpB,EAOE,EAAE,OAAS,UAAY,CACrB,MAAO,CAAC,CAAC,KAAK,GAAK,KAAK,EAAE,CAAC,IAAM,CACrC,EAOE,EAAE,SAAW,EAAE,GAAK,SAAU5N,EAAG,CAC/B,OAAO,KAAK,IAAIA,CAAC,EAAI,CACzB,EAOE,EAAE,kBAAoB,EAAE,IAAM,SAAUA,EAAG,CACzC,OAAO,KAAK,IAAIA,CAAC,EAAI,CACzB,EAiCE,EAAE,UAAY,EAAE,IAAM,SAAU5B,EAAM,CACpC,IAAIgS,EAAUzK,EAAG0K,EAAapC,EAAGqC,EAAKC,GAAKvB,GAAIvH,GAC7C9R,GAAM,KACNuY,GAAOvY,GAAI,YACX+Y,GAAKR,GAAK,UACVS,GAAKT,GAAK,SACVsC,GAAQ,EAGV,GAAIpS,GAAQ,KACVA,EAAO,IAAI8P,GAAK,EAAE,EAClBkC,EAAW,OACN,CAKL,GAJAhS,EAAO,IAAI8P,GAAK9P,CAAI,EACpBuH,EAAIvH,EAAK,EAGLA,EAAK,EAAI,GAAK,CAACuH,GAAK,CAACA,EAAE,CAAC,GAAKvH,EAAK,GAAG,CAAC,EAAG,OAAO,IAAI8P,GAAK,GAAG,EAEhEkC,EAAWhS,EAAK,GAAG,EAAE,CACtB,CAKD,GAHAuH,EAAIhQ,GAAI,EAGJA,GAAI,EAAI,GAAK,CAACgQ,GAAK,CAACA,EAAE,CAAC,GAAKhQ,GAAI,GAAG,CAAC,EACtC,OAAO,IAAIuY,GAAKvI,GAAK,CAACA,EAAE,CAAC,EAAI,KAAShQ,GAAI,GAAK,EAAI,IAAMgQ,EAAI,EAAI,GAAK,EAKxE,GAAIyK,EACF,GAAIzK,EAAE,OAAS,EACb2K,EAAM,OACD,CACL,IAAKrC,EAAItI,EAAE,CAAC,EAAGsI,EAAI,KAAO,GAAIA,GAAK,GACnCqC,EAAMrC,IAAM,CACb,CAyBH,GAtBAlB,EAAW,GACXiC,GAAKN,GAAK8B,GACVD,GAAME,GAAiB9a,GAAKqZ,EAAE,EAC9BqB,EAAcD,EAAWM,EAAQxC,GAAMc,GAAK,EAAE,EAAIyB,GAAiBrS,EAAM4Q,EAAE,EAG3EvH,GAAI2H,EAAOmB,GAAKF,EAAarB,GAAI,CAAC,EAgB9B2B,EAAoBlJ,GAAE,EAAGwG,EAAIS,GAAIC,EAAE,EAErC,EAME,IALAK,IAAM,GACNuB,GAAME,GAAiB9a,GAAKqZ,EAAE,EAC9BqB,EAAcD,EAAWM,EAAQxC,GAAMc,GAAK,EAAE,EAAIyB,GAAiBrS,EAAM4Q,EAAE,EAC3EvH,GAAI2H,EAAOmB,GAAKF,EAAarB,GAAI,CAAC,EAE9B,CAACsB,EAAK,CAGJ,CAACnB,EAAe1H,GAAE,CAAC,EAAE,MAAMwG,EAAI,EAAGA,EAAI,EAAE,EAAI,GAAK,OACnDxG,GAAIuG,EAASvG,GAAGiH,GAAK,EAAG,CAAC,GAG3B,KACD,OACMiC,EAAoBlJ,GAAE,EAAGwG,GAAK,GAAIU,EAAE,GAG/C,OAAA5B,EAAW,GAEJiB,EAASvG,GAAGiH,GAAIC,EAAE,CAC7B,EAgDE,EAAE,MAAQ,EAAE,IAAM,SAAU3O,EAAG,CAC7B,IAAI2F,EAAG/G,EAAGpZ,EAAG,EAAGyoB,EAAGzjB,GAAKkkB,GAAIC,GAAIL,GAAIsC,GAAIC,GAAMtC,GAC5C5lB,GAAI,KACJulB,GAAOvlB,GAAE,YAKX,GAHAqX,EAAI,IAAIkO,GAAKlO,CAAC,EAGV,CAACrX,GAAE,GAAK,CAACqX,EAAE,EAGb,MAAI,CAACrX,GAAE,GAAK,CAACqX,EAAE,EAAGA,EAAI,IAAIkO,GAAK,GAAG,EAGzBvlB,GAAE,EAAGqX,EAAE,EAAI,CAACA,EAAE,EAKlBA,EAAI,IAAIkO,GAAKlO,EAAE,GAAKrX,GAAE,IAAMqX,EAAE,EAAIrX,GAAI,GAAG,EAEvCqX,EAIT,GAAIrX,GAAE,GAAKqX,EAAE,EACX,OAAAA,EAAE,EAAI,CAACA,EAAE,EACFrX,GAAE,KAAKqX,CAAC,EASjB,GANAsO,GAAK3lB,GAAE,EACP4lB,GAAKvO,EAAE,EACP0O,GAAKR,GAAK,UACVS,GAAKT,GAAK,SAGN,CAACI,GAAG,CAAC,GAAK,CAACC,GAAG,CAAC,EAAG,CAGpB,GAAIA,GAAG,CAAC,EAAGvO,EAAE,EAAI,CAACA,EAAE,UAGXsO,GAAG,CAAC,EAAGtO,EAAI,IAAIkO,GAAKvlB,EAAC,MAIzB,QAAO,IAAIulB,GAAKS,KAAO,EAAI,GAAK,CAAC,EAEtC,OAAO5B,EAAWiB,EAAShO,EAAG0O,GAAIC,EAAE,EAAI3O,CACzC,CAYD,GAPApB,EAAIyO,EAAUrN,EAAE,EAAI4N,CAAQ,EAC5BgD,GAAKvD,EAAU1kB,GAAE,EAAIilB,CAAQ,EAE7BU,GAAKA,GAAG,QACRL,EAAI2C,GAAKhS,EAGLqP,EAAG,CAyBL,IAxBA4C,GAAO5C,EAAI,EAEP4C,IACFlL,EAAI2I,GACJL,EAAI,CAACA,EACLzjB,GAAM+jB,GAAG,SAET5I,EAAI4I,GACJ3P,EAAIgS,GACJpmB,GAAM8jB,GAAG,QAMX9oB,EAAI,KAAK,IAAI,KAAK,KAAKkpB,GAAKd,CAAQ,EAAGpjB,EAAG,EAAI,EAE1CyjB,EAAIzoB,IACNyoB,EAAIzoB,EACJmgB,EAAE,OAAS,GAIbA,EAAE,QAAO,EACJngB,EAAIyoB,EAAGzoB,KAAMmgB,EAAE,KAAK,CAAC,EAC1BA,EAAE,QAAO,CAGf,KAAW,CASL,IALAngB,EAAI8oB,GAAG,OACP9jB,GAAM+jB,GAAG,OACTsC,GAAOrrB,EAAIgF,GACPqmB,KAAMrmB,GAAMhF,GAEXA,EAAI,EAAGA,EAAIgF,GAAKhF,IACnB,GAAI8oB,GAAG9oB,CAAC,GAAK+oB,GAAG/oB,CAAC,EAAG,CAClBqrB,GAAOvC,GAAG9oB,CAAC,EAAI+oB,GAAG/oB,CAAC,EACnB,KACD,CAGHyoB,EAAI,CACL,CAaD,IAXI4C,KACFlL,EAAI2I,GACJA,GAAKC,GACLA,GAAK5I,EACL3F,EAAE,EAAI,CAACA,EAAE,GAGXxV,GAAM8jB,GAAG,OAIJ9oB,EAAI+oB,GAAG,OAAS/jB,GAAKhF,EAAI,EAAG,EAAEA,EAAG8oB,GAAG9jB,IAAK,EAAI,EAGlD,IAAKhF,EAAI+oB,GAAG,OAAQ/oB,EAAIyoB,GAAI,CAE1B,GAAIK,GAAG,EAAE9oB,CAAC,EAAI+oB,GAAG/oB,CAAC,EAAG,CACnB,IAAK,EAAIA,EAAG,GAAK8oB,GAAG,EAAE,CAAC,IAAM,GAAIA,GAAG,CAAC,EAAIX,EAAO,EAChD,EAAEW,GAAG,CAAC,EACNA,GAAG9oB,CAAC,GAAKmoB,CACV,CAEDW,GAAG9oB,CAAC,GAAK+oB,GAAG/oB,CAAC,CACd,CAGD,KAAO8oB,GAAG,EAAE9jB,EAAG,IAAM,GAAI8jB,GAAG,MAG5B,KAAOA,GAAG,CAAC,IAAM,EAAGA,GAAG,MAAK,EAAI,EAAE1P,EAGlC,OAAK0P,GAAG,CAAC,GAETtO,EAAE,EAAIsO,GACNtO,EAAE,EAAI8Q,GAAkBxC,GAAI1P,CAAC,EAEtBmO,EAAWiB,EAAShO,EAAG0O,GAAIC,EAAE,EAAI3O,GALrB,IAAIkO,GAAKS,KAAO,EAAI,GAAK,CAAC,CAMjD,EA2BE,EAAE,OAAS,EAAE,IAAM,SAAU3O,EAAG,CAC9B,IAAI+Q,EACFpoB,EAAI,KACJulB,EAAOvlB,EAAE,YAKX,OAHAqX,EAAI,IAAIkO,EAAKlO,CAAC,EAGV,CAACrX,EAAE,GAAK,CAACqX,EAAE,GAAKA,EAAE,GAAK,CAACA,EAAE,EAAE,CAAC,EAAU,IAAIkO,EAAK,GAAG,EAGnD,CAAClO,EAAE,GAAKrX,EAAE,GAAK,CAACA,EAAE,EAAE,CAAC,EAChBqlB,EAAS,IAAIE,EAAKvlB,CAAC,EAAGulB,EAAK,UAAWA,EAAK,QAAQ,GAI5DnB,EAAW,GAEPmB,EAAK,QAAU,GAIjB6C,EAAI3B,EAAOzmB,EAAGqX,EAAE,IAAG,EAAI,EAAG,EAAG,CAAC,EAC9B+Q,EAAE,GAAK/Q,EAAE,GAET+Q,EAAI3B,EAAOzmB,EAAGqX,EAAG,EAAGkO,EAAK,OAAQ,CAAC,EAGpC6C,EAAIA,EAAE,MAAM/Q,CAAC,EAEb+M,EAAW,GAEJpkB,EAAE,MAAMooB,CAAC,EACpB,EASE,EAAE,mBAAqB,EAAE,IAAM,UAAY,CACzC,OAAOC,GAAmB,IAAI,CAClC,EAQE,EAAE,iBAAmB,EAAE,GAAK,UAAY,CACtC,OAAOP,GAAiB,IAAI,CAChC,EAQE,EAAE,QAAU,EAAE,IAAM,UAAY,CAC9B,IAAI9nB,EAAI,IAAI,KAAK,YAAY,IAAI,EACjC,OAAAA,EAAE,EAAI,CAACA,EAAE,EACFqlB,EAASrlB,CAAC,CACrB,EAwBE,EAAE,KAAO,EAAE,IAAM,SAAUqX,EAAG,CAC5B,IAAIiR,EAAOtL,EAAG/G,EAAGpZ,EAAGyoB,EAAGzjB,GAAKkkB,GAAIC,GAAIL,GAAIC,GACtC5lB,GAAI,KACJulB,GAAOvlB,GAAE,YAKX,GAHAqX,EAAI,IAAIkO,GAAKlO,CAAC,EAGV,CAACrX,GAAE,GAAK,CAACqX,EAAE,EAGb,MAAI,CAACrX,GAAE,GAAK,CAACqX,EAAE,EAAGA,EAAI,IAAIkO,GAAK,GAAG,EAMxBvlB,GAAE,IAAGqX,EAAI,IAAIkO,GAAKlO,EAAE,GAAKrX,GAAE,IAAMqX,EAAE,EAAIrX,GAAI,GAAG,GAEjDqX,EAIT,GAAIrX,GAAE,GAAKqX,EAAE,EACX,OAAAA,EAAE,EAAI,CAACA,EAAE,EACFrX,GAAE,MAAMqX,CAAC,EASlB,GANAsO,GAAK3lB,GAAE,EACP4lB,GAAKvO,EAAE,EACP0O,GAAKR,GAAK,UACVS,GAAKT,GAAK,SAGN,CAACI,GAAG,CAAC,GAAK,CAACC,GAAG,CAAC,EAIjB,OAAKA,GAAG,CAAC,IAAGvO,EAAI,IAAIkO,GAAKvlB,EAAC,GAEnBokB,EAAWiB,EAAShO,EAAG0O,GAAIC,EAAE,EAAI3O,EAa1C,GAPAiO,EAAIZ,EAAU1kB,GAAE,EAAIilB,CAAQ,EAC5BhP,EAAIyO,EAAUrN,EAAE,EAAI4N,CAAQ,EAE5BU,GAAKA,GAAG,QACR9oB,EAAIyoB,EAAIrP,EAGJpZ,EAAG,CAuBL,IArBIA,EAAI,GACNmgB,EAAI2I,GACJ9oB,EAAI,CAACA,EACLgF,GAAM+jB,GAAG,SAET5I,EAAI4I,GACJ3P,EAAIqP,EACJzjB,GAAM8jB,GAAG,QAIXL,EAAI,KAAK,KAAKS,GAAKd,CAAQ,EAC3BpjB,GAAMyjB,EAAIzjB,GAAMyjB,EAAI,EAAIzjB,GAAM,EAE1BhF,EAAIgF,KACNhF,EAAIgF,GACJmb,EAAE,OAAS,GAIbA,EAAE,QAAO,EACFngB,KAAMmgB,EAAE,KAAK,CAAC,EACrBA,EAAE,QAAO,CACV,CAcD,IAZAnb,GAAM8jB,GAAG,OACT9oB,EAAI+oB,GAAG,OAGH/jB,GAAMhF,EAAI,IACZA,EAAIgF,GACJmb,EAAI4I,GACJA,GAAKD,GACLA,GAAK3I,GAIFsL,EAAQ,EAAGzrB,GACdyrB,GAAS3C,GAAG,EAAE9oB,CAAC,EAAI8oB,GAAG9oB,CAAC,EAAI+oB,GAAG/oB,CAAC,EAAIyrB,GAAStD,EAAO,EACnDW,GAAG9oB,CAAC,GAAKmoB,EAUX,IAPIsD,IACF3C,GAAG,QAAQ2C,CAAK,EAChB,EAAErS,GAKCpU,GAAM8jB,GAAG,OAAQA,GAAG,EAAE9jB,EAAG,GAAK,GAAI8jB,GAAG,MAE1C,OAAAtO,EAAE,EAAIsO,GACNtO,EAAE,EAAI8Q,GAAkBxC,GAAI1P,CAAC,EAEtBmO,EAAWiB,EAAShO,EAAG0O,GAAIC,EAAE,EAAI3O,CAC5C,EASE,EAAE,UAAY,EAAE,GAAK,SAAUkR,EAAG,CAChC,IAAIjD,EACFtlB,EAAI,KAEN,GAAIuoB,IAAM,QAAUA,IAAM,CAAC,CAACA,GAAKA,IAAM,GAAKA,IAAM,EAAG,MAAM,MAAMjE,EAAkBiE,CAAC,EAEpF,OAAIvoB,EAAE,GACJslB,EAAIkD,GAAaxoB,EAAE,CAAC,EAChBuoB,GAAKvoB,EAAE,EAAI,EAAIslB,IAAGA,EAAItlB,EAAE,EAAI,IAEhCslB,EAAI,IAGCA,CACX,EAQE,EAAE,MAAQ,UAAY,CACpB,IAAItlB,EAAI,KACNulB,EAAOvlB,EAAE,YAEX,OAAOqlB,EAAS,IAAIE,EAAKvlB,CAAC,EAAGA,EAAE,EAAI,EAAGulB,EAAK,QAAQ,CACvD,EAkBE,EAAE,KAAO,EAAE,IAAM,UAAY,CAC3B,IAAIQ,EAAIC,EACNhmB,EAAI,KACJulB,EAAOvlB,EAAE,YAEX,OAAKA,EAAE,SAAQ,EACXA,EAAE,OAAQ,EAAS,IAAIulB,EAAKvlB,CAAC,GAEjC+lB,EAAKR,EAAK,UACVS,EAAKT,EAAK,SACVA,EAAK,UAAYQ,EAAK,KAAK,IAAI/lB,EAAE,EAAGA,EAAE,GAAI,CAAA,EAAIilB,EAC9CM,EAAK,SAAW,EAEhBvlB,EAAIyoB,EAAKlD,EAAMW,GAAiBX,EAAMvlB,CAAC,CAAC,EAExCulB,EAAK,UAAYQ,EACjBR,EAAK,SAAWS,EAETX,EAASlB,EAAW,EAAInkB,EAAE,MAAQA,EAAG+lB,EAAIC,EAAI,EAAI,GAb9B,IAAIT,EAAK,GAAG,CAc1C,EAeE,EAAE,WAAa,EAAE,KAAO,UAAY,CAClC,IAAIY,EAAG3Q,EAAG6Q,EAAIvH,EAAGsH,EAAKjmB,EACpBH,GAAI,KACJgd,GAAIhd,GAAE,EACNiW,GAAIjW,GAAE,EACN6H,GAAI7H,GAAE,EACNulB,GAAOvlB,GAAE,YAGX,GAAI6H,KAAM,GAAK,CAACmV,IAAK,CAACA,GAAE,CAAC,EACvB,OAAO,IAAIuI,GAAK,CAAC1d,IAAKA,GAAI,IAAM,CAACmV,IAAKA,GAAE,CAAC,GAAK,IAAMA,GAAIhd,GAAI,GAAK,EAgCnE,IA7BAokB,EAAW,GAGXvc,GAAI,KAAK,KAAK,CAAC7H,EAAC,EAIZ6H,IAAK,GAAKA,IAAK,KACjB2N,EAAIgR,EAAexJ,EAAC,GAEfxH,EAAE,OAASS,IAAK,GAAK,IAAGT,GAAK,KAClC3N,GAAI,KAAK,KAAK2N,CAAC,EACfS,GAAIyO,GAAWzO,GAAI,GAAK,CAAC,GAAKA,GAAI,GAAKA,GAAI,GAEvCpO,IAAK,IACP2N,EAAI,KAAOS,IAEXT,EAAI3N,GAAE,gBACN2N,EAAIA,EAAE,MAAM,EAAGA,EAAE,QAAQ,GAAG,EAAI,CAAC,EAAIS,IAGvC6I,EAAI,IAAIyG,GAAK/P,CAAC,GAEdsJ,EAAI,IAAIyG,GAAK1d,GAAE,SAAU,CAAA,EAG3Bwe,GAAMpQ,GAAIsP,GAAK,WAAa,IAQ1B,GAJAplB,EAAI2e,EACJA,EAAI3e,EAAE,KAAKsmB,EAAOzmB,GAAGG,EAAGkmB,EAAK,EAAG,CAAC,CAAC,EAAE,MAAM,EAAG,EAGzCG,EAAermB,EAAE,CAAC,EAAE,MAAM,EAAGkmB,CAAE,KAAO7Q,EAAIgR,EAAe1H,EAAE,CAAC,GAAG,MAAM,EAAGuH,CAAE,EAK5E,GAJA7Q,EAAIA,EAAE,MAAM6Q,EAAK,EAAGA,EAAK,CAAC,EAItB7Q,GAAK,QAAU,CAAC4Q,GAAO5Q,GAAK,OAAQ,CAItC,GAAI,CAAC4Q,IACHf,EAASllB,EAAG8V,GAAI,EAAG,CAAC,EAEhB9V,EAAE,MAAMA,CAAC,EAAE,GAAGH,EAAC,GAAG,CACpB8e,EAAI3e,EACJ,KACD,CAGHkmB,GAAM,EACND,EAAM,CAChB,KAAe,EAID,CAAC,CAAC5Q,GAAK,CAAC,CAACA,EAAE,MAAM,CAAC,GAAKA,EAAE,OAAO,CAAC,GAAK,OAGxC6P,EAASvG,EAAG7I,GAAI,EAAG,CAAC,EACpBkQ,EAAI,CAACrH,EAAE,MAAMA,CAAC,EAAE,GAAG9e,EAAC,GAGtB,KACD,CAIL,OAAAokB,EAAW,GAEJiB,EAASvG,EAAG7I,GAAGsP,GAAK,SAAUY,CAAC,CAC1C,EAgBE,EAAE,QAAU,EAAE,IAAM,UAAY,CAC9B,IAAIJ,EAAIC,EACNhmB,EAAI,KACJulB,EAAOvlB,EAAE,YAEX,OAAKA,EAAE,SAAQ,EACXA,EAAE,OAAQ,EAAS,IAAIulB,EAAKvlB,CAAC,GAEjC+lB,EAAKR,EAAK,UACVS,EAAKT,EAAK,SACVA,EAAK,UAAYQ,EAAK,GACtBR,EAAK,SAAW,EAEhBvlB,EAAIA,EAAE,MACNA,EAAE,EAAI,EACNA,EAAIymB,EAAOzmB,EAAG,IAAIulB,EAAK,CAAC,EAAE,MAAMvlB,EAAE,MAAMA,CAAC,CAAC,EAAE,KAAI,EAAI+lB,EAAK,GAAI,CAAC,EAE9DR,EAAK,UAAYQ,EACjBR,EAAK,SAAWS,EAETX,EAASlB,GAAY,GAAKA,GAAY,EAAInkB,EAAE,IAAG,EAAKA,EAAG+lB,EAAIC,EAAI,EAAI,GAfhD,IAAIT,EAAK,GAAG,CAgB1C,EAwBE,EAAE,MAAQ,EAAE,IAAM,SAAUlO,EAAG,CAC7B,IAAIiR,EAAOrS,EAAGpZ,EAAGyoB,EAAGxG,EAAG4J,GAAIvoB,GAAGslB,GAAKC,GACjC1lB,GAAI,KACJulB,GAAOvlB,GAAE,YACT2lB,GAAK3lB,GAAE,EACP4lB,IAAMvO,EAAI,IAAIkO,GAAKlO,CAAC,GAAG,EAKzB,GAHAA,EAAE,GAAKrX,GAAE,EAGL,CAAC2lB,IAAM,CAACA,GAAG,CAAC,GAAK,CAACC,IAAM,CAACA,GAAG,CAAC,EAE/B,OAAO,IAAIL,GAAK,CAAClO,EAAE,GAAKsO,IAAM,CAACA,GAAG,CAAC,GAAK,CAACC,IAAMA,IAAM,CAACA,GAAG,CAAC,GAAK,CAACD,GAI5D,IAIA,CAACA,IAAM,CAACC,GAAKvO,EAAE,EAAI,EAAIA,EAAE,EAAI,CAAC,EAoBpC,IAjBApB,EAAIyO,EAAU1kB,GAAE,EAAIilB,CAAQ,EAAIP,EAAUrN,EAAE,EAAI4N,CAAQ,EACxDQ,GAAME,GAAG,OACTD,GAAME,GAAG,OAGLH,GAAMC,KACR5G,EAAI6G,GACJA,GAAKC,GACLA,GAAK9G,EACL4J,GAAKjD,GACLA,GAAMC,GACNA,GAAMgD,IAIR5J,EAAI,CAAA,EACJ4J,GAAKjD,GAAMC,GACN7oB,EAAI6rB,GAAI7rB,KAAMiiB,EAAE,KAAK,CAAC,EAG3B,IAAKjiB,EAAI6oB,GAAK,EAAE7oB,GAAK,GAAI,CAEvB,IADAyrB,EAAQ,EACHhD,EAAIG,GAAM5oB,EAAGyoB,EAAIzoB,GACpBsD,GAAI2e,EAAEwG,CAAC,EAAIM,GAAG/oB,CAAC,EAAI8oB,GAAGL,EAAIzoB,EAAI,CAAC,EAAIyrB,EACnCxJ,EAAEwG,GAAG,EAAInlB,GAAI6kB,EAAO,EACpBsD,EAAQnoB,GAAI6kB,EAAO,EAGrBlG,EAAEwG,CAAC,GAAKxG,EAAEwG,CAAC,EAAIgD,GAAStD,EAAO,CAChC,CAGD,KAAO,CAAClG,EAAE,EAAE4J,EAAE,GAAI5J,EAAE,IAAG,EAEvB,OAAIwJ,EAAO,EAAErS,EACR6I,EAAE,MAAK,EAEZzH,EAAE,EAAIyH,EACNzH,EAAE,EAAI8Q,GAAkBrJ,EAAG7I,CAAC,EAErBmO,EAAWiB,EAAShO,EAAGkO,GAAK,UAAWA,GAAK,QAAQ,EAAIlO,CACnE,EAaE,EAAE,SAAW,SAAUgP,EAAIL,EAAI,CAC7B,OAAO2C,GAAe,KAAM,EAAGtC,EAAIL,CAAE,CACzC,EAaE,EAAE,gBAAkB,EAAE,KAAO,SAAU4C,EAAI5C,EAAI,CAC7C,IAAIhmB,EAAI,KACNulB,EAAOvlB,EAAE,YAGX,OADAA,EAAI,IAAIulB,EAAKvlB,CAAC,EACV4oB,IAAO,OAAe5oB,GAE1B6oB,EAAWD,EAAI,EAAGjF,CAAU,EAExBqC,IAAO,OAAQA,EAAKT,EAAK,SACxBsD,EAAW7C,EAAI,EAAG,CAAC,EAEjBX,EAASrlB,EAAG4oB,EAAK5oB,EAAE,EAAI,EAAGgmB,CAAE,EACvC,EAWE,EAAE,cAAgB,SAAU4C,EAAI5C,EAAI,CAClC,IAAIpjB,EACF5C,EAAI,KACJulB,EAAOvlB,EAAE,YAEX,OAAI4oB,IAAO,OACThmB,EAAMkmB,EAAe9oB,EAAG,EAAI,GAE5B6oB,EAAWD,EAAI,EAAGjF,CAAU,EAExBqC,IAAO,OAAQA,EAAKT,EAAK,SACxBsD,EAAW7C,EAAI,EAAG,CAAC,EAExBhmB,EAAIqlB,EAAS,IAAIE,EAAKvlB,CAAC,EAAG4oB,EAAK,EAAG5C,CAAE,EACpCpjB,EAAMkmB,EAAe9oB,EAAG,GAAM4oB,EAAK,CAAC,GAG/B5oB,EAAE,MAAK,GAAM,CAACA,EAAE,SAAW,IAAM4C,EAAMA,CAClD,EAmBE,EAAE,QAAU,SAAUgmB,EAAI5C,EAAI,CAC5B,IAAIpjB,EAAKyU,EACPrX,EAAI,KACJulB,EAAOvlB,EAAE,YAEX,OAAI4oB,IAAO,OACThmB,EAAMkmB,EAAe9oB,CAAC,GAEtB6oB,EAAWD,EAAI,EAAGjF,CAAU,EAExBqC,IAAO,OAAQA,EAAKT,EAAK,SACxBsD,EAAW7C,EAAI,EAAG,CAAC,EAExB3O,EAAIgO,EAAS,IAAIE,EAAKvlB,CAAC,EAAG4oB,EAAK5oB,EAAE,EAAI,EAAGgmB,CAAE,EAC1CpjB,EAAMkmB,EAAezR,EAAG,GAAOuR,EAAKvR,EAAE,EAAI,CAAC,GAKtCrX,EAAE,MAAK,GAAM,CAACA,EAAE,SAAW,IAAM4C,EAAMA,CAClD,EAcE,EAAE,WAAa,SAAUmmB,EAAM,CAC7B,IAAI/L,EAAGgM,EAAIC,EAAIC,EAAIjT,EAAGqP,GAAG9P,GAAG2T,GAAIC,GAAIrD,GAAIqC,GAAGtJ,GACzC9e,GAAI,KACJ2lB,GAAK3lB,GAAE,EACPulB,GAAOvlB,GAAE,YAEX,GAAI,CAAC2lB,GAAI,OAAO,IAAIJ,GAAKvlB,EAAC,EAU1B,GARAopB,GAAKJ,EAAK,IAAIzD,GAAK,CAAC,EACpB0D,EAAKE,GAAK,IAAI5D,GAAK,CAAC,EAEpBvI,EAAI,IAAIuI,GAAK0D,CAAE,EACfhT,EAAI+G,EAAE,EAAIwL,GAAa7C,EAAE,EAAI3lB,GAAE,EAAI,EACnCslB,GAAIrP,EAAIgP,EACRjI,EAAE,EAAE,CAAC,EAAI2H,EAAQ,GAAIW,GAAI,EAAIL,EAAWK,GAAIA,EAAC,EAEzCyD,GAAQ,KAGVA,EAAO9S,EAAI,EAAI+G,EAAIoM,OACd,CAEL,GADA5T,GAAI,IAAI+P,GAAKwD,CAAI,EACb,CAACvT,GAAE,MAAO,GAAIA,GAAE,GAAG4T,EAAE,EAAG,MAAM,MAAM9E,EAAkB9O,EAAC,EAC3DuT,EAAOvT,GAAE,GAAGwH,CAAC,EAAK/G,EAAI,EAAI+G,EAAIoM,GAAM5T,EACrC,CAOD,IALA4O,EAAW,GACX5O,GAAI,IAAI+P,GAAKiB,EAAeb,EAAE,CAAC,EAC/BI,GAAKR,GAAK,UACVA,GAAK,UAAYtP,EAAI0P,GAAG,OAASV,EAAW,EAG1CmD,GAAI3B,EAAOjR,GAAGwH,EAAG,EAAG,EAAG,CAAC,EACxBkM,EAAKF,EAAG,KAAKZ,GAAE,MAAMa,CAAE,CAAC,EACpBC,EAAG,IAAIH,CAAI,GAAK,GACpBC,EAAKC,EACLA,EAAKC,EACLA,EAAKE,GACLA,GAAKD,GAAG,KAAKf,GAAE,MAAMc,CAAE,CAAC,EACxBC,GAAKD,EACLA,EAAKlM,EACLA,EAAIxH,GAAE,MAAM4S,GAAE,MAAMc,CAAE,CAAC,EACvB1T,GAAI0T,EAGN,OAAAA,EAAKzC,EAAOsC,EAAK,MAAMC,CAAE,EAAGC,EAAI,EAAG,EAAG,CAAC,EACvCE,GAAKA,GAAG,KAAKD,EAAG,MAAME,EAAE,CAAC,EACzBJ,EAAKA,EAAG,KAAKE,EAAG,MAAMD,CAAE,CAAC,EACzBE,GAAG,EAAIC,GAAG,EAAIppB,GAAE,EAGhB8e,GAAI2H,EAAO2C,GAAIH,EAAIhT,EAAG,CAAC,EAAE,MAAMjW,EAAC,EAAE,IAAK,EAAC,IAAIymB,EAAO0C,GAAIH,EAAI/S,EAAG,CAAC,EAAE,MAAMjW,EAAC,EAAE,IAAK,CAAA,EAAI,EAC7E,CAACopB,GAAIH,CAAE,EAAI,CAACE,GAAIH,CAAE,EAExBzD,GAAK,UAAYQ,GACjB3B,EAAW,GAEJtF,EACX,EAaE,EAAE,cAAgB,EAAE,MAAQ,SAAUuH,EAAIL,EAAI,CAC5C,OAAO2C,GAAe,KAAM,GAAItC,EAAIL,CAAE,CAC1C,EAmBE,EAAE,UAAY,SAAU3O,EAAG2O,EAAI,CAC7B,IAAIhmB,EAAI,KACNulB,EAAOvlB,EAAE,YAIX,GAFAA,EAAI,IAAIulB,EAAKvlB,CAAC,EAEVqX,GAAK,KAAM,CAGb,GAAI,CAACrX,EAAE,EAAG,OAAOA,EAEjBqX,EAAI,IAAIkO,EAAK,CAAC,EACdS,EAAKT,EAAK,QAChB,KAAW,CASL,GARAlO,EAAI,IAAIkO,EAAKlO,CAAC,EACV2O,IAAO,OACTA,EAAKT,EAAK,SAEVsD,EAAW7C,EAAI,EAAG,CAAC,EAIjB,CAAChmB,EAAE,EAAG,OAAOqX,EAAE,EAAIrX,EAAIqX,EAG3B,GAAI,CAACA,EAAE,EACL,OAAIA,EAAE,IAAGA,EAAE,EAAIrX,EAAE,GACVqX,CAEV,CAGD,OAAIA,EAAE,EAAE,CAAC,GACP+M,EAAW,GACXpkB,EAAIymB,EAAOzmB,EAAGqX,EAAG,EAAG2O,EAAI,CAAC,EAAE,MAAM3O,CAAC,EAClC+M,EAAW,GACXiB,EAASrlB,CAAC,IAIVqX,EAAE,EAAIrX,EAAE,EACRA,EAAIqX,GAGCrX,CACX,EAQE,EAAE,SAAW,UAAY,CACvB,MAAO,CAAC,IACZ,EAaE,EAAE,QAAU,SAAUqmB,EAAIL,EAAI,CAC5B,OAAO2C,GAAe,KAAM,EAAGtC,EAAIL,CAAE,CACzC,EA8CE,EAAE,QAAU,EAAE,IAAM,SAAU3O,EAAG,CAC/B,IAAIpB,EAAGqP,EAAGS,EAAIjH,EAAGkH,EAAIne,GACnB7H,GAAI,KACJulB,GAAOvlB,GAAE,YACTqpB,GAAK,EAAEhS,EAAI,IAAIkO,GAAKlO,CAAC,GAGvB,GAAI,CAACrX,GAAE,GAAK,CAACqX,EAAE,GAAK,CAACrX,GAAE,EAAE,CAAC,GAAK,CAACqX,EAAE,EAAE,CAAC,EAAG,OAAO,IAAIkO,GAAKZ,EAAQ,CAAC3kB,GAAGqpB,EAAE,CAAC,EAIvE,GAFArpB,GAAI,IAAIulB,GAAKvlB,EAAC,EAEVA,GAAE,GAAG,CAAC,EAAG,OAAOA,GAKpB,GAHA+lB,EAAKR,GAAK,UACVS,EAAKT,GAAK,SAENlO,EAAE,GAAG,CAAC,EAAG,OAAOgO,EAASrlB,GAAG+lB,EAAIC,CAAE,EAMtC,GAHA/P,EAAIyO,EAAUrN,EAAE,EAAI4N,CAAQ,EAGxBhP,GAAKoB,EAAE,EAAE,OAAS,IAAMiO,EAAI+D,GAAK,EAAI,CAACA,GAAKA,KAAOnE,EACpD,OAAApG,EAAIwK,GAAO/D,GAAMvlB,GAAGslB,EAAGS,CAAE,EAClB1O,EAAE,EAAI,EAAI,IAAIkO,GAAK,CAAC,EAAE,IAAIzG,CAAC,EAAIuG,EAASvG,EAAGiH,EAAIC,CAAE,EAM1D,GAHAne,GAAI7H,GAAE,EAGF6H,GAAI,EAAG,CAGT,GAAIoO,EAAIoB,EAAE,EAAE,OAAS,EAAG,OAAO,IAAIkO,GAAK,GAAG,EAM3C,GAHKlO,EAAE,EAAEpB,CAAC,EAAI,IAASpO,GAAI,GAGvB7H,GAAE,GAAK,GAAKA,GAAE,EAAE,CAAC,GAAK,GAAKA,GAAE,EAAE,QAAU,EAC3C,OAAAA,GAAE,EAAI6H,GACC7H,EAEV,CAcD,OARAslB,EAAIX,EAAQ,CAAC3kB,GAAGqpB,EAAE,EAClBpT,EAAIqP,GAAK,GAAK,CAAC,SAASA,CAAC,EACrBZ,EAAU2E,IAAM,KAAK,IAAI,KAAO7C,EAAexmB,GAAE,CAAC,CAAC,EAAI,KAAK,KAAOA,GAAE,EAAI,EAAE,EAC3E,IAAIulB,GAAKD,EAAI,EAAE,EAAE,EAKjBrP,EAAIsP,GAAK,KAAO,GAAKtP,EAAIsP,GAAK,KAAO,EAAU,IAAIA,GAAKtP,EAAI,EAAIpO,GAAI,EAAI,CAAC,GAE7Euc,EAAW,GACXmB,GAAK,SAAWvlB,GAAE,EAAI,EAMtBslB,EAAI,KAAK,IAAI,IAAKrP,EAAI,IAAI,MAAM,EAGhC6I,EAAIuJ,GAAmBhR,EAAE,MAAMyQ,GAAiB9nB,GAAG+lB,EAAKT,CAAC,CAAC,EAAGS,CAAE,EAG3DjH,EAAE,IAGJA,EAAIuG,EAASvG,EAAGiH,EAAK,EAAG,CAAC,EAIrBiC,EAAoBlJ,EAAE,EAAGiH,EAAIC,CAAE,IACjC/P,EAAI8P,EAAK,GAGTjH,EAAIuG,EAASgD,GAAmBhR,EAAE,MAAMyQ,GAAiB9nB,GAAGiW,EAAIqP,CAAC,CAAC,EAAGrP,CAAC,EAAGA,EAAI,EAAG,CAAC,EAG7E,CAACuQ,EAAe1H,EAAE,CAAC,EAAE,MAAMiH,EAAK,EAAGA,EAAK,EAAE,EAAI,GAAK,OACrDjH,EAAIuG,EAASvG,EAAGiH,EAAK,EAAG,CAAC,KAK/BjH,EAAE,EAAIjX,GACNuc,EAAW,GACXmB,GAAK,SAAWS,EAETX,EAASvG,EAAGiH,EAAIC,CAAE,EAC7B,EAcE,EAAE,YAAc,SAAUK,EAAIL,EAAI,CAChC,IAAIpjB,EACF5C,EAAI,KACJulB,EAAOvlB,EAAE,YAEX,OAAIqmB,IAAO,OACTzjB,EAAMkmB,EAAe9oB,EAAGA,EAAE,GAAKulB,EAAK,UAAYvlB,EAAE,GAAKulB,EAAK,QAAQ,GAEpEsD,EAAWxC,EAAI,EAAG1C,CAAU,EAExBqC,IAAO,OAAQA,EAAKT,EAAK,SACxBsD,EAAW7C,EAAI,EAAG,CAAC,EAExBhmB,EAAIqlB,EAAS,IAAIE,EAAKvlB,CAAC,EAAGqmB,EAAIL,CAAE,EAChCpjB,EAAMkmB,EAAe9oB,EAAGqmB,GAAMrmB,EAAE,GAAKA,EAAE,GAAKulB,EAAK,SAAUc,CAAE,GAGxDrmB,EAAE,MAAK,GAAM,CAACA,EAAE,SAAW,IAAM4C,EAAMA,CAClD,EAiBE,EAAE,oBAAsB,EAAE,KAAO,SAAUyjB,EAAIL,EAAI,CACjD,IAAIhmB,EAAI,KACNulB,EAAOvlB,EAAE,YAEX,OAAIqmB,IAAO,QACTA,EAAKd,EAAK,UACVS,EAAKT,EAAK,WAEVsD,EAAWxC,EAAI,EAAG1C,CAAU,EAExBqC,IAAO,OAAQA,EAAKT,EAAK,SACxBsD,EAAW7C,EAAI,EAAG,CAAC,GAGnBX,EAAS,IAAIE,EAAKvlB,CAAC,EAAGqmB,EAAIL,CAAE,CACvC,EAUE,EAAE,SAAW,UAAY,CACvB,IAAIhmB,EAAI,KACNulB,EAAOvlB,EAAE,YACT4C,EAAMkmB,EAAe9oB,EAAGA,EAAE,GAAKulB,EAAK,UAAYvlB,EAAE,GAAKulB,EAAK,QAAQ,EAEtE,OAAOvlB,EAAE,MAAK,GAAM,CAACA,EAAE,SAAW,IAAM4C,EAAMA,CAClD,EAOE,EAAE,UAAY,EAAE,MAAQ,UAAY,CAClC,OAAOyiB,EAAS,IAAI,KAAK,YAAY,IAAI,EAAG,KAAK,EAAI,EAAG,CAAC,CAC7D,EAQE,EAAE,QAAU,EAAE,OAAS,UAAY,CACjC,IAAIrlB,EAAI,KACNulB,EAAOvlB,EAAE,YACT4C,EAAMkmB,EAAe9oB,EAAGA,EAAE,GAAKulB,EAAK,UAAYvlB,EAAE,GAAKulB,EAAK,QAAQ,EAEtE,OAAOvlB,EAAE,MAAK,EAAK,IAAM4C,EAAMA,CACnC,EAoDE,SAAS4jB,EAAexJ,EAAG,CACzB,IAAIngB,EAAGyoB,EAAGiE,EACRC,EAAkBxM,EAAE,OAAS,EAC7Bpa,EAAM,GACN6mB,GAAIzM,EAAE,CAAC,EAET,GAAIwM,EAAkB,EAAG,CAEvB,IADA5mB,GAAO6mB,GACF5sB,EAAI,EAAGA,EAAI2sB,EAAiB3sB,IAC/B0sB,EAAKvM,EAAEngB,CAAC,EAAI,GACZyoB,EAAIL,EAAWsE,EAAG,OACdjE,IAAG1iB,GAAO8mB,GAAcpE,CAAC,GAC7B1iB,GAAO2mB,EAGTE,GAAIzM,EAAEngB,CAAC,EACP0sB,EAAKE,GAAI,GACTnE,EAAIL,EAAWsE,EAAG,OACdjE,IAAG1iB,GAAO8mB,GAAcpE,CAAC,EACnC,SAAemE,KAAM,EACf,MAAO,IAIT,KAAOA,GAAI,KAAO,GAAIA,IAAK,GAE3B,OAAO7mB,EAAM6mB,EACd,CAGD,SAASZ,EAAWhsB,EAAG4N,EAAKmP,EAAK,CAC/B,GAAI/c,IAAM,CAAC,CAACA,GAAKA,EAAI4N,GAAO5N,EAAI+c,EAC9B,MAAM,MAAM0K,EAAkBznB,CAAC,CAElC,CAQD,SAASmrB,EAAoBhL,EAAGngB,EAAGmpB,EAAI2D,EAAW,CAChD,IAAIC,EAAItE,EAAGxG,GAAG+K,GAGd,IAAKvE,EAAItI,EAAE,CAAC,EAAGsI,GAAK,GAAIA,GAAK,GAAI,EAAEzoB,EAGnC,MAAI,EAAEA,EAAI,GACRA,GAAKooB,EACL2E,EAAK,IAELA,EAAK,KAAK,MAAM/sB,EAAI,GAAKooB,CAAQ,EACjCpoB,GAAKooB,GAMPK,EAAIX,EAAQ,GAAIM,EAAWpoB,CAAC,EAC5BgtB,GAAK7M,EAAE4M,CAAE,EAAItE,EAAI,EAEbqE,GAAa,KACX9sB,EAAI,GACFA,GAAK,EAAGgtB,GAAKA,GAAK,IAAM,EACnBhtB,GAAK,IAAGgtB,GAAKA,GAAK,GAAK,GAChC/K,GAAIkH,EAAK,GAAK6D,IAAM,OAAS7D,EAAK,GAAK6D,IAAM,OAASA,IAAM,KAASA,IAAM,GAE3E/K,IAAKkH,EAAK,GAAK6D,GAAK,GAAKvE,GAAKU,EAAK,GAAK6D,GAAK,GAAKvE,EAAI,KACnDtI,EAAE4M,EAAK,CAAC,EAAItE,EAAI,IAAM,IAAMX,EAAQ,GAAI9nB,EAAI,CAAC,EAAI,IAC/CgtB,IAAMvE,EAAI,GAAKuE,IAAM,KAAO7M,EAAE4M,EAAK,CAAC,EAAItE,EAAI,IAAM,IAAM,EAG3DzoB,EAAI,GACFA,GAAK,EAAGgtB,GAAKA,GAAK,IAAO,EACpBhtB,GAAK,EAAGgtB,GAAKA,GAAK,IAAM,EACxBhtB,GAAK,IAAGgtB,GAAKA,GAAK,GAAK,GAChC/K,IAAK6K,GAAa3D,EAAK,IAAM6D,IAAM,MAAQ,CAACF,GAAa3D,EAAK,GAAK6D,IAAM,MAEzE/K,KAAM6K,GAAa3D,EAAK,IAAM6D,GAAK,GAAKvE,GACvC,CAACqE,GAAa3D,EAAK,GAAM6D,GAAK,GAAKvE,EAAI,KACrCtI,EAAE4M,EAAK,CAAC,EAAItE,EAAI,IAAO,IAAMX,EAAQ,GAAI9nB,EAAI,CAAC,EAAI,EAIlDiiB,EACR,CAMD,SAASgL,EAAYlnB,EAAKmnB,EAAQC,EAAS,CAOzC,QANIxE,EACFhT,EAAM,CAAC,CAAC,EACRyX,EACAptB,GAAI,EACJqtB,GAAOtnB,EAAI,OAEN/F,GAAIqtB,IAAO,CAChB,IAAKD,EAAOzX,EAAI,OAAQyX,KAASzX,EAAIyX,CAAI,GAAKF,EAE9C,IADAvX,EAAI,CAAC,GAAKoR,EAAS,QAAQhhB,EAAI,OAAO/F,IAAG,CAAC,EACrC2oB,EAAI,EAAGA,EAAIhT,EAAI,OAAQgT,IACtBhT,EAAIgT,CAAC,EAAIwE,EAAU,IACjBxX,EAAIgT,EAAI,CAAC,IAAM,SAAQhT,EAAIgT,EAAI,CAAC,EAAI,GACxChT,EAAIgT,EAAI,CAAC,GAAKhT,EAAIgT,CAAC,EAAIwE,EAAU,EACjCxX,EAAIgT,CAAC,GAAKwE,EAGf,CAED,OAAOxX,EAAI,SACZ,CAQD,SAASyT,EAAOV,EAAMvlB,EAAG,CACvB,IAAIslB,EAAGzjB,EAAKwV,EAEZ,GAAIrX,EAAE,SAAU,OAAOA,EAMvB6B,EAAM7B,EAAE,EAAE,OACN6B,EAAM,IACRyjB,EAAI,KAAK,KAAKzjB,EAAM,CAAC,EACrBwV,GAAK,EAAIsP,GAAQ,EAAGrB,CAAC,GAAG,aAExBA,EAAI,GACJjO,EAAI,gCAGNkO,EAAK,WAAaD,EAElBtlB,EAAI4mB,GAAarB,EAAM,EAAGvlB,EAAE,MAAMqX,CAAC,EAAG,IAAIkO,EAAK,CAAC,CAAC,EAGjD,QAAS1oB,EAAIyoB,EAAGzoB,KAAM,CACpB,IAAIstB,GAAQnqB,EAAE,MAAMA,CAAC,EACrBA,EAAImqB,GAAM,MAAMA,EAAK,EAAE,MAAMA,EAAK,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC,CACpD,CAED,OAAA5E,EAAK,WAAaD,EAEXtlB,CACR,CAMD,IAAIymB,EAAU,UAAY,CAGxB,SAAS2D,EAAgBpqB,EAAGslB,EAAG7P,EAAM,CACnC,IAAI4U,GACF/B,GAAQ,EACRzrB,GAAImD,EAAE,OAER,IAAKA,EAAIA,EAAE,MAAO,EAAEnD,MAClBwtB,GAAOrqB,EAAEnD,EAAC,EAAIyoB,EAAIgD,GAClBtoB,EAAEnD,EAAC,EAAIwtB,GAAO5U,EAAO,EACrB6S,GAAQ+B,GAAO5U,EAAO,EAGxB,OAAI6S,IAAOtoB,EAAE,QAAQsoB,EAAK,EAEnBtoB,CACR,CAED,SAASsqB,EAAQ5oB,EAAGC,EAAG4oB,EAAIC,GAAI,CAC7B,IAAI3tB,GAAGiiB,GAEP,GAAIyL,GAAMC,GACR1L,GAAIyL,EAAKC,GAAK,EAAI,OAElB,KAAK3tB,GAAIiiB,GAAI,EAAGjiB,GAAI0tB,EAAI1tB,KACtB,GAAI6E,EAAE7E,EAAC,GAAK8E,EAAE9E,EAAC,EAAG,CAChBiiB,GAAIpd,EAAE7E,EAAC,EAAI8E,EAAE9E,EAAC,EAAI,EAAI,GACtB,KACD,CAIL,OAAOiiB,EACR,CAED,SAAS2L,EAAS/oB,EAAGC,EAAG4oB,EAAI9U,GAAM,CAIhC,QAHI5Y,GAAI,EAGD0tB,KACL7oB,EAAE6oB,CAAE,GAAK1tB,GACTA,GAAI6E,EAAE6oB,CAAE,EAAI5oB,EAAE4oB,CAAE,EAAI,EAAI,EACxB7oB,EAAE6oB,CAAE,EAAI1tB,GAAI4Y,GAAO/T,EAAE6oB,CAAE,EAAI5oB,EAAE4oB,CAAE,EAIjC,KAAO,CAAC7oB,EAAE,CAAC,GAAKA,EAAE,OAAS,GAAIA,EAAE,OAClC,CAED,OAAO,SAAU1B,EAAGqX,EAAG0O,EAAIC,GAAI4C,GAAInT,GAAM,CACvC,IAAIiV,GAAKzU,GAAGpZ,GAAGyoB,GAAGqF,GAASC,GAAMC,GAAMC,GAAO1C,GAAG2C,GAAIC,GAAKC,GAAMC,GAAM7E,GAAIlmB,GAAGgrB,GAAIC,GAAIC,GACnFC,GAAIC,GACJhG,GAAOvlB,EAAE,YACT+U,GAAO/U,EAAE,GAAKqX,EAAE,EAAI,EAAI,GACxBsO,GAAK3lB,EAAE,EACP4lB,GAAKvO,EAAE,EAGT,GAAI,CAACsO,IAAM,CAACA,GAAG,CAAC,GAAK,CAACC,IAAM,CAACA,GAAG,CAAC,EAE/B,OAAO,IAAIL,GACT,CAACvlB,EAAE,GAAK,CAACqX,EAAE,IAAMsO,GAAKC,IAAMD,GAAG,CAAC,GAAKC,GAAG,CAAC,EAAI,CAACA,IAAM,IAGpDD,IAAMA,GAAG,CAAC,GAAK,GAAK,CAACC,GAAK7Q,GAAO,EAAIA,GAAO,CAAC,EAmBjD,IAhBIU,IACFkV,GAAU,EACV1U,GAAIjW,EAAE,EAAIqX,EAAE,IAEZ5B,GAAOuP,EACP2F,GAAU1F,EACVhP,GAAIyO,EAAU1kB,EAAE,EAAI2qB,EAAO,EAAIjG,EAAUrN,EAAE,EAAIsT,EAAO,GAGxDW,GAAK1F,GAAG,OACRwF,GAAKzF,GAAG,OACRyC,GAAI,IAAI7C,GAAKxQ,EAAI,EACjBgW,GAAK3C,GAAE,EAAI,GAINvrB,GAAI,EAAG+oB,GAAG/oB,EAAC,IAAM8oB,GAAG9oB,EAAC,GAAK,GAAIA,KAAI,CAavC,GAXI+oB,GAAG/oB,EAAC,GAAK8oB,GAAG9oB,EAAC,GAAK,IAAIoZ,KAEtB8P,GAAM,MACRM,GAAKN,EAAKR,GAAK,UACfS,GAAKT,GAAK,UACDqD,GACTvC,GAAKN,GAAM/lB,EAAE,EAAIqX,EAAE,GAAK,EAExBgP,GAAKN,EAGHM,GAAK,EACP0E,GAAG,KAAK,CAAC,EACTH,GAAO,OACF,CAOL,GAJAvE,GAAKA,GAAKsE,GAAU,EAAI,EACxB9tB,GAAI,EAGAyuB,IAAM,EAAG,CAMX,IALAhG,GAAI,EACJM,GAAKA,GAAG,CAAC,EACTS,MAGQxpB,GAAIuuB,IAAM9F,KAAMe,KAAMxpB,KAC5BsD,GAAImlB,GAAI7P,IAAQkQ,GAAG9oB,EAAC,GAAK,GACzBkuB,GAAGluB,EAAC,EAAIsD,GAAIylB,GAAK,EACjBN,GAAInlB,GAAIylB,GAAK,EAGfgF,GAAOtF,IAAKzoB,GAAIuuB,EAG1B,KAAe,CAiBL,IAdA9F,GAAI7P,IAAQmQ,GAAG,CAAC,EAAI,GAAK,EAErBN,GAAI,IACNM,GAAKwE,EAAgBxE,GAAIN,GAAG7P,EAAI,EAChCkQ,GAAKyE,EAAgBzE,GAAIL,GAAG7P,EAAI,EAChC6V,GAAK1F,GAAG,OACRwF,GAAKzF,GAAG,QAGVwF,GAAKG,GACLN,GAAMrF,GAAG,MAAM,EAAG2F,EAAE,EACpBL,GAAOD,GAAI,OAGJC,GAAOK,IAAKN,GAAIC,IAAM,EAAI,EAEjCM,GAAK3F,GAAG,QACR2F,GAAG,QAAQ,CAAC,EACZF,GAAMzF,GAAG,CAAC,EAENA,GAAG,CAAC,GAAKnQ,GAAO,GAAG,EAAE4V,GAEzB,GACE/F,GAAI,EAGJoF,GAAMJ,EAAQ1E,GAAIoF,GAAKM,GAAIL,EAAI,EAG3BP,GAAM,GAGRQ,GAAOF,GAAI,CAAC,EACRM,IAAML,KAAMC,GAAOA,GAAOzV,IAAQuV,GAAI,CAAC,GAAK,IAGhD1F,GAAI4F,GAAOG,GAAM,EAUb/F,GAAI,GACFA,IAAK7P,KAAM6P,GAAI7P,GAAO,GAG1BoV,GAAOT,EAAgBxE,GAAIN,GAAG7P,EAAI,EAClCqV,GAAQD,GAAK,OACbI,GAAOD,GAAI,OAGXN,GAAMJ,EAAQO,GAAMG,GAAKF,GAAOG,EAAI,EAGhCP,IAAO,IACTpF,KAGAmF,EAASI,GAAMS,GAAKR,GAAQS,GAAK3F,GAAIkF,GAAOrV,EAAI,KAO9C6P,IAAK,IAAGoF,GAAMpF,GAAI,GACtBuF,GAAOjF,GAAG,SAGZkF,GAAQD,GAAK,OACTC,GAAQG,IAAMJ,GAAK,QAAQ,CAAC,EAGhCJ,EAASO,GAAKH,GAAMI,GAAMxV,EAAI,EAG1BiV,IAAO,KACTO,GAAOD,GAAI,OAGXN,GAAMJ,EAAQ1E,GAAIoF,GAAKM,GAAIL,EAAI,EAG3BP,GAAM,IACRpF,KAGAmF,EAASO,GAAKM,GAAKL,GAAOM,GAAK3F,GAAIqF,GAAMxV,EAAI,IAIjDwV,GAAOD,GAAI,QACFN,KAAQ,IACjBpF,KACA0F,GAAM,CAAC,CAAC,GAIVD,GAAGluB,IAAG,EAAIyoB,GAGNoF,IAAOM,GAAI,CAAC,EACdA,GAAIC,IAAM,EAAItF,GAAGwF,EAAE,GAAK,GAExBH,GAAM,CAACrF,GAAGwF,EAAE,CAAC,EACbF,GAAO,UAGDE,KAAOC,IAAMJ,GAAI,CAAC,IAAM,SAAW3E,MAE7CuE,GAAOI,GAAI,CAAC,IAAM,MACnB,CAGID,GAAG,CAAC,GAAGA,GAAG,MAAK,CACrB,CAGD,GAAIJ,IAAW,EACbvC,GAAE,EAAInS,GACNgO,EAAU2G,OACL,CAGL,IAAK/tB,GAAI,EAAGyoB,GAAIyF,GAAG,CAAC,EAAGzF,IAAK,GAAIA,IAAK,GAAIzoB,KACzCurB,GAAE,EAAIvrB,GAAIoZ,GAAI0U,GAAU,EAExBtF,EAAS+C,GAAGQ,GAAK7C,EAAKqC,GAAE,EAAI,EAAIrC,EAAIC,GAAI4E,EAAI,CAC7C,CAED,OAAOxC,EACb,CACA,IAOG,SAAS/C,EAASrlB,EAAGqmB,EAAIL,EAAIwF,EAAa,CACzC,IAAInX,EAAQxX,EAAG2oB,GAAGF,GAAGuE,GAAI4B,GAAShC,GAAG9D,GAAI+F,GACvCnG,GAAOvlB,EAAE,YAGX2rB,EAAK,GAAItF,GAAM,KAAM,CAInB,GAHAV,GAAK3lB,EAAE,EAGH,CAAC2lB,GAAI,OAAO3lB,EAWhB,IAAKqU,EAAS,EAAGiR,GAAIK,GAAG,CAAC,EAAGL,IAAK,GAAIA,IAAK,GAAIjR,IAI9C,GAHAxX,EAAIwpB,EAAKhS,EAGLxX,EAAI,EACNA,GAAKooB,EACLO,GAAIa,EACJoD,GAAI9D,GAAG+F,GAAM,CAAC,EAGd7B,GAAKJ,GAAI9E,EAAQ,GAAItQ,EAASmR,GAAI,CAAC,EAAI,GAAK,UAE5CkG,GAAM,KAAK,MAAM7uB,EAAI,GAAKooB,CAAQ,EAClCK,GAAIK,GAAG,OACH+F,IAAOpG,GACT,GAAIkG,EAAa,CAGf,KAAOlG,MAAOoG,IAAM/F,GAAG,KAAK,CAAC,EAC7B8D,GAAII,GAAK,EACTxV,EAAS,EACTxX,GAAKooB,EACLO,GAAI3oB,EAAIooB,EAAW,CAC/B,KACY,OAAM0G,MAEH,CAIL,IAHAlC,GAAInE,GAAIK,GAAG+F,EAAG,EAGTrX,EAAS,EAAGiR,IAAK,GAAIA,IAAK,GAAIjR,IAGnCxX,GAAKooB,EAILO,GAAI3oB,EAAIooB,EAAW5Q,EAGnBwV,GAAKrE,GAAI,EAAI,EAAIiE,GAAI9E,EAAQ,GAAItQ,EAASmR,GAAI,CAAC,EAAI,GAAK,CACzD,CAmBH,GAfAgG,EAAcA,GAAenF,EAAK,GAChCV,GAAG+F,GAAM,CAAC,IAAM,SAAWlG,GAAI,EAAIiE,GAAIA,GAAI9E,EAAQ,GAAItQ,EAASmR,GAAI,CAAC,GAMvEiG,GAAUzF,EAAK,GACV6D,IAAM2B,KAAiBxF,GAAM,GAAKA,IAAOhmB,EAAE,EAAI,EAAI,EAAI,IACxD6pB,GAAK,GAAKA,IAAM,IAAM7D,GAAM,GAAKwF,GAAexF,GAAM,IAGpDnpB,EAAI,EAAI2oB,GAAI,EAAIiE,GAAI9E,EAAQ,GAAItQ,EAASmR,EAAC,EAAI,EAAIG,GAAG+F,GAAM,CAAC,GAAK,GAAM,GACvE1F,IAAOhmB,EAAE,EAAI,EAAI,EAAI,IAEvBqmB,EAAK,GAAK,CAACV,GAAG,CAAC,EACjB,OAAAA,GAAG,OAAS,EACR8F,IAGFpF,GAAMrmB,EAAE,EAAI,EAGZ2lB,GAAG,CAAC,EAAIhB,EAAQ,IAAKM,EAAWoB,EAAKpB,GAAYA,CAAQ,EACzDjlB,EAAE,EAAI,CAACqmB,GAAM,GAIbV,GAAG,CAAC,EAAI3lB,EAAE,EAAI,EAGTA,EAiBT,GAbInD,GAAK,GACP8oB,GAAG,OAAS+F,GACZpG,GAAI,EACJoG,OAEA/F,GAAG,OAAS+F,GAAM,EAClBpG,GAAIX,EAAQ,GAAIM,EAAWpoB,CAAC,EAI5B8oB,GAAG+F,EAAG,EAAIlG,GAAI,GAAKiE,GAAI9E,EAAQ,GAAItQ,EAASmR,EAAC,EAAIb,EAAQ,GAAIa,EAAC,EAAI,GAAKF,GAAI,GAGzEmG,GACF,OAGE,GAAIC,IAAO,EAAG,CAGZ,IAAK7uB,EAAI,EAAG2oB,GAAIG,GAAG,CAAC,EAAGH,IAAK,GAAIA,IAAK,GAAI3oB,IAEzC,IADA2oB,GAAIG,GAAG,CAAC,GAAKL,GACRA,GAAI,EAAGE,IAAK,GAAIA,IAAK,GAAIF,KAG1BzoB,GAAKyoB,KACPtlB,EAAE,IACE2lB,GAAG,CAAC,GAAKX,IAAMW,GAAG,CAAC,EAAI,IAG7B,KACZ,KAAiB,CAEL,GADAA,GAAG+F,EAAG,GAAKpG,GACPK,GAAG+F,EAAG,GAAK1G,EAAM,MACrBW,GAAG+F,IAAK,EAAI,EACZpG,GAAI,CACL,CAKL,IAAKzoB,EAAI8oB,GAAG,OAAQA,GAAG,EAAE9oB,CAAC,IAAM,GAAI8oB,GAAG,KACxC,CAED,OAAIvB,IAGEpkB,EAAE,EAAIulB,GAAK,MAGbvlB,EAAE,EAAI,KACNA,EAAE,EAAI,KAGGA,EAAE,EAAIulB,GAAK,OAGpBvlB,EAAE,EAAI,EACNA,EAAE,EAAI,CAAC,CAAC,IAKLA,CACR,CAGD,SAAS8oB,EAAe9oB,EAAG4rB,EAAOvF,EAAI,CACpC,GAAI,CAACrmB,EAAE,SAAQ,EAAI,OAAO6rB,GAAkB7rB,CAAC,EAC7C,IAAIslB,EACFrP,EAAIjW,EAAE,EACN4C,EAAM4jB,EAAexmB,EAAE,CAAC,EACxB6B,GAAMe,EAAI,OAEZ,OAAIgpB,GACEvF,IAAOf,EAAIe,EAAKxkB,IAAO,EACzBe,EAAMA,EAAI,OAAO,CAAC,EAAI,IAAMA,EAAI,MAAM,CAAC,EAAI8mB,GAAcpE,CAAC,EACjDzjB,GAAM,IACfe,EAAMA,EAAI,OAAO,CAAC,EAAI,IAAMA,EAAI,MAAM,CAAC,GAGzCA,EAAMA,GAAO5C,EAAE,EAAI,EAAI,IAAM,MAAQA,EAAE,GAC9BiW,EAAI,GACbrT,EAAM,KAAO8mB,GAAc,CAACzT,EAAI,CAAC,EAAIrT,EACjCyjB,IAAOf,EAAIe,EAAKxkB,IAAO,IAAGe,GAAO8mB,GAAcpE,CAAC,IAC3CrP,GAAKpU,IACde,GAAO8mB,GAAczT,EAAI,EAAIpU,EAAG,EAC5BwkB,IAAOf,EAAIe,EAAKpQ,EAAI,GAAK,IAAGrT,EAAMA,EAAM,IAAM8mB,GAAcpE,CAAC,MAE5DA,EAAIrP,EAAI,GAAKpU,KAAKe,EAAMA,EAAI,MAAM,EAAG0iB,CAAC,EAAI,IAAM1iB,EAAI,MAAM0iB,CAAC,GAC5De,IAAOf,EAAIe,EAAKxkB,IAAO,IACrBoU,EAAI,IAAMpU,KAAKe,GAAO,KAC1BA,GAAO8mB,GAAcpE,CAAC,IAInB1iB,CACR,CAID,SAASulB,GAAkB9T,EAAQ4B,EAAG,CACpC,IAAIwT,EAAIpV,EAAO,CAAC,EAGhB,IAAM4B,GAAKgP,EAAUwE,GAAK,GAAIA,GAAK,GAAIxT,IACvC,OAAOA,CACR,CAGD,SAAS8R,EAAQxC,EAAMc,EAAIN,EAAI,CAC7B,GAAIM,EAAKlB,EAGP,MAAAf,EAAW,GACP2B,IAAIR,EAAK,UAAYQ,GACnB,MAAMxB,CAAsB,EAEpC,OAAOc,EAAS,IAAIE,EAAK1B,CAAI,EAAGwC,EAAI,EAAG,EAAI,CAC5C,CAGD,SAASe,EAAM7B,EAAMc,EAAIL,EAAI,CAC3B,GAAIK,EAAKjB,EAAc,MAAM,MAAMb,CAAsB,EACzD,OAAOc,EAAS,IAAIE,EAAKzB,CAAE,EAAGuC,EAAIL,EAAI,EAAI,CAC3C,CAGD,SAASwC,GAAanU,EAAQ,CAC5B,IAAIoV,EAAIpV,EAAO,OAAS,EACtBxS,EAAM4nB,EAAIxE,EAAW,EAKvB,GAHAwE,EAAIpV,EAAOoV,CAAC,EAGRA,EAAG,CAGL,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAI5nB,IAG7B,IAAK4nB,EAAIpV,EAAO,CAAC,EAAGoV,GAAK,GAAIA,GAAK,GAAI5nB,GACvC,CAED,OAAOA,CACR,CAGD,SAAS6nB,GAAcpE,EAAG,CAExB,QADIwG,EAAK,GACFxG,KAAMwG,GAAM,IACnB,OAAOA,CACR,CAUD,SAASxC,GAAO/D,EAAMvlB,EAAGwV,EAAGuQ,EAAI,CAC9B,IAAIyF,EACF1M,EAAI,IAAIyG,EAAK,CAAC,EAIdD,GAAI,KAAK,KAAKS,EAAKd,EAAW,CAAC,EAIjC,IAFAb,EAAW,KAEF,CAOP,GANI5O,EAAI,IACNsJ,EAAIA,EAAE,MAAM9e,CAAC,EACT+rB,GAASjN,EAAE,EAAGwG,EAAC,IAAGkG,EAAc,KAGtChW,EAAIkP,EAAUlP,EAAI,CAAC,EACfA,IAAM,EAAG,CAGXA,EAAIsJ,EAAE,EAAE,OAAS,EACb0M,GAAe1M,EAAE,EAAEtJ,CAAC,IAAM,GAAG,EAAEsJ,EAAE,EAAEtJ,CAAC,EACxC,KACD,CAEDxV,EAAIA,EAAE,MAAMA,CAAC,EACb+rB,GAAS/rB,EAAE,EAAGslB,EAAC,CAChB,CAED,OAAAlB,EAAW,GAEJtF,CACR,CAGD,SAASkN,GAAMxW,EAAG,CAChB,OAAOA,EAAE,EAAEA,EAAE,EAAE,OAAS,CAAC,EAAI,CAC9B,CAMD,SAASyW,GAAS1G,EAAMlc,EAAM6iB,EAAM,CAKlC,QAJI7U,EACFrX,EAAI,IAAIulB,EAAKlc,EAAK,CAAC,CAAC,EACpBxM,EAAI,EAEC,EAAEA,EAAIwM,EAAK,QAEhB,GADAgO,EAAI,IAAIkO,EAAKlc,EAAKxM,CAAC,CAAC,EACfwa,EAAE,EAGIrX,EAAEksB,CAAI,EAAE7U,CAAC,IAClBrX,EAAIqX,OAJI,CACRrX,EAAIqX,EACJ,KACD,CAKH,OAAOrX,CACR,CAkCD,SAASqoB,GAAmBroB,EAAGqmB,EAAI,CACjC,IAAIqB,EAAaG,EAAO,EAAGsE,EAAKC,GAAKjsB,GAAGknB,GACtCjB,GAAM,EACNvpB,GAAI,EACJyoB,GAAI,EACJC,GAAOvlB,EAAE,YACTgmB,GAAKT,GAAK,SACVQ,GAAKR,GAAK,UAGZ,GAAI,CAACvlB,EAAE,GAAK,CAACA,EAAE,EAAE,CAAC,GAAKA,EAAE,EAAI,GAE3B,OAAO,IAAIulB,GAAKvlB,EAAE,EACbA,EAAE,EAAE,CAAC,EAAQA,EAAE,EAAI,EAAI,EAAI,IAAlB,EACVA,EAAE,EAAIA,EAAE,EAAI,EAAI,EAAIA,EAAI,GAAK,EAanC,IAVIqmB,GAAM,MACRjC,EAAW,GACXiD,GAAMtB,IAENsB,GAAMhB,EAGRlmB,GAAI,IAAIolB,GAAK,MAAO,EAGbvlB,EAAE,EAAI,IAGXA,EAAIA,EAAE,MAAMG,EAAC,EACbmlB,IAAK,EAUP,IALAuC,EAAQ,KAAK,IAAIlD,EAAQ,EAAGW,EAAC,CAAC,EAAI,KAAK,KAAO,EAAI,EAAI,EACtD+B,IAAOQ,EACPH,EAAcyE,EAAMC,GAAM,IAAI7G,GAAK,CAAC,EACpCA,GAAK,UAAY8B,KAER,CAKP,GAJA8E,EAAM9G,EAAS8G,EAAI,MAAMnsB,CAAC,EAAGqnB,GAAK,CAAC,EACnCK,EAAcA,EAAY,MAAM,EAAE7qB,EAAC,EACnCsD,GAAIisB,GAAI,KAAK3F,EAAO0F,EAAKzE,EAAaL,GAAK,CAAC,CAAC,EAEzCb,EAAermB,GAAE,CAAC,EAAE,MAAM,EAAGknB,EAAG,IAAMb,EAAe4F,GAAI,CAAC,EAAE,MAAM,EAAG/E,EAAG,EAAG,CAE7E,IADA,EAAI/B,GACG,KAAK8G,GAAM/G,EAAS+G,GAAI,MAAMA,EAAG,EAAG/E,GAAK,CAAC,EAOjD,GAAIhB,GAAM,KAER,GAAID,GAAM,GAAK4B,EAAoBoE,GAAI,EAAG/E,GAAMQ,EAAO7B,GAAII,EAAG,EAC5Db,GAAK,UAAY8B,IAAO,GACxBK,EAAcyE,EAAMhsB,GAAI,IAAIolB,GAAK,CAAC,EAClC1oB,GAAI,EACJupB,SAEA,QAAOf,EAAS+G,GAAK7G,GAAK,UAAYQ,GAAIC,GAAI5B,EAAW,EAAI,MAG/D,QAAAmB,GAAK,UAAYQ,GACVqG,EAEV,CAEDA,GAAMjsB,EACP,CACF,CAkBD,SAAS2nB,GAAiBzQ,EAAGgP,EAAI,CAC/B,IAAIna,EAAGmgB,EAAI3E,EAAazR,EAAGqW,GAAWlG,GAAKgG,GAAKjsB,GAAGknB,GAAKkF,GAAI/E,GAC1DhS,GAAI,EACJqS,GAAQ,GACR7nB,GAAIqX,EACJsO,GAAK3lB,GAAE,EACPulB,GAAOvlB,GAAE,YACTgmB,GAAKT,GAAK,SACVQ,GAAKR,GAAK,UAGZ,GAAIvlB,GAAE,EAAI,GAAK,CAAC2lB,IAAM,CAACA,GAAG,CAAC,GAAK,CAAC3lB,GAAE,GAAK2lB,GAAG,CAAC,GAAK,GAAKA,GAAG,QAAU,EACjE,OAAO,IAAIJ,GAAKI,IAAM,CAACA,GAAG,CAAC,EAAI,KAAS3lB,GAAE,GAAK,EAAI,IAAM2lB,GAAK,EAAI3lB,EAAC,EAcrE,GAXIqmB,GAAM,MACRjC,EAAW,GACXiD,GAAMtB,IAENsB,GAAMhB,EAGRd,GAAK,UAAY8B,IAAOQ,GACxB3b,EAAIsa,EAAeb,EAAE,EACrB0G,EAAKngB,EAAE,OAAO,CAAC,EAEX,KAAK,IAAI+J,EAAIjW,GAAE,CAAC,EAAI,MAAQ,CAa9B,KAAOqsB,EAAK,GAAKA,GAAM,GAAKA,GAAM,GAAKngB,EAAE,OAAO,CAAC,EAAI,GACnDlM,GAAIA,GAAE,MAAMqX,CAAC,EACbnL,EAAIsa,EAAexmB,GAAE,CAAC,EACtBqsB,EAAKngB,EAAE,OAAO,CAAC,EACfsJ,KAGFS,EAAIjW,GAAE,EAEFqsB,EAAK,GACPrsB,GAAI,IAAIulB,GAAK,KAAOrZ,CAAC,EACrB+J,KAEAjW,GAAI,IAAIulB,GAAK8G,EAAK,IAAMngB,EAAE,MAAM,CAAC,CAAC,CAE1C,KAKM,QAAA/L,GAAI4nB,EAAQxC,GAAM8B,GAAM,EAAGtB,EAAE,EAAE,MAAM9P,EAAI,EAAE,EAC3CjW,GAAI8nB,GAAiB,IAAIvC,GAAK8G,EAAK,IAAMngB,EAAE,MAAM,CAAC,CAAC,EAAGmb,GAAMQ,EAAK,EAAE,KAAK1nB,EAAC,EACzEolB,GAAK,UAAYQ,GAEVM,GAAM,KAAOhB,EAASrlB,GAAG+lB,GAAIC,GAAI5B,EAAW,EAAI,EAAIpkB,GAa7D,IATAusB,GAAKvsB,GAKLosB,GAAME,GAAYtsB,GAAIymB,EAAOzmB,GAAE,MAAM,CAAC,EAAGA,GAAE,KAAK,CAAC,EAAGqnB,GAAK,CAAC,EAC1DG,GAAKnC,EAASrlB,GAAE,MAAMA,EAAC,EAAGqnB,GAAK,CAAC,EAChCK,EAAc,IAEL,CAIP,GAHA4E,GAAYjH,EAASiH,GAAU,MAAM9E,EAAE,EAAGH,GAAK,CAAC,EAChDlnB,GAAIisB,GAAI,KAAK3F,EAAO6F,GAAW,IAAI/G,GAAKmC,CAAW,EAAGL,GAAK,CAAC,CAAC,EAEzDb,EAAermB,GAAE,CAAC,EAAE,MAAM,EAAGknB,EAAG,IAAMb,EAAe4F,GAAI,CAAC,EAAE,MAAM,EAAG/E,EAAG,EAc1E,GAbA+E,GAAMA,GAAI,MAAM,CAAC,EAIbnW,IAAM,IAAGmW,GAAMA,GAAI,KAAKrE,EAAQxC,GAAM8B,GAAM,EAAGtB,EAAE,EAAE,MAAM9P,EAAI,EAAE,CAAC,GACpEmW,GAAM3F,EAAO2F,GAAK,IAAI7G,GAAK/P,EAAC,EAAG6R,GAAK,CAAC,EAQjChB,GAAM,KACR,GAAI2B,EAAoBoE,GAAI,EAAG/E,GAAMQ,GAAO7B,GAAII,EAAG,EACjDb,GAAK,UAAY8B,IAAOQ,GACxB1nB,GAAImsB,GAAYtsB,GAAIymB,EAAO8F,GAAG,MAAM,CAAC,EAAGA,GAAG,KAAK,CAAC,EAAGlF,GAAK,CAAC,EAC1DG,GAAKnC,EAASrlB,GAAE,MAAMA,EAAC,EAAGqnB,GAAK,CAAC,EAChCK,EAActB,GAAM,MAEpB,QAAOf,EAAS+G,GAAK7G,GAAK,UAAYQ,GAAIC,GAAI5B,EAAW,EAAI,MAG/D,QAAAmB,GAAK,UAAYQ,GACVqG,GAIXA,GAAMjsB,GACNunB,GAAe,CAChB,CACF,CAID,SAASmE,GAAkB7rB,EAAG,CAE5B,OAAO,OAAOA,EAAE,EAAIA,EAAE,EAAI,CAAC,CAC5B,CAMD,SAASwsB,GAAaxsB,EAAG4C,EAAK,CAC5B,IAAIqT,EAAGpZ,EAAGgF,EAmBV,KAhBKoU,EAAIrT,EAAI,QAAQ,GAAG,GAAK,KAAIA,EAAMA,EAAI,QAAQ,IAAK,EAAE,IAGrD/F,EAAI+F,EAAI,OAAO,IAAI,GAAK,GAGvBqT,EAAI,IAAGA,EAAIpZ,GACfoZ,GAAK,CAACrT,EAAI,MAAM/F,EAAI,CAAC,EACrB+F,EAAMA,EAAI,UAAU,EAAG/F,CAAC,GACfoZ,EAAI,IAGbA,EAAIrT,EAAI,QAIL/F,EAAI,EAAG+F,EAAI,WAAW/F,CAAC,IAAM,GAAIA,IAAI,CAG1C,IAAKgF,EAAMe,EAAI,OAAQA,EAAI,WAAWf,EAAM,CAAC,IAAM,GAAI,EAAEA,EAAI,CAG7D,GAFAe,EAAMA,EAAI,MAAM/F,EAAGgF,CAAG,EAElBe,EAAK,CAYP,GAXAf,GAAOhF,EACPmD,EAAE,EAAIiW,EAAIA,EAAIpZ,EAAI,EAClBmD,EAAE,EAAI,GAMNnD,GAAKoZ,EAAI,GAAKgP,EACVhP,EAAI,IAAGpZ,GAAKooB,GAEZpoB,EAAIgF,EAAK,CAEX,IADIhF,GAAGmD,EAAE,EAAE,KAAK,CAAC4C,EAAI,MAAM,EAAG/F,CAAC,CAAC,EAC3BgF,GAAOojB,EAAUpoB,EAAIgF,GAAM7B,EAAE,EAAE,KAAK,CAAC4C,EAAI,MAAM/F,EAAGA,GAAKooB,CAAQ,CAAC,EACrEriB,EAAMA,EAAI,MAAM/F,CAAC,EACjBA,EAAIooB,EAAWriB,EAAI,MAC3B,MACQ/F,GAAKgF,EAGP,KAAOhF,KAAM+F,GAAO,IACpB5C,EAAE,EAAE,KAAK,CAAC4C,CAAG,EAETwhB,IAGEpkB,EAAE,EAAIA,EAAE,YAAY,MAGtBA,EAAE,EAAI,KACNA,EAAE,EAAI,KAGGA,EAAE,EAAIA,EAAE,YAAY,OAG7BA,EAAE,EAAI,EACNA,EAAE,EAAI,CAAC,CAAC,GAIlB,MAGMA,EAAE,EAAI,EACNA,EAAE,EAAI,CAAC,CAAC,EAGV,OAAOA,CACR,CAMD,SAASysB,GAAWzsB,EAAG4C,EAAK,CAC1B,IAAI6S,EAAM8P,EAAMmH,EAAS7vB,EAAG8vB,GAAS9qB,GAAK2F,GAAGme,GAAIsC,GAEjD,GAAIrlB,EAAI,QAAQ,GAAG,EAAI,IAErB,GADAA,EAAMA,EAAI,QAAQ,eAAgB,IAAI,EAClCmiB,EAAU,KAAKniB,CAAG,EAAG,OAAO4pB,GAAaxsB,EAAG4C,CAAG,UAC1CA,IAAQ,YAAcA,IAAQ,MACvC,MAAK,CAACA,IAAK5C,EAAE,EAAI,KACjBA,EAAE,EAAI,IACNA,EAAE,EAAI,KACCA,EAGT,GAAI6kB,EAAM,KAAKjiB,CAAG,EAChB6S,EAAO,GACP7S,EAAMA,EAAI,sBACDgiB,EAAS,KAAKhiB,CAAG,EAC1B6S,EAAO,UACEqP,EAAQ,KAAKliB,CAAG,EACzB6S,EAAO,MAEP,OAAM,MAAM6O,EAAkB1hB,CAAG,EAgCnC,IA5BA/F,EAAI+F,EAAI,OAAO,IAAI,EAEf/F,EAAI,GACN2K,GAAI,CAAC5E,EAAI,MAAM/F,EAAI,CAAC,EACpB+F,EAAMA,EAAI,UAAU,EAAG/F,CAAC,GAExB+F,EAAMA,EAAI,MAAM,CAAC,EAKnB/F,EAAI+F,EAAI,QAAQ,GAAG,EACnB+pB,GAAU9vB,GAAK,EACf0oB,EAAOvlB,EAAE,YAEL2sB,KACF/pB,EAAMA,EAAI,QAAQ,IAAK,EAAE,EACzBf,GAAMe,EAAI,OACV/F,EAAIgF,GAAMhF,EAGV6vB,EAAUpD,GAAO/D,EAAM,IAAIA,EAAK9P,CAAI,EAAG5Y,EAAGA,EAAI,CAAC,GAGjD8oB,GAAKmE,EAAYlnB,EAAK6S,EAAMuP,CAAI,EAChCiD,GAAKtC,GAAG,OAAS,EAGZ9oB,EAAIorB,GAAItC,GAAG9oB,CAAC,IAAM,EAAG,EAAEA,EAAG8oB,GAAG,MAClC,OAAI9oB,EAAI,EAAU,IAAI0oB,EAAKvlB,EAAE,EAAI,CAAC,GAClCA,EAAE,EAAImoB,GAAkBxC,GAAIsC,EAAE,EAC9BjoB,EAAE,EAAI2lB,GACNvB,EAAW,GAQPuI,KAAS3sB,EAAIymB,EAAOzmB,EAAG0sB,EAAS7qB,GAAM,CAAC,GAGvC2F,KAAGxH,EAAIA,EAAE,MAAM,KAAK,IAAIwH,EAAC,EAAI,GAAKmd,EAAQ,EAAGnd,EAAC,EAAIwc,EAAQ,IAAI,EAAGxc,EAAC,CAAC,GACvE4c,EAAW,GAEJpkB,EACR,CAQD,SAASyoB,EAAKlD,EAAMvlB,EAAG,CACrB,IAAIslB,EACFzjB,EAAM7B,EAAE,EAAE,OAEZ,GAAI6B,EAAM,EACR,OAAO7B,EAAE,OAAQ,EAAGA,EAAI4mB,GAAarB,EAAM,EAAGvlB,EAAGA,CAAC,EAQpDslB,EAAI,IAAM,KAAK,KAAKzjB,CAAG,EACvByjB,EAAIA,EAAI,GAAK,GAAKA,EAAI,EAEtBtlB,EAAIA,EAAE,MAAM,EAAI2mB,GAAQ,EAAGrB,CAAC,CAAC,EAC7BtlB,EAAI4mB,GAAarB,EAAM,EAAGvlB,EAAGA,CAAC,EAO9B,QAJI4sB,EACF5F,EAAK,IAAIzB,EAAK,CAAC,EACf0B,GAAM,IAAI1B,EAAK,EAAE,EACjB2B,GAAM,IAAI3B,EAAK,EAAE,EACZD,KACLsH,EAAS5sB,EAAE,MAAMA,CAAC,EAClBA,EAAIA,EAAE,MAAMgnB,EAAG,KAAK4F,EAAO,MAAM3F,GAAI,MAAM2F,CAAM,EAAE,MAAM1F,EAAG,CAAC,CAAC,CAAC,EAGjE,OAAOlnB,CACR,CAID,SAAS4mB,GAAarB,EAAM/P,EAAGxV,EAAGqX,EAAGwV,EAAc,KAC7CrH,EAAGrlB,GAAG2sB,GAAGtF,GAEXzB,GAAKR,EAAK,UACVD,GAAI,KAAK,KAAKS,GAAKd,CAAQ,EAM7B,IAJAb,EAAW,GACXoD,GAAKxnB,EAAE,MAAMA,CAAC,EACd8sB,GAAI,IAAIvH,EAAKlO,CAAC,IAEL,CAMP,GALAlX,GAAIsmB,EAAOqG,GAAE,MAAMtF,EAAE,EAAG,IAAIjC,EAAK/P,IAAMA,GAAG,EAAGuQ,GAAI,CAAC,EAClD+G,GAAID,EAAexV,EAAE,KAAKlX,EAAC,EAAIkX,EAAE,MAAMlX,EAAC,EACxCkX,EAAIoP,EAAOtmB,GAAE,MAAMqnB,EAAE,EAAG,IAAIjC,EAAK/P,IAAMA,GAAG,EAAGuQ,GAAI,CAAC,EAClD5lB,GAAI2sB,GAAE,KAAKzV,CAAC,EAERlX,GAAE,EAAEmlB,EAAC,IAAM,OAAQ,CACrB,IAAKE,EAAIF,GAAGnlB,GAAE,EAAEqlB,CAAC,IAAMsH,GAAE,EAAEtH,CAAC,GAAKA,KAAK,CACtC,GAAIA,GAAK,GAAI,KACd,CAEDA,EAAIsH,GACJA,GAAIzV,EACJA,EAAIlX,GACJA,GAAIqlB,CAEL,CAED,OAAApB,EAAW,GACXjkB,GAAE,EAAE,OAASmlB,GAAI,EAEVnlB,EACR,CAID,SAASwmB,GAAQhlB,EAAGsU,EAAG,CAErB,QADIT,EAAI7T,EACD,EAAEsU,GAAGT,GAAK7T,EACjB,OAAO6T,CACR,CAID,SAAS0Q,GAAiBX,EAAMvlB,EAAG,CACjC,IAAIG,EACF4sB,EAAQ/sB,EAAE,EAAI,EACdgtB,EAAK5F,EAAM7B,EAAMA,EAAK,UAAW,CAAC,EAClC4B,EAAS6F,EAAG,MAAM,EAAG,EAIvB,GAFAhtB,EAAIA,EAAE,MAEFA,EAAE,IAAImnB,CAAM,EACd,OAAAhD,EAAW4I,EAAQ,EAAI,EAChB/sB,EAKT,GAFAG,EAAIH,EAAE,SAASgtB,CAAE,EAEb7sB,EAAE,SACJgkB,EAAW4I,EAAQ,EAAI,MAClB,CAIL,GAHA/sB,EAAIA,EAAE,MAAMG,EAAE,MAAM6sB,CAAE,CAAC,EAGnBhtB,EAAE,IAAImnB,CAAM,EACd,OAAAhD,EAAW6H,GAAM7rB,CAAC,EAAK4sB,EAAQ,EAAI,EAAMA,EAAQ,EAAI,EAC9C/sB,EAGTmkB,EAAW6H,GAAM7rB,CAAC,EAAK4sB,EAAQ,EAAI,EAAMA,EAAQ,EAAI,CACtD,CAED,OAAO/sB,EAAE,MAAMgtB,CAAE,EAAE,IAAG,CACvB,CAQD,SAASrE,GAAe3oB,EAAGgqB,EAAS3D,EAAIL,EAAI,CAC1C,IAAIvQ,EAAMQ,EAAGpZ,GAAGyoB,GAAGzjB,GAAK4pB,GAAS7oB,GAAK+iB,GAAItO,GACxCkO,GAAOvlB,EAAE,YACT4rB,GAAQvF,IAAO,OAWjB,GATIuF,IACF/C,EAAWxC,EAAI,EAAG1C,CAAU,EACxBqC,IAAO,OAAQA,EAAKT,GAAK,SACxBsD,EAAW7C,EAAI,EAAG,CAAC,IAExBK,EAAKd,GAAK,UACVS,EAAKT,GAAK,UAGR,CAACvlB,EAAE,WACL4C,GAAMipB,GAAkB7rB,CAAC,MACpB,CAoCL,IAnCA4C,GAAMkmB,EAAe9oB,CAAC,EACtBnD,GAAI+F,GAAI,QAAQ,GAAG,EAOfgpB,IACFnW,EAAO,EACHuU,GAAW,GACb3D,EAAKA,EAAK,EAAI,EACL2D,GAAW,IACpB3D,EAAKA,EAAK,EAAI,IAGhB5Q,EAAOuU,EAOLntB,IAAK,IACP+F,GAAMA,GAAI,QAAQ,IAAK,EAAE,EACzByU,GAAI,IAAIkO,GAAK,CAAC,EACdlO,GAAE,EAAIzU,GAAI,OAAS/F,GACnBwa,GAAE,EAAIyS,EAAYhB,EAAezR,EAAC,EAAG,GAAI5B,CAAI,EAC7C4B,GAAE,EAAIA,GAAE,EAAE,QAGZsO,GAAKmE,EAAYlnB,GAAK,GAAI6S,CAAI,EAC9BQ,EAAIpU,GAAM8jB,GAAG,OAGNA,GAAG,EAAE9jB,EAAG,GAAK,GAAI8jB,GAAG,MAE3B,GAAI,CAACA,GAAG,CAAC,EACP/iB,GAAMgpB,GAAQ,OAAS,QAClB,CAyBL,GAxBI/uB,GAAI,EACNoZ,KAEAjW,EAAI,IAAIulB,GAAKvlB,CAAC,EACdA,EAAE,EAAI2lB,GACN3lB,EAAE,EAAIiW,EACNjW,EAAIymB,EAAOzmB,EAAGqX,GAAGgP,EAAIL,EAAI,EAAGvQ,CAAI,EAChCkQ,GAAK3lB,EAAE,EACPiW,EAAIjW,EAAE,EACNyrB,GAAUxH,GAIZpnB,GAAI8oB,GAAGU,CAAE,EACTf,GAAI7P,EAAO,EACXgW,GAAUA,IAAW9F,GAAGU,EAAK,CAAC,IAAM,OAEpCoF,GAAUzF,EAAK,GACVnpB,KAAM,QAAU4uB,MAAazF,IAAO,GAAKA,KAAQhmB,EAAE,EAAI,EAAI,EAAI,IAChEnD,GAAIyoB,IAAKzoB,KAAMyoB,KAAMU,IAAO,GAAKyF,IAAWzF,IAAO,GAAKL,GAAGU,EAAK,CAAC,EAAI,GACrEL,KAAQhmB,EAAE,EAAI,EAAI,EAAI,IAE1B2lB,GAAG,OAASU,EAERoF,GAGF,KAAO,EAAE9F,GAAG,EAAEU,CAAE,EAAI5Q,EAAO,GACzBkQ,GAAGU,CAAE,EAAI,EACJA,IACH,EAAEpQ,EACF0P,GAAG,QAAQ,CAAC,GAMlB,IAAK9jB,GAAM8jB,GAAG,OAAQ,CAACA,GAAG9jB,GAAM,CAAC,EAAG,EAAEA,GAAI,CAG1C,IAAKhF,GAAI,EAAG+F,GAAM,GAAI/F,GAAIgF,GAAKhF,KAAK+F,IAAOghB,EAAS,OAAO+B,GAAG9oB,EAAC,CAAC,EAGhE,GAAI+uB,GAAO,CACT,GAAI/pB,GAAM,EACR,GAAImoB,GAAW,IAAMA,GAAW,EAAG,CAEjC,IADAntB,GAAImtB,GAAW,GAAK,EAAI,EACnB,EAAEnoB,GAAKA,GAAMhF,GAAGgF,KAAOe,IAAO,IAEnC,IADA+iB,GAAKmE,EAAYlnB,GAAK6S,EAAMuU,CAAO,EAC9BnoB,GAAM8jB,GAAG,OAAQ,CAACA,GAAG9jB,GAAM,CAAC,EAAG,EAAEA,GAAI,CAG1C,IAAKhF,GAAI,EAAG+F,GAAM,KAAM/F,GAAIgF,GAAKhF,KAAK+F,IAAOghB,EAAS,OAAO+B,GAAG9oB,EAAC,CAAC,CAChF,MACc+F,GAAMA,GAAI,OAAO,CAAC,EAAI,IAAMA,GAAI,MAAM,CAAC,EAI3CA,GAAOA,IAAOqT,EAAI,EAAI,IAAM,MAAQA,CAC9C,SAAmBA,EAAI,EAAG,CAChB,KAAO,EAAEA,GAAIrT,GAAM,IAAMA,GACzBA,GAAM,KAAOA,EACvB,SACc,EAAEqT,EAAIpU,GAAK,IAAKoU,GAAKpU,GAAKoU,KAAOrT,IAAO,SACnCqT,EAAIpU,KAAKe,GAAMA,GAAI,MAAM,EAAGqT,CAAC,EAAI,IAAMrT,GAAI,MAAMqT,CAAC,EAE9D,CAEDrT,IAAOonB,GAAW,GAAK,KAAOA,GAAW,EAAI,KAAOA,GAAW,EAAI,KAAO,IAAMpnB,EACjF,CAED,OAAO5C,EAAE,EAAI,EAAI,IAAM4C,GAAMA,EAC9B,CAID,SAASmpB,GAASvZ,EAAK3Q,EAAK,CAC1B,GAAI2Q,EAAI,OAAS3Q,EACf,OAAA2Q,EAAI,OAAS3Q,EACN,EAEV,CAyDD,SAASorB,GAAIjtB,EAAG,CACd,OAAO,IAAI,KAAKA,CAAC,EAAE,IAAG,CACvB,CASD,SAASktB,GAAKltB,EAAG,CACf,OAAO,IAAI,KAAKA,CAAC,EAAE,KAAI,CACxB,CAUD,SAASwX,GAAMxX,EAAG,CAChB,OAAO,IAAI,KAAKA,CAAC,EAAE,MAAK,CACzB,CAWD,SAASmtB,GAAIntB,EAAGqX,EAAG,CACjB,OAAO,IAAI,KAAKrX,CAAC,EAAE,KAAKqX,CAAC,CAC1B,CAUD,SAAS+V,GAAKptB,EAAG,CACf,OAAO,IAAI,KAAKA,CAAC,EAAE,KAAI,CACxB,CAUD,SAASyX,GAAMzX,EAAG,CAChB,OAAO,IAAI,KAAKA,CAAC,EAAE,MAAK,CACzB,CAUD,SAASqtB,GAAKrtB,EAAG,CACf,OAAO,IAAI,KAAKA,CAAC,EAAE,KAAI,CACxB,CAUD,SAAS0X,GAAM1X,EAAG,CAChB,OAAO,IAAI,KAAKA,CAAC,EAAE,MAAK,CACzB,CA4BD,SAASstB,GAAMjW,EAAGrX,EAAG,CACnBqX,EAAI,IAAI,KAAKA,CAAC,EACdrX,EAAI,IAAI,KAAKA,CAAC,EACd,IAAI8e,EACFiH,EAAK,KAAK,UACVC,EAAK,KAAK,SACVqB,EAAMtB,EAAK,EAGb,MAAI,CAAC1O,EAAE,GAAK,CAACrX,EAAE,EACb8e,EAAI,IAAI,KAAK,GAAG,EAGP,CAACzH,EAAE,GAAK,CAACrX,EAAE,GACpB8e,EAAIsI,EAAM,KAAMC,EAAK,CAAC,EAAE,MAAMrnB,EAAE,EAAI,EAAI,IAAO,GAAI,EACnD8e,EAAE,EAAIzH,EAAE,GAGC,CAACrX,EAAE,GAAKqX,EAAE,OAAM,GACzByH,EAAI9e,EAAE,EAAI,EAAIonB,EAAM,KAAMrB,EAAIC,CAAE,EAAI,IAAI,KAAK,CAAC,EAC9ClH,EAAE,EAAIzH,EAAE,GAGC,CAACA,EAAE,GAAKrX,EAAE,OAAM,GACzB8e,EAAIsI,EAAM,KAAMC,EAAK,CAAC,EAAE,MAAM,EAAG,EACjCvI,EAAE,EAAIzH,EAAE,GAGCrX,EAAE,EAAI,GACf,KAAK,UAAYqnB,EACjB,KAAK,SAAW,EAChBvI,EAAI,KAAK,KAAK2H,EAAOpP,EAAGrX,EAAGqnB,EAAK,CAAC,CAAC,EAClCrnB,EAAIonB,EAAM,KAAMC,EAAK,CAAC,EACtB,KAAK,UAAYtB,EACjB,KAAK,SAAWC,EAChBlH,EAAIzH,EAAE,EAAI,EAAIyH,EAAE,MAAM9e,CAAC,EAAI8e,EAAE,KAAK9e,CAAC,GAEnC8e,EAAI,KAAK,KAAK2H,EAAOpP,EAAGrX,EAAGqnB,EAAK,CAAC,CAAC,EAG7BvI,CACR,CAUD,SAAS3J,GAAKnV,EAAG,CACf,OAAO,IAAI,KAAKA,CAAC,EAAE,KAAI,CACxB,CASD,SAASutB,EAAKvtB,EAAG,CACf,OAAOqlB,EAASrlB,EAAI,IAAI,KAAKA,CAAC,EAAGA,EAAE,EAAI,EAAG,CAAC,CAC5C,CAWD,SAASwtB,GAAMxtB,EAAGyK,EAAKmP,EAAK,CAC1B,OAAO,IAAI,KAAK5Z,CAAC,EAAE,MAAMyK,EAAKmP,CAAG,CAClC,CAqBD,SAAS5c,GAAOP,EAAK,CACnB,GAAI,CAACA,GAAO,OAAOA,GAAQ,SAAU,MAAM,MAAM4nB,EAAe,iBAAiB,EACjF,IAAIxnB,EAAG2K,EAAGimB,EACRC,EAAcjxB,EAAI,WAAa,GAC/BkxB,EAAK,CACH,YAAa,EAAGhK,EAChB,WAAY,EAAG,EACf,WAAY,CAACD,EAAW,EACxB,WAAY,EAAGA,EACf,OAAQ,EAAGA,EACX,OAAQ,CAACA,EAAW,EACpB,SAAU,EAAG,CACrB,EAEI,IAAK7mB,EAAI,EAAGA,EAAI8wB,EAAG,OAAQ9wB,GAAK,EAE9B,GADI2K,EAAImmB,EAAG9wB,CAAC,EAAG6wB,IAAa,KAAKlmB,CAAC,EAAIuc,EAASvc,CAAC,IAC3CimB,EAAIhxB,EAAI+K,CAAC,KAAO,OACnB,GAAIkd,EAAU+I,CAAC,IAAMA,GAAKA,GAAKE,EAAG9wB,EAAI,CAAC,GAAK4wB,GAAKE,EAAG9wB,EAAI,CAAC,EAAG,KAAK2K,CAAC,EAAIimB,MACjE,OAAM,MAAMnJ,EAAkB9c,EAAI,KAAOimB,CAAC,EAKnD,GADIjmB,EAAI,SAAUkmB,IAAa,KAAKlmB,CAAC,EAAIuc,EAASvc,CAAC,IAC9CimB,EAAIhxB,EAAI+K,CAAC,KAAO,OACnB,GAAIimB,IAAM,IAAQA,IAAM,IAASA,IAAM,GAAKA,IAAM,EAChD,GAAIA,EACF,GAAI,OAAO,OAAU,KAAe,SACjC,OAAO,iBAAmB,OAAO,aAClC,KAAKjmB,CAAC,EAAI,OAEV,OAAM,MAAMgd,CAAiB,OAG/B,KAAKhd,CAAC,EAAI,OAGZ,OAAM,MAAM8c,EAAkB9c,EAAI,KAAOimB,CAAC,EAI9C,OAAO,IACR,CAUD,SAASG,GAAI5tB,EAAG,CACd,OAAO,IAAI,KAAKA,CAAC,EAAE,IAAG,CACvB,CAUD,SAAS2X,GAAK3X,EAAG,CACf,OAAO,IAAI,KAAKA,CAAC,EAAE,KAAI,CACxB,CAQD,SAASM,GAAM7D,EAAK,CAClB,IAAII,EAAG2K,EAAGmmB,EASV,SAAS3J,EAAQyJ,EAAG,CAClB,IAAIxX,GAAGpZ,GAAGsD,GACRH,GAAI,KAGN,GAAI,EAAEA,cAAagkB,GAAU,OAAO,IAAIA,EAAQyJ,CAAC,EAOjD,GAHAztB,GAAE,YAAcgkB,EAGZ6J,GAAkBJ,CAAC,EAAG,CACxBztB,GAAE,EAAIytB,EAAE,EAEJrJ,EACE,CAACqJ,EAAE,GAAKA,EAAE,EAAIzJ,EAAQ,MAGxBhkB,GAAE,EAAI,IACNA,GAAE,EAAI,MACGytB,EAAE,EAAIzJ,EAAQ,MAGvBhkB,GAAE,EAAI,EACNA,GAAE,EAAI,CAAC,CAAC,IAERA,GAAE,EAAIytB,EAAE,EACRztB,GAAE,EAAIytB,EAAE,EAAE,MAAK,IAGjBztB,GAAE,EAAIytB,EAAE,EACRztB,GAAE,EAAIytB,EAAE,EAAIA,EAAE,EAAE,MAAK,EAAKA,EAAE,GAG9B,MACD,CAID,GAFAttB,GAAI,OAAOstB,EAEPttB,KAAM,SAAU,CAClB,GAAIstB,IAAM,EAAG,CACXztB,GAAE,EAAI,EAAIytB,EAAI,EAAI,GAAK,EACvBztB,GAAE,EAAI,EACNA,GAAE,EAAI,CAAC,CAAC,EACR,MACD,CAUD,GARIytB,EAAI,GACNA,EAAI,CAACA,EACLztB,GAAE,EAAI,IAENA,GAAE,EAAI,EAIJytB,IAAM,CAAC,CAACA,GAAKA,EAAI,IAAK,CACxB,IAAKxX,GAAI,EAAGpZ,GAAI4wB,EAAG5wB,IAAK,GAAIA,IAAK,GAAIoZ,KAEjCmO,EACEnO,GAAI+N,EAAQ,MACdhkB,GAAE,EAAI,IACNA,GAAE,EAAI,MACGiW,GAAI+N,EAAQ,MACrBhkB,GAAE,EAAI,EACNA,GAAE,EAAI,CAAC,CAAC,IAERA,GAAE,EAAIiW,GACNjW,GAAE,EAAI,CAACytB,CAAC,IAGVztB,GAAE,EAAIiW,GACNjW,GAAE,EAAI,CAACytB,CAAC,GAGV,MAGV,SAAmBA,EAAI,IAAM,EAAG,CACjBA,IAAGztB,GAAE,EAAI,KACdA,GAAE,EAAI,IACNA,GAAE,EAAI,KACN,MACD,CAED,OAAOwsB,GAAaxsB,GAAGytB,EAAE,SAAU,CAAA,CAE3C,SAAiBttB,KAAM,SACf,MAAM,MAAMmkB,EAAkBmJ,CAAC,EAIjC,OAAK5wB,GAAI4wB,EAAE,WAAW,CAAC,KAAO,IAC5BA,EAAIA,EAAE,MAAM,CAAC,EACbztB,GAAE,EAAI,KAGFnD,KAAM,KAAI4wB,EAAIA,EAAE,MAAM,CAAC,GAC3BztB,GAAE,EAAI,GAGD+kB,EAAU,KAAK0I,CAAC,EAAIjB,GAAaxsB,GAAGytB,CAAC,EAAIhB,GAAWzsB,GAAGytB,CAAC,CAChE,CA2DD,GAzDAzJ,EAAQ,UAAY,EAEpBA,EAAQ,SAAW,EACnBA,EAAQ,WAAa,EACrBA,EAAQ,WAAa,EACrBA,EAAQ,YAAc,EACtBA,EAAQ,cAAgB,EACxBA,EAAQ,gBAAkB,EAC1BA,EAAQ,gBAAkB,EAC1BA,EAAQ,gBAAkB,EAC1BA,EAAQ,iBAAmB,EAC3BA,EAAQ,OAAS,EAEjBA,EAAQ,OAASA,EAAQ,IAAMhnB,GAC/BgnB,EAAQ,MAAQ1jB,GAChB0jB,EAAQ,UAAY6J,GAEpB7J,EAAQ,IAAMiJ,GACdjJ,EAAQ,KAAOkJ,GACflJ,EAAQ,MAAQxM,GAChBwM,EAAQ,IAAMmJ,GACdnJ,EAAQ,KAAOoJ,GACfpJ,EAAQ,MAAQvM,GAChBuM,EAAQ,KAAOqJ,GACfrJ,EAAQ,MAAQtM,GAChBsM,EAAQ,MAAQsJ,GAChBtJ,EAAQ,KAAO7O,GACf6O,EAAQ,KAAOuJ,EACfvJ,EAAQ,MAAQwJ,GAChBxJ,EAAQ,IAAM4J,GACd5J,EAAQ,KAAOrM,GACfqM,EAAQ,IAAM8J,GACd9J,EAAQ,IAAM3L,EACd2L,EAAQ,MAAQ+J,EAChB/J,EAAQ,MAAQgK,GAChBhK,EAAQ,GAAKiK,GACbjK,EAAQ,IAAMkK,GACdlK,EAAQ,MAAQ/O,GAChB+O,EAAQ,KAAOhP,GACfgP,EAAQ,IAAMpK,GACdoK,EAAQ,IAAMvZ,GACduZ,EAAQ,IAAMmK,GACdnK,EAAQ,IAAMoK,GACdpK,EAAQ,IAAMmI,GACdnI,EAAQ,OAASqK,GACjBrK,EAAQ,MAAQsK,GAChBtK,EAAQ,KAAOjP,GACfiP,EAAQ,IAAMuK,GACdvK,EAAQ,KAAOpM,GACfoM,EAAQ,KAAOwK,GACfxK,EAAQ,IAAMyK,GACdzK,EAAQ,IAAMoI,GACdpI,EAAQ,IAAM0K,GACd1K,EAAQ,KAAOnM,GACfmM,EAAQ,MAAQ2K,GAEZlyB,IAAQ,SAAQA,EAAM,CAAA,GACtBA,GACEA,EAAI,WAAa,GAEnB,IADAkxB,EAAK,CAAC,YAAa,WAAY,WAAY,WAAY,OAAQ,OAAQ,SAAU,QAAQ,EACpF9wB,EAAI,EAAGA,EAAI8wB,EAAG,QAAclxB,EAAI,eAAe+K,EAAImmB,EAAG9wB,GAAG,CAAC,IAAGJ,EAAI+K,CAAC,EAAI,KAAKA,CAAC,GAIrF,OAAAwc,EAAQ,OAAOvnB,CAAG,EAEXunB,CACR,CAWD,SAAS8J,GAAI9tB,EAAGqX,EAAG,CACjB,OAAO,IAAI,KAAKrX,CAAC,EAAE,IAAIqX,CAAC,CACzB,CAUD,SAASgB,EAAIrY,EAAG,CACd,OAAO,IAAI,KAAKA,CAAC,EAAE,IAAG,CACvB,CASD,SAAS+tB,EAAM/tB,EAAG,CAChB,OAAOqlB,EAASrlB,EAAI,IAAI,KAAKA,CAAC,EAAGA,EAAE,EAAI,EAAG,CAAC,CAC5C,CAYD,SAASguB,IAAQ,CACf,IAAInxB,EAAG2Y,EACLrV,EAAI,IAAI,KAAK,CAAC,EAIhB,IAFAikB,EAAW,GAENvnB,EAAI,EAAGA,EAAI,UAAU,QAExB,GADA2Y,EAAI,IAAI,KAAK,UAAU3Y,GAAG,CAAC,EACtB2Y,EAAE,EAMIrV,EAAE,IACXA,EAAIA,EAAE,KAAKqV,EAAE,MAAMA,CAAC,CAAC,OAPb,CACR,GAAIA,EAAE,EACJ,OAAA4O,EAAW,GACJ,IAAI,KAAK,GAAK,EAEvBjkB,EAAIqV,CACZ,CAKI,OAAA4O,EAAW,GAEJjkB,EAAE,MACV,CAQD,SAAS0tB,GAAkBpxB,EAAK,CAC9B,OAAOA,aAAeunB,GAAWvnB,GAAOA,EAAI,cAAgBgoB,GAAO,EACpE,CAUD,SAASwJ,GAAGjuB,EAAG,CACb,OAAO,IAAI,KAAKA,CAAC,EAAE,GAAE,CACtB,CAaD,SAASkuB,GAAIluB,EAAGqX,EAAG,CACjB,OAAO,IAAI,KAAKrX,CAAC,EAAE,IAAIqX,CAAC,CACzB,CAUD,SAASrC,GAAKhV,EAAG,CACf,OAAO,IAAI,KAAKA,CAAC,EAAE,IAAI,CAAC,CACzB,CAUD,SAASiV,GAAMjV,EAAG,CAChB,OAAO,IAAI,KAAKA,CAAC,EAAE,IAAI,EAAE,CAC1B,CASD,SAAS4Z,IAAM,CACb,OAAOqS,GAAS,KAAM,UAAW,IAAI,CACtC,CASD,SAASxhB,IAAM,CACb,OAAOwhB,GAAS,KAAM,UAAW,IAAI,CACtC,CAWD,SAASkC,GAAInuB,EAAGqX,EAAG,CACjB,OAAO,IAAI,KAAKrX,CAAC,EAAE,IAAIqX,CAAC,CACzB,CAWD,SAAS+W,GAAIpuB,EAAGqX,EAAG,CACjB,OAAO,IAAI,KAAKrX,CAAC,EAAE,IAAIqX,CAAC,CACzB,CAWD,SAAS8U,GAAInsB,EAAGqX,EAAG,CACjB,OAAO,IAAI,KAAKrX,CAAC,EAAE,IAAIqX,CAAC,CACzB,CAWD,SAASgX,GAAOhI,EAAI,CAClB,IAAIrJ,EAAG/G,EAAGqP,EAAG9P,EACX3Y,EAAI,EACJiiB,GAAI,IAAI,KAAK,CAAC,EACd+K,GAAK,CAAA,EAOP,GALIxD,IAAO,OAAQA,EAAK,KAAK,UACxBwC,EAAWxC,EAAI,EAAG1C,CAAU,EAEjC2B,EAAI,KAAK,KAAKe,EAAKpB,CAAQ,EAEtB,KAAK,OAIH,GAAI,OAAO,gBAGhB,IAFAjI,EAAI,OAAO,gBAAgB,IAAI,YAAYsI,CAAC,CAAC,EAEtCzoB,EAAIyoB,GACT9P,EAAIwH,EAAEngB,CAAC,EAIH2Y,GAAK,MACPwH,EAAEngB,CAAC,EAAI,OAAO,gBAAgB,IAAI,YAAY,CAAC,CAAC,EAAE,CAAC,EAKnDgtB,GAAGhtB,GAAG,EAAI2Y,EAAI,YAKT,OAAO,YAAa,CAK7B,IAFAwH,EAAI,OAAO,YAAYsI,GAAK,CAAC,EAEtBzoB,EAAIyoB,GAGT9P,EAAIwH,EAAEngB,CAAC,GAAKmgB,EAAEngB,EAAI,CAAC,GAAK,IAAMmgB,EAAEngB,EAAI,CAAC,GAAK,MAAQmgB,EAAEngB,EAAI,CAAC,EAAI,MAAS,IAGlE2Y,GAAK,MACP,OAAO,YAAY,CAAC,EAAE,KAAKwH,EAAGngB,CAAC,GAK/BgtB,GAAG,KAAKrU,EAAI,GAAG,EACf3Y,GAAK,GAITA,EAAIyoB,EAAI,CACd,KACM,OAAM,MAAMd,CAAiB,MA9C7B,MAAO3nB,EAAIyoB,GAAIuE,GAAGhtB,GAAG,EAAI,KAAK,OAAM,EAAK,IAAM,EA2DjD,IAVAyoB,EAAIuE,GAAG,EAAEhtB,CAAC,EACVwpB,GAAMpB,EAGFK,GAAKe,IACP7Q,EAAImP,EAAQ,GAAIM,EAAWoB,CAAE,EAC7BwD,GAAGhtB,CAAC,GAAKyoB,EAAI9P,EAAI,GAAKA,GAIjBqU,GAAGhtB,CAAC,IAAM,EAAGA,IAAKgtB,GAAG,MAG5B,GAAIhtB,EAAI,EACNoZ,EAAI,EACJ4T,GAAK,CAAC,CAAC,MACF,CAIL,IAHA5T,EAAI,GAGG4T,GAAG,CAAC,IAAM,EAAG5T,GAAKgP,EAAU4E,GAAG,QAGtC,IAAKvE,EAAI,EAAG9P,EAAIqU,GAAG,CAAC,EAAGrU,GAAK,GAAIA,GAAK,GAAI8P,IAGrCA,EAAIL,IAAUhP,GAAKgP,EAAWK,EACnC,CAED,OAAAxG,GAAE,EAAI7I,EACN6I,GAAE,EAAI+K,GAEC/K,EACR,CAWD,SAASwP,GAAMtuB,EAAG,CAChB,OAAOqlB,EAASrlB,EAAI,IAAI,KAAKA,CAAC,EAAGA,EAAE,EAAI,EAAG,KAAK,QAAQ,CACxD,CAcD,SAAS+U,GAAK/U,EAAG,CACf,OAAAA,EAAI,IAAI,KAAKA,CAAC,EACPA,EAAE,EAAKA,EAAE,EAAE,CAAC,EAAIA,EAAE,EAAI,EAAIA,EAAE,EAAKA,EAAE,GAAK,GAChD,CAUD,SAASuuB,GAAIvuB,EAAG,CACd,OAAO,IAAI,KAAKA,CAAC,EAAE,IAAG,CACvB,CAUD,SAAS4X,GAAK5X,EAAG,CACf,OAAO,IAAI,KAAKA,CAAC,EAAE,KAAI,CACxB,CAUD,SAASwuB,GAAKxuB,EAAG,CACf,OAAO,IAAI,KAAKA,CAAC,EAAE,KAAI,CACxB,CAWD,SAASyuB,GAAIzuB,EAAGqX,EAAG,CACjB,OAAO,IAAI,KAAKrX,CAAC,EAAE,IAAIqX,CAAC,CACzB,CAYD,SAAS+U,IAAM,CACb,IAAIvvB,EAAI,EACNwM,EAAO,UACPrJ,EAAI,IAAI,KAAKqJ,EAAKxM,CAAC,CAAC,EAGtB,IADAunB,EAAW,GACJpkB,EAAE,GAAK,EAAEnD,EAAIwM,EAAK,QAASrJ,EAAIA,EAAE,KAAKqJ,EAAKxM,CAAC,CAAC,EACpD,OAAAunB,EAAW,GAEJiB,EAASrlB,EAAG,KAAK,UAAW,KAAK,QAAQ,CACjD,CAUD,SAAS0uB,GAAI1uB,EAAG,CACd,OAAO,IAAI,KAAKA,CAAC,EAAE,IAAG,CACvB,CAUD,SAAS6X,GAAK7X,EAAG,CACf,OAAO,IAAI,KAAKA,CAAC,EAAE,KAAI,CACxB,CASD,SAAS2uB,GAAM3uB,EAAG,CAChB,OAAOqlB,EAASrlB,EAAI,IAAI,KAAKA,CAAC,EAAGA,EAAE,EAAI,EAAG,CAAC,CAC5C,CAIDgkB,EAAU1jB,GAAMyjB,CAAQ,EACxBC,EAAQ,UAAU,YAAcA,EAChCA,EAAQ,QAAaA,EAAQ,QAAUA,EAGvCH,EAAO,IAAIG,EAAQH,CAAI,EACvBC,EAAK,IAAIE,EAAQF,CAAE,EAawBpnB,EAAO,SAC5C,OAAO,QAAU,YAAc,OAAO,OAAO,UAAY,WAC3D,EAAE,OAAO,IAAO,4BAA4B,CAAC,EAAI,EAAE,SACnD,EAAE,OAAO,WAAW,EAAI,WAG1BA,EAAA,QAAiBsnB,IAIZP,IACHA,EAAc,OAAO,KAAQ,KAAe,MAAQ,KAAK,MAAQ,KAAO,KAAO,QAGjFS,EAAaT,EAAY,QACzBO,EAAQ,WAAa,UAAY,CAC/B,OAAAP,EAAY,QAAUS,EACfF,CACb,EAEIP,EAAY,QAAUO,EAEzB,GAAE9f,EAAI,mBCn0JP,IAAI1H,GAAyBY,GAC7B,OAAO,eAAeslB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAIkM,GAAWpyB,GAAuBuD,GAAA,CAAqB,EACvDqiB,GAAW9gB,EACXsC,GAAO,YACPia,GAAe,CAAC,MAAO,QAAQ,EAC/BgR,MAA0CzM,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAClG,IAAIqM,EAAKrM,EAAK,GACZzlB,EAASylB,EAAK,OACZC,EAAYkM,GAAS,QAAW,MAAM,CACxC,UAAW5xB,EAAO,UAClB,OAAQ4xB,GAAS,QAAW,MAChC,CAAG,EACD,OAAAlM,EAAU,UAAY,OAAO,OAAOA,EAAU,SAAS,EAKvDA,EAAU,UAAU,KAAO,YAC3BA,EAAU,UAAU,YAAc,GAQlCA,EAAU,UAAU,OAAS,UAAY,CACvC,MAAO,CACL,OAAQ,YACR,MAAO,KAAK,SAAU,CAC5B,CACA,EAQEA,EAAU,SAAW,SAAUc,EAAM,CACnC,OAAO,IAAId,EAAUc,EAAK,KAAK,CACnC,EACMsL,GAEFA,EAAG,SAAU,SAAUvrB,EAAMF,EAAM,CAC7BE,EAAK,YAAcF,EAAK,WAC1Bqf,EAAU,OAAO,CACf,UAAWnf,EAAK,SAC1B,CAAS,CAET,CAAK,EAEImf,CACT,EAAG,CACD,QAAS,EACX,CAAC,EACDA,GAAA,qBAA+BmM,aC5D3BryB,GAAyBY,GAC7B,OAAO,eAAeulB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAI7iB,GAAWtD,GAAuBuD,EAAwC,EAC1EgvB,GAAWvyB,GAAuB8E,EAAqB,EACvD2W,GAAUlU,GACV1C,GAAMyX,GACNsJ,GAAWE,EACX1e,GAAO,UACPia,GAAe,CAAA,EACfmR,MAAwC5M,GAAS,SAASxe,GAAMia,GAAc,UAAY,CAI5F,cAAO,eAAekR,GAAS,QAAY,OAAQ,CACjD,MAAO,SACX,CAAG,EACDA,GAAS,QAAW,UAAU,YAAcA,GAAS,QACrDA,GAAS,QAAW,UAAU,KAAO,UACrCA,GAAS,QAAW,UAAU,UAAY,GAO1CA,GAAS,QAAW,UAAU,OAAS,UAAY,CACjD,MAAO,CACL,OAAQ,UACR,GAAI,KAAK,GACT,GAAI,KAAK,EACf,CACA,EAOEA,GAAS,QAAW,UAAU,QAAU,UAAY,CAClD,MAAO,CACL,EAAG,KAAK,IAAK,EACb,IAAK,KAAK,IAAK,CACrB,CACA,EAWEA,GAAS,QAAW,UAAU,OAAS,SAAU3rB,EAAS,CACxD,IAAIR,EAAM,GACNqsB,EAAK,KAAK,GACVC,EAAK,KAAK,GACVC,KAAYlX,GAAQ,QAAQ,KAAK,GAAI7U,CAAO,EAC5CgsB,KAAYnX,GAAQ,QAAQ,KAAK,GAAI7U,CAAO,EAG5C2S,KAAgB1U,GAAI,UAAU+B,CAAO,EAAIA,EAAUA,EAAUA,EAAQ,UAAY,KACrF,GAAI2S,IAAc,KAAM,CACtB,IAAIuB,EAAU,KAAK,IAAI,GAAI,CAACvB,CAAS,EACjC,KAAK,IAAImZ,EAAKD,CAAE,EAAI3X,IACtB4X,EAAK,GAEH,KAAK,IAAID,EAAKC,CAAE,EAAI5X,IACtB2X,EAAK,EAER,CACD,OAAIA,IAAO,EAETrsB,EAAMusB,EACGD,IAAO,EAEZD,IAAO,EACTrsB,EAAM,IACGqsB,IAAO,GAChBrsB,EAAM,KAENA,EAAMwsB,EAAQ,IAIZH,EAAK,EACHA,IAAO,GACTrsB,EAAMusB,EAAQ,OAEdvsB,EAAMusB,EAAQ,MAAQC,EAAM,UAAU,CAAC,EAAI,IAGzCH,IAAO,EACTrsB,EAAMusB,EAAQ,OAEdvsB,EAAMusB,EAAQ,MAAQC,EAAQ,IAI7BxsB,CACX,EAaEmsB,GAAS,QAAW,UAAY,SAAU1lB,EAAM,CAC9C,OAAQ,UAAU,OAAM,CACtB,IAAK,GACH,CACE,IAAI2D,EAAM,UAAU,CAAC,EACrB,MAAQlN,GAAS,SAAYkN,CAAG,IAAM,SACpC,SAAW+hB,GAAS,SAAY/hB,CAAG,EAEnC,MAAM,IAAI,UAAU,gDAAgD,CAEvE,CACH,IAAK,GACH,CACE,IAAI8R,EAAI,UAAU,CAAC,EACfuQ,EAAM,UAAU,CAAC,EACrB,MAAQhuB,GAAI,UAAUyd,CAAC,EAAG,CAKxB,MAJQzd,GAAI,QAAQguB,CAAG,GAAKA,EAAI,QAAQ,OAAO,IAE7CA,EAAMA,EAAI,SAAS,KAAK,MAElBhuB,GAAI,UAAUguB,CAAG,EACvB,OAAO,IAAIN,GAAS,QAAW,CAC7B,EAAGjQ,EACH,IAAKuQ,CACrB,CAAe,EAEH,MAAM,IAAI,UAAU,wCAAwC,CACxE,KACY,OAAM,IAAI,UAAU,2BAA2B,CAElD,CACH,QACE,MAAM,IAAI,YAAY,iDAAiD,CAC1E,CACL,EACEN,GAAS,QAAW,UAAU,QAAUA,GAAS,QAAW,UAAU,SAUtEA,GAAS,QAAW,SAAW,SAAUvL,EAAM,CAC7C,OAAO,IAAIuL,GAAS,QAAWvL,CAAI,CACvC,EAiBEuL,GAAS,QAAW,QAAU,SAAUrtB,EAAGC,EAAG,CAC5C,OAAID,EAAE,GAAKC,EAAE,GACJ,EAELD,EAAE,GAAKC,EAAE,GACJ,GAELD,EAAE,GAAKC,EAAE,GACJ,EAELD,EAAE,GAAKC,EAAE,GACJ,GAEF,CACX,EACSotB,GAAS,OAClB,EAAG,CACD,QAAS,EACX,CAAC,EACDpM,GAAA,mBAA6BqM;;;;;;yDCnK5B,SAASM,EAAM,CAOd,IAAIC,EAAgB,IAGhBC,EAAI,CACN,EAAK,EACL,EAAK,EACL,EAAK,CACT,EAEE,SAASvP,EAAOzK,EAAG3N,EAAG,CAEpB,GAAI,MAAM2N,EAAI,SAASA,EAAG,EAAE,CAAC,EAC3B,MAAMia,EAAgB,EAExB,OAAOja,EAAI3N,CACZ,CAGD,SAAS6nB,EAAYla,EAAGwH,EAAG,CAEzB,GAAIA,IAAM,EACR,MAAM2S,EAAc,EAGtB,IAAI1M,EAAI,OAAO,OAAOJ,EAAS,SAAS,EACxCI,EAAE,EAAOzN,EAAI,EAAI,GAAK,EAEtBA,EAAIA,EAAI,EAAI,CAACA,EAAIA,EAEjB,IAAI9T,EAAIkuB,EAAIpa,EAAGwH,CAAC,EAEhB,OAAAiG,EAAE,EAAOzN,EAAI9T,EACbuhB,EAAE,EAAOjG,EAAItb,EACNuhB,CACR,CAED,SAAS4M,EAAUjI,EAAK,CAQtB,QANIkI,EAAU,CAAA,EAEVta,EAAIoS,EACJ/qB,EAAI,EACJgL,EAAI,EAEDA,GAAK2N,GAAG,CAEb,KAAOA,EAAI3Y,IAAM,GACf2Y,GAAI3Y,EACJizB,EAAQjzB,CAAC,GAAKizB,EAAQjzB,CAAC,GAAK,GAAK,EAEnCgL,GAAI,EAAI,EAAIhL,GACb,CAED,OAAI2Y,IAAMoS,EACJpS,EAAI,IACNsa,EAAQta,CAAC,GAAKsa,EAAQta,CAAC,GAAK,GAAK,GAEnCsa,EAAQlI,CAAG,GAAKkI,EAAQlI,CAAG,GAAK,GAAK,EAEhCkI,CACR,CAED,IAAIC,EAAQ,SAASC,EAAIC,EAAI,CAE3B,IAAIza,EAAI,EAAGwH,EAAI,EAAGnV,EAAI,EAClB4lB,EAAI,EAAGhE,EAAI,EAAGzpB,EAAI,EAAGqX,EAAI,EAAGkR,EAAI,EAEhC2H,EAAI,EAAGC,EAAI,EACXC,EAAI,EAAGC,EAAI,EAEXC,EAAI,IACJC,EAEJ,GAAwBP,GAAO,KAExB,GAAIC,IAAO,QAKhB,GAJAza,EAAIwa,EACJhT,EAAIiT,EACJpoB,EAAI2N,EAAIwH,EAEJxH,EAAI,IAAM,GAAKwH,EAAI,IAAM,EAC3B,MAAMwT,EAAmB,MAI3B,QAAQ,OAAOR,EAAE,CAEf,IAAK,SACH,CACE,GAAI,MAAOA,GAAM,MAAOA,EACtBxa,EAAIwa,EAAG,EACPhT,EAAIgT,EAAG,EACH,MAAOA,IACTxa,GAAIwa,EAAG,WACA,KAAKA,EACdxa,EAAIwa,EAAG,CAAC,EACJ,KAAKA,IACPhT,EAAIgT,EAAG,CAAC,OAEV,OAAMP,EAAgB,EAExB5nB,EAAI2N,EAAIwH,EACR,KACD,CACH,IAAK,SACH,CAME,GALIgT,EAAK,IACPnoB,EAAImoB,EACJA,EAAK,CAACA,GAGJA,EAAK,IAAM,EACbxa,EAAIwa,UACKA,EAAK,EAAG,CAUjB,IARIA,GAAM,IACRzH,EAAI,KAAK,IAAI,GAAI,KAAK,MAAM,EAAI,KAAK,IAAIyH,CAAE,EAAI,KAAK,IAAI,CAAC,EACzDA,GAAKzH,GAMA4H,GAAKG,GAAKD,GAAKC,GAGpB,GAFAC,GAAKL,EAAIE,IAAMD,EAAIE,GAEfL,IAAOO,EAAG,CACRJ,EAAIE,GAAKC,GACX9a,EAAI0a,EAAIE,EACRpT,EAAImT,EAAIE,GACCA,EAAIF,GACb3a,EAAI4a,EACJpT,EAAIqT,IAEJ7a,EAAI0a,EACJlT,EAAImT,GAEN,KAElB,MAEsBH,EAAKO,GACPL,GAAIE,EACJD,GAAIE,IAEJD,GAAIF,EACJG,GAAIF,GAGFA,EAAIG,GACN9a,EAAI4a,EACJpT,EAAIqT,IAEJ7a,EAAI0a,EACJlT,EAAImT,GAIV3a,GAAI+S,CACL,MAAU,MAAMyH,CAAE,GAAK,MAAMC,CAAE,KAC9BjT,EAAIxH,EAAI,KAEV,KACD,CACH,IAAK,SACH,CAGE,GAFA2a,EAAIH,EAAG,MAAM,QAAQ,EAEjBG,IAAM,KACR,MAAMV,EAAgB,EA2CxB,GAzCIU,EAAED,CAAC,IAAM,KACXroB,EAAI,GACJqoB,KACSC,EAAED,CAAC,IAAM,KAClBA,IAGEC,EAAE,SAAWD,EAAI,EACnBzG,EAAIxJ,EAAOkQ,EAAED,GAAG,EAAGroB,CAAC,EACXsoB,EAAED,EAAI,CAAC,IAAM,KAAOC,EAAED,CAAC,IAAM,KAElCC,EAAED,CAAC,IAAM,MACXzC,EAAIxN,EAAOkQ,EAAED,GAAG,EAAGroB,CAAC,GAEtBqoB,KAGIA,EAAI,IAAMC,EAAE,QAAUA,EAAED,EAAI,CAAC,IAAM,KAAOC,EAAED,EAAI,CAAC,IAAM,KAAOC,EAAED,EAAI,CAAC,IAAM,KAAOC,EAAED,EAAI,CAAC,IAAM,OACjGzG,EAAIxJ,EAAOkQ,EAAED,CAAC,EAAGroB,CAAC,EAClBwP,EAAI,KAAK,IAAI,GAAI8Y,EAAED,CAAC,EAAE,MAAM,EAC5BA,MAIEC,EAAED,CAAC,IAAM,KAAOC,EAAED,EAAI,CAAC,IAAM,KAAOC,EAAED,CAAC,IAAM,KAAOC,EAAED,EAAI,CAAC,IAAM,OACnElwB,EAAIigB,EAAOkQ,EAAED,EAAI,CAAC,EAAGroB,CAAC,EACtB0gB,EAAI,KAAK,IAAI,GAAI4H,EAAED,EAAI,CAAC,EAAE,MAAM,EAAI,EACpCA,GAAI,IAGGC,EAAED,EAAI,CAAC,IAAM,KAAOC,EAAED,EAAI,CAAC,IAAM,KAC1CzG,EAAIxJ,EAAOkQ,EAAED,CAAC,EAAGroB,CAAC,EAClBwP,EAAI4I,EAAOkQ,EAAED,EAAI,CAAC,EAAG,CAAC,EACtBA,GAAI,GACKC,EAAED,EAAI,CAAC,IAAM,KAAOC,EAAED,EAAI,CAAC,IAAM,MAC1CzC,EAAIxN,EAAOkQ,EAAED,CAAC,EAAGroB,CAAC,EAClB4hB,EAAIxJ,EAAOkQ,EAAED,EAAI,CAAC,EAAGroB,CAAC,EACtBwP,EAAI4I,EAAOkQ,EAAED,EAAI,CAAC,EAAG,CAAC,EACtBA,GAAI,GAGFC,EAAE,QAAUD,EAAG,CACjBlT,EAAI3F,EAAIkR,EACR1gB,EACA2N,EAAIxV,EAAIgd,EAAIyQ,EAAIlF,EAAIkB,EACpB,KACD,CAGF,CACH,QACE,MAAMgG,EAAgB,CACzB,CAEH,GAAIzS,IAAM,EACR,MAAM2S,EAAc,EAGtBH,EAAE,EAAO3nB,EAAI,EAAI,GAAK,EACtB2nB,EAAE,EAAO,KAAK,IAAIha,CAAC,EACnBga,EAAE,EAAO,KAAK,IAAIxS,CAAC,CACvB,EAEE,SAASyT,EAAO9uB,EAAGsU,EAAGkQ,EAAG,CAGvB,QADIrH,EAAI,EACD7I,EAAI,EAAGtU,EAAKA,EAAIA,EAAKwkB,EAAGlQ,IAAM,EAE/BA,EAAI,IACN6I,EAAKA,EAAInd,EAAKwkB,GAGlB,OAAOrH,CACR,CAGD,SAAS4R,EAASlb,EAAGwH,EAAG,CAEtB,KAAOA,EAAI,IAAM,EACfA,GAAI,EAAG,CAGT,KAAOA,EAAI,IAAM,EACfA,GAAI,EAAG,CAGT,GAAIA,IAAM,EACR,MAAO,GAUT,QAHIgO,EAAM,GAAKhO,EACX7c,EAAI,EAED6qB,IAAQ,EAAG7qB,IAGhB,GAFA6qB,EAAMA,EAAM,GAAKhO,EAEb7c,EAAIovB,EACN,MAAO,GAEX,OAAOpvB,CACR,CAGD,SAASwwB,EAAWnb,EAAGwH,EAAGnb,EAAK,CAK7B,QAHI+uB,EAAO,EACPC,EAAOJ,EAAO,GAAI5uB,EAAKmb,CAAC,EAEnB7c,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAG5B,GAAIywB,IAASC,EACX,OAAO1wB,EAETywB,EAAOA,EAAO,GAAK5T,EACnB6T,EAAOA,EAAO,GAAK7T,CACpB,CACD,MAAO,EACR,CAED,SAAS4S,EAAIluB,EAAGC,EAAG,CAEjB,GAAI,CAACD,EACH,OAAOC,EACT,GAAI,CAACA,EACH,OAAOD,EAET,OAAU,CAER,GADAA,GAAIC,EACA,CAACD,EACH,OAAOC,EAET,GADAA,GAAID,EACA,CAACC,EACH,OAAOD,CACV,CAEL,CAQE,SAASmhB,EAASnhB,EAAGC,EAAG,CAItB,GAFAouB,EAAMruB,EAAGC,CAAC,EAEN,gBAAgBkhB,EAClBnhB,EAAIkuB,EAAIJ,EAAE,EAAMA,EAAE,CAAI,EACtB,KAAK,EAAOA,EAAE,EACd,KAAK,EAAOA,EAAE,EAAO9tB,EACrB,KAAK,EAAO8tB,EAAE,EAAO9tB,MAErB,QAAOguB,EAAYF,EAAE,EAAOA,EAAE,EAAMA,EAAE,CAAI,CAE7C,CAED,IAAIG,EAAiB,UAAW,CAAE,OAAO,IAAI,MAAM,kBAAkB,GACjEF,EAAmB,UAAW,CAAE,OAAO,IAAI,MAAM,kBAAkB,GACnEe,EAAsB,UAAW,CAAE,OAAO,IAAI,MAAM,4BAA4B,GAEpF3N,EAAS,UAAY,CAEnB,EAAK,EACL,EAAK,EACL,EAAK,EAOL,IAAO,UAAW,CAEhB,OAAO6M,EAAY,KAAK,EAAM,KAAK,CAAI,CACxC,EAOD,IAAO,UAAW,CAEhB,OAAOA,EAAY,CAAC,KAAK,EAAO,KAAK,EAAM,KAAK,CAAI,CACrD,EAOD,IAAO,SAAShuB,EAAGC,EAAG,CAEpB,OAAAouB,EAAMruB,EAAGC,CAAC,EACH+tB,EACL,KAAK,EAAO,KAAK,EAAOF,EAAE,EAAOA,EAAE,EAAO,KAAK,EAAOA,EAAE,EACxD,KAAK,EAAOA,EAAE,CACtB,CACK,EAOD,IAAO,SAAS9tB,EAAGC,EAAG,CAEpB,OAAAouB,EAAMruB,EAAGC,CAAC,EACH+tB,EACL,KAAK,EAAO,KAAK,EAAOF,EAAE,EAAOA,EAAE,EAAO,KAAK,EAAOA,EAAE,EACxD,KAAK,EAAOA,EAAE,CACtB,CACK,EAOD,IAAO,SAAS9tB,EAAGC,EAAG,CAEpB,OAAAouB,EAAMruB,EAAGC,CAAC,EACH+tB,EACL,KAAK,EAAOF,EAAE,EAAO,KAAK,EAAOA,EAAE,EACnC,KAAK,EAAOA,EAAE,CACtB,CACK,EAOD,IAAO,SAAS9tB,EAAGC,EAAG,CAEpB,OAAAouB,EAAMruB,EAAGC,CAAC,EACH+tB,EACL,KAAK,EAAOF,EAAE,EAAO,KAAK,EAAOA,EAAE,EACnC,KAAK,EAAOA,EAAE,CACtB,CACK,EAOD,MAAS,UAAW,CAClB,OAAOE,EAAY,KAAK,EAAO,KAAK,EAAM,KAAK,CAAI,CACpD,EAOD,IAAO,SAAShuB,EAAGC,EAAG,CAEpB,GAAI,MAAM,KAAK,CAAI,GAAK,MAAM,KAAK,CAAI,EACrC,OAAO,IAAIkhB,EAAS,GAAG,EAGzB,GAAInhB,IAAM,OACR,OAAOguB,EAAY,KAAK,EAAO,KAAK,EAAO,KAAK,EAAM,CAAC,EAIzD,GADAK,EAAMruB,EAAGC,CAAC,EACA6tB,EAAE,IAAR,GAAsB,KAAK,IAAX,EAClB,MAAMG,EAAc,EAiBtB,OAAOD,EACL,KAAK,GAAQF,EAAE,EAAO,KAAK,IAASA,EAAE,EAAO,KAAK,GAClDA,EAAE,EAAO,KAAK,CACtB,CACK,EAOD,IAAO,SAAS9tB,EAAGC,EAAG,CAEpB,OAAAouB,EAAMruB,EAAGC,CAAC,EAIH+tB,EAAYE,EAAIJ,EAAE,EAAM,KAAK,CAAI,EAAII,EAAIJ,EAAE,EAAM,KAAK,CAAI,EAAGA,EAAE,EAAO,KAAK,CAAI,CACvF,EAOD,IAAO,SAAS9tB,EAAGC,EAAG,CAMpB,OAJAouB,EAAMruB,EAAGC,CAAC,EAIN6tB,EAAE,IAAS,GAAK,KAAK,IAAS,EACzBE,EAAY,EAAG,CAAC,EAElBA,EAAYF,EAAE,EAAO,KAAK,EAAMI,EAAIJ,EAAE,EAAM,KAAK,CAAI,EAAII,EAAIJ,EAAE,EAAM,KAAK,CAAI,CAAC,CACvF,EAOD,KAAQ,SAASsB,EAAQ,CAIvB,OAFAA,EAAS,KAAK,IAAI,GAAIA,GAAU,CAAC,EAE7B,MAAM,KAAK,CAAI,GAAK,MAAM,KAAK,CAAI,EAC9B,IAAIjO,EAAS,GAAG,EAElB6M,EAAY,KAAK,KAAKoB,EAAS,KAAK,EAAO,KAAK,EAAO,KAAK,CAAI,EAAGA,CAAM,CACjF,EAOD,MAAS,SAASA,EAAQ,CAIxB,OAFAA,EAAS,KAAK,IAAI,GAAIA,GAAU,CAAC,EAE7B,MAAM,KAAK,CAAI,GAAK,MAAM,KAAK,CAAI,EAC9B,IAAIjO,EAAS,GAAG,EAElB6M,EAAY,KAAK,MAAMoB,EAAS,KAAK,EAAO,KAAK,EAAO,KAAK,CAAI,EAAGA,CAAM,CAClF,EAOD,MAAS,SAASA,EAAQ,CAIxB,OAFAA,EAAS,KAAK,IAAI,GAAIA,GAAU,CAAC,EAE7B,MAAM,KAAK,CAAI,GAAK,MAAM,KAAK,CAAI,EAC9B,IAAIjO,EAAS,GAAG,EAElB6M,EAAY,KAAK,MAAMoB,EAAS,KAAK,EAAO,KAAK,EAAO,KAAK,CAAI,EAAGA,CAAM,CAClF,EAOD,QAAW,SAASpvB,EAAGC,EAAG,CAQxB,OAAAouB,EAAMruB,EAAGC,CAAC,EAEH+tB,EAAY,KAAK,EAAO,KAAK,MAAM,KAAK,EAAOF,EAAE,GAAQ,KAAK,EAAOA,EAAE,EAAK,EAAIA,EAAE,EAAMA,EAAE,CAAI,CACtG,EAOD,QAAW,UAAW,CAEpB,OAAOE,EAAY,KAAK,EAAO,KAAK,EAAM,KAAK,CAAI,CACpD,EAOD,IAAO,SAAShuB,EAAGC,EAAG,CAMpB,GAJAouB,EAAMruB,EAAGC,CAAC,EAIN6tB,EAAE,IAAS,EAEb,OAAIA,EAAE,EAAO,EACJE,EAAY,KAAK,IAAI,KAAK,EAAO,KAAK,EAAMF,EAAE,CAAI,EAAG,KAAK,IAAI,KAAK,EAAMA,EAAE,CAAI,CAAC,EAEhFE,EAAY,KAAK,IAAI,KAAK,EAAO,KAAK,EAAMF,EAAE,CAAI,EAAG,KAAK,IAAI,KAAK,EAAMA,EAAE,CAAI,CAAC,EAU3F,GAAI,KAAK,EAAO,EAAG,OAAO,KAG1B,IAAIc,EAAIT,EAAU,KAAK,CAAI,EACvBQ,EAAIR,EAAU,KAAK,CAAI,EAGvBra,EAAI,EACJwH,EAAI,EACR,QAASsI,KAAKgL,EACZ,GAAIhL,IAAM,IACV,IAAIA,IAAM,IAAK,CACb9P,EAAI,EACJ,KACD,CAGD,GAFA8a,EAAEhL,CAAC,GAAIkK,EAAE,EAELc,EAAEhL,CAAC,EAAIkK,EAAE,IAAS,EACpBc,EAAEhL,CAAC,GAAIkK,EAAE,MACJ,QAAO,KACdha,GAAI,KAAK,IAAI8P,EAAGgL,EAAEhL,CAAC,CAAC,EAGtB,QAASA,KAAK+K,EACZ,GAAI/K,IAAM,IAGV,IAFA+K,EAAE/K,CAAC,GAAIkK,EAAE,EAELa,EAAE/K,CAAC,EAAIkK,EAAE,IAAS,EACpBa,EAAE/K,CAAC,GAAIkK,EAAE,MACJ,QAAO,KACdxS,GAAI,KAAK,IAAIsI,EAAG+K,EAAE/K,CAAC,CAAC,EAGtB,OAAIkK,EAAE,EAAO,EACJE,EAAY1S,EAAGxH,CAAC,EAElBka,EAAYla,EAAGwH,CAAC,CACxB,EAOD,OAAU,SAAStb,EAAGC,EAAG,CAEvB,OAAAouB,EAAMruB,EAAGC,CAAC,EACH,KAAK,EAAO,KAAK,EAAO6tB,EAAE,IAASA,EAAE,EAAOA,EAAE,EAAO,KAAK,CAClE,EAOD,QAAW,SAAS9tB,EAAGC,EAAG,CAExBouB,EAAMruB,EAAGC,CAAC,EACV,IAAIxB,EAAK,KAAK,EAAO,KAAK,EAAOqvB,EAAE,EAAOA,EAAE,EAAOA,EAAE,EAAO,KAAK,EACjE,OAAQ,EAAIrvB,IAAMA,EAAI,EACvB,EAED,SAAY,SAAS4wB,EAAK,CAExB,GAAI,MAAM,KAAK,CAAI,GAAK,MAAM,KAAK,CAAI,EACrC,OAAO,KAGTA,EAAMA,GAAO,KAKb,QAHIC,EAAU,KAAK,MACfC,EAAOD,EAAQ,cAEVn0B,EAAI,EAAGA,EAAIo0B,EAAK,OAAQp0B,IAAK,CAGpC,QADIgL,EAAI6nB,EAAYuB,EAAKp0B,EAAI,CAAC,EAAG,CAAC,EACzByoB,EAAIzoB,EAAI,EAAGyoB,GAAK,EAAGA,IAC1Bzd,EAAIA,EAAE,QAAY,EAAC,IAAOopB,EAAK3L,CAAC,CAAC,EAGnC,GAAI,KAAK,IAAIzd,EAAE,IAAOmpB,CAAO,EAAE,SAAS,EAAID,EAC1C,OAAOlpB,EAAE,IAAO,KAAK,CAAI,CAE5B,CACD,OAAO,IACR,EAOD,UAAa,SAASnG,EAAGC,EAAG,CAE1B,OAAAouB,EAAMruB,EAAGC,CAAC,EACH,EAAE,EAAE6tB,EAAE,EAAO,KAAK,IAAW,KAAK,EAAOA,EAAE,GAASA,EAAE,EAAO,KAAK,GAC1E,EAOD,QAAW,UAAW,CAEpB,OAAO,KAAK,EAAO,KAAK,EAAO,KAAK,CACrC,EAOD,WAAc,SAAS0B,EAAc,CAEnC,IAAIC,EAAOvuB,EAAM,GACb4S,EAAI,KAAK,EACTwH,EAAI,KAAK,EACb,OAAI,KAAK,EAAO,IACdpa,GAAM,KAGJoa,IAAM,EACRpa,GAAM4S,GAGF0b,IAAiBC,EAAQ,KAAK,MAAM3b,EAAIwH,CAAC,GAAK,IAChDpa,GAAMuuB,EACNvuB,GAAM,IACN4S,GAAIwH,GAGNpa,GAAM4S,EACN5S,GAAM,IACNA,GAAMoa,GAEDpa,CACR,EAOD,QAAW,SAASsuB,EAAc,CAEhC,IAAIC,EAAOvuB,EAAM,GACb4S,EAAI,KAAK,EACTwH,EAAI,KAAK,EACb,OAAI,KAAK,EAAO,IACdpa,GAAM,KAGJoa,IAAM,EACRpa,GAAM4S,GAGF0b,IAAiBC,EAAQ,KAAK,MAAM3b,EAAIwH,CAAC,GAAK,IAChDpa,GAAMuuB,EACN3b,GAAIwH,GAGNpa,GAAM,UACNA,GAAM4S,EACN5S,GAAM,KACNA,GAAMoa,EACNpa,GAAM,KAEDA,CACR,EAOD,YAAe,UAAW,CAExB,IAAIzC,EACAuB,EAAI,KAAK,EACTC,EAAI,KAAK,EACTyvB,EAAM,CAAA,EAEV,GAAI,MAAM1vB,CAAC,GAAK,MAAMC,CAAC,EACrB,OAAOyvB,EAGT,GACEA,EAAI,KAAK,KAAK,MAAM1vB,EAAIC,CAAC,CAAC,EAC1BxB,EAAIuB,EAAIC,EACRD,EAAIC,EACJA,EAAIxB,QACGuB,IAAM,GAEf,OAAO0vB,CACR,EAOD,SAAY,SAASC,EAAK,CAExB,IAAI,EAAI,KAAK,EACThB,EAAI,KAAK,EAEb,GAAI,MAAM,CAAC,GAAK,MAAMA,CAAC,EACrB,MAAO,MAGTgB,EAAMA,GAAO,GAEb,IAAIC,EAASZ,EAAS,EAAGL,CAAC,EACtBkB,EAASZ,EAAW,EAAGN,EAAGiB,CAAM,EAEhC1uB,EAAM,KAAK,EAAO,EAAI,IAAM,GAUhC,GARAA,GAAM,EAAIytB,EAAI,EAEd,GAAIA,EACJ,GAAI,GAEA,IACFztB,GAAM,KAEJ0uB,EAAQ,CAEV,QAASz0B,EAAI00B,EAAQ10B,KACnB+F,GAAM,EAAIytB,EAAI,EACd,GAAIA,EACJ,GAAI,GAENztB,GAAM,IACN,QAAS/F,EAAIy0B,EAAQz0B,KACnB+F,GAAM,EAAIytB,EAAI,EACd,GAAIA,EACJ,GAAI,GAENztB,GAAM,GACd,KACQ,SAAS/F,EAAIw0B,EAAK,GAAKx0B,KACrB+F,GAAM,EAAIytB,EAAI,EACd,GAAIA,EACJ,GAAI,GAGR,OAAOztB,CACR,CACL,EAGI,OAAO,eAAe4uB,EAAS,aAAc,CAAE,MAAS,EAAI,CAAE,EAC9DA,EAAQ,QAAa3O,EACrBnmB,EAAO,QAAammB,CAKvB,GAAM,8BCr4BP,IAAIrmB,GAAyBY,GAC7B,OAAO,eAAeylB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAI4O,GAAYj1B,GAAuBuD,GAAA,CAAsB,EACzDqiB,GAAW9gB,EACXsC,GAAO,WACPia,GAAe,CAAA,EACf6T,MAAyCtP,GAAS,SAASxe,GAAMia,GAAc,UAAY,CAI7F,cAAO,eAAe4T,GAAU,QAAY,OAAQ,CAClD,MAAO,UACX,CAAG,EACDA,GAAU,QAAW,UAAU,YAAcA,GAAU,QACvDA,GAAU,QAAW,UAAU,KAAO,WACtCA,GAAU,QAAW,UAAU,WAAa,GAO5CA,GAAU,QAAW,UAAU,OAAS,UAAY,CAClD,MAAO,CACL,OAAQ,WACR,EAAG,KAAK,EAAI,KAAK,EACjB,EAAG,KAAK,CACd,CACA,EAQEA,GAAU,QAAW,SAAW,SAAUjO,EAAM,CAC9C,OAAO,IAAIiO,GAAU,QAAWjO,CAAI,CACxC,EACSiO,GAAU,OACnB,EAAG,CACD,QAAS,EACX,CAAC,EACD5O,GAAA,oBAA8B6O,aC9C9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAItwB,GAAMjE,GACN6a,GAAUlY,GACVqiB,GAAW9gB,EACXsC,GAAO,QACPia,GAAe,CAAA,EACf+T,MAAsCxP,GAAS,SAASxe,GAAMia,GAAc,UAAY,CAgC1F,SAAS8T,EAAMlf,EAAOC,EAAKuO,EAAM,CAC/B,GAAI,EAAE,gBAAgB0Q,GACpB,MAAM,IAAI,YAAY,kDAAkD,EAE1E,IAAIE,EAAWpf,GAAU,KACrBqf,EAASpf,GAAQ,KACjBqf,EAAU9Q,GAAS,KACvB,GAAI4Q,GACF,MAAQxwB,GAAI,aAAaoR,CAAK,EAC5BA,EAAQA,EAAM,mBACL,OAAOA,GAAU,SAC1B,MAAM,IAAI,UAAU,kCAAkC,EAG1D,GAAIqf,GACF,MAAQzwB,GAAI,aAAaqR,CAAG,EAC1BA,EAAMA,EAAI,mBACD,OAAOA,GAAQ,SACxB,MAAM,IAAI,UAAU,gCAAgC,EAGxD,GAAIqf,GACF,MAAQ1wB,GAAI,aAAa4f,CAAI,EAC3BA,EAAOA,EAAK,mBACH,OAAOA,GAAS,SACzB,MAAM,IAAI,UAAU,iCAAiC,EAGzD,KAAK,MAAQ4Q,EAAW,WAAWpf,CAAK,EAAI,EAC5C,KAAK,IAAMqf,EAAS,WAAWpf,CAAG,EAAI,EACtC,KAAK,KAAOqf,EAAU,WAAW9Q,CAAI,EAAI,CAC1C,CAKD,OAAA0Q,EAAM,UAAU,KAAO,QACvBA,EAAM,UAAU,QAAU,GAW1BA,EAAM,MAAQ,SAAU/uB,EAAK,CAC3B,GAAI,OAAOA,GAAQ,SACjB,OAAO,KAET,IAAIyG,EAAOzG,EAAI,MAAM,GAAG,EACpBovB,EAAO3oB,EAAK,IAAI,SAAU2D,EAAK,CACjC,OAAO,WAAWA,CAAG,CAC3B,CAAK,EACGilB,EAAUD,EAAK,KAAK,SAAUpK,EAAK,CACrC,OAAO,MAAMA,CAAG,CACtB,CAAK,EACD,GAAIqK,EACF,OAAO,KAET,OAAQD,EAAK,OAAM,CACjB,IAAK,GACH,OAAO,IAAIL,EAAMK,EAAK,CAAC,EAAGA,EAAK,CAAC,CAAC,EACnC,IAAK,GACH,OAAO,IAAIL,EAAMK,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGA,EAAK,CAAC,CAAC,EAC5C,QACE,OAAO,IACV,CACL,EAMEL,EAAM,UAAU,MAAQ,UAAY,CAClC,OAAO,IAAIA,EAAM,KAAK,MAAO,KAAK,IAAK,KAAK,IAAI,CACpD,EAQEA,EAAM,UAAU,KAAO,UAAY,CACjC,IAAI9vB,EAAM,EACN4Q,EAAQ,KAAK,MACbwO,EAAO,KAAK,KACZvO,EAAM,KAAK,IACX6E,EAAO7E,EAAMD,EACjB,SAAQwF,GAAQ,MAAMgJ,CAAI,OAAUhJ,GAAQ,MAAMV,CAAI,EACpD1V,EAAM,KAAK,KAAK0V,EAAO0J,CAAI,EAClB1J,IAAS,IAClB1V,EAAM,GAEJ,MAAMA,CAAG,IACXA,EAAM,GAED,CAACA,CAAG,CACf,EAOE8vB,EAAM,UAAU,IAAM,UAAY,CAChC,IAAIjc,EAAO,KAAK,KAAM,EAAC,CAAC,EACxB,GAAIA,EAAO,EACT,OAAI,KAAK,KAAO,EAEP,KAAK,MAGL,KAAK,OAASA,EAAO,GAAK,KAAK,IAK9C,EAOEic,EAAM,UAAU,IAAM,UAAY,CAChC,IAAIjc,EAAO,KAAK,KAAM,EAAC,CAAC,EACxB,GAAIA,EAAO,EACT,OAAI,KAAK,KAAO,EAEP,KAAK,OAASA,EAAO,GAAK,KAAK,KAG/B,KAAK,KAKpB,EASEic,EAAM,UAAU,QAAU,SAAUlwB,EAAU,CAC5C,IAAIzB,EAAI,KAAK,MACTihB,EAAO,KAAK,KACZvO,EAAM,KAAK,IACX,EAAI,EACR,GAAIuO,EAAO,EACT,KAAOjhB,EAAI0S,GACTjR,EAASzB,EAAG,CAAC,CAAC,EAAG,IAAI,EACrBA,GAAKihB,EACL,YAEOA,EAAO,EAChB,KAAOjhB,EAAI0S,GACTjR,EAASzB,EAAG,CAAC,CAAC,EAAG,IAAI,EACrBA,GAAKihB,EACL,GAGR,EAWE0Q,EAAM,UAAU,IAAM,SAAUlwB,EAAU,CACxC,IAAIiC,EAAQ,CAAA,EACZ,YAAK,QAAQ,SAAUlC,EAAO8H,EAAO7M,EAAK,CACxCiH,EAAM4F,EAAM,CAAC,CAAC,EAAI7H,EAASD,EAAO8H,EAAO7M,CAAG,CAClD,CAAK,EACMiH,CACX,EAOEiuB,EAAM,UAAU,QAAU,UAAY,CACpC,IAAIjuB,EAAQ,CAAA,EACZ,YAAK,QAAQ,SAAUlC,EAAO8H,EAAO,CACnC5F,EAAM4F,EAAM,CAAC,CAAC,EAAI9H,CACxB,CAAK,EACMkC,CACX,EAOEiuB,EAAM,UAAU,QAAU,UAAY,CAEpC,OAAO,KAAK,SAChB,EAYEA,EAAM,UAAU,OAAS,SAAUvuB,EAAS,CAC1C,IAAIR,KAAUqV,GAAQ,QAAQ,KAAK,MAAO7U,CAAO,EACjD,OAAI,KAAK,OAAS,IAChBR,GAAO,OAAUqV,GAAQ,QAAQ,KAAK,KAAM7U,CAAO,GAErDR,GAAO,OAAUqV,GAAQ,QAAQ,KAAK,IAAK7U,CAAO,EAC3CR,CACX,EAOE+uB,EAAM,UAAU,SAAW,UAAY,CACrC,OAAO,KAAK,QAChB,EAQEA,EAAM,UAAU,OAAS,UAAY,CACnC,MAAO,CACL,OAAQ,QACR,MAAO,KAAK,MACZ,IAAK,KAAK,IACV,KAAM,KAAK,IACjB,CACA,EASEA,EAAM,SAAW,SAAUnO,EAAM,CAC/B,OAAO,IAAImO,EAAMnO,EAAK,MAAOA,EAAK,IAAKA,EAAK,IAAI,CACpD,EACSmO,CACT,EAAG,CACD,QAAS,EACX,CAAC,EACDA,GAAA,iBAA2BC,aCpT3B,OAAO,eAAeM,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAI9P,GAAWhlB,EACXwG,GAAO,SACPia,GAAe,CAAA,EACfsU,MAAuC/P,GAAS,SAASxe,GAAMia,GAAc,UAAY,CAuB3F,SAASqU,GAAS,CAChB,GAAI,EAAE,gBAAgBA,GACpB,MAAM,IAAI,YAAY,kDAAkD,CAE3E,CAKD,OAAAA,EAAO,UAAU,KAAO,SACxBA,EAAO,UAAU,SAAW,GAU5BA,EAAO,UAAU,QAAU,UAAY,CAErC,MAAM,IAAI,MAAM,6CAA6C,CACjE,EAUEA,EAAO,UAAU,SAAW,UAAY,CAEtC,MAAM,IAAI,MAAM,8CAA8C,CAClE,EAOEA,EAAO,UAAU,OAAS,SAAUE,EAAMC,EAAU,CAClD,MAAM,IAAI,MAAM,4CAA4C,CAChE,EAeEH,EAAO,UAAU,OAAS,SAAU5oB,EAAOgpB,EAAajX,EAAc,CAEpE,MAAM,IAAI,MAAM,4CAA4C,CAChE,EAOE6W,EAAO,UAAU,IAAM,SAAU5oB,EAAO,CAEtC,MAAM,IAAI,MAAM,yCAAyC,CAC7D,EAWE4oB,EAAO,UAAU,IAAM,SAAU5oB,EAAO9H,EAAO6Z,EAAc,CAE3D,MAAM,IAAI,MAAM,yCAAyC,CAC7D,EAcE6W,EAAO,UAAU,OAAS,SAAUxc,EAAM2F,EAAc,CAEtD,MAAM,IAAI,MAAM,4CAA4C,CAChE,EAWE6W,EAAO,UAAU,QAAU,SAAUxc,EAAM2F,EAAc,CAEvD,MAAM,IAAI,MAAM,6CAA6C,CACjE,EAME6W,EAAO,UAAU,MAAQ,UAAY,CAEnC,MAAM,IAAI,MAAM,2CAA2C,CAC/D,EAMEA,EAAO,UAAU,KAAO,UAAY,CAElC,MAAM,IAAI,MAAM,0CAA0C,CAC9D,EAYEA,EAAO,UAAU,IAAM,SAAUzwB,EAAU8wB,EAAW,CAEpD,MAAM,IAAI,MAAM,yCAAyC,CAC7D,EAQEL,EAAO,UAAU,QAAU,SAAUzwB,EAAU,CAE7C,MAAM,IAAI,MAAM,6CAA6C,CACjE,EAMEywB,EAAO,UAAU,OAAO,QAAQ,EAAI,UAAY,CAE9C,MAAM,IAAI,MAAM,mCAAmC,CACvD,EAMEA,EAAO,UAAU,QAAU,UAAY,CAErC,MAAM,IAAI,MAAM,6CAA6C,CACjE,EAMEA,EAAO,UAAU,QAAU,UAAY,CAErC,MAAM,IAAI,MAAM,6CAA6C,CACjE,EAUEA,EAAO,UAAU,OAAS,SAAU9uB,EAAS,CAE3C,MAAM,IAAI,MAAM,4CAA4C,CAChE,EAME8uB,EAAO,UAAU,SAAW,UAAY,CAEtC,MAAM,IAAI,MAAM,8CAA8C,CAClE,EACSA,CACT,EAAG,CACD,QAAS,EACX,CAAC,EACDA,GAAA,kBAA4BC,2ECxP5B,IAAIj1B,EAAUE,GAAuB,QACrC,SAASo1B,GAAsB,CAE7B91B,EAAiB,QAAA81B,EAAsB,UAA+B,CACpE,OAAOvc,CACX,EAAKvZ,EAAA,QAAA,WAA4B,GAAMA,EAAO,QAAQ,QAAaA,EAAO,QACxE,IAAI,EACFuZ,EAAI,CAAE,EACN6I,EAAI,OAAO,UACXtJ,EAAIsJ,EAAE,eACN3hB,EAAI,OAAO,gBAAkB,SAAUgD,EAAG8V,EAAG6I,EAAG,CAC9C3e,EAAE8V,CAAC,EAAI6I,EAAE,KACV,EACDjiB,EAAkB,OAAO,QAArB,WAA8B,OAAS,CAAE,EAC7C6E,EAAI7E,EAAE,UAAY,aAClB,EAAIA,EAAE,eAAiB,kBACvBiwB,EAAIjwB,EAAE,aAAe,gBACvB,SAAS41B,EAAOtyB,EAAG8V,EAAG6I,EAAG,CACvB,OAAO,OAAO,eAAe3e,EAAG8V,EAAG,CACjC,MAAO6I,EACP,WAAY,GACZ,aAAc,GACd,SAAU,EAChB,CAAK,EAAG3e,EAAE8V,CAAC,CACR,CACD,GAAI,CACFwc,EAAO,CAAA,EAAI,EAAE,CACd,MAAW,CACVA,EAAS,SAAgBtyB,EAAG8V,GAAG6I,EAAG,CAChC,OAAO3e,EAAE8V,EAAC,EAAI6I,CACpB,CACG,CACD,SAAS4T,EAAKvyB,EAAG8V,EAAG6I,EAAGtJ,GAAG,CACxB,IAAI3Y,EAAIoZ,GAAKA,EAAE,qBAAqB0c,EAAY1c,EAAI0c,EAClDjxB,EAAI,OAAO,OAAO7E,EAAE,SAAS,EAC7BqP,GAAI,IAAI0mB,EAAQpd,IAAK,CAAE,CAAA,EACzB,OAAOrY,EAAEuE,EAAG,UAAW,CACrB,MAAOmxB,EAAiB1yB,EAAG2e,EAAG5S,EAAC,CAChC,CAAA,EAAGxK,CACL,CACD,SAASoxB,EAAS3yB,EAAG8V,EAAG6I,EAAG,CACzB,GAAI,CACF,MAAO,CACL,KAAM,SACN,IAAK3e,EAAE,KAAK8V,EAAG6I,CAAC,CACxB,CACK,OAAQ3e,GAAG,CACV,MAAO,CACL,KAAM,QACN,IAAKA,EACb,CACK,CACF,CACD8V,EAAE,KAAOyc,EACT,IAAIK,EAAI,iBACNC,EAAI,iBACJ/P,EAAI,YACJpb,EAAI,YACJwP,EAAI,CAAA,EACN,SAASsb,GAAY,CAAE,CACvB,SAASM,GAAoB,CAAE,CAC/B,SAASC,GAA6B,CAAE,CACxC,IAAI1rB,EAAI,CAAA,EACRirB,EAAOjrB,EAAG9F,EAAG,UAAY,CACvB,OAAO,IACX,CAAG,EACD,IAAIsb,EAAI,OAAO,eACbyQ,EAAIzQ,GAAKA,EAAEA,EAAE5b,EAAO,CAAA,CAAE,CAAC,CAAC,EAC1BqsB,GAAKA,IAAM3O,GAAKtJ,EAAE,KAAKiY,EAAG/rB,CAAC,IAAM8F,EAAIimB,GACrC,IAAI0F,EAAID,EAA2B,UAAYP,EAAU,UAAY,OAAO,OAAOnrB,CAAC,EACpF,SAAS4rB,EAAsBjzB,EAAG,CAChC,CAAC,OAAQ,QAAS,QAAQ,EAAE,QAAQ,SAAU8V,EAAG,CAC/Cwc,EAAOtyB,EAAG8V,EAAG,SAAU9V,EAAG,CACxB,OAAO,KAAK,QAAQ8V,EAAG9V,CAAC,CAChC,CAAO,CACP,CAAK,CACF,CACD,SAASkzB,EAAclzB,EAAG8V,EAAG,CAC3B,SAASqd,EAAOxU,EAAG3hB,EAAGN,GAAG6E,GAAG,CAC1B,IAAIwK,GAAI4mB,EAAS3yB,EAAE2e,CAAC,EAAG3e,EAAGhD,CAAC,EAC3B,GAAgB+O,GAAE,OAAd,QAAoB,CACtB,IAAI4gB,GAAI5gB,GAAE,IACR6mB,GAAIjG,GAAE,MACR,OAAOiG,IAAiB71B,EAAQ61B,EAAC,GAArB,UAA0Bvd,EAAE,KAAKud,GAAG,SAAS,EAAI9c,EAAE,QAAQ8c,GAAE,OAAO,EAAE,KAAK,SAAU5yB,GAAG,CAClGmzB,EAAO,OAAQnzB,GAAGtD,GAAG6E,EAAC,CACvB,EAAE,SAAUvB,GAAG,CACdmzB,EAAO,QAASnzB,GAAGtD,GAAG6E,EAAC,CACjC,CAAS,EAAIuU,EAAE,QAAQ8c,EAAC,EAAE,KAAK,SAAU5yB,GAAG,CAClC2sB,GAAE,MAAQ3sB,GAAGtD,GAAEiwB,EAAC,CACjB,EAAE,SAAU3sB,GAAG,CACd,OAAOmzB,EAAO,QAASnzB,GAAGtD,GAAG6E,EAAC,CACxC,CAAS,CACF,CACDA,GAAEwK,GAAE,GAAG,CACR,CACD,IAAI4S,GACJ3hB,EAAE,KAAM,UAAW,CACjB,MAAO,SAAegD,EAAGqV,GAAG,CAC1B,SAAS+d,IAA6B,CACpC,OAAO,IAAItd,EAAE,SAAUA,GAAG6I,GAAG,CAC3BwU,EAAOnzB,EAAGqV,GAAGS,GAAG6I,EAAC,CAC7B,CAAW,CACF,CACD,OAAOA,GAAIA,GAAIA,GAAE,KAAKyU,GAA4BA,EAA0B,EAAIA,IACjF,CACP,CAAK,CACF,CACD,SAASV,EAAiB5c,EAAG6I,EAAGtJ,EAAG,CACjC,IAAIrY,GAAI41B,EACR,OAAO,SAAUl2B,EAAG6E,EAAG,CACrB,GAAIvE,KAAM8lB,EAAG,MAAM,IAAI,MAAM,8BAA8B,EAC3D,GAAI9lB,KAAM0K,EAAG,CACX,GAAgBhL,IAAZ,QAAe,MAAM6E,EACzB,MAAO,CACL,MAAO,EACP,KAAM,EAChB,CACO,CACD,IAAK8T,EAAE,OAAS3Y,EAAG2Y,EAAE,IAAM9T,IAAK,CAC9B,IAAIwK,GAAIsJ,EAAE,SACV,GAAItJ,GAAG,CACL,IAAI4gB,GAAI0G,EAAoBtnB,GAAGsJ,CAAC,EAChC,GAAIsX,GAAG,CACL,GAAIA,KAAMzV,EAAG,SACb,OAAOyV,EACR,CACF,CACD,GAAetX,EAAE,SAAb,OAAqBA,EAAE,KAAOA,EAAE,MAAQA,EAAE,YAAyBA,EAAE,SAAd,QAAsB,CAC/E,GAAIrY,KAAM41B,EAAG,MAAM51B,GAAI0K,EAAG2N,EAAE,IAC5BA,EAAE,kBAAkBA,EAAE,GAAG,CACnC,MAA4BA,EAAE,SAAf,UAAyBA,EAAE,OAAO,SAAUA,EAAE,GAAG,EACxDrY,GAAI8lB,EACJ,IAAIzb,GAAIsrB,EAAS7c,EAAG6I,EAAGtJ,CAAC,EACxB,GAAiBhO,GAAE,OAAf,SAAqB,CACvB,GAAIrK,GAAIqY,EAAE,KAAO3N,EAAImrB,EAAGxrB,GAAE,MAAQ6P,EAAG,SACrC,MAAO,CACL,MAAO7P,GAAE,IACT,KAAMgO,EAAE,IACpB,CACS,CACWhO,GAAE,OAAd,UAAuBrK,GAAI0K,EAAG2N,EAAE,OAAS,QAASA,EAAE,IAAMhO,GAAE,IAC7D,CACP,CACG,CACD,SAASgsB,EAAoBvd,EAAG6I,EAAG,CACjC,IAAItJ,EAAIsJ,EAAE,OACR3hB,GAAI8Y,EAAE,SAAST,CAAC,EAClB,GAAIrY,KAAM,EAAG,OAAO2hB,EAAE,SAAW,KAAkBtJ,IAAZ,SAAiBS,EAAE,SAAS,SAAc6I,EAAE,OAAS,SAAUA,EAAE,IAAM,EAAG0U,EAAoBvd,EAAG6I,CAAC,EAAeA,EAAE,SAAd,UAAsCtJ,IAAb,WAAmBsJ,EAAE,OAAS,QAASA,EAAE,IAAM,IAAI,UAAU,oCAAsCtJ,EAAI,UAAU,GAAI6B,EAC1R,IAAIxa,EAAIi2B,EAAS31B,GAAG8Y,EAAE,SAAU6I,EAAE,GAAG,EACrC,GAAgBjiB,EAAE,OAAd,QAAoB,OAAOiiB,EAAE,OAAS,QAASA,EAAE,IAAMjiB,EAAE,IAAKiiB,EAAE,SAAW,KAAMzH,EACrF,IAAI3V,EAAI7E,EAAE,IACV,OAAO6E,EAAIA,EAAE,MAAQod,EAAE7I,EAAE,UAAU,EAAIvU,EAAE,MAAOod,EAAE,KAAO7I,EAAE,QAAsB6I,EAAE,SAAf,WAA0BA,EAAE,OAAS,OAAQA,EAAE,IAAM,GAAIA,EAAE,SAAW,KAAMzH,GAAK3V,GAAKod,EAAE,OAAS,QAASA,EAAE,IAAM,IAAI,UAAU,kCAAkC,EAAGA,EAAE,SAAW,KAAMzH,EAC7P,CACD,SAASoc,EAAatzB,EAAG,CACvB,IAAI8V,EAAI,CACN,OAAQ9V,EAAE,CAAC,CACjB,EACI,KAAKA,IAAM8V,EAAE,SAAW9V,EAAE,CAAC,GAAI,KAAKA,IAAM8V,EAAE,WAAa9V,EAAE,CAAC,EAAG8V,EAAE,SAAW9V,EAAE,CAAC,GAAI,KAAK,WAAW,KAAK8V,CAAC,CAC1G,CACD,SAASyd,EAAcvzB,EAAG,CACxB,IAAI8V,EAAI9V,EAAE,YAAc,GACxB8V,EAAE,KAAO,SAAU,OAAOA,EAAE,IAAK9V,EAAE,WAAa8V,CACjD,CACD,SAAS2c,EAAQzyB,EAAG,CAClB,KAAK,WAAa,CAAC,CACjB,OAAQ,MACd,CAAK,EAAGA,EAAE,QAAQszB,EAAc,IAAI,EAAG,KAAK,MAAM,EAAE,CACjD,CACD,SAASryB,EAAO6U,EAAG,CACjB,GAAIA,GAAYA,IAAP,GAAU,CACjB,IAAI6I,EAAI7I,EAAEvU,CAAC,EACX,GAAIod,EAAG,OAAOA,EAAE,KAAK7I,CAAC,EACtB,GAAkB,OAAOA,EAAE,MAAvB,WAA6B,OAAOA,EACxC,GAAI,CAAC,MAAMA,EAAE,MAAM,EAAG,CACpB,IAAI9Y,EAAI,GACNN,GAAI,SAASggB,GAAO,CAClB,KAAO,EAAE1f,EAAI8Y,EAAE,QAAS,GAAIT,EAAE,KAAKS,EAAG9Y,CAAC,EAAG,OAAO0f,EAAK,MAAQ5G,EAAE9Y,CAAC,EAAG0f,EAAK,KAAO,GAAIA,EACpF,OAAOA,EAAK,MAAQ,EAAGA,EAAK,KAAO,GAAIA,CACnD,EACQ,OAAOhgB,GAAE,KAAOA,EACjB,CACF,CACD,MAAM,IAAI,UAAUK,EAAQ+Y,CAAC,EAAI,kBAAkB,CACpD,CACD,OAAOgd,EAAkB,UAAYC,EAA4B/1B,EAAEg2B,EAAG,cAAe,CACnF,MAAOD,EACP,aAAc,EAClB,CAAG,EAAG/1B,EAAE+1B,EAA4B,cAAe,CAC/C,MAAOD,EACP,aAAc,EACf,CAAA,EAAGA,EAAkB,YAAcR,EAAOS,EAA4BpG,EAAG,mBAAmB,EAAG7W,EAAE,oBAAsB,SAAU9V,EAAG,CACnI,IAAI8V,EAAkB,OAAO9V,GAArB,YAA0BA,EAAE,YACpC,MAAO,CAAC,CAAC8V,IAAMA,IAAMgd,IAA8Chd,EAAE,aAAeA,EAAE,QAA5C,oBAC9C,EAAKA,EAAE,KAAO,SAAU9V,EAAG,CACvB,OAAO,OAAO,eAAiB,OAAO,eAAeA,EAAG+yB,CAA0B,GAAK/yB,EAAE,UAAY+yB,EAA4BT,EAAOtyB,EAAG2sB,EAAG,mBAAmB,GAAI3sB,EAAE,UAAY,OAAO,OAAOgzB,CAAC,EAAGhzB,CACzM,EAAK8V,EAAE,MAAQ,SAAU9V,EAAG,CACxB,MAAO,CACL,QAASA,CACf,CACA,EAAKizB,EAAsBC,EAAc,SAAS,EAAGZ,EAAOY,EAAc,UAAW,EAAG,UAAY,CAChG,OAAO,IACR,CAAA,EAAGpd,EAAE,cAAgBod,EAAepd,EAAE,MAAQ,SAAU9V,EAAG2e,EAAGtJ,EAAGrY,GAAGN,EAAG,CAC3DA,IAAX,SAAiBA,EAAI,SACrB,IAAI6E,EAAI,IAAI2xB,EAAcX,EAAKvyB,EAAG2e,EAAGtJ,EAAGrY,EAAC,EAAGN,CAAC,EAC7C,OAAOoZ,EAAE,oBAAoB6I,CAAC,EAAIpd,EAAIA,EAAE,KAAM,EAAC,KAAK,SAAUvB,GAAG,CAC/D,OAAOA,GAAE,KAAOA,GAAE,MAAQuB,EAAE,MAClC,CAAK,CACF,EAAE0xB,EAAsBD,CAAC,EAAGV,EAAOU,EAAGrG,EAAG,WAAW,EAAG2F,EAAOU,EAAGzxB,EAAG,UAAY,CAC/E,OAAO,IACR,CAAA,EAAG+wB,EAAOU,EAAG,WAAY,UAAY,CACpC,MAAO,oBACR,CAAA,EAAGld,EAAE,KAAO,SAAU9V,EAAG,CACxB,IAAI8V,EAAI,OAAO9V,CAAC,EACd2e,EAAI,CAAA,EACN,QAAStJ,MAAKS,EAAG6I,EAAE,KAAKtJ,EAAC,EACzB,OAAOsJ,EAAE,UAAW,SAASjC,GAAO,CAClC,KAAOiC,EAAE,QAAS,CAChB,IAAI3e,EAAI2e,EAAE,MACV,GAAI3e,KAAK8V,EAAG,OAAO4G,EAAK,MAAQ1c,EAAG0c,EAAK,KAAO,GAAIA,CACpD,CACD,OAAOA,EAAK,KAAO,GAAIA,CAC7B,CACG,EAAE5G,EAAE,OAAS7U,EAAQwxB,EAAQ,UAAY,CACxC,YAAaA,EACb,MAAO,SAAe3c,EAAG,CACvB,GAAI,KAAK,KAAO,EAAG,KAAK,KAAO,EAAG,KAAK,KAAO,KAAK,MAAQ,EAAG,KAAK,KAAO,GAAI,KAAK,SAAW,KAAM,KAAK,OAAS,OAAQ,KAAK,IAAM,EAAG,KAAK,WAAW,QAAQyd,CAAa,EAAG,CAACzd,EAAG,QAAS6I,KAAK,KAAcA,EAAE,OAAO,CAAC,IAAlB,KAAuBtJ,EAAE,KAAK,KAAMsJ,CAAC,GAAK,CAAC,MAAM,CAACA,EAAE,MAAM,CAAC,CAAC,IAAM,KAAKA,CAAC,EAAI,EACrR,EACD,KAAM,UAAgB,CACpB,KAAK,KAAO,GACZ,IAAI3e,EAAI,KAAK,WAAW,CAAC,EAAE,WAC3B,GAAgBA,EAAE,OAAd,QAAoB,MAAMA,EAAE,IAChC,OAAO,KAAK,IACb,EACD,kBAAmB,SAA2B8V,EAAG,CAC/C,GAAI,KAAK,KAAM,MAAMA,EACrB,IAAI6I,EAAI,KACR,SAAS6U,GAAOne,GAAGrY,GAAG,CACpB,OAAOuE,GAAE,KAAO,QAASA,GAAE,IAAMuU,EAAG6I,EAAE,KAAOtJ,GAAGrY,KAAM2hB,EAAE,OAAS,OAAQA,EAAE,IAAM,GAAI,CAAC,CAAC3hB,EACxF,CACD,QAASA,EAAI,KAAK,WAAW,OAAS,EAAGA,GAAK,EAAG,EAAEA,EAAG,CACpD,IAAIN,EAAI,KAAK,WAAWM,CAAC,EACvBuE,GAAI7E,EAAE,WACR,GAAeA,EAAE,SAAb,OAAqB,OAAO82B,GAAO,KAAK,EAC5C,GAAI92B,EAAE,QAAU,KAAK,KAAM,CACzB,IAAIqP,GAAIsJ,EAAE,KAAK3Y,EAAG,UAAU,EAC1BiwB,GAAItX,EAAE,KAAK3Y,EAAG,YAAY,EAC5B,GAAIqP,IAAK4gB,GAAG,CACV,GAAI,KAAK,KAAOjwB,EAAE,SAAU,OAAO82B,GAAO92B,EAAE,SAAU,EAAE,EACxD,GAAI,KAAK,KAAOA,EAAE,WAAY,OAAO82B,GAAO92B,EAAE,UAAU,CACzD,SAAUqP,IACT,GAAI,KAAK,KAAOrP,EAAE,SAAU,OAAO82B,GAAO92B,EAAE,SAAU,EAAE,MACnD,CACL,GAAI,CAACiwB,GAAG,MAAM,IAAI,MAAM,wCAAwC,EAChE,GAAI,KAAK,KAAOjwB,EAAE,WAAY,OAAO82B,GAAO92B,EAAE,UAAU,CACzD,CACF,CACF,CACF,EACD,OAAQ,SAAgBsD,EAAG8V,EAAG,CAC5B,QAAS6I,GAAI,KAAK,WAAW,OAAS,EAAGA,IAAK,EAAG,EAAEA,GAAG,CACpD,IAAI3hB,EAAI,KAAK,WAAW2hB,EAAC,EACzB,GAAI3hB,EAAE,QAAU,KAAK,MAAQqY,EAAE,KAAKrY,EAAG,YAAY,GAAK,KAAK,KAAOA,EAAE,WAAY,CAChF,IAAIN,EAAIM,EACR,KACD,CACF,CACDN,IAAkBsD,IAAZ,SAAgCA,IAAf,aAAqBtD,EAAE,QAAUoZ,GAAKA,GAAKpZ,EAAE,aAAeA,EAAI,MACvF,IAAI6E,GAAI7E,EAAIA,EAAE,WAAa,CAAA,EAC3B,OAAO6E,GAAE,KAAOvB,EAAGuB,GAAE,IAAMuU,EAAGpZ,GAAK,KAAK,OAAS,OAAQ,KAAK,KAAOA,EAAE,WAAYwa,GAAK,KAAK,SAAS3V,EAAC,CACxG,EACD,SAAU,SAAkBvB,EAAG8V,EAAG,CAChC,GAAgB9V,EAAE,OAAd,QAAoB,MAAMA,EAAE,IAChC,OAAmBA,EAAE,OAAd,SAAqCA,EAAE,OAAjB,WAAwB,KAAK,KAAOA,EAAE,IAAmBA,EAAE,OAAf,UAAuB,KAAK,KAAO,KAAK,IAAMA,EAAE,IAAK,KAAK,OAAS,SAAU,KAAK,KAAO,OAAsBA,EAAE,OAAf,UAAuB8V,IAAM,KAAK,KAAOA,GAAIoB,CACzN,EACD,OAAQ,SAAgBlX,EAAG,CACzB,QAAS8V,EAAI,KAAK,WAAW,OAAS,EAAGA,GAAK,EAAG,EAAEA,EAAG,CACpD,IAAI6I,GAAI,KAAK,WAAW7I,CAAC,EACzB,GAAI6I,GAAE,aAAe3e,EAAG,OAAO,KAAK,SAAS2e,GAAE,WAAYA,GAAE,QAAQ,EAAG4U,EAAc5U,EAAC,EAAGzH,CAC3F,CACF,EACD,MAAS,SAAgBlX,EAAG,CAC1B,QAAS8V,EAAI,KAAK,WAAW,OAAS,EAAGA,GAAK,EAAG,EAAEA,EAAG,CACpD,IAAI6I,GAAI,KAAK,WAAW7I,CAAC,EACzB,GAAI6I,GAAE,SAAW3e,EAAG,CAClB,IAAIqV,EAAIsJ,GAAE,WACV,GAAgBtJ,EAAE,OAAd,QAAoB,CACtB,IAAIrY,EAAIqY,EAAE,IACVke,EAAc5U,EAAC,CAChB,CACD,OAAO3hB,CACR,CACF,CACD,MAAM,IAAI,MAAM,uBAAuB,CACxC,EACD,cAAe,SAAuB8Y,EAAG6I,EAAGtJ,GAAG,CAC7C,OAAO,KAAK,SAAW,CACrB,SAAUpU,EAAO6U,CAAC,EAClB,WAAY6I,EACZ,QAAStJ,EACjB,EAAoB,KAAK,SAAhB,SAA2B,KAAK,IAAM,GAAI6B,CAC9C,CACF,EAAEpB,CACJ,CACDvZ,EAAA,QAAiB81B,EAAqB91B,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,sEC7S3G,IAAIk3B,EAAUx2B,GAAwC,IACxCy2B,GAAGD,EAGjB,GAAI,CACF,mBAAqBA,CACtB,MAA8B,CACzB,OAAO,YAAe,SACxB,WAAW,mBAAqBA,EAEhC,SAAS,IAAK,wBAAwB,EAAEA,CAAO,CAEnD,iECZA,OAAO,eAAeE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAGC,EAInB,SAASA,EAASC,EAAO,CACvB,IAAIte,EAAO,EACPD,EAAO,EACPwe,EAAQ,OAAO,OAAO,IAAI,EAC1B3Z,EAAM,OAAO,OAAO,IAAI,EACxBhR,EAAQ,EACR4qB,EAAM,SAAaC,EAAI,CACzB,IAAIC,EAAW9Z,EAAI6Z,CAAE,EACrB,GAAKC,IACL,OAAOH,EAAMG,CAAQ,EACrB,OAAO9Z,EAAI6Z,CAAE,EACb,EAAEze,EACED,IAAS2e,GACb,IAAI,CAAC1e,EAAM,CACTpM,EAAQ,EACRmM,EAAO,EACP,MACD,CACD,KAAO,CAAC,eAAe,KAAKwe,EAAO,EAAExe,CAAI,GAAG,EAGhD,EACE,OAAAue,EAAQ,KAAK,IAAIA,CAAK,EACf,CACL,IAAK,SAAaG,EAAI,CACpB,IAAIC,EAAW9Z,EAAI6Z,CAAE,EACjBE,EAAU,EAAE/qB,EAGhB,GAFA2qB,EAAMI,CAAO,EAAIF,EACjB7Z,EAAI6Z,CAAE,EAAIE,EACN,CAACD,EAEH,MADA,EAAE1e,EACEA,GAAQse,EAAO,QACnBG,EAAKF,EAAMxe,CAAI,EACfye,EAAIC,CAAE,EACCA,GAGT,GADA,OAAOF,EAAMG,CAAQ,EACjB3e,IAAS2e,EACb,KAAO,CAAC,eAAe,KAAKH,EAAO,EAAExe,CAAI,GAAG,CAI7C,EACD,OAAUye,EACV,MAAO,UAAiB,CACtBxe,EAAOpM,EAAQ,EACfmM,EAAO,EACPwe,EAAQ,OAAO,OAAO,IAAI,EAC1B3Z,EAAM,OAAO,OAAO,IAAI,CACzB,CACL,CACA,WC1DA,IAAI9d,GAAyBY,GAC7B,OAAO,eAAek3B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAGC,GACZD,GAAA,QAAGE,GACIF,GAAA,eAAGG,GACzB,IAAI30B,GAAWtD,GAAuBuD,EAAwC,EAC1E20B,GAAYpzB,GAAA,EAkBhB,SAASkzB,GAAQxuB,EAAI,CACnB,IAAIyc,EAAO,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,CAAE,EAC/EkS,EAASlS,EAAK,OACduR,EAAQvR,EAAK,MACf,OAAAuR,EAAQA,GAAgB,OAAO,kBAC/BW,EAASA,GAAiB,KAAK,UACxB,SAASH,GAAU,IAChB10B,GAAS,SAAY00B,EAAQ,KAAK,IAAM,WAC9CA,EAAQ,MAAQ,CACd,OAAQ,IAAI,IACZ,OAASE,GAAU,UAAUV,GAAS,OAAO,iBAAiB,CACtE,GAGI,QADI3qB,EAAO,CAAA,EACFxM,EAAI,EAAGA,EAAI,UAAU,OAAQA,IACpCwM,EAAKxM,CAAC,EAAI,UAAUA,CAAC,EAEvB,IAAI+3B,EAAOD,EAAOtrB,CAAI,EACtB,GAAImrB,EAAQ,MAAM,OAAO,IAAII,CAAI,EAC/B,OAAAJ,EAAQ,MAAM,IAAI,IAAII,CAAI,EACnBJ,EAAQ,MAAM,OAAO,IAAII,CAAI,EAEtC,IAAIC,EAAS7uB,EAAG,MAAMA,EAAIqD,CAAI,EAC9B,OAAAmrB,EAAQ,MAAM,OAAO,IAAII,EAAMC,CAAM,EACrCL,EAAQ,MAAM,OAAO,OAAUA,EAAQ,MAAM,IAAI,IAAII,CAAI,CAAC,EACnDC,CACX,CACA,CAgBA,SAASJ,GAAezuB,EAAI8uB,EAAS,CACnC,IAAIN,EAAU,SAASA,GAAU,CAE/B,QADInrB,EAAO,CAAA,EACF,EAAI,EAAG,EAAI,UAAU,OAAQ,IACpCA,EAAK,CAAC,EAAI,UAAU,CAAC,EAEvB,QAAS6C,EAAI,EAAGA,EAAIsoB,EAAQ,MAAM,OAAQtoB,IAAK,CAC7C,IAAI6oB,EAASP,EAAQ,MAAMtoB,CAAC,EAC5B,GAAI4oB,EAAQzrB,EAAM0rB,EAAO,IAAI,EAE3B,OAAOA,EAAO,GAEjB,CACD,IAAI3D,EAAMprB,EAAG,MAAMA,EAAIqD,CAAI,EAC3B,OAAAmrB,EAAQ,MAAM,QAAQ,CACpB,KAAMnrB,EACN,IAAK+nB,CACX,CAAK,EACMA,CACX,EACE,OAAAoD,EAAQ,MAAQ,GACTA,CACT,CAQA,SAASD,GAAiBvuB,EAAI,CAC5B,OAAO,OAAO,KAAKA,EAAG,YAAc,CAAE,CAAA,EAAE,OAAO,SAAUqD,EAAMpD,EAAW,CACxE,IAAImX,GAASnX,EAAU,MAAM,IAAI,GAAK,CAAE,GAAE,OAAS,EACnD,OAAO,KAAK,IAAIoD,EAAM+T,CAAK,CAC/B,EAAK,EAAE,CACP,CCxGA,IAAI5gB,GAAyBY,GAC7B,OAAO,eAAewlB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC6BA,GAAA,uBAAG,OACjC,IAAIoS,GAAex4B,GAAuBuD,GAAA,CAAqC,EAC3EsB,GAAMC,GACNsc,GAAS7Z,GACT+W,GAAUhC,GACVb,GAAUqK,GACVxf,GAAUmyB,GACVla,GAAkBma,GAClB9S,GAAW+S,EACXb,GAAYc,GAChB,SAAS3U,GAA2BtjB,EAAGujB,EAAgB,CAAE,IAAIC,EAAK,OAAO,OAAW,KAAexjB,EAAE,OAAO,QAAQ,GAAKA,EAAE,YAAY,EAAG,GAAI,CAACwjB,EAAI,CAAE,GAAI,MAAM,QAAQxjB,CAAC,IAAMwjB,EAAKC,GAA4BzjB,CAAC,IAAMujB,GAAkBvjB,GAAK,OAAOA,EAAE,QAAW,SAAU,CAAMwjB,IAAIxjB,EAAIwjB,GAAI,IAAI9jB,EAAI,EAAOgkB,EAAI,UAAa,GAAI,MAAO,CAAE,EAAGA,EAAG,EAAG,UAAa,CAAE,OAAIhkB,GAAKM,EAAE,OAAe,CAAE,KAAM,EAAI,EAAW,CAAE,KAAM,GAAO,MAAOA,EAAEN,GAAG,EAAI,EAAI,EAAG,SAAWikB,EAAI,CAAE,MAAMA,CAAG,EAAI,EAAGD,CAAG,CAAG,CAAC,MAAM,IAAI,UAAU;AAAA,mFAAuI,CAAI,CAAC,IAAIE,EAAmB,GAAMC,EAAS,GAAOlX,EAAK,MAAO,CAAE,EAAG,UAAa,CAAE6W,EAAKA,EAAG,KAAKxjB,CAAC,CAAE,EAAI,EAAG,UAAa,CAAE,IAAI8jB,EAAON,EAAG,KAAM,EAAE,OAAAI,EAAmBE,EAAK,KAAaA,CAAO,EAAE,EAAG,SAAWC,EAAK,CAAEF,EAAS,GAAMlX,EAAMoX,CAAM,EAAE,EAAG,UAAa,CAAE,GAAI,CAAM,CAACH,GAAoBJ,EAAG,QAAa,MAAMA,EAAG,OAAS,CAAG,QAAW,CAAE,GAAIK,EAAQ,MAAMlX,CAAI,CAAI,CAAA,CAAK,CAC5+B,SAAS8W,GAA4BzjB,EAAGwe,EAAQ,CAAE,GAAKxe,EAAW,IAAI,OAAOA,GAAM,SAAU,OAAOgkB,GAAkBhkB,EAAGwe,CAAM,EAAG,IAAI,EAAI,OAAO,UAAU,SAAS,KAAKxe,CAAC,EAAE,MAAM,EAAG,EAAE,EAAgE,GAAzD,IAAM,UAAYA,EAAE,cAAa,EAAIA,EAAE,YAAY,MAAU,IAAM,OAAS,IAAM,MAAO,OAAO,MAAM,KAAKA,CAAC,EAAG,GAAI,IAAM,aAAe,2CAA2C,KAAK,CAAC,EAAG,OAAOgkB,GAAkBhkB,EAAGwe,CAAM,EAAI,CACha,SAASwF,GAAkB3O,EAAK3Q,EAAK,EAAMA,GAAO,MAAQA,EAAM2Q,EAAI,UAAQ3Q,EAAM2Q,EAAI,QAAQ,QAAS3V,EAAI,EAAGukB,EAAO,IAAI,MAAMvf,CAAG,EAAGhF,EAAIgF,EAAKhF,IAAOukB,EAAKvkB,CAAC,EAAI2V,EAAI3V,CAAC,EAAK,OAAOukB,CAAO,CACvL,IAAIxd,GAAO,cACPia,GAAe,CAAC,QAAQ,EACxBwX,MAA4CjT,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACpG,IAAIyP,EAASzP,EAAK,OAMlB,SAASG,EAAYwP,EAAMC,EAAU,CACnC,GAAI,EAAE,gBAAgBzP,GACpB,MAAM,IAAI,YAAY,kDAAkD,EAE1E,GAAIyP,GAAY,IAAKhxB,GAAI,UAAUgxB,CAAQ,EACzC,MAAM,IAAI,MAAM,qBAAuBA,CAAQ,EAEjD,MAAQhxB,GAAI,UAAU+wB,CAAI,EAEpBA,EAAK,OAAS,eAEhB,KAAK,SAAYtvB,GAAQ,OAAOsvB,EAAK,KAAK,EAC1C,KAAK,SAAYtvB,GAAQ,OAAOsvB,EAAK,KAAK,EAC1C,KAAK,UAAYC,GAAYD,EAAK,YAGlC,KAAK,MAAQA,EAAK,UAClB,KAAK,MAAQA,EAAK,OAClB,KAAK,UAAYC,GAAYD,EAAK,mBAE3BA,MAAY/wB,GAAI,SAAS+wB,EAAK,IAAI,MAAS/wB,GAAI,SAAS+wB,EAAK,IAAI,EAE1E,KAAK,MAAQA,EAAK,KAClB,KAAK,MAAQA,EAAK,QAEdxU,GAAO,UAAU,KAAK,MAAO,KAAK,KAAK,EAC3C,KAAK,UAAYyU,GAAYD,EAAK,oBACrB/wB,GAAI,SAAS+wB,CAAI,EAE9B,KAAK,MAAQkD,EAAWlD,CAAI,EAE5B,KAAK,SAAYxU,GAAO,WAAW,KAAK,KAAK,KAEzCA,GAAO,UAAU,KAAK,MAAO,KAAK,KAAK,EAE3C,KAAK,UAAYyU,MACZ,IAAID,EAET,MAAM,IAAI,UAAU,gCAAmC/wB,GAAI,QAAQ+wB,CAAI,EAAI,GAAG,EAG9E,KAAK,MAAQ,GACb,KAAK,MAAQ,CAAC,CAAC,EACf,KAAK,UAAYC,EAEpB,CACDzP,EAAY,UAAY,IAAIsP,EAK5BtP,EAAY,UAAU,kBAAoB,SAAUwP,EAAMC,EAAU,CAClE,OAAO,IAAIzP,EAAYwP,EAAMC,CAAQ,CACzC,EAKE,OAAO,eAAezP,EAAa,OAAQ,CACzC,MAAO,aACX,CAAG,EACDA,EAAY,UAAU,YAAcA,EACpCA,EAAY,UAAU,KAAO,cAC7BA,EAAY,UAAU,cAAgB,GAWtCA,EAAY,UAAU,YAAc,UAAY,CAC9C,SAAWhF,GAAO,kBAAkB,KAAK,MAAOvc,GAAI,MAAM,CAC9D,EAWEuhB,EAAY,UAAU,QAAU,UAAY,CAC1C,MAAO,OACX,EAWEA,EAAY,UAAU,SAAW,UAAY,CAC3C,OAAO,KAAK,SAChB,EAQEA,EAAY,UAAU,OAAS,SAAUwP,EAAMC,EAAU,CACvD,OAAO,IAAIzP,EAAYwP,EAAMC,CAAQ,CACzC,EAgBEzP,EAAY,UAAU,OAAS,SAAUtZ,EAAOgpB,EAAajX,EAAc,CACzE,OAAQ,UAAU,OAAM,CACtB,IAAK,GACH,OAAOka,EAAK,KAAMjsB,CAAK,EAGzB,IAAK,GACL,IAAK,GACH,OAAOksB,EAAK,KAAMlsB,EAAOgpB,EAAajX,CAAY,EACpD,QACE,MAAM,IAAI,YAAY,2BAA2B,CACpD,CACL,EAQEuH,EAAY,UAAU,IAAM,SAAUtZ,EAAO,CAC3C,GAAI,IAAKjI,GAAI,SAASiI,CAAK,EACzB,MAAM,IAAI,UAAU,gBAAgB,EAEtC,GAAIA,EAAM,SAAW,KAAK,MAAM,OAC9B,MAAM,IAAIyR,GAAgB,eAAezR,EAAM,OAAQ,KAAK,MAAM,MAAM,EAI1E,QAAStJ,EAAI,EAAGA,EAAIsJ,EAAM,OAAQtJ,OAC5B4d,GAAO,eAAetU,EAAMtJ,CAAC,EAAG,KAAK,MAAMA,CAAC,CAAC,EAGnD,QADIoyB,EAAO,KAAK,MACPv1B,EAAI,EAAG8Q,EAAKrE,EAAM,OAAQzM,EAAI8Q,EAAI9Q,IAAK,CAC9C,IAAI44B,EAASnsB,EAAMzM,CAAC,KAChB+gB,GAAO,eAAe6X,EAAQrD,EAAK,MAAM,EAC7CA,EAAOA,EAAKqD,CAAM,CACnB,CACD,OAAOrD,CACX,EAYExP,EAAY,UAAU,IAAM,SAAUtZ,EAAO9H,EAAO6Z,EAAc,CAChE,GAAI,IAAKha,GAAI,SAASiI,CAAK,EACzB,MAAM,IAAI,UAAU,gBAAgB,EAEtC,GAAIA,EAAM,OAAS,KAAK,MAAM,OAC5B,MAAM,IAAIyR,GAAgB,eAAezR,EAAM,OAAQ,KAAK,MAAM,OAAQ,GAAG,EAE/E,IAAIzM,EAAG8Q,EAAI8nB,EAGP/f,EAAOpM,EAAM,IAAI,SAAUzM,EAAG,CAChC,OAAOA,EAAI,CACjB,CAAK,EACD64B,EAAK,KAAMhgB,EAAM2F,CAAY,EAG7B,IAAI+W,EAAO,KAAK,MAChB,IAAKv1B,EAAI,EAAG8Q,EAAKrE,EAAM,OAAS,EAAGzM,EAAI8Q,EAAI9Q,IACzC44B,EAASnsB,EAAMzM,CAAC,KACZ+gB,GAAO,eAAe6X,EAAQrD,EAAK,MAAM,EAC7CA,EAAOA,EAAKqD,CAAM,EAIpB,OAAAA,EAASnsB,EAAMA,EAAM,OAAS,CAAC,KAC3BsU,GAAO,eAAe6X,EAAQrD,EAAK,MAAM,EAC7CA,EAAKqD,CAAM,EAAIj0B,EACR,IACX,EASE,SAAS+zB,EAAKpS,EAAQ7Z,EAAO,CAC3B,GAAI,IAAKjI,GAAI,SAASiI,CAAK,EACzB,MAAM,IAAI,UAAU,eAAe,EAErC,IAAI8R,EAAW9R,EAAM,WACrB,GAAI8R,EAEF,OAAO+H,EAAO,IAAI7Z,EAAM,IAAK,CAAA,EAG7B,IAAIoM,EAAOpM,EAAM,OACjB,GAAIoM,EAAK,SAAWyN,EAAO,MAAM,OAC/B,MAAM,IAAIpI,GAAgB,eAAerF,EAAK,OAAQyN,EAAO,MAAM,MAAM,EAM3E,QAFI1Y,EAAMnB,EAAM,MACZsQ,EAAMtQ,EAAM,MACPzM,EAAI,EAAG8Q,EAAKwV,EAAO,MAAM,OAAQtmB,EAAI8Q,EAAI9Q,OAC5C+gB,GAAO,eAAenT,EAAI5N,CAAC,EAAGsmB,EAAO,MAAMtmB,CAAC,CAAC,KAC7C+gB,GAAO,eAAehE,EAAI/c,CAAC,EAAGsmB,EAAO,MAAMtmB,CAAC,CAAC,EAKnD,OAAO,IAAI+lB,EAAY+S,EAAcxS,EAAO,MAAO7Z,EAAOoM,EAAK,OAAQ,CAAC,EAAGyN,EAAO,SAAS,CAE9F,CAaD,SAASwS,EAAcvD,EAAM9oB,EAAOqT,EAAMzB,EAAK,CAC7C,IAAIvS,EAAOuS,IAAQyB,EAAO,EACtBiZ,EAAQtsB,EAAM,UAAU4R,CAAG,EAC/B,OAAIvS,EACKitB,EAAM,IAAI,SAAU/4B,EAAG,CAC5B,SAAI+gB,GAAO,eAAe/gB,EAAGu1B,EAAK,MAAM,EACjCA,EAAKv1B,CAAC,CACrB,CAAO,EAAE,QAAO,EAEH+4B,EAAM,IAAI,SAAU/4B,EAAG,IACxB+gB,GAAO,eAAe/gB,EAAGu1B,EAAK,MAAM,EACxC,IAAI7vB,EAAQ6vB,EAAKv1B,CAAC,EAClB,OAAO84B,EAAcpzB,EAAO+G,EAAOqT,EAAMzB,EAAM,CAAC,CACxD,CAAO,EAAE,QAAO,CAEb,CAcD,SAASsa,EAAKrS,EAAQ7Z,EAAOusB,EAAWxa,EAAc,CACpD,GAAI,CAAC/R,GAASA,EAAM,UAAY,GAC9B,MAAM,IAAI,UAAU,eAAe,EAIrC,IAAIwsB,EAAQxsB,EAAM,OACd8R,EAAW9R,EAAM,WAGjBysB,EAOJ,MANQ10B,GAAI,UAAUw0B,CAAS,GAC7BE,EAAQF,EAAU,OAClBA,EAAYA,EAAU,WAEtBE,KAAYnY,GAAO,WAAWiY,CAAS,EAErCza,EAAU,CAIZ,GAAI2a,EAAM,SAAW,EACnB,MAAM,IAAI,UAAU,iBAAiB,EAEvC5S,EAAO,IAAI7Z,EAAM,IAAG,EAAIusB,EAAWxa,CAAY,CACrD,KAAW,CAIL,GAAIya,EAAM,OAAS3S,EAAO,MAAM,OAC9B,MAAM,IAAIpI,GAAgB,eAAe+a,EAAM,OAAQ3S,EAAO,MAAM,OAAQ,GAAG,EAEjF,GAAI4S,EAAM,OAASD,EAAM,OAAQ,CAI/B,QAFIj5B,EAAI,EACJigB,EAAQ,EACLgZ,EAAMj5B,CAAC,IAAM,GAAKk5B,EAAMl5B,CAAC,IAAM,GACpCA,IAEF,KAAOi5B,EAAMj5B,CAAC,IAAM,GAClBigB,IACAjgB,IAIFg5B,KAAgBjY,GAAO,WAAWiY,EAAWC,EAAM,OAAQhZ,EAAOiZ,CAAK,CACxE,CAGD,GAAI,IAAKjzB,GAAQ,iBAAiBgzB,EAAOC,CAAK,EAC5C,MAAM,IAAIhb,GAAgB,eAAe+a,EAAOC,EAAO,GAAG,EAI5D,IAAIrgB,EAAOpM,EAAM,IAAK,EAAC,IAAI,SAAUzM,EAAG,CACtC,OAAOA,EAAI,CACnB,CAAO,EACD64B,EAAKvS,EAAQzN,EAAM2F,CAAY,EAG/B,IAAIsB,EAAOmZ,EAAM,OACb5a,EAAM,EACV8a,EAAc7S,EAAO,MAAO7Z,EAAOusB,EAAWlZ,EAAMzB,CAAG,CACxD,CACD,OAAOiI,CACR,CAYD,SAAS6S,EAAc5D,EAAM9oB,EAAOusB,EAAWlZ,EAAMzB,EAAK,CACxD,IAAIvS,EAAOuS,IAAQyB,EAAO,EACtBiZ,EAAQtsB,EAAM,UAAU4R,CAAG,EAC3BvS,EACFitB,EAAM,QAAQ,SAAUK,EAAWC,EAAU,IACvCtY,GAAO,eAAeqY,CAAS,EACnC7D,EAAK6D,CAAS,EAAIJ,EAAUK,EAAS,CAAC,CAAC,CAC/C,CAAO,EAEDN,EAAM,QAAQ,SAAUK,EAAWC,EAAU,IACvCtY,GAAO,eAAeqY,CAAS,EACnCD,EAAc5D,EAAK6D,CAAS,EAAG3sB,EAAOusB,EAAUK,EAAS,CAAC,CAAC,EAAGvZ,EAAMzB,EAAM,CAAC,CACnF,CAAO,CAEJ,CAeD0H,EAAY,UAAU,OAAS,SAAUlN,EAAM2F,EAAc1Y,EAAM,CAEjE,GAAI,IAAKtB,GAAI,cAAcqU,CAAI,EAC7B,MAAM,IAAI,UAAU,0BAA0B,EAIhD,IAAIygB,EAAYzgB,EAAK,QAAS,EAAC,IAAI,SAAUlU,EAAO,CAClD,OAAO,MAAM,QAAQA,CAAK,GAAKA,EAAM,SAAW,EAAIA,EAAM,CAAC,EAAIA,CACrE,CAAK,EAGG2kB,EAAIxjB,EAAO,KAAK,MAAK,EAAK,KAE9B,OAAO4Y,EAAQ4K,EAAGgQ,EAAW9a,CAAY,CAC7C,EACE,SAASE,EAAQ4H,EAAQzN,EAAM2F,EAAc,CAE3C,GAAI3F,EAAK,SAAW,EAAG,CAIrB,QAFI+X,EAAItK,EAAO,SAEJ9hB,GAAI,SAASosB,CAAC,GACvBA,EAAIA,EAAE,CAAC,EAET,OAAOA,CACR,CAED,OAAAtK,EAAO,MAAQzN,EAAK,MAAM,CAAC,EAC3ByN,EAAO,SAAYvF,GAAO,QAAQuF,EAAO,MAAOA,EAAO,MAAO9H,CAAY,EAEnE8H,CACR,CAgBDP,EAAY,UAAU,QAAU,SAAUlN,EAAM/S,EAAM,CACpD,IAAIwjB,EAAIxjB,EAAO,KAAK,MAAK,EAAK,KAC9BwjB,EAAE,SAAYvI,GAAO,SAASuI,EAAE,MAAOzQ,CAAI,EAC3C,IAAIoG,EAAgBqK,EAAE,MAAM,OAAO,SAAUhP,EAAQzB,EAAM,CACzD,OAAOyB,EAASzB,CACtB,CAAK,EACD,OAAAyQ,EAAE,SAAYvI,GAAO,sBAAsBlI,EAAMoG,CAAa,EACvDqK,CACX,EAWE,SAASuP,EAAKvS,EAAQzN,EAAM2F,EAAc,CAOxC,QAJA+a,EAAUjT,EAAO,MAAM,MAAM,CAAC,EAC1BkT,EAAU,GAGPD,EAAQ,OAAS1gB,EAAK,QAC3B0gB,EAAQ,KAAK,CAAC,EACdC,EAAU,GAIZ,QAASx5B,EAAI,EAAG8Q,EAAK+H,EAAK,OAAQ7Y,EAAI8Q,EAAI9Q,IACpC6Y,EAAK7Y,CAAC,EAAIu5B,EAAQv5B,CAAC,IACrBu5B,EAAQv5B,CAAC,EAAI6Y,EAAK7Y,CAAC,EACnBw5B,EAAU,IAGVA,GAEF9a,EAAQ4H,EAAQiT,EAAS/a,CAAY,CAExC,CAODuH,EAAY,UAAU,MAAQ,UAAY,CACxC,IAAIuD,EAAI,IAAIvD,EAAY,CACtB,QAAU9f,GAAQ,OAAO,KAAK,KAAK,EACnC,QAAUA,GAAQ,OAAO,KAAK,KAAK,EACnC,SAAU,KAAK,SACrB,CAAK,EACD,OAAOqjB,CACX,EAOEvD,EAAY,UAAU,KAAO,UAAY,CACvC,OAAO,KAAK,MAAM,MAAM,CAAC,CAC7B,EAYEA,EAAY,UAAU,IAAM,SAAUnhB,EAAU,CAE9C,IAAI60B,EAAK,KACLjtB,KAAWirB,GAAU,kBAAkB7yB,CAAQ,EAC/C80B,EAAU,SAASA,EAAQ/0B,EAAO8H,EAAO,CAC3C,SAAQjI,GAAI,SAASG,CAAK,EACjBA,EAAM,IAAI,SAAUe,EAAO1F,EAAG,CACnC,OAAO05B,EAAQh0B,EAAO+G,EAAM,OAAOzM,CAAC,CAAC,CAC/C,CAAS,EAGGwM,IAAS,EACJ5H,EAASD,CAAK,EACZ6H,IAAS,EACX5H,EAASD,EAAO8H,CAAK,EAGrB7H,EAASD,EAAO8H,EAAOgtB,CAAE,CAG1C,EAIQlE,EAAOmE,EAAQ,KAAK,MAAO,CAAE,CAAA,EAC7BlE,EAAW,KAAK,YAAc,UAAgBzU,GAAO,kBAAkBwU,EAAM/wB,GAAI,MAAM,EAAI,OAC/F,OAAO,IAAIuhB,EAAYwP,EAAMC,CAAQ,CACzC,EASEzP,EAAY,UAAU,QAAU,SAAUnhB,EAAU,CAElD,IAAI60B,EAAK,KACLC,EAAU,SAASA,EAAQ/0B,EAAO8H,EAAO,IACnCjI,GAAI,SAASG,CAAK,EACxBA,EAAM,QAAQ,SAAUe,EAAO1F,EAAG,CAChC05B,EAAQh0B,EAAO+G,EAAM,OAAOzM,CAAC,CAAC,CACxC,CAAS,EAED4E,EAASD,EAAO8H,EAAOgtB,CAAE,CAEjC,EACIC,EAAQ,KAAK,MAAO,CAAA,CAAE,CAC1B,EAME3T,EAAY,UAAU,OAAO,QAAQ,EAAiBoS,GAAa,QAAW,KAAK,SAASwB,GAAU,CACpG,IAAID,EACJ,OAAOvB,GAAa,QAAW,KAAK,SAAkByB,EAAW,CAC/D,OACE,OAAQA,EAAU,KAAOA,EAAU,KAAI,CACrC,IAAK,GACH,OAAAF,EAAuBvB,GAAa,QAAW,KAAK,SAASuB,EAAQ/0B,EAAO8H,EAAO,CACjF,IAAIzM,EACJ,OAAOm4B,GAAa,QAAW,KAAK,SAAkB0B,EAAU,CAC9D,OACE,OAAQA,EAAS,KAAOA,EAAS,KAAI,CACnC,IAAK,GACH,GAAI,IAAKr1B,GAAI,SAASG,CAAK,EAAG,CAC5Bk1B,EAAS,KAAO,EAChB,KACD,CACD75B,EAAI,EACN,IAAK,GACH,GAAI,EAAEA,EAAI2E,EAAM,QAAS,CACvBk1B,EAAS,KAAO,EAChB,KACD,CACD,OAAOA,EAAS,cAAcH,EAAQ/0B,EAAM3E,CAAC,EAAGyM,EAAM,OAAOzM,CAAC,CAAC,EAAG,KAAM,CAAC,EAC3E,IAAK,GACHA,IACA65B,EAAS,KAAO,EAChB,MACF,IAAK,GACHA,EAAS,KAAO,GAChB,MACF,IAAK,GACH,OAAAA,EAAS,KAAO,GACT,CACL,MAAOl1B,EACP,MAAO8H,CAC/B,EACoB,IAAK,IACL,IAAK,MACH,OAAOotB,EAAS,MACnB,CAEJ,EAAEH,CAAO,CACxB,CAAa,EACME,EAAU,cAAcF,EAAQ,KAAK,MAAO,EAAE,EAAG,KAAM,CAAC,EACjE,IAAK,GACL,IAAK,MACH,OAAOE,EAAU,MACpB,CAET,EAAOD,EAAS,IAAI,CACpB,CAAG,EAMD5T,EAAY,UAAU,KAAO,UAAY,CACvC,IAAIvN,EAAS,CAAA,EACTxN,EAAI,KAAK,OACb,GAAIA,EAAE,SAAW,EACf,MAAM,IAAI,UAAU,4CAA4C,EAElE,IAAIuqB,EAAO,KAAK,MACZ7Q,EAAYd,GAA2B2R,CAAI,EAC7C5Q,EACF,GAAI,CACF,IAAKD,EAAU,EAAC,EAAI,EAAEC,EAAQD,EAAU,EAAG,GAAE,MAAO,CAClD,IAAIoV,EAAMnV,EAAM,MAChBnM,EAAO,KAAK,IAAIuN,EAAY,CAAC+T,CAAG,EAAG,KAAK,SAAS,CAAC,CACnD,CACF,OAAQ7sB,EAAK,CACZyX,EAAU,EAAEzX,CAAG,CACrB,QAAc,CACRyX,EAAU,EAAC,CACZ,CACD,OAAOlM,CACX,EAMEuN,EAAY,UAAU,QAAU,UAAY,CAC1C,IAAIgU,EAAQ,KACRvhB,EAAS,CAAA,EACTxN,EAAI,KAAK,OACb,GAAIA,EAAE,SAAW,EACf,MAAM,IAAI,UAAU,4CAA4C,EASlE,QAPIuqB,EAAO,KAAK,MACZyE,EAAQ,SAAeh6B,EAAG,CAC5B,IAAIi6B,EAAM1E,EAAK,IAAI,SAAUuE,EAAK,CAChC,MAAO,CAACA,EAAI95B,CAAC,CAAC,CACtB,CAAO,EACDwY,EAAO,KAAK,IAAIuN,EAAYkU,EAAKF,EAAM,SAAS,CAAC,CACvD,EACa/5B,EAAI,EAAGA,EAAIgL,EAAE,CAAC,EAAGhL,IACxBg6B,EAAMh6B,CAAC,EAET,OAAOwY,CACX,EAOEuN,EAAY,UAAU,QAAU,UAAY,CAC1C,SAAW9f,GAAQ,OAAO,KAAK,KAAK,CACxC,EAOE8f,EAAY,UAAU,QAAU,UAAY,CAC1C,OAAO,KAAK,KAChB,EAWEA,EAAY,UAAU,OAAS,SAAUxf,EAAS,CAChD,SAAW0X,GAAQ,QAAQ,KAAK,MAAO1X,CAAO,CAClD,EAOEwf,EAAY,UAAU,SAAW,UAAY,CAC3C,SAAW9H,GAAQ,QAAQ,KAAK,KAAK,CACzC,EAOE8H,EAAY,UAAU,OAAS,UAAY,CACzC,MAAO,CACL,OAAQ,cACR,KAAM,KAAK,MACX,KAAM,KAAK,MACX,SAAU,KAAK,SACrB,CACA,EAUEA,EAAY,UAAU,SAAW,SAAU0C,EAAG,CAE5C,GAAIA,GAMF,MAJQjkB,GAAI,aAAaikB,CAAC,IACxBA,EAAIA,EAAE,YAGJ,IAAKjkB,GAAI,UAAUikB,CAAC,GAAK,IAAKrN,GAAQ,WAAWqN,CAAC,EACpD,MAAM,IAAI,UAAU,2CAA2C,OAIjEA,EAAI,EAgBN,QAdIyR,EAASzR,EAAI,EAAIA,EAAI,EACrB0R,EAAO1R,EAAI,EAAI,CAACA,EAAI,EAGpB2R,EAAO,KAAK,MAAM,CAAC,EACnBC,EAAU,KAAK,MAAM,CAAC,EAGtB1hB,EAAI,KAAK,IAAIyhB,EAAOD,EAAME,EAAUH,CAAM,EAG1C3E,EAAO,CAAA,EAGFv1B,EAAI,EAAGA,EAAI2Y,EAAG3Y,IACrBu1B,EAAKv1B,CAAC,EAAI,KAAK,MAAMA,EAAIm6B,CAAI,EAAEn6B,EAAIk6B,CAAM,EAI3C,OAAO,IAAInU,EAAY,CACrB,KAAMwP,EACN,KAAM,CAAC5c,CAAC,EACR,SAAU,KAAK,SACrB,CAAK,CACL,EAcEoN,EAAY,SAAW,SAAUlN,EAAMlU,EAAO8jB,EAAGjK,EAAc,CAC7D,GAAI,IAAKha,GAAI,SAASqU,CAAI,EACxB,MAAM,IAAI,UAAU,gCAAgC,EAEtD,GAAIA,EAAK,SAAW,EAClB,MAAM,IAAI,MAAM,0CAA0C,EAkB5D,GAdAA,EAAOA,EAAK,IAAI,SAAU7N,EAAG,CAO3B,MALQxG,GAAI,aAAawG,CAAC,IAExBA,EAAIA,EAAE,YAGJ,IAAKxG,GAAI,UAAUwG,CAAC,GAAK,IAAKoQ,GAAQ,WAAWpQ,CAAC,GAAKA,EAAI,EAC7D,MAAM,IAAI,MAAM,uCAAuC,EAEzD,OAAOA,CACb,CAAK,EAGGyd,GAMF,MAJQjkB,GAAI,aAAaikB,CAAC,IACxBA,EAAIA,EAAE,YAGJ,IAAKjkB,GAAI,UAAUikB,CAAC,GAAK,IAAKrN,GAAQ,WAAWqN,CAAC,EACpD,MAAM,IAAI,UAAU,2CAA2C,OAIjEA,EAAI,EAEN,IAAIyR,EAASzR,EAAI,EAAIA,EAAI,EACrB0R,EAAO1R,EAAI,EAAI,CAACA,EAAI,EAGpB2R,EAAOvhB,EAAK,CAAC,EACbwhB,EAAUxhB,EAAK,CAAC,EAGhBF,EAAI,KAAK,IAAIyhB,EAAOD,EAAME,EAAUH,CAAM,EAG1C50B,EAGJ,MAAQd,GAAI,SAASG,CAAK,EAAG,CAE3B,GAAIA,EAAM,SAAWgU,EAEnB,MAAM,IAAI,MAAM,4BAA4B,EAG9CrT,EAAS,SAAgBtF,EAAG,CAE1B,OAAO2E,EAAM3E,CAAC,CACtB,CACK,YAAcwE,GAAI,UAAUG,CAAK,EAAG,CAEnC,IAAI21B,EAAK31B,EAAM,OAEf,GAAI21B,EAAG,SAAW,GAAKA,EAAG,CAAC,IAAM3hB,EAE/B,MAAM,IAAI,MAAM,uBAAuB,EAGzCrT,EAAS,SAAgBtF,EAAG,CAE1B,OAAO2E,EAAM,IAAI,CAAC3E,CAAC,CAAC,CAC5B,CACA,MAEMsF,EAAS,UAAkB,CAEzB,OAAOX,CACf,EAIS6Z,IAEHA,KAAmBha,GAAI,aAAac,EAAO,CAAC,CAAC,EAAIA,EAAO,CAAC,EAAE,IAAI,CAAC,EAC9D,GAIJ,IAAIiwB,EAAO,CAAA,EAGX,GAAI1c,EAAK,OAAS,EAAG,CAEnB0c,KAAWxU,GAAO,QAAQwU,EAAM1c,EAAM2F,CAAY,EAElD,QAAS2B,EAAI,EAAGA,EAAIxH,EAAGwH,IACrBoV,EAAKpV,EAAIga,CAAI,EAAEha,EAAI+Z,CAAM,EAAI50B,EAAO6a,CAAC,CAExC,CAGD,OAAO,IAAI4F,EAAY,CACrB,KAAMwP,EACN,KAAM,CAAC6E,EAAMC,CAAO,CAC1B,CAAK,CACL,EAUEtU,EAAY,SAAW,SAAUY,EAAM,CACrC,OAAO,IAAIZ,EAAYY,CAAI,CAC/B,EAWEZ,EAAY,UAAU,SAAW,SAAU/lB,EAAG2oB,EAAG,CAE/C,GAAI,IAAKnkB,GAAI,UAAUxE,CAAC,GAAK,IAAKob,GAAQ,WAAWpb,CAAC,GAAK,IAAKwE,GAAI,UAAUmkB,CAAC,GAAK,IAAKvN,GAAQ,WAAWuN,CAAC,EAC3G,MAAM,IAAI,MAAM,qCAAqC,EAGvD,GAAI,KAAK,MAAM,SAAW,EACxB,MAAM,IAAI,MAAM,0CAA0C,EAG5D,SAAI5H,GAAO,eAAe/gB,EAAG,KAAK,MAAM,CAAC,CAAC,KACtC+gB,GAAO,eAAe4H,EAAG,KAAK,MAAM,CAAC,CAAC,EAG1C5C,EAAY,UAAU/lB,EAAG2oB,EAAG,KAAK,KAAK,EAE/B,IACX,EASE5C,EAAY,UAAY,SAAU/lB,EAAG2oB,EAAG4M,EAAM,CAE5C,IAAIgF,EAAKhF,EAAKv1B,CAAC,EACfu1B,EAAKv1B,CAAC,EAAIu1B,EAAK5M,CAAC,EAChB4M,EAAK5M,CAAC,EAAI4R,CACd,EASE,SAAS9B,EAAWlD,EAAM,CACxB,QAASv1B,EAAI,EAAG8Q,EAAKykB,EAAK,OAAQv1B,EAAI8Q,EAAI9Q,IAAK,CAC7C,IAAI2e,EAAO4W,EAAKv1B,CAAC,KACTwE,GAAI,SAASma,CAAI,EACvB4W,EAAKv1B,CAAC,EAAIy4B,EAAW9Z,CAAI,EAChBA,GAAQA,EAAK,WAAa,KACnC4W,EAAKv1B,CAAC,EAAIy4B,EAAW9Z,EAAK,QAAS,CAAA,EAEtC,CACD,OAAO4W,CACR,CACD,OAAOxP,CACT,EAAG,CACD,QAAS,EACX,CAAC,EACDA,GAAA,uBAAiCyS,aCv+BjC,OAAO,eAAe/0B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIwC,GAAU1F,GACVglB,GAAWriB,EACX6D,GAAO,QACPia,GAAe,CAAC,OAAO,EACvBwZ,MAAiCjV,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MAmBjB,OAAO3d,EAAMlB,GAAM,CACjB,IAAKd,GAAQ,KACjB,CAAG,CACH,CAAC,EACDxC,GAAA,YAAsB+2B,yBChCtB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAGC,GAOlB,SAASA,GAAQC,EAAK,CACpB,IAAIC,EAAID,EAAI,OACRE,EAAIF,EAAI,CAAC,EAAE,OACX36B,EAAG2oB,EACHmS,EAAM,CAAA,EACV,IAAKnS,EAAI,EAAGA,EAAIkS,EAAGlS,IAAK,CACtB,IAAIoS,EAAM,CAAA,EACV,IAAK/6B,EAAI,EAAGA,EAAI46B,EAAG56B,IACjB+6B,EAAI,KAAKJ,EAAI36B,CAAC,EAAE2oB,CAAC,CAAC,EAEpBmS,EAAI,KAAKC,CAAG,CACb,CACD,OAAOD,CACT,CCvBA,OAAO,eAAeE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAGC,GACXD,GAAA,YAAGE,GACPF,GAAA,QAAGG,GACJH,GAAA,OAAGI,GACFJ,GAAA,QAAGK,GAClB,IAAI72B,GAAMjE,GACN4d,GAAcjb,GACd6d,GAAStc,GACT62B,GAAWp0B,GAOf,SAAS+zB,GAAoBp0B,EAAO,CAClC,QAAS7G,EAAI,EAAGA,EAAI6G,EAAM,OAAQ7G,IAChC,MAAQwE,GAAI,cAAcqC,EAAM7G,CAAC,CAAC,EAChC,MAAO,GAGX,MAAO,EACT,CASA,SAASk7B,GAAYr0B,EAAOjC,EAAU,IAC5BJ,GAAI,UAAUqC,CAAK,IACzBA,EAAQA,EAAM,WAEhB,QAAS7G,EAAI,EAAG8Q,EAAKjK,EAAM,OAAQ7G,EAAI8Q,EAAI9Q,IAAK,CAC9C,IAAI2E,EAAQkC,EAAM7G,CAAC,EACf,MAAM,QAAQ2E,CAAK,EACrBu2B,GAAYv2B,EAAOC,CAAQ,EAE3BA,EAASD,CAAK,CAEjB,CACH,CAcA,SAASw2B,GAAQt0B,EAAOjC,EAAU8wB,EAAW,CAC3C,OAAI7uB,GAAS,OAAOA,EAAM,KAAQ,WAEzBA,EAAM,IAAI,SAAU1D,EAAG,CAC5B,OAAOg4B,GAAQh4B,EAAGyB,CAAmB,CAC3C,CAAK,EAEMA,EAASiC,CAAK,CAEzB,CAWA,SAASu0B,GAAOT,EAAKtc,EAAKzZ,EAAU,CAClC,IAAIiU,EAAO,MAAM,QAAQ8hB,CAAG,KAAQ5Z,GAAO,WAAW4Z,CAAG,EAAIA,EAAI,KAAI,EACrE,GAAItc,EAAM,GAAKA,GAAOxF,EAAK,OAEzB,MAAM,IAAIsF,GAAY,WAAWE,EAAKxF,EAAK,MAAM,EAEnD,SAAQrU,GAAI,UAAUm2B,CAAG,EAChBA,EAAI,OAAOY,GAAQZ,EAAI,UAAWtc,EAAKzZ,CAAQ,CAAC,EAEhD22B,GAAQZ,EAAKtc,EAAKzZ,CAAQ,CAErC,CAUA,SAAS22B,GAAQZ,EAAKtc,EAAKzZ,EAAU,CACnC,IAAI5E,EAAG86B,EAAKU,EAAKC,EACjB,GAAIpd,GAAO,EACT,GAAK,MAAM,QAAQsc,EAAI,CAAC,CAAC,EAMlB,CAGL,IAFAc,KAAWH,GAAS,SAASX,CAAG,EAChCG,EAAM,CAAA,EACD96B,EAAI,EAAGA,EAAIy7B,EAAK,OAAQz7B,IAC3B86B,EAAI96B,CAAC,EAAIu7B,GAAQE,EAAKz7B,CAAC,EAAGqe,EAAM,EAAGzZ,CAAQ,EAE7C,OAAOk2B,CACR,KAb2B,CAE1B,IADAU,EAAMb,EAAI,CAAC,EACN36B,EAAI,EAAGA,EAAI26B,EAAI,OAAQ36B,IAC1Bw7B,EAAM52B,EAAS42B,EAAKb,EAAI36B,CAAC,CAAC,EAE5B,OAAOw7B,CACb,KAQS,CAEL,IADAV,EAAM,CAAA,EACD96B,EAAI,EAAGA,EAAI26B,EAAI,OAAQ36B,IAC1B86B,EAAI96B,CAAC,EAAIu7B,GAAQZ,EAAI36B,CAAC,EAAGqe,EAAM,EAAGzZ,CAAQ,EAE5C,OAAOk2B,CACR,CACH,CAGA,SAASO,GAAQx2B,EAAG8jB,EAAGiE,EAAGzpB,EAAG8sB,EAAGyL,EAAMC,EAAQvV,EAAGwV,EAASC,EAAQl3B,EAAO,CAEvE,IAAIm3B,EAAUj3B,EAAE,QACZk3B,EAASl3B,EAAE,OACXm3B,EAAOn3B,EAAE,KAGT4jB,EAAGwT,EAAIC,EAAIl8B,EAGf,GAAImD,EAEF,IAAK84B,EAAKD,EAAKrT,CAAC,EAAGuT,EAAKF,EAAKrT,EAAI,CAAC,EAAGF,EAAIwT,EAAIxT,EAAIyT,EAAIzT,IAEnDzoB,EAAI+7B,EAAOtT,CAAC,EAERmE,EAAE5sB,CAAC,IAAM07B,GAEX9O,EAAE5sB,CAAC,EAAI07B,EAEPC,EAAO,KAAK37B,CAAC,EAET67B,GAEF14B,EAAEnD,CAAC,EAAI47B,EAAUxV,EAAE0V,EAAQrT,CAAC,EAAG9jB,CAAK,EAAIyhB,EAAEzhB,EAAOm3B,EAAQrT,CAAC,CAAC,EAE3DwH,EAAEjwB,CAAC,EAAI07B,GAGPv4B,EAAEnD,CAAC,EAAI87B,EAAQrT,CAAC,IAIlBtlB,EAAEnD,CAAC,EAAI47B,EAAUxV,EAAE0V,EAAQrT,CAAC,EAAGtlB,EAAEnD,CAAC,CAAC,EAAIomB,EAAEjjB,EAAEnD,CAAC,EAAG87B,EAAQrT,CAAC,CAAC,EAEzDwH,EAAEjwB,CAAC,EAAI07B,OAKX,KAAKO,EAAKD,EAAKrT,CAAC,EAAGuT,EAAKF,EAAKrT,EAAI,CAAC,EAAGF,EAAIwT,EAAIxT,EAAIyT,EAAIzT,IAEnDzoB,EAAI+7B,EAAOtT,CAAC,EAERmE,EAAE5sB,CAAC,IAAM07B,GAEX9O,EAAE5sB,CAAC,EAAI07B,EAEPC,EAAO,KAAK37B,CAAC,GAGbiwB,EAAEjwB,CAAC,EAAI07B,CAIf,CCvLA,OAAO,eAAehkB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIykB,GAAc57B,GACd6a,GAAUlY,GACVqiB,GAAW9gB,EACXsC,GAAO,YACPia,GAAe,CAAC,OAAO,EACvBob,MAAqC7W,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC7F,IAAI3d,EAAQ2d,EAAK,MA8BjB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQqU,GAAQ,UAGhB,UAAW,SAAmBjY,EAAG,CAC/B,OAAOA,EAAE,OACV,EACD,SAAU,SAAkBA,EAAG,CAC7B,OAAOA,EAAE,IAAM,GAAK,SAASA,EAAE,CAAC,CACjC,EACD,iBAAkB8E,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,CAAI,CAC/C,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACDuF,GAAA,gBAA0B0kB,yBCzD1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAGC,GACHD,GAAA,UAAGE,GACFF,GAAA,WAAGG,GACHH,GAAA,WAAGI,GACDJ,GAAA,aAAGK,GACNL,GAAA,UAAGM,GACDN,GAAA,YAAGO,GACLP,GAAA,UAAGQ,GACHR,GAAA,UAAGS,GACDT,GAAA,YAAGU,GACHV,GAAA,YAAGW,GACJX,GAAA,WAAGY,GACJZ,GAAA,UAAGa,GACHb,GAAA,UAAGc,GACEd,GAAA,eAAGe,GACPf,GAAA,WAAGgB,GACAhB,GAAA,cAAGiB,GACPjB,GAAA,UAAGkB,GACDlB,GAAA,YAAGmB,GACJnB,GAAA,WAAGoB,GACHpB,GAAA,WAAGqB,GACDrB,GAAA,aAAGsB,GACDtB,GAAA,eAAGuB,GACDvB,GAAA,iBAAGwB,GACJxB,GAAA,gBAAGyB,GACRzB,GAAA,WAAG0B,GACrB,IAAI3iB,GAAU7a,GACVgsB,GAAK,SACLyR,GAAK,iBACT,SAAS1B,GAAUz3B,EAAG,CACpB,OAAO,KAAK,IAAIA,CAAC,CACnB,CACAy3B,GAAU,UAAY/P,GACtB,SAASgQ,GAAU13B,EAAGC,EAAG,CACvB,OAAOD,EAAIC,CACb,CACAy3B,GAAU,UAAYyB,GACtB,SAASJ,GAAe/4B,EAAGC,EAAG,CAC5B,OAAOD,EAAIC,CACb,CACA84B,GAAe,UAAYI,GAC3B,SAASZ,GAAev4B,EAAGC,EAAG,CAC5B,OAAOD,EAAIC,CACb,CACAs4B,GAAe,UAAYY,GAC3B,SAAStB,GAAa73B,EAAGC,EAAG,CAC1B,OAAOD,EAAIC,CACb,CACA43B,GAAa,UAAYsB,GACzB,SAASH,GAAiB16B,EAAG,CAC3B,MAAO,CAACA,CACV,CACA06B,GAAiB,UAAYtR,GAC7B,SAASuR,GAAgB36B,EAAG,CAC1B,OAAOA,CACT,CACA26B,GAAgB,UAAYvR,GAC5B,SAASiQ,GAAWr5B,EAAG,CACrB,SAAWiY,GAAQ,MAAMjY,CAAC,CAC5B,CACAq5B,GAAW,UAAYjQ,GACvB,SAASkQ,GAAWt5B,EAAG,CACrB,OAAOA,EAAIA,EAAIA,CACjB,CACAs5B,GAAW,UAAYlQ,GACvB,SAASoQ,GAAUx5B,EAAG,CACpB,OAAO,KAAK,IAAIA,CAAC,CACnB,CACAw5B,GAAU,UAAYpQ,GACtB,SAASqQ,GAAYz5B,EAAG,CACtB,SAAWiY,GAAQ,OAAOjY,CAAC,CAC7B,CACAy5B,GAAY,UAAYrQ,GAQxB,SAASsQ,GAAUh4B,EAAGC,EAAG,CACvB,GAAI,IAAKsW,GAAQ,WAAWvW,CAAC,GAAK,IAAKuW,GAAQ,WAAWtW,CAAC,EACzD,MAAM,IAAI,MAAM,oDAAoD,EAKtE,QADImd,EACGnd,IAAM,GACXmd,EAAIpd,EAAIC,EACRD,EAAIC,EACJA,EAAImd,EAEN,OAAOpd,EAAI,EAAI,CAACA,EAAIA,CACtB,CACAg4B,GAAU,UAAYmB,GAQtB,SAASlB,GAAUj4B,EAAGC,EAAG,CACvB,GAAI,IAAKsW,GAAQ,WAAWvW,CAAC,GAAK,IAAKuW,GAAQ,WAAWtW,CAAC,EACzD,MAAM,IAAI,MAAM,oDAAoD,EAEtE,GAAID,IAAM,GAAKC,IAAM,EACnB,MAAO,GAOT,QAFIxB,EACA0qB,EAAOnpB,EAAIC,EACRA,IAAM,GACXxB,EAAIwB,EACJA,EAAID,EAAIvB,EACRuB,EAAIvB,EAEN,OAAO,KAAK,IAAI0qB,EAAOnpB,CAAC,CAC1B,CACAi4B,GAAU,UAAYkB,GAQtB,SAASd,GAAU/5B,EAAGqX,EAAG,CACvB,OAAIA,EACK,KAAK,IAAIrX,CAAC,EAAI,KAAK,IAAIqX,CAAC,EAE1B,KAAK,IAAIrX,CAAC,CACnB,CAOA,SAAS45B,GAAY55B,EAAG,CACtB,SAAWiY,GAAQ,OAAOjY,CAAC,CAC7B,CACA45B,GAAY,UAAYxQ,GAOxB,SAAS0Q,GAAW95B,EAAG,CACrB,SAAWiY,GAAQ,MAAMjY,CAAC,CAC5B,CACA85B,GAAW,UAAY1Q,GAOvB,SAASyQ,GAAY75B,EAAG,CACtB,SAAWiY,GAAQ,OAAOjY,CAAC,CAC7B,CACA65B,GAAY,UAAYzQ,GASxB,SAAS4Q,GAAUh6B,EAAGqX,EAAG,CACvB,GAAIA,EAAI,EAIN,OAAOrX,EAAIqX,EAAI,KAAK,MAAMrX,EAAIqX,CAAC,EAC1B,GAAIA,IAAM,EACf,OAAOrX,EAIP,MAAM,IAAI,MAAM,6CAA6C,CAEjE,CACAg6B,GAAU,UAAYa,GAStB,SAASV,GAAcz4B,EAAG,CACxB,IAAI4tB,EAAO,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,EAC3EwL,EAAMxL,EAAO,EAIjB,GAHIwL,IACFxL,EAAO,CAACA,GAENA,IAAS,EACX,MAAM,IAAI,MAAM,uBAAuB,EAEzC,GAAI5tB,EAAI,GAAK,KAAK,IAAI4tB,CAAI,EAAI,IAAM,EAClC,MAAM,IAAI,MAAM,sCAAsC,EAIxD,GAAI5tB,IAAM,EACR,OAAOo5B,EAAM,IAAW,EAE1B,GAAI,CAAC,SAASp5B,CAAC,EACb,OAAOo5B,EAAM,EAAIp5B,EAEnB,IAAI1B,EAAI,KAAK,IAAI,KAAK,IAAI0B,CAAC,EAAG,EAAI4tB,CAAI,EAGtC,OAAAtvB,EAAI0B,EAAI,EAAI,CAAC1B,EAAIA,EACV86B,EAAM,EAAI96B,EAAIA,CAsBvB,CAEA,SAASs6B,GAAWt6B,EAAG,CACrB,SAAWiY,GAAQ,MAAMjY,CAAC,CAC5B,CACAs6B,GAAW,UAAYlR,GACvB,SAASmR,GAAWv6B,EAAG,CACrB,OAAO,KAAK,KAAKA,CAAC,CACpB,CACAu6B,GAAW,UAAYnR,GACvB,SAASoR,GAAax6B,EAAG,CACvB,OAAOA,EAAIA,CACb,CACAw6B,GAAa,UAAYpR,GASzB,SAASwR,GAAWl5B,EAAGC,EAAG,CAExB,IAAIxB,EACAioB,EACAtJ,EACA9e,EAAI,EACJ+6B,EAAQ,EACR1jB,EAAI,EACJ2jB,EAAQ,EACZ,GAAI,IAAK/iB,GAAQ,WAAWvW,CAAC,GAAK,IAAKuW,GAAQ,WAAWtW,CAAC,EACzD,MAAM,IAAI,MAAM,qDAAqD,EAEvE,KAAOA,GACLymB,EAAI,KAAK,MAAM1mB,EAAIC,CAAC,EACpBmd,EAAIpd,EAAI0mB,EAAIzmB,EACZxB,EAAIH,EACJA,EAAI+6B,EAAQ3S,EAAIpoB,EAChB+6B,EAAQ56B,EACRA,EAAIkX,EACJA,EAAI2jB,EAAQ5S,EAAI/Q,EAChB2jB,EAAQ76B,EACRuB,EAAIC,EACJA,EAAImd,EAEN,IAAIsS,EACJ,OAAI1vB,EAAI,EACN0vB,EAAM,CAAC,CAAC1vB,EAAG,CAACq5B,EAAO,CAACC,CAAK,EAEzB5J,EAAM,CAAC1vB,EAAGA,EAAIq5B,EAAQ,EAAGC,CAAK,EAEzB5J,CACT,CACAwJ,GAAW,UAAYC,GAQvB,SAAST,GAAUp6B,EAAGqX,EAAG,CAGvB,OAAIrX,EAAIA,EAAI,GAAKqX,IAAM,KAAYrX,EAAIA,EAAI,GAAKqX,IAAM,KAC7C,EAEF,KAAK,IAAIrX,EAAGqX,CAAC,CACtB,CACA+iB,GAAU,UAAYS,GAStB,SAASR,GAAY74B,EAAO,CAC1B,IAAIoV,EAAW,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,EACnF,GAAI,IAAKqB,GAAQ,WAAWrB,CAAQ,GAAKA,EAAW,GAAKA,EAAW,GAClE,MAAM,IAAI,MAAM,gFAAgF,EAElG,OAAO,cAAeqB,GAAQ,SAASzW,EAAOoV,CAAQ,CAAC,CACzD,CAOA,SAASsjB,GAAWl6B,EAAG,CACrB,OAAO,KAAK,IAAIA,CAAC,CACnB,CACAk6B,GAAW,UAAY9Q,aCpVvB,OAAO,eAAe6R,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAGC,GACHD,GAAA,aAAGE,GACJF,GAAA,YAAGG,GACFH,GAAA,aAAGI,GACAJ,GAAA,gBAAGK,GACGL,GAAA,sBAAGM,GACLN,GAAA,oBAAGO,GAC9B,IAAIvjB,GAAU7a,GACVgsB,GAAK,SACLyR,GAAK,iBACT,SAASK,GAAal7B,EAAGqX,EAAG,CAC1B,GAAI,IAAKY,GAAQ,WAAWjY,CAAC,GAAK,IAAKiY,GAAQ,WAAWZ,CAAC,EACzD,MAAM,IAAI,MAAM,sCAAsC,EAExD,OAAOrX,EAAIqX,CACb,CACA6jB,GAAa,UAAYL,GACzB,SAASM,GAAan7B,EAAG,CACvB,GAAI,IAAKiY,GAAQ,WAAWjY,CAAC,EAC3B,MAAM,IAAI,MAAM,qCAAqC,EAEvD,MAAO,CAACA,CACV,CACAm7B,GAAa,UAAY/R,GACzB,SAASgS,GAAYp7B,EAAGqX,EAAG,CACzB,GAAI,IAAKY,GAAQ,WAAWjY,CAAC,GAAK,IAAKiY,GAAQ,WAAWZ,CAAC,EACzD,MAAM,IAAI,MAAM,qCAAqC,EAEvD,OAAOrX,EAAIqX,CACb,CACA+jB,GAAY,UAAYP,GACxB,SAASQ,GAAar7B,EAAGqX,EAAG,CAC1B,GAAI,IAAKY,GAAQ,WAAWjY,CAAC,GAAK,IAAKiY,GAAQ,WAAWZ,CAAC,EACzD,MAAM,IAAI,MAAM,sCAAsC,EAExD,OAAOrX,EAAIqX,CACb,CACAgkB,GAAa,UAAYR,GACzB,SAASS,GAAgBt7B,EAAGqX,EAAG,CAC7B,GAAI,IAAKY,GAAQ,WAAWjY,CAAC,GAAK,IAAKiY,GAAQ,WAAWZ,CAAC,EACzD,MAAM,IAAI,MAAM,yCAAyC,EAE3D,OAAOrX,GAAKqX,CACd,CACAikB,GAAgB,UAAYT,GAC5B,SAASU,GAAsBv7B,EAAGqX,EAAG,CACnC,GAAI,IAAKY,GAAQ,WAAWjY,CAAC,GAAK,IAAKiY,GAAQ,WAAWZ,CAAC,EACzD,MAAM,IAAI,MAAM,+CAA+C,EAEjE,OAAOrX,GAAKqX,CACd,CACAkkB,GAAsB,UAAYV,GAClC,SAASW,GAAoBx7B,EAAGqX,EAAG,CACjC,GAAI,IAAKY,GAAQ,WAAWjY,CAAC,GAAK,IAAKiY,GAAQ,WAAWZ,CAAC,EACzD,MAAM,IAAI,MAAM,6CAA6C,EAE/D,OAAOrX,IAAMqX,CACf,CACAmkB,GAAoB,UAAYX,mBC7DhC,OAAO,eAAeY,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAGzf,GAKlB,SAASA,GAAQnf,EAAG2Y,EAAG,CACrB,GAAIA,EAAI3Y,EACN,MAAO,GAET,GAAI2Y,IAAM3Y,EACR,OAAO2Y,EAET,IAAIkmB,EAAOlmB,EAAI3Y,GAAK,EACpB,OAAOmf,GAAQnf,EAAG6+B,CAAI,EAAI1f,GAAQ0f,EAAO,EAAGlmB,CAAC,CAC/C,CCjBA,OAAO,eAAemmB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAGC,GAC7B,IAAI3jB,GAAU7a,GACVy+B,GAAW97B,GACf,SAAS67B,GAAmBpmB,EAAG8P,EAAG,CAChC,GAAI,IAAKrN,GAAQ,WAAWzC,CAAC,GAAKA,EAAI,EACpC,MAAM,IAAI,UAAU,0DAA0D,EAEhF,GAAI,IAAKyC,GAAQ,WAAWqN,CAAC,GAAKA,EAAI,EACpC,MAAM,IAAI,UAAU,0DAA0D,EAEhF,GAAIA,EAAI9P,EACN,MAAM,IAAI,UAAU,mCAAmC,EASzD,QAPIsmB,EAAUtmB,EAAI8P,EACdyW,EAAS,EACTC,EAAiB1W,EAAIwW,EAAUA,EAAU,EAAIxW,EAAI,EACjD2W,EAAc,EACdC,EAAc5W,EAAIwW,EAAUxW,EAAIwW,EAG3BK,EAAgBH,EAAgBG,GAAiB3mB,EAAG,EAAE2mB,EAE7D,IADAJ,GAAUI,EACHF,GAAeC,GAAeH,EAASE,IAAgB,GAC5DF,GAAUE,EACV,EAAEA,EAIN,OAAIA,GAAeC,IACjBH,MAAcF,GAAS,SAASI,EAAaC,CAAW,GAEnDH,CACT,CACAH,GAAmB,UAAY,2BCpC/B,OAAO,eAAeQ,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACUA,GAAA,UAAgBA,GAAA,IAAuBA,GAAA,EAAG,OACrD,IAAIpP,GAAK,KAAK,GACJoP,GAAA,GAAGpP,GACb,IAAIqP,GAAM,EAAI,KAAK,GACRD,GAAA,IAAGC,GACd,IAAIpmB,GAAI,KAAK,EACJmmB,GAAA,EAAGnmB,GACZ,IAAIoZ,GAAM,kBACV+M,GAAA,IAAc/M,aCXd,OAAO,eAAeiN,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAGC,GACHD,GAAA,UAAGE,GACJF,GAAA,SAAGG,GACFH,GAAA,UAAGI,GACpB,IAAItT,GAAK,SACLyR,GAAK,iBACT,SAAS2B,GAAUx8B,EAAG,CACpB,MAAO,CAACA,CACV,CACAw8B,GAAU,UAAYpT,GACtB,SAASqT,GAASz8B,EAAGqX,EAAG,CACtB,MAAO,CAAC,EAAErX,GAAKqX,EACjB,CACAolB,GAAS,UAAY5B,GACrB,SAAS6B,GAAU18B,EAAGqX,EAAG,CACvB,MAAO,CAAC,CAACrX,GAAM,CAAC,CAACqX,CACnB,CACAqlB,GAAU,UAAY7B,GACtB,SAAS0B,GAAUv8B,EAAGqX,EAAG,CACvB,MAAO,CAAC,EAAErX,GAAKqX,EACjB,CACAklB,GAAU,UAAY1B,mBCxBtB,OAAO,eAAe8B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACaA,GAAA,OAAG,OACEA,GAAA,YAAGC,GACtBD,GAAA,QAAiCA,GAAA,kBAAoB,OACjCA,GAAA,aAAGE,GACvBF,GAAA,UAAoBA,GAAA,aAAuB,OAC3C,IAAI1kB,GAAU7a,GACVy+B,GAAW97B,GAGf,SAAS68B,GAAYpnB,EAAG,CACtB,IAAIxV,EACJ,MAAQiY,GAAQ,WAAWzC,CAAC,EAC1B,OAAIA,GAAK,EACA,SAASA,CAAC,EAAI,IAAW,IAE9BA,EAAI,IACC,OAGEqmB,GAAS,SAAS,EAAGrmB,EAAI,CAAC,EAEvC,GAAIA,EAAI,GACN,OAAO,KAAK,IAAM,KAAK,IAAI,KAAK,GAAKA,CAAC,EAAIonB,GAAY,EAAIpnB,CAAC,GAE7D,GAAIA,GAAK,OACP,MAAO,KAGT,GAAIA,EAAI,GAAM,CAEZ,IAAIsnB,EAAOtnB,EAAIA,EACXunB,EAASD,EAAOtnB,EAChBwnB,EAAQD,EAASvnB,EACjBynB,EAAQD,EAAQxnB,EACpB,OAAO,KAAK,KAAK,EAAI,KAAK,GAAKA,CAAC,EAAI,KAAK,IAAIA,EAAI,KAAK,EAAGA,CAAC,GAAK,EAAI,GAAK,GAAKA,GAAK,GAAK,IAAMsnB,GAAQ,KAAO,MAAQC,GAAU,KAAO,QAAUC,GAAS,QAAU,UAAYC,GAAS,SAAW,YAAcA,EAAQznB,GACzN,CACD,EAAEA,EACFxV,EAAIk9B,GAAO,CAAC,EACZ,QAASrgC,EAAI,EAAGA,EAAIqgC,GAAO,OAAQ,EAAErgC,EACnCmD,GAAKk9B,GAAOrgC,CAAC,GAAK2Y,EAAI3Y,GAExB,IAAIsD,EAAIqV,EAAI2nB,GAAS,GACrB,OAAO,KAAK,KAAK,EAAI,KAAK,EAAE,EAAI,KAAK,IAAIh9B,EAAGqV,EAAI,EAAG,EAAI,KAAK,IAAI,CAACrV,CAAC,EAAIH,CACxE,CACA48B,GAAY,UAAY,SAIxB,IAAIO,GAAS,UACCR,GAAA,OAAGQ,GACjB,IAAID,GAAS,CAAC,kBAAwB,kBAAuB,mBAAwB,mBAAuB,mBAAyB,qBAA2B,qBAA2B,sBAA4B,qBAA2B,uBAA4B,sBAA2B,sBAA4B,qBAA2B,uBAA4B,qBAAyB,EAKvYP,GAAA,OAAGO,GACjB,IAAIE,GAAY,kBACCT,GAAA,UAAGS,GACpB,IAAIC,GAAU,EACCV,GAAA,QAAGU,GAClB,IAAIC,GAAU,EACCX,GAAA,QAAGW,GAClB,IAAIC,GAAe,CAAC,kBAAmB,kBAAmB,mBAAoB,kBAAmB,mBAAoB,oBAAuB,kBAAmB,EAC3IZ,GAAA,aAAGY,GACvB,SAASV,GAAarnB,EAAG,CACvB,GAAIA,EAAI,EAAG,MAAO,KAClB,GAAIA,IAAM,EAAG,MAAO,KACpB,GAAI,CAAC,SAASA,CAAC,EAAG,OAAOA,EACzB,GAAIA,EAAI,GAGN,OAAO,KAAK,IAAI,KAAK,GAAK,KAAK,IAAI,KAAK,GAAKA,CAAC,CAAC,EAAIqnB,GAAa,EAAIrnB,CAAC,EAKvEA,EAAIA,EAAI,EAKR,QAJIC,EAAOD,EAAI6nB,GAAU,GACrBjR,EAAMmR,GAAa,CAAC,EAGf1gC,EAAIygC,GAAU,EAAGzgC,GAAK,EAAGA,IAChCuvB,GAAOmR,GAAa1gC,CAAC,GAAK2Y,EAAI3Y,GAEhC,OAAOugC,IAAa5nB,EAAI,IAAO,KAAK,IAAIC,CAAI,EAAIA,EAAO,KAAK,IAAI2W,CAAG,CACrE,CACAyQ,GAAa,UAAY,mBCzFzB,OAAO,eAAeW,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAGC,GACFD,GAAA,YAAGE,GACJF,GAAA,WAAGG,GACFH,GAAA,YAAGI,GACJJ,GAAA,WAAGK,GACFL,GAAA,YAAGM,GACJN,GAAA,WAAGO,GACFP,GAAA,YAAGQ,GACJR,GAAA,WAAGS,GACFT,GAAA,YAAGU,GACHV,GAAA,YAAGW,GACJX,GAAA,WAAGY,GACFZ,GAAA,YAAGa,GACLb,GAAA,UAAGc,GACFd,GAAA,WAAGe,GACJf,GAAA,UAAGgB,GACFhB,GAAA,WAAGiB,GACJjB,GAAA,UAAGkB,GACFlB,GAAA,WAAGmB,GACJnB,GAAA,UAAGoB,GACFpB,GAAA,WAAGqB,GACJrB,GAAA,UAAGsB,GACFtB,GAAA,WAAGuB,GACJvB,GAAA,UAAGwB,GACFxB,GAAA,WAAGyB,GACrB,IAAIhnB,GAAU7a,GACVgsB,GAAK,SACLyR,GAAK,iBACT,SAAS4C,GAAWz9B,EAAG,CACrB,OAAO,KAAK,KAAKA,CAAC,CACpB,CACAy9B,GAAW,UAAYrU,GACvB,SAASsU,GAAY19B,EAAG,CACtB,SAAWiY,GAAQ,OAAOjY,CAAC,CAC7B,CACA09B,GAAY,UAAYtU,GACxB,SAASuU,GAAW39B,EAAG,CACrB,OAAO,KAAK,KAAK,EAAIA,CAAC,CACxB,CACA29B,GAAW,UAAYvU,GACvB,SAASwU,GAAY59B,EAAG,CACtB,OAAO,SAASA,CAAC,GAAK,KAAK,KAAKA,EAAI,GAAKA,CAAC,EAAI,KAAK,IAAIA,GAAKA,EAAI,EAAE,GAAK,EAAI,CAC7E,CACA49B,GAAY,UAAYxU,GACxB,SAASyU,GAAW79B,EAAG,CACrB,OAAO,KAAK,KAAK,EAAIA,CAAC,CACxB,CACA69B,GAAW,UAAYzU,GACvB,SAAS0U,GAAY99B,EAAG,CACtB,IAAIk/B,EAAO,EAAIl/B,EACf,OAAO,KAAK,IAAIk/B,EAAO,KAAK,KAAKA,EAAOA,EAAO,CAAC,CAAC,CACnD,CACApB,GAAY,UAAY1U,GACxB,SAAS2U,GAAW/9B,EAAG,CACrB,OAAO,KAAK,KAAK,EAAIA,CAAC,CACxB,CACA+9B,GAAW,UAAY3U,GACvB,SAAS4U,GAAYh+B,EAAG,CACtB,IAAIk/B,EAAO,EAAIl/B,EACX23B,EAAM,KAAK,KAAKuH,EAAOA,EAAO,CAAC,EACnC,OAAO,KAAK,IAAIvH,EAAMuH,CAAI,CAC5B,CACAlB,GAAY,UAAY5U,GACxB,SAAS6U,GAAWj+B,EAAG,CACrB,OAAO,KAAK,KAAKA,CAAC,CACpB,CACAi+B,GAAW,UAAY7U,GACvB,SAAS8U,GAAYl+B,EAAG,CACtB,SAAWiY,GAAQ,OAAOjY,CAAC,CAC7B,CACAk+B,GAAY,UAAY9U,GACxB,SAASgV,GAAWp+B,EAAG,CACrB,OAAO,KAAK,KAAKA,CAAC,CACpB,CACAo+B,GAAW,UAAYhV,GACvB,SAAS+U,GAAY9mB,EAAGrX,EAAG,CACzB,OAAO,KAAK,MAAMqX,EAAGrX,CAAC,CACxB,CACAm+B,GAAY,UAAYtD,GACxB,SAASwD,GAAYr+B,EAAG,CACtB,SAAWiY,GAAQ,OAAOjY,CAAC,CAC7B,CACAq+B,GAAY,UAAYjV,GACxB,SAASkV,GAAUt+B,EAAG,CACpB,OAAO,KAAK,IAAIA,CAAC,CACnB,CACAs+B,GAAU,UAAYlV,GACtB,SAASmV,GAAWv+B,EAAG,CACrB,SAAWiY,GAAQ,MAAMjY,CAAC,CAC5B,CACAu+B,GAAW,UAAYnV,GACvB,SAASoV,GAAUx+B,EAAG,CACpB,MAAO,GAAI,KAAK,IAAIA,CAAC,CACvB,CACAw+B,GAAU,UAAYpV,GACtB,SAASqV,GAAWz+B,EAAG,CACrB,IAAIiW,EAAI,KAAK,IAAI,EAAIjW,CAAC,EACtB,OAAQiW,EAAI,IAAMA,EAAI,EACxB,CACAwoB,GAAW,UAAYrV,GACvB,SAASsV,GAAU1+B,EAAG,CACpB,MAAO,GAAI,KAAK,IAAIA,CAAC,CACvB,CACA0+B,GAAU,UAAYtV,GACtB,SAASuV,GAAW3+B,EAAG,CAErB,OAAIA,IAAM,EACD,OAAO,kBAEP,KAAK,IAAI,GAAK,KAAK,IAAIA,CAAC,EAAI,KAAK,IAAI,CAACA,CAAC,EAAE,KAAQiY,GAAQ,MAAMjY,CAAC,CAE3E,CACA2+B,GAAW,UAAYvV,GACvB,SAASwV,GAAU5+B,EAAG,CACpB,MAAO,GAAI,KAAK,IAAIA,CAAC,CACvB,CACA4+B,GAAU,UAAYxV,GACtB,SAASyV,GAAW7+B,EAAG,CACrB,MAAO,IAAK,KAAK,IAAIA,CAAC,EAAI,KAAK,IAAI,CAACA,CAAC,EACvC,CACA6+B,GAAW,UAAYzV,GACvB,SAAS0V,GAAU9+B,EAAG,CACpB,OAAO,KAAK,IAAIA,CAAC,CACnB,CACA8+B,GAAU,UAAY1V,GACtB,SAAS2V,GAAW/+B,EAAG,CACrB,SAAWiY,GAAQ,MAAMjY,CAAC,CAC5B,CACA++B,GAAW,UAAY3V,GACvB,SAAS4V,GAAUh/B,EAAG,CACpB,OAAO,KAAK,IAAIA,CAAC,CACnB,CACAg/B,GAAU,UAAY5V,GACtB,SAAS6V,GAAWj/B,EAAG,CACrB,SAAWiY,GAAQ,MAAMjY,CAAC,CAC5B,CACAi/B,GAAW,UAAY7V,aC3IvB,OAAO,eAAe+V,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAGC,GACPD,GAAA,YAAGE,GACEF,GAAA,iBAAGG,GACHH,GAAA,iBAAGI,GACPJ,GAAA,aAAGK,GACvB,IAAIvnB,GAAU7a,GACVgsB,GAAK,SACT,SAASgW,GAAgBp/B,EAAG,CAC1B,SAAWiY,GAAQ,WAAWjY,CAAC,CACjC,CACAo/B,GAAgB,UAAYhW,GAC5B,SAASkW,GAAiBt/B,EAAG,CAC3B,OAAOA,EAAI,CACb,CACAs/B,GAAiB,UAAYlW,GAC7B,SAASmW,GAAiBv/B,EAAG,CAC3B,OAAOA,EAAI,CACb,CACAu/B,GAAiB,UAAYnW,GAC7B,SAASoW,GAAax/B,EAAG,CACvB,OAAOA,IAAM,CACf,CACAw/B,GAAa,UAAYpW,GACzB,SAASiW,GAAYr/B,EAAG,CACtB,OAAO,OAAO,MAAMA,CAAC,CACvB,CACAq/B,GAAY,UAAYjW,gBC7BxB,OAAO,eAAwBoI,EAAA,aAAc,CAC3C,MAAO,EACT,CAAC,EACD,IAAIiO,EAAcriC,GAClB,OAAO,KAAKqiC,CAAW,EAAE,QAAQ,SAAU1iC,EAAK,CAC1CA,IAAQ,WAAaA,IAAQ,cAC7BA,KAAOy0B,GAAWA,EAAQz0B,CAAG,IAAM0iC,EAAY1iC,CAAG,GACtD,OAAO,eAAey0B,EAASz0B,EAAK,CAClC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0iC,EAAY1iC,CAAG,CACvB,CACL,CAAG,CACH,CAAC,EACD,IAAI2iC,EAAW3/B,GACf,OAAO,KAAK2/B,CAAQ,EAAE,QAAQ,SAAU3iC,EAAK,CACvCA,IAAQ,WAAaA,IAAQ,cAC7BA,KAAOy0B,GAAWA,EAAQz0B,CAAG,IAAM2iC,EAAS3iC,CAAG,GACnD,OAAO,eAAey0B,EAASz0B,EAAK,CAClC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2iC,EAAS3iC,CAAG,CACpB,CACL,CAAG,CACH,CAAC,EACD,IAAI4iC,EAAgBr+B,GACpB,OAAO,KAAKq+B,CAAa,EAAE,QAAQ,SAAU5iC,EAAK,CAC5CA,IAAQ,WAAaA,IAAQ,cAC7BA,KAAOy0B,GAAWA,EAAQz0B,CAAG,IAAM4iC,EAAc5iC,CAAG,GACxD,OAAO,eAAey0B,EAASz0B,EAAK,CAClC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4iC,EAAc5iC,CAAG,CACzB,CACL,CAAG,CACH,CAAC,EACD,IAAI6iC,EAAa77B,GACjB,OAAO,KAAK67B,CAAU,EAAE,QAAQ,SAAU7iC,EAAK,CACzCA,IAAQ,WAAaA,IAAQ,cAC7BA,KAAOy0B,GAAWA,EAAQz0B,CAAG,IAAM6iC,EAAW7iC,CAAG,GACrD,OAAO,eAAey0B,EAASz0B,EAAK,CAClC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6iC,EAAW7iC,CAAG,CACtB,CACL,CAAG,CACH,CAAC,EACD,IAAI8iC,EAAW/mB,GACf,OAAO,KAAK+mB,CAAQ,EAAE,QAAQ,SAAU9iC,EAAK,CACvCA,IAAQ,WAAaA,IAAQ,cAC7BA,KAAOy0B,GAAWA,EAAQz0B,CAAG,IAAM8iC,EAAS9iC,CAAG,GACnD,OAAO,eAAey0B,EAASz0B,EAAK,CAClC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8iC,EAAS9iC,CAAG,CACpB,CACL,CAAG,CACH,CAAC,EACD,IAAI+iC,EAAcxd,GAClB,OAAO,KAAKwd,CAAW,EAAE,QAAQ,SAAU/iC,EAAK,CAC1CA,IAAQ,WAAaA,IAAQ,cAC7BA,KAAOy0B,GAAWA,EAAQz0B,CAAG,IAAM+iC,EAAY/iC,CAAG,GACtD,OAAO,eAAey0B,EAASz0B,EAAK,CAClC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+iC,EAAY/iC,CAAG,CACvB,CACL,CAAG,CACH,CAAC,EACD,IAAIgjC,EAAe9K,GACnB,OAAO,KAAK8K,CAAY,EAAE,QAAQ,SAAUhjC,EAAK,CAC3CA,IAAQ,WAAaA,IAAQ,cAC7BA,KAAOy0B,GAAWA,EAAQz0B,CAAG,IAAMgjC,EAAahjC,CAAG,GACvD,OAAO,eAAey0B,EAASz0B,EAAK,CAClC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgjC,EAAahjC,CAAG,CACxB,CACL,CAAG,CACH,CAAC,EACD,IAAIijC,EAAgB9K,GACpB,OAAO,KAAK8K,CAAa,EAAE,QAAQ,SAAUjjC,EAAK,CAC5CA,IAAQ,WAAaA,IAAQ,cAC7BA,KAAOy0B,GAAWA,EAAQz0B,CAAG,IAAMijC,EAAcjjC,CAAG,GACxD,OAAO,eAAey0B,EAASz0B,EAAK,CAClC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOijC,EAAcjjC,CAAG,CACzB,CACL,CAAG,CACH,CAAC,EACD,IAAIkjC,EAAS9K,GACb,OAAO,KAAK8K,CAAM,EAAE,QAAQ,SAAUljC,EAAK,CACrCA,IAAQ,WAAaA,IAAQ,cAC7BA,KAAOy0B,GAAWA,EAAQz0B,CAAG,IAAMkjC,EAAOljC,CAAG,GACjD,OAAO,eAAey0B,EAASz0B,EAAK,CAClC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkjC,EAAOljC,CAAG,CAClB,CACL,CAAG,CACH,CAAC,QCrGD,OAAO,eAAemjC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIlH,GAAc57B,GACdglB,GAAWriB,EACXogC,GAAS7+B,GACTsC,GAAO,aACPia,GAAe,CAAC,OAAO,EACvBuiB,MAAsChe,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC9F,IAAI3d,EAAQ2d,EAAK,MA8BjB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQu8B,GAAO,iBACf,UAAW,SAAmBngC,EAAG,CAC/B,OAAOA,EAAE,MAAK,GAAM,CAACA,EAAE,UAAY,CAACA,EAAE,OACvC,EACD,SAAU,SAAkBA,EAAG,CAC7B,OAAOA,EAAE,EAAI,CACd,EAED,KAAM8E,EAAM,YAAY,SAAUkK,EAAM,CACtC,OAAO,SAAUhP,EAAG,CAClB,OAAO8E,EAAM,KAAKkK,EAAMhP,EAAE,WAAW,EAAEA,EAAE,KAAK,CACtD,CACA,CAAK,EACD,iBAAkB8E,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,CAAI,CAC/C,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACDkxB,GAAA,iBAA2BE,aC7D3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIrH,GAAc57B,GACdglB,GAAWriB,EACX6D,GAAO,YACPia,GAAe,CAAC,OAAO,EACvByiB,MAAqCle,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC7F,IAAI3d,EAAQ2d,EAAK,MA8BjB,OAAO3d,EAAMlB,GAAM,CACjB,0CAA2C,UAA0C,CACnF,MAAO,EACR,EACD,oDAAqD,UAA8C,CACjG,MAAO,EACR,EACD,iBAAkBkB,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,CAAI,CAC/C,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACDqxB,GAAA,gBAA0BC,aCrD1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIne,GAAWhlB,EACXwG,GAAO,kBACPia,GAAe,CAAC,QAAS,WAAW,EACpC2iB,MAA2Cpe,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACnG,IAAI3d,EAAQ2d,EAAK,MACf4d,EAAY5d,EAAK,UA+BnB,OAAO3d,EAAMlB,GAAM,CACjB,QAAW,UAAmB,CAC5B,MAAO,EACR,EACD,OAAQ,SAAgB5D,EAAG,CACzB,OAAOA,EAAE,KAAM,EAAC,OAAS,GAAK,CAAC,MAAM,OAAOA,CAAC,CAAC,CAC/C,EACD,IAAK,SAAaA,EAAG,CACnB,OAAOqgC,EAAUrgC,CAAC,CACnB,CACL,CAAG,CACH,CAAC,EACDugC,GAAA,sBAAgCC,aCpDhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIzH,GAAc57B,GACdglB,GAAWriB,EACXogC,GAAS7+B,GACTsC,GAAO,aACPia,GAAe,CAAC,OAAO,EACvB6iB,MAAsCte,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC9F,IAAI3d,EAAQ2d,EAAK,MAgCjB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQu8B,GAAO,iBACf,UAAW,SAAmBngC,EAAG,CAC/B,MAAO,CAACA,EAAE,MAAK,GAAM,CAACA,EAAE,UAAY,CAACA,EAAE,OACxC,EACD,SAAU,SAAkBA,EAAG,CAC7B,OAAOA,EAAE,EAAI,GAAKA,EAAE,EAAI,CACzB,EACD,KAAM8E,EAAM,YAAY,SAAUkK,EAAM,CACtC,OAAO,SAAUhP,EAAG,CAClB,OAAO8E,EAAM,KAAKkK,EAAMhP,EAAE,WAAW,EAAEA,EAAE,KAAK,CACtD,CACA,CAAK,EACD,iBAAkB8E,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,CAAI,CAC/C,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACDyxB,GAAA,iBAA2BC,aC9D3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAI3H,GAAc57B,GACdglB,GAAWriB,EACXogC,GAAS7+B,GACTsC,GAAO,SACPia,GAAe,CAAC,OAAO,EACvB+iB,MAAkCxe,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC1F,IAAI3d,EAAQ2d,EAAK,MAkCjB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQu8B,GAAO,aACf,UAAW,SAAmBngC,EAAG,CAC/B,OAAOA,EAAE,QACV,EACD,QAAS,SAAiBA,EAAG,CAC3B,OAAOA,EAAE,KAAO,GAAKA,EAAE,KAAO,CAC/B,EACD,SAAU,SAAkBA,EAAG,CAC7B,OAAOA,EAAE,IAAM,GAAKA,EAAE,IAAM,CAC7B,EACD,KAAM8E,EAAM,YAAY,SAAUkK,EAAM,CACtC,OAAO,SAAUhP,EAAG,CAClB,OAAO8E,EAAM,KAAKkK,EAAMhP,EAAE,WAAW,EAAEA,EAAE,KAAK,CACtD,CACA,CAAK,EACD,iBAAkB8E,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,CAAI,CAC/C,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACD2xB,GAAA,aAAuBC,aCnEvB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAI7H,GAAc57B,GACdglB,GAAWriB,EACXogC,GAAS7+B,GACTsC,GAAO,QACPia,GAAe,CAAC,OAAO,EACvBijB,MAAiC1e,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MA8BjB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQu8B,GAAO,YACf,UAAW,SAAmBngC,EAAG,CAC/B,OAAOA,EAAE,OACV,EACD,SAAU,SAAkBA,EAAG,CAC7B,MAAO,EACR,EACD,QAAS,SAAiBA,EAAG,CAC3B,OAAOA,EAAE,OACV,EACD,KAAM,SAAcA,EAAG,CACrB,OAAO,OAAO,MAAMA,EAAE,KAAK,CAC5B,EACD,iBAAkB,SAAqBA,EAAG,CACxC,SAAWg5B,GAAY,SAASh5B,EAAG,OAAO,KAAK,CAChD,CACL,CAAG,CACH,CAAC,EACD6gC,GAAA,YAAsBC,aC3DtB,OAAO,eAAejhC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAIuiB,GAAWhlB,EACXiE,GAAMtB,GACN6D,GAAO,SACPia,GAAe,CAAC,OAAO,EACvBkjB,MAAkC3e,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC1F,IAAI3d,EAAQ2d,EAAK,MAqDjB,OAAO3d,EAAMlB,GAAM,CACjB,IAAKvC,GAAI,MACb,CAAG,CACH,CAAC,EACDxB,GAAA,aAAuBkhC,mBClEvB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAGxsB,GAUtB,SAASA,GAAYxU,EAAGqX,EAAGC,EAAS,CAElC,GAAIA,GAAY,KACd,OAAOtX,EAAE,GAAGqX,CAAC,EAIf,GAAIrX,EAAE,GAAGqX,CAAC,EACR,MAAO,GAIT,GAAIrX,EAAE,MAAK,GAAMqX,EAAE,MAAK,EACtB,MAAO,GAIT,GAAIrX,EAAE,SAAQ,GAAMqX,EAAE,SAAQ,EAAI,CAEhC,IAAIE,EAAOvX,EAAE,MAAMqX,CAAC,EAAE,IAAG,EACzB,GAAIE,EAAK,SACP,MAAO,GAGP,IAAIqC,EAAM5Z,EAAE,YAAY,IAAIA,EAAE,MAAOqX,EAAE,IAAG,CAAE,EAC5C,OAAOE,EAAK,IAAIqC,EAAI,MAAMtC,CAAO,CAAC,CAErC,CAGD,MAAO,EACT,WC5CA,OAAO,eAAe2pB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAGC,GACxB,IAAIjpB,GAAU7a,GASd,SAAS8jC,GAAclhC,EAAGqX,EAAGC,EAAS,CACpC,SAAWW,GAAQ,aAAajY,EAAE,GAAIqX,EAAE,GAAIC,CAAO,MAASW,GAAQ,aAAajY,EAAE,GAAIqX,EAAE,GAAIC,CAAO,CACtG,WCfA,OAAO,eAAe6pB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAI/e,GAAWhlB,EACXgkC,MAAwChf,GAAS,SAAS,eAAgB,CAAC,OAAO,EAAG,SAAUK,EAAM,CACvG,IAAI3d,EAAQ2d,EAAK,MACjB,MAAO,CACL,aAAc3d,EAAM,YAAY,SAAUkK,EAAM,CAC9C,OAAO,SAAUhP,EAAGqX,EAAG,CACrB,GAAI,CAACrX,EAAE,UAAUqX,CAAC,EAChB,MAAM,IAAI,MAAM,0CAA0C,EAE5D,OAAOvS,EAAM,KAAKkK,EAAM,CAAChP,EAAE,UAAS,EAAIqX,EAAE,UAAW,CAAA,CAAC,EAAErX,EAAE,MAAOqX,EAAE,KAAK,CAChF,CACA,CAAK,CACL,CACA,CAAC,EACD8pB,GAAA,mBAA6BC,GClB7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACDA,GAAA,wBAAkCA,GAAA,kBAA4B,OAC9D,IAAIC,GAAelkC,GACf6a,GAAUlY,GACVqiB,GAAW9gB,EACXytB,GAAWhrB,GACXw9B,GAAgBzoB,GAChBlV,GAAO,cACPia,GAAe,CAAC,QAAS,QAAQ,EACjC2jB,MAAuCpf,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC/F,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACZ0e,KAAmBI,GAAc,oBAAoB,CACvD,MAAOz8B,CACX,CAAG,EAUD,OAAOA,EAAMlB,GAAM,CACjB,mBAAoB,SAAwB5D,EAAGqX,EAAG,CAChD,OAAOrX,IAAMqX,CACd,EACD,iBAAkB,SAAsBrX,EAAGqX,EAAG,CAC5C,SAAWY,GAAQ,aAAajY,EAAGqX,EAAGra,EAAO,OAAO,CACrD,EACD,uBAAwB,SAA4BgD,EAAGqX,EAAG,CACxD,OAAOrX,EAAE,GAAGqX,CAAC,MAASiqB,GAAa,aAAathC,EAAGqX,EAAGra,EAAO,OAAO,CACrE,EACD,qBAAsB,SAA0BgD,EAAGqX,EAAG,CACpD,OAAOrX,EAAE,OAAOqX,CAAC,CAClB,EACD,mBAAoB,SAAwBrX,EAAGqX,EAAG,CAChD,SAAW0X,GAAS,eAAe/uB,EAAGqX,EAAGra,EAAO,OAAO,CACxD,CACF,EAAEmkC,CAAY,CACjB,CAAC,EACwBE,GAAA,kBAAGG,GAC5B,IAAIC,MAA8Brf,GAAS,SAASxe,GAAM,CAAC,QAAS,QAAQ,EAAG,SAAU89B,EAAO,CAC9F,IAAI58B,EAAQ48B,EAAM,MAChB1kC,EAAS0kC,EAAM,OACjB,OAAO58B,EAAMlB,GAAM,CACjB,iBAAkB,SAAsB5D,EAAGqX,EAAG,CAC5C,SAAWY,GAAQ,aAAajY,EAAGqX,EAAGra,EAAO,OAAO,CACrD,CACL,CAAG,CACH,CAAC,EACDqkC,GAAA,wBAAkCI,aCtD9BjlC,GAAyBY,GAC7B,OAAO,eAAeukC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC8BA,GAAA,wBAAG,OAClC,IAAI3M,GAAex4B,GAAuBuD,GAAA,CAAqC,EAC3EsB,GAAMC,GACN2W,GAAUlU,GACV+W,GAAUhC,GACVhW,GAAUwf,GACV1E,GAASqX,GACT7S,GAAW8S,EACXna,GAAkBoa,GAClBb,GAAYc,GACZxxB,GAAO,eACPia,GAAe,CAAC,QAAS,cAAe,QAAQ,EAChD+jB,MAA6Cxf,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACrG,IAAI3d,EAAQ2d,EAAK,MACf4e,EAAc5e,EAAK,YACnByP,EAASzP,EAAK,OAOhB,SAASkf,EAAavP,EAAMC,EAAU,CACpC,GAAI,EAAE,gBAAgBsP,GACpB,MAAM,IAAI,YAAY,kDAAkD,EAE1E,GAAItP,GAAY,IAAKhxB,GAAI,UAAUgxB,CAAQ,EACzC,MAAM,IAAI,MAAM,qBAAuBA,CAAQ,EAEjD,MAAQhxB,GAAI,UAAU+wB,CAAI,EAExByP,EAAkB,KAAMzP,EAAMC,CAAQ,UAC7BD,MAAY/wB,GAAI,SAAS+wB,EAAK,KAAK,MAAS/wB,GAAI,SAAS+wB,EAAK,GAAG,MAAS/wB,GAAI,SAAS+wB,EAAK,IAAI,EAEzG,KAAK,QAAUA,EAAK,OACpB,KAAK,OAASA,EAAK,MACnB,KAAK,KAAOA,EAAK,IACjB,KAAK,MAAQA,EAAK,KAClB,KAAK,UAAYC,GAAYD,EAAK,oBACrB/wB,GAAI,SAAS+wB,CAAI,EAE9B0P,EAAiB,KAAM1P,EAAMC,CAAQ,MAChC,IAAID,EAET,MAAM,IAAI,UAAU,gCAAmC/wB,GAAI,QAAQ+wB,CAAI,EAAI,GAAG,EAG9E,KAAK,QAAU,GACf,KAAK,OAAS,GACd,KAAK,KAAO,CAAC,CAAC,EACd,KAAK,MAAQ,CAAC,EAAG,CAAC,EAClB,KAAK,UAAYC,EAEpB,CACD,SAASwP,EAAkB1e,EAAQrmB,EAAQu1B,EAAU,CAE/Cv1B,EAAO,OAAS,gBAElBqmB,EAAO,QAAUrmB,EAAO,WAAcgG,GAAQ,OAAOhG,EAAO,OAAO,EAAI,OACvEqmB,EAAO,UAAargB,GAAQ,OAAOhG,EAAO,MAAM,EAChDqmB,EAAO,QAAWrgB,GAAQ,OAAOhG,EAAO,IAAI,EAC5CqmB,EAAO,SAAYrgB,GAAQ,OAAOhG,EAAO,KAAK,EAC9CqmB,EAAO,UAAYkP,GAAYv1B,EAAO,WAGtCglC,EAAiB3e,EAAQrmB,EAAO,QAAS,EAAEu1B,GAAYv1B,EAAO,SAAS,CAE1E,CACD,SAASglC,EAAiB3e,EAAQiP,EAAMC,EAAU,CAEhDlP,EAAO,QAAU,GACjBA,EAAO,OAAS,GAChBA,EAAO,KAAO,GACdA,EAAO,UAAYkP,EAEnB,IAAI4E,EAAO7E,EAAK,OACZ8E,EAAU,EAGV6K,EAAKV,EAELW,EAAO,EASX,MARQ3gC,GAAI,UAAUgxB,CAAQ,IAE5B0P,EAAKj9B,EAAM,KAAKu8B,EAAa,CAAChP,EAAUA,CAAQ,CAAC,GAAKgP,EAEtDW,EAAOl9B,EAAM,QAAQ,EAAGutB,CAAQ,GAI9B4E,EAAO,EAAG,CAEZ,IAAIzR,EAAI,EACR,EAAG,CAEDrC,EAAO,KAAK,KAAKA,EAAO,OAAO,MAAM,EAErC,QAAStmB,EAAI,EAAGA,EAAIo6B,EAAMp6B,IAAK,CAE7B,IAAI85B,EAAMvE,EAAKv1B,CAAC,EAEhB,MAAQwE,GAAI,SAASs1B,CAAG,GAMtB,GAJInR,IAAM,GAAK0R,EAAUP,EAAI,SAC3BO,EAAUP,EAAI,QAGZnR,EAAImR,EAAI,OAAQ,CAElB,IAAIlJ,EAAIkJ,EAAInR,CAAC,EAERuc,EAAGtU,EAAGuU,CAAI,IAEb7e,EAAO,QAAQ,KAAKsK,CAAC,EAErBtK,EAAO,OAAO,KAAKtmB,CAAC,EAEvB,OAGG2oB,IAAM,GAAK0R,EAAU,IACvBA,EAAU,GAGP6K,EAAGpL,EAAKqL,CAAI,IAEf7e,EAAO,QAAQ,KAAKwT,CAAG,EAEvBxT,EAAO,OAAO,KAAKtmB,CAAC,EAGzB,CAED2oB,GACR,OAAeA,EAAI0R,EACd,CAED/T,EAAO,KAAK,KAAKA,EAAO,OAAO,MAAM,EAErCA,EAAO,MAAQ,CAAC8T,EAAMC,CAAO,CAC9B,CACDyK,EAAa,UAAY,IAAIzP,EAK7ByP,EAAa,UAAU,mBAAqB,SAAUvP,EAAMC,EAAU,CACpE,OAAO,IAAIsP,EAAavP,EAAMC,CAAQ,CAC1C,EAKE,OAAO,eAAesP,EAAc,OAAQ,CAC1C,MAAO,cACX,CAAG,EACDA,EAAa,UAAU,YAAcA,EACrCA,EAAa,UAAU,KAAO,eAC9BA,EAAa,UAAU,eAAiB,GAWxCA,EAAa,UAAU,YAAc,UAAY,CAC/C,SAAW/jB,GAAO,kBAAkB,KAAK,QAASvc,GAAI,MAAM,CAChE,EAWEsgC,EAAa,UAAU,QAAU,UAAY,CAC3C,MAAO,QACX,EAWEA,EAAa,UAAU,SAAW,UAAY,CAC5C,OAAO,KAAK,SAChB,EAQEA,EAAa,UAAU,OAAS,SAAUvP,EAAMC,EAAU,CACxD,OAAO,IAAIsP,EAAavP,EAAMC,CAAQ,CAC1C,EAWEsP,EAAa,UAAU,QAAU,UAAY,CAE3C,IAAI1K,EAAO,KAAK,MAAM,CAAC,EACnBC,EAAU,KAAK,MAAM,CAAC,EAE1B,OAAOD,IAAS,GAAKC,IAAY,EAAI,KAAK,OAAO,QAAUD,EAAOC,GAAW,CACjF,EAgBEyK,EAAa,UAAU,OAAS,SAAUr4B,EAAOgpB,EAAajX,EAAc,CAE1E,GAAI,CAAC,KAAK,QACR,MAAM,IAAI,MAAM,+CAA+C,EAIjE,OAAQ,UAAU,OAAM,CACtB,IAAK,GACH,OAAO4mB,EAAW,KAAM34B,CAAK,EAG/B,IAAK,GACL,IAAK,GACH,OAAO44B,EAAW,KAAM54B,EAAOgpB,EAAajX,CAAY,EAC1D,QACE,MAAM,IAAI,YAAY,2BAA2B,CACpD,CACL,EACE,SAAS4mB,EAAW9e,EAAQgf,EAAK,CAE/B,GAAI,IAAK9gC,GAAI,SAAS8gC,CAAG,EACvB,MAAM,IAAI,UAAU,eAAe,EAErC,IAAI/mB,EAAW+mB,EAAI,WACnB,GAAI/mB,EAEF,OAAO+H,EAAO,IAAIgf,EAAI,IAAK,CAAA,EAG7B,IAAIzsB,EAAOysB,EAAI,OACf,GAAIzsB,EAAK,SAAWyN,EAAO,MAAM,OAC/B,MAAM,IAAIpI,GAAgB,eAAerF,EAAK,OAAQyN,EAAO,MAAM,MAAM,EAI3E,IAAItmB,EAAG8Q,EAAI2X,EAAG8c,EAGV33B,EAAM03B,EAAI,MACVvoB,EAAMuoB,EAAI,MACd,IAAKtlC,EAAI,EAAG8Q,EAAKwV,EAAO,MAAM,OAAQtmB,EAAI8Q,EAAI9Q,OACxC+gB,GAAO,eAAenT,EAAI5N,CAAC,EAAGsmB,EAAO,MAAMtmB,CAAC,CAAC,KAC7C+gB,GAAO,eAAehE,EAAI/c,CAAC,EAAGsmB,EAAO,MAAMtmB,CAAC,CAAC,EAInD,IAAIwlC,EAAUlf,EAAO,QACjBmf,EAASnf,EAAO,OAChBof,EAAOpf,EAAO,KAGd8T,EAAOkL,EAAI,UAAU,CAAC,EACtBjL,EAAUiL,EAAI,UAAU,CAAC,EAGzB1Y,EAAI,CAAA,EACJ+Y,EAAK,CAAA,EAGTvL,EAAK,QAAQ,SAAUp6B,EAAGiiB,EAAG,CAE3B0jB,EAAG3lC,CAAC,EAAIiiB,EAAE,CAAC,EAEX2K,EAAE5sB,CAAC,EAAI,EACb,CAAK,EAGD,IAAIuE,EAASihC,EAAU,CAAE,EAAG,OACxB/4B,EAAQ,CAAA,EACRm5B,EAAM,CAAA,EAGV,OAAAvL,EAAQ,QAAQ,SAAU1R,EAAG,CAI3B,IAFAid,EAAI,KAAKn5B,EAAM,MAAM,EAEhBgc,EAAIid,EAAK/c,CAAC,EAAG4c,EAAKG,EAAK/c,EAAI,CAAC,EAAGF,EAAI8c,EAAI9c,IAE1CzoB,EAAIylC,EAAOhd,CAAC,EAERmE,EAAE5sB,CAAC,IAAM,KAEXyM,EAAM,KAAKk5B,EAAG3lC,CAAC,CAAC,EAEZuE,GACFA,EAAO,KAAKihC,EAAQ/c,CAAC,CAAC,EAIlC,CAAK,EAEDmd,EAAI,KAAKn5B,EAAM,MAAM,EAGd,IAAIq4B,EAAa,CACtB,OAAQvgC,EACR,MAAOkI,EACP,IAAKm5B,EACL,KAAM/sB,EACN,SAAUyN,EAAO,SACvB,CAAK,CACF,CACD,SAAS+e,EAAW/e,EAAQ7Z,EAAOusB,EAAWxa,EAAc,CAE1D,GAAI,CAAC/R,GAASA,EAAM,UAAY,GAC9B,MAAM,IAAI,UAAU,eAAe,EAIrC,IAAIwsB,EAAQxsB,EAAM,OACd8R,EAAW9R,EAAM,WAGjBysB,EAYJ,MAXQ10B,GAAI,UAAUw0B,CAAS,GAE7BE,EAAQF,EAAU,OAElBA,EAAYA,EAAU,WAGtBE,KAAYnY,GAAO,WAAWiY,CAAS,EAIrCza,EAAU,CAEZ,GAAI2a,EAAM,SAAW,EACnB,MAAM,IAAI,UAAU,iBAAiB,EAGvC5S,EAAO,IAAI7Z,EAAM,IAAG,EAAIusB,EAAWxa,CAAY,CACrD,KAAW,CAEL,GAAIya,EAAM,SAAW,GAAKA,EAAM,SAAW,EACzC,MAAM,IAAI/a,GAAgB,eAAe+a,EAAM,OAAQ3S,EAAO,MAAM,OAAQ,GAAG,EAIjF,GAAI4S,EAAM,OAASD,EAAM,OAAQ,CAI/B,QAFIj5B,EAAI,EACJigB,EAAQ,EACLgZ,EAAMj5B,CAAC,IAAM,GAAKk5B,EAAMl5B,CAAC,IAAM,GACpCA,IAEF,KAAOi5B,EAAMj5B,CAAC,IAAM,GAClBigB,IACAjgB,IAGFg5B,KAAgBjY,GAAO,WAAWiY,EAAWC,EAAM,OAAQhZ,EAAOiZ,CAAK,CACxE,CAGD,GAAI,IAAKjzB,GAAQ,iBAAiBgzB,EAAOC,CAAK,EAC5C,MAAM,IAAIhb,GAAgB,eAAe+a,EAAOC,EAAO,GAAG,EAI5D,GAAID,EAAM,SAAW,EAAG,CAEtB,IAAIF,EAAQtsB,EAAM,UAAU,CAAC,EAC7BssB,EAAM,QAAQ,SAAUK,EAAWC,EAAU,IACvCtY,GAAO,eAAeqY,CAAS,EACnC9S,EAAO,IAAI,CAAC8S,EAAW,CAAC,EAAGJ,EAAUK,EAAS,CAAC,CAAC,EAAG7a,CAAY,CACzE,CAAS,CACT,KAAa,CAEL,IAAIqnB,EAAsBp5B,EAAM,UAAU,CAAC,EACvCq5B,EAAuBr5B,EAAM,UAAU,CAAC,EAC5Co5B,EAAoB,QAAQ,SAAUE,EAAgBC,EAAe,IAC/DjlB,GAAO,eAAeglB,CAAc,EACxCD,EAAqB,QAAQ,SAAUG,EAAiBC,EAAgB,IAClEnlB,GAAO,eAAeklB,CAAe,EACzC3f,EAAO,IAAI,CAACyf,EAAgBE,CAAe,EAAGjN,EAAUgN,EAAc,CAAC,CAAC,EAAEE,EAAe,CAAC,CAAC,EAAG1nB,CAAY,CACtH,CAAW,CACX,CAAS,CACF,CACF,CACD,OAAO8H,CACR,CAQDwe,EAAa,UAAU,IAAM,SAAUr4B,EAAO,CAC5C,GAAI,IAAKjI,GAAI,SAASiI,CAAK,EACzB,MAAM,IAAI,UAAU,gBAAgB,EAEtC,GAAIA,EAAM,SAAW,KAAK,MAAM,OAC9B,MAAM,IAAIyR,GAAgB,eAAezR,EAAM,OAAQ,KAAK,MAAM,MAAM,EAI1E,GAAI,CAAC,KAAK,QACR,MAAM,IAAI,MAAM,4CAA4C,EAI9D,IAAIzM,EAAIyM,EAAM,CAAC,EACXkc,EAAIlc,EAAM,CAAC,KAGXsU,GAAO,eAAe/gB,EAAG,KAAK,MAAM,CAAC,CAAC,KACtC+gB,GAAO,eAAe4H,EAAG,KAAK,MAAM,CAAC,CAAC,EAG1C,IAAIF,EAAI0d,EAAenmC,EAAG,KAAK,KAAK2oB,CAAC,EAAG,KAAK,KAAKA,EAAI,CAAC,EAAG,KAAK,MAAM,EAErE,OAAIF,EAAI,KAAK,KAAKE,EAAI,CAAC,GAAK,KAAK,OAAOF,CAAC,IAAMzoB,EACtC,KAAK,QAAQyoB,CAAC,EAEhB,CACX,EAYEqc,EAAa,UAAU,IAAM,SAAUr4B,EAAOmkB,EAAGpS,EAAc,CAC7D,GAAI,IAAKha,GAAI,SAASiI,CAAK,EACzB,MAAM,IAAI,UAAU,gBAAgB,EAEtC,GAAIA,EAAM,SAAW,KAAK,MAAM,OAC9B,MAAM,IAAIyR,GAAgB,eAAezR,EAAM,OAAQ,KAAK,MAAM,MAAM,EAI1E,GAAI,CAAC,KAAK,QACR,MAAM,IAAI,MAAM,4CAA4C,EAI9D,IAAIzM,EAAIyM,EAAM,CAAC,EACXkc,EAAIlc,EAAM,CAAC,EAGX2tB,EAAO,KAAK,MAAM,CAAC,EACnBC,EAAU,KAAK,MAAM,CAAC,EAGtB6K,EAAKV,EAELW,EAAO,KACH3gC,GAAI,UAAU,KAAK,SAAS,IAElC0gC,EAAKj9B,EAAM,KAAKu8B,EAAa,CAAC,KAAK,UAAW,KAAK,SAAS,CAAC,GAAKA,EAElEW,EAAOl9B,EAAM,QAAQ,EAAG,KAAK,SAAS,IAIpCjI,EAAIo6B,EAAO,GAAKzR,EAAI0R,EAAU,KAEhC3b,EAAQ,KAAM,KAAK,IAAI1e,EAAI,EAAGo6B,CAAI,EAAG,KAAK,IAAIzR,EAAI,EAAG0R,CAAO,EAAG7b,CAAY,EAE3E4b,EAAO,KAAK,MAAM,CAAC,EACnBC,EAAU,KAAK,MAAM,CAAC,MAIpBtZ,GAAO,eAAe/gB,EAAGo6B,CAAI,KAC7BrZ,GAAO,eAAe4H,EAAG0R,CAAO,EAGpC,IAAI5R,EAAI0d,EAAenmC,EAAG,KAAK,KAAK2oB,CAAC,EAAG,KAAK,KAAKA,EAAI,CAAC,EAAG,KAAK,MAAM,EAErE,OAAIF,EAAI,KAAK,KAAKE,EAAI,CAAC,GAAK,KAAK,OAAOF,CAAC,IAAMzoB,EAExCklC,EAAGtU,EAAGuU,CAAI,EAKbiB,EAAQ3d,EAAGE,EAAG,KAAK,QAAS,KAAK,OAAQ,KAAK,IAAI,EAHlD,KAAK,QAAQF,CAAC,EAAImI,EAMfsU,EAAGtU,EAAGuU,CAAI,GAEbkB,EAAQ5d,EAAGzoB,EAAG2oB,EAAGiI,EAAG,KAAK,QAAS,KAAK,OAAQ,KAAK,IAAI,EAGrD,IACX,EACE,SAASuV,EAAenmC,EAAGsmC,EAAKC,EAAQ95B,EAAO,CAE7C,GAAI85B,EAASD,IAAQ,EACnB,OAAOC,EAGT,QAAStkB,EAAIqkB,EAAKrkB,EAAIskB,EAAQtkB,IAE5B,GAAIxV,EAAMwV,CAAC,IAAMjiB,EACf,OAAOiiB,EAIX,OAAOqkB,CACR,CACD,SAASF,EAAQ3d,EAAGE,EAAGpkB,EAAQkI,EAAOm5B,EAAK,CAEzCrhC,EAAO,OAAOkkB,EAAG,CAAC,EAClBhc,EAAM,OAAOgc,EAAG,CAAC,EAEjB,QAAStlB,EAAIwlB,EAAI,EAAGxlB,EAAIyiC,EAAI,OAAQziC,IAClCyiC,EAAIziC,CAAC,GAER,CACD,SAASkjC,EAAQ5d,EAAGzoB,EAAG2oB,EAAGiI,EAAGrsB,EAAQkI,EAAOm5B,EAAK,CAE/CrhC,EAAO,OAAOkkB,EAAG,EAAGmI,CAAC,EAErBnkB,EAAM,OAAOgc,EAAG,EAAGzoB,CAAC,EAEpB,QAASmD,EAAIwlB,EAAI,EAAGxlB,EAAIyiC,EAAI,OAAQziC,IAClCyiC,EAAIziC,CAAC,GAER,CAiBD2hC,EAAa,UAAU,OAAS,SAAUjsB,EAAM2F,EAAc1Y,EAAM,CAElE,GAAI,IAAKtB,GAAI,cAAcqU,CAAI,EAC7B,MAAM,IAAI,UAAU,0BAA0B,EAIhD,IAAIygB,EAAYzgB,EAAK,QAAS,EAAC,IAAI,SAAUlU,EAAO,CAClD,OAAO,MAAM,QAAQA,CAAK,GAAKA,EAAM,SAAW,EAAIA,EAAM,CAAC,EAAIA,CACrE,CAAK,EACD,GAAI20B,EAAU,SAAW,EACvB,MAAM,IAAI,MAAM,0CAA0C,EAI5DA,EAAU,QAAQ,SAAU30B,EAAO,CACjC,GAAI,IAAKH,GAAI,UAAUG,CAAK,GAAK,IAAKyW,GAAQ,WAAWzW,CAAK,GAAKA,EAAQ,EACzE,MAAM,IAAI,UAAU,0DAAkEsZ,GAAQ,QAAQqb,CAAS,EAAI,GAAG,CAE9H,CAAK,EAGD,IAAIhQ,EAAIxjB,EAAO,KAAK,MAAK,EAAK,KAE9B,OAAO4Y,EAAQ4K,EAAGgQ,EAAU,CAAC,EAAGA,EAAU,CAAC,EAAG9a,CAAY,CAC9D,EACE,SAASE,EAAQ4H,EAAQ8T,EAAMC,EAAS7b,EAAc,CAEpD,IAAI7Z,EAAQ6Z,GAAgB,EAGxB0mB,EAAKV,EAELW,EAAO,KACH3gC,GAAI,UAAU8hB,EAAO,SAAS,IAEpC4e,EAAKj9B,EAAM,KAAKu8B,EAAa,CAACle,EAAO,UAAWA,EAAO,SAAS,CAAC,GAAKke,EAEtEW,EAAOl9B,EAAM,QAAQ,EAAGqe,EAAO,SAAS,EAExC3hB,EAAQsD,EAAM,QAAQtD,EAAO2hB,EAAO,SAAS,GAI/C,IAAIkgB,EAAM,CAACtB,EAAGvgC,EAAOwgC,CAAI,EAGrBljB,EAAIqE,EAAO,MAAM,CAAC,EAClBjX,EAAIiX,EAAO,MAAM,CAAC,EAClBtmB,EAAG2oB,EAAGF,EAGV,GAAI4R,EAAUhrB,EAAG,CAEf,IAAKsZ,EAAItZ,EAAGsZ,EAAI0R,EAAS1R,IAIvB,GAFArC,EAAO,KAAKqC,CAAC,EAAIrC,EAAO,QAAQ,OAE5BkgB,EAEF,IAAKxmC,EAAI,EAAGA,EAAIiiB,EAAGjiB,IAEjBsmB,EAAO,QAAQ,KAAK3hB,CAAK,EAEzB2hB,EAAO,OAAO,KAAKtmB,CAAC,EAK1BsmB,EAAO,KAAK+T,CAAO,EAAI/T,EAAO,QAAQ,MAC5C,MAAe+T,EAAUhrB,IAEnBiX,EAAO,KAAK,OAAO+T,EAAU,EAAGhrB,EAAIgrB,CAAO,EAE3C/T,EAAO,QAAQ,OAAOA,EAAO,KAAK+T,CAAO,EAAG/T,EAAO,QAAQ,MAAM,EACjEA,EAAO,OAAO,OAAOA,EAAO,KAAK+T,CAAO,EAAG/T,EAAO,OAAO,MAAM,GAMjE,GAHAjX,EAAIgrB,EAGAD,EAAOnY,GAET,GAAIukB,EAAK,CAEP,IAAI7tB,EAAI,EAER,IAAKgQ,EAAI,EAAGA,EAAItZ,EAAGsZ,IAAK,CAEtBrC,EAAO,KAAKqC,CAAC,EAAIrC,EAAO,KAAKqC,CAAC,EAAIhQ,EAElC8P,EAAInC,EAAO,KAAKqC,EAAI,CAAC,EAAIhQ,EAEzB,IAAIhO,EAAI,EAER,IAAK3K,EAAIiiB,EAAGjiB,EAAIo6B,EAAMp6B,IAAK2K,IAEzB2b,EAAO,QAAQ,OAAOmC,EAAI9d,EAAG,EAAGhG,CAAK,EAErC2hB,EAAO,OAAO,OAAOmC,EAAI9d,EAAG,EAAG3K,CAAC,EAEhC2Y,GAEH,CAED2N,EAAO,KAAKjX,CAAC,EAAIiX,EAAO,QAAQ,MACjC,UACQ8T,EAAOnY,EAAG,CAEnB,IAAI9B,EAAI,EAER,IAAKwI,EAAI,EAAGA,EAAItZ,EAAGsZ,IAAK,CAEtBrC,EAAO,KAAKqC,CAAC,EAAIrC,EAAO,KAAKqC,CAAC,EAAIxI,EAElC,IAAI8b,EAAK3V,EAAO,KAAKqC,CAAC,EAClBuT,EAAK5V,EAAO,KAAKqC,EAAI,CAAC,EAAIxI,EAE9B,IAAKsI,EAAIwT,EAAIxT,EAAIyT,EAAIzT,IAEnBzoB,EAAIsmB,EAAO,OAAOmC,CAAC,EAEfzoB,EAAIo6B,EAAO,IAEb9T,EAAO,QAAQ,OAAOmC,EAAG,CAAC,EAE1BnC,EAAO,OAAO,OAAOmC,EAAG,CAAC,EAEzBtI,IAGL,CAEDmG,EAAO,KAAKqC,CAAC,EAAIrC,EAAO,QAAQ,MACjC,CAED,OAAAA,EAAO,MAAM,CAAC,EAAI8T,EAClB9T,EAAO,MAAM,CAAC,EAAI+T,EAEX/T,CACR,CAkBDwe,EAAa,UAAU,QAAU,SAAU/lB,EAAOjZ,EAAM,CAEtD,GAAI,IAAKtB,GAAI,SAASua,CAAK,EACzB,MAAM,IAAI,UAAU,gBAAgB,EAEtC,GAAIA,EAAM,SAAW,EACnB,MAAM,IAAI,MAAM,wDAAwD,EAI1EA,EAAM,QAAQ,SAAUpa,EAAO,CAC7B,GAAI,IAAKH,GAAI,UAAUG,CAAK,GAAK,IAAKyW,GAAQ,WAAWzW,CAAK,GAAKA,GAAS,IAAMA,IAAU,EAC1F,MAAM,IAAI,UAAU,gEAAwEsZ,GAAQ,QAAQc,CAAK,EAAI,GAAG,CAEhI,CAAK,EACD,IAAIE,EAAgB,KAAK,MAAM,CAAC,EAAI,KAAK,MAAM,CAAC,EAChDF,KAAYgC,GAAO,sBAAsBhC,EAAOE,CAAa,EAC7D,IAAIC,EAAYH,EAAM,CAAC,EAAIA,EAAM,CAAC,EAGlC,GAAIE,IAAkBC,EACpB,MAAM,IAAI,MAAM,qEAAqE,EAIvF,IAAIoK,EAAIxjB,EAAO,KAAK,MAAK,EAAK,KAG9B,GAAI,KAAK,MAAM,CAAC,IAAMiZ,EAAM,CAAC,GAAK,KAAK,MAAM,CAAC,IAAMA,EAAM,CAAC,EACzD,OAAOuK,EAKT,QADImd,EAAW,CAAA,EACNzmC,EAAI,EAAGA,EAAIspB,EAAE,KAAK,OAAQtpB,IACjC,QAAS2oB,EAAI,EAAGA,EAAIW,EAAE,KAAKtpB,EAAI,CAAC,EAAIspB,EAAE,KAAKtpB,CAAC,EAAG2oB,IAC7C8d,EAAS,KAAKzmC,CAAC,EAWnB,QANIuE,EAAS+kB,EAAE,QAAQ,MAAK,EAGxBod,EAAWpd,EAAE,OAAO,MAAK,EAGpBvE,EAAK,EAAGA,EAAKuE,EAAE,OAAO,OAAQvE,IAAM,CAC3C,IAAI4hB,EAAKD,EAAS3hB,CAAE,EAChB6hB,EAAKH,EAAS1hB,CAAE,EAChB3E,EAAOumB,EAAKrd,EAAE,MAAM,CAAC,EAAIsd,EAC7BH,EAAS1hB,CAAE,EAAI3E,EAAOrB,EAAM,CAAC,EAC7B2nB,EAAS3hB,CAAE,EAAI,KAAK,MAAM3E,EAAOrB,EAAM,CAAC,CAAC,CAC1C,CASDuK,EAAE,QAAQ,OAAS,EACnBA,EAAE,OAAO,OAAS,EAClBA,EAAE,KAAK,OAASvK,EAAM,CAAC,EAAI,EAC3BuK,EAAE,MAAQvK,EAAM,QAChB,QAASoG,EAAM,EAAGA,EAAMmE,EAAE,KAAK,OAAQnE,IACrCmE,EAAE,KAAKnE,CAAG,EAAI,EAKhB,QAAS+Q,EAAI,EAAGA,EAAI3xB,EAAO,OAAQ2xB,IAAK,CACtC,IAAI2Q,EAAMH,EAASxQ,CAAC,EAChB4Q,EAAKL,EAASvQ,CAAC,EACftF,EAAIrsB,EAAO2xB,CAAC,EACZzN,EAAI0d,EAAeU,EAAKvd,EAAE,KAAKwd,CAAE,EAAGxd,EAAE,KAAKwd,EAAK,CAAC,EAAGxd,EAAE,MAAM,EAChE+c,EAAQ5d,EAAGoe,EAAKC,EAAIlW,EAAGtH,EAAE,QAASA,EAAE,OAAQA,EAAE,IAAI,CACnD,CAID,OAAOA,CACX,EAOEwb,EAAa,UAAU,MAAQ,UAAY,CACzC,IAAI,EAAI,IAAIA,EAAa,CACvB,OAAQ,KAAK,WAAc7+B,GAAQ,OAAO,KAAK,OAAO,EAAI,OAC1D,SAAWA,GAAQ,OAAO,KAAK,MAAM,EACrC,OAASA,GAAQ,OAAO,KAAK,IAAI,EACjC,QAAUA,GAAQ,OAAO,KAAK,KAAK,EACnC,SAAU,KAAK,SACrB,CAAK,EACD,OAAO,CACX,EAOE6+B,EAAa,UAAU,KAAO,UAAY,CACxC,OAAO,KAAK,MAAM,MAAM,CAAC,CAC7B,EAaEA,EAAa,UAAU,IAAM,SAAUlgC,EAAU8wB,EAAW,CAE1D,GAAI,CAAC,KAAK,QACR,MAAM,IAAI,MAAM,4CAA4C,EAG9D,IAAI+D,EAAK,KAELW,EAAO,KAAK,MAAM,CAAC,EACnBC,EAAU,KAAK,MAAM,CAAC,EAEtB7tB,KAAWirB,GAAU,kBAAkB7yB,CAAQ,EAC/C6xB,EAAS,SAAgB7F,EAAG5wB,EAAG2oB,EAAG,CAEpC,OAAInc,IAAS,EAAU5H,EAASgsB,CAAC,EAC7BpkB,IAAS,EAAU5H,EAASgsB,EAAG,CAAC5wB,EAAG2oB,CAAC,CAAC,EAClC/jB,EAASgsB,EAAG,CAAC5wB,EAAG2oB,CAAC,EAAG8Q,CAAE,CACnC,EAEI,OAAOjU,EAAK,KAAM,EAAG4U,EAAO,EAAG,EAAGC,EAAU,EAAG5D,EAAQf,CAAS,CACpE,EAME,SAASlQ,EAAKc,EAAQygB,EAAQC,EAAQC,EAAWC,EAAWtiC,EAAU8wB,EAAW,CAE/E,IAAInxB,EAAS,CAAA,EACTkI,EAAQ,CAAA,EACRm5B,EAAM,CAAA,EAGNV,EAAKV,EAELW,EAAO,KACH3gC,GAAI,UAAU8hB,EAAO,SAAS,IAEpC4e,EAAKj9B,EAAM,KAAKu8B,EAAa,CAACle,EAAO,UAAWA,EAAO,SAAS,CAAC,GAAKke,EAEtEW,EAAOl9B,EAAM,QAAQ,EAAGqe,EAAO,SAAS,GAgB1C,QAZImQ,EAAS,SAAgB7F,EAAGztB,EAAGqX,GAAG,CAEpCoW,EAAIhsB,EAASgsB,EAAGztB,EAAGqX,EAAC,EAEf0qB,EAAGtU,EAAGuU,CAAI,IAEb5gC,EAAO,KAAKqsB,CAAC,EAEbnkB,EAAM,KAAKtJ,CAAC,EAEpB,EAEawlB,EAAIse,EAAWte,GAAKue,EAAWve,IAAK,CAE3Cid,EAAI,KAAKrhC,EAAO,MAAM,EAEtB,IAAI03B,EAAK3V,EAAO,KAAKqC,CAAC,EAClBuT,EAAK5V,EAAO,KAAKqC,EAAI,CAAC,EAC1B,GAAI+M,EAEF,QAASjN,EAAIwT,EAAIxT,EAAIyT,EAAIzT,IAAK,CAE5B,IAAIzoB,EAAIsmB,EAAO,OAAOmC,CAAC,EAEnBzoB,GAAK+mC,GAAU/mC,GAAKgnC,GAEtBvQ,EAAOnQ,EAAO,QAAQmC,CAAC,EAAGzoB,EAAI+mC,EAAQpe,EAAIse,CAAS,CAEtD,KACI,CAGL,QADIE,EAAU,CAAA,EACLC,EAAKnL,EAAImL,EAAKlL,EAAIkL,IAAM,CAC/B,IAAIC,EAAM/gB,EAAO,OAAO8gB,CAAE,EAC1BD,EAAQE,CAAG,EAAI/gB,EAAO,QAAQ8gB,CAAE,CACjC,CAID,QAASE,EAAMP,EAAQO,GAAON,EAAQM,IAAO,CAC3C,IAAI3iC,EAAQ2iC,KAAOH,EAAUA,EAAQG,CAAG,EAAI,EAC5C7Q,EAAO9xB,EAAO2iC,EAAMP,EAAQpe,EAAIse,CAAS,CAC1C,CACF,CACF,CAGD,OAAArB,EAAI,KAAKrhC,EAAO,MAAM,EAEf,IAAIugC,EAAa,CACtB,OAAQvgC,EACR,MAAOkI,EACP,IAAKm5B,EACL,KAAM,CAACoB,EAASD,EAAS,EAAGG,EAAYD,EAAY,CAAC,CAC3D,CAAK,CACF,CAYDnC,EAAa,UAAU,QAAU,SAAUlgC,EAAU8wB,EAAW,CAE9D,GAAI,CAAC,KAAK,QACR,MAAM,IAAI,MAAM,gDAAgD,EAQlE,QALI+D,EAAK,KAELW,EAAO,KAAK,MAAM,CAAC,EACnBC,EAAU,KAAK,MAAM,CAAC,EAEjB1R,EAAI,EAAGA,EAAI0R,EAAS1R,IAAK,CAEhC,IAAIsT,EAAK,KAAK,KAAKtT,CAAC,EAChBuT,EAAK,KAAK,KAAKvT,EAAI,CAAC,EACxB,GAAI+M,EAEF,QAASjN,EAAIwT,EAAIxT,EAAIyT,EAAIzT,IAAK,CAE5B,IAAIzoB,EAAI,KAAK,OAAOyoB,CAAC,EAGrB7jB,EAAS,KAAK,QAAQ6jB,CAAC,EAAG,CAACzoB,EAAG2oB,CAAC,EAAG8Q,CAAE,CACrC,KACI,CAGL,QADIl1B,EAAS,CAAA,EACJgjC,EAAMtL,EAAIsL,EAAMrL,EAAIqL,IAAO,CAClC,IAAIC,EAAM,KAAK,OAAOD,CAAG,EACzBhjC,EAAOijC,CAAG,EAAI,KAAK,QAAQD,CAAG,CAC/B,CAID,QAASE,EAAM,EAAGA,EAAMrN,EAAMqN,IAAO,CACnC,IAAI9iC,EAAQ8iC,KAAOljC,EAASA,EAAOkjC,CAAG,EAAI,EAC1C7iC,EAASD,EAAO,CAAC8iC,EAAK9e,CAAC,EAAG8Q,CAAE,CAC7B,CACF,CACF,CACL,EAMEqL,EAAa,UAAU,OAAO,QAAQ,EAAiB3M,GAAa,QAAW,KAAK,SAASwB,GAAU,CACrG,IAAIU,EAAS1R,EAAGsT,EAAIC,EAAIzT,EAAGzoB,EAC3B,OAAOm4B,GAAa,QAAW,KAAK,SAAkB0B,EAAU,CAC9D,OACE,OAAQA,EAAS,KAAOA,EAAS,KAAI,CACnC,IAAK,GACH,GAAI,KAAK,QAAS,CAChBA,EAAS,KAAO,EAChB,KACD,CACD,MAAM,IAAI,MAAM,sCAAsC,EACxD,IAAK,GACHQ,EAAU,KAAK,MAAM,CAAC,EACtB1R,EAAI,EACN,IAAK,GACH,GAAI,EAAEA,EAAI0R,GAAU,CAClBR,EAAS,KAAO,GAChB,KACD,CACDoC,EAAK,KAAK,KAAKtT,CAAC,EAChBuT,EAAK,KAAK,KAAKvT,EAAI,CAAC,EACpBF,EAAIwT,EACN,IAAK,GACH,GAAI,EAAExT,EAAIyT,GAAK,CACbrC,EAAS,KAAO,GAChB,KACD,CAED,OAAA75B,EAAI,KAAK,OAAOyoB,CAAC,EACjBoR,EAAS,KAAO,GACT,CACL,MAAO,KAAK,QAAQpR,CAAC,EACrB,MAAO,CAACzoB,EAAG2oB,CAAC,CAC1B,EACU,IAAK,IACHF,IACAoR,EAAS,KAAO,EAChB,MACF,IAAK,IACHlR,IACAkR,EAAS,KAAO,EAChB,MACF,IAAK,IACL,IAAK,MACH,OAAOA,EAAS,MACnB,CAET,EAAOF,EAAS,IAAI,CACpB,CAAG,EAODmL,EAAa,UAAU,QAAU,UAAY,CAC3C,OAAO4C,EAAS,KAAK,QAAS,KAAK,OAAQ,KAAK,KAAM,KAAK,MAAO,EAAI,CAC1E,EAOE5C,EAAa,UAAU,QAAU,UAAY,CAC3C,OAAO4C,EAAS,KAAK,QAAS,KAAK,OAAQ,KAAK,KAAM,KAAK,MAAO,EAAK,CAC3E,EACE,SAASA,EAASnjC,EAAQkI,EAAOm5B,EAAK/sB,EAAM/S,EAAM,CAEhD,IAAIs0B,EAAOvhB,EAAK,CAAC,EACbwhB,EAAUxhB,EAAK,CAAC,EAEhBhU,EAAI,CAAA,EAEJ7E,EAAG2oB,EAEP,IAAK3oB,EAAI,EAAGA,EAAIo6B,EAAMp6B,IAEpB,IADA6E,EAAE7E,CAAC,EAAI,GACF2oB,EAAI,EAAGA,EAAI0R,EAAS1R,IACvB9jB,EAAE7E,CAAC,EAAE2oB,CAAC,EAAI,EAKd,IAAKA,EAAI,EAAGA,EAAI0R,EAAS1R,IAKvB,QAHIsT,EAAK2J,EAAIjd,CAAC,EACVuT,EAAK0J,EAAIjd,EAAI,CAAC,EAETF,EAAIwT,EAAIxT,EAAIyT,EAAIzT,IAEvBzoB,EAAIyM,EAAMgc,CAAC,EAEX5jB,EAAE7E,CAAC,EAAE2oB,CAAC,EAAIpkB,EAASuB,KAAWG,GAAQ,OAAO1B,EAAOkkB,CAAC,CAAC,EAAIlkB,EAAOkkB,CAAC,EAAI,EAG1E,OAAO5jB,CACR,CAWD,OAAAigC,EAAa,UAAU,OAAS,SAAUv+B,EAAS,CASjD,QAPI6zB,EAAO,KAAK,MAAM,CAAC,EACnBC,EAAU,KAAK,MAAM,CAAC,EAEtBsN,EAAU,KAAK,UAEf5hC,EAAM,qBAAwBkY,GAAQ,QAAQmc,EAAM7zB,CAAO,EAAI,SAAY0X,GAAQ,QAAQoc,EAAS9zB,CAAO,EAAI,iBAAoB0X,GAAQ,QAAQ0pB,EAASphC,CAAO,EAAI;AAAA,EAElKoiB,EAAI,EAAGA,EAAI0R,EAAS1R,IAK3B,QAHIsT,EAAK,KAAK,KAAKtT,CAAC,EAChBuT,EAAK,KAAK,KAAKvT,EAAI,CAAC,EAEfF,EAAIwT,EAAIxT,EAAIyT,EAAIzT,IAAK,CAE5B,IAAIzoB,EAAI,KAAK,OAAOyoB,CAAC,EAErB1iB,GAAO;AAAA,UAAgBkY,GAAQ,QAAQje,EAAGuG,CAAO,EAAI,QAAW0X,GAAQ,QAAQ0K,EAAGpiB,CAAO,EAAI,UAAY,KAAK,WAAc0X,GAAQ,QAAQ,KAAK,QAAQwK,CAAC,EAAGliB,CAAO,EAAI,IAC1K,CAEH,OAAOR,CACX,EAOE++B,EAAa,UAAU,SAAW,UAAY,CAC5C,SAAW7mB,GAAQ,QAAQ,KAAK,QAAS,CAAA,CAC7C,EAOE6mB,EAAa,UAAU,OAAS,UAAY,CAC1C,MAAO,CACL,OAAQ,eACR,OAAQ,KAAK,QACb,MAAO,KAAK,OACZ,IAAK,KAAK,KACV,KAAM,KAAK,MACX,SAAU,KAAK,SACrB,CACA,EAUEA,EAAa,UAAU,SAAW,SAAUrc,EAAG,CAE7C,GAAIA,GAMF,MAJQjkB,GAAI,aAAaikB,CAAC,IACxBA,EAAIA,EAAE,YAGJ,IAAKjkB,GAAI,UAAUikB,CAAC,GAAK,IAAKrN,GAAQ,WAAWqN,CAAC,EACpD,MAAM,IAAI,UAAU,2CAA2C,OAIjEA,EAAI,EAEN,IAAIyR,EAASzR,EAAI,EAAIA,EAAI,EACrB0R,EAAO1R,EAAI,EAAI,CAACA,EAAI,EAGpB2R,EAAO,KAAK,MAAM,CAAC,EACnBC,EAAU,KAAK,MAAM,CAAC,EAGtB1hB,EAAI,KAAK,IAAIyhB,EAAOD,EAAME,EAAUH,CAAM,EAG1C31B,EAAS,CAAA,EACTkI,EAAQ,CAAA,EACRm5B,EAAM,CAAA,EAEVA,EAAI,CAAC,EAAI,EAET,QAASjd,EAAIuR,EAAQvR,EAAI0R,GAAW91B,EAAO,OAASoU,EAAGgQ,IAKrD,QAHIsT,EAAK,KAAK,KAAKtT,CAAC,EAChBuT,EAAK,KAAK,KAAKvT,EAAI,CAAC,EAEfxlB,EAAI84B,EAAI94B,EAAI+4B,EAAI/4B,IAAK,CAE5B,IAAInD,EAAI,KAAK,OAAOmD,CAAC,EAErB,GAAInD,IAAM2oB,EAAIuR,EAASC,EAAM,CAE3B51B,EAAO,KAAK,KAAK,QAAQpB,CAAC,CAAC,EAE3BsJ,EAAMlI,EAAO,OAAS,CAAC,EAAIvE,EAAIm6B,EAE/B,KACD,CACF,CAGH,OAAAyL,EAAI,KAAKrhC,EAAO,MAAM,EAEf,IAAIugC,EAAa,CACtB,OAAQvgC,EACR,MAAOkI,EACP,IAAKm5B,EACL,KAAM,CAACjtB,EAAG,CAAC,CACjB,CAAK,CACL,EAUEmsB,EAAa,SAAW,SAAUne,EAAM,CACtC,OAAO,IAAIme,EAAane,CAAI,CAChC,EAcEme,EAAa,SAAW,SAAUjsB,EAAMlU,EAAO8jB,EAAGjK,EAAcgX,EAAU,CACxE,GAAI,IAAKhxB,GAAI,SAASqU,CAAI,EACxB,MAAM,IAAI,UAAU,gCAAgC,EAEtD,GAAIA,EAAK,SAAW,EAClB,MAAM,IAAI,MAAM,0CAA0C,EAkB5D,GAdAA,EAAOA,EAAK,IAAI,SAAU7N,EAAG,CAO3B,MALQxG,GAAI,aAAawG,CAAC,IAExBA,EAAIA,EAAE,YAGJ,IAAKxG,GAAI,UAAUwG,CAAC,GAAK,IAAKoQ,GAAQ,WAAWpQ,CAAC,GAAKA,EAAI,EAC7D,MAAM,IAAI,MAAM,uCAAuC,EAEzD,OAAOA,CACb,CAAK,EAGGyd,GAMF,MAJQjkB,GAAI,aAAaikB,CAAC,IACxBA,EAAIA,EAAE,YAGJ,IAAKjkB,GAAI,UAAUikB,CAAC,GAAK,IAAKrN,GAAQ,WAAWqN,CAAC,EACpD,MAAM,IAAI,UAAU,2CAA2C,OAIjEA,EAAI,EAIN,IAAIyc,EAAKV,EAELW,EAAO,KACH3gC,GAAI,UAAUgxB,CAAQ,IAE5B0P,EAAKj9B,EAAM,KAAKu8B,EAAa,CAAChP,EAAUA,CAAQ,CAAC,GAAKgP,EAEtDW,EAAOl9B,EAAM,QAAQ,EAAGutB,CAAQ,GAElC,IAAI0E,EAASzR,EAAI,EAAIA,EAAI,EACrB0R,EAAO1R,EAAI,EAAI,CAACA,EAAI,EAGpB2R,EAAOvhB,EAAK,CAAC,EACbwhB,EAAUxhB,EAAK,CAAC,EAGhBF,EAAI,KAAK,IAAIyhB,EAAOD,EAAME,EAAUH,CAAM,EAG1C50B,EAGJ,MAAQd,GAAI,SAASG,CAAK,EAAG,CAE3B,GAAIA,EAAM,SAAWgU,EAEnB,MAAM,IAAI,MAAM,4BAA4B,EAG9CrT,EAAS,SAAgBtF,EAAG,CAE1B,OAAO2E,EAAM3E,CAAC,CACtB,CACK,YAAcwE,GAAI,UAAUG,CAAK,EAAG,CAEnC,IAAI21B,EAAK31B,EAAM,OAEf,GAAI21B,EAAG,SAAW,GAAKA,EAAG,CAAC,IAAM3hB,EAE/B,MAAM,IAAI,MAAM,uBAAuB,EAGzCrT,EAAS,SAAgBtF,EAAG,CAE1B,OAAO2E,EAAM,IAAI,CAAC3E,CAAC,CAAC,CAC5B,CACA,MAEMsF,EAAS,UAAkB,CAEzB,OAAOX,CACf,EASI,QALIJ,EAAS,CAAA,EACTkI,EAAQ,CAAA,EACRm5B,EAAM,CAAA,EAGDjd,EAAI,EAAGA,EAAI0R,EAAS1R,IAAK,CAEhCid,EAAI,KAAKrhC,EAAO,MAAM,EAEtB,IAAIvE,EAAI2oB,EAAIuR,EAEZ,GAAIl6B,GAAK,GAAKA,EAAI2Y,EAAG,CAEnB,IAAIiY,EAAItrB,EAAOtF,CAAC,EAEXklC,EAAGtU,EAAGuU,CAAI,IAEb14B,EAAM,KAAKzM,EAAIm6B,CAAI,EAEnB51B,EAAO,KAAKqsB,CAAC,EAEhB,CACF,CAED,OAAAgV,EAAI,KAAKrhC,EAAO,MAAM,EAEf,IAAIugC,EAAa,CACtB,OAAQvgC,EACR,MAAOkI,EACP,IAAKm5B,EACL,KAAM,CAACxL,EAAMC,CAAO,CAC1B,CAAK,CACL,EAWEyK,EAAa,UAAU,SAAW,SAAU9kC,EAAG2oB,EAAG,CAEhD,GAAI,IAAKnkB,GAAI,UAAUxE,CAAC,GAAK,IAAKob,GAAQ,WAAWpb,CAAC,GAAK,IAAKwE,GAAI,UAAUmkB,CAAC,GAAK,IAAKvN,GAAQ,WAAWuN,CAAC,EAC3G,MAAM,IAAI,MAAM,qCAAqC,EAGvD,GAAI,KAAK,MAAM,SAAW,EACxB,MAAM,IAAI,MAAM,0CAA0C,EAG5D,SAAI5H,GAAO,eAAe/gB,EAAG,KAAK,MAAM,CAAC,CAAC,KACtC+gB,GAAO,eAAe4H,EAAG,KAAK,MAAM,CAAC,CAAC,EAG1Cmc,EAAa,UAAU9kC,EAAG2oB,EAAG,KAAK,MAAM,CAAC,EAAG,KAAK,QAAS,KAAK,OAAQ,KAAK,IAAI,EAEzE,IACX,EAWEmc,EAAa,YAAc,SAAUnc,EAAGpkB,EAAQkI,EAAOm5B,EAAKhhC,EAAU,CAKpE,QAHIq3B,EAAK2J,EAAIjd,CAAC,EACVuT,EAAK0J,EAAIjd,EAAI,CAAC,EAETF,EAAIwT,EAAIxT,EAAIyT,EAAIzT,IAEvB7jB,EAAS6H,EAAMgc,CAAC,EAAGlkB,EAAOkkB,CAAC,CAAC,CAElC,EAYEqc,EAAa,UAAY,SAAU3hC,EAAGqX,EAAG6f,EAAS91B,EAAQkI,EAAOm5B,EAAK,CAEpE,QAASjd,EAAI,EAAGA,EAAI0R,EAAS1R,IAAK,CAEhC,IAAIsT,EAAK2J,EAAIjd,CAAC,EACVuT,EAAK0J,EAAIjd,EAAI,CAAC,EAEdif,EAAKzB,EAAehjC,EAAG84B,EAAIC,EAAIzvB,CAAK,EAEpCo7B,EAAK1B,EAAe3rB,EAAGyhB,EAAIC,EAAIzvB,CAAK,EAExC,GAAIm7B,EAAK1L,GAAM2L,EAAK3L,GAAMzvB,EAAMm7B,CAAE,IAAMzkC,GAAKsJ,EAAMo7B,CAAE,IAAMrtB,EAAG,CAE5D,GAAIjW,EAAQ,CACV,IAAIqsB,EAAIrsB,EAAOqjC,CAAE,EACjBrjC,EAAOqjC,CAAE,EAAIrjC,EAAOsjC,CAAE,EACtBtjC,EAAOsjC,CAAE,EAAIjX,CACd,CAED,QACD,CAED,GAAIgX,EAAK1L,GAAMzvB,EAAMm7B,CAAE,IAAMzkC,IAAM0kC,GAAM3L,GAAMzvB,EAAMo7B,CAAE,IAAMrtB,GAAI,CAE/D,IAAIstB,EAAKvjC,EAASA,EAAOqjC,CAAE,EAAI,OAE/Bn7B,EAAM,OAAOo7B,EAAI,EAAGrtB,CAAC,EACjBjW,GACFA,EAAO,OAAOsjC,EAAI,EAAGC,CAAE,EAGzBr7B,EAAM,OAAOo7B,GAAMD,EAAKA,EAAK,EAAIA,EAAI,CAAC,EAClCrjC,GACFA,EAAO,OAAOsjC,GAAMD,EAAKA,EAAK,EAAIA,EAAI,CAAC,EAGzC,QACD,CAED,GAAIC,EAAK3L,GAAMzvB,EAAMo7B,CAAE,IAAMrtB,IAAMotB,GAAM1L,GAAMzvB,EAAMm7B,CAAE,IAAMzkC,GAAI,CAE/D,IAAI4kC,EAAKxjC,EAASA,EAAOsjC,CAAE,EAAI,OAE/Bp7B,EAAM,OAAOm7B,EAAI,EAAGzkC,CAAC,EACjBoB,GACFA,EAAO,OAAOqjC,EAAI,EAAGG,CAAE,EAGzBt7B,EAAM,OAAOm7B,GAAMC,EAAKA,EAAK,EAAIA,EAAI,CAAC,EAClCtjC,GACFA,EAAO,OAAOqjC,GAAMC,EAAKA,EAAK,EAAIA,EAAI,CAAC,CAE1C,CACF,CACL,EACS/C,CACT,EAAG,CACD,QAAS,EACX,CAAC,EACDA,GAAA,wBAAkCC,aCj/ClC,OAAO,eAAeztB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAIiO,GAAWhlB,EACX47B,GAAcj5B,GACd6D,GAAO,SACPia,GAAe,CAAC,OAAO,EAO3B,SAASgnB,GAAyBC,EAAO,CACvC,IAAIC,EAA2BD,EAAM,MAAM,wCAAwC,EACnF,GAAIC,EAA0B,CAC5B,IAAIC,EAAQ,CACV,KAAM,EACN,KAAM,EACN,KAAM,EACZ,EAAMD,EAAyB,CAAC,CAAC,EACzBE,EAAcF,EAAyB,CAAC,EACxCG,EAAiBH,EAAyB,CAAC,EAC/C,MAAO,CACL,MAAOD,EACP,MAAOE,EACP,YAAaC,EACb,eAAgBC,CACtB,CACA,KACI,QAAO,IAEX,CAOA,SAASC,GAA8BC,EAAO,CAG5C,QAFI5vB,EAAI,SAAS4vB,EAAM,YAAaA,EAAM,KAAK,EAC3CniB,EAAI,EACCpmB,EAAI,EAAGA,EAAIuoC,EAAM,eAAe,OAAQvoC,IAAK,CACpD,IAAIwoC,EAAa,SAASD,EAAM,eAAevoC,CAAC,EAAGuoC,EAAM,KAAK,EAC9DniB,GAAKoiB,EAAa,KAAK,IAAID,EAAM,MAAOvoC,EAAI,CAAC,CAC9C,CACD,IAAIwY,EAASG,EAAIyN,EACjB,GAAI,MAAM5N,CAAM,EACd,MAAM,IAAI,YAAY,WAAa+vB,EAAM,MAAQ,sBAAsB,EAEzE,OAAO/vB,CACT,CACA,IAAIiwB,MAAkCljB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC1F,IAAI3d,EAAQ2d,EAAK,MA0BbtO,EAASrP,EAAM,SAAU,CAC3B,GAAI,UAAa,CACf,MAAO,EACR,EACD,OAAQ,SAAgB9E,EAAG,CACzB,OAAOA,CACR,EACD,OAAQ,SAAgBA,EAAG,CACzB,GAAIA,IAAM,MAAO,MAAO,KACxB,IAAIulC,EAAwBV,GAAyB7kC,CAAC,EACtD,GAAIulC,EACF,OAAOJ,GAA8BI,CAAqB,EAE5D,IAAI7vB,EAAO,EACP8vB,EAAsBxlC,EAAE,MAAM,+BAA+B,EAC7DwlC,IAGF9vB,EAAO,OAAO8vB,EAAoB,CAAC,CAAC,EACpCxlC,EAAIwlC,EAAoB,CAAC,GAE3B,IAAI5d,EAAM,OAAO5nB,CAAC,EAClB,GAAI,MAAM4nB,CAAG,EACX,MAAM,IAAI,YAAY,WAAa5nB,EAAI,sBAAsB,EAE/D,GAAIwlC,EAAqB,CAGvB,GAAI5d,EAAM,KAAK,IAAI,EAAGlS,CAAI,EAAI,EAE5B,MAAM,IAAI,YAAY,WAAY,OAAO1V,EAAG,mBAAoB,CAAC,EAG/D4nB,GAAO,KAAK,IAAI,EAAGlS,EAAO,CAAC,IAC7BkS,EAAMA,EAAM,KAAK,IAAI,EAAGlS,CAAI,EAE/B,CACD,OAAOkS,CACR,EACD,UAAW,SAAmB5nB,EAAG,CAC/B,OAAOA,EAAE,UACV,EACD,SAAU,SAAkBA,EAAG,CAC7B,OAAOA,EAAE,SACV,EACD,KAAM,SAAcA,EAAG,CACrB,MAAM,IAAI,MAAM,8CAA8C,CAC/D,EACD,KAAQ,SAAeA,EAAG,CACxB,MAAO,EACR,EACD,sBAAuB,SAAwBylC,EAAMC,EAAe,CAClE,OAAOD,EAAK,SAASC,CAAa,CACnC,EACD,iBAAkB5gC,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,CAAI,CAC/C,CACA,CAAK,CACL,CAAG,EAOD,OAAAmF,EAAO,SAAW,SAAUqP,EAAM,CAChC,OAAO,WAAWA,EAAK,KAAK,CAChC,EACSrP,CACT,CAAC,EACDA,GAAA,aAAuBmxB,aCvJvB,OAAO,eAAe9sB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAI4J,GAAWhlB,EACX47B,GAAcj5B,GACdkY,GAAU3W,GACVsC,GAAO,SACPia,GAAe,CAAC,OAAO,EACvB8nB,MAAkCvjB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC1F,IAAI3d,EAAQ2d,EAAK,MA0BjB,OAAO3d,EAAMlB,GAAM,CACjB,GAAI,UAAa,CACf,MAAO,EACR,EACD,OAAQqU,GAAQ,OAChB,KAAQ,SAAejY,EAAG,CACxB,MAAO,MACR,EACD,QAAW,SAAiBA,EAAG,CAC7B,OAAOA,EAAI,EACZ,EACD,OAAQ,SAAgBA,EAAG,CACzB,OAAOA,CACR,EACD,iBAAkB8E,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,CAAI,CAC/C,CACA,CAAK,EACD,IAAK,SAAahP,EAAG,CACnB,OAAO,OAAOA,CAAC,CAChB,CACL,CAAG,CACH,CAAC,EACDwY,GAAA,aAAuBmtB,aC5DvB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAIxjB,GAAWhlB,EACX47B,GAAcj5B,GACd6D,GAAO,UACPia,GAAe,CAAC,OAAO,EACvBgoB,MAAmCzjB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC3F,IAAI3d,EAAQ2d,EAAK,MA4BjB,OAAO3d,EAAMlB,GAAM,CACjB,GAAI,UAAa,CACf,MAAO,EACR,EACD,QAAW,SAAiB5D,EAAG,CAC7B,OAAOA,CACR,EACD,OAAQ,SAAgBA,EAAG,CACzB,MAAO,CAAC,CAACA,CACV,EACD,KAAQ,SAAeA,EAAG,CACxB,MAAO,EACR,EACD,UAAW,SAAmBA,EAAG,CAC/B,MAAO,CAACA,EAAE,QACX,EACD,OAAQ,SAAgBA,EAAG,CAEzB,IAAI8lC,EAAQ9lC,EAAE,cACd,GAAI8lC,IAAU,OACZ,MAAO,GACF,GAAIA,IAAU,QACnB,MAAO,GAIT,IAAIle,EAAM,OAAO5nB,CAAC,EAClB,GAAIA,IAAM,IAAM,CAAC,MAAM4nB,CAAG,EACxB,MAAO,CAAC,CAACA,EAEX,MAAM,IAAI,MAAM,mBAAqB5nB,EAAI,gBAAgB,CAC1D,EACD,iBAAkB8E,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,CAAI,CAC/C,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACD42B,GAAA,cAAwBC,aC5ExB,OAAO,eAAeE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAI3jB,GAAWhlB,EACX47B,GAAcj5B,GACd6D,GAAO,YACPia,GAAe,CAAC,QAAS,WAAW,EACpCmoB,MAAqC5jB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC7F,IAAI3d,EAAQ2d,EAAK,MACfC,EAAYD,EAAK,UA0BnB,OAAO3d,EAAM,YAAa,CACxB,GAAI,UAAa,CACf,OAAO,IAAI4d,EAAU,CAAC,CACvB,EACD,OAAQ,SAAgB1iB,EAAG,CAEzB,OAAO,IAAI0iB,EAAU1iB,EAAI,EAAE,CAC5B,EACD,OAAQ,SAAgBA,EAAG,CACzB,IAAIwlC,EAAsBxlC,EAAE,MAAM,+BAA+B,EACjE,GAAIwlC,EAAqB,CAEvB,IAAI9vB,EAAO8vB,EAAoB,CAAC,EAC5BhwB,EAAIkN,EAAU8iB,EAAoB,CAAC,CAAC,EACpCS,EAAa,IAAIvjB,EAAU,CAAC,EAAE,IAAI,OAAOhN,CAAI,CAAC,EAClD,GAAIF,EAAE,GAAGywB,EAAW,IAAI,CAAC,CAAC,EACxB,MAAM,IAAI,YAAY,WAAY,OAAOjmC,EAAG,mBAAoB,CAAC,EAEnE,IAAIkmC,EAAmB,IAAIxjB,EAAU,CAAC,EAAE,IAAI,OAAOhN,CAAI,EAAI,CAAC,EAC5D,OAAIF,EAAE,IAAI0wB,CAAgB,EACjB1wB,EAAE,IAAIywB,CAAU,EAEhBzwB,CAEV,CACD,OAAO,IAAIkN,EAAU1iB,CAAC,CACvB,EACD,UAAW,SAAmBA,EAAG,CAE/B,OAAOA,CACR,EACD,SAAU,SAAkBA,EAAG,CAC7B,OAAO,IAAI0iB,EAAU1iB,EAAE,CAAC,EAAE,IAAIA,EAAE,CAAC,EAAE,MAAMA,EAAE,CAAC,CAC7C,EACD,KAAQ,SAAeA,EAAG,CACxB,OAAO,IAAI0iB,EAAU,CAAC,CACvB,EACD,iBAAkB5d,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,CAAI,CAC/C,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACD+2B,GAAA,gBAA0BC,aChF1B,OAAO,eAAe/E,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAI7e,GAAWhlB,EACX47B,GAAcj5B,GACd6D,GAAO,UACPia,GAAe,CAAC,QAAS,SAAS,EAClCsoB,MAAmC/jB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC3F,IAAI3d,EAAQ2d,EAAK,MACfE,EAAUF,EAAK,QAuCjB,OAAO3d,EAAM,UAAW,CACtB,GAAI,UAAa,CACf,OAAO6d,EAAQ,IAChB,EACD,OAAQ,SAAgB3iB,EAAG,CACzB,OAAO,IAAI2iB,EAAQ3iB,EAAG,CAAC,CACxB,EACD,iBAAkB,SAAsBkvB,EAAID,EAAI,CAC9C,OAAO,IAAItM,EAAQuM,EAAID,CAAE,CAC1B,EAED,uBAAwB,SAA4BC,EAAID,EAAI,CAC1D,OAAO,IAAItM,EAAQuM,EAAG,SAAU,EAAED,EAAG,SAAQ,CAAE,CAChD,EACD,SAAU,SAAkBjvB,EAAG,CAC7B,OAAO,IAAI2iB,EAAQ3iB,EAAE,QAAS,EAAE,CAAC,CAClC,EACD,QAAS,SAAiBA,EAAG,CAC3B,OAAOA,EAAE,OACV,EACD,OAAQ,SAAgBA,EAAG,CACzB,OAAO2iB,EAAQ3iB,CAAC,CACjB,EAED,KAAQ,SAAeA,EAAG,CACxB,OAAO2iB,EAAQ,CAAC,CACjB,EACD,OAAQ,SAAgB3iB,EAAG,CACzB,GAAI,OAAQA,GAAK,OAAQA,EACvB,OAAO,IAAI2iB,EAAQ3iB,EAAE,GAAIA,EAAE,EAAE,EAE/B,GAAI,MAAOA,GAAK,QAASA,GAAK,QAASA,GAAK,QAASA,EACnD,OAAO,IAAI2iB,EAAQ3iB,CAAC,EAEtB,MAAM,IAAI,MAAM,6EAA6E,CAC9F,EACD,iBAAkB8E,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,CAAI,CAC/C,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACDiyB,GAAA,cAAwBkF,aC5FxB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAIhkB,GAAWhlB,EACX47B,GAAcj5B,GACd6D,GAAO,WACPia,GAAe,CAAC,QAAS,UAAU,EACnCwoB,MAAoCjkB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC5F,IAAI3d,EAAQ2d,EAAK,MACfI,EAAWJ,EAAK,SAsClB,OAAO3d,EAAM,WAAY,CACvB,OAAQ,SAAgB9E,EAAG,CACzB,GAAI,CAAC,SAASA,CAAC,GAAK,MAAMA,CAAC,EACzB,MAAM,IAAI,MAAMA,EAAI,sCAAsC,EAE5D,OAAO,IAAI6iB,EAAS7iB,CAAC,CACtB,EACD,OAAQ,SAAgBA,EAAG,CACzB,OAAO,IAAI6iB,EAAS7iB,CAAC,CACtB,EACD,iBAAkB,SAAsBssB,EAAW5E,EAAa,CAC9D,OAAO,IAAI7E,EAASyJ,EAAW5E,CAAW,CAC3C,EACD,KAAQ,SAAe1nB,EAAG,CACxB,OAAO,IAAI6iB,EAAS,CAAC,CACtB,EACD,UAAW,SAAmB7iB,EAAG,CAC/B,OAAO,IAAI6iB,EAAS7iB,EAAE,SAAU,CAAA,CACjC,EACD,SAAU,SAAkBA,EAAG,CAC7B,OAAOA,CACR,EAED,OAAQ,SAAgBA,EAAG,CACzB,OAAO,IAAI6iB,EAAS7iB,CAAC,CACtB,EACD,iBAAkB8E,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,CAAI,CAC/C,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACDo3B,GAAA,eAAyBC,aCjFzB,OAAO,eAAeljB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAIf,GAAWhlB,EACXwG,GAAO,SACPia,GAAe,CAAC,QAAS,SAAU,cAAe,cAAc,EAChEyoB,MAAkClkB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACtF,IAAA3d,EAAQ2d,EAAK,MACNA,EAAK,OAClB,IAAIG,EAAcH,EAAK,YACnBkf,EAAelf,EAAK,aAkCtB,OAAO3d,EAAMlB,GAAM,CACjB,GAAI,UAAa,CACf,OAAO2iC,EAAQ,CAAA,CAAE,CAClB,EACD,OAAQ,SAAgBjyB,EAAQ,CAC9B,OAAOiyB,EAAQ,GAAIjyB,CAAM,CAC1B,EACD,iBAAkB,SAAsBA,EAAQ+d,EAAU,CACxD,OAAOkU,EAAQ,CAAA,EAAIjyB,EAAQ+d,CAAQ,CACpC,EACD,MAAO,SAAeD,EAAM,CAC1B,OAAOmU,EAAQnU,CAAI,CACpB,EACD,OAAQ,SAAgBA,EAAM,CAC5B,OAAOmU,EAAQnU,EAAMA,EAAK,QAAS,CAAA,CACpC,EACD,yBAA0BmU,EAC1B,iCAAkCA,CACtC,CAAG,EAUD,SAASA,EAAQnU,EAAM9d,EAAQ+d,EAAU,CAEvC,GAAI/d,IAAW,SAAWA,IAAW,WAAaA,IAAW,OAC3D,OAAO,IAAIsO,EAAYwP,EAAMC,CAAQ,EAEvC,GAAI/d,IAAW,SACb,OAAO,IAAIqtB,EAAavP,EAAMC,CAAQ,EAExC,MAAM,IAAI,UAAU,uBAAyB,KAAK,UAAU/d,CAAM,EAAI,GAAG,CAC1E,CACH,CAAC,EACD6O,GAAA,aAAuBmjB,aCpFvB,OAAO,eAAeE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAIpkB,GAAWhlB,EACXwG,GAAO,qBACPia,GAAe,CAAC,QAAS,SAAU,QAAQ,EAC3C4oB,MAA8CrkB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACtG,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdke,EAASle,EAAK,OA8BhB,OAAO3d,EAAMlB,GAAM,CACjB,2CAA4C,SAAyC8R,EAAM1P,EAAIsO,EAAQ+d,EAAU,CAC/G,OAAOkU,EAAQ7wB,EAAM1P,EAAIsO,EAAQ+d,CAAQ,CAC1C,EACD,mCAAoC,SAAmC3c,EAAM1P,EAAIsO,EAAQ,CACvF,OAAOiyB,EAAQ7wB,EAAM1P,EAAIsO,CAAM,CAChC,EACD,mBAAoB,SAAwBoB,EAAM1P,EAAI,CACpD,OAAOugC,EAAQ7wB,EAAM1P,EAAI,OAAO,CACjC,EACD,kBAAmB,SAAuB0P,EAAM1P,EAAI,CAClD,OAAOugC,EAAQ7wB,EAAM1P,EAAI,OAAO,EAAE,QAAO,CAC1C,EACD,mCAAoC,SAAmC0P,EAAMpB,EAAQtO,EAAI,CACvF,OAAOugC,EAAQ7wB,EAAM1P,EAAIsO,CAAM,CAChC,EACD,2CAA4C,SAAyCoB,EAAMpB,EAAQ+d,EAAUrsB,EAAI,CAC/G,OAAOugC,EAAQ7wB,EAAM1P,EAAIsO,EAAQ+d,CAAQ,CAC1C,CACL,CAAG,EACD,SAASkU,EAAQ7wB,EAAM1P,EAAIsO,EAAQ+d,EAAU,CAC3C,IAAIlM,EACJ,OAAIkM,IAAa,OACflM,EAAIhD,EAAO7O,EAAQ+d,CAAQ,EAE3BlM,EAAIhD,EAAO7O,CAAM,EAEnB6R,EAAE,OAAOzQ,CAAI,EACbyQ,EAAE,QAAQ,SAAUugB,EAAGp9B,EAAO,CAC5B,IAAI+uB,EAAMryB,EAAGsD,CAAK,EACdq3B,EAAOtI,CAAG,GACdlS,EAAE,IAAI7c,EAAO+uB,CAAG,CACtB,CAAK,EACMlS,CACR,CACH,CAAC,EACDqgB,GAAA,yBAAmCC,aC5EnC,OAAO,eAAeE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAIvkB,GAAWhlB,EACf,SAASqjB,GAA2BtjB,EAAGujB,EAAgB,CAAE,IAAIC,EAAK,OAAO,OAAW,KAAexjB,EAAE,OAAO,QAAQ,GAAKA,EAAE,YAAY,EAAG,GAAI,CAACwjB,EAAI,CAAE,GAAI,MAAM,QAAQxjB,CAAC,IAAMwjB,EAAKC,GAA4BzjB,CAAC,IAAMujB,GAAkBvjB,GAAK,OAAOA,EAAE,QAAW,SAAU,CAAMwjB,IAAIxjB,EAAIwjB,GAAI,IAAI9jB,EAAI,EAAOgkB,EAAI,UAAa,GAAI,MAAO,CAAE,EAAGA,EAAG,EAAG,UAAa,CAAE,OAAIhkB,GAAKM,EAAE,OAAe,CAAE,KAAM,EAAI,EAAW,CAAE,KAAM,GAAO,MAAOA,EAAEN,GAAG,EAAI,EAAI,EAAG,SAAWikB,EAAI,CAAE,MAAMA,CAAG,EAAI,EAAGD,CAAG,CAAG,CAAC,MAAM,IAAI,UAAU;AAAA,mFAAuI,CAAI,CAAC,IAAIE,EAAmB,GAAMC,EAAS,GAAOlX,EAAK,MAAO,CAAE,EAAG,UAAa,CAAE6W,EAAKA,EAAG,KAAKxjB,CAAC,CAAE,EAAI,EAAG,UAAa,CAAE,IAAI8jB,EAAON,EAAG,KAAM,EAAE,OAAAI,EAAmBE,EAAK,KAAaA,CAAO,EAAE,EAAG,SAAWC,EAAK,CAAEF,EAAS,GAAMlX,EAAMoX,CAAM,EAAE,EAAG,UAAa,CAAE,GAAI,CAAM,CAACH,GAAoBJ,EAAG,QAAa,MAAMA,EAAG,OAAS,CAAG,QAAW,CAAE,GAAIK,EAAQ,MAAMlX,CAAI,CAAI,CAAA,CAAK,CAC5+B,SAAS8W,GAA4BzjB,EAAGwe,EAAQ,CAAE,GAAKxe,EAAW,IAAI,OAAOA,GAAM,SAAU,OAAOgkB,GAAkBhkB,EAAGwe,CAAM,EAAG,IAAI,EAAI,OAAO,UAAU,SAAS,KAAKxe,CAAC,EAAE,MAAM,EAAG,EAAE,EAAgE,GAAzD,IAAM,UAAYA,EAAE,cAAa,EAAIA,EAAE,YAAY,MAAU,IAAM,OAAS,IAAM,MAAO,OAAO,MAAM,KAAKA,CAAC,EAAG,GAAI,IAAM,aAAe,2CAA2C,KAAK,CAAC,EAAG,OAAOgkB,GAAkBhkB,EAAGwe,CAAM,EAAI,CACha,SAASwF,GAAkB3O,EAAK3Q,EAAK,EAAMA,GAAO,MAAQA,EAAM2Q,EAAI,UAAQ3Q,EAAM2Q,EAAI,QAAQ,QAAS3V,EAAI,EAAGukB,EAAO,IAAI,MAAMvf,CAAG,EAAGhF,EAAIgF,EAAKhF,IAAOukB,EAAKvkB,CAAC,EAAI2V,EAAI3V,CAAC,EAAK,OAAOukB,CAAO,CACvL,IAAIxd,GAAO,iBACPia,GAAe,CAAC,QAAS,SAAU,UAAW,MAAM,EACpD+oB,MAA0CxkB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAClG,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdzI,EAAUyI,EAAK,QACf/M,EAAO+M,EAAK,KAuBd,OAAO3d,EAAMlB,GAAM,CACjB,WAAY,SAAe4O,EAAK,CAC9B,OAAOq0B,EAAar0B,CAAG,CACxB,EACD,YAAa,SAAgBA,EAAK,CAChC,OAAO2Q,EAAO0jB,EAAar0B,EAAI,IAAI,SAAU2T,EAAG,CAC9C,OAAOA,EAAE,SACV,CAAA,CAAC,CAAC,CACJ,CAGL,CAAG,EAED,SAAS0gB,EAAar0B,EAAK,CACzB,GAAIA,EAAI,SAAW,EAAG,MAAM,IAAI,UAAU,mDAAmD,EAC7F,IAAI8d,EAAIwW,EAA+Bt0B,EAAI,CAAC,CAAC,EACzC6C,EAAS,CAAA,EACTkM,EAAYd,GAA2BjO,CAAG,EAC5CgP,EACF,GAAI,CACF,IAAKD,EAAU,EAAC,EAAI,EAAEC,EAAQD,EAAU,EAAG,GAAE,MAAO,CAClD,IAAIoV,EAAMnV,EAAM,MACZulB,EAAYD,EAA+BnQ,CAAG,EAClD,GAAIoQ,IAAczW,EAChB,MAAM,IAAI,UAAU,sCAAwCA,EAAI,GAAK,OAASyW,EAAY,EAAE,EAE9F1xB,EAAO,KAAK2E,EAAQ2c,CAAG,CAAC,CACzB,CACF,OAAQ7sB,EAAK,CACZyX,EAAU,EAAEzX,CAAG,CACrB,QAAc,CACRyX,EAAU,EAAC,CACZ,CACD,OAAOlM,CACR,CACD,SAASyxB,EAA+BE,EAAK,CAC3C,IAAIn/B,EAAI6N,EAAKsxB,CAAG,EAChB,GAAIn/B,EAAE,SAAW,EAEf,OAAOA,EAAE,CAAC,EACL,GAAIA,EAAE,SAAW,EAAG,CAEzB,GAAIA,EAAE,CAAC,IAAM,EAEX,OAAOA,EAAE,CAAC,EACL,GAAIA,EAAE,CAAC,IAAM,EAElB,OAAOA,EAAE,CAAC,EAEV,MAAM,IAAI,UAAU,gDAAgD,CAE5E,KACM,OAAM,IAAI,UAAU,qDAAqD,CAE5E,CACH,CAAC,EACD8+B,GAAA,qBAA+BC,aC7F/B,OAAO,eAAeK,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC8BA,GAAA,wBAAG,OAClC,IAAI7kB,GAAWhlB,EACf,SAASqjB,GAA2BtjB,EAAGujB,EAAgB,CAAE,IAAIC,EAAK,OAAO,OAAW,KAAexjB,EAAE,OAAO,QAAQ,GAAKA,EAAE,YAAY,EAAG,GAAI,CAACwjB,EAAI,CAAE,GAAI,MAAM,QAAQxjB,CAAC,IAAMwjB,EAAKC,GAA4BzjB,CAAC,IAAMujB,GAAkBvjB,GAAK,OAAOA,EAAE,QAAW,SAAU,CAAMwjB,IAAIxjB,EAAIwjB,GAAI,IAAI9jB,EAAI,EAAOgkB,EAAI,UAAa,GAAI,MAAO,CAAE,EAAGA,EAAG,EAAG,UAAa,CAAE,OAAIhkB,GAAKM,EAAE,OAAe,CAAE,KAAM,EAAI,EAAW,CAAE,KAAM,GAAO,MAAOA,EAAEN,GAAG,EAAI,EAAI,EAAG,SAAWikB,EAAI,CAAE,MAAMA,CAAG,EAAI,EAAGD,CAAG,CAAG,CAAC,MAAM,IAAI,UAAU;AAAA,mFAAuI,CAAI,CAAC,IAAIE,EAAmB,GAAMC,EAAS,GAAOlX,EAAK,MAAO,CAAE,EAAG,UAAa,CAAE6W,EAAKA,EAAG,KAAKxjB,CAAC,CAAE,EAAI,EAAG,UAAa,CAAE,IAAI8jB,EAAON,EAAG,KAAM,EAAE,OAAAI,EAAmBE,EAAK,KAAaA,CAAO,EAAE,EAAG,SAAWC,EAAK,CAAEF,EAAS,GAAMlX,EAAMoX,CAAM,EAAE,EAAG,UAAa,CAAE,GAAI,CAAM,CAACH,GAAoBJ,EAAG,QAAa,MAAMA,EAAG,OAAS,CAAG,QAAW,CAAE,GAAIK,EAAQ,MAAMlX,CAAI,CAAI,CAAA,CAAK,CAC5+B,SAAS8W,GAA4BzjB,EAAGwe,EAAQ,CAAE,GAAKxe,EAAW,IAAI,OAAOA,GAAM,SAAU,OAAOgkB,GAAkBhkB,EAAGwe,CAAM,EAAG,IAAI,EAAI,OAAO,UAAU,SAAS,KAAKxe,CAAC,EAAE,MAAM,EAAG,EAAE,EAAgE,GAAzD,IAAM,UAAYA,EAAE,cAAa,EAAIA,EAAE,YAAY,MAAU,IAAM,OAAS,IAAM,MAAO,OAAO,MAAM,KAAKA,CAAC,EAAG,GAAI,IAAM,aAAe,2CAA2C,KAAK,CAAC,EAAG,OAAOgkB,GAAkBhkB,EAAGwe,CAAM,EAAI,CACha,SAASwF,GAAkB3O,EAAK3Q,EAAK,EAAMA,GAAO,MAAQA,EAAM2Q,EAAI,UAAQ3Q,EAAM2Q,EAAI,QAAQ,QAAS3V,EAAI,EAAGukB,EAAO,IAAI,MAAMvf,CAAG,EAAGhF,EAAIgF,EAAKhF,IAAOukB,EAAKvkB,CAAC,EAAI2V,EAAI3V,CAAC,EAAK,OAAOukB,CAAO,CACvL,IAAIxd,GAAO,oBACPia,GAAe,CAAC,QAAS,SAAU,UAAW,MAAM,EACpDqpB,MAA6C9kB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACrG,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdzI,EAAUyI,EAAK,QACf/M,EAAO+M,EAAK,KAuBd,OAAO3d,EAAMlB,GAAM,CACjB,WAAY,SAAe4O,EAAK,CAC9B,OAAOq0B,EAAar0B,CAAG,CACxB,EACD,YAAa,SAAgBA,EAAK,CAChC,OAAO2Q,EAAO0jB,EAAar0B,EAAI,IAAI,SAAU2T,EAAG,CAC9C,OAAOA,EAAE,SACV,CAAA,CAAC,CAAC,CACJ,CAGL,CAAG,EAED,SAAS0gB,EAAar0B,EAAK,CACzB,GAAIA,EAAI,SAAW,EAAG,MAAM,IAAI,UAAU,sDAAsD,EAKhG,QAJI8d,EAAIwW,EAA+Bt0B,EAAI,CAAC,CAAC,EAGzC6C,EAAS,CAAA,EACJxY,EAAI,EAAGA,EAAIyzB,EAAGzzB,IACrBwY,EAAOxY,CAAC,EAAI,GAId,IAAI0kB,EAAYd,GAA2BjO,CAAG,EAC5CgP,EACF,GAAI,CACF,IAAKD,EAAU,EAAC,EAAI,EAAEC,EAAQD,EAAU,EAAG,GAAE,MAAO,CAClD,IAAIuV,EAAMtV,EAAM,MACZ2lB,EAAYL,EAA+BhQ,CAAG,EAClD,GAAIqQ,IAAc7W,EAChB,MAAM,IAAI,UAAU,sCAAwCA,EAAI,GAAK,OAAS6W,EAAY,EAAE,EAK9F,QAHIlkB,EAAIjJ,EAAQ8c,CAAG,EAGVlV,EAAK,EAAGA,EAAK0O,EAAG1O,IACvBvM,EAAOuM,CAAE,EAAE,KAAKqB,EAAErB,CAAE,CAAC,CAExB,CACF,OAAQ9X,EAAK,CACZyX,EAAU,EAAEzX,CAAG,CACrB,QAAc,CACRyX,EAAU,EAAC,CACZ,CACD,OAAOlM,CACR,CACD,SAASyxB,EAA+BE,EAAK,CAC3C,IAAIn/B,EAAI6N,EAAKsxB,CAAG,EAChB,GAAIn/B,EAAE,SAAW,EAEf,OAAOA,EAAE,CAAC,EACL,GAAIA,EAAE,SAAW,EAAG,CAEzB,GAAIA,EAAE,CAAC,IAAM,EAEX,OAAOA,EAAE,CAAC,EACL,GAAIA,EAAE,CAAC,IAAM,EAElB,OAAOA,EAAE,CAAC,EAEV,MAAM,IAAI,UAAU,gDAAgD,CAE5E,KACM,OAAM,IAAI,UAAU,qDAAqD,CAE5E,CACH,CAAC,EACDo/B,GAAA,wBAAkCC,aCzGlC,OAAO,eAAeE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIhlB,GAAWhlB,EACXwG,GAAO,YACPia,GAAe,CAAC,OAAO,EACvBwpB,MAAqCjlB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC7F,IAAI3d,EAAQ2d,EAAK,MAoBjB,OAAO3d,EAAMlB,GAAM,CACjB,cAAe,SAAmB6hC,EAAML,EAAO,CAC7C,OAAOK,EAAK,UAAUL,CAAK,CAC5B,CACL,CAAG,CACH,CAAC,EACDgC,GAAA,gBAA0BC,aClC1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIllB,GAAWhlB,EACX47B,GAAcj5B,GACdogC,GAAS7+B,GACTsC,GAAO,aACPia,GAAe,CAAC,OAAO,EACvB0pB,MAAsCnlB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC9F,IAAI3d,EAAQ2d,EAAK,MAwBjB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQu8B,GAAO,iBACf,iCAAkC,SAAkCngC,EAAG,CACrE,OAAOA,EAAE,KACV,EACD,KAAM8E,EAAM,YAAY,SAAUkK,EAAM,CACtC,OAAO,SAAUhP,EAAG,CAClB,IAAIoxB,EAAMpxB,EAAE,QACZ,OAAAoxB,EAAI,MAAQtsB,EAAM,KAAKkK,EAAMoiB,EAAI,WAAW,EAAEpxB,EAAE,KAAK,EAC9CoxB,CACf,CACA,CAAK,EAED,iBAAkBtsB,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,EAAM,EAAI,CACrD,CACA,CAAK,CAGL,CAAG,CACH,CAAC,EACDs4B,GAAA,iBAA2BC,aCxD3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIplB,GAAWhlB,EACX47B,GAAcj5B,GACdogC,GAAS7+B,GACTsC,GAAO,YACPia,GAAe,CAAC,QAAS,SAAU,WAAW,EAC9C4pB,MAAqCrlB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC7F,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdC,EAAYD,EAAK,UAyBnB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQu8B,GAAO,gBACf,QAAS,SAAiBngC,EAAG,CAC3B,OAAOA,CACR,EAED,UAAW,SAAmBA,EAAG,CAC/B,OAAOA,CACR,EAED,SAAU,SAAkBA,EAAG,CAC7B,OAAOA,CACR,EAED,KAAM,SAAcA,EAAG,CACrB,OAAOA,EAAE,OACV,EAED,iBAAkB8E,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,EAAM,EAAI,CACrD,CACA,CAAK,EACD,mBAAoB,SAAuBhP,EAAG,CAE5C,OAAOhD,EAAO,SAAW,YAAc,IAAI0lB,EAAU,CAAC1iB,CAAC,EAAI,CAACA,CAC7D,CACL,CAAG,CACH,CAAC,EACDwnC,GAAA,gBAA0BC,aClE1B,OAAO,eAAexa,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAI7K,GAAWhlB,EACX47B,GAAcj5B,GACdogC,GAAS7+B,GACTsC,GAAO,MACPia,GAAe,CAAC,OAAO,EACvB6pB,MAA+BtlB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MAyBjB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQu8B,GAAO,UACf,wCAAyC,SAAsCngC,EAAG,CAChF,OAAOA,EAAE,KACV,EAED,iBAAkB8E,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,EAAM,EAAI,CACrD,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACDie,GAAA,UAAoBya,aChDpB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIvlB,GAAWhlB,EACXwgB,GAAS7d,GACTsB,GAAMC,GACN0Z,GAAcjX,GACdH,GAAO,QACPia,GAAe,CAAC,QAAS,WAAW,EACpC+pB,MAAiCxlB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MACflO,EAAYkO,EAAK,UAiCnB,OAAO3d,EAAMlB,GAAM,CACjB,+CAAgD,SAA4C4zB,EAAKtc,EAAKzZ,EAAU,CAC9G,GAAI,CAAC8S,EAAU2G,CAAG,EAChB,MAAM,IAAI,UAAU,uCAAuC,EAE7D,IAAIxF,EAAO,MAAM,QAAQ8hB,CAAG,KAAQ5Z,GAAO,WAAW4Z,CAAG,EAAIA,EAAI,KAAI,EACrE,GAAItc,EAAM,GAAKA,GAAOxF,EAAK,OACzB,MAAM,IAAIsF,GAAY,WAAWE,EAAKxF,EAAK,MAAM,EAEnD,SAAQrU,GAAI,UAAUm2B,CAAG,EAChBA,EAAI,OAAOqQ,GAAOrQ,EAAI,UAAWtc,EAAKzZ,CAAQ,CAAC,EAE/ComC,GAAOrQ,EAAKtc,EAAKzZ,CAAQ,CAEnC,CACL,CAAG,CACH,CAAC,EAUkBkmC,GAAA,YAAGC,GACtB,SAASC,GAAOrQ,EAAKtc,EAAKzZ,EAAU,CAClC,IAAI5E,EAAG86B,EAAKW,EACZ,GAAIpd,GAAO,EACT,GAAK,MAAM,QAAQsc,EAAI,CAAC,CAAC,EAElB,CAGL,IAFAc,EAAOf,GAAQC,CAAG,EAClBG,EAAM,CAAA,EACD96B,EAAI,EAAGA,EAAIy7B,EAAK,OAAQz7B,IAC3B86B,EAAI96B,CAAC,EAAIgrC,GAAOvP,EAAKz7B,CAAC,EAAGqe,EAAM,EAAGzZ,CAAQ,EAE5C,OAAOk2B,CACR,KARC,QAAOl2B,EAAS+1B,CAAG,MAShB,CAEL,IADAG,EAAM,CAAA,EACD96B,EAAI,EAAGA,EAAI26B,EAAI,OAAQ36B,IAC1B86B,EAAI96B,CAAC,EAAIgrC,GAAOrQ,EAAI36B,CAAC,EAAGqe,EAAM,EAAGzZ,CAAQ,EAE3C,OAAOk2B,CACR,CACH,CAQA,SAASJ,GAAQC,EAAK,CACpB,IAAIC,EAAID,EAAI,OACRE,EAAIF,EAAI,CAAC,EAAE,OACX36B,EAAG2oB,EACHmS,EAAM,CAAA,EACV,IAAKnS,EAAI,EAAGA,EAAIkS,EAAGlS,IAAK,CACtB,IAAIoS,EAAM,CAAA,EACV,IAAK/6B,EAAI,EAAGA,EAAI46B,EAAG56B,IACjB+6B,EAAI,KAAKJ,EAAI36B,CAAC,EAAE2oB,CAAC,CAAC,EAEpBmS,EAAI,KAAKC,CAAG,CACb,CACD,OAAOD,CACT,WCjHA,OAAO,eAAemQ,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAI1lB,GAAWhlB,EACX+iC,GAASpgC,GACT6D,GAAO,YACPia,GAAe,CAAC,OAAO,EACvBkqB,MAAqC3lB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC7F,IAAI3d,EAAQ2d,EAAK,MAajB,OAAO3d,EAAMlB,GAAM,CACjB,iBAAkBu8B,GAAO,UACzB,mBAAoB,SAAwBngC,EAAGqX,EAAG,CAChD,OAAOrX,EAAE,IAAIqX,CAAC,CACf,EACD,uBAAwB,SAA4BrX,EAAGqX,EAAG,CACxD,OAAOrX,EAAE,KAAKqX,CAAC,CAChB,EACD,qBAAsB,SAA0BrX,EAAGqX,EAAG,CACpD,OAAOrX,EAAE,IAAIqX,CAAC,CACf,EACD,aAAcvS,EAAM,YAAY,SAAUkK,EAAM,CAC9C,OAAO,SAAUhP,EAAGqX,EAAG,CACrB,GAAIrX,EAAE,QAAU,MAAQA,EAAE,QAAU,OAClC,MAAM,IAAI,MAAM,kDAAkD,EAEpE,GAAIqX,EAAE,QAAU,MAAQA,EAAE,QAAU,OAClC,MAAM,IAAI,MAAM,kDAAkD,EAEpE,GAAI,CAACrX,EAAE,UAAUqX,CAAC,EAAG,MAAM,IAAI,MAAM,oBAAoB,EACzD,IAAI+Z,EAAMpxB,EAAE,QACZ,OAAAoxB,EAAI,MAAQtsB,EAAM,KAAKkK,EAAM,CAACoiB,EAAI,UAAS,EAAI/Z,EAAE,UAAW,CAAA,CAAC,EAAE+Z,EAAI,MAAO/Z,EAAE,KAAK,EACjF+Z,EAAI,UAAY,GACTA,CACf,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACD0W,GAAA,gBAA0BC,aClD1B,OAAO,eAAe5yB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIiN,GAAWhlB,EACXiE,GAAMtB,GACNogC,GAAS7+B,GACTsC,GAAO,OACPia,GAAe,CAAC,SAAU,QAAS,aAAc,aAAc,SAAU,UAAW,YAAa,UAAU,EAC3GmqB,MAAgC5lB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACxF,IAAIzlB,EAASylB,EAAK,OAChB3d,EAAQ2d,EAAK,MACbyd,EAAazd,EAAK,WAClB6kB,EAAa7kB,EAAK,WAClBU,EAASV,EAAK,OACdE,EAAUF,EAAK,QACfC,EAAYD,EAAK,UACjBI,EAAWJ,EAAK,SA0ClB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQu8B,GAAO,WAIf,QAAS8H,EACT,mBAAoBA,EACpB,UAAW,SAAmBjoC,EAAG,CAC/B,OAAOA,EAAE,MACV,EACD,KAAMkoC,CACV,CAAG,EAWD,SAASD,EAAajoC,EAAGmoC,EAAU,CAGjC,IAAIC,EAAOpoC,EAAE,IAAG,EAAK,EACjBitB,EAAMjtB,EAAE,MAGRqoC,EAAY,IAAI1lB,KAAYwd,GAAO,YAAYlT,CAAG,EAAG,CAAC,EAAE,IAAI,IAAItK,EAAQ,EAAGylB,CAAI,EAAE,IAAG,CAAE,EAC1F,GAAID,EAAU,CACZ,IAAIG,EAAM,CAACD,EAAW,IAAI1lB,KAAYwd,GAAO,YAAYlT,CAAG,EAAG,CAAC,EAAE,IAAI,IAAItK,EAAQ,EAAGylB,EAAO,KAAK,GAAK,EAAI,CAAC,EAAE,IAAK,CAAA,EAAG,IAAIzlB,KAAYwd,GAAO,YAAYlT,CAAG,EAAG,CAAC,EAAE,IAAI,IAAItK,EAAQ,EAAGylB,EAAO,KAAK,GAAK,EAAI,CAAC,EAAE,IAAK,CAAA,CAAC,EAClN,OAAOprC,EAAO,SAAW,QAAUsrC,EAAMnlB,EAAOmlB,CAAG,CACzD,KACM,QAAOD,CAEV,CAQD,SAASH,EAAUloC,EAAG,CACpB,GAAIA,EAAE,UAAaqB,GAAI,WAAWrB,EAAE,KAAK,EAAG,CAC1C,IAAIqV,EAASrV,EAAE,QACf,OAAAqV,EAAO,MAAQ,EACfA,EAASA,EAAO,IAAI,EAAM,CAAC,EAC3BA,EAAO,MAAQ4yB,EAAajoC,EAAE,KAAK,EAC5BqV,CACb,KAAW,CACL,IAAID,EAAS8qB,EAAWlgC,EAAE,KAAK,EAC3BoV,IACFpV,EAAE,MAAQsnC,EAAWtnC,EAAE,KAAK,GAI9B,IAAIuoC,KACIlnC,GAAI,aAAarB,EAAE,KAAK,EAC9BuoC,EAAQ,IAAI7lB,EAAU,CAAC,EAAE,IAAI,CAAC,KACjBrhB,GAAI,YAAYrB,EAAE,KAAK,EACpCuoC,EAAQ,IAAI1lB,EAAS,EAAG,CAAC,EAEzB0lB,EAAQ,EAAI,EAEd,IAAIC,EAAUxoC,EAAE,IAAIuoC,CAAK,EACzB,OAAInzB,IACFozB,EAAQ,MAAQlB,EAAWkB,EAAQ,KAAK,GAEnCA,CACR,CACF,CACH,CAAC,EACDrzB,GAAA,WAAqB6yB,2FCvIrB,SAASS,EAAgBj2B,EAAK,CAC5B,GAAI,MAAM,QAAQA,CAAG,EAAG,OAAOA,CAChC,CACD9V,EAAA,QAAiB+rC,EAAiB/rC,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,2FCHvG,SAASgsC,EAAsB5pB,EAAGkU,EAAG,CACnC,IAAI7yB,EAAY2e,GAAR,KAAY,KAAsB,OAAO,OAAtB,KAAgCA,EAAE,OAAO,QAAQ,GAAKA,EAAE,YAAY,EAC/F,GAAY3e,GAAR,KAAW,CACb,IAAI8V,EACFT,EACA3Y,EACAiwB,EACAprB,EAAI,CAAE,EACNuhB,EAAI,GACJ9lB,EAAI,GACN,GAAI,CACF,GAAIN,GAAKsD,EAAIA,EAAE,KAAK2e,CAAC,GAAG,KAAYkU,IAAN,EAAS,CACrC,GAAI,OAAO7yB,CAAC,IAAMA,EAAG,OACrB8iB,EAAI,EACZ,KAAa,MAAO,EAAEA,GAAKhN,EAAIpZ,EAAE,KAAKsD,CAAC,GAAG,QAAUuB,EAAE,KAAKuU,EAAE,KAAK,EAAGvU,EAAE,SAAWsxB,GAAI/P,EAAI,GAAG,CACxF,OAAQnE,EAAG,CACV3hB,EAAI,GAAIqY,EAAIsJ,CAClB,QAAc,CACR,GAAI,CACF,GAAI,CAACmE,GAAa9iB,EAAE,QAAV,OAAwB2sB,EAAI3sB,EAAE,OAAW,EAAE,OAAO2sB,CAAC,IAAMA,GAAI,MAC/E,QAAgB,CACR,GAAI3vB,EAAG,MAAMqY,CACd,CACF,CACD,OAAO9T,CACR,CACF,CACDhF,EAAA,QAAiBgsC,EAAuBhsC,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,2GC3B7G,SAASykB,EAAkB3O,EAAK3Q,EAAK,EAC/BA,GAAO,MAAQA,EAAM2Q,EAAI,UAAQ3Q,EAAM2Q,EAAI,QAC/C,QAAS3V,EAAI,EAAGukB,EAAO,IAAI,MAAMvf,CAAG,EAAGhF,EAAIgF,EAAKhF,IAAKukB,EAAKvkB,CAAC,EAAI2V,EAAI3V,CAAC,EACpE,OAAOukB,CACR,CACD1kB,EAAA,QAAiBykB,EAAmBzkB,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,2ECLzG,IAAIisC,EAAmBvrC,KACvB,SAASwjB,EAA4BzjB,EAAGwe,EAAQ,CAC9C,GAAKxe,EACL,IAAI,OAAOA,GAAM,SAAU,OAAOwrC,EAAiBxrC,EAAGwe,CAAM,EAC5D,IAAInG,EAAI,OAAO,UAAU,SAAS,KAAKrY,CAAC,EAAE,MAAM,EAAG,EAAE,EAErD,GADIqY,IAAM,UAAYrY,EAAE,cAAaqY,EAAIrY,EAAE,YAAY,MACnDqY,IAAM,OAASA,IAAM,MAAO,OAAO,MAAM,KAAKrY,CAAC,EACnD,GAAIqY,IAAM,aAAe,2CAA2C,KAAKA,CAAC,EAAG,OAAOmzB,EAAiBxrC,EAAGwe,CAAM,EAC/G,CACDjf,EAAA,QAAiBkkB,EAA6BlkB,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,2FCTnH,SAASksC,GAAmB,CAC1B,MAAM,IAAI,UAAU;AAAA,mFAA2I,CAChK,CACDlsC,EAAA,QAAiBksC,EAAkBlsC,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,2ECHxG,IAAImsC,EAAiBzrC,KACjB0rC,EAAuB/oC,KACvBgpC,EAA6BznC,KAC7B0nC,EAAkBjlC,KACtB,SAASklC,EAAez2B,EAAK3V,EAAG,CAC9B,OAAOgsC,EAAer2B,CAAG,GAAKs2B,EAAqBt2B,EAAK3V,CAAC,GAAKksC,EAA2Bv2B,EAAK3V,CAAC,GAAKmsC,EAAe,CACpH,CACDtsC,EAAA,QAAiBusC,EAAgBvsC,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,mCCLtG,OAAO,eAAewsC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAI9mB,GAAWhlB,EACXwG,GAAO,gBACPia,GAAe,CAAC,QAAS,aAAa,EACtCsrB,MAAyC/mB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACjG,IAAI3d,EAAQ2d,EAAK,MACf4e,EAAc5e,EAAK,YAoBrB,OAAO,SAAuB5a,EAAGlG,EAAGF,EAAUg3B,EAAS,CAErD,IAAIE,EAAU9wB,EAAE,QACZ+wB,EAAS/wB,EAAE,OACXgxB,EAAOhxB,EAAE,KACTuhC,EAAQvhC,EAAE,MACVwhC,EAAMxhC,EAAE,UAGZ,GAAI,CAAC8wB,EACH,MAAM,IAAI,MAAM,oEAAoE,EAItF,IAAI1B,EAAOmS,EAAM,CAAC,EACdlS,EAAUkS,EAAM,CAAC,EAGjBE,EAEAvH,EAAKV,EAELW,EAAO,EAEPuH,EAAK9nC,EAGL,OAAO4nC,GAAQ,WAEjBC,EAAKD,EAELtH,EAAKj9B,EAAM,KAAKu8B,EAAa,CAACiI,EAAIA,CAAE,CAAC,EAErCtH,EAAOl9B,EAAM,QAAQ,EAAGwkC,CAAE,EAE1B3nC,EAAImD,EAAM,QAAQnD,EAAG2nC,CAAE,EAEvBC,EAAKzkC,EAAM,KAAKrD,EAAU,CAAC6nC,EAAIA,CAAE,CAAC,GASpC,QALIE,EAAU,CAAA,EACVhR,EAAS,CAAA,EACTiR,EAAO,CAAA,EAGFjkB,EAAI,EAAGA,EAAI0R,EAAS1R,IAAK,CAEhCikB,EAAKjkB,CAAC,EAAIgT,EAAO,OAEjB,QAASM,EAAKD,EAAKrT,CAAC,EAAGuT,EAAKF,EAAKrT,EAAI,CAAC,EAAGF,EAAIwT,EAAIxT,EAAIyT,EAAIzT,IAAK,CAE5D,IAAIzoB,EAAI+7B,EAAOtT,CAAC,EAEZmI,EAAIgL,EAAU8Q,EAAG5nC,EAAGg3B,EAAQrT,CAAC,CAAC,EAAIikB,EAAG5Q,EAAQrT,CAAC,EAAG3jB,CAAC,EAEjDogC,EAAGtU,EAAGuU,CAAI,IAEbxJ,EAAO,KAAK37B,CAAC,EACb2sC,EAAQ,KAAK/b,CAAC,EAEjB,CACF,CAED,OAAAgc,EAAKvS,CAAO,EAAIsB,EAAO,OAGhB3wB,EAAE,mBAAmB,CAC1B,OAAQ2hC,EACR,MAAOhR,EACP,IAAKiR,EACL,KAAM,CAACxS,EAAMC,CAAO,EACpB,SAAUoS,CAChB,CAAK,CACL,CACA,CAAC,EACDJ,GAAA,oBAA8BC,aCzG9B,OAAO,eAAeO,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAItnB,GAAWhlB,EACXwG,GAAO,gBACPia,GAAe,CAAC,QAAS,aAAa,EACtC8rB,MAAyCvnB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACjG,IAAI3d,EAAQ2d,EAAK,MACfG,EAAcH,EAAK,YAoBrB,OAAO,SAAuB5a,EAAGlG,EAAGF,EAAUg3B,EAAS,CAErD,IAAIE,EAAU9wB,EAAE,QACZ+wB,EAAS/wB,EAAE,OACXgxB,EAAOhxB,EAAE,KACTuhC,EAAQvhC,EAAE,MACVwhC,EAAMxhC,EAAE,UAGZ,GAAI,CAAC8wB,EACH,MAAM,IAAI,MAAM,oEAAoE,EAItF,IAAI1B,EAAOmS,EAAM,CAAC,EACdlS,EAAUkS,EAAM,CAAC,EAGjBE,EAEAC,EAAK9nC,EAGL,OAAO4nC,GAAQ,WAEjBC,EAAKD,EAEL1nC,EAAImD,EAAM,QAAQnD,EAAG2nC,CAAE,EAEvBC,EAAKzkC,EAAM,KAAKrD,EAAU,CAAC6nC,EAAIA,CAAE,CAAC,GAYpC,QARIM,EAAQ,CAAA,EAGR5pC,EAAI,CAAA,EAEJypB,EAAI,CAAA,EAGCjE,EAAI,EAAGA,EAAI0R,EAAS1R,IAAK,CAIhC,QAFI+S,EAAO/S,EAAI,EAENsT,EAAKD,EAAKrT,CAAC,EAAGuT,EAAKF,EAAKrT,EAAI,CAAC,EAAGF,EAAIwT,EAAIxT,EAAIyT,EAAIzT,IAAK,CAE5D,IAAIxG,EAAI8Z,EAAOtT,CAAC,EAEhBtlB,EAAE8e,CAAC,EAAI6Z,EAAQrT,CAAC,EAChBmE,EAAE3K,CAAC,EAAIyZ,CACR,CAED,QAAS17B,EAAI,EAAGA,EAAIo6B,EAAMp6B,IAEpB2oB,IAAM,IAERokB,EAAM/sC,CAAC,EAAI,IAGT4sB,EAAE5sB,CAAC,IAAM07B,EAEXqR,EAAM/sC,CAAC,EAAE2oB,CAAC,EAAIiT,EAAU8Q,EAAG5nC,EAAG3B,EAAEnD,CAAC,CAAC,EAAI0sC,EAAGvpC,EAAEnD,CAAC,EAAG8E,CAAC,EAGhDioC,EAAM/sC,CAAC,EAAE2oB,CAAC,EAAIiT,EAAU8Q,EAAG5nC,EAAG,CAAC,EAAI4nC,EAAG,EAAG5nC,CAAC,CAG/C,CAGD,OAAO,IAAIihB,EAAY,CACrB,KAAMgnB,EACN,KAAM,CAAC3S,EAAMC,CAAO,EACpB,SAAUoS,CAChB,CAAK,CACL,CACA,CAAC,EACDI,GAAA,oBAA8BC,aC3G9B,OAAO,eAAeE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIznB,GAAWhlB,EACX0F,GAAU/C,GACV6D,GAAO,eACPia,GAAe,CAAC,OAAO,EACvBisB,MAAwC1nB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAChG,IAAI3d,EAAQ2d,EAAK,MAgBjB,OAAO,SAAsB,EAAG9gB,EAAGF,EAAUg3B,EAAS,CAEpD,IAAIsR,EAAQ,EAAE,MACVX,EAAQ,EAAE,MACVC,EAAM,EAAE,UAGRC,EAEAC,EAAK9nC,EAGL,OAAO4nC,GAAQ,WAEjBC,EAAKD,EAEL1nC,EAAImD,EAAM,QAAQnD,EAAG2nC,CAAE,EAEvBC,EAAKzkC,EAAM,KAAKrD,EAAU,CAAC6nC,EAAIA,CAAE,CAAC,GAIpC,IAAIM,EAAQR,EAAM,OAAS,EAAIY,EAAST,EAAI,EAAGH,EAAOA,EAAM,CAAC,EAAGW,EAAOpoC,EAAG82B,CAAO,EAAI,GAGrF,OAAO,EAAE,kBAAkB,CACzB,KAAMmR,EACN,QAAU9mC,GAAQ,OAAOsmC,CAAK,EAC9B,SAAUE,CAChB,CAAK,CACL,EAGE,SAASU,EAAS/mB,EAAGgnB,EAAOpiC,EAAG2N,EAAG00B,EAAIC,EAAI1R,EAAS,CAEjD,IAAI2R,EAAK,CAAA,EAET,GAAIH,IAAUpiC,EAAE,OAAS,EAEvB,QAAShL,EAAI,EAAGA,EAAI2Y,EAAG3Y,IAErButC,EAAGvtC,CAAC,EAAI47B,EAAUxV,EAAEknB,EAAID,EAAGrtC,CAAC,CAAC,EAAIomB,EAAEinB,EAAGrtC,CAAC,EAAGstC,CAAE,MAI9C,SAAS3kB,EAAI,EAAGA,EAAIhQ,EAAGgQ,IAErB4kB,EAAG5kB,CAAC,EAAIwkB,EAAS/mB,EAAGgnB,EAAQ,EAAGpiC,EAAGA,EAAEoiC,EAAQ,CAAC,EAAGC,EAAG1kB,CAAC,EAAG2kB,EAAI1R,CAAO,EAGtE,OAAO2R,CACR,CACH,CAAC,EACDP,GAAA,mBAA6BC,GC9E7B,IAAIttC,GAAyBY,GAC7B,OAAO,eAAemwB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACDA,GAAA,iBAA2BA,GAAA,WAAqB,OAChD,IAAI8c,GAAkB7tC,GAAuBuD,GAAA,CAA+C,EACxF6uB,GAAWpyB,GAAuB8E,GAAA,CAAqB,EACvD8gB,GAAWre,EACXi1B,GAAclgB,GACdb,GAAUqK,GACVgf,GAAerM,GACfqV,GAAiBpV,GACjBqV,GAAiBpV,GACjBqV,GAAgBpV,GAChBxxB,GAAO,OACPia,GAAe,CAAC,QAAS,SAAU,QAAS,SAAU,cAAe,QAAS,aAAa,EAC3F4sB,MAAsCroB,GAAS,SAASxe,GAAM,CAAC,QAAS,SAAU,OAAO,EAAG,SAAU6e,EAAM,CAC9G,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACd6L,EAAQ7L,EAAK,MACf,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,SAAgB5D,EAAG,CACzB,SAAQiY,GAAQ,aAAajY,EAAGsuB,EAAMtuB,CAAC,EAAGhD,EAAO,OAAO,EAC/CsxB,EAAMtuB,CAAC,EAEP,KAAK,KAAKA,CAAC,CAErB,EACD,iBAAkB,SAAsBA,EAAGwV,EAAG,CAC5C,MAAQyC,GAAQ,aAAajY,EAAGsuB,EAAMtuB,EAAGwV,CAAC,EAAGxY,EAAO,OAAO,EACzD,OAAOsxB,EAAMtuB,EAAGwV,CAAC,EAEjB,IAAIk1B,EAAS,GAAG,OAAO1qC,EAAG,GAAG,EAAE,MAAM,GAAG,EACtC2qC,KAAcN,GAAgB,SAAYK,EAAQ,CAAC,EACnDv2B,EAASw2B,EAAQ,CAAC,EAClBz0B,EAAWy0B,EAAQ,CAAC,EAClBt1B,EAAS,KAAK,KAAK,OAAO,GAAG,OAAOlB,EAAQ,GAAG,EAAE,OAAO,OAAO+B,CAAQ,EAAIV,CAAC,CAAC,CAAC,EAC9Eo1B,EAAU,GAAG,OAAOv1B,EAAQ,GAAG,EAAE,MAAM,GAAG,EAC1Cw1B,KAAcR,GAAgB,SAAYO,EAAS,CAAC,EACxD,OAAAz2B,EAAS02B,EAAQ,CAAC,EAClB30B,EAAW20B,EAAQ,CAAC,EACb,OAAO,GAAG,OAAO12B,EAAQ,GAAG,EAAE,OAAO,OAAO+B,CAAQ,EAAIV,CAAC,CAAC,CAEpE,CACL,CAAG,CACH,CAAC,EACuB+X,GAAA,iBAAGkd,GAC3B,IAAIK,MAAgC1oB,GAAS,SAASxe,GAAMia,GAAc,SAAU6jB,EAAO,CACzF,IAAI58B,EAAQ48B,EAAM,MAChB1kC,EAAS0kC,EAAM,OACfpT,EAAQoT,EAAM,MACdve,EAASue,EAAM,OACfL,EAAcK,EAAM,YACpBrrB,EAAQqrB,EAAM,MACd9e,EAAc8e,EAAM,YAClBwH,KAAoBoB,GAAe,qBAAqB,CAC1D,MAAOxlC,EACP,YAAau8B,CACjB,CAAG,EACGqI,KAAoBa,GAAe,qBAAqB,CAC1D,MAAOzlC,EACP,YAAa8d,CACjB,CAAG,EACGinB,KAAmBW,GAAc,oBAAoB,CACvD,MAAO1lC,CACX,CAAG,EACGimC,EAAaN,GAAiB,CAChC,MAAO3lC,EACP,OAAQ9H,EACR,MAAOsxB,CACX,CAAG,EAsCD,OAAOxpB,EAAM,OAAQ,CACnB,OAAQimC,EAAW,WAAW,OAC9B,gBAAiBA,EAAW,WAAW,eAAe,EACtD,QAAS,SAAiB/qC,EAAG,CAC3B,OAAOA,EAAE,MACV,EACD,kBAAmB,SAAuBA,EAAGwV,EAAG,CAC9C,OAAOxV,EAAE,KAAKwV,CAAC,CAChB,EACD,qBAAsB,SAA0BxV,EAAGwV,EAAG,CACpD,OAAOxV,EAAE,KAAKwV,EAAE,SAAU,CAAA,CAC3B,EACD,UAAW,SAAmBxV,EAAG,CAC/B,SAAQshC,GAAa,aAAathC,EAAGsuB,EAAMtuB,CAAC,EAAGhD,EAAO,OAAO,EACpDsxB,EAAMtuB,CAAC,EAEPA,EAAE,MAEZ,EACD,uBAAwB,SAA4BA,EAAGwV,EAAG,CACxD,SAAQ8rB,GAAa,aAAathC,EAAGsuB,EAAMtuB,EAAGwV,CAAC,EAAGxY,EAAO,OAAO,EACvDsxB,EAAMtuB,EAAGwV,CAAC,EAEVxV,EAAE,gBAAgBwV,EAAE,SAAU,EAAEoZ,GAAS,QAAW,UAAU,CAExE,EACD,SAAU,SAAkB5uB,EAAG,CAC7B,OAAOA,EAAE,MACV,EACD,mBAAoB,SAAwBA,EAAGwV,EAAG,CAChD,OAAOxV,EAAE,KAAKwV,CAAC,CAChB,EACD,sBAAuB,SAA2BxV,EAAGwV,EAAG,CACtD,OAAOxV,EAAE,KAAKwV,EAAE,SAAU,CAAA,CAC3B,EACD,iBAAkB1Q,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAElB,SAAWg5B,GAAY,SAASh5B,EAAGgP,EAAM,EAAI,CACrD,CACA,CAAK,EACD,4BAA6BlK,EAAM,YAAY,SAAUkK,EAAM,CAC7D,OAAO,SAAUhP,EAAGwV,EAAG,CAErB,SAAWwjB,GAAY,SAASh5B,EAAG,SAAUnD,EAAG,CAC9C,OAAOmS,EAAKnS,EAAG2Y,CAAC,CACjB,EAAE,EAAI,CACf,CACA,CAAK,EACD,mCAAoC1Q,EAAM,YAAY,SAAUkK,EAAM,CACpE,OAAO,SAAUhP,EAAGqX,EAAG,CACrB,OAAO6xB,EAAclpC,EAAGqX,EAAGrI,EAAM,EAAK,CAC9C,CACA,CAAK,EACD,kCAAmClK,EAAM,YAAY,SAAUkK,EAAM,CACnE,OAAO,SAAUhP,EAAGqX,EAAG,CACrB,OAAOwyB,EAAa7pC,EAAGqX,EAAGrI,EAAM,EAAK,CAC7C,CACA,CAAK,EACD,iDAAkDlK,EAAM,YAAY,SAAUkK,EAAM,CAClF,OAAO,SAAUhP,EAAGqX,EAAG,CAErB,OAAOwyB,EAAa1mB,EAAO9L,CAAC,EAAGrX,EAAGgP,EAAM,EAAI,EAAE,SACtD,CACA,CAAK,EACD,kDAAmDlK,EAAM,YAAY,SAAUkK,EAAM,CACnF,OAAO,SAAUhP,EAAGqX,EAAG,CACrB,OAAIgqB,EAAYrhC,EAAG,CAAC,EAAUqW,EAAMgB,EAAE,KAAM,EAAEA,EAAE,QAAS,CAAA,EACrDA,EAAE,QAAS,IAAK,QACXwyB,EAAaxyB,EAAGrX,EAAGgP,EAAM,EAAI,EAE/B06B,EAAcryB,EAAGrX,EAAGgP,EAAM,EAAI,CAC7C,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACDue,GAAA,WAAqBud,aCxLrB,OAAO,eAAeE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI5oB,GAAWhlB,EACX+iC,GAASpgC,GACT6D,GAAO,OACPia,GAAe,CAAC,OAAO,EACvBotB,MAAgC7oB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MA0BjB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQu8B,GAAO,WACf,QAAS,SAAiBngC,EAAG,CAC3B,OAAOA,EAAE,IAAIA,CAAC,EAAE,IAAIA,CAAC,CACtB,EAED,UAAW,SAAmBA,EAAG,CAC/B,OAAOA,EAAE,MAAMA,CAAC,EAAE,MAAMA,CAAC,CAC1B,EACD,SAAU,SAAkBA,EAAG,CAC7B,OAAOA,EAAE,IAAI,CAAC,CACf,EAED,KAAM,SAAcA,EAAG,CACrB,OAAOA,EAAE,IAAI,CAAC,CACf,CACL,CAAG,CACH,CAAC,EACDgrC,GAAA,WAAqBC,aCrDrB,OAAO,eAAe5yB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAI+J,GAAWhlB,EACX+iC,GAASpgC,GACT6D,GAAO,MACPia,GAAe,CAAC,OAAO,EACvBqtB,MAA+B9oB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MA+BjB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQu8B,GAAO,UACf,QAAS,SAAiBngC,EAAG,CAC3B,OAAOA,EAAE,KACV,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAOA,EAAE,KACV,CACL,CAAG,CACH,CAAC,EACDqY,GAAA,UAAoB6yB,aClDpB,OAAO,eAAe51B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAI8M,GAAWhlB,EACX+iC,GAASpgC,GACT6D,GAAO,QACPia,GAAe,CAAC,QAAS,SAAS,EAClCstB,MAAiC/oB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MACf2oB,EAAW3oB,EAAK,QAkClB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQu8B,GAAO,YACf,QAAS,SAAiBngC,EAAG,CAC3B,IAAI8e,EAAI,KAAK,IAAI9e,EAAE,EAAE,EACrB,OAAO,IAAIorC,EAAStsB,EAAI,KAAK,IAAI9e,EAAE,EAAE,EAAI,EAAG8e,EAAI,KAAK,IAAI9e,EAAE,EAAE,CAAC,CAC/D,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAOA,EAAE,IAAG,EAAG,MAAM,CAAC,CACvB,CACL,CAAG,CACH,CAAC,EACDsV,GAAA,YAAsB61B,aCvDtB,OAAO,eAAeE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACDA,GAAA,gBAA0BA,GAAA,UAAoB,OAC9C,IAAIjpB,GAAWhlB,EACX47B,GAAcj5B,GACdwqC,GAAiBjpC,GACjBkpC,GAAgBzmC,GAChBH,GAAO,MACPia,GAAe,CAAC,QAAS,UAAW,SAAU,OAAQ,QAAS,cAAe,QAAS,aAAa,EACpGytB,MAAqClpB,GAAS,SAASxe,GAAM,CAAC,QAAS,OAAQ,OAAO,EAAG,SAAU6e,EAAM,CAC3G,IAAI3d,EAAQ2d,EAAK,MACf8K,EAAO9K,EAAK,KACZsL,EAAQtL,EAAK,MACf,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,SAAgB5D,EAAG,CACzB,OAAOA,EAAI,EAAI+tB,EAAM/tB,CAAC,EAAIutB,EAAKvtB,CAAC,CACjC,EACD,iBAAkB,SAAsBA,EAAGwV,EAAG,CAC5C,OAAOxV,EAAI,EAAI+tB,EAAM/tB,EAAGwV,CAAC,EAAI+X,EAAKvtB,EAAGwV,CAAC,CACvC,CACL,CAAG,CACH,CAAC,EACsB61B,GAAA,gBAAGC,GAC1B,IAAIC,MAA+BnpB,GAAS,SAASxe,GAAMia,GAAc,SAAU6jB,EAAO,CACxF,IAAI58B,EAAQ48B,EAAM,MAChB0J,EAAW1J,EAAM,QACjBve,EAASue,EAAM,OACfnU,EAAOmU,EAAM,KACb3T,EAAQ2T,EAAM,MACdL,EAAcK,EAAM,YACpBrrB,EAAQqrB,EAAM,MACd9e,EAAc8e,EAAM,YAClBgI,KAAoBa,GAAe,qBAAqB,CAC1D,MAAOzlC,EACP,YAAa8d,CACjB,CAAG,EACGinB,KAAmBW,GAAc,oBAAoB,CACvD,MAAO1lC,CACX,CAAG,EACG0mC,EAAYF,GAAgB,CAC9B,MAAOxmC,EACP,KAAMyoB,EACN,MAAOQ,CACX,CAAG,EAqCD,OAAOjpB,EAAM,MAAO,CAClB,OAAQ0mC,EAAU,WAAW,OAC7B,6BAA8BA,EAAU,WAAW,eAAe,EAClE,QAAS,SAAiBxrC,EAAG,CAC3B,OAAO,IAAIorC,EAASprC,EAAE,GAAK,EAAI,KAAK,MAAMA,EAAE,EAAE,EAAI,KAAK,KAAKA,EAAE,EAAE,EAAGA,EAAE,GAAK,EAAI,KAAK,MAAMA,EAAE,EAAE,EAAI,KAAK,KAAKA,EAAE,EAAE,CAAC,CACjH,EACD,kBAAmB,SAAuBA,EAAGwV,EAAG,CAC9C,OAAO,IAAI41B,EAASprC,EAAE,GAAK,EAAI+tB,EAAM/tB,EAAE,GAAIwV,CAAC,EAAI+X,EAAKvtB,EAAE,GAAIwV,CAAC,EAAGxV,EAAE,GAAK,EAAI+tB,EAAM/tB,EAAE,GAAIwV,CAAC,EAAI+X,EAAKvtB,EAAE,GAAIwV,CAAC,CAAC,CACzG,EACD,qBAAsB,SAA0BxV,EAAGyrC,EAAI,CACrD,IAAIj2B,EAAIi2B,EAAG,WACX,OAAO,IAAIL,EAASprC,EAAE,GAAK,EAAI+tB,EAAM/tB,EAAE,GAAIwV,CAAC,EAAI+X,EAAKvtB,EAAE,GAAIwV,CAAC,EAAGxV,EAAE,GAAK,EAAI+tB,EAAM/tB,EAAE,GAAIwV,CAAC,EAAI+X,EAAKvtB,EAAE,GAAIwV,CAAC,CAAC,CACzG,EACD,UAAW,SAAmBxV,EAAG,CAC/B,OAAOA,EAAE,aAAeutB,EAAKvtB,CAAC,EAAI+tB,EAAM/tB,CAAC,CAC1C,EACD,gCAAiC,SAAkCA,EAAGwV,EAAG,CACvE,OAAOxV,EAAE,WAAY,EAAGutB,EAAKvtB,EAAGwV,CAAC,EAAIuY,EAAM/tB,EAAGwV,CAAC,CAChD,EACD,SAAU,SAAkBxV,EAAG,CAC7B,OAAOA,EAAE,EAAI,EAAIA,EAAE,OAASA,EAAE,OAC/B,EACD,+BAAgC,SAAiCA,EAAGwV,EAAG,CACrE,OAAOxV,EAAE,EAAI,EAAIutB,EAAKvtB,EAAGwV,CAAC,EAAIuY,EAAM/tB,EAAGwV,CAAC,CACzC,EACD,iBAAkB1Q,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAElB,SAAWg5B,GAAY,SAASh5B,EAAGgP,EAAM,EAAI,CACrD,CACA,CAAK,EACD,qCAAsClK,EAAM,YAAY,SAAUkK,EAAM,CACtE,OAAO,SAAUhP,EAAGwV,EAAG,CAErB,SAAWwjB,GAAY,SAASh5B,EAAG,SAAUnD,EAAG,CAC9C,OAAOmS,EAAKnS,EAAG2Y,CAAC,CACjB,EAAE,EAAI,CACf,CACA,CAAK,EACD,iDAAkD1Q,EAAM,YAAY,SAAUkK,EAAM,CAClF,OAAO,SAAUhP,EAAGqX,EAAG,CAErB,OAAOwyB,EAAa1mB,EAAO9L,CAAC,EAAGrX,EAAGgP,EAAM,EAAI,EAAE,SACtD,CACA,CAAK,EACD,kDAAmDlK,EAAM,YAAY,SAAUkK,EAAM,CACnF,OAAO,SAAUhP,EAAGqX,EAAG,CACrB,OAAIgqB,EAAYrhC,EAAG,CAAC,EAAUqW,EAAMgB,EAAE,KAAM,EAAEA,EAAE,QAAS,CAAA,EACrDA,EAAE,QAAS,IAAK,QACXwyB,EAAaxyB,EAAGrX,EAAGgP,EAAM,EAAI,EAE/B06B,EAAcryB,EAAGrX,EAAGgP,EAAM,EAAI,CAC7C,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACDq8B,GAAA,UAAoBE,aCzIhB/uC,GAAyBY,GAC7B,OAAO,eAAe2wB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACDA,GAAA,kBAA4BA,GAAA,YAAsB,OAClD,IAAIsc,GAAkB7tC,GAAuBuD,GAAA,CAA+C,EACxF6uB,GAAWpyB,GAAuB8E,GAAA,CAAqB,EACvD8gB,GAAWre,EACXi1B,GAAclgB,GACdb,GAAUqK,GACVgf,GAAerM,GACfqV,GAAiBpV,GACjBqV,GAAiBpV,GACjBqV,GAAgBpV,GAChBxxB,GAAO,QACPia,GAAe,CAAC,QAAS,SAAU,QAAS,SAAU,cAAe,QAAS,aAAa,EAC3F6tB,MAAuCtpB,GAAS,SAASxe,GAAM,CAAC,QAAS,SAAU,OAAO,EAAG,SAAU6e,EAAM,CAC/G,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACd6L,EAAQ7L,EAAK,MACf,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,SAAgB5D,EAAG,CACzB,SAAQiY,GAAQ,aAAajY,EAAGsuB,EAAMtuB,CAAC,EAAGhD,EAAO,OAAO,EAC/CsxB,EAAMtuB,CAAC,EAEP,KAAK,MAAMA,CAAC,CAEtB,EACD,iBAAkB,SAAsBA,EAAGwV,EAAG,CAC5C,MAAQyC,GAAQ,aAAajY,EAAGsuB,EAAMtuB,EAAGwV,CAAC,EAAGxY,EAAO,OAAO,EACzD,OAAOsxB,EAAMtuB,EAAGwV,CAAC,EAEjB,IAAIk1B,EAAS,GAAG,OAAO1qC,EAAG,GAAG,EAAE,MAAM,GAAG,EACtC2qC,KAAcN,GAAgB,SAAYK,EAAQ,CAAC,EACnDv2B,EAASw2B,EAAQ,CAAC,EAClBz0B,EAAWy0B,EAAQ,CAAC,EAClBt1B,EAAS,KAAK,MAAM,OAAO,GAAG,OAAOlB,EAAQ,GAAG,EAAE,OAAO,OAAO+B,CAAQ,EAAIV,CAAC,CAAC,CAAC,EAC/Eo1B,EAAU,GAAG,OAAOv1B,EAAQ,GAAG,EAAE,MAAM,GAAG,EAC1Cw1B,KAAcR,GAAgB,SAAYO,EAAS,CAAC,EACxD,OAAAz2B,EAAS02B,EAAQ,CAAC,EAClB30B,EAAW20B,EAAQ,CAAC,EACb,OAAO,GAAG,OAAO12B,EAAQ,GAAG,EAAE,OAAO,OAAO+B,CAAQ,EAAIV,CAAC,CAAC,CAEpE,CACL,CAAG,CACH,CAAC,EACwBuY,GAAA,kBAAG2d,GAC5B,IAAIC,MAAiCvpB,GAAS,SAASxe,GAAMia,GAAc,SAAU6jB,EAAO,CAC1F,IAAI58B,EAAQ48B,EAAM,MAChB1kC,EAAS0kC,EAAM,OACfpT,EAAQoT,EAAM,MACdve,EAASue,EAAM,OACfL,EAAcK,EAAM,YACpBrrB,EAAQqrB,EAAM,MACd9e,EAAc8e,EAAM,YAClBwH,KAAoBoB,GAAe,qBAAqB,CAC1D,MAAOxlC,EACP,YAAau8B,CACjB,CAAG,EACGqI,KAAoBa,GAAe,qBAAqB,CAC1D,MAAOzlC,EACP,YAAa8d,CACjB,CAAG,EACGinB,KAAmBW,GAAc,oBAAoB,CACvD,MAAO1lC,CACX,CAAG,EACG8mC,EAAcF,GAAkB,CAClC,MAAO5mC,EACP,OAAQ9H,EACR,MAAOsxB,CACX,CAAG,EAyCD,OAAOxpB,EAAM,QAAS,CACpB,OAAQ8mC,EAAY,WAAW,OAC/B,gBAAiBA,EAAY,WAAW,eAAe,EACvD,QAAS,SAAiB5rC,EAAG,CAC3B,OAAOA,EAAE,OACV,EACD,kBAAmB,SAAuBA,EAAGwV,EAAG,CAC9C,OAAOxV,EAAE,MAAMwV,CAAC,CACjB,EACD,qBAAsB,SAA0BxV,EAAGwV,EAAG,CACpD,OAAOxV,EAAE,MAAMwV,EAAE,SAAU,CAAA,CAC5B,EACD,UAAW,SAAmBxV,EAAG,CAC/B,SAAQshC,GAAa,aAAathC,EAAGsuB,EAAMtuB,CAAC,EAAGhD,EAAO,OAAO,EACpDsxB,EAAMtuB,CAAC,EAEPA,EAAE,OAEZ,EACD,uBAAwB,SAA4BA,EAAGwV,EAAG,CACxD,SAAQ8rB,GAAa,aAAathC,EAAGsuB,EAAMtuB,EAAGwV,CAAC,EAAGxY,EAAO,OAAO,EACvDsxB,EAAMtuB,EAAGwV,CAAC,EAEVxV,EAAE,gBAAgBwV,EAAE,SAAU,EAAEoZ,GAAS,QAAW,WAAW,CAEzE,EACD,SAAU,SAAkB5uB,EAAG,CAC7B,OAAOA,EAAE,OACV,EACD,mBAAoB,SAAwBA,EAAGwV,EAAG,CAChD,OAAOxV,EAAE,MAAMwV,CAAC,CACjB,EACD,sBAAuB,SAA2BxV,EAAGwV,EAAG,CACtD,OAAOxV,EAAE,MAAMwV,EAAE,SAAU,CAAA,CAC5B,EACD,iBAAkB1Q,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAElB,SAAWg5B,GAAY,SAASh5B,EAAGgP,EAAM,EAAI,CACrD,CACA,CAAK,EACD,4BAA6BlK,EAAM,YAAY,SAAUkK,EAAM,CAC7D,OAAO,SAAUhP,EAAGwV,EAAG,CAErB,SAAWwjB,GAAY,SAASh5B,EAAG,SAAUnD,EAAG,CAC9C,OAAOmS,EAAKnS,EAAG2Y,CAAC,CACjB,EAAE,EAAI,CACf,CACA,CAAK,EACD,mCAAoC1Q,EAAM,YAAY,SAAUkK,EAAM,CACpE,OAAO,SAAUhP,EAAGqX,EAAG,CACrB,OAAO6xB,EAAclpC,EAAGqX,EAAGrI,EAAM,EAAK,CAC9C,CACA,CAAK,EACD,kCAAmClK,EAAM,YAAY,SAAUkK,EAAM,CACnE,OAAO,SAAUhP,EAAGqX,EAAG,CACrB,OAAOwyB,EAAa7pC,EAAGqX,EAAGrI,EAAM,EAAK,CAC7C,CACA,CAAK,EACD,iDAAkDlK,EAAM,YAAY,SAAUkK,EAAM,CAClF,OAAO,SAAUhP,EAAGqX,EAAG,CAErB,OAAOwyB,EAAa1mB,EAAO9L,CAAC,EAAGrX,EAAGgP,EAAM,EAAI,EAAE,SACtD,CACA,CAAK,EACD,kDAAmDlK,EAAM,YAAY,SAAUkK,EAAM,CACnF,OAAO,SAAUhP,EAAGqX,EAAG,CACrB,OAAIgqB,EAAYrhC,EAAG,CAAC,EAAUqW,EAAMgB,EAAE,KAAM,EAAEA,EAAE,QAAS,CAAA,EACrDA,EAAE,QAAS,IAAK,QACXwyB,EAAaxyB,EAAGrX,EAAGgP,EAAM,EAAI,EAE/B06B,EAAcryB,EAAGrX,EAAGgP,EAAM,EAAI,CAC7C,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACD+e,GAAA,YAAsB4d,2EC7LtB,IAAI5sB,EAAgB3hB,KACpB,SAASyuC,EAAgBpvC,EAAKM,EAAKyE,EAAO,CACxC,OAAAzE,EAAMgiB,EAAchiB,CAAG,EACnBA,KAAON,EACT,OAAO,eAAeA,EAAKM,EAAK,CAC9B,MAAOyE,EACP,WAAY,GACZ,aAAc,GACd,SAAU,EAChB,CAAK,EAED/E,EAAIM,CAAG,EAAIyE,EAEN/E,CACR,CACDC,EAAA,QAAiBmvC,EAAiBnvC,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,2GCfvG,IAAIisC,EAAmBvrC,KACvB,SAAS0uC,EAAmBt5B,EAAK,CAC/B,GAAI,MAAM,QAAQA,CAAG,EAAG,OAAOm2B,EAAiBn2B,CAAG,CACpD,CACD9V,EAAA,QAAiBovC,EAAoBpvC,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,2FCJ1G,SAASqvC,EAAiBC,EAAM,CAC9B,GAAI,OAAO,OAAW,KAAeA,EAAK,OAAO,QAAQ,GAAK,MAAQA,EAAK,YAAY,GAAK,KAAM,OAAO,MAAM,KAAKA,CAAI,CACzH,CACDtvC,EAAA,QAAiBqvC,EAAkBrvC,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,2FCHxG,SAASuvC,GAAqB,CAC5B,MAAM,IAAI,UAAU;AAAA,mFAAsI,CAC3J,CACDvvC,EAAA,QAAiBuvC,EAAoBvvC,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,2ECH1G,IAAIwvC,EAAoB9uC,KACpB+uC,EAAkBpsC,KAClBgpC,EAA6BznC,KAC7B8qC,EAAoBroC,KACxB,SAASsoC,EAAmB75B,EAAK,CAC/B,OAAO05B,EAAkB15B,CAAG,GAAK25B,EAAgB35B,CAAG,GAAKu2B,EAA2Bv2B,CAAG,GAAK45B,GAC7F,CACD1vC,EAAA,QAAiB2vC,EAAoB3vC,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,mCCL1G,OAAO,eAAe4vC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAIlqB,GAAWhlB,EACX2d,GAAkBhb,GAClB6D,GAAO,iBACPia,GAAe,CAAC,OAAO,EACvB0uB,MAA0CnqB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAClG,IAAI3d,EAAQ2d,EAAK,MAoBjB,OAAO,SAAoB+pB,EAAaC,EAAchrC,EAAUg3B,EAAS,CAEvE,IAAIsR,EAAQyC,EAAY,MACpBpD,EAAQoD,EAAY,MACpBnD,EAAMmD,EAAY,UAElBE,EAAUD,EAAa,QACvBE,EAASF,EAAa,OACtBG,EAAOH,EAAa,KACpBI,EAAQJ,EAAa,MACrBK,EAAML,EAAa,UAGvB,GAAIrD,EAAM,SAAWyD,EAAM,OACzB,MAAM,IAAI9xB,GAAgB,eAAequB,EAAM,OAAQyD,EAAM,MAAM,EAIrE,GAAIzD,EAAM,CAAC,IAAMyD,EAAM,CAAC,GAAKzD,EAAM,CAAC,IAAMyD,EAAM,CAAC,EAC/C,MAAM,IAAI,WAAW,iCAAmCzD,EAAQ,0BAA4ByD,EAAQ,GAAG,EAIzG,GAAI,CAACH,EACH,MAAM,IAAI,MAAM,oEAAoE,EAItF,IAAIzV,EAAOmS,EAAM,CAAC,EACdlS,EAAUkS,EAAM,CAAC,EAGjBE,EAAK,OAAOD,GAAQ,UAAYA,IAAQyD,EAAMzD,EAAM,OAEpDE,EAAKD,EAAKxkC,EAAM,KAAKrD,EAAU,CAAC6nC,EAAIA,CAAE,CAAC,EAAI7nC,EAG3C5E,EAAG2oB,EAGHokB,EAAQ,CAAA,EAEZ,IAAK/sC,EAAI,EAAGA,EAAIo6B,EAAMp6B,IACpB+sC,EAAM/sC,CAAC,EAAI,GAIb,IAAImD,EAAI,CAAA,EAEJypB,EAAI,CAAA,EAGR,IAAKjE,EAAI,EAAGA,EAAI0R,EAAS1R,IAAK,CAI5B,QAFI+S,EAAO/S,EAAI,EAENsT,EAAK8T,EAAKpnB,CAAC,EAAGuT,EAAK6T,EAAKpnB,EAAI,CAAC,EAAGF,EAAIwT,EAAIxT,EAAIyT,EAAIzT,IAEvDzoB,EAAI8vC,EAAOrnB,CAAC,EAEZtlB,EAAEnD,CAAC,EAAI47B,EAAU8Q,EAAGmD,EAAQpnB,CAAC,EAAGykB,EAAMltC,CAAC,EAAE2oB,CAAC,CAAC,EAAI+jB,EAAGQ,EAAMltC,CAAC,EAAE2oB,CAAC,EAAGknB,EAAQpnB,CAAC,CAAC,EAEzEmE,EAAE5sB,CAAC,EAAI07B,EAGT,IAAK17B,EAAI,EAAGA,EAAIo6B,EAAMp6B,IAEhB4sB,EAAE5sB,CAAC,IAAM07B,EAEXqR,EAAM/sC,CAAC,EAAE2oB,CAAC,EAAIxlB,EAAEnD,CAAC,EAGjB+sC,EAAM/sC,CAAC,EAAE2oB,CAAC,EAAIukB,EAAMltC,CAAC,EAAE2oB,CAAC,CAG7B,CAGD,OAAOgnB,EAAY,kBAAkB,CACnC,KAAM5C,EACN,KAAM,CAAC3S,EAAMC,CAAO,EACpB,SAAUoS,CAChB,CAAK,CACL,CACA,CAAC,EACDgD,GAAA,qBAA+BC,aClH/B,OAAO,eAAeQ,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC6BA,GAAA,uBAAG,OACjC,IAAI3qB,GAAWhlB,EACX2d,GAAkBhb,GAClB6D,GAAO,mBACPia,GAAe,CAAC,QAAS,aAAa,EACtCmvB,MAA4C5qB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACpG,IAAI3d,EAAQ2d,EAAK,MACf4e,EAAc5e,EAAK,YAmBrB,OAAO,SAA0B,EAAG9gB,EAAGF,EAAU,CAE/C,IAAIk3B,EAAU,EAAE,QACZC,EAAS,EAAE,OACXC,EAAO,EAAE,KACTuQ,EAAQ,EAAE,MACVC,EAAM,EAAE,UAERqD,EAAU/qC,EAAE,QACZgrC,EAAShrC,EAAE,OACXirC,EAAOjrC,EAAE,KACTkrC,EAAQlrC,EAAE,MACVmrC,EAAMnrC,EAAE,UAGZ,GAAIynC,EAAM,SAAWyD,EAAM,OACzB,MAAM,IAAI9xB,GAAgB,eAAequB,EAAM,OAAQyD,EAAM,MAAM,EAIrE,GAAIzD,EAAM,CAAC,IAAMyD,EAAM,CAAC,GAAKzD,EAAM,CAAC,IAAMyD,EAAM,CAAC,EAC/C,MAAM,IAAI,WAAW,iCAAmCzD,EAAQ,0BAA4ByD,EAAQ,GAAG,EAIzG,IAAI5V,EAAOmS,EAAM,CAAC,EACdlS,EAAUkS,EAAM,CAAC,EAGjBE,EAEAvH,EAAKV,EAELW,EAAO,EAEPuH,EAAK9nC,EAGL,OAAO4nC,GAAQ,UAAYA,IAAQyD,IAErCxD,EAAKD,EAELtH,EAAKj9B,EAAM,KAAKu8B,EAAa,CAACiI,EAAIA,CAAE,CAAC,EAErCtH,EAAOl9B,EAAM,QAAQ,EAAGwkC,CAAE,EAE1BC,EAAKzkC,EAAM,KAAKrD,EAAU,CAAC6nC,EAAIA,CAAE,CAAC,GAIpC,IAAIE,EAAU7Q,GAAW+T,EAAU,CAAA,EAAK,OACpClU,EAAS,CAAA,EACTiR,EAAO,CAAA,EAGPwD,EAAKtU,GAAW+T,EAAU,CAAA,EAAK,OAC/BQ,EAAKvU,GAAW+T,EAAU,CAAA,EAAK,OAE/BS,EAAK,CAAA,EACLC,EAAK,CAAA,EAGLvwC,EAAG2oB,EAAGF,EAAGwT,EAAIC,EAGjB,IAAKvT,EAAI,EAAGA,EAAI0R,EAAS1R,IAAK,CAE5BikB,EAAKjkB,CAAC,EAAIgT,EAAO,OAEjB,IAAID,EAAO/S,EAAI,EAEf,IAAKsT,EAAKD,EAAKrT,CAAC,EAAGuT,EAAKF,EAAKrT,EAAI,CAAC,EAAGF,EAAIwT,EAAIxT,EAAIyT,EAAIzT,IAEnDzoB,EAAI+7B,EAAOtT,CAAC,EAEZkT,EAAO,KAAK37B,CAAC,EAEbswC,EAAGtwC,CAAC,EAAI07B,EAEJ0U,IACFA,EAAGpwC,CAAC,EAAI87B,EAAQrT,CAAC,GAIrB,IAAKwT,EAAK8T,EAAKpnB,CAAC,EAAGuT,EAAK6T,EAAKpnB,EAAI,CAAC,EAAGF,EAAIwT,EAAIxT,EAAIyT,EAAIzT,IAInD,GAFAzoB,EAAI8vC,EAAOrnB,CAAC,EAER6nB,EAAGtwC,CAAC,IAAM07B,GAEZ,GAAI0U,EAAI,CAEN,IAAIxf,EAAI8b,EAAG0D,EAAGpwC,CAAC,EAAG6vC,EAAQpnB,CAAC,CAAC,EAEvByc,EAAGtU,EAAGuU,CAAI,EAKbmL,EAAGtwC,CAAC,EAAI,KAHRowC,EAAGpwC,CAAC,EAAI4wB,CAKX,OAGD+K,EAAO,KAAK37B,CAAC,EAEbuwC,EAAGvwC,CAAC,EAAI07B,EAEJ2U,IACFA,EAAGrwC,CAAC,EAAI6vC,EAAQpnB,CAAC,GAKvB,GAAI2nB,GAAMC,EAIR,IAFA5nB,EAAImkB,EAAKjkB,CAAC,EAEHF,EAAIkT,EAAO,QAEhB37B,EAAI27B,EAAOlT,CAAC,EAER6nB,EAAGtwC,CAAC,IAAM07B,GAEZiR,EAAQlkB,CAAC,EAAI2nB,EAAGpwC,CAAC,EAEjByoB,KACS8nB,EAAGvwC,CAAC,IAAM07B,GAEnBiR,EAAQlkB,CAAC,EAAI4nB,EAAGrwC,CAAC,EAEjByoB,KAGAkT,EAAO,OAAOlT,EAAG,CAAC,CAIzB,CAED,OAAAmkB,EAAKvS,CAAO,EAAIsB,EAAO,OAGhB,EAAE,mBAAmB,CAC1B,OAAQgR,EACR,MAAOhR,EACP,IAAKiR,EACL,KAAM,CAACxS,EAAMC,CAAO,EACpB,SAAUoS,CAChB,CAAK,CACL,CACA,CAAC,EACDyD,GAAA,uBAAiCC,aCrLjC,OAAO,eAAeK,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAIjrB,GAAWhlB,EACXwG,GAAO,iBACPia,GAAe,CAAC,QAAS,aAAa,EACtCyvB,MAA0ClrB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAClG,IAAI3d,EAAQ2d,EAAK,MACfG,EAAcH,EAAK,YAoBrB,OAAO,SAAwB5a,EAAGlG,EAAGF,EAAUg3B,EAAS,CAEtD,IAAIE,EAAU9wB,EAAE,QACZ+wB,EAAS/wB,EAAE,OACXgxB,EAAOhxB,EAAE,KACTuhC,EAAQvhC,EAAE,MACVwhC,EAAMxhC,EAAE,UAGZ,GAAI,CAAC8wB,EACH,MAAM,IAAI,MAAM,oEAAoE,EAItF,IAAI1B,EAAOmS,EAAM,CAAC,EACdlS,EAAUkS,EAAM,CAAC,EAGjBE,EAEAC,EAAK9nC,EAGL,OAAO4nC,GAAQ,WAEjBC,EAAKD,EAEL1nC,EAAImD,EAAM,QAAQnD,EAAG2nC,CAAE,EAEvBC,EAAKzkC,EAAM,KAAKrD,EAAU,CAAC6nC,EAAIA,CAAE,CAAC,GAYpC,QARIM,EAAQ,CAAA,EAGR5pC,EAAI,CAAA,EAEJypB,EAAI,CAAA,EAGCjE,EAAI,EAAGA,EAAI0R,EAAS1R,IAAK,CAIhC,QAFI+S,EAAO/S,EAAI,EAENsT,EAAKD,EAAKrT,CAAC,EAAGuT,EAAKF,EAAKrT,EAAI,CAAC,EAAGF,EAAIwT,EAAIxT,EAAIyT,EAAIzT,IAAK,CAE5D,IAAIxG,EAAI8Z,EAAOtT,CAAC,EAEhBtlB,EAAE8e,CAAC,EAAI6Z,EAAQrT,CAAC,EAChBmE,EAAE3K,CAAC,EAAIyZ,CACR,CAED,QAAS17B,EAAI,EAAGA,EAAIo6B,EAAMp6B,IAEpB2oB,IAAM,IAERokB,EAAM/sC,CAAC,EAAI,IAGT4sB,EAAE5sB,CAAC,IAAM07B,EAEXqR,EAAM/sC,CAAC,EAAE2oB,CAAC,EAAIiT,EAAU8Q,EAAG5nC,EAAG3B,EAAEnD,CAAC,CAAC,EAAI0sC,EAAGvpC,EAAEnD,CAAC,EAAG8E,CAAC,EAGhDioC,EAAM/sC,CAAC,EAAE2oB,CAAC,EAAI7jB,CAGnB,CAGD,OAAO,IAAIihB,EAAY,CACrB,KAAMgnB,EACN,KAAM,CAAC3S,EAAMC,CAAO,EACpB,SAAUoS,CAChB,CAAK,CACL,CACA,CAAC,EACD+D,GAAA,qBAA+BC,yDC3G/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAInrB,EAAWhlB,EACX2d,EAAkBhb,GAClB6D,EAAO,eACPia,EAAe,CAAC,OAAO,EACvB2vB,KAAwCprB,EAAS,SAASxe,EAAMia,EAAc,SAAU4E,EAAM,CAChG,IAAI3d,EAAQ2d,EAAK,MAejB,OAAO,SAAsB/gB,EAAGC,EAAGF,EAAU,CAE3C,IAAIsoC,EAAQroC,EAAE,MACV0nC,EAAQ1nC,EAAE,MACV2nC,EAAM3nC,EAAE,UAER+rC,EAAQ9rC,EAAE,MACVkrC,EAAQlrC,EAAE,MACVmrC,EAAMnrC,EAAE,UAER+rC,EAAQ,CAAA,EAGZ,GAAItE,EAAM,SAAWyD,EAAM,OACzB,MAAM,IAAI9xB,EAAgB,eAAequB,EAAM,OAAQyD,EAAM,MAAM,EAIrE,QAAShlC,EAAI,EAAGA,EAAIuhC,EAAM,OAAQvhC,IAAK,CAErC,GAAIuhC,EAAMvhC,CAAC,IAAMglC,EAAMhlC,CAAC,EACtB,MAAM,IAAI,WAAW,iCAAmCuhC,EAAQ,0BAA4ByD,EAAQ,GAAG,EAGzGa,EAAM7lC,CAAC,EAAIuhC,EAAMvhC,CAAC,CACnB,CAGD,IAAIyhC,EAEAC,EAAK9nC,EAGL,OAAO4nC,GAAQ,UAAYA,IAAQyD,IAErCxD,EAAKD,EAELE,EAAKzkC,EAAM,KAAKrD,EAAU,CAAC6nC,EAAIA,CAAE,CAAC,GAIpC,IAAIM,EAAQ8D,EAAM,OAAS,EAAI1D,EAAST,EAAI,EAAGmE,EAAOA,EAAM,CAAC,EAAG3D,EAAO0D,CAAK,EAAI,CAAA,EAGhF,OAAO/rC,EAAE,kBAAkB,CACzB,KAAMkoC,EACN,KAAM8D,EACN,SAAUpE,CAChB,CAAK,CACL,EAGE,SAASU,EAAS/mB,EAAGgnB,EAAOpiC,EAAG2N,EAAG00B,EAAIC,EAAI,CAExC,IAAIC,EAAK,CAAA,EAET,GAAIH,IAAUpiC,EAAE,OAAS,EAEvB,QAAShL,EAAI,EAAGA,EAAI2Y,EAAG3Y,IAErButC,EAAGvtC,CAAC,EAAIomB,EAAEinB,EAAGrtC,CAAC,EAAGstC,EAAGttC,CAAC,CAAC,MAIxB,SAAS2oB,EAAI,EAAGA,EAAIhQ,EAAGgQ,IAErB4kB,EAAG5kB,CAAC,EAAIwkB,EAAS/mB,EAAGgnB,EAAQ,EAAGpiC,EAAGA,EAAEoiC,EAAQ,CAAC,EAAGC,EAAG1kB,CAAC,EAAG2kB,EAAG3kB,CAAC,CAAC,EAGhE,OAAO4kB,CACR,CACH,CAAC,EACD,OAAAmD,GAAA,mBAA6BC,qDChG7B,IAAIhxC,EAAyBY,GAC7B,OAAO,eAAeuwC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIC,EAAsBpxC,EAAuBuD,GAAA,CAAmD,EAChGqiB,EAAW9gB,EACXsC,EAAO,YACPiqC,EAAe,CAAC,QAAQ,EACxBC,KAAqC1rB,EAAS,SAASxe,EAAMiqC,EAAc,SAAUprB,EAAM,CAC7F,IAAIsrB,EAAStrB,EAAK,OAUlB,OAAO,SAAUyN,EAAGC,EAAG,CACrB,IAAIG,EAAI,KAAK,IAAIJ,EAAE,MAAM,OAAQC,EAAE,MAAM,MAAM,EAC/C,GAAID,EAAE,MAAM,SAAWC,EAAE,MAAM,QACzBD,EAAE,MAAM,MAAM,SAAUhV,EAAKre,EAAG,CAClC,OAAOqe,IAAQiV,EAAE,MAAMtzB,CAAC,CAChC,CAAO,EAEC,MAAO,CAACqzB,EAAGC,CAAC,EAQhB,QALI6d,EAAQC,EAAS/d,EAAE,MAAOI,EAAG,CAAC,EAC9B4d,EAAQD,EAAS9d,EAAE,MAAOG,EAAG,CAAC,EAG9B6d,EAAU,CAAA,EACLjzB,EAAM,EAAGA,EAAMoV,EAAGpV,IACzBizB,EAAQjzB,CAAG,EAAI,KAAK,IAAI8yB,EAAM9yB,CAAG,EAAGgzB,EAAMhzB,CAAG,CAAC,EAIhD,QAASkzB,EAAO,EAAGA,EAAO9d,EAAG8d,IAC3BC,EAAYL,EAAOG,EAASC,CAAI,EAChCC,EAAYH,EAAOC,EAASC,CAAI,EAIlC,IAAIE,EAAKpe,EAAE,QACPqe,EAAKpe,EAAE,QACPme,EAAG,MAAM,OAAShe,EACpBge,EAAG,QAAQL,EAASK,EAAG,MAAOhe,EAAG,CAAC,CAAC,EAC1Bie,EAAG,MAAM,OAASje,GAC3Bie,EAAG,QAAQN,EAASM,EAAG,MAAOje,EAAG,CAAC,CAAC,EAIrC,QAASke,EAAQ,EAAGA,EAAQle,EAAGke,IACzBF,EAAG,MAAME,CAAK,EAAIL,EAAQK,CAAK,IACjCF,EAAKG,EAASH,EAAIH,EAAQK,CAAK,EAAGA,CAAK,GAErCD,EAAG,MAAMC,CAAK,EAAIL,EAAQK,CAAK,IACjCD,EAAKE,EAASF,EAAIJ,EAAQK,CAAK,EAAGA,CAAK,GAK3C,MAAO,CAACF,EAAIC,CAAE,CAClB,EACE,SAASN,EAASS,EAAOpe,EAAGqe,EAAQ,CAElC,MAAO,CAAA,EAAG,UAAWf,EAAoB,SAAY,MAAMtd,EAAIoe,EAAM,MAAM,EAAE,KAAKC,CAAM,CAAC,KAAOf,EAAoB,SAAYc,CAAK,CAAC,CACvI,CACD,SAASD,EAASG,EAAgBC,EAAeC,EAAc,CAE7D,OAAOf,EAAO,MAAM,UAAYH,EAAoB,SAAY,MAAMiB,CAAa,EAAE,KAAKD,CAAc,CAAC,EAAE,OAAO,CAACE,CAAY,CAAC,CAAC,CAClI,CACD,SAAST,EAAYK,EAAOP,EAASjzB,EAAK,CACxC,GAAIwzB,EAAMxzB,CAAG,EAAIizB,EAAQjzB,CAAG,EAAIwzB,EAAMxzB,CAAG,EAAI,EAC3C,MAAM,IAAI,MAAM,0DAA0D,OAAOwzB,EAAO,wCAAwC,EAAE,OAAOxzB,EAAK,aAAa,EAAE,OAAOwzB,EAAMxzB,CAAG,EAAG,WAAW,EAAE,OAAOizB,EAAQjzB,CAAG,CAAC,CAAC,CAEpN,CACH,CAAC,EACD,OAAAyyB,GAAA,gBAA0BG,KCjF1B,IAAItxC,GAAyBY,GAC7B,OAAO,eAAe2xC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiCA,GAAA,2BAAG,OACrC,IAAInB,GAAsBpxC,GAAuBuD,GAAA,CAAmD,EAChGqiB,GAAW9gB,EACXwB,GAAUiB,GACVirC,GAAgBl2B,GAAA,EAChB0xB,GAAgBloB,GAChB2sB,GAAaha,GAAA,EACbrxB,GAAO,uBACPia,GAAe,CAAC,QAAS,SAAU,QAAQ,EAC3CqxB,MAAgD9sB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACxG,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdsrB,EAAStrB,EAAK,OACZ8qB,KAAmByB,GAAc,oBAAoB,CACvD,MAAOlqC,CACX,CAAG,EACG+kC,KAAmBW,GAAc,oBAAoB,CACvD,MAAO1lC,CACX,CAAG,EACG6oC,KAAgBsB,GAAW,iBAAiB,CAC9C,OAAQlB,CACZ,CAAG,EAmBD,OAAO,SAA8B3qC,EAAS,CAC5C,IAAI+rC,EAAO/rC,EAAQ,KACfgsC,EAAKhsC,EAAQ,IAAMA,EAAQ,GAC3BisC,EACAF,GAEFE,EAAmB,CACjB,2BAA4B,SAAgCrvC,EAAG,EAAG,CAChE,OAAOutC,EAAa,MAAM,UAAYK,GAAoB,SAAYD,EAAU3tC,EAAG,CAAC,CAAC,EAAE,OAAO,CAACmvC,CAAI,CAAC,CAAC,CACtG,EACD,eAAgB,SAAoBnvC,EAAG,EAAG,CACxC,OAAOutC,EAAa,MAAM,UAAYK,GAAoB,SAAYD,EAAUxqB,EAAOnjB,CAAC,EAAGmjB,EAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAACgsB,CAAI,CAAC,CAAC,EAAE,SACxH,EACD,qBAAsB,SAA0BnvC,EAAG,EAAG,CACpD,OAAOutC,EAAa,MAAM,UAAYK,GAAoB,SAAYD,EAAUxqB,EAAOnjB,CAAC,EAAG,CAAC,CAAC,EAAE,OAAO,CAACmvC,CAAI,CAAC,CAAC,CAC9G,EACD,qBAAsB,SAA0BnvC,EAAG,EAAG,CACpD,OAAOutC,EAAa,MAAM,UAAYK,GAAoB,SAAYD,EAAU3tC,EAAGmjB,EAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAACgsB,CAAI,CAAC,CAAC,CAC9G,CACT,EAEU/rC,EAAQ,KACVisC,EAAiB,4BAA4B,EAAI,SAAUrvC,EAAGqX,EAAG,CAC/D,OAAOjU,EAAQ,GAAG,MAAMA,KAAawqC,GAAoB,SAAYD,EAAU3tC,EAAGqX,CAAC,CAAC,EAAE,OAAO,CAAC83B,EAAM,EAAK,CAAC,CAAC,CACrH,GAEU/rC,EAAQ,KACVisC,EAAiB,2BAA2B,EAAI,SAAUrvC,EAAGqX,EAAG,CAC9D,OAAOjU,EAAQ,GAAG,MAAMA,KAAawqC,GAAoB,SAAYD,EAAU3tC,EAAGqX,CAAC,CAAC,EAAE,OAAO,CAAC83B,EAAM,EAAK,CAAC,CAAC,CACrH,EACQE,EAAiB,qBAAqB,EAAI,SAAUrvC,EAAGqX,EAAG,CACxD,OAAOjU,EAAQ,GAAG,MAAMA,KAAawqC,GAAoB,SAAYD,EAAUxqB,EAAOnjB,CAAC,EAAGqX,CAAC,CAAC,EAAE,OAAO,CAAC83B,EAAM,EAAK,CAAC,CAAC,CAC7H,GAEUC,IACFC,EAAiB,2BAA2B,EAAI,SAAUrvC,EAAGqX,EAAG,CAC9D,OAAO+3B,EAAG,MAAM,UAAYxB,GAAoB,SAAYD,EAAUt2B,EAAGrX,CAAC,CAAC,EAAE,OAAO,CAACmvC,EAAM,EAAI,CAAC,CAAC,CAC3G,EACQE,EAAiB,qBAAqB,EAAI,SAAUrvC,EAAGqX,EAAG,CACxD,OAAO+3B,EAAG,MAAM,UAAYxB,GAAoB,SAAYD,EAAUxqB,EAAO9L,CAAC,EAAGrX,CAAC,CAAC,EAAE,OAAO,CAACmvC,EAAM,EAAI,CAAC,CAAC,CACnH,KAKME,EAAmB,CACjB,2BAA4BvqC,EAAM,YAAY,SAAUkK,EAAM,CAC5D,OAAO,SAAUhP,EAAG,EAAG,CACrB,OAAOutC,EAAa,MAAM,UAAYK,GAAoB,SAAYD,EAAU3tC,EAAG,CAAC,CAAC,EAAE,OAAO,CAACgP,CAAI,CAAC,CAAC,CACjH,CACA,CAAS,EACD,eAAgBlK,EAAM,YAAY,SAAUkK,EAAM,CAChD,OAAO,SAAUhP,EAAG,EAAG,CACrB,OAAOutC,EAAa,MAAM,UAAYK,GAAoB,SAAYD,EAAUxqB,EAAOnjB,CAAC,EAAGmjB,EAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAACnU,CAAI,CAAC,CAAC,EAAE,SACnI,CACA,CAAS,EACD,qBAAsBlK,EAAM,YAAY,SAAUkK,EAAM,CACtD,OAAO,SAAUhP,EAAG,EAAG,CACrB,OAAOutC,EAAa,MAAM,UAAYK,GAAoB,SAAYD,EAAUxqB,EAAOnjB,CAAC,EAAG,CAAC,CAAC,EAAE,OAAO,CAACgP,CAAI,CAAC,CAAC,CACzH,CACA,CAAS,EACD,qBAAsBlK,EAAM,YAAY,SAAUkK,EAAM,CACtD,OAAO,SAAUhP,EAAG,EAAG,CACrB,OAAOutC,EAAa,MAAM,UAAYK,GAAoB,SAAYD,EAAU3tC,EAAGmjB,EAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAACnU,CAAI,CAAC,CAAC,CACzH,CACA,CAAS,CACT,EAEU5L,EAAQ,KACVisC,EAAiB,4BAA4B,EAAIvqC,EAAM,YAAY,SAAUkK,EAAM,CACjF,OAAO,SAAUhP,EAAG,EAAG,CACrB,OAAOoD,EAAQ,GAAG,MAAMA,KAAawqC,GAAoB,SAAYD,EAAU3tC,EAAG,CAAC,CAAC,EAAE,OAAO,CAACgP,EAAM,EAAK,CAAC,CAAC,CACvH,CACA,CAAS,GAEC5L,EAAQ,KACVisC,EAAiB,2BAA2B,EAAIvqC,EAAM,YAAY,SAAUkK,EAAM,CAChF,OAAO,SAAUhP,EAAG,EAAG,CACrB,OAAOoD,EAAQ,GAAG,MAAMA,KAAawqC,GAAoB,SAAYD,EAAU3tC,EAAG,CAAC,CAAC,EAAE,OAAO,CAACgP,EAAM,EAAK,CAAC,CAAC,CACvH,CACA,CAAS,EACDqgC,EAAiB,qBAAqB,EAAIvqC,EAAM,YAAY,SAAUkK,EAAM,CAC1E,OAAO,SAAUhP,EAAG,EAAG,CACrB,OAAOoD,EAAQ,GAAG,MAAMA,KAAawqC,GAAoB,SAAYD,EAAUxqB,EAAOnjB,CAAC,EAAG,CAAC,CAAC,EAAE,OAAO,CAACgP,EAAM,EAAK,CAAC,CAAC,CAC/H,CACA,CAAS,GAECogC,IACFC,EAAiB,2BAA2B,EAAIvqC,EAAM,YAAY,SAAUkK,EAAM,CAChF,OAAO,SAAUhP,EAAG,EAAG,CACrB,OAAOovC,EAAG,MAAM,UAAYxB,GAAoB,SAAYD,EAAU,EAAG3tC,CAAC,CAAC,EAAE,OAAO,CAACgP,EAAM,EAAI,CAAC,CAAC,CAC7G,CACA,CAAS,EACDqgC,EAAiB,qBAAqB,EAAIvqC,EAAM,YAAY,SAAUkK,EAAM,CAC1E,OAAO,SAAUhP,EAAG,EAAG,CACrB,OAAOovC,EAAG,MAAM,UAAYxB,GAAoB,SAAYD,EAAUxqB,EAAO,CAAC,EAAGnjB,CAAC,CAAC,EAAE,OAAO,CAACgP,EAAM,EAAI,CAAC,CAAC,CACrH,CACA,CAAS,IAKL,IAAIsgC,EAASlsC,EAAQ,QAAU,MAC3BmsC,EAAKnsC,EAAQ,IAAMA,EAAQ,GAC3BmsC,IACEJ,GACFE,EAAiB,eAAiBC,CAAM,EAAI,SAAUtvC,EAAGqX,EAAG,CAC1D,OAAOwyB,EAAa7pC,EAAGqX,EAAG83B,EAAM,EAAK,CAC/C,EACQE,EAAiBC,EAAS,eAAe,EAAI,SAAUtvC,EAAGqX,EAAG,CAC3D,OAAOwyB,EAAaxyB,EAAGrX,EAAGmvC,EAAM,EAAI,CAC9C,EACQE,EAAiB,SAAWC,CAAM,EAAI,SAAUtvC,EAAGqX,EAAG,CACpD,OAAOwyB,EAAa1mB,EAAOnjB,CAAC,EAAGqX,EAAG83B,EAAM,EAAK,EAAE,SACzD,EACQE,EAAiBC,EAAS,SAAS,EAAI,SAAUtvC,EAAGqX,EAAG,CACrD,OAAOwyB,EAAa1mB,EAAO9L,CAAC,EAAGrX,EAAGmvC,EAAM,EAAI,EAAE,SACxD,IAEQE,EAAiB,eAAiBC,CAAM,EAAIxqC,EAAM,YAAY,SAAUkK,EAAM,CAC5E,OAAO,SAAUhP,EAAG,EAAG,CACrB,OAAO6pC,EAAa7pC,EAAG,EAAGgP,EAAM,EAAK,CACjD,CACA,CAAS,EACDqgC,EAAiBC,EAAS,eAAe,EAAIxqC,EAAM,YAAY,SAAUkK,EAAM,CAC7E,OAAO,SAAUhP,EAAG,EAAG,CACrB,OAAO6pC,EAAa,EAAG7pC,EAAGgP,EAAM,EAAI,CAChD,CACA,CAAS,EACDqgC,EAAiB,SAAWC,CAAM,EAAIxqC,EAAM,YAAY,SAAUkK,EAAM,CACtE,OAAO,SAAUhP,EAAG,EAAG,CACrB,OAAO6pC,EAAa1mB,EAAOnjB,CAAC,EAAG,EAAGgP,EAAM,EAAK,EAAE,SAC3D,CACA,CAAS,EACDqgC,EAAiBC,EAAS,SAAS,EAAIxqC,EAAM,YAAY,SAAUkK,EAAM,CACvE,OAAO,SAAUhP,EAAG,EAAG,CACrB,OAAO6pC,EAAa1mB,EAAO,CAAC,EAAGnjB,EAAGgP,EAAM,EAAI,EAAE,SAC1D,CACA,CAAS,IAGL,IAAIwgC,EAAKpsC,EAAQ,KAAO,OAAYA,EAAQ,GAAKA,EAAQ,GACzD,OAAI+rC,GACE/rC,EAAQ,KACVisC,EAAiB,gBAAkBC,CAAM,EAAI,SAAUtvC,EAAGqX,EAAG,CAC3D,OAAOjU,EAAQ,GAAGpD,EAAGqX,EAAG83B,EAAM,EAAK,CAC7C,GAEUK,IACFH,EAAiBC,EAAS,gBAAgB,EAAI,SAAUtvC,EAAGqX,EAAG,CAC5D,OAAOm4B,EAAGn4B,EAAGrX,EAAGmvC,EAAM,EAAI,CACpC,KAGU/rC,EAAQ,KACVisC,EAAiB,gBAAkBC,CAAM,EAAIxqC,EAAM,YAAY,SAAUkK,EAAM,CAC7E,OAAO,SAAUhP,EAAG,EAAG,CACrB,OAAOoD,EAAQ,GAAGpD,EAAG,EAAGgP,EAAM,EAAK,CAC/C,CACA,CAAS,GAECwgC,IACFH,EAAiBC,EAAS,gBAAgB,EAAIxqC,EAAM,YAAY,SAAUkK,EAAM,CAC9E,OAAO,SAAUhP,EAAG,EAAG,CACrB,OAAOwvC,EAAG,EAAGxvC,EAAGgP,EAAM,EAAI,CACtC,CACA,CAAS,IAIDmgC,GAAQA,EAAK,eACXrsC,GAAQ,QAAQusC,EAAkBF,EAAK,UAAU,EAEhDE,CACX,CACA,CAAC,EACDN,GAAA,2BAAqCG,aC5NrC,OAAO,eAAeO,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAGC,GAUzB,SAASA,GAAe1pC,EAAIoX,EAAO3S,EAAKmP,EAAK,CAC3C,GAAI,EAAE,gBAAgB81B,IACpB,MAAM,IAAI,YAAY,kDAAkD,EAE1E,KAAK,GAAK1pC,EACV,KAAK,MAAQoX,EACb,KAAK,IAAM3S,EACX,KAAK,IAAMmP,EACX,KAAK,QAAU,yCAA2C5T,EAAK,KAAOoX,EAAQ,cAAgB3S,GAA4BmP,GAAQ,KAAO,IAAMA,EAAM,IAAM,aAC3J,KAAK,MAAQ,IAAI,MAAK,EAAG,KAC3B,CACA81B,GAAe,UAAY,IAAI,MAC/BA,GAAe,UAAU,YAAc,MACvCA,GAAe,UAAU,KAAO,iBAChCA,GAAe,UAAU,iBAAmB,GC3B5C,IAAIlzC,GAAyBY,GAC7B,OAAO,eAAewyB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAI+f,GAAmBnzC,GAAuBuD,GAAA,CAAgD,EAC1F6tC,GAAsBpxC,GAAuB8E,GAAA,CAAmD,EAChG8gB,GAAWre,EACX6rC,GAAkB92B,GAClB+2B,GAAoBvtB,GACpBwtB,GAAkB7a,GAClB8a,GAAwB7a,GACxBiL,GAAShL,GACT6a,GAAkB5a,GAClBxxB,GAAO,MACPia,GAAe,CAAC,QAAS,SAAU,cAAe,YAAa,cAAe,QAAQ,EACtFoyB,GAAW,iDACXC,GAAwB,GAAG,OAAOD,GAAU,IAAI,EAAE,OAAOA,GAAU,OAAO,EAAE,OAAOA,EAAQ,EAC/F,SAASE,GAAKzsC,EAAO,CACnB,MAAO,CAACA,EAAM,KAAK,SAAU0sC,EAAS,CACpC,OAAO,MAAM,QAAQA,CAAO,CAChC,CAAG,CACH,CACA,IAAIC,MAA+BjuB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACvF,IAAI6tB,EACAxrC,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACd4e,EAAc5e,EAAK,YACnBC,EAAYD,EAAK,UACjBG,EAAcH,EAAK,YACnBsrB,EAAStrB,EAAK,OACZ6pB,KAAqBsD,GAAgB,sBAAsB,CAC7D,MAAO9qC,CACX,CAAG,EACGioC,KAAuB8C,GAAkB,wBAAwB,CACnE,MAAO/qC,EACP,YAAau8B,CACjB,CAAG,EACGgM,KAAqByC,GAAgB,sBAAsB,CAC7D,MAAOhrC,EACP,YAAa8d,CACjB,CAAG,EACGmsB,KAA2BgB,GAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EA2BD,OAAOjpC,EAAMlB,GAAM,CACjB,iBAAkBu8B,GAAO,UACzB,uBAAwBoQ,EACxB,qBAAsB,SAA0BvwC,EAAGqX,EAAG,CACpD,OAAOrX,EAAE,IAAIqX,CAAC,CACf,CACF,EAAE03B,EAAqB,CACtB,GAAIhC,EACJ,GAAIT,EACJ,GAAIe,CACL,CAAA,GAAIiD,EAAS,MAAQX,GAAiB,SAAYW,EAAQJ,GAAuBprC,EAAM,YAAY,SAAUkK,EAAM,CAClH,OAAO,SAAUtN,EAAGC,EAAG0H,EAAM,CAE3B,QADI+nB,EAAMpiB,EAAKtN,EAAGC,CAAC,EACV9E,EAAI,EAAGA,EAAIwM,EAAK,OAAQxM,IAC/Bu0B,EAAMpiB,EAAKoiB,EAAK/nB,EAAKxM,CAAC,CAAC,EAEzB,OAAOu0B,CACb,CACA,CAAG,CAAC,KAAOue,GAAiB,SAAYW,EAAQ,QAASxrC,EAAM,YAAY,SAAUkK,EAAM,CACvF,OAAO,SAAUtL,EAAO,CACtB,GAAIA,EAAM,SAAW,GAAK,MAAM,QAAQA,EAAM,CAAC,CAAC,GAAKysC,GAAKzsC,EAAM,CAAC,CAAC,EAChE,OAAOsL,EAAK,MAAM,UAAY4+B,GAAoB,SAAYlqC,EAAM,CAAC,CAAC,CAAC,EAEzE,GAAIysC,GAAKzsC,CAAK,EACZ,OAAOsL,EAAK,MAAM,UAAY4+B,GAAoB,SAAYlqC,CAAK,CAAC,EAEtE,MAAM,IAAIssC,GAAgB,eAAe,kCAAkC,CACjF,CACA,CAAG,CAAC,KAAOL,GAAiB,SAAYW,EAAQ,SAAUxrC,EAAM,YAAY,SAAUkK,EAAM,CACxF,OAAO,SAAUmU,EAAQ,CACvB,OAAOnU,EAAKmU,EAAO,QAAO,CAAE,CAClC,CACA,CAAG,CAAC,EAAGmtB,IASL,SAASC,EAAc7uC,EAAGC,EAAG,CAC3B,GAAI,CAACD,EAAE,MAAK,GAAM,CAACC,EAAE,MAAK,EACxB,MAAM,IAAI,MAAM,oDAAoD,EAKtE,QADIqgC,EAAO,IAAItf,EAAU,CAAC,EACnB,CAAC/gB,EAAE,UAAU,CAClB,IAAImd,EAAIpd,EAAE,IAAIC,CAAC,EACfD,EAAIC,EACJA,EAAImd,CACL,CACD,OAAOpd,EAAE,GAAGsgC,CAAI,EAAItgC,EAAE,IAAK,EAAGA,CAC/B,CACH,CAAC,EACDkuB,GAAA,UAAoBygB,mBCjIpB,OAAO,eAAeG,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAIpuB,GAAWhlB,EACX2d,GAAkBhb,GAClB6D,GAAO,gBACPia,GAAe,CAAC,QAAS,aAAa,EACtC4yB,MAAyCruB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACjG,IAAI3d,EAAQ2d,EAAK,MACf4e,EAAc5e,EAAK,YAoBrB,OAAO,SAAuB+pB,EAAaC,EAAchrC,EAAUg3B,EAAS,CAE1E,IAAIsR,EAAQyC,EAAY,MACpBpD,EAAQoD,EAAY,MACpBnD,EAAMmD,EAAY,UAElBE,EAAUD,EAAa,QACvBE,EAASF,EAAa,OACtBG,EAAOH,EAAa,KACpBI,EAAQJ,EAAa,MACrBK,EAAML,EAAa,UAGvB,GAAIrD,EAAM,SAAWyD,EAAM,OACzB,MAAM,IAAI9xB,GAAgB,eAAequB,EAAM,OAAQyD,EAAM,MAAM,EAIrE,GAAIzD,EAAM,CAAC,IAAMyD,EAAM,CAAC,GAAKzD,EAAM,CAAC,IAAMyD,EAAM,CAAC,EAC/C,MAAM,IAAI,WAAW,iCAAmCzD,EAAQ,0BAA4ByD,EAAQ,GAAG,EAIzG,GAAI,CAACH,EACH,MAAM,IAAI,MAAM,oEAAoE,EAItF,IAAIzV,EAAOmS,EAAM,CAAC,EACdlS,EAAUkS,EAAM,CAAC,EAGjBE,EAEAvH,EAAKV,EAELW,EAAO,EAEPuH,EAAK9nC,EAGL,OAAO4nC,GAAQ,UAAYA,IAAQyD,IAErCxD,EAAKD,EAELtH,EAAKj9B,EAAM,KAAKu8B,EAAa,CAACiI,EAAIA,CAAE,CAAC,EAErCtH,EAAOl9B,EAAM,QAAQ,EAAGwkC,CAAE,EAE1BC,EAAKzkC,EAAM,KAAKrD,EAAU,CAAC6nC,EAAIA,CAAE,CAAC,GASpC,QALIE,EAAU,CAAA,EACVhR,EAAS,CAAA,EACTiR,EAAO,CAAA,EAGFjkB,EAAI,EAAGA,EAAI0R,EAAS1R,IAAK,CAEhCikB,EAAKjkB,CAAC,EAAIgT,EAAO,OAEjB,QAASM,EAAK8T,EAAKpnB,CAAC,EAAGuT,EAAK6T,EAAKpnB,EAAI,CAAC,EAAGF,EAAIwT,EAAIxT,EAAIyT,EAAIzT,IAAK,CAE5D,IAAIzoB,EAAI8vC,EAAOrnB,CAAC,EAEZorB,EAAMjY,EAAU8Q,EAAGmD,EAAQpnB,CAAC,EAAGykB,EAAMltC,CAAC,EAAE2oB,CAAC,CAAC,EAAI+jB,EAAGQ,EAAMltC,CAAC,EAAE2oB,CAAC,EAAGknB,EAAQpnB,CAAC,CAAC,EAEvEyc,EAAG2O,EAAK1O,CAAI,IAEfxJ,EAAO,KAAK37B,CAAC,EACb2sC,EAAQ,KAAKkH,CAAG,EAEnB,CACF,CAED,OAAAjH,EAAKvS,CAAO,EAAIsB,EAAO,OAGhBiU,EAAa,mBAAmB,CACrC,OAAQjD,EACR,MAAOhR,EACP,IAAKiR,EACL,KAAM,CAACxS,EAAMC,CAAO,EACpB,SAAUoS,CAChB,CAAK,CACL,CACA,CAAC,EACDkH,GAAA,oBAA8BC,aCtH9B,OAAO,eAAeE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAIvuB,GAAWhlB,EACX2d,GAAkBhb,GAClBi5B,GAAc13B,GACdsC,GAAO,iBACPia,GAAe,CAAC,QAAS,aAAa,EACtC+yB,MAA0CxuB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAClG,IAAI3d,EAAQ2d,EAAK,MACf4e,EAAc5e,EAAK,YAmBrB,OAAO,SAAwB,EAAG9gB,EAAGF,EAAU,CAE7C,IAAIk3B,EAAU,EAAE,QACZyQ,EAAQ,EAAE,MACVC,EAAM,EAAE,UAERqD,EAAU/qC,EAAE,QACZkrC,EAAQlrC,EAAE,MACVmrC,EAAMnrC,EAAE,UAGZ,GAAIynC,EAAM,SAAWyD,EAAM,OACzB,MAAM,IAAI9xB,GAAgB,eAAequB,EAAM,OAAQyD,EAAM,MAAM,EAIrE,GAAIzD,EAAM,CAAC,IAAMyD,EAAM,CAAC,GAAKzD,EAAM,CAAC,IAAMyD,EAAM,CAAC,EAC/C,MAAM,IAAI,WAAW,iCAAmCzD,EAAQ,0BAA4ByD,EAAQ,GAAG,EAIzG,IAAI5V,EAAOmS,EAAM,CAAC,EACdlS,EAAUkS,EAAM,CAAC,EAGjBE,EAEAvH,EAAKV,EAELW,EAAO,EAEPuH,EAAK9nC,EAGL,OAAO4nC,GAAQ,UAAYA,IAAQyD,IAErCxD,EAAKD,EAELtH,EAAKj9B,EAAM,KAAKu8B,EAAa,CAACiI,EAAIA,CAAE,CAAC,EAErCtH,EAAOl9B,EAAM,QAAQ,EAAGwkC,CAAE,EAE1BC,EAAKzkC,EAAM,KAAKrD,EAAU,CAAC6nC,EAAIA,CAAE,CAAC,GAgBpC,QAZIE,EAAU7Q,GAAW+T,EAAU,CAAA,EAAK,OACpClU,EAAS,CAAA,EACTiR,EAAO,CAAA,EAGPzpC,EAAIwpC,EAAU,CAAE,EAAG,OAEnB/f,EAAI,CAAA,EAEJqD,EAAI,CAAA,EAGCtH,EAAI,EAAGA,EAAI0R,EAAS1R,IAAK,CAEhCikB,EAAKjkB,CAAC,EAAIgT,EAAO,OAEjB,IAAID,EAAO/S,EAAI,EAMf,MAJIwT,GAAY,SAAS,EAAGxT,EAAGiE,EAAGzpB,EAAG8sB,EAAGyL,EAAMC,EAAQ+Q,CAAE,KAEpDvQ,GAAY,SAASr3B,EAAG6jB,EAAGiE,EAAGzpB,EAAG8sB,EAAGyL,EAAMC,EAAQ+Q,CAAE,EAEpDvpC,EAIF,QAFIslB,EAAImkB,EAAKjkB,CAAC,EAEPF,EAAIkT,EAAO,QAAQ,CAExB,IAAI37B,EAAI27B,EAAOlT,CAAC,EAEhB,GAAIwH,EAAEjwB,CAAC,IAAM07B,EAAM,CAEjB,IAAI9K,EAAIztB,EAAEnD,CAAC,EAENklC,EAAGtU,EAAGuU,CAAI,EAObxJ,EAAO,OAAOlT,EAAG,CAAC,GALlBkkB,EAAQ,KAAK/b,CAAC,EAEdnI,IAKd,MAEYkT,EAAO,OAAOlT,EAAG,CAAC,CAErB,KAKD,SAFI9d,EAAIiiC,EAAKjkB,CAAC,EAEPhe,EAAIgxB,EAAO,QAAQ,CAExB,IAAI1Z,EAAI0Z,EAAOhxB,CAAC,EAEZslB,EAAEhO,CAAC,IAAMyZ,EAEXC,EAAO,OAAOhxB,EAAG,CAAC,EAGlBA,GAEH,CAEJ,CAED,OAAAiiC,EAAKvS,CAAO,EAAIsB,EAAO,OAGhB,EAAE,mBAAmB,CAC1B,OAAQgR,EACR,MAAOhR,EACP,IAAKiR,EACL,KAAM,CAACxS,EAAMC,CAAO,EACpB,SAAUoS,CAChB,CAAK,CACL,CACA,CAAC,EACDqH,GAAA,qBAA+BC,GC3J/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIzuB,GAAWhlB,EACX0zC,GAAgB/wC,GAChBgxC,GAAiBzvC,GACjBgpC,GAAiBvmC,GACjBgsC,GAAwBj3B,GACxBqnB,GAAS7d,GACT1e,GAAO,MACPia,GAAe,CAAC,QAAS,SAAU,cAAe,QAAQ,EAC1DmzB,MAA+B5uB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACd4e,EAAc5e,EAAK,YACnBsrB,EAAStrB,EAAK,OACZ+tB,KAAoBM,GAAc,qBAAqB,CACzD,MAAOhsC,EACP,YAAau8B,CACjB,CAAG,EACGsP,KAAqBI,GAAe,sBAAsB,CAC5D,MAAOjsC,EACP,YAAau8B,CACjB,CAAG,EACG6H,KAAoBoB,GAAe,qBAAqB,CAC1D,MAAOxlC,EACP,YAAau8B,CACjB,CAAG,EACG0N,KAA2BgB,GAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EACGkD,EAAW,iDACXC,EAAmB,CAAA,EACvB,OAAAA,EAAiB,GAAG,OAAOD,EAAU,IAAI,EAAE,OAAOA,EAAU,OAAO,EAAE,OAAOA,CAAQ,CAAC,EAAInsC,EAAM,YAAY,SAAUkK,EAAM,CACzH,OAAO,SAAUtN,EAAGC,EAAG0H,EAAM,CAE3B,QADI+nB,EAAMpiB,EAAKtN,EAAGC,CAAC,EACV9E,EAAI,EAAGA,EAAIwM,EAAK,OAAQxM,IAC/Bu0B,EAAMpiB,EAAKoiB,EAAK/nB,EAAKxM,CAAC,CAAC,EAEzB,OAAOu0B,CACb,CACA,CAAG,EA+BMtsB,EAAMlB,GAAM,CACjB,iBAAkBu8B,GAAO,UACzB,uBAAwBgR,EACxB,qBAAsB,SAA0BnxC,EAAGqX,EAAG,CACpD,OAAOrX,EAAE,IAAIqX,CAAC,CACf,CACF,EAAE03B,EAAqB,CACtB,GAAI4B,EACJ,GAAIH,EACJ,GAAItH,CACR,CAAG,EAAGgI,CAAgB,EASpB,SAASC,EAAczvC,EAAGC,EAAG,CAC3B,GAAI,CAACD,EAAE,MAAK,GAAM,CAACC,EAAE,MAAK,EACxB,MAAM,IAAI,MAAM,oDAAoD,EAEtE,GAAID,EAAE,SACJ,OAAOA,EAET,GAAIC,EAAE,SACJ,OAAOA,EAMT,QADIkpB,EAAOnpB,EAAE,MAAMC,CAAC,EACb,CAACA,EAAE,UAAU,CAClB,IAAIxB,EAAIwB,EACRA,EAAID,EAAE,IAAIvB,CAAC,EACXuB,EAAIvB,CACL,CACD,OAAO0qB,EAAK,IAAInpB,CAAC,EAAE,IAAG,CACvB,CACH,CAAC,EACDmvC,GAAA,UAAoBG,aCpHpB,OAAO,eAAe/7B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAImN,GAAWhlB,EACX47B,GAAcj5B,GACdogC,GAAS7+B,GACTsC,GAAO,QACPia,GAAe,CAAC,QAAS,SAAU,SAAS,EAC5CuzB,MAAiChvB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACd2oB,EAAW3oB,EAAK,QA0BlB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,SAAgB5D,EAAG,CACzB,OAAIA,GAAK,GAAKhD,EAAO,eACRmjC,GAAO,aAAangC,CAAC,EAGzB,IAAIorC,EAASprC,EAAG,CAAC,EAAE,IAAG,EAAG,IAAI,KAAK,IAAI,CAEhD,EACD,QAAS,SAAiBA,EAAG,CAC3B,OAAO,IAAIorC,EAASprC,CAAC,EAAE,IAAK,EAAC,IAAI,KAAK,IAAI,CAC3C,EACD,UAAW,SAAmBA,EAAG,CAC/B,MAAI,CAACA,EAAE,cAAgBhD,EAAO,YACrBgD,EAAE,MAGF,IAAIorC,EAASprC,EAAE,WAAY,CAAC,EAAE,MAAM,IAAI,KAAK,IAAI,CAE3D,EACD,iBAAkB8E,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,CAAI,CAC/C,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACDiG,GAAA,YAAsBm8B,aCjEtB,OAAO,eAAep8B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIoN,GAAWhlB,EACX47B,GAAcj5B,GACdogC,GAAS7+B,GACTsC,GAAO,OACPia,GAAe,CAAC,QAAS,SAAU,SAAS,EAC5CwzB,MAAgCjvB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdE,EAAUF,EAAK,QA0BjB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,SAAgB5D,EAAG,CACzB,OAAIA,GAAK,GAAKhD,EAAO,eACRmjC,GAAO,YAAYngC,CAAC,EAGxBsxC,EAAa,IAAI3uB,EAAQ3iB,EAAG,CAAC,CAAC,CAExC,EACD,QAASsxC,EACT,UAAW,SAAmBtxC,EAAG,CAC/B,MAAI,CAACA,EAAE,cAAgBhD,EAAO,YACrBgD,EAAE,IAAI,CAAC,EAGPsxC,EAAa,IAAI3uB,EAAQ3iB,EAAE,SAAU,EAAE,CAAC,CAAC,CAEnD,EACD,iBAAkB8E,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,CAAI,CAC/C,CACA,CAAK,CACL,CAAG,EAQD,SAASsiC,EAAatxC,EAAG,CACvB,IAAIuxC,EAAO,KAAK,KAAKvxC,EAAE,GAAKA,EAAE,GAAKA,EAAE,GAAKA,EAAE,EAAE,EAC9C,OAAO,IAAI2iB,EAAQ,KAAK,KAAO,KAAK,KAAK4uB,CAAI,EAAI,KAAK,IAAIA,CAAI,EAAI,KAAK,IAAK,KAAK,MAAMvxC,EAAE,GAAIA,EAAE,EAAE,EAAI,KAAK,GAAG,CAC9G,CACH,CAAC,EACDgV,GAAA,WAAqBq8B,mBC1ErB,OAAO,eAAeG,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAIpvB,GAAWhlB,EACX2d,GAAkBhb,GAClB6D,GAAO,gBACPia,GAAe,CAAC,OAAO,EACvB4zB,MAAyCrvB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACjG,IAAI3d,EAAQ2d,EAAK,MAoBjB,OAAO,SAAuB+pB,EAAaC,EAAchrC,EAAUg3B,EAAS,CAE1E,IAAIsR,EAAQyC,EAAY,MACpBpD,EAAQoD,EAAY,MACpBnD,EAAMmD,EAAY,UAElBE,EAAUD,EAAa,QACvBE,EAASF,EAAa,OACtBG,EAAOH,EAAa,KACpBI,EAAQJ,EAAa,MACrBK,EAAML,EAAa,UAGvB,GAAIrD,EAAM,SAAWyD,EAAM,OACzB,MAAM,IAAI9xB,GAAgB,eAAequB,EAAM,OAAQyD,EAAM,MAAM,EAIrE,GAAIzD,EAAM,CAAC,IAAMyD,EAAM,CAAC,GAAKzD,EAAM,CAAC,IAAMyD,EAAM,CAAC,EAC/C,MAAM,IAAI,WAAW,iCAAmCzD,EAAQ,0BAA4ByD,EAAQ,GAAG,EAIzG,GAAI,CAACH,EACH,MAAM,IAAI,MAAM,oEAAoE,EAItF,IAAIzV,EAAOmS,EAAM,CAAC,EACdlS,EAAUkS,EAAM,CAAC,EAGjBE,EAEAtH,EAAO,EAEPuH,EAAK9nC,EAGL,OAAO4nC,GAAQ,UAAYA,IAAQyD,IAErCxD,EAAKD,EAELrH,EAAOl9B,EAAM,QAAQ,EAAGwkC,CAAE,EAE1BC,EAAKzkC,EAAM,KAAKrD,EAAU,CAAC6nC,EAAIA,CAAE,CAAC,GAOpC,QAHIM,EAAQ,CAAA,EAGHrhB,EAAI,EAAGA,EAAI0O,EAAM1O,IAExBqhB,EAAMrhB,CAAC,EAAI,GASb,QALIvoB,EAAI,CAAA,EAEJypB,EAAI,CAAA,EAGCjE,EAAI,EAAGA,EAAI0R,EAAS1R,IAAK,CAIhC,QAFI+S,EAAO/S,EAAI,EAENsT,EAAK8T,EAAKpnB,CAAC,EAAGuT,EAAK6T,EAAKpnB,EAAI,CAAC,EAAGF,EAAIwT,EAAIxT,EAAIyT,EAAIzT,IAAK,CAE5D,IAAIzoB,EAAI8vC,EAAOrnB,CAAC,EAEhBtlB,EAAEnD,CAAC,EAAI47B,EAAU8Q,EAAGmD,EAAQpnB,CAAC,EAAGykB,EAAMltC,CAAC,EAAE2oB,CAAC,CAAC,EAAI+jB,EAAGQ,EAAMltC,CAAC,EAAE2oB,CAAC,EAAGknB,EAAQpnB,CAAC,CAAC,EACzEmE,EAAE5sB,CAAC,EAAI07B,CACR,CAED,QAASlhB,EAAI,EAAGA,EAAI4f,EAAM5f,IAEpBoS,EAAEpS,CAAC,IAAMkhB,EAEXqR,EAAMvyB,CAAC,EAAEmO,CAAC,EAAIxlB,EAAEqX,CAAC,EAGjBuyB,EAAMvyB,CAAC,EAAEmO,CAAC,EAAIiT,EAAU8Q,EAAGvH,EAAM+H,EAAM1yB,CAAC,EAAEmO,CAAC,CAAC,EAAI+jB,EAAGQ,EAAM1yB,CAAC,EAAEmO,CAAC,EAAGwc,CAAI,CAGzE,CAGD,OAAOwK,EAAY,kBAAkB,CACnC,KAAM5C,EACN,KAAM,CAAC3S,EAAMC,CAAO,EACpB,SAAUoS,CAChB,CAAK,CACL,CACA,CAAC,EACDkI,GAAA,oBAA8BC,aC5H9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAItvB,GAAWhlB,EACX2d,GAAkBhb,GAClB6D,GAAO,iBACPia,GAAe,CAAC,QAAS,aAAa,EACtC8zB,MAA0CvvB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAClG,IAAI3d,EAAQ2d,EAAK,MACf4e,EAAc5e,EAAK,YAmBrB,OAAO,SAAwB,EAAG9gB,EAAGF,EAAU,CAE7C,IAAIk3B,EAAU,EAAE,QACZC,EAAS,EAAE,OACXC,EAAO,EAAE,KACTuQ,EAAQ,EAAE,MACVC,EAAM,EAAE,UAERqD,EAAU/qC,EAAE,QACZgrC,EAAShrC,EAAE,OACXirC,EAAOjrC,EAAE,KACTkrC,EAAQlrC,EAAE,MACVmrC,EAAMnrC,EAAE,UAGZ,GAAIynC,EAAM,SAAWyD,EAAM,OACzB,MAAM,IAAI9xB,GAAgB,eAAequB,EAAM,OAAQyD,EAAM,MAAM,EAIrE,GAAIzD,EAAM,CAAC,IAAMyD,EAAM,CAAC,GAAKzD,EAAM,CAAC,IAAMyD,EAAM,CAAC,EAC/C,MAAM,IAAI,WAAW,iCAAmCzD,EAAQ,0BAA4ByD,EAAQ,GAAG,EAIzG,IAAI5V,EAAOmS,EAAM,CAAC,EACdlS,EAAUkS,EAAM,CAAC,EAGjBE,EAEAvH,EAAKV,EAELW,EAAO,EAEPuH,EAAK9nC,EAGL,OAAO4nC,GAAQ,UAAYA,IAAQyD,IAErCxD,EAAKD,EAELtH,EAAKj9B,EAAM,KAAKu8B,EAAa,CAACiI,EAAIA,CAAE,CAAC,EAErCtH,EAAOl9B,EAAM,QAAQ,EAAGwkC,CAAE,EAE1BC,EAAKzkC,EAAM,KAAKrD,EAAU,CAAC6nC,EAAIA,CAAE,CAAC,GAIpC,IAAIE,EAAU7Q,GAAW+T,EAAU,CAAA,EAAK,OACpClU,EAAS,CAAA,EACTiR,EAAO,CAAA,EAGPwD,EAAKzD,EAAU,CAAE,EAAG,OACpB0D,EAAK1D,EAAU,CAAE,EAAG,OAEpB2D,EAAK,CAAA,EACLC,EAAK,CAAA,EAGLvwC,EAAG2oB,EAAGF,EAAGyT,EAGb,IAAKvT,EAAI,EAAGA,EAAI0R,EAAS1R,IAAK,CAE5BikB,EAAKjkB,CAAC,EAAIgT,EAAO,OAEjB,IAAID,EAAO/S,EAAI,EAEf,IAAKF,EAAIuT,EAAKrT,CAAC,EAAGuT,EAAKF,EAAKrT,EAAI,CAAC,EAAGF,EAAIyT,EAAIzT,IAE1CzoB,EAAI+7B,EAAOtT,CAAC,EAEZkT,EAAO,KAAK37B,CAAC,EAEbswC,EAAGtwC,CAAC,EAAI07B,EAEJ0U,IACFA,EAAGpwC,CAAC,EAAI87B,EAAQrT,CAAC,GAIrB,IAAKA,EAAIsnB,EAAKpnB,CAAC,EAAGuT,EAAK6T,EAAKpnB,EAAI,CAAC,EAAGF,EAAIyT,EAAIzT,IAE1CzoB,EAAI8vC,EAAOrnB,CAAC,EAER6nB,EAAGtwC,CAAC,IAAM07B,GAEZC,EAAO,KAAK37B,CAAC,EAGfuwC,EAAGvwC,CAAC,EAAI07B,EAEJ2U,IACFA,EAAGrwC,CAAC,EAAI6vC,EAAQpnB,CAAC,GAIrB,GAAIkkB,EAIF,IAFAlkB,EAAImkB,EAAKjkB,CAAC,EAEHF,EAAIkT,EAAO,QAAQ,CAExB37B,EAAI27B,EAAOlT,CAAC,EAEZ,IAAIssB,EAAMzE,EAAGtwC,CAAC,EACVg1C,EAAMzE,EAAGvwC,CAAC,EAEd,GAAI+0C,IAAQrZ,GAAQsZ,IAAQtZ,EAAM,CAEhC,IAAIuZ,EAAKF,IAAQrZ,EAAO0U,EAAGpwC,CAAC,EAAImlC,EAC5B+P,GAAKF,IAAQtZ,EAAO2U,EAAGrwC,CAAC,EAAImlC,EAE5BgQ,EAAKzI,EAAGuI,EAAIC,EAAE,EAEbhQ,EAAGiQ,EAAIhQ,CAAI,EAOdxJ,EAAO,OAAOlT,EAAG,CAAC,GALlBkkB,EAAQ,KAAKwI,CAAE,EAEf1sB,IAKH,CACF,CAEJ,CAED,OAAAmkB,EAAKvS,CAAO,EAAIsB,EAAO,OAGhB,EAAE,mBAAmB,CAC1B,OAAQgR,EACR,MAAOhR,EACP,IAAKiR,EACL,KAAM,CAACxS,EAAMC,CAAO,EACpB,SAAUoS,CAChB,CAAK,CACL,CACA,CAAC,EACDoI,GAAA,qBAA+BC,GC7K/B,OAAO,eAAexjB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAI/L,GAAWhlB,EACX0zC,GAAgB/wC,GAChBkyC,GAAiB3wC,GACjB4wC,GAAkBnuC,GAClBumC,GAAiBxxB,GACjByxB,GAAiBjoB,GACjB6d,GAASlL,GACT8a,GAAwB7a,GACxBtxB,GAAO,MACPia,GAAe,CAAC,QAAS,SAAU,cAAe,cAAe,QAAQ,EACzEs0B,MAA+B/vB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACd4e,EAAc5e,EAAK,YACnBG,EAAcH,EAAK,YACnBsrB,EAAStrB,EAAK,OACZ+tB,KAAoBM,GAAc,qBAAqB,CACzD,MAAOhsC,EACP,YAAau8B,CACjB,CAAG,EACGmQ,KAAoBS,GAAe,qBAAqB,CAC1D,MAAOntC,CACX,CAAG,EACG4sC,KAAqBQ,GAAgB,sBAAsB,CAC7D,MAAOptC,EACP,YAAau8B,CACjB,CAAG,EACG6H,KAAoBoB,GAAe,qBAAqB,CAC1D,MAAOxlC,EACP,YAAau8B,CACjB,CAAG,EACGqI,KAAoBa,GAAe,qBAAqB,CAC1D,MAAOzlC,EACP,YAAa8d,CACjB,CAAG,EACGmsB,KAA2BgB,GAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EAqCD,OAAOjpC,EAAMlB,GAAM,CACjB,iBAAkBu8B,GAAO,UACzB,uBAAwB,SAA4BngC,EAAGqX,EAAG,CACxD,GAAIA,EAAE,QACJ,MAAM,IAAI,MAAM,6CAA6C,EAE/D,OAAOA,EAAE,SAAWrX,EAAIA,EAAE,IAAIqX,CAAC,CAChC,EACD,qBAAsB,SAA0BrX,EAAGqX,EAAG,CACpD,GAAIA,EAAE,QAAQ,CAAC,EAAI,EACjB,MAAM,IAAI,MAAM,6CAA6C,EAG/D,OAAOrX,EAAE,QAAQ,CAAC,GAAK,EAAIA,EAAE,IAAIqX,CAAC,EAAIrX,EAAE,IAAIqX,CAAC,EAAE,IAAIA,CAAC,EAAE,IAAIA,CAAC,CAC5D,CACF,EAAE03B,EAAqB,CACtB,GAAI2C,EACJ,GAAIF,EACJ,GAAIhB,EACJ,GAAItH,EACJ,GAAIQ,CACL,CAAA,CAAC,CACJ,CAAC,EACDvb,GAAA,UAAoBgkB,aCvGpB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAIhwB,GAAWhlB,EACX+iC,GAASpgC,GACT6D,GAAO,iBACPia,GAAe,CAAC,OAAO,EACvBw0B,MAA0CjwB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAClG,IAAI3d,EAAQ2d,EAAK,MAajB,OAAO3d,EAAM,iBAAkB,CAC7B,iBAAkBq7B,GAAO,eACzB,mBAAoB,SAAwBngC,EAAGqX,EAAG,CAChD,OAAOrX,EAAE,IAAIqX,CAAC,CACf,EACD,uBAAwB,SAA4BrX,EAAGqX,EAAG,CACxD,OAAOrX,EAAE,MAAMqX,CAAC,CACjB,EACD,qBAAsB,SAA0BrX,EAAGqX,EAAG,CACpD,OAAOrX,EAAE,IAAIqX,CAAC,CACf,EACD,gDAAiD,SAA4CrX,EAAGqX,EAAG,CACjG,OAAOA,EAAE,SAASrX,CAAC,CACpB,EACD,uDAAwD,SAAgDA,EAAGqX,EAAG,CAC5G,OAAOrX,EAAE,SAASqX,CAAC,CACpB,CACL,CAAG,CACH,CAAC,EACD+6B,GAAA,qBAA+BC,aCzC/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAIlwB,GAAWhlB,EACXiE,GAAMtB,GACN6d,GAAStc,GACTgpC,GAAiBvmC,GACjBymC,GAAgB1xB,GAChBlV,GAAO,WACPia,GAAe,CAAC,QAAS,SAAU,YAAa,iBAAkB,cAAe,KAAK,EACtF00B,MAAoCnwB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC5F,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdqlB,EAAYrlB,EAAK,UACjB2vB,EAAiB3vB,EAAK,eACtB4e,EAAc5e,EAAK,YACnBtM,EAAMsM,EAAK,IACTymB,KAAoBoB,GAAe,qBAAqB,CAC1D,MAAOxlC,EACP,YAAau8B,CACjB,CAAG,EACGwI,KAAmBW,GAAc,oBAAoB,CACvD,MAAO1lC,CACX,CAAG,EACD,SAAS0tC,EAA0BC,EAAOC,EAAO,CAE/C,OAAQD,EAAM,OAAM,CAClB,IAAK,GAEH,OAAQC,EAAM,OAAM,CAClB,IAAK,GAEH,GAAID,EAAM,CAAC,IAAMC,EAAM,CAAC,EAEtB,MAAM,IAAI,WAAW,yEAAyE,EAEhG,MACF,IAAK,GAEH,GAAID,EAAM,CAAC,IAAMC,EAAM,CAAC,EAEtB,MAAM,IAAI,WAAW,wDAA0DD,EAAM,CAAC,EAAI,6BAA+BC,EAAM,CAAC,EAAI,GAAG,EAEzI,MACF,QACE,MAAM,IAAI,MAAM,+DAAiEA,EAAM,OAAS,cAAc,CACjH,CACD,MACF,IAAK,GAEH,OAAQA,EAAM,OAAM,CAClB,IAAK,GAEH,GAAID,EAAM,CAAC,IAAMC,EAAM,CAAC,EAEtB,MAAM,IAAI,WAAW,yDAA2DD,EAAM,CAAC,EAAI,+BAAiCC,EAAM,CAAC,EAAI,GAAG,EAE5I,MACF,IAAK,GAEH,GAAID,EAAM,CAAC,IAAMC,EAAM,CAAC,EAEtB,MAAM,IAAI,WAAW,2DAA6DD,EAAM,CAAC,EAAI,+BAAiCC,EAAM,CAAC,EAAI,GAAG,EAE9I,MACF,QACE,MAAM,IAAI,MAAM,+DAAiEA,EAAM,OAAS,cAAc,CACjH,CACD,MACF,QACE,MAAM,IAAI,MAAM,+DAAiED,EAAM,OAAS,cAAc,CACjH,CACF,CAUD,SAASE,EAAsBjxC,EAAGC,EAAG6T,EAAG,CAEtC,GAAIA,IAAM,EACR,MAAM,IAAI,MAAM,mCAAmC,EAErD,OAAOW,EAAIzU,EAAGC,CAAC,CAChB,CAUD,SAASixC,EAAsBlxC,EAAGC,EAAG,CAEnC,GAAIA,EAAE,QAAS,IAAK,QAClB,MAAM,IAAI,MAAM,0CAA0C,EAE5D,OAAOkxC,EAA2BnxC,EAAGC,CAAC,CACvC,CAUD,SAASkxC,EAA2BnxC,EAAGC,EAAG,CAExC,IAAIooC,EAAQroC,EAAE,MACV0nC,EAAQ1nC,EAAE,MACV2nC,EAAM3nC,EAAE,UAER+rC,EAAQ9rC,EAAE,MACVkrC,EAAQlrC,EAAE,MACVmrC,EAAMnrC,EAAE,UAERmxC,EAAU1J,EAAM,CAAC,EACjB2J,EAAWlG,EAAM,CAAC,EAGlBvD,EAEA0J,EAAKlL,EAELmL,EAAKb,EAGL/I,GAAOyD,GAAOzD,IAAQyD,GAAO,OAAOzD,GAAQ,WAE9CC,EAAKD,EAEL2J,EAAKluC,EAAM,KAAKgjC,EAAW,CAACwB,EAAIA,CAAE,CAAC,EACnC2J,EAAKnuC,EAAM,KAAKstC,EAAgB,CAAC9I,EAAIA,CAAE,CAAC,GAO1C,QAHIp9B,EAAI,CAAA,EAGCsZ,EAAI,EAAGA,EAAIutB,EAAUvtB,IAAK,CAIjC,QAFI4G,EAAM6mB,EAAGlJ,EAAM,CAAC,EAAG0D,EAAM,CAAC,EAAEjoB,CAAC,CAAC,EAEzB3oB,EAAI,EAAGA,EAAIi2C,EAASj2C,IAE3BuvB,EAAM4mB,EAAG5mB,EAAK6mB,EAAGlJ,EAAMltC,CAAC,EAAG4wC,EAAM5wC,CAAC,EAAE2oB,CAAC,CAAC,CAAC,EAEzCtZ,EAAEsZ,CAAC,EAAI4G,CACR,CAGD,OAAO1qB,EAAE,kBAAkB,CACzB,KAAMwK,EACN,KAAM,CAAC6mC,CAAQ,EACf,SAAUzJ,CAChB,CAAK,CACF,CAUD,IAAI4J,EAAwBpuC,EAAM,wBAAyB,CACzD,mBAAoBquC,EACpB,oBAAqBC,CACzB,CAAG,EAUGC,EAAwBvuC,EAAM,wBAAyB,CACzD,2BAA4BwuC,EAC5B,4BAA6BC,EAC7B,4BAA6BC,EAC7B,6BAA8BC,CAClC,CAAG,EAUD,SAASN,EAA2BzxC,EAAGC,EAAG,CAExC,IAAIooC,EAAQroC,EAAE,MACV0nC,EAAQ1nC,EAAE,MACV2nC,EAAM3nC,EAAE,UAER+rC,EAAQ9rC,EAAE,MACVmrC,EAAMnrC,EAAE,UAER+xC,EAAQtK,EAAM,CAAC,EACfuK,EAAWvK,EAAM,CAAC,EAGlBE,EAEA0J,EAAKlL,EAELmL,EAAKb,EAGL/I,GAAOyD,GAAOzD,IAAQyD,GAAO,OAAOzD,GAAQ,WAE9CC,EAAKD,EAEL2J,EAAKluC,EAAM,KAAKgjC,EAAW,CAACwB,EAAIA,CAAE,CAAC,EACnC2J,EAAKnuC,EAAM,KAAKstC,EAAgB,CAAC9I,EAAIA,CAAE,CAAC,GAO1C,QAHIp9B,EAAI,CAAA,EAGCrP,EAAI,EAAGA,EAAI62C,EAAO72C,IAAK,CAM9B,QAJI85B,EAAMoT,EAAMltC,CAAC,EAEbuvB,EAAM6mB,EAAGtc,EAAI,CAAC,EAAG8W,EAAM,CAAC,CAAC,EAEpBjoB,EAAI,EAAGA,EAAImuB,EAAUnuB,IAE5B4G,EAAM4mB,EAAG5mB,EAAK6mB,EAAGtc,EAAInR,CAAC,EAAGioB,EAAMjoB,CAAC,CAAC,CAAC,EAEpCtZ,EAAErP,CAAC,EAAIuvB,CACR,CAGD,OAAO1qB,EAAE,kBAAkB,CACzB,KAAMwK,EACN,KAAM,CAACwnC,CAAK,EACZ,SAAUpK,CAChB,CAAK,CACF,CAUD,SAASgK,EAAgC5xC,EAAGC,EAAG,CAE7C,IAAIooC,EAAQroC,EAAE,MACV0nC,EAAQ1nC,EAAE,MACV2nC,EAAM3nC,EAAE,UAER+rC,EAAQ9rC,EAAE,MACVkrC,EAAQlrC,EAAE,MACVmrC,EAAMnrC,EAAE,UAER+xC,EAAQtK,EAAM,CAAC,EACfuK,EAAWvK,EAAM,CAAC,EAClB2J,EAAWlG,EAAM,CAAC,EAGlBvD,EAEA0J,EAAKlL,EAELmL,EAAKb,EAGL/I,GAAOyD,GAAOzD,IAAQyD,GAAO,OAAOzD,GAAQ,WAE9CC,EAAKD,EAEL2J,EAAKluC,EAAM,KAAKgjC,EAAW,CAACwB,EAAIA,CAAE,CAAC,EACnC2J,EAAKnuC,EAAM,KAAKstC,EAAgB,CAAC9I,EAAIA,CAAE,CAAC,GAO1C,QAHIp9B,EAAI,CAAA,EAGCrP,EAAI,EAAGA,EAAI62C,EAAO72C,IAAK,CAE9B,IAAI85B,EAAMoT,EAAMltC,CAAC,EAEjBqP,EAAErP,CAAC,EAAI,GAEP,QAAS2oB,GAAI,EAAGA,GAAIutB,EAAUvtB,KAAK,CAIjC,QAFI4G,EAAM6mB,EAAGtc,EAAI,CAAC,EAAG8W,EAAM,CAAC,EAAEjoB,EAAC,CAAC,EAEvBxlB,EAAI,EAAGA,EAAI2zC,EAAU3zC,IAE5BosB,EAAM4mB,EAAG5mB,EAAK6mB,EAAGtc,EAAI32B,CAAC,EAAGytC,EAAMztC,CAAC,EAAEwlB,EAAC,CAAC,CAAC,EAEvCtZ,EAAErP,CAAC,EAAE2oB,EAAC,EAAI4G,CACX,CACF,CAGD,OAAO1qB,EAAE,kBAAkB,CACzB,KAAMwK,EACN,KAAM,CAACwnC,EAAOX,CAAQ,EACtB,SAAUzJ,CAChB,CAAK,CACF,CAUD,SAASiK,EAAiC7xC,EAAGC,EAAG,CAE9C,IAAIooC,EAAQroC,EAAE,MACV0nC,EAAQ1nC,EAAE,MACV2nC,EAAM3nC,EAAE,UAERgrC,EAAU/qC,EAAE,QACZgrC,EAAShrC,EAAE,OACXirC,EAAOjrC,EAAE,KACTkrC,EAAQlrC,EAAE,MACVmrC,EAAMnrC,EAAE,UAEZ,GAAI,CAAC+qC,EACH,MAAM,IAAI,MAAM,wDAAwD,EAG1E,IAAIgH,EAAQtK,EAAM,CAAC,EACf2J,EAAWlG,EAAM,CAAC,EAGlBvD,EAEA0J,EAAKlL,EAELmL,EAAKb,EAELrQ,EAAKV,EAELW,EAAO,EAGPqH,GAAOyD,GAAOzD,IAAQyD,GAAO,OAAOzD,GAAQ,WAE9CC,EAAKD,EAEL2J,EAAKluC,EAAM,KAAKgjC,EAAW,CAACwB,EAAIA,CAAE,CAAC,EACnC2J,EAAKnuC,EAAM,KAAKstC,EAAgB,CAAC9I,EAAIA,CAAE,CAAC,EACxCvH,EAAKj9B,EAAM,KAAKu8B,EAAa,CAACiI,EAAIA,CAAE,CAAC,EAErCtH,EAAOl9B,EAAM,QAAQ,EAAGwkC,CAAE,GAiB5B,QAbIE,GAAU,CAAA,EACVhR,EAAS,CAAA,EACTiR,EAAO,CAAA,EAEPv9B,GAAIvK,EAAE,mBAAmB,CAC3B,OAAQ6nC,GACR,MAAOhR,EACP,IAAKiR,EACL,KAAM,CAACiK,EAAOX,CAAQ,EACtB,SAAUzJ,CAChB,CAAK,EAGQsK,GAAK,EAAGA,GAAKb,EAAUa,KAAM,CAEpCnK,EAAKmK,EAAE,EAAIpb,EAAO,OAElB,IAAIqb,GAAMjH,EAAKgH,EAAE,EACbE,GAAMlH,EAAKgH,GAAK,CAAC,EAErB,GAAIE,GAAMD,GAIR,QAFIlrC,GAAO,EAEF9L,GAAI,EAAGA,GAAI62C,EAAO72C,KAAK,CAM9B,QAJI07B,GAAO17B,GAAI,EAEX6zC,GAAM,OAEDqD,GAAKF,GAAKE,GAAKD,GAAKC,KAAM,CAEjC,IAAIC,GAAKrH,EAAOoH,EAAE,EAEdprC,KAAS4vB,IAEXmY,GAAMuC,EAAGlJ,EAAMltC,EAAC,EAAEm3C,EAAE,EAAGtH,EAAQqH,EAAE,CAAC,EAElCprC,GAAO4vB,IAGPmY,GAAMsC,EAAGtC,GAAKuC,EAAGlJ,EAAMltC,EAAC,EAAEm3C,EAAE,EAAGtH,EAAQqH,EAAE,CAAC,CAAC,CAE9C,CAEGprC,KAAS4vB,IAAQ,CAACwJ,EAAG2O,GAAK1O,CAAI,IAEhCxJ,EAAO,KAAK37B,EAAC,EACb2sC,GAAQ,KAAKkH,EAAG,EAEnB,CAEJ,CAED,OAAAjH,EAAKsJ,CAAQ,EAAIva,EAAO,OAGjBtsB,EACR,CAUD,SAASknC,EAA4B1xC,EAAGC,EAAG,CAEzC,IAAIg3B,EAAUj3B,EAAE,QACZk3B,EAASl3B,EAAE,OACXm3B,EAAOn3B,EAAE,KACT2nC,EAAM3nC,EAAE,UAEZ,GAAI,CAACi3B,EACH,MAAM,IAAI,MAAM,wDAAwD,EAG1E,IAAI8U,EAAQ9rC,EAAE,MACVmrC,EAAMnrC,EAAE,UAER+xC,EAAQhyC,EAAE,MAAM,CAAC,EACjBuyC,EAAQtyC,EAAE,MAAM,CAAC,EAEjB6nC,EAAU,CAAA,EACVhR,EAAS,CAAA,EACTiR,EAAO,CAAA,EAGPH,EAEA0J,EAAKlL,EAELmL,EAAKb,EAELrQ,EAAKV,EAELW,GAAO,EAGPqH,GAAOyD,GAAOzD,IAAQyD,GAAO,OAAOzD,GAAQ,WAE9CC,EAAKD,EAEL2J,EAAKluC,EAAM,KAAKgjC,EAAW,CAACwB,EAAIA,CAAE,CAAC,EACnC2J,EAAKnuC,EAAM,KAAKstC,EAAgB,CAAC9I,EAAIA,CAAE,CAAC,EACxCvH,EAAKj9B,EAAM,KAAKu8B,EAAa,CAACiI,EAAIA,CAAE,CAAC,EAErCtH,GAAOl9B,EAAM,QAAQ,EAAGwkC,CAAE,GAI5B,IAAItpC,EAAI,CAAA,EAEJypB,EAAI,CAAA,EAGRggB,EAAK,CAAC,EAAI,EAEV,QAASuK,GAAK,EAAGA,GAAKC,EAAOD,KAAM,CAEjC,IAAIE,GAAMzG,EAAMuG,EAAE,EAElB,GAAI,CAACjS,EAAGmS,GAAKlS,EAAI,EAEf,QAASmS,GAAMtb,EAAKmb,EAAE,EAAGI,GAAMvb,EAAKmb,GAAK,CAAC,EAAGK,GAAKF,GAAKE,GAAKD,GAAKC,KAAM,CAErE,IAAIC,GAAK1b,EAAOyb,EAAE,EAEb5qB,EAAE6qB,EAAE,EASPt0C,EAAEs0C,EAAE,EAAItB,EAAGhzC,EAAEs0C,EAAE,EAAGrB,EAAGiB,GAAKvb,EAAQ0b,EAAE,CAAC,CAAC,GAPtC5qB,EAAE6qB,EAAE,EAAI,GAER9b,EAAO,KAAK8b,EAAE,EAEdt0C,EAAEs0C,EAAE,EAAIrB,EAAGiB,GAAKvb,EAAQ0b,EAAE,CAAC,EAK9B,CAEJ,CAED,QAASrkB,GAAKwI,EAAO,OAAQhxB,GAAI,EAAGA,GAAIwoB,GAAIxoB,KAAK,CAE/C,IAAI+sC,GAAK/b,EAAOhxB,EAAC,EAEjBgiC,EAAQhiC,EAAC,EAAIxH,EAAEu0C,EAAE,CAClB,CAED,OAAA9K,EAAK,CAAC,EAAIjR,EAAO,OAGV92B,EAAE,mBAAmB,CAC1B,OAAQ8nC,EACR,MAAOhR,EACP,IAAKiR,EACL,KAAM,CAACiK,EAAO,CAAC,EACf,SAAUpK,CAChB,CAAK,CACF,CAUD,SAASkK,EAAiC9xC,EAAGC,EAAG,CAE9C,IAAIg3B,EAAUj3B,EAAE,QACZk3B,EAASl3B,EAAE,OACXm3B,EAAOn3B,EAAE,KACT2nC,EAAM3nC,EAAE,UAEZ,GAAI,CAACi3B,EACH,MAAM,IAAI,MAAM,wDAAwD,EAG1E,IAAI8U,EAAQ9rC,EAAE,MACVmrC,EAAMnrC,EAAE,UAER+xC,EAAQhyC,EAAE,MAAM,CAAC,EACjBuyC,EAAQtyC,EAAE,MAAM,CAAC,EACjBoxC,EAAWpxC,EAAE,MAAM,CAAC,EAGpB2nC,EAEA0J,EAAKlL,EAELmL,EAAKb,EAELrQ,EAAKV,EAELW,EAAO,EAGPqH,GAAOyD,GAAOzD,IAAQyD,GAAO,OAAOzD,GAAQ,WAE9CC,EAAKD,EAEL2J,EAAKluC,EAAM,KAAKgjC,EAAW,CAACwB,EAAIA,CAAE,CAAC,EACnC2J,EAAKnuC,EAAM,KAAKstC,EAAgB,CAAC9I,EAAIA,CAAE,CAAC,EACxCvH,EAAKj9B,EAAM,KAAKu8B,EAAa,CAACiI,EAAIA,CAAE,CAAC,EAErCtH,EAAOl9B,EAAM,QAAQ,EAAGwkC,CAAE,GAsB5B,QAlBIE,EAAU,CAAA,EACVhR,GAAS,CAAA,EACTiR,EAAO,CAAA,EAEPv9B,EAAIxK,EAAE,mBAAmB,CAC3B,OAAQ8nC,EACR,MAAOhR,GACP,IAAKiR,EACL,KAAM,CAACiK,EAAOX,CAAQ,EACtB,SAAUzJ,CAChB,CAAK,EAGGtpC,GAAI,CAAA,EAEJypB,GAAI,CAAA,EAGCmqB,GAAK,EAAGA,GAAKb,EAAUa,KAAM,CAEpCnK,EAAKmK,EAAE,EAAIpb,GAAO,OAIlB,QAFID,GAAOqb,GAAK,EAEPI,GAAK,EAAGA,GAAKC,EAAOD,KAAM,CAEjC,IAAIQ,GAAO/G,EAAMuG,EAAE,EAAEJ,EAAE,EAEvB,GAAI,CAAC7R,EAAGyS,GAAMxS,CAAI,EAEhB,QAASmS,GAAMtb,EAAKmb,EAAE,EAAGI,GAAMvb,EAAKmb,GAAK,CAAC,EAAGK,GAAKF,GAAKE,GAAKD,GAAKC,KAAM,CAErE,IAAIC,GAAK1b,EAAOyb,EAAE,EAEd5qB,GAAE6qB,EAAE,IAAM/b,IAEZ9O,GAAE6qB,EAAE,EAAI/b,GAERC,GAAO,KAAK8b,EAAE,EAEdt0C,GAAEs0C,EAAE,EAAIrB,EAAGuB,GAAM7b,EAAQ0b,EAAE,CAAC,GAG5Br0C,GAAEs0C,EAAE,EAAItB,EAAGhzC,GAAEs0C,EAAE,EAAGrB,EAAGuB,GAAM7b,EAAQ0b,EAAE,CAAC,CAAC,CAE1C,CAEJ,CAED,QAASI,EAAKhL,EAAKmK,EAAE,EAAG5jB,GAAKwI,GAAO,OAAQhxB,GAAIitC,EAAIjtC,GAAIwoB,GAAIxoB,KAAK,CAE/D,IAAI+sC,GAAK/b,GAAOhxB,EAAC,EAEjBgiC,EAAQhiC,EAAC,EAAIxH,GAAEu0C,EAAE,CAClB,CACF,CAED,OAAA9K,EAAKsJ,CAAQ,EAAIva,GAAO,OAGjBtsB,CACR,CAUD,SAASunC,EAAkC/xC,EAAGC,EAAG,CAE/C,IAAIg3B,EAAUj3B,EAAE,QACZk3B,EAASl3B,EAAE,OACXm3B,EAAOn3B,EAAE,KACT2nC,EAAM3nC,EAAE,UAERgrC,EAAU/qC,EAAE,QACZgrC,EAAShrC,EAAE,OACXirC,EAAOjrC,EAAE,KACTmrC,EAAMnrC,EAAE,UAGR+xC,EAAQhyC,EAAE,MAAM,CAAC,EACjBqxC,EAAWpxC,EAAE,MAAM,CAAC,EAEpBP,EAASu3B,GAAW+T,EAGpBpD,EAEA0J,EAAKlL,EAELmL,EAAKb,EAGL/I,GAAOyD,GAAOzD,IAAQyD,GAAO,OAAOzD,GAAQ,WAE9CC,EAAKD,EAEL2J,EAAKluC,EAAM,KAAKgjC,EAAW,CAACwB,EAAIA,CAAE,CAAC,EACnC2J,EAAKnuC,EAAM,KAAKstC,EAAgB,CAAC9I,EAAIA,CAAE,CAAC,GAuB1C,QAnBIE,EAAUpoC,EAAS,CAAE,EAAG,OACxBo3B,GAAS,CAAA,EACTiR,EAAO,CAAA,EAEPv9B,EAAIxK,EAAE,mBAAmB,CAC3B,OAAQ8nC,EACR,MAAOhR,GACP,IAAKiR,EACL,KAAM,CAACiK,EAAOX,CAAQ,EACtB,SAAUzJ,CAChB,CAAK,EAGGtpC,GAAIoB,EAAS,CAAE,EAAG,OAElBqoB,GAAI,CAAA,EAEJ4qB,GAAIF,GAAKC,GAAKL,GAAIF,GAAKC,GAAKQ,GAAIN,GAE3BJ,EAAK,EAAGA,EAAKb,EAAUa,IAAM,CAEpCnK,EAAKmK,CAAE,EAAIpb,GAAO,OAElB,IAAID,GAAOqb,EAAK,EAEhB,IAAKC,GAAMjH,EAAKgH,CAAE,EAAGE,GAAMlH,EAAKgH,EAAK,CAAC,EAAGG,GAAKF,GAAKE,GAAKD,GAAKC,KAI3D,GAFAC,GAAKrH,EAAOoH,EAAE,EAEV3yC,EAEF,IAAK+yC,GAAMtb,EAAKmb,EAAE,EAAGI,GAAMvb,EAAKmb,GAAK,CAAC,EAAGK,GAAKF,GAAKE,GAAKD,GAAKC,KAE3DC,GAAK1b,EAAOyb,EAAE,EAEV5qB,GAAE6qB,EAAE,IAAM/b,IAEZ9O,GAAE6qB,EAAE,EAAI/b,GAERC,GAAO,KAAK8b,EAAE,EAEdt0C,GAAEs0C,EAAE,EAAIrB,EAAGvG,EAAQqH,EAAE,EAAGpb,EAAQ0b,EAAE,CAAC,GAGnCr0C,GAAEs0C,EAAE,EAAItB,EAAGhzC,GAAEs0C,EAAE,EAAGrB,EAAGvG,EAAQqH,EAAE,EAAGpb,EAAQ0b,EAAE,CAAC,CAAC,MAKlD,KAAKF,GAAMtb,EAAKmb,EAAE,EAAGI,GAAMvb,EAAKmb,GAAK,CAAC,EAAGK,GAAKF,GAAKE,GAAKD,GAAKC,KAE3DC,GAAK1b,EAAOyb,EAAE,EAEV5qB,GAAE6qB,EAAE,IAAM/b,KAEZ9O,GAAE6qB,EAAE,EAAI/b,GAERC,GAAO,KAAK8b,EAAE,GAMtB,GAAIlzC,EAEF,QAASqzC,GAAKhL,EAAKmK,CAAE,EAAG5jB,GAAKwI,GAAO,OAAQhxB,GAAIitC,GAAIjtC,GAAIwoB,GAAIxoB,KAAK,CAE/D,IAAI+sC,GAAK/b,GAAOhxB,EAAC,EAEjBgiC,EAAQhiC,EAAC,EAAIxH,GAAEu0C,EAAE,CAClB,CAEJ,CAED,OAAA9K,EAAKsJ,CAAQ,EAAIva,GAAO,OAGjBtsB,CACR,CAmCD,OAAOpH,EAAMlB,GAAMwuC,EAAgB,CAGjC,eAAgBttC,EAAM,QAAQ,iBAAkB,SAAU4vC,EAAQ,CAChE,OAAO,SAAU10C,EAAGqX,EAAG,CAErBm7B,KAA8B50B,GAAO,WAAW5d,CAAC,KAAO4d,GAAO,WAAWvG,CAAC,CAAC,EAG5E,IAAI8O,EAAIuuB,EAAOvxB,EAAOnjB,CAAC,EAAGmjB,EAAO9L,CAAC,CAAC,EAEnC,SAAWhW,GAAI,UAAU8kB,CAAC,EAAIA,EAAE,QAAS,EAAGA,CACpD,CACA,CAAK,EACD,iBAAkB,SAAsBnmB,EAAGqX,EAAG,CAE5C,IAAIs9B,EAAQ30C,EAAE,OACV40C,EAAQv9B,EAAE,OAMd,OAHAm7B,EAA0BmC,EAAOC,CAAK,EAGlCD,EAAM,SAAW,EAEfC,EAAM,SAAW,EAEZjC,EAAsB3yC,EAAGqX,EAAGs9B,EAAM,CAAC,CAAC,EAGtC/B,EAAsB5yC,EAAGqX,CAAC,EAG/Bu9B,EAAM,SAAW,EAEZ1B,EAAsBlzC,EAAGqX,CAAC,EAG5Bg8B,EAAsBrzC,EAAGqX,CAAC,CAClC,EACD,gBAAiBvS,EAAM,QAAQ,gBAAiB,SAAU4vC,EAAQ,CAChE,OAAO,SAAU10C,EAAGqX,EAAG,CACrB,OAAOq9B,EAAO10C,EAAGmjB,EAAO9L,CAAC,CAAC,CAClC,CACA,CAAK,EACD,gBAAiBvS,EAAM,YAAY,SAAUkK,EAAM,CACjD,OAAO,SAAUhP,EAAGqX,EAAG,CAErB,OAAOrI,EAAKmU,EAAOnjB,EAAGqX,EAAE,QAAS,CAAA,EAAGA,CAAC,CAC7C,CACA,CAAK,EACD,oBAAqB,SAAyBrX,EAAGqX,EAAG,CAClD,OAAO6xB,EAAclpC,EAAGqX,EAAG+6B,EAAgB,EAAK,CACjD,EACD,mBAAoB,SAAwBpyC,EAAGqX,EAAG,CAChD,OAAOwyB,EAAa7pC,EAAGqX,EAAG+6B,EAAgB,EAAK,CAChD,EACD,oBAAqB,SAAyBpyC,EAAGqX,EAAG,CAClD,OAAO6xB,EAAc7xB,EAAGrX,EAAGoyC,EAAgB,EAAI,CAChD,EACD,mBAAoB,SAAwBpyC,EAAGqX,EAAG,CAChD,OAAOwyB,EAAaxyB,EAAGrX,EAAGoyC,EAAgB,EAAI,CAC/C,EACD,aAAc,SAAkBpyC,EAAGqX,EAAG,CAEpC,OAAOwyB,EAAa1mB,EAAOnjB,CAAC,EAAGqX,EAAG+6B,EAAgB,EAAK,EAAE,SAC1D,EACD,aAAc,SAAkBpyC,EAAGqX,EAAG,CAEpC,OAAOwyB,EAAa1mB,EAAO9L,CAAC,EAAGrX,EAAGoyC,EAAgB,EAAI,EAAE,SACzD,EACD,WAAYA,EACZ,mBAAoBttC,EAAM,YAAY,SAAUkK,EAAM,CACpD,OAAO,SAAUhP,EAAGqX,EAAGw9B,EAAM,CAE3B,QADIx/B,EAASrG,EAAKhP,EAAGqX,CAAC,EACbxa,EAAI,EAAGA,EAAIg4C,EAAK,OAAQh4C,IAC/BwY,EAASrG,EAAKqG,EAAQw/B,EAAKh4C,CAAC,CAAC,EAE/B,OAAOwY,CACf,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACDi9B,GAAA,eAAyBC,aC33BzB,OAAO,eAAeuC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACDA,GAAA,oBAA8BA,GAAA,cAAwB,OACtD,IAAI1yB,GAAWhlB,EACXwyC,GAAkB7vC,GAClB+wC,GAAgBxvC,GAChByvC,GAAiBhtC,GACjBumC,GAAiBxxB,GACjBi3B,GAAwBztB,GACxB6d,GAASlL,GACTrxB,GAAO,UACPia,GAAe,CAAC,QAAS,SAAU,cAAe,YAAa,QAAQ,EACvEk3B,MAAmC3yB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC3F,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACd4e,EAAc5e,EAAK,YACnBuyB,EAAavyB,EAAK,UAClBsrB,EAAStrB,EAAK,OACZ6pB,KAAqBsD,GAAgB,sBAAsB,CAC7D,MAAO9qC,CACX,CAAG,EACG0rC,KAAoBM,GAAc,qBAAqB,CACzD,MAAOhsC,EACP,YAAau8B,CACjB,CAAG,EACGsP,KAAqBI,GAAe,sBAAsB,CAC5D,MAAOjsC,EACP,YAAau8B,CACjB,CAAG,EACG6H,KAAoBoB,GAAe,qBAAqB,CAC1D,MAAOxlC,EACP,YAAau8B,CACjB,CAAG,EACG0N,KAA2BgB,GAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EA+BD,SAASkH,GAAa,CACpB,MAAM,IAAI,MAAM,yEAAyE,CAC1F,CACD,OAAOnwC,EAAMlB,GAAM,CACjB,OAAQu8B,GAAO,cACf,iBAAkBA,GAAO,cACzB,UAAW,SAAmBngC,EAAG,CAC/B,OAAOk1C,EAAYl1C,EAAG,IAAIg1C,EAAW,CAAC,CAAC,CACxC,EACD,uBAAwBE,EACxB,QAASD,EACT,kBAAmBA,EACnB,MAAOnwC,EAAM,QAAQ,qBAAsB,SAAUqwC,EAAQ,CAC3D,OAAO,SAAUn1C,EAAG,CAClB,OAAOm1C,EAAOhyB,EAAOnjB,CAAC,EAAG,CAAC,EAAE,SACpC,CACA,CAAK,EACD,YAAa8E,EAAM,QAAQ,qBAAsB,SAAUqwC,EAAQ,CACjE,OAAO,SAAUn1C,EAAG,CAClB,OAAOm1C,EAAOn1C,EAAG,CAAC,CAC1B,CACA,CAAK,EACD,aAAc8E,EAAM,QAAQ,sBAAuB,SAAUswC,EAAQ,CACnE,OAAO,SAAUp1C,EAAG,CAClB,OAAOo1C,EAAOp1C,EAAG,CAAC,CAC1B,CACA,CAAK,EACD,6BAA8B8E,EAAM,YAAY,SAAUkK,EAAM,CAC9D,OAAO,SAAUhP,EAAGqX,EAAG,CAErB,GAAIA,EAAE,QAAS,IAAK,EAElB,OAAOs5B,EAAe3wC,EAAGqX,EAAGrI,CAAI,EAGhC,MAAM,IAAI,MAAM,uBAAuB,CAEjD,CACA,CAAK,EACD,4BAA6BlK,EAAM,YAAY,SAAUkK,EAAM,CAC7D,OAAO,SAAUhP,EAAGqX,EAAG,CAErB,GAAIA,EAAE,QAAS,IAAK,EAElB,OAAOi1B,EAAetsC,EAAGqX,EAAGrI,EAAM,EAAK,EAGvC,MAAM,IAAI,MAAM,uBAAuB,CAEjD,CACA,CAAK,EACD,sBAAuBlK,EAAM,QAAQ,2BAA4B,SAAUuwC,EAAQ,CACjF,OAAO,SAAUr1C,EAAGqX,EAAG,CACrB,OAAOg+B,EAAOlyB,EAAOnjB,CAAC,EAAGqX,CAAC,CAClC,CACA,CAAK,EACD,mCAAoCvS,EAAM,YAAY,SAAUkK,EAAM,CACpE,OAAO,SAAUhP,EAAGqX,EAAG,CAErB,GAAIA,EAAE,QAAS,IAAK,EAElB,OAAO6xB,EAAc7xB,EAAGrX,EAAGgP,EAAM,EAAI,EAGrC,MAAM,IAAI,MAAM,uBAAuB,CAEjD,CACA,CAAK,CACF,EAAE+/B,EAAqB,CACtB,OAAQ,qBACR,GAAIyB,EACJ,GAAItH,EACJ,GAAI,EACL,CAAA,CAAC,EASF,SAASgM,EAAYxzC,EAAG4tB,EAAM,CAC5B,IAAIvZ,EAAYi/B,EAAW,UACvBM,EAAMN,EAAW,MAAM,CACzB,UAAWj/B,EAAY,CAC7B,CAAK,EACGisB,EAAO,IAAIgT,EAAW,CAAC,EACvBtuB,EAAM,IAAI4uB,EAAI,CAAC,EACfxa,EAAMxL,EAAK,aAIf,GAHIwL,IACFxL,EAAOA,EAAK,OAEVA,EAAK,SACP,MAAM,IAAI,MAAM,uBAAuB,EAEzC,GAAI5tB,EAAE,cAAgB,CAAC4tB,EAAK,MAAM,IAAI,CAAC,EAAE,OAAO,CAAC,EAC/C,MAAM,IAAI,MAAM,sCAAsC,EAIxD,GAAI5tB,EAAE,SACJ,OAAOo5B,EAAM,IAAIwa,EAAI,GAAQ,EAAI,EAEnC,GAAI,CAAC5zC,EAAE,WACL,OAAOo5B,EAAMkH,EAAOtgC,EAEtB,IAAI1B,EAAI0B,EAAE,IAAK,EAAC,IAAIglB,EAAI,IAAI4I,CAAI,CAAC,EAGjC,OAAAtvB,EAAI0B,EAAE,MAAK,EAAK1B,EAAE,IAAK,EAAGA,EACnB,IAAIg1C,GAAYla,EAAMpU,EAAI,IAAI1mB,CAAC,EAAIA,GAAG,YAAY+V,CAAS,CAAC,CACpE,CACH,CAAC,EACoB++B,GAAA,cAAGC,GACxB,IAAIQ,MAAyCnzB,GAAS,SAASxe,GAAM,CAAC,OAAO,EAAG,SAAU89B,EAAO,CAC/F,IAAI58B,EAAQ48B,EAAM,MAClB,OAAO58B,EAAMlB,GAAM,CACjB,OAAQu8B,GAAO,cACf,iBAAkBA,GAAO,aAC7B,CAAG,CACH,CAAC,EACD2U,GAAA,oBAA8BS,aC/L9B,OAAO,eAAexgC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIqN,GAAWhlB,EACX47B,GAAcj5B,GACdogC,GAAS7+B,GACTsC,GAAO,OACPia,GAAe,CAAC,QAAS,YAAa,WAAY,SAAS,EAC3D23B,MAAgCpzB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACfuyB,EAAavyB,EAAK,UAClBwe,EAAUxe,EAAK,QACfgzB,EAAYhzB,EAAK,SA+BnB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQu8B,GAAO,WACf,QAAS,SAAiBngC,EAAG,CAC3B,OAAOA,EAAE,KAAO,EAAIihC,KAAYd,GAAO,YAAYngC,EAAE,EAAE,CAAC,EAAIA,EAAE,KAAI,CACnE,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAO,IAAIg1C,EAAWh1C,EAAE,IAAI,CAAC,CAAC,CAC/B,EACD,SAAU,SAAkBA,EAAG,CAC7B,OAAO,IAAIy1C,EAAUz1C,EAAE,EAAG,CAAC,CAC5B,EAED,iBAAkB8E,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,EAAM,EAAI,CACrD,CACA,CAAK,EACD,KAAMlK,EAAM,YAAY,SAAUkK,EAAM,CACtC,OAAO,SAAUhP,EAAG,CAClB,GAAI,CAACA,EAAE,WAAU,GAAMA,EAAE,MAAM,CAAC,EAAE,KAAK,SAAW,EAChD,MAAM,IAAI,UAAU,yCAAyC,EAE/D,OAAO8E,EAAM,KAAKkK,EAAMhP,EAAE,WAAW,EAAEA,EAAE,KAAK,CACtD,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACD+U,GAAA,WAAqBygC,aCvErB,OAAO,eAAehnB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIpM,GAAWhlB,EACXwG,GAAO,OACPia,GAAe,CAAC,SAAU,QAAS,SAAS,EAC5C63B,MAAgCtzB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACxF,IAAIzlB,EAASylB,EAAK,OAChB3d,EAAQ2d,EAAK,MACbE,EAAUF,EAAK,QA2BjB,OAAO3d,EAAM,OAAQ,CACnB,OAAQ6wC,EACR,QAAS,SAAiB31C,EAAG,CAC3B,OAAOA,EAAE,MACV,EACD,UAAW,SAAmBA,EAAG,CAC/B,MAAI,CAACA,EAAE,cAAgBhD,EAAO,YACrBgD,EAAE,OAGF21C,EAAY31C,EAAE,SAAQ,CAAE,CAElC,EACD,KAAM,SAAcA,EAAG,CAErB,OAAOA,EAAE,IAAI,EAAG,CACjB,CACL,CAAG,EAQD,SAAS21C,EAAY31C,EAAG,CACtB,OAAI,MAAMA,CAAC,EACF,IACEA,GAAK,GAAKhD,EAAO,YACnB,KAAK,KAAKgD,CAAC,EAEX,IAAI2iB,EAAQ3iB,EAAG,CAAC,EAAE,KAAI,CAEhC,CACH,CAAC,EACDwuB,GAAA,WAAqBknB,aCxErB,OAAO,eAAeE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAIxzB,GAAWhlB,EACX+iC,GAASpgC,GACT6D,GAAO,SACPia,GAAe,CAAC,OAAO,EACvBg4B,MAAkCzzB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC1F,IAAI3d,EAAQ2d,EAAK,MA6BjB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQu8B,GAAO,aACf,QAAS,SAAiBngC,EAAG,CAC3B,OAAOA,EAAE,IAAIA,CAAC,CACf,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAOA,EAAE,MAAMA,CAAC,CACjB,EACD,SAAU,SAAkBA,EAAG,CAC7B,OAAOA,EAAE,IAAIA,CAAC,CACf,EACD,KAAM,SAAcA,EAAG,CACrB,OAAOA,EAAE,IAAI,CAAC,CACf,CACL,CAAG,CACH,CAAC,EACD41C,GAAA,aAAuBC,aCtDvB,OAAO,eAAeprB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAIrI,GAAWhlB,EACXwyC,GAAkB7vC,GAClBkyC,GAAiB3wC,GACjB4wC,GAAkBnuC,GAClB+rC,GAAkBh3B,GAClByxB,GAAiBjoB,GACjBytB,GAAwB9a,GACxBrxB,GAAO,WACPia,GAAe,CAAC,QAAS,SAAU,cAAe,YAAa,aAAc,cAAe,QAAQ,EACpGi4B,MAAoC1zB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACxF,IAAA3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACd4e,EAAc5e,EAAK,YACPA,EAAK,UACJA,EAAK,WACtB,IAAIG,EAAcH,EAAK,YACnBsrB,EAAStrB,EAAK,OAGZ6pB,KAAqBsD,GAAgB,sBAAsB,CAC7D,MAAO9qC,CACX,CAAG,EACG0sC,KAAoBS,GAAe,qBAAqB,CAC1D,MAAOntC,CACX,CAAG,EACG4sC,KAAqBQ,GAAgB,sBAAsB,CAC7D,MAAOptC,EACP,YAAau8B,CACjB,CAAG,EACGgM,KAAqByC,GAAgB,sBAAsB,CAC7D,MAAOhrC,EACP,YAAa8d,CACjB,CAAG,EACG8mB,KAAoBa,GAAe,qBAAqB,CAC1D,MAAOzlC,EACP,YAAa8d,CACjB,CAAG,EACGmsB,KAA2BgB,GAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EAmCD,OAAOjpC,EAAMlB,GAAM,CACjB,iBAAkB,SAAsB5D,EAAGqX,EAAG,CAC5C,OAAOrX,EAAIqX,CACZ,EACD,mBAAoB,SAAwBrX,EAAGqX,EAAG,CAChD,OAAOrX,EAAE,IAAIqX,CAAC,CACf,EACD,uBAAwB,SAA4BrX,EAAGqX,EAAG,CACxD,OAAOrX,EAAE,MAAMqX,CAAC,CACjB,EACD,qBAAsB,SAA0BrX,EAAGqX,EAAG,CACpD,OAAOrX,EAAE,IAAIqX,CAAC,CACf,EACD,aAAcvS,EAAM,YAAY,SAAUkK,EAAM,CAC9C,OAAO,SAAUhP,EAAGqX,EAAG,CACrB,GAAIrX,EAAE,QAAU,KACd,MAAM,IAAI,MAAM,kDAAkD,EAEpE,GAAIqX,EAAE,QAAU,KACd,MAAM,IAAI,MAAM,kDAAkD,EAEpE,GAAI,CAACrX,EAAE,UAAUqX,CAAC,EAChB,MAAM,IAAI,MAAM,oBAAoB,EAEtC,IAAI+Z,EAAMpxB,EAAE,QACZ,OAAAoxB,EAAI,MAAQtsB,EAAM,KAAKkK,EAAM,CAACoiB,EAAI,UAAS,EAAI/Z,EAAE,UAAW,CAAA,CAAC,EAAE+Z,EAAI,MAAO/Z,EAAE,KAAK,EACjF+Z,EAAI,UAAY,GACTA,CACf,CACA,CAAK,CACF,EAAE2d,EAAqB,CACtB,GAAI2C,EACJ,GAAIpF,EACJ,GAAIkF,EACJ,GAAI9H,EACJ,GAAI2D,CACL,CAAA,CAAC,CACJ,CAAC,EACD5iB,GAAA,eAAyBqrB,aCtHzB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI3zB,GAAWhlB,EACX+iC,GAASpgC,GACT6D,GAAO,OACPia,GAAe,CAAC,QAAS,SAAU,SAAU,WAAW,EACxDm4B,MAAgC5zB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdU,EAASV,EAAK,OACdC,EAAYD,EAAK,UAwBnB,OAAO3d,EAAMlB,GAAM,CACjB,iBAAkB,SAAsBlC,EAAGC,EAAG,CAC5C,IAAIyvB,KAAU+O,GAAO,YAAYz+B,EAAGC,CAAC,EACrC,OAAO3E,EAAO,SAAW,QAAUo0B,EAAMjO,EAAOiO,CAAG,CACpD,EACD,uBAAwB6kB,CAE5B,CAAG,EASD,SAASA,EAAev0C,EAAGC,EAAG,CAE5B,IAEAxB,EAGAioB,EAGAtJ,EACIkjB,EAAO,IAAItf,EAAU,CAAC,EACtBgE,EAAM,IAAIhE,EAAU,CAAC,EACrB1iB,EAAIgiC,EACJjH,EAAQrU,EACRrP,EAAIqP,EACJsU,EAAQgH,EACZ,GAAI,CAACtgC,EAAE,MAAK,GAAM,CAACC,EAAE,MAAK,EACxB,MAAM,IAAI,MAAM,qDAAqD,EAEvE,KAAO,CAACA,EAAE,UACRymB,EAAI1mB,EAAE,IAAIC,CAAC,EAAE,MAAK,EAClBmd,EAAIpd,EAAE,IAAIC,CAAC,EACXxB,EAAIH,EACJA,EAAI+6B,EAAM,MAAM3S,EAAE,MAAMpoB,CAAC,CAAC,EAC1B+6B,EAAQ56B,EACRA,EAAIkX,EACJA,EAAI2jB,EAAM,MAAM5S,EAAE,MAAM/Q,CAAC,CAAC,EAC1B2jB,EAAQ76B,EACRuB,EAAIC,EACJA,EAAImd,EAEN,IAAIsS,EACJ,OAAI1vB,EAAE,GAAGsgC,CAAI,EACX5Q,EAAM,CAAC1vB,EAAE,MAAOq5B,EAAM,MAAOC,EAAM,IAAG,CAAE,EAExC5J,EAAM,CAAC1vB,EAAIA,EAAE,OAAM,EAAa,EAARq5B,EAAWC,CAAK,EAEnCh+B,EAAO,SAAW,QAAUo0B,EAAMjO,EAAOiO,CAAG,CACpD,CACH,CAAC,EACD2kB,GAAA,WAAqBC,aC7FjBx5C,GAAyBY,GAC7B,OAAO,eAAe84C,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAI7L,GAAkB7tC,GAAuBuD,GAAA,CAA+C,EACxFqiB,GAAW9gB,EACXsC,GAAO,SACPia,GAAe,CAAC,QAAS,SAAU,YAAa,OAAQ,QAAS,UAAW,MAAO,MAAO,WAAW,EACrGs4B,MAAkC/zB,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACtF,IAAA3d,EAAQ2d,EAAK,MACNA,EAAK,OAClB,IAAIC,EAAYD,EAAK,UACjBszB,EAAOtzB,EAAK,KACZ2zB,EAAQ3zB,EAAK,MACb4zB,EAAU5zB,EAAK,QACf0L,EAAM1L,EAAK,IACX0K,EAAM1K,EAAK,IACXlO,EAAYkO,EAAK,UAwBnB,OAAO3d,EAAMlB,GAAM,CACjB,iBAAkBsyC,EAClB,uBAAwBA,CAC5B,CAAG,EACD,SAASA,EAAOx0C,EAAGC,EAAG,CACpB,GAAI,CAAC4S,EAAU7S,CAAC,GAAK,CAAC6S,EAAU5S,CAAC,EAAG,MAAM,IAAI,MAAM,uDAAuD,EAE3G,GADAD,EAAIysB,EAAIzsB,EAAGC,CAAC,EACRy0C,EAAMz0C,EAAG,CAAC,EAAG,MAAM,IAAI,MAAM,0BAA0B,EAC3D,IAAIyvB,EAAM2kB,EAAKr0C,EAAGC,CAAC,EACnByvB,EAAMA,EAAI,UACV,IAAIklB,EAAOllB,EACTmlB,KAAYlM,GAAgB,SAAYiM,EAAM,CAAC,EAC/C1mB,EAAM2mB,EAAM,CAAC,EACbzb,EAAMyb,EAAM,CAAC,EACf,OAAKH,EAAMxmB,EAAKlN,EAAU,CAAC,CAAC,GAC5BoY,EAAM3M,EAAI2M,EAAKn5B,CAAC,EACZ00C,EAAQvb,EAAKpY,EAAU,CAAC,CAAC,IAAGoY,EAAM3N,EAAI2N,EAAKn5B,CAAC,GACzCm5B,GAH+B,GAIvC,CACH,CAAC,EACDob,GAAA,aAAuBC,mBC9DvB,OAAO,eAAeK,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAIp0B,GAAWhlB,EACX2d,GAAkBhb,GAClB6D,GAAO,iBACPia,GAAe,CAAC,QAAS,aAAa,EACtC44B,MAA0Cr0B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAClG,IAAI3d,EAAQ2d,EAAK,MACf4e,EAAc5e,EAAK,YAmBrB,OAAO,SAAwB,EAAG9gB,EAAGF,EAAU,CAE7C,IAAIk3B,EAAU,EAAE,QACZC,EAAS,EAAE,OACXC,EAAO,EAAE,KACTuQ,EAAQ,EAAE,MACVC,EAAM,EAAE,UAERqD,EAAU/qC,EAAE,QACZgrC,EAAShrC,EAAE,OACXirC,EAAOjrC,EAAE,KACTkrC,EAAQlrC,EAAE,MACVmrC,EAAMnrC,EAAE,UAGZ,GAAIynC,EAAM,SAAWyD,EAAM,OACzB,MAAM,IAAI9xB,GAAgB,eAAequB,EAAM,OAAQyD,EAAM,MAAM,EAIrE,GAAIzD,EAAM,CAAC,IAAMyD,EAAM,CAAC,GAAKzD,EAAM,CAAC,IAAMyD,EAAM,CAAC,EAC/C,MAAM,IAAI,WAAW,iCAAmCzD,EAAQ,0BAA4ByD,EAAQ,GAAG,EAIzG,IAAI5V,EAAOmS,EAAM,CAAC,EACdlS,EAAUkS,EAAM,CAAC,EAGjBE,EAEAvH,EAAKV,EAELW,EAAO,EAEPuH,EAAK9nC,EAGL,OAAO4nC,GAAQ,UAAYA,IAAQyD,IAErCxD,EAAKD,EAELtH,EAAKj9B,EAAM,KAAKu8B,EAAa,CAACiI,EAAIA,CAAE,CAAC,EAErCtH,EAAOl9B,EAAM,QAAQ,EAAGwkC,CAAE,EAE1BC,EAAKzkC,EAAM,KAAKrD,EAAU,CAAC6nC,EAAIA,CAAE,CAAC,GAIpC,IAAIE,EAAU7Q,GAAW+T,EAAU,CAAA,EAAK,OACpClU,EAAS,CAAA,EACTiR,EAAO,CAAA,EAGPzpC,EAAIwpC,EAAU,CAAE,EAAG,OAEnB/f,EAAI,CAAA,EAGJ5sB,EAAG2oB,EAAGF,EAAGwT,EAAIC,EAGjB,IAAKvT,EAAI,EAAGA,EAAI0R,EAAS1R,IAAK,CAE5BikB,EAAKjkB,CAAC,EAAIgT,EAAO,OAEjB,IAAID,EAAO/S,EAAI,EAEf,GAAIxlB,EAEF,IAAK84B,EAAK8T,EAAKpnB,CAAC,EAAGuT,EAAK6T,EAAKpnB,EAAI,CAAC,EAAGF,EAAIwT,EAAIxT,EAAIyT,EAAIzT,IAEnDzoB,EAAI8vC,EAAOrnB,CAAC,EAEZmE,EAAE5sB,CAAC,EAAI07B,EACPv4B,EAAEnD,CAAC,EAAI6vC,EAAQpnB,CAAC,EAIpB,IAAKwT,EAAKD,EAAKrT,CAAC,EAAGuT,EAAKF,EAAKrT,EAAI,CAAC,EAAGF,EAAIwT,EAAIxT,EAAIyT,EAAIzT,IAInD,GAFAzoB,EAAI+7B,EAAOtT,CAAC,EAERtlB,EAAG,CAEL,IAAI+xC,EAAKtoB,EAAE5sB,CAAC,IAAM07B,EAAOv4B,EAAEnD,CAAC,EAAImlC,EAE5BgQ,EAAKzI,EAAG5Q,EAAQrT,CAAC,EAAGysB,CAAE,EAErBhQ,EAAGiQ,EAAIhQ,CAAI,IAEdxJ,EAAO,KAAK37B,CAAC,EAEb2sC,EAAQ,KAAKwI,CAAE,EAE3B,MAEUxZ,EAAO,KAAK37B,CAAC,CAGlB,CAED,OAAA4sC,EAAKvS,CAAO,EAAIsB,EAAO,OAGhB,EAAE,mBAAmB,CAC1B,OAAQgR,EACR,MAAOhR,EACP,IAAKiR,EACL,KAAM,CAACxS,EAAMC,CAAO,EACpB,SAAUoS,CAChB,CAAK,CACL,CACA,CAAC,EACDkN,GAAA,qBAA+BC,GChJ/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIt0B,GAAWhlB,EACX0zC,GAAgB/wC,GAChB42C,GAAkBr1C,GAClBgpC,GAAiBvmC,GACjBgsC,GAAwBj3B,GACxBlV,GAAO,cACPia,GAAe,CAAC,QAAS,SAAU,cAAe,iBAAkB,QAAQ,EAC5E+4B,MAAuCx0B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC/F,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACd4e,EAAc5e,EAAK,YACnB2vB,EAAiB3vB,EAAK,eACtBsrB,EAAStrB,EAAK,OACZ+tB,KAAoBM,GAAc,qBAAqB,CACzD,MAAOhsC,EACP,YAAau8B,CACjB,CAAG,EACGmV,KAAqBG,GAAgB,sBAAsB,CAC7D,MAAO7xC,EACP,YAAau8B,CACjB,CAAG,EACG6H,KAAoBoB,GAAe,qBAAqB,CAC1D,MAAOxlC,EACP,YAAau8B,CACjB,CAAG,EACG0N,KAA2BgB,GAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EA4BD,OAAOjpC,EAAMlB,GAAMmrC,EAAqB,CACtC,KAAMqD,EACN,GAAIoE,EACJ,GAAIhG,EACJ,GAAItH,CACL,CAAA,CAAC,CACJ,CAAC,EACDwN,GAAA,kBAA4BE,mBCpE5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAGC,GACHD,GAAA,gBAAGE,GACJF,GAAA,eAAGG,GACXH,GAAA,OAAGI,GACFJ,GAAA,QAAG5b,GACQ4b,GAAA,mBAAGK,GACGL,GAAA,yBAAGM,GAsBnC,SAASL,GAAgB92C,EAAGqX,EAAG,CAC7B,GAAIrX,EAAE,YAAc,CAACA,EAAE,UAAS,GAAMqX,EAAE,SAAU,GAAI,CAACA,EAAE,UAAS,EAChE,MAAM,IAAI,MAAM,sCAAsC,EAExD,IAAIqL,EAAY1iB,EAAE,YAClB,GAAIA,EAAE,MAAK,GAAMqX,EAAE,MAAK,EACtB,OAAO,IAAIqL,EAAU,GAAG,EAE1B,GAAI1iB,EAAE,UAAYqX,EAAE,GAAG,EAAE,GAAKrX,EAAE,GAAGqX,CAAC,EAClC,OAAOrX,EAET,GAAIqX,EAAE,OAAQ,GAAIrX,EAAE,GAAG,EAAE,EACvB,OAAOqX,EAET,GAAI,CAACrX,EAAE,SAAQ,GAAM,CAACqX,EAAE,SAAQ,EAAI,CAClC,GAAI,CAACrX,EAAE,SAAQ,GAAM,CAACqX,EAAE,SAAQ,EAC9B,OAAIrX,EAAE,WAAU,IAAOqX,EAAE,WAAU,EAC1BrX,EAEF,IAAI0iB,EAAU,CAAC,EAExB,GAAI,CAAC1iB,EAAE,WACL,OAAIqX,EAAE,aACGrX,EAELA,EAAE,aACG,IAAI0iB,EAAU,CAAC,EAEjBrL,EAET,GAAI,CAACA,EAAE,WACL,OAAIrX,EAAE,aACGqX,EAELA,EAAE,aACG,IAAIqL,EAAU,CAAC,EAEjB1iB,CAEV,CACD,OAAOi7B,GAAQj7B,EAAGqX,EAAG,SAAU3V,EAAGC,EAAG,CACnC,OAAOD,EAAIC,CACf,CAAG,CACH,CAQA,SAASo1C,GAAgB/2C,EAAG,CAC1B,GAAIA,EAAE,SAAQ,GAAM,CAACA,EAAE,UAAS,EAC9B,MAAM,IAAI,MAAM,qCAAqC,EAEvD,IAAI0iB,EAAY1iB,EAAE,YACdo3C,EAAW10B,EAAU,UACzBA,EAAU,OAAO,CACf,UAAW,GACf,CAAG,EACD,IAAIrN,EAASrV,EAAE,KAAK,IAAI0iB,EAAU,CAAC,CAAC,EACpC,OAAArN,EAAO,EAAI,CAACA,EAAO,GAAK,KACxBqN,EAAU,OAAO,CACf,UAAW00B,CACf,CAAG,EACM/hC,CACT,CAsBA,SAAS2hC,GAAeh3C,EAAGqX,EAAG,CAC5B,GAAIrX,EAAE,YAAc,CAACA,EAAE,UAAS,GAAMqX,EAAE,SAAU,GAAI,CAACA,EAAE,UAAS,EAChE,MAAM,IAAI,MAAM,qCAAqC,EAEvD,IAAIqL,EAAY1iB,EAAE,YAClB,GAAIA,EAAE,MAAK,GAAMqX,EAAE,MAAK,EACtB,OAAO,IAAIqL,EAAU,GAAG,EAE1B,IAAI20B,EAAS,IAAI30B,EAAU,EAAE,EAC7B,OAAI1iB,EAAE,OAAQ,GAAIqX,EAAE,GAAGggC,CAAM,GAAKr3C,EAAE,GAAGqX,CAAC,EAC/BA,EAELA,EAAE,OAAQ,GAAIrX,EAAE,GAAGq3C,CAAM,EACpBr3C,EAEL,CAACA,EAAE,SAAQ,GAAM,CAACqX,EAAE,SAAQ,EAC1B,CAACrX,EAAE,SAAU,GAAI,CAACA,EAAE,WAAU,GAAMqX,EAAE,WAAU,GAAMrX,EAAE,WAAY,GAAI,CAACqX,EAAE,WAAU,GAAM,CAACA,EAAE,WACzFggC,EAELr3C,EAAE,WAAU,GAAMqX,EAAE,WAAU,EACzBrX,EAAE,WAAaA,EAAIqX,EAErBrX,EAAE,WAAaqX,EAAIrX,EAErBi7B,GAAQj7B,EAAGqX,EAAG,SAAU,EAAG1V,EAAG,CACnC,OAAO,EAAIA,CACf,CAAG,CACH,CASA,SAASs5B,GAAQj7B,EAAGqX,EAAGigC,EAAM,CAC3B,IAAI50B,EAAY1iB,EAAE,YACdu3C,EAAOC,EACPC,EAAQ,EAAEz3C,EAAE,EAAI,GAChB03C,EAAQ,EAAErgC,EAAE,EAAI,GACpB,GAAIogC,EAAO,CACTF,EAAQI,GAA6BZ,GAAgB/2C,CAAC,CAAC,EACvD,QAASnD,EAAI,EAAGA,EAAI06C,EAAM,OAAQ,EAAE16C,EAClC06C,EAAM16C,CAAC,GAAK,CAElB,MACI06C,EAAQI,GAA6B33C,CAAC,EAExC,GAAI03C,EAAO,CACTF,EAAQG,GAA6BZ,GAAgB1/B,CAAC,CAAC,EACvD,QAASuK,EAAK,EAAGA,EAAK41B,EAAM,OAAQ,EAAE51B,EACpC41B,EAAM51B,CAAE,GAAK,CAEnB,MACI41B,EAAQG,GAA6BtgC,CAAC,EAExC,IAAIugC,EAASC,EAASC,EAClBP,EAAM,QAAUC,EAAM,QACxBI,EAAUL,EACVM,EAAUL,EACVM,EAAUL,IAEVG,EAAUJ,EACVK,EAAUN,EACVO,EAAUJ,GAEZ,IAAIK,EAAWH,EAAQ,OACnBI,EAAUH,EAAQ,OAClBI,EAAaX,EAAKG,EAAOC,CAAK,EAAI,EAClCQ,EAAS,IAAIx1B,EAAUu1B,EAAa,CAAC,EACrCE,EAAW,IAAIz1B,EAAU,CAAC,EAC1B01B,EAAM,IAAI11B,EAAU,CAAC,EACrB00B,EAAW10B,EAAU,UAIzB,IAHAA,EAAU,OAAO,CACf,UAAW,GACf,CAAG,EACMq1B,EAAW,GACZT,EAAKM,EAAQ,EAAEG,CAAQ,EAAGF,EAAQ,EAAEG,CAAO,CAAC,IAAMC,IACpDC,EAASA,EAAO,KAAKC,CAAQ,GAE/BA,EAAWA,EAAS,MAAMC,CAAG,EAE/B,KAAOJ,EAAU,GACXV,EAAKQ,EAASD,EAAQ,EAAEG,CAAO,CAAC,IAAMC,IACxCC,EAASA,EAAO,KAAKC,CAAQ,GAE/BA,EAAWA,EAAS,MAAMC,CAAG,EAE/B,OAAA11B,EAAU,OAAO,CACf,UAAW00B,CACf,CAAG,EACGa,IAAe,IACjBC,EAAO,EAAI,CAACA,EAAO,GAEdA,CACT,CAGA,SAASP,GAA6B33C,EAAG,CAIvC,QAFI0B,EAAI1B,EAAE,EACN8e,EAAIpd,EAAE,CAAC,EAAI,GACN7E,EAAI,EAAGA,EAAI6E,EAAE,OAAQ,EAAE7E,EAAG,CAEjC,QADIgL,EAAInG,EAAE7E,CAAC,EAAI,GACN0rB,EAAI,EAAI1gB,EAAE,OAAQ0gB,KACzB1gB,EAAI,IAAMA,EAEZiX,GAAKjX,CACN,CAED,QADI2d,EAAI1G,EAAE,OACHA,EAAE,OAAO0G,CAAC,IAAM,KACrBA,IAEF,IAAIyC,EAAKjoB,EAAE,EACP4C,EAAMkc,EAAE,MAAM,EAAG0G,EAAI,GAAK,CAAC,EAC3B0E,EAAOtnB,EAAI,OACf,GAAIqlB,EAAK,EACP,GAAI,EAAEA,EAAKiC,EAGT,IADAjC,GAAMiC,EACCjC,KACLrlB,GAAO,SAEAqlB,EAAKiC,IACdtnB,EAAMA,EAAI,MAAM,EAAGqlB,CAAE,EAAI,IAAMrlB,EAAI,MAAMqlB,CAAE,GAM/C,QADIzV,EAAM,CAAC,CAAC,EACHwP,EAAM,EAAGA,EAAMpf,EAAI,QAAS,CAEnC,QADIqnB,EAAOzX,EAAI,OACRyX,KACLzX,EAAIyX,CAAI,GAAK,GAEfzX,EAAI,CAAC,GAAK,SAAS5P,EAAI,OAAOof,GAAK,CAAC,EACpC,QAAS2hB,EAAK,EAAGA,EAAKnxB,EAAI,OAAQ,EAAEmxB,EAC9BnxB,EAAImxB,CAAE,EAAI,KACRnxB,EAAImxB,EAAK,CAAC,IAAM,MAAQnxB,EAAImxB,EAAK,CAAC,IAAM,UAC1CnxB,EAAImxB,EAAK,CAAC,EAAI,GAEhBnxB,EAAImxB,EAAK,CAAC,GAAKnxB,EAAImxB,CAAE,GAAK,EAC1BnxB,EAAImxB,CAAE,GAAK,EAGhB,CACD,OAAOnxB,EAAI,SACb,CAqBA,SAASykC,GAAOj3C,EAAGqX,EAAG,CACpB,GAAIrX,EAAE,YAAc,CAACA,EAAE,UAAS,GAAMqX,EAAE,SAAU,GAAI,CAACA,EAAE,UAAS,EAChE,MAAM,IAAI,MAAM,sCAAsC,EAExD,IAAIqL,EAAY1iB,EAAE,YAClB,GAAIA,EAAE,MAAK,GAAMqX,EAAE,MAAK,EACtB,OAAO,IAAIqL,EAAU,GAAG,EAE1B,GAAI1iB,EAAE,SACJ,OAAOqX,EAET,GAAIA,EAAE,SACJ,OAAOrX,EAET,GAAIA,EAAE,GAAGqX,CAAC,EACR,OAAO,IAAIqL,EAAU,CAAC,EAExB,IAAI20B,EAAS,IAAI30B,EAAU,EAAE,EAC7B,OAAI1iB,EAAE,GAAGq3C,CAAM,EACNN,GAAgB1/B,CAAC,EAEtBA,EAAE,GAAGggC,CAAM,EACNN,GAAgB/2C,CAAC,EAEtB,CAACA,EAAE,SAAQ,GAAM,CAACqX,EAAE,SAAQ,EAC1B,CAACrX,EAAE,SAAQ,GAAM,CAACqX,EAAE,SAAQ,EACvBggC,EAEF,IAAI30B,EAAU1iB,EAAE,WAAY,IAAKqX,EAAE,aAAe,IAAW,IAAS,EAExE4jB,GAAQj7B,EAAGqX,EAAG,SAAU,EAAG1V,EAAG,CACnC,OAAO,EAAIA,CACf,CAAG,CACH,CAoBA,SAASu1C,GAAmBl3C,EAAGqX,EAAG,CAChC,GAAIrX,EAAE,YAAc,CAACA,EAAE,UAAS,GAAMqX,EAAE,SAAU,GAAI,CAACA,EAAE,UAAS,EAChE,MAAM,IAAI,MAAM,yCAAyC,EAE3D,IAAIqL,EAAY1iB,EAAE,YAClB,OAAIA,EAAE,SAAWqX,EAAE,MAAK,GAAMA,EAAE,WAAY,GAAI,CAACA,EAAE,OAAM,EAChD,IAAIqL,EAAU,GAAG,EAEtB1iB,EAAE,OAAM,GAAMqX,EAAE,OAAM,EACjBrX,EAEL,CAACA,EAAE,SAAQ,GAAM,CAACqX,EAAE,SAAQ,EACvB,IAAIqL,EAAU,GAAG,EAItBrL,EAAE,GAAG,EAAE,EACFrX,EAAE,MAAM,KAAK,IAAI,EAAGqX,EAAE,SAAQ,CAAE,EAAI,EAAE,EAExCrX,EAAE,MAAM,IAAI0iB,EAAU,CAAC,EAAE,IAAIrL,CAAC,CAAC,CACxC,CAqBA,SAAS8/B,GAAyBn3C,EAAGqX,EAAG,CACtC,GAAIrX,EAAE,YAAc,CAACA,EAAE,UAAS,GAAMqX,EAAE,SAAU,GAAI,CAACA,EAAE,UAAS,EAChE,MAAM,IAAI,MAAM,+CAA+C,EAEjE,IAAIqL,EAAY1iB,EAAE,YAClB,OAAIA,EAAE,SAAWqX,EAAE,MAAK,GAAMA,EAAE,WAAY,GAAI,CAACA,EAAE,OAAM,EAChD,IAAIqL,EAAU,GAAG,EAEtB1iB,EAAE,OAAM,GAAMqX,EAAE,OAAM,EACjBrX,EAEJqX,EAAE,WAWHA,EAAE,GAAG,EAAE,EACFrX,EAAE,IAAI,KAAK,IAAI,EAAGqX,EAAE,UAAU,EAAI,EAAE,EAAE,MAAK,EAE7CrX,EAAE,IAAI,IAAI0iB,EAAU,CAAC,EAAE,IAAIrL,CAAC,CAAC,EAAE,QAbhCrX,EAAE,aACG,IAAI0iB,EAAU,EAAE,EAEpB1iB,EAAE,WAGA,IAAI0iB,EAAU,CAAC,EAFb,IAAIA,EAAU,GAAG,CAU9B,CCxZA,OAAO,eAAe21B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAI3Y,GAAWtiC,GACX0zC,GAAgB/wC,GAChBuqC,GAAiBhpC,GACjByvC,GAAiBhtC,GACjBqe,GAAWtJ,EACXi3B,GAAwBztB,GACxB6d,GAASlL,GACTrxB,GAAO,SACPia,GAAe,CAAC,QAAS,SAAU,cAAe,QAAQ,EAC1Dy6B,MAAkCl2B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC1F,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACd4e,EAAc5e,EAAK,YACnBsrB,EAAStrB,EAAK,OACZ+tB,KAAoBM,GAAc,qBAAqB,CACzD,MAAOhsC,EACP,YAAau8B,CACjB,CAAG,EACGsP,KAAqBI,GAAe,sBAAsB,CAC5D,MAAOjsC,EACP,YAAau8B,CACjB,CAAG,EACG6H,KAAoBoB,GAAe,qBAAqB,CAC1D,MAAOxlC,EACP,YAAau8B,CACjB,CAAG,EACG0N,KAA2BgB,GAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EAwBD,OAAOjpC,EAAMlB,GAAM,CACjB,iBAAkBu8B,GAAO,aACzB,uBAAwBT,GAAS,eAClC,EAAEqP,EAAqB,CACtB,GAAI4B,EACJ,GAAIH,EACJ,GAAItH,CACL,CAAA,CAAC,CACJ,CAAC,EACDmP,GAAA,aAAuBC,aCnEvB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAI7Y,GAAWtiC,GACX47B,GAAcj5B,GACdqiB,GAAW9gB,EACX6+B,GAASp8B,GACTH,GAAO,SACPia,GAAe,CAAC,OAAO,EACvB26B,MAAkCp2B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC1F,IAAI3d,EAAQ2d,EAAK,MAuBjB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQu8B,GAAO,aACf,UAAWT,GAAS,gBACpB,iBAAkB56B,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,CAAI,CAC/C,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACDupC,GAAA,aAAuBC,aC5CvB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAI/Y,GAAWtiC,GACXglB,GAAWriB,EACX+vC,GAAkBxuC,GAClBuuC,GAAoB9rC,GACpB6rC,GAAkB92B,GAClBi3B,GAAwBztB,GACxB6d,GAASlL,GACTrxB,GAAO,QACPia,GAAe,CAAC,QAAS,SAAU,cAAe,cAAe,QAAQ,EACzE66B,MAAiCt2B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACd4e,EAAc5e,EAAK,YACnBG,EAAcH,EAAK,YACnBsrB,EAAStrB,EAAK,OACZ6pB,KAAqBsD,GAAgB,sBAAsB,CAC7D,MAAO9qC,CACX,CAAG,EACGioC,KAAuB8C,GAAkB,wBAAwB,CACnE,MAAO/qC,EACP,YAAau8B,CACjB,CAAG,EACGgM,KAAqByC,GAAgB,sBAAsB,CAC7D,MAAOhrC,EACP,YAAa8d,CACjB,CAAG,EACGmsB,KAA2BgB,GAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EAyBD,OAAOjpC,EAAMlB,GAAM,CACjB,iBAAkBu8B,GAAO,YACzB,uBAAwBT,GAAS,cAClC,EAAEqP,EAAqB,CACtB,GAAIhC,EACJ,GAAIT,EACJ,GAAIe,CACL,CAAA,CAAC,CACJ,CAAC,EACDoL,GAAA,YAAsBC,mBCpEtB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAIv2B,GAAWhlB,EACX2d,GAAkBhb,GAClB6D,GAAO,gBACPia,GAAe,CAAC,QAAS,aAAa,EACtC+6B,MAAyCx2B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACjG,IAAI3d,EAAQ2d,EAAK,MACfG,EAAcH,EAAK,YAerB,OAAO,SAAuB/gB,EAAGC,EAAGF,EAAU,CAE5C,IAAI2nC,EAAQ1nC,EAAE,MACV2nC,EAAM3nC,EAAE,UAERmrC,EAAQlrC,EAAE,MACVmrC,EAAMnrC,EAAE,UAGZ,GAAIynC,EAAM,SAAWyD,EAAM,OACzB,MAAM,IAAI9xB,GAAgB,eAAequB,EAAM,OAAQyD,EAAM,MAAM,EAIrE,GAAIzD,EAAM,CAAC,IAAMyD,EAAM,CAAC,GAAKzD,EAAM,CAAC,IAAMyD,EAAM,CAAC,EAC/C,MAAM,IAAI,WAAW,iCAAmCzD,EAAQ,0BAA4ByD,EAAQ,GAAG,EAIzG,IAAI5V,EAAOmS,EAAM,CAAC,EACdlS,EAAUkS,EAAM,CAAC,EAGjBE,EAEAtH,EAAO,EAEPuH,EAAK9nC,EAGL,OAAO4nC,GAAQ,UAAYA,IAAQyD,IAErCxD,EAAKD,EAELrH,EAAOl9B,EAAM,QAAQ,EAAGwkC,CAAE,EAE1BC,EAAKzkC,EAAM,KAAKrD,EAAU,CAAC6nC,EAAIA,CAAE,CAAC,GAIpC,IAAIzsC,EAAG2oB,EAGHokB,EAAQ,CAAA,EAEZ,IAAK/sC,EAAI,EAAGA,EAAIo6B,EAAMp6B,IACpB+sC,EAAM/sC,CAAC,EAAI,GAIb,IAAIowC,EAAK,CAAA,EACLC,EAAK,CAAA,EAELC,EAAK,CAAA,EACLC,EAAK,CAAA,EAGT,IAAK5nB,EAAI,EAAGA,EAAI0R,EAAS1R,IAAK,CAE5B,IAAI+S,EAAO/S,EAAI,EAMf,IAJAqzB,EAASn3C,EAAG8jB,EAAG2nB,EAAIF,EAAI1U,CAAI,EAE3BsgB,EAASl3C,EAAG6jB,EAAG4nB,EAAIF,EAAI3U,CAAI,EAEtB17B,EAAI,EAAGA,EAAIo6B,EAAMp6B,IAAK,CAEzB,IAAIi1C,EAAK3E,EAAGtwC,CAAC,IAAM07B,EAAO0U,EAAGpwC,CAAC,EAAImlC,EAC9B+P,EAAK3E,EAAGvwC,CAAC,IAAM07B,EAAO2U,EAAGrwC,CAAC,EAAImlC,EAElC4H,EAAM/sC,CAAC,EAAE2oB,CAAC,EAAI+jB,EAAGuI,EAAIC,CAAE,CACxB,CACF,CAGD,OAAO,IAAInvB,EAAY,CACrB,KAAMgnB,EACN,KAAM,CAAC3S,EAAMC,CAAO,EACpB,SAAUoS,CAChB,CAAK,CACL,EACE,SAASuP,EAAS1yB,EAAGX,EAAGiE,EAAGzpB,EAAGu4B,EAAM,CAMlC,QAJIn3B,EAAS+kB,EAAE,QACX7c,EAAQ6c,EAAE,OACVsc,EAAMtc,EAAE,KAEHb,EAAImd,EAAIjd,CAAC,EAAGuT,EAAK0J,EAAIjd,EAAI,CAAC,EAAGF,EAAIyT,EAAIzT,IAAK,CAEjD,IAAIzoB,EAAIyM,EAAMgc,CAAC,EAEfmE,EAAE5sB,CAAC,EAAI07B,EACPv4B,EAAEnD,CAAC,EAAIuE,EAAOkkB,CAAC,CAChB,CACF,CACH,CAAC,EACDqzB,GAAA,oBAA8BC,GCzH9B,OAAO,eAAe3B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAIvX,GAAWtiC,GACX60C,GAAiBlyC,GACjB+4C,GAAiBx3C,GACjBipC,GAAiBxmC,GACjBqe,GAAWtJ,EACXi3B,GAAwBztB,GACxB6d,GAASlL,GACTrxB,GAAO,SACPia,GAAe,CAAC,QAAS,SAAU,cAAe,QAAQ,EAC1Dk7B,MAAkC32B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC1F,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdG,EAAcH,EAAK,YACnBsrB,EAAStrB,EAAK,OACZ+uB,KAAoBS,GAAe,qBAAqB,CAC1D,MAAOntC,CACX,CAAG,EACG6zC,KAAoBG,GAAe,qBAAqB,CAC1D,MAAOh0C,EACP,YAAa8d,CACjB,CAAG,EACG8mB,KAAoBa,GAAe,qBAAqB,CAC1D,MAAOzlC,EACP,YAAa8d,CACjB,CAAG,EACGmsB,KAA2BgB,GAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EAwBD,OAAOjpC,EAAMlB,GAAM,CACjB,iBAAkBu8B,GAAO,aACzB,uBAAwBT,GAAS,MAClC,EAAEqP,EAAqB,CACtB,GAAI4J,EACJ,GAAInH,EACJ,GAAI9H,CACL,CAAA,CAAC,CACJ,CAAC,EACDuN,GAAA,aAAuB8B,aClEvB,OAAO,eAAe/rC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIoV,GAAWhlB,EACX47B,GAAcj5B,GACd6D,GAAO,MACPia,GAAe,CAAC,OAAO,EACvBm7B,MAA+B52B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MA4BjB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,SAAgB5D,EAAG,CACzB,OAAO,KAAK,MAAM,EAAGA,CAAC,CACvB,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAOA,EAAE,YAAY,MAAM,EAAGA,CAAC,CAChC,EACD,QAAS,SAAiBA,EAAG,CAC3B,OAAOA,EAAE,KACV,EAGD,iBAAkB8E,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,CAAI,CAC/C,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACDhC,GAAA,UAAoBgsC,aCxDpB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI72B,GAAWhlB,EACX47B,GAAcj5B,GACd6D,GAAO,OACPia,GAAe,CAAC,OAAO,EACvBq7B,MAAgC92B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MA0BjB,OAAO3d,EAAMlB,GAAM,CACjB,gCAAiC,SAAiC5D,EAAG,CACnE,OAAOA,CACR,EACD,QAAS,SAAiBA,EAAG,CAC3B,OAAOA,EAAE,WACV,EACD,iBAAkB8E,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,CAAI,CAC/C,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACDiqC,GAAA,WAAqBC,aCjDrB,OAAO,eAAejqB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAI7M,GAAWhlB,EACX47B,GAAcj5B,GACd6D,GAAO,KACPia,GAAe,CAAC,OAAO,EACvBs7B,MAA8B/2B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACtF,IAAI3d,EAAQ2d,EAAK,MA4BjB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,UAAkB,CACxB,MAAO,EACR,EACD,uBAAwB,SAA2B5D,EAAG,CACpD,OAAOA,EAAE,IAAI,CAAC,CACf,EACD,QAAS,SAAiBA,EAAG,CAC3B,OAAOA,EAAE,EACV,EACD,iBAAkB8E,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,CAAI,CAC/C,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACDigB,GAAA,SAAmBkqB,aCtDnB,OAAO,eAAejqB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAI9M,GAAWhlB,EACX47B,GAAcj5B,GACd6D,GAAO,KACPia,GAAe,CAAC,OAAO,EACvBu7B,MAA8Bh3B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACtF,IAAI3d,EAAQ2d,EAAK,MA4BjB,OAAO3d,EAAMlB,GAAM,CACjB,gCAAiC,SAAiC5D,EAAG,CACnE,OAAOA,CACR,EACD,QAAS,SAAiBA,EAAG,CAC3B,OAAOA,EAAE,EACV,EACD,iBAAkB8E,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,CAAI,CAC/C,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACDkgB,GAAA,SAAmBkqB,aCnDnB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIrgB,GAAc57B,GACdglB,GAAWriB,EACXogC,GAAS7+B,GACTsC,GAAO,MACPia,GAAe,CAAC,OAAO,EACvBy7B,MAA+Bl3B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MA0BjB,OAAO3d,EAAMlB,GAAM,CACjB,mBAAoB,UAAyB,CAC3C,MAAO,EACR,EACD,OAAQu8B,GAAO,UACf,QAAS,SAAiBngC,EAAG,CAC3B,OAAOA,EAAE,KAAO,GAAKA,EAAE,KAAO,CAC/B,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAOA,EAAE,OAAM,GAAMA,EAAE,MAAK,CAC7B,EACD,KAAM8E,EAAM,YAAY,SAAUkK,EAAM,CACtC,OAAO,SAAUhP,EAAG,CAClB,OAAO8E,EAAM,KAAKkK,EAAMhP,EAAE,WAAW,EAAEA,EAAE,KAAK,CACtD,CACA,CAAK,EACD,iBAAkB8E,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,CAAI,CAC/C,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACDqqC,GAAA,UAAoBC,aC3DpB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAItH,GAAiB70C,GACjBmtC,GAAiBxqC,GACjBmyC,GAAkB5wC,GAClB8gB,GAAWre,EACXgsC,GAAwBj3B,GACxBqnB,GAAS7d,GACT1e,GAAO,KACPia,GAAe,CAAC,QAAS,SAAU,cAAe,cAAe,QAAQ,EACzE27B,MAA8Bp3B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACtF,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACd4e,EAAc5e,EAAK,YACnBG,EAAcH,EAAK,YACnBsrB,EAAStrB,EAAK,OACZ+uB,KAAoBS,GAAe,qBAAqB,CAC1D,MAAOntC,CACX,CAAG,EACG4sC,KAAqBQ,GAAgB,sBAAsB,CAC7D,MAAOptC,EACP,YAAau8B,CACjB,CAAG,EACGqI,KAAoBa,GAAe,qBAAqB,CAC1D,MAAOzlC,EACP,YAAa8d,CACjB,CAAG,EACGmsB,KAA2BgB,GAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EA8BD,OAAOjpC,EAAMlB,GAAM,CACjB,iBAAkBu8B,GAAO,SACzB,mBAAoB,SAAwBngC,EAAGqX,EAAG,CAChD,OAAOrX,EAAE,KAAO,GAAKA,EAAE,KAAO,GAAKqX,EAAE,KAAO,GAAKA,EAAE,KAAO,CAC3D,EACD,uBAAwB,SAA4BrX,EAAGqX,EAAG,CACxD,MAAO,CAACrX,EAAE,UAAY,CAACA,EAAE,MAAK,GAAM,CAACqX,EAAE,OAAQ,GAAI,CAACA,EAAE,MAAK,CAC5D,EACD,aAAcvS,EAAM,YAAY,SAAUkK,EAAM,CAC9C,OAAO,SAAUhP,EAAGqX,EAAG,CACrB,OAAOrI,EAAKhP,EAAE,OAAS,EAAGqX,EAAE,OAAS,CAAC,CAC9C,CACA,CAAK,CACF,EAAE03B,EAAqB,CACtB,GAAI2C,EACJ,GAAIF,EACJ,GAAI9H,CACL,CAAA,CAAC,CACJ,CAAC,EACD6P,GAAA,SAAmBC,aClFnB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIxH,GAAiB70C,GACjB07C,GAAiB/4C,GACjBwqC,GAAiBjpC,GACjB8gB,GAAWre,EACXgsC,GAAwBj3B,GACxBqnB,GAAS7d,GACT1e,GAAO,MACPia,GAAe,CAAC,QAAS,SAAU,cAAe,QAAQ,EAC1D67B,MAA+Bt3B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdG,EAAcH,EAAK,YACnBsrB,EAAStrB,EAAK,OACZ+uB,KAAoBS,GAAe,qBAAqB,CAC1D,MAAOntC,CACX,CAAG,EACG6zC,KAAoBG,GAAe,qBAAqB,CAC1D,MAAOh0C,EACP,YAAa8d,CACjB,CAAG,EACG8mB,KAAoBa,GAAe,qBAAqB,CAC1D,MAAOzlC,EACP,YAAa8d,CACjB,CAAG,EACGmsB,KAA2BgB,GAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EA8BD,OAAOjpC,EAAMlB,GAAM,CACjB,iBAAkBu8B,GAAO,UACzB,mBAAoB,SAAwBngC,EAAGqX,EAAG,CAChD,OAAQrX,EAAE,KAAO,GAAKA,EAAE,KAAO,KAAQqX,EAAE,KAAO,GAAKA,EAAE,KAAO,EAC/D,EACD,uBAAwB,SAA4BrX,EAAGqX,EAAG,CACxD,OAAQ,CAACrX,EAAE,OAAM,GAAM,CAACA,EAAE,MAAK,KAAS,CAACqX,EAAE,OAAQ,GAAI,CAACA,EAAE,MAAO,EAClE,EACD,aAAcvS,EAAM,YAAY,SAAUkK,EAAM,CAC9C,OAAO,SAAUhP,EAAGqX,EAAG,CACrB,OAAOrI,EAAKhP,EAAE,OAAS,EAAGqX,EAAE,OAAS,CAAC,CAC9C,CACA,CAAK,CACF,EAAE03B,EAAqB,CACtB,GAAI4J,EACJ,GAAInH,EACJ,GAAI9H,CACL,CAAA,CAAC,CACJ,CAAC,EACD+P,GAAA,UAAoBC,aCjFpB,OAAO,eAAe3L,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAI1sC,GAAMjE,GACN0F,GAAU/C,GACV6d,GAAStc,GACT0Z,GAAcjX,GACdgX,GAAkBjC,GAClBsJ,GAAWE,EACX1e,GAAO,SACPia,GAAe,CAAC,QAAS,SAAU,WAAW,EAC9C87B,MAAkCv3B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC1F,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdlO,EAAYkO,EAAK,UA8BnB,OAAO3d,EAAMlB,GAAM,CAEjB,yCAA0C,SAAoCyF,EAAM,CAClF,IAAIxM,EACAgF,EAAMwH,EAAK,OACX6R,EAAM,GACN0+B,EACAC,EAAW,GACXC,EAAW,CAAA,EAEf,IAAKj9C,EAAI,EAAGA,EAAIgF,EAAKhF,IAAK,CACxB,IAAImQ,EAAM3D,EAAKxM,CAAC,EAMhB,MAHQwE,GAAI,UAAU2L,CAAG,IACvB6sC,EAAW,OAELx4C,GAAI,UAAU2L,CAAG,MAAS3L,GAAI,aAAa2L,CAAG,EAAG,CACvD,GAAInQ,IAAMgF,EAAM,EACd,MAAM,IAAI,MAAM,8CAA8C,EAOhE,GAHA+3C,EAAU1+B,EACVA,EAAMlO,EAAI,UAEN,CAACuH,EAAU2G,CAAG,EAChB,MAAM,IAAI,UAAU,uCAAuC,EAE7D,GAAIA,EAAM,GAAKre,EAAI,GAAKqe,EAAM0+B,EAE5B,MAAM,IAAI5+B,GAAY,WAAWE,EAAK0+B,EAAU,CAAC,CAE7D,KAAe,CAEL,IAAIzzB,KAAQrjB,GAAQ,OAAOkK,CAAG,EAAE,UAC5B0I,KAAWkI,GAAO,WAAWuI,CAAC,EAMlC,GALA2zB,EAASj9C,CAAC,EAAIspB,EACdyzB,EAAU1+B,EACVA,EAAMxF,EAAK,OAAS,EAGhB7Y,EAAI,GAAKqe,IAAQ0+B,EACnB,MAAM,IAAI7+B,GAAgB,eAAe6+B,EAAU,EAAG1+B,EAAM,CAAC,CAEhE,CACF,CACD,GAAI4+B,EAAS,SAAW,EACtB,MAAM,IAAI,YAAY,8BAA8B,EAGtD,QADI1oB,EAAM0oB,EAAS,QACZA,EAAS,QACd1oB,EAAM2oB,GAAQ3oB,EAAK0oB,EAAS,QAAS5+B,EAAK,CAAC,EAE7C,OAAO2+B,EAAW12B,EAAOiO,CAAG,EAAIA,CACjC,EACD,YAAa,SAAgB/nB,EAAM,CACjC,OAAOA,EAAK,KAAK,EAAE,CACpB,CACL,CAAG,CACH,CAAC,EAYmB0kC,GAAA,aAAG4L,GACvB,SAASI,GAAQr4C,EAAGC,EAAGq4C,EAAW9+B,EAAK,CACrC,GAAIA,EAAM8+B,EAAW,CAEnB,GAAIt4C,EAAE,SAAWC,EAAE,OACjB,MAAM,IAAIoZ,GAAgB,eAAerZ,EAAE,OAAQC,EAAE,MAAM,EAG7D,QADIuK,EAAI,CAAA,EACC,EAAI,EAAG,EAAIxK,EAAE,OAAQ,IAC5BwK,EAAE,CAAC,EAAI6tC,GAAQr4C,EAAE,CAAC,EAAGC,EAAE,CAAC,EAAGq4C,EAAW9+B,EAAM,CAAC,EAE/C,OAAOhP,CACX,KAEI,QAAOxK,EAAE,OAAOC,CAAC,CAErB,WCrIA,OAAO,eAAes4C,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAI73B,GAAWhlB,EACXiE,GAAMtB,GACN+C,GAAUxB,GACVsc,GAAS7Z,GACTH,GAAO,SACPia,GAAe,CAAC,QAAS,QAAS,SAAU,OAAO,EACnDq8B,MAAkC93B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC1F,IAAI3d,EAAQ2d,EAAK,MACf03B,EAAQ13B,EAAK,MACbU,EAASV,EAAK,OACdmT,EAAQnT,EAAK,MAsBf,OAAO3d,EAAMlB,GAAM,CACjB,iBAAkBw2C,EAClB,gBAAiB,SAAqB54C,EAAOy4C,EAAQ,CACnD,OAAOG,EAAQj3B,KAAWrgB,GAAQ,OAAOtB,CAAK,CAAC,EAAGy4C,CAAM,EAAE,SAC3D,CACL,CAAG,EAQD,SAASG,EAAQ54C,EAAOy4C,EAAQ,CAE9B,GAAIz4C,EAAM,OAAO,SAAW,EAC1B,MAAM,IAAI,MAAM,0CAA0C,KAExDoc,GAAO,eAAeq8B,EAAQz4C,EAAM,KAAM,EAAC,CAAC,CAAC,EACjD,IAAI64C,EAAWzkB,EAAM,EAAGp0B,EAAM,KAAM,EAAC,CAAC,CAAC,EACnC8H,EAAQ,IAAI6wC,EAAME,EAAUJ,CAAM,EAClC5kC,EAAS7T,EAAM,OAAO8H,CAAK,EAC/B,SAAWjI,GAAI,UAAUgU,CAAM,EAAIA,EAAS8N,EAAO,CAAC,CAAC9N,CAAM,CAAC,CAAC,CAC9D,CACH,CAAC,EACD4kC,GAAA,aAAuBC,aC7DvB,OAAO,eAAe98B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIgF,GAAWhlB,EACXwG,GAAO,QACPia,GAAe,CAAC,QAAS,OAAQ,MAAM,EACvCy8B,MAAiCl4B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MACf/M,EAAO+M,EAAK,KACZoI,EAAOpI,EAAK,KAsBd,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,SAAgB5D,EAAG,CACzB,OAAOA,EAAE,MACV,EACD,iBAAkB,SAAqBA,EAAG,CACxC,OAAO6qB,EAAKnV,EAAK1V,CAAC,CAAC,CACpB,CACL,CAAG,CACH,CAAC,EACDod,GAAA,YAAsBk9B,aCzCtB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAI38B,GAASxgB,GACTglB,GAAWriB,EACX6D,GAAO,QACPia,GAAe,CAAC,QAAS,SAAU,WAAY,UAAU,EACzD28B,MAAiCp4B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdgI,EAAWhI,EAAK,SAChB6vB,EAAW7vB,EAAK,SAkClB,OAAO3d,EAAMlB,GAAM,CACjB,iBAAkB,SAAsB5D,EAAGqX,EAAG,CAC5C,OAAO8L,EAAOs3B,EAAOz6C,EAAE,QAAS,EAAEqX,EAAE,QAAS,CAAA,CAAC,CAC/C,EACD,gBAAiB,SAAqBrX,EAAGqX,EAAG,CAC1C,OAAO8L,EAAOs3B,EAAOz6C,EAAE,QAAS,EAAEqX,CAAC,CAAC,CACrC,EACD,gBAAiB,SAAqBrX,EAAGqX,EAAG,CAC1C,OAAO8L,EAAOs3B,EAAOz6C,EAAGqX,EAAE,QAAS,CAAA,CAAC,CACrC,EACD,eAAgBojC,CACpB,CAAG,EASD,SAASA,EAAOz6C,EAAGqX,EAAG,CACpB,IAAIqjC,EAAmB,KAAK,OAAQ98B,GAAO,WAAW5d,CAAC,EAAE,UAAY4d,GAAO,WAAWvG,CAAC,EAAE,MAAM,EAChGrX,KAAQ4d,GAAO,SAAS5d,CAAC,EACzBqX,KAAQuG,GAAO,SAASvG,CAAC,EACzB,IAAIsjC,KAAY/8B,GAAO,WAAW5d,CAAC,EAC/B46C,KAAYh9B,GAAO,WAAWvG,CAAC,EACnC,GAAIsjC,EAAM,SAAW,GAAKC,EAAM,SAAW,GAAKD,EAAM,CAAC,IAAM,GAAKC,EAAM,CAAC,IAAM,EAC7E,MAAM,IAAI,WAAW,6CAAoDD,EAAM,KAAK,IAAI,EAAI,WAAaC,EAAM,KAAK,IAAI,EAAI,IAAI,EAElI,IAAI5+B,EAAU,CAACyO,EAAS6nB,EAAStyC,EAAE,CAAC,EAAGqX,EAAE,CAAC,CAAC,EAAGi7B,EAAStyC,EAAE,CAAC,EAAGqX,EAAE,CAAC,CAAC,CAAC,EAAGoT,EAAS6nB,EAAStyC,EAAE,CAAC,EAAGqX,EAAE,CAAC,CAAC,EAAGi7B,EAAStyC,EAAE,CAAC,EAAGqX,EAAE,CAAC,CAAC,CAAC,EAAGoT,EAAS6nB,EAAStyC,EAAE,CAAC,EAAGqX,EAAE,CAAC,CAAC,EAAGi7B,EAAStyC,EAAE,CAAC,EAAGqX,EAAE,CAAC,CAAC,CAAC,CAAC,EAC/K,OAAIqjC,EAAmB,EACd,CAAC1+B,CAAO,EAERA,CAEV,CACH,CAAC,EACDu+B,GAAA,YAAsBC,aCnFtB,OAAO,eAAeK,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIx5C,GAAMjE,GACNwgB,GAAS7d,GACTkY,GAAU3W,GACV8gB,GAAWre,EACXH,GAAO,OACPia,GAAe,CAAC,QAAS,SAAU,cAAe,cAAc,EAChEi9B,MAAgC14B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdG,EAAcH,EAAK,YACnBkf,EAAelf,EAAK,aAsCtB,OAAO3d,EAAMlB,GAAM,CAGjB,MAAO,SAAe5D,EAAG,CACvB,OAAO+6C,EAAM/6C,EAAG,KAAO4d,GAAO,WAAW5d,CAAC,EAAG,IAAI,CAClD,EACD,gBAAiB,SAAqBA,EAAGslB,EAAG,CAC1C,OAAOy1B,EAAM/6C,EAAGslB,KAAO1H,GAAO,WAAW5d,CAAC,EAAG,IAAI,CAClD,EACD,mBAAoB,SAAwBA,EAAGslB,EAAG,CAChD,OAAOy1B,EAAM/6C,EAAGslB,EAAE,SAAU,KAAM1H,GAAO,WAAW5d,CAAC,EAAG,IAAI,CAC7D,EACD,gBAAiB,SAAqBA,EAAGsU,EAAQ,CAC/C,OAAOymC,EAAM/6C,EAAG,KAAO4d,GAAO,WAAW5d,CAAC,EAAGsU,CAAM,CACpD,EACD,wBAAyB,SAA2BtU,EAAGslB,EAAGhR,EAAQ,CAChE,OAAOymC,EAAM/6C,EAAGslB,KAAO1H,GAAO,WAAW5d,CAAC,EAAGsU,CAAM,CACpD,EACD,2BAA4B,SAA8BtU,EAAGslB,EAAGhR,EAAQ,CACtE,OAAOymC,EAAM/6C,EAAGslB,EAAE,SAAU,KAAM1H,GAAO,WAAW5d,CAAC,EAAGsU,CAAM,CAC/D,EACD,OAAQ,SAAgBtU,EAAG,CACzB,OAAO+6C,EAAM/6C,EAAG,EAAGA,EAAE,OAAQA,EAAE,QAAO,CAAE,CACzC,EACD,iBAAkB,SAAsBA,EAAGslB,EAAG,CAC5C,OAAOy1B,EAAM/6C,EAAGslB,EAAGtlB,EAAE,OAAQA,EAAE,QAAO,CAAE,CACzC,EACD,oBAAqB,SAAyBA,EAAGslB,EAAG,CAClD,OAAOy1B,EAAM/6C,EAAGslB,EAAE,SAAU,EAAEtlB,EAAE,OAAQA,EAAE,QAAO,CAAE,CACpD,EACD,iBAAkB,SAAsBA,EAAGsU,EAAQ,CACjD,OAAOymC,EAAM/6C,EAAG,EAAGA,EAAE,KAAI,EAAIsU,CAAM,CACpC,EACD,yBAA0B,SAA4BtU,EAAGslB,EAAGhR,EAAQ,CAClE,OAAOymC,EAAM/6C,EAAGslB,EAAGtlB,EAAE,KAAI,EAAIsU,CAAM,CACpC,EACD,4BAA6B,SAA+BtU,EAAGslB,EAAGhR,EAAQ,CACxE,OAAOymC,EAAM/6C,EAAGslB,EAAE,SAAU,EAAEtlB,EAAE,OAAQsU,CAAM,CAC/C,CACL,CAAG,EAWD,SAASymC,EAAM/6C,EAAGslB,EAAG5P,EAAMpB,EAAQ,CACjC,GAAI,IAAK2D,GAAQ,WAAWqN,CAAC,EAC3B,MAAM,IAAI,UAAU,sDAAsD,EAE5E,IAAIyR,EAASzR,EAAI,EAAIA,EAAI,EACrB0R,EAAO1R,EAAI,EAAI,CAACA,EAAI,EAGxB,OAAQ5P,EAAK,OAAM,CACjB,IAAK,GACH,OAAOslC,EAAsBh7C,EAAGslB,EAAGhR,EAAQoB,EAAK,CAAC,EAAGshB,EAAMD,CAAM,EAClE,IAAK,GACH,OAAOkkB,EAAaj7C,EAAGslB,EAAGhR,EAAQoB,EAAMshB,EAAMD,CAAM,CACvD,CACD,MAAM,IAAI,WAAW,gDAAgD,CACtE,CACD,SAASikB,EAAsBh7C,EAAGslB,EAAGhR,EAAQ,EAAG0iB,EAAMD,EAAQ,CAE5D,IAAII,EAAK,CAAC,EAAIH,EAAM,EAAID,CAAM,EAC9B,GAAIziB,GAAUA,IAAW,UAAYA,IAAW,QAC9C,MAAM,IAAI,UAAU,uBAAuB,OAAOA,EAAQ,GAAI,CAAC,EAIjE,IAAI,EAAIA,IAAW,SAAWqtB,EAAa,SAASxK,EAAIn3B,EAAGslB,CAAC,EAAI1C,EAAY,SAASuU,EAAIn3B,EAAGslB,CAAC,EAE7F,OAAOhR,IAAW,KAAO,EAAI,EAAE,QAAO,CACvC,CACD,SAAS2mC,EAAaj7C,EAAGslB,EAAGhR,EAAQzM,EAAGmvB,EAAMD,EAAQ,CAEnD,MAAQ11B,GAAI,UAAUrB,CAAC,EAAG,CAExB,IAAIk7C,EAAKl7C,EAAE,SAASslB,CAAC,EAErB,OAAIhR,IAAW,KAETA,IAAW4mC,EAAG,UACT/3B,EAAO+3B,EAAI5mC,CAAM,EAEnB4mC,EAEFA,EAAG,SACX,CAMD,QAJI1lC,EAAI,KAAK,IAAI3N,EAAE,CAAC,EAAImvB,EAAMnvB,EAAE,CAAC,EAAIkvB,CAAM,EAEvCokB,EAAS,CAAA,EAEJt+C,EAAI,EAAGA,EAAI2Y,EAAG3Y,IACrBs+C,EAAOt+C,CAAC,EAAImD,EAAEnD,EAAIm6B,CAAI,EAAEn6B,EAAIk6B,CAAM,EAGpC,OAAOziB,IAAW,KAAO6O,EAAOg4B,CAAM,EAAIA,CAC3C,CACH,CAAC,EACDN,GAAA,WAAqBC,aC7JrB,OAAO,eAAehhC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAI8D,GAASxgB,GACTk3B,GAAYv0B,GACZqiB,GAAW9gB,EACXsC,GAAO,SACPia,GAAe,CAAC,OAAO,EACvBu9B,MAAkCh5B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC1F,IAAI3d,EAAQ2d,EAAK,MA8BjB,OAAO3d,EAAM,SAAU,CACrB,kBAAmBu2C,GACnB,mBAAoB,SAAwBr7C,EAAGmK,EAAM,CACnD,OAAOnK,EAAE,OAAOq7C,GAAgBr7C,EAAE,QAAS,EAAEmK,CAAI,CAAC,CACnD,EACD,gBAAiByT,GAAO,aACxB,iBAAkB,SAAsB5d,EAAGmK,EAAM,CAC/C,OAAOnK,EAAE,UAAW4d,GAAO,cAAc5d,EAAE,QAAO,EAAImK,CAAI,CAAC,CAC5D,CACL,CAAG,CACH,CAAC,EASmB2P,GAAA,aAAGshC,GACvB,SAASC,GAAgBr7C,EAAGyB,EAAU,CAEpC,IAAI4H,KAAWirB,GAAU,kBAAkB7yB,CAAQ,EACnD,SAAWmc,GAAO,QAAQ5d,EAAG,SAAUwB,EAAO8H,EAAO5F,EAAO,CAE1D,OAAI2F,IAAS,EACJ5H,EAASD,CAAK,EACZ6H,IAAS,EACX5H,EAASD,EAAO,CAAC8H,CAAK,CAAC,EAGvB7H,EAASD,EAAO,CAAC8H,CAAK,EAAG5F,CAAK,CAE3C,CAAG,CACH,WC1EA,OAAO,eAAesW,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAI4D,GAASxgB,GACTglB,GAAWriB,EACX6D,GAAO,UACPia,GAAe,CAAC,QAAS,QAAQ,EACjCy9B,MAAmCl5B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC3F,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OAoBhB,OAAO3d,EAAMlB,GAAM,CACjB,MAAO,SAAe5D,EAAG,CACvB,SAAW4d,GAAO,SAAS5d,CAAC,CAC7B,EACD,OAAQ,SAAgBA,EAAG,CACzB,IAAIid,KAAWW,GAAO,SAAS5d,EAAE,QAAO,CAAE,EAE1C,OAAOmjB,EAAOlG,CAAI,CACnB,CACL,CAAG,CACH,CAAC,EACDjD,GAAA,cAAwBshC,aCzCxB,OAAO,eAAerhC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAIqa,GAAYl3B,GACZwgB,GAAS7d,GACTqiB,GAAW9gB,EACXsC,GAAO,UACPia,GAAe,CAAC,OAAO,EACvB09B,MAAmCn5B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC3F,IAAI3d,EAAQ2d,EAAK,MAwBjB,OAAO3d,EAAMlB,GAAM,CACjB,kBAAmB43C,GACnB,mBAAoB,SAAwBx7C,EAAGyB,EAAU,CACvDzB,EAAE,QAAQyB,CAAQ,CACnB,CACL,CAAG,CACH,CAAC,EAQoBwY,GAAA,cAAGshC,GACxB,SAASC,GAAS93C,EAAOjC,EAAU,CAEjC,IAAI4H,KAAWirB,GAAU,kBAAkB7yB,CAAQ,EAC/C80B,EAAU,SAASA,EAAQ/0B,EAAO8H,EAAO,CACvC,MAAM,QAAQ9H,CAAK,KACjBoc,GAAO,SAASpc,EAAO,SAAUe,EAAO1F,EAAG,CAE7C05B,EAAQh0B,EAAO+G,EAAM,OAAOzM,CAAC,CAAC,CACtC,CAAO,EAGGwM,IAAS,EACX5H,EAASD,CAAK,EACL6H,IAAS,EAClB5H,EAASD,EAAO8H,CAAK,EAGrB7H,EAASD,EAAO8H,EAAO5F,CAAK,CAGpC,EACE6yB,EAAQ7yB,EAAO,CAAA,CAAE,CACnB,WCvEA,OAAO,eAAe+3C,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC8BA,GAAA,wBAAG,OAClC,IAAIr5B,GAAWhlB,EACXwgB,GAAS7d,GACTsB,GAAMC,GACNsC,GAAO,oBACPia,GAAe,CAAC,OAAO,EACvB69B,MAA6Ct5B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACrG,IAAI3d,EAAQ2d,EAAK,MAmCjB,OAAO3d,EAAMlB,GAAM,CACjB,MAAO,SAAe5D,EAAG,CACvB,SAAW4d,GAAO,kBAAkB5d,EAAGqB,GAAI,MAAM,CAClD,EACD,OAAQ,SAAgBrB,EAAG,CACzB,OAAOA,EAAE,aACV,CACL,CAAG,CACH,CAAC,EACDy7C,GAAA,wBAAkCC,aCtDlC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAIt6C,GAAMjE,GACNwgB,GAAS7d,GACTkY,GAAU3W,GACV8gB,GAAWre,EACXH,GAAO,WACPia,GAAe,CAAC,QAAS,SAAU,SAAU,YAAa,cAAe,cAAc,EACvF+9B,MAAoCx5B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC5F,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdU,EAASV,EAAK,OACdC,EAAYD,EAAK,UACjBG,EAAcH,EAAK,YACnBkf,EAAelf,EAAK,aA+BtB,OAAO3d,EAAMlB,GAAM,CACjB,GAAI,UAAa,CACf,OAAO5G,EAAO,SAAW,SAAWmmB,EAAO,CAAA,CAAE,EAAI,EAClD,EACD,OAAQ,SAAgB7O,EAAQ,CAC9B,OAAO6O,EAAO7O,CAAM,CACrB,EACD,qBAAsB,SAAyB2iB,EAAM,CACnD,OAAO4kB,EAAU5kB,EAAMA,EAAMj6B,EAAO,SAAW,SAAW,QAAU,MAAS,CAC9E,EACD,6BAA8B,SAA+Bi6B,EAAM3iB,EAAQ,CACzE,OAAOunC,EAAU5kB,EAAMA,EAAM3iB,CAAM,CACpC,EACD,yCAA0C,SAAwC2iB,EAAM6kB,EAAM,CAC5F,OAAOD,EAAU5kB,EAAM6kB,EAAM9+C,EAAO,SAAW,SAAW,QAAU,MAAS,CAC9E,EACD,iDAAkD,SAA8Ci6B,EAAM6kB,EAAMxnC,EAAQ,CAClH,OAAOunC,EAAU5kB,EAAM6kB,EAAMxnC,CAAM,CACpC,EACD,MAAO,SAAeoB,EAAM,CAC1B,OAAOqmC,EAAgBrmC,CAAI,CAC5B,EACD,gBAAiB,SAAqBA,EAAMpB,EAAQ,CAClD,OAAOynC,EAAgBrmC,EAAMpB,CAAM,CACpC,EACD,OAAQ,SAAgBoB,EAAM,CAC5B,OAAOqmC,EAAgBrmC,EAAK,QAAS,EAAEA,EAAK,QAAO,CAAE,CACtD,EACD,iBAAkB,SAAsBA,EAAMpB,EAAQ,CACpD,OAAOynC,EAAgBrmC,EAAK,QAAS,EAAEpB,CAAM,CAC9C,CACL,CAAG,EACD,SAASynC,EAAgBrmC,EAAMpB,EAAQ,CACrC,OAAQoB,EAAK,OAAM,CACjB,IAAK,GACH,OAAOpB,EAAS6O,EAAO7O,CAAM,EAAI,CAAA,EACnC,IAAK,GACH,OAAOunC,EAAUnmC,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGpB,CAAM,EAC3C,IAAK,GACH,OAAOunC,EAAUnmC,EAAK,CAAC,EAAGA,EAAK,CAAC,EAAGpB,CAAM,EAC3C,QACE,MAAM,IAAI,MAAM,uCAAuC,CAC1D,CACF,CAUD,SAASunC,EAAU5kB,EAAM6kB,EAAMxnC,EAAQ,CAErC,IAAIghC,KAAUj0C,GAAI,aAAa41B,CAAI,MAAS51B,GAAI,aAAay6C,CAAI,EAAIp5B,EAAY,KAGjF,MAFQrhB,GAAI,aAAa41B,CAAI,IAAGA,EAAOA,EAAK,eACpC51B,GAAI,aAAay6C,CAAI,IAAGA,EAAOA,EAAK,YACxC,IAAK7jC,GAAQ,WAAWgf,CAAI,GAAKA,EAAO,EAC1C,MAAM,IAAI,MAAM,2DAA2D,EAE7E,GAAI,IAAKhf,GAAQ,WAAW6jC,CAAI,GAAKA,EAAO,EAC1C,MAAM,IAAI,MAAM,2DAA2D,EAE7E,IAAIp1B,EAAM4uB,EAAM,IAAI5yB,EAAU,CAAC,EAAI,EAC/BrH,EAAei6B,EAAM,IAAIA,EAAI,CAAC,EAAI,EAClC5/B,EAAO,CAACuhB,EAAM6kB,CAAI,EAGtB,GAAIxnC,EAAQ,CAEV,GAAIA,IAAW,SACb,OAAOqtB,EAAa,SAASjsB,EAAMgR,EAAK,EAAGrL,CAAY,EAEzD,GAAI/G,IAAW,QACb,OAAOsO,EAAY,SAASlN,EAAMgR,EAAK,EAAGrL,CAAY,EAExD,MAAM,IAAI,UAAU,wBAAyB,OAAO/G,EAAQ,GAAI,CAAC,CAClE,CAOD,QAJI8c,KAAUxT,GAAO,QAAQ,CAAA,EAAIlI,EAAM2F,CAAY,EAE/C2gC,EAAU/kB,EAAO6kB,EAAO7kB,EAAO6kB,EAE1B9+B,EAAI,EAAGA,EAAIg/B,EAASh/B,IAC3BoU,EAAIpU,CAAC,EAAEA,CAAC,EAAI0J,EAEd,OAAO0K,CACR,CACH,CAAC,EACDuqB,GAAA,eAAyBC,aC1IzB,OAAO,eAAeK,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIr+B,GAASxgB,GACTglB,GAAWriB,EACX6D,GAAO,OACPia,GAAe,CAAC,QAAS,SAAU,gBAAgB,EACnDq+B,MAAgC95B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACd2vB,EAAiB3vB,EAAK,eA4BxB,OAAO3d,EAAMlB,GAAM,CACjB,iBAAkB,SAAsB5D,EAAGqX,EAAG,CAC5C,OAAO8L,EAAOg5B,EAAMn8C,EAAE,QAAS,EAAEqX,EAAE,QAAS,CAAA,CAAC,CAC9C,EACD,gBAAiB,SAAqBrX,EAAGqX,EAAG,CAC1C,OAAO8L,EAAOg5B,EAAMn8C,EAAE,QAAS,EAAEqX,CAAC,CAAC,CACpC,EACD,gBAAiB,SAAqBrX,EAAGqX,EAAG,CAC1C,OAAO8L,EAAOg5B,EAAMn8C,EAAGqX,EAAE,QAAS,CAAA,CAAC,CACpC,EACD,eAAgB8kC,CACpB,CAAG,EASD,SAASA,EAAMz6C,EAAGC,EAAG,CAUnB,MARQic,GAAO,WAAWlc,CAAC,EAAE,SAAW,IAEtCA,EAAI,CAACA,CAAC,MAEAkc,GAAO,WAAWjc,CAAC,EAAE,SAAW,IAEtCA,EAAI,CAACA,CAAC,MAEAic,GAAO,WAAWlc,CAAC,EAAE,OAAS,MAASkc,GAAO,WAAWjc,CAAC,EAAE,OAAS,EAC3E,MAAM,IAAI,WAAW,+EAAsF,KAAK,UAAUD,EAAE,MAAM,EAAI,SAAW,KAAK,UAAUC,EAAE,MAAM,EAAI,GAAG,EAEjL,IAAIxB,EAAI,CAAA,EACJ2e,EAAI,CAAA,EACR,OAAOpd,EAAE,IAAI,SAAUA,EAAG,CACxB,OAAOC,EAAE,IAAI,SAAUA,EAAG,CACxB,OAAAmd,EAAI,CAAA,EACJ3e,EAAE,KAAK2e,CAAC,EACDpd,EAAE,IAAI,SAAU2V,EAAG,CACxB,OAAO1V,EAAE,IAAI,SAAU3B,EAAG,CACxB,OAAO8e,EAAE,KAAKszB,EAAe/6B,EAAGrX,CAAC,CAAC,CAC9C,CAAW,CACX,CAAS,CACT,CAAO,CACF,CAAA,GAAKG,CACP,CACH,CAAC,EACD87C,GAAA,WAAqBC,aCvFrB,OAAO,eAAe5hC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIga,GAAYl3B,GACZglB,GAAWriB,EACX6D,GAAO,MACPia,GAAe,CAAC,OAAO,EACvBsC,MAA+BiC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MA0CjB,OAAO3d,EAAMlB,GAAM,CACjB,kBAAmBye,GACnB,mBAAoB,SAAwBriB,EAAGyB,EAAU,CACvD,OAAOzB,EAAE,IAAIyB,CAAQ,CACtB,CACL,CAAG,CACH,CAAC,EASgB6Y,GAAA,UAAG6F,GACpB,SAASkC,GAAK3e,EAAOjC,EAAU,CAE7B,IAAI4H,KAAWirB,GAAU,kBAAkB7yB,CAAQ,EAC/C80B,EAAU,SAASA,EAAQ/0B,EAAO8H,EAAO,CAC3C,GAAI,MAAM,QAAQ9H,CAAK,EACrB,OAAOA,EAAM,IAAI,SAAUe,EAAO1F,EAAG,CAEnC,OAAO05B,EAAQh0B,EAAO+G,EAAM,OAAOzM,CAAC,CAAC,CAC7C,CAAO,EAED,GAAI,CAEF,OAAIwM,IAAS,EACJ5H,EAASD,CAAK,EACZ6H,IAAS,EACX5H,EAASD,EAAO8H,CAAK,EAGrB7H,EAASD,EAAO8H,EAAO5F,CAAK,CAEtC,OAAQoG,EAAK,CAEZ,GAAIA,aAAe,WAAa,SAAUA,GAAOA,EAAI,KAAK,WAAa,YAAa,CAClF,IAAIsyC,EAAS,0BAA0B,OAAOtyC,EAAI,KAAK,GAAI,GAAG,EAAE,OAAOtI,CAAK,EACxE66C,EAAc,KAAK,UAAU/yC,CAAK,EACtC,MAAID,IAAS,EACX+yC,GAAU,IAAMC,EACPhzC,IAAS,IAClB+yC,GAAU,IAAI,OAAOC,EAAa,GAAG,EAAE,OAAO34C,CAAK,GAErD04C,GAAU,mBAAmB,OAAOtyC,EAAI,KAAK,MAAQ,EAAG,WAAW,EACnEsyC,GAAU,GAAG,OAAOtyC,EAAI,KAAK,OAAQ,gCAAgC,EACrEsyC,GAAUtyC,EAAI,KAAK,SAAS,KAAK,MAAM,EACjC,IAAI,UAAUsyC,CAAM,CAC3B,CACD,MAAMtyC,CACP,CAEP,EACE,OAAOysB,EAAQ7yB,EAAO,CAAA,CAAE,CAC1B,WC3GA,OAAO,eAAe6T,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI6K,GAAWhlB,EACX6a,GAAUlY,GACVsB,GAAMC,GACNsC,GAAO,OACPia,GAAe,CAAC,QAAS,SAAU,WAAY,QAAQ,EACvDy+B,MAAgCl6B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdgI,EAAWhI,EAAK,SAChBtO,EAASsO,EAAK,OA+ChB,OAAO3d,EAAMlB,GAAM,CACjB,iBAAkB,SAAqB4O,EAAK,CAE1C,SAAQnR,GAAI,UAAUmR,CAAG,EAChB2Q,EAAOo5B,EAAM/pC,EAAI,QAAO,CAAE,CAAC,EAE3B+pC,EAAM/pC,CAAG,CAEnB,EACD,yBAA0B,SAA2BA,EAAK0I,EAAK,CAC7D,GAAI,IAAKjD,GAAQ,WAAWiD,CAAG,EAAG,MAAM,IAAI,WAAW,kCAAkC,EACzF,SAAQ7Z,GAAI,UAAUmR,CAAG,EAChB2Q,EAAOq5B,EAAWhqC,EAAI,QAAS,EAAE0I,CAAG,CAAC,EAErCshC,EAAWhqC,EAAK0I,CAAG,CAE7B,EACD,mBAAoBpW,EAAM,QAAQ,eAAgB,SAAU23C,EAAQ,CAClE,OAAO,SAAUjqC,EAAK0I,EAAK,CACzB,OAAOuhC,EAAOjqC,EAAK2B,EAAO+G,CAAG,CAAC,CACtC,CACA,CAAK,EACD,oBAAqBpW,EAAM,QAAQ,gBAAiB,SAAU43C,EAAQ,CACpE,OAAO,SAAUlqC,EAAK0I,EAAK,CACzB,OAAOwhC,EAAOlqC,EAAK2B,EAAO+G,CAAG,CAAC,CACtC,CACA,CAAK,CACL,CAAG,EAUD,SAASshC,EAAWhqC,EAAK0I,EAAK,CAK5B,MAJQ7Z,GAAI,UAAUmR,CAAG,IACvBA,EAAMA,EAAI,WAGR,CAAC,MAAM,QAAQA,CAAG,EACpB,MAAM,WAAW,iDAAiD,EAEpE,GAAI0I,EAAM,EAAG,CACX,IAAI7F,EAAS,CAAA,EACb,OAAA7C,EAAI,QAAQ,SAAU49B,EAAS,CAC7B/6B,EAAO,KAAKmnC,EAAWpM,EAASl1B,EAAM,CAAC,CAAC,CAChD,CAAO,EACM7F,CACb,KAAW,IAAI6F,IAAQ,EACjB,OAAOqhC,EAAM/pC,CAAG,EAEhB,MAAM,WAAW,gCAAgC,EAEpD,CAQD,SAAS+pC,EAAM/pC,EAAK,CAGlB,QAFI6C,EAAS,CAAA,EACTK,EAAOlD,EAAI,OACN3V,EAAI,EAAGA,EAAI6Y,EAAM7Y,IACxBwY,EAAO,KAAKsnC,EAAanqC,EAAI3V,EAAI,CAAC,EAAG2V,EAAI3V,CAAC,CAAC,CAAC,EAE9C,OAAOwY,CACR,CASD,SAASsnC,EAAaC,EAAMC,EAAM,IAExBx7C,GAAI,UAAUu7C,CAAI,IAAGA,EAAOA,EAAK,cACjCv7C,GAAI,UAAUw7C,CAAI,IAAGA,EAAOA,EAAK,WACzC,IAAIC,EAAc,MAAM,QAAQF,CAAI,EAChCG,EAAc,MAAM,QAAQF,CAAI,EACpC,GAAIC,GAAeC,EACjB,OAAOC,EAAWJ,EAAMC,CAAI,EAE9B,GAAI,CAACC,GAAe,CAACC,EACnB,OAAOtyB,EAASoyB,EAAMD,CAAI,EAG5B,MAAM,UAAU,6DAA6D,CAC9E,CASD,SAASI,EAAWC,EAAM77B,EAAM,CAC9B,GAAI67B,EAAK,SAAW77B,EAAK,OACvB,MAAM,WAAW,yCAAyC,EAI5D,QAFI/L,EAAS,CAAA,EACTK,EAAOunC,EAAK,OACPpgD,EAAI,EAAGA,EAAI6Y,EAAM7Y,IACxBwY,EAAO,KAAKsnC,EAAaM,EAAKpgD,CAAC,EAAGukB,EAAKvkB,CAAC,CAAC,CAAC,EAE5C,OAAOwY,CACR,CACH,CAAC,EACDkC,GAAA,WAAqB+kC,aC/KrB,OAAO,eAAeY,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI77C,GAAMjE,GACN6a,GAAUlY,GACV6d,GAAStc,GACT8gB,GAAWre,EACXH,GAAO,OACPia,GAAe,CAAC,QAAS,SAAU,SAAU,WAAW,EACxDs/B,MAAgC/6B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdU,EAASV,EAAK,OACdC,EAAYD,EAAK,UAmCnB,OAAO3d,EAAM,OAAQ,CACnB,GAAI,UAAa,CACf,OAAO9H,EAAO,SAAW,QAAUogD,EAAM,CAAE,CAAA,EAAIA,EAAM,GAAI,SAAS,CACnE,EAGD,iCAAkC,SAA+B1nC,EAAM,CACrE,IAAI/M,EAAO+M,EAAKA,EAAK,OAAS,CAAC,EAC/B,GAAI,OAAO/M,GAAS,SAAU,CAC5B,IAAI2L,EAASoB,EAAK,MAClB,OAAO0nC,EAAM1nC,EAAMpB,CAAM,CACjC,KAAa,QAAItX,EAAO,SAAW,QACpBogD,EAAM1nC,CAAI,EAEV0nC,EAAM1nC,EAAM,SAAS,CAE/B,EACD,MAAO0nC,EACP,OAAQ,SAAgB1nC,EAAM,CAC5B,IAAIpB,EAASoB,EAAK,UAClB,OAAO0nC,EAAM1nC,EAAK,QAAS,EAAEpB,CAAM,CACpC,EACD,yBAA0B,SAA2BoB,EAAMpB,EAAQ,CACjE,OAAO8oC,EAAM1nC,EAAK,QAAS,EAAEpB,CAAM,CACpC,CACL,CAAG,EASD,SAAS8oC,EAAM1nC,EAAMpB,EAAQ,CAC3B,IAAI+oC,EAAgBC,EAAW5nC,CAAI,EAC/B2F,EAAegiC,EAAgB,IAAI36B,EAAU,CAAC,EAAI,EAEtD,GADAzH,EAAUvF,CAAI,EACVpB,EAAQ,CAEV,IAAI6R,EAAIhD,EAAO7O,CAAM,EACrB,OAAIoB,EAAK,OAAS,EACTyQ,EAAE,OAAOzQ,EAAM2F,CAAY,EAE7B8K,CACb,KAAW,CAEL,IAAI3T,EAAM,CAAA,EACV,OAAIkD,EAAK,OAAS,KACLkI,GAAO,QAAQpL,EAAKkD,EAAM2F,CAAY,EAE5C7I,CACR,CACF,CAGD,SAAS8qC,EAAW5nC,EAAM,CACxB,IAAI2nC,EAAgB,GACpB,OAAA3nC,EAAK,QAAQ,SAAUlU,EAAO8H,EAAOkJ,EAAK,IAChCnR,GAAI,aAAaG,CAAK,IAC5B67C,EAAgB,GAChB7qC,EAAIlJ,CAAK,EAAI9H,EAAM,SAAQ,EAEnC,CAAK,EACM67C,CACR,CAGD,SAASpiC,EAAUvF,EAAM,CACvBA,EAAK,QAAQ,SAAUlU,EAAO,CAC5B,GAAI,OAAOA,GAAU,UAAY,IAAKyW,GAAQ,WAAWzW,CAAK,GAAKA,EAAQ,EACzE,MAAM,IAAI,MAAM,uDAAuD,CAE/E,CAAK,CACF,CACH,CAAC,EACD07C,GAAA,WAAqBC,mBC7HrB,OAAO,eAAeI,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAGC,GACJD,GAAA,WAAGE,GACNF,GAAA,QAAGG,GACFH,GAAA,SAAGI,GACHJ,GAAA,SAAGK,GACnB,SAASJ,IAAc,CACrB,MAAM,IAAI,MAAM,yCAAyC,CAC3D,CACA,SAASC,IAAa,CACpB,MAAM,IAAI,MAAM,wCAAwC,CAC1D,CACA,SAASE,IAAW,CAClB,MAAM,IAAI,MAAM,sCAAsC,CACxD,CACA,SAASD,IAAU,CACjB,MAAM,IAAI,MAAM,qCAAqC,CACvD,CACA,SAASE,IAAW,CAClB,MAAM,IAAI,MAAM,sCAAsC,CACxD,CCtBA,OAAO,eAAehoB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIxT,GAAWhlB,EACXygD,GAAQ99C,GACR6D,GAAO,QACPia,GAAe,CAAC,QAAS,SAAU,UAAW,aAAc,UAAW,YAAa,SAAU,UAAU,EACxGigC,MAAiC17B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdU,EAASV,EAAK,OACdsjB,EAAYtjB,EAAK,UACjB4zB,EAAU5zB,EAAK,QACfs7B,EAAYt7B,EAAK,UACjBu7B,EAASv7B,EAAK,OACdw7B,EAAWx7B,EAAK,SA4ClB,OAAO3d,EAAMlB,GAAM,CAIjB,OAAQs6C,EACR,kBAAmBA,EACnB,iBAAkB,SAAsBzrC,EAAOC,EAAK,CAClD,OAAOyrC,EAAKC,EAAS3rC,EAAOC,EAAK,CAAC,CAAC,CACpC,EACD,yBAA0B,SAA4BD,EAAOC,EAAKuO,EAAM,CACtE,OAAOk9B,EAAKC,EAAS3rC,EAAOC,EAAKuO,CAAI,CAAC,CACvC,EACD,0BAA2B,SAA6BxO,EAAOC,EAAK2rC,EAAY,CAC9E,OAAoBF,EAAbE,EAAkBC,EAAU7rC,EAAOC,EAAK,CAAC,EAAU0rC,EAAS3rC,EAAOC,EAAK,CAAC,CAA/B,CAClD,EACD,kCAAmC,SAAmCD,EAAOC,EAAKuO,EAAMo9B,EAAY,CAClG,OAAoBF,EAAbE,EAAkBC,EAAU7rC,EAAOC,EAAKuO,CAAI,EAAUm9B,EAAS3rC,EAAOC,EAAKuO,CAAI,CAAlC,CACrD,EACD,uBAAwB,SAA4BxO,EAAOC,EAAK,CAC9D,IAAIgQ,EAAYjQ,EAAM,YACtB,OAAO0rC,EAAKI,EAAY9rC,EAAOC,EAAK,IAAIgQ,EAAU,CAAC,CAAC,CAAC,CACtD,EACD,kCAAmC,SAAqCjQ,EAAOC,EAAKuO,EAAM,CACxF,OAAOk9B,EAAKI,EAAY9rC,EAAOC,EAAKuO,CAAI,CAAC,CAC1C,EACD,gCAAiC,SAAmCxO,EAAOC,EAAK2rC,EAAY,CAC1F,IAAI37B,EAAYjQ,EAAM,YACtB,OAAoB0rC,EAAbE,EAAkBG,EAAa/rC,EAAOC,EAAK,IAAIgQ,EAAU,CAAC,CAAC,EAAU67B,EAAY9rC,EAAOC,EAAK,IAAIgQ,EAAU,CAAC,CAAC,CAAjD,CACpE,EACD,2CAA4C,SAA4CjQ,EAAOC,EAAKuO,EAAMo9B,EAAY,CACpH,OAAoBF,EAAbE,EAAkBG,EAAa/rC,EAAOC,EAAKuO,CAAI,EAAUs9B,EAAY9rC,EAAOC,EAAKuO,CAAI,CAArC,CACxD,CACL,CAAG,EACD,SAASk9B,EAAK3rC,EAAK,CACjB,OAAIxV,EAAO,SAAW,SACbmmB,EAASA,EAAO3Q,CAAG,KAAQqrC,GAAM,YAEnCrrC,CACR,CACD,SAAS0rC,EAAUt7C,EAAKy7C,EAAY,CAClC,IAAIv/B,EAAI2/B,EAAO77C,CAAG,EAClB,GAAI,CAACkc,EACH,MAAM,IAAI,YAAY,WAAalc,EAAM,qBAAqB,EAEhE,IAAIoD,EACJ,OAAIhJ,EAAO,SAAW,aAChB+oC,IAAc,WACZ8X,GAAM,eAEZ73C,EAAKq4C,EAAaG,EAAeD,EAC1BJ,EAAKn4C,EAAG+/B,EAAUjnB,EAAE,KAAK,EAAGinB,EAAUjnB,EAAE,GAAG,EAAGinB,EAAUjnB,EAAE,IAAI,CAAC,CAAC,IAEvE9Y,EAAKq4C,EAAaC,EAAYF,EACvBD,EAAKn4C,EAAG8Y,EAAE,MAAOA,EAAE,IAAKA,EAAE,IAAI,CAAC,EAEzC,CAUD,SAASs/B,EAAS3rC,EAAOC,EAAKuO,EAAM,CAClC,IAAIvd,EAAQ,CAAA,EACR1D,EAAIyS,EACR,GAAIwO,EAAO,EACT,KAAOo1B,EAAQr2C,EAAG0S,CAAG,GACnBhP,EAAM,KAAK1D,CAAC,EACZA,GAAKihB,UAEEA,EAAO,EAChB,KAAO+8B,EAAOh+C,EAAG0S,CAAG,GAClBhP,EAAM,KAAK1D,CAAC,EACZA,GAAKihB,EAGT,OAAOvd,CACR,CAUD,SAAS46C,EAAU7rC,EAAOC,EAAKuO,EAAM,CACnC,IAAIvd,EAAQ,CAAA,EACR1D,EAAIyS,EACR,GAAIwO,EAAO,EACT,KAAO88B,EAAU/9C,EAAG0S,CAAG,GACrBhP,EAAM,KAAK1D,CAAC,EACZA,GAAKihB,UAEEA,EAAO,EAChB,KAAOg9B,EAASj+C,EAAG0S,CAAG,GACpBhP,EAAM,KAAK1D,CAAC,EACZA,GAAKihB,EAGT,OAAOvd,CACR,CAUD,SAAS66C,EAAY9rC,EAAOC,EAAKuO,EAAM,CACrC,IAAI+gB,EAAO+D,EAAU,CAAC,EAClBriC,EAAQ,CAAA,EACR1D,EAAIyS,EACR,GAAIwO,EAAK,GAAG+gB,CAAI,EACd,KAAOqU,EAAQr2C,EAAG0S,CAAG,GACnBhP,EAAM,KAAK1D,CAAC,EACZA,EAAIA,EAAE,KAAKihB,CAAI,UAERA,EAAK,GAAG+gB,CAAI,EACrB,KAAOgc,EAAOh+C,EAAG0S,CAAG,GAClBhP,EAAM,KAAK1D,CAAC,EACZA,EAAIA,EAAE,KAAKihB,CAAI,EAGnB,OAAOvd,CACR,CAUD,SAAS86C,EAAa/rC,EAAOC,EAAKuO,EAAM,CACtC,IAAI+gB,EAAO+D,EAAU,CAAC,EAClBriC,EAAQ,CAAA,EACR1D,EAAIyS,EACR,GAAIwO,EAAK,GAAG+gB,CAAI,EACd,KAAO+b,EAAU/9C,EAAG0S,CAAG,GACrBhP,EAAM,KAAK1D,CAAC,EACZA,EAAIA,EAAE,KAAKihB,CAAI,UAERA,EAAK,GAAG+gB,CAAI,EACrB,KAAOic,EAASj+C,EAAG0S,CAAG,GACpBhP,EAAM,KAAK1D,CAAC,EACZA,EAAIA,EAAE,KAAKihB,CAAI,EAGnB,OAAOvd,CACR,CAWD,SAAS+6C,EAAO77C,EAAK,CACnB,IAAIyG,EAAOzG,EAAI,MAAM,GAAG,EAGpBovB,EAAO3oB,EAAK,IAAI,SAAU2D,EAAK,CAEjC,OAAO,OAAOA,CAAG,CACvB,CAAK,EACGilB,EAAUD,EAAK,KAAK,SAAUpK,EAAK,CACrC,OAAO,MAAMA,CAAG,CACtB,CAAK,EACD,GAAIqK,EACF,OAAO,KAET,OAAQD,EAAK,OAAM,CACjB,IAAK,GACH,MAAO,CACL,MAAOA,EAAK,CAAC,EACb,IAAKA,EAAK,CAAC,EACX,KAAM,CAChB,EACM,IAAK,GACH,MAAO,CACL,MAAOA,EAAK,CAAC,EACb,IAAKA,EAAK,CAAC,EACX,KAAMA,EAAK,CAAC,CACtB,EACM,QACE,OAAO,IACV,CACF,CACH,CAAC,EACD4D,GAAA,YAAsBkoB,aCpQtB,OAAO,eAAetjC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAIoD,GAASxgB,GACTglB,GAAWriB,EACX6D,GAAO,UACPia,GAAe,CAAC,QAAS,YAAa,QAAQ,EAC9C6gC,MAAmCt8B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC3F,IAAI3d,EAAQ2d,EAAK,MACflO,EAAYkO,EAAK,UAyCnB,OAAO3d,EAAMlB,GAAM,CACjB,gBAAiB,SAAqB5D,EAAG4b,EAAO,CAC9C,OAAO5b,EAAE,QAAQ4b,EAAO,EAAI,CAC7B,EACD,eAAgB,SAAoB5b,EAAG4b,EAAO,CAC5C,OAAAA,EAAM,QAAQ,SAAUlG,EAAM,CAC5B,GAAI,CAACnB,EAAUmB,CAAI,EACjB,MAAM,IAAI,UAAU,+BAAiCA,CAAI,CAEnE,CAAO,KACUkI,GAAO,SAAS5d,EAAG4b,CAAK,CACpC,CACL,CAAG,CACH,CAAC,EACDpB,GAAA,cAAwBkkC,aCjExB,OAAO,eAAejkC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAIpZ,GAAMjE,GACN2d,GAAkBhb,GAClBiwC,GAAkB1uC,GAClB2W,GAAUlU,GACV+W,GAAUhC,GACVhW,GAAUwf,GACV1E,GAASqX,GACT7S,GAAW8S,EACXtxB,GAAO,SACPia,GAAe,CAAC,SAAU,QAAQ,EAClC8gC,MAAkCv8B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC1F,IAAIzlB,EAASylB,EAAK,OAChBU,EAASV,EAAK,OA4BhB,OAAO,SAAgBziB,EAAG0V,EAAM2F,EAAc,CAC5C,GAAI,UAAU,SAAW,GAAK,UAAU,SAAW,EACjD,MAAM,IAAI20B,GAAgB,eAAe,SAAU,UAAU,OAAQ,EAAG,CAAC,EAc3E,MAZQ3uC,GAAI,UAAUqU,CAAI,IACxBA,EAAOA,EAAK,cAGNrU,GAAI,aAAaqU,EAAK,CAAC,CAAC,IAE9BA,EAAOA,EAAK,IAAI,SAAUlU,EAAO,CAC/B,SAAYH,GAAI,aAAaG,CAAK,EAAYA,EAAM,WAAdA,CAC9C,CAAO,MAIKH,GAAI,UAAUrB,CAAC,EAErB,OAAOA,EAAE,OAAO0V,EAAM2F,EAAc,EAAI,EAE1C,GAAI,OAAOrb,GAAM,SAEf,OAAO4+C,EAAc5+C,EAAG0V,EAAM2F,CAAY,EAI5C,IAAIw+B,EAAW,MAAM,QAAQ75C,CAAC,EAAI,GAAQhD,EAAO,SAAW,QAC5D,GAAI0Y,EAAK,SAAW,EAAG,CAErB,KAAO,MAAM,QAAQ1V,CAAC,GACpBA,EAAIA,EAAE,CAAC,EAET,SAAW8C,GAAQ,OAAO9C,CAAC,CACjC,KAAW,CAEA,MAAM,QAAQA,CAAC,IAClBA,EAAI,CAACA,CAAC,GAERA,KAAQ8C,GAAQ,OAAO9C,CAAC,EACxB,IAAIoxB,KAAUxT,GAAO,QAAQ5d,EAAG0V,EAAM2F,CAAY,EAClD,OAAOw+B,EAAW12B,EAAOiO,CAAG,EAAIA,CACjC,CACL,EASE,SAASwtB,EAAch8C,EAAK8S,EAAMmpC,EAAa,CAC7C,GAAIA,IAAgB,QAClB,GAAI,OAAOA,GAAgB,UAAYA,EAAY,SAAW,EAC5D,MAAM,IAAI,UAAU,2CAA2C,OAGjEA,EAAc,IAEhB,GAAInpC,EAAK,SAAW,EAClB,MAAM,IAAIqF,GAAgB,eAAerF,EAAK,OAAQ,CAAC,EAEzD,IAAI7T,EAAM6T,EAAK,CAAC,EAChB,GAAI,OAAO7T,GAAQ,UAAY,IAAKoW,GAAQ,WAAWpW,CAAG,EACxD,MAAM,IAAI,UAAU,0DAAkEiZ,GAAQ,QAAQpF,CAAI,EAAI,GAAG,EAEnH,GAAI9S,EAAI,OAASf,EACf,OAAOe,EAAI,UAAU,EAAGf,CAAG,EACtB,GAAIe,EAAI,OAASf,EAAK,CAE3B,QADIuvB,EAAMxuB,EACD/F,EAAI,EAAG8Q,EAAK9L,EAAMe,EAAI,OAAQ/F,EAAI8Q,EAAI9Q,IAC7Cu0B,GAAOytB,EAET,OAAOztB,CACb,KACM,QAAOxuB,CAEV,CACH,CAAC,EACD6X,GAAA,aAAuBkkC,aC3HvB,OAAO,eAAeG,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAI18B,GAAWhlB,EACXwgB,GAAS7d,GACT6D,GAAO,SACPia,GAAe,CAAC,QAAS,WAAY,gBAAgB,EACrDkhC,MAAkC38B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC1F,IAAI3d,EAAQ2d,EAAK,MACf6vB,EAAW7vB,EAAK,SAChBu8B,EAAiBv8B,EAAK,eA6BxB,OAAO3d,EAAMlB,GAAM,CACjB,8CAA+C,SAAyC6lB,EAAGw1B,EAAO,CAChGC,EAAcz1B,EAAG,CAAC,EAClB,IAAI01B,EAAY7M,EAAS0M,EAAeC,CAAK,EAAGx1B,CAAC,EACjD,OAAO01B,EAAU,SAClB,EACD,+CAAgD,SAA0C11B,EAAGw1B,EAAO,CAClG,OAAAC,EAAcz1B,EAAG,CAAC,EACX6oB,EAAS0M,EAAeC,CAAK,EAAGx1B,CAAC,CACzC,EACD,6DAA8D,SAAoDA,EAAGw1B,EAAOxxB,EAAG,CAC7HyxB,EAAcz1B,EAAG,CAAC,EAClB,IAAI01B,EAAY7M,EAAS0M,EAAeC,EAAOxxB,CAAC,EAAGhE,CAAC,EACpD,OAAO01B,CACR,EACD,8DAA+D,SAAqD11B,EAAGw1B,EAAOxxB,EAAG,CAC/H,OAAAyxB,EAAcz1B,EAAG,CAAC,EACX6oB,EAAS0M,EAAeC,EAAOxxB,CAAC,EAAGhE,CAAC,CAC5C,CACL,CAAG,EACD,SAASy1B,EAAczxB,EAAG2xB,EAAc,CACtC,IAAIC,EAAa,MAAM,QAAQ5xB,CAAC,KAAQ7P,GAAO,WAAW6P,CAAC,EAAIA,EAAE,KAAI,EACrE,GAAI4xB,EAAW,OAAS,EACtB,MAAM,IAAI,WAAW,kCAAkC,OAAOD,CAAY,CAAC,EAE7E,GAAIC,EAAW,SAAW,GAAKA,EAAW,CAAC,IAAM,EAC/C,MAAM,IAAI,WAAW,kCAAkC,OAAOD,CAAY,CAAC,EAE7E,GAAIC,EAAW,CAAC,IAAMD,EACpB,MAAM,IAAI,WAAW,kCAAkC,OAAOA,CAAY,CAAC,CAE9E,CACH,CAAC,EACDN,GAAA,aAAuBC,aCzEvB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAI39C,GAAMjE,GACNglB,GAAWriB,EACX6D,GAAO,iBACPia,GAAe,CAAC,QAAS,SAAU,iBAAkB,YAAa,aAAc,OAAQ,SAAU,YAAa,cAAe,eAAgB,MAAO,KAAK,EAC1JyhC,MAA0Cl9B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAClG,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACd2vB,EAAiB3vB,EAAK,eACtBqlB,EAAYrlB,EAAK,UACjB6kB,EAAa7kB,EAAK,WAClB88B,EAAO98B,EAAK,KACZC,EAAYD,EAAK,UACjBU,EAASV,EAAK,OACdG,EAAcH,EAAK,YACnBkf,EAAelf,EAAK,aACpBmL,EAAMnL,EAAK,IACX8L,EAAM9L,EAAK,IAkCb,OAAO3d,EAAMlB,GAAM,CACjB,GAAI,UAAa,CACf,OAAO5G,EAAO,SAAW,SAAWmmB,EAAO,CAAA,CAAE,EAAI,EAClD,EACD,OAAQ,SAAgB7O,EAAQ,CAC9B,OAAO6O,EAAO7O,CAAM,CACrB,EACD,sCAAuC,SAAoC2qC,EAAO,CAChF,OAAOO,EAAmBP,EAAOjiD,EAAO,SAAW,SAAW,QAAU,MAAS,CAClF,EACD,8CAA+C,SAA0CiiD,EAAO3qC,EAAQ,CACtG,OAAOkrC,EAAmBP,EAAO3qC,CAAM,CACxC,EACD,6CAA8C,SAAyC2qC,EAAOxxB,EAAG,CAC/F,IAAIgyB,EAAUt8B,EAAOsK,CAAC,EACtB,OAAAiyB,EAAgBD,CAAO,EAChBE,EAAmBV,EAAOQ,EAAS,MAAS,CACpD,EACD,8CAA+C,SAA0CR,EAAOxxB,EAAG,CACjGiyB,EAAgBjyB,CAAC,EACjB,IAAImyB,EAAcnyB,EAAE,YAAczwB,EAAO,SAAW,SAAW,QAAU,QACzE,OAAO2iD,EAAmBV,EAAOxxB,EAAGmyB,CAAW,CAChD,EACD,qDAAsD,SAA+CX,EAAOxxB,EAAGnZ,EAAQ,CACrH,IAAImrC,EAAUt8B,EAAOsK,CAAC,EACtB,OAAAiyB,EAAgBD,CAAO,EAChBE,EAAmBV,EAAOQ,EAASnrC,CAAM,CACjD,EACD,sDAAuD,SAAgD2qC,EAAOxxB,EAAGnZ,EAAQ,CACvH,OAAAorC,EAAgBjyB,CAAC,EACVkyB,EAAmBV,EAAOxxB,EAAGnZ,CAAM,CAC3C,CACL,CAAG,EAUD,SAASkrC,EAAmBP,EAAO3qC,EAAQ,CACzC,IAAIghC,KAAUj0C,GAAI,aAAa49C,CAAK,EAChCY,EAAWvK,EAAM,IAAI5yB,EAAU,EAAE,EAAI,GACrCo9B,EAAWlyB,EAAIqxB,CAAK,EACpBc,EAAWxxB,EAAI0wB,CAAK,EACpB7sB,EAAO,CAAC,CAAC0tB,EAAU1N,EAAeyN,EAAUE,CAAQ,CAAC,EAAG,CAACA,EAAUD,CAAQ,CAAC,EAChF,OAAOE,EAAiB5tB,EAAM9d,CAAM,CACrC,CACD,SAASorC,EAAgBjyB,EAAG,CAC1B,IAAI/X,EAAO+X,EAAE,OACb,GAAI/X,EAAK,OAAS,GAAKA,EAAK,CAAC,IAAM,EACjC,MAAM,IAAI,WAAW,kCAAkC,CAE1D,CACD,SAASuqC,EAAKv8C,EAAO,CACnB,OAAOA,EAAM,OAAO,SAAU8D,EAAGjE,EAAM,CACrC,OAAO6uC,EAAe5qC,EAAGjE,CAAI,CACnC,CAAK,CACF,CACD,SAASy8C,EAAiB5tB,EAAM9d,EAAQ,CACtC,GAAIA,EAAQ,CACV,GAAIA,IAAW,SACb,OAAO,IAAIqtB,EAAavP,CAAI,EAE9B,GAAI9d,IAAW,QACb,OAAO,IAAIsO,EAAYwP,CAAI,EAE7B,MAAM,IAAI,UAAU,wBAAyB,OAAO9d,EAAQ,GAAI,CAAC,CAClE,CACD,OAAO8d,CACR,CAWD,SAASutB,EAAmBV,EAAOxxB,EAAGnZ,EAAQ,CAC5C,IAAI4rC,EAAQX,EAAK9xB,CAAC,EAClB,GAAIyyB,IAAU,EACZ,MAAM,IAAI,WAAW,6BAA6B,EAEpD,IAAI5K,KAAUj0C,GAAI,aAAa49C,CAAK,EAAIv8B,EAAY,KAChDgE,EAAM4uB,EAAM,IAAIA,EAAI,CAAC,EAAI,EACzBuK,EAAWvK,EAAM,IAAIA,EAAI,EAAE,EAAI,GAC/B3Q,EAAK2Q,EAAM,IAAIA,EAAI7nB,EAAE,IAAI,CAAC,CAAC,CAAC,EAAIyyB,CAAK,EAAIzyB,EAAE,IAAI,CAAC,CAAC,CAAC,EAAIyyB,EACtDtb,EAAK0Q,EAAM,IAAIA,EAAI7nB,EAAE,IAAI,CAAC,CAAC,CAAC,EAAIyyB,CAAK,EAAIzyB,EAAE,IAAI,CAAC,CAAC,CAAC,EAAIyyB,EACtDC,EAAK7K,EAAM,IAAIA,EAAI7nB,EAAE,IAAI,CAAC,CAAC,CAAC,EAAIyyB,CAAK,EAAIzyB,EAAE,IAAI,CAAC,CAAC,CAAC,EAAIyyB,EACtDh0C,EAAI0hB,EAAIqxB,CAAK,EACbmB,EAAYtY,EAAUphB,EAAK4gB,EAAWp7B,CAAC,CAAC,EACxCrE,EAAI0mB,EAAI0wB,CAAK,EACboB,EAAMvY,EAAU57B,EAAG+zC,EAAK,CAACtb,EAAIA,EAAIyb,CAAS,CAAC,CAAC,EAC5CE,EAAMxY,EAAUmY,EAAK,CAACtb,EAAIC,EAAIwb,CAAS,CAAC,EAAGH,EAAK,CAACJ,EAAUM,EAAIt4C,CAAC,CAAC,CAAC,EAClE04C,EAAMzY,EAAUmY,EAAK,CAACtb,EAAIwb,EAAIC,CAAS,CAAC,EAAGH,EAAK,CAACrb,EAAI/8B,CAAC,CAAC,CAAC,EACxD24C,EAAM1Y,EAAUmY,EAAK,CAACtb,EAAIC,EAAIwb,CAAS,CAAC,EAAGH,EAAK,CAACE,EAAIt4C,CAAC,CAAC,CAAC,EACxD44C,EAAM3Y,EAAU57B,EAAG+zC,EAAK,CAACrb,EAAIA,EAAIwb,CAAS,CAAC,CAAC,EAC5CM,EAAM5Y,EAAUmY,EAAK,CAACrb,EAAIub,EAAIC,CAAS,CAAC,EAAGH,EAAK,CAACJ,EAAUlb,EAAI98B,CAAC,CAAC,CAAC,EAClE84C,EAAM7Y,EAAUmY,EAAK,CAACtb,EAAIwb,EAAIC,CAAS,CAAC,EAAGH,EAAK,CAACJ,EAAUjb,EAAI/8B,CAAC,CAAC,CAAC,EAClE+4C,GAAM9Y,EAAUmY,EAAK,CAACrb,EAAIub,EAAIC,CAAS,CAAC,EAAGH,EAAK,CAACtb,EAAI98B,CAAC,CAAC,CAAC,EACxDg5C,EAAM/Y,EAAU57B,EAAG+zC,EAAK,CAACE,EAAIA,EAAIC,CAAS,CAAC,CAAC,EAC5ChuB,EAAO,CAAC,CAACiuB,EAAKC,EAAKC,CAAG,EAAG,CAACC,EAAKC,EAAKC,CAAG,EAAG,CAACC,EAAKC,GAAKC,CAAG,CAAC,EAC7D,OAAOb,EAAiB5tB,EAAM9d,CAAM,CACrC,CACH,CAAC,EACD0qC,GAAA,qBAA+BM,aCpK/B,OAAO,eAAe3oB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIvU,GAAWhlB,EACXiE,GAAMtB,GACN+C,GAAUxB,GACVsc,GAAS7Z,GACTH,GAAO,MACPia,GAAe,CAAC,QAAS,QAAS,SAAU,OAAO,EACnDijC,MAA+B1+B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MACf03B,EAAQ13B,EAAK,MACbU,EAASV,EAAK,OACdmT,EAAQnT,EAAK,MAsBf,OAAO3d,EAAMlB,GAAM,CACjB,iBAAkBm9C,EAClB,gBAAiB,SAAqBv/C,EAAOm1B,EAAK,CAChD,OAAOoqB,EAAK59B,KAAWrgB,GAAQ,OAAOtB,CAAK,CAAC,EAAGm1B,CAAG,EAAE,SACrD,CACL,CAAG,EAQD,SAASoqB,EAAKv/C,EAAOm1B,EAAK,CAExB,GAAIn1B,EAAM,OAAO,SAAW,EAC1B,MAAM,IAAI,MAAM,0CAA0C,KAExDoc,GAAO,eAAe+Y,EAAKn1B,EAAM,KAAM,EAAC,CAAC,CAAC,EAC9C,IAAIw/C,EAAcprB,EAAM,EAAGp0B,EAAM,KAAM,EAAC,CAAC,CAAC,EACtC8H,EAAQ,IAAI6wC,EAAMxjB,EAAKqqB,CAAW,EAClC3rC,EAAS7T,EAAM,OAAO8H,CAAK,EAC/B,SAAWjI,GAAI,UAAUgU,CAAM,EAAIA,EAAS8N,EAAO,CAAC,CAAC9N,CAAM,CAAC,CAAC,CAC9D,CACH,CAAC,EACDshB,GAAA,UAAoBmqB,aC7DpB,OAAO,eAAeprC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIkI,GAASxgB,GACTglB,GAAWriB,EACX89C,GAAQv8C,GACRsC,GAAO,OACPia,GAAe,CAAC,QAAS,SAAU,SAAS,EAC5CojC,MAAgC7+B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdU,EAASV,EAAK,OAwBhB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,SAAgB5D,EAAG,CACzB,OAAOA,EAAE,OAAOA,EAAE,KAAM,CAAA,CACzB,EACD,MAAO4d,GAAO,UACd,OAAQ,SAAgB5d,EAAG,CACzB,OAAOhD,EAAO,SAAW,QAAU,CAACgD,EAAE,MAAM,EAAImjB,EAAO,CAACnjB,EAAE,MAAM,CAAC,CAClE,EACD,uDAAwD,SAA+CA,EAAG,CAExG,OAAOhD,EAAO,SAAW,QAAU,GAAKmmB,EAASA,EAAO,EAAE,KAAQ06B,GAAM,UAAQ,CACjF,CACL,CAAG,CACH,CAAC,EACDnoC,GAAA,WAAqBurC,aClDrB,OAAO,eAAevmC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAI5X,GAAU1F,GACVwgB,GAAS7d,GACTqiB,GAAW9gB,EACXsC,GAAO,UACPia,GAAe,CAAC,QAAS,QAAQ,EACjCqjC,MAAmC9+B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC3F,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OA8BhB,OAAO3d,EAAMlB,GAAM,CACjB,MAAO,SAAe5D,EAAG,CACvB,SAAW4d,GAAO,YAAa9a,GAAQ,OAAO9C,CAAC,CAAC,CACjD,EACD,OAAQ,SAAgBA,EAAG,CACzB,IAAIoxB,KAAUxT,GAAO,SAAS5d,EAAE,QAAO,CAAE,EAEzC,OAAO,MAAM,QAAQoxB,CAAG,EAAIjO,EAAOiO,CAAG,EAAIA,CAC3C,EACD,IAAK,SAAapxB,EAAG,CAEnB,SAAW8C,GAAQ,OAAO9C,CAAC,CAC5B,CACL,CAAG,CACH,CAAC,EACD0a,GAAA,cAAwBwmC,aCxDxB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAI9/C,GAAMjE,GACN0F,GAAU/C,GACV6d,GAAStc,GACTkf,GAAWzc,GACXgX,GAAkBjC,GAClBsJ,GAAWE,EACX1e,GAAO,SACPia,GAAe,CAAC,QAAS,QAAQ,EACjCujC,MAAkCh/B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC1F,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OA6ChB,OAAO3d,EAAMlB,GAAM,CAEjB,eAAgB,SAAoBpC,EAAO8H,EAAO,CAChD,IAAI6c,EAAIhD,EAAO3hB,CAAK,EAChB2/C,EAASh7B,EAAE,OAAO7c,CAAK,EAC3B,OAAOA,EAAM,SAAU,EAAG63C,EAASA,EAAO,QAAO,CAClD,EAED,gBAAiB,SAAqB3/C,EAAO8H,EAAO,CAClD,OAAO9H,EAAM,OAAO8H,CAAK,CAC1B,EACD,gBAAiB+3C,GACjB,gBAAiBC,GAEjB,oBAAqB,SAAuB9/C,EAAO8H,EAAOgpB,EAAa,CACrE,OAAOnP,KAAWrgB,GAAQ,OAAOtB,CAAK,CAAC,EAAE,OAAO8H,EAAOgpB,EAAa,MAAS,EAAE,QAAO,CACvF,EACD,yBAA0B,SAA0B9wB,EAAO8H,EAAOgpB,EAAajX,EAAc,CAC3F,OAAO8H,KAAWrgB,GAAQ,OAAOtB,CAAK,CAAC,EAAE,OAAO8H,EAAOgpB,EAAajX,CAAY,EAAE,QAAO,CAC1F,EACD,qBAAsB,SAAwB7Z,EAAO8H,EAAOgpB,EAAa,CACvE,OAAO9wB,EAAM,MAAO,EAAC,OAAO8H,EAAOgpB,CAAW,CAC/C,EACD,0BAA2B,SAA2B9wB,EAAO8H,EAAOgpB,EAAajX,EAAc,CAC7F,OAAO7Z,EAAM,QAAQ,OAAO8H,EAAOgpB,EAAajX,CAAY,CAC7D,EACD,wBAAyBkmC,GACzB,gCAAiCA,GACjC,qBAAsBC,EAC1B,CAAG,CACH,CAAC,EASmBL,GAAA,aAAGC,GACvB,SAASE,GAAc1+C,EAAK0G,EAAO,CACjC,GAAI,IAAKjI,GAAI,SAASiI,CAAK,EAEzB,MAAM,IAAI,UAAU,gBAAgB,EAEtC,GAAIA,EAAM,OAAO,SAAW,EAC1B,MAAM,IAAIyR,GAAgB,eAAezR,EAAM,OAAO,OAAQ,CAAC,EAIjE,IAAIm4C,EAAS7+C,EAAI,UACbgb,GAAO,eAAetU,EAAM,IAAG,EAAG,CAAC,EAAGm4C,CAAM,KAC5C7jC,GAAO,eAAetU,EAAM,IAAG,EAAG,CAAC,EAAGm4C,CAAM,EAChD,IAAI7rB,EAAQtsB,EAAM,UAAU,CAAC,EACzBo4C,EAAS,GACb,OAAA9rB,EAAM,QAAQ,SAAUnI,EAAG,CACzBi0B,GAAU9+C,EAAI,OAAO6qB,CAAC,CAC1B,CAAG,EACMi0B,CACT,CAYA,SAASH,GAAc3+C,EAAK0G,EAAOgpB,EAAajX,EAAc,CAC5D,GAAI,CAAC/R,GAASA,EAAM,UAAY,GAE9B,MAAM,IAAI,UAAU,gBAAgB,EAEtC,GAAIA,EAAM,OAAO,SAAW,EAC1B,MAAM,IAAIyR,GAAgB,eAAezR,EAAM,OAAO,OAAQ,CAAC,EAEjE,GAAI+R,IAAiB,QACnB,GAAI,OAAOA,GAAiB,UAAYA,EAAa,SAAW,EAC9D,MAAM,IAAI,UAAU,2CAA2C,OAGjEA,EAAe,IAEjB,IAAIua,EAAQtsB,EAAM,UAAU,CAAC,EACzBzH,EAAM+zB,EAAM,KAAM,EAAC,CAAC,EACxB,GAAI/zB,IAAQywB,EAAY,OACtB,MAAM,IAAIvX,GAAgB,eAAe6a,EAAM,KAAM,EAAC,CAAC,EAAGtD,EAAY,MAAM,EAI9E,IAAImvB,EAAS7+C,EAAI,UACbgb,GAAO,eAAetU,EAAM,IAAK,EAAC,CAAC,CAAC,KACpCsU,GAAO,eAAetU,EAAM,IAAK,EAAC,CAAC,CAAC,EAIxC,QADIq4C,EAAQ,CAAA,EACH9kD,EAAI,EAAGA,EAAI4kD,EAAQ5kD,IAC1B8kD,EAAM9kD,CAAC,EAAI+F,EAAI,OAAO/F,CAAC,EAOzB,GALA+4B,EAAM,QAAQ,SAAUnI,EAAG5wB,EAAG,CAC5B8kD,EAAMl0B,CAAC,EAAI6E,EAAY,OAAOz1B,EAAE,CAAC,CAAC,CACtC,CAAG,EAGG8kD,EAAM,OAASF,EACjB,QAAS7/B,EAAK6/B,EAAS,EAAGhgC,EAAOkgC,EAAM,OAAQ//B,EAAKH,EAAMG,IACnD+/B,EAAM//B,CAAE,IACX+/B,EAAM//B,CAAE,EAAIvG,GAIlB,OAAOsmC,EAAM,KAAK,EAAE,CACtB,CASA,SAASN,GAAmBjhD,EAAQkJ,EAAO,CACzC,GAAIA,EAAM,OAAO,SAAW,EAC1B,MAAM,IAAIyR,GAAgB,eAAezR,EAAM,KAAI,EAAI,CAAC,EAE1D,IAAIvM,EAAMuM,EAAM,UAAU,CAAC,EAC3B,GAAI,OAAOvM,GAAQ,SACjB,MAAM,IAAI,UAAU,yDAAyD,EAE/E,SAAWyjB,GAAS,iBAAiBpgB,EAAQrD,CAAG,CAClD,CAUA,SAASykD,GAAmBphD,EAAQkJ,EAAOgpB,EAAa,CACtD,GAAIhpB,EAAM,OAAO,SAAW,EAC1B,MAAM,IAAIyR,GAAgB,eAAezR,EAAM,KAAI,EAAI,CAAC,EAE1D,IAAIvM,EAAMuM,EAAM,UAAU,CAAC,EAC3B,GAAI,OAAOvM,GAAQ,SACjB,MAAM,IAAI,UAAU,yDAAyD,EAI/E,IAAI6kD,KAAc9+C,GAAQ,OAAO1C,CAAM,EACvC,SAAIogB,GAAS,iBAAiBohC,EAAS7kD,EAAKu1B,CAAW,EAChDsvB,CACT,WCvNA,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAI/+C,GAAU1F,GACV0d,GAAU/a,GACVqiB,GAAW9gB,EACXsC,GAAO,YACPia,GAAe,CAAC,QAAS,QAAQ,EACjCikC,MAAqC1/B,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC7F,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OAuBhB,OAAO3d,EAAMlB,GAAM,CACjB,MAAO,SAAe5D,EAAG,CACvB,OAAO+hD,EAAgB5+B,EAAOnjB,CAAC,CAAC,EAAE,QAAO,CAC1C,EACD,OAAQ+hD,EACR,IAAKj/C,GAAQ,KACjB,CAAG,EAED,SAASi/C,EAAgB/hD,EAAG,CAE1B,IAAI0V,EAAO1V,EAAE,OAGTkM,EAGJ,OAAQwJ,EAAK,OAAM,CACjB,IAAK,GAEHxJ,EAAIlM,EAAE,QACN,MACF,IAAK,GACH,CAEE,IAAIi3B,EAAOvhB,EAAK,CAAC,EACbwhB,EAAUxhB,EAAK,CAAC,EAGpB,GAAIwhB,IAAY,EAEd,MAAM,IAAI,WAAW,0DAA6Dpc,GAAQ,QAAQpF,CAAI,EAAI,GAAG,EAI/G,OAAQ1V,EAAE,QAAS,EAAA,CACjB,IAAK,QACHkM,EAAI81C,EAAgBhiD,EAAGi3B,EAAMC,CAAO,EACpC,MACF,IAAK,SACHhrB,EAAI+1C,EAAiBjiD,EAAGi3B,EAAMC,CAAO,EACrC,KACH,CACF,CACD,MACF,QAEE,MAAM,IAAI,WAAW,wDAA2Dpc,GAAQ,QAAQpF,CAAI,EAAI,GAAG,CAC9G,CACD,OAAOxJ,CACR,CACD,SAAS81C,EAAgB77B,EAAG8Q,EAAMC,EAAS,CAOzC,QALI9E,EAAOjM,EAAE,MAET+7B,EAAa,CAAA,EACbC,EAEK38B,EAAI,EAAGA,EAAI0R,EAAS1R,IAAK,CAEhC28B,EAAgBD,EAAW18B,CAAC,EAAI,GAEhC,QAAS3oB,EAAI,EAAGA,EAAIo6B,EAAMp6B,IAExBslD,EAActlD,CAAC,KAAQiG,GAAQ,OAAOsvB,EAAKv1B,CAAC,EAAE2oB,CAAC,CAAC,CAEnD,CAED,OAAOW,EAAE,kBAAkB,CACzB,KAAM+7B,EACN,KAAM,CAAChrB,EAASD,CAAI,EACpB,SAAU9Q,EAAE,SAClB,CAAK,CACF,CACD,SAAS87B,EAAiB97B,EAAG8Q,EAAMC,EAAS,CAW1C,QATI91B,EAAS+kB,EAAE,QACX7c,EAAQ6c,EAAE,OACVsc,EAAMtc,EAAE,KAERqjB,EAAUpoC,EAAS,CAAE,EAAG,OACxBo3B,EAAS,CAAA,EACTiR,EAAO,CAAA,EAEPhgB,EAAI,CAAA,EACCzpB,EAAI,EAAGA,EAAIi3B,EAAMj3B,IACxBypB,EAAEzpB,CAAC,EAAI,EAGT,IAAIwH,EAAGwrB,EAAGxN,EAEV,IAAKhe,EAAI,EAAGwrB,EAAI1pB,EAAM,OAAQ9B,EAAIwrB,EAAGxrB,IAEnCiiB,EAAEngB,EAAM9B,CAAC,CAAC,IAKZ,QAFI4kB,EAAM,EAEDvvB,EAAI,EAAGA,EAAIo6B,EAAMp6B,IAExB4sC,EAAK,KAAKrd,CAAG,EAEbA,GAAO3C,EAAE5sB,CAAC,EAEV4sB,EAAE5sB,CAAC,EAAI4sC,EAAK5sC,CAAC,EAKf,IAFA4sC,EAAK,KAAKrd,CAAG,EAER5G,EAAI,EAAGA,EAAI0R,EAAS1R,IAEvB,QAASsT,EAAK2J,EAAIjd,CAAC,EAAGuT,EAAK0J,EAAIjd,EAAI,CAAC,EAAGF,EAAIwT,EAAIxT,EAAIyT,EAAIzT,IAAK,CAE1D,IAAI8C,EAAIqB,EAAEngB,EAAMgc,CAAC,CAAC,IAElBkT,EAAOpQ,CAAC,EAAI5C,EAERpkB,IACFooC,EAAQphB,CAAC,KAAQtlB,GAAQ,OAAO1B,EAAOkkB,CAAC,CAAC,EAE5C,CAGH,OAAOa,EAAE,mBAAmB,CAC1B,OAAQqjB,EACR,MAAOhR,EACP,IAAKiR,EACL,KAAM,CAACvS,EAASD,CAAI,EACpB,SAAU9Q,EAAE,SAClB,CAAK,CACF,CACH,CAAC,EACD07B,GAAA,gBAA0BC,aCrK1B,OAAO,eAAeM,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIhgC,GAAWhlB,EACXwG,GAAO,aACPia,GAAe,CAAC,QAAS,YAAa,MAAM,EAC5CwkC,MAAsCjgC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC9F,IAAI3d,EAAQ2d,EAAK,MACfo/B,EAAYp/B,EAAK,UACjBw2B,EAAOx2B,EAAK,KAuBd,OAAO3d,EAAMlB,GAAM,CACjB,IAAK,SAAa5D,EAAG,CACnB,OAAOi5C,EAAK4I,EAAU7hD,CAAC,CAAC,CACzB,CACL,CAAG,CACH,CAAC,EACDoiD,GAAA,iBAA2BC,aCvC3B,OAAO,eAAehsC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIhV,GAAMjE,GACN6a,GAAUlY,GACV6d,GAAStc,GACT8gB,GAAWre,EACXH,GAAO,QACPia,GAAe,CAAC,QAAS,SAAU,SAAU,WAAW,EACxDykC,MAAiClgC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdU,EAASV,EAAK,OACdC,EAAYD,EAAK,UAiCnB,OAAO3d,EAAMlB,GAAM,CACjB,GAAI,UAAa,CACf,OAAO5G,EAAO,SAAW,QAAUulD,EAAO,CAAE,CAAA,EAAIA,EAAO,GAAI,SAAS,CACrE,EAGD,iCAAkC,SAA+B7sC,EAAM,CACrE,IAAI/M,EAAO+M,EAAKA,EAAK,OAAS,CAAC,EAC/B,GAAI,OAAO/M,GAAS,SAAU,CAC5B,IAAI2L,EAASoB,EAAK,MAClB,OAAO6sC,EAAO7sC,EAAMpB,CAAM,CAClC,KAAa,QAAItX,EAAO,SAAW,QACpBulD,EAAO7sC,CAAI,EAEX6sC,EAAO7sC,EAAM,SAAS,CAEhC,EACD,MAAO6sC,EACP,OAAQ,SAAgB7sC,EAAM,CAC5B,IAAIpB,EAASoB,EAAK,UAClB,OAAO6sC,EAAO7sC,EAAK,QAAS,EAAEpB,CAAM,CACrC,EACD,yBAA0B,SAA2BoB,EAAMpB,EAAQ,CACjE,OAAOiuC,EAAO7sC,EAAK,QAAS,EAAEpB,CAAM,CACrC,CACL,CAAG,EASD,SAASiuC,EAAO7sC,EAAMpB,EAAQ,CAC5B,IAAI+oC,EAAgBC,EAAW5nC,CAAI,EAC/B2F,EAAegiC,EAAgB,IAAI36B,EAAU,CAAC,EAAI,EAEtD,GADAzH,EAAUvF,CAAI,EACVpB,EAAQ,CAEV,IAAI6R,EAAIhD,EAAO7O,CAAM,EACrB,OAAIoB,EAAK,OAAS,EACTyQ,EAAE,OAAOzQ,EAAM2F,CAAY,EAE7B8K,CACb,KAAW,CAEL,IAAI3T,EAAM,CAAA,EACV,OAAIkD,EAAK,OAAS,KACLkI,GAAO,QAAQpL,EAAKkD,EAAM2F,CAAY,EAE5C7I,CACR,CACF,CAGD,SAAS8qC,EAAW5nC,EAAM,CACxB,IAAI2nC,EAAgB,GACpB,OAAA3nC,EAAK,QAAQ,SAAUlU,EAAO8H,EAAOkJ,EAAK,IAChCnR,GAAI,aAAaG,CAAK,IAC5B67C,EAAgB,GAChB7qC,EAAIlJ,CAAK,EAAI9H,EAAM,SAAQ,EAEnC,CAAK,EACM67C,CACR,CAGD,SAASpiC,EAAUvF,EAAM,CACvBA,EAAK,QAAQ,SAAUlU,EAAO,CAC5B,GAAI,OAAOA,GAAU,UAAY,IAAKyW,GAAQ,WAAWzW,CAAK,GAAKA,EAAQ,EACzE,MAAM,IAAI,MAAM,wDAAwD,CAEhF,CAAK,CACF,CACH,CAAC,EAGD6U,GAAA,YAAsBisC,aC7HlB9lD,GAAyBY,GAC7B,OAAO,eAAeolD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAI5U,GAAsBpxC,GAAuBuD,GAAA,CAAmD,EAChG6d,GAAStc,GACT8gB,GAAWre,EACXH,GAAO,MACPia,GAAe,CAAC,QAAS,SAAU,YAAa,iBAAkB,eAAgB,MAAO,MAAO,IAAK,YAAa,OAAQ,MAAO,OAAQ,MAAM,EAC/I4kC,MAA+BrgC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACnF,IAAA3d,EAAQ2d,EAAK,MACNA,EAAK,OAClB,IAAIqlB,EAAYrlB,EAAK,UACjB2vB,EAAiB3vB,EAAK,eACtBigC,EAAejgC,EAAK,aACpBpK,EAAMoK,EAAK,IACX4Z,EAAM5Z,EAAK,IACXgV,EAAIhV,EAAK,EACTkgC,EAAYlgC,EAAK,UACjBw2B,EAAOx2B,EAAK,KACZ0J,EAAM1J,EAAK,IACX8K,EAAO9K,EAAK,KACZzN,EAAOyN,EAAK,KAoBd,OAAO3d,EAAMlB,GAAM,CACjB,MAAOg/C,EACP,OAAQ,SAAgBz/B,EAAQ,CAC9B,OAAOA,EAAO,OAAOy/B,EAAOz/B,EAAO,QAAS,CAAA,CAAC,CAC9C,CACL,CAAG,EAQD,SAASy/B,EAAOpwC,EAAK,CACnB,IAAIkD,KAAWkI,GAAO,WAAWpL,CAAG,EACpC,OAAIkD,EAAK,SAAW,EAAUmtC,EAAKrwC,EAAKkD,EAAK,CAAC,CAAC,EAExCotC,EAAOtwC,EAAI,IAAI,SAAU3F,EAAO,CACrC,OAAO+1C,EAAO/1C,EAAO6I,EAAK,MAAM,CAAC,CAAC,CACxC,CAAK,EAAG,CAAC,CACN,CASD,SAASotC,EAAOtwC,EAAK0I,EAAK,CACxB,IAAIxF,KAAWkI,GAAO,WAAWpL,CAAG,EACpC,GAAI0I,IAAQ,EAAG,OAAO,IAAI,MAAMxF,EAAK,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,IAAI,SAAUgxB,EAAG7pC,EAAG,CACnE,OAAOimD,EAAOtwC,EAAI3V,CAAC,EAAGqe,EAAM,CAAC,CACnC,CAAK,EACD,GAAIxF,EAAK,SAAW,EAAG,OAAOmtC,EAAKrwC,CAAG,EACtC,SAASuwC,EAAWvwC,EAAK,CAEvB,IAAIkD,KAAWkI,GAAO,WAAWpL,CAAG,EACpC,OAAO,IAAI,MAAMkD,EAAK,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,IAAI,SAAUgxB,EAAGlhB,EAAG,CACpD,OAAO,IAAI,MAAM9P,EAAK,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,IAAI,SAAUgxB,EAAG7pC,EAAG,CACpD,OAAO2V,EAAI3V,CAAC,EAAE2oB,CAAC,CACzB,CAAS,CACT,CAAO,CACF,CACD,OAAOu9B,EAAWD,EAAOC,EAAWvwC,CAAG,EAAG,CAAC,CAAC,CAC7C,CAOD,SAASwwC,EAAKxwC,EAAK,CAIjB,QAHIgD,EAAIhD,EAAI,OACRiX,EAAIpR,EAAIqqC,EAAatQ,EAAe,GAAIA,EAAe3a,EAAG4E,CAAG,CAAC,EAAG7mB,CAAC,CAAC,EACnEytC,EAAQ,CAAA,EACHpmD,EAAI,EAAI2Y,EAAG3Y,EAAI2Y,EAAG3Y,IACzBomD,EAAM,KAAK92B,EAAI1C,EAAGi5B,EAAav2B,EAAItvB,EAAG,CAAC,EAAG,CAAC,CAAC,CAAC,EAgB/C,QAdIqmD,EAAK/2B,EAAI,EAAGoB,EAAKvY,EAAKQ,EAAIA,EAAI,CAAC,CAAC,CAAC,EACjC2tC,EAAK,CAAA,EAAG,UAAWvV,GAAoB,SAAY,IAAI,MAAMp4B,CAAC,EAAE,KAAK,CAAC,EAAE,IAAI,SAAUkxB,EAAG7pC,EAAG,CAC9F,OAAOu1C,EAAe5/B,EAAI3V,CAAC,EAAGomD,EAAMztC,EAAI,EAAI3Y,CAAC,CAAC,CAC/C,CAAA,CAAC,KAAO+wC,GAAoB,SAAY,IAAI,MAAMsV,EAAK1tC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAC/D4tC,EAAS,CAAA,EAAG,UAAWxV,GAAoB,SAAY,IAAI,MAAMp4B,EAAIA,EAAI,CAAC,EAAE,KAAK,CAAC,EAAE,IAAI,SAAUkxB,EAAG7pC,EAAG,CAC1G,OAAO6lD,EAAa,EAAGO,EAAMpmD,CAAC,CAAC,CACrC,CAAK,CAAC,KAAO+wC,GAAoB,SAAY,IAAI,MAAMsV,GAAM1tC,EAAIA,EAAI,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,EACzE6tC,EAAQR,EAAKM,CAAE,EACfG,EAAYT,EAAKO,CAAM,EACvBG,EAAa,IAAI,MAAML,CAAE,EAAE,KAAK,CAAC,EAAE,IAAI,SAAUxc,EAAG7pC,EAAG,CACzD,OAAOu1C,EAAeiR,EAAMxmD,CAAC,EAAGymD,EAAUzmD,CAAC,CAAC,CAClD,CAAK,EACG2mD,EAAcb,EAAU1J,EAAK2J,EAAO3J,EAAKsK,CAAU,CAAC,CAAC,EAAGL,CAAE,EAC1DvrB,EAAM,CAAA,EACD/V,EAAKpM,EAAI,EAAGoM,EAAKpM,EAAIA,EAAI,EAAGoM,IACnC+V,EAAI,KAAKya,EAAeoR,EAAY5hC,CAAE,EAAGqhC,EAAMrhC,CAAE,CAAC,CAAC,EAErD,OAAO+V,CACR,CAOD,SAASkrB,EAAKrwC,EAAK,CACjB,IAAI3Q,EAAM2Q,EAAI,OACd,GAAI3Q,IAAQ,EAAG,MAAO,CAAC2Q,EAAI,CAAC,CAAC,EAC7B,GAAI3Q,EAAM,IAAM,EAAG,CAMjB,QALI81B,EAAM,CAAA,EAAG,UAAWiW,GAAoB,SAAYiV,EAAKrwC,EAAI,OAAO,SAAUk0B,EAAG7pC,EAAG,CACtF,OAAOA,EAAI,IAAM,CAClB,CAAA,CAAU,CAAC,KAAO+wC,GAAoB,SAAYiV,EAAKrwC,EAAI,OAAO,SAAUk0B,EAAG7pC,EAAG,CACjF,OAAOA,EAAI,IAAM,CACzB,CAAO,CAAU,CAAC,CAAC,EACJyoB,EAAI,EAAGA,EAAIzjB,EAAM,EAAGyjB,IAAK,CAChC,IAAI9d,EAAImwB,EAAIrS,CAAC,EACT8C,EAAIgqB,EAAeza,EAAIrS,EAAIzjB,EAAM,CAAC,EAAGwW,EAAI+5B,EAAeA,EAAe/V,EAAK5E,CAAC,EAAGirB,EAAa,CAACp9B,EAAGzjB,CAAG,CAAC,CAAC,CAAC,EAC3G81B,EAAIrS,CAAC,EAAIwiB,EAAUtgC,EAAG4gB,CAAC,EACvBuP,EAAIrS,EAAIzjB,EAAM,CAAC,EAAIimC,EAAUtgC,EAAG4qC,EAAe,GAAIhqB,CAAC,CAAC,CACtD,CACD,OAAOuP,CACb,KAEM,QAAOqrB,EAAKxwC,CAAG,CAGlB,CACH,CAAC,EACDgwC,GAAA,UAAoBC,aCtJpB,OAAO,eAAegB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI7lC,GAASxgB,GACTglB,GAAWriB,EACXsB,GAAMC,GACNsC,GAAO,OACPia,GAAe,CAAC,QAAS,MAAO,YAAa,MAAM,EACnD6lC,MAAgCthC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACf+/B,EAAM//B,EAAK,IACXkgC,EAAYlgC,EAAK,UACjBw2B,EAAOx2B,EAAK,KAmBd,OAAO3d,EAAMlB,GAAM,CACjB,iBAAkB,SAAqB4O,EAAK,CAC1C,IAAIkD,KAAWrU,GAAI,UAAUmR,CAAG,EAAIA,EAAI,KAAM,KAAOoL,GAAO,WAAWpL,CAAG,EAC1E,OAAOmwC,EAAU1J,EAAKuJ,EAAIvJ,EAAKzmC,CAAG,CAAC,CAAC,EAAGkD,EAAK,OAAO,SAAUiuC,EAAKpgD,EAAM,CACtE,OAAOogD,EAAMpgD,CACrB,EAAS,CAAC,CAAC,CACN,CACL,CAAG,CACH,CAAC,EACDkgD,GAAA,WAAqBC,aCzCrB,OAAO,eAAeE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAI5qB,GAAc57B,GACd6a,GAAUlY,GACVqiB,GAAW9gB,EAGXsC,GAAO,MACPia,GAAe,CAAC,OAAO,EACvBgmC,MAA+BzhC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MAyBjB,OAAO3d,EAAM,OAAQ,CACnB,OAAQ,SAAgB9E,EAAG,CACzB,IAAIqX,EAAI,KAAK,IAAIrX,CAAC,EAClB,OAAIqX,GAAKysC,MACI7rC,GAAQ,MAAMjY,CAAC,EAExBqX,GAAK0sC,MACI9rC,GAAQ,MAAMjY,CAAC,EAAIgkD,EAAK3sC,CAAC,EAElCA,GAAK,KACIY,GAAQ,MAAMjY,CAAC,GAAK,EAAIikD,EAAM5sC,CAAC,MAEjCY,GAAQ,MAAMjY,CAAC,GAAK,EAAIkkD,EAAM7sC,CAAC,EAC3C,EACD,iBAAkBvS,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUwG,EAAG,CAClB,SAAWwjB,GAAY,SAASxjB,EAAGxG,CAAI,CAC/C,CACA,CAAK,CAIL,CAAG,EAQD,SAASg1C,EAAK3sC,EAAG,CACf,IAAI8sC,EAAM9sC,EAAIA,EACV+sC,EAAO50B,GAAE,CAAC,EAAE,CAAC,EAAI20B,EACjBE,EAAOF,EACPtnD,EACJ,IAAKA,EAAI,EAAGA,EAAI,EAAGA,GAAK,EACtBunD,GAAQA,EAAO50B,GAAE,CAAC,EAAE3yB,CAAC,GAAKsnD,EAC1BE,GAAQA,EAAOC,GAAE,CAAC,EAAEznD,CAAC,GAAKsnD,EAE5B,OAAO9sC,GAAK+sC,EAAO50B,GAAE,CAAC,EAAE,CAAC,IAAM60B,EAAOC,GAAE,CAAC,EAAE,CAAC,EAC7C,CASD,SAASL,EAAM5sC,EAAG,CAChB,IAAI+sC,EAAO50B,GAAE,CAAC,EAAE,CAAC,EAAInY,EACjBgtC,EAAOhtC,EACPxa,EACJ,IAAKA,EAAI,EAAGA,EAAI,EAAGA,GAAK,EACtBunD,GAAQA,EAAO50B,GAAE,CAAC,EAAE3yB,CAAC,GAAKwa,EAC1BgtC,GAAQA,EAAOC,GAAE,CAAC,EAAEznD,CAAC,GAAKwa,EAE5B,IAAIhC,GAAU+uC,EAAO50B,GAAE,CAAC,EAAE,CAAC,IAAM60B,EAAOC,GAAE,CAAC,EAAE,CAAC,GAC1CH,EAAM,SAAS9sC,EAAI,EAAE,EAAI,GACzB6c,GAAO7c,EAAI8sC,IAAQ9sC,EAAI8sC,GAC3B,OAAO,KAAK,IAAI,CAACA,EAAMA,CAAG,EAAI,KAAK,IAAI,CAACjwB,CAAG,EAAI7e,CAChD,CAWD,SAAS6uC,EAAM7sC,EAAG,CAChB,IAAI8sC,EAAM,GAAK9sC,EAAIA,GACf+sC,EAAO50B,GAAE,CAAC,EAAE,CAAC,EAAI20B,EACjBE,EAAOF,EACPtnD,EACJ,IAAKA,EAAI,EAAGA,EAAI,EAAGA,GAAK,EACtBunD,GAAQA,EAAO50B,GAAE,CAAC,EAAE3yB,CAAC,GAAKsnD,EAC1BE,GAAQA,EAAOC,GAAE,CAAC,EAAEznD,CAAC,GAAKsnD,EAE5B,IAAI9uC,EAAS8uC,GAAOC,EAAO50B,GAAE,CAAC,EAAE,CAAC,IAAM60B,EAAOC,GAAE,CAAC,EAAE,CAAC,GACpDjvC,GAAUkvC,GAAQlvC,GAAUgC,EAC5B8sC,EAAM,SAAS9sC,EAAI,EAAE,EAAI,GACzB,IAAI6c,GAAO7c,EAAI8sC,IAAQ9sC,EAAI8sC,GAC3B,OAAO,KAAK,IAAI,CAACA,EAAMA,CAAG,EAAI,KAAK,IAAI,CAACjwB,CAAG,EAAI7e,CAChD,CACH,CAAC,EAMgBuuC,GAAA,UAAGC,GACpB,IAAIE,GAAS,OAMTQ,GAAQ,kBAOR/0B,GAAI,CAAC,CAAC,mBAAwB,mBAAwB,iBAAwB,mBAAwB,kBAAsB,EAAG,CAAC,kBAAwB,kBAAwB,kBAAwB,kBAAwB,iBAAwB,mBAAwB,mBAAwB,mBAAwB,qBAAsB,EAAG,CAAC,mBAAwB,mBAAwB,mBAAwB,oBAAwB,qBAAwB,mBAAsB,CAAC,EAOze80B,GAAI,CAAC,CAAC,mBAAwB,mBAAwB,mBAAwB,iBAAsB,EAAG,CAAC,mBAAwB,kBAAwB,kBAAwB,mBAAwB,mBAAwB,kBAAwB,mBAAwB,kBAAsB,EAAG,CAAC,kBAAwB,mBAAwB,kBAAwB,mBAAwB,oBAAsB,CAAC,EAOjaR,GAAU,KAAK,IAAI,EAAG,EAAE,QC9J5B,OAAO,eAAeU,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI5mC,GAASxgB,GACTglB,GAAWriB,EACX6D,GAAO,OACPia,GAAe,CAAC,QAAS,QAAS,WAAW,EAC7C4mC,MAAgCriC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACfiiC,EAAQjiC,EAAK,MACb4d,EAAY5d,EAAK,UA0BnB,OAAO3d,EAAMlB,GAAM,CACjB,iBAAkB+gD,EAClB,MAAO,SAAWt7C,EAAM,CACtB,OAAOs7C,EAAMt7C,CAAI,CAClB,CACL,CAAG,EAQD,SAASs7C,EAAMvjD,EAAQ,CACrBA,KAAawc,GAAO,SAASxc,EAAO,QAAS,CAAA,EAC7C,IAAIwmB,EAAMxmB,EAAO,OACjB,GAAIwmB,IAAQ,EACV,MAAM,IAAI,MAAM,yCAAyC,EAK3D,QAHIxK,EAAQ,CAAA,EACRonC,EAAO,CAAA,EACP5qC,EAAM,EACD/c,EAAI,EAAGA,EAAIuE,EAAO,OAAQvE,IAAK,CACtC,IAAI2E,EAAQJ,EAAOvE,CAAC,EACpB,GAAIwjC,EAAU7+B,CAAK,GAAKkjD,EAAMljD,CAAK,EACjC,MAAM,IAAI,MAAM,yDAAyD,EAErEA,KAAS4b,IACbA,EAAM5b,CAAK,EAAI,GAEjB4b,EAAM5b,CAAK,IACP4b,EAAM5b,CAAK,IAAMoY,EACnB4qC,EAAK,KAAKhjD,CAAK,EACN4b,EAAM5b,CAAK,EAAIoY,IACxBA,EAAMwD,EAAM5b,CAAK,EACjBgjD,EAAO,CAAChjD,CAAK,EAEhB,CACD,OAAOgjD,CACR,CACH,CAAC,EACDA,GAAA,WAAqBC,mBC9ErB,OAAO,eAAeG,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAGC,GAC9B,IAAIxjD,GAAMjE,GAWV,SAASynD,GAAoB/6C,EAAKg7C,EAAQtjD,EAAO,CAE/C,IAAIujD,EACJ,OAAI,OAAOj7C,CAAG,EAAE,QAAQ,iBAAiB,IAAM,IAC7Ci7C,EAAU,UAAU,OAAS,EAAI,cAAiB1jD,GAAI,QAAQG,CAAK,EAAI,YAAc,KAAK,UAAUA,CAAK,EAAI,IAAM,WAAasI,EAAI,KAAK,OAAS,IAC3I,IAAI,UAAU,oBAAsBg7C,EAAS,gCAAkCC,CAAO,GAE3F,OAAOj7C,CAAG,EAAE,QAAQ,iBAAiB,IAAM,IAC7Ci7C,EAAU,UAAU,OAAS,EAAI,cAAiB1jD,GAAI,QAAQG,CAAK,EAAI,YAAc,KAAK,UAAUA,CAAK,EAAI,IAAM,GAC5G,IAAI,UAAU,oBAAsBsjD,EAAS,wDAA0DC,CAAO,GAEhHj7C,CACT,CC3BA,OAAO,eAAe+gB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAImO,GAAc57B,GACdglB,GAAWriB,EACXilD,GAAuB1jD,GACvBsC,GAAO,OACPia,GAAe,CAAC,QAAS,SAAU,iBAAkB,SAAS,EAC9DonC,MAAgC7iC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACd2vB,EAAiB3vB,EAAK,eACtByiC,EAAUziC,EAAK,QA0BjB,OAAO3d,EAAMlB,GAAM,CAEjB,iBAAkBuhD,EAElB,qCAAsC,SAAoCzhD,EAAOwX,EAAK,CAEpF,MAAM,IAAI,MAAM,mCAAmC,CAEpD,EAGD,MAAO,SAAW7R,EAAM,CACtB,OAAO87C,EAAM97C,CAAI,CAClB,CACL,CAAG,EAQD,SAAS87C,EAAMzhD,EAAO,CACpB,IAAImnB,EAaJ,MAZImO,GAAY,aAAat1B,EAAO,SAAUlC,EAAO,CACnD,GAAI,CACFqpB,EAAOA,IAAS,OAAYrpB,EAAQ4wC,EAAevnB,EAAMrpB,CAAK,CAC/D,OAAQsI,EAAK,CACZ,QAAUk7C,GAAqB,qBAAqBl7C,EAAK,OAAQtI,CAAK,CACvE,CACP,CAAK,EAGG,OAAOqpB,GAAS,WAClBA,EAAOq6B,EAAQr6B,EAAM7tB,EAAO,MAAM,GAEhC6tB,IAAS,OACX,MAAM,IAAI,MAAM,yCAAyC,EAE3D,OAAOA,CACR,CACH,CAAC,EACDA,GAAA,WAAqBo6B,aCjFrB,OAAO,eAAe3wC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAIwG,GAAU1d,GACVglB,GAAWriB,EACX6D,GAAO,SACPia,GAAe,CAAC,OAAO,EACvBunC,MAAkChjC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC1F,IAAI3d,EAAQ2d,EAAK,MAuHjB,OAAO3d,EAAMlB,GAAM,CACjB,IAAKkX,GAAQ,OACb,kCAAmCA,GAAQ,MAC/C,CAAG,CACH,CAAC,EACDxG,GAAA,aAAuB8wC,aCrIvB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIjjC,GAAWhlB,EACXwG,GAAO,MACPia,GAAe,CAAC,QAAS,QAAQ,EAuBjCynC,MAAgBljC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACxE,IAAI3d,EAAQ2d,EAAK,MACfnO,EAASmO,EAAK,OAChB,OAAO3d,EAAMlB,GAAM,CACjB,qBAAsB,SAAyB4R,EAAG,CAChD,OAAOlB,EAAOkB,EAAG,CACf,SAAU,KAClB,CAAO,CACF,EACD,6BAA8B,SAA+BA,EAAGQ,EAAU,CACxE,OAAO1B,EAAOkB,EAAG,CACf,SAAU,MACV,SAAUQ,CAClB,CAAO,CACF,CACL,CAAG,CACH,CAAC,EACDqvC,GAAA,UAAoBC,aC9CpB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAInjC,GAAWhlB,EACXwG,GAAO,MACPia,GAAe,CAAC,QAAS,QAAQ,EAwBjC2nC,MAAgBpjC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACxE,IAAI3d,EAAQ2d,EAAK,MACfnO,EAASmO,EAAK,OAChB,OAAO3d,EAAMlB,GAAM,CACjB,qBAAsB,SAAyB4R,EAAG,CAChD,OAAOlB,EAAOkB,EAAG,CACf,SAAU,KAClB,CAAO,CACF,EACD,6BAA8B,SAA+BA,EAAGQ,EAAU,CACxE,OAAO1B,EAAOkB,EAAG,CACf,SAAU,MACV,SAAUQ,CAClB,CAAO,CACF,CACL,CAAG,CACH,CAAC,EACDuvC,GAAA,UAAoBC,aC/CpB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIrjC,GAAWhlB,EACXwG,GAAO,MACPia,GAAe,CAAC,QAAS,QAAQ,EAsBjC6nC,MAAgBtjC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACxE,IAAI3d,EAAQ2d,EAAK,MACfnO,EAASmO,EAAK,OAChB,OAAO3d,EAAMlB,GAAM,CACjB,qBAAsB,SAAyB4R,EAAG,CAChD,OAAOlB,EAAOkB,EAAG,CACf,SAAU,KAClB,CAAO,CACF,EACD,6BAA8B,SAA+BA,EAAGQ,EAAU,CACxE,OAAO1B,EAAOkB,EAAG,CACf,SAAU,MACV,SAAUQ,CAClB,CAAO,CACF,CACL,CAAG,CACH,CAAC,EACDyvC,GAAA,UAAoBC,aC7CpB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAI7qC,GAAU1d,GACViE,GAAMtB,GACNqiB,GAAW9gB,EACXsC,GAAO,QACPia,GAAe,CAAC,OAAO,EACvB+nC,MAAiCxjC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MA6CjB,OAAO3d,EAAMlB,GAAM,CAEjB,yBAA0BiiD,GAC1B,0CAA2CA,EAC/C,CAAG,CACH,CAAC,EAUkBF,GAAA,YAAGC,GACtB,SAASC,GAAOC,EAAU1kD,EAAQgC,EAAS,CACzC,OAAO0iD,EAAS,QAAQ,cAAe,SAAUC,EAAUhpD,EAAK,CAG9D,QAFIipD,EAAOjpD,EAAI,MAAM,GAAG,EACpByE,EAAQJ,EAAO4kD,EAAK,MAAO,CAAA,EACxBA,EAAK,QAAUxkD,IAAU,QAAW,CACzC,IAAI8jB,EAAI0gC,EAAK,QACbxkD,EAAQ8jB,EAAI9jB,EAAM8jB,CAAC,EAAI9jB,EAAQ,GAChC,CACD,OAAIA,IAAU,UACHH,GAAI,UAAUG,CAAK,EAGnBA,KAFIsZ,GAAQ,QAAQtZ,EAAO4B,CAAO,EAKtC2iD,CACX,CAAG,CACH,WCxFA,OAAO,eAAenyC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAIwO,GAAWhlB,EACX2yC,GAAwBhwC,GACxB6D,GAAO,KACPia,GAAe,CAAC,QAAS,SAAU,QAAQ,EAC3CooC,MAA8B7jC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACtF,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdsrB,EAAStrB,EAAK,OACZssB,KAA2BgB,GAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EA0BD,OAAOjpC,EAAMlB,GAAM,CACjB,sBAAuB,SAAwB5D,EAAGylC,EAAM,CACtD,OAAOzlC,EAAE,GAAGylC,CAAI,CACjB,CACF,EAAEsJ,EAAqB,CACtB,GAAI,EACL,CAAA,CAAC,CACJ,CAAC,EACDn7B,GAAA,SAAmBqyC,aClDnB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAIltB,GAAc57B,GACdglB,GAAWriB,EACX6D,GAAO,UACPia,GAAe,CAAC,OAAO,EACvBsoC,MAAmC/jC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC3F,IAAI3d,EAAQ2d,EAAK,MA6BjB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,SAAgB5D,EAAG,CACzB,GAAIA,EAAI,IAAM,EACZ,MAAO,GAET,GAAIA,GAAK,EACP,OAAOA,EAAI,EAEb,GAAIA,EAAI,IAAM,GAAKA,EAAI,IAAM,EAC3B,MAAO,GAET,QAASnD,EAAI,EAAGA,EAAIA,GAAKmD,EAAGnD,GAAK,EAC/B,GAAImD,EAAInD,IAAM,GAAKmD,GAAKnD,EAAI,KAAO,EACjC,MAAO,GAGX,MAAO,EACR,EACD,UAAW,SAAmB2Y,EAAG,CAC/B,GAAIA,EAAE,WAAa,IAAM,EACvB,MAAO,GAET,GAAIA,EAAE,IAAI,CAAC,EAAG,OAAOA,EAAE,GAAG,CAAC,EAC3B,GAAIA,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,GAAKA,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,EAAG,MAAO,GAC7C,GAAIA,EAAE,GAAG,KAAK,IAAI,EAAG,EAAE,CAAC,EAAG,CAEzB,QADIxV,EAAIwV,EAAE,WACD,EAAI,EAAG,EAAI,GAAKxV,EAAG,GAAK,EAC/B,GAAIA,EAAI,IAAM,GAAKA,GAAK,EAAI,KAAO,EACjC,MAAO,GAGX,MAAO,EACR,CACD,SAASomD,EAAO3wC,EAAMS,EAAUmwC,EAAS,CAGvC,QADIC,EAAc,EACX,CAACpwC,EAAS,GAAG,CAAC,GACfA,EAAS,IAAI,CAAC,EAAE,GAAG,CAAC,GACtBA,EAAWA,EAAS,IAAI,CAAC,EACzBT,EAAOA,EAAK,IAAIA,CAAI,EAAE,IAAI4wC,CAAO,IAEjCnwC,EAAWA,EAAS,IAAI,CAAC,EACzBowC,EAAc7wC,EAAK,IAAI6wC,CAAW,EAAE,IAAID,CAAO,GAGnD,OAAOC,CACR,CAGD,IAAItiC,EAAUxO,EAAE,YAAY,MAAM,CAChC,UAAWA,EAAE,QAAQ,CAAC,EAAE,OAAS,CACzC,CAAO,EACDA,EAAI,IAAIwO,EAAQxO,CAAC,EAGjB,QAFIsJ,EAAI,EACJ9B,EAAIxH,EAAE,IAAI,CAAC,EACRwH,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,GAClBA,EAAIA,EAAE,IAAI,CAAC,EACX8B,GAAK,EAEP,IAAIynC,EAAQ,KAEZ,GAAI/wC,EAAE,GAAG,2BAA2B,EAClC+wC,EAAQ,CAAC,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAE,EAAE,OAAO,SAAUvmD,EAAG,CAC3E,OAAOA,EAAIwV,CACrB,CAAS,MACI,CACL,IAAIoE,EAAM,KAAK,IAAIpE,EAAE,WAAa,EAAG,KAAK,MAAM,EAAI,KAAK,IAAIA,EAAE,QAAQ,CAAC,EAAE,OAAS,KAAK,IAAI,EAAE,EAAG,CAAC,CAAC,CAAC,EACpG+wC,EAAQ,CAAA,EACR,QAAS3kC,EAAK,EAAGA,GAAMhI,EAAKgI,GAAM,EAChC2kC,EAAM,KAAK3sC,CAAG,CAEjB,CACD,QAASoI,EAAM,EAAGA,EAAMukC,EAAM,OAAQvkC,GAAO,EAAG,CAC9C,IAAItgB,EAAI6kD,EAAMvkC,CAAG,EACbwkC,EAAMJ,EAAO5wC,EAAE,IAAIA,CAAC,EAAE,IAAI9T,CAAC,EAAGsb,EAAGxH,CAAC,EACtC,GAAI,CAACgxC,EAAI,GAAG,CAAC,GACX,QAAS9iB,EAAM,EAAG+iB,EAAKD,EAAK,CAACC,EAAG,GAAGjxC,EAAE,IAAI,CAAC,CAAC,EAAGkuB,GAAO,EAAG+iB,EAAKA,EAAG,IAAIA,CAAE,EAAE,IAAIjxC,CAAC,EAC3E,GAAIkuB,IAAQ5kB,EAAI,EACd,MAAO,GAId,CACD,MAAO,EACR,EACD,iBAAkBha,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,CAAI,CAC/C,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACDk3C,GAAA,cAAwBC,aClIxB,OAAO,eAAejB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAI7jD,GAAMjE,GACNglB,GAAWriB,EACX89C,GAAQv8C,GACRsC,GAAO,UACPia,GAAe,CAAC,SAAU,aAAc,WAAW,EACnD6oC,MAAmCtkC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC3F,IAAIxK,EAAUwK,EAAK,OACjBsjB,EAAYtjB,EAAK,UACjB2jB,EAAW3jB,EAAK,SACdkkC,EAAkB,CACpB,OAAQ,GACR,OAAQ,GACR,UAAW,GACX,SAAU,EACd,EAGMC,EAAmB,CACrB,OAAQ,SAAgB5mD,EAAG,CACzB,OAAOiY,EAAQjY,CAAC,CACjB,EACD,UAAW+lC,EAAY,SAAU/lC,EAAG,CAClC,OAAO+lC,EAAU/lC,CAAC,CACnB,EAAG69C,GAAM,YACV,SAAUzX,EAAW,SAAUpmC,EAAG,CAChC,OAAOomC,EAASpmC,CAAC,CAClB,EAAG69C,GAAM,UACd,EA8BE,OAAO,SAAiBr8C,EAAO,CAC7B,IAAIqlD,EAAa,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,SACjFC,EAAQ,UAAU,OAAS,EAAI,UAAU,CAAC,EAAI,OAClD,GAAIA,IAAU,OACZ,MAAM,IAAI,YAAY,sCAAsC,EAE9D,IAAIC,KAAgB1lD,GAAI,QAAQG,CAAK,EACrC,GAAI,EAAEulD,KAAaJ,GACjB,MAAM,IAAI,UAAU,kBAAoBnlD,EAAQ,aAAeulD,EAAY,4BAA8B,OAAO,KAAKJ,CAAe,EAAE,KAAK,IAAI,CAAC,EAElJ,GAAI,EAAEE,KAAcD,GAClB,MAAM,IAAI,UAAU,kBAAoBplD,EAAQ,aAAeqlD,EAAa,6BAA+B,OAAO,KAAKD,CAAgB,EAAE,KAAK,IAAI,CAAC,EAErJ,OAAIC,IAAeE,EACVvlD,EAEAolD,EAAiBC,CAAU,EAAErlD,CAAK,CAE/C,CACA,CAAC,EACD0jD,GAAA,cAAwBwB,aCjFxB,OAAO,eAAehE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAItgC,GAAWhlB,EACXwG,GAAO,eACPia,GAAe,CAAC,QAAS,SAAS,EAClCmpC,MAAwC5kC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC5F,IAAA3d,EAAQ2d,EAAK,MACL,OAAAA,EAAK,QAaV3d,EAAMlB,GAAM,CACjB,iBAAkB,SAAsB5D,EAAGqX,EAAG,CAC5C,OAAOrX,EAAIqX,CACZ,EACD,mBAAoB,SAAwBrX,EAAGqX,EAAG,CAChD,OAAOrX,EAAE,IAAIqX,CAAC,CACf,EACD,uBAAwB,SAA4BrX,EAAGqX,EAAG,CACxD,OAAOrX,EAAE,IAAIqX,CAAC,CACf,EACD,qBAAsB,SAA0BrX,EAAGqX,EAAG,CACpD,OAAOrX,EAAE,IAAIqX,CAAC,CACf,EACD,uDAAwD,SAAgDrX,EAAGqX,EAAG,CAC5G,OAAOrX,EAAE,OAAOqX,CAAC,CAClB,EACD,gDAAiD,SAA4CrX,EAAGqX,EAAG,CACjG,OAAOA,EAAE,WAAWrX,CAAC,CACtB,CACL,CAAG,CACH,CAAC,EACD0iD,GAAA,mBAA6BsE,aC3C7B,OAAO,eAAe76B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAI/J,GAAWhlB,EACX6a,GAAUlY,GACV6d,GAAStc,GACT6+B,GAASp8B,GACTH,GAAO,MACPia,GAAe,CAAC,QAAS,SAAU,WAAY,WAAY,SAAU,MAAO,WAAY,SAAU,SAAS,EAC3GopC,MAA+B7kC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdk5B,EAAWl5B,EAAK,SAChB6vB,EAAW7vB,EAAK,SAChBU,EAASV,EAAK,OACdqY,EAAMrY,EAAK,IACXtO,EAASsO,EAAK,OACd2jB,EAAW3jB,EAAK,SAChBE,EAAUF,EAAK,QAuCjB,OAAO3d,EAAMlB,GAAM,CACjB,iBAAkBsjD,EAClB,mBAAoB,SAAwBlnD,EAAGqX,EAAG,CAChD,OAAOrX,EAAE,IAAIqX,CAAC,CACf,EACD,uBAAwB,SAA4BrX,EAAGqX,EAAG,CACxD,OAAIA,EAAE,UAAW,GAAIrX,GAAK,GAAKhD,EAAO,YAC7BgD,EAAE,IAAIqX,CAAC,EAEP,IAAIsL,EAAQ3iB,EAAE,WAAY,CAAC,EAAE,IAAIqX,EAAE,SAAU,EAAE,CAAC,CAE1D,EACD,qBAAsB,SAA0BrX,EAAGqX,EAAG,CACpD,IAAIhC,EAASrV,EAAE,IAAIqX,CAAC,EACpB,GAAIhC,GAAU,KACZ,OAAOA,EAET,GAAIrY,EAAO,YACT,MAAM,IAAI,MAAM,qEAAqE,EAErF,OAAOkqD,EAAKlnD,EAAE,QAAS,EAAEqX,EAAE,QAAO,CAAE,CAEvC,EACD,gBAAiB8vC,EACjB,mBAAoB,SAAwBnnD,EAAGqX,EAAG,CAChD,OAAO8vC,EAAUnnD,EAAGqX,EAAE,SAAU,CAAA,CACjC,EACD,iBAAkB+vC,EAClB,oBAAqB,SAAyBpnD,EAAGqX,EAAG,CAClD,OAAO+vC,EAAWpnD,EAAGqX,EAAE,SAAU,CAAA,CAClC,EACD,2BAA4B,SAA6BrX,EAAGqX,EAAG,CAC7D,OAAOrX,EAAE,IAAIqX,CAAC,CACf,CACL,CAAG,EASD,SAAS6vC,EAAKlnD,EAAGqX,EAAG,CAGlB,GAAIra,EAAO,aAAe,IAAKib,GAAQ,WAAWZ,CAAC,GAAKrX,EAAI,EAE1D,GAAI,CACF,IAAIqnD,EAAQjhB,EAAS/uB,CAAC,EAClBiwC,EAAOnzC,EAAOkzC,CAAK,EACvB,IAAIhwC,IAAMiwC,GAAQ,KAAK,KAAKjwC,EAAIiwC,GAAQjwC,CAAC,EAAI,QACvCgwC,EAAM,EAAI,IAAM,EAClB,OAAQA,EAAM,EAAI,IAAM,EAAI,EAAI,IAAM,KAAK,IAAI,CAACrnD,EAAGqX,CAAC,CAGzD,MAAY,CAEZ,CAQH,OAAIra,EAAO,cAAgBgD,EAAI,IAAMqX,IAAM,KAAYrX,EAAI,IAAMA,EAAI,GAAKqX,IAAM,MACvE,OAEDY,GAAQ,WAAWZ,CAAC,GAAKrX,GAAK,GAAKhD,EAAO,eACrCmjC,GAAO,WAAWngC,EAAGqX,CAAC,EAM7BrX,EAAIA,EAAI,GAAKqX,IAAM,KAAYrX,EAAIA,EAAI,GAAKqX,IAAM,KAC7C,EAEF,IAAIsL,EAAQ3iB,EAAG,CAAC,EAAE,IAAIqX,EAAG,CAAC,CAEpC,CASD,SAAS8vC,EAAUnnD,EAAGqX,EAAG,CACvB,GAAI,IAAKY,GAAQ,WAAWZ,CAAC,EAC3B,MAAM,IAAI,UAAU,2CAA6CA,EAAI,GAAG,EAG1E,IAAIxP,KAAQ+V,GAAO,WAAW5d,CAAC,EAC/B,GAAI6H,EAAE,SAAW,EACf,MAAM,IAAI,MAAM,2CAA6CA,EAAE,OAAS,cAAc,EAExF,GAAIA,EAAE,CAAC,IAAMA,EAAE,CAAC,EACd,MAAM,IAAI,MAAM,sCAAwCA,EAAE,CAAC,EAAI,IAAMA,EAAE,CAAC,EAAI,GAAG,EAEjF,GAAIwP,EAAI,EACN,GAAI,CACF,OAAO8vC,EAAUrsB,EAAI96B,CAAC,EAAG,CAACqX,CAAC,CAC5B,OAAQkwC,EAAO,CACd,MAAIA,EAAM,UAAY,gDACd,IAAI,UAAU,6EAA+ElwC,EAAI,GAAG,EAEtGkwC,CACP,CAIH,QAFIn2B,EAAMuqB,EAAS9zC,EAAE,CAAC,CAAC,EAAE,UACrB0f,EAAKvnB,EACFqX,GAAK,IACLA,EAAI,KAAO,IACd+Z,EAAMkhB,EAAS/qB,EAAI6J,CAAG,GAExB/Z,IAAM,EACNkQ,EAAK+qB,EAAS/qB,EAAIA,CAAE,EAEtB,OAAO6J,CACR,CASD,SAASg2B,EAAWpnD,EAAGqX,EAAG,CACxB,OAAO8L,EAAOgkC,EAAUnnD,EAAE,QAAS,EAAEqX,CAAC,CAAC,CACxC,CACH,CAAC,EACD8U,GAAA,UAAoB86B,aCjMpB,OAAO,eAAe34B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIlM,GAAWhlB,EACX47B,GAAcj5B,GACduqC,GAAiBhpC,GACjBipC,GAAiBxmC,GACjBymC,GAAgB1xB,GAChBqnB,GAAS7d,GACTklC,GAAS,0DACT5jD,GAAO,QACPia,GAAe,CAAC,QAAS,SAAU,cAAe,QAAS,YAAa,aAAa,EACrF4pC,MAAiCrlC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACd4e,EAAc5e,EAAK,YACnBpM,EAAQoM,EAAK,MACbC,EAAYD,EAAK,UACjBG,EAAcH,EAAK,YACjBymB,KAAoBoB,GAAe,qBAAqB,CAC1D,MAAOxlC,EACP,YAAau8B,CACjB,CAAG,EACGqI,KAAoBa,GAAe,qBAAqB,CAC1D,MAAOzlC,EACP,YAAa8d,CACjB,CAAG,EACGinB,KAAmBW,GAAc,oBAAoB,CACvD,MAAO1lC,CACX,CAAG,EAqCD,OAAOA,EAAMlB,GAAM,CACjB,OAAQu8B,GAAO,YACf,iBAAkBA,GAAO,YACzB,oBAAqB,SAAyBngC,EAAGwV,EAAG,CAClD,GAAI,CAACA,EAAE,YACL,MAAM,IAAI,UAAUgyC,EAAM,EAE5B,OAAO,IAAI9kC,EAAU1iB,CAAC,EAAE,gBAAgBwV,EAAE,SAAQ,CAAE,CACrD,EACD,QAAS,SAAiBxV,EAAG,CAC3B,OAAOA,EAAE,OACV,EACD,kBAAmB,SAAuBA,EAAGwV,EAAG,CAC9C,GAAIA,EAAI,EACN,MAAM,IAAI,UAAUgyC,EAAM,EAE5B,OAAOxnD,EAAE,MAAMwV,CAAC,CACjB,EACD,qBAAsB,SAA0BxV,EAAGwV,EAAG,CACpD,GAAI,CAACA,EAAE,YACL,MAAM,IAAI,UAAUgyC,EAAM,EAE5B,IAAIE,EAAKlyC,EAAE,WACX,OAAOxV,EAAE,MAAM0nD,CAAE,CAClB,EACD,UAAW,SAAmB1nD,EAAG,CAC/B,OAAOA,EAAE,gBAAgB,CAAC,CAC3B,EACD,uBAAwB,SAA4BA,EAAGwV,EAAG,CACxD,GAAI,CAACA,EAAE,YACL,MAAM,IAAI,UAAUgyC,EAAM,EAE5B,OAAOxnD,EAAE,gBAAgBwV,EAAE,SAAU,CAAA,CACtC,EACD,SAAU,SAAkBxV,EAAG,CAC7B,OAAOA,EAAE,OACV,EACD,mBAAoB,SAAwBA,EAAGwV,EAAG,CAChD,GAAIA,EAAI,EACN,MAAM,IAAI,UAAUgyC,EAAM,EAE5B,OAAOxnD,EAAE,MAAMwV,CAAC,CACjB,EACD,sBAAuB,SAA2BxV,EAAGwV,EAAG,CACtD,GAAI,CAACA,EAAE,YACL,MAAM,IAAI,UAAUgyC,EAAM,EAE5B,OAAOxnD,EAAE,MAAMwV,EAAE,SAAU,CAAA,CAC5B,EAED,iBAAkB1Q,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,EAAM,EAAI,CACrD,CACA,CAAK,EACD,mCAAoClK,EAAM,YAAY,SAAUkK,EAAM,CACpE,OAAO,SAAUhP,EAAGqX,EAAG,CACrB,OAAO6xB,EAAclpC,EAAGqX,EAAGrI,EAAM,EAAK,CAC9C,CACA,CAAK,EACD,kCAAmClK,EAAM,YAAY,SAAUkK,EAAM,CACnE,OAAO,SAAUhP,EAAGqX,EAAG,CACrB,OAAOwyB,EAAa7pC,EAAGqX,EAAGrI,EAAM,EAAK,CAC7C,CACA,CAAK,EACD,4BAA6BlK,EAAM,YAAY,SAAUkK,EAAM,CAC7D,OAAO,SAAUhP,EAAGqX,EAAG,CAErB,OAAOwyB,EAAa1mB,EAAOnjB,CAAC,EAAGqX,EAAGrI,EAAM,EAAK,EAAE,SACvD,CACA,CAAK,EACD,wDAAyDlK,EAAM,YAAY,SAAUkK,EAAM,CACzF,OAAO,SAAUhP,EAAGqX,EAAG,CAErB,OAAIgqB,EAAYrhC,EAAG,CAAC,EAEXqW,EAAMgB,EAAE,KAAM,EAAEA,EAAE,QAAO,CAAE,EAE7BqyB,EAAcryB,EAAGrX,EAAGgP,EAAM,EAAI,CAC7C,CACA,CAAK,EACD,uDAAwDlK,EAAM,YAAY,SAAUkK,EAAM,CACxF,OAAO,SAAUhP,EAAGqX,EAAG,CAErB,OAAIgqB,EAAYrhC,EAAG,CAAC,EAEXqW,EAAMgB,EAAE,KAAM,EAAEA,EAAE,QAAO,CAAE,EAE7BwyB,EAAaxyB,EAAGrX,EAAGgP,EAAM,EAAI,CAC5C,CACA,CAAK,EACD,iDAAkDlK,EAAM,YAAY,SAAUkK,EAAM,CAClF,OAAO,SAAUhP,EAAGqX,EAAG,CAErB,OAAOwyB,EAAa1mB,EAAO9L,CAAC,EAAGrX,EAAGgP,EAAM,EAAI,EAAE,SACtD,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACDsf,GAAA,YAAsBm5B,aCtKtB,OAAO,eAAev5B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAI9L,GAAWhlB,EACX+iC,GAASpgC,GACT6D,GAAO,MACPia,GAAe,CAAC,SAAU,QAAS,eAAgB,SAAS,EAC5D8pC,MAA+BvlC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdigC,EAAejgC,EAAK,aACpBE,EAAUF,EAAK,QAoCjB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,SAAgB5D,EAAG,CACzB,OAAIA,GAAK,GAAKhD,EAAO,eACRmjC,GAAO,WAAWngC,CAAC,EAGvB,IAAI2iB,EAAQ3iB,EAAG,CAAC,EAAE,IAAG,CAE/B,EACD,QAAS,SAAiBA,EAAG,CAC3B,OAAOA,EAAE,KACV,EACD,UAAW,SAAmBA,EAAG,CAC/B,MAAI,CAACA,EAAE,cAAgBhD,EAAO,YACrBgD,EAAE,KAGF,IAAI2iB,EAAQ3iB,EAAE,SAAU,EAAE,CAAC,EAAE,KAEvC,EACD,WAAY8E,EAAM,YAAY,SAAUkK,EAAM,CAC5C,OAAO,SAAUhP,EAAGyV,EAAM,CAExB,OAAOitC,EAAa1zC,EAAKhP,CAAC,EAAGgP,EAAKyG,CAAI,CAAC,CAC/C,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACDyY,GAAA,UAAoBy5B,aC5EpB,OAAO,eAAezyC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIkN,GAAWhlB,EACX47B,GAAcj5B,GACdkY,GAAU3W,GACVsC,GAAO,QACPia,GAAe,CAAC,QAAS,SAAU,eAAgB,MAAO,SAAS,EACnE+pC,MAAiCxlC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdigC,EAAejgC,EAAK,aACpByL,EAAMzL,EAAK,IACXE,EAAUF,EAAK,QAgCjB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,SAAgB5D,EAAG,CACzB,OAAIA,GAAK,IAAMhD,EAAO,eACTib,GAAQ,OAAOjY,CAAC,EAGpB6nD,EAAc,IAAIllC,EAAQ3iB,EAAG,CAAC,CAAC,CAEzC,EACD,QAAS6nD,EACT,UAAW,SAAmB7nD,EAAG,CAC/B,IAAIqX,EAAIrX,EAAE,KAAK,CAAC,EAChB,MAAI,CAACqX,EAAE,cAAgBra,EAAO,YACrBqa,EAAE,KAGFwwC,EAAc,IAAIllC,EAAQ3iB,EAAE,SAAU,EAAE,CAAC,CAAC,CAEpD,EACD,iBAAkB8E,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,GAAY,SAASh5B,EAAGgP,CAAI,CAC/C,CACA,CAAK,EACD,WAAYlK,EAAM,YAAY,SAAUkK,EAAM,CAC5C,OAAO,SAAUhP,EAAGyV,EAAM,CAExB,OAAOitC,EAAa1zC,EAAKhP,CAAC,EAAGkuB,EAAIzY,CAAI,CAAC,CAC9C,CACA,CAAK,CACL,CAAG,EAQD,SAASoyC,EAAc7nD,EAAG,CACxB,IAAI8nD,EAAQ9nD,EAAE,GAAK,EACnB,OAAO,IAAI2iB,EAAQ,KAAK,IAAI,KAAK,KAAKmlC,EAAQA,EAAQ9nD,EAAE,GAAKA,EAAE,EAAE,CAAC,EAAG,KAAK,MAAMA,EAAE,GAAI8nD,CAAK,CAAC,CAC7F,CACH,CAAC,EACD5yC,GAAA,YAAsB0yC,aCzFtB,OAAO,eAAeG,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAI3lC,GAAWhlB,EACXwG,GAAO,WACPia,GAAe,CAAC,SAAU,QAAS,eAAgB,SAAS,EAC5DmqC,MAAoC5lC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACxF,IAAA3d,EAAQ2d,EAAK,MACNA,EAAK,OACCA,EAAK,aACxB,IAAIE,EAAUF,EAAK,QAObwlC,EAAwB,CAAC,SAAiB5vB,EAAK,CACjD,OAAO,IAAI1V,EAAQ0V,EAAK,CAAC,CAC7B,EAAK,SAAiBA,EAAK,CACvB,OAAO,IAAI1V,EAAQ,EAAG0V,CAAG,CAC7B,EAAK,SAAiBA,EAAK,CACvB,OAAO,IAAI1V,EAAQ,CAAC0V,EAAK,CAAC,CAC9B,EAAK,SAAiBA,EAAK,CACvB,OAAO,IAAI1V,EAAQ,EAAG,CAAC0V,CAAG,CAC9B,CAAG,EAQD,SAAS6vB,EAAiBxmD,EAAG4tB,EAAM,CACjC,GAAIA,EAAO,EAAG,MAAM,IAAI,MAAM,gCAAgC,EAC9D,GAAIA,IAAS,EAAG,MAAM,IAAI,MAAM,uBAAuB,EACvD,GAAIA,EAAO,IAAM,EAAG,MAAM,IAAI,MAAM,yBAAyB,EAC7D,GAAI5tB,IAAM,GAAKA,EAAE,IAAG,IAAO,EAAG,MAAO,CAAC,IAAIihB,EAAQ,EAAG,CAAC,CAAC,EACvD,IAAIwlC,EAAa,OAAOzmD,GAAM,SAC1BkL,GAEAu7C,GAAczmD,EAAE,KAAO,GAAKA,EAAE,KAAO,KACnCymD,EACFv7C,EAAS,EAAI,EAAElL,EAAI,GACVA,EAAE,KAAO,EAClBkL,EAAS,EAAI,EAAElL,EAAE,GAAK,GAEtBkL,EAAS,EAAI,EAAElL,EAAE,GAAK,GAAK,GAQ/B,QAJIsL,EAAMtL,EAAE,MACRurB,EAAMvrB,EAAE,MACR0mD,EAAQ,CAAA,EACRtpC,EAAI,KAAK,IAAImO,EAAK,EAAIqC,CAAI,EACrBhK,EAAI,EAAGA,EAAIgK,EAAMhK,IAAK,CAC7B,IAAI+iC,GAAgBz7C,EAAS,EAAI0Y,GAAKgK,EAKtC,GAAI+4B,IAAiB,KAAK,MAAMA,CAAY,EAAG,CAC7CD,EAAM,KAAKH,EAAsBI,EAAe,CAAC,EAAEvpC,CAAC,CAAC,EACrD,QACD,CACDspC,EAAM,KAAK,IAAIzlC,EAAQ,CACrB,EAAG7D,EACH,KAAM9R,EAAM,EAAI,KAAK,GAAKsY,GAAKgK,CAChC,CAAA,CAAC,CACH,CACD,OAAO84B,CACR,CAmCD,OAAOtjD,EAAMlB,GAAM,CACjB,QAAS,SAAiB5D,EAAG,CAC3B,OAAOkoD,EAAiBloD,EAAG,CAAC,CAC7B,EACD,kBAAmBkoD,CACvB,CAAG,CACH,CAAC,EACDH,GAAA,eAAyBC,aClHzB,OAAO,eAAeM,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAIlmC,GAAWhlB,EACX60C,GAAiBlyC,GACjB+4C,GAAiBx3C,GACjBgpC,GAAiBvmC,GACjBwmC,GAAiBzxB,GACjBi3B,GAAwBztB,GACxB1e,GAAO,SACPia,GAAe,CAAC,QAAS,cAAe,SAAU,MAAO,cAAe,QAAQ,EAChF0qC,MAAkCnmC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC1F,IAAI3d,EAAQ2d,EAAK,MACf4e,EAAc5e,EAAK,YACnBU,EAASV,EAAK,OACd0J,EAAM1J,EAAK,IACXG,EAAcH,EAAK,YACnBsrB,EAAStrB,EAAK,OACZ+uB,KAAoBS,GAAe,qBAAqB,CAC1D,MAAOntC,CACX,CAAG,EACG6zC,KAAoBG,GAAe,qBAAqB,CAC1D,MAAOh0C,EACP,YAAa8d,CACjB,CAAG,EACGsmB,KAAoBoB,GAAe,qBAAqB,CAC1D,MAAOxlC,EACP,YAAau8B,CACjB,CAAG,EACGqI,KAAoBa,GAAe,qBAAqB,CAC1D,MAAOzlC,EACP,YAAa8d,CACjB,CAAG,EACGmsB,KAA2BgB,GAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EACGya,EAAsB,CAAA,EAC1B,QAASviD,KAAakmB,EAAI,WACpB,OAAO,UAAU,eAAe,KAAKA,EAAI,WAAYlmB,CAAS,GAC5D,CAACA,EAAU,SAAS,QAAQ,GAAK,CAACA,EAAU,SAAS,OAAO,IAC9DuiD,EAAoBviD,CAAS,EAAIkmB,EAAI,WAAWlmB,CAAS,GAI/D,IAAIwiD,EAAY3jD,EAAM0jD,CAAmB,EAyBzC,OAAO1jD,EAAMlB,GAAMmrC,EAAqB,CACtC,KAAM0Z,EACN,GAAI9P,EACJ,GAAInH,EACJ,GAAItI,EACJ,GAAIQ,CACL,CAAA,CAAC,CACJ,CAAC,EACD4e,GAAA,aAAuBC,aChFvB,OAAO,eAAe5F,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIvgC,GAAWhlB,EACX0zC,GAAgB/wC,GAChBkyC,GAAiB3wC,GACjBw3C,GAAiB/0C,GACjBumC,GAAiBxxB,GACjByxB,GAAiBjoB,GACjBytB,GAAwB9a,GACxBrxB,GAAO,YACPia,GAAe,CAAC,QAAS,SAAU,cAAe,eAAgB,cAAe,QAAQ,EACzF6qC,MAAqCtmC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC7F,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACd4e,EAAc5e,EAAK,YACnBigC,EAAejgC,EAAK,aACpBG,EAAcH,EAAK,YACnBsrB,EAAStrB,EAAK,OACZ+tB,KAAoBM,GAAc,qBAAqB,CACzD,MAAOhsC,EACP,YAAau8B,CACjB,CAAG,EACGmQ,KAAoBS,GAAe,qBAAqB,CAC1D,MAAOntC,CACX,CAAG,EACG6zC,KAAoBG,GAAe,qBAAqB,CAC1D,MAAOh0C,EACP,YAAa8d,CACjB,CAAG,EACGsmB,KAAoBoB,GAAe,qBAAqB,CAC1D,MAAOxlC,EACP,YAAau8B,CACjB,CAAG,EACGqI,KAAoBa,GAAe,qBAAqB,CAC1D,MAAOzlC,EACP,YAAa8d,CACjB,CAAG,EACGmsB,KAA2BgB,GAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EA4BD,OAAOjpC,EAAMlB,GAAMmrC,EAAqB,CACtC,KAAM2T,EACN,GAAI/J,EACJ,GAAInH,EACJ,GAAIhB,EACJ,GAAItH,EACJ,GAAIQ,CACL,CAAA,CAAC,CACJ,CAAC,EACDiZ,GAAA,gBAA0B+F,mBChF1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAGC,GAChC,IAAIvnD,GAAMjE,GACNwgB,GAAS7d,GACT+a,GAAUxZ,GACd,SAASsnD,GAAsBnmC,EAAM,CACnC,IAAIG,EAAcH,EAAK,YAUvB,OAAO,SAAyB0D,EAAGxkB,EAAGgB,EAAM,CAC1C,IAAIkmD,EAAQ1iC,EAAE,OACd,GAAI0iC,EAAM,SAAW,EACnB,MAAM,IAAI,WAAW,4CAA+C/tC,GAAQ,QAAQ+tC,CAAK,EAAI,GAAG,EAElG,IAAI5xB,EAAO4xB,EAAM,CAAC,EACd3xB,EAAU2xB,EAAM,CAAC,EACrB,GAAI5xB,IAASC,EACX,MAAM,IAAI,WAAW,mCAAsCpc,GAAQ,QAAQ+tC,CAAK,EAAI,GAAG,EAEzF,IAAIz2B,EAAO,CAAA,EACX,MAAQ/wB,GAAI,UAAUM,CAAC,EAAG,CACxB,IAAImnD,EAAQnnD,EAAE,OACV8rC,EAAQ9rC,EAAE,MAGd,GAAImnD,EAAM,SAAW,EAAG,CACtB,GAAIA,EAAM,CAAC,IAAM7xB,EACf,MAAM,IAAI,WAAW,8DAA8D,EAErF,QAASp6B,EAAI,EAAGA,EAAIo6B,EAAMp6B,IACxBu1B,EAAKv1B,CAAC,EAAI,CAAC4wC,EAAM5wC,CAAC,CAAC,EAErB,OAAO,IAAI+lB,EAAY,CACrB,KAAMwP,EACN,KAAM,CAAC6E,EAAM,CAAC,EACd,SAAUt1B,EAAE,SACtB,CAAS,CACF,CAGD,GAAImnD,EAAM,SAAW,EAAG,CACtB,GAAIA,EAAM,CAAC,IAAM7xB,GAAQ6xB,EAAM,CAAC,IAAM,EACpC,MAAM,IAAI,WAAW,8DAA8D,EAErF,MAAQznD,GAAI,eAAeM,CAAC,EAAG,CAC7B,GAAIgB,EAAM,CACRyvB,EAAO,CAAA,EACP,QAASxQ,EAAK,EAAGA,EAAKqV,EAAMrV,IAC1BwQ,EAAKxQ,CAAE,EAAI,CAAC6rB,EAAM7rB,CAAE,EAAE,CAAC,CAAC,EAE1B,OAAO,IAAIgB,EAAY,CACrB,KAAMwP,EACN,KAAM,CAAC6E,EAAM,CAAC,EACd,SAAUt1B,EAAE,SAC1B,CAAa,CACF,CACD,OAAOA,CACR,CACD,MAAQN,GAAI,gBAAgBM,CAAC,EAAG,CAC9B,QAASqgB,EAAM,EAAGA,EAAMiV,EAAMjV,IAC5BoQ,EAAKpQ,CAAG,EAAI,CAAC,CAAC,EAKhB,QAHI5gB,EAASO,EAAE,QACX2H,EAAQ3H,EAAE,OACV8gC,EAAM9gC,EAAE,KACHo3B,EAAK0J,EAAI,CAAC,EAAGnd,EAAImd,EAAI,CAAC,EAAGnd,EAAIyT,EAAIzT,IAAK,CAC7C,IAAIoe,EAAMp6B,EAAMgc,CAAC,EACjB8M,EAAKsR,CAAG,EAAE,CAAC,EAAItiC,EAAOkkB,CAAC,CACxB,CACD,OAAO,IAAI1C,EAAY,CACrB,KAAMwP,EACN,KAAM,CAAC6E,EAAM,CAAC,EACd,SAAUt1B,EAAE,SACxB,CAAW,CACF,CACF,CACD,MAAM,IAAI,WAAW,iFAAiF,CACvG,CACD,MAAQN,GAAI,SAASM,CAAC,EAAG,CACvB,IAAIkrC,KAAYjvB,GAAO,WAAWjc,CAAC,EACnC,GAAIkrC,EAAM,SAAW,EAAG,CACtB,GAAIA,EAAM,CAAC,IAAM5V,EACf,MAAM,IAAI,WAAW,8DAA8D,EAErF,QAASiN,EAAM,EAAGA,EAAMjN,EAAMiN,IAC5B9R,EAAK8R,CAAG,EAAI,CAACviC,EAAEuiC,CAAG,CAAC,EAErB,OAAO,IAAIthB,EAAY,CACrB,KAAMwP,EACN,KAAM,CAAC6E,EAAM,CAAC,CACxB,CAAS,CACF,CACD,GAAI4V,EAAM,SAAW,EAAG,CACtB,GAAIA,EAAM,CAAC,IAAM5V,GAAQ4V,EAAM,CAAC,IAAM,EACpC,MAAM,IAAI,WAAW,8DAA8D,EAErF,QAAS1I,EAAM,EAAGA,EAAMlN,EAAMkN,IAC5B/R,EAAK+R,CAAG,EAAI,CAACxiC,EAAEwiC,CAAG,EAAE,CAAC,CAAC,EAExB,OAAO,IAAIvhB,EAAY,CACrB,KAAMwP,EACN,KAAM,CAAC6E,EAAM,CAAC,CACxB,CAAS,CACF,CACD,MAAM,IAAI,WAAW,iFAAiF,CACvG,CACL,CACA,CCpHA,OAAO,eAAe8xB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAI3mC,GAAWhlB,EACX4rD,GAAmBjpD,GACnB6D,GAAO,SACPia,GAAe,CAAC,QAAS,SAAU,eAAgB,iBAAkB,WAAY,cAAe,aAAa,EAC7GorC,MAAkC7mC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC1F,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdigC,EAAejgC,EAAK,aACpB2vB,EAAiB3vB,EAAK,eACtBgI,EAAWhI,EAAK,SAChB4e,EAAc5e,EAAK,YACnBG,EAAcH,EAAK,YACjBkmC,KAAsBK,GAAiB,uBAAuB,CAChE,YAAapmC,CACjB,CAAG,EA0BD,OAAO9d,EAAMlB,GAAM,CACjB,+BAAgC,SAAiCuiB,EAAGxkB,EAAG,CACrE,OAAOunD,EAA2B/iC,EAAGxkB,CAAC,CACvC,EACD,8BAA+B,SAAgCwkB,EAAGxkB,EAAG,CACnE,OAAOwnD,EAA0BhjC,EAAGxkB,CAAC,CACtC,EACD,wBAAyB,SAA0BD,EAAGC,EAAG,CACvD,IAAIwkB,EAAIhD,EAAOzhB,CAAC,EACZod,EAAIqqC,EAA0BhjC,EAAGxkB,CAAC,EACtC,OAAOmd,EAAE,SACV,CACL,CAAG,EACD,SAASqqC,EAA0BhjC,EAAGxkB,EAAG,CAEvCA,EAAIgnD,EAAgBxiC,EAAGxkB,EAAG,EAAI,EAU9B,QATI8rC,EAAQ9rC,EAAE,MACVs1B,EAAO9Q,EAAE,MAAM,CAAC,EAChB+Q,EAAU/Q,EAAE,MAAM,CAAC,EAGnBnmB,EAAI,CAAA,EACJopD,EAAQjjC,EAAE,MAGLX,EAAI,EAAGA,EAAI0R,EAAS1R,IAAK,CAChC,IAAI6jC,EAAK5b,EAAMjoB,CAAC,EAAE,CAAC,GAAK,EACpB8jC,EAAK,OACT,GAAKjoB,EAAYgoB,EAAI,CAAC,EAepBC,EAAK,MAfkB,CAGvB,IAAIC,EAAMH,EAAM5jC,CAAC,EAAEA,CAAC,EACpB,GAAI6b,EAAYkoB,EAAK,CAAC,EACpB,MAAM,IAAI,MAAM,yDAAyD,EAE3ED,EAAK5G,EAAa2G,EAAIE,CAAG,EAGzB,QAAS1sD,EAAI2oB,EAAI,EAAG3oB,EAAIo6B,EAAMp6B,IAC5B4wC,EAAM5wC,CAAC,EAAI,CAAC4tB,EAASgjB,EAAM5wC,CAAC,EAAE,CAAC,GAAK,EAAGu1C,EAAekX,EAAIF,EAAMvsD,CAAC,EAAE2oB,CAAC,CAAC,CAAC,CAAC,CAEjF,CAIMxlB,EAAEwlB,CAAC,EAAI,CAAC8jC,CAAE,CACX,CACD,OAAO,IAAI1mC,EAAY,CACrB,KAAM5iB,EACN,KAAM,CAACi3B,EAAM,CAAC,CACpB,CAAK,CACF,CACD,SAASiyB,EAA2B/iC,EAAGxkB,EAAG,CAExCA,EAAIgnD,EAAgBxiC,EAAGxkB,EAAG,EAAI,EAY9B,QAXI8rC,EAAQ9rC,EAAE,MACVs1B,EAAO9Q,EAAE,MAAM,CAAC,EAChB+Q,EAAU/Q,EAAE,MAAM,CAAC,EACnB/kB,EAAS+kB,EAAE,QACX7c,EAAQ6c,EAAE,OACVsc,EAAMtc,EAAE,KAGRnmB,EAAI,CAAA,EAGCwlB,EAAI,EAAGA,EAAI0R,EAAS1R,IAAK,CAChC,IAAI6jC,EAAK5b,EAAMjoB,CAAC,EAAE,CAAC,GAAK,EACxB,GAAK6b,EAAYgoB,EAAI,CAAC,EAsCpBrpD,EAAEwlB,CAAC,EAAI,CAAC,CAAC,MAtCc,CAavB,QAVI+jC,EAAM,EAENC,EAAU,CAAA,EACVC,EAAW,CAAA,EAGXC,EAAajnB,EAAIjd,CAAC,EAClBmkC,EAAYlnB,EAAIjd,EAAI,CAAC,EAGhBF,EAAIokC,EAAYpkC,EAAIqkC,EAAWrkC,IAAK,CAC3C,IAAIzoB,EAAIyM,EAAMgc,CAAC,EAGXzoB,IAAM2oB,EACR+jC,EAAMnoD,EAAOkkB,CAAC,EACLzoB,EAAI2oB,IAEbgkC,EAAQ,KAAKpoD,EAAOkkB,CAAC,CAAC,EACtBmkC,EAAS,KAAK5sD,CAAC,EAElB,CAGD,GAAIwkC,EAAYkoB,EAAK,CAAC,EACpB,MAAM,IAAI,MAAM,yDAAyD,EAG3E,QADID,EAAK5G,EAAa2G,EAAIE,CAAG,EACpBtlB,EAAK,EAAGjR,EAAIy2B,EAAS,OAAQxlB,EAAKjR,EAAGiR,IAAM,CAClD,IAAIriB,EAAK6nC,EAASxlB,CAAE,EACpBwJ,EAAM7rB,CAAE,EAAI,CAAC6I,EAASgjB,EAAM7rB,CAAE,EAAE,CAAC,GAAK,EAAGwwB,EAAekX,EAAIE,EAAQvlB,CAAE,CAAC,CAAC,CAAC,CAC1E,CACDjkC,EAAEwlB,CAAC,EAAI,CAAC8jC,CAAE,CAClB,CAIK,CACD,OAAO,IAAI1mC,EAAY,CACrB,KAAM5iB,EACN,KAAM,CAACi3B,EAAM,CAAC,CACpB,CAAK,CACF,CACH,CAAC,EACD8xB,GAAA,aAAuBE,aC/JvB,OAAO,eAAeW,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAIxnC,GAAWhlB,EACX4rD,GAAmBjpD,GACnB6D,GAAO,SACPia,GAAe,CAAC,QAAS,SAAU,eAAgB,iBAAkB,WAAY,cAAe,aAAa,EAC7GgsC,MAAkCznC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC1F,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdigC,EAAejgC,EAAK,aACpB2vB,EAAiB3vB,EAAK,eACtBgI,EAAWhI,EAAK,SAChB4e,EAAc5e,EAAK,YACnBG,EAAcH,EAAK,YACjBkmC,KAAsBK,GAAiB,uBAAuB,CAChE,YAAapmC,CACjB,CAAG,EA0BD,OAAO9d,EAAMlB,GAAM,CACjB,+BAAgC,SAAiCuiB,EAAGxkB,EAAG,CACrE,OAAOmoD,EAA4B3jC,EAAGxkB,CAAC,CACxC,EACD,8BAA+B,SAAgCwkB,EAAGxkB,EAAG,CACnE,OAAOooD,EAA2B5jC,EAAGxkB,CAAC,CACvC,EACD,wBAAyB,SAA0BD,EAAGC,EAAG,CACvD,IAAIwkB,EAAIhD,EAAOzhB,CAAC,EACZod,EAAIirC,EAA2B5jC,EAAGxkB,CAAC,EACvC,OAAOmd,EAAE,SACV,CACL,CAAG,EACD,SAASirC,EAA2B5jC,EAAGxkB,EAAG,CAExCA,EAAIgnD,EAAgBxiC,EAAGxkB,EAAG,EAAI,EAS9B,QARI8rC,EAAQ9rC,EAAE,MACVs1B,EAAO9Q,EAAE,MAAM,CAAC,EAChB+Q,EAAU/Q,EAAE,MAAM,CAAC,EAGnBnmB,EAAI,CAAA,EACJopD,EAAQjjC,EAAE,MAELX,EAAI0R,EAAU,EAAG1R,GAAK,EAAGA,IAAK,CAErC,IAAI6jC,EAAK5b,EAAMjoB,CAAC,EAAE,CAAC,GAAK,EAEpB8jC,EAAK,OACT,GAAKjoB,EAAYgoB,EAAI,CAAC,EAgBpBC,EAAK,MAhBkB,CAEvB,IAAIC,EAAMH,EAAM5jC,CAAC,EAAEA,CAAC,EACpB,GAAI6b,EAAYkoB,EAAK,CAAC,EAEpB,MAAM,IAAI,MAAM,yDAAyD,EAE3ED,EAAK5G,EAAa2G,EAAIE,CAAG,EAGzB,QAAS1sD,EAAI2oB,EAAI,EAAG3oB,GAAK,EAAGA,IAE1B4wC,EAAM5wC,CAAC,EAAI,CAAC4tB,EAASgjB,EAAM5wC,CAAC,EAAE,CAAC,GAAK,EAAGu1C,EAAekX,EAAIF,EAAMvsD,CAAC,EAAE2oB,CAAC,CAAC,CAAC,CAAC,CAEjF,CAKMxlB,EAAEwlB,CAAC,EAAI,CAAC8jC,CAAE,CACX,CACD,OAAO,IAAI1mC,EAAY,CACrB,KAAM5iB,EACN,KAAM,CAACi3B,EAAM,CAAC,CACpB,CAAK,CACF,CACD,SAAS6yB,EAA4B3jC,EAAGxkB,EAAG,CAEzCA,EAAIgnD,EAAgBxiC,EAAGxkB,EAAG,EAAI,EAY9B,QAXI8rC,EAAQ9rC,EAAE,MACVs1B,EAAO9Q,EAAE,MAAM,CAAC,EAChB+Q,EAAU/Q,EAAE,MAAM,CAAC,EACnB/kB,EAAS+kB,EAAE,QACX7c,EAAQ6c,EAAE,OACVsc,EAAMtc,EAAE,KAGRnmB,EAAI,CAAA,EAGCwlB,EAAI0R,EAAU,EAAG1R,GAAK,EAAGA,IAAK,CACrC,IAAI6jC,EAAK5b,EAAMjoB,CAAC,EAAE,CAAC,GAAK,EACxB,GAAK6b,EAAYgoB,EAAI,CAAC,EAuCpBrpD,EAAEwlB,CAAC,EAAI,CAAC,CAAC,MAvCc,CAcvB,QAXI+jC,EAAM,EAGNC,EAAU,CAAA,EACVC,EAAW,CAAA,EAGXC,EAAajnB,EAAIjd,CAAC,EAClBmkC,EAAYlnB,EAAIjd,EAAI,CAAC,EAGhBF,EAAIqkC,EAAY,EAAGrkC,GAAKokC,EAAYpkC,IAAK,CAChD,IAAIzoB,EAAIyM,EAAMgc,CAAC,EAGXzoB,IAAM2oB,EACR+jC,EAAMnoD,EAAOkkB,CAAC,EACLzoB,EAAI2oB,IAEbgkC,EAAQ,KAAKpoD,EAAOkkB,CAAC,CAAC,EACtBmkC,EAAS,KAAK5sD,CAAC,EAElB,CAGD,GAAIwkC,EAAYkoB,EAAK,CAAC,EACpB,MAAM,IAAI,MAAM,yDAAyD,EAG3E,QADID,EAAK5G,EAAa2G,EAAIE,CAAG,EACpBtlB,EAAK,EAAG+lB,EAAaP,EAAS,OAAQxlB,EAAK+lB,EAAY/lB,IAAM,CACpE,IAAIriB,EAAK6nC,EAASxlB,CAAE,EACpBwJ,EAAM7rB,CAAE,EAAI,CAAC6I,EAASgjB,EAAM7rB,CAAE,EAAE,CAAC,EAAGwwB,EAAekX,EAAIE,EAAQvlB,CAAE,CAAC,CAAC,CAAC,CACrE,CACDjkC,EAAEwlB,CAAC,EAAI,CAAC8jC,CAAE,CAClB,CAIK,CACD,OAAO,IAAI1mC,EAAY,CACrB,KAAM5iB,EACN,KAAM,CAACi3B,EAAM,CAAC,CACpB,CAAK,CACF,CACH,CAAC,EACD2yB,GAAA,aAAuBC,aCnKnBrtD,GAAyBY,GAC7B,OAAO,eAAe6sD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIrc,GAAsBpxC,GAAuBuD,GAAA,CAAmD,EAChGqiB,GAAW9gB,EACX0nD,GAAmBjlD,GACnBH,GAAO,YACPia,GAAe,CAAC,QAAS,SAAU,eAAgB,iBAAkB,WAAY,cAAe,aAAa,EAC7GqsC,MAAqC9nC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC7F,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdigC,EAAejgC,EAAK,aACpB2vB,EAAiB3vB,EAAK,eACtBgI,EAAWhI,EAAK,SAChB4e,EAAc5e,EAAK,YACnBG,EAAcH,EAAK,YACjBkmC,KAAsBK,GAAiB,uBAAuB,CAChE,YAAapmC,CACjB,CAAG,EA0BD,OAAO9d,EAAMlB,GAAM,CACjB,+BAAgC,SAAiCuiB,EAAGxkB,EAAG,CACrE,OAAOunD,EAA2B/iC,EAAGxkB,CAAC,CACvC,EACD,8BAA+B,SAAgCwkB,EAAGxkB,EAAG,CACnE,OAAOwnD,EAA0BhjC,EAAGxkB,CAAC,CACtC,EACD,wBAAyB,SAA0BD,EAAGC,EAAG,CACvD,IAAIwkB,EAAIhD,EAAOzhB,CAAC,EACZyoD,EAAIhB,EAA0BhjC,EAAGxkB,CAAC,EACtC,OAAOwoD,EAAE,IAAI,SAAUrrC,EAAG,CACxB,OAAOA,EAAE,SACjB,CAAO,CACF,CACL,CAAG,EACD,SAASqqC,EAA0BhjC,EAAGikC,EAAI,CAaxC,QARIj6B,EAAI,CAACw4B,EAAgBxiC,EAAGikC,EAAI,EAAI,EAAE,MAAM,IAAI,SAAUn0C,EAAG,CAC3D,OAAOA,EAAE,CAAC,CACX,CAAA,CAAC,EACEsa,EAAIpK,EAAE,MACN8Q,EAAO9Q,EAAE,MAAM,CAAC,EAChB+Q,EAAU/Q,EAAE,MAAM,CAAC,EAGdtpB,EAAI,EAAGA,EAAIq6B,EAASr6B,IAI3B,QAHIwtD,EAAIl6B,EAAE,OAGD7K,EAAI,EAAGA,EAAI+kC,EAAG/kC,IAAK,CAC1B,IAAI3jB,EAAIwuB,EAAE7K,CAAC,EACX,GAAK+b,EAAY9Q,EAAE1zB,CAAC,EAAEA,CAAC,EAAG,CAAC,EAQpB,GAAKwkC,EAAY1/B,EAAE9E,CAAC,EAAG,CAAC,GAYxB,GAAIyoB,IAAM,EAAG,CAGlB,IAAIglC,KAAW1c,GAAoB,SAAYjsC,CAAC,EAChD2oD,EAAKztD,CAAC,EAAI,EACV,QAAS8mC,EAAK9mC,EAAI,EAAG8mC,EAAKzM,EAASyM,IACjC2mB,EAAK3mB,CAAE,EAAIlZ,EAAS6/B,EAAK3mB,CAAE,EAAGpT,EAAEoT,CAAE,EAAE9mC,CAAC,CAAC,EAExCszB,EAAE,KAAKm6B,CAAI,CACZ,MArBiC,CAGhC,GAAIhlC,IAAM,EAER,MAAO,GAGP6K,EAAE,OAAO7K,EAAG,CAAC,EACbA,GAAK,EACL+kC,GAAK,CAEjB,KApBsC,CAG5B1oD,EAAE9E,CAAC,EAAI6lD,EAAa/gD,EAAE9E,CAAC,EAAG0zB,EAAE1zB,CAAC,EAAEA,CAAC,CAAC,EACjC,QAAS2oB,EAAI3oB,EAAI,EAAG2oB,EAAI0R,EAAS1R,IAE/B7jB,EAAE6jB,CAAC,EAAIiF,EAAS9oB,EAAE6jB,CAAC,EAAG4sB,EAAezwC,EAAE9E,CAAC,EAAG0zB,EAAE/K,CAAC,EAAE3oB,CAAC,CAAC,CAAC,CAE/D,CAsBO,CAEH,OAAOszB,EAAE,IAAI,SAAUnwB,EAAG,CACxB,OAAO,IAAI4iB,EAAY,CACrB,KAAM5iB,EAAE,IAAI,SAAUiW,EAAG,CACvB,MAAO,CAACA,CAAC,CACnB,CAAS,EACD,KAAM,CAACghB,EAAM,CAAC,CACtB,CAAO,CACP,CAAK,CACF,CACD,SAASiyB,EAA2B/iC,EAAGikC,EAAI,CAYzC,QAVIj6B,EAAI,CAACw4B,EAAgBxiC,EAAGikC,EAAI,EAAI,EAAE,MAAM,IAAI,SAAUn0C,EAAG,CAC3D,OAAOA,EAAE,CAAC,CACX,CAAA,CAAC,EACEghB,EAAO9Q,EAAE,MAAM,CAAC,EAChB+Q,EAAU/Q,EAAE,MAAM,CAAC,EACnB/kB,EAAS+kB,EAAE,QACX7c,EAAQ6c,EAAE,OACVsc,EAAMtc,EAAE,KAGHtpB,EAAI,EAAGA,EAAIq6B,EAASr6B,IAI3B,QAHIwtD,EAAIl6B,EAAE,OAGD7K,EAAI,EAAGA,EAAI+kC,EAAG/kC,IAAK,CAa1B,QAZI3jB,EAAIwuB,EAAE7K,CAAC,EAGPilC,EAAU,CAAA,EACVC,EAAW,CAAA,EAGXd,EAAajnB,EAAI5lC,CAAC,EAClB8sD,EAAYlnB,EAAI5lC,EAAI,CAAC,EAGrB4tD,EAAM,EACDjlC,EAAIkkC,EAAYlkC,EAAImkC,EAAWnkC,IAAK,CAC3C,IAAIkS,EAAIpuB,EAAMkc,CAAC,EAEXkS,IAAM76B,EACR4tD,EAAMrpD,EAAOokB,CAAC,EACLkS,EAAI76B,IAEb0tD,EAAQ,KAAKnpD,EAAOokB,CAAC,CAAC,EACtBglC,EAAS,KAAK9yB,CAAC,EAElB,CACD,GAAK2J,EAAYopB,EAAK,CAAC,EAQhB,GAAKppB,EAAY1/B,EAAE9E,CAAC,EAAG,CAAC,GAYxB,GAAIyoB,IAAM,EAAG,CAGlB,IAAIglC,KAAW1c,GAAoB,SAAYjsC,CAAC,EAChD2oD,EAAKztD,CAAC,EAAI,EACV,QAAS6tD,EAAM,EAAGC,EAAcH,EAAS,OAAQE,EAAMC,EAAaD,IAAO,CACzE,IAAIE,EAAMJ,EAASE,CAAG,EACtBJ,EAAKM,CAAG,EAAIngC,EAAS6/B,EAAKM,CAAG,EAAGL,EAAQG,CAAG,CAAC,CAC7C,CACDv6B,EAAE,KAAKm6B,CAAI,CACZ,MAtBiC,CAGhC,GAAIhlC,IAAM,EAER,MAAO,GAGP6K,EAAE,OAAO7K,EAAG,CAAC,EACbA,GAAK,EACL+kC,GAAK,CAEjB,KApBkC,CAGxB1oD,EAAE9E,CAAC,EAAI6lD,EAAa/gD,EAAE9E,CAAC,EAAG4tD,CAAG,EAC7B,QAASI,EAAM,EAAGb,EAAaQ,EAAS,OAAQK,EAAMb,EAAYa,IAAO,CACvE,IAAIC,EAAKN,EAASK,CAAG,EACrBlpD,EAAEmpD,CAAE,EAAIrgC,EAAS9oB,EAAEmpD,CAAE,EAAG1Y,EAAezwC,EAAE9E,CAAC,EAAG0tD,EAAQM,CAAG,CAAC,CAAC,CAC3D,CACX,CAuBO,CAEH,OAAO16B,EAAE,IAAI,SAAUnwB,EAAG,CACxB,OAAO,IAAI4iB,EAAY,CACrB,KAAM5iB,EAAE,IAAI,SAAUiW,GAAG,CACvB,MAAO,CAACA,EAAC,CACnB,CAAS,EACD,KAAM,CAACghB,EAAM,CAAC,CACtB,CAAO,CACP,CAAK,CACF,CACH,CAAC,EACDgzB,GAAA,gBAA0BC,aC5MtB1tD,GAAyBY,GAC7B,OAAO,eAAe2tD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAInd,GAAsBpxC,GAAuBuD,GAAA,CAAmD,EAChGqiB,GAAW9gB,EACX0nD,GAAmBjlD,GACnBH,GAAO,YACPia,GAAe,CAAC,QAAS,SAAU,eAAgB,iBAAkB,WAAY,cAAe,aAAa,EAC7GmtC,MAAqC5oC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC7F,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdigC,EAAejgC,EAAK,aACpB2vB,EAAiB3vB,EAAK,eACtBgI,EAAWhI,EAAK,SAChB4e,EAAc5e,EAAK,YACnBG,EAAcH,EAAK,YACjBkmC,KAAsBK,GAAiB,uBAAuB,CAChE,YAAapmC,CACjB,CAAG,EA0BD,OAAO9d,EAAMlB,GAAM,CACjB,+BAAgC,SAAiCuiB,EAAGxkB,EAAG,CACrE,OAAOmoD,EAA4B3jC,EAAGxkB,CAAC,CACxC,EACD,8BAA+B,SAAgCwkB,EAAGxkB,EAAG,CACnE,OAAOooD,EAA2B5jC,EAAGxkB,CAAC,CACvC,EACD,wBAAyB,SAA0BD,EAAGC,EAAG,CACvD,IAAIwkB,EAAIhD,EAAOzhB,CAAC,EACZyoD,EAAIJ,EAA2B5jC,EAAGxkB,CAAC,EACvC,OAAOwoD,EAAE,IAAI,SAAUrrC,EAAG,CACxB,OAAOA,EAAE,SACjB,CAAO,CACF,CACL,CAAG,EACD,SAASirC,EAA2B5jC,EAAGikC,EAAI,CAazC,QARIj6B,EAAI,CAACw4B,EAAgBxiC,EAAGikC,EAAI,EAAI,EAAE,MAAM,IAAI,SAAUn0C,EAAG,CAC3D,OAAOA,EAAE,CAAC,CACX,CAAA,CAAC,EACEsa,EAAIpK,EAAE,MACN8Q,EAAO9Q,EAAE,MAAM,CAAC,EAChB+Q,EAAU/Q,EAAE,MAAM,CAAC,EAGdtpB,EAAIq6B,EAAU,EAAGr6B,GAAK,EAAGA,IAIhC,QAHIwtD,EAAIl6B,EAAE,OAGD7K,EAAI,EAAGA,EAAI+kC,EAAG/kC,IAAK,CAC1B,IAAI3jB,EAAIwuB,EAAE7K,CAAC,EACX,GAAK+b,EAAY9Q,EAAE1zB,CAAC,EAAEA,CAAC,EAAG,CAAC,EAQpB,GAAKwkC,EAAY1/B,EAAE9E,CAAC,EAAG,CAAC,GAYxB,GAAIyoB,IAAM,EAAG,CAGlB,IAAIglC,KAAW1c,GAAoB,SAAYjsC,CAAC,EAChD2oD,EAAKztD,CAAC,EAAI,EACV,QAAS8mC,EAAK9mC,EAAI,EAAG8mC,GAAM,EAAGA,IAC5B2mB,EAAK3mB,CAAE,EAAIlZ,EAAS6/B,EAAK3mB,CAAE,EAAGpT,EAAEoT,CAAE,EAAE9mC,CAAC,CAAC,EAExCszB,EAAE,KAAKm6B,CAAI,CACZ,MArBiC,CAGhC,GAAIhlC,IAAM,EAER,MAAO,GAGP6K,EAAE,OAAO7K,EAAG,CAAC,EACbA,GAAK,EACL+kC,GAAK,CAEjB,KApBsC,CAG5B1oD,EAAE9E,CAAC,EAAI6lD,EAAa/gD,EAAE9E,CAAC,EAAG0zB,EAAE1zB,CAAC,EAAEA,CAAC,CAAC,EACjC,QAAS2oB,EAAI3oB,EAAI,EAAG2oB,GAAK,EAAGA,IAE1B7jB,EAAE6jB,CAAC,EAAIiF,EAAS9oB,EAAE6jB,CAAC,EAAG4sB,EAAezwC,EAAE9E,CAAC,EAAG0zB,EAAE/K,CAAC,EAAE3oB,CAAC,CAAC,CAAC,CAE/D,CAsBO,CAEH,OAAOszB,EAAE,IAAI,SAAUnwB,EAAG,CACxB,OAAO,IAAI4iB,EAAY,CACrB,KAAM5iB,EAAE,IAAI,SAAUiW,EAAG,CACvB,MAAO,CAACA,CAAC,CACnB,CAAS,EACD,KAAM,CAACghB,EAAM,CAAC,CACtB,CAAO,CACP,CAAK,CACF,CACD,SAAS6yB,EAA4B3jC,EAAGikC,EAAI,CAY1C,QAVIj6B,EAAI,CAACw4B,EAAgBxiC,EAAGikC,EAAI,EAAI,EAAE,MAAM,IAAI,SAAUn0C,EAAG,CAC3D,OAAOA,EAAE,CAAC,CACX,CAAA,CAAC,EACEghB,EAAO9Q,EAAE,MAAM,CAAC,EAChB+Q,EAAU/Q,EAAE,MAAM,CAAC,EACnB/kB,EAAS+kB,EAAE,QACX7c,EAAQ6c,EAAE,OACVsc,EAAMtc,EAAE,KAGHtpB,EAAIq6B,EAAU,EAAGr6B,GAAK,EAAGA,IAIhC,QAHIwtD,EAAIl6B,EAAE,OAGD7K,EAAI,EAAGA,EAAI+kC,EAAG/kC,IAAK,CAa1B,QAZI3jB,EAAIwuB,EAAE7K,CAAC,EAGPilC,EAAU,CAAA,EACVC,EAAW,CAAA,EAGXd,EAAajnB,EAAI5lC,CAAC,EAClB8sD,EAAYlnB,EAAI5lC,EAAI,CAAC,EAGrB4tD,EAAM,EACDjlC,EAAImkC,EAAY,EAAGnkC,GAAKkkC,EAAYlkC,IAAK,CAChD,IAAIkS,EAAIpuB,EAAMkc,CAAC,EAEXkS,IAAM76B,EACR4tD,EAAMrpD,EAAOokB,CAAC,EACLkS,EAAI76B,IAEb0tD,EAAQ,KAAKnpD,EAAOokB,CAAC,CAAC,EACtBglC,EAAS,KAAK9yB,CAAC,EAElB,CACD,GAAK2J,EAAYopB,EAAK,CAAC,EAUhB,GAAKppB,EAAY1/B,EAAE9E,CAAC,EAAG,CAAC,GAYxB,GAAIyoB,IAAM,EAAG,CAGlB,IAAIglC,KAAW1c,GAAoB,SAAYjsC,CAAC,EAChD2oD,EAAKztD,CAAC,EAAI,EAGV,QAAS6tD,EAAM,EAAGC,EAAcH,EAAS,OAAQE,EAAMC,EAAaD,IAAO,CACzE,IAAIE,EAAMJ,EAASE,CAAG,EACtBJ,EAAKM,CAAG,EAAIngC,EAAS6/B,EAAKM,CAAG,EAAGL,EAAQG,CAAG,CAAC,CAC7C,CACDv6B,EAAE,KAAKm6B,CAAI,CACZ,MAxBiC,CAGhC,GAAIhlC,IAAM,EAER,MAAO,GAGP6K,EAAE,OAAO7K,EAAG,CAAC,EACbA,GAAK,EACL+kC,GAAK,CAEjB,KAtBkC,CAGxB1oD,EAAE9E,CAAC,EAAI6lD,EAAa/gD,EAAE9E,CAAC,EAAG4tD,CAAG,EAG7B,QAASI,EAAM,EAAGb,EAAaQ,EAAS,OAAQK,EAAMb,EAAYa,IAAO,CACvE,IAAIC,EAAKN,EAASK,CAAG,EACrBlpD,EAAEmpD,CAAE,EAAIrgC,EAAS9oB,EAAEmpD,CAAE,EAAG1Y,EAAezwC,EAAE9E,CAAC,EAAG0tD,EAAQM,CAAG,CAAC,CAAC,CAC3D,CACX,CAyBO,CAEH,OAAO16B,EAAE,IAAI,SAAUnwB,EAAG,CACxB,OAAO,IAAI4iB,EAAY,CACrB,KAAM5iB,EAAE,IAAI,SAAUiW,GAAG,CACvB,MAAO,CAACA,EAAC,CACnB,CAAS,EACD,KAAM,CAACghB,EAAM,CAAC,CACtB,CAAO,CACP,CAAK,CACF,CACH,CAAC,EACD8zB,GAAA,gBAA0BC,mBChN1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAI7oC,GAAWhlB,EACX2d,GAAkBhb,GAClB6D,GAAO,kBACPia,GAAe,CAAC,QAAS,aAAa,EACtCqtC,MAA2C9oC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACnG,IAAI3d,EAAQ2d,EAAK,MACf4e,EAAc5e,EAAK,YAmBrB,OAAO,SAAyB,EAAG9gB,EAAGF,EAAU,CAE9C,IAAIk3B,EAAU,EAAE,QACZC,EAAS,EAAE,OACXC,EAAO,EAAE,KACTuQ,EAAQ,EAAE,MACVC,EAAM,EAAE,UAERqD,EAAU/qC,EAAE,QACZgrC,EAAShrC,EAAE,OACXirC,EAAOjrC,EAAE,KACTkrC,EAAQlrC,EAAE,MACVmrC,EAAMnrC,EAAE,UAGZ,GAAIynC,EAAM,SAAWyD,EAAM,OACzB,MAAM,IAAI9xB,GAAgB,eAAequB,EAAM,OAAQyD,EAAM,MAAM,EAIrE,GAAIzD,EAAM,CAAC,IAAMyD,EAAM,CAAC,GAAKzD,EAAM,CAAC,IAAMyD,EAAM,CAAC,EAC/C,MAAM,IAAI,WAAW,iCAAmCzD,EAAQ,0BAA4ByD,EAAQ,GAAG,EAIzG,GAAI,CAAClU,GAAW,CAAC+T,EACf,MAAM,IAAI,MAAM,qDAAqD,EAIvE,IAAIzV,EAAOmS,EAAM,CAAC,EACdlS,EAAUkS,EAAM,CAAC,EAGjBE,EAEAvH,EAAKV,EAELW,EAAO,EAEPuH,EAAK9nC,EAGL,OAAO4nC,GAAQ,UAAYA,IAAQyD,IAErCxD,EAAKD,EAELtH,EAAKj9B,EAAM,KAAKu8B,EAAa,CAACiI,EAAIA,CAAE,CAAC,EAErCtH,EAAOl9B,EAAM,QAAQ,EAAGwkC,CAAE,EAE1BC,EAAKzkC,EAAM,KAAKrD,EAAU,CAAC6nC,EAAIA,CAAE,CAAC,GAiBpC,QAbIE,EAAU,CAAA,EACVhR,EAAS,CAAA,EACTiR,EAAO,CAAA,EAGPzpC,EAAI,CAAA,EAEJypB,EAAI,CAAA,EAGJnE,EAAGwT,EAAIC,EAAIl8B,EAGN2oB,EAAI,EAAGA,EAAI0R,EAAS1R,IAAK,CAEhCikB,EAAKjkB,CAAC,EAAIgT,EAAO,OAEjB,IAAID,EAAO/S,EAAI,EAEf,IAAKsT,EAAKD,EAAKrT,CAAC,EAAGuT,EAAKF,EAAKrT,EAAI,CAAC,EAAGF,EAAIwT,EAAIxT,EAAIyT,EAAIzT,IAEnDzoB,EAAI+7B,EAAOtT,CAAC,EAEZmE,EAAE5sB,CAAC,EAAI07B,EAEPv4B,EAAEnD,CAAC,EAAI87B,EAAQrT,CAAC,EAEhBkT,EAAO,KAAK37B,CAAC,EAGf,IAAKi8B,EAAK8T,EAAKpnB,CAAC,EAAGuT,EAAK6T,EAAKpnB,EAAI,CAAC,EAAGF,EAAIwT,EAAIxT,EAAIyT,EAAIzT,IAEnDzoB,EAAI8vC,EAAOrnB,CAAC,EAERmE,EAAE5sB,CAAC,IAAM07B,IAEXv4B,EAAEnD,CAAC,EAAI0sC,EAAGvpC,EAAEnD,CAAC,EAAG6vC,EAAQpnB,CAAC,CAAC,GAM9B,IAFAA,EAAImkB,EAAKjkB,CAAC,EAEHF,EAAIkT,EAAO,QAAQ,CAExB37B,EAAI27B,EAAOlT,CAAC,EAEZ,IAAImI,EAAIztB,EAAEnD,CAAC,EAENklC,EAAGtU,EAAGuU,CAAI,EAObxJ,EAAO,OAAOlT,EAAG,CAAC,GALlBkkB,EAAQ,KAAK/b,CAAC,EAEdnI,IAKH,CACF,CAED,OAAAmkB,EAAKvS,CAAO,EAAIsB,EAAO,OAGhB,EAAE,mBAAmB,CAC1B,OAAQgR,EACR,MAAOhR,EACP,IAAKiR,EACL,KAAM,CAACxS,EAAMC,CAAO,EACpB,SAAUoS,CAChB,CAAK,CACL,CACA,CAAC,EACD2hB,GAAA,sBAAgCC,aC5JhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoCA,GAAA,8BAAG,OACxC,IAAI/oC,GAAWhlB,EACXguD,MAAmDhpC,GAAS,SAAS,0BAA2B,CAAC,QAAS,QAAQ,EAAG,SAAUK,EAAM,CACvI,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OAChB,MAAO,CACL,gBAAiB3d,EAAM,QAAQ,sBAAuB,SAAUqwC,EAAQ,CACtE,OAAO,SAAUn1C,EAAGqX,EAAG,CACrB,OAAO89B,EAAOhyB,EAAOnjB,CAAC,EAAGqX,CAAC,EAAE,SACpC,CACA,CAAK,EACD,mBAAoBvS,EAAM,QAAQ,yBAA0B,SAAUumD,EAAQ,CAC5E,OAAO,SAAUrrD,EAAGqX,EAAG,CACrB,OAAOg0C,EAAOloC,EAAOnjB,CAAC,EAAGqX,CAAC,EAAE,SACpC,CACA,CAAK,EACD,gBAAiBvS,EAAM,QAAQ,sBAAuB,SAAUwmD,EAAQ,CACtE,OAAO,SAAUtrD,EAAGqX,EAAG,CACrB,OAAOi0C,EAAOtrD,EAAGmjB,EAAO9L,CAAC,CAAC,EAAE,SACpC,CACA,CAAK,EACD,mBAAoBvS,EAAM,QAAQ,yBAA0B,SAAUymD,EAAQ,CAC5E,OAAO,SAAUvrD,EAAGqX,EAAG,CACrB,OAAOk0C,EAAOvrD,EAAGmjB,EAAO9L,CAAC,CAAC,EAAE,SACpC,CACA,CAAK,CACL,CACA,CAAC,EACD8zC,GAAA,8BAAwCC,GC/BxC,OAAO,eAAeI,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAI1a,GAAgB1zC,GAChBktC,GAAiBvqC,GACjByqC,GAAgBlpC,GAChBsuC,GAAkB7rC,GAClB+rC,GAAkBh3B,GAClB2yC,GAAmBnpC,GACnBF,GAAW6S,EACX8a,GAAwB7a,GACxBw2B,GAA2Bv2B,GAC3BgL,GAAS/K,GACTsK,GAAWisB,GACX/nD,GAAO,YACPia,GAAe,CAAC,QAAS,SAAU,cAAe,QAAS,cAAe,QAAQ,EAClF+tC,MAAqCxpC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CAC7F,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACd4e,EAAc5e,EAAK,YACnBpM,EAAQoM,EAAK,MACbG,EAAcH,EAAK,YACnBsrB,EAAStrB,EAAK,OACZ6pB,KAAqBsD,GAAgB,sBAAsB,CAC7D,MAAO9qC,CACX,CAAG,EACG0rC,KAAoBM,GAAc,qBAAqB,CACzD,MAAOhsC,EACP,YAAau8B,CACjB,CAAG,EACG4pB,KAAsBQ,GAAiB,uBAAuB,CAChE,MAAO3mD,EACP,YAAau8B,CACjB,CAAG,EACGgM,KAAqByC,GAAgB,sBAAsB,CAC7D,MAAOhrC,EACP,YAAa8d,CACjB,CAAG,EACGsmB,KAAoBoB,GAAe,qBAAqB,CAC1D,MAAOxlC,EACP,YAAau8B,CACjB,CAAG,EACGwI,KAAmBW,GAAc,oBAAoB,CACvD,MAAO1lC,CACX,CAAG,EACGiqC,KAA2BgB,GAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EACGod,KAA8BO,GAAyB,+BAA+B,CACxF,MAAO5mD,EACP,OAAQqe,CACZ,CAAG,EAyBD,OAAOre,EAAMlB,GAAM,CACjB,iBAAkBu8B,GAAO,gBACzB,uBAAwBT,GAAS,mBACjC,mCAAoC56B,EAAM,YAAY,SAAUkK,EAAM,CACpE,OAAO,SAAUhP,EAAG,EAAG,CAErB,OAAIqhC,EAAY,EAAG,CAAC,EACXrhC,EAAE,QAEJkpC,EAAclpC,EAAG,EAAGgP,EAAM,EAAK,CAC9C,CACA,CAAK,EACD,kCAAmClK,EAAM,YAAY,SAAUkK,EAAM,CACnE,OAAO,SAAUhP,EAAG,EAAG,CAErB,OAAIqhC,EAAY,EAAG,CAAC,EACXrhC,EAAE,QAEJ6pC,EAAa7pC,EAAG,EAAGgP,EAAM,EAAK,CAC7C,CACA,CAAK,EACD,mCAAoClK,EAAM,YAAY,SAAUkK,EAAM,CACpE,OAAO,SAAUhP,EAAG,EAAG,CAErB,OAAIqhC,EAAYrhC,EAAG,CAAC,EACXqW,EAAM,EAAE,KAAM,EAAE,EAAE,QAAO,CAAE,EAE7Bg3B,EAAe,EAAGrtC,EAAGgP,EAAM,EAAI,CAC9C,CACA,CAAK,EACD,kCAAmClK,EAAM,YAAY,SAAUkK,EAAM,CACnE,OAAO,SAAUhP,EAAG,EAAG,CAErB,OAAIqhC,EAAYrhC,EAAG,CAAC,EACXqW,EAAM,EAAE,KAAM,EAAE,EAAE,QAAO,CAAE,EAE7BwzB,EAAa,EAAG7pC,EAAGgP,EAAM,EAAI,CAC5C,CACA,CAAK,CACL,EAAKm8C,EAAyBpc,EAAqB,CAC/C,GAAIkc,EACJ,GAAI3e,EACJ,GAAIkE,CACL,CAAA,CAAC,CACJ,CAAC,EACDgb,GAAA,gBAA0BI,aC5H1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAInsB,GAAWtiC,GACX0zC,GAAgB/wC,GAChBuqC,GAAiBhpC,GACjBkpC,GAAgBzmC,GAChB6rC,GAAkB92B,GAClBg3B,GAAkBxtB,GAClBmpC,GAAmBx2B,GACnB7S,GAAW8S,EACX6a,GAAwB5a,GACxBu2B,GAA2Bt2B,GAC3B+K,GAASwrB,GACT/nD,GAAO,kBACPia,GAAe,CAAC,QAAS,SAAU,cAAe,QAAS,cAAe,QAAQ,EAClFiuC,OAA2C1pC,GAAS,SAASxe,GAAMia,GAAc,SAAU4E,EAAM,CACnG,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACd4e,EAAc5e,EAAK,YACnBpM,EAAQoM,EAAK,MACbG,EAAcH,EAAK,YACnBsrB,EAAStrB,EAAK,OACZ6pB,KAAqBsD,GAAgB,sBAAsB,CAC7D,MAAO9qC,CACX,CAAG,EACG0rC,KAAoBM,GAAc,qBAAqB,CACzD,MAAOhsC,EACP,YAAau8B,CACjB,CAAG,EACG4pB,KAAsBQ,GAAiB,uBAAuB,CAChE,MAAO3mD,EACP,YAAau8B,CACjB,CAAG,EACGgM,KAAqByC,GAAgB,sBAAsB,CAC7D,MAAOhrC,EACP,YAAa8d,CACjB,CAAG,EACGsmB,KAAoBoB,GAAe,qBAAqB,CAC1D,MAAOxlC,EACP,YAAau8B,CACjB,CAAG,EACGwI,KAAmBW,GAAc,oBAAoB,CACvD,MAAO1lC,CACX,CAAG,EACGiqC,KAA2BgB,GAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EACGod,KAA8BO,GAAyB,+BAA+B,CACxF,MAAO5mD,EACP,OAAQqe,CACZ,CAAG,EAyBD,OAAOre,EAAMlB,GAAM,CACjB,iBAAkBu8B,GAAO,sBACzB,uBAAwBT,GAAS,yBACjC,mCAAoC56B,EAAM,YAAY,SAAUkK,EAAM,CACpE,OAAO,SAAUhP,EAAG,EAAG,CAErB,OAAIqhC,EAAY,EAAG,CAAC,EACXrhC,EAAE,QAEJkpC,EAAclpC,EAAG,EAAGgP,EAAM,EAAK,CAC9C,CACA,CAAK,EACD,kCAAmClK,EAAM,YAAY,SAAUkK,EAAM,CACnE,OAAO,SAAUhP,EAAG,EAAG,CAErB,OAAIqhC,EAAY,EAAG,CAAC,EACXrhC,EAAE,QAEJ6pC,EAAa7pC,EAAG,EAAGgP,EAAM,EAAK,CAC7C,CACA,CAAK,EACD,mCAAoClK,EAAM,YAAY,SAAUkK,EAAM,CACpE,OAAO,SAAUhP,EAAG,EAAG,CAErB,OAAIqhC,EAAYrhC,EAAG,CAAC,EACXqW,EAAM,EAAE,KAAM,EAAE,EAAE,QAAO,CAAE,EAE7Bg3B,EAAe,EAAGrtC,EAAGgP,EAAM,EAAI,CAC9C,CACA,CAAK,EACD,kCAAmClK,EAAM,YAAY,SAAUkK,EAAM,CACnE,OAAO,SAAUhP,EAAG,EAAG,CAErB,OAAIqhC,EAAYrhC,EAAG,CAAC,EACXqW,EAAM,EAAE,KAAM,EAAE,EAAE,QAAO,CAAE,EAE7BwzB,EAAa,EAAG7pC,EAAGgP,EAAM,EAAI,CAC5C,CACA,CAAK,CACL,EAAKm8C,EAAyBpc,EAAqB,CAC/C,GAAIkc,EACJ,GAAI3e,EACJ,GAAIkE,CACL,CAAA,CAAC,CACJ,CAAC,EACDqb,GAAA,sBAAgCC,cC5HhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAIjb,IAAgB1zC,GAChBktC,IAAiBvqC,GACjByqC,IAAgBlpC,GAChBsuC,IAAkB7rC,GAClB+rC,IAAkBh3B,GAClB2yC,IAAmBnpC,GACnBF,IAAW6S,EACX8a,IAAwB7a,GACxBiL,IAAShL,GACTu2B,IAA2Bt2B,GAC3BxxB,GAAO,gBACPia,IAAe,CAAC,QAAS,SAAU,cAAe,QAAS,cAAe,QAAQ,EAClFmuC,OAAyC5pC,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACjG,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACd4e,EAAc5e,EAAK,YACnBpM,EAAQoM,EAAK,MACbG,EAAcH,EAAK,YACnBsrB,EAAStrB,EAAK,OACZ6pB,KAAqBsD,IAAgB,sBAAsB,CAC7D,MAAO9qC,CACX,CAAG,EACG0rC,KAAoBM,IAAc,qBAAqB,CACzD,MAAOhsC,EACP,YAAau8B,CACjB,CAAG,EACG4pB,KAAsBQ,IAAiB,uBAAuB,CAChE,MAAO3mD,EACP,YAAau8B,CACjB,CAAG,EACGgM,KAAqByC,IAAgB,sBAAsB,CAC7D,MAAOhrC,EACP,YAAa8d,CACjB,CAAG,EACGsmB,KAAoBoB,IAAe,qBAAqB,CAC1D,MAAOxlC,EACP,YAAau8B,CACjB,CAAG,EACGwI,KAAmBW,IAAc,oBAAoB,CACvD,MAAO1lC,CACX,CAAG,EACGiqC,KAA2BgB,IAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EACGod,KAA8BO,IAAyB,+BAA+B,CACxF,MAAO5mD,EACP,OAAQqe,CACZ,CAAG,EA0BD,OAAOre,EAAMlB,GAAM,CACjB,iBAAkBu8B,IAAO,oBAGzB,mCAAoCr7B,EAAM,YAAY,SAAUkK,EAAM,CACpE,OAAO,SAAUhP,EAAG,EAAG,CAErB,OAAIqhC,EAAY,EAAG,CAAC,EACXrhC,EAAE,QAEJkpC,EAAclpC,EAAG,EAAGgP,EAAM,EAAK,CAC9C,CACA,CAAK,EACD,kCAAmClK,EAAM,YAAY,SAAUkK,EAAM,CACnE,OAAO,SAAUhP,EAAG,EAAG,CAErB,OAAIqhC,EAAY,EAAG,CAAC,EACXrhC,EAAE,QAEJ6pC,EAAa7pC,EAAG,EAAGgP,EAAM,EAAK,CAC7C,CACA,CAAK,EACD,mCAAoClK,EAAM,YAAY,SAAUkK,EAAM,CACpE,OAAO,SAAUhP,EAAG,EAAG,CAErB,OAAIqhC,EAAYrhC,EAAG,CAAC,EACXqW,EAAM,EAAE,KAAM,EAAE,EAAE,QAAO,CAAE,EAE7Bg3B,EAAe,EAAGrtC,EAAGgP,EAAM,EAAI,CAC9C,CACA,CAAK,EACD,kCAAmClK,EAAM,YAAY,SAAUkK,EAAM,CACnE,OAAO,SAAUhP,EAAG,EAAG,CAErB,OAAIqhC,EAAYrhC,EAAG,CAAC,EACXqW,EAAM,EAAE,KAAM,EAAE,EAAE,QAAO,CAAE,EAE7BwzB,EAAa,EAAG7pC,EAAGgP,EAAM,EAAI,CAC5C,CACA,CAAK,CACL,EAAKm8C,EAAyBpc,EAAqB,CAC/C,GAAIkc,EACJ,GAAI3e,EACJ,GAAIkE,CACL,CAAA,CAAC,CACJ,CAAC,EACDub,GAAA,oBAA8BC,cC7H9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAInb,IAAgB1zC,GAChBktC,IAAiBvqC,GACjByqC,IAAgBlpC,GAChByvC,IAAiBhtC,GACjBqe,IAAWtJ,EACXi3B,IAAwBztB,GACxB6d,IAASlL,GACTrxB,GAAO,MACPia,IAAe,CAAC,QAAS,SAAU,cAAe,QAAS,MAAO,QAAQ,EAC1EquC,OAA+B9pC,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACd4e,EAAc5e,EAAK,YACnBpM,EAAQoM,EAAK,MACb42B,EAAM52B,EAAK,IACXsrB,EAAStrB,EAAK,OACZ+tB,KAAoBM,IAAc,qBAAqB,CACzD,MAAOhsC,EACP,YAAau8B,CACjB,CAAG,EACGsP,KAAqBI,IAAe,sBAAsB,CAC5D,MAAOjsC,EACP,YAAau8B,CACjB,CAAG,EACG6H,KAAoBoB,IAAe,qBAAqB,CAC1D,MAAOxlC,EACP,YAAau8B,CACjB,CAAG,EACGwI,KAAmBW,IAAc,oBAAoB,CACvD,MAAO1lC,CACX,CAAG,EACGiqC,KAA2BgB,IAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EA8BD,OAAOjpC,EAAMlB,GAAM,CACjB,iBAAkBu8B,IAAO,UACzB,mBAAoB,SAAwBngC,EAAGqX,EAAG,CAChD,OAAQrX,EAAE,KAAO,GAAKA,EAAE,KAAO,KAAOqX,EAAE,KAAO,GAAKA,EAAE,KAAO,EAC9D,EACD,uBAAwB,SAA4BrX,EAAGqX,EAAG,CACxD,MAAO,CAACrX,EAAE,UAAY,CAACqX,EAAE,OAAM,GAAM,CAACrX,EAAE,MAAO,GAAI,CAACqX,EAAE,MAAK,CAC5D,EACD,aAAcvS,EAAM,YAAY,SAAUkK,EAAM,CAC9C,OAAO,SAAUhP,EAAGqX,EAAG,CACrB,OAAOrI,EAAKhP,EAAE,OAAS,EAAGqX,EAAE,OAAS,CAAC,CAC9C,CACA,CAAK,EACD,oBAAqBvS,EAAM,YAAY,SAAUkK,EAAM,CACrD,OAAO,SAAUhP,EAAGqX,EAAG,CAErB,OAAIgiC,EAAIhiC,CAAC,EAEAhB,EAAMrW,EAAE,KAAM,EAAEA,EAAE,QAAO,CAAE,EAE7BkpC,EAAclpC,EAAGqX,EAAGrI,EAAM,EAAK,CAC9C,CACA,CAAK,EACD,mBAAoBlK,EAAM,YAAY,SAAUkK,EAAM,CACpD,OAAO,SAAUhP,EAAGqX,EAAG,CAErB,OAAIgiC,EAAIhiC,CAAC,EAEAhB,EAAMrW,EAAE,KAAM,EAAEA,EAAE,QAAO,CAAE,EAE7B6pC,EAAa7pC,EAAGqX,EAAGrI,EAAM,EAAK,CAC7C,CACA,CAAK,EACD,oBAAqBlK,EAAM,YAAY,SAAUkK,EAAM,CACrD,OAAO,SAAUhP,EAAGqX,EAAG,CAErB,OAAIgiC,EAAIr5C,CAAC,EAEAqW,EAAMrW,EAAE,KAAM,EAAEA,EAAE,QAAO,CAAE,EAE7BkpC,EAAc7xB,EAAGrX,EAAGgP,EAAM,EAAI,CAC7C,CACA,CAAK,EACD,mBAAoBlK,EAAM,YAAY,SAAUkK,EAAM,CACpD,OAAO,SAAUhP,EAAGqX,EAAG,CAErB,OAAIgiC,EAAIr5C,CAAC,EAEAqW,EAAMrW,EAAE,KAAM,EAAEA,EAAE,QAAO,CAAE,EAE7B6pC,EAAaxyB,EAAGrX,EAAGgP,EAAM,EAAI,CAC5C,CACA,CAAK,EACD,aAAclK,EAAM,YAAY,SAAUkK,EAAM,CAC9C,OAAO,SAAUhP,EAAGqX,EAAG,CAErB,OAAOrI,EAAKmU,EAAOnjB,CAAC,EAAGqX,CAAC,EAAE,SAClC,CACA,CAAK,EACD,aAAcvS,EAAM,YAAY,SAAUkK,EAAM,CAC9C,OAAO,SAAUhP,EAAGqX,EAAG,CAErB,OAAOrI,EAAKhP,EAAGmjB,EAAO9L,CAAC,CAAC,EAAE,SAClC,CACA,CAAK,CACF,EAAE03B,EAAqB,CACtB,GAAI4B,EACJ,GAAIH,CACL,CAAA,CAAC,CACJ,CAAC,EACDyb,GAAA,UAAoBC,cC3IpB,OAAO,eAAe5hC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACDA,GAAA,oBAA8BA,GAAA,cAAwB,OACtD,IAAIgX,IAAelkC,GACf6a,IAAUlY,GACVqiB,GAAW9gB,EACX2wC,IAAiBluC,GACjBwmC,IAAiBzxB,GACjBo5B,IAAkB5vB,GAClBytB,IAAwB9a,GACxBsM,IAAgBrM,GAChBtxB,GAAO,UACPia,IAAe,CAAC,QAAS,SAAU,SAAU,cAAe,YAAa,WAAY,cAAe,QAAQ,EAC5GsuC,OAAmC/pC,GAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC3F,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACd4e,EAAc5e,EAAK,YACnBU,EAASV,EAAK,OACdC,EAAYD,EAAK,UACjBI,EAAWJ,EAAK,SAChBG,EAAcH,EAAK,YACnBsrB,EAAStrB,EAAK,OACZ+uB,KAAoBS,IAAe,qBAAqB,CAC1D,MAAOntC,CACX,CAAG,EACG4sC,KAAqBQ,IAAgB,sBAAsB,CAC7D,MAAOptC,EACP,YAAau8B,CACjB,CAAG,EACGqI,KAAoBa,IAAe,qBAAqB,CAC1D,MAAOzlC,EACP,YAAa8d,CACjB,CAAG,EACGmsB,KAA2BgB,IAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EACG5M,KAAmBI,IAAc,oBAAoB,CACvD,MAAOz8B,CACX,CAAG,EAuCD,OAAOA,EAAMlB,GAAMwoD,GAAoB,CACrC,MAAOtnD,EACP,OAAQ9H,CACZ,CAAG,EAAG,CACF,mBAAoB,SAAwBgD,EAAGqX,EAAG,CAChD,OAAOrX,IAAMqX,EAAI,EAAIrX,EAAIqX,EAAI,EAAI,EAClC,EACD,uBAAwB,SAA4BrX,EAAGqX,EAAG,CACxD,SAAWiqB,IAAa,aAAathC,EAAGqX,EAAGra,EAAO,OAAO,EAAI,IAAI0lB,EAAU,CAAC,EAAI,IAAIA,EAAU1iB,EAAE,IAAIqX,CAAC,CAAC,CACvG,EACD,qBAAsB,SAA0BrX,EAAGqX,EAAG,CACpD,OAAO,IAAIwL,EAAS7iB,EAAE,QAAQqX,CAAC,CAAC,CACjC,EACD,mBAAoB,UAA0B,CAC5C,MAAM,IAAI,UAAU,qDAAqD,CAC1E,CACL,EAAK8pB,EAAc4N,EAAqB,CACpC,GAAI2C,EACJ,GAAIF,EACJ,GAAI9H,CACL,CAAA,CAAC,CACJ,CAAC,EACoBpf,GAAA,cAAG6hC,IACxB,IAAIC,MAAyChqC,GAAS,SAASxe,GAAM,CAAC,QAAS,QAAQ,EAAG,SAAU89B,EAAO,CACzG,IAAI58B,EAAQ48B,EAAM,MAChB1kC,EAAS0kC,EAAM,OACjB,OAAO58B,EAAMlB,GAAM,CACjB,iBAAkB,SAAsB5D,EAAGqX,EAAG,CAC5C,SAAWY,IAAQ,aAAajY,EAAGqX,EAAGra,EAAO,OAAO,EAAI,EAAIgD,EAAIqX,EAAI,EAAI,EACzE,CACL,CAAG,CACH,CAAC,EACDiT,GAAA,oBAA8B8hC,aChH1B5vD,IAAyBY,GAC7B,OAAO,eAAeivD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAIC,GAAyB9vD,IAAuBuD,EAAkC,EAClFsB,GAAMC,GACN8gB,IAAWre,EACXH,GAAO,iBACPia,IAAe,CAAC,QAAS,SAAS,EAClC0uC,OAA0CnqC,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAClG,IAAI3d,EAAQ2d,EAAK,MACf6H,EAAU7H,EAAK,QACb+pC,EAAkBliC,EAAQ,WAAW,iBAAiB,EAsE1D,OAAOxlB,EAAMlB,GAAM,CACjB,WAAY6oD,CAChB,CAAG,EAED,SAASA,EAAgBzsD,EAAGqX,EAAG,CAC7B,IAAIq1C,KAAYrrD,GAAI,QAAQrB,CAAC,EACzB2sD,KAAYtrD,GAAI,QAAQgW,CAAC,EACzBnL,EAGJ,IAAKwgD,IAAU,UAAYA,IAAU,aAAeA,IAAU,cAAgBC,IAAU,UAAYA,IAAU,aAAeA,IAAU,YAErI,OADAzgD,EAAIoe,EAAQtqB,EAAGqX,CAAC,EACZnL,EAAE,SAAU,IAAK,IAEZA,EAAI,EAAI,EAAI,MAERogD,GAAuB,SAAYI,EAAOC,CAAK,EAK9D,IAAIC,EAAW,CAAC,QAAS,cAAe,cAAc,EACtD,GAAIA,EAAS,SAASF,CAAK,GAAKE,EAAS,SAASD,CAAK,EAErD,OADAzgD,EAAI2gD,EAAyBJ,EAAiBzsD,EAAGqX,CAAC,EAC9CnL,IAAM,EACDA,KAEIogD,GAAuB,SAAYI,EAAOC,CAAK,EAK9D,GAAID,IAAUC,EACZ,SAAWL,GAAuB,SAAYI,EAAOC,CAAK,EAE5D,GAAID,IAAU,UACZ,OAAOI,IAAsB9sD,EAAGqX,CAAC,EAEnC,GAAIq1C,IAAU,OACZ,OAAI1sD,EAAE,UAAUqX,CAAC,EACRo1C,EAAgBzsD,EAAE,MAAOqX,EAAE,KAAK,EAIlC01C,EAAcN,EAAiBzsD,EAAE,YAAW,EAAIqX,EAAE,YAAW,CAAE,EAExE,GAAIq1C,IAAU,UACZ,OAAOF,EAAgBxsD,EAAGqX,CAAC,EAE7B,GAAIq1C,IAAU,SACZ,SAAWJ,GAAuB,SAAYtsD,EAAGqX,CAAC,EAEpD,GAAIq1C,IAAU,SACZ,OAAOM,EAAeP,EAAiBzsD,EAAGqX,CAAC,EAK7C,GAHIq1C,IAAU,QAGVA,IAAU,YACZ,MAAO,GAIT,MAAM,IAAI,UAAU,8BAAgCA,EAAQ,GAAG,CAChE,CASD,SAASG,EAAyBR,EAAgBrsD,EAAGqX,EAAG,CACtD,SAAQhW,GAAI,gBAAgBrB,CAAC,MAASqB,GAAI,gBAAgBgW,CAAC,EAClD01C,EAAcV,EAAgBrsD,EAAE,OAAM,EAAG,OAAQqX,EAAE,SAAS,MAAM,KAEnEhW,GAAI,gBAAgBrB,CAAC,EAEpB6sD,EAAyBR,EAAgBrsD,EAAE,QAAS,EAAEqX,CAAC,KAExDhW,GAAI,gBAAgBgW,CAAC,EAEpBw1C,EAAyBR,EAAgBrsD,EAAGqX,EAAE,QAAS,CAAA,KAIxDhW,GAAI,eAAerB,CAAC,EACnB6sD,EAAyBR,EAAgBrsD,EAAE,OAAM,EAAG,KAAMqX,CAAC,KAE5DhW,GAAI,eAAegW,CAAC,EACnBw1C,EAAyBR,EAAgBrsD,EAAGqX,EAAE,OAAM,EAAG,IAAI,EAI/D,MAAM,QAAQrX,CAAC,EAGf,MAAM,QAAQqX,CAAC,EAGb01C,EAAcV,EAAgBrsD,EAAGqX,CAAC,EAFhCw1C,EAAyBR,EAAgBrsD,EAAG,CAACqX,CAAC,CAAC,EAH/Cw1C,EAAyBR,EAAgB,CAACrsD,CAAC,EAAGqX,CAAC,CAMzD,CAaD,SAAS01C,EAAcV,EAAgBrsD,EAAGqX,EAAG,CAE3C,QAASxa,EAAI,EAAG8Q,EAAK,KAAK,IAAI3N,EAAE,OAAQqX,EAAE,MAAM,EAAGxa,EAAI8Q,EAAI9Q,IAAK,CAC9D,IAAI4wB,EAAI4+B,EAAersD,EAAEnD,CAAC,EAAGwa,EAAExa,CAAC,CAAC,EACjC,GAAI4wB,IAAM,EACR,OAAOA,CAEV,CAGD,OAAIztB,EAAE,OAASqX,EAAE,OACR,EAELrX,EAAE,OAASqX,EAAE,OACR,GAIF,CACR,CAYD,SAAS21C,EAAeX,EAAgBrsD,EAAGqX,EAAG,CAC5C,IAAI41C,EAAQ,OAAO,KAAKjtD,CAAC,EACrBktD,EAAQ,OAAO,KAAK71C,CAAC,EAGzB41C,EAAM,KAAKX,GAAuB,OAAU,EAC5CY,EAAM,KAAKZ,GAAuB,OAAU,EAC5C,IAAIpgD,EAAI6gD,EAAcV,EAAgBY,EAAOC,CAAK,EAClD,GAAIhhD,IAAM,EACR,OAAOA,EAIT,QAASrP,EAAI,EAAGA,EAAIowD,EAAM,OAAQpwD,IAAK,CACrC,IAAI4wB,EAAI4+B,EAAersD,EAAEitD,EAAMpwD,CAAC,CAAC,EAAGwa,EAAE61C,EAAMrwD,CAAC,CAAC,CAAC,EAC/C,GAAI4wB,IAAM,EACR,OAAOA,CAEV,CACD,MAAO,EACR,CACH,CAAC,EAY2B4+B,GAAA,qBAAGE,IAC/B,SAASO,IAAsB9sD,EAAGqX,EAAG,CACnC,OAAIrX,EAAE,GAAKqX,EAAE,GACJ,EAELrX,EAAE,GAAKqX,EAAE,GACJ,GAELrX,EAAE,GAAKqX,EAAE,GACJ,EAELrX,EAAE,GAAKqX,EAAE,GACJ,GAEF,CACT,WCrRA,OAAO,eAAeoB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACDA,GAAA,wBAAkCA,GAAA,kBAA4B,OAC9D,IAAIqC,GAAU1d,GACVglB,GAAWriB,EACXgwC,IAAwBzuC,GACxBsC,GAAO,cACPia,IAAe,CAAC,QAAS,SAAU,QAAQ,EAC/C/C,GAAQ,YAAY,UAAY,WAChC,IAAIqyC,OAAuC/qC,GAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC/F,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdsrB,EAAStrB,EAAK,OACZssB,KAA2BgB,IAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EA8BD,OAAOjpC,EAAMlB,GAAMkX,GAAQ,YAAai0B,EAAqB,CAC3D,KAAMj0B,GAAQ,YACd,GAAI,EACL,CAAA,CAAC,CACJ,CAAC,EACwBrC,GAAA,kBAAG00C,IAC5B,IAAIC,OAA6ChrC,GAAS,SAASxe,GAAM,CAAC,OAAO,EAAG,SAAU89B,EAAO,CACnG,IAAI58B,EAAQ48B,EAAM,MAClB,OAAO58B,EAAMlB,GAAMkX,GAAQ,WAAW,CACxC,CAAC,EACDrC,GAAA,wBAAkC20C,cC1DlC,OAAO,eAAehX,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACDA,GAAA,kBAA4BA,GAAA,YAAsB,OAClD,IAAIh0B,GAAWhlB,EACX60C,IAAiBlyC,GACjB+4C,IAAiBx3C,GACjBipC,IAAiBxmC,GACjBgsC,IAAwBj3B,GACxBlV,GAAO,QACPia,IAAe,CAAC,QAAS,SAAU,cAAe,cAAe,QAAQ,EACzEwvC,OAAiCjrC,GAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACd4e,EAAc5e,EAAK,YACnBG,EAAcH,EAAK,YACnBsrB,EAAStrB,EAAK,OACZ+uB,KAAoBS,IAAe,qBAAqB,CAC1D,MAAOntC,CACX,CAAG,EACG6zC,KAAoBG,IAAe,qBAAqB,CAC1D,MAAOh0C,EACP,YAAa8d,CACjB,CAAG,EACG8mB,KAAoBa,IAAe,qBAAqB,CAC1D,MAAOzlC,EACP,YAAa8d,CACjB,CAAG,EACGmsB,KAA2BgB,IAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EA8CD,OAAOjpC,EAAMlB,GAAM0pD,GAAkB,CACnC,MAAOxoD,EACP,YAAau8B,CACd,CAAA,EAAG0N,EAAqB,CACvB,KAAM1N,EACN,GAAIsX,EACJ,GAAInH,EACJ,GAAI9H,CACL,CAAA,CAAC,CACJ,CAAC,EACkB0M,GAAA,YAAGiX,IACtB,IAAIC,MAAwBlrC,GAAS,SAASxe,GAAM,CAAC,QAAS,aAAa,EAAG,SAAU89B,EAAO,CAC7F,IAAI58B,EAAQ48B,EAAM,MAChBL,EAAcK,EAAM,YACtB,OAAO58B,EAAMlB,GAAM,CACjB,WAAY,SAAgB5D,EAAGqX,EAAG,CAEhC,OAAIrX,IAAM,KACDqX,IAAM,KAEXA,IAAM,KACDrX,IAAM,KAEXA,IAAM,OACDqX,IAAM,OAEXA,IAAM,OACDrX,IAAM,OAERqhC,EAAYrhC,EAAGqX,CAAC,CACxB,CACL,CAAG,CACH,CAAC,EACD++B,GAAA,kBAA4BkX,aC/G5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAInrC,IAAWhlB,EACXwG,GAAO,YACPia,IAAe,CAAC,QAAS,cAAe,QAAQ,EAChD2vC,OAAqCprC,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC7F,IAAI3d,EAAQ2d,EAAK,MACfhK,EAAcgK,EAAK,YACnBke,EAASle,EAAK,OA2BhB,OAAO3d,EAAMlB,GAAM,CACjB,WAAY,SAAgB5D,EAAGqX,EAAG,CAChC,OAAOspB,EAAOloB,EAAYzY,EAAGqX,CAAC,CAAC,CAChC,CACL,CAAG,CACH,CAAC,EACDk2C,GAAA,gBAA0BC,cC3C1B,OAAO,eAAenX,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACDA,GAAA,oBAA8BA,GAAA,cAAwB,OACtD,IAAI/U,IAAelkC,GACf6a,IAAUlY,GACVqiB,GAAW9gB,EACX2wC,IAAiBluC,GACjB+0C,IAAiBhgC,GACjByxB,IAAiBjoB,GACjBytB,IAAwB9a,GACxBsM,IAAgBrM,GAChBtxB,GAAO,UACPia,IAAe,CAAC,QAAS,SAAU,SAAU,cAAe,QAAQ,EACpE4vC,OAAmCrrC,GAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC3F,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdU,EAASV,EAAK,OACdG,EAAcH,EAAK,YACnBsrB,EAAStrB,EAAK,OACZ+uB,KAAoBS,IAAe,qBAAqB,CAC1D,MAAOntC,CACX,CAAG,EACG6zC,KAAoBG,IAAe,qBAAqB,CAC1D,MAAOh0C,EACP,YAAa8d,CACjB,CAAG,EACG8mB,KAAoBa,IAAe,qBAAqB,CAC1D,MAAOzlC,EACP,YAAa8d,CACjB,CAAG,EACGmsB,KAA2BgB,IAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EACG5M,KAAmBI,IAAc,oBAAoB,CACvD,MAAOz8B,CACX,CAAG,EAiCD,OAAOA,EAAMlB,GAAM8pD,GAAoB,CACrC,MAAO5oD,EACP,OAAQ9H,CACZ,CAAG,EAAG,CACF,mBAAoB,SAAwBgD,EAAGqX,EAAG,CAChD,OAAOrX,EAAIqX,CACZ,EACD,uBAAwB,SAA4BrX,EAAGqX,EAAG,CACxD,OAAOrX,EAAE,GAAGqX,CAAC,GAAK,IAAKiqB,IAAa,aAAathC,EAAGqX,EAAGra,EAAO,OAAO,CACtE,EACD,qBAAsB,SAA0BgD,EAAGqX,EAAG,CACpD,OAAOrX,EAAE,QAAQqX,CAAC,IAAM,EACzB,EACD,mBAAoB,SAAwBrX,EAAGqX,EAAG,CAChD,MAAM,IAAI,UAAU,qDAAqD,CAC1E,CACL,EAAK8pB,EAAc4N,EAAqB,CACpC,GAAI4J,EACJ,GAAInH,EACJ,GAAI9H,CACL,CAAA,CAAC,CACJ,CAAC,EACoB2M,GAAA,cAAGoX,IACxB,IAAIC,MAAyCtrC,GAAS,SAASxe,GAAM,CAAC,QAAS,QAAQ,EAAG,SAAU89B,EAAO,CACzG,IAAI58B,EAAQ48B,EAAM,MAChB1kC,EAAS0kC,EAAM,OACjB,OAAO58B,EAAMlB,GAAM,CACjB,iBAAkB,SAAsB5D,EAAGqX,EAAG,CAC5C,OAAOrX,EAAIqX,GAAK,IAAKY,IAAQ,aAAajY,EAAGqX,EAAGra,EAAO,OAAO,CAC/D,CACL,CAAG,CACH,CAAC,EACDq5C,GAAA,oBAA8BqX,aCvG9B,OAAO,eAAe3P,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACDA,GAAA,sBAAgCA,GAAA,gBAA0B,OAC1D,IAAIzc,IAAelkC,GACf6a,IAAUlY,GACVqiB,GAAW9gB,EACX2wC,IAAiBluC,GACjB+0C,IAAiBhgC,GACjByxB,IAAiBjoB,GACjBytB,IAAwB9a,GACxBsM,IAAgBrM,GAChBtxB,GAAO,YACPia,IAAe,CAAC,QAAS,SAAU,SAAU,cAAe,QAAQ,EACpE8vC,OAAqCvrC,GAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC7F,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdU,EAASV,EAAK,OACdG,EAAcH,EAAK,YACnBsrB,EAAStrB,EAAK,OACZ+uB,KAAoBS,IAAe,qBAAqB,CAC1D,MAAOntC,CACX,CAAG,EACG6zC,KAAoBG,IAAe,qBAAqB,CAC1D,MAAOh0C,EACP,YAAa8d,CACjB,CAAG,EACG8mB,KAAoBa,IAAe,qBAAqB,CAC1D,MAAOzlC,EACP,YAAa8d,CACjB,CAAG,EACGmsB,KAA2BgB,IAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EACG5M,KAAmBI,IAAc,oBAAoB,CACvD,MAAOz8B,CACX,CAAG,EA6BD,OAAOA,EAAMlB,GAAMgqD,GAAsB,CACvC,MAAO9oD,EACP,OAAQ9H,CACZ,CAAG,EAAG,CACF,mBAAoB,SAAwBgD,EAAGqX,EAAG,CAChD,OAAOrX,GAAKqX,CACb,EACD,uBAAwB,SAA4BrX,EAAGqX,EAAG,CACxD,OAAOrX,EAAE,IAAIqX,CAAC,MAASiqB,IAAa,aAAathC,EAAGqX,EAAGra,EAAO,OAAO,CACtE,EACD,qBAAsB,SAA0BgD,EAAGqX,EAAG,CACpD,OAAOrX,EAAE,QAAQqX,CAAC,IAAM,CACzB,EACD,mBAAoB,UAA0B,CAC5C,MAAM,IAAI,UAAU,qDAAqD,CAC1E,CACL,EAAK8pB,EAAc4N,EAAqB,CACpC,GAAI4J,EACJ,GAAInH,EACJ,GAAI9H,CACL,CAAA,CAAC,CACJ,CAAC,EACsBqU,GAAA,gBAAG4P,IAC1B,IAAIC,MAA2CxrC,GAAS,SAASxe,GAAM,CAAC,QAAS,QAAQ,EAAG,SAAU89B,EAAO,CAC3G,IAAI58B,EAAQ48B,EAAM,MAChB1kC,EAAS0kC,EAAM,OACjB,OAAO58B,EAAMlB,GAAM,CACjB,iBAAkB,SAAsB5D,EAAGqX,EAAG,CAC5C,OAAOrX,GAAKqX,MAASY,IAAQ,aAAajY,EAAGqX,EAAGra,EAAO,OAAO,CAC/D,CACL,CAAG,CACH,CAAC,EACD+gD,GAAA,sBAAgC6P,aCnGhC,OAAO,eAAe5P,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACDA,GAAA,mBAA6BA,GAAA,aAAuB,OACpD,IAAI1c,IAAelkC,GACf6a,IAAUlY,GACVqiB,GAAW9gB,EACX2wC,IAAiBluC,GACjB+0C,IAAiBhgC,GACjByxB,IAAiBjoB,GACjBytB,IAAwB9a,GACxBsM,IAAgBrM,GAChBtxB,GAAO,SACPia,IAAe,CAAC,QAAS,SAAU,SAAU,cAAe,QAAQ,EACpEgwC,OAAkCzrC,GAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC1F,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdU,EAASV,EAAK,OACdG,EAAcH,EAAK,YACnBsrB,EAAStrB,EAAK,OACZ+uB,KAAoBS,IAAe,qBAAqB,CAC1D,MAAOntC,CACX,CAAG,EACG6zC,KAAoBG,IAAe,qBAAqB,CAC1D,MAAOh0C,EACP,YAAa8d,CACjB,CAAG,EACG8mB,KAAoBa,IAAe,qBAAqB,CAC1D,MAAOzlC,EACP,YAAa8d,CACjB,CAAG,EACGmsB,KAA2BgB,IAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EACG5M,KAAmBI,IAAc,oBAAoB,CACvD,MAAOz8B,CACX,CAAG,EAiCD,OAAOA,EAAMlB,GAAMkqD,GAAmB,CACpC,MAAOhpD,EACP,OAAQ9H,CACZ,CAAG,EAAG,CACF,mBAAoB,SAAwBgD,EAAGqX,EAAG,CAChD,OAAOrX,EAAIqX,CACZ,EACD,uBAAwB,SAA4BrX,EAAGqX,EAAG,CACxD,OAAOrX,EAAE,GAAGqX,CAAC,GAAK,IAAKiqB,IAAa,aAAathC,EAAGqX,EAAGra,EAAO,OAAO,CACtE,EACD,qBAAsB,SAA0BgD,EAAGqX,EAAG,CACpD,OAAOrX,EAAE,QAAQqX,CAAC,IAAM,CACzB,EACD,mBAAoB,UAA0B,CAC5C,MAAM,IAAI,UAAU,qDAAqD,CAC1E,CACL,EAAK8pB,EAAc4N,EAAqB,CACpC,GAAI4J,EACJ,GAAInH,EACJ,GAAI9H,CACL,CAAA,CAAC,CACJ,CAAC,EACmBsU,GAAA,aAAG6P,IACvB,IAAIC,MAAwC1rC,GAAS,SAASxe,GAAM,CAAC,QAAS,QAAQ,EAAG,SAAU89B,EAAO,CACxG,IAAI58B,EAAQ48B,EAAM,MAChB1kC,EAAS0kC,EAAM,OACjB,OAAO58B,EAAMlB,GAAM,CACjB,iBAAkB,SAAsB5D,EAAGqX,EAAG,CAC5C,OAAOrX,EAAIqX,GAAK,IAAKY,IAAQ,aAAajY,EAAGqX,EAAGra,EAAO,OAAO,CAC/D,CACL,CAAG,CACH,CAAC,EACDghD,GAAA,mBAA6B8P,aCvG7B,OAAO,eAAe7P,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACDA,GAAA,qBAA+BA,GAAA,eAAyB,OACxD,IAAI3c,IAAelkC,GACf6a,IAAUlY,GACVqiB,GAAW9gB,EACX2wC,IAAiBluC,GACjB+0C,IAAiBhgC,GACjByxB,IAAiBjoB,GACjBytB,IAAwB9a,GACxBsM,IAAgBrM,GAChBtxB,GAAO,WACPia,IAAe,CAAC,QAAS,SAAU,SAAU,cAAe,QAAQ,EACpEkwC,OAAoC3rC,GAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC5F,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdU,EAASV,EAAK,OACdG,EAAcH,EAAK,YACnBsrB,EAAStrB,EAAK,OACZ+uB,KAAoBS,IAAe,qBAAqB,CAC1D,MAAOntC,CACX,CAAG,EACG6zC,KAAoBG,IAAe,qBAAqB,CAC1D,MAAOh0C,EACP,YAAa8d,CACjB,CAAG,EACG8mB,KAAoBa,IAAe,qBAAqB,CAC1D,MAAOzlC,EACP,YAAa8d,CACjB,CAAG,EACGmsB,KAA2BgB,IAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EACG5M,KAAmBI,IAAc,oBAAoB,CACvD,MAAOz8B,CACX,CAAG,EA6BD,OAAOA,EAAMlB,GAAMoqD,GAAqB,CACtC,MAAOlpD,EACP,OAAQ9H,CACZ,CAAG,EAAG,CACF,mBAAoB,SAAwBgD,EAAGqX,EAAG,CAChD,OAAOrX,GAAKqX,CACb,EACD,uBAAwB,SAA4BrX,EAAGqX,EAAG,CACxD,OAAOrX,EAAE,IAAIqX,CAAC,MAASiqB,IAAa,aAAathC,EAAGqX,EAAGra,EAAO,OAAO,CACtE,EACD,qBAAsB,SAA0BgD,EAAGqX,EAAG,CACpD,OAAOrX,EAAE,QAAQqX,CAAC,IAAM,EACzB,EACD,mBAAoB,UAA0B,CAC5C,MAAM,IAAI,UAAU,qDAAqD,CAC1E,CACL,EAAK8pB,EAAc4N,EAAqB,CACpC,GAAI4J,EACJ,GAAInH,EACJ,GAAI9H,CACL,CAAA,CAAC,CACJ,CAAC,EACqBuU,GAAA,eAAG8P,IACzB,IAAIC,MAA0C5rC,GAAS,SAASxe,GAAM,CAAC,QAAS,QAAQ,EAAG,SAAU89B,EAAO,CAC1G,IAAI58B,EAAQ48B,EAAM,MAChB1kC,EAAS0kC,EAAM,OACjB,OAAO58B,EAAMlB,GAAM,CACjB,iBAAkB,SAAsB5D,EAAGqX,EAAG,CAC5C,OAAOrX,GAAKqX,MAASY,IAAQ,aAAajY,EAAGqX,EAAGra,EAAO,OAAO,CAC/D,CACL,CAAG,CACH,CAAC,EACDihD,GAAA,qBAA+B+P,aCnG/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAI7rC,IAAWhlB,EACXwG,GAAO,YACPia,IAAe,CAAC,QAAS,OAAO,EAChCqwC,OAAqC9rC,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC7F,IAAI3d,EAAQ2d,EAAK,MACf2zB,EAAQ3zB,EAAK,MA8Bf,OAAO3d,EAAMlB,GAAM,CACjB,WAAY,SAAgB5D,EAAGqX,EAAG,CAChC,OAAO82C,EAAWnuD,EAAE,QAAS,EAAEqX,EAAE,QAAO,CAAE,CAC3C,CACL,CAAG,EAQD,SAAS82C,EAAWnuD,EAAGqX,EAAG,CACxB,GAAI,MAAM,QAAQrX,CAAC,EACjB,GAAI,MAAM,QAAQqX,CAAC,EAAG,CACpB,IAAIxV,EAAM7B,EAAE,OACZ,GAAI6B,IAAQwV,EAAE,OACZ,MAAO,GAET,QAASxa,EAAI,EAAGA,EAAIgF,EAAKhF,IACvB,GAAI,CAACsxD,EAAWnuD,EAAEnD,CAAC,EAAGwa,EAAExa,CAAC,CAAC,EACxB,MAAO,GAGX,MAAO,EACf,KACQ,OAAO,OAGT,QAAI,MAAM,QAAQwa,CAAC,EACV,GAEA++B,EAAMp2C,EAAGqX,CAAC,CAGtB,CACH,CAAC,EACD42C,GAAA,gBAA0BC,cC5E1B,OAAO,eAAeE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACDA,GAAA,oBAA8BA,GAAA,cAAwB,OACtD,IAAIhsC,GAAWhlB,EACX60C,IAAiBlyC,GACjB+4C,IAAiBx3C,GACjBipC,IAAiBxmC,GACjBgsC,IAAwBj3B,GACxBlV,GAAO,UACPia,IAAe,CAAC,QAAS,SAAU,cAAe,SAAU,cAAe,QAAQ,EACnFwwC,OAAmCjsC,GAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACvF,IAAA3d,EAAQ2d,EAAK,MACNA,EAAK,OAClB,IAAI4e,EAAc5e,EAAK,YACnBU,EAASV,EAAK,OACdG,EAAcH,EAAK,YACnBsrB,EAAStrB,EAAK,OACZ+uB,KAAoBS,IAAe,qBAAqB,CAC1D,MAAOntC,CACX,CAAG,EACG6zC,KAAoBG,IAAe,qBAAqB,CAC1D,MAAOh0C,EACP,YAAa8d,CACjB,CAAG,EACG8mB,KAAoBa,IAAe,qBAAqB,CAC1D,MAAOzlC,EACP,YAAa8d,CACjB,CAAG,EACGmsB,KAA2BgB,IAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EA6CD,OAAOjpC,EAAMlB,GAAM0qD,GAAoB,CACrC,MAAOxpD,EACP,YAAau8B,CACd,CAAA,EAAG0N,EAAqB,CACvB,KAAMwf,EACN,GAAI5V,EACJ,GAAInH,EACJ,GAAI9H,CACL,CAAA,CAAC,EACF,SAAS6kB,EAASvuD,EAAGqX,EAAG,CACtB,MAAO,CAACgqB,EAAYrhC,EAAGqX,CAAC,CACzB,CACH,CAAC,EACoB+2C,GAAA,cAAGC,IACxB,IAAIC,MAA0BlsC,GAAS,SAASxe,GAAM,CAAC,QAAS,aAAa,EAAG,SAAU89B,EAAO,CAC/F,IAAI58B,EAAQ48B,EAAM,MAChBL,EAAcK,EAAM,YACtB,OAAO58B,EAAMlB,GAAM,CACjB,WAAY,SAAgB5D,EAAGqX,EAAG,CAEhC,OAAIrX,IAAM,KACDqX,IAAM,KAEXA,IAAM,KACDrX,IAAM,KAEXA,IAAM,OACDqX,IAAM,OAEXA,IAAM,OACDrX,IAAM,OAER,CAACqhC,EAAYrhC,EAAGqX,CAAC,CACzB,CACL,CAAG,CACH,CAAC,EACD+2C,GAAA,oBAA8BE,aClH9B,OAAO,eAAeE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIntD,IAAMjE,GACN6a,IAAUlY,GACVqiB,IAAW9gB,EACXsC,GAAO,kBACPia,IAAe,CAAC,QAAS,YAAa,QAAS,SAAS,EACxD4wC,OAA2CrsC,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACnG,IAAI3d,EAAQ2d,EAAK,MACf4d,EAAY5d,EAAK,UACjBiiC,EAAQjiC,EAAK,MACb6H,EAAU7H,EAAK,QACbisC,EAAMpkC,EACNqkC,EAAO,SAAcjtD,EAAGC,EAAG,CAC7B,MAAO,CAAC2oB,EAAQ5oB,EAAGC,CAAC,CACxB,EAuCE,OAAOmD,EAAMlB,GAAM,CACjB,yBAA0B,SAA2B5D,EAAGslB,EAAG,CACzD,OAAOspC,EAAiB5uD,EAAGslB,EAAGopC,CAAG,CAClC,EACD,iCAAkC,SAAiC1uD,EAAGslB,EAAGgF,EAAS,CAChF,GAAIA,IAAY,MACd,OAAOskC,EAAiB5uD,EAAGslB,EAAGopC,CAAG,EAC5B,GAAIpkC,IAAY,OACrB,OAAOskC,EAAiB5uD,EAAGslB,EAAGqpC,CAAI,EAElC,MAAM,IAAI,MAAM,wCAAwC,CAE3D,EACD,mCAAoCC,CACxC,CAAG,EACD,SAASA,EAAiB5uD,EAAGslB,EAAGgF,EAAS,CACvC,GAAI,IAAKrS,IAAQ,WAAWqN,CAAC,GAAKA,EAAI,EACpC,MAAM,IAAI,MAAM,kCAAkC,EAEpD,MAAQjkB,IAAI,UAAUrB,CAAC,EAAG,CACxB,IAAI0V,EAAO1V,EAAE,OACb,GAAI0V,EAAK,OAAS,EAChB,MAAM,IAAI,MAAM,yCAAyC,EAE3D,OAAOm5C,EAAY7uD,EAAE,QAAS,EAAEslB,EAAGgF,CAAO,CAC3C,CACD,GAAI,MAAM,QAAQtqB,CAAC,EACjB,OAAO6uD,EAAY7uD,EAAGslB,EAAGgF,CAAO,CAEnC,CAYD,SAASukC,EAAYr8C,EAAK8S,EAAGgF,EAAS,CACpC,GAAIhF,GAAK9S,EAAI,OACX,MAAM,IAAI,MAAM,iBAAiB,EAInC,QAAS3V,EAAI,EAAGA,EAAI2V,EAAI,OAAQ3V,IAC9B,GAAIwjC,EAAU7tB,EAAI3V,CAAC,CAAC,GAAK6nD,EAAMlyC,EAAI3V,CAAC,CAAC,EACnC,OAAO2V,EAAI3V,CAAC,EAQhB,QAJIiyD,EAAO,EACPl7C,EAAKpB,EAAI,OAAS,EAGfs8C,EAAOl7C,GAAI,CAMhB,QALIkL,EAAIgwC,EACJrlC,EAAI7V,EACJm7C,EAAQv8C,EAAI,KAAK,MAAM,KAAK,UAAYoB,EAAKk7C,EAAO,EAAE,EAAIA,CAAI,EAG3DhwC,EAAI2K,GAET,GAAIa,EAAQ9X,EAAIsM,CAAC,EAAGiwC,CAAK,GAAK,EAAG,CAE/B,IAAIn3B,EAAMplB,EAAIiX,CAAC,EACfjX,EAAIiX,CAAC,EAAIjX,EAAIsM,CAAC,EACdtM,EAAIsM,CAAC,EAAI8Y,EACT,EAAEnO,CACZ,KAEU,EAAE3K,EAKFwL,EAAQ9X,EAAIsM,CAAC,EAAGiwC,CAAK,EAAI,GAC3B,EAAEjwC,EAIAwG,GAAKxG,EACPlL,EAAKkL,EAELgwC,EAAOhwC,EAAI,CAEd,CACD,OAAOtM,EAAI8S,CAAC,CACb,CACH,CAAC,EACDkpC,GAAA,sBAAgCC,cCpJhC,OAAO,eAAeO,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIpxC,IAASxgB,GACTglB,IAAWriB,EACX6D,GAAO,OACPia,IAAe,CAAC,QAAS,SAAU,UAAW,gBAAgB,EAC9DoxC,OAAgC7sC,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACd6H,EAAU7H,EAAK,QACf4pC,EAAiB5pC,EAAK,eACpBysC,EAAa5kC,EACb6kC,EAAc,SAAqBztD,EAAGC,EAAG,CAC3C,MAAO,CAAC2oB,EAAQ5oB,EAAGC,CAAC,CACxB,EAiCE,OAAOmD,EAAMlB,GAAM,CACjB,MAAO,SAAe5D,EAAG,CACvB,OAAAovD,EAAepvD,CAAC,EACTA,EAAE,KAAKkvD,CAAU,CACzB,EACD,OAAQ,SAAgBlvD,EAAG,CACzB,OAAAqvD,EAAgBrvD,CAAC,EACVmjB,EAAOnjB,EAAE,UAAU,KAAKkvD,CAAU,EAAGlvD,EAAE,QAAO,CAAE,CACxD,EACD,kBAAmB,SAAuBA,EAAGsvD,EAAa,CACxD,OAAAF,EAAepvD,CAAC,EACTA,EAAE,KAAKsvD,CAAW,CAC1B,EACD,mBAAoB,SAAwBtvD,EAAGsvD,EAAa,CAC1D,OAAAD,EAAgBrvD,CAAC,EACVmjB,EAAOnjB,EAAE,UAAU,KAAKsvD,CAAW,EAAGtvD,EAAE,QAAO,CAAE,CACzD,EACD,gBAAiB,SAAqBA,EAAGuvD,EAAO,CAC9C,OAAAH,EAAepvD,CAAC,EACTA,EAAE,KAAKsvD,EAAYC,CAAK,CAAC,CACjC,EACD,iBAAkB,SAAsBvvD,EAAGuvD,EAAO,CAChD,OAAAF,EAAgBrvD,CAAC,EACVmjB,EAAOnjB,EAAE,QAAO,EAAG,KAAKsvD,EAAYC,CAAK,CAAC,EAAGvvD,EAAE,QAAS,CAAA,CAChE,CACL,CAAG,EAOD,SAASsvD,EAAYC,EAAO,CAC1B,GAAIA,IAAU,MACZ,OAAOL,EACF,GAAIK,IAAU,OACnB,OAAOJ,EACF,GAAII,IAAU,UACnB,OAAOlD,EAEP,MAAM,IAAI,MAAM,6CAA6C,CAEhE,CAQD,SAAS+C,EAAe1rD,EAAO,CAC7B,MAAQka,IAAO,WAAWla,CAAK,EAAE,SAAW,EAC1C,MAAM,IAAI,MAAM,gCAAgC,CAEnD,CAQD,SAAS2rD,EAAgBlsC,EAAQ,CAC/B,GAAIA,EAAO,OAAO,SAAW,EAC3B,MAAM,IAAI,MAAM,iCAAiC,CAEpD,CACH,CAAC,EACD6rC,GAAA,WAAqBC,cCrHrB,OAAO,eAAer1C,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIof,GAAc57B,GACdglB,IAAWriB,EACXilD,GAAuB1jD,GACvBsC,GAAO,MACPia,IAAe,CAAC,QAAS,SAAU,UAAW,QAAQ,EACtD2xC,OAA+BptC,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdyiC,EAAUziC,EAAK,QACfu7B,EAASv7B,EAAK,OAgChB,OAAO3d,EAAMlB,GAAM,CAEjB,iBAAkB6rD,EAElB,qCAAsC,SAAoC/rD,EAAOwX,EAAK,CACpF,SAAW8d,GAAY,QAAQt1B,EAAOwX,EAAI,QAAO,EAAIw0C,CAAQ,CAC9D,EAED,MAAO,SAAWrmD,EAAM,CACtB,MAAQ2vB,GAAY,qBAAqB3vB,CAAI,EAC3C,MAAM,IAAI,UAAU,wCAAwC,EAE9D,OAAOomD,EAAKpmD,CAAI,CACjB,CACL,CAAG,EASD,SAASqmD,EAAS1vD,EAAGqX,EAAG,CACtB,GAAI,CACF,OAAO2mC,EAAOh+C,EAAGqX,CAAC,EAAIrX,EAAIqX,CAC3B,OAAQvN,EAAK,CACZ,QAAUk7C,GAAqB,qBAAqBl7C,EAAK,MAAOuN,CAAC,CAClE,CACF,CAQD,SAASo4C,EAAK/rD,EAAO,CACnB,IAAI0tB,EAYJ,MAXI4H,GAAY,aAAat1B,EAAO,SAAUlC,EAAO,CACnD,GAAI,CACE,MAAMA,CAAK,GAAK,OAAOA,GAAU,SACnC4vB,EAAM,KACGA,IAAQ,QAAa4sB,EAAOx8C,EAAO4vB,CAAG,KAC/CA,EAAM5vB,EAET,OAAQsI,EAAK,CACZ,QAAUk7C,GAAqB,qBAAqBl7C,EAAK,MAAOtI,CAAK,CACtE,CACP,CAAK,EACG4vB,IAAQ,OACV,MAAM,IAAI,MAAM,wCAAwC,EAI1D,OAAI,OAAOA,GAAQ,WACjBA,EAAM8zB,EAAQ9zB,EAAKp0B,EAAO,MAAM,GAE3Bo0B,CACR,CACH,CAAC,EACDxX,GAAA,UAAoB41C,cC1GpB,OAAO,eAAe/kD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIuuB,GAAc57B,GACdglB,IAAWriB,EACXilD,GAAuB1jD,GACvBsC,GAAO,MACPia,IAAe,CAAC,QAAS,SAAU,UAAW,SAAS,EACvD8xC,OAA+BvtC,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdyiC,EAAUziC,EAAK,QACf4zB,EAAU5zB,EAAK,QAgCjB,OAAO3d,EAAMlB,GAAM,CAEjB,iBAAkBgsD,EAElB,qCAAsC,SAAoClsD,EAAOwX,EAAK,CACpF,SAAW8d,GAAY,QAAQt1B,EAAOwX,EAAI,QAAO,EAAI20C,CAAS,CAC/D,EAED,MAAO,SAAWxmD,EAAM,CACtB,MAAQ2vB,GAAY,qBAAqB3vB,CAAI,EAC3C,MAAM,IAAI,UAAU,wCAAwC,EAE9D,OAAOumD,EAAKvmD,CAAI,CACjB,CACL,CAAG,EASD,SAASwmD,EAAU7vD,EAAGqX,EAAG,CACvB,GAAI,CACF,OAAOg/B,EAAQr2C,EAAGqX,CAAC,EAAIrX,EAAIqX,CAC5B,OAAQvN,EAAK,CACZ,QAAUk7C,GAAqB,qBAAqBl7C,EAAK,MAAOuN,CAAC,CAClE,CACF,CAQD,SAASu4C,EAAKlsD,EAAO,CACnB,IAAI+G,EAYJ,MAXIuuB,GAAY,aAAat1B,EAAO,SAAUlC,EAAO,CACnD,GAAI,CACE,MAAMA,CAAK,GAAK,OAAOA,GAAU,SACnCiJ,EAAM,KACGA,IAAQ,QAAa4rC,EAAQ70C,EAAOiJ,CAAG,KAChDA,EAAMjJ,EAET,OAAQsI,EAAK,CACZ,QAAUk7C,GAAqB,qBAAqBl7C,EAAK,MAAOtI,CAAK,CACtE,CACP,CAAK,EACGiJ,IAAQ,OACV,MAAM,IAAI,MAAM,wCAAwC,EAI1D,OAAI,OAAOA,GAAQ,WACjBA,EAAMy6C,EAAQz6C,EAAKzN,EAAO,MAAM,GAE3ByN,CACR,CACH,CAAC,EACDA,GAAA,UAAoBklD,cC1GpB,OAAO,eAAeG,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsCA,GAAA,gCAAG,OAC1C,IAAIzuD,GAAMjE,GACN0F,GAAU/C,GACVqiB,IAAW9gB,EACXsC,IAAO,uBACPia,IAAe,CAAC,UAAW,aAAa,EACxCkyC,OAAqD3tC,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CAC7G,IAAI4zB,EAAU5zB,EAAK,QACjBG,EAAcH,EAAK,YACrB,SAASqtC,EAAqB19B,EAAMC,EAAU,CAC5C,GAAI,EAAE,gBAAgBy9B,GACpB,MAAM,IAAI,YAAY,kDAAkD,EAE1E,GAAIz9B,GAAY,IAAKhxB,GAAI,UAAUgxB,CAAQ,EACzC,MAAM,IAAI,MAAM,qBAAuBA,CAAQ,EAEjD,MAAQhxB,GAAI,UAAU+wB,CAAI,MAAS/wB,GAAI,SAAS+wB,CAAI,EAAG,CAErD,IAAIjP,EAAS,IAAIP,EAAYwP,EAAMC,CAAQ,EAE3C,KAAK,MAAQlP,EAAO,MACpB,KAAK,MAAQA,EAAO,MACpB,KAAK,UAAYA,EAAO,UACxB,KAAK,KAAO,KACZ,KAAK,KAAO,IACb,SAAUiP,MAAY/wB,GAAI,SAAS+wB,EAAK,IAAI,MAAS/wB,GAAI,SAAS+wB,EAAK,IAAI,EAE1E,KAAK,MAAQA,EAAK,KAClB,KAAK,MAAQA,EAAK,KAClB,KAAK,UAAYA,EAAK,SACtB,KAAK,KAAO,OAAOA,EAAK,IAAQ,IAAcA,EAAK,IAAM,KACzD,KAAK,KAAO,OAAOA,EAAK,IAAQ,IAAcA,EAAK,IAAM,SACpD,IAAIA,EAET,MAAM,IAAI,UAAU,gCAAmC/wB,GAAI,QAAQ+wB,CAAI,EAAI,GAAG,EAG9E,KAAK,MAAQ,GACb,KAAK,MAAQ,CAAC,CAAC,EACf,KAAK,UAAYC,EACjB,KAAK,KAAO,KACZ,KAAK,KAAO,KAEf,CACD,OAAAy9B,EAAqB,UAAY,IAAIltC,EAKrCktC,EAAqB,UAAU,KAAO,uBACtCA,EAAqB,UAAU,uBAAyB,GAexDA,EAAqB,UAAU,OAAS,SAAUxmD,EAAO,CACvD,OAAQ,UAAU,OAAM,CACtB,IAAK,GACH,CAEE,IAAI6c,EAAIvD,EAAY,UAAU,OAAO,KAAK,KAAMtZ,CAAK,EAErD,SAAQjI,GAAI,UAAU8kB,CAAC,EAEd,IAAI2pC,EAAqB,CAC9B,KAAM3pC,EAAE,MACR,KAAMA,EAAE,MACR,SAAUA,EAAE,SAC1B,CAAa,EAEIA,CACR,CAEH,IAAK,GACL,IAAK,GACH,MAAM,IAAI,MAAM,0DAA0D,EAC5E,QACE,MAAM,IAAI,YAAY,2BAA2B,CACpD,CACL,EAWE2pC,EAAqB,UAAU,IAAM,UAAY,CAC/C,MAAM,IAAI,MAAM,mDAAmD,CACvE,EAcEA,EAAqB,UAAU,OAAS,UAAY,CAClD,MAAM,IAAI,MAAM,sDAAsD,CAC1E,EAOEA,EAAqB,UAAU,QAAU,UAAY,CACnD,MAAM,IAAI,MAAM,uDAAuD,CAC3E,EAMEA,EAAqB,UAAU,MAAQ,UAAY,CACjD,OAAO,IAAIA,EAAqB,CAC9B,QAAUhtD,GAAQ,OAAO,KAAK,KAAK,EACnC,QAAUA,GAAQ,OAAO,KAAK,KAAK,EACnC,SAAU,KAAK,SACrB,CAAK,CACL,EAMEgtD,EAAqB,UAAU,OAAS,UAAY,CAClD,MAAO,CACL,OAAQ,uBACR,KAAM,KAAK,MACX,KAAM,KAAK,MACX,SAAU,KAAK,SACrB,CACA,EASEA,EAAqB,SAAW,SAAUtsC,EAAM,CAC9C,OAAO,IAAIssC,EAAqBtsC,CAAI,CACxC,EAUEssC,EAAqB,UAAU,SAAW,UAAY,CACpD,MAAM,IAAI,MAAM,wDAAwD,CAC5E,EAMEA,EAAqB,UAAU,IAAM,UAAY,CAE/C,GAAI,KAAK,OAAS,KAAM,CAEtB,IAAI3pC,EAAI,KAER,KAAK,QAAQ,SAAUsH,EAAG,EACpBtH,IAAM,MAAQkwB,EAAQ5oB,EAAGtH,CAAC,KAC5BA,EAAIsH,EAEd,CAAO,EACD,KAAK,KAAOtH,IAAM,KAAOA,EAAI,MAC9B,CACD,OAAO,KAAK,IAChB,EAME2pC,EAAqB,UAAU,IAAM,UAAY,CAE/C,GAAI,KAAK,OAAS,KAAM,CAEtB,IAAI3pC,EAAI,KAER,KAAK,QAAQ,SAAUsH,EAAG,EACpBtH,IAAM,MAAQkwB,EAAQlwB,EAAGsH,CAAC,KAC5BtH,EAAIsH,EAEd,CAAO,EACD,KAAK,KAAOtH,IAAM,KAAOA,EAAI,MAC9B,CACD,OAAO,KAAK,IAChB,EACS2pC,CACT,EAAG,CACD,QAAS,EACX,CAAC,EACDA,GAAA,gCAA0CC,cC/N1C,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAI3uD,GAAMjE,GACN0F,IAAU/C,GACVkY,IAAU3W,GACV8gB,IAAWre,EACXH,IAAO,QACPia,IAAe,CAAC,sBAAsB,EACtCoyC,OAAsC7tC,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CAC9F,IAAIqtC,EAAuBrtC,EAAK,qBAqBhC,SAAS03B,EAAM+V,EAAQ,CACrB,GAAI,EAAE,gBAAgB/V,GACpB,MAAM,IAAI,YAAY,kDAAkD,EAE1E,KAAK,YAAc,GACnB,KAAK,UAAY,GACjB,QAAS,EAAI,EAAGxsC,EAAK,UAAU,OAAQ,EAAIA,EAAI,IAAK,CAClD,IAAIX,EAAM,UAAU,CAAC,EACrB,MAAQ3L,GAAI,SAAS2L,CAAG,EACtB,KAAK,YAAY,KAAKA,CAAG,EACzB,KAAK,UAAY,WACR,MAAM,QAAQA,CAAG,MAAS3L,GAAI,UAAU2L,CAAG,EAAG,CAEvD,IAAImZ,EAAIgqC,EAAuBnjD,EAAI,QAAS,CAAA,EAC5C,KAAK,YAAY,KAAKmZ,CAAC,EAEvB,IAAIzQ,EAAOyQ,EAAE,QAETzQ,EAAK,SAAW,GAAKA,EAAK,CAAC,IAAM,KACnC,KAAK,UAAY,GAE3B,SAAiB,OAAO1I,GAAQ,SACxB,KAAK,YAAY,KAAKmjD,EAAuB,CAACnjD,CAAG,CAAC,CAAC,UAC1C,OAAOA,GAAQ,SAExB,KAAK,YAAY,KAAKA,CAAG,MAEzB,OAAM,IAAI,UAAU,8DAA8D,CAGrF,CACF,CAKDmtC,EAAM,UAAU,KAAO,QACvBA,EAAM,UAAU,QAAU,GAC1B,SAASgW,EAAuBnjD,EAAK,CAEnC,QAAS,EAAI,EAAGgmB,EAAIhmB,EAAI,OAAQ,EAAIgmB,EAAG,IACrC,GAAI,OAAOhmB,EAAI,CAAC,GAAM,UAAY,IAAKiL,IAAQ,WAAWjL,EAAI,CAAC,CAAC,EAC9D,MAAM,IAAI,UAAU,mDAAmD,EAI3E,OAAO,IAAI8iD,EAAqB9iD,CAAG,CACpC,CAOD,OAAAmtC,EAAM,UAAU,MAAQ,UAAY,CAClC,IAAI7wC,EAAQ,IAAI6wC,EAChB,OAAA7wC,EAAM,eAAkBxG,IAAQ,OAAO,KAAK,WAAW,EACvDwG,EAAM,UAAY,KAAK,UAChBA,CACX,EASE6wC,EAAM,OAAS,SAAU+V,EAAQ,CAC/B,IAAI5mD,EAAQ,IAAI6wC,EAChB,OAAAA,EAAM,MAAM7wC,EAAO4mD,CAAM,EAClB5mD,CACX,EAOE6wC,EAAM,UAAU,KAAO,UAAY,CAEjC,QADIzkC,EAAO,CAAA,EACF,EAAI,EAAG/H,EAAK,KAAK,YAAY,OAAQ,EAAIA,EAAI,IAAK,CACzD,IAAI,EAAI,KAAK,YAAY,CAAC,EAC1B+H,EAAK,CAAC,EAAI,OAAO,GAAM,SAAW,EAAI,EAAE,OAAO,CAAC,CACjD,CACD,OAAOA,CACX,EAOEykC,EAAM,UAAU,IAAM,UAAY,CAEhC,QADI/4C,EAAS,CAAA,EACJ,EAAI,EAAGuM,EAAK,KAAK,YAAY,OAAQ,EAAIA,EAAI,IAAK,CACzD,IAAIioB,EAAQ,KAAK,YAAY,CAAC,EAC9Bx0B,EAAO,CAAC,EAAI,OAAOw0B,GAAU,SAAWA,EAAQA,EAAM,KACvD,CACD,OAAOx0B,CACX,EAOE+4C,EAAM,UAAU,IAAM,UAAY,CAEhC,QADI/4C,EAAS,CAAA,EACJ,EAAI,EAAGuM,EAAK,KAAK,YAAY,OAAQ,EAAIA,EAAI,IAAK,CACzD,IAAIioB,EAAQ,KAAK,YAAY,CAAC,EAC9Bx0B,EAAO,CAAC,EAAI,OAAOw0B,GAAU,SAAWA,EAAQA,EAAM,KACvD,CACD,OAAOx0B,CACX,EASE+4C,EAAM,UAAU,QAAU,SAAU14C,EAAU,CAC5C,QAAS,EAAI,EAAGkM,EAAK,KAAK,YAAY,OAAQ,EAAIA,EAAI,IACpDlM,EAAS,KAAK,YAAY,CAAC,EAAG,EAAG,IAAI,CAE3C,EAQE04C,EAAM,UAAU,UAAY,SAAUj/B,EAAK,CACzC,OAAO,KAAK,YAAYA,CAAG,GAAK,IACpC,EAMEi/B,EAAM,UAAU,iBAAmB,UAAY,CAC7C,OAAO,KAAK,YAAY,SAAW,GAAK,OAAO,KAAK,YAAY,CAAC,GAAM,QAC3E,EAOEA,EAAM,UAAU,kBAAoB,UAAY,CAC9C,OAAO,KAAK,mBAAqB,KAAK,YAAY,CAAC,EAAI,IAC3D,EAUEA,EAAM,UAAU,SAAW,UAAY,CACrC,OAAO,KAAK,SAChB,EAQEA,EAAM,UAAU,QAAU,UAAY,CAEpC,QADIz2C,EAAQ,CAAA,EACH,EAAI,EAAGiK,EAAK,KAAK,YAAY,OAAQ,EAAIA,EAAI,IAAK,CACzD,IAAIyiD,EAAY,KAAK,YAAY,CAAC,EAClC1sD,EAAM,KAAK,OAAO0sD,GAAc,SAAWA,EAAYA,EAAU,QAAO,CAAE,CAC3E,CACD,OAAO1sD,CACX,EAQEy2C,EAAM,UAAU,QAAUA,EAAM,UAAU,QAO1CA,EAAM,UAAU,SAAW,UAAY,CAErC,QADIkW,EAAU,CAAA,EACL,EAAI,EAAG1iD,EAAK,KAAK,YAAY,OAAQ,EAAIA,EAAI,IAAK,CACzD,IAAIyiD,EAAY,KAAK,YAAY,CAAC,EAC9B,OAAOA,GAAc,SACvBC,EAAQ,KAAK,KAAK,UAAUD,CAAS,CAAC,EAEtCC,EAAQ,KAAKD,EAAU,SAAU,CAAA,CAEpC,CACD,MAAO,IAAMC,EAAQ,KAAK,IAAI,EAAI,GACtC,EAQElW,EAAM,UAAU,OAAS,UAAY,CACnC,MAAO,CACL,OAAQ,QACR,WAAY,KAAK,WACvB,CACA,EASEA,EAAM,SAAW,SAAU32B,EAAM,CAC/B,OAAO22B,EAAM,OAAO32B,EAAK,UAAU,CACvC,EACS22B,CACT,EAAG,CACD,QAAS,EACX,CAAC,EACD6V,GAAA,iBAA2BC,cC5Q3B,OAAO,eAAeK,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAIluC,IAAWhlB,EACXwG,IAAO,gBACPia,IAAe,CAAC,UAAW,QAAQ,EACnC0yC,OAA8CnuC,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CACtG,IAAI4zB,EAAU5zB,EAAK,QACjBu7B,EAASv7B,EAAK,OACZ+tC,EAAgB,EAAM,KAAK,KAAK,EAAM,KAAK,KAAK,CAAG,GAAK,CAAG,EAO/D,SAASF,GAAgB,CACvB,GAAI,EAAE,gBAAgBA,GACpB,MAAM,IAAI,YAAY,kDAAkD,EAI1E,KAAK,SAAW,KAChB,KAAK,MAAQ,CACd,CAKDA,EAAc,UAAU,KAAO,gBAC/BA,EAAc,UAAU,gBAAkB,GAQ1CA,EAAc,UAAU,OAAS,SAAUvzD,EAAKyE,EAAO,CAErD,IAAItB,EAAO,CACT,IAAKnD,EACL,MAAOyE,EACP,OAAQ,CACd,EAEI,GAAI,KAAK,SAAU,CAEjB,IAAIw6C,EAAU,KAAK,SAEnB97C,EAAK,KAAO87C,EACZ97C,EAAK,MAAQ87C,EAAQ,MACrBA,EAAQ,MAAQ97C,EAChBA,EAAK,MAAM,KAAOA,EAEdm2C,EAAQt5C,EAAKi/C,EAAQ,GAAG,IAE1B,KAAK,SAAW97C,EAExB,MAEMA,EAAK,KAAOA,EACZA,EAAK,MAAQA,EAEb,KAAK,SAAWA,EAGlB,YAAK,QAEEA,CACX,EAMEowD,EAAc,UAAU,KAAO,UAAY,CACzC,OAAO,KAAK,KAChB,EAMEA,EAAc,UAAU,MAAQ,UAAY,CAC1C,KAAK,SAAW,KAChB,KAAK,MAAQ,CACjB,EAMEA,EAAc,UAAU,QAAU,UAAY,CAC5C,OAAO,KAAK,QAAU,CAC1B,EAOEA,EAAc,UAAU,eAAiB,UAAY,CAEnD,IAAIpwD,EAAO,KAAK,SAEhB,GAAIA,IAAS,KACX,OAAOA,EAST,QANI87C,EAAU,KAAK,SAEfyU,EAAmBvwD,EAAK,OAExBF,EAAIE,EAAK,MAENuwD,EAAmB,GAAG,CAE3B,IAAIC,EAAY1wD,EAAE,MAElBA,EAAE,KAAK,MAAQA,EAAE,MACjBA,EAAE,MAAM,KAAOA,EAAE,KAEjBA,EAAE,KAAOg8C,EACTh8C,EAAE,MAAQg8C,EAAQ,MAClBA,EAAQ,MAAQh8C,EAChBA,EAAE,MAAM,KAAOA,EAEfA,EAAE,OAAS,KACXA,EAAI0wD,EACJD,GACD,CAED,OAAAvwD,EAAK,KAAK,MAAQA,EAAK,MACvBA,EAAK,MAAM,KAAOA,EAAK,KAEnBA,IAASA,EAAK,MAEhB87C,EAAU,MAGVA,EAAU97C,EAAK,MAEf87C,EAAU2U,EAAiB3U,EAAS,KAAK,KAAK,GAGhD,KAAK,QAEL,KAAK,SAAWA,EAET97C,CACX,EASEowD,EAAc,UAAU,OAAS,SAAUpwD,EAAM,CAE/C,KAAK,SAAW0wD,EAAa,KAAK,SAAU1wD,EAAM,EAAE,EAEpD,KAAK,eAAc,CACvB,EAQE,SAAS0wD,EAAa5U,EAAS97C,EAAMnD,EAAK,CAExCmD,EAAK,IAAMnD,EAEX,IAAI8zD,EAAS3wD,EAAK,OAClB,OAAI2wD,GAAUxa,EAAQn2C,EAAK,IAAK2wD,EAAO,GAAG,IAExCC,EAAK9U,EAAS97C,EAAM2wD,CAAM,EAE1BE,EAAc/U,EAAS6U,CAAM,GAG3Bxa,EAAQn2C,EAAK,IAAK87C,EAAQ,GAAG,IAC/BA,EAAU97C,GAGL87C,CACR,CAOD,SAAS8U,EAAK9U,EAAS97C,EAAM2wD,EAAQ,CAEnC3wD,EAAK,KAAK,MAAQA,EAAK,MACvBA,EAAK,MAAM,KAAOA,EAAK,KACvB2wD,EAAO,SAEHA,EAAO,QAAU3wD,IACnB2wD,EAAO,MAAQ3wD,EAAK,OAGlB2wD,EAAO,SAAW,IACpBA,EAAO,MAAQ,MAGjB3wD,EAAK,KAAO87C,EACZ97C,EAAK,MAAQ87C,EAAQ,MACrBA,EAAQ,MAAQ97C,EAChBA,EAAK,MAAM,KAAOA,EAElBA,EAAK,OAAS,KAEdA,EAAK,KAAO,EACb,CAQD,SAAS6wD,EAAc/U,EAAS97C,EAAM,CAEpC,IAAI2wD,EAAS3wD,EAAK,OAEb2wD,IAIA3wD,EAAK,MAIR4wD,EAAK9U,EAAS97C,EAAM2wD,CAAM,EAE1BE,EAAcF,CAAM,GALpB3wD,EAAK,KAAO,GAOf,CAMD,IAAI8wD,EAAa,SAAoB9wD,EAAM2wD,EAAQ,CAEjD3wD,EAAK,KAAK,MAAQA,EAAK,MACvBA,EAAK,MAAM,KAAOA,EAAK,KAEvBA,EAAK,OAAS2wD,EACTA,EAAO,OAKV3wD,EAAK,KAAO2wD,EAAO,MACnB3wD,EAAK,MAAQ2wD,EAAO,MAAM,MAC1BA,EAAO,MAAM,MAAQ3wD,EACrBA,EAAK,MAAM,KAAOA,IAPlB2wD,EAAO,MAAQ3wD,EACfA,EAAK,MAAQA,EACbA,EAAK,KAAOA,GAQd2wD,EAAO,SAEP3wD,EAAK,KAAO,EAChB,EACE,SAASywD,EAAiB3U,EAAStmC,EAAM,CAEvC,IAAImE,EAAY,KAAK,MAAM,KAAK,IAAInE,CAAI,EAAI86C,CAAa,EAAI,EAEzD9sD,EAAQ,IAAI,MAAMmW,CAAS,EAE3Bo3C,EAAW,EACXjxD,EAAIg8C,EACR,GAAIh8C,EAGF,IAFAixD,IACAjxD,EAAIA,EAAE,MACCA,IAAMg8C,GACXiV,IACAjxD,EAAIA,EAAE,MAMV,QAFIqX,EAEG45C,EAAW,GAAG,CAMnB,QAJIj0C,EAAIhd,EAAE,OAEN6c,EAAO7c,EAAE,MAIXqX,EAAI3T,EAAMsZ,CAAC,EACP,EAAC3F,GAHM,CAOX,GAAI2mC,EAAOh+C,EAAE,IAAKqX,EAAE,GAAG,EAAG,CACxB,IAAIgT,EAAOhT,EACXA,EAAIrX,EACJA,EAAIqqB,CACL,CAED2mC,EAAW35C,EAAGrX,CAAC,EAEf0D,EAAMsZ,CAAC,EAAI,KACXA,GACD,CAEDtZ,EAAMsZ,CAAC,EAAIhd,EAEXA,EAAI6c,EACJo0C,GACD,CAEDjV,EAAU,KAEV,QAASn/C,EAAI,EAAGA,EAAIgd,EAAWhd,IAE7Bwa,EAAI3T,EAAM7G,CAAC,EACNwa,IAID2kC,GAEF3kC,EAAE,KAAK,MAAQA,EAAE,MACjBA,EAAE,MAAM,KAAOA,EAAE,KAEjBA,EAAE,KAAO2kC,EACT3kC,EAAE,MAAQ2kC,EAAQ,MAClBA,EAAQ,MAAQ3kC,EAChBA,EAAE,MAAM,KAAOA,EAEXg/B,EAAQh/B,EAAE,IAAK2kC,EAAQ,GAAG,IAC5BA,EAAU3kC,IAGZ2kC,EAAU3kC,GAGd,OAAO2kC,CACR,CACD,OAAOsU,CACT,EAAG,CACD,QAAS,EACX,CAAC,EACDA,GAAA,yBAAmCC,cCjWnC,OAAO,eAAeW,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAI9uC,IAAWhlB,EACXwG,IAAO,MACPia,IAAe,CAAC,YAAa,cAAe,eAAe,EAC3DszC,OAAoC/uC,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CAC5F,IAAIqlB,EAAYrlB,EAAK,UACnB4e,EAAc5e,EAAK,YACnB6tC,EAAgB7tC,EAAK,cAKvB,SAASyuC,GAAM,CACb,GAAI,EAAE,gBAAgBA,GACpB,MAAM,IAAI,YAAY,kDAAkD,EAI1E,KAAK,QAAU,GACf,KAAK,MAAQ,IAAIZ,CAClB,CAKD,OAAAY,EAAI,UAAU,KAAO,MACrBA,EAAI,UAAU,MAAQ,GAQtBA,EAAI,UAAU,IAAM,SAAU,EAAGzjC,EAAG,CAElC,GAAK,KAAK,QAAQ,CAAC,EAOjB,KAAK,QAAQ,CAAC,EAAE,MAAQA,MAPJ,CAEpB,IAAIvtB,EAAO,KAAK,MAAM,OAAO,EAAGutB,CAAC,EAEjC,KAAK,QAAQ,CAAC,EAAIvtB,CACxB,CAIA,EACEgxD,EAAI,UAAU,IAAM,SAAU,EAAG,CAC/B,IAAIhxD,EAAO,KAAK,QAAQ,CAAC,EACzB,OAAIA,EACKA,EAAK,MAEP,CACX,EACEgxD,EAAI,UAAU,WAAa,SAAU,EAAGzjC,EAAG,CAEzC,IAAIvtB,EAAO,KAAK,QAAQ,CAAC,EACpBA,EAOHA,EAAK,MAAQ4nC,EAAU5nC,EAAK,MAAOutB,CAAC,GALpCvtB,EAAO,KAAK,MAAM,OAAO,EAAGutB,CAAC,EAE7B,KAAK,QAAQ,CAAC,EAAIvtB,EAKxB,EACEgxD,EAAI,UAAU,QAAU,SAAUpC,EAAMl7C,EAAInS,EAAU,CAEpD,IAAI2vD,EAAO,KAAK,MACZhwD,EAAS,KAAK,QAEdiwD,EAAQ,CAAA,EAERnxD,EAAOkxD,EAAK,iBAKhB,IAJIlxD,GACFmxD,EAAM,KAAKnxD,CAAI,EAGVA,GAAQA,EAAK,KAAO0T,GAErB1T,EAAK,KAAO4uD,IAETztB,EAAYnhC,EAAK,MAAO,CAAC,GAE5BuB,EAASvB,EAAK,IAAKA,EAAK,MAAO,IAAI,GAIvCA,EAAOkxD,EAAK,iBACRlxD,GACFmxD,EAAM,KAAKnxD,CAAI,EAInB,QAASrD,EAAI,EAAGA,EAAIw0D,EAAM,OAAQx0D,IAAK,CAErC,IAAI2Y,EAAI67C,EAAMx0D,CAAC,EAEfqD,EAAOkxD,EAAK,OAAO57C,EAAE,IAAKA,EAAE,KAAK,EAEjCpU,EAAOlB,EAAK,GAAG,EAAIA,CACpB,CACL,EACEgxD,EAAI,UAAU,KAAO,SAAU,EAAG1rC,EAAG,CAEnC,IAAI8rC,EAAQ,KAAK,QAAQ,CAAC,EACtBC,EAAQ,KAAK,QAAQ/rC,CAAC,EAE1B,GAAI,CAAC8rC,GAASC,EAEZD,EAAQ,KAAK,MAAM,OAAO,EAAGC,EAAM,KAAK,EAExC,KAAK,MAAM,OAAOA,CAAK,EAEvB,KAAK,QAAQ,CAAC,EAAID,EAClB,KAAK,QAAQ9rC,CAAC,EAAI,eACT8rC,GAAS,CAACC,EAEnBA,EAAQ,KAAK,MAAM,OAAO/rC,EAAG8rC,EAAM,KAAK,EAExC,KAAK,MAAM,OAAOA,CAAK,EAEvB,KAAK,QAAQ9rC,CAAC,EAAI+rC,EAClB,KAAK,QAAQ,CAAC,EAAI,eACTD,GAASC,EAAO,CAEzB,IAAI9jC,EAAI6jC,EAAM,MACdA,EAAM,MAAQC,EAAM,MACpBA,EAAM,MAAQ9jC,CACf,CACL,EACSyjC,CACT,EAAG,CACD,QAAS,EACX,CAAC,EACDA,GAAA,eAAyBC,oBC1IzB,OAAO,eAAe/0B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,wCAA+BA,GAAA,mBAAqDA,GAAA,iBAAG,OACjH,IAAI9H,GAAYl3B,GAMZo0D,OAAuBl9B,GAAU,SAAS,SAAU5R,EAAW,CACjE,OAAO,IAAIA,EAAU,CAAC,EAAE,IAAG,CAC7B,EAAG,CACD,OAAQiS,EACV,CAAC,EAOuByH,GAAA,iBAAGo1B,IAC3B,IAAIC,OAAyBn9B,GAAU,SAAS,SAAU5R,EAAW,CACnE,OAAO,IAAIA,EAAU,CAAC,EAAE,KAAK,IAAIA,EAAU,CAAC,EAAE,KAAM,CAAA,EAAE,IAAI,CAAC,CAC7D,EAAG,CACD,OAAQiS,EACV,CAAC,EAOyByH,GAAA,mBAAGq1B,IAC7B,IAAIC,MAAwBp9B,GAAU,SAAS,SAAU5R,EAAW,CAClE,OAAOA,EAAU,KAAK,EAAE,CAC1B,EAAG,CACD,OAAQiS,EACV,CAAC,EAOwByH,GAAA,kBAAGs1B,GAC5B,IAAIC,OAAyBr9B,GAAU,SAAS,SAAU5R,EAAW,CACnE,OAAOgvC,GAAkBhvC,CAAS,EAAE,MAAM,CAAC,CAC7C,EAAG,CACD,OAAQiS,EACV,CAAC,EAUyByH,GAAA,mBAAGu1B,IAC7B,SAASh9B,GAAOtrB,EAAM,CACpB,OAAOA,EAAK,CAAC,EAAE,SACjB,CC/DA,IAAI7M,GAAyBY,GAC7B,OAAO,eAAew0D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAI9xD,GAAWtD,GAAuBuD,EAAwC,EAC1E4vC,IAAmBnzC,GAAuB8E,GAAA,CAAgD,EAC1FwC,GAAYtH,GAAuBuH,GAAA,CAAyC,EAC5E1C,GAAMyX,GACNsJ,IAAWE,EACXgS,IAAYW,GACZna,IAAUoa,GACVpyB,GAAUqyB,GACVyK,IAAaxK,GACjB,SAASy8B,GAAQzxD,EAAQ0xD,EAAgB,CAAE,IAAI9L,EAAO,OAAO,KAAK5lD,CAAM,EAAG,GAAI,OAAO,sBAAuB,CAAE,IAAI2xD,EAAU,OAAO,sBAAsB3xD,CAAM,EAAG0xD,IAAmBC,EAAUA,EAAQ,OAAO,SAAUC,EAAK,CAAE,OAAO,OAAO,yBAAyB5xD,EAAQ4xD,CAAG,EAAE,UAAW,CAAE,GAAIhM,EAAK,KAAK,MAAMA,EAAM+L,CAAO,CAAE,CAAG,OAAO/L,CAAO,CACrV,SAASiM,GAAcr1D,EAAQ,CAAE,QAASC,EAAI,EAAGA,EAAI,UAAU,OAAQA,IAAK,CAAE,IAAIC,EAAiB,UAAUD,CAAC,GAAnB,KAAuB,UAAUA,CAAC,EAAI,CAAA,EAAIA,EAAI,EAAIg1D,GAAQ,OAAO/0D,CAAM,EAAG,EAAE,EAAE,QAAQ,SAAUC,EAAK,IAAM4yC,IAAiB,SAAY/yC,EAAQG,EAAKD,EAAOC,CAAG,CAAC,CAAI,CAAA,EAAI,OAAO,0BAA4B,OAAO,iBAAiBH,EAAQ,OAAO,0BAA0BE,CAAM,CAAC,EAAI+0D,GAAQ,OAAO/0D,CAAM,CAAC,EAAE,QAAQ,SAAUC,EAAK,CAAE,OAAO,eAAeH,EAAQG,EAAK,OAAO,yBAAyBD,EAAQC,CAAG,CAAC,CAAE,CAAE,CAAI,CAAC,OAAOH,CAAS,CAC3gB,IAAIgH,IAAO,OACPia,IAAe,CAAC,MAAO,SAAU,YAAa,WAAY,iBAAkB,eAAgB,MAAO,MAAO,MAAO,QAAS,QAAS,YAAa,SAAU,SAAU,UAAW,YAAa,UAAU,EACtMq0C,OAAqC9vC,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CAC7F,IAAIqM,EAAKrM,EAAK,GACZzlB,EAASylB,EAAK,OACdqlB,EAAYrlB,EAAK,UACjBgI,EAAWhI,EAAK,SAChB2vB,EAAiB3vB,EAAK,eACtBigC,EAAejgC,EAAK,aACpB0J,EAAM1J,EAAK,IACXwK,EAAMxK,EAAK,IACX4oB,EAAM5oB,EAAK,IACX6L,EAAQ7L,EAAK,MACb2zB,EAAQ3zB,EAAK,MACb4d,EAAY5d,EAAK,UACjBnO,EAASmO,EAAK,OACdtO,EAASsO,EAAK,OACdE,EAAUF,EAAK,QACfuyB,EAAavyB,EAAK,UAClBgzB,EAAYhzB,EAAK,SACf0vC,EAAWh+C,EAoBf,SAASy9C,EAAKpwD,EAAOkkC,GAAe,CAClC,GAAI,EAAE,gBAAgBksB,GACpB,MAAM,IAAI,MAAM,kDAAkD,EAEpE,GAAI,EAAEpwD,GAAU,MAA+B6+B,EAAU7+B,CAAK,MAASH,GAAI,WAAWG,CAAK,GACzF,MAAM,IAAI,UAAU,gGAAgG,EAStH,GAPA,KAAK,UAAY,GAMjB,KAAK,4BAA8B,GAC/BkkC,KAAkB,OACpB,KAAK,MAAQ,GACb,KAAK,WAAa0sB,EAAgB,IAAI,SAAUpyD,GAAG,CACjD,MAAO,EACf,CAAO,UACQ,OAAO0lC,IAAkB,SAAU,CAC5C,IAAI5Y,GAAI8kC,EAAK,MAAMlsB,EAAa,EAChC,KAAK,MAAQ5Y,GAAE,MACf,KAAK,WAAaA,GAAE,UAC1B,YAAmBzrB,GAAI,QAAQqkC,EAAa,GAAKA,GAAc,QAAU,KAEnE,KAAK,UAAYA,GAAc,UAC/B,KAAK,4BAA8BA,GAAc,4BACjD,KAAK,WAAaA,GAAc,WAAW,MAAM,CAAC,EAClD,KAAK,MAAQA,GAAc,MAAM,IAAI,SAAU5Y,GAAG,CAChD,SAAWhpB,GAAU,SAAY,CAAE,EAAEgpB,EAAC,CAC9C,CAAO,MAED,OAAM,IAAI,UAAU,yEAAyE,EAE/F,KAAK,MAAQ,KAAK,WAAWtrB,CAAK,CACnC,CAKD,OAAO,eAAeowD,EAAM,OAAQ,CAClC,MAAO,MACX,CAAG,EACDA,EAAK,UAAU,YAAcA,EAC7BA,EAAK,UAAU,KAAO,OACtBA,EAAK,UAAU,OAAS,GAGxB,IAAI74C,EAAMzP,EAAO4C,EACjB,SAASmmD,GAAiB,CACxB,KAAOnmD,IAAM,KAAOA,IAAM,KACxB2Q,GAEH,CACD,SAASy1C,EAAWpmD,EAAG,CACrB,OAAOA,GAAK,KAAOA,GAAK,KAAOA,IAAM,GACtC,CACD,SAASqmD,EAAQrmD,EAAG,CAClB,OAAOA,GAAK,KAAOA,GAAK,GACzB,CACD,SAAS2Q,GAAO,CACdvT,IACA4C,EAAI6M,EAAK,OAAOzP,CAAK,CACtB,CACD,SAASkpD,EAAOp+B,EAAU,CACxB9qB,EAAQ8qB,EACRloB,EAAI6M,EAAK,OAAOzP,CAAK,CACtB,CACD,SAASmpD,GAAc,CACrB,IAAIt+C,EAAS,GACTigB,GAAW9qB,EAOf,GANI4C,IAAM,IACR2Q,IACS3Q,IAAM,MACfiI,GAAUjI,EACV2Q,KAEE,CAACy1C,EAAWpmD,CAAC,EAEf,OAAAsmD,EAAOp+B,EAAQ,EACR,KAIT,GAAIloB,IAAM,KAGR,GAFAiI,GAAUjI,EACV2Q,IACI,CAAC01C,EAAQrmD,CAAC,EAEZ,OAAAsmD,EAAOp+B,EAAQ,EACR,SAEJ,CACL,KAAOm+B,EAAQrmD,CAAC,GACdiI,GAAUjI,EACV2Q,IAEE3Q,IAAM,MACRiI,GAAUjI,EACV2Q,IAEH,CACD,KAAO01C,EAAQrmD,CAAC,GACdiI,GAAUjI,EACV2Q,IAIF,GAAI3Q,IAAM,KAAOA,IAAM,IAAK,CAG1B,IAAIwmD,GAAkB,GAClBC,GAAiBrpD,EASrB,GARAopD,IAAmBxmD,EACnB2Q,KACI3Q,IAAM,KAAOA,IAAM,OACrBwmD,IAAmBxmD,EACnB2Q,KAIE,CAAC01C,EAAQrmD,CAAC,EAEZ,OAAAsmD,EAAOG,EAAc,EACdx+C,EAKT,IADAA,EAASA,EAASu+C,GACXH,EAAQrmD,CAAC,GACdiI,GAAUjI,EACV2Q,GAEH,CACD,OAAO1I,CACR,CACD,SAASy+C,GAAY,CAInB,QAHIC,EAAW,GAGRN,EAAQrmD,CAAC,GAAK0lD,EAAK,aAAa1lD,CAAC,GACtC2mD,GAAY3mD,EACZ2Q,IAIF,IAAIi2C,GAASD,EAAS,OAAO,CAAC,EAC9B,OAAIjB,EAAK,aAAakB,EAAM,EACnBD,EAEA,IAEV,CACD,SAASE,EAAeC,EAAQ,CAC9B,OAAI9mD,IAAM8mD,GACRn2C,IACOm2C,GAEA,IAEV,CAYDpB,EAAK,MAAQ,SAAUhvD,EAAKQ,GAAS,CAKnC,GAJAA,GAAUA,IAAW,GACrB2V,EAAOnW,EACP0G,EAAQ,GACR4C,EAAI,GACA,OAAO6M,GAAS,SAClB,MAAM,IAAI,UAAU,iDAAiD,EAEvE,IAAI0sB,GAAO,IAAImsB,EACfnsB,GAAK,MAAQ,GACb,IAAIwtB,GAAyB,EACzBC,GAAgB,GAgBpBr2C,IACAw1C,IAGA,IAAI95C,GAAWk6C,IACXjxD,GAAQ,KACZ,GAAI+W,GAAU,CACZ,GAAIvb,EAAO,SAAW,YACpBwE,GAAQ,IAAIwzC,EAAWz8B,EAAQ,UACtBvb,EAAO,SAAW,WAC3B,GAAI,CAEFwE,GAAQ,IAAIi0C,EAAUl9B,EAAQ,CAC/B,MAAa,CACZ/W,GAAQ,WAAW+W,EAAQ,CAC5B,MAGD/W,GAAQ,WAAW+W,EAAQ,EAE7B85C,IAGIU,EAAe,GAAG,GACpBE,GAAyB,EACzBC,GAAgB,IACPH,EAAe,GAAG,IAC3BE,GAAyB,GACzBC,GAAgB,GAEnB,CAOD,QAJIC,GAAuB,CAAA,EAGvBC,GAA8B,IACrB,CAKX,IAJAf,IAIOnmD,IAAM,KACXinD,GAAqB,KAAKF,EAAsB,EAChDG,IAA+BH,GAC/BA,GAAyB,EACzBp2C,IACAw1C,IAIF,IAAIgB,GAAO,OACX,GAAInnD,EAAG,CACL,IAAIonD,GAAOpnD,EAEX,GADAmnD,GAAOT,EAAS,EACZS,KAAS,KACX,MAAM,IAAI,YAAY,eAAiBC,GAAO,SAAWv6C,EAAO,cAAgBzP,EAAM,SAAQ,CAAE,CAE1G,KAEQ,OAIF,IAAI8nB,GAAMmiC,EAAUF,EAAI,EACxB,GAAIjiC,KAAQ,KAEV,MAAM,IAAI,YAAY,SAAWiiC,GAAO,cAAc,EAExD,IAAIG,GAAQP,GAAyBG,GAGrC,GADAf,IACIU,EAAe,GAAG,EAAG,CACvBV,IACA,IAAI7qD,GAAIirD,IACR,GAAIjrD,KAAM,KAER,MAAM,IAAI,YAAY,OAAS5E,EAAM,oDAAoD,EAE3F4wD,IAAShsD,EACV,CAGDi+B,GAAK,MAAM,KAAK,CACd,KAAMrU,GAAI,KACV,OAAQA,GAAI,OACZ,MAAOoiC,EACf,CAAO,EACD,QAAS32D,GAAI,EAAGA,GAAIu1D,EAAgB,OAAQv1D,KAC1C4oC,GAAK,WAAW5oC,EAAC,IAAMu0B,GAAI,KAAK,WAAWv0B,EAAC,GAAK,GAAK22D,GAMxD,IADAnB,IACOnmD,IAAM,KAAK,CAChB,GAAIinD,GAAqB,SAAW,EAClC,MAAM,IAAI,YAAY,qBAAuBp6C,EAAO,cAAgBzP,EAAM,SAAQ,CAAE,EAEtF8pD,IAA+BD,GAAqB,MACpDt2C,IACAw1C,GACD,CAmBD,GAfAa,GAAgB,GACZH,EAAe,GAAG,GAEpBE,GAAyB,EACzBC,GAAgB,IACPH,EAAe,GAAG,GAE3BE,GAAyB,GACzBC,GAAgB,IAGhBD,GAAyB,EAIvB7hC,GAAI,KAAK,KAAM,CACjB,IAAIqiC,GAAUriC,GAAI,KAAK,KAAK,IAC5BsiC,GAAa,KAAKD,EAAO,EAAI,CAC3B,KAAMriC,GAAI,KACV,OAAQA,GAAI,MACtB,CACO,CACF,CAID,GADAihC,IACInmD,EACF,MAAM,IAAI,YAAY,qBAAuBtJ,EAAM,GAAG,EAIxD,GAAIswD,GACF,MAAM,IAAI,YAAY,yBAA2BtwD,EAAM,GAAG,EAI5D,GAAIuwD,GAAqB,SAAW,EAClC,MAAM,IAAI,YAAY,qBAAuBp6C,EAAO,GAAG,EAIzD,GAAI0sB,GAAK,MAAM,SAAW,GAAK,CAACriC,GAAQ,aACtC,MAAM,IAAI,YAAY,IAAMR,EAAM,qBAAqB,EAEzD,OAAA6iC,GAAK,MAAQjkC,KAAU,OAAYikC,GAAK,WAAWjkC,EAAK,EAAI,KACrDikC,EACX,EAOEmsB,EAAK,UAAU,MAAQ,UAAY,CACjC,IAAInsB,EAAO,IAAImsB,EACfnsB,EAAK,UAAY,KAAK,UACtBA,EAAK,4BAA8B,KAAK,4BACxCA,EAAK,SAAY3iC,GAAQ,OAAO,KAAK,KAAK,EAC1C2iC,EAAK,WAAa,KAAK,WAAW,MAAM,CAAC,EACzCA,EAAK,MAAQ,GACb,QAAS5oC,GAAI,EAAGA,GAAI,KAAK,MAAM,OAAQA,KAAK,CAC1C4oC,EAAK,MAAM5oC,EAAC,EAAI,GAChB,QAAS2K,MAAK,KAAK,MAAM3K,EAAC,KAChBiG,GAAQ,gBAAgB,KAAK,MAAMjG,EAAC,EAAG2K,EAAC,IAC9Ci+B,EAAK,MAAM5oC,EAAC,EAAE2K,EAAC,EAAI,KAAK,MAAM3K,EAAC,EAAE2K,EAAC,EAGvC,CACD,OAAOi+B,CACX,EAQEmsB,EAAK,UAAU,UAAY,UAAY,CACrC,SAAWvwD,GAAI,QAAQ,KAAK,KAAK,CACrC,EAOEuwD,EAAK,UAAU,WAAa,UAAY,CACtC,OAAI,KAAK,MAAM,SAAW,EACjB,GAEF,KAAK,MAAM,OAAS,GAAK,KAAK,IAAI,KAAK,MAAM,CAAC,EAAE,MAAQ,CAAG,EAAI,KAC1E,EASEA,EAAK,UAAU,WAAa,SAAUpwD,EAAO,CAC3C,GAAIA,GAAU,MAA+B,KAAK,MAAM,SAAW,EACjE,OAAOA,EAKT,QAHI4vB,GAAM5vB,EACN6F,GAAUuqD,EAAK,uBAAwBvwD,GAAI,QAAQG,CAAK,CAAC,EAEpD3E,GAAI,EAAGA,GAAI,KAAK,MAAM,OAAQA,KAAK,CAC1C,IAAI82D,GAAYtsD,GAAQ,KAAK,MAAMxK,EAAC,EAAE,KAAK,KAAK,EAC5C+2D,GAAkBvsD,GAAQ,KAAK,MAAMxK,EAAC,EAAE,OAAO,KAAK,EACpDg3D,GAAYxsD,GAAQ,KAAK,MAAMxK,EAAC,EAAE,KAAK,EAC3Cu0B,GAAMghB,EAAehhB,GAAKjF,EAAIimB,EAAeuhB,GAAWC,EAAe,EAAGC,EAAS,CAAC,CACrF,CACD,OAAOziC,EACX,EAUEwgC,EAAK,UAAU,aAAe,SAAUpwD,EAAOsyD,GAAa,CAC1D,GAAItyD,GAAU,MAA+B,KAAK,MAAM,SAAW,EACjE,OAAOA,EAKT,QAHI4vB,GAAM5vB,EACN6F,GAAUuqD,EAAK,uBAAwBvwD,GAAI,QAAQG,CAAK,CAAC,EAEpD3E,GAAI,EAAGA,GAAI,KAAK,MAAM,OAAQA,KAAK,CAC1C,IAAI82D,GAAYtsD,GAAQ,KAAK,MAAMxK,EAAC,EAAE,KAAK,KAAK,EAC5C+2D,GAAkBvsD,GAAQ,KAAK,MAAMxK,EAAC,EAAE,OAAO,KAAK,EACpDg3D,GAAYxsD,GAAQ,KAAK,MAAMxK,EAAC,EAAE,KAAK,EAC3Cu0B,GAAMsxB,EAAatxB,GAAKjF,EAAIimB,EAAeuhB,GAAWC,EAAe,EAAGC,EAAS,CAAC,CACnF,CACD,OAAOziC,EACX,EAUE,IAAImiC,KAAgBj/B,IAAU,SAAS,SAAU1xB,EAAK,CAEpD,MAAQE,GAAQ,gBAAgBixD,EAAOnxD,CAAG,EAAG,CAC3C,IAAI6iC,GAAOsuB,EAAMnxD,CAAG,EAChBgT,GAAS6vB,GAAK,SAAS,EAAE,EAC7B,MAAO,CACL,KAAMA,GACN,OAAQ7vB,EAChB,CACK,CACD,QAAS5L,MAAS+pD,EAChB,MAAQjxD,GAAQ,gBAAgBixD,EAAO/pD,EAAK,MAClC8Q,IAAQ,UAAUlY,EAAKoH,EAAK,EAAG,CACrC,IAAIgqD,GAAQD,EAAM/pD,EAAK,EACnBiqD,GAAYrxD,EAAI,OAASoH,GAAM,OAC/BkqD,GAAatxD,EAAI,UAAU,EAAGqxD,EAAS,EACvCE,MAAcrxD,GAAQ,gBAAgBkxD,GAAM,SAAUE,EAAU,EAAIF,GAAM,SAASE,EAAU,EAAI,OACrG,GAAIC,KAAY,OAEd,MAAO,CACL,KAAMH,GACN,OAAQG,EACtB,CAES,CAGL,OAAO,IACX,EAAK,CACD,OAAQ,SAAgB9qD,GAAM,CAC5B,OAAOA,GAAK,CAAC,CACd,EACD,MAAO,GACX,CAAG,EAUDuoD,EAAK,gBAAkB,SAAUhuD,EAAM,CACrC,OAAO2vD,EAAU3vD,CAAI,IAAM,IAC/B,EAQEguD,EAAK,UAAU,QAAU,SAAUn8C,EAAM,CAIvC,GAHI,OAAOA,GAAS,WAClBA,EAAO2+C,EAAW3+C,CAAI,GAEpB,CAACA,EACH,MAAO,GAIT,QAAS5Y,GAAI,EAAGA,GAAIu1D,EAAgB,OAAQv1D,KAC1C,GAAI,KAAK,KAAK,KAAK,WAAWA,EAAC,GAAK,IAAM4Y,EAAK,WAAW5Y,EAAC,GAAK,EAAE,EAAI,MACpE,MAAO,GAGX,MAAO,EACX,EASE+0D,EAAK,UAAU,UAAY,SAAU/9C,EAAO,CAE1C,QAAShX,GAAI,EAAGA,GAAIu1D,EAAgB,OAAQv1D,KAC1C,GAAI,KAAK,KAAK,KAAK,WAAWA,EAAC,GAAK,IAAMgX,EAAM,WAAWhX,EAAC,GAAK,EAAE,EAAI,MACrE,MAAO,GAGX,MAAO,EACX,EAQE+0D,EAAK,UAAU,OAAS,SAAU/9C,EAAO,CACvC,OAAO,KAAK,UAAUA,CAAK,GAAKuiC,EAAM,KAAK,MAAOviC,EAAM,KAAK,CACjE,EAQE+9C,EAAK,UAAU,SAAW,SAAUyC,EAAQ,CAG1C,QAFIjjC,GAAM,KAAK,QACXvd,MAAYxS,GAAI,QAAQgzD,CAAM,EAAIA,EAAS,IAAIzC,EAAKyC,CAAM,EACrDx3D,GAAI,EAAGA,GAAIu1D,EAAgB,OAAQv1D,KAE1Cu0B,GAAI,WAAWv0B,EAAC,GAAK,KAAK,WAAWA,EAAC,GAAK,IAAMgX,GAAM,WAAWhX,EAAC,GAAK,GAI1E,QAAS+kB,GAAK,EAAGA,GAAK/N,GAAM,MAAM,OAAQ+N,KAAM,CAE9C,IAAI0yC,GAAWrC,GAAc,CAAE,EAAEp+C,GAAM,MAAM+N,EAAE,CAAC,EAChDwP,GAAI,MAAM,KAAKkjC,EAAQ,CACxB,CAGD,GAAI,KAAK,QAAU,MAAQzgD,GAAM,QAAU,KAAM,CAC/C,IAAI0gD,GAAU,KAAK,QAAU,KAAO,KAAK,WAAW,CAAC,EAAI,KAAK,MAC1DC,GAAW3gD,GAAM,QAAU,KAAOA,GAAM,WAAW,CAAC,EAAIA,GAAM,MAClEud,GAAI,MAAQghB,EAAemiB,GAASC,EAAQ,CAClD,MACMpjC,GAAI,MAAQ,KAEd,SAAQ/vB,GAAI,QAAQgzD,CAAM,IACxBjjC,GAAI,4BAA8B,IAE7BqjC,EAAqBrjC,EAAG,CACnC,EASEwgC,EAAK,UAAU,WAAa,SAAUtlC,EAAW,CAC/C,OAAO,IAAIslC,EAAKtlC,CAAS,EAAE,OAAO,IAAI,CAC1C,EAQEslC,EAAK,UAAU,OAAS,SAAUyC,EAAQ,CAGxC,QAFIjjC,GAAM,KAAK,QACXvd,MAAYxS,GAAI,QAAQgzD,CAAM,EAAIA,EAAS,IAAIzC,EAAKyC,CAAM,EACrDx3D,GAAI,EAAGA,GAAIu1D,EAAgB,OAAQv1D,KAE1Cu0B,GAAI,WAAWv0B,EAAC,GAAK,KAAK,WAAWA,EAAC,GAAK,IAAMgX,GAAM,WAAWhX,EAAC,GAAK,GAI1E,QAASmlB,GAAM,EAAGA,GAAMnO,GAAM,MAAM,OAAQmO,KAAO,CAEjD,IAAIsyC,GAAWrC,GAAcA,GAAc,CAAE,EAAEp+C,GAAM,MAAMmO,EAAG,CAAC,EAAG,GAAI,CACpE,MAAO,CAACnO,GAAM,MAAMmO,EAAG,EAAE,KACjC,CAAO,EACDoP,GAAI,MAAM,KAAKkjC,EAAQ,CACxB,CAGD,GAAI,KAAK,QAAU,MAAQzgD,GAAM,QAAU,KAAM,CAC/C,IAAI0gD,GAAU,KAAK,QAAU,KAAO,KAAK,WAAW,CAAC,EAAI,KAAK,MAC1DC,GAAW3gD,GAAM,QAAU,KAAOA,GAAM,WAAW,CAAC,EAAIA,GAAM,MAClEud,GAAI,MAAQsxB,EAAa6R,GAASC,EAAQ,CAChD,MACMpjC,GAAI,MAAQ,KAEd,SAAQ/vB,GAAI,QAAQgzD,CAAM,IACxBjjC,GAAI,4BAA8B,IAE7BqjC,EAAqBrjC,EAAG,CACnC,EAQEwgC,EAAK,UAAU,IAAM,SAAUpqD,EAAG,CAEhC,QADI4pB,GAAM,KAAK,QACNv0B,GAAI,EAAGA,GAAIu1D,EAAgB,OAAQv1D,KAE1Cu0B,GAAI,WAAWv0B,EAAC,GAAK,KAAK,WAAWA,EAAC,GAAK,GAAK2K,EAIlD,QAASk8B,GAAM,EAAGA,GAAMtS,GAAI,MAAM,OAAQsS,KACxCtS,GAAI,MAAMsS,EAAG,EAAE,OAASl8B,EAE1B,OAAI4pB,GAAI,QAAU,KAChBA,GAAI,MAAQjF,EAAIiF,GAAI,MAAO5pB,CAAC,EAQ5B4pB,GAAI,MAAQ,KAEdA,GAAI,4BAA8B,GAC3BqjC,EAAqBrjC,EAAG,CACnC,EAOE,SAASqjC,EAAqBhvB,EAAM,CAClC,OAAIA,EAAK,UAAU2uB,EAAW,IAAI,GAAK3uB,EAAK,QAAU,MAAQ,CAACzoC,EAAO,YAC7DyoC,EAAK,MAELA,CAEV,CAQDmsB,EAAK,UAAU,IAAM,UAAY,CAC/B,IAAIj6B,EAAM,KAAK,QACf,GAAIA,EAAI,QAAU,KAChB,GAAIA,EAAI,WAAY,GAAIA,EAAI,MAAM,CAAC,EAAE,KAAK,SAAW,EACnDA,EAAI,MAAQ1K,EAAI0K,EAAI,KAAK,MACpB,CAIL,IAAItwB,GAAUswB,EAAI,mBACdg8B,GAAYtsD,GAAQswB,EAAI,MAAM,CAAC,EAAE,KAAK,KAAK,EAC3C+8B,GAAgBrtD,GAAQswB,EAAI,MAAM,CAAC,EAAE,KAAK,MAAM,EAChDg9B,GAAaviB,EAAeuhB,GAAWe,EAAa,EACxD/8B,EAAI,MAAQlN,EAASwC,EAAI6a,EAAUnQ,EAAI,MAAOg9B,EAAU,CAAC,EAAGA,EAAU,CACvE,CAEH,QAAS93D,MAAK86B,EAAI,OACZA,EAAI,MAAM96B,EAAC,EAAE,KAAK,OAAS,MAAQ86B,EAAI,MAAM96B,EAAC,EAAE,KAAK,OAAS,SAChE86B,EAAI,MAAM96B,EAAC,EAAE,KAAOk3D,EAAM,GAG9B,OAAOp8B,CACX,EAQEi6B,EAAK,UAAU,GAAK,SAAUlsB,EAAe,CAC3C,IAAIlkC,GAAQ,KAAK,QAAU,KAAO,KAAK,WAAW,CAAC,EAAI,KAAK,MACxDqS,GACJ,GAAI,OAAO6xB,GAAkB,SAC3B7xB,GAAQ+9C,EAAK,MAAMlsB,CAAa,aACnBrkC,GAAI,QAAQqkC,CAAa,EACtC7xB,GAAQ6xB,EAAc,YAEtB,OAAM,IAAI,MAAM,sCAAsC,EAExD,GAAI,CAAC,KAAK,UAAU7xB,EAAK,EACvB,MAAM,IAAI,MAAM,wBAAwB,OAAOA,GAAM,SAAU,EAAE,QAAQ,EAAE,OAAO,KAAK,SAAQ,EAAI,IAAI,CAAC,EAE1G,GAAIA,GAAM,QAAU,KAClB,MAAM,IAAI,MAAM,uCAAuC,EAEzD,GAAI,KAAK,QAAU,MAAQ,KAAK,WAAU,GAAM,KAAK,MAAM,CAAC,EAAE,KAAK,SAAWA,GAAM,MAAM,CAAC,EAAE,KAAK,OAChGA,GAAM,SAAY/Q,GAAQ,OAAOtB,EAAK,MACjC,CAEL,IAAI6F,GAAUuqD,EAAK,uBAAwBvwD,GAAI,QAAQG,EAAK,CAAC,EAEzDozD,GAAgBvtD,GAAQ,KAAK,MAAM,CAAC,EAAE,KAAK,KAAK,EAChDwtD,GAAoBxtD,GAAQ,KAAK,MAAM,CAAC,EAAE,KAAK,MAAM,EACrDytD,GAAiB1iB,EAAewiB,GAAeC,EAAiB,EAChEE,GAAiB1tD,GAAQwM,GAAM,MAAM,CAAC,EAAE,KAAK,KAAK,EAClDmhD,GAAqB3tD,GAAQwM,GAAM,MAAM,CAAC,EAAE,KAAK,MAAM,EACvDohD,GAAkB7iB,EAAe2iB,GAAgBC,EAAkB,EACvEnhD,GAAM,MAAQ4W,EAASqd,EAAUtmC,GAAOszD,EAAc,EAAGG,EAAe,CACzE,CACD,OAAAphD,GAAM,UAAY,GAClBA,GAAM,4BAA8B,GAC7BA,EACX,EASE+9C,EAAK,UAAU,SAAW,SAAUlsB,EAAe,CACjD,OAAOysB,EAAS,KAAK,UAAUzsB,CAAa,CAAC,CACjD,EAQEksB,EAAK,UAAU,UAAY,SAAUlsB,EAAe,CAClD,IAAI7xB,GAOJ,OANI6xB,EAEF7xB,GAAQ,KAAK,GAAG6xB,CAAa,EAE7B7xB,GAAQ,KAAK,QAEXA,GAAM,WAAY,GAAIA,GAAM,MAAM,SAAW,EACxCA,GAAM,aAAaA,GAAM,KAAK,EAE9BA,GAAM,aAAaA,GAAM,MAAOA,GAAM,MAAM,CAAC,EAAE,OAAO,KAAK,CAExE,EAOE+9C,EAAK,UAAU,SAAW,UAAY,CACpC,OAAO,KAAK,QAChB,EAQEA,EAAK,UAAU,OAAS,UAAY,CAClC,MAAO,CACL,OAAQ,OACR,MAAO,KAAK,aAAa,KAAK,KAAK,EACnC,KAAM,KAAK,YAAa,EACxB,UAAW,KAAK,SACtB,CACA,EASEA,EAAK,SAAW,SAAUpuC,EAAM,CAC9B,IAAIiiB,GAAO,IAAImsB,EAAKpuC,EAAK,MAAOA,EAAK,IAAI,EACzC,OAAAiiB,GAAK,UAAYjiB,EAAK,WAAa,GAC5BiiB,EACX,EAOEmsB,EAAK,UAAU,QAAUA,EAAK,UAAU,SAMxCA,EAAK,UAAU,SAAW,UAAY,CACpC,IAAIj6B,EAAM,KAAK,QACXu9B,GAAmB,CAAA,EAGnBC,GACJ,QAASp4D,MAAOq4D,GACd,MAAQtyD,GAAQ,gBAAgBsyD,GAAmBr4D,EAAG,GAChD46B,EAAI,QAAQy8B,EAAWr3D,EAAG,CAAC,EAAG,CAChCo4D,GAAep4D,GACf,KACD,CAGL,GAAIo4D,KAAiB,OACnBx9B,EAAI,MAAQ,OACP,CACL,IAAI09B,GAOJ,GANIF,OAEMryD,GAAQ,gBAAgBsyD,GAAmBD,EAAY,IAC7DE,GAAeD,GAAkBD,EAAY,GAG7CE,GACF19B,EAAI,MAAQ,CAAC,CACX,KAAM09B,GAAa,KACnB,OAAQA,GAAa,OACrB,MAAO,CACjB,CAAS,MACI,CAKL,QADIC,GAAiB,GACZz4D,GAAI,EAAGA,GAAIu1D,EAAgB,OAAQv1D,KAAK,CAC/C,IAAI42D,GAAUrB,EAAgBv1D,EAAC,EAC3B,KAAK,IAAI86B,EAAI,WAAW96B,EAAC,GAAK,CAAC,EAAI,WAC7BiG,GAAQ,gBAAgBsyD,GAAmB3B,EAAO,EACxDyB,GAAiB,KAAK,CACpB,KAAME,GAAkB3B,EAAO,EAAE,KACjC,OAAQ2B,GAAkB3B,EAAO,EAAE,OACnC,MAAO97B,EAAI,WAAW96B,EAAC,GAAK,CAC5C,CAAe,EAEDy4D,GAAiB,GAGtB,CAGGJ,GAAiB,OAASv9B,EAAI,MAAM,QAAU,CAAC29B,KAEjD39B,EAAI,MAAQu9B,GAEf,CACF,CACD,OAAOv9B,CACX,EAKEi6B,EAAK,UAAU,KAAO,UAAY,CAOhC,QANIj6B,EAAM,KAAK,QACXu9B,GAAmB,CAAA,EAKdr4D,GAAI,EAAGA,GAAIu1D,EAAgB,OAAQv1D,KAAK,CAC/C,IAAI42D,GAAUrB,EAAgBv1D,EAAC,EAC/B,GAAI,KAAK,IAAI86B,EAAI,WAAW96B,EAAC,GAAK,CAAC,EAAI,MACrC,MAAQiG,GAAQ,gBAAgB4wD,GAAa,GAAID,EAAO,EACtDyB,GAAiB,KAAK,CACpB,KAAMxB,GAAa,GAAGD,EAAO,EAAE,KAC/B,OAAQC,GAAa,GAAGD,EAAO,EAAE,OACjC,MAAO97B,EAAI,WAAW96B,EAAC,GAAK,CACxC,CAAW,MAED,OAAM,IAAI,MAAM,8BAAgC42D,GAAU,cAAc,CAG7E,CAGD,OAAA97B,EAAI,MAAQu9B,GACZv9B,EAAI,UAAY,GAChBA,EAAI,4BAA8B,GAC3BA,CACX,EAOEi6B,EAAK,UAAU,YAAc,UAAY,CAKvC,QAJI2D,EAAS,GACTC,GAAS,GACTC,GAAO,EACPC,GAAO,EACF74D,GAAI,EAAGA,GAAI,KAAK,MAAM,OAAQA,KACjC,KAAK,MAAMA,EAAC,EAAE,MAAQ,GACxB44D,KACAF,GAAU,IAAM,KAAK,MAAM14D,EAAC,EAAE,OAAO,KAAO,KAAK,MAAMA,EAAC,EAAE,KAAK,KAC3D,KAAK,IAAI,KAAK,MAAMA,EAAC,EAAE,MAAQ,CAAG,EAAI,QACxC04D,GAAU,IAAM,KAAK,MAAM14D,EAAC,EAAE,QAEvB,KAAK,MAAMA,EAAC,EAAE,MAAQ,GAC/B64D,KAGJ,GAAIA,GAAO,EACT,QAASxxB,GAAM,EAAGA,GAAM,KAAK,MAAM,OAAQA,KACrC,KAAK,MAAMA,EAAG,EAAE,MAAQ,IACtBuxB,GAAO,GACTD,IAAU,IAAM,KAAK,MAAMtxB,EAAG,EAAE,OAAO,KAAO,KAAK,MAAMA,EAAG,EAAE,KAAK,KAC/D,KAAK,IAAI,KAAK,MAAMA,EAAG,EAAE,MAAQ,CAAG,EAAI,QAC1CsxB,IAAU,IAAM,CAAC,KAAK,MAAMtxB,EAAG,EAAE,SAGnCsxB,IAAU,IAAM,KAAK,MAAMtxB,EAAG,EAAE,OAAO,KAAO,KAAK,MAAMA,EAAG,EAAE,KAAK,KACnEsxB,IAAU,IAAM,KAAK,MAAMtxB,EAAG,EAAE,QAMxCqxB,EAASA,EAAO,OAAO,CAAC,EACxBC,GAASA,GAAO,OAAO,CAAC,EAGpBC,GAAO,GAAKC,GAAO,IACrBH,EAAS,IAAMA,EAAS,KAEtBG,GAAO,GAAKD,GAAO,IACrBD,GAAS,IAAMA,GAAS,KAE1B,IAAI5yD,GAAM2yD,EACV,OAAIE,GAAO,GAAKC,GAAO,IACrB9yD,IAAO,OAETA,IAAO4yD,GACA5yD,EACX,EAWEgvD,EAAK,UAAU,OAAS,SAAUxuD,EAAS,CAGzC,IAAIuyD,GAAO,KAAK,6BAA+B,KAAK,QAAU,KAAO,KAAK,MAAK,EAAK,KAAK,SAAQ,EAG7FC,GAAc,GACd,OAAOD,GAAK,MAAU,KAAeA,GAAK,QAAU,SAAYt0D,GAAI,WAAWs0D,GAAK,KAAK,IAE3FC,GAAc,KAAK,IAAID,GAAK,MAAM,EAAE,EAAI,OAE1C,QAAS94D,MAAK84D,GAAK,SACT7yD,GAAQ,gBAAgB6yD,GAAK,MAAO94D,EAAC,GACvC84D,GAAK,MAAM94D,EAAC,EAAE,OACZ84D,GAAK,MAAM94D,EAAC,EAAE,KAAK,OAAS,MAAQ+4D,GACtCD,GAAK,MAAM94D,EAAC,EAAE,KAAOk3D,EAAM,IAClB4B,GAAK,MAAM94D,EAAC,EAAE,KAAK,OAAS,OAAS,CAAC+4D,KAC/CD,GAAK,MAAM94D,EAAC,EAAE,KAAOk3D,EAAM,KAQ/B4B,GAAK,MAAM,SAAW,GAAK,CAACA,GAAK,WAG/B,KAAK,IAAIA,GAAK,MAAM,CAAC,EAAE,MAAQ,KAAK,MAAMA,GAAK,MAAM,CAAC,EAAE,KAAK,CAAC,EAAI,QAEpEA,GAAK,MAAM,CAAC,EAAE,OAASA,GAAK,eAGhC,IAAIn0D,GAAQm0D,GAAK,aAAaA,GAAK,KAAK,EACpC/yD,GAAM+yD,GAAK,QAAU,KAAOrhD,EAAO9S,GAAO4B,GAAW,EAAE,EAAI,GAC3DyyD,GAAUF,GAAK,cACnB,OAAIA,GAAK,UAAat0D,GAAI,WAAWs0D,GAAK,KAAK,IAC7C/yD,GAAM,IAAMA,GAAM,KAGhBizD,GAAQ,OAAS,GAAKjzD,GAAI,OAAS,IACrCA,IAAO,KAETA,IAAOizD,GACAjzD,EACX,EAQEgvD,EAAK,UAAU,YAAc,UAAY,CACvC,GAAI,KAAK,MAAM,SAAW,EACxB,MAAM,IAAI,MAAM,0GAA0G,EAE5H,GAAI,KAAK,IAAI,KAAK,MAAM,CAAC,EAAE,MAAQ,KAAK,MAAM,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC,GAAK,MACrE,MAAM,IAAI,MAAM,0GAA0G,EAW5H,IAAIkE,EAAW,KAAK,QAAU,KAAO7oC,EAAI,KAAK,KAAK,EAAI,EACnD8oC,GAAe9oC,EAAI,KAAK,MAAM,CAAC,EAAE,KAAK,KAAK,EAC3C+oC,GAAa,KAAK,MAAM,CAAC,EAAE,OAC/B,GAAIF,IAAa,EACf,OAAOE,GAET,IAAIxC,GAAQ,KAAK,MAAM,CAAC,EAAE,MACtByC,GAAW,KAAK,IAAIH,EAAW,KAAK,IAAIE,GAAW,MAAQD,GAAcvC,EAAK,CAAC,EAAI,KAAK,KAAO,IACnG,GAAIyC,GAAW,WAAaA,GAAW,SAAU,OAAOD,GACxDC,GAAW,KAAK,IAAIA,EAAQ,EAC5B,IAAItgD,GAAW,KAAK,MAAM,CAAC,EAAE,KAAK,SAClC,QAASnO,MAAKmO,GACZ,MAAQ7S,GAAQ,gBAAgB6S,GAAUnO,EAAC,EAAG,CAC5C,IAAIoO,GAASD,GAASnO,EAAC,EACvB,GAAIoO,GAAO,WAAY,CACrB,IAAI2B,GAAO,KAAK,IAAI,KAAK,IAAIu+C,EAAW,KAAK,IAAIlgD,GAAO,MAAQmgD,GAAcvC,EAAK,CAAC,EAAI,KAAK,KAAO,GAAG,GACnGj8C,GAAO0+C,IAAY1+C,KAAS0+C,IAAYrgD,GAAO,KAAK,OAASogD,GAAW,KAAK,UAG/EA,GAAapgD,GACbqgD,GAAW1+C,GAEd,CACF,CAEH,OAAOy+C,EACX,EAeEpE,EAAK,UAAU,UAAY,SAAUxsB,EAAO,CAG1C,QAFIplC,GAAI,KAAK,QACT23B,GAAM,CAAA,EACD96B,GAAI,EAAGA,GAAIuoC,EAAM,SAExBplC,GAAIA,GAAE,GAAGolC,EAAMvoC,EAAC,CAAC,EACbA,KAAMuoC,EAAM,OAAS,GAHOvoC,KAAK,CAMrC,IAAIq5D,GAAWl2D,GAAE,YAIbm2D,GAAW7nC,EAAM4nC,EAAQ,EACzBE,GAAS,OACTC,GAAgBjgB,EAAM+f,GAAUD,EAAQ,EACxCG,GACFD,GAASD,GAETC,GAAS/qB,EAAIrrC,GAAE,UAAW,CAAA,EAE5B,IAAIqX,GAAI,IAAIu6C,EAAKwE,GAAQhxB,EAAMvoC,EAAC,EAAE,SAAQ,CAAE,EAC5C86B,GAAI,KAAKtgB,EAAC,EACVrX,GAAIyqB,EAASzqB,GAAGqX,EAAC,CAClB,CAOD,QADIi/C,GAAU,EACLnyB,GAAM,EAAGA,GAAMxM,GAAI,OAAQwM,KAClCmyB,GAAUxuB,EAAUwuB,GAAS3+B,GAAIwM,EAAG,EAAE,KAAK,EAE7C,OAAIiS,EAAMkgB,GAAS,KAAK,KAAK,IAC3Bt2D,GAAE,MAAQ,GAEZ23B,GAAI,KAAK33B,EAAC,EACH23B,EACX,EACE,IAAI4+B,EAAW,CACb,KAAM,CACJ,GAAI,CACF,KAAM,GACN,MAAO,EACP,WAAY,EACb,CACF,EACD,MAAO,CACL,GAAI,CACF,KAAM,GACN,MAAO,EACP,WAAY,EACb,EACD,GAAI,CACF,KAAM,KACN,MAAO,GACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,IACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,IACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,IACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,IACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,GACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,IACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,MACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,MACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,MACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,MACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,MACP,WAAY,EACb,CACF,EACD,KAAM,CACJ,GAAI,CACF,KAAM,GACN,MAAO,EACP,WAAY,EACb,EACD,KAAM,CACJ,KAAM,OACN,MAAO,GACP,WAAY,EACb,EACD,MAAO,CACL,KAAM,QACN,MAAO,IACP,WAAY,EACb,EACD,KAAM,CACJ,KAAM,OACN,MAAO,IACP,WAAY,EACb,EACD,KAAM,CACJ,KAAM,OACN,MAAO,IACP,WAAY,EACb,EACD,KAAM,CACJ,KAAM,OACN,MAAO,IACP,WAAY,EACb,EACD,KAAM,CACJ,KAAM,OACN,MAAO,KACP,WAAY,EACb,EACD,KAAM,CACJ,KAAM,OACN,MAAO,KACP,WAAY,EACb,EACD,IAAK,CACH,KAAM,MACN,MAAO,KACP,WAAY,EACb,EACD,MAAO,CACL,KAAM,QACN,MAAO,KACP,WAAY,EACb,EACD,MAAO,CACL,KAAM,QACN,MAAO,KACP,WAAY,EACb,EACD,KAAM,CACJ,KAAM,OACN,MAAO,GACP,WAAY,EACb,EACD,MAAO,CACL,KAAM,QACN,MAAO,IACP,WAAY,EACb,EACD,MAAO,CACL,KAAM,QACN,MAAO,KACP,WAAY,EACb,EACD,MAAO,CACL,KAAM,QACN,MAAO,KACP,WAAY,EACb,EACD,KAAM,CACJ,KAAM,OACN,MAAO,KACP,WAAY,EACb,EACD,KAAM,CACJ,KAAM,OACN,MAAO,MACP,WAAY,EACb,EACD,MAAO,CACL,KAAM,QACN,MAAO,MACP,WAAY,EACb,EACD,KAAM,CACJ,KAAM,OACN,MAAO,MACP,WAAY,EACb,EACD,MAAO,CACL,KAAM,QACN,MAAO,MACP,WAAY,EACb,EACD,MAAO,CACL,KAAM,QACN,MAAO,MACP,WAAY,EACb,CACF,EACD,QAAS,CACP,GAAI,CACF,KAAM,GACN,MAAO,EACP,WAAY,EACb,EACD,GAAI,CACF,KAAM,KACN,MAAO,IACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,IACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,IACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,IACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,MACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,MACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,MACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,MACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,MACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,MACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,MACP,WAAY,EACb,CACF,EACD,MAAO,CACL,GAAI,CACF,KAAM,GACN,MAAO,EACP,WAAY,EACb,EACD,GAAI,CACF,KAAM,KACN,MAAO,IACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,IACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,IACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,MACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,MACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,MACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,MACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,MACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,MACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,MACP,WAAY,EACb,CACF,EACD,gBAAiB,CACf,GAAI,CACF,KAAM,GACN,MAAO,EACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,IACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,IACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,IACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,EACD,EAAG,CACD,KAAM,IACN,MAAO,KACP,WAAY,EACb,CACF,EACD,iBAAkB,CAChB,GAAI,CACF,KAAM,GACN,MAAO,EACP,WAAY,EACb,EACD,GAAI,CACF,KAAM,KACN,MAAO,KACP,WAAY,EACb,EACD,GAAI,CACF,KAAM,KACN,MAAO,KAAK,IAAI,KAAM,CAAC,EACvB,WAAY,EACb,EACD,GAAI,CACF,KAAM,KACN,MAAO,KAAK,IAAI,KAAM,CAAC,EACvB,WAAY,EACb,EACD,GAAI,CACF,KAAM,KACN,MAAO,KAAK,IAAI,KAAM,CAAC,EACvB,WAAY,EACb,EACD,GAAI,CACF,KAAM,KACN,MAAO,KAAK,IAAI,KAAM,CAAC,EACvB,WAAY,EACb,EACD,GAAI,CACF,KAAM,KACN,MAAO,KAAK,IAAI,KAAM,CAAC,EACvB,WAAY,EACb,EACD,GAAI,CACF,KAAM,KACN,MAAO,KAAK,IAAI,KAAM,CAAC,EACvB,WAAY,EACb,EACD,GAAI,CACF,KAAM,KACN,MAAO,KAAK,IAAI,KAAM,CAAC,EACvB,WAAY,EACb,CACF,EACD,eAAgB,CACd,GAAI,CACF,KAAM,GACN,MAAO,EACP,WAAY,EACb,EACD,KAAM,CACJ,KAAM,OACN,MAAO,IACP,WAAY,EACb,EACD,KAAM,CACJ,KAAM,OACN,MAAO,IACP,WAAY,EACb,EACD,KAAM,CACJ,KAAM,OACN,MAAO,IACP,WAAY,EACb,EACD,KAAM,CACJ,KAAM,OACN,MAAO,KACP,WAAY,EACb,EACD,KAAM,CACJ,KAAM,OACN,MAAO,KACP,WAAY,EACb,EACD,IAAK,CACH,KAAM,MACN,MAAO,KACP,WAAY,EACb,EACD,MAAO,CACL,KAAM,QACN,MAAO,KACP,WAAY,EACb,EACD,MAAO,CACL,KAAM,QACN,MAAO,KACP,WAAY,EACb,CACF,EACD,gBAAiB,CACf,GAAI,CACF,KAAM,GACN,MAAO,EACP,WAAY,EACb,EACD,KAAM,CACJ,KAAM,OACN,MAAO,KACP,WAAY,EACb,EACD,KAAM,CACJ,KAAM,OACN,MAAO,KAAK,IAAI,KAAM,CAAC,EACvB,WAAY,EACb,EACD,KAAM,CACJ,KAAM,OACN,MAAO,KAAK,IAAI,KAAM,CAAC,EACvB,WAAY,EACb,EACD,KAAM,CACJ,KAAM,OACN,MAAO,KAAK,IAAI,KAAM,CAAC,EACvB,WAAY,EACb,EACD,KAAM,CACJ,KAAM,OACN,MAAO,KAAK,IAAI,KAAM,CAAC,EACvB,WAAY,EACb,EACD,IAAK,CACH,KAAM,MACN,MAAO,KAAK,IAAI,KAAM,CAAC,EACvB,WAAY,EACb,EACD,KAAM,CACJ,KAAM,OACN,MAAO,KAAK,IAAI,KAAM,CAAC,EACvB,WAAY,EACb,EACD,KAAM,CACJ,KAAM,OACN,MAAO,KAAK,IAAI,KAAM,CAAC,EACvB,WAAY,EACb,CACF,EACD,IAAK,CACH,GAAI,CACF,KAAM,GACN,MAAO,EACP,WAAY,EACb,EACD,GAAI,CACF,KAAM,KACN,MAAO,IACP,WAAY,EACb,CACF,CACL,EACEA,EAAS,aAAgBzyD,GAAU,SAAY,GAAIyyD,EAAS,MAAOA,EAAS,IAAI,EAChFA,EAAS,gBAAmBzyD,GAAU,SAAY,GAAIyyD,EAAS,gBAAiBA,EAAS,gBAAgB,EACzGA,EAAS,eAAkBzyD,GAAU,SAAY,GAAIyyD,EAAS,eAAgBA,EAAS,eAAe,EAkBtG,IAAInE,EAAkB,CAAC,OAAQ,SAAU,OAAQ,UAAW,cAAe,qBAAsB,sBAAuB,QAAS,KAAK,EAClIgC,EAAa,CACf,KAAM,CACJ,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,CACvC,EACD,KAAM,CACJ,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,CACvC,EACD,OAAQ,CACN,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,CACvC,EACD,KAAM,CACJ,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,CACvC,EACD,QAAS,CACP,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,CACvC,EACD,YAAa,CACX,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,CACvC,EACD,mBAAoB,CAClB,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,CACvC,EACD,oBAAqB,CACnB,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,CACvC,EACD,MAAO,CACL,WAAY,CAAC,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,CACxC,EACD,QAAS,CACP,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,CACvC,EACD,OAAQ,CACN,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,CACvC,EACD,OAAQ,CACN,WAAY,CAAC,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,CACxC,EACD,MAAO,CACL,WAAY,CAAC,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,CACxC,EACD,SAAU,CACR,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,CACzC,EACD,gBAAiB,CACf,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,CACvC,EACD,qBAAsB,CACpB,WAAY,CAAC,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,CACzC,EACD,mBAAoB,CAClB,WAAY,CAAC,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,CAAC,CACzC,EACD,oBAAqB,CACnB,WAAY,CAAC,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,CAAC,CACzC,EACD,oBAAqB,CACnB,WAAY,CAAC,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,CAAC,CACzC,EACD,qBAAsB,CACpB,WAAY,CAAC,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,CACzC,EACD,cAAe,CACb,WAAY,CAAC,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,CAAC,CACzC,EACD,sBAAuB,CACrB,WAAY,CAAC,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,CAAC,CACzC,EACD,UAAW,CACT,WAAY,CAAC,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,CACxC,EACD,MAAO,CACL,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,CACvC,EACD,IAAK,CACH,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,CACvC,CACL,EACE,QAASr3D,KAAOq3D,KACNtxD,GAAQ,gBAAgBsxD,EAAYr3D,CAAG,IAC7Cq3D,EAAWr3D,CAAG,EAAE,IAAMA,GAG1B,IAAIy5D,EAAiB,CAAA,EACjBC,GAAY,CACd,KAAM,GACN,KAAMD,EACN,MAAO,EACP,OAAQ,EACR,WAAYpE,EAAgB,IAAI,SAAUpyD,EAAG,CAC3C,MAAO,EACb,CAAK,CACL,EACM+zD,EAAQ,CAEV,MAAO,CACL,KAAM,QACN,KAAMK,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,EACP,OAAQ,CACT,EACD,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,MACP,OAAQ,CACT,EACD,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,MACP,OAAQ,CACT,EACD,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,MACP,OAAQ,CACT,EACD,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,SACP,OAAQ,CACT,EACD,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,QACP,OAAQ,CACT,EACD,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,OACP,OAAQ,CACT,EACD,MAAO,CACL,KAAM,QACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,QACP,OAAQ,CACT,EACD,SAAU,CACR,KAAM,WACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,MACP,OAAQ,CACT,EACD,EAAG,CACD,KAAM,IACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,MACnB,MAAO,EACP,OAAQ,CACT,EACD,GAAM,CACJ,KAAM,KACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,MACP,OAAQ,CACT,EACD,GAAI,CACF,KAAM,KACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,MACP,OAAQ,CACT,EACD,GAAI,CACF,KAAM,KACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,MACP,OAAQ,CACT,EACD,GAAI,CACF,KAAM,KACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,SACP,OAAQ,CACT,EACD,GAAI,CACF,KAAM,KACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,QACP,OAAQ,CACT,EACD,GAAI,CACF,KAAM,KACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,QACP,OAAQ,CACT,EACD,GAAI,CACF,KAAM,KACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,QACP,OAAQ,CACT,EACD,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,OACP,OAAQ,CACT,EAID,GAAI,CACF,KAAM,KACN,KAAMnC,EAAW,QACjB,SAAUmC,EAAS,QACnB,MAAO,EACP,OAAQ,CACT,EACD,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,QACjB,SAAUmC,EAAS,KACnB,MAAO,SACP,OAAQ,CACT,EAED,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,QACjB,SAAUmC,EAAS,KACnB,MAAO,UACP,OAAQ,CACT,EAED,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,QACjB,SAAUmC,EAAS,KACnB,MAAO,UACP,OAAQ,CACT,EAED,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,QACjB,SAAUmC,EAAS,KACnB,MAAO,iBACP,OAAQ,CACT,EAED,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,QACjB,SAAUmC,EAAS,KACnB,MAAO,SACP,OAAQ,CACT,EAED,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,QACjB,SAAUmC,EAAS,KACnB,MAAO,SACP,OAAQ,CACT,EAED,MAAO,CACL,KAAM,QACN,KAAMnC,EAAW,QACjB,SAAUmC,EAAS,KACnB,MAAO,UACP,OAAQ,CACT,EAED,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,QACjB,SAAUmC,EAAS,KACnB,MAAO,QACP,OAAQ,CACT,EAED,QAAS,CACP,KAAM,UACN,KAAMnC,EAAW,QACjB,SAAUmC,EAAS,KACnB,MAAO,IACP,OAAQ,CACT,EAID,GAAI,CACF,KAAM,KACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,MACnB,MAAO,EACP,OAAQ,CACT,EACD,EAAG,CACD,KAAM,IACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,MACnB,MAAO,KACP,OAAQ,CACT,EAED,EAAG,CACD,KAAM,IACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,MACnB,MAAO,KACP,OAAQ,CACT,EAED,MAAO,CACL,KAAM,QACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,KACP,OAAQ,CACT,EACD,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,aACP,OAAQ,CACT,EAED,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,cACP,OAAQ,CACT,EAED,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,cACP,OAAQ,CACT,EAED,SAAU,CACR,KAAM,WACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,KACP,OAAQ,CACT,EAED,WAAY,CACV,KAAM,aACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,MACP,OAAQ,CACT,EAGD,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,KACP,OAAQ,CACT,EAED,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,KACP,OAAQ,CACT,EAID,MAAO,CACL,KAAM,QACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,YACP,OAAQ,CACT,EAED,UAAW,CACT,KAAM,YACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,aACP,OAAQ,CACT,EAED,WAAY,CACV,KAAM,aACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,YACP,OAAQ,CACT,EAED,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,YACP,OAAQ,CACT,EAED,GAAI,CACF,KAAM,KACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,KACP,OAAQ,CACT,EAED,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,YACP,OAAQ,CACT,EAED,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,YACP,OAAQ,CACT,EAED,MAAO,CACL,KAAM,QACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,YACP,OAAQ,CACT,EAED,OAAQ,CACN,KAAM,SACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,WACP,OAAQ,CACT,EAED,WAAY,CACV,KAAM,aACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,SACP,OAAQ,CACT,EAED,UAAW,CACT,KAAM,YACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,SACP,OAAQ,CACT,EAED,SAAU,CACR,KAAM,WACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,QACP,OAAQ,CACT,EAID,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,aACP,OAAQ,CACT,EAED,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,YACP,OAAQ,CACT,EAED,GAAI,CACF,KAAM,KACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,YACP,OAAQ,CACT,EAED,GAAI,CACF,KAAM,KACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,YACP,OAAQ,CACT,EAED,GAAI,CACF,KAAM,KACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,YACP,OAAQ,CACT,EAED,GAAI,CACF,KAAM,KACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,YACP,OAAQ,CACT,EAED,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,WACP,OAAQ,CACT,EAED,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,SACP,OAAQ,CACT,EAED,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,SACP,OAAQ,CACT,EAKD,EAAG,CACD,KAAM,IACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,MACnB,MAAO,KACP,OAAQ,CACT,EACD,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,KACP,OAAQ,CACT,EACD,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,MACnB,MAAO,UACP,OAAQ,CACT,EACD,EAAG,CACD,KAAM,IACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,MACnB,MAAO,IACP,OAAQ,CACT,EACD,MAAO,CACL,KAAM,QACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,IACP,OAAQ,CACT,EACD,MAAO,CACL,KAAM,QACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,YACP,OAAQ,CACT,EACD,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,kBACP,OAAQ,CACT,EACD,MAAO,CACL,KAAM,QACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,cACP,OAAQ,CACT,EACD,UAAW,CACT,KAAM,YACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,UACP,OAAQ,CACT,EACD,cAAe,CACb,KAAM,gBACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,UACP,OAAQ,CACT,EACD,MAAO,CACL,KAAM,QACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,KACP,OAAQ,CACT,EACD,MAAO,CACL,KAAM,QACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,WACP,OAAQ,CACT,EACD,GAAI,CACF,KAAM,KACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,YACP,OAAQ,CACT,EACD,GAAI,CACF,KAAM,KACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,kBACP,OAAQ,CACT,EACD,GAAI,CACF,KAAM,KACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,cACP,OAAQ,CACT,EACD,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,UACP,OAAQ,CACT,EACD,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,UACP,OAAQ,CACT,EAED,EAAG,CACD,KAAM,IACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,MACnB,MAAO,EACP,OAAQ,CACT,EACD,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,GACP,OAAQ,CACT,EACD,EAAG,CACD,KAAM,IACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,KACP,OAAQ,CACT,EACD,OAAQ,CACN,KAAM,SACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,EACP,OAAQ,CACT,EACD,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,EACP,OAAQ,CACT,EACD,OAAQ,CACN,KAAM,SACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,GACP,OAAQ,CACT,EACD,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,KACP,OAAQ,CACT,EACD,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,MACP,OAAQ,CACT,EACD,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,EAAI,MACX,OAAQ,CACT,EACD,MAAO,CACL,KAAM,QACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,QAEP,OAAQ,CACT,EACD,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,SAEP,OAAQ,CACT,EACD,OAAQ,CACN,KAAM,SACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,SAEP,OAAQ,CACT,EACD,QAAS,CACP,KAAM,UACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,SAEP,OAAQ,CACT,EACD,WAAY,CACV,KAAM,aACN,KAAMnC,EAAW,KACjB,SAAUmC,EAAS,KACnB,MAAO,SAEP,OAAQ,CACT,EAED,MAAO,CACL,KAAM,QACN,KAAMnC,EAAW,UACjB,SAAUmC,EAAS,KACnB,MAAO,EACP,OAAQ,EACR,WAAY,EACb,EACD,GAAI,CACF,KAAM,KACN,KAAMnC,EAAW,UACjB,SAAUmC,EAAS,MACnB,MAAO,EACP,OAAQ,EACR,WAAY,EACb,EAED,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,MACjB,SAAUmC,EAAS,MACnB,MAAO,EACP,OAAQ,CACT,EACD,OAAQ,CACN,KAAM,SACN,KAAMnC,EAAW,MACjB,SAAUmC,EAAS,KACnB,MAAO,EACP,OAAQ,CACT,EAED,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,MACjB,SAAUmC,EAAS,MACnB,MAAO,KAEP,OAAQ,CACT,EACD,OAAQ,CACN,KAAM,SACN,KAAMnC,EAAW,MACjB,SAAUmC,EAAS,KACnB,MAAO,KAEP,OAAQ,CACT,EAED,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,MACjB,SAAUmC,EAAS,MACnB,MAAO,KAEP,OAAQ,CACT,EACD,QAAS,CACP,KAAM,UACN,KAAMnC,EAAW,MACjB,SAAUmC,EAAS,KACnB,MAAO,KAEP,OAAQ,CACT,EAED,MAAO,CACL,KAAM,QACN,KAAMnC,EAAW,MACjB,SAAUmC,EAAS,KACnB,MAAO,KAEP,OAAQ,CACT,EAED,OAAQ,CACN,KAAM,SACN,KAAMnC,EAAW,MACjB,SAAUmC,EAAS,KACnB,MAAO,KAEP,OAAQ,CACT,EAED,OAAQ,CACN,KAAM,SACN,KAAMnC,EAAW,MACjB,SAAUmC,EAAS,KACnB,MAAO,KAEP,OAAQ,CACT,EAED,EAAG,CACD,KAAM,IACN,KAAMnC,EAAW,QACjB,SAAUmC,EAAS,MACnB,MAAO,EACP,OAAQ,CACT,EACD,OAAQ,CACN,KAAM,SACN,KAAMnC,EAAW,QACjB,SAAUmC,EAAS,KACnB,MAAO,EACP,OAAQ,CACT,EAKD,EAAG,CACD,KAAM,IACN,KAAMnC,EAAW,YACjB,SAAUmC,EAAS,MACnB,MAAO,EACP,OAAQ,CACT,EACD,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,YACjB,SAAUmC,EAAS,MACnB,MAAO,EACP,OAAQ,MACT,EACD,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,YACjB,SAAUmC,EAAS,MACnB,MAAO,EAAI,IACX,OAAQ,MACT,EACD,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,YACjB,SAAUmC,EAAS,MACnB,MAAO,EAAI,IACX,OAAQ,CACT,EACD,OAAQ,CACN,KAAM,SACN,KAAMnC,EAAW,YACjB,SAAUmC,EAAS,KACnB,MAAO,EACP,OAAQ,CACT,EACD,QAAS,CACP,KAAM,UACN,KAAMnC,EAAW,YACjB,SAAUmC,EAAS,KACnB,MAAO,EACP,OAAQ,MACT,EACD,WAAY,CACV,KAAM,aACN,KAAMnC,EAAW,YACjB,SAAUmC,EAAS,KACnB,MAAO,EAAI,IACX,OAAQ,MACT,EACD,QAAS,CACP,KAAM,UACN,KAAMnC,EAAW,YACjB,SAAUmC,EAAS,KACnB,MAAO,EAAI,IACX,OAAQ,CACT,EAED,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,oBACjB,SAAUmC,EAAS,MACnB,MAAO,EACP,OAAQ,CACT,EACD,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,oBACjB,SAAUmC,EAAS,KACnB,MAAO,EACP,OAAQ,CACT,EAED,GAAI,CACF,KAAM,KACN,KAAMnC,EAAW,mBACjB,SAAUmC,EAAS,MACnB,MAAO,EACP,OAAQ,CACT,EACD,QAAS,CACP,KAAM,UACN,KAAMnC,EAAW,mBACjB,SAAUmC,EAAS,KACnB,MAAO,EACP,OAAQ,CACT,EAMD,EAAG,CACD,KAAM,IACN,KAAMnC,EAAW,MACjB,SAAUmC,EAAS,MACnB,MAAO,EACP,OAAQ,CACT,EACD,OAAQ,CACN,KAAM,SACN,KAAMnC,EAAW,MACjB,SAAUmC,EAAS,KACnB,MAAO,EACP,OAAQ,CACT,EACD,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,MACjB,SAAUmC,EAAS,MACnB,MAAO,KACP,OAAQ,CACT,EACD,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,MACjB,SAAUmC,EAAS,KACnB,MAAO,KACP,OAAQ,CACT,EACD,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,MACjB,SAAUmC,EAAS,KACnB,MAAO,gBACP,OAAQ,CACT,EACD,WAAY,CACV,KAAM,aACN,KAAMnC,EAAW,MACjB,SAAUmC,EAAS,KACnB,MAAO,gBACP,OAAQ,CACT,EACD,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,MACjB,SAAUmC,EAAS,KACnB,MAAO,UACP,OAAQ,CACT,EACD,cAAe,CACb,KAAM,gBACN,KAAMnC,EAAW,MACjB,SAAUmC,EAAS,KACnB,MAAO,QACP,OAAQ,CACT,EAED,EAAG,CACD,KAAM,IACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,MACnB,MAAO,EACP,OAAQ,CACT,EACD,MAAO,CACL,KAAM,QACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,MACnB,MAAO,EACP,OAAQ,CACT,EACD,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,KACP,OAAQ,CACT,EACD,GAAI,CACF,KAAM,KACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,MACnB,MAAO,KACP,OAAQ,CACT,EACD,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,IACnB,MAAO,cACP,OAAQ,CACT,EACD,GAAI,CACF,KAAM,KACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,MACnB,MAAO,eACP,OAAQ,CACT,EACD,aAAc,CACZ,KAAM,eACN,KAAMnC,EAAW,OACjB,SAAUmC,EAAS,KACnB,MAAO,eACP,OAAQ,CACT,EAED,EAAG,CACD,KAAM,IACN,KAAMnC,EAAW,MACjB,SAAUmC,EAAS,MACnB,MAAO,EACP,OAAQ,CACT,EACD,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,MACjB,SAAUmC,EAAS,KACnB,MAAO,EACP,OAAQ,CACT,EACD,GAAI,CACF,KAAM,KACN,KAAMnC,EAAW,MACjB,SAAUmC,EAAS,KACnB,MAAO,eACP,OAAQ,CACT,EAED,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,MACjB,SAAUmC,EAAS,MACnB,MAAO5zC,EAAQ,EACf,OAAQ,CACT,EACD,GAAI,CACF,KAAM,KACN,KAAMyxC,EAAW,MACjB,SAAUmC,EAAS,MACnB,MAAO,EACP,OAAQ,CACT,EAED,GAAI,CACF,KAAM,KACN,KAAMnC,EAAW,SACjB,SAAUmC,EAAS,MACnB,MAAO,EACP,OAAQ,CACT,EACD,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,SACjB,SAAUmC,EAAS,KACnB,MAAO,iBACP,OAAQ,CACT,EACD,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,SACjB,SAAUmC,EAAS,KACnB,MAAO,OACP,OAAQ,CACT,EACD,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,SACjB,SAAUmC,EAAS,UACnB,MAAO,IACP,OAAQ,CACT,EACD,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,SACjB,SAAUmC,EAAS,KACnB,MAAO,QACP,OAAQ,CACT,EACD,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,SACjB,SAAUmC,EAAS,KACnB,MAAO,QACP,OAAQ,CACT,EACD,MAAO,CACL,KAAM,QACN,KAAMnC,EAAW,SACjB,SAAUmC,EAAS,KACnB,MAAO,QACP,OAAQ,CACT,EACD,MAAO,CACL,KAAM,QACN,KAAMnC,EAAW,SACjB,SAAUmC,EAAS,KACnB,MAAO,QACP,OAAQ,CACT,EAED,QAAS,CACP,KAAM,UACN,KAAMnC,EAAW,gBACjB,SAAUmC,EAAS,KACnB,MAAO,EACP,OAAQ,CACT,EACD,EAAG,CACD,KAAM,IACN,KAAMnC,EAAW,gBACjB,SAAUmC,EAAS,MACnB,MAAO,EACP,OAAQ,CACT,EAED,MAAO,CACL,KAAM,QACN,KAAMnC,EAAW,qBACjB,SAAUmC,EAAS,KACnB,MAAO,EACP,OAAQ,CACT,EACD,EAAG,CACD,KAAM,IACN,KAAMnC,EAAW,qBACjB,SAAUmC,EAAS,MACnB,MAAO,EACP,OAAQ,CACT,EAED,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,mBACjB,SAAUmC,EAAS,KACnB,MAAO,EACP,OAAQ,CACT,EACD,EAAG,CACD,KAAM,IACN,KAAMnC,EAAW,mBACjB,SAAUmC,EAAS,MACnB,MAAO,EACP,OAAQ,CACT,EAED,IAAK,CACH,KAAM,MACN,KAAMnC,EAAW,oBACjB,SAAUmC,EAAS,UAEnB,MAAO,EACP,OAAQ,CACT,EAYD,MAAO,CACL,KAAM,QACN,KAAMnC,EAAW,oBACjB,SAAUmC,EAAS,KACnB,MAAO,EACP,OAAQ,CACT,EACD,EAAG,CACD,KAAM,IACN,KAAMnC,EAAW,oBACjB,SAAUmC,EAAS,MACnB,MAAO,EACP,OAAQ,CACT,EAED,QAAS,CACP,KAAM,UACN,KAAMnC,EAAW,qBACjB,SAAUmC,EAAS,KACnB,MAAO,EACP,OAAQ,CACT,EACD,EAAG,CACD,KAAM,IACN,KAAMnC,EAAW,qBACjB,SAAUmC,EAAS,MACnB,MAAO,EACP,OAAQ,CACT,EAED,MAAO,CACL,KAAM,QACN,KAAMnC,EAAW,cACjB,SAAUmC,EAAS,KACnB,MAAO,EACP,OAAQ,CACT,EACD,GAAI,CACF,KAAM,KACN,KAAMnC,EAAW,cACjB,SAAUmC,EAAS,MACnB,MAAO,EACP,OAAQ,CACT,EAED,MAAO,CACL,KAAM,QACN,KAAMnC,EAAW,sBACjB,SAAUmC,EAAS,KACnB,MAAO,EACP,OAAQ,CACT,EACD,EAAG,CACD,KAAM,IACN,KAAMnC,EAAW,sBACjB,SAAUmC,EAAS,MACnB,MAAO,EACP,OAAQ,CACT,EAED,EAAG,CACD,KAAM,IACN,KAAMnC,EAAW,IACjB,SAAUmC,EAAS,aACnB,MAAO,EACP,OAAQ,CACT,EACD,KAAM,CACJ,KAAM,OACN,KAAMnC,EAAW,IACjB,SAAUmC,EAAS,YACnB,MAAO,EACP,OAAQ,CACT,EACD,EAAG,CACD,KAAM,IACN,KAAMnC,EAAW,IACjB,SAAUmC,EAAS,aACnB,MAAO,EACP,OAAQ,CACT,EACD,MAAO,CACL,KAAM,QACN,KAAMnC,EAAW,IACjB,SAAUmC,EAAS,YACnB,MAAO,EACP,OAAQ,CACT,CACL,EAGMG,EAAU,CACZ,OAAQ,QACR,OAAQ,OACR,KAAM,OACN,MAAO,OACP,MAAO,OACP,MAAO,OACP,KAAM,MACN,OAAQ,QACR,UAAW,WACX,GAAI,IACJ,OAAQ,QACR,MAAO,QACP,OAAQ,QACR,UAAW,WACX,YAAa,aACb,OAAQ,QACR,WAAY,YACZ,YAAa,aACb,MAAO,OACP,KAAM,MACN,MAAO,OACP,OAAQ,QACR,QAAS,SACT,YAAa,aACb,WAAY,YACZ,UAAW,WACX,KAAM,MACN,MAAO,OACP,KAAM,MACN,OAAQ,QACR,OAAQ,QACR,MAAO,OACP,OAAQ,QACR,YAAa,YACb,eAAgB,gBAChB,OAAQ,QACR,GAAI,MACJ,IAAK,MACL,KAAM,MACN,IAAK,gBACL,MAAO,OACP,SAAU,UACV,OAAQ,OACR,OAAQ,OACR,OAAQ,OACR,QAAS,OACT,KAAM,OACN,MAAO,QACP,MAAO,QACP,QAAS,SACT,KAAM,SACN,QAAS,SACT,KAAM,SACN,MAAO,OACP,GAAI,OACJ,IAAK,OACL,KAAM,MACN,MAAO,OACP,OAAQ,QACR,MAAO,OACP,QAAS,SACT,UAAW,UACX,UAAW,aACX,MAAO,QACP,QAAS,SACT,QAAS,SACT,SAAU,UACV,OAAQ,QACR,UAAW,SACX,WAAY,SACZ,UAAW,SACX,WAAY,SACZ,KAAM,MACN,MAAO,OACP,OAAQ,QACR,QAAS,SACT,SAAU,UACV,MAAO,OACP,KAAM,MACN,OAAQ,QACR,OAAQ,QACR,OAAQ,QACR,cAAe,eACf,MAAO,OACP,IAAK,OACL,KAAQ,OACZ,EAOE,SAASC,GAAqB35D,EAAQ,CACpC,GAAIA,EAAO,SAAW,YAAa,CACjC,IAAIgwB,MAAS4S,IAAW,mBAAmBoV,CAAU,EACrD+e,EAAM,IAAI,MAAQ,IAAI/e,EAAW,CAAC,EAClC+e,EAAM,IAAI,MAAQ/mC,GAAG,IAAI,GAAG,EAC5B+mC,EAAM,KAAK,MAAQ/mC,GAAG,IAAI,GAAG,EAC7B+mC,EAAM,MAAM,MAAQ/mC,GAAG,MAAM,CAAC,EAC9B+mC,EAAM,OAAO,MAAQ/mC,GAAG,IAAI,KAAM,EAClC+mC,EAAM,OAAO,MAAQ/mC,GAAG,IAAI,KAAK,CACvC,MAEM+mC,EAAM,IAAI,MAAQ,EAClBA,EAAM,IAAI,MAAQ,KAAK,GAAK,IAC5BA,EAAM,KAAK,MAAQ,KAAK,GAAK,IAC7BA,EAAM,MAAM,MAAQ,KAAK,GAAK,EAC9BA,EAAM,OAAO,MAAQ,KAAK,GAAK,MAC/BA,EAAM,OAAO,MAAQ,KAAK,GAAK,MAIjCA,EAAM,OAAO,MAAQA,EAAM,IAAI,MAC/BA,EAAM,OAAO,MAAQA,EAAM,IAAI,MAC/BA,EAAM,QAAQ,MAAQA,EAAM,KAAK,KAClC,CAGD4C,GAAqB35D,CAAM,EACvB8xB,GAEFA,EAAG,SAAU,SAAUvrB,EAAMF,GAAM,CAC7BE,EAAK,SAAWF,GAAK,QACvBszD,GAAqBpzD,CAAI,CAEjC,CAAK,EAQH,IAAImwD,GAAe,CACjB,GAAI,CAEF,KAAM,CACJ,KAAM+C,GACN,OAAQF,EAAS,KAAK,EAAE,CACzB,EACD,OAAQ,CACN,KAAMxC,EAAM,EACZ,OAAQwC,EAAS,MAAM,EAAE,CAC1B,EACD,KAAM,CACJ,KAAMxC,EAAM,EACZ,OAAQwC,EAAS,MAAM,CACxB,EACD,KAAM,CACJ,KAAMxC,EAAM,EACZ,OAAQwC,EAAS,MAAM,EAAE,CAC1B,EACD,QAAS,CACP,KAAMxC,EAAM,EACZ,OAAQwC,EAAS,MAAM,EAAE,CAC1B,EACD,YAAa,CACX,KAAMxC,EAAM,EACZ,OAAQwC,EAAS,MAAM,EAAE,CAC1B,EACD,mBAAoB,CAClB,KAAMxC,EAAM,GACZ,OAAQwC,EAAS,MAAM,EAAE,CAC1B,EACD,oBAAqB,CACnB,KAAMxC,EAAM,IACZ,OAAQwC,EAAS,MAAM,EAAE,CAC1B,EACD,MAAO,CACL,KAAMxC,EAAM,IACZ,OAAQwC,EAAS,MAAM,EAAE,CAC1B,EACD,IAAK,CACH,KAAMxC,EAAM,KACZ,OAAQwC,EAAS,MAAM,EAAE,CAC1B,EAED,MAAO,CACL,KAAMxC,EAAM,EACZ,OAAQwC,EAAS,MAAM,EAAE,CAC1B,EACD,OAAQ,CACN,KAAMxC,EAAM,EACZ,OAAQwC,EAAS,MAAM,EAAE,CAC1B,EACD,MAAO,CACL,KAAMxC,EAAM,EACZ,OAAQwC,EAAS,MAAM,EAAE,CAC1B,EACD,SAAU,CACR,KAAMxC,EAAM,GACZ,OAAQwC,EAAS,MAAM,EAAE,CAC1B,EACD,gBAAiB,CACf,KAAMxC,EAAM,EACZ,OAAQwC,EAAS,MAAM,EAAE,CAC1B,EACD,qBAAsB,CACpB,KAAMxC,EAAM,EACZ,OAAQwC,EAAS,MAAM,EAAE,CAC1B,EACD,mBAAoB,CAClB,KAAMxC,EAAM,EACZ,OAAQwC,EAAS,MAAM,EAAE,CAC1B,EACD,oBAAqB,CACnB,KAAMxC,EAAM,IACZ,OAAQwC,EAAS,MAAM,EAAE,CAC1B,EACD,oBAAqB,CACnB,KAAMxC,EAAM,EACZ,OAAQwC,EAAS,MAAM,EAAE,CAC1B,EACD,qBAAsB,CACpB,KAAMxC,EAAM,EACZ,OAAQwC,EAAS,MAAM,EAAE,CAC1B,EACD,cAAe,CACb,KAAMxC,EAAM,GACZ,OAAQwC,EAAS,MAAM,EAAE,CAC1B,EACD,sBAAuB,CACrB,KAAMxC,EAAM,EACZ,OAAQwC,EAAS,MAAM,EAAE,CAC1B,EACD,UAAW,CACT,KAAMxC,EAAM,GACZ,OAAQwC,EAAS,MAAM,EAAE,CAC1B,CACF,CACL,EAGE7C,GAAa,IAAM,KAAK,MAAM,KAAK,UAAUA,GAAa,EAAE,CAAC,EAC7DA,GAAa,IAAI,OAAS,CACxB,KAAMK,EAAM,EACZ,OAAQwC,EAAS,MAAM,CAC3B,EACE7C,GAAa,IAAI,KAAO,CACtB,KAAMK,EAAM,EACZ,OAAQwC,EAAS,MAAM,EAAE,CAC7B,EACE7C,GAAa,IAAI,MAAQ,CACvB,KAAMK,EAAM,IACZ,OAAQwC,EAAS,MAAM,EAAE,CAC7B,EACE7C,GAAa,IAAI,OAAS,CACxB,KAAMK,EAAM,IACZ,OAAQwC,EAAS,KAAK,EAAE,CAC5B,EAIE7C,GAAa,GAAK,KAAK,MAAM,KAAK,UAAUA,GAAa,EAAE,CAAC,EAC5DA,GAAa,GAAG,OAAS,CACvB,KAAMK,EAAM,GACZ,OAAQwC,EAAS,KAAK,EAAE,CAC5B,EACE7C,GAAa,GAAG,KAAO,CACrB,KAAMK,EAAM,IACZ,OAAQwC,EAAS,KAAK,EAAE,CAC5B,EACE7C,GAAa,GAAG,YAAc,CAC5B,KAAMK,EAAM,KACZ,OAAQwC,EAAS,KAAK,EAAE,CAC5B,EACE7C,GAAa,GAAG,MAAQ,CACtB,KAAMK,EAAM,IACZ,OAAQwC,EAAS,KAAK,EAAE,CAC5B,EACE7C,GAAa,GAAG,OAAS,CACvB,KAAMK,EAAM,IACZ,OAAQwC,EAAS,IAAI,EAAE,CAC3B,EACE7C,GAAa,GAAG,MAAQ,CACtB,KAAMK,EAAM,GACZ,OAAQwC,EAAS,KAAK,EAAE,CAC5B,EACE7C,GAAa,GAAG,SAAW,CACzB,KAAMK,EAAM,IACZ,OAAQwC,EAAS,KAAK,EAAE,CAC5B,EAKE7C,GAAa,KAAO,KAAK,MAAM,KAAK,UAAUA,GAAa,EAAE,CAAC,EAG9D,IAAI0B,GAAoB1B,GAAa,KAMrC9B,EAAK,cAAgB,SAAUhuD,EAAM,CACnC,MAAQd,GAAQ,gBAAgB4wD,GAAc9vD,CAAI,EAChDwxD,GAAoB1B,GAAa9vD,CAAI,MAErC,OAAM,IAAI,MAAM,eAAiBA,EAAO,iCAAmC,OAAO,KAAK8vD,EAAY,EAAE,KAAK,IAAI,CAAC,CAErH,EAME9B,EAAK,cAAgB,UAAY,CAC/B,QAASjwC,KAAQ+xC,GACf,MAAQ5wD,GAAQ,gBAAgB4wD,GAAc/xC,CAAI,GAC5C+xC,GAAa/xC,CAAI,IAAMyzC,GACzB,OAAOzzC,CAIjB,EAMEiwC,EAAK,eAAiB,CACpB,UAAW,SAAmB5xD,GAAG,CAC/B,OAAO,IAAIg1C,EAAWh1C,GAAI,EAAE,CAC7B,EAED,SAAU,SAAkBA,GAAG,CAC7B,OAAO,IAAIy1C,EAAUz1C,EAAC,CACvB,EACD,QAAS,SAAiBA,GAAG,CAC3B,OAAOA,EACR,EACD,OAAQ,SAAgBA,GAAG,CACzB,OAAOA,EACR,CACL,EASE4xD,EAAK,UAAU,iBAAmB,UAAY,CAC5C,IAAIvqD,EAAUuqD,EAAK,eAAe,KAAK,UAAW,CAAA,EAClD,GAAIvqD,EACF,OAAOA,EAET,MAAM,IAAI,UAAU,gCAAkC,KAAK,UAAS,EAAK,GAAG,CAChF,EAUEuqD,EAAK,oBAAsB,SAAUrwD,EAAM,CACzC,GAAI,CAACqwD,EAAK,eAAerwD,CAAI,EAC3B,MAAM,IAAI,UAAU,qBAAuBA,EAAO,GAAG,EAEvD,OAAOqwD,EAAK,eAAerwD,CAAI,CACnC,EAGE,QAAS2gB,MAAS6xC,EAChB,MAAQjxD,GAAQ,gBAAgBixD,EAAO7xC,EAAK,EAAG,CAC7C,IAAIujB,GAAOsuB,EAAM7xC,EAAK,EACtBujB,GAAK,WAAaA,GAAK,KAAK,UAC7B,CAIH,QAASmxB,MAAUF,EACjB,MAAQ5zD,GAAQ,gBAAgB4zD,EAASE,EAAM,EAAG,CAChD,IAAIC,GAAS9C,EAAM2C,EAAQE,EAAM,CAAC,EAC9BE,GAAQ,CAAA,EACZ,QAASC,MAASF,MACR/zD,GAAQ,gBAAgB+zD,GAAQE,EAAK,IAC3CD,GAAMC,EAAK,EAAIF,GAAOE,EAAK,GAG/BD,GAAM,KAAOF,GACb7C,EAAM6C,EAAM,EAAIE,EACjB,CAQHlF,EAAK,aAAe,SAAsB1lD,GAAG,CAC3C,MAAO,aAAa,KAAKA,EAAC,CAC9B,EACE,SAAS8qD,GAAsBpzD,EAAM,CACnC,QAAS/G,GAAI,EAAGA,GAAI+G,EAAK,OAAQ/G,KAAK,CAEpC,GADAqP,EAAItI,EAAK,OAAO/G,EAAC,EACbA,KAAM,GAAK,CAAC+0D,EAAK,aAAa1lD,CAAC,EACjC,MAAM,IAAI,MAAM,yDAA2DtI,EAAO,GAAG,EAEvF,GAAI/G,GAAI,GAAK,EAAE+0D,EAAK,aAAa1lD,CAAC,GAAKqmD,EAAQrmD,CAAC,GAC9C,MAAM,IAAI,MAAM,kEAAoEtI,EAAO,GAAG,CAEjG,CACF,CAoBD,OAAAguD,EAAK,WAAa,SAAUn1D,EAAK2G,GAAS,CACxC,MAAQtD,GAAS,SAAYrD,CAAG,IAAM,SACpC,MAAM,IAAI,UAAU,2DAA2D,EAIjF,GAAI2G,IAAWA,GAAQ,UACrB,QAAS6zD,MAASx6D,EAIhB,MAHQqG,GAAQ,gBAAgBrG,EAAKw6D,EAAK,GACxCrF,EAAK,WAAWqF,EAAK,EAEnBx6D,EAAIw6D,EAAK,EAAE,QACb,QAASp6D,GAAI,EAAGA,GAAIJ,EAAIw6D,EAAK,EAAE,QAAQ,OAAQp6D,KAC7C+0D,EAAK,WAAWn1D,EAAIw6D,EAAK,EAAE,QAAQp6D,EAAC,CAAC,EAO7C,IAAIq6D,GACJ,QAASC,MAAS16D,KACRqG,GAAQ,gBAAgBrG,EAAK06D,EAAK,IACxCD,GAAWtF,EAAK,iBAAiBuF,GAAO16D,EAAI06D,EAAK,CAAC,GAGtD,OAAOD,EACX,EAyBEtF,EAAK,iBAAmB,SAAUhuD,EAAMnH,GAAK,CAI3C,IAHI,OAAOA,GAAQ,KAAeA,KAAQ,QACxCA,GAAM,CAAA,GAEJ,OAAOmH,GAAS,SAClB,MAAM,IAAI,UAAU,iEAAiE,EAIvF,MAAQd,GAAQ,gBAAgBixD,EAAOnwD,CAAI,EACzC,MAAM,IAAI,MAAM,uBAAyBA,EAAO,yCAAyC,EAK3FozD,GAAsBpzD,CAAI,EAC1B,IAAIwzD,GAAU,KACVC,GAAU,CAAA,EACVzqD,GAAS,EACT0qD,GACA3hD,GACA4hD,GACJ,GAAI96D,IAAOA,GAAI,OAAS,OACtB26D,GAAU36D,GAAI,gBACL,OAAOA,IAAQ,SACpBA,KAAQ,KACV66D,GAAa76D,eAEFqD,GAAS,SAAYrD,EAAG,IAAM,SAC3C66D,GAAa76D,GAAI,WACjBkZ,GAAWlZ,GAAI,SACfmQ,GAASnQ,GAAI,OACb86D,GAAW96D,GAAI,SACXA,GAAI,UACN46D,GAAU56D,GAAI,QAAQ,eAGxB,OAAM,IAAI,UAAU,uBAAyBmH,EAAO,WAAanH,GAAI,WAAa,6CAA6C,EAEjI,GAAI46D,IACF,QAASx6D,GAAI,EAAGA,GAAIw6D,GAAQ,OAAQx6D,KAClC,MAAQiG,GAAQ,gBAAgBixD,EAAOsD,GAAQx6D,EAAC,CAAC,EAC/C,MAAM,IAAI,MAAM,wBAA0Bw6D,GAAQx6D,EAAC,EAAI,yCAAyC,EAItG,GAAIy6D,IAAc,OAAOA,IAAe,UAAY,CAACF,GACnD,GAAI,CACFA,GAAUxF,EAAK,MAAM0F,GAAY,CAC/B,aAAc,EACxB,CAAS,CACF,OAAQE,GAAI,CACX,MAAAA,GAAG,QAAU,0BAA4B5zD,EAAO,WAAa0zD,GAAa,MAAQE,GAAG,QAC/EA,EACP,MACQF,IAAcA,GAAW,OAAS,SAC3CF,GAAUE,GAAW,SAEvBD,GAAUA,IAAW,GACrBzqD,GAASA,IAAU,EACf+I,IAAYA,GAAS,YACvBA,GAAW4gD,EAAS5gD,GAAS,YAAW,CAAE,GAAK4gD,EAAS,KAExD5gD,GAAW4gD,EAAS,KAKtB,IAAIkB,GAAU,CAAA,EACd,GAAKL,GAqCE,CACLK,GAAU,CACR,KAAM7zD,EACN,MAAOwzD,GAAQ,MACf,WAAYA,GAAQ,WAAW,MAAM,CAAC,EACtC,SAAUzhD,GACV,OAAQ/I,EAChB,EAGM,IAAI8qD,GAAW,GACf,QAASpzB,MAAO8vB,EACd,MAAQtxD,GAAQ,gBAAgBsxD,EAAY9vB,EAAG,EAAG,CAEhD,QADI99B,GAAQ,GACHgf,EAAI,EAAGA,EAAI4sC,EAAgB,OAAQ5sC,IAC1C,GAAI,KAAK,KAAKiyC,GAAQ,WAAWjyC,CAAC,GAAK,IAAM4uC,EAAW9vB,EAAG,EAAE,WAAW9e,CAAC,GAAK,EAAE,EAAI,MAAO,CACzFhf,GAAQ,GACR,KACD,CAEH,GAAIA,GAAO,CACTkxD,GAAW,GACXD,GAAQ,KAAOrD,EAAW9vB,EAAG,EAC7B,KACD,CACF,CAEH,GAAI,CAACozB,GAAU,CACbH,GAAWA,IAAY3zD,EAAO,SAE9B,IAAI+zD,GAAe,CACjB,WAAYP,GAAQ,WAAW,MAAM,CAAC,CAChD,EACQO,GAAa,IAAMJ,GACnBnD,EAAWmD,EAAQ,EAAII,GACvBvC,GAAkBmC,EAAQ,EAAI,CAC5B,KAAME,GACN,OAAQlB,EAAS,KAAK,EAAE,CAClC,EACQkB,GAAQ,KAAOrD,EAAWmD,EAAQ,CACnC,CACF,KA9Ea,CAGZ,GADAA,GAAWA,IAAY3zD,EAAO,SAC1BwuD,EAAgB,QAAQmF,EAAQ,GAAK,EACvC,MAAM,IAAI,MAAM,gCAAkC3zD,EAAO,yEAAyE,EAEpIwuD,EAAgB,KAAKmF,EAAQ,EAG7B,QAAS51D,MAAKyyD,KACJtxD,GAAQ,gBAAgBsxD,EAAYzyD,EAAC,IAC3CyyD,EAAWzyD,EAAC,EAAE,WAAWywD,EAAgB,OAAS,CAAC,EAAI,GAQ3D,QAHIwF,GAAc,CAChB,WAAY,CAAE,CACtB,EACevzB,GAAM,EAAGA,GAAM+tB,EAAgB,OAAQ/tB,KAC9CuzB,GAAY,WAAWvzB,EAAG,EAAI,EAEhCuzB,GAAY,WAAWxF,EAAgB,OAAS,CAAC,EAAI,EACrDwF,GAAY,IAAML,GAClBnD,EAAWmD,EAAQ,EAAIK,GACvBH,GAAU,CACR,KAAM7zD,EACN,MAAO,EACP,WAAYwwD,EAAWmD,EAAQ,EAAE,WAAW,MAAM,CAAC,EACnD,SAAU5hD,GACV,OAAQ/I,GACR,KAAMwnD,EAAWmD,EAAQ,CACjC,EACMnC,GAAkBmC,EAAQ,EAAI,CAC5B,KAAME,GACN,OAAQlB,EAAS,KAAK,EAAE,CAChC,CACA,CA0CI3E,EAAK,MAAMhuD,CAAI,EAAI6zD,GACnB,QAASI,GAAM,EAAGA,GAAMR,GAAQ,OAAQQ,KAAO,CAC7C,IAAIC,GAAYT,GAAQQ,EAAG,EACvBE,GAAS,CAAA,EACb,QAASC,MAASP,MACR30D,GAAQ,gBAAgB20D,GAASO,EAAK,IAC5CD,GAAOC,EAAK,EAAIP,GAAQO,EAAK,GAGjCD,GAAO,KAAOD,GACdlG,EAAK,MAAMkG,EAAS,EAAIC,EACzB,CAGD,cAAOxE,EAAU,MACV,IAAI3B,EAAK,KAAMhuD,CAAI,CAC9B,EACEguD,EAAK,WAAa,SAAUhuD,EAAM,CAChC,OAAOguD,EAAK,MAAMhuD,CAAI,CAC1B,EAGEguD,EAAK,SAAW2E,EAChB3E,EAAK,gBAAkBQ,EACvBR,EAAK,WAAawC,EAClBxC,EAAK,aAAe8B,GACpB9B,EAAK,MAAQmC,EACNnC,CACT,EAAG,CACD,QAAS,EACX,CAAC,EACDA,GAAA,gBAA0BM,cClxH1B,OAAO,eAAezsB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIrjB,IAAWhlB,EACX47B,IAAcj5B,GACd6D,GAAO,OACPia,IAAe,CAAC,QAAS,MAAM,EAG/Bo6C,OAAwC71C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAChG,IAAI3d,EAAQ2d,EAAK,MACfmvC,EAAOnvC,EAAK,KA4Bd,OAAO3d,EAAMlB,GAAM,CACjB,KAAM,SAAc5D,EAAG,CACrB,OAAOA,EAAE,OACV,EACD,OAAQ,SAAgBA,EAAG,CACzB,OAAI4xD,EAAK,gBAAgB5xD,CAAC,EACjB,IAAI4xD,EAAK,KAAM5xD,CAAC,EAGlB4xD,EAAK,MAAM5xD,EAAG,CACnB,aAAc,EACtB,CAAO,CACF,EAED,yDAA0D,SAAkDwB,EAAOikC,EAAM,CACvH,OAAO,IAAImsB,EAAKpwD,EAAOikC,CAAI,CAC5B,EACD,gCAAiC,SAAiCjkC,EAAO,CAEvE,OAAO,IAAIowD,EAAKpwD,CAAK,CACtB,EACD,iBAAkBsD,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUhP,EAAG,CAClB,SAAWg5B,IAAY,SAASh5B,EAAGgP,CAAI,CAC/C,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACDy2B,GAAA,mBAA6BwyB,cCpE7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAI91C,IAAWhlB,EACXwG,GAAO,SACPia,IAAe,CAAC,QAAS,cAAc,EACvCs6C,OAAkC/1C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC1F,IAAI3d,EAAQ2d,EAAK,MACfkf,EAAelf,EAAK,aAkCtB,OAAO3d,EAAMlB,GAAM,CACjB,GAAI,UAAa,CACf,OAAO,IAAI+9B,EAAa,CAAA,CAAE,CAC3B,EACD,OAAQ,SAAgBtP,EAAU,CAChC,OAAO,IAAIsP,EAAa,GAAItP,CAAQ,CACrC,EACD,iBAAkB,SAAqBD,EAAM,CAC3C,OAAO,IAAIuP,EAAavP,CAAI,CAC7B,EACD,yBAA0B,SAA2BA,EAAMC,EAAU,CACnE,OAAO,IAAIsP,EAAavP,EAAMC,CAAQ,CACvC,CACL,CAAG,CACH,CAAC,EACD6lC,GAAA,aAAuBC,cC1DvB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIh2C,IAAWhlB,EACXwG,GAAO,aACPia,IAAe,CAAC,QAAS,MAAM,EAC/Bw6C,OAAsCj2C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC9F,IAAI3d,EAAQ2d,EAAK,MACfmvC,EAAOnvC,EAAK,KA2Cd,OAAO3d,EAAMlB,GAAM,CAEjB,iBAAkB,SAAsBnH,EAAK2G,EAAS,CACpD,OAAOwuD,EAAK,WAAWn1D,EAAK2G,CAAO,CACpC,EAED,OAAQ,SAAgB3G,EAAK,CAC3B,OAAOm1D,EAAK,WAAWn1D,EAAK,CAAE,CAAA,CAC/B,EAED,yCAA0C,SAAsCmH,EAAM00D,EAAKl1D,EAAS,CAClG,IAAI3G,EAAM,CAAA,EACV,OAAAA,EAAImH,CAAI,EAAI00D,EACL1G,EAAK,WAAWn1D,EAAK2G,CAAO,CACpC,EAED,iCAAkC,SAAgCQ,EAAM00D,EAAK,CAC3E,IAAI77D,EAAM,CAAA,EACV,OAAAA,EAAImH,CAAI,EAAI00D,EACL1G,EAAK,WAAWn1D,EAAK,CAAE,CAAA,CAC/B,EAED,OAAQ,SAAgBmH,EAAM,CAC5B,IAAInH,EAAM,CAAA,EACV,OAAAA,EAAImH,CAAI,EAAI,GACLguD,EAAK,WAAWn1D,EAAK,CAAE,CAAA,CAC/B,CACL,CAAG,CACH,CAAC,EACD27D,GAAA,iBAA2BC,cCjF3B,OAAO,eAAenrC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI9K,IAAWhlB,EACXwG,GAAO,OACPia,IAAe,CAAC,QAAS,SAAU,SAAS,EAC5C06C,OAAgCn2C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdE,EAAUF,EAAK,QAyBjB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,SAAgB5D,EAAG,CACzB,OAAIA,GAAK,IAAMA,GAAK,GAAKhD,EAAO,YACvB,KAAK,KAAKgD,CAAC,EAEX,IAAI2iB,EAAQ3iB,EAAG,CAAC,EAAE,KAAI,CAEhC,EACD,QAAS,SAAiBA,EAAG,CAC3B,OAAOA,EAAE,MACV,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAOA,EAAE,MACV,CACL,CAAG,CACH,CAAC,EACDktB,GAAA,WAAqBqrC,cCnDrB,OAAO,eAAe/gD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAI4K,IAAWhlB,EACX+iC,IAASpgC,GACT6D,GAAO,QACPia,IAAe,CAAC,QAAS,SAAU,SAAS,EAC5C26C,OAAiCp2C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdE,EAAUF,EAAK,QAsBjB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,SAAgB5D,EAAG,CACzB,OAAIA,GAAK,GAAKhD,EAAO,eACRmjC,IAAO,aAAangC,CAAC,EAE9BA,GAAK,GACA,IAAI2iB,EAAQ,KAAK,IAAI,KAAK,KAAK3iB,EAAIA,EAAI,CAAC,EAAIA,CAAC,EAAG,KAAK,EAAE,EAEzD,IAAI2iB,EAAQ3iB,EAAG,CAAC,EAAE,MAAK,CAC/B,EACD,QAAS,SAAiBA,EAAG,CAC3B,OAAOA,EAAE,OACV,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAOA,EAAE,OACV,CACL,CAAG,CACH,CAAC,EACDwX,GAAA,YAAsBghD,cCnDtB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIr2C,IAAWhlB,EACX+iC,IAASpgC,GACT6D,GAAO,OACPia,IAAe,CAAC,QAAS,WAAW,EACpC66C,OAAgCt2C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACfuyB,EAAavyB,EAAK,UAwBpB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQu8B,IAAO,WACf,QAAS,SAAiBngC,EAAG,CAC3B,OAAOA,EAAE,MACV,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAO,IAAIg1C,EAAW,CAAC,EAAE,IAAIh1C,CAAC,EAAE,MACjC,CACL,CAAG,CACH,CAAC,EACDy4D,GAAA,WAAqBC,cC5CrB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIv2C,IAAWhlB,EACX+iC,IAASpgC,GACT6D,GAAO,QACPia,IAAe,CAAC,QAAS,SAAU,UAAW,WAAW,EACzD+6C,OAAiCx2C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdE,EAAUF,EAAK,QACfuyB,EAAavyB,EAAK,UAuBpB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,SAAgB5D,EAAG,CACzB,OAAIA,GAAK,GAAKA,GAAK,IAAMhD,EAAO,eACnBmjC,IAAO,aAAangC,CAAC,EAE3B,IAAI2iB,EAAQ3iB,EAAG,CAAC,EAAE,MAAK,CAC/B,EACD,QAAS,SAAiBA,EAAG,CAC3B,OAAOA,EAAE,OACV,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAO,IAAIg1C,EAAW,CAAC,EAAE,IAAIh1C,CAAC,EAAE,OACjC,CACL,CAAG,CACH,CAAC,EACD24D,GAAA,YAAsBC,cClDtB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIz2C,IAAWhlB,EACX+iC,IAASpgC,GACT6D,GAAO,OACPia,IAAe,CAAC,QAAS,SAAU,UAAW,WAAW,EACzDi7C,OAAgC12C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdE,EAAUF,EAAK,QACfuyB,EAAavyB,EAAK,UAwBpB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,SAAgB5D,EAAG,CACzB,OAAIA,GAAK,IAAMA,GAAK,GAAKhD,EAAO,eACnBmjC,IAAO,YAAYngC,CAAC,EAE1B,IAAI2iB,EAAQ3iB,EAAG,CAAC,EAAE,KAAI,CAC9B,EACD,QAAS,SAAiBA,EAAG,CAC3B,OAAOA,EAAE,MACV,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAO,IAAIg1C,EAAW,CAAC,EAAE,IAAIh1C,CAAC,EAAE,MACjC,CACL,CAAG,CACH,CAAC,EACD64D,GAAA,WAAqBC,cCnDrB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAI32C,IAAWhlB,EACX+iC,IAASpgC,GACT6D,GAAO,QACPia,IAAe,CAAC,QAAS,WAAW,EACpCm7C,OAAiC52C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MACfuyB,EAAavyB,EAAK,UAuBpB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQu8B,IAAO,YACf,QAAS,SAAiBngC,EAAG,CAC3B,OAAOA,EAAE,OACV,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAO,IAAIg1C,EAAW,CAAC,EAAE,IAAIh1C,CAAC,EAAE,OACjC,CACL,CAAG,CACH,CAAC,EACD+4D,GAAA,YAAsBC,cC3CtB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI72C,IAAWhlB,EACX+iC,IAASpgC,GACT6D,GAAO,OACPia,IAAe,CAAC,QAAS,SAAU,UAAW,WAAW,EACzDq7C,OAAgC92C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdE,EAAUF,EAAK,QACfuyB,EAAavyB,EAAK,UAyBpB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,SAAgB5D,EAAG,CACzB,OAAIA,GAAK,IAAMA,GAAK,GAAKhD,EAAO,eACnBmjC,IAAO,YAAYngC,CAAC,EAE1B,IAAI2iB,EAAQ3iB,EAAG,CAAC,EAAE,KAAI,CAC9B,EACD,QAAS,SAAiBA,EAAG,CAC3B,OAAOA,EAAE,MACV,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAO,IAAIg1C,EAAW,CAAC,EAAE,IAAIh1C,CAAC,EAAE,MACjC,CACL,CAAG,CACH,CAAC,EACDi5D,GAAA,WAAqBC,cCpDrB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAI/2C,IAAWhlB,EACX+iC,IAASpgC,GACT6D,GAAO,QACPia,IAAe,CAAC,QAAS,SAAU,UAAW,WAAW,EACzDu7C,OAAiCh3C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdE,EAAUF,EAAK,QACfuyB,EAAavyB,EAAK,UAuBpB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,SAAgB5D,EAAG,CACzB,GAAIA,GAAK,GAAKA,GAAK,IAAMhD,EAAO,YAAa,CAC3C,IAAIkiC,EAAO,EAAIl/B,EACf,GAAIk/B,EAAO,GAAKliC,EAAO,YACrB,SAAWmjC,IAAO,aAAangC,CAAC,EAElC,IAAI23B,EAAM,KAAK,KAAKuH,EAAOA,EAAO,CAAC,EACnC,OAAO,IAAIvc,EAAQ,KAAK,IAAIgV,EAAMuH,CAAI,EAAG,KAAK,EAAE,CACjD,CACD,OAAO,IAAIvc,EAAQ3iB,EAAG,CAAC,EAAE,MAAK,CAC/B,EACD,QAAS,SAAiBA,EAAG,CAC3B,OAAOA,EAAE,OACV,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAO,IAAIg1C,EAAW,CAAC,EAAE,IAAIh1C,CAAC,EAAE,OACjC,CACL,CAAG,CACH,CAAC,EACDm5D,GAAA,YAAsBC,cCvDtB,OAAO,eAAehsC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIhL,IAAWhlB,EACXwG,GAAO,OACPia,IAAe,CAAC,QAAS,SAAU,SAAS,EAC5Cw7C,OAAgCj3C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdE,EAAUF,EAAK,QAyBjB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,SAAgB5D,EAAG,CACzB,OAAIA,GAAK,IAAMA,GAAK,GAAKhD,EAAO,YACvB,KAAK,KAAKgD,CAAC,EAEX,IAAI2iB,EAAQ3iB,EAAG,CAAC,EAAE,KAAI,CAEhC,EACD,QAAS,SAAiBA,EAAG,CAC3B,OAAOA,EAAE,MACV,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAOA,EAAE,MACV,CACL,CAAG,CACH,CAAC,EACDotB,GAAA,WAAqBisC,cCnDrB,OAAO,eAAe5hD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAI2K,IAAWhlB,EACX+iC,IAASpgC,GACT6D,IAAO,QACPia,IAAe,CAAC,OAAO,EACvBy7C,OAAiCl3C,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MAuBjB,OAAO3d,EAAM,QAAS,CACpB,OAAQq7B,IAAO,YACf,QAAS,SAAiBngC,EAAG,CAC3B,OAAOA,EAAE,OACV,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAOA,EAAE,OACV,CACL,CAAG,CACH,CAAC,EACDyX,GAAA,YAAsB6hD,cC1CtB,OAAO,eAAejsC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIjL,IAAWhlB,EACXwG,IAAO,OACPia,IAAe,CAAC,OAAO,EACvB07C,OAAgCn3C,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MAwBjB,OAAO3d,EAAM,OAAQ,CACnB,OAAQ,SAAgB9E,EAAG,CACzB,OAAO,KAAK,KAAKA,CAAC,CACnB,EACD,QAAS,SAAiBA,EAAG,CAC3B,OAAOA,EAAE,MACV,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAOA,EAAE,MACV,CACL,CAAG,CACH,CAAC,EACDqtB,GAAA,WAAqBksC,cC5CrB,OAAO,eAAejsC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIlL,IAAWhlB,EACX0zC,IAAgB/wC,GAChBkyC,IAAiB3wC,GACjBq1C,IAAkB5yC,GAClBumC,IAAiBxxB,GACjByxB,IAAiBjoB,GACjBytB,IAAwB9a,GACxBrxB,GAAO,QACPia,IAAe,CAAC,QAAS,SAAU,cAAe,YAAa,cAAe,QAAQ,EACtF27C,OAAiCp3C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACd4e,EAAc5e,EAAK,YACnBC,EAAYD,EAAK,UACjBG,EAAcH,EAAK,YACnBsrB,EAAStrB,EAAK,OACZ+tB,KAAoBM,IAAc,qBAAqB,CACzD,MAAOhsC,EACP,YAAau8B,CACjB,CAAG,EACGmQ,KAAoBS,IAAe,qBAAqB,CAC1D,MAAOntC,CACX,CAAG,EACG0xC,KAAqBG,IAAgB,sBAAsB,CAC7D,MAAO7xC,EACP,YAAau8B,CACjB,CAAG,EACG6H,KAAoBoB,IAAe,qBAAqB,CAC1D,MAAOxlC,EACP,YAAau8B,CACjB,CAAG,EACGqI,KAAoBa,IAAe,qBAAqB,CAC1D,MAAOzlC,EACP,YAAa8d,CACjB,CAAG,EACGmsB,KAA2BgB,IAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EA+BD,OAAOjpC,EAAMlB,GAAM,CACjB,iBAAkB,KAAK,MAMvB,uBAAwB,SAA4ByT,EAAGrX,EAAG,CACxD,OAAO0iB,EAAU,MAAMrL,EAAGrX,CAAC,CAC5B,CACF,EAAE+uC,EAAqB,CACtB,OAAQ,qBACR,GAAIyH,EACJ,GAAIhF,EACJ,GAAIhB,EACJ,GAAItH,EACJ,GAAIQ,CACL,CAAA,CAAC,CACJ,CAAC,EACDpc,GAAA,YAAsBksC,cC7FtB,OAAO,eAAe9hD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAI0K,IAAWhlB,EACX+iC,IAASpgC,GACT6D,GAAO,QACPia,IAAe,CAAC,QAAS,SAAU,SAAS,EAC5C47C,OAAiCr3C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdE,EAAUF,EAAK,QAuBjB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,SAAgB5D,EAAG,CACzB,OAAIA,GAAK,GAAKA,GAAK,IAAMhD,EAAO,eACnBmjC,IAAO,aAAangC,CAAC,EAE3B,IAAI2iB,EAAQ3iB,EAAG,CAAC,EAAE,MAAK,CAC/B,EACD,QAAS,SAAiBA,EAAG,CAC3B,OAAOA,EAAE,OACV,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAOA,EAAE,OACV,CACL,CAAG,CACH,CAAC,EACD0X,GAAA,YAAsB+hD,oBCjDtB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAIt3C,IAAWhlB,EACXu8D,OAAoCv3C,IAAS,SAAS,WAAY,CAAC,OAAO,EAAG,SAAUK,EAAM,CAC/F,IAAI3d,EAAQ2d,EAAK,MACjB,MAAO,CACL,KAAM3d,EAAM,YAAY,SAAUkK,EAAM,CACtC,OAAO,SAAUhP,EAAG,CAClB,GAAI,CAACA,EAAE,QAAQA,EAAE,YAAY,WAAW,KAAK,EAC3C,MAAM,IAAI,UAAU,kCAAkC,EAExD,OAAO8E,EAAM,KAAKkK,EAAMhP,EAAE,WAAW,EAAEA,EAAE,KAAK,CACtD,CACA,CAAK,CACL,CACA,CAAC,EACD05D,GAAA,eAAyBC,IClBzB,OAAO,eAAe/rC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIxL,IAAWhlB,EACXw8D,IAAY75D,GACZ6D,GAAO,MACPia,IAAe,CAAC,OAAO,EACvBg8C,OAA+Bz3C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MACbi3C,KAAeE,IAAU,gBAAgB,CAC3C,MAAO90D,CACX,CAAG,EA6BD,OAAOA,EAAMlB,GAAM,CACjB,OAAQ,KAAK,IACb,sBAAuB,SAA0B5D,EAAG,CAClD,OAAOA,EAAE,KACV,CACF,EAAE05D,CAAQ,CACb,CAAC,EACD9rC,GAAA,UAAoBisC,cChDpB,OAAO,eAAeliD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIyK,IAAWhlB,EACX6a,IAAUlY,GACV6D,GAAO,OACPia,IAAe,CAAC,OAAO,EACvBi8C,OAAgC13C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MAuBjB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQqU,IAAQ,KAChB,sBAAuB,SAA0BjY,EAAG,CAClD,OAAOA,EAAE,MACV,CACL,CAAG,CACH,CAAC,EACD2X,GAAA,WAAqBmiD,cCvCrB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAI33C,IAAWhlB,EACX+iC,IAASpgC,GACT65D,IAAYt4D,GACZsC,GAAO,MACPia,IAAe,CAAC,QAAS,WAAW,EACpCm8C,OAA+B53C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MACfuyB,EAAavyB,EAAK,UAChBi3C,KAAeE,IAAU,gBAAgB,CAC3C,MAAO90D,CACX,CAAG,EAwBD,OAAOA,EAAMlB,GAAM,CACjB,OAAQu8B,IAAO,UACf,QAAS,SAAiBngC,EAAG,CAC3B,OAAOA,EAAE,KACV,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAO,IAAIg1C,EAAW,CAAC,EAAE,IAAIh1C,EAAE,IAAG,CAAE,CACrC,CACF,EAAE05D,CAAQ,CACb,CAAC,EACDK,GAAA,UAAoBC,cChDpB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI73C,IAAWhlB,EACX+iC,IAASpgC,GACT6D,GAAO,OACPia,IAAe,CAAC,QAAS,WAAW,EACpCq8C,OAAgC93C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACfuyB,EAAavyB,EAAK,UAyBpB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQu8B,IAAO,WACf,QAAS,SAAiBngC,EAAG,CAC3B,OAAOA,EAAE,MACV,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAO,IAAIg1C,EAAW,CAAC,EAAE,IAAIh1C,EAAE,KAAI,CAAE,CACtC,CACL,CAAG,CACH,CAAC,EACDi6D,GAAA,WAAqBC,cC7CrB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAI/3C,IAAWhlB,EACX+iC,IAASpgC,GACT65D,IAAYt4D,GACZsC,GAAO,MACPia,IAAe,CAAC,QAAS,WAAW,EACpCu8C,OAA+Bh4C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MACfuyB,EAAavyB,EAAK,UAChBi3C,KAAeE,IAAU,gBAAgB,CAC3C,MAAO90D,CACX,CAAG,EAwBD,OAAOA,EAAMlB,GAAM,CACjB,OAAQu8B,IAAO,UACf,QAAS,SAAiBngC,EAAG,CAC3B,OAAOA,EAAE,KACV,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAO,IAAIg1C,EAAW,CAAC,EAAE,IAAIh1C,EAAE,IAAG,CAAE,CACrC,CACF,EAAE05D,CAAQ,CACb,CAAC,EACDS,GAAA,UAAoBC,cChDpB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIj4C,IAAWhlB,EACX+iC,IAASpgC,GACT6D,GAAO,OACPia,IAAe,CAAC,QAAS,WAAW,EACpCy8C,OAAgCl4C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACfuyB,EAAavyB,EAAK,UAyBpB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQu8B,IAAO,WACf,QAAS,SAAiBngC,EAAG,CAC3B,OAAOA,EAAE,MACV,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAO,IAAIg1C,EAAW,CAAC,EAAE,IAAIh1C,EAAE,KAAI,CAAE,CACtC,CACL,CAAG,CACH,CAAC,EACDq6D,GAAA,WAAqBC,cC7CrB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIn4C,IAAWhlB,EACX+iC,IAASpgC,GACT65D,IAAYt4D,GACZsC,GAAO,MACPia,IAAe,CAAC,QAAS,WAAW,EACpC28C,OAA+Bp4C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MACfuyB,EAAavyB,EAAK,UAChBi3C,KAAeE,IAAU,gBAAgB,CAC3C,MAAO90D,CACX,CAAG,EAwBD,OAAOA,EAAMlB,GAAM,CACjB,OAAQu8B,IAAO,UACf,QAAS,SAAiBngC,EAAG,CAC3B,OAAOA,EAAE,KACV,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAO,IAAIg1C,EAAW,CAAC,EAAE,IAAIh1C,EAAE,IAAG,CAAE,CACrC,CACF,EAAE05D,CAAQ,CACb,CAAC,EACDa,GAAA,UAAoBC,cChDpB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIr4C,IAAWhlB,EACX+iC,IAASpgC,GACT6D,GAAO,OACPia,IAAe,CAAC,QAAS,WAAW,EACpC68C,OAAgCt4C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACfuyB,EAAavyB,EAAK,UAyBpB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQu8B,IAAO,WACf,QAAS,SAAiBngC,EAAG,CAC3B,OAAOA,EAAE,MACV,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAO,IAAIg1C,EAAW,CAAC,EAAE,IAAIh1C,EAAE,KAAI,CAAE,CACtC,CACL,CAAG,CACH,CAAC,EACDy6D,GAAA,WAAqBC,cC7CrB,OAAO,eAAensC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAInM,IAAWhlB,EACXw8D,IAAY75D,GACZ6D,GAAO,MACPia,IAAe,CAAC,OAAO,EACvB88C,OAA+Bv4C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MACbi3C,KAAeE,IAAU,gBAAgB,CAC3C,MAAO90D,CACX,CAAG,EA6BD,OAAOA,EAAMlB,GAAM,CACjB,OAAQ,KAAK,IACb,sBAAuB,SAA0B5D,EAAG,CAClD,OAAOA,EAAE,KACV,CACF,EAAE05D,CAAQ,CACb,CAAC,EACDnrC,GAAA,UAAoBosC,cChDpB,OAAO,eAAe/iD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIwK,IAAWhlB,EACX+iC,IAASpgC,GACT6D,GAAO,OACPia,IAAe,CAAC,OAAO,EACvB+8C,OAAgCx4C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MAuBjB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQu8B,IAAO,WACf,sBAAuB,SAA0BngC,EAAG,CAClD,OAAOA,EAAE,MACV,CACL,CAAG,CACH,CAAC,EACD4X,GAAA,WAAqBgjD,cCvCrB,OAAO,eAAelsC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAItM,IAAWhlB,EACXw8D,IAAY75D,GACZ6D,GAAO,MACPia,IAAe,CAAC,OAAO,EACvBg9C,OAA+Bz4C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MACbi3C,KAAeE,IAAU,gBAAgB,CAC3C,MAAO90D,CACX,CAAG,EA0BD,OAAOA,EAAMlB,GAAM,CACjB,OAAQ,KAAK,IACb,sBAAuB,SAA0B5D,EAAG,CAClD,OAAOA,EAAE,KACV,CACF,EAAE05D,CAAQ,CACb,CAAC,EACDhrC,GAAA,UAAoBmsC,cC7CpB,OAAO,eAAehjD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIuK,IAAWhlB,EACX6a,IAAUlY,GACV6D,IAAO,OACPia,IAAe,CAAC,OAAO,EACvBi9C,OAAgC14C,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MA0BjB,OAAO3d,EAAM,OAAQ,CACnB,OAAQmT,IAAQ,KAChB,sBAAuB,SAA0BjY,EAAG,CAClD,OAAOA,EAAE,MACV,CACL,CAAG,CACH,CAAC,EACD6X,GAAA,WAAqBijD,cC1CrB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIn9C,GAASxgB,GACTglB,IAAWriB,EACX6D,GAAO,eACPia,IAAe,CAAC,QAAS,OAAQ,SAAU,iBAAkB,QAAS,aAAa,EACnFm9C,OAAwC54C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAChG,IAAI3d,EAAQ2d,EAAK,MACf/M,EAAO+M,EAAK,KACZ0+B,EAAS1+B,EAAK,OACd4pC,EAAiB5pC,EAAK,eACtB03B,EAAQ13B,EAAK,MACbG,EAAcH,EAAK,YAuBrB,OAAO3d,EAAMlB,GAAM,CACjB,iCAAkC,SAAgCq3D,EAAIC,EAAI,CACxE,IAAI7lD,EAAS,CAAA,EACb,GAAI8rC,EAAOzrC,EAAKulD,CAAE,EAAG,IAAI9gB,EAAM,CAAC,CAAC,IAAM,GAAKgH,EAAOzrC,EAAKwlD,CAAE,EAAG,IAAI/gB,EAAM,CAAC,CAAC,IAAM,EAAG,CAEhF,IAAIghB,KAASv9C,GAAO,SAAS,MAAM,QAAQq9C,CAAE,EAAIA,EAAKA,EAAG,QAAO,CAAE,EAAE,KAAK5O,CAAc,EACnF+O,KAASx9C,GAAO,SAAS,MAAM,QAAQs9C,CAAE,EAAIA,EAAKA,EAAG,QAAO,CAAE,EAAE,KAAK7O,CAAc,EACvFh3C,EAAS,CAAA,EACT,QAASxY,EAAI,EAAGA,EAAIs+D,EAAG,OAAQt+D,IAC7B,QAAS2oB,EAAI,EAAGA,EAAI41C,EAAG,OAAQ51C,IAC7BnQ,EAAO,KAAK,CAAC8lD,EAAGt+D,CAAC,EAAGu+D,EAAG51C,CAAC,CAAC,CAAC,CAG/B,CAED,OAAI,MAAM,QAAQy1C,CAAE,GAAK,MAAM,QAAQC,CAAE,EAChC7lD,EAGF,IAAIuN,EAAYvN,CAAM,CAC9B,CACL,CAAG,CACH,CAAC,EACD0lD,GAAA,mBAA6BC,cC5D7B,OAAO,eAAeK,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAIz9C,GAASxgB,GACTglB,IAAWriB,EACX6D,GAAO,gBACPia,IAAe,CAAC,QAAS,OAAQ,SAAU,iBAAkB,QAAS,aAAa,EACnFy9C,OAAyCl5C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACjG,IAAI3d,EAAQ2d,EAAK,MACf/M,EAAO+M,EAAK,KACZ0+B,EAAS1+B,EAAK,OACd4pC,EAAiB5pC,EAAK,eACtB03B,EAAQ13B,EAAK,MACbG,EAAcH,EAAK,YAsBrB,OAAO3d,EAAMlB,GAAM,CACjB,iCAAkC,SAAgCq3D,EAAIC,EAAI,CACxE,IAAI7lD,EACJ,GAAI8rC,EAAOzrC,EAAKulD,CAAE,EAAG,IAAI9gB,EAAM,CAAC,CAAC,IAAM,EAErC9kC,EAAS,CAAA,MACJ,IAAI8rC,EAAOzrC,EAAKwlD,CAAE,EAAG,IAAI/gB,EAAM,CAAC,CAAC,IAAM,EAE5C,SAAWv8B,GAAO,SAASq9C,EAAG,QAAS,CAAA,EAEvC,IAAIE,KAASv9C,GAAO,aAAcA,GAAO,SAAS,MAAM,QAAQq9C,CAAE,EAAIA,EAAKA,EAAG,QAAS,CAAA,EAAE,KAAK5O,CAAc,CAAC,EACzG+O,KAASx9C,GAAO,aAAcA,GAAO,SAAS,MAAM,QAAQs9C,CAAE,EAAIA,EAAKA,EAAG,QAAS,CAAA,EAAE,KAAK7O,CAAc,CAAC,EAC7Gh3C,EAAS,CAAA,EAET,QADIkmD,EACK1+D,EAAI,EAAGA,EAAIs+D,EAAG,OAAQt+D,IAAK,CAClC0+D,EAAO,GACP,QAAS/1C,EAAI,EAAGA,EAAI41C,EAAG,OAAQ51C,IAC7B,GAAI6mC,EAAe8O,EAAGt+D,CAAC,EAAE,MAAOu+D,EAAG51C,CAAC,EAAE,KAAK,IAAM,GAAK21C,EAAGt+D,CAAC,EAAE,aAAeu+D,EAAG51C,CAAC,EAAE,WAAY,CAE3F+1C,EAAO,GACP,KACD,CAEEA,GACHlmD,EAAO,KAAK8lD,EAAGt+D,CAAC,CAAC,CAEpB,EAGH,OAAI,MAAM,QAAQo+D,CAAE,GAAK,MAAM,QAAQC,CAAE,KAC5Bt9C,GAAO,YAAYvI,CAAM,EAG/B,IAAIuN,KAAgBhF,GAAO,YAAYvI,CAAM,CAAC,CACtD,CACL,CAAG,CACH,CAAC,EACDgmD,GAAA,oBAA8BC,cCzE9B,OAAO,eAAeE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAI59C,IAASxgB,GACTglB,IAAWriB,EACX6D,GAAO,cACPia,IAAe,CAAC,QAAS,OAAQ,SAAU,iBAAkB,QAAS,aAAa,EACnF49C,OAAuCr5C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC/F,IAAI3d,EAAQ2d,EAAK,MACf/M,EAAO+M,EAAK,KACZ0+B,EAAS1+B,EAAK,OACd4pC,EAAiB5pC,EAAK,eACtB03B,EAAQ13B,EAAK,MACbG,EAAcH,EAAK,YAoBrB,OAAO3d,EAAMlB,GAAM,CACjB,iBAAkB,SAAqBlC,EAAG,CACxC,IAAI2T,EACJ,GAAI8rC,EAAOzrC,EAAKhU,CAAC,EAAG,IAAIy4C,EAAM,CAAC,CAAC,IAAM,EAEpC9kC,EAAS,CAAA,MACJ,CACL,IAAI1T,KAAQic,IAAO,SAAS,MAAM,QAAQlc,CAAC,EAAIA,EAAIA,EAAE,QAAO,CAAE,EAAE,KAAK2qD,CAAc,EACnFh3C,EAAS,CAAA,EACTA,EAAO,KAAK1T,EAAE,CAAC,CAAC,EAChB,QAAS9E,EAAI,EAAGA,EAAI8E,EAAE,OAAQ9E,IACxBwvD,EAAe1qD,EAAE9E,CAAC,EAAG8E,EAAE9E,EAAI,CAAC,CAAC,IAAM,GACrCwY,EAAO,KAAK1T,EAAE9E,CAAC,CAAC,CAGrB,CAED,OAAI,MAAM,QAAQ6E,CAAC,EACV2T,EAGF,IAAIuN,EAAYvN,CAAM,CAC9B,CACL,CAAG,CACH,CAAC,EACDmmD,GAAA,kBAA4BC,cC3D5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAI99C,GAASxgB,GACTglB,IAAWriB,EACX6D,GAAO,eACPia,IAAe,CAAC,QAAS,OAAQ,SAAU,iBAAkB,QAAS,aAAa,EACnF89C,OAAwCv5C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAChG,IAAI3d,EAAQ2d,EAAK,MACf/M,EAAO+M,EAAK,KACZ0+B,EAAS1+B,EAAK,OACd4pC,EAAiB5pC,EAAK,eACtB03B,EAAQ13B,EAAK,MACbG,EAAcH,EAAK,YAsBrB,OAAO3d,EAAMlB,GAAM,CACjB,iCAAkC,SAAgCq3D,EAAIC,EAAI,CACxE,IAAI7lD,EACJ,GAAI8rC,EAAOzrC,EAAKulD,CAAE,EAAG,IAAI9gB,EAAM,CAAC,CAAC,IAAM,GAAKgH,EAAOzrC,EAAKwlD,CAAE,EAAG,IAAI/gB,EAAM,CAAC,CAAC,IAAM,EAE7E9kC,EAAS,CAAA,MACJ,CACL,IAAI8lD,KAASv9C,GAAO,aAAcA,GAAO,SAAS,MAAM,QAAQq9C,CAAE,EAAIA,EAAKA,EAAG,QAAS,CAAA,EAAE,KAAK5O,CAAc,CAAC,EACzG+O,KAASx9C,GAAO,aAAcA,GAAO,SAAS,MAAM,QAAQs9C,CAAE,EAAIA,EAAKA,EAAG,QAAS,CAAA,EAAE,KAAK7O,CAAc,CAAC,EAC7Gh3C,EAAS,CAAA,EACT,QAASxY,EAAI,EAAGA,EAAIs+D,EAAG,OAAQt+D,IAC7B,QAAS2oB,EAAI,EAAGA,EAAI41C,EAAG,OAAQ51C,IAC7B,GAAI6mC,EAAe8O,EAAGt+D,CAAC,EAAE,MAAOu+D,EAAG51C,CAAC,EAAE,KAAK,IAAM,GAAK21C,EAAGt+D,CAAC,EAAE,aAAeu+D,EAAG51C,CAAC,EAAE,WAAY,CAE3FnQ,EAAO,KAAK8lD,EAAGt+D,CAAC,CAAC,EACjB,KACD,CAGN,CAED,OAAI,MAAM,QAAQo+D,CAAE,GAAK,MAAM,QAAQC,CAAE,KAC5Bt9C,GAAO,YAAYvI,CAAM,EAG/B,IAAIuN,KAAgBhF,GAAO,YAAYvI,CAAM,CAAC,CACtD,CACL,CAAG,CACH,CAAC,EACDqmD,GAAA,mBAA6BC,cCjE7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIh+C,GAASxgB,GACTglB,IAAWriB,EACX6D,GAAO,cACPia,IAAe,CAAC,QAAS,OAAQ,SAAU,iBAAkB,OAAO,EACpEg+C,OAAuCz5C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC/F,IAAI3d,EAAQ2d,EAAK,MACf/M,EAAO+M,EAAK,KACZ0+B,EAAS1+B,EAAK,OACd4pC,EAAiB5pC,EAAK,eACtB03B,EAAQ13B,EAAK,MAsBf,OAAO3d,EAAMlB,GAAM,CACjB,iCAAkC,SAAgCq3D,EAAIC,EAAI,CACxE,GAAI/Z,EAAOzrC,EAAKulD,CAAE,EAAG,IAAI9gB,EAAM,CAAC,CAAC,IAAM,EAErC,MAAO,GACF,GAAIgH,EAAOzrC,EAAKwlD,CAAE,EAAG,IAAI/gB,EAAM,CAAC,CAAC,IAAM,EAE5C,MAAO,GAKT,QAHIghB,KAASv9C,GAAO,aAAcA,GAAO,SAAS,MAAM,QAAQq9C,CAAE,EAAIA,EAAKA,EAAG,QAAS,CAAA,EAAE,KAAK5O,CAAc,CAAC,EACzG+O,KAASx9C,GAAO,aAAcA,GAAO,SAAS,MAAM,QAAQs9C,CAAE,EAAIA,EAAKA,EAAG,QAAS,CAAA,EAAE,KAAK7O,CAAc,CAAC,EACzGkP,EACK1+D,EAAI,EAAGA,EAAIs+D,EAAG,OAAQt+D,IAAK,CAClC0+D,EAAO,GACP,QAAS/1C,EAAI,EAAGA,EAAI41C,EAAG,OAAQ51C,IAC7B,GAAI6mC,EAAe8O,EAAGt+D,CAAC,EAAE,MAAOu+D,EAAG51C,CAAC,EAAE,KAAK,IAAM,GAAK21C,EAAGt+D,CAAC,EAAE,aAAeu+D,EAAG51C,CAAC,EAAE,WAAY,CAE3F+1C,EAAO,GACP,KACD,CAEH,GAAIA,IAAS,GACX,MAAO,EAEV,CACD,MAAO,EACR,CACL,CAAG,CACH,CAAC,EACDK,GAAA,kBAA4BC,cChE5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIl+C,IAASxgB,GACTglB,IAAWriB,EACX6D,GAAO,kBACPia,IAAe,CAAC,QAAS,OAAQ,SAAU,iBAAkB,OAAO,EACpEk+C,OAA2C35C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACnG,IAAI3d,EAAQ2d,EAAK,MACf/M,EAAO+M,EAAK,KACZ0+B,EAAS1+B,EAAK,OACd4pC,EAAiB5pC,EAAK,eACtB03B,EAAQ13B,EAAK,MAsBf,OAAO3d,EAAMlB,GAAM,CACjB,0DAA2D,SAAmDqS,EAAGvU,EAAG,CAClH,GAAIy/C,EAAOzrC,EAAKhU,CAAC,EAAG,IAAIy4C,EAAM,CAAC,CAAC,IAAM,EAEpC,MAAO,GAIT,QAFIx4C,KAAQic,IAAO,SAAS,MAAM,QAAQlc,CAAC,EAAIA,EAAIA,EAAE,QAAS,CAAA,EAC1D0b,EAAQ,EACHvgB,EAAI,EAAGA,EAAI8E,EAAE,OAAQ9E,IACxBwvD,EAAe1qD,EAAE9E,CAAC,EAAGoZ,CAAC,IAAM,GAC9BmH,IAGJ,OAAOA,CACR,CACL,CAAG,CACH,CAAC,EACD0+C,GAAA,sBAAgCC,cCpDhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIp+C,IAASxgB,GACTglB,IAAWriB,EACX6D,GAAO,cACPia,IAAe,CAAC,QAAS,OAAQ,SAAU,iBAAkB,OAAO,EACpEo+C,OAAuC75C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC/F,IAAI3d,EAAQ2d,EAAK,MACf/M,EAAO+M,EAAK,KACZ0+B,EAAS1+B,EAAK,OACd4pC,EAAiB5pC,EAAK,eACtB03B,EAAQ13B,EAAK,MAoBf,OAAO3d,EAAMlB,GAAM,CACjB,iBAAkB,SAAqBlC,EAAG,CACxC,GAAIy/C,EAAOzrC,EAAKhU,CAAC,EAAG,IAAIy4C,EAAM,CAAC,CAAC,IAAM,EAEpC,MAAO,GAKT,QAHIx4C,KAAQic,IAAO,SAAS,MAAM,QAAQlc,CAAC,EAAIA,EAAIA,EAAE,QAAO,CAAE,EAAE,KAAK2qD,CAAc,EAC/Eh3C,EAAS,CAAA,EACTlB,EAAS,EACNA,EAAO,SAAS,CAAC,EAAE,QAAUxS,EAAE,QACpC0T,EAAO,KAAK6mD,EAAQv6D,EAAGwS,EAAO,SAAS,CAAC,EAAE,MAAM,EAAE,EAAE,QAAO,CAAE,CAAC,EAC9DA,IAGF,OAAOgoD,EAAM9mD,CAAM,CACpB,CACL,CAAG,EAGD,SAAS6mD,EAAQx4D,EAAO04D,EAAU,CAEhC,QADI/mD,EAAS,CAAA,EACJxY,EAAI,EAAGA,EAAIu/D,EAAS,OAAQv/D,IAC/Bu/D,EAASv/D,CAAC,IAAM,KAClBwY,EAAO,KAAK3R,EAAM7G,CAAC,CAAC,EAGxB,OAAOwY,CACR,CAGD,SAAS8mD,EAAMz4D,EAAO,CAEpB,QADI2mB,EAAO,CAAA,EACFxtB,EAAI6G,EAAM,OAAS,EAAG7G,EAAI,EAAGA,IACpC,QAAS2oB,EAAI,EAAGA,EAAI3oB,EAAG2oB,IACjB9hB,EAAM8hB,CAAC,EAAE,OAAS9hB,EAAM8hB,EAAI,CAAC,EAAE,SACjC6E,EAAO3mB,EAAM8hB,CAAC,EACd9hB,EAAM8hB,CAAC,EAAI9hB,EAAM8hB,EAAI,CAAC,EACtB9hB,EAAM8hB,EAAI,CAAC,EAAI6E,GAIrB,OAAO3mB,CACR,CACH,CAAC,EACDs4D,GAAA,kBAA4BC,cC7E5B,OAAO,eAAeI,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAIz+C,GAASxgB,GACTglB,IAAWriB,EACX6D,GAAO,UACPia,IAAe,CAAC,QAAS,gBAAgB,EACzCy+C,OAAmCl6C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC3F,IAAI3d,EAAQ2d,EAAK,MACf4pC,EAAiB5pC,EAAK,eAuBxB,OAAO3d,EAAMlB,GAAM,CACjB,iBAAkB,SAAqB,EAAG,CACxC,OAAO,MAAM,QAAQ,CAAC,KAAQga,GAAO,SAAS,CAAC,EAAE,UAAaA,GAAO,SAAS,EAAE,QAAO,CAAE,EAAE,MAC5F,EACD,0BAA2B,SAA4B,EAAG2+C,EAAQ,CAChE,GAAIA,IAAW,IAAS,EAAE,SAAW,EACnC,OAAO,MAAM,QAAQ,CAAC,KAAQ3+C,GAAO,SAAS,CAAC,EAAE,UAAaA,GAAO,SAAS,EAAE,QAAO,CAAE,EAAE,OAI3F,QAFIjc,KAAQic,GAAO,SAAS,MAAM,QAAQ,CAAC,EAAI,EAAI,EAAE,QAAO,CAAE,EAAE,KAAKyuC,CAAc,EAC/EjvC,EAAQ,EACHvgB,EAAI,EAAGA,EAAI8E,EAAE,OAAQ9E,IACxBwvD,EAAe1qD,EAAE9E,CAAC,EAAG8E,EAAE9E,EAAI,CAAC,CAAC,IAAM,GACrCugB,IAGJ,OAAOA,CAEV,CACL,CAAG,CACH,CAAC,EACDi/C,GAAA,cAAwBC,cCrDxB,OAAO,eAAeE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC6BA,GAAA,uBAAG,OACjC,IAAI5+C,GAASxgB,GACTglB,IAAWriB,EACX6D,GAAO,mBACPia,IAAe,CAAC,QAAS,OAAQ,SAAU,SAAU,gBAAiB,OAAO,EAC7E4+C,OAA4Cr6C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACpG,IAAI3d,EAAQ2d,EAAK,MACf/M,EAAO+M,EAAK,KACZsrB,EAAStrB,EAAK,OACd0+B,EAAS1+B,EAAK,OACd44C,EAAgB54C,EAAK,cACrB03B,EAAQ13B,EAAK,MAsBf,OAAO3d,EAAMlB,GAAM,CACjB,iCAAkC,SAAgCq3D,EAAIC,EAAI,CACxE,GAAI/Z,EAAOzrC,EAAKulD,CAAE,EAAG,IAAI9gB,EAAM,CAAC,CAAC,IAAM,EAErC,SAAWv8B,GAAO,SAASs9C,CAAE,EACxB,GAAI/Z,EAAOzrC,EAAKwlD,CAAE,EAAG,IAAI/gB,EAAM,CAAC,CAAC,IAAM,EAC5C,SAAWv8B,GAAO,SAASq9C,CAAE,EAE/B,IAAIE,KAASv9C,GAAO,SAASq9C,CAAE,EAC3BG,KAASx9C,GAAO,SAASs9C,CAAE,EAC/B,OAAOntB,EAAOstB,EAAcF,EAAIC,CAAE,EAAGC,EAAcD,EAAID,CAAE,CAAC,CAC3D,CACL,CAAG,CACH,CAAC,EACDqB,GAAA,uBAAiCC,cClDjC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAI9+C,GAASxgB,GACTglB,IAAWriB,EACX6D,GAAO,WACPia,IAAe,CAAC,QAAS,OAAQ,SAAU,SAAU,eAAgB,mBAAoB,OAAO,EAChG8+C,OAAoCv6C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC5F,IAAI3d,EAAQ2d,EAAK,MACf/M,EAAO+M,EAAK,KACZsrB,EAAStrB,EAAK,OACd0+B,EAAS1+B,EAAK,OACdi5C,EAAej5C,EAAK,aACpB+5C,EAAmB/5C,EAAK,iBACxB03B,EAAQ13B,EAAK,MAsBf,OAAO3d,EAAMlB,GAAM,CACjB,iCAAkC,SAAgCq3D,EAAIC,EAAI,CACxE,GAAI/Z,EAAOzrC,EAAKulD,CAAE,EAAG,IAAI9gB,EAAM,CAAC,CAAC,IAAM,EAErC,SAAWv8B,GAAO,SAASs9C,CAAE,EACxB,GAAI/Z,EAAOzrC,EAAKwlD,CAAE,EAAG,IAAI/gB,EAAM,CAAC,CAAC,IAAM,EAC5C,SAAWv8B,GAAO,SAASq9C,CAAE,EAE/B,IAAIE,KAASv9C,GAAO,SAASq9C,CAAE,EAC3BG,KAASx9C,GAAO,SAASs9C,CAAE,EAC/B,OAAOntB,EAAOyuB,EAAiBrB,EAAIC,CAAE,EAAGM,EAAaP,EAAIC,CAAE,CAAC,CAC7D,CACL,CAAG,CACH,CAAC,EACDsB,GAAA,eAAyBC,cCnDzB,OAAO,eAAexvC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAI/K,IAAWhlB,EACXwyC,IAAkB7vC,GAClB8vC,IAAoBvuC,GACpBwuC,IAAkB/rC,GAClBgsC,IAAwBj3B,GACxBlV,GAAO,MACPia,IAAe,CAAC,QAAS,SAAU,YAAa,cAAe,cAAe,eAAgB,QAAQ,EACtG++C,OAA+Bx6C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACnF,IAAA3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdqlB,EAAYrlB,EAAK,UACjB4e,EAAc5e,EAAK,YACnBG,EAAcH,EAAK,YACJA,EAAK,aACxB,IAAIsrB,EAAStrB,EAAK,OACZ6pB,KAAqBsD,IAAgB,sBAAsB,CAC7D,MAAO9qC,CACX,CAAG,EACGioC,KAAuB8C,IAAkB,wBAAwB,CACnE,MAAO/qC,EACP,YAAau8B,CACjB,CAAG,EACGgM,KAAqByC,IAAgB,sBAAsB,CAC7D,MAAOhrC,EACP,YAAa8d,CACjB,CAAG,EACGmsB,KAA2BgB,IAAsB,4BAA4B,CAC/E,MAAOjrC,EACP,OAAQqe,EACR,OAAQ4qB,CACZ,CAAG,EAmCD,OAAOjpC,EAAMlB,GAAM,CACjB,WAAYkkC,EACZ,mBAAoBhjC,EAAM,YAAY,SAAUkK,EAAM,CACpD,OAAO,SAAUhP,EAAGqX,EAAGw9B,EAAM,CAE3B,QADIx/B,EAASrG,EAAKhP,EAAGqX,CAAC,EACbxa,EAAI,EAAGA,EAAIg4C,EAAK,OAAQh4C,IAC/BwY,EAASrG,EAAKqG,EAAQw/B,EAAKh4C,CAAC,CAAC,EAE/B,OAAOwY,CACf,CACA,CAAK,CACF,EAAE05B,EAAqB,CACtB,KAAMjH,EACN,GAAIwE,EACJ,GAAIS,EACJ,GAAIM,CACL,CAAA,CAAC,CACJ,CAAC,EACDlgB,GAAA,UAAoByvC,cCvFpB,OAAO,eAAe5uC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAI5L,IAAWhlB,EACXwgB,IAAS7d,GACTsB,IAAMC,GACNsC,GAAO,QACPia,IAAe,CAAC,QAAS,MAAO,YAAa,eAAgB,iBAAkB,OAAQ,UAAW,YAAY,EAC9Gg/C,OAAiCz6C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MACfwK,EAAMxK,EAAK,IACXqlB,EAAYrlB,EAAK,UACjBigC,EAAejgC,EAAK,aACpB2vB,EAAiB3vB,EAAK,eACtB+L,EAAO/L,EAAK,KACZ4zB,EAAU5zB,EAAK,QACfge,EAAahe,EAAK,WA6BpB,OAAO3d,EAAMlB,GAAM,CACjB,yBAA0Bk5D,EAC1B,MAAOA,EACP,OAAQ,SAAgBvsC,EAAG,CACzB,OAAOusC,KAAWl/C,IAAO,SAAS2S,EAAE,QAAS,CAAA,CAAC,CAC/C,CACL,CAAG,EAQD,SAASusC,EAAOzzD,EAAM,CAKpB,QAFIgM,EAAS,EACT0nD,EAAU,EACLlgE,EAAI,EAAGA,EAAIwM,EAAK,OAAQxM,IAAK,CACpC,MAAQwE,IAAI,WAAWgI,EAAKxM,CAAC,CAAC,EAC5B,MAAM,IAAI,UAAU,sCAAsC,EAE5D,IAAI2E,EAAQyrB,EAAI5jB,EAAKxM,CAAC,CAAC,EACnBw5C,EAAQ0mB,EAASv7D,CAAK,GACxB6T,EAAS+8B,EAAe/8B,EAAQ+8B,EAAesQ,EAAaqa,EAASv7D,CAAK,EAAGkhD,EAAaqa,EAASv7D,CAAK,CAAC,CAAC,EAC1G6T,EAASyyB,EAAUzyB,EAAQ,CAAC,EAC5B0nD,EAAUv7D,GAEV6T,EAASyyB,EAAUzyB,EAAQorB,EAAWj/B,CAAK,EAAI4wC,EAAesQ,EAAalhD,EAAOu7D,CAAO,EAAGra,EAAalhD,EAAOu7D,CAAO,CAAC,EAAIv7D,CAAK,CAEpI,CACD,OAAO4wC,EAAe2qB,EAASvuC,EAAKnZ,CAAM,CAAC,CAC5C,CACH,CAAC,EACD2Y,GAAA,YAAsB6uC,cCjFtB,OAAO,eAAetd,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIn9B,IAAWhlB,EACXwG,GAAO,OACPia,IAAe,CAAC,QAAS,MAAO,MAAO,MAAO,OAAQ,OAAQ,WAAY,cAAe,SAAU,UAAW,SAAU,aAAc,MAAM,EAC5Im/C,OAAgC56C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACfwK,EAAMxK,EAAK,IACX0K,EAAM1K,EAAK,IACX0J,EAAM1J,EAAK,IACXw2B,EAAOx2B,EAAK,KACZ+L,EAAO/L,EAAK,KACZ6vB,EAAW7vB,EAAK,SAChB4e,EAAc5e,EAAK,YACnBu7B,EAASv7B,EAAK,OACd4zB,EAAU5zB,EAAK,QACfU,EAASV,EAAK,OACd2/B,EAAa3/B,EAAK,WAClBw6C,EAAOx6C,EAAK,KAuCd,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,KAAK,IACb,QAAS,SAAiB5D,EAAG,CAC3B,OAAOA,EAAE,KACV,EACD,UAAW,SAAmBA,EAAG,CAE/B,OAAOA,EAAE,KACV,EACD,QAAW,SAAiBA,EAAG,CAE7B,OAAO,KAAK,IAAIA,CAAC,CAClB,EACD,MAAO,SAAeA,EAAG,CACvB,OAAOk9D,EAAM/5C,EAAOnjB,CAAC,EAAG,CAAC,CAC1B,EACD,OAAQ,SAAgBA,EAAG,CACzB,OAAOk9D,EAAMl9D,EAAG,CAAC,CAClB,EACD,qCAAsC,SAAoCA,EAAGwH,EAAG,CAC9E,OAAO01D,EAAM/5C,EAAOnjB,CAAC,EAAGwH,CAAC,CAC1B,EACD,sCAAuC,SAAqCxH,EAAGwH,EAAG,CAChF,OAAO01D,EAAMl9D,EAAGwH,CAAC,CAClB,CACL,CAAG,EAQD,SAAS21D,EAAwBn9D,EAAG,CAElC,IAAIo9D,EAAO,EAEX,OAAAp9D,EAAE,QAAQ,SAAUwB,EAAO,CACzB,IAAIisB,EAAIR,EAAIzrB,CAAK,EACbw8C,EAAOvwB,EAAG2vC,CAAI,IAChBA,EAAO3vC,EAEV,EAAE,EAAI,EACA2vC,CACR,CAQD,SAASC,EAAyBr9D,EAAG,CAEnC,IAAIs9D,EAEJ,OAAAt9D,EAAE,QAAQ,SAAUwB,EAAO,CACzB,IAAIisB,EAAIR,EAAIzrB,CAAK,GACb,CAAC87D,GAAQjnB,EAAQ5oB,EAAG6vC,CAAI,KAC1BA,EAAO7vC,EAEV,EAAE,EAAI,EACA6vC,GAAQ,CAChB,CASD,SAASC,EAAYv9D,EAAGwH,EAAG,CAEzB,GAAIA,IAAM,OAAO,mBAAqBA,IAAM,MAC1C,OAAO21D,EAAwBn9D,CAAC,EAElC,GAAIwH,IAAM,OAAO,mBAAqBA,IAAM,OAC1C,OAAO61D,EAAyBr9D,CAAC,EAEnC,GAAIwH,IAAM,MACR,OAAO01D,EAAMl9D,EAAG,CAAC,EAEnB,GAAI,OAAOwH,GAAM,UAAY,CAAC,MAAMA,CAAC,EAAG,CAEtC,GAAI,CAAC65B,EAAY75B,EAAG,CAAC,EAAG,CAEtB,IAAIgO,EAAI,EAER,OAAAxV,EAAE,QAAQ,SAAUwB,EAAO,CACzBgU,EAAI2X,EAAIhB,EAAIc,EAAIzrB,CAAK,EAAGgG,CAAC,EAAGgO,CAAC,CAC9B,EAAE,EAAI,EACA2W,EAAI3W,EAAG,EAAIhO,CAAC,CACpB,CACD,OAAO,OAAO,iBACf,CAED,MAAM,IAAI,MAAM,6BAA6B,CAC9C,CAQD,SAASg2D,EAAqBx9D,EAAG,CAE/B,IAAIy9D,EAAM,EACV,OAAAz9D,EAAE,QAAQ,SAAUwB,EAAO8H,EAAO,CAChCm0D,EAAMtwC,EAAIswC,EAAKnrB,EAAS9wC,EAAOy3C,EAAKz3C,CAAK,CAAC,CAAC,CACjD,CAAK,EACMyrB,EAAIuB,EAAKivC,CAAG,CAAC,CACrB,CAQD,SAASC,EAAe19D,EAAG,CAEzB,IAAIkM,EAAI,CAAA,EAEJyxD,EAAO,EAEX,OAAA39D,EAAE,QAAQ,SAAUwB,EAAO8H,EAAO,CAChC,IAAIkc,EAAIlc,EAAM,CAAC,EACXs0D,EAAKzwC,EAAIjhB,EAAEsZ,CAAC,GAAK,EAAGyH,EAAIzrB,CAAK,CAAC,EAC9Bw8C,EAAO4f,EAAID,CAAI,IACjBA,EAAOC,GAET1xD,EAAEsZ,CAAC,EAAIo4C,CACR,EAAE,EAAI,EACAD,CACR,CAQD,SAASE,EAAe79D,EAAG,CAEzB,IAAI89D,EAAQ99D,EAAE,OACd,GAAI89D,EAAM,CAAC,IAAMA,EAAM,CAAC,EACtB,MAAM,IAAI,WAAW,2BAA2B,EAElD,IAAIC,EAAK3b,EAAWpiD,CAAC,EACjBg+D,EAAW1rB,EAASyrB,EAAI/9D,CAAC,EACzBi+D,EAAYhB,EAAKe,CAAQ,EAAE,OAAO,QAAO,EACzCE,EAAMD,EAAUA,EAAU,OAAS,CAAC,EACxC,OAAOhxC,EAAIuB,EAAK0vC,CAAG,CAAC,CACrB,CAQD,SAASC,EAAoBn+D,EAAG,CAE9B,IAAI8e,EAAI,CAAA,EAEJs/C,EAAO,EAEX,OAAAp+D,EAAE,QAAQ,SAAUwB,EAAO8H,EAAO,CAChC,IAAIzM,EAAIyM,EAAM,CAAC,EACX+0D,EAAKlxC,EAAIrO,EAAEjiB,CAAC,GAAK,EAAGowB,EAAIzrB,CAAK,CAAC,EAC9Bw8C,EAAOqgB,EAAID,CAAI,IACjBA,EAAOC,GAETv/C,EAAEjiB,CAAC,EAAIwhE,CACR,EAAE,EAAI,EACAD,CACR,CASD,SAASE,EAAYt+D,EAAGwH,EAAG,CAEzB,GAAIA,IAAM,EACR,OAAOk2D,EAAe19D,CAAC,EAEzB,GAAIwH,IAAM,OAAO,mBAAqBA,IAAM,MAC1C,OAAO22D,EAAoBn+D,CAAC,EAE9B,GAAIwH,IAAM,MACR,OAAOg2D,EAAqBx9D,CAAC,EAE/B,GAAIwH,IAAM,EACR,OAAOq2D,EAAe79D,CAAC,EAGzB,MAAM,IAAI,MAAM,+BAAiCwH,CAAC,CACnD,CASD,SAAS01D,EAAMl9D,EAAGwH,EAAG,CAEnB,IAAIs2D,EAAQ99D,EAAE,OAGd,GAAI89D,EAAM,SAAW,EACnB,OAAOP,EAAYv9D,EAAGwH,CAAC,EAGzB,GAAIs2D,EAAM,SAAW,EAAG,CACtB,GAAIA,EAAM,CAAC,GAAKA,EAAM,CAAC,EACrB,OAAOQ,EAAYt+D,EAAGwH,CAAC,EAEvB,MAAM,IAAI,WAAW,2BAA2B,CAEnD,CACF,CACH,CAAC,EACD+3C,GAAA,WAAqByd,cCjSrB,OAAO,eAAe7mD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIiM,IAAWhlB,EACXiE,GAAMtB,GACN6D,GAAO,MACPia,IAAe,CAAC,QAAS,YAAa,iBAAkB,OAAQ,MAAM,EACtE0gD,OAA+Bn8C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MACfqlB,EAAYrlB,EAAK,UACjB2vB,EAAiB3vB,EAAK,eACtBw2B,EAAOx2B,EAAK,KACZ/M,EAAO+M,EAAK,KAwBd,OAAO3d,EAAMlB,GAAM,CACjB,2CAA4C46D,EAC5C,6BAA8BC,CAClC,CAAG,EACD,SAASC,EAAa1+D,EAAGqX,EAAG,CAC1B,IAAIsjC,EAAQgkB,EAAM3+D,CAAC,EACf46C,EAAQ+jB,EAAMtnD,CAAC,EACfunD,EAAMC,EACV,GAAIlkB,EAAM,SAAW,EACnBikB,EAAOjkB,EAAM,CAAC,UACLA,EAAM,SAAW,GAAKA,EAAM,CAAC,IAAM,EAC5CikB,EAAOjkB,EAAM,CAAC,MAEd,OAAM,IAAI,WAAW,2DAA6DA,EAAM,KAAK,IAAI,EAAI,GAAG,EAE1G,GAAIC,EAAM,SAAW,EACnBikB,EAAOjkB,EAAM,CAAC,UACLA,EAAM,SAAW,GAAKA,EAAM,CAAC,IAAM,EAC5CikB,EAAOjkB,EAAM,CAAC,MAEd,OAAM,IAAI,WAAW,2DAA6DA,EAAM,KAAK,IAAI,EAAI,GAAG,EAE1G,GAAIgkB,IAASC,EAAM,MAAM,IAAI,WAAW,mCAAqCD,EAAO,OAASC,EAAO,GAAG,EACvG,GAAID,IAAS,EAAG,MAAM,IAAI,WAAW,mDAAmD,EACxF,OAAOA,CACR,CACD,SAASJ,EAAU98D,EAAGC,EAAG,CACvB,IAAI2uB,EAAIouC,EAAah9D,EAAGC,CAAC,EACrBooC,KAAY1oC,GAAI,UAAUK,CAAC,EAAIA,EAAE,MAAQA,EACzC2nC,KAAUhoC,GAAI,UAAUK,CAAC,EAAIA,EAAE,UAAY,OAC3C+rC,KAAYpsC,GAAI,UAAUM,CAAC,EAAIA,EAAE,MAAQA,EACzCmrC,KAAUzrC,GAAI,UAAUM,CAAC,EAAIA,EAAE,UAAY,OAG3Cm9D,EAAYH,EAAMj9D,CAAC,EAAE,SAAW,EAChCq9D,EAAYJ,EAAMh9D,CAAC,EAAE,SAAW,EAChCwrB,EAAM2a,EACN1Z,EAAMgkB,EAGV,GAAI/I,GAAOyD,GAAOzD,IAAQyD,GAAO,OAAOzD,GAAQ,SAAU,CACxD,IAAIC,EAAKD,EAETlc,EAAMroB,EAAM,KAAKgjC,EAAW,CAACwB,EAAIA,CAAE,CAAC,EACpClb,EAAMtpB,EAAM,KAAKstC,EAAgB,CAAC9I,EAAIA,CAAE,CAAC,CAC1C,CAGD,GAAI,CAACw1B,GAAa,CAACC,EAAW,CAE5B,QADI7yD,EAAIkiB,EAAI6qB,EAAKlP,EAAM,CAAC,CAAC,EAAG0D,EAAM,CAAC,CAAC,EAC3B5wC,EAAI,EAAGA,EAAIyzB,EAAGzzB,IACrBqP,EAAIihB,EAAIjhB,EAAGkiB,EAAI6qB,EAAKlP,EAAMltC,CAAC,CAAC,EAAG4wC,EAAM5wC,CAAC,CAAC,CAAC,EAE1C,OAAOqP,CACR,CAGD,GAAI,CAAC4yD,GAAaC,EAAW,CAE3B,QADIC,EAAK5wC,EAAI6qB,EAAKlP,EAAM,CAAC,CAAC,EAAG0D,EAAM,CAAC,EAAE,CAAC,CAAC,EAC/B7rB,EAAK,EAAGA,EAAK0O,EAAG1O,IACvBo9C,EAAK7xC,EAAI6xC,EAAI5wC,EAAI6qB,EAAKlP,EAAMnoB,CAAE,CAAC,EAAG6rB,EAAM7rB,CAAE,EAAE,CAAC,CAAC,CAAC,EAEjD,OAAOo9C,CACR,CAGD,GAAIF,GAAa,CAACC,EAAW,CAE3B,QADIE,EAAM7wC,EAAI6qB,EAAKlP,EAAM,CAAC,EAAE,CAAC,CAAC,EAAG0D,EAAM,CAAC,CAAC,EAChCzrB,EAAM,EAAGA,EAAMsO,EAAGtO,IACzBi9C,EAAM9xC,EAAI8xC,EAAK7wC,EAAI6qB,EAAKlP,EAAM/nB,CAAG,EAAE,CAAC,CAAC,EAAGyrB,EAAMzrB,CAAG,CAAC,CAAC,EAErD,OAAOi9C,CACR,CAGD,GAAIH,GAAaC,EAAW,CAE1B,QADIG,EAAM9wC,EAAI6qB,EAAKlP,EAAM,CAAC,EAAE,CAAC,CAAC,EAAG0D,EAAM,CAAC,EAAE,CAAC,CAAC,EACnC/J,EAAM,EAAGA,EAAMpT,EAAGoT,IACzBw7B,EAAM/xC,EAAI+xC,EAAK9wC,EAAI6qB,EAAKlP,EAAMrG,CAAG,EAAE,CAAC,CAAC,EAAG+J,EAAM/J,CAAG,EAAE,CAAC,CAAC,CAAC,EAExD,OAAOw7B,CACR,CACF,CACD,SAAST,EAAWz+D,EAAGqX,EAAG,CACxBqnD,EAAa1+D,EAAGqX,CAAC,EAYjB,QAXI8nD,EAASn/D,EAAE,OACXo/D,EAAUp/D,EAAE,QACZq/D,EAAShoD,EAAE,OACXioD,EAAUjoD,EAAE,QAGZnL,EAAI,EACJihB,EAAM2a,EACN1Z,EAAMgkB,EACNv1C,EAAI,EACJ2oB,EAAI,EACD3oB,EAAIsiE,EAAO,QAAU35C,EAAI65C,EAAO,QAAQ,CAC7C,IAAI5nC,EAAI0nC,EAAOtiE,CAAC,EACZ66B,EAAI2nC,EAAO75C,CAAC,EAChB,GAAIiS,EAAIC,EAAG,CACT76B,IACA,QACD,CACD,GAAI46B,EAAIC,EAAG,CACTlS,IACA,QACD,CACGiS,IAAMC,IACRxrB,EAAIihB,EAAIjhB,EAAGkiB,EAAIgxC,EAAQviE,CAAC,EAAGyiE,EAAQ95C,CAAC,CAAC,CAAC,EACtC3oB,IACA2oB,IAEH,CACD,OAAOtZ,CACR,CAGD,SAASyyD,EAAM3+D,EAAG,CAChB,SAAWqB,GAAI,UAAUrB,CAAC,EAAIA,EAAE,KAAM,EAAG0V,EAAK1V,CAAC,CAChD,CACH,CAAC,EACDmW,GAAA,UAAoBooD,cC9JpB,OAAO,eAAegB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIz8D,GAAU1F,GACV0d,GAAU/a,GACVqiB,IAAW9gB,EACXsC,IAAO,QACPia,IAAe,CAAC,QAAS,SAAU,KAAK,EACxC2hD,OAAiCp9C,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACd0K,EAAM1K,EAAK,IA4Bb,OAAO3d,EAAM,QAAS,CACpB,MAAO,SAAqB9E,EAAG,CAE7B,OAAOy/D,EAAYt8C,EAAOnjB,CAAC,CAAC,CAC7B,EACD,aAAc0/D,EACd,YAAaD,EACb,IAAK38D,GAAQ,KACjB,CAAG,EACD,SAAS28D,EAAYt5C,EAAG,CAEtB,IAAIzQ,EAAOyQ,EAAE,MACTiM,EAAOjM,EAAE,MAGb,OAAQzQ,EAAK,OAAM,CACjB,IAAK,GAEH,GAAIA,EAAK,CAAC,IAAM,EAEd,SAAW5S,GAAQ,OAAOsvB,EAAK,CAAC,CAAC,EAEnC,MAAM,IAAI,WAAW,mCAAsCtX,GAAQ,QAAQpF,CAAI,EAAI,GAAG,EACxF,IAAK,GACH,CAEE,IAAIuhB,EAAOvhB,EAAK,CAAC,EACbomC,EAAOpmC,EAAK,CAAC,EACjB,GAAIuhB,IAAS6kB,EAAM,CAIjB,QAFI1vB,EAAM,EAEDvvB,EAAI,EAAGA,EAAIo6B,EAAMp6B,IACxBuvB,EAAMe,EAAIf,EAAKgG,EAAKv1B,CAAC,EAAEA,CAAC,CAAC,EAG3B,OAAOuvB,CACnB,KACY,OAAM,IAAI,WAAW,mCAAsCtR,GAAQ,QAAQpF,CAAI,EAAI,GAAG,CAEzF,CACH,QAEE,MAAM,IAAI,WAAW,4CAA+CoF,GAAQ,QAAQpF,CAAI,EAAI,GAAG,CAClG,CACF,CACD,SAASgqD,EAAav5C,EAAG,CAEvB,IAAI/kB,EAAS+kB,EAAE,QACX7c,EAAQ6c,EAAE,OACVsc,EAAMtc,EAAE,KACRzQ,EAAOyQ,EAAE,MAET8Q,EAAOvhB,EAAK,CAAC,EACbwhB,EAAUxhB,EAAK,CAAC,EAEpB,GAAIuhB,IAASC,EAAS,CAEpB,IAAI9K,EAAM,EAEV,GAAIhrB,EAAO,OAAS,EAElB,QAASokB,EAAI,EAAGA,EAAI0R,EAAS1R,IAK3B,QAHIsT,EAAK2J,EAAIjd,CAAC,EACVuT,EAAK0J,EAAIjd,EAAI,CAAC,EAETF,EAAIwT,EAAIxT,EAAIyT,EAAIzT,IAAK,CAE5B,IAAIzoB,EAAIyM,EAAMgc,CAAC,EAEf,GAAIzoB,IAAM2oB,EAAG,CAEX4G,EAAMe,EAAIf,EAAKhrB,EAAOkkB,CAAC,CAAC,EAExB,KACD,CACD,GAAIzoB,EAAI2oB,EAEN,KAEH,CAIL,OAAO4G,CACR,CACD,MAAM,IAAI,WAAW,mCAAsCtR,GAAQ,QAAQpF,CAAI,EAAI,GAAG,CACvF,CACH,CAAC,EACD6pD,GAAA,YAAsBC,cClItB,OAAO,eAAelrC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIlS,IAAWhlB,EACXiE,GAAMtB,GACN6D,GAAO,QACPia,IAAe,CAAC,QAAS,OAAO,EAChC8hD,OAAiCv9C,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MACf03B,EAAQ13B,EAAK,MAkCf,OAAO3d,EAAMlB,GAAM,CACjB,0DAA2D,SAA+CyF,EAAM,CAC9G,IAAI6mD,EAAS7mD,EAAK,IAAI,SAAU2D,EAAK,CACnC,SAAQ3L,GAAI,aAAa2L,CAAG,EACnBA,EAAI,WACF,MAAM,QAAQA,CAAG,MAAS3L,GAAI,UAAU2L,CAAG,EAC7CA,EAAI,IAAI,SAAUwO,EAAM,CAE7B,SAAWna,GAAI,aAAama,CAAI,EAAIA,EAAK,SAAU,EAAGA,CAClE,CAAW,EAEMxO,CAEjB,CAAO,EACGokB,EAAM,IAAI+oB,EACd,OAAAA,EAAM,MAAM/oB,EAAK8+B,CAAM,EAChB9+B,CACR,CACL,CAAG,CACH,CAAC,EACDkD,GAAA,YAAsBqrC,0DChEtB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OAEnB,IAAIC,EAAW,IAAI,IAAI,CAAC,KAAK,CAAC,EAC9BD,OAAAA,GAAA,SAAmBC,KCNnB,IAAIrjE,GAAyBY,GAC7B,OAAO,eAAe0iE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIhgE,GAAWtD,GAAuBuD,EAAwC,EAC1EugB,IAAmB9jB,GAAuB8E,GAAA,CAAgD,EAC1Fif,IAAgB/jB,GAAuBuH,GAAA,CAA6C,EACpF6pC,IAAsBpxC,GAAuBsc,GAAA,CAAmD,EAChGzX,IAAMihB,GACNy9C,IAAY9qC,GAAA,EACZnyB,IAAUoyB,GACV9S,IAAW+S,EACX9S,IAAO+S,GACPxxB,IAAO,OACPia,IAAe,CAAC,mBAAmB,EACnCmiD,OAAgC59C,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CACxF,IAAIw9C,EAAoBx9C,EAAK,kBAM7B,SAASy9C,EAAeliD,EAAO,CAC7B,QAAS4D,EAAK,EAAGu+C,KAAWvyB,IAAoB,SAAYmyB,IAAU,QAAQ,EAAGn+C,EAAKu+C,EAAK,OAAQv+C,IAAM,CACvG,IAAIw+C,EAASD,EAAKv+C,CAAE,EACpB,GAAI5D,EAAM,IAAIoiD,CAAM,EAClB,MAAM,IAAI,MAAM,sCAAwCA,EAAS,yBAAyB,CAE7F,CACF,CACD,IAAIN,EAAoB,UAAY,CAClC,SAASA,GAAO,IACVx/C,IAAiB,SAAY,KAAMw/C,CAAI,CAC5C,CACD,SAAIv/C,IAAc,SAAYu/C,EAAM,CAAC,CACnC,IAAK,OACL,IAAK,UAAe,CAClB,MAAO,MACR,CACP,EAAO,CACD,IAAK,SACL,IAAK,UAAe,CAClB,MAAO,EACR,CAOP,EAAO,CACD,IAAK,WACL,MAAO,SAAkB9hD,EAAO,CAC9B,OAAO,KAAK,QAAO,EAAG,SAASA,CAAK,CACrC,CAUP,EAAO,CACD,IAAK,UACL,MAAO,UAAmB,CACxB,IAAIqiD,EAAO,KAAK,SAASJ,EAAmB,CAAE,CAAA,EAC1C52D,EAAO,CAAA,EACPi3D,EAAU,KACd,SAASC,EAASviD,EAAO,CACvB,IAAInW,KAAQwa,IAAK,WAAWrE,CAAK,EACjC,OAAAkiD,EAAer4D,CAAC,EACTw4D,EAAKx4D,EAAGwB,EAAMi3D,CAAO,CAC7B,CACD,MAAO,CACL,SAAUC,CACpB,CACO,CAeP,EAAO,CACD,IAAK,WACL,MAAO,SAAkBC,EAAMC,EAAU,CACvC,MAAM,IAAI,MAAM,+CAAiD,KAAK,IAAI,CAC3E,CAMP,EAAO,CACD,IAAK,UACL,MAAO,SAAiBh/D,EAAU,CAEhC,MAAM,IAAI,MAAM,wCAAwC,CACzD,CAQP,EAAO,CACD,IAAK,MACL,MAAO,SAAaA,EAAU,CAE5B,MAAM,IAAI,MAAM,oCAAoC,CACrD,CAQP,EAAO,CACD,IAAK,UACL,MAAO,SAAiBvB,EAAM,CAC5B,GAAI,IAAKmB,IAAI,QAAQnB,CAAI,EACvB,MAAM,IAAI,UAAU,sCAAsC,EAE5D,OAAOA,CACR,CAQP,EAAO,CACD,IAAK,WACL,MAAO,SAAkBuB,EAAU,CAGjCA,EAAS,KAAM,KAAM,IAAI,EAGzB,SAASi/D,EAAUxgE,EAAMuB,EAAU,CACjCvB,EAAK,QAAQ,SAAUqC,EAAOH,EAAMyuD,EAAQ,CAC1CpvD,EAASc,EAAOH,EAAMyuD,CAAM,EAC5B6P,EAAUn+D,EAAOd,CAAQ,CACrC,CAAW,CACF,CACDi/D,EAAU,KAAMj/D,CAAQ,CACzB,CAwBP,EAAO,CACD,IAAK,YACL,MAAO,SAAmBA,EAAU,CAClC,SAASk/D,EAAWp+D,EAAOH,EAAMyuD,EAAQ,CACvC,IAAIv+B,EAAc7wB,EAASc,EAAOH,EAAMyuD,CAAM,EAC9C,OAAIv+B,IAAgB/vB,EAEX+vB,EAEF/vB,EAAM,IAAIo+D,CAAU,CAC5B,CACD,OAAOA,EAAW,KAAM,KAAM,IAAI,CACnC,CAiBP,EAAO,CACD,IAAK,SACL,MAAO,SAAgBl/D,EAAU,CAC/B,IAAI4vD,EAAQ,CAAA,EACZ,YAAK,SAAS,SAAUnxD,EAAMkC,EAAMyuD,EAAQ,CACtCpvD,EAASvB,EAAMkC,EAAMyuD,CAAM,GAC7BQ,EAAM,KAAKnxD,CAAI,CAE3B,CAAS,EACMmxD,CACR,CAMP,EAAO,CACD,IAAK,QACL,MAAO,UAAiB,CAEtB,MAAM,IAAI,MAAM,+BAA+B,CAChD,CAMP,EAAO,CACD,IAAK,YACL,MAAO,UAAqB,CAC1B,OAAO,KAAK,IAAI,SAAUnxD,EAAM,CAC9B,OAAOA,EAAK,WACtB,CAAS,CACF,CAQP,EAAO,CACD,IAAK,SACL,MAAO,SAAgB2T,EAAO,CAC5B,OAAOA,EAAQ,KAAK,OAASA,EAAM,SAAY/Q,IAAQ,iBAAiB,KAAM+Q,CAAK,EAAI,EACxF,CAiBP,EAAO,CACD,IAAK,WACL,MAAO,SAAkBzQ,EAAS,CAChC,IAAIw9D,EAAe,KAAK,iBAAiBx9D,CAAO,EAChD,OAAI,OAAOw9D,EAAiB,IACnBA,EAEF,KAAK,UAAUx9D,CAAO,CAC9B,CAQP,EAAO,CACD,IAAK,SACL,MAAO,UAAkB,CACvB,MAAM,IAAI,MAAM,sDAAwD,KAAK,IAAI,CAClF,CAiBP,EAAO,CACD,IAAK,SACL,MAAO,SAAgBA,EAAS,CAC9B,IAAIw9D,EAAe,KAAK,iBAAiBx9D,CAAO,EAChD,OAAI,OAAOw9D,EAAiB,IACnBA,EAEF,KAAK,OAAOx9D,CAAO,CAC3B,CAQP,EAAO,CACD,IAAK,YACL,MAAO,UAAqB,CAE1B,MAAM,IAAI,MAAM,iCAAmC,KAAK,IAAI,CAC7D,CAiBP,EAAO,CACD,IAAK,QACL,MAAO,SAAeA,EAAS,CAC7B,IAAIw9D,EAAe,KAAK,iBAAiBx9D,CAAO,EAChD,OAAI,OAAOw9D,EAAiB,IACnBA,EAEF,KAAK,OAAOx9D,CAAO,CAC3B,CASP,EAAO,CACD,IAAK,SACL,MAAO,SAAgBA,EAAS,CAE9B,MAAM,IAAI,MAAM,8BAAgC,KAAK,IAAI,CAC1D,CAKP,EAAO,CACD,IAAK,mBACL,MAAO,SAA0BA,EAAS,CACxC,GAAIA,MAAetD,GAAS,SAAYsD,CAAO,IAAM,SACnD,UAAYtD,GAAS,SAAYsD,EAAQ,OAAO,EAAC,CAC/C,IAAK,SACL,IAAK,YACH,OACF,IAAK,WACH,OAAOA,EAAQ,QAAQ,KAAMA,CAAO,EACtC,QACE,MAAM,IAAI,UAAU,yCAAyC,CAChE,CAEJ,CAMP,EAAO,CACD,IAAK,gBACL,MAAO,UAAyB,CAC9B,OAAO,KAAK,IACb,CAMP,EAAO,CACD,IAAK,aACL,MAAO,UAAsB,CAC3B,OAAO,IACR,CACF,CAAA,CAAC,EACK08D,CACX,IACE,OAAOA,CACT,EAAG,CACD,QAAS,GACT,OAAQ,EACV,CAAC,EACDA,GAAA,WAAqBE,6FCtarB,SAASa,EAAgB1jE,EAAGqK,EAAG,CAC7B,OAAA9K,EAAA,QAAiBmkE,EAAkB,OAAO,eAAiB,OAAO,eAAe,KAAI,EAAK,SAAyB1jE,EAAGqK,EAAG,CACvH,OAAArK,EAAE,UAAYqK,EACPrK,CACX,EAAKT,EAAA,QAAA,WAA4B,GAAMA,EAAO,QAAQ,QAAaA,EAAO,QACjEmkE,EAAgB1jE,EAAGqK,CAAC,CAC5B,CACD9K,EAAA,QAAiBmkE,EAAiBnkE,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,2ECPvG,IAAIokE,EAAiB1jE,MACrB,SAAS2jE,EAAUC,EAAUC,EAAY,CACvC,GAAI,OAAOA,GAAe,YAAcA,IAAe,KACrD,MAAM,IAAI,UAAU,oDAAoD,EAE1ED,EAAS,UAAY,OAAO,OAAOC,GAAcA,EAAW,UAAW,CACrE,YAAa,CACX,MAAOD,EACP,SAAU,GACV,aAAc,EACf,CACL,CAAG,EACD,OAAO,eAAeA,EAAU,YAAa,CAC3C,SAAU,EACd,CAAG,EACGC,GAAYH,EAAeE,EAAUC,CAAU,CACpD,CACDvkE,EAAA,QAAiBqkE,EAAWrkE,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,4GCjBjG,SAASwkE,EAAuBlyD,EAAM,CACpC,GAAIA,IAAS,OACX,MAAM,IAAI,eAAe,2DAA2D,EAEtF,OAAOA,CACR,CACDtS,EAAA,QAAiBwkE,EAAwBxkE,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,2ECN9G,IAAIQ,EAAUE,GAAuB,QACjC+jE,EAAwBphE,MAC5B,SAASqhE,EAA2BpyD,EAAMqyD,EAAM,CAC9C,GAAIA,IAASnkE,EAAQmkE,CAAI,IAAM,UAAY,OAAOA,GAAS,YACzD,OAAOA,EACF,GAAIA,IAAS,OAClB,MAAM,IAAI,UAAU,0DAA0D,EAEhF,OAAOF,EAAsBnyD,CAAI,CAClC,CACDtS,EAAA,QAAiB0kE,EAA4B1kE,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,2FCVlH,SAAS4kE,EAAgBnkE,EAAG,CAC1B,OAAAT,UAAiB4kE,EAAkB,OAAO,eAAiB,OAAO,eAAe,KAAI,EAAK,SAAyBnkE,EAAG,CACpH,OAAOA,EAAE,WAAa,OAAO,eAAeA,CAAC,CACjD,EAAKT,EAAA,QAAA,WAA4B,GAAMA,EAAO,QAAQ,QAAaA,EAAO,QACjE4kE,EAAgBnkE,CAAC,CACzB,CACDT,EAAA,QAAiB4kE,EAAiB5kE,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,yCCJvG,OAAO,eAAe6kE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAGC,IACzB,IAAIxmD,IAAc5d,GAMlB,SAASokE,IAAe13D,EAAK,CAC3B,OAAIA,GAAOA,EAAI,aACN,IAAIkR,IAAY,WAAWlR,EAAI,MAAQ,EAAGA,EAAI,IAAM,EAAGA,EAAI,MAAQ,OAAYA,EAAI,IAAM,EAAI,MAAS,EAExGA,CACT,2CCfA,IAAItN,EAAyBY,GAC7B,OAAO,eAAeqkE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAGC,EACxB,IAAI5hE,EAAWtD,EAAuBuD,EAAwC,EAC1E4hE,EAAkBrgE,GAClBkf,EAAWzc,GACf,SAAS29D,EAAcj/C,EAAM,CAC3B,IAAI0+B,EAAS1+B,EAAK,OAYlB,OAAO,SAAgBriB,EAAQkJ,EAAO,CACpC,GAAI,CACF,GAAI,MAAM,QAAQlJ,CAAM,EACtB,OAAO+gD,EAAO/gD,EAAQkJ,CAAK,EACtB,GAAIlJ,GAAU,OAAOA,EAAO,QAAW,WAE5C,OAAOA,EAAO,OAAOkJ,CAAK,EACrB,GAAI,OAAOlJ,GAAW,SAE3B,OAAO+gD,EAAO/gD,EAAQkJ,CAAK,EACtB,MAAQxJ,EAAS,SAAYM,CAAM,IAAM,SAAU,CACxD,GAAI,CAACkJ,EAAM,mBACT,MAAM,IAAI,UAAU,iDAAiD,EAEvE,SAAWkX,EAAS,iBAAiBpgB,EAAQkJ,EAAM,kBAAiB,CAAE,CAC9E,KACQ,OAAM,IAAI,UAAU,gDAAgD,CAEvE,OAAQQ,EAAK,CACZ,QAAU63D,EAAgB,gBAAgB73D,CAAG,CAC9C,CACL,CACA,WC3CA,IAAItN,GAAyBY,GAC7B,OAAO,eAAewkE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIthD,IAAmB9jB,GAAuBuD,GAAA,CAAgD,EAC1FwgB,IAAgB/jB,GAAuB8E,GAAA,CAA6C,EACpFugE,IAAarlE,GAAuBuH,GAAA,CAA0C,EAC9E+9D,IAA8BtlE,GAAuBsc,GAAA,CAA2D,EAChHipD,GAAmBvlE,GAAuB8lB,GAAA,CAAgD,EAC1FqtB,IAAmBnzC,GAAuBy4B,GAAA,CAAgD,EAC1F5zB,GAAM6zB,GACN1U,IAAW2U,GACX/S,IAAWgT,EACX4sC,IAAUrW,GAAA,EACd,SAASsW,IAAaC,EAAS,CAAE,IAAIC,EAA4BC,IAAyB,EAAI,OAAO,UAAgC,CAAE,IAAIC,KAAYN,GAAiB,SAAYG,CAAO,EAAG7sD,EAAQ,GAAI8sD,EAA2B,CAAE,IAAIG,KAAgBP,GAAiB,SAAY,IAAI,EAAE,YAAa1sD,EAAS,QAAQ,UAAUgtD,EAAO,UAAWC,CAAS,CAAE,MAAUjtD,EAASgtD,EAAM,MAAM,KAAM,SAAS,EAAK,SAAWP,IAA4B,SAAY,KAAMzsD,CAAM,CAAI,CAAG,CAC5d,SAAS+sD,KAA4B,CAA0E,GAApE,OAAO,QAAY,KAAe,CAAC,QAAQ,WAA6B,QAAQ,UAAU,KAAM,MAAO,GAAO,GAAI,OAAO,OAAU,WAAY,MAAO,GAAM,GAAI,CAAE,eAAQ,UAAU,QAAQ,KAAK,QAAQ,UAAU,QAAS,GAAI,UAAY,CAAE,CAAA,CAAC,EAAU,EAAO,MAAW,CAAE,MAAO,GAAU,CACzU,IAAIx+D,GAAO,eACPia,IAAe,CAAC,SAAU,MAAM,EAChC0kD,OAAwCngD,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAChG,IAAI0+B,EAAS1+B,EAAK,OAChBq9C,EAAOr9C,EAAK,KACVg/C,KAAaO,IAAQ,eAAe,CACtC,OAAQ7gB,CACZ,CAAG,EAMD,SAASqhB,EAAgBtiE,EAAM,CAE7B,MAAO,KAAMmB,GAAI,gBAAgBnB,CAAI,MAASmB,GAAI,aAAanB,CAAI,MAASmB,GAAI,gBAAgBnB,CAAI,MAASmB,GAAI,gBAAgBnB,CAAI,MAASmB,GAAI,cAAcnB,CAAI,MAASmB,GAAI,mBAAmBnB,CAAI,MAASmB,GAAI,cAAcnB,CAAI,EACxO,CACD,IAAI0hE,EAA4B,SAAUa,EAAO,IAC3CZ,IAAW,SAAYD,EAAca,CAAK,EAC9C,IAAIC,EAAST,IAAaL,CAAY,EAUtC,SAASA,EAAaxhE,EAAQkJ,EAAO,CACnC,IAAIstB,EAGJ,MAFItW,IAAiB,SAAY,KAAMshD,CAAY,EACnDhrC,EAAQ8rC,EAAO,KAAK,IAAI,EACpB,IAAKrhE,GAAI,QAAQjB,CAAM,EACzB,MAAM,IAAI,UAAU,sCAAsC,EAE5D,GAAI,IAAKiB,GAAI,aAAaiI,CAAK,EAC7B,MAAM,IAAI,UAAU,0CAA0C,EAEhE,OAAAstB,EAAM,OAASx2B,EACfw2B,EAAM,MAAQttB,EACPstB,CACR,CAGD,SAAIrW,IAAc,SAAYqhD,EAAc,CAAC,CAC3C,IAAK,OACL,IAAK,UAAe,CAClB,OAAI,KAAK,MACA,KAAK,MAAM,iBAAkB,EAAG,KAAK,MAAM,kBAAmB,EAAG,GAEjE,KAAK,OAAO,MAAQ,EAE9B,CACP,EAAO,CACD,IAAK,OACL,IAAK,UAAe,CAClB,OAAOh+D,EACR,CACP,EAAO,CACD,IAAK,iBACL,IAAK,UAAe,CAClB,MAAO,EACR,CAeP,EAAO,CACD,IAAK,WACL,MAAO,SAAkB48D,EAAMC,EAAU,CACvC,IAAIkC,EAAa,KAAK,OAAO,SAASnC,EAAMC,CAAQ,EAChDmC,EAAY,KAAK,MAAM,SAASpC,EAAMC,CAAQ,EAClD,GAAI,KAAK,MAAM,mBAAoB,CACjC,IAAI7+D,EAAO,KAAK,MAAM,kBAAiB,EACvC,OAAO,SAA0Boc,EAAO3U,EAAMi3D,EAAS,CAErD,SAAW9/C,IAAS,iBAAiBmiD,EAAW3kD,EAAO3U,EAAMi3D,CAAO,EAAG1+D,CAAI,CACvF,CACA,KACU,QAAO,SAA0Boc,EAAO3U,EAAMi3D,EAAS,CACrD,IAAIlgE,EAASuiE,EAAW3kD,EAAO3U,EAAMi3D,CAAO,EAExCh3D,EAAQs5D,EAAU5kD,EAAO3U,EAAMjJ,CAAM,EACzC,OAAOqhE,EAAOrhE,EAAQkJ,CAAK,CACvC,CAEO,CAMP,EAAO,CACD,IAAK,UACL,MAAO,SAAiB7H,EAAU,CAChCA,EAAS,KAAK,OAAQ,SAAU,IAAI,EACpCA,EAAS,KAAK,MAAO,QAAS,IAAI,CACnC,CAQP,EAAO,CACD,IAAK,MACL,MAAO,SAAaA,EAAU,CAC5B,OAAO,IAAImgE,EAAa,KAAK,QAAQngE,EAAS,KAAK,OAAQ,SAAU,IAAI,CAAC,EAAG,KAAK,QAAQA,EAAS,KAAK,MAAO,QAAS,IAAI,CAAC,CAAC,CAC/H,CAMP,EAAO,CACD,IAAK,QACL,MAAO,UAAiB,CACtB,OAAO,IAAImgE,EAAa,KAAK,OAAQ,KAAK,KAAK,CAChD,CAOP,EAAO,CACD,IAAK,YACL,MAAO,SAAmBx+D,EAAS,CACjC,IAAIhD,EAAS,KAAK,OAAO,SAASgD,CAAO,EACzC,OAAIo/D,EAAgB,KAAK,MAAM,IAC7BpiE,EAAS,IAAMA,EAAS,KAEnBA,EAAS,KAAK,MAAM,SAASgD,CAAO,CAC5C,CAOP,EAAO,CACD,IAAK,SACL,MAAO,SAAgBA,EAAS,CAC9B,IAAIhD,EAAS,KAAK,OAAO,OAAOgD,CAAO,EACvC,OAAIo/D,EAAgB,KAAK,MAAM,IAC7BpiE,EAAS,iEAAmEA,EAAS,kEAEhFA,EAAS,KAAK,MAAM,OAAOgD,CAAO,CAC1C,CAOP,EAAO,CACD,IAAK,SACL,MAAO,SAAgBA,EAAS,CAC9B,IAAIhD,EAAS,KAAK,OAAO,MAAMgD,CAAO,EACtC,OAAIo/D,EAAgB,KAAK,MAAM,IAC7BpiE,EAAS,iCAEJA,EAAS,KAAK,MAAM,MAAMgD,CAAO,CACzC,CAMP,EAAO,CACD,IAAK,SACL,MAAO,UAAkB,CACvB,MAAO,CACL,OAAQQ,GACR,OAAQ,KAAK,OACb,MAAO,KAAK,KACtB,CACO,CAUF,CAAA,EAAG,CAAC,CACH,IAAK,WACL,MAAO,SAAkB4f,EAAM,CAC7B,OAAO,IAAIo+C,EAAap+C,EAAK,OAAQA,EAAK,KAAK,CAChD,CACF,CAAA,CAAC,EACKo+C,CACR,EAAC9B,CAAI,EACN,SAAInwB,IAAiB,SAAYiyB,EAAc,OAAQh+D,EAAI,EACpDg+D,CACT,EAAG,CACD,QAAS,GACT,OAAQ,EACV,CAAC,EACDA,GAAA,mBAA6BW,cCtOzB/lE,GAAyBY,GAC7B,OAAO,eAAeylE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIviD,IAAmB9jB,GAAuBuD,GAAA,CAAgD,EAC1FwgB,IAAgB/jB,GAAuB8E,GAAA,CAA6C,EACpFugE,IAAarlE,GAAuBuH,GAAA,CAA0C,EAC9E+9D,IAA8BtlE,GAAuBsc,GAAA,CAA2D,EAChHipD,GAAmBvlE,GAAuB8lB,GAAA,CAAgD,EAC1FqtB,IAAmBnzC,GAAuBy4B,GAAA,CAAgD,EAC1F5zB,GAAM6zB,GACNtX,GAASuX,GACT/S,IAAWgT,EACf,SAAS6sC,IAAaC,EAAS,CAAE,IAAIC,EAA4BC,IAAyB,EAAI,OAAO,UAAgC,CAAE,IAAIC,KAAYN,GAAiB,SAAYG,CAAO,EAAG7sD,EAAQ,GAAI8sD,EAA2B,CAAE,IAAIG,KAAgBP,GAAiB,SAAY,IAAI,EAAE,YAAa1sD,EAAS,QAAQ,UAAUgtD,EAAO,UAAWC,CAAS,CAAE,MAAUjtD,EAASgtD,EAAM,MAAM,KAAM,SAAS,EAAK,SAAWP,IAA4B,SAAY,KAAMzsD,CAAM,CAAI,CAAG,CAC5d,SAAS+sD,KAA4B,CAA0E,GAApE,OAAO,QAAY,KAAe,CAAC,QAAQ,WAA6B,QAAQ,UAAU,KAAM,MAAO,GAAO,GAAI,OAAO,OAAU,WAAY,MAAO,GAAM,GAAI,CAAE,eAAQ,UAAU,QAAQ,KAAK,QAAQ,UAAU,QAAS,GAAI,UAAY,CAAE,CAAA,CAAC,EAAU,EAAO,MAAW,CAAE,MAAO,GAAU,CACzU,IAAIx+D,GAAO,YACPia,IAAe,CAAC,MAAM,EACtBilD,OAAqC1gD,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC7F,IAAIq9C,EAAOr9C,EAAK,KACZogD,EAAyB,SAAUJ,EAAO,IACxCZ,IAAW,SAAYgB,EAAWJ,CAAK,EAC3C,IAAIC,EAAST,IAAaY,CAAS,EAOnC,SAASA,EAAUE,EAAO,CACxB,IAAInsC,EAMJ,MALItW,IAAiB,SAAY,KAAMuiD,CAAS,EAChDjsC,EAAQ8rC,EAAO,KAAK,IAAI,EACxB9rC,EAAM,MAAQmsC,GAAS,GAGnB,CAAC,MAAM,QAAQnsC,EAAM,KAAK,GAAK,CAACA,EAAM,MAAM,MAAMv1B,GAAI,MAAM,EAC9D,MAAM,IAAI,UAAU,iCAAiC,EAEvD,OAAOu1B,CACR,CACD,SAAIrW,IAAc,SAAYsiD,EAAW,CAAC,CACxC,IAAK,OACL,IAAK,UAAe,CAClB,OAAOj/D,EACR,CACP,EAAO,CACD,IAAK,cACL,IAAK,UAAe,CAClB,MAAO,EACR,CAeP,EAAO,CACD,IAAK,WACL,MAAO,SAAkB48D,EAAMC,EAAU,CACvC,IAAIuC,KAAgBplD,GAAO,KAAK,KAAK,MAAO,SAAUja,EAAM,CAC1D,OAAOA,EAAK,SAAS68D,EAAMC,CAAQ,CAC7C,CAAS,EACG5mB,EAAW2mB,EAAK,OAAO,SAAW,QACtC,GAAI3mB,EAAU,CACZ,IAAI12B,EAASq9C,EAAK,OAClB,OAAO,SAAuBxiD,EAAO3U,EAAMi3D,EAAS,CAClD,OAAOn9C,KAAWvF,GAAO,KAAKolD,EAAW,SAAUC,EAAU,CAC3D,OAAOA,EAASjlD,EAAO3U,EAAMi3D,CAAO,CACrC,CAAA,CAAC,CACd,CACA,KACU,QAAO,SAAuBtiD,EAAO3U,EAAMi3D,EAAS,CAClD,SAAW1iD,GAAO,KAAKolD,EAAW,SAAUC,EAAU,CACpD,OAAOA,EAASjlD,EAAO3U,EAAMi3D,CAAO,CAClD,CAAa,CACb,CAEO,CAMP,EAAO,CACD,IAAK,UACL,MAAO,SAAiB7+D,EAAU,CAChC,QAAS5E,EAAI,EAAGA,EAAI,KAAK,MAAM,OAAQA,IAAK,CAC1C,IAAIqD,EAAO,KAAK,MAAMrD,CAAC,EACvB4E,EAASvB,EAAM,SAAWrD,EAAI,IAAK,IAAI,CACxC,CACF,CAQP,EAAO,CACD,IAAK,MACL,MAAO,SAAa4E,EAAU,CAE5B,QADIshE,EAAQ,CAAA,EACHlmE,EAAI,EAAGA,EAAI,KAAK,MAAM,OAAQA,IACrCkmE,EAAMlmE,CAAC,EAAI,KAAK,QAAQ4E,EAAS,KAAK,MAAM5E,CAAC,EAAG,SAAWA,EAAI,IAAK,IAAI,CAAC,EAE3E,OAAO,IAAIgmE,EAAUE,CAAK,CAC3B,CAMP,EAAO,CACD,IAAK,QACL,MAAO,UAAiB,CACtB,OAAO,IAAIF,EAAU,KAAK,MAAM,MAAM,CAAC,CAAC,CACzC,CAQP,EAAO,CACD,IAAK,YACL,MAAO,SAAmBz/D,EAAS,CACjC,IAAI2/D,EAAQ,KAAK,MAAM,IAAI,SAAU7iE,EAAM,CACzC,OAAOA,EAAK,SAASkD,CAAO,CACtC,CAAS,EACD,MAAO,IAAM2/D,EAAM,KAAK,IAAI,EAAI,GACjC,CAMP,EAAO,CACD,IAAK,SACL,MAAO,UAAkB,CACvB,MAAO,CACL,OAAQn/D,GACR,MAAO,KAAK,KACtB,CACO,CASP,EAAO,CACD,IAAK,SACL,MAOA,SAAgBR,EAAS,CACvB,IAAI2/D,EAAQ,KAAK,MAAM,IAAI,SAAU7iE,EAAM,CACzC,OAAOA,EAAK,OAAOkD,CAAO,CACpC,CAAS,EACD,MAAO,kEAAoE2/D,EAAM,KAAK,uCAAuC,EAAI,iEAClI,CAOP,EAAO,CACD,IAAK,SACL,MAAO,SAAgB3/D,EAAS,CAC9B,SAAS8/D,EAAWH,EAAOI,EAAQ,CACjC,IAAIC,EAAaL,EAAM,KAAK1hE,GAAI,WAAW,GAAK,CAAC0hE,EAAM,MAAM1hE,GAAI,WAAW,EACxEgiE,EAAeF,GAAUC,EACzBE,EAAUD,EAAe,IAAM,OAC/BE,EAAWR,EAAM,IAAI,SAAU7iE,EAAM,CACvC,OAAIA,EAAK,MACAgjE,EAAWhjE,EAAK,MAAO,CAACijE,CAAM,EAE9BjjE,EAAK,MAAMkD,CAAO,CAEvC,CAAW,EAAE,KAAKkgE,CAAO,EACf,OAAOF,GAAc,CAACC,GAAgBA,GAAgB,CAACF,EAAS,mBAAqBI,EAAW,iBAAmBA,CACpH,CACD,OAAOL,EAAW,KAAK,MAAO,EAAK,CACpC,CACF,CAAA,EAAG,CAAC,CACH,IAAK,WACL,MAAO,SAAkB1/C,EAAM,CAC7B,OAAO,IAAIq/C,EAAUr/C,EAAK,KAAK,CAChC,CACF,CAAA,CAAC,EACKq/C,CACR,EAAC/C,CAAI,EACN,SAAInwB,IAAiB,SAAYkzB,EAAW,OAAQj/D,EAAI,EACjDi/D,CACT,EAAG,CACD,QAAS,GACT,OAAQ,EACV,CAAC,EACDA,GAAA,gBAA0BC,2DCvN1B,IAAItmE,EAAyBY,GAC7B,OAAO,eAAe6iB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAGujD,EACxB,IAAI1jE,EAAWtD,EAAuBuD,EAAwC,EAC1E4hE,EAAkBrgE,GAClBkf,EAAWzc,GACf,SAASy/D,EAAc/gD,EAAM,CAC3B,IAAI0+B,EAAS1+B,EAAK,OAChBU,EAASV,EAAK,OAehB,OAAO,SAAgBriB,EAAQkJ,EAAO9H,EAAO,CAC3C,GAAI,CACF,GAAI,MAAM,QAAQpB,CAAM,EAEtB,OAAO+iB,EAAO/iB,CAAM,EAAE,OAAOkJ,EAAO9H,CAAK,EAAE,UACtC,GAAIpB,GAAU,OAAOA,EAAO,QAAW,WAE5C,OAAOA,EAAO,OAAOkJ,EAAO9H,CAAK,EAC5B,GAAI,OAAOpB,GAAW,SAE3B,OAAO+gD,EAAO/gD,EAAQkJ,EAAO9H,CAAK,EAC7B,MAAQ1B,EAAS,SAAYM,CAAM,IAAM,SAAU,CACxD,GAAI,CAACkJ,EAAM,mBACT,MAAM,UAAU,iDAAiD,EAEnE,SAAIkX,EAAS,iBAAiBpgB,EAAQkJ,EAAM,kBAAiB,EAAI9H,CAAK,EAC/DpB,CACf,KACQ,OAAM,IAAI,UAAU,gDAAgD,CAEvE,OAAQ0J,EAAK,CACZ,QAAU63D,EAAgB,gBAAgB73D,CAAG,CAC9C,CACL,CACA,qBCjDA,OAAO,eAAe25D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAGC,IACRD,GAAA,YAAGE,IACDF,GAAA,cAAGG,GACCH,GAAA,kBAAGI,IACVJ,GAAA,WAAG,OACrB,IAAI3gE,GAAU1F,GACViE,GAAMtB,GACV,SAAS0gB,IAA2BtjB,EAAGujB,EAAgB,CAAE,IAAIC,EAAK,OAAO,OAAW,KAAexjB,EAAE,OAAO,QAAQ,GAAKA,EAAE,YAAY,EAAG,GAAI,CAACwjB,EAAI,CAAE,GAAI,MAAM,QAAQxjB,CAAC,IAAMwjB,EAAKC,IAA4BzjB,CAAC,IAAMujB,GAAkBvjB,GAAK,OAAOA,EAAE,QAAW,SAAU,CAAMwjB,IAAIxjB,EAAIwjB,GAAI,IAAI9jB,EAAI,EAAOgkB,EAAI,UAAa,GAAI,MAAO,CAAE,EAAGA,EAAG,EAAG,UAAa,CAAE,OAAIhkB,GAAKM,EAAE,OAAe,CAAE,KAAM,EAAI,EAAW,CAAE,KAAM,GAAO,MAAOA,EAAEN,GAAG,EAAI,EAAI,EAAG,SAAWikB,EAAI,CAAE,MAAMA,CAAG,EAAI,EAAGD,CAAG,CAAG,CAAC,MAAM,IAAI,UAAU;AAAA,mFAAuI,CAAI,CAAC,IAAIE,EAAmB,GAAMC,EAAS,GAAOlX,EAAK,MAAO,CAAE,EAAG,UAAa,CAAE6W,EAAKA,EAAG,KAAKxjB,CAAC,CAAE,EAAI,EAAG,UAAa,CAAE,IAAI8jB,EAAON,EAAG,KAAM,EAAE,OAAAI,EAAmBE,EAAK,KAAaA,CAAO,EAAE,EAAG,SAAWC,EAAK,CAAEF,EAAS,GAAMlX,EAAMoX,CAAM,EAAE,EAAG,UAAa,CAAE,GAAI,CAAM,CAACH,GAAoBJ,EAAG,QAAa,MAAMA,EAAG,OAAS,CAAG,QAAW,CAAE,GAAIK,EAAQ,MAAMlX,CAAI,CAAI,CAAA,CAAK,CAC5+B,SAAS8W,IAA4BzjB,EAAGwe,EAAQ,CAAE,GAAKxe,EAAW,IAAI,OAAOA,GAAM,SAAU,OAAOgkB,GAAkBhkB,EAAGwe,CAAM,EAAG,IAAI,EAAI,OAAO,UAAU,SAAS,KAAKxe,CAAC,EAAE,MAAM,EAAG,EAAE,EAAgE,GAAzD,IAAM,UAAYA,EAAE,cAAa,EAAIA,EAAE,YAAY,MAAU,IAAM,OAAS,IAAM,MAAO,OAAO,MAAM,KAAKA,CAAC,EAAG,GAAI,IAAM,aAAe,2CAA2C,KAAK,CAAC,EAAG,OAAOgkB,GAAkBhkB,EAAGwe,CAAM,EAAI,CACha,SAASwF,GAAkB3O,EAAK3Q,EAAK,EAAMA,GAAO,MAAQA,EAAM2Q,EAAI,UAAQ3Q,EAAM2Q,EAAI,QAAQ,QAAS3V,EAAI,EAAGukB,EAAO,IAAI,MAAMvf,CAAG,EAAGhF,EAAIgF,EAAKhF,IAAOukB,EAAKvkB,CAAC,EAAI2V,EAAI3V,CAAC,EAAK,OAAOukB,CAAO,CACvL,IAAI3e,GAAa,CAAC,CAEhB,eAAgB,CAAE,EAClB,uBAAwB,CAAE,CAC5B,EAAG,CAED,gBAAiB,CACf,gBAAiB,GACjB,iBAAkB,GAClB,YAAa,EAGd,CACH,EAAG,CAED,kBAAmB,CACjB,GAAI,KACJ,cAAe,OACf,gBAAiB,CAAE,CACpB,CACH,EAAG,CAED,mBAAoB,CAClB,GAAI,MACJ,cAAe,OACf,gBAAiB,CAAE,CACpB,CACH,EAAG,CAED,mBAAoB,CAClB,GAAI,MACJ,cAAe,OACf,gBAAiB,CAAE,CACpB,CACH,EAAG,CAED,qBAAsB,CACpB,GAAI,IACJ,cAAe,OACf,gBAAiB,CAAE,CACpB,CACH,EAAG,CAED,sBAAuB,CACrB,GAAI,KACJ,cAAe,OACf,gBAAiB,CAAE,CACpB,CACH,EAAG,CAED,sBAAuB,CACrB,GAAI,IACJ,cAAe,OACf,gBAAiB,CAAE,CACpB,CACH,EAAG,CAED,qBAAsB,CACpB,GAAI,KACJ,cAAe,OACf,gBAAiB,CAAE,CACpB,EACD,uBAAwB,CACtB,GAAI,KACJ,cAAe,OACf,gBAAiB,CAAE,CACpB,EACD,uBAAwB,CACtB,GAAI,IACJ,cAAe,OACf,gBAAiB,CAAE,CACpB,EACD,sBAAuB,CACrB,GAAI,IACJ,cAAe,OACf,gBAAiB,CAAE,CACpB,EACD,yBAA0B,CACxB,GAAI,KACJ,cAAe,OACf,gBAAiB,CAAE,CACpB,EACD,wBAAyB,CACvB,GAAI,KACJ,cAAe,OACf,gBAAiB,CAAE,CACpB,EACD,eAAgB,CACd,cAAe,OACf,gBAAiB,CAAE,CACpB,CACH,EAAG,CAED,yBAA0B,CACxB,GAAI,KACJ,cAAe,OACf,gBAAiB,CAAE,CACpB,EACD,+BAAgC,CAC9B,GAAI,KACJ,cAAe,OACf,gBAAiB,CAAE,CACpB,EACD,6BAA8B,CAC5B,GAAI,MACJ,cAAe,OACf,gBAAiB,CAAE,CACpB,CACH,EAAG,CAED,kBAAmB,CACjB,GAAI,KACJ,cAAe,OACf,gBAAiB,CAAE,CACpB,CACH,EAAG,CAED,UAAW,CAAE,CACf,EAAG,CAED,mBAAoB,CAClB,GAAI,IACJ,cAAe,OACf,gBAAiB,CAAC,mBAAoB,uBAAuB,CAC9D,EACD,wBAAyB,CACvB,GAAI,IACJ,cAAe,OACf,gBAAiB,CAAE,CACpB,CACH,EAAG,CAED,wBAAyB,CACvB,GAAI,IACJ,cAAe,OACf,gBAAiB,CAAC,wBAAyB,sBAAuB,uBAAwB,oBAAoB,CAC/G,EACD,sBAAuB,CACrB,GAAI,IACJ,cAAe,OACf,gBAAiB,CAAE,EACnB,gBAAiB,GACjB,iBAAkB,GAClB,YAAa,EAId,EAED,2BAA4B,CAC1B,GAAI,KACJ,cAAe,OACf,gBAAiB,CAAC,wBAAyB,sBAAuB,2BAA4B,uBAAuB,CACtH,EACD,yBAA0B,CACxB,GAAI,KACJ,cAAe,OACf,gBAAiB,CAAE,CACpB,EACD,mBAAoB,CAClB,GAAI,MACJ,cAAe,OACf,gBAAiB,CAAE,CACpB,CACH,EAAG,CAED,wBAAyB,CACvB,cAAe,OACf,gBAAiB,CAAC,wBAAyB,sBAAuB,uBAAwB,oBAAoB,CAC/G,CACH,EAAG,CAED,yBAA0B,CACxB,GAAI,IACJ,cAAe,OAChB,EACD,0BAA2B,CACzB,GAAI,IACJ,cAAe,OAChB,EACD,sBAAuB,CACrB,GAAI,IACJ,cAAe,OAChB,EACD,mBAAoB,CAClB,GAAI,MACJ,cAAe,OAChB,CACH,EAAG,CAED,mBAAoB,CAClB,GAAI,IACJ,cAAe,QACf,gBAAiB,CAAE,EACnB,iBAAkB,EAInB,EAED,sBAAuB,CACrB,GAAI,KACJ,cAAe,QACf,gBAAiB,CAAE,CACpB,CACH,EAAG,CAED,yBAA0B,CACxB,GAAI,IACJ,cAAe,MAChB,CACH,EAAG,CAED,0BAA2B,CACzB,GAAI,IACJ,cAAe,MAChB,CACH,CAAC,EASiBghE,GAAA,WAAGhhE,GACrB,SAASqhE,GAAYC,EAAOC,EAAa,CACvC,GAAI,CAACA,GAAeA,IAAgB,OAAQ,OAAOD,EAEnD,QADI7jE,EAAO6jE,KACA1iE,GAAI,mBAAmBnB,CAAI,GACpCA,EAAOA,EAAK,QAEd,OAAOA,CACT,CAaA,SAAS0jE,GAAcG,EAAOC,EAAaC,EAAUpT,EAAQ,CAC3D,IAAI3wD,EAAO6jE,EACPC,IAAgB,SAElB9jE,EAAO6jE,EAAM,cAIf,QAFIG,EAAahkE,EAAK,gBAClBikE,EAAa,KACRtnE,EAAI,EAAGA,EAAI4F,GAAW,OAAQ5F,IACrC,GAAIqnE,KAAczhE,GAAW5F,CAAC,EAAG,CAC/BsnE,EAAatnE,EACb,KACD,CAIH,GAAIqnE,IAAe,yBAA2BhkE,EAAK,UAAY+jE,IAAa,OAAQ,CAClF,IAAIG,EAAUN,GAAY5jE,EAAK,KAAK,CAAC,EAAG8jE,CAAW,EAC/C,KAAM3iE,GAAI,gBAAgB+iE,CAAO,GAAKvT,GAAUA,EAAO,cAAa,IAAO,0BAA6BxvD,GAAI,WAAWyiE,GAAYjT,EAAO,KAAK,CAAC,EAAGmT,CAAW,CAAC,IAAM,EAAEI,EAAQ,kBAAoB,0BAA6B/iE,GAAI,WAAWyiE,GAAYM,EAAQ,KAAK,CAAC,EAAGJ,CAAW,CAAC,MAAS3iE,GAAI,gBAAgByiE,GAAYM,EAAQ,KAAK,CAAC,CAAC,CAAC,KACnVD,GAAc,EAEjB,CACD,OAAOA,CACT,CAYA,SAAST,IAAiBK,EAAOC,EAAa,CAC5C,IAAI9jE,EAAO6jE,EACPC,IAAgB,SAElB9jE,EAAO6jE,EAAM,cAEf,IAAIG,EAAahkE,EAAK,gBAClBoJ,EAAQs6D,GAAc1jE,EAAM8jE,CAAW,EAC3C,GAAI16D,IAAU,KAEZ,OAAO,KAET,IAAIjH,EAAWI,GAAW6G,CAAK,EAAE46D,CAAU,EAC3C,MAAQphE,GAAQ,gBAAgBT,EAAU,eAAe,EAAG,CAC1D,GAAIA,EAAS,gBAAkB,OAC7B,MAAO,OAET,GAAIA,EAAS,gBAAkB,QAC7B,MAAO,QAGT,MAAM,MAAM,IAAO6hE,EAAa,oCAAwC7hE,EAAS,cAAgB,IAAK,CACvG,CAGD,OAAO,IACT,CAWA,SAASwhE,IAAkBQ,EAAOC,EAAON,EAAa,CAEpD,IAAItiE,EAAIsiE,IAAgB,OAASK,EAAM,WAAY,EAAGA,EAClD1iE,EAAIqiE,IAAgB,OAASK,EAAM,WAAY,EAAGC,EAClDC,EAAc7iE,EAAE,gBAChB8iE,EAAc7iE,EAAE,gBAChB2H,EAAQs6D,GAAcliE,EAAGsiE,CAAW,EACxC,GAAI16D,IAAU,KAEZ,OAAO,KAET,IAAIjH,EAAWI,GAAW6G,CAAK,EAAEi7D,CAAW,EAC5C,MAAQzhE,GAAQ,gBAAgBT,EAAU,iBAAiB,GAAKA,EAAS,2BAA2B,MAAO,CACzG,QAASxF,EAAI,EAAGA,EAAIwF,EAAS,gBAAgB,OAAQxF,IACnD,GAAIwF,EAAS,gBAAgBxF,CAAC,IAAM2nE,EAClC,MAAO,GAGX,MAAO,EACR,CAGD,OAAO,IACT,CAWA,SAASb,IAAY39D,EAAI,CACvB,IAAIk+D,EAAa,gBAAkBl+D,EAC/Bub,EAAYd,IAA2Bhe,EAAU,EACnD+e,EACF,GAAI,CACF,IAAKD,EAAU,EAAC,EAAI,EAAEC,EAAQD,EAAU,EAAG,GAAE,MAAO,CAClD,IAAIkjD,EAAQjjD,EAAM,MAClB,GAAI0iD,KAAcO,EAChB,OAAOA,EAAMP,CAAU,EAAE,EAE5B,CACF,OAAQp6D,EAAK,CACZyX,EAAU,EAAEzX,CAAG,CACnB,QAAY,CACRyX,EAAU,EAAC,CACZ,CACD,OAAO,IACT,CC/XA,IAAI/kB,GAAyBY,GAC7B,OAAO,eAAesnE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAIpkD,IAAmB9jB,GAAuBuD,GAAA,CAAgD,EAC1FwgB,IAAgB/jB,GAAuB8E,GAAA,CAA6C,EACpFugE,IAAarlE,GAAuBuH,GAAA,CAA0C,EAC9E+9D,IAA8BtlE,GAAuBsc,GAAA,CAA2D,EAChHipD,GAAmBvlE,GAAuB8lB,GAAA,CAAgD,EAC1FqtB,IAAmBnzC,GAAuBy4B,GAAA,CAAgD,EAC1F5zB,GAAM6zB,GACN1U,GAAW2U,GACX/S,IAAWgT,EACX4sC,IAAUrW,GAAA,EACVgZ,IAAUC,IAAA,EACVC,GAAaC,GACjB,SAAS7C,IAAaC,EAAS,CAAE,IAAIC,EAA4BC,IAAyB,EAAI,OAAO,UAAgC,CAAE,IAAIC,KAAYN,GAAiB,SAAYG,CAAO,EAAG7sD,EAAQ,GAAI8sD,EAA2B,CAAE,IAAIG,KAAgBP,GAAiB,SAAY,IAAI,EAAE,YAAa1sD,EAAS,QAAQ,UAAUgtD,EAAO,UAAWC,CAAS,CAAE,MAAUjtD,EAASgtD,EAAM,MAAM,KAAM,SAAS,EAAK,SAAWP,IAA4B,SAAY,KAAMzsD,CAAM,CAAI,CAAG,CAC5d,SAAS+sD,KAA4B,CAA0E,GAApE,OAAO,QAAY,KAAe,CAAC,QAAQ,WAA6B,QAAQ,UAAU,KAAM,MAAO,GAAO,GAAI,OAAO,OAAU,WAAY,MAAO,GAAM,GAAI,CAAE,eAAQ,UAAU,QAAQ,KAAK,QAAQ,UAAU,QAAS,GAAI,UAAY,CAAE,CAAA,CAAC,EAAU,EAAO,MAAW,CAAE,MAAO,GAAU,CACzU,IAAIx+D,GAAO,iBACPia,IAAe,CAAC,SAAU,UAE9B,MAAM,EACFknD,OAA0C3iD,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAClG,IAAI0+B,EAAS1+B,EAAK,OAChBU,EAASV,EAAK,OACdq9C,EAAOr9C,EAAK,KACVg/C,KAAaO,IAAQ,eAAe,CACtC,OAAQ7gB,CACZ,CAAG,EACGlhC,KAAa0kD,IAAQ,eAAe,CACtC,OAAQxjB,EACR,OAAQh+B,CACZ,CAAG,EASD,SAASq/C,EAAgBtiE,EAAM8jE,EAAaC,EAAU,CAC/CD,IACHA,EAAc,QAEhB,IAAIG,KAAiBU,GAAW,eAAe3kE,EAAM8jE,EAAaC,CAAQ,EACtEe,KAAqBH,GAAW,eAAe3kE,EAAK,MAAO8jE,EAAaC,CAAQ,EACpF,OAAOD,IAAgB,OAASgB,IAAmB,MAAQA,GAAkBb,CAC9E,CACD,IAAIO,EAA8B,SAAUjC,EAAO,IAC7CZ,IAAW,SAAY6C,EAAgBjC,CAAK,EAChD,IAAIC,EAAST,IAAayC,CAAc,EAgCxC,SAASA,EAAetkE,EAAQkJ,EAAO9H,EAAO,CAC5C,IAAIo1B,EAQJ,MAPItW,IAAiB,SAAY,KAAMokD,CAAc,EACrD9tC,EAAQ8rC,EAAO,KAAK,IAAI,EACxB9rC,EAAM,OAASx2B,EACfw2B,EAAM,MAAQp1B,EAAQ8H,EAAQ,KAC9BstB,EAAM,MAAQp1B,GAAS8H,EAGnB,IAAKjI,GAAI,cAAcjB,CAAM,GAAK,IAAKiB,GAAI,gBAAgBjB,CAAM,EACnE,MAAM,IAAI,UAAU,iDAAiD,EAEvE,MAAQiB,GAAI,cAAcjB,CAAM,GAAKA,EAAO,OAAS,MACnD,MAAM,IAAI,MAAM,+BAA+B,EAEjD,GAAIw2B,EAAM,OAAS,IAAKv1B,GAAI,aAAau1B,EAAM,KAAK,EAElD,MAAM,IAAI,UAAU,+BAA+B,EAErD,GAAI,IAAKv1B,GAAI,QAAQu1B,EAAM,KAAK,EAC9B,MAAM,IAAI,UAAU,0BAA0B,EAEhD,OAAOA,CACR,CAGD,SAAIrW,IAAc,SAAYmkD,EAAgB,CAAC,CAC7C,IAAK,OACL,IAEA,UAAe,CACb,OAAI,KAAK,MACA,KAAK,MAAM,iBAAkB,EAAG,KAAK,MAAM,kBAAmB,EAAG,GAEjE,KAAK,OAAO,MAAQ,EAE9B,CACP,EAAO,CACD,IAAK,OACL,IAAK,UAAe,CAClB,OAAO9gE,EACR,CACP,EAAO,CACD,IAAK,mBACL,IAAK,UAAe,CAClB,MAAO,EACR,CAeP,EAAO,CACD,IAAK,WACL,MAAO,SAAkB48D,EAAMC,EAAU,CACvC,IAAIkC,EAAa,KAAK,OAAO,SAASnC,EAAMC,CAAQ,EAChDmC,EAAY,KAAK,MAAQ,KAAK,MAAM,SAASpC,EAAMC,CAAQ,EAAI,KAC/DwE,EAAY,KAAK,MAAM,SAASzE,EAAMC,CAAQ,EAC9C78D,EAAO,KAAK,OAAO,KACvB,GAAK,KAAK,MAUH,GAAI,KAAK,MAAM,mBAAoB,CAExC,IAAIhC,EAAO,KAAK,MAAM,kBAAiB,EACvC,OAAO,SAA4Boc,EAAO3U,EAAMi3D,EAAS,CACvD,IAAIlgE,EAASuiE,EAAW3kD,EAAO3U,EAAMi3D,CAAO,EACxC9+D,EAAQyjE,EAAUjnD,EAAO3U,EAAMi3D,CAAO,EAC1C,SAAI9/C,GAAS,iBAAiBpgB,EAAQwB,EAAMJ,CAAK,EAC1CA,CACnB,CACS,KAAM,OAAQH,GAAI,cAAc,KAAK,MAAM,EAE1C,OAAO,SAA4B2c,EAAO3U,EAAMi3D,EAAS,CACvD,IAAI4E,EAAcvC,EAAW3kD,EAAO3U,EAAMi3D,CAAO,EAC7C9+D,EAAQyjE,EAAUjnD,EAAO3U,EAAMi3D,CAAO,EAEtCh3D,EAAQs5D,EAAU5kD,EAAO3U,EAAM67D,CAAW,EAC9C,OAAAlnD,EAAM,IAAIpa,EAAMqc,EAAOilD,EAAa57D,EAAO9H,CAAK,CAAC,EAC1CA,CACnB,EASU,IAAI2jE,EAAmB,KAAK,OAAO,OAAO,SAAS3E,EAAMC,CAAQ,EACjE,GAAI,KAAK,OAAO,MAAM,iBAAgB,EAAI,CACxC,IAAI2E,EAAa,KAAK,OAAO,MAAM,kBAAiB,EACpD,OAAO,SAA4BpnD,EAAO3U,EAAMi3D,EAAS,CACvD,IAAIzP,EAASsU,EAAiBnnD,EAAO3U,EAAMi3D,CAAO,EAC9C4E,KAAkB1kD,GAAS,iBAAiBqwC,EAAQuU,CAAU,EAE9D97D,EAAQs5D,EAAU5kD,EAAO3U,EAAM67D,CAAW,EAC1C1jE,EAAQyjE,EAAUjnD,EAAO3U,EAAMi3D,CAAO,EAC1C,SAAI9/C,GAAS,iBAAiBqwC,EAAQuU,EAAYnlD,EAAOilD,EAAa57D,EAAO9H,CAAK,CAAC,EAC5EA,CACrB,CACA,KAAiB,CAGL,IAAI6jE,EAAkB,KAAK,OAAO,MAAM,SAAS7E,EAAMC,CAAQ,EAC/D,OAAO,SAA4BziD,EAAO3U,EAAMi3D,EAAS,CACvD,IAAIzP,EAASsU,EAAiBnnD,EAAO3U,EAAMi3D,CAAO,EAE9CgF,EAAcD,EAAgBrnD,EAAO3U,EAAMwnD,CAAM,EACjDqU,EAAczD,EAAO5Q,EAAQyU,CAAW,EAExCh8D,EAAQs5D,EAAU5kD,EAAO3U,EAAM67D,CAAW,EAC1C1jE,EAAQyjE,EAAUjnD,EAAO3U,EAAMi3D,CAAO,EAC1C,OAAArgD,EAAO4wC,EAAQyU,EAAarlD,EAAOilD,EAAa57D,EAAO9H,CAAK,CAAC,EACtDA,CACrB,CACW,MAhEc,CAEf,GAAI,IAAKH,GAAI,cAAc,KAAK,MAAM,EACpC,MAAM,IAAI,UAAU,+BAA+B,EAErD,OAAO,SAA4B2c,EAAO3U,EAAMi3D,EAAS,CACvD,IAAI9+D,EAAQyjE,EAAUjnD,EAAO3U,EAAMi3D,CAAO,EAC1C,OAAAtiD,EAAM,IAAIpa,EAAMpC,CAAK,EACdA,CACnB,CACS,CAwDF,CAMP,EAAO,CACD,IAAK,UACL,MAAO,SAAiBC,EAAU,CAChCA,EAAS,KAAK,OAAQ,SAAU,IAAI,EAChC,KAAK,OACPA,EAAS,KAAK,MAAO,QAAS,IAAI,EAEpCA,EAAS,KAAK,MAAO,QAAS,IAAI,CACnC,CAQP,EAAO,CACD,IAAK,MACL,MAAO,SAAaA,EAAU,CAC5B,IAAIrB,EAAS,KAAK,QAAQqB,EAAS,KAAK,OAAQ,SAAU,IAAI,CAAC,EAC3D6H,EAAQ,KAAK,MAAQ,KAAK,QAAQ7H,EAAS,KAAK,MAAO,QAAS,IAAI,CAAC,EAAI,KACzED,EAAQ,KAAK,QAAQC,EAAS,KAAK,MAAO,QAAS,IAAI,CAAC,EAC5D,OAAO,IAAIijE,EAAetkE,EAAQkJ,EAAO9H,CAAK,CAC/C,CAMP,EAAO,CACD,IAAK,QACL,MAAO,UAAiB,CACtB,OAAO,IAAIkjE,EAAe,KAAK,OAAQ,KAAK,MAAO,KAAK,KAAK,CAC9D,CAOP,EAAO,CACD,IAAK,YACL,MAAO,SAAmBthE,EAAS,CACjC,IAAIhD,EAAS,KAAK,OAAO,SAASgD,CAAO,EACrCkG,EAAQ,KAAK,MAAQ,KAAK,MAAM,SAASlG,CAAO,EAAI,GACpD5B,EAAQ,KAAK,MAAM,SAAS4B,CAAO,EACvC,OAAIo/D,EAAgB,KAAMp/D,GAAWA,EAAQ,YAAaA,GAAWA,EAAQ,QAAQ,IACnF5B,EAAQ,IAAMA,EAAQ,KAEjBpB,EAASkJ,EAAQ,MAAQ9H,CACjC,CAMP,EAAO,CACD,IAAK,SACL,MAAO,UAAkB,CACvB,MAAO,CACL,OAAQoC,GACR,OAAQ,KAAK,OACb,MAAO,KAAK,MACZ,MAAO,KAAK,KACtB,CACO,CAUP,EAAO,CACD,IAAK,SACL,MAMA,SAAgBR,EAAS,CACvB,IAAIhD,EAAS,KAAK,OAAO,OAAOgD,CAAO,EACnCkG,EAAQ,KAAK,MAAQ,KAAK,MAAM,OAAOlG,CAAO,EAAI,GAClD5B,EAAQ,KAAK,MAAM,OAAO4B,CAAO,EACrC,OAAIo/D,EAAgB,KAAMp/D,GAAWA,EAAQ,YAAaA,GAAWA,EAAQ,QAAQ,IACnF5B,EAAQ,iEAAmEA,EAAQ,kEAE9EpB,EAASkJ,EAAQ,uHAA8H9H,CACvJ,CAOP,EAAO,CACD,IAAK,SACL,MAAO,SAAgB4B,EAAS,CAC9B,IAAIhD,EAAS,KAAK,OAAO,MAAMgD,CAAO,EAClCkG,EAAQ,KAAK,MAAQ,KAAK,MAAM,MAAMlG,CAAO,EAAI,GACjD5B,EAAQ,KAAK,MAAM,MAAM4B,CAAO,EACpC,OAAIo/D,EAAgB,KAAMp/D,GAAWA,EAAQ,YAAaA,GAAWA,EAAQ,QAAQ,IACnF5B,EAAQ,UAAU,OAAOA,EAAO,UAAU,GAErCpB,EAASkJ,EAAQ,KAAO9H,CAChC,CACF,CAAA,EAAG,CAAC,CACH,IAAK,WACL,MAAO,SAAkBgiB,EAAM,CAC7B,OAAO,IAAIkhD,EAAelhD,EAAK,OAAQA,EAAK,MAAOA,EAAK,KAAK,CAC9D,CACF,CAAA,CAAC,EACKkhD,CACR,EAAC5E,CAAI,EACN,SAAInwB,IAAiB,SAAY+0B,EAAgB,OAAQ9gE,EAAI,EACtD8gE,CACT,EAAG,CACD,QAAS,GACT,OAAQ,EACV,CAAC,EACDA,GAAA,qBAA+BK,cC3V3BvoE,GAAyBY,GAC7B,OAAO,eAAemoE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIjlD,IAAmB9jB,GAAuBuD,GAAA,CAAgD,EAC1FwgB,IAAgB/jB,GAAuB8E,GAAA,CAA6C,EACpFugE,IAAarlE,GAAuBuH,GAAA,CAA0C,EAC9E+9D,IAA8BtlE,GAAuBsc,GAAA,CAA2D,EAChHipD,GAAmBvlE,GAAuB8lB,GAAA,CAAgD,EAC1FqtB,IAAmBnzC,GAAuBy4B,GAAA,CAAgD,EAC1F5zB,IAAM6zB,GACNtX,GAASuX,GACT/S,IAAWgT,EACf,SAAS6sC,IAAaC,EAAS,CAAE,IAAIC,EAA4BC,IAAyB,EAAI,OAAO,UAAgC,CAAE,IAAIC,KAAYN,GAAiB,SAAYG,CAAO,EAAG7sD,EAAQ,GAAI8sD,EAA2B,CAAE,IAAIG,KAAgBP,GAAiB,SAAY,IAAI,EAAE,YAAa1sD,EAAS,QAAQ,UAAUgtD,EAAO,UAAWC,CAAS,CAAE,MAAUjtD,EAASgtD,EAAM,MAAM,KAAM,SAAS,EAAK,SAAWP,IAA4B,SAAY,KAAMzsD,CAAM,CAAI,CAAG,CAC5d,SAAS+sD,KAA4B,CAA0E,GAApE,OAAO,QAAY,KAAe,CAAC,QAAQ,WAA6B,QAAQ,UAAU,KAAM,MAAO,GAAO,GAAI,OAAO,OAAU,WAAY,MAAO,GAAM,GAAI,CAAE,eAAQ,UAAU,QAAQ,KAAK,QAAQ,UAAU,QAAS,GAAI,UAAY,CAAE,CAAA,CAAC,EAAU,EAAO,MAAW,CAAE,MAAO,GAAU,CACzU,IAAIx+D,GAAO,YACPia,IAAe,CAAC,YAAa,MAAM,EACnC2nD,OAAqCpjD,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC7F,IAAIa,EAAYb,EAAK,UACnBq9C,EAAOr9C,EAAK,KACV8iD,EAAyB,SAAU9C,EAAO,IACxCZ,IAAW,SAAY0D,EAAW9C,CAAK,EAC3C,IAAIC,EAAST,IAAasD,CAAS,EAWnC,SAASA,EAAUE,EAAQ,CACzB,IAAI7uC,EAIJ,MAHItW,IAAiB,SAAY,KAAMilD,CAAS,EAChD3uC,EAAQ8rC,EAAO,KAAK,IAAI,EAEpB,CAAC,MAAM,QAAQ+C,CAAM,EAAG,MAAM,IAAI,MAAM,gBAAgB,EAC5D,OAAA7uC,EAAM,OAAS6uC,EAAO,IAAI,SAAUC,EAAO,CACzC,IAAIxlE,EAAOwlE,GAASA,EAAM,KACtBC,EAAUD,GAASA,EAAM,UAAY,OAAYA,EAAM,QAAU,GACrE,GAAI,IAAKrkE,IAAI,QAAQnB,CAAI,EAAG,MAAM,IAAI,UAAU,gCAAgC,EAChF,GAAI,OAAOylE,GAAY,UACrB,MAAM,IAAI,UAAU,sCAAsC,EAE5D,MAAO,CACL,KAAMzlE,EACN,QAASylE,CACnB,CACA,CAAO,EACM/uC,CACR,CACD,SAAIrW,IAAc,SAAYglD,EAAW,CAAC,CACxC,IAAK,OACL,IAAK,UAAe,CAClB,OAAO3hE,EACR,CACP,EAAO,CACD,IAAK,cACL,IAAK,UAAe,CAClB,MAAO,EACR,CAeP,EAAO,CACD,IAAK,WACL,MAAO,SAAkB48D,EAAMC,EAAU,CACvC,IAAImF,KAAiBhoD,GAAO,KAAK,KAAK,OAAQ,SAAU8nD,EAAO,CAC7D,MAAO,CACL,SAAUA,EAAM,KAAK,SAASlF,EAAMC,CAAQ,EAC5C,QAASiF,EAAM,OAC3B,CACA,CAAS,EACD,OAAO,SAAwB1nD,EAAO3U,EAAMi3D,EAAS,CACnD,IAAIuF,EAAU,CAAA,EACd,SAAIjoD,GAAO,SAASgoD,EAAY,SAAuBF,EAAO,CAC5D,IAAIrwD,EAASqwD,EAAM,SAAS1nD,EAAO3U,EAAMi3D,CAAO,EAC5CoF,EAAM,SACRG,EAAQ,KAAKxwD,CAAM,CAEjC,CAAW,EACM,IAAIiO,EAAUuiD,CAAO,CACtC,CACO,CAMP,EAAO,CACD,IAAK,UACL,MAAO,SAAiBpkE,EAAU,CAChC,QAAS5E,EAAI,EAAGA,EAAI,KAAK,OAAO,OAAQA,IACtC4E,EAAS,KAAK,OAAO5E,CAAC,EAAE,KAAM,UAAYA,EAAI,SAAU,IAAI,CAE/D,CAQP,EAAO,CACD,IAAK,MACL,MAAO,SAAa4E,EAAU,CAE5B,QADIgkE,EAAS,CAAA,EACJ5oE,EAAI,EAAGA,EAAI,KAAK,OAAO,OAAQA,IAAK,CAC3C,IAAI6oE,EAAQ,KAAK,OAAO7oE,CAAC,EACrBqD,EAAO,KAAK,QAAQuB,EAASikE,EAAM,KAAM,UAAY7oE,EAAI,SAAU,IAAI,CAAC,EAC5E4oE,EAAO5oE,CAAC,EAAI,CACV,KAAMqD,EACN,QAASwlE,EAAM,OAC3B,CACS,CACD,OAAO,IAAIH,EAAUE,CAAM,CAC5B,CAMP,EAAO,CACD,IAAK,QACL,MAAO,UAAiB,CACtB,IAAIA,EAAS,KAAK,OAAO,IAAI,SAAUC,EAAO,CAC5C,MAAO,CACL,KAAMA,EAAM,KACZ,QAASA,EAAM,OAC3B,CACA,CAAS,EACD,OAAO,IAAIH,EAAUE,CAAM,CAC5B,CAQP,EAAO,CACD,IAAK,YACL,MAAO,SAAmBriE,EAAS,CACjC,OAAO,KAAK,OAAO,IAAI,SAAUsE,EAAO,CACtC,OAAOA,EAAM,KAAK,SAAStE,CAAO,GAAKsE,EAAM,QAAU,GAAK,IACtE,CAAS,EAAE,KAAK;AAAA,CAAI,CACb,CAMP,EAAO,CACD,IAAK,SACL,MAAO,UAAkB,CACvB,MAAO,CACL,OAAQ9D,GACR,OAAQ,KAAK,MACvB,CACO,CAUP,EAAO,CACD,IAAK,SACL,MAOA,SAAgBR,EAAS,CACvB,OAAO,KAAK,OAAO,IAAI,SAAUsE,EAAO,CACtC,OAAOA,EAAM,KAAK,OAAOtE,CAAO,GAAKsE,EAAM,QAAU,GAAK,wCACpE,CAAS,EAAE,KAAK,4CAA4C,CACrD,CAOP,EAAO,CACD,IAAK,SACL,MAAO,SAAgBtE,EAAS,CAC9B,OAAO,KAAK,OAAO,IAAI,SAAUsE,EAAO,CACtC,OAAOA,EAAM,KAAK,MAAMtE,CAAO,GAAKsE,EAAM,QAAU,GAAK,IACnE,CAAS,EAAE,KAAK;AAAA,CAAU,CACnB,CACF,CAAA,EAAG,CAAC,CACH,IAAK,WACL,MAAO,SAAkB8b,EAAM,CAC7B,OAAO,IAAI+hD,EAAU/hD,EAAK,MAAM,CACjC,CACF,CAAA,CAAC,EACK+hD,CACR,EAACzF,CAAI,EACN,SAAInwB,IAAiB,SAAY41B,EAAW,OAAQ3hE,EAAI,EACjD2hE,CACT,EAAG,CACD,QAAS,GACT,OAAQ,EACV,CAAC,EACDA,GAAA,gBAA0BC,cChOtBhpE,GAAyBY,GAC7B,OAAO,eAAe0oE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIxlD,IAAmB9jB,GAAuBuD,GAAA,CAAgD,EAC1FwgB,IAAgB/jB,GAAuB8E,GAAA,CAA6C,EACpFugE,IAAarlE,GAAuBuH,GAAA,CAA0C,EAC9E+9D,IAA8BtlE,GAAuBsc,GAAA,CAA2D,EAChHipD,GAAmBvlE,GAAuB8lB,GAAA,CAAgD,EAC1FqtB,IAAmBnzC,GAAuBy4B,GAAA,CAAgD,EAC1F5zB,GAAM6zB,GACN9S,IAAW+S,EACX0vC,GAAazvC,GACjB,SAAS6sC,IAAaC,EAAS,CAAE,IAAIC,EAA4BC,IAAyB,EAAI,OAAO,UAAgC,CAAE,IAAIC,KAAYN,GAAiB,SAAYG,CAAO,EAAG7sD,EAAQ,GAAI8sD,EAA2B,CAAE,IAAIG,KAAgBP,GAAiB,SAAY,IAAI,EAAE,YAAa1sD,EAAS,QAAQ,UAAUgtD,EAAO,UAAWC,CAAS,CAAE,MAAUjtD,EAASgtD,EAAM,MAAM,KAAM,SAAS,EAAK,SAAWP,IAA4B,SAAY,KAAMzsD,CAAM,CAAI,CAAG,CAC5d,SAAS+sD,KAA4B,CAA0E,GAApE,OAAO,QAAY,KAAe,CAAC,QAAQ,WAA6B,QAAQ,UAAU,KAAM,MAAO,GAAO,GAAI,OAAO,OAAU,WAAY,MAAO,GAAM,GAAI,CAAE,eAAQ,UAAU,QAAQ,KAAK,QAAQ,UAAU,QAAS,GAAI,UAAY,CAAE,CAAA,CAAC,EAAU,EAAO,MAAW,CAAE,MAAO,GAAU,CACzU,IAAIx+D,GAAO,kBACPia,IAAe,CAAC,MAAM,EACtBkoD,OAA2C3jD,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACnG,IAAIq9C,EAAOr9C,EAAK,KAMhB,SAASujD,EAAcC,EAAW,CAChC,GAAI,OAAOA,GAAc,UAAY,OAAOA,GAAc,WAAa,OAAOA,GAAc,SAC1F,MAAO,CAAC,CAACA,EAEX,GAAIA,EAAW,CACb,MAAQ5kE,GAAI,aAAa4kE,CAAS,EAChC,MAAO,CAACA,EAAU,SAEpB,MAAQ5kE,GAAI,WAAW4kE,CAAS,EAC9B,MAAO,CAAC,EAAEA,EAAU,IAAMA,EAAU,IAEtC,MAAQ5kE,GAAI,QAAQ4kE,CAAS,EAC3B,MAAO,CAAC,CAACA,EAAU,KAEtB,CACD,GAAIA,GAAc,KAChB,MAAO,GAET,MAAM,IAAI,UAAU,qCAAwC5kE,GAAI,QAAQ4kE,CAAS,EAAI,GAAG,CACzF,CACD,IAAIH,EAA+B,SAAUrD,EAAO,IAC9CZ,IAAW,SAAYiE,EAAiBrD,CAAK,EACjD,IAAIC,EAAST,IAAa6D,CAAe,EAWzC,SAASA,EAAgBG,EAAWC,EAAUC,EAAW,CACvD,IAAIvvC,EAGJ,MAFItW,IAAiB,SAAY,KAAMwlD,CAAe,EACtDlvC,EAAQ8rC,EAAO,KAAK,IAAI,EACpB,IAAKrhE,GAAI,QAAQ4kE,CAAS,EAC5B,MAAM,IAAI,UAAU,oCAAoC,EAE1D,GAAI,IAAK5kE,GAAI,QAAQ6kE,CAAQ,EAC3B,MAAM,IAAI,UAAU,mCAAmC,EAEzD,GAAI,IAAK7kE,GAAI,QAAQ8kE,CAAS,EAC5B,MAAM,IAAI,UAAU,oCAAoC,EAE1D,OAAAvvC,EAAM,UAAYqvC,EAClBrvC,EAAM,SAAWsvC,EACjBtvC,EAAM,UAAYuvC,EACXvvC,CACR,CACD,SAAIrW,IAAc,SAAYulD,EAAiB,CAAC,CAC9C,IAAK,OACL,IAAK,UAAe,CAClB,OAAOliE,EACR,CACP,EAAO,CACD,IAAK,oBACL,IAAK,UAAe,CAClB,MAAO,EACR,CAeP,EAAO,CACD,IAAK,WACL,MAAO,SAAkB48D,EAAMC,EAAU,CACvC,IAAI2F,EAAgB,KAAK,UAAU,SAAS5F,EAAMC,CAAQ,EACtD4F,EAAe,KAAK,SAAS,SAAS7F,EAAMC,CAAQ,EACpD6F,EAAgB,KAAK,UAAU,SAAS9F,EAAMC,CAAQ,EAC1D,OAAO,SAA6BziD,EAAO3U,EAAMi3D,EAAS,CACxD,OAAO0F,EAAcI,EAAcpoD,EAAO3U,EAAMi3D,CAAO,CAAC,EAAI+F,EAAaroD,EAAO3U,EAAMi3D,CAAO,EAAIgG,EAActoD,EAAO3U,EAAMi3D,CAAO,CAC7I,CACO,CAMP,EAAO,CACD,IAAK,UACL,MAAO,SAAiB7+D,EAAU,CAChCA,EAAS,KAAK,UAAW,YAAa,IAAI,EAC1CA,EAAS,KAAK,SAAU,WAAY,IAAI,EACxCA,EAAS,KAAK,UAAW,YAAa,IAAI,CAC3C,CAQP,EAAO,CACD,IAAK,MACL,MAAO,SAAaA,EAAU,CAC5B,OAAO,IAAIqkE,EAAgB,KAAK,QAAQrkE,EAAS,KAAK,UAAW,YAAa,IAAI,CAAC,EAAG,KAAK,QAAQA,EAAS,KAAK,SAAU,WAAY,IAAI,CAAC,EAAG,KAAK,QAAQA,EAAS,KAAK,UAAW,YAAa,IAAI,CAAC,CAAC,CACzM,CAMP,EAAO,CACD,IAAK,QACL,MAAO,UAAiB,CACtB,OAAO,IAAIqkE,EAAgB,KAAK,UAAW,KAAK,SAAU,KAAK,SAAS,CACzE,CAOP,EAAO,CACD,IAAK,YACL,MAAO,SAAmB1iE,EAAS,CACjC,IAAI4gE,EAAc5gE,GAAWA,EAAQ,YAAcA,EAAQ,YAAc,OACrE+gE,KAAiBU,GAAW,eAAe,KAAMb,EAAa5gE,GAAWA,EAAQ,QAAQ,EAMzF6iE,EAAY,KAAK,UAAU,SAAS7iE,CAAO,EAC3CmjE,KAA0B1B,GAAW,eAAe,KAAK,UAAWb,EAAa5gE,GAAWA,EAAQ,QAAQ,GAC5G4gE,IAAgB,OAAS,KAAK,UAAU,OAAS,gBAAkBuC,IAAwB,MAAQA,GAAuBpC,KAC5H8B,EAAY,IAAMA,EAAY,KAEhC,IAAIC,EAAW,KAAK,SAAS,SAAS9iE,CAAO,EACzCojE,KAAqB3B,GAAW,eAAe,KAAK,SAAUb,EAAa5gE,GAAWA,EAAQ,QAAQ,GACtG4gE,IAAgB,OAAS,KAAK,SAAS,OAAS,gBAAkBwC,IAAmB,MAAQA,GAAkBrC,KACjH+B,EAAW,IAAMA,EAAW,KAE9B,IAAIC,EAAY,KAAK,UAAU,SAAS/iE,CAAO,EAC3CqjE,KAAsB5B,GAAW,eAAe,KAAK,UAAWb,EAAa5gE,GAAWA,EAAQ,QAAQ,EAC5G,OAAI4gE,IAAgB,OAAS,KAAK,UAAU,OAAS,gBAAkByC,IAAoB,MAAQA,GAAmBtC,KACpHgC,EAAY,IAAMA,EAAY,KAEzBF,EAAY,MAAQC,EAAW,MAAQC,CAC/C,CAMP,EAAO,CACD,IAAK,SACL,MAAO,UAAkB,CACvB,MAAO,CACL,OAAQviE,GACR,UAAW,KAAK,UAChB,SAAU,KAAK,SACf,UAAW,KAAK,SAC1B,CACO,CAeP,EAAO,CACD,IAAK,SACL,MAMA,SAAgBR,EAAS,CACvB,IAAI4gE,EAAc5gE,GAAWA,EAAQ,YAAcA,EAAQ,YAAc,OACrE+gE,KAAiBU,GAAW,eAAe,KAAMb,EAAa5gE,GAAWA,EAAQ,QAAQ,EAMzF6iE,EAAY,KAAK,UAAU,OAAO7iE,CAAO,EACzCmjE,KAA0B1B,GAAW,eAAe,KAAK,UAAWb,EAAa5gE,GAAWA,EAAQ,QAAQ,GAC5G4gE,IAAgB,OAAS,KAAK,UAAU,OAAS,gBAAkBuC,IAAwB,MAAQA,GAAuBpC,KAC5H8B,EAAY,iEAAmEA,EAAY,kEAE7F,IAAIC,EAAW,KAAK,SAAS,OAAO9iE,CAAO,EACvCojE,KAAqB3B,GAAW,eAAe,KAAK,SAAUb,EAAa5gE,GAAWA,EAAQ,QAAQ,GACtG4gE,IAAgB,OAAS,KAAK,SAAS,OAAS,gBAAkBwC,IAAmB,MAAQA,GAAkBrC,KACjH+B,EAAW,iEAAmEA,EAAW,kEAE3F,IAAIC,EAAY,KAAK,UAAU,OAAO/iE,CAAO,EACzCqjE,KAAsB5B,GAAW,eAAe,KAAK,UAAWb,EAAa5gE,GAAWA,EAAQ,QAAQ,EAC5G,OAAI4gE,IAAgB,OAAS,KAAK,UAAU,OAAS,gBAAkByC,IAAoB,MAAQA,GAAmBtC,KACpHgC,EAAY,iEAAmEA,EAAY,kEAEtFF,EAAY,iEAAmEC,EAAW,iEAAmEC,CACrK,CAOP,EAAO,CACD,IAAK,SACL,MAAO,SAAgB/iE,EAAS,CAC9B,MAAO,mBAAqB,KAAK,SAAS,MAAMA,CAAO,EAAI,4BAA8B,KAAK,UAAU,MAAMA,CAAO,EAAI,SAAW,KAAK,UAAU,MAAMA,CAAO,EAAI,2CACrK,CACF,CAAA,EAAG,CAAC,CACH,IAAK,WACL,MAAO,SAAkBogB,EAAM,CAC7B,OAAO,IAAIsiD,EAAgBtiD,EAAK,UAAWA,EAAK,SAAUA,EAAK,SAAS,CACzE,CACF,CAAA,CAAC,EACKsiD,CACR,EAAChG,CAAI,EACN,SAAInwB,IAAiB,SAAYm2B,EAAiB,OAAQliE,EAAI,EACvDkiE,CACT,EAAG,CACD,QAAS,GACT,OAAQ,EACV,CAAC,EACDA,GAAA,sBAAgCC,0DCxQhC,IAAIvpE,EAAyBY,GAC7B,OAAO,eAAespE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OACPA,GAAA,YAAGC,EACtBD,GAAA,aAAuBA,GAAsB,eAAGA,kBAAyB,OACzDA,GAAA,SAAGE,EACnB,IAAIC,EAAerqE,EAAuBuD,EAAuB,EAC7D+C,EAAUxB,GAGVwlE,EAAe,CAEjB,MAAO,IACP,MAAO,UACP,KAAM,IACN,KAAM,SACN,MAAO,UACP,MAAO,UACP,MAAO,UACP,MAAO,UACP,QAAS,IACT,QAAS,YACT,WAAY,eACZ,KAAM,IACN,KAAM,SACN,IAAK,IACL,IAAK,QACL,MAAO,UACP,MAAO,UACP,SAAU,aACV,KAAM,IACN,KAAM,SACN,MAAO,IACP,MAAO,UACP,SAAU,aACV,OAAQ,WACR,OAAQ,WACR,GAAI,IACJ,GAAI,OACJ,GAAI,IACJ,GAAI,OACJ,GAAI,OACJ,GAAI,OACJ,QAAS,IACT,QAAS,IACT,GAAI,OACJ,GAAI,OACJ,MAAO,UACP,IAAK,IACL,IAAK,QACL,OAAQ,WACR,MAAO,UACP,MAAO,UACP,SAAU,aACV,IAAK,IACL,IAAK,QACL,QAAS,YACT,QAAS,YACT,IAAK,QACL,IAAK,QACL,OAAQ,WACR,IAAK,IACL,IAAK,QACL,IAAK,QACL,IAAK,QACL,MAAO,UACP,MAAO,UAEP,KAAQ,iBACR,MAAS,kBAET,EAAG,IAEH,IAAK,UACL,IAAK,UACL,SAAU,UACV,SAAU,UACV,GAAI,UACJ,IAAK,QACL,UAAW,aACb,EACoBJ,GAAA,aAAGI,EACvB,IAAIC,EAAiB,CACnB,UAAW,SACX,WAAY,KACZ,UAAW,IACX,IAAK,IACL,OAAQ,YAER,UAAW,IACX,WAAY,IACZ,OAAQ,MAER,IAAK,QACL,SAAU,SACV,OAAQ,SAER,YAAa,UAEb,UAAW,KAEX,IAAK,QACL,IAAK,IACL,SAAU,IACV,GAAI,eACJ,UAAW,KACX,gBAAiB,KACjB,cAAe,MACf,MAAO,IACP,QAAS,QACT,QAAS,IACT,OAAQ,IACR,UAAW,QACX,SAAU,QACV,OAAQ,MACR,OAAQ,iBACR,MAAO,IACP,IAAK,UACL,IAAK,WACL,GAAI,OACN,EACsBL,GAAA,eAAGK,EACzB,IAAIC,EAAiB,CAEnB,IAAK,CACH,EAAG,2BACJ,EACD,IAAK,CACH,EAAG,oBAAoB,OAAOD,EAAe,IAAK,oBAAoB,CACvE,EACD,KAAM,CACJ,EAAG,uBACJ,EACD,KAAM,CACJ,EAAG,uCACJ,EACD,KAAM,CACJ,EAAG,6BACJ,EACD,OAAQ,CACN,EAAG,gCACJ,EACD,UAAW,CACT,EAAG,oBAAoB,OAAOA,EAAe,UAAW,oBAAoB,CAC7E,EACD,YAAa,CACX,EAAG,oBAAoB,OAAOA,EAAe,YAAa,oBAAoB,CAC/E,EACD,OAAQ,CACN,EAAG,oBAAoB,OAAOA,EAAe,OAAQ,oBAAoB,CAC1E,EACD,IAAK,CACH,EAAG,gCACJ,EACD,MAAO,WAAW,OAAOA,EAAe,IAAK,wBAAwB,EACrE,IAAK,CACH,EAAG,4CACJ,EACD,MAAO,CACL,EAAG,yCACJ,EACD,IAAK,8BACL,MAAO,gCACP,IAAK,CACH,EAAG,gCACH,EAAG,6CACJ,EACD,MAAO,CACL,EAAG,qCACJ,EACD,MAAO,CACL,EAAG,kCACH,EAAG,+CACJ,EACD,KAAM,qCACN,IAAK,CACH,EAAG,oBAAoB,OAAOA,EAAe,IAAK,oBAAoB,CACvE,EACD,SAAU,CACR,EAAG,oBAAoB,OAAOA,EAAe,SAAU,oBAAoB,CAC5E,EACD,KAAM,CACJ,EAAG,gCACH,EAAG,MACJ,EAED,QAAS,CACP,EAAG,gCACJ,EACD,SAAU,CACR,EAAG,uCACJ,EACD,IAAK,CACH,EAAG,4BAA4B,OAAOA,EAAe,IAAK,cAAc,CACzE,EACD,MAAO,CACL,EAAG,yCACH,EAAG,MACJ,EAED,KAAM,CACJ,EAAG,4CACJ,EACD,KAAM,CACJ,EAAG,oBACJ,EACD,OAAQ,CACN,EAAG,6BACJ,EACD,SAAU,CACR,EAAG,oBAAoB,OAAOA,EAAe,SAAU,oBAAoB,CAC5E,EACD,WAAY,CACV,EAAG,GAAG,OAAOA,EAAe,WAAY,2BAA2B,CACpE,EACD,UAAW,CACT,EAAG,GAAG,OAAOA,EAAe,UAAW,2BAA2B,CACnE,EAED,OAAQ,CACN,EAAG,oBAAoB,OAAOA,EAAe,OAAQ,oBAAoB,CAC1E,EACD,OAAQ,CACN,EAAGA,EAAe,OAAS,2BAC5B,EACD,MAAO,CACL,EAAG,oBAAoB,OAAOA,EAAe,MAAO,oBAAoB,CACzE,EACD,OAAQ,CACN,EAAG,oBAAoB,OAAOA,EAAe,OAAQ,oBAAoB,CAC1E,EACD,UAAW,CACT,EAAG,oBAAoB,OAAOA,EAAe,UAAW,oBAAoB,CAC7E,EACD,gBAAiB,CACf,EAAG,oBAAoB,OAAOA,EAAe,gBAAiB,oBAAoB,CACnF,EACD,cAAe,CACb,EAAG,oBAAoB,OAAOA,EAAe,cAAe,oBAAoB,CACjF,EAED,YAAa,CACX,EAAG,0BACJ,EACD,QAAS,CACP,EAAG,0BACJ,EACD,WAAY,CACV,EAAG,mCACJ,EAED,IAAK,CACH,EAAG,gCACJ,EACD,KAAM,CACJ,EAAG,6BACJ,EACD,GAAI,CACF,EAAG,6CACJ,EACD,GAAI,CACF,EAAG,6CACJ,EAED,IAAK,CACH,EAAG,oBAAoB,OAAOA,EAAe,IAAK,oBAAoB,CACvE,EACD,IAAK,CACH,EAAGA,EAAe,IAAM,2BACzB,EACD,GAAI,CACF,EAAG,oBAAoB,OAAOA,EAAe,GAAI,oBAAoB,CACtE,EACD,IAAK,CACH,EAAG,oBAAoB,OAAOA,EAAe,IAAK,oBAAoB,CACvE,EAED,MAAO,CACL,EAAG,2DACJ,EACD,WAAY,CACV,EAAG,4BAA4B,OAAOA,EAAe,UAAU,CAChE,EACD,IAAK,CACH,EAAG,gCACJ,EACD,IAAK,CACH,EAAG,2CACJ,EACD,KAAM,CACJ,EAAG,gCACJ,EACD,IAAK,CACH,EAAG,gCACJ,EACD,KAAM,CACJ,EAAG,+BACJ,EACD,MAAO,CACL,EAAG,eAAe,OAAOA,EAAe,IAAK,gBAAgB,CAC9D,EACD,MAAO,CACL,EAAG,uCACJ,EACD,UAAW,CACT,EAAG,4BAA4B,OAAOA,EAAe,SAAS,CAC/D,EAED,aAAc,CACZ,EAAG,iCACJ,EACD,oBAAqB,CACnB,EAAG,8DACJ,EACD,UAAW,CACT,EAAG,4BAA4B,OAAOA,EAAe,SAAS,CAC/D,EACD,MAAO,CACL,EAAG,kCACJ,EACD,OAAQ,CACN,EAAG,sCACJ,EAED,MAAO,CACL,EAAG,oBAAoB,OAAOA,EAAe,MAAO,oBAAoB,CACzE,EACD,OAAQ,CACN,EAAG,oBAAoB,OAAOA,EAAe,OAAQ,oBAAoB,CAC1E,EACD,SAAU,CACR,EAAG,oBAAoB,OAAOA,EAAe,SAAU,oBAAoB,CAC5E,EACD,QAAS,CACP,EAAG,oBAAoB,OAAOA,EAAe,QAAS,oBAAoB,CAC3E,EACD,UAAW,CACT,EAAG,oBAAoB,OAAOA,EAAe,UAAW,oBAAoB,CAC7E,EACD,QAAS,CACP,EAAG,oBAAoB,OAAOA,EAAe,QAAS,oBAAoB,CAC3E,EAED,IAAK,CACH,EAAG,8BACJ,EAED,IAAK,8BACL,IAAK,8BACL,SAAU,sCAEV,KAAM,CACJ,EAAG,qCACJ,EACD,MAAO,CACL,EAAG,sCACJ,EACD,KAAM,CACJ,EAAG,qCACJ,EACD,MAAO,CACL,EAAG,sCACJ,EACD,KAAM,CACJ,EAAG,qCACJ,EACD,MAAO,CACL,EAAG,8CACJ,EACD,KAAM,CACJ,EAAG,qCACJ,EACD,MAAO,CACL,EAAG,8CACJ,EACD,KAAM,CACJ,EAAG,qCACJ,EACD,MAAO,CACL,EAAG,sCACJ,EACD,KAAM,CACJ,EAAG,qCACJ,EACD,MAAO,CACL,EAAG,uCACJ,EACD,MAAO,CACL,EAAG,sCACJ,EACD,IAAK,CACH,EAAG,gCACJ,EACD,KAAM,CACJ,EAAG,iCACJ,EACD,IAAK,CACH,EAAG,gCACJ,EACD,KAAM,CACJ,EAAG,iCACJ,EACD,IAAK,CACH,EAAG,gCACJ,EACD,KAAM,CACJ,EAAG,yCACJ,EACD,IAAK,CACH,EAAG,gCACJ,EACD,KAAM,CACJ,EAAG,yCACJ,EACD,IAAK,CACH,EAAG,gCACJ,EACD,KAAM,CACJ,EAAG,iCACJ,EACD,IAAK,CACH,EAAG,gCACJ,EACD,KAAM,CACJ,EAAG,iCACJ,EAED,GAAI,CACF,EAAG,oBAAoB,OAAOA,EAAe,GAAI,oBAAoB,CACtE,EAED,QAAS,SAAiB7mE,EAAMkD,EAAS,CAEvC,OAAOlD,EAAK,KAAK,CAAC,EAAE,MAAK,CAC1B,EAED,OAAQ,CACN,EAAG,IACH,EAAG,4BACH,EAAG,oDACJ,EACD,OAAQ,CACN,EAAG,eACH,EAAG,2CACJ,EACD,UAAW,CACT,EAAG,IACH,EAAG,2BACJ,EACD,QAAS,CACP,EAAG,IACH,EAAG,4BACH,EAAG,oCAAoC,OAAO4mE,EAAa,EAAG,yCAAyC,CACxG,EACD,OAAQ,CACN,EAAG,iCACH,EAAG,4BACH,EAAG,2BACJ,EACD,OAAQ,CACN,EAAG,iCACH,EAAG,2BACJ,EACD,KAAM,CACJ,EAAG,4BACH,EAAG,oDACJ,CACH,EACsBJ,GAAA,eAAGM,EACzB,IAAIC,EAAkB,0CACCP,GAAA,gBAAGO,EAC1B,IAAIC,EAAa,CACf,IAAK,SACP,EACA,SAASP,EAAYnuD,EAAQ,CAC3B,SAAWquD,EAAa,SAAYruD,EAAQ,CAC1C,mBAAoB,EACxB,CAAG,CACF,CAID,SAASouD,EAAShjE,EAAMjE,EAAQ,CAE9B,OADAA,EAAS,OAAOA,EAAW,IAAc,GAAQA,EAC7CA,KACMmD,EAAQ,gBAAgBokE,EAAYtjE,CAAI,EACvCsjE,EAAWtjE,CAAI,EAEjB,YAAc+iE,EAAY/iE,CAAI,EAAI,OAEnCd,EAAQ,gBAAgBgkE,EAAcljE,CAAI,EACzCkjE,EAAaljE,CAAI,EAEnB+iE,EAAY/iE,CAAI,CACzB,WChfA,IAAIpH,GAAyBY,GAC7B,OAAO,eAAe+pE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAI7mD,IAAmB9jB,GAAuBuD,GAAA,CAAgD,EAC1FwgB,IAAgB/jB,GAAuB8E,GAAA,CAA6C,EACpFugE,IAAarlE,GAAuBuH,GAAA,CAA0C,EAC9E+9D,IAA8BtlE,GAAuBsc,GAAA,CAA2D,EAChHipD,GAAmBvlE,GAAuB8lB,GAAA,CAAgD,EAC1FqtB,IAAmBnzC,GAAuBy4B,GAAA,CAAgD,EAC1Fna,IAAUoa,GACV7zB,GAAM8zB,GACNiyC,IAAShyC,GAAA,EACThT,IAAWupC,EACf,SAASsW,IAAaC,EAAS,CAAE,IAAIC,EAA4BC,IAAyB,EAAI,OAAO,UAAgC,CAAE,IAAIC,KAAYN,GAAiB,SAAYG,CAAO,EAAG7sD,EAAQ,GAAI8sD,EAA2B,CAAE,IAAIG,KAAgBP,GAAiB,SAAY,IAAI,EAAE,YAAa1sD,EAAS,QAAQ,UAAUgtD,EAAO,UAAWC,CAAS,CAAE,MAAUjtD,EAASgtD,EAAM,MAAM,KAAM,SAAS,EAAK,SAAWP,IAA4B,SAAY,KAAMzsD,CAAM,CAAI,CAAG,CAC5d,SAAS+sD,KAA4B,CAA0E,GAApE,OAAO,QAAY,KAAe,CAAC,QAAQ,WAA6B,QAAQ,UAAU,KAAM,MAAO,GAAO,GAAI,OAAO,OAAU,WAAY,MAAO,GAAM,GAAI,CAAE,eAAQ,UAAU,QAAQ,KAAK,QAAQ,UAAU,QAAS,GAAI,UAAY,CAAE,CAAA,CAAC,EAAU,EAAO,MAAW,CAAE,MAAO,GAAU,CACzU,IAAIx+D,GAAO,eACPia,IAAe,CAAC,MAAM,EACtBwpD,OAAwCjlD,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAChG,IAAIq9C,EAAOr9C,EAAK,KACZ0kD,EAA4B,SAAU1E,EAAO,IAC3CZ,IAAW,SAAYsF,EAAc1E,CAAK,EAC9C,IAAIC,EAAST,IAAakF,CAAY,EAatC,SAASA,EAAa3lE,EAAO,CAC3B,IAAIo1B,EACJ,SAAItW,IAAiB,SAAY,KAAM6mD,CAAY,EACnDvwC,EAAQ8rC,EAAO,KAAK,IAAI,EACxB9rC,EAAM,MAAQp1B,EACPo1B,CACR,CACD,SAAIrW,IAAc,SAAY4mD,EAAc,CAAC,CAC3C,IAAK,OACL,IAAK,UAAe,CAClB,OAAOvjE,EACR,CACP,EAAO,CACD,IAAK,iBACL,IAAK,UAAe,CAClB,MAAO,EACR,CAeP,EAAO,CACD,IAAK,WACL,MAAO,SAAkB48D,EAAMC,EAAU,CACvC,IAAIj/D,EAAQ,KAAK,MACjB,OAAO,UAA4B,CACjC,OAAOA,CACjB,CACO,CAMP,EAAO,CACD,IAAK,UACL,MAAO,SAAiBC,EAAU,CAEjC,CAQP,EAAO,CACD,IAAK,MACL,MAAO,SAAaA,EAAU,CAC5B,OAAO,KAAK,OACb,CAMP,EAAO,CACD,IAAK,QACL,MAAO,UAAiB,CACtB,OAAO,IAAI0lE,EAAa,KAAK,KAAK,CACnC,CAOP,EAAO,CACD,IAAK,YACL,MAAO,SAAmB/jE,EAAS,CACjC,SAAW0X,IAAQ,QAAQ,KAAK,MAAO1X,CAAO,CAC/C,CAOP,EAAO,CACD,IAAK,SACL,MAAO,SAAgBA,EAAS,CAC9B,IAAI5B,EAAQ,KAAK,UAAU4B,CAAO,EAClC,UAAY/B,GAAI,QAAQ,KAAK,KAAK,EAAC,CACjC,IAAK,SACL,IAAK,YACL,IAAK,WACH,MAAO,6BAA+BG,EAAQ,UAChD,IAAK,SACH,MAAO,6BAA+BA,EAAQ,UAChD,IAAK,UACH,MAAO,8BAAgCA,EAAQ,UACjD,IAAK,OACH,MAAO,kCAAoCA,EAAQ,UACrD,IAAK,YACH,MAAO,gCAAkCA,EAAQ,UACnD,QACE,MAAO,6BAA+BA,EAAQ,SACjD,CACF,CAMP,EAAO,CACD,IAAK,SACL,MAAO,UAAkB,CACvB,MAAO,CACL,OAAQoC,GACR,MAAO,KAAK,KACtB,CACO,CASP,EAAO,CACD,IAAK,SACL,MAMA,SAAgBR,EAAS,CACvB,IAAI5B,EAAQ,KAAK,UAAU4B,CAAO,EAClC,UAAY/B,GAAI,QAAQ,KAAK,KAAK,EAAC,CACjC,IAAK,SACH,MAAO,eAAkB+lE,IAAO,aAAa5lE,CAAK,EAAI,IACxD,IAAK,SACL,IAAK,YACH,CACE,GAAI,CAAC,SAAS,KAAK,KAAK,EACtB,OAAO,KAAK,MAAM,QAAS,EAAG,EAAI,WAAa,UAEjD,IAAI8H,EAAQ9H,EAAM,YAAa,EAAC,QAAQ,GAAG,EAC3C,GAAI8H,IAAU,GACZ,OAAO9H,EAAM,UAAU,EAAG8H,CAAK,EAAI,aAAe9H,EAAM,UAAU8H,EAAQ,CAAC,EAAI,GAElF,CACD,OAAO9H,EACT,IAAK,WACH,OAAO,KAAK,MAAM,UACpB,QACE,OAAOA,CACV,CACF,CACF,CAAA,EAAG,CAAC,CACH,IAAK,WACL,MAAO,SAAkBgiB,EAAM,CAC7B,OAAO,IAAI2jD,EAAa3jD,EAAK,KAAK,CACnC,CACF,CAAA,CAAC,EACK2jD,CACR,EAACrH,CAAI,EACN,SAAInwB,IAAiB,SAAYw3B,EAAc,OAAQvjE,EAAI,EACpDujE,CACT,EAAG,CACD,QAAS,GACT,OAAQ,EACV,CAAC,EACDA,GAAA,mBAA6BE,cCnNzB7qE,GAAyBY,GAC7B,OAAO,eAAekqE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmCA,GAAA,6BAAG,OACvC,IAAIhnD,IAAmB9jB,GAAuBuD,GAAA,CAAgD,EAC1FwgB,IAAgB/jB,GAAuB8E,GAAA,CAA6C,EACpFugE,IAAarlE,GAAuBuH,GAAA,CAA0C,EAC9E+9D,IAA8BtlE,GAAuBsc,GAAA,CAA2D,EAChHipD,GAAmBvlE,GAAuB8lB,GAAA,CAAgD,EAC1FqtB,IAAmBnzC,GAAuBy4B,GAAA,CAAgD,EAC1F5zB,IAAM6zB,GACN6qC,IAAY5qC,GAAA,EACZra,GAAUsa,GACVxX,GAAS+tC,GACTyb,IAASxC,GAAA,EACTC,GAAaC,GACb1iD,IAAWmlD,EACf,SAAS9mD,IAA2BtjB,EAAGujB,EAAgB,CAAE,IAAIC,EAAK,OAAO,OAAW,KAAexjB,EAAE,OAAO,QAAQ,GAAKA,EAAE,YAAY,EAAG,GAAI,CAACwjB,EAAI,CAAE,GAAI,MAAM,QAAQxjB,CAAC,IAAMwjB,EAAKC,IAA4BzjB,CAAC,IAAMujB,GAAkBvjB,GAAK,OAAOA,EAAE,QAAW,SAAU,CAAMwjB,IAAIxjB,EAAIwjB,GAAI,IAAI9jB,EAAI,EAAOgkB,EAAI,UAAa,GAAI,MAAO,CAAE,EAAGA,EAAG,EAAG,UAAa,CAAE,OAAIhkB,GAAKM,EAAE,OAAe,CAAE,KAAM,EAAI,EAAW,CAAE,KAAM,GAAO,MAAOA,EAAEN,GAAG,EAAI,EAAI,EAAG,SAAWikB,EAAI,CAAE,MAAMA,CAAG,EAAI,EAAGD,CAAG,CAAG,CAAC,MAAM,IAAI,UAAU;AAAA,mFAAuI,CAAI,CAAC,IAAIE,EAAmB,GAAMC,EAAS,GAAOlX,EAAK,MAAO,CAAE,EAAG,UAAa,CAAE6W,EAAKA,EAAG,KAAKxjB,CAAC,CAAE,EAAI,EAAG,UAAa,CAAE,IAAI8jB,EAAON,EAAG,KAAM,EAAE,OAAAI,EAAmBE,EAAK,KAAaA,CAAO,EAAE,EAAG,SAAWC,EAAK,CAAEF,EAAS,GAAMlX,EAAMoX,CAAM,EAAE,EAAG,UAAa,CAAE,GAAI,CAAM,CAACH,GAAoBJ,EAAG,QAAa,MAAMA,EAAG,OAAS,CAAG,QAAW,CAAE,GAAIK,EAAQ,MAAMlX,CAAI,CAAI,CAAA,CAAK,CAC5+B,SAAS8W,IAA4BzjB,EAAGwe,EAAQ,CAAE,GAAKxe,EAAW,IAAI,OAAOA,GAAM,SAAU,OAAOgkB,GAAkBhkB,EAAGwe,CAAM,EAAG,IAAI,EAAI,OAAO,UAAU,SAAS,KAAKxe,CAAC,EAAE,MAAM,EAAG,EAAE,EAAgE,GAAzD,IAAM,UAAYA,EAAE,cAAa,EAAIA,EAAE,YAAY,MAAU,IAAM,OAAS,IAAM,MAAO,OAAO,MAAM,KAAKA,CAAC,EAAG,GAAI,IAAM,aAAe,2CAA2C,KAAK,CAAC,EAAG,OAAOgkB,GAAkBhkB,EAAGwe,CAAM,EAAI,CACha,SAASwF,GAAkB3O,EAAK3Q,EAAK,EAAMA,GAAO,MAAQA,EAAM2Q,EAAI,UAAQ3Q,EAAM2Q,EAAI,QAAQ,QAAS3V,EAAI,EAAGukB,EAAO,IAAI,MAAMvf,CAAG,EAAGhF,EAAIgF,EAAKhF,IAAOukB,EAAKvkB,CAAC,EAAI2V,EAAI3V,CAAC,EAAK,OAAOukB,CAAO,CACvL,SAAS6gD,IAAaC,EAAS,CAAE,IAAIC,EAA4BC,IAAyB,EAAI,OAAO,UAAgC,CAAE,IAAIC,KAAYN,GAAiB,SAAYG,CAAO,EAAG7sD,EAAQ,GAAI8sD,EAA2B,CAAE,IAAIG,KAAgBP,GAAiB,SAAY,IAAI,EAAE,YAAa1sD,EAAS,QAAQ,UAAUgtD,EAAO,UAAWC,CAAS,CAAE,MAAUjtD,EAASgtD,EAAM,MAAM,KAAM,SAAS,EAAK,SAAWP,IAA4B,SAAY,KAAMzsD,CAAM,CAAI,CAAG,CAC5d,SAAS+sD,KAA4B,CAA0E,GAApE,OAAO,QAAY,KAAe,CAAC,QAAQ,WAA6B,QAAQ,UAAU,KAAM,MAAO,GAAO,GAAI,OAAO,OAAU,WAAY,MAAO,GAAM,GAAI,CAAE,eAAQ,UAAU,QAAQ,KAAK,QAAQ,UAAU,QAAS,GAAI,UAAY,CAAE,CAAA,CAAC,EAAU,EAAO,MAAW,CAAE,MAAO,GAAU,CACzU,IAAIx+D,GAAO,yBACPia,IAAe,CAAC,QAAS,MAAM,EAC/B2pD,OAAkDplD,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC1G,IAAI3d,EAAQ2d,EAAK,MACfq9C,EAAOr9C,EAAK,KAQd,SAAS+/C,EAAgBtiE,EAAM8jE,EAAaC,EAAU,CACpD,IAAIE,KAAiBU,GAAW,eAAe3kE,EAAM8jE,EAAaC,CAAQ,EACtEe,KAAqBH,GAAW,eAAe3kE,EAAK,KAAM8jE,EAAaC,CAAQ,EACnF,OAAOD,IAAgB,OAASgB,IAAmB,MAAQA,GAAkBb,CAC9E,CACD,IAAImD,EAAsC,SAAU7E,EAAO,IACrDZ,IAAW,SAAYyF,EAAwB7E,CAAK,EACxD,IAAIC,EAAST,IAAaqF,CAAsB,EAahD,SAASA,EAAuB1jE,EAAMwC,EAAQi6D,EAAM,CAClD,IAAIzpC,EAIJ,MAHItW,IAAiB,SAAY,KAAMgnD,CAAsB,EAC7D1wC,EAAQ8rC,EAAO,KAAK,IAAI,EAEpB,OAAO9+D,GAAS,SAClB,MAAM,IAAI,UAAU,sCAAsC,EAE5D,GAAI,CAAC,MAAM,QAAQwC,CAAM,EACvB,MAAM,IAAI,UAAU,qEAAqE,EAE3F,GAAI,IAAK/E,IAAI,QAAQg/D,CAAI,EACvB,MAAM,IAAI,UAAU,oCAAoC,EAE1D,GAAIN,IAAU,SAAS,IAAIn8D,CAAI,EAC7B,MAAM,IAAI,MAAM,2BAA6BA,EAAO,yBAAyB,EAE/E,IAAI6jE,EAAa,IAAI,IACjBlmD,EAAYd,IAA2Bra,CAAM,EAC/Cob,EACF,GAAI,CACF,IAAKD,EAAU,EAAC,EAAI,EAAEC,EAAQD,EAAU,EAAG,GAAE,MAAO,CAClD,IAAI7Z,EAAQ8Z,EAAM,MACdxX,EAAQ,OAAOtC,GAAU,SAAWA,EAAQA,EAAM,KACtD,GAAI+/D,EAAW,IAAIz9D,CAAK,EACtB,MAAM,IAAI,MAAM,6BAA8B,OAAOA,EAAO,GAAI,CAAC,EAEjEy9D,EAAW,IAAIz9D,CAAK,CAEvB,CACF,OAAQF,EAAK,CACZyX,EAAU,EAAEzX,CAAG,CACvB,QAAgB,CACRyX,EAAU,EAAC,CACZ,CACD,OAAAqV,EAAM,KAAOhzB,EACbgzB,EAAM,OAASxwB,EAAO,IAAI,SAAUsB,EAAO,CACzC,OAAOA,GAASA,EAAM,MAAQA,CACtC,CAAO,EACDkvB,EAAM,MAAQxwB,EAAO,IAAI,SAAUsB,EAAO,CACxC,OAAOA,GAASA,EAAM,MAAQ,KACtC,CAAO,EACDkvB,EAAM,KAAOypC,EACNzpC,CACR,CACD,SAAIrW,IAAc,SAAY+mD,EAAwB,CAAC,CACrD,IAAK,OACL,IAAK,UAAe,CAClB,OAAO1jE,EACR,CACP,EAAO,CACD,IAAK,2BACL,IAAK,UAAe,CAClB,MAAO,EACR,CAeP,EAAO,CACD,IAAK,WACL,MAAO,SAAkB48D,EAAMC,EAAU,CACvC,IAAIiH,EAAgB,OAAO,OAAOjH,CAAQ,KACtC7iD,GAAO,SAAS,KAAK,OAAQ,SAAUlW,EAAO,CAChDggE,EAAchgE,CAAK,EAAI,EACjC,CAAS,EAGD,IAAIigE,EAAW,KAAK,KAAK,SAASnH,EAAMkH,CAAa,EACjD9jE,EAAO,KAAK,KACZwC,EAAS,KAAK,OACdH,KAAgB2X,GAAO,MAAM,KAAK,MAAO,GAAG,EAC5CgqD,EAAShkE,EAAO,OAAUga,GAAO,MAAM,KAAK,OAAQ,IAAI,EAAI,IAChE,OAAO,SAAoCI,EAAO3U,EAAMi3D,EAAS,CAC/D,IAAI52D,EAAa,CAAA,EACjBA,EAAWzD,CAAS,EAAI,UAAY,CAElC,QADI4hE,EAAY,OAAO,OAAOx+D,CAAI,EACzBxM,EAAI,EAAGA,EAAIuJ,EAAO,OAAQvJ,IACjCgrE,EAAUzhE,EAAOvJ,CAAC,CAAC,EAAI,UAAUA,CAAC,EAEpC,OAAO8qE,EAAS3pD,EAAO6pD,EAAWvH,CAAO,CACrD,EACU,IAAIt6D,EAAKlB,EAAMlB,EAAM8F,CAAU,EAC/B,OAAA1D,EAAG,OAAS4hE,EACZ5pD,EAAM,IAAIpa,EAAMoC,CAAE,EACXA,CACjB,CACO,CAMP,EAAO,CACD,IAAK,UACL,MAAO,SAAiBvE,EAAU,CAChCA,EAAS,KAAK,KAAM,OAAQ,IAAI,CACjC,CASP,EAAO,CACD,IAAK,MACL,MAAO,SAAaA,EAAU,CAC5B,IAAI4+D,EAAO,KAAK,QAAQ5+D,EAAS,KAAK,KAAM,OAAQ,IAAI,CAAC,EACzD,OAAO,IAAI6lE,EAAuB,KAAK,KAAM,KAAK,OAAO,MAAM,CAAC,EAAGjH,CAAI,CACxE,CAMP,EAAO,CACD,IAAK,QACL,MAAO,UAAiB,CACtB,OAAO,IAAIiH,EAAuB,KAAK,KAAM,KAAK,OAAO,MAAM,CAAC,EAAG,KAAK,IAAI,CAC7E,CAOP,EAAO,CACD,IAAK,YACL,MAAO,SAAmBlkE,EAAS,CACjC,IAAI4gE,EAAc5gE,GAAWA,EAAQ,YAAcA,EAAQ,YAAc,OACrEi9D,EAAO,KAAK,KAAK,SAASj9D,CAAO,EACrC,OAAIo/D,EAAgB,KAAMwB,EAAa5gE,GAAWA,EAAQ,QAAQ,IAChEi9D,EAAO,IAAMA,EAAO,KAEf,KAAK,KAAO,IAAM,KAAK,OAAO,KAAK,IAAI,EAAI,OAASA,CAC5D,CAMP,EAAO,CACD,IAAK,SACL,MAAO,UAAkB,CACvB,IAAIj7D,EAAQ,KAAK,MACjB,MAAO,CACL,OAAQxB,GACR,KAAM,KAAK,KACX,OAAQ,KAAK,OAAO,IAAI,SAAU8D,EAAO4B,EAAO,CAC9C,MAAO,CACL,KAAM5B,EACN,KAAMtC,EAAMkE,CAAK,CAC/B,CACA,CAAW,EACD,KAAM,KAAK,IACrB,CACO,CAaP,EAAO,CACD,IAAK,SACL,MAMA,SAAgBlG,EAAS,CAGvB,QAFI4gE,EAAc5gE,GAAWA,EAAQ,YAAcA,EAAQ,YAAc,OACrEgD,EAAS,CAAA,EACJvJ,EAAI,EAAGA,EAAI,KAAK,OAAO,OAAQA,IACtCuJ,EAAO,KAAK,+CAAkD0U,GAAQ,QAAQ,KAAK,OAAOje,CAAC,CAAC,EAAI,SAAS,EAE3G,IAAIwjE,EAAO,KAAK,KAAK,OAAOj9D,CAAO,EACnC,OAAIo/D,EAAgB,KAAMwB,EAAa5gE,GAAWA,EAAQ,QAAQ,IAChEi9D,EAAO,iEAAmEA,EAAO,kEAE5E,kCAAqCvlD,GAAQ,QAAQ,KAAK,IAAI,EAAI,wEAA+E1U,EAAO,KAAK,uCAAuC,EAAI,qLAAiMi6D,CACjZ,CAOP,EAAO,CACD,IAAK,SACL,MAAO,SAAgBj9D,EAAS,CAC9B,IAAI4gE,EAAc5gE,GAAWA,EAAQ,YAAcA,EAAQ,YAAc,OACrEi9D,EAAO,KAAK,KAAK,MAAMj9D,CAAO,EAClC,OAAIo/D,EAAgB,KAAMwB,EAAa5gE,GAAWA,EAAQ,QAAQ,IAChEi9D,EAAO,UAAU,OAAOA,EAAM,UAAU,GAEnC,YAAc,KAAK,KAAO,WAAa,KAAK,OAAO,IAAI+G,IAAO,QAAQ,EAAE,KAAK,GAAG,EAAI,aAAe/G,CAC3G,CACF,CAAA,EAAG,CAAC,CACH,IAAK,WACL,MAAO,SAAkB78C,EAAM,CAC7B,OAAO,IAAI8jD,EAAuB9jD,EAAK,KAAMA,EAAK,OAAQA,EAAK,IAAI,CACpE,CACF,CAAA,CAAC,EACK8jD,CACR,EAACxH,CAAI,EACN,SAAInwB,IAAiB,SAAY23B,EAAwB,OAAQ1jE,EAAI,EAC9D0jE,CACT,EAAG,CACD,QAAS,GACT,OAAQ,EACV,CAAC,EACDA,GAAA,6BAAuCE,cC9RnChrE,GAAyBY,GAC7B,OAAO,eAAe0qE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIl6B,IAAsBpxC,GAAuBuD,GAAA,CAAmD,EAChGugB,IAAmB9jB,GAAuB8E,GAAA,CAAgD,EAC1Fif,IAAgB/jB,GAAuBuH,GAAA,CAA6C,EACpF89D,IAAarlE,GAAuBsc,GAAA,CAA0C,EAC9EgpD,IAA8BtlE,GAAuB8lB,GAAA,CAA2D,EAChHy/C,GAAmBvlE,GAAuBy4B,GAAA,CAAgD,EAC1F0a,IAAmBnzC,GAAuB04B,GAAA,CAAgD,EAC1FtX,GAASuX,GACT3U,IAAW4U,GACXhT,IAAWupC,EACXtqD,GAAMujE,GACN9pD,IAAUgqD,GACd,SAAS7C,IAAaC,EAAS,CAAE,IAAIC,EAA4BC,IAAyB,EAAI,OAAO,UAAgC,CAAE,IAAIC,KAAYN,GAAiB,SAAYG,CAAO,EAAG7sD,EAAQ,GAAI8sD,EAA2B,CAAE,IAAIG,KAAgBP,GAAiB,SAAY,IAAI,EAAE,YAAa1sD,EAAS,QAAQ,UAAUgtD,EAAO,UAAWC,CAAS,CAAE,MAAUjtD,EAASgtD,EAAM,MAAM,KAAM,SAAS,EAAK,SAAWP,IAA4B,SAAY,KAAMzsD,CAAM,CAAI,CAAG,CAC5d,SAAS+sD,KAA4B,CAA0E,GAApE,OAAO,QAAY,KAAe,CAAC,QAAQ,WAA6B,QAAQ,UAAU,KAAM,MAAO,GAAO,GAAI,OAAO,OAAU,WAAY,MAAO,GAAM,GAAI,CAAE,eAAQ,UAAU,QAAQ,KAAK,QAAQ,UAAU,QAAS,GAAI,UAAY,CAAE,CAAA,CAAC,EAAU,EAAO,MAAW,CAAE,MAAO,GAAU,CACzU,IAAIx+D,GAAO,YACPia,IAAe,CAAC,OAAQ,MAAM,EAC9BkqD,OAAqC3lD,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC7F,IAAIq9C,EAAOr9C,EAAK,KACd/M,EAAO+M,EAAK,KACVqlD,EAAyB,SAAUrF,EAAO,IACxCZ,IAAW,SAAYiG,EAAWrF,CAAK,EAC3C,IAAIC,EAAST,IAAa6F,CAAS,EAenC,SAASA,EAAUE,EAAYC,EAAa,CAC1C,IAAIrxC,EAOJ,MANItW,IAAiB,SAAY,KAAMwnD,CAAS,EAChDlxC,EAAQ8rC,EAAO,KAAK,IAAI,EACxB9rC,EAAM,WAAaoxC,EACnBpxC,EAAM,YAAcqxC,GAAe,GAG/B,CAAC,MAAM,QAAQD,CAAU,GAAK,CAACA,EAAW,MAAM3mE,GAAI,MAAM,EAC5D,MAAM,IAAI,UAAU,4DAA4D,EAElF,GAAIu1B,EAAM,aAAe,CAACA,EAAM,iBAAgB,EAC9C,MAAM,IAAI,MAAM,mDAAmD,EAErE,OAAOA,CACR,CACD,SAAIrW,IAAc,SAAYunD,EAAW,CAAC,CACxC,IAAK,OACL,IAAK,UAAe,CAClB,OAAOlkE,EACR,CACP,EAAO,CACD,IAAK,cACL,IAAK,UAAe,CAClB,MAAO,EACR,CAeP,EAAO,CACD,IAAK,WACL,MAAO,SAAkB48D,EAAMC,EAAU,CAQvC,IAAIyH,KAAqBtqD,GAAO,KAAK,KAAK,WAAY,SAAUwyC,EAAWvzD,EAAG,CAC5E,IAAIsrE,EAAW/X,EAAU,OAAO,SAAUlwD,EAAM,CAC9C,OAAOA,EAAK,cAAgBA,EAAK,OAAS,KACtD,CAAW,EAAE,OAAS,EACZ,GAAIioE,EAAU,CAGZ,IAAIT,EAAgB,OAAO,OAAOjH,CAAQ,EAC1CiH,EAAc,IAAM,GACpB,IAAIU,EAAiBhY,EAAU,SAASoQ,EAAMkH,CAAa,EAC3D,OAAO,SAAuB1pD,EAAO3U,EAAMi3D,EAAS,CAClD,GAAI,IAAKj/D,GAAI,UAAUi/D,CAAO,GAAK,IAAKj/D,GAAI,SAASi/D,CAAO,GAAK,IAAKj/D,GAAI,UAAUi/D,CAAO,EACzF,MAAM,IAAI,UAAU,8EAAsFj/D,GAAI,QAAQi/D,CAAO,CAAC,EAEhI,IAAIz4D,EAAI6N,EAAK4qD,CAAO,EAAE,QAAO,EACzBuH,EAAY,OAAO,OAAOx+D,CAAI,EAClC,OAAAw+D,EAAU,IAAMhgE,EAAEhL,CAAC,EACZurE,EAAepqD,EAAO6pD,EAAWvH,CAAO,CAC7D,CACA,KAEY,QAAOlQ,EAAU,SAASoQ,EAAMC,CAAQ,CAEpD,CAAS,EACGn3D,KAAYkX,IAAS,iBAAiBggD,EAAM,OAAO,EACvD,OAAO,SAAuBxiD,EAAO3U,EAAMi3D,EAAS,CAClD,IAAI0H,KAAiBpqD,GAAO,KAAKsqD,EAAgB,SAAUG,EAAe,CACxE,OAAOA,EAAcrqD,EAAO3U,EAAMi3D,CAAO,CACrD,CAAW,EACD,OAAOh3D,EAAM,MAAM,UAAYskC,IAAoB,SAAYo6B,CAAU,CAAC,CACpF,CACO,CAMP,EAAO,CACD,IAAK,UACL,MAAO,SAAiBvmE,EAAU,CAChC,QAAS5E,EAAI,EAAGA,EAAI,KAAK,WAAW,OAAQA,IAC1C4E,EAAS,KAAK,WAAW5E,CAAC,EAAG,cAAgBA,EAAI,IAAK,IAAI,CAE7D,CAQP,EAAO,CACD,IAAK,MACL,MAAO,SAAa4E,EAAU,CAE5B,QADIumE,EAAa,CAAA,EACRnrE,EAAI,EAAGA,EAAI,KAAK,WAAW,OAAQA,IAC1CmrE,EAAWnrE,CAAC,EAAI,KAAK,QAAQ4E,EAAS,KAAK,WAAW5E,CAAC,EAAG,cAAgBA,EAAI,IAAK,IAAI,CAAC,EAE1F,OAAO,IAAIirE,EAAUE,EAAY,KAAK,WAAW,CAClD,CAMP,EAAO,CACD,IAAK,QACL,MAAO,UAAiB,CACtB,OAAO,IAAIF,EAAU,KAAK,WAAW,MAAM,CAAC,EAAG,KAAK,WAAW,CAChE,CAMP,EAAO,CACD,IAAK,mBACL,MAAO,UAA4B,CACjC,OAAO,KAAK,WAAW,SAAW,MAASzmE,GAAI,gBAAgB,KAAK,WAAW,CAAC,CAAC,GAAK,OAAO,KAAK,WAAW,CAAC,EAAE,OAAU,QAC3H,CAOP,EAAO,CACD,IAAK,oBACL,MAAO,UAA6B,CAClC,OAAO,KAAK,iBAAgB,EAAK,KAAK,WAAW,CAAC,EAAE,MAAQ,IAC7D,CAOP,EAAO,CACD,IAAK,YACL,MAAO,SAAmB+B,EAAS,CAEjC,OAAO,KAAK,YAAc,IAAM,KAAK,kBAAmB,EAAG,IAAM,KAAK,WAAW,KAAK,IAAI,EAAI,GAC/F,CAMP,EAAO,CACD,IAAK,SACL,MAAO,UAAkB,CACvB,MAAO,CACL,OAAQQ,GACR,WAAY,KAAK,WACjB,YAAa,KAAK,WAC5B,CACO,CAUP,EAAO,CACD,IAAK,SACL,MAMA,SAAgBR,EAAS,CAGvB,QADI4kE,EAAa,CAAA,EACRnrE,EAAI,EAAGA,EAAI,KAAK,WAAW,OAAQA,IAC1CmrE,EAAWnrE,CAAC,EAAI,KAAK,WAAWA,CAAC,EAAE,SAErC,OAAI,KAAK,YACA,yGAAiHie,IAAQ,QAAQ,KAAK,mBAAmB,EAAI,UAE7J,kEAAoEktD,EAAW,KAAK,uCAAuC,EAAI,iEAEzI,CAOP,EAAO,CACD,IAAK,SACL,MAAO,SAAgB5kE,EAAS,CAC9B,IAAI4kE,EAAa,KAAK,WAAW,IAAI,SAAUpyC,EAAO,CACpD,OAAOA,EAAM,MAAMxyB,CAAO,CACpC,CAAS,EACD,OAAO,KAAK,YAAc,IAAM,KAAK,kBAAmB,EAAQ,KAAO4kE,EAAW,KAAK,GAAG,EAAI,GAC/F,CACF,CAAA,EAAG,CAAC,CACH,IAAK,WACL,MAAO,SAAkBxkD,EAAM,CAC7B,OAAO,IAAIskD,EAAUtkD,EAAK,WAAYA,EAAK,WAAW,CACvD,CACF,CAAA,CAAC,EACKskD,CACR,EAAChI,CAAI,EACN,SAAInwB,IAAiB,SAAYm4B,EAAW,OAAQlkE,EAAI,EACjDkkE,CACT,EAAG,CACD,QAAS,GACT,OAAQ,EACV,CAAC,EACDA,GAAA,gBAA0BC,cCzQtBvrE,GAAyBY,GAC7B,OAAO,eAAekrE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIxoE,IAAWtD,GAAuBuD,EAAwC,EAC1EugB,IAAmB9jB,GAAuB8E,GAAA,CAAgD,EAC1Fif,IAAgB/jB,GAAuBuH,GAAA,CAA6C,EACpF89D,IAAarlE,GAAuBsc,GAAA,CAA0C,EAC9EgpD,IAA8BtlE,GAAuB8lB,GAAA,CAA2D,EAChHy/C,GAAmBvlE,GAAuBy4B,GAAA,CAAgD,EAC1F0a,IAAmBnzC,GAAuB04B,GAAA,CAAgD,EAC1F7zB,IAAM8zB,GACNra,GAAUsa,GACV5U,IAAWmrC,GACX7oD,GAAU8hE,GACVxiD,IAAW0iD,EACf,SAAS7C,IAAaC,EAAS,CAAE,IAAIC,EAA4BC,IAAyB,EAAI,OAAO,UAAgC,CAAE,IAAIC,KAAYN,GAAiB,SAAYG,CAAO,EAAG7sD,EAAQ,GAAI8sD,EAA2B,CAAE,IAAIG,KAAgBP,GAAiB,SAAY,IAAI,EAAE,YAAa1sD,EAAS,QAAQ,UAAUgtD,EAAO,UAAWC,CAAS,CAAE,MAAUjtD,EAASgtD,EAAM,MAAM,KAAM,SAAS,EAAK,SAAWP,IAA4B,SAAY,KAAMzsD,CAAM,CAAI,CAAG,CAC5d,SAAS+sD,KAA4B,CAA0E,GAApE,OAAO,QAAY,KAAe,CAAC,QAAQ,WAA6B,QAAQ,UAAU,KAAM,MAAO,GAAO,GAAI,OAAO,OAAU,WAAY,MAAO,GAAM,GAAI,CAAE,eAAQ,UAAU,QAAQ,KAAK,QAAQ,UAAU,QAAS,GAAI,UAAY,CAAE,CAAA,CAAC,EAAU,EAAO,MAAW,CAAE,MAAO,GAAU,CACzU,IAAIx+D,GAAO,aACPia,IAAe,CAAC,MAAM,EACtB0qD,OAAsCnmD,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC9F,IAAIq9C,EAAOr9C,EAAK,KACZ6lD,EAA0B,SAAU7F,EAAO,IACzCZ,IAAW,SAAYyG,EAAY7F,CAAK,EAC5C,IAAIC,EAAST,IAAaqG,CAAU,EAOpC,SAASA,EAAW7lE,EAAY,CAC9B,IAAIm0B,EAMJ,MALItW,IAAiB,SAAY,KAAMgoD,CAAU,EACjD1xC,EAAQ8rC,EAAO,KAAK,IAAI,EACxB9rC,EAAM,WAAan0B,GAAc,GAG7BA,OACQ3C,IAAS,SAAY2C,CAAU,IAAM,UAAa,CAAC,OAAO,KAAKA,CAAU,EAAE,MAAM,SAAU1F,EAAK,CACxG,SAAWsE,IAAI,QAAQoB,EAAW1F,CAAG,CAAC,CAChD,CAAS,GACC,MAAM,IAAI,UAAU,kCAAkC,EAG1D,OAAO65B,CACR,CACD,SAAIrW,IAAc,SAAY+nD,EAAY,CAAC,CACzC,IAAK,OACL,IAAK,UAAe,CAClB,OAAO1kE,EACR,CACP,EAAO,CACD,IAAK,eACL,IAAK,UAAe,CAClB,MAAO,EACR,CAeP,EAAO,CACD,IAAK,WACL,MAAO,SAAkB48D,EAAMC,EAAU,CACvC,IAAI+H,EAAc,CAAA,EAClB,QAASzrE,KAAO,KAAK,WACnB,MAAQ+F,GAAQ,gBAAgB,KAAK,WAAY/F,CAAG,EAAG,CAGrD,IAAI0rE,KAAqB3tD,GAAQ,WAAW/d,CAAG,EAC3C2rE,EAAY,KAAK,MAAMD,CAAc,EACzC,GAAI,IAAKjoD,IAAS,gBAAgB,KAAK,WAAYkoD,CAAS,EAC1D,MAAM,IAAI,MAAM,0BAA4BA,EAAY,GAAG,EAE7DF,EAAYE,CAAS,EAAI,KAAK,WAAW3rE,CAAG,EAAE,SAASyjE,EAAMC,CAAQ,CACtE,CAEH,OAAO,SAAwBziD,EAAO3U,EAAMi3D,EAAS,CACnD,IAAI7jE,EAAM,CAAA,EACV,QAASklB,KAAQ6mD,KACP1lE,GAAQ,gBAAgB0lE,EAAa7mD,CAAI,IAC/CllB,EAAIklB,CAAI,EAAI6mD,EAAY7mD,CAAI,EAAE3D,EAAO3U,EAAMi3D,CAAO,GAGtD,OAAO7jE,CACjB,CACO,CAMP,EAAO,CACD,IAAK,UACL,MAAO,SAAiBgF,EAAU,CAChC,QAAS1E,KAAO,KAAK,cACX+F,GAAQ,gBAAgB,KAAK,WAAY/F,CAAG,GAClD0E,EAAS,KAAK,WAAW1E,CAAG,EAAG,iBAAoB+d,GAAQ,WAAW/d,CAAG,EAAI,IAAK,IAAI,CAG3F,CAQP,EAAO,CACD,IAAK,MACL,MAAO,SAAa0E,EAAU,CAC5B,IAAIgB,EAAa,CAAA,EACjB,QAAS1F,KAAO,KAAK,cACX+F,GAAQ,gBAAgB,KAAK,WAAY/F,CAAG,IAClD0F,EAAW1F,CAAG,EAAI,KAAK,QAAQ0E,EAAS,KAAK,WAAW1E,CAAG,EAAG,iBAAoB+d,GAAQ,WAAW/d,CAAG,EAAI,IAAK,IAAI,CAAC,GAG1H,OAAO,IAAIurE,EAAW7lE,CAAU,CACjC,CAMP,EAAO,CACD,IAAK,QACL,MAAO,UAAiB,CACtB,IAAIA,EAAa,CAAA,EACjB,QAAS1F,KAAO,KAAK,cACX+F,GAAQ,gBAAgB,KAAK,WAAY/F,CAAG,IAClD0F,EAAW1F,CAAG,EAAI,KAAK,WAAWA,CAAG,GAGzC,OAAO,IAAIurE,EAAW7lE,CAAU,CACjC,CAQP,EAAO,CACD,IAAK,YACL,MAAO,SAAmBW,EAAS,CACjC,IAAIgW,EAAU,CAAA,EACd,QAASrc,KAAO,KAAK,cACX+F,GAAQ,gBAAgB,KAAK,WAAY/F,CAAG,GAClDqc,EAAQ,QAAS0B,GAAQ,WAAW/d,CAAG,EAAI,KAAO,KAAK,WAAWA,CAAG,EAAE,SAASqG,CAAO,CAAC,EAG5F,MAAO,IAAMgW,EAAQ,KAAK,IAAI,EAAI,GACnC,CAMP,EAAO,CACD,IAAK,SACL,MAAO,UAAkB,CACvB,MAAO,CACL,OAAQxV,GACR,WAAY,KAAK,UAC3B,CACO,CASP,EAAO,CACD,IAAK,SACL,MAOA,SAAgBR,EAAS,CACvB,IAAIgW,EAAU,CAAA,EACd,QAASrc,KAAO,KAAK,cACX+F,GAAQ,gBAAgB,KAAK,WAAY/F,CAAG,GAClDqc,EAAQ,KAAK,8CAAiD0B,GAAQ,QAAQ/d,CAAG,EAAI,8HAA+I,KAAK,WAAWA,CAAG,EAAE,OAAOqG,CAAO,CAAC,EAG5Q,MAAO,iEAAmEgW,EAAQ,KAAK,uCAAuC,EAAI,gEACnI,CAOP,EAAO,CACD,IAAK,SACL,MAAO,SAAgBhW,EAAS,CAC9B,IAAIgW,EAAU,CAAA,EACd,QAASrc,KAAO,KAAK,cACX+F,GAAQ,gBAAgB,KAAK,WAAY/F,CAAG,GAClDqc,EAAQ,KAAK,YAAcrc,EAAM,QAAU,KAAK,WAAWA,CAAG,EAAE,MAAMqG,CAAO,EAAI,MAAM,EAG3F,IAAIulE,EAAM,8BAAgCvvD,EAAQ,KAAK;AAAA,CAAI,EAAI,yBAC/D,OAAOuvD,CACR,CACF,CAAA,EAAG,CAAC,CACH,IAAK,WACL,MAAO,SAAkBnlD,EAAM,CAC7B,OAAO,IAAI8kD,EAAW9kD,EAAK,UAAU,CACtC,CACF,CAAA,CAAC,EACK8kD,CACR,EAACxI,CAAI,EACN,SAAInwB,IAAiB,SAAY24B,EAAY,OAAQ1kE,EAAI,EAClD0kE,CACT,EAAG,CACD,QAAS,GACT,OAAQ,EACV,CAAC,EACDA,GAAA,iBAA2BC,cC3OvB/rE,GAAyBY,GAC7B,OAAO,eAAewrE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAItoD,IAAmB9jB,GAAuBuD,GAAA,CAAgD,EAC1FwgB,IAAgB/jB,GAAuB8E,GAAA,CAA6C,EACpFugE,IAAarlE,GAAuBuH,GAAA,CAA0C,EAC9E+9D,IAA8BtlE,GAAuBsc,GAAA,CAA2D,EAChHipD,GAAmBvlE,GAAuB8lB,GAAA,CAAgD,EAC1FqtB,IAAmBnzC,GAAuBy4B,GAAA,CAAgD,EAC1F5zB,GAAM6zB,GACNtX,GAASuX,GACTra,GAAUsa,GACV5U,GAAWmrC,GACXkZ,GAAaD,GACbwC,IAAStC,GAAA,EACT1iD,IAAWmlD,EACf,SAAStF,IAAaC,EAAS,CAAE,IAAIC,EAA4BC,IAAyB,EAAI,OAAO,UAAgC,CAAE,IAAIC,KAAYN,GAAiB,SAAYG,CAAO,EAAG7sD,EAAQ,GAAI8sD,EAA2B,CAAE,IAAIG,KAAgBP,GAAiB,SAAY,IAAI,EAAE,YAAa1sD,EAAS,QAAQ,UAAUgtD,EAAO,UAAWC,CAAS,CAAE,MAAUjtD,EAASgtD,EAAM,MAAM,KAAM,SAAS,EAAK,SAAWP,IAA4B,SAAY,KAAMzsD,CAAM,CAAI,CAAG,CAC5d,SAAS+sD,KAA4B,CAA0E,GAApE,OAAO,QAAY,KAAe,CAAC,QAAQ,WAA6B,QAAQ,UAAU,KAAM,MAAO,GAAO,GAAI,OAAO,OAAU,WAAY,MAAO,GAAM,GAAI,CAAE,eAAQ,UAAU,QAAQ,KAAK,QAAQ,UAAU,QAAS,GAAI,UAAY,CAAE,CAAA,CAAC,EAAU,EAAO,MAAW,CAAE,MAAO,GAAU,CACzU,IAAIx+D,GAAO,eACPia,IAAe,CAAC,MAAM,EACtBgrD,OAAwCzmD,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAChG,IAAIq9C,EAAOr9C,EAAK,KAQhB,SAASqmD,EAAmBzI,EAAM2D,EAAa,CAC7C,IAAI+E,EAAU1I,EACd,GAAI2D,IAAgB,OAClB,QAAW3iE,GAAI,mBAAmB0nE,CAAO,GACvCA,EAAUA,EAAQ,QAGtB,SAAQ1nE,GAAI,gBAAgB0nE,CAAO,EAAU,MACrC1nE,GAAI,gBAAgB0nE,CAAO,EAC1BD,EAAmBC,EAAQ,KAAK,CAAC,EAAG/E,CAAW,EAEjD,EACR,CAeD,SAASgF,EAA8B15C,EAAM00C,EAAaC,EAAU56D,EAAMq9D,EAAO,CAE/E,IAAIvC,KAAiBU,GAAW,eAAev1C,EAAM00C,EAAaC,CAAQ,EACtEgF,KAAoBpE,GAAW,kBAAkBv1C,EAAM00C,CAAW,EACtE,GAAIA,IAAgB,OAAS36D,EAAK,OAAS,GAAKimB,EAAK,cAAa,IAAO,oBAAsBA,EAAK,cAAa,IAAO,wBACtH,OAAOjmB,EAAK,IAAI,SAAU2D,EAAK,CAC7B,OAAQA,EAAI,WAAU,EAAG,KAAI,CAE3B,IAAK,YACL,IAAK,eACL,IAAK,aACL,IAAK,kBACH,MAAO,GACT,QACE,MAAO,EACV,CACT,CAAO,EAEH,IAAIqI,EACJ,OAAQhM,EAAK,OAAM,CACjB,IAAK,GACHgM,EAAS,CAAA,EACT,MACF,IAAK,GAEH,CAEE,IAAI6zD,KAAwBrE,GAAW,eAAex7D,EAAK,CAAC,EAAG26D,EAAaC,EAAU30C,CAAI,EAG1F,GAAIo3C,GAASwC,IAAsB,KAAM,CACvC,IAAIC,EACAC,EASJ,GARIpF,IAAgB,QAClBmF,EAAoB9/D,EAAK,CAAC,EAAE,cAAa,EACzC+/D,EAAiB95C,EAAK,kBAGtB65C,EAAoB9/D,EAAK,CAAC,EAAE,WAAY,EAAC,cAAa,EACtD+/D,EAAiB95C,EAAK,WAAY,EAAC,cAAa,GAE9Cu1C,GAAW,WAAWV,CAAU,EAAEiF,CAAc,EAAE,kBAAoB,GAAO,CAC/E/zD,EAAS,CAAC,EAAK,EACf,KACD,CACD,GAAIwvD,GAAW,WAAWqE,CAAiB,EAAEC,CAAiB,EAAE,cAAgB,GAAO,CACrF9zD,EAAS,CAAC,EAAK,EACf,KACD,CACF,CACD,GAAI6zD,IAAsB,KAAM,CAE9B7zD,EAAS,CAAC,EAAK,EACf,KACD,CACD,GAAI6zD,GAAqB/E,EAAY,CAEnC9uD,EAAS,CAAC,EAAI,EACd,KACD,CAGDA,EAAS,CAAC,EAAK,CAChB,CACD,MACF,IAAK,GAEH,CACE,IAAIg0D,EAEAC,KAAoBzE,GAAW,eAAex7D,EAAK,CAAC,EAAG26D,EAAaC,EAAU30C,CAAI,EAElFi6C,KAAmB1E,GAAW,mBAAmBv1C,EAAMjmB,EAAK,CAAC,EAAG26D,CAAW,EAC3EsF,IAAkB,KAGpBD,EAAY,GACHC,IAAkBnF,GAAc8E,IAAkB,SAAW,CAACM,GAM9DD,EAAgBnF,EADzBkF,EAAY,GAIZA,EAAY,GAEd,IAAIG,EAEAC,KAAoB5E,GAAW,eAAex7D,EAAK,CAAC,EAAG26D,EAAaC,EAAU30C,CAAI,EAElFo6C,KAAmB7E,GAAW,mBAAmBv1C,EAAMjmB,EAAK,CAAC,EAAG26D,CAAW,EAkB/E,GAjBIyF,IAAkB,KAGpBD,EAAY,GACHC,IAAkBtF,GAAc8E,IAAkB,QAAU,CAACS,GAM7DD,EAAgBtF,EADzBqF,EAAY,GAIZA,EAAY,GAIV9C,EAAO,CACT,IAAIiD,EACAC,EACAC,EACA7F,IAAgB,QAClB2F,EAAkBr6C,EAAK,gBACvBs6C,EAAgBt6C,EAAK,KAAK,CAAC,EAAE,cAAa,EAC1Cu6C,EAAgBv6C,EAAK,KAAK,CAAC,EAAE,cAAa,IAG1Cq6C,EAAkBr6C,EAAK,WAAY,EAAC,cAAa,EACjDs6C,EAAgBt6C,EAAK,KAAK,CAAC,EAAE,WAAU,EAAG,gBAC1Cu6C,EAAgBv6C,EAAK,KAAK,CAAC,EAAE,WAAU,EAAG,iBAExCg6C,IAAkB,OAChBzE,GAAW,WAAWV,CAAU,EAAEwF,CAAe,EAAE,kBAAoB,KACzEN,EAAY,IAEVxE,GAAW,WAAWyE,CAAa,EAAEM,CAAa,EAAE,cAAgB,KACtEP,EAAY,KAGZI,IAAkB,OAChB5E,GAAW,WAAWV,CAAU,EAAEwF,CAAe,EAAE,mBAAqB,KAC1EH,EAAY,IAEV3E,GAAW,WAAW4E,CAAa,EAAEI,CAAa,EAAE,cAAgB,KACtEL,EAAY,IAGjB,CACDn0D,EAAS,CAACg0D,EAAWG,CAAS,CAC/B,CACD,MACF,SACMl6C,EAAK,kBAAoB,oBAAsBA,EAAK,cAAe,IAAK,2BAC1Eja,EAAShM,EAAK,IAAI,SAAU2D,EAAK,CAC/B,IAAI88D,KAAoBjF,GAAW,eAAe73D,EAAKg3D,EAAaC,EAAU30C,CAAI,EAC9Ey6C,KAAmBlF,GAAW,mBAAmBv1C,EAAMtiB,EAAKg3D,CAAW,EACvEgG,KAAuBnF,GAAW,kBAAkB73D,EAAKg3D,CAAW,EACxE,OAAI8F,IAAkB,KAEb,GACE3F,IAAe2F,GAAiBb,IAAkBe,GAAoB,CAACD,EACzE,GACED,EAAgB3F,CAIvC,CAAW,GAEH,KACH,CAMD,GAAI96D,EAAK,QAAU,GAAKimB,EAAK,cAAe,IAAK,yBAA2BA,EAAK,UAAY00C,IAAgB,OAASC,IAAa,OACjI,QAASpnE,EAAI,EAAGA,EAAIwY,EAAO,OAAQ,EAAExY,EAC/BisE,EAAmBz/D,EAAKxM,CAAC,EAAGmnE,CAAW,GAAK,CAAC3uD,EAAOxY,EAAI,CAAC,IAAMmnE,IAAgB,QAAU,IAAK3iE,GAAI,mBAAmBgI,EAAKxM,EAAI,CAAC,CAAC,KAClIwY,EAAOxY,CAAC,EAAI,IAIlB,OAAOwY,CACR,CACD,IAAIuzD,EAA4B,SAAUnG,EAAO,IAC3CZ,IAAW,SAAY+G,EAAcnG,CAAK,EAC9C,IAAIC,EAAST,IAAa2G,CAAY,EAYtC,SAASA,EAAaqB,EAAIjkE,EAAIqD,EAAM46D,EAAUiG,EAAc,CAC1D,IAAItzC,EAIJ,MAHItW,IAAiB,SAAY,KAAMsoD,CAAY,EACnDhyC,EAAQ8rC,EAAO,KAAK,IAAI,EAEpB,OAAOuH,GAAO,SAChB,MAAM,IAAI,UAAU,oCAAoC,EAE1D,GAAI,OAAOjkE,GAAO,SAChB,MAAM,IAAI,UAAU,oCAAoC,EAE1D,GAAI,CAAC,MAAM,QAAQqD,CAAI,GAAK,CAACA,EAAK,MAAMhI,GAAI,MAAM,EAChD,MAAM,IAAI,UAAU,sDAAsD,EAE5E,OAAAu1B,EAAM,SAAWqtC,IAAa,GAC9BrtC,EAAM,aAAeszC,IAAiB,GACtCtzC,EAAM,GAAKqzC,EACXrzC,EAAM,GAAK5wB,EACX4wB,EAAM,KAAOvtB,GAAQ,GACdutB,CACR,CACD,SAAIrW,IAAc,SAAYqoD,EAAc,CAAC,CAC3C,IAAK,OACL,IAAK,UAAe,CAClB,OAAOhlE,EACR,CACP,EAAO,CACD,IAAK,iBACL,IAAK,UAAe,CAClB,MAAO,EACR,CAeP,EAAO,CACD,IAAK,WACL,MAAO,SAAkB48D,EAAMC,EAAU,CAEvC,GAAI,OAAO,KAAK,IAAO,UAAY,IAAKjgD,GAAS,cAAcggD,EAAM,KAAK,EAAE,EAC1E,MAAKA,EAAK,KAAK,EAAE,EAGT,IAAI,MAAM,0BAA4B,KAAK,GAAK,GAAG,EAFnD,IAAI,MAAM,YAAc,KAAK,GAAK,uCAAuC,EAKnF,IAAIx6D,KAASwa,GAAS,iBAAiBggD,EAAM,KAAK,EAAE,EAChD2J,KAAevsD,GAAO,KAAK,KAAK,KAAM,SAAU5Q,EAAK,CACvD,OAAOA,EAAI,SAASwzD,EAAMC,CAAQ,CAC5C,CAAS,EACD,GAAI0J,EAAS,SAAW,EAAG,CACzB,IAAIC,EAAWD,EAAS,CAAC,EACzB,OAAO,SAA0BnsD,EAAO3U,EAAMi3D,EAAS,CACrD,OAAOt6D,EAAGokE,EAASpsD,EAAO3U,EAAMi3D,CAAO,CAAC,CACpD,CACA,SAAmB6J,EAAS,SAAW,EAAG,CAChC,IAAIE,EAAWF,EAAS,CAAC,EACrBG,EAAWH,EAAS,CAAC,EACzB,OAAO,SAA0BnsD,EAAO3U,EAAMi3D,EAAS,CACrD,OAAOt6D,EAAGqkE,EAASrsD,EAAO3U,EAAMi3D,CAAO,EAAGgK,EAAStsD,EAAO3U,EAAMi3D,CAAO,CAAC,CACpF,CACA,KACU,QAAO,SAA0BtiD,EAAO3U,EAAMi3D,EAAS,CACrD,OAAOt6D,EAAG,MAAM,QAAU4X,GAAO,KAAKusD,EAAU,SAAUI,EAAS,CACjE,OAAOA,EAAQvsD,EAAO3U,EAAMi3D,CAAO,CACpC,CAAA,CAAC,CACd,CAEO,CAMP,EAAO,CACD,IAAK,UACL,MAAO,SAAiB7+D,EAAU,CAChC,QAAS5E,EAAI,EAAGA,EAAI,KAAK,KAAK,OAAQA,IACpC4E,EAAS,KAAK,KAAK5E,CAAC,EAAG,QAAUA,EAAI,IAAK,IAAI,CAEjD,CAQP,EAAO,CACD,IAAK,MACL,MAAO,SAAa4E,EAAU,CAE5B,QADI4H,EAAO,CAAA,EACFxM,EAAI,EAAGA,EAAI,KAAK,KAAK,OAAQA,IACpCwM,EAAKxM,CAAC,EAAI,KAAK,QAAQ4E,EAAS,KAAK,KAAK5E,CAAC,EAAG,QAAUA,EAAI,IAAK,IAAI,CAAC,EAExE,OAAO,IAAI+rE,EAAa,KAAK,GAAI,KAAK,GAAIv/D,EAAM,KAAK,SAAU,KAAK,YAAY,CACjF,CAMP,EAAO,CACD,IAAK,QACL,MAAO,UAAiB,CACtB,OAAO,IAAIu/D,EAAa,KAAK,GAAI,KAAK,GAAI,KAAK,KAAK,MAAM,CAAC,EAAG,KAAK,SAAU,KAAK,YAAY,CAC/F,CAQP,EAAO,CACD,IAAK,UACL,MAAO,UAAmB,CACxB,OAAO,KAAK,KAAK,SAAW,CAC7B,CAQP,EAAO,CACD,IAAK,WACL,MAAO,UAAoB,CACzB,OAAO,KAAK,KAAK,SAAW,CAC7B,CAOP,EAAO,CACD,IAAK,YACL,MAAO,SAAmBxlE,EAAS,CACjC,IAAI4gE,EAAc5gE,GAAWA,EAAQ,YAAcA,EAAQ,YAAc,OACrE6gE,EAAW7gE,GAAWA,EAAQ,SAAWA,EAAQ,SAAW,OAC5DiG,EAAO,KAAK,KACZmhE,EAASxB,EAA8B,KAAMhF,EAAaC,EAAU56D,EAAM,EAAK,EACnF,GAAIA,EAAK,SAAW,EAAG,CAErB,IAAIohE,KAAY5F,GAAW,kBAAkB,KAAMb,CAAW,EAC1D0G,EAAUrhE,EAAK,CAAC,EAAE,SAASjG,CAAO,EAClConE,EAAO,CAAC,IACVE,EAAU,IAAMA,EAAU,KAI5B,IAAIC,EAAY,YAAY,KAAK,KAAK,EAAE,EACxC,OAAIF,IAAU,QAEL,KAAK,IAAME,EAAY,IAAM,IAAMD,EACjCD,IAAU,OAEZC,GAAWC,EAAY,IAAM,IAAM,KAAK,GAI1CD,EAAU,KAAK,EAChC,SAAmBrhE,EAAK,SAAW,EAAG,CAC5B,IAAIuhE,EAAMvhE,EAAK,CAAC,EAAE,SAASjG,CAAO,EAC9BynE,EAAMxhE,EAAK,CAAC,EAAE,SAASjG,CAAO,EASlC,OARIonE,EAAO,CAAC,IAEVI,EAAM,IAAMA,EAAM,KAEhBJ,EAAO,CAAC,IAEVK,EAAM,IAAMA,EAAM,KAEhB,KAAK,UAAY,KAAK,cAAa,IAAO,yBAA2B5G,IAAa,OAC7E2G,EAAM,IAAMC,EAEdD,EAAM,IAAM,KAAK,GAAK,IAAMC,CACpC,SAAUxhE,EAAK,OAAS,IAAM,KAAK,kBAAoB,oBAAsB,KAAK,cAAe,IAAK,yBAA0B,CAC/H,IAAIyhE,EAAkBzhE,EAAK,IAAI,SAAU2D,EAAK1D,EAAO,CACnD,OAAA0D,EAAMA,EAAI,SAAS5J,CAAO,EACtBonE,EAAOlhE,CAAK,IAEd0D,EAAM,IAAMA,EAAM,KAEbA,CACnB,CAAW,EACD,OAAI,KAAK,UAAY,KAAK,cAAa,IAAO,yBAA2Bi3D,IAAa,OAC7E6G,EAAgB,KAAK,GAAG,EAE1BA,EAAgB,KAAK,IAAM,KAAK,GAAK,GAAG,CACzD,KAEU,QAAO,KAAK,GAAK,IAAM,KAAK,KAAK,KAAK,IAAI,EAAI,GAEjD,CAMP,EAAO,CACD,IAAK,SACL,MAAO,UAAkB,CACvB,MAAO,CACL,OAAQlnE,GACR,GAAI,KAAK,GACT,GAAI,KAAK,GACT,KAAM,KAAK,KACX,SAAU,KAAK,SACf,aAAc,KAAK,YAC7B,CACO,CAeP,EAAO,CACD,IAAK,SACL,MAMA,SAAgBR,EAAS,CACvB,IAAI4gE,EAAc5gE,GAAWA,EAAQ,YAAcA,EAAQ,YAAc,OACrE6gE,EAAW7gE,GAAWA,EAAQ,SAAWA,EAAQ,SAAW,OAC5DiG,EAAO,KAAK,KACZmhE,EAASxB,EAA8B,KAAMhF,EAAaC,EAAU56D,EAAM,EAAK,EACnF,GAAIA,EAAK,SAAW,EAAG,CAErB,IAAIohE,KAAY5F,GAAW,kBAAkB,KAAMb,CAAW,EAC1D0G,EAAUrhE,EAAK,CAAC,EAAE,OAAOjG,CAAO,EAIpC,OAHIonE,EAAO,CAAC,IACVE,EAAU,iEAAmEA,EAAU,kEAErFD,IAAU,QAEL,mFAA2F3vD,GAAQ,QAAQ,KAAK,EAAE,EAAI,UAAY4vD,EAGlIA,EAAU,oFAA4F5vD,GAAQ,QAAQ,KAAK,EAAE,EAAI,SAEpJ,SAAmBzR,EAAK,SAAW,EAAG,CAE5B,IAAIuhE,EAAMvhE,EAAK,CAAC,EAAE,OAAOjG,CAAO,EAC5BynE,EAAMxhE,EAAK,CAAC,EAAE,OAAOjG,CAAO,EAShC,OARIonE,EAAO,CAAC,IAEVI,EAAM,iEAAmEA,EAAM,kEAE7EJ,EAAO,CAAC,IAEVK,EAAM,iEAAmEA,EAAM,kEAE7E,KAAK,UAAY,KAAK,cAAa,IAAO,yBAA2B5G,IAAa,OAC7E2G,EAAM,yFAAgGC,EAExGD,EAAM,qFAA6F9vD,GAAQ,QAAQ,KAAK,EAAE,EAAI,UAAY+vD,CAC3J,KAAe,CACL,IAAIC,EAAkBzhE,EAAK,IAAI,SAAU2D,EAAK1D,EAAO,CACnD,OAAA0D,EAAMA,EAAI,OAAO5J,CAAO,EACpBonE,EAAOlhE,CAAK,IAEd0D,EAAM,iEAAmEA,EAAM,kEAE1EA,CACnB,CAAW,EACD,OAAI3D,EAAK,OAAS,IAAM,KAAK,kBAAoB,oBAAsB,KAAK,cAAe,IAAK,yBAC1F,KAAK,UAAY,KAAK,cAAa,IAAO,yBAA2B46D,IAAa,OAC7E6G,EAAgB,KAAK,wFAA6F,EAEpHA,EAAgB,KAAK,qFAA6FhwD,GAAQ,QAAQ,KAAK,EAAE,EAAI,SAAS,EAGtJ,kCAAqCA,GAAQ,QAAQ,KAAK,EAAE,EAAI,wEAA+EgwD,EAAgB,KAAK,uCAAuC,EAAI,gEAEzN,CACF,CAOP,EAAO,CACD,IAAK,SACL,MAAO,SAAgB1nE,EAAS,CAC9B,IAAI4gE,EAAc5gE,GAAWA,EAAQ,YAAcA,EAAQ,YAAc,OACrE6gE,EAAW7gE,GAAWA,EAAQ,SAAWA,EAAQ,SAAW,OAC5DiG,EAAO,KAAK,KACZmhE,EAASxB,EAA8B,KAAMhF,EAAaC,EAAU56D,EAAM,EAAI,EAC9E4gE,EAAK7C,IAAO,eAAe,KAAK,EAAE,EAGtC,GAFA6C,EAAK,OAAOA,EAAO,IAAc,KAAK,GAAKA,EAEvC5gE,EAAK,SAAW,EAAG,CAErB,IAAIohE,KAAY5F,GAAW,kBAAkB,KAAMb,CAAW,EAC1D0G,EAAUrhE,EAAK,CAAC,EAAE,MAAMjG,CAAO,EAInC,OAHIonE,EAAO,CAAC,IACVE,EAAU,UAAU,OAAOA,EAAS,UAAU,GAE5CD,IAAU,QAELR,EAAKS,EAGLA,EAAUT,CAK7B,SAAmB5gE,EAAK,SAAW,EAAG,CAE5B,IAAIuhE,EAAMvhE,EAAK,CAAC,EACZ0hE,EAASH,EAAI,MAAMxnE,CAAO,EAC1BonE,EAAO,CAAC,IACVO,EAAS,UAAU,OAAOA,EAAQ,UAAU,GAE9C,IAAIF,EAAMxhE,EAAK,CAAC,EACZ2hE,EAASH,EAAI,MAAMznE,CAAO,EAC1BonE,EAAO,CAAC,IACVQ,EAAS,UAAU,OAAOA,EAAQ,UAAU,GAI9C,IAAIpB,EAOJ,OANI5F,IAAgB,OAClB4F,EAAgBgB,EAAI,gBAGpBhB,EAAgBgB,EAAI,WAAY,EAAC,cAAa,EAExC,KAAK,cAAe,EAAA,CAC1B,IAAK,sBAEH,OAAOX,EAAK,IAAMc,EAAS,KAAYC,EAAS,IAClD,IAAK,mBAGH,OAFAD,EAAS,IAAMA,EAAS,IACxBC,EAAS,IAAMA,EAAS,IAChBpB,EAAa,CACnB,IAAK,kBACL,IAAK,sBACHmB,EAAS,UAAU,OAAOA,EAAQ,UAAU,CAC/C,CACD,MACF,IAAK,wBACH,GAAI,KAAK,UAAY9G,IAAa,OAChC,OAAO8G,EAAS,IAAMC,CAE3B,CACD,OAAOD,EAASd,EAAKe,CACtB,SAAU3hE,EAAK,OAAS,IAAM,KAAK,kBAAoB,oBAAsB,KAAK,cAAe,IAAK,yBAA0B,CAC/H,IAAI4hE,EAAe5hE,EAAK,IAAI,SAAU2D,EAAK1D,EAAO,CAChD,OAAA0D,EAAMA,EAAI,MAAM5J,CAAO,EACnBonE,EAAOlhE,CAAK,IACd0D,EAAM,UAAU,OAAOA,EAAK,UAAU,GAEjCA,CACnB,CAAW,EACD,OAAI,KAAK,kBAAoB,yBAA2B,KAAK,UAAYi3D,IAAa,OAC7EgH,EAAa,KAAK,GAAG,EAEvBA,EAAa,KAAKhB,CAAE,CACrC,KAIU,OAAO,YAAc,KAAK,GAAK,WAAa5gE,EAAK,IAAI,SAAU2D,EAAK,CAClE,OAAOA,EAAI,MAAM5J,CAAO,CACzB,CAAA,EAAE,KAAK,GAAG,EAAI,UAElB,CAMP,EAAO,CACD,IAAK,gBACL,MAAO,UAAyB,CAC9B,OAAO,KAAK,KAAO,IAAM,KAAK,EAC/B,CACF,CAAA,EAAG,CAAC,CACH,IAAK,WACL,MAAO,SAAkBogB,EAAM,CAC7B,OAAO,IAAIolD,EAAaplD,EAAK,GAAIA,EAAK,GAAIA,EAAK,KAAMA,EAAK,SAAUA,EAAK,YAAY,CACtF,CACF,CAAA,CAAC,EACKolD,CACR,EAAC9I,CAAI,EACN,SAAInwB,IAAiB,SAAYi5B,EAAc,OAAQhlE,EAAI,EACpDglE,CACT,EAAG,CACD,QAAS,GACT,OAAQ,EACV,CAAC,EACDA,GAAA,mBAA6BC,cC5pBzBrsE,GAAyBY,GAC7B,OAAO,eAAe8tE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAI5qD,IAAmB9jB,GAAuBuD,GAAA,CAAgD,EAC1FwgB,IAAgB/jB,GAAuB8E,GAAA,CAA6C,EACpFugE,IAAarlE,GAAuBuH,GAAA,CAA0C,EAC9E+9D,IAA8BtlE,GAAuBsc,GAAA,CAA2D,EAChHipD,GAAmBvlE,GAAuB8lB,GAAA,CAAgD,EAC1FqtB,IAAmBnzC,GAAuBy4B,GAAA,CAAgD,EAC1F5zB,IAAM6zB,GACN9S,IAAW+S,EACf,SAAS8sC,IAAaC,EAAS,CAAE,IAAIC,EAA4BC,IAAyB,EAAI,OAAO,UAAgC,CAAE,IAAIC,KAAYN,GAAiB,SAAYG,CAAO,EAAG7sD,EAAQ,GAAI8sD,EAA2B,CAAE,IAAIG,KAAgBP,GAAiB,SAAY,IAAI,EAAE,YAAa1sD,EAAS,QAAQ,UAAUgtD,EAAO,UAAWC,CAAS,CAAE,MAAUjtD,EAASgtD,EAAM,MAAM,KAAM,SAAS,EAAK,SAAWP,IAA4B,SAAY,KAAMzsD,CAAM,CAAI,CAAG,CAC5d,SAAS+sD,KAA4B,CAA0E,GAApE,OAAO,QAAY,KAAe,CAAC,QAAQ,WAA6B,QAAQ,UAAU,KAAM,MAAO,GAAO,GAAI,OAAO,OAAU,WAAY,MAAO,GAAM,GAAI,CAAE,eAAQ,UAAU,QAAQ,KAAK,QAAQ,UAAU,QAAS,GAAI,UAAY,CAAE,CAAA,CAAC,EAAU,EAAO,MAAW,CAAE,MAAO,GAAU,CACzU,IAAIx+D,GAAO,kBACPia,IAAe,CAAC,MAAM,EACtBstD,OAA2C/oD,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACnG,IAAIq9C,EAAOr9C,EAAK,KACZyoD,EAA+B,SAAUzI,EAAO,IAC9CZ,IAAW,SAAYqJ,EAAiBzI,CAAK,EACjD,IAAIC,EAAST,IAAaiJ,CAAe,EAQzC,SAASA,EAAgBE,EAAS,CAChC,IAAIx0C,EAIJ,MAHItW,IAAiB,SAAY,KAAM4qD,CAAe,EACtDt0C,EAAQ8rC,EAAO,KAAK,IAAI,EAEpB,IAAKrhE,IAAI,QAAQ+pE,CAAO,EAC1B,MAAM,IAAI,UAAU,uCAAuC,EAE7D,OAAAx0C,EAAM,QAAUw0C,EACTx0C,CACR,CACD,SAAIrW,IAAc,SAAY2qD,EAAiB,CAAC,CAC9C,IAAK,OACL,IAAK,UAAe,CAClB,OAAOtnE,EACR,CACP,EAAO,CACD,IAAK,oBACL,IAAK,UAAe,CAClB,MAAO,EACR,CAeP,EAAO,CACD,IAAK,WACL,MAAO,SAAkB48D,EAAMC,EAAU,CACvC,OAAO,KAAK,QAAQ,SAASD,EAAMC,CAAQ,CAC5C,CAOP,EAAO,CACD,IAAK,aACL,MAAO,UAAsB,CAC3B,OAAO,KAAK,QAAQ,YACrB,CAMP,EAAO,CACD,IAAK,UACL,MAAO,SAAiBh/D,EAAU,CAChCA,EAAS,KAAK,QAAS,UAAW,IAAI,CACvC,CAQP,EAAO,CACD,IAAK,MACL,MAAO,SAAaA,EAAU,CAC5B,IAAI2pE,EAAU3pE,EAAS,KAAK,QAAS,UAAW,IAAI,EACpD,OAAO,IAAIypE,EAAgBE,CAAO,CACnC,CAMP,EAAO,CACD,IAAK,QACL,MAAO,UAAiB,CACtB,OAAO,IAAIF,EAAgB,KAAK,OAAO,CACxC,CAQP,EAAO,CACD,IAAK,YACL,MAAO,SAAmB9nE,EAAS,CACjC,MAAI,CAACA,GAAWA,GAAW,CAACA,EAAQ,aAAeA,GAAWA,EAAQ,cAAgB,OAC7E,IAAM,KAAK,QAAQ,SAASA,CAAO,EAAI,IAEzC,KAAK,QAAQ,SAASA,CAAO,CACrC,CAMP,EAAO,CACD,IAAK,SACL,MAAO,UAAkB,CACvB,MAAO,CACL,OAAQQ,GACR,QAAS,KAAK,OACxB,CACO,CASP,EAAO,CACD,IAAK,SACL,MAOA,SAAgBR,EAAS,CACvB,MAAI,CAACA,GAAWA,GAAW,CAACA,EAAQ,aAAeA,GAAWA,EAAQ,cAAgB,OAC7E,iEAAmE,KAAK,QAAQ,OAAOA,CAAO,EAAI,iEAEpG,KAAK,QAAQ,OAAOA,CAAO,CACnC,CAQP,EAAO,CACD,IAAK,SACL,MAAO,SAAgBA,EAAS,CAC9B,MAAI,CAACA,GAAWA,GAAW,CAACA,EAAQ,aAAeA,GAAWA,EAAQ,cAAgB,OAC7E,UAAU,OAAO,KAAK,QAAQ,MAAMA,CAAO,EAAG,UAAU,EAE1D,KAAK,QAAQ,MAAMA,CAAO,CAClC,CACF,CAAA,EAAG,CAAC,CACH,IAAK,WACL,MAAO,SAAkBogB,EAAM,CAC7B,OAAO,IAAI0nD,EAAgB1nD,EAAK,OAAO,CACxC,CACF,CAAA,CAAC,EACK0nD,CACR,EAACpL,CAAI,EACN,SAAInwB,IAAiB,SAAYu7B,EAAiB,OAAQtnE,EAAI,EACvDsnE,CACT,EAAG,CACD,QAAS,GACT,OAAQ,EACV,CAAC,EACDA,GAAA,sBAAgCC,cCjM5B3uE,GAAyBY,GAC7B,OAAO,eAAeiuE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAI/qD,IAAmB9jB,GAAuBuD,GAAA,CAAgD,EAC1FwgB,IAAgB/jB,GAAuB8E,GAAA,CAA6C,EACpFugE,IAAarlE,GAAuBuH,GAAA,CAA0C,EAC9E+9D,IAA8BtlE,GAAuBsc,GAAA,CAA2D,EAChHipD,GAAmBvlE,GAAuB8lB,GAAA,CAAgD,EAC1FqtB,IAAmBnzC,GAAuBy4B,GAAA,CAAgD,EAC1F5zB,GAAM6zB,GACN9S,IAAW+S,EACX0vC,GAAazvC,GACjB,SAAS6sC,IAAaC,EAAS,CAAE,IAAIC,EAA4BC,IAAyB,EAAI,OAAO,UAAgC,CAAE,IAAIC,KAAYN,GAAiB,SAAYG,CAAO,EAAG7sD,EAAQ,GAAI8sD,EAA2B,CAAE,IAAIG,KAAgBP,GAAiB,SAAY,IAAI,EAAE,YAAa1sD,EAAS,QAAQ,UAAUgtD,EAAO,UAAWC,CAAS,CAAE,MAAUjtD,EAASgtD,EAAM,MAAM,KAAM,SAAS,EAAK,SAAWP,IAA4B,SAAY,KAAMzsD,CAAM,CAAI,CAAG,CAC5d,SAAS+sD,KAA4B,CAA0E,GAApE,OAAO,QAAY,KAAe,CAAC,QAAQ,WAA6B,QAAQ,UAAU,KAAM,MAAO,GAAO,GAAI,OAAO,OAAU,WAAY,MAAO,GAAM,GAAI,CAAE,eAAQ,UAAU,QAAQ,KAAK,QAAQ,UAAU,QAAS,GAAI,UAAY,CAAE,CAAA,CAAC,EAAU,EAAO,MAAW,CAAE,MAAO,GAAU,CACzU,IAAIx+D,GAAO,YACPia,IAAe,CAAC,MAAM,EACtBytD,OAAqClpD,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC7F,IAAIq9C,EAAOr9C,EAAK,KAShB,SAASumD,EAA8B9oE,EAAM8jE,EAAaC,EAAU,CAClE,IAAIE,KAAiBU,GAAW,eAAe3kE,EAAM8jE,EAAaC,CAAQ,EACtEuG,EAAS,CAAA,EACTe,KAAsB1G,GAAW,eAAe3kE,EAAK,MAAO8jE,EAAaC,CAAQ,EAErF,GADAuG,EAAO,MAAQe,IAAoB,MAAQA,GAAmBpH,GAAcH,IAAgB,MACxF9jE,EAAK,KAAM,CACb,IAAIsrE,KAAqB3G,GAAW,eAAe3kE,EAAK,KAAM8jE,EAAaC,CAAQ,EACnFuG,EAAO,KAAOgB,IAAmB,MAAQA,GAAkBrH,GAAcH,IAAgB,KAC1F,CACD,IAAIyH,KAAoB5G,GAAW,eAAe3kE,EAAK,IAAK8jE,EAAaC,CAAQ,EACjF,OAAAuG,EAAO,IAAMiB,IAAkB,MAAQA,GAAiBtH,GAAcH,IAAgB,MAC/EwG,CACR,CACD,IAAIa,EAAyB,SAAU5I,EAAO,IACxCZ,IAAW,SAAYwJ,EAAW5I,CAAK,EAC3C,IAAIC,EAAST,IAAaoJ,CAAS,EASnC,SAASA,EAAU54D,EAAOC,EAAKuO,EAAM,CACnC,IAAI2V,EAIJ,MAHItW,IAAiB,SAAY,KAAM+qD,CAAS,EAChDz0C,EAAQ8rC,EAAO,KAAK,IAAI,EAEpB,IAAKrhE,GAAI,QAAQoR,CAAK,EAAG,MAAM,IAAI,UAAU,eAAe,EAChE,GAAI,IAAKpR,GAAI,QAAQqR,CAAG,EAAG,MAAM,IAAI,UAAU,eAAe,EAC9D,GAAIuO,GAAQ,IAAK5f,GAAI,QAAQ4f,CAAI,EAAG,MAAM,IAAI,UAAU,eAAe,EACvE,GAAI,UAAU,OAAS,EAAG,MAAM,IAAI,MAAM,oBAAoB,EAC9D,OAAA2V,EAAM,MAAQnkB,EACdmkB,EAAM,IAAMlkB,EACZkkB,EAAM,KAAO3V,GAAQ,KACd2V,CACR,CACD,SAAIrW,IAAc,SAAY8qD,EAAW,CAAC,CACxC,IAAK,OACL,IAAK,UAAe,CAClB,OAAOznE,EACR,CACP,EAAO,CACD,IAAK,cACL,IAAK,UAAe,CAClB,MAAO,EACR,CAOP,EAAO,CACD,IAAK,WACL,MAAO,UAAoB,CAEzB,IAAI8nE,EAAa,KAAK,OAAO,SAAUxrE,EAAM,CAC3C,SAAWmB,GAAI,cAAcnB,CAAI,GAAKA,EAAK,OAAS,KAC9D,CAAS,EACD,OAAOwrE,EAAW,OAAS,CAC5B,CAeP,EAAO,CACD,IAAK,WACL,MAAO,SAAkBlL,EAAMC,EAAU,CACvC,IAAI7qC,EAAQ4qC,EAAK,MACbmL,EAAY,KAAK,MAAM,SAASnL,EAAMC,CAAQ,EAC9CmL,EAAU,KAAK,IAAI,SAASpL,EAAMC,CAAQ,EAC9C,GAAI,KAAK,KAAM,CACb,IAAIoL,EAAW,KAAK,KAAK,SAASrL,EAAMC,CAAQ,EAChD,OAAO,SAAuBziD,EAAO3U,EAAMi3D,EAAS,CAClD,OAAO1qC,EAAM+1C,EAAU3tD,EAAO3U,EAAMi3D,CAAO,EAAGsL,EAAQ5tD,EAAO3U,EAAMi3D,CAAO,EAAGuL,EAAS7tD,EAAO3U,EAAMi3D,CAAO,CAAC,CACvH,CACA,KACU,QAAO,SAAuBtiD,EAAO3U,EAAMi3D,EAAS,CAClD,OAAO1qC,EAAM+1C,EAAU3tD,EAAO3U,EAAMi3D,CAAO,EAAGsL,EAAQ5tD,EAAO3U,EAAMi3D,CAAO,CAAC,CACvF,CAEO,CAMP,EAAO,CACD,IAAK,UACL,MAAO,SAAiB7+D,EAAU,CAChCA,EAAS,KAAK,MAAO,QAAS,IAAI,EAClCA,EAAS,KAAK,IAAK,MAAO,IAAI,EAC1B,KAAK,MACPA,EAAS,KAAK,KAAM,OAAQ,IAAI,CAEnC,CAQP,EAAO,CACD,IAAK,MACL,MAAO,SAAaA,EAAU,CAC5B,OAAO,IAAI4pE,EAAU,KAAK,QAAQ5pE,EAAS,KAAK,MAAO,QAAS,IAAI,CAAC,EAAG,KAAK,QAAQA,EAAS,KAAK,IAAK,MAAO,IAAI,CAAC,EAAG,KAAK,MAAQ,KAAK,QAAQA,EAAS,KAAK,KAAM,OAAQ,IAAI,CAAC,CAAC,CACpL,CAMP,EAAO,CACD,IAAK,QACL,MAAO,UAAiB,CACtB,OAAO,IAAI4pE,EAAU,KAAK,MAAO,KAAK,IAAK,KAAK,MAAQ,KAAK,IAAI,CAClE,CAOP,EAAO,CACD,IAAK,YACL,MAAO,SAAmBjoE,EAAS,CACjC,IAAI4gE,EAAc5gE,GAAWA,EAAQ,YAAcA,EAAQ,YAAc,OACrEonE,EAASxB,EAA8B,KAAMhF,EAAa5gE,GAAWA,EAAQ,QAAQ,EAGrFR,EACA6P,EAAQ,KAAK,MAAM,SAASrP,CAAO,EAKvC,GAJIonE,EAAO,QACT/3D,EAAQ,IAAMA,EAAQ,KAExB7P,EAAM6P,EACF,KAAK,KAAM,CACb,IAAIwO,EAAO,KAAK,KAAK,SAAS7d,CAAO,EACjConE,EAAO,OACTvpD,EAAO,IAAMA,EAAO,KAEtBre,GAAO,IAAMqe,CACd,CACD,IAAIvO,EAAM,KAAK,IAAI,SAAStP,CAAO,EACnC,OAAIonE,EAAO,MACT93D,EAAM,IAAMA,EAAM,KAEpB9P,GAAO,IAAM8P,EACN9P,CACR,CAMP,EAAO,CACD,IAAK,SACL,MAAO,UAAkB,CACvB,MAAO,CACL,OAAQgB,GACR,MAAO,KAAK,MACZ,IAAK,KAAK,IACV,KAAM,KAAK,IACrB,CACO,CAUP,EAAO,CACD,IAAK,SACL,MAMA,SAAgBR,EAAS,CACvB,IAAI4gE,EAAc5gE,GAAWA,EAAQ,YAAcA,EAAQ,YAAc,OACrEonE,EAASxB,EAA8B,KAAMhF,EAAa5gE,GAAWA,EAAQ,QAAQ,EAGrFR,EACA6P,EAAQ,KAAK,MAAM,OAAOrP,CAAO,EAKrC,GAJIonE,EAAO,QACT/3D,EAAQ,iEAAmEA,EAAQ,kEAErF7P,EAAM6P,EACF,KAAK,KAAM,CACb,IAAIwO,EAAO,KAAK,KAAK,OAAO7d,CAAO,EAC/BonE,EAAO,OACTvpD,EAAO,iEAAmEA,EAAO,kEAEnFre,GAAO,2DAA6Dqe,CACrE,CACD,IAAIvO,EAAM,KAAK,IAAI,OAAOtP,CAAO,EACjC,OAAIonE,EAAO,MACT93D,EAAM,iEAAmEA,EAAM,kEAEjF9P,GAAO,2DAA6D8P,EAC7D9P,CACR,CAOP,EAAO,CACD,IAAK,SACL,MAAO,SAAgBQ,EAAS,CAC9B,IAAI4gE,EAAc5gE,GAAWA,EAAQ,YAAcA,EAAQ,YAAc,OACrEonE,EAASxB,EAA8B,KAAMhF,EAAa5gE,GAAWA,EAAQ,QAAQ,EACrFR,EAAM,KAAK,MAAM,MAAMQ,CAAO,EAIlC,GAHIonE,EAAO,QACT5nE,EAAM,UAAU,OAAOA,EAAK,UAAU,GAEpC,KAAK,KAAM,CACb,IAAIqe,EAAO,KAAK,KAAK,MAAM7d,CAAO,EAC9BonE,EAAO,OACTvpD,EAAO,UAAU,OAAOA,EAAM,UAAU,GAE1Cre,GAAO,IAAMqe,CACd,CACD,IAAIvO,EAAM,KAAK,IAAI,MAAMtP,CAAO,EAChC,OAAIonE,EAAO,MACT93D,EAAM,UAAU,OAAOA,EAAK,UAAU,GAExC9P,GAAO,IAAM8P,EACN9P,CACR,CACF,CAAA,EAAG,CAAC,CACH,IAAK,WACL,MAAO,SAAkB4gB,EAAM,CAC7B,OAAO,IAAI6nD,EAAU7nD,EAAK,MAAOA,EAAK,IAAKA,EAAK,IAAI,CACrD,CACF,CAAA,CAAC,EACK6nD,CACR,EAACvL,CAAI,EACN,SAAInwB,IAAiB,SAAY07B,EAAW,OAAQznE,EAAI,EACjDynE,CACT,EAAG,CACD,QAAS,GACT,OAAQ,EACV,CAAC,EACDA,GAAA,gBAA0BC,cCnStB9uE,GAAyBY,GAC7B,OAAO,eAAe0uE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAIxrD,IAAmB9jB,GAAuBuD,GAAA,CAAgD,EAC1FwgB,IAAgB/jB,GAAuB8E,GAAA,CAA6C,EACpFugE,IAAarlE,GAAuBuH,GAAA,CAA0C,EAC9E+9D,IAA8BtlE,GAAuBsc,GAAA,CAA2D,EAChHipD,GAAmBvlE,GAAuB8lB,GAAA,CAAgD,EAC1FqtB,IAAmBnzC,GAAuBy4B,GAAA,CAAgD,EAC1F4vC,GAAa3vC,GACbpa,IAAUqa,GACV3U,IAAW4U,GACXgyC,IAASzb,GAAA,EACTvpC,IAAWwiD,EACf,SAAS3C,IAAaC,EAAS,CAAE,IAAIC,EAA4BC,IAAyB,EAAI,OAAO,UAAgC,CAAE,IAAIC,KAAYN,GAAiB,SAAYG,CAAO,EAAG7sD,EAAQ,GAAI8sD,EAA2B,CAAE,IAAIG,KAAgBP,GAAiB,SAAY,IAAI,EAAE,YAAa1sD,EAAS,QAAQ,UAAUgtD,EAAO,UAAWC,CAAS,CAAE,MAAUjtD,EAASgtD,EAAM,MAAM,KAAM,SAAS,EAAK,SAAWP,IAA4B,SAAY,KAAMzsD,CAAM,CAAI,CAAG,CAC5d,SAAS+sD,KAA4B,CAA0E,GAApE,OAAO,QAAY,KAAe,CAAC,QAAQ,WAA6B,QAAQ,UAAU,KAAM,MAAO,GAAO,GAAI,OAAO,OAAU,WAAY,MAAO,GAAM,GAAI,CAAE,eAAQ,UAAU,QAAQ,KAAK,QAAQ,UAAU,QAAS,GAAI,UAAY,CAAE,CAAA,CAAC,EAAU,EAAO,MAAW,CAAE,MAAO,GAAU,CACzU,IAAIx+D,GAAO,iBACPia,IAAe,CAAC,MAAM,EACtBkuD,OAA0C3pD,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAClG,IAAIq9C,EAAOr9C,EAAK,KACZupD,EAAc,CAChB,MAAO,KACP,QAAS,KACT,QAAS,IACT,OAAQ,IACR,UAAW,KACX,SAAU,IACd,EACMF,EAA8B,SAAUrJ,EAAO,IAC7CZ,IAAW,SAAYiK,EAAgBrJ,CAAK,EAChD,IAAIC,EAAST,IAAa6J,CAAc,EAYxC,SAASA,EAAeG,EAAc7lE,EAAQ,CAC5C,IAAIwwB,EAGJ,MAFItW,IAAiB,SAAY,KAAMwrD,CAAc,EACrDl1C,EAAQ8rC,EAAO,KAAK,IAAI,EACpB,CAAC,MAAM,QAAQuJ,CAAY,EAC7B,MAAM,IAAI,UAAU,yCAAyC,EAE/D,GAAI,CAAC,MAAM,QAAQ7lE,CAAM,EACvB,MAAM,IAAI,UAAU,mCAAmC,EAEzD,GAAI6lE,EAAa,SAAW7lE,EAAO,OAAS,EAC1C,MAAM,IAAI,UAAU,oFAAyF,EAE/G,OAAAwwB,EAAM,aAAeq1C,EACrBr1C,EAAM,OAASxwB,EACRwwB,CACR,CACD,SAAIrW,IAAc,SAAYurD,EAAgB,CAAC,CAC7C,IAAK,OACL,IAAK,UAAe,CAClB,OAAOloE,EACR,CACP,EAAO,CACD,IAAK,mBACL,IAAK,UAAe,CAClB,MAAO,EACR,CAeP,EAAO,CACD,IAAK,WACL,MAAO,SAAkB48D,EAAMC,EAAU,CACvC,IAAIzxD,EAAO,KACPk9D,EAAW,KAAK,OAAO,IAAI,SAAU,EAAG,CAC1C,OAAO,EAAE,SAAS1L,EAAMC,CAAQ,CAC1C,CAAS,EACD,OAAO,SAA4BziD,EAAO3U,EAAMi3D,EAAS,CAGvD,QAFI6L,EACAC,EAAUF,EAAS,CAAC,EAAEluD,EAAO3U,EAAMi3D,CAAO,EACrCzjE,EAAI,EAAGA,EAAImS,EAAK,aAAa,OAAQnS,IAAK,CACjDsvE,EAAUC,EACVA,EAAUF,EAASrvE,EAAI,CAAC,EAAEmhB,EAAO3U,EAAMi3D,CAAO,EAC9C,IAAI+L,KAAa7rD,IAAS,iBAAiBggD,EAAMxxD,EAAK,aAAanS,CAAC,CAAC,EACrE,GAAI,CAACwvE,EAAOF,EAASC,CAAO,EAC1B,MAAO,EAEV,CACD,MAAO,EACjB,CACO,CAMP,EAAO,CACD,IAAK,UACL,MAAO,SAAiB3qE,EAAU,CAChC,IAAI6qE,EAAS,KACb,KAAK,OAAO,QAAQ,SAAU92D,EAAG3Y,EAAG,CAClC,OAAO4E,EAAS+T,EAAG,UAAY3Y,EAAI,IAAKyvE,CAAM,CAC/C,EAAE,IAAI,CACR,CAQP,EAAO,CACD,IAAK,MACL,MAAO,SAAa7qE,EAAU,CAC5B,IAAI8qE,EAAS,KACb,OAAO,IAAIT,EAAe,KAAK,aAAa,MAAK,EAAI,KAAK,OAAO,IAAI,SAAUt2D,EAAG3Y,EAAG,CACnF,OAAO0vE,EAAO,QAAQ9qE,EAAS+T,EAAG,UAAY3Y,EAAI,IAAK0vE,CAAM,CAAC,CACxE,EAAW,IAAI,CAAC,CACT,CAMP,EAAO,CACD,IAAK,QACL,MAAO,UAAiB,CACtB,OAAO,IAAIT,EAAe,KAAK,aAAc,KAAK,MAAM,CACzD,CAOP,EAAO,CACD,IAAK,YACL,MAAO,SAAmB1oE,EAAS,CAQjC,QAPI4gE,EAAc5gE,GAAWA,EAAQ,YAAcA,EAAQ,YAAc,OACrE+gE,KAAiBU,GAAW,eAAe,KAAMb,EAAa5gE,GAAWA,EAAQ,QAAQ,EACzFopE,EAAe,KAAK,OAAO,IAAI,SAAUhlE,EAAG8B,EAAO,CACrD,IAAImjE,KAAsB5H,GAAW,eAAer9D,EAAGw8D,EAAa5gE,GAAWA,EAAQ,QAAQ,EAC/F,OAAO4gE,IAAgB,OAASyI,IAAoB,MAAQA,GAAmBtI,EAAa,IAAM38D,EAAE,SAASpE,CAAO,EAAI,IAAMoE,EAAE,SAASpE,CAAO,CAC1J,CAAS,EACGu0B,EAAM60C,EAAa,CAAC,EACf3vE,EAAI,EAAGA,EAAI,KAAK,aAAa,OAAQA,IAC5C86B,GAAO,IAAMq0C,EAAY,KAAK,aAAanvE,CAAC,CAAC,EAC7C86B,GAAO,IAAM60C,EAAa3vE,EAAI,CAAC,EAEjC,OAAO86B,CACR,CAMP,EAAO,CACD,IAAK,SACL,MAAO,UAAkB,CACvB,MAAO,CACL,OAAQ/zB,GACR,aAAc,KAAK,aACnB,OAAQ,KAAK,MACvB,CACO,CAUP,EAAO,CACD,IAAK,SACL,MAMA,SAAgBR,EAAS,CAQvB,QAPI4gE,EAAc5gE,GAAWA,EAAQ,YAAcA,EAAQ,YAAc,OACrE+gE,KAAiBU,GAAW,eAAe,KAAMb,EAAa5gE,GAAWA,EAAQ,QAAQ,EACzFopE,EAAe,KAAK,OAAO,IAAI,SAAUhlE,EAAG8B,EAAO,CACrD,IAAImjE,KAAsB5H,GAAW,eAAer9D,EAAGw8D,EAAa5gE,GAAWA,EAAQ,QAAQ,EAC/F,OAAO4gE,IAAgB,OAASyI,IAAoB,MAAQA,GAAmBtI,EAAa,iEAAmE38D,EAAE,OAAOpE,CAAO,EAAI,iEAAmEoE,EAAE,OAAOpE,CAAO,CAChR,CAAS,EACGu0B,EAAM60C,EAAa,CAAC,EACf3vE,EAAI,EAAGA,EAAI,KAAK,aAAa,OAAQA,IAC5C86B,GAAO,qFAA6F7c,IAAQ,QAAQkxD,EAAY,KAAK,aAAanvE,CAAC,CAAC,CAAC,EAAI,UAAY2vE,EAAa3vE,EAAI,CAAC,EAEzL,OAAO86B,CACR,CAOP,EAAO,CACD,IAAK,SACL,MAAO,SAAgBv0B,EAAS,CAQ9B,QAPI4gE,EAAc5gE,GAAWA,EAAQ,YAAcA,EAAQ,YAAc,OACrE+gE,KAAiBU,GAAW,eAAe,KAAMb,EAAa5gE,GAAWA,EAAQ,QAAQ,EACzFopE,EAAe,KAAK,OAAO,IAAI,SAAUhlE,EAAG8B,EAAO,CACrD,IAAImjE,KAAsB5H,GAAW,eAAer9D,EAAGw8D,EAAa5gE,GAAWA,EAAQ,QAAQ,EAC/F,OAAO4gE,IAAgB,OAASyI,IAAoB,MAAQA,GAAmBtI,EAAa,UAAY38D,EAAE,MAAMpE,CAAO,EAAI,UAAYoE,EAAE,MAAMpE,CAAO,CAChK,CAAS,EACGu0B,EAAM60C,EAAa,CAAC,EACf3vE,EAAI,EAAGA,EAAI,KAAK,aAAa,OAAQA,IAC5C86B,GAAOyvC,IAAO,eAAe,KAAK,aAAavqE,CAAC,CAAC,EAAI2vE,EAAa3vE,EAAI,CAAC,EAEzE,OAAO86B,CACR,CACF,CAAA,EAAG,CAAC,CACH,IAAK,WACL,MAAO,SAAkBnU,EAAM,CAC7B,OAAO,IAAIsoD,EAAetoD,EAAK,aAAcA,EAAK,MAAM,CACzD,CACF,CAAA,CAAC,EACKsoD,CACR,EAAChM,CAAI,EACN,SAAInwB,IAAiB,SAAYm8B,EAAgB,OAAQloE,EAAI,EACtDkoE,CACT,EAAG,CACD,QAAS,GACT,OAAQ,EACV,CAAC,EACDA,GAAA,qBAA+BC,cCrP3BvvE,GAAyBY,GAC7B,OAAO,eAAesvE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIpsD,IAAmB9jB,GAAuBuD,GAAA,CAAgD,EAC1FwgB,IAAgB/jB,GAAuB8E,GAAA,CAA6C,EACpFugE,IAAarlE,GAAuBuH,GAAA,CAA0C,EAC9E+9D,IAA8BtlE,GAAuBsc,GAAA,CAA2D,EAChHipD,GAAmBvlE,GAAuB8lB,GAAA,CAAgD,EAC1FxH,IAAUma,GACVzU,IAAW0U,GACX9S,IAAW+S,EACXiyC,IAAShyC,GAAA,EACb,SAAS6sC,IAAaC,EAAS,CAAE,IAAIC,EAA4BC,IAAyB,EAAI,OAAO,UAAgC,CAAE,IAAIC,KAAYN,GAAiB,SAAYG,CAAO,EAAG7sD,EAAQ,GAAI8sD,EAA2B,CAAE,IAAIG,KAAgBP,GAAiB,SAAY,IAAI,EAAE,YAAa1sD,EAAS,QAAQ,UAAUgtD,EAAO,UAAWC,CAAS,CAAE,MAAUjtD,EAASgtD,EAAM,MAAM,KAAM,SAAS,EAAK,SAAWP,IAA4B,SAAY,KAAMzsD,CAAM,CAAI,CAAG,CAC5d,SAAS+sD,KAA4B,CAA0E,GAApE,OAAO,QAAY,KAAe,CAAC,QAAQ,WAA6B,QAAQ,UAAU,KAAM,MAAO,GAAO,GAAI,OAAO,OAAU,WAAY,MAAO,GAAM,GAAI,CAAE,eAAQ,UAAU,QAAQ,KAAK,QAAQ,UAAU,QAAS,GAAI,UAAY,CAAE,CAAA,CAAC,EAAU,EAAO,MAAW,CAAE,MAAO,GAAU,CACzU,IAAIx+D,IAAO,aACPia,IAAe,CAAC,OAAQ,QAAS,MAAM,EACvC8uD,OAAsCvqD,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CAC9F,IAAI+9C,EAAO/9C,EAAK,KACdmvC,EAAOnvC,EAAK,KACZq9C,EAAOr9C,EAAK,KAMd,SAASmqD,EAAgBhpE,EAAM,CAC7B,OAAOguD,EAAOA,EAAK,gBAAgBhuD,CAAI,EAAI,EAC5C,CACD,IAAI8oE,EAA0B,SAAUjK,EAAO,IACzCZ,IAAW,SAAY6K,EAAYjK,CAAK,EAC5C,IAAIC,EAAST,IAAayK,CAAU,EAQpC,SAASA,EAAW9oE,EAAM,CACxB,IAAIgzB,EAIJ,MAHItW,IAAiB,SAAY,KAAMosD,CAAU,EACjD91C,EAAQ8rC,EAAO,KAAK,IAAI,EAEpB,OAAO9+D,GAAS,SAClB,MAAM,IAAI,UAAU,sCAAsC,EAE5D,OAAAgzB,EAAM,KAAOhzB,EACNgzB,CACR,CACD,SAAIrW,IAAc,SAAYmsD,EAAY,CAAC,CACzC,IAAK,OACL,IAAK,UAAe,CAClB,MAAO,YACR,CACP,EAAO,CACD,IAAK,eACL,IAAK,UAAe,CAClB,MAAO,EACR,CAeP,EAAO,CACD,IAAK,WACL,MAAO,SAAkBlM,EAAMC,EAAU,CACvC,IAAI78D,EAAO,KAAK,KAChB,GAAI68D,EAAS78D,CAAI,IAAM,GAIrB,OAAO,SAAUoa,EAAO3U,EAAMi3D,EAAS,CACrC,OAAOj3D,EAAKzF,CAAI,CAC5B,EACe,GAAIA,KAAQ48D,EACjB,OAAO,SAAUxiD,EAAO3U,EAAMi3D,EAAS,CACrC,OAAOtiD,EAAM,IAAIpa,CAAI,EAAIoa,EAAM,IAAIpa,CAAI,KAAQ4c,IAAS,iBAAiBggD,EAAM58D,CAAI,CAC/F,EAEU,IAAIjE,EAASitE,EAAgBhpE,CAAI,EACjC,OAAO,SAAUoa,EAAO3U,EAAMi3D,EAAS,CACrC,OAAOtiD,EAAM,IAAIpa,CAAI,EAAIoa,EAAM,IAAIpa,CAAI,EAAIjE,EAAS,IAAIiyD,EAAK,KAAMhuD,CAAI,EAAI8oE,EAAW,kBAAkB9oE,CAAI,CACxH,CAEO,CAMP,EAAO,CACD,IAAK,UACL,MAAO,SAAiBnC,EAAU,CAEjC,CAQP,EAAO,CACD,IAAK,MACL,MAAO,SAAaA,EAAU,CAC5B,OAAO,KAAK,OACb,CAMP,EAAO,CACD,IAAK,QACL,MAKA,UAAiB,CACf,OAAO,IAAIirE,EAAW,KAAK,IAAI,CAChC,CAQP,EAAO,CACD,IAAK,YACL,MAAO,SAAmBtpE,EAAS,CACjC,OAAO,KAAK,IACb,CAQP,EAAO,CACD,IAAK,SACL,MAAO,SAAgBA,EAAS,CAC9B,IAAIQ,KAAWkX,IAAQ,QAAQ,KAAK,IAAI,EACxC,OAAIlX,IAAS,QAAUA,IAAS,QACvB,0CAA4CA,EAAO,UACjDA,IAAS,IACX,mDAAqDA,EAAO,UAC1DA,IAAS,WACX,kDAAoDA,EAAO,UACzDA,IAAS,MACX,6CAA+CA,EAAO,UACpDA,IAAS,OACX,8CAAgDA,EAAO,UACrDA,IAAS,YACX,mDAAqDA,EAAO,UAE9D,6BAA+BA,EAAO,SAC9C,CAMP,EAAO,CACD,IAAK,SACL,MAAO,UAAkB,CACvB,MAAO,CACL,OAAQ,aACR,KAAM,KAAK,IACrB,CACO,CASP,EAAO,CACD,IAAK,SACL,MAOA,SAAgBR,EAAS,CACvB,IAAIzD,EAAS,GACT,OAAO6gE,EAAK,KAAK,IAAI,EAAM,KAAeoM,EAAgB,KAAK,IAAI,IACrEjtE,EAAS,IAEX,IAAIygE,KAAagH,IAAO,UAAU,KAAK,KAAMznE,CAAM,EACnD,OAAIygE,EAAO,CAAC,IAAM,KAETA,EAIF,IAAMA,CACd,CACF,CAAA,EAAG,CAAC,CACH,IAAK,oBACL,MAAO,SAA2Bx8D,EAAM,CACtC,MAAM,IAAI,MAAM,oBAAsBA,CAAI,CAC3C,CACP,EAAO,CACD,IAAK,WACL,MAAO,SAAkB4f,EAAM,CAC7B,OAAO,IAAIkpD,EAAWlpD,EAAK,IAAI,CAChC,CACF,CAAA,CAAC,EACKkpD,CACR,EAAC5M,CAAI,EACN,OAAO4M,CACT,EAAG,CACD,QAAS,GACT,OAAQ,EACV,CAAC,EACDA,GAAA,iBAA2BC,6FC5O3B,IAAIE,EAAiBzvE,KACrB,SAAS0vE,EAAe1sE,EAAQiC,EAAU,CACxC,KAAO,CAAC,OAAO,UAAU,eAAe,KAAKjC,EAAQiC,CAAQ,IAC3DjC,EAASysE,EAAezsE,CAAM,EAC1BA,IAAW,OAAf,CAEF,OAAOA,CACR,CACD1D,EAAA,QAAiBowE,EAAgBpwE,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,4ECRtG,IAAIqwE,EAAgB3vE,MACpB,SAASm4B,GAAO,CACd,OAAI,OAAO,QAAY,KAAe,QAAQ,KAC5C74B,EAAA,QAAiB64B,EAAO,QAAQ,IAAI,KAAI,EAAI74B,EAAA,QAAA,WAA4B,GAAMA,EAAO,QAAQ,QAAaA,EAAO,UAEjHA,EAAA,QAAiB64B,EAAO,SAAc34B,EAAQyF,EAAU2qE,EAAU,CAChE,IAAIv3D,EAAOs3D,EAAcnwE,EAAQyF,CAAQ,EACzC,GAAKoT,EACL,KAAIk5C,EAAO,OAAO,yBAAyBl5C,EAAMpT,CAAQ,EACzD,OAAIssD,EAAK,IACAA,EAAK,IAAI,KAAK,UAAU,OAAS,EAAI/xD,EAASowE,CAAQ,EAExDre,EAAK,MAClB,EAAOjyD,EAAA,QAAA,WAA4B,GAAMA,EAAO,QAAQ,QAAaA,EAAO,SAEnE64B,EAAK,MAAM,KAAM,SAAS,CAClC,CACD74B,EAAA,QAAiB64B,EAAM74B,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO,yECf5F,OAAO,eAAeshB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAGivD,EACzB,IAAI5qD,EAAOjlB,GAcX,SAAS6vE,EAAeC,EAAa,CACnC,QAASzrD,EAAO,UAAU,OAAQpY,EAAO,IAAI,MAAMoY,EAAO,EAAIA,EAAO,EAAI,CAAC,EAAGE,EAAO,EAAGA,EAAOF,EAAME,IAClGtY,EAAKsY,EAAO,CAAC,EAAI,UAAUA,CAAI,EAEjC,OAAI,OAAOurD,EAAY,gBAAmB,WACjC7qD,EAAK,OAAO,MAAM,OAAQ,CAAC6qD,EAAY,gBAAgB,EAAE,OAAO7jE,CAAI,CAAC,EAEvEgZ,EAAK,OAAO,MAAM,OAAQ,IAAKA,EAAK,gBAAiB,EAAE6qD,CAAW,EAAE,OAAO7jE,CAAI,CAAC,CACzF,WC1BA,IAAI7M,GAAyBY,GAC7B,OAAO,eAAe+vE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIv/B,IAAsBpxC,GAAuBuD,GAAA,CAAmD,EAChGugB,IAAmB9jB,GAAuB8E,GAAA,CAAgD,EAC1Fif,IAAgB/jB,GAAuBuH,GAAA,CAA6C,EACpFqpE,GAAQ5wE,GAAuBsc,IAAA,CAAqC,EACpE+oD,IAAarlE,GAAuB8lB,GAAA,CAA0C,EAC9Ew/C,IAA8BtlE,GAAuBy4B,GAAA,CAA2D,EAChH8sC,GAAmBvlE,GAAuB04B,GAAA,CAAgD,EAC1Fya,GAAmBnzC,GAAuB24B,GAAA,CAAgD,EAC1Fr1B,GAAWtD,GAAuB44B,EAAwC,EAC1E/zB,GAAMsqD,GACN7wC,GAAU8pD,GACV9hE,GAAUgiE,GACVtkD,GAAW+mD,GACX8F,GAASC,GAAA,EACTlrD,IAAWmrD,EACXnG,GAASoG,GAAA,EACb,SAASvL,IAAaC,EAAS,CAAE,IAAIC,EAA4BC,IAAyB,EAAI,OAAO,UAAgC,CAAE,IAAIC,KAAYN,GAAiB,SAAYG,CAAO,EAAG7sD,EAAQ,GAAI8sD,EAA2B,CAAE,IAAIG,KAAgBP,GAAiB,SAAY,IAAI,EAAE,YAAa1sD,EAAS,QAAQ,UAAUgtD,EAAO,UAAWC,CAAS,CAAE,MAAUjtD,EAASgtD,EAAM,MAAM,KAAM,SAAS,EAAK,SAAWP,IAA4B,SAAY,KAAMzsD,CAAM,CAAI,CAAG,CAC5d,SAAS+sD,KAA4B,CAA0E,GAApE,OAAO,QAAY,KAAe,CAAC,QAAQ,WAA6B,QAAQ,UAAU,KAAM,MAAO,GAAO,GAAI,OAAO,OAAU,WAAY,MAAO,GAAM,GAAI,CAAE,eAAQ,UAAU,QAAQ,KAAK,QAAQ,UAAU,QAAS,GAAI,UAAY,CAAE,CAAA,CAAC,EAAU,EAAO,MAAW,CAAE,MAAO,GAAU,CACzU,IAAIx+D,GAAO,eACPia,IAAe,CAAC,OAAQ,OAAQ,YAAY,EAC5C4vD,OAAwCrrD,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAChG,IAAI+9C,EAAO/9C,EAAK,KACdq9C,EAAOr9C,EAAK,KACZiqD,EAAajqD,EAAK,WAEhBirD,EAAQ,SAAe5nE,EAAQ,CACjC,SAAWgV,GAAQ,QAAQhV,EAAQ,CACjC,SAAU,EAChB,CAAK,CACL,EAUE,SAAS6nE,EAAe7nB,EAAU5lD,EAAMkD,EAAS,CAQ/C,QAPIsjE,EAAQ,GAIRkH,EAAQ,qDACRC,EAAW,EACXrnE,GACIA,EAAQonE,EAAM,KAAK9nB,CAAQ,KAAO,MAKxC,GAFA4gB,GAAS5gB,EAAS,UAAU+nB,EAAUrnE,EAAM,KAAK,EACjDqnE,EAAWrnE,EAAM,MACbA,EAAM,CAAC,IAAM,KAEfkgE,GAAS,IACTmH,QACK,CAELA,GAAYrnE,EAAM,CAAC,EAAE,OACrB,IAAInE,EAAWnC,EAAKsG,EAAM,CAAC,CAAC,EAC5B,GAAI,CAACnE,EACH,MAAM,IAAI,eAAe,sBAAwBmE,EAAM,CAAC,EAAI,kBAAkB,EAEhF,GAAIA,EAAM,CAAC,IAAM,OAEf,UAAY1G,GAAS,SAAYuC,CAAQ,EAAC,CACxC,IAAK,SACHqkE,GAASrkE,EACT,MACF,IAAK,SACH,MAAQhB,GAAI,QAAQgB,CAAQ,EAC1BqkE,GAASrkE,EAAS,MAAMe,CAAO,UACtB,MAAM,QAAQf,CAAQ,EAE/BqkE,GAASrkE,EAAS,IAAI,SAAU2K,EAAK1D,EAAO,CAC1C,MAAQjI,GAAI,QAAQ2L,CAAG,EACrB,OAAOA,EAAI,MAAM5J,CAAO,EAE1B,MAAM,IAAI,UAAU,aAAeoD,EAAM,CAAC,EAAI,IAAM8C,EAAQ,kBAAkB,CAChG,CAAiB,EAAE,KAAK,GAAG,MAEX,OAAM,IAAI,UAAU,aAAe9C,EAAM,CAAC,EAAI,6CAA6C,EAE7F,MACF,QACE,MAAM,IAAI,UAAU,aAAeA,EAAM,CAAC,EAAI,6CAA6C,CAC9F,YAGOnF,GAAI,QAAQgB,EAASmE,EAAM,CAAC,CAAC,GAAKnE,EAASmE,EAAM,CAAC,CAAC,CAAC,EAC1DkgE,GAASrkE,EAASmE,EAAM,CAAC,CAAC,EAAE,MAAMpD,CAAO,MAEzC,OAAM,IAAI,UAAU,aAAeoD,EAAM,CAAC,EAAI,IAAMA,EAAM,CAAC,EAAI,kBAAkB,CAGtF,CAEH,OAAAkgE,GAAS5gB,EAAS,MAAM+nB,CAAQ,EAEzBnH,CACR,CACD,IAAIyG,EAA4B,SAAU1K,EAAO,IAC3CZ,IAAW,SAAYsL,EAAc1K,CAAK,EAC9C,IAAIC,EAAST,IAAakL,CAAY,EAUtC,SAASA,EAAannE,EAAIqD,EAAM,CAC9B,IAAIutB,EAQJ,MAPItW,IAAiB,SAAY,KAAM6sD,CAAY,EACnDv2C,EAAQ8rC,EAAO,KAAK,IAAI,EACpB,OAAO18D,GAAO,WAChBA,EAAK,IAAI0mE,EAAW1mE,CAAE,GAIpB,IAAK3E,GAAI,QAAQ2E,CAAE,EAAG,MAAM,IAAI,UAAU,iCAAiC,EAC/E,GAAI,CAAC,MAAM,QAAQqD,CAAI,GAAK,CAACA,EAAK,MAAMhI,GAAI,MAAM,EAChD,MAAM,IAAI,UAAU,sDAAsD,EAE5E,OAAAu1B,EAAM,GAAK5wB,EACX4wB,EAAM,KAAOvtB,GAAQ,GACdutB,CACR,CAGD,SAAIrW,IAAc,SAAY4sD,EAAc,CAAC,CAC3C,IAAK,OACL,IAAK,UAAe,CAClB,OAAO,KAAK,GAAG,MAAQ,EACxB,CACP,EAAO,CACD,IAAK,OACL,IAAK,UAAe,CAClB,OAAOvpE,EACR,CACP,EAAO,CACD,IAAK,iBACL,IAAK,UAAe,CAClB,MAAO,EACR,CAeP,EAAO,CACD,IAAK,WACL,MAAO,SAAkB48D,EAAMC,EAAU,CAEvC,IAAI0J,EAAW,KAAK,KAAK,IAAI,SAAUn9D,EAAK,CAC1C,OAAOA,EAAI,SAASwzD,EAAMC,CAAQ,CAC5C,CAAS,EACD,MAAQp/D,GAAI,cAAc,KAAK,EAAE,EAAG,CAClC,IAAI2I,EAAQ,KAAK,GAAG,KACpB,GAAKy2D,EAASz2D,CAAK,EA0DZ,CAEL,IAAI8jE,EAAW,KAAK,KACpB,OAAO,SAA0B9vD,EAAO3U,EAAMi3D,EAAS,CACrD,IAAIt6D,EAAKqD,EAAKW,CAAK,EACnB,GAAI,OAAOhE,GAAO,WAChB,MAAM,IAAI,UAAU,aAAa,OAAOgE,EAAO,kCAAkC,EAAE,OAAO0jE,EAAM1nE,CAAE,CAAC,CAAC,EAEtG,GAAIA,EAAG,QAEL,OAAOA,EAAG8nE,EAAUtN,KAAU6M,GAAO,gBAAgBrvD,EAAO3U,CAAI,EAAG2U,CAAK,EAExE,IAAI5c,EAAS+oE,EAAS,IAAI,SAAUI,EAAS,CAC3C,OAAOA,EAAQvsD,EAAO3U,EAAMi3D,CAAO,CACrD,CAAiB,EACD,OAAOt6D,EAAG,MAAMA,EAAI5E,CAAM,CAE1C,CACW,KA5EqB,CAGpB,IAAI4E,EAAKgE,KAASw2D,KAAWhgD,GAAS,iBAAiBggD,EAAMx2D,CAAK,EAAI,OAClE+jE,EAAQ,OAAO/nE,GAAO,YAAcA,EAAG,UAAY,GACnDgoE,EAAY,SAAmBhwD,EAAO,CACxC,IAAIxc,EACJ,GAAIwc,EAAM,IAAIhU,CAAK,EACjBxI,EAAQwc,EAAM,IAAIhU,CAAK,UACdA,KAASw2D,EAClBh/D,KAAYgf,GAAS,iBAAiBggD,EAAMx2D,CAAK,MAEjD,QAAOmjE,EAAa,oBAAoBnjE,CAAK,EAE/C,GAAI,OAAOxI,GAAU,WACnB,OAAOA,EAET,MAAM,IAAI,UAAU,IAAI,OAAOwI,EAAO;AAAA,GAAwC,EAAE,OAAO0jE,EAAMlsE,CAAK,CAAC,CAAC,CAClH,EACY,GAAIusE,EAAO,CAGT,IAAIE,EAAU,KAAK,KACnB,OAAO,SAA0BjwD,EAAO3U,EAAMi3D,EAAS,CACrD,IAAIt6D,EAAKgoE,EAAUhwD,CAAK,EACxB,OAAOhY,EAAGioE,EAASzN,KAAU6M,GAAO,gBAAgBrvD,EAAO3U,CAAI,EAAG2U,CAAK,CACvF,CACA,KAEc,QAAQmsD,EAAS,OAAM,CACrB,IAAK,GACH,OAAO,SAA0BnsD,EAAO3U,EAAMi3D,EAAS,CACrD,IAAIt6D,EAAKgoE,EAAUhwD,CAAK,EACxB,OAAOhY,EAAE,CAC7B,EACgB,IAAK,GACH,OAAO,SAA0BgY,EAAO3U,EAAMi3D,EAAS,CACrD,IAAIt6D,EAAKgoE,EAAUhwD,CAAK,EACpBosD,EAAWD,EAAS,CAAC,EACzB,OAAOnkE,EAAGokE,EAASpsD,EAAO3U,EAAMi3D,CAAO,CAAC,CAC5D,EACgB,IAAK,GACH,OAAO,SAA0BtiD,EAAO3U,EAAMi3D,EAAS,CACrD,IAAIt6D,EAAKgoE,EAAUhwD,CAAK,EACpBosD,EAAWD,EAAS,CAAC,EACrBG,EAAWH,EAAS,CAAC,EACzB,OAAOnkE,EAAGokE,EAASpsD,EAAO3U,EAAMi3D,CAAO,EAAGgK,EAAStsD,EAAO3U,EAAMi3D,CAAO,CAAC,CAC5F,EACgB,QACE,OAAO,SAA0BtiD,EAAO3U,EAAMi3D,EAAS,CACrD,IAAIt6D,EAAKgoE,EAAUhwD,CAAK,EACpB5c,EAAS+oE,EAAS,IAAI,SAAUI,EAAS,CAC3C,OAAOA,EAAQvsD,EAAO3U,EAAMi3D,CAAO,CACzD,CAAqB,EACD,OAAOt6D,EAAG,MAAM,UAAY4nC,IAAoB,SAAYxsC,CAAM,CAAC,CACvF,CACe,CAEf,CAmBA,YAAuBC,GAAI,gBAAgB,KAAK,EAAE,MAASA,GAAI,aAAa,KAAK,GAAG,KAAK,GAAK,KAAK,GAAG,MAAM,mBAAoB,CAItH,IAAIshE,EAAa,KAAK,GAAG,OAAO,SAASnC,EAAMC,CAAQ,EACnD7+D,EAAO,KAAK,GAAG,MAAM,kBAAiB,EACtCssE,EAAY,KAAK,KACrB,OAAO,SAA0BlwD,EAAO3U,EAAMi3D,EAAS,CACrD,IAAIlgE,EAASuiE,EAAW3kD,EAAO3U,EAAMi3D,CAAO,KACxC9/C,GAAS,oBAAoBpgB,EAAQwB,CAAI,EAC7C,IAAImsE,EAAQ3tE,EAAOwB,CAAI,GAAKxB,EAAOwB,CAAI,EAAE,QACzC,GAAImsE,EAEF,OAAO3tE,EAAOwB,CAAI,EAAEssE,EAAW1N,KAAU6M,GAAO,gBAAgBrvD,EAAO3U,CAAI,EAAG2U,CAAK,EAGnF,IAAI5c,EAAS+oE,EAAS,IAAI,SAAUI,EAAS,CAC3C,OAAOA,EAAQvsD,EAAO3U,EAAMi3D,CAAO,CACnD,CAAe,EACD,OAAOlgE,EAAOwB,CAAI,EAAE,MAAMxB,EAAQgB,CAAM,CAEtD,CACA,KAAe,CAIL,IAAI+sE,EAAS,KAAK,GAAG,SAAQ,EACzBC,EAAS,KAAK,GAAG,SAAS5N,EAAMC,CAAQ,EACxC4N,EAAY,KAAK,KACrB,OAAO,SAA0BrwD,EAAO3U,EAAMi3D,EAAS,CACrD,IAAIt6D,EAAKooE,EAAOpwD,EAAO3U,EAAMi3D,CAAO,EACpC,GAAI,OAAOt6D,GAAO,WAChB,MAAM,IAAI,UAAU,eAAe,OAAOmoE,EAAQ,6CAA6C,EAAI;AAAA,IAAO,OAAOT,EAAM1nE,CAAE,CAAC,CAAC,EAE7H,GAAIA,EAAG,QAEL,OAAOA,EAAGqoE,EAAW7N,KAAU6M,GAAO,gBAAgBrvD,EAAO3U,CAAI,EAAG2U,CAAK,EAGzE,IAAI5c,EAAS+oE,EAAS,IAAI,SAAUI,EAAS,CAC3C,OAAOA,EAAQvsD,EAAO3U,EAAMi3D,CAAO,CACnD,CAAe,EACD,OAAOt6D,EAAG,MAAMA,EAAI5E,CAAM,CAExC,CACS,CACF,CAMP,EAAO,CACD,IAAK,UACL,MAAO,SAAiBK,EAAU,CAChCA,EAAS,KAAK,GAAI,KAAM,IAAI,EAC5B,QAAS5E,EAAI,EAAGA,EAAI,KAAK,KAAK,OAAQA,IACpC4E,EAAS,KAAK,KAAK5E,CAAC,EAAG,QAAUA,EAAI,IAAK,IAAI,CAEjD,CAQP,EAAO,CACD,IAAK,MACL,MAAO,SAAa4E,EAAU,CAG5B,QAFIuE,EAAK,KAAK,QAAQvE,EAAS,KAAK,GAAI,KAAM,IAAI,CAAC,EAC/C4H,EAAO,CAAA,EACFxM,EAAI,EAAGA,EAAI,KAAK,KAAK,OAAQA,IACpCwM,EAAKxM,CAAC,EAAI,KAAK,QAAQ4E,EAAS,KAAK,KAAK5E,CAAC,EAAG,QAAUA,EAAI,IAAK,IAAI,CAAC,EAExE,OAAO,IAAIswE,EAAannE,EAAIqD,CAAI,CACjC,CAMP,EAAO,CACD,IAAK,QACL,MAAO,UAAiB,CACtB,OAAO,IAAI8jE,EAAa,KAAK,GAAI,KAAK,KAAK,MAAM,CAAC,CAAC,CACpD,CAMP,EAAO,CACD,IAAK,WACL,MAaA,SAAkB/pE,EAAS,CACzB,IAAIw9D,EACAh9D,EAAO,KAAK,GAAG,SAASR,CAAO,EAKnC,OAJIA,MAAetD,GAAS,SAAYsD,EAAQ,OAAO,IAAM,aAAgBN,GAAQ,gBAAgBM,EAAQ,QAASQ,CAAI,IAExHg9D,EAAex9D,EAAQ,QAAQQ,CAAI,EAAE,KAAMR,CAAO,GAEhD,OAAOw9D,EAAiB,IACnBA,KAIEwM,GAAM,YAAgBrL,GAAiB,SAAYoL,EAAa,SAAS,EAAG,WAAY,IAAI,EAAE,KAAK,KAAM/pE,CAAO,CAC5H,CAOP,EAAO,CACD,IAAK,YACL,MAAO,SAAmBA,EAAS,CACjC,IAAIiG,EAAO,KAAK,KAAK,IAAI,SAAU2D,EAAK,CACtC,OAAOA,EAAI,SAAS5J,CAAO,CACrC,CAAS,EACG4C,KAAS3E,GAAI,0BAA0B,KAAK,EAAE,EAAI,IAAM,KAAK,GAAG,SAAS+B,CAAO,EAAI,IAAM,KAAK,GAAG,SAASA,CAAO,EAGtH,OAAO4C,EAAK,IAAMqD,EAAK,KAAK,IAAI,EAAI,GACrC,CAMP,EAAO,CACD,IAAK,SACL,MAAO,UAAkB,CACvB,MAAO,CACL,OAAQzF,GACR,GAAI,KAAK,GACT,KAAM,KAAK,IACrB,CACO,CASP,EAAO,CACD,IAAK,SACL,MAMA,SAAgBR,EAAS,CACvB,IAAIiG,EAAO,KAAK,KAAK,IAAI,SAAU2D,EAAK,CACtC,OAAOA,EAAI,OAAO5J,CAAO,CACnC,CAAS,EAGD,MAAO,kCAAqC0X,GAAQ,QAAQ,KAAK,EAAE,EAAI,wEAA0EzR,EAAK,KAAK,uCAAuC,EAAI,gEACvM,CAaP,EAAO,CACD,IAAK,QACL,MAAO,SAAejG,EAAS,CAC7B,IAAIkrE,EAKJ,OAJIlrE,MAAetD,GAAS,SAAYsD,EAAQ,OAAO,IAAM,aAAgBN,GAAQ,gBAAgBM,EAAQ,QAAS,KAAK,IAAI,IAE7HkrE,EAAYlrE,EAAQ,QAAQ,KAAK,IAAI,EAAE,KAAMA,CAAO,GAElD,OAAOkrE,EAAc,IAChBA,KAIElB,GAAM,YAAgBrL,GAAiB,SAAYoL,EAAa,SAAS,EAAG,QAAS,IAAI,EAAE,KAAK,KAAM/pE,CAAO,CACzH,CAOP,EAAO,CACD,IAAK,SACL,MAAO,SAAgBA,EAAS,CAC9B,IAAIiG,EAAO,KAAK,KAAK,IAAI,SAAU2D,EAAK,CAEtC,OAAOA,EAAI,MAAM5J,CAAO,CAClC,CAAS,EACGmrE,EACAnH,GAAO,eAAe,KAAK,IAAI,IACjCmH,EAAiBnH,GAAO,eAAe,KAAK,IAAI,GAI9C5G,EAAK,KAAK,IAAI,IAAM,OAAOA,EAAK,KAAK,IAAI,EAAE,OAAU,eAAkB1gE,GAAS,SAAY0gE,EAAK,KAAK,IAAI,EAAE,KAAK,IAAM,UAAY,OAAOA,EAAK,KAAK,IAAI,EAAE,OAAU,YAEtK+N,EAAiB/N,EAAK,KAAK,IAAI,EAAE,OAEnC,IAAIgO,EACJ,UAAY1uE,GAAS,SAAYyuE,CAAc,EAAC,CAC9C,IAAK,WAEHC,EAAcD,EAAe,KAAMnrE,CAAO,EAC1C,MACF,IAAK,SAEHorE,EAAcb,EAAeY,EAAgB,KAAMnrE,CAAO,EAC1D,MACF,IAAK,SAGH,UAAYtD,GAAS,SAAYyuE,EAAellE,EAAK,MAAM,CAAC,EAAC,CAC3D,IAAK,WACHmlE,EAAcD,EAAellE,EAAK,MAAM,EAAE,KAAMjG,CAAO,EACvD,MACF,IAAK,SACHorE,EAAcb,EAAeY,EAAellE,EAAK,MAAM,EAAG,KAAMjG,CAAO,EACvE,KACH,CACJ,CACD,OAAI,OAAOorE,EAAgB,IAClBA,EAEFb,EAAevG,GAAO,gBAAiB,KAAMhkE,CAAO,CAC5D,CAMP,EAAO,CACD,IAAK,gBACL,MAAO,UAAyB,CAC9B,OAAO,KAAK,KAAO,IAAM,KAAK,IAC/B,CACF,CAAA,CAAC,EACK+pE,CACR,EAACrN,CAAI,EACN,SAAInwB,GAAiB,SAAYw9B,EAAc,OAAQvpE,EAAI,KACvD+rC,GAAiB,SAAYw9B,EAAc,sBAAuB,SAAUvpE,EAAM,CACpF,MAAM,IAAI,MAAM,sBAAwBA,CAAI,CAChD,CAAG,KACG+rC,GAAiB,SAAYw9B,EAAc,WAAY,SAAU3pD,EAAM,CACzE,OAAO,IAAI2pD,EAAa3pD,EAAK,GAAIA,EAAK,IAAI,CAC9C,CAAG,EACM2pD,CACT,EAAG,CACD,QAAS,GACT,OAAQ,EACV,CAAC,EACDA,GAAA,mBAA6BM,cClhBzBjxE,IAAyBY,GAC7B,OAAO,eAAe2yB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIjsB,GAAYtH,IAAuBuD,GAAA,CAAyC,EAC5EqiB,IAAW9gB,EACXD,GAAM0C,GACNi1B,IAAclgB,GACdhW,GAAUwf,GACV1e,GAAO,QACPia,IAAe,CAAC,QAAS,UAAW,SAAU,eAAgB,YAAa,iBAAkB,YAAa,kBAAmB,eAAgB,yBAA0B,eAAgB,YAAa,aAAc,eAAgB,kBAAmB,YAAa,iBAAkB,YAAY,EAChS4wD,OAAiCrsD,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MACfyiC,EAAUziC,EAAK,QACfzlB,EAASylB,EAAK,OACdm/C,EAAen/C,EAAK,aACpBogD,EAAYpgD,EAAK,UACjBiiD,EAAiBjiD,EAAK,eACtB8iD,EAAY9iD,EAAK,UACjBqjD,EAAkBrjD,EAAK,gBACvB0kD,EAAe1kD,EAAK,aACpB6kD,EAAyB7kD,EAAK,uBAC9B0qD,EAAe1qD,EAAK,aACpBqlD,EAAYrlD,EAAK,UACjB6lD,EAAa7lD,EAAK,WAClBmmD,EAAenmD,EAAK,aACpByoD,EAAkBzoD,EAAK,gBACvB4oD,EAAY5oD,EAAK,UACjBqpD,EAAiBrpD,EAAK,eACtBiqD,EAAajqD,EAAK,WAwChBsN,EAAQjrB,EAAMlB,GAAM,CACtB,OAAQ,SAAgB8qE,EAAY,CAClC,OAAOC,EAAWD,EAAY,CAAA,CAAE,CACjC,EACD,iBAAkB,SAAqBE,EAAa,CAClD,OAAOC,EAAcD,EAAa,CAAA,CAAE,CACrC,EACD,iBAAkB,SAAsBF,EAAYtrE,GAAS,CAC3D,IAAI0rE,GAAa1rE,GAAQ,QAAU,OAAYA,GAAQ,MAAQ,GAC/D,OAAOurE,EAAWD,EAAYI,EAAU,CACzC,EACD,yBAA0BD,CAC9B,CAAG,EACD,SAASA,EAAcD,EAAa,CAClC,IAAIxrE,EAAU,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,CAAA,EAC9E0rE,GAAa1rE,EAAQ,QAAU,OAAYA,EAAQ,MAAQ,GAG/D,SAAW41B,IAAY,SAAS41C,EAAa,SAAUpzD,GAAM,CAC3D,GAAI,OAAOA,IAAS,SAAU,MAAM,IAAI,UAAU,iBAAiB,EACnE,OAAOmzD,EAAWnzD,GAAMszD,EAAU,CACxC,CAAK,CACF,CAGD,IAAIC,EAAY,CACd,KAAM,EACN,UAAW,EACX,OAAQ,EACR,OAAQ,EACR,QAAS,CACb,EAGMC,EAAa,CACf,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAM,GACN,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACL,KAAM,GACN,IAAK,GACL,KAAM,GACN,IAAK,GACL,IAAK,GACL,KAAM,GACN,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACL,KAAM,GACN,IAAK,GACL,IAAK,GACL,IAAK,GACL,KAAM,GACN,KAAM,GACN,IAAK,GACL,IAAK,GACL,KAAM,GACN,KAAM,GACN,KAAM,GACN,KAAM,GACN,MAAO,EACX,EAGMC,EAAmB,CACrB,IAAK,GACL,GAAI,GACJ,GAAM,GACN,IAAK,GACL,IAAK,GACL,GAAI,GACJ,IAAK,EACT,EACMC,EAAY,CACd,KAAQ,GACR,MAAS,GACT,KAAQ,KACR,UAAW,MACf,EACMC,EAAoB,CAAC,MAAO,UAAU,EAC1C,SAASC,GAAe,CACtB,MAAO,CACL,WAAY,CAAE,EAEd,WAAY,GAEZ,QAAS,GAET,MAAO,EAEP,MAAO,GAEP,UAAWL,EAAU,KAErB,aAAc,EAEd,iBAAkB,IACxB,CACG,CAUD,SAASM,EAAcC,EAAOn4D,EAAQ,CACpC,OAAOm4D,EAAM,WAAW,OAAOA,EAAM,MAAOn4D,CAAM,CACnD,CASD,SAASo4D,EAAiBD,EAAO,CAC/B,OAAOD,EAAcC,EAAO,CAAC,CAC9B,CAQD,SAASzyD,EAAKyyD,EAAO,CACnBA,EAAM,OACP,CAOD,SAASE,EAAcF,EAAO,CAC5B,OAAOA,EAAM,WAAW,OAAOA,EAAM,MAAQ,CAAC,CAC/C,CAOD,SAASG,EAAcH,EAAO,CAC5B,OAAOA,EAAM,WAAW,OAAOA,EAAM,MAAQ,CAAC,CAC/C,CAOD,SAASI,EAASJ,EAAO,CAMvB,IALAA,EAAM,UAAYP,EAAU,KAC5BO,EAAM,MAAQ,GACdA,EAAM,QAAU,KAGH,CAEX,GAAIC,EAAiBD,CAAK,IAAM,IAC9B,KAAOC,EAAiBD,CAAK,IAAM;AAAA,GAAQC,EAAiBD,CAAK,IAAM,IACrEA,EAAM,SAAWC,EAAiBD,CAAK,EACvCzyD,EAAKyyD,CAAK,EAId,GAAIv/C,EAAM,aAAaw/C,EAAiBD,CAAK,EAAGA,EAAM,YAAY,EAChEzyD,EAAKyyD,CAAK,MAEV,MAEH,CAGD,GAAIC,EAAiBD,CAAK,IAAM,GAAI,CAElCA,EAAM,UAAYP,EAAU,UAC5B,MACD,CAGD,GAAIQ,EAAiBD,CAAK,IAAM;AAAA,GAAQ,CAACA,EAAM,aAAc,CAC3DA,EAAM,UAAYP,EAAU,UAC5BO,EAAM,MAAQC,EAAiBD,CAAK,EACpCzyD,EAAKyyD,CAAK,EACV,MACD,CACD,IAAI7rC,EAAK8rC,EAAiBD,CAAK,EAC3BK,GAAKN,EAAcC,EAAO,CAAC,EAC3BM,GAAKP,EAAcC,EAAO,CAAC,EAC/B,GAAIM,GAAG,SAAW,GAAKZ,EAAWY,EAAE,EAAG,CACrCN,EAAM,UAAYP,EAAU,UAC5BO,EAAM,MAAQM,GACd/yD,EAAKyyD,CAAK,EACVzyD,EAAKyyD,CAAK,EACVzyD,EAAKyyD,CAAK,EACV,MACD,CAGD,GAAIK,GAAG,SAAW,GAAKX,EAAWW,EAAE,EAAG,CACrCL,EAAM,UAAYP,EAAU,UAC5BO,EAAM,MAAQK,GACd9yD,EAAKyyD,CAAK,EACVzyD,EAAKyyD,CAAK,EACV,MACD,CAGD,GAAIN,EAAWvrC,CAAE,EAAG,CAClB6rC,EAAM,UAAYP,EAAU,UAC5BO,EAAM,MAAQ7rC,EACd5mB,EAAKyyD,CAAK,EACV,MACD,CAGD,GAAIv/C,EAAM,WAAW0T,CAAE,EAAG,CACxB6rC,EAAM,UAAYP,EAAU,OAG5B,IAAI/P,GAAKqQ,EAAcC,EAAO,CAAC,EAC/B,GAAItQ,KAAO,MAAQA,KAAO,MAAQA,KAAO,KAAM,CAK7C,IAJAsQ,EAAM,OAASC,EAAiBD,CAAK,EACrCzyD,EAAKyyD,CAAK,EACVA,EAAM,OAASC,EAAiBD,CAAK,EACrCzyD,EAAKyyD,CAAK,EACHv/C,EAAM,WAAWw/C,EAAiBD,CAAK,CAAC,GAC7CA,EAAM,OAASC,EAAiBD,CAAK,EACrCzyD,EAAKyyD,CAAK,EAEZ,GAAIC,EAAiBD,CAAK,IAAM,IAK9B,IAHAA,EAAM,OAAS,IACfzyD,EAAKyyD,CAAK,EAEHv/C,EAAM,WAAWw/C,EAAiBD,CAAK,CAAC,GAC7CA,EAAM,OAASC,EAAiBD,CAAK,EACrCzyD,EAAKyyD,CAAK,UAEHC,EAAiBD,CAAK,IAAM,IAKrC,IAHAA,EAAM,OAAS,IACfzyD,EAAKyyD,CAAK,EAEHv/C,EAAM,QAAQw/C,EAAiBD,CAAK,CAAC,GAC1CA,EAAM,OAASC,EAAiBD,CAAK,EACrCzyD,EAAKyyD,CAAK,EAGd,MACD,CAGD,GAAIC,EAAiBD,CAAK,IAAM,KAG9B,GAFAA,EAAM,OAASC,EAAiBD,CAAK,EACrCzyD,EAAKyyD,CAAK,EACN,CAACv/C,EAAM,QAAQw/C,EAAiBD,CAAK,CAAC,EAAG,CAE3CA,EAAM,UAAYP,EAAU,UAC5B,MACD,MACI,CACL,KAAOh/C,EAAM,QAAQw/C,EAAiBD,CAAK,CAAC,GAC1CA,EAAM,OAASC,EAAiBD,CAAK,EACrCzyD,EAAKyyD,CAAK,EAERv/C,EAAM,cAAcw/C,EAAiBD,CAAK,EAAGG,EAAcH,CAAK,CAAC,IACnEA,EAAM,OAASC,EAAiBD,CAAK,EACrCzyD,EAAKyyD,CAAK,EAEb,CACD,KAAOv/C,EAAM,QAAQw/C,EAAiBD,CAAK,CAAC,GAC1CA,EAAM,OAASC,EAAiBD,CAAK,EACrCzyD,EAAKyyD,CAAK,EAGZ,GAAIC,EAAiBD,CAAK,IAAM,KAAOC,EAAiBD,CAAK,IAAM,KACjE,GAAIv/C,EAAM,QAAQ0/C,EAAcH,CAAK,CAAC,GAAKG,EAAcH,CAAK,IAAM,KAAOG,EAAcH,CAAK,IAAM,IAAK,CAQvG,GAPAA,EAAM,OAASC,EAAiBD,CAAK,EACrCzyD,EAAKyyD,CAAK,GACNC,EAAiBD,CAAK,IAAM,KAAOC,EAAiBD,CAAK,IAAM,OACjEA,EAAM,OAASC,EAAiBD,CAAK,EACrCzyD,EAAKyyD,CAAK,GAGR,CAACv/C,EAAM,QAAQw/C,EAAiBD,CAAK,CAAC,EACxC,MAAMO,GAAkBP,EAAO,wBAA0BC,EAAiBD,CAAK,EAAI,GAAG,EAExF,KAAOv/C,EAAM,QAAQw/C,EAAiBD,CAAK,CAAC,GAC1CA,EAAM,OAASC,EAAiBD,CAAK,EACrCzyD,EAAKyyD,CAAK,EAEZ,GAAIv/C,EAAM,cAAcw/C,EAAiBD,CAAK,EAAGG,EAAcH,CAAK,CAAC,EACnE,MAAMO,GAAkBP,EAAO,wBAA0BC,EAAiBD,CAAK,EAAI,GAAG,CAEzF,SAAUG,EAAcH,CAAK,IAAM,IAClC,MAAAzyD,EAAKyyD,CAAK,EACJO,GAAkBP,EAAO,wBAA0BC,EAAiBD,CAAK,EAAI,GAAG,EAG1F,MACD,CAGD,GAAIv/C,EAAM,QAAQw/C,EAAiBD,CAAK,EAAGE,EAAcF,CAAK,EAAGG,EAAcH,CAAK,CAAC,EAAG,CACtF,KAAOv/C,EAAM,QAAQw/C,EAAiBD,CAAK,EAAGE,EAAcF,CAAK,EAAGG,EAAcH,CAAK,CAAC,GAAKv/C,EAAM,QAAQw/C,EAAiBD,CAAK,CAAC,GAChIA,EAAM,OAASC,EAAiBD,CAAK,EACrCzyD,EAAKyyD,CAAK,KAEJxsE,GAAQ,gBAAgBmsE,EAAkBK,EAAM,KAAK,EAC3DA,EAAM,UAAYP,EAAU,UAE5BO,EAAM,UAAYP,EAAU,OAE9B,MACD,CAID,IADAO,EAAM,UAAYP,EAAU,QACrBQ,EAAiBD,CAAK,IAAM,IACjCA,EAAM,OAASC,EAAiBD,CAAK,EACrCzyD,EAAKyyD,CAAK,EAEZ,MAAMO,GAAkBP,EAAO,yBAA2BA,EAAM,MAAQ,GAAG,CAC5E,CAKD,SAASQ,EAAoBR,EAAO,CAClC,GACEI,EAASJ,CAAK,QACPA,EAAM,QAAU;AAAA,EAC1B,CAMD,SAASS,EAAWT,EAAO,CACzBA,EAAM,cACP,CAMD,SAASU,EAAYV,EAAO,CAC1BA,EAAM,cACP,CAoBDv/C,EAAM,QAAU,SAAiB7jB,EAAG+jE,GAAOC,GAAO,CAChD,OAAOngD,EAAM,oBAAoB7jB,CAAC,GAAK6jB,EAAM,kBAAkB7jB,EAAGgkE,EAAK,GAAKngD,EAAM,kBAAkBkgD,GAAO/jE,CAAC,CAChH,EAOE6jB,EAAM,oBAAsB,SAA6B7jB,EAAG,CAC1D,MAAO,sDAAsD,KAAKA,CAAC,CACvE,EAiBE6jB,EAAM,kBAAoB,SAA2BogD,EAAMC,GAAK,CAC9D,MAAO,aAAa,KAAKD,CAAI,GAAK,oBAAoB,KAAKC,EAAG,GAAK,2KAA2K,KAAKA,EAAG,CAC1P,EAQErgD,EAAM,aAAe,SAAsB7jB,EAAGmkE,GAAc,CAE1D,OAAOnkE,IAAM,KAAOA,IAAM,KAAQA,IAAM;AAAA,GAAQmkE,GAAe,CACnE,EASEtgD,EAAM,cAAgB,SAAuB7jB,EAAGgkE,GAAO,CACrD,OAAOhkE,IAAM,KAAOgkE,KAAU,KAAOA,KAAU,KAAOA,KAAU,GACpE,EAOEngD,EAAM,WAAa,SAAoB7jB,EAAG,CACxC,OAAOA,GAAK,KAAOA,GAAK,KAAOA,IAAM,GACzC,EAOE6jB,EAAM,QAAU,SAAiB7jB,EAAG,CAClC,OAAOA,GAAK,KAAOA,GAAK,GAC5B,EAOE6jB,EAAM,WAAa,SAAoB7jB,EAAG,CACxC,OAAOA,GAAK,KAAOA,GAAK,KAAOA,GAAK,KAAOA,GAAK,KAAOA,GAAK,KAAOA,GAAK,GAC5E,EAOE,SAASyiE,EAAWD,EAAYI,EAAY,CAC1C,IAAIQ,GAAQF,OACRtrE,GAAU,SAAYwrE,GAAO,CAC/B,WAAYZ,EACZ,WAAYI,CAClB,CAAK,EACDY,EAASJ,EAAK,EACd,IAAIpvE,GAAOowE,EAAWhB,EAAK,EAI3B,GAAIA,GAAM,QAAU,GAClB,MAAIA,GAAM,YAAcP,EAAU,UAI1BllE,GAAYylE,GAAO,uBAAyBA,GAAM,KAAK,EAEvDO,GAAkBP,GAAO,oBAAsBA,GAAM,MAAQ,GAAG,EAG1E,OAAOpvE,EACR,CASD,SAASowE,EAAWhB,EAAO,CACzB,IAAIpvE,EACAulE,GAAS,CAAA,EACTE,GASJ,IARI2J,EAAM,QAAU,IAAMA,EAAM,QAAU;AAAA,GAAQA,EAAM,QAAU,MAChEpvE,EAAOqwE,GAAgBjB,CAAK,EACxBA,EAAM,UACRpvE,EAAK,QAAUovE,EAAM,UAKlBA,EAAM,QAAU;AAAA,GAAQA,EAAM,QAAU,KAEzC7J,GAAO,SAAW,GAAKvlE,IACzBylE,GAAU2J,EAAM,QAAU,IAC1B7J,GAAO,KAAK,CACV,KAAMvlE,EACN,QAASylE,EACnB,CAAS,GAEH+J,EAASJ,CAAK,EACVA,EAAM,QAAU;AAAA,GAAQA,EAAM,QAAU,KAAOA,EAAM,QAAU,KACjEpvE,EAAOqwE,GAAgBjB,CAAK,EACxBA,EAAM,UACRpvE,EAAK,QAAUovE,EAAM,SAEvB3J,GAAU2J,EAAM,QAAU,IAC1B7J,GAAO,KAAK,CACV,KAAMvlE,EACN,QAASylE,EACnB,CAAS,GAGL,OAAIF,GAAO,OAAS,EACX,IAAIF,EAAUE,EAAM,GAEtBvlE,IACHA,EAAO,IAAIinE,EAAa,MAAS,EAC7BmI,EAAM,UACRpvE,EAAK,QAAUovE,EAAM,UAGlBpvE,EAEV,CAUD,SAASqwE,GAAgBjB,EAAO,CAC9B,IAAI1rE,EAAMyF,GAAM7H,GAAOgvE,GACnBtwE,GAAOuwE,EAAiBnB,CAAK,EACjC,GAAIA,EAAM,QAAU,IAAK,CACvB,MAAQjuE,GAAI,cAAcnB,EAAI,EAE5B,OAAA0D,EAAO1D,GAAK,KACZ4vE,EAAoBR,CAAK,EACzB9tE,GAAQ+uE,GAAgBjB,CAAK,EACtB,IAAI5K,EAAe,IAAIgI,EAAW9oE,CAAI,EAAGpC,EAAK,EAChD,MAAQH,GAAI,gBAAgBnB,EAAI,EAErC,OAAA4vE,EAAoBR,CAAK,EACzB9tE,GAAQ+uE,GAAgBjB,CAAK,EACtB,IAAI5K,EAAexkE,GAAK,OAAQA,GAAK,MAAOsB,EAAK,EACnD,MAAQH,GAAI,gBAAgBnB,EAAI,MAASmB,GAAI,cAAcnB,GAAK,EAAE,IAEvEswE,GAAQ,GACRnnE,GAAO,CAAA,EACPzF,EAAO1D,GAAK,KACZA,GAAK,KAAK,QAAQ,SAAU8M,GAAK1D,GAAO,IAC9BjI,GAAI,cAAc2L,EAAG,EAC3B3D,GAAKC,EAAK,EAAI0D,GAAI,KAElBwjE,GAAQ,EAEpB,CAAS,EACGA,IACF,OAAAV,EAAoBR,CAAK,EACzB9tE,GAAQ+uE,GAAgBjB,CAAK,EACtB,IAAIhI,EAAuB1jE,EAAMyF,GAAM7H,EAAK,EAGvD,MAAMquE,GAAkBP,EAAO,iDAAiD,CACjF,CACD,OAAOpvE,EACR,CAYD,SAASuwE,EAAiBnB,EAAO,CAE/B,QADIpvE,EAAOwwE,EAAepB,CAAK,EACxBA,EAAM,QAAU,KAAK,CAI1B,IAAIjsE,GAAOisE,EAAM,iBACjBA,EAAM,iBAAmBA,EAAM,aAC/BQ,EAAoBR,CAAK,EACzB,IAAIrJ,GAAY/lE,EACZgmE,GAAWqK,GAAgBjB,CAAK,EACpC,GAAIA,EAAM,QAAU,IAAK,MAAMO,GAAkBP,EAAO,+CAA+C,EACvGA,EAAM,iBAAmB,KACzBQ,EAAoBR,CAAK,EACzB,IAAInJ,GAAYoK,GAAgBjB,CAAK,EAErCpvE,EAAO,IAAI4lE,EAAgBG,GAAWC,GAAUC,EAAS,EAGzDmJ,EAAM,iBAAmBjsE,EAC1B,CACD,OAAOnD,CACR,CAOD,SAASwwE,EAAepB,EAAO,CAE7B,QADIpvE,EAAOywE,GAAgBrB,CAAK,EACzBA,EAAM,QAAU,MAErBQ,EAAoBR,CAAK,EACzBpvE,EAAO,IAAI0oE,EAAa,KAAM,KAAM,CAAC1oE,EAAMywE,GAAgBrB,CAAK,CAAC,CAAC,EAEpE,OAAOpvE,CACR,CAOD,SAASywE,GAAgBrB,EAAO,CAE9B,QADIpvE,EAAO0wE,GAAgBtB,CAAK,EACzBA,EAAM,QAAU,OAErBQ,EAAoBR,CAAK,EACzBpvE,EAAO,IAAI0oE,EAAa,MAAO,MAAO,CAAC1oE,EAAM0wE,GAAgBtB,CAAK,CAAC,CAAC,EAEtE,OAAOpvE,CACR,CAOD,SAAS0wE,GAAgBtB,EAAO,CAE9B,QADIpvE,EAAO2wE,GAAevB,CAAK,EACxBA,EAAM,QAAU,OAErBQ,EAAoBR,CAAK,EACzBpvE,EAAO,IAAI0oE,EAAa,MAAO,MAAO,CAAC1oE,EAAM2wE,GAAevB,CAAK,CAAC,CAAC,EAErE,OAAOpvE,CACR,CAOD,SAAS2wE,GAAevB,EAAO,CAE7B,QADIpvE,EAAO4wE,GAAgBxB,CAAK,EACzBA,EAAM,QAAU,KAErBQ,EAAoBR,CAAK,EACzBpvE,EAAO,IAAI0oE,EAAa,IAAK,QAAS,CAAC1oE,EAAM4wE,GAAgBxB,CAAK,CAAC,CAAC,EAEtE,OAAOpvE,CACR,CAOD,SAAS4wE,GAAgBxB,EAAO,CAE9B,QADIpvE,EAAO6wE,GAAgBzB,CAAK,EACzBA,EAAM,QAAU,MAErBQ,EAAoBR,CAAK,EACzBpvE,EAAO,IAAI0oE,EAAa,KAAM,SAAU,CAAC1oE,EAAM6wE,GAAgBzB,CAAK,CAAC,CAAC,EAExE,OAAOpvE,CACR,CAOD,SAAS6wE,GAAgBzB,EAAO,CAE9B,QADIpvE,EAAO8wE,GAAgB1B,CAAK,EACzBA,EAAM,QAAU,KAErBQ,EAAoBR,CAAK,EACzBpvE,EAAO,IAAI0oE,EAAa,IAAK,SAAU,CAAC1oE,EAAM8wE,GAAgB1B,CAAK,CAAC,CAAC,EAEvE,OAAOpvE,CACR,CAMD,SAAS8wE,GAAgB1B,EAAO,CAW9B,QAVIlpE,EAAS,CAAC6qE,GAAW3B,CAAK,CAAC,EAC3BrD,GAAe,CAAA,EACfxI,GAAY,CACd,KAAM,QACN,KAAM,UACN,IAAK,UACL,IAAK,SACL,KAAM,YACN,KAAM,UACZ,KACe3gE,GAAQ,gBAAgB2gE,GAAW6L,EAAM,KAAK,GAAG,CAE1D,IAAI4B,GAAO,CACT,KAAM5B,EAAM,MACZ,GAAI7L,GAAU6L,EAAM,KAAK,CACjC,EACMrD,GAAa,KAAKiF,EAAI,EACtBpB,EAAoBR,CAAK,EACzBlpE,EAAO,KAAK6qE,GAAW3B,CAAK,CAAC,CAC9B,CACD,OAAIlpE,EAAO,SAAW,EACbA,EAAO,CAAC,EACNA,EAAO,SAAW,EACpB,IAAIwiE,EAAaqD,GAAa,CAAC,EAAE,KAAMA,GAAa,CAAC,EAAE,GAAI7lE,CAAM,EAEjE,IAAI0lE,EAAeG,GAAa,IAAI,SAAU//D,GAAG,CACtD,OAAOA,GAAE,EACjB,CAAO,EAAG9F,CAAM,CAEb,CAOD,SAAS6qE,GAAW3B,EAAO,CACzB,IAAIpvE,EAAM0D,GAAMoC,GAAII,GACpBlG,EAAOixE,GAAgB7B,CAAK,EAM5B,QALI7L,GAAY,CACd,KAAM,YACN,KAAM,kBACN,MAAO,eACb,KACe3gE,GAAQ,gBAAgB2gE,GAAW6L,EAAM,KAAK,GACvD1rE,GAAO0rE,EAAM,MACbtpE,GAAKy9D,GAAU7/D,EAAI,EACnBksE,EAAoBR,CAAK,EACzBlpE,GAAS,CAAClG,EAAMixE,GAAgB7B,CAAK,CAAC,EACtCpvE,EAAO,IAAI0oE,EAAahlE,GAAMoC,GAAII,EAAM,EAE1C,OAAOlG,CACR,CAOD,SAASixE,GAAgB7B,EAAO,CAC9B,IAAIpvE,EAAM0D,GAAMoC,GAAII,GACpBlG,EAAOkxE,GAAW9B,CAAK,EAMvB,QALI7L,GAAY,CACd,GAAI,KACJ,GAAM,IACZ,KAEe3gE,GAAQ,gBAAgB2gE,GAAW6L,EAAM,KAAK,GACvD1rE,GAAO0rE,EAAM,MACbtpE,GAAKy9D,GAAU7/D,EAAI,EACnBksE,EAAoBR,CAAK,EACrB1rE,KAAS,MAAQ0rE,EAAM,QAAU,GAEnCpvE,EAAO,IAAI0oE,EAAa,IAAK,WAAY,CAAC1oE,EAAM,IAAIwsE,EAAW,IAAI,CAAC,EAAG,EAAI,GAG3EtmE,GAAS,CAAClG,EAAMkxE,GAAW9B,CAAK,CAAC,EACjCpvE,EAAO,IAAI0oE,EAAahlE,GAAMoC,GAAII,EAAM,GAG5C,OAAOlG,CACR,CAOD,SAASkxE,GAAW9B,EAAO,CACzB,IAAIpvE,EACAkG,GAAS,CAAA,EAQb,GAPIkpE,EAAM,QAAU,IAElBpvE,EAAO,IAAIinE,EAAa,CAAC,EAGzBjnE,EAAOmxE,GAAiB/B,CAAK,EAE3BA,EAAM,QAAU,KAAOA,EAAM,mBAAqBA,EAAM,aAAc,CAKxE,IAHAlpE,GAAO,KAAKlG,CAAI,EAGTovE,EAAM,QAAU,KAAOlpE,GAAO,OAAS,GAE5C0pE,EAAoBR,CAAK,EACrBA,EAAM,QAAU,KAAOA,EAAM,QAAU,KAAOA,EAAM,QAAU,KAAOA,EAAM,QAAU,GAEvFlpE,GAAO,KAAK,IAAIsmE,EAAW,KAAK,CAAC,EAGjCtmE,GAAO,KAAKirE,GAAiB/B,CAAK,CAAC,EAGnClpE,GAAO,SAAW,EAEpBlG,EAAO,IAAImrE,EAAUjlE,GAAO,CAAC,EAAGA,GAAO,CAAC,EAAGA,GAAO,CAAC,CAAC,EAIpDlG,EAAO,IAAImrE,EAAUjlE,GAAO,CAAC,EAAGA,GAAO,CAAC,CAAC,CAE5C,CAED,OAAOlG,CACR,CAOD,SAASmxE,GAAiB/B,EAAO,CAC/B,IAAIpvE,EAAM0D,GAAMoC,GAAII,GACpBlG,EAAOoxE,EAAoBhC,CAAK,EAKhC,QAJI7L,GAAY,CACd,IAAK,MACL,IAAK,UACX,KACe3gE,GAAQ,gBAAgB2gE,GAAW6L,EAAM,KAAK,GAAG,CAC1D1rE,GAAO0rE,EAAM,MACbtpE,GAAKy9D,GAAU7/D,EAAI,EACnBksE,EAAoBR,CAAK,EACzB,IAAIiC,GAAYD,EAAoBhC,CAAK,EACrCiC,GAAU,aACZnrE,GAAS,CAAClG,EAAM,IAAI0oE,EAAa,IAAK,WAAY,CAAC1oE,EAAMqxE,EAAS,CAAC,CAAC,EAEpEnrE,GAAS,CAAClG,EAAMqxE,EAAS,EAE3BrxE,EAAO,IAAI0oE,EAAahlE,GAAMoC,GAAII,EAAM,CACzC,CACD,OAAOlG,CACR,CAOD,SAASoxE,EAAoBhC,EAAO,CAClC,IAAIpvE,EAAMyI,GAAM/E,GAAMoC,GACtB9F,EAAOsxE,GAA4BlC,CAAK,EACxC3mE,GAAOzI,EAOP,QANIujE,GAAY,CACd,IAAK,WACL,KAAM,cACN,IAAK,SACL,KAAM,WACZ,KAEc3gE,GAAQ,gBAAgB2gE,GAAW6L,EAAM,KAAK,GAEpD1rE,GAAO0rE,EAAM,MACbtpE,GAAKy9D,GAAU7/D,EAAI,EACnBksE,EAAoBR,CAAK,EACzB3mE,GAAO6oE,GAA4BlC,CAAK,EACxCpvE,EAAO,IAAI0oE,EAAahlE,GAAMoC,GAAI,CAAC9F,EAAMyI,EAAI,CAAC,EAKlD,OAAOzI,CACR,CAOD,SAASsxE,GAA4BlC,EAAO,CAC1C,IAAIpvE,EAAMyI,GAGV,IAFAzI,EAAOuxE,GAAWnC,CAAK,EACvB3mE,GAAOzI,EAEDovE,EAAM,YAAcP,EAAU,QAAUO,EAAM,QAAU,SAAYjuE,GAAI,gBAAgBnB,CAAI,GAAKovE,EAAM,YAAcP,EAAU,QAAU,IAAK1tE,GAAI,gBAAgBsH,EAAI,IAAM,IAAKtH,GAAI,gBAAgBsH,EAAI,GAAKA,GAAK,KAAO,MAAQ2mE,EAAM,QAAU,KAMpP3mE,GAAO8oE,GAAWnC,CAAK,EACvBpvE,EAAO,IAAI0oE,EAAa,IAAK,WAAY,CAAC1oE,EAAMyI,EAAI,EAAG,IAK3D,OAAOzI,CACR,CAWD,SAASuxE,GAAWnC,EAAO,CAIzB,QAHIpvE,EAAOwxE,GAAgBpC,CAAK,EAC5B3mE,GAAOzI,EACPyxE,GAAc,CAAA,EAGZrC,EAAM,QAAU,QAAWjuE,GAAI,WAAWsH,EAAI,GAMhD,GAJAgpE,GAAY,QAAS7tE,GAAU,SAAY,CAAE,EAAEwrE,CAAK,CAAC,EACrDQ,EAAoBR,CAAK,EAGrBA,EAAM,YAAcP,EAAU,OAMhC,GAJA4C,GAAY,QAAS7tE,GAAU,SAAY,CAAE,EAAEwrE,CAAK,CAAC,EACrDQ,EAAoBR,CAAK,EAGrBA,EAAM,YAAcP,EAAU,QAAUO,EAAM,QAAU,OAGtDxrE,GAAU,SAAYwrE,EAAOqC,GAAY,IAAG,CAAE,EAClDA,GAAY,IAAG,EACfhpE,GAAO+oE,GAAgBpC,CAAK,EAC5BpvE,EAAO,IAAI0oE,EAAa,IAAK,SAAU,CAAC1oE,EAAMyI,EAAI,CAAC,MAC9C,CAELgpE,GAAY,IAAG,KACX7tE,GAAU,SAAYwrE,EAAOqC,GAAY,IAAG,CAAE,EAClD,KACD,KACI,IAED7tE,GAAU,SAAYwrE,EAAOqC,GAAY,IAAG,CAAE,EAClD,KACD,CAKL,OAAOzxE,CACR,CAOD,SAASwxE,GAAgBpC,EAAO,CAC9B,IAAIpvE,EAAM0D,GAAMoC,GAAII,GACpBlG,EAAO0xE,GAAWtC,CAAK,EAKvB,QAJI7L,GAAY,CACd,IAAK,MACL,IAAK,KACX,KACe3gE,GAAQ,gBAAgB2gE,GAAW6L,EAAM,KAAK,GACvD1rE,GAAO0rE,EAAM,MACbtpE,GAAKy9D,GAAU7/D,EAAI,EACnBksE,EAAoBR,CAAK,EACrB1rE,KAAS,KAAO0rE,EAAM,YAAcP,EAAU,WAAaO,EAAM,QAAU,IAE7EpvE,EAAO,IAAI0oE,EAAa,IAAK,SAAU,CAAC1oE,EAAM,IAAIinE,EAAa,GAAG,CAAC,EAAG,GAAO,EAAI,GAEjF/gE,GAAS,CAAClG,EAAM0xE,GAAWtC,CAAK,CAAC,EACjCpvE,EAAO,IAAI0oE,EAAahlE,GAAMoC,GAAII,EAAM,GAG5C,OAAOlG,CACR,CAOD,SAAS0xE,GAAWtC,EAAO,CACzB,IAAI1rE,EAAMwC,GAAQJ,GACdy9D,GAAY,CACd,IAAK,aACL,IAAK,YACL,IAAK,SACL,IAAK,KACX,EACI,SAAQ3gE,GAAQ,gBAAgB2gE,GAAW6L,EAAM,KAAK,GACpDtpE,GAAKy9D,GAAU6L,EAAM,KAAK,EAC1B1rE,EAAO0rE,EAAM,MACbQ,EAAoBR,CAAK,EACzBlpE,GAAS,CAACwrE,GAAWtC,CAAK,CAAC,EACpB,IAAI1G,EAAahlE,EAAMoC,GAAII,EAAM,GAEnCyrE,GAASvC,CAAK,CACtB,CAQD,SAASuC,GAASvC,EAAO,CACvB,IAAIpvE,EAAM0D,GAAMoC,GAAII,GACpB,OAAAlG,EAAO4xE,GAAuBxC,CAAK,GAC/BA,EAAM,QAAU,KAAOA,EAAM,QAAU,QACzC1rE,GAAO0rE,EAAM,MACbtpE,GAAKpC,KAAS,IAAM,MAAQ,SAC5BksE,EAAoBR,CAAK,EACzBlpE,GAAS,CAAClG,EAAM0xE,GAAWtC,CAAK,CAAC,EACjCpvE,EAAO,IAAI0oE,EAAahlE,GAAMoC,GAAII,EAAM,GAEnClG,CACR,CAOD,SAAS4xE,GAAuBxC,EAAO,CACrC,IAAIpvE,EAAM0D,GAAMoC,GAAII,GACpBlG,EAAO6xE,GAAiBzC,CAAK,EAK7B,QAJI7L,GAAY,CACd,IAAK,YACL,IAAM,YACZ,KACe3gE,GAAQ,gBAAgB2gE,GAAW6L,EAAM,KAAK,GACvD1rE,GAAO0rE,EAAM,MACbtpE,GAAKy9D,GAAU7/D,EAAI,EACnB8rE,EAASJ,CAAK,EACdlpE,GAAS,CAAClG,CAAI,EACdA,EAAO,IAAI0oE,EAAahlE,GAAMoC,GAAII,EAAM,EACxClG,EAAO8xE,GAAe1C,EAAOpvE,CAAI,EAEnC,OAAOA,CACR,CA8BD,SAAS6xE,GAAiBzC,EAAO,CAC/B,IAAIlpE,EAAS,CAAA,EACb,GAAIkpE,EAAM,YAAcP,EAAU,WAAcjsE,GAAQ,gBAAgBwsE,EAAM,WAAYA,EAAM,KAAK,EAAG,CACtG,IAAI2C,GAAa3C,EAAM,WAAWA,EAAM,KAAK,EAI7C,GAHAI,EAASJ,CAAK,EAGVA,EAAM,QAAU,IAAK,CAIvB,GAHAlpE,EAAS,CAAA,EACT2pE,EAAWT,CAAK,EAChBI,EAASJ,CAAK,EACVA,EAAM,QAAU,IAIlB,IAHAlpE,EAAO,KAAKmqE,GAAgBjB,CAAK,CAAC,EAG3BA,EAAM,QAAU,KAErBI,EAASJ,CAAK,EACdlpE,EAAO,KAAKmqE,GAAgBjB,CAAK,CAAC,EAGtC,GAAIA,EAAM,QAAU,IAClB,MAAMO,GAAkBP,EAAO,wBAAwB,EAEzDU,EAAYV,CAAK,EACjBI,EAASJ,CAAK,CACf,CAID,OAAO,IAAI2C,GAAW7rE,CAAM,CAC7B,CACD,OAAO8rE,GAAY5C,CAAK,CACzB,CAOD,SAAS4C,GAAY5C,EAAO,CAC1B,IAAIpvE,EAAM0D,GACV,OAAI0rE,EAAM,YAAcP,EAAU,QAAUO,EAAM,YAAcP,EAAU,WAAaO,EAAM,SAASL,GACpGrrE,GAAO0rE,EAAM,MACbI,EAASJ,CAAK,KACNxsE,GAAQ,gBAAgBosE,EAAWtrE,EAAI,EAE7C1D,EAAO,IAAIinE,EAAa+H,EAAUtrE,EAAI,CAAC,EAC9BurE,EAAkB,QAAQvrE,EAAI,IAAM,GAE7C1D,EAAO,IAAIinE,EAAajiB,EAAQthD,GAAM,QAAQ,CAAC,EAE/C1D,EAAO,IAAIwsE,EAAW9oE,EAAI,EAI5B1D,EAAO8xE,GAAe1C,EAAOpvE,CAAI,EAC1BA,GAEFiyE,GAAwB7C,CAAK,CACrC,CAgBD,SAAS0C,GAAe1C,EAAOpvE,EAAMkF,GAAO,CAE1C,QADIgB,IACIkpE,EAAM,QAAU,KAAOA,EAAM,QAAU,KAAOA,EAAM,QAAU,OAAS,CAAClqE,IAASA,GAAM,QAAQkqE,EAAM,KAAK,IAAM,KAGtH,GADAlpE,GAAS,CAAA,EACLkpE,EAAM,QAAU,IAClB,MAAQjuE,GAAI,cAAcnB,CAAI,MAASmB,GAAI,gBAAgBnB,CAAI,EAAG,CAIhE,GAFA6vE,EAAWT,CAAK,EAChBI,EAASJ,CAAK,EACVA,EAAM,QAAU,IAIlB,IAHAlpE,GAAO,KAAKmqE,GAAgBjB,CAAK,CAAC,EAG3BA,EAAM,QAAU,KAErBI,EAASJ,CAAK,EACdlpE,GAAO,KAAKmqE,GAAgBjB,CAAK,CAAC,EAGtC,GAAIA,EAAM,QAAU,IAClB,MAAMO,GAAkBP,EAAO,wBAAwB,EAEzDU,EAAYV,CAAK,EACjBI,EAASJ,CAAK,EACdpvE,EAAO,IAAIitE,EAAajtE,EAAMkG,EAAM,CAC9C,KAIU,QAAOlG,UAEAovE,EAAM,QAAU,IAAK,CAI9B,GAFAS,EAAWT,CAAK,EAChBI,EAASJ,CAAK,EACVA,EAAM,QAAU,IAIlB,IAHAlpE,GAAO,KAAKmqE,GAAgBjB,CAAK,CAAC,EAG3BA,EAAM,QAAU,KAErBI,EAASJ,CAAK,EACdlpE,GAAO,KAAKmqE,GAAgBjB,CAAK,CAAC,EAGtC,GAAIA,EAAM,QAAU,IAClB,MAAMO,GAAkBP,EAAO,wBAAwB,EAEzDU,EAAYV,CAAK,EACjBI,EAASJ,CAAK,EACdpvE,EAAO,IAAI0hE,EAAa1hE,EAAM,IAAI4nE,EAAU1hE,EAAM,CAAC,CAC3D,KAAa,CAGL,GADAspE,EAASJ,CAAK,EACVA,EAAM,YAAcP,EAAU,OAChC,MAAMc,GAAkBP,EAAO,kCAAkC,EAEnElpE,GAAO,KAAK,IAAI+gE,EAAamI,EAAM,KAAK,CAAC,EACzCI,EAASJ,CAAK,EACd,IAAIrH,GAAc,GAClB/nE,EAAO,IAAI0hE,EAAa1hE,EAAM,IAAI4nE,EAAU1hE,GAAQ6hE,EAAW,CAAC,CACjE,CAEH,OAAO/nE,CACR,CAOD,SAASiyE,GAAwB7C,EAAO,CACtC,IAAIpvE,EAAM0C,GACV,OAAI0sE,EAAM,QAAU,KAClB1sE,GAAMwvE,GAA6B9C,CAAK,EAGxCpvE,EAAO,IAAIinE,EAAavkE,EAAG,EAG3B1C,EAAO8xE,GAAe1C,EAAOpvE,CAAI,EAC1BA,GAEFmyE,GAAwB/C,CAAK,CACrC,CAMD,SAAS8C,GAA6B9C,EAAO,CAE3C,QADI1sE,EAAM,GACH2sE,EAAiBD,CAAK,IAAM,IAAMC,EAAiBD,CAAK,IAAM,KAC/DC,EAAiBD,CAAK,IAAM,OAG9B1sE,GAAO2sE,EAAiBD,CAAK,EAC7BzyD,EAAKyyD,CAAK,GAEZ1sE,GAAO2sE,EAAiBD,CAAK,EAC7BzyD,EAAKyyD,CAAK,EAGZ,GADAI,EAASJ,CAAK,EACVA,EAAM,QAAU,IAClB,MAAMO,GAAkBP,EAAO,0BAA0B,EAE3D,OAAAI,EAASJ,CAAK,EACP,KAAK,MAAM,IAAM1sE,EAAM,GAAG,CAClC,CAOD,SAASyvE,GAAwB/C,EAAO,CACtC,IAAIpvE,EAAM0C,GACV,OAAI0sE,EAAM,QAAU,KAClB1sE,GAAM0vE,GAA6BhD,CAAK,EAGxCpvE,EAAO,IAAIinE,EAAavkE,EAAG,EAG3B1C,EAAO8xE,GAAe1C,EAAOpvE,CAAI,EAC1BA,GAEFqyE,GAAYjD,CAAK,CACzB,CAMD,SAASgD,GAA6BhD,EAAO,CAE3C,QADI1sE,EAAM,GACH2sE,EAAiBD,CAAK,IAAM,IAAMC,EAAiBD,CAAK,IAAM,KAC/DC,EAAiBD,CAAK,IAAM,OAG9B1sE,GAAO2sE,EAAiBD,CAAK,EAC7BzyD,EAAKyyD,CAAK,GAEZ1sE,GAAO2sE,EAAiBD,CAAK,EAC7BzyD,EAAKyyD,CAAK,EAGZ,GADAI,EAASJ,CAAK,EACVA,EAAM,QAAU,IAClB,MAAMO,GAAkBP,EAAO,0BAA2B,EAE5D,OAAAI,EAASJ,CAAK,EACP,KAAK,MAAM,IAAM1sE,EAAM,GAAG,CAClC,CAOD,SAAS2vE,GAAYjD,EAAO,CAC1B,IAAI5rE,EAAO0C,GAAQ6wB,GAAM6kB,GACzB,GAAIwzB,EAAM,QAAU,IAAK,CAIvB,GAFAS,EAAWT,CAAK,EAChBI,EAASJ,CAAK,EACVA,EAAM,QAAU,IAAK,CAEvB,IAAI34C,GAAM67C,GAASlD,CAAK,EACxB,GAAIA,EAAM,QAAU,IAAK,CAMvB,IAJAr4C,GAAO,EACP7wB,GAAS,CAACuwB,EAAG,EAGN24C,EAAM,QAAU,KAErBI,EAASJ,CAAK,EACdlpE,GAAO6wB,EAAI,EAAIu7C,GAASlD,CAAK,EAC7Br4C,KAEF,GAAIq4C,EAAM,QAAU,IAClB,MAAMO,GAAkBP,EAAO,0BAA0B,EAE3DU,EAAYV,CAAK,EACjBI,EAASJ,CAAK,EAGdxzB,GAAO11C,GAAO,CAAC,EAAE,MAAM,OACvB,QAAS0Y,GAAI,EAAGA,GAAImY,GAAMnY,KACxB,GAAI1Y,GAAO0Y,EAAC,EAAE,MAAM,SAAWg9B,GAC7B,MAAMjyC,GAAYylE,EAAO,+BAAsClpE,GAAO0Y,EAAC,EAAE,MAAM,OAAS,QAAUg9B,GAAO,GAAG,EAGhHp4C,EAAQ,IAAIm/D,EAAUz8D,EAAM,CACtC,KAAe,CAEL,GAAIkpE,EAAM,QAAU,IAClB,MAAMO,GAAkBP,EAAO,0BAA0B,EAE3DU,EAAYV,CAAK,EACjBI,EAASJ,CAAK,EACd5rE,EAAQizB,EACT,CACT,MAEQq5C,EAAYV,CAAK,EACjBI,EAASJ,CAAK,EACd5rE,EAAQ,IAAIm/D,EAAU,CAAA,CAAE,EAE1B,OAAOmP,GAAe1C,EAAO5rE,CAAK,CACnC,CACD,OAAO+uE,EAAYnD,CAAK,CACzB,CAMD,SAASkD,GAASlD,EAAO,CAGvB,QAFIlpE,EAAS,CAACmqE,GAAgBjB,CAAK,CAAC,EAChCztE,GAAM,EACHytE,EAAM,QAAU,KAErBI,EAASJ,CAAK,EAGdlpE,EAAOvE,EAAG,EAAI0uE,GAAgBjB,CAAK,EACnCztE,KAEF,OAAO,IAAIghE,EAAUz8D,CAAM,CAC5B,CAOD,SAASqsE,EAAYnD,EAAO,CAC1B,GAAIA,EAAM,QAAU,IAAK,CACvBS,EAAWT,CAAK,EAChB,IAAIvyE,EACA0F,GAAa,CAAA,EACjB,EAEE,IADAitE,EAASJ,CAAK,EACVA,EAAM,QAAU,IAAK,CAEvB,GAAIA,EAAM,QAAU,IAClBvyE,EAAMq1E,GAA6B9C,CAAK,UAC/BA,EAAM,QAAU,IACzBvyE,EAAMu1E,GAA6BhD,CAAK,UAC/BA,EAAM,YAAcP,EAAU,QAAUO,EAAM,YAAcP,EAAU,WAAaO,EAAM,SAASL,EAC3GlyE,EAAMuyE,EAAM,MACZI,EAASJ,CAAK,MAEd,OAAMO,GAAkBP,EAAO,yCAAyC,EAI1E,GAAIA,EAAM,QAAU,IAClB,MAAMO,GAAkBP,EAAO,mCAAmC,EAEpEI,EAASJ,CAAK,EAGd7sE,GAAW1F,CAAG,EAAIwzE,GAAgBjB,CAAK,CACxC,OACMA,EAAM,QAAU,KAEzB,GAAIA,EAAM,QAAU,IAClB,MAAMO,GAAkBP,EAAO,kDAAkD,EAEnFU,EAAYV,CAAK,EACjBI,EAASJ,CAAK,EACd,IAAIpvE,GAAO,IAAIooE,EAAW7lE,EAAU,EAGpC,OAAAvC,GAAO8xE,GAAe1C,EAAOpvE,EAAI,EAC1BA,EACR,CACD,OAAOuyD,GAAY6c,CAAK,CACzB,CAOD,SAAS7c,GAAY6c,EAAO,CAC1B,IAAIoD,EACJ,OAAIpD,EAAM,YAAcP,EAAU,QAEhC2D,EAAYpD,EAAM,MAClBI,EAASJ,CAAK,EACP,IAAInI,EAAajiB,EAAQwtB,EAAW11E,EAAO,MAAM,CAAC,GAEpD21E,GAAiBrD,CAAK,CAC9B,CAOD,SAASqD,GAAiBrD,EAAO,CAC/B,IAAIpvE,EAGJ,GAAIovE,EAAM,QAAU,IAAK,CAMvB,GAJAS,EAAWT,CAAK,EAChBI,EAASJ,CAAK,EACdpvE,EAAOqwE,GAAgBjB,CAAK,EAExBA,EAAM,QAAU,IAClB,MAAMO,GAAkBP,EAAO,wBAAwB,EAEzD,OAAAU,EAAYV,CAAK,EACjBI,EAASJ,CAAK,EACdpvE,EAAO,IAAIgrE,EAAgBhrE,CAAI,EAC/BA,EAAO8xE,GAAe1C,EAAOpvE,CAAI,EAC1BA,CACR,CACD,OAAO0yE,GAAStD,CAAK,CACtB,CAOD,SAASsD,GAAStD,EAAO,CACvB,MAAIA,EAAM,QAAU,GAEZO,GAAkBP,EAAO,8BAA8B,EAEvDO,GAAkBP,EAAO,gBAAgB,CAElD,CAkBD,SAASx4C,GAAIw4C,EAAO,CAClB,OAAOA,EAAM,MAAQA,EAAM,MAAM,OAAS,CAC3C,CASD,SAASO,GAAkBP,EAAOrqE,EAAS,CACzC,IAAIiH,GAAI4qB,GAAIw4C,CAAK,EACb/nB,GAAQ,IAAI,YAAYtiD,EAAU,UAAYiH,GAAI,GAAG,EACzD,OAAAq7C,GAAM,KAAUr7C,GACTq7C,EACR,CASD,SAAS19C,GAAYylE,EAAOrqE,EAAS,CACnC,IAAIiH,GAAI4qB,GAAIw4C,CAAK,EACb/nB,GAAQ,IAAI,YAAYtiD,EAAU,UAAYiH,GAAI,GAAG,EACzD,OAAAq7C,GAAM,KAAUr7C,GACTq7C,EACR,CAGD,OAAAziD,EAAM,cAAc,CAClB,KAAM,SACN,GAAI,OACJ,QAASirB,CACb,CAAG,EACMA,CACT,CAAC,EACDA,GAAA,YAAsB0+C,cC/mDtB,OAAO,eAAeoE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAI75C,IAAc57B,GACdglB,IAAWriB,EACX6D,GAAO,UACPia,IAAe,CAAC,QAAS,OAAO,EAChCi1D,OAAmC1wD,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC3F,IAAI3d,EAAQ2d,EAAK,MACfsN,EAAQtN,EAAK,MAmCf,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,SAAgBy8D,EAAM,CAC5B,OAAOtwC,EAAMswC,CAAI,EAAE,SACpB,EACD,iBAAkB,SAAqBA,EAAM,CAC3C,SAAWrnC,IAAY,SAASqnC,EAAM,SAAUljD,EAAO,CACrD,OAAO4S,EAAM5S,CAAK,EAAE,SAC5B,CAAO,CACF,CACL,CAAG,CACH,CAAC,EACD01D,GAAA,cAAwBC,cCxDxB,OAAO,eAAevS,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAIvnC,GAAc57B,GACdglB,IAAWriB,EACXsiB,GAAO/gB,GACPsC,GAAO,WACPia,IAAe,CAAC,QAAS,OAAO,EAChCk1D,OAAoC3wD,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC5F,IAAI3d,EAAQ2d,EAAK,MACfsN,EAAQtN,EAAK,MAiCf,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,SAAgBy8D,EAAM,CAC5B,IAAIriD,KAAYqE,GAAK,kBACrB,OAAO0N,EAAMswC,CAAI,EAAE,QAAO,EAAG,SAASriD,CAAK,CAC5C,EACD,uBAAwB,SAAyBqiD,EAAMriD,EAAO,CAC5D,OAAO+R,EAAMswC,CAAI,EAAE,QAAO,EAAG,SAASriD,CAAK,CAC5C,EACD,iBAAkB,SAAqBqiD,EAAM,CAC3C,IAAIriD,KAAYqE,GAAK,kBACrB,SAAW2W,GAAY,SAASqnC,EAAM,SAAUljD,EAAO,CACrD,OAAO4S,EAAM5S,CAAK,EAAE,QAAO,EAAG,SAASa,CAAK,CACpD,CAAO,CACF,EACD,+BAAgC,SAA8BqiD,EAAMriD,EAAO,CACzE,SAAWgb,GAAY,SAASqnC,EAAM,SAAUljD,EAAO,CACrD,OAAO4S,EAAM5S,CAAK,EAAE,QAAO,EAAG,SAASa,CAAK,CACpD,CAAO,CACF,CACL,CAAG,CACH,CAAC,EACDuiD,GAAA,eAAyBwS,cCjEzB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAI5wD,IAAWhlB,EACXilB,GAAOtiB,GACP6D,IAAO,SACPia,IAAe,CAAC,UAAU,EAC1Bo1D,OAAuC7wD,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CAC/F,IAAI89C,EAAW99C,EAAK,SAiDpB,SAASuwD,GAAS,CAChB,GAAI,EAAE,gBAAgBA,GACpB,MAAM,IAAI,YAAY,kDAAkD,EAE1E,OAAO,eAAe,KAAM,QAAS,CACnC,SAAW3wD,GAAK,gBAAiB,EACjC,SAAU,EAChB,CAAK,CACF,CAKD,OAAA2wD,EAAO,UAAU,KAAO,SACxBA,EAAO,UAAU,SAAW,GAS5BA,EAAO,UAAU,SAAW,SAAU3S,EAAM,CAE1C,OAAOE,EAASF,EAAM,KAAK,KAAK,CACpC,EAQE2S,EAAO,UAAU,IAAM,SAAUpvE,EAAM,CAErC,GAAI,KAAK,MAAM,IAAIA,CAAI,EACrB,OAAO,KAAK,MAAM,IAAIA,CAAI,CAEhC,EAMEovE,EAAO,UAAU,OAAS,UAAY,CACpC,SAAW3wD,GAAK,UAAU,KAAK,KAAK,CACxC,EAME2wD,EAAO,UAAU,YAAc,UAAY,CACzC,OAAO,KAAK,KAChB,EAOEA,EAAO,UAAU,IAAM,SAAUpvE,EAAMpC,EAAO,CAC5C,YAAK,MAAM,IAAIoC,EAAMpC,CAAK,EACnBA,CACX,EAMEwxE,EAAO,UAAU,OAAS,SAAUpvE,EAAM,CACxC,KAAK,MAAM,OAAUA,CAAI,CAC7B,EAKEovE,EAAO,UAAU,MAAQ,UAAY,CACnC,KAAK,MAAM,OACf,EACSA,CACT,EAAG,CACD,QAAS,EACX,CAAC,EACDA,GAAA,kBAA4BC,cC/I5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAI9wD,IAAWhlB,EACXwG,GAAO,SACPia,IAAe,CAAC,QAAS,QAAQ,EACjCs1D,OAAkC/wD,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC1F,IAAI3d,EAAQ2d,EAAK,MACfuwD,EAASvwD,EAAK,OA4ChB,OAAO3d,EAAMlB,GAAM,CACjB,GAAI,UAAa,CACf,OAAO,IAAIovE,CACZ,CACL,CAAG,CACH,CAAC,EACDE,GAAA,aAAuBC,cC3DvB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAItwE,IAAU1F,GACVglB,IAAWriB,EACX6D,GAAO,MACPia,IAAe,CAAC,QAAS,SAAU,MAAO,YAAa,eAAgB,iBAAkB,WAAY,SAAU,cAAe,aAAc,cAAe,eAAgB,KAAK,EAChLw1D,OAA+BjxD,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdwK,EAAMxK,EAAK,IACXqlB,EAAYrlB,EAAK,UACjBigC,EAAejgC,EAAK,aACpB2vB,EAAiB3vB,EAAK,eACtBgI,EAAWhI,EAAK,SAChBu7B,EAASv7B,EAAK,OACd4e,EAAc5e,EAAK,YACnB6kB,EAAa7kB,EAAK,WAClBG,EAAcH,EAAK,YACnBkf,EAAelf,EAAK,aACpByuC,EAAMzuC,EAAK,IA2Bb,OAAO3d,EAAMlB,GAAM,CACjB,YAAa,SAAqBuiB,EAAG,CACnC,OAAOmtD,EAAUntD,CAAC,CACnB,EACD,aAAc,SAAsBA,EAAG,CACrC,OAAOotD,EAAWptD,CAAC,CACpB,EACD,MAAO,SAAezkB,EAAG,CAEvB,IAAIykB,EAAIhD,EAAOzhB,CAAC,EAEZod,EAAIw0D,EAAUntD,CAAC,EAEnB,MAAO,CACL,EAAGrH,EAAE,EAAE,QAAS,EAChB,EAAGA,EAAE,EAAE,QAAS,EAChB,EAAGA,EAAE,CACb,CACK,CACL,CAAG,EACD,SAASw0D,EAAUntD,EAAG,CAEpB,IAAI8Q,EAAO9Q,EAAE,MAAM,CAAC,EAChB+Q,EAAU/Q,EAAE,MAAM,CAAC,EAEnB3Q,EAAI,KAAK,IAAIyhB,EAAMC,CAAO,EAE1B9E,KAAWtvB,IAAQ,OAAOqjB,EAAE,KAAK,EAEjCqtD,EAAQ,CAAA,EACRC,EAAQ,CAACx8C,EAAMzhB,CAAC,EAEhBk+D,EAAQ,CAAA,EACRC,EAAQ,CAACn+D,EAAG0hB,CAAO,EAEnBr6B,EAAG2oB,EAAGF,EAEN9d,EAAI,CAAA,EACR,IAAK3K,EAAI,EAAGA,EAAIo6B,EAAMp6B,IACpB2K,EAAE3K,CAAC,EAAIA,EAGT,IAAK2oB,EAAI,EAAGA,EAAI0R,EAAS1R,IAAK,CAE5B,GAAIA,EAAI,EAEN,IAAK3oB,EAAI,EAAGA,EAAIo6B,EAAMp6B,IAAK,CAEzB,IAAI4N,EAAM,KAAK,IAAI5N,EAAG2oB,CAAC,EAEnB3d,EAAI,EAER,IAAKyd,EAAI,EAAGA,EAAI7a,EAAK6a,IAEnBzd,EAAIigC,EAAUjgC,EAAGuqC,EAAehgB,EAAKv1B,CAAC,EAAEyoB,CAAC,EAAG8M,EAAK9M,CAAC,EAAEE,CAAC,CAAC,CAAC,EAEzD4M,EAAKv1B,CAAC,EAAE2oB,CAAC,EAAIiF,EAAS2H,EAAKv1B,CAAC,EAAE2oB,CAAC,EAAG3d,CAAC,CACpC,CAGH,IAAImlB,EAAKxH,EACLouD,EAAQ,EACRrqB,EAAM,EAEV,IAAK1sD,EAAI2oB,EAAG3oB,EAAIo6B,EAAMp6B,IAAK,CAEzB,IAAI4wB,EAAI2E,EAAKv1B,CAAC,EAAE2oB,CAAC,EAEbquD,EAAO5mD,EAAIQ,CAAC,EAEZuwB,EAAO61B,EAAMD,CAAK,IAEpB5mD,EAAKnwB,EAEL+2E,EAAQC,EAERtqB,EAAM97B,EAET,CASD,GAPIjI,IAAMwH,IAERxlB,EAAEge,CAAC,EAAI,CAAChe,EAAEwlB,CAAE,EAAGxlB,EAAEwlB,CAAE,EAAIxlB,EAAEge,CAAC,CAAC,EAAE,CAAC,EAE9B5C,EAAY,UAAU4C,EAAGwH,EAAIoF,CAAI,GAG/B5M,EAAIyR,EAEN,IAAKp6B,EAAI2oB,EAAI,EAAG3oB,EAAIo6B,EAAMp6B,IAAK,CAE7B,IAAIi3E,EAAM1hD,EAAKv1B,CAAC,EAAE2oB,CAAC,EACd6b,EAAYyyC,EAAK,CAAC,IAErB1hD,EAAKv1B,CAAC,EAAE2oB,CAAC,EAAIk9B,EAAatwB,EAAKv1B,CAAC,EAAE2oB,CAAC,EAAG+jC,CAAG,EAE5C,CAEJ,CAED,IAAK/jC,EAAI,EAAGA,EAAI0R,EAAS1R,IAEvB,IAAK3oB,EAAI,EAAGA,EAAIo6B,EAAMp6B,IAAK,CAYzB,GAVI2oB,IAAM,IAEJ3oB,EAAIq6B,IAENw8C,EAAM72E,CAAC,EAAI,IAGb22E,EAAM32E,CAAC,EAAI,IAGTA,EAAI2oB,EAAG,CAEL3oB,EAAIq6B,IAENw8C,EAAM72E,CAAC,EAAE2oB,CAAC,EAAI4M,EAAKv1B,CAAC,EAAE2oB,CAAC,GAGrBA,EAAIyR,IAENu8C,EAAM32E,CAAC,EAAE2oB,CAAC,EAAI,GAEhB,QACD,CAED,GAAI3oB,IAAM2oB,EAAG,CAEP3oB,EAAIq6B,IAENw8C,EAAM72E,CAAC,EAAE2oB,CAAC,EAAI4M,EAAKv1B,CAAC,EAAE2oB,CAAC,GAGrBA,EAAIyR,IAENu8C,EAAM32E,CAAC,EAAE2oB,CAAC,EAAI,GAEhB,QACD,CAEG3oB,EAAIq6B,IAENw8C,EAAM72E,CAAC,EAAE2oB,CAAC,EAAI,GAGZA,EAAIyR,IAENu8C,EAAM32E,CAAC,EAAE2oB,CAAC,EAAI4M,EAAKv1B,CAAC,EAAE2oB,CAAC,EAE1B,CAGH,IAAIwN,EAAI,IAAIpQ,EAAY,CACtB,KAAM4wD,EACN,KAAMC,CACZ,CAAK,EAEG3mD,GAAI,IAAIlK,EAAY,CACtB,KAAM8wD,EACN,KAAMC,CACZ,CAAK,EAEGnxC,EAAK,CAAA,EACT,IAAK3lC,EAAI,EAAG2Y,EAAIhO,EAAE,OAAQ3K,EAAI2Y,EAAG3Y,IAC/B2lC,EAAGh7B,EAAE3K,CAAC,CAAC,EAAIA,EAGb,MAAO,CACL,EAAGm2B,EACH,EAAGlG,GACH,EAAG0V,EACH,SAAU,UAAoB,CAC5B,MAAO,MAAQ,KAAK,EAAE,SAAU,EAAG;AAAA,KAAU,KAAK,EAAE,SAAU,EAAG;AAAA,KAAU,KAAK,CACjF,CACP,CACG,CACD,SAAS+wC,EAAWptD,EAAG,CAErB,IAAI8Q,EAAO9Q,EAAE,MAAM,CAAC,EAChB+Q,EAAU/Q,EAAE,MAAM,CAAC,EAEnB3Q,EAAI,KAAK,IAAIyhB,EAAMC,CAAO,EAE1B91B,EAAS+kB,EAAE,QACX7c,EAAQ6c,EAAE,OACVsc,EAAMtc,EAAE,KAER4tD,EAAU,CAAA,EACVC,EAAS,CAAA,EACTC,EAAO,CAAA,EACPR,EAAQ,CAACx8C,EAAMzhB,CAAC,EAEhB0+D,EAAU,CAAA,EACVC,EAAS,CAAA,EACTC,EAAO,CAAA,EACPT,EAAQ,CAACn+D,EAAG0hB,CAAO,EAEnBr6B,EAAG2oB,EAAGF,EAEN+uD,EAAO,CAAA,EACPC,EAAO,CAAA,EACX,IAAKz3E,EAAI,EAAGA,EAAIo6B,EAAMp6B,IACpBw3E,EAAKx3E,CAAC,EAAIA,EACVy3E,EAAKz3E,CAAC,EAAIA,EAGZ,IAAI03E,EAAc,SAAqBv0E,EAAGqX,EAAG,CAE3C,IAAIotB,GAAK6vC,EAAKt0E,CAAC,EACX0kC,GAAK4vC,EAAKj9D,CAAC,EAEfg9D,EAAK5vC,EAAE,EAAIptB,EACXg9D,EAAK3vC,EAAE,EAAI1kC,EAEXs0E,EAAKt0E,CAAC,EAAI0kC,GACV4vC,EAAKj9D,CAAC,EAAIotB,EAChB,EAEQ5N,EAAQ,UAAiB,CAE3B,IAAI29C,EAAM,IAAItjB,EAEV1rC,EAAIyR,IAENg9C,EAAK,KAAKF,EAAQ,MAAM,EAExBA,EAAQ,KAAK,CAAC,EACdC,EAAO,KAAKxuD,CAAC,GAGf4uD,EAAK,KAAKF,EAAQ,MAAM,EAExB,IAAIp7C,EAAK2J,EAAIjd,CAAC,EACVuT,GAAK0J,EAAIjd,EAAI,CAAC,EAElB,IAAKF,EAAIwT,EAAIxT,EAAIyT,GAAIzT,IAEnBzoB,EAAIyM,EAAMgc,CAAC,EAEXkvD,EAAI,IAAIH,EAAKx3E,CAAC,EAAGuE,EAAOkkB,CAAC,CAAC,EAGxBE,EAAI,GAENgvD,EAAI,QAAQ,EAAGhvD,EAAI,EAAG,SAAUF,GAAGmvD,GAAK,CAEtC9yC,EAAa,YAAYrc,GAAGyuD,EAASC,EAAQC,EAAM,SAAUp3E,GAAG63E,GAAK,CAE/D73E,GAAIyoB,IAENkvD,EAAI,WAAW33E,GAAGyqC,EAAW8K,EAAesiC,GAAKD,EAAG,CAAC,CAAC,CAEpE,CAAW,CACX,CAAS,EAGH,IAAIznD,GAAKxH,EACL+jC,GAAMirB,EAAI,IAAIhvD,CAAC,EACfouD,GAAQ3mD,EAAIs8B,EAAG,EAEnBirB,EAAI,QAAQhvD,EAAI,EAAGyR,EAAO,EAAG,SAAUj3B,GAAGytB,GAAG,CAE3C,IAAIomD,GAAO5mD,EAAIQ,EAAC,EAEZuwB,EAAO61B,GAAMD,EAAK,IAEpB5mD,GAAKhtB,GAEL4zE,GAAQC,GAERtqB,GAAM97B,GAEhB,CAAO,EAEGjI,IAAMwH,KAER2U,EAAa,UAAUnc,EAAGwH,GAAIymD,EAAM,CAAC,EAAGM,EAASC,EAAQC,CAAI,EAE7DtyC,EAAa,UAAUnc,EAAGwH,GAAI2mD,EAAM,CAAC,EAAGO,EAASC,EAAQC,CAAI,EAE7DI,EAAI,KAAKhvD,EAAGwH,EAAE,EAEdunD,EAAY/uD,EAAGwH,EAAE,GAGnBwnD,EAAI,QAAQ,EAAGv9C,EAAO,EAAG,SAAUj3B,GAAGytB,GAAG,CAEnCztB,IAAKwlB,GAEP0uD,EAAQ,KAAKzmD,EAAC,EACd0mD,EAAO,KAAKn0E,EAAC,IAGbytB,GAAIi1B,EAAaj1B,GAAG87B,EAAG,EAElBloB,EAAY5T,GAAG,CAAC,IAEnBsmD,EAAQ,KAAKtmD,EAAC,EACdumD,EAAO,KAAKh0E,EAAC,GAGzB,CAAO,CACP,EACI,IAAKwlB,EAAI,EAAGA,EAAI0R,EAAS1R,IACvBqR,IAGF,OAAAu9C,EAAK,KAAKF,EAAQ,MAAM,EACxBD,EAAK,KAAKF,EAAQ,MAAM,EAGjB,CACL,EAAG,IAAIpyC,EAAa,CAClB,OAAQoyC,EACR,MAAOC,EACP,IAAKC,EACL,KAAMR,CACd,CAAO,EACD,EAAG,IAAI9xC,EAAa,CAClB,OAAQuyC,EACR,MAAOC,EACP,IAAKC,EACL,KAAMT,CACd,CAAO,EACD,EAAGU,EACH,SAAU,UAAoB,CAC5B,MAAO,MAAQ,KAAK,EAAE,SAAU,EAAG;AAAA,KAAU,KAAK,EAAE,SAAU,EAAG;AAAA,KAAU,KAAK,CACjF,CACP,CACG,CACH,CAAC,EACDjB,GAAA,UAAoBC,cC7XhB72E,IAAyBY,GAC7B,OAAO,eAAeu3E,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAI7wE,IAAYtH,IAAuBuD,GAAA,CAAyC,EAC5EqiB,IAAW9gB,EACXsC,GAAO,KACPia,IAAe,CAAC,QAAS,SAAU,QAAS,WAAY,SAAU,QAAS,OAAQ,OAAQ,OAAQ,aAAc,YAAa,eAAgB,iBAAkB,WAAY,SAAS,EACrL+2D,OAA8BxyD,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACtF,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdpM,EAAQoM,EAAK,MACbk5B,EAAWl5B,EAAK,SAChBke,EAASle,EAAK,OACd2zB,EAAQ3zB,EAAK,MACb1N,EAAO0N,EAAK,KACZ+L,EAAO/L,EAAK,KACZw2B,EAAOx2B,EAAK,KACZ6kB,EAAa7kB,EAAK,WAClBqlB,EAAYrlB,EAAK,UACjBigC,EAAejgC,EAAK,aACpB2vB,EAAiB3vB,EAAK,eACtBgI,EAAWhI,EAAK,SAChBwe,EAAUxe,EAAK,QA4CjB,SAAW3e,IAAU,SAAYgB,EAAMlB,GAAM,CAC3C,YAAa,SAAqBuiB,EAAG,CACnC,OAAO0uD,EAAS1uD,CAAC,CAClB,EACD,aAAc,SAAsBA,EAAG,CACrC,OAAO2uD,EAAW,CACnB,EACD,MAAO,SAAepzE,EAAG,CAEvB,IAAIykB,EAAIhD,EAAOzhB,CAAC,EAEZod,EAAI+1D,EAAS1uD,CAAC,EAElB,MAAO,CACL,EAAGrH,EAAE,EAAE,QAAS,EAChB,EAAGA,EAAE,EAAE,QAAS,CACxB,CACK,CACL,CAAG,EAAG,CACF,aAAci2D,CAClB,CAAG,EACD,SAASA,EAAa5uD,EAAG,CAEvB,IAAI8Q,EAAO9Q,EAAE,MAAM,CAAC,EAChB21B,EAAO31B,EAAE,MAAM,CAAC,EAEhBm+B,EAAI3I,EAAS,CAAC1kB,CAAI,EAAG,OAAO,EAC5B+9C,EAAQ1wB,EAAE,MACV6F,EAAIhkC,EAAE,QACN8uD,EAAQ9qB,EAAE,MAGVttD,EAAG2oB,EAAGF,EACNmE,EAAIpT,EAAM,CAAC4gB,CAAI,EAAG,EAAE,EACxB,IAAK3R,EAAI,EAAGA,EAAI,KAAK,IAAIw2B,EAAM7kB,CAAI,EAAG,EAAE3R,EAAG,CAyBzC,IAAIypC,EAAQkmB,EAAM3vD,CAAC,EAAEA,CAAC,EAClB4vD,EAAM5tC,EAAW8O,EAAM2Y,EAAO,CAAC,EAAI,EAAIh6C,EAAKg6C,CAAK,CAAC,EAClDomB,EAAUl8B,EAAKi8B,CAAG,EAClBE,EAAe,EACnB,IAAKv4E,EAAIyoB,EAAGzoB,EAAIo6B,EAAMp6B,IACpBu4E,EAAettC,EAAUstC,EAAchjC,EAAe6iC,EAAMp4E,CAAC,EAAEyoB,CAAC,EAAG2zB,EAAKg8B,EAAMp4E,CAAC,EAAEyoB,CAAC,CAAC,CAAC,CAAC,EAEvF,IAAI+vD,EAAQjjC,EAAe8iC,EAAK1mD,EAAK4mD,CAAY,CAAC,EAClD,GAAI,CAACz0C,EAAO00C,CAAK,EAAG,CAElB,IAAIC,EAAK7qD,EAASskC,EAAOsmB,CAAK,EAI9B,IADA5rD,EAAEnE,CAAC,EAAI,EACFzoB,EAAIyoB,EAAI,EAAGzoB,EAAIo6B,EAAMp6B,IACxB4sB,EAAE5sB,CAAC,EAAI6lD,EAAauyB,EAAMp4E,CAAC,EAAEyoB,CAAC,EAAGgwD,CAAE,EAIrC,IAAIj5C,EAAMiL,EAAW2R,EAAKyJ,EAAa4yB,EAAID,CAAK,CAAC,CAAC,EAC9CxtE,EAAI,OAcR,IAAK2d,EAAIF,EAAGE,EAAIs2B,EAAMt2B,IAAK,CAIzB,IAHA3d,EAAI,EAGChL,EAAIyoB,EAAGzoB,EAAIo6B,EAAMp6B,IACpBgL,EAAIigC,EAAUjgC,EAAGuqC,EAAe6G,EAAKxvB,EAAE5sB,CAAC,CAAC,EAAGo4E,EAAMp4E,CAAC,EAAE2oB,CAAC,CAAC,CAAC,EAK1D,IADA3d,EAAIuqC,EAAevqC,EAAGw0B,CAAG,EACpBx/B,EAAIyoB,EAAGzoB,EAAIo6B,EAAMp6B,IACpBo4E,EAAMp4E,CAAC,EAAE2oB,CAAC,EAAI4sB,EAAe3nB,EAASwqD,EAAMp4E,CAAC,EAAE2oB,CAAC,EAAG4sB,EAAe3oB,EAAE5sB,CAAC,EAAGgL,CAAC,CAAC,EAAGstE,CAAO,CAEvF,CAQD,IAAKt4E,EAAI,EAAGA,EAAIo6B,EAAMp6B,IAAK,CAIzB,IAHAgL,EAAI,EAGC2d,EAAIF,EAAGE,EAAIyR,EAAMzR,IACpB3d,EAAIigC,EAAUjgC,EAAGuqC,EAAe4iC,EAAMn4E,CAAC,EAAE2oB,CAAC,EAAGiE,EAAEjE,CAAC,CAAC,CAAC,EAKpD,IADA3d,EAAIuqC,EAAevqC,EAAGw0B,CAAG,EACpB7W,EAAIF,EAAGE,EAAIyR,EAAM,EAAEzR,EACtBwvD,EAAMn4E,CAAC,EAAE2oB,CAAC,EAAIk9B,EAAaj4B,EAASuqD,EAAMn4E,CAAC,EAAE2oB,CAAC,EAAG4sB,EAAevqC,EAAGoxC,EAAKxvB,EAAEjE,CAAC,CAAC,CAAC,CAAC,EAAG2vD,CAAO,CAE3F,CACF,CACF,CAGD,MAAO,CACL,EAAG7wB,EACH,EAAG6F,EACH,SAAU,UAAoB,CAC5B,MAAO,MAAQ,KAAK,EAAE,SAAQ,EAAK;AAAA,KAAU,KAAK,EAAE,UACrD,CACP,CACG,CACD,SAAS0qB,EAAS1uD,EAAG,CACnB,IAAIwR,EAAMo9C,EAAa5uD,CAAC,EACpB8uD,EAAQt9C,EAAI,EAAE,MAClB,GAAIxR,EAAE,MAAM,OAAS,EAEnB,QADI6b,EAAOizC,EAAM,CAAC,EAAE,CAAC,EAAE,OAAS,UAAYh0C,EAAQ,CAAC,EAAI,EAChDpkC,EAAI,EAAGA,EAAIo4E,EAAM,OAAQ,EAAEp4E,EAClC,QAAS2oB,EAAI,EAAGA,EAAI3oB,GAAK2oB,GAAKyvD,EAAM,CAAC,GAAK,CAAA,GAAI,OAAQ,EAAEzvD,EACtDyvD,EAAMp4E,CAAC,EAAE2oB,CAAC,EAAIwc,EAIpB,OAAOrK,CACR,CACD,SAASm9C,EAAU3uD,EAAG,CACpB,MAAM,IAAI,MAAM,4CAA4C,CAC7D,CACH,CAAC,EACDwuD,GAAA,SAAmBC,0BCjOnB,OAAO,eAAeW,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAGC,IAapB,SAASA,IAAU9zE,EAAG+zE,EAAMrtD,EAAGhnB,EAAQ,CAiBrC,QAfIu3B,EAAUj3B,EAAE,QACZk3B,EAASl3B,EAAE,OACXm3B,EAAOn3B,EAAE,KACT0nC,EAAQ1nC,EAAE,MACV2nC,EAAM3nC,EAAE,UAERykB,EAAIijB,EAAM,CAAC,EACX5zB,EAAI4zB,EAAM,CAAC,EAEXI,EAAUpoC,GAAUM,EAAE,QAAU,CAAA,EAAK,KACrC82B,EAAS,CAAA,EACTiR,EAAO,CAAA,EAEPisC,EAAK,EAEApwD,EAAI,EAAGA,EAAI9P,EAAG8P,IAAK,CAE1BmkB,EAAKnkB,CAAC,EAAIowD,EAIV,QAFIlwD,EAAI4C,EAAIA,EAAE9C,CAAC,EAAIA,EAEVqwD,EAAK98C,EAAKrT,CAAC,EAAGrZ,EAAK0sB,EAAKrT,EAAI,CAAC,EAAGrlB,EAAIw1E,EAAIx1E,EAAIgM,EAAIhM,IAAK,CAE5D,IAAI2e,EAAI22D,EAAOA,EAAK78C,EAAOz4B,CAAC,CAAC,EAAIy4B,EAAOz4B,CAAC,EAEzCq4B,EAAOk9C,CAAE,EAAI52D,EAET0qB,IACFA,EAAQksC,CAAE,EAAI/8C,EAAQx4B,CAAC,GAGzBu1E,GACD,CACF,CAED,OAAAjsC,EAAKj0B,CAAC,EAAIkgE,EAEHh0E,EAAE,mBAAmB,CAC1B,OAAQ8nC,EACR,MAAOhR,EACP,IAAKiR,EACL,KAAM,CAACtjB,EAAG3Q,CAAC,EACX,SAAU6zB,CACd,CAAG,CACH,iBC9DA,OAAO,eAAeusC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACaA,GAAA,OAAGC,IAcjB,SAASA,IAAOrwD,EAAGF,EAAGmE,EAAGqsD,EAAMj5D,EAAMk5D,EAAMC,EAAO,CAEhD,IAAI7yC,EAAM,EAIV,IAFA1Z,EAAEusD,CAAK,EAAIxwD,EAEJ2d,GAAO,GAAG,CAEf,IAAI37B,EAAIiiB,EAAEusD,EAAQ7yC,CAAG,EAEjBtmC,EAAI4sB,EAAEqsD,EAAOtuE,CAAC,EACd3K,IAAM,IAERsmC,IAEA4yC,EAAKzwD,GAAG,EAAI9d,IAGZiiB,EAAEqsD,EAAOtuE,CAAC,EAAIiiB,EAAE5M,EAAOhgB,CAAC,EAExB,EAAEsmC,EAEF1Z,EAAEusD,EAAQ7yC,CAAG,EAAItmC,EAEpB,CACD,OAAOyoB,CACT,CC3CA,OAAO,eAAe2wD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACaA,GAAA,OAAGC,IACjB,IAAIC,IAAU/4E,GASd,SAAS84E,IAAOrlB,EAAQr7C,EAAG,CAEzB,GAAI,CAACq7C,EACH,OAAO,KAGT,IAAIvrC,EAAI,EACJE,EAEAuwD,EAAO,CAAA,EAEPtsD,EAAI,CAAA,EACJqsD,EAAO,EACPj5D,EAAOrH,EACPwgE,EAAQ,EAAIxgE,EAEhB,IAAKgQ,EAAI,EAAGA,EAAIhQ,EAAGgQ,IAEjBiE,EAAEqsD,EAAOtwD,CAAC,EAAI,GAGhB,IAAKA,EAAIhQ,EAAI,EAAGgQ,GAAK,EAAGA,IAElBqrC,EAAOrrC,CAAC,IAAM,KAIlBiE,EAAE5M,EAAO2I,CAAC,EAAIiE,EAAEqsD,EAAOjlB,EAAOrrC,CAAC,CAAC,EAChCiE,EAAEqsD,EAAOjlB,EAAOrrC,CAAC,CAAC,EAAIA,GAGxB,IAAKA,EAAI,EAAGA,EAAIhQ,EAAGgQ,IAEbqrC,EAAOrrC,CAAC,IAAM,KAIlBF,KAAQ6wD,IAAQ,QAAQ3wD,EAAGF,EAAGmE,EAAGqsD,EAAMj5D,EAAMk5D,EAAMC,CAAK,GAE1D,OAAOD,CACT,WCrDA,OAAO,eAAeK,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAGC,IAUlB,SAASA,IAAQ30E,EAAG40E,EAAK,CAEvB,GAAI,CAAC50E,EACH,OAAO,KAGT,IAAIk3B,EAASl3B,EAAE,OACXm3B,EAAOn3B,EAAE,KACT0nC,EAAQ1nC,EAAE,MAEVykB,EAAIijB,EAAM,CAAC,EACX5zB,EAAI4zB,EAAM,CAAC,EAGXynB,EAAS,CAAA,EAGTpnC,EAAI,CAAA,EACJ8sD,EAAW,EACXlzE,EAAOmS,EAEP3Y,EAAG25E,EAGP,GAAIF,EAEF,IAAKz5E,EAAI,EAAGA,EAAIspB,EAAGtpB,IACjB4sB,EAAEpmB,EAAOxG,CAAC,EAAI,GAIlB,QAASyoB,EAAI,EAAGA,EAAI9P,EAAG8P,IAAK,CAE1BurC,EAAOvrC,CAAC,EAAI,GAEZmE,EAAE8sD,EAAWjxD,CAAC,EAAI,GAElB,QAASmvB,EAAK5b,EAAKvT,CAAC,EAAG0K,EAAK6I,EAAKvT,EAAI,CAAC,EAAG9d,EAAIitC,EAAIjtC,EAAIwoB,EAAIxoB,IAAK,CAE5D,IAAIsX,EAAI8Z,EAAOpxB,CAAC,EAIhB,IAFA3K,EAAIy5E,EAAM7sD,EAAEpmB,EAAOyb,CAAC,EAAIA,EAEjBjiB,IAAM,IAAMA,EAAIyoB,EAAGzoB,EAAI25E,EAE5BA,EAAQ/sD,EAAE8sD,EAAW15E,CAAC,EAEtB4sB,EAAE8sD,EAAW15E,CAAC,EAAIyoB,EAEdkxD,IAAU,KACZ3lB,EAAOh0D,CAAC,EAAIyoB,GAGZgxD,IACF7sD,EAAEpmB,EAAOyb,CAAC,EAAIwG,EAEjB,CACF,CACD,OAAOurC,CACT,iBCxEA,OAAO,eAAe4lB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAGC,IAgBlB,SAASA,IAAQh1E,EAAGD,EAAUoS,EAAO,CAWnC,QATI8kB,EAAUj3B,EAAE,QACZk3B,EAASl3B,EAAE,OACXm3B,EAAOn3B,EAAE,KACT0nC,EAAQ1nC,EAAE,MAEV8T,EAAI4zB,EAAM,CAAC,EAEXssC,EAAK,EAEAlwD,EAAI,EAAGA,EAAIhQ,EAAGgQ,IAAK,CAE1B,IAAIhe,EAAIqxB,EAAKrT,CAAC,EAGd,IADAqT,EAAKrT,CAAC,EAAIkwD,EACHluE,EAAIqxB,EAAKrT,EAAI,CAAC,EAAGhe,IAElB/F,EAASm3B,EAAOpxB,CAAC,EAAGge,EAAGmT,EAAUA,EAAQnxB,CAAC,EAAI,EAAGqM,CAAK,IAExD+kB,EAAO88C,CAAE,EAAI98C,EAAOpxB,CAAC,EAEjBmxB,IACFA,EAAQ+8C,CAAE,EAAI/8C,EAAQnxB,CAAC,GAGzBkuE,IAGL,CAED,OAAA78C,EAAKrjB,CAAC,EAAIkgE,EAEV98C,EAAO,OAAO88C,EAAI98C,EAAO,OAAS88C,CAAE,EAEhC/8C,GACFA,EAAQ,OAAO+8C,EAAI/8C,EAAQ,OAAS+8C,CAAE,EAGjCA,CACT,WC3DA,OAAO,eAAeiB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACaA,GAAA,OAAGC,IAQjB,SAASA,IAAO/5E,EAAG,CAEjB,MAAO,CAACA,EAAI,CACd,CCdA,OAAO,eAAeg6E,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIz0D,IAAWhlB,EACX05E,IAAW/2E,GACXg3E,GAAUz1E,GACV60E,IAAUpyE,GACVH,IAAO,QACPia,IAAe,CAAC,MAAO,WAAY,WAAW,EAC9Cm5D,OAAiC50D,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CACzF,IAAI0K,EAAM1K,EAAK,IACb6vB,EAAW7vB,EAAK,SAChBo/B,EAAYp/B,EAAK,UAYnB,OAAO,SAAe8sC,EAAO7tD,EAAG,CAE9B,GAAI,CAACA,GAAK6tD,GAAS,GAAKA,EAAQ,EAC9B,OAAO,KAGT,IAAInmB,EAAQ1nC,EAAE,MAEVykB,EAAIijB,EAAM,CAAC,EACX5zB,EAAI4zB,EAAM,CAAC,EAEX6tC,EAAQ,EAERC,EAAQ,KAAK,IAAI,GAAI,GAAK,KAAK,KAAK1hE,CAAC,CAAC,EAC1C0hE,EAAQ,KAAK,IAAI1hE,EAAI,EAAG0hE,CAAK,EAE7B,IAAIC,EAAKC,EAAoB7nB,EAAO7tD,EAAGykB,EAAG3Q,EAAG0hE,CAAK,KAE9CJ,IAAS,SAASK,EAAIp8B,EAAO,IAAI,EAsCrC,QApCIviB,EAAS2+C,EAAG,OACZ1tC,EAAO0tC,EAAG,KAGVE,EAAM5tC,EAAKj0B,CAAC,EAGZga,EAAI,CAAA,EAGJ8nD,EAAI,CAAA,EACJz1E,EAAM,EACN01E,EAAK/hE,EAAI,EACTqH,EAAO,GAAKrH,EAAI,GAChBsgE,EAAO,GAAKtgE,EAAI,GAChBgiE,EAAO,GAAKhiE,EAAI,GAChBiiE,EAAS,GAAKjiE,EAAI,GAClBiU,EAAI,GAAKjU,EAAI,GACbkiE,EAAQ,GAAKliE,EAAI,GAGjB7M,EAAO6mB,EAGP+I,EAAOo/C,EAAyBniE,EAAGi0B,EAAM6tC,EAAGz1E,EAAKi0E,EAAMntE,EAAMkU,EAAM66D,EAAOH,EAAI9tD,EAAG+tD,EAAMC,CAAM,EAG7FG,EAAMC,EAAuBriE,EAAGi0B,EAAM6tC,EAAGG,EAAQD,EAAM/tD,EAAGytD,EAAOK,EAAIzB,EAAMntE,EAAMkU,CAAI,EAGrFi7D,EAAS,EAGTj7E,EAAG2oB,EAAGF,EAAGyT,GAAIg/C,EAAI9hE,EAAG+hE,GAAI/pD,GAAIgqD,GAAKC,GAAIC,GAAKnoD,GAAIC,GAAImoD,GAAIrlD,GAAG/V,GAGtD46D,EAAMpiE,GAAG,CAId,IAAK8P,EAAI,GAAIwyD,EAAStiE,IAAM8P,EAAIgyD,EAAExB,EAAOgC,CAAM,KAAO,GAAIA,IAAU,CAGhER,EAAEz6D,EAAOyI,CAAC,IAAM,KAClB3c,EAAK2uE,EAAEz6D,EAAOyI,CAAC,CAAC,EAAI,IAGtBgyD,EAAExB,EAAOgC,CAAM,EAAIR,EAAEz6D,EAAOyI,CAAC,EAE7B,IAAI+yD,EAAQf,EAAEE,EAAOlyD,CAAC,EAElBgzD,GAAMhB,EAAEC,EAAKjyD,CAAC,EAElBsyD,GAAOU,GAKP,IAAIC,GAAK,EAETjB,EAAEC,EAAKjyD,CAAC,EAAI,CAACgzD,GACb,IAAI9wE,GAAIiiC,EAAKnkB,CAAC,EAEVkzD,GAAMH,IAAU,EAAI7wE,GAAI6vE,EACxBoB,GAAMD,GACV,IAAKz/C,GAAK,EAAGA,IAAMs/C,EAAQ,EAAGt/C,KAAM,CAelC,IAdIA,GAAKs/C,GAEPpiE,EAAIqP,EAEJ0yD,GAAKxwE,GAELymB,GAAKqpD,EAAEz1E,EAAMyjB,CAAC,EAAI+yD,IAGlBpiE,EAAIuiB,EAAOhxB,IAAG,EACdwwE,GAAKvuC,EAAKxzB,CAAC,EAEXgY,GAAKqpD,EAAEz1E,EAAMoU,CAAC,GAEX8hE,EAAK,EAAGA,GAAM9pD,GAAI8pD,IACrBl7E,EAAI27B,EAAOw/C,IAAI,EAEV,GAAAC,GAAMX,EAAEC,EAAK16E,CAAC,IAAM,KAIzB07E,IAAMN,GAENX,EAAEC,EAAK16E,CAAC,EAAI,CAACo7E,GAEbz/C,EAAOigD,IAAK,EAAI57E,EACZy6E,EAAEz6D,EAAOhgB,CAAC,IAAM,KAClB8L,EAAK2uE,EAAEz6D,EAAOhgB,CAAC,CAAC,EAAI8L,EAAK9L,CAAC,GAGxB8L,EAAK9L,CAAC,IAAM,GACdy6E,EAAEz6D,EAAOlU,EAAK9L,CAAC,CAAC,EAAIy6E,EAAEz6D,EAAOhgB,CAAC,EAE9By6E,EAAExB,EAAOwB,EAAEG,EAAS56E,CAAC,CAAC,EAAIy6E,EAAEz6D,EAAOhgB,CAAC,GAGpCoZ,IAAMqP,IAERmkB,EAAKxzB,CAAC,KAAQ8gE,GAAQ,QAAQzxD,CAAC,EAE/BgyD,EAAE7tD,EAAIxT,CAAC,EAAI,EAEd,CAmBD,IAjBIoiE,IAAU,IACZhB,EAAMoB,IAGRnB,EAAEG,EAASnyD,CAAC,EAAIizD,GAEhB9uC,EAAKnkB,CAAC,EAAIkzD,GACVlB,EAAEz1E,EAAMyjB,CAAC,EAAImzD,GAAMD,GAEnBlB,EAAEE,EAAOlyD,CAAC,EAAI,GAMdiT,EAAOmgD,EAAQngD,EAAM0+C,EAAOK,EAAG7tD,EAAGjU,CAAC,EAE9B0iE,GAAKM,GAAKN,GAAKO,GAAKP,KAGvB,GAFAr7E,EAAI27B,EAAO0/C,EAAE,EAER,GAAAC,GAAMb,EAAEE,EAAO36E,CAAC,IAAM,GAI3B,CAAAo7E,GAAM,CAACX,EAAEC,EAAK16E,CAAC,EACf,IAAI87E,GAAOpgD,EAAO0/C,GAElB,IAAKzwE,GAAIiiC,EAAK5sC,CAAC,EAAGmzB,GAAKyZ,EAAK5sC,CAAC,EAAIs7E,GAAM,EAAG3wE,IAAKwoB,GAAIxoB,KACjDyO,EAAIuiB,EAAOhxB,EAAC,EACR8vE,EAAE7tD,EAAIxT,CAAC,GAAKsiB,EAEd++C,EAAE7tD,EAAIxT,CAAC,GAAKgiE,GACHX,EAAE7tD,EAAIxT,CAAC,IAAM,IAEtBqhE,EAAE7tD,EAAIxT,CAAC,EAAIqhE,EAAEG,EAASxhE,CAAC,EAAI0iE,IAUjC,IAAKT,GAAKM,GAAKN,GAAKO,GAAKP,KAAM,CAO7B,IALAr7E,EAAI27B,EAAO0/C,EAAE,EACbloD,GAAKyZ,EAAK5sC,CAAC,EACXozB,GAAKD,GAAKsnD,EAAEE,EAAO36E,CAAC,EAAI,EACxBu7E,GAAKpoD,GAEA+C,GAAI,EAAG/V,GAAI,EAAGxV,GAAIwoB,GAAIxoB,IAAKyoB,GAAIzoB,KAGlC,GAFAyO,EAAIuiB,EAAOhxB,EAAC,EAER8vE,EAAE7tD,EAAIxT,CAAC,IAAM,EAAG,CAElB,IAAI2iE,GAAOtB,EAAE7tD,EAAIxT,CAAC,EAAIsiB,EAClBqgD,GAAO,GAET57D,IAAK47D,GAELpgD,EAAO4/C,IAAI,EAAIniE,EAEf8c,IAAK9c,IAGLwzB,EAAKxzB,CAAC,KAAQ8gE,GAAQ,QAAQzxD,CAAC,EAE/BgyD,EAAE7tD,EAAIxT,CAAC,EAAI,EAEd,CAGHqhE,EAAEE,EAAO36E,CAAC,EAAIu7E,GAAKpoD,GAAK,EACxB,IAAI6oD,GAAKT,GACLU,GAAK9oD,GAAKsnD,EAAEz1E,EAAMhF,CAAC,EAEvB,IAAK2K,GAAIyoB,GAAK,EAAGzoB,GAAIsxE,GAAItxE,KAAK,CAC5Bge,EAAIgT,EAAOhxB,EAAC,EAEZ,IAAIuxE,GAAMzB,EAAEC,EAAK/xD,CAAC,EACduzD,IAAO,IAIX/7D,IAAK+7D,GAELvgD,EAAO4/C,IAAI,EAAI5yD,EAEfuN,IAAKvN,EACN,CAEGxI,KAAM,GAERysB,EAAK5sC,CAAC,KAAQk6E,GAAQ,QAAQzxD,CAAC,EAC/B2yD,GAAM,CAACX,EAAEC,EAAK16E,CAAC,EAEf07E,IAAMN,GAENK,IAAOL,GACPL,GAAOK,GACPX,EAAEC,EAAK16E,CAAC,EAAI,EAEZy6E,EAAEE,EAAO36E,CAAC,EAAI,KAGdy6E,EAAEG,EAAS56E,CAAC,EAAI,KAAK,IAAIy6E,EAAEG,EAAS56E,CAAC,EAAGmgB,EAAC,EAEzCwb,EAAO4/C,EAAE,EAAI5/C,EAAOqgD,EAAE,EAEtBrgD,EAAOqgD,EAAE,EAAIrgD,EAAOxI,EAAE,EAEtBwI,EAAOxI,EAAE,EAAI1K,EAEbgyD,EAAEz1E,EAAMhF,CAAC,EAAIu7E,GAAKpoD,GAAK,EAEvB+C,IAAKA,GAAI,EAAI,CAACA,GAAIA,IAAKvd,EAEvB8hE,EAAEz6D,EAAOhgB,CAAC,EAAIy6E,EAAEI,EAAQ3kD,EAAC,EACzBukD,EAAEI,EAAQ3kD,EAAC,EAAIl2B,EAEf8L,EAAK9L,CAAC,EAAIk2B,GAEb,CASD,IAPAukD,EAAEG,EAASnyD,CAAC,EAAIizD,GAChBtB,EAAQ,KAAK,IAAIA,EAAOsB,EAAE,EAE1BhgD,EAAOmgD,EAAQngD,EAAO0+C,EAAOA,EAAOK,EAAG7tD,EAAGjU,CAAC,EAItC0iE,GAAKM,GAAKN,GAAKO,GAAKP,KAGvB,GAFAr7E,EAAI27B,EAAO0/C,EAAE,EAET,EAAAZ,EAAEC,EAAK16E,CAAC,GAAK,GAQjB,IAJAk2B,GAAIpqB,EAAK9L,CAAC,EACVA,EAAIy6E,EAAEI,EAAQ3kD,EAAC,EAEfukD,EAAEI,EAAQ3kD,EAAC,EAAI,GACRl2B,IAAM,IAAMy6E,EAAEz6D,EAAOhgB,CAAC,IAAM,GAAIA,EAAIy6E,EAAEz6D,EAAOhgB,CAAC,EAAG07B,IAAQ,CAG9D,IAFAtK,GAAKqpD,EAAEz1E,EAAMhF,CAAC,EACds7E,GAAMb,EAAEE,EAAO36E,CAAC,EACX2K,GAAIiiC,EAAK5sC,CAAC,EAAI,EAAG2K,IAAKiiC,EAAK5sC,CAAC,EAAIoxB,GAAK,EAAGzmB,KAC3C8vE,EAAE7tD,EAAI+O,EAAOhxB,EAAC,CAAC,EAAI+wB,EAErB,IAAIygD,GAAQn8E,EAEZ,IAAK2oB,EAAI8xD,EAAEz6D,EAAOhgB,CAAC,EAAG2oB,IAAM,IAAK,CAC/B,IAAIrhB,GAAKmzE,EAAEz1E,EAAM2jB,CAAC,IAAMyI,IAAMqpD,EAAEE,EAAOhyD,CAAC,IAAM2yD,GAC9C,IAAK3wE,GAAIiiC,EAAKjkB,CAAC,EAAI,EAAGrhB,IAAMqD,IAAKiiC,EAAKjkB,CAAC,EAAIyI,GAAK,EAAGzmB,KAE7C8vE,EAAE7tD,EAAI+O,EAAOhxB,EAAC,CAAC,IAAM+wB,IACvBp0B,GAAK,GAILA,IAEFslC,EAAKjkB,CAAC,KAAQuxD,GAAQ,QAAQl6E,CAAC,EAC/By6E,EAAEC,EAAK16E,CAAC,GAAKy6E,EAAEC,EAAK/xD,CAAC,EACrB8xD,EAAEC,EAAK/xD,CAAC,EAAI,EAEZ8xD,EAAEE,EAAOhyD,CAAC,EAAI,GAEdA,EAAI8xD,EAAEz6D,EAAO2I,CAAC,EACd8xD,EAAEz6D,EAAOm8D,EAAK,EAAIxzD,IAGlBwzD,GAAQxzD,EACRA,EAAI8xD,EAAEz6D,EAAO2I,CAAC,EAEjB,CACF,CAKH,IAAKhe,GAAIgxE,GAAKN,GAAKM,GAAKN,GAAKO,GAAKP,KAChCr7E,EAAI27B,EAAO0/C,EAAE,EAER,GAAAD,GAAM,CAACX,EAAEC,EAAK16E,CAAC,IAAM,KAI1By6E,EAAEC,EAAK16E,CAAC,EAAIo7E,GAEZj7D,GAAIs6D,EAAEG,EAAS56E,CAAC,EAAI07E,GAAKN,GACzBj7D,GAAI,KAAK,IAAIA,GAAGxH,EAAIoiE,EAAMK,EAAG,EACzBX,EAAExB,EAAO94D,EAAC,IAAM,KAClBrU,EAAK2uE,EAAExB,EAAO94D,EAAC,CAAC,EAAIngB,GAGtBy6E,EAAEz6D,EAAOhgB,CAAC,EAAIy6E,EAAExB,EAAO94D,EAAC,EACxBrU,EAAK9L,CAAC,EAAI,GACVy6E,EAAExB,EAAO94D,EAAC,EAAIngB,EAEdi7E,EAAS,KAAK,IAAIA,EAAQ96D,EAAC,EAC3Bs6D,EAAEG,EAAS56E,CAAC,EAAImgB,GAEhBwb,EAAOhxB,IAAG,EAAI3K,GAGhBy6E,EAAEC,EAAKjyD,CAAC,EAAIgzD,IAEPhB,EAAEz1E,EAAMyjB,CAAC,EAAI9d,GAAIgxE,MAAS,IAE7B/uC,EAAKnkB,CAAC,EAAI,GAEVgyD,EAAE7tD,EAAInE,CAAC,EAAI,GAET+yD,IAAU,IAEZhB,EAAM7vE,GAET,CAQD,IAAK3K,EAAI,EAAGA,EAAI2Y,EAAG3Y,IACjB4sC,EAAK5sC,CAAC,KAAQk6E,GAAQ,QAAQttC,EAAK5sC,CAAC,CAAC,EAEvC,IAAK2oB,EAAI,EAAGA,GAAKhQ,EAAGgQ,IAClB8xD,EAAExB,EAAOtwD,CAAC,EAAI,GAGhB,IAAKA,EAAIhQ,EAAGgQ,GAAK,EAAGA,IAEd8xD,EAAEC,EAAK/xD,CAAC,EAAI,IAIhB8xD,EAAEz6D,EAAO2I,CAAC,EAAI8xD,EAAExB,EAAOrsC,EAAKjkB,CAAC,CAAC,EAC9B8xD,EAAExB,EAAOrsC,EAAKjkB,CAAC,CAAC,EAAIA,GAGtB,IAAKvP,EAAIT,EAAGS,GAAK,EAAGA,IAEdqhE,EAAEC,EAAKthE,CAAC,GAAK,GAGbwzB,EAAKxzB,CAAC,IAAM,KAEdqhE,EAAEz6D,EAAO5G,CAAC,EAAIqhE,EAAExB,EAAOrsC,EAAKxzB,CAAC,CAAC,EAC9BqhE,EAAExB,EAAOrsC,EAAKxzB,CAAC,CAAC,EAAIA,GAIxB,IAAKqP,EAAI,EAAGzoB,EAAI,EAAGA,GAAK2Y,EAAG3Y,IACrB4sC,EAAK5sC,CAAC,IAAM,KACdyoB,KAAQ6wD,IAAQ,QAAQt5E,EAAGyoB,EAAGgyD,EAAGxB,EAAMj5D,EAAM2S,EAAG/F,CAAC,GAIrD,OAAA+F,EAAE,OAAOA,EAAE,OAAS,EAAG,CAAC,EAEjBA,CACX,EAqBE,SAAS4nD,EAAoB7nB,EAAO7tD,EAAGykB,EAAG3Q,EAAG0hE,EAAO,CAElD,IAAI+B,EAAKp3B,EAAUngD,CAAC,EAGpB,GAAI6tD,IAAU,GAAK/5C,IAAM2Q,EAEvB,OAAOgH,EAAIzrB,EAAGu3E,CAAE,EAIlB,GAAI1pB,IAAU,EAAG,CAOf,QALI2pB,EAASD,EAAG,OACZE,EAAOF,EAAG,KAEVhpD,EAAK,EAEAzK,EAAI,EAAGA,EAAIW,EAAGX,IAAK,CAE1B,IAAIhe,EAAI2xE,EAAK3zD,CAAC,EAId,GAFA2zD,EAAK3zD,CAAC,EAAIyK,EAEN,EAAAkpD,EAAK3zD,EAAI,CAAC,EAAIhe,EAAI0vE,GAItB,QAASlnD,EAAKmpD,EAAK3zD,EAAI,CAAC,EAAGhe,EAAIwoB,EAAIxoB,IACjC0xE,EAAOjpD,GAAI,EAAIipD,EAAO1xE,CAAC,CAE1B,CAED,OAAA2xE,EAAKhzD,CAAC,EAAI8J,EAEVvuB,EAAImgD,EAAUo3B,CAAE,EAET3mC,EAAS2mC,EAAIv3E,CAAC,CACtB,CAGD,OAAO4wC,EAAS2mC,EAAIv3E,CAAC,CACtB,CAUD,SAASi2E,EAAyBniE,EAAGi0B,EAAM6tC,EAAGz1E,EAAKi0E,EAAMntE,EAAMkU,EAAM66D,EAAOH,EAAI9tD,EAAG+tD,EAAMC,EAAQ,CAE/F,QAASnyD,EAAI,EAAGA,EAAI9P,EAAG8P,IACrBgyD,EAAEz1E,EAAMyjB,CAAC,EAAImkB,EAAKnkB,EAAI,CAAC,EAAImkB,EAAKnkB,CAAC,EAEnCgyD,EAAEz1E,EAAM2T,CAAC,EAAI,EAEb,QAAS3Y,EAAI,EAAGA,GAAK2Y,EAAG3Y,IAEtBy6E,EAAExB,EAAOj5E,CAAC,EAAI,GACd8L,EAAK9L,CAAC,EAAI,GACVy6E,EAAEz6D,EAAOhgB,CAAC,EAAI,GAEdy6E,EAAEI,EAAQ76E,CAAC,EAAI,GAEfy6E,EAAEC,EAAK16E,CAAC,EAAI,EAEZy6E,EAAE7tD,EAAI5sB,CAAC,EAAI,EAEXy6E,EAAEE,EAAO36E,CAAC,EAAI,EAEdy6E,EAAEG,EAAS56E,CAAC,EAAIy6E,EAAEz1E,EAAMhF,CAAC,EAG3B,IAAI07B,EAAOmgD,EAAQ,EAAG,EAAGpB,EAAG7tD,EAAGjU,CAAC,EAEhC,OAAA8hE,EAAEE,EAAOhiE,CAAC,EAAI,GAEdi0B,EAAKj0B,CAAC,EAAI,GAEV8hE,EAAE7tD,EAAIjU,CAAC,EAAI,EAEJ+iB,CACR,CAOD,SAASs/C,EAAuBriE,EAAGi0B,EAAM6tC,EAAGG,EAAQD,EAAM/tD,EAAGytD,EAAOK,EAAIzB,EAAMntE,EAAMkU,EAAM,CAIxF,QAFI+6D,EAAM,EAED/6E,EAAI,EAAGA,EAAI2Y,EAAG3Y,IAAK,CAE1B,IAAImgB,EAAIs6D,EAAEG,EAAS56E,CAAC,EAEpB,GAAImgB,IAAM,EAERs6D,EAAEE,EAAO36E,CAAC,EAAI,GACd+6E,IAEAnuC,EAAK5sC,CAAC,EAAI,GACVy6E,EAAE7tD,EAAI5sB,CAAC,EAAI,UACFmgB,EAAIk6D,EAEbI,EAAEC,EAAK16E,CAAC,EAAI,EAEZy6E,EAAEE,EAAO36E,CAAC,EAAI,GACd+6E,IACAnuC,EAAK5sC,CAAC,KAAQk6E,GAAQ,QAAQvhE,CAAC,EAC/B8hE,EAAEC,EAAK/hE,CAAC,QACH,CACL,IAAIud,EAAIukD,EAAExB,EAAO94D,CAAC,EACd+V,IAAM,KACRpqB,EAAKoqB,CAAC,EAAIl2B,GAGZy6E,EAAEz6D,EAAOhgB,CAAC,EAAIy6E,EAAExB,EAAO94D,CAAC,EACxBs6D,EAAExB,EAAO94D,CAAC,EAAIngB,CACf,CACF,CACD,OAAO+6E,CACR,CACD,SAASc,EAAQngD,EAAM0+C,EAAOK,EAAG7tD,EAAGjU,EAAG,CACrC,GAAI+iB,EAAO,GAAKA,EAAO0+C,EAAQ,EAAG,CAChC,QAAS3xD,EAAI,EAAGA,EAAI9P,EAAG8P,IACjBgyD,EAAE7tD,EAAInE,CAAC,IAAM,IACfgyD,EAAE7tD,EAAInE,CAAC,EAAI,GAGfiT,EAAO,CACR,CAED,OAAOA,CACR,CACD,SAASwiB,EAAMl+C,EAAG2oB,EAAG,CACnB,OAAO3oB,IAAM2oB,CACd,CACH,CAAC,EACDqxD,GAAA,YAAsBG,oBCvkBtB,OAAO,eAAeoC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACaA,GAAA,OAAGC,IAiBjB,SAASA,IAAOx8E,EAAG2oB,EAAGiE,EAAG1S,EAAOuiE,EAAUC,EAAUhD,EAAU,CAC5D,IAAI1uE,EAAG2xE,EAGHC,EAAQ,EACRrxD,EAGJ,GAAIvrB,GAAK2oB,GAAKiE,EAAE1S,EAAQyO,CAAC,GAAKiE,EAAE6vD,EAAWz8E,CAAC,EAC1C,MAAO,GAGT4sB,EAAE6vD,EAAWz8E,CAAC,EAAI4sB,EAAE1S,EAAQyO,CAAC,EAE7B,IAAIk0D,EAAQjwD,EAAE8vD,EAAW18E,CAAC,EAI1B,GAHA4sB,EAAE8vD,EAAW18E,CAAC,EAAI2oB,EAGdk0D,IAAU,GAEZD,EAAQ,EACRrxD,EAAIvrB,MACC,CAIL,IAFA48E,EAAQ,EAEHrxD,EAAIsxD,EAAOtxD,IAAMqB,EAAE8sD,EAAWnuD,CAAC,EAAGA,EAAIqB,EAAE8sD,EAAWnuD,CAAC,EAAG,CAG5D,IAAKvgB,EAAI6xE,EAAO7xE,IAAMugB,EAAGvgB,EAAI2xE,EAE3BA,EAAU/vD,EAAE8sD,EAAW1uE,CAAC,EACxB4hB,EAAE8sD,EAAW1uE,CAAC,EAAIugB,CAErB,CACD,MAAO,CACL,MAAOqxD,EACP,EAAGrxD,CACP,CACA,CC3DA,OAAO,eAAeuxD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAIv3D,IAAWhlB,EACXw8E,IAAU75E,GACV6D,IAAO,WACPia,IAAe,CAAC,WAAW,EAC3Bg8D,OAAoCz3D,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CAC5F,IAAIo/B,EAAYp/B,EAAK,UAarB,OAAO,SAAU/gB,EAAGmvD,EAAQklB,EAAMO,EAAK,CAErC,GAAI,CAAC50E,GAAK,CAACmvD,GAAU,CAACklB,EACpB,OAAO,KAGT,IAAI3sC,EAAQ1nC,EAAE,MAEVykB,EAAIijB,EAAM,CAAC,EACX5zB,EAAI4zB,EAAM,CAAC,EAEXvsC,EAAG2oB,EAAGF,EAAGoS,EAAGlwB,EAAGitC,EAAIzkB,EAGnBnoB,EAAI,EAAI2N,GAAK8gE,EAAM9gE,EAAI2Q,EAAI,EAAI,GAE/BsD,EAAI,CAAA,EACJ8sD,EAAW,EACX+C,EAAW9jE,EACX+jE,EAAW,EAAI/jE,EACfuB,EAAQ,EAAIvB,EACZsgE,EAAO,EAAItgE,EACXqH,EAAO,EAAIrH,EAAI,EAEnB,IAAK8P,EAAI,EAAGA,EAAIzd,EAAGyd,IACjBmE,EAAEnE,CAAC,EAAI,GAIT,IAAIw0D,EAAW,CAAA,EAGXb,EAAKp3B,EAAUngD,CAAC,EAEhBw3E,EAASD,EAAG,OACZE,EAAOF,EAAG,KAGd,IAAK3zD,EAAI,EAAGA,EAAI9P,EAAG8P,IAIjB,IAHAE,EAAIuwD,EAAKzwD,CAAC,EAEVw0D,EAASt0D,CAAC,EAAIiE,EAAE1S,EAAQyO,CAAC,IAAM,GAAK,EAAI,EACjCA,IAAM,IAAMiE,EAAE1S,EAAQyO,CAAC,IAAM,GAAIA,EAAIqrC,EAAOrrC,CAAC,EAClDiE,EAAE1S,EAAQyO,CAAC,EAAIF,EAKnB,GAAIgxD,EAAK,CAEP,IAAKhxD,EAAI,EAAGA,EAAI9P,EAAG8P,IACjBmE,EAAEssD,EAAKzwD,CAAC,CAAC,EAAIA,EAGf,IAAKzoB,EAAI,EAAGA,EAAIspB,EAAGtpB,IAAK,CAEtB,IAAKyoB,EAAI9P,EAAGi/B,EAAK0kC,EAAKt8E,CAAC,EAAGmzB,EAAKmpD,EAAKt8E,EAAI,CAAC,EAAG2K,EAAIitC,EAAIjtC,EAAIwoB,EAAIxoB,IAC1D8d,EAAI,KAAK,IAAIA,EAAGmE,EAAEyvD,EAAO1xE,CAAC,CAAC,CAAC,EAG9BiiB,EAAE5M,EAAOhgB,CAAC,EAAI4sB,EAAEqsD,EAAOxwD,CAAC,EACxBmE,EAAEqsD,EAAOxwD,CAAC,EAAIzoB,CACf,CACF,CAGD,IAAKA,EAAI,EAAGA,EAAI2Y,EAAG3Y,IACjB4sB,EAAE8sD,EAAW15E,CAAC,EAAIA,EAEpB,IAAKyoB,EAAI,EAAGA,EAAI9P,EAAG8P,IAAK,CAStB,IAPAE,EAAIuwD,EAAKzwD,CAAC,EAENurC,EAAOrrC,CAAC,IAAM,IAChBs0D,EAASjpB,EAAOrrC,CAAC,CAAC,IAIfkS,EAAI4+C,EAAM7sD,EAAEqsD,EAAOxwD,CAAC,EAAIE,EAAGkS,IAAM,GAAIA,EAAI4+C,EAAM7sD,EAAE5M,EAAO6a,CAAC,EAAI,GAChE,IAAKlwB,EAAI2xE,EAAKzhD,CAAC,EAAGlwB,EAAI2xE,EAAKzhD,EAAI,CAAC,EAAGlwB,IAAK,CACtC3K,EAAIq8E,EAAO1xE,CAAC,EACZ,IAAIsX,KAAQ86D,IAAQ,QAAQ/8E,EAAG2oB,EAAGiE,EAAG1S,EAAOuiE,EAAUC,EAAUhD,CAAQ,EAEpEz3D,EAAE,OAAS,GACbg7D,EAASt0D,CAAC,IAGR1G,EAAE,QAAU,GACdg7D,EAASh7D,EAAE,CAAC,GAEf,CAEC+xC,EAAOrrC,CAAC,IAAM,KAChBiE,EAAE8sD,EAAW/wD,CAAC,EAAIqrC,EAAOrrC,CAAC,EAE7B,CAED,IAAKA,EAAI,EAAGA,EAAIhQ,EAAGgQ,IACbqrC,EAAOrrC,CAAC,IAAM,KAChBs0D,EAASjpB,EAAOrrC,CAAC,CAAC,GAAKs0D,EAASt0D,CAAC,GAGrC,OAAOs0D,CACX,CACA,CAAC,EACDH,GAAA,eAAyBE,IC/HzB,OAAO,eAAeE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIC,IAAa58E,GACb68E,IAAUl6E,GACVm6E,IAAW54E,GACX64E,IAASp2E,GACTq2E,IAAYthE,GACZsJ,IAAWE,EACX1e,IAAO,QACPia,IAAe,CAAC,MAAO,WAAY,WAAW,EAC9Cw8D,OAAiCj4D,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CACzF,IAAI0K,EAAM1K,EAAK,IACb6vB,EAAW7vB,EAAK,SAChBo/B,EAAYp/B,EAAK,UACfo0D,KAAYsD,IAAO,aAAa,CAClC,IAAKhtD,EACL,SAAUmlB,EACV,UAAWuP,CACf,CAAG,EACG83B,KAAeS,IAAU,gBAAgB,CAC3C,UAAWv4B,CACf,CAAG,EAcD,OAAO,SAAe0N,EAAO7tD,EAAGizE,EAAI,CAElC,IAAI97C,EAAOn3B,EAAE,KACT0nC,EAAQ1nC,EAAE,MAEV8T,EAAI4zB,EAAM,CAAC,EAEX9jB,EAEAzd,EAAI,CAAA,EAIR,GAFAA,EAAE,EAAIgvE,EAAMtnB,EAAO7tD,CAAC,EAEhB6tD,GAAS,CAAC1nD,EAAE,EACd,OAAO,KAGT,GAAI8sE,EAAI,CAEN,IAAIzoE,EAAIqjD,KAAYyqB,IAAW,WAAWt4E,EAAG,KAAMmG,EAAE,EAAG,CAAC,EAAInG,EAE7DmG,EAAE,UAAaqyE,IAAS,SAAShuE,EAAG,CAAC,EAErC,IAAI6pE,KAAWkE,IAAQ,QAAQpyE,EAAE,OAAQ2N,CAAC,EAI1C,GAFA3N,EAAE,GAAK8xE,EAASztE,EAAGrE,EAAE,OAAQkuE,EAAM,CAAC,EAEhC7pE,GAAKrE,EAAE,QAAUA,EAAE,IAAMyyE,EAAQpuE,EAAGrE,CAAC,EAEvC,IAAKA,EAAE,IAAM,EAAGyd,EAAI,EAAGA,EAAI9P,EAAG8P,IAC5Bzd,EAAE,KAAOA,EAAE,GAAGyd,CAAC,CAGzB,MAEMzd,EAAE,IAAM,EAAIgxB,EAAKrjB,CAAC,EAAIA,EACtB3N,EAAE,IAAMA,EAAE,IAGZ,OAAOA,CACX,EAKE,SAASyyE,EAAQ54E,EAAGmG,EAAG,CAErB,IAAIgxB,EAAOn3B,EAAE,KACTk3B,EAASl3B,EAAE,OACX0nC,EAAQ1nC,EAAE,MAEVykB,EAAIijB,EAAM,CAAC,EACX5zB,EAAI4zB,EAAM,CAAC,EAEfvhC,EAAE,KAAO,GACTA,EAAE,SAAW,GAEb,IAAIgpD,EAAShpD,EAAE,OACX4tE,EAAO5tE,EAAE,KACT0yE,EAAW1yE,EAAE,SAEb4hB,EAAI,CAAA,EACJ5M,EAAO,EACPi5D,EAAO3vD,EACPq0D,EAAOr0D,EAAI3Q,EACXilE,EAAOt0D,EAAI,EAAI3Q,EAEf3Y,EAAGyoB,EAAG9d,EAAGitC,EAAIzkB,EAEjB,IAAK1K,EAAI,EAAGA,EAAI9P,EAAG8P,IAEjBmE,EAAEqsD,EAAOxwD,CAAC,EAAI,GACdmE,EAAE+wD,EAAOl1D,CAAC,EAAI,GACdmE,EAAEgxD,EAAOn1D,CAAC,EAAI,EAGhB,IAAKzoB,EAAI,EAAGA,EAAIspB,EAAGtpB,IACjB09E,EAAS19E,CAAC,EAAI,GAGhB,IAAKyoB,EAAI9P,EAAI,EAAG8P,GAAK,EAAGA,IAEtB,IAAKmvB,EAAK5b,EAAKvT,CAAC,EAAG0K,EAAK6I,EAAKvT,EAAI,CAAC,EAAG9d,EAAIitC,EAAIjtC,EAAIwoB,EAAIxoB,IAEnD+yE,EAAS3hD,EAAOpxB,CAAC,CAAC,EAAI8d,EAI1B,IAAKzoB,EAAIspB,EAAI,EAAGtpB,GAAK,EAAGA,IAEtB44E,EAAK54E,CAAC,EAAI,GACVyoB,EAAIi1D,EAAS19E,CAAC,EAEVyoB,IAAM,KAINmE,EAAEgxD,EAAOn1D,CAAC,MAAQ,IACpBmE,EAAE+wD,EAAOl1D,CAAC,EAAIzoB,GAGhB4sB,EAAE5M,EAAOhgB,CAAC,EAAI4sB,EAAEqsD,EAAOxwD,CAAC,EACxBmE,EAAEqsD,EAAOxwD,CAAC,EAAIzoB,GAKhB,IAHAgL,EAAE,IAAM,EACRA,EAAE,GAAKse,EAEFb,EAAI,EAAGA,EAAI9P,EAAG8P,IAYjB,GAVAzoB,EAAI4sB,EAAEqsD,EAAOxwD,CAAC,EAEdzd,EAAE,MAEEhL,EAAI,IACNA,EAAIgL,EAAE,MAGR4tE,EAAK54E,CAAC,EAAIyoB,EAEN,IAAEm1D,EAAKn1D,CAAC,GAAK,GAIjB,CAAAzd,EAAE,KAAO4hB,EAAEgxD,EAAOn1D,CAAC,EAEnB,IAAIo1D,EAAK7pB,EAAOvrC,CAAC,EACbo1D,IAAO,KACLjxD,EAAEgxD,EAAOC,CAAE,IAAM,IACnBjxD,EAAE+wD,EAAOE,CAAE,EAAIjxD,EAAE+wD,EAAOl1D,CAAC,GAE3BmE,EAAE5M,EAAO4M,EAAE+wD,EAAOl1D,CAAC,CAAC,EAAImE,EAAEqsD,EAAO4E,CAAE,EACnCjxD,EAAEqsD,EAAO4E,CAAE,EAAIjxD,EAAE5M,EAAOhgB,CAAC,EACzB4sB,EAAEgxD,EAAOC,CAAE,GAAKjxD,EAAEgxD,EAAOn1D,CAAC,GAG9B,IAAKzoB,EAAI,EAAGA,EAAIspB,EAAGtpB,IACb44E,EAAK54E,CAAC,EAAI,IACZ44E,EAAK54E,CAAC,EAAIyoB,KAGd,MAAO,EACR,CACH,CAAC,EACDy0D,GAAA,YAAsBM,gCCpLtB,OAAO,eAAeM,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAGC,IASnB,SAASA,IAASnxD,EAAGjE,EAAG,CAEtB,OAAOiE,EAAEjE,CAAC,EAAI,CAChB,WCfA,OAAO,eAAeq1D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACaA,GAAA,OAAGC,IACjB,IAAI/D,IAAU35E,GASd,SAAS09E,IAAOrxD,EAAGjE,EAAG,CAEpBiE,EAAEjE,CAAC,KAAQuxD,IAAQ,QAAQttD,EAAEjE,CAAC,CAAC,CACjC,iBChBA,OAAO,eAAeu1D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAGC,IACnB,IAAIjE,IAAU35E,GAQd,SAAS49E,IAASn+E,EAAG,CAEnB,OAAOA,EAAI,KAAQk6E,IAAQ,QAAQl6E,CAAC,EAAIA,CAC1C,CCfA,OAAO,eAAeo+E,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACYA,GAAA,MAAGC,IAChB,IAAIC,GAAY/9E,GACZg+E,IAAUr7E,GACVs7E,GAAY/5E,GAiBhB,SAAS45E,IAAM11D,EAAG2N,EAAGgQ,EAAKhY,EAAIsqD,EAAM,CAElC,IAAInsE,EAAQ6pB,EAAE,OACVsP,EAAMtP,EAAE,KACRzd,EAAOyd,EAAE,MAET3d,EAAIE,EAAK,CAAC,EAEV7Y,EAAG2K,EAAGyoB,EAEN6lD,EAAO,EAIX,IAFA3qD,EAAG,CAAC,EAAI3F,EAEDswD,GAAQ,GAAG,CAEhBtwD,EAAI2F,EAAG2qD,CAAI,EAEX,IAAIwF,EAAO7F,EAAOA,EAAKjwD,CAAC,EAAIA,KAEnB21D,GAAU,UAAU14C,EAAKjd,CAAC,OAE7B41D,IAAQ,QAAQ34C,EAAKjd,CAAC,EAE1B2F,EAAG3V,EAAIsgE,CAAI,EAAIwF,EAAO,EAAI,KAAQD,GAAU,UAAU54C,EAAI64C,CAAI,CAAC,GAGjE,IAAIC,EAAO,EAEX,IAAK/zE,EAAI2jB,EAAG3V,EAAIsgE,CAAI,EAAG7lD,EAAKqrD,EAAO,EAAI,KAAQD,GAAU,UAAU54C,EAAI64C,EAAO,CAAC,CAAC,EAAG9zE,EAAIyoB,EAAIzoB,IAIzF,GAFA3K,EAAIyM,EAAM9B,CAAC,EAEH2zE,IAAAA,GAAU,UAAU14C,EAAK5lC,CAAC,EAIlC,CAAAsuB,EAAG3V,EAAIsgE,CAAI,EAAItuE,EAEf2jB,EAAG,EAAE2qD,CAAI,EAAIj5E,EAEb0+E,EAAO,EAEP,MAGEA,IAEFzF,IAEA3qD,EAAG,EAAEgY,CAAG,EAAI3d,EAEf,CACD,OAAO2d,CACT,CC7EA,OAAO,eAAeq4C,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAGC,IAClB,IAAIN,IAAY/9E,GACZg+E,IAAUr7E,GACV27E,IAASp6E,GAiBb,SAASm6E,IAAQtoD,EAAGxxB,EAAG2jB,EAAG6F,EAAIsqD,EAAM,CAElC,IAAIkG,EAAOxoD,EAAE,KACTyoD,EAAQzoD,EAAE,MAEVwZ,EAAShrC,EAAE,OACXirC,EAAOjrC,EAAE,KAET6T,EAAIomE,EAAM,CAAC,EAEXp0E,EAAGitC,EAAIzkB,EAEPmT,EAAM3tB,EAEV,IAAKi/B,EAAK7H,EAAKtnB,CAAC,EAAG0K,EAAK4c,EAAKtnB,EAAI,CAAC,EAAG9d,EAAIitC,EAAIjtC,EAAIwoB,EAAIxoB,IAAK,CAExD,IAAI3K,EAAI8vC,EAAOnlC,CAAC,KAEP2zE,IAAU,UAAUQ,EAAM9+E,CAAC,IAElCsmC,KAAUu4C,IAAO,OAAO7+E,EAAGs2B,EAAGgQ,EAAKhY,EAAIsqD,CAAI,EAE9C,CAED,IAAKjuE,EAAI27B,EAAK37B,EAAIgO,EAAGhO,OAEf4zE,IAAQ,QAAQO,EAAMxwD,EAAG3jB,CAAC,CAAC,EAEjC,OAAO27B,CACT,CCpDA,OAAO,eAAe04C,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIC,IAAW1+E,GACXglB,IAAWriB,EACX6D,IAAO,YACPia,IAAe,CAAC,eAAgB,WAAY,UAAU,EACtDk+D,OAAqC35D,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CAC7F,IAAIigC,EAAejgC,EAAK,aACtB6vB,EAAW7vB,EAAK,SAChBgI,EAAWhI,EAAK,SAoBlB,OAAO,SAAmB0Q,EAAGxxB,EAAG2jB,EAAG6F,EAAInrB,EAAGy1E,EAAMuG,EAAI,CAElD,IAAIC,EAAU9oD,EAAE,QACZ+oD,EAAS/oD,EAAE,OACXwoD,EAAOxoD,EAAE,KACTyoD,EAAQzoD,EAAE,MAEV3d,EAAIomE,EAAM,CAAC,EAEXlvC,EAAU/qC,EAAE,QACZgrC,EAAShrC,EAAE,OACXirC,EAAOjrC,EAAE,KAET6F,EAAGitC,EAAIzkB,EAAI5H,EAEX+a,KAAU24C,IAAS,SAAS3oD,EAAGxxB,EAAG2jB,EAAG6F,EAAIsqD,CAAI,EAEjD,IAAKjuE,EAAI27B,EAAK37B,EAAIgO,EAAGhO,IACnBxH,EAAEmrB,EAAG3jB,CAAC,CAAC,EAAI,EAGb,IAAKitC,EAAK7H,EAAKtnB,CAAC,EAAG0K,EAAK4c,EAAKtnB,EAAI,CAAC,EAAG9d,EAAIitC,EAAIjtC,EAAIwoB,EAAIxoB,IACnDxH,EAAE2sC,EAAOnlC,CAAC,CAAC,EAAIklC,EAAQllC,CAAC,EAG1B,QAAS+f,EAAK4b,EAAK5b,EAAK/R,EAAG+R,IAAM,CAE/B,IAAI/B,EAAI2F,EAAG5D,CAAE,EAETmQ,EAAI+9C,EAAOA,EAAKjwD,CAAC,EAAIA,EAEzB,GAAI,EAAAkS,EAAI,GAYR,IARA+c,EAAKknC,EAAKjkD,CAAC,EACX1H,EAAK2rD,EAAKjkD,EAAI,CAAC,EAEf13B,EAAEwlB,CAAC,EAAIk9B,EAAa1iD,EAAEwlB,CAAC,EAAGy2D,EAAQD,EAAKvnC,EAAKzkB,EAAK,CAAC,CAAC,EAEnDxoB,EAAIw0E,EAAKvnC,EAAK,EAAIA,EAClBrsB,EAAI4zD,EAAKhsD,EAAKA,EAAK,EAEZxoB,EAAI4gB,EAAG5gB,IAAK,CAEjB,IAAI3K,EAAIq/E,EAAO10E,CAAC,EAEhBxH,EAAEnD,CAAC,EAAI4tB,EAASzqB,EAAEnD,CAAC,EAAGy1C,EAAS2pC,EAAQz0E,CAAC,EAAGxH,EAAEwlB,CAAC,CAAC,CAAC,CACjD,CACF,CAED,OAAO2d,CACX,CACA,CAAC,EACD04C,GAAA,gBAA0BE,ICrF1B,OAAO,eAAeI,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI/5D,IAAWhlB,EACXg/E,IAAar8E,GACb6D,IAAO,OACPia,IAAe,CAAC,MAAO,eAAgB,WAAY,WAAY,SAAU,WAAY,cAAc,EACnGw+D,OAAgCj6D,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CACxF,IAAIwK,EAAMxK,EAAK,IACbigC,EAAejgC,EAAK,aACpB6vB,EAAW7vB,EAAK,SAChBgI,EAAWhI,EAAK,SAChBu7B,EAASv7B,EAAK,OACdw7B,EAAWx7B,EAAK,SAChBkf,EAAelf,EAAK,aAClBo5D,KAAgBO,IAAW,iBAAiB,CAC9C,aAAc15B,EACd,SAAUpQ,EACV,SAAU7nB,CACd,CAAG,EAiBD,OAAO,SAActE,EAAGte,EAAGy0E,EAAK,CAE9B,GAAI,CAACn2D,EACH,OAAO,KAGT,IAAIzQ,EAAOyQ,EAAE,MAET3Q,EAAIE,EAAK,CAAC,EAEV0S,EACAm0D,EAAM,IACNC,EAAM,IAEN30E,IACFugB,EAAIvgB,EAAE,EACN00E,EAAM10E,EAAE,KAAO00E,EACfC,EAAM30E,EAAE,KAAO20E,GAGjB,IAAIzI,EAAU,CAAA,EACVC,EAAS,CAAA,EACTC,EAAO,CAAA,EAEP5pB,EAAI,IAAI1oB,EAAa,CACvB,OAAQoyC,EACR,MAAOC,EACP,IAAKC,EACL,KAAM,CAACz+D,EAAGA,CAAC,CACjB,CAAK,EAEG0+D,EAAU,CAAA,EACVC,EAAS,CAAA,EACTC,EAAO,CAAA,EAEPqI,EAAI,IAAI96C,EAAa,CACvB,OAAQuyC,EACR,MAAOC,EACP,IAAKC,EACL,KAAM,CAAC5+D,EAAGA,CAAC,CACjB,CAAK,EAEGigE,EAAO,CAAA,EAEP54E,EAAG2K,EAEHxH,EAAI,CAAA,EACJmrB,EAAK,CAAA,EAET,IAAKtuB,EAAI,EAAGA,EAAI2Y,EAAG3Y,IAEjBmD,EAAEnD,CAAC,EAAI,EAEP44E,EAAK54E,CAAC,EAAI,GAEVo3E,EAAKp3E,EAAI,CAAC,EAAI,EAGhB0/E,EAAM,EACNC,EAAM,EAEN,QAASl3D,EAAI,EAAGA,EAAI9P,EAAG8P,IAAK,CAE1B2uD,EAAK3uD,CAAC,EAAIi3D,EACVnI,EAAK9uD,CAAC,EAAIk3D,EAEV,IAAI1lD,EAAM1O,EAAIA,EAAE9C,CAAC,EAAIA,EAEjB6d,EAAM04C,EAAUxxB,EAAGlkC,EAAG2Q,EAAK3L,EAAInrB,EAAGy1E,EAAM,CAAC,EAEzCiH,EAAO,GACPh7E,EAAI,GAER,IAAK8F,EAAI27B,EAAK37B,EAAIgO,EAAGhO,IAInB,GAFA3K,EAAIsuB,EAAG3jB,CAAC,EAEJiuE,EAAK54E,CAAC,EAAI,EAAG,CAEf,IAAI8/E,EAAO1vD,EAAIjtB,EAAEnD,CAAC,CAAC,EAEfmhD,EAAO2+B,EAAMj7E,CAAC,IAEhBA,EAAIi7E,EACJD,EAAO7/E,EAEnB,MAEUs3E,EAAOqI,CAAG,EAAI/G,EAAK54E,CAAC,EACpBq3E,EAAQsI,GAAK,EAAIx8E,EAAEnD,CAAC,EAIxB,GAAI6/E,IAAS,IAAMh7E,GAAK,EACtB,OAAO,KAGL+zE,EAAK3+C,CAAG,EAAI,GAAKmnB,EAAShxB,EAAIjtB,EAAE82B,CAAG,CAAC,EAAGwb,EAAS5wC,EAAG46E,CAAG,CAAC,IACzDI,EAAO5lD,GAGT,IAAIi4B,EAAQ/uD,EAAE08E,CAAI,EAUlB,IARAvI,EAAOqI,CAAG,EAAIl3D,EACd4uD,EAAQsI,GAAK,EAAIztB,EAEjB0mB,EAAKiH,CAAI,EAAIp3D,EAEb0uD,EAAOuI,CAAG,EAAIG,EACd3I,EAAQwI,GAAK,EAAI,EAEZ/0E,EAAI27B,EAAK37B,EAAIgO,EAAGhO,IAEnB3K,EAAIsuB,EAAG3jB,CAAC,EAEJiuE,EAAK54E,CAAC,EAAI,IAEZm3E,EAAOuI,CAAG,EAAI1/E,EAEdk3E,EAAQwI,GAAK,EAAI75B,EAAa1iD,EAAEnD,CAAC,EAAGkyD,CAAK,GAG3C/uD,EAAEnD,CAAC,EAAI,CAEV,CAKD,IAHAo3E,EAAKz+D,CAAC,EAAI+mE,EACVnI,EAAK5+D,CAAC,EAAIgnE,EAELh1E,EAAI,EAAGA,EAAI+0E,EAAK/0E,IACnBwsE,EAAOxsE,CAAC,EAAIiuE,EAAKzB,EAAOxsE,CAAC,CAAC,EAG5B,OAAAusE,EAAQ,OAAOwI,EAAKxI,EAAQ,OAASwI,CAAG,EACxCvI,EAAO,OAAOuI,EAAKvI,EAAO,OAASuI,CAAG,EACtCrI,EAAQ,OAAOsI,EAAKtI,EAAQ,OAASsI,CAAG,EACxCrI,EAAO,OAAOqI,EAAKrI,EAAO,OAASqI,CAAG,EAE/B,CACL,EAAGnyB,EACH,EAAGoyB,EACH,KAAMhH,CACZ,CACA,CACA,CAAC,EACD0G,GAAA,WAAqBE,ICtLrB,OAAO,eAAeO,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAI3kE,IAAU7a,GACVglB,IAAWriB,EACX88E,IAASv7E,GACTw7E,IAAQ/4E,GACRH,GAAO,MACPia,IAAe,CAAC,QAAS,MAAO,MAAO,WAAY,YAAa,eAAgB,WAAY,SAAU,WAAY,cAAc,EAChIk/D,OAA+B36D,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MACfwK,EAAMxK,EAAK,IACX0K,EAAM1K,EAAK,IACX6vB,EAAW7vB,EAAK,SAChBo/B,EAAYp/B,EAAK,UACjBigC,EAAejgC,EAAK,aACpBgI,EAAWhI,EAAK,SAChBu7B,EAASv7B,EAAK,OACdw7B,EAAWx7B,EAAK,SAChBkf,EAAelf,EAAK,aAClBs3D,KAAY8C,IAAO,aAAa,CAClC,IAAK1vD,EACL,SAAUmlB,EACV,UAAWuP,CACf,CAAG,EACGs6B,KAAWW,IAAM,YAAY,CAC/B,IAAK7vD,EACL,aAAcy1B,EACd,SAAUpQ,EACV,SAAU7nB,EACV,OAAQuzB,EACR,SAAUC,EACV,aAActc,CAClB,CAAG,EAuCD,OAAO78B,EAAMlB,GAAM,CACjB,+BAAgC,SAAkClC,EAAG6tD,EAAOytB,EAAW,CAErF,GAAI,IAAK/kE,IAAQ,WAAWs3C,CAAK,GAAKA,EAAQ,GAAKA,EAAQ,EACzD,MAAM,IAAI,MAAM,uFAAuF,EAGzG,GAAIytB,EAAY,GAAKA,EAAY,EAC/B,MAAM,IAAI,MAAM,yDAAyD,EAI3E,IAAIn1E,EAAIkyE,EAAMxqB,EAAO7tD,EAAG,EAAK,EAGzBuhB,EAAIk5D,EAAKz6E,EAAGmG,EAAGm1E,CAAS,EAG5B,MAAO,CACL,EAAG/5D,EAAE,EACL,EAAGA,EAAE,EACL,EAAGA,EAAE,KACL,EAAGpb,EAAE,EACL,SAAU,UAAoB,CAC5B,MAAO,MAAQ,KAAK,EAAE,SAAU,EAAG;AAAA,KAAU,KAAK,EAAE,SAAU,EAAG;AAAA,KAAU,KAAK,EAAE,SAAU,GAAI,KAAK,EAAI;AAAA,KAAU,KAAK,EAAE,SAAQ,EAAK,IAAM;AAAA,CAC9I,CACT,CACK,CACL,CAAG,CACH,CAAC,EACD+0E,GAAA,UAAoBG,oBCvGpB,OAAO,eAAeE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAGC,IASlB,SAASA,IAAQ11E,EAAG7F,EAAG,CAErB,IAAI2jB,EACA9P,EAAI7T,EAAE,OACN3B,EAAI,CAAA,EAER,GAAIwH,EAEF,IAAK8d,EAAI,EAAGA,EAAI9P,EAAG8P,IAEjBtlB,EAAEwH,EAAE8d,CAAC,CAAC,EAAI3jB,EAAE2jB,CAAC,MAIf,KAAKA,EAAI,EAAGA,EAAI9P,EAAG8P,IAEjBtlB,EAAEslB,CAAC,EAAI3jB,EAAE2jB,CAAC,EAGd,OAAOtlB,CACT,CChCA,OAAO,eAAem9E,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAI97E,GAAMjE,GACNglB,IAAWriB,EACXipD,IAAmB1nD,GACnB87E,GAAWr5E,GACXH,GAAO,UACPia,IAAe,CAAC,QAAS,SAAU,MAAO,MAAO,SAAU,SAAU,aAAa,EAClFw/D,OAAmCj7D,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC3F,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACd2wD,EAAM3wD,EAAK,IACXm6D,EAAMn6D,EAAK,IACXmnC,EAASnnC,EAAK,OACdsmC,EAAStmC,EAAK,OACdG,EAAcH,EAAK,YACjBkmC,KAAsBK,IAAiB,uBAAuB,CAChE,YAAapmC,CACjB,CAAG,EAmCD,OAAO9d,EAAMlB,GAAM,CACjB,wBAAyB,SAA0BlC,EAAGC,EAAG,CACvDD,EAAIyhB,EAAOzhB,CAAC,EACZ,IAAIsb,EAAIo2D,EAAI1xE,CAAC,EACT1B,EAAIs9E,EAAStgE,EAAE,EAAGA,EAAE,EAAGA,EAAE,EAAG,KAAMrb,CAAC,EACvC,OAAO3B,EAAE,SACV,EACD,8BAA+B,SAAgC0B,EAAGC,EAAG,CACnE,IAAIqb,EAAIo2D,EAAI1xE,CAAC,EACb,OAAO47E,EAAStgE,EAAE,EAAGA,EAAE,EAAGA,EAAE,EAAG,KAAMrb,CAAC,CACvC,EACD,+BAAgC,SAAiCD,EAAGC,EAAG,CACrE,IAAIqb,EAAIo2D,EAAI1xE,CAAC,EACb,OAAO47E,EAAStgE,EAAE,EAAGA,EAAE,EAAGA,EAAE,EAAG,KAAMrb,CAAC,CACvC,EACD,+CAAgD,SAA6CD,EAAGC,EAAG4tD,EAAOytB,EAAW,CACnH,IAAIhgE,EAAI4/D,EAAIl7E,EAAG6tD,EAAOytB,CAAS,EAC/B,OAAOM,EAAStgE,EAAE,EAAGA,EAAE,EAAGA,EAAE,EAAGA,EAAE,EAAGrb,CAAC,CACtC,EACD,yBAA0B,SAA2Bqb,EAAGrb,EAAG,CACzD,OAAO27E,EAAStgE,EAAE,EAAGA,EAAE,EAAGA,EAAE,EAAGA,EAAE,EAAGrb,CAAC,CACtC,CACL,CAAG,EACD,SAAS47E,EAAU77E,EAAG,CACpB,MAAQL,GAAI,UAAUK,CAAC,EACrB,OAAOA,EAET,MAAQL,GAAI,SAASK,CAAC,EACpB,OAAOyhB,EAAOzhB,CAAC,EAEjB,MAAM,IAAI,UAAU,iCAAiC,CACtD,CACD,SAAS47E,EAAS,EAAGxwD,EAAGtlB,EAAG4gB,EAAGzmB,EAAG,CAE/B,EAAI47E,EAAU,CAAC,EACfzwD,EAAIywD,EAAUzwD,CAAC,EAGXtlB,IACF7F,EAAIgnD,EAAgB,EAAGhnD,EAAG,EAAI,EAC9BA,EAAE,SAAYy7E,GAAS,SAAS51E,EAAG7F,EAAE,KAAK,GAI5C,IAAI0V,EAAI0xC,EAAO,EAAGpnD,CAAC,EAEf3B,EAAI4pD,EAAO98B,EAAGzV,CAAC,EAGnB,OAAI+Q,IACFpoB,EAAE,SAAYo9E,GAAS,SAASh1D,EAAGpoB,EAAE,KAAK,GAErCA,CACR,CACH,CAAC,EACDm9E,GAAA,cAAwBE,cC9GpB7gF,GAAyBY,GAC7B,OAAO,eAAeogF,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAInzC,GAAkB7tC,GAAuBuD,GAAA,CAA+C,EACxF6tC,IAAsBpxC,GAAuB8E,GAAA,CAAmD,EAChG8gB,IAAWre,EACXH,GAAO,iBACPia,IAAe,CAAC,QAAS,SAAU,cAAe,MAAO,WAAY,WAAY,SAAU,OAAQ,aAAc,OAAQ,SAAU,KAAM,IAAI,EAC7I4/D,OAA0Cr7D,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAClG,IAAI3d,EAAQ2d,EAAK,MACfke,EAASle,EAAK,OACd4e,EAAc5e,EAAK,YACnB0K,EAAM1K,EAAK,IACXgI,EAAWhI,EAAK,SAChB6vB,EAAW7vB,EAAK,SAChBgE,EAAShE,EAAK,OACd+L,EAAO/L,EAAK,KACZ6kB,EAAa7kB,EAAK,WAClBtN,EAAOsN,EAAK,KACZ5iB,EAAS4iB,EAAK,OACdwM,EAAKxM,EAAK,GACVyM,EAAKzM,EAAK,GAoCZ,OAAO3d,EAAMlB,GAAM,CACjB,oCAAqC,SAAoC85E,EAAUC,EAAY,CAE7F,QADIC,EAAS,CAACF,CAAQ,EAAE,UAAW9vC,IAAoB,SAAY+vC,CAAU,CAAC,EACvEC,EAAO,OAAS,GAAKj9C,EAAOi9C,EAAOA,EAAO,OAAS,CAAC,CAAC,GAC1DA,EAAO,IAAG,EAEZ,GAAIA,EAAO,OAAS,EAClB,MAAM,IAAI,WAAW,eAAe,OAAOF,EAAU,IAAI,EAAE,OAAOC,EAAY,iDAAiD,CAAC,EAElI,OAAQC,EAAO,OAAM,CACnB,IAAK,GAEH,MAAO,CAACt2C,EAAW7gB,EAAOm3D,EAAO,CAAC,EAAGA,EAAO,CAAC,CAAC,CAAC,CAAC,EAClD,IAAK,GACH,CAEE,IAAIC,KAAcxzC,GAAgB,SAAYuzC,EAAQ,CAAC,EACrD1xE,EAAI2xE,EAAQ,CAAC,EACbl8E,EAAIk8E,EAAQ,CAAC,EACbn8E,EAAIm8E,EAAQ,CAAC,EACXC,EAAQxrC,EAAS,EAAG5wC,CAAC,EACrBunB,EAAKqpB,EAAS3wC,EAAGA,CAAC,EAClBunB,EAAKopB,EAAS,EAAG5wC,EAAGwK,CAAC,EACzB,GAAIm1B,EAAYpY,EAAIC,CAAE,EAAG,MAAO,CAACzC,EAAO6gB,EAAW3lC,CAAC,EAAGm8E,CAAK,CAAC,EAC7D,IAAIC,EAAevvD,EAAK/D,EAASxB,EAAIC,CAAE,CAAC,EACxC,MAAO,CAACzC,EAAOgE,EAASszD,EAAcp8E,CAAC,EAAGm8E,CAAK,EAAGr3D,EAAOgE,EAAS6c,EAAWy2C,CAAY,EAAGp8E,CAAC,EAAGm8E,CAAK,CAAC,CACvG,CACH,IAAK,GACH,CAEE,IAAIE,KAAe3zC,GAAgB,SAAYuzC,EAAQ,CAAC,EACtD5gE,EAAIghE,EAAS,CAAC,EACdhf,EAAKgf,EAAS,CAAC,EACfC,EAAKD,EAAS,CAAC,EACfE,EAAKF,EAAS,CAAC,EACbG,EAAS72C,EAAWgL,EAAS,EAAG4rC,CAAE,CAAC,EACnCE,EAAO9rC,EAAS2rC,EAAIA,CAAE,EACtBI,EAAO/rC,EAAS,EAAG4rC,EAAIlf,CAAE,EACzBsf,EAAOnxD,EAAImlB,EAAS,EAAG2rC,EAAIA,EAAIA,CAAE,EAAG3rC,EAAS,GAAI4rC,EAAIA,EAAIlhE,CAAC,CAAC,EAC3DuhE,EAAOjsC,EAAS,EAAG4rC,EAAID,EAAIjf,CAAE,EACjC,GAAI39B,EAAY+8C,EAAMC,CAAI,GAAKh9C,EAAYi9C,EAAMC,CAAI,EACnD,MAAO,CAAC93D,EAAOw3D,EAAIE,CAAM,CAAC,EAE5B,IAAIK,EAAS/zD,EAAS2zD,EAAMC,CAAI,EAC5BI,EAASh0D,EAAS6zD,EAAMC,CAAI,EAC5BG,GAAgBvxD,EAAImlB,EAAS,GAAI4rC,EAAID,EAAIjf,EAAIhiD,CAAC,EAAGs1B,EAAS2rC,EAAIA,EAAIjf,EAAIA,CAAE,CAAC,EACzE2f,EAAgBxxD,EAAImlB,EAAS,EAAG2rC,EAAIA,EAAIA,EAAIjhE,CAAC,EAAGs1B,EAAS,EAAG4rC,EAAIlf,EAAIA,EAAIA,CAAE,EAAG1sB,EAAS,GAAI4rC,EAAIA,EAAIlhE,EAAGA,CAAC,CAAC,EAC3G,GAAIqkB,EAAYq9C,GAAeC,CAAa,EAC1C,MAAO,CAACl4D,EAAOgE,EAAS6nB,EAAS,EAAG4rC,EAAID,EAAIjf,CAAE,EAAG7xC,EAAImlB,EAAS,EAAG4rC,EAAIA,EAAIlhE,CAAC,EAAGs1B,EAAS2rC,EAAIA,EAAIA,CAAE,CAAC,CAAC,EAAG3rC,EAAS4rC,EAAIM,CAAM,CAAC,EAEzH/3D,EAAOgE,EAAS6nB,EAAS,EAAG4rC,EAAIlhE,CAAC,EAAGs1B,EAAS2rC,EAAIjf,CAAE,CAAC,EAAG1sB,EAAS,EAAGksC,CAAM,CAAC,CACxF,EAGY,IAAII,EACAv9C,EAAY+8C,EAAMC,CAAI,EACxBO,EAASH,EAETG,EAASn4D,EAAO0G,EAAIsxD,EAAQjwD,EAAK/D,EAAS6nB,EAASmsC,EAAQA,CAAM,EAAGnsC,EAAS,EAAGksC,EAAQA,EAAQA,CAAM,CAAC,CAAC,CAAC,EAAG,CAAC,EAE/G,IAAIr2C,GAAW,GACX02C,GAAW1pE,EAAKypE,EAAQz2C,EAAQ,EAAE,QAAS,EAAC,IAAI,SAAU/X,GAAG,CAC/D,OAAO3J,EAAO0G,EAAI8wD,EAAI7tD,GAAG3J,EAAO+3D,EAAQpuD,EAAC,CAAC,EAAG+tD,CAAM,CACjE,CAAa,EACD,OAAOU,GAAS,IAAI,SAAU//D,GAAG,CAC/B,OAAIjf,EAAOif,EAAC,IAAM,WAAauiB,EAAYnS,EAAGpQ,EAAC,EAAGoQ,EAAGpQ,EAAC,EAAImQ,EAAGnQ,EAAC,CAAC,EACtDoQ,EAAGpQ,EAAC,EAENA,EACrB,CAAa,CACF,CACH,QACE,MAAM,IAAI,WAAW,8DAA8D,OAAO8+D,CAAM,CAAC,CACpG,CACF,CACL,CAAG,CACH,CAAC,EACDJ,GAAA,qBAA+BC,cCxI/B,OAAO,eAAeqB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIz9E,IAAMjE,GACN0F,IAAU/C,GACV+a,IAAUxZ,GACV8gB,IAAWre,EACXH,IAAO,OACPia,IAAe,CAAC,OAAO,EACvBkhE,OAAqC38D,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CAC7F,IAAIsN,EAAQtN,EAAK,MAYjB,SAASq8D,EAAKE,EAAK,CACjB,GAAI,EAAE,gBAAgBF,GACpB,MAAM,IAAI,YAAY,kDAAkD,EAE1E,GAAI,CAACE,EAAK,MAAM,IAAI,MAAM,wBAAwB,EAClD,KAAK,IAAMA,CACZ,CAKD,OAAAF,EAAK,UAAU,KAAO,OACtBA,EAAK,UAAU,OAAS,GAOxBA,EAAK,UAAU,SAAW,UAAY,CACpC,IAAIE,EAAM,KAAK,KAAO,GAClBrwB,EAAO;AAAA,EAaX,GAZIqwB,EAAI,OACNrwB,GAAQ,SAAWqwB,EAAI,KAAO;AAAA;AAAA,GAE5BA,EAAI,WACNrwB,GAAQ,aAAeqwB,EAAI,SAAW;AAAA;AAAA,GAEpCA,EAAI,cACNrwB,GAAQ;AAAA,MAAuBqwB,EAAI,YAAc;AAAA;AAAA,GAE/CA,EAAI,SACNrwB,GAAQ;AAAA,MAAkBqwB,EAAI,OAAO,KAAK;AAAA,KAAQ,EAAI;AAAA;AAAA,GAEpDA,EAAI,SAAU,CAChBrwB,GAAQ;AAAA,EAER,QADI3wC,EAAQ,CAAA,EACHnhB,EAAI,EAAGA,EAAImiF,EAAI,SAAS,OAAQniF,IAAK,CAC5C,IAAIwjE,EAAO2e,EAAI,SAASniF,CAAC,EACzB8xD,GAAQ,OAAS0R,EAAO;AAAA,EACxB,IAAIjvC,EAAM,OACV,GAAI,CAEFA,EAAMrB,EAAMswC,CAAI,EAAE,QAAO,EAAG,SAASriD,CAAK,CAC3C,OAAQ/H,EAAG,CACVmb,EAAMnb,CACP,CACGmb,IAAQ,QAAa,IAAK/vB,IAAI,QAAQ+vB,CAAG,IAC3Cu9B,GAAQ,cAAiB7zC,IAAQ,QAAQsW,EAAK,CAC5C,UAAW,EACZ,CAAA,EAAI;AAAA,EAER,CACDu9B,GAAQ;AAAA,CACT,CACD,OAAIqwB,EAAI,UAAYA,EAAI,SAAS,SAC/BrwB,GAAQ,WAAaqwB,EAAI,SAAS,KAAK,IAAI,EAAI;AAAA;AAAA,GAE7CA,EAAI,SAAWA,EAAI,QAAQ,SAC7BrwB,GAAQ,aAAeqwB,EAAI,QAAQ,KAAK,IAAI,EAAI;AAAA,GAE3CrwB,CACX,EAKEmwB,EAAK,UAAU,OAAS,UAAY,CAClC,IAAIriF,KAAUqG,IAAQ,OAAO,KAAK,GAAG,EACrC,OAAArG,EAAI,OAAS,OACNA,CACX,EAOEqiF,EAAK,SAAW,SAAUt7D,EAAM,CAC9B,IAAIw7D,EAAM,CAAA,EACV,cAAO,KAAKx7D,CAAI,EAAE,OAAO,SAAU5hB,EAAM,CACvC,OAAOA,IAAS,QACtB,CAAK,EAAE,QAAQ,SAAUA,EAAM,CACzBo9E,EAAIp9E,CAAI,EAAI4hB,EAAK5hB,CAAI,CAC3B,CAAK,EACM,IAAIk9E,EAAKE,CAAG,CACvB,EAKEF,EAAK,UAAU,QAAUA,EAAK,UAAU,SACjCA,CACT,EAAG,CACD,QAAS,EACX,CAAC,EACDA,GAAA,gBAA0BC,cCvH1B,OAAO,eAAeE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAI59E,IAAMjE,GACN0d,IAAU/a,GACV+C,GAAUxB,GACV8gB,IAAWre,EACXH,IAAO,QACPia,IAAe,CAAC,MAAO,OAAQ,OAAO,EACtCqhE,OAAsC98D,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CAC9F,IAAIqM,EAAKrM,EAAK,GACZ+9C,EAAO/9C,EAAK,KACZ3d,EAAQ2d,EAAK,MAmBf,SAASw8D,EAAMz9E,EAAO,CACpB,GAAI,EAAE,gBAAgBy9E,GACpB,MAAM,IAAI,YAAY,kDAAkD,KAElE59E,IAAI,SAASG,CAAK,EACxB,KAAK,MAAQA,EAAM,MAEnB,KAAK,MAAQA,CAEhB,CAKDy9E,EAAM,UAAU,KAAO,QACvBA,EAAM,UAAU,QAAU,GAO1BA,EAAM,UAAU,KAAO,UAAY,CACjC,OAAO,KAAK,KAChB,EAOEA,EAAM,UAAU,QAAU,UAAY,CACpC,OAAO,KAAK,KAChB,EAMEA,EAAM,UAAU,SAAW,UAAY,CACrC,SAAWnkE,IAAQ,QAAQ,KAAK,KAAK,CACzC,EAMEmkE,EAAM,UAAU,OAAS,UAAY,CACnC,MAAO,CACL,OAAQ,QACR,MAAO,KAAK,KAClB,CACA,EASEA,EAAM,SAAW,SAAUz7D,EAAM,CAC/B,OAAO,IAAIy7D,EAAMz7D,EAAK,KAAK,CAC/B,EASE,SAAS27D,EAAYv7E,EAAMoC,EAAI,CACzB,OAAOA,GAAO,aAChBi5E,EAAM,UAAUr7E,CAAI,EAAIw7E,EAASp5E,CAAE,EAEtC,CASD,SAASq5E,EAAgBz7E,EAAM07E,EAAU,IACnCx8E,GAAQ,MAAMm8E,EAAM,UAAWr7E,EAAM,UAAyB,CAChE,IAAIoC,EAAKs5E,IACT,GAAI,OAAOt5E,GAAO,WAChB,OAAOo5E,EAASp5E,CAAE,CAG1B,CAAK,CACF,CAQD,SAASo5E,EAASp5E,EAAI,CACpB,OAAO,UAAY,CAEjB,GAAI,UAAU,SAAW,EACvB,OAAO,IAAIi5E,EAAMj5E,EAAG,KAAK,KAAK,CAAC,EAGjC,QADIqD,EAAO,CAAC,KAAK,KAAK,EACbxM,EAAI,EAAGA,EAAI,UAAU,OAAQA,IACpCwM,EAAKxM,EAAI,CAAC,EAAI,UAAUA,CAAC,EAE3B,GAAIiI,EAAM,gBAAgBkB,CAAE,EAAG,CAC7B,IAAIu5E,EAAYz6E,EAAM,QAAQkB,EAAIqD,CAAI,EAMtC,GAAIk2E,EAAU,OAAO,SAAW,EAC9B,MAAM,IAAI,MAAM,kBAAoBv5E,EAAG,KAAO,4EAA4E,EAE5H,OAAO,IAAIi5E,EAAMM,EAAU,eAAe,MAAMv5E,EAAIqD,CAAI,CAAC,CAC1D,CACD,OAAO,IAAI41E,EAAMj5E,EAAG,MAAMA,EAAIqD,CAAI,CAAC,CACzC,CACG,CAgBD41E,EAAM,YAAc,SAAU5sE,EAAMC,EAAM,CACxC,GAAI,OAAOD,GAAS,SAElB8sE,EAAY9sE,EAAMC,CAAI,MACjB,CACL,IAAIukB,EAAQ,SAAe7sB,EAAO,IACxBlH,GAAQ,gBAAgBuP,EAAMrI,CAAK,GAAKw1E,EAAcx1E,CAAK,IAAM,QACvEq1E,EAAgBr1E,EAAO,UAAY,CACjC,OAAOqI,EAAKrI,CAAK,CAC7B,CAAW,CAEX,EAEM,QAASA,KAASqI,EAChBwkB,EAAM7sB,CAAK,CAEd,CACL,EACE,IAAIw1E,EAAgB,CAClB,WAAY,GACZ,KAAM,GACN,KAAM,GACN,QAAS,GACT,KAAM,GACN,MAAO,GACP,QAAS,EACb,EAGE,OAAAP,EAAM,YAAYze,CAAI,EAGlB1xC,GACFA,EAAG,SAAU,SAAUlrB,EAAM07E,EAAUl9E,EAAM,CACtCA,GAEHi9E,EAAgBz7E,EAAM07E,CAAQ,CAEtC,CAAK,EAEIL,CACT,EAAG,CACD,QAAS,EACX,CAAC,EACDA,GAAA,iBAA2BC,iECzN3B,OAAO,eAAejpE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACYA,GAAA,MAAG,OAChB,IAAIwpE,EAAQ,CACV,KAAM,IACN,SAAU,YACV,OAAQ,CAAC,GAAG,EACZ,YAAa,oFACb,SAAU,CAAC,IAAK,QAAS,SAAU,QAAQ,EAC3C,QAAS,CAAC,KAAK,CACjB,EACA,OAAAxpE,GAAA,MAAgBwpE,sDCZhB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIC,EAAY,CACd,KAAM,QACN,SAAU,YACV,OAAQ,CAAC,OAAO,EAChB,YAAa,sBACb,SAAU,CAAC,OAAO,EAClB,QAAS,CAAC,MAAM,CAClB,EACA,OAAAD,GAAA,UAAoBC,sDCZpB,OAAO,eAAe9iF,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACYA,GAAA,MAAG,OAChB,IAAI+iF,EAAQ,CACV,KAAM,IACN,SAAU,YACV,OAAQ,CAAC,GAAG,EACZ,YAAa,sIACb,SAAU,CAAC,IAAK,QAAS,UAAU,EACnC,QAAS,CAAE,CACb,EACA,OAAA/iF,GAAA,MAAgB+iF,sDCZhB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAIC,EAAe,CACjB,KAAM,WACN,SAAU,YACV,OAAQ,CAAC,UAAU,EACnB,YAAa,6GACb,SAAU,CAAC,WAAY,OAAO,EAC9B,QAAS,CAAE,CACb,EACA,OAAAD,GAAA,aAAuBC,sDCZvB,OAAO,eAAej8D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAIk8D,EAAW,CACb,KAAM,OACN,SAAU,YACV,OAAQ,CAAC,MAAM,EACf,YAAa,oEACb,SAAU,CAAC,OAAQ,SAAS,EAC5B,QAAS,CAAE,CACb,EACA,OAAAl8D,GAAA,SAAmBk8D,sDCZnB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAIC,EAAU,CACZ,KAAM,MACN,SAAU,YACV,OAAQ,CAAC,KAAK,EACd,YAAa,mEACb,SAAU,CAAC,MAAO,QAAQ,EAC1B,QAAS,CAAE,CACb,EACA,OAAAD,GAAA,QAAkBC,sDCZlB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIC,EAAa,CACf,KAAM,SACN,SAAU,YACV,OAAQ,CAAC,QAAQ,EACjB,YAAa,mEACb,SAAU,CAAC,SAAU,YAAY,EACjC,QAAS,CAAE,CACb,EACA,OAAAD,GAAA,WAAqBC,sDCZrB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIC,EAAY,CACd,KAAM,QACN,SAAU,YACV,OAAQ,CAAC,OAAO,EAChB,YAAa,kEACb,SAAU,CAAC,QAAS,WAAW,EAC/B,QAAS,CAAE,CACb,EACA,OAAAD,GAAA,UAAoBC,sDCZpB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAIC,EAAU,CACZ,KAAM,MACN,SAAU,YACV,OAAQ,CAAC,KAAK,EACd,YAAa,eACb,SAAU,CAAC,MAAO,OAAO,EACzB,QAAS,CAAE,CACb,EACA,OAAAD,GAAA,QAAkBC,sDCZlB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAIC,EAAW,CACb,KAAM,OACN,SAAU,YACV,OAAQ,CAAC,MAAM,EACf,YAAa,aACb,SAAU,CAAC,MAAM,EACjB,QAAS,CAAC,OAAQ,OAAO,CAC3B,EACA,OAAAD,GAAA,SAAmBC,sDCZnB,OAAO,eAAepxD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAIqxD,EAAU,CACZ,KAAM,MACN,SAAU,YACV,OAAQ,CAAC,KAAK,EACd,YAAa,mOACb,SAAU,CAAC,KAAK,EAChB,QAAS,CAAE,CACb,EACA,OAAArxD,GAAA,QAAkBqxD,sDCZlB,OAAO,eAAe1zD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACaA,GAAA,OAAG,OACjB,IAAI2zD,EAAS,CACX,KAAM,KACN,SAAU,YACV,OAAQ,CAAC,IAAI,EACb,YAAa,gJACb,SAAU,CAAC,KAAM,WAAW,EAC5B,QAAS,CAAC,KAAK,CACjB,EACA,OAAA3zD,GAAA,OAAiB2zD,sDCZjB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIC,EAAa,CACf,KAAM,UACN,SAAU,YACV,OAAQ,CAAC,SAAS,EAClB,YAAa,+DACb,SAAU,CAAC,UAAW,WAAW,EACjC,QAAS,CAAE,CACb,EACA,OAAAD,GAAA,WAAqBC,sDCZrB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIC,EAAY,CACd,KAAM,QACN,SAAU,YACV,OAAQ,CAAC,OAAO,EAChB,YAAa,6DACb,SAAU,CAAC,QAAS,SAAS,EAC7B,QAAS,CAAE,CACb,EACA,OAAAD,GAAA,UAAoBC,sDCZpB,OAAO,eAAe1kD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAI2kD,EAAU,CACZ,KAAM,MACN,SAAU,YACV,OAAQ,CAAC,KAAK,EACd,YAAa,0GACb,SAAU,CAAC,MAAO,QAAQ,EAC1B,QAAS,CAAC,IAAI,CAChB,EACA,OAAA3kD,GAAA,QAAkB2kD,sDCZlB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAIC,EAAW,CACb,KAAM,OACN,SAAU,YACV,OAAQ,CAAC,MAAM,EACf,YAAa,qBACb,SAAU,CAAC,MAAM,EACjB,QAAS,CAAC,OAAO,CACnB,EACA,OAAAD,GAAA,SAAmBC,sDCZnB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIC,EAAc,CAChB,KAAM,UACN,SAAU,YACV,OAAQ,CAAC,SAAS,EAClB,YAAa,8CACb,SAAU,CAAC,SAAS,EACpB,QAAS,CAAE,CACb,EACAD,OAAAA,GAAA,YAAsBC,sDCZtB,OAAO,eAAer7C,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAIs7C,EAAgB,CAClB,KAAM,YACN,SAAU,eACV,OAAQ,CAAC,cAAc,EACvB,YAAa,+CACb,SAAU,CAAC,YAAa,kCAAmC,mBAAoB,uBAAwB,4BAA4B,EACnI,QAAS,CAAC,UAAW,UAAW,WAAY,QAAS,SAAU,SAAU,MAAM,CACjF,EACA,OAAAt7C,GAAA,cAAwBs7C,sDCZxB,OAAO,eAAez7C,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAI07C,EAAc,CAChB,KAAM,UACN,SAAU,eACV,OAAQ,CAAC,IAAK,YAAY,EAC1B,YAAa,6CACb,SAAU,CAAC,aAAc,aAAc,aAAc,kBAAmB,mBAAoB,uBAAuB,EACnH,QAAS,CAAC,YAAa,UAAW,QAAS,SAAU,SAAU,SAAU,MAAM,CACjF,EACA,OAAA17C,GAAA,YAAsB07C,sDCZtB,OAAO,eAAergD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIsgD,EAAc,CAChB,KAAM,UACN,SAAU,eACV,OAAQ,CAAC,YAAa,kBAAmB,iBAAiB,EAC1D,YAAa,2BACb,SAAU,CAAC,YAAa,gBAAiB,mBAAmB,EAC5D,QAAS,CAAC,YAAa,UAAW,QAAS,SAAU,SAAU,SAAU,MAAM,CACjF,EACA,OAAAtgD,GAAA,YAAsBsgD,sDCZtB,OAAO,eAAenpB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAIopB,EAAiB,CACnB,KAAM,aACN,SAAU,eACV,OAAQ,CAAC,0BAA2B,8BAA8B,EAClE,YAAa,iEACb,SAAU,CAAC,oBAAqB,uFAAwF,kCAAkC,EAC1J,QAAS,CAAC,OAAQ,WAAW,CAC/B,EACA,OAAAppB,GAAA,eAAyBopB,sDCZzB,OAAO,eAAep7C,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAIq7C,EAAe,CACjB,KAAM,WACN,SAAU,eACV,OAAQ,CAAC,gBAAiB,mBAAoB,oBAAqB,4BAA4B,EAC/F,YAAa,6EACb,SAAU,CAAC,kBAAmB,kCAAmC,4BAA6B,yCAAyC,EACvI,QAAS,CAAC,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,MAAM,CAClF,EACA,OAAAr7C,GAAA,aAAuBq7C,sDCZvB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIC,EAAY,CACd,KAAM,QACN,SAAU,eACV,OAAQ,CAAC,UAAW,cAAe,mBAAoB,yBAA0B,kCAAmC,6CAA6C,EACjK,YAAa,yDACb,SAAU,CAAC,YAAa,yBAA0B,UAAW,eAAgB,0BAA0B,EACvG,QAAS,CAAC,YAAa,UAAW,UAAW,UAAW,SAAU,QAAS,SAAU,MAAM,CAC7F,EACA,OAAAD,GAAA,UAAoBC,sDCZpB,OAAO,eAAex+D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIy+D,EAAa,CACf,KAAM,SACN,SAAU,eACV,OAAQ,CAAC,KAAM,6BAA8B,WAAY,kBAAmB,eAAe,EAC3F,YAAa,mBACb,SAAU,CAAC,KAAM,YAAa,qBAAsB,WAAY,iBAAkB,iCAAkC,0CAA0C,EAC9J,QAAS,CAAC,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,OAAQ,QAAQ,CAC5F,EACA,OAAAz+D,GAAA,WAAqBy+D,sDCZrB,OAAO,eAAeztE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI0tE,EAAa,CACf,KAAM,SACN,SAAU,eACV,OAAQ,CAAC,IAAK,YAAa,6BAA6B,EACxD,YAAa,gEACb,SAAU,CAAC,IAAK,MAAO,OAAQ,YAAa,gBAAiB,eAAgB,oCAAqC,2BAA2B,EAC7I,QAAS,CAAC,YAAa,UAAW,UAAW,WAAY,QAAS,SAAU,SAAU,MAAM,CAC9F,EACA,OAAA1tE,GAAA,WAAqB0tE,sDCZrB,OAAO,eAAe3pB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI4pB,EAAa,CACf,KAAM,SACN,SAAU,eACV,OAAQ,CAAC,WAAY,qCAAsC,8CAA8C,EACzG,YAAa,0BACb,SAAU,CAAC,WAAY,uBAAwB,gCAAgC,EAC/E,QAAS,CAAC,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,OAAQ,QAAQ,CAC5F,EACA,OAAA5pB,GAAA,WAAqB4pB,sDCZrB,OAAO,eAAe16C,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAI26C,EAAgB,CAClB,KAAM,YACN,SAAU,eACV,OAAQ,CAAC,sCAAsC,EAC/C,YAAa,6EACb,SAAU,CAAC,kCAAkC,EAC7C,QAAS,CAAC,OAAQ,YAAY,CAChC,EACA,OAAA36C,GAAA,cAAwB26C,sDCZxB,OAAO,eAAevpE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIwpE,EAAa,CACf,KAAM,SACN,SAAU,eACV,OAAQ,CAAC,SAAU,WAAW,EAC9B,YAAa,iDACb,SAAU,CAAC,iBAAkB,cAAe,gBAAgB,EAC5D,QAAS,CAAC,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,MAAM,CAClF,EACA,OAAAxpE,GAAA,WAAqBwpE,sDCZrB,OAAO,eAAev8C,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAIw8C,EAAW,CACb,KAAM,OACN,SAAU,eACV,OAAQ,CAAC,aAAc,oBAAqB,cAAc,EAC1D,YAAa,iBACb,SAAU,CAAC,SAAU,SAAU,wBAAyB,gBAAgB,EACxE,QAAS,CAAC,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,QAAQ,CACpF,EACA,OAAAx8C,GAAA,SAAmBw8C,sDCZnB,OAAO,eAAejlF,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIklF,EAAa,CACf,KAAM,SACN,SAAU,OACV,OAAQ,CAAC,WAAY,iBAAiB,EACtC,YAAa,6CACb,SAAU,CAAC,WAAY,YAAa,+BAAgC,WAAW,EAC/E,QAAS,CAAE,CACb,EACA,OAAAllF,GAAA,WAAqBklF,sDCZrB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIC,EAAa,CACf,KAAM,SACN,SAAU,OACV,OAAQ,CAAC,oBAAqB,4BAA4B,EAC1D,YAAa,gDACb,SAAU,CAAC,4CAA6C,UAAW,YAAY,EAC/E,QAAS,CAAE,CACb,EACAD,OAAAA,GAAA,WAAqBC,sDCZrB,OAAO,eAAet9E,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIu9E,EAAY,CACd,KAAM,QACN,SAAU,OACV,OAAQ,CAAC,oBAAqB,yBAAyB,EACvD,YAAa,2BACb,SAAU,CAAC,yCAA0C,YAAa,iBAAiB,EACnF,QAAS,CAAE,CACb,EACA,OAAAv9E,GAAA,UAAoBu9E,sDCZpB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAIC,EAAiB,CACnB,KAAM,aACN,SAAU,UACV,OAAQ,CAAC,6BAA8B,iDAAiD,EACxF,YAAa,4OACb,SAAU,CAAC,0BAA2B,6CAA8C,mCAAoC,6BAA8B,uBAAwB,iBAAkB,wBAAyB,qBAAqB,EAC9O,QAAS,CAAC,WAAY,QAAS,UAAU,CAC3C,EACAD,OAAAA,GAAA,eAAyBC,sDCZzB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAIC,EAAgB,CAClB,KAAM,YACN,SAAU,UACV,OAAQ,CAAC,iBAAiB,EAC1B,YAAa,0EACb,SAAU,CAAC,0BAA2B,4CAA4C,EAClF,QAAS,CAAC,UAAU,CACtB,EACAD,OAAAA,GAAA,cAAwBC,sDCZxB,OAAO,eAAe15B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI25B,EAAa,CACf,KAAM,SACN,SAAU,UACV,OAAQ,CAAC,gBAAgB,EACzB,YAAa,gIACb,SAAU,CAAC,oBAAqB,cAAe,kBAAkB,EACjE,QAAS,CAAC,YAAa,MAAO,UAAW,SAAU,SAAU,QAAQ,CACvE,EACA,OAAA35B,GAAA,WAAqB25B,sDCZrB,OAAO,eAAez4B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAI04B,EAAgB,CAClB,KAAM,YACN,SAAU,UACV,OAAQ,CAAC,mBAAmB,EAC5B,YAAa,iIACb,SAAU,CAAC,oBAAqB,cAAe,kBAAkB,EACjE,QAAS,CAAC,SAAU,MAAO,UAAW,SAAU,SAAU,QAAQ,CACpE,EACA,OAAA14B,GAAA,cAAwB04B,sDCZxB,OAAO,eAAevP,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAIwP,EAAU,CACZ,KAAM,MACN,SAAU,UACV,OAAQ,CAAC,QAAQ,EACjB,YAAa,sIACb,SAAU,CAAC,wBAAyB,gCAAiC,+BAA+B,EACpG,QAAS,CAAC,UAAW,SAAU,SAAU,SAAU,SAAU,MAAO,IAAI,CAC1E,EACA,OAAAxP,GAAA,QAAkBwP,sDCZlB,OAAO,eAAezF,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAI0F,EAAc,CAChB,KAAM,UACN,SAAU,UACV,OAAQ,CAAC,kBAAmB,kBAAkB,EAC9C,YAAa,gGACb,SAAU,CAAC,oBAAqB,cAAe,mBAAmB,EAClE,QAAS,CAAC,MAAO,MAAO,SAAU,SAAU,SAAU,QAAQ,CAChE,EACA,OAAA1F,GAAA,YAAsB0F,sDCZtB,OAAO,eAAerF,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIsF,EAAqB,CACvB,KAAM,iBACN,SAAU,UACV,OAAQ,CAAC,0BAA2B,6BAA8B,iCAAiC,EACnG,YAAa,wIACb,SAAU,CAAC,kCAAkC,EAC7C,QAAS,CAAC,OAAQ,MAAM,CAC1B,EACA,OAAAtF,GAAA,mBAA6BsF,sDCZ7B,OAAO,eAAenO,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACaA,GAAA,OAAG,OACjB,IAAIoO,EAAS,CACX,KAAM,KACN,SAAU,UACV,OAAQ,CAAC,OAAO,EAChB,YAAa,uKACb,SAAU,CAAC,0DAA0D,EACrE,QAAS,CAAC,MAAO,MAAO,QAAQ,CAClC,EACA,OAAApO,GAAA,OAAiBoO,sDCZjB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIC,EAAkB,CACpB,KAAM,cACN,SAAU,UACV,OAAQ,CAAC,oBAAqB,2BAA4B,oCAAoC,EAC9F,YAAa,mPACb,SAAU,CAAC,gCAAiC,qCAAqC,EACjF,QAAS,CAAC,UAAU,CACtB,EACAD,OAAAA,GAAA,gBAA0BC,sDCZ1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIC,EAAc,CAChB,KAAM,UACN,SAAU,UACV,OAAQ,CAAC,sBAAsB,EAC/B,YAAa,0DACb,SAAU,CAAC,oCAAqC,wDAAyD,8CAA+C,4DAA4D,EACpN,QAAS,CAAC,WAAY,UAAU,EAChC,SAAU,CAAC,gBAAgB,CAC7B,EACAD,OAAAA,GAAA,YAAsBC,sDCbtB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAIC,EAAe,CACjB,KAAM,WACN,SAAU,UACV,OAAQ,CAAC,iBAAkB,uBAAuB,EAClD,YAAa,+BACb,SAAU,CAAC,wBAAyB,qBAAsB,+BAAgC,2BAA4B,6BAA6B,EACnJ,QAAS,CAAC,eAAgB,aAAc,WAAY,QAAS,cAAe,SAAS,CACvF,EACAD,OAAAA,GAAA,aAAuBC,sDCZvB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAIC,EAAuB,CACzB,KAAM,mBACN,SAAU,UACV,OAAQ,CAAC,yBAA0B,iCAAiC,EACpE,YAAa,6DACb,SAAU,CAAC,8BAA+B,yCAAyC,EACnF,QAAS,CAAC,WAAY,eAAgB,UAAU,CAClD,EACAD,OAAAA,GAAA,qBAA+BC,sDCZ/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIC,EAAmB,CACrB,KAAM,eACN,SAAU,UACV,OAAQ,CAAC,oBAAoB,EAC7B,YAAa,iEACb,SAAU,CAAC,6BAA8B,gCAAgC,EACzE,QAAS,CAAC,WAAY,mBAAoB,UAAU,CACtD,EACAD,OAAAA,GAAA,iBAA2BC,sDCZ3B,OAAO,eAAe7G,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAI8G,EAAU,CACZ,KAAM,MACN,SAAU,UACV,OAAQ,CAAC,0BAA0B,EACnC,YAAa,wKACb,SAAU,CAAC,yFAAyF,EACpG,QAAS,CAAC,UAAW,SAAU,SAAU,SAAU,SAAU,MAAO,IAAI,CAC1E,EACA,OAAA9G,GAAA,QAAkB8G,sDCZlB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIC,EAAoB,CACtB,KAAM,gBACN,SAAU,UACV,OAAQ,CAAC,8BAA+B,sCAAsC,EAC9E,YAAa,oEACb,SAAU,CAAC,6BAA8B,mCAAoC,iEAAiE,EAC9I,QAAS,CAAC,WAAY,UAAU,CAClC,EACAD,OAAAA,GAAA,kBAA4BC,sDCZ5B,OAAO,eAAeh6B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIi6B,EAAa,CACf,KAAM,SACN,SAAU,UACV,OAAQ,CAAC,gBAAgB,EACzB,YAAa,gIACb,SAAU,CAAC,kFAAkF,EAC7F,QAAS,CAAC,YAAa,MAAO,UAAW,SAAU,SAAU,QAAQ,CACvE,EACA,OAAAj6B,GAAA,WAAqBi6B,sDCZrB,OAAO,eAAe94B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAI+4B,EAAgB,CAClB,KAAM,YACN,SAAU,UACV,OAAQ,CAAC,gBAAgB,EACzB,YAAa,iIACb,SAAU,CAAC,kFAAkF,EAC7F,QAAS,CAAC,SAAU,MAAO,UAAW,SAAU,SAAU,QAAQ,CACpE,EACA,OAAA/4B,GAAA,cAAwB+4B,sDCZxB,OAAO,eAAe72D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAI82D,EAAU,CACZ,KAAM,MACN,SAAU,aACV,OAAQ,CAAC,QAAQ,EACjB,YAAa,8BACb,SAAU,CAAC,WAAY,WAAW,EAClC,QAAS,CAAC,MAAM,CAClB,EACA,OAAA92D,GAAA,QAAkB82D,sDCZlB,OAAO,eAAe52D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAI62D,EAAU,CACZ,KAAM,MACN,SAAU,YACV,OAAQ,CAAC,QAAS,WAAW,EAC7B,YAAa,kBACb,SAAU,CAAC,gBAAiB,UAAW,SAAU,gBAAiB,aAAa,EAC/E,QAAS,CAAC,UAAU,CACtB,EACA,OAAA72D,GAAA,QAAkB62D,sDCZlB,OAAO,eAAe7uE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAI8uE,EAAW,CACb,KAAM,OACN,SAAU,aACV,OAAQ,CAAC,UAAW,mBAAmB,EACvC,YAAa,iQACb,SAAU,CAAC,WAAY,UAAW,WAAY,eAAgB,WAAY,iBAAkB,cAAc,EAC1G,QAAS,CAAC,SAAU,OAAQ,OAAQ,UAAU,CAChD,EACA,OAAA9uE,GAAA,SAAmB8uE,sDCZnB,OAAO,eAAe12D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAI22D,EAAW,CACb,KAAM,OACN,SAAU,aACV,OAAQ,CAAC,SAAS,EAClB,YAAa,wHACb,SAAU,CAAC,YAAa,YAAa,YAAY,EACjD,QAAS,CAAC,QAAS,MAAO,OAAO,CACnC,EACA,OAAA32D,GAAA,SAAmB22D,sDCZnB,OAAO,eAAel5C,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAIm5C,EAAW,CACb,KAAM,OACN,SAAU,aACV,OAAQ,CAAC,SAAS,EAClB,YAAa,2DACb,SAAU,CAAC,UAAW,MAAO,WAAW,EACxC,QAAS,CAAC,WAAY,SAAU,KAAK,CACvC,EACA,OAAAn5C,GAAA,SAAmBm5C,sDCZnB,OAAO,eAAe19D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI29D,EAAa,CACf,KAAM,SACN,SAAU,YACV,OAAQ,CAAC,QAAS,cAAc,EAChC,YAAa,qBACb,SAAU,CAAC,YAAa,QAAS,UAAW,YAAa,cAAe,aAAa,EACrF,QAAS,CAAC,UAAU,CACtB,EACA39D,OAAAA,GAAA,WAAqB29D,sDCZrB,OAAO,eAAezhC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAI0hC,EAAgB,CAClB,KAAM,YACN,SAAU,YACV,OAAQ,CAAC,SAAU,iBAAiB,EACpC,YAAa,kCACb,SAAU,CAAC,yBAA0B,yBAA0B,QAAQ,EACvE,QAAS,CAAC,WAAY,cAAe,QAAQ,CAC/C,EACA,OAAA1hC,GAAA,cAAwB0hC,sDCZxB,OAAO,eAAe3tC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAI4tC,EAAkB,CACpB,KAAM,cACN,SAAU,YACV,OAAQ,CAAC,SAAU,mBAAmB,EACtC,YAAa,oCACb,SAAU,CAAC,yBAA0B,yBAA0B,QAAQ,EACvE,QAAS,CAAC,WAAY,SAAU,WAAW,CAC7C,EACA,OAAA5tC,GAAA,gBAA0B4tC,sDCZ1B,OAAO,eAAeh8B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIi8B,EAAa,CACf,KAAM,SACN,SAAU,YACV,OAAQ,CAAC,SAAU,cAAc,EACjC,YAAa,+CACb,SAAU,CAAC,yBAA0B,QAAQ,EAC7C,QAAS,CAAC,KAAK,CACjB,EACA,OAAAj8B,GAAA,WAAqBi8B,sDCZrB,OAAO,eAAelsE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAImsE,EAAU,CACZ,KAAM,MACN,SAAU,aACV,OAAQ,CAAC,QAAQ,EACjB,YAAa,qCACb,SAAU,CAAC,WAAY,UAAW,gBAAiB,UAAW,qDAAsD,EACpH,QAAS,CAAC,OAAQ,QAAS,MAAO,KAAK,CACzC,EACA,OAAAnsE,GAAA,QAAkBmsE,sDCZlB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAIC,EAAW,CACb,KAAM,OACN,SAAU,aACV,OAAQ,CAAC,QAAQ,EACjB,YAAa,wJACb,SAAU,CAAC,qBAAqB,EAChC,QAAS,CAAC,KAAK,CACjB,EACAD,OAAAA,GAAA,SAAmBC,sDCZnB,OAAO,eAAepvE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIqvE,EAAY,CACd,KAAM,QACN,SAAU,aACV,OAAQ,CAAC,UAAU,EACnB,YAAa,mEACb,SAAU,CAAC,WAAY,gBAAiB,mBAAmB,EAC3D,QAAS,CAAC,MAAO,MAAO,KAAK,CAC/B,EACA,OAAArvE,GAAA,UAAoBqvE,sDCZpB,OAAO,eAAet5C,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAIu5C,EAAU,CACZ,KAAM,MACN,SAAU,aACV,OAAQ,CAAC,QAAQ,EACjB,YAAa,sGACb,SAAU,CAAC,WAAY,WAAY,YAAa,WAAW,EAC3D,QAAS,CAAC,OAAQ,QAAS,OAAO,CACpC,EACA,OAAAv5C,GAAA,QAAkBu5C,sDCZlB,OAAO,eAAe72D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAI82D,EAAY,CACd,KAAM,QACN,SAAU,aACV,OAAQ,CAAC,UAAU,EACnB,YAAa,yHACb,SAAU,CAAC,aAAc,aAAc,aAAa,EACpD,QAAS,CAAC,OAAQ,MAAO,OAAO,CAClC,EACA,OAAA92D,GAAA,UAAoB82D,sDCZpB,OAAO,eAAej1D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAIk1D,EAAU,CACZ,KAAM,MACN,SAAU,aACV,OAAQ,CAAC,YAAa,mBAAmB,EACzC,YAAa,uCACb,SAAU,CAAC,aAAc,aAAc,kBAAkB,EACzD,QAAS,CAAC,MAAO,MAAM,CACzB,EACA,OAAAl1D,GAAA,QAAkBk1D,sDCZlB,OAAO,eAAe92D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAI+2D,EAAY,CACd,KAAM,QACN,SAAU,aACV,OAAQ,CAAC,sBAAuB,uBAAuB,EACvD,YAAa,mDACb,SAAU,CAAC,cAAe,kBAAmB,YAAa,kBAAkB,EAC5E,QAAS,CAAC,MAAO,MAAM,CACzB,EACA,OAAA/2D,GAAA,UAAoB+2D,sDCZpB,OAAO,eAAe7uC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI8uC,EAAa,CACf,KAAM,SACN,SAAU,aACV,OAAQ,CAAC,cAAc,EACvB,YAAa,wGACb,SAAU,CAAC,oBAAqB,kBAAmB,4BAA4B,EAC/E,QAAS,CAAC,MAAO,MAAM,CACzB,EACA,OAAA9uC,GAAA,WAAqB8uC,sDCZrB,OAAO,eAAen0C,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAIo0C,EAAU,CACZ,KAAM,MACN,SAAU,aACV,OAAQ,CAAC,WAAW,EACpB,YAAa,qCACb,SAAU,CAAC,YAAa,aAAc,eAAe,EACrD,QAAS,CAAC,KAAK,CACjB,EACA,OAAAp0C,GAAA,QAAkBo0C,sDCZlB,OAAO,eAAe/2D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAIg3D,EAAU,CACZ,KAAM,MACN,SAAU,aACV,OAAQ,CAAC,SAAU,cAAc,EACjC,YAAa,8NACb,SAAU,CAAC,WAAY,eAAgB,SAAU,SAAU,iBAAkB,uBAAwB,mBAAoB,OAAO,EAChI,QAAS,CAAC,MAAO,QAAS,OAAQ,OAAO,CAC3C,EACA,OAAAh3D,GAAA,QAAkBg3D,sDCZlB,OAAO,eAAejwE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIkwE,EAAY,CACd,KAAM,QACN,SAAU,aACV,OAAQ,CAAC,UAAU,EACnB,YAAa,4CACb,SAAU,CAAC,iBAAkB,eAAgB,SAAU,uBAAwB,gBAAgB,EAC/F,QAAS,CAAC,MAAO,KAAK,CACxB,EACA,OAAAlwE,GAAA,UAAoBkwE,sDCZpB,OAAO,eAAejwE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIkwE,EAAY,CACd,KAAM,QACN,SAAU,aACV,OAAQ,CAAC,WAAY,gBAAgB,EACrC,YAAa,yCACb,SAAU,CAAC,aAAc,kBAAmB,aAAc,kBAAmB,uBAAuB,EACpG,QAAS,CAAC,MAAO,MAAO,OAAQ,OAAO,CACzC,EACA,OAAAlwE,GAAA,UAAoBkwE,sDCZpB,OAAO,eAAepwE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAIqwE,EAAW,CACb,KAAM,OACN,SAAU,aACV,OAAQ,CAAC,SAAS,EAClB,YAAa,gFACb,SAAU,CAAC,gBAAiB,WAAY,qBAAsB,WAAW,EACzE,QAAS,CAAC,MAAO,QAAS,MAAO,OAAO,CAC1C,EACA,OAAArwE,GAAA,SAAmBqwE,sDCZnB,OAAO,eAAel3D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAIm3D,EAAU,CACZ,KAAM,MACN,SAAU,YACV,OAAQ,CAAC,QAAS,UAAW,WAAW,EACxC,YAAa,gEACb,SAAU,CAAC,QAAS,SAAU,WAAY,mBAAoB,WAAY,UAAU,EACpF,QAAS,CAAC,QAAQ,CACpB,EACA,OAAAn3D,GAAA,QAAkBm3D,sDCZlB,OAAO,eAAehzC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAIizC,EAAe,CACjB,KAAM,WACN,SAAU,YACV,OAAQ,CAAC,QAAS,gBAAgB,EAClC,YAAa,uBACb,SAAU,CAAC,gBAAiB,UAAW,YAAa,cAAe,YAAY,EAC/E,QAAS,CAAC,QAAQ,CACpB,EACA,OAAAjzC,GAAA,aAAuBizC,sDCZvB,OAAO,eAAehmC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAIimC,EAAW,CACb,KAAM,OACN,SAAU,aACV,OAAQ,CAAC,UAAW,YAAY,EAChC,YAAa,oDACb,SAAU,CAAC,YAAa,aAAc,eAAgB,6BAA8B,8BAA+B,kBAAmB,4BAA6B,gCAAiC,+BAA+B,CACrO,EACA,OAAAjmC,GAAA,SAAmBimC,sDCXnB,OAAO,eAAe1wC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAI2wC,EAAc,CAChB,KAAM,UACN,SAAU,aACV,OAAQ,CAAC,aAAc,kBAAkB,EACzC,YAAa,qJACb,SAAU,CAAC,QAAS,iBAAkB,gBAAiB,SAAS,EAChE,QAAS,CAAC,WAAY,MAAO,MAAM,CACrC,EACA3wC,OAAAA,GAAA,YAAsB2wC,sDCZtB,OAAO,eAAe19B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAI29B,EAAe,CACjB,KAAM,WACN,SAAU,aACV,OAAQ,CAAC,cAAe,mBAAmB,EAC3C,YAAa,2LACb,SAAU,CAAC,cAAe,gBAAgB,EAC1C,QAAS,CAAC,OAAQ,MAAO,SAAS,CACpC,EACA,OAAA39B,GAAA,aAAuB29B,sDCZvB,OAAO,eAAev5D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAIw5D,EAAU,CACZ,KAAM,MACN,SAAU,YACV,OAAQ,CAAC,QAAS,WAAW,EAC7B,YAAa,uCACb,SAAU,CAAC,MAAO,QAAS,mBAAoB,2BAA4B,2BAA2B,EACtG,QAAS,CAAC,WAAY,UAAW,WAAY,MAAM,CACrD,EACA,OAAAx5D,GAAA,QAAkBw5D,sDCZlB,OAAO,eAAer3D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIs3D,EAAY,CACd,KAAM,QACN,SAAU,aACV,OAAQ,CAAC,WAAY,aAAa,EAClC,YAAa,4LACb,SAAU,CAAC,aAAc,aAAc,cAAe,cAAe,eAAgB,qBAAqB,EAC1G,QAAS,CAAC,OAAQ,QAAS,KAAK,CAClC,EACA,OAAAt3D,GAAA,UAAoBs3D,sDCZpB,OAAO,eAAe7wE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAI8wE,EAAW,CACb,KAAM,OACN,SAAU,aACV,OAAQ,CAAC,SAAS,EAClB,YAAa,iGACb,SAAU,CAAC,YAAa,aAAc,SAAS,EAC/C,QAAS,CAAC,KAAK,CACjB,EACA,OAAA9wE,GAAA,SAAmB8wE,sDCZnB,OAAO,eAAer3D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAIs3D,EAAW,CACb,KAAM,OACN,SAAU,aACV,OAAQ,CAAC,SAAS,EAClB,YAAa,+EACb,SAAU,CAAC,WAAY,QAAS,UAAU,EAC1C,QAAS,CAAC,SAAU,QAAS,WAAY,UAAW,WAAY,KAAK,CACvE,EACA,OAAAt3D,GAAA,SAAmBs3D,sDCZnB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIC,EAAY,CACd,KAAM,QACN,SAAU,aACV,OAAQ,CAAC,UAAU,EACnB,YAAa,+IACb,SAAU,CAAC,6BAA6B,EACxC,QAAS,CAAC,OAAQ,MAAO,SAAU,UAAU,CAC/C,EACAD,OAAAA,GAAA,UAAoBC,sDCZpB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAIC,EAAgB,CAClB,KAAM,YACN,SAAU,SACV,OAAQ,CAAC,kBAAkB,EAC3B,YAAa,0DACb,SAAU,CAAC,uEAAwE,kBAAkB,EACrG,QAAS,CAAC,QAAS,MAAM,CAC3B,EACAD,OAAAA,GAAA,cAAwBC,sDCZxB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIC,EAAY,CACd,KAAM,QACN,SAAU,SACV,OAAQ,CAAC,UAAU,EACnB,YAAa,kEACb,SAAU,CAAC,2BAA4B,UAAU,EACjD,QAAS,CAAC,OAAQ,WAAW,CAC/B,EACAD,OAAAA,GAAA,UAAoBC,sDCZpB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAIC,EAAW,CACb,KAAM,OACN,SAAU,SACV,OAAQ,CAAC,WAAW,EACpB,YAAa,gEACb,SAAU,CAAC,6CAA8C,WAAW,EACpE,QAAS,CAAC,QAAS,WAAW,CAChC,EACAD,OAAAA,GAAA,SAAmBC,sDCZnB,OAAO,eAAe1wC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI2wC,EAAa,CACf,KAAM,SACN,SAAU,aACV,OAAQ,CAAC,WAAW,EACpB,YAAa,2DACb,SAAU,CAAC,YAAa,UAAW,MAAO,OAAO,EACjD,QAAS,CAAC,WAAY,MAAO,OAAQ,MAAM,CAC7C,EACA,OAAA3wC,GAAA,WAAqB2wC,sDCZrB,OAAO,eAAe97D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAI+7D,EAAe,CACjB,KAAM,WACN,SAAU,YACV,OAAQ,CAAC,QAAS,gBAAgB,EAClC,YAAa,uBACb,SAAU,CAAC,cAAe,QAAS,YAAa,YAAa,eAAe,EAC5E,QAAS,CAAC,KAAK,CACjB,EACA,OAAA/7D,GAAA,aAAuB+7D,sDCZvB,OAAO,eAAel/C,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAIm/C,EAAiB,CACnB,KAAM,aACN,SAAU,YACV,OAAQ,CAAC,KAAM,eAAe,EAC9B,YAAa,yEACb,SAAU,CAAC,OAAQ,UAAW,OAAO,EACrC,QAAS,CAAC,MAAO,WAAY,WAAW,CAC1C,EACA,OAAAn/C,GAAA,eAAyBm/C,sDCZzB,OAAO,eAAej/C,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAIk/C,EAAgB,CAClB,KAAM,YACN,SAAU,YACV,OAAQ,CAAC,KAAM,cAAc,EAC7B,YAAa,4CACb,SAAU,CAAC,QAAS,MAAM,EAC1B,QAAS,CAAC,MAAO,WAAY,YAAY,CAC3C,EACA,OAAAl/C,GAAA,cAAwBk/C,sDCZxB,OAAO,eAAe3wC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAI4wC,EAAW,CACb,KAAM,OACN,SAAU,aACV,OAAQ,CAAC,YAAY,EACrB,YAAa,iLACb,SAAU,CAAC,cAAe,aAAc,oBAAoB,EAC5D,QAAS,CAAC,MAAO,KAAK,CACxB,EACA,OAAA5wC,GAAA,SAAmB4wC,sDCZnB,OAAO,eAAetuC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIuuC,EAAa,CACf,KAAM,SACN,SAAU,UACV,OAAQ,CAAC,QAAS,cAAc,EAChC,YAAa,6QACb,SAAU,CAAC,QAAS,kBAAmB,kBAAkB,EACzD,QAAS,CAAC,SAAU,QAAS,SAAU,YAAa,kBAAmB,eAAe,CACxF,EACA,OAAAvuC,GAAA,WAAqBuuC,sDCZrB,OAAO,eAAeruC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIsuC,EAAa,CACf,KAAM,SACN,SAAU,UACV,OAAQ,CAAC,KAAM,WAAW,EAC1B,YAAa,8IACb,SAAU,CAAC,KAAM,KAAM,oBAAoB,EAC3C,QAAS,CAAC,SAAU,QAAS,SAAU,YAAa,kBAAmB,eAAe,CACxF,EACA,OAAAtuC,GAAA,WAAqBsuC,sDCZrB,OAAO,eAAepuC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIquC,EAAY,CACd,KAAM,QACN,SAAU,UACV,OAAQ,CAAC,QAAS,aAAa,EAC/B,YAAa,8PACb,SAAU,CAAC,QAAS,qBAAqB,EACzC,QAAS,CAAC,SAAU,SAAU,SAAU,YAAa,kBAAmB,eAAe,CACzF,EACA,OAAAruC,GAAA,UAAoBquC,sDCZpB,OAAO,eAAe7vC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI8vC,EAAa,CACf,KAAM,SACN,SAAU,UACV,OAAQ,CAAC,cAAc,EACvB,YAAa,mRACb,SAAU,CAAC,cAAe,sBAAsB,EAChD,QAAS,CAAC,SAAU,SAAU,QAAS,YAAa,kBAAmB,eAAe,CACxF,EACA,OAAA9vC,GAAA,WAAqB8vC,sDCZrB,OAAO,eAAev7B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAIw7B,EAAgB,CAClB,KAAM,YACN,SAAU,UACV,OAAQ,CAAC,SAAU,iBAAiB,EACpC,YAAa,+DACb,SAAU,CAAC,SAAU,QAAQ,EAC7B,QAAS,CAAC,SAAU,SAAU,QAAS,SAAU,kBAAmB,eAAe,CACrF,EACA,OAAAx7B,GAAA,cAAwBw7B,sDCZxB,OAAO,eAAen7B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAIo7B,EAAsB,CACxB,KAAM,kBACN,SAAU,UACV,OAAQ,CAAC,SAAU,uBAAuB,EAC1C,YAAa,mEACb,SAAU,CAAC,SAAU,SAAU,UAAU,EACzC,QAAS,CAAC,SAAU,SAAU,QAAS,SAAU,YAAa,eAAe,CAC/E,EACA,OAAAp7B,GAAA,oBAA8Bo7B,sDCZ9B,OAAO,eAAel7B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIm7B,EAAoB,CACtB,KAAM,gBACN,SAAU,UACV,OAAQ,CAAC,UAAW,qBAAqB,EACzC,YAAa,gEACb,SAAU,CAAC,UAAW,SAAU,WAAW,EAC3C,QAAS,CAAC,SAAU,SAAU,QAAS,SAAU,YAAa,iBAAiB,CACjF,EACA,OAAAn7B,GAAA,kBAA4Bm7B,sDCZ5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIC,EAAkB,CACpB,KAAM,cACN,SAAU,gBACV,OAAQ,CAAC,gBAAgB,EACzB,YAAa,2NACb,SAAU,CAAC,iBAAkB,gBAAgB,EAC7C,QAAS,CAAC,YAAY,CACxB,EACAD,OAAAA,GAAA,gBAA0BC,sDCZ1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIC,EAAc,CAChB,KAAM,UACN,SAAU,gBACV,OAAQ,CAAC,YAAY,EACrB,YAAa,0KACb,SAAU,CAAC,aAAc,YAAY,EACrC,QAAS,CAAC,aAAa,CACzB,EACAD,OAAAA,GAAA,YAAsBC,sDCZtB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIC,EAAkB,CACpB,KAAM,cACN,SAAU,gBACV,OAAQ,CAAC,mBAAmB,EAC5B,YAAa,wIACb,SAAU,CAAC,mBAAmB,EAC9B,QAAS,CAAC,cAAc,CAC1B,EACAD,OAAAA,GAAA,gBAA0BC,sDCZ1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAIC,EAAiB,CACnB,KAAM,aACN,SAAU,gBACV,OAAQ,CAAC,kBAAkB,EAC3B,YAAa,kRACb,SAAU,CAAC,kBAAkB,EAC7B,QAAS,CAAC,aAAa,CACzB,EACAD,OAAAA,GAAA,eAAyBC,sDCZzB,OAAO,eAAe16E,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAI26E,EAAU,CACZ,KAAM,MACN,SAAU,UACV,OAAQ,CAAC,QAAQ,EACjB,YAAa,iGACb,SAAU,CAAC,cAAe,cAAe,aAAa,EACtD,QAAS,CAAC,KAAM,KAAM,OAAQ,KAAK,CACrC,EACA,OAAA36E,GAAA,QAAkB26E,sDCZlB,OAAO,eAAe1uC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAI2uC,EAAW,CACb,KAAM,OACN,SAAU,UACV,OAAQ,CAAC,SAAS,EAClB,YAAa,gGACb,SAAU,CAAC,eAAgB,eAAgB,aAAa,EACxD,QAAS,CAAC,KAAM,KAAM,MAAO,KAAK,CACpC,EACA,OAAA3uC,GAAA,SAAmB2uC,sDCZnB,OAAO,eAAe34D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACaA,GAAA,OAAG,OACjB,IAAI44D,EAAS,CACX,KAAM,KACN,SAAU,UACV,OAAQ,CAAC,OAAO,EAChB,YAAa,8CACb,SAAU,CAAC,aAAc,aAAc,YAAa,SAAS,EAC7D,QAAS,CAAC,KAAM,OAAQ,MAAO,KAAK,CACtC,EACA,OAAA54D,GAAA,OAAiB44D,sDCZjB,OAAO,eAAe34D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACaA,GAAA,OAAG,OACjB,IAAI44D,EAAS,CACX,KAAM,KACN,SAAU,UACV,OAAQ,CAAC,OAAO,EAChB,YAAa,yCACb,SAAU,CAAC,aAAc,aAAc,YAAa,SAAS,EAC7D,QAAS,CAAC,KAAM,OAAQ,MAAO,KAAK,CACtC,EACA,OAAA54D,GAAA,OAAiB44D,sDCZjB,OAAO,eAAevnB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAIwnB,EAAe,CACjB,KAAM,WACN,SAAU,aACV,OAAQ,CAAC,uBAAwB,sCAAsC,EACvE,YAAa,uDACb,SAAU,CAAC,oBAAqB,6BAA6B,EAC7D,QAAS,CAAE,CACb,EACAxnB,OAAAA,GAAA,aAAuBwnB,sDCZvB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAIC,EAAW,CACb,KAAM,OACN,SAAU,aACV,OAAQ,CAAC,eAAgB,cAAc,EACvC,YAAa,oDACb,SAAU,CAAC,aAAc,iBAAiB,EAC1C,QAAS,CAAE,CACb,EACA,OAAAD,GAAA,SAAmBC,sDCZnB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAIC,EAAe,CACjB,KAAM,WACN,SAAU,WACV,OAAQ,CAAC,+BAAgC,gCAAgC,EACzE,YAAa,wDACb,SAAU,CAAC,yBAA0B,0BAA0B,EAC/D,QAAS,CAAE,CACb,EACAD,OAAAA,GAAA,aAAuBC,sDCZvB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAIC,EAAgB,CAClB,KAAM,YACN,SAAU,WACV,OAAQ,CAAC,wCAAyC,gCAAgC,EAClF,YAAa,0DACb,SAAU,CAAC,gDAAiD,iDAAiD,EAC7G,QAAS,CAAE,CACb,EACAD,OAAAA,GAAA,cAAwBC,sDCZxB,OAAO,eAAep8B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAIq8B,EAAU,CACZ,KAAM,MACN,SAAU,UACV,OAAQ,CAAC,UAAW,WAAW,EAC/B,YAAa,uFACb,SAAU,CAAC,iBAAkB,gBAAiB,SAAS,EACvD,QAAS,CAAC,MAAO,KAAM,KAAK,CAC9B,EACA,OAAAr8B,GAAA,QAAkBq8B,sDCZlB,OAAO,eAAejvC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAIkvC,EAAU,CACZ,KAAM,MACN,SAAU,UACV,OAAQ,CAAC,QAAS,QAAQ,EAC1B,YAAa,0DACb,SAAU,CAAC,WAAY,YAAa,QAAS,OAAO,EACpD,QAAS,CAAC,MAAO,KAAM,KAAK,CAC9B,EACA,OAAAlvC,GAAA,QAAkBkvC,sDCZlB,OAAO,eAAehvC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACaA,GAAA,OAAG,OACjB,IAAIivC,EAAS,CACX,KAAM,KACN,SAAU,UACV,OAAQ,CAAC,SAAU,UAAU,EAC7B,YAAa,mFACb,SAAU,CAAC,gBAAiB,iBAAkB,QAAQ,EACtD,QAAS,CAAC,MAAO,MAAO,KAAK,CAC/B,EACA,OAAAjvC,GAAA,OAAiBivC,sDCZjB,OAAO,eAAe/uC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAIgvC,EAAU,CACZ,KAAM,MACN,SAAU,UACV,OAAQ,CAAC,UAAW,WAAW,EAC/B,YAAa,2GACb,SAAU,CAAC,iBAAkB,kBAAmB,gBAAiB,SAAS,EAC1E,QAAS,CAAC,MAAO,MAAO,IAAI,CAC9B,EACA,OAAAhvC,GAAA,QAAkBgvC,sDCZlB,OAAO,eAAexuC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIyuC,EAAa,CACf,KAAM,SACN,SAAU,SACV,OAAQ,CAAC,kBAAkB,EAC3B,YAAa,0CACb,SAAU,CAAC,uBAAwB,eAAgB,cAAc,EACjE,QAAS,CAAC,MAAO,mBAAmB,CACtC,EACA,OAAAzuC,GAAA,WAAqByuC,sDCZrB,OAAO,eAAe36C,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI46C,EAAa,CACf,KAAM,SACN,SAAU,SACV,OAAQ,CAAC,uBAAwB,2BAA2B,EAC5D,YAAa,iKACb,SAAU,CAAC,mBAAoB,mBAAoB,eAAgB,kBAAmB,iBAAiB,EACvG,QAAS,CAAC,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,OAAO,CACzH,EACA,OAAA56C,GAAA,WAAqB46C,sDCZrB,OAAO,eAAevrE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIwrE,EAAY,CACd,KAAM,QACN,SAAU,SACV,OAAQ,CAAC,UAAU,EACnB,YAAa,6DACb,SAAU,CAAC,yBAA0B,WAAY,UAAW,sBAAsB,EAClF,QAAS,CAAC,MAAM,CAClB,EACA,OAAAxrE,GAAA,UAAoBwrE,sDCZpB,OAAO,eAAeruC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIsuC,EAAY,CACd,KAAM,QACN,SAAU,SACV,OAAQ,CAAC,aAAa,EACtB,YAAa,0EACb,SAAU,CAAC,+BAAgC,+BAAgC,8BAA8B,EACzG,QAAS,CAAC,WAAY,KAAK,CAC7B,EACA,OAAAtuC,GAAA,UAAoBsuC,sDCZpB,OAAO,eAAezmC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAI0mC,EAAiB,CACnB,KAAM,aACN,SAAU,SACV,OAAQ,CAAC,KAAO,eAAe,EAC/B,YAAa,2CACb,SAAU,CAAC,yBAA0B,KAAO,eAAe,EAC3D,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,OAAO,CACtH,EACA,OAAA1mC,GAAA,eAAyB0mC,sDCZzB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAIC,EAAU,CACZ,KAAM,MACN,SAAU,SACV,OAAQ,CAAC,QAAQ,EACjB,YAAa,wCACb,SAAU,CAAC,oBAAqB,qCAAqC,EACrE,QAAS,CAAC,SAAU,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,OAAO,CAC5H,EACAD,OAAAA,GAAA,QAAkBC,sDCZlB,OAAO,eAAenuC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAIouC,EAAW,CACb,KAAM,OACN,SAAU,SACV,OAAQ,CAAC,UAAW,YAAY,EAChC,YAAa,4aACb,SAAU,CAAC,YAAa,eAAgB,kCAAmC,SAAS,EACpF,QAAS,CAAC,SAAU,MAAO,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,OAAO,CAC3H,EACA,OAAApuC,GAAA,SAAmBouC,sDCZnB,OAAO,eAAe1xE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAI2xE,EAAW,CACb,KAAM,OACN,SAAU,SACV,OAAQ,CAAC,YAAa,gBAAgB,EACtC,YAAa,CAAC,kFAAmF,2GAA4G,mEAAoE,oEAAqE,0DAA6D,6HAA6H,EAChhB,SAAU,CAAC,wBAAyB,2BAA4B,gCAAiC,yBAA0B,4BAA6B,4BAA6B,uCAAwC,oCAAqC,mCAAmC,EACrS,QAAS,CAAC,WAAY,iBAAiB,CACzC,EACA,OAAA3xE,GAAA,SAAmB2xE,sDCZnB,OAAO,eAAe/yE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAIgzE,EAAU,CACZ,KAAM,MACN,SAAU,SACV,OAAQ,CAAC,YAAa,OAAO,EAC7B,YAAa,6LACb,SAAU,CAAC,4BAA6B,uBAAuB,EAC/D,QAAS,CAAC,WAAY,OAAO,CAC/B,EACA,OAAAhzE,GAAA,QAAkBgzE,sDCZlB,OAAO,eAAelsB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAImsB,EAAW,CACb,KAAM,OACN,SAAU,SACV,OAAQ,CAAC,SAAS,EAClB,YAAa,wEACb,SAAU,CAAC,4BAA4B,EACvC,QAAS,CAAC,KAAK,CACjB,EACAnsB,OAAAA,GAAA,SAAmBmsB,sDCZnB,OAAO,eAAetvE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIuvE,EAAa,CACf,KAAM,SACN,SAAU,SACV,OAAQ,CAAC,iBAAiB,EAC1B,YAAa,4BACb,SAAU,CAAC,wBAAyB,wCAAyC,kCAAkC,EAC/G,QAAS,CAAC,OAAQ,MAAO,SAAS,CACpC,EACA,OAAAvvE,GAAA,WAAqBuvE,sDCZrB,OAAO,eAAervE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIsvE,EAAc,CAChB,KAAM,UACN,SAAU,SACV,OAAQ,CAAC,YAAY,EACrB,YAAa,uEACb,SAAU,CAAC,yBAA0B,UAAW,iBAAkB,SAAS,EAC3E,QAAS,CAAC,SAAU,SAAU,OAAQ,SAAS,CACjD,EACAtvE,OAAAA,GAAA,YAAsBsvE,sDCZtB,OAAO,eAAervE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIsvE,EAAc,CAChB,KAAM,UACN,SAAU,SACV,OAAQ,CAAC,sBAAsB,EAC/B,YAAa,0FACb,SAAU,CAAC,oBAAqB,4EAA6E,uCAAwC,cAAc,EACnK,QAAS,CAAC,MAAO,OAAQ,QAAQ,CACnC,EACA,OAAAtvE,GAAA,YAAsBsvE,sDCZtB,OAAO,eAAe9tC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAI+tC,EAAwB,CAC1B,KAAM,oBACN,SAAU,SACV,OAAQ,CAAC,sBAAsB,EAC/B,YAAa,iOACb,SAAU,CAAC,+BAAgC,wCAAyC,iCAAkC,sCAAsC,EAC5J,QAAS,CAAC,SAAU,SAAU,QAAQ,CACxC,EACA,OAAA/tC,GAAA,sBAAgC+tC,sDCZhC,OAAO,eAAe7tC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAI8tC,EAAe,CACjB,KAAM,WACN,SAAU,SACV,OAAQ,CAAC,cAAe,iBAAkB,kBAAkB,EAC5D,YAAa,yGACb,SAAU,CAAC,cAAe,iBAAkB,yBAA0B,mBAAmB,EACzF,QAAS,CAAC,SAAU,MAAO,OAAQ,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,OAAO,CACvH,EACA,OAAA9tC,GAAA,aAAuB8tC,sDCZvB,OAAO,eAAe3uD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAI4uD,EAAU,CACZ,KAAM,MACN,SAAU,SACV,OAAQ,CAAC,QAAQ,EACjB,YAAa,oCACb,SAAU,CAAC,oBAAqB,SAAU,OAAO,EACjD,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,OAAO,CAC5H,EACA5uD,OAAAA,GAAA,QAAkB4uD,sDCZlB,OAAO,eAAejU,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAIkU,EAAW,CACb,KAAM,OACN,SAAU,SACV,OAAQ,CAAC,SAAS,EAClB,YAAa,kDACb,SAAU,CAAC,qBAAsB,iCAAkC,SAAS,EAC5E,QAAS,CAAC,KAAK,CACjB,EACAlU,OAAAA,GAAA,SAAmBkU,sDCZnB,OAAO,eAAe1tC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAI2tC,EAAW,CACb,KAAM,OACN,SAAU,SACV,OAAQ,CAAC,YAAY,EACrB,YAAa,6DACb,SAAU,CAAC,2CAA4C,sBAAsB,EAC7E,QAAS,CAAC,WAAY,MAAO,OAAO,CACtC,EACA,OAAA3tC,GAAA,SAAmB2tC,sDCZnB,OAAO,eAAetvE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAIuvE,EAAU,CACZ,KAAM,MACN,SAAU,SACV,OAAQ,CAAC,kBAAkB,EAC3B,YAAa,qHACb,SAAU,CAAC,wBAAwB,EACnC,QAAS,CAAC,SAAU,SAAS,CAC/B,EACA,OAAAvvE,GAAA,QAAkBuvE,sDCZlB,OAAO,eAAe5iD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAI6iD,EAAwB,CAC1B,KAAM,oBACN,SAAU,SACV,OAAQ,CAAC,4BAA6B,gCAAiC,qCAAqC,EAC5G,YAAa,4DACb,SAAU,CAAC,6CAA6C,EACxD,QAAS,CAAC,SAAU,iBAAkB,qBAAsB,OAAO,CACrE,EACA,OAAA7iD,GAAA,sBAAgC6iD,sDCZhC,OAAO,eAAetjD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC6BA,GAAA,uBAAG,OACjC,IAAIujD,EAAyB,CAC3B,KAAM,qBACN,SAAU,SACV,OAAQ,CAAC,+BAAgC,uCAAwC,iDAAkD,uCAAwC,gDAAgD,EAC3N,YAAa,qEACb,SAAU,CAAC,qBAAsB,+BAAgC,kCAAmC,8CAA+C,iCAAiC,EACpL,QAAS,CAAC,SAAU,iBAAkB,oBAAqB,OAAO,CACpE,EACA,OAAAvjD,GAAA,uBAAiCujD,sDCZjC,OAAO,eAAepjD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIqjD,EAAqB,CACvB,KAAM,iBACN,SAAU,SACV,OAAQ,CAAC,yBAA0B,6BAA8B,kCAAkC,EACnG,YAAa,yDACb,SAAU,CAAC,0CAA0C,EACrD,QAAS,CAAC,SAAU,oBAAqB,qBAAsB,OAAO,CACxE,EACA,OAAArjD,GAAA,mBAA6BqjD,sDCZ7B,OAAO,eAAe9sC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAI+sC,EAAW,CACb,KAAM,OACN,SAAU,SACV,OAAQ,CAAC,UAAW,aAAc,qBAAsB,YAAa,eAAgB,sBAAsB,EAC3G,YAAa,mCACb,SAAU,CAAC,UAAW,aAAc,oBAAqB,yBAA0B,eAAe,EAClG,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,MAAO,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,OAAO,CAC3H,EACA,OAAA/sC,GAAA,SAAmB+sC,sDCZnB,OAAO,eAAez7B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAI07B,EAAsB,CACxB,KAAM,kBACN,SAAU,SACV,OAAQ,CAAC,wBAAyB,gCAAgC,EAClE,YAAa,uIACb,SAAU,CAAC,iCAAkC,wDAAyD,kBAAmB,6DAA8D,MAAO,qEAAwE,KAAK,EAC3Q,QAAS,CAAC,MAAM,CAClB,EACA,OAAA17B,GAAA,oBAA8B07B,sDCZ9B,OAAO,eAAet0D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIu0D,EAAY,CACd,KAAM,QACN,SAAU,OACV,OAAQ,CAAC,YAAa,iBAAkB,oBAAqB,0BAA2B,eAAe,EACvG,YAAa,iFACb,SAAU,CAAC,MAAO,UAAW,cAAe,kBAAmB,gBAAiB,+BAAgC,aAAa,EAC7H,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,OAAQ,UAAW,SAAU,QAAS,YAAa,OAAO,CAC1H,EACA,OAAAv0D,GAAA,UAAoBu0D,sDCZpB,OAAO,eAAe3vE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAI4vE,EAAc,CAChB,KAAM,UACN,SAAU,SACV,OAAQ,CAAC,mBAAmB,EAC5B,YAAa,qEACb,SAAU,CAAC,sCAAuC,oCAAqC,iCAAkC,gCAAgC,EACzJ,QAAS,CAAC,OAAQ,UAAW,QAAQ,CACvC,EACA,OAAA5vE,GAAA,YAAsB4vE,sDCZtB,OAAO,eAAe3vE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI4vE,EAAa,CACf,KAAM,SACN,SAAU,SACV,OAAQ,CAAC,kBAAmB,+BAA+B,EAC3D,YAAa,mBACb,SAAU,CAAC,2BAA4B,uBAAwB,2BAA4B,oBAAqB,2BAA2B,EAC3I,QAAS,CAAC,OAAQ,SAAU,UAAW,SAAS,CAClD,EACA,OAAA5vE,GAAA,WAAqB4vE,sDCZrB,OAAO,eAAevrC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIwrC,EAAa,CACf,KAAM,SACN,SAAU,SACV,OAAQ,CAAC,mBAAoB,qBAAqB,EAClD,YAAa,2JACb,SAAU,CAAC,yBAA0B,wCAAyC,8CAA+C,6DAA6D,EAC1L,QAAS,CAAC,SAAU,gBAAgB,CACtC,EACA,OAAAxrC,GAAA,WAAqBwrC,sDCZrB,OAAO,eAAetrC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIurC,EAAqB,CACvB,KAAM,iBACN,SAAU,SACV,OAAQ,CAAC,wBAAyB,2BAA4B,kCAAkC,EAChG,YAAa,2JACb,SAAU,CAAC,yBAA0B,2CAA4C,gDAAgD,EACjI,QAAS,CAAC,MAAO,KAAK,CACxB,EACA,OAAAvrC,GAAA,mBAA6BurC,sDCZ7B,OAAO,eAAe5zD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAI6zD,EAAU,CACZ,KAAM,MACN,SAAU,SACV,OAAQ,CAAC,eAAe,EACxB,YAAa,uCACb,SAAU,CAAC,uBAAwB,YAAa,WAAW,EAC3D,QAAS,CAAC,SAAU,gBAAgB,CACtC,EACA,OAAA7zD,GAAA,QAAkB6zD,sDCZlB,OAAO,eAAe90E,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAI+0E,EAAW,CACb,KAAM,OACN,SAAU,SACV,OAAQ,CAAC,SAAS,EAClB,YAAa,kCACb,SAAU,CAAC,YAAa,sBAAuB,yBAA0B,UAAW,WAAW,EAC/F,QAAS,CAAC,SAAU,QAAS,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,UAAW,SAAU,QAAS,YAAa,OAAO,CACpI,EACA,OAAA/0E,GAAA,SAAmB+0E,sDCZnB,OAAO,eAAez7B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAI07B,EAAW,CACb,KAAM,OACN,SAAU,SACV,OAAQ,CAAC,UAAW,kBAAkB,EACtC,YAAa,2GACb,SAAU,CAAC,mBAAoB,wCAAyC,+CAAgD,iDAAkD,mCAAmC,EAC7M,QAAS,CAAC,MAAO,SAAU,SAAS,CACtC,EACA,OAAA17B,GAAA,SAAmB07B,sDCZnB,OAAO,eAAehwE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIiwE,EAAc,CAChB,KAAM,UACN,SAAU,SACV,OAAQ,CAAC,YAAY,EACrB,YAAa,6DACb,SAAU,CAAC,mBAAoB,mBAAoB,mBAAoB,kBAAkB,EACzF,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,SAAU,QAAS,YAAa,OAAO,CACxH,EACA,OAAAjwE,GAAA,YAAsBiwE,sDCZtB,OAAO,eAAexpC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIypC,EAAa,CACf,KAAM,SACN,SAAU,SACV,OAAQ,CAAC,eAAgB,6BAA8B,yBAA0B,qCAAqC,EACtH,YAAa,igBACb,SAAU,CAAC,mBAAoB,SAAU,qBAAsB,mBAAoB,YAAa,UAAW,UAAW,oCAAqC,GAAG,EAC9J,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,QAAS,YAAa,OAAO,CACzH,EACA,OAAAzpC,GAAA,WAAqBypC,sDCZrB,OAAO,eAAerrB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIsrB,EAAY,CACd,KAAM,QACN,SAAU,SACV,OAAQ,CAAC,UAAU,EACnB,YAAa,oGACb,SAAU,CAAC,mCAAoC,UAAU,EACzD,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,YAAa,OAAO,CAC1H,EACA,OAAAtrB,GAAA,UAAoBsrB,sDCZpB,OAAO,eAAehpC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAIipC,EAAgB,CAClB,KAAM,YACN,SAAU,SACV,OAAQ,CAAC,KAAO,cAAc,EAC9B,YAAa,qBACb,SAAU,CAAC,yBAA0B,KAAO,cAAc,EAC1D,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,OAAO,CACtH,EACA,OAAAjpC,GAAA,cAAwBipC,sDCZxB,OAAO,eAAez0E,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAI00E,EAAY,CACd,KAAM,QACN,SAAU,SACV,OAAQ,CAAC,WAAY,cAAe,sBAAuB,aAAc,gBAAiB,uBAAuB,EACjH,YAAa,oCACb,SAAU,CAAC,WAAY,cAAe,yBAA0B,gBAAgB,EAChF,QAAS,CAAC,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,WAAW,CAC1H,EACA,OAAA10E,GAAA,UAAoB00E,sDCZpB,OAAO,eAAevoC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAIwoC,EAAU,CACZ,KAAM,MACN,SAAU,SACV,OAAQ,CAAC,QAAQ,EACjB,YAAa,4CACb,SAAU,CAAC,uBAAuB,EAClC,QAAS,CAAC,MAAM,CAClB,EACA,OAAAxoC,GAAA,QAAkBwoC,sDCZlB,OAAO,eAAevnC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAIwnC,EAAW,CACb,KAAM,OACN,SAAU,SACV,OAAQ,CAAC,SAAS,EAClB,YAAa,oDACb,SAAU,CAAC,wBAAwB,EACnC,QAAS,CAAC,KAAK,CACjB,EACA,OAAAxnC,GAAA,SAAmBwnC,sDCZnB,OAAO,eAAetvD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIuvD,EAAmB,CACrB,KAAM,eACN,SAAU,cACV,OAAQ,CAAC,oBAAoB,EAC7B,YAAa,kEACb,SAAU,CAAC,oBAAoB,EAC/B,QAAS,CAAC,sBAAuB,eAAgB,WAAW,CAC9D,EACAvvD,OAAAA,GAAA,iBAA2BuvD,sDCZ3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC8BA,GAAA,wBAAG,OAClC,IAAIC,EAA0B,CAC5B,KAAM,sBACN,SAAU,cACV,OAAQ,CAAC,2BAA2B,EACpC,YAAa,qFACb,SAAU,CAAC,2BAA2B,EACtC,QAAS,CAAC,eAAgB,eAAgB,WAAW,CACvD,EACAD,OAAAA,GAAA,wBAAkCC,sDCZlC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAIC,EAAgB,CAClB,KAAM,YACN,SAAU,cACV,OAAQ,CAAC,KAAM,cAAc,EAC7B,YAAa,mCACb,SAAU,CAAC,KAAM,oBAAqB,IAAI,EAC1C,QAAS,CAAC,eAAgB,sBAAuB,eAAgB,OAAO,CAC1E,EACAD,OAAAA,GAAA,cAAwBC,sDCZxB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIC,EAAY,CACd,KAAM,QACN,SAAU,cACV,OAAQ,CAAC,UAAU,EACnB,YAAa,6IACb,SAAU,CAAC,WAAY,KAAM,aAAc,UAAU,EACrD,QAAS,CAAC,WAAW,CACvB,EACAD,OAAAA,GAAA,UAAoBC,sDCZpB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIC,EAAa,CACf,KAAM,SACN,SAAU,cACV,OAAQ,CAAC,WAAW,EACpB,YAAa,mKACb,SAAU,CAAC,YAAa,cAAe,YAAa,yBAAyB,EAC7E,QAAS,CAAC,OAAO,CACnB,EACAD,OAAAA,GAAA,WAAqBC,sDCZrB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIC,EAAmB,CACrB,KAAM,eACN,SAAU,cACV,OAAQ,CAAC,oBAAoB,EAC7B,YAAa,6EACb,SAAU,CAAC,4CAA4C,EACvD,QAAS,CAAE,CACb,EACAD,OAAAA,GAAA,iBAA2BC,sDCZ3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIC,EAAkB,CACpB,KAAM,cACN,SAAU,cACV,OAAQ,CAAC,gBAAgB,EACzB,YAAa,4OACb,SAAU,CAAC,wBAAwB,EACnC,QAAS,CAAC,eAAgB,WAAW,CACvC,EACAD,OAAAA,GAAA,gBAA0BC,sDCZ1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIC,EAAmB,CACrB,KAAM,eACN,SAAU,cACV,OAAQ,CAAC,kBAAmB,oBAAoB,EAChD,YAAa,kEACb,SAAU,CAAC,kBAAmB,oBAAoB,EAClD,QAAS,CAAC,eAAgB,sBAAuB,WAAW,CAC9D,EACAD,OAAAA,GAAA,iBAA2BC,sDCZ3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAIC,EAAiB,CACnB,KAAM,aACN,SAAU,cACV,OAAQ,CAAC,oBAAqB,4BAA6B,6BAA8B,qCAAsC,oCAAoC,EACnK,YAAa,0CACb,SAAU,CAAC,mBAAoB,2BAA4B,8BAA+B,yCAA0C,4CAA6C,2CAA2C,EAC5N,QAAS,CAAC,SAAU,WAAW,CACjC,EACAD,OAAAA,GAAA,eAAyBC,sDCZzB,OAAO,eAAe79D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI89D,EAAa,CACf,KAAM,SACN,SAAU,cACV,OAAQ,CAAC,WAAY,cAAe,mBAAoB,eAAgB,oBAAqB,wBAAwB,EACrH,YAAa,0BACb,SAAU,CAAC,WAAY,iBAAkB,gBAAgB,EACzD,QAAS,CAAC,aAAc,WAAW,CACrC,EACA99D,OAAAA,GAAA,WAAqB89D,sDCZrB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAIC,EAAgB,CAClB,KAAM,YACN,SAAU,cACV,OAAQ,CAAC,iBAAkB,sBAAuB,kBAAmB,uBAAwB,2BAA2B,EACxH,YAAa,iCACb,SAAU,CAAC,oBAAqB,uBAAuB,EACvD,QAAS,CAAC,aAAc,QAAQ,CAClC,EACAD,OAAAA,GAAA,cAAwBC,sDCZxB,OAAO,eAAe/hE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIgiE,EAAc,CAChB,KAAM,UACN,SAAU,aACV,OAAQ,CAAC,eAAe,EACxB,YAAa,8EACb,SAAU,CAAC,gBAAiB,gBAAiB,gBAAiB,qBAAsB,uBAAuB,EAC3G,QAAS,CAAC,QAAS,UAAW,UAAW,YAAa,WAAY,iBAAkB,aAAa,CACnG,EACA,OAAAhiE,GAAA,YAAsBgiE,sDCZtB,OAAO,eAAejgC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIkgC,EAAqB,CACvB,KAAM,iBACN,SAAU,aACV,OAAQ,CAAC,sBAAsB,EAC/B,YAAa,0HACb,SAAU,CAAC,uBAAwB,uBAAwB,uBAAwB,4BAA6B,4BAA6B,iCAAkC,uCAAwC,oCAAqC,iCAAkC,gCAAgC,EAC9T,QAAS,CAAC,QAAS,UAAW,UAAW,YAAa,WAAY,UAAW,aAAa,CAC5F,EACA,OAAAlgC,GAAA,mBAA6BkgC,sDCZ7B,OAAO,eAAe9zE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAI+zE,EAAkB,CACpB,KAAM,cACN,SAAU,aACV,OAAQ,CAAC,mBAAmB,EAC5B,YAAa,uHACb,SAAU,CAAC,wBAAyB,wBAAyB,wBAAyB,yBAA0B,qBAAsB,iBAAkB,4BAA6B,mCAAmC,EACxN,QAAS,CAAC,UAAW,gBAAgB,CACvC,EACA,OAAA/zE,GAAA,gBAA0B+zE,sDCZ1B,OAAO,eAAev+B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAIw+B,EAAgB,CAClB,KAAM,YACN,SAAU,aACV,OAAQ,CAAC,iBAAiB,EAC1B,YAAa,+IACb,SAAU,CAAC,8BAA+B,2BAA2B,EACrE,QAAS,CAAC,QAAS,UAAW,UAAW,SAAU,YAAa,WAAY,SAAS,CACvF,EACA,OAAAx+B,GAAA,cAAwBw+B,sDCZxB,OAAO,eAAer2C,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIs2C,EAAY,CACd,KAAM,QACN,SAAU,aACV,OAAQ,CAAC,SAAU,aAAa,EAChC,YAAa,wFACb,SAAU,CAAC,WAAY,WAAY,UAAW,YAAa,SAAU,cAAc,EACnF,QAAS,CAAC,UAAW,UAAW,SAAU,YAAa,WAAY,UAAW,YAAa,WAAW,CACxG,EACA,OAAAt2C,GAAA,UAAoBs2C,sDCZpB,OAAO,eAAen/B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAIo/B,EAAgB,CAClB,KAAM,YACN,SAAU,aACV,OAAQ,CAAC,iBAAiB,EAC1B,YAAa,uHACb,SAAU,CAAC,8BAA+B,sBAAuB,uBAAwB,2BAA4B,iCAAiC,EACtJ,QAAS,CAAC,UAAW,iBAAkB,cAAe,OAAO,CAC/D,EACA,OAAAp/B,GAAA,cAAwBo/B,sDCZxB,OAAO,eAAe3uC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI4uC,EAAa,CACf,KAAM,SACN,SAAU,aACV,OAAQ,CAAC,QAAS,cAAc,EAChC,YAAa,2FACb,SAAU,CAAC,QAAS,UAAW,UAAW,YAAa,UAAW,UAAW,eAAe,EAC5F,QAAS,CAAC,QAAS,UAAW,UAAW,YAAa,WAAY,SAAS,CAC7E,EACA,OAAA5uC,GAAA,WAAqB4uC,sDCZrB,OAAO,eAAe3uC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAI4uC,EAAe,CACjB,KAAM,WACN,SAAU,aACV,OAAQ,CAAC,SAAU,gBAAgB,EACnC,YAAa,yGACb,SAAU,CAAC,WAAY,UAAW,UAAW,YAAa,UAAU,EACpE,QAAS,CAAC,QAAS,UAAW,YAAa,UAAW,SAAS,CACjE,EACA,OAAA5uC,GAAA,aAAuB4uC,sDCZvB,OAAO,eAAex2C,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIy2C,EAAc,CAChB,KAAM,UACN,SAAU,aACV,OAAQ,CAAC,QAAS,eAAe,EACjC,YAAa,mGACb,SAAU,CAAC,QAAS,UAAW,UAAW,YAAa,UAAW,eAAe,EACjF,QAAS,CAAC,QAAS,UAAW,SAAU,YAAa,WAAY,SAAS,CAC5E,EACA,OAAAz2C,GAAA,YAAsBy2C,sDCZtB,OAAO,eAAe/uC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAIgvC,EAAgB,CAClB,KAAM,YACN,SAAU,aACV,OAAQ,CAAC,SAAU,iBAAiB,EACpC,YAAa,0GACb,SAAU,CAAC,WAAY,UAAW,UAAW,YAAa,UAAU,EACpE,QAAS,CAAC,QAAS,UAAW,SAAU,UAAW,WAAY,SAAS,CAC1E,EACA,OAAAhvC,GAAA,cAAwBgvC,sDCZxB,OAAO,eAAe3+B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAI4+B,EAAc,CAChB,KAAM,UACN,SAAU,aACV,OAAQ,CAAC,SAAU,eAAe,EAClC,YAAa,uGACb,SAAU,CAAC,WAAY,WAAY,UAAW,YAAa,SAAU,eAAgB,gBAAgB,EACrG,QAAS,CAAC,QAAS,UAAW,SAAU,YAAa,WAAY,UAAW,WAAW,CACzF,EACA,OAAA5+B,GAAA,YAAsB4+B,sDCZtB,OAAO,eAAejyB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIkyB,EAAmB,CACrB,KAAM,eACN,SAAU,MACV,OAAQ,CAAC,0BAA0B,EACnC,YAAa,8LACb,SAAU,CAAC,8BAA8B,EACzC,QAAS,CAAC,WAAY,eAAgB,gBAAiB,aAAa,CACtE,EACA,OAAAlyB,GAAA,iBAA2BkyB,sDCZ3B,OAAO,eAAe5xB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAI6xB,EAAoB,CACtB,KAAM,gBACN,SAAU,MACV,OAAQ,CAAC,2BAA2B,EACpC,YAAa,8LACb,SAAU,CAAC,4CAA6C,mDAAmD,EAC3G,QAAS,CAAC,WAAY,eAAgB,kBAAkB,CAC1D,EACA,OAAA7xB,GAAA,kBAA4B6xB,sDCZ5B,OAAO,eAAe1xB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAI2xB,EAAkB,CACpB,KAAM,cACN,SAAU,MACV,OAAQ,CAAC,kBAAkB,EAC3B,YAAa,2IACb,SAAU,CAAC,iCAAiC,EAC5C,QAAS,CAAC,iBAAiB,CAC7B,EACA,OAAA3xB,GAAA,gBAA0B2xB,sDCZ1B,OAAO,eAAezxB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAI0xB,EAAmB,CACrB,KAAM,eACN,SAAU,MACV,OAAQ,CAAC,0BAA0B,EACnC,YAAa,wIACb,SAAU,CAAC,2CAA4C,kDAAkD,EACzG,QAAS,CAAC,WAAY,eAAe,CACvC,EACA,OAAA1xB,GAAA,iBAA2B0xB,sDCZ3B,OAAO,eAAexxB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIyxB,EAAkB,CACpB,KAAM,cACN,SAAU,MACV,OAAQ,CAAC,yBAAyB,EAClC,YAAa,wMACb,SAAU,CAAC,oCAAqC,mCAAmC,EACnF,QAAS,CAAC,WAAY,eAAgB,eAAe,CACvD,EACA,OAAAzxB,GAAA,gBAA0ByxB,sDCZ1B,OAAO,eAAevxB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAIwxB,EAAsB,CACxB,KAAM,kBACN,SAAU,MACV,OAAQ,CAAC,+BAA+B,EACxC,YAAa,kJACb,SAAU,CAAC,mCAAoC,kCAAkC,EACjF,QAAS,CAAC,cAAe,SAAS,CACpC,EACA,OAAAxxB,GAAA,oBAA8BwxB,sDCZ9B,OAAO,eAAetxB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIuxB,EAAkB,CACpB,KAAM,cACN,SAAU,MACV,OAAQ,CAAC,kBAAkB,EAC3B,YAAa,gMACb,SAAU,CAAC,wBAAwB,EACnC,QAAS,CAAC,cAAc,CAC1B,EACA,OAAAvxB,GAAA,gBAA0BuxB,sDCZ1B,OAAO,eAAelxB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAImxB,EAAc,CAChB,KAAM,UACN,SAAU,MACV,OAAQ,CAAC,eAAgB,sBAAsB,EAC/C,YAAa,sNACb,SAAU,CAAC,wBAAyB,6BAA6B,EACjE,QAAS,CAAC,WAAY,eAAgB,eAAe,CACvD,EACA,OAAAnxB,GAAA,YAAsBmxB,sDCZtB,OAAO,eAAehxB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAIixB,EAAuB,CACzB,KAAM,mBACN,SAAU,MACV,OAAQ,CAAC,8BAA8B,EACvC,YAAa,gJACb,SAAU,CAAC,+CAAgD,sDAAsD,EACjH,QAAS,CAAC,WAAY,eAAgB,eAAe,CACvD,EACA,OAAAjxB,GAAA,qBAA+BixB,sDCZ/B,OAAO,eAAe/wB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAIgxB,EAAe,CACjB,KAAM,WACN,SAAU,MACV,OAAQ,CAAC,sBAAsB,EAC/B,YAAa,iIACb,SAAU,CAAC,uCAAwC,8CAA8C,EACjG,QAAS,CAAC,eAAgB,eAAe,CAC3C,EACA,OAAAhxB,GAAA,aAAuBgxB,sDCZvB,OAAO,eAAe9pC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAI+pC,EAAU,CACZ,KAAM,MACN,SAAU,UACV,OAAQ,CAAC,QAAQ,EACjB,YAAa,6GACb,SAAU,CAAC,WAAY,YAAa,QAAQ,EAC5C,QAAS,CAAE,CACb,EACA,OAAA/pC,GAAA,QAAkB+pC,sDCZlB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAIC,EAAU,CACZ,KAAM,MACN,SAAU,aACV,OAAQ,CAAC,oBAAqB,QAAQ,EACtC,YAAa,8KACb,SAAU,CAAC,kBAAmB,gBAAgB,EAC9C,QAAS,CAAC,OAAQ,SAAU,MAAO,KAAK,CAC1C,EACAD,OAAAA,GAAA,QAAkBC,sDCZlB,OAAO,eAAej0E,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAIk0E,EAAU,CACZ,KAAM,MACN,SAAU,aACV,OAAQ,CAAC,oBAAqB,SAAU,mBAAmB,EAC3D,YAAa,iDACb,SAAU,CAAC,kBAAmB,oBAAqB,oBAAqB,uBAAwB,uBAAwB,gCAAiC,+BAA+B,EACxL,QAAS,CAAC,OAAQ,SAAU,MAAO,OAAQ,MAAO,MAAO,UAAU,CACrE,EACA,OAAAl0E,GAAA,QAAkBk0E,sDCZlB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAIC,EAAW,CACb,KAAM,OACN,SAAU,aACV,OAAQ,CAAC,qBAAsB,UAAW,oBAAoB,EAC9D,YAAa,mDACb,SAAU,CAAC,mBAAoB,qBAAsB,qBAAsB,wBAAyB,wBAAyB,4BAA4B,EACzJ,QAAS,CAAC,MAAO,SAAU,MAAO,OAAQ,MAAO,MAAO,UAAU,CACpE,EACAD,OAAAA,GAAA,SAAmBC,sDCZnB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIC,EAAa,CACf,KAAM,SACN,SAAU,aACV,OAAQ,CAAC,uBAAwB,WAAW,EAC5C,YAAa,mLACb,SAAU,CAAC,kBAAmB,uBAAuB,EACrD,QAAS,CAAC,MAAO,OAAQ,MAAO,OAAQ,MAAO,MAAO,WAAY,aAAa,CACjF,EACAD,OAAAA,GAAA,WAAqBC,sDCZrB,OAAO,eAAezjF,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAI0jF,EAAU,CACZ,KAAM,MACN,SAAU,aACV,OAAQ,CAAC,oBAAqB,SAAU,mBAAmB,EAC3D,YAAa,iDACb,SAAU,CAAC,kBAAmB,oBAAqB,oBAAqB,uBAAwB,uBAAwB,gCAAiC,+BAA+B,EACxL,QAAS,CAAC,MAAO,OAAQ,SAAU,OAAQ,MAAO,MAAO,UAAU,CACrE,EACA,OAAA1jF,GAAA,QAAkB0jF,sDCZlB,OAAO,eAAe3pC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAI4pC,EAAW,CACb,KAAM,OACN,SAAU,aACV,OAAQ,CAAC,qBAAsB,UAAW,0BAA0B,EACpE,YAAa,2HACb,SAAU,CAAC,sBAAuB,8BAA+B,qBAAqB,EACtF,QAAS,CAAC,MAAO,OAAQ,MAAO,SAAU,OAAQ,MAAO,MAAO,UAAU,CAC5E,EACA,OAAA5pC,GAAA,SAAmB4pC,sDCZnB,OAAO,eAAevjE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAIwjE,EAAW,CACb,KAAM,OACN,SAAU,aACV,OAAQ,CAAC,qBAAsB,SAAS,EACxC,YAAa,qCACb,SAAU,CAAC,gBAAiB,kBAAmB,oBAAoB,EACnE,QAAS,CAAC,MAAO,OAAQ,MAAO,SAAU,MAAO,MAAO,MAAO,UAAU,CAC3E,EACA,OAAAxjE,GAAA,SAAmBwjE,sDCZnB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIC,EAAkB,CACpB,KAAM,cACN,SAAU,aACV,OAAQ,CAAC,iCAAkC,gDAAiD,6BAA6B,EACzH,YAAa;AAAA;AAAA,+GACb,SAAU,CAAC,kCAAmC,yCAA0C,gCAAiC,uCAAuC,EAChK,QAAS,CAAC,OAAQ,SAAU,MAAO,MAAO,OAAQ,MAAO,MAAO,UAAU,CAC5E,EACAD,OAAAA,GAAA,gBAA0BC,sDCZ1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAIC,EAAU,CACZ,KAAM,MACN,SAAU,aACV,OAAQ,CAAC,oBAAqB,SAAU,oBAAqB,wBAAyB,kCAAkC,EACxH,YAAa,iLACb,SAAU,CAAC,eAAgB,oBAAqB,mCAAoC,8BAA+B,yBAAyB,EAC5I,QAAS,CAAC,MAAO,OAAQ,MAAO,SAAU,OAAQ,MAAO,UAAU,CACrE,EACAD,OAAAA,GAAA,QAAkBC,sDCZlB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIC,EAAa,CACf,KAAM,SACN,SAAU,aACV,OAAQ,CAAC,uBAAwB,WAAW,EAC5C,YAAa,4CACb,SAAU,CAAC,qBAAsB,uBAAwB,uBAAwB,0BAA2B,yBAAyB,EACrI,QAAS,CAAC,MAAO,OAAQ,SAAU,MAAO,OAAQ,MAAO,MAAO,UAAU,CAC5E,EACAD,OAAAA,GAAA,WAAqBC,sDCZrB,OAAO,eAAeviE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAIwiE,EAAU,CACZ,KAAM,MACN,SAAU,aACV,OAAQ,CAAC,oBAAqB,SAAU,mBAAmB,EAC3D,YAAa,iCACb,SAAU,CAAC,kBAAmB,oBAAqB,mBAAmB,EACtE,QAAS,CAAC,MAAO,OAAQ,SAAU,MAAO,OAAQ,MAAO,MAAO,UAAU,CAC5E,EACAxiE,OAAAA,GAAA,QAAkBwiE,sDCZlB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAIC,EAAe,CACjB,KAAM,WACN,SAAU,aACV,OAAQ,CAAC,yBAA0B,cAAe,yBAA0B,6BAA8B,uCAAuC,EACjJ,YAAa,gIACb,SAAU,CAAC,oBAAqB,yBAA0B,wCAAyC,mCAAoC,8BAA8B,EACrK,QAAS,CAAC,MAAO,OAAQ,MAAO,SAAU,MAAO,OAAQ,MAAO,KAAK,CACvE,EACAD,OAAAA,GAAA,aAAuBC,sDCZvB,OAAO,eAAe5hE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAI6hE,EAAW,CACb,KAAM,OACN,SAAU,eACV,OAAQ,CAAC,SAAS,EAClB,YAAa,oDACb,SAAU,CAAC,YAAa,gBAAgB,EACxC,QAAS,CAAC,MAAO,OAAQ,MAAM,CACjC,EACA,OAAA7hE,GAAA,SAAmB6hE,sDCZnB,OAAO,eAAev3E,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIw3E,EAAY,CACd,KAAM,QACN,SAAU,eACV,OAAQ,CAAC,UAAU,EACnB,YAAa,6FACb,SAAU,CAAC,YAAY,EACvB,QAAS,CAAC,OAAQ,QAAS,OAAO,CACpC,EACA,OAAAx3E,GAAA,UAAoBw3E,sDCZpB,OAAO,eAAev2B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAIw2B,EAAW,CACb,KAAM,OACN,SAAU,eACV,OAAQ,CAAC,SAAS,EAClB,YAAa,8CACb,SAAU,CAAC,YAAa,iBAAkB,SAAS,EACnD,QAAS,CAAC,MAAO,MAAM,CACzB,EACA,OAAAx2B,GAAA,SAAmBw2B,sDCZnB,OAAO,eAAet2B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIu2B,EAAY,CACd,KAAM,QACN,SAAU,eACV,OAAQ,CAAC,UAAU,EACnB,YAAa,6GACb,SAAU,CAAC,WAAY,YAAY,EACnC,QAAS,CAAC,QAAS,OAAO,CAC5B,EACA,OAAAv2B,GAAA,UAAoBu2B,sDCZpB,OAAO,eAAer2B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAIs2B,EAAW,CACb,KAAM,OACN,SAAU,eACV,OAAQ,CAAC,SAAS,EAClB,YAAa,8CACb,SAAU,CAAC,UAAW,iBAAkB,WAAW,EACnD,QAAS,CAAC,MAAO,OAAQ,MAAM,CACjC,EACA,OAAAt2B,GAAA,SAAmBs2B,sDCZnB,OAAO,eAAep2B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIq2B,EAAY,CACd,KAAM,QACN,SAAU,eACV,OAAQ,CAAC,UAAU,EACnB,YAAa,sGACb,SAAU,CAAC,YAAY,EACvB,QAAS,CAAC,QAAS,OAAO,CAC5B,EACA,OAAAr2B,GAAA,UAAoBq2B,sDCZpB,OAAO,eAAen2B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAIo2B,EAAW,CACb,KAAM,OACN,SAAU,eACV,OAAQ,CAAC,SAAS,EAClB,YAAa,2CACb,SAAU,CAAC,YAAa,iBAAkB,SAAS,EACnD,QAAS,CAAC,OAAQ,OAAQ,MAAM,CAClC,EACA,OAAAp2B,GAAA,SAAmBo2B,sDCZnB,OAAO,eAAel2B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIm2B,EAAY,CACd,KAAM,QACN,SAAU,eACV,OAAQ,CAAC,UAAU,EACnB,YAAa,2CACb,SAAU,CAAC,YAAY,EACvB,QAAS,CAAC,QAAS,OAAO,CAC5B,EACA,OAAAn2B,GAAA,UAAoBm2B,sDCZpB,OAAO,eAAeliE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAImiE,EAAW,CACb,KAAM,OACN,SAAU,eACV,OAAQ,CAAC,SAAS,EAClB,YAAa,kDACb,SAAU,CAAC,YAAa,gBAAgB,EACxC,QAAS,CAAC,MAAO,OAAQ,MAAM,CACjC,EACA,OAAAniE,GAAA,SAAmBmiE,sDCZnB,OAAO,eAAe93E,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAI+3E,EAAY,CACd,KAAM,QACN,SAAU,eACV,OAAQ,CAAC,UAAU,EACnB,YAAa,8FACb,SAAU,CAAC,YAAY,EACvB,QAAS,CAAC,QAAS,OAAO,CAC5B,EACA,OAAA/3E,GAAA,UAAoB+3E,sDCZpB,OAAO,eAAeniE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAIoiE,EAAW,CACb,KAAM,OACN,SAAU,eACV,OAAQ,CAAC,SAAS,EAClB,YAAa,qDACb,SAAU,CAAC,YAAa,gBAAgB,EACxC,QAAS,CAAC,MAAO,OAAQ,MAAM,CACjC,EACA,OAAApiE,GAAA,SAAmBoiE,sDCZnB,OAAO,eAAeniE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIoiE,EAAY,CACd,KAAM,QACN,SAAU,eACV,OAAQ,CAAC,aAAa,EACtB,YAAa,qEACb,SAAU,CAAC,mBAAoB,wBAAyB,iBAAkB,iBAAkB,aAAa,EACzG,QAAS,CAAC,MAAO,MAAO,KAAK,CAC/B,EACA,OAAApiE,GAAA,UAAoBoiE,sDCZpB,OAAO,eAAeh4E,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIi4E,EAAY,CACd,KAAM,QACN,SAAU,eACV,OAAQ,CAAC,UAAU,EACnB,YAAa,mGACb,SAAU,CAAC,YAAY,EACvB,QAAS,CAAC,QAAS,OAAO,CAC5B,EACA,OAAAj4E,GAAA,UAAoBi4E,sDCZpB,OAAO,eAAe/hE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAIgiE,EAAU,CACZ,KAAM,MACN,SAAU,eACV,OAAQ,CAAC,QAAQ,EACjB,YAAa,sCACb,SAAU,CAAC,SAAU,kBAAmB,eAAgB,cAAe,yBAAyB,EAChG,QAAS,CAAC,OAAQ,MAAO,KAAK,CAChC,EACA,OAAAhiE,GAAA,QAAkBgiE,sDCZlB,OAAO,eAAej4E,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAIk4E,EAAW,CACb,KAAM,OACN,SAAU,eACV,OAAQ,CAAC,SAAS,EAClB,YAAa,iDACb,SAAU,CAAC,WAAW,EACtB,QAAS,CAAC,OAAQ,OAAQ,MAAM,CAClC,EACA,OAAAl4E,GAAA,SAAmBk4E,sDCZnB,OAAO,eAAe91B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAI+1B,EAAU,CACZ,KAAM,MACN,SAAU,eACV,OAAQ,CAAC,QAAQ,EACjB,YAAa,6DACb,SAAU,CAAC,SAAU,YAAY,EACjC,QAAS,CAAC,MAAO,MAAO,KAAK,CAC/B,EACA,OAAA/1B,GAAA,QAAkB+1B,sDCZlB,OAAO,eAAe71B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAI81B,EAAW,CACb,KAAM,OACN,SAAU,eACV,OAAQ,CAAC,SAAS,EAClB,YAAa,oDACb,SAAU,CAAC,UAAW,aAAa,EACnC,QAAS,CAAC,OAAQ,OAAQ,MAAM,CAClC,EACA,OAAA91B,GAAA,SAAmB81B,sDCZnB,OAAO,eAAe51B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAI61B,EAAU,CACZ,KAAM,MACN,SAAU,eACV,OAAQ,CAAC,QAAQ,EACjB,YAAa,4DACb,SAAU,CAAC,SAAU,YAAY,EACjC,QAAS,CAAC,MAAO,MAAO,KAAK,CAC/B,EACA,OAAA71B,GAAA,QAAkB61B,sDCZlB,OAAO,eAAe31B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAI41B,EAAW,CACb,KAAM,OACN,SAAU,eACV,OAAQ,CAAC,SAAS,EAClB,YAAa,wEACb,SAAU,CAAC,UAAW,aAAa,EACnC,QAAS,CAAC,OAAQ,OAAQ,MAAM,CAClC,EACA,OAAA51B,GAAA,SAAmB41B,sDCZnB,OAAO,eAAe11B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAI21B,EAAU,CACZ,KAAM,MACN,SAAU,eACV,OAAQ,CAAC,QAAQ,EACjB,YAAa,0DACb,SAAU,CAAC,SAAU,YAAY,EACjC,QAAS,CAAC,MAAO,MAAO,KAAK,CAC/B,EACA,OAAA31B,GAAA,QAAkB21B,sDCZlB,OAAO,eAAez1B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAI01B,EAAW,CACb,KAAM,OACN,SAAU,eACV,OAAQ,CAAC,SAAS,EAClB,YAAa,sEACb,SAAU,CAAC,UAAW,aAAa,EACnC,QAAS,CAAC,OAAQ,OAAQ,MAAM,CAClC,EACA,OAAA11B,GAAA,SAAmB01B,sDCZnB,OAAO,eAAe5hE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAI6hE,EAAU,CACZ,KAAM,MACN,SAAU,eACV,OAAQ,CAAC,QAAQ,EACjB,YAAa,oCACb,SAAU,CAAC,SAAU,kBAAmB,cAAe,cAAe,yBAAyB,EAC/F,QAAS,CAAC,OAAQ,MAAO,KAAK,CAChC,EACA,OAAA7hE,GAAA,QAAkB6hE,sDCZlB,OAAO,eAAex4E,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAIy4E,EAAW,CACb,KAAM,OACN,SAAU,eACV,OAAQ,CAAC,SAAS,EAClB,YAAa,+CACb,SAAU,CAAC,WAAW,EACtB,QAAS,CAAC,OAAQ,MAAM,CAC1B,EACA,OAAAz4E,GAAA,SAAmBy4E,sDCZnB,OAAO,eAAe3hE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAI4hE,EAAU,CACZ,KAAM,MACN,SAAU,eACV,OAAQ,CAAC,QAAQ,EACjB,YAAa,uCACb,SAAU,CAAC,WAAY,sBAAuB,cAAe,aAAa,EAC1E,QAAS,CAAC,OAAQ,MAAO,KAAK,CAChC,EACA,OAAA5hE,GAAA,QAAkB4hE,sDCZlB,OAAO,eAAez4E,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACeA,GAAA,SAAG,OACnB,IAAI04E,EAAW,CACb,KAAM,OACN,SAAU,eACV,OAAQ,CAAC,SAAS,EAClB,YAAa,kDACb,SAAU,CAAC,YAAa,uBAAuB,EAC/C,QAAS,CAAC,OAAQ,MAAM,CAC1B,EACA,OAAA14E,GAAA,SAAmB04E,sDCZnB,OAAO,eAAe38E,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACaA,GAAA,OAAG,OACjB,IAAI48E,EAAS,CACX,KAAM,KACN,SAAU,QACV,OAAQ,CAAC,YAAa,aAAa,EACnC,YAAa,8BACb,SAAU,CAAC,eAAgB,aAAc,kBAAkB,EAC3D,QAAS,CAAE,CACb,EACA,OAAA58E,GAAA,OAAiB48E,sDCZjB,OAAO,eAAenrC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAIorC,EAAU,CACZ,KAAM,MACN,SAAU,QACV,OAAQ,CAAC,YAAY,EACrB,YAAa,4BACb,SAAU,CAAC,QAAQ,EACnB,QAAS,CAAC,MAAO,KAAK,CACxB,EACA,OAAAprC,GAAA,QAAkBorC,sDCZlB,OAAO,eAAenwF,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIowF,EAAY,CACd,KAAM,QACN,SAAU,QACV,OAAQ,CAAC,UAAU,EACnB,YAAa,sFACb,SAAU,CAAC,aAAc,gBAAiB,gBAAiB,sBAAuB,sBAAsB,EACxG,QAAS,CAAE,CACb,EACA,OAAApwF,GAAA,UAAoBowF,sDCZpB,OAAO,eAAep8E,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIq8E,EAAa,CACf,KAAM,SACN,SAAU,QACV,OAAQ,CAAC,gBAAiB,0BAA0B,EACpD,YAAa,wCACb,SAAU,CAAC,cAAe,iBAAkB,aAAc,eAAe,EACzE,QAAS,CAAC,OAAO,CACnB,EACA,OAAAr8E,GAAA,WAAqBq8E,sDCZrB,OAAO,eAAepwD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAIqwD,EAAsB,CACxB,KAAM,kBACN,SAAU,QACV,OAAQ,CAAC,oBAAoB,EAC7B,YAAa,0HACb,SAAU,CAAC,qBAAsB,uBAAwB,iBAAkB,qBAAsB,kCAAmC,mCAAoC,0BAA2B,sCAAsC,EACzO,QAAS,CAAC,YAAa,SAAU,aAAc,aAAc,QAAS,WAAW,CACnF,EACA,OAAArwD,GAAA,oBAA8BqwD,sDCZ9B,OAAO,eAAenrC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAIorC,EAAU,CACZ,KAAM,MACN,SAAU,QACV,OAAQ,CAAC,YAAY,EACrB,YAAa,iCACb,SAAU,CAAC,UAAU,EACrB,QAAS,CAAC,MAAO,KAAK,CACxB,EACA,OAAAprC,GAAA,QAAkBorC,sDCZlB,OAAO,eAAet8E,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAIu8E,EAAgB,CAClB,KAAM,YACN,SAAU,QACV,OAAQ,CAAC,cAAc,EACvB,YAAa,6CACb,SAAU,CAAC,eAAgB,iBAAkB,yBAAyB,EACtE,QAAS,CAAC,aAAc,YAAa,aAAc,QAAQ,CAC7D,EACA,OAAAv8E,GAAA,cAAwBu8E,sDCZxB,OAAO,eAAejwD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIkwD,EAAY,CACd,KAAM,QACN,SAAU,QACV,OAAQ,CAAC,UAAU,EACnB,YAAa,6CACb,SAAU,CAAC,WAAY,eAAgB,aAAc,iBAAiB,EACtE,QAAS,CAAC,aAAc,YAAa,aAAc,QAAQ,CAC7D,EACA,OAAAlwD,GAAA,UAAoBkwD,sDCZpB,OAAO,eAAe7wD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAI8wD,EAAiB,CACnB,KAAM,aACN,SAAU,QACV,OAAQ,CAAC,eAAe,EACxB,YAAa,uDACb,SAAU,CAAC,gBAAiB,gBAAiB,iBAAkB,0BAA0B,EACzF,QAAS,CAAC,YAAa,YAAa,aAAc,QAAQ,CAC5D,EACA,OAAA9wD,GAAA,eAAyB8wD,sDCZzB,OAAO,eAAe3wD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAI4wD,EAAgB,CAClB,KAAM,YACN,SAAU,QACV,OAAQ,CAAC,cAAc,EACvB,YAAa,qHACb,SAAU,CAAC,eAAgB,iBAAkB,uBAAwB,eAAgB,4BAA6B,6BAA8B,oBAAqB,gCAAgC,EACrM,QAAS,CAAC,YAAa,SAAU,aAAc,aAAc,QAAS,iBAAiB,CACzF,EACA,OAAA5wD,GAAA,cAAwB4wD,sDCZxB,OAAO,eAAexwD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAIywD,EAAiB,CACnB,KAAM,aACN,SAAU,QACV,OAAQ,CAAC,eAAe,EACxB,YAAa,sDACb,SAAU,CAAC,gBAAiB,gBAAiB,iBAAkB,0BAA0B,EACzF,QAAS,CAAC,YAAa,YAAa,aAAc,QAAQ,CAC5D,EACA,OAAAzwD,GAAA,eAAyBywD,sDCZzB,OAAO,eAAehrC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIirC,EAAc,CAChB,KAAM,UACN,SAAU,QACV,OAAQ,CAAC,YAAY,EACrB,YAAa,4EACb,SAAU,CAAC,aAAc,cAAe,uBAAuB,EAC/D,QAAS,CAAC,YAAa,YAAa,aAAc,QAAQ,CAC5D,EACA,OAAAjrC,GAAA,YAAsBirC,sDCZtB,OAAO,eAAexwD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIywD,EAAa,CACf,KAAM,SACN,SAAU,QACV,OAAQ,CAAC,WAAW,EACpB,YAAa,gCACb,SAAU,CAAC,YAAa,YAAa,aAAc,uBAAuB,EAC1E,QAAS,CAAC,YAAa,YAAa,aAAc,YAAY,CAChE,EACA,OAAAzwD,GAAA,WAAqBywD,sDCZrB,OAAO,eAAelsC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAImsC,EAAc,CAChB,KAAM,UACN,SAAU,QACV,OAAQ,CAAC,YAAY,EACrB,YAAa,sFACb,SAAU,CAAC,eAAgB,yBAA0B,4BAA6B,0BAA2B,yBAA0B,kCAAkC,EACzK,QAAS,CAAC,SAAU,WAAY,YAAa,SAAU,QAAQ,CACjE,EACA,OAAAnsC,GAAA,YAAsBmsC,sDCZtB,OAAO,eAAe9rC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAI+rC,EAAU,CACZ,KAAM,MACN,SAAU,QACV,OAAQ,CAAC,YAAY,EACrB,YAAa,2BACb,SAAU,CAAC,SAAS,EACpB,QAAS,CAAC,MAAO,KAAK,CACxB,EACA,OAAA/rC,GAAA,QAAkB+rC,sDCZlB,OAAO,eAAe3rC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAI4rC,EAAY,CACd,KAAM,QACN,SAAU,QACV,OAAQ,CAAC,0BAA2B,oCAAoC,EACxE,YAAa,6CACb,SAAU,CAAC,4CAA6C,+CAAgD,sDAAuD,wCAAwC,EACvM,QAAS,CAAC,QAAQ,CACpB,EACA5rC,OAAAA,GAAA,UAAoB4rC,sDCZpB,OAAO,eAAe1xF,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI2xF,EAAa,CACf,KAAM,SACN,SAAU,QACV,OAAQ,CAAC,WAAW,EACpB,YAAa,8BACb,SAAU,CAAC,cAAe,iBAAkB,iBAAkB,uBAAuB,EACrF,QAAS,CAAC,mBAAmB,CAC/B,EACA,OAAA3xF,GAAA,WAAqB2xF,+CCZrB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAI3wE,EAAK1jB,MACLsiF,EAAS3/E,MACT6hB,EAAKtgB,MACLu+E,EAAY97E,MACZ2tF,EAAM54E,MACN64E,EAAOrvE,MACPsvE,EAAU38D,MACV48D,EAAS38D,MACTorD,EAAOnrD,MACPqrD,EAAQprD,MACR08D,EAAOnmC,MACPomC,EAAMntB,MACNotB,EAAUltB,MACVmtB,EAAQ1qB,MACR2qB,EAAO5kB,MACP2T,EAAQ1T,MACR4kB,EAAW3kB,MACX4kB,EAAaC,MACbC,EAAWC,MACXxjE,EAAWyjE,MACXC,EAAcC,MACdjhE,EAAYkhE,MACZxyD,EAASyyD,MACTC,EAAUC,MACV76E,EAAU86E,MACVC,EAAUC,MACVC,EAAaC,MACbr4E,EAAUs4E,MACVp/B,EAAQq/B,MACRlwF,EAAUmwF,MACVnR,EAAUoR,MACVjjD,EAASkjD,MACTC,EAAcC,MACdC,EAAaC,MACbC,EAAUC,MACVC,EAAaC,MACbC,EAAOC,MACP5W,EAAW6W,MACXC,GAAkBC,MAClBC,EAAMC,MACNC,EAAeC,MACfC,GAAWC,MACXC,GAAYC,MACZC,GAAoBC,MACpBC,GAAgBC,MAChBC,GAAOC,MACPC,GAAiBC,MACjBC,GAAUC,MACVC,GAAaC,MACbC,GAAOC,MACPC,GAAOC,MACPC,EAAQC,MACRC,GAAQC,MACRC,GAAQC,MACRC,GAAUC,MACVC,GAAaC,MACbC,GAAeC,MACfC,GAAUC,MACVC,GAAOC,MACPC,GAAQC,MACRC,GAASC,MACTC,GAAOC,MACPC,GAASC,MACTC,GAAOC,MACPz6B,GAAS06B,MACTC,GAAUC,MACVC,GAAOC,MACPC,EAAOC,MACPC,GAAQC,MACRC,GAASC,MACTC,GAAQC,MACRC,GAAOC,MACPC,GAAYC,MACZt7B,GAAQu7B,MACRC,EAAWC,MACXC,EAAYC,MACZ3xC,GAAO4xC,MACPC,GAASC,MACTC,GAAQC,MACRC,GAAQC,MACRC,GAASC,MACTC,GAAaC,MACbC,GAASC,MACTC,GAAQC,MACRC,GAAUC,MACVC,GAAYC,MACZC,GAAcC,MACdC,GAAaC,MACbC,GAAQC,MACRC,GAAUC,MACVC,GAAUC,MACVC,GAASC,MACTC,GAAUC,MACVC,GAAaC,MACbC,GAAmBC,MACnBC,GAAiBC,MACjBC,GAAeC,MACfC,GAAWC,MACXC,EAAeC,MACfC,EAAaC,MACbC,EAAOC,MACPC,EAAQC,MACRC,EAAMC,MACNC,EAAMC,MACNC,GAAYC,MACZC,GAAQC,MACRC,GAAYC,MACZC,GAAaC,MACbC,GAAOC,MACPC,GAAOC,MACPC,GAAMC,MACNC,GAAOC,MACPhjD,GAAUijD,MACVtjD,GAAUujD,MACVC,GAASC,MACT/iD,GAASgjD,MACTC,GAAcC,MACdC,GAAOC,MACP9iD,GAAQ+iD,MACRvhD,GAAQwhD,MACRC,GAAOC,MACPC,GAAQC,MACRC,GAAUC,MACVC,GAAWC,MACX/iD,GAAWgjD,MACXC,GAAqBC,MACrB7iD,GAAY8iD,MACZC,GAAOC,MACPC,GAAQC,MACR5iD,GAAQ6iD,MACR38E,GAAO48E,MACPC,GAAqBC,MACrBC,GAAsBC,MACtBC,GAAkBC,MAClBniD,GAAQoiD,MACR5wC,GAAmB6wC,MACnBC,GAASC,MACT1jF,GAAW2jF,MACXrkF,GAAUskF,MACVC,GAAUC,MACVC,GAAkBC,MAClBl/C,GAAOm/C,MACPvhC,GAAQwhC,MACRhkC,GAAQikC,MACRxjF,GAAWyjF,MACXnkC,GAAUokC,MACVC,GAASC,MACTz9C,GAAa09C,MACbl+C,GAASm+C,MACT79C,GAAO89C,MACPC,GAAQC,MACRlhE,GAAgBmhE,MAChBC,GAAuBC,MACvBC,GAAaC,MACbC,GAASC,MACTC,GAAUC,MACVC,GAAgBC,MAChBC,GAAeC,MACfC,GAAgBC,MAChBC,GAAcC,MACdC,GAAUC,MACVC,GAAaC,MACbC,GAAWC,MACX31C,GAAkB41C,MAClBC,GAAeC,MACfp0C,GAAaq0C,MACbC,GAASC,MACTC,GAAaC,MACbC,GAAUC,MACVC,GAAYC,MACZC,GAAWC,MACXC,GAAaC,MACb70C,GAAW80C,MACXC,GAAgBC,MAChBC,GAAiBC,MACjBC,GAAeC,MACfC,GAAgBC,MAChBC,GAAeC,MACfC,GAAmBC,MACnBC,GAAeC,MACfC,GAAWC,MACXC,GAAoBC,MACpBC,GAAYC,MACZC,GAAOC,MACPC,GAAOC,MACPp1C,GAAOq1C,MACPC,GAAQC,MACRC,GAAUC,MACVt1C,GAAOu1C,MACPxgD,GAAQygD,MACRjgD,GAAQkgD,MACRC,GAAeC,MACfC,GAAOC,MACPC,GAAUC,MACVC,GAAOC,MACPC,GAAYC,MACZC,GAAQC,MACRC,GAASC,MACTC,GAAQC,MACRC,GAASC,MACTC,GAAQC,MACRC,GAASC,MACTC,GAAQC,MACRC,GAASC,MACTC,GAAQC,MACRC,GAASC,MACTC,GAAQC,MACRC,GAASC,MACTC,GAASC,MACTC,GAAOC,MACPC,GAAQC,MACRC,GAAOC,MACPC,GAAQC,MACRC,GAAOC,MACPC,GAAQC,MACRC,GAAOC,MACPC,GAAQC,MACRC,GAAOC,MACPC,GAAQC,MACRC,GAAOC,MACPC,GAAQC,MACRC,GAAMC,MACNC,GAAOC,MACPC,GAASC,MACTtwF,GAAUuwF,MACVC,GAAmBC,MACnBC,GAAOC,MACPC,GAAaC,MACbjpE,GAASkpE,MACTC,GAAcC,MACdC,GAAaC,MACbC,GAAcC,MACdC,GAAWC,MACXC,GAAUC,MACVC,GAAWC,MACXC,GAAOC,MACPhlD,GAASilD,MACTC,GAAUC,MACVC,GAAe,CAEjB,UAAW7Y,EAAW,cACtB,QAAWE,EAAS,YACpB,QAASvjE,EAAS,YAClB,WAAY0jE,EAAY,eACxB,SAAUhhE,EAAU,aACpB,MAAO0O,EAAO,UACd,OAAQ0yD,EAAQ,WAChB,OAAQ56E,EAAQ,WAChB,OAAQ+6E,EAAQ,WAChB,UAAWE,EAAW,cACtB,OAAQp4E,EAAQ,WAChB,KAAMk5C,EAAM,SAEZ,EAAGlzC,EAAG,MACN,EAAGA,EAAG,MACN,MAAS4+D,EAAO,UAChB,EAAG99D,EAAG,MACN,SAAUi+D,EAAU,aACpB,IAAK8R,EAAK,QACV,KAAMD,EAAI,SACV,MAAOG,EAAO,UACd,OAAQD,EAAQ,WAChB,IAAKtR,EAAK,QACV,KAAQE,EAAM,SACd,GAAIuR,EAAI,OACR,GAAIA,EAAI,OACR,IAAKD,EAAK,QACV,QAASE,EAAQ,WACjB,MAAOC,EAAM,UACb,IAAKC,EAAK,QACV,KAAQjR,EAAM,SACd,QAASkR,EAAS,YAGlB,aAAc,CACZ,YAAa,2BACb,SAAU,CAAC,cAAc,CAC1B,EACD,oBAAqB,CACnB,YAAa,oCACb,SAAU,CAAC,qBAAqB,CACjC,EACD,eAAgB,CACd,YAAa,kBACb,SAAU,CAAC,gBAAgB,CAC5B,EACD,sBAAuB,CACrB,YAAa,0BACb,SAAU,CAAC,uBAAuB,CACnC,EACD,iBAAkB,CAChB,YAAa,0CACb,SAAU,CAAC,kBAAkB,CAC9B,EACD,iBAAkB,CAChB,YAAa,0CACb,SAAU,CAAC,kBAAkB,CAC9B,EACD,gBAAiB,CACf,YAAa,qCACb,SAAU,CAAC,iBAAiB,CAC7B,EACD,QAAS,CACP,YAAa,qBACb,SAAU,CAAC,SAAS,CACrB,EACD,iBAAkB,CAChB,YAAa,oBACb,SAAU,CAAC,kBAAkB,CAC9B,EACD,aAAc,CACZ,YAAa,gBACb,SAAU,CAAC,cAAc,CAC1B,EACD,mBAAoB,CAClB,YAAa,sBACb,SAAU,CAAC,oBAAoB,CAChC,EACD,0BAA2B,CACzB,YAAa,8BACb,SAAU,CAAC,2BAA2B,CACvC,EAED,oBAAqB,CACnB,YAAa,wBACb,SAAU,CAAC,qBAAqB,CACjC,EACD,gBAAiB,CACf,YAAa,mBACb,SAAU,CAAC,iBAAiB,CAC7B,EACD,SAAU,CACR,YAAa,wBACb,SAAU,CAAC,UAAU,CACtB,EACD,WAAY,CACV,YAAa,cACb,SAAU,CAAC,YAAY,CACxB,EACD,wBAAyB,CACvB,YAAa,4BACb,SAAU,CAAC,yBAAyB,CACrC,EACD,aAAc,CACZ,YAAa,gBACb,SAAU,CAAC,cAAc,CAC1B,EACD,cAAe,CACb,YAAa,0BACb,SAAU,CAAC,eAAe,CAC3B,EACD,cAAe,CACb,YAAa,0BACb,SAAU,CAAC,eAAe,CAC3B,EACD,cAAe,CACb,YAAa,iBACb,SAAU,CAAC,eAAe,CAC3B,EACD,WAAY,CACV,YAAa,cACb,SAAU,CAAC,YAAY,CACxB,EACD,aAAc,CACZ,YAAa,gBACb,SAAU,CAAC,cAAc,CAC1B,EACD,YAAa,CACX,YAAa,eACb,SAAU,CAAC,aAAa,CACzB,EACD,qBAAsB,CACpB,YAAa,yBACb,SAAU,CAAC,sBAAsB,CAClC,EACD,QAAS,CACP,YAAa,mBACb,SAAU,CAAC,SAAS,CACrB,EACD,oBAAqB,CACnB,YAAa,wBACb,SAAU,CAAC,qBAAqB,CACjC,EACD,gBAAiB,CACf,YAAa,oBACb,SAAU,CAAC,iBAAiB,CAC7B,EACD,aAAc,CACZ,YAAa,gBACb,SAAU,CAAC,cAAc,CAC1B,EACD,WAAY,CACV,YAAa,uBACb,SAAU,CAAC,YAAY,CACxB,EACD,SAAU,CACR,YAAa,oBACb,SAAU,CAAC,UAAU,CACtB,EACD,UAAW,CACT,YAAa,qBACb,SAAU,CAAC,WAAW,CACvB,EACD,QAAS,CACP,YAAa,mBACb,SAAU,CAAC,SAAS,CACrB,EACD,eAAgB,CACd,YAAa,2BACb,SAAU,CAAC,gBAAgB,CAC5B,EACD,UAAW,CACT,YAAa,qDACb,SAAU,CAAC,WAAW,CACvB,EACD,YAAa,CACX,YAAa,eACb,SAAU,CAAC,aAAa,CACzB,EACD,oBAAqB,CACnB,YAAa,wBACb,SAAU,CAAC,qBAAqB,CACjC,EACD,YAAa,CACX,YAAa,+DACb,SAAU,CAAC,aAAa,CACzB,EACD,cAAe,CACb,YAAa,qDACb,SAAU,CAAC,eAAe,CAC3B,EACD,gBAAiB,CACf,YAAa,4BACb,SAAU,CAAC,iBAAiB,CAC7B,EACD,gBAAiB,CACf,YAAa,4BACb,SAAU,CAAC,iBAAiB,CAC7B,EACD,iBAAkB,CAChB,YAAa,iCACb,SAAU,CAAC,kBAAkB,CAC9B,EAGD,UAAW,CACT,YAAa,sBACb,SAAU,CAAC,WAAW,CACvB,EACD,aAAc,CACZ,YAAa,mCACb,SAAU,CAAC,cAAc,CAC1B,EACD,QAAS,CACP,YAAa,iFACb,SAAU,CAAC,SAAS,CACrB,EACD,aAAc,CACZ,YAAa,gBACb,SAAU,CAAC,cAAc,CAC1B,EACD,WAAY,CACV,YAAa,cACb,SAAU,CAAC,YAAY,CACxB,EACD,WAAY,CACV,YAAa,cACb,SAAU,CAAC,YAAY,CACxB,EACD,aAAc,CACZ,YAAa,gBACb,SAAU,CAAC,cAAc,CAC1B,EACD,kBAAmB,CACjB,YAAa,qBACb,SAAU,CAAC,mBAAmB,CAC/B,EAED,WAAYsB,EAAY,eACxB,OAAQI,EAAQ,WAChB,UAAWE,EAAW,cACtB,IAAKE,EAAK,QACV,QAAS3W,EAAS,YAClB,UAAWqW,EAAW,cACtB,eAAgBS,GAAgB,mBAChC,QAASM,GAAS,YAClB,SAAUE,GAAU,aACpB,iBAAkBE,GAAkB,qBACpC,aAAcE,GAAc,iBAC5B,cAAeI,GAAe,kBAC9B,YAAaZ,EAAa,gBAC1B,IAAKU,GAAK,QACV,OAAQI,GAAQ,WAChB,UAAWE,GAAW,cACtB,GAAIlB,EAAI,OAER,IAAKoB,GAAK,QACV,IAAKE,GAAK,QACV,KAAME,EAAM,SACZ,KAAME,GAAM,SACZ,KAAME,GAAM,SACZ,OAAQE,GAAQ,WAChB,UAAWE,GAAW,cACtB,YAAaE,GAAa,gBAC1B,OAAQE,GAAQ,WAChB,IAAKE,GAAK,QACV,KAAME,GAAM,SACZ,MAAOE,GAAO,UACd,IAAKE,GAAK,QACV,MAAOE,GAAO,UACd,IAAKE,GAAK,QACV,MAAOx6B,GAAO,UACd,IAAK66B,GAAK,QACV,IAAKE,EAAK,QACV,KAAMM,GAAM,SACZ,MAAOF,GAAO,UACd,MAAOF,GAAM,UACb,IAAKM,GAAK,QACV,SAAUE,GAAU,aACpB,KAAMr7B,GAAM,SACZ,QAASw7B,EAAS,YAClB,SAAUE,EAAU,aACpB,IAAK1xC,GAAK,QACV,MAAO6xC,GAAO,UACd,KAAME,GAAM,SACZ,KAAME,GAAM,SACZ,MAAOE,GAAO,UACd,OAAQQ,GAAQ,WAChB,SAAUE,GAAU,aACpB,WAAYE,GAAY,eACxB,UAAWE,GAAW,cACtB,KAAME,GAAM,SACZ,OAAQ5C,GAAQ,WAEhB,OAAQ8C,GAAQ,WAChB,OAAQE,GAAQ,WAChB,MAAOE,GAAO,UACd,OAAQE,GAAQ,WAChB,UAAWE,GAAW,cACtB,gBAAiBE,GAAiB,oBAClC,cAAeE,GAAe,kBAE9B,YAAaE,GAAa,gBAC1B,QAASE,GAAS,YAClB,YAAaE,EAAa,gBAC1B,WAAYE,EAAW,eAEvB,OAAQx4F,EAAQ,WAChB,OAAUg/E,EAAQ,WAClB,MAAO7xC,EAAO,UAEd,IAAKurD,EAAK,QACV,KAAME,EAAM,SACZ,GAAII,EAAI,OACR,GAAIF,EAAI,OAER,SAAUI,GAAU,aACpB,KAAME,GAAM,SAEZ,SAAUE,GAAU,aACpB,UAAWE,GAAW,cAEtB,IAAKE,GAAK,QACV,IAAKE,GAAK,QACV,GAAIE,GAAI,OACR,IAAKE,GAAK,QAEV,OAAQpjD,GAAQ,WAChB,MAAOwjD,GAAO,UACd,MAAO9iD,GAAO,UACd,OAAQL,GAAQ,WAChB,WAAYsjD,GAAY,eACxB,IAAKE,GAAK,QACV,KAAM7iD,GAAM,SACZ,KAAMwB,GAAM,SACZ,IAAKyhD,GAAK,QACV,kBAAmBS,GAAmB,sBACtC,SAAU5iD,GAAU,aACpB,OAAQuiD,GAAQ,WAChB,QAASE,GAAS,YAClB,QAAS9iD,GAAS,YAClB,IAAKojD,GAAK,QACV,KAAME,GAAM,SACZ,KAAMZ,GAAM,SACZ,KAAM/hD,GAAM,SACZ,mBAAoBijD,GAAoB,uBACxC,eAAgBE,GAAgB,mBAChC,kBAAmBJ,GAAmB,sBACtC,IAAK78E,GAAK,QACV,KAAM+6B,GAAM,SACZ,gBAAiBwR,GAAiB,oBAClC,MAAO8wC,GAAO,UACd,OAAQnkF,GAAQ,WAChB,QAASU,GAAS,YAClB,OAAQ6jF,GAAQ,WAChB,eAAgBE,GAAgB,mBAChC,IAAKj/C,GAAK,QACV,KAAM4d,GAAM,SACZ,KAAMxC,GAAM,SACZ,QAASv/C,GAAS,YAClB,OAAQs/C,GAAQ,WAChB,MAAOqkC,GAAO,UACd,UAAWx9C,GAAW,cACtB,MAAOR,GAAO,UACd,IAAKM,GAAK,QACV,KAAM+9C,GAAM,SACZ,UAAWrH,GAAW,cACtB,MAAOE,GAAO,UACd,KAAME,GAAM,SAEZ,aAAch6D,GAAc,iBAC5B,oBAAqBohE,GAAqB,wBAE1C,UAAWE,GAAW,cACtB,MAAOE,GAAO,UACd,aAAcI,GAAc,iBAC5B,OAAQF,GAAQ,WAChB,YAAaI,GAAa,gBAC1B,aAAcE,GAAc,iBAC5B,WAAYE,GAAY,eACxB,OAAQE,GAAQ,WAChB,UAAWE,GAAW,cAEtB,QAASE,GAAS,YAClB,eAAgB11C,GAAgB,mBAChC,YAAa61C,GAAa,gBAC1B,UAAWn0C,GAAW,cACtB,MAAOs0C,GAAO,UACd,UAAWE,GAAW,cACtB,OAAQE,GAAQ,WAChB,SAAUE,GAAU,aACpB,QAASE,GAAS,YAClB,UAAWE,GAAW,cACtB,QAAS50C,GAAS,YAElB,aAAc+0C,GAAc,iBAC5B,cAAeE,GAAe,kBAC9B,YAAaE,GAAa,gBAC1B,aAAcE,GAAc,iBAC5B,YAAaE,GAAa,gBAC1B,gBAAiBE,GAAiB,oBAClC,YAAaE,GAAa,gBAC1B,QAASE,GAAS,YAClB,iBAAkBE,GAAkB,qBACpC,SAAUE,GAAU,aAEpB,IAAKE,GAAK,QAEV,OAAQgB,GAAQ,WAChB,IAAKd,GAAK,QACV,IAAKn1C,GAAK,QACV,KAAMs1C,GAAM,SACZ,OAAQE,GAAQ,WAChB,IAAKr1C,GAAK,QACV,KAAMjL,GAAM,SACZ,KAAMQ,GAAM,SACZ,YAAamgD,GAAa,gBAC1B,IAAKE,GAAK,QACV,IAAKI,GAAK,QACV,SAAUE,GAAU,aAEpB,KAAME,GAAM,SACZ,MAAOE,GAAO,UACd,KAAME,GAAM,SACZ,MAAOE,GAAO,UACd,KAAME,GAAM,SACZ,MAAOE,GAAO,UACd,KAAME,GAAM,SACZ,MAAOE,GAAO,UACd,KAAME,GAAM,SACZ,MAAOE,GAAO,UACd,KAAME,GAAM,SACZ,MAAOI,GAAO,UACd,MAAOF,GAAO,UACd,IAAKI,GAAK,QACV,KAAME,GAAM,SACZ,IAAKE,GAAK,QACV,KAAME,GAAM,SACZ,IAAKE,GAAK,QACV,KAAME,GAAM,SACZ,IAAKE,GAAK,QACV,KAAME,GAAM,SACZ,IAAKE,GAAK,QACV,KAAME,GAAM,SACZ,IAAKE,GAAK,QACV,KAAME,GAAM,SAEZ,GAAIE,GAAI,OAER,MAAOI,GAAO,UACd,OAAQrwF,GAAQ,WAChB,IAAKmwF,GAAK,QACV,IAAKwB,GAAK,QACV,IAAKjB,GAAK,QACV,MAAO9oE,GAAO,UACd,UAAWgpE,GAAW,cACtB,WAAYG,GAAY,eACxB,UAAWE,GAAW,cACtB,gBAAiBT,GAAiB,oBAClC,WAAYW,GAAY,eACxB,QAASE,GAAS,YAClB,OAAQE,GAAQ,WAChB,MAAO3kD,GAAO,UACd,OAAQklD,GAAQ,WAChB,QAASL,GAAS,WACpB,EACAjZ,OAAAA,GAAA,aAAuBwZ,MCtsBvB,OAAO,eAAejjB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI5lE,IAAWhlB,EACXojB,IAAWzgB,GACXmrG,IAAgB5pG,GAAA,EAChBwB,IAAUiB,GACVH,GAAO,OACPia,IAAe,CAAC,QAAS,oBAAqB,MAAM,EACpDstF,OAAgC/oF,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACfw9C,EAAoBx9C,EAAK,kBACzBq8D,EAAOr8D,EAAK,KAmBd,OAAO3d,EAAMlB,GAAM,CACjB,IAAK,SAAaoV,EAAQ,CACxB,IAAIpX,EACAwpG,EAAapyF,EACjB,GAAI,OAAOA,GAAW,UACpB,IAAKpX,KAAQq+D,EAEX,MAAQn9D,IAAQ,gBAAgBm9D,EAAmBr+D,CAAI,GAAKoX,IAAWinD,EAAkBr+D,CAAI,EAAG,CAC9FwpG,EAAaxpG,EACb,KACD,EAkBL,IAAIo9E,KAAUx+D,IAAS,iBAAiB0qF,IAAc,aAAcE,CAAU,EAC9E,GAAI,CAACpsB,EAAK,CACR,IAAIqsB,EAAa,OAAOD,GAAe,WAAaA,EAAW,KAAOA,EACtE,MAAM,IAAI,MAAM,8BAAgCC,EAAa,GAAG,CACjE,CACD,OAAO,IAAIvsB,EAAKE,CAAG,CACpB,CACL,CAAG,CACH,CAAC,EACDgJ,GAAA,WAAqBmjB,cCrErB,OAAO,eAAeG,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAIlpF,IAAWhlB,EACXwG,GAAO,QACPia,IAAe,CAAC,QAAS,OAAO,EAChC0tF,OAAiCnpF,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MACfw8D,EAAQx8D,EAAK,MAoCf,OAAO3d,EAAMlB,GAAM,CACjB,GAAI,UAAa,CACf,OAAO,IAAIq7E,CACZ,EACD,IAAK,SAAaz9E,EAAO,CACvB,OAAO,IAAIy9E,EAAMz9E,CAAK,CACvB,CACL,CAAG,CACH,CAAC,EACD8pG,GAAA,YAAsBC,cCtDtB,OAAO,eAAexiB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAI1nF,IAAMjE,GACN0F,GAAU/C,GACV+a,GAAUxZ,GACV8gB,IAAWre,EACXH,GAAO,MACPia,IAAe,CAAC,QAAS,SAAU,WAAY,WAAY,eAAgB,SAAU,YAAY,EACjG2tF,OAA+BppF,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdgI,EAAWhI,EAAK,SAChB6vB,EAAW7vB,EAAK,SAChBigC,EAAejgC,EAAK,aACpBke,EAASle,EAAK,OACd6kB,EAAa7kB,EAAK,WA0BpB,OAAO3d,EAAMlB,GAAM,CACjB,IAAK,SAAa5D,EAAG,CACnB,SAAW8C,GAAQ,OAAO9C,CAAC,CAC5B,EACD,iBAAkB,SAAaA,EAAG,CAChC,IAAI0V,EAUJ,UATQrU,IAAI,UAAUrB,CAAC,EACrB0V,EAAO1V,EAAE,OACA,MAAM,QAAQA,CAAC,GACxBA,EAAImjB,EAAOnjB,CAAC,EACZ0V,EAAO1V,EAAE,QAGT0V,EAAO,CAAA,EAEDA,EAAK,OAAM,CACjB,IAAK,GAEH,SAAW5S,GAAQ,OAAO9C,CAAC,EAC7B,IAAK,GAEH,GAAI0V,EAAK,CAAC,IAAM,EACd,SAAW5S,GAAQ,OAAO9C,EAAE,QAAS,EAAC,CAAC,CAAC,EAE1C,GAAI0V,EAAK,CAAC,IAAM,EACd,MAAO,GAEP,MAAM,IAAI,WAAW,mCAA2CoF,GAAQ,QAAQpF,CAAI,EAAI,GAAG,EAE/F,IAAK,GACH,CAEE,IAAIuhB,EAAOvhB,EAAK,CAAC,EACbomC,EAAOpmC,EAAK,CAAC,EACjB,GAAIuhB,IAAS6kB,EACX,OAAO8hD,EAAK59F,EAAE,MAAO,EAAC,QAAO,EAAIi3B,CAAU,EAE7C,GAAI6kB,IAAS,EACX,MAAO,GAEP,MAAM,IAAI,WAAW,mCAA2ChhC,GAAQ,QAAQpF,CAAI,EAAI,GAAG,CAE9F,CACH,QAEE,MAAM,IAAI,WAAW,4CAAoDoF,GAAQ,QAAQpF,CAAI,EAAI,GAAG,CACvG,CACF,CACL,CAAG,EAUD,SAASkoF,EAAKz6E,EAAQ8T,EAAM6kB,EAAM,CAChC,GAAI7kB,IAAS,EAEX,SAAWn0B,GAAQ,OAAOqgB,EAAO,CAAC,EAAE,CAAC,CAAC,EACjC,GAAI8T,IAAS,EAGlB,OAAOxM,EAAS6nB,EAASnvB,EAAO,CAAC,EAAE,CAAC,EAAGA,EAAO,CAAC,EAAE,CAAC,CAAC,EAAGmvB,EAASnvB,EAAO,CAAC,EAAE,CAAC,EAAGA,EAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAS1F,QAJIsoF,EAAU,GACVC,EAAa,IAAI,MAAMz0E,CAAI,EAAE,KAAK,CAAC,EAAE,IAAI,SAAUyP,EAAG7pC,EAAG,CAC3D,OAAOA,CACf,CAAO,EACQyoB,EAAI,EAAGA,EAAI2R,EAAM3R,IAAK,CAC7B,IAAIqmF,EAAKD,EAAWpmF,CAAC,EACrB,GAAIqb,EAAOxd,EAAOwoF,CAAE,EAAErmF,CAAC,CAAC,EAAG,CACzB,IAAI2e,EAAK,OACT,IAAKA,EAAK3e,EAAI,EAAG2e,EAAKhN,EAAMgN,IAC1B,GAAI,CAACtD,EAAOxd,EAAOuoF,EAAWznE,CAAE,CAAC,EAAE3e,CAAC,CAAC,EAAG,CACtCqmF,EAAKD,EAAWznE,CAAE,EAClBynE,EAAWznE,CAAE,EAAIynE,EAAWpmF,CAAC,EAC7BomF,EAAWpmF,CAAC,EAAIqmF,EAChBF,EAAU,CAACA,EACX,KACD,CAEH,GAAIxnE,IAAOhN,EAAM,OAAO9T,EAAOwoF,CAAE,EAAErmF,CAAC,CACrC,CAID,QAFIsmF,EAAMzoF,EAAOwoF,CAAE,EAAErmF,CAAC,EAClBumF,EAAOvmF,IAAM,EAAI,EAAInC,EAAOuoF,EAAWpmF,EAAI,CAAC,CAAC,EAAEA,EAAI,CAAC,EAC/CzoB,EAAIyoB,EAAI,EAAGzoB,EAAIo6B,EAAMp6B,IAE5B,QADIivG,EAAKJ,EAAW7uG,CAAC,EACZ2oB,EAAIF,EAAI,EAAGE,EAAIyR,EAAMzR,IAC5BrC,EAAO2oF,CAAE,EAAEtmF,CAAC,EAAIk9B,EAAaj4B,EAAS6nB,EAASnvB,EAAO2oF,CAAE,EAAEtmF,CAAC,EAAGomF,CAAG,EAAGt5D,EAASnvB,EAAO2oF,CAAE,EAAExmF,CAAC,EAAGnC,EAAOwoF,CAAE,EAAEnmF,CAAC,CAAC,CAAC,EAAGqmF,CAAI,CAGtH,CACD,IAAI9iB,EAAM5lE,EAAOuoF,EAAWz0E,EAAO,CAAC,CAAC,EAAEA,EAAO,CAAC,EAC/C,OAAOw0E,EAAUnkE,EAAWyhD,CAAG,EAAIA,CAEtC,CACH,CAAC,EACDA,GAAA,UAAoByiB,cCnJpB,OAAO,eAAe1wE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIz5B,GAAMjE,GACNwgB,IAAS7d,GACTqiB,IAAW9gB,EACXwZ,GAAU/W,GACVH,GAAO,MACPia,IAAe,CAAC,QAAS,SAAU,eAAgB,YAAa,WAAY,aAAc,MAAO,WAAY,KAAK,EAClHkuF,OAA+B3pF,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdigC,EAAejgC,EAAK,aACpBqlB,EAAYrlB,EAAK,UACjB6vB,EAAW7vB,EAAK,SAChB6kB,EAAa7kB,EAAK,WAClBsmE,EAAMtmE,EAAK,IACXk5B,EAAWl5B,EAAK,SAChBwK,EAAMxK,EAAK,IAqBb,OAAO3d,EAAMlB,GAAM,CACjB,iBAAkB,SAAqB5D,EAAG,CACxC,IAAI0V,KAAWrU,GAAI,UAAUrB,CAAC,EAAIA,EAAE,KAAM,KAAO4d,IAAO,WAAW5d,CAAC,EACpE,OAAQ0V,EAAK,OAAM,CACjB,IAAK,GAEH,GAAIA,EAAK,CAAC,IAAM,EACd,SAAQrU,GAAI,UAAUrB,CAAC,EACdmjB,EAAO,CAACu/B,EAAa,EAAG1iD,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,EAExC,CAAC0iD,EAAa,EAAG1iD,EAAE,CAAC,CAAC,CAAC,EAG/B,MAAM,IAAI,WAAW,mCAA2C8a,GAAQ,QAAQpF,CAAI,EAAI,GAAG,EAE/F,IAAK,GAEH,CACE,IAAIuhB,EAAOvhB,EAAK,CAAC,EACbomC,EAAOpmC,EAAK,CAAC,EACjB,GAAIuhB,IAAS6kB,EACX,SAAQz6C,GAAI,UAAUrB,CAAC,EACdmjB,EAAOy7E,EAAK5+F,EAAE,QAAS,EAAEi3B,EAAM6kB,CAAI,EAAG97C,EAAE,QAAO,CAAE,EAGjD4+F,EAAK5+F,EAAGi3B,EAAM6kB,CAAI,EAG3B,MAAM,IAAI,WAAW,mCAA2ChhC,GAAQ,QAAQpF,CAAI,EAAI,GAAG,CAE9F,CACH,QAEE,MAAM,IAAI,WAAW,4CAAoDoF,GAAQ,QAAQpF,CAAI,EAAI,GAAG,CACvG,CACF,EACD,IAAK,SAAa1V,EAAG,CAEnB,OAAO0iD,EAAa,EAAG1iD,CAAC,CACzB,CACL,CAAG,EAUD,SAAS4+F,EAAKpnE,EAAKP,EAAM6kB,EAAM,CAC7B,IAAIh9B,EAAGjX,EAAGob,EAAGzhB,EAAO6oB,EACpB,GAAI4M,IAAS,EAAG,CAGd,GADAz1B,EAAQg2B,EAAI,CAAC,EAAE,CAAC,EACZh2B,IAAU,EACZ,MAAM,MAAM,+CAA+C,EAE7D,MAAO,CAAC,CAACkhD,EAAa,EAAGlhD,CAAK,CAAC,CAAC,CACtC,SAAey1B,IAAS,EAAG,CAErB,IAAIja,EAAI+rE,EAAIvxD,CAAG,EACf,GAAIxa,IAAM,EACR,MAAM,MAAM,+CAA+C,EAE7D,MAAO,CAAC,CAAC0lC,EAAalrB,EAAI,CAAC,EAAE,CAAC,EAAGxa,CAAC,EAAG0lC,EAAapb,EAAW9P,EAAI,CAAC,EAAE,CAAC,CAAC,EAAGxa,CAAC,CAAC,EAAG,CAAC0lC,EAAapb,EAAW9P,EAAI,CAAC,EAAE,CAAC,CAAC,EAAGxa,CAAC,EAAG0lC,EAAalrB,EAAI,CAAC,EAAE,CAAC,EAAGxa,CAAC,CAAC,CAAC,CACxJ,KAAW,CAQL,IAAIkT,EAAIsH,EAAI,SACZ,IAAK1Y,EAAI,EAAGA,EAAImY,EAAMnY,IACpBoR,EAAEpR,CAAC,EAAIoR,EAAEpR,CAAC,EAAE,OAAM,EAQpB,QAHIqR,EAAIwrB,EAAS1kB,CAAI,EAAE,QAAO,EAGrB/qB,EAAI,EAAGA,EAAI4vC,EAAM5vC,IAAK,CAE7B,IAAI8/F,EAAO/+E,EAAIiD,EAAEhkB,CAAC,EAAEA,CAAC,CAAC,EAClB+/F,EAAO//F,EAEX,IADA4S,EAAI5S,EAAI,EACD4S,EAAImY,GACLhK,EAAIiD,EAAEpR,CAAC,EAAE5S,CAAC,CAAC,EAAI8/F,IACjBA,EAAO/+E,EAAIiD,EAAEpR,CAAC,EAAE5S,CAAC,CAAC,EAClB+/F,EAAOntF,GAETA,IAEF,GAAIktF,IAAS,EACX,MAAM,MAAM,+CAA+C,EAE7DltF,EAAImtF,EACAntF,IAAM5S,IACRme,EAAO6F,EAAEhkB,CAAC,EACVgkB,EAAEhkB,CAAC,EAAIgkB,EAAEpR,CAAC,EACVoR,EAAEpR,CAAC,EAAIuL,EACPA,EAAO8F,EAAEjkB,CAAC,EACVikB,EAAEjkB,CAAC,EAAIikB,EAAErR,CAAC,EACVqR,EAAErR,CAAC,EAAIuL,GAIT,IAAI6hF,EAAKh8E,EAAEhkB,CAAC,EACRigG,EAAKh8E,EAAEjkB,CAAC,EACZ,IAAK4S,EAAI,EAAGA,EAAImY,EAAMnY,IAAK,CACzB,IAAIstF,EAAKl8E,EAAEpR,CAAC,EACRutF,EAAKl8E,EAAErR,CAAC,EACZ,GAAIA,IAAM5S,GAER,GAAIkgG,EAAGlgG,CAAC,IAAM,EAAG,CAKf,IAJA+W,EAAIy/B,EAAapb,EAAW8kE,EAAGlgG,CAAC,CAAC,EAAGggG,EAAGhgG,CAAC,CAAC,EAIpCrE,EAAIqE,EAAGrE,EAAIi0C,EAAMj0C,IACpBukG,EAAGvkG,CAAC,EAAIigC,EAAUskE,EAAGvkG,CAAC,EAAGyqC,EAASrvB,EAAGipF,EAAGrkG,CAAC,CAAC,CAAC,EAE7C,IAAKA,EAAI,EAAGA,EAAIi0C,EAAMj0C,IACpBwkG,EAAGxkG,CAAC,EAAIigC,EAAUukE,EAAGxkG,CAAC,EAAGyqC,EAASrvB,EAAGkpF,EAAGtkG,CAAC,CAAC,CAAC,CAE9C,MACI,CAIL,IADAob,EAAIipF,EAAGhgG,CAAC,EACHrE,EAAIqE,EAAGrE,EAAIi0C,EAAMj0C,IACpBukG,EAAGvkG,CAAC,EAAI66C,EAAa0pD,EAAGvkG,CAAC,EAAGob,CAAC,EAE/B,IAAKpb,EAAI,EAAGA,EAAIi0C,EAAMj0C,IACpBwkG,EAAGxkG,CAAC,EAAI66C,EAAa2pD,EAAGxkG,CAAC,EAAGob,CAAC,CAEhC,CACF,CACF,CACD,OAAOkN,CACR,CACF,CACH,CAAC,EACD2K,GAAA,UAAoBixE,cC1LpB,OAAO,eAAet2B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIp0E,GAAMjE,GACNwgB,IAAS7d,GACTqiB,IAAW9gB,EACXwZ,IAAU/W,GACVjB,GAAUgW,GACVlV,GAAO,OACPia,IAAe,CAAC,QAAS,SAAU,MAAO,YAAa,QAAS,YAAa,MAAO,aAAc,eAAgB,WAAY,MAAO,SAAS,EAC9IyuF,OAAgClqF,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdqY,EAAMrY,EAAK,IACXwrC,EAAYxrC,EAAK,UACjB2zB,EAAQ3zB,EAAK,MACbkgC,EAAYlgC,EAAK,UACjBtM,EAAMsM,EAAK,IACX2/B,EAAa3/B,EAAK,WAClBigC,EAAejgC,EAAK,aACpB6vB,EAAW7vB,EAAK,SAChB0K,EAAM1K,EAAK,IACXE,EAAUF,EAAK,QAqBjB,OAAO3d,EAAMlB,GAAM,CACjB,iBAAkB,SAAqB5D,EAAG,CACxC,IAAI0V,KAAWrU,GAAI,UAAUrB,CAAC,EAAIA,EAAE,KAAM,KAAO4d,IAAO,WAAW5d,CAAC,EACpE,OAAQ0V,EAAK,OAAM,CACjB,IAAK,GAEH,OAAI62F,EAASvsG,CAAC,EAAUoiD,EAAWpiD,CAAC,EAChC0V,EAAK,CAAC,IAAM,EACPolB,EAAI96B,CAAC,EAEL2iD,EAAUP,EAAWpiD,CAAC,EAAGmW,EAAInW,EAAGA,CAAC,CAAC,EAE7C,IAAK,GAEH,CACE,GAAIusG,EAASvsG,CAAC,EAAG,OAAOoiD,EAAWpiD,CAAC,EACpC,IAAIi3B,EAAOvhB,EAAK,CAAC,EACbomC,EAAOpmC,EAAK,CAAC,EACjB,GAAIuhB,IAAS6kB,EACX,GAAI,CACF,OAAOhhB,EAAI96B,CAAC,CACb,OAAQ8J,EAAK,CACZ,GAAI,EAAAA,aAAe,OAASA,EAAI,QAAQ,MAAM,+CAA+C,GAG3F,MAAMA,CAET,CAEH,SAAQzI,GAAI,UAAUrB,CAAC,EACdmjB,EAAO27E,EAAM9+F,EAAE,QAAS,EAAEi3B,EAAM6kB,CAAI,EAAG97C,EAAE,QAAO,CAAE,EAGlD8+F,EAAM9+F,EAAGi3B,EAAM6kB,CAAI,CAE7B,CACH,QAEE,MAAM,IAAI,WAAW,4CAAoDhhC,IAAQ,QAAQpF,CAAI,EAAI,GAAG,CACvG,CACF,EACD,IAAK,SAAa1V,EAAG,CAEnB,OAAIo2C,EAAMp2C,EAAG,CAAC,KAAc8C,GAAQ,OAAO9C,CAAC,EACrC0iD,EAAa,EAAG1iD,CAAC,CACzB,CACL,CAAG,EAUD,SAAS8+F,EAAMtnE,EAAKP,EAAM6kB,EAAM,CAC9B,IAAI0wD,EAAaC,EAAUj1E,EAAKP,EAAM6kB,CAAI,EACxC1rB,EAAIo8E,EAAW,EACf3rF,EAAI2rF,EAAW,EACbE,EAAQp6D,EAASxX,EAAIwX,EAAS8P,EAAWhyB,CAAC,EAAGA,CAAC,CAAC,EAAGgyB,EAAWhyB,CAAC,CAAC,EAC/Du8E,EAAQr6D,EAAS8P,EAAWvhC,CAAC,EAAGia,EAAIwX,EAASzxB,EAAGuhC,EAAWvhC,CAAC,CAAC,CAAC,CAAC,EACnE,OAAOyxB,EAASq6D,EAAOD,CAAK,CAC7B,CAaD,SAASE,EAAMp1E,EAAKP,EAAM6kB,EAAM,CAG9B,QAFIvrB,KAAQztB,GAAQ,OAAO00B,CAAG,EAC1Bq1E,EAAO,EACF/tF,EAAI,EAAGA,EAAImY,EAAMnY,IAAK,CAC7B,GAAIg9B,GAAQ+wD,EACV,OAAOt8E,EAGT,QADI1zB,EAAIiiB,EACD0rF,EAAQj6E,EAAE1zB,CAAC,EAAEgwG,CAAI,CAAC,GAEvB,GADAhwG,IACIo6B,IAASp6B,IACXA,EAAIiiB,EACJ+tF,IACI/wD,IAAS+wD,GACX,OAAOt8E,EAIb,IAAImR,EAAQ,CAACnR,EAAEzR,CAAC,EAAGyR,EAAE1zB,CAAC,CAAC,EACvB0zB,EAAE1zB,CAAC,EAAI6kC,EAAM,CAAC,EACdnR,EAAEzR,CAAC,EAAI4iB,EAAM,CAAC,EAEd,QADIrJ,EAAM9H,EAAEzR,CAAC,EAAE+tF,CAAI,EACVrnF,EAAI,EAAGA,EAAIs2B,EAAMt2B,IACxB+K,EAAEzR,CAAC,EAAE0G,CAAC,EAAIm9B,EAAUpyB,EAAEzR,CAAC,EAAE0G,CAAC,EAAG6S,CAAG,EAElC,QAASzW,EAAK,EAAGA,EAAKqV,EAAMrV,IAC1B,GAAIA,IAAO9C,EACX,CAAAuZ,EAAM9H,EAAE3O,CAAE,EAAEirF,CAAI,EAChB,QAASlpE,EAAK,EAAGA,EAAKmY,EAAMnY,IAC1BpT,EAAE3O,CAAE,EAAE+hB,CAAE,EAAIxW,EAAIoD,EAAE3O,CAAE,EAAE+hB,CAAE,EAAG2O,EAAS,GAAIA,EAASja,EAAK9H,EAAEzR,CAAC,EAAE6kB,CAAE,CAAC,CAAC,CAAC,EAGpEkpE,GACD,CACD,OAAOt8E,CACR,CAWD,SAASk8E,EAAUj1E,EAAKP,EAAM6kB,EAAM,CAClC,IAAIgxD,EAAOF,EAAMp1E,EAAKP,EAAM6kB,CAAI,EAC5B1rB,EAAIoH,EAAI,IAAI,SAAUkP,EAAG7pC,EAAG,CAC9B,OAAO6pC,EAAE,OAAO,SAAUA,EAAGlhB,EAAG,CAC9B,OAAOA,EAAIyR,GAAQ,CAACuzE,EAAQr0F,EAAI22F,EAAKtnF,CAAC,EAAGsnF,EAAKtnF,CAAC,CAAC,CAAC,CACzD,CAAO,CACP,CAAK,EACG3E,EAAIisF,EAAK,OAAO,SAAUpmE,EAAG7pC,EAAG,CAClC,MAAO,CAAC2tG,EAAQr0F,EAAI22F,EAAKjwG,CAAC,EAAGiwG,EAAKjwG,CAAC,CAAC,CAAC,CAC3C,CAAK,EACD,MAAO,CACL,EAAGuzB,EACH,EAAGvP,CACT,CACG,CACD,SAAS2pF,EAAQxqG,EAAG,CAClB,OAAOo2C,EAAMjpB,EAAIntB,EAAG2iB,EAAQ,EAAG,CAAC,CAAC,EAAGwK,EAAI,EAAGxK,EAAQ,EAAG,CAAC,CAAC,CAAC,CAC1D,CACD,SAAS4pF,EAAS/5F,EAAK,CACrB,OAAOy7C,EAAU9gC,EAAI3a,EAAKmQ,EAAQ,EAAG,CAAC,CAAC,EAAGwK,EAAImlB,EAAS9/B,EAAK,CAAC,EAAGmQ,EAAQ,EAAG,CAAC,CAAC,CAAC,CAC/E,CACH,CAAC,EACD8yD,GAAA,WAAqB62B,oBC5LjB9vG,IAAyBY,GAC7B,OAAO,eAAe2vG,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAGC,IAC5B,IAAIp/D,GAAsBpxC,IAAuBuD,GAAA,CAAmD,EAChG+C,IAAUxB,GACd,SAASmf,GAA2BtjB,EAAGujB,EAAgB,CAAE,IAAIC,EAAK,OAAO,OAAW,KAAexjB,EAAE,OAAO,QAAQ,GAAKA,EAAE,YAAY,EAAG,GAAI,CAACwjB,EAAI,CAAE,GAAI,MAAM,QAAQxjB,CAAC,IAAMwjB,EAAKC,IAA4BzjB,CAAC,IAAMujB,GAAkBvjB,GAAK,OAAOA,EAAE,QAAW,SAAU,CAAMwjB,IAAIxjB,EAAIwjB,GAAI,IAAI9jB,EAAI,EAAOgkB,EAAI,UAAa,GAAI,MAAO,CAAE,EAAGA,EAAG,EAAG,UAAa,CAAE,OAAIhkB,GAAKM,EAAE,OAAe,CAAE,KAAM,EAAI,EAAW,CAAE,KAAM,GAAO,MAAOA,EAAEN,GAAG,EAAI,EAAI,EAAG,SAAWikB,EAAI,CAAE,MAAMA,CAAG,EAAI,EAAGD,CAAG,CAAG,CAAC,MAAM,IAAI,UAAU;AAAA,mFAAuI,CAAI,CAAC,IAAIE,EAAmB,GAAMC,EAAS,GAAOlX,EAAK,MAAO,CAAE,EAAG,UAAa,CAAE6W,EAAKA,EAAG,KAAKxjB,CAAC,CAAE,EAAI,EAAG,UAAa,CAAE,IAAI8jB,EAAON,EAAG,KAAM,EAAE,OAAAI,EAAmBE,EAAK,KAAaA,CAAO,EAAE,EAAG,SAAWC,EAAK,CAAEF,EAAS,GAAMlX,EAAMoX,CAAM,EAAE,EAAG,UAAa,CAAE,GAAI,CAAM,CAACH,GAAoBJ,EAAG,QAAa,MAAMA,EAAG,OAAS,CAAG,QAAW,CAAE,GAAIK,EAAQ,MAAMlX,CAAI,CAAI,CAAA,CAAK,CAC5+B,SAAS8W,IAA4BzjB,EAAGwe,EAAQ,CAAE,GAAKxe,EAAW,IAAI,OAAOA,GAAM,SAAU,OAAOgkB,GAAkBhkB,EAAGwe,CAAM,EAAG,IAAI,EAAI,OAAO,UAAU,SAAS,KAAKxe,CAAC,EAAE,MAAM,EAAG,EAAE,EAAgE,GAAzD,IAAM,UAAYA,EAAE,cAAa,EAAIA,EAAE,YAAY,MAAU,IAAM,OAAS,IAAM,MAAO,OAAO,MAAM,KAAKA,CAAC,EAAG,GAAI,IAAM,aAAe,2CAA2C,KAAK,CAAC,EAAG,OAAOgkB,GAAkBhkB,EAAGwe,CAAM,EAAI,CACha,SAASwF,GAAkB3O,EAAK3Q,EAAK,EAAMA,GAAO,MAAQA,EAAM2Q,EAAI,UAAQ3Q,EAAM2Q,EAAI,QAAQ,QAAS3V,EAAI,EAAGukB,EAAO,IAAI,MAAMvf,CAAG,EAAGhF,EAAIgF,EAAKhF,IAAOukB,EAAKvkB,CAAC,EAAI2V,EAAI3V,CAAC,EAAK,OAAOukB,CAAO,CACvL,SAAS4rF,IAAkBvqF,EAAM,CAC/B,IAAIqlB,EAAYrlB,EAAK,UACnBgI,EAAWhI,EAAK,SAChBzI,EAAUyI,EAAK,QACf6vB,EAAW7vB,EAAK,SAChB2vB,EAAiB3vB,EAAK,eACtBigC,EAAejgC,EAAK,aACpB+L,EAAO/L,EAAK,KACZwK,EAAMxK,EAAK,IACXsjB,EAAYtjB,EAAK,UACjBo4B,EAAOp4B,EAAK,KACZqY,EAAMrY,EAAK,IACXkyD,EAAKlyD,EAAK,GACVmnC,EAASnnC,EAAK,OACdsoC,EAAYtoC,EAAK,UACjB2zB,EAAQ3zB,EAAK,MACbwe,EAAUxe,EAAK,QACfu7B,EAASv7B,EAAK,OACd4zB,EAAU5zB,EAAK,QACfwkB,EAAoBxkB,EAAK,kBACzBtM,EAAMsM,EAAK,IAUb,SAASsqF,EAAYv6F,EAAK8d,EAAG28E,GAAM1rG,EAAM2rG,EAAa,CAChDA,IAAgB,SAClBA,EAAc,IAQhB,IAAI/iD,GAAIgjD,EAAQ36F,EAAK8d,EAAG28E,GAAM1rG,EAAM2rG,CAAW,EAc/CE,EAAmB56F,EAAK8d,EAAG28E,GAAM1rG,EAAM2rG,EAAa/iD,EAAC,EAIrD,IAAIkjD,GAAwBC,EAAuB96F,EAAK8d,EAAG28E,GAAM1rG,EAAM2rG,CAAW,EAChF9rG,GAASisG,GAAsB,OAC/Bj9E,GAAIi9E,GAAsB,EAQxBE,GACJ,OAAIL,IACFK,GAAUC,EAAiBh7F,EAAK8d,EAAGF,GAAG+5B,GAAG/oD,GAAQ6rG,GAAM1rG,CAAI,EAC3DgsG,GAAUtmE,EAAkB,MAAM,UAAY2G,GAAoB,SAAY2/D,EAAO,CAAC,GAEjF,CACL,OAAQnsG,GACR,QAASmsG,EACf,CACG,CASD,SAASJ,EAAQ36F,EAAK8d,EAAG28E,GAAM1rG,EAAM2rG,EAAa,CAChD,IAAIO,GAAMlsG,IAAS,YACfmsG,GAAOnsG,IAAS,UAChBosG,GAAWF,GAAM1nE,EAAU,CAAC,EAAI,EAChCrf,GAAM+mF,GAAM1nE,EAAU,CAAC,EAAI2nE,GAAOzsE,EAAQ,CAAC,EAAI,EAC/C2sE,GAAUH,GAAM1nE,EAAU,CAAC,EAAI,EAG/Bf,GAAQyoE,GAAM1nE,EAAU,EAAE,EAAI,EAC9B8nE,GAAUz7D,EAAepN,GAAOA,EAAK,EAGrC8oE,GACAZ,IACFY,GAAQ,MAAMx9E,CAAC,EAAE,KAAK5J,EAAG,GAK3B,QADI/d,GAAO,GACJ,CAACA,IAAM,CAEZA,GAAO,GACP,QAAS9L,GAAI,EAAGA,GAAIyzB,EAAGzzB,KAAK,CAK1B,QAFIkxG,EAAUJ,GACVK,GAAUL,GACLnoF,GAAI,EAAGA,GAAI8K,EAAG9K,KACrB,GAAI3oB,KAAM2oB,GACV,KAAItZ,GAAI+gB,EAAIza,EAAI3V,EAAC,EAAE2oB,EAAC,CAAC,EACrBuoF,EAAUjmE,EAAUimE,EAAS7hG,EAAC,EAC9B8hG,GAAUlmE,EAAUkmE,GAAS9hG,EAAC,EAEhC,GAAI,CAACkqC,EAAM23D,EAAS,CAAC,GAAK,CAAC33D,EAAM43D,GAAS,CAAC,EAAG,CAS5C,QAJI/qF,GAAI2qF,GACJ5uC,GAAK+uC,EACLE,GAAcvrD,EAAasrD,GAAShpE,EAAK,EACzCkpE,GAAc97D,EAAe47D,GAAShpE,EAAK,EACxCqR,EAAQ2oB,GAAIivC,EAAW,GAC5BjvC,GAAK5sB,EAAe4sB,GAAI6uC,EAAO,EAC/B5qF,GAAImvB,EAAenvB,GAAG+hB,EAAK,EAE7B,KAAOgZ,EAAOghB,GAAIkvC,EAAW,GAC3BlvC,GAAKtc,EAAasc,GAAI6uC,EAAO,EAC7B5qF,GAAIy/B,EAAaz/B,GAAG+hB,EAAK,EAK3B,IAAIihC,GAAY5vB,EAAQqM,EAAa5a,EAAUk3B,GAAIgvC,EAAO,EAAG/qF,EAAC,EAAGmvB,EAAetK,EAAUimE,EAASC,EAAO,EAAG,GAAI,CAAC,EAGlH,GAAI/nC,GAAW,CAGbt9D,GAAO,GAEP,QADIwqB,GAAIuvB,EAAa,EAAGz/B,EAAC,EAChB0gB,GAAK,EAAGA,GAAKrT,EAAGqT,KACnB9mC,KAAM8mC,KAGVnxB,EAAI3V,EAAC,EAAE8mC,EAAE,EAAIyO,EAAe5/B,EAAI3V,EAAC,EAAE8mC,EAAE,EAAG1gB,EAAC,EACzCzQ,EAAImxB,EAAE,EAAE9mC,EAAC,EAAIu1C,EAAe5/B,EAAImxB,EAAE,EAAE9mC,EAAC,EAAGs2B,EAAC,GAIvC+5E,IACFY,GAAMjxG,EAAC,EAAIu1C,EAAe07D,GAAMjxG,EAAC,EAAGomB,EAAC,EAExC,CACF,CACF,CACF,CAGD,OAAO43B,EAAKizD,EAAK,CAClB,CAUD,SAASV,EAAmB56F,EAAK8d,EAAG28E,GAAM1rG,EAAM2rG,EAAa/iD,GAAG,CAC9D,IAAIsjD,GAAMlsG,IAAS,YACfmsG,GAAOnsG,IAAS,UAChBygC,GAAOyrE,GAAM1nE,EAAU,CAAC,EAAI2nE,GAAOzsE,EAAQ,CAAC,EAAI,EAChDwsE,KACFR,GAAOlnE,EAAUknE,EAAI,GAEvB,QAASpwG,GAAI,EAAGA,GAAIyzB,EAAI,EAAGzzB,KAAK,CAK9B,QAFIsxG,GAAW,EACXv0F,GAAMooB,GACDxc,GAAI3oB,GAAI,EAAG2oB,GAAI8K,EAAG9K,KAAK,CAC9B,IAAI4oF,GAAK57F,EAAIgT,EAAC,EAAE3oB,EAAC,EACbw5C,EAAQppB,EAAIrT,EAAG,EAAGqT,EAAImhF,EAAE,CAAC,IAC3Bx0F,GAAMw0F,GACND,GAAW3oF,GAEd,CAGD,GAAI,CAAA6wB,EAAQppB,EAAIrT,EAAG,EAAGqzF,EAAI,EAG1B,IAAIkB,KAAatxG,GAAI,EAAG,CAEtB,IAAIwxG,GAAO77F,EAAI27F,EAAQ,EACvB37F,EAAI27F,EAAQ,EAAI37F,EAAI3V,GAAI,CAAC,EACzB2V,EAAI3V,GAAI,CAAC,EAAIwxG,GAGb,QAASxjD,EAAM,EAAGA,EAAMv6B,EAAGu6B,IAAO,CAChC,IAAIyjD,GAAO97F,EAAIq4C,CAAG,EAAEsjD,EAAQ,EAC5B37F,EAAIq4C,CAAG,EAAEsjD,EAAQ,EAAI37F,EAAIq4C,CAAG,EAAEhuD,GAAI,CAAC,EACnC2V,EAAIq4C,CAAG,EAAEhuD,GAAI,CAAC,EAAIyxG,EACnB,CAGD,GAAIpB,EAAa,CACf,IAAIqB,GAAOpkD,GAAEgkD,EAAQ,EACrBhkD,GAAEgkD,EAAQ,EAAIhkD,GAAEttD,GAAI,CAAC,EACrBstD,GAAEttD,GAAI,CAAC,EAAI0xG,EACZ,CACF,CAGD,QAAS7jD,GAAM7tD,GAAI,EAAG6tD,GAAMp6B,EAAGo6B,KAAO,CACpC,IAAIl1C,GAAIktC,EAAalwC,EAAIk4C,EAAG,EAAE7tD,EAAC,EAAG+c,EAAG,EACrC,GAAIpE,KAAM,EAKV,SAAS8P,GAAI,EAAGA,GAAIgL,EAAGhL,KACrB9S,EAAIk4C,EAAG,EAAEplC,EAAC,EAAImF,EAASjY,EAAIk4C,EAAG,EAAEplC,EAAC,EAAG8sB,EAAe58B,GAAGhD,EAAI3V,GAAI,CAAC,EAAEyoB,EAAC,CAAC,CAAC,EAItE,QAAS2e,GAAK,EAAGA,GAAK3T,EAAG2T,KACvBzxB,EAAIyxB,EAAE,EAAEpnC,GAAI,CAAC,EAAIirC,EAAUt1B,EAAIyxB,EAAE,EAAEpnC,GAAI,CAAC,EAAGu1C,EAAe58B,GAAGhD,EAAIyxB,EAAE,EAAEymB,EAAG,CAAC,CAAC,EAI5E,GAAIwiD,EACF,QAAS9oE,GAAM,EAAGA,GAAM9T,EAAG8T,KACzB+lB,GAAEO,EAAG,EAAEtmB,EAAG,EAAI3Z,EAAS0/B,GAAEO,EAAG,EAAEtmB,EAAG,EAAGgO,EAAe58B,GAAG20C,GAAEttD,GAAI,CAAC,EAAEunC,EAAG,CAAC,CAAC,EAGzE,EACF,CACD,OAAO+lB,EACR,CAOD,SAASmjD,EAAuBp9E,EAAGI,EAAG28E,GAAM1rG,EAAM2rG,EAAa,CAC7D,IAAIO,GAAMlsG,IAAS,YACfmsG,GAAOnsG,IAAS,UAChBmlB,GAAM+mF,GAAM1nE,EAAU,CAAC,EAAI2nE,GAAOzsE,EAAQ,CAAC,EAAI,EAC/CwsE,KACFR,GAAOlnE,EAAUknE,EAAI,GAgCvB,QApBIz6F,MAAU1P,IAAQ,OAAOotB,CAAC,EAG1Bs+E,GAAU,CAAA,EAGVh5F,GAAI8a,EAIJm+E,GAAQ,CAAA,EAGRC,GAASxB,EAAcryD,EAAK,MAAMvqB,CAAC,EAAE,KAAK5J,EAAG,CAAC,EAAI,OAGlDioF,GAAWzB,EAAcryD,EAAK,MAAMrlC,EAAC,EAAE,KAAKkR,EAAG,CAAC,EAAI,OAGpDkoF,GAAwB,EACrBA,IAAyB,KAAK,CACnCA,IAAyB,EAQzB,QAFItpF,EAAI,EAECzoB,GAAI,EAAGA,GAAI2Y,GAAG3Y,KACrB2V,GAAI3V,EAAC,EAAEA,EAAC,EAAI4tB,EAASjY,GAAI3V,EAAC,EAAEA,EAAC,EAAGyoB,CAAC,EAInC,IAAIgvE,GAAM3f,EAAGniE,EAAG,EACd8xC,GAAIgwC,GAAI,EACRnqC,GAAImqC,GAAI,EACV9hF,GAAM8/B,EAAS6X,GAAG7F,EAAC,EACnB,QAAS1iC,GAAK,EAAGA,GAAKpM,GAAGoM,KACvBpP,GAAIoP,EAAE,EAAEA,EAAE,EAAIkmB,EAAUt1B,GAAIoP,EAAE,EAAEA,EAAE,EAAG0D,CAAC,EASxC,GALI4nF,IACFyB,GAAWr8D,EAASq8D,GAAUrqD,EAAC,GAI7B9uC,KAAM,GAAK6gC,EAAQppB,EAAIza,GAAIgD,GAAI,CAAC,EAAEA,GAAI,CAAC,CAAC,EAAGy3F,EAAI,EAAG,CACpD2B,GAAwB,EACxBJ,GAAQ,KAAKh8F,GAAIgD,GAAI,CAAC,EAAEA,GAAI,CAAC,CAAC,EAG1B03F,IACFuB,GAAM,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EACnBI,EAAcF,GAAUr+E,CAAC,EACzBo+E,GAASp8D,EAASo8D,GAAQC,EAAQ,EAC9Bn5F,GAAI,IACNm5F,GAAW9zD,EAAK,MAAMrlC,GAAI,CAAC,EAAE,KAAKkR,EAAG,CAAC,IAK1ClR,IAAK,EACLhD,GAAI,IAAG,EACP,QAASwP,GAAM,EAAGA,GAAMxM,GAAGwM,KACzBxP,GAAIwP,EAAG,EAAE,KAIZ,SAAUxM,KAAM,GAAK6gC,EAAQppB,EAAIza,GAAIgD,GAAI,CAAC,EAAEA,GAAI,CAAC,CAAC,EAAGy3F,EAAI,EAAG,CAC3D2B,GAAwB,EACxB,IAAIE,GAAKC,EAAev8F,GAAIgD,GAAI,CAAC,EAAEA,GAAI,CAAC,EAAGhD,GAAIgD,GAAI,CAAC,EAAEA,GAAI,CAAC,EAAGhD,GAAIgD,GAAI,CAAC,EAAEA,GAAI,CAAC,EAAGhD,GAAIgD,GAAI,CAAC,EAAEA,GAAI,CAAC,CAAC,EAClGg5F,GAAQ,KAAK,MAAMA,MAAa5gE,GAAoB,SAAYkhE,EAAE,CAAC,EAG/D5B,IACFuB,GAAM,QAAQO,EAAcx8F,GAAIgD,GAAI,CAAC,EAAEA,GAAI,CAAC,EAAGhD,GAAIgD,GAAI,CAAC,EAAEA,GAAI,CAAC,EAAGhD,GAAIgD,GAAI,CAAC,EAAEA,GAAI,CAAC,EAAGhD,GAAIgD,GAAI,CAAC,EAAEA,GAAI,CAAC,EAAGs5F,GAAG,CAAC,EAAGA,GAAG,CAAC,EAAG7B,GAAM1rG,CAAI,CAAC,EACjIstG,EAAcF,GAAUr+E,CAAC,EACzBo+E,GAASp8D,EAASo8D,GAAQC,EAAQ,EAC9Bn5F,GAAI,IACNm5F,GAAW9zD,EAAK,MAAMrlC,GAAI,CAAC,EAAE,KAAKkR,EAAG,CAAC,IAK1ClR,IAAK,EACLhD,GAAI,IAAG,EACPA,GAAI,IAAG,EACP,QAASkxB,GAAM,EAAGA,GAAMluB,GAAGkuB,KACzBlxB,GAAIkxB,EAAG,EAAE,MACTlxB,GAAIkxB,EAAG,EAAE,KAEZ,CACD,GAAIluB,KAAM,EACR,KAEH,CAQD,GALAg5F,GAAQ,KAAK,SAAU9sG,GAAGC,GAAG,CAC3B,MAAO,CAAC8oB,EAASwC,EAAIvrB,EAAC,EAAGurB,EAAItrB,EAAC,CAAC,CACrC,CAAK,EAGGitG,GAAwB,IAAK,CAC/B,IAAI9kG,GAAM,MAAM,qEAAuE0kG,GAAQ,KAAK,IAAI,CAAC,EACzG,MAAA1kG,GAAI,OAAS0kG,GACb1kG,GAAI,QAAU,GACRA,EACP,CAID,IAAIsmB,GAAI88E,EAAc56D,EAASo8D,GAAQO,EAAUR,GAAOn+E,CAAC,CAAC,EAAI,OAC9D,MAAO,CACL,OAAQk+E,GACR,EAAGp+E,EACT,CACG,CAWD,SAASo9E,EAAiBt9E,EAAGI,EAAGF,GAAG+5B,EAAG/oD,EAAQ6rG,GAAM1rG,GAAM,CACxD,IAAI2tG,GAAOp0E,EAAI1K,EAAC,EACZqsD,GAAInqC,EAAS48D,GAAMh/E,EAAGE,EAAC,EACvBq9E,GAAMlsG,KAAS,YACfmsG,GAAOnsG,KAAS,UAChBygC,GAAOyrE,GAAM1nE,EAAU,CAAC,EAAI2nE,GAAOzsE,EAAQ,CAAC,EAAI,EAChDva,GAAM+mF,GAAM1nE,EAAU,CAAC,EAAI2nE,GAAOzsE,EAAQ,CAAC,EAAI,EAI/CkuE,GAAe,CAAA,EACfC,GAAiB,CAAA,EACjB7tF,EAAYd,GAA2Brf,CAAM,EAC/CogB,GACF,GAAI,CACF,IAAKD,EAAU,EAAC,EAAI,EAAEC,GAAQD,EAAU,EAAG,GAAE,MAAO,CAClD,IAAI8tF,GAAI7tF,GAAM,MACV0iB,GAAMorE,EAAQH,GAAcE,GAAGj5D,CAAK,EACpClS,KAAQ,IACVirE,GAAa,KAAKE,EAAC,EACnBD,GAAe,KAAK,CAAC,GAErBA,GAAelrE,EAAG,GAAK,CAE1B,CAKF,OAAQp6B,GAAK,CACZyX,EAAU,EAAEzX,EAAG,CACrB,QAAc,CACRyX,EAAU,EAAC,CACZ,CAmCD,QAlCIgsF,GAAU,CAAA,EACV1rG,GAAMstG,GAAa,OACnBxtG,GAAI,MAAM2uB,CAAC,EAAE,KAAK0R,EAAI,EACtButE,GAAI10D,EAAK,MAAMvqB,CAAC,EAAE,KAAK5J,EAAG,CAAC,EAG3B8oF,GAAgB,CAAA,EAChB34E,GAAQ,SAAeh6B,GAAG,CAC5B,IAAIwyG,GAAIF,GAAatyG,EAAC,EAClB4yG,GAAIhlF,EAASgyD,GAAGnqC,EAAS+8D,GAAGE,EAAC,CAAC,EAE9BG,EAAY3kD,EAAU0kD,GAAG9tG,EAAC,EAI9B,IAHA+tG,EAAU,MAAK,EAGRA,EAAU,OAASN,GAAevyG,EAAC,GAAG,CAC3C,IAAI8yG,GAAYC,EAAeH,GAAGn/E,EAAGo/E,EAAWzC,GAAM1rG,EAAI,EAC1D,GAAIouG,IAAa,KAAM,CAErBH,GAAc,KAAKH,EAAC,EACpB,KACD,CACDK,EAAU,KAAKC,EAAS,CACzB,CAGD,IAAIE,GAAav9D,EAASxX,EAAIqvB,CAAC,EAAG/5B,EAAC,EACnCs/E,EAAYA,EAAU,IAAI,SAAUjiF,GAAG,CACrC,OAAO6kB,EAASu9D,GAAYpiF,EAAC,CACrC,CAAO,EACD8/E,GAAQ,KAAK,MAAMA,MAAa3/D,GAAoB,SAAY8hE,EAAU,IAAI,SAAUjiF,GAAG,CACzF,OAAOzT,EAAQyT,EAAC,CACjB,CAAA,CAAC,CAAC,CACT,EACa5wB,GAAI,EAAGA,GAAIgF,GAAKhF,KACvBg6B,GAAMh6B,EAAC,EAET,GAAI2yG,GAAc,SAAW,EAAG,CAC9B,IAAI1lG,GAAM,IAAI,MAAM,8DAAgE0lG,GAAc,KAAK,IAAI,CAAC,EAC5G,MAAA1lG,GAAI,OAAS1I,EACb0I,GAAI,QAAUyjG,GACRzjG,EACP,CACD,OAAOyjG,EACR,CAMD,SAASwB,EAAertG,EAAGC,EAAGuK,GAAG8Q,EAAG,CAElC,IAAI8yF,EAAMhoE,EAAUpmC,EAAGsb,CAAC,EACpB+yF,GAAOtlF,EAAS2nB,EAAe1wC,EAAGsb,CAAC,EAAGo1B,EAAezwC,EAAGuK,EAAC,CAAC,EAC1DlM,GAAIoyC,EAAe09D,EAAK,EAAG,EAC3Bz4F,GAAI+6B,EAAe5jB,EAAK/D,EAAS2nB,EAAe09D,EAAKA,CAAG,EAAG19D,EAAe,EAAG29D,EAAI,CAAC,CAAC,EAAG,EAAG,EAC7F,MAAO,CAACjoE,EAAU9nC,GAAGqX,EAAC,EAAGoT,EAASzqB,GAAGqX,EAAC,CAAC,CACxC,CASD,SAAS23F,EAActtG,EAAGC,EAAGuK,GAAG8Q,EAAGgzF,EAAIC,GAAIhD,GAAM1rG,GAAM,CACrD,IAAIksG,GAAMlsG,KAAS,YACfmsG,GAAOnsG,KAAS,UAChBygC,GAAOyrE,GAAM1nE,EAAU,CAAC,EAAI2nE,GAAOzsE,EAAQ,CAAC,EAAI,EAChDva,GAAM+mF,GAAM1nE,EAAU,CAAC,EAAI2nE,GAAOzsE,EAAQ,CAAC,EAAI,EAInD,GAAIoV,EAAQppB,EAAI/gB,EAAC,EAAG+gG,EAAI,EACtB,MAAO,CAAC,CAACvmF,GAAKsb,EAAI,EAAG,CAACA,GAAMtb,EAAG,CAAC,EAKlC,GAAIs3B,EAAO/wB,EAAIxC,EAASulF,EAAIC,EAAE,CAAC,EAAGhD,EAAI,EACpC,MAAO,CAAC,CAACxiF,EAASulF,EAAIhzF,CAAC,EAAGyN,EAASwlF,GAAIjzF,CAAC,CAAC,EAAG,CAAC9Q,GAAGA,EAAC,CAAC,EAQpD,IAAIgkG,GAAKzlF,EAAS/oB,EAAGsuG,CAAE,EACnBG,GAAK1lF,EAAS9oB,EAAGquG,CAAE,EACnBI,GAAK3lF,EAASve,GAAG8jG,CAAE,EACnBK,EAAK5lF,EAASzN,EAAGgzF,CAAE,EACvB,OAAI35D,EAAQppB,EAAIkjF,EAAE,EAAGlD,EAAI,EAChB,CAAC,CAACiD,GAAIxpF,EAAG,EAAG,CAAC0pF,GAAIpuE,EAAI,CAAC,EAEtB,CAAC,CAACmuE,GAAInuE,EAAI,EAAG,CAACquE,EAAI3pF,EAAG,CAAC,CAEhC,CAMD,SAASmoF,EAAcr8F,EAAK8d,EAAG,CAE7B,QAASzzB,GAAI,EAAGA,GAAI2V,EAAI,OAAQ3V,KAAK,CACnC,IAAIyzG,GACHA,EAAS99F,EAAI3V,EAAC,GAAG,KAAK,MAAMyzG,KAAY1iE,GAAoB,SAAY,MAAMtd,EAAI9d,EAAI3V,EAAC,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,CAC3G,CAGD,QAASsnC,EAAM3xB,EAAI,OAAQ2xB,EAAM7T,EAAG6T,IAClC3xB,EAAI,KAAK,MAAM8d,CAAC,EAAE,KAAK,CAAC,CAAC,EACzB9d,EAAI2xB,CAAG,EAAEA,CAAG,EAAI,EAElB,OAAO3xB,CACR,CAOD,SAASy8F,EAAUz8F,EAAK8d,EAAG,CAEzB,QADIC,GAAI,CAAA,EACC1zB,EAAI,EAAGA,EAAIyzB,EAAGzzB,IACrB0zB,GAAE1zB,CAAC,EAAI,MAAMyzB,CAAC,EAAE,KAAK,CAAC,EAExB,IAAImH,EAAI,EACJ3V,GAAarB,GAA2BjO,CAAG,EAC7CuP,GACF,GAAI,CACF,IAAKD,GAAW,EAAC,EAAI,EAAEC,GAASD,GAAW,EAAG,GAAE,MAAO,CAGrD,QAFI2M,GAAM1M,GAAO,MACbvM,GAAIiZ,GAAI,OACH4V,GAAM,EAAGA,GAAM7uB,GAAG6uB,KACzB,QAAS7e,GAAI,EAAGA,GAAIhQ,GAAGgQ,KACrB+K,GAAEkH,EAAI4M,EAAG,EAAE5M,EAAIjS,EAAC,EAAIiJ,GAAI4V,EAAG,EAAE7e,EAAC,EAGlCiS,GAAKjiB,EACN,CACF,OAAQ1L,GAAK,CACZgY,GAAW,EAAEhY,EAAG,CACtB,QAAc,CACRgY,GAAW,EAAC,CACb,CACD,OAAOyO,EACR,CAUD,SAAS++E,EAAQ98F,EAAK47F,EAAIpoG,GAAI,CAC5B,QAASnJ,EAAI,EAAGA,EAAI2V,EAAI,OAAQ3V,IAC9B,GAAImJ,GAAGwM,EAAI3V,CAAC,EAAGuxG,CAAE,EACf,OAAOvxG,EAGX,MAAO,EACR,CAgBD,SAAS+yG,EAAe1/E,EAAGI,EAAGigF,GAAQtD,EAAM1rG,EAAM,CAMhD,QALIivG,GAAWjvG,IAAS,YAAcwkC,EAAU,GAAI,EAAI,IACpDpkC,GAGA9E,GAAI,EAEN8E,GAAI8uG,EAAuBngF,EAAGigF,GAAQhvG,CAAI,EAC1CI,GAAIioD,EAAO15B,EAAGvuB,EAAC,EACX,CAAAq8C,EAAOuB,EAAK59C,EAAC,EAAG6uG,EAAQ,GAG5B,GAAI,EAAE3zG,IAAK,EACT,OAAO,KAMX,IADAA,GAAI,IACS,CACX,IAAIqP,GAAI09C,EAAO15B,EAAGvuB,EAAC,EACnB,GAAI00C,EAAQkJ,EAAKmxD,EAAqB/uG,GAAG,CAACuK,EAAC,CAAC,CAAC,EAAG+gG,CAAI,EAClD,MAEF,GAAI,EAAEpwG,IAAK,GACT,OAAO,KAET8E,GAAIgvG,EAAUzkG,EAAC,CAChB,CACD,OAAOvK,EACR,CAUD,SAAS8uG,EAAuBngF,EAAGigF,EAAQhvG,GAAM,CAC/C,IAAIksG,EAAMlsG,KAAS,YACfmsG,EAAOnsG,KAAS,UAGhBksB,GAAI,MAAM6C,CAAC,EAAE,KAAK,CAAC,EAAE,IAAI,SAAUoW,GAAG,CACxC,MAAO,GAAI,KAAK,OAAM,EAAK,CACjC,CAAK,EACD,OAAI+mE,IACFhgF,GAAIA,GAAE,IAAI,SAAUjY,GAAG,CACrB,OAAOuwB,EAAUvwB,EAAC,CAC1B,CAAO,GAECk4F,IACFjgF,GAAIA,GAAE,IAAI,SAAUjY,GAAG,CACrB,OAAOyrB,EAAQzrB,EAAC,CACxB,CAAO,GAIHiY,GAAIijF,EAAqBjjF,GAAG8iF,CAAM,EAG3BI,EAAUljF,GAAGlsB,EAAI,CACzB,CAKD,SAASmvG,EAAqBjjF,EAAG8iF,EAAQ,CACvC,IAAIK,GAAanwF,GAA2B8vF,CAAM,EAChDM,EACF,GAAI,CACF,IAAKD,GAAW,EAAC,EAAI,EAAEC,EAASD,GAAW,EAAG,GAAE,MAAO,CACrD,IAAInnF,EAAIonF,EAAO,MAEfpjF,EAAIhD,EAASgD,EAAG6kB,EAASoQ,EAAavsC,EAAIsT,EAAGgE,CAAC,EAAGtX,EAAIsT,EAAGA,CAAC,CAAC,EAAGA,CAAC,CAAC,CAChE,CACF,OAAQ3f,GAAK,CACZ8mG,GAAW,EAAE9mG,EAAG,CACtB,QAAc,CACR8mG,GAAW,EAAC,CACb,CACD,OAAOnjF,CACR,CAOD,SAAS8xB,EAAK9xB,EAAG,CACf,OAAOR,EAAIuB,EAAKrY,EAAIsX,EAAGA,CAAC,CAAC,CAAC,CAC3B,CASD,SAASkjF,EAAUljF,EAAGlsB,EAAM,CAC1B,IAAIksG,GAAMlsG,IAAS,YACfmsG,EAAOnsG,IAAS,UAChBmlB,EAAM+mF,GAAM1nE,EAAU,CAAC,EAAI2nE,EAAOzsE,EAAQ,CAAC,EAAI,EACnD,OAAOqR,EAASoQ,EAAah8B,EAAK64B,EAAK9xB,CAAC,CAAC,EAAGA,CAAC,CAC9C,CACD,OAAOs/E,CACT,WChuBA,OAAO,eAAe+D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAGC,IAC9B,IAAIjuG,GAAU1F,GACd,SAAS2zG,IAAoBtuF,EAAM,CACjC,IAAIzlB,EAASylB,EAAK,OAChBqlB,EAAYrlB,EAAK,UACjBgI,EAAWhI,EAAK,SAChBwK,EAAMxK,EAAK,IACX4K,EAAO5K,EAAK,KACZmL,EAAMnL,EAAK,IACX8L,EAAM9L,EAAK,IACX2vB,EAAiB3vB,EAAK,eACtBqY,EAAMrY,EAAK,IACXsjB,EAAYtjB,EAAK,UACjB6vB,EAAW7vB,EAAK,SAChB0K,EAAM1K,EAAK,IAOb,SAASuuF,EAAKx+F,EAAK8d,EAAG,CACpB,IAAI28E,EAAO,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAIjwG,EAAO,QAClFuE,EAAO,UAAU,OAAS,EAAI,UAAU,CAAC,EAAI,OACjD,GAAIA,IAAS,SACX,OAAOs5C,EAAKroC,EAAKy6F,CAAI,EAEvB,GAAI1rG,IAAS,YACX,OAAO0vG,EAAQz+F,EAAKy6F,CAAI,EAE1B,MAAM,UAAU,0BAA4B1rG,CAAI,CACjD,CAGD,SAASs5C,EAAK76C,EAAG+V,EAAW,CAM1B,QALIua,EAAItwB,EAAE,OACNkxG,EAAK,KAAK,IAAIn7F,EAAYua,CAAC,EAC3B6gF,EACAC,EAAM,IAAI,MAAM9gF,CAAC,EAEZzzB,EAAI,EAAGA,EAAIyzB,EAAGzzB,IACrBu0G,EAAIv0G,CAAC,EAAIw0G,EAAY/gF,EAAG,CAAC,EACzB8gF,EAAIv0G,CAAC,EAAEA,CAAC,EAAI,EAId,QADIy0G,EAAMC,EAAOvxG,CAAC,EACX,KAAK,IAAIsxG,EAAI,CAAC,CAAC,GAAK,KAAK,IAAIJ,CAAE,GAAG,CACvC,IAAItvF,EAAK0vF,EAAI,CAAC,EAAE,CAAC,EACb9rF,EAAI8rF,EAAI,CAAC,EAAE,CAAC,EAChBH,EAAMK,EAASxxG,EAAE4hB,CAAE,EAAEA,CAAE,EAAG5hB,EAAEwlB,CAAC,EAAEA,CAAC,EAAGxlB,EAAE4hB,CAAE,EAAE4D,CAAC,CAAC,EAC3CxlB,EAAIusB,EAAGvsB,EAAGmxG,EAAKvvF,EAAI4D,CAAC,EACpB4rF,EAAMK,EAAKL,EAAKD,EAAKvvF,EAAI4D,CAAC,EAC1B8rF,EAAMC,EAAOvxG,CAAC,CACf,CAED,QADI0xG,EAAKL,EAAY/gF,EAAG,CAAC,EAChBtO,EAAM,EAAGA,EAAMsO,EAAGtO,IACzB0vF,EAAG1vF,CAAG,EAAIhiB,EAAEgiB,CAAG,EAAEA,CAAG,EAEtB,OAAO2vF,KAAY7uG,GAAQ,OAAO4uG,CAAE,KAAO5uG,GAAQ,OAAOsuG,CAAG,CAAC,CAC/D,CAGD,SAASH,EAAQjxG,EAAG+V,EAAW,CAM7B,QALIua,EAAItwB,EAAE,OACNkxG,EAAKjkF,EAAIlX,EAAYua,CAAC,EACtB6gF,EACAC,EAAM,IAAI,MAAM9gF,CAAC,EAEZzzB,EAAI,EAAGA,EAAIyzB,EAAGzzB,IACrBu0G,EAAIv0G,CAAC,EAAIw0G,EAAY/gF,EAAG,CAAC,EACzB8gF,EAAIv0G,CAAC,EAAEA,CAAC,EAAI,EAId,QADIy0G,EAAMM,EAAU5xG,CAAC,EACditB,EAAIqkF,EAAI,CAAC,CAAC,GAAKrkF,EAAIikF,CAAE,GAAG,CAC7B,IAAIxtE,EAAM4tE,EAAI,CAAC,EAAE,CAAC,EACd9rF,EAAI8rF,EAAI,CAAC,EAAE,CAAC,EAChBH,EAAMU,EAAY7xG,EAAE0jC,CAAG,EAAEA,CAAG,EAAG1jC,EAAEwlB,CAAC,EAAEA,CAAC,EAAGxlB,EAAE0jC,CAAG,EAAEle,CAAC,CAAC,EACjDxlB,EAAI8xG,EAAM9xG,EAAGmxG,EAAKztE,EAAKle,CAAC,EACxB4rF,EAAMW,EAAQX,EAAKD,EAAKztE,EAAKle,CAAC,EAC9B8rF,EAAMM,EAAU5xG,CAAC,CAClB,CAED,QADI0xG,EAAKL,EAAY/gF,EAAG,CAAC,EAChB4T,EAAM,EAAGA,EAAM5T,EAAG4T,IACzBwtE,EAAGxtE,CAAG,EAAIlkC,EAAEkkC,CAAG,EAAEA,CAAG,EAGtB,OAAOytE,KAAY7uG,GAAQ,OAAO4uG,CAAE,KAAO5uG,GAAQ,OAAOsuG,CAAG,CAAC,CAC/D,CAGD,SAASI,EAASQ,EAAKC,EAAKC,EAAK,CAC/B,IAAIp0B,EAAQm0B,EAAMD,EAClB,OAAI,KAAK,IAAIl0B,CAAK,GAAK9gF,EAAO,QACrB,KAAK,GAAK,EAEV,GAAM,KAAK,KAAK,EAAMk1G,GAAOD,EAAMD,EAAI,CAEjD,CAGD,SAASH,EAAYG,EAAKC,EAAKC,EAAK,CAClC,IAAIp0B,EAAQrzD,EAASwnF,EAAKD,CAAG,EAC7B,OAAI/kF,EAAI6wD,CAAK,GAAK9gF,EAAO,QAChB+oC,EAAU,EAAE,EAAE,KAAI,EAAG,IAAI,CAAC,EAE1BqM,EAAe,GAAK/kB,EAAKilB,EAAS,EAAK4/D,EAAKp3E,EAAIgjD,CAAK,CAAC,CAAC,CAAC,CAElE,CAGD,SAAS2zB,EAAKL,EAAKnyD,EAAOpiD,EAAG2oB,EAAG,CAM9B,QALI8K,EAAI8gF,EAAI,OACRllG,EAAI,KAAK,IAAI+yC,CAAK,EAClBp3C,EAAI,KAAK,IAAIo3C,CAAK,EAClBkzD,EAAMd,EAAY/gF,EAAG,CAAC,EACtB8hF,EAAMf,EAAY/gF,EAAG,CAAC,EACjBhL,EAAI,EAAGA,EAAIgL,EAAGhL,IACrB6sF,EAAI7sF,CAAC,EAAIpZ,EAAIklG,EAAI9rF,CAAC,EAAEzoB,CAAC,EAAIgL,EAAIupG,EAAI9rF,CAAC,EAAEE,CAAC,EACrC4sF,EAAI9sF,CAAC,EAAIzd,EAAIupG,EAAI9rF,CAAC,EAAEzoB,CAAC,EAAIqP,EAAIklG,EAAI9rF,CAAC,EAAEE,CAAC,EAEvC,QAASye,EAAK,EAAGA,EAAK3T,EAAG2T,IACvBmtE,EAAIntE,CAAE,EAAEpnC,CAAC,EAAIs1G,EAAIluE,CAAE,EACnBmtE,EAAIntE,CAAE,EAAEze,CAAC,EAAI4sF,EAAInuE,CAAE,EAErB,OAAOmtE,CACR,CAED,SAASW,EAAQX,EAAKnyD,EAAOpiD,EAAG2oB,EAAG,CAMjC,QALI8K,EAAI8gF,EAAI,OACRllG,EAAI0hB,EAAIqxB,CAAK,EACbp3C,EAAI0mB,EAAI0wB,CAAK,EACbkzD,EAAMd,EAAY/gF,EAAGyV,EAAU,CAAC,CAAC,EACjCqsE,EAAMf,EAAY/gF,EAAGyV,EAAU,CAAC,CAAC,EAC5BzgB,EAAI,EAAGA,EAAIgL,EAAGhL,IACrB6sF,EAAI7sF,CAAC,EAAImF,EAAS2nB,EAAelmC,EAAGklG,EAAI9rF,CAAC,EAAEzoB,CAAC,CAAC,EAAGu1C,EAAevqC,EAAGupG,EAAI9rF,CAAC,EAAEE,CAAC,CAAC,CAAC,EAC5E4sF,EAAI9sF,CAAC,EAAIwiB,EAAUsK,EAAevqC,EAAGupG,EAAI9rF,CAAC,EAAEzoB,CAAC,CAAC,EAAGu1C,EAAelmC,EAAGklG,EAAI9rF,CAAC,EAAEE,CAAC,CAAC,CAAC,EAE/E,QAAS4e,EAAM,EAAGA,EAAM9T,EAAG8T,IACzBgtE,EAAIhtE,CAAG,EAAEvnC,CAAC,EAAIs1G,EAAI/tE,CAAG,EACrBgtE,EAAIhtE,CAAG,EAAE5e,CAAC,EAAI4sF,EAAIhuE,CAAG,EAEvB,OAAOgtE,CACR,CAGD,SAASU,EAAMO,EAAKpzD,EAAOpiD,EAAG2oB,EAAG,CAc/B,QAbI8K,EAAI+hF,EAAI,OACRnmG,EAAI65B,EAAUnY,EAAIqxB,CAAK,CAAC,EACxBp3C,EAAIk+B,EAAUxX,EAAI0wB,CAAK,CAAC,EACxB0wB,EAAKv9B,EAAelmC,EAAGA,CAAC,EACxBomG,EAAKlgE,EAAevqC,EAAGA,CAAC,EACxB0qG,EAAMlB,EAAY/gF,EAAGyV,EAAU,CAAC,CAAC,EACjCysE,EAAMnB,EAAY/gF,EAAGyV,EAAU,CAAC,CAAC,EAEjC0sE,EAAQngE,EAASvM,EAAU,CAAC,EAAG75B,EAAGrE,EAAGwqG,EAAIx1G,CAAC,EAAE2oB,CAAC,CAAC,EAE9CktF,GAAM5qE,EAAUrd,EAAS2nB,EAAeu9B,EAAI0iC,EAAIx1G,CAAC,EAAEA,CAAC,CAAC,EAAG41G,CAAK,EAAGrgE,EAAekgE,EAAID,EAAI7sF,CAAC,EAAEA,CAAC,CAAC,CAAC,EAC7FmtF,EAAMxlF,EAAIilB,EAAekgE,EAAID,EAAIx1G,CAAC,EAAEA,CAAC,CAAC,EAAG41G,EAAOrgE,EAAeu9B,EAAI0iC,EAAI7sF,CAAC,EAAEA,CAAC,CAAC,CAAC,EAExEF,EAAI,EAAGA,EAAIgL,EAAGhL,IACrBitF,EAAIjtF,CAAC,EAAImF,EAAS2nB,EAAelmC,EAAGmmG,EAAIx1G,CAAC,EAAEyoB,CAAC,CAAC,EAAG8sB,EAAevqC,EAAGwqG,EAAI7sF,CAAC,EAAEF,CAAC,CAAC,CAAC,EAC5EktF,EAAIltF,CAAC,EAAIwiB,EAAUsK,EAAevqC,EAAGwqG,EAAIx1G,CAAC,EAAEyoB,CAAC,CAAC,EAAG8sB,EAAelmC,EAAGmmG,EAAI7sF,CAAC,EAAEF,CAAC,CAAC,CAAC,EAG/E+sF,EAAIx1G,CAAC,EAAEA,CAAC,EAAI61G,GACZL,EAAI7sF,CAAC,EAAEA,CAAC,EAAImtF,EACZN,EAAIx1G,CAAC,EAAE2oB,CAAC,EAAIugB,EAAU,CAAC,EACvBssE,EAAI7sF,CAAC,EAAE3oB,CAAC,EAAIkpC,EAAU,CAAC,EAEvB,QAAS6sE,GAAM,EAAGA,GAAMtiF,EAAGsiF,KACrBA,KAAQ/1G,GAAK+1G,KAAQptF,IACvB6sF,EAAIx1G,CAAC,EAAE+1G,EAAG,EAAIL,EAAIK,EAAG,EACrBP,EAAIO,EAAG,EAAE/1G,CAAC,EAAI01G,EAAIK,EAAG,EACrBP,EAAI7sF,CAAC,EAAEotF,EAAG,EAAIJ,EAAII,EAAG,EACrBP,EAAIO,EAAG,EAAEptF,CAAC,EAAIgtF,EAAII,EAAG,GAGzB,OAAOP,CACR,CAGD,SAAS9lF,EAAG8lF,EAAKpzD,EAAOpiD,EAAG2oB,EAAG,CAY5B,QAXI8K,EAAI+hF,EAAI,OACRnmG,EAAI,KAAK,IAAI+yC,CAAK,EAClBp3C,EAAI,KAAK,IAAIo3C,CAAK,EAClB0wB,EAAKzjE,EAAIA,EACTomG,EAAKzqG,EAAIA,EACT0qG,EAAMlB,EAAY/gF,EAAG,CAAC,EACtBkiF,EAAMnB,EAAY/gF,EAAG,CAAC,EAEtBoiF,EAAM/iC,EAAK0iC,EAAIx1G,CAAC,EAAEA,CAAC,EAAI,EAAIqP,EAAIrE,EAAIwqG,EAAIx1G,CAAC,EAAE2oB,CAAC,EAAI8sF,EAAKD,EAAI7sF,CAAC,EAAEA,CAAC,EAC5DmtF,GAAML,EAAKD,EAAIx1G,CAAC,EAAEA,CAAC,EAAI,EAAIqP,EAAIrE,EAAIwqG,EAAIx1G,CAAC,EAAE2oB,CAAC,EAAImqD,EAAK0iC,EAAI7sF,CAAC,EAAEA,CAAC,EAEvDF,EAAI,EAAGA,EAAIgL,EAAGhL,IACrBitF,EAAIjtF,CAAC,EAAIpZ,EAAImmG,EAAIx1G,CAAC,EAAEyoB,CAAC,EAAIzd,EAAIwqG,EAAI7sF,CAAC,EAAEF,CAAC,EACrCktF,EAAIltF,CAAC,EAAIzd,EAAIwqG,EAAIx1G,CAAC,EAAEyoB,CAAC,EAAIpZ,EAAImmG,EAAI7sF,CAAC,EAAEF,CAAC,EAGvC+sF,EAAIx1G,CAAC,EAAEA,CAAC,EAAI61G,EACZL,EAAI7sF,CAAC,EAAEA,CAAC,EAAImtF,GACZN,EAAIx1G,CAAC,EAAE2oB,CAAC,EAAI,EACZ6sF,EAAI7sF,CAAC,EAAE3oB,CAAC,EAAI,EAEZ,QAASg2G,EAAM,EAAGA,EAAMviF,EAAGuiF,IACrBA,IAAQh2G,GAAKg2G,IAAQrtF,IACvB6sF,EAAIx1G,CAAC,EAAEg2G,CAAG,EAAIN,EAAIM,CAAG,EACrBR,EAAIQ,CAAG,EAAEh2G,CAAC,EAAI01G,EAAIM,CAAG,EACrBR,EAAI7sF,CAAC,EAAEqtF,CAAG,EAAIL,EAAIK,CAAG,EACrBR,EAAIQ,CAAG,EAAErtF,CAAC,EAAIgtF,EAAIK,CAAG,GAGzB,OAAOR,CACR,CAGD,SAASd,EAAOuB,EAAK,CAInB,QAHIxiF,EAAIwiF,EAAI,OACRC,EAAS,EACTC,EAAQ,CAAC,EAAG,CAAC,EACRn2G,EAAI,EAAGA,EAAIyzB,EAAGzzB,IACrB,QAAS2oB,EAAI3oB,EAAI,EAAG2oB,EAAI8K,EAAG9K,IACrB,KAAK,IAAIutF,CAAM,EAAI,KAAK,IAAID,EAAIj2G,CAAC,EAAE2oB,CAAC,CAAC,IACvCutF,EAAS,KAAK,IAAID,EAAIj2G,CAAC,EAAE2oB,CAAC,CAAC,EAC3BwtF,EAAQ,CAACn2G,EAAG2oB,CAAC,GAInB,MAAO,CAACwtF,EAAOD,CAAM,CACtB,CAGD,SAASnB,EAAUkB,EAAK,CAItB,QAHIxiF,EAAIwiF,EAAI,OACRC,EAAS,EACTC,EAAQ,CAAC,EAAG,CAAC,EACRn2G,EAAI,EAAGA,EAAIyzB,EAAGzzB,IACrB,QAAS2oB,EAAI3oB,EAAI,EAAG2oB,EAAI8K,EAAG9K,IACrByH,EAAI8lF,CAAM,EAAI9lF,EAAI6lF,EAAIj2G,CAAC,EAAE2oB,CAAC,CAAC,IAC7ButF,EAAS9lF,EAAI6lF,EAAIj2G,CAAC,EAAE2oB,CAAC,CAAC,EACtBwtF,EAAQ,CAACn2G,EAAG2oB,CAAC,GAInB,MAAO,CAACwtF,EAAOD,CAAM,CACtB,CAGD,SAASpB,EAAQpC,EAAGE,EAAG,CAIrB,QAHIn/E,EAAIi/E,EAAE,OACNnuG,EAAS,MAAMkvB,CAAC,EAChBi9E,EAAU,MAAMj9E,CAAC,EACZhL,EAAI,EAAGA,EAAIgL,EAAGhL,IACrBioF,EAAQjoF,CAAC,EAAI,MAAMgL,CAAC,EAEtB,QAASzzB,EAAI,EAAGA,EAAIyzB,EAAGzzB,IAAK,CAG1B,QAFIo2G,EAAQ,EACRC,EAAO3D,EAAE,CAAC,EACL/pF,EAAI,EAAGA,EAAI+pF,EAAE,OAAQ/pF,IACxByH,EAAIsiF,EAAE/pF,CAAC,CAAC,EAAIyH,EAAIimF,CAAI,IACtBD,EAAQztF,EACR0tF,EAAO3D,EAAE0D,CAAK,GAGlB7xG,EAAOvE,CAAC,EAAI0yG,EAAE,OAAO0D,EAAO,CAAC,EAAE,CAAC,EAChC,QAASE,EAAM,EAAGA,EAAM7iF,EAAG6iF,IACzB5F,EAAQ4F,CAAG,EAAEt2G,CAAC,EAAI4yG,EAAE0D,CAAG,EAAEF,CAAK,EAC9BxD,EAAE0D,CAAG,EAAE,OAAOF,EAAO,CAAC,CAEzB,CACD,MAAO,CACL,OAAQ7xG,EACR,QAASmsG,CACf,CACG,CAQD,SAAS8D,EAAY37F,EAAMlU,EAAO,CAGhC,QADIkC,EAAQ,IAAI,MAAMgS,CAAI,EACjB7Y,EAAI,EAAGA,EAAI6Y,EAAM7Y,IACxB6G,EAAM7G,CAAC,EAAI2E,EAEb,OAAOkC,CACR,CACD,OAAOstG,CACT,CCtSA,OAAO,eAAe/zC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI76C,IAAWhlB,EACX0d,IAAU/a,GACVqzG,IAAe9xG,GACf+xG,IAAgBtvG,GAChB1C,GAAMyX,GACNlV,IAAO,OAGPia,IAAe,CAAC,SAAU,QAAS,SAAU,YAAa,QAAS,WAAY,MAAO,OAAQ,MAAO,MAAO,iBAAkB,eAAgB,MAAO,YAAa,WAAY,MAAO,SAAU,SAAU,UAAW,SAAU,UAAW,OAAQ,OAAQ,KAAM,SAAU,YAAa,KAAM,KAAM,UAAW,oBAAqB,KAAK,EACvUy1F,OAAgClxF,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CACxF,IAAIzlB,EAASylB,EAAK,OAChB3d,EAAQ2d,EAAK,MACbU,EAASV,EAAK,OACdqlB,EAAYrlB,EAAK,UACjBgI,EAAWhI,EAAK,SAChB2zB,EAAQ3zB,EAAK,MACbwK,EAAMxK,EAAK,IACX4K,EAAO5K,EAAK,KACZmL,EAAMnL,EAAK,IACX8L,EAAM9L,EAAK,IACX2vB,EAAiB3vB,EAAK,eACtBigC,EAAejgC,EAAK,aACpBqY,EAAMrY,EAAK,IACXsjB,EAAYtjB,EAAK,UACjB6vB,EAAW7vB,EAAK,SAChB0K,EAAM1K,EAAK,IACXu7B,EAASv7B,EAAK,OACdw3B,EAASx3B,EAAK,OACdzI,EAAUyI,EAAK,QACftO,EAASsO,EAAK,OACdwe,EAAUxe,EAAK,QACf+L,EAAO/L,EAAK,KACZo4B,EAAOp4B,EAAK,KACZkyD,EAAKlyD,EAAK,GACVmnC,EAASnnC,EAAK,OACdsoC,EAAYtoC,EAAK,UACjBwM,EAAKxM,EAAK,GACVyM,EAAKzM,EAAK,GACV4zB,EAAU5zB,EAAK,QACfwkB,EAAoBxkB,EAAK,kBACzBtM,EAAMsM,EAAK,IACT8wF,KAAqBF,IAAc,qBAAqB,CAC1D,OAAQr2G,EACR,UAAW8qC,EACX,SAAUrd,EACV,OAAQwvB,EACR,QAASjgC,EACT,MAAOo8B,EACP,IAAKnpB,EACL,KAAMI,EACN,IAAKO,EACL,IAAKW,EACL,eAAgB6jB,EAChB,IAAKtX,EACL,UAAWiL,EACX,QAAS9E,EACT,SAAUqR,EACV,IAAKnlB,CACT,CAAG,EACGqmF,KAAoBJ,IAAa,mBAAmB,CACtD,OAAQp2G,EACR,UAAW8qC,EACX,SAAUrd,EACV,SAAU6nB,EACV,eAAgBF,EAChB,QAASp4B,EACT,aAAc0oC,EACd,KAAMl0B,EACN,IAAKvB,EACL,UAAW8Y,EACX,KAAM8U,EACN,GAAI85B,EACJ,IAAK75C,EACL,OAAQ8uB,EACR,UAAWmB,EACX,MAAO3U,EACP,QAASnV,EACT,OAAQ+c,EACR,QAAS3H,EACT,kBAAmBpP,EACnB,IAAK9wB,CACT,CAAG,EAkCD,OAAOrR,EAAM,OAAQ,CACnB,MAAO,SAAe9E,EAAG,CACvB,IAAIw3B,GAAMrU,EAAOnjB,CAAC,EAClB,OAAOyzG,EAAwBj8E,EAAG,CACnC,EACD,0BAA2B,SAA8Bx3B,EAAGitG,GAAM,CAChE,IAAIz1E,GAAMrU,EAAOnjB,CAAC,EAClB,OAAOyzG,EAAwBj8E,GAAKy1E,EAAI,CACzC,EACD,OAAQ,SAAgBz1E,EAAK,CAC3B,IAAIk8E,GAAwBD,EAAwBj8E,CAAG,EACrDp2B,GAASsyG,GAAsB,OAC/BnG,GAAUmG,GAAsB,QAClC,MAAO,CACL,OAAQvwF,EAAO/hB,EAAM,EACrB,QAAS+hB,EAAOoqF,EAAO,CAC/B,CACK,EACD,2BAA4B,SAA+B/1E,EAAKy1E,GAAM,CACpE,IAAI0G,GAAyBF,EAAwBj8E,EAAKy1E,EAAI,EAC5D7rG,GAASuyG,GAAuB,OAChCpG,GAAUoG,GAAuB,QACnC,MAAO,CACL,OAAQxwF,EAAO/hB,EAAM,EACrB,QAAS+hB,EAAOoqF,EAAO,CAC/B,CACK,CACL,CAAG,EACD,SAASkG,EAAwBj8E,EAAKy1E,EAAM,CACtCA,IAAS,SACXA,EAAOjwG,EAAO,SAEhB,IAAI0Y,GAAO8hB,EAAI,OACf,GAAI9hB,GAAK,SAAW,GAAKA,GAAK,CAAC,IAAMA,GAAK,CAAC,EACzC,MAAM,IAAI,WAAW,mCAAsCoF,IAAQ,QAAQpF,EAAI,EAAI,GAAG,EAExF,IAAIlD,GAAMglB,EAAI,UACVlH,GAAI5a,GAAK,CAAC,EACd,GAAIk+F,EAAOphG,GAAK8d,GAAG28E,CAAI,IACrB4G,EAAWrhG,GAAK8d,EAAC,EACbwjF,EAAYthG,GAAK8d,GAAG28E,CAAI,GAAG,CAC7B,IAAI8G,GAAQC,GAAYx8E,EAAKhlB,GAAK8d,EAAC,EACnC,OAAOijF,EAAe/gG,GAAK8d,GAAG28E,EAAM8G,EAAK,CAC1C,CAEH,IAAIxyG,GAAOyyG,GAAYx8E,EAAKhlB,GAAK8d,EAAC,EAClC,OAAOkjF,EAAchhG,GAAK8d,GAAG28E,EAAM1rG,EAAI,CACxC,CAGD,SAASuyG,EAAYthG,EAAK8d,EAAG28E,GAAM,CACjC,QAASpwG,GAAI,EAAGA,GAAIyzB,EAAGzzB,KACrB,QAAS2oB,GAAI3oB,GAAG2oB,GAAI8K,EAAG9K,KAErB,GAAIw4B,EAAOjY,EAAU9Y,EAAIxC,EAASjY,EAAI3V,EAAC,EAAE2oB,EAAC,EAAGhT,EAAIgT,EAAC,EAAE3oB,EAAC,CAAC,CAAC,CAAC,EAAGowG,EAAI,EAC7D,MAAO,GAIb,MAAO,EACR,CAGD,SAAS2G,EAAOphG,EAAK8d,EAAG28E,GAAM,CAC5B,QAASpwG,GAAI,EAAGA,GAAIyzB,EAAGzzB,KACrB,QAAS2oB,GAAI,EAAGA,GAAI8K,EAAG9K,KAErB,GAAIw4B,EAAOjY,EAAU9Y,EAAIgC,EAAGzc,EAAI3V,EAAC,EAAE2oB,EAAC,CAAC,CAAC,CAAC,EAAGynF,EAAI,EAC5C,MAAO,GAIb,MAAO,EACR,CACD,SAAS4G,EAAWrhG,EAAK8d,EAAG,CAC1B,QAASzzB,GAAI,EAAGA,GAAIyzB,EAAGzzB,KACrB,QAAS2oB,GAAI,EAAGA,GAAI8K,EAAG9K,KACrBhT,EAAI3V,EAAC,EAAE2oB,EAAC,EAAI0J,EAAG1c,EAAI3V,EAAC,EAAE2oB,EAAC,CAAC,CAG7B,CAGD,SAASwuF,GAAYx8E,EAAKhlB,EAAK8d,GAAG,CAEhC,IAAI/uB,GAAOi2B,EAAI,WACf,GAAIj2B,KAAS,UAAYA,KAAS,aAAeA,KAAS,UACxD,OAAOA,GAKT,QAHI0yG,GAAY,GACZC,GAAS,GACTC,GAAa,GACRt3G,GAAI,EAAGA,GAAIyzB,GAAGzzB,KACrB,QAAS2oB,GAAI,EAAGA,GAAI8K,GAAG9K,KAAK,CAC1B,IAAI4oF,GAAK57F,EAAI3V,EAAC,EAAE2oB,EAAC,EACjB,MAAQnkB,GAAI,UAAU+sG,EAAE,MAAS/sG,GAAI,YAAY+sG,EAAE,EACjD6F,GAAY,cACC5yG,GAAI,aAAa+sG,EAAE,EAChC8F,GAAS,cACI7yG,GAAI,WAAW+sG,EAAE,EAC9B+F,GAAa,OAEb,OAAM,UAAU,kCAAqC9yG,GAAI,QAAQ+sG,EAAE,CAAC,CAEvE,CAKH,GAHI8F,IAAUC,IACZ,QAAQ,KAAK,wEAAwE,EAEnFA,GAAY,CACd,QAASvyF,GAAK,EAAGA,GAAK0O,GAAG1O,KACvB,QAAS+hB,GAAK,EAAGA,GAAKrT,GAAGqT,KACvBnxB,EAAIoP,EAAE,EAAE+hB,EAAE,EAAI1C,EAAQzuB,EAAIoP,EAAE,EAAE+hB,EAAE,CAAC,EAGrC,MAAO,SACR,CACD,GAAIuwE,GAAQ,CACV,QAASlyF,EAAM,EAAGA,EAAMsO,GAAGtO,IACzB,QAAS6oC,GAAM,EAAGA,GAAMv6B,GAAGu6B,KACzBr4C,EAAIwP,CAAG,EAAE6oC,EAAG,EAAI9kB,EAAUvzB,EAAIwP,CAAG,EAAE6oC,EAAG,CAAC,EAG3C,MAAO,WACR,CACD,GAAIopD,GAAW,CACb,QAASvwE,GAAM,EAAGA,GAAMpT,GAAGoT,KACzB,QAASgnB,GAAM,EAAGA,GAAMp6B,GAAGo6B,KACzBl4C,EAAIkxB,EAAG,EAAEgnB,EAAG,EAAIv2C,EAAO3B,EAAIkxB,EAAG,EAAEgnB,EAAG,CAAC,EAGxC,MAAO,QACb,KACM,OAAM,UAAU,yCAAyC,CAE5D,CACH,CAAC,EACDuS,GAAA,WAAqBq2C,cChQrB,OAAO,eAAe7uB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIpjF,IAAMjE,GACN0d,IAAU/a,GACVqiB,IAAW9gB,EACXsC,GAAO,OACPia,IAAe,CAAC,QAAS,MAAO,MAAO,WAAY,MAAO,UAAU,EACpEu2F,OAAgChyF,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACfwK,EAAMxK,EAAK,IACX0K,EAAM1K,EAAK,IACXk5B,EAAWl5B,EAAK,SAChBqY,EAAMrY,EAAK,IACX6vB,EAAW7vB,EAAK,SA0BlB,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,SAAgBssB,EAAG,CAEzB,IAAIxa,EAAOwa,EAAE,OACb,GAAIxa,EAAK,SAAW,GAAKA,EAAK,CAAC,IAAMA,EAAK,CAAC,EACzC,MAAM,IAAI,WAAW,mCAA2CoF,IAAQ,QAAQpF,CAAI,EAAI,GAAG,EAyC7F,QAvCIF,EAAIE,EAAK,CAAC,EAIVqb,EAAM,MAQNsjF,EAAUC,EAAapkF,CAAC,EAIxB9pB,EAASmuG,EAAWF,EAAStjF,CAAG,EAChC3I,EAAIhiB,EAAO,EACXof,EAAIpf,EAAO,EASXouG,EAAOliE,EAASpiB,EAAG,KAAK,IAAI,EAAG,CAAC1K,CAAC,CAAC,EAGlC8K,EAAIqrB,EAASnmC,CAAC,EACd6a,EAAIsrB,EAASnmC,CAAC,EAGdi/F,EAAS,EAGTC,EAAUF,EACVG,EAAY,GACP93G,EAAI,EAAGA,GAAKurB,EAAGvrB,IAClBA,EAAI,IACN63G,EAAUpiE,EAASoiE,EAASF,CAAI,EAChCG,EAAY,CAACA,GAEfF,EAASA,GAAUrsF,EAAIvrB,EAAI,KAAO,EAAIurB,EAAIvrB,EAAI,GAAKA,GACnDyzB,EAAInD,EAAImD,EAAGgiB,EAASmiE,EAAQC,CAAO,CAAC,EACpCrkF,EAAIlD,EAAIkD,EAAGiiB,EAASmiE,EAASE,EAAWD,CAAO,CAAC,EAKlD,QAHIvqD,EAAI7X,EAASxX,EAAIzK,CAAC,EAAGC,CAAC,EAGjB1O,EAAK,EAAGA,EAAK4D,EAAG5D,IACvBuoC,EAAI7X,EAAS6X,EAAGA,CAAC,EAEnB,SAAW9oD,IAAI,gBAAgB6uB,CAAC,EAAIA,EAAE,mBAAmBi6B,CAAC,EAAIA,CAC/D,CACL,CAAG,EACD,SAASmqD,EAAapkF,EAAG,CAGvB,QAFI1a,EAAI0a,EAAE,KAAM,EAAC,CAAC,EACdmkF,EAAU,EACLx3G,EAAI,EAAGA,EAAI2Y,EAAG3Y,IAAK,CAE1B,QADI+3G,EAAS,EACJpvF,EAAI,EAAGA,EAAIhQ,EAAGgQ,IACrBovF,GAAU3nF,EAAIiD,EAAE,IAAI,CAACrzB,EAAG2oB,CAAC,CAAC,CAAC,EAE7B6uF,EAAU,KAAK,IAAIO,EAAQP,CAAO,CACnC,CACD,OAAOA,CACR,CAOD,SAASE,EAAWF,EAAStjF,EAAK,CAEhC,QADI8jF,EAAgB,GACXvvF,EAAI,EAAGA,EAAIuvF,EAAevvF,IACjC,QAAS8C,EAAI,EAAGA,GAAK9C,EAAG8C,IAAK,CAC3B,IAAI5C,EAAIF,EAAI8C,EACZ,GAAI0sF,EAAcT,EAASjsF,EAAG5C,CAAC,EAAIuL,EACjC,MAAO,CACL,EAAG3I,EACH,EAAG5C,CACf,CAEO,CAEH,MAAM,IAAI,MAAM,kHAAkH,CACnI,CAMD,SAASsvF,EAAcT,EAASjsF,EAAG5C,EAAG,CAEpC,QADIuvF,EAAO,EACFl4G,EAAI,EAAGA,GAAKurB,EAAGvrB,IACtBk4G,GAAQl4G,EAGV,QADIm4G,EAAUD,EACL/yF,EAAMoG,EAAI,EAAGpG,GAAO,EAAIoG,EAAGpG,IAClCgzF,GAAWhzF,EAEb,IAAIizF,EAAYD,GAAW,EAAI5sF,EAAI,GACnC,MAAO,GAAM,KAAK,IAAIisF,EAAU,KAAK,IAAI,EAAG7uF,CAAC,EAAG,EAAI4C,CAAC,EAAI2sF,EAAOA,GAAQC,EAAUC,EACnF,CACH,CAAC,EACDxwB,GAAA,WAAqB2vB,cC5JrB,OAAO,eAAeruB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAI1kF,IAAMjE,GACN0d,GAAU/a,GACV6d,IAAStc,GACT8gB,IAAWre,EACXH,GAAO,QACPia,IAAe,CAAC,QAAS,MAAO,MAAO,WAAY,MAAO,OAAQ,WAAY,MAAO,OAAQ,MAAO,UAAU,EAC9Gq3F,OAAiC9yF,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MACfwK,EAAMxK,EAAK,IACX0K,EAAM1K,EAAK,IACX6vB,EAAW7vB,EAAK,SAChBnI,EAAMmI,EAAK,IACX+L,EAAO/L,EAAK,KACZgI,EAAWhI,EAAK,SAChBqY,EAAMrY,EAAK,IACX/M,EAAO+M,EAAK,KACZ7I,EAAM6I,EAAK,IACXk5B,EAAWl5B,EAAK,SACd0yF,EAAiB,IACjBC,EAAa,KAWjB,SAASC,EAAenlF,EAAG,CACzB,IAAIq3B,EACA+tD,EAAa,EACbC,EAAIrlF,EACJslF,EAAI75D,EAASjmC,EAAKwa,CAAC,CAAC,EACxB,EAAG,CACD,IAAIulF,EAAKF,EAIT,GAHAA,EAAIjjE,EAAS,GAAKnlB,EAAIsoF,EAAI36E,EAAI06E,CAAC,CAAC,CAAC,EACjCA,EAAIljE,EAAS,GAAKnlB,EAAIqoF,EAAG16E,EAAI26E,CAAE,CAAC,CAAC,EACjCluD,EAAQ3tC,EAAIqT,EAAIxC,EAAS8qF,EAAGE,CAAE,CAAC,CAAC,EAC5BluD,EAAQ6tD,GAAc,EAAEE,EAAaH,EACvC,MAAM,IAAI,MAAM,sEAAsE,CAE9F,OAAa5tD,EAAQ6tD,GACjB,OAAOG,CACR,CAuBD,OAAOzwG,EAAMlB,GAAM,CACjB,iBAAkB,SAAqBssB,EAAG,CACxC,IAAIxa,KAAWrU,IAAI,UAAU6uB,CAAC,EAAIA,EAAE,KAAM,KAAOtS,IAAO,WAAWsS,CAAC,EACpE,OAAQxa,EAAK,OAAM,CACjB,IAAK,GAEH,GAAIA,EAAK,CAAC,IAAM,EACd,OAAO4E,EAAI4V,EAAG1B,CAAI,EAElB,MAAM,IAAI,WAAW,mCAA2C1T,GAAQ,QAAQpF,CAAI,EAAI,GAAG,EAE/F,IAAK,GACH,CAEE,IAAIuhB,EAAOvhB,EAAK,CAAC,EACbomC,EAAOpmC,EAAK,CAAC,EACjB,GAAIuhB,IAAS6kB,EACX,OAAOu5D,EAAenlF,CAAC,EAEvB,MAAM,IAAI,WAAW,mCAA2CpV,GAAQ,QAAQpF,CAAI,EAAI,GAAG,CAE9F,CACH,QAEE,MAAM,IAAI,WAAW,oDAA4DoF,GAAQ,QAAQpF,CAAI,EAAI,GAAG,CAC/G,CACF,CACL,CAAG,CACH,CAAC,EACDqwE,GAAA,YAAsBmvB,cCrGtB,OAAO,eAAejvB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAI7jE,IAAWhlB,EACXwG,GAAO,YACPia,IAAe,CAAC,QAAS,QAAS,oBAAqB,SAAU,WAAY,QAAS,SAAU,YAAa,QAAS,SAAU,MAAO,WAAY,WAAY,UAAW,KAAK,EAC/K63F,OAAqCtzF,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC7F,IAAI3d,EAAQ2d,EAAK,MACf0jE,EAAQ1jE,EAAK,MACbwkB,EAAoBxkB,EAAK,kBACzBU,EAASV,EAAK,OACd6vB,EAAW7vB,EAAK,SAChBmT,EAAQnT,EAAK,MACbsrB,EAAStrB,EAAK,OACdo/B,EAAYp/B,EAAK,UACjBnZ,EAAQmZ,EAAK,MACb0+B,EAAS1+B,EAAK,OACd0K,EAAM1K,EAAK,IACXgI,EAAWhI,EAAK,SAChBk5B,EAAWl5B,EAAK,SAChB06D,EAAU16D,EAAK,QACfwK,EAAMxK,EAAK,IA8Bb,OAAO3d,EAAMlB,GAAM,CACjB,yBAA0B21F,EAC1B,wBAAyB,SAA2BrpE,EAAGC,EAAGC,EAAG,CAC3D,OAAOmpE,EAAWp2E,EAAO+M,CAAC,EAAGC,EAAGC,CAAC,CAClC,EACD,uBAAwB,SAA0BF,EAAGC,EAAGC,EAAG,CACzD,OAAOmpE,EAAWp2E,EAAO+M,CAAC,EAAG/M,EAAOgN,CAAC,EAAGC,CAAC,CAC1C,EACD,uBAAwB,SAA0BF,EAAGC,EAAGC,EAAG,CACzD,OAAOmpE,EAAWp2E,EAAO+M,CAAC,EAAGC,EAAGhN,EAAOiN,CAAC,CAAC,CAC1C,EACD,wBAAyB,SAA2BF,EAAGC,EAAGC,EAAG,CAC3D,OAAOmpE,EAAWrpE,EAAG/M,EAAOgN,CAAC,EAAGC,CAAC,CAClC,EACD,uBAAwB,SAA0BF,EAAGC,EAAGC,EAAG,CACzD,OAAOmpE,EAAWrpE,EAAG/M,EAAOgN,CAAC,EAAGhN,EAAOiN,CAAC,CAAC,CAC1C,EACD,wBAAyB,SAA2BF,EAAGC,EAAGC,EAAG,CAC3D,OAAOmpE,EAAWrpE,EAAGC,EAAGhN,EAAOiN,CAAC,CAAC,CAClC,EACD,sBAAuB,SAAyBF,EAAGC,EAAGC,EAAG,CACvD,OAAOmpE,EAAWp2E,EAAO+M,CAAC,EAAG/M,EAAOgN,CAAC,EAAGhN,EAAOiN,CAAC,CAAC,EAAE,QAAO,CAC3D,CACL,CAAG,EACD,SAASmpE,EAAWrpE,EAAGC,EAAGC,EAAG,CAkB3B,QAjBI5a,EAAI2a,EAAE,KAAM,EAAC,CAAC,EACdhK,EAAI+J,EAAE,KAAM,EAAC,CAAC,EACdylF,EAAKxvB,EAAMj2D,CAAC,EACZrP,EAAI80F,EAAG,EACPl5B,EAAIk5B,EAAG,EACPC,EAAKzvB,EAAM7zC,EAAS,GAAIniB,CAAC,CAAC,EAC1B0lF,EAAID,EAAG,EACPE,EAAIF,EAAG,EACPvlF,EAAIiiB,EAASA,EAASuP,EAAU46B,CAAC,EAAGrsD,CAAC,EAAG0lF,CAAC,EACzCxtE,EAAM1S,EAAM,EAAGzP,CAAC,EAChB9O,EAAI,CAAA,EACJ0+F,EAAK,SAAYr0G,GAAGC,GAAG,CACzB,OAAOosC,EAAOrsC,GAAGC,GAAG,CAAC,CAC3B,EACQqwC,EAAK,SAAYtwC,GAAGC,GAAG,CACzB,OAAOosC,EAAOrsC,GAAGC,GAAG,CAAC,CAC3B,EACa2jB,EAAI,EAAGA,EAAI9P,EAAG8P,IACrB,GAAIA,EAAI9P,EAAI,GAAKyX,EAAIk0B,EAAO00D,EAAGvsG,EAAMgc,EAAI,EAAGA,CAAC,CAAC,CAAC,EAAI,KAAM,CAEvD,QADI0wF,EAAMhkE,EAAGmP,EAAO9wB,EAAG/mB,EAAMg/B,EAAKhjB,CAAC,CAAC,EAAG67B,EAAO9wB,EAAG/mB,EAAMg/B,EAAKhjB,EAAI,CAAC,CAAC,CAAC,EAC1DE,EAAI,EAAGA,EAAIF,EAAGE,IACrBwwF,EAAM7oF,EAAI6oF,EAAKhkE,EAAGM,EAASj7B,EAAEmO,CAAC,EAAG27B,EAAO00D,EAAGvsG,EAAMkc,EAAGF,CAAC,CAAC,CAAC,EAAGgtB,EAASj7B,EAAEmO,CAAC,EAAG27B,EAAO00D,EAAGvsG,EAAMkc,EAAGF,EAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAEvG,IAAI2wF,EAAM3jE,EAASqJ,EAASx1B,CAAC,EAAGmsB,EAAS,GAAI6O,EAAO00D,EAAGvsG,EAAMgc,EAAGA,CAAC,CAAC,CAAC,CAAC,EAChE4wF,EAAM5jE,EAASqJ,EAASx1B,CAAC,EAAGmsB,EAAS,GAAI6O,EAAO00D,EAAGvsG,EAAMgc,EAAI,EAAGA,CAAC,CAAC,CAAC,CAAC,EACpE6wF,GAAM7jE,EAASqJ,EAASx1B,CAAC,EAAGmsB,EAAS,GAAI6O,EAAO00D,EAAGvsG,EAAMgc,EAAGA,EAAI,CAAC,CAAC,CAAC,CAAC,EACpE8wF,EAAM9jE,EAASqJ,EAASx1B,CAAC,EAAGmsB,EAAS,GAAI6O,EAAO00D,EAAGvsG,EAAMgc,EAAI,EAAGA,EAAI,CAAC,CAAC,CAAC,CAAC,EACxE+wF,EAAMrkE,EAAG+jE,EAAG5oF,EAAItM,EAAGo1F,CAAG,EAAGC,CAAG,EAAGH,EAAGI,GAAKhpF,EAAItM,EAAGu1F,CAAG,CAAC,CAAC,EACnDE,GAAOn5B,EAAQk5B,EAAKL,CAAG,EAC3B3+F,EAAEiO,CAAC,EAAIgxF,GAAK,OAAOhtG,EAAMssB,EAAM,EAAGzP,CAAC,EAAG,CAAC,CAAC,EACxC9O,EAAEiO,EAAI,CAAC,EAAIgxF,GAAK,OAAOhtG,EAAMssB,EAAMzP,EAAG,EAAIA,CAAC,EAAG,CAAC,CAAC,EAChDb,GACR,KAAa,CAEL,QADIixF,GAAOp1D,EAAO9wB,EAAG/mB,EAAMg/B,EAAKhjB,CAAC,CAAC,EACzBqe,GAAK,EAAGA,GAAKre,EAAGqe,KACvB4yE,GAAOppF,EAAIopF,GAAMjkE,EAASj7B,EAAEssB,EAAE,EAAGwd,EAAO00D,EAAGvsG,EAAMq6B,GAAIre,CAAC,CAAC,CAAC,CAAC,EAE3D,IAAIkxF,GAAOr1D,EAAO00D,EAAGvsG,EAAMgc,EAAGA,CAAC,CAAC,EAC5BmxF,GAAOhsF,EAAS5J,EAAGyxB,EAASkkE,GAAM76D,EAASx1B,CAAC,CAAC,CAAC,EAClD9O,EAAEiO,CAAC,EAAI63D,EAAQs5B,GAAMF,EAAI,CAC1B,CAEH,IAAIhB,GAAIpyF,EAAO8jB,EAAkB,MAAM,OAAQ5vB,CAAC,CAAC,EAC7Cq/F,GAAIpkE,EAASmqC,EAAGnqC,EAASijE,GAAG1zD,EAAUi0D,CAAC,CAAC,CAAC,EAC7C,OAAOY,EACR,CACH,CAAC,EACDzwB,GAAA,gBAA0ByvB,cC5H1B,OAAO,eAAevvB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAI/jE,IAAWhlB,EACXwG,GAAO,QACPia,IAAe,CAAC,QAAS,SAAU,WAAY,WAAY,KAAM,OAAQ,UAAU,EACnF84F,OAAiCv0F,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACzF,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdk5B,EAAWl5B,EAAK,SAChB6vB,EAAW7vB,EAAK,SAChBkyD,EAAKlyD,EAAK,GACV88B,EAAO98B,EAAK,KACZgI,EAAWhI,EAAK,SAuBlB,OAAO3d,EAAMlB,GAAM,CACjB,MAAO,SAAe8yG,EAAG,CACvB,IAAI53F,EAAI26E,EAAOt2E,EAAOuzF,CAAC,CAAC,EACxB,MAAO,CACL,EAAG53F,EAAE,EAAE,QAAS,EAChB,EAAGA,EAAE,EAAE,QAAS,CACxB,CACK,EACD,OAAQ,SAAgB43F,EAAG,CACzB,OAAOjd,EAAOid,CAAC,CAChB,CACL,CAAG,EACD,SAASjd,EAAOid,EAAG,CACjB,IAAIlhG,EAAIkhG,EAAE,KAAM,EAAC,CAAC,EACdxmF,EAAIwmF,EACJj6B,EAAI9gC,EAASnmC,CAAC,EACd8P,EAAI,EACJsxF,EACJ,EAAG,CACDA,EAAK1mF,EACL,IAAI2mF,EAAKliC,EAAGzkD,CAAC,EACTo0B,EAAIuyD,EAAG,EACP1sD,EAAI0sD,EAAG,EAGX,GAFA3mF,EAAIoiB,EAAS6X,EAAG7F,CAAC,EACjBm4B,EAAInqC,EAASmqC,EAAGn4B,CAAC,EACbh/B,IAAM,IACR,KAER,OAAai6B,EAAK90B,EAASyF,EAAG0mF,CAAE,CAAC,EAAI,MACjC,MAAO,CACL,EAAGn6B,EACH,EAAGvsD,CACT,CACG,CACH,CAAC,EACDi2D,GAAA,YAAsBwwB,cCxEtB,OAAO,eAAetwB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAIjkE,IAAWhlB,EACXwG,GAAO,OACPia,IAAe,CAAC,QAAS,SAAU,YAAa,WAAY,WAAW,EACvEi5F,OAAgC10F,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdwjE,EAAYxjE,EAAK,UACjB6vB,EAAW7vB,EAAK,SAChBo/B,EAAYp/B,EAAK,UA2BnB,OAAO3d,EAAMlB,GAAM,CACjB,iBAAkB,SAAsBssB,EAAGo0B,EAAG,CAC5C,OAAO2hC,EAAU/1D,EAAG2xB,EAAU3xB,CAAC,EAAGoiB,EAAS,GAAIgS,CAAC,CAAC,CAClD,EACD,gBAAiB,SAAqBp0B,EAAGo0B,EAAG,CAC1C,OAAO2hC,EAAU9iE,EAAO+M,CAAC,EAAG2xB,EAAU1+B,EAAO+M,CAAC,CAAC,EAAGoiB,EAAS,GAAIgS,CAAC,CAAC,CAClE,EACD,gBAAiB,SAAqBp0B,EAAGo0B,EAAG,CAC1C,OAAO2hC,EAAU/1D,EAAG2xB,EAAU1+B,EAAO+M,CAAC,CAAC,EAAG/M,EAAOmvB,EAAS,GAAIgS,CAAC,CAAC,CAAC,CAClE,EACD,eAAgB,SAAoBp0B,EAAGo0B,EAAG,CACxC,OAAO2hC,EAAU9iE,EAAO+M,CAAC,EAAG2xB,EAAU1+B,EAAO+M,CAAC,CAAC,EAAG/M,EAAOmvB,EAAS,GAAIgS,CAAC,CAAC,CAAC,EAAE,SAC5E,CACL,CAAG,CACH,CAAC,EACD+hC,GAAA,WAAqBywB,cCtDrB,OAAO,eAAerwF,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAIrE,IAAWhlB,EACX0F,IAAU/C,GACVuqC,IAAiBhpC,GACjBkpC,IAAgBzmC,GAChBH,IAAO,SACPia,IAAe,CAAC,QAAS,SAAU,WAAY,cAAe,eAAgB,KAAK,EACnFk5F,OAAkC30F,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CAC1F,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACd6vB,EAAW7vB,EAAK,SAChB4e,EAAc5e,EAAK,YACnBigC,EAAejgC,EAAK,aACpBqY,EAAMrY,EAAK,IACTymB,KAAoBoB,IAAe,qBAAqB,CAC1D,MAAOxlC,EACP,YAAau8B,CACjB,CAAG,EACGwI,KAAmBW,IAAc,oBAAoB,CACvD,MAAO1lC,CACX,CAAG,EAiCD,OAAOA,EAAM,YAAchC,IAAQ,QAAQ,CAGzC,iCAAkC,SAAgC9C,EAAGqX,EAAG,CAKtE,OAAOi7B,EAAStyC,EAAG86B,EAAIzjB,CAAC,CAAC,CAC1B,EACD,mBAAoB,SAAwBrX,EAAGqX,EAAG,CAChD,OAAOwyB,EAAa7pC,EAAGqX,EAAGqrC,EAAc,EAAK,CAC9C,EACD,oBAAqB,SAAyB1iD,EAAGqX,EAAG,CAClD,OAAO6xB,EAAclpC,EAAGqX,EAAGqrC,EAAc,EAAK,CAC/C,EACD,aAAc,SAAkB1iD,EAAGqX,EAAG,CAEpC,OAAOwyB,EAAa1mB,EAAOnjB,CAAC,EAAGqX,EAAGqrC,EAAc,EAAK,EAAE,SACxD,EACD,sBAAuB,SAAwB1iD,EAAGqX,EAAG,CACnD,OAAOi7B,EAAStyC,EAAG86B,EAAIzjB,CAAC,CAAC,CAC1B,CACL,EAAKqrC,EAAa,UAAU,CAAC,CAC7B,CAAC,EACDj8B,GAAA,aAAuBswF,cCjFvB,OAAO,eAAe7uB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAI7mF,IAAMjE,GACNglB,IAAWriB,EACX6D,GAAO,WACPia,IAAe,CAAC,QAAS,YAAa,WAAY,eAAgB,iBAAkB,aAAc,OAAQ,KAAK,EAC/Gm5F,OAAoC50F,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC5F,IAAI3d,EAAQ2d,EAAK,MACfqlB,EAAYrlB,EAAK,UACjBgI,EAAWhI,EAAK,SAChB2vB,EAAiB3vB,EAAK,eACtBigC,EAAejgC,EAAK,aACpB6kB,EAAa7kB,EAAK,WAClB+L,EAAO/L,EAAK,KACZwK,EAAMxK,EAAK,IAsDb,OAAO3d,EAAMlB,GAAM,CACjB,sBAAuB,SAAyB5D,EAAGqX,EAAGkR,EAAG,CAEvD,GAAIvoB,EAAE,SAAW,GAAKqX,EAAE,SAAW,GAAKkR,EAAE,SAAW,EAAG,CACtD,GAAI,CAAC0uF,EAAIj3G,CAAC,EACR,MAAM,IAAI,UAAU,gEAAgE,EAEtF,GAAI,CAACi3G,EAAI5/F,CAAC,EACR,MAAM,IAAI,UAAU,iEAAiE,EAEvF,GAAI,CAAC4/F,EAAI1uF,CAAC,EACR,MAAM,IAAI,UAAU,gEAAgE,EAEtF,IAAIpC,EAAIu8B,EAAaj4B,EAASlC,EAAE,CAAC,EAAGA,EAAE,CAAC,CAAC,EAAGkC,EAASpT,EAAE,CAAC,EAAGA,EAAE,CAAC,CAAC,CAAC,EAC3D6/F,EAAS9kE,EAAeA,EAAejsB,EAAGA,CAAC,EAAG9O,EAAE,CAAC,CAAC,EAClD8/F,EAAS7vE,EAAW8K,EAAejsB,EAAG9O,EAAE,CAAC,CAAC,CAAC,EAC3CqmE,EAAW19E,EAAE,CAAC,EAClB,OAAOo3G,EAAqBp3G,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGk3G,EAAQC,EAAQz5B,CAAQ,CACxE,KACQ,OAAM,IAAI,UAAU,8BAA8B,CAErD,EACD,yBAA0B,SAA4B19E,EAAGqX,EAAGkR,EAAG,CAC7D,GAAI,OAAO,KAAKvoB,CAAC,EAAE,SAAW,GAAK,OAAO,KAAKqX,CAAC,EAAE,SAAW,GAAK,OAAO,KAAKkR,CAAC,EAAE,SAAW,EAAG,CAC7F,GAAI,CAAC0uF,EAAIj3G,CAAC,EACR,MAAM,IAAI,UAAU,6DAA6D,EAEnF,GAAI,CAACi3G,EAAI5/F,CAAC,EACR,MAAM,IAAI,UAAU,qEAAqE,EAE3F,GAAI,CAAC4/F,EAAI1uF,CAAC,EACR,MAAM,IAAI,UAAU,qEAAqE,EAE3F,GAAI,WAAYvoB,GAAK,WAAYA,GAAK,eAAgBqX,GAAK,eAAgBA,GAAK,eAAgBkR,GAAK,eAAgBA,EAAG,CACtH,IAAIpC,EAAIu8B,EAAaj4B,EAASlC,EAAE,WAAYA,EAAE,UAAU,EAAGkC,EAASpT,EAAE,WAAYA,EAAE,UAAU,CAAC,EAC3F6/F,EAAS9kE,EAAeA,EAAejsB,EAAGA,CAAC,EAAG9O,EAAE,UAAU,EAC1D8/F,EAAS7vE,EAAW8K,EAAejsB,EAAG9O,EAAE,UAAU,CAAC,EACnDqmE,EAAW19E,EAAE,OACjB,OAAOo3G,EAAqBp3G,EAAE,OAAQA,EAAE,OAAQk3G,EAAQC,EAAQz5B,CAAQ,CAClF,KACU,OAAM,IAAI,UAAU,wBAAwB,CAEtD,KACQ,OAAM,IAAI,UAAU,8BAA8B,CAErD,EACD,eAAgB,SAAoB19E,EAAGqX,EAAG,CAExC,GAAIrX,EAAE,SAAW,GAAKqX,EAAE,SAAW,EAAG,CACpC,GAAI,CAAC4/F,EAAIj3G,CAAC,EACR,MAAM,IAAI,UAAU,gEAAgE,EAEtF,GAAI,CAACq3G,EAAIhgG,CAAC,EACR,MAAM,IAAI,UAAU,iEAAiE,EAEvF,OAAO+/F,EAAqBp3G,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGqX,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGA,EAAE,CAAC,CAAC,CAChE,SAAiBrX,EAAE,SAAW,GAAKqX,EAAE,SAAW,EAAG,CAE3C,GAAI,CAACggG,EAAIr3G,CAAC,EACR,MAAM,IAAI,UAAU,gEAAgE,EAEtF,GAAI,CAACs3G,EAAgBjgG,CAAC,EACpB,MAAM,IAAI,UAAU,iEAAiE,EAEvF,OAAOkgG,EAAqBv3G,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGqX,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGA,EAAE,CAAC,CAAC,CACxF,SAAiBrX,EAAE,SAAWqX,EAAE,QAAUrX,EAAE,OAAS,EAAG,CAEhD,GAAI,CAACw3G,EAAqBx3G,CAAC,EACzB,MAAM,IAAI,UAAU,wDAAwD,EAE9E,GAAI,CAACw3G,EAAqBngG,CAAC,EACzB,MAAM,IAAI,UAAU,wDAAwD,EAE9E,OAAOogG,EAAmBz3G,EAAGqX,CAAC,CACtC,KACQ,OAAM,IAAI,UAAU,8BAA8B,CAErD,EACD,iBAAkB,SAAsBrX,EAAGqX,EAAG,CAC5C,GAAI,OAAO,KAAKrX,CAAC,EAAE,SAAW,GAAK,OAAO,KAAKqX,CAAC,EAAE,SAAW,EAAG,CAC9D,GAAI,CAAC4/F,EAAIj3G,CAAC,EACR,MAAM,IAAI,UAAU,6DAA6D,EAEnF,GAAI,CAACq3G,EAAIhgG,CAAC,EACR,MAAM,IAAI,UAAU,+EAA+E,EAErG,GAAI,WAAYrX,GAAK,WAAYA,GAAK,eAAgBqX,GAAK,eAAgBA,GAAK,aAAcA,EAC5F,OAAO+/F,EAAqBp3G,EAAE,OAAQA,EAAE,OAAQqX,EAAE,WAAYA,EAAE,WAAYA,EAAE,QAAQ,EAEtF,MAAM,IAAI,UAAU,wBAAwB,CAE/C,SAAU,OAAO,KAAKrX,CAAC,EAAE,SAAW,GAAK,OAAO,KAAKqX,CAAC,EAAE,SAAW,EAAG,CAErE,GAAI,CAACggG,EAAIr3G,CAAC,EACR,MAAM,IAAI,UAAU,qEAAqE,EAE3F,GAAI,CAACs3G,EAAgBjgG,CAAC,EACpB,MAAM,IAAI,UAAU,kEAAkE,EAExF,GAAI,WAAYrX,GAAK,WAAYA,GAAK,OAAQqX,GAAK,OAAQA,GAAK,OAAQA,GAAK,MAAOA,GAAK,MAAOA,GAAK,MAAOA,EAC1G,OAAOkgG,EAAqBv3G,EAAE,OAAQA,EAAE,OAAQA,EAAE,OAAQqX,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,EAAGA,EAAE,EAAGA,EAAE,CAAC,EAEzF,MAAM,IAAI,UAAU,wBAAwB,CAE/C,SAAU,OAAO,KAAKrX,CAAC,EAAE,SAAW,GAAK,OAAO,KAAKqX,CAAC,EAAE,SAAW,EAAG,CAErE,GAAI,CAAC4/F,EAAIj3G,CAAC,EACR,MAAM,IAAI,UAAU,mEAAmE,EAEzF,GAAI,CAACi3G,EAAI5/F,CAAC,EACR,MAAM,IAAI,UAAU,mEAAmE,EAEzF,GAAI,cAAerX,GAAK,cAAeA,GAAK,cAAeqX,GAAK,cAAeA,EAC7E,OAAOogG,EAAmB,CAACz3G,EAAE,UAAWA,EAAE,SAAS,EAAG,CAACqX,EAAE,UAAWA,EAAE,SAAS,CAAC,EAEhF,MAAM,IAAI,UAAU,wBAAwB,CAE/C,SAAU,OAAO,KAAKrX,CAAC,EAAE,SAAW,GAAK,OAAO,KAAKqX,CAAC,EAAE,SAAW,EAAG,CAErE,GAAI,CAACggG,EAAIr3G,CAAC,EACR,MAAM,IAAI,UAAU,8EAA8E,EAEpG,GAAI,CAACq3G,EAAIhgG,CAAC,EACR,MAAM,IAAI,UAAU,8EAA8E,EAEpG,GAAI,cAAerX,GAAK,cAAeA,GAAK,cAAeA,GAAK,cAAeqX,GAAK,cAAeA,GAAK,cAAeA,EACrH,OAAOogG,EAAmB,CAACz3G,EAAE,UAAWA,EAAE,UAAWA,EAAE,SAAS,EAAG,CAACqX,EAAE,UAAWA,EAAE,UAAWA,EAAE,SAAS,CAAC,EAE1G,MAAM,IAAI,UAAU,wBAAwB,CAEtD,KACQ,OAAM,IAAI,UAAU,8BAA8B,CAErD,EACD,MAAO,SAAe7E,EAAK,CACzB,GAAI,CAACklG,EAAUllG,CAAG,EAChB,MAAM,IAAI,UAAU,kEAAkE,EAExF,OAAOmlG,EAAkBnlG,CAAG,CAC7B,CACL,CAAG,EACD,SAASolG,EAAUl2G,EAAG,CAEpB,OAAO,OAAOA,GAAM,aAAgBL,IAAI,aAAaK,CAAC,CACvD,CACD,SAASu1G,EAAIv1G,EAAG,CAEd,OAAIA,EAAE,cAAgB,QACpBA,EAAIm2G,EAAen2G,CAAC,GAEfk2G,EAAUl2G,EAAE,CAAC,CAAC,GAAKk2G,EAAUl2G,EAAE,CAAC,CAAC,CACzC,CACD,SAAS21G,EAAI31G,EAAG,CAEd,OAAIA,EAAE,cAAgB,QACpBA,EAAIm2G,EAAen2G,CAAC,GAEfk2G,EAAUl2G,EAAE,CAAC,CAAC,GAAKk2G,EAAUl2G,EAAE,CAAC,CAAC,GAAKk2G,EAAUl2G,EAAE,CAAC,CAAC,CAC5D,CACD,SAAS81G,EAAqB91G,EAAG,CAE/B,OAAK,MAAM,QAAQA,CAAC,IAClBA,EAAIm2G,EAAen2G,CAAC,GAEfA,EAAE,MAAMk2G,CAAS,CACzB,CACD,SAASN,EAAgB51G,EAAG,CAC1B,OAAIA,EAAE,cAAgB,QACpBA,EAAIm2G,EAAen2G,CAAC,GAEfk2G,EAAUl2G,EAAE,CAAC,CAAC,GAAKk2G,EAAUl2G,EAAE,CAAC,CAAC,GAAKk2G,EAAUl2G,EAAE,CAAC,CAAC,GAAKk2G,EAAUl2G,EAAE,CAAC,CAAC,GAAKk2G,EAAUl2G,EAAE,CAAC,CAAC,GAAKk2G,EAAUl2G,EAAE,CAAC,CAAC,CACrH,CACD,SAASm2G,EAAe16G,EAAG,CAGzB,QAFI6oD,EAAO,OAAO,KAAK7oD,CAAC,EACpBuE,EAAI,CAAA,EACC7E,EAAI,EAAGA,EAAImpD,EAAK,OAAQnpD,IAC/B6E,EAAE,KAAKvE,EAAE6oD,EAAKnpD,CAAC,CAAC,CAAC,EAEnB,OAAO6E,CACR,CACD,SAASg2G,EAAUh2G,EAAG,CAEpB,GAAIA,EAAE,CAAC,EAAE,SAAW,GAAKk2G,EAAUl2G,EAAE,CAAC,EAAE,CAAC,CAAC,GAAKk2G,EAAUl2G,EAAE,CAAC,EAAE,CAAC,CAAC,GAC9D,GAAIA,EAAE,KAAK,SAAUo2G,EAAI,CACvB,OAAOA,EAAG,SAAW,GAAK,CAACF,EAAUE,EAAG,CAAC,CAAC,GAAK,CAACF,EAAUE,EAAG,CAAC,CAAC,CACvE,CAAO,EACC,MAAO,WAEAp2G,EAAE,CAAC,EAAE,SAAW,GAAKk2G,EAAUl2G,EAAE,CAAC,EAAE,CAAC,CAAC,GAAKk2G,EAAUl2G,EAAE,CAAC,EAAE,CAAC,CAAC,GAAKk2G,EAAUl2G,EAAE,CAAC,EAAE,CAAC,CAAC,GAC3F,GAAIA,EAAE,KAAK,SAAUo2G,EAAI,CACvB,OAAOA,EAAG,SAAW,GAAK,CAACF,EAAUE,EAAG,CAAC,CAAC,GAAK,CAACF,EAAUE,EAAG,CAAC,CAAC,GAAK,CAACF,EAAUE,EAAG,CAAC,CAAC,CAC5F,CAAO,EACC,MAAO,OAGT,OAAO,GAET,MAAO,EACR,CACD,SAASV,EAAqBp3G,EAAGqX,EAAG3V,EAAGC,EAAGuK,EAAG,CAC3C,IAAI0b,EAAMqF,EAAI6a,EAAUA,EAAUsK,EAAe1wC,EAAG1B,CAAC,EAAGoyC,EAAezwC,EAAG0V,CAAC,CAAC,EAAGnL,CAAC,CAAC,EAC7E6rG,EAAMvpF,EAAKsZ,EAAUsK,EAAe1wC,EAAGA,CAAC,EAAG0wC,EAAezwC,EAAGA,CAAC,CAAC,CAAC,EACpE,OAAO+gD,EAAa96B,EAAKmwF,CAAG,CAC7B,CACD,SAASR,EAAqBv3G,EAAGqX,EAAGkR,EAAGyvF,EAAIC,EAAIC,EAAIx2G,EAAGC,EAAGuK,EAAG,CAC1D,IAAI0b,EAAM,CAAC6C,EAAS2nB,EAAe3nB,EAASwtF,EAAI5gG,CAAC,EAAGnL,CAAC,EAAGkmC,EAAe3nB,EAASytF,EAAI3vF,CAAC,EAAG5mB,CAAC,CAAC,EAAG8oB,EAAS2nB,EAAe3nB,EAASytF,EAAI3vF,CAAC,EAAG7mB,CAAC,EAAG0wC,EAAe3nB,EAASutF,EAAIh4G,CAAC,EAAGkM,CAAC,CAAC,EAAGue,EAAS2nB,EAAe3nB,EAASutF,EAAIh4G,CAAC,EAAG2B,CAAC,EAAGywC,EAAe3nB,EAASwtF,EAAI5gG,CAAC,EAAG3V,CAAC,CAAC,CAAC,EAC/PkmB,EAAM4G,EAAKsZ,EAAUA,EAAUsK,EAAexqB,EAAI,CAAC,EAAGA,EAAI,CAAC,CAAC,EAAGwqB,EAAexqB,EAAI,CAAC,EAAGA,EAAI,CAAC,CAAC,CAAC,EAAGwqB,EAAexqB,EAAI,CAAC,EAAGA,EAAI,CAAC,CAAC,CAAC,CAAC,EAC/H,IAAImwF,EAAMvpF,EAAKsZ,EAAUA,EAAUsK,EAAe1wC,EAAGA,CAAC,EAAG0wC,EAAezwC,EAAGA,CAAC,CAAC,EAAGywC,EAAelmC,EAAGA,CAAC,CAAC,CAAC,EACrG,OAAOw2C,EAAa96B,EAAKmwF,CAAG,CAC7B,CACD,SAASN,EAAmBz3G,EAAGqX,EAAG,CAIhC,QAHI8gG,EAAan4G,EAAE,OACfqV,EAAS,EACTkC,EAAO,EACF1a,EAAI,EAAGA,EAAIs7G,EAAYt7G,IAC9B0a,EAAOkT,EAASzqB,EAAEnD,CAAC,EAAGwa,EAAExa,CAAC,CAAC,EAC1BwY,EAASyyB,EAAUsK,EAAe76B,EAAMA,CAAI,EAAGlC,CAAM,EAEvD,OAAOmZ,EAAKnZ,CAAM,CACnB,CACD,SAASsiG,EAAkBj2G,EAAG,CAI5B,QAHI2T,EAAS,CAAA,EACT+iG,EAAS,CAAA,EACTC,EAAS,CAAA,EACJx7G,EAAI,EAAGA,EAAI6E,EAAE,OAAS,EAAG7E,IAChC,QAAS2oB,EAAI3oB,EAAI,EAAG2oB,EAAI9jB,EAAE,OAAQ8jB,IAC5B9jB,EAAE,CAAC,EAAE,SAAW,GAClB02G,EAAS,CAAC12G,EAAE7E,CAAC,EAAE,CAAC,EAAG6E,EAAE7E,CAAC,EAAE,CAAC,CAAC,EAC1Bw7G,EAAS,CAAC32G,EAAE8jB,CAAC,EAAE,CAAC,EAAG9jB,EAAE8jB,CAAC,EAAE,CAAC,CAAC,GACjB9jB,EAAE,CAAC,EAAE,SAAW,IACzB02G,EAAS,CAAC12G,EAAE7E,CAAC,EAAE,CAAC,EAAG6E,EAAE7E,CAAC,EAAE,CAAC,EAAG6E,EAAE7E,CAAC,EAAE,CAAC,CAAC,EACnCw7G,EAAS,CAAC32G,EAAE8jB,CAAC,EAAE,CAAC,EAAG9jB,EAAE8jB,CAAC,EAAE,CAAC,EAAG9jB,EAAE8jB,CAAC,EAAE,CAAC,CAAC,GAErCnQ,EAAO,KAAKoiG,EAAmBW,EAAQC,CAAM,CAAC,EAGlD,OAAOhjG,CACR,CACH,CAAC,EACD6yE,GAAA,eAAyB8uB,cCrTzB,OAAO,eAAe5uB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIhmE,IAAWhlB,EACXwG,IAAO,YACPia,IAAe,CAAC,QAAS,SAAU,MAAO,MAAO,YAAa,SAAU,WAAY,iBAAkB,eAAgB,WAAY,UAAW,cAAe,UAAW,SAAU,WAAW,EAC5Ly6F,OAAqCl2F,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CAC7F,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdwK,EAAMxK,EAAK,IACX0K,EAAM1K,EAAK,IACXqlB,EAAYrlB,EAAK,UACjBU,EAASV,EAAK,OACd6vB,EAAW7vB,EAAK,SAChB2vB,EAAiB3vB,EAAK,eACtBigC,EAAejgC,EAAK,aACpBgI,EAAWhI,EAAK,SAChB4zB,EAAU5zB,EAAK,QACf4e,EAAc5e,EAAK,YACnBzI,EAAUyI,EAAK,QACfke,EAASle,EAAK,OACd4d,EAAY5d,EAAK,UA4BnB,OAAO3d,EAAM,YAAa,CACxB,sBAAuByzG,EACvB,6BAA8BC,EAC9B,yBAA0B,SAA4Bx4G,EAAGqX,EAAGohG,EAAO,CACjE,IAAIjmG,EAAM+lG,EAAKv4G,EAAE,QAAS,EAAEqX,EAAE,UAAWohG,EAAM,QAAO,CAAE,EACxD,OAAOjmG,IAAQ,KAAO,KAAO2Q,EAAO3Q,CAAG,CACxC,EACD,iCAAkC,SAAkCiX,EAAGzpB,EAAGqX,EAAGkR,EAAG,CAE9E,IAAI/V,EAAMgmG,EAAM/uF,EAAE,QAAS,EAAEzpB,EAAE,QAAS,EAAEqX,EAAE,QAAO,EAAIkR,EAAE,QAAS,CAAA,EAClE,OAAO/V,IAAQ,KAAO,KAAO2Q,EAAO3Q,CAAG,CACxC,CACL,CAAG,EACD,SAAS+lG,EAAKv4G,EAAGqX,EAAGohG,EAAO,CAIzB,GAHAz4G,EAAI04G,EAAW14G,CAAC,EAChBqX,EAAIqhG,EAAWrhG,CAAC,EAChBohG,EAAQC,EAAWD,CAAK,EACpB,CAACpB,EAAIr3G,CAAC,EACR,MAAM,IAAI,UAAU,gEAAgE,EAEtF,GAAI,CAACq3G,EAAIhgG,CAAC,EACR,MAAM,IAAI,UAAU,iEAAiE,EAEvF,GAAI,CAACshG,EAAIF,CAAK,EACZ,MAAM,IAAI,UAAU,iDAAiD,EAEvE,OAAOG,EAAoB54G,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGqX,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGohG,EAAM,CAAC,EAAGA,EAAM,CAAC,EAAGA,EAAM,CAAC,EAAGA,EAAM,CAAC,CAAC,CACtG,CACD,SAASD,EAAM/uF,EAAGzpB,EAAGqX,EAAGkR,EAAG,CAKzB,GAJAkB,EAAIivF,EAAWjvF,CAAC,EAChBzpB,EAAI04G,EAAW14G,CAAC,EAChBqX,EAAIqhG,EAAWrhG,CAAC,EAChBkR,EAAImwF,EAAWnwF,CAAC,EACZkB,EAAE,SAAW,EAAG,CAClB,GAAI,CAACwtF,EAAIxtF,CAAC,EACR,MAAM,IAAI,UAAU,gEAAgE,EAEtF,GAAI,CAACwtF,EAAIj3G,CAAC,EACR,MAAM,IAAI,UAAU,iEAAiE,EAEvF,GAAI,CAACi3G,EAAI5/F,CAAC,EACR,MAAM,IAAI,UAAU,gEAAgE,EAEtF,GAAI,CAAC4/F,EAAI1uF,CAAC,EACR,MAAM,IAAI,UAAU,iEAAiE,EAEvF,OAAOswF,EAAapvF,EAAGzpB,EAAGqX,EAAGkR,CAAC,CACpC,SAAekB,EAAE,SAAW,EAAG,CACzB,GAAI,CAAC4tF,EAAI5tF,CAAC,EACR,MAAM,IAAI,UAAU,gEAAgE,EAEtF,GAAI,CAAC4tF,EAAIr3G,CAAC,EACR,MAAM,IAAI,UAAU,iEAAiE,EAEvF,GAAI,CAACq3G,EAAIhgG,CAAC,EACR,MAAM,IAAI,UAAU,gEAAgE,EAEtF,GAAI,CAACggG,EAAI9uF,CAAC,EACR,MAAM,IAAI,UAAU,iEAAiE,EAEvF,OAAOuwF,EAAarvF,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGzpB,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGqX,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGkR,EAAE,CAAC,EAAGA,EAAE,CAAC,EAAGA,EAAE,CAAC,CAAC,CAChG,KACM,OAAM,IAAI,UAAU,qDAAqD,CAE5E,CAGD,SAASmwF,EAAWlmG,EAAK,CAEvB,OAAIA,EAAI,SAAW,EAAUA,EAAI,CAAC,EAG9BA,EAAI,OAAS,GAAK,MAAM,QAAQA,EAAI,CAAC,CAAC,GACpCA,EAAI,MAAM,SAAU47F,EAAI,CAC1B,OAAO,MAAM,QAAQA,CAAE,GAAKA,EAAG,SAAW,CAClD,CAAO,EAAUp0F,EAAQxH,CAAG,EAEjBA,CACR,CACD,SAASykG,EAAIj3G,EAAG,CACd,OAAOA,EAAE,SAAW,GAAKqgC,EAAUrgC,EAAE,CAAC,CAAC,GAAKqgC,EAAUrgC,EAAE,CAAC,CAAC,CAC3D,CACD,SAASq3G,EAAIr3G,EAAG,CACd,OAAOA,EAAE,SAAW,GAAKqgC,EAAUrgC,EAAE,CAAC,CAAC,GAAKqgC,EAAUrgC,EAAE,CAAC,CAAC,GAAKqgC,EAAUrgC,EAAE,CAAC,CAAC,CAC9E,CACD,SAAS24G,EAAI34G,EAAG,CACd,OAAOA,EAAE,SAAW,GAAKqgC,EAAUrgC,EAAE,CAAC,CAAC,GAAKqgC,EAAUrgC,EAAE,CAAC,CAAC,GAAKqgC,EAAUrgC,EAAE,CAAC,CAAC,GAAKqgC,EAAUrgC,EAAE,CAAC,CAAC,CACjG,CACD,SAAS64G,EAAaE,EAAKC,EAAKC,EAAKC,EAAK,CACxC,IAAIC,EAAKJ,EACLK,EAAKH,EACLhwF,EAAKwB,EAAS0uF,EAAIH,CAAG,EACrB9vF,EAAKuB,EAAS2uF,EAAIF,CAAG,EACrBnwB,EAAMt+D,EAAS2nB,EAAenpB,EAAG,CAAC,EAAGC,EAAG,CAAC,CAAC,EAAGkpB,EAAelpB,EAAG,CAAC,EAAGD,EAAG,CAAC,CAAC,CAAC,EAE7E,GADI0X,EAAOooD,CAAG,GACV1yC,EAAQppB,EAAI87D,CAAG,EAAG/rF,EAAO,OAAO,EAClC,OAAO,KAET,IAAIq8G,EAASjnE,EAAelpB,EAAG,CAAC,EAAGiwF,EAAG,CAAC,CAAC,EACpCG,EAASlnE,EAAelpB,EAAG,CAAC,EAAGiwF,EAAG,CAAC,CAAC,EACpCI,EAASnnE,EAAelpB,EAAG,CAAC,EAAGkwF,EAAG,CAAC,CAAC,EACpCI,GAASpnE,EAAelpB,EAAG,CAAC,EAAGkwF,EAAG,CAAC,CAAC,EACpCj5G,EAAIuiD,EAAa5a,EAAUrd,EAASA,EAAS4uF,EAAQC,CAAM,EAAGC,CAAM,EAAGC,EAAM,EAAGzwB,CAAG,EACvF,OAAO57D,EAAImlB,EAASrpB,EAAI9oB,CAAC,EAAGg5G,CAAE,CAC/B,CACD,SAASM,EAAmB/3G,EAAGC,EAAGuK,EAAG8Q,EAAG/G,EAAGgN,EAAGkQ,EAAGJ,EAAGl2B,EAAG2oB,EAAGF,EAAG0N,EAAG,CAE9D,IAAI0mF,GAAOtnE,EAAe3nB,EAAS/oB,EAAGC,CAAC,EAAG8oB,EAASve,EAAG8Q,CAAC,CAAC,EACpD28F,EAAOvnE,EAAe3nB,EAASxU,EAAGgN,CAAC,EAAGwH,EAAS0I,EAAGJ,CAAC,CAAC,EACpD6mF,EAAOxnE,EAAe3nB,EAAS5tB,EAAG2oB,CAAC,EAAGiF,EAASnF,EAAG0N,CAAC,CAAC,EACxD,OAAO8U,EAAUA,EAAU4xE,GAAMC,CAAI,EAAGC,CAAI,CAC7C,CACD,SAASd,EAAavsF,EAAIstF,EAAIC,EAAItyF,EAAIuyF,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAI,CACpE,IAAIC,GAAQd,EAAmBltF,EAAI0tF,EAAIG,EAAIH,EAAIJ,EAAIK,EAAIG,EAAIH,EAAIJ,EAAIK,EAAIG,EAAIH,CAAE,EACzEK,EAAQf,EAAmBW,EAAIH,EAAIzyF,EAAI+E,EAAI8tF,EAAIH,EAAIH,EAAIF,EAAIS,EAAIH,EAAIH,EAAIF,CAAE,EACzEW,EAAQhB,EAAmBltF,EAAI0tF,EAAIzyF,EAAI+E,EAAIstF,EAAIK,EAAIH,EAAIF,EAAIC,EAAIK,EAAIH,EAAIF,CAAE,EACzEY,GAAQjB,EAAmBW,EAAIH,EAAIG,EAAIH,EAAII,EAAIH,EAAIG,EAAIH,EAAII,EAAIH,EAAIG,EAAIH,CAAE,EACzEQ,GAAQlB,EAAmBjyF,EAAI+E,EAAI/E,EAAI+E,EAAIwtF,EAAIF,EAAIE,EAAIF,EAAIG,EAAIF,EAAIE,EAAIF,CAAE,EACzExtF,GAAY7B,EAAS2nB,EAAemoE,GAAOC,CAAK,EAAGpoE,EAAeqoE,EAAOC,EAAK,CAAC,EAC/EhzF,GAAc+C,EAAS2nB,EAAeuoE,GAAOD,EAAK,EAAGtoE,EAAeooE,EAAOA,CAAK,CAAC,EACrF,GAAI75E,EAAOjZ,EAAW,EAAG,OAAO,KAChC,IAAIkzF,GAAKl4D,EAAap2B,GAAW5E,EAAW,EACxCmzF,GAAKn4D,EAAa5a,EAAUyyE,GAAOnoE,EAAewoE,GAAIJ,CAAK,CAAC,EAAGE,EAAK,EACpEI,GAAMhzE,EAAUvb,EAAI6lB,EAAewoE,GAAInwF,EAASjD,EAAI+E,CAAE,CAAC,CAAC,EACxDwuF,GAAMjzE,EAAU+xE,EAAIznE,EAAewoE,GAAInwF,EAASsvF,EAAIF,CAAE,CAAC,CAAC,EACxDmB,GAAMlzE,EAAUgyE,EAAI1nE,EAAewoE,GAAInwF,EAASuvF,EAAIF,CAAE,CAAC,CAAC,EACxDmB,GAAMnzE,EAAUmyE,EAAI7nE,EAAeyoE,GAAIpwF,EAAS2vF,EAAIH,CAAE,CAAC,CAAC,EACxDiB,EAAMpzE,EAAUoyE,EAAI9nE,EAAeyoE,GAAIpwF,EAAS4vF,EAAIH,CAAE,CAAC,CAAC,EACxDiB,GAAMrzE,EAAUqyE,EAAI/nE,EAAeyoE,GAAIpwF,EAAS6vF,EAAIH,CAAE,CAAC,CAAC,EAC5D,OAAI94E,EAAYy5E,GAAKG,EAAG,GAAK55E,EAAY05E,GAAKG,CAAG,GAAK75E,EAAY25E,GAAKG,EAAG,EACjE,CAACL,GAAKC,GAAKC,EAAG,EAEd,IAEV,CACD,SAASpC,EAAoBrsF,EAAIstF,EAAIC,EAAItyF,EAAIuyF,EAAIC,EAAIh6G,EAAGqX,EAAGkR,EAAGrc,EAAG,CAC/D,IAAIkvG,EAAMhpE,EAAe7lB,EAAIvsB,CAAC,EAC1Bq7G,EAAMjpE,EAAe5qB,EAAIxnB,CAAC,EAC1Bs7G,GAAMlpE,EAAeynE,EAAIxiG,CAAC,EAC1BkkG,EAAMnpE,EAAe2nE,EAAI1iG,CAAC,EAC1BmkG,EAAMppE,EAAe0nE,EAAIvxF,CAAC,EAC1BkzF,GAAMrpE,EAAe4nE,EAAIzxF,CAAC,EAC1B+D,GAAY7B,EAASA,EAASA,EAASve,EAAGkvG,CAAG,EAAGE,EAAG,EAAGE,CAAG,EACzD9zF,GAAc+C,EAASA,EAASA,EAASqd,EAAUA,EAAUuzE,EAAKE,CAAG,EAAGE,EAAG,EAAGL,CAAG,EAAGE,EAAG,EAAGE,CAAG,EAC7Fr7G,GAAIuiD,EAAap2B,GAAW5E,EAAW,EACvCH,GAAKugB,EAAUvb,EAAI6lB,EAAejyC,GAAGsqB,EAASjD,EAAI+E,CAAE,CAAC,CAAC,EACtDmvF,GAAK5zE,EAAU+xE,EAAIznE,EAAejyC,GAAGsqB,EAASsvF,EAAIF,CAAE,CAAC,CAAC,EACtD8B,GAAK7zE,EAAUgyE,EAAI1nE,EAAejyC,GAAGsqB,EAASuvF,EAAIF,CAAE,CAAC,CAAC,EAC1D,MAAO,CAACvyF,GAAIm0F,GAAIC,EAAE,CAInB,CACH,CAAC,EACDvzB,GAAA,gBAA0BkwB,cC5M1B,OAAO,eAAelsF,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAI4M,GAAc57B,GACdglB,IAAWriB,EACXilD,GAAuB1jD,GACvBsC,GAAO,MACPia,IAAe,CAAC,QAAS,SAAU,MAAO,SAAS,EACnD+9F,OAA+Bx5F,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACd0K,EAAM1K,EAAK,IACXyiC,EAAUziC,EAAK,QAyBjB,OAAO3d,EAAMlB,GAAM,CAEjB,iBAAkBgiG,EAElB,qCAAsCiW,EAEtC,MAAO,SAAWxyG,EAAM,CACtB,MAAQ2vB,GAAY,qBAAqB3vB,CAAI,EAC3C,MAAM,IAAI,UAAU,wCAAwC,EAE9D,OAAOu8F,EAAKv8F,CAAI,CACjB,CACL,CAAG,EAQD,SAASu8F,EAAKliG,EAAO,CACnB,IAAI0oB,EACJ,SAAI4M,GAAY,aAAat1B,EAAO,SAAUlC,EAAO,CACnD,GAAI,CACF4qB,EAAMA,IAAQ,OAAY5qB,EAAQ2rB,EAAIf,EAAK5qB,CAAK,CACjD,OAAQsI,EAAK,CACZ,QAAUk7C,GAAqB,qBAAqBl7C,EAAK,MAAOtI,CAAK,CACtE,CACP,CAAK,EAGG4qB,IAAQ,SACVA,EAAM84B,EAAQ,EAAGloD,EAAO,MAAM,GAE5B,OAAOovB,GAAQ,WACjBA,EAAM84B,EAAQ94B,EAAKpvB,EAAO,MAAM,GAE3BovB,CACR,CACD,SAASyvF,EAASn4G,EAAOwX,EAAK,CAC5B,GAAI,CACF,IAAIkR,KAAU4M,GAAY,QAAQt1B,EAAOwX,EAAKiS,CAAG,EACjD,OAAOf,CACR,OAAQtiB,EAAK,CACZ,QAAUk7C,GAAqB,qBAAqBl7C,EAAK,KAAK,CAC/D,CACF,CACH,CAAC,EACDsiB,GAAA,UAAoBwvF,cCtFpB,OAAO,eAAeltB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAI11D,IAAc57B,GACdglB,IAAWriB,EACXo4B,IAAW72B,GACX0jD,GAAuBjhD,GACvB6Z,IAAS9E,GACTkC,IAAcsH,GACd1e,GAAO,SACPia,IAAe,CAAC,QAAS,MAAO,WAAW,EAC3Ci+F,OAAkC15F,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC1F,IAAI3d,EAAQ2d,EAAK,MACf0K,EAAM1K,EAAK,IACX+kB,EAAY/kB,EAAK,UA2BnB,OAAO3d,EAAMlB,GAAM,CAEjB,MAAO8hG,EACP,OAAQ,SAAgBviF,EAAQ,CAC9B,OAAOA,EAAO,OAAOuiF,EAAQviF,EAAO,QAAS,CAAA,CAAC,CAC/C,EAED,4BAA6B44F,EAC7B,6BAA8B,SAA+B54F,EAAQjI,EAAK,CACxE,OAAOiI,EAAO,OAAO44F,EAAY54F,EAAO,QAAS,EAAEjI,CAAG,CAAC,CACxD,EAED,MAAO,SAAW7R,EAAM,CACtB,MAAQ2vB,IAAY,qBAAqB3vB,CAAI,EAC3C,MAAM,IAAI,UAAU,qDAAqD,EAE3E,OAAOq8F,EAAQr8F,CAAI,CACpB,CACL,CAAG,EAQD,SAASq8F,EAAQhiG,EAAO,CACtB,GAAI,CACF,OAAOs4G,EAAWt4G,CAAK,CACxB,OAAQoG,EAAK,CACZ,QAAUk7C,GAAqB,qBAAqBl7C,EAAKlG,EAAI,CAC9D,CACF,CACD,SAASo4G,EAAWt4G,EAAO,CACzB,GAAIA,EAAM,SAAW,EACnB,MAAO,GAGT,QADIu4G,EAAO,CAACz0E,EAAU9jC,EAAM,CAAC,CAAC,CAAC,EACtB7G,EAAI,EAAGA,EAAI6G,EAAM,OAAQ,EAAE7G,EAIlCo/G,EAAK,KAAK9uF,EAAI8uF,EAAKp/G,EAAI,CAAC,EAAG6G,EAAM7G,CAAC,CAAC,CAAC,EAEtC,OAAOo/G,CACR,CACD,SAASF,EAAYr4G,EAAOwX,EAAK,CAC/B,IAAIxF,KAAWkI,IAAO,WAAWla,CAAK,EACtC,GAAIwX,EAAM,GAAKA,GAAOxF,EAAK,OAEzB,MAAM,IAAIsF,IAAY,WAAWE,EAAKxF,EAAK,MAAM,EAEnD,GAAI,CACF,OAAOwmG,EAAmBx4G,EAAOwX,CAAG,CACrC,OAAQpR,EAAK,CACZ,QAAUk7C,GAAqB,qBAAqBl7C,EAAKlG,EAAI,CAC9D,CACF,CAGD,SAASs4G,EAAmB1kF,EAAKtc,EAAK,CACpC,IAAIre,EAAG86B,EAAKW,EACZ,GAAIpd,GAAO,EAAG,CACZ,IAAIihG,EAAe3kF,EAAI,CAAC,EAAE,CAAC,EAC3B,GAAK,MAAM,QAAQ2kF,CAAY,EAExB,CAGL,IAFA7jF,KAAWH,IAAS,SAASX,CAAG,EAChCG,EAAM,CAAA,EACD96B,EAAI,EAAGA,EAAIy7B,EAAK,OAAQz7B,IAC3B86B,EAAI96B,CAAC,EAAIq/G,EAAmB5jF,EAAKz7B,CAAC,EAAGqe,EAAM,CAAC,EAE9C,OAAOyc,CACR,KARC,QAAOqkF,EAAWxkF,CAAG,CAS7B,KAAW,CAEL,IADAG,EAAM,CAAA,EACD96B,EAAI,EAAGA,EAAI26B,EAAI,OAAQ36B,IAC1B86B,EAAI96B,CAAC,EAAIq/G,EAAmB1kF,EAAI36B,CAAC,EAAGqe,EAAM,CAAC,EAE7C,OAAOyc,CACR,CACF,CACH,CAAC,EACD+2D,GAAA,aAAuBotB,cC7HvB,OAAO,eAAe/tB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI/0D,GAAc57B,GACdwgB,IAAS7d,GACTqiB,IAAW9gB,EACX0jD,GAAuBjhD,GACvBH,GAAO,OACPia,IAAe,CAAC,QAAS,MAAO,QAAQ,EACxCu+F,OAAgCh6F,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACxF,IAAI3d,EAAQ2d,EAAK,MACf0K,EAAM1K,EAAK,IACXgE,EAAShE,EAAK,OA4BhB,OAAO3d,EAAMlB,GAAM,CAEjB,iBAAkBmhG,EAElB,qCAAsCsX,EAEtC,MAAO,SAAWhzG,EAAM,CACtB,MAAQ2vB,GAAY,qBAAqB3vB,CAAI,EAC3C,MAAM,IAAI,UAAU,yCAAyC,EAE/D,OAAO07F,EAAM17F,CAAI,CAClB,CACL,CAAG,EAUD,SAASgzG,EAAU34G,EAAOwX,EAAK,CAC7B,GAAI,CACF,IAAIkR,KAAU4M,GAAY,QAAQt1B,EAAOwX,EAAKiS,CAAG,EAC7CtlB,EAAI,MAAM,QAAQnE,CAAK,KAAQka,IAAO,WAAWla,CAAK,EAAIA,EAAM,KAAI,EACxE,OAAO+iB,EAAO2F,EAAKvkB,EAAEqT,CAAG,CAAC,CAC1B,OAAQpR,EAAK,CACZ,QAAUk7C,GAAqB,qBAAqBl7C,EAAK,MAAM,CAChE,CACF,CAQD,SAASi7F,EAAMrhG,EAAO,CACpB,IAAI0oB,EACAxE,EAAM,EASV,MARIoR,GAAY,aAAat1B,EAAO,SAAUlC,EAAO,CACnD,GAAI,CACF4qB,EAAMA,IAAQ,OAAY5qB,EAAQ2rB,EAAIf,EAAK5qB,CAAK,EAChDomB,GACD,OAAQ9d,EAAK,CACZ,QAAUk7C,GAAqB,qBAAqBl7C,EAAK,OAAQtI,CAAK,CACvE,CACP,CAAK,EACGomB,IAAQ,EACV,MAAM,IAAI,MAAM,6CAA6C,EAE/D,OAAOnB,EAAO2F,EAAKxE,CAAG,CACvB,CACH,CAAC,EACDmmE,GAAA,WAAqBquB,cChGrB,OAAO,eAAenuB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAIj1D,IAAc57B,GACdwgB,IAAS7d,GACTqiB,IAAW9gB,EACX0jD,IAAuBjhD,GACvBH,GAAO,SACPia,IAAe,CAAC,QAAS,MAAO,SAAU,UAAW,iBAAiB,EACtEy+F,OAAkCl6F,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC1F,IAAI3d,EAAQ2d,EAAK,MACf0K,EAAM1K,EAAK,IACXgE,EAAShE,EAAK,OACd6H,EAAU7H,EAAK,QACf+rC,EAAkB/rC,EAAK,gBAOzB,SAASwiF,EAAQvhG,EAAO,CACtB,GAAI,CACFA,KAAYka,IAAO,SAASla,EAAM,QAAO,CAAE,EAC3C,IAAIkkB,EAAMlkB,EAAM,OAChB,GAAIkkB,IAAQ,EACV,MAAM,IAAI,MAAM,2CAA2C,EAE7D,GAAIA,EAAM,IAAM,EAAG,CAOjB,QALI20F,EAAM30F,EAAM,EAAI,EAChB40F,EAAQhuD,EAAgB9qD,EAAO64G,EAAM,CAAC,EAGtCE,EAAO/4G,EAAM64G,CAAG,EACX1/G,EAAI,EAAGA,EAAI0/G,EAAK,EAAE1/G,EACrBytB,EAAQ5mB,EAAM7G,CAAC,EAAG4/G,CAAI,EAAI,IAC5BA,EAAO/4G,EAAM7G,CAAC,GAGlB,OAAO6/G,EAAQD,EAAMD,CAAK,CAClC,KAAa,CAEL,IAAI,EAAIhuD,EAAgB9qD,GAAQkkB,EAAM,GAAK,CAAC,EAC5C,OAAO+0F,EAAO,CAAC,CAChB,CACF,OAAQ7yG,EAAK,CACZ,QAAUk7C,IAAqB,qBAAqBl7C,EAAK,QAAQ,CAClE,CACF,CAGD,IAAI6yG,EAAS73G,EAAM,CACjB,sCAAuC,SAAoCtD,EAAO,CAChF,OAAOA,CACR,CACL,CAAG,EAGGk7G,EAAU53G,EAAM,CAClB,2EAA4E,SAA8D23G,EAAMD,EAAO,CACrJ,OAAO/1F,EAAO0G,EAAIsvF,EAAMD,CAAK,EAAG,CAAC,CAClC,CACL,CAAG,EA4BD,OAAO13G,EAAMlB,GAAM,CAEjB,iBAAkBqhG,EAElB,qCAAsC,SAAoCvhG,EAAOwX,EAAK,CAEpF,MAAM,IAAI,MAAM,qCAAqC,CAEtD,EAGD,MAAO,SAAW7R,EAAM,CACtB,MAAQ2vB,IAAY,qBAAqB3vB,CAAI,EAC3C,MAAM,IAAI,UAAU,2CAA2C,EAEjE,OAAO47F,EAAQ57F,CAAI,CACpB,CACL,CAAG,CACH,CAAC,EACD4kF,GAAA,aAAuBquB,cC/GvB,OAAO,eAAe1uB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIhwE,IAASxgB,GACTglB,IAAWriB,EACXilD,IAAuB1jD,GACvBsC,GAAO,MACPia,IAAe,CAAC,QAAS,MAAO,MAAO,SAAU,UAAU,EAC3D++F,OAA+Bx6F,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MACfwK,EAAMxK,EAAK,IACXnI,EAAMmI,EAAK,IACXwrE,EAASxrE,EAAK,OACdgI,EAAWhI,EAAK,SAyBlB,OAAO3d,EAAMlB,GAAM,CAEjB,iBAAkBghG,EAElB,MAAO,SAAWv7F,EAAM,CACtB,OAAOu7F,EAAKv7F,CAAI,CACjB,CACL,CAAG,EACD,SAASu7F,EAAKlhG,EAAO,CAEnB,GADAA,KAAYka,IAAO,SAASla,EAAM,QAAS,CAAA,EACvCA,EAAM,SAAW,EACnB,MAAM,IAAI,MAAM,oEAAoE,EAEtF,GAAI,CACF,IAAIm5G,EAAM5uB,EAAOvqF,CAAK,EACtB,OAAOuqF,EAAO3zE,EAAI5W,EAAO,SAAUlC,EAAO,CACxC,OAAOyrB,EAAIxC,EAASjpB,EAAOq7G,CAAG,CAAC,CAChC,CAAA,CAAC,CACH,OAAQ/yG,EAAK,CACZ,MAAIA,aAAe,WAAaA,EAAI,QAAQ,QAAQ,QAAQ,IAAM,GAC1D,IAAI,UAAUA,EAAI,QAAQ,QAAQ,SAAU,KAAK,CAAC,KAE9Ck7C,IAAqB,qBAAqBl7C,EAAK,KAAK,CAEjE,CACF,CACH,CAAC,EACD8jF,GAAA,UAAoBgvB,cClEpB,OAAO,eAAe/tB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAI71D,GAAc57B,GACdiE,IAAMtB,GACNqiB,IAAW9gB,EACX0jD,GAAuBjhD,GACvB+4G,GAAwB,WACxBl5G,GAAO,WACPia,IAAe,CAAC,QAAS,MAAO,WAAY,WAAY,SAAU,QAAS,OAAO,EAClFk/F,OAAoC36F,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC5F,IAAI3d,EAAQ2d,EAAK,MACf0K,EAAM1K,EAAK,IACXgI,EAAWhI,EAAK,SAChB6vB,EAAW7vB,EAAK,SAChBgE,EAAShE,EAAK,OACdklB,EAAQllB,EAAK,MACbiiC,EAAQjiC,EAAK,MAsDf,OAAO3d,EAAMlB,GAAM,CAEjB,iBAAkB,SAAqBF,EAAO,CAC5C,OAAOs5G,EAAKt5G,EAAOo5G,EAAqB,CACzC,EAED,yBAA0BE,EAE1B,qCAAsC,SAAoCt5G,EAAOwX,EAAK,CACpF,OAAO+hG,EAAQv5G,EAAOwX,EAAK4hG,EAAqB,CACjD,EAED,6CAA8CG,EAE9C,MAAO,SAAW5zG,EAAM,CACtB,OAAO2zG,EAAK3zG,EAAMyzG,EAAqB,CACxC,CACL,CAAG,EAaD,SAASE,EAAKt5G,EAAOw5G,EAAe,CAClC,IAAI9wF,EACAxE,EAAM,EACV,GAAIlkB,EAAM,SAAW,EACnB,MAAM,IAAI,YAAY,gEAAgE,EAYxF,MARIs1B,GAAY,aAAat1B,EAAO,SAAUlC,EAAO,CACnD,GAAI,CACF4qB,EAAMA,IAAQ,OAAY5qB,EAAQ2rB,EAAIf,EAAK5qB,CAAK,EAChDomB,GACD,OAAQ9d,EAAK,CACZ,QAAUk7C,GAAqB,qBAAqBl7C,EAAK,WAAYtI,CAAK,CAC3E,CACP,CAAK,EACGomB,IAAQ,EAAG,MAAM,IAAI,MAAM,6CAA6C,EAC5E,IAAImmE,EAAOtnE,EAAO2F,EAAKxE,CAAG,EAQ1B,GALAwE,EAAM,UACF4M,GAAY,aAAat1B,EAAO,SAAUlC,EAAO,CACnD,IAAI+V,EAAOkT,EAASjpB,EAAOusF,CAAI,EAC/B3hE,EAAMA,IAAQ,OAAYkmB,EAAS/6B,EAAMA,CAAI,EAAI4V,EAAIf,EAAKkmB,EAAS/6B,EAAMA,CAAI,CAAC,CACpF,CAAK,EACGmtC,EAAMt4B,CAAG,EACX,OAAOA,EAET,OAAQ8wF,EAAa,CACnB,IAAK,cACH,OAAOz2F,EAAO2F,EAAKxE,CAAG,EACxB,IAAK,SACH,OAAOnB,EAAO2F,EAAKxE,EAAM,CAAC,EAC5B,IAAK,WACH,CACE,IAAIoa,KAAW3gC,IAAI,aAAa+qB,CAAG,EAAIA,EAAI,IAAI,CAAC,EAAI,EACpD,OAAOxE,IAAQ,EAAIoa,EAAOvb,EAAO2F,EAAKxE,EAAM,CAAC,CAC9C,CACH,QACE,MAAM,IAAI,MAAM,0BAA4Bs1F,EAAgB,6DAAkE,CACjI,CACF,CACD,SAASD,EAAQv5G,EAAOwX,EAAKgiG,EAAe,CAC1C,GAAI,CACF,GAAIx5G,EAAM,SAAW,EACnB,MAAM,IAAI,YAAY,gEAAgE,EAExF,OAAOikC,EAAMjkC,EAAOwX,EAAK,SAAUlb,EAAG,CACpC,OAAOg9G,EAAKh9G,EAAGk9G,CAAa,CACpC,CAAO,CACF,OAAQpzG,EAAK,CACZ,QAAUk7C,GAAqB,qBAAqBl7C,EAAK,UAAU,CACpE,CACF,CACH,CAAC,EACD+kF,GAAA,eAAyBkuB,cC7JzB,OAAO,eAAezuB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIjtF,GAAMjE,GACN6a,IAAUlY,GACV6d,IAAStc,GACT8gB,IAAWre,EACXH,IAAO,cACPia,IAAe,CAAC,QAAS,MAAO,WAAY,kBAAmB,SAAS,EACxEs/F,OAAuC/6F,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CAC/F,IAAI3d,EAAQ2d,EAAK,MACf0K,EAAM1K,EAAK,IACX6vB,EAAW7vB,EAAK,SAChB+rC,EAAkB/rC,EAAK,gBACvB6H,EAAU7H,EAAK,QAmCjB,SAAS6rE,EAAYl8D,EAAMgrF,EAAS9+F,EAAQ,CAC1C,IAAI++F,EAASC,EAAS52F,EACtB,GAAI,UAAU,OAAS,GAAK,UAAU,OAAS,EAC7C,MAAM,IAAI,YAAY,uDAAuD,EAE/E,MAAQrlB,GAAI,cAAc+wB,CAAI,EAAG,CAE/B,GADA9T,EAASA,GAAU,GACf,OAAOA,GAAW,UAAW,CAE/B,GADAg/F,EAAUlrF,EAAK,aACP/wB,GAAI,UAAU+7G,CAAO,EAAG,CAC9B,GAAIA,EAAU,EACZ,MAAM,IAAI,MAAM,6BAA6B,EAE/C,GAAIA,GAAW,EAEb,OAAO9X,EAAagY,EAASF,EAAS9+F,CAAM,EAE9C,GAAI8+F,EAAU,EAAG,CAEf,GAAI,IAAKnlG,IAAQ,WAAWmlG,CAAO,EACjC,MAAM,IAAI,MAAM,8BAA8B,EAEhD,IAAIG,EAAWH,EAAU,EACzBC,EAAU,IAAI,MAAMD,CAAO,EAC3B,QAASvgH,EAAI,EAAGA,EAAIugH,GAClBC,EAAQxgH,CAAC,EAAIyoG,EAAagY,EAAS,EAAEzgH,EAAI0gH,EAAUj/F,CAAM,EAE3D,OAAO++F,CACR,CACF,CACD,MAAQh8G,GAAI,aAAa+7G,CAAO,EAAG,CACjC,IAAI16F,EAAY06F,EAAQ,YACxB,GAAIA,EAAQ,aACV,MAAM,IAAI,MAAM,6BAA6B,EAG/C,GADA12F,EAAM,IAAIhE,EAAU,CAAC,EACjB06F,EAAQ,IAAI12F,CAAG,EAEjB,OAAO,IAAIhE,EAAU4iF,EAAagY,EAASF,EAAS9+F,CAAM,CAAC,EAE7D,GAAI8+F,EAAQ,GAAG12F,CAAG,EAAG,CAEnB,GAAI,CAAC02F,EAAQ,YACX,MAAM,IAAI,MAAM,8BAA8B,EAKhD,IAAII,EAAOJ,EAAQ,WACnB,GAAII,EAAO,WACT,MAAM,IAAI,MAAM,mFAAmF,EAErG,IAAIC,EAAY,IAAI/6F,EAAU86F,EAAO,CAAC,EACtCH,EAAU,IAAI,MAAMG,CAAI,EACxB,QAAS57F,EAAK,EAAGA,EAAK47F,GACpBH,EAAQz7F,CAAE,EAAI,IAAIc,EAAU4iF,EAAagY,EAAS,IAAI56F,EAAU,EAAEd,CAAE,EAAE,IAAI67F,CAAS,EAAGn/F,CAAM,CAAC,EAE/F,OAAO++F,CACR,CACF,CACD,MAAQh8G,GAAI,cAAc+7G,CAAO,EAAG,CAElC,IAAIM,EAAaN,EAAQ,UACzBC,EAAU,IAAI,MAAMK,EAAW,MAAM,EACrC,QAAS17F,EAAM,EAAGA,EAAMq7F,EAAQ,OAAQ,EAAEr7F,EAAK,CAC7C,IAAI27F,EAAWD,EAAW17F,CAAG,EAC7B,MAAQ3gB,GAAI,UAAUs8G,CAAQ,GAC5B,GAAIA,EAAW,GAAKA,EAAW,EAC7B,MAAM,IAAI,MAAM,gDAAgD,aAErDt8G,GAAI,aAAas8G,CAAQ,GAEtC,GADAj3F,EAAM,IAAIi3F,EAAS,YAAY,CAAC,EAC5BA,EAAS,WAAY,GAAIA,EAAS,GAAGj3F,CAAG,EAC1C,MAAM,IAAI,MAAM,gDAAgD,MAGlE,OAAM,IAAI,UAAU,qDAAqD,EAG3E22F,EAAQr7F,CAAG,EAAIsjF,EAAagY,EAASK,EAAUr/F,CAAM,CACtD,CACD,OAAO++F,CACR,CACD,MAAM,IAAI,UAAU,qDAAqD,CAC1E,CAED,MAAM,IAAI,UAAU,qDAAqD,CAC1E,CAED,MAAM,IAAI,UAAU,qDAAqD,CAC1E,CAWD,SAAS/X,EAAa5hG,EAAOk6G,EAAMt/F,EAAQ,CACzC,IAAIrB,KAAWW,IAAO,SAASla,CAAK,EAChC7B,EAAMob,EAAK,OACf,GAAIpb,IAAQ,EACV,MAAM,IAAI,MAAM,gDAAgD,EAElE,MAAQR,GAAI,UAAUu8G,CAAI,EAAG,CAC3B,IAAIz9E,EAASy9E,GAAQ/7G,EAAM,GACvBg8G,EAAY19E,EAAS,EACzB,GAAI09E,IAAc,EAAG,CACnB,IAAIr8G,EAAQ8c,EAASrB,EAAKkjB,CAAM,EAAIquB,EAAgBvxC,EAAMkjB,CAAM,EAChE,OAAAvlB,EAASpZ,CAAK,EACPA,CACR,CACD,IAAIs8G,EAAe,KAAK,MAAM39E,CAAM,EAChC49E,EACAC,EACJ,GAAI1/F,EACFy/F,EAAQ9gG,EAAK6gG,CAAY,EACzBE,EAAS/gG,EAAK6gG,EAAe,CAAC,MACzB,CACLE,EAASxvD,EAAgBvxC,EAAM6gG,EAAe,CAAC,EAG/CC,EAAQ9gG,EAAK6gG,CAAY,EACzB,QAASjhH,EAAI,EAAGA,EAAIihH,EAAc,EAAEjhH,EAC9BytB,EAAQrN,EAAKpgB,CAAC,EAAGkhH,CAAK,EAAI,IAC5BA,EAAQ9gG,EAAKpgB,CAAC,EAGnB,CACD,OAAA+d,EAASmjG,CAAK,EACdnjG,EAASojG,CAAM,EAGR7wF,EAAImlB,EAASyrE,EAAO,EAAIF,CAAS,EAAGvrE,EAAS0rE,EAAQH,CAAS,CAAC,CACvE,CAGD,IAAIv0G,EAAQs0G,EAAK,MAAM/7G,EAAM,CAAC,EAC9B,GAAIyH,EAAM,YAAa,CACrBA,EAAQA,EAAM,WACd,IAAInH,EAASmc,EAASrB,EAAK3T,CAAK,EAAIklD,EAAgBvxC,EAAM3T,CAAK,EAC/D,OAAAsR,EAASzY,CAAM,EACRA,CACR,CACD,IAAI8iC,EAAc37B,EAAM,QACpB20G,EAAW30G,EAAM,MAAM27B,CAAW,EAClCi5E,EAAoBj5E,EAAY,WAChCw3E,EACAD,EACJ,GAAIl+F,EACFm+F,EAAOx/F,EAAKihG,CAAiB,EAC7B1B,EAAQv/F,EAAKihG,EAAoB,CAAC,MAC7B,CACL1B,EAAQhuD,EAAgBvxC,EAAMihG,EAAoB,CAAC,EAGnDzB,EAAOx/F,EAAKihG,CAAiB,EAC7B,QAASx6E,EAAM,EAAGA,EAAMw6E,EAAmB,EAAEx6E,EACvCpZ,EAAQrN,EAAKymB,CAAG,EAAG+4E,CAAI,EAAI,IAC7BA,EAAOx/F,EAAKymB,CAAG,EAGpB,CACD9oB,EAAS6hG,CAAI,EACb7hG,EAAS4hG,CAAK,EAGd,IAAI91F,EAAM,IAAIu3F,EAAS,YAAY,CAAC,EACpC,OAAO9wF,EAAImlB,EAASmqE,EAAM/1F,EAAI,MAAMu3F,CAAQ,CAAC,EAAG3rE,EAASkqE,EAAOyB,CAAQ,CAAC,CAC1E,CAQD,IAAIrjG,EAAW9V,EAAM,CACnB,4BAA6B,SAA6B9E,EAAG,CAC3D,OAAOA,CACR,CACL,CAAG,EACD,OAAOsuF,CACT,CAAC,EACDA,GAAA,kBAA4B6uB,cC7O5B,OAAO,eAAe3uB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAG,OACpB,IAAIpsE,IAAWhlB,EACXiE,IAAMtB,GACN6D,GAAO,MACPia,IAAe,CAAC,QAAS,MAAO,OAAQ,UAAU,EAClDsgG,OAA+B/7F,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACvF,IAAI3d,EAAQ2d,EAAK,MACfnI,EAAMmI,EAAK,IACX+L,EAAO/L,EAAK,KACZosE,EAAWpsE,EAAK,SAqDlB,OAAO3d,EAAMlB,GAAM,CAEjB,iBAAkB4hG,EAElB,yBAA0BA,EAE1B,qCAAsCA,EAEtC,6CAA8CA,EAE9C,MAAO,SAAWn8F,EAAM,CACtB,OAAOm8F,EAAKn8F,CAAI,CACjB,CACL,CAAG,EACD,SAASm8F,EAAK9hG,EAAOw5G,EAAe,CAClC,GAAIx5G,EAAM,SAAW,EACnB,MAAM,IAAI,YAAY,2DAA2D,EAEnF,GAAI,CACF,IAAI+pB,EAAIohE,EAAS,MAAM,KAAM,SAAS,EACtC,SAAQxtF,IAAI,cAAcosB,CAAC,EAClBnT,EAAImT,EAAGe,CAAI,EAEXA,EAAKf,CAAC,CAEhB,OAAQ3jB,EAAK,CACZ,MAAIA,aAAe,WAAaA,EAAI,QAAQ,QAAQ,WAAW,IAAM,GAC7D,IAAI,UAAUA,EAAI,QAAQ,QAAQ,YAAa,MAAM,CAAC,EAEtDA,CAET,CACF,CACH,CAAC,EACD0kF,GAAA,UAAoB2vB,cCnGpB,OAAO,eAAexiF,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIvZ,IAAWhlB,EACXuiC,IAAgB5/B,GAChB6D,GAAO,eACPia,IAAe,CAAC,OAAO,EACvBugG,OAAwCh8F,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAChG,IAAI3d,EAAQ2d,EAAK,MAwBjB,OAAO3d,EAAMlB,GAAM,CACjB,iBAAkB+7B,IAAc,mBAChC,uBAAwB,SAA4BnqB,EAAG8P,EAAG,CACxD,IAAI5C,EAAYlN,EAAE,YACdH,EAAQxY,EACRi/B,EAAUtmB,EAAE,MAAM8P,CAAC,EACnBoB,EAAM,IAAIhE,EAAU,CAAC,EACzB,GAAI,CAAC27F,GAAkB7oG,CAAC,GAAK,CAAC6oG,GAAkB/4F,CAAC,EAC/C,MAAM,IAAI,UAAU,0DAA0D,EAEhF,GAAIA,EAAE,GAAG9P,CAAC,EACR,MAAM,IAAI,UAAU,gDAAgD,EAGtE,GADAH,EAASqR,EACLpB,EAAE,GAAGwW,CAAO,EACd,IAAKj/B,EAAI6pB,EAAK7pB,EAAE,IAAIi/B,CAAO,EAAGj/B,EAAIA,EAAE,KAAK6pB,CAAG,EAC1CrR,EAASA,EAAO,MAAMiQ,EAAE,KAAKzoB,CAAC,CAAC,EAAE,UAAUA,CAAC,MAG9C,KAAKA,EAAI6pB,EAAK7pB,EAAE,IAAIyoB,CAAC,EAAGzoB,EAAIA,EAAE,KAAK6pB,CAAG,EACpCrR,EAASA,EAAO,MAAMymB,EAAQ,KAAKj/B,CAAC,CAAC,EAAE,UAAUA,CAAC,EAGtD,OAAOwY,CACR,CAGL,CAAG,CACH,CAAC,EAOyBsmB,GAAA,mBAAGyiF,IAC7B,SAASC,GAAkB7oG,EAAG,CAC5B,OAAOA,EAAE,UAAW,GAAIA,EAAE,IAAI,CAAC,CACjC,WCvEA,OAAO,eAAe21E,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgCA,GAAA,0BAAG,OACpC,IAAI/oE,IAAWhlB,EACX6a,GAAUlY,GACV87B,GAAWv6B,GACXsC,GAAO,sBACPia,IAAe,CAAC,OAAO,EACvBygG,OAA+Cl8F,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACvG,IAAI3d,EAAQ2d,EAAK,MAwBjB,OAAO3d,EAAMlB,GAAM,CACjB,iBAAkB,SAAsB4R,EAAG8P,EAAG,CAC5C,GAAI,IAAKrN,GAAQ,WAAWzC,CAAC,GAAKA,EAAI,EACpC,MAAM,IAAI,UAAU,iEAAiE,EAEvF,GAAI,IAAKyC,GAAQ,WAAWqN,CAAC,GAAKA,EAAI,EACpC,MAAM,IAAI,UAAU,iEAAiE,EAEvF,GAAI9P,EAAI,EACN,MAAM,IAAI,UAAU,2CAA2C,EAEjE,GAAI8P,EAAI9P,EAAI,EAAG,CACb,IAAI+oG,KAAiB1iF,GAAS,SAASrmB,EAAGA,EAAI8P,EAAI,CAAC,EACnD,OAAOi5F,KAAiB1iF,GAAS,SAAS,EAAGvW,CAAC,CAC/C,CACD,IAAIk5F,KAAgB3iF,GAAS,SAASvW,EAAI,EAAG9P,EAAI8P,EAAI,CAAC,EACtD,OAAOk5F,KAAgB3iF,GAAS,SAAS,EAAGrmB,EAAI,CAAC,CAClD,EACD,uBAAwB,SAA4BA,EAAG8P,EAAG,CACxD,IAAI5C,EAAYlN,EAAE,YACdH,EAAQxY,EACR6pB,EAAM,IAAIhE,EAAU,CAAC,EACrB+7F,EAAYjpG,EAAE,MAAMkR,CAAG,EAC3B,GAAI,CAAC23F,GAAkB7oG,CAAC,GAAK,CAAC6oG,GAAkB/4F,CAAC,EAC/C,MAAM,IAAI,UAAU,iEAAiE,EAEvF,GAAI9P,EAAE,GAAGkR,CAAG,EACV,MAAM,IAAI,UAAU,2EAA2E,EAGjG,GADArR,EAASqR,EACLpB,EAAE,GAAGm5F,CAAS,EAChB,IAAK5hH,EAAI6pB,EAAK7pB,EAAE,IAAI4hH,CAAS,EAAG5hH,EAAIA,EAAE,KAAK6pB,CAAG,EAC5CrR,EAASA,EAAO,MAAMiQ,EAAE,KAAKzoB,CAAC,CAAC,EAAE,UAAUA,CAAC,MAG9C,KAAKA,EAAI6pB,EAAK7pB,EAAE,IAAIyoB,CAAC,EAAGzoB,EAAIA,EAAE,KAAK6pB,CAAG,EACpCrR,EAASA,EAAO,MAAMopG,EAAU,KAAK5hH,CAAC,CAAC,EAAE,UAAUA,CAAC,EAGxD,OAAOwY,CACR,CACL,CAAG,CACH,CAAC,EAOgC81E,GAAA,0BAAGmzB,IACpC,SAASD,GAAkB7oG,EAAG,CAC5B,OAAOA,EAAE,UAAW,GAAIA,EAAE,IAAI,CAAC,CACjC,WCtFA,OAAO,eAAe+1E,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkBA,GAAA,YAAG,OACtB,IAAInpE,IAAWhlB,EACX+iC,GAASpgC,GACT6D,GAAO,QACPia,IAAe,CAAC,QAAS,SAAU,iBAAkB,MAAO,YAAa,SAAS,EAClF6gG,OAAiCt8F,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACrF,IAAA3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACGA,EAAK,eAChBA,EAAK,IACf,IAAIuyB,EAAavyB,EAAK,UAClBE,EAAUF,EAAK,QA0BjB,SAASk8F,EAAanpG,EAAG,CACvB,GAAIA,EAAE,KAAO,EACX,SAAW2qB,GAAO,aAAa3qB,EAAE,EAAE,EAKrC,GAAIA,EAAE,GAAK,GAAK,CAMd,IAAIopG,EAAK,IAAIj8F,EAAQ,EAAInN,EAAE,GAAI,CAACA,EAAE,EAAE,EAChCsJ,EAAI,IAAI6D,EAAQ,KAAK,GAAKnN,EAAE,GAAI,KAAK,GAAKA,EAAE,EAAE,EAClD,OAAO,IAAImN,EAAQ,KAAK,EAAE,EAAE,IAAI7D,EAAE,IAAG,CAAE,EAAE,IAAI6/F,EAAaC,CAAE,CAAC,CAC9D,CAIDppG,EAAI,IAAImN,EAAQnN,EAAE,GAAK,EAAGA,EAAE,EAAE,EAK9B,QAFIxV,EAAI,IAAI2iB,EAAQwd,GAAO,OAAO,CAAC,EAAG,CAAC,EAE9BtjC,EAAI,EAAGA,EAAIsjC,GAAO,OAAO,OAAQ,EAAEtjC,EAAG,CAE7C,IAAIgiH,EAAY,IAAIl8F,EAAQwd,GAAO,OAAOtjC,CAAC,EAAG,CAAC,EAC/CmD,EAAIA,EAAE,IAAI6+G,EAAU,IAAIrpG,EAAE,IAAI3Y,CAAC,CAAC,CAAC,CAClC,CAED,IAAIsD,EAAI,IAAIwiB,EAAQnN,EAAE,GAAK2qB,GAAO,OAAS,GAAK3qB,EAAE,EAAE,EAGhDspG,EAAY,KAAK,KAAK,EAAI,KAAK,EAAE,EACjCC,EAAO5+G,EAAE,IAAIqV,EAAE,IAAI,EAAG,CAAC,EACvBwpG,EAAO7+G,EAAE,IAAK,EAAC,IAAG,EAGtB,OAAOH,EAAE,IAAI8+G,CAAS,EAAE,IAAIC,CAAI,EAAE,IAAIC,CAAI,CAC3C,CACD,OAAOl6G,EAAMlB,GAAM,CACjB,OAAQu8B,GAAO,YACf,QAASw+E,EACT,UAAW,SAAmBnpG,EAAG,CAC/B,GAAIA,EAAE,YACJ,OAAOA,EAAE,WAAU,GAAMA,EAAE,OAAQ,EAAG,IAAIw/B,EAAW,GAAQ,EAAIiqE,EAAazpG,EAAE,MAAM,CAAC,CAAC,EAE1F,GAAI,CAACA,EAAE,WACL,OAAO,IAAIw/B,EAAWx/B,EAAE,WAAU,EAAK,IAAM,GAAQ,EAEvD,MAAM,IAAI,MAAM,4BAA4B,CAC7C,CACL,CAAG,EAOD,SAASypG,EAAazpG,EAAG,CACvB,GAAIA,EAAI,EACN,OAAO,IAAIw/B,EAAW,CAAC,EAAG,EAAG,EAAG,EAAG,GAAI,IAAK,IAAK,IAAI,EAAEx/B,CAAC,CAAC,EAE3D,IAAIO,EAAY/Y,EAAO,WAAa,KAAK,IAAIwY,EAAE,SAAQ,CAAE,EAAI,GACzD8/B,EAAMN,EAAW,MAAM,CACzB,UAAWj/B,CACjB,CAAK,EACD,GAAIP,EAAI,IAAM,EACZ,OAAOA,EAAE,MAAMypG,EAAa,IAAIjqE,EAAWx/B,EAAI,CAAC,CAAC,CAAC,EAKpD,QAHIhO,EAAIgO,EACJqV,EAAO,IAAIyqB,EAAI9/B,CAAC,EAChB4W,EAAM5W,EAAE,WACLhO,EAAI,GACTA,GAAK,EACL4kB,GAAO5kB,EACPqjB,EAAOA,EAAK,MAAMuB,CAAG,EAEvB,OAAO,IAAI4oB,EAAWnqB,EAAK,YAAYmqB,EAAW,SAAS,CAAC,CAC7D,CACH,CAAC,EACDu2C,GAAA,YAAsBmzB,cC1HtB,OAAO,eAAejzB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAG,OACvB,IAAItrD,GAAS/iC,GACTglB,IAAWriB,EACXkY,IAAU3W,GAQVsC,GAAO,SACPia,IAAe,CAAC,UAAW,OAAO,EAClCqhG,OAAkC98F,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC1F,IAAIE,EAAUF,EAAK,QACjB3d,EAAQ2d,EAAK,MAMX08F,EAAW,EACXC,EAAW,EAYXxhC,EAAS,CAAC,qBAA0B,mBAA0B,sBAA2B,qBAA0B,sBAA0B,qBAA0B,qBAA2B,kBAAwB,EAwB9N,OAAO94E,EAAMlB,GAAM,CACjB,OAAQu8B,GAAO,aACf,QAASk/E,EACT,UAAW,UAAqB,CAC9B,MAAM,IAAI,MAAM,oFAAoF,CACrG,CACL,CAAG,EACD,SAASA,EAAc7pG,EAAG,CACxB,IAAI8pG,EAAQ,kBACRC,EAAQ,mBAERC,EAAa,GACjB,GAAIhqG,EAAE,QACJ,OAAO,IAAImN,EAAQ,IAAK,GAAG,EACtB,GAAInN,EAAE,KAAO,EAClB,OAAO,IAAImN,KAAYwd,GAAO,cAAc3qB,EAAE,EAAE,EAAG,CAAC,EAC/C,GAAIA,EAAE,IAAM2pG,GAAY,KAAK,IAAI3pG,EAAE,EAAE,GAAK4pG,EAC/C,OAAOK,EAAejqG,CAAC,EAClB,GAAIA,EAAE,IAAMgqG,EAAY,CAE7B,IAAI5nF,KAAU3f,IAAQ,UAAUqnG,EAAO9pG,EAAE,EAAE,EAAI,KAAK,MAAM,GAAMA,EAAE,GAAK,GAAI,EACvE9T,EAAI8T,EAAE,IAAI,KAAK,EAAE,EAAE,MAAM,MACzB7T,EAAI09G,EAAc,IAAI18F,EAAQ,EAAInN,EAAE,GAAI,CAACA,EAAE,EAAE,CAAC,EAClD,OAAO,IAAImN,EAAQ48F,EAAO3nF,CAAG,EAAE,IAAIl2B,CAAC,EAAE,IAAIC,CAAC,CACjD,KAAW,QAAI6T,EAAE,IAAM,EACVkqG,EAAiBlqG,CAAC,EAElBkqG,EAAiBlqG,EAAE,UAAS,CAAE,EAAE,UAAS,CAEnD,CACD,SAASiqG,EAAel3F,EAAG,CAmBzB,QAVIo3F,EAAWp3F,EAAE,IAAI,EAAG,EAAE,IAAIA,EAAE,IAAG,CAAE,EAAE,IAAIA,CAAC,EAAE,IAAI4X,GAAO,SAAS,EAI9Dy/E,EAAK,IAAIj9F,EAAQ,EAAG,CAAC,EAAE,IAAI4F,CAAC,EAC5Bs3F,EAAMD,EAAG,IAAIr3F,CAAC,EACd7mB,EAAIk8E,EAAO,CAAC,EACZj8E,EAAIi8E,EAAO,CAAC,EACZ9+D,EAAI,EAAI+gG,EAAI,GACZh4G,EAAIg4G,EAAI,GAAKA,EAAI,GAAKA,EAAI,GAAKA,EAAI,GAC9BhjH,EAAI,EAAGA,EAAI,EAAGA,IAAK,CAC1B,IAAI+6B,EAAMj2B,EACVA,EAAI,CAACkG,EAAInG,EAAIk8E,EAAO/gF,CAAC,EACrB6E,EAAIod,EAAIpd,EAAIk2B,CACb,CACD,IAAIkoF,EAAYF,EAAG,IAAIC,EAAI,IAAIn+G,CAAC,EAAE,IAAIC,CAAC,CAAC,EAIxC,OAAOg+G,EAAS,IAAIG,CAAS,CAC9B,CACD,SAASJ,EAAiBn3F,EAAG,CAI3B,IAAIw3F,EAAY,EACZC,EAAK,EACLC,EAAY13F,EAEhB,IADAA,EAAIA,EAAE,IAAI,CAAC,EACJA,EAAE,IAAM42F,GAAU,CACvBc,EAAYA,EAAU,IAAI13F,CAAC,EAC3B,IAAI23F,EAAMD,EAAU,GAAK,EAAI,EAAI,EAC7BC,IAAQ,GAAKF,IAAO,GAAGD,IAC3BC,EAAKE,EACL33F,EAAIA,EAAE,IAAI,CAAC,CACZ,CACD,OAAOk3F,EAAel3F,CAAC,EAAE,IAAI03F,EAAU,IAAK,CAAA,EAAE,IAAI,IAAIt9F,EAAQ,EAAGo9F,EAAY,EAAI,KAAK,GAAK,CAAC,CAAC,CAC9F,CACH,CAAC,EACDt0B,GAAA,aAAuByzB,cC3IvB,OAAO,eAAe7zB,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIryD,IAAc57B,GACdglB,IAAWriB,EACX6D,GAAO,YACPia,IAAe,CAAC,QAAS,OAAO,EAChCsiG,OAAqC/9F,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC7F,IAAI3d,EAAQ2d,EAAK,MACf8oE,EAAQ9oE,EAAK,MAuBf,OAAO3d,EAAMlB,GAAM,CACjB,OAAQ,SAAgB4R,EAAG,CACzB,GAAIA,EAAI,EACN,MAAM,IAAI,MAAM,4BAA4B,EAE9C,OAAO+1E,EAAM/1E,EAAI,CAAC,CACnB,EACD,UAAW,SAAmBA,EAAG,CAC/B,GAAIA,EAAE,aACJ,MAAM,IAAI,MAAM,4BAA4B,EAE9C,OAAO+1E,EAAM/1E,EAAE,KAAK,CAAC,CAAC,CACvB,EACD,iBAAkB1Q,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUwG,EAAG,CAClB,SAAWwjB,IAAY,SAASxjB,EAAGxG,CAAI,CAC/C,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACDq8E,GAAA,gBAA0B80B,cCrD1B,OAAO,eAAex0B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIvpE,IAAWhlB,EACXwG,GAAO,eACPia,IAAe,CAAC,QAAS,SAAU,SAAU,MAAO,WAAY,MAAO,YAAa,MAAO,WAAW,EACtGuiG,OAAwCh+F,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAChG,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdgE,EAAShE,EAAK,OACd2J,EAAM3J,EAAK,IACX6vB,EAAW7vB,EAAK,SAChBnI,EAAMmI,EAAK,IACXkgC,EAAYlgC,EAAK,UACjByL,EAAMzL,EAAK,IACX4d,EAAY5d,EAAK,UAiBnB,OAAO3d,EAAMlB,GAAM,CACjB,eAAgB,SAAoBwkB,EAAG5gB,EAAG,CACxC,OAAO64G,EAAOl9F,EAAOiF,CAAC,EAAGjF,EAAO3b,CAAC,CAAC,CACnC,EACD,gBAAiB,SAAqB4gB,EAAG5gB,EAAG,CAC1C,OAAO64G,EAAOj4F,EAAGjF,EAAO3b,CAAC,CAAC,CAC3B,EACD,gBAAiB,SAAqB4gB,EAAG5gB,EAAG,CAC1C,OAAO64G,EAAOl9F,EAAOiF,CAAC,EAAG5gB,CAAC,CAC3B,EACD,iBAAkB,SAAsB4gB,EAAG5gB,EAAG,CAC5C,OAAO64G,EAAOj4F,EAAG5gB,CAAC,CACnB,CACL,CAAG,EACD,SAAS64G,EAAOj4F,EAAG,EAAG,CACpB,IAAIk4F,EAAU,EAAE,KAAI,EAAG,OACnBC,EAAUn4F,EAAE,KAAI,EAAG,OACvB,GAAIk4F,EAAU,EACZ,MAAM,IAAI,MAAM,sCAAsC,EAExD,GAAIC,EAAU,EACZ,MAAM,IAAI,MAAM,uCAAuC,EAEzD,GAAID,IAAYC,EACd,MAAM,IAAI,MAAM,qCAAqC,EAIvD,IAAIC,EAAOp0F,EAAIhE,CAAC,EAChB,GAAIo4F,IAAS,EACX,MAAM,IAAI,MAAM,kDAAkD,EAEpE,IAAIC,EAAOr0F,EAAI,CAAC,EAChB,GAAIq0F,IAAS,EACX,MAAM,IAAI,MAAM,mDAAmD,EAErE,IAAIC,EAAQj6F,EAAO2B,EAAGgE,EAAIhE,CAAC,CAAC,EACxBu4F,EAAQl6F,EAAO,EAAG2F,EAAI,CAAC,CAAC,EACxB/W,EAAS+W,EAAIkmB,EAASouE,EAAOpmG,EAAIqoC,EAAU+9D,EAAOC,CAAK,EAAG,SAAU3gH,EAAG,CACzE,OAAOkuB,EAAIluB,CAAC,CACb,CAAA,CAAC,CAAC,EACH,OAAIqgC,EAAUhrB,CAAM,EACXA,EAEA,OAAO,GAEjB,CACH,CAAC,EACDs2E,GAAA,mBAA6By0B,cCjF7B,OAAO,eAAev0B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAI7yD,IAAc57B,GACdglB,IAAWriB,EACX6D,GAAO,cACPia,IAAe,CAAC,QAAS,MAAO,SAAU,WAAY,YAAa,YAAa,YAAY,EAC5F+iG,OAAuCx+F,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC/F,IAAI3d,EAAQ2d,EAAK,MACf0K,EAAM1K,EAAK,IACXgE,EAAShE,EAAK,OACd6vB,EAAW7vB,EAAK,SAChB4oE,EAAY5oE,EAAK,UACjBlO,EAAYkO,EAAK,UACjBge,EAAahe,EAAK,WAsBpB,OAAO3d,EAAMlB,GAAM,CACjB,iBAAkB,SAAqBlC,EAAG,CACxC,IAAI0qB,EAAM,EACN0xD,EAAQ,EACZ,SAAI9kD,IAAY,aAAat3B,EAAG,SAAUm/G,EAAI,CAC5C,GAAI,CAACtsG,EAAUssG,CAAE,GAAK,CAACpgF,EAAWogF,CAAE,EAClC,MAAM,IAAI,UAAU,yDAAyD,EAE/Ez0F,EAAMe,EAAIf,EAAKy0F,CAAE,EACjB/iC,EAAQxrC,EAASwrC,EAAOuN,EAAUw1B,CAAE,CAAC,CAC7C,CAAO,EACMp6F,EAAO4kE,EAAUj/D,CAAG,EAAG0xD,CAAK,CACpC,CACL,CAAG,CACH,CAAC,EACD+N,GAAA,kBAA4B+0B,cCpD5B,OAAO,eAAe70B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAI9zE,GAAU7a,GACVy+B,IAAW97B,GACXqiB,IAAW9gB,EACXsC,GAAO,eACPia,IAAe,CAAC,QAAS,WAAW,EACpCijG,OAAwC1+F,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAChG,IAAI3d,EAAQ2d,EAAK,MACf4oE,EAAY5oE,EAAK,UA0BnB,OAAO3d,EAAMlB,GAAM,CACjB,qBAAsBynF,EACtB,iBAAkB,SAAsB71E,EAAG8P,EAAG,CAC5C,GAAI,IAAKrN,GAAQ,WAAWzC,CAAC,GAAKA,EAAI,EACpC,MAAM,IAAI,UAAU,0DAA0D,EAEhF,GAAI,IAAKyC,GAAQ,WAAWqN,CAAC,GAAKA,EAAI,EACpC,MAAM,IAAI,UAAU,0DAA0D,EAEhF,GAAIA,EAAI9P,EACN,MAAM,IAAI,UAAU,kEAAkE,EAGxF,SAAWqmB,IAAS,SAASrmB,EAAI8P,EAAI,EAAG9P,CAAC,CAC1C,EACD,uBAAwB,SAA4BA,EAAG8P,EAAG,CACxD,IAAIjQ,EAAQxY,EACZ,GAAI,CAACwhH,GAAkB7oG,CAAC,GAAK,CAAC6oG,GAAkB/4F,CAAC,EAC/C,MAAM,IAAI,UAAU,0DAA0D,EAEhF,GAAIA,EAAE,GAAG9P,CAAC,EACR,MAAM,IAAI,UAAU,kEAAkE,EAExF,IAAIkR,EAAMlR,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,EAExB,IADAH,EAASqR,EACJ7pB,EAAI2Y,EAAE,MAAM8P,CAAC,EAAE,KAAK,CAAC,EAAGzoB,EAAE,IAAI2Y,CAAC,EAAG3Y,EAAIA,EAAE,KAAK,CAAC,EACjDwY,EAASA,EAAO,MAAMxY,CAAC,EAEzB,OAAOwY,CACR,CAGL,CAAG,CACH,CAAC,EAOyB02E,GAAA,mBAAG+0B,IAC7B,SAASzC,GAAkB7oG,EAAG,CAC5B,OAAOA,EAAE,UAAW,GAAIA,EAAE,IAAI,CAAC,CACjC,iBChFIhZ,IAAyBY,GAC7B,OAAO,eAAe2jH,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgBA,GAAA,UAAGC,IACpB,IAAIC,GAAczkH,IAAuBuD,EAAqB,EAC1DmhH,OAAqCD,GAAY,SAAY,KAAK,IAAG,CAAE,EAC3E,SAASD,IAAUG,EAAY,CAC7B,IAAI9yF,EAGJ,SAAS+yF,EAAQC,EAAM,CACrBhzF,EAASgzF,IAAS,KAAOH,OAAsBD,GAAY,SAAY,OAAOI,CAAI,CAAC,CACpF,CAGDD,EAAQD,CAAU,EAGlB,SAASG,GAAM,CACb,OAAOjzF,EAAM,CACd,CACD,OAAOizF,CACT,CCvBA,OAAO,eAAer1B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIruE,GAASxgB,GACTglB,IAAWriB,EACXsB,GAAMC,GACNigH,GAAax9G,GACbH,GAAO,aACPia,IAAe,CAAC,QAAS,SAAU,KAAK,EACxC2jG,OAAsCp/F,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC9F,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdqM,EAAKrM,EAAK,GAER6+F,KAAUC,GAAW,WAAWvkH,EAAO,UAAU,EACrD,OAAI8xB,GACFA,EAAG,SAAU,SAAUvrB,EAAMF,EAAM,CAC7BE,EAAK,aAAeF,EAAK,aAC3Bi+G,KAAUC,GAAW,WAAWh+G,EAAK,UAAU,EAEvD,CAAK,EAsCIuB,EAAMlB,GAAM,CACjB,iBAAkB,SAAqB69G,EAAW,CAChD,OAAO5f,EAAY4f,EAAW,CAAA,CAAE,CACjC,EACD,yBAA0B,SAA2BA,EAAWr+G,EAAS,CACvE,OAAOy+F,EAAY4f,EAAWr+G,CAAO,CACtC,EACD,yBAA0B,SAA2Bq+G,EAAWttG,EAAQ,CACtE,OAAO0tF,EAAY4f,EAAW,CAC5B,OAAQttG,CAChB,CAAO,CACF,EACD,iCAAkC,SAAgCstG,EAAWC,EAAS,CACpF,OAAO7f,EAAY4f,EAAW,CAC5B,QAASC,CACjB,CAAO,CACF,EACD,yCAA0C,SAAsCD,EAAWC,EAASvtG,EAAQ,CAC1G,OAAO0tF,EAAY4f,EAAW,CAC5B,OAAQttG,EACR,QAASutG,CACjB,CAAO,CACF,EACD,yCAA0C,SAAsCD,EAAWttG,EAAQutG,EAAS,CAC1G,OAAO7f,EAAY4f,EAAW,CAC5B,OAAQttG,EACR,QAASutG,CACjB,CAAO,CACF,CACL,CAAG,EAYD,SAAS7f,EAAY4f,EAAW//E,EAAO,CACrC,IAAIvtB,EAASutB,EAAM,OACjBggF,EAAUhgF,EAAM,QAChBigF,EAAoBjgF,EAAM,YAC1BkgF,EAAcD,IAAsB,OAAS,GAAOA,EAClDE,EAAS,OAAO1tG,EAAW,IAC3B0tG,IACF1tG,EAAS,GAEX,IAAImyB,KAAmBjlC,GAAI,UAAUogH,CAAS,EAAIA,EAAU,UAAapgH,GAAI,UAAUqgH,CAAO,EAAIA,EAAQ,OAAS,KACnHD,EAAYA,EAAU,UAClBC,IACFA,EAAUA,EAAQ,WAGhBE,IAAgB,KAClBH,KAAgB7jG,GAAO,SAAS6jG,CAAS,EACzCC,KAAc9jG,GAAO,SAAS8jG,CAAO,GAEvC,IAAII,EAAe,EACnB,GAAI,OAAOJ,EAAY,IAAa,CAClC,GAAIA,EAAQ,SAAWD,EAAU,OAC/B,MAAM,IAAI,MAAM,gDAAgD,EAElE,QAAS5kH,EAAI,EAAGgF,EAAM6/G,EAAQ,OAAQ7kH,EAAIgF,EAAKhF,IAAK,CAClD,GAAI,IAAKwE,GAAI,UAAUqgH,EAAQ7kH,CAAC,CAAC,GAAK6kH,EAAQ7kH,CAAC,EAAI,EACjD,MAAM,IAAI,MAAM,8CAA8C,EAEhEilH,GAAgBJ,EAAQ7kH,CAAC,CAC1B,CACF,CAID,QAHIsa,EAASsqG,EAAU,OACnBpsG,EAAS,CAAA,EACTrU,EACGqU,EAAO,OAASlB,GAAQ,CAC7B,GAAI,OAAOutG,EAAY,IACrB1gH,EAAOygH,EAAU,KAAK,MAAMH,EAAK,EAAGnqG,CAAM,CAAC,MAG3C,SADI4qG,EAAUT,EAAK,EAAGQ,EACblgG,EAAK,EAAGH,EAAOggG,EAAU,OAAQ7/F,EAAKH,EAAMG,IAEnD,GADAmgG,GAAWL,EAAQ9/F,CAAE,EACjBmgG,EAAU,EAAG,CACf/gH,EAAOygH,EAAU7/F,CAAE,EACnB,KACD,CAGLvM,EAAO,KAAKrU,CAAI,CACjB,CACD,OAAO6gH,EAASxsG,EAAO,CAAC,EAAIixB,EAAeA,EAAajxB,CAAM,EAAIA,CACnE,CACH,CAAC,EACD42E,GAAA,iBAA2Bu1B,oBCxJ3B,OAAO,eAAeQ,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmBA,GAAA,aAAGC,GAOvB,SAASA,GAAavsG,EAAM2Y,EAAQ,CAClC,IAAI+D,EAAO,CAAA,EAEX,GADA1c,EAAOA,EAAK,MAAM,CAAC,EACfA,EAAK,OAAS,EAChB,QAAS7Y,EAAI,EAAGsa,EAASzB,EAAK,MAAK,EAAI7Y,EAAIsa,EAAQta,IACjDu1B,EAAK,KAAK6vF,GAAavsG,EAAM2Y,CAAM,CAAC,MAGtC,SAASzM,EAAK,EAAGsgG,EAAUxsG,EAAK,MAAK,EAAIkM,EAAKsgG,EAAStgG,IACrDwQ,EAAK,KAAK/D,EAAM,CAAE,EAGtB,OAAO+D,CACT,CCvBA,OAAO,eAAe/D,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACDA,GAAA,mBAA6BA,GAAA,aAAuB,OACpD,IAAIjM,GAAWhlB,EACXiE,IAAMtB,GACNwhH,GAAajgH,GACb6gH,IAAiBp+G,GACjBH,GAAO,SACPia,IAAe,CAAC,QAAS,SAAU,KAAK,EACxCukG,OAAkChgG,GAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC1F,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdqM,EAAKrM,EAAK,GAER6+F,KAAUC,GAAW,WAAWvkH,EAAO,UAAU,EACrD,OAAI8xB,GACFA,EAAG,SAAU,SAAUvrB,EAAMF,EAAM,CAC7BE,EAAK,aAAeF,EAAK,aAC3Bi+G,KAAUC,GAAW,WAAWh+G,EAAK,UAAU,EAEvD,CAAK,EAiCIuB,EAAMlB,GAAM,CACjB,GAAI,UAAa,CACf,OAAOm+F,EAAQ,EAAG,CAAC,CACpB,EACD,OAAQ,SAAgBnoF,EAAK,CAC3B,OAAOmoF,EAAQ,EAAGnoF,CAAG,CACtB,EACD,iBAAkB,SAAsBnP,EAAKmP,EAAK,CAChD,OAAOmoF,EAAQt3F,EAAKmP,CAAG,CACxB,EACD,iBAAkB,SAAqBlE,EAAM,CAC3C,OAAO2sG,EAAc3sG,EAAM,EAAG,CAAC,CAChC,EACD,yBAA0B,SAA2BA,EAAMkE,EAAK,CAC9D,OAAOyoG,EAAc3sG,EAAM,EAAGkE,CAAG,CAClC,EACD,iCAAkC,SAAiClE,EAAMjL,EAAKmP,EAAK,CACjF,OAAOyoG,EAAc3sG,EAAMjL,EAAKmP,CAAG,CACpC,CACL,CAAG,EACD,SAASyoG,EAAc3sG,EAAMjL,EAAKmP,EAAK,CACrC,IAAIwX,KAAU+wF,IAAe,cAAczsG,EAAK,QAAO,EAAI,UAAY,CACrE,OAAOqsF,EAAQt3F,EAAKmP,CAAG,CAC7B,CAAK,EACD,SAAWvY,IAAI,UAAUqU,CAAI,EAAIA,EAAK,OAAO0b,CAAG,EAAIA,CACrD,CACD,SAAS2wE,EAAQt3F,EAAKmP,EAAK,CACzB,OAAOnP,EAAM62G,EAAG,GAAM1nG,EAAMnP,EAC7B,CACH,CAAC,EAImB4jB,GAAA,aAAG+zF,IACvB,IAAIE,OAAwClgG,GAAS,SAASxe,GAAM,CAAC,QAAS,SAAU,KAAK,EAAG,SAAU89B,EAAO,CAC3G,IAAA58B,EAAQ48B,EAAM,MAChB1kC,EAAS0kC,EAAM,OACf5S,EAAK4S,EAAM,GACFA,EAAM,OAEjB,IAAI4/E,KAAUC,GAAW,WAAWvkH,EAAO,UAAU,EACrD,OAAI8xB,GACFA,EAAG,SAAU,SAAUvrB,EAAMF,EAAM,CAC7BE,EAAK,aAAeF,EAAK,aAC3Bi+G,KAAUC,GAAW,WAAWh+G,EAAK,UAAU,EAEvD,CAAK,EAEIuB,EAAMlB,GAAM,CACjB,GAAI,UAAa,CACf,OAAOm+F,EAAQ,EAAG,CAAC,CACpB,EACD,OAAQ,SAAgBnoF,EAAK,CAC3B,OAAOmoF,EAAQ,EAAGnoF,CAAG,CACtB,EACD,iBAAkB,SAAsBnP,EAAKmP,EAAK,CAChD,OAAOmoF,EAAQt3F,EAAKmP,CAAG,CACxB,CACL,CAAG,EACD,SAASmoF,EAAQt3F,EAAKmP,EAAK,CACzB,OAAOnP,EAAM62G,EAAG,GAAM1nG,EAAMnP,EAC7B,CACH,CAAC,EACD4jB,GAAA,mBAA6Bi0F,cCrH7B,OAAO,eAAel2B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIhqE,IAAWhlB,EACXilH,IAAgBtiH,GAChBwhH,GAAajgH,GACbD,IAAM0C,GACNH,GAAO,YACPia,IAAe,CAAC,QAAS,SAAU,KAAK,EACxC0kG,OAAqCngG,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC7F,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdqM,EAAKrM,EAAK,GAER6+F,KAAUC,GAAW,WAAWvkH,EAAO,UAAU,EACrD,OAAI8xB,GACFA,EAAG,SAAU,SAAUvrB,EAAMF,EAAM,CAC7BE,EAAK,aAAeF,EAAK,aAC3Bi+G,KAAUC,GAAW,WAAWh+G,EAAK,UAAU,EAEvD,CAAK,EAgCIuB,EAAMlB,GAAM,CACjB,GAAI,UAAa,CACf,OAAOq+F,EAAW,EAAG,CAAC,CACvB,EACD,OAAQ,SAAgBroF,EAAK,CAC3B,OAAOqoF,EAAW,EAAGroF,CAAG,CACzB,EACD,iBAAkB,SAAsBnP,EAAKmP,EAAK,CAChD,OAAOqoF,EAAWx3F,EAAKmP,CAAG,CAC3B,EACD,iBAAkB,SAAqBlE,EAAM,CAC3C,OAAO8sG,EAAiB9sG,EAAM,EAAG,CAAC,CACnC,EACD,yBAA0B,SAA2BA,EAAMkE,EAAK,CAC9D,OAAO4oG,EAAiB9sG,EAAM,EAAGkE,CAAG,CACrC,EACD,iCAAkC,SAAiClE,EAAMjL,EAAKmP,EAAK,CACjF,OAAO4oG,EAAiB9sG,EAAMjL,EAAKmP,CAAG,CACvC,CACL,CAAG,EACD,SAAS4oG,EAAiB9sG,EAAMjL,EAAKmP,EAAK,CACxC,IAAIwX,KAAUixF,IAAc,cAAc3sG,EAAK,QAAO,EAAI,UAAY,CACpE,OAAOusF,EAAWx3F,EAAKmP,CAAG,CAChC,CAAK,EACD,SAAWvY,IAAI,UAAUqU,CAAI,EAAIA,EAAK,OAAO0b,CAAG,EAAIA,CACrD,CACD,SAAS6wE,EAAWx3F,EAAKmP,EAAK,CAC5B,OAAO,KAAK,MAAMnP,EAAM62G,EAAG,GAAM1nG,EAAMnP,EAAI,CAC5C,CACH,CAAC,EACD2hF,GAAA,gBAA0Bm2B,cCnF1B,OAAO,eAAe96B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIrlE,IAAWhlB,EACXiE,GAAMtB,GACN6D,GAAO,aACPia,IAAe,CAAC,QAAS,YAAa,WAAY,iBAAkB,eAAgB,MAAO,YAAa,eAAgB,aAAc,YAAa,SAAU,aAAc,QAAQ,EACnL4kG,OAAsCrgG,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC1F,IAAA3d,EAAQ2d,EAAK,MACfqlB,EAAYrlB,EAAK,UACNA,EAAK,SACpB,IAAI2vB,EAAiB3vB,EAAK,eACPA,EAAK,aACdA,EAAK,IACCA,EAAK,UACFA,EAAK,aACxB,IAAIyd,EAAazd,EAAK,WAClBlO,EAAYkO,EAAK,UACjBtO,EAASsO,EAAK,OACdsjB,EAAYtjB,EAAK,UACjBu7B,EAASv7B,EAAK,OACZigG,EAAa,CAAA,EACbC,EAAW,CAAA,EA6Bf,OAAO79G,EAAMlB,GAAM,CACjB,yCAA0C,SAAwC4R,EAAG8P,EAAG,CACtF,GAAI,CAAC/Q,EAAUiB,CAAC,GAAK0qB,EAAW1qB,CAAC,GAAK,CAACjB,EAAU+Q,CAAC,GAAK4a,EAAW5a,CAAC,EACjE,MAAM,IAAI,UAAU,4DAA4D,EAC3E,GAAI04B,EAAO14B,EAAG9P,CAAC,EACpB,MAAM,IAAI,UAAU,0DAA0D,EAEhF,IAAIi4F,EAAM,KAAMpsG,GAAI,UAAUmU,CAAC,MAASnU,GAAI,UAAUikB,CAAC,GACnDs9F,EAAQnV,EAAMkV,EAAWD,EACzBG,EAAOpV,EAAM1nE,EAAY5xB,EACzB2uG,EAAK3uG,EAAOqB,CAAC,EACbutG,EAAK5uG,EAAOmR,CAAC,EAEjB,GAAIs9F,EAAME,CAAE,GAAKF,EAAME,CAAE,EAAE,OAASC,EAClC,OAAOH,EAAME,CAAE,EAAEC,CAAE,EAGrB,QAAS58F,EAAI,EAAGA,GAAK28F,EAAI,EAAE38F,EAIzB,GAHKy8F,EAAMz8F,CAAC,IACVy8F,EAAMz8F,CAAC,EAAI,CAAW08F,EAAV18F,IAAM,EAAS,EAAU,CAAT,CAAW,GAErCA,IAAM,EAGV,QAFIwQ,EAAMisF,EAAMz8F,CAAC,EACb9iB,EAAOu/G,EAAMz8F,EAAI,CAAC,EACbtpB,EAAI85B,EAAI,OAAQ95B,GAAKspB,GAAKtpB,GAAKkmH,EAAI,EAAElmH,EACxCA,IAAMspB,EACRwQ,EAAI95B,CAAC,EAAI,EAET85B,EAAI95B,CAAC,EAAIirC,EAAUsK,EAAeywE,EAAKhmH,CAAC,EAAGwG,EAAKxG,CAAC,CAAC,EAAGwG,EAAKxG,EAAI,CAAC,CAAC,EAItE,OAAO+lH,EAAME,CAAE,EAAEC,CAAE,CACpB,CACL,CAAG,CACH,CAAC,EACDt7B,GAAA,iBAA2Bg7B,cCxF3B,OAAO,eAAet7B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAI/kE,IAAWhlB,EACXwG,GAAO,cACPia,IAAe,CAAC,QAAS,YAAa,aAAc,YAAa,YAAY,EAC7EmlG,OAAuC5gG,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC/F,IAAI3d,EAAQ2d,EAAK,MACfqlB,EAAYrlB,EAAK,UACjByd,EAAazd,EAAK,WAClBlO,EAAYkO,EAAK,UACjBglE,EAAahlE,EAAK,WAsBpB,OAAO3d,EAAMlB,GAAM,CACjB,qBAAsB,SAAyB4R,EAAG,CAChD,GAAI,CAACjB,EAAUiB,CAAC,GAAK0qB,EAAW1qB,CAAC,EAC/B,MAAM,IAAI,UAAU,6DAA6D,EAKnF,QADIH,EAAS,EACJxY,EAAI,EAAGA,GAAK2Y,EAAG3Y,IACtBwY,EAASyyB,EAAUzyB,EAAQoyE,EAAWjyE,EAAG3Y,CAAC,CAAC,EAE7C,OAAOwY,CACR,CACL,CAAG,CACH,CAAC,EACD8xE,GAAA,kBAA4B67B,cCjD5B,OAAO,eAAe37B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAIjlE,IAAWhlB,EACXwG,GAAO,UACPia,IAAe,CAAC,QAAS,YAAa,eAAgB,iBAAkB,eAAgB,aAAc,WAAW,EACjHolG,OAAmC7gG,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC3F,IAAI3d,EAAQ2d,EAAK,MACfqlB,EAAYrlB,EAAK,UACjBigC,EAAejgC,EAAK,aACpB2vB,EAAiB3vB,EAAK,eACtBkZ,EAAelZ,EAAK,aACpByd,EAAazd,EAAK,WAClBlO,EAAYkO,EAAK,UAsBnB,OAAO3d,EAAMlB,GAAM,CACjB,qBAAsB,SAAyB4R,EAAG,CAChD,GAAI,CAACjB,EAAUiB,CAAC,GAAK0qB,EAAW1qB,CAAC,EAC/B,MAAM,IAAI,UAAU,yDAAyD,EAE/E,OAAOktC,EAAa/mB,EAAayW,EAAe58B,EAAG,CAAC,EAAGA,CAAC,EAAGsyB,EAAUtyB,EAAG,CAAC,CAAC,CAC3E,CACL,CAAG,CACH,CAAC,EACD6xE,GAAA,cAAwB47B,cC7CxB,OAAO,eAAe17B,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAInlE,IAAWhlB,EACXwG,GAAO,cACPia,IAAe,CAAC,QAAS,YAAa,eAAgB,aAAc,aAAc,YAAa,QAAQ,EACvGqlG,OAAuC9gG,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC3F,IAAA3d,EAAQ2d,EAAK,MACfqlB,EAAYrlB,EAAK,UACjBkZ,EAAelZ,EAAK,aACpBge,EAAahe,EAAK,WACLA,EAAK,WACtB,IAAIlO,EAAYkO,EAAK,UACjBu7B,EAASv7B,EAAK,OAuBhB,OAAO3d,EAAMlB,GAAM,CACjB,yCAA0C,SAAwC4R,EAAG8P,EAAG,CACtF,GAAI,CAAC/Q,EAAUiB,CAAC,GAAK,CAACirB,EAAWjrB,CAAC,GAAK,CAACjB,EAAU+Q,CAAC,GAAK,CAACmb,EAAWnb,CAAC,EACnE,MAAM,IAAI,UAAU,yDAAyD,EACxE,GAAI04B,EAAO14B,EAAG9P,CAAC,EACpB,MAAM,IAAI,UAAU,2DAA2D,EAEjF,OAAOmmB,EAAamM,EAAUtyB,EAAG,EAAE,EAAGsyB,EAAUxiB,EAAG,EAAE,CAAC,CACvD,CACL,CAAG,CACH,CAAC,EACDiiE,GAAA,kBAA4B27B,cChD5B,OAAO,eAAe1gC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIpgE,IAAWhlB,EACXwG,GAAO,YACPia,IAAe,CAAC,QAAS,OAAO,EAChCslG,OAAqC/gG,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACjFA,EAAK,MACnB,IAAI3d,EAAQ2d,EAAK,MAGf,SAAS2gG,EAAYljH,EAAM,CACzB,IAAIkd,EAAQ,EACZ,OAAAld,EAAK,QAAQ,SAAUsV,EAAG,CACxB4H,GAASgmG,EAAY5tG,CAAC,CAC5B,CAAK,EACM4H,GAAS,CACjB,CAgCD,OAAOtY,EAAMlB,GAAM,CACjB,KAAM,SAAcy8D,EAAM,CACxB,OAAO+iD,EAAY/iD,CAAI,CACxB,CACL,CAAG,CACH,CAAC,EACDmiB,GAAA,gBAA0B2gC,mECxD1B,OAAO,eAAwB3xF,EAAA,aAAc,CAC3C,MAAO,EACT,CAAC,EACDA,EAAA,qBAA+B6xF,EAC/B,OAAO,eAAe7xF,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,cACZ,CACH,CAAC,EACDmwB,EAAA,cAAwB8xF,EACxB,OAAO,eAAe9xF,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,YACZ,CACH,CAAC,EACD,IAAIA,EAAMjE,GACV,SAASkmH,EAActjH,EAAG,CACxB,SAAWqB,EAAI,gBAAgBrB,CAAC,MAASqB,EAAI,gBAAgBrB,CAAC,GAAKA,EAAE,QAAO,MAAUqB,EAAI,gBAAgBrB,EAAE,KAAK,CAAC,CAAC,CACpH,CACD,SAASqjH,EAAqBrjH,EAAG,CAS/B,YARQqB,EAAI,gBAAgBrB,CAAC,OAIpBqB,EAAI,gBAAgBrB,CAAC,MAASqB,EAAI,gBAAgBrB,CAAC,IAAMA,EAAE,KAAK,MAAMqjH,CAAoB,MAI3FhiH,EAAI,mBAAmBrB,CAAC,GAAKqjH,EAAqBrjH,EAAE,OAAO,EAKrE,qBCnCIxD,IAAyBY,GAC7B,OAAO,eAAemmH,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiBA,GAAA,WAAG,OACrB,IAAI5zE,IAAmBnzC,IAAuBuD,GAAA,CAAgD,EAC1FsB,GAAMC,GACN8gB,IAAWre,EACXjB,GAAUgW,GACd,SAAS+4C,GAAQzxD,EAAQ0xD,EAAgB,CAAE,IAAI9L,EAAO,OAAO,KAAK5lD,CAAM,EAAG,GAAI,OAAO,sBAAuB,CAAE,IAAI2xD,EAAU,OAAO,sBAAsB3xD,CAAM,EAAG0xD,IAAmBC,EAAUA,EAAQ,OAAO,SAAUC,EAAK,CAAE,OAAO,OAAO,yBAAyB5xD,EAAQ4xD,CAAG,EAAE,UAAW,CAAE,GAAIhM,EAAK,KAAK,MAAMA,EAAM+L,CAAO,CAAE,CAAG,OAAO/L,CAAO,CACrV,SAASiM,GAAcr1D,EAAQ,CAAE,QAASC,EAAI,EAAGA,EAAI,UAAU,OAAQA,IAAK,CAAE,IAAIC,EAAiB,UAAUD,CAAC,GAAnB,KAAuB,UAAUA,CAAC,EAAI,CAAA,EAAIA,EAAI,EAAIg1D,GAAQ,OAAO/0D,CAAM,EAAG,EAAE,EAAE,QAAQ,SAAUC,EAAK,IAAM4yC,IAAiB,SAAY/yC,EAAQG,EAAKD,EAAOC,CAAG,CAAC,CAAI,CAAA,EAAI,OAAO,0BAA4B,OAAO,iBAAiBH,EAAQ,OAAO,0BAA0BE,CAAM,CAAC,EAAI+0D,GAAQ,OAAO/0D,CAAM,CAAC,EAAE,QAAQ,SAAUC,EAAK,CAAE,OAAO,eAAeH,EAAQG,EAAK,OAAO,yBAAyBD,EAAQC,CAAG,CAAC,CAAE,CAAE,CAAI,CAAC,OAAOH,CAAS,CAC3gB,IAAIgH,IAAO,eACPia,IAAe,CAAC,eAAgB,eAAgB,YAAY,EAC5D2lG,OAAgCphG,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CACxF,IAAI0qD,EAAe1qD,EAAK,aACtBmmD,EAAenmD,EAAK,aACpBiqD,EAAajqD,EAAK,WAOhBghG,EAAI,GACJ5iG,EAAI,GACJ6iG,EAAc,WACdC,EAAiB,CACT,IAAK,CACb,QAASF,EACT,MAAOA,EACP,YAAaA,EACb,YAAaA,CACd,EACG,UAAW,CACb,QAASA,EACT,MAAOA,EACP,YAAaA,EACb,YAAaA,CACd,EACI,SAAU,CACb,QAAS5iG,EACT,MAAO4iG,EACP,YAAa5iG,EACb,YAAaA,CACd,EACI,SAAU,CACb,QAAS4iG,EACT,MAAOA,EACP,YAAaA,EACb,YAAaA,CACd,EACM,OAAQ,CACb,QAAS5iG,EACT,MAAO4iG,EACP,YAAa5iG,EACb,YAAaA,CACd,EACO,MAAO,CACb,QAAS4iG,EACT,MAAOA,EACP,YAAaA,EACb,YAAa5iG,CACd,EACI,SAAU,CACb,QAASA,EACT,MAAO4iG,EACP,YAAa5iG,EACb,YAAaA,CACd,CACL,EACM+iG,EAAc,CAChB,OAAQ,CACN,MAAO/iG,CACR,EACD,IAAK,CACH,MAAOA,CACR,CACL,EACMgjG,EAAkB,CACpB,SAAU,CACR,MAAOhjG,CACR,EACD,IAAK,CACH,QAAS4iG,CACV,EACD,IAAK,CACH,MAAOA,CACR,CACL,EACE,SAASK,EAAYC,EAAY1hH,EAAU,CACzC,IAAIi+D,EAAU,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAIqjD,EAC9E//G,EAAO8/G,EAUX,GATI,OAAOK,GAAe,SACxBngH,EAAOmgH,KACM1iH,GAAI,gBAAgB0iH,CAAU,EAC3CngH,EAAOmgH,EAAW,GAAG,cACR1iH,GAAI,gBAAgB0iH,CAAU,EAC3CngH,EAAOmgH,EAAW,QACL1iH,GAAI,mBAAmB0iH,CAAU,IAC9CngH,EAAO,YAEDd,GAAQ,gBAAgBw9D,EAAS18D,CAAI,EAAG,CAC9C,IAAInB,EAAa69D,EAAQ18D,CAAI,EAC7B,MAAQd,GAAQ,gBAAgBL,EAAYJ,CAAQ,EAClD,OAAOI,EAAWJ,CAAQ,EAE5B,MAAQS,GAAQ,gBAAgB6gH,EAAgB//G,CAAI,EAClD,OAAO+/G,EAAe//G,CAAI,EAAEvB,CAAQ,CAEvC,CACD,MAAQS,GAAQ,gBAAgBw9D,EAASojD,CAAW,EAAG,CACrD,IAAIM,EAAc1jD,EAAQojD,CAAW,EACrC,SAAQ5gH,GAAQ,gBAAgBkhH,EAAa3hH,CAAQ,EAC5C2hH,EAAY3hH,CAAQ,EAEtBshH,EAAeD,CAAW,EAAErhH,CAAQ,CAC5C,CAGD,MAAQS,GAAQ,gBAAgB6gH,EAAgB//G,CAAI,EAAG,CACrD,IAAIqgH,EAAeN,EAAe//G,CAAI,EACtC,MAAQd,GAAQ,gBAAgBmhH,EAAc5hH,CAAQ,EACpD,OAAO4hH,EAAa5hH,CAAQ,CAE/B,CACD,OAAOshH,EAAeD,CAAW,EAAErhH,CAAQ,CAC5C,CACD,SAAS6hH,EAAchkH,EAAM,CAC3B,IAAIogE,EAAU,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAIqjD,EAClF,OAAOG,EAAY5jH,EAAM,cAAeogE,CAAO,CAChD,CACD,SAAS6jD,EAAcjkH,EAAM,CAC3B,IAAIogE,EAAU,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAIqjD,EAClF,OAAOG,EAAY5jH,EAAM,cAAeogE,CAAO,CAChD,CAMD,SAAS8jD,EAAaC,EAASC,EAAW,CACxC,IAAIC,EAAStyD,GAAc,CAAE,EAAEoyD,CAAO,EACtC,QAASziH,KAAQ0iH,KACPxhH,GAAQ,gBAAgBuhH,EAASziH,CAAI,EAC3C2iH,EAAO3iH,CAAI,EAAIqwD,GAAcA,GAAc,CAAE,EAAEqyD,EAAU1iH,CAAI,CAAC,EAAGyiH,EAAQziH,CAAI,CAAC,EAE9E2iH,EAAO3iH,CAAI,EAAI0iH,EAAU1iH,CAAI,EAGjC,OAAO2iH,CACR,CAMD,SAASvqG,EAAQ9Z,EAAMogE,EAAS,CAC9B,GAAI,CAACpgE,EAAK,MAAQA,EAAK,KAAK,SAAW,EACrC,OAAOA,EAETA,EAAK,KAAOskH,EAAYtkH,EAAMogE,CAAO,EACrC,QAASzjE,EAAI,EAAGA,EAAIqD,EAAK,KAAK,OAAQrD,IACpCmd,EAAQ9Z,EAAK,KAAKrD,CAAC,EAAGyjE,CAAO,CAEhC,CAMD,SAASkkD,EAAYtkH,EAAMogE,EAAS,CAClC,IAAI2J,EACAw6C,EAAW,CAAA,EACXC,EAAe,SAASA,EAAaxkH,EAAM,CAC7C,QAASrD,EAAI,EAAGA,EAAIqD,EAAK,KAAK,OAAQrD,IAAK,CACzC,IAAI0F,EAAQrC,EAAK,KAAKrD,CAAC,KACfwE,GAAI,gBAAgBkB,CAAK,GAAK0nE,IAAO1nE,EAAM,GACjDmiH,EAAaniH,CAAK,EAElBkiH,EAAS,KAAKliH,CAAK,CAEtB,CACP,EACI,OAAI4hH,EAAcjkH,EAAMogE,CAAO,GAC7B2J,EAAK/pE,EAAK,GACVwkH,EAAaxkH,CAAI,EACVukH,GAEAvkH,EAAK,IAEf,CAKD,SAASykH,EAAWzkH,EAAMogE,EAAS,CACjC,GAAI,GAACpgE,EAAK,MAAQA,EAAK,KAAK,SAAW,GAKvC,SAFI0kH,EAAWC,EAAuB3kH,CAAI,EACtC8yB,EAAI9yB,EAAK,KAAK,OACTrD,EAAI,EAAGA,EAAIm2B,EAAGn2B,IACrB8nH,EAAWzkH,EAAK,KAAKrD,CAAC,EAAGyjE,CAAO,EAElC,GAAIttC,EAAI,GAAKmxF,EAAcjkH,EAAMogE,CAAO,EAAG,CAEzC,QADIwkD,EAAU5kH,EAAK,KAAK,IAAG,EACpBA,EAAK,KAAK,OAAS,GACxB4kH,EAAUF,EAAS,CAAC1kH,EAAK,KAAK,IAAK,EAAE4kH,CAAO,CAAC,EAE/C5kH,EAAK,KAAO4kH,EAAQ,IACrB,EACF,CAKD,SAASC,EAAW7kH,EAAMogE,EAAS,CACjC,GAAI,GAACpgE,EAAK,MAAQA,EAAK,KAAK,SAAW,GAKvC,SAFI0kH,EAAWC,EAAuB3kH,CAAI,EACtC8yB,EAAI9yB,EAAK,KAAK,OACTrD,EAAI,EAAGA,EAAIm2B,EAAGn2B,IACrBkoH,EAAW7kH,EAAK,KAAKrD,CAAC,EAAGyjE,CAAO,EAElC,GAAIttC,EAAI,GAAKmxF,EAAcjkH,EAAMogE,CAAO,EAAG,CAEzC,QADIwkD,EAAU5kH,EAAK,KAAK,MAAK,EACtBA,EAAK,KAAK,OAAS,GACxB4kH,EAAUF,EAAS,CAACE,EAAS5kH,EAAK,KAAK,MAAO,CAAA,CAAC,EAEjDA,EAAK,KAAO4kH,EAAQ,IACrB,EACF,CACD,SAASD,EAAuB3kH,EAAM,CACpC,SAAQmB,GAAI,gBAAgBnB,CAAI,EACvB,SAAUmJ,EAAM,CACrB,GAAI,CACF,OAAO,IAAIu/D,EAAa1oE,EAAK,GAAIA,EAAK,GAAImJ,EAAMnJ,EAAK,QAAQ,CAC9D,OAAQ4J,EAAK,CACZ,eAAQ,MAAMA,CAAG,EACV,EACR,CACT,EAEa,SAAUT,EAAM,CACrB,OAAO,IAAI8jE,EAAa,IAAIT,EAAWxsE,EAAK,IAAI,EAAGmJ,CAAI,CAC/D,CAEG,CACD,MAAO,CACL,uBAAwBw7G,EACxB,YAAaf,EACb,cAAeI,EACf,cAAeC,EACf,aAAcC,EACd,QAASpqG,EACT,YAAawqG,EACb,WAAYG,EACZ,WAAYI,EACZ,eAAgBpB,EAChB,YAAaC,EACb,gBAAiBC,CACrB,CACA,CAAC,EACDN,GAAA,WAAqBC,ICxQrB,IAAIhnH,IAAyBY,GAC7B,OAAO,eAAegmF,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAItjF,IAAWtD,IAAuBuD,EAAwC,EAC1EsB,IAAMC,GACN0jH,GAAajhH,IAAA,EACbqe,IAAWtJ,EACXmsG,IAAQ3iG,GACRxf,GAAUmyB,GACV5S,GAAO6S,GACPtxB,IAAO,WACPia,IAAe,CAAC,SAAU,QAAS,QAAS,MAAO,WAAY,WAAY,SAAU,MAAO,SAAU,QAAS,UAAW,mBAAoB,eAAgB,YAAa,aAAc,oBAAqB,SAAU,eAAgB,YAAa,eAAgB,eAAgB,YAAa,aAAc,eAAgB,kBAAmB,YAAY,EAC/VqnG,OAAoC9iG,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CAC/EA,EAAK,OACpB,IAAI3d,EAAQ2d,EAAK,MACbsN,EAAQtN,EAAK,MACPA,EAAK,IACAA,EAAK,SACLA,EAAK,SACPA,EAAK,OACRA,EAAK,IACFA,EAAK,OAClB,IAAI2zB,EAAQ3zB,EAAK,MACbygE,EAAUzgE,EAAK,QACf6gE,EAAmB7gE,EAAK,iBACxB+gE,EAAe/gE,EAAK,aACTA,EAAK,SACJA,EAAK,UACGA,EAAK,kBAChBA,EAAK,OAClB,IAAIm/C,EAAen/C,EAAK,aACpBogD,EAAYpgD,EAAK,UACjB0kD,EAAe1kD,EAAK,aACpB0qD,EAAe1qD,EAAK,aACpBqlD,EAAYrlD,EAAK,UACjB6lD,EAAa7lD,EAAK,WAClBmmD,EAAenmD,EAAK,aACpByoD,EAAkBzoD,EAAK,gBACvBiqD,EAAajqD,EAAK,WAChB0iG,KAAkBF,IAAM,YAAY,CACpC,aAAc93C,EACd,aAAcvE,EACd,WAAY8D,CAClB,CAAK,EACDo3C,EAAcqB,EAAY,YAC1BjB,EAAgBiB,EAAY,cAC5BhB,EAAgBgB,EAAY,cAC5Bf,EAAee,EAAY,aAC3BnrG,EAAUmrG,EAAY,QACtBR,EAAaQ,EAAY,WACzBJ,EAAaI,EAAY,WACzBN,EAAyBM,EAAY,uBACrCxB,EAAiBwB,EAAY,eAC7BvB,EAAcuB,EAAY,YAC1BtB,EAAkBsB,EAAY,gBAoHhCrgH,EAAM,cAAc,CAClB,KAAM,SACN,GAAI,MACJ,QAASud,GAAK,SAClB,CAAG,EACD,IAAI+gE,EAAWt+E,EAAM,WAAY,CAC/B,KAAM8vF,EACN,YAAa,SAAiBv0B,GAAMriD,GAAO,CACzC,OAAO42E,EAAUv0B,GAAM,GAAOriD,EAAK,CACpC,EACD,oBAAqB,SAAuBqiD,GAAMriD,GAAO5a,GAAS,CAChE,OAAOwxF,EAAUv0B,GAAM,GAAOriD,GAAO5a,EAAO,CAC7C,EACD,cAAewxF,EACf,mBAAoBA,EACpB,2BAA4BA,CAChC,CAAG,EACD9vF,EAAM,iBAAiB,CACrB,KAAM,SACN,GAAI,MACJ,QAASud,GAAK,SAClB,CAAG,EACD+gE,EAAS,eAAiBugC,EAC1BvgC,EAAS,YAAcwgC,EACvBxgC,EAAS,gBAAkBygC,EAC3B,SAASuB,EAAallH,GAAM,CAC1B,OAAOA,GAAK,UAAU,SAAUA,GAAMkC,GAAMyuD,GAAQ,CAClD,SAAWxvD,IAAI,mBAAmBnB,EAAI,EAAIklH,EAAallH,GAAK,OAAO,EAAIA,EAC7E,CAAK,CACF,CAGD,IAAImlH,EAAsB,CACxB,KAAQ,GACR,MAAS,GACT,EAAG,GACH,EAAG,GACH,SAAU,GACV,IAAK,GACL,KAAM,GACN,MAAO,GACP,OAAQ,GACR,IAAK,GACL,IAAK,GACL,GAAI,GACJ,QAAS,GACT,MAAO,GACP,IAAK,EAIT,EAWEjiC,EAAS,MAAQ,CAACI,EAQlB,CACE,EAAG,SACH,EAAG,GACJ,EAID,CACE,EAAG,gBAEH,SAAU,CACR,SAAU,CACR,MAAO,EACR,CACF,CACL,EAAK,CACD,EAAG,WAEH,SAAU,CACR,SAAU,CACR,MAAO,EACR,CACF,CACL,EAAK,CACD,EAAG,uBAEH,SAAU,CACR,SAAU,CACR,YAAa,EACd,EACD,SAAU,CACR,MAAO,EACR,CACF,CACL,EAAK,CACD,EAAG,uBAEH,SAAU,CACR,SAAU,CACR,YAAa,EACd,EACD,SAAU,CACR,MAAO,EACR,CACF,CACL,EAAK,CACD,EAAG,uBAEH,SAAU,CACR,SAAU,CACR,YAAa,EACd,EACD,SAAU,CACR,MAAO,EACR,CACF,CACL,EAAK,CACD,EAAG,WACH,EAAG,QACP,EAAK,CACD,EAAG,KACH,EAAG,UACJ,EAED,CACE,EAAG,iBACH,EAAG,oBACH,OAAQ,EACT,EAED,CACE,EAAG,UACH,EAAG,UACJ,EAED,CACE,EAAG,OACH,EAAG,SACP,EAAK,CACD,EAAG,8BACH,SAAU,CACR,SAAU,CACR,YAAa,EACd,CACF,CACL,EAAK,CACD,EAAG,oCACH,SAAU,CACR,SAAU,CACR,YAAa,EACd,CACF,CACF,EAED,CACE,EAAG,iCACH,SAAU,CACR,OAAQ,CACN,MAAO,EACR,CACF,CACF,EAED,CACE,EAAG,4BACH,EAAG,8BACP,EAAK,CACD,EAAG,+DACH,SAAU,CACR,OAAQ,CACN,MAAO,EACR,CACF,CACL,EAAK,CACD,EAAG,+DACH,SAAU,CACR,OAAQ,CACN,MAAO,EACR,CACF,CACL,EAAK,CACD,EAAG,+DACH,SAAU,CACR,OAAQ,CACN,MAAO,EACR,CACF,CACL,EAAK,CACD,EAAG,MACH,EAAG,KACP,EAAK,CACD,EAAG,uBACH,SAAU,CACR,OAAQ,CACN,MAAO,EACR,CACF,CACL,EAAK,CACD,EAAG,2BACH,SAAU,CACR,OAAQ,CACN,MAAO,EACR,CACF,CACF,EAKDF,EAIA,CACE,EAAG,aACH,SAAU,CACR,IAAK,CACH,MAAO,EACR,CACF,CACL,EAAK,CACD,EAAG,OACH,EAAG,GACP,EAAK,CACD,EAAG,YACH,EAAG,UACJ,EAED,CACE,EAAG,gBACH,EAAG,YACJ,EAED,CACE,EAAG,2BACH,EAAG,+BACP,EAAK,CACD,EAAG,2BACH,EAAG,+BACJ,EAED,CACE,EAAG,wBACH,SAAU,CACR,SAAU,CACR,YAAa,EACd,CACF,CACL,EAAK,CACD,EAAG,wBACH,SAAU,CACR,SAAU,CACR,YAAa,EACd,CACF,CACL,EAAK,CACD,EAAG,8BACH,SAAU,CACR,SAAU,CACR,YAAa,EACd,CACF,CACL,EAAK,CACD,EAAG,uBACH,SAAU,CACR,OAAQ,CACN,MAAO,EACR,EACD,SAAU,CACR,YAAa,EACd,CACF,CACL,EAAK,CACD,EAAG,8DACH,SAAU,CACR,SAAU,CACR,YAAa,EACd,CACF,CACL,EAAK,CACD,EAAG,8DACH,SAAU,CACR,SAAU,CACR,YAAa,EACd,CACF,CACL,EAAK,CACD,EAAG,YACH,EAAG,UACP,EAAK,CACD,EAAG,wBACH,SAAU,CACR,SAAU,CACR,YAAa,EACd,CACF,CACL,EAAK,CACD,EAAG,wBACH,SAAU,CACR,SAAU,CACR,YAAa,EACd,CACF,CACL,EAAKA,EAIH,CACE,EAAG,qBACH,SAAU,CACR,SAAU,CACR,MAAO,EACR,CACF,CACL,EAAK,CACD,EAAG,qBAEH,SAAU,CACR,SAAU,CACR,MAAO,EACR,EACD,SAAU,CACR,YAAa,EACd,CACF,CACF,EAED,CACE,EAAG,iBACH,SAAU,CACR,IAAK,CACH,YAAa,EACd,CACF,EACD,cAAe,CACb,IAAK,CACH,YAAa,EACd,CACF,CACL,EAAK,CACD,EAAG,iBACH,SAAU,CACR,SAAU,CACR,YAAa,EACd,CACF,EACD,cAAe,CACb,SAAU,CACR,YAAa,EACd,CACF,CACF,EAGD,CACE,EAAG,QACH,EAAG,MACJ,EAED,CACE,EAAG,oBAEH,SAAU,CACR,SAAU,CACR,YAAa,EACd,CACF,CACL,EAAK,CACD,EAAG,sBACH,SAAU,CACR,SAAU,CACR,YAAa,EACd,CACF,CACL,EAAK,CACD,EAAG,cACH,SAAU,CACR,SAAU,CACR,YAAa,EACd,CACF,CACL,EAAK,CACD,EAAG,MACH,EAAG,GACJ,EAED,CACE,EAAG,yBAEH,SAAU,CACR,SAAU,CACR,YAAa,EACd,CACF,CACL,EAAK,CACD,EAAG,uBAEH,SAAU,CACR,SAAU,CACR,YAAa,GACb,YAAa,EACd,CACF,CACF,EAMD,CACE,EAAG,MACH,EAAG,IACH,cAAe,CACb,SAAU,CACR,YAAa,EACd,CACF,CACL,EAAK,CACD,EAAG,2BACH,SAAU,CACR,SAAU,CACR,YAAa,EACd,CACF,CACL,EAAK,CACD,EAAG,WACH,EAAG,QACP,CAAG,EAMD,SAASgiC,EAAkBC,GAAYjlD,GAAS,CAC9C,IAAIklD,GAAU,CAAA,EACd,GAAID,GAAW,EAAG,CAChB,IAAIE,GAAKF,GAAW,EAAE,MAAM,IAAI,EAChC,GAAIE,GAAG,SAAW,EAChBD,GAAQ,EAAIC,GAAG,CAAC,EAChBD,GAAQ,EAAIC,GAAG,CAAC,MAEhB,OAAM,YAAY,yBAA2BF,GAAW,CAAC,CAEjE,MACMC,GAAQ,EAAID,GAAW,EACvBC,GAAQ,EAAID,GAAW,EAEzBC,GAAQ,EAAIJ,EAAar1F,EAAMy1F,GAAQ,CAAC,CAAC,EACzCA,GAAQ,EAAIJ,EAAar1F,EAAMy1F,GAAQ,CAAC,CAAC,EACzC,QAAS5jG,GAAK,EAAGu+C,GAAO,CAAC,gBAAiB,SAAU,UAAU,EAAGv+C,GAAKu+C,GAAK,OAAQv+C,KAAM,CACvF,IAAIhgB,GAAOu+D,GAAKv+C,EAAE,EACdhgB,MAAQ2jH,KACVC,GAAQ5jH,EAAI,EAAI2jH,GAAW3jH,EAAI,EAElC,CAID,GAHI2jH,GAAW,WACbC,GAAQ,SAAWz1F,EAAMw1F,GAAW,QAAQ,GAE1CpB,EAAcqB,GAAQ,EAAGllD,EAAO,EAAG,CACrC,IAAIolD,EAAiB,CAACxB,EAAcsB,GAAQ,EAAGllD,EAAO,EAClDqlD,GAEAD,IAAgBC,GAAgBC,KACpC,IAAIhB,GAAWC,EAAuBW,GAAQ,CAAC,EAC3CK,GAAYD,IAChBJ,GAAQ,SAAW,GACnBA,GAAQ,SAAS,EAAIZ,GAAS,CAACY,GAAQ,EAAGK,EAAS,CAAC,EAGpD7rG,EAAQwrG,GAAQ,SAAS,EAAGllD,EAAO,EACnCqkD,EAAWa,GAAQ,SAAS,EAAGllD,EAAO,EACtCklD,GAAQ,SAAS,EAAIZ,GAAS,CAACY,GAAQ,EAAGK,EAAS,CAAC,EAKhDH,IAEFF,GAAQ,YAAc,GACtBA,GAAQ,YAAY,EAAIZ,GAAS,CAACe,GAAeH,GAAQ,CAAC,CAAC,EAC3DA,GAAQ,YAAY,EAAIZ,GAAS,CAACe,GAAeH,GAAQ,CAAC,CAAC,EAE3DA,GAAQ,YAAc,GACtBA,GAAQ,YAAY,EAAIZ,GAAS,CAACe,GAAeH,GAAQ,SAAS,CAAC,CAAC,EACpEA,GAAQ,YAAY,EAAIZ,GAAS,CAACe,GAAeH,GAAQ,SAAS,CAAC,CAAC,EAEvE,CACD,OAAOA,EACR,CAkBD,SAASM,EAAYC,GAAOzlD,GAAS,CAGnC,QADI0lD,GAAU,CAAA,EACLnpH,GAAI,EAAGA,GAAIkpH,GAAM,OAAQlpH,KAAK,CACrC,IAAIopH,GAAOF,GAAMlpH,EAAC,EACd2oH,GAAU,OACVU,MAAepmH,IAAS,SAAYmmH,EAAI,EAC5C,OAAQC,GAAQ,CACd,IAAK,SACHD,GAAO,CACL,EAAGA,EACf,EAEQ,IAAK,SACHT,GAAUF,EAAkBW,GAAM3lD,EAAO,EACzC,MACF,IAAK,WACHklD,GAAUS,GACV,MACF,QACE,MAAM,UAAU,6BAA+BC,EAAQ,CAC1D,CAGDF,GAAQ,KAAKR,EAAO,CACrB,CACD,OAAOQ,EACR,CACD,IAAIG,EAAW,EACf,SAASP,GAA8B,CACrC,OAAO,IAAIl5C,EAAW,KAAOy5C,GAAU,CACxC,CACD,SAASvxB,EAAUv0B,GAAM0lD,GAAO,CAC9B,IAAI/nG,GAAQ,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,KAAQqE,GAAK,gBAAc,EACnGjf,GAAU,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,CAAA,EAC9EgjH,GAAQhjH,GAAQ,aACpB2iH,GAAQD,EAAYC,IAAS3iC,EAAS,MAAOhgF,GAAQ,OAAO,EAC5D,IAAIguB,GAAM8xD,EAAQ7iB,GAAMriD,EAAK,EAC7BoT,GAAMg0F,EAAah0F,EAAG,EAKtB,QAJIi1F,GAAU,CAAA,EACVzjH,EAAMwuB,GAAI,SAAS,CACrB,YAAa,KACnB,CAAK,EACM,CAACi1F,GAAQzjH,CAAG,GAAG,CACpByjH,GAAQzjH,CAAG,EAAI,GACfujH,EAAW,EACX,IAAIG,GAAU1jH,EACVwjH,IAAO,QAAQ,IAAI,eAAgBxjH,CAAG,EAC1C,QAAS/F,GAAI,EAAGA,GAAIkpH,GAAM,OAAQlpH,KAAK,CACrC,IAAI0pH,GAAU,GAWd,GAVI,OAAOR,GAAMlpH,EAAC,GAAM,YACtBu0B,GAAM20F,GAAMlpH,EAAC,EAAEu0B,GAAKhuB,EAAO,EACvBgjH,KAAOG,GAAUR,GAAMlpH,EAAC,EAAE,QAE9Bmd,EAAQoX,GAAKhuB,GAAQ,OAAO,EAC5BguB,GAAMo1F,EAAUp1F,GAAK20F,GAAMlpH,EAAC,EAAGuG,GAAQ,OAAO,EAC1CgjH,KACFG,GAAU,GAAG,OAAOR,GAAMlpH,EAAC,EAAE,EAAE,SAAQ,EAAI,MAAM,EAAE,OAAOkpH,GAAMlpH,EAAC,EAAE,EAAE,SAAQ,CAAE,IAG/EupH,GAAO,CACT,IAAIK,GAASr1F,GAAI,SAAS,CACxB,YAAa,KACzB,CAAW,EACGq1F,KAAWH,KACb,QAAQ,IAAI,WAAYC,GAAS,WAAYE,EAAM,EACnDH,GAAUG,GAEb,CAID1B,EAAW3zF,GAAKhuB,GAAQ,OAAO,CAChC,CACDR,EAAMwuB,GAAI,SAAS,CACjB,YAAa,KACrB,CAAO,CACF,CACD,OAAOA,EACR,CACD,SAASs1F,EAAQr1D,GAAO40D,GAAM3lD,GAAS,CACrC,IAAIqmD,GAAWt1D,GACf,GAAIA,GACF,QAASx0D,GAAI,EAAGA,GAAIw0D,GAAM,OAAQ,EAAEx0D,GAAG,CACrC,IAAI+pH,GAAUJ,EAAUn1D,GAAMx0D,EAAC,EAAGopH,GAAM3lD,EAAO,EAC3CsmD,KAAYv1D,GAAMx0D,EAAC,IACjB8pH,KAAat1D,KACfs1D,GAAWt1D,GAAM,SAEnBs1D,GAAS9pH,EAAC,EAAI+pH,GAEjB,CAEH,OAAOD,EACR,CAUD,SAASH,EAAUtmH,GAAM+lH,GAAM3lD,GAAS,CAKtC,GAAI2lD,GAAK,UACP,QAAS7lD,MAAU6lD,GAAK,SACtB,QAAS5jH,MAAY4jH,GAAK,SAAS7lD,EAAM,EACvC,GAAI0jD,EAAY1jD,GAAQ/9D,GAAUi+D,EAAO,IAAM2lD,GAAK,SAAS7lD,EAAM,EAAE/9D,EAAQ,EAC3E,OAAOnC,GAKf,IAAI2mH,GAAgBzC,EAAa6B,GAAK,cAAe3lD,EAAO,EAGxDlvC,GAAMlxB,GAKV,GAAIkxB,cAAew3C,GAAgBx3C,cAAe+7C,EAAc,CAC9D,IAAI25C,EAAUJ,EAAQt1F,GAAI,KAAM60F,GAAM3lD,EAAO,EACzCwmD,IAAY11F,GAAI,OAClBA,GAAMA,GAAI,QACVA,GAAI,KAAO01F,EAEnB,SAAe11F,cAAe85C,GACxB,GAAI95C,GAAI,QAAS,CACf,IAAI21F,GAAaP,EAAUp1F,GAAI,QAAS60F,GAAM3lD,EAAO,EACjDymD,KAAe31F,GAAI,UACrBA,GAAM,IAAI85C,EAAgB67C,EAAU,EAEvC,UACQ31F,cAAeyxC,EAAW,CACnC,IAAImkD,GAAWN,EAAQt1F,GAAI,MAAO60F,GAAM3lD,EAAO,EAC3C0mD,KAAa51F,GAAI,QACnBA,GAAM,IAAIyxC,EAAUmkD,EAAQ,EAEpC,SAAe51F,cAAewwC,EAAc,CACtC,IAAIqlD,GAAS71F,GAAI,OACbA,GAAI,SACN61F,GAAST,EAAUp1F,GAAI,OAAQ60F,GAAM3lD,EAAO,GAE9C,IAAI4mD,GAAW91F,GAAI,MACfA,GAAI,QACN81F,GAAWV,EAAUp1F,GAAI,MAAO60F,GAAM3lD,EAAO,IAE3C2mD,KAAW71F,GAAI,QAAU81F,KAAa91F,GAAI,SAC5CA,GAAM,IAAIwwC,EAAaqlD,GAAQC,EAAQ,EAE/C,SAAe91F,cAAe02C,EAAW,CACnC,IAAIq/C,GAAUT,EAAQt1F,GAAI,WAAY60F,GAAM3lD,EAAO,EAC/C6mD,KAAY/1F,GAAI,aAClBA,GAAM,IAAI02C,EAAUq/C,EAAO,EAEnC,SAAe/1F,cAAek3C,EAAY,CACpC,IAAIjyC,GAAU,GACV+wF,GAAW,CAAA,EACf,QAASxlH,MAAQwvB,GAAI,WACnBg2F,GAASxlH,EAAI,EAAI4kH,EAAUp1F,GAAI,WAAWxvB,EAAI,EAAGqkH,GAAM3lD,EAAO,EAC1D8mD,GAASxlH,EAAI,IAAMwvB,GAAI,WAAWxvB,EAAI,IACxCy0B,GAAU,IAGVA,KACFjF,GAAM,IAAIk3C,EAAW8+C,EAAQ,EAEhC,CAGD,IAAIC,GAAOpB,GAAK,EACZrgH,GAAU0hH,GAAWrB,GAAK,EAAG70F,GAAKy1F,EAAa,EAAE,CAAC,EAkBtD,GAdI,CAACjhH,IAAWqgH,GAAK,WACnBoB,GAAOpB,GAAK,SAAS,EACrBrgH,GAAU0hH,GAAWrB,GAAK,SAAS,EAAG70F,GAAKy1F,EAAa,EAAE,CAAC,GAGzD,CAACjhH,IAAWqgH,GAAK,cACnBoB,GAAOpB,GAAK,YAAY,EACxBrgH,GAAU0hH,GAAWrB,GAAK,YAAY,EAAG70F,GAAKy1F,EAAa,EAAE,CAAC,EACzDjhH,KAEHyhH,GAAOpB,GAAK,YAAY,EACxBrgH,GAAU0hH,GAAWrB,GAAK,YAAY,EAAG70F,GAAKy1F,EAAa,EAAE,CAAC,IAG9DjhH,GAAS,CAKX,IAAIq+D,GAAW7yC,GAAI,SACnBA,GAAMi2F,GAAK,QACPpjD,IAAY,aAAcojD,KAC5Bj2F,GAAI,SAAW,IAIjBA,GAAMA,GAAI,UAAU,SAAUlxB,GAAM,CAClC,OAAIA,GAAK,iBAAoB4C,GAAQ,gBAAgB8C,GAAQ,aAAc1F,GAAK,IAAI,EAC3E0F,GAAQ,aAAa1F,GAAK,IAAI,EAAE,MAAK,EAErCA,EAEjB,CAAO,CAIF,CAED,OAAI+lH,GAAK,QAAU70F,KAAQlxB,KACzBkxB,GAAMo1F,EAAUp1F,GAAK60F,GAAM3lD,EAAO,GAE7BlvC,EACR,CAUD,SAASm2F,GAAUrnH,GAAMogE,GAAS,CAChC,IAAIlvC,GAAM,CAAA,EACNorF,GAAOgL,GACP5C,GAAWC,EAAuB3kH,EAAI,EAC1C,GAAIgkH,EAAchkH,GAAMogE,EAAO,EAC7B,QAASzjE,GAAI,EAAGA,GAAIqD,GAAK,KAAK,OAAQrD,KACpC2qH,GAAYtnH,GAAK,KAAK,MAAM,CAAC,EAC7BsnH,GAAU,OAAO3qH,GAAG,CAAC,EACrB2/G,GAAQgL,GAAU,SAAW,EAAIA,GAAU,CAAC,EAAI5C,GAAS4C,EAAS,EAClEp2F,GAAI,KAAKwzF,GAAS,CAAC1kH,GAAK,KAAKrD,EAAC,EAAG2/G,EAAK,CAAC,CAAC,MAI1C,SAASx6F,EAAM,EAAGA,EAAM9hB,GAAK,KAAK,OAAQ8hB,IAAO,CAC/C,IAAIy6F,GAAOv8G,GAAK,KAAK,CAAC,EAClB8hB,EAAM,IACRy6F,GAAOmI,GAAS1kH,GAAK,KAAK,MAAM,EAAG8hB,CAAG,CAAC,GAEzCwlG,GAAYtnH,GAAK,KAAK,MAAM8hB,CAAG,EAC/Bw6F,GAAQgL,GAAU,SAAW,EAAIA,GAAU,CAAC,EAAI5C,GAAS4C,EAAS,EAClEp2F,GAAI,KAAKwzF,GAAS,CAACnI,GAAMD,EAAK,CAAC,CAAC,CACjC,CAEH,OAAOprF,EACR,CAKD,SAASq2F,EAAWC,GAAQC,GAAQ,CAClC,IAAIv2F,GAAM,CACR,aAAc,CAAE,CACtB,EAGI,GAAI,CAACs2F,GAAO,cAAgB,CAACC,GAAO,aAClC,OAAOv2F,GACF,GAAKs2F,GAAO,cAEZ,GAAI,CAACC,GAAO,aACjB,OAAOD,OAFP,QAAOC,GAMT,QAAS5qH,MAAO2qH,GAAO,aACrB,MAAQ5kH,GAAQ,gBAAgB4kH,GAAO,aAAc3qH,EAAG,IACtDq0B,GAAI,aAAar0B,EAAG,EAAI2qH,GAAO,aAAa3qH,EAAG,KACvC+F,GAAQ,gBAAgB6kH,GAAO,aAAc5qH,EAAG,GAClD,CAAC6qH,GAAYF,GAAO,aAAa3qH,EAAG,EAAG4qH,GAAO,aAAa5qH,EAAG,CAAC,GACjE,OAAO,KAKf,QAAS4kB,MAAQgmG,GAAO,gBACd7kH,GAAQ,gBAAgB6kH,GAAO,aAAchmG,EAAI,IACvDyP,GAAI,aAAazP,EAAI,EAAIgmG,GAAO,aAAahmG,EAAI,GAGrD,OAAOyP,EACR,CAMD,SAASy2F,EAAoBC,GAAOC,GAAO,CACzC,IAAI32F,GAAM,CAAA,EACV,GAAI02F,GAAM,SAAW,GAAKC,GAAM,SAAW,EACzC,OAAO32F,GAGT,QADImzF,GACKyD,GAAK,EAAGA,GAAKF,GAAM,OAAQE,KAClC,QAASC,GAAK,EAAGA,GAAKF,GAAM,OAAQE,KAClC1D,GAASkD,EAAWK,GAAME,EAAE,EAAGD,GAAME,EAAE,CAAC,EACpC1D,IACFnzF,GAAI,KAAKmzF,EAAM,EAIrB,OAAOnzF,EACR,CAOD,SAAS82F,GAAkBC,GAAc,CACvC,GAAIA,GAAa,SAAW,EAC1B,OAAOA,GAKT,QAHIC,GAAOD,GAAa,OAAON,CAAmB,EAC9CQ,GAAa,CAAA,EACb9rD,GAAS,CAAA,EACJ1/D,GAAI,EAAGA,GAAIurH,GAAK,OAAQvrH,KAAK,CACpC,IAAIgL,GAAI,KAAK,UAAUugH,GAAKvrH,EAAC,CAAC,EACzB0/D,GAAO10D,EAAC,IACX00D,GAAO10D,EAAC,EAAI,GACZwgH,GAAW,KAAKD,GAAKvrH,EAAC,CAAC,EAE1B,CACD,OAAOwrH,EACR,CAaD,SAASf,GAAWrB,GAAM/lH,GAAMogE,GAASgoD,GAAS,CAMhD,IAAIl3F,GAAM,CAAC,CACT,aAAc,CAAE,CACtB,CAAK,EACD,GAAI60F,cAAgBr9C,GAAgB1oE,cAAgB0oE,GAAgBq9C,cAAgB94C,GAAgBjtE,cAAgBitE,EAAc,CAEhI,GAAI84C,cAAgBr9C,GAClB,GAAIq9C,GAAK,KAAO/lH,GAAK,IAAM+lH,GAAK,KAAO/lH,GAAK,GAC1C,MAAO,WAEA+lH,cAAgB94C,GACrB84C,GAAK,OAAS/lH,GAAK,KACrB,MAAO,GAKX,GAAIA,GAAK,KAAK,SAAW,GAAK+lH,GAAK,KAAK,SAAW,GAAK,CAAC9B,EAAcjkH,GAAMogE,EAAO,GAAKpgE,GAAK,KAAK,SAAW+lH,GAAK,KAAK,QAAUqC,GAAS,CAIzI,QADIH,GAAe,CAAA,EACVtrH,GAAI,EAAGA,GAAIopH,GAAK,KAAK,OAAQppH,KAAK,CACzC,IAAI0rH,EAAajB,GAAWrB,GAAK,KAAKppH,EAAC,EAAGqD,GAAK,KAAKrD,EAAC,EAAGyjE,EAAO,EAC/D,GAAIioD,EAAW,SAAW,EAExB,MAGFJ,GAAa,KAAKI,CAAU,CAC7B,CACD,GAAIJ,GAAa,SAAWlC,GAAK,KAAK,OAAQ,CAC5C,GAAI,CAAC/B,EAAchkH,GAAMogE,EAAO,GAEhC2lD,GAAK,KAAK,SAAW,EAEnB,MAAO,GAET,GAAIA,GAAK,KAAK,OAAS,EAKrB,MAAM,IAAI,MAAM,6EAA6E,EAG/F,IAAIuC,GAAYlB,GAAWrB,GAAK,KAAK,CAAC,EAAG/lH,GAAK,KAAK,CAAC,EAAGogE,EAAO,EAC9D,GAAIkoD,GAAU,SAAW,EACvB,MAAO,GAET,IAAIC,GAAanB,GAAWrB,GAAK,KAAK,CAAC,EAAG/lH,GAAK,KAAK,CAAC,EAAGogE,EAAO,EAC/D,GAAImoD,GAAW,SAAW,EACxB,MAAO,GAETN,GAAe,CAACK,GAAWC,EAAU,CACtC,CACDr3F,GAAM82F,GAAkBC,EAAY,CAC5C,SAAiBjoH,GAAK,KAAK,QAAU,GAAK+lH,GAAK,KAAK,SAAW,EAAG,CAM1D,QAFIyC,GAASnB,GAAUrnH,GAAMogE,EAAO,EAChCqoD,GAAe,CAAA,EACVjlF,GAAM,EAAGA,GAAMglF,GAAO,OAAQhlF,KAAO,CAC5C,IAAIklF,GAAWtB,GAAWrB,GAAMyC,GAAOhlF,EAAG,EAAG48B,GAAS,EAAI,EAC1DqoD,GAAeA,GAAa,OAAOC,EAAQ,CAC5C,CACD,OAAOD,EACR,KAAM,IAAI1C,GAAK,KAAK,OAAS,EAC5B,MAAM,MAAM,+CAAiDA,GAAK,SAAU,CAAA,EAG5E,MAAO,GAEf,SAAeA,cAAgBv5C,EAAY,CAIrC,GAAIu5C,GAAK,KAAK,SAAW,EACvB,MAAM,IAAI,MAAM,kCAAkC,EAEpD,GAAIZ,EAAoBY,GAAK,IAAI,GAE/B,GAAIA,GAAK,OAAS/lH,GAAK,KACrB,MAAO,OAIT,QAAQ+lH,GAAK,KAAK,CAAC,GAAK,KAAOA,GAAK,KAAK,CAAC,GAAK,IAAMA,GAAK,KAAK,UAAU,EAAG,CAAC,EAAIA,GAAK,KAAK,CAAC,EAAC,CAC3F,IAAK,IACL,IAAK,KAIH70F,GAAI,CAAC,EAAE,aAAa60F,GAAK,IAAI,EAAI/lH,GACjC,MACF,IAAK,IACL,IAAK,KAEH,MAAQ8kH,GAAW,gBAAgB9kH,EAAI,EACrCkxB,GAAI,CAAC,EAAE,aAAa60F,GAAK,IAAI,EAAI/lH,OAGjC,OAAO,GAET,MACF,IAAK,IAEH,GAAI,IAAK8kH,GAAW,gBAAgB9kH,EAAI,EACtCkxB,GAAI,CAAC,EAAE,aAAa60F,GAAK,IAAI,EAAI/lH,OAGjC,OAAO,GAET,MACF,IAAK,KAEH,MAAQ8kH,GAAW,gBAAgB9kH,EAAI,EACrCkxB,GAAI,CAAC,EAAE,aAAa60F,GAAK,IAAI,EAAI/lH,OAGjC,OAAO,GAET,MACF,IAAK,KAEH,MAAQ8kH,GAAW,eAAe9kH,EAAI,EACpCkxB,GAAI,CAAC,EAAE,aAAa60F,GAAK,IAAI,EAAI/lH,OAGjC,OAAO,GAET,MACF,IAAK,KAEH,GAAI,IAAK8kH,GAAW,eAAe9kH,EAAI,EACrCkxB,GAAI,CAAC,EAAE,aAAa60F,GAAK,IAAI,EAAI/lH,OAGjC,OAAO,GAET,MACF,IAAK,KAEH,MAAQ8kH,GAAW,sBAAsB9kH,EAAI,EAC3CkxB,GAAI,CAAC,EAAE,aAAa60F,GAAK,IAAI,EAAI/lH,OAGjC,OAAO,GAET,MACF,IAAK,KAEH,GAAI,IAAK8kH,GAAW,sBAAsB9kH,EAAI,EAC5CkxB,GAAI,CAAC,EAAE,aAAa60F,GAAK,IAAI,EAAI/lH,OAGjC,OAAO,GAET,MACF,QACE,MAAM,IAAI,MAAM,2BAA6B+lH,GAAK,IAAI,CACzD,CAET,SAAeA,cAAgB9+C,GAEzB,GAAI,CAAC/wB,EAAM6vE,GAAK,MAAO/lH,GAAK,KAAK,EAC/B,MAAO,OAIT,OAAO,GAMT,OAAOkxB,EACR,CASD,SAASw2F,GAAYpgH,GAAG4gB,GAAG,CACzB,GAAI5gB,cAAa2/D,GAAgB/+C,cAAa++C,GAC5C,GAAI,CAAC/wB,EAAM5uC,GAAE,MAAO4gB,GAAE,KAAK,EACzB,MAAO,WAEA5gB,cAAaklE,GAActkD,cAAaskD,GACjD,GAAIllE,GAAE,OAAS4gB,GAAE,KACf,MAAO,WAEA5gB,cAAaohE,GAAgBxgD,cAAawgD,GAAgBphE,cAAa2lE,GAAgB/kD,cAAa+kD,EAAc,CAC3H,GAAI3lE,cAAaohE,GACf,GAAIphE,GAAE,KAAO4gB,GAAE,IAAM5gB,GAAE,KAAO4gB,GAAE,GAC9B,MAAO,WAEA5gB,cAAa2lE,GAClB3lE,GAAE,OAAS4gB,GAAE,KACf,MAAO,GAGX,GAAI5gB,GAAE,KAAK,SAAW4gB,GAAE,KAAK,OAC3B,MAAO,GAET,QAASvrB,GAAI,EAAGA,GAAI2K,GAAE,KAAK,OAAQ3K,KACjC,GAAI,CAAC+qH,GAAYpgH,GAAE,KAAK3K,EAAC,EAAGurB,GAAE,KAAKvrB,EAAC,CAAC,EACnC,MAAO,EAGjB,KACM,OAAO,GAET,MAAO,EACR,CACD,OAAOumF,CACT,CAAC,EACDA,GAAA,eAAyB8hC,cC9uCrB1oH,IAAyBY,GAC7B,OAAO,eAAekmF,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC6BA,GAAA,uBAAG,OACjC,IAAIxjF,IAAWtD,IAAuBuD,EAAwC,EAC1EsB,GAAMC,GACN8gB,IAAWre,EACXkhH,IAAQnsG,GACR+kC,GAAQv7B,GACZ,SAAS7B,IAA2BtjB,EAAGujB,EAAgB,CAAE,IAAIC,EAAK,OAAO,OAAW,KAAexjB,EAAE,OAAO,QAAQ,GAAKA,EAAE,YAAY,EAAG,GAAI,CAACwjB,EAAI,CAAE,GAAI,MAAM,QAAQxjB,CAAC,IAAMwjB,EAAKC,IAA4BzjB,CAAC,IAAMujB,GAAkBvjB,GAAK,OAAOA,EAAE,QAAW,SAAU,CAAMwjB,IAAIxjB,EAAIwjB,GAAI,IAAI9jB,EAAI,EAAOgkB,EAAI,UAAa,GAAI,MAAO,CAAE,EAAGA,EAAG,EAAG,UAAa,CAAE,OAAIhkB,GAAKM,EAAE,OAAe,CAAE,KAAM,EAAI,EAAW,CAAE,KAAM,GAAO,MAAOA,EAAEN,GAAG,EAAI,EAAI,EAAG,SAAWikB,EAAI,CAAE,MAAMA,CAAG,EAAI,EAAGD,CAAG,CAAG,CAAC,MAAM,IAAI,UAAU;AAAA,mFAAuI,CAAI,CAAC,IAAIE,EAAmB,GAAMC,EAAS,GAAOlX,EAAK,MAAO,CAAE,EAAG,UAAa,CAAE6W,EAAKA,EAAG,KAAKxjB,CAAC,CAAE,EAAI,EAAG,UAAa,CAAE,IAAI8jB,EAAON,EAAG,KAAM,EAAE,OAAAI,EAAmBE,EAAK,KAAaA,CAAO,EAAE,EAAG,SAAWC,EAAK,CAAEF,EAAS,GAAMlX,EAAMoX,CAAM,EAAE,EAAG,UAAa,CAAE,GAAI,CAAM,CAACH,GAAoBJ,EAAG,QAAa,MAAMA,EAAG,OAAS,CAAG,QAAW,CAAE,GAAIK,EAAQ,MAAMlX,CAAI,CAAI,CAAA,CAAK,CAC5+B,SAAS8W,IAA4BzjB,EAAGwe,EAAQ,CAAE,GAAKxe,EAAW,IAAI,OAAOA,GAAM,SAAU,OAAOgkB,GAAkBhkB,EAAGwe,CAAM,EAAG,IAAI,EAAI,OAAO,UAAU,SAAS,KAAKxe,CAAC,EAAE,MAAM,EAAG,EAAE,EAAgE,GAAzD,IAAM,UAAYA,EAAE,cAAa,EAAIA,EAAE,YAAY,MAAU,IAAM,OAAS,IAAM,MAAO,OAAO,MAAM,KAAKA,CAAC,EAAG,GAAI,IAAM,aAAe,2CAA2C,KAAK,CAAC,EAAG,OAAOgkB,GAAkBhkB,EAAGwe,CAAM,EAAI,CACha,SAASwF,GAAkB3O,EAAK3Q,EAAK,EAAMA,GAAO,MAAQA,EAAM2Q,EAAI,UAAQ3Q,EAAM2Q,EAAI,QAAQ,QAAS3V,EAAI,EAAGukB,EAAO,IAAI,MAAMvf,CAAG,EAAGhF,EAAIgF,EAAKhF,IAAOukB,EAAKvkB,CAAC,EAAI2V,EAAI3V,CAAC,EAAK,OAAOukB,CAAO,CACvL,IAAIxd,IAAO,mBACPia,IAAe,CAAC,QAAS,SAAU,oBAAqB,SAAU,YAAa,aAAc,eAAgB,YAAa,eAAgB,eAAgB,YAAa,aAAc,eAAgB,YAAY,EACjNgrG,OAA4CzmG,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CACpG,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdw9C,EAAoBx9C,EAAK,kBACzBU,EAASV,EAAK,OACd2jB,EAAW3jB,EAAK,SAChBsjB,EAAYtjB,EAAK,UACjBm/C,EAAen/C,EAAK,aACpBogD,EAAYpgD,EAAK,UACjB0kD,EAAe1kD,EAAK,aACpB0qD,EAAe1qD,EAAK,aACpBqlD,EAAYrlD,EAAK,UACjB6lD,EAAa7lD,EAAK,WAClBmmD,EAAenmD,EAAK,aACpBiqD,EAAajqD,EAAK,WAChB0iG,KAAkBF,IAAM,YAAY,CACpC,aAAc93C,EACd,aAAcvE,EACd,WAAY8D,CAClB,CAAK,EACDw3C,EAAgBiB,EAAY,cAC5BhB,EAAgBgB,EAAY,cAC5BX,EAAcW,EAAY,YAC1BN,EAAyBM,EAAY,uBA6BnC7hC,EAAmBx+E,EAAM,mBAAoB,CAC/C,KAAM,SAAc5E,EAAM,CACxB,OAAO4oH,EAAYC,EAAa7oH,EAAM,CAAA,CAAE,CAAC,CAC1C,EACD,eAAgB,SAAoBmgE,EAAMj9D,EAAS,CACjD,OAAO0lH,EAAYC,EAAa1oD,EAAMj9D,CAAO,CAAC,CAC/C,CACL,CAAG,EACD,SAAS4lH,EAAiBC,EAAO,CAC/B,SAAQ5nH,GAAI,YAAY4nH,CAAK,EACpBA,EAAM,UAEXA,aAAiB,MACZA,EAAM,IAAID,CAAgB,KAE3B3nH,GAAI,UAAU4nH,CAAK,EAClB9lG,EAAO6lG,EAAiBC,EAAM,QAAO,CAAE,CAAC,EAE1CA,CACR,CACD,SAASC,EAAMC,EAAQ9/G,EAAMjG,EAAS,CACpC,GAAI,CACF,OAAO68D,EAAkBkpD,CAAM,EAAE,MAAM,KAAM9/G,CAAI,CAClD,MAAgB,CAEf,OAAAA,EAAOA,EAAK,IAAI2/G,CAAgB,EACzBI,EAAUnpD,EAAkBkpD,CAAM,EAAE,MAAM,KAAM9/G,CAAI,EAAGjG,CAAO,CACtE,CACF,CACD,IAAIimH,EAAUvkH,EAAM,CAClB,SAAUwkH,EACV,OAAQ,SAAgB9zG,EAAG,CACzB,OAAIA,EAAI,EACC+zG,EAAe,IAAIpiD,EAAa,CAAC3xD,CAAC,CAAC,EAErC,IAAI2xD,EAAa3xD,CAAC,CAC1B,EACD,UAAW,SAAmBA,EAAG,CAC/B,OAAIA,EAAI,EACC+zG,EAAe,IAAIpiD,EAAa,CAAC3xD,CAAC,CAAC,EAErC,IAAI2xD,EAAa3xD,CAAC,CAC1B,EAED,QAAS,SAAiB3N,EAAG,CAC3B,MAAM,IAAI,MAAM,uCAAuC,CACxD,EACD,OAAQ,SAAgBA,EAAG,CACzB,OAAO,IAAIs/D,EAAat/D,CAAC,CAC1B,EACD,OAAQ,SAAgBse,EAAG,CACzB,OAAO,IAAI08C,EAAU18C,EAAE,QAAO,EAAG,IAAI,SAAUlQ,EAAG,CAChD,OAAOozG,EAAQpzG,CAAC,CACjB,CAAA,CAAC,CACH,CACL,CAAG,EACD,SAAS6yG,EAAYG,EAAO,CAC1B,SAAQ5nH,GAAI,QAAQ4nH,CAAK,EAChBA,EAEFI,EAAQJ,CAAK,CACrB,CAID,SAASO,EAAeh0G,EAAGpS,EAAS,CAClC,IAAIqmH,EAAiBrmH,GAAWA,EAAQ,iBAAmB,GAC3D,GAAIqmH,GAAkB,SAASj0G,CAAC,GAAK4wB,EAAU,CAC7C,IAAInjB,EAAImjB,EAAS5wB,CAAC,EACdk0G,EAAiBtmH,GAAW,OAAOA,EAAQ,gBAAmB,SAAWA,EAAQ,eAAiB,IAEtG,GAAI6f,EAAE,QAAS,IAAKzN,GAAKyN,EAAE,EAAIymG,GAAkBzmG,EAAE,EAAIymG,EACrD,OAAOzmG,CAEV,CACD,OAAOzN,CACR,CAID,IAAI4zG,EAAYtkH,EAAM,CACpB,iBAAkB,SAAsB+C,EAAGzE,EAAS,CAClD,GAAIpG,EAAO,SAAW,YACpB,OAAI+oC,IAAc,WACZ8X,GAAM,eAEL9X,EAAUl+B,CAAC,EACb,GAAI7K,EAAO,SAAW,WAC3B,OAAIopC,IAAa,WACXyX,GAAM,cAELzX,EAASv+B,CAAC,EAEjB,IAAI2N,EAAI,WAAW3N,CAAC,EACpB,OAAO2hH,EAAeh0G,EAAGpS,CAAO,CAEnC,EACD,mBAAoB,SAAwByE,EAAGzE,EAAS,CACtD,OAAOyE,CACR,EAGD,oBAAqB,SAAyBA,EAAGzE,EAAS,CACxD,OAAOyE,CACR,EAGD,iBAAkB,SAAsBA,EAAGzE,EAAS,CAClD,OAAOomH,EAAe3hH,EAAGzE,CAAO,CACjC,EACD,kBAAmB,SAAuByE,EAAGzE,EAAS,CACpD,OAAIyE,EAAE,KAAO,EACJA,EAEF2hH,EAAe3hH,EAAE,GAAIzE,CAAO,CACpC,EACD,iBAAkB,SAAsByE,EAAGzE,EAAS,CAClD,OAAO+f,EAAOqmG,EAAe3hH,EAAE,QAAO,CAAE,CAAC,CAC1C,EACD,gBAAiB,SAAqBA,EAAGzE,EAAS,CAChD,OAAOyE,EAAE,IAAI2hH,CAAc,CAC5B,CACL,CAAG,EACD,SAASD,EAAe/zG,EAAG,CACzB,OAAO,IAAIozD,EAAa,IAAK,aAAc,CAACpzD,CAAC,CAAC,CAC/C,CACD,SAAS8zG,EAAgBrmG,EAAG,CAC1B,IAAIzN,EACAm0G,EAAK1mG,EAAE,EAAIA,EAAE,EAMjB,OALI0mG,EAAK,EACPn0G,EAAI,IAAIozD,EAAa,IAAK,aAAc,CAAC,IAAIzB,EAAa,CAACwiD,CAAE,CAAC,CAAC,EAE/Dn0G,EAAI,IAAI2xD,EAAawiD,CAAE,EAErB1mG,EAAE,IAAM,EACHzN,EAEF,IAAIozD,EAAa,IAAK,SAAU,CAACpzD,EAAG,IAAI2xD,EAAalkD,EAAE,CAAC,CAAC,CAAC,CAClE,CAGD,SAAS2mG,EAAcntH,EAAK6M,EAAOlG,EAAS,CAC1C,GAAI,IAAK/B,GAAI,aAAaiI,CAAK,EAE7B,OAAO,IAAIs4D,EAAaknD,EAAYrsH,CAAG,EAAGqsH,EAAYx/G,CAAK,CAAC,EAE9D,MAAQjI,GAAI,aAAa5E,CAAG,MAAS4E,GAAI,UAAU5E,CAAG,EAAG,CAQvD,QAPIotH,EAAgB,MAAM,KAAKvgH,EAAM,UAAU,EAOxCugH,EAAc,OAAS,GAC5B,MAAQxoH,GAAI,gBAAgBwoH,EAAc,CAAC,CAAC,GAAK,OAAOA,EAAc,CAAC,EAAE,OAAU,SAAU,CAC3F,IAAI9yG,EAAQqyG,EAAUS,EAAc,MAAK,EAAG,MAAOzmH,CAAO,KAClD/B,GAAI,aAAa5E,CAAG,EAC1BA,EAAMA,EAAI,MAAMsa,EAAQ,CAAC,GAGzBta,EAAMA,EAAI,QAAS,EAACsa,EAAQ,CAAC,EACzBta,aAAe,QACjBA,EAAM0mB,EAAO1mB,CAAG,GAG9B,SAAmBotH,EAAc,OAAS,MAASxoH,GAAI,gBAAgBwoH,EAAc,CAAC,CAAC,GAAK,OAAOA,EAAc,CAAC,EAAE,OAAU,SAAU,CAC9H,IAAIC,EAASV,EAAUS,EAAc,CAAC,EAAE,MAAOzmH,CAAO,EAClD2mH,GAAW,CAAA,EACXC,KAAgB3oH,GAAI,aAAa5E,CAAG,EAAIA,EAAI,MAAQA,EAAI,UACxD8kB,EAAYd,IAA2BupG,CAAS,EAClDxoG,GACF,GAAI,CACF,IAAKD,EAAU,EAAC,EAAI,EAAEC,GAAQD,EAAU,EAAG,GAAE,MAAO,CAClD,IAAI5d,GAAO6d,GAAM,MACjB,MAAQngB,GAAI,aAAasC,EAAI,EAC3BomH,GAAS,KAAKpmH,GAAK,MAAMmmH,EAAS,CAAC,CAAC,aACvBzoH,GAAI,UAAU5E,CAAG,EAC9BstH,GAAS,KAAKpmH,GAAKmmH,EAAS,CAAC,CAAC,MAE9B,MAEH,CACF,OAAQhgH,GAAK,CACZyX,EAAU,EAAEzX,EAAG,CAC3B,QAAoB,CACRyX,EAAU,EAAC,CACZ,CACD,GAAIwoG,GAAS,SAAWC,EAAU,UACxB3oH,GAAI,aAAa5E,CAAG,EAC1BA,EAAM,IAAIomE,EAAUknD,EAAQ,EAG5BttH,EAAM0mB,EAAO4mG,EAAQ,EAEvBF,EAAc,OAAO,EAAG,CAAC,MAGzB,MAEZ,KAEU,OAGJ,OAAIA,EAAc,SAAWvgH,EAAM,WAAW,OAErC,IAAIs4D,EAAaknD,EAAYrsH,CAAG,EAAG6M,CAAK,EAE7CugH,EAAc,OAAS,GAEzBvgH,EAAQ,IAAIw+D,EAAU+hD,CAAa,EAC5B,IAAIjoD,EAAaknD,EAAYrsH,CAAG,EAAG6M,CAAK,GAG1C7M,CACR,CACD,MAAQ4E,GAAI,cAAc5E,CAAG,GAAK6M,EAAM,WAAW,SAAW,MAASjI,GAAI,gBAAgBiI,EAAM,WAAW,CAAC,CAAC,EAAG,CAC/G,IAAIvM,GAAMuM,EAAM,WAAW,CAAC,EAAE,MAC9B,OAAIvM,MAAON,EAAI,WACNA,EAAI,WAAWM,EAAG,EAEpB,IAAIoqE,CACZ,CAED,OAAO,IAAIvF,EAAaknD,EAAYrsH,CAAG,EAAG6M,CAAK,CAChD,CAYD,SAAS2gH,EAAOjkH,EAAIqD,EAAMu7G,EAAUxhH,EAAS,CAC3C,IAAI2T,EAAQ1N,EAAK,QAIb6gH,EAAY7gH,EAAK,OAAO,SAAU8gH,GAAOttG,EAAM,CACjD,GAAI,IAAKxb,GAAI,QAAQwb,CAAI,EAAG,CAC1B,IAAIlU,EAAOwhH,GAAM,MACjB,MAAQ9oH,GAAI,QAAQsH,CAAI,EACtB,MAAO,CAACA,EAAMkU,CAAI,EAGpB,GAAI,CACF,OAAAstG,GAAM,KAAKjB,EAAMljH,EAAI,CAAC2C,EAAMkU,CAAI,EAAGzZ,CAAO,CAAC,EACpC+mH,EACR,MAA2B,CAC1BA,GAAM,KAAKxhH,CAAI,CAEhB,CACF,CAIDwhH,GAAM,KAAKrB,EAAYqB,GAAM,IAAG,CAAE,CAAC,EACnC,IAAIC,GAAUD,GAAM,SAAW,EAAIA,GAAM,CAAC,EAAIvF,EAASuF,EAAK,EAC5D,MAAO,CAACvF,EAAS,CAACwF,GAAStB,EAAYjsG,CAAI,CAAC,CAAC,CAAC,CACpD,EAAO,CAAC9F,CAAK,CAAC,EACV,OAAImzG,EAAU,SAAW,EAChBA,EAAU,CAAC,EAGbtF,EAAS,CAACsF,EAAU,CAAC,EAAGb,EAAQa,EAAU,CAAC,CAAC,CAAC,CAAC,CACtD,CAGD,SAASnB,EAAa7oH,EAAMkD,EAAS,CACnC,OAAQlD,EAAK,KAAI,CACf,IAAK,aACH,OAAOA,EACT,IAAK,eACH,UAAYJ,IAAS,SAAYI,EAAK,KAAK,EAAC,CAC1C,IAAK,SACH,OAAOkpH,EAAUlpH,EAAK,MAAOkD,CAAO,EACtC,IAAK,SACH,OAAOlD,EAAK,MACd,QACE,GAAI,CAAC,MAAMA,EAAK,KAAK,EAAG,OAAOkpH,EAAUlpH,EAAK,MAAOkD,CAAO,CAC/D,CACD,OAAOlD,EACT,IAAK,eACH,GAAI+/D,EAAkB//D,EAAK,IAAI,GAAK+/D,EAAkB//D,EAAK,IAAI,EAAE,QAC/D,OAAOA,EAET,CAEE,IAAImqH,EAAoB,CAAC,MAAO,UAAU,EAC1C,GAAIA,EAAkB,QAAQnqH,EAAK,IAAI,IAAM,GAAI,CAC/C,IAAImJ,EAAOnJ,EAAK,KAAK,IAAI,SAAU8M,GAAK,CACtC,OAAO+7G,EAAa/7G,GAAK5J,CAAO,CAC9C,CAAa,EAGD,GAAI,CAACiG,EAAK,KAAKhI,GAAI,MAAM,EACvB,GAAI,CACF,OAAO6nH,EAAMhpH,EAAK,KAAMmJ,EAAMjG,CAAO,CACrD,MAA0C,CAAE,CAIhC,GAAIlD,EAAK,OAAS,QAAUmJ,EAAK,SAAW,MAAShI,GAAI,aAAagI,EAAK,CAAC,CAAC,EAAG,CAG9E,QAFIihH,EAAK,CAAA,EACLC,EAAUlhH,EAAK,CAAC,KACThI,GAAI,aAAakpH,CAAO,GACjCD,EAAG,KAAKC,EAAQ,MAAM,MAAM,EAC5BA,EAAUA,EAAQ,MAAM,CAAC,EAE3B,OAAOpnG,EAAOmnG,CAAE,CACjB,CAGD,OAAO,IAAIn9C,EAAajtE,EAAK,KAAMmJ,EAAK,IAAIy/G,CAAW,CAAC,CAGzD,CACF,CAEH,IAAK,eACH,CACE,IAAI9iH,GAAK9F,EAAK,GAAG,SAAQ,EACrBsqH,EACAp5F,EACAwzF,GAAWC,EAAuB3kH,CAAI,EAC1C,MAAQmB,GAAI,gBAAgBnB,CAAI,GAAKA,EAAK,UACxCsqH,EAAQ,CAACzB,EAAa7oH,EAAK,KAAK,CAAC,EAAGkD,CAAO,CAAC,KACnC/B,GAAI,QAAQmpH,EAAM,CAAC,CAAC,EAG3Bp5F,EAAMwzF,GAAS4F,CAAK,EAFpBp5F,EAAM83F,EAAMljH,GAAIwkH,EAAOpnH,CAAO,UAIvB+gH,EAAcjkH,EAAMkD,EAAQ,OAAO,EAK5C,GAJAonH,EAAQhG,EAAYtkH,EAAMkD,EAAQ,OAAO,EACzConH,EAAQA,EAAM,IAAI,SAAUx9G,GAAK,CAC/B,OAAO+7G,EAAa/7G,GAAK5J,CAAO,CAC9C,CAAa,EACG8gH,EAAcl+G,GAAI5C,EAAQ,OAAO,EAAG,CAItC,QAFIqnH,GAAS,CAAA,EACTC,GAAO,CAAA,EACF7tH,GAAI,EAAGA,GAAI2tH,EAAM,OAAQ3tH,QACvBwE,GAAI,QAAQmpH,EAAM3tH,EAAC,CAAC,EAG3B6tH,GAAK,KAAKF,EAAM3tH,EAAC,CAAC,EAFlB4tH,GAAO,KAAKD,EAAM3tH,EAAC,CAAC,EAKpB4tH,GAAO,OAAS,GAClBr5F,EAAM64F,EAAOjkH,GAAIykH,GAAQ7F,GAAUxhH,CAAO,EAC1CsnH,GAAK,QAAQt5F,CAAG,EAChBA,EAAM64F,EAAOjkH,GAAI0kH,GAAM9F,GAAUxhH,CAAO,GAGxCguB,EAAM64F,EAAOjkH,GAAIwkH,EAAO5F,GAAUxhH,CAAO,CAEzD,MAEcguB,EAAM64F,EAAOjkH,GAAIwkH,EAAO5F,GAAUxhH,CAAO,OAI3ConH,EAAQtqH,EAAK,KAAK,IAAI,SAAU8M,GAAK,CACnC,OAAO+7G,EAAa/7G,GAAK5J,CAAO,CAC9C,CAAa,EACDguB,EAAM64F,EAAOjkH,GAAIwkH,EAAO5F,GAAUxhH,CAAO,EAE3C,OAAOguB,CACR,CACH,IAAK,kBAEH,OAAO23F,EAAa7oH,EAAK,QAASkD,CAAO,EAC3C,IAAK,eACH,OAAOwmH,EAAcb,EAAa7oH,EAAK,OAAQkD,CAAO,EAAG2lH,EAAa7oH,EAAK,MAAOkD,CAAO,EAAGA,CAAO,EACrG,IAAK,YACH,CACE,IAAIunH,GAAYzqH,EAAK,MAAM,IAAI,SAAUyD,GAAM,CAC7C,OAAOolH,EAAaplH,GAAMP,CAAO,CAC7C,CAAW,EACD,OAAIunH,GAAU,KAAKtpH,GAAI,MAAM,EACpB,IAAIwhE,EAAU8nD,GAAU,IAAI7B,CAAW,CAAC,EAG1C3lG,EAAOwnG,EAAS,CACxB,CACH,IAAK,YAED,OAAO,IAAI7iD,EAAU5nE,EAAK,WAAW,IAAI,SAAUsV,GAAG,CACpD,OAAO8tE,EAAiB9tE,GAAGpS,CAAO,CACnC,CAAA,CAAC,EAEN,IAAK,aACH,CACE,IAAIwnH,GAAY,CAAA,EAChB,QAAShpH,MAAQ1B,EAAK,WACpB0qH,GAAUhpH,EAAI,EAAI0hF,EAAiBpjF,EAAK,WAAW0B,EAAI,EAAGwB,CAAO,EAEnE,OAAO,IAAIklE,EAAWsiD,EAAS,CAChC,CACH,IAAK,iBAEL,IAAK,YAEL,IAAK,yBAEL,IAAK,YAEL,IAAK,kBAEL,QACE,MAAM,IAAI,MAAM,gDAAgD,OAAO1qH,EAAK,IAAI,CAAC,CACpF,CACF,CACD,OAAOojF,CACT,CAAC,EACDA,GAAA,uBAAiCulC,cCvejC,OAAO,eAAerlC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIniF,GAAMjE,GACNynE,IAAa9kE,GACbklH,IAAQ3jH,GACR8gB,IAAWre,EACXH,GAAO,eACPia,IAAe,CAAC,QAAS,QAAS,QAAS,SAAU,MAAO,WAAY,WAAY,SAAU,MAAO,eAAgB,YAAa,eAAgB,eAAgB,YAAa,aAAc,eAAgB,kBAAmB,YAAY,EAC5OgtG,OAAwCzoG,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC5F,IAAA3d,EAAQ2d,EAAK,MACPA,EAAK,MACjB,IAAI2zB,EAAQ3zB,EAAK,MACbke,EAASle,EAAK,OACRA,EAAK,IACAA,EAAK,SACLA,EAAK,SACPA,EAAK,OACRA,EAAK,IACf,IAAIm/C,EAAen/C,EAAK,aACpBogD,EAAYpgD,EAAK,UACjB0kD,EAAe1kD,EAAK,aACpB0qD,EAAe1qD,EAAK,aACpBqlD,EAAYrlD,EAAK,UACjB6lD,EAAa7lD,EAAK,WAClBmmD,EAAenmD,EAAK,aACFA,EAAK,gBAC3B,IAAIiqD,EAAajqD,EAAK,WAChBqoG,EAAQ,IAAI3jD,EAAa,CAAC,EAC1B4jD,EAAQ,IAAI5jD,EAAa,CAAC,EAC1B6jD,EAAQ,IAAI7jD,EAAa,EAAI,EAC7B8jD,EAAQ,IAAI9jD,EAAa,EAAK,EAGlC,SAAS+jD,EAAgBhrH,EAAM,CAC7B,SAAWmB,GAAI,gBAAgBnB,CAAI,GAAK,CAAC,MAAO,MAAO,IAAI,EAAE,SAASA,EAAK,EAAE,CAC9E,CACD,IAAIilH,KAAkBF,IAAM,YAAY,CACpC,aAAc93C,EACd,aAAcvE,EACd,WAAY8D,CAClB,CAAK,EACDo3C,EAAcqB,EAAY,YAC1BjB,EAAgBiB,EAAY,cA6C9B,SAASnwB,EAAcm2B,EAAgB,CACrC,IAAI/nH,EAAU,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,CAAA,EAC9Ek9D,EAAUl9D,EAAUA,EAAQ,QAAU,OAC1C,GAAI0gH,EAAYqH,EAAgB,UAAW7qD,CAAO,EAAG,CAGnD,MAAQj/D,GAAI,gBAAgB8pH,CAAc,GAAKA,EAAe,KAAK,SAAW,EAC5E,OAAOn2B,EAAcm2B,EAAe,KAAK,CAAC,EAAG/nH,CAAO,EAGtD,IAAIgoH,EAAY,GACZC,EAAa,EAOjB,GANAF,EAAe,QAAQ,SAAUj/G,EAAG,CAClC,EAAEm/G,EACEA,IAAe,IACjBD,EAAYp2B,EAAc9oF,EAAG9I,CAAO,EAE9C,CAAO,EACGioH,IAAe,EACjB,OAAOD,CAEV,CACD,IAAIlrH,EAAOirH,EACX,MAAQ9pH,GAAI,gBAAgBnB,CAAI,EAAG,CACjC,IAAI+pE,KAASpF,IAAW,aAAa3kE,EAAK,IAAI,EAC9C,GAAI+pE,EAAI,CAEN,GAAI/pE,EAAK,KAAK,OAAS,GAAK4jH,EAAY5jH,EAAM,cAAeogE,CAAO,EAElE,KAAOpgE,EAAK,KAAK,OAAS,GAAG,CAC3B,IAAIyI,EAAOzI,EAAK,KAAK,IAAG,EACpBorH,EAAUprH,EAAK,KAAK,IAAG,EAC3BA,EAAK,KAAK,KAAK,IAAI0oE,EAAaqB,EAAI/pE,EAAK,KAAM,CAACyI,EAAM2iH,CAAO,CAAC,CAAC,CAChE,CAEHprH,EAAO,IAAI0oE,EAAaqB,EAAI/pE,EAAK,KAAMA,EAAK,IAAI,CACxD,KACQ,QAAO,IAAIitE,EAAa6nB,EAAc90F,EAAK,EAAE,EAAGA,EAAK,KAAK,IAAI,SAAUsV,EAAG,CACzE,OAAOw/E,EAAcx/E,EAAGpS,CAAO,CAChC,CAAA,CAAC,CAEL,CACD,MAAQ/B,GAAI,gBAAgBnB,CAAI,GAAKA,EAAK,UAAW,CACnD,IAAIqrH,EAAKv2B,EAAc90F,EAAK,KAAK,CAAC,EAAGkD,CAAO,EAO5C,GANIlD,EAAK,KAAO,QAENmB,GAAI,gBAAgBkqH,CAAE,GAAKA,EAAG,WAAaA,EAAG,KAAO,KAI3DrrH,EAAK,KAAO,UAENmB,GAAI,gBAAgBkqH,CAAE,GAAKA,EAAG,WAAaA,EAAG,KAAO,OAIvDL,EAAgBK,EAAG,KAAK,CAAC,CAAC,EAC5B,OAAOA,EAAG,KAAK,CAAC,EAItB,IAAIC,EAAS,GACb,GAAItrH,EAAK,KAAO,QAENmB,GAAI,gBAAgBkqH,CAAE,IACxBA,EAAG,SAAQ,GAAMA,EAAG,KAAO,aAC7BrrH,EAAO,IAAI0oE,EAAa,IAAK,WAAY,CAAC2iD,EAAG,KAAK,CAAC,EAAGA,EAAG,KAAK,CAAC,CAAC,CAAC,EACjEC,EAAS,IAGPD,EAAG,QAAO,GAAMA,EAAG,KAAO,KAC5B,OAAOA,EAAG,KAAK,CAAC,EAItB,GAAIC,EAAQ,OAAO,IAAI5iD,EAAa1oE,EAAK,GAAIA,EAAK,GAAI,CAACqrH,CAAE,CAAC,CAC3D,CACD,MAAQlqH,GAAI,gBAAgBnB,CAAI,GAAKA,EAAK,WAAY,CACpD,IAAIg+E,EAAK8W,EAAc90F,EAAK,KAAK,CAAC,EAAGkD,CAAO,EACxC63D,EAAK+5B,EAAc90F,EAAK,KAAK,CAAC,EAAGkD,CAAO,EAC5C,GAAIlD,EAAK,KAAO,IAAK,CACnB,MAAQmB,GAAI,gBAAgB68E,CAAE,GAAKv9C,EAAOu9C,EAAG,KAAK,EAChD,OAAOjjB,EAET,MAAQ55D,GAAI,gBAAgB45D,CAAE,GAAKt6B,EAAOs6B,EAAG,KAAK,EAChD,OAAOijB,KAED78E,GAAI,gBAAgB45D,CAAE,GAAKA,EAAG,WAAaA,EAAG,KAAO,MAC3DA,EAAKA,EAAG,KAAK,CAAC,EACd/6D,EAAO,IAAI0oE,EAAa,IAAK,WAAY,CAACsV,EAAIjjB,CAAE,CAAC,EAEpD,CACD,GAAI/6D,EAAK,KAAO,IACd,SAAQmB,GAAI,gBAAgB45D,CAAE,GAAKA,EAAG,WAAaA,EAAG,KAAO,IACpD+5B,EAAc,IAAIpsB,EAAa,IAAK,MAAO,CAACsV,EAAIjjB,EAAG,KAAK,CAAC,CAAC,CAAC,EAAG73D,CAAO,KAEtE/B,GAAI,gBAAgB68E,CAAE,GAAKv9C,EAAOu9C,EAAG,KAAK,EACzC8W,EAAc,IAAIpsB,EAAa,IAAK,aAAc,CAAC3N,CAAE,CAAC,CAAC,KAExD55D,GAAI,gBAAgB45D,CAAE,GAAKt6B,EAAOs6B,EAAG,KAAK,EACzCijB,EAEF,IAAItV,EAAa1oE,EAAK,GAAIA,EAAK,GAAI,CAACg+E,EAAIjjB,CAAE,CAAC,EAEpD,GAAI/6D,EAAK,KAAO,IAAK,CACnB,MAAQmB,GAAI,gBAAgB68E,CAAE,EAAG,CAC/B,GAAIv9C,EAAOu9C,EAAG,KAAK,EACjB,OAAO4sC,EACF,GAAI10E,EAAM8nC,EAAG,MAAO,CAAC,EAC1B,OAAOjjB,CAEV,CACD,MAAQ55D,GAAI,gBAAgB45D,CAAE,EAAG,CAC/B,GAAIt6B,EAAOs6B,EAAG,KAAK,EACjB,OAAO6vD,EACF,GAAI10E,EAAM6kB,EAAG,MAAO,CAAC,EAC1B,OAAOijB,EAET,GAAIgmC,EAAchkH,EAAMogE,CAAO,EAC7B,OAAO,IAAIsI,EAAa1oE,EAAK,GAAIA,EAAK,GAAI,CAAC+6D,EAAIijB,CAAE,EAAGh+E,EAAK,QAAQ,CAEpE,CAED,OAAO,IAAI0oE,EAAa1oE,EAAK,GAAIA,EAAK,GAAI,CAACg+E,EAAIjjB,CAAE,EAAG/6D,EAAK,QAAQ,CAClE,CACD,GAAIA,EAAK,KAAO,IACd,SAAQmB,GAAI,gBAAgB68E,CAAE,GAAKv9C,EAAOu9C,EAAG,KAAK,EACzC4sC,KAEDzpH,GAAI,gBAAgB45D,CAAE,GAAK7kB,EAAM6kB,EAAG,MAAO,CAAC,EAC3CijB,EAEF,IAAItV,EAAa1oE,EAAK,GAAIA,EAAK,GAAI,CAACg+E,EAAIjjB,CAAE,CAAC,EAEpD,GAAI/6D,EAAK,KAAO,QACNmB,GAAI,gBAAgB45D,CAAE,EAAG,CAC/B,GAAIt6B,EAAOs6B,EAAG,KAAK,EACjB,OAAO8vD,EACF,GAAI30E,EAAM6kB,EAAG,MAAO,CAAC,EAC1B,OAAOijB,CAEV,CAEH,GAAIh+E,EAAK,KAAO,MAAO,CACrB,MAAQmB,GAAI,gBAAgB68E,CAAE,EAC5B,GAAIA,EAAG,OACL,GAAIgtC,EAAgBjwD,CAAE,EAAG,OAAOA,MAEhC,QAAOgwD,EAGX,MAAQ5pH,GAAI,gBAAgB45D,CAAE,EAC5B,GAAIA,EAAG,OACL,GAAIiwD,EAAgBhtC,CAAE,EAAG,OAAOA,MAEhC,QAAO+sC,CAGZ,CACD,GAAI/qH,EAAK,KAAO,KAAM,CACpB,MAAQmB,GAAI,gBAAgB68E,CAAE,EAAG,CAC/B,GAAIA,EAAG,MACL,OAAO8sC,EAEP,GAAIE,EAAgBjwD,CAAE,EAAG,OAAOA,CAEnC,CACD,MAAQ55D,GAAI,gBAAgB45D,CAAE,EAAG,CAC/B,GAAIA,EAAG,MACL,OAAO+vD,EAEP,GAAIE,EAAgBhtC,CAAE,EAAG,OAAOA,CAEnC,CACF,CACD,OAAO,IAAItV,EAAa1oE,EAAK,GAAIA,EAAK,GAAI,CAACg+E,EAAIjjB,CAAE,CAAC,CACnD,CACD,MAAQ55D,GAAI,gBAAgBnB,CAAI,EAC9B,OAAO,IAAI0oE,EAAa1oE,EAAK,GAAIA,EAAK,GAAIA,EAAK,KAAK,IAAI,SAAUwB,EAAG,CACnE,OAAOszF,EAActzF,EAAG0B,CAAO,CAChC,CAAA,CAAC,EAEJ,MAAQ/B,GAAI,aAAanB,CAAI,EAC3B,OAAO,IAAI2iE,EAAU3iE,EAAK,MAAM,IAAI,SAAUsV,EAAG,CAC/C,OAAOw/E,EAAcx/E,EAAGpS,CAAO,CAChC,CAAA,CAAC,EAEJ,MAAQ/B,GAAI,gBAAgBnB,CAAI,EAC9B,OAAO,IAAI0hE,EAAaozB,EAAc90F,EAAK,OAAQkD,CAAO,EAAG4xF,EAAc90F,EAAK,MAAOkD,CAAO,CAAC,EAEjG,MAAQ/B,GAAI,aAAanB,CAAI,EAC3B,OAAO,IAAI4nE,EAAU5nE,EAAK,WAAW,IAAI,SAAUsV,EAAG,CACpD,OAAOw/E,EAAcx/E,EAAGpS,CAAO,CAChC,CAAA,CAAC,EAEJ,MAAQ/B,GAAI,cAAcnB,CAAI,EAAG,CAC/B,IAAIknH,EAAW,CAAA,EACf,QAASxlH,KAAQ1B,EAAK,WACpBknH,EAASxlH,CAAI,EAAIozF,EAAc90F,EAAK,WAAW0B,CAAI,EAAGwB,CAAO,EAE/D,OAAO,IAAIklE,EAAW8+C,CAAQ,CAC/B,CAED,OAAOlnH,CACR,CACD,OAAO4E,EAAMlB,GAAM,CACjB,KAAMoxF,EACN,cAAeA,CACnB,CAAG,CACH,CAAC,EACDxR,GAAA,mBAA6BqnC,cC3S7B,OAAO,eAAe3nC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAI7gE,GAAOjlB,GACPiE,GAAMtB,GACNqiB,IAAW9gB,EACXsC,IAAO,UACPia,IAAe,CAAC,QAAS,QAAS,eAAgB,eAAgB,eAAgB,iBAAiB,EACnG4tG,OAAmCrpG,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CAC3F,IAAI3d,EAAQ2d,EAAK,MACfsN,EAAQtN,EAAK,MACb0kD,EAAe1kD,EAAK,aACpB0qD,EAAe1qD,EAAK,aACpBmmD,EAAenmD,EAAK,aACpByoD,EAAkBzoD,EAAK,gBA2BzB,SAASiyE,EAASx0F,EAAM8d,EAAO,CAC7B,IAAI0tG,EAAS,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,IAAI,IAIrF,GAAI,CAAC1tG,EACH,OAAO9d,EAET,MAAQmB,GAAI,cAAcnB,CAAI,EAAG,CAC/B,GAAIwrH,EAAO,IAAIxrH,EAAK,IAAI,EAAG,CACzB,IAAIyrH,EAAY,MAAM,KAAKD,CAAM,EAAE,KAAK,IAAI,EAC5C,MAAM,IAAI,eAAe,iDAAiD,OAAOC,EAAW,GAAG,CAAC,CACjG,CACD,IAAInqH,EAAQwc,EAAM,IAAI9d,EAAK,IAAI,EAC/B,MAAQmB,GAAI,QAAQG,CAAK,EAAG,CAC1B,IAAIoqH,EAAa,IAAI,IAAIF,CAAM,EAC/B,OAAAE,EAAW,IAAI1rH,EAAK,IAAI,EACjBw0F,EAASlzF,EAAOwc,EAAO4tG,CAAU,CAChD,KAAa,QAAI,OAAOpqH,GAAU,SACnBuuB,EAAM,OAAOvuB,CAAK,CAAC,EACjBA,IAAU,OACZ,IAAI2lE,EAAa3lE,CAAK,EAEtBtB,CAEV,YAAcmB,GAAI,gBAAgBnB,CAAI,EAAG,CACxC,IAAImJ,EAAOnJ,EAAK,KAAK,IAAI,SAAU8M,EAAK,CACtC,OAAO0nF,EAAS1nF,EAAKgR,EAAO0tG,CAAM,CAC1C,CAAO,EACD,OAAO,IAAI9iD,EAAa1oE,EAAK,GAAIA,EAAK,GAAImJ,EAAMnJ,EAAK,QAAQ,CAC9D,KAAM,OAAQmB,GAAI,mBAAmBnB,CAAI,EACxC,OAAO,IAAIgrE,EAAgBwpB,EAASx0F,EAAK,QAAS8d,EAAO0tG,CAAM,CAAC,EAC3D,MAAQrqH,GAAI,gBAAgBnB,CAAI,EAAG,CACxC,IAAIsqH,EAAQtqH,EAAK,KAAK,IAAI,SAAU8M,EAAK,CACvC,OAAO0nF,EAAS1nF,EAAKgR,EAAO0tG,CAAM,CAC1C,CAAO,EACD,OAAO,IAAIv+C,EAAajtE,EAAK,KAAMsqH,CAAK,CACzC,EAID,OAAOtqH,EAAK,IAAI,SAAUqC,EAAO,CAC/B,OAAOmyF,EAASnyF,EAAOyb,EAAO0tG,CAAM,CAC1C,CAAK,CACF,CACD,OAAO5mH,EAAM,UAAW,CACtB,KAAM4vF,EACN,+BAAgCA,EAChC,eAAgB,SAAoBl/E,EAAGwI,EAAO,CAC5C,OAAO02E,EAASl/E,KAAO6M,GAAK,WAAWrE,CAAK,CAAC,CAC9C,EAID,iBAAkBlZ,EAAM,YAAY,SAAUkK,EAAM,CAClD,OAAO,SAAUkhB,EAAG,CAClB,OAAOA,EAAE,IAAI,SAAU1a,EAAG,CACxB,OAAOxG,EAAKwG,CAAC,CACvB,CAAS,CACT,CACA,CAAK,EACD,mCAAoC1Q,EAAM,YAAY,SAAUkK,EAAM,CACpE,OAAO,SAAUkhB,EAAG,CAClB,OAAOA,EAAE,IAAI,SAAU1a,EAAG,CACxB,OAAOxG,EAAKwG,CAAC,CACvB,CAAS,CACT,CACA,CAAK,EACD,gBAAiB1Q,EAAM,QAAQ,YAAa,SAAU+mH,EAAQ,CAC5D,OAAO,SAAU37F,EAAGlS,EAAO,CACzB,OAAO6tG,EAAO37F,KAAO7N,GAAK,WAAWrE,CAAK,CAAC,CACnD,CACA,CAAK,EACD,iBAAkBlZ,EAAM,QAAQ,aAAc,SAAU4vC,EAAQ,CAC9D,OAAO,SAAUxkB,EAAGlS,EAAO,CACzB,OAAO02B,EAAOxkB,KAAO7N,GAAK,WAAWrE,CAAK,CAAC,CACnD,CACA,CAAK,EACD,sBAAuBlZ,EAAM,YAAY,SAAUkK,EAAM,CACvD,OAAO,SAAUkhB,EAAGlS,EAAO,CACzB,OAAOkS,EAAE,IAAI,SAAU1a,EAAG,CACxB,OAAOxG,EAAKwG,EAAGwI,CAAK,CAC9B,CAAS,CACT,CACA,CAAK,CACL,CAAG,CACH,CAAC,EACDklE,GAAA,cAAwBuoC,cCjIxB,OAAO,eAAe9nC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAItiF,IAAMjE,GACNglB,IAAWriB,EACX6D,GAAO,gBACPia,IAAe,CAAC,QAAS,WAAY,QAAS,cAAc,EAC5DiuG,OAAyC1pG,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACrFA,EAAK,MACnB,IAAI2gE,EAAW3gE,EAAK,SAChB3d,EAAQ2d,EAAK,MACbmmD,EAAenmD,EAAK,aAuCtB,SAAS2yE,EAAe22B,EAAIC,EAAI,CAC9B,IAAI5oH,EAAU,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,CAAA,EAC9EmU,EAAO,IAAIqxD,EAAa,IAAK,WAAY,CAACmjD,EAAIC,CAAE,CAAC,EACjDC,EAAa7oC,EAAS7rE,EAAM,CAAE,EAAEnU,CAAO,EAC3C,SAAW/B,IAAI,gBAAgB4qH,CAAU,GAAK,CAACA,EAAW,KAC3D,CACD,OAAOnnH,EAAMlB,GAAM,CACjB,aAAcwxF,EACd,qBAAsBA,CAC1B,CAAG,CACH,CAAC,EACDzR,GAAA,oBAA8BmoC,cC9D9B,OAAO,eAAexpC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIjhF,GAAMjE,GACNglB,IAAWriB,EACX6D,GAAO,aACPia,IAAe,CAAC,QAAS,SAAU,QAAS,WAAY,QAAS,SAAU,UAAW,eAAgB,eAAgB,eAAgB,kBAAmB,YAAY,EACrKquG,OAAsC9pG,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAC9F,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdsN,EAAQtN,EAAK,MACb2gE,EAAW3gE,EAAK,SAChB2zB,EAAQ3zB,EAAK,MACbke,EAASle,EAAK,OACdyiC,EAAUziC,EAAK,QACf0kD,EAAe1kD,EAAK,aACpB0qD,EAAe1qD,EAAK,aACpBmmD,EAAenmD,EAAK,aACpByoD,EAAkBzoD,EAAK,gBACvBiqD,EAAajqD,EAAK,WAuCpB,SAAS0pG,EAAgB9rD,EAAM+rD,EAAU,CACvC,IAAIhpH,EAAU,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,CAChF,SAAU,EAChB,EACQipH,EAAa,CAAA,EACjBC,EAASD,EAAYhsD,EAAM+rD,EAAS,IAAI,EACxC,IAAIh7F,EAAMqiE,EAAYpzB,EAAMgsD,CAAU,EACtC,OAAOjpH,EAAQ,SAAWggF,EAAShyD,CAAG,EAAIA,CAC3C,CACDtsB,EAAM,cAAc,CAClB,KAAM,aACN,GAAI,aACJ,QAASirB,CACb,CAAG,EACD,IAAIuyD,EAAax9E,EAAMlB,GAAM,CAC3B,mBAAoBuoH,EACpB,2BAA4BA,CAahC,CAAG,EAEDrnH,EAAM,iBAAiB,CACrB,KAAM,aACN,GAAI,aACJ,QAASirB,CACb,CAAG,EACDuyD,EAAW,UAAY,GACvBA,EAAW,MAAQ,SAAUiqC,EAAO,CAClC,OAAOC,EAAU,MAAM,KAAMD,EAAM,IAAI,CAC3C,EAIE,IAAIC,EAAY1nH,EAAM,YAAa,CACjC,mBAAoB,SAAwBu7D,EAAMrgE,EAAG,CACnD,SAAQqB,GAAI,gBAAgBg/D,CAAI,MAASh/D,GAAI,QAAQg/D,EAAK,KAAK,IAAM,SAC5DmsD,EAAUz8F,EAAMswC,EAAK,KAAK,EAAE,SAAU,EAAErgE,EAAE,WAAY,CAAC,EAEvDwsH,EAAUnsD,EAAK,MAAK,EAAIrgE,EAAE,SAAQ,EAAI,CAAC,CAEjD,EACD,qBAAsB,SAA0BqgE,EAAMrgE,EAAG,CACvD,MAAQqB,GAAI,QAAQrB,EAAE,KAAK,IAAM,SAC/B,OAAOwsH,EAAUnsD,EAAMtwC,EAAM/vB,EAAE,KAAK,CAAC,EAErC,MAAM,IAAI,MAAM,+DAA+D,CAElF,EACD,iCAAkC,SAAoCqgE,EAAMrgE,EAAGuvD,EAAO,CACpF,OAAOi9D,EAAUnsD,EAAK,SAAU,EAAErgE,EAAE,KAAMuvD,EAAM,KAAK,CACtD,EACD,yBAA0B,SAA4B8Q,EAAMrgE,EAAGuvD,EAAO,CACpE,IAAIvyC,EACJ,OAAIuyC,IAAU,EACZvyC,EAAI,aAAehd,EAAI,IAEvBgd,EAAI,OAASuyC,EAAQ,YAAcvvD,EAAI,KAAOuvD,EAAQ,KAEjDvyC,EAAI,UAAU,OAAOqjD,EAAM,UAAU,CAC7C,CACL,CAAG,EAiBGisD,EAAWxnH,EAAM,WAAY,CAC/B,+BAAgC,SAAkCunH,EAAYnsH,EAAM,CAClF,OAAAmsH,EAAWnsH,CAAI,EAAI,GACZ,EACR,EACD,6BAA8B,SAAgCmsH,EAAYnsH,EAAMusH,EAAS,CAGvF,OAAIvsH,EAAK,OAASusH,GAChBJ,EAAWnsH,CAAI,EAAI,GACZ,IAEF,EACR,EACD,kCAAmC,SAAqCmsH,EAAYnsH,EAAMusH,EAAS,CACjG,OAAOH,EAASD,EAAYnsH,EAAK,QAASusH,CAAO,CAClD,EACD,yCAA0C,SAA4CJ,EAAYnsH,EAAMusH,EAAS,CAC/G,OAAIvsH,EAAK,OAAO,QAAQusH,CAAO,IAAM,IACnCJ,EAAWnsH,CAAI,EAAI,GACZ,IAEFosH,EAASD,EAAYnsH,EAAK,KAAMusH,CAAO,CAC/C,EACD,8CAA+C,SAA8CJ,EAAYnsH,EAAMusH,EAAS,CACtH,GAAIvsH,EAAK,KAAK,OAAS,EAAG,CAExB,QADIwsH,EAAUJ,EAASD,EAAYnsH,EAAK,KAAK,CAAC,EAAGusH,CAAO,EAC/C5vH,EAAI,EAAGA,EAAIqD,EAAK,KAAK,OAAQ,EAAErD,EACtC6vH,EAAUJ,EAASD,EAAYnsH,EAAK,KAAKrD,CAAC,EAAG4vH,CAAO,GAAKC,EAE3D,GAAIA,EACF,OAAAL,EAAWnsH,CAAI,EAAI,GACZ,EAEV,CACD,MAAO,EACR,CACL,CAAG,EASGuzF,EAAc3uF,EAAM,cAAe,CACrC,uBAAwB,SAA4B5E,EAAM,CACxD,OAAOmnE,EAAmB,CAAC,CAC5B,EACD,qBAAsB,SAA0BnnE,EAAMmsH,EAAY,CAChE,OAAIA,EAAWnsH,CAAI,IAAM,OAChBmnE,EAAmB,CAAC,EAEtBA,EAAmB,CAAC,CAC5B,EACD,0BAA2B,SAA+BnnE,EAAMmsH,EAAY,CAC1E,OAAO,IAAInhD,EAAgBuoB,EAAYvzF,EAAK,QAASmsH,CAAU,CAAC,CACjE,EACD,iCAAkC,SAAsCnsH,EAAMmsH,EAAY,CACxF,OAAIA,EAAWnsH,CAAI,IAAM,OAChBmnE,EAAmB,CAAC,EAEtBosB,EAAYvzF,EAAK,KAAMmsH,CAAU,CACzC,EACD,uBAAwB,SAA4BnsH,EAAMmsH,EAAY,CAIpE,GAHInsH,EAAK,KAAK,SAAW,GACvBysH,EAAczsH,CAAI,EAEhBmsH,EAAWnsH,CAAI,IAAM,OACvB,OAAOmnE,EAAmB,CAAC,EAE7B,IAAIh1D,EAAOnS,EAAK,KAAK,CAAC,EAClBoS,EACAwb,EAAM,GACN8+F,EAAW,GAEXC,EACJ,OAAQ3sH,EAAK,KAAI,CACf,IAAK,OAEH4tB,EAAM,GACN++F,EAAiB,IAAIjkD,EAAa,IAAK,WAAY,CAACvB,EAAmB,CAAC,EAAG,IAAIuB,EAAa,IAAK,MAAO,CAACv2D,EAAM,IAAIu2D,EAAa,IAAK,SAAU,CAACvB,EAAmB,CAAC,EAAGA,EAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EACjM,MACF,IAAK,OACL,IAAK,UAEH,GAAInnE,EAAK,KAAK,SAAW,EACvB4tB,EAAM,GACN++F,EAAiB,IAAIjkD,EAAa,IAAK,WAAY,CAACvB,EAAmB,CAAC,EAAG,IAAI8F,EAAa,OAAQ,CAAC96D,CAAI,CAAC,CAAC,CAAC,UACnGnS,EAAK,KAAK,SAAW,EAE9B,OAAAoS,EAAO,IAAIs2D,EAAa,IAAK,SAAU,CAACvB,EAAmB,CAAC,EAAGnnE,EAAK,KAAK,CAAC,CAAC,CAAC,EAG5EmsH,EAAW/5G,CAAI,EAAI+5G,EAAWnsH,EAAK,KAAK,CAAC,CAAC,EACnCuzF,EAAY,IAAI7qB,EAAa,IAAK,MAAO,CAACv2D,EAAMC,CAAI,CAAC,EAAG+5G,CAAU,EAE3E,MACF,IAAK,QACH/5G,EAAO+0D,EAAmB,EAAE,EAE9B,IAAK,MACH,GAAI,CAAC/0D,GAAQpS,EAAK,KAAK,SAAW,EAEhC2sH,EAAiBx6G,EAAK,QACtByb,EAAM,WACG5tB,EAAK,KAAK,SAAW,GAAKoS,GAAQpS,EAAK,KAAK,SAAW,GAAKmsH,EAAWnsH,EAAK,KAAK,CAAC,CAAC,IAAM,OAElG2sH,EAAiB,IAAIjkD,EAAa,IAAK,WAAY,CAACv2D,EAAK,QAAS,IAAI86D,EAAa,MAAO,CAAC76D,GAAQpS,EAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAClH4tB,EAAM,WACG5tB,EAAK,KAAK,SAAW,EAE9B,OAAOuzF,EAAY,IAAI7qB,EAAa,IAAK,SAAU,CAAC,IAAIuE,EAAa,MAAO,CAAC96D,CAAI,CAAC,EAAG,IAAI86D,EAAa,MAAO,CAACjtE,EAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAGmsH,CAAU,EAE5I,MACF,IAAK,MACH,OAAAA,EAAW/5G,CAAI,EAAI+5G,EAAWnsH,EAAK,KAAK,CAAC,CAAC,EAEnCuzF,EAAY,IAAI7qB,EAAa,IAAK,MAAO,CAACv2D,EAAMnS,EAAK,KAAK,CAAC,CAAC,CAAC,EAAGmsH,CAAU,EACnF,IAAK,MAEHQ,EAAiB,IAAI1/C,EAAa,MAAO,CAAC96D,EAAK,MAAO,CAAA,CAAC,EACvD,MACF,IAAK,MAEHw6G,EAAiB,IAAI1/C,EAAa,MAAO,CAAC96D,EAAK,MAAO,CAAA,CAAC,EACvD,MACF,IAAK,MAEHw6G,EAAiB,IAAIjkD,EAAa,IAAK,aAAc,CAAC,IAAIuE,EAAa,MAAO,CAAC96D,EAAK,OAAO,CAAC,CAAC,CAAC,EAC9F,MACF,IAAK,MAEHw6G,EAAiB,IAAIjkD,EAAa,IAAK,MAAO,CAAC,IAAIuE,EAAa,MAAO,CAAC96D,EAAK,MAAK,CAAE,CAAC,EAAGg1D,EAAmB,CAAC,CAAC,CAAC,EAC9G,MACF,IAAK,MAEHwlD,EAAiB,IAAIjkD,EAAa,IAAK,WAAY,CAAC1oE,EAAM,IAAIitE,EAAa,MAAO,CAAC96D,EAAK,MAAK,CAAE,CAAC,CAAC,CAAC,EAClG,MACF,IAAK,MAEHu6G,EAAW,GACXC,EAAiB,IAAIjkD,EAAa,IAAK,WAAY,CAAC1oE,EAAM,IAAIitE,EAAa,MAAO,CAAC96D,EAAK,MAAK,CAAE,CAAC,CAAC,CAAC,EAClG,MACF,IAAK,MAEHu6G,EAAW,GACXC,EAAiB,IAAIjkD,EAAa,IAAK,MAAO,CAAC,IAAIuE,EAAa,MAAO,CAAC96D,EAAK,MAAK,CAAE,CAAC,EAAGg1D,EAAmB,CAAC,CAAC,CAAC,EAC9G,MACF,IAAK,OAEHv5C,EAAM,GACN++F,EAAiB,IAAI1/C,EAAa,OAAQ,CAAC,IAAIvE,EAAa,IAAK,WAAY,CAACvB,EAAmB,CAAC,EAAG,IAAIuB,EAAa,IAAK,MAAO,CAACv2D,EAAK,MAAO,EAAEg1D,EAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAC3K,MACF,IAAK,OAEHv5C,EAAM,GACN8+F,EAAW,GACXC,EAAiB,IAAI1/C,EAAa,OAAQ,CAAC,IAAIvE,EAAa,IAAK,WAAY,CAACvB,EAAmB,CAAC,EAAG,IAAIuB,EAAa,IAAK,MAAO,CAACv2D,EAAK,MAAO,EAAEg1D,EAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAC3K,MACF,IAAK,OAEHv5C,EAAM,GACN++F,EAAiB,IAAIjkD,EAAa,IAAK,MAAO,CAAC,IAAIA,EAAa,IAAK,MAAO,CAACv2D,EAAK,MAAO,EAAEg1D,EAAmB,CAAC,CAAC,CAAC,EAAGA,EAAmB,CAAC,CAAC,CAAC,EAC1I,MACF,IAAK,OAEHv5C,EAAM,GACN++F,EAAiB,IAAIjkD,EAAa,IAAK,WAAY,CAAC,IAAIuE,EAAa,MAAO,CAAC96D,EAAK,MAAO,CAAA,CAAC,EAAG,IAAI86D,EAAa,OAAQ,CAAC,IAAIvE,EAAa,IAAK,WAAY,CAAC,IAAIA,EAAa,IAAK,MAAO,CAACv2D,EAAK,QAASg1D,EAAmB,CAAC,CAAC,CAAC,EAAGA,EAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EACzP,MACF,IAAK,OAEHv5C,EAAM,GACN8+F,EAAW,GACXC,EAAiB,IAAIjkD,EAAa,IAAK,WAAY,CAAC,IAAIuE,EAAa,MAAO,CAAC96D,EAAK,MAAO,CAAA,CAAC,EAAG,IAAI86D,EAAa,OAAQ,CAAC,IAAIvE,EAAa,IAAK,WAAY,CAAC,IAAIA,EAAa,IAAK,MAAO,CAACv2D,EAAK,QAASg1D,EAAmB,CAAC,CAAC,CAAC,EAAGA,EAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EACzP,MACF,IAAK,OAEHv5C,EAAM,GACN8+F,EAAW,GACXC,EAAiB,IAAIjkD,EAAa,IAAK,MAAO,CAAC,IAAIA,EAAa,IAAK,MAAO,CAACv2D,EAAK,MAAO,EAAEg1D,EAAmB,CAAC,CAAC,CAAC,EAAGA,EAAmB,CAAC,CAAC,CAAC,EAC1I,MACF,IAAK,OAEHwlD,EAAiB,IAAI1/C,EAAa,OAAQ,CAAC96D,EAAK,MAAO,CAAA,CAAC,EACxD,MACF,IAAK,OAEHw6G,EAAiB,IAAI1/C,EAAa,OAAQ,CAAC96D,EAAK,MAAO,CAAA,CAAC,EACxD,MACF,IAAK,OAEHw6G,EAAiB,IAAIjkD,EAAa,IAAK,MAAO,CAAC,IAAIuE,EAAa,OAAQ,CAAC96D,EAAK,MAAK,CAAE,CAAC,EAAGg1D,EAAmB,CAAC,CAAC,CAAC,EAC/G,MACF,IAAK,OAEHulD,EAAW,GACXC,EAAiB,IAAIjkD,EAAa,IAAK,WAAY,CAAC1oE,EAAM,IAAIitE,EAAa,OAAQ,CAAC96D,EAAK,MAAK,CAAE,CAAC,CAAC,CAAC,EACnG,MACF,IAAK,OAEHu6G,EAAW,GACXC,EAAiB,IAAIjkD,EAAa,IAAK,WAAY,CAAC1oE,EAAM,IAAIitE,EAAa,OAAQ,CAAC96D,EAAK,MAAK,CAAE,CAAC,CAAC,CAAC,EACnG,MACF,IAAK,OAEHu6G,EAAW,GACXC,EAAiB,IAAIjkD,EAAa,IAAK,MAAO,CAAC,IAAIuE,EAAa,OAAQ,CAAC96D,EAAK,MAAK,CAAE,CAAC,EAAGg1D,EAAmB,CAAC,CAAC,CAAC,EAC/G,MACF,IAAK,QAEHv5C,EAAM,GACN++F,EAAiB,IAAI1/C,EAAa,OAAQ,CAAC,IAAIvE,EAAa,IAAK,MAAO,CAAC,IAAIA,EAAa,IAAK,MAAO,CAACv2D,EAAK,MAAK,EAAIg1D,EAAmB,CAAC,CAAC,CAAC,EAAGA,EAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,EACtK,MACF,IAAK,QAEHv5C,EAAM,GACN++F,EAAiB,IAAI1/C,EAAa,OAAQ,CAAC,IAAIvE,EAAa,IAAK,WAAY,CAAC,IAAIA,EAAa,IAAK,MAAO,CAACv2D,EAAK,MAAK,EAAIg1D,EAAmB,CAAC,CAAC,CAAC,EAAGA,EAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,EAC3K,MACF,IAAK,QAEHv5C,EAAM,GACN++F,EAAiB,IAAIjkD,EAAa,IAAK,WAAY,CAACvB,EAAmB,CAAC,EAAG,IAAIuB,EAAa,IAAK,MAAO,CAACv2D,EAAK,MAAO,EAAEg1D,EAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,EAC/I,MACF,IAAK,QAEHv5C,EAAM,GACN8+F,EAAW,GACXC,EAAiB,IAAIjkD,EAAa,IAAK,WAAY,CAACv2D,EAAK,MAAO,EAAE,IAAI86D,EAAa,OAAQ,CAAC,IAAIvE,EAAa,IAAK,WAAY,CAACvB,EAAmB,CAAC,EAAG,IAAIuB,EAAa,IAAK,MAAO,CAACv2D,EAAK,MAAO,EAAEg1D,EAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAC9N,MACF,IAAK,QAEHv5C,EAAM,GACN8+F,EAAW,GACXC,EAAiB,IAAIjkD,EAAa,IAAK,WAAY,CAAC,IAAIuE,EAAa,MAAO,CAAC96D,EAAK,MAAO,CAAA,CAAC,EAAG,IAAI86D,EAAa,OAAQ,CAAC,IAAIvE,EAAa,IAAK,MAAO,CAAC,IAAIA,EAAa,IAAK,MAAO,CAACv2D,EAAK,QAASg1D,EAAmB,CAAC,CAAC,CAAC,EAAGA,EAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EACpP,MACF,IAAK,QAEHv5C,EAAM,GACN8+F,EAAW,GACXC,EAAiB,IAAIjkD,EAAa,IAAK,WAAY,CAACvB,EAAmB,CAAC,EAAG,IAAIuB,EAAa,IAAK,MAAO,CAACv2D,EAAK,MAAO,EAAEg1D,EAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,EAC/I,MACF,IAAK,MAEHwlD,EAAiB,IAAIjkD,EAAa,IAAK,SAAU,CAAC,IAAIuE,EAAa,IAAIT,EAAW,KAAK,EAAG,CAACr6D,EAAK,MAAO,CAAA,CAAC,EAAGA,EAAK,MAAO,CAAA,CAAC,EACxH,MACF,IAAK,QACL,QACE,MAAM,IAAI,MAAM,aAAenS,EAAK,KAAO,4EAA4E,CAC1H,CACD,IAAI+pE,EAAI3yB,EACJxpB,GACFm8C,EAAK,IACL3yB,EAAO,WAEP2yB,EAAK,IACL3yB,EAAO,YAMT,IAAIw1E,EAAkBr5B,EAAYphF,EAAMg6G,CAAU,EAClD,OAAIO,IACFE,EAAkB,IAAIlkD,EAAa,IAAK,aAAc,CAACkkD,CAAe,CAAC,GAElE,IAAIlkD,EAAaqB,EAAI3yB,EAAM,CAACw1E,EAAiBD,CAAc,CAAC,CACpE,EACD,uBAAwB,SAA4B3sH,EAAMmsH,EAAY,CACpE,GAAIA,EAAWnsH,CAAI,IAAM,OACvB,OAAOmnE,EAAmB,CAAC,EAE7B,GAAInnE,EAAK,KAAO,IAEd,OAAO,IAAI0oE,EAAa1oE,EAAK,GAAIA,EAAK,GAAIA,EAAK,KAAK,IAAI,SAAU8M,EAAK,CACrE,OAAOymF,EAAYzmF,EAAKq/G,CAAU,CACnC,CAAA,CAAC,EAEJ,GAAInsH,EAAK,KAAO,IAAK,CAEnB,GAAIA,EAAK,UACP,OAAO,IAAI0oE,EAAa1oE,EAAK,GAAIA,EAAK,GAAI,CAACuzF,EAAYvzF,EAAK,KAAK,CAAC,EAAGmsH,CAAU,CAAC,CAAC,EAInF,GAAInsH,EAAK,WACP,OAAO,IAAI0oE,EAAa1oE,EAAK,GAAIA,EAAK,GAAI,CAACuzF,EAAYvzF,EAAK,KAAK,CAAC,EAAGmsH,CAAU,EAAG54B,EAAYvzF,EAAK,KAAK,CAAC,EAAGmsH,CAAU,CAAC,CAAC,CAE3H,CACD,GAAInsH,EAAK,KAAO,IAAK,CAEnB,IAAI6sH,EAAgB7sH,EAAK,KAAK,OAAO,SAAU8M,EAAK,CAClD,OAAOq/G,EAAWr/G,CAAG,IAAM,MACrC,CAAS,EACD,GAAI+/G,EAAc,OAAS,EAAG,CAC5B,IAAIC,EAAmB9sH,EAAK,KAAK,OAAO,SAAU8M,EAAK,CACrD,OAAOq/G,EAAWr/G,CAAG,IAAM,MACvC,CAAW,EACGigH,EAAkBD,EAAiB,SAAW,EAAIA,EAAiB,CAAC,EAAI,IAAIpkD,EAAa,IAAK,WAAYokD,CAAgB,EAC1HlG,EAAUiG,EAAc,OAAOt5B,EAAYw5B,EAAiBZ,CAAU,CAAC,EAC3E,OAAO,IAAIzjD,EAAa,IAAK,WAAYk+C,CAAO,CACjD,CAGD,OAAO,IAAIl+C,EAAa,IAAK,MAAO1oE,EAAK,KAAK,IAAI,SAAUgtH,EAAU,CACpE,OAAO,IAAItkD,EAAa,IAAK,WAAY1oE,EAAK,KAAK,IAAI,SAAUitH,EAAU,CACzE,OAAOA,IAAaD,EAAWz5B,EAAY05B,EAAUd,CAAU,EAAIc,EAAS,OAC7E,CAAA,CAAC,CACH,CAAA,CAAC,CACH,CACD,GAAIjtH,EAAK,KAAO,KAAOA,EAAK,SAAQ,EAAI,CACtC,IAAImS,EAAOnS,EAAK,KAAK,CAAC,EAClBoS,EAAOpS,EAAK,KAAK,CAAC,EAGtB,OAAImsH,EAAW/5G,CAAI,IAAM,OAChB,IAAIs2D,EAAa,IAAK,SAAU,CAAC6qB,EAAYphF,EAAMg6G,CAAU,EAAG/5G,CAAI,CAAC,EAI1E+5G,EAAWh6G,CAAI,IAAM,OAChB,IAAIu2D,EAAa,IAAK,WAAY,CAAC,IAAIA,EAAa,IAAK,aAAc,CAACv2D,CAAI,CAAC,EAAG,IAAIu2D,EAAa,IAAK,SAAU,CAAC6qB,EAAYnhF,EAAM+5G,CAAU,EAAG,IAAIzjD,EAAa,IAAK,MAAO,CAACt2D,EAAK,MAAO,EAAE+0D,EAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAIxN,IAAIuB,EAAa,IAAK,SAAU,CAAC,IAAIA,EAAa,IAAK,WAAY,CAAC,IAAIA,EAAa,IAAK,WAAY,CAAC6qB,EAAYphF,EAAMg6G,CAAU,EAAG/5G,EAAK,MAAK,CAAE,CAAC,EAAG,IAAIs2D,EAAa,IAAK,WAAY,CAACv2D,EAAK,QAASohF,EAAYnhF,EAAM+5G,CAAU,CAAC,CAAC,CAAC,CAAC,EAAG,IAAIzjD,EAAa,IAAK,MAAO,CAACt2D,EAAK,MAAK,EAAI+0D,EAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CACtT,CACD,GAAInnE,EAAK,KAAO,KAAOA,EAAK,SAAQ,EAAI,CACtC,IAAI27F,EAAO37F,EAAK,KAAK,CAAC,EAClBktH,EAAQltH,EAAK,KAAK,CAAC,EACvB,GAAImsH,EAAWxwB,CAAI,IAAM,OAEvB,SAAQx6F,GAAI,gBAAgBw6F,CAAI,IAAMl7D,EAAOk7D,EAAK,KAAK,GAAKzlD,EAAMylD,EAAK,MAAO,CAAC,GACtEx0B,EAAmB,CAAC,EAItB,IAAIuB,EAAa,IAAK,WAAY,CAAC1oE,EAAM,IAAI0oE,EAAa,IAAK,WAAY,CAAC,IAAIuE,EAAa,MAAO,CAAC0uB,EAAK,OAAO,CAAC,EAAGpI,EAAY25B,EAAM,QAASf,CAAU,CAAC,CAAC,CAAC,CAAC,EAEvK,GAAIA,EAAWe,CAAK,IAAM,OAAW,CACnC,MAAQ/rH,GAAI,gBAAgB+rH,CAAK,EAAG,CAElC,GAAIzsF,EAAOysF,EAAM,KAAK,EACpB,OAAO/lD,EAAmB,CAAC,EAG7B,GAAIjxB,EAAMg3E,EAAM,MAAO,CAAC,EACtB,OAAO35B,EAAYoI,EAAMwwB,CAAU,CAEtC,CAGD,IAAIgB,EAAc,IAAIzkD,EAAa,IAAK,MAAO,CAACizB,EAAK,QAAS,IAAIjzB,EAAa,IAAK,WAAY,CAACwkD,EAAO/lD,EAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,EAChI,OAAO,IAAIuB,EAAa,IAAK,WAAY,CAACwkD,EAAM,MAAO,EAAE,IAAIxkD,EAAa,IAAK,WAAY,CAAC6qB,EAAYoI,EAAMwwB,CAAU,EAAGgB,CAAW,CAAC,CAAC,CAAC,CAC1I,CAGD,OAAO,IAAIzkD,EAAa,IAAK,WAAY,CAAC,IAAIA,EAAa,IAAK,MAAO,CAACizB,EAAK,MAAK,EAAIuxB,EAAM,OAAO,CAAC,EAAG,IAAIxkD,EAAa,IAAK,MAAO,CAAC,IAAIA,EAAa,IAAK,WAAY,CAAC6qB,EAAYoI,EAAMwwB,CAAU,EAAG,IAAIzjD,EAAa,IAAK,SAAU,CAACwkD,EAAM,MAAO,EAAEvxB,EAAK,MAAO,CAAA,CAAC,CAAC,CAAC,EAAG,IAAIjzB,EAAa,IAAK,WAAY,CAAC6qB,EAAY25B,EAAOf,CAAU,EAAG,IAAIl/C,EAAa,MAAO,CAAC0uB,EAAK,MAAO,CAAA,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACzX,CACD,MAAM,IAAI,MAAM,aAAe37F,EAAK,GAAK,4EAA4E,CACtH,CACL,CAAG,EAQD,SAASysH,EAAczsH,EAAM,CAE3B,GAAK,GAAAA,EAAK,OAAS,OAASA,EAAK,OAAS,WAAaA,EAAK,OAAS,QAAUA,EAAK,KAAK,SAAW,GAQpG,SAASrD,EAAI,EAAGA,EAAIqD,EAAK,KAAK,OAAQ,EAAErD,EACtCqD,EAAK,KAAKrD,CAAC,EAAIwqE,EAAmB,CAAC,EAErC,MAAAnnE,EAAK,UAAU,WACT,IAAI,MAAM,oCAAoC,EACrD,CASD,SAASmnE,EAAmB7lE,EAAO8rH,EAAW,CAC5C,OAAO,IAAInmD,EAAajiB,EAAQ1jD,EAAO8rH,GAAatwH,EAAO,MAAM,CAAC,CACnE,CACD,OAAOslF,CACT,CAAC,EACDA,GAAA,iBAA2B4pC,cCjiB3B,OAAO,eAAelpC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAI/qE,GAAU7a,GACVglB,IAAWriB,EACX6D,GAAO,cACPia,IAAe,CAAC,SAAU,QAAS,QAAS,SAAU,MAAO,WAAY,WAAY,SAAU,MAAO,QAAS,mBAAoB,eAAgB,WAAY,aAAc,YAAa,oBAAqB,SAAU,eAAgB,YAAa,eAAgB,eAAgB,YAAa,aAAc,eAAgB,aAAc,iBAAiB,EAChW0vG,OAAuCnrG,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAClFA,EAAK,OACpB,IAAI3d,EAAQ2d,EAAK,MACLA,EAAK,MACJA,EAAK,OACRA,EAAK,IACAA,EAAK,SACLA,EAAK,SACPA,EAAK,OACRA,EAAK,IACHA,EAAK,MACjB,IAAI6gE,EAAmB7gE,EAAK,iBACxB+gE,EAAe/gE,EAAK,aACpB2gE,EAAW3gE,EAAK,SACLA,EAAK,SACJA,EAAK,UACGA,EAAK,kBAChBA,EAAK,OACCA,EAAK,aACRA,EAAK,UACrB,IAAI0kD,EAAe1kD,EAAK,aACLA,EAAK,aACRA,EAAK,UACJA,EAAK,WACtB,IAAImmD,EAAenmD,EAAK,aACpBiqD,EAAajqD,EAAK,WACAA,EAAK,gBAsDzB,SAAS+xE,EAAan0B,EAAM,CAC1B,IAAIriD,EAAQ,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,CAAA,EAC5EwvG,EAAW,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAI,GAC/EC,EAAWC,IACXC,EAAUC,EAAWvtD,EAAMriD,EAAO,GAAMyvG,EAAS,UAAU,EAC3DI,EAAQF,EAAQ,UAAU,OAC1BG,EAAmB,CACrB,eAAgB,EACtB,EACQC,EAAqB,CACvB,eAAgB,EACtB,EAEI,GADA1tD,EAAOstD,EAAQ,WACXE,GAAS,EAAG,CAEdxtD,EAAO2tD,EAAY3tD,CAAI,EACvB,IAAI4tD,EACAlI,EACAmI,EAAY,GACZC,EAAW,GAEf9tD,EAAO+iB,EAAS/iB,EAAMotD,EAAS,WAAY,CAAA,EAAIK,CAAgB,EAE/D,QADIjmH,EAIFk+G,EAAQmI,EAAYT,EAAS,cAAgBA,EAAS,YACtDptD,EAAO+iB,EAAS/iB,EAAM0lD,EAAO,CAAE,EAAEgI,CAAkB,EACnDG,EAAY,CAACA,EAEbrmH,EAAIw4D,EAAK,WACLx4D,IAAMomH,GAIVE,EAAW,GACXF,EAAUpmH,EAERsmH,IAEF9tD,EAAO+iB,EAAS/iB,EAAMotD,EAAS,gBAAiB,CAAA,EAAIK,CAAgB,GAGtEztD,EAAO+iB,EAAS/iB,EAAMotD,EAAS,WAAY,CAAA,EAAIK,CAAgB,CAChE,CAED,IAAI13G,EAAe,CAAA,EACfg4G,EAAiB,CAAA,EAsBrB,OArBI/tD,EAAK,OAAS,gBAAkBA,EAAK,YAAcA,EAAK,KAAO,KAE7DwtD,IAAU,IACZxtD,EAAK,KAAK,CAAC,EAAIguD,EAAgBhuD,EAAK,KAAK,CAAC,EAAGjqD,CAAY,EACzDiqD,EAAK,KAAK,CAAC,EAAIguD,EAAgBhuD,EAAK,KAAK,CAAC,CAAC,GAEzCmtD,IACFY,EAAe,UAAY/tD,EAAK,KAAK,CAAC,EACtC+tD,EAAe,YAAc/tD,EAAK,KAAK,CAAC,KAGtCwtD,IAAU,IACZxtD,EAAOguD,EAAgBhuD,EAAMjqD,CAAY,GAEvCo3G,IACFY,EAAe,UAAY/tD,EAC3B+tD,EAAe,YAAc,OAK5BZ,GACLY,EAAe,aAAeh4G,EAC9Bg4G,EAAe,UAAYT,EAAQ,UACnCS,EAAe,WAAa/tD,EACrB+tD,GAJe/tD,CAKvB,CACD,OAAOv7D,EAAMlB,GAAM,CACjB,KAAM4wF,EACN,gBAAiB,SAAqBn0B,EAAMmtD,EAAU,CACpD,OAAOh5B,EAAan0B,EAAM,CAAE,EAAEmtD,CAAQ,CACvC,EACD,eAAgBh5B,EAChB,wBAAyBA,CAC7B,CAAG,EAsBD,SAASo5B,EAAWvtD,EAAMriD,EAAOswG,EAAUvI,EAAO,CAChD,IAAI4F,EAAY,CAAA,EACZzrH,EAAOkjF,EAAS/iB,EAAM0lD,EAAO/nG,EAAO,CACtC,eAAgB,EACtB,CAAK,EACDswG,EAAW,CAAC,CAACA,EACb,IAAIC,EAAO,OAASD,EAAW,IAAM,IACrCE,EAAQtuH,CAAI,EACZ,IAAIuuH,EAAU,CAAA,EACd,OAAAA,EAAQ,WAAavuH,EACrBuuH,EAAQ,UAAY9C,EACb8C,EAmBP,SAASD,EAAQtuH,EAAM,CACrB,IAAIwuH,EAAKxuH,EAAK,KACd,GAAIwuH,IAAO,eAET,MAAM,IAAI,MAAM,oCAAoC,EAC/C,GAAIA,IAAO,eAChB,GAAIxuH,EAAK,KAAO,IAAK,CAEnB,GAAIA,EAAK,KAAK,CAAC,EAAE,OAAS,gBAAkB,IAAK+X,GAAQ,WAAW,WAAW/X,EAAK,KAAK,CAAC,EAAE,KAAK,CAAC,EAChG,MAAM,IAAI,MAAM,iCAAiC,EAEjDsuH,EAAQtuH,EAAK,KAAK,CAAC,CAAC,CAEhC,KAAe,CACL,GAAIquH,EAAK,QAAQruH,EAAK,EAAE,IAAM,GAC5B,MAAM,IAAI,MAAM,YAAcA,EAAK,GAAK,mCAAmC,EAE7E,QAASrD,EAAI,EAAGA,EAAIqD,EAAK,KAAK,OAAQrD,IACpC2xH,EAAQtuH,EAAK,KAAKrD,CAAC,CAAC,CAEvB,SACQ6xH,IAAO,aAAc,CAC9B,IAAI1kH,EAAQ9J,EAAK,KACbyuH,EAAMhD,EAAU,QAAQ3hH,CAAK,EAC7B2kH,IAAQ,IAEVhD,EAAU,KAAK3hH,CAAK,CAE9B,SAAiB0kH,IAAO,kBAChBF,EAAQtuH,EAAK,OAAO,UACXwuH,IAAO,eAChB,MAAM,IAAI,MAAM,QAAUA,EAAK,0CAA0C,CAE5E,CACF,CAYD,SAAShB,GAAmB,CAC1B,IAAIkB,EAAW,CAACprC,EAEhB,CACE,EAAG,MACH,EAAG,KACT,EAAO,CACD,EAAG,OACH,EAAG,GACT,EAAOF,EAEH,CACE,EAAG,YACH,EAAG,MACT,EAAO,CACD,EAAG,WACH,EAAG,SACT,EAAO,CACD,EAAG,QACH,EAAG,MACT,EAAO,CACD,EAAG,YACH,EAAG,WACT,EAAO,CACD,EAAG,MACH,EAAG,GACT,CAAK,EACGurC,EAAa,CAAC,CAChB,EAAG,cACH,EAAG,OACJ,EAED,CACE,EAAG,cACH,EAAG,OACJ,EAED,CACE,EAAG,SACH,EAAG,OACJ,EAED,CACE,EAAG,QACH,EAAG,UACJ,EAED,CACE,EAAG,aACH,EAAG,iBACJ,EAED,CACE,EAAG,aACH,EAAG,eACJ,EAED,CACE,EAAG,cACH,EAAG,WACJ,EAED,CACE,EAAG,WACH,EAAG,UACJ,EAED,CACE,EAAG,cACH,EAAG,WACJ,EAED,CACE,EAAG,WACH,EAAG,UACJ,EAED,CACE,EAAG,MACH,EAAG,SACJ,EAED,CACE,EAAG,OACH,EAAG,UACJ,EAED,CACE,EAAG,QACH,EAAG,KACJ,EAED,CACE,EAAG,OACH,EAAG,MACJ,EAED,CACE,EAAG,OACH,EAAG,MACJ,EAED,CACE,EAAG,MACH,EAAG,KACJ,EAED,CACE,EAAG,YACH,EAAG,SACJ,EAED,CACE,EAAG,WACH,EAAG,UACJ,EAED,CACE,EAAG,YACH,EAAG,SACJ,EAED,CACE,EAAG,WACH,EAAG,UACJ,EAED,CACE,EAAG,aACH,EAAG,cACJ,EAED,CACE,EAAG,YACH,EAAG,SACJ,EAED,CACE,EAAG,WACH,EAAG,UACT,CAAK,EAEGC,EAAgB,CAAC,CACnB,EAAG,kBACH,EAAG,2BACJ,EAED,CACE,EAAG,eACH,EAAG,mBACJ,EAED,CACE,EAAG,eACH,EAAG,mBACT,CAAK,EAEGC,EAAc,CAAC,CACjB,EAAG,eACH,EAAG,cACJ,EAED,CACE,EAAG,aACH,EAAG,cACT,CAAK,EACGtB,EAAW,CAAA,EAKf,OAAAA,EAAS,WAAamB,EAAS,OAAOC,EAAYE,CAAW,EAC7DtB,EAAS,cAAgBqB,EACzBrB,EAAS,YAAcsB,EACvBtB,EAAS,gBAAkBmB,EAAS,OAAOC,CAAU,EAMrDpB,EAAS,WAAa,CAACjqC,EAEvB,CACE,EAAG,OACH,EAAG,MACJ,EAED,CACE,EAAG,MACH,EAAG,KACJ,EAEDF,EAEA,CACE,EAAG,UACH,EAAG,WACJ,EAED,CACE,EAAG,SACH,EAAG,UACJ,EAED,CACE,EAAG,aACH,EAAG,YACJ,EAED,CACE,EAAG,YACH,EAAG,WACJ,EAED,CACE,EAAG,UACH,EAAG,WACJ,EAED,CACE,EAAG,SACH,EAAG,UACJ,EAED,CACE,EAAG,UACH,EAAG,WACJ,EAED,CACE,EAAG,SACH,EAAG,UACJ,EAED,CACE,EAAG,UACH,EAAG,WACJ,EAED,CACE,EAAG,SACH,EAAG,UACJ,EAED,CACE,EAAG,aACH,EAAG,WACJ,EAED,CACE,EAAG,YACH,EAAG,WACJ,EAED,CACE,EAAG,cACH,EAAG,UACJ,EAED,CACE,EAAG,SACH,EAAG,MACJ,EAED,CACE,EAAG,SACH,EAAG,OACJ,EAED,CACE,EAAG,MACH,EAAG,KACJ,EAED,CACE,EAAG,aACH,EAAG,cACJ,CACL,EAEWmqC,CACR,CAkBD,SAASO,EAAY9tH,EAAM2wD,EAAQm+D,EAAW,CAC5C,IAAIN,EAAKxuH,EAAK,KACV+uH,EAAW,UAAU,OAAS,EAElC,GAAIP,IAAO,gBAAkBxuH,EAAK,SAAQ,EAAI,CAC5C,IAAIgvH,EAAO,GACP72F,EASJ,GARIn4B,EAAK,KAAO,MAETA,EAAK,KAAK,CAAC,EAAE,OAAS,mBAAqBA,EAAK,KAAK,CAAC,EAAE,OAAS,iBAAmBA,EAAK,KAAK,CAAC,EAAE,OAAS,iBAE7Gm4B,EAAM,WAAWn4B,EAAK,KAAK,CAAC,EAAE,KAAK,EACnCgvH,EAAO72F,GAAO,MAASpgB,GAAQ,WAAWogB,CAAG,GAG7C62F,EAAM,CAOR,GAAI72F,EAAM,EAAG,CASX,IAAI82F,EAAWjvH,EAAK,KAAK,CAAC,EACtBkvH,EAAW,IAAIxmD,EAAa,IAAK,MAAO,CAAC1oE,EAAK,KAAK,CAAC,EAAE,UAAW,EAAE,IAAIinE,EAAa9uC,EAAM,CAAC,CAAC,CAAC,EACjGn4B,EAAO,IAAI0oE,EAAa,IAAK,WAAY,CAACumD,EAAUC,CAAQ,CAAC,CACvE,MAOUlvH,EAAO,IAAI0oE,EAAa,IAAK,WAAY,CAAC1oE,EAAK,KAAK,CAAC,EAAGA,EAAK,KAAK,CAAC,EAAE,UAAS,CAAE,CAAC,EAE/E+uH,IAEED,IAAc,UAChBn+D,EAAO,QAAU3wD,EAEjB2wD,EAAO,KAAKm+D,CAAS,EAAI9uH,EAG9B,CACF,CAED,GAAIwuH,IAAO,kBAETV,EAAY9tH,EAAK,QAASA,EAAM,SAAS,UAChCwuH,IAAO,gBAAkBA,IAAO,aACzC,QAAS7xH,EAAI,EAAGA,EAAIqD,EAAK,KAAK,OAAQrD,IACpCmxH,EAAY9tH,EAAK,KAAKrD,CAAC,EAAGqD,EAAMrD,CAAC,EAGrC,GAAI,CAACoyH,EAEH,OAAO/uH,CAEV,CAyBD,SAASmuH,EAAgBnuH,EAAMkW,EAAc,CACvCA,IAAiB,SACnBA,EAAe,CAAA,GAGjBA,EAAa,CAAC,EAAI,EAClB,IAAIjZ,EAAI,CAAA,EACRA,EAAE,IAAM,EACRA,EAAE,KAAO,IAITA,EAAE,KAAO,GACT,IAAIkyH,EAAU,EACVC,EAAU,GAEdC,EAASrvH,EAAM,KAAM/C,CAAC,EACtBkyH,EAAUj5G,EAAa,OAAS,EAGhC,QAFIW,EAAQ,GACRy4G,EACK3yH,EAAIwyH,EAASxyH,GAAK,EAAGA,IAC5B,GAAIuZ,EAAavZ,CAAC,IAAM,EACxB,KAAIusB,EAAK,IAAI+9C,EAAapwD,EAAQX,EAAavZ,CAAC,EAAI,KAAK,IAAIuZ,EAAavZ,CAAC,CAAC,CAAC,EACzEotE,EAAK7zD,EAAavZ,CAAC,EAAI,EAAI,IAAM,IACrC,GAAIA,EAAI,EAAG,CAET,IAAIg+B,EAAK,IAAI6xC,EAAW4iD,CAAO,EAC/B,GAAIzyH,EAAI,EAAG,CACT,IAAI4yH,EAAK,IAAItoD,EAAatqE,CAAC,EAC3Bg+B,EAAK,IAAI+tC,EAAa,IAAK,MAAO,CAAC/tC,EAAI40F,CAAE,CAAC,CAC3C,CACGr5G,EAAavZ,CAAC,IAAM,IAAMka,EAC5BqS,EAAK,IAAIw/C,EAAa,IAAK,aAAc,CAAC/tC,CAAE,CAAC,EACpC,KAAK,IAAIzkB,EAAavZ,CAAC,CAAC,IAAM,EACvCusB,EAAKyR,EAELzR,EAAK,IAAIw/C,EAAa,IAAK,WAAY,CAACx/C,EAAIyR,CAAE,CAAC,CAElD,CACG9jB,EACFy4G,EAAKpmG,EACI6gD,IAAO,IAChBulD,EAAK,IAAI5mD,EAAa,IAAK,MAAO,CAAC4mD,EAAIpmG,CAAE,CAAC,EAE1ComG,EAAK,IAAI5mD,EAAa,IAAK,WAAY,CAAC4mD,EAAIpmG,CAAE,CAAC,EAEjDrS,EAAQ,GAGV,GAAIA,EACF,OAAO,IAAIowD,EAAa,CAAC,EAEzB,OAAOqoD,EAiBT,SAASD,EAASrvH,EAAMwvH,EAAOvyH,EAAG,CAChC,IAAIuxH,EAAKxuH,EAAK,KACd,GAAIwuH,IAAO,eAGT,MAAM,IAAI,MAAM,oCAAoC,EAC/C,GAAIA,IAAO,eAAgB,CAEhC,GAAI,OAAO,QAAQxuH,EAAK,EAAE,IAAM,GAAI,MAAM,IAAI,MAAM,YAAcA,EAAK,GAAK,UAAU,EACtF,GAAIwvH,IAAU,KAAM,CAElB,IAAKxvH,EAAK,KAAO,cAAgBA,EAAK,KAAO,QAAUwvH,EAAM,KAAO,OAASA,EAAM,KAAO,YAAcA,EAAM,KAAO,WACnH,MAAM,IAAI,MAAM,WAAaxvH,EAAK,GAAK,UAAU,EAInD,IAAKA,EAAK,KAAO,YAAcA,EAAK,KAAO,OAASA,EAAK,KAAO,aAAewvH,EAAM,KAAO,OAASA,EAAM,KAAO,WAChH,MAAM,IAAI,MAAM,WAAaxvH,EAAK,GAAK,UAAU,EAInD,IAAKA,EAAK,KAAO,YAAcA,EAAK,KAAO,OAASA,EAAK,KAAO,eAAiB/C,EAAE,QAAU,EAC3F,MAAM,IAAI,MAAM,WAAa+C,EAAK,GAAK,UAAU,CAEpD,EAGGA,EAAK,KAAO,KAAOA,EAAK,KAAO,OACjC/C,EAAE,KAAO+C,EAAK,IAEhB,QAAS0hB,EAAK,EAAGA,EAAK1hB,EAAK,KAAK,OAAQ0hB,IAElC1hB,EAAK,KAAO,eAAc/C,EAAE,KAAO,MACnC+C,EAAK,KAAO,KAAOA,EAAK,KAAO,cACjC/C,EAAE,KAAO,GACTA,EAAE,IAAM,EACRA,EAAE,KAAOykB,IAAO,EAAI,IAAM1hB,EAAK,IAEjC/C,EAAE,MAAQykB,EACV2tG,EAASrvH,EAAK,KAAK0hB,CAAE,EAAG1hB,EAAM/C,CAAC,CAEzC,SAAiBuxH,IAAO,aAAc,CAE9B,GAAIxuH,EAAK,OAASovH,GAAWA,IAAY,GACvC,MAAM,IAAI,MAAM,iCAAiC,EAGnD,GADAA,EAAUpvH,EAAK,KACXwvH,IAAU,KAAM,CAClBt5G,EAAa,CAAC,EAAI,EAClB,MACD,CAGD,GAAIs5G,EAAM,KAAO,KAAOvyH,EAAE,QAAU,EAClC,MAAM,IAAI,MAAM,qDAAqD,EAIvE,GAAIuyH,EAAM,KAAO,KAAOvyH,EAAE,QAAU,EAClC,MAAM,IAAI,MAAM,yDAAyD,GAIvEA,EAAE,OAAS,IAAMA,EAAE,OAAS,OAC1BkyH,EAAU,IAAGj5G,EAAa,CAAC,EAAI,GACnCA,EAAa,CAAC,GAAKjZ,EAAE,KAAOA,EAAE,OAAS,IAAM,EAAI,IACjDkyH,EAAU,KAAK,IAAI,EAAGA,CAAO,EAEvC,SAAiBX,IAAO,eAAgB,CAChC,IAAIiB,EAAQ,WAAWzvH,EAAK,KAAK,EACjC,GAAIwvH,IAAU,KAAM,CAClBt5G,EAAa,CAAC,EAAIu5G,EAClB,MACD,CACD,GAAID,EAAM,KAAO,IAAK,CAEpB,GAAIvyH,EAAE,QAAU,EAAG,MAAM,IAAI,MAAM,4BAA4B,EAC/D,GAAI,IAAK8a,GAAQ,WAAW03G,CAAK,GAAKA,GAAS,EAC7C,MAAM,IAAI,MAAM,qCAAqC,EAEvD,QAAS3tG,EAAMqtG,EAAU,EAAGrtG,EAAM2tG,EAAO3tG,IACvC5L,EAAa4L,CAAG,EAAI,EAElB2tG,EAAQN,IAASj5G,EAAau5G,CAAK,EAAI,GAC3Cv5G,EAAau5G,CAAK,GAAKxyH,EAAE,KAAOA,EAAE,OAAS,IAAM,EAAI,IACrDkyH,EAAU,KAAK,IAAIM,EAAON,CAAO,EACjC,MACD,CACDlyH,EAAE,IAAMwyH,EAGJxyH,EAAE,OAAS,KACbiZ,EAAa,CAAC,GAAKjZ,EAAE,KAAOA,EAAE,OAAS,IAAM,EAAI,IAE3D,KACQ,OAAM,IAAI,MAAM,QAAUuxH,EAAK,iBAAiB,CAEnD,CACF,CACH,CAAC,EACD1rC,GAAA,kBAA4BuqC,cC3zB5B,OAAO,eAAeqC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAIxtG,IAAWhlB,EACXwG,IAAO,UACPia,IAAe,CAAC,SAAS,EACzBgyG,OAAmCztG,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CAC3F,IAAIqtG,EAAUrtG,EAAK,QAOnB,OAAO,SAAiB1lB,EAAKyE,EAAO,CAClC,IAAIuuH,EAAcD,EAAQtuH,GAASA,EAAM,MAAM,EAC/C,OAAIuuH,GAAe,OAAOA,EAAY,UAAa,WAC1CA,EAAY,SAASvuH,CAAK,EAE5BA,CACX,CACA,CAAC,EACDouH,GAAA,cAAwBC,cCvBxB,OAAO,eAAeG,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAI5tG,IAAWhlB,EACXwG,IAAO,WACPia,IAAe,CAAA,EACfoyG,OAAoC7tG,IAAS,SAASxe,IAAMia,IAAc,UAAY,CAaxF,OAAO,SAAkB9gB,EAAKyE,EAAO,CAEnC,OAAI,OAAOA,GAAU,WAAa,CAAC,SAASA,CAAK,GAAK,MAAMA,CAAK,GACxD,CACL,OAAQ,SACR,MAAO,OAAOA,CAAK,CAC3B,EAEWA,CACX,CACA,CAAC,EACDwuH,GAAA,eAAyBC,oBC/BzB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACcA,GAAA,QAAG,OAClB,IAAI/uC,IAAU,SAGd+uC,GAAA,QAAkB/uC,ICPlB,OAAO,eAAe/kD,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACDA,GAAA,cAAiDA,GAAA,kBAA2BA,GAAA,+BAAwBA,GAAA,UAAoBA,GAAA,YAA2CA,GAAA,0BAAsBA,GAAA,UAAsCA,GAAA,WAAoBA,GAAA,yBAAyBA,GAAA,aAAwCA,GAAA,wBAAwBA,GAAA,eAAyBA,GAAA,QAAqCA,GAAA,uBAAqB,OAC/Z,IAAIha,GAAWhlB,EACX+0F,IAAWpyF,GACX6/B,GAAat+B,GACb6+B,GAASp8B,GACTosH,OAAgC/tG,GAAS,SAAS,OAAQ,CAAE,EAAE,UAAY,CAC5E,MAAO,EACT,CAAC,EACiBga,GAAA,WAAG+zF,IACrB,IAAIC,OAAiChuG,GAAS,SAAS,QAAS,CAAE,EAAE,UAAY,CAC9E,MAAO,EACT,CAAC,EACkBga,GAAA,YAAGg0F,IACtB,IAAIC,OAAgCjuG,GAAS,SAAS,OAAQ,CAAE,EAAE,UAAY,CAC5E,OAAO,IACT,CAAC,EACiBga,GAAA,WAAGi0F,IACrB,IAAIC,IAAgCC,GAAgB,WAAY,CAAC,SAAU,YAAY,EAAG,SAAU9tG,EAAM,CACxG,IAAIzlB,EAASylB,EAAK,OAChBC,EAAYD,EAAK,UACnB,OAAOzlB,EAAO,SAAW,YAAc,IAAI0lB,EAAU,GAAQ,EAAI,GACnE,CAAC,EACqB0Z,GAAA,eAAGk0F,IACzB,IAAIE,IAA2BD,GAAgB,MAAO,CAAC,SAAU,YAAY,EAAG,SAAU7uF,EAAO,CAC/F,IAAI1kC,EAAS0kC,EAAM,OACjBhf,EAAYgf,EAAM,UACpB,OAAO1kC,EAAO,SAAW,YAAc,IAAI0lB,EAAU,GAAG,EAAI,GAC9D,CAAC,EACgB0Z,GAAA,UAAGo0F,IACpB,IAAIC,IAA0BF,GAAgB,KAAM,CAAC,SAAU,YAAY,EAAG,SAAUG,EAAO,CAC7F,IAAI1zH,EAAS0zH,EAAM,OACjBhuG,EAAYguG,EAAM,UACpB,OAAO1zH,EAAO,SAAW,eAAkB4iC,GAAW,mBAAmBld,CAAS,EAAIyd,GAAO,EAC/F,CAAC,EACe/D,GAAA,SAAGq0F,IACnB,IAAIE,IAA2BJ,GAAgB,MAAO,CAAC,SAAU,YAAY,EAAG,SAAUK,EAAO,CAC/F,IAAI5zH,EAAS4zH,EAAM,OACjBluG,EAAYkuG,EAAM,UACpB,OAAO5zH,EAAO,SAAW,eAAkB4iC,GAAW,oBAAoBld,CAAS,EAAIyd,GAAO,GAChG,CAAC,EACgB/D,GAAA,UAAGu0F,IACpB,IAAIE,IAAyBN,GAAgB,IAAK,CAAC,SAAU,YAAY,EAAG,SAAUO,EAAO,CAC3F,IAAI9zH,EAAS8zH,EAAM,OACjBpuG,EAAYouG,EAAM,UACpB,OAAO9zH,EAAO,SAAW,eAAkB4iC,GAAW,kBAAkBld,CAAS,EAAIyd,GAAO,CAC9F,CAAC,EAGc/D,GAAA,QAAGy0F,IAClB,IAAIE,IAA2BR,GAAgB,MAAO,CAAC,SAAU,YAAY,EAAG,SAAUS,EAAO,CAC/F,IAAIh0H,EAASg0H,EAAM,OACjBtuG,EAAYsuG,EAAM,UACpB,OAAOh0H,EAAO,SAAW,eAAkB4iC,GAAW,oBAAoBld,CAAS,EAAIyd,GAAO,GAChG,CAAC,EACgB/D,GAAA,UAAG20F,IACpB,IAAIE,IAA2BV,GAAgB,MAAO,CAAC,SAAU,YAAY,EAAG,SAAUW,EAAO,CAC/F,IAAIl0H,EAASk0H,EAAM,OACjBxuG,EAAYwuG,EAAM,UACpB,OAAOl0H,EAAO,SAAW,YAAc,IAAI0lB,EAAU,CAAC,EAAE,GAAE,EAAK,KAAK,GACtE,CAAC,EACgB0Z,GAAA,UAAG60F,IACpB,IAAIE,IAA4BZ,GAAgB,OAAQ,CAAC,SAAU,YAAY,EAAG,SAAUa,EAAO,CACjG,IAAIp0H,EAASo0H,EAAM,OACjB1uG,EAAY0uG,EAAM,UACpB,OAAOp0H,EAAO,SAAW,YAAc,IAAI0lB,EAAU,EAAE,EAAE,GAAE,EAAK,KAAK,IACvE,CAAC,EACiB0Z,GAAA,WAAG+0F,IACrB,IAAIE,IAA6Bd,GAAgB,QAAS,CAAC,SAAU,YAAY,EAAG,SAAUe,EAAO,CACnG,IAAIt0H,EAASs0H,EAAM,OACjB5uG,EAAY4uG,EAAM,UACpB,OAAOt0H,EAAO,SAAW,YAAc,IAAI0lB,EAAU,CAAC,EAAE,IAAI,IAAIA,EAAU,CAAC,EAAE,GAAI,CAAA,EAAI,KAAK,KAC5F,CAAC,EACkB0Z,GAAA,YAAGi1F,IACtB,IAAIE,IAA8BhB,GAAgB,SAAU,CAAC,SAAU,YAAY,EAAG,SAAUiB,EAAQ,CACtG,IAAIx0H,EAASw0H,EAAO,OAClB9uG,EAAY8uG,EAAO,UACrB,OAAOx0H,EAAO,SAAW,YAAc,IAAI0lB,EAAU,CAAC,EAAE,IAAI,IAAIA,EAAU,EAAE,EAAE,GAAI,CAAA,EAAI,KAAK,MAC7F,CAAC,EACmB0Z,GAAA,aAAGm1F,IACvB,IAAIE,IAA+BlB,GAEnC,UAAW,CAAC,SAAU,YAAY,EAAG,SAAUmB,EAAQ,CACrD,IAAI10H,EAAS00H,EAAO,OAClBhvG,EAAYgvG,EAAO,UACrB,OAAO10H,EAAO,SAAW,YAAc,IAAI0lB,EAAU,KAAK,EAAE,KAAI,EAAK,KAAK,OAC5E,CAAC,EACoB0Z,GAAA,cAAGq1F,IACxB,IAAIE,IAA6BpB,GAAgB,QAAS,CAAC,SAAU,YAAY,EAAG,SAAUqB,EAAQ,CACpG,IAAI50H,EAAS40H,EAAO,OAClBlvG,EAAYkvG,EAAO,UACrB,OAAO50H,EAAO,SAAW,YAAc,IAAI0lB,EAAU,CAAC,EAAE,KAAI,EAAK,KAAK,KACxE,CAAC,EACkB0Z,GAAA,YAAGu1F,IACtB,IAAIE,IAAyBtB,GAAgB,IAAK,CAAC,SAAS,EAAG,SAAUuB,EAAQ,CAC/E,IAAInvG,EAAUmvG,EAAO,QACrB,OAAOnvG,EAAQ,CACjB,CAAC,EAGcyZ,GAAA,QAAGy1F,IAClB,IAAIE,OAAuC3vG,GAAS,SAAS,KAAM,CAAC,IAAI,EAAG,SAAU4vG,EAAQ,CAC3F,IAAIhlG,EAAKglG,EAAO,GAChB,OAAOhlG,CACT,CAAC,EACwBoP,GAAA,kBAAG21F,IAC5B,IAAIE,OAAsC7vG,GAAS,SAAS,IAAK,CAAC,GAAG,EAAG,SAAU8vG,EAAQ,CACxF,IAAIj8G,EAAIi8G,EAAO,EACf,OAAOj8G,CACT,CAAC,EACuBmmB,GAAA,iBAAG61F,IAC3B,IAAIE,OAAmC/vG,GAAS,SAAS,UAAW,CAAE,EAAE,UAAY,CAClF,OAAO+vE,IAAS,OAClB,CAAC,EAIoB/1D,GAAA,cAAG+1F,IACxB,SAAS5B,GAAgB3sH,EAAMia,EAActZ,EAAQ,CACnD,SAAW6d,GAAS,SAASxe,EAAMia,EAActZ,EAAQ,CACvD,uBAAwB,EAC5B,CAAG,CACH,WC5HA,OAAO,eAAe6tH,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC6BA,GAAA,gDAAmCA,GAAA,sBAAiEA,GAAA,0BAAgCA,GAAA,sBAA6BA,GAAA,4CAAmCA,GAAA,oBAAmDA,GAAA,6CAAyCA,GAAA,2BAAqCA,GAAA,iBAA2BA,GAAA,iBAA0DA,GAAA,4CAA8BA,GAAA,mBAAyDA,GAAA,qBAA6BA,GAAA,mBAAgCA,GAAA,2CAA+BA,GAAA,kBAA4BA,GAAA,0BAAoCA,GAAA,mBAAoDA,GAAA,gBAAoCA,GAAA,0BAAiCA,GAAA,0CAA6BA,GAAA,eAAgDA,GAAA,mDAA6CA,GAAA,oBAA8BA,GAAA,cAAwBA,GAAA,0BAA6DA,GAAA,kBAA+BA,GAAA,qBAA8BA,GAAA,2CAAiCA,GAAA,cAAwBA,GAAA,uBAAiCA,GAAA,mBAA2DA,GAAA,6CAAgCA,GAAA,mBAAkDA,GAAA,cAAmCA,GAAA,yBAAwCA,GAAA,iDAA6BA,GAAA,iBAA2BA,GAAA,mBAA6BA,GAAA,eAAiDA,GAAA,iBAAG,OACzgD,IAAIhwG,GAAWhlB,EAIXi1H,IAAoCC,GAAY,eAAgB,YAAa,QAAQ,EAC/DF,GAAA,mBAAGC,IAC7B,IAAIE,IAA2CD,GAAY,sBAAuB,cAAe,gBAAgB,EAChFF,GAAA,0BAAGG,IACpC,IAAIC,IAAsCF,GAAY,iBAAkB,iBAAkB,KAAK,EACnEF,GAAA,qBAAGI,IAC/B,IAAIC,IAA6CH,GAAY,wBAAyB,yBAA0B,KAAK,EAGlFF,GAAA,4BAAGK,IACtC,IAAIC,IAAwCJ,GAAY,mBAAoB,mBAAoB,QAAQ,EAC1EF,GAAA,uBAAGM,IACjC,IAAIC,IAAwCL,GAAY,mBAAoB,mBAAoB,QAAQ,EAC1EF,GAAA,uBAAGO,IACjC,IAAIC,IAAuCN,GAAY,kBAAmB,gBAAiB,KAAK,EACnEF,GAAA,sBAAGQ,IAChC,IAAIC,IAA+BP,GAAY,UAAW,sBAAuB,YAAY,EACxEF,GAAA,cAAGS,IACxB,IAAIC,IAAwCR,GAAY,mBAAoB,kBAAmB,GAAG,EACpEF,GAAA,uBAAGU,IACjC,IAAIC,IAAoCT,GAAY,eAAgB,mBAAoB,QAAQ,EACtEF,GAAA,mBAAGW,IAC7B,IAAIC,IAA0CV,GAAY,qBAAsB,uBAAwB,GAAG,EAC3EF,GAAA,yBAAGY,IACnC,IAAIC,IAAiDX,GAAY,4BAA6B,qBAAsB,KAAK,EAClFF,GAAA,gCAAGa,IAC1C,IAAIC,IAA2CZ,GAAY,sBAAuB,yBAA0B,IAAI,EAC/EF,GAAA,0BAAGc,IACpC,IAAIC,IAAuCb,GAAY,kBAAmB,mBAAoB,QAAQ,EACzEF,GAAA,sBAAGe,IAChC,IAAIC,IAAgCd,GAAY,WAAY,qBAAsB,KAAK,EACjEF,GAAA,eAAGgB,IACzB,IAAIC,IAAiCf,GAAY,YAAa,4BAA6B,SAAS,EAG7EF,GAAA,gBAAGiB,IAC1B,IAAIC,IAAkChB,GAAY,aAAc,oBAAqB,GAAG,EAChEF,GAAA,iBAAGkB,IAC3B,IAAIC,IAA+CjB,GAAY,0BAA2B,mBAAoB,GAAG,EAC5EF,GAAA,8BAAGmB,IACxC,IAAIC,IAAoClB,GAAY,eAAgB,mBAAoB,IAAI,EAClEF,GAAA,mBAAGoB,IAC7B,IAAIC,IAAqCnB,GAAY,gBAAiB,eAAgB,QAAQ,EACnEF,GAAA,oBAAGqB,IAC9B,IAAIC,IAAsBC,GAAc,gBAAiB,cAAe,EAC7CvB,GAAA,oBAAGsB,IAC9B,IAAIE,IAAqCtB,GAAY,gBAAiB,sBAAuB,GAAG,EACrEF,GAAA,oBAAGwB,IAC9B,IAAIC,IAAkCvB,GAAY,aAAc,oBAAqB,IAAI,EACjEF,GAAA,iBAAGyB,IAC3B,IAAIC,IAAoCxB,GAAY,eAAgB,mBAAoB,IAAI,EAClEF,GAAA,mBAAG0B,IAC7B,IAAIC,IAAmCzB,GAAY,cAAe,mBAAoB,IAAI,EACjEF,GAAA,kBAAG2B,IAC5B,IAAIC,IAA4C1B,GAAY,uBAAwB,kBAAmB,UAAU,EAC/EF,GAAA,2BAAG4B,IACrC,IAAIC,IAA+B3B,GAAY,UAAW,kBAAmB,MAAM,EAC9DF,GAAA,cAAG6B,IACxB,IAAIC,IAA2C5B,GAAY,sBAAuB,mBAAoB,KAAK,EAC1EF,GAAA,0BAAG8B,IACpC,IAAIC,IAAwBR,GAAc,kBAAmB,KAAO,EACvCvB,GAAA,sBAAG+B,IAChC,IAAIC,IAAqBT,GAAc,eAAgB,IAAI,EAGjCvB,GAAA,mBAAGgC,IAC7B,IAAIC,IAAkC/B,GAAY,aAAc,oBAAqB,IAAI,EACjEF,GAAA,iBAAGiC,IAC3B,IAAIC,IAAgChC,GAAY,WAAY,gBAAiB,QAAQ,EAC/DF,GAAA,eAAGkC,IACzB,IAAIC,IAAiCjC,GAAY,YAAa,eAAgB,QAAQ,EAC/DF,GAAA,gBAAGmC,IAC1B,IAAIC,IAA+BlC,GAAY,UAAW,oBAAqB,UAAU,EACpEF,GAAA,cAAGoC,IACxB,IAAIC,IAAsCnC,GAAY,iBAAkB,yBAA0B,OAAO,EAE7EF,GAAA,qBAAGqC,IAC/B,IAAIC,IAAiCpC,GAAY,YAAa,uBAAwB,MAAM,EACrEF,GAAA,gBAAGsC,IAC1B,IAAIC,IAAmCrC,GAAY,cAAe,mBAAoB,eAAe,EAC5EF,GAAA,kBAAGuC,IAC5B,IAAIC,IAA2CtC,GAAY,sBAAuB,wBAAyB,YAAY,EACtFF,GAAA,0BAAGwC,IACpC,IAAIC,IAAmCvC,GAAY,cAAe,uBAAwB,YAAY,EAC7EF,GAAA,kBAAGyC,IAC5B,IAAIC,IAAsBnB,GAAc,gBAAiB,cAAc,EAC5CvB,GAAA,oBAAG0C,IAC9B,IAAIC,IAAuCzC,GAAY,kBAAmB,uBAAwB,KAAK,EAC1EF,GAAA,sBAAG2C,IAChC,IAAIC,IAAuC1C,GAAY,kBAAmB,sBAAuB,aAAa,EACjFF,GAAA,sBAAG4C,IAChC,IAAIC,IAAwC3C,GAAY,mBAAoB,iBAAkB,KAAK,EAGrEF,GAAA,uBAAG6C,IACjC,IAAIC,IAAiC5C,GAAY,YAAa,mBAAoB,WAAW,EACtEF,GAAA,gBAAG8C,IAC1B,IAAIC,IAAoC7C,GAAY,eAAgB,mBAAoB,WAAW,EACzEF,GAAA,mBAAG+C,IAC7B,IAAIC,IAA+B9C,GAAY,UAAW,UAAW,QAAQ,EAIxDF,GAAA,cAAGgD,IACxB,IAAIC,IAAoC/C,GAAY,eAAgB,eAAgB,GAAG,EAC7DF,GAAA,mBAAGiD,IAC7B,IAAIC,IAAkChD,GAAY,aAAc,cAAe,IAAI,EAC3DF,GAAA,iBAAGkD,IAC3B,IAAIC,IAAkCjD,GAAY,aAAc,eAAgB,GAAG,EAC3DF,GAAA,iBAAGmD,IAC3B,IAAIC,IAAoClD,GAAY,eAAgB,oBAAqB,GAAG,EAClEF,GAAA,mBAAGoD,IAC7B,IAAIC,IAAyCnD,GAAY,oBAAqB,eAAgB,GAAG,EAIlEF,GAAA,wBAAGqD,IAClC,SAASnD,GAAY1uH,EAAM2U,EAAUs9C,EAAS,CAC5C,IAAIh4C,EAAe,CAAC,SAAU,OAAQ,WAAW,EACjD,SAAWuE,GAAS,SAASxe,EAAMia,EAAc,SAAU4E,EAAM,CAC/D,IAAIzlB,EAASylB,EAAK,OAChBmvC,EAAOnvC,EAAK,KACZC,EAAYD,EAAK,UAIfjhB,EAAQxE,EAAO,SAAW,YAAc,IAAI0lB,EAAUnK,CAAQ,EAAI,WAAWA,CAAQ,EACrFktB,EAAO,IAAImsB,EAAKpwD,EAAOq0D,CAAO,EAClC,OAAApwB,EAAK,UAAY,GACVA,CACX,CAAG,CACH,CAIA,SAASkuF,GAAc/vH,EAAMpC,EAAO,CAClC,IAAIqc,EAAe,CAAC,SAAU,WAAW,EACzC,SAAWuE,GAAS,SAASxe,EAAMia,EAAc,SAAU6jB,EAAO,CAChE,IAAI1kC,EAAS0kC,EAAM,OACjBhf,EAAYgf,EAAM,UACpB,OAAO1kC,EAAO,SAAW,YAAc,IAAI0lB,EAAUlhB,CAAK,EAAIA,CAClE,CAAG,CACH,WCtJA,OAAO,eAAek0H,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAI/zD,IAAkBvkE,GAClBglB,IAAWriB,EACX8nC,IAASvmC,GACTD,GAAM0C,GACNH,IAAO,QACPia,IAAe,CAAC,QAAS,WAAW,EASpC83G,OAA0CvzG,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CAClG,IAAI3d,EAAQ2d,EAAK,MACflO,EAAYkO,EAAK,UACfklB,KAAYE,IAAO,aAAa,CAClC,MAAO/iC,EACP,UAAWyP,CACf,CAAG,EAGD,OAAOzP,EAAM,QAAS,CACpB,SAAU,SAAauE,EAAM,CAE3B,IAAI6R,EAAM7R,EAAK,CAAC,KACRhI,GAAI,UAAU6Z,CAAG,EACvB7R,EAAK,CAAC,EAAI6R,EAAM,KACH7Z,GAAI,aAAa6Z,CAAG,IACjC7R,EAAK,CAAC,EAAI6R,EAAI,MAAM,CAAC,GAEvB,GAAI,CACF,OAAOysB,EAAM,MAAM,KAAMt+B,CAAI,CAC9B,OAAQS,EAAK,CACZ,QAAU63D,IAAgB,gBAAgB73D,CAAG,CAC9C,CACF,CACL,CAAG,CACH,EAAG,CACD,oBAAqB,EACvB,CAAC,EACD4rH,GAAA,qBAA+BC,cC9C/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIj0D,IAAkBvkE,GAClBglB,IAAWriB,EACXq6C,IAAU94C,GACVD,IAAM0C,GACNH,IAAO,SACPia,IAAe,CAAC,QAAS,QAAS,SAAU,OAAO,EASnDg4G,OAA2CzzG,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CACnG,IAAI3d,EAAQ2d,EAAK,MACf03B,EAAQ13B,EAAK,MACbU,EAASV,EAAK,OACdmT,EAAQnT,EAAK,MACXw3B,KAAaG,IAAQ,cAAc,CACrC,MAAOt1C,EACP,MAAOq1C,EACP,OAAQh3B,EACR,MAAOyS,CACX,CAAG,EAGD,OAAO9wB,EAAM,SAAU,CACrB,SAAU,SAAauE,EAAM,CAE3B,IAAIsgD,EAAYtgD,EAAK,OAAS,EAC1BV,EAAOU,EAAKsgD,CAAS,KACjBtoD,IAAI,UAAUsH,CAAI,IACxBU,EAAKsgD,CAAS,EAAIhhD,EAAO,GAE3B,GAAI,CACF,OAAOsxC,EAAO,MAAM,KAAM5wC,CAAI,CAC/B,OAAQS,EAAK,CACZ,QAAU63D,IAAgB,gBAAgB73D,CAAG,CAC9C,CACF,CACL,CAAG,CACH,EAAG,CACD,oBAAqB,EACvB,CAAC,EACD8rH,GAAA,sBAAgCC,oBCjDhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC8BA,GAAA,wBAAGC,IAClC,IAAI10H,IAAMjE,GACNiwE,IAASttE,GAAA,EASb,SAASg2H,IAAwBrnD,EAAYlO,EAAMxiD,EAAO,CAExD,IAAIoiD,EAASsO,EAAW,OAAO,SAAUxuE,EAAM,CAC7C,SAAWmB,IAAI,cAAcnB,CAAI,GAAK,EAAEA,EAAK,QAAQsgE,IAAS,CAACxiD,EAAM,IAAI9d,EAAK,IAAI,CACtF,CAAG,EAAE,CAAC,EACJ,GAAI,CAACkgE,EACH,MAAM,IAAI,MAAM,qDAAuDsO,EAAa,GAAG,EAIzF,IAAI9qE,EAAOw8D,EAAO,KACd41D,KAAe3oD,IAAO,gBAAgBrvD,CAAK,EAC3C+jB,EAAK2sC,EAAW,UACpB,OAAO,SAA0B1uE,EAAG,CAClC,OAAAg2H,EAAS,IAAIpyH,EAAM5D,CAAC,EACb+hC,EAAG,SAASi0F,CAAQ,CAC/B,CACA,CC/BA,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAI50H,GAAMjE,GACNwgB,GAAS7d,GACTu0B,IAAYhzB,GACZ40H,IAA2BnyH,GAC3Bqe,IAAWtJ,EACXlV,IAAO,SACPia,IAAe,CAAC,OAAO,EACvBs4G,OAA2C/zG,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CACnG,IAAI3d,EAAQ2d,EAAK,MAQjB,SAAS2zG,EAAgB/sH,EAAMm3D,EAAMxiD,EAAO,CAC1C,IAAIhe,EAAGyB,EACP,OAAI4H,EAAK,CAAC,IACRrJ,EAAIqJ,EAAK,CAAC,EAAE,QAAO,EAAG,SAAS2U,CAAK,GAElC3U,EAAK,CAAC,OACAhI,GAAI,cAAcgI,EAAK,CAAC,CAAC,MAAShI,GAAI,0BAA0BgI,EAAK,CAAC,CAAC,EAE7E5H,EAAW4H,EAAK,CAAC,EAAE,QAAO,EAAG,SAAS2U,CAAK,EAG3Cvc,KAAey0H,IAAyB,yBAAyB7sH,EAAK,CAAC,EAAGm3D,EAAMxiD,CAAK,GAGlFlE,EAAO9Z,EAAGyB,CAAQ,CAC1B,CACD20H,EAAgB,QAAU,GAG1B,IAAIt8G,EAAShV,EAAM,SAAU,CAC3B,kBAAmBs5F,GACnB,mBAAoB,SAAwBp+F,EAAGmK,EAAM,CACnD,OAAOnK,EAAE,OAAOo+F,GAAQp+F,EAAE,QAAS,EAAEmK,CAAI,CAAC,CAC3C,EACD,gBAAiByT,GAAO,aACxB,iBAAkB,SAAsB5d,EAAGmK,EAAM,CAC/C,OAAOnK,EAAE,UAAW4d,GAAO,cAAc5d,EAAE,QAAO,EAAImK,CAAI,CAAC,CAC5D,CACL,CAAG,EACD,OAAOisH,CACT,EAAG,CACD,oBAAqB,EACvB,CAAC,EAY4BH,GAAA,sBAAGE,IAChC,SAAS/3B,GAAQp+F,EAAGyB,EAAU,CAE5B,IAAI4H,KAAWirB,IAAU,kBAAkB7yB,CAAQ,EACnD,SAAWmc,GAAO,QAAQ5d,EAAG,SAAUwB,EAAO8H,EAAO5F,EAAO,CAE1D,OAAI2F,IAAS,EACJ5H,EAASD,CAAK,EACZ6H,IAAS,EACX5H,EAASD,EAAO,CAAC8H,EAAQ,CAAC,CAAC,EAG3B7H,EAASD,EAAO,CAAC8H,EAAQ,CAAC,EAAG5F,CAAK,CAE/C,CAAG,CACH,WC/EA,OAAO,eAAe2yH,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC6BA,GAAA,uBAAG,OACjC,IAAIh1H,GAAMjE,GACNk3B,IAAYv0B,GACZ6d,IAAStc,GACT8gB,IAAWre,EACXmyH,IAA2Bp9G,GAC3BlV,IAAO,UACPia,IAAe,CAAC,OAAO,EACvBy4G,OAA4Cl0G,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CACpG,IAAI3d,EAAQ2d,EAAK,MAOjB,SAAS8zG,EAAiBltH,EAAMm3D,EAAMxiD,EAAO,CAC3C,IAAIhe,EAAGyB,EACP,OAAI4H,EAAK,CAAC,IACRrJ,EAAIqJ,EAAK,CAAC,EAAE,QAAO,EAAG,SAAS2U,CAAK,GAElC3U,EAAK,CAAC,OACAhI,GAAI,cAAcgI,EAAK,CAAC,CAAC,MAAShI,GAAI,0BAA0BgI,EAAK,CAAC,CAAC,EAE7E5H,EAAW4H,EAAK,CAAC,EAAE,QAAO,EAAG,SAAS2U,CAAK,EAG3Cvc,KAAey0H,IAAyB,yBAAyB7sH,EAAK,CAAC,EAAGm3D,EAAMxiD,CAAK,GAGlFw9B,EAASx7C,EAAGyB,CAAQ,CAC5B,CACD80H,EAAiB,QAAU,GAG3B,IAAI/6E,EAAW12C,EAAM,UAAW,CAC9B,2BAA4B,SAA6BpB,EAAOjC,EAAU,CAExE,IAAI4H,KAAWirB,IAAU,kBAAkB7yB,CAAQ,EAC/C80B,EAAU,SAASA,EAAQ/0B,EAAO8H,EAAO,CACvC,MAAM,QAAQ9H,CAAK,KACjBoc,IAAO,SAASpc,EAAO,SAAUe,EAAO1F,EAAG,CAE7C05B,EAAQh0B,EAAO+G,EAAM,OAAOzM,EAAI,CAAC,CAAC,CAC9C,CAAW,EAGGwM,IAAS,EACX5H,EAASD,CAAK,EACL6H,IAAS,EAClB5H,EAASD,EAAO8H,CAAK,EAGrB7H,EAASD,EAAO8H,EAAO5F,CAAK,CAGxC,EACM6yB,EAAQ7yB,EAAM,QAAS,EAAE,CAAE,CAAA,CAC5B,CACL,CAAG,EAED,OAAO6yH,CACT,EAAG,CACD,oBAAqB,EACvB,CAAC,EACDF,GAAA,uBAAiCC,cCpEjC,OAAO,eAAeE,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAIn1H,GAAMjE,GACNglB,IAAWriB,EACX6D,IAAO,QACPia,IAAe,CAAC,OAAO,EACvB44G,OAA0Cr0G,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CAClG,IAAI03B,EAAQ13B,EAAK,MAOjB,OAAO,UAA0B,CAE/B,QADIpZ,EAAO,CAAA,EACFxM,EAAI,EAAG8Q,EAAK,UAAU,OAAQ9Q,EAAI8Q,EAAI9Q,IAAK,CAClD,IAAImQ,EAAM,UAAUnQ,CAAC,EAGrB,MAAQwE,GAAI,SAAS2L,CAAG,EACtBA,EAAI,QACJA,EAAI,KAAOA,EAAI,KAAO,EAAI,EAAI,UACrBA,GAAOA,EAAI,QAAU,GAC9BA,EAAMA,EAAI,IAAI,SAAUygB,EAAG,CACzB,OAAOA,EAAI,CACrB,CAAS,aACYpsB,GAAI,SAAS2L,CAAG,MAAS3L,GAAI,UAAU2L,CAAG,EACvDA,EAAMA,EAAI,IAAI,SAAUygB,EAAG,CACzB,OAAOA,EAAI,CACrB,CAAS,aACYpsB,GAAI,UAAU2L,CAAG,EAC9BA,eACa3L,GAAI,aAAa2L,CAAG,EACjCA,EAAMA,EAAI,SAAU,EAAG,UACd,OAAOA,GAAQ,SAGxB,MAAM,IAAI,UAAU,8DAA8D,EAEpF3D,EAAKxM,CAAC,EAAImQ,CACX,CACD,IAAIokB,EAAM,IAAI+oB,EACd,OAAAA,EAAM,MAAM/oB,EAAK/nB,CAAI,EACd+nB,CACX,CACA,EAAG,CACD,oBAAqB,EACvB,CAAC,EACDolG,GAAA,qBAA+BC,cCnD/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIr1H,GAAMjE,GACNk3B,IAAYv0B,GACZ6d,IAAStc,GACT8gB,IAAWre,EACXmyH,IAA2Bp9G,GAC3BlV,IAAO,MACPia,IAAe,CAAC,OAAO,EACvB84G,OAAwCv0G,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CAChG,IAAI3d,EAAQ2d,EAAK,MAOjB,SAASm0G,EAAavtH,EAAMm3D,EAAMxiD,EAAO,CACvC,IAAIhe,EAAGyB,EACP,OAAI4H,EAAK,CAAC,IACRrJ,EAAIqJ,EAAK,CAAC,EAAE,QAAO,EAAG,SAAS2U,CAAK,GAElC3U,EAAK,CAAC,OACAhI,GAAI,cAAcgI,EAAK,CAAC,CAAC,MAAShI,GAAI,0BAA0BgI,EAAK,CAAC,CAAC,EAE7E5H,EAAW4H,EAAK,CAAC,EAAE,QAAO,EAAG,SAAS2U,CAAK,EAG3Cvc,KAAey0H,IAAyB,yBAAyB7sH,EAAK,CAAC,EAAGm3D,EAAMxiD,CAAK,GAGlF1D,EAAIta,EAAGyB,CAAQ,CACvB,CACDm1H,EAAa,QAAU,GAGvB,IAAIt8G,EAAMxV,EAAM,MAAO,CACrB,kBAAmB,SAAuB9E,EAAGyB,EAAU,CACrD,OAAO4gB,GAAKriB,EAAGyB,EAAUzB,CAAC,CAC3B,EACD,mBAAoB,SAAwBA,EAAGyB,EAAU,CACvD,OAAOzB,EAAE,OAAOqiB,GAAKriB,EAAE,UAAWyB,EAAUzB,CAAC,CAAC,CAC/C,CACL,CAAG,EACD,OAAO42H,CACT,EAAG,CACD,oBAAqB,EACvB,CAAC,EAUyBF,GAAA,mBAAGC,IAC7B,SAASt0G,GAAK3e,EAAOjC,EAAUo1H,EAAM,CAEnC,IAAIC,KAAgBxiG,IAAU,kBAAkB7yB,CAAQ,EACxD,SAAS80B,EAAQ/0B,EAAO8H,EAAO,CAC7B,OAAI,MAAM,QAAQ9H,CAAK,KACVoc,IAAO,KAAKpc,EAAO,SAAUe,EAAO1F,EAAG,CAEhD,OAAO05B,EAAQh0B,EAAO+G,EAAM,OAAOzM,EAAI,CAAC,CAAC,CACjD,CAAO,EAGGi6H,IAAc,EACTr1H,EAASD,CAAK,EACZs1H,IAAc,EAChBr1H,EAASD,EAAO8H,CAAK,EAGrB7H,EAASD,EAAO8H,EAAOutH,CAAI,CAGvC,CACD,OAAOtgG,EAAQ7yB,EAAO,CAAA,CAAE,CAC1B,iBClFA,OAAO,eAAeqzH,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAGC,IAC5B,IAAI31H,GAAMjE,GAIV,SAAS45H,IAAkB3tH,EAAM,CAC/B,GAAIA,EAAK,SAAW,MAAShI,GAAI,cAAcgI,EAAK,CAAC,CAAC,EAAG,CACvDA,EAAOA,EAAK,QACZ,IAAI6R,EAAM7R,EAAK,CAAC,KACRhI,GAAI,UAAU6Z,CAAG,EACvB7R,EAAK,CAAC,EAAI6R,EAAM,KACH7Z,GAAI,aAAa6Z,CAAG,IACjC7R,EAAK,CAAC,EAAI6R,EAAI,MAAM,CAAC,EAExB,CACD,OAAO7R,CACT,CCnBA,OAAO,eAAe4tH,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAI70G,IAAWhlB,EACXukE,IAAkB5hE,GAClB0vD,IAAOnuD,GACP41H,IAAqBnzH,GACrBH,IAAO,MACPia,IAAe,CAAC,QAAS,SAAU,UAAW,QAAQ,EACtDs5G,OAAwC/0G,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CAChG,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdyiC,EAAUziC,EAAK,QACfu7B,EAASv7B,EAAK,OACZ7I,KAAU61C,IAAK,WAAW,CAC5B,MAAO3qD,EACP,OAAQ9H,EACR,QAASkoD,EACT,OAAQlH,CACZ,CAAG,EASD,OAAOl5C,EAAM,MAAO,CAClB,SAAU,SAAauE,EAAM,CAC3BA,KAAW6tH,IAAmB,mBAAmB7tH,CAAI,EACrD,GAAI,CACF,OAAOuQ,EAAI,MAAM,KAAMvQ,CAAI,CAC5B,OAAQS,EAAK,CACZ,QAAU63D,IAAgB,gBAAgB73D,CAAG,CAC9C,CACF,CACL,CAAG,CACH,EAAG,CACD,oBAAqB,EACvB,CAAC,EACDmtH,GAAA,mBAA6BE,cC1C7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAIh1G,IAAWhlB,EACXukE,IAAkB5hE,GAClBglG,IAAQzjG,GACR41H,IAAqBnzH,GACrBH,IAAO,OACPia,IAAe,CAAC,QAAS,MAAO,QAAQ,EACxCw5G,OAAyCj1G,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CACjG,IAAI3d,EAAQ2d,EAAK,MACf0K,EAAM1K,EAAK,IACXgE,EAAShE,EAAK,OACZsrE,KAAWgX,IAAM,YAAY,CAC/B,MAAOjgG,EACP,IAAKqoB,EACL,OAAQ1G,CACZ,CAAG,EASD,OAAO3hB,EAAM,OAAQ,CACnB,SAAU,SAAauE,EAAM,CAC3BA,KAAW6tH,IAAmB,mBAAmB7tH,CAAI,EACrD,GAAI,CACF,OAAO0kF,EAAK,MAAM,KAAM1kF,CAAI,CAC7B,OAAQS,EAAK,CACZ,QAAU63D,IAAgB,gBAAgB73D,CAAG,CAC9C,CACF,CACL,CAAG,CACH,EAAG,CACD,oBAAqB,EACvB,CAAC,EACDstH,GAAA,oBAA8BC,cCxC9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIl1G,IAAWhlB,EACXukE,IAAkB5hE,GAClB6vD,IAAOtuD,GACP41H,IAAqBnzH,GACrBH,IAAO,MACPia,IAAe,CAAC,QAAS,SAAU,UAAW,SAAS,EACvD05G,OAAwCn1G,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CAChG,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdyiC,EAAUziC,EAAK,QACf4zB,EAAU5zB,EAAK,QACbhY,KAAUmlD,IAAK,WAAW,CAC5B,MAAO9qD,EACP,OAAQ9H,EACR,QAASkoD,EACT,QAAS7O,CACb,CAAG,EASD,OAAOvxC,EAAM,MAAO,CAClB,SAAU,SAAauE,EAAM,CAC3BA,KAAW6tH,IAAmB,mBAAmB7tH,CAAI,EACrD,GAAI,CACF,OAAOoB,EAAI,MAAM,KAAMpB,CAAI,CAC5B,OAAQS,EAAK,CACZ,QAAU63D,IAAgB,gBAAgB73D,CAAG,CAC9C,CACF,CACL,CAAG,CACH,EAAG,CACD,oBAAqB,EACvB,CAAC,EACDwtH,GAAA,mBAA6BC,cC1C7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAIp1G,IAAWhlB,EACXsiG,IAAS3/F,GACT6D,IAAO,QACPia,IAAe,CAAC,QAAS,SAAU,UAAW,aAAc,UAAW,YAAa,SAAU,UAAU,EACxG45G,OAA0Cr1G,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CAClG,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACdU,EAASV,EAAK,OACdsjB,EAAYtjB,EAAK,UACjB4zB,EAAU5zB,EAAK,QACfs7B,EAAYt7B,EAAK,UACjBu7B,EAASv7B,EAAK,OACdw7B,EAAWx7B,EAAK,SACdmT,KAAY8pE,IAAO,aAAa,CAClC,MAAO56F,EACP,OAAQ9H,EACR,OAAQmmB,EACR,UAAW4iB,EACX,QAASsQ,EACT,UAAW0H,EACX,OAAQC,EACR,SAAUC,CACd,CAAG,EAQD,OAAOn5C,EAAM,QAAS,CACpB,SAAU,SAAauE,EAAM,CAC3B,IAAIsgD,EAAYtgD,EAAK,OAAS,EAC1BV,EAAOU,EAAKsgD,CAAS,EACzB,OAAI,OAAOhhD,GAAS,WAElBU,EAAK,KAAK,EAAI,EAETusB,EAAM,MAAM,KAAMvsB,CAAI,CAC9B,CACL,CAAG,CACH,EAAG,CACD,oBAAqB,EACvB,CAAC,EACDmuH,GAAA,qBAA+BC,cChD/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIt1G,IAAWhlB,EACX2jD,IAAOhhD,GACP4hE,IAAkBrgE,GAClBD,IAAM0C,GACNH,IAAO,MACPia,IAAe,CAAC,QAAS,QAAS,SAAU,OAAO,EASnD85G,OAAwCv1G,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CAChG,IAAI3d,EAAQ2d,EAAK,MACf03B,EAAQ13B,EAAK,MACbU,EAASV,EAAK,OACdmT,EAAQnT,EAAK,MACXkU,KAAUoqB,IAAK,WAAW,CAC5B,MAAOj8C,EACP,MAAOq1C,EACP,OAAQh3B,EACR,MAAOyS,CACX,CAAG,EAGD,OAAO9wB,EAAM,MAAO,CAClB,SAAU,SAAauE,EAAM,CAE3B,IAAIsgD,EAAYtgD,EAAK,OAAS,EAC1BV,EAAOU,EAAKsgD,CAAS,KACjBtoD,IAAI,UAAUsH,CAAI,IACxBU,EAAKsgD,CAAS,EAAIhhD,EAAO,GAE3B,GAAI,CACF,OAAOguB,EAAI,MAAM,KAAMttB,CAAI,CAC5B,OAAQS,EAAK,CACZ,QAAU63D,IAAgB,gBAAgB73D,CAAG,CAC9C,CACF,CACL,CAAG,CACH,EAAG,CACD,oBAAqB,EACvB,CAAC,EACD4tH,GAAA,mBAA6BC,cCjD7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIx1G,IAAWhlB,EACXukE,IAAkB5hE,GAClBm8D,IAAU56D,GACVsC,IAAO,SACPia,IAAe,CAAC,QAAS,QAAQ,EACjCg6G,OAA2Cz1G,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CACnG,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACZ0+B,KAAa+a,IAAQ,cAAc,CACrC,MAAOp3D,EACP,OAAQqe,CACZ,CAAG,EAQD,OAAOre,EAAM,SAAU,CACrB,SAAU,SAAauE,EAAM,CAC3B,GAAI,CACF,OAAO83C,EAAO,MAAM,KAAM93C,CAAI,CAC/B,OAAQS,EAAK,CACZ,QAAU63D,IAAgB,gBAAgB73D,CAAG,CAC9C,CACF,CACL,CAAG,CACH,EAAG,CACD,oBAAqB,EACvB,CAAC,EACD8tH,GAAA,sBAAgCC,cCnChC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIz2H,GAAMjE,GACNukE,IAAkB5hE,GAClBqiB,IAAW9gB,EACXy4C,IAAUh2C,GACVH,IAAO,SACPia,IAAe,CAAC,QAAS,SAAU,WAAW,EAC9Ck6G,OAA2C31G,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CACnG,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdlO,EAAYkO,EAAK,UACfsrB,KAAagM,IAAQ,cAAc,CACrC,MAAOj1C,EACP,OAAQqe,EACR,UAAW5O,CACf,CAAG,EASD,OAAOzP,EAAM,SAAU,CACrB,SAAU,SAAauE,EAAM,CAE3B,IAAIsgD,EAAYtgD,EAAK,OAAS,EAC1BV,EAAOU,EAAKsgD,CAAS,KACjBtoD,GAAI,UAAUsH,CAAI,EACxBU,EAAKsgD,CAAS,EAAIhhD,EAAO,KACZtH,GAAI,aAAasH,CAAI,IAClCU,EAAKsgD,CAAS,EAAIhhD,EAAK,MAAM,CAAC,GAEhC,GAAI,CACF,OAAOolC,EAAO,MAAM,KAAM1kC,CAAI,CAC/B,OAAQS,EAAK,CACZ,QAAU63D,IAAgB,gBAAgB73D,CAAG,CAC9C,CACF,CACL,CAAG,CACH,EAAG,CACD,oBAAqB,EACvB,CAAC,EACDguH,GAAA,sBAAgCC,cC/ChC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAI51G,IAAWhlB,EACXukE,IAAkB5hE,GAClBw8C,IAAQj7C,GACR41H,IAAqBnzH,GACrBH,GAAO,OACPia,IAAe,CAAC,QAAS,SAAU,WAAY,SAAU,WAAW,EACpEo6G,OAAyC71G,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACjG,IAAI3d,EAAQ2d,EAAK,MACfU,EAASV,EAAK,OACdgI,EAAWhI,EAAK,SAChBtO,EAASsO,EAAK,OACdsjB,EAAYtjB,EAAK,UACflL,KAAWglC,IAAM,YAAY,CAC/B,MAAOz3C,EACP,OAAQqe,EACR,SAAUsH,EACV,OAAQtW,EACR,UAAW4xB,CACf,CAAG,EAQD,OAAOjhC,EAAMlB,GAAM,CACjB,SAAU,SAAayF,EAAM,CAC3BA,KAAW6tH,IAAmB,mBAAmB7tH,CAAI,EACrD,GAAI,CACF,OAAOkO,EAAK,MAAM,KAAMlO,CAAI,CAC7B,OAAQS,EAAK,CACZ,QAAU63D,IAAgB,gBAAgB73D,CAAG,CAC9C,CACF,CACL,CAAG,CACH,EAAG,CACD,oBAAqB,EACvB,CAAC,EACDkuH,GAAA,oBAA8BC,cC3C9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAI91G,IAAWhlB,EACXooG,IAAOzlG,GACP4hE,IAAkBrgE,GAClB41H,IAAqBnzH,GACrBH,IAAO,MACPia,IAAe,CAAC,QAAS,MAAO,OAAQ,UAAU,EASlDs6G,OAAwC/1G,IAAS,SAASxe,IAAMia,IAAc,SAAU4E,EAAM,CAChG,IAAI3d,EAAQ2d,EAAK,MACfnI,EAAMmI,EAAK,IACX+L,EAAO/L,EAAK,KACZosE,EAAWpsE,EAAK,SACd+rE,KAAUgX,IAAK,WAAW,CAC5B,MAAO1gG,EACP,IAAKwV,EACL,KAAMkU,EACN,SAAUqgE,CACd,CAAG,EACD,OAAO/pF,EAAM,MAAO,CAClB,SAAU,SAAauE,EAAM,CAC3BA,KAAW6tH,IAAmB,mBAAmB7tH,CAAI,EACrD,GAAI,CACF,OAAOmlF,EAAI,MAAM,KAAMnlF,CAAI,CAC5B,OAAQS,EAAK,CACZ,QAAU63D,IAAgB,gBAAgB73D,CAAG,CAC9C,CACF,CACL,CAAG,CACH,EAAG,CACD,oBAAqB,EACvB,CAAC,EACDouH,GAAA,mBAA6BC,cC1C7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIh2G,IAAWhlB,EACXukE,IAAkB5hE,GAClB6lG,IAAOtkG,GACP41H,IAAqBnzH,GAQrBH,GAAO,MACPia,IAAe,CAAC,QAAS,SAAU,MAAO,SAAS,EACnDw6G,OAAwCj2G,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CAChG,IAAI3d,EAAQ2d,EAAK,MACfzlB,EAASylB,EAAK,OACd0K,EAAM1K,EAAK,IACXyiC,EAAUziC,EAAK,QACb2J,KAAUw5E,IAAK,WAAW,CAC5B,MAAO9gG,EACP,OAAQ9H,EACR,IAAKmwB,EACL,QAAS+3B,CACb,CAAG,EACD,OAAOpgD,EAAMlB,GAAM,CACjB,SAAU,SAAayF,EAAM,CAC3BA,KAAW6tH,IAAmB,mBAAmB7tH,CAAI,EACrD,GAAI,CACF,OAAO+iB,EAAI,MAAM,KAAM/iB,CAAI,CAC5B,OAAQS,EAAK,CACZ,QAAU63D,IAAgB,gBAAgB73D,CAAG,CAC9C,CACF,CACL,CAAG,CACH,EAAG,CACD,oBAAqB,EACvB,CAAC,EACDsuH,GAAA,mBAA6BC,cCzC7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIj3H,GAAMjE,GACNglB,IAAWriB,EACX4hE,IAAkBrgE,GAClBokG,IAAU3hG,GAQVH,GAAO,SACPia,IAAe,CAAC,QAAS,MAAO,WAAW,EAC3C06G,OAA2Cn2G,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACnG,IAAI3d,EAAQ2d,EAAK,MACf0K,EAAM1K,EAAK,IACX+kB,EAAY/kB,EAAK,UACfisE,KAAagX,IAAQ,cAAc,CACrC,MAAO5gG,EACP,IAAKqoB,EACL,UAAWqa,CACf,CAAG,EACD,OAAO1iC,EAAMlB,GAAM,CACjB,SAAU,SAAayF,EAAM,CAE3B,GAAIA,EAAK,SAAW,MAAShI,GAAI,cAAcgI,EAAK,CAAC,CAAC,EAAG,CACvD,IAAI6R,EAAM7R,EAAK,CAAC,KACRhI,GAAI,UAAU6Z,CAAG,EACvB7R,EAAK,CAAC,EAAI6R,EAAM,KACH7Z,GAAI,aAAa6Z,CAAG,IACjC7R,EAAK,CAAC,EAAI6R,EAAI,MAAM,CAAC,EAExB,CACD,GAAI,CACF,OAAOwzE,EAAO,MAAM,KAAMrlF,CAAI,CAC/B,OAAQS,EAAK,CACZ,QAAU63D,IAAgB,gBAAgB73D,CAAG,CAC9C,CACF,CACL,CAAG,CACH,EAAG,CACD,oBAAqB,EACvB,CAAC,EACDwuH,GAAA,sBAAgCC,cC/ChC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC8BA,GAAA,wBAAG,OAClC,IAAIp2G,IAAWhlB,EACXukE,IAAkB5hE,GAClB+lG,IAAYxkG,GACZ41H,IAAqBnzH,GACrBH,GAAO,WACPia,IAAe,CAAC,QAAS,MAAO,WAAY,WAAY,SAAU,QAAS,OAAO,EASlF46G,OAA6Cr2G,IAAS,SAASxe,GAAMia,IAAc,SAAU4E,EAAM,CACrG,IAAI3d,EAAQ2d,EAAK,MACf0K,EAAM1K,EAAK,IACXgI,EAAWhI,EAAK,SAChB6vB,EAAW7vB,EAAK,SAChBgE,EAAShE,EAAK,OACdklB,EAAQllB,EAAK,MACbiiC,EAAQjiC,EAAK,MACXosE,KAAeiX,IAAU,gBAAgB,CAC3C,MAAOhhG,EACP,IAAKqoB,EACL,SAAU1C,EACV,SAAU6nB,EACV,OAAQ7rB,EACR,MAAOkhB,EACP,MAAO+c,CACX,CAAG,EACD,OAAO5/C,EAAMlB,GAAM,CACjB,SAAU,SAAayF,EAAM,CAC3BA,KAAW6tH,IAAmB,mBAAmB7tH,CAAI,EACrD,GAAI,CACF,OAAOwlF,EAAS,MAAM,KAAMxlF,CAAI,CACjC,OAAQS,EAAK,CACZ,QAAU63D,IAAgB,gBAAgB73D,CAAG,CAC9C,CACF,CACL,CAAG,CACH,EAAG,CACD,oBAAqB,EACvB,CAAC,EACD0uH,GAAA,wBAAkCC,iBChDlC,OAAO,eAAwBjnG,EAAA,aAAc,CAC3C,MAAO,EACT,CAAC,EACD,OAAO,eAAeA,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkkE,EAAK,SACb,CACH,CAAC,EACD,OAAO,eAAelkE,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOknG,GAAc,kBACtB,CACH,CAAC,EACD,OAAO,eAAelnG,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOw0E,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAex0E,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO00E,GAAO,WACf,CACH,CAAC,EACD,OAAO,eAAe10E,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO40E,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAe50E,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO80E,GAAO,WACf,CACH,CAAC,EACD,OAAO,eAAe90E,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOg1E,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAeh1E,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOk1E,GAAO,WACf,CACH,CAAC,EACD,OAAO,eAAel1E,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOokE,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAepkE,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmnG,EAAW,eACnB,CACH,CAAC,EACD,OAAO,eAAennG,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqrE,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAerrE,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqW,EAAO,WACf,CACH,CAAC,EACD,OAAO,eAAerW,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOonG,GAAgB,oBACxB,CACH,CAAC,EACD,OAAO,eAAepnG,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqqE,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAerqE,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqnG,GAAW,eACnB,CACH,CAAC,EACD,OAAO,eAAernG,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOo1E,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAep1E,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOs1E,GAAO,WACf,CACH,CAAC,EACD,OAAO,eAAet1E,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOw1E,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAex1E,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO01E,GAAO,WACf,CACH,CAAC,EACD,OAAO,eAAe11E,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOsnG,GAAgB,oBACxB,CACH,CAAC,EACD,OAAO,eAAetnG,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO41E,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAe51E,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO81E,GAAO,WACf,CACH,CAAC,EACD,OAAO,eAAe91E,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOg2E,GAAO,WACf,CACH,CAAC,EACD,OAAO,eAAeh2E,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,gBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,cAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6pE,GAAa,iBACrB,CACH,CAAC,EACD,OAAO,eAAe7pE,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwjB,EAAW,oBACnB,CACH,CAAC,EACD,OAAO,eAAexjB,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4gE,EAAW,eACnB,CACH,CAAC,EACD,OAAO,eAAe5gE,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO43E,EAAK,SACb,CACH,CAAC,EACD,OAAO,eAAe53E,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+oE,GAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAe/oE,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOipE,GAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAejpE,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmpE,GAAO,WACf,CACH,CAAC,EACD,OAAO,eAAenpE,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqpE,GAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAerpE,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwnG,GAAW,eACnB,CACH,CAAC,EACD,OAAO,eAAexnG,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,kBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,gBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,eAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8gE,EAAS,aACjB,CACH,CAAC,EACD,OAAO,eAAe9gE,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+pE,GAAS,aACjB,CACH,CAAC,EACD,OAAO,eAAe/pE,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOskE,EAAM,UACd,CACH,CAAC,EACD,OAAO,eAAetkE,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwkE,EAAM,UACd,CACH,CAAC,EACD,OAAO,eAAexkE,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOynG,GAAO,WACf,CACH,CAAC,EACD,OAAO,eAAeznG,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0nG,GAAO,gBACf,CACH,CAAC,EACD,OAAO,eAAe1nG,EAAS,gCAAiC,CAC9D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,6BAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO83E,EAAO,WACf,CACH,CAAC,EACD,OAAO,eAAe93E,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4oB,GAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAe5oB,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2nG,GAAiB,qBACzB,CACH,CAAC,EACD,OAAO,eAAe3nG,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmO,GAAc,kBACtB,CACH,CAAC,EACD,OAAO,eAAenO,EAAS,4BAA6B,CAC1D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOuvE,GAAqB,yBAC7B,CACH,CAAC,EACD,OAAO,eAAevvE,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2wE,GAAS,aACjB,CACH,CAAC,EACD,OAAO,eAAe3wE,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOi7B,GAAgB,oBACxB,CACH,CAAC,EACD,OAAO,eAAej7B,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8wE,GAAa,iBACrB,CACH,CAAC,EACD,OAAO,eAAe9wE,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4nG,GAAS,aACjB,CACH,CAAC,EACD,OAAO,eAAe5nG,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOzC,EAAS,aACjB,CACH,CAAC,EACD,OAAO,eAAeyC,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4Z,EAAS,kBACjB,CACH,CAAC,EACD,OAAO,eAAe5Z,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOiqE,GAAa,iBACrB,CACH,CAAC,EACD,OAAO,eAAejqE,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOuoB,GAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAevoB,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6nG,GAAiB,qBACzB,CACH,CAAC,EACD,OAAO,eAAe7nG,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8nG,GAAiB,qBACzB,CACH,CAAC,EACD,OAAO,eAAe9nG,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,wBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOuqE,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAevqE,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+nG,GAAc,kBACtB,CACH,CAAC,EACD,OAAO,eAAe/nG,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOk2E,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAel2E,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOo2E,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAep2E,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOs2E,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAet2E,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOw2E,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAex2E,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,aAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+rE,GAAO,WACf,CACH,CAAC,EACD,OAAO,eAAe/rE,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOihE,GAAY,gBACpB,CACH,CAAC,EACD,OAAO,eAAejhE,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOipB,GAAO,WACf,CACH,CAAC,EACD,OAAO,eAAejpB,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO02E,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAe12E,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO42E,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAe52E,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOksE,GAAY,gBACpB,CACH,CAAC,EACD,OAAO,eAAelsE,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0kE,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAe1kE,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOk0E,GAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAel0E,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgoG,GAAiB,qBACzB,CACH,CAAC,EACD,OAAO,eAAehoG,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO28B,GAAW,eACnB,CACH,CAAC,EACD,OAAO,eAAe38B,EAAS,yBAA0B,CACvD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOioG,EAAa,sBACrB,CACH,CAAC,EACD,OAAO,eAAejoG,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOiiE,GAAY,gBACpB,CACH,CAAC,EACD,OAAO,eAAejiE,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOosE,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAepsE,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,kBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOupB,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAevpB,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+qB,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAe/qB,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkoG,GAAe,mBACvB,CACH,CAAC,EACD,OAAO,eAAeloG,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOirE,GAAU,cAClB,CACH,CAAC,EACD,OAAO,eAAejrE,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4kE,GAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAe5kE,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmoG,GAAc,kBACtB,CACH,CAAC,EACD,OAAO,eAAenoG,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwsE,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAexsE,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8kE,GAAW,eACnB,CACH,CAAC,EACD,OAAO,eAAe9kE,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOglE,GAAa,iBACrB,CACH,CAAC,EACD,OAAO,eAAehlE,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOklE,GAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAellE,EAAS,UAAW,CACxC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoO,GAAW,OACnB,CACH,CAAC,EACD,OAAO,eAAepO,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,kBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0sE,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAe1sE,EAAS,yBAA0B,CACvD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,sBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,kBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,yBAA0B,CACvD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,sBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOixE,GAAO,WACf,CACH,CAAC,EACD,OAAO,eAAejxE,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOooG,EAAa,iBACrB,CACH,CAAC,EACD,OAAO,eAAepoG,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmxE,GAAW,eACnB,CACH,CAAC,EACD,OAAO,eAAenxE,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkzE,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAelzE,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6qE,GAAU,cAClB,CACH,CAAC,EACD,OAAO,eAAe7qE,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOolE,EAAK,SACb,CACH,CAAC,EACD,OAAO,eAAeplE,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwlE,GAAO,UACf,CACH,CAAC,EACD,OAAO,eAAexlE,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOslE,EAAM,WACd,CACH,CAAC,EACD,OAAO,eAAetlE,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOyvE,GAAW,eACnB,CACH,CAAC,EACD,OAAO,eAAezvE,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoO,GAAW,WACnB,CACH,CAAC,EACD,OAAO,eAAepO,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,aAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,mBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqxB,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAerxB,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqoG,GAAe,wBACvB,CACH,CAAC,EACD,OAAO,eAAeroG,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4sE,EAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAe5sE,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOsoG,GAAiB,qBACzB,CACH,CAAC,EACD,OAAO,eAAetoG,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,mBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,oBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0lE,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAe1lE,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8sE,EAAS,aACjB,CACH,CAAC,EACD,OAAO,eAAe9sE,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4lE,GAAO,WACf,CACH,CAAC,EACD,OAAO,eAAe5lE,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgqB,GAAS,aACjB,CACH,CAAC,EACD,OAAO,eAAehqB,EAAS,yBAA0B,CACvD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOuoG,GAAkB,sBAC1B,CACH,CAAC,EACD,OAAO,eAAevoG,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOvY,EAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAeuY,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOC,EAAU,cAClB,CACH,CAAC,EACD,OAAO,eAAeD,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOikB,EAAU,mBAClB,CACH,CAAC,EACD,OAAO,eAAejkB,EAAS,+BAAgC,CAC7D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwoG,GAAwB,4BAChC,CACH,CAAC,EACD,OAAO,eAAexoG,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOyoG,GAAc,kBACtB,CACH,CAAC,EACD,OAAO,eAAezoG,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2vE,GAAO,WACf,CACH,CAAC,EACD,OAAO,eAAe3vE,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,iBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8lE,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAe9lE,EAAS,0BAA2B,CACxD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOitE,GAAmB,uBAC3B,CACH,CAAC,EACD,OAAO,eAAejtE,EAAS,4BAA6B,CAC1D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,yBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,aAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,mBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOi4E,EAAiB,qBACzB,CACH,CAAC,EACD,OAAO,eAAej4E,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+qE,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAe/qE,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0oG,GAAM,eACd,CACH,CAAC,EACD,OAAO,eAAe1oG,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOm4E,EAAK,SACb,CACH,CAAC,EACD,OAAO,eAAen4E,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOsrC,GAAO,WACf,CACH,CAAC,EACD,OAAO,eAAetrC,EAAS,UAAW,CACxC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoO,GAAW,OACnB,CACH,CAAC,EACD,OAAO,eAAepO,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqqB,GAAU,cAClB,CACH,CAAC,EACD,OAAO,eAAerqB,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOovE,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAepvE,EAAS,WAAY,CACzC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOyqE,GAAI,QACZ,CACH,CAAC,EACD,OAAO,eAAezqE,EAAS,kCAAmC,CAChE,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2oG,GAAsB,+BAC9B,CACH,CAAC,EACD,OAAO,eAAe3oG,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2O,GAAO,WACf,CACH,CAAC,EACD,OAAO,eAAe3O,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4oG,GAAa,gBACrB,CACH,CAAC,EACD,OAAO,eAAe5oG,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6oG,GAAW,eACnB,CACH,CAAC,EACD,OAAO,eAAe7oG,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8oG,GAAgB,oBACxB,CACH,CAAC,EACD,OAAO,eAAe9oG,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoO,GAAW,cACnB,CACH,CAAC,EACD,OAAO,eAAepO,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmrE,GAAW,eACnB,CACH,CAAC,EACD,OAAO,eAAenrE,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOotE,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAeptE,EAAS,kCAAmC,CAChE,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,+BAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOimE,GAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAejmE,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOq4E,EAAW,eACnB,CACH,CAAC,EACD,OAAO,eAAer4E,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqP,EAAO,WACf,CACH,CAAC,EACD,OAAO,eAAerP,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOw4E,EAAY,gBACpB,CACH,CAAC,EACD,OAAO,eAAex4E,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO04E,EAAW,eACnB,CACH,CAAC,EACD,OAAO,eAAe14E,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO44E,EAAY,gBACpB,CACH,CAAC,EACD,OAAO,eAAe54E,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO84E,GAAS,aACjB,CACH,CAAC,EACD,OAAO,eAAe94E,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOg5E,EAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAeh5E,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+vE,GAAc,kBACtB,CACH,CAAC,EACD,OAAO,eAAe/vE,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,cAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2qB,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAe3qB,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoO,GAAW,UACnB,CACH,CAAC,EACD,OAAO,eAAepO,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoO,GAAW,SACnB,CACH,CAAC,EACD,OAAO,eAAepO,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoO,GAAW,YACnB,CACH,CAAC,EACD,OAAO,eAAepO,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoO,GAAW,WACnB,CACH,CAAC,EACD,OAAO,eAAepO,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqxE,GAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAerxE,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOuxE,GAAU,cAClB,CACH,CAAC,EACD,OAAO,eAAevxE,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmmE,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAenmE,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmiE,GAAW,eACnB,CACH,CAAC,EACD,OAAO,eAAeniE,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOupE,GAAW,eACnB,CACH,CAAC,EACD,OAAO,eAAevpE,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6vE,GAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAe7vE,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2mE,GAAM,SACd,CACH,CAAC,EACD,OAAO,eAAe3mE,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqmE,GAAK,WACb,CACH,CAAC,EACD,OAAO,eAAermE,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOymE,GAAO,WACf,CACH,CAAC,EACD,OAAO,eAAezmE,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOumE,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAevmE,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,eAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqiE,GAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAeriE,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOuiE,GAAW,eACnB,CACH,CAAC,EACD,OAAO,eAAeviE,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOyiE,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAeziE,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8rD,GAAS,aACjB,CACH,CAAC,EACD,OAAO,eAAe9rD,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmoE,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAenoE,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOozE,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAepzE,EAAS,yBAA0B,CACvD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,sBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,4BAA6B,CAC1D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,yBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnP,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAemP,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+oG,GAAc,kBACtB,CACH,CAAC,EACD,OAAO,eAAe/oG,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqhE,EAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAerhE,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgpG,EAAQ,iBAChB,CACH,CAAC,EACD,OAAO,eAAehpG,EAAS,0BAA2B,CACxD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0tE,EAAmB,uBAC3B,CACH,CAAC,EACD,OAAO,eAAe1tE,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4tE,EAAoB,wBAC5B,CACH,CAAC,EACD,OAAO,eAAe5tE,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8tE,EAAgB,oBACxB,CACH,CAAC,EACD,OAAO,eAAe9tE,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOi+B,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAej+B,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOipG,GAAc,kBACtB,CACH,CAAC,EACD,OAAO,eAAejpG,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOuzE,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAevzE,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkpG,GAAe,mBACvB,CACH,CAAC,EACD,OAAO,eAAelpG,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOyzE,GAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAezzE,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOo+B,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAep+B,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmpG,GAAc,kBACtB,CACH,CAAC,EACD,OAAO,eAAenpG,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6mE,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAe7mE,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmzB,EAAM,UACd,CACH,CAAC,EACD,OAAO,eAAenzB,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,eAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,kBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,4BAA6B,CAC1D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,yBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,iBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOiwE,GAAa,iBACrB,CACH,CAAC,EACD,OAAO,eAAejwE,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+mE,GAAU,cAClB,CACH,CAAC,EACD,OAAO,eAAe/mE,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOopG,GAAgB,oBACxB,CACH,CAAC,EACD,OAAO,eAAeppG,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoO,GAAW,SACnB,CACH,CAAC,EACD,OAAO,eAAepO,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,iBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOixC,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAejxC,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0rC,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAe1rC,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOurE,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAevrE,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOknE,GAAS,aACjB,CACH,CAAC,EACD,OAAO,eAAelnE,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOonE,GAAU,cAClB,CACH,CAAC,EACD,OAAO,eAAepnE,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,qBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoO,GAAW,UACnB,CACH,CAAC,EACD,OAAO,eAAepO,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOvZ,EAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAeuZ,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOk5E,GAAS,aACjB,CACH,CAAC,EACD,OAAO,eAAel5E,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqpG,GAAY,gBACpB,CACH,CAAC,EACD,OAAO,eAAerpG,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOo5E,EAAK,SACb,CACH,CAAC,EACD,OAAO,eAAep5E,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4rB,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAe5rB,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOspG,GAAc,kBACtB,CACH,CAAC,EACD,OAAO,eAAetpG,EAAS,WAAY,CACzC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOyrE,EAAI,QACZ,CACH,CAAC,EACD,OAAO,eAAezrE,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOupG,GAAiB,qBACzB,CACH,CAAC,EACD,OAAO,eAAevpG,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOitB,GAAO,WACf,CACH,CAAC,EACD,OAAO,eAAejtB,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwpG,GAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAexpG,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOypG,GAAQ,iBAChB,CACH,CAAC,EACD,OAAO,eAAezpG,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOo9B,GAAiB,qBACzB,CACH,CAAC,EACD,OAAO,eAAep9B,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmwE,GAAc,kBACtB,CACH,CAAC,EACD,OAAO,eAAenwE,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoO,GAAW,SACnB,CACH,CAAC,EACD,OAAO,eAAepO,EAAS,WAAY,CACzC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoO,GAAW,QACnB,CACH,CAAC,EACD,OAAO,eAAepO,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqwE,GAAY,gBACpB,CACH,CAAC,EACD,OAAO,eAAerwE,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOstE,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAettE,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,kBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,oBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,kBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,gBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,0BAA2B,CACxD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,uBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,gBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4iE,GAAgB,oBACxB,CACH,CAAC,EACD,OAAO,eAAe5iE,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO01B,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAe11B,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOq0B,GAAO,WACf,CACH,CAAC,EACD,OAAO,eAAer0B,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2zB,EAAM,UACd,CACH,CAAC,EACD,OAAO,eAAe3zB,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,gBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,WAAY,CACzC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8iE,GAAI,QACZ,CACH,CAAC,EACD,OAAO,eAAe9iE,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8zE,GAAa,iBACrB,CACH,CAAC,EACD,OAAO,eAAe9zE,EAAS,6BAA8B,CAC3D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,0BAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOuwE,GAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAevwE,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOywE,GAAW,eACnB,CACH,CAAC,EACD,OAAO,eAAezwE,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkuE,GAAO,WACf,CACH,CAAC,EACD,OAAO,eAAeluE,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0pG,EAAO,gBACf,CACH,CAAC,EACD,OAAO,eAAe1pG,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2pG,GAAW,eACnB,CACH,CAAC,EACD,OAAO,eAAe3pG,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4pG,GAAgB,oBACxB,CACH,CAAC,EACD,OAAO,eAAe5pG,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgjE,GAAa,iBACrB,CACH,CAAC,EACD,OAAO,eAAehjE,EAAS,WAAY,CACzC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2qE,GAAI,QACZ,CACH,CAAC,EACD,OAAO,eAAe3qE,EAAS,8BAA+B,CAC5D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,2BAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6pG,GAAgB,oBACxB,CACH,CAAC,EACD,OAAO,eAAe7pG,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8pG,GAAU,cAClB,CACH,CAAC,EACD,OAAO,eAAe9pG,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOvV,GAAS,aACjB,CACH,CAAC,EACD,OAAO,eAAeuV,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOjW,GAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAeiW,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkjE,GAAS,aACjB,CACH,CAAC,EACD,OAAO,eAAeljE,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+pG,EAAW,eACnB,CACH,CAAC,EACD,OAAO,eAAe/pG,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgqG,GAAS,aACjB,CACH,CAAC,EACD,OAAO,eAAehqG,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOypE,GAAiB,qBACzB,CACH,CAAC,EACD,OAAO,eAAezpE,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2pE,GAAe,mBACvB,CACH,CAAC,EACD,OAAO,eAAe3pE,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOsuE,GAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAetuE,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwuE,GAAgB,oBACxB,CACH,CAAC,EACD,OAAO,eAAexuE,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunE,GAAO,WACf,CACH,CAAC,EACD,OAAO,eAAevnE,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOuvB,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAevvB,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOiqG,GAAc,kBACtB,CACH,CAAC,EACD,OAAO,eAAejqG,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,aAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoO,GAAW,aACnB,CACH,CAAC,EACD,OAAO,eAAepO,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoO,GAAW,WACnB,CACH,CAAC,EACD,OAAO,eAAepO,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,mBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOioE,GAAO,WACf,CACH,CAAC,EACD,OAAO,eAAejoE,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO82E,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAe92E,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOg3E,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAeh3E,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,qBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8xE,GAAc,kBACtB,CACH,CAAC,EACD,OAAO,eAAe9xE,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgyE,GAAe,mBACvB,CACH,CAAC,EACD,OAAO,eAAehyE,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkyE,GAAa,iBACrB,CACH,CAAC,EACD,OAAO,eAAelyE,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoyE,GAAc,kBACtB,CACH,CAAC,EACD,OAAO,eAAepyE,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOsyE,GAAa,iBACrB,CACH,CAAC,EACD,OAAO,eAAetyE,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwyE,GAAiB,qBACzB,CACH,CAAC,EACD,OAAO,eAAexyE,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0yE,GAAa,iBACrB,CACH,CAAC,EACD,OAAO,eAAe1yE,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4yE,GAAS,aACjB,CACH,CAAC,EACD,OAAO,eAAe5yE,EAAS,yBAA0B,CACvD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8yE,GAAkB,sBAC1B,CACH,CAAC,EACD,OAAO,eAAe9yE,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgzE,GAAU,cAClB,CACH,CAAC,EACD,OAAO,eAAehzE,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOynE,EAAM,UACd,CACH,CAAC,EACD,OAAO,eAAeznE,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOojE,GAAU,cAClB,CACH,CAAC,EACD,OAAO,eAAepjE,EAAS,yBAA0B,CACvD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOsjE,GAAkB,sBAC1B,CACH,CAAC,EACD,OAAO,eAAetjE,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwjE,GAAc,kBACtB,CACH,CAAC,EACD,OAAO,eAAexjE,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOk3E,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAel3E,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOo3E,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAep3E,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmtC,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAentC,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0jE,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAe1jE,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOyxE,GAAS,aACjB,CACH,CAAC,EACD,OAAO,eAAezxE,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2xE,GAAW,eACnB,CACH,CAAC,EACD,OAAO,eAAe3xE,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2qC,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAe3qC,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkqG,GAAK,cACb,CACH,CAAC,EACD,OAAO,eAAelqG,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwhE,GAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAexhE,EAAS,0BAA2B,CACxD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmqG,EAAc,uBACtB,CACH,CAAC,EACD,OAAO,eAAenqG,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,kBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0hE,EAAW,eACnB,CACH,CAAC,EACD,OAAO,eAAe1hE,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2nE,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAe3nE,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6nE,GAAO,WACf,CACH,CAAC,EACD,OAAO,eAAe7nE,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqoE,GAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAeroE,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO5U,GAAS,aACjB,CACH,CAAC,EACD,OAAO,eAAe4U,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOg0E,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAeh0E,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoqG,GAAc,kBACtB,CACH,CAAC,EACD,OAAO,eAAepqG,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,qBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmqE,GAAW,gBACnB,CACH,CAAC,EACD,OAAO,eAAenqE,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO1W,EAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAe0W,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0qC,GAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAe1qC,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqqG,GAAiB,qBACzB,CACH,CAAC,EACD,OAAO,eAAerqG,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOuoE,GAAU,cAClB,CACH,CAAC,EACD,OAAO,eAAevoE,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOo0E,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAep0E,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOsqG,GAAc,kBACtB,CACH,CAAC,EACD,OAAO,eAAetqG,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+nE,GAAW,eACnB,CACH,CAAC,EACD,OAAO,eAAe/nE,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOuqG,GAAY,gBACpB,CACH,CAAC,EACD,OAAO,eAAevqG,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4jE,GAAe,mBACvB,CACH,CAAC,EACD,OAAO,eAAe5jE,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOs3E,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAet3E,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOw3E,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAex3E,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoO,GAAW,SACnB,CACH,CAAC,EACD,OAAO,eAAepO,EAAS,4BAA6B,CAC1D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,yBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,WAAY,CACzC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO03E,GAAI,QACZ,CACH,CAAC,EACD,OAAO,eAAe13E,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+uE,GAAO,WACf,CACH,CAAC,EACD,OAAO,eAAe/uE,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOuxB,GAAW,eACnB,CACH,CAAC,EACD,OAAO,eAAevxB,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoO,GAAW,UACnB,CACH,CAAC,EACD,OAAO,eAAepO,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOu5E,EAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAev5E,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8e,EAAO,WACf,CACH,CAAC,EACD,OAAO,eAAe9e,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOyoE,EAAY,gBACpB,CACH,CAAC,EACD,OAAO,eAAezoE,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2oE,EAAW,eACnB,CACH,CAAC,EACD,OAAO,eAAe3oE,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+8B,GAAS,aACjB,CACH,CAAC,EACD,OAAO,eAAe/8B,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwqG,GAAM,eACd,CACH,CAAC,EACD,OAAO,eAAexqG,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwiC,GAAM,kBACd,CACH,CAAC,EACD,OAAO,eAAexiC,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoO,GAAW,gBACnB,CACH,CAAC,EACD,OAAO,eAAepO,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoO,GAAW,iBACnB,CACH,CAAC,EACD,OAAO,eAAepO,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8jE,GAAQ,YAChB,CACH,CAAC,EACD,OAAO,eAAe9jE,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgkE,GAAW,eACnB,CACH,CAAC,EACD,OAAO,eAAehkE,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,qBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOs0E,GAAU,cAClB,CACH,CAAC,EACD,OAAO,eAAet0E,EAAS,0BAA2B,CACxD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOyqG,GAAmB,uBAC3B,CACH,CAAC,EACD,OAAO,eAAezqG,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoO,GAAW,aACnB,CACH,CAAC,EACD,OAAO,eAAepO,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,qBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,yBAA0B,CACvD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunG,GAAmB,sBAC3B,CACH,CAAC,EACD,OAAO,eAAevnG,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6oE,GAAM,UACd,CACH,CAAC,EACD,OAAO,eAAe7oE,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2rE,GAAK,SACb,CACH,CAAC,EACD,OAAO,eAAe3rE,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+wB,GAAO,WACf,CACH,CAAC,EACD,IAAIjS,EAASlzC,GACTm+H,EAAax7H,GACbi1C,EAAa1zC,GACb8pC,EAAWrnC,GACX0xC,EAAY38B,GACZoiH,EAAS54G,GACTk4G,EAAUvlG,GACVwkG,EAAevkG,GACfo0E,EAASn0E,GACT00E,EAAaz0E,GACb40E,EAAcr+C,GACdu+C,EAAatlC,GACb6kC,EAAmB3kC,GACnBslC,EAAc7iC,GACdijC,EAAUl9B,GACVzsC,EAAS0sC,GACTw9B,EAAUv9B,GACVosD,EAAevnC,GACfspC,EAAgBppC,GAChBt6E,EAAUu6E,GACV13E,EAAU43E,GACVJ,EAAWK,GACXP,EAAaQ,GACb7jE,EAAW+jE,GACXrhE,EAAYshE,GACZF,EAAUI,GACVmM,EAAsBjM,GACtBmM,EAAkBlM,GAClB8L,EAAqB7L,GACrBH,EAAaI,GACb2G,EAAc1G,GACd4G,EAAa3G,GACbkC,EAAOhC,GACP7rD,EAAS+rD,GACT+kC,EAAa7kC,GACbgC,EAAQ9B,GACRgC,EAAQ9B,GACRgC,GAAQ/B,GACRyC,EAAOvC,GACPyC,EAAQvC,GACR2C,GAAOzC,GACP2C,GAASzC,GACT2C,GAAOzC,GACP8C,GAAO5C,GACP8C,GAAO5C,GACP8C,GAAQ5C,GACRkD,GAAOhD,GACPulC,GAAkBrlC,GAClBgD,GAAY9C,GACZiD,GAAW/C,GACXsD,EAAQpD,GACRsD,GAAQpD,GACR8D,GAAU5D,GACV8D,GAAY5D,GACZkE,GAAQhE,GACRoB,GAAUlB,GACVC,GAAeC,GACf8D,GAAU5D,GACV8D,GAAU5D,GACV8D,GAAS5D,GACT8D,GAAU5D,GACV4E,GAAO1E,GACP4E,GAAQ1E,GACR4E,GAAM1E,GACN4E,GAAM3E,GACNuF,GAAOrF,GACPuF,EAAMrF,GACNuF,GAAOrF,GACP/9C,GAAUi+C,GACV59C,GAAU89C,GACVqF,GAASnF,GACT39C,GAAS69C,GACTv9C,GAAQy9C,GACR4F,EAAU3F,GACV6F,EAAW3F,GACXn9C,GAAWq9C,GACX4F,GAAqB3F,GACrBj9C,GAAYm9C,GACZ78C,GAAQ+8C,GACR72E,GAAO+2E,GACP78C,GAAQ+8C,GACRl8C,GAAQo8C,GACRkG,GAAShG,GACTz9E,GAAW29E,GACXr+E,GAAUu+E,GACVgG,GAAU9F,GACVgG,GAAkB9F,GAClBn5C,GAAOq5C,GACPz7B,GAAQ27B,GACR19E,GAAW49E,GACXt+B,GAAUw+B,GACV33C,GAAa63C,GACb8C,GAAc5C,GACdv4C,GAASy4C,GACTn4C,GAAOq4C,GACP0F,GAAQxF,GACRsJ,GAAOpJ,GACP32C,EAAQ62C,GACRr2C,EAAQu2C,GACRziF,EAAU2iF,GACVwN,EAAOtN,GACP8O,EAAO5O,GACP2N,EAAOzN,GACPr2C,GAASu2C,GACT8M,GAAM5M,GACNgO,GAAW9N,GACXkO,GAAWhO,GACXi9B,GAAgB/8B,GAChB11C,GAAO41C,GACP/D,GAASiE,GACT7E,GAAQ+E,GACRjF,GAASmF,GACTxE,GAAYyE,GACZ3G,GAAU4G,GACVhH,GAAakH,GACb3J,GAAU4J,GACVnI,GAAUqI,GACV5J,GAAa8J,GACbrI,GAAasI,GACb/C,GAAagD,GACb9C,GAAmBgD,GACnB9C,GAAiBgD,GACjBtB,GAAOwB,GACP8D,GAAW5D,GACX9xC,GAAkB+xC,GAClB8D,GAAe5D,GACf+D,GAAS9D,GACTgE,GAAa9D,GACboE,GAAWlE,GACXoE,GAAanE,GACb6D,GAAU5D,GACV8D,GAAY5D,GACZhxC,GAAakxC,GACb9wC,GAAWgxC,GACX3wC,GAAmB4wC,GACnBrjC,GAAQsjC,GACRhwC,GAAOkwC,GACP/vC,GAAOgwC,GACPu6B,GAAwBt6B,GACxBu6B,GAAer6B,GACf85B,GAAiB55B,GACjBy7B,GAAOx7B,GACP87B,GAAQ77B,GACRnsC,GAAQosC,GACRpN,GAAUqN,GACV5N,GAAc6N,GACd0F,GAAQxF,GACR0F,GAASzF,GACT2F,GAAQ1F,GACR4F,GAAS3F,GACT6F,GAAQ3F,GACR6F,GAAS5F,GACT8F,GAAQ5F,GACR8F,GAAS5F,GACT8F,GAAQ5F,GACR8F,GAAS5F,GACT8F,GAAQ5F,GACR8F,GAAS5F,GACT8F,GAAS5F,GACT8F,GAAO5F,GACP8F,GAAQ5F,GACR8F,GAAO5F,GACP8F,GAAQ5F,GACR8F,GAAO7F,GACP+F,GAAQ7F,GACR+F,GAAO9F,GACPgG,GAAQ9F,GACRgG,GAAO9F,GACPgG,GAAQ9F,GACRgG,GAAO9F,GACPgG,GAAQ9F,GACRI,GAAgBF,GAChBI,GAAiBH,GACjBK,GAAeH,GACfK,GAAgBH,GAChBK,GAAeH,GACfK,GAAmBH,GACnBK,GAAeH,GACfK,GAAWH,GACXK,GAAoBH,GACpBK,GAAYH,GACZzO,GAAO2O,GACPznC,GAAS2nC,GACTvnC,GAAQynC,GACR3G,GAAO6G,GACPtE,GAASuE,GACT3kE,GAAS6kE,GACTviC,GAAQyiC,GACRwzB,GAAgBvzB,GAChB0zB,GAAazzB,GACb0zB,GAAkBzzB,GAClB2zB,GAAazzB,GACb+zB,GAAmB7zB,GACnB8zB,GAAgB5zB,GAChBq0B,GAA0Bn0B,GAC1Bw0B,GAAat0B,GACb80B,GAAc50B,GACd60B,GAAgB30B,GAChB40B,GAAmB10B,GACnB80B,GAAa50B,GACb80B,GAAkB50B,GAClBs1B,GAAcp1B,GACdszB,GAAgBpzB,GAChBpoD,GAASsoD,GACTqyB,GAAWnyB,GACX5K,GAAY8K,GACZ8zB,GAAU5zB,GACV2zB,GAAUzzB,GACVtT,GAAOwT,GACPnT,GAAMqT,GACNzS,GAAO2S,GACPvqB,GAAWyqB,GACX3T,GAAkB6T,GAClBiyB,GAAQ/xB,GACR+wB,GAAS7wB,GACT9L,GAAQgM,GACR0wB,GAASxwB,GACT7K,GAAO+K,GACP/J,GAAOiK,GACP/J,GAAQiK,GACR7K,GAAQ+K,GACRjS,GAASmS,GACT9P,GAASgQ,GACT9P,GAAagQ,GACb9P,GAAS+P,GACT7P,GAAQ+P,GACRtT,GAAUwT,GACVnN,GAAYqN,GACZnN,GAAaoN,GACbnE,GAAOqE,GACPvE,GAAUyE,GACVpF,GAAQsF,GACRpF,GAAUsF,GACV3F,GAAO6F,GACP3E,GAAY6E,GACZrF,GAAeuF,GACfrF,GAAOsF,GACPnrE,GAAgBqrE,GAChBjK,GAAuBm7B,GACvB/6B,GAASg7B,GACT96B,GAAU+6B,GACVn7B,GAAao7B,GACb96B,GAAgB+6B,GAChB76B,GAAe86B,GACf56B,GAAgB66B,GAChB36B,GAAc46B,GACd16B,GAAU26B,GACVz6B,GAAa06B,GACbhhC,GAAaihC,GACbvhC,GAAewhC,GACfthC,GAAWuhC,GACXrhC,GAAeshC,GACfppC,GAAaqpC,GACbpoC,GAAYqoC,GACZnoC,GAAoBooC,GACpBloC,GAAgBmoC,GAChBzoC,GAAW0oC,GACXhoC,GAAiBioC,GACjB5pC,GAAc6pC,GACd9oC,GAAe+oC,GACf/B,GAAWgC,GACXlC,GAAYmC,GACZ79F,GAAa89F,GACb3E,GAAqB4E,GACrB/E,GAAkBgF,GAClBzE,GAAmB0E,GACnB/D,GAAmBgE,GACnB/D,GAAoBgE,GACpBzD,GAAkB0D,GAClBzD,GAAgB0D,GAChBxD,GAAgByD,GAChBxD,GAAiByD,GACjBxD,GAAgByD,GAChBhD,GAAkBiD,GAClB5C,GAAgB6C,GAChBzC,GAAmB0C,GACnBlF,GAAmBmF,GACnB9E,GAAiB+E,GACjB7C,GAAgB8C,GAChB5C,GAAgB6C,GAChBnF,GAAmBoF,GACnB3C,GAAqB4C,qBC10EzB,OAAO,eAAwBrtG,EAAA,aAAc,CAC3C,MAAO,EACT,CAAC,EACDA,EAAe,KAAAA,EAAA,aAAuBA,IAAYA,EAAiB,OAAAA,EAAA,YAAsBA,YAAoBA,EAAc,IAAAA,EAAA,aAAuBA,EAAiB,OAAAA,EAAA,SAAmBA,EAAe,KAAAA,EAAA,KAAeA,eAAuBA,EAAc,IAAAA,EAAA,UAAoBA,EAAiB,OAAAA,EAAA,KAAeA,EAAqB,WAAAA,EAAA,KAAeA,MAAcA,EAAgB,MAAAA,EAAA,WAAqBA,EAAgB,MAAAA,EAAA,QAAkBA,EAAe,KAAAA,EAAA,IAAcA,OAAeA,EAAc,IAAAA,EAAA,KAAeA,qBAA6BA,EAAiB,OAAAA,EAAA,YAAsBA,UAAkBA,EAAsB,YAAAA,EAAA,eAAyBA,EAAkB,QAAAA,EAAA,oBAA8BA,EAAuB,aAAAA,EAAA,OAAiBA,QAAgBA,EAAkC,wBAAAA,EAAA,KAAeA,EAAe,KAAAA,EAAA,QAAkBA,EAAQ,QAAaA,EAAoB,UAAAA,EAAA,WAAqBA,EAAuB,aAAAA,EAAA,OAAiBA,QAAgBA,EAAiB,OAAAA,EAAA,OAAiBA,MAAcA,EAAoB,UAAAA,EAAA,YAAsBA,WAAmBA,EAAqB,WAAAA,EAAA,MAAgBA,EAAgB,MAAAA,EAAA,KAAeA,EAAgB,MAAAA,EAAA,KAAeA,QAAgBA,EAAe,KAAAA,EAAA,IAAcA,EAAgB,MAAAA,EAAA,IAAcA,EAAoB,UAAAA,EAAA,IAAcA,QAAgBA,EAAe,KAAAA,EAAA,MAAgBA,EAAe,KAAAA,EAAA,MAAgBA,EAAe,KAAAA,EAAA,IAAcA,QAAgBA,EAAgB,MAAAA,EAAA,OAAiBA,EAAe,KAAAA,EAAA,UAAoBA,EAAe,KAAAA,EAAA,aAAuBA,MAAcA,EAAgB,MAAAA,EAAA,QAAkBA,EAAoB,UAAAA,EAAA,MAAgBA,EAAiB,OAAAA,EAAA,MAAgBA,SAAiBA,EAAc,IAAAA,EAAA,KAAeA,EAAgB,MAAAA,EAAA,qBAA+BA,EAAmB,SAAAA,EAAA,cAAwBA,cAAsBA,EAAkB,QAAAA,EAAA,UAAoB,OAC/vDA,EAA0B,gBAAAA,EAAA,GAAaA,OAAeA,EAAc,IAAAA,EAAA,QAAkBA,SAAiBA,EAA0B,gBAAAA,EAAA,SAAmBA,EAAkB,QAAAA,EAAA,IAAcA,EAAe,KAAAA,EAAA,YAAsBA,iBAAyBA,EAAmB,SAAAA,EAAA,YAAsBA,cAAsBA,EAA8B,oBAAAA,EAAA,aAAuBA,YAAoBA,EAAe,KAAAA,EAAA,IAAcA,EAAc,IAAAA,EAAA,OAAiBA,EAAe,KAAAA,EAAA,IAAcA,iBAAyBA,EAA6B,mBAAAA,EAAA,kBAA4BA,SAAiBA,EAAc,IAAAA,EAAA,oBAA8BA,mBAA2BA,EAAc,IAAAA,EAAA,KAAeA,EAAkB,QAAAA,EAAA,IAAcA,EAAoB,UAAAA,EAAA,OAAiBA,YAAoBA,EAAe,KAAAA,EAAA,MAAgBA,QAAgBA,EAAc,IAAAA,EAAA,OAAiBA,YAAoBA,EAAc,IAAAA,EAAA,SAAmBA,EAAiB,OAAAA,EAAA,KAAeA,EAAmB,SAAAA,EAAA,aAAuBA,SAAiBA,EAAkB,QAAAA,EAAA,WAAqBA,YAAoBA,EAAqB,WAAAA,EAAA,MAAgBA,YAAoBA,EAAiB,OAAAA,EAAA,0BAAoCA,EAAc,IAAAA,EAAA,UAAoBA,EAAgB,MAAAA,EAAA,GAAaA,OAAeA,EAAmB,SAAAA,EAAA,EAAYA,QAAgBA,EAAc,IAAAA,EAAA,gBAA0BA,gBAAwBA,EAAkB,QAAAA,EAAA,oBAA8BA,EAA4B,kBAAAA,EAAA,IAAcA,EAAsB,YAAAA,EAAA,MAAgBA,WAAmBA,EAAiB,OAAAA,EAAA,QAAkBA,QAAgBA,EAAkB,QAAAA,EAAA,IAAcA,iBAAyBA,EAAwB,cAAAA,EAAA,OAAiBA,EAAc,IAAAA,EAAA,cAAwBA,EAAkB,QAAAA,EAAA,UAAoBA,QAAgBA,EAAe,KAAAA,EAAA,IAAcA,EAAc,IAAAA,EAAA,UAAoBA,EAAsB,YAAAA,EAAA,MAAgBA,mBAA2BA,EAAuB,aAAAA,EAAA,iBAA2B,OAC72DA,EAAgB,MAAAA,EAAA,IAAcA,OAAeA,EAA2B,iBAAAA,EAAA,gBAA0BA,UAAkBA,EAAmB,SAAAA,EAAA,gBAA0BA,YAAoBA,EAAiB,OAAAA,EAAA,KAAeA,UAAkBA,EAAoB,UAAAA,EAAA,WAAqBA,QAAgBA,EAAiB,OAAAA,EAAA,UAAoBA,QAAgBA,EAAa,GAAAA,EAAA,oBAA8BA,EAAc,IAAAA,EAAA,KAAeA,EAAc,IAAAA,EAAA,UAAoBA,MAAcA,EAAmB,SAAAA,EAAA,OAAiBA,SAAiBA,EAAqB,WAAAA,EAAA,gBAA0BA,MAAcA,EAAkB,QAAAA,EAAA,OAAiBA,QAAgBA,EAAe,KAAAA,EAAA,UAAoBA,eAAuBA,EAAiB,OAAAA,EAAA,KAAeA,YAAoBA,EAAkB,QAAAA,EAAA,IAAcA,OAAeA,EAAe,KAAAA,EAAA,IAAcA,EAAe,KAAAA,EAAA,SAAmBA,EAA2B,iBAAAA,EAAA,QAAkBA,cAAsBA,EAA0B,gBAAAA,EAAA,YAAsBA,eAAuBA,EAAsB,YAAAA,EAAA,cAAwBA,eAAuBA,EAA0B,gBAAAA,EAAA,KAAeA,MAAcA,EAAgB,MAAAA,EAAA,cAAwBA,UAAkBA,EAAc,IAAAA,EAAA,MAAgBA,iBAAyBA,EAAiB,OAAAA,EAAA,cAAwBA,kBAA0BA,EAAiB,OAAAA,EAAA,QAAkBA,EAAmB,SAAAA,EAAA,sBAAgCA,EAAa,GAAAA,EAAA,MAAgBA,YAAoBA,EAAiB,OAAAA,EAAA,qBAA+BA,cAAsBA,EAAa,GAAAA,EAAA,WAAqBA,OAAeA,EAAgB,MAAAA,EAAA,IAAcA,iBAAyBA,EAAqB,WAAAA,EAAA,kBAA4BA,aAAqBA,EAAuB,aAAAA,EAAA,eAAyBA,eAAuBA,EAAe,KAAAA,EAAA,WAAqBA,KAAaA,EAAc,IAAAA,EAAA,aAAuB,OAChyD,IAAIstG,EAAkB1hI,GAClB2hI,EAAgBh/H,EAMhB2iB,KAA+Bq8G,EAAc,sBAAsB,CACrE,OAAQD,EAAgB,MAC1B,CAAC,EACDttG,EAAA,UAAoB9O,EACpB,IAAIC,KAA6Bo8G,EAAc,oBAAoB,CAAE,CAAA,EACrEvtG,EAAA,QAAkB7O,EAClB,IAAI1M,KAAuB8oH,EAAc,SAAS,CAChD,UAAWr8G,EACX,OAAQo8G,EAAgB,MAC1B,CAAC,EACDttG,EAAA,EAAYvb,EACZ,IAAIypE,KAA4Bq/C,EAAc,aAAa,CAAE,CAAA,EAC7DvtG,EAAA,OAAiBkuD,EACjB,IAAIs/C,KAAmCD,EAAc,qBAAqB,CACxE,UAAWr8G,EACX,OAAQo8G,EAAgB,MAC1B,CAAC,EACDttG,EAAA,cAAwBwtG,EACxB,IAAIn8G,KAA8Bk8G,EAAc,qBAAqB,CAAE,CAAA,EACvEvtG,EAAA,SAAmB3O,EACnB,IAAIhmB,KAAuBkiI,EAAc,SAAS,CAChD,QAASp8G,CACX,CAAC,EACD6O,EAAA,EAAY30B,EACZ,IAAIgjF,KAA+Bk/C,EAAc,gBAAgB,CAC/D,UAAWr8G,EACX,OAAQo8G,EAAgB,MAC1B,CAAC,EACDttG,EAAA,UAAoBquD,EACpB,IAAIh8D,KAA0Bk7G,EAAc,YAAY,CACtD,UAAWr8G,EACX,OAAQo8G,EAAgB,MAC1B,CAAC,EACDttG,EAAA,KAAe3N,EACf,IAAIq8D,KAA4B6+C,EAAc,cAAc,CAC1D,UAAWr8G,EACX,OAAQo8G,EAAgB,MAC1B,CAAC,EACDttG,EAAA,OAAiB0uD,EACjB,IAAIhuD,KAA4B6sG,EAAc,mBAAmB,CAAE,CAAA,EACnEvtG,EAAA,OAAiBU,EACjB,IAAIouD,KAA0By+C,EAAc,WAAW,CACrD,UAAWr8G,EACX,OAAQo8G,EAAgB,MAC1B,CAAC,EACDttG,EAAA,KAAe8uD,EACf,IAAIE,KAA2Bu+C,EAAc,YAAY,CAAE,CAAA,EAC3DvtG,EAAA,MAAgBgvD,EAChB,IAAInxD,KAAyB0vG,EAAc,WAAW,CACpD,UAAWr8G,EACX,OAAQo8G,EAAgB,MAC1B,CAAC,EACDttG,EAAA,IAAcnC,EACd,IAAIsC,KAA2BotG,EAAc,kBAAkB,CAAE,CAAA,EACjEvtG,EAAA,MAAgBG,EAChB,IAAIrO,KAA+By7G,EAAc,iBAAiB,CAAE,CAAA,EACpEvtG,EAAA,UAAoBlO,EACpB,IAAIs9D,KAA6Bm+C,EAAc,eAAe,CAC5D,UAAWr8G,EACX,OAAQo8G,EAAgB,MAC1B,CAAC,EACDttG,EAAA,QAAkBovD,EAClB,IAAIq+C,KAAmCF,EAAc,qBAAqB,CACxE,UAAWr8G,EACX,OAAQo8G,EAAgB,MAC1B,CAAC,EACDttG,EAAA,cAAwBytG,EACxB,IAAI5iG,KAAyB0iG,EAAc,WAAW,CACpD,UAAWr8G,EACX,OAAQo8G,EAAgB,MAC1B,CAAC,EACDttG,EAAA,IAAc6K,EACd,IAAI4kD,KAA2B89C,EAAc,YAAY,CAAE,CAAA,EAC3DvtG,EAAA,MAAgByvD,EAChB,IAAIE,KAA6B49C,EAAc,eAAe,CAAE,CAAA,EAChEvtG,EAAA,QAAkB2vD,EAClB,IAAIv+D,KAAiCm8G,EAAc,wBAAwB,CACzE,OAAQ7sG,CACV,CAAC,EACDV,EAAA,YAAsB5O,EACtB,IAAIs8G,KAAkCH,EAAc,oBAAoB,CACtE,UAAWr8G,EACX,OAAQo8G,EAAgB,MAC1B,CAAC,EACDttG,EAAA,aAAuB0tG,EACvB,IAAIl/C,KAAyB++C,EAAc,WAAW,CACpD,UAAWr8G,EACX,OAAQo8G,EAAgB,MAC1B,CAAC,EACDttG,EAAA,IAAcwuD,EACd,IAAIhzD,KAAwB+xG,EAAc,UAAU,CAClD,UAAWr8G,EACX,OAAQo8G,EAAgB,MAC1B,CAAC,EACDttG,EAAA,GAAaxE,EACb,IAAIgjG,KAA8B+O,EAAc,gBAAgB,CAAE,CAAA,EAClEvtG,EAAA,SAAmBw+F,EACnB,IAAIlvC,KAA2Bi+C,EAAc,aAAa,CACxD,UAAWr8G,EACX,OAAQo8G,EAAgB,MAC1B,CAAC,EACDttG,EAAA,MAAgBsvD,EAChB,IAAIh8E,KAA2Bi6H,EAAc,aAAa,CACxD,UAAWr8G,EACX,QAASC,EACT,YAAaC,EACb,SAAUC,CACZ,CAAC,EACD2O,EAAA,MAAgB1sB,EAChB,IAAI0iC,KAA+Bu3F,EAAc,iBAAiB,CAChE,UAAWr8G,EACX,OAAQo8G,EAAgB,OACxB,MAAOh6H,CACT,CAAC,EACD0sB,EAAA,UAAoBgW,EACpB,IAAI23F,KAAqCJ,EAAc,uBAAuB,CAC5E,UAAWr8G,EACX,OAAQo8G,EAAgB,MAC1B,CAAC,EACDttG,EAAA,gBAA0B2tG,EAC1B,IAAIlyG,KAAyB8xG,EAAc,WAAW,CACpD,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,IAAcvE,EACd,IAAIC,KAA0B6xG,EAAc,YAAY,CACtD,QAASp8G,EACT,OAAQm8G,EAAgB,OACxB,MAAOh6H,CACT,CAAC,EACD0sB,EAAA,KAAetE,EACf,IAAIurC,KAA0BsmE,EAAc,YAAY,CACtD,UAAWr8G,EACX,MAAO5d,CACT,CAAC,EACD0sB,EAAA,KAAeinC,EACf,IAAII,KAA0BkmE,EAAc,YAAY,CACtD,UAAWr8G,EACX,QAASC,EACT,OAAQm8G,EAAgB,OACxB,MAAOh6H,CACT,CAAC,EACD0sB,EAAA,KAAeqnC,EACf,IAAI/wB,KAA+Bi3F,EAAc,iBAAiB,CAChE,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,UAAoBsW,EACpB,IAAI96B,MAAyB+xH,EAAc,WAAW,CACpD,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,IAAcxkB,GACd,IAAImsD,KAA2B4lE,EAAc,aAAa,CACxD,UAAWr8G,EACX,QAASC,EACT,OAAQm8G,EAAgB,OACxB,MAAOh6H,CACT,CAAC,EACD0sB,EAAA,MAAgB2nC,EAChB,IAAI1hD,KAA2BsnH,EAAc,aAAa,CACxD,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,MAAgB/Z,EAChB,IAAI4V,MAA0B0xG,EAAc,YAAY,CACtD,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,KAAenE,GACf,IAAI3V,MAA2BqnH,EAAc,aAAa,CACxD,QAASp8G,EACT,OAAQm8G,EAAgB,OACxB,MAAOh6H,CACT,CAAC,EACD0sB,EAAA,MAAgB9Z,GAChB,IAAIquB,MAA+Bg5F,EAAc,iBAAiB,CAChE,UAAWr8G,EACX,MAAO5d,CACT,CAAC,EACD0sB,EAAA,UAAoBuU,GACpB,IAAIwS,MAA4BwmF,EAAc,cAAc,CAC1D,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,OAAiB+mB,GACjB,IAAI+5C,MAA8BysC,EAAc,eAAe,CAC7D,MAAOj6H,CACT,CAAC,EACD0sB,EAAQ,QAAa8gE,GACrB,IAAIhyF,MAA2By+H,EAAc,aAAa,CACxD,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,MAAgBlxB,GAChB,IAAIq7B,MAAkCojG,EAAc,oBAAoB,CACtE,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,aAAuBmK,GACvB,IAAIsF,MAA6B89F,EAAc,eAAe,CAC5D,QAASp8G,EACT,MAAO7d,CACT,CAAC,EACD0sB,EAAA,QAAkByP,GAClB,IAAIgY,MAA0B8lF,EAAc,YAAY,CACtD,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,KAAeynB,GACf,IAAIthC,MAA0BonH,EAAc,YAAY,CACtD,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,KAAe7Z,GACf,IAAIsiD,KAA0B8kE,EAAc,YAAY,CACtD,UAAWr8G,EACX,MAAO5d,CACT,CAAC,EACD0sB,EAAA,KAAeyoC,EACf,IAAIE,MAAyB4kE,EAAc,WAAW,CACpD,UAAWr8G,EACX,MAAO5d,CACT,CAAC,EACD0sB,EAAA,IAAc2oC,GACd,IAAInvB,MAA0B+zF,EAAc,YAAY,CACtD,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,KAAewZ,GACf,IAAI3J,MAAiC09F,EAAc,mBAAmB,CACpE,OAAQD,EAAgB,OACxB,MAAOh6H,CACT,CAAC,EACD0sB,EAAA,YAAsB6P,GACtB,IAAIuiB,MAAyBm7E,EAAc,WAAW,CACpD,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,IAAcoyB,GACd,IAAIvrC,MAAyB0mH,EAAc,WAAW,CACpD,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,IAAcnZ,GACd,IAAI/C,MAA2BypH,EAAc,aAAa,CACxD,QAASp8G,EACT,MAAO7d,CACT,CAAC,EACD0sB,EAAA,MAAgBlc,GAChB,IAAIwE,MAA4BilH,EAAc,cAAc,CAC1D,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,OAAiB1X,GACjB,IAAIG,MAA6B8kH,EAAc,eAAe,CAC5D,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,QAAkBvX,GAClB,IAAI3F,MAA4ByqH,EAAc,cAAc,CAC1D,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,OAAiBld,GACjB,IAAImnC,MAAuCsjF,EAAc,yBAAyB,CAChF,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,kBAA4BiqB,GAC5B,IAAIgK,MAAyBs5E,EAAc,WAAW,CACpD,OAAQzqH,GACR,MAAOxP,CACT,CAAC,EACD0sB,EAAA,IAAci0B,GACd,IAAIx2B,MAAwB8vG,EAAc,UAAU,CAClD,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,GAAavC,GACb,IAAI1a,MAA+BwqH,EAAc,iBAAiB,CAChE,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,UAAoBjd,GACpB,IAAI2rB,MAAgC6+F,EAAc,kBAAkB,CAClE,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,WAAqB0O,GACrB,IAAIO,MAAgCs+F,EAAc,kBAAkB,CAClE,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,WAAqBiP,GACrB,IAAIE,KAA4Bo+F,EAAc,cAAc,CAC1D,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,OAAiBmP,EACjB,IAAIy/C,MAA2B2+C,EAAc,aAAa,CACxD,UAAWr8G,EACX,OAAQo8G,EAAgB,MAC1B,CAAC,EACDttG,EAAA,MAAgB4uD,GAChB,IAAIqL,MAA4BszC,EAAc,cAAc,CAC1D,QAASp8G,EACT,MAAO7d,CACT,CAAC,EACD0sB,EAAA,OAAiBi6D,GACjB,IAAIx2E,MAA2B8pH,EAAc,aAAa,CACxD,QAASp8G,EACT,OAAQm8G,EAAgB,OACxB,MAAOh6H,CACT,CAAC,EACD0sB,EAAA,MAAgBvc,GAChB,IAAID,MAA0B+pH,EAAc,YAAY,CACtD,QAASp8G,EACT,OAAQm8G,EAAgB,OACxB,MAAOh6H,CACT,CAAC,EACD0sB,EAAA,KAAexc,GACf,IAAIsF,MAAyBykH,EAAc,WAAW,CACpD,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,IAAclX,GACd,IAAI83B,MAAoC2sF,EAAc,sBAAsB,CAC1E,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,eAAyB4gB,GACzB,IAAIiH,KAAyB0lF,EAAc,WAAW,CACpD,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,IAAc6nB,EACd,IAAIllC,KAA4B4qH,EAAc,cAAc,CAC1D,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,OAAiBrd,EACjB,IAAIoxC,MAAyBw5E,EAAc,WAAW,CACpD,OAAQzqH,GACR,MAAOxP,CACT,CAAC,EACD0sB,EAAA,IAAc+zB,GACd,IAAI0mC,MAAgC8yC,EAAc,kBAAkB,CAClE,OAAQD,EAAgB,OACxB,MAAOh6H,CACT,CAAC,EACD0sB,EAAA,WAAqBy6D,GACrB,IAAItmC,MAA2Bo5E,EAAc,aAAa,CACxD,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,MAAgBm0B,GAChB,IAAIt3B,MAA4B0wG,EAAc,cAAc,CAC1D,OAAQD,EAAgB,OACxB,MAAOh6H,CACT,CAAC,EACD0sB,EAAA,OAAiBnD,GACjB,IAAIa,MAAwB6vG,EAAc,UAAU,CAClD,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,GAAatC,GACb,IAAIqrC,MAAyBwkE,EAAc,WAAW,CACpD,UAAWr8G,EACX,MAAO5d,CACT,CAAC,EACD0sB,EAAA,IAAc+oC,GACd,IAAIxlD,MAA0BgqH,EAAc,YAAY,CACtD,UAAWr8G,EACX,SAAUG,EACV,QAASoe,GACT,MAAOn8B,CACT,CAAC,EACD0sB,EAAA,KAAezc,GACf,IAAIwZ,MAAyBwwG,EAAc,WAAW,CACpD,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,IAAcjD,GACd,IAAIoT,MAAkCo9F,EAAc,yBAAyB,CAC3E,OAAQ7sG,EACR,YAAamP,GACb,MAAOv8B,CACT,CAAC,EACD0sB,EAAA,aAAuBmQ,GACvB,IAAIyF,MAA+B23F,EAAc,iBAAiB,CAChE,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,UAAoB4V,GACpB,IAAIwO,MAA4BmpF,EAAc,cAAc,CAC1D,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,OAAiBokB,GACjB,IAAIp9B,MAA4BumH,EAAc,cAAc,CAC1D,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,OAAiBhZ,GACjB,IAAIkW,MAAyBqwG,EAAc,WAAW,CACpD,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,IAAc9C,GACd,IAAI7uB,MAA4Bk/H,EAAc,cAAc,CAC1D,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,OAAiB3xB,GACjB,IAAI2X,MAA2BunH,EAAc,aAAa,CACxD,QAASp8G,EACT,OAAQm8G,EAAgB,OACxB,MAAOh6H,CACT,CAAC,EACD0sB,EAAA,MAAgBha,GAChB,IAAIuhD,MAA2BgmE,EAAc,aAAa,CACxD,UAAWr8G,EACX,MAAO5d,CACT,CAAC,EACD0sB,EAAA,MAAgBunC,GAChB,IAAIpxB,MAA2Bo3F,EAAc,aAAa,CACxD,UAAWxqH,GACX,MAAOzP,CACT,CAAC,EACD0sB,EAAA,MAAgBmW,GAChB,IAAIsxB,MAA0B8lE,EAAc,YAAY,CACtD,UAAWr8G,EACX,QAASC,EACT,OAAQm8G,EAAgB,OACxB,MAAOh6H,CACT,CAAC,EACD0sB,EAAA,KAAeynC,GACf,IAAI5T,MAAyB05E,EAAc,WAAW,CACpD,OAAQzqH,GACR,MAAOxP,CACT,CAAC,EACD0sB,EAAA,IAAc6zB,GACd,IAAI8lC,MAAyC4zC,EAAc,2BAA2B,CACpF,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,oBAA8B25D,GAC9B,IAAIv9D,MAAyBmxG,EAAc,WAAW,CACpD,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,IAAc5D,GACd,IAAIysC,MAA0B0kE,EAAc,YAAY,CACtD,UAAWr8G,EACX,MAAO5d,CACT,CAAC,EACD0sB,EAAA,KAAe6oC,GACf,IAAI3V,KAA2Bq6E,EAAc,aAAa,CACxD,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,MAAgBkzB,EAChB,IAAIwB,KAA6B64E,EAAc,eAAe,CAC5D,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,QAAkB00B,EAClB,IAAIkmC,KAA+B2yC,EAAc,iBAAiB,CAChE,OAAQD,EAAgB,OACxB,MAAOh6H,CACT,CAAC,EACD0sB,EAAA,UAAoB46D,EACpB,IAAI3xB,KAA0BskE,EAAc,YAAY,CACtD,UAAWr8G,EACX,MAAO5d,CACT,CAAC,EACD0sB,EAAA,KAAeipC,EACf,IAAI7iD,KAA0BmnH,EAAc,YAAY,CACtD,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,KAAe5Z,EACf,IAAIsgD,KAA4B6mE,EAAc,cAAc,CAC1D,aAAcp9F,GACd,MAAO78B,CACT,CAAC,EACD0sB,EAAA,OAAiB0mC,EACjB,IAAI1pC,MAA0BuwG,EAAc,YAAY,CACtD,QAASp8G,EACT,OAAQm8G,EAAgB,OACxB,MAAOh6H,CACT,CAAC,EACD0sB,EAAA,KAAehD,GACf,IAAI3W,MAA0BknH,EAAc,YAAY,CACtD,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,KAAe3Z,GACf,IAAIyvB,MAAgCy3F,EAAc,kBAAkB,CAClE,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,WAAqB8V,GACrB,IAAIqxB,MAA2BomE,EAAc,aAAa,CACxD,UAAWr8G,EACX,QAASC,EACT,OAAQm8G,EAAgB,OACxB,MAAOh6H,CACT,CAAC,EACD0sB,EAAA,MAAgBmnC,GAChB,IAAIoB,MAAyBglE,EAAc,WAAW,CACpD,UAAWr8G,EACX,MAAO5d,CACT,CAAC,EACD0sB,EAAA,IAAcuoC,GACd,IAAI3zB,MAA8B24F,EAAc,gBAAgB,CAC9D,SAAUl8G,EACV,MAAO/d,CACT,CAAC,EACD0sB,EAAA,SAAmB4U,GACnB,IAAI/F,MAA+B0+F,EAAc,iBAAiB,CAChE,MAAOj6H,CACT,CAAC,EACD0sB,EAAA,UAAoB6O,GACpB,IAAIld,MAA4B47G,EAAc,cAAc,CAC1D,YAAan8G,EACb,OAAQsP,EACR,aAAcyP,GACd,MAAO78B,CACT,CAAC,EACD0sB,EAAA,OAAiBrO,GACjB,IAAIqjB,MAAwCu4F,EAAc,0BAA0B,CAClF,OAAQp+F,EACR,OAAQxd,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,mBAA6BgV,GAC7B,IAAIge,MAA0Bu6E,EAAc,YAAY,CACtD,MAAOr6E,EACP,UAAWrkB,GACX,MAAOv7B,CACT,CAAC,EACD0sB,EAAA,KAAegzB,GACf,IAAIU,MAA6B65E,EAAc,eAAe,CAC5D,UAAWh5F,GACX,SAAUK,GACV,OAAQjyB,CACV,CAAC,EACDqd,EAAA,QAAkB0zB,GAClB,IAAIr6B,MAA0Bk0G,EAAc,YAAY,CACtD,OAAQD,EAAgB,OACxB,eAAgB1sF,GAChB,QAAS8S,GACT,MAAOpgD,CACT,CAAC,EACD0sB,EAAA,KAAe3G,GACf,IAAIrQ,MAA6BukH,EAAc,eAAe,CAC5D,UAAWxqH,GACX,OAAQ4O,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,QAAkBhX,GAClB,IAAI9E,MAA0BqpH,EAAc,YAAY,CACtD,OAAQ57G,GACR,OAAQ27G,EAAgB,OACxB,MAAOh6H,CACT,CAAC,EACD0sB,EAAA,KAAe9b,GACf,IAAIgF,MAA6BqkH,EAAc,eAAe,CAC5D,OAAQ57G,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,QAAkB9W,GAClB,IAAIymC,MAA4B49E,EAAc,cAAc,CAC1D,OAAQ57G,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,OAAiB2vB,GACjB,IAAIU,MAA+Bk9E,EAAc,iBAAiB,CAChE,OAAQ57G,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,UAAoBqwB,GACpB,IAAI9L,MAA0BgpF,EAAc,YAAY,CACtD,UAAWr8G,EACX,OAAQo8G,EAAgB,OACxB,OAAQ37G,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,KAAeukB,GACf,IAAI1/B,MAA2B0oH,EAAc,aAAa,CACxD,UAAWr8G,EACX,OAAQo8G,EAAgB,OACxB,OAAQ37G,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,MAAgBnb,GAChB,IAAI+W,MAA0B2xG,EAAc,YAAY,CACtD,QAASp8G,EACT,OAAQm8G,EAAgB,OACxB,MAAOh6H,CACT,CAAC,EACD0sB,EAAA,KAAepE,GACf,IAAIjY,MAA0B4pH,EAAc,YAAY,CACtD,UAAWr8G,EACX,QAASC,EACT,SAAUE,EACV,OAAQi8G,EAAgB,OACxB,WAAY5+F,GACZ,OAAQ/c,GACR,MAAOre,EACP,WAAYwiC,EACd,CAAC,EACD9V,EAAA,KAAerc,GACf,IAAI44B,MAA4BgxF,EAAc,cAAc,CAC1D,UAAWxqH,GACX,OAAQ4O,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,OAAiBuc,GACjB,IAAI3wB,MAA2B2hH,EAAc,aAAa,CACxD,KAAMl0G,GACN,KAAMnV,GACN,MAAO5Q,CACT,CAAC,EACD0sB,EAAA,MAAgBpU,GAChB,IAAIglC,MAAgC28E,EAAc,kBAAkB,CAClE,KAAM9lF,GACN,UAAW4I,GACX,MAAO/8C,CACT,CAAC,EACD0sB,EAAA,WAAqB4wB,GACrB,IAAIvH,MAA0BkkF,EAAc,YAAY,CACtD,YAAan8G,EACb,aAAc+e,GACd,OAAQxe,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,KAAeqpB,GACf,IAAI6H,MAAkCq8E,EAAc,oBAAoB,CACtE,QAAS75E,GACT,MAAOpgD,CACT,CAAC,EACD0sB,EAAA,aAAuBkxB,GACvB,IAAIC,MAA+Bo8E,EAAc,iBAAiB,CAChE,YAAan8G,EACb,OAAQmrB,GACR,aAAc2U,GACd,YAAarhB,GACb,OAAQle,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,UAAoBmxB,GACpB,IAAIvM,MAA2B2oF,EAAc,aAAa,CACxD,YAAan8G,EACb,OAAQmrB,GACR,YAAa1M,GACb,OAAQle,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,MAAgB4kB,GAChB,IAAIp8B,MAA6B+kH,EAAc,eAAe,CAC5D,OAAQ57G,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,QAAkBxX,GAClB,IAAI4V,MAAyBmvG,EAAc,WAAW,CACpD,UAAWr8G,EACX,YAAaE,EACb,OAAQmrB,GACR,YAAa1M,GACb,OAAQle,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,IAAc5B,GACd,IAAI2Q,MAAqCw+F,EAAc,uBAAuB,CAC5E,UAAW1+F,GACX,MAAOv7B,CACT,CAAC,EACD0sB,EAAA,gBAA0B+O,GAC1B,IAAIob,MAA8BojF,EAAc,gBAAgB,CAC9D,UAAWr8G,EACX,YAAaE,EACb,aAAc+e,GACd,OAAQm9F,EAAgB,OACxB,OAAQ37G,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,SAAmBmqB,GACnB,IAAIM,MAA0B8iF,EAAc,YAAY,CACtD,OAAQ57G,GACR,eAAgBivB,GAChB,MAAOttC,CACT,CAAC,EACD0sB,EAAA,KAAeyqB,GACf,IAAIgC,MAA8B8gF,EAAc,gBAAgB,CAC9D,YAAan8G,EACb,OAAQmrB,GACR,OAAQ+wF,EAAgB,OACxB,OAAQ37G,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,SAAmBysB,GACnB,IAAIuN,MAA+BuzE,EAAc,iBAAiB,CAChE,YAAan8G,EACb,OAAQmrB,GACR,YAAa1M,GACb,OAAQle,GACR,MAAOre,EACP,MAAOuR,EACT,CAAC,EACDmb,EAAA,UAAoBg6B,GACpB,IAAIvkB,MAAuC83F,EAAc,yBAAyB,CAChF,QAAS/kH,GACT,OAAQmJ,GACR,KAAMzN,GACN,MAAO5Q,CACT,CAAC,EACD0sB,EAAA,kBAA4ByV,GAC5B,IAAI9Y,MAAyB4wG,EAAc,WAAW,CACpD,YAAan8G,EACb,OAAQmrB,GACR,YAAa1M,GACb,OAAQle,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,IAAcrD,GACd,IAAI2mB,MAA6BiqF,EAAc,eAAe,CAC5D,UAAWr8G,EACX,OAAQqrB,GACR,YAAa1M,GACb,OAAQle,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,QAAkBsjB,GAClB,IAAIoI,MAA0B6hF,EAAc,YAAY,CACtD,UAAWr8G,EACX,OAAQo8G,EAAgB,OACxB,OAAQ37G,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,KAAe0rB,GACf,IAAIziC,MAA4BskH,EAAc,cAAc,CAC1D,OAAQD,EAAgB,OACxB,OAAQ37G,EACV,CAAC,EACDqO,EAAA,OAAiB/W,GACjB,IAAIoxC,MAAqCkzE,EAAc,uBAAuB,CAC5E,YAAan8G,EACb,OAAQmrB,GACR,YAAa1M,GACb,OAAQle,GACR,MAAOre,EACP,MAAOuR,EACT,CAAC,EACDmb,EAAA,gBAA0Bq6B,GAC1B,IAAIv9B,MAA2BywG,EAAc,aAAa,CACxD,UAAWr8G,EACX,YAAaE,EACb,YAAaye,GACb,OAAQle,GACR,MAAOre,EACP,MAAOuR,EACT,CAAC,EACDmb,EAAA,MAAgBlD,GAChB,IAAI+nB,MAA6B0oF,EAAc,eAAe,CAC5D,YAAan8G,EACb,OAAQmrB,GACR,OAAQ+wF,EAAgB,OACxB,OAAQ37G,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,QAAkB6kB,GAClB,IAAIziC,MAAwBmrH,EAAc,UAAU,CAClD,OAAQhxF,GACR,OAAQ5qB,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,GAAa5d,GACb,IAAIw6C,MAA6B2wE,EAAc,eAAe,CAC5D,YAAan8G,EACb,OAAQmrB,GACR,OAAQ+wF,EAAgB,OACxB,YAAaz9F,GACb,OAAQle,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,QAAkB48B,GAClB,IAAI3U,MAAyBslF,EAAc,WAAW,CACpD,YAAan8G,EACb,OAAQmrB,GACR,OAAQ5qB,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,IAAcioB,GACd,IAAItsB,MAAyB4xG,EAAc,WAAW,CACpD,YAAan8G,EACb,aAAc+e,GACd,UAAWmG,EACX,OAAQiG,GACR,YAAa1M,GACb,OAAQle,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,IAAcrE,GACd,IAAIkrB,MAA4B0mF,EAAc,cAAc,CAC1D,OAAQhxF,GACR,YAAa1M,GACb,OAAQle,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,OAAiB6mB,GACjB,IAAIpB,MAA4B8nF,EAAc,cAAc,CAC1D,YAAan8G,EACb,OAAQmrB,GACR,OAAQ5qB,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,OAAiBylB,GACjB,IAAIowC,MAA6B03C,EAAc,eAAe,CAC5D,UAAWj3F,EACX,aAAcnM,GACd,aAAc+mB,GACd,UAAWnuC,GACX,WAAY2rB,GACZ,eAAgBkS,GAChB,MAAOttC,CACT,CAAC,EACD0sB,EAAA,QAAkB61D,GAClB,IAAI/8D,MAA6By0G,EAAc,eAAe,CAC5D,UAAWr8G,EACX,YAAaE,EACb,SAAUC,EACV,OAAQkrB,GACR,OAAQ+wF,EAAgB,OACxB,YAAaz9F,GACb,OAAQle,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,QAAkBlH,GAClB,IAAI7R,MAAiCsmH,EAAc,mBAAmB,CACpE,OAAQhxF,GACR,OAAQ5qB,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,YAAsB/Y,GACtB,IAAIi2E,MAA4BqwC,EAAc,cAAc,CAC1D,IAAK5xG,GACL,MAAOroB,EACP,UAAW0iC,CACb,CAAC,EACDhW,EAAA,OAAiBk9D,GACjB,IAAIzgC,MAA+B8wE,EAAc,iBAAiB,CAChE,MAAO3oF,GACP,MAAOtxC,CACT,CAAC,EACD0sB,EAAA,UAAoBy8B,GACpB,IAAI93C,MAAyB4oH,EAAc,WAAW,CACpD,UAAWj3F,EACX,KAAMmR,GACN,eAAgB7G,GAChB,KAAM18B,GACN,MAAO5Q,CACT,CAAC,EACD0sB,EAAA,IAAcrb,GACd,IAAIo3C,MAA+BwxE,EAAc,iBAAiB,CAChE,YAAatmH,GACb,OAAQkoB,EACR,MAAO77B,CACT,CAAC,EACD0sB,EAAA,UAAoB+7B,GACpB,IAAIx/B,MAA2BgxG,EAAc,aAAa,CACxD,YAAan8G,EACb,OAAQk8G,EAAgB,OACxB,YAAaz9F,GACb,OAAQle,GACR,MAAOmL,GACP,MAAOxpB,EACP,MAAOuR,EACT,CAAC,EACDmb,EAAA,MAAgBzD,GAChB,IAAIC,MAA2B+wG,EAAc,aAAa,CACxD,IAAK9xG,EACL,UAAW6a,EACX,aAAc4a,GACd,WAAYjiB,GACZ,eAAgB2R,GAChB,QAASiE,GACT,KAAM7nB,GACN,MAAO1pB,CACT,CAAC,EACD0sB,EAAA,MAAgBxD,GAChB,IAAI8hC,MAA0CivE,EAAc,iCAAiC,CAC3F,YAAan8G,EACb,QAASyzB,EACX,CAAC,EACD7kB,EAAA,qBAA+Bs+B,GAC/B,IAAI3V,MAA2B4kF,EAAc,kBAAkB,CAC7D,qBAAsBjvE,EACxB,CAAC,EACDt+B,EAAA,MAAgB2oB,GAChB,IAAIjE,MAA4B6oF,EAAc,cAAc,CAC1D,UAAWr8G,EACX,IAAKyK,GACL,OAAQ2xG,EAAgB,OACxB,MAAO1oF,GACP,UAAW7hC,GACX,IAAK4Z,GACL,QAASkoB,GACT,MAAOvxC,EACP,KAAMixC,EACR,CAAC,EACDvkB,EAAA,OAAiB0kB,GACjB,IAAI8H,MAA4B+gF,EAAc,cAAc,CAC1D,YAAan8G,EACb,OAAQmrB,GACR,OAAQ+wF,EAAgB,OACxB,OAAQ37G,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,OAAiBwsB,GACjB,IAAI9vB,MAAyB6wG,EAAc,WAAW,CACpD,QAASp8G,EACT,OAAQm8G,EAAgB,OACxB,aAAcp8E,GACd,MAAO59C,CACT,CAAC,EACD0sB,EAAA,IAActD,GACd,IAAIyY,MAAoCo4F,EAAc,sBAAsB,CAC1E,QAAS/kH,GACT,OAAQmJ,GACR,KAAMzN,GACN,MAAO5Q,CACT,CAAC,EACD0sB,EAAA,eAAyBmV,GACzB,IAAIl8B,MAAyBs0H,EAAc,WAAW,CACpD,OAAQD,EAAgB,OACxB,QAAS55E,GACT,QAAS7O,GACT,MAAOvxC,CACT,CAAC,EACD0sB,EAAA,IAAc/mB,GACd,IAAI6nC,MAA8BysF,EAAc,gBAAgB,CAC9D,UAAWj3F,EACX,IAAK3xB,GACL,YAAakrB,GACb,OAAQle,GACR,eAAgBivB,GAChB,MAAOttC,CACT,CAAC,EACD0sB,EAAA,SAAmB8gB,GACnB,IAAIyV,MAA8Bg3E,EAAc,gBAAgB,CAC9D,QAASp8G,EACT,OAAQm8G,EAAgB,OACxB,aAAcp8E,GACd,MAAO59C,CACT,CAAC,EACD0sB,EAAA,SAAmBu2B,GACnB,IAAIxO,MAAwBwlF,EAAc,UAAU,CAClD,YAAan8G,EACb,OAAQmrB,GACR,YAAa1M,GACb,OAAQle,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,GAAa+nB,GACb,IAAIiV,MAAqCuwE,EAAc,uBAAuB,CAC5E,QAASz0G,GACT,MAAOo6B,EACP,UAAWrkB,GACX,MAAOv7B,CACT,CAAC,EACD0sB,EAAA,gBAA0Bg9B,GAC1B,IAAI8/B,MAAiCywC,EAAc,mBAAmB,CACpE,IAAK5xG,GACL,QAAS7C,GACT,SAAUgoB,GACV,gBAAiBkc,GACjB,MAAO1pD,CACT,CAAC,EACD0sB,EAAA,YAAsB88D,GACtB,IAAIviC,MAAmCgzE,EAAc,qBAAqB,CACxE,YAAan8G,EACb,OAAQmrB,GACR,YAAa1M,GACb,OAAQle,GACR,MAAOre,EACP,MAAOuR,EACT,CAAC,EACDmb,EAAA,cAAwBu6B,GACxB,IAAIhO,MAA+BghF,EAAc,iBAAiB,CAChE,YAAan8G,EACb,OAAQmrB,GACR,OAAQ+wF,EAAgB,OACxB,OAAQ37G,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,UAAoBusB,GACpB,IAAItzB,MAA8Bs0G,EAAc,gBAAgB,CAC9D,YAAan8G,EACb,UAAWklB,EACX,OAAQiG,GACR,YAAa1M,GACb,OAAQle,GACR,MAAOre,EACP,WAAYwiC,EACd,CAAC,EACD9V,EAAA,SAAmB/G,GACnB,IAAI80C,MAA2Bw/D,EAAc,aAAa,CACxD,IAAK5xG,GACL,OAAQhK,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,MAAgB+tC,GAChB,IAAI3V,MAA4Bm1E,EAAc,cAAc,CAC1D,YAAan8G,EACb,aAAc8/B,GACd,YAAarhB,GACb,OAAQle,GACR,eAAgBivB,GAChB,SAAU3nB,GACV,MAAO3lB,CACT,CAAC,EACD0sB,EAAA,OAAiBo4B,GACjB,IAAIqC,MAAyB8yE,EAAc,WAAW,CACpD,OAAQhxF,GACR,YAAa1M,GACb,OAAQle,GACR,IAAKk2B,EACL,MAAOv0C,EACP,MAAOuR,EACT,CAAC,EACDmb,EAAA,IAAcy6B,GACd,IAAIxT,MAA2BsmF,EAAc,aAAa,CACxD,YAAan8G,EACb,OAAQmrB,GACR,YAAa1M,GACb,OAAQle,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,MAAgBinB,GAChB,IAAIlrB,MAA0BwxG,EAAc,YAAY,CACtD,YAAan8G,EACb,OAAQk8G,EAAgB,OACxB,YAAaz9F,GACb,OAAQle,GACR,MAAOmL,GACP,MAAOxpB,EACP,MAAOuR,EACT,CAAC,EACDmb,EAAA,KAAejE,GACf,IAAI8+B,MAAoC0yE,EAAc,sBAAsB,CAC1E,QAASz0G,GACT,MAAOxlB,CACT,CAAC,EACD0sB,EAAA,eAAyB66B,GACzB,IAAIk7B,MAAiCw3C,EAAc,mBAAmB,CACpE,UAAWj3F,EACX,aAAcnM,GACd,UAAWpnB,GACX,WAAY2rB,GACZ,WAAYO,GACZ,OAAQud,GACR,MAAOl5C,CACT,CAAC,EACD0sB,EAAA,YAAsB+1D,GACtB,IAAIhtC,MAA2BwkF,EAAc,aAAa,CACxD,OAAQ57G,GACR,SAAUmvB,GACV,SAAU7nB,GACV,MAAO3lB,CACT,CAAC,EACD0sB,EAAA,MAAgB+oB,GAChB,IAAIwuC,MAAyBg2C,EAAc,WAAW,CACpD,aAAcr8E,GACd,OAAQ/hB,EACR,OAAQxd,GACR,SAAUmvB,GACV,SAAU7nB,GACV,MAAO3lB,EACP,WAAYwiC,EACd,CAAC,EACD9V,EAAA,IAAcu3D,GACd,IAAIxxE,MAA0BwnH,EAAc,YAAY,CACtD,OAAQ57G,GACR,OAAQhP,EACR,SAAUsW,GACV,MAAO3lB,CACT,CAAC,EACD0sB,EAAA,KAAeja,GACf,IAAI2wE,MAA8B62C,EAAc,gBAAgB,CAC9D,IAAK9xG,EACL,UAAW6a,EACX,aAAc4a,GACd,eAAgBtQ,GAChB,KAAM5jB,GACN,SAAU/D,GACV,MAAO3lB,EACP,WAAYwiC,EACd,CAAC,EACD9V,EAAA,SAAmB02D,GACnB,IAAIxxC,MAAiCqoF,EAAc,mBAAmB,CACpE,OAAQhxF,GACR,YAAa1M,GACb,OAAQle,GACR,eAAgBivB,GAChB,MAAOttC,CACT,CAAC,EACD0sB,EAAA,YAAsBklB,GACtB,IAAI4Z,MAAmCyuE,EAAc,0BAA0B,CAC7E,OAAQ/gF,GACR,QAAS3H,EACX,CAAC,EACD7kB,EAAA,cAAwB8+B,GACxB,IAAIjlB,MAAyB0zF,EAAc,WAAW,CACpD,QAASp8G,EACT,YAAaC,EACb,KAAM2K,GACN,YAAa8T,GACb,MAAOtT,GACP,OAAQ5K,GACR,MAAOre,EACP,MAAOuR,EACT,CAAC,EACDmb,EAAA,IAAc6Z,GACd,IAAI/hC,MAA2By1H,EAAc,aAAa,CACxD,MAAO5kF,GACP,MAAOr1C,CACT,CAAC,EACD0sB,EAAA,MAAgBloB,GAChB,IAAI8+E,MAA+B22C,EAAc,iBAAiB,CAChE,IAAK9xG,EACL,IAAKE,GACL,UAAW2a,EACX,OAAQg3F,EAAgB,OACxB,aAAcp8E,GACd,YAAarhB,GACb,QAASrnB,GACT,UAAWqmB,GACX,OAAQM,EACR,OAAQxd,GACR,SAAUmvB,GACV,eAAgBF,GAChB,QAASiE,GACT,SAAU5rB,GACV,MAAO3lB,CACT,CAAC,EACD0sB,EAAA,UAAoB42D,GACpB,IAAIv3C,MAAyBkuF,EAAc,WAAW,CACpD,OAAQhxF,GACR,YAAa1M,GACb,OAAQle,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,IAAcqf,GACd,IAAI37B,MAA2B6pH,EAAc,aAAa,CACxD,QAASp8G,EACT,OAAQm8G,EAAgB,OACxB,aAAcp8E,GACd,IAAKx0B,GACL,MAAOppB,CACT,CAAC,EACD0sB,EAAA,MAAgBtc,GAChB,IAAI6zC,MAA4Bg2E,EAAc,cAAc,CAC1D,YAAan8G,EACb,aAAc8/B,GACd,YAAarhB,GACb,OAAQle,GACR,eAAgBivB,GAChB,SAAU3nB,GACV,MAAO3lB,CACT,CAAC,EACD0sB,EAAA,OAAiBu3B,GACjB,IAAInvC,MAAyBmlH,EAAc,WAAW,CACpD,OAAQD,EAAgB,OACxB,OAAQ9gF,GACR,QAASkH,GACT,MAAOpgD,CACT,CAAC,EACD0sB,EAAA,IAAc5X,GACd,IAAI+6D,MAAwBoqD,EAAc,UAAU,CAClD,UAAWj3F,EACX,QAAS7G,GACT,KAAMgY,GACN,aAAcyJ,GACd,MAAOtM,GACP,SAAUuF,GACV,OAAQhb,EACR,OAAQxd,GACR,eAAgBivB,GAChB,KAAMr9B,GACN,KAAMyZ,GACN,SAAU/D,GACV,MAAO3lB,EACP,WAAYwiC,GACZ,MAAOjxB,EACT,CAAC,EACDmb,EAAA,GAAamjD,GACb,IAAI/+C,MAA2BmpG,EAAc,aAAa,CACxD,UAAWh5F,GACX,OAAQ5iB,GACR,OAAQ27G,EAAgB,OACxB,OAAQ9gF,GACR,SAAUC,GACV,QAAS5H,GACT,UAAW0H,GACX,MAAOj5C,CACT,CAAC,EACD0sB,EAAA,MAAgBoE,GAChB,IAAIe,MAAyBooG,EAAc,WAAW,CACpD,MAAO5kF,GACP,OAAQh3B,GACR,MAAOyS,GACP,MAAO9wB,CACT,CAAC,EACD0sB,EAAA,IAAcmF,GACd,IAAIokC,MAAkCgkE,EAAc,oBAAoB,CACtE,YAAan8G,EACb,MAAOu3B,GACP,eAAgBkS,GAChB,KAAM32C,GACN,OAAQyrC,GACR,MAAOr8C,CACT,CAAC,EACD0sB,EAAA,aAAuBupC,GACvB,IAAIS,MAAiCujE,EAAc,mBAAmB,CACpE,YAAan8G,EACb,MAAOu3B,GACP,eAAgBkS,GAChB,KAAM32C,GACN,OAAQyrC,GACR,MAAOr8C,CACT,CAAC,EACD0sB,EAAA,YAAsBgqC,GACtB,IAAII,MAAiCmjE,EAAc,mBAAmB,CACpE,MAAO5kF,GACP,eAAgBkS,GAChB,KAAM32C,GACN,OAAQyrC,GACR,MAAOr8C,CACT,CAAC,EACD0sB,EAAA,YAAsBoqC,GACtB,IAAII,MAAiC+iE,EAAc,mBAAmB,CACpE,MAAO5kF,GACP,eAAgBkS,GAChB,KAAM32C,GACN,OAAQyrC,GACR,MAAOr8C,CACT,CAAC,EACD0sB,EAAA,YAAsBwqC,GACtB,IAAI4gB,MAAyBmiD,EAAc,WAAW,CACpD,aAAcp9F,GACd,IAAK1U,EACL,IAAKE,GACL,aAAcu1B,GACd,OAAQ1E,GACR,SAAUC,GACV,SAAU3L,GACV,SAAU7nB,GACV,UAAWo3B,GACX,MAAO/8C,CACT,CAAC,EACD0sB,EAAA,IAAcorD,GACd,IAAI1rB,MAAyB6tE,EAAc,gBAAgB,CACzD,cAAezuE,GACf,UAAWxoB,EACX,YAAazG,EACf,CAAC,EACD7P,EAAA,IAAc0/B,GACd,IAAI9kC,MAAyB2yG,EAAc,WAAW,CACpD,IAAK5xG,GACL,OAAQ2xG,EAAgB,OACxB,QAAS55E,GACT,MAAOpgD,CACT,CAAC,EACD0sB,EAAA,IAAcpF,GACd,IAAI2+B,MAA+Bg0E,EAAc,iBAAiB,CAChE,YAAan8G,EACb,aAAc8/B,GACd,YAAarhB,GACb,OAAQle,GACR,eAAgBivB,GAChB,SAAU3nB,GACV,MAAO3lB,CACT,CAAC,EACD0sB,EAAA,UAAoBu5B,GACpB,IAAIz9B,MAA2ByxG,EAAc,aAAa,CACxD,UAAWr8G,EACX,YAAaE,EACb,OAAQmrB,GACR,YAAa1M,GACb,OAAQle,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,MAAgBlE,GAChB,IAAI2sB,MAA4B8kF,EAAc,cAAc,CAC1D,MAAO5kF,GACP,OAAQh3B,GACR,MAAOyS,GACP,MAAO9wB,CACT,CAAC,EACD0sB,EAAA,OAAiByoB,GACjB,IAAIgQ,MAA+B80E,EAAc,iBAAiB,CAChE,YAAan8G,EACb,aAAc8/B,GACd,YAAarhB,GACb,OAAQle,GACR,eAAgBivB,GAChB,SAAU3nB,GACV,MAAO3lB,CACT,CAAC,EACD0sB,EAAA,UAAoBy4B,GACpB,IAAIoR,MAAmC0jE,EAAc,qBAAqB,CACxE,YAAan8G,EACb,MAAOu3B,GACP,eAAgBkS,GAChB,KAAM32C,GACN,OAAQyrC,GACR,MAAOr8C,CACT,CAAC,EACD0sB,EAAA,cAAwB6pC,GACxB,IAAIS,MAAqCijE,EAAc,uBAAuB,CAC5E,MAAO5kF,GACP,eAAgBkS,GAChB,KAAM32C,GACN,OAAQyrC,GACR,MAAOr8C,CACT,CAAC,EACD0sB,EAAA,gBAA0BsqC,GAC1B,IAAIU,MAAsCuiE,EAAc,wBAAwB,CAC9E,MAAO5kF,GACP,OAAQpM,GACR,cAAestB,GACf,KAAM3lD,GACN,OAAQyrC,GACR,MAAOr8C,CACT,CAAC,EACD0sB,EAAA,iBAA2BgrC,GAC3B,IAAIxN,MAA0B+vE,EAAc,YAAY,CACtD,QAASz0G,GACT,eAAgB+hC,GAChB,OAAQlpC,GACR,MAAOre,CACT,CAAC,EACD0sB,EAAA,KAAew9B,GACf,IAAIl0B,MAAyBikG,EAAc,WAAW,CACpD,IAAK9xG,EACL,UAAW6a,EACX,IAAKihD,GACL,aAAcrmC,GACd,SAAU/G,GACV,OAAQx4B,GACR,SAAUmvB,GACV,MAAOxtC,EACP,WAAYwiC,EACd,CAAC,EACD9V,EAAA,IAAcsJ,GACd,IAAIs4C,MAAyB2rD,EAAc,WAAW,CACpD,YAAan8G,EACb,IAAKsuC,GACL,aAAcvvB,GACd,IAAK1U,EACL,UAAW6a,EACX,aAAc4a,GACd,YAAarhB,GACb,OAAQ2c,GACR,OAAQ76B,GACR,eAAgBivB,GAChB,SAAU3nB,GACV,MAAO3lB,EACP,WAAYwiC,EACd,CAAC,EACD9V,EAAA,IAAc4hD,GACd,IAAIqC,MAA0BspD,EAAc,YAAY,CACtD,QAASp8G,EACT,IAAKwK,GACL,WAAYi1B,GACZ,UAAW6L,GACX,aAAcvL,GACd,IAAKvsC,GACL,UAAWwsC,GACX,MAAOvM,GACP,IAAKtb,GACL,OAAQ3X,GACR,SAAUmvB,GACV,MAAOxtC,CACT,CAAC,EACD0sB,EAAA,KAAeikD,GACf,IAAItpD,MAAyB4yG,EAAc,WAAW,CACpD,QAASp8G,EACT,OAAQm8G,EAAgB,OACxB,SAAU14F,GACV,SAAUuV,GACV,IAAK7gB,GACL,OAAQ3X,GACR,SAAUmvB,GACV,OAAQn+B,EACR,MAAOrP,CACT,CAAC,EACD0sB,EAAA,IAAcrF,GACd,IAAIuvC,MAAkCqjE,EAAc,oBAAoB,CACtE,YAAan8G,EACb,MAAOu3B,GACP,eAAgBkS,GAChB,KAAM32C,GACN,OAAQyrC,GACR,MAAOr8C,CACT,CAAC,EACD0sB,EAAA,aAAuBkqC,GACvB,IAAIgB,MAA8BqiE,EAAc,gBAAgB,CAC9D,MAAO5kF,GACP,OAAQpM,GACR,aAAc2tB,GACd,iBAAkBc,GAClB,KAAM9mD,GACN,OAAQyrC,GACR,MAAOr8C,CACT,CAAC,EACD0sB,EAAA,SAAmBkrC,GACnB,IAAIqpB,MAA2Bg5C,EAAc,aAAa,CACxD,IAAK9xG,EACL,IAAKE,GACL,SAAUwuB,GACV,IAAK7gB,GACL,IAAKxgB,GACL,IAAKV,GACL,SAAU04B,GACV,KAAM58B,GACN,KAAM8Y,GACN,SAAU/D,GACV,MAAO3lB,CACT,CAAC,EACD0sB,EAAA,MAAgBu0D,GAChB,IAAIn0B,MAA0BmtE,EAAc,iBAAiB,CAC3D,UAAWr8G,EACX,QAASC,EACT,SAAUE,EACV,IAAKoK,EACL,UAAW6a,EACX,OAAQg3F,EAAgB,OACxB,aAAcp8E,GACd,MAAOtM,GACP,IAAK/K,GACL,OAAQ/2B,GACR,UAAW+rB,GACX,eAAgB+R,GAChB,OAAQj+B,EACR,IAAKgY,GACL,MAAOmC,GACP,SAAU7D,EACZ,CAAC,EACD+G,EAAA,KAAeogC,GACf,IAAIwtE,MAAqCL,EAAc,uBAAuB,CAC5E,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,gBAA0B4tG,GAC1B,IAAIC,MAAsCN,EAAc,wBAAwB,CAC9E,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,iBAA2B6tG,GAC3B,IAAIC,MAAgCP,EAAc,kBAAkB,CAClE,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,WAAqB8tG,GACrB,IAAIC,MAAkCR,EAAc,oBAAoB,CACtE,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,aAAuB+tG,GACvB,IAAIC,MAA+BT,EAAc,iBAAiB,CAChE,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,UAAoBguG,GACpB,IAAIC,MAAwCV,EAAc,0BAA0B,CAClF,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,mBAA6BiuG,GAC7B,IAAIrnE,MAAgC2mE,EAAc,kBAAkB,CAClE,KAAMntE,GACN,MAAO9sD,CACT,CAAC,EACD0sB,EAAA,WAAqB4mC,GACrB,IAAIsnE,MAAkCX,EAAc,oBAAoB,CACtE,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,aAAuBkuG,GACvB,IAAIp3E,MAA4By2E,EAAc,cAAc,CAC1D,YAAan8G,EACb,OAAQmrB,GACR,YAAa1M,GACb,OAAQle,GACR,IAAKgJ,GACL,MAAOrnB,CACT,CAAC,EACD0sB,EAAA,OAAiB82B,GACjB,IAAIq3E,MAAsCZ,EAAc,wBAAwB,CAC9E,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,iBAA2BmuG,GAC3B,IAAIC,MAAsCb,EAAc,wBAAwB,CAC9E,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,iBAA2BouG,GAC3B,IAAIn7C,MAA0Bs6C,EAAc,YAAY,CACtD,IAAK9xG,EACL,IAAKE,GACL,SAAUwuB,GACV,IAAK7gB,GACL,SAAUwX,GACV,MAAOxtC,CACT,CAAC,EACD0sB,EAAA,KAAeizD,GACf,IAAIo7C,MAA6Bd,EAAc,eAAe,CAC5D,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,QAAkBquG,GAClB,IAAIr9E,MAAyBu8E,EAAc,WAAW,CACpD,UAAWj3F,EACX,KAAMva,GACN,KAAM0rB,GACN,aAAcyJ,GACd,UAAWC,GACX,IAAKtqC,GACL,EAAGxb,EACH,KAAMmY,GACN,OAAQmO,GACR,eAAgBivB,GAChB,IAAKjmB,GACL,IAAKkQ,EACL,MAAOv3B,CACT,CAAC,EACD0sB,EAAA,IAAcgxB,GACd,IAAI+oC,MAA2BwzC,EAAc,aAAa,CACxD,UAAWr8G,EACX,QAASC,EACT,OAAQm8G,EAAgB,OACxB,eAAgB1sF,GAChB,IAAKjmB,GACL,MAAOrnB,CACT,CAAC,EACD0sB,EAAA,MAAgB+5D,GAChB,IAAIu0C,MAAyCf,EAAc,2BAA2B,CACpF,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,oBAA8BsuG,GAC9B,IAAIC,MAAmChB,EAAc,qBAAqB,CACxE,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,cAAwBuuG,GACxB,IAAIt8E,MAA0Bs7E,EAAc,YAAY,CACtD,KAAM9lF,GACN,UAAW0J,GACX,IAAKH,GACL,MAAO19C,CACT,CAAC,EACD0sB,EAAA,KAAeiyB,GACf,IAAIu8E,MAA8BjB,EAAc,gBAAgB,CAC9D,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,SAAmBwuG,GACnB,IAAIC,MAA+BlB,EAAc,iBAAiB,CAChE,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,UAAoByuG,GACpB,IAAIC,MAAsCnB,EAAc,wBAAwB,CAC9E,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,iBAA2B0uG,GAC3B,IAAIC,MAA+BpB,EAAc,iBAAiB,CAChE,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,UAAoB2uG,GACpB,IAAIC,MAAyCrB,EAAc,2BAA2B,CACpF,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,oBAA8B4uG,GAC9B,IAAIC,MAAiCtB,EAAc,mBAAmB,CACpE,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,YAAsB6uG,GACtB,IAAIC,MAAqCvB,EAAc,uBAAuB,CAC5E,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,gBAA0B8uG,GAC1B,IAAIC,MAAkCxB,EAAc,oBAAoB,CACtE,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,aAAuB+uG,GACvB,IAAIC,MAAkCzB,EAAc,oBAAoB,CACtE,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,aAAuBgvG,GACvB,IAAIC,MAAuC1B,EAAc,yBAAyB,CAChF,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,kBAA4BivG,GAC5B,IAAIC,MAAgC3B,EAAc,kBAAkB,CAClE,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,WAAqBkvG,GACrB,IAAIC,MAA2C5B,EAAc,6BAA6B,CACxF,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,sBAAgCmvG,GAChC,IAAIC,MAA6B7B,EAAc,eAAe,CAC5D,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,QAAkBovG,GAClB,IAAIC,MAAqC9B,EAAc,uBAAuB,CAC5E,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,gBAA0BqvG,GAC1B,IAAIC,MAAkC/B,EAAc,oBAAoB,CACtE,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,aAAuBsvG,GACvB,IAAIC,MAAqChC,EAAc,uBAAuB,CAC5E,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,gBAA0BuvG,GAC1B,IAAIC,MAAyCjC,EAAc,2BAA2B,CACpF,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,oBAA8BwvG,GAC9B,IAAIC,MAA8BlC,EAAc,gBAAgB,CAC9D,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,SAAmByvG,GACnB,IAAIC,MAAgCnC,EAAc,kBAAkB,CAClE,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,WAAqB0vG,GACrB,IAAIC,MAA6BpC,EAAc,eAAe,CAC5D,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,QAAkB2vG,GAClB,IAAI16G,MAA4Bs4G,EAAc,cAAc,CAC1D,aAAcr8E,GACd,YAAarhB,GACb,IAAKvG,GACL,OAAQ3X,GACR,SAAUmvB,GACV,MAAOxtC,CACT,CAAC,EACD0sB,EAAA,OAAiB/K,GACjB,IAAI26G,MAAkCrC,EAAc,oBAAoB,CACtE,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,aAAuB4vG,GACvB,IAAI/1C,MAA+B0zC,EAAc,iBAAiB,CAChE,MAAOxzC,GACP,MAAOzmF,CACT,CAAC,EACD0sB,EAAA,UAAoB65D,GACpB,IAAIg2C,MAAoCtC,EAAc,sBAAsB,CAC1E,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,eAAyB6vG,GACzB,IAAIC,MAAiCvC,EAAc,mBAAmB,CACpE,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,YAAsB8vG,GACtB,IAAIC,MAA+CxC,EAAc,iCAAiC,CAChG,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,0BAAoC+vG,GACpC,IAAIpkD,MAA6B4hD,EAAc,eAAe,CAC5D,YAAan8G,EACb,OAAQmmC,GACR,IAAKqqB,GACL,OAAQjwD,GACR,IAAKy5D,GACL,MAAO93E,EACP,OAAQ8kD,EACV,CAAC,EACDp4B,EAAA,QAAkB2rD,GAClB,IAAIqkD,MAAyCzC,EAAc,2BAA2B,CACpF,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,oBAA8BgwG,GAC9B,IAAIC,MAAkC1C,EAAc,oBAAoB,CACtE,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,aAAuBiwG,GACvB,IAAI51C,MAAiCkzC,EAAc,mBAAmB,CACpE,IAAK5xG,GACL,OAAQ1G,GACR,UAAW4kE,GACX,UAAW92E,GACX,WAAYksB,GACZ,SAAU6R,GACV,MAAOxtC,CACT,CAAC,EACD0sB,EAAA,YAAsBq6D,GACtB,IAAIE,MAAkCgzC,EAAc,oBAAoB,CACtE,UAAW1zC,GACX,MAAOvmF,CACT,CAAC,EACD0sB,EAAA,aAAuBu6D,GACvB,IAAI21C,MAAgC3C,EAAc,kBAAkB,CAClE,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,WAAqBkwG,GACrB,IAAIlkD,MAAoCuhD,EAAc,sBAAsB,CAC1E,IAAK5xG,GACL,KAAMhY,GACN,OAAQsR,GACR,YAAa4a,GACb,GAAIpS,GACJ,OAAQ0R,EACR,SAAU2R,GACV,GAAIpjB,GACJ,KAAMV,GACN,SAAU/D,GACV,OAAQ5qB,GACR,MAAOiF,EACP,WAAYwiC,EACd,CAAC,EACD9V,EAAA,eAAyBgsD,GACzB,IAAInhB,MAA6B0iE,EAAc,eAAe,CAC5D,eAAgB1yE,GAChB,MAAOvnD,CACT,CAAC,EACD0sB,EAAA,QAAkB6qC,GAClB,IAAIorB,MAAgCs3C,EAAc,kBAAkB,CAClE,UAAWh5F,GACX,UAAW+B,EACX,aAAcnM,GACd,aAAc+mB,GACd,UAAW2oC,GACX,UAAW92E,GACX,WAAY2rB,GACZ,OAAQ8d,GACR,eAAgB5L,GAChB,OAAQj+B,EACR,IAAKgY,GACL,SAAU1B,GACV,MAAO3lB,CACT,CAAC,EACD0sB,EAAA,WAAqBi2D,GACrB,IAAIhiD,MAA0Bs5F,EAAc,oBAAoB,CAC9D,KAAMntE,GACN,MAAO9sD,CACT,CAAC,EACD0sB,EAAA,KAAeiU,GACf,IAAI0hD,MAAiC43C,EAAc,mBAAmB,CACpE,UAAWj3F,EACX,UAAWvzB,GACX,WAAY2rB,GACZ,WAAYunD,GACZ,MAAO3iF,CACT,CAAC,EACD0sB,EAAA,YAAsB21D,GACtB,IAAIlqB,MAA0B8hE,EAAc,YAAY,CACtD,IAAK9xG,EACL,IAAKE,GACL,UAAW2a,EACX,KAAMza,GACN,UAAW0Y,GACX,OAAQkU,GACR,QAAShZ,GACT,OAAQ69F,EAAgB,OACxB,IAAKlxG,GACL,KAAMitB,GACN,aAAc6H,GACd,IAAKvsC,GACL,MAAOigC,GACP,QAASp8B,GACT,GAAIiV,GACJ,IAAK6L,GACL,OAAQkjB,GACR,OAAQ76B,GACR,kBAAmB8jB,GACnB,SAAUqL,GACV,eAAgBF,GAChB,OAAQj+B,EACR,GAAIwgE,GACJ,GAAIzlD,GACJ,IAAKX,GACL,QAAS8nB,GACT,KAAM7nB,GACN,SAAU/D,GACV,MAAO3lB,EACP,OAAQ8kD,GACR,UAAWmB,EACb,CAAC,EACDv5B,EAAA,KAAeyrC,GACf,IAAI0kE,MAAmC5C,EAAc,qBAAqB,CACxE,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,cAAwBmwG,GACxB,IAAIC,MAA6B7C,EAAc,eAAe,CAC5D,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,QAAkBowG,GAClB,IAAIj2C,MAAkCozC,EAAc,oBAAoB,CACtE,OAAQt4G,GACR,UAAWk8B,GACX,UAAWtiB,GACX,IAAKnS,GACL,IAAK5T,GACL,OAAQ6I,GACR,SAAUmvB,GACV,IAAKlmB,GACL,MAAOtnB,CACT,CAAC,EACD0sB,EAAA,aAAuBm6D,GACvB,IAAIoC,MAA0BgxC,EAAc,YAAY,CACtD,IAAK5xG,GACL,OAAQ1G,GACR,MAAO3hB,CACT,CAAC,EACD0sB,EAAA,KAAeu8D,GACf,IAAI8zC,KAAiC9C,EAAc,mBAAmB,CACpE,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,YAAsBqwG,EACtB,IAAIC,MAAoC/C,EAAc,sBAAsB,CAC1E,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,eAAyBswG,GACzB,IAAIC,MAA0ChD,EAAc,4BAA4B,CACtF,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,qBAA+BuwG,GAC/B,IAAIlzC,MAA8BkwC,EAAc,gBAAgB,CAC9D,IAAK5xG,GACL,MAAOwa,GACP,OAAQlhB,GACR,MAAOi+B,EACP,SAAUpS,GACV,SAAU7nB,GACV,MAAO3lB,CACT,CAAC,EACD0sB,EAAA,SAAmBq9D,GACnB,IAAImzC,MAA6CjD,EAAc,+BAA+B,CAC5F,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,wBAAkCwwG,GAClC,IAAI/zC,MAA4B8wC,EAAc,cAAc,CAC1D,IAAK5xG,GACL,QAAS7C,GACT,OAAQ7D,GACR,gBAAiB+nC,GACjB,MAAO1pD,CACT,CAAC,EACD0sB,EAAA,OAAiBy8D,GACjB,IAAIg0C,MAAgClD,EAAc,kBAAkB,CAClE,UAAWr8G,EACX,KAAMkvC,GACN,OAAQktE,EAAgB,MAC1B,CAAC,EACDttG,EAAA,WAAqBywG,GACrB,IAAIzzC,MAAyBuwC,EAAc,WAAW,CACpD,IAAKzkH,GACL,KAAMkU,GACN,MAAO1pB,EACP,SAAU+pF,EACZ,CAAC,EACDr9D,EAAA,IAAcg9D,GACd,IAAIZ,MAAyBmxC,EAAc,WAAW,CACpD,IAAK9xG,EACL,IAAK3S,GACL,OAAQ2zE,GACR,SAAUxjE,GACV,MAAO3lB,CACT,CAAC,EACD0sB,EAAA,IAAco8D,GACd,IAAIruC,MAA0Bw/E,EAAc,YAAY,CACtD,IAAK9xG,EACL,IAAKE,GACL,KAAM8rB,GACN,WAAYmJ,GACZ,KAAM6a,GACN,YAAa57B,GACb,OAAQ2c,GACR,OAAQ76B,GACR,SAAUmvB,GACV,IAAKnmB,GACL,QAASkqB,GACT,KAAM7nB,GACN,MAAO1pB,CACT,CAAC,EACD0sB,EAAA,KAAe+tB,GACf,IAAIP,MAAoC+/E,EAAc,sBAAsB,CAC1E,UAAWr8G,EACX,YAAaE,EACb,aAAc+e,GACd,UAAWmG,EACX,OAAQg3F,EAAgB,OACxB,IAAKlxG,GACL,OAAQzK,GACR,eAAgBivB,GAChB,KAAMmN,GACN,IAAKhxB,GACL,MAAOzpB,EACP,WAAYwiC,EACd,CAAC,EACD9V,EAAA,eAAyBwtB,GACzB,IAAIF,MAA4BigF,EAAc,cAAc,CAC1D,SAAUzsF,GACV,eAAgB0M,GAChB,MAAOl6C,CACT,CAAC,EACD0sB,EAAA,OAAiBstB,GACjB,IAAIqnC,MAA2B44C,EAAc,aAAa,CACxD,SAAUpjF,GACV,OAAQx4B,GACR,SAAUmvB,GACV,KAAMiN,GACN,GAAIo1B,GACJ,SAAUlqD,GACV,MAAO3lB,CACT,CAAC,EACD0sB,EAAA,MAAgB20D,GAChB,IAAIF,MAA+B84C,EAAc,iBAAiB,CAChE,IAAK9xG,EACL,IAAKE,GACL,OAAQ4gB,GACR,SAAU4N,GACV,MAAOryC,GACP,QAAS6zE,GACT,OAAQh6D,GACR,kBAAmB8jB,GACnB,SAAUqL,GACV,MAAO1c,GACP,MAAOuwD,GACP,OAAQhlC,GACR,SAAU12B,GACV,UAAWo3B,GACX,MAAO/8C,CACT,CAAC,EACD0sB,EAAA,UAAoBy0D,GACpB,IAAII,MAA0B04C,EAAc,YAAY,CACtD,OAAQ57G,GACR,SAAUmvB,GACV,UAAW2zC,GACX,UAAWpkC,GACX,MAAO/8C,CACT,CAAC,EACD0sB,EAAA,KAAe60D,gCCl9Df,IAAI7pF,EAAyBY,GAC7B,OAAO,eAAwBo0B,EAAA,aAAc,CAC3C,MAAO,EACT,CAAC,EACDA,EAAqB,WAAAA,EAAA,QAAkBA,QAAgBA,EAAqB,WAAAA,EAAA,eAAyBA,YAAoBA,EAAiB,OAAAA,EAAA,gBAA0BA,EAAuB,aAAAA,EAAA,WAAqBA,EAAe,KAAAA,EAAA,UAAoBA,OAAeA,EAAuB,aAAAA,EAAA,uBAAiCA,EAAuB,aAAAA,EAAA,gBAA0BA,EAAgB,MAAAA,EAAA,UAAoBA,iBAAyBA,EAAoB,UAAAA,EAAA,aAAuB,OACnd,OAAO,eAAeA,EAAS,OAAQ,CACrC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO05E,EAAc,YACtB,CACH,CAAC,EACD15E,EAAA,cAAwBA,EAAuB,aAAAA,EAAA,iBAA2BA,EAAmB,SAAAA,EAAA,QAAkBA,EAAkB,QAAAA,EAAA,YAAsBA,EAAiB,OAAAA,EAAA,MAAgBA,EAAoB,UAAAA,EAAA,KAAeA,EAAmB,SAAA,OAC9O,IAAI1tB,EAAYtH,EAAuBuD,GAAA,CAAyC,EAC5E++H,EAAkBx9H,GAClBy9H,EAAgBh7H,EAChBm+H,EAA6BppH,GAC7BoyF,EAAgB5oF,KAMhBk+C,EAAO,CAAA,EACPP,EAAoB,CAAA,EACpB6vD,EAAU,CAAA,EAEVhwD,KAAWi/D,EAAc,YAAY,CACvC,kBAAmB9+D,CACrB,CAAC,EACDzuC,EAAA,KAAesuC,EACf,IAAIwI,KAAiBy2D,EAAc,kBAAkB,CACnD,KAAMj/D,CACR,CAAC,EACDtuC,EAAA,WAAqB82C,EACrB,IAAIM,KAAmBm2D,EAAc,oBAAoB,CACvD,KAAMj/D,CACR,CAAC,EACDtuC,EAAA,aAAuBo3C,EACvB,IAAIsC,KAAsB6zD,EAAc,uBAAuB,CAC7D,KAAMj/D,CACR,CAAC,EACDtuC,EAAA,gBAA0B05C,EAC1B,IAAIY,KAAqBizD,EAAc,sBAAsB,CAC3D,KAAMj/D,CACR,CAAC,EACDtuC,EAAA,eAAyBs6C,EACzB,IAAIjJ,KAAgBk8D,EAAc,iBAAiB,CACjD,KAAMj/D,CACR,CAAC,EACDtuC,EAAA,UAAoBqxC,EACpB,IAAI0C,KAAgBw5D,EAAc,iBAAiB,CACjD,KAAMj/D,EACN,UAAWoiE,EAA2B,SACxC,CAAC,EACD1wG,EAAA,UAAoB+zC,EACpB,IAAIO,KAAsBi5D,EAAc,uBAAuB,CAC7D,KAAMj/D,CACR,CAAC,EACDtuC,EAAA,gBAA0Bs0C,EAC1B,IAAIqB,KAAmB43D,EAAc,oBAAoB,CACvD,KAAMj/D,CACR,CAAC,EACDtuC,EAAA,aAAuB21C,EACvB,IAAIkE,KAAgB0zD,EAAc,iBAAiB,CACjD,KAAMj/D,CACR,CAAC,EACDtuC,EAAA,UAAoB65C,EACpB,IAAIukD,KAAcmP,EAAc,eAAe,CAC7C,QAASjP,CACX,CAAC,EACDt+F,EAAA,QAAkBo+F,EAClB,IAAI3wC,KAAY8/C,EAAc,kBAAkB,CAC9C,KAAMv+D,EACN,MAAO0hE,EAA2B,KACpC,CAAC,EACD1wG,EAAA,MAAgBytD,EAChB,IAAI3X,KAA6By3D,EAAc,8BAA8B,CAC3E,KAAMj/D,EACN,MAAOoiE,EAA2B,KACpC,CAAC,EACD1wG,EAAA,uBAAiC81C,EACjC,IAAIgkC,KAAYyzB,EAAc,aAAa,CACzC,MAAO9/C,EACP,MAAOijD,EAA2B,KACpC,CAAC,EACD1wG,EAAA,MAAgB85E,EAChB,IAAI1pC,KAAmBm9D,EAAc,oBAAoB,CACvD,KAAMj/D,EACN,OAAQoiE,EAA2B,MACrC,CAAC,EACD1wG,EAAA,aAAuBowC,EACvB,IAAIkG,KAAgBi3D,EAAc,iBAAiB,CACjD,KAAMj/D,EACN,KAAMoiE,EAA2B,IACnC,CAAC,EACD1wG,EAAA,UAAoBs2C,EACpB,IAAIpD,KAAqBq6D,EAAc,sBAAsB,CAC3D,OAAQmD,EAA2B,OACnC,KAAMpiE,EACN,OAAQoiE,EAA2B,MACrC,CAAC,EACD1wG,EAAA,eAAyBkzC,EACzB,IAAIgI,KAAiBqyD,EAAc,kBAAkB,CACnD,KAAMmD,EAA2B,KACjC,KAAMpiE,EACN,KAAMU,CACR,CAAC,EACDhvC,EAAA,WAAqBk7C,EACrB,IAAIS,KAAmB4xD,EAAc,oBAAoB,CACvD,KAAMj/D,EACN,WAAY4M,EACZ,KAAMlM,CACR,CAAC,EACDhvC,EAAA,aAAuB27C,EACvB,IAAIp9C,KAAYgvG,EAAc,aAAa,CACzC,aAAcn9D,EACd,UAAWiB,EACX,eAAgB6B,EAChB,UAAWa,EACX,gBAAiBO,EACjB,aAAcqB,EACd,uBAAwBG,EACxB,aAAc6F,EACd,UAAWrF,EACX,WAAYQ,EACZ,aAAcM,EACd,gBAAiBsC,EACjB,UAAWG,EACX,eAAgBS,EAChB,WAAYY,EACZ,OAAQoyD,EAAgB,OACxB,QAASoD,EAA2B,QACpC,MAAOA,EAA2B,KACpC,CAAC,EACD1wG,EAAA,MAAgBzB,EAChB,IAAImzD,KAAc67C,EAAc,eAAe,CAC7C,aAAc53D,EACd,aAAcgG,EACd,aAAcvE,EACd,gBAAiBsC,EACjB,MAAOn7C,EACP,MAAOmyG,EAA2B,KACpC,CAAC,EACD1wG,EAAA,QAAkB0xD,EAClB,IAAII,KAAuBy7C,EAAc,wBAAwB,CAC/D,UAAWmD,EAA2B,UACtC,SAAUA,EAA2B,SACrC,aAActgE,EACd,UAAWiB,EACX,aAAcsE,EACd,aAAcgG,EACd,UAAWrF,EACX,WAAYQ,EACZ,aAAcM,EACd,WAAY8D,EACZ,OAAQoyD,EAAgB,OACxB,kBAAmB7+D,EACnB,OAAQiiE,EAA2B,OACnC,MAAOA,EAA2B,KACpC,CAAC,EACD1wG,EAAA,iBAA2B8xD,EAC3B,IAAIzQ,KAAcksD,EAAc,eAAe,CAC7C,MAAOhvG,EACP,MAAOmyG,EAA2B,KACpC,CAAC,EACD1wG,EAAA,QAAkBqhD,EAClB,IAAItS,KAAew+D,EAAc,gBAAgB,CAC/C,MAAOhvG,EACP,MAAOmyG,EAA2B,KACpC,CAAC,EACD1wG,EAAA,SAAmB+uC,EACnB,IAAIue,KAAWigD,EAAc,iBAAiB,CAC5C,MAAOhvG,CACT,CAAC,EACDyB,EAAA,KAAestD,EACf,IAAI9L,KAAa+rD,EAAc,mBAAmB,CAChD,SAAUx+D,CACZ,CAAC,EACD/uC,EAAA,OAAiBwhD,EACjB,IAAIwQ,KAAmBu7C,EAAc,oBAAoB,CACvD,aAAcn9D,EACd,UAAWiB,EACX,aAAcsE,EACd,aAAcgG,EACd,UAAWrF,EACX,WAAYQ,EACZ,aAAcM,EACd,gBAAiBsC,EACjB,WAAYwB,EACZ,IAAKw1D,EAA2B,IAChC,OAAQA,EAA2B,OACnC,MAAOA,EAA2B,MAClC,OAAQA,EAA2B,OACnC,SAAUA,EAA2B,SACrC,MAAOnyG,EACP,IAAKmyG,EAA2B,IAChC,SAAUA,EAA2B,SACrC,MAAOA,EAA2B,KACpC,CAAC,EACD1wG,EAAA,aAAuBgyD,EACvB,IAAIwE,KAAW+2C,EAAc,YAAY,CACvC,KAAMjgD,EACN,kBAAmB7e,EACnB,MAAOiiE,EAA2B,KACpC,CAAC,EACD1wG,EAAA,KAAew2D,EACf,IAAI5E,MAAe27C,EAAc,gBAAgB,CAC/C,UAAWmD,EAA2B,UACtC,SAAUA,EAA2B,SACrC,aAActgE,EACd,UAAWiB,EACX,aAAcsE,EACd,aAAcgG,EACd,UAAWrF,EACX,WAAYQ,EACZ,aAAcM,EACd,gBAAiBsC,EACjB,WAAYwB,EACZ,IAAKw1D,EAA2B,IAChC,OAAQpD,EAAgB,OACxB,OAAQoD,EAA2B,OACnC,MAAOA,EAA2B,MAClC,OAAQA,EAA2B,OACnC,kBAAmBjiE,EACnB,OAAQiiE,EAA2B,OACnC,SAAUA,EAA2B,SACrC,MAAOnyG,EACP,IAAKmyG,EAA2B,IAChC,QAASh/C,EACT,iBAAkBI,EAClB,aAAcE,EACd,SAAU0+C,EAA2B,SACrC,MAAOA,EAA2B,KACpC,CAAC,EACD1wG,EAAA,SAAmB4xD,GACnB,IAAIO,KAAoBo7C,EAAc,qBAAqB,CACzD,aAAcn2D,EACd,MAAO74C,EACP,SAAUqzD,GACV,MAAO8+C,EAA2B,KACpC,CAAC,EACD1wG,EAAA,cAAwBmyD,EACxB,IAAIrB,KAAiBy8C,EAAc,kBAAkB,CACnD,aAAc53D,EACd,aAAcgG,EACd,aAAcvE,EACd,gBAAiBsC,EACjB,WAAYwB,EACZ,OAAQoyD,EAAgB,OACxB,MAAOoD,EAA2B,MAClC,OAAQA,EAA2B,OACnC,QAASA,EAA2B,QACpC,MAAOnyG,EACP,SAAUqzD,GACV,MAAO8+C,EAA2B,KACpC,CAAC,EACD1wG,EAAA,WAAqB8wD,EACrB,IAAIpP,MAAa6rD,EAAc,cAAc,CAC3C,OAAQ/rD,EACR,MAAOkvD,EAA2B,KACpC,CAAC,EACD1wG,EAAA,OAAiB0hD,GACjB,IAAIsP,MAAgBu8C,EAAc,iBAAiB,CACjD,MAAOhvG,EACP,MAAOmyG,EAA2B,KACpC,CAAC,EACD1wG,EAAA,UAAoBgxD,GACpB,IAAIQ,MAAkB+7C,EAAc,mBAAmB,CACrD,UAAWmD,EAA2B,UACtC,SAAUA,EAA2B,SACrC,aAActgE,EACd,UAAWiB,EACX,aAAcsE,EACd,aAAcgG,EACd,UAAWrF,EACX,WAAYQ,EACZ,aAAcM,EACd,gBAAiBsC,EACjB,WAAYwB,EACZ,IAAKw1D,EAA2B,IAChC,OAAQpD,EAAgB,OACxB,OAAQoD,EAA2B,OACnC,MAAOA,EAA2B,MAClC,OAAQA,EAA2B,OACnC,kBAAmBjiE,EACnB,OAAQiiE,EAA2B,OACnC,SAAUA,EAA2B,SACrC,MAAOnyG,EACP,IAAKmyG,EAA2B,IAChC,SAAU9+C,GACV,iBAAkBE,EAClB,aAAcE,EACd,SAAU0+C,EAA2B,SACrC,MAAOA,EAA2B,KACpC,CAAC,EACD1wG,EAAA,YAAsBwxD,MAClBl/E,EAAU,SAAY08D,EAAM,CAC9B,EAAG0hE,EAA2B,EAC9B,MAASA,EAA2B,OACpC,cAAeA,EAA2B,cAC1C,EAAGA,EAA2B,EAC9B,SAAUA,EAA2B,UACrC,KAAMA,EAA2B,KACjC,OAAQA,EAA2B,OACnC,IAAKA,EAA2B,KAChC,KAAQA,EAA2B,MACnC,IAAKA,EAA2B,IAChC,QAASA,EAA2B,QACpC,cAAeA,EAA2B,cAC1C,IAAKA,EAA2B,IAChC,KAAQA,EAA2B,MACnC,EAAKA,EAA2B,EAChC,QAASA,EAA2B,QACpC,aAAcA,EAA2B,aACzC,IAAKA,EAA2B,IAChC,GAAIA,EAA2B,GAC/B,SAAUA,EAA2B,SACrC,QAAStS,EACT,MAAOsS,EAA2B,MAClC,MAAOA,EAA2B,MAClC,UAAWA,EAA2B,UACtC,GAAMA,EAA2B,GACjC,gBAAiBA,EAA2B,gBAC5C,IAAKA,EAA2B,IAChC,KAAMA,EAA2B,KACjC,KAAMA,EAA2B,KACjC,KAAMA,EAA2B,KACjC,UAAWA,EAA2B,UACtC,IAAKA,EAA2B,IAChC,MAAOA,EAA2B,MAClC,MAAOA,EAA2B,MAClC,KAAMA,EAA2B,KACjC,MAAOA,EAA2B,MAClC,UAAWA,EAA2B,UACtC,OAAQA,EAA2B,OACnC,QAAWA,EAA2B,QACtC,MAAOA,EAA2B,MAClC,aAAcA,EAA2B,aACzC,QAASA,EAA2B,QACpC,KAAMA,EAA2B,KACjC,KAAMA,EAA2B,KACjC,KAAMA,EAA2B,KACjC,IAAKA,EAA2B,IAChC,KAAMA,EAA2B,KACjC,YAAaA,EAA2B,YACxC,IAAKA,EAA2B,IAChC,IAAKA,EAA2B,IAChC,MAAOA,EAA2B,MAClC,OAAQA,EAA2B,OACnC,QAASA,EAA2B,QACpC,OAAQA,EAA2B,OACnC,kBAAmBA,EAA2B,kBAC9C,IAAKA,EAA2B,IAChC,GAAIA,EAA2B,GAC/B,UAAWA,EAA2B,UACtC,WAAYA,EAA2B,WACvC,WAAYA,EAA2B,WACvC,OAAQA,EAA2B,OACnC,MAAOA,EAA2B,MAClC,OAAQA,EAA2B,OACnC,MAAOA,EAA2B,MAClC,KAAMA,EAA2B,KACjC,IAAKA,EAA2B,IAChC,eAAgBA,EAA2B,eAC3C,IAAKA,EAA2B,IAChC,OAAQA,EAA2B,OACnC,IAAKA,EAA2B,IAChC,WAAYA,EAA2B,WACvC,MAAOA,EAA2B,MAClC,OAAQA,EAA2B,OACnC,GAAIA,EAA2B,GAC/B,IAAKA,EAA2B,IAChC,KAAMA,EAA2B,KACjC,IAAKA,EAA2B,IAChC,UAAWA,EAA2B,UACtC,OAAQA,EAA2B,OACnC,OAAQA,EAA2B,OACnC,IAAKA,EAA2B,IAChC,OAAQA,EAA2B,OACnC,MAAOA,EAA2B,MAClC,MAAOA,EAA2B,MAClC,MAAOA,EAA2B,MAClC,KAAMA,EAA2B,KACjC,IAAKA,EAA2B,IAChC,MAAO52B,EACP,oBAAqB42B,EAA2B,oBAChD,IAAKA,EAA2B,IAChC,KAAMA,EAA2B,KACjC,MAAOA,EAA2B,MAClC,QAASA,EAA2B,QACpC,UAAWA,EAA2B,UACtC,KAAMA,EAA2B,KACjC,KAAMA,EAA2B,KACjC,OAAQA,EAA2B,OACnC,KAAMA,EAA2B,KACjC,KAAMA,EAA2B,KACjC,WAAYA,EAA2B,WACvC,MAAOA,EAA2B,MAClC,IAAKA,EAA2B,IAChC,SAAUA,EAA2B,SACrC,UAAWA,EAA2B,UACtC,OAAQA,EAA2B,OACnC,mBAAoBA,EAA2B,mBAC/C,KAAMA,EAA2B,KACjC,QAASA,EAA2B,QACpC,KAAMA,EAA2B,KACjC,QAASA,EAA2B,QACpC,KAAMA,EAA2B,KACjC,QAASA,EAA2B,QACpC,OAAQA,EAA2B,OACnC,UAAWA,EAA2B,UACtC,KAAMA,EAA2B,KACjC,MAAOA,EAA2B,MAClC,KAAMA,EAA2B,KACjC,KAAMA,EAA2B,KACjC,OAAQA,EAA2B,OACnC,MAAOA,EAA2B,MAClC,WAAYA,EAA2B,WACvC,KAAMA,EAA2B,KACjC,aAAcA,EAA2B,aACzC,UAAWA,EAA2B,UACtC,MAAOA,EAA2B,MAClC,QAASA,EAA2B,QACpC,IAAKA,EAA2B,IAChC,gBAAiBA,EAA2B,gBAC5C,SAAUA,EAA2B,SACrC,KAAMA,EAA2B,KACjC,SAAUA,EAA2B,SACrC,UAAWA,EAA2B,UACtC,kBAAmBA,EAA2B,kBAC9C,IAAKA,EAA2B,IAChC,QAASA,EAA2B,QACpC,KAAMA,EAA2B,KACjC,OAAQA,EAA2B,OACnC,gBAAiBA,EAA2B,gBAC5C,MAAOA,EAA2B,MAClC,QAASA,EAA2B,QACpC,GAAIA,EAA2B,GAC/B,QAASA,EAA2B,QACpC,IAAKA,EAA2B,IAChC,IAAKA,EAA2B,IAChC,OAAQA,EAA2B,OACnC,OAAQA,EAA2B,OACnC,QAASA,EAA2B,QACpC,QAASA,EAA2B,QACpC,YAAaA,EAA2B,YACxC,OAAQA,EAA2B,OACnC,UAAWA,EAA2B,UACtC,IAAKA,EAA2B,IAChC,UAAWA,EAA2B,UACtC,MAAOA,EAA2B,MAClC,MAAOA,EAA2B,MAClC,OAAQA,EAA2B,OACnC,OAAQA,EAA2B,OACnC,IAAKA,EAA2B,IAChC,eAAgBA,EAA2B,eAC3C,IAAKA,EAA2B,IAChC,SAAUA,EAA2B,SACrC,SAAUA,EAA2B,SACrC,GAAIA,EAA2B,GAC/B,gBAAiBA,EAA2B,gBAC5C,YAAaA,EAA2B,YACxC,cAAeA,EAA2B,cAC1C,UAAWA,EAA2B,UACtC,SAAUA,EAA2B,SACrC,MAAOA,EAA2B,MAClC,OAAQA,EAA2B,OACnC,IAAKA,EAA2B,IAChC,MAAOA,EAA2B,MAClC,KAAMA,EAA2B,KACjC,eAAgBA,EAA2B,eAC3C,YAAaA,EAA2B,YACxC,MAAOA,EAA2B,MAClC,IAAKA,EAA2B,IAChC,KAAMA,EAA2B,KACjC,SAAUA,EAA2B,SACrC,YAAaA,EAA2B,YACxC,IAAKA,EAA2B,IAChC,MAAOA,EAA2B,MAClC,UAAWA,EAA2B,UACtC,IAAKA,EAA2B,IAChC,MAAOA,EAA2B,MAClC,OAAQA,EAA2B,OACnC,IAAKA,EAA2B,IAChC,GAAIA,EAA2B,GAC/B,MAAOA,EAA2B,MAClC,IAAKA,EAA2B,IAChC,aAAcA,EAA2B,aACzC,YAAaA,EAA2B,YACxC,YAAaA,EAA2B,YACxC,YAAaA,EAA2B,YACxC,IAAKA,EAA2B,IAChC,IAAKA,EAA2B,IAChC,UAAWA,EAA2B,UACtC,MAAOA,EAA2B,MAClC,OAAQA,EAA2B,OACnC,UAAWA,EAA2B,UACtC,cAAeA,EAA2B,cAC1C,gBAAiBA,EAA2B,gBAC5C,iBAAkBA,EAA2B,iBAC7C,KAAMA,EAA2B,KACjC,IAAKA,EAA2B,IAChC,IAAKA,EAA2B,IAChC,KAAMA,EAA2B,KACjC,IAAKA,EAA2B,IAChC,aAAcA,EAA2B,aACzC,SAAUA,EAA2B,SACrC,MAAOA,EAA2B,MAClC,gBAAiBA,EAA2B,gBAC5C,iBAAkBA,EAA2B,iBAC7C,WAAYA,EAA2B,WACvC,aAAcA,EAA2B,aACzC,UAAWA,EAA2B,UACtC,mBAAoBA,EAA2B,mBAC/C,WAAYA,EAA2B,WACvC,aAAcA,EAA2B,aACzC,OAAQA,EAA2B,OACnC,iBAAkBA,EAA2B,iBAC7C,iBAAkBA,EAA2B,iBAC7C,KAAMA,EAA2B,KACjC,QAASA,EAA2B,QACpC,IAAKA,EAA2B,IAChC,MAAOA,EAA2B,MAClC,oBAAqBA,EAA2B,oBAChD,cAAeA,EAA2B,cAC1C,KAAMA,EAA2B,KACjC,SAAUA,EAA2B,SACrC,UAAWA,EAA2B,UACtC,iBAAkBA,EAA2B,iBAC7C,UAAWA,EAA2B,UACtC,oBAAqBA,EAA2B,oBAChD,YAAaA,EAA2B,YACxC,gBAAiBA,EAA2B,gBAC5C,aAAcA,EAA2B,aACzC,aAAcA,EAA2B,aACzC,kBAAmBA,EAA2B,kBAC9C,WAAYA,EAA2B,WACvC,sBAAuBA,EAA2B,sBAClD,QAASA,EAA2B,QACpC,gBAAiBA,EAA2B,gBAC5C,aAAcA,EAA2B,aACzC,gBAAiBA,EAA2B,gBAC5C,oBAAqBA,EAA2B,oBAChD,SAAUA,EAA2B,SACrC,WAAYA,EAA2B,WACvC,QAASA,EAA2B,QACpC,OAAQA,EAA2B,OACnC,aAAcA,EAA2B,aACzC,UAAWA,EAA2B,UACtC,eAAgBA,EAA2B,eAC3C,YAAaA,EAA2B,YACxC,0BAA2BA,EAA2B,0BACtD,QAASA,EAA2B,QACpC,oBAAqBA,EAA2B,oBAChD,aAAcA,EAA2B,aACzC,YAAaA,EAA2B,YACxC,aAAcA,EAA2B,aACzC,WAAYA,EAA2B,WACvC,eAAgBA,EAA2B,eAC3C,QAASA,EAA2B,QACpC,WAAYA,EAA2B,WACvC,KAAMA,EAA2B,KACjC,YAAaA,EAA2B,YACxC,KAAMA,EAA2B,KACjC,cAAeA,EAA2B,cAC1C,QAASA,EAA2B,QACpC,aAAcA,EAA2B,aACzC,KAAMA,EAA2B,KACjC,YAAaA,EAA2B,YACxC,eAAgBA,EAA2B,eAC3C,qBAAsBA,EAA2B,qBACjD,SAAUA,EAA2B,SACrC,wBAAyBA,EAA2B,wBACpD,OAAQA,EAA2B,OACnC,MAAOnyG,EACP,WAAYmyG,EAA2B,WACvC,QAASh/C,EACT,iBAAkBI,EAClB,IAAK4+C,EAA2B,IAChC,QAASrvD,EACT,SAAUtS,EACV,IAAK2hE,EAA2B,IAChC,aAAc1+C,EACd,KAAMwE,EACN,KAAMk6C,EAA2B,KACjC,eAAgBA,EAA2B,eAC3C,SAAU9+C,GACV,cAAeO,EACf,WAAYrB,EACZ,OAAQpP,GACR,OAAQgvD,EAA2B,OACnC,UAAW1/C,GACX,YAAaQ,GACb,MAAOk/C,EAA2B,MAClC,UAAWA,EAA2B,UACtC,KAAMA,EAA2B,KACjC,OAAQpD,EAAgB,MAC1B,CAAC,KACGh7H,EAAU,SAAYm8D,EAAmBO,EAAM,CACjD,UAAYu+D,EAAc,uBAAuB,CAC/C,MAAOmD,EAA2B,KACtC,CAAG,EACD,WAAanD,EAAc,wBAAwB,CACjD,MAAOmD,EAA2B,KACtC,CAAG,EACD,OAASnD,EAAc,oBAAoB,CACzC,MAAOmD,EAA2B,KACtC,CAAG,EACD,SAAWnD,EAAc,sBAAsB,CAC7C,UAAWmD,EAA2B,UACtC,MAAOA,EAA2B,KACtC,CAAG,EACD,UAAYnD,EAAc,uBAAuB,CAC/C,OAAQmD,EAA2B,OACnC,MAAOA,EAA2B,KACtC,CAAG,EACD,UAAYnD,EAAc,uBAAuB,CAC/C,UAAWmD,EAA2B,UACtC,OAAQA,EAA2B,OACnC,MAAOA,EAA2B,KACtC,CAAG,EACD,OAASnD,EAAc,oBAAoB,CACzC,OAAQD,EAAgB,OACxB,OAAQoD,EAA2B,OACnC,QAASA,EAA2B,QACpC,MAAOA,EAA2B,KACtC,CAAG,EACD,OAASnD,EAAc,oBAAoB,CACzC,IAAKmD,EAA2B,IAChC,OAAQpD,EAAgB,OACxB,QAASoD,EAA2B,QACpC,MAAOA,EAA2B,KACtC,CAAG,EACD,OAASnD,EAAc,oBAAoB,CACzC,OAAQD,EAAgB,OACxB,QAASoD,EAA2B,QACpC,QAASA,EAA2B,QACpC,MAAOA,EAA2B,KACtC,CAAG,EACD,UAAYnD,EAAc,uBAAuB,CAC/C,IAAKmD,EAA2B,IAChC,MAAOA,EAA2B,MAClC,UAAWA,EAA2B,SAC1C,CAAG,EACD,QAAUnD,EAAc,qBAAqB,CAC3C,UAAWmD,EAA2B,UACtC,OAAQA,EAA2B,OACnC,OAAQA,EAA2B,OACnC,SAAUA,EAA2B,SACrC,MAAOA,EAA2B,KACtC,CAAG,EACD,SAAWnD,EAAc,sBAAsB,CAC7C,MAAOmD,EAA2B,KACtC,CAAG,EACD,SAAWnD,EAAc,sBAAsB,CAC7C,UAAWmD,EAA2B,UACtC,OAAQA,EAA2B,OACnC,OAAQpD,EAAgB,OACxB,OAAQoD,EAA2B,OACnC,SAAUA,EAA2B,SACrC,QAASA,EAA2B,QACpC,UAAWA,EAA2B,UACtC,MAAOA,EAA2B,KACtC,CAAG,EACD,OAASnD,EAAc,oBAAoB,CACzC,MAAOmD,EAA2B,MAClC,OAAQA,EAA2B,OACnC,MAAOA,EAA2B,MAClC,MAAOA,EAA2B,KACtC,CAAG,EACD,UAAYnD,EAAc,uBAAuB,CAC/C,MAAOmD,EAA2B,MAClC,OAAQA,EAA2B,OACnC,MAAOA,EAA2B,MAClC,MAAOA,EAA2B,KACtC,CAAG,EACD,QAAUnD,EAAc,qBAAqB,CAC3C,IAAKmD,EAA2B,IAChC,OAAQA,EAA2B,OACnC,MAAOA,EAA2B,KACtC,CAAG,EACD,YAAcnD,EAAc,yBAAyB,CACnD,IAAKmD,EAA2B,IAChC,MAAOA,EAA2B,MAClC,OAAQA,EAA2B,OACnC,MAAOA,EAA2B,MAClC,SAAUA,EAA2B,SACrC,SAAUA,EAA2B,SACrC,MAAOA,EAA2B,KACtC,CAAG,EACD,OAASnD,EAAc,oBAAoB,CACzC,IAAKmD,EAA2B,IAChC,KAAMA,EAA2B,KACjC,MAAOA,EAA2B,MAClC,SAAUA,EAA2B,QACzC,CAAG,CACH,CAAC,KACGp+H,EAAU,SAAYgsH,EAAS,CACjC,UAAWoS,EAA2B,UACtC,QAASA,EAA2B,QACpC,SAAUA,EAA2B,SACrC,OAAQA,EAA2B,OACnC,KAAMpiE,EACN,WAAYwI,EACZ,aAAcM,EACd,gBAAiBsC,EACjB,MAAOg3D,EAA2B,MAClC,eAAgBp2D,EAChB,UAAWo2D,EAA2B,UACtC,UAAWr/D,EACX,UAAW0C,EACX,gBAAiBO,EACjB,aAAcqB,EACd,YAAa+6D,EAA2B,YACxC,UAAW72D,EACX,MAAO4T,EACP,uBAAwB3X,EACxB,aAAc46D,EAA2B,aACzC,aAActgE,EACd,UAAWkG,EACX,eAAgBpD,EAChB,qBAAsBw9D,EAA2B,qBACjD,MAAOA,EAA2B,MAClC,cAAeA,EAA2B,cAC1C,IAAKA,EAA2B,IAChC,KAAMA,EAA2B,KACjC,WAAYx1D,EACZ,aAAcS,EACd,KAAM2R,EACN,OAAQ9L,CACV,CAAC,EACDiM,EAAM,YAAYze,CAAI,+BC3tBtB,OAAO,eAAwBhvC,EAAA,aAAc,CAC3C,MAAO,EACT,CAAC,EACD,OAAO,eAAeA,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,cACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,UAAW,CACxC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,OACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,WACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,gBACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,WACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,WACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,SACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,UAAW,CACxC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,OACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,YACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,YAAa,CAC1C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,SACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,iBACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,cACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,SAAU,CACvC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,MACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,aACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,UACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,UACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,wBACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,cACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,SAAU,CACvC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,MACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,UAAW,CACxC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,OACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,WACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,WAAY,CACzC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,QACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,SAAU,CACvC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,MACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,SAAU,CACvC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,MACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,WAAY,CACzC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,QACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,WAAY,CACzC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,QACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,YACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,cACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,iBACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,UAAW,CACxC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,OACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,WACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,WAAY,CACzC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,QACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,gBACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,WACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,cACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,WAAY,CACzC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,QACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,eAAgB,CAC7C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,YACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,cAAe,CAC5C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,WACZ,CACH,CAAC,EACD,OAAO,eAAemwB,EAAS,SAAU,CACvC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOnwB,EAAI,MACZ,CACH,CAAC,EACD,IAAIA,EAAMjE,qCC7OV,OAAO,eAAe+kI,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIpD,IAAgB3hI,EAMhBglI,IAAwB,CAC1B,qBAAsBrD,IAAc,oBACtC,EACAoD,GAAA,sBAAgCC,cCbhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAItD,IAAgB3hI,EAMhBklI,IAAsB,CACxB,mBAAoBvD,IAAc,kBACpC,EACAsD,GAAA,oBAA8BC,oBCb9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIxD,IAAgB3hI,EAMhBolI,IAAqB,CACvB,kBAAmBzD,IAAc,iBACnC,EACAwD,GAAA,mBAA6BC,ICb7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC8BA,GAAA,wBAAG,OAClC,IAAIC,IAAoCtlI,GACpC2hI,IAAgBh/H,EAMhB4iI,IAA0B,CAC5B,mBAAoBD,IAAkC,mBACtD,uBAAwB3D,IAAc,sBACxC,EACA0D,GAAA,wBAAkCE,cCflC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAI7D,IAAgB3hI,EAMhBylI,IAAuB,CACzB,oBAAqB9D,IAAc,mBACrC,EACA6D,GAAA,qBAA+BC,ICb/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIC,IAAuC3lI,GACvC4lI,IAAqCjjI,GACrCkjI,IAAyC3hI,GACzC4hI,IAAsCn/H,GACtCg7H,IAAgBjmH,EAMhBqqH,IAAoB,CACtB,sBAAuBJ,IAAqC,sBAC5D,oBAAqBC,IAAmC,oBACxD,wBAAyBC,IAAuC,wBAChE,qBAAsBC,IAAoC,qBAC1D,YAAanE,IAAc,WAC7B,EACA+D,GAAA,kBAA4BK,ICrB5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIC,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBujI,IAAkB,CACpB,kBAAmBD,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACAqE,GAAA,gBAA0BE,oBCf1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIxE,IAAgB3hI,EAMhBomI,IAAmB,CACrB,WAAYzE,IAAc,UAC5B,EACAwE,GAAA,iBAA2BC,gCCb3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC8BA,GAAA,wBAAG,OAClC,IAAIJ,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhB2jI,IAA0B,CAC5B,kBAAmBL,IAA4B,kBAC/C,kBAAmBtE,IAAc,iBACnC,EACA0E,GAAA,wBAAkCC,ICflC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAIjB,IAAoCtlI,GACpCwmI,IAAoC7jI,GACpCsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhB8/H,IAA2B,CAC7B,mBAAoBnB,IAAkC,mBACtD,wBAAyBkB,IAAkC,wBAC3D,kBAAmBP,IAA4B,kBAC/C,wBAAyBtE,IAAc,uBACzC,EACA4E,GAAA,yBAAmCE,ICnBnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIb,IAAyC7lI,GACzCslI,IAAoC3iI,GACpCgkI,IAA0CziI,GAC1C+hI,IAA8Bt/H,GAC9Bg7H,IAAgBjmH,EAMhBkrH,IAAqB,CACvB,wBAAyBf,IAAuC,wBAChE,mBAAoBP,IAAkC,mBACtD,yBAA0BqB,IAAwC,yBAClE,kBAAmBV,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACA+E,GAAA,mBAA6BE,ICrB7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIC,IAA+B9mI,GAC/BimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhB6iI,IAAqB,CACvB,mBAAoBD,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACAkF,GAAA,mBAA6BE,ICjB7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAIC,IAA6BjnI,GAC7BknI,IAA+BvkI,GAC/Bg/H,IAAgBz9H,EAMhBijI,IAA2B,CAC7B,iBAAkBF,IAA2B,iBAC7C,mBAAoBC,IAA6B,mBACjD,mBAAoBvF,IAAc,kBACpC,EACAqF,GAAA,yBAAmCG,cCjBnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIxB,IAAqC5lI,GACrCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBmjI,IAAmB,CACrB,oBAAqBzB,IAAmC,oBACxD,kBAAmBK,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACAyF,GAAA,iBAA2BC,cCjB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAI1B,IAAqC5lI,GACrCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBqjI,IAAoB,CACtB,oBAAqB3B,IAAmC,oBACxD,kBAAmBK,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACA2F,GAAA,kBAA4BC,cCjB5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAI7B,IAAuC3lI,GACvCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBujI,IAAmB,CACrB,sBAAuB9B,IAAqC,sBAC5D,kBAAmBM,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACA6F,GAAA,iBAA2BC,cCjB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAI/B,IAAuC3lI,GACvC4lI,IAAqCjjI,GACrCsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhBghI,IAAoB,CACtB,sBAAuBhC,IAAqC,sBAC5D,oBAAqBC,IAAmC,oBACxD,kBAAmBK,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACA+F,GAAA,kBAA4BC,cCnB5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIjC,IAAuC3lI,GACvC4lI,IAAqCjjI,GACrCsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhBkhI,IAAmB,CACrB,sBAAuBlC,IAAqC,sBAC5D,oBAAqBC,IAAmC,oBACxD,kBAAmBK,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACAiG,GAAA,iBAA2BC,cCnB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAInC,IAAuC3lI,GACvCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhB6jI,IAAoB,CACtB,sBAAuBpC,IAAqC,sBAC5D,kBAAmBM,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACAmG,GAAA,kBAA4BC,oBCjB5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAI/B,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBslI,IAAwB,CAC1B,kBAAmBhC,IAA4B,kBAC/C,gBAAiBtE,IAAc,eACjC,EACAqG,GAAA,sBAAgCC,oBCfhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIjC,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBwlI,IAAwB,CAC1B,kBAAmBlC,IAA4B,kBAC/C,gBAAiBtE,IAAc,eACjC,EACAuG,GAAA,sBAAgCC,ICfhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIC,IAAkCroI,GAClC8mI,IAA+BnkI,GAC/BsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhB2hI,IAAqB,CACvB,sBAAuBD,IAAgC,sBACvD,mBAAoBvB,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACAyG,GAAA,mBAA6BE,ICnB7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAI1C,IAAyC7lI,GACzC2mI,IAA0ChkI,GAC1C6lI,IAAkCtkI,GAClCukI,IAA+B9hI,GAC/B6/H,IAAoC9qH,GACpCorH,IAA+B5hH,GAC/B+gH,IAA8BpuG,GAC9B8pG,IAAgB7pG,EAMhB4wG,IAAkB,CACpB,wBAAyB7C,IAAuC,wBAChE,yBAA0Bc,IAAwC,yBAClE,sBAAuB6B,IAAgC,sBACvD,mBAAoBC,IAA6B,mBACjD,wBAAyBjC,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACA4G,GAAA,gBAA0BG,oBC3B1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAI1C,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBimI,IAAkB,CACpB,kBAAmB3C,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACAgH,GAAA,gBAA0BC,cCf1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIlD,IAAuC3lI,GACvC8mI,IAA+BnkI,GAC/BsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhBmiI,IAAoB,CACtB,sBAAuBnD,IAAqC,sBAC5D,mBAAoBmB,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACAkH,GAAA,kBAA4BC,ICnB5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIN,IAA+BzoI,GAC/BwmI,IAAoC7jI,GACpCmkI,IAA+B5iI,GAC/B8kI,IAA4BriI,GAC5Bs/H,IAA8BvqH,GAC9ButH,IAA8B/jH,GAC9By8G,IAAgB9pG,EAMhBqxG,IAAkB,CACpB,mBAAoBT,IAA6B,mBACjD,wBAAyBjC,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,gBAAiBkC,IAA0B,gBAC3C,kBAAmB/C,IAA4B,kBAC/C,kBAAmBgD,IAA4B,kBAC/C,UAAWtH,IAAc,SAC3B,EACAoH,GAAA,gBAA0BG,cCzB1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAId,IAAkCroI,GAClCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBklI,IAAoB,CACtB,sBAAuBf,IAAgC,sBACvD,kBAAmBpC,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACAwH,GAAA,kBAA4BC,cCjB5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiCA,GAAA,2BAAG,OACrC,IAAIhB,IAAkCroI,GAClCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBolI,IAA6B,CAC/B,sBAAuBjB,IAAgC,sBACvD,kBAAmBpC,IAA4B,kBAC/C,qBAAsBtE,IAAc,oBACtC,EACA0H,GAAA,2BAAqCC,cCjBrC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAItD,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhB6mI,IAAkB,CACpB,kBAAmBvD,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACA4H,GAAA,gBAA0BC,cCf1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIxC,IAA6BjnI,GAC7B2hI,IAAgBh/H,EAMhB+mI,IAAwB,CAC1B,iBAAkBzC,IAA2B,iBAC7C,gBAAiBtF,IAAc,eACjC,EACA8H,GAAA,sBAAgCC,cCfhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIhE,IAAuC3lI,GACvC4lI,IAAqCjjI,GACrCsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhBijI,IAAmB,CACrB,sBAAuBjE,IAAqC,sBAC5D,oBAAqBC,IAAmC,oBACxD,kBAAmBK,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACAgI,GAAA,iBAA2BC,cCnB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIlE,IAAuC3lI,GACvC4lI,IAAqCjjI,GACrCsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhBmjI,IAAoB,CACtB,sBAAuBnE,IAAqC,sBAC5D,oBAAqBC,IAAmC,oBACxD,kBAAmBK,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACAkI,GAAA,kBAA4BC,cCnB5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAInE,IAAqC5lI,GACrCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhB8lI,IAAmB,CACrB,oBAAqBpE,IAAmC,oBACxD,kBAAmBK,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACAoI,GAAA,iBAA2BC,cCjB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIhE,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBunI,IAAoB,CACtB,kBAAmBjE,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACAsI,GAAA,kBAA4BC,cCf5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiCA,GAAA,2BAAG,OACrC,IAAIrD,IAA+B9mI,GAC/BinI,IAA6BtkI,GAC7BukI,IAA+BhjI,GAC/By9H,IAAgBh7H,EAMhByjI,IAA6B,CAC/B,mBAAoBtD,IAA6B,mBACjD,iBAAkBG,IAA2B,iBAC7C,mBAAoBC,IAA6B,mBACjD,qBAAsBvF,IAAc,oBACtC,EACAwI,GAAA,2BAAqCC,cCnBrC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIpE,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhB2nI,IAAmB,CACrB,kBAAmBrE,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACA0I,GAAA,iBAA2BC,cCf3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAI5E,IAAuC3lI,GACvC6lI,IAAyCljI,GACzC8lI,IAA+BvkI,GAC/BsiI,IAAoC7/H,GACpCmgI,IAA+BprH,GAC/BuqH,IAA8B/gH,GAC9By8G,IAAgB9pG,EAMhB2yG,IAAoB,CACtB,sBAAuB7E,IAAqC,sBAC5D,wBAAyBE,IAAuC,wBAChE,mBAAoB4C,IAA6B,mBACjD,wBAAyBjC,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACA4I,GAAA,kBAA4BC,cCzB5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAI7E,IAAqC5lI,GACrCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBwmI,IAAoB,CACtB,oBAAqB9E,IAAmC,oBACxD,kBAAmBK,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACA8I,GAAA,kBAA4BC,sCCjB5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIhF,IAAuC3lI,GACvCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhB0mI,IAAwB,CAC1B,sBAAuBjF,IAAqC,sBAC5D,kBAAmBM,IAA4B,kBAC/C,gBAAiBtE,IAAc,eACjC,EACAgJ,GAAA,sBAAgCC,cCjBhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAI/E,IAAsC9lI,GACtCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhB4mI,IAAuB,CACzB,qBAAsBhF,IAAoC,qBAC1D,kBAAmBG,IAA4B,kBAC/C,eAAgBtE,IAAc,cAChC,EACAkJ,GAAA,qBAA+BC,cCjB/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAI9E,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBqoI,IAAqB,CACvB,kBAAmB/E,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACAoJ,GAAA,mBAA6BC,ICf7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAIC,IAAkClrI,GAClCmrI,IAAiCxoI,GACjCyoI,IAA+BlnI,GAC/By9H,IAAgBh7H,EAMhB0kI,IAAsB,CACxB,sBAAuBH,IAAgC,sBACvD,qBAAsBC,IAA+B,qBACrD,mBAAoBC,IAA6B,mBACjD,cAAezJ,IAAc,aAC/B,EACAsJ,GAAA,oBAA8BI,ICnB9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAIC,IAAgCvrI,GAChCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBsnI,IAA2B,CAC7B,oBAAqBD,IAA8B,oBACnD,kBAAmBtF,IAA4B,kBAC/C,mBAAoBtE,IAAc,kBACpC,EACA2J,GAAA,yBAAmCE,cCjBnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAI5F,IAAyC7lI,GACzCyoI,IAA+B9lI,GAC/B6jI,IAAoCtiI,GACpC4iI,IAA+BngI,GAC/Bs/H,IAA8BvqH,GAC9BimH,IAAgBz8G,EAMhBwmH,IAAoB,CACtB,wBAAyB7F,IAAuC,wBAChE,mBAAoB4C,IAA6B,mBACjD,wBAAyBjC,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACA8J,GAAA,kBAA4BC,0BCvB5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIhG,IAAuC3lI,GACvC6lI,IAAyCljI,GACzC6jI,IAAoCtiI,GACpC4iI,IAA+BngI,GAC/Bs/H,IAA8BvqH,GAC9ButH,IAA8B/jH,GAC9By8G,IAAgB9pG,EAMhB+zG,IAAoB,CACtB,sBAAuBjG,IAAqC,sBAC5D,wBAAyBE,IAAuC,wBAChE,wBAAyBW,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,kBAAmBgD,IAA4B,kBAC/C,YAAatH,IAAc,WAC7B,EACAgK,GAAA,kBAA4BC,ICzB5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIhG,IAAyC7lI,GACzCwmI,IAAoC7jI,GACpCmkI,IAA+B5iI,GAC/B4nI,IAA8BnlI,GAC9Bs/H,IAA8BvqH,GAC9ButH,IAA8B/jH,GAC9By8G,IAAgB9pG,EAMhBk0G,IAAmB,CACrB,wBAAyBlG,IAAuC,wBAChE,wBAAyBW,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,kBAAmBgF,IAA4B,kBAC/C,kBAAmB7F,IAA4B,kBAC/C,kBAAmBgD,IAA4B,kBAC/C,WAAYtH,IAAc,UAC5B,EACAkK,GAAA,iBAA2BE,cCzB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAInG,IAAyC7lI,GACzCwmI,IAAoC7jI,GACpCmkI,IAA+B5iI,GAC/B4nI,IAA8BnlI,GAC9Bs/H,IAA8BvqH,GAC9ButH,IAA8B/jH,GAC9By8G,IAAgB9pG,EAMhBo0G,IAAoB,CACtB,wBAAyBpG,IAAuC,wBAChE,wBAAyBW,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,kBAAmBgF,IAA4B,kBAC/C,kBAAmB7F,IAA4B,kBAC/C,kBAAmBgD,IAA4B,kBAC/C,YAAatH,IAAc,WAC7B,EACAqK,GAAA,kBAA4BC,ICzB5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAItG,IAAqC5lI,GACrC6lI,IAAyCljI,GACzCwpI,IAA6BjoI,GAC7BsiI,IAAoC7/H,GACpCylI,IAA8B1wH,GAC9BorH,IAA+B5hH,GAC/B+gH,IAA8BpuG,GAC9BoxG,IAA8BnxG,GAC9B6pG,IAAgB5pG,EAMhBs0G,IAAkB,CACpB,oBAAqBzG,IAAmC,oBACxD,wBAAyBC,IAAuC,wBAChE,iBAAkBsG,IAA2B,iBAC7C,wBAAyB3F,IAAkC,wBAC3D,kBAAmB4F,IAA4B,kBAC/C,mBAAoBtF,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,kBAAmBgD,IAA4B,kBAC/C,UAAWtH,IAAc,SAC3B,EACAuK,GAAA,gBAA0BG,cC7B1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIrG,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhB4pI,IAAqB,CACvB,kBAAmBtG,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACA2K,GAAA,mBAA6BC,cCf7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIvG,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhB8pI,IAAwB,CAC1B,kBAAmBxG,IAA4B,kBAC/C,gBAAiBtE,IAAc,eACjC,EACA6K,GAAA,sBAAgCC,cCfhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiCA,GAAA,2BAAG,OACrC,IAAIzG,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBgqI,IAA6B,CAC/B,kBAAmB1G,IAA4B,kBAC/C,qBAAsBtE,IAAc,oBACtC,EACA+K,GAAA,2BAAqCC,oBCfrC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAIjH,IAAuC3lI,GACvC6lI,IAAyCljI,GACzCgkI,IAA0CziI,GAC1C4iI,IAA+BngI,GAC/Bs/H,IAA8BvqH,GAC9BimH,IAAgBz8G,EAMhB2nH,IAAuB,CACzB,sBAAuBlH,IAAqC,sBAC5D,wBAAyBE,IAAuC,wBAChE,yBAA0Bc,IAAwC,yBAClE,mBAAoBG,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,eAAgBtE,IAAc,cAChC,EACAiL,GAAA,qBAA+BC,0BCvB/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAI7G,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBoqI,IAAqB,CACvB,kBAAmB9G,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACAmL,GAAA,mBAA6BC,0BCf7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAI/G,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBsqI,IAAmB,CACrB,kBAAmBhH,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACAqL,GAAA,iBAA2BC,cCf3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIpG,IAA+B9mI,GAC/BimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBipI,IAAmB,CACrB,mBAAoBrG,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACAuL,GAAA,iBAA2BC,ICjB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAI5E,IAAkCxoI,GAClCqtI,IAA6B1qI,GAC7B2qI,IAAuCppI,GACvCqpI,IAA6B5mI,GAC7Bs/H,IAA8BvqH,GAC9BimH,IAAgBz8G,EAMhBsoH,IAAkB,CACpB,sBAAuBhF,IAAgC,sBACvD,iBAAkB6E,IAA2B,iBAC7C,2BAA4BC,IAAqC,2BACjE,iBAAkBC,IAA2B,iBAC7C,kBAAmBtH,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACAyL,GAAA,gBAA0BI,ICvB1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAIjF,IAAkCxoI,GAClC0tI,IAA4B/qI,GAC5B6jI,IAAoCtiI,GACpC4iI,IAA+BngI,GAC/B2mI,IAAuC5xH,GACvCuqH,IAA8B/gH,GAC9By8G,IAAgB9pG,EAMhB81G,IAAuB,CACzB,sBAAuBnF,IAAgC,sBACvD,gBAAiBkF,IAA0B,gBAC3C,wBAAyBlH,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,2BAA4BwG,IAAqC,2BACjE,kBAAmBrH,IAA4B,kBAC/C,eAAgBtE,IAAc,cAChC,EACA8L,GAAA,qBAA+BE,oBCzB/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC6BA,GAAA,uBAAG,OACjC,IAAI3H,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBkrI,IAAyB,CAC3B,kBAAmB5H,IAA4B,kBAC/C,iBAAkBtE,IAAc,gBAClC,EACAiM,GAAA,uBAAiCC,ICfjC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAIjI,IAAyC7lI,GACzCwoI,IAAkC7lI,GAClC8lI,IAA+BvkI,GAC/BsiI,IAAoC7/H,GACpCmgI,IAA+BprH,GAC/BuqH,IAA8B/gH,GAC9B6oH,IAAmCl2G,GACnC8pG,IAAgB7pG,EAMhBk2G,IAAuB,CACzB,wBAAyBnI,IAAuC,wBAChE,sBAAuB2C,IAAgC,sBACvD,mBAAoBC,IAA6B,mBACjD,wBAAyBjC,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,uBAAwB8H,IAAiC,uBACzD,eAAgBpM,IAAc,cAChC,EACAmM,GAAA,qBAA+BE,IC3B/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIC,IAAqCluI,GACrCmuI,IAA+BxrI,GAC/BmkI,IAA+B5iI,GAC/BkqI,IAAiCznI,GACjC0nI,IAAiC3yH,GACjCuqH,IAA8B/gH,GAC9B6oH,IAAmCl2G,GACnC8pG,IAAgB7pG,EAMhBw2G,IAAkB,CACpB,yBAA0BJ,IAAmC,yBAC7D,mBAAoBC,IAA6B,mBACjD,mBAAoBrH,IAA6B,mBACjD,qBAAsBsH,IAA+B,qBACrD,qBAAsBC,IAA+B,qBACrD,kBAAmBpI,IAA4B,kBAC/C,uBAAwB8H,IAAiC,uBACzD,UAAWpM,IAAc,SAC3B,EACAsM,GAAA,gBAA0BK,IC3B1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIC,IAA4BxuI,GAC5BwoI,IAAkC7lI,GAClC8rI,IAA4BvqI,GAC5BgqI,IAAqCvnI,GACrC+nI,IAAiChzH,GACjCorH,IAA+B5hH,GAC/BkpH,IAAiCv2G,GACjCouG,IAA8BnuG,GAC9Bi2G,IAAmCh2G,GACnC4pG,IAAgB3pG,EAMhB22G,IAAkB,CACpB,gBAAiBH,IAA0B,gBAC3C,sBAAuBhG,IAAgC,sBACvD,gBAAiBiG,IAA0B,gBAC3C,yBAA0BP,IAAmC,yBAC7D,qBAAsBQ,IAA+B,qBACrD,mBAAoB5H,IAA6B,mBACjD,qBAAsBsH,IAA+B,qBACrD,kBAAmBnI,IAA4B,kBAC/C,uBAAwB8H,IAAiC,uBACzD,UAAWpM,IAAc,SAC3B,EACA4M,GAAA,gBAA0BI,IC/B1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIhJ,IAAqC5lI,GACrCmrI,IAAiCxoI,GACjC+rI,IAAiCxqI,GACjC2qI,IAA4BloI,GAC5BmgI,IAA+BprH,GAC/B0yH,IAAiClpH,GACjCkmH,IAA+BvzG,GAC/BouG,IAA8BnuG,GAC9B6pG,IAAgB5pG,EAMhB+2G,IAAkB,CACpB,oBAAqBlJ,IAAmC,oBACxD,qBAAsBuF,IAA+B,qBACrD,qBAAsBuD,IAA+B,qBACrD,gBAAiBG,IAA0B,gBAC3C,mBAAoB/H,IAA6B,mBACjD,qBAAsBsH,IAA+B,qBACrD,mBAAoBhD,IAA6B,mBACjD,kBAAmBnF,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACAiN,GAAA,gBAA0BE,IC7B1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIpJ,IAAuC3lI,GACvC4lI,IAAqCjjI,GACrCmjI,IAAsC5hI,GACtCsqI,IAA4B7nI,GAC5B6hI,IAAkC9sH,GAClCwyH,IAAqChpH,GACrC8pH,IAA8Bn3G,GAC9Bo3G,IAA4Bn3G,GAC5Bo3G,IAA+Bn3G,GAC/Bo3G,IAAkCn3G,GAClCs1G,IAAuC/+E,GACvC68E,IAA+B5jE,GAC/B4nE,IAA4B1nE,GAC5BokE,IAA8B3hE,GAC9BkkE,IAAiCn+D,GACjCyxD,IAAgBxxD,EAMhBk/D,IAAmB,CACrB,sBAAuB1J,IAAqC,sBAC5D,oBAAqBC,IAAmC,oBACxD,qBAAsBE,IAAoC,qBAC1D,gBAAiB0I,IAA0B,gBAC3C,sBAAuBhG,IAAgC,sBACvD,yBAA0B0F,IAAmC,yBAC7D,kBAAmBc,IAA4B,kBAC/C,gBAAiBC,IAA0B,gBAC3C,mBAAoBC,IAA6B,mBACjD,sBAAuBC,IAAgC,sBACvD,2BAA4B7B,IAAqC,2BACjE,mBAAoBlC,IAA6B,mBACjD,gBAAiBgE,IAA0B,gBAC3C,kBAAmBtD,IAA4B,kBAC/C,qBAAsBuC,IAA+B,qBACrD,gBAAiB1M,IAAc,eACjC,EACAoN,GAAA,iBAA2BM,IC3C3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC6BA,GAAA,uBAAG,OACjC,IAAI3J,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBsrI,IAAyB,CAC3B,sBAAuB7J,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,iBAAkB5N,IAAc,gBAClC,EACA2N,GAAA,uBAAiCE,cCjBjC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAI9J,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBwrI,IAAuB,CACzB,sBAAuB/J,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,eAAgB5N,IAAc,cAChC,EACA8N,GAAA,qBAA+BC,oBCjB/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC6BA,GAAA,uBAAG,OACjC,IAAI1J,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBitI,IAAyB,CAC3B,kBAAmB3J,IAA4B,kBAC/C,iBAAkBtE,IAAc,gBAClC,EACAgO,GAAA,uBAAiCC,oBCfjC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAI5J,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBmtI,IAA2B,CAC7B,kBAAmB7J,IAA4B,kBAC/C,mBAAoBtE,IAAc,kBACpC,EACAkO,GAAA,yBAAmCC,oBCfnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIpK,IAAuC3lI,GACvC4lI,IAAqCjjI,GACrC2qI,IAAuCppI,GACvCkrI,IAA4BzoI,GAC5Bs/H,IAA8BvqH,GAC9BimH,IAAgBz8G,EAMhB8qH,IAAoB,CACtB,sBAAuBrK,IAAqC,sBAC5D,oBAAqBC,IAAmC,oBACxD,2BAA4B0H,IAAqC,2BACjE,gBAAiB8B,IAA0B,gBAC3C,kBAAmBnJ,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACAoO,GAAA,kBAA4BC,ICvB5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIC,IAA8BlwI,GAC9BimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBisI,IAAwB,CAC1B,kBAAmBD,IAA4B,kBAC/C,kBAAmBjK,IAA4B,kBAC/C,gBAAiBtE,IAAc,eACjC,EACAsO,GAAA,sBAAgCE,cCjBhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIvK,IAAyC7lI,GACzCyoI,IAA+B9lI,GAC/BmkI,IAA+B5iI,GAC/B+hI,IAA8Bt/H,GAC9Bg7H,IAAgBjmH,EAMhB20H,IAAqB,CACvB,wBAAyBxK,IAAuC,wBAChE,mBAAoB4C,IAA6B,mBACjD,mBAAoB3B,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACAyO,GAAA,mBAA6BC,ICrB7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC6BA,GAAA,uBAAG,OACjC,IAAIpF,IAAkClrI,GAClCwoI,IAAkC7lI,GAClC4tI,IAAqCrsI,GACrCgqI,IAAqCvnI,GACrC6pI,IAAkC90H,GAClC2sH,IAAkCnjH,GAClCurH,IAAmC54G,GACnC64G,IAA+B54G,GAC/Bw1G,IAAuCv1G,GACvCqzG,IAA+BpzG,GAC/Bo3G,IAA4B7gF,GAC5B8/E,IAAiC7mE,GACjCy+D,IAA8Bv+D,GAC9Bi6D,IAAgBx3D,EAMhBwmE,IAAyB,CAC3B,sBAAuBzF,IAAgC,sBACvD,sBAAuB1C,IAAgC,sBACvD,yBAA0B+H,IAAmC,yBAC7D,yBAA0BrC,IAAmC,yBAC7D,sBAAuBsC,IAAgC,sBACvD,sBAAuBnI,IAAgC,sBACvD,uBAAwBoI,IAAiC,uBACzD,mBAAoBC,IAA6B,mBACjD,2BAA4BpD,IAAqC,2BACjE,mBAAoBlC,IAA6B,mBACjD,gBAAiBgE,IAA0B,gBAC3C,qBAAsBf,IAA+B,qBACrD,kBAAmBpI,IAA4B,kBAC/C,iBAAkBtE,IAAc,gBAClC,EACA2O,GAAA,uBAAiCK,ICvCjC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC8BA,GAAA,wBAAG,OAClC,IAAIpI,IAAkCxoI,GAClCqoI,IAAkC1lI,GAClC8tI,IAAmCvsI,GACnC2sI,IAAmClqI,GACnCs/H,IAA8BvqH,GAC9BimH,IAAgBz8G,EAMhB4rH,IAA0B,CAC5B,sBAAuBtI,IAAgC,sBACvD,sBAAuBH,IAAgC,sBACvD,uBAAwBoI,IAAiC,uBACzD,uBAAwBI,IAAiC,uBACzD,kBAAmB5K,IAA4B,kBAC/C,kBAAmBtE,IAAc,iBACnC,EACAiP,GAAA,wBAAkCE,cCvBlC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAI7B,IAA+BlvI,GAC/BimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhB8sI,IAAkB,CACpB,mBAAoB9B,IAA6B,mBACjD,kBAAmBjJ,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACAoP,GAAA,gBAA0BC,cCjB1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIxI,IAA+BzoI,GAC/BwmI,IAAoC7jI,GACpCmkI,IAA+B5iI,GAC/B+hI,IAA8Bt/H,GAC9Bg7H,IAAgBjmH,EAMhBw1H,IAAqB,CACvB,mBAAoBzI,IAA6B,mBACjD,wBAAyBjC,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACAsP,GAAA,mBAA6BC,cCrB7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIlL,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhByuI,IAAqB,CACvB,kBAAmBnL,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACAwP,GAAA,mBAA6BC,cCf7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIxL,IAAyC7lI,GACzCyoI,IAA+B9lI,GAC/B6jI,IAAoCtiI,GACpC4iI,IAA+BngI,GAC/Bs/H,IAA8BvqH,GAC9BimH,IAAgBz8G,EAMhBosH,IAAoB,CACtB,wBAAyBzL,IAAuC,wBAChE,mBAAoB4C,IAA6B,mBACjD,wBAAyBjC,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACA0P,GAAA,kBAA4BC,cCvB5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAI1L,IAAyC7lI,GACzCyoI,IAA+B9lI,GAC/BmkI,IAA+B5iI,GAC/B+hI,IAA8Bt/H,GAC9Bg7H,IAAgBjmH,EAMhB81H,IAAqB,CACvB,wBAAyB3L,IAAuC,wBAChE,mBAAoB4C,IAA6B,mBACjD,mBAAoB3B,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACA4P,GAAA,mBAA6BC,oBCrB7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAI9P,IAAgB3hI,EAMhB0xI,IAAwB,CAC1B,gBAAiB/P,IAAc,eACjC,EACA8P,GAAA,sBAAgCC,ICbhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAI1K,IAA6BjnI,GAC7B4xI,IAAkCjvI,GAClCg/H,IAAgBz9H,EAMhB2tI,IAAwB,CAC1B,iBAAkB5K,IAA2B,iBAC7C,sBAAuB2K,IAAgC,sBACvD,gBAAiBjQ,IAAc,eACjC,EACAgQ,GAAA,sBAAgCE,cCjBhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAInM,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhB6tI,IAA2B,CAC7B,sBAAuBpM,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,mBAAoB5N,IAAc,kBACpC,EACAmQ,GAAA,yBAAmCC,cCjBnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC6BA,GAAA,uBAAG,OACjC,IAAIrM,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhB+tI,IAAyB,CAC3B,sBAAuBtM,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,iBAAkB5N,IAAc,gBAClC,EACAqQ,GAAA,uBAAiCC,cCjBjC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIvM,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBiuI,IAAwB,CAC1B,sBAAuBxM,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,gBAAiB5N,IAAc,eACjC,EACAuQ,GAAA,sBAAgCC,cCjBhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAInM,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhB0vI,IAAsB,CACxB,kBAAmBpM,IAA4B,kBAC/C,cAAetE,IAAc,aAC/B,EACAyQ,GAAA,oBAA8BC,cCf9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAI9J,IAAkCxoI,GAClCuwI,IAAqC5tI,GACrCurI,IAAqChqI,GACrCmkI,IAAkC1hI,GAClC8pI,IAAmC/0H,GACnC4xH,IAAuCpoH,GACvC+gH,IAA8BpuG,GAC9B8pG,IAAgB7pG,EAMhBy6G,IAAsB,CACxB,sBAAuB/J,IAAgC,sBACvD,yBAA0B+H,IAAmC,yBAC7D,yBAA0BrC,IAAmC,yBAC7D,sBAAuB7F,IAAgC,sBACvD,uBAAwBoI,IAAiC,uBACzD,2BAA4BnD,IAAqC,2BACjE,kBAAmBrH,IAA4B,kBAC/C,cAAetE,IAAc,aAC/B,EACA2Q,GAAA,oBAA8BC,cC3B9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAI7M,IAAuC3lI,GACvC4lI,IAAqCjjI,GACrCmjI,IAAsC5hI,GACtCusI,IAAmC9pI,GACnCmgI,IAA+BprH,GAC/BuqH,IAA8B/gH,GAC9B6oH,IAAmCl2G,GACnC8pG,IAAgB7pG,EAMhB26G,IAAmB,CACrB,sBAAuB9M,IAAqC,sBAC5D,oBAAqBC,IAAmC,oBACxD,qBAAsBE,IAAoC,qBAC1D,uBAAwB2K,IAAiC,uBACzD,mBAAoB3J,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,uBAAwB8H,IAAiC,uBACzD,WAAYpM,IAAc,UAC5B,EACA6Q,GAAA,iBAA2BC,oBC3B3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIzM,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBgwI,IAAoB,CACtB,kBAAmB1M,IAA4B,kBAC/C,iBAAkBtE,IAAc,gBAClC,EACA+Q,GAAA,kBAA4BC,ICf5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIC,IAAmC7yI,GACnCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhB4uI,IAAoB,CACtB,kBAAmBD,IAAiC,kBACpD,kBAAmB5M,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACAiR,GAAA,kBAA4BE,cCjB5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0CA,GAAA,oCAAG,OAC9C,IAAIpN,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhB8uI,IAAsC,CACxC,sBAAuBrN,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,8BAA+B5N,IAAc,6BAC/C,EACAoR,GAAA,oCAA8CC,cCjB9C,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIhN,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBuwI,IAAoB,CACtB,kBAAmBjN,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACAsR,GAAA,kBAA4BC,gCCf5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAItN,IAAyC7lI,GACzCyoI,IAA+B9lI,GAC/BmkI,IAA+B5iI,GAC/B+hI,IAA8Bt/H,GAC9Bg7H,IAAgBjmH,EAMhB03H,IAAsB,CACxB,wBAAyBvN,IAAuC,wBAChE,mBAAoB4C,IAA6B,mBACjD,mBAAoB3B,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,cAAetE,IAAc,aAC/B,EACAwR,GAAA,oBAA8BC,ICrB9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuCA,GAAA,iCAAG,OAC3C,IAAIxN,IAAyC7lI,GACzCszI,IAAgC3wI,GAChCg/H,IAAgBz9H,EAMhBqvI,IAAmC,CACrC,wBAAyB1N,IAAuC,wBAChE,oBAAqByN,IAA8B,oBACnD,gCAAiC3R,IAAc,+BACjD,EACA0R,GAAA,iCAA2CE,ICjB3C,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIC,IAAkDzzI,GAClD2hI,IAAgBh/H,EAMhB+wI,IAAoB,CACtB,iCAAkCD,IAAgD,iCAClF,iBAAkB9R,IAAc,gBAClC,EACA6R,GAAA,kBAA4BE,oBCf5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAI9N,IAAyC7lI,GACzCyoI,IAA+B9lI,GAC/BmkI,IAA+B5iI,GAC/B+hI,IAA8Bt/H,GAC9Bg7H,IAAgBjmH,EAMhBk4H,IAAuB,CACzB,wBAAyB/N,IAAuC,wBAChE,mBAAoB4C,IAA6B,mBACjD,mBAAoB3B,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,eAAgBtE,IAAc,cAChC,EACAgS,GAAA,qBAA+BC,cCrB/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIhO,IAAyC7lI,GACzCyoI,IAA+B9lI,GAC/BmkI,IAA+B5iI,GAC/B+hI,IAA8Bt/H,GAC9Bg7H,IAAgBjmH,EAMhBo4H,IAAwB,CAC1B,wBAAyBjO,IAAuC,wBAChE,mBAAoB4C,IAA6B,mBACjD,mBAAoB3B,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,gBAAiBtE,IAAc,eACjC,EACAkS,GAAA,sBAAgCC,ICrBhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAI7I,IAAkClrI,GAClC8mI,IAA+BnkI,GAC/B+tI,IAA+BxsI,GAC/B8vI,IAAiCrtI,GACjC2sI,IAAgC53H,GAChCu4H,IAAkC/uH,GAClC+gH,IAA8BpuG,GAC9B8pG,IAAgB7pG,EAMhBo8G,IAAoB,CACtB,sBAAuBhJ,IAAgC,sBACvD,mBAAoBpE,IAA6B,mBACjD,mBAAoB4J,IAA6B,mBACjD,qBAAsBsD,IAA+B,qBACrD,oBAAqBV,IAA8B,oBACnD,sBAAuBW,IAAgC,sBACvD,kBAAmBhO,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACAoS,GAAA,kBAA4BG,IC3B5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIC,IAAmCp0I,GACnC8mI,IAA+BnkI,GAC/B0xI,IAA8BnwI,GAC9B+hI,IAA8Bt/H,GAC9Bg7H,IAAgBjmH,EAMhB44H,IAAqB,CACvB,kBAAmBF,IAAiC,kBACpD,mBAAoBtN,IAA6B,mBACjD,kBAAmBuN,IAA4B,kBAC/C,kBAAmBpO,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACAwS,GAAA,mBAA6BG,cCrB7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkCA,GAAA,4BAAG,OACtC,IAAIH,IAAmCp0I,GACnC8mI,IAA+BnkI,GAC/B0xI,IAA8BnwI,GAC9B+hI,IAA8Bt/H,GAC9Bg7H,IAAgBjmH,EAMhB84H,IAA8B,CAChC,kBAAmBJ,IAAiC,kBACpD,mBAAoBtN,IAA6B,mBACjD,kBAAmBuN,IAA4B,kBAC/C,kBAAmBpO,IAA4B,kBAC/C,sBAAuBtE,IAAc,qBACvC,EACA4S,GAAA,4BAAsCC,cCrBtC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsCA,GAAA,gCAAG,OAC1C,IAAIxO,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhB+xI,IAAkC,CACpC,kBAAmBzO,IAA4B,kBAC/C,0BAA2BtE,IAAc,yBAC3C,EACA8S,GAAA,gCAA0CC,cCf1C,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAIhP,IAAuC3lI,GACvC6lI,IAAyCljI,GACzCmjI,IAAsC5hI,GACtCukI,IAA+B9hI,GAC/B6/H,IAAoC9qH,GACpCorH,IAA+B5hH,GAC/B+gH,IAA8BpuG,GAC9B8pG,IAAgB7pG,EAMhB88G,IAAsB,CACxB,sBAAuBjP,IAAqC,sBAC5D,wBAAyBE,IAAuC,wBAChE,qBAAsBC,IAAoC,qBAC1D,mBAAoB2C,IAA6B,mBACjD,wBAAyBjC,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,cAAetE,IAAc,aAC/B,EACAgT,GAAA,oBAA8BC,cC3B9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiCA,GAAA,2BAAG,OACrC,IAAIC,IAAgC90I,GAChCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhB6wI,IAA6B,CAC/B,oBAAqBD,IAA8B,oBACnD,kBAAmB7O,IAA4B,kBAC/C,qBAAsBtE,IAAc,oBACtC,EACAkT,GAAA,2BAAqCE,cCjBrC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC8BA,GAAA,wBAAG,OAClC,IAAIvM,IAA+BzoI,GAC/B8mI,IAA+BnkI,GAC/BsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhBsuI,IAA0B,CAC5B,mBAAoBxM,IAA6B,mBACjD,mBAAoB3B,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,kBAAmBtE,IAAc,iBACnC,EACAqT,GAAA,wBAAkCC,0BCnBlC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkCA,GAAA,4BAAG,OACtC,IAAIjO,IAA6BjnI,GAC7B2hI,IAAgBh/H,EAMhBwyI,IAA8B,CAChC,iBAAkBlO,IAA2B,iBAC7C,sBAAuBtF,IAAc,qBACvC,EACAuT,GAAA,4BAAsCC,cCftC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAInO,IAA6BjnI,GAC7B2hI,IAAgBh/H,EAMhB0yI,IAA2B,CAC7B,iBAAkBpO,IAA2B,iBAC7C,mBAAoBtF,IAAc,kBACpC,EACAyT,GAAA,yBAAmCC,cCfnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyCA,GAAA,mCAAG,OAC7C,IAAIrO,IAA6BjnI,GAC7BimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBqxI,IAAqC,CACvC,iBAAkBtO,IAA2B,iBAC7C,kBAAmBhB,IAA4B,kBAC/C,6BAA8BtE,IAAc,4BAC9C,EACA2T,GAAA,mCAA6CC,oBCjB7C,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC6BA,GAAA,uBAAG,OACjC,IAAIjG,IAAkCvvI,GAClCinI,IAA6BtkI,GAC7Bg/H,IAAgBz9H,EAMhBuxI,IAAyB,CAC3B,iBAAkBlG,IAAgC,iBAClD,iBAAkBtI,IAA2B,iBAC7C,iBAAkBtF,IAAc,gBAClC,EACA6T,GAAA,uBAAiCC,ICjBjC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAIzO,IAA6BjnI,GAC7B21I,IAAmChzI,GACnCg/H,IAAgBz9H,EAMhB0xI,IAA2B,CAC7B,iBAAkB3O,IAA2B,iBAC7C,uBAAwB0O,IAAiC,uBACzD,mBAAoBhU,IAAc,kBACpC,EACA+T,GAAA,yBAAmCE,cCjBnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAI5O,IAA6BjnI,GAC7ButI,IAA6B5qI,GAC7Bg/H,IAAgBz9H,EAMhB4xI,IAAwB,CAC1B,iBAAkB7O,IAA2B,iBAC7C,iBAAkBsG,IAA2B,iBAC7C,gBAAiB5L,IAAc,eACjC,EACAkU,GAAA,sBAAgCC,cCjBhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC6BA,GAAA,uBAAG,OACjC,IAAI9O,IAA6BjnI,GAC7B2hI,IAAgBh/H,EAMhBqzI,IAAyB,CAC3B,iBAAkB/O,IAA2B,iBAC7C,iBAAkBtF,IAAc,gBAClC,EACAoU,GAAA,uBAAiCC,cCfjC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAIhP,IAA6BjnI,GAC7B2hI,IAAgBh/H,EAMhBuzI,IAA2B,CAC7B,iBAAkBjP,IAA2B,iBAC7C,mBAAoBtF,IAAc,kBACpC,EACAsU,GAAA,yBAAmCC,cCfnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkCA,GAAA,4BAAG,OACtC,IAAIlP,IAA6BjnI,GAC7B2hI,IAAgBh/H,EAMhByzI,IAA8B,CAChC,iBAAkBnP,IAA2B,iBAC7C,sBAAuBtF,IAAc,qBACvC,EACAwU,GAAA,4BAAsCC,cCftC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIpP,IAA6BjnI,GAC7B2hI,IAAgBh/H,EAMhB2zI,IAAwB,CAC1B,iBAAkBrP,IAA2B,iBAC7C,gBAAiBtF,IAAc,eACjC,EACA0U,GAAA,sBAAgCC,cCfhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiCA,GAAA,2BAAG,OACrC,IAAItP,IAA6BjnI,GAC7B2hI,IAAgBh/H,EAMhB6zI,IAA6B,CAC/B,iBAAkBvP,IAA2B,iBAC7C,qBAAsBtF,IAAc,oBACtC,EACA4U,GAAA,2BAAqCC,ICfrC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIC,IAAqC12I,GACrC22I,IAAkCh0I,GAClCi0I,IAAuC1yI,GACvC2yI,IAAkClwI,GAClCmwI,IAAwCp7H,GACxCq7H,IAAqC7xH,GACrC8xH,IAA+Cn/G,GAC/Co/G,IAAqCn/G,GACrCo/G,IAAkCn/G,GAClCo/G,IAAmCn/G,GACnCo/G,IAAqC7oF,GACrC8oF,IAAwC7vE,GACxC8vE,IAAkC5vE,GAClC6vE,IAAuCptE,GACvCwrE,IAAmCzlE,GACnCq7D,IAAgCp7D,GAChC81D,IAA8B71D,GAC9BuxD,IAAgB1sC,EAMhBuiD,IAAoB,CACtB,yBAA0Bd,IAAmC,yBAC7D,sBAAuBC,IAAgC,sBACvD,2BAA4BC,IAAqC,2BACjE,sBAAuBC,IAAgC,sBACvD,4BAA6BC,IAAsC,4BACnE,yBAA0BC,IAAmC,yBAC7D,mCAAoCC,IAA6C,mCACjF,yBAA0BC,IAAmC,yBAC7D,sBAAuBC,IAAgC,sBACvD,uBAAwBC,IAAiC,uBACzD,yBAA0BC,IAAmC,yBAC7D,4BAA6BC,IAAsC,4BACnE,sBAAuBC,IAAgC,sBACvD,2BAA4BC,IAAqC,2BACjE,uBAAwB5B,IAAiC,uBACzD,oBAAqBpK,IAA8B,oBACnD,kBAAmBtF,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACA8U,GAAA,kBAA4Be,IC/C5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAIC,IAA8B13I,GAC9BimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhByzI,IAAsB,CACxB,kBAAmBD,IAA4B,kBAC/C,kBAAmBzR,IAA4B,kBAC/C,cAAetE,IAAc,aAC/B,EACA8V,GAAA,oBAA8BE,cCjB9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAIhS,IAAqC5lI,GACrCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhB2zI,IAAsB,CACxB,oBAAqBjS,IAAmC,oBACxD,kBAAmBK,IAA4B,kBAC/C,cAAetE,IAAc,aAC/B,EACAiW,GAAA,oBAA8BC,oBCjB9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC6BA,GAAA,uBAAG,OACjC,IAAI7R,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBo1I,IAAyB,CAC3B,kBAAmB9R,IAA4B,kBAC/C,iBAAkBtE,IAAc,gBAClC,EACAmW,GAAA,uBAAiCC,ICfjC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC8BA,GAAA,wBAAG,OAClC,IAAIxP,IAAkCxoI,GAClCuwI,IAAqC5tI,GACrC0lI,IAAkCnkI,GAClCusI,IAAmC9pI,GACnCsxI,IAAmCv8H,GACnCg1H,IAA+BxrH,GAC/B+gH,IAA8BpuG,GAC9B8pG,IAAgB7pG,EAMhBogH,IAA0B,CAC5B,sBAAuB1P,IAAgC,sBACvD,yBAA0B+H,IAAmC,yBAC7D,sBAAuBlI,IAAgC,sBACvD,uBAAwBoI,IAAiC,uBACzD,uBAAwBwH,IAAiC,uBACzD,mBAAoBvH,IAA6B,mBACjD,kBAAmBzK,IAA4B,kBAC/C,kBAAmBtE,IAAc,iBACnC,EACAqW,GAAA,wBAAkCE,cC3BlC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkCA,GAAA,4BAAG,OACtC,IAAI9P,IAAkCroI,GAClC8mI,IAA+BnkI,GAC/BsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhByxI,IAA8B,CAChC,sBAAuB/P,IAAgC,sBACvD,mBAAoBvB,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,sBAAuBtE,IAAc,qBACvC,EACAwW,GAAA,4BAAsCC,cCnBtC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqCA,GAAA,+BAAG,OACzC,IAAI1S,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBo0I,IAAiC,CACnC,sBAAuB3S,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,yBAA0B5N,IAAc,wBAC1C,EACA0W,GAAA,+BAAyCC,cCjBzC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAItS,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhB61I,IAAkB,CACpB,kBAAmBvS,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACA4W,GAAA,gBAA0BC,cCf1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIxS,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhB+1I,IAAmB,CACrB,kBAAmBzS,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACA8W,GAAA,iBAA2BC,cCf3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIhT,IAAuC3lI,GACvCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhB00I,IAAkB,CACpB,sBAAuBjT,IAAqC,sBAC5D,kBAAmBM,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACAgX,GAAA,gBAA0BC,cCjB1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIlT,IAAuC3lI,GACvCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhB40I,IAAmB,CACrB,sBAAuBnT,IAAqC,sBAC5D,kBAAmBM,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACAkX,GAAA,iBAA2BC,cCjB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAIpT,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhB80I,IAAsB,CACxB,sBAAuBrT,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,cAAe5N,IAAc,aAC/B,EACAoX,GAAA,oBAA8BC,oBCjB9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAI3L,IAAuCttI,GACvCurI,IAAgC5oI,GAChCsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhBuyI,IAAmB,CACrB,2BAA4B5L,IAAqC,2BACjE,oBAAqB/B,IAA8B,oBACnD,kBAAmBtF,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACAsX,GAAA,iBAA2BC,ICnB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIC,IAA6Bp5I,GAC7ButI,IAA6B5qI,GAC7BsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhB0yI,IAAoB,CACtB,iBAAkBD,IAA2B,iBAC7C,iBAAkB7L,IAA2B,iBAC7C,kBAAmBtH,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACAwX,GAAA,kBAA4BE,cCnB5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC6BA,GAAA,uBAAG,OACjC,IAAI/J,IAAkCvvI,GAClCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBq1I,IAAyB,CAC3B,iBAAkBhK,IAAgC,iBAClD,kBAAmBtJ,IAA4B,kBAC/C,iBAAkBtE,IAAc,gBAClC,EACA2X,GAAA,uBAAiCC,cCjBjC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAI1S,IAA+B9mI,GAC/BouI,IAAiCzrI,GACjC0rI,IAAiCnqI,GACjC+hI,IAA8Bt/H,GAC9Bg7H,IAAgBjmH,EAMhB+9H,IAAoB,CACtB,mBAAoB3S,IAA6B,mBACjD,qBAAsBsH,IAA+B,qBACrD,qBAAsBC,IAA+B,qBACrD,kBAAmBpI,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACA6X,GAAA,kBAA4BC,cCrB5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAI/T,IAAuC3lI,GACvCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBy1I,IAAkB,CACpB,sBAAuBhU,IAAqC,sBAC5D,kBAAmBM,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACA+X,GAAA,gBAA0BC,cCjB1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIjU,IAAuC3lI,GACvCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhB21I,IAAmB,CACrB,sBAAuBlU,IAAqC,sBAC5D,kBAAmBM,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACAiY,GAAA,iBAA2BC,oBCjB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIhT,IAA+B9mI,GAC/BimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhB61I,IAAwB,CAC1B,mBAAoBjT,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,gBAAiBtE,IAAc,eACjC,EACAmY,GAAA,sBAAgCC,ICjBhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC6BA,GAAA,uBAAG,OACjC,IAAI3M,IAA6BrtI,GAC7Bi6I,IAAkCt3I,GAClCsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhBuzI,IAAyB,CAC3B,iBAAkB7M,IAA2B,iBAC7C,sBAAuB4M,IAAgC,sBACvD,kBAAmBhU,IAA4B,kBAC/C,iBAAkBtE,IAAc,gBAClC,EACAqY,GAAA,uBAAiCE,cCnBjC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIlU,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBy3I,IAAmB,CACrB,kBAAmBnU,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACAwY,GAAA,iBAA2BC,oBCf3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAI1U,IAAuC3lI,GACvCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBo2I,IAAwB,CAC1B,sBAAuB3U,IAAqC,sBAC5D,kBAAmBM,IAA4B,kBAC/C,gBAAiBtE,IAAc,eACjC,EACA0Y,GAAA,sBAAgCC,ICjBhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIC,IAA4Bx6I,GAC5BimI,IAA8BtjI,GAC9B83I,IAAkCv2I,GAClCy9H,IAAgBh7H,EAMhB+zI,IAAqB,CACvB,gBAAiBF,IAA0B,gBAC3C,kBAAmBvU,IAA4B,kBAC/C,sBAAuBwU,IAAgC,sBACvD,aAAc9Y,IAAc,YAC9B,EACA4Y,GAAA,mBAA6BG,cCnB7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkCA,GAAA,4BAAG,OACtC,IAAIH,IAA4Bx6I,GAC5BimI,IAA8BtjI,GAC9B83I,IAAkCv2I,GAClCy9H,IAAgBh7H,EAMhBi0I,IAA8B,CAChC,gBAAiBJ,IAA0B,gBAC3C,kBAAmBvU,IAA4B,kBAC/C,sBAAuBwU,IAAgC,sBACvD,sBAAuB9Y,IAAc,qBACvC,EACAgZ,GAAA,4BAAsCC,cCnBtC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAI7L,IAA8BhvI,GAC9BimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhB42I,IAAwB,CAC1B,kBAAmB9L,IAA4B,kBAC/C,kBAAmB/I,IAA4B,kBAC/C,gBAAiBtE,IAAc,eACjC,EACAkZ,GAAA,sBAAgCC,0BCjBhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAI7M,IAAqCluI,GACrCwmI,IAAoC7jI,GACpCksI,IAA4B3qI,GAC5B4iI,IAA+BngI,GAC/BynI,IAAiC1yH,GACjCuqH,IAA8B/gH,GAC9By8G,IAAgB9pG,EAMhBmjH,IAAqB,CACvB,yBAA0B9M,IAAmC,yBAC7D,wBAAyB1H,IAAkC,wBAC3D,gBAAiBqI,IAA0B,gBAC3C,mBAAoB/H,IAA6B,mBACjD,qBAAsBsH,IAA+B,qBACrD,kBAAmBnI,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACAoZ,GAAA,mBAA6BC,cCzB7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAIlE,IAAqC/2I,GACrCi3I,IAAqCt0I,GACrCy0I,IAAqClzI,GACrCmzI,IAAwC1wI,GACxC+wI,IAA8Bh8H,GAC9BuqH,IAA8B/gH,GAC9By8G,IAAgB9pG,EAMhBqjH,IAAsB,CACxB,yBAA0BnE,IAAmC,yBAC7D,yBAA0BE,IAAmC,yBAC7D,yBAA0BG,IAAmC,yBAC7D,4BAA6BC,IAAsC,4BACnE,kBAAmBK,IAA4B,kBAC/C,kBAAmBzR,IAA4B,kBAC/C,cAAetE,IAAc,aAC/B,EACAsZ,GAAA,oBAA8BC,cCzB9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmCA,GAAA,6BAAG,OACvC,IAAIjQ,IAAkClrI,GAClCmrI,IAAiCxoI,GACjC+zI,IAAqCxyI,GACrCyyI,IAAkChwI,GAClCowI,IAAqCr7H,GACrCu7H,IAAqC/xH,GACrCgyH,IAAkCr/G,GAClCs/G,IAAmCr/G,GACnCs/G,IAAqCr/G,GACrC49G,IAAmC39G,GACnC8uG,IAA+Bv4E,GAC/B03E,IAA8Bz+D,GAC9Bm6D,IAAgBj6D,EAMhB0zE,IAA+B,CACjC,sBAAuBlQ,IAAgC,sBACvD,qBAAsBC,IAA+B,qBACrD,yBAA0BuL,IAAmC,yBAC7D,sBAAuBC,IAAgC,sBACvD,yBAA0BI,IAAmC,yBAC7D,yBAA0BE,IAAmC,yBAC7D,sBAAuBC,IAAgC,sBACvD,uBAAwBC,IAAiC,uBACzD,yBAA0BC,IAAmC,yBAC7D,uBAAwBzB,IAAiC,uBACzD,mBAAoB7O,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,uBAAwBtE,IAAc,sBACxC,EACAwZ,GAAA,6BAAuCC,cCrCvC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAI3E,IAAqC12I,GACrC22I,IAAkCh0I,GAClCo0I,IAAqC7yI,GACrC+yI,IAAqCtwI,GACrCuwI,IAAkCx7H,GAClCy7H,IAAmCjyH,GACnCkyH,IAAqCv/G,GACrCw/G,IAAwCv/G,GACxC69G,IAAmC59G,GACnCyiH,IAA4BxiH,GAC5BsjH,IAA+B/sF,GAC/BygF,IAA8BxnE,GAC9B2mE,IAA+BzmE,GAC/B0mE,IAAiCjkE,GACjCutE,IAA8BxnE,GAC9Bk/D,IAA4Bj/D,GAC5Bk+D,IAAiCj+D,GACjC61D,IAA8BhxC,GAC9B0sC,IAAgBxsC,EAMhBomD,IAA2B,CAC7B,yBAA0B7E,IAAmC,yBAC7D,sBAAuBC,IAAgC,sBACvD,yBAA0BI,IAAmC,yBAC7D,yBAA0BE,IAAmC,yBAC7D,sBAAuBC,IAAgC,sBACvD,uBAAwBC,IAAiC,uBACzD,yBAA0BC,IAAmC,yBAC7D,4BAA6BC,IAAsC,4BACnE,uBAAwB1B,IAAiC,uBACzD,gBAAiB6E,IAA0B,gBAC3C,mBAAoBc,IAA6B,mBACjD,kBAAmBtM,IAA4B,kBAC/C,mBAAoBb,IAA6B,mBACjD,qBAAsBC,IAA+B,qBACrD,kBAAmBsJ,IAA4B,kBAC/C,gBAAiBtI,IAA0B,gBAC3C,qBAAsBf,IAA+B,qBACrD,kBAAmBpI,IAA4B,kBAC/C,mBAAoBtE,IAAc,kBACpC,EACA0Z,GAAA,yBAAmCE,ICjDnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAItQ,IAAkClrI,GAClCmrI,IAAiCxoI,GACjC+zI,IAAqCxyI,GACrCyyI,IAAkChwI,GAClCowI,IAAqCr7H,GACrCu7H,IAAqC/xH,GACrCgyH,IAAkCr/G,GAClCs/G,IAAmCr/G,GACnCs/G,IAAqCr/G,GACrCs/G,IAAwCr/G,GACxC29G,IAAmCpnF,GACnCisF,IAA4BhzE,GAC5B8zE,IAA+B5zE,GAC/BsnE,IAA8B7kE,GAC9BgkE,IAA+Bj+D,GAC/B42D,IAA+B32D,GAC/Bi+D,IAAiCh+D,GACjCsnE,IAA8BziD,GAC9Bm6C,IAA4Bj6C,GAC5BsmD,IAAgCrmD,GAChCsmD,IAAyCpmD,GACzCqmD,IAAqCpmD,GACrC84C,IAAiC74C,GACjCywC,IAA8BvwC,GAC9BisC,IAAgBhsC,EAMhBimD,IAAuB,CACzB,sBAAuB1Q,IAAgC,sBACvD,qBAAsBC,IAA+B,qBACrD,yBAA0BuL,IAAmC,yBAC7D,sBAAuBC,IAAgC,sBACvD,yBAA0BI,IAAmC,yBAC7D,yBAA0BE,IAAmC,yBAC7D,sBAAuBC,IAAgC,sBACvD,uBAAwBC,IAAiC,uBACzD,yBAA0BC,IAAmC,yBAC7D,4BAA6BC,IAAsC,4BACnE,uBAAwB1B,IAAiC,uBACzD,gBAAiB6E,IAA0B,gBAC3C,mBAAoBc,IAA6B,mBACjD,kBAAmBtM,IAA4B,kBAC/C,mBAAoBb,IAA6B,mBACjD,mBAAoBrH,IAA6B,mBACjD,qBAAsBsH,IAA+B,qBACrD,kBAAmBsJ,IAA4B,kBAC/C,gBAAiBtI,IAA0B,gBAC3C,oBAAqBqM,IAA8B,oBACnD,6BAA8BC,IAAuC,6BACrE,yBAA0BC,IAAmC,yBAC7D,qBAAsBtN,IAA+B,qBACrD,kBAAmBpI,IAA4B,kBAC/C,eAAgBtE,IAAc,cAChC,EACA6Z,GAAA,qBAA+BI,IC7D/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC6BA,GAAA,uBAAG,OACjC,IAAI9E,IAAqC/2I,GACrCi3I,IAAqCt0I,GACrCy0I,IAAqClzI,GACrCmzI,IAAwC1wI,GACxCgvI,IAAmCj6H,GACnCszH,IAA8B9pH,GAC9BipH,IAA+Bt2G,GAC/B0zG,IAAgCzzG,GAChC4/G,IAA8B3/G,GAC9B+jH,IAAiC9jH,GACjCiuG,IAA8B13E,GAC9BozE,IAAgBn6D,EAMhBu0E,IAAyB,CAC3B,yBAA0BhF,IAAmC,yBAC7D,yBAA0BE,IAAmC,yBAC7D,yBAA0BG,IAAmC,yBAC7D,4BAA6BC,IAAsC,4BACnE,uBAAwB1B,IAAiC,uBACzD,kBAAmB3G,IAA4B,kBAC/C,mBAAoBb,IAA6B,mBACjD,oBAAqB5C,IAA8B,oBACnD,kBAAmBmM,IAA4B,kBAC/C,qBAAsBoE,IAA+B,qBACrD,kBAAmB7V,IAA4B,kBAC/C,iBAAkBtE,IAAc,gBAClC,EACAka,GAAA,uBAAiCE,cCnCjC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAIrW,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhB+3I,IAA2B,CAC7B,sBAAuBtW,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,mBAAoB5N,IAAc,kBACpC,EACAqa,GAAA,yBAAmCC,cCjBnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIrW,IAAyC7lI,GACzC2mI,IAA0ChkI,GAC1CmkI,IAA+B5iI,GAC/B+hI,IAA8Bt/H,GAC9Bg7H,IAAgBjmH,EAMhBygI,IAAmB,CACrB,wBAAyBtW,IAAuC,wBAChE,yBAA0Bc,IAAwC,yBAClE,mBAAoBG,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACAua,GAAA,iBAA2BC,cCrB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAItV,IAA+B9mI,GAC/BorI,IAA+BzoI,GAC/B0rI,IAAiCnqI,GACjC+hI,IAA8Bt/H,GAC9Bg7H,IAAgBjmH,EAMhB2gI,IAAmB,CACrB,mBAAoBvV,IAA6B,mBACjD,mBAAoBsE,IAA6B,mBACjD,qBAAsBiD,IAA+B,qBACrD,kBAAmBpI,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACAya,GAAA,iBAA2BC,cCrB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgCA,GAAA,0BAAG,OACpC,IAAIpR,IAAkClrI,GAClC8mI,IAA+BnkI,GAC/ByoI,IAA+BlnI,GAC/BmqI,IAAiC1nI,GACjCs/H,IAA8BvqH,GAC9BimH,IAAgBz8G,EAMhBq3H,IAA4B,CAC9B,sBAAuBrR,IAAgC,sBACvD,mBAAoBpE,IAA6B,mBACjD,mBAAoBsE,IAA6B,mBACjD,qBAAsBiD,IAA+B,qBACrD,kBAAmBpI,IAA4B,kBAC/C,oBAAqBtE,IAAc,mBACrC,EACA2a,GAAA,0BAAoCC,oBCvBpC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAI5W,IAAqC5lI,GACrCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBu4I,IAAmB,CACrB,oBAAqB7W,IAAmC,oBACxD,kBAAmBK,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACA6a,GAAA,iBAA2BC,ICjB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAIlO,IAA4BxuI,GAC5BwoI,IAAkC7lI,GAClCurI,IAAqChqI,GACrCopI,IAAuC3mI,GACvCg2I,IAA6BjhI,GAC7B2yH,IAAiCnpH,GACjC+gH,IAA8BpuG,GAC9Bk2G,IAAmCj2G,GACnC6pG,IAAgB5pG,EAMhB6kH,IAAuB,CACzB,gBAAiBpO,IAA0B,gBAC3C,sBAAuBhG,IAAgC,sBACvD,yBAA0B0F,IAAmC,yBAC7D,2BAA4BZ,IAAqC,2BACjE,iBAAkBqP,IAA2B,iBAC7C,qBAAsBtO,IAA+B,qBACrD,kBAAmBpI,IAA4B,kBAC/C,uBAAwB8H,IAAiC,uBACzD,eAAgBpM,IAAc,cAChC,EACA+a,GAAA,qBAA+BE,cC7B/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIhX,IAAyC7lI,GACzCyoI,IAA+B9lI,GAC/BurI,IAAqChqI,GACrCsiI,IAAoC7/H,GACpCmgI,IAA+BprH,GAC/BuqH,IAA8B/gH,GAC9By8G,IAAgB9pG,EAMhBilH,IAAwB,CAC1B,wBAAyBjX,IAAuC,wBAChE,mBAAoB4C,IAA6B,mBACjD,yBAA0ByF,IAAmC,yBAC7D,wBAAyB1H,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,gBAAiBtE,IAAc,eACjC,EACAkb,GAAA,sBAAgCC,cCzBhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC8BA,GAAA,wBAAG,OAClC,IAAItU,IAA+BzoI,GAC/BwmI,IAAoC7jI,GACpCmkI,IAA+B5iI,GAC/BopI,IAAuC3mI,GACvCs/H,IAA8BvqH,GAC9BimH,IAAgBz8G,EAMhB83H,IAA0B,CAC5B,mBAAoBvU,IAA6B,mBACjD,wBAAyBjC,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,2BAA4BwG,IAAqC,2BACjE,kBAAmBrH,IAA4B,kBAC/C,kBAAmBtE,IAAc,iBACnC,EACAob,GAAA,wBAAkCC,cCvBlC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIpX,IAAyC7lI,GACzCyoI,IAA+B9lI,GAC/B6jI,IAAoCtiI,GACpC4iI,IAA+BngI,GAC/ByoI,IAA4B1zH,GAC5BuqH,IAA8B/gH,GAC9By8G,IAAgB9pG,EAMhBqlH,IAAqB,CACvB,wBAAyBrX,IAAuC,wBAChE,mBAAoB4C,IAA6B,mBACjD,wBAAyBjC,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,gBAAiBsI,IAA0B,gBAC3C,kBAAmBnJ,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACAsb,GAAA,mBAA6BC,cCzB7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAIxX,IAAuC3lI,GACvC2hI,IAAgBh/H,EAMhBy6I,IAAgB,CAClB,sBAAuBzX,IAAqC,sBAC5D,QAAShE,IAAc,OACzB,EACAwb,GAAA,cAAwBC,cCfxB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAI1X,IAAuC3lI,GACvC2hI,IAAgBh/H,EAMhB26I,IAA2B,CAC7B,sBAAuB3X,IAAqC,sBAC5D,mBAAoBhE,IAAc,kBACpC,EACA0b,GAAA,yBAAmCC,oBCfnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAIzW,IAA+B9mI,GAC/BimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBs5I,IAAsB,CACxB,mBAAoB1W,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,cAAetE,IAAc,aAC/B,EACA4b,GAAA,oBAA8BC,cCjB9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAIxX,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhB+6I,IAAiB,CACnB,kBAAmBzX,IAA4B,kBAC/C,SAAUtE,IAAc,QAC1B,EACA8b,GAAA,eAAyBC,cCfzB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoCA,GAAA,8BAAG,OACxC,IAAIC,IAAgC59I,GAChC8mI,IAA+BnkI,GAC/B4qI,IAA6BrpI,GAC7B+hI,IAA8Bt/H,GAC9Bg7H,IAAgBjmH,EAMhBmiI,IAAgC,CAClC,oBAAqBD,IAA8B,oBACnD,mBAAoB9W,IAA6B,mBACjD,iBAAkByG,IAA2B,iBAC7C,kBAAmBtH,IAA4B,kBAC/C,wBAAyBtE,IAAc,uBACzC,EACAgc,GAAA,8BAAwCE,oBCrBxC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAInY,IAAuC3lI,GACvC8lI,IAAsCnjI,GACtCo7I,IAAgC75I,GAChC+hI,IAA8Bt/H,GAC9Bg7H,IAAgBjmH,EAMhBsiI,IAAmB,CACrB,sBAAuBrY,IAAqC,sBAC5D,qBAAsBG,IAAoC,qBAC1D,oBAAqBiY,IAA8B,oBACnD,kBAAmB9X,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACAmc,GAAA,iBAA2BE,ICrB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAIzV,IAAkCxoI,GAClC+9I,IAAgCp7I,GAChC0qI,IAA6BnpI,GAC7BgqI,IAAqCvnI,GACrCqoI,IAA8BtzH,GAC9BgzH,IAAiCxpH,GACjCipH,IAA+Bt2G,GAC/BivG,IAA+BhvG,GAC/Bw1G,IAAuCv1G,GACvCmmH,IAA6BlmH,GAC7B2kH,IAA6BpuF,GAC7B8/E,IAAiC7mE,GACjCy+D,IAA8Bv+D,GAC9BqmE,IAAmC5jE,GACnC8+D,IAA8B/4D,GAC9ByxD,IAAgBxxD,EAMhBguE,IAAiB,CACnB,sBAAuB3V,IAAgC,sBACvD,oBAAqBuV,IAA8B,oBACnD,iBAAkB1Q,IAA2B,iBAC7C,yBAA0Ba,IAAmC,yBAC7D,kBAAmBc,IAA4B,kBAC/C,qBAAsBN,IAA+B,qBACrD,mBAAoBP,IAA6B,mBACjD,mBAAoBrH,IAA6B,mBACjD,2BAA4BwG,IAAqC,2BACjE,iBAAkB4Q,IAA2B,iBAC7C,iBAAkBvB,IAA2B,iBAC7C,qBAAsBtO,IAA+B,qBACrD,kBAAmBpI,IAA4B,kBAC/C,uBAAwB8H,IAAiC,uBACzD,kBAAmB9E,IAA4B,kBAC/C,SAAUtH,IAAc,QAC1B,EACAsc,GAAA,eAAyBE,cC3CzB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAInY,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhB07I,IAAiB,CACnB,kBAAmBpY,IAA4B,kBAC/C,SAAUtE,IAAc,QAC1B,EACAyc,GAAA,eAAyBC,cCfzB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIrY,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhB47I,IAAkB,CACpB,kBAAmBtY,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACA2c,GAAA,gBAA0BC,cCf1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAI3Y,IAAyC7lI,GACzCkuI,IAAqCvrI,GACrC6jI,IAAoCtiI,GACpC4iI,IAA+BngI,GAC/B2mI,IAAuC5xH,GACvC2yH,IAAiCnpH,GACjC+gH,IAA8BpuG,GAC9B8pG,IAAgB7pG,EAMhB2mH,IAAqB,CACvB,wBAAyB5Y,IAAuC,wBAChE,yBAA0BqI,IAAmC,yBAC7D,wBAAyB1H,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,2BAA4BwG,IAAqC,2BACjE,qBAAsBe,IAA+B,qBACrD,kBAAmBpI,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACA6c,GAAA,mBAA6BC,cC3B7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAI7Y,IAAyC7lI,GACzCkuI,IAAqCvrI,GACrC6jI,IAAoCtiI,GACpC4iI,IAA+BngI,GAC/B2mI,IAAuC5xH,GACvC2yH,IAAiCnpH,GACjC+gH,IAA8BpuG,GAC9B8pG,IAAgB7pG,EAMhB6mH,IAAwB,CAC1B,wBAAyB9Y,IAAuC,wBAChE,yBAA0BqI,IAAmC,yBAC7D,wBAAyB1H,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,2BAA4BwG,IAAqC,2BACjE,qBAAsBe,IAA+B,qBACrD,kBAAmBpI,IAA4B,kBAC/C,gBAAiBtE,IAAc,eACjC,EACA+c,GAAA,sBAAgCC,IC3BhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIpQ,IAA4BxuI,GAC5Bw6I,IAA4B73I,GAC5B6lI,IAAkCtkI,GAClC26I,IAA6Bl4I,GAC7BukI,IAAkCxvH,GAClCojI,IAA+B55H,GAC/B64H,IAAgClmH,GAChCknH,IAA4BjnH,GAC5BknH,IAA6BjnH,GAC7Bm2G,IAAqCl2G,GACrC01G,IAA4Bn/E,GAC5BygF,IAA8BxnE,GAC9Bo2E,IAAgCl2E,GAChCu3E,IAA2B90E,GAC3B0kE,IAA4B3+D,GAC5BwgE,IAA+BvgE,GAC/B22D,IAA+B12D,GAC/B8uE,IAA0CjqD,GAC1Cm5C,IAAiCj5C,GACjCm4C,IAAuCl4C,GACvCg2C,IAA+B91C,GAC/B6pD,IAA2B5pD,GAC3B6pD,IAA2B5pD,GAC3B6pD,IAA4B3pD,GAC5B49C,IAAgC39C,GAChCgnD,IAA6B9mD,GAC7Bw4C,IAAiCt4C,GACjCkwC,IAA8BjwC,GAC9BspD,IAA+BrpD,GAC/BspD,IAAkCrpD,GAClCyrC,IAAgBxrC,EAMhBqpD,IAAmB,CACrB,gBAAiBhR,IAA0B,gBAC3C,gBAAiBgM,IAA0B,gBAC3C,sBAAuBhS,IAAgC,sBACvD,iBAAkBqW,IAA2B,iBAC7C,sBAAuB3T,IAAgC,sBACvD,mBAAoB4T,IAA6B,mBACjD,oBAAqBf,IAA8B,oBACnD,gBAAiBgB,IAA0B,gBAC3C,iBAAkBC,IAA2B,iBAC7C,yBAA0B9Q,IAAmC,yBAC7D,gBAAiBR,IAA0B,gBAC3C,kBAAmBsB,IAA4B,kBAC/C,oBAAqB4O,IAA8B,oBACnD,eAAgBqB,IAAyB,eACzC,gBAAiBpQ,IAA0B,gBAC3C,mBAAoB6B,IAA6B,mBACjD,mBAAoB5J,IAA6B,mBACjD,8BAA+BoY,IAAwC,8BACvE,qBAAsB9Q,IAA+B,qBACrD,2BAA4Bd,IAAqC,2BACjE,mBAAoBlC,IAA6B,mBACjD,eAAgB+T,IAAyB,eACzC,eAAgBC,IAAyB,eACzC,gBAAiBC,IAA0B,gBAC3C,oBAAqB/L,IAA8B,oBACnD,iBAAkBqJ,IAA2B,iBAC7C,qBAAsBtO,IAA+B,qBACrD,kBAAmBpI,IAA4B,kBAC/C,mBAAoBqZ,IAA6B,mBACjD,sBAAuBC,IAAgC,sBACvD,WAAY5d,IAAc,UAC5B,EACAid,GAAA,iBAA2BY,cCzE3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmCA,GAAA,6BAAG,OACvC,IAAI9Z,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBw7I,IAA+B,CACjC,sBAAuB/Z,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,uBAAwB5N,IAAc,sBACxC,EACA8d,GAAA,6BAAuCC,cCjBvC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAIha,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhB07I,IAA2B,CAC7B,sBAAuBja,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,mBAAoB5N,IAAc,kBACpC,EACAge,GAAA,yBAAmCC,cCjBnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmCA,GAAA,6BAAG,OACvC,IAAIla,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhB47I,IAA+B,CACjC,sBAAuBna,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,uBAAwB5N,IAAc,sBACxC,EACAke,GAAA,6BAAuCC,cCjBvC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIC,IAAoChgJ,GACpCmuI,IAA+BxrI,GAC/BsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhBs5I,IAAwB,CAC1B,wBAAyBD,IAAkC,wBAC3D,mBAAoB7R,IAA6B,mBACjD,kBAAmBlI,IAA4B,kBAC/C,gBAAiBtE,IAAc,eACjC,EACAoe,GAAA,sBAAgCE,cCnBhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIja,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBw9I,IAAkB,CACpB,kBAAmBla,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACAue,GAAA,gBAA0BC,cCf1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAI1I,IAA8B13I,GAC9BimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBm8I,IAAuB,CACzB,kBAAmB3I,IAA4B,kBAC/C,kBAAmBzR,IAA4B,kBAC/C,eAAgBtE,IAAc,cAChC,EACAye,GAAA,qBAA+BC,cCjB/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIra,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhB49I,IAAkB,CACpB,kBAAmBta,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACA2e,GAAA,gBAA0BC,cCf1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIhS,IAA4BxuI,GAC5Bw6I,IAA4B73I,GAC5B+rI,IAAiCxqI,GACjC2qI,IAA4BloI,GAC5BynI,IAAiC1yH,GACjCuqH,IAA8B/gH,GAC9By8G,IAAgB9pG,EAMhB4oH,IAAmB,CACrB,gBAAiBjS,IAA0B,gBAC3C,gBAAiBgM,IAA0B,gBAC3C,qBAAsB9L,IAA+B,qBACrD,gBAAiBG,IAA0B,gBAC3C,qBAAsBT,IAA+B,qBACrD,kBAAmBnI,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACA6e,GAAA,iBAA2BC,cCzB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAI9a,IAAqC5lI,GACrCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBy8I,IAAoB,CACtB,oBAAqB/a,IAAmC,oBACxD,kBAAmBK,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACA+e,GAAA,kBAA4BC,cCjB5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIjf,IAAgB3hI,EAMhB6gJ,IAAoB,CACtB,YAAalf,IAAc,WAC7B,EACAif,GAAA,kBAA4BC,cCb5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAInb,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhB68I,IAAsB,CACxB,sBAAuBpb,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,cAAe5N,IAAc,aAC/B,EACAmf,GAAA,oBAA8BC,cCjB9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgCA,GAAA,0BAAG,OACpC,IAAIrb,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhB+8I,IAA4B,CAC9B,sBAAuBtb,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,oBAAqB5N,IAAc,mBACrC,EACAqf,GAAA,0BAAoCC,oBCjBpC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAItb,IAAqC5lI,GACrC2hI,IAAgBh/H,EAMhBw+I,IAAgB,CAClB,oBAAqBvb,IAAmC,oBACxD,QAASjE,IAAc,OACzB,EACAuf,GAAA,cAAwBC,cCfxB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIxb,IAAqC5lI,GACrCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBm9I,IAAmB,CACrB,oBAAqBzb,IAAmC,oBACxD,kBAAmBK,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACAyf,GAAA,iBAA2BC,cCjB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAI3b,IAAuC3lI,GACvC2hI,IAAgBh/H,EAMhB4+I,IAAkB,CACpB,sBAAuB5b,IAAqC,sBAC5D,UAAWhE,IAAc,SAC3B,EACA2f,GAAA,gBAA0BC,ICf1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIhZ,IAAkCxoI,GAClCmsI,IAA6BxpI,GAC7B0qI,IAA6BnpI,GAC7BgqI,IAAqCvnI,GACrC86I,IAAkC/lI,GAClCgmI,IAA4Bx8H,GAC5By8H,IAA0B9pH,GAC1B+pH,IAA6B9pH,GAC7BgvG,IAA+B/uG,GAC/Bu1G,IAAuCt1G,GACvCo3G,IAA4B7gF,GAC5BszF,IAA4Br6E,GAC5By+D,IAA8Bv+D,GAC9Bi6D,IAAgBx3D,EAMhB23E,IAAkB,CACpB,sBAAuBtZ,IAAgC,sBACvD,iBAAkB2D,IAA2B,iBAC7C,iBAAkBkB,IAA2B,iBAC7C,yBAA0Ba,IAAmC,yBAC7D,sBAAuBuT,IAAgC,sBACvD,gBAAiBC,IAA0B,gBAC3C,cAAeC,IAAwB,cACvC,iBAAkBC,IAA2B,iBAC7C,mBAAoB9a,IAA6B,mBACjD,2BAA4BwG,IAAqC,2BACjE,gBAAiB8B,IAA0B,gBAC3C,gBAAiByS,IAA0B,gBAC3C,kBAAmB5b,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACA6f,GAAA,gBAA0BM,cCvC1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgCA,GAAA,0BAAG,OACpC,IAAIrR,IAA+B1wI,GAC/BszI,IAAgC3wI,GAChCg/H,IAAgBz9H,EAMhB89I,IAA4B,CAC9B,mBAAoBtR,IAA6B,mBACjD,oBAAqB4C,IAA8B,oBACnD,yBAA0B3R,IAAc,wBAC1C,EACAogB,GAAA,0BAAoCC,cCjBpC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIhc,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBu/I,IAAqB,CACvB,kBAAmBjc,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACAsgB,GAAA,mBAA6BC,cCf7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkCA,GAAA,4BAAG,OACtC,IAAIlc,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBy/I,IAA8B,CAChC,kBAAmBnc,IAA4B,kBAC/C,sBAAuBtE,IAAc,qBACvC,EACAwgB,GAAA,4BAAsCC,cCftC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgCA,GAAA,0BAAG,OACpC,IAAI1c,IAAuC3lI,GACvC2hI,IAAgBh/H,EAMhB2/I,IAA4B,CAC9B,sBAAuB3c,IAAqC,sBAC5D,oBAAqBhE,IAAc,mBACrC,EACA0gB,GAAA,0BAAoCC,cCfpC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiCA,GAAA,2BAAG,OACrC,IAAI5c,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBs+I,IAA6B,CAC/B,sBAAuB7c,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,qBAAsB5N,IAAc,oBACtC,EACA4gB,GAAA,2BAAqCC,cCjBrC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAIxc,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhB+/I,IAAsB,CACxB,kBAAmBzc,IAA4B,kBAC/C,cAAetE,IAAc,aAC/B,EACA8gB,GAAA,oBAA8BC,cCf9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmCA,GAAA,6BAAG,OACvC,IAAI1c,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBigJ,IAA+B,CACjC,kBAAmB3c,IAA4B,kBAC/C,uBAAwBtE,IAAc,sBACxC,EACAghB,GAAA,6BAAuCC,cCfvC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC8BA,GAAA,wBAAG,OAClC,IAAIld,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhB4+I,IAA0B,CAC5B,sBAAuBnd,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,kBAAmB5N,IAAc,iBACnC,EACAkhB,GAAA,wBAAkCC,cCjBlC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIpd,IAAuC3lI,GACvC6lI,IAAyCljI,GACzC8lI,IAA+BvkI,GAC/BsiI,IAAoC7/H,GACpCmgI,IAA+BprH,GAC/BuqH,IAA8B/gH,GAC9By8G,IAAgB9pG,EAMhBmrH,IAAkB,CACpB,sBAAuBrd,IAAqC,sBAC5D,wBAAyBE,IAAuC,wBAChE,mBAAoB4C,IAA6B,mBACjD,wBAAyBjC,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACAohB,GAAA,gBAA0BC,cCzB1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoCA,GAAA,8BAAG,OACxC,IAAIhd,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBugJ,IAAgC,CAClC,kBAAmBjd,IAA4B,kBAC/C,wBAAyBtE,IAAc,uBACzC,EACAshB,GAAA,8BAAwCC,cCfxC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsCA,GAAA,gCAAG,OAC1C,IAAIxd,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBk/I,IAAkC,CACpC,sBAAuBzd,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,0BAA2B5N,IAAc,yBAC3C,EACAwhB,GAAA,gCAA0CC,cCjB1C,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAI1d,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBo/I,IAAsB,CACxB,sBAAuB3d,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,cAAe5N,IAAc,aAC/B,EACA0hB,GAAA,oBAA8BC,cCjB9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgCA,GAAA,0BAAG,OACpC,IAAI5d,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBs/I,IAA4B,CAC9B,sBAAuB7d,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,oBAAqB5N,IAAc,mBACrC,EACA4hB,GAAA,0BAAoCC,cCjBpC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkCA,GAAA,4BAAG,OACtC,IAAItU,IAAkCnvI,GAClCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBw/I,IAA8B,CAChC,sBAAuBvU,IAAgC,sBACvD,kBAAmBlJ,IAA4B,kBAC/C,sBAAuBtE,IAAc,qBACvC,EACA8hB,GAAA,4BAAsCC,oBCjBtC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIjM,IAA8B13I,GAC9B2hI,IAAgBh/H,EAMhBihJ,IAAmB,CACrB,kBAAmBlM,IAA4B,kBAC/C,gBAAiB/V,IAAc,eACjC,EACAgiB,GAAA,iBAA2BC,ICf3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIC,IAAkC9jJ,GAClCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhB6/I,IAAmB,CACrB,iBAAkBD,IAAgC,iBAClD,kBAAmB7d,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACAkiB,GAAA,iBAA2BE,cCjB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAI9U,IAA+BlvI,GAC/BimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhB+/I,IAAkB,CACpB,mBAAoB/U,IAA6B,mBACjD,kBAAmBjJ,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACAqiB,GAAA,gBAA0BC,cCjB1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAI1V,IAA4BxuI,GAC5BwoI,IAAkC7lI,GAClCurI,IAAqChqI,GACrC+zI,IAAmCtxI,GACnC2mI,IAAuC5xH,GACvC43H,IAAgCpuH,GAChCy3H,IAA6B9kH,GAC7BouG,IAA8BnuG,GAC9B6pG,IAAgB5pG,EAMhBosH,IAAoB,CACtB,gBAAiB3V,IAA0B,gBAC3C,sBAAuBhG,IAAgC,sBACvD,yBAA0B0F,IAAmC,yBAC7D,uBAAwB+J,IAAiC,uBACzD,2BAA4B3K,IAAqC,2BACjE,oBAAqBgG,IAA8B,oBACnD,iBAAkBqJ,IAA2B,iBAC7C,kBAAmB1W,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACAuiB,GAAA,kBAA4BC,cC7B5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAI/W,IAA6BrtI,GAC7ByhJ,IAAkC9+I,GAClC0hJ,IAA4BngJ,GAC5B+hI,IAA8Bt/H,GAC9Bg7H,IAAgBjmH,EAMhB4oI,IAAmB,CACrB,iBAAkBjX,IAA2B,iBAC7C,sBAAuBoU,IAAgC,sBACvD,gBAAiB4C,IAA0B,gBAC3C,kBAAmBpe,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACAyiB,GAAA,iBAA2BE,cCrB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAInQ,IAAmCp0I,GACnCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBsgJ,IAAoB,CACtB,kBAAmBpQ,IAAiC,kBACpD,kBAAmBnO,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACA4iB,GAAA,kBAA4BC,cCjB5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiCA,GAAA,2BAAG,OACrC,IAAIrQ,IAAmCp0I,GACnC2hI,IAAgBh/H,EAMhB+hJ,IAA6B,CAC/B,kBAAmBtQ,IAAiC,kBACpD,qBAAsBzS,IAAc,oBACtC,EACA8iB,GAAA,2BAAqCC,cCfrC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAIhf,IAAuC3lI,GACvC2hI,IAAgBh/H,EAMhBiiJ,IAAuB,CACzB,sBAAuBjf,IAAqC,sBAC5D,eAAgBhE,IAAc,cAChC,EACAgjB,GAAA,qBAA+BC,cCf/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIrW,IAA4BxuI,GAC5Bw6I,IAA4B73I,GAC5B6lI,IAAkCtkI,GAClCgqI,IAAqCvnI,GACrC6/H,IAAoC9qH,GACpCkiI,IAAgC14H,GAChCiqH,IAAkCt3G,GAClCs2G,IAA+Br2G,GAC/BgvG,IAA+B/uG,GAC/Bq2G,IAAiCp2G,GACjCs1G,IAAuC/+E,GACvC+kF,IAAgC9rE,GAChC6mE,IAAiC3mE,GACjCu+D,IAA8B97D,GAC9Bw3D,IAAgBzxD,EAMhB40E,IAAwB,CAC1B,gBAAiBtW,IAA0B,gBAC3C,gBAAiBgM,IAA0B,gBAC3C,sBAAuBhS,IAAgC,sBACvD,yBAA0B0F,IAAmC,yBAC7D,wBAAyB1H,IAAkC,wBAC3D,oBAAqBoX,IAA8B,oBACnD,sBAAuBzO,IAAgC,sBACvD,mBAAoBhB,IAA6B,mBACjD,mBAAoBrH,IAA6B,mBACjD,qBAAsBsH,IAA+B,qBACrD,2BAA4Bd,IAAqC,2BACjE,oBAAqBgG,IAA8B,oBACnD,qBAAsBjF,IAA+B,qBACrD,kBAAmBpI,IAA4B,kBAC/C,gBAAiBtE,IAAc,eACjC,EACAkjB,GAAA,sBAAgCC,cCzChC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4CA,GAAA,sCAAG,OAChD,IAAIpf,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhB8gJ,IAAwC,CAC1C,sBAAuBrf,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,gCAAiC5N,IAAc,+BACjD,EACAojB,GAAA,sCAAgDC,oBCjBhD,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIpf,IAAyC7lI,GACzCyoI,IAA+B9lI,GAC/B6jI,IAAoCtiI,GACpC4iI,IAA+BngI,GAC/Bs/H,IAA8BvqH,GAC9BimH,IAAgBz8G,EAMhBggI,IAAkB,CACpB,wBAAyBrf,IAAuC,wBAChE,mBAAoB4C,IAA6B,mBACjD,wBAAyBjC,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACAsjB,GAAA,gBAA0BC,cCvB1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIxf,IAAuC3lI,GACvC8mI,IAA+BnkI,GAC/BsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhBy+I,IAAmB,CACrB,sBAAuBzf,IAAqC,sBAC5D,mBAAoBmB,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACAwjB,GAAA,iBAA2BC,ICnB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAI1f,IAAuC3lI,GACvCw6I,IAA4B73I,GAC5BqsI,IAA8B9qI,GAC9BmkI,IAAkC1hI,GAClC2+I,IAA4B5pI,GAC5B43H,IAAgCpuH,GAChC+gH,IAA8BpuG,GAC9B0tH,IAA6BztH,GAC7B6pG,IAAgB5pG,EAMhBytH,IAAqB,CACvB,sBAAuB7f,IAAqC,sBAC5D,gBAAiB6U,IAA0B,gBAC3C,kBAAmBxL,IAA4B,kBAC/C,sBAAuB3G,IAAgC,sBACvD,gBAAiBid,IAA0B,gBAC3C,oBAAqBhS,IAA8B,oBACnD,kBAAmBrN,IAA4B,kBAC/C,iBAAkBsf,IAA2B,iBAC7C,aAAc5jB,IAAc,YAC9B,EACA0jB,GAAA,mBAA6BG,cC7B7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIxf,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhB+iJ,IAAoB,CACtB,kBAAmBzf,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACA8jB,GAAA,kBAA4BC,cCf5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAI1f,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBijJ,IAAsB,CACxB,kBAAmB3f,IAA4B,kBAC/C,cAAetE,IAAc,aAC/B,EACAgkB,GAAA,oBAA8BC,oBCf9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIjgB,IAAqC5lI,GACrCkuI,IAAqCvrI,GACrCsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhBm/I,IAAkB,CACpB,oBAAqBlgB,IAAmC,oBACxD,yBAA0BsI,IAAmC,yBAC7D,kBAAmBjI,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACAkkB,GAAA,gBAA0BC,cCnB1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAI9f,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBqjJ,IAAkB,CACpB,kBAAmB/f,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACAokB,GAAA,gBAA0BC,cCf1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIzL,IAA4Bx6I,GAC5BurI,IAAgC5oI,GAChCsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhBu/I,IAAkB,CACpB,gBAAiB1L,IAA0B,gBAC3C,oBAAqBjP,IAA8B,oBACnD,kBAAmBtF,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACAskB,GAAA,gBAA0BC,ICnB1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAI7K,IAA+Bt7I,GAC/ByhJ,IAAkC9+I,GAClCwsI,IAAkCjrI,GAClCkiJ,IAA4Bz/I,GAC5B0/I,IAA4B3qI,GAC5BorH,IAA+B5hH,GAC/BkpH,IAAiCv2G,GACjCyuH,IAA4BxuH,GAC5BmuG,IAA8BluG,GAC9B4pG,IAAgB3pG,EAMhBuuH,IAA2B,CAC7B,mBAAoBjL,IAA6B,mBACjD,sBAAuBmG,IAAgC,sBACvD,sBAAuBtS,IAAgC,sBACvD,gBAAiBiX,IAA0B,gBAC3C,gBAAiBC,IAA0B,gBAC3C,mBAAoBvf,IAA6B,mBACjD,qBAAsBsH,IAA+B,qBACrD,gBAAiBkY,IAA0B,gBAC3C,kBAAmBrgB,IAA4B,kBAC/C,mBAAoBtE,IAAc,kBACpC,EACAwkB,GAAA,yBAAmCI,cC/BnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAI7gB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBuiJ,IAAuB,CACzB,sBAAuB9gB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,eAAgB5N,IAAc,cAChC,EACA6kB,GAAA,qBAA+BC,cCjB/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAI5f,IAA+B9mI,GAC/BstI,IAAuC3qI,GACvCsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhBggJ,IAAmB,CACrB,mBAAoB7f,IAA6B,mBACjD,2BAA4BwG,IAAqC,2BACjE,kBAAmBrH,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACA+kB,GAAA,iBAA2BC,cCnB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIjhB,IAAuC3lI,GACvC2hI,IAAgBh/H,EAMhBkkJ,IAAmB,CACrB,sBAAuBlhB,IAAqC,sBAC5D,WAAYhE,IAAc,UAC5B,EACAilB,GAAA,iBAA2BC,cCf3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAInhB,IAAuC3lI,GACvC2hI,IAAgBh/H,EAMhBokJ,IAAkB,CACpB,sBAAuBphB,IAAqC,sBAC5D,UAAWhE,IAAc,SAC3B,EACAmlB,GAAA,gBAA0BC,cCf1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIrhB,IAAuC3lI,GACvC2hI,IAAgBh/H,EAMhBskJ,IAAqB,CACvB,sBAAuBthB,IAAqC,sBAC5D,aAAchE,IAAc,YAC9B,EACAqlB,GAAA,mBAA6BC,cCf7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIvhB,IAAuC3lI,GACvC2hI,IAAgBh/H,EAMhBwkJ,IAAoB,CACtB,sBAAuBxhB,IAAqC,sBAC5D,YAAahE,IAAc,WAC7B,EACAulB,GAAA,kBAA4BC,cCf5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAI3e,IAA+BzoI,GAC/BwmI,IAAoC7jI,GACpCmkI,IAA+B5iI,GAC/B+hI,IAA8Bt/H,GAC9Bg7H,IAAgBjmH,EAMhB2rI,IAAkB,CACpB,mBAAoB5e,IAA6B,mBACjD,wBAAyBjC,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACAylB,GAAA,gBAA0BC,cCrB1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAI5P,IAA8B13I,GAC9BimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBqjJ,IAAwB,CAC1B,kBAAmB7P,IAA4B,kBAC/C,kBAAmBzR,IAA4B,kBAC/C,gBAAiBtE,IAAc,eACjC,EACA2lB,GAAA,sBAAgCC,cCjBhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAI3hB,IAAyC7lI,GACzCyoI,IAA+B9lI,GAC/B6jI,IAAoCtiI,GACpC4iI,IAA+BngI,GAC/Bs/H,IAA8BvqH,GAC9ButH,IAA8B/jH,GAC9By8G,IAAgB9pG,EAMhB4vH,IAAwB,CAC1B,wBAAyB5hB,IAAuC,wBAChE,mBAAoB4C,IAA6B,mBACjD,wBAAyBjC,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,kBAAmBgD,IAA4B,kBAC/C,gBAAiBtH,IAAc,eACjC,EACA6lB,GAAA,sBAAgCC,cCzBhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAI9hB,IAAqC5lI,GACrCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhByjJ,IAAqB,CACvB,oBAAqB/hB,IAAmC,oBACxD,kBAAmBK,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACA+lB,GAAA,mBAA6BC,cCjB7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIhiB,IAAqC5lI,GACrCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhB2jJ,IAAoB,CACtB,oBAAqBjiB,IAAmC,oBACxD,kBAAmBK,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACAimB,GAAA,kBAA4BC,cCjB5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIliB,IAAqC5lI,GACrCkuI,IAAqCvrI,GACrCyjJ,IAA4BliJ,GAC5B+hI,IAA8Bt/H,GAC9Bg7H,IAAgBjmH,EAMhBqsI,IAAoB,CACtB,oBAAqBniB,IAAmC,oBACxD,yBAA0BsI,IAAmC,yBAC7D,gBAAiBkY,IAA0B,gBAC3C,kBAAmBngB,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACAmmB,GAAA,kBAA4BC,cCrB5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIriB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhB+jJ,IAAwB,CAC1B,sBAAuBtiB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,gBAAiB5N,IAAc,eACjC,EACAqmB,GAAA,sBAAgCC,cCjBhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIriB,IAAyC7lI,GACzCkuI,IAAqCvrI,GACrC6jI,IAAoCtiI,GACpC4iI,IAA+BngI,GAC/B2mI,IAAuC5xH,GACvC2yH,IAAiCnpH,GACjC+gH,IAA8BpuG,GAC9B8pG,IAAgB7pG,EAMhBqwH,IAAqB,CACvB,wBAAyBtiB,IAAuC,wBAChE,yBAA0BqI,IAAmC,yBAC7D,wBAAyB1H,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,2BAA4BwG,IAAqC,2BACjE,qBAAsBe,IAA+B,qBACrD,kBAAmBpI,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACAumB,GAAA,mBAA6BC,cC3B7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIviB,IAAyC7lI,GACzCkuI,IAAqCvrI,GACrC6jI,IAAoCtiI,GACpC4iI,IAA+BngI,GAC/B2mI,IAAuC5xH,GACvC2yH,IAAiCnpH,GACjC+gH,IAA8BpuG,GAC9B8pG,IAAgB7pG,EAMhBuwH,IAAwB,CAC1B,wBAAyBxiB,IAAuC,wBAChE,yBAA0BqI,IAAmC,yBAC7D,wBAAyB1H,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,2BAA4BwG,IAAqC,2BACjE,qBAAsBe,IAA+B,qBACrD,kBAAmBpI,IAA4B,kBAC/C,gBAAiBtE,IAAc,eACjC,EACAymB,GAAA,sBAAgCC,oBC3BhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIC,IAA2CvoJ,GAC3CwoI,IAAkC7lI,GAClC6jI,IAAoCtiI,GACpCy9H,IAAgBh7H,EAMhB6hJ,IAAkB,CACpB,0BAA2BD,IAAyC,0BACpE,sBAAuB/f,IAAgC,sBACvD,wBAAyBhC,IAAkC,wBAC3D,eAAgB7E,IAAc,cAChC,EACA2mB,GAAA,gBAA0BE,ICnB1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAI5iB,IAAyC7lI,GACzC0oJ,IAAiC/lJ,GACjCgkI,IAA0CziI,GAC1CsqI,IAA4B7nI,GAC5B6hI,IAAkC9sH,GAClCwyH,IAAqChpH,GACrCshH,IAAoC3uG,GACpC64G,IAA+B54G,GAC/BgvG,IAA+B/uG,GAC/Bu1G,IAAuCt1G,GACvCq2G,IAAiC9/E,GACjC03E,IAA8Bz+D,GAC9BumE,IAAmCrmE,GACnCi6D,IAAgBx3D,EAMhBw+E,IAAkB,CACpB,wBAAyB9iB,IAAuC,wBAChE,gBAAiB6iB,IAA+B,gBAChD,yBAA0B/hB,IAAwC,yBAClE,gBAAiB6H,IAA0B,gBAC3C,sBAAuBhG,IAAgC,sBACvD,yBAA0B0F,IAAmC,yBAC7D,wBAAyB1H,IAAkC,wBAC3D,mBAAoBkK,IAA6B,mBACjD,mBAAoB5J,IAA6B,mBACjD,2BAA4BwG,IAAqC,2BACjE,qBAAsBe,IAA+B,qBACrD,kBAAmBpI,IAA4B,kBAC/C,uBAAwB8H,IAAiC,uBACzD,UAAWpM,IAAc,SAC3B,EACA8mB,GAAA,gBAA0BE,oBCvC1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIjiB,IAA0C3mI,GAC1CwuI,IAA4B7rI,GAC5B63I,IAA4Bt2I,GAC5BgqI,IAAqCvnI,GACrC+pI,IAA+Bh1H,GAC/Bs4H,IAAiC9uH,GACjCkpH,IAAiCv2G,GACjCw2G,IAAiCv2G,GACjCmiH,IAAkCliH,GAClCkuG,IAA8BjuG,GAC9B2pG,IAAgBpzE,EAMhBs6F,IAAkB,CACpB,yBAA0BliB,IAAwC,yBAClE,gBAAiB6H,IAA0B,gBAC3C,gBAAiBgM,IAA0B,gBAC3C,yBAA0BtM,IAAmC,yBAC7D,mBAAoBwC,IAA6B,mBACjD,qBAAsBsD,IAA+B,qBACrD,qBAAsB5F,IAA+B,qBACrD,qBAAsBC,IAA+B,qBACrD,sBAAuB4L,IAAgC,sBACvD,kBAAmBhU,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACAinB,GAAA,gBAA0BC,ICjC1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAIjjB,IAAyC7lI,GACzC+oJ,IAA+BpmJ,GAC/BqmJ,IAA4B9kJ,GAC5B4iI,IAA+BngI,GAC/BsiJ,IAA4BvtI,GAC5BuqH,IAA8B/gH,GAC9Bo6H,IAA+BznH,GAC/B8pG,IAAgB7pG,EAMhBoxH,IAAsB,CACxB,wBAAyBrjB,IAAuC,wBAChE,mBAAoBkjB,IAA6B,mBACjD,gBAAiBC,IAA0B,gBAC3C,mBAAoBliB,IAA6B,mBACjD,gBAAiBmiB,IAA0B,gBAC3C,kBAAmBhjB,IAA4B,kBAC/C,mBAAoBqZ,IAA6B,mBACjD,cAAe3d,IAAc,aAC/B,EACAmnB,GAAA,oBAA8BI,gCC3B9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAI3a,IAA4BxuI,GAC5Bw6I,IAA4B73I,GAC5B0qI,IAA6BnpI,GAC7BklJ,IAAmCziJ,GACnC0iJ,IAA6B3tI,GAC7B8qH,IAAoCthH,GACpCwrH,IAA+B74G,GAC/BivG,IAA+BhvG,GAC/Bs2G,IAAiCr2G,GACjCq3G,IAA4Bp3G,GAC5Bs7G,IAAgC/kF,GAChCouF,IAA6Bn1E,GAC7By+D,IAA8Bv+D,GAC9Bi6D,IAAgBx3D,EAMhBm/E,IAAmB,CACrB,gBAAiB9a,IAA0B,gBAC3C,gBAAiBgM,IAA0B,gBAC3C,iBAAkBnN,IAA2B,iBAC7C,uBAAwB+b,IAAiC,uBACzD,iBAAkBC,IAA2B,iBAC7C,wBAAyB7iB,IAAkC,wBAC3D,mBAAoBkK,IAA6B,mBACjD,mBAAoB5J,IAA6B,mBACjD,qBAAsBsH,IAA+B,qBACrD,gBAAiBgB,IAA0B,gBAC3C,oBAAqBkE,IAA8B,oBACnD,iBAAkBqJ,IAA2B,iBAC7C,kBAAmB1W,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACAwnB,GAAA,iBAA2BG,ICvC3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAI7a,IAAiC1uI,GACjC8mI,IAA+BnkI,GAC/ByrI,IAAiClqI,GACjCslJ,IAA6B7iJ,GAC7Bw4I,IAA2BzjI,GAC3B2yH,IAAiCnpH,GACjC+gH,IAA8BpuG,GAC9B8pG,IAAgB7pG,EAMhB2xH,IAAoB,CACtB,qBAAsB/a,IAA+B,qBACrD,mBAAoB5H,IAA6B,mBACjD,qBAAsBsH,IAA+B,qBACrD,iBAAkBob,IAA2B,iBAC7C,eAAgBrK,IAAyB,eACzC,qBAAsB9Q,IAA+B,qBACrD,kBAAmBpI,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACA4nB,GAAA,kBAA4BE,IC3B5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIlb,IAA4BxuI,GAC5Bw6I,IAA4B73I,GAC5B8lI,IAA+BvkI,GAC/BwqI,IAAiC/nI,GACjCgjJ,IAA8BjuI,GAC9BkuI,IAAgC1kI,GAChC4hH,IAA+BjvG,GAC/BqnH,IAA0CpnH,GAC1Cs2G,IAAiCr2G,GACjCs8G,IAA8Br8G,GAC9B6xH,IAA8Bt7F,GAC9B24E,IAA+B1/D,GAC/B6mE,IAAiC3mE,GACjCuyE,IAAkC9vE,GAClC87D,IAA8B/1D,GAC9ByxD,IAAgBxxD,EAMhB25E,IAAwB,CAC1B,gBAAiBtb,IAA0B,gBAC3C,gBAAiBgM,IAA0B,gBAC3C,mBAAoB/R,IAA6B,mBACjD,qBAAsBiG,IAA+B,qBACrD,kBAAmBib,IAA4B,kBAC/C,oBAAqBC,IAA8B,oBACnD,mBAAoB9iB,IAA6B,mBACjD,8BAA+BoY,IAAwC,8BACvE,qBAAsB9Q,IAA+B,qBACrD,kBAAmBiG,IAA4B,kBAC/C,kBAAmBwV,IAA4B,kBAC/C,mBAAoB3iB,IAA6B,mBACjD,qBAAsBmH,IAA+B,qBACrD,sBAAuB4L,IAAgC,sBACvD,kBAAmBhU,IAA4B,kBAC/C,gBAAiBtE,IAAc,eACjC,EACA+nB,GAAA,sBAAgCI,IC3ChC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIjjB,IAA+B9mI,GAC/BouI,IAAiCzrI,GACjCqnJ,IAAkC9lJ,GAClC+1I,IAAkCtzI,GAClCs/H,IAA8BvqH,GAC9BimH,IAAgBz8G,EAMhB+kI,IAAmB,CACrB,mBAAoBnjB,IAA6B,mBACjD,qBAAsBsH,IAA+B,qBACrD,sBAAuB4b,IAAgC,sBACvD,sBAAuB/P,IAAgC,sBACvD,kBAAmBhU,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACAooB,GAAA,iBAA2BE,0BCvB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkCA,GAAA,4BAAG,OACtC,IAAIpV,IAAgC90I,GAChCmqJ,IAA8BxnJ,GAC9BwsI,IAAkCjrI,GAClC+hI,IAA8Bt/H,GAC9Bg7H,IAAgBjmH,EAMhB0uI,IAA8B,CAChC,oBAAqBtV,IAA8B,oBACnD,kBAAmBqV,IAA4B,kBAC/C,sBAAuBhb,IAAgC,sBACvD,kBAAmBlJ,IAA4B,kBAC/C,sBAAuBtE,IAAc,qBACvC,EACAuoB,GAAA,4BAAsCE,ICrBtC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAI7P,IAA4Bx6I,GAC5B80I,IAAgCnyI,GAChC24I,IAA+Bp3I,GAC/BomJ,IAAwC3jJ,GACxCs/H,IAA8BvqH,GAC9BimH,IAAgBz8G,EAMhBqlI,IAAqB,CACvB,gBAAiB/P,IAA0B,gBAC3C,oBAAqB1F,IAA8B,oBACnD,mBAAoBwG,IAA6B,mBACjD,4BAA6BgP,IAAsC,4BACnE,kBAAmBrkB,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACA0oB,GAAA,mBAA6BE,ICvB7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIhc,IAA4BxuI,GAC5BqmJ,IAA4B1jJ,GAC5B8nJ,IAA+BvmJ,GAC/BmqI,IAAiC1nI,GACjCs/H,IAA8BvqH,GAC9BimH,IAAgBz8G,EAMhBwlI,IAAkB,CACpB,gBAAiBlc,IAA0B,gBAC3C,gBAAiB6X,IAA0B,gBAC3C,mBAAoBoE,IAA6B,mBACjD,qBAAsBpc,IAA+B,qBACrD,kBAAmBpI,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACA6oB,GAAA,gBAA0BE,cCvB1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmCA,GAAA,6BAAG,OACvC,IAAIhlB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhB0mJ,IAA+B,CACjC,sBAAuBjlB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,uBAAwB5N,IAAc,sBACxC,EACAgpB,GAAA,6BAAuCC,cCjBvC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsCA,GAAA,gCAAG,OAC1C,IAAIllB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhB4mJ,IAAkC,CACpC,sBAAuBnlB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,0BAA2B5N,IAAc,yBAC3C,EACAkpB,GAAA,gCAA0CC,cCjB1C,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAI9kB,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBqoJ,IAA2B,CAC7B,kBAAmB/kB,IAA4B,kBAC/C,mBAAoBtE,IAAc,kBACpC,EACAopB,GAAA,yBAAmCC,cCfnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqCA,GAAA,+BAAG,OACzC,IAAI9c,IAA+BnuI,GAC/B8mI,IAA+BnkI,GAC/BsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhBukJ,IAAiC,CACnC,mBAAoB/c,IAA6B,mBACjD,mBAAoBrH,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,yBAA0BtE,IAAc,wBAC1C,EACAspB,GAAA,+BAAyCC,cCnBzC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiCA,GAAA,2BAAG,OACrC,IAAIvN,IAAgC59I,GAChC8mI,IAA+BnkI,GAC/B4qI,IAA6BrpI,GAC7B+hI,IAA8Bt/H,GAC9Bg7H,IAAgBjmH,EAMhB0vI,IAA6B,CAC/B,oBAAqBxN,IAA8B,oBACnD,mBAAoB9W,IAA6B,mBACjD,iBAAkByG,IAA2B,iBAC7C,kBAAmBtH,IAA4B,kBAC/C,qBAAsBtE,IAAc,oBACtC,EACAwpB,GAAA,2BAAqCC,cCrBrC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAI3a,IAA+B1wI,GAC/BurI,IAAgC5oI,GAChCsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhB2kJ,IAAkB,CACpB,mBAAoB5a,IAA6B,mBACjD,oBAAqBnF,IAA8B,oBACnD,kBAAmBtF,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACA0pB,GAAA,gBAA0BC,cCnB1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAI7a,IAA+B1wI,GAC/BurI,IAAgC5oI,GAChCsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhB6kJ,IAA2B,CAC7B,mBAAoB9a,IAA6B,mBACjD,oBAAqBnF,IAA8B,oBACnD,kBAAmBtF,IAA4B,kBAC/C,mBAAoBtE,IAAc,kBACpC,EACA4pB,GAAA,yBAAmCC,cCnBnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIjR,IAA4Bx6I,GAC5Bs7I,IAA+B34I,GAC/BsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhB+kJ,IAAmB,CACrB,gBAAiBlR,IAA0B,gBAC3C,mBAAoBc,IAA6B,mBACjD,kBAAmBrV,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACA8pB,GAAA,iBAA2BC,cCnB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgCA,GAAA,0BAAG,OACpC,IAAInR,IAA4Bx6I,GAC5Bs7I,IAA+B34I,GAC/BsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhBilJ,IAA4B,CAC9B,gBAAiBpR,IAA0B,gBAC3C,mBAAoBc,IAA6B,mBACjD,kBAAmBrV,IAA4B,kBAC/C,oBAAqBtE,IAAc,mBACrC,EACAgqB,GAAA,0BAAoCC,cCnBpC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAItgB,IAAgCvrI,GAChCszI,IAAgC3wI,GAChCsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhBmlJ,IAAkB,CACpB,oBAAqBvgB,IAA8B,oBACnD,oBAAqB+H,IAA8B,oBACnD,kBAAmBrN,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACAkqB,GAAA,gBAA0BC,cCnB1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAIxgB,IAAgCvrI,GAChCszI,IAAgC3wI,GAChCsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhBqlJ,IAA2B,CAC7B,oBAAqBzgB,IAA8B,oBACnD,oBAAqB+H,IAA8B,oBACnD,kBAAmBrN,IAA4B,kBAC/C,mBAAoBtE,IAAc,kBACpC,EACAoqB,GAAA,yBAAmCC,cCnBnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAI9B,IAA8BnqJ,GAC9BmvI,IAAkCxsI,GAClCsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhBulJ,IAAmB,CACrB,kBAAmB/B,IAA4B,kBAC/C,sBAAuBhb,IAAgC,sBACvD,kBAAmBlJ,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACAsqB,GAAA,iBAA2BC,cCnB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIxmB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBkoJ,IAAwB,CAC1B,sBAAuBzmB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,gBAAiB5N,IAAc,eACjC,EACAwqB,GAAA,sBAAgCC,cCjBhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAI1mB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBooJ,IAA2B,CAC7B,sBAAuB3mB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,mBAAoB5N,IAAc,kBACpC,EACA0qB,GAAA,yBAAmCC,cCjBnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsCA,GAAA,gCAAG,OAC1C,IAAI5mB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBsoJ,IAAkC,CACpC,sBAAuB7mB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,0BAA2B5N,IAAc,yBAC3C,EACA4qB,GAAA,gCAA0CC,cCjB1C,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC8BA,GAAA,wBAAG,OAClC,IAAI9mB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBwoJ,IAA0B,CAC5B,sBAAuB/mB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,kBAAmB5N,IAAc,iBACnC,EACA8qB,GAAA,wBAAkCC,cCjBlC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC8BA,GAAA,wBAAG,OAClC,IAAInS,IAA4Bx6I,GAC5Bs7I,IAA+B34I,GAC/B6tI,IAAkCtsI,GAClCmkI,IAAkC1hI,GAClCsxI,IAAmCv8H,GACnC0yH,IAAiClpH,GACjC+gH,IAA8BpuG,GAC9B8pG,IAAgB7pG,EAMhB80H,IAA0B,CAC5B,gBAAiBpS,IAA0B,gBAC3C,mBAAoBc,IAA6B,mBACjD,sBAAuB9K,IAAgC,sBACvD,sBAAuBnI,IAAgC,sBACvD,uBAAwB4P,IAAiC,uBACzD,qBAAsB7J,IAA+B,qBACrD,kBAAmBnI,IAA4B,kBAC/C,kBAAmBtE,IAAc,iBACnC,EACAgrB,GAAA,wBAAkCC,cC3BlC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIlnB,IAAuC3lI,GACvC2hI,IAAgBh/H,EAMhBmqJ,IAAkB,CACpB,sBAAuBnnB,IAAqC,sBAC5D,UAAWhE,IAAc,SAC3B,EACAkrB,GAAA,gBAA0BC,cCf1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC8BA,GAAA,wBAAG,OAClC,IAAIpnB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhB8oJ,IAA0B,CAC5B,sBAAuBrnB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,kBAAmB5N,IAAc,iBACnC,EACAorB,GAAA,wBAAkCC,cCjBlC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAItnB,IAAuC3lI,GACvCyoI,IAA+B9lI,GAC/B6jI,IAAoCtiI,GACpC4iI,IAA+BngI,GAC/Bs/H,IAA8BvqH,GAC9BimH,IAAgBz8G,EAMhBgoI,IAAsB,CACxB,sBAAuBvnB,IAAqC,sBAC5D,mBAAoB8C,IAA6B,mBACjD,wBAAyBjC,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,cAAetE,IAAc,aAC/B,EACAsrB,GAAA,oBAA8BC,cCvB9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAIvnB,IAAqC5lI,GACrCkuI,IAAqCvrI,GACrCsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhBymJ,IAAuB,CACzB,oBAAqBxnB,IAAmC,oBACxD,yBAA0BsI,IAAmC,yBAC7D,kBAAmBjI,IAA4B,kBAC/C,eAAgBtE,IAAc,cAChC,EACAwrB,GAAA,qBAA+BC,cCnB/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkCA,GAAA,4BAAG,OACtC,IAAI1nB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBopJ,IAA8B,CAChC,sBAAuB3nB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,sBAAuB5N,IAAc,qBACvC,EACA0rB,GAAA,4BAAsCC,cCjBtC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAI5rB,IAAgB3hI,EAMhBwtJ,IAAmB,CACrB,WAAY7rB,IAAc,UAC5B,EACA4rB,GAAA,iBAA2BC,cCb3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIve,IAA+BlvI,GAC/BimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBwpJ,IAAkB,CACpB,mBAAoBxe,IAA6B,mBACjD,kBAAmBjJ,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACA8rB,GAAA,gBAA0BC,cCjB1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIhoB,IAAuC3lI,GACvC8mI,IAA+BnkI,GAC/BsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhBinJ,IAAmB,CACrB,sBAAuBjoB,IAAqC,sBAC5D,mBAAoBmB,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACAgsB,GAAA,iBAA2BC,cCnB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAIhoB,IAAyC7lI,GACzCyoI,IAA+B9lI,GAC/B6jI,IAAoCtiI,GACpC4iI,IAA+BngI,GAC/Bs/H,IAA8BvqH,GAC9BimH,IAAgBz8G,EAMhB4oI,IAAiB,CACnB,wBAAyBjoB,IAAuC,wBAChE,mBAAoB4C,IAA6B,mBACjD,wBAAyBjC,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,SAAUtE,IAAc,QAC1B,EACAksB,GAAA,eAAyBC,oBCvBzB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIC,IAAiChuJ,GACjC2hI,IAAgBh/H,EAMhBsrJ,IAAqB,CACvB,qBAAsBD,IAA+B,qBACrD,kBAAmBrsB,IAAc,iBACnC,EACAosB,GAAA,mBAA6BE,ICf7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIC,IAAoCnuJ,GACpCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBkqJ,IAAqB,CACvB,mBAAoBD,IAAkC,mBACtD,kBAAmBloB,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACAusB,GAAA,mBAA6BE,cCjB7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAI7d,IAAkCxwI,GAClCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBoqJ,IAA2B,CAC7B,sBAAuB9d,IAAgC,sBACvD,kBAAmBvK,IAA4B,kBAC/C,mBAAoBtE,IAAc,kBACpC,EACA0sB,GAAA,yBAAmCC,cCjBnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAI5oB,IAAuC3lI,GACvC2hI,IAAgBh/H,EAMhB6rJ,IAAkB,CACpB,sBAAuB7oB,IAAqC,sBAC5D,UAAWhE,IAAc,SAC3B,EACA4sB,GAAA,gBAA0BC,cCf1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAI9oB,IAAuC3lI,GACvC2hI,IAAgBh/H,EAMhB+rJ,IAAiB,CACnB,sBAAuB/oB,IAAqC,sBAC5D,SAAUhE,IAAc,QAC1B,EACA8sB,GAAA,eAAyBC,cCfzB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC6BA,GAAA,uBAAG,OACjC,IAAI1oB,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBisJ,IAAyB,CAC3B,kBAAmB3oB,IAA4B,kBAC/C,iBAAkBtE,IAAc,gBAClC,EACAgtB,GAAA,uBAAiCC,cCfjC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIjpB,IAAqC5lI,GACrCw6I,IAA4B73I,GAC5BymJ,IAAmCllJ,GACnC4qJ,IAAkCnoJ,GAClCunI,IAAqCxyH,GACrCgyH,IAA4BxoH,GAC5Bu8H,IAAkC5pH,GAClCm3G,IAA8Bl3G,GAC9B+2G,IAA4B92G,GAC5B+uG,IAA+B9uG,GAC/Bo2G,IAAiC7/E,GACjC03E,IAA8Bz+D,GAC9Bm6D,IAAgBj6D,EAMhBqnF,IAAmB,CACrB,oBAAqBnpB,IAAmC,oBACxD,gBAAiB4U,IAA0B,gBAC3C,uBAAwB4O,IAAiC,uBACzD,sBAAuB0F,IAAgC,sBACvD,yBAA0B5gB,IAAmC,yBAC7D,gBAAiBR,IAA0B,gBAC3C,sBAAuB+T,IAAgC,sBACvD,kBAAmBzS,IAA4B,kBAC/C,gBAAiBH,IAA0B,gBAC3C,mBAAoB/H,IAA6B,mBACjD,qBAAsBsH,IAA+B,qBACrD,kBAAmBnI,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACAktB,GAAA,iBAA2BE,cCrC3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAIrpB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhB+qJ,IAA2B,CAC7B,sBAAuBtpB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,mBAAoB5N,IAAc,kBACpC,EACAqtB,GAAA,yBAAmCC,cCjBnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiCA,GAAA,2BAAG,OACrC,IAAIvpB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBirJ,IAA6B,CAC/B,sBAAuBxpB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,qBAAsB5N,IAAc,oBACtC,EACAutB,GAAA,2BAAqCC,cCjBrC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAIzpB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBmrJ,IAA2B,CAC7B,sBAAuB1pB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,mBAAoB5N,IAAc,kBACpC,EACAytB,GAAA,yBAAmCC,cCjBnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC6BA,GAAA,uBAAG,OACjC,IAAI3pB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBqrJ,IAAyB,CAC3B,sBAAuB5pB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,iBAAkB5N,IAAc,gBAClC,EACA2tB,GAAA,uBAAiCC,cCjBjC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoCA,GAAA,8BAAG,OACxC,IAAI7pB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBurJ,IAAgC,CAClC,sBAAuB9pB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,wBAAyB5N,IAAc,uBACzC,EACA6tB,GAAA,8BAAwCC,cCjBxC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC6BA,GAAA,uBAAG,OACjC,IAAI/pB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhByrJ,IAAyB,CAC3B,sBAAuBhqB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,iBAAkB5N,IAAc,gBAClC,EACA+tB,GAAA,uBAAiCC,oBCjBjC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAI3pB,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBktJ,IAAqB,CACvB,kBAAmB5pB,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACAiuB,GAAA,mBAA6BC,ICf7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiCA,GAAA,2BAAG,OACrC,IAAItV,IAA4Bx6I,GAC5B+vJ,IAA6BptJ,GAC7B24I,IAA+Bp3I,GAC/BsiI,IAAoC7/H,GACpCs4I,IAA2BvjI,GAC3ByyH,IAA+BjpH,GAC/BkpH,IAAiCv2G,GACjCunH,IAA2BtnH,GAC3B6kH,IAA6B5kH,GAC7Bs2G,IAAiCr2G,GACjCg4H,IAA+BzhG,GAC/B03E,IAA8Bz+D,GAC9BumE,IAAmCrmE,GACnCi6D,IAAgBx3D,EAMhB8lF,IAA6B,CAC/B,gBAAiBzV,IAA0B,gBAC3C,iBAAkBuV,IAA2B,iBAC7C,mBAAoBzU,IAA6B,mBACjD,wBAAyB9U,IAAkC,wBAC3D,eAAgByY,IAAyB,eACzC,mBAAoB9Q,IAA6B,mBACjD,qBAAsBC,IAA+B,qBACrD,eAAgBgR,IAAyB,eACzC,iBAAkBzC,IAA2B,iBAC7C,qBAAsBtO,IAA+B,qBACrD,mBAAoB2hB,IAA6B,mBACjD,kBAAmB/pB,IAA4B,kBAC/C,uBAAwB8H,IAAiC,uBACzD,qBAAsBpM,IAAc,oBACtC,EACAmuB,GAAA,2BAAqCG,cCvCrC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIjqB,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBwtJ,IAAoB,CACtB,kBAAmBlqB,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACAuuB,GAAA,kBAA4BC,cCf5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC6BA,GAAA,uBAAG,OACjC,IAAIzqB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBmsJ,IAAyB,CAC3B,sBAAuB1qB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,iBAAkB5N,IAAc,gBAClC,EACAyuB,GAAA,uBAAiCC,cCjBjC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC8BA,GAAA,wBAAG,OAClC,IAAI9V,IAA4Bx6I,GAC5B80I,IAAgCnyI,GAChCyrI,IAAiClqI,GACjComJ,IAAwC3jJ,GACxCs/H,IAA8BvqH,GAC9BimH,IAAgBz8G,EAMhBqrI,IAA0B,CAC5B,gBAAiB/V,IAA0B,gBAC3C,oBAAqB1F,IAA8B,oBACnD,qBAAsB1G,IAA+B,qBACrD,4BAA6Bkc,IAAsC,4BACnE,kBAAmBrkB,IAA4B,kBAC/C,kBAAmBtE,IAAc,iBACnC,EACA2uB,GAAA,wBAAkCC,cCvBlC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuCA,GAAA,iCAAG,OAC3C,IAAI7qB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBusJ,IAAmC,CACrC,sBAAuB9qB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,2BAA4B5N,IAAc,0BAC5C,EACA6uB,GAAA,iCAA2CC,cCjB3C,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIzqB,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBguJ,IAAqB,CACvB,kBAAmB1qB,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACA+uB,GAAA,mBAA6BC,cCf7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAI3qB,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBkuJ,IAAwB,CAC1B,kBAAmB5qB,IAA4B,kBAC/C,gBAAiBtE,IAAc,eACjC,EACAivB,GAAA,sBAAgCC,cCfhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAInvB,IAAgB3hI,EAMhB+wJ,IAAoB,CACtB,iBAAkBpvB,IAAc,gBAClC,EACAmvB,GAAA,kBAA4BC,cCb5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiCA,GAAA,2BAAG,OACrC,IAAI9lB,IAAkClrI,GAClC8mI,IAA+BnkI,GAC/B+tI,IAA+BxsI,GAC/B8vI,IAAiCrtI,GACjC2sI,IAAgC53H,GAChCu4H,IAAkC/uH,GAClC+gH,IAA8BpuG,GAC9B8pG,IAAgB7pG,EAMhBm5H,IAA6B,CAC/B,sBAAuB/lB,IAAgC,sBACvD,mBAAoBpE,IAA6B,mBACjD,mBAAoB4J,IAA6B,mBACjD,qBAAsBsD,IAA+B,qBACrD,oBAAqBV,IAA8B,oBACnD,sBAAuBW,IAAgC,sBACvD,kBAAmBhO,IAA4B,kBAC/C,qBAAsBtE,IAAc,oBACtC,EACAqvB,GAAA,2BAAqCC,cC3BrC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC8BA,GAAA,wBAAG,OAClC,IAAIhmB,IAAkClrI,GAClCmrI,IAAiCxoI,GACjC+zI,IAAqCxyI,GACrCyyI,IAAkChwI,GAClCowI,IAAqCr7H,GACrCu7H,IAAqC/xH,GACrCgyH,IAAkCr/G,GAClCs/G,IAAmCr/G,GACnCs/G,IAAqCr/G,GACrCs/G,IAAwCr/G,GACxC29G,IAAmCpnF,GACnCisF,IAA4BhzE,GAC5B8zE,IAA+B5zE,GAC/BsnE,IAA8B7kE,GAC9BgkE,IAA+Bj+D,GAC/B42D,IAA+B32D,GAC/Bi+D,IAAiCh+D,GACjCsnE,IAA8BziD,GAC9Bm6C,IAA4Bj6C,GAC5B2mD,IAAiC1mD,GACjCsmD,IAAyCpmD,GACzCqmD,IAAqCpmD,GACrC84C,IAAiC74C,GACjCywC,IAA8BvwC,GAC9BisC,IAAgBhsC,EAMhBw7D,IAA0B,CAC5B,sBAAuBjmB,IAAgC,sBACvD,qBAAsBC,IAA+B,qBACrD,yBAA0BuL,IAAmC,yBAC7D,sBAAuBC,IAAgC,sBACvD,yBAA0BI,IAAmC,yBAC7D,yBAA0BE,IAAmC,yBAC7D,sBAAuBC,IAAgC,sBACvD,uBAAwBC,IAAiC,uBACzD,yBAA0BC,IAAmC,yBAC7D,4BAA6BC,IAAsC,4BACnE,uBAAwB1B,IAAiC,uBACzD,gBAAiB6E,IAA0B,gBAC3C,mBAAoBc,IAA6B,mBACjD,kBAAmBtM,IAA4B,kBAC/C,mBAAoBb,IAA6B,mBACjD,mBAAoBrH,IAA6B,mBACjD,qBAAsBsH,IAA+B,qBACrD,kBAAmBsJ,IAA4B,kBAC/C,gBAAiBtI,IAA0B,gBAC3C,qBAAsB0M,IAA+B,qBACrD,6BAA8BJ,IAAuC,6BACrE,yBAA0BC,IAAmC,yBAC7D,qBAAsBtN,IAA+B,qBACrD,kBAAmBpI,IAA4B,kBAC/C,kBAAmBtE,IAAc,iBACnC,EACAuvB,GAAA,wBAAkCC,cC7DlC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwCA,GAAA,kCAAG,OAC5C,IAAIzrB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBmtJ,IAAoC,CACtC,sBAAuB1rB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,4BAA6B5N,IAAc,2BAC7C,EACAyvB,GAAA,kCAA4CC,cCjB5C,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAI3vB,IAAgB3hI,EAMhBuxJ,IAAuB,CACzB,eAAgB5vB,IAAc,cAChC,EACA2vB,GAAA,qBAA+BC,cCb/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAInpB,IAAkCroI,GAClC8mI,IAA+BnkI,GAC/BsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhB8qJ,IAAsB,CACxB,sBAAuBppB,IAAgC,sBACvD,mBAAoBvB,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,cAAetE,IAAc,aAC/B,EACA6vB,GAAA,oBAA8BC,cCnB9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAI5qB,IAA+B9mI,GAC/B2hI,IAAgBh/H,EAMhBgvJ,IAAqB,CACvB,mBAAoB7qB,IAA6B,mBACjD,aAAcnF,IAAc,YAC9B,EACA+vB,GAAA,mBAA6BC,cCf7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAIjwB,IAAgB3hI,EAMhB6xJ,IAAsB,CACxB,cAAelwB,IAAc,aAC/B,EACAiwB,GAAA,oBAA8BC,cCb9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkCA,GAAA,4BAAG,OACtC,IAAIjsB,IAAyC7lI,GACzCyoI,IAA+B9lI,GAC/B6jI,IAAoCtiI,GACpC4iI,IAA+BngI,GAC/Bs/H,IAA8BvqH,GAC9ButH,IAA8B/jH,GAC9By8G,IAAgB9pG,EAMhBk6H,IAA8B,CAChC,wBAAyBlsB,IAAuC,wBAChE,mBAAoB4C,IAA6B,mBACjD,wBAAyBjC,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,kBAAmBgD,IAA4B,kBAC/C,sBAAuBtH,IAAc,qBACvC,EACAmwB,GAAA,4BAAsCC,cCzBtC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgCA,GAAA,0BAAG,OACpC,IAAInsB,IAAyC7lI,GACzCyoI,IAA+B9lI,GAC/B6jI,IAAoCtiI,GACpC4iI,IAA+BngI,GAC/Bs/H,IAA8BvqH,GAC9ButH,IAA8B/jH,GAC9By8G,IAAgB9pG,EAMhBo6H,IAA4B,CAC9B,wBAAyBpsB,IAAuC,wBAChE,mBAAoB4C,IAA6B,mBACjD,wBAAyBjC,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,kBAAmBgD,IAA4B,kBAC/C,oBAAqBtH,IAAc,mBACrC,EACAqwB,GAAA,0BAAoCC,oBCzBpC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACiCA,GAAA,2BAAG,OACrC,IAAIvsB,IAAuC3lI,GACvC6lI,IAAyCljI,GACzCgkI,IAA0CziI,GAC1CskI,IAAkC7hI,GAClCo4I,IAA4BrjI,GAC5BorH,IAA+B5hH,GAC/BooH,IAAuCz1G,GACvC2xH,IAA6B1xH,GAC7BunH,IAA4BtnH,GAC5BkuG,IAA8BjuG,GAC9B+1G,IAAmCx/E,GACnCozE,IAAgBn6D,EAMhB2qF,IAA6B,CAC/B,sBAAuBxsB,IAAqC,sBAC5D,wBAAyBE,IAAuC,wBAChE,yBAA0Bc,IAAwC,yBAClE,sBAAuB6B,IAAgC,sBACvD,gBAAiBuW,IAA0B,gBAC3C,mBAAoBjY,IAA6B,mBACjD,2BAA4BwG,IAAqC,2BACjE,iBAAkBkc,IAA2B,iBAC7C,gBAAiBnK,IAA0B,gBAC3C,kBAAmBpZ,IAA4B,kBAC/C,uBAAwB8H,IAAiC,uBACzD,qBAAsBpM,IAAc,oBACtC,EACAuwB,GAAA,2BAAqCC,ICnCrC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAIhkB,IAAiCpuI,GACjCqyJ,IAAuC1vJ,GACvCsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhB2rJ,IAAqB,CACvB,qBAAsBlkB,IAA+B,qBACrD,2BAA4BikB,IAAqC,2BACjE,kBAAmBpsB,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACAywB,GAAA,mBAA6BE,cCnB7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIne,IAAmCp0I,GACnC8mI,IAA+BnkI,GAC/B0xI,IAA8BnwI,GAC9B+hI,IAA8Bt/H,GAC9Bg7H,IAAgBjmH,EAMhB82I,IAAkB,CACpB,kBAAmBpe,IAAiC,kBACpD,mBAAoBtN,IAA6B,mBACjD,kBAAmBuN,IAA4B,kBAC/C,kBAAmBpO,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACA4wB,GAAA,gBAA0BC,cCrB1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAIre,IAAmCp0I,GACnC8mI,IAA+BnkI,GAC/B0xI,IAA8BnwI,GAC9B+hI,IAA8Bt/H,GAC9Bg7H,IAAgBjmH,EAMhBg3I,IAA2B,CAC7B,kBAAmBte,IAAiC,kBACpD,mBAAoBtN,IAA6B,mBACjD,kBAAmBuN,IAA4B,kBAC/C,kBAAmBpO,IAA4B,kBAC/C,mBAAoBtE,IAAc,kBACpC,EACA8wB,GAAA,yBAAmCC,cCrBnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAIhtB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhB0uJ,IAAsB,CACxB,sBAAuBjtB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,cAAe5N,IAAc,aAC/B,EACAgxB,GAAA,oBAA8BC,cCjB9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAIltB,IAAuC3lI,GACvC2hI,IAAgBh/H,EAQhBmwJ,IAAsB,CAExB,sBAAuBntB,IAAqC,sBAC5D,cAAehE,IAAc,aAC/B,EACAkxB,GAAA,oBAA8BC,cClB9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIptB,IAAuC3lI,GACvC2hI,IAAgBh/H,EAMhBqwJ,IAAoB,CACtB,sBAAuBrtB,IAAqC,sBAC5D,YAAahE,IAAc,WAC7B,EACAoxB,GAAA,kBAA4BC,cCf5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgCA,GAAA,0BAAG,OACpC,IAAIttB,IAAuC3lI,GACvC2hI,IAAgBh/H,EAMhBuwJ,IAA4B,CAC9B,sBAAuBvtB,IAAqC,sBAC5D,oBAAqBhE,IAAc,mBACrC,EACAsxB,GAAA,0BAAoCC,cCfpC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIxtB,IAAuC3lI,GACvCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBkvJ,IAAkB,CACpB,sBAAuBztB,IAAqC,sBAC5D,kBAAmBM,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACAwxB,GAAA,gBAA0BC,cCjB1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAI1tB,IAAuC3lI,GACvCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBovJ,IAAmB,CACrB,sBAAuB3tB,IAAqC,sBAC5D,kBAAmBM,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACA0xB,GAAA,iBAA2BC,cCjB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkCA,GAAA,4BAAG,OACtC,IAAI5tB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBsvJ,IAA8B,CAChC,sBAAuB7tB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,sBAAuB5N,IAAc,qBACvC,EACA4xB,GAAA,4BAAsCC,cCjBtC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAI5tB,IAAyC7lI,GACzCo0I,IAAmCzxI,GACnC+wJ,IAAuCxvJ,GACvCqpI,IAA6B5mI,GAC7BugI,IAA+BxrH,GAC/BuqH,IAA8B/gH,GAC9By8G,IAAgB9pG,EAMhB87H,IAA2B,CAC7B,wBAAyB9tB,IAAuC,wBAChE,kBAAmBuO,IAAiC,kBACpD,2BAA4Bsf,IAAqC,2BACjE,iBAAkBnmB,IAA2B,iBAC7C,mBAAoBrG,IAA6B,mBACjD,kBAAmBjB,IAA4B,kBAC/C,mBAAoBtE,IAAc,kBACpC,EACA8xB,GAAA,yBAAmCE,cCzBnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgCA,GAAA,0BAAG,OACpC,IAAI/tB,IAAyC7lI,GACzCo0I,IAAmCzxI,GACnC+wJ,IAAuCxvJ,GACvCqpI,IAA6B5mI,GAC7BugI,IAA+BxrH,GAC/BuqH,IAA8B/gH,GAC9By8G,IAAgB9pG,EAMhBg8H,IAA4B,CAC9B,wBAAyBhuB,IAAuC,wBAChE,kBAAmBuO,IAAiC,kBACpD,2BAA4Bsf,IAAqC,2BACjE,iBAAkBnmB,IAA2B,iBAC7C,mBAAoBrG,IAA6B,mBACjD,kBAAmBjB,IAA4B,kBAC/C,oBAAqBtE,IAAc,mBACrC,EACAiyB,GAAA,0BAAoCC,cCzBpC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC8BA,GAAA,wBAAG,OAClC,IAAIjuB,IAAyC7lI,GACzCo0I,IAAmCzxI,GACnC+wJ,IAAuCxvJ,GACvCqpI,IAA6B5mI,GAC7BugI,IAA+BxrH,GAC/BuqH,IAA8B/gH,GAC9By8G,IAAgB9pG,EAMhBk8H,IAA0B,CAC5B,wBAAyBluB,IAAuC,wBAChE,kBAAmBuO,IAAiC,kBACpD,2BAA4Bsf,IAAqC,2BACjE,iBAAkBnmB,IAA2B,iBAC7C,mBAAoBrG,IAA6B,mBACjD,kBAAmBjB,IAA4B,kBAC/C,kBAAmBtE,IAAc,iBACnC,EACAmyB,GAAA,wBAAkCC,cCzBlC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAInuB,IAAyC7lI,GACzCo0I,IAAmCzxI,GACnC+wJ,IAAuCxvJ,GACvCqpI,IAA6B5mI,GAC7BugI,IAA+BxrH,GAC/BuqH,IAA8B/gH,GAC9By8G,IAAgB9pG,EAMhBo8H,IAA2B,CAC7B,wBAAyBpuB,IAAuC,wBAChE,kBAAmBuO,IAAiC,kBACpD,2BAA4Bsf,IAAqC,2BACjE,iBAAkBnmB,IAA2B,iBAC7C,mBAAoBrG,IAA6B,mBACjD,kBAAmBjB,IAA4B,kBAC/C,mBAAoBtE,IAAc,kBACpC,EACAqyB,GAAA,yBAAmCC,cCzBnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC8BA,GAAA,wBAAG,OAClC,IAAI9f,IAAmCp0I,GACnC0zJ,IAAuC/wJ,GACvC4qI,IAA6BrpI,GAC7BgjI,IAA+BvgI,GAC/Bs/H,IAA8BvqH,GAC9BimH,IAAgBz8G,EAMhBivI,IAA0B,CAC5B,kBAAmB/f,IAAiC,kBACpD,2BAA4Bsf,IAAqC,2BACjE,iBAAkBnmB,IAA2B,iBAC7C,mBAAoBrG,IAA6B,mBACjD,kBAAmBjB,IAA4B,kBAC/C,kBAAmBtE,IAAc,iBACnC,EACAuyB,GAAA,wBAAkCC,cCvBlC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkCA,GAAA,4BAAG,OACtC,IAAIhgB,IAAmCp0I,GACnC0zJ,IAAuC/wJ,GACvC4qI,IAA6BrpI,GAC7BgjI,IAA+BvgI,GAC/Bs/H,IAA8BvqH,GAC9BimH,IAAgBz8G,EAMhBmvI,IAA8B,CAChC,kBAAmBjgB,IAAiC,kBACpD,2BAA4Bsf,IAAqC,2BACjE,iBAAkBnmB,IAA2B,iBAC7C,mBAAoBrG,IAA6B,mBACjD,kBAAmBjB,IAA4B,kBAC/C,sBAAuBtE,IAAc,qBACvC,EACAyyB,GAAA,4BAAsCC,cCvBtC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC8BA,GAAA,wBAAG,OAClC,IAAIlgB,IAAmCp0I,GACnC0zJ,IAAuC/wJ,GACvC4qI,IAA6BrpI,GAC7BgjI,IAA+BvgI,GAC/Bs/H,IAA8BvqH,GAC9BimH,IAAgBz8G,EAMhBqvI,IAA0B,CAC5B,kBAAmBngB,IAAiC,kBACpD,2BAA4Bsf,IAAqC,2BACjE,iBAAkBnmB,IAA2B,iBAC7C,mBAAoBrG,IAA6B,mBACjD,kBAAmBjB,IAA4B,kBAC/C,kBAAmBtE,IAAc,iBACnC,EACA2yB,GAAA,wBAAkCC,cCvBlC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAId,IAAuC1zJ,GACvCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBuwJ,IAAsB,CACxB,2BAA4Bf,IAAqC,2BACjE,kBAAmBztB,IAA4B,kBAC/C,cAAetE,IAAc,aAC/B,EACA6yB,GAAA,oBAA8BC,cCjB9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmCA,GAAA,6BAAG,OACvC,IAAItgB,IAAmCp0I,GACnCyoI,IAA+B9lI,GAC/BgyJ,IAAsCzwJ,GACtCqpI,IAA6B5mI,GAC7BugI,IAA+BxrH,GAC/BuqH,IAA8B/gH,GAC9By8G,IAAgB9pG,EAMhB+8H,IAA+B,CACjC,kBAAmBxgB,IAAiC,kBACpD,mBAAoB3L,IAA6B,mBACjD,0BAA2BksB,IAAoC,0BAC/D,iBAAkBpnB,IAA2B,iBAC7C,mBAAoBrG,IAA6B,mBACjD,kBAAmBjB,IAA4B,kBAC/C,uBAAwBtE,IAAc,sBACxC,EACA+yB,GAAA,6BAAuCE,cCzBvC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAIzgB,IAAmCp0I,GACnCyoI,IAA+B9lI,GAC/BmyJ,IAAqC5wJ,GACrC6wJ,IAAyCpuJ,GACzC4mI,IAA6B7xH,GAC7BwrH,IAA+BhiH,GAC/B+gH,IAA8BpuG,GAC9B8pG,IAAgB7pG,EAMhBk9H,IAAuB,CACzB,kBAAmB5gB,IAAiC,kBACpD,mBAAoB3L,IAA6B,mBACjD,yBAA0BqsB,IAAmC,yBAC7D,6BAA8BC,IAAuC,6BACrE,iBAAkBxnB,IAA2B,iBAC7C,mBAAoBrG,IAA6B,mBACjD,kBAAmBjB,IAA4B,kBAC/C,eAAgBtE,IAAc,cAChC,EACAkzB,GAAA,qBAA+BG,cC3B/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIhvB,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBuyJ,IAAmB,CACrB,kBAAmBjvB,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACAszB,GAAA,iBAA2BC,cCf3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIrgB,IAAgC90I,GAChC0zJ,IAAuC/wJ,GACvCmkI,IAA+B5iI,GAC/B+hI,IAA8Bt/H,GAC9Bg7H,IAAgBjmH,EAMhB05I,IAAmB,CACrB,oBAAqBtgB,IAA8B,oBACnD,2BAA4B4e,IAAqC,2BACjE,mBAAoB5sB,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACAwzB,GAAA,iBAA2BC,cCrB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAI1uB,IAA0C3mI,GAC1CimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBoxJ,IAAqB,CACvB,yBAA0B3uB,IAAwC,yBAClE,kBAAmBV,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACA0zB,GAAA,mBAA6BC,cCjB7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAI5vB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBsxJ,IAA2B,CAC7B,sBAAuB7vB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,mBAAoB5N,IAAc,kBACpC,EACA4zB,GAAA,yBAAmCC,cCjBnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC4BA,GAAA,sBAAG,OAChC,IAAIxvB,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhB+yJ,IAAwB,CAC1B,kBAAmBzvB,IAA4B,kBAC/C,gBAAiBtE,IAAc,eACjC,EACA8zB,GAAA,sBAAgCC,cCfhC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAInnB,IAA4BxuI,GAC5Bw6I,IAA4B73I,GAC5B+rI,IAAiCxqI,GACjC2qI,IAA4BloI,GAC5B0/I,IAA4B3qI,GAC5Bk6I,IAA4B1wI,GAC5BkpH,IAAiCv2G,GACjC01G,IAA6Bz1G,GAC7B6kH,IAA6B5kH,GAC7Bs2G,IAAiCr2G,GACjCiuG,IAA8B13E,GAC9BozE,IAAgBn6D,EAMhBquF,IAAoB,CACtB,gBAAiBrnB,IAA0B,gBAC3C,gBAAiBgM,IAA0B,gBAC3C,qBAAsB9L,IAA+B,qBACrD,gBAAiBG,IAA0B,gBAC3C,gBAAiBwX,IAA0B,gBAC3C,gBAAiBuP,IAA0B,gBAC3C,qBAAsBxnB,IAA+B,qBACrD,iBAAkBb,IAA2B,iBAC7C,iBAAkBoP,IAA2B,iBAC7C,qBAAsBtO,IAA+B,qBACrD,kBAAmBpI,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACAg0B,GAAA,kBAA4BE,cCnC5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAI7vB,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBozJ,IAAqB,CACvB,kBAAmB9vB,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACAm0B,GAAA,mBAA6BC,cCf7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAIlvB,IAA+B9mI,GAC/BimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhB+xJ,IAAsB,CACxB,mBAAoBnvB,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,cAAetE,IAAc,aAC/B,EACAq0B,GAAA,oBAA8BC,oBCjB9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC2BA,GAAA,qBAAG,OAC/B,IAAI1b,IAA4Bx6I,GAC5Bm2J,IAA8BxzJ,GAC9B24I,IAA+Bp3I,GAC/BimJ,IAA8BxjJ,GAC9BynI,IAAiC1yH,GACjC2yH,IAAiCnpH,GACjC+gH,IAA8BpuG,GAC9B8pG,IAAgB7pG,EAMhBs+H,IAAuB,CACzB,gBAAiB5b,IAA0B,gBAC3C,kBAAmB2b,IAA4B,kBAC/C,mBAAoB7a,IAA6B,mBACjD,kBAAmB6O,IAA4B,kBAC/C,qBAAsB/b,IAA+B,qBACrD,qBAAsBC,IAA+B,qBACrD,kBAAmBpI,IAA4B,kBAC/C,eAAgBtE,IAAc,cAChC,EACAu0B,GAAA,qBAA+BE,IC3B/B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIhQ,IAA4BrmJ,GAC5B28I,IAA6Bh6I,GAC7BsjI,IAA8B/hI,GAC9BoyJ,IAAiC3vJ,GACjCg7H,IAAgBjmH,EAMhB66I,IAAkB,CACpB,gBAAiBlQ,IAA0B,gBAC3C,iBAAkB1J,IAA2B,iBAC7C,kBAAmB1W,IAA4B,kBAC/C,qBAAsBqwB,IAA+B,qBACrD,UAAW30B,IAAc,SAC3B,EACA00B,GAAA,gBAA0BE,cCrB1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAInQ,IAA4BrmJ,GAC5B28I,IAA6Bh6I,GAC7BsjI,IAA8B/hI,GAC9BoyJ,IAAiC3vJ,GACjCg7H,IAAgBjmH,EAMhB+6I,IAA2B,CAC7B,gBAAiBpQ,IAA0B,gBAC3C,iBAAkB1J,IAA2B,iBAC7C,kBAAmB1W,IAA4B,kBAC/C,qBAAsBqwB,IAA+B,qBACrD,mBAAoB30B,IAAc,kBACpC,EACA60B,GAAA,yBAAmCC,cCrBnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkCA,GAAA,4BAAG,OACtC,IAAI/wB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhByyJ,IAA8B,CAChC,sBAAuBhxB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,sBAAuB5N,IAAc,qBACvC,EACA+0B,GAAA,4BAAsCC,cCjBtC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACyBA,GAAA,mBAAG,OAC7B,IAAI3wB,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhBk0J,IAAqB,CACvB,kBAAmB5wB,IAA4B,kBAC/C,aAActE,IAAc,YAC9B,EACAi1B,GAAA,mBAA6BC,cCf7B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkCA,GAAA,4BAAG,OACtC,IAAIhwB,IAA+B9mI,GAC/BimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhB6yJ,IAA8B,CAChC,mBAAoBjwB,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,sBAAuBtE,IAAc,qBACvC,EACAm1B,GAAA,4BAAsCC,cCjBtC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC+BA,GAAA,yBAAG,OACnC,IAAIxc,IAA4Bx6I,GAC5BurI,IAAgC5oI,GAChCsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhBswJ,IAA2B,CAC7B,gBAAiBzc,IAA0B,gBAC3C,oBAAqBjP,IAA8B,oBACnD,kBAAmBtF,IAA4B,kBAC/C,mBAAoBtE,IAAc,kBACpC,EACAq1B,GAAA,yBAAmCC,cCnBnC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACgCA,GAAA,0BAAG,OACpC,IAAI9f,IAAqCp3I,GACrC03I,IAA8B/0I,GAC9Bm5I,IAAiC53I,GACjC+hI,IAA8Bt/H,GAC9Bg7H,IAAgBjmH,EAMhBy7I,IAA4B,CAC9B,yBAA0B/f,IAAmC,yBAC7D,kBAAmBM,IAA4B,kBAC/C,qBAAsBoE,IAA+B,qBACrD,kBAAmB7V,IAA4B,kBAC/C,oBAAqBtE,IAAc,mBACrC,EACAu1B,GAAA,0BAAoCC,cCrBpC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAInxB,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhB00J,IAAkB,CACpB,kBAAmBpxB,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACAy1B,GAAA,gBAA0BC,cCf1B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIrxB,IAA8BjmI,GAC9B2hI,IAAgBh/H,EAMhB40J,IAAmB,CACrB,kBAAmBtxB,IAA4B,kBAC/C,WAAYtE,IAAc,UAC5B,EACA21B,GAAA,iBAA2BC,cCf3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsCA,GAAA,gCAAG,OAC1C,IAAI7xB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBuzJ,IAAkC,CACpC,sBAAuB9xB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,0BAA2B5N,IAAc,yBAC3C,EACA61B,GAAA,gCAA0CC,cCjB1C,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAIjvB,IAA+BzoI,GAC/B8mI,IAA+BnkI,GAC/BsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhBgxJ,IAAiB,CACnB,mBAAoBlvB,IAA6B,mBACjD,mBAAoB3B,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,SAAUtE,IAAc,QAC1B,EACA+1B,GAAA,eAAyBC,cCnBzB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACwBA,GAAA,kBAAG,OAC5B,IAAIpd,IAA4Bx6I,GAC5B8mI,IAA+BnkI,GAC/BsjI,IAA8B/hI,GAC9By9H,IAAgBh7H,EAMhBkxJ,IAAoB,CACtB,gBAAiBrd,IAA0B,gBAC3C,mBAAoB1T,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,YAAatE,IAAc,WAC7B,EACAi2B,GAAA,kBAA4BC,cCnB5B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAIn2B,IAAgB3hI,EAMhB+3J,IAAmB,CACrB,WAAYp2B,IAAc,UAC5B,EACAm2B,GAAA,iBAA2BC,cCb3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAInyB,IAAyC7lI,GACzCyoI,IAA+B9lI,GAC/B6jI,IAAoCtiI,GACpC4iI,IAA+BngI,GAC/Bs/H,IAA8BvqH,GAC9BimH,IAAgBz8G,EAMhB+yI,IAAsB,CACxB,wBAAyBpyB,IAAuC,wBAChE,mBAAoB4C,IAA6B,mBACjD,wBAAyBjC,IAAkC,wBAC3D,mBAAoBM,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,cAAetE,IAAc,aAC/B,EACAq2B,GAAA,oBAA8BC,cCvB9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACuBA,GAAA,iBAAG,OAC3B,IAAI3oB,IAAkCvvI,GAClCimI,IAA8BtjI,GAC9Bg/H,IAAgBz9H,EAMhBi0J,IAAmB,CACrB,iBAAkB5oB,IAAgC,iBAClD,kBAAmBtJ,IAA4B,kBAC/C,mBAAoBtE,IAAc,kBACpC,EACAu2B,GAAA,iBAA2BC,cCjB3B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAG,OACxB,IAAIC,IAA0Br4J,GAC1B2hI,IAAgBh/H,EAMhB21J,IAAgB,CAClB,cAAeD,IAAwB,cACvC,iBAAkB12B,IAAc,gBAClC,EACAy2B,GAAA,cAAwBE,cCfxB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACqBA,GAAA,eAAG,OACzB,IAAIC,IAA2Bx4J,GAC3B2hI,IAAgBh/H,EAMhB81J,IAAiB,CACnB,eAAgBD,IAAyB,eACzC,kBAAmB72B,IAAc,iBACnC,EACA42B,GAAA,eAAyBE,cCfzB,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkCA,GAAA,4BAAG,OACtC,IAAI/yB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBy0J,IAA8B,CAChC,sBAAuBhzB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,sBAAuB5N,IAAc,qBACvC,EACA+2B,GAAA,4BAAsCC,cCjBtC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoCA,GAAA,8BAAG,OACxC,IAAIpe,IAA4Bx6I,GAC5Bm2J,IAA8BxzJ,GAC9B24I,IAA+Bp3I,GAC/BimJ,IAA8BxjJ,GAC9BynI,IAAiC1yH,GACjC2yH,IAAiCnpH,GACjC+gH,IAA8BpuG,GAC9B8pG,IAAgB7pG,EAMhB+gI,IAAgC,CAClC,gBAAiBre,IAA0B,gBAC3C,kBAAmB2b,IAA4B,kBAC/C,mBAAoB7a,IAA6B,mBACjD,kBAAmB6O,IAA4B,kBAC/C,qBAAsB/b,IAA+B,qBACrD,qBAAsBC,IAA+B,qBACrD,kBAAmBpI,IAA4B,kBAC/C,wBAAyBtE,IAAc,uBACzC,EACAi3B,GAAA,8BAAwCC,cC3BxC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EAC0BA,GAAA,oBAAG,OAC9B,IAAIn3B,IAAgB3hI,EAMhB+4J,IAAsB,CACxB,cAAep3B,IAAc,aAC/B,EACAm3B,GAAA,oBAA8BC,cCb9B,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACkCA,GAAA,4BAAG,OACtC,IAAIrzB,IAAuC3lI,GACvC2hI,IAAgBh/H,EAMhBs2J,IAA8B,CAChC,sBAAuBtzB,IAAqC,sBAC5D,sBAAuBhE,IAAc,qBACvC,EACAq3B,GAAA,4BAAsCC,cCftC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACmCA,GAAA,6BAAG,OACvC,IAAIvzB,IAAuC3lI,GACvCuvI,IAAkC5sI,GAClCg/H,IAAgBz9H,EAMhBi1J,IAA+B,CACjC,sBAAuBxzB,IAAqC,sBAC5D,iBAAkB4J,IAAgC,iBAClD,uBAAwB5N,IAAc,sBACxC,EACAu3B,GAAA,6BAAuCC,cCjBvC,OAAO,eAAeC,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACsBA,GAAA,gBAAG,OAC1B,IAAIvzB,IAAyC7lI,GACzCyoI,IAA+B9lI,GAC/BmkI,IAA+B5iI,GAC/B+hI,IAA8Bt/H,GAC9Bg7H,IAAgBjmH,EAMhB29I,IAAkB,CACpB,wBAAyBxzB,IAAuC,wBAChE,mBAAoB4C,IAA6B,mBACjD,mBAAoB3B,IAA6B,mBACjD,kBAAmBb,IAA4B,kBAC/C,UAAWtE,IAAc,SAC3B,EACAy3B,GAAA,gBAA0BC,cCrBtBv5J,IAAUE,GACd,OAAO,eAAes5J,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACUA,GAAA,IAAG,OACd,IAAIC,IAAeC,IAAwB72J,CAA6B,EACxE,SAAS82J,GAAyBC,EAAa,CAAE,GAAI,OAAO,SAAY,WAAY,OAAO,KAAM,IAAIC,EAAoB,IAAI,QAAeC,EAAmB,IAAI,QAAW,OAAQH,GAA2B,SAAkCC,EAAa,CAAE,OAAOA,EAAcE,EAAmBD,CAAkB,GAAID,CAAW,CAAI,CAC/U,SAASF,IAAwBn6J,EAAKq6J,EAAa,CAAE,GAAI,CAACA,GAAer6J,GAAOA,EAAI,WAAc,OAAOA,EAAO,GAAIA,IAAQ,MAAQS,IAAQT,CAAG,IAAM,UAAY,OAAOA,GAAQ,WAAc,MAAO,CAAE,QAAWA,CAAG,EAAM,IAAImmH,EAAQi0C,GAAyBC,CAAW,EAAG,GAAIl0C,GAASA,EAAM,IAAInmH,CAAG,EAAK,OAAOmmH,EAAM,IAAInmH,CAAG,EAAK,IAAIwqH,EAAS,GAAQgwC,EAAwB,OAAO,gBAAkB,OAAO,yBAA0B,QAASl6J,KAAON,EAAO,GAAIM,IAAQ,WAAa,OAAO,UAAU,eAAe,KAAKN,EAAKM,CAAG,EAAG,CAAE,IAAI4xD,EAAOsoG,EAAwB,OAAO,yBAAyBx6J,EAAKM,CAAG,EAAI,KAAU4xD,IAASA,EAAK,KAAOA,EAAK,KAAQ,OAAO,eAAes4D,EAAQlqH,EAAK4xD,CAAI,EAAYs4D,EAAOlqH,CAAG,EAAIN,EAAIM,CAAG,CAAM,CAAG,OAAAkqH,EAAO,QAAaxqH,EAASmmH,GAASA,EAAM,IAAInmH,EAAKwqH,CAAM,EAAYA,CAAS,CAG3yB,IAAI3+E,IAAMquH,IACVD,GAAA,IAAcpuH,iBCXd,OAAO,eAAwB9W,EAAA,aAAc,CAC3C,MAAO,EACT,CAAC,EACD,OAAO,eAAeA,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOsiH,EAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAetiH,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOuiH,EAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAeviH,EAAS,6BAA8B,CAC3D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwiH,EAAqC,0BAC7C,CACH,CAAC,EACD,OAAO,eAAexiH,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOuxG,EAAqC,qBAC7C,CACH,CAAC,EACD,OAAO,eAAevxG,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOyiH,EAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAeziH,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOy+G,GAAiC,iBACzC,CACH,CAAC,EACD,OAAO,eAAez+G,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwxG,GAAmC,mBAC3C,CACH,CAAC,EACD,OAAO,eAAexxG,EAAS,8BAA+B,CAC5D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0iH,GAAsC,2BAC9C,CACH,CAAC,EACD,OAAO,eAAe1iH,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2iH,GAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAe3iH,EAAS,0BAA2B,CACxD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOyxG,GAAuC,uBAC/C,CACH,CAAC,EACD,OAAO,eAAezxG,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0lI,GAAiC,aACzC,CACH,CAAC,EACD,OAAO,eAAe1lI,EAAS,4BAA6B,CAC1D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOm0H,GAAyC,yBACjD,CACH,CAAC,EACD,OAAO,eAAen0H,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0xG,GAAoC,oBAC5C,CACH,CAAC,EACD,OAAO,eAAe1xG,EAAS,qCAAsC,CACnE,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4iH,GAA6C,kCACrD,CACH,CAAC,EACD,OAAO,eAAe5iH,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6iH,GAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAe7iH,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0vH,GAAgC,gBACxC,CACH,CAAC,EACD,OAAO,eAAe1vH,EAAS,mCAAoC,CACjE,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOq/G,GAAgD,gCACxD,CACH,CAAC,EACD,OAAO,eAAer/G,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOggH,GAAiC,iBACzC,CACH,CAAC,EACD,OAAO,eAAehgH,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8iH,GAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAe9iH,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2lI,GAA+B,oBACvC,CACH,CAAC,EACD,OAAO,eAAe3lI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4lI,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAe5lI,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6lI,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAe7lI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8lI,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAe9lI,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+lI,GAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAe/lI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkxG,GAAkC,kBAC1C,CACH,CAAC,EACD,OAAO,eAAelxG,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgmI,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAehmI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6yG,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAe7yG,EAAS,yBAA0B,CACvD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+iH,GAAiC,sBACzC,CACH,CAAC,EACD,OAAO,eAAe/iH,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgjH,GAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAehjH,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOimI,GAAkC,cAC1C,CACH,CAAC,EACD,OAAO,eAAejmI,EAAS,8BAA+B,CAC5D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOijH,GAAsC,2BAC9C,CACH,CAAC,EACD,OAAO,eAAejjH,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+5H,GAAkC,kBAC1C,CACH,CAAC,EACD,OAAO,eAAe/5H,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkmI,GAAiC,iBACzC,CACH,CAAC,EACD,OAAO,eAAelmI,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkjH,GAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAeljH,EAAS,6BAA8B,CAC3D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmjH,GAAqC,0BAC7C,CACH,CAAC,EACD,OAAO,eAAenjH,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOw9G,GAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAex9G,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmmI,GAA8B,mBACtC,CACH,CAAC,EACD,OAAO,eAAenmI,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOomI,GAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAepmI,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOs0H,GAA+B,eACvC,CACH,CAAC,EACD,OAAO,eAAet0H,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOuyG,GAAwC,wBAChD,CACH,CAAC,EACD,OAAO,eAAevyG,EAAS,yBAA0B,CACvD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOuhH,GAAiC,sBACzC,CACH,CAAC,EACD,OAAO,eAAevhH,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOm7G,GAAgC,gBACxC,CACH,CAAC,EACD,OAAO,eAAen7G,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOo6G,EAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAep6G,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqmI,EAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAermI,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOsmI,EAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAetmI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOumI,EAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAevmI,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwmI,EAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAexmI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOymI,EAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAezmI,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0mI,EAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAe1mI,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOomH,EAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAepmH,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOo0G,EAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAep0G,EAAS,MAAO,CACpC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2mI,GAAiB,GACzB,CACH,CAAC,EACD,OAAO,eAAe3mI,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4mI,EAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAe5mI,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+hI,EAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAe/hI,EAAS,6BAA8B,CAC3D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6mI,EAAqC,0BAC7C,CACH,CAAC,EACD,OAAO,eAAe7mI,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8mI,EAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAe9mI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+mI,EAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAe/mI,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgnI,EAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAehnI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOinI,EAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAejnI,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOknI,EAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAelnI,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmnI,EAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAennI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOyqH,EAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAezqH,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOonI,EAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAepnI,EAAS,yBAA0B,CACvD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqnI,EAAiC,sBACzC,CACH,CAAC,EACD,OAAO,eAAernI,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOsnI,EAA+B,oBACvC,CACH,CAAC,EACD,OAAO,eAAetnI,EAAS,0BAA2B,CACxD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunI,EAAkC,uBAC1C,CACH,CAAC,EACD,OAAO,eAAevnI,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO82G,EAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAe92G,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwnI,EAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAexnI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOynI,EAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAeznI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0nI,EAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAe1nI,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2nI,EAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAe3nI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4nI,EAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAe5nI,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6nI,EAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAe7nI,EAAS,yBAA0B,CACvD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8nI,EAAiC,sBACzC,CACH,CAAC,EACD,OAAO,eAAe9nI,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+nI,EAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAe/nI,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgoI,GAA8B,mBACtC,CACH,CAAC,EACD,OAAO,eAAehoI,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOioI,EAA8B,mBACtC,CACH,CAAC,EACD,OAAO,eAAejoI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO27H,EAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAe37H,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+3G,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAe/3G,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkoI,GAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAeloI,EAAS,sCAAuC,CACpE,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmoI,GAA8C,mCACtD,CACH,CAAC,EACD,OAAO,eAAenoI,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOooI,GAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAepoI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0qH,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAe1qH,EAAS,8BAA+B,CAC5D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqoI,GAAsC,2BAC9C,CACH,CAAC,EACD,OAAO,eAAeroI,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOm8G,GAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAen8G,EAAS,kCAAmC,CAChE,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOsoI,GAA0C,+BAClD,CACH,CAAC,EACD,OAAO,eAAetoI,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0gH,GAA8B,mBACtC,CACH,CAAC,EACD,OAAO,eAAe1gH,EAAS,6BAA8B,CAC3D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOs/H,EAAqC,0BAC7C,CACH,CAAC,EACD,OAAO,eAAet/H,EAAS,0BAA2B,CACxD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4rH,GAAkC,uBAC1C,CACH,CAAC,EACD,OAAO,eAAe5rH,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOuoI,GAA8B,mBACtC,CACH,CAAC,EACD,OAAO,eAAevoI,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2pH,GAA8B,mBACtC,CACH,CAAC,EACD,OAAO,eAAe3pH,EAAS,0BAA2B,CACxD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwoI,GAAkC,uBAC1C,CACH,CAAC,EACD,OAAO,eAAexoI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOq0G,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAer0G,EAAS,8BAA+B,CAC5D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOyoI,GAAsC,2BAC9C,CACH,CAAC,EACD,OAAO,eAAezoI,EAAS,iCAAkC,CAC/D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0oI,GAAyC,8BACjD,CACH,CAAC,EACD,OAAO,eAAe1oI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOi5G,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAej5G,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2qH,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAe3qH,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2oI,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAe3oI,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4oI,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAe5oI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6oI,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAe7oI,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8oI,EAA8B,mBACtC,CACH,CAAC,EACD,OAAO,eAAe9oI,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+oI,GAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAe/oI,EAAS,yBAA0B,CACvD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgpI,GAAiC,sBACzC,CACH,CAAC,EACD,OAAO,eAAehpI,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOipI,GAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAejpI,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkpI,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAelpI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmpI,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAenpI,EAAS,yBAA0B,CACvD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOg1H,GAAiC,sBACzC,CACH,CAAC,EACD,OAAO,eAAeh1H,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOopI,EAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAeppI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqpI,EAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAerpI,EAAS,8BAA+B,CAC5D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOspI,GAAsC,2BAC9C,CACH,CAAC,EACD,OAAO,eAAetpI,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO06H,GAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAe16H,EAAS,yBAA0B,CACvD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOupI,GAAiC,sBACzC,CACH,CAAC,EACD,OAAO,eAAevpI,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOq6G,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAer6G,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwpI,GAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAexpI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4qH,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAe5qH,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOypI,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAezpI,EAAS,4BAA6B,CAC1D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0pI,GAAoC,yBAC5C,CACH,CAAC,EACD,OAAO,eAAe1pI,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2pI,GAA+B,oBACvC,CACH,CAAC,EACD,OAAO,eAAe3pI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOknH,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAelnH,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO85G,GAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAe95G,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOs5G,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAet5G,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqtH,GAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAertH,EAAS,0BAA2B,CACxD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4pI,GAAkC,uBAC1C,CACH,CAAC,EACD,OAAO,eAAe5pI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6pI,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAe7pI,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOikI,GAAwB,aAChC,CACH,CAAC,EACD,OAAO,eAAejkI,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8pI,GAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAe9pI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOi1H,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAej1H,EAAS,+BAAgC,CAC7D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+pI,GAAuC,4BAC/C,CACH,CAAC,EACD,OAAO,eAAe/pI,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgqI,GAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAehqI,EAAS,+BAAgC,CAC7D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOiqI,GAAuC,4BAC/C,CACH,CAAC,EACD,OAAO,eAAejqI,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO46G,EAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAe56G,EAAS,0BAA2B,CACxD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoyG,EAAkC,uBAC1C,CACH,CAAC,EACD,OAAO,eAAepyG,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkqI,EAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAelqI,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmqI,EAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAenqI,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO45H,EAA+B,oBACvC,CACH,CAAC,EACD,OAAO,eAAe55H,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOstH,EAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAettH,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoqI,GAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAepqI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqqI,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAerqI,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOo8G,GAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAep8G,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOsqI,GAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAetqI,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOuqI,GAA8B,mBACtC,CACH,CAAC,EACD,OAAO,eAAevqI,EAAS,4BAA6B,CAC1D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwqI,GAAoC,yBAC5C,CACH,CAAC,EACD,OAAO,eAAexqI,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOiwH,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAejwH,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOyqI,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAezqI,EAAS,8BAA+B,CAC5D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0qI,GAAsC,2BAC9C,CACH,CAAC,EACD,OAAO,eAAe1qI,EAAS,4BAA6B,CAC1D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2qI,GAAoC,yBAC5C,CACH,CAAC,EACD,OAAO,eAAe3qI,EAAS,6BAA8B,CAC3D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4qI,GAAqC,0BAC7C,CACH,CAAC,EACD,OAAO,eAAe5qI,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO66G,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAe76G,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwpH,GAA8B,mBACtC,CACH,CAAC,EACD,OAAO,eAAexpH,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOg4G,GAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAeh4G,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6qI,GAA8B,mBACtC,CACH,CAAC,EACD,OAAO,eAAe7qI,EAAS,+BAAgC,CAC7D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8qI,GAAuC,4BAC/C,CACH,CAAC,EACD,OAAO,eAAe9qI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO86G,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAe96G,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+2G,GAA+B,oBACvC,CACH,CAAC,EACD,OAAO,eAAe/2G,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO87G,GAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAe97G,EAAS,0BAA2B,CACxD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+qI,GAAkC,uBAC1C,CACH,CAAC,EACD,OAAO,eAAe/qI,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgrI,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAehrI,EAAS,gCAAiC,CAC9D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOirI,GAAwC,6BAChD,CACH,CAAC,EACD,OAAO,eAAejrI,EAAS,kCAAmC,CAChE,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkrI,GAA0C,+BAClD,CACH,CAAC,EACD,OAAO,eAAelrI,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmrI,GAA8B,mBACtC,CACH,CAAC,EACD,OAAO,eAAenrI,EAAS,4BAA6B,CAC1D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOorI,GAAoC,yBAC5C,CACH,CAAC,EACD,OAAO,eAAeprI,EAAS,8BAA+B,CAC5D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqrI,GAAsC,2BAC9C,CACH,CAAC,EACD,OAAO,eAAerrI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOsrI,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAetrI,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOurI,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAevrI,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwrI,GAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAexrI,EAAS,gBAAiB,CAC9C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOutH,GAAwB,aAChC,CACH,CAAC,EACD,OAAO,eAAevtH,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOs6G,GAA+B,oBACvC,CACH,CAAC,EACD,OAAO,eAAet6G,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOyrI,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAezrI,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6qH,GAAyB,cACjC,CACH,CAAC,EACD,OAAO,eAAe7qH,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOu1H,GAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAev1H,EAAS,6BAA8B,CAC3D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0rI,GAAqC,0BAC7C,CACH,CAAC,EACD,OAAO,eAAe1rI,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2rI,GAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAe3rI,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOy6G,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAez6G,EAAS,wCAAyC,CACtE,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4rI,GAAgD,qCACxD,CACH,CAAC,EACD,OAAO,eAAe5rI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6rI,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAe7rI,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOi0G,GAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAej0G,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+1H,GAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAe/1H,EAAS,yBAA0B,CACvD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOq8G,GAAiC,sBACzC,CACH,CAAC,EACD,OAAO,eAAer8G,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+6G,GAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAe/6G,EAAS,yBAA0B,CACvD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6jH,GAAiC,sBACzC,CACH,CAAC,EACD,OAAO,eAAe7jH,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8rI,GAA8B,mBACtC,CACH,CAAC,EACD,OAAO,eAAe9rI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+5G,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAe/5G,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+rI,GAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAe/rI,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgsI,GAA+B,oBACvC,CACH,CAAC,EACD,OAAO,eAAehsI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOisI,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAejsI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOs8G,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAet8G,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4/G,GAA+B,oBACvC,CACH,CAAC,EACD,OAAO,eAAe5/G,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOksI,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAelsI,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmsI,GAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAensI,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOosI,GAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAepsI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqsI,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAersI,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOssI,GAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAetsI,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOusI,GAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAevsI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwtH,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAextH,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgyH,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAehyH,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwsI,GAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAexsI,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOysI,GAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAezsI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO20H,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAe30H,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO40H,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAe50H,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOw1H,GAA8B,mBACtC,CACH,CAAC,EACD,OAAO,eAAex1H,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0sI,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAe1sI,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2sI,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAe3sI,EAAS,+BAAgC,CAC7D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4sI,GAAuC,4BAC/C,CACH,CAAC,EACD,OAAO,eAAe5sI,EAAS,kCAAmC,CAChE,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6sI,GAA0C,+BAClD,CACH,CAAC,EACD,OAAO,eAAe7sI,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOiyH,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAejyH,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8sI,GAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAe9sI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0yG,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAe1yG,EAAS,gCAAiC,CAC9D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8qH,GAAwC,6BAChD,CACH,CAAC,EACD,OAAO,eAAe9qH,EAAS,iCAAkC,CAC/D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+sI,GAAyC,8BACjD,CACH,CAAC,EACD,OAAO,eAAe/sI,EAAS,6BAA8B,CAC3D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgtI,GAAqC,0BAC7C,CACH,CAAC,EACD,OAAO,eAAehtI,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwhI,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAexhI,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOitI,GAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAejtI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOktI,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAeltI,EAAS,4BAA6B,CAC1D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmtI,GAAoC,yBAC5C,CACH,CAAC,EACD,OAAO,eAAentI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOq2H,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAer2H,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOotI,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAeptI,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqtI,GAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAertI,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkxH,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAelxH,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOstI,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAettI,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOutI,GAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAevtI,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwtI,GAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAextI,EAAS,kCAAmC,CAChE,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOytI,GAA0C,+BAClD,CACH,CAAC,EACD,OAAO,eAAeztI,EAAS,0BAA2B,CACxD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0tI,GAAkC,uBAC1C,CACH,CAAC,EACD,OAAO,eAAe1tI,EAAS,0BAA2B,CACxD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2tI,GAAkC,uBAC1C,CACH,CAAC,EACD,OAAO,eAAe3tI,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOg6G,GAA+B,oBACvC,CACH,CAAC,EACD,OAAO,eAAeh6G,EAAS,6BAA8B,CAC3D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOk5G,GAAqC,0BAC7C,CACH,CAAC,EACD,OAAO,eAAel5G,EAAS,0BAA2B,CACxD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4tI,GAAkC,uBAC1C,CACH,CAAC,EACD,OAAO,eAAe5tI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOo1H,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAep1H,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO40G,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAe50G,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6tI,GAA8B,mBACtC,CACH,CAAC,EACD,OAAO,eAAe7tI,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8tI,GAA+B,oBACvC,CACH,CAAC,EACD,OAAO,eAAe9tI,EAAS,8BAA+B,CAC5D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+tI,GAAsC,2BAC9C,CACH,CAAC,EACD,OAAO,eAAe/tI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOguI,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAehuI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOg3G,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAeh3G,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOm3G,GAA8B,mBACtC,CACH,CAAC,EACD,OAAO,eAAen3G,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOiuI,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAejuI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkuI,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAeluI,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmuI,GAAyB,cACjC,CACH,CAAC,EACD,OAAO,eAAenuI,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOsjH,GAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAetjH,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOouI,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAepuI,EAAS,8BAA+B,CAC5D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOk2H,GAAsC,2BAC9C,CACH,CAAC,EACD,OAAO,eAAel2H,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOquI,GAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAeruI,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOsuI,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAetuI,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOokI,GAAyB,cACjC,CACH,CAAC,EACD,OAAO,eAAepkI,EAAS,yBAA0B,CACvD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOuuI,GAAiC,sBACzC,CACH,CAAC,EACD,OAAO,eAAevuI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwuI,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAexuI,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOyuI,GAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAezuI,EAAS,6BAA8B,CAC3D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0uI,GAAqC,0BAC7C,CACH,CAAC,EACD,OAAO,eAAe1uI,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2uI,GAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAe3uI,EAAS,yBAA0B,CACvD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4uI,GAAiC,sBACzC,CACH,CAAC,EACD,OAAO,eAAe5uI,EAAS,gCAAiC,CAC9D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6uI,GAAwC,6BAChD,CACH,CAAC,EACD,OAAO,eAAe7uI,EAAS,yBAA0B,CACvD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8uI,GAAiC,sBACzC,CACH,CAAC,EACD,OAAO,eAAe9uI,EAAS,6BAA8B,CAC3D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+uI,GAAqC,0BAC7C,CACH,CAAC,EACD,OAAO,eAAe/uI,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOg7G,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAeh7G,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgvI,GAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAehvI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOglH,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAehlH,EAAS,yBAA0B,CACvD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOivI,GAAiC,sBACzC,CACH,CAAC,EACD,OAAO,eAAejvI,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+qH,GAAyB,cACjC,CACH,CAAC,EACD,OAAO,eAAe/qH,EAAS,0BAA2B,CACxD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkvI,GAAkC,uBAC1C,CACH,CAAC,EACD,OAAO,eAAelvI,EAAS,mCAAoC,CACjE,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmvI,GAA2C,gCACnD,CACH,CAAC,EACD,OAAO,eAAenvI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOovI,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAepvI,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqvI,GAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAervI,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOigH,GAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAejgH,EAAS,6BAA8B,CAC3D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOsvI,GAAqC,0BAC7C,CACH,CAAC,EACD,OAAO,eAAetvI,EAAS,0BAA2B,CACxD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOuvI,GAAkC,uBAC1C,CACH,CAAC,EACD,OAAO,eAAevvI,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgrH,GAAyB,cACjC,CACH,CAAC,EACD,OAAO,eAAehrH,EAAS,oCAAqC,CAClE,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwvI,GAA4C,iCACpD,CACH,CAAC,EACD,OAAO,eAAexvI,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOyvI,GAA+B,oBACvC,CACH,CAAC,EACD,OAAO,eAAezvI,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0vI,GAA8B,mBACtC,CACH,CAAC,EACD,OAAO,eAAe1vI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2vI,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAe3vI,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqnH,GAA8B,mBACtC,CACH,CAAC,EACD,OAAO,eAAernH,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4vI,GAA8B,mBACtC,CACH,CAAC,EACD,OAAO,eAAe5vI,EAAS,8BAA+B,CAC5D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6vI,GAAsC,2BAC9C,CACH,CAAC,EACD,OAAO,eAAe7vI,EAAS,4BAA6B,CAC1D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8vI,GAAoC,yBAC5C,CACH,CAAC,EACD,OAAO,eAAe9vI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+vI,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAe/vI,EAAS,6BAA8B,CAC3D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOi+H,GAAqC,0BAC7C,CACH,CAAC,EACD,OAAO,eAAej+H,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO03G,GAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAe13G,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgwI,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAehwI,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOiwI,GAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAejwI,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkwI,GAA8B,mBACtC,CACH,CAAC,EACD,OAAO,eAAelwI,EAAS,4BAA6B,CAC1D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmwI,GAAoC,yBAC5C,CACH,CAAC,EACD,OAAO,eAAenwI,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOy1H,GAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAez1H,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOowI,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAepwI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqwI,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAerwI,EAAS,8BAA+B,CAC5D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOswI,GAAsC,2BAC9C,CACH,CAAC,EACD,OAAO,eAAetwI,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOuwI,GAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAevwI,EAAS,4BAA6B,CAC1D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOugI,GAAoC,yBAC5C,CACH,CAAC,EACD,OAAO,eAAevgI,EAAS,0BAA2B,CACxD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwwI,GAAkC,uBAC1C,CACH,CAAC,EACD,OAAO,eAAexwI,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0gI,GAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAe1gI,EAAS,0BAA2B,CACxD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOywI,EAAkC,uBAC1C,CACH,CAAC,EACD,OAAO,eAAezwI,EAAS,8BAA+B,CAC5D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0wI,GAAsC,2BAC9C,CACH,CAAC,EACD,OAAO,eAAe1wI,EAAS,0BAA2B,CACxD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2wI,GAAkC,uBAC1C,CACH,CAAC,EACD,OAAO,eAAe3wI,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4wI,GAA8B,mBACtC,CACH,CAAC,EACD,OAAO,eAAe5wI,EAAS,+BAAgC,CAC7D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2gI,GAAuC,4BAC/C,CACH,CAAC,EACD,OAAO,eAAe3gI,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6wI,GAA+B,oBACvC,CACH,CAAC,EACD,OAAO,eAAe7wI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8pH,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAe9pH,EAAS,+BAAgC,CAC7D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOsnH,GAAuC,4BAC/C,CACH,CAAC,EACD,OAAO,eAAetnH,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOunH,GAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAevnH,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0nH,GAA+B,oBACvC,CACH,CAAC,EACD,OAAO,eAAe1nH,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOirH,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAejrH,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8wI,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAe9wI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOm5G,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAen5G,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO60H,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAe70H,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOk/G,GAA8B,mBACtC,CACH,CAAC,EACD,OAAO,eAAel/G,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6/G,GAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAe7/G,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+wI,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAe/wI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgxI,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAehxI,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOixI,GAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAejxI,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkxI,GAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAelxI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOuoH,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAevoH,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmxI,GAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAenxI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoxI,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAepxI,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqxI,GAA8B,mBACtC,CACH,CAAC,EACD,OAAO,eAAerxI,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOsxI,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAetxI,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOuxI,GAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAevxI,EAAS,8BAA+B,CAC5D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwxI,GAAsC,2BAC9C,CACH,CAAC,EACD,OAAO,eAAexxI,EAAS,yBAA0B,CACvD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOy8G,GAAiC,sBACzC,CACH,CAAC,EACD,OAAO,eAAez8G,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOyxI,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAezxI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8yG,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAe9yG,EAAS,8BAA+B,CAC5D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0xI,GAAsC,2BAC9C,CACH,CAAC,EACD,OAAO,eAAe1xI,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOi6G,GAA+B,oBACvC,CACH,CAAC,EACD,OAAO,eAAej6G,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkyH,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAelyH,EAAS,2BAA4B,CACzD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2xI,GAAmC,wBAC3C,CACH,CAAC,EACD,OAAO,eAAe3xI,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO41H,GAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAe51H,EAAS,4BAA6B,CAC1D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4xI,GAAoC,yBAC5C,CACH,CAAC,EACD,OAAO,eAAe5xI,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6xI,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAe7xI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO8xI,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAe9xI,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOytH,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAeztH,EAAS,kCAAmC,CAChE,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+xI,GAA0C,+BAClD,CACH,CAAC,EACD,OAAO,eAAe/xI,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgyI,GAAyB,cACjC,CACH,CAAC,EACD,OAAO,eAAehyI,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOiyI,GAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAejyI,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6lH,GAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAe7lH,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkyI,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAelyI,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO47H,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAe57H,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO6xG,GAA4B,iBACpC,CACH,CAAC,EACD,OAAO,eAAe7xG,EAAS,yBAA0B,CACvD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO25G,GAAiC,sBACzC,CACH,CAAC,EACD,OAAO,eAAe35G,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqmH,GAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAermH,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmyI,GAA8B,mBACtC,CACH,CAAC,EACD,OAAO,eAAenyI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOoyI,GAAmC,gBAC3C,CACH,CAAC,EACD,OAAO,eAAepyI,EAAS,wBAAyB,CACtD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmrH,GAAgC,qBACxC,CACH,CAAC,EACD,OAAO,eAAenrH,EAAS,qBAAsB,CACnD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkrH,GAA6B,kBACrC,CACH,CAAC,EACD,OAAO,eAAelrH,EAAS,8BAA+B,CAC5D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOqyI,GAAsC,2BAC9C,CACH,CAAC,EACD,OAAO,eAAeryI,EAAS,uBAAwB,CACrD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOkiI,GAA+B,oBACvC,CACH,CAAC,EACD,OAAO,eAAeliI,EAAS,gCAAiC,CAC9D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOsyI,GAAwC,6BAChD,CACH,CAAC,EACD,OAAO,eAAetyI,EAAS,sBAAuB,CACpD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOuyI,GAA8B,mBACtC,CACH,CAAC,EACD,OAAO,eAAevyI,EAAS,8BAA+B,CAC5D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwyI,GAAsC,2BAC9C,CACH,CAAC,EACD,OAAO,eAAexyI,EAAS,+BAAgC,CAC7D,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOyyI,GAAuC,4BAC/C,CACH,CAAC,EACD,OAAO,eAAezyI,EAAS,mBAAoB,CACjD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmxH,GAA2B,gBACnC,CACH,CAAC,EACD,OAAO,eAAenxH,EAAS,kBAAmB,CAChD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0yI,GAA0B,eAClC,CACH,CAAC,EACD,OAAO,eAAe1yI,EAAS,oBAAqB,CAClD,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO60G,GAA4B,iBACpC,CACH,CAAC,EACD,IAAIuF,EAA4BxuI,GAC5B02I,EAAqC/zI,GACrC83J,EAA6Bv2J,GAC7Bw2J,EAA8B/zJ,GAC9Bg0J,EAA6Bj/I,GAC7Bk/I,EAA8B11I,GAC9B21I,EAA6BhjI,GAC7BijI,EAA8BhjI,GAC9B0iH,EAA4BziH,GAC5BywG,EAAkCxwG,GAClCgjI,EAA4BzsG,GAC5B4nG,EAA8B3uF,GAC9ByzF,EAAuCvzF,GACvCwzF,EAA4B/wF,GAC5BwsE,EAAkCzmE,GAClCirF,EAA6BhrF,GAC7BirF,EAA8BhrF,GAC9BirF,EAA6BpmE,GAC7BqmE,EAA8BnmE,GAC9ByhD,EAAuCxhD,GACvCypD,EAA6BvpD,GAC7BimE,EAA8BhmE,GAC9BimE,EAA8BhmE,GAC9BimE,EAAmC/lE,GACnCgmE,EAAiC/lE,GACjCgmE,EAAoC9lE,GACpC8vC,EAAuC5vC,GACvCm1C,EAAkCl1C,GAClC4lE,EAA4B3lE,GAC5B4lE,EAA+B3lE,GAC/B4lE,EAA+B3lE,GAC/B4lE,EAA8B3lE,GAC9B4lE,EAA+B1lE,GAC/BugD,EAAkCrgD,GAClCylE,EAAqCvlE,GACrCwlE,EAAmCtlE,GACnCulE,EAAkCrlE,GAClCslE,GAAgCrlE,GAChCslE,EAAgCplE,GAChC84D,EAA6B54D,GAC7Bg1C,GAA6B90C,GAC7BilE,GAA8B/kE,GAC9Bs7C,GAAmCp7C,GACnC8kE,GAAgD5kE,GAChD6kE,GAA8B3kE,GAC9BinD,GAA+B/mD,GAC/B0kE,GAAwCxkE,GACxCs4C,GAAqCp4C,GACrCukE,GAA4CrkE,GAC5Cy8C,GAAgCv8C,GAChCm7D,EAAuCj7D,GACvCunD,GAAoCrnD,GACpCgkE,GAAgC9jE,GAChCklD,GAAgChlD,GAChC6sC,GAAqC3sC,GACrC2jE,GAAoCzjE,GACpCsvC,GAA+BpvC,GAC/BwjE,GAAwCtjE,GACxCu9C,GAAwCr9C,GACxCqjE,GAA2CnjE,GAC3C0zC,GAA6BxzC,GAC7Bk9C,GAAqCh9C,GACrCglD,GAA4B9kD,GAC5B8iE,GAA6B5iE,GAC7B6iE,GAA4B5iE,GAC5B6iE,GAA6B3iE,GAC7B4iE,EAAgC1iE,GAChC2iE,GAA8BziE,GAC9B0iE,GAAmCxiE,GACnCyiE,GAA8BviE,GAC9BwiE,GAA4BtiE,GAC5BuiE,GAA6BriE,GAC7BkuD,GAAmChuD,GACnCoiE,EAA6BniE,GAC7BoiE,EAA+BliE,GAC/BmiE,GAAwCjiE,GACxCqzD,GAAkCpzD,GAClCmqC,GAAyCjqC,GACzC+hE,GAAmC7hE,GACnC2yC,GAA4BzyC,GAC5B4hE,GAAqC1hE,GACrC8iD,GAA6B5iD,GAC7ByhE,GAA6BvhE,GAC7BwhE,GAAsCthE,GACtCuhE,GAAiCrhE,GACjC4+C,GAA+B1+C,GAC/BsxC,GAAqCpxC,GACrC4wC,GAA4B1wC,GAC5BykD,GAAkCvkD,GAClC8gE,GAAoC5gE,GACpC6gE,GAA+B3gE,GAC/B+6D,GAA0B76D,GAC1B0gE,GAAqCxgE,GACrC2rD,GAA6BzrD,GAC7BugE,GAAyCrgE,GACzCsgE,GAAqCpgE,GACrCqgE,GAAyCngE,GACzC8wC,EAA8B5wC,GAC9BooC,EAAoCloC,GACpCggE,EAAkC9/D,GAClC+/D,EAA4B7/D,GAC5BsvD,EAAiCpvD,GACjC8iD,EAA4B5iD,GAC5B2/D,GAA6Bz/D,GAC7Bw/D,GAA8Bt/D,GAC9BsxC,GAAkCpxC,GAClCs/D,GAA8Bp/D,GAC9Bq/D,GAAgCn/D,GAChCo/D,GAAsCl/D,GACtC2kD,GAA4BzkD,GAC5B2oD,GAA2CzoD,GAC3C++D,GAA+B7+D,GAC/B8+D,GAAwC7+D,GACxC8+D,GAAsC7+D,GACtC8+D,GAAuC5+D,GACvC6uC,GAA4B5uC,GAC5Bu9C,GAAgCr9C,GAChC6rC,GAA8B3rC,GAC9Bw+D,GAAgCv+D,GAChCw+D,GAAyCv+D,GACzCuuC,GAA+BruC,GAC/BsqC,GAAiCpqC,GACjC+kC,GAAsC7kC,GACtC+1C,GAA+C71C,GAC/C81C,GAAqC71C,GACrC8uC,GAA8B5uC,GAC9B69D,GAAoC59D,GACpC69D,GAA4B39D,GAC5B49D,GAA0C19D,GAC1C29D,GAA4C19D,GAC5C29D,GAAgC19D,GAChC29D,GAAsCz9D,GACtC09D,GAAwCx9D,GACxCy9D,GAA6Bv9D,GAC7B2hD,GAAkC1hD,GAClCu9D,GAA4Bt9D,GAC5Bu9D,GAA8Br9D,GAC9Bo/C,GAA0Bn/C,GAC1BksC,GAAiCjsC,GACjCo9D,GAA6Bl9D,GAC7Bs8C,GAA2Bp8C,GAC3B4wC,GAAkD3wC,GAClD6mD,GAA8B5mD,GAC9BqxC,GAAmCpxC,GACnCk0C,GAAkCj0C,GAClC68D,GAAuC58D,GACvC62D,GAAiC32D,GACjC28D,GAAkC18D,GAClCwrC,GAA4BvrC,GAC5B08D,GAAkDz8D,GAClD08D,GAA+Bx8D,GAC/B4kC,GAAkC3kC,GAClCymD,GAA8BvmD,GAC9B6sC,GAAmC3sC,GACnCqrC,GAAkCnrC,GAClCi0C,GAAmC/zC,GACnCg8D,GAAgC97D,GAChC+pC,GAA+B7pC,GAC/B67D,GAAqC37D,GACrC47D,GAAiC17D,GACjC27D,GAA6Bz7D,GAC7Bo1D,GAA6Bl1D,GAC7Bm1D,GAA4Bj1D,GAC5Bk1D,GAA+Bj1D,GAC/Bk1D,GAA8Bh1D,GAC9BurC,GAA+BtrC,GAC/B4uC,GAAiC1uC,GACjCg7D,GAA4B96D,GAC5B+6D,GAAkC76D,GAClC86D,GAAkC56D,GAClC66D,GAA+B36D,GAC/BsgD,GAA4BpgD,GAC5B06D,GAA8Bz6D,GAC9B06D,GAA8Bx6D,GAC9By7C,GAA6Bv7C,GAC7Bu6D,GAAkCr6D,GAClCwiD,GAA+BtiD,GAC/Bo6D,GAAkCl6D,GAClCqiD,GAA4BniD,GAC5B+iD,GAAgC7iD,GAChC+5D,GAA6B75D,GAC7B85D,GAA4B55D,GAC5B65D,GAAyC35D,GACzC45D,GAA4C15D,GAC5C8+C,GAA4B5+C,GAC5By5D,GAAqCx5D,GACrCo/B,GAA+Bl/B,GAC/B09B,GAAoCx9B,GACpCo3C,GAA0Cn3C,GAC1Co5D,GAA2Cn5D,GAC3Co5D,GAAuCn5D,GACvC2tD,GAA4BztD,GAC5Bk5D,GAAqCh5D,GACrCi5D,GAA6B/4D,GAC7Bg5D,GAAsC94D,GACtCgiD,GAA+B9hD,GAC/B64D,GAA4B34D,GAC5B44D,GAAqC14D,GACrCu8C,GAA4Br8C,GAC5By4D,GAA6Bv4D,GAC7By4D,GAAkCv4D,GAClCs4D,GAAqCp4D,GACrCs4D,GAA4Cp4D,GAC5Cq4D,GAAoCn4D,GACpCo4D,GAAoCl4D,GACpCukC,GAAiCrkC,GACjCujC,GAAuCrjC,GACvCmwD,GAA4BjwD,GAC5B63D,GAAoC33D,GACpC48B,GAA6B18B,GAC7Bi/C,GAA6B/+C,GAC7Bu+B,GAA4Br+B,GAC5Bs3D,GAAgCp3D,GAChCq3D,GAAiCn3D,GACjCo3D,GAAwCl3D,GACxCm3D,GAA6Bj3D,GAC7BigC,GAA+B//B,GAC/BkgC,GAAgChgC,GAChC4rC,GAAmC1rC,GACnC42D,GAA4B12D,GAC5B22D,GAA6Bz2D,GAC7BurC,GAAqCrrC,GACrCw2D,GAA2Bt2D,GAC3BorC,GAAwClrC,GACxCurC,GAA8BtrC,GAC9Bo2D,GAA+Bl2D,GAC/B6hD,GAAoC3hD,GACpC89C,GAAwC59C,GACxC+1D,GAAqC91D,GACrC+1D,GAA4B71D,GAC5B2rD,GAA2BzrD,GAC3B41D,GAAmC11D,GACnC21D,GAA6Bz1D,GAC7B01D,GAAqCx1D,GACrCy1D,GAAuCv1D,GACvCw1D,GAAqCt1D,GACrCu1D,GAAmCt1D,GACnCu1D,GAA0Cr1D,GAC1Cs1D,GAAmCpkC,GACnCqkC,GAAuCpkC,GACvCqQ,GAA4BpQ,GAC5BokC,GAA8BnkC,GAC9Bma,GAA6Bla,GAC7BmkC,GAAmClkC,GACnCggB,GAA2B/f,GAC3BkkC,GAAoCjkC,GACpCkkC,GAA6CjkC,GAC7CkkC,GAA+BjkC,GAC/BkkC,GAAkCjkC,GAClC6U,GAA8B5U,GAC9B66B,GAAmC56B,GACnC4X,GAAkC3X,GAClC+jC,GAAuC9jC,GACvC+jC,GAAoC9jC,GACpCuf,GAA2Btf,GAC3B8jC,GAA8C7jC,GAC9CwX,GAAuCvX,GACvC6jC,GAAiC5jC,GACjC6jC,GAAgC5jC,GAChC6jC,GAA+B5jC,GAC/Bsb,GAAgCrb,GAChCwR,GAAkCvR,GAClC2jC,GAAgC1jC,GAChC2jC,GAAwC1jC,GACxC2jC,GAAsC1jC,GACtC2jC,GAA+B1jC,GAC/B4xB,GAAuC3xB,GACvCoL,GAA8BnL,GAC9ByjC,GAA4BxjC,GAC5ByjC,GAAqCxjC,GACrCyjC,GAAgCxjC,GAChCy5B,GAAgCx5B,GAChCy5B,GAA8Bx5B,GAC9BujC,GAAsCtjC,GACtC4oB,GAA8B3oB,GAC9BsjC,GAA4BrjC,GAC5BsjC,GAA6BrjC,GAC7BsjC,GAAwCrjC,GACxCsjC,GAAqCrjC,GACrCqzB,GAAsCpzB,GACtCqjC,GAAoCpjC,GACpCszB,GAAqCrzB,GACrCojC,EAAoCkC,GACpCjC,GAAwCkC,GACxCjC,GAAoCkC,GACpCjC,GAAgCkC,GAChCnS,GAAyCoS,GACzClC,GAAiCmC,GACjClpB,GAA6BmpB,GAC7BvrB,GAAiCwrB,GACjC5rB,GAAyC6rB,GACzC5rB,GAAqC6rB,GACrCnoB,GAA4BooB,GAC5BvC,GAA6BwC,GAC7Bn6B,GAA6Bo6B,GAC7B1e,GAA4B2e,GAC5Bt0B,GAAgCu0B,GAChC5zB,GAAkC6zB,GAClC3C,GAA6B4C,GAC7Brf,GAAiCsf,GACjC5C,GAA+B6C,GAC/BthC,GAA0CuhC,GAC1C7C,GAAqC8C,GACrC7C,GAAkC8C,GAClCzrB,GAA6B0rB,GAC7B9C,GAA8B+C,GAC9B9C,GAA+B+C,GAC/B9C,GAAgC+C,GAChC9C,GAA4B+C,GAC5B9C,GAAqC+C,GACrC9C,GAAwC+C,GACxC93B,GAAmC+3B,GACnC/C,GAA+BgD,GAC/B3hC,GAA+B4hC,GAC/BhD,GAAwCiD,GACxC16B,GAAiC26B,GACjC1iB,GAA4B2iB,GAC5BlD,GAAqCmD,GACrClf,GAAkCmf,GAClCxzB,GAAmCyzB,GACnCpD,GAAsCqD,GACtCpD,GAA4BqD,GAC5BpD,GAA6BqD,GAC7B1nB,GAA4B2nB,GAC5BrD,GAA4CsD,GAC5CrD,GAA2BsD,GAC3BrD,GAA8BsD,GAC9B1vB,GAAkC2vB,GAClCtD,GAA6BuD,GAC7B7Z,GAA+B8Z,GAC/B7jC,GAA8B8jC,GAC9Bh8B,GAAmCi8B,GACnCvvB,GAAkCwvB,GAClC1D,GAAgC2D,GAChC36B,GAAkC46B,GAClC3D,GAAqC4D,GACrCtQ,GAAmCuQ,GACnChQ,GAAoCiQ,GACpChrB,GAA+BirB,GAC/BhrB,GAAkCirB,GAClC/D,GAAwCgE,GACxCnU,GAAiCoU,GACjChE,GAA0CiE,GAC1ChE,GAAgCiE,GAChChE,GAAwCiE,GACxChE,GAAyCiE,GACzCvlB,GAA6BwlB,GAC7BjE,GAA4BkE,GAC5B/hC,GAA8BgiC,GAC9BlQ,GAAmBmQ,gECp5EvB,IAAI9rK,EAAyBY,GAC7B,OAAO,eAAemrK,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACYA,GAAA,MAAGC,EAChB,IAAIC,EAAejsK,EAAuBuD,EAAuB,EAMjE,SAASyoK,EAAM/rK,EAAK,CAElB,IAAI8rK,EAAU,IAAIE,EAAa,QAG/B,OAAAhsK,EAAI,GAAK8rK,EAAQ,GAAG,KAAKA,CAAO,EAChC9rK,EAAI,IAAM8rK,EAAQ,IAAI,KAAKA,CAAO,EAClC9rK,EAAI,KAAO8rK,EAAQ,KAAK,KAAKA,CAAO,EACpC9rK,EAAI,KAAO8rK,EAAQ,KAAK,KAAKA,CAAO,EAC7B9rK,CACT,4DCrBA,IAAID,EAAyBY,GAC7B,OAAO,eAAe+kF,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACoBA,GAAA,cAAGumF,EACxB,IAAI/4H,EAAmBnzC,EAAuBuD,GAAA,CAAgD,EAC1FD,EAAWtD,EAAuB8E,EAAwC,EAC1ED,EAAM0C,GACNqe,EAAWtJ,EACXhW,EAAUwf,GACV1E,EAASqX,GACT+a,EAAkB9a,GACtB,SAASwzI,EAAc5jK,EAAO6jK,EAAMnoG,EAAMooG,EAAmB,CAwD3D,SAASC,EAAWC,EAAW1lK,EAAS,CACtC,IAAIwkB,EAAM,UAAU,OACpB,GAAIA,IAAQ,GAAKA,IAAQ,EACvB,MAAM,IAAIooB,EAAgB,eAAe,SAAUpoB,EAAK,EAAG,CAAC,EAEzDxkB,IACHA,EAAU,CAAA,GAEZ,SAAS2lK,EAAeC,EAAYxnK,EAAOoC,EAAM,CAC/C,GAAI,MAAM,QAAQpC,CAAK,EACrBA,EAAM,QAAQ,SAAUmC,EAAM,CAC5B,OAAOolK,EAAeC,EAAYrlK,CAAI,CAChD,CAAS,aACY7D,EAAS,SAAY0B,CAAK,IAAM,SAC7C,QAASwI,KAASxI,KACRsB,EAAQ,gBAAgBtB,EAAOwI,CAAK,GAC1C++J,EAAeC,EAAYxnK,EAAMwI,CAAK,EAAGA,CAAK,aAGrCoY,EAAS,WAAW5gB,CAAK,GAAKoC,IAAS,OAAW,CAC/D,IAAIqlK,KAAe7mJ,EAAS,WAAW5gB,CAAK,EAAI0nK,EAA2B1nK,CAAK,EAAIA,EAAM,GAAK,aAC7FA,EAAM,GAAKoC,EAGb,MAAQd,EAAQ,gBAAgBkmK,EAAYC,CAAQ,GAAKD,EAAWC,CAAQ,IAAMznK,GAAS,CAAC4B,EAAQ,OAClG,MAAM,IAAI,MAAM,kBAAoB6lK,EAAW,SAAS,EAE1DD,EAAWC,CAAQ,EAAIznK,CAC/B,SACY,CAAC4B,EAAQ,OACX,MAAM,IAAI,UAAU,oCAAoC,CAG7D,CACD,IAAI4lK,EAAa,CAAA,EACjBD,EAAeC,EAAYF,CAAS,EACpC,QAASllK,KAAQolK,EACf,MAAQlmK,EAAQ,gBAAgBkmK,EAAYplK,CAAI,EAAG,CAEjD,IAAIpC,EAAQwnK,EAAWplK,CAAI,EAC3B,MAAQwe,EAAS,WAAW5gB,CAAK,EAI/B2nK,EAAe3nK,EAAO4B,CAAO,UACpBgmK,EAAgB5nK,CAAK,EAC9B2gF,EAAQv+E,EAAMpC,EAAO4B,CAAO,UAExB,CAACA,EAAQ,OACX,MAAM,IAAI,UAAU,oCAAoC,CAG7D,CAEJ,CASD,SAAS++E,EAAQv+E,EAAMpC,EAAO4B,EAAS,CAWrC,GATIA,EAAQ,MAAQ,OAAO5B,GAAU,aAEnCA,EAAQ6nK,EAAM7nK,CAAK,GAIjB8nK,EAA0B9nK,CAAK,IACjCA,EAAQsD,EAAMlB,KAAU+rC,EAAiB,SAAY,CAAA,EAAInuC,EAAM,UAAWA,CAAK,CAAC,GAE9EsD,EAAM,gBAAgB07D,EAAK58D,CAAI,CAAC,GAAKkB,EAAM,gBAAgBtD,CAAK,EAAG,CACjE4B,EAAQ,SAEV5B,EAAQsD,EAAMlB,EAAMpC,EAAM,UAAU,EAGpCA,EAAQsD,EAAM07D,EAAK58D,CAAI,EAAGpC,CAAK,EAEjCg/D,EAAK58D,CAAI,EAAIpC,EACb,OAAOonK,EAAkBhlK,CAAI,EAC7B2lK,EAAiB3lK,EAAMpC,CAAK,EAC5Bg/D,EAAK,KAAK,SAAU58D,EAAM,UAAoB,CAC5C,OAAOpC,CACf,CAAO,EACD,MACD,CACD,GAAIg/D,EAAK58D,CAAI,IAAM,QAAaR,EAAQ,SAAU,CAChDo9D,EAAK58D,CAAI,EAAIpC,EACb,OAAOonK,EAAkBhlK,CAAI,EAC7B2lK,EAAiB3lK,EAAMpC,CAAK,EAC5Bg/D,EAAK,KAAK,SAAU58D,EAAM,UAAoB,CAC5C,OAAOpC,CACf,CAAO,EACD,MACD,CACD,GAAI,CAAC4B,EAAQ,OACX,MAAM,IAAI,MAAM,kBAAoBQ,EAAO,mBAAmB,CAEjE,CACD,SAAS2lK,EAAiB3lK,EAAMpC,EAAO,CACjCA,GAAS,OAAOA,EAAM,WAAc,YACtCg/D,EAAK,WAAW,UAAU58D,CAAI,EAAIpC,EAAM,UACpCgoK,EAAqB5lK,CAAI,IAC3B48D,EAAK,WAAW,kBAAkB58D,CAAI,EAAIpC,EAAM,aAIlD,OAAOg/D,EAAK,WAAW,UAAU58D,CAAI,EACjC4lK,EAAqB5lK,CAAI,IAC3B48D,EAAK,WAAW,kBAAkB58D,CAAI,EAAIpC,GAG/C,CACD,SAASioK,EAAiB7lK,EAAM,CAC9B,OAAO48D,EAAK,WAAW,UAAU58D,CAAI,EACjC4lK,EAAqB5lK,CAAI,EAC3B48D,EAAK,WAAW,kBAAkB58D,CAAI,EAAI48D,EAAK58D,CAAI,EAEnD,OAAO48D,EAAK,WAAW,kBAAkB58D,CAAI,CAEhD,CASD,SAASylK,EAAMrjK,EAAI,CACjB,IAAI0jK,EAAU,UAAmB,CAE/B,QADIrgK,EAAO,CAAA,EACFxM,EAAI,EAAGgF,EAAM,UAAU,OAAQhF,EAAIgF,EAAKhF,IAAK,CACpD,IAAImQ,EAAM,UAAUnQ,CAAC,EACrBwM,EAAKxM,CAAC,EAAImQ,GAAOA,EAAI,QAAO,CAC7B,CACD,OAAOhH,EAAG,MAAMw6D,EAAMn3D,CAAI,CAChC,EACI,OAAIrD,EAAG,YACL0jK,EAAQ,UAAY1jK,EAAG,WAElB0jK,CACR,CASD,SAASP,EAAellK,EAASb,EAAS,CACxC,IAAIQ,EAAO,UAAU,OAAS,GAAK,UAAU,CAAC,IAAM,OAAY,UAAU,CAAC,EAAIK,EAAQ,GACvF,MAAQ2Z,EAAO,UAAUha,EAAM,GAAG,EAChC,MAAM,IAAI,MAAM,wDAA+D,KAAK,UAAUA,CAAI,CAAC,EAErG,IAAI+lK,EAAYT,EAA2BjlK,CAAO,EAAIu8D,EAAK,WAAW,UAAYA,EAC9EopG,EAAqBhmK,KAAQ48D,EAAK,WAAW,UAC7CqpG,KAAe/mK,EAAQ,gBAAgB6mK,EAAW/lK,CAAI,EAAI+lK,EAAU/lK,CAAI,EAAI,OAC5E07E,EAAW,UAAoB,CAEjC,IAAIzhE,EAAe,CAAA,EACnB5Z,EAAQ,aAAa,IAAIme,EAAS,qBAAqB,EAAE,QAAQ,SAAU/D,EAAY,CACrF,MAAQT,EAAO,UAAUS,EAAY,GAAG,EACtC,MAAM,IAAI,MAAM,8DAAqE,KAAK,UAAUA,CAAU,CAAC,EAE7GA,IAAe,OACjBR,EAAa,KAAO2iD,EACXniD,IAAe,oBACxBR,EAAa,kBAAoB2iD,EAAK,WAAW,kBACxCniD,IAAe,UAExBR,EAAa,QAAU2iD,EAEvB3iD,EAAaQ,CAAU,EAAImiD,EAAKniD,CAAU,CAEpD,CAAO,EACD,IAAIM,EAA0B1a,EAAQ4Z,CAAY,EAClD,GAAIc,GAAY,OAAOA,EAAS,WAAc,WAC5C,MAAM,IAAI,MAAM,uIAA4I,EAE9J,GAAIkrJ,IAAa,QAAazmK,EAAQ,SACpC,OAAOub,EAET,GAAI7Z,EAAM,gBAAgB+kK,CAAQ,GAAK/kK,EAAM,gBAAgB6Z,CAAQ,EAEnE,OAAO7Z,EAAM+kK,EAAUlrJ,CAAQ,EAEjC,GAAIvb,EAAQ,OAEV,OAAOymK,EAEP,MAAM,IAAI,MAAM,kBAAoBjmK,EAAO,mBAAmB,CAEtE,EAGQ,CAACK,EAAQ,MAAQA,EAAQ,KAAK,OAAS,OACrCnB,EAAQ,MAAM6mK,EAAW/lK,EAAM07E,CAAQ,EAGvCuqF,GAAYD,EACdH,EAAiB7lK,CAAI,GAEjBslK,EAA2BjlK,CAAO,GAAK6lK,EAA4B7lK,CAAO,OACxEnB,EAAQ,MAAM09D,EAAK,WAAW,kBAAmB58D,EAAM,UAAY,CACrE,OAAO+lK,EAAU/lK,CAAI,CACjC,CAAW,IAIL+lK,EAAU/lK,CAAI,EAAI07E,IAGduqF,GAAYD,EACdH,EAAiB7lK,CAAI,GAEjBslK,EAA2BjlK,CAAO,GAAK6lK,EAA4B7lK,CAAO,OACxEnB,EAAQ,MAAM09D,EAAK,WAAW,kBAAmB58D,EAAM,UAAY,CACrE,OAAO+lK,EAAU/lK,CAAI,CACjC,CAAW,GAMPglK,EAAkBhlK,CAAI,EAAIK,EAC1Bu8D,EAAK,KAAK,SAAU58D,EAAM07E,CAAQ,CACnC,CAQD,SAAS8pF,EAAgBhpK,EAAQ,CAC/B,OAAO,OAAOA,GAAW,YAAc,OAAOA,GAAW,UAAY,OAAOA,GAAW,UAAY,OAAOA,GAAW,WAAaA,IAAW,SAAYiB,EAAI,QAAQjB,CAAM,MAASiB,EAAI,WAAWjB,CAAM,MAASiB,EAAI,aAAajB,CAAM,MAASiB,EAAI,YAAYjB,CAAM,MAASiB,EAAI,UAAUjB,CAAM,GAAK,MAAM,QAAQA,CAAM,CAC/T,CACD,SAASkpK,EAA0BtjK,EAAI,CACrC,OAAO,OAAOA,GAAO,YAAc,OAAOA,EAAG,WAAc,QAC5D,CACD,SAASwjK,EAAqB5lK,EAAM,CAClC,MAAO,IAAKd,EAAQ,gBAAgBinK,EAAQnmK,CAAI,CACjD,CACD,SAASkmK,EAA4B7lK,EAAS,CAC5C,OAAOA,EAAQ,GAAG,QAAQ,GAAG,IAAM,IAEnC,IAAKnB,EAAQ,gBAAgBinK,EAAQ9lK,EAAQ,EAAE,IAAM,CAACA,EAAQ,MAAQ,CAACA,EAAQ,KAAK,QACrF,CACD,SAASilK,EAA2BjlK,EAAS,CAC3C,OAAOA,IAAY,QAAaA,EAAQ,OAAS,QAAaA,EAAQ,KAAK,sBAAwB,IAAQ,EAC5G,CAGD,IAAI8lK,EAAS,CACX,WAAY,GACZ,KAAM,GACN,KAAM,GACN,MAAO,GACP,KAAM,GACN,MAAO,EACX,EAEE,OAAOlB,CACT,WCjVA,IAAIrsK,GAAyBY,GACzBF,IAAU6C,GACd,OAAO,eAAeiqK,GAAS,aAAc,CAC3C,MAAO,EACT,CAAC,EACaA,GAAA,OAAGzlK,GACjB,IAAIT,IAAYtH,GAAuB8E,GAAA,CAAyC,EAC5E6gB,IAAiB3lB,GAAuBuH,GAAA,CAAyB,EACjEjB,GAAUgW,GACVyvJ,IAAU3R,IAAwBt0I,IAAA,CAAgC,EAClE6/D,IAAUltD,IAAA,EACV9xB,IAAU+xB,GAAA,EACV9S,GAAW+S,EACX9zB,GAAM+zB,GACN4a,IAAkB2b,GAClB5wC,IAAkB6pD,GAClB5pD,IAAc8pD,GACd/hE,IAAWwkE,GAAA,EACf,SAASsvF,GAAyBC,EAAa,CAAE,GAAI,OAAO,SAAY,WAAY,OAAO,KAAM,IAAIC,EAAoB,IAAI,QAAeC,EAAmB,IAAI,QAAW,OAAQH,GAA2B,SAAkCC,EAAa,CAAE,OAAOA,EAAcE,EAAmBD,CAAkB,GAAID,CAAW,CAAI,CAC/U,SAASF,IAAwBn6J,EAAKq6J,EAAa,CAAE,GAAI,CAACA,GAAer6J,GAAOA,EAAI,WAAc,OAAOA,EAAO,GAAIA,IAAQ,MAAQS,IAAQT,CAAG,IAAM,UAAY,OAAOA,GAAQ,WAAc,MAAO,CAAE,QAAWA,CAAG,EAAM,IAAImmH,EAAQi0C,GAAyBC,CAAW,EAAG,GAAIl0C,GAASA,EAAM,IAAInmH,CAAG,EAAK,OAAOmmH,EAAM,IAAInmH,CAAG,EAAK,IAAIwqH,EAAS,GAAQgwC,EAAwB,OAAO,gBAAkB,OAAO,yBAA0B,QAASl6J,KAAON,EAAO,GAAIM,IAAQ,WAAa,OAAO,UAAU,eAAe,KAAKN,EAAKM,CAAG,EAAG,CAAE,IAAI4xD,EAAOsoG,EAAwB,OAAO,yBAAyBx6J,EAAKM,CAAG,EAAI,KAAU4xD,IAASA,EAAK,KAAOA,EAAK,KAAQ,OAAO,eAAes4D,EAAQlqH,EAAK4xD,CAAI,EAAYs4D,EAAOlqH,CAAG,EAAIN,EAAIM,CAAG,CAAM,CAAG,OAAAkqH,EAAO,QAAaxqH,EAASmmH,GAASA,EAAM,IAAInmH,EAAKwqH,CAAM,EAAYA,CAAS,CAwC3yB,SAAS1iH,GAAO2Z,EAAWlhB,EAAQ,CACjC,IAAIitK,KAAqBnmK,IAAU,SAAY,CAAA,EAAIf,IAAS,eAAgB/F,CAAM,EAGlF,GAAI,OAAO,OAAO,QAAW,WAC3B,MAAM,IAAI,MAAM,+GAAoH,EAItI,IAAIwjE,EAAO+nG,IAAQ,MAAM,CAEvB,SAAUlnK,GAAI,SACd,UAAWA,GAAI,UACf,YAAaA,GAAI,YACjB,WAAYA,GAAI,WAChB,OAAQA,GAAI,OACZ,SAAUA,GAAI,SACd,QAASA,GAAI,QACb,SAAUA,GAAI,SACd,aAAcA,GAAI,aAClB,cAAeA,GAAI,cACnB,eAAgBA,GAAI,eACpB,QAASA,GAAI,QACb,QAASA,GAAI,QACb,UAAWA,GAAI,UACf,YAAaA,GAAI,YACjB,OAAQA,GAAI,OACZ,WAAYA,GAAI,WAChB,OAAQA,GAAI,OACZ,SAAUA,GAAI,SACd,SAAUA,GAAI,SACd,OAAQA,GAAI,OACZ,YAAaA,GAAI,YACjB,eAAgBA,GAAI,eACpB,YAAaA,GAAI,YACjB,iBAAkBA,GAAI,iBACtB,YAAaA,GAAI,YACjB,kBAAmBA,GAAI,kBACvB,eAAgBA,GAAI,eACpB,yBAA0BA,GAAI,yBAC9B,eAAgBA,GAAI,eACpB,YAAaA,GAAI,YACjB,OAAQA,GAAI,OACZ,aAAcA,GAAI,aAClB,eAAgBA,GAAI,eACpB,kBAAmBA,GAAI,kBACvB,YAAaA,GAAI,YACjB,iBAAkBA,GAAI,iBACtB,aAAcA,GAAI,aAClB,QAASA,GAAI,OACjB,CAAG,EAGDm/D,EAAK,UAAar9D,IAAQ,eAAe8mK,EAAgBzpG,EAAK,IAAI,EAClEA,EAAK,WAAa,CAChB,UAAW,CAAE,EACb,kBAAmB,CACjB,OAAQA,EAAK,MACd,CACL,EAGE,IAAI0pG,EAAkB,CAAA,EAClBC,EAAkB,CAAA,EAStB,SAASxB,EAAK1kK,EAAS,CACrB,MAAQme,GAAS,WAAWne,CAAO,EACjC,OAAOA,EAAQu8D,CAAI,EAErB,IAAI4pG,EAAgBnmK,EAAQ,OAAO,KAAKA,CAAO,EAAE,CAAC,CAAC,EACnD,MAAQme,GAAS,WAAWgoJ,CAAa,EACvC,OAAOA,EAAc5pG,CAAI,EAE3B,GAAI,IAAK19D,GAAQ,iBAAiBmB,CAAO,EACvC,cAAQ,KAAK,wEAAyEA,CAAO,EACvF,IAAI,MAAM,uEAAuE,EAEzF,IAAIqF,EAAQ4gK,EAAgB,QAAQjmK,CAAO,EACvC0a,EACJ,OAAIrV,IAAU,IAERrF,EAAQ,OAAS,GAEnB0a,EAAW1a,EAAQ,QAAQu8D,EAAK,KAAMypG,EAAgBtB,EAAMnoG,EAAK,MAAOA,CAAI,EAE5E7hD,EAAW1a,EAAQ,QAAQu8D,EAAK,KAAMypG,EAAgBtB,EAAMnoG,EAAK,KAAK,EAIxE0pG,EAAgB,KAAKjmK,CAAO,EAC5BkmK,EAAgB,KAAKxrJ,CAAQ,GAG7BA,EAAWwrJ,EAAgB7gK,CAAK,EAE3BqV,CACR,CACD,IAAIiqJ,EAAoB,CAAA,EAGxB,SAASyB,GAAY,CACnB,QAAS5oJ,EAAO,UAAU,OAAQpY,EAAO,IAAI,MAAMoY,CAAI,EAAGE,EAAO,EAAGA,EAAOF,EAAME,IAC/EtY,EAAKsY,CAAI,EAAI,UAAUA,CAAI,EAE7B,OAAO6+C,EAAK,MAAM,MAAMA,EAAK,MAAOn3D,CAAI,CACzC,CACDghK,EAAU,gBAAkBloJ,IAAe,QAAW,gBACtD,IAAImoJ,KAAqBnoF,IAAQ,eAAekoF,EAAW1B,EAAMnoG,EAAMooG,CAAiB,EACxF,OAAApoG,EAAK,OAAY8pG,EAIjB9pG,EAAK,GAAG,SAAU,UAAY,IACxB19D,GAAQ,QAAQ8lK,CAAiB,EAAE,QAAQ,SAAU3kK,EAAS,CAC5DA,GAAWA,EAAQ,MAAQA,EAAQ,KAAK,wBAG1CqmK,EAAermK,EAAS,CACtB,SAAU,EACpB,CAAS,CAET,CAAK,CACL,CAAG,EAIDu8D,EAAK,OAASj8D,GAAO,KAAK,KAAM2Z,CAAS,EAGzCsiD,EAAK,QAAUp+C,GAAS,QAIxBo+C,EAAK,UAAc19D,GAAQ,WAAYA,GAAQ,aAAaob,CAAS,CAAC,CAAC,EACvEsiD,EAAK,eAAiBxwB,IAAgB,eACtCwwB,EAAK,eAAiBzlD,IAAgB,eACtCylD,EAAK,WAAaxlD,IAAY,WACvBwlD,CACT,cC5MA,OAAO,eAAwBhvC,EAAA,aAAc,CAC3C,MAAO,EACT,CAAC,EACD,IAAI+4I,EAAe,CACjB,OAAQ,GACR,WAAY,GACZ,eAAgB,GAChB,eAAgB,GAChB,OAAQ,GACR,QAAS,EACX,EACA,OAAO,eAAe/4I,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOwe,EAAgB,cACxB,CACH,CAAC,EACD,OAAO,eAAexe,EAAS,iBAAkB,CAC/C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOzW,EAAgB,cACxB,CACH,CAAC,EACD,OAAO,eAAeyW,EAAS,aAAc,CAC3C,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOxW,EAAY,UACpB,CACH,CAAC,EACD,OAAO,eAAewW,EAAS,SAAU,CACvC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOstG,EAAgB,MACxB,CACH,CAAC,EACD,OAAO,eAAettG,EAAS,SAAU,CACvC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO+U,EAAQ,MAChB,CACH,CAAC,EACD,OAAO,eAAe/U,EAAS,UAAW,CACxC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOpP,EAAS,OACjB,CACH,CAAC,EACD,IAAI08G,EAAkB1hI,GAClB8kI,EAA6BniI,GACjC,OAAO,KAAKmiI,CAA0B,EAAE,QAAQ,SAAUnlI,EAAK,CACzDA,IAAQ,WAAaA,IAAQ,cAC7B,OAAO,UAAU,eAAe,KAAKwtK,EAAcxtK,CAAG,GACtDA,KAAOy0B,GAAWA,EAAQz0B,CAAG,IAAMmlI,EAA2BnlI,CAAG,GACrE,OAAO,eAAey0B,EAASz0B,EAAK,CAClC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOmlI,EAA2BnlI,CAAG,CACtC,CACL,CAAG,CACH,CAAC,EACD,IAAIytK,EAA+BlpK,GACnC,OAAO,KAAKkpK,CAA4B,EAAE,QAAQ,SAAUztK,EAAK,CAC3DA,IAAQ,WAAaA,IAAQ,cAC7B,OAAO,UAAU,eAAe,KAAKwtK,EAAcxtK,CAAG,GACtDA,KAAOy0B,GAAWA,EAAQz0B,CAAG,IAAMytK,EAA6BztK,CAAG,GACvE,OAAO,eAAey0B,EAASz0B,EAAK,CAClC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOytK,EAA6BztK,CAAG,CACxC,CACL,CAAG,CACH,CAAC,EACD,IAAI0tK,EAAc1mK,GAClB,OAAO,KAAK0mK,CAAW,EAAE,QAAQ,SAAU1tK,EAAK,CAC1CA,IAAQ,WAAaA,IAAQ,cAC7B,OAAO,UAAU,eAAe,KAAKwtK,EAAcxtK,CAAG,GACtDA,KAAOy0B,GAAWA,EAAQz0B,CAAG,IAAM0tK,EAAY1tK,CAAG,GACtD,OAAO,eAAey0B,EAASz0B,EAAK,CAClC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO0tK,EAAY1tK,CAAG,CACvB,CACL,CAAG,CACH,CAAC,EACD,IAAIie,EAAclC,GACdiC,EAAkBuH,GAClB0tB,EAAkB/a,GAClBy1I,EAA4Bx1I,GAChC,OAAO,KAAKw1I,CAAyB,EAAE,QAAQ,SAAU3tK,EAAK,CACxDA,IAAQ,WAAaA,IAAQ,cAC7B,OAAO,UAAU,eAAe,KAAKwtK,EAAcxtK,CAAG,GACtDA,KAAOy0B,GAAWA,EAAQz0B,CAAG,IAAM2tK,EAA0B3tK,CAAG,GACpE,OAAO,eAAey0B,EAASz0B,EAAK,CAClC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO2tK,EAA0B3tK,CAAG,CACrC,CACL,CAAG,CACH,CAAC,EACD,IAAIgiI,EAAgB5pG,EACpB,OAAO,KAAK4pG,CAAa,EAAE,QAAQ,SAAUhiI,EAAK,CAC5CA,IAAQ,WAAaA,IAAQ,cAC7B,OAAO,UAAU,eAAe,KAAKwtK,EAAcxtK,CAAG,GACtDA,KAAOy0B,GAAWA,EAAQz0B,CAAG,IAAMgiI,EAAchiI,CAAG,GACxD,OAAO,eAAey0B,EAASz0B,EAAK,CAClC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAOgiI,EAAchiI,CAAG,CACzB,CACL,CAAG,CACH,CAAC,EACD,IAAIwpC,EAAUnR,GACVhT,EAAWupC,qBChHf,OAAO,eAAwBn6B,EAAA,aAAc,CAC3C,MAAO,EACT,CAAC,EACD,IAAIm5I,EAAWvtK,GACf,OAAO,KAAKutK,CAAQ,EAAE,QAAQ,SAAU5tK,EAAK,CACvCA,IAAQ,WAAaA,IAAQ,cAC7BA,KAAOy0B,GAAWA,EAAQz0B,CAAG,IAAM4tK,EAAS5tK,CAAG,GACnD,OAAO,eAAey0B,EAASz0B,EAAK,CAClC,WAAY,GACZ,IAAK,UAAe,CAClB,OAAO4tK,EAAS5tK,CAAG,CACpB,CACL,CAAG,CACH,CAAC,QCXD,MAAM6tK,GAAW,CAAA,EAEjBA,GAAS,WAAa,SAAS1qK,EAAM2qK,EAAS,KAAM,CAClD,OAAO3qK,EAAK,OAAS,gBACdA,EAAK,KAAO,cACZ,QAAQ,SAASA,EAAK,EAAE,IACvB2qK,EAAW3qK,EAAK,KAAO2qK,EAAW,GAC5C,EAEAD,GAAS,cAAgB,SAAS1qK,EAAM,CACtC,OAAOA,EAAK,OAAS,iBACvB,EAEA0qK,GAAS,aAAe,SAAS1qK,EAAM,CACrC,OAAOA,EAAK,OAAS,gBAAkBA,EAAK,KAAO,YACrD,EAEA0qK,GAAS,WAAa,SAAS1qK,EAAM4qK,EAAa,KAAM,CAItD,MAHI,EAAA5qK,EAAK,OAAS,gBAGd4qK,GAAgB5qK,EAAK,GAAG,OAAS4qK,EAIvC,EAEAF,GAAS,SAAW,SAAS1qK,EAAM6qK,EAAgB,GAAO,CACxD,OAAI7qK,EAAK,OAAS,aACT,GAEA6qK,GAAmBH,GAAS,aAAa1qK,CAAI,EAC7C0qK,GAAS,SAAS1qK,EAAK,KAAK,CAAC,EAAG,EAAK,EAGrC,EAEX,EAEA0qK,GAAS,WAAa,SAAS1qK,EAAM6qK,EAAgB,GAAO,CAC1D,OAAI7qK,EAAK,OAAS,eACT,GAEA6qK,GAAmBH,GAAS,aAAa1qK,CAAI,GAChD0qK,GAAS,WAAW1qK,EAAK,KAAK,CAAC,EAAG,EAAK,EAC3B,WAAWA,EAAK,KAAK,CAAC,EAAE,KAAK,GAC3B,EAOX,EAEX,EAEA0qK,GAAS,mBAAqB,SAAS1qK,EAAM6qK,EAAgB,GAAO,CAClE,OAAIH,GAAS,WAAW1qK,EAAM,GAAG,EACxBA,EAAK,KAAK,MAAM,GAAK0qK,GAAS,WAAW,EAAGG,CAAe,CAAC,EAG5D,EAEX,EAEAH,GAAS,6BAA+B,SAAS1qK,EAAM6qK,EAAgB,GAAO,CAC5E,MAAIH,GAAAA,GAAS,WAAW1qK,EAAM6qK,CAAe,GACzCH,GAAS,mBAAmB1qK,EAAM6qK,CAAe,EAMvD,EAEAH,GAAS,kBAAoB,SAAS1qK,EAAM6qK,EAAgB,GAAO,CACjE,GAAI,CAACH,GAAS,mBAAmB1qK,EAAM6qK,CAAe,EACpD,MAAO,GAET,IAAIz+I,EAAYpsB,EAAK,KAAK,CAAC,EACvBwnB,EAAcxnB,EAAK,KAAK,CAAC,EAC7B,OAAI6qK,IACEH,GAAS,aAAat+I,CAAS,IACjCA,EAAYA,EAAU,KAAK,CAAC,GAE1Bs+I,GAAS,aAAaljJ,CAAW,IACnCA,EAAcA,EAAY,KAAK,CAAC,IAG5B,OAAO,UAAU,WAAW4E,EAAU,KAAK,CAAC,GAC5C,OAAO,UAAU,WAAW5E,EAAY,KAAK,CAAC,CACxD,EAEA,IAAAsjJ,GAAiBJ,GC5FjB,MAAMpqG,GAAOpjE,GACPwtK,IAAW7qK,GAEXkrK,GAAc,CAClB,SAAUhhG,EAAI5gE,EAAM46D,EAAS,GAAO,CAClC,OAAQgG,EAAE,CACV,IAAK,IACH,OAAO,IAAIzJ,GAAK,aAAa,IAAK,MAAOn3D,CAAI,EAC/C,IAAK,IACH,OAAO,IAAIm3D,GAAK,aAAa,IAAK,WAAYn3D,CAAI,EACpD,IAAK,IACH,OAAO,IAAIm3D,GAAK,aAAa,IAAK,SAAUn3D,CAAI,EAClD,IAAK,IACH,OAAO,IAAIm3D,GAAK,aACd,IAAK,WAAYn3D,EAAM46D,CAAQ,EACnC,IAAK,IACH,OAAO,IAAIzD,GAAK,aAAa,IAAK,MAAOn3D,CAAI,EAC/C,QACE,MAAM,MAAM,0BAA4B4gE,CAAE,CAC3C,CACF,EAID,WAAYmB,EAAS,CACnB,OAAO,IAAI5K,GAAK,aACd,IAAK,aAAc,CAAC4K,CAAO,CAAC,CAC/B,EAED,SAAU/yC,EAAK,CACb,OAAO,IAAImoC,GAAK,aAAanoC,CAAG,CACjC,EAED,OAAQz0B,EAAM,CACZ,OAAO,IAAI48D,GAAK,WAAW58D,CAAI,CAChC,EAED,YAAawnE,EAAS,CACpB,OAAO,IAAI5K,GAAK,gBAAgB4K,CAAO,CACxC,EAED,KAAMA,EAAS,CACb,OAAO,IAAI5K,GAAK,UAAU4K,CAAO,CAClC,EAKD,KAAM31D,EAAMS,EAAUg1J,EAAOC,EAAc,GAAO,CAChD,IAAIC,EAAO31J,EACX,OAAIS,IACFk1J,EAAO,KAAK,SAAS,IAAK,CAACA,EAAMl1J,CAAQ,CAAC,GAExCg1J,IAAUC,GAAiB,WAAWD,EAAM,KAAK,IAAM,KACrDN,IAAS,WAAWM,CAAK,GACzB,WAAWA,EAAM,KAAK,IAAM,IAC5B,CAACC,EAEHC,EAAO,KAAK,WAAWA,CAAI,EAG3BA,EAAO,KAAK,SAAS,IAAK,CAACF,EAAOE,CAAI,EAAG,EAAI,GAG1CA,CACR,EAED,eAAgBhrG,EAAQlqD,EAAUg1J,EAAOC,EAAc,GAAO,CAC5D,OAAO,KAAK,KAAK/qG,EAAQlqD,EAAUg1J,EAAOC,CAAa,CACxD,EAGD,QAASE,EAAcC,EAAU,CAC/B,MAAMlrG,EAAS6qG,GAAY,OAAO,SAAS,EAC3C,OAAO,IAAIzqG,GAAK,aAAaJ,EAAQ,CAACirG,EAAcC,CAAQ,CAAC,CAC9D,CACH,EAEA,IAAAC,GAAiBN,GChFjB,SAAS1qG,IAASrgE,EAAM,CACxB,GAAIA,EAAK,UAAY,KAAM,OAAOA,EAAK,SAAU,EAC1C,GAAIA,EAAK,MAAQ,KAAM,OAAOA,EAAK,KAAM,EACzC,MAAM,MAAM,0CAA0CA,CAAI,EAAE,CACnE,CAEA,IAAAsrK,GAAiBjrG,ICVjB,MAAM0qG,GAAc7tK,GACdwtK,GAAW7qK,GAEXwgE,IAAWj/D,GAejB,IAAAmqK,GAAA,MAAMC,EAAK,CAUT,YAAYxrK,EAAMyrK,EAAcC,EAA2B,GAAO,CAChE,MAAMxqK,EAASsqK,GAAK,UAAUxrK,EAAMyrK,EAAcC,CAA0B,EAC5E,KAAK,KAAOxqK,EAAO,KACnB,KAAK,SAAWA,EAAO,SACvB,KAAK,MAAQA,EAAO,KACrB,CAED,aAAc,CACZ,OAAO,KAAK,IACb,CAED,aAAayqK,EAAW,GAAO,CAC7B,MAAI,CAAC,KAAK,OAASA,EACVZ,GAAY,SAAS,CAAC,EAGtB,KAAK,KAEf,CAED,eAAgB,CACd,OAAI,KAAK,MACA1qG,IAAS,KAAK,KAAK,EAGnB,CAEV,CAED,gBAAgBsrG,EAAW,GAAO,CAChC,MAAI,CAAC,KAAK,UAAYA,EACbZ,GAAY,SAAS,CAAC,EAGtB,KAAK,QAEf,CAQD,kBAAmB,CAEjB,OAAO,KAAK,OAASL,GAAS,WAAW,KAAK,KAAK,CACpD,CAED,UAAW,CACT,MAAO,CAAC,CAAC,KAAK,KACf,CACH,EAIAc,GAAK,OAAS,SACZxrK,EAAMyrK,EAAcC,EAA2B,GAAO,CACtD,GAAI,CAEF,WAAIF,GAAKxrK,EAAMyrK,EAAcC,CAA0B,EAChD,EACR,MACW,CACV,MAAO,EACR,CACH,EAEAF,GAAK,UAAY,SAASxrK,EAAMyrK,EAAcC,EAA4B,CACxE,IAAIn2J,EAAMS,EAAUg1J,EACpB,GAAIN,GAAS,WAAW1qK,CAAI,EAC1B,GAAIA,EAAK,KAAO,IAAK,CACnB,MAAM4rK,EAAW5rK,EAAK,KAAK,CAAC,EAC5B,GAAI,CAACyrK,EAAaG,CAAQ,EACxB,MAAM,MAAM,2BAA6BA,CAAQ,EAEnDr2J,EAAOq2J,EACP51J,EAAWhW,EAAK,KAAK,CAAC,CACvB,SAEQA,EAAK,KAAO,IAAK,CACxB,GAAI0rK,GAA8B,CAAC1rK,EAAK,SACtC,MAAM,MAAM,kCAAkC,EAEhD,GAAIA,EAAK,KAAK,SAAW,EACvB,MAAM,MAAM,6BAA6B,EAE3C,MAAM6rK,EAAY7rK,EAAK,KAAK,CAAC,EAC7B,GAAI,CAAC0qK,GAAS,6BAA6BmB,CAAS,EAClD,MAAM,MAAM,0EACeA,CAAS,EAEtCb,EAAQa,EACR,MAAMC,EAAqB,IAAIN,GAC7BxrK,EAAK,KAAK,CAAC,EAAGyrK,EAAcC,CAA0B,EACxD,GAAII,EAAmB,WACrB,MAAM,MAAM,gCAAkCD,EAC5C,QAAUC,EAAmB,aAAY,CAAE,EAE/Cv2J,EAAOu2J,EAAmB,cAC1B91J,EAAW81J,EAAmB,iBAC/B,SAEQ9rK,EAAK,KAAO,IAAK,CACxB,MAAM+rK,EAAkB/rK,EAAK,KAAK,CAAC,EACnC,GAAI,CAAC0qK,GAAS,WAAWqB,CAAe,EACtC,MAAM,MAAM,iDACVA,CAAe,EAEnB,MAAMC,EAAgB,IAAIR,GACxBxrK,EAAK,KAAK,CAAC,EAAGyrK,EAAcC,CAA0B,EACxD,GAAIM,EAAc,mBAChB,MAAM,MAAM,sDAAsD,EAEpEh2J,EAAWg2J,EAAc,kBACzBz2J,EAAOy2J,EAAc,cACrB,MAAMC,EAAwBD,EAAc,aAAa,EAAI,EAC7DhB,EAAQD,GAAY,SAClB,IAAK,CAACkB,EAAuBF,CAAe,CAAC,CAChD,KAEC,OAAM,MAAM,qDAAuD/rK,EAAK,EAAE,UAGrE0qK,GAAS,aAAa1qK,CAAI,EAAG,CACpC,IAAI8M,EAAM9M,EAAK,KAAK,CAAC,EACjB0qK,GAAS,cAAc59J,CAAG,IAC5BA,EAAMA,EAAI,SAEZ,MAAMo/J,EAAW,IAAIV,GACnB1+J,EAAK2+J,EAAcC,CAA0B,EAC/C11J,EAAWk2J,EAAS,kBACpB32J,EAAO22J,EAAS,cACXA,EAAS,WAIZlB,EAAQmB,IAAoBD,EAAS,aAAc,CAAA,EAHnDlB,EAAQD,GAAY,SAAS,EAAE,CAKlC,SACQU,EAAazrK,CAAI,EACxBuV,EAAOvV,MAEJ,IAAI0qK,GAAS,cAAc1qK,CAAI,EAClC,OAAOwrK,GAAK,UAAUxrK,EAAK,QAASyrK,EAAcC,CAA0B,EAG5E,MAAM,MAAM,0BAA4B1rK,EAAK,IAAI,EAGnD,MAAO,CACL,KAAAuV,EACA,SAAAS,EACA,MAAAg1J,CACJ,CACA,EAKA,SAASmB,IAAoBnsK,EAAM,CACjC,GAAI0qK,GAAS,WAAW1qK,CAAI,EAE1BA,EAAO+qK,GAAY,SAAS,EAAI,WAAW/qK,EAAK,KAAK,CAAC,MAEnD,CAEH,MAAMosK,EAAiB,EAAI,WAAWpsK,EAAK,KAAK,CAAC,EAAE,KAAK,EACxDA,EAAK,KAAK,CAAC,EAAI+qK,GAAY,SAASqB,CAAc,CACnD,CACD,OAAOpsK,CACT,CAEA,IAAAqsK,GAAiBb,GCzMjB,MAAMd,IAAWxtK,GACXsuK,GAAO3rK,UAIb,MAAMysK,WAAuBd,EAAK,CAChC,YAAYxrK,EAAM0rK,EAA2B,GAAO,CAClD,MAAM1rK,EAAMssK,GAAe,aAAcZ,CAA0B,CACpE,CAED,eAAgB,CACd,OAAO,KAAK,IACb,CAED,eAAgB,CACd,OAAO,KAAK,KAAK,IAClB,CACH,EAKAY,GAAe,aAAe,SAAStsK,EAAM,CAC3C,OAAO0qK,IAAS,SAAS1qK,CAAI,CAC/B,EAMAssK,GAAe,iBAAmB,SAChCtsK,EAAM0rK,EAA2B,GAAO,CACxC,OAAOF,GAAK,OACVxrK,EAAMssK,GAAe,aAAcZ,CAA0B,CACjE,EAEA,IAAAa,GAAiBD,GCpCjB,MAAMvB,GAAc7tK,GACdwtK,GAAW7qK,GACXysK,GAAiBlrK,GAEjBorK,GAAW,CAAA,EAKjBA,GAAS,WAAa,SAASxsK,EAAM,CACnC,GAAI0qK,GAAS,aAAa1qK,CAAI,EAC5B,MAAO,CAACwsK,GAAS,WAAWxsK,EAAK,KAAK,CAAC,CAAC,EAErC,GAAI0qK,GAAS,WAAW1qK,CAAI,EAC/B,OAAO,WAAWA,EAAK,KAAK,EAAI,EAE7B,GAAI0qK,GAAS,mBAAmB1qK,CAAI,EAAG,CAC1C,MAAMosK,EAAiB,WAAWpsK,EAAK,KAAK,CAAC,EAAE,KAAK,EAC9CysK,EAAmB,WAAWzsK,EAAK,KAAK,CAAC,EAAE,KAAK,EACtD,GAAIosK,EAAiB,GAAKK,EAAmB,EAC3C,MAAO,EAAEL,EAAiB,GAAKK,EAAmB,EAErD,SACQH,GAAe,iBAAiBtsK,CAAI,EAAG,CAC9C,MAAM0sK,EAAW,IAAIJ,GAAetsK,CAAI,EACxC,OAAOwsK,GAAS,WAAWE,EAAS,aAAa,EAAI,CAAC,CACvD,CAED,MAAO,EACT,EAQAF,GAAS,OAAS,SAASxsK,EAAM2sK,EAAM,GAAO,CAC5C,GAAIjC,GAAS,mBAAmB1qK,CAAI,EAClC,OAAAA,EAAK,KAAK,CAAC,EAAIwsK,GAAS,OAAOxsK,EAAK,KAAK,CAAC,EAAG2sK,CAAK,EAC3C3sK,EAEJ,GAAIssK,GAAe,iBAAiBtsK,CAAI,EAC3C,OAAOwsK,GAAS,qBAAqBxsK,EAAM2sK,CAAK,EAE7C,GAAI,CAACA,EAAO,CACf,GAAIjC,GAAS,aAAa1qK,CAAI,EAC5B,OAAOA,EAAK,KAAK,CAAC,EAEf,GAAI0qK,GAAS,WAAW1qK,CAAI,EAC/B,OAAO+qK,GAAY,SAAS,EAAI,WAAW/qK,EAAK,KAAK,CAAC,CAEzD,CACD,OAAO+qK,GAAY,WAAW/qK,CAAI,CACpC,EAQAwsK,GAAS,qBAAuB,SAASxsK,EAAM2sK,EAAM,GAAO,CAC1D,GAAI,CAACL,GAAe,iBAAiBtsK,CAAI,EACvC,MAAM,MAAM,+BAA+B,EAE7C,MAAM0sK,EAAW,IAAIJ,GAAetsK,CAAI,EAExC,IAAI4sK,EACJ,GAAI,CAACF,EAAS,WACZE,EAAW7B,GAAY,SAAS,EAAE,MAE/B,CACH,MAAM8B,EAAWH,EAAS,eAC1B,GAAIG,EAAS,QAAU,KACrBD,EAAW,aAEJF,EAAS,mBAAoB,CACpC,IAAItgJ,EAAYygJ,EAAS,KAAK,CAAC,EAC/BzgJ,EAAYogJ,GAAS,OAAOpgJ,EAAWugJ,CAAK,EAE5C,MAAMnlJ,EAAcqlJ,EAAS,KAAK,CAAC,EACnCD,EAAW7B,GAAY,SAAS,IAAK,CAAC3+I,EAAW5E,CAAW,CAAC,CAC9D,MAEColJ,EAAWJ,GAAS,OAAOK,EAAUF,CAAK,EACtCC,EAAS,QAAU,MACrBA,EAAW,KAGhB,CACD,OAAO7B,GAAY,eACjB2B,EAAS,cAAa,EAAIA,EAAS,gBAAiB,EAAEE,CAAQ,CAClE,EAEA,IAAAE,GAAiBN,GC/FjB,MAAMA,IAAWtvK,GACX6tK,IAAclrK,GACd6qK,GAAWtpK,GAEX2rK,GAAiB,CAAA,EAIvBA,GAAe,OAAS,SAAS/sK,EAAMgtK,EAAYnC,EAAgB,GAAMoC,EAAY,GAAM,CACzF,OAAID,EAAWhtK,CAAI,EACV,GAEA6qK,GAAmBH,GAAS,aAAa1qK,CAAI,EAC7C+sK,GAAe,OAAO/sK,EAAK,KAAK,CAAC,EAAGgtK,EAAYnC,EAAiBoC,CAAW,EAE5EA,GAAevC,GAAS,cAAc1qK,CAAI,EAC1C+sK,GAAe,OAAO/sK,EAAK,QAASgtK,EAAYnC,EAAiBoC,CAAW,EAG9E,EACT,EAOAF,GAAe,QAAU,SACvB/sK,EAAMgtK,EAAYnC,EAAgB,GAAMoC,EAAY,GAAMC,EAAe,OAAW,CACpF,GAAIrC,IAAoB,IAAQqC,IAAmB,OACjD,MAAM,MAAM,iDAAiD,EAG/D,GAAIF,EAAWhtK,CAAI,EACjB,OAAOA,EAEJ,GAAI6qK,GAAmBH,GAAS,aAAa1qK,CAAI,EACpD,OAAOktK,EACLH,GAAe,QACb/sK,EAAK,KAAK,CAAC,EAAGgtK,EAAYnC,EAAiBoC,EAAaC,CAAc,CAAC,EAExE,GAAID,GAAevC,GAAS,cAAc1qK,CAAI,EACjD,OAAO+sK,GAAe,QACpB/sK,EAAK,QAASgtK,EAAYnC,EAAiBoC,EAAaC,CAAc,EAG1E,MAAM,MAAM,mEAAmE,CACjF,EAEAH,GAAe,WAAa,SAAS/sK,EAAM6qK,EAAgB,GAAMoC,EAAY,GAAM,CACjF,OAAOF,GAAe,OACpB/sK,EACCA,GAAS0qK,GAAS,WAAW1qK,EAAM,GAAG,EACvC6qK,EACAoC,CAAW,CACf,EAEAF,GAAe,YAAc,SAAS/sK,EAAO6qK,EAAgB,GAAMoC,EAAY,GAAM,CACnF,MAAMC,EAAiB,SAASltK,EAAM,CACpC,GAAI,CAAE0qK,GAAS,WAAW1qK,EAAM,GAAG,EACjC,MAAM,MAAM,qBAAqB,EAGnC,MAAMosB,EAAYpsB,EAAK,KAAK,CAAC,EACvBwnB,EAAcxnB,EAAK,KAAK,CAAC,EACzBmtK,EAAeX,IAAS,OAAOpgJ,CAAS,EAC9C,OAAO2+I,IAAY,SAAS,IAAK,CAACoC,EAAc3lJ,CAAW,CAAC,CAChE,EAEE,OAAOulJ,GAAe,QACpB/sK,EACCA,GAAS0qK,GAAS,WAAW1qK,EAAM,GAAG,EACvCitK,EACApC,EACAqC,CAAc,CAClB,EAEA,IAAAE,IAAiBL,GC7EjB,MAAMP,IAAWtvK,GACXwtK,GAAW7qK,GAQjB,SAASwtK,GAAcrtK,EAAM,CAK3B,GAJI,CAAC0qK,GAAS,WAAW1qK,EAAM,GAAG,GAI9BA,EAAK,KAAK,SAAW,EACvB,MAAO,GAGT,MAAMosB,EAAYpsB,EAAK,KAAK,CAAC,EACvBwnB,EAAcxnB,EAAK,KAAK,CAAC,EAK/B,GAAI,EAAE0qK,GAAS,WAAWt+I,EAAW,GAAG,GAAKA,EAAU,UACrD,MAAO,GAGT,MAAMkhJ,EAAoB5C,GAAS,aAAat+I,EAAU,KAAK,CAAC,CAAC,EAC3DogJ,IAAS,OAAOpgJ,EAAU,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC,EACvCA,EAAU,KAAK,CAAC,EAElBmhJ,EAAqB7C,GAAS,cAAct+I,EAAU,KAAK,CAAC,CAAC,EAC7DA,EAAU,KAAK,CAAC,EAAE,QAChBA,EAAU,KAAK,CAAC,EAExB,GAAI,EAAEs+I,GAAS,WAAW4C,CAAiB,GACrC5C,GAAS,WAAW6C,CAAkB,GAC1C,MAAO,GAKT,MAAMd,EAAmB/B,GAAS,cAAcljJ,CAAW,EACrDA,EAAY,QACVA,EAER,MAAKkjJ,EAAAA,GAAS,WAAW+B,CAAgB,CAK3C,CAOA,SAASe,IAAsBxtK,EAAM,CACnC,GAAI,CAACqtK,GAAcrtK,CAAI,EACrB,MAAM,MAAM,yBAAyB,EAGvC,OAAO0qK,GAAS,aAAa1qK,EAAK,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC,CACnD,CAKA,SAASytK,IAAoBztK,EAAM,CACjC,GAAI,CAACqtK,GAAcrtK,CAAI,EACrB,MAAM,MAAM,yBAAyB,EAGvC,MAAM0tK,EAAkBhD,GAAS,aAAa1qK,EAAK,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC,EAC5DA,EAAK,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,EACzBA,EAAK,KAAK,CAAC,EAAE,KAAK,CAAC,EAE3B,OAAO,SAAS0tK,EAAgB,KAAK,CACvC,CAIA,SAASC,IAAkB3tK,EAAM,CAC/B,GAAI,CAACqtK,GAAcrtK,CAAI,EACrB,MAAM,MAAM,yBAAyB,EAGvC,MAAMgsK,EAAgBtB,GAAS,cAAc1qK,EAAK,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC,EAC3DA,EAAK,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,QACnBA,EAAK,KAAK,CAAC,EAAE,KAAK,CAAC,EAE3B,OAAO,SAASgsK,EAAc,KAAK,CACrC,CAIA,SAAS4B,IAAoB5tK,EAAM,CACjC,GAAI,CAACqtK,GAAcrtK,CAAI,EACrB,MAAM,MAAM,yBAAyB,EAGvC,MAAM+rK,EAAkBrB,GAAS,cAAc1qK,EAAK,KAAK,CAAC,CAAC,EACrDA,EAAK,KAAK,CAAC,EAAE,QACXA,EAAK,KAAK,CAAC,EAEnB,OAAO,SAAS+rK,EAAgB,KAAK,CACvC,CAEA,IAAA8B,IAAiB,CACf,cAAAR,GACA,sBAAAG,IACA,oBAAAC,IACA,kBAAAE,IACA,oBAAAC,GACF,ECpHA,MAAMlD,IAAWxtK,GACXsuK,GAAO3rK,UAIb,MAAMiuK,WAAoBtC,EAAK,CAC7B,YAAYxrK,EAAM0rK,EAA2B,GAAO,CAClD,MAAM1rK,EAAM8tK,GAAY,aAAcpC,CAA0B,CACjE,CACH,EAKAoC,GAAY,aAAe,SAAS9tK,EAAM,CACxC,OAAO0qK,IAAS,WAAW1qK,EAAM,SAAS,CAC5C,EAIA8tK,GAAY,cAAgB,SAC1B9tK,EAAM0rK,EAA2B,GAAO,CACxC,OAAOF,GAAK,OACVxrK,EAAM8tK,GAAY,aAAcpC,CAA0B,CAC9D,EAEA,IAAAqC,IAAiBD,GC1BjB,MAAMzxK,GAAca,GACd4tK,GAAOjrK,GAOb,IAAAmuK,GAAA,KAAa,CACX,YAAYC,EAAYC,EAASxnD,EAASynD,EAAS,CAAA,EAAI,CACrD,GAAI,CAACznD,EACH,MAAM,MAAM,qBAAqB,EAEnC,GAAIunD,IAAe,QAAa,OAAOA,GAAgB,SACrD,MAAM,MAAM,wBAAyB,EAGvC,KAAK,WAAaA,EAClB,KAAK,QAAUC,EACf,KAAK,QAAUxnD,EACf,KAAK,SAAWynD,CACjB,CAED,YAAa,CACX,OAAO,KAAK,aAAe9xK,GAAY,SACxC,CACH,EAEA+xK,GAAO,kBAAoB,SAASpuK,EAAM,CACxC,OAAAA,EAAOA,EAAK,YACZA,EAAK,OAAOA,GAAQA,EAAK,WAAW,EAAE,QAAQquK,GAAU,CACtD,OAAOA,EAAO,WAClB,CAAG,EACMruK,CACT,EAIAouK,GAAO,SAAW,SAASpuK,EAAM,CAC/B,OAAO,IAAIouK,GAAO/xK,GAAY,UAAW,KAAM2D,CAAI,CACrD,EAKAouK,GAAO,YAAc,SACnBH,EAAYC,EAASxnD,EAAS4nD,EAAmB,GAAMC,EAAM,GAAI,CACjE,OAAID,IACFJ,EAAQ,YAAc,EACtBxnD,EAAQ,YAAc,GAGjB,IAAI0nD,GAAOH,EAAYC,EAASxnD,EAAS6nD,CAAK,CACvD,EAMAH,GAAO,aAAe,SAASpuK,EAAMwuK,EAAaC,EAAc,KAAM,CACpE,MAAMP,EAAUluK,EAAK,YACf0mH,EAAU1mH,EAAK,YACrB,IAAImuK,EAAWK,EAAY,SAE3B,GAAI,CAACA,EAAY,QACf,MAAM,MAAO,qCAAuCA,EAAY,UAAU,EAG5E,SAASE,EAAeP,EAAUroK,EAAI,CACpC,OAAAqoK,EAAS,IAAKptJ,GAAS,CACrBA,EAAOjb,EAAGib,CAAI,EACdA,EAAK,SAAW2tJ,EAAe3tJ,EAAK,SAAUjb,CAAE,CACtD,CAAK,EACMqoK,CACR,CAED,GAAIrD,GAAK,cAAc9qK,CAAI,EACzBkuK,EAAQ,QAAUM,EAAY,QAC9B9nD,EAAQ,QAAU8nD,EAAY,QAC9BL,EAAWO,EAAeP,EAAWptJ,GAAS,CAC5C,MAAMmtJ,EAAUluK,EAAK,YACf0mH,EAAU1mH,EAAK,YACrB,OAAAkuK,EAAQ,QAAUntJ,EAAK,QACvB2lG,EAAQ,QAAU3lG,EAAK,QACvBA,EAAK,QAAUmtJ,EACfntJ,EAAK,QAAU2lG,EACR3lG,CACb,CAAK,UAEO+pJ,GAAK,WAAW9qK,CAAI,GAAK8qK,GAAK,WAAW9qK,CAAI,GAC7CyuK,IAAkB,KAC1BP,EAAQ,KAAKO,CAAa,EAAID,EAAY,QAC1C9nD,EAAQ,KAAK+nD,CAAa,EAAID,EAAY,QAC1CL,EAAWO,EAAeP,EAAWptJ,GAAS,CAC5C,MAAMmtJ,EAAUluK,EAAK,YACf0mH,EAAU1mH,EAAK,YACrB,OAAAkuK,EAAQ,KAAKO,CAAa,EAAI1tJ,EAAK,QACnC2lG,EAAQ,KAAK+nD,CAAa,EAAI1tJ,EAAK,QACnCA,EAAK,QAAUmtJ,EACfntJ,EAAK,QAAU2lG,EACR3lG,CACb,CAAK,UAEM+pJ,GAAK,aAAa9qK,CAAI,EAC7BkuK,EAAQ,KAAK,CAAC,EAAIM,EAAY,QAC9B9nD,EAAQ,KAAK,CAAC,EAAI8nD,EAAY,QAC9BL,EAAWO,EAAeP,EAAWptJ,GAAS,CAC5C,MAAMmtJ,EAAUluK,EAAK,YACf0mH,EAAU1mH,EAAK,YACrB,OAAAkuK,EAAQ,KAAK,CAAC,EAAIntJ,EAAK,QACvB2lG,EAAQ,KAAK,CAAC,EAAI3lG,EAAK,QACvBA,EAAK,QAAUmtJ,EACfntJ,EAAK,QAAU2lG,EACR3lG,CACb,CAAK,MAGD,OAAM,MAAM,yBAA2B/gB,EAAK,IAAI,EAGlD,OAAO,IAAIouK,GAAOI,EAAY,WAAYN,EAASxnD,EAASynD,CAAQ,CACtE,EAEA,IAAAQ,GAAiBP,GC3HjB,MAAM/C,IAAUnuK,GACVkwK,IAAavtK,IACbguK,IAAczsK,IACd0sK,IAAcjqK,IACdyoK,IAAiB1zJ,GACjBw1J,IAAShsJ,GACTopJ,IAAOz2I,GACP+1I,IAAO91I,GAEb,IAAAh1B,GAAiB,CACf,QAAAqrK,IACA,WAAA+B,IACA,YAAAS,IACA,YAAAC,IACA,eAAAxB,IACF,OAAE8B,IACA,KAAA5C,IACA,KAAAV,GACF,EClBA,MAAMlrG,GAAO1iE,GAKb,SAAS0xK,GAAoB5uK,EAAM6uK,EAAc,CAC/C,GAAI,CAACjvG,GAAK,KAAK,WAAW5/D,EAAM,GAAG,EACjC,MAAO,GAET,MAAMmJ,EAAOnJ,EAAK,KAIlB,GAHI,CAACmJ,EAAK,MAAMmM,GAAKsqD,GAAK,KAAK,OAAOtqD,EAAGu5J,EAAa,YAAY,CAAC,GAG/D1lK,EAAK,SAAW,EAClB,MAAO,GAGT,MAAM2lK,EAAW3lK,EAAK,IAAImM,GAAK,IAAIu5J,EAAav5J,CAAC,CAAC,EAG5Cy5J,EAAYD,EAAS,CAAC,EACtBE,EAAaD,EAAU,cACvBE,EAAqBF,EAAU,gBAAgB,EAAI,EAGzD,OADkBD,EAAS,MAAM,CAAC,EACjB,MAAM5D,GAAQ,CAC7B,MAAMgE,EAAeF,EAAW,OAAO9D,EAAK,YAAa,CAAA,EAEnDiE,EADejE,EAAK,gBAAgB,EAAI,EACR,OAAO+D,CAAkB,EAC/D,OAAOC,GAAgBC,CAC3B,CAAG,CACH,CAGA,SAASC,IAA2BpvK,EAAM,CACxC,OAAO4uK,GAAoB5uK,EAAM4/D,GAAK,WAAW,CACnD,CAGA,SAASyvG,IAA8BrvK,EAAM,CAC3C,OAAO4uK,GAAoB5uK,EAAM4/D,GAAK,cAAc,CACtD,CAEA,IAAA0vG,GAAiB,CACf,oBAAAV,GACA,2BAAAQ,IACA,8BAAAC,GACF,EC/CA,MAAMzvG,GAAO1iE,GAKb,SAASqyK,GAAmBvvK,EAAM,CAChC,GAAI4/D,GAAK,KAAK,WAAW5/D,CAAI,GAAK4/D,GAAK,KAAK,WAAW5/D,CAAI,EACzD,OAAOA,EAAK,KAAK,MACdqC,GAAUktK,GAAmBltK,CAAK,CAAC,EAEnC,GAAIu9D,GAAK,KAAK,cAAc5/D,CAAI,EACnC,OAAOuvK,GAAmBvvK,EAAK,OAAO,EAEnC,GAAI4/D,GAAK,KAAK,WAAW5/D,EAAM,EAAI,EACtC,MAAO,GAEJ,GAAI4/D,GAAK,KAAK,SAAS5/D,CAAI,EAC9B,MAAO,GAEJ,GAAI4/D,GAAK,KAAK,aAAa5/D,CAAI,EAClC,OAAOuvK,GAAmBvvK,EAAK,KAAK,CAAC,CAAC,EAGtC,MAAM,MAAM,0BAA4BA,EAAK,IAAI,CAErD,CAEA,IAAAwvK,GAAiBD,GC3BjB,MAAM3vG,GAAO1iE,GACPqyK,GAAqB1vK,GAK3B,SAAS4vK,IAAaC,EAAU,CAC9B,MAAMnzD,EAAOmzD,EAAS,SAChBpzD,EAAQozD,EAAS,UAEjBC,EAAgB/vG,GAAK,KAAK,WAAW08C,CAAK,GACvC,WAAWA,EAAM,KAAK,IAAM,EAE/BszD,EAAehwG,GAAK,KAAK,WAAW28C,EAAM,GAAG,GAAK38C,GAAK,KAAK,WAAW28C,EAAM,GAAG,EAEtF,GAAI,EAAEozD,GAAiBC,GACrB,MAAO,GAST,GAAIhwG,GAAK,KAAK,WAAW28C,EAAM,GAAG,EAEhC,OADgBA,EAAK,KAAK,OAAOzvG,GAAO,CAACyiK,GAAmBziK,CAAG,CAAC,EACjD,QAAU,EAEtB,GAAI8yD,GAAK,KAAK,WAAW28C,EAAM,GAAG,EACrC,MAAO,CAACgzD,GAAmBhzD,CAAI,CAEnC,CAEA,IAAAszD,IAAiBJ,IClCjB,MAAM1E,IAAc7tK,GACdwtK,GAAW7qK,GAcjB,SAASiwK,IAAY9vK,EAAM,CACzB,OAAIA,EAAK,KACAA,EAAK,KAAK,CAAC,EAGXA,CAEX,CAMA,SAAS+vK,IAAgB/vK,EAAM,CAC7B,OAAI0qK,GAAS,WAAW1qK,CAAI,EACnB+qK,IAAY,SAAS,CAAC,EAGtB/qK,EAAK,KAAK,CAAC,CAEtB,CAIA,SAASgwK,IAA0BhwK,EAAM,CACvC,OAAS0qK,GAAS,WAAW1qK,EAAM,GAAG,GAC7B0qK,GAAS,WAAW1qK,EAAK,KAAK,CAAC,CAAC,GACjC0qK,GAAS,WAAW1qK,CAAI,CAClC,CAEA,IAAAiwK,GAAiB,CACf,YAAAH,IACA,gBAAAC,IACA,0BAAAC,GACF,ECjDA,MAAME,GAAsBhzK,GACtB0iE,GAAO//D,GAKb,SAASswK,IAAiCnwK,EAAM,CAC9C,GAAI,CAAC4/D,GAAK,KAAK,WAAW5/D,CAAI,GAAKA,EAAK,KAAO,IAC7C,MAAO,GAET,MAAMmJ,EAAOnJ,EAAK,KAOlB,GANI,CAACmJ,EAAK,MAAMmM,GAAK46J,GAAoB,0BAA0B56J,CAAC,CAAC,GAMjEnM,EAAK,MAAM2D,GAAO,CAAC8yD,GAAK,KAAK,WAAW9yD,EAAK,GAAG,CAAC,EACnD,MAAO,GAGT,MAAMsjK,EAAuBjnK,EAAK,IAAImM,GAAK46J,GAAoB,YAAY56J,CAAC,CAAC,EACvEy5J,EAAYqB,EAAqB,CAAC,EAGxC,OAFkBA,EAAqB,MAAM,CAAC,EAE7B,MAAMlF,GAAQ6D,EAAU,QAAU7D,EAAK,KAAK,CAC/D,CAEA,IAAAmF,IAAiBF,IC5BjB,MAAMvwG,GAAO1iE,GAIb,SAASozK,IAAmCtwK,EAAM,CAChD,GAAI,CAAC4/D,GAAK,KAAK,WAAW5/D,CAAI,GAAKA,EAAK,KAAO,IAC7C,MAAO,GAET,MAAMmJ,EAAOnJ,EAAK,KAIlB,GAHI,CAACmJ,EAAK,MAAMmM,GAAKsqD,GAAK,eAAe,iBAAiBtqD,CAAC,CAAC,GAGxDnM,EAAK,SAAW,EAClB,MAAO,GAGT,MAAMonK,EAAqBvwK,EAAK,KAAK,IAAIsV,GAAK,IAAIsqD,GAAK,eAAetqD,CAAC,CAAC,EACxE,GAAI,CAACi7J,EAAmB,MAAMC,GAAY,CAACA,EAAS,SAAQ,CAAE,EAC5D,MAAO,GAGT,MAAMzB,EAAYwB,EAAmB,CAAC,EAGtC,OAFkBA,EAAmB,MAAM,CAAC,EAE3B,MAAMrF,GAAQ6D,EAAU,kBAAoB7D,EAAK,cAAa,CAAE,CACnF,CAEA,IAAAuF,GAAiBH,ICxBjB,MAAMI,GAAkB,CAAA,EAIxBA,GAAgB,gBAAkB,SAASz8J,EAAO,CAChD,IAAI2b,EAAU,CAAA,EACd,GAAI3b,EAAS,EACX,OAAA2b,EAAU,CAAC,EAAE,EACbA,EAAUA,EAAQ,OAAO8gJ,GAAgB,gBAAgB,GAAKz8J,CAAM,CAAC,EAC9D2b,EAGT,MAAMR,EAAO,KAAK,KAAKnb,CAAM,EAC7B,IAAIhN,EAAY,EAChB,GAAIgN,EAAS,EAEX,IADAhN,EAAY,EACLgN,EAAShN,GAAaA,GAAamoB,GACxCnoB,EAAYA,EAAY,EAK5B,OAAIA,EAAYmoB,EACdQ,EAAQ,KAAK3b,CAAM,GAKnB2b,EAAQ,KAAK3oB,CAAS,EACtB2oB,EAAUA,EAAQ,OAAO8gJ,GAAgB,gBAAgBz8J,EAAOhN,CAAS,CAAC,GAGrE2oB,CACT,EAIA8gJ,GAAgB,eAAiB,SAASz8J,EAAO,CAC/C,MAAM2b,EAAU,CAAA,EAEV+gJ,EAAQ,KAAK,MAAM,KAAK,KAAK,KAAK,IAAI18J,CAAM,CAAC,CAAC,EACpD,QAASuY,EAAU,CAACmkJ,EAAOnkJ,GAAWmkJ,EAAOnkJ,IAC3C,GAAIA,IAAY,GAGZvY,EAASuY,IAAY,EAAG,CAC1B,MAAMokJ,EAAW38J,EAASuY,EAC1BoD,EAAQ,KAAK,CAACpD,EAASokJ,CAAQ,CAAC,CACjC,CAGH,OAAOhhJ,CACT,EAEA,IAAAihJ,GAAiBH,GCzDjB,MAAMrwG,IAAWnjE,GAEXsvK,GAAW3sK,GACX+/D,GAAOx+D,GAkCb,SAAS0vK,GAAgB9wK,EAAM,CAO7B,GAAI4/D,GAAK,YAAY,cAAc5/D,CAAI,EACrC,OAAOA,EAGT,GAAI4/D,GAAK,KAAK,WAAW5/D,EAAM,EAAI,EAAG,CAGpC,MAAM+wK,EAAYnxG,GAAK,QAAQ,SAASS,IAASrgE,CAAI,CAAC,EACtD,OAAIA,EAAK,cACP+wK,EAAU,YAAc/wK,EAAK,aAExB+wK,CACR,SACQnxG,GAAK,KAAK,WAAW5/D,CAAI,EAAG,CACnC,GAAI,OAAO,SAASA,EAAK,EAAE,EAAG,CAC5B,IAAIgxK,EACJ,OAAIhxK,EAAK,KAAO,IAGdgxK,EAAW,IAEJhxK,EAAK,KAAO,IAGnBgxK,EAAW,IAGXA,EAAWhxK,EAAK,GAEXixK,IAA0BjxK,EAAMgxK,CAAQ,CAChD,MAGChxK,EAAK,KAAK,QAAQ,CAACqC,EAAO1F,IAAM,CAC9BqD,EAAK,KAAKrD,CAAC,EAAIm0K,GAAgBzuK,CAAK,CAC5C,CAAO,EAEH,OAAOrC,CACR,KACI,IAAI4/D,GAAK,KAAK,cAAc5/D,CAAI,EACnC,OAAAA,EAAK,QAAU8wK,GAAgB9wK,EAAK,OAAO,EACpCA,EAEJ,GAAI4/D,GAAK,KAAK,aAAa5/D,CAAI,EAAG,CACrC,MAAM8M,EAAMgkK,GAAgB9wK,EAAK,KAAK,CAAC,CAAC,EAClCkxK,EAAgB1E,GAAS,OAAO1/J,EAAK,EAAI,EAC/C,OAAI9M,EAAK,cACPkxK,EAAc,YAAclxK,EAAK,aAE5BkxK,CACR,SACQtxG,GAAK,KAAK,WAAW5/D,CAAI,GAAKA,EAAK,GAAG,KAAM,CAOnD,MAAMmxK,EAAcL,GAAgB9wK,EAAK,EAAE,EACrCoxK,EAAeN,GAAgB9wK,EAAK,KAAK,CAAC,CAAC,EAGjD,OAFgB4/D,GAAK,QAAQ,SAC3B,IAAK,CAACuxG,EAAavxG,GAAK,QAAQ,YAAYwxG,CAAY,CAAC,CAAC,CAE7D,KACI,QAAIxxG,GAAK,KAAK,WAAW5/D,EAAM,KAAK,GACvCA,EAAK,KAAK,CAAC,EAAI8wK,GAAgB9wK,EAAK,KAAK,CAAC,CAAC,EACpCA,IAEA4/D,GAAK,KAAK,WAAW5/D,EAAM,SAAS,IAC3CA,EAAK,KAAK,CAAC,EAAI8wK,GAAgB9wK,EAAK,KAAK,CAAC,CAAC,EACvCA,EAAK,KAAK,CAAC,IACbA,EAAK,KAAK,CAAC,EAAI8wK,GAAgB9wK,EAAK,KAAK,CAAC,CAAC,IAEtCA,GAKX,CAQA,SAASixK,IAA0BjxK,EAAMgxK,EAAU,CAIjD,MAAMK,EAAWC,GAAYtxK,EAAMgxK,CAAQ,EAK3C,OAAIK,EAAS,SAAW,EACtBrxK,EAAOqxK,EAAS,CAAC,GAUbrxK,EAAK,KAAO,MAAQqxK,EAAS,OAAS,GAClBE,GAAgCvxK,CAAI,GAC1DA,EAAO4/D,GAAK,QAAQ,SAAS,IAAKyxG,CAAQ,EAGnCrxK,EAAK,KAAO,IACnBA,EAAO4/D,GAAK,QAAQ,SAAS,IAAKyxG,CAAQ,EAI1CrxK,EAAK,KAAOqxK,EAIVrxK,EAAK,KAAO,MACdA,EAAK,SAAW,KAGbA,CACT,CAOA,SAASsxK,GAAYtxK,EAAMgxK,EAAU,CAKnC,GAAI,CAACpxG,GAAK,KAAK,WAAW5/D,CAAI,EAC5B,MAAO,CAAC8wK,GAAgB9wK,CAAI,CAAC,EAE/B,OAAQA,EAAK,GAAE,CAEf,IAAK,IACL,IAAK,IACH,GAAIgxK,IAAa,IACf,MAAO,CAACF,GAAgB9wK,CAAI,CAAC,EAE/B,MACF,IAAK,IACL,IAAK,IACH,GAAIgxK,IAAa,IACf,MAAO,CAACF,GAAgB9wK,CAAI,CAAC,EAE/B,MACF,QACE,MAAO,CAAC8wK,GAAgB9wK,CAAI,CAAC,CAC9B,CACD,GAAI4/D,GAAK,eAAe,iBAAiB5/D,EAAM,EAAI,EACjD,OAAAA,EAAK,KAAK,QAAQ,CAAC8M,EAAKnQ,IAAM,CAC5BqD,EAAK,KAAKrD,CAAC,EAAIm0K,GAAgB9wK,EAAK,KAAKrD,CAAC,CAAC,CACjD,CAAK,EACM,CAACqD,CAAI,EAOT,GAAIgxK,IAAa,KAAOQ,IAA+BxxK,CAAI,EAC9D,OAAOyxK,IAA2BzxK,CAAI,EAEnC,GAAIgxK,IAAa,KAAOhxK,EAAK,KAAO,IACvC,OAAO0xK,IAAgB1xK,CAAI,EAExB,GAAIA,EAAK,KAAO,IAAK,CAExB,MAAM2xK,EAAgB3xK,EAAK,KAAK,CAAC,EAC3B4xK,EAAwBpF,GAAS,OAAOmF,EAAe,EAAI,EAC3DN,EAAW,CACfC,GAAYtxK,EAAK,KAAK,CAAC,EAAGgxK,CAAQ,EAClCM,GAAYM,EAAuBZ,CAAQ,CACjD,EACI,MAAO,CAAE,EAAC,OAAO,MAAM,CAAE,EAAEK,CAAQ,CACpC,KACI,CACH,MAAMA,EAAW,CAAA,EACjB,OAAArxK,EAAK,KAAK,QAASqC,GAAU,CAE3BgvK,EAAS,KAAKC,GAAYjvK,EAAO2uK,CAAQ,CAAC,CAChD,CAAK,EACM,CAAE,EAAC,OAAO,MAAM,CAAE,EAAEK,CAAQ,CACpC,CACH,CAWA,SAASG,IAA+BxxK,EAAM,CAM5C,GAJIA,EAAK,KAAO,KAIZA,EAAK,KAAK,SAAW,EACvB,MAAO,GAIT,MAAM2xK,EAAgB3xK,EAAK,KAAK,CAAC,EACjC,OAAI4/D,GAAK,eAAe,iBAAiB+xG,CAAa,EAE7C,CADU,IAAI/xG,GAAK,eAAe+xG,CAAa,EACrC,WAGV,EAEX,CAMA,SAASF,IAA2BzxK,EAAM,CAExC,MAAMqxK,EAAWC,GAAYtxK,EAAK,KAAK,CAAC,EAAG,GAAG,EAQxC6xK,EAAcR,EAAS,MAGvBS,EAAchB,GAAgB9wK,EAAK,KAAK,CAAC,CAAC,EAGhD,OAAI4/D,GAAK,KAAK,6BAA6BiyG,CAAW,EAEpDR,EAAS,KACPzxG,GAAK,QAAQ,SAAS,IAAK,CAACiyG,EAAaC,CAAW,EAAG,EAAK,CAAC,GAI/DT,EAAS,KAAKQ,CAAW,EACzBR,EAAS,KAAKS,CAAW,GAEpBT,CACT,CAOA,SAASK,IAAgB1xK,EAAM,CAI7B,IAAIqxK,EAAWC,GAAYtxK,EAAK,KAAK,CAAC,EAAG,GAAG,EAE5C,GAAIqxK,EAAS,SAAW,EACtBrxK,EAAK,KAAK,CAAC,EAAIqxK,EAAS,IAAG,EAC3BrxK,EAAK,KAAK,CAAC,EAAI8wK,GAAgB9wK,EAAK,KAAK,CAAC,CAAC,EAC3CqxK,EAAW,CAACrxK,CAAI,MAEb,CAEH,MAAMosB,EAAYilJ,EAAS,MAErB7pJ,EAAcspJ,GAAgB9wK,EAAK,KAAK,CAAC,CAAC,EAG1C+xK,EAAenyG,GAAK,QAAQ,SAAS,IAAK,CAACxzC,EAAW5E,CAAW,CAAC,EACxE6pJ,EAAS,KAAKU,CAAY,CAC3B,CAED,OAAOV,CACT,CAMA,SAASE,GAAgCvxK,EAAM,CAC7C,OAAK4/D,GAAK,KAAK,WAAW5/D,CAAI,EAG1BA,EAAK,KAAO,IACP,GAGLA,EAAK,KAAO,IACP,GAEFA,EAAK,KAAK,KAAKuxK,EAA+B,EAT5C,EAUX,CAEA,IAAAS,GAAiBlB,GC7VjB,MAAMh3J,IAAU5c,GACV0iE,GAAO//D,GAOb,SAASoyK,IAAWjyK,EAAMkyK,EAAc,GAAO,CAC7ClyK,EAAO8Z,IAAQ9Z,EAAK,UAAW,CAAA,EAE/B,IAAIsY,EAAS65J,GAAmBnyK,CAAI,EACpC,OAAKkyK,IACH55J,EAASA,EAAO,QAAQ,oBAAqB,KAAK,GAE7CA,CACT,CAEA,SAAS65J,GAAmBnyK,EAAMoyK,EAAY,CAC5C,GAAIxyG,GAAK,eAAe,iBAAiB5/D,CAAI,EAAG,CAC9C,MAAMwwK,EAAW,IAAI5wG,GAAK,eAAe5/D,CAAI,EAG7C,GAAIwwK,EAAS,iBAAgB,GAAMxwK,EAAK,KAAO,IAAK,CAClD,MAAMqyK,EAAY7B,EAAS,eACrB8B,EAAWH,GAAmBE,CAAS,EAEvCE,EAAe3yG,GAAK,QAAQ,eAChC4wG,EAAS,cAAe,EAAEA,EAAS,SAAU,IAAI,EAC7CgC,EAAcL,GAAmBI,CAAY,EAEnD,MAAO,GAAGD,CAAQ,IAAIE,CAAW,EAClC,CACF,CAED,GAAI5yG,GAAK,KAAK,kBAAkB5/D,CAAI,EAClC,MAAO,GAAGA,EAAK,KAAK,CAAC,CAAC,IAAIA,EAAK,KAAK,CAAC,CAAC,GAGxC,GAAI4/D,GAAK,KAAK,WAAW5/D,CAAI,EAAG,CAC9B,GAAIA,EAAK,KAAO,KAAO4/D,GAAK,KAAK,WAAW5/D,EAAK,KAAK,CAAC,CAAC,EACtD,MAAO,GAAGmyK,GAAmBnyK,EAAK,KAAK,CAAC,CAAC,CAAC,OAAOmyK,GAAmBnyK,EAAK,KAAK,CAAC,CAAC,CAAC,IAGnF,IAAIyyK,EAAW,GAEf,OAAQzyK,EAAK,GAAE,CACf,IAAK,IACL,IAAK,IAEHyyK,EAAW,IAAIzyK,EAAK,EAAE,IACtB,MACF,IAAK,IACH,GAAIA,EAAK,SACP,MAEFyyK,EAAW,IAAIzyK,EAAK,EAAE,IACtB,MACF,IAAK,IAEC4/D,GAAK,KAAK,mBAAmB5/D,EAAM,EAAI,EACzCyyK,EAAW,GAAGzyK,EAAK,EAAE,GAGrByyK,EAAW,IAAIzyK,EAAK,EAAE,IAExB,MACF,IAAK,IAEHyyK,EAAW,GAAGzyK,EAAK,EAAE,GACrB,KACD,CAED,IAAI0C,EAAM1C,EAAK,KAAK,IAAI8M,GAAOqlK,GAAmBrlK,EAAK9M,CAAI,CAAC,EAAE,KAAKyyK,CAAQ,EAM3E,OAAIL,GACAxyG,GAAK,KAAK,WAAWwyG,CAAU,GAC/BpyK,EAAK,IAAMoyK,EAAW,IACtB,MAAM,QAAQA,EAAW,EAAE,GAAK,GAChC,KAAK,QAAQpyK,EAAK,EAAE,GAAK,IAC3B0C,EAAM,IAAIA,CAAG,KAGRA,CACR,KACI,QAAIk9D,GAAK,KAAK,cAAc5/D,CAAI,EAC5B,IAAImyK,GAAmBnyK,EAAK,OAAO,CAAC,IAEpC4/D,GAAK,KAAK,aAAa5/D,CAAI,EAC9B4/D,GAAK,KAAK,WAAW5/D,EAAK,KAAK,CAAC,CAAC,GACjC,MAAM,QAAQA,EAAK,KAAK,CAAC,EAAE,EAAE,IAAM,IACnC,CAAC4/D,GAAK,eAAe,iBAAiB5/D,CAAI,EACrC,KAAKmyK,GAAmBnyK,EAAK,KAAK,CAAC,CAAC,CAAC,IAGrC,IAAImyK,GAAmBnyK,EAAK,KAAK,CAAC,CAAC,CAAC,GAItCA,EAAK,UAEhB,CAKA,SAAS0yK,IAAW1yK,EAAMkyK,EAAc,GAAO,CAC7C,IAAIS,EAAU3yK,EAAK,MAAM,CAAC,SAAU,OAAQ,YAAa,EAAI,CAAC,EAE9D,OAAKkyK,IAEHS,EAAUA,EAAQ,QAAQ,oBAAqB,KAAK,EAAE,WAAW,SAAU,SAAS,EAAE,WAAW,SAAU,EAAE,GAGxGA,CACT,CAEA,IAAAltH,GAAiB,CACf,MAAOwsH,IACP,MAAOS,GACT,EC5HA,MAAMpyG,GAAOpjE,GAEPb,GAAcwD,GACd6wK,GAAkBtvK,GAClBorK,GAAW3oK,GACX+7D,GAAOhnD,GACP6sC,GAAQrjC,GAId,SAASwyB,GAAQ50C,EAAM,CACrB,GAAI,CAAC4/D,GAAK,KAAK,WAAW5/D,EAAM,SAAS,EACvC,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAGlC,MAAMmrK,EAAeyH,GAAgB5yK,CAAI,EAEzC,GAAI4/D,GAAK,KAAK,WAAWurG,CAAY,EAAG,CACtC,GAAIA,EAAa,KAAO,IACtB,OAAO0H,GAAgB7yK,CAAI,EAExB,GAAImrK,EAAa,KAAO,IAC3B,OAAO2H,GAAsB9yK,CAAI,CAEpC,SACQ4/D,GAAK,KAAK,WAAWurG,CAAY,EACxC,OAAO4H,IAAgB/yK,CAAI,EAG7B,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,CAClC,CAOA,SAAS6yK,GAAgB7yK,EAAM,CAC7B,IAAI0mH,EAAU1mH,EAAK,YAEnB,MAAMmrK,EAAeyH,GAAgB5yK,CAAI,EACnCorK,EAAW4H,GAAYhzK,CAAI,EAC3B4rK,EAAWT,EAAa,KAAK,CAAC,EAC9B8H,EAAerzG,GAAK,KAAK,cAAcurG,EAAa,KAAK,CAAC,CAAC,EACzDA,EAAa,KAAK,CAAC,EAAE,QACrBA,EAAa,KAAK,CAAC,EAC3B,GAAIC,EAAS,OAAO6H,CAAY,EAC9B,OAAAvsD,EAAUklD,EACHhsG,GAAK,OAAO,YACjBvjE,GAAY,yBAA0B2D,EAAM0mH,CAAO,EAElD,GAAI9mD,GAAK,KAAK,WAAWwrG,CAAQ,GAAKxrG,GAAK,KAAK,WAAWqzG,CAAY,EAAG,CAC7E,MAAMC,EAAY,WAAW9H,EAAS,KAAK,EACrC+H,EAAgB,WAAWF,EAAa,KAAK,EACnD,GAAIC,EAAYC,IAAkB,EAAG,CACnC,MAAMC,EAAeF,EAAUC,EACzBE,EAAczzG,GAAK,QAAQ,SAASwzG,CAAY,EAEtD,OAAA1sD,EAAU9mD,GAAK,QAAQ,QAAQgsG,EAAUyH,CAAW,EAC7CzzG,GAAK,OAAO,YACjBvjE,GAAY,gBAAiB2D,EAAM0mH,CAAO,CAC7C,SACQysD,EAAgBD,IAAc,EAAG,CACxC,MAAMI,EAAmBH,EAAcD,EACjCK,EAAkB3zG,GAAK,QAAQ,SAAS0zG,CAAgB,EAE9D,OAAA5sD,EAAU9mD,GAAK,QAAQ,SAAS,IAAK,CAACgsG,EAAU2H,CAAe,CAAC,EACzD3zG,GAAK,OAAO,YACjBvjE,GAAY,YAAa2D,EAAM0mH,CAAO,CACzC,CACF,CAED,OAAO9mD,GAAK,OAAO,SAAS5/D,CAAI,CAClC,CAYA,SAAS8yK,GAAsB9yK,EAAM,CACnC,IAAI0mH,EAAU1mH,EAAK,YACnB,MAAMorK,EAAW4H,GAAYhzK,CAAI,EAE3BmuK,EAAW,CAAA,EACjB,IAAIqF,EACJ,OAAI5zG,GAAK,KAAK,WAAWwrG,CAAQ,GAAK,CAACoB,GAAS,WAAWpB,CAAQ,IAEjEoI,EAASC,IAAoB/sD,CAAO,EAChC8sD,EAAO,eACTrF,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,GAIxDA,EAASE,IAAiBhtD,CAAO,EAC7B8sD,EAAO,eACTrF,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,GAIxDA,EAASG,IAAgCjtD,CAAO,EAC5C8sD,EAAO,eACTrF,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAClD9sD,EAAQ,KAAK,CAAC,EAAE,KAAO,OACzB8sD,EAASX,GAAgBnsD,CAAO,EAChCynD,EAAS,KAAKqF,CAAM,EACb5zG,GAAK,OAAO,YACjBvjE,GAAY,eAAgB2D,EAAMwzK,EAAO,QAAS,GAAMrF,CAAQ,IAMxEqF,EAASI,IAAkBltD,CAAO,EAClCynD,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAGtDA,EAASK,IAA2BntD,CAAO,EACvC8sD,EAAO,cACTrF,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAGtDA,EAASM,IAAaptD,CAAO,EACzB8sD,EAAO,eACTrF,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,GAGjD5zG,GAAK,OAAO,YACjBvjE,GAAY,eAAgB2D,EAAM0mH,EAAS,GAAMynD,CAAQ,GAGtDvuG,GAAK,OAAO,SAAS5/D,CAAI,EAClC,CAKA,SAASyzK,IAAoBzzK,EAAM,CACjC,MAAM0mH,EAAU1mH,EAAK,YACfmrK,EAAeyH,GAAgB5yK,CAAI,EACzC,IAAIukH,EAAW,CAAA,EACXwvD,EAAW,GAyBf,OAxBA5I,EAAa,KAAK,QAAQ9oK,GAAS,CACjC,GAAIu9D,GAAK,eAAe,iBAAiBv9D,CAAK,EAAG,CAC/C,MAAMmuK,EAAW,IAAI5wG,GAAK,eAAev9D,CAAK,EACxCwpK,EAAY2E,EAAS,eACrBwD,EAAkBp0G,GAAK,QAAQ,eACnC4wG,EAAS,cAAa,EAAIA,EAAS,gBAAiB,EAAE,IAAI,EAC5D,GAAI3E,EAAW,CACb,MAAMoI,EAAcC,GAAerI,CAAS,EACxCoI,EAAY,OAAS,IACvBF,EAAW,IAEbxvD,EAAWA,EAAS,OAAO0vD,CAAW,CACvC,CACD1vD,EAAS,KAAKyvD,CAAe,CAC9B,KACI,CACH,MAAMC,EAAcC,GAAe7xK,CAAK,EACpC4xK,EAAY,OAAS,IACvBF,EAAW,IAEbxvD,EAAWA,EAAS,OAAO0vD,CAAW,CACvC,CACL,CAAG,EAEGF,GACFrtD,EAAQ,KAAK,CAAC,EAAI9mD,GAAK,QAAQ,SAAS,IAAK2kD,CAAQ,EAC9C3kD,GAAK,OAAO,YACjBvjE,GAAY,mBAAoB2D,EAAM0mH,CAAO,GAG1C9mD,GAAK,OAAO,SAAS5/D,CAAI,CAClC,CAEA,SAASk0K,GAAel0K,EAAM,CAC5B,GAAI4/D,GAAK,KAAK,WAAW5/D,CAAI,GAAK,CAACwsK,GAAS,WAAWxsK,CAAI,EAAG,CAC5D,MAAMsB,EAAQ,WAAWtB,EAAK,KAAK,EAGnC,OAFgB0wK,GAAgB,gBAAgBpvK,CAAK,EACzB,IAAIs+D,GAAK,QAAQ,QAAQ,CAEtD,CACD,MAAO,CAAC5/D,CAAI,CACd,CAKA,SAAS0zK,IAAiB1zK,EAAM,CAC9B,IAAI0mH,EAAU1mH,EAAK,YACnB,MAAMmrK,EAAeyH,GAAgB5yK,CAAI,EACnCorK,EAAW4H,GAAYhzK,CAAI,EAC3BkzK,EAAY,WAAW9H,EAAS,KAAK,EAE3CD,EAAa,KAAK,KAAKgJ,GAAS,EAEhC,MAAMC,EAAcjJ,EAAa,KAAK,IAAIr+J,GAAO24C,GAAM,MAAM34C,CAAG,CAAC,EAIjE,GAAI,CAAC,GAAG,IAAI,IAAIsnK,CAAW,CAAC,EAAE,SAAWA,EAAY,OACnD,OAAOx0G,GAAK,OAAO,SAAS5/D,CAAI,EAKlC,MAAMkd,EAAQ,CAAA,EAEdiuJ,EAAa,KAAK,QAAQr+J,GAAO,CAC/B,MAAMunK,EAAY5uH,GAAM,MAAM34C,CAAG,EACjCoQ,EAAMm3J,CAAS,EAAIn3J,EAAMm3J,CAAS,IAAMn3J,EAAMm3J,CAAS,EAAI,CAC/D,CAAG,EA6BD,MAAMC,EA3Ba,OAAO,KAAKp3J,CAAK,EAEH,IAAIrgB,GAAO,CAC1C,IAAI03K,EAAWr3J,EAAMrgB,CAAG,EACxB,MAAMquK,EAAO5qG,GAAK,MAAMzjE,CAAG,EACrB23K,EAAQtB,EAER/pK,EAAO,CAAA,EAGb,KAAOorK,EAAWC,EAAQ,GACxBD,GAAYC,EACZrrK,EAAK,KAAKy2D,GAAK,QAAQ,YACrBA,GAAK,QAAQ,SAAS,IAAK,MAAM40G,CAAK,EAAE,KAAKtJ,CAAI,CAAC,CAAC,CAAC,EAIxD,MAAMuJ,EAAYF,IAAa,EAC3BrJ,EACAtrG,GAAK,QAAQ,YACbA,GAAK,QAAQ,SAAS,IAAK,MAAM20G,CAAQ,EAAE,KAAKrJ,CAAI,CAAC,CAAC,EAC1D,OAAA/hK,EAAK,KAAKsrK,CAAS,EAEZtrK,CACX,CAAG,EAG8B,OAAO,CAACs6C,EAAKtrB,IAAQsrB,EAAI,OAAOtrB,CAAG,EAAG,CAAE,CAAA,EAEjEu8I,EAAU90G,GAAK,QAAQ,SAAS,IAAK00G,CAAQ,EAEnD,OAAA5tD,EAAU9mD,GAAK,QAAQ,QAAQ80G,EAAStJ,CAAQ,EAEzCxrG,GAAK,OAAO,YACjBvjE,GAAY,oBAAqB2D,EAAM0mH,CAAO,CAClD,CAKA,SAASitD,IAAgC3zK,EAAM,CAC7C,MAAM0mH,EAAU1mH,EAAK,YAEfmrK,EAAeyH,GAAgB5yK,CAAI,EAEzC,GAAI4/D,GAAK,KAAK,cAAcurG,CAAY,EAAG,CACzC,MAAM9oK,EAAQ8oK,EAAa,QAC3B,GAAIwJ,GAA6BtyK,CAAK,EAAG,CACvC,MAAMupK,EAAWvpK,EAAM,KAAK,CAAC,EACvB4wK,EAAerzG,GAAK,QAAQ,SAASv9D,EAAM,KAAK,MAAM,EAC5D,OAAAqkH,EAAQ,KAAK,CAAC,EAAI9mD,GAAK,QAAQ,SAAS,IAAK,CAACgsG,EAAUqH,CAAY,CAAC,EAC9DrzG,GAAK,OAAO,YACjBvjE,GAAY,mCAAoC2D,EAAM0mH,CAAO,CAChE,CACF,SACQ9mD,GAAK,KAAK,WAAWurG,EAAc,GAAG,EAAG,CAChD,MAAM5mD,EAAW,CAAA,EACjB,OAAA4mD,EAAa,KAAK,QAAQ9oK,GAAS,CACjC,GAAIu9D,GAAK,KAAK,cAAcv9D,CAAK,EAAG,CAClC,MAAMuyK,EAAavyK,EAAM,QACzB,GAAIsyK,GAA6BC,CAAU,EAAG,CAC5C,MAAMhJ,EAAWgJ,EAAW,KAAK,CAAC,EAC5B3B,EAAerzG,GAAK,QAAQ,SAASg1G,EAAW,KAAK,MAAM,EACjErwD,EAAS,KAAK3kD,GAAK,QAAQ,SAAS,IAAK,CAACgsG,EAAUqH,CAAY,CAAC,CAAC,EAClE,MACD,CACF,CACD1uD,EAAS,KAAKliH,CAAK,CACzB,CAAK,EAEDqkH,EAAQ,KAAK,CAAC,EAAI9mD,GAAK,QAAQ,SAAS,IAAK2kD,CAAQ,EAC9C3kD,GAAK,OAAO,YACjBvjE,GAAY,mCAAoC2D,EAAM0mH,CAAO,CAChE,CAED,OAAO9mD,GAAK,OAAO,SAAS5/D,CAAI,CAClC,CAKA,SAAS4zK,IAAkB5zK,EAAM,CAC/B,IAAI0mH,EAAU1mH,EAAK,YACnB,MAAMmrK,EAAeyH,GAAgB5yK,CAAI,EACnCorK,EAAW4H,GAAYhzK,CAAI,EAE3BukH,EAAW,CAAA,EACjB,QAAS,EAAI,EAAG,EAAI4mD,EAAa,KAAK,OAAQ,IAAK,CACjD,MAAM9oK,EAAQ8oK,EAAa,KAAK,CAAC,EACjC5mD,EAAS,KAAK3kD,GAAK,QAAQ,QAAQv9D,EAAO+oK,CAAQ,CAAC,CACpD,CAED,OAAA1kD,EAAU9mD,GAAK,QAAQ,SAAS,IAAK2kD,CAAQ,EACtC3kD,GAAK,OAAO,YACjBvjE,GAAY,oBAAqB2D,EAAM0mH,CAAO,CAClD,CAKA,SAASmtD,IAA2B7zK,EAAM,CACxC,MAAM0mH,EAAU1mH,EAAK,YAEfmuK,EAAW,CAAA,EACjB,QAASxxK,EAAI,EAAGA,EAAI+pH,EAAQ,KAAK,OAAQ/pH,IAAK,CAC5C,MAAM0F,EAAQqkH,EAAQ,KAAK/pH,CAAC,EACtBk4K,EAAkBjgI,GAAQvyC,CAAK,EACjCwyK,EAAgB,eAClBnuD,EAAQ,KAAK/pH,CAAC,EAAIk4K,EAAgB,QAClC1G,EAAS,KAAKvuG,GAAK,OAAO,aAAa8mD,EAASmuD,EAAiBl4K,CAAC,CAAC,EAEtE,CAED,OAAIwxK,EAAS,SAAW,EACfvuG,GAAK,OAAO,SAAS5/D,CAAI,EAEzBmuK,EAAS,SAAW,EACpBA,EAAS,CAAC,EAGVvuG,GAAK,OAAO,YACjBvjE,GAAY,8BAA+B2D,EAAM0mH,EAAS,GAAMynD,CAAQ,CAE9E,CAOA,SAAS2F,IAAa9zK,EAAM,CAC1B,IAAI0mH,EAAU1mH,EAAK,YAEforK,EACJ,MAAM7mD,EAAW,CAAA,EACXuwD,EAAe,CAAA,EACrB,QAAS,EAAI,EAAG,EAAIpuD,EAAQ,KAAK,OAAQ,IAAK,CAC5C,MAAMrkH,EAAQqkH,EAAQ,KAAK,CAAC,EACxB9mD,GAAK,KAAK,WAAWv9D,EAAO,SAAS,GACvCyyK,EAAa,KAAKzyK,EAAM,KAAK,CAAC,CAAC,EAC/B+oK,EAAW4H,GAAY3wK,CAAK,GAG5BkiH,EAAS,KAAKliH,CAAK,CAEtB,CAED,GAAIkiH,EAAS,OAAS,EAAG,CACvB,GAAIuwD,EAAa,OAAS,EAAG,CAC3B,MAAM3J,EAAe2J,EAAa,SAAW,EAC3CA,EAAa,CAAC,EAAIl1G,GAAK,QAAQ,SAAS,IAAKk1G,CAAY,EAC3DvwD,EAAS,KAAK3kD,GAAK,QAAQ,QAAQurG,EAAcC,CAAQ,CAAC,CAC3D,CAGD,GADA1kD,EAAU9mD,GAAK,QAAQ,SAAS,IAAK2kD,CAAQ,EACzC,CAACmC,EAAQ,OAAO1mH,CAAI,EACtB,OAAO4/D,GAAK,OAAO,YACjBvjE,GAAY,mBAAoB2D,EAAM0mH,CAAO,CAElD,CAGD,OAAO9mD,GAAK,OAAO,SAAS5/D,CAAI,CAClC,CAKA,SAAS+yK,IAAgB/yK,EAAM,CAC7B,IAAI0mH,EAAU1mH,EAAK,YACnB,MAAMmrK,EAAeyH,GAAgB5yK,CAAI,EACnCorK,EAAW4H,GAAYhzK,CAAI,EAEjC,GAAIwsK,GAAS,WAAWrB,CAAY,EAClC,OAAOvrG,GAAK,OAAO,SAAS5/D,CAAI,EAE7B,GAAI,CAAC4/D,GAAK,KAAK,WAAWwrG,CAAQ,GAAKoB,GAAS,WAAWpB,CAAQ,EACtE,OAAOxrG,GAAK,OAAO,SAAS5/D,CAAI,EAGlC,MAAM+0K,EAAgB,WAAW5J,EAAa,KAAK,EAC7C+H,EAAY,WAAW9H,EAAS,KAAK,EACrC4J,EAAe10G,GAAK,QAAQy0G,EAAe7B,CAAS,EACpD+B,EAAsB30G,GAAK,MAAM00G,CAAY,EAInD,GAAI10G,GAAK,IAAI20G,EAAqB/B,CAAS,IAAM6B,EAC/C,OAAAruD,EAAU9mD,GAAK,QAAQ,SAASq1G,CAAmB,EAC5Cr1G,GAAK,OAAO,YACjBvjE,GAAY,eAAgB2D,EAAM0mH,CAAO,EAIxC,CAEH,MAAM92F,EAAU8gJ,GAAgB,gBAAgBqE,CAAa,EAC7D,GAAInlJ,EAAQ,OAAS,EAAG,CACtB,IAAIu+I,EAAW,CAAA,EACf,MAAM8F,EAAcrkJ,EAAQ,IAAIgwC,GAAK,QAAQ,QAAQ,EAErD8mD,EAAQ,KAAK,CAAC,EAAI9mD,GAAK,QAAQ,SAAS,IAAKq0G,CAAW,EACxD9F,EAAS,KAAKvuG,GAAK,OAAO,YACxBvjE,GAAY,mBAAoB2D,EAAM0mH,CAAO,CAAC,EAGhD,MAAMwuD,EAAapC,GAAsBpsD,CAAO,EAChD,GAAIwuD,EAAW,aACb,OAAA/G,EAAWA,EAAS,OAAO+G,EAAW,QAAQ,EAC9CxuD,EAAUwuD,EAAW,QAEdt1G,GAAK,OAAO,YACjBvjE,GAAY,eAAgB2D,EAAM0mH,EAAS,GAAMynD,CAAQ,CAE9D,CACF,CAED,OAAOvuG,GAAK,OAAO,SAAS5/D,CAAI,CAClC,CAOA,SAASgzK,GAAYhzK,EAAM,CACzB,GAAI,CAAC4/D,GAAK,KAAK,WAAW5/D,EAAM,SAAS,EACvC,MAAM,MAAM,kBAAkB,EAGhC,OAAOA,EAAK,KAAK,SAAW,EAAIA,EAAK,KAAK,CAAC,EAAI4/D,GAAK,QAAQ,SAAS,CAAC,CACxE,CAGA,SAASgzG,GAAgB5yK,EAAM,CAC7B,GAAI,CAAC4/D,GAAK,KAAK,WAAW5/D,EAAM,SAAS,EACvC,MAAM,MAAM,kBAAkB,EAGhC,OAAOA,EAAK,KAAK,CAAC,CACpB,CAIA,SAASm0K,IAAU3yK,EAAGC,EAAG,CACvB,OAAIm+D,GAAK,KAAK,WAAWp+D,CAAC,GAAKo+D,GAAK,KAAK,WAAWn+D,CAAC,EAC5C,WAAWD,EAAE,KAAK,EAAI,WAAWC,EAAE,KAAK,EAExCm+D,GAAK,KAAK,WAAWp+D,CAAC,EACtB,GAEAo+D,GAAK,KAAK,WAAWn+D,CAAC,EACtB,EAEF,CACT,CAIA,SAASkzK,GAA6B30K,EAAM,CAC1C,GAAI,CAAC4/D,GAAK,KAAK,WAAW5/D,CAAI,GAAKA,EAAK,KAAO,IAC7C,MAAO,GAGT,MAAMo0K,EAAcp0K,EAAK,KAAK,IAAIylD,GAAM,KAAK,EAG7C,MAAO,CAAC,GAAG,IAAI,IAAI2uH,CAAW,CAAC,EAAE,SAAW,CAC9C,CAEA,IAAAe,GAAiB,CACf,gBAAAvC,GACA,YAAAI,GACA,QAAAp+H,EACF,EClfA,MAAMgrB,GAAO1iE,GACPk4K,GAAUv1K,GAKhB,SAASw1K,IAA6Br1K,EAAM,CAI1C,GAAI,CAAC4/D,GAAK,KAAK,WAAW5/D,EAAM,GAAG,GAC5B,CAAEA,EAAK,KAAK,MAAMkrK,GAAQtrG,GAAK,KAAK,WAAWsrG,EAAM,SAAS,CAAC,EACpE,MAAO,GAIT,MAAM6D,EAAY/uK,EAAK,KAAK,CAAC,EACvBorK,EAAWgK,GAAQ,YAAYrG,CAAS,EAE9C,OAAO/uK,EAAK,KAAK,MACfkrK,GAAQkK,GAAQ,YAAYlK,CAAI,EAAE,OAAOE,CAAQ,CAAC,CACtD,CAEA,IAAAkK,IAAiBD,ICvBjB,MAAMz1G,GAAO1iE,GAIb,SAASq4K,IAAwBv1K,EAAM,CAYrC,OATIA,EAAK,KAAO,KAAOA,EAAK,UAGxBA,EAAK,KAAK,SAAW,GAGrB,CAAC4/D,GAAK,KAAK,6BAA6B5/D,EAAK,KAAK,CAAC,CAAC,GAGpD,CAAC4/D,GAAK,eAAe,iBAAiB5/D,EAAK,KAAK,CAAC,CAAC,EAC7C,GAIF,CADU,IAAI4/D,GAAK,eAAe5/D,EAAK,KAAK,CAAC,CAAC,EACpC,UACnB,CAEA,IAAAw1K,GAAiBD,ICxBjB,MAAMjG,IAAkBpyK,GAClBozK,IAAqCzwK,GACrC01K,IAA0Bn0K,GAIhC,SAASq0K,IAA2Bz1K,EAAM,CACxC,OAAQsvK,IAAgB,8BAA8BtvK,CAAI,GAClDswK,IAAmCtwK,CAAI,GACvCu1K,IAAwBv1K,CAAI,CACtC,CAEA,IAAA01K,IAAiBD,ICZjB,MAAM71G,GAAO1iE,GACPqyK,IAAqB1vK,GAE3B,SAAS81K,GAAoB31K,EAAM,CACjC,OAAI4/D,GAAK,KAAK,cAAc5/D,CAAI,EACvB21K,GAAoB31K,EAAK,OAAO,EAEhC4/D,GAAK,KAAK,aAAa5/D,CAAI,EAC3B21K,GAAoB31K,EAAK,KAAK,CAAC,CAAC,EAEhC4/D,GAAK,KAAK,WAAW5/D,CAAI,EACzBA,EAAK,KAAK,KAAK21K,EAAmB,EAElC/1G,GAAK,KAAK,SAAS5/D,CAAI,GAAK4/D,GAAK,KAAK,WAAW5/D,CAAI,EACrD,GAEA4/D,GAAK,KAAK,WAAW5/D,EAAM,KAAK,EACnCA,EAAK,KAAK,SAAW,GAGrBA,EAAK,KAAK,KAAK21K,EAAmB,EAC7B,GAEF,CAACpG,IAAmBvvK,EAAK,KAAK,CAAC,CAAC,EAEhC4/D,GAAK,KAAK,WAAW5/D,EAAM,SAAS,EACpCA,EAAK,KAAK,KAAK21K,EAAmB,GAAK31K,EAAK,KAAK,OAAS,EAG1D,EAEX,CAEA,IAAA41K,IAAiBD,GCjCjB,MAAM/1G,GAAO1iE,GAEP24K,GAAU,CAAA,EAGhBA,GAAQ,qBAAuB,SAASnG,EAAU,CAChD,MAAMoG,EAAcD,GAAQ,uBAAuBnG,EAAS,QAAQ,EAC9DqG,EAAeF,GAAQ,uBAAuBnG,EAAS,SAAS,EAEtE,OADgB,IAAI,IAAI,CAAC,GAAGoG,EAAa,GAAGC,CAAY,CAAC,CAE3D,EAGAF,GAAQ,uBAAyB,SAASrnG,EAAY,CAEpD,MAAM3c,EADc2c,EAAW,OAAOxuE,GAAQA,EAAK,YAAY,EACnC,IAAIA,GAAQA,EAAK,IAAI,EAEjD,OADkB,IAAI,IAAI6xD,CAAO,CAEnC,EAKAgkH,GAAQ,kBAAoB,SAAS71K,EAAMg2K,EAAY,CAErD,GAAIC,GAAaj2K,EAAMg2K,CAAU,EAC/B,OAAOh2K,EAIJ,GAAI4/D,GAAK,KAAK,WAAW5/D,EAAM,GAAG,GAAK4/D,GAAK,KAAK,WAAW5/D,EAAM,GAAG,EACxE,QAASrD,EAAIqD,EAAK,KAAK,OAAS,EAAGrD,GAAK,EAAIA,IAAK,CAC/C,MAAM0F,EAAQrC,EAAK,KAAKrD,CAAC,EACzB,GAAIijE,GAAK,KAAK,WAAWv9D,EAAO,GAAG,EACjC,OAAOwzK,GAAQ,kBAAkBxzK,EAAO2zK,CAAU,EAE/C,GAAIC,GAAa5zK,EAAO2zK,CAAU,EACrC,OAAO3zK,CAEV,SAEMu9D,GAAK,KAAK,cAAc5/D,CAAI,EACnC,OAAO61K,GAAQ,kBAAkB71K,EAAK,QAASg2K,CAAU,EAG3D,OAAO,IACT,EAQAH,GAAQ,qBAAuB,SAAS71K,EAAMg2K,EAAY,CACxD,GAAIE,GAA2Bl2K,EAAMg2K,CAAU,EAC7C,OAAO,IAAIp2G,GAAK,eAAe5/D,CAAI,EAAE,aAAY,EAE9C,GAAIm2K,GAAqBn2K,EAAMg2K,CAAU,EAC5C,OAAO,KAEJ,GAAIp2G,GAAK,KAAK,WAAW5/D,CAAI,EAChC,QAASrD,EAAIqD,EAAK,KAAK,OAAS,EAAGrD,GAAK,EAAIA,IAAK,CAC/C,MAAM0F,EAAQrC,EAAK,KAAKrD,CAAC,EACzB,GAAIijE,GAAK,KAAK,WAAWv9D,EAAO,GAAG,EACjC,OAAOwzK,GAAQ,qBAAqBxzK,EAAO2zK,CAAU,EAElD,GAAI,CAACC,GAAa5zK,EAAO2zK,CAAU,EACtC,OAAO3zK,CAEV,CAGH,OAAO,IACT,EAOAwzK,GAAQ,iCAAmC,SAAS71K,EAAMg2K,EAAY,CAEpE,GAAIG,GAAqBn2K,EAAMg2K,CAAU,EACvC,OAAOh2K,EAAK,KAAK,CAAC,EAKf,GAAI4/D,GAAK,KAAK,WAAW5/D,EAAM,GAAG,EACrC,QAASrD,EAAIqD,EAAK,KAAK,OAAS,EAAGrD,GAAK,EAAIA,IAAK,CAC/C,MAAM0F,EAAQrC,EAAK,KAAKrD,CAAC,EACzB,GAAIijE,GAAK,KAAK,WAAWv9D,EAAO,GAAG,EACjC,OAAOwzK,GAAQ,iCAAiCxzK,EAAO2zK,CAAU,EAE9D,GAAIG,GAAqB9zK,EAAO2zK,CAAU,EAC7C,OAAO3zK,EAAM,KAAK,CAAC,CAEtB,CAEH,OAAO,IACT,EAGA,SAAS4zK,GAAaj2K,EAAMg2K,EAAY,CACtC,OAAOE,GAA2Bl2K,EAAMg2K,CAAU,GAChDG,GAAqBn2K,EAAMg2K,CAAU,CACzC,CAEA,SAASE,GAA2Bl2K,EAAMg2K,EAAY,CACpD,MAAIp2G,GAAAA,GAAK,eAAe,iBAAiB5/D,CAAI,GAC1B,IAAI4/D,GAAK,eAAe5/D,CAAI,EAChC,cAAe,IAAKg2K,EAMrC,CAKA,SAASG,GAAqBn2K,EAAMg2K,EAAY,CAC9C,OAAIp2G,GAAK,KAAK,WAAW5/D,CAAI,GAAKA,EAAK,KAAO,IACzB61K,GAAQ,uBAAuB71K,EAAK,KAAK,CAAC,CAAC,EAC5C,IAAIg2K,CAAU,EAG3B,EACT,CAEA,IAAAI,GAAiBP,GCpIjB,MAAMj2G,GAAO1iE,GACP24K,IAAUh2K,GAIhB,SAASw2K,IAAYr2K,EAAM,CAWzB,GAVI,CAAC4/D,GAAK,KAAK,WAAW5/D,EAAM,GAAG,GAI/BA,EAAK,KAAK,OAAS,GAKL61K,IAAQ,uBAAuB71K,CAAI,EACvC,OAAS,EACrB,MAAO,GAGT,MAAMs2K,EAAoBt2K,EAAK,KAAK,OAAOu2K,GAAyB,CAAC,CAAC,EAChEC,EAAmBx2K,EAAK,KAAK,OAAOu2K,GAAyB,CAAC,CAAC,EAC/D1pD,EAAgB7sH,EAAK,KAAK,OAAO4/D,GAAK,KAAK,UAAU,EAU3D,MANI,EAAA02G,EAAkB,SAAW,GAAKE,EAAiB,OAAS,GAC9D3pD,EAAc,OAAS,GAKpBypD,EAAkB,OAASE,EAAiB,OAC7C3pD,EAAc,SAAY7sH,EAAK,KAAK,OAK1C,CAIA,SAASu2K,GAAyBh/F,EAAQ,CACxC,OAAO,SAASv3E,EAAM,CACpB,GAAI4/D,GAAK,eAAe,iBAAiB5/D,CAAI,EAAG,CAE9C,MAAMgW,EADW,IAAI4pD,GAAK,eAAe5/D,CAAI,EACnB,gBAAgB,EAAI,EAC9C,OAAOgW,GAAY,WAAWA,EAAS,KAAK,IAAMuhE,CACnD,CACD,MAAO,EACX,CACA,CAEA,IAAAk/F,IAAiBJ,ICrDjB,MAAM/G,IAAkBpyK,GAClBuyK,IAAe5vK,IACfswK,IAAmC/uK,IACnCkvK,IAAqCzsK,GACrCwxK,IAA+Bz8J,IAC/B28J,IAA0BnzJ,GAC1BqzJ,IAA6B1gJ,IAC7B4gJ,IAAsB3gJ,IACtBqhJ,IAAcphJ,IACds6I,IAAqBr6I,GAE3B,IAAAwhJ,GAAiB,CACf,aAAAjH,IACA,gBAAAH,IACA,iCAAAa,IACA,mCAAAG,IACA,6BAAA+E,IACA,wBAAAE,IACA,2BAAAE,IACA,oBAAAE,IACA,YAAAU,IACA,mBAAA9G,GACF,ECtBA,MAAMjvG,GAAOpjE,GAEPwzK,IAAkB7wK,GAElBxD,GAAc+E,GACdi/D,IAAWx8D,GACX2oK,GAAW5zJ,GACXgnD,GAAOx9C,GAEPu0J,GAAmB,CAEvBC,IAEAC,IAEAC,IAEAC,GACF,EAYA,SAASC,IAAgBh3K,EAAM,CAE7B,IAAIkgE,EAAQ+2G,EAAS,EAAGC,EAAS,EAAGC,EAAS,EAC7C,UAAWjM,KAAQlrK,EAAK,KACtB,GAAI4/D,GAAK,KAAK,WAAWsrG,CAAI,EAC3BiM,EAAS92G,IAAS6qG,CAAI,UAEftrG,GAAK,eAAe,iBAAiBsrG,CAAI,EAAG,CACnD,MAAMsF,EAAW,IAAI5wG,GAAK,eAAesrG,CAAI,EACvCl1J,EAAWw6J,EAAS,gBAAgB,EAAI,EAC9C,GAAIx6J,EAAS,QAAU,IACrBkqD,EAASswG,EAAS,gBAClByG,EAASzG,EAAS,wBAEXx6J,EAAS,QAAU,IAC1BkhK,EAAS1G,EAAS,oBAGlB,QAAO5wG,GAAK,OAAO,SAAS5/D,CAAI,CAEnC,KAEC,QAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAIpC,GAAI,CAACkgE,GAAU,CAAC+2G,EACd,OAAOr3G,GAAK,OAAO,SAAS5/D,CAAI,EAGlC,IAAIkV,EAAS,GACT+hK,EAAS,IACX/hK,EAAS,GACT+hK,EAAS,CAACA,EACVC,EAAS,CAACA,EACVC,EAAS,CAACA,GAGZ,QAASx6K,EAAI,EAAGA,EAAIg6K,GAAiB,OAAQh6K,IAAK,CAChD,MAAMu4K,EAAayB,GAAiBh6K,CAAC,EAAEqD,EAAMkgE,EAAQ+2G,EAAQC,EAAQC,EAAQjiK,CAAM,EACnF,GAAIggK,EAAW,aACb,OAAOA,CAEV,CAED,OAAOt1G,GAAK,OAAO,SAAS5/D,CAAI,CAClC,CAGA,SAAS42K,IAAa52K,EAAMkgE,EAAQ+2G,EAAQC,EAAQC,EAAQjiK,EAAQ,CAClE,GAAI,CAACgiK,GAAUC,EACb,OAAOv3G,GAAK,OAAO,SAAS5/D,CAAI,EAGlC,MAAM0vB,EAAM4wC,GAAK,IAAI22G,EAAQC,CAAM,EAC7BE,EAAUx3G,GAAK,QAAQ,SAASlwC,CAAG,EACnC2nJ,EAAQz3G,GAAK,QAAQ,SAASq3G,EAAOvnJ,CAAG,EACxC4nJ,EAAQ13G,GAAK,QAAQ,SAASs3G,EAAOxnJ,CAAG,EAExC6nJ,EAAe33G,GAAK,QAAQ,eAAeM,EAAQ,KAAMk3G,CAAO,EAChE5G,EAAW5wG,GAAK,QAAQ,eAAeM,EAAQ,KAAMm3G,CAAK,EAC1DG,EAAQ53G,GAAK,QAAQ,YACzBA,GAAK,QAAQ,SAAS,IAAK,CAAC4wG,EAAU8G,CAAK,CAAC,CAAC,EAE/C,IAAI5wD,EAAU9mD,GAAK,QAAQ,SAAS,IAAK,CAAC23G,EAAcC,CAAK,EAAG,EAAI,EACpE,OAAItiK,IACFwxG,EAAU8lD,GAAS,OAAO9lD,CAAO,GAG5B9mD,GAAK,OAAO,YAAYvjE,GAAY,cAAe2D,EAAM0mH,CAAO,CACzE,CAKA,SAASmwD,IAA0B72K,EAAMkgE,EAAQ+2G,EAAQC,EAAQC,EAAQjiK,EAAQ,CAK/E,GAAIgiK,GAAU,CAACC,EACb,OAAOv3G,GAAK,OAAO,SAAS5/D,CAAI,EAKlC,MAAM0vB,EAAM4wC,GAAK,IAAI22G,EAAQE,CAAM,EACnCF,EAASA,EAAOvnJ,EAChBynJ,EAASA,EAAOznJ,EAChB,MAAM+nJ,EAAa,KAAK,KAAK,KAAK,IAAIR,CAAM,CAAC,EACvCS,EAAa,KAAK,KAAK,KAAK,IAAIP,CAAM,CAAC,EAG7C,GAAI,OAAO,UAAUM,CAAU,GAC3B,OAAO,UAAUC,CAAU,GAC3BP,EAAS,EAAG,CAEd,MAAMQ,EAAY/3G,GAAK,QAAQ,SAAS63G,CAAU,EAC5CG,EAAYh4G,GAAK,QAAQ,SAAS83G,CAAU,EAE5ClH,EAAW5wG,GAAK,QAAQ,eAAeM,EAAQ,KAAMy3G,CAAS,EAC9DE,EAAaj4G,GAAK,QAAQ,YAC9BA,GAAK,QAAQ,SAAS,IAAK,CAAC4wG,EAAUoH,CAAS,CAAC,CAAC,EAC7CE,EAAcl4G,GAAK,QAAQ,YAC/BA,GAAK,QAAQ,SAAS,IAAK,CAAC4wG,EAAUoH,CAAS,CAAC,CAAC,EAGnD,IAAIlxD,EAAU9mD,GAAK,QAAQ,SAAS,IAAK,CAACi4G,EAAYC,CAAW,EAAG,EAAI,EACxE,GAAIpoJ,IAAQ,EAAG,CACb,MAAM0nJ,EAAUx3G,GAAK,QAAQ,SAASlwC,CAAG,EACzCg3F,EAAU9mD,GAAK,QAAQ,SAAS,IAAK,CAACw3G,EAAS1wD,CAAO,EAAG,EAAI,CAC9D,CACD,OAAIxxG,IACFwxG,EAAU8lD,GAAS,OAAO9lD,CAAO,GAG5B9mD,GAAK,OAAO,YACjBvjE,GAAY,6BAA8B2D,EAAM0mH,CAAO,CAC1D,CAED,OAAO9mD,GAAK,OAAO,SAAS5/D,CAAI,CAClC,CAKA,SAAS82K,IAAoB92K,EAAMkgE,EAAQ+2G,EAAQC,EAAQC,EAAQjiK,EAAQ,CAEzE,GAAI,CAACgiK,GAAU,CAACC,EACd,OAAOv3G,GAAK,OAAO,SAAS5/D,CAAI,EAKlC,MAAM0vB,EAAM4wC,GAAK,IAAI22G,EAAQC,EAAQC,CAAM,EAC3CF,EAASA,EAAOvnJ,EAChBynJ,EAASA,EAAOznJ,EAChB,MAAM+nJ,EAAa,KAAK,KAAK,KAAK,IAAIR,CAAM,CAAC,EAC7C,IAAIS,EAAa,KAAK,KAAK,KAAK,IAAIP,CAAM,CAAC,EAIvCD,EAAS,IACXQ,EAAaA,EAAa,IAI5B,MAAMK,EAAiB,EAAIN,EAAaC,EACxC,GAAI,OAAO,UAAUD,CAAU,GAC3B,OAAO,UAAUC,CAAU,GAC1BR,EAAOxnJ,IAASqoJ,EAAgB,CACnC,MAAMJ,EAAY/3G,GAAK,QAAQ,SAAS63G,CAAU,EAC5CG,EAAYh4G,GAAK,QAAQ,SAAS83G,CAAU,EAE5ClH,EAAW5wG,GAAK,QAAQ,eAAeM,EAAQ,KAAMy3G,CAAS,EAC9DH,EAAQ53G,GAAK,QAAQ,YACzBA,GAAK,QAAQ,SAAS,IAAK,CAAC4wG,EAAUoH,CAAS,CAAC,CAAC,EAC7C5hK,EAAW4pD,GAAK,QAAQ,SAAS,CAAC,EAGxC,IAAI8mD,EAAU9mD,GAAK,QAAQ,SAAS,IAAK,CAAC43G,EAAOxhK,CAAQ,CAAC,EAC1D,GAAI0Z,IAAQ,EAAG,CACb,MAAM0nJ,EAAUx3G,GAAK,QAAQ,SAASlwC,CAAG,EACzCg3F,EAAU9mD,GAAK,QAAQ,SAAS,IAAK,CAACw3G,EAAS1wD,CAAO,EAAG,EAAI,CAC9D,CACD,OAAIxxG,IACFwxG,EAAU8lD,GAAS,OAAO9lD,CAAO,GAG5B9mD,GAAK,OAAO,YACjBvjE,GAAY,sBAAuB2D,EAAM0mH,CAAO,CACnD,CAED,OAAO9mD,GAAK,OAAO,SAAS5/D,CAAI,CAClC,CAMA,SAAS+2K,IAAqB/2K,EAAMkgE,EAAQ+2G,EAAQC,EAAQC,EAAQjiK,EAAQ,CAC1E,IAAIwxG,EAEJ,GAAIwwD,GAAUC,EAAQ,CAGpB,MAAMznJ,EAAM4wC,GAAK,IAAI22G,EAAQC,EAAQC,CAAM,EACrCC,EAAUx3G,GAAK,QAAQ,SAASlwC,CAAG,EAEzCunJ,EAASA,EAAOvnJ,EAChBwnJ,EAASA,EAAOxnJ,EAChBynJ,EAASA,EAAOznJ,EAGhB,MAAM5T,EAAUm7J,EAASE,EACnBa,EAActH,IAAgB,eAAe50J,EAAS,EAAI,EAChE,UAAWm8J,KAAQD,EACjB,GAAIC,EAAK,CAAC,EAAIA,EAAK,CAAC,IAAMf,EAAQ,CAWhC,MAAM/I,EAAW,CAAA,EACjB,IAAIqF,EAEJ,MAAMhyK,EAAIo+D,GAAK,QAAQ,SAASq3G,CAAM,EAChCx1K,EAAIm+D,GAAK,QAAQ,SAASs3G,CAAM,EAChClrK,EAAI4zD,GAAK,QAAQ,SAASu3G,CAAM,EAChCe,EAAMt4G,GAAK,QAAQ,eAAeM,EAAQN,GAAK,QAAQ,SAAS,CAAC,EAAGp+D,CAAC,EACrE22K,EAAKv4G,GAAK,QAAQ,eAAeM,EAAQ,KAAMz+D,CAAC,EAIlDyT,IACFwxG,EAAU9mD,GAAK,QAAQ,SAAS,IAAK,CAACs4G,EAAKC,EAAInsK,CAAC,EAAG,EAAI,EACvD06G,EAAU8lD,GAAS,OAAO9lD,CAAO,EACjC8sD,EAAS5zG,GAAK,OAAO,YACnBvjE,GAAY,gBAAiB2D,EAAM0mH,CAAO,EAC5CynD,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,GAIxD,MAAM4E,EAASH,EAAK,CAAC,EACfI,EAASJ,EAAK,CAAC,EACf3wK,EAAIs4D,GAAK,QAAQ,SAASw4G,CAAM,EAChClwJ,EAAI03C,GAAK,QAAQ,SAASy4G,CAAM,EAChChxJ,EAAKu4C,GAAK,QAAQ,eAAeM,EAAQ,KAAM54D,CAAC,EAChDgxK,EAAK14G,GAAK,QAAQ,eAAeM,EAAQ,KAAMh4C,CAAC,EAEtDw+F,EAAU9mD,GAAK,QAAQ,SAAS,IAAK,CAACs4G,EAAK7wJ,EAAIixJ,EAAItsK,CAAC,EAAG,EAAI,EACvDkJ,IACFwxG,EAAU8lD,GAAS,OAAO9lD,CAAO,GAEnC8sD,EAAS5zG,GAAK,OAAO,YACnBvjE,GAAY,cAAe2D,EAAM0mH,CAAO,EAC1CynD,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAGtD,MAAMzE,EAAYnvG,GAAK,QAAQ,YAC7BA,GAAK,QAAQ,SAAS,IAAK,CAACs4G,EAAK7wJ,CAAE,CAAC,CAAC,EACjCkxJ,EAAa34G,GAAK,QAAQ,YAC9BA,GAAK,QAAQ,SAAS,IAAK,CAAC04G,EAAItsK,CAAC,CAAC,CAAC,EAErC06G,EAAU9mD,GAAK,QAAQ,SAAS,IAAK,CAACmvG,EAAWwJ,CAAU,EAAG,EAAI,EAC9DrjK,IACFwxG,EAAU8lD,GAAS,OAAO9lD,CAAO,GAEnC8sD,EAAS5zG,GAAK,OAAO,YACnBvjE,GAAY,mBAAoB2D,EAAM0mH,CAAO,EAC/CynD,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAGtD,MAAM5mJ,EAAIgzC,GAAK,QAAQ,SAASU,GAAK,IAAI22G,EAAQmB,CAAM,CAAC,EAClDx5J,EAAIghD,GAAK,QAAQ,SAASq3G,EAAOrqJ,CAAC,EAClCjlB,EAAIi4D,GAAK,QAAQ,SAASw4G,EAAOxrJ,CAAC,EAClC4rJ,EAAK54G,GAAK,QAAQ,eAAeM,EAAQ,KAAMtzC,CAAC,EAGhD6rJ,EAAK74G,GAAK,QAAQ,eAAeM,EAAQ,KAAMthD,CAAC,EAChDi5J,EAAaj4G,GAAK,QAAQ,YAC9BA,GAAK,QAAQ,SAAS,IAAK,CAAC64G,EAAI9wK,CAAC,CAAC,CAAC,EAE/B+wK,EAAqB94G,GAAK,QAAQ,SAAS,IAAK,CAAC44G,EAAIX,CAAU,EAAG,EAAI,EAC5EnxD,EAAU9mD,GAAK,QAAQ,SAAS,IAAK,CAAC84G,EAAoBH,CAAU,EAAG,EAAI,EACvErjK,IACFwxG,EAAU8lD,GAAS,OAAO9lD,CAAO,GAEnC8sD,EAAS5zG,GAAK,OAAO,YACnBvjE,GAAY,cAAe2D,EAAM0mH,CAAO,EAC1CynD,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAGtD,IAAImF,EAASr4G,GAAK,IAAI62G,EAAQkB,CAAM,EAChCA,EAAS,IACXM,EAASA,EAAS,IAEpB,MAAMprJ,EAAIqyC,GAAK,QAAQ,SAAS+4G,CAAM,EAGhCb,EAAcl4G,GAAK,QAAQ,YAC/BA,GAAK,QAAQ,SAAS,IAAK,CAAC44G,EAAIjrJ,CAAC,CAAC,CAAC,EAE/BqrJ,EAAsBh5G,GAAK,QAAQ,SAAS,IAAK,CAACryC,EAAGsqJ,CAAU,EAAG,EAAI,EAC5E,OAAAnxD,EAAU9mD,GAAK,QAAQ,SAAS,IAAK,CAAC84G,EAAoBE,CAAmB,EAAG,EAAI,EAChF1jK,IACFwxG,EAAU8lD,GAAS,OAAO9lD,CAAO,GAEnC8sD,EAAS5zG,GAAK,OAAO,YACnBvjE,GAAY,cAAe2D,EAAM0mH,CAAO,EAC1CynD,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAGlD9jJ,IAAQ,EACVg3F,EAAU9mD,GAAK,QAAQ,SACrB,IAAK,CAACi4G,EAAYC,CAAW,EAAG,EAAI,EAGtCpxD,EAAU9mD,GAAK,QAAQ,SACrB,IAAK,CAACw3G,EAASS,EAAYC,CAAW,EAAG,EAAI,EAG7C5iK,IACFwxG,EAAU8lD,GAAS,OAAO9lD,CAAO,GAGnC8sD,EAAS5zG,GAAK,OAAO,YACnBvjE,GAAY,wBAAyB2D,EAAM0mH,CAAO,EACpDynD,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAE/C5zG,GAAK,OAAO,YACjBvjE,GAAY,wBAAyB2D,EAAM0mH,EAAS,GAAMynD,CAAQ,CACrE,CAEJ,CAED,OAAOvuG,GAAK,OAAO,SAAS5/D,CAAI,CAClC,CAEA,IAAA64K,IAAiB7B,ICrWjB,MAAM8B,GAAO,CAAA,EAIbA,GAAK,sBAAwB,SAASC,EAAMl8K,EAAKyE,EAAO,CACtD,OAAIy3K,EAAKl8K,CAAG,EACVk8K,EAAKl8K,CAAG,EAAE,KAAKyE,CAAK,EAGpBy3K,EAAKl8K,CAAG,EAAI,CAACyE,CAAK,EAEby3K,CACT,EAEA,IAAAC,IAAiBF,GCjBjB,MAAMrzH,GAAQvoD,GAERb,IAAcwD,GACd+/D,GAAOx+D,GACPg0K,IAAUvxK,GACVi1K,GAAOlgK,IAEPqgK,GAAW,WACXC,GAAoB,mBACpBC,IAAW,UACXC,GAAQ,QAERC,GAAoB,CAAA,EAI1BA,GAAkB,oBAAsB,SAASr5K,EAAM,CAKrD,GAAI,EAAE4/D,GAAK,KAAK,WAAW5/D,EAAM,GAAG,GAAK4/D,GAAK,KAAK,WAAW5/D,EAAM,GAAG,GACrE,MAAO,GAGT,IAAIs5K,EACJ,GAAIt5K,EAAK,KAAO,IACds5K,EAAQC,GAA8Bv5K,CAAI,UAEnCA,EAAK,KAAO,IACnBs5K,EAAQE,GAAoCx5K,CAAI,MAGhD,OAAM,MAAM,4BAA8BA,EAAK,EAAE,EAQnD,MAAMy5K,EAAY,OAAO,KAAKH,CAAK,EAC7BI,EAAoBD,EAAU,OAAO35K,GAAKA,IAAMs5K,EAAK,EAC3D,OAAQK,EAAU,OAAS,GACzBC,EAAkB,KAAK55K,GAAKw5K,EAAMx5K,CAAC,EAAE,OAAS,CAAC,CACnD,EAGAu5K,GAAkB,iBAAmB,SAASr5K,EAAM,CAClD,GAAI,CAACq5K,GAAkB,oBAAoBr5K,CAAI,EAC7C,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAGlC,MAAM+pE,EAAK/pE,EAAK,GAChB,IAAIs5K,EAAQ,CAAA,EACZ,GAAIvvG,IAAO,IACTuvG,EAAQC,GAA8Bv5K,CAAI,UAEnC+pE,IAAO,IACduvG,EAAQE,GAAoCx5K,CAAI,MAGhD,OAAM,MAAM,4BAA8B+pE,CAAE,EAI9C,MAAM4vG,EAAkB,OAAO,KAAKL,CAAK,EACpC,OAAOx5K,GAAMA,IAAMm5K,IAAYn5K,IAAMo5K,IAAqBp5K,IAAMs5K,EAAM,EACtE,KAAKQ,GAAS,EAIfN,EAAML,EAAQ,IAEZlvG,IAAO,KACT4vG,EAAgB,KAAKV,EAAQ,EAG3BlvG,IAAO,KACT4vG,EAAgB,QAAQV,EAAQ,GAGhCK,EAAMJ,EAAiB,GACzBS,EAAgB,KAAKT,EAAiB,EAIxC,IAAIW,EAAc,CAAA,EACdC,EAAc,EAClBH,EAAgB,QAAQI,GAAY,CAClC,MAAMC,EAAcV,EAAMS,CAAQ,EAClC,GAAIC,EAAY,SAAW,EAAG,CAC5B,MAAMC,EAAaD,EAAY,CAAC,EAAE,UAAS,EAC3CC,EAAW,YAAcH,EACzBD,EAAY,KAAKI,CAAU,CAC5B,KAEI,CACH,MAAMnL,EAAWlvG,GAAK,QAAQ,YAC5BA,GAAK,QAAQ,SAASmK,EAAIiwG,CAAW,CAAC,EAAE,YAC1ClL,EAAS,YAAcgL,EACvBD,EAAY,KAAK/K,CAAQ,CAC1B,CACDkL,EAAY,QAAQ9O,GAAQ,CAC1BA,EAAK,YAAc4O,CACzB,CAAK,EACDA,GACJ,CAAG,EAGGR,EAAMF,EAAK,IACbS,EAAcA,EAAY,OAAOP,EAAMF,EAAK,CAAC,GAG/C,MAAM1yD,EAAU1mH,EAAK,YACrB,OAAA0mH,EAAQ,KAAOmzD,EACRj6G,GAAK,OAAO,YACjBvjE,IAAY,mBAAoB2D,EAAM0mH,EAAS,EAAK,CACxD,EAKA,SAASwzD,GAAYl6K,EAAM6uK,EAAc9kG,EAAI,CAC3C,MAAMmhG,EAAO,IAAI2D,EAAa7uK,CAAI,EAElC,IAAIm6K,EAAW10H,GAAM,MAAMylH,EAAK,YAAa,CAAA,EAE7C,GAAInhG,IAAO,IAAK,CACd,MAAM/zD,EAAWyvC,GAAM,MAAMylH,EAAK,gBAAgB,EAAI,CAAC,EACvDiP,GAAY,IAAMnkK,CACnB,CACD,OAAOmkK,CACT,CAMA,SAASZ,GAA8Bv5K,EAAM,CAC3C,IAAIs5K,EAAQ,CAAA,EAEZ,QAAS38K,EAAI,EAAGA,EAAIqD,EAAK,KAAK,OAAQrD,IAAK,CACzC,MAAM0F,EAAQrC,EAAK,KAAKrD,CAAC,EAEzB,GAAIijE,GAAK,eAAe,iBAAiBv9D,CAAK,EAAG,CAC/C,MAAM83K,EAAWD,GAAY73K,EAAOu9D,GAAK,eAAgB,GAAG,EAC5D05G,EAAQR,GAAK,sBAAsBQ,EAAOa,EAAU93K,CAAK,CAC1D,SACQu9D,GAAK,YAAY,cAAcv9D,CAAK,EAAG,CAC9C,MAAM83K,EAAWD,GAAY73K,EAAOu9D,GAAK,YAAa,GAAG,EACzD05G,EAAQR,GAAK,sBAAsBQ,EAAOa,EAAU93K,CAAK,CAC1D,SACQu9D,GAAK,KAAK,kBAAkBv9D,CAAK,EACxCi3K,EAAQR,GAAK,sBAAsBQ,EAAOJ,GAAmB72K,CAAK,UAE3Du9D,GAAK,KAAK,WAAWv9D,CAAK,EACjCi3K,EAAQR,GAAK,sBAAsBQ,EAAOL,GAAU52K,CAAK,UAElDu9D,GAAK,KAAK,WAAW5/D,CAAI,GACzB4/D,GAAK,KAAK,WAAW5/D,CAAI,GACzB4/D,GAAK,KAAK,cAAc5/D,CAAI,GAC5B4/D,GAAK,KAAK,aAAa5/D,CAAI,EAClCs5K,EAAQR,GAAK,sBAAsBQ,EAAOF,GAAO/2K,CAAK,MAKtD,OAAM,MAAM,0BAA4BA,EAAM,IAAI,CAErD,CAKD,GAAIi3K,EAAML,EAAQ,GAAKK,EAAML,EAAQ,EAAE,SAAW,GAC/CK,EAAMJ,EAAiB,GAAKI,EAAMJ,EAAiB,EAAE,SAAW,EAAG,CACpE,MAAMhzI,EAAWozI,EAAMJ,EAAiB,EAAE,CAAC,EAC3CI,EAAQR,GAAK,sBAAsBQ,EAAOL,GAAU/yI,CAAQ,EAC5D,OAAOozI,EAAMJ,EAAiB,CAC/B,CAED,OAAOI,CACT,CAQA,SAASE,GAAoCx5K,EAAM,CACjD,IAAIs5K,EAAQ,CAAA,EAEZ,QAAS38K,EAAI,EAAGA,EAAIqD,EAAK,KAAK,OAAQrD,IAAK,CACzC,IAAI0F,EAAQrC,EAAK,KAAKrD,CAAC,EAOvB,GALIijE,GAAK,KAAK,aAAav9D,CAAK,IAC9Bi3K,EAAQR,GAAK,sBACXQ,EAAOL,GAAUr5G,GAAK,QAAQ,SAAS,EAAE,CAAC,EAC5Cv9D,EAAQA,EAAM,KAAK,CAAC,GAElBu9D,GAAK,eAAe,iBAAiBv9D,CAAK,EAC5Ci3K,EAAQc,IAAsCd,EAAOj3K,CAAK,UAEnDu9D,GAAK,KAAK,WAAWv9D,EAAO,SAAS,EAC5Ci3K,EAAQe,IAAmCf,EAAOj3K,CAAK,UAEhDu9D,GAAK,KAAK,kBAAkBv9D,CAAK,EACxCi3K,EAAQR,GAAK,sBAAsBQ,EAAOL,GAAU52K,CAAK,UAElDu9D,GAAK,KAAK,WAAWv9D,CAAK,EACjCi3K,EAAQR,GAAK,sBAAsBQ,EAAOL,GAAU52K,CAAK,UAElDu9D,GAAK,KAAK,WAAW5/D,CAAI,GACzB4/D,GAAK,KAAK,WAAW5/D,CAAI,GACzB4/D,GAAK,KAAK,cAAc5/D,CAAI,GAC5B4/D,GAAK,KAAK,aAAa5/D,CAAI,EAClCs5K,EAAQR,GAAK,sBAAsBQ,EAAOF,GAAO/2K,CAAK,MAKtD,OAAM,MAAM,0BAA4BA,EAAM,IAAI,CAErD,CACD,OAAOi3K,CACT,CAMA,SAASe,IAAmCf,EAAOt5K,EAAM,CAEvD,MAAMs6K,EADWlF,IAAQ,YAAYp1K,CAAI,EACV,MAE/B,OAAAs5K,EAAQR,GAAK,sBAAsBQ,EAAOH,IAAWmB,EAAgBt6K,CAAI,EAElEs5K,CACT,CAOA,SAASc,IAAsCd,EAAOt5K,EAAM,CAC1D,MAAM0sK,EAAW,IAAI9sG,GAAK,eAAe5/D,CAAI,EAC7C,IAAIm6K,EAEJ,GAAI,CAACzN,EAAS,WACZyN,EAAWD,GAAYl6K,EAAM4/D,GAAK,eAAgB,GAAG,EACrD05G,EAAQR,GAAK,sBAAsBQ,EAAOa,EAAUn6K,CAAI,MAErD,CACH,MAAMu6K,EAAc7N,EAAS,eAC7B,IAAI8N,EAAyB9N,EAAS,gBAClCA,EAAS,oBACX8N,EAAyB56G,GAAK,QAAQ,SACpC,IAAK,CAAC46G,EAAwB9N,EAAS,gBAAe,CAAE,CAAC,GAG7D4M,EAAQR,GAAK,sBAAsBQ,EAAOL,GAAUsB,CAAW,EAC/DJ,EAAWD,GAAYM,EAAwB56G,GAAK,eAAgB,GAAG,EACvE05G,EAAQR,GAAK,sBAAsBQ,EAAOa,EAAUK,CAAsB,CAC3E,CACD,OAAOlB,CACT,CAGA,SAASM,IAAUp4K,EAAGC,EAAG,CACvB,GAAID,IAAMC,EACR,MAAO,GAGT,GAAID,EAAE,QAAQ,GAAG,IAAM,GACrB,OAAOA,EAAIC,EAAI,GAAK,EAGjB,CACH,MAAMg5K,EAAQj5K,EAAE,MAAM,GAAG,EAAE,CAAC,EACtBk5K,EAAOl5K,EAAE,MAAM,GAAG,EAAE,CAAC,EACrBm5K,EAAQl5K,EAAE,MAAM,GAAG,EAAE,CAAC,EACtBm5K,EAAOn5K,EAAE,MAAM,GAAG,EAAE,CAAC,EAC3B,OAAIg5K,IAAUE,EACLF,EAAQE,EAAQ,GAAK,EAGrBD,EAAOE,EAAO,GAAK,CAE7B,CACH,CAEA,IAAAC,GAAiBxB,GCtSjB,MAAM3C,GAASx5K,GACTm8K,IAAoBx5K,GACpB+/D,GAAOx+D,GAKb,SAAS05K,IAAwB96K,EAAMorK,EAAS,GAAO,CAMrD,GAAIA,EACF,KAAOxrG,GAAK,KAAK,cAAc5/D,CAAI,GACjCA,EAAOA,EAAK,QAGhB,OAAO+6K,GAA8B/6K,CAAI,CAC3C,CAMA,SAAS+6K,GAA8B/6K,EAAM,CAC3C,GAAI4/D,GAAK,KAAK,WAAW5/D,CAAI,EAC3B,OAAOg7K,IAAsCh7K,CAAI,EAE9C,GAAI4/D,GAAK,KAAK,WAAW5/D,CAAI,EAChC,OAAOi7K,IAAsCj7K,CAAI,EAE9C,GAAI4/D,GAAK,KAAK,cAAc5/D,CAAI,EACnC,OAAOk7K,IAAyCl7K,CAAI,EAEjD,GAAI4/D,GAAK,KAAK,WAAW5/D,EAAM,EAAI,GAAK4/D,GAAK,KAAK,SAAS5/D,CAAI,EAClE,OAAOA,EAEJ,GAAI4/D,GAAK,KAAK,aAAa5/D,CAAI,EAAG,CACrC,MAAMkrE,EAAUlrE,EAAK,KAAK,CAAC,EAC3B,OAAAA,EAAK,KAAK,CAAC,EAAI+6K,GAA8B7vG,CAAO,EAC7ClrE,CACR,KAEC,OAAM,MAAM,0BAA4BA,EAAK,IAAI,CAErD,CAKA,SAASg7K,IAAsCh7K,EAAM,CAInD,GAAIA,EAAK,KAAO,KAAO4/D,GAAK,KAAK,cAAc5/D,EAAK,KAAK,CAAC,CAAC,EAAG,CAC5D,MAAMuV,EAAOvV,EAAK,KAAK,CAAC,EACxB,GAAI4/D,GAAK,KAAK,WAAWrqD,EAAK,OAAO,EACnC,OAAAA,EAAK,QAAUwlK,GAA8BxlK,EAAK,OAAO,EACzDvV,EAAK,KAAK,CAAC,EAAI+6K,GAA8B/6K,EAAK,KAAK,CAAC,CAAC,EAElDA,CAEV,CAED,OAAAA,EAAK,KAAK,QAAQ,CAACqC,EAAO1F,IAAM,CAC9BqD,EAAK,KAAKrD,CAAC,EAAIo+K,GAA8B14K,CAAK,CACtD,CAAG,EAMGrC,EAAK,KAAO,IACdA,EAAK,KAAK,QAAQ,CAACqC,EAAO1F,IAAM,CAC1BijE,GAAK,KAAK,cAAcv9D,CAAK,GAC7B,CAAC84K,GAAoB94K,EAAM,OAAO,IAGpCrC,EAAK,KAAKrD,CAAC,EAAI0F,EAAM,QAE7B,CAAK,EAKMrC,EAAK,KAAO,KACf4/D,GAAK,KAAK,cAAc5/D,EAAK,KAAK,CAAC,CAAC,GACpC,CAACm7K,GAAoBn7K,EAAK,KAAK,CAAC,EAAE,OAAO,IAC3CA,EAAK,KAAK,CAAC,EAAIA,EAAK,KAAK,CAAC,EAAE,SAIzBA,CACT,CAIA,SAASi7K,IAAsCj7K,EAAM,CACnD,OAAAA,EAAK,KAAK,QAAQ,CAACqC,EAAO1F,IAAM,CAC1BijE,GAAK,KAAK,cAAcv9D,CAAK,IAC/BA,EAAQA,EAAM,SAEhBrC,EAAK,KAAKrD,CAAC,EAAIo+K,GAA8B14K,CAAK,CACtD,CAAG,EAEMrC,CACT,CAQA,SAASk7K,IAAyCl7K,EAAM,CAGtD,GAAI4/D,GAAK,eAAe,iBAAiB5/D,EAAK,OAAO,EAG/CA,EAAK,QAAQ,MACfA,EAAK,QAAQ,KAAK,QAAQ,CAAC8M,EAAKnQ,IAAM,CACpCqD,EAAK,QAAQ,KAAKrD,CAAC,EAAIo+K,GAA8BjuK,CAAG,CAChE,CAAO,EAEH9M,EAAOA,EAAK,gBAIL4/D,GAAK,KAAK,WAAW5/D,EAAK,QAAS,EAAI,GACvC4/D,GAAK,KAAK,kBAAkB5/D,EAAK,OAAO,GACxC4/D,GAAK,KAAK,SAAS5/D,EAAK,OAAO,EACtCA,EAAOA,EAAK,gBAGL4/D,GAAK,KAAK,WAAW5/D,EAAK,OAAO,EACxCA,EAAOA,EAAK,QACZA,EAAO+6K,GAA8B/6K,CAAI,UAIlC4/D,GAAK,KAAK,WAAW5/D,EAAK,OAAO,EACxCA,EAAK,QAAU+6K,GAA8B/6K,EAAK,OAAO,EAErDA,EAAK,QAAQ,KAAO,MACtBA,EAAOA,EAAK,iBAMP4/D,GAAK,KAAK,cAAc5/D,EAAK,OAAO,EAC3CA,EAAO+6K,GAA8B/6K,EAAK,OAAO,UAE1C4/D,GAAK,KAAK,aAAa5/D,EAAK,OAAO,EAC1CA,EAAK,QAAU+6K,GAA8B/6K,EAAK,OAAO,MAGzD,OAAM,MAAM,0BAA4BA,EAAK,QAAQ,IAAI,EAG3D,OAAOA,CACT,CAIA,SAASm7K,GAAoBn7K,EAAM,CACjC,OAAOq5K,IAAkB,oBAAoBr5K,CAAI,GAC/C02K,GAAO,mBAAmB12K,CAAI,GAC9B02K,GAAO,2BAA2B12K,CAAI,CAC1C,CAEA,IAAAo7K,GAAiBN,IC7KjB,MAAMpE,GAASx5K,GAET85K,IAAkBn3K,IAElBixK,IAAkB1vK,GAClB05K,IAA0Bj3K,GAKhC,SAASw3K,IAAYr7K,EAAMkmH,EAAM,GAAO,CAMtC,GALIA,GAEF,QAAQ,IAAI;AAAA;AAAA,aAAoB,MAAM,MAAMlmH,EAAM,GAAO,EAAI,CAAC,EAG5D02K,GAAO,oBAAoB12K,CAAI,EACjC,MAAO,GAGT,IAAIk1K,EACJ,MAAM3G,EAAQ,CAAA,EAEd,OAAAvuK,EAAO8wK,IAAgB9wK,CAAI,EAC3BA,EAAO86K,IAAwB96K,EAAM,EAAI,EACrC02K,GAAO,YAAY12K,CAAI,IACzBk1K,EAAa8B,IAAgBh3K,CAAI,EAC7Bk1K,EAAW,cACb3G,EAAM,KAAK2G,CAAU,GAKlB3G,CACT,CAEA,IAAA+M,GAAiBD,ICpCjB,MAAM/6G,IAAOpjE,GACPm+K,IAAcx7K,GAEpB,SAAS07K,IAAaC,EAAkBt1D,EAAM,GAAO,CACnD,IAAIlmH,EACJ,GAAI,CACFA,EAAOsgE,IAAK,MAAMk7G,CAAgB,CACnC,MACW,CACV,MAAO,EACR,CAED,OAAIx7K,EACKq7K,IAAYr7K,EAAMkmH,CAAK,EAEzB,EACT,CAEA,IAAA3R,IAAiBgnE,IClBjB,MAAM37G,GAAO1iE,GAEPu+K,GAAa,CAAA,EAInBA,GAAW,SAAW,SAASC,EAAwB,CACrD,OAAO,SAAU17K,EAAM,CACrB,OAAO8Y,GAAO4iK,EAAwB17K,EAAM,EAAI,CACpD,CACA,EAIAy7K,GAAW,UAAY,SAASC,EAAwB,CACtD,OAAO,SAAU17K,EAAM,CACrB,OAAO8Y,GAAO4iK,EAAwB17K,EAAM,EAAK,CACrD,CACA,EAGA,SAAS8Y,GAAO4iK,EAAwB17K,EAAM27K,EAAU,CACtD,IAAInI,EAEJ,GAAImI,IACFnI,EAASkI,EAAuB17K,CAAI,EAChCwzK,EAAO,cACT,OAAOA,EAIX,GAAI5zG,GAAK,KAAK,WAAW5/D,CAAI,GAAK4/D,GAAK,KAAK,SAAS5/D,CAAI,EACvD,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAE7B,GAAI4/D,GAAK,KAAK,aAAa5/D,CAAI,GAElC,GADAwzK,EAAS16J,GAAO4iK,EAAwB17K,EAAK,KAAK,CAAC,EAAG27K,CAAQ,EAC1DnI,EAAO,aACT,OAAO5zG,GAAK,OAAO,aAAa5/D,EAAMwzK,CAAM,UAGvC5zG,GAAK,KAAK,WAAW5/D,CAAI,GAAK4/D,GAAK,KAAK,WAAW5/D,CAAI,EAC9D,QAASrD,EAAI,EAAGA,EAAIqD,EAAK,KAAK,OAAQrD,IAAK,CACzC,MAAM0F,EAAQrC,EAAK,KAAKrD,CAAC,EACnBk4K,EAAkB/7J,GAAO4iK,EAAwBr5K,EAAOs5K,CAAQ,EACtE,GAAI9G,EAAgB,aAClB,OAAQj1G,GAAK,OAAO,aAAa5/D,EAAM60K,EAAiBl4K,CAAC,CAE5D,SAEMijE,GAAK,KAAK,cAAc5/D,CAAI,GAEnC,GADAwzK,EAAS16J,GAAO4iK,EAAwB17K,EAAK,QAAS27K,CAAQ,EAC1DnI,EAAO,aACT,OAAO5zG,GAAK,OAAO,aAAa5/D,EAAMwzK,CAAM,MAI9C,OAAM,MAAM,0BAA4BxzK,CAAI,EAG9C,OAAK27K,EAII/7G,GAAK,OAAO,SAAS5/D,CAAI,EAHzB07K,EAAuB17K,CAAI,CAKtC,CAGA,IAAA47K,GAAiBH,GCpEjB,MAAMp/K,GAAca,GACdmjE,GAAWxgE,GACX+/D,GAAOx+D,GACPq6K,IAAa53K,GAKbiV,IAAS2iK,IAAW,UAAUziJ,GAAU,EAI9C,SAASA,IAAWh5B,EAAM,CAIxB,GAHI,CAAC4/D,GAAK,KAAK,WAAW5/D,CAAI,GAG1B,CAACA,EAAK,KAAK,MAAMqC,GAASu9D,GAAK,KAAK,WAAWv9D,EAAO,EAAI,CAAC,EAC7D,OAAOu9D,GAAK,OAAO,SAAS5/D,CAAI,EAWlC,GANAA,EAAK,KAAK,QAAQ,CAAC8M,EAAKnQ,IAAM,CAC5BqD,EAAK,KAAKrD,CAAC,EAAIijE,GAAK,QAAQ,SAASS,GAASvzD,CAAG,CAAC,CACtD,CAAG,EAIG8yD,GAAK,KAAK,kBAAkB5/D,CAAI,EAAG,CACrC,MAAMosK,EAAiB,SAASpsK,EAAK,KAAK,CAAC,CAAC,EACtCysK,EAAmB,SAASzsK,EAAK,KAAK,CAAC,CAAC,EAC9C,GAAIosK,EAAiBK,IAAqB,EAAG,CAC3C,MAAM/lD,EAAU9mD,GAAK,QAAQ,SAASwsG,EAAeK,CAAgB,EACrE,OAAO7sG,GAAK,OAAO,YACjBvjE,GAAY,oBAAqB2D,EAAM0mH,CAAO,CACjD,KAEC,QAAO9mD,GAAK,OAAO,SAAS5/D,CAAI,CAEnC,KACI,CACH,MAAM67K,EAAiBC,IAAiB97K,CAAI,EACtC0mH,EAAU9mD,GAAK,QAAQ,SAASi8G,CAAc,EACpD,OAAOj8G,GAAK,OAAO,YAAYvjE,GAAY,oBAAqB2D,EAAM0mH,CAAO,CAC9E,CACH,CAIA,SAASo1D,IAAiB97K,EAAM,CAC9B,IAAImV,EAASkrD,GAASrgE,CAAI,EAC1B,OAAI,KAAK,IAAImV,CAAM,EAAI,EACrBA,EAAU,WAAWA,EAAO,YAAY,CAAC,CAAC,EAG1CA,EAAU,WAAWA,EAAO,QAAQ,CAAC,CAAC,EAEjCA,CACT,CAEA,IAAA4mK,GAAiBjjK,IC5DjB,MAAMzc,GAAca,GACd0iE,GAAO//D,GAKb,SAASm8K,IAAqCh8K,EAAM,CAClD,GAAI,CAAC4/D,GAAK,YAAY,cAAc5/D,CAAI,EACtC,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAGlC,MAAMmuK,EAAW,CAAA,EACjB,IAAIznD,EAAU1mH,EAAK,YAGnB,MAAMi8K,EAAcr8G,GAAK,YAAY,oBAAoB5/D,CAAI,EACvDosB,EAAYwzC,GAAK,YAAY,kBAAkB5/D,CAAI,EACnDwnB,EAAco4C,GAAK,YAAY,oBAAoB5/D,CAAI,EACvDwtK,EAAwB5tG,GAAK,YAAY,sBAAsB5/D,CAAI,EAIzE,IAAIwzK,EAAS0I,IACXx1D,EAASu1D,EAAa7vJ,EAAW5E,EAAagmJ,CAAqB,EACrE,OAAAW,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAItDA,EAAS2I,IACPz1D,EAASu1D,EAAa7vJ,EAAW5E,EAAagmJ,CAAqB,EACrEW,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAItDA,EAAS4I,IACP11D,EAASu1D,EAAa7vJ,EAAW5E,EAAagmJ,CAAqB,EACrEW,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAE/C5zG,GAAK,OAAO,YACjBvjE,GAAY,0CACZ2D,EAAM0mH,EAAS,GAAMynD,CAAQ,CACjC,CAIA,SAAS+N,IACPhO,EAAS+N,EAAa7vJ,EAAW5E,EAAagmJ,EAAuB,CAGrE,MAAM6O,EAA6Bz8G,GAAK,QAAQ,YAC9CA,GAAK,QAAQ,SACX,IACA,CAACA,GAAK,QAAQ,SAASq8G,CAAW,EAChCr8G,GAAK,QAAQ,SAASp4C,CAAW,CAAC,CAAC,CAAC,EAIpC2lJ,EAAevtG,GAAK,QAAQ,SAChC,IACA,CAACy8G,EAA4Bz8G,GAAK,QAAQ,SAASxzC,CAAS,CAAC,CAAC,EAChE8hJ,EAAQ,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,YAAc,EACtCf,EAAa,YAAc,EAG3B,MAAMmP,EAAiB18G,GAAK,QAAQ,SAASp4C,CAAW,EAExD,IAAIk/F,EAAU9mD,GAAK,QAAQ,SACzB,IAAK,CAACutG,EAAcmP,CAAc,CAAC,EAErC,OAAI9O,IACF9mD,EAAU9mD,GAAK,QAAQ,WAAW8mD,CAAO,GAGpC9mD,GAAK,OAAO,YACjBvjE,GAAY,4BAA6B6xK,EAASxnD,EAAS,EAAK,CACpE,CAIA,SAASy1D,IACPjO,EAAS+N,EAAa7vJ,EAAW5E,EAAagmJ,EAAuB,CAGrE,MAAML,EAAevtG,GAAK,QAAQ,SAChC,IACA,CAACA,GAAK,QAAQ,SAASq8G,EAAcz0J,CAAW,EAC9Co4C,GAAK,QAAQ,SAASxzC,CAAS,CAAC,CAAC,EACrC8hJ,EAAQ,KAAK,CAAC,EAAE,YAAc,EAC9Bf,EAAa,YAAc,EAG3B,MAAMmP,EAAiB18G,GAAK,QAAQ,SAASp4C,CAAW,EAExD,IAAIk/F,EAAU9mD,GAAK,QAAQ,SACzB,IAAK,CAACutG,EAAcmP,CAAc,CAAC,EAErC,OAAI9O,IACF9mD,EAAU9mD,GAAK,QAAQ,WAAW8mD,CAAO,GAGpC9mD,GAAK,OAAO,YACjBvjE,GAAY,oBAAqB6xK,EAASxnD,EAAS,EAAK,CAC5D,CAIA,SAAS01D,IACPlO,EAAS+N,EAAa7vJ,EAAW5E,EAAagmJ,EAAuB,CAGrE,MAAML,EAAevtG,GAAK,QAAQ,SAChCq8G,EAAcz0J,EAAc4E,CAAS,EACvC8hJ,EAAQ,KAAK,CAAC,EAAE,YAAc,EAC9Bf,EAAa,YAAc,EAG3B,MAAMmP,EAAiB18G,GAAK,QAAQ,SAASp4C,CAAW,EAExD,IAAIk/F,EAAU9mD,GAAK,QAAQ,SACzB,IAAK,CAACutG,EAAcmP,CAAc,CAAC,EAErC,OAAI9O,IACF9mD,EAAU9mD,GAAK,QAAQ,WAAW8mD,CAAO,GAGpC9mD,GAAK,OAAO,YACjBvjE,GAAY,oBAAqB6xK,EAASxnD,EAAS,EAAK,CAC5D,CAEA,IAAA61D,IAAiBP,ICpIjB,MAAMtF,IAASx5K,GAETb,IAAcwD,GACd+/D,GAAOx+D,GAKb,SAASo7K,IAAqBx8K,EAAM,CAClC,GAAI,CAAC02K,IAAO,wBAAwB12K,CAAI,EACtC,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAGlC,IAAI0mH,EAAU1mH,EAAK,YAEnB,MAAM0sK,EAAW,IAAI9sG,GAAK,eAAe8mD,EAAQ,KAAK,CAAC,CAAC,EAClDqqD,EAAYrqD,EAAQ,KAAK,CAAC,EAC1BusD,EAAevG,EAAS,kBAC9B,OAAAhmD,EAAU9mD,GAAK,QAAQ,eACrB8sG,EAAS,cAAa,EAAIuG,EAAclC,CAAS,EAE5CnxG,GAAK,OAAO,YACjBvjE,IAAY,gBAAiB2D,EAAM0mH,CAAO,CAC9C,CAEA,IAAA+1D,GAAiBD,ICzBjB,MAAMngL,IAAca,GACd0iE,GAAO//D,GAIb,SAAS68K,IAAqB18K,EAAM,CAClC,GAAIA,EAAK,KAAO,IACd,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAElC,MAAMgW,EAAWhW,EAAK,KAAK,CAAC,EAC5B,GAAI4/D,GAAK,KAAK,WAAW5pD,CAAQ,GAAKA,EAAS,QAAU,IAAK,CAC5D,MAAM0wG,EAAU9mD,GAAK,QAAQ,SAAS,CAAC,EACvC,OAAOA,GAAK,OAAO,YACjBvjE,IAAY,wBAAyB2D,EAAM0mH,CAAO,CACrD,KAEC,QAAO9mD,GAAK,OAAO,SAAS5/D,CAAI,CAEpC,CAEA,IAAA28K,IAAiBD,ICpBjB,MAAMrgL,IAAca,GACd0iE,GAAO//D,GAIb,SAAS+8K,IAA2B58K,EAAM,CACxC,GAAIA,EAAK,KAAO,IACd,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAYlC,GAVkBA,EAAK,KAAK,UAAU8M,GAChC8yD,GAAK,KAAK,WAAW9yD,CAAG,GAAKA,EAAI,QAAU,EACtC,GAEL8yD,GAAK,eAAe,iBAAiB9yD,CAAG,EACzB,IAAI8yD,GAAK,eAAe9yD,CAAG,EAC5B,cAAe,IAAK,EAE/B,EACR,GACgB,EAAG,CAElB,MAAM45G,EAAU9mD,GAAK,QAAQ,SAAS,CAAC,EACvC,OAAOA,GAAK,OAAO,YACjBvjE,IAAY,iBAAkB2D,EAAM0mH,CAAO,CAC9C,KAEC,QAAO9mD,GAAK,OAAO,SAAS5/D,CAAI,CAEpC,CAEA,IAAA68K,IAAiBD,IC9BjB,MAAMvgL,IAAca,GACd0iE,GAAO//D,GAIb,SAASi9K,IAA4B98K,EAAM,CACzC,GAAIA,EAAK,KAAO,IACd,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAElC,GAAIA,EAAK,KAAK,CAAC,EAAE,QAAU,IAAK,CAC9B,MAAM0mH,EAAU9mD,GAAK,QAAQ,SAAS,CAAC,EACvC,OAAOA,GAAK,OAAO,YACjBvjE,IAAY,sBAAuB2D,EAAM0mH,CAAO,CACnD,KAEC,QAAO9mD,GAAK,OAAO,SAAS5/D,CAAI,CAEpC,CAEA,IAAA+8K,IAAiBD,ICnBjB,MAAMzgL,IAAca,GACd0iE,GAAO//D,GAIb,SAASm9K,IAAqBh9K,EAAM,CAClC,GAAIA,EAAK,KAAO,IACd,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAElC,MAAMi9K,EAAYj9K,EAAK,KAAK,UAAU8M,GAC7B8yD,GAAK,KAAK,WAAW9yD,CAAG,GAAKA,EAAI,QAAU,CACnD,EACD,IAAI45G,EAAU1mH,EAAK,YACnB,OAAIi9K,GAAa,GAEfv2D,EAAQ,KAAK,OAAOu2D,EAAW,CAAC,EAG5Bv2D,EAAQ,KAAK,SAAW,IAC1BA,EAAUA,EAAQ,KAAK,CAAC,GAEnB9mD,GAAK,OAAO,YACjBvjE,IAAY,mBAAoB2D,EAAM0mH,CAAO,GAE1C9mD,GAAK,OAAO,SAAS5/D,CAAI,CAClC,CAEA,IAAAk9K,IAAiBF,IC3BjB,MAAM3gL,GAAca,GACdsvK,GAAW3sK,GACX+/D,GAAOx+D,GAIb,SAAS+7K,IAAoBn9K,EAAM,CACjC,GAAIA,EAAK,KAAO,IACd,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAElC,MAAMwnB,EAAcxnB,EAAK,KAAK,CAAC,EAC/B,GAAI,CAAC4/D,GAAK,KAAK,WAAWp4C,CAAW,EACnC,OAAOo4C,GAAK,OAAO,SAAS5/D,CAAI,EAIlC,IAAIosB,EAAYpsB,EAAK,KAAK,CAAC,EAAE,UAAS,EAGtC,GAAI,WAAWwnB,EAAY,KAAK,IAAM,GAAI,CAIpCo4C,GAAK,KAAK,WAAWxzC,CAAS,IAChCA,EAAYwzC,GAAK,QAAQ,YAAYxzC,CAAS,GAEhD,MAAM6hJ,EAAazB,GAAS,WAAWpgJ,CAAS,EAC9C/vB,GAAY,qBACZA,GAAY,yBACd,OAAA+vB,EAAYogJ,GAAS,OAAOpgJ,CAAS,EAC9BwzC,GAAK,OAAO,YAAYquG,EAAYjuK,EAAMosB,CAAS,CAC3D,KACI,QAAI,WAAW5E,EAAY,KAAK,IAAM,EAClCo4C,GAAK,OAAO,YACjBvjE,GAAY,gBAAiB2D,EAAMosB,CAAS,EAGvCwzC,GAAK,OAAO,SAAS5/D,CAAI,CAEpC,CAEA,IAAAo9K,IAAiBD,ICzCjB,MAAMzG,IAASx5K,GAETb,IAAcwD,GACd+/D,GAAOx+D,GAIb,SAASi8K,IAAsBr9K,EAAM,CACnC,GAAIA,EAAK,KAAO,KACZ02K,IAAO,mBAAmB12K,EAAK,KAAK,CAAC,CAAC,GACtC4/D,GAAK,KAAK,WAAW5/D,EAAK,KAAK,CAAC,CAAC,GACjCA,EAAK,KAAK,CAAC,EAAE,QAAU,IAAK,CAC9B,MAAM0mH,EAAU1mH,EAAK,KAAK,CAAC,EAAE,UAAS,EACtC,OAAO4/D,GAAK,OAAO,YACjBvjE,IAAY,yBAA0B2D,EAAM0mH,CAAO,CACtD,CACD,OAAO9mD,GAAK,OAAO,SAAS5/D,CAAI,CAClC,CAEA,IAAAs9K,IAAiBD,ICnBjB,MAAMhhL,IAAca,GACd0iE,GAAO//D,GAIb,SAAS09K,IAAoBv9K,EAAM,CACjC,GAAIA,EAAK,KAAO,KACZ4/D,GAAK,KAAK,WAAW5/D,EAAK,KAAK,CAAC,CAAC,GACjCA,EAAK,KAAK,CAAC,EAAE,QAAU,IAAK,CAC9B,MAAM0mH,EAAU1mH,EAAK,KAAK,CAAC,EAAE,UAAS,EACtC,OAAO4/D,GAAK,OAAO,YACjBvjE,IAAY,uBAAwB2D,EAAM0mH,CAAO,CACpD,CACD,OAAO9mD,GAAK,OAAO,SAAS5/D,CAAI,CAClC,CAEA,IAAAw9K,IAAiBD,IChBjB,MAAMlhL,IAAca,GACdsvK,IAAW3sK,GACX+/D,GAAOx+D,GAMb,SAASq8K,IAAkCz9K,EAAM,CAC/C,GAAIA,EAAK,KAAO,IACd,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAElC,MAAM09K,EAAgB19K,EAAK,KAAK,UAAU8M,GACjC8yD,GAAK,KAAK,WAAW9yD,CAAG,GAAKA,EAAI,QAAU,EACnD,EACD,GAAI4wK,EAAgB,EAClB,OAAO99G,GAAK,OAAO,SAAS5/D,CAAI,EAKlC,IAAI29K,EAEAD,EAAgB,IAAM19K,EAAK,KAAK,OAClC29K,EAAqBD,EAAgB,EAGrCC,EAAqBD,EAAgB,EAGvC,IAAIE,EAAgB59K,EAAK,KAAK29K,CAAkB,EAEhD,GAAI/9G,GAAK,KAAK,WAAWg+G,CAAa,EACpC,OAAOh+G,GAAK,OAAO,SAAS5/D,CAAI,EAGlC,IAAI0mH,EAAU1mH,EAAK,YAGnB,OAAA49K,EAAgBpR,IAAS,OAAOoR,EAAc,UAAW,CAAA,EAGzDl3D,EAAQ,KAAKi3D,CAAkB,EAAIC,EACnCl3D,EAAQ,KAAK,OAAOg3D,EAAe,CAAC,EAGhCh3D,EAAQ,KAAK,SAAW,IAC1BA,EAAUA,EAAQ,KAAK,CAAC,GAEnB9mD,GAAK,OAAO,YACjBvjE,IAAY,mCAAoC2D,EAAM0mH,CAAO,CACjE,CAEA,IAAAm3D,IAAiBJ,ICrDjB,MAAMphL,IAAca,GACd0iE,GAAO//D,GAIb,SAASi+K,IAA0B99K,EAAM,CACvC,GAAIA,EAAK,KAAO,IACd,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAElC,MAAM+9K,EAAW/9K,EAAK,KAAK,UAAU8M,GAC5B8yD,GAAK,KAAK,WAAW9yD,CAAG,GAAKA,EAAI,QAAU,CACnD,EACD,GAAIixK,GAAY,EAAG,CACjB,IAAIr3D,EAAU1mH,EAAK,YAEnB,OAAA0mH,EAAQ,KAAK,OAAOq3D,EAAU,CAAC,EAG3Br3D,EAAQ,KAAK,SAAW,IAC1BA,EAAUA,EAAQ,KAAK,CAAC,GAEnB9mD,GAAK,OAAO,YACjBvjE,IAAY,0BAA2B2D,EAAM0mH,CAAO,CACvD,CACD,OAAO9mD,GAAK,OAAO,SAAS5/D,CAAI,CAClC,CAEA,IAAAg+K,IAAiBF,IC3BjB,MAAMzhL,GAAca,GACd0iE,GAAO//D,GAIb,SAASo+K,IAAyBj+K,EAAM,CACtC,GAAI,CAAC4/D,GAAK,KAAK,aAAa5/D,CAAI,EAC9B,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAElC,MAAMk+K,EAAWl+K,EAAK,KAAK,CAAC,EAE5B,GAAI4/D,GAAK,KAAK,aAAas+G,CAAQ,EAAG,CACpC,MAAMx3D,EAAUw3D,EAAS,KAAK,CAAC,EAAE,UAAS,EAC1C,OAAOt+G,GAAK,OAAO,YACjBvjE,GAAY,qBAAsB2D,EAAM0mH,CAAO,CAClD,SAEQ9mD,GAAK,KAAK,WAAWs+G,CAAQ,GAAK,WAAWA,EAAS,KAAK,EAAI,EAAG,CACzE,MAAMx3D,EAAU9mD,GAAK,QAAQ,SAAS,WAAWs+G,EAAS,KAAK,EAAI,EAAE,EACrE,OAAOt+G,GAAK,OAAO,YACjBvjE,GAAY,qBAAsB2D,EAAM0mH,CAAO,CAClD,SAEQ9mD,GAAK,KAAK,cAAcs+G,CAAQ,EAAG,CAE1C,MAAMC,EADkBD,EACmB,QAC3C,GAAIt+G,GAAK,KAAK,aAAau+G,CAAkB,EAAG,CAC9C,MAAMz3D,EAAU9mD,GAAK,QAAQ,YAAYu+G,EAAmB,KAAK,CAAC,CAAC,EACnE,OAAOv+G,GAAK,OAAO,YACjBvjE,GAAY,qBAAsB2D,EAAM0mH,CAAO,CAClD,CACF,CACD,OAAO9mD,GAAK,OAAO,SAAS5/D,CAAI,CAClC,CAEA,IAAAo+K,IAAiBH,IC9BjB,MAAMr+G,IAAO1iE,GACPu+K,IAAa57K,GAEbm8K,IAAuC56K,IACvCo7K,IAAuB34K,GACvB64K,IAAuB9jK,IACvBgkK,IAA6Bx6J,IAC7B06J,IAA8B/nJ,IAC9BioJ,IAAuBhoJ,IACvBmoJ,IAAsBloJ,IACtBooJ,IAAwBnoJ,IACxBqoJ,IAAsB9xH,IACtBgyH,IAAoC/4G,IACpCo5G,IAA4Bl5G,IAC5Bq5G,IAA2B52G,IAE3Bg3G,GAA2B,CAE/BrC,IAEAY,IAEAE,IAEAJ,IAEAa,IAGAF,IAEAY,IAEAjB,IAEAc,IAEAL,IAEAN,IAEAX,GACF,EAEM1jK,IAAS2iK,IAAW,SAAS6C,GAAM,EAGzC,SAASA,IAAOt+K,EAAM,CACpB,QAASrD,EAAI,EAAGA,EAAI0hL,GAAyB,OAAQ1hL,IAAK,CACxD,MAAMu4K,EAAamJ,GAAyB1hL,CAAC,EAAEqD,CAAI,EACnD,GAAIk1K,EAAW,aACb,OAAOA,EAGPl1K,EAAOk1K,EAAW,OAErB,CACD,OAAOt1G,IAAK,OAAO,SAAS5/D,CAAI,CAClC,CAEA,IAAAu+K,IAAiBzlK,ICjEjB,MAAMzc,IAAca,GACd0iE,GAAO//D,GACP47K,IAAar6K,GAOb0X,IAAS2iK,IAAW,UAAU+C,GAAgB,EAKpD,SAASA,IAAiBx+K,EAAM,CAC9B,GAAI,CAAC4/D,GAAK,KAAK,WAAW5/D,CAAI,GAAKA,EAAK,KAAO,IAC7C,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAElC,IAAIosB,EAAYpsB,EAAK,KAAK,CAAC,EAI3B,GAHI4/D,GAAK,KAAK,cAAcxzC,CAAS,IACnCA,EAAYA,EAAU,SAEpB,CAACwzC,GAAK,KAAK,WAAWxzC,CAAS,GAAKA,EAAU,KAAO,IACvD,OAAOwzC,GAAK,OAAO,SAAS5/D,CAAI,EAKlC,MAAMy+K,EAAe,CAAA,EACfj3J,EAAcxnB,EAAK,KAAK,CAAC,EAC/BosB,EAAU,KAAK,QAAQtf,GAAO,CAC5B,MAAM0iB,EAAcowC,GAAK,QAAQ,SAAS,IAAK,CAAC9yD,EAAK0a,CAAW,CAAC,EACjEgI,EAAY,YAAc,EAC1BivJ,EAAa,KAAKjvJ,CAAW,CACjC,CAAG,EAED,IAAIk3F,EAAU9mD,GAAK,QAAQ,SAAS,IAAK6+G,CAAY,EAErD,OAAA/3D,EAAU9mD,GAAK,QAAQ,YAAY8mD,CAAO,EAC1C1mH,EAAK,YAAc,EACZ4/D,GAAK,OAAO,YACjBvjE,IAAY,kBAAmB2D,EAAM0mH,EAAS,EAAK,CACvD,CAEA,IAAAg4D,IAAiB5lK,IC5CjB,MAAMwnD,IAAOpjE,GAEPb,GAAcwD,GACdwgE,GAAWj/D,GACXw+D,GAAO/7D,GAWb,SAAS86K,IAAYz4I,EAAU,CAK7B,GAJI,CAAC05B,GAAK,KAAK,WAAW15B,CAAQ,GAAKA,EAAS,KAAO,KAInD,CAAC05B,GAAK,KAAK,kBAAkB15B,EAAU,EAAI,EAC7C,OAAO05B,GAAK,OAAO,SAAS15B,CAAQ,EAGtC,MAAMioI,EAAW,CAAA,EACjB,IAAIznD,EAAUxgF,EAAS,YAEvB,MAAMkmI,EAAiB,SAAS/rG,GAASn6B,EAAS,KAAK,CAAC,CAAC,CAAC,EACpDumI,EAAmB,SAASpsG,GAASn6B,EAAS,KAAK,CAAC,CAAC,CAAC,EAG5D,IAAIxW,EAAM4wC,IAAK,IAAI8rG,EAAgBK,CAAgB,EAUnD,GAJIA,EAAmB,IACrB/8I,GAAO,IAGLA,IAAQ,EACV,OAAOkwC,GAAK,OAAO,SAAS15B,CAAQ,EAKtC,IAAIstI,EAASoL,IAAQl4D,EAASh3F,EAAK08I,EAAgBK,CAAgB,EACnE,OAAA0B,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAItDA,EAASqL,IAAUn4D,EAASh3F,EAAK08I,EAAgBK,CAAgB,EACjE0B,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAE/C5zG,GAAK,OAAO,YACfvjE,GAAY,kBAAmB6pC,EAAUwgF,EAAS,GAAMynD,CAAQ,CACtE,CAIA,SAASyQ,IAAQ5+K,EAAM0vB,EAAK08I,EAAgBK,EAAkB,CAC5D,IAAI/lD,EAAU1mH,EAAK,YAGnB,MAAMo3K,EAAUx3G,GAAK,QAAQ,SAASlwC,CAAG,EACzC0nJ,EAAQ,YAAc,EAEtB,MAAM0H,EAAwBl/G,GAAK,QAAQ,YAAYA,GAAK,QAAQ,SAClE,IAAK,CAACA,GAAK,QAAQ,SAASwsG,EAAe18I,CAAG,EAAG0nJ,CAAO,CAAC,CAAC,EACtD2H,EAA0Bn/G,GAAK,QAAQ,YAAYA,GAAK,QAAQ,SACpE,IAAK,CAACA,GAAK,QAAQ,SAAS6sG,EAAiB/8I,CAAG,EAAG0nJ,CAAO,CAAC,CAAC,EAC9D,OAAA1wD,EAAU9mD,GAAK,QAAQ,SACrB,IAAK,CAACk/G,EAAuBC,CAAuB,CAAC,EAEhDn/G,GAAK,OAAO,YACjBvjE,GAAY,SAAU2D,EAAM0mH,EAAS,EAAK,CAC9C,CAIA,SAASm4D,IAAU7+K,EAAM0vB,EAAK08I,EAAgBK,EAAkB,CAC9D,IAAI/lD,EACJ,MAAMs4D,EAAmBp/G,GAAK,QAAQ,SAASwsG,EAAe18I,CAAG,EAC3DuvJ,EAAqBr/G,GAAK,QAAQ,SAAS6sG,EAAiB/8I,CAAG,EAErE,OAAI,WAAWuvJ,EAAmB,KAAK,IAAM,EAC3Cv4D,EAAUs4D,EAGVt4D,EAAU9mD,GAAK,QAAQ,SACrB,IAAK,CAACo/G,EAAkBC,CAAkB,CAAC,EAGxCr/G,GAAK,OAAO,YACjBvjE,GAAY,WAAY2D,EAAM0mH,EAAS,EAAK,CAChD,CAEA,IAAAw4D,GAAiBP,ICpGjB,MAAMA,IAAczhL,GACdojE,IAAOzgE,GAEPxD,GAAc+E,GACdi/D,GAAWx8D,GACX+7D,GAAOhnD,GAUb,SAASumK,IAAqBn/K,EAAM,CAClC,IAAI0mH,EAAU1mH,EAAK,YAKnB,GAHI,CAAC4/D,GAAK,KAAK,WAAW5/D,CAAI,GAAKA,EAAK,KAAO,KAG3C,CAACA,EAAK,KAAK,MAAMsV,GAAKsqD,GAAK,KAAK,kBAAkBtqD,EAAG,EAAI,CAAC,EAC5D,OAAOsqD,GAAK,OAAO,SAAS5/D,CAAI,EAElC,MAAMo/K,EAAep/K,EAAK,KAAK,IAAIkmC,GAC1B,WAAWm6B,GAASn6B,EAAS,KAAK,CAAC,CAAC,CAAC,CAC7C,EAEKioI,EAAW,CAAA,EACjB,IAAIqF,EAIJ,OAAK4L,EAAa,MAAM53J,GAAeA,IAAgB43J,EAAa,CAAC,CAAC,IACpE5L,EAAS6L,IAAsB34D,CAAO,EACtCynD,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAGtDA,EAAS8L,IAAqB54D,CAAO,EACrCynD,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAGtDA,EAAS+L,IAAmB74D,CAAO,EACnCynD,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,GAKxDA,EAASgM,IAAwC94D,CAAO,EACxDynD,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAGtDA,EAASiM,IAAsB/4D,CAAO,EACtCynD,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAGtDA,EAASkM,IAAgBh5D,CAAO,EAC5B8sD,EAAO,eACTrF,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,GAIxDA,EAASmL,IAAYj4D,CAAO,EACxB8sD,EAAO,eACTrF,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,GAGjD5zG,GAAK,OAAO,YACjBvjE,GAAY,cAAe2D,EAAM0mH,EAAS,GAAMynD,CAAQ,CAC5D,CAKA,SAASqR,IAAwCx/K,EAAM,CACrD,IAAI0mH,EAAU1mH,EAAK,YAEnB,MAAM2/K,EAAoBj5D,EAAQ,KAAK,CAAC,EAAE,KAAK,CAAC,EAC1Ck5D,EAAgB,CAAA,EACtBl5D,EAAQ,KAAK,QAAQxgF,GAAY,CAC/B05I,EAAc,KAAK15I,EAAS,KAAK,CAAC,CAAC,CACvC,CAAG,EACD,MAAMinI,EAAevtG,GAAK,QAAQ,YAChCA,GAAK,QAAQ,SAAS,IAAKggH,CAAa,CAAC,EAE3C,OAAAl5D,EAAU9mD,GAAK,QAAQ,SAAS,IAAK,CAACutG,EAAcwS,CAAiB,CAAC,EAC/D//G,GAAK,OAAO,YACjBvjE,GAAY,mBAAoB2D,EAAM0mH,CAAO,CACjD,CAIA,SAAS+4D,IAAsBz/K,EAAM,CACnC,MAAM0mH,EAAU1mH,EAAK,YAErB,OAAA0mH,EAAQ,KAAK,CAAC,EAAI9mD,GAAK,QAAQ,SAASS,GAASqmD,EAAQ,KAAK,CAAC,CAAC,CAAC,EAC1D9mD,GAAK,OAAO,YACjBvjE,GAAY,eAAgB2D,EAAM0mH,CAAO,CAC7C,CAEA,SAASg5D,IAAgB1/K,EAAM,CAC7B,IAAI0mH,EAAU1mH,EAAK,YAEnB,OAAI0mH,EAAQ,KAAK,CAAC,EAAE,QAAU,KAC5BA,EAAU9mD,GAAK,QAAQ,SAAS,CAAC,EAC1BA,GAAK,OAAO,YACjBvjE,GAAY,sBAAuB2D,EAAM0mH,CAAO,GAG7C9mD,GAAK,OAAO,SAAS5/D,CAAI,CAClC,CAMA,SAASq/K,IAAsBr/K,EAAM,CACnC,MAAM0mH,EAAU1mH,EAAK,YAEfo/K,EAAe14D,EAAQ,KAAK,IAAIxgF,GAC7B,WAAWA,EAAS,KAAK,CAAC,EAAE,KAAK,CACzC,EACKy5I,EAAoBr/G,IAAK,IAAI,GAAG8+G,CAAY,EAElD,OAAA14D,EAAQ,KAAK,QAAQ,CAACrkH,EAAO,IAAM,CAGjC,MAAMw9K,EAAgBF,EAAoBP,EAAa,CAAC,EACxD,GAAIS,IAAkB,EAAG,CACvB,MAAMC,EAAoBlgH,GAAK,QAAQ,SAASigH,CAAa,EACvD1S,EAAevtG,GAAK,QAAQ,YAChCA,GAAK,QAAQ,SAAS,IAAK,CAACv9D,EAAM,KAAK,CAAC,EAAGy9K,CAAiB,CAAC,CAAC,EAC1DC,EAAgBngH,GAAK,QAAQ,YACjCA,GAAK,QAAQ,SAAS,IAAK,CAACv9D,EAAM,KAAK,CAAC,EAAGy9K,CAAiB,CAAC,CAAC,EAChEp5D,EAAQ,KAAK,CAAC,EAAI9mD,GAAK,QAAQ,SAAS,IAAK,CAACutG,EAAc4S,CAAa,CAAC,CAC3E,CACL,CAAG,EAEMngH,GAAK,OAAO,YACjBvjE,GAAY,mBAAoB2D,EAAM0mH,CAAO,CACjD,CAEA,SAAS44D,IAAqBt/K,EAAM,CAClC,MAAM0mH,EAAU1mH,EAAK,YAErB,OAAA0mH,EAAQ,KAAK,IAAIxgF,GAAY,CAC3BA,EAAS,KAAK,CAAC,EAAI05B,GAAK,QAAQ,SAASS,GAASn6B,EAAS,KAAK,CAAC,CAAC,CAAC,CACvE,CAAG,EAEM05B,GAAK,OAAO,YACjBvjE,GAAY,sBAAuB2D,EAAM0mH,CAAO,CACpD,CAEA,SAAS64D,IAAmBv/K,EAAM,CAChC,MAAM0mH,EAAU1mH,EAAK,YAErB,OAAA0mH,EAAQ,KAAK,IAAIxgF,GAAY,CAC3BA,EAAS,KAAK,CAAC,EAAI05B,GAAK,QAAQ,SAASS,GAASn6B,EAAS,KAAK,CAAC,CAAC,CAAC,CACvE,CAAG,EAEM05B,GAAK,OAAO,YACjBvjE,GAAY,oBAAqB2D,EAAM0mH,CAAO,CAClD,CAEA,IAAAs5D,GAAiBb,IC3KjB,MAAMA,IAAuBjiL,GAEvBb,GAAcwD,GACdwgE,GAAWj/D,GACXw+D,GAAO/7D,GAOb,SAASo8K,IAAuBjgL,EAAM,CACpC,GAAI,CAAC4/D,GAAK,KAAK,WAAW5/D,CAAI,GAAKA,EAAK,KAAO,KAAOA,EAAK,KAAK,SAAW,EACzE,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAGlC,MAAMkgL,EAAWlgL,EAAK,KAAK,CAAC,EACtBmgL,EAAYngL,EAAK,KAAK,CAAC,EAC7B,IAAI+wK,EAAWqP,EACf,GAAIxgH,GAAK,KAAK,WAAWsgH,CAAQ,EAC/B,GAAItgH,GAAK,KAAK,kBAAkBugH,CAAS,EACvCpP,EAAYmP,EACZE,EAAeD,MAGf,QAAOvgH,GAAK,OAAO,SAAS5/D,CAAI,UAG3B4/D,GAAK,KAAK,WAAWugH,CAAS,EACrC,GAAIvgH,GAAK,KAAK,kBAAkBsgH,CAAQ,EACtCnP,EAAYoP,EACZC,EAAeF,MAGf,QAAOtgH,GAAK,OAAO,SAAS5/D,CAAI,MAIlC,QAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAGlC,IAAI0mH,EAAU1mH,EAAK,YACfmuK,EAAW,CAAA,EAIXkS,EAAcC,EACdrS,EACJ,GAAI,OAAO,UAAU,WAAW8C,EAAU,KAAK,CAAC,EAAG,CACjD,MAAMhF,EAAkBqU,EAAa,KAAK,CAAC,EACrC3T,EAAmB,SAASV,CAAe,EAC3CwU,EAAiB,SAASxP,EAAU,KAAK,EACzCiO,EAAmBp/G,GAAK,QAAQ,SACpC2gH,EAAiB9T,CAAgB,EACnC4T,EAAezgH,GAAK,QAAQ,SAC1B,IAAK,CAACo/G,EAAkBjT,CAAe,CAAC,EAC1CuU,EAAkBF,EAClBnS,EAAa5xK,GAAY,2BAC1B,KACI,CAEH,IAAImkL,EAAengH,GAAS+/G,CAAY,EACpCI,EAAe,EACjBA,EAAe,WAAWA,EAAa,YAAY,CAAC,CAAC,EAGrDA,EAAe,WAAWA,EAAa,QAAQ,CAAC,CAAC,EAEnDF,EAAkB1gH,GAAK,QAAQ,SAAS4gH,CAAY,EACpDH,EAAetP,EACf9C,EAAa5xK,GAAY,4BAC1B,CAgBD,GAdIujE,GAAK,KAAK,WAAWsgH,CAAQ,GAC/Bx5D,EAAQ,KAAK,CAAC,EAAI25D,EAClB35D,EAAQ,KAAK,CAAC,EAAI45D,IAGlB55D,EAAQ,KAAK,CAAC,EAAI45D,EAClB55D,EAAQ,KAAK,CAAC,EAAI25D,GAGpBlS,EAAS,KAAKvuG,GAAK,OAAO,YAAYquG,EAAYjuK,EAAM0mH,CAAO,CAAC,EAChEA,EAAU9mD,GAAK,OAAO,kBAAkB8mD,CAAO,EAI3CunD,IAAe5xK,GAAY,4BAA6B,CAC1D,MAAMokL,EAAoBtB,IAAqBz4D,CAAO,EACtDynD,EAAWA,EAAS,OAAOsS,EAAkB,QAAQ,CACtD,KAEI,CACH,MAAMC,EAAW9gH,GAAK,QAAQ,SAASS,GAASqmD,CAAO,CAAC,EACxDynD,EAAS,KAAKvuG,GAAK,OAAO,YACxBvjE,GAAY,oBAAqBqqH,EAASg6D,CAAQ,CAAC,CACtD,CAED,MAAMC,EAAWxS,EAASA,EAAS,OAAS,CAAC,EAC7C,OAAAznD,EAAU9mD,GAAK,OAAO,kBAAkB+gH,EAAS,OAAO,EAEjD/gH,GAAK,OAAO,YACjBvjE,GAAY,oBAAqB2D,EAAM0mH,EAAS,GAAMynD,CAAQ,CAClE,CAEA,IAAAyS,GAAiBX,ICzGjB,MAAMA,IAAyB/iL,GACzBiiL,GAAuBt/K,GACvBk8K,GAAmB36K,GAEnB/E,GAAcwH,GACd+7D,GAAOhnD,GAKb,SAASioK,GAAoB7gL,EAAM,CAOjC,GANI4/D,GAAK,KAAK,cAAc5/D,CAAI,IAC9BA,EAAOA,EAAK,SAEV,CAAC4/D,GAAK,KAAK,WAAW5/D,CAAI,GAAKA,EAAK,KAAO,KAG3CA,EAAK,KAAK,KAAKA,GAAQ,CAAC4/D,GAAK,KAAK,6BAA6B5/D,CAAI,CAAC,EACtE,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAIlC,MAAM8gL,EAAmB,CACvB/E,GACAoD,GACAc,GACJ,EACE,QAAStjL,EAAI,EAAGA,EAAImkL,EAAiB,OAAQnkL,IAAK,CAChD,MAAM62K,EAASsN,EAAiBnkL,CAAC,EAAEqD,CAAI,EACvC,GAAIwzK,EAAO,cACL5zG,GAAK,KAAK,6BAA6B4zG,EAAO,OAAO,EACvD,OAAOA,CAGZ,CAED,IAAI9sD,EAAU1mH,EAAK,YACnB,MAAMmuK,EAAW,CAAA,EACjB,IAAIqF,EAGJA,EAASuN,IAA2Br6D,CAAO,EAC3CynD,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAEtD,MAAMt3I,EAAYwqF,EAAQ,KAAK,CAAC,EAC1Bs6D,EAAYt6D,EAAQ,KAAK,CAAC,EAIhC,GAAI9mD,GAAK,KAAK,cAAc1jC,CAAS,EAAG,CACtC,MAAM+kJ,EAAe/kJ,EAAU,QACzBglJ,EAAiBnF,GAAiBkF,CAAY,EACpDzN,EAAS5zG,GAAK,OAAO,aAAa8mD,EAASw6D,EAAgB,CAAC,EAC5D/S,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,CACvD,CAID,GAAI5zG,GAAK,KAAK,cAAcohH,CAAS,EAAG,CACtC,MAAMvC,EAAeuC,EAAU,QACzBE,EAAiB/B,GAAqBV,CAAY,EACxDjL,EAAS5zG,GAAK,OAAO,aAAa8mD,EAASw6D,EAAgB,CAAC,EAC5D/S,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,CACvD,CAKD,OAAAA,EAASqN,GAAoBn6D,CAAO,EACpCynD,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAE/C5zG,GAAK,OAAO,YACjBvjE,GAAY,oBAAqB2D,EAAM0mH,EAAS,GAAMynD,CAAQ,CAClE,CAQA,SAAS4S,IAA2B/gL,EAAM,CACxC,IAAIghL,EAAYhhL,EAAK,KAAK,OAAO4/D,GAAK,KAAK,iBAAiB,EACxD1jC,EAAYl8B,EAAK,KAAK,OAAO4/D,GAAK,KAAK,UAAU,EAErD,GAAIohH,EAAU,SAAW,GAAK9kJ,EAAU,SAAW,EACjD,MAAM,MAAM,sDAAwDl8B,CAAI,EAG1E,GAAIghL,EAAU,OAAS9kJ,EAAU,SAAWl8B,EAAK,KAAK,OACpD,MAAM,MAAM,mDAAmD,EAGjEk8B,EAAYA,EAAU,IAAIl8B,IAExBA,EAAK,YAAc,EAEZA,EAAK,YACb,EAEGk8B,EAAU,OAAS,EACrBA,EAAY0jC,GAAK,QAAQ,YAAYA,GAAK,QAAQ,SAAS,IAAK1jC,CAAS,CAAC,EAG1EA,EAAYA,EAAU,CAAC,EAGzB8kJ,EAAYA,EAAU,IAAIhhL,IAExBA,EAAK,YAAc,EAEZA,EAAK,YACb,EAEGghL,EAAU,OAAS,EACrBA,EAAYphH,GAAK,QAAQ,YAAYA,GAAK,QAAQ,SAAS,IAAKohH,CAAS,CAAC,EAG1EA,EAAYA,EAAU,CAAC,EAGzB,MAAMt6D,EAAU9mD,GAAK,QAAQ,SAAS,IAAK,CAAC1jC,EAAW8kJ,CAAS,CAAC,EACjE,OAAOphH,GAAK,OAAO,YACjBvjE,GAAY,mBAAoB2D,EAAM0mH,CAAO,CACjD,CAEA,IAAAy6D,IAAiBN,GClIjB,MAAMnK,GAASx5K,GACT2jL,GAAsBhhL,IAEtBxD,GAAc+E,GACdw+D,GAAO/7D,GAGb,SAASu9K,IAAaphL,EAAMqhL,EAAe,GAAO,CAChD,GAAI,CAACzhH,GAAK,KAAK,WAAW5/D,CAAI,EAC5B,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAElC,IAAIwzK,EAeJ,MAbI,CAAC6N,IACH7N,EAASqN,GAAoB7gL,CAAI,EAC7BwzK,EAAO,gBAKbA,EAAS8N,IAAuBthL,CAAI,EAChCwzK,EAAO,gBAIXA,EAAS+N,IAAoBvhL,CAAI,EAC7BwzK,EAAO,cACFA,EAGF5zG,GAAK,OAAO,SAAS5/D,CAAI,CAClC,CAGA,SAASshL,IAAuBthL,EAAM,CACpC,OAAK02K,GAAO,gBAAgB,8BAA8B12K,CAAI,EAIvDwhL,GACLxhL,EAAM4/D,GAAK,eAAgBvjE,GAAY,oBAAoB,EAJpDujE,GAAK,OAAO,SAAS5/D,CAAI,CAKpC,CAGA,SAASuhL,IAAoBvhL,EAAM,CACjC,OAAK02K,GAAO,gBAAgB,2BAA2B12K,CAAI,EAIpDwhL,GACLxhL,EAAM4/D,GAAK,YAAavjE,GAAY,aAAa,EAJ1CujE,GAAK,OAAO,SAAS5/D,CAAI,CAKpC,CAIA,SAASwhL,GAAiBxhL,EAAM6uK,EAAcZ,EAAY,CACxD,MAAME,EAAW,CAAA,EACjB,IAAIznD,EAAU1mH,EAAK,YAKfwzK,EAASiO,IAA0B/6D,EAASmoD,CAAY,EAC5D,OAAI2E,EAAO,eACTrF,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,GAMxDA,EAASkO,IAA0Bh7D,EAASmoD,CAAY,EACpD2E,EAAO,eACTrF,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,GAIxDA,EAASmO,IAA2Bj7D,EAASmoD,CAAY,EACzDV,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAGtDA,EAASoO,IAAuBl7D,CAAqB,EACrDynD,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAE/C5zG,GAAK,OAAO,YACjBquG,EAAYjuK,EAAM0mH,EAAS,GAAMynD,CAAQ,CAC7C,CAOA,SAASsT,IAA0BzhL,EAAM6uK,EAAc,CACrD,MAAMnoD,EAAU1mH,EAAK,YACrB,IAAIquK,EAAS,GAETyL,EAAc,EAkBlB,OAjBApzD,EAAQ,KAAK,QAAQ,CAACrkH,EAAO1F,IAAM,CACjC,MAAMuuK,EAAO,IAAI2D,EAAaxsK,CAAK,EAC/B6oK,EAAK,cAAe,IAAK,IAC3BxkD,EAAQ,KAAK/pH,CAAC,EAAIijE,GAAK,QAAQ,KAC7BsrG,EAAK,YAAa,EAClBA,EAAK,gBAAiB,EACtBtrG,GAAK,QAAQ,SAAS,CAAC,EACvB,IAEF8mD,EAAQ,KAAK/pH,CAAC,EAAE,YAAcm9K,EAC9B95K,EAAK,KAAKrD,CAAC,EAAE,YAAcm9K,EAE3BzL,EAAS,GACTyL,IAEN,CAAG,EAEGzL,EACKzuG,GAAK,OAAO,YACfvjE,GAAY,uBAAwB2D,EAAM0mH,EAAS,EAAK,EAGrD9mD,GAAK,OAAO,SAAS5/D,CAAI,CAEpC,CAOA,SAAS0hL,IAA0B1hL,EAAM6uK,EAAc,CACrD,MAAMnoD,EAAU1mH,EAAK,YACrB,IAAIquK,EAAS,GAETyL,EAAc,EAkBlB,OAjBApzD,EAAQ,KAAK,QAAQ,CAACrkH,EAAO1F,IAAM,CACjC,MAAMuuK,EAAO,IAAI2D,EAAaxsK,CAAK,EAC/B6oK,EAAK,kBAAoB,KAC3BxkD,EAAQ,KAAK/pH,CAAC,EAAIijE,GAAK,QAAQ,KAC7BsrG,EAAK,YAAa,EAClBA,EAAK,gBAAiB,EACtBA,EAAK,aAAc,EACnB,IAEFlrK,EAAK,KAAKrD,CAAC,EAAE,YAAcm9K,EAC3BpzD,EAAQ,KAAK/pH,CAAC,EAAE,YAAcm9K,EAE9BzL,EAAS,GACTyL,IAEN,CAAG,EAEGzL,EACKzuG,GAAK,OAAO,YACjBvjE,GAAY,4BAA6B2D,EAAM0mH,EAAS,EAAK,EAGxD9mD,GAAK,OAAO,SAAS5/D,CAAI,CAEpC,CAKA,SAAS2hL,IAA2B3hL,EAAM6uK,EAAc,CACtD,IAAInoD,EAAU1mH,EAAK,YAEnB,MAAM8uK,EAAWpoD,EAAQ,KAAK,IAAIpxG,GAAK,IAAIu5J,EAAav5J,CAAC,CAAC,EACpDusK,EAAkB/S,EAAS,IAAI5D,GAAQA,EAAK,aAAa,EAAI,CAAC,EAC9D4W,EAAmBliH,GAAK,QAAQ,YACpCA,GAAK,QAAQ,SAAS,IAAKiiH,CAAe,CAAC,EAI7CC,EAAiB,YAAc,EAI/B,MAAM/S,EAAYD,EAAS,CAAC,EACtBmE,EAAelE,EAAU,kBACzBnD,EAAWmD,EAAU,cAC3B,OAAAroD,EAAU9mD,GAAK,QAAQ,KACrBgsG,EAAUqH,EAAc6O,CAAgB,EAEnCliH,GAAK,OAAO,YACjBvjE,GAAY,mBAAoB2D,EAAM0mH,EAAS,EAAK,CACxD,CAKA,SAASk7D,IAAuB5hL,EAAM,CAIpC,MAAM+hL,EAAiB/hL,EAAK,UAAW,EAAC,KAAK,CAAC,EACxCwuK,EAAcqS,GAAoBkB,CAAc,EACtD,OAAOniH,GAAK,OAAO,aAAa5/D,EAAMwuK,EAAa,CAAC,CACtD,CAEA,IAAAwT,IAAiBZ,IC1MjB,MAAM/kL,IAAca,GACd0iE,GAAO//D,GACP47K,IAAar6K,GAkBb0X,IAAS2iK,IAAW,UAAUwG,GAAiB,EAErD,SAASA,IAAkBjiL,EAAM,CAC/B,GAAI,CAAC4/D,GAAK,KAAK,WAAW5/D,CAAI,GAAKA,EAAK,KAAO,IAC7C,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAKlC,MAAMkiL,EAAqBliL,EAAK,KAAK,KACnC8M,GAAO8yD,GAAK,WAAW,WAAW9yD,CAAG,CAAC,EAClCq1K,EAAqBniL,EAAK,KAAK,KAAK4/D,GAAK,eAAe,gBAAgB,EACxEwiH,EAAkCpiL,EAAK,KAAK,KAAKqiL,GAA0B,EAEjF,GAAI,CAACH,GAAuBC,GAAsB,CAACC,EACjD,OAAOxiH,GAAK,OAAO,SAAS5/D,CAAI,EAGlC,MAAM4/K,EAAgB,CAAA,EAChB0C,EAAkB,CAAA,EACxBtiL,EAAK,KAAK,QAAQwqE,GAAW,CAC3B,GAAI5K,GAAK,WAAW,WAAW4K,CAAO,EAAG,CACvC,MAAMtkC,EAAW05B,GAAK,WAAW,YAAY4K,CAAO,EACpDo1G,EAAc,KAAK15I,EAAS,KAAK,CAAC,CAAC,EACnCo8I,EAAgB,KAAKp8I,EAAS,KAAK,CAAC,CAAC,CACtC,MAEC05I,EAAc,KAAKp1G,CAAO,CAEhC,CAAG,EAED,MAAM2iG,EAAevtG,GAAK,QAAQ,YAChCA,GAAK,QAAQ,SAAS,IAAKggH,CAAa,CAAC,EACrCtD,EAAiBgG,EAAgB,SAAW,EAC9CA,EAAgB,CAAC,EACjB1iH,GAAK,QAAQ,YAAYA,GAAK,QAAQ,SAAS,IAAK0iH,CAAe,CAAC,EAElE57D,EAAU9mD,GAAK,QAAQ,SAAS,IAAK,CAACutG,EAAcmP,CAAc,CAAC,EACzE,OAAO18G,GAAK,OAAO,YACjBvjE,IAAY,mBAAoB2D,EAAM0mH,CAAO,CACjD,CAIA,SAAS27D,IAA2BriL,EAAM,CACxC,GAAI,CAAE4/D,GAAK,WAAW,WAAW5/D,CAAI,EACnC,MAAO,GAIT,MAAMwnB,EADWo4C,GAAK,WAAW,YAAY5/D,CAAI,EACpB,KAAK,CAAC,EACnC,OAAO4/D,GAAK,eAAe,iBAAiBp4C,CAAW,CACzD,CAEA,IAAA+6J,GAAiBzpK,IC1EjB,MAAMijK,GAAmB7+K,GACnBw5K,GAAS72K,GACTowK,GAA0B7uK,GAC1BmhL,IAA0B1+K,GAE1BxH,GAAcuc,GACdgnD,GAAOx9C,GACPgzJ,GAAUrgJ,GAMhB,SAASytJ,IAAkBxiL,EAAMqhL,EAAe,GAAO,CACrD,GAAI,CAACzhH,GAAK,KAAK,WAAW5/D,CAAI,EAC5B,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAElC,IAAIwzK,EAiBJ,MAfI,CAAC6N,GAAkB,CAAC3K,GAAO,iCAAiC12K,CAAI,IAClEwzK,EAASuI,GAAiB/7K,CAAI,EAC1BwzK,EAAO,eAKXA,EAAS+O,IAAwBviL,CAAI,EACjCwzK,EAAO,iBAMbA,EAASiP,IAAwBziL,CAAI,EACjCwzK,EAAO,eACTA,EAAO,WAAan3K,GAAY,sBACzBm3K,IAGTA,EAASkP,IAAiB1iL,CAAI,EAC1BwzK,EAAO,aACFA,EAGF5zG,GAAK,OAAO,SAAS5/D,CAAI,EAClC,CAEA,SAAS0iL,IAAiB1iL,EAAM,CAC9B,GAAI,CAAC02K,GAAO,6BAA6B12K,CAAI,EAC3C,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAGlC,IAAI0mH,EAAU1mH,EAAK,YAGnB,MAAM2iL,EAAY3iL,EAAK,KAAK,IAAIkrK,GAAQkK,GAAQ,gBAAgBlK,CAAI,CAAC,EAG/D0X,EAAkBhjH,GAAK,QAAQ,SAAS,IAAK+iH,CAAS,EAItDzC,EAAWlgL,EAAK,KAAK,CAAC,EACtBorK,EAAWgK,GAAQ,YAAY8K,CAAQ,EAE7C,OAAAx5D,EAAU9mD,GAAK,QAAQ,QAAQgjH,EAAiBxX,CAAQ,EAEjDxrG,GAAK,OAAO,YAAYvjE,GAAY,mBAAoB2D,EAAM0mH,EAAS,EAAK,CACrF,CAEA,SAAS+7D,IAAwBziL,EAAM,CACrC,GAAI,CAAC02K,GAAO,mCAAmC12K,CAAI,GAC/C,CAAC02K,GAAO,iCAAiC12K,CAAI,EAC/C,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAGlC,MAAMmuK,EAAW,CAAA,EACjB,IAAIznD,EAAU1mH,EAAK,YAMfwzK,EAASqP,IAAen8D,CAAO,EAC/B8sD,EAAO,eACTrF,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,GAMpDkD,GAAO,iCAAiC12K,CAAI,EAC9CwzK,EAASsP,IAAyBp8D,CAAO,EAGzC8sD,EAASuP,IAA2Br8D,CAAO,EAE7CynD,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAOtD,MAAMwP,EAAct8D,EAAQ,KAAK,CAAC,EAAE,QAC9Bu8D,EAAYlH,GAAiBiH,CAAW,EAO9C,OANIC,EAAU,eACZzP,EAAS5zG,GAAK,OAAO,aAAa8mD,EAASu8D,EAAW,CAAC,EACvD9U,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,GAGpDrF,EAAS,SAAW,EACfA,EAAS,CAAC,EAGVvuG,GAAK,OAAO,YACjBvjE,GAAY,0BACZ2D,EAAM0mH,EAAS,GAAMynD,CAAQ,CAEnC,CASA,SAAS0U,IAAe7iL,EAAM,CAC5B,MAAM0mH,EAAU1mH,EAAK,YACrB,IAAIquK,EAAS,GAETyL,EAAc,EAkClB,OAjCIpD,GAAO,iCAAiC12K,CAAI,EAC9C0mH,EAAQ,KAAK,QAAQ,CAACrkH,EAAO,IAAM,CACjC,GAAIu9D,GAAK,KAAK,WAAWv9D,CAAK,EAAG,CAC/B,MAAMkT,EAAO06J,GAAwB,YAAY5tK,CAAK,EAChD2T,EAAW4pD,GAAK,QAAQ,SAAS,CAAC,EACxC8mD,EAAQ,KAAK,CAAC,EAAI9mD,GAAK,QAAQ,SAAS,IAAK,CAACrqD,EAAMS,CAAQ,CAAC,EAE7D0wG,EAAQ,KAAK,CAAC,EAAE,YAAcozD,EAC9B95K,EAAK,KAAK,CAAC,EAAE,YAAc85K,EAE3BzL,EAAS,GACTyL,GACD,CACP,CAAK,EAGDpzD,EAAQ,KAAK,QAAQ,CAACrkH,EAAO,IAAM,CACjC,MAAMmuK,EAAW,IAAI5wG,GAAK,eAAev9D,CAAK,EACzCmuK,EAAS,oBACZ9pD,EAAQ,KAAK,CAAC,EAAI9mD,GAAK,QAAQ,eAC7B4wG,EAAS,cAAe,EACxB5wG,GAAK,QAAQ,SAAS,CAAC,EACvB4wG,EAAS,aAAY,CAAE,EAEzB9pD,EAAQ,KAAK,CAAC,EAAE,YAAcozD,EAC9B95K,EAAK,KAAK,CAAC,EAAE,YAAc85K,EAE3BzL,EAAS,GACTyL,IAER,CAAK,EAGCzL,EACKzuG,GAAK,OAAO,YACjBvjE,GAAY,oBAAqB2D,EAAM0mH,EAAS,EAAK,EAGhD9mD,GAAK,OAAO,SAAS5/D,CAAI,CAEpC,CAKA,SAAS8iL,IAAyB9iL,EAAM,CAGtC,MAAM4rK,EAAWqE,GAAwB,YAAYjwK,EAAK,KAAK,CAAC,CAAC,EAG3DkjL,EAAmBljL,EAAK,KAAK,IACjCiwK,GAAwB,eAAe,EACnCkT,EAAcvjH,GAAK,QAAQ,YAC/BA,GAAK,QAAQ,SAAS,IAAKsjH,CAAgB,CAAC,EACxCx8D,EAAU9mD,GAAK,QAAQ,SAAS,IAAK,CAACgsG,EAAUuX,CAAW,CAAC,EAClE,OAAOvjH,GAAK,OAAO,YACjBvjE,GAAY,2BAA4B2D,EAAM0mH,CAAO,CACzD,CAKA,SAASq8D,IAA2B/iL,EAAM,CACxC,MAAMuwK,EAAqBvwK,EAAK,KAAK,IAAIsV,GAAK,IAAIsqD,GAAK,eAAetqD,CAAC,CAAC,EAIlE8tK,EAAa7S,EAAmB,CAAC,EAAE,cAAa,EAIhD2S,EAAmB3S,EAAmB,IAAIjpK,GAAKA,EAAE,gBAAgB,EAAI,CAAC,EACtE67K,EAAcvjH,GAAK,QAAQ,YAC/BA,GAAK,QAAQ,SAAS,IAAKsjH,CAAgB,CAAC,EACxCx8D,EAAU9mD,GAAK,QAAQ,eAAewjH,EAAYD,EAAa,IAAI,EACzE,OAAOvjH,GAAK,OAAO,YACjBvjE,GAAY,6BAA8B2D,EAAM0mH,CAAO,CAC3D,CAEA,IAAA28D,IAAiBb,ICtNjB,MAAMpB,GAAelkL,IACfw5K,IAAS72K,GACT2iL,GAAoBphL,IAEpB/E,IAAcwH,GACdw1K,IAAoBzgK,GACpBgnD,GAAOx9C,GACPq5J,IAAa1mJ,GAEbuuJ,IAAyB,CAC7B,IAAKlC,GACL,IAAKoB,EACP,EAIM1pK,IAAS2iK,IAAW,UAAU8H,GAA0B,EAK9D,SAASA,IAA2BvjL,EAAM,CACxC,GAAIA,EAAK,KAAO,IAAK,CACnB,MAAMwzK,EAASgQ,GAA2BxjL,CAAI,EAC9C,OAAIwzK,EAAO,aACFA,EAIF4N,GAAaphL,EAAM,EAAI,CAC/B,SACQA,EAAK,KAAO,IAAK,CAGxB,GAAI02K,IAAO,iCAAiC12K,CAAI,EAC9C,OAAOwiL,GAAkBxiL,EAAM,EAAI,EAErC,MAAMwzK,EAASgQ,GAA2BxjL,CAAI,EAC9C,OAAIwzK,EAAO,cAETA,EAAO,QAAQ,SAAW,GACnBA,GAIFgP,GAAkBxiL,EAAM,EAAI,CACpC,KAEC,QAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,CAEpC,CAIA,SAASwjL,GAA2BxjL,EAAM,CACxC,IAAImuK,EAAW,CAAA,EAEf,MAAMqF,EAAS6F,IAAkB,iBAAiBr5K,EAAK,UAAW,CAAA,EAClE,GAAI,CAACwzK,EAAO,aACV,OAAOA,EAITrF,EAAS,KAAKqF,CAAM,EACpB,IAAI9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAI1D,MAAMiQ,EAAeC,IAAiBh9D,CAAO,EAC7C,GAAI+8D,EAAa,OAAS,EAAG,CAC3BtV,EAAWA,EAAS,OAAOsV,CAAY,EACvC,MAAM9C,EAAW8C,EAAaA,EAAa,OAAS,CAAC,EACrD/8D,EAAU9mD,GAAK,OAAO,kBAAkB+gH,EAAS,OAAO,CACzD,CAED,OAAO/gH,GAAK,OAAO,YACjBvjE,IAAY,+BACZ2D,EAAM0mH,EAAS,GAAMynD,CAAQ,CACjC,CAMA,SAASuV,IAAiB1jL,EAAM,CAC9B,MAAMuuK,EAAQ,CAAA,EACd,IAAI7nD,EAAU1mH,EAAK,YAEnB,QAASrD,EAAI,EAAGA,EAAIqD,EAAK,KAAK,OAAQrD,IAAK,CACzC,IAAI0F,EAAQrC,EAAK,KAAKrD,CAAC,EAEvB,GAAI,CAACijE,GAAK,KAAK,cAAcv9D,CAAK,EAChC,SAEFA,EAAQA,EAAM,QACd,MAAMmsK,EAAc8U,IAAuB58D,EAAQ,EAAE,EAAErkH,CAAK,EAC5D,GAAImsK,EAAY,aAAc,CAC5B,MAAMgF,EAAS5zG,GAAK,OAAO,aAAa8mD,EAAS8nD,EAAa7xK,CAAC,EAC/D4xK,EAAM,KAAKiF,CAAM,EACjB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,CACvD,CACF,CAED,OAAOjF,CACT,CAEA,IAAAoV,GAAiB7qK,IC5GjB,MAAMijK,IAAmB7+K,GACnBymL,IAA0B9jL,GAC1B28K,IAAuBp7K,GAEvB/E,GAAcwH,GACd2oK,GAAW5zJ,GACXgnD,GAAOx9C,GACPq5J,IAAa1mJ,GAEbjc,IAAS2iK,IAAW,UAAUmI,GAAU,EAM9C,SAASA,IAAW5jL,EAAM,CACxB,OAAI4/D,GAAK,KAAK,aAAa5/D,CAAI,EACtB6jL,IAAqB7jL,CAAI,EAEzB4/D,GAAK,KAAK,WAAW5/D,EAAM,GAAG,EAC9B8jL,GAAoC9jL,CAAI,EAExC4/D,GAAK,KAAK,WAAW5/D,EAAM,GAAG,EAC9B+jL,GAAW/jL,CAAI,EAGf4/D,GAAK,OAAO,SAAS5/D,CAAI,CAEpC,CAKA,SAAS+jL,GAAY/jL,EAAM,CAGzB,GAAI,CAAC4/D,GAAK,KAAK,WAAW5/D,EAAM,GAAG,EACjC,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAGlC,MAAMuV,EAAOqqD,GAAK,KAAK,cAAc5/D,EAAK,KAAK,CAAC,CAAC,EACzCA,EAAK,KAAK,CAAC,EAAE,QACbA,EAAK,KAAK,CAAC,EAEbgW,EAAW4pD,GAAK,KAAK,cAAc5/D,EAAK,KAAK,CAAC,CAAC,EAC7CA,EAAK,KAAK,CAAC,EAAE,QACbA,EAAK,KAAK,CAAC,EAEbmzK,EAAgB,WAAWn9J,EAAS,KAAK,EAO/C,GAJI,EAAE,OAAO,UAAUm9J,CAAa,GAAKA,EAAgB,IAIrD,CAACvzG,GAAK,KAAK,WAAWrqD,EAAM,SAAS,GAAK,EAAEqqD,GAAK,KAAK,WAAWrqD,EAAM,GAAG,GAAKqqD,GAAK,KAAK,WAAWrqD,EAAM,GAAG,GAAKqqD,GAAK,KAAK,WAAWrqD,EAAM,GAAG,GAClJ,OAAOqqD,GAAK,OAAO,SAAS5/D,CAAI,EAIlC,MAAMgkL,EAAepkH,GAAK,KAAK,WAAWrqD,EAAM,SAAS,EACjDA,EACAvV,EAAK,KAAK,CAAC,EACnB,IAAIikL,EACJ,MAAM9V,EAAW,CAAA,EACjB,IAAIqF,EAGJ,GAAI5zG,GAAK,KAAK,WAAWrqD,EAAM,SAAS,EACtC,OAAA0uK,EAAerkH,GAAK,QAAQ,SAAS,IAAK,MAAM,WAAW5pD,EAAS,KAAK,CAAC,EAAE,KAAKguK,CAAY,CAAC,EACvFpkH,GAAK,OAAO,YACjBvjE,GAAY,gBAAiB2D,EAAMikL,EAAc,EAAK,EACnD,GAAIrkH,GAAK,KAAK,WAAWrqD,EAAM,GAAG,EAAG,CAE1C,OAASqqD,GAAK,QAAQ,SAAS,IAAI,CAACrqD,EAAK,KAAK,CAAC,EAAES,CAAQ,CAAC,EAC1D,OAAS4pD,GAAK,QAAQ,SAAS,IAAI,CAACrqD,EAAK,KAAK,CAAC,EAAES,CAAQ,CAAC,EAC1D,cAAgB4pD,GAAK,QAAQ,SAAS,IAAI,CAAEA,GAAK,QAAQ,SAAS,CAAC,EAAEA,GAAK,QAAQ,SAAS,IAAIrqD,EAAK,IAAI,CAAC,CAAC,EAC1G0uK,EAAerkH,GAAK,QAAQ,SAAS,IAAI,CAAC,OAAO,cAAc,MAAM,CAAC,EACtE4zG,EAAS5zG,GAAK,OAAO,YACnBvjE,GAAY,gBAAiB2D,EAAMikL,EAAc,EAAK,EACxD9V,EAAS,KAAKqF,CAAM,EACpB,QAAU5zG,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EACtD,MAAMhF,EAActrF,GAAS,OAAO,EAMpC,OALIsrF,EAAY,eACdgF,EAAS5zG,GAAK,OAAO,aAAa,QAAS4uG,CAAW,EACtDL,EAAS,KAAKqF,CAAM,EACpB,QAAU5zG,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,GAEpDrF,EAAS,SAAW,EACfA,EAAS,CAAC,EAEZvuG,GAAK,OAAO,YACjBvjE,GAAY,WAAY2D,EAAM,QAAS,GAAOmuK,CAAQ,CAC5D,SAAavuG,GAAK,KAAK,WAAWrqD,EAAM,GAAG,EAAG,CAE1C,QAAS5Y,EAAE,EAAEA,EAAE4Y,EAAK,KAAK,OAAO5Y,IAC9B4Y,EAAK,KAAK5Y,CAAC,EAAIijE,GAAK,QAAQ,SAAS,IAAI,CAACrqD,EAAK,KAAK5Y,CAAC,EAAEqZ,CAAQ,CAAC,EAElE,OAAO4pD,GAAK,OAAO,YACjBvjE,GAAY,gBAAiB2D,EAAMuV,EAAM,EAAK,CACpD,SAAaqqD,GAAK,KAAK,WAAWrqD,EAAM,GAAG,EAAG,CAC1C,QAAS5Y,EAAE,EAAEA,EAAE,EAAEA,IACf4Y,EAAK,KAAK5Y,CAAC,EAAIijE,GAAK,QAAQ,SAAS,IAAI,CAACrqD,EAAK,KAAK5Y,CAAC,EAAEqZ,CAAQ,CAAC,EAElE,OAAO4pD,GAAK,OAAO,YACjBvjE,GAAY,gBAAiB2D,EAAMuV,EAAM,EAAK,CACjD,CACH,CAMA,SAASsuK,IAAqB7jL,EAAM,CAClC,GAAI,CAAC4/D,GAAK,KAAK,aAAa5/D,CAAI,EAC9B,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAElC,MAAMkkL,EAAelkL,EAAK,KAAK,CAAC,EAChC,GAAI,CAAC4/D,GAAK,KAAK,cAAcskH,CAAY,EACvC,OAAOtkH,GAAK,OAAO,SAAS5/D,CAAI,EAElC,MAAMkrE,EAAUg5G,EAAa,QAC7B,GAAI,CAACtkH,GAAK,KAAK,WAAWsL,CAAO,EAC/B,OAAOtL,GAAK,OAAO,SAAS5/D,CAAI,EAElC,MAAM6mH,EAAa37C,EAAQ,YAK3B,GAJAlrE,EAAK,YAAc,EAIfkrE,EAAQ,KAAO,KAAOA,EAAQ,KAAO,IAAK,CAC5C27C,EAAW,KAAK,CAAC,EAAI2lD,GAAS,OAAO3lD,EAAW,KAAK,CAAC,CAAC,EACvDA,EAAW,KAAK,CAAC,EAAE,YAAc,EACjC,MAAMH,EAAU9mD,GAAK,QAAQ,YAAYinD,CAAU,EACnD,OAAOjnD,GAAK,OAAO,YACjBvjE,GAAY,wBAAyB2D,EAAM0mH,EAAS,EAAK,CAC5D,SACQx7C,EAAQ,KAAO,IAAK,CAK3B,MAAM07C,EAAUC,EAAW,KAAK,IAAI/5G,GAAO,CACzC,MAAMq3K,EAAS3X,GAAS,OAAO1/J,CAAG,EAClC,OAAAq3K,EAAO,YAAc,EACdA,CACb,CAAK,EACDt9D,EAAW,KAAOD,EAClB,MAAMF,EAAU9mD,GAAK,QAAQ,YAAYinD,CAAU,EACnD,OAAOjnD,GAAK,OAAO,YACjBvjE,GAAY,wBAAyB2D,EAAM0mH,EAAS,EAAK,CAC5D,KAEC,QAAO9mD,GAAK,OAAO,SAAS5/D,CAAI,CAEpC,CAOA,SAAS8jL,GAAoC9jL,EAAM,CACjD,GAAI,CAAC4/D,GAAK,KAAK,WAAW5/D,CAAI,GAAKA,EAAK,KAAO,IAC7C,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAOlC,QAASrD,EAAI,EAAGA,EAAE,EAAIqD,EAAK,KAAK,OAAQrD,IAAK,CAC3C,GAAI,CAACynL,GAAwBpkL,EAAK,KAAKrD,CAAC,CAAC,GACrC,CAACynL,GAAwBpkL,EAAK,KAAKrD,EAAE,CAAC,CAAC,EACzC,SAEF,IAAI+pH,EAAU1mH,EAAK,YACnB,MAAMmuK,EAAW,CAAA,EACjB,IAAIqF,EAEJ,MAAM6Q,EAAeC,IAAmB59D,EAAQ,KAAK/pH,CAAC,EAAG+pH,EAAQ,KAAK/pH,EAAE,CAAC,CAAC,EAsB1E,GArBAqD,EAAK,KAAKrD,CAAC,EAAE,YAAc,EAC3BqD,EAAK,KAAKrD,EAAE,CAAC,EAAE,YAAc,EAC7B0nL,EAAa,YAAc,EAEvB39D,EAAQ,KAAK,OAAS,GACxBA,EAAQ,KAAK,OAAO/pH,EAAG,EAAG0nL,CAAY,EACtC39D,EAAQ,KAAK/pH,CAAC,EAAE,YAAc,IAG9B+pH,EAAU29D,EACV39D,EAAQ,YAAc,GAGxB8sD,EAAS5zG,GAAK,OAAO,YACnBvjE,GAAY,WAAY2D,EAAM0mH,EAAS,EAAK,EAC9CynD,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAKlD5zG,GAAK,KAAK,WAAW8mD,EAAS,GAAG,EAAG,CACtC,MAAM8nD,EAAc+V,GAAmB79D,EAAQ,KAAK/pH,CAAC,CAAC,EAClD6xK,EAAY,eACdgF,EAAS5zG,GAAK,OAAO,aAAa8mD,EAAS8nD,EAAa7xK,CAAC,EACzDwxK,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,EAEzD,SAIQ5zG,GAAK,KAAK,cAAc8mD,CAAO,EACtC8sD,EAAS+Q,GAAmB79D,CAAO,EAC/B8sD,EAAO,eACTrF,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,OAIxD,OAAM,MAAM,2CAA6CxzK,CAAI,EAG/D,OAAImuK,EAAS,SAAW,EACfA,EAAS,CAAC,EAGZvuG,GAAK,OAAO,YACjBvjE,GAAY,WAAY2D,EAAM0mH,EAAS,GAAOynD,CAAQ,CACzD,CACD,OAAOvuG,GAAK,OAAO,SAAS5/D,CAAI,CAClC,CAMA,SAASskL,IAAmBE,EAAWC,EAAY,CAEjD,IAAIC,EAAWC,EACXP,GAAwBI,CAAS,EACnCE,EAAYF,EAAU,QAAQ,KAG9BE,EAAY,CAACF,CAAS,EAGpBJ,GAAwBK,CAAU,EACpCE,EAAaF,EAAW,QAAQ,KAGhCE,EAAa,CAACF,CAAU,EAG1B,MAAM79D,EAAU,CAAA,EAIhB,GAAI,CAAC89D,EAAWC,CAAU,EAAE,OAAOC,EAAW,EAAE,SAAW,EAAG,CAC5D,MAAMC,EAAuBD,GAAYF,CAAS,EAC5CI,EAAgBD,EAAuBH,EAAYC,EACnDI,EAAkBF,EAAuBJ,EAAaD,EAC5DM,EAAc,QAAS9kL,GAAS,CAC9B,IAAI8M,EACJ,GAAI7O,GAAW+B,CAAI,EAAG,CACpB,IAAIosB,EAAYwzC,GAAK,QAAQ,SAAS,IAAK,CAAC5/D,EAAK,KAAK,CAAC,EAAG+kL,CAAe,CAAC,EAC1E34J,EAAYwzC,GAAK,QAAQ,YAAYxzC,CAAS,EAC9Ctf,EAAM8yD,GAAK,QAAQ,SAAS,IAAK,CAACxzC,EAAWpsB,EAAK,KAAK,CAAC,CAAC,CAAC,CAC3D,MAEC8M,EAAM8yD,GAAK,QAAQ,SAAS,IAAK,CAAC5/D,EAAM+kL,CAAe,CAAC,EAE1Dj4K,EAAI,YAAc,EAClB85G,EAAQ,KAAK95G,CAAG,CACtB,CAAK,CACF,MAGQ43K,EAAU,OAAS,GAAKC,EAAW,OAAS,EACnDD,EAAU,QAAQxgH,GAAW,CAC3B,MAAMp3D,EAAM8yD,GAAK,QAAQ,SAAS,IAAK,CAACsE,EAASugH,CAAU,CAAC,EAC5D33K,EAAI,YAAc,EAClB85G,EAAQ,KAAK95G,CAAG,CACtB,CAAK,EAID43K,EAAU,QAAQxgH,GAAW,CAC3BygH,EAAW,QAAQK,GAAY,CAC7B,MAAMl4K,EAAM8yD,GAAK,QAAQ,SAAS,IAAK,CAACsE,EAAS8gH,CAAQ,CAAC,EAC1Dl4K,EAAI,YAAc,EAClB85G,EAAQ,KAAK95G,CAAG,CACxB,CAAO,CACP,CAAK,EAEH,OAAO8yD,GAAK,QAAQ,YAAYA,GAAK,QAAQ,SAAS,IAAKgnD,CAAO,CAAC,CACrE,CAEA,SAASg+D,GAAYz7K,EAAM,CACzB,OAAOA,EAAK,OAAOlL,EAAU,EAAE,OAAS,CAC1C,CAEA,SAASA,GAAW+B,EAAM,CACxB,OAAO4/D,GAAK,KAAK,WAAW5/D,EAAM,GAAG,CACvC,CAQA,SAASukL,GAAmBvkL,EAAM,CAChC,GAAI,CAAC4/D,GAAK,KAAK,cAAc5/D,CAAI,EAC/B,MAAM,MAAM,YAAcA,EAAO,2BAA2B,EAG9D,MAAMwzK,EAAStwF,GAASljF,EAAK,OAAO,EACpC,OAAIwzK,EAAO,aACF5zG,GAAK,OAAO,aAAa5/D,EAAMwzK,CAAM,EAGrC5zG,GAAK,OAAO,SAAS5/D,CAAI,CAEpC,CAMA,SAASkjF,GAASljF,EAAM,CACtB,MAAMmuK,EAAW,CAAA,EACX8W,EAAoB,CACxBlJ,IACAS,IACAmH,IACAG,GACAC,EACJ,EAEE,IAAIr9D,EAAU1mH,EAAK,YACnB,QAASrD,EAAI,EAAGA,EAAI+pH,EAAQ,KAAK,OAAQ/pH,IACvC,QAAS2oB,EAAI,EAAGA,EAAI2/J,EAAkB,OAAQ3/J,IAAK,CACjD,MAAMkpJ,EAAcyW,EAAkB3/J,CAAC,EAAEohG,EAAQ,KAAK/pH,CAAC,CAAC,EACxD,GAAI6xK,EAAY,aAAc,CAC5B,MAAMgF,EAAS5zG,GAAK,OAAO,aAAa8mD,EAAS8nD,EAAa7xK,CAAC,EAC/DwxK,EAAS,KAAKqF,CAAM,EACpB9sD,EAAU9mD,GAAK,OAAO,kBAAkB4zG,EAAO,OAAO,CACvD,CACF,CAIH,OAAIrF,EAAS,SAAW,EACfvuG,GAAK,OAAO,SAAS5/D,CAAI,EAGzB4/D,GAAK,OAAO,YACjBvjE,GAAY,eAAgB2D,EAAM0mH,EAAS,GAAOynD,CAAQ,CAEhE,CAGA,SAASiW,GAAwBpkL,EAAM,CACrC,GAAI,CAAC4/D,GAAK,KAAK,cAAc5/D,CAAI,EAC/B,MAAO,GAET,MAAMkrE,EAAUlrE,EAAK,QACrB,OAAO4/D,GAAK,KAAK,WAAWsL,EAAS,GAAG,CAC1C,CAEA,IAAAg6G,IAAiBpsK,ICpXjB,MAAMzc,GAAca,GACd0iE,GAAO//D,GACP47K,IAAar6K,GAIb0X,IAAS2iK,IAAW,SAAS0J,GAAQ,EAE3C,SAASA,IAASnlL,EAAM,CACtB,GAAI,CAAC4/D,GAAK,KAAK,WAAW5/D,CAAI,GAAKA,EAAK,KAAO,IAC7C,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAGlC,IAAIk1K,EAAckQ,IAAkBplL,CAAI,EAMxC,OALIk1K,EAAW,eAIfA,EAAamQ,IAAsBrlL,CAAI,EACnCk1K,EAAW,cACNA,EAEFt1G,GAAK,OAAO,SAAS5/D,CAAI,CAClC,CAKA,SAASolL,IAAkBplL,EAAM,CAC/B,IAAIwnB,EAAcxnB,EAAK,KAAK,CAAC,EAI7B,GAHI4/D,GAAK,KAAK,cAAcp4C,CAAW,IACrCA,EAAcA,EAAY,SAExB,CAACo4C,GAAK,KAAK,WAAWp4C,CAAW,GAAKA,EAAY,KAAO,IAC3D,OAAOo4C,GAAK,OAAO,SAAS5/D,CAAI,EAIlC,MAAMslL,EAAmB99J,EAAY,KAAK,CAAC,EACrC+9J,EAAqB/9J,EAAY,KAAK,CAAC,EACvCg+J,EAAkB5lH,GAAK,QAAQ,SACnC,IAAK,CAAC0lH,EAAkBC,CAAkB,CAAC,EAEvC7+D,EAAU9mD,GAAK,QAAQ,SAAS,IAAK,CAAC5/D,EAAK,KAAK,CAAC,EAAGwlL,CAAe,CAAC,EAC1E,OAAO5lH,GAAK,OAAO,YACjBvjE,GAAY,oBAAqB2D,EAAM0mH,CAAO,CAClD,CAKA,SAAS2+D,IAAsBrlL,EAAM,CAEnC,MAAMylL,EAAkBC,IAAmB1lL,CAAI,EAE/C,GAAIylL,EAAgB,OAAS,EAAG,CAC9B,MAAMr5J,EAAYq5J,EAAgB,QAG5Bj+J,EAAco4C,GAAK,QAAQ,YAC/BA,GAAK,QAAQ,SAAS,IAAK6lH,CAAe,CAAC,EACvC/+D,EAAU9mD,GAAK,QAAQ,SAAS,IAAK,CAACxzC,EAAW5E,CAAW,CAAC,EACnE,OAAOo4C,GAAK,OAAO,YACjBvjE,GAAY,kBAAmB2D,EAAM0mH,CAAO,CAC/C,CACD,OAAO9mD,GAAK,OAAO,SAAS5/D,CAAI,CAClC,CAKA,SAAS0lL,IAAmBl+J,EAAa,CACvC,IAAIxnB,EAAOwnB,EACX,MAAMi+J,EAAkB,CAAA,EACxB,KAAOzlL,EAAK,KAAO,KAGjBylL,EAAgB,QAAQzlL,EAAK,KAAK,CAAC,CAAC,EACpCA,EAAOA,EAAK,KAAK,CAAC,EAGpB,OAAAylL,EAAgB,QAAQzlL,CAAI,EACrBylL,CACT,CAEA,IAAAE,IAAiB7sK,ICrFjB,MAAM6lK,GAAczhL,GACduoD,GAAQ5lD,GAERxD,GAAc+E,GACdorK,GAAW3oK,GACX+7D,GAAOhnD,GAGb,MAAMgtK,EAAgB,CACpB,YAAYx5J,EAAW5E,EAAaq+J,EAAW,GAAO,CACpD,KAAK,UAAYz5J,EACjB,KAAK,YAAc5E,EACnB,KAAK,WAAaq+J,CACnB,CACH,CAKA,SAASC,IAAgB9lL,EAAM,CAC7B,GAAI,CAAC4/D,GAAK,KAAK,WAAW5/D,CAAI,GAAKA,EAAK,KAAO,IAC7C,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAGlC,IAAI0mH,EAAU1mH,EAAK,YACnB,MAAMosB,EAAYs6F,EAAQ,KAAK,CAAC,EAC1Bl/F,EAAck/F,EAAQ,KAAK,CAAC,EAGlC,GAAI,CAACq/D,GAAwB35J,CAAS,GAClC,CAAC25J,GAAwBv+J,CAAW,EAAG,CACzC,MAAMw+J,EAAeC,GAAY75J,EAAW5E,CAAW,EAEvD,OAAIw+J,EAAa,YACft/D,EAAQ,KAAK,CAAC,EAAIs/D,EAAa,WAAapmH,GAAK,QAAQ,SAAS,CAAC,EAC/DomH,EAAa,YACft/D,EAAQ,KAAK,CAAC,EAAIs/D,EAAa,YAK/Bt/D,EAAUA,EAAQ,KAAK,CAAC,EAEnB9mD,GAAK,OAAO,YACjBvjE,GAAY,aAAc2D,EAAM0mH,CAAO,GAGlC9mD,GAAK,OAAO,SAAS5/D,CAAI,CAEnC,SAMQ+lL,GAAwB35J,CAAS,GACjC,CAAC25J,GAAwBv+J,CAAW,EAAG,CAC9C,MAAMo4J,EAAgBhgH,GAAK,KAAK,cAAcxzC,CAAS,EACjDA,EAAU,QAAQ,KAAOA,EAAU,KACzC,QAAS,EAAI,EAAG,EAAIwzJ,EAAc,OAAQ,IAAK,CAC7C,MAAMoG,EAAeC,GAAYrG,EAAc,CAAC,EAAGp4J,CAAW,EAC9D,GAAIw+J,EAAa,WACf,OAAIA,EAAa,UACfpG,EAAc,CAAC,EAAIoG,EAAa,WAKhCpG,EAAc,OAAO,EAAG,CAAC,EAGrBA,EAAc,SAAW,IAC3Bl5D,EAAQ,KAAK,CAAC,EAAIk5D,EAAc,CAAC,IAGjCoG,EAAa,YACft/D,EAAQ,KAAK,CAAC,EAAIs/D,EAAa,YAK/Bt/D,EAAUA,EAAQ,KAAK,CAAC,EAEnB9mD,GAAK,OAAO,YACjBvjE,GAAY,aAAc2D,EAAM0mH,CAAO,CAE5C,CACD,OAAO9mD,GAAK,OAAO,SAAS5/D,CAAI,CACjC,SAKQ+lL,GAAwBv+J,CAAW,GAChC,CAACu+J,GAAwB35J,CAAS,EAAG,CAC/C,MAAMk2J,EAAkB1iH,GAAK,KAAK,cAAcp4C,CAAW,EACzDA,EAAY,QAAQ,KAAOA,EAAY,KACzC,QAAS,EAAI,EAAG,EAAI86J,EAAgB,OAAQ,IAAK,CAC/C,MAAM0D,EAAeC,GAAY75J,EAAWk2J,EAAgB,CAAC,CAAC,EAC9D,GAAI0D,EAAa,WACf,OAAAt/D,EAAQ,KAAK,CAAC,EAAIs/D,EAAa,WAAapmH,GAAK,QAAQ,SAAS,CAAC,EAC/DomH,EAAa,YACf1D,EAAgB,CAAC,EAAI0D,EAAa,aAKlC1D,EAAgB,OAAO,EAAG,CAAC,EAGvBA,EAAgB,SAAW,IAC7B57D,EAAQ,KAAK,CAAC,EAAI47D,EAAgB,CAAC,IAGhC1iH,GAAK,OAAO,YACjBvjE,GAAY,aAAc2D,EAAM0mH,CAAO,CAE5C,CACD,OAAO9mD,GAAK,OAAO,SAAS5/D,CAAI,CACjC,KAGI,CACH,MAAM4/K,EAAgBhgH,GAAK,KAAK,cAAcxzC,CAAS,EACrDA,EAAU,QAAQ,KAAOA,EAAU,KAC/Bk2J,EAAkB1iH,GAAK,KAAK,cAAcp4C,CAAW,EACzDA,EAAY,QAAQ,KAAOA,EAAY,KACzC,QAAS7qB,EAAI,EAAGA,EAAIijL,EAAc,OAAQjjL,IACxC,QAAS2oB,EAAI,EAAGA,EAAIg9J,EAAgB,OAAQh9J,IAAK,CAC/C,MAAM0gK,EAAeC,GAAYrG,EAAcjjL,CAAC,EAAG2lL,EAAgBh9J,CAAC,CAAC,EACrE,GAAI0gK,EAAa,WACf,OAAIA,EAAa,UACfpG,EAAcjjL,CAAC,EAAIqpL,EAAa,WAKhCpG,EAAc,OAAOjjL,EAAG,CAAC,EAGrBijL,EAAc,SAAW,IAC3Bl5D,EAAQ,KAAK,CAAC,EAAIk5D,EAAc,CAAC,IAGjCoG,EAAa,YACf1D,EAAgBh9J,CAAC,EAAI0gK,EAAa,aAKlC1D,EAAgB,OAAOh9J,EAAG,CAAC,EAGvBg9J,EAAgB,SAAW,IAC7B57D,EAAQ,KAAK,CAAC,EAAI47D,EAAgB,CAAC,IAGhC1iH,GAAK,OAAO,YACjBvjE,GAAY,aAAc2D,EAAM0mH,CAAO,CAE5C,CAEH,OAAO9mD,GAAK,OAAO,SAAS5/D,CAAI,CACjC,CACH,CAQA,SAASimL,GAAY75J,EAAW5E,EAAa,CAE3C,GAAIo4C,GAAK,KAAK,aAAaxzC,CAAS,EAAG,CACrC,MAAM45J,EAAeC,GAAY75J,EAAU,KAAK,CAAC,EAAG5E,CAAW,EAC/D,OAAKw+J,EAAa,UAGTxZ,GAAS,WAAWwZ,EAAa,SAAS,EACjD55J,EAAYogJ,GAAS,OAAOwZ,EAAa,SAAS,EAGlD55J,EAAU,KAAK,CAAC,EAAI45J,EAAa,UANjC55J,EAAYwzC,GAAK,QAAQ,SAAS,EAAE,EAQtCp4C,EAAcy+J,GAAY,YACnB,IAAIL,GAAgBx5J,EAAW5E,EAAaw+J,EAAa,UAAU,CAC3E,CACD,GAAIpmH,GAAK,KAAK,aAAap4C,CAAW,EAAG,CACvC,MAAMw+J,EAAeC,GAAY75J,EAAW5E,EAAY,KAAK,CAAC,CAAC,EAC/D,OAAA4E,EAAY45J,EAAa,UACrBA,EAAa,YACfx+J,EAAY,KAAK,CAAC,EAAIw+J,EAAa,aAGnCx+J,EAAcw+J,EAAa,YACvB55J,EACFA,EAAYogJ,GAAS,OAAOpgJ,CAAS,EAGrCA,EAAYwzC,GAAK,QAAQ,SAAS,EAAE,GAGjC,IAAIgmH,GAAgBx5J,EAAW5E,EAAaw+J,EAAa,UAAU,CAC3E,CAGD,GAAIpmH,GAAK,KAAK,cAAcxzC,CAAS,EAAG,CACtC,MAAM45J,EAAeC,GAAY75J,EAAU,QAAS5E,CAAW,EAC/D,OAAIw+J,EAAa,UACf55J,EAAU,QAAU45J,EAAa,UAKjC55J,EAAY45J,EAAa,UAE3Bx+J,EAAcw+J,EAAa,YACpB,IAAIJ,GAAgBx5J,EAAW5E,EAAaw+J,EAAa,UAAU,CAC3E,CACD,GAAIpmH,GAAK,KAAK,cAAcp4C,CAAW,EAAG,CACxC,MAAMw+J,EAAeC,GAAY75J,EAAW5E,EAAY,OAAO,EAC/D,OAAIw+J,EAAa,YACfx+J,EAAY,QAAUw+J,EAAa,YAKnCx+J,EAAcw+J,EAAa,YAE7B55J,EAAY45J,EAAa,UAClB,IAAIJ,GAAgBx5J,EAAW5E,EAAaw+J,EAAa,UAAU,CAC3E,CAMD,GAAIvgI,GAAM,MAAMr5B,CAAS,IAAMq5B,GAAM,MAAMj+B,CAAW,EACpD,OAAO,IAAIo+J,GAAgB,KAAM,KAAM,EAAI,EAI7C,GAAIhmH,GAAK,KAAK,WAAWxzC,EAAW,GAAG,GACnCwzC,GAAK,KAAK,WAAWp4C,EAAa,GAAG,GACrCi+B,GAAM,MAAMr5B,EAAU,KAAK,CAAC,CAAC,IAAMq5B,GAAM,MAAMj+B,EAAY,KAAK,CAAC,CAAC,EAAG,CACvE,MAAM0+J,EAAoB95J,EAAU,KAAK,CAAC,EAC1C,IAAI+5J,EAAuB3+J,EAAY,KAAK,CAAC,EAI7C2+J,EAAsBvmH,GAAK,QAAQ,YAAYumH,CAAmB,EAClE,MAAMhD,EAAcvjH,GAAK,QAAQ,YAC/BA,GAAK,QAAQ,SAAS,IAAK,CAACsmH,EAAmBC,CAAmB,CAAC,CAAC,EACtE,OAAA/5J,EAAU,KAAK,CAAC,EAAI+2J,EACb,IAAIyC,GAAgBx5J,EAAW,KAAM,EAAI,CACjD,CAQD,GAAIwzC,GAAK,eAAe,iBAAiBxzC,CAAS,GAC9CwzC,GAAK,eAAe,iBAAiBp4C,CAAW,EAAG,CACrD,MAAM4+J,EAAgB,IAAIxmH,GAAK,eAAexzC,CAAS,EACjDi6J,EAAkB,IAAIzmH,GAAK,eAAep4C,CAAW,EAC3D,GAAI4+J,EAAc,cAAa,IAAOC,EAAgB,cAAa,EACjE,OAAIzmH,GAAK,KAAK,WAAWxzC,EAAW,GAAG,GAAKwzC,GAAK,KAAK,WAAWp4C,EAAa,GAAG,EAExE8+J,IAAal6J,EAAW5E,CAAW,EAGnC,IAAIo+J,GAAgBx5J,EAAW5E,CAAW,EAGrD,MAAM0+J,EAAoBE,EAAc,gBAAgB,EAAI,EAC5D,IAAID,EAAuBE,EAAgB,gBAAgB,EAAI,EAC/D,GAAI5gI,GAAM,MAAMygI,CAAiB,IAAMzgI,GAAM,MAAM0gI,CAAmB,EAEpE/5J,EAAYg6J,EAAc,mBAEvB,CAIHD,EAAsBvmH,GAAK,QAAQ,YAAYumH,CAAmB,EAClE,MAAMhD,EAAcvjH,GAAK,QAAQ,YAC/BA,GAAK,QAAQ,SAAS,IAAK,CAACsmH,EAAmBC,CAAmB,CAAC,CAAC,EACtE/5J,EAAYwzC,GAAK,QAAQ,eACvBwmH,EAAc,cAAe,EAC7BjD,EACAiD,EAAc,aAAY,CAAE,CAC/B,CACD,OAAA5+J,EAAc6+J,EAAgB,eACvB,IAAIT,GAAgBx5J,EAAW5E,EAAa,EAAI,CACxD,CAMD,GAAIo4C,GAAK,KAAK,WAAWxzC,CAAS,GAC3BwzC,GAAK,KAAK,WAAWp4C,EAAa,GAAG,GACrCo4C,GAAK,eAAe,iBAAiBp4C,CAAW,EAAG,CACxD,MAAM6+J,EAAkB,IAAIzmH,GAAK,eAAep4C,CAAW,EAErDwjJ,EAAQqb,EAAgB,eACxBn6D,EAAWm6D,EAAgB,gBAC3BrwK,EAAWqwK,EAAgB,kBAG3BE,EAAO3mH,GAAK,QAAQ,SAAS,IAAK,CAACxzC,EAAW4+I,CAAK,CAAC,EAE1D,IAAI4B,EAAW5B,EAAM,YACrB,MAAMwb,EAAe7H,GAAY4H,CAAI,EAErC,OAAKC,EAAa,cAMd5mH,GAAK,KAAK,WAAW4mH,EAAa,OAAO,GAC3Cp6J,EAAYo6J,EAAa,QACzB5Z,EAAW,MAGX,CAACxgJ,EAAWwgJ,CAAQ,EAAI4Z,EAAa,QAAQ,KAE/Ch/J,EAAco4C,GAAK,QAAQ,eAAessD,EAAUl2G,EAAU42J,CAAQ,EAE/D,IAAIgZ,GAAgBx5J,EAAW5E,EAAa,EAAI,GAd9C,IAAIo+J,GAAgBx5J,EAAW5E,EAAa,EAAK,CAe3D,CAID,GAAIo4C,GAAK,KAAK,WAAWxzC,CAAS,GAAKwzC,GAAK,KAAK,WAAWp4C,CAAW,EAAG,CACxE,MAAM++J,EAAO3mH,GAAK,QAAQ,SAAS,IAAK,CAACxzC,EAAW5E,CAAW,CAAC,EAC1Dg/J,EAAe7H,GAAY4H,CAAI,EACrC,OAAKC,EAAa,aAGd5mH,GAAK,KAAK,WAAW4mH,EAAa,OAAO,EAEpC,IAAIZ,GAAgBY,EAAa,QAAS,KAAM,EAAI,GAKzD5mH,GAAK,KAAK,WAAW4mH,EAAa,OAAO,GAC3Cp6J,EAAYo6J,EAAa,QACzBh/J,EAAc,MAGd,CAAC4E,EAAW5E,CAAW,EAAIg/J,EAAa,QAAQ,KAG3C,IAAIZ,GAAgBx5J,EAAW5E,EAAa,EAAI,GAjB9C,IAAIo+J,GAAgBx5J,EAAW5E,EAAa,EAAK,CAkB3D,CAED,OAAO,IAAIo+J,GAAgBx5J,EAAW5E,CAAW,CACnD,CAOA,SAASu+J,GAAwB/lL,EAAM,CACrC,OAAI4/D,GAAK,KAAK,cAAc5/D,CAAI,EACvB+lL,GAAwB/lL,EAAK,OAAO,EAErC4/D,GAAK,KAAK,WAAW5/D,EAAM,GAAG,GAC9B,CAAC4/D,GAAK,eAAe,iBAAiB5/D,CAAI,CACpD,CAEA,SAASsmL,IAAal6J,EAAW5E,EAAY,CAC3C,MAAM6+J,EAAkB,IAAIzmH,GAAK,eAAep4C,CAAW,EACrD4+J,EAAgB,IAAIxmH,GAAK,eAAexzC,CAAS,EAEjDq6J,EAAmBJ,EAAgB,eACnCK,EAAsBL,EAAgB,gBACtCF,EAAsBE,EAAgB,kBAEtCM,EAAiBP,EAAc,eAC/BQ,EAAoBR,EAAc,gBAClCF,EAAoBE,EAAc,kBAGlCG,EAAO3mH,GAAK,QAAQ,SAAS,IAAK,CAAC+mH,EAAgBF,CAAgB,CAAC,EAEpED,EAAe7H,GAAY4H,CAAI,EAErC,GAAI,CAACC,EAAa,aAChB,OAAO,IAAIZ,GAAgBx5J,EAAW5E,EAAa,EAAK,EAK1D,IAAIq/J,EAAsB,KACtB1Z,EAAe,KACfvtG,GAAK,KAAK,WAAW4mH,EAAa,OAAO,GAC3CrZ,EAAevtG,GAAK,QAAQ,eAAegnH,EAAmBV,EAAmBM,EAAa,OAAO,EACrGK,EAAsB,OAGtB1Z,EAAevtG,GAAK,QAAQ,eAAegnH,EAAmBV,EAAmBM,EAAa,QAAQ,KAAK,CAAC,CAAC,EAC7GK,EAAsBL,EAAa,QAAQ,KAAK,CAAC,GAEnD,MAAMlK,EAAiB18G,GAAK,QAAQ,eAAe8mH,EAAqBP,EAAqBU,CAAmB,EAEhH,OAAO,IAAIjB,GAAgBzY,EAAcmP,EAAgB,EAAI,CAC/D,CAEA,IAAAwK,IAAiBhB,IChajB,MAAMzpL,GAAca,GACdsvK,GAAW3sK,GACX+/D,GAAOx+D,GAQb,SAAS2lL,IAAc7gJ,EAAU,CAC/B,GAAI,CAAC05B,GAAK,KAAK,WAAW15B,CAAQ,GAAKA,EAAS,KAAO,IACrD,OAAO05B,GAAK,OAAO,SAAS15B,CAAQ,EAEtC,MAAM8gJ,EAAc9gJ,EAAS,YAC7B,IAAI9Z,EAAY8Z,EAAS,KAAK,CAAC,EAC3B1e,EAAc0e,EAAS,KAAK,CAAC,EAEjC,GAAIsmI,GAAS,WAAWhlJ,CAAW,EAAG,CACpCA,EAAcglJ,GAAS,OAAOhlJ,CAAW,EACzC,MAAMymJ,EAAazB,GAAS,WAAWpgJ,CAAS,EAC9C/vB,GAAY,eACZA,GAAY,eACd+vB,EAAYogJ,GAAS,OAAOpgJ,CAAS,EACrC,MAAMoD,EAAcowC,GAAK,QAAQ,SAAS,IAAK,CAACxzC,EAAW5E,CAAW,CAAC,EACvE,OAAOo4C,GAAK,OAAO,YAAYquG,EAAY+Y,EAAax3J,CAAW,CACpE,KAEC,QAAOowC,GAAK,OAAO,SAAS15B,CAAQ,CAExC,CAEA,IAAA+gJ,IAAiBF,IChCjB,MAAMhL,IAAmB7+K,GACnByhL,IAAc9+K,GACd+/D,GAAOx+D,GAOb,SAAS8lL,IAA2BlnL,EAAM,CACxC,GAAI,CAAC4/D,GAAK,eAAe,iBAAiB5/D,CAAI,EAC5C,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAGlC,MAAM0sK,EAAW,IAAI9sG,GAAK,eAAe5/D,EAAK,UAAS,CAAE,EACzD,GAAI,CAAC0sK,EAAS,mBACZ,OAAO9sG,GAAK,OAAO,SAAS5/D,CAAI,EAGlC,MAAMmnL,EAA6B,CACjCxI,IACA5C,GACJ,EAEE,QAASp/K,EAAI,EAAGA,EAAIwqL,EAA2B,OAAQxqL,IAAK,CAC1D,MAAMyqL,EAAsB1a,EAAS,eAC/B2a,EAAiBF,EAA2BxqL,CAAC,EAAEyqL,CAAmB,EACxE,GAAIC,EAAe,aAAc,CAE/B,IAAIza,EAAWhtG,GAAK,OAAO,kBAAkBynH,EAAe,OAAO,EAC/Dza,EAAS,QAAU,MACrBA,EAAW,MAEb,MAAMqG,EAAevG,EAAS,kBACxBhmD,EAAU9mD,GAAK,QAAQ,eACzB8sG,EAAS,cAAa,EAAIuG,EAAcrG,CAAQ,EACpD,OAAOhtG,GAAK,OAAO,YAAYynH,EAAe,WAAYrnL,EAAM0mH,CAAO,CACxE,CACF,CAED,OAAO9mD,GAAK,OAAO,SAAS5/D,CAAI,CAClC,CAEA,IAAAsnL,IAAiBJ,IChCjB,MAAMjH,IAAyB/iL,GACzBiiL,IAAuBt/K,GACvBimL,IAAkB1kL,IAClBu9K,IAAc96K,GACdojL,IAAwBruK,IACxBsuK,IAA6B9kK,IAE7Bw9C,IAAO7qC,GACP0mJ,IAAazmJ,GAEbqpJ,GAA2B,CAE/Bc,IAEAc,IAEAgH,IAEAtI,IAEAuI,IAEApB,GACF,EAEMhtK,IAAS2iK,IAAW,SAAS8L,GAAiB,EAGpD,SAASA,IAAkBvnL,EAAM,CAC/B,QAASrD,EAAI,EAAGA,EAAI0hL,GAAyB,OAAQ1hL,IAAK,CACxD,MAAMu4K,EAAamJ,GAAyB1hL,CAAC,EAAEqD,CAAI,EACnD,GAAIk1K,EAAW,aACb,OAAOA,EAGPl1K,EAAOk1K,EAAW,OAErB,CACD,OAAOt1G,IAAK,OAAO,SAAS5/D,CAAI,CAClC,CAGA,IAAAwnL,IAAiB1uK,ICrDjB,MAAMwnD,GAAOpjE,GAEPb,GAAcwD,GACdwgE,GAAWj/D,GACXw+D,GAAO/7D,GAIb,SAAS4jL,IAAcznL,EAAM,CAI3B,GAHI,CAAC4/D,GAAK,KAAK,WAAW5/D,EAAM,KAAK,GAGjCA,EAAK,KAAK,OAAS,EACrB,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAElC,IAAI0mH,EAAU1mH,EAAK,YACnB,MAAM0nL,EAAWhhE,EAAQ,KAAK,CAAC,EAC/B,GAAI9mD,GAAK,KAAK,WAAW8nH,EAAU,EAAI,EACrC,OAAAhhE,EAAU9mD,GAAK,QAAQ,SAASU,GAAK,IAAID,GAASqnH,CAAQ,CAAC,CAAC,EACrD9nH,GAAK,OAAO,YACjBvjE,GAAY,eAAgB2D,EAAM0mH,CAAO,EAExC,GAAI9mD,GAAK,KAAK,mBAAmB8nH,EAAU,EAAI,EAAG,CACrD,MAAMva,EAAevtG,GAAK,QAAQ,SAChCU,GAAK,IAAID,GAASqnH,EAAS,KAAK,CAAC,CAAC,CAAC,CAAC,EAChCpL,EAAkB18G,GAAK,QAAQ,SACnCU,GAAK,IAAID,GAASqnH,EAAS,KAAK,CAAC,CAAC,CAAC,CAAC,EACtC,OAAAhhE,EAAU9mD,GAAK,QAAQ,SAAS,IAAK,CAACutG,EAAcmP,CAAc,CAAC,EAC5D18G,GAAK,OAAO,YACjBvjE,GAAY,eAAgB2D,EAAM0mH,CAAO,CAC5C,KAEC,QAAO9mD,GAAK,OAAO,SAAS5/D,CAAI,CAEpC,CAEA,IAAA2nL,IAAiBF,ICpCjB,MAAMA,IAAgBvqL,IAEhB0iE,GAAO//D,GACPu1K,IAAUh0K,GACVq6K,IAAa53K,GAEb+jL,GAAY,CAChBxS,IAAQ,QACRqS,GACF,EAKM3uK,IAAS2iK,IAAW,UAAU7S,GAAS,EAG7C,SAASA,IAAU5oK,EAAM,CACvB,GAAI,CAAC4/D,GAAK,KAAK,WAAW5/D,CAAI,EAC5B,OAAO4/D,GAAK,OAAO,SAAS5/D,CAAI,EAGlC,QAASrD,EAAI,EAAGA,EAAIirL,GAAU,OAAQjrL,IAAK,CACzC,MAAMu4K,EAAa0S,GAAUjrL,CAAC,EAAEqD,CAAI,EACpC,GAAIk1K,EAAW,aACb,OAAOA,CAEV,CACD,OAAOt1G,GAAK,OAAO,SAAS5/D,CAAI,CAClC,CAEA,IAAA6nL,IAAiB/uK,IC/BjB,MAAM49J,IAASx5K,GACT0iE,IAAO//D,GACPuuK,IAAShtK,GAET26K,IAAmBl4K,GACnB06K,IAAe3lK,IACf8lK,IAAyBt8J,IACzBuhK,IAA0B5uJ,GAC1BmwJ,IAAmBlwJ,IACnB2wJ,IAAiB1wJ,IACjBuyJ,IAAkBtyJ,IAClB2yJ,IAAkBp8H,IAClB82H,IAA0B79G,GAE1BosG,GAAkBlsG,GAClBnf,GAAQ4hB,GACRyzG,GAA0B1tG,GAIhC,SAASiuG,IAAYr7K,EAAMkmH,EAAM,GAAO,CAMtC,GALIA,GAEF,QAAQ,IAAI;AAAA;AAAA,eAAsBzgE,GAAM,MAAMzlD,EAAM,GAAO,EAAI,CAAC,EAG9D02K,IAAO,oBAAoB12K,CAAI,EACjC,MAAO,GAGT,IAAIk1K,EACJ,MAAM3G,EAAQ,CAAA,EAERuZ,EAAwBriI,GAAM,MAAMzlD,CAAI,EACxC+nL,EAAiB,GACvB,IAAIC,EAAQ,EAIZ,IADA9S,EAAan0J,GAAK/gB,CAAI,EACfk1K,EAAW,cAShB,GARIhvD,GACF+hE,IAAS/S,CAAU,EAErB3G,EAAM,KAAK2Z,GAA8BhT,CAAU,CAAC,EAEpDl1K,EAAOouK,IAAO,kBAAkB8G,EAAW,OAAO,EAClDA,EAAan0J,GAAK/gB,CAAI,EAElBgoL,MAAYD,EAEd,eAAQ,MAAM,uDACAD,EAAwB,sBAAsB,EACrD,GAIX,OAAOvZ,CACT,CAIA,SAASxtJ,GAAK/gB,EAAM,CAClB,IAAIk1K,EAEJl1K,EAAO8wK,GAAgB9wK,CAAI,EAC3BA,EAAO86K,GAAwB96K,EAAM,EAAI,EAEzC,MAAMmoL,EAA6B,CAEjC5J,IAGAoH,IAEA6B,IAIA7D,IAEA5H,IAEA2C,IAEA6D,IAEA2C,IAEA2C,GACJ,EAEE,QAASlrL,EAAI,EAAGA,EAAIwrL,EAA2B,OAAQxrL,IAAK,CAM1D,GALAu4K,EAAaiT,EAA2BxrL,CAAC,EAAEqD,CAAI,EAI/CA,EAAO86K,GAAwB5F,EAAW,QAAS,EAAI,EACnDA,EAAW,aACb,OAAAl1K,EAAO8wK,GAAgB9wK,CAAI,EAC3Bk1K,EAAW,QAAUl1K,EAAK,YACnBk1K,EAGPl1K,EAAO8wK,GAAgB9wK,CAAI,CAE9B,CACD,OAAO4/D,IAAK,OAAO,SAAS5/D,CAAI,CAClC,CAIA,SAASkoL,GAA8BhT,EAAY,CACjD,OAAIA,EAAW,SAAS,OAAS,GAC/BA,EAAW,SAAS,IAAIgT,EAA6B,EAGvDhT,EAAW,QAAU4F,GAAwB5F,EAAW,QAAS,EAAI,EACrEA,EAAW,QAAU4F,GAAwB5F,EAAW,QAAS,EAAI,EAC9DA,CACT,CAEA,SAAS+S,IAAS/S,EAAY,CAE5B,QAAQ,IAAIA,EAAW,UAAU,EAEjC,QAAQ,IAAIzvH,GAAM,MAAMyvH,EAAW,OAAO,EAAI;AAAA,CAAI,EAE9CA,EAAW,SAAS,OAAS,IAE/B,QAAQ,IAAI;AAAA,WAAc,EAC1BA,EAAW,SAAS,QAAQkT,GAAWA,CAAO,EAElD,CAEA,IAAA9M,GAAiBD,ICtIjB,MAAM/6G,IAAOpjE,GACPm+K,IAAcx7K,GAEpB,SAASwoL,IAAyB7M,EAAkBt1D,EAAM,GAAO,CAC/D,IAAIoiE,EACJ,GAAI,CACFA,EAAWhoH,IAAK,MAAMk7G,CAAgB,CACvC,MACW,CACV,MAAO,EACR,CACD,OAAI8M,EACKjN,IAAYiN,EAAUpiE,CAAK,EAE7B,EACT,CAEA,IAAAqiE,IAAiBF,ICjBjB,MAAM/nH,GAAOpjE,GAEPsrL,GAAY3oL,GAIlB,IAAA4oL,GAAA,MAAMC,EAAS,CACb,YAAYC,EAAUt3G,EAAWu3G,EAAY,CAC3C,KAAK,SAAWD,EAChB,KAAK,UAAYt3G,EACjB,KAAK,WAAau3G,CACnB,CAGD,MAAM1W,EAAc,GAAO,CACzB,MAAM2W,EAAWL,GAAU,MAAM,KAAK,SAAUtW,CAAa,EACvD4W,EAAYN,GAAU,MAAM,KAAK,UAAWtW,CAAa,EACzD0W,EAAa,KAAK,WAExB,MAAO,GAAGC,CAAQ,IAAID,CAAU,IAAIE,CAAS,EAC9C,CAGD,MAAM5W,EAAc,GAAO,CACzB,MAAM2W,EAAWL,GAAU,MAAM,KAAK,SAAUtW,CAAa,EACvD4W,EAAYN,GAAU,MAAM,KAAK,UAAWtW,CAAa,EACzD0W,EAAa,KAAK,WAExB,MAAO,GAAGC,CAAQ,IAAID,CAAU,IAAIE,CAAS,EAC9C,CAED,OAAQ,CACN,MAAMC,EAAU,KAAK,SAAS,UAAS,EACjCC,EAAW,KAAK,UAAU,UAAS,EACzC,OAAO,IAAIN,GAASK,EAASC,EAAU,KAAK,UAAU,CACvD,CACH,EAIAN,GAAS,yBAA2B,SAAShmL,EAAKkmL,EAAY,CAC5D,MAAMK,EAAQvmL,EAAI,MAAMkmL,CAAU,EAClC,GAAIK,EAAM,SAAW,EACnB,MAAM,MAAM,uDACVL,CAAU,EAEd,MAAMD,EAAWroH,GAAK,MAAM2oH,EAAM,CAAC,CAAC,EAC9B53G,EAAY/Q,GAAK,MAAM2oH,EAAM,CAAC,CAAC,EAErC,OAAO,IAAIP,GAASC,EAAUt3G,EAAWu3G,CAAU,CACrD,EAEA,IAAAM,GAAiBR,GCpDjB,MAAMrsL,GAAca,GACdwrL,IAAW7oL,GACX+/D,GAAOx+D,GAMb,MAAMgtK,EAAO,CACX,YAAYH,EAAYkb,EAAaC,EAAajb,EAAS,CAAA,EAAI,CAC7D,GAAI,CAACib,EACH,MAAM,MAAM,4BAA6B,EAE3C,GAAInb,IAAe,QAAa,OAAOA,GAAgB,SACrD,MAAM,MAAM,wBAAyB,EAGvC,KAAK,WAAaA,EAClB,KAAK,YAAckb,EACnB,KAAK,YAAcC,EACnB,KAAK,SAAWjb,CACjB,CAED,YAAa,CACX,OAAO,KAAK,aAAe9xK,GAAY,SACxC,CACH,CAIA+xK,GAAO,SAAW,SAASsB,EAAU,CACnC,OAAO,IAAItB,GAAO/xK,GAAY,UAAW,KAAMqzK,CAAQ,CACzD,EAEAtB,GAAO,YAAc,SAASsB,EAAU2Z,EAAU,CAChD,MAAMlb,EAAW,CAAA,EACjBkb,EAAS,SAAS,QAAQjB,GAAW,CACnCja,EAAS,KAAKC,GAAO,YAAYsB,EAAU0Y,CAAO,CAAC,CACvD,CAAG,EACD,IAAIe,EAAc,KACdE,EAAS,UACXF,EAAczZ,EAAS,QACvByZ,EAAY,SAAWE,EAAS,SAElC,MAAMD,EAAc1Z,EAAS,QAC7B,OAAA0Z,EAAY,SAAWC,EAAS,QACzB,IAAIjb,GACTib,EAAS,WAAYF,EAAaC,EAAajb,CAAQ,CAC3D,EAEAC,GAAO,aAAe,SAASsB,EAAU4Z,EAAW,CAClD,MAAMnb,EAAW,CAAA,EACjBmb,EAAU,SAAS,QAAQlB,GAAW,CACpCja,EAAS,KAAKC,GAAO,aAAasB,EAAU0Y,CAAO,CAAC,CACxD,CAAG,EACD,IAAIe,EAAc,KACdG,EAAU,UACZH,EAAczZ,EAAS,QACvByZ,EAAY,UAAYG,EAAU,SAEpC,MAAMF,EAAc1Z,EAAS,QAC7B,OAAA0Z,EAAY,UAAYE,EAAU,QAC3B,IAAIlb,GACTkb,EAAU,WAAYH,EAAaC,EAAajb,CAAQ,CAC5D,EAEAC,GAAO,kBAAoB,SAASsB,EAAU,CAC5C,MAAMiZ,EAAW/oH,GAAK,OAAO,kBAAkB8vG,EAAS,QAAQ,EAC1Dr+F,EAAYzR,GAAK,OAAO,kBAAkB8vG,EAAS,SAAS,EAClE,OAAO,IAAIgZ,IAASC,EAAUt3G,EAAWq+F,EAAS,UAAU,CAC9D,EAEA,IAAAf,GAAiBP,GCtEjB,MAAM/xK,GAAca,GACdwrL,GAAW7oL,GACX0pL,GAAiBnoL,GACjBorK,GAAW3oK,GACX+7D,GAAOhnD,GACPi9J,GAAUzzJ,GAEVonK,GAAwB,CAC5B,IAAK,IACL,KAAM,KACN,IAAK,IACL,KAAM,KACN,IAAK,GACP,EAEMC,GAAqB,CAAA,EAK3BA,GAAmB,uBAAyB,SAAS/Z,EAAUsG,EAAY,CACzE,MAAM0T,EAAqB7T,GAAQ,kBACjCnG,EAAS,SAAUsG,CAAU,EACzB2T,EAAsB9T,GAAQ,kBAClCnG,EAAS,UAAWsG,CAAU,EAEhC,GAAI,CAAC0T,EACH,GAAIC,EAAqB,CACvB,MAAMf,EAAaY,GAAsB9Z,EAAS,UAAU,EACtDyZ,EAAczZ,EACd0Z,EAAc,IAAIV,GACtBhZ,EAAS,UAAWA,EAAS,SAAUkZ,CAAU,EAGnD,OAAO,IAAIW,GACTltL,GAAY,WAAY8sL,EAAaC,CAAW,CACnD,KAEC,OAAM,MAAM,wBAA0BpT,CAAU,EAGpD,OAAOuT,GAAe,SAAS7Z,CAAQ,CACzC,EAIA+Z,GAAmB,4BAA8B,SAAS/Z,EAAUsG,EAAY,CAG9E,GAAItG,EAAS,aAAe,IAC1B,OAAO6Z,GAAe,SAAS7Z,CAAQ,EAEzC,MAAMiZ,EAAWjZ,EAAS,SACpBloJ,EAAcquJ,GAAQ,iCAAiC8S,EAAU3S,CAAU,EACjF,OAAIxuJ,EACKoiK,GACLla,EAAU,IAAKloJ,EAAanrB,GAAY,sBAAsB,EAE3DktL,GAAe,SAAS7Z,CAAQ,CACzC,EAQA+Z,GAAmB,0BAA4B,SAAS/Z,EAAUsG,EAAY,CAC5E,MAAM3kG,EAAYq+F,EAAS,UAC3B,IAAIma,EAAahU,GAAQ,kBAAkBxkG,EAAW2kG,CAAU,EAE5D8T,EAAWC,EAAa9b,EAC5B,GAAI,CAAC4b,EACH,OAAON,GAAe,SAAS7Z,CAAQ,EAOzC,GAFAma,EAAaA,EAAW,YAEpBjqH,GAAK,eAAe,iBAAiByR,CAAS,EAC5Cm7F,GAAS,WAAWqd,CAAU,GAChCC,EAAY,IACZ7b,EAAa5xK,GAAY,kBACzB0tL,EAAcvd,GAAS,OAAOqd,CAAU,IAGxCC,EAAY,IACZ7b,EAAa5xK,GAAY,yBACzB0tL,EAAcF,WAGTjqH,GAAK,KAAK,WAAWyR,CAAS,EACrC,GAAIA,EAAU,KAAO,IACfm7F,GAAS,WAAWqd,CAAU,GAChCC,EAAY,IACZ7b,EAAa5xK,GAAY,kBACzB0tL,EAAcvd,GAAS,OAAOqd,CAAU,IAGxCC,EAAY,IACZ7b,EAAa5xK,GAAY,yBACzB0tL,EAAcF,OAOhB,OAAM,MAAM,0BAA4BA,EAAW,EAAE,UAGhDjqH,GAAK,KAAK,aAAayR,CAAS,EACvCy4G,EAAY,IACZ7b,EAAa5xK,GAAY,kBACzB0tL,EAAcF,EAAW,KAAK,CAAC,MAG/B,OAAM,MAAM,0BAA4Bx4G,EAAU,IAAI,EAExD,OAAOu4G,GACHla,EAAUoa,EAAWC,EAAa9b,CAAU,CAClD,EAKAwb,GAAmB,wBAA0B,SAAS/Z,EAAUsG,EAAY,CAC1E,IAAI2S,EAAWjZ,EAAS,SAEpB9vG,GAAK,KAAK,cAAc+oH,CAAQ,IAElCA,EAAWA,EAAS,SAGtB,IAAIqB,EAAgBnU,GAAQ,qBAAqB8S,EAAU3S,CAAU,EACjE8T,EAAWC,EAAa9b,EAE5B,GAAI,CAAC+b,EACH,OAAOT,GAAe,SAAS7Z,CAAQ,EAOzC,GAFAsa,EAAgBA,EAAc,YAE1BpqH,GAAK,KAAK,WAAW+oH,CAAQ,EAC/B,GAAIA,EAAS,KAAO,IACdnc,GAAS,WAAWwd,CAAa,GACnCF,EAAY,IACZ7b,EAAa5xK,GAAY,kBACzB0tL,EAAcvd,GAAS,OAAOwd,CAAa,IAG3CF,EAAY,IACZ7b,EAAa5xK,GAAY,yBACzB0tL,EAAcC,WAGTrB,EAAS,KAAO,IACnB/oH,GAAK,KAAK,mBAAmBoqH,CAAa,GAC5CF,EAAY,IACZ7b,EAAa5xK,GAAY,wCACzB0tL,EAAcnqH,GAAK,QAAQ,SACzB,IAAK,CAACoqH,EAAc,KAAK,CAAC,EAAGA,EAAc,KAAK,CAAC,CAAC,CAAC,IAGrDF,EAAY,IACZ7b,EAAa5xK,GAAY,uBACzB0tL,EAAcC,WAGTrB,EAAS,KAAO,IAKnB,CAAC,IAAK,IAAI,EAAE,QAAQqB,EAAc,KAAK,CAAC,EAAE,KAAK,IAAM,IACvDF,EAAY,IACZ7b,EAAa5xK,GAAY,uBACzB0tL,EAAcC,EAAc,KAAK,CAAC,IAGlCF,EAAY,IACZ7b,EAAa5xK,GAAY,wCACzB0tL,EAAcnqH,GAAK,QAAQ,SACzB,IAAK,CAACoqH,EAAc,KAAK,CAAC,EAAGA,EAAc,KAAK,CAAC,CAAC,CAAC,OAGpD,IAAIrB,EAAS,KAAO,IAEvB,OAAOY,GAAe,SAAS7Z,CAAQ,EAGvC,MAAM,MAAM,0BAA4BiZ,EAAS,EAAE,UAG9C/oH,GAAK,KAAK,aAAa+oH,CAAQ,EACtCmB,EAAY,IACZ7b,EAAa5xK,GAAY,oCACzB0tL,EAAenqH,GAAK,QAAQ,SAAS,EAAE,MAGvC,OAAM,MAAM,0BAA4B+oH,EAAS,IAAI,EAGvD,OAAOiB,GACHla,EAAUoa,EAAWC,EAAa9b,CAAU,CAClD,EAIA,SAAS2b,GAA+Bla,EAAU3lG,EAAImhG,EAAM+C,EAAY,CACtE,MAAMkb,EAAczZ,EAAS,QAEvBua,EAAW/e,EAAK,YAChBgf,EAAYhf,EAAK,YACjByd,EAAWwB,GACfza,EAAS,SAAU3lG,EAAIkgH,CAAQ,EAC3B54G,EAAY84G,GAChBza,EAAS,UAAW3lG,EAAImgH,CAAS,EAEnC,IAAItB,EAAalZ,EAAS,WACtBlD,GAAS,WAAWtB,CAAI,IAAMnhG,IAAO,KAAOA,IAAO,OACrD6+G,EAAaY,GAAsBZ,CAAU,GAG/C,MAAMQ,EAAc,IAAIV,GAASC,EAAUt3G,EAAWu3G,CAAU,EAChE,OAAO,IAAIW,GAAetb,EAAYkb,EAAaC,CAAW,CAChE,CAGA,SAASe,GAAiC37G,EAAYzE,EAAImhG,EAAM,CAC9D,MAAMlrK,EAAQ4/D,GAAK,KAAK,WAAW4O,CAAU,EAC3C5O,GAAK,QAAQ,YAAY4O,CAAU,EAAIA,EAEzC,OAAA08F,EAAK,YAAc,EACnBA,EAAQtrG,GAAK,KAAK,WAAWsrG,CAAI,EAAItrG,GAAK,QAAQ,YAAYsrG,CAAI,EAAIA,EACtDtrG,GAAK,QAAQ,SAASmK,EAAI,CAAC/pE,EAAMkrK,CAAI,CAAC,CAGxD,CAEA,IAAAkf,IAAiBX,GCrPjB,MAAMptL,GAAca,GACdw5K,GAAS72K,GACT6oL,GAAWtnL,GACXqoL,GAAqB5lL,IACrB0lL,GAAiB3wK,GACjBynD,GAAWj+C,GACXmyF,IAASx/E,GACT+7I,GAAkB97I,GAClB4qC,GAAO3qC,GACP6lJ,GAA0B5lJ,GAC1Bm1J,GAAyB5+H,GACzBoqH,GAAUnxG,GAEV4lH,IAAyB,CAC7B,IAAK,SAAS/tE,EAAMD,EAAO,CAAE,OAAOC,IAASD,CAAQ,EACrD,IAAK,SAASC,EAAMD,EAAO,CAAE,OAAOC,EAAOD,CAAQ,EACnD,KAAM,SAASC,EAAMD,EAAO,CAAE,OAAOC,GAAQD,CAAQ,EACrD,IAAK,SAASC,EAAMD,EAAO,CAAE,OAAOC,EAAOD,CAAQ,EACnD,KAAM,SAASC,EAAMD,EAAO,CAAE,OAAOC,GAAQD,CAAQ,CACvD,EAMA,SAAS++D,GAAYsN,EAAUt3G,EAAWu3G,EAAY1iE,EAAM,GAAO,CACjE,IAAIwpD,EAAW,IAAIgZ,GAASC,EAAUt3G,EAAWu3G,CAAU,EAQ3D,GANI1iE,GAEF,QAAQ,IAAI;AAAA;AAAA,WAAkBwpD,EAAS,MAAM,GAAO,EAAI,CAAC,EAIvDgH,GAAO,oBAAoBhH,EAAS,QAAQ,GAC5CgH,GAAO,oBAAoBhH,EAAS,SAAS,EAC/C,MAAO,GAGT,MAAM6a,EAAY1U,GAAQ,qBAAqBnG,CAAQ,EAEvD,GAAI6a,EAAU,OAAS,EACrB,OAAOC,GAAsB9a,EAAUxpD,CAAK,EAE9C,MAAM8vD,EAAauU,EAAU,OAAQ,EAAC,KAAI,EAAG,MAE7C,IAAIE,EACAlc,EAAQ,CAAA,EAEZ,MAAMmc,EAAsBhb,EAAS,QAC/BqY,EAAiB,GACvB,IAAIC,EAAQ,EAYZ,GANAtY,EAAS,SAAWoL,GAAwBpL,EAAS,QAAQ,EAC7DA,EAAS,UAAYoL,GAAwBpL,EAAS,SAAS,EAK3DgH,GAAO,aAAahH,CAAQ,EAC9B,OAAAnB,EAAM,KAAKoc,GAAejb,CAAQ,CAAC,EAC5BnB,EAIT,EAAG,CAGD,GAFAA,EAAQqc,GAAuBrc,EAAOmB,EAAUxpD,CAAK,EAEjDqoD,EAAM,OAAS,EAAG,CACpB,MAAMoS,EAAWpS,EAAMA,EAAM,OAAS,CAAC,EACvCmB,EAAWgZ,GAAS,yBAClB/H,EAAS,YAAY,MAAO,EAAEjR,EAAS,UAAU,CACpD,CAMD,GAJAA,EAAS,SAAWoB,GAAgBpB,EAAS,QAAQ,EACrDA,EAAS,UAAYoB,GAAgBpB,EAAS,SAAS,EAGnDmG,GAAQ,qBAAqBnG,CAAQ,EAAE,OAAS,EAClD,OAAO8a,GAAsB9a,EAAUxpD,EAAOqoD,CAAK,EAMrD,GAAImI,GAAO,aAAahH,CAAQ,EAC9B,OAAAnB,EAAM,KAAKoc,GAAejb,CAAQ,CAAC,EAC5BnB,EAGT,GAAI,CACFkc,EAAiB1pK,IAAK2uJ,EAAUsG,CAAU,CAC3C,OACMjgK,EAAG,CAER,GAAIA,EAAE,QAAQ,WAAW,uBAAuB,EAE9C,eAAQ,MAAM,eAAiBA,EAAE,QAAU,sBAAsB,EAC1D,GAGP,MAAMA,CAET,CAED,GAAI00K,EAAe,aAAc,CAC/B,GAAIA,EAAe,YAAY,MAAK,EAAG,OAAS,IAE9C,MAAM,MAAM,oDACAC,EAAuB,+DACO,EAExCxkE,GACF+hE,GAASwC,CAAc,EAEzBlc,EAAM,KAAKkc,CAAc,CAC1B,CAGD,GADA/a,EAAW6Z,GAAe,kBAAkBkB,EAAe,WAAW,EAClEzC,MAAYD,EAEd,eAAQ,MAAM,qDACA2C,EAAsB,sBAAsB,EACnD,EAEb,OAAWD,EAAe,cAExB,OAAOlc,CACT,CAQA,SAASoc,GAAejb,EAAU,CAChC,KAAM,CAAClgE,EAAWtvC,CAAM,EAAI2qH,IAAsBnb,CAAQ,EAE1D,IAAIob,EAEJ,GAAIt7E,EAAU,OAAS,EAAG,CACxB,MAAMu7E,EAAuB,CAAA,EAC7Bv7E,EAAU,QAAQ,GAAK,EAAE,MACLu7E,EAAqB,KAAK,GAAG,EAAE,KAAK,EACpCA,EAAqB,KAAK,CAAC,CAAC,EAChDD,EAAgBlrH,GAAK,QAAQ,KAAKmrH,CAAoB,CACvD,MACQv7E,EAAU,SAAW,EAC5Bs7E,EAAet7E,EAAU,CAAC,EAG1Bs7E,EAAelrH,GAAK,QAAQ,KAAK,CAAE,CAAA,EAGrC,MAAM1X,EAAQ,IAAIwgI,GAASxoH,EAAQ4qH,EAAc,GAAG,EAEpD,OAAO,IAAIvB,GAAeltL,GAAY,WAAYqzK,EAAUxnH,CAAK,CACnE,CAUA,SAAS2iI,IAAuBnb,EAAU,CACxC,MAAMiZ,EAAWjZ,EAAS,SAEpBlgE,EAAY,CAAA,EAElB,IAAItvC,EAAQquG,EAAOyc,EAMfprH,GAAK,KAAK,WAAW+oH,EAAU,GAAG,GAAK,CAACjS,GAAO,mBAAmBiS,CAAQ,EAC5EqC,EAAqB,CAACrC,CAAQ,EAG9BqC,EAAqBtb,EAAS,SAAS,KAAK,OAAO5iK,GAAO,CAAC4pK,GAAO,mBAAmB5pK,CAAG,CAAC,EAU3F,QAASiW,KAAKioK,EAAoB,CAChC,IAAIz2E,EAASy2E,EAAmBjoK,CAAC,EAC7B/M,EAAW,EAEX4pD,GAAK,KAAK,WAAW20C,EAAQ,GAAG,IAClCv+F,EAAW,WAAWu+F,EAAO,KAAK,CAAC,EAAE,KAAK,EAC1CA,EAASA,EAAO,KAAK,CAAC,GAGxB,MAAMo0E,EAAW/oH,GAAK,KAAK,cAAc20C,CAAM,EACvCA,EAAO,QACPA,EAIR,GAFAg6D,EAAQ8M,GAAYsN,EAAUjZ,EAAS,UAAW,GAAG,EAEjDnB,EAAM,SAAW,GAAK3uG,GAAK,KAAK,SAAS+oH,CAAQ,EAEnDzoH,EAASyoH,EAITn5E,EAAU,KAAK,GAAG,MAAMx5F,CAAQ,EAAE,KAAK05J,EAAS,SAAS,CAAC,UAEnDnB,EAAM,SAAW,EAAG,CAI3B,MAAMoS,EAAWpS,EAAM,MAAM,EAAE,EAAE,CAAC,EAG9B3uG,GAAK,KAAK,SAAS+gH,EAAS,YAAY,QAAQ,IAClDzgH,EAASygH,EAAS,YAAY,SAC9BnxE,EAAU,KAAK,GAAG,MAAMx5F,CAAQ,EAAE,KAAK2qK,EAAS,YAAY,SAAS,CAAC,EAEzE,CACF,CAED,MAAO,CAACnxE,EAAWtvC,CAAM,CAC3B,CAIA,SAASsqH,GAAsB9a,EAAUxpD,EAAOqoD,EAAM,CAAA,EAAI,CACxD,MAAM0c,EAAkBX,IAAuB5a,EAAS,UAAU,EAElE,GAAI,CAACub,EACH,MAAM,MAAM,uBAAuB,EAIrC,GADA1c,EAAQqc,GAAuBrc,EAAOmB,EAAU,EAAW,EACvDnB,EAAM,OAAS,EAAG,CACpB,MAAMoS,EAAWpS,EAAMA,EAAM,OAAS,CAAC,EACvCmB,EAAWgZ,GAAS,yBAClB/H,EAAS,YAAY,MAAO,EAAEjR,EAAS,UAAU,CACpD,CAOD,GAHAA,EAAS,SAAWoL,GAAwBpL,EAAS,QAAQ,EAC7DA,EAAS,UAAYoL,GAAwBpL,EAAS,SAAS,EAE3D,CAAC9vG,GAAK,KAAK,6BAA6B8vG,EAAS,SAAU,EAAI,GAC/D,CAAC9vG,GAAK,KAAK,6BAA6B8vG,EAAS,UAAW,EAAI,EAClE,MAAM,MAAM,qDACAA,EAAS,MAAK,CAAE,EAG9B,MAAMwb,EAAY7qH,GAASqvG,EAAS,QAAQ,EACtCyb,EAAa9qH,GAASqvG,EAAS,SAAS,EAC9C,IAAIzB,EACAgd,EAAgBC,EAAWC,CAAU,EACvCld,EAAa5xK,GAAY,kBAGzB4xK,EAAa5xK,GAAY,mBAK3B,MAAMouL,EAAiB,IAAIlB,GAAetb,EAAY,KAAMyB,CAAQ,EACpE,OAAIxpD,GACF+hE,GAASwC,CAAc,EAEzBlc,EAAM,KAAKkc,CAAc,EAClBlc,CACT,CAIA,SAASxtJ,IAAK2uJ,EAAUsG,EAAY,CAClC,MAAMoV,EAAiB,CAErB3B,GAAmB,uBAEnBA,GAAmB,4BAEnBA,GAAmB,0BAEnBA,GAAmB,uBACvB,EAEE,QAAS9sL,EAAI,EAAGA,EAAIyuL,EAAe,OAAQzuL,IAAK,CAC9C,MAAM8tL,EAAiBW,EAAezuL,CAAC,EAAE+yK,EAAUsG,CAAU,EAE7D,GAAIyU,EAAe,aACjB,OAAOA,CAEV,CACD,OAAOlB,GAAe,SAAS7Z,CAAQ,CACzC,CAGA,SAASkb,GAAuBrc,EAAOmB,EAAUxpD,EAAM,GAAO,CAC5D,IAAIijE,EAAczZ,EAAS,QAa3B,MAAM2b,EAAoBhB,GAAuB3a,EAAS,SAAU,EAAK,EACnE4b,EAAqBD,EAAkB,SAAW,EAChDA,EAAkB,MAAM,EAAE,EAAE,CAAC,EAAE,QAC/B3b,EAAS,SACX6b,EAAkBh3E,IAAO+2E,EAAoB,EAAK,EAElDE,EAAe,CAAA,EAErB,QAAS7uL,EAAI,EAAGA,EAAI0uL,EAAkB,OAAQ1uL,IAAK,CACjD,MAAMokB,EAAOsqK,EAAkB1uL,CAAC,EAChC6uL,EAAa,KAAKjC,GAAe,YAAY7Z,EAAU3uJ,CAAI,CAAC,CAC7D,CAED,QAASpkB,EAAI,EAAGA,EAAI4uL,EAAgB,OAAQ5uL,IAAK,CAC/C,MAAMokB,EAAOwqK,EAAgB5uL,CAAC,EAC9B6uL,EAAa,KAAKjC,GAAe,YAAY7Z,EAAU3uJ,CAAI,CAAC,CAC7D,CAED,GAAIyqK,EAAa,SAAW,EAAG,CAC7B,MAAMzqK,EAAOyqK,EAAa,CAAC,EACvBtlE,GACF+hE,GAASlnK,CAAI,EAEfwtJ,EAAM,KAAKxtJ,CAAI,CAChB,SACQyqK,EAAa,OAAS,EAAG,CAChC,MAAM7K,EAAW6K,EAAaA,EAAa,OAAS,CAAC,EAC/CC,EAAgBlC,GAAe,kBAAkB5I,EAAS,WAAW,EAErE+K,EAAiB,IAAInC,GACzBltL,GAAY,mBACZ8sL,EAAasC,EAAeD,CAAY,EACtCtlE,GACF+hE,GAASyD,CAAc,EAEzBnd,EAAM,KAAKmd,CAAc,CAC1B,CAGGnd,EAAM,OAAS,IACjBmB,EAAW6Z,GAAe,kBACxBhb,EAAMA,EAAM,OAAS,CAAC,EAAE,WAAW,GAKvC4a,EAAczZ,EAAS,QAEvB,MAAMic,EAAatB,GAAuB3a,EAAS,UAAW,EAAK,EAC7Dkc,EAAgB,CAAA,EAEtB,QAASjvL,EAAI,EAAGA,EAAIgvL,EAAW,OAAQhvL,IAAK,CAC1C,MAAMokB,EAAO4qK,EAAWhvL,CAAC,EACzBivL,EAAc,KAAKrC,GAAe,aAAa7Z,EAAU3uJ,CAAI,CAAC,CAC/D,CAED,GAAI6qK,EAAc,SAAW,EAAG,CAC9B,MAAM7qK,EAAO6qK,EAAc,CAAC,EACxB1lE,GACF+hE,GAASlnK,CAAI,EAEfwtJ,EAAM,KAAKxtJ,CAAI,CAChB,SACQ6qK,EAAc,OAAS,EAAG,CACjC,MAAMjL,EAAWiL,EAAcA,EAAc,OAAS,CAAC,EACjDH,EAAgBlC,GAAe,kBAAkB5I,EAAS,WAAW,EAErE+K,EAAiB,IAAInC,GACzBltL,GAAY,oBACZ8sL,EAAasC,EAAeG,CAAa,EACvC1lE,GACF+hE,GAASyD,CAAc,EAEzBnd,EAAM,KAAKmd,CAAc,CAC1B,CAED,OAAOnd,CACT,CAEA,SAAS0Z,GAASwC,EAAgB,CAEhC,QAAQ,IAAI;AAAA,EAAOA,EAAe,UAAU,EAE5C,QAAQ,IAAIA,EAAe,YAAY,MAAO,CAAA,EAC1CA,EAAe,SAAS,OAAS,IAEnC,QAAQ,IAAI;AAAA,YAAe,EAC3BA,EAAe,SAAS,QAAQxC,EAAQ,EAE5C,CAGA,IAAA3M,IAAiBD,GC/ZjB,MAAM/6G,GAAOpjE,GAEPm+K,IAAcx7K,IAEpB,SAASgsL,IAAoBC,EAAgB5lE,EAAM,GAAO,CACxD,MAAM6lE,EAAc,CAAC,KAAM,KAAM,IAAK,IAAK,GAAG,EAE9C,QAASpvL,EAAI,EAAGA,EAAIovL,EAAY,OAAQpvL,IAAK,CAC3C,MAAMisL,EAAamD,EAAYpvL,CAAC,EAC1BssL,EAAQ6C,EAAe,MAAMlD,CAAU,EAC7C,GAAIK,EAAM,SAAW,EACnB,SAEF,IAAIN,EAAUt3G,EACd,MAAMw3G,EAAWI,EAAM,CAAC,EAAE,KAAI,EACxBH,EAAYG,EAAM,CAAC,EAAE,KAAI,EAE/B,GAAI,CAACJ,GAAY,CAACC,EAChB,MAAO,GAGT,GAAI,CACFH,EAAWroH,GAAK,MAAMuoH,CAAQ,EAC9Bx3G,EAAY/Q,GAAK,MAAMwoH,CAAS,CACjC,MACW,CACV,MAAO,EACR,CACD,GAAIH,GAAYt3G,EACd,OAAOgqG,IAAYsN,EAAUt3G,EAAWu3G,EAAY1iE,CAAK,CAE5D,CAED,MAAO,EACT,CAEA,IAAA8lE,IAAiBH,ICpCjB,MAAMxvL,IAAca,GACdq3G,IAAS10G,IACT0oL,IAAqBnnL,IACrB4qL,IAAgBnoL,IAChBooL,IAAUrzK,GACVgnD,IAAOx9C,GACPoqJ,IAAWz3I,GACXjb,IAAUkb,GAEhB,IAAAk3J,GAAiB,CACf,OAAA33E,IACA,mBAAAg0E,IACA,cAAAyD,IACA,KAAApsH,IACA,SAAA4sG,IACA,QAAAyf,IACA,QAAAnyK,IACA,YAAAzd,GACF,ECdO,MAAMquK,GAAW,CAAE,EAE1BA,GAAS,WAAa,SAAU1qK,EAAM2qK,EAAW,KAAM,CACrD,OAAO3qK,EAAK,OAAS,gBACdA,EAAK,KAAO,cACZ,QAAQ,SAASA,EAAK,EAAE,IACvB2qK,EAAW3qK,EAAK,KAAO2qK,EAAW,GAC5C,EAEAD,GAAS,cAAgB,SAAU1qK,EAAM,CACvC,OAAOA,EAAK,OAAS,iBACvB,EAEA0qK,GAAS,aAAe,SAAU1qK,EAAM,CACtC,OAAOA,EAAK,OAAS,gBAAkBA,EAAK,KAAO,YACrD,EAEA0qK,GAAS,WAAa,SAAU1qK,EAAM4qK,EAAe,KAAM,CAIzD,MAHI,EAAA5qK,EAAK,OAAS,gBAGd4qK,GAAgB5qK,EAAK,GAAG,OAAS4qK,EAIvC,EAEAF,GAAS,SAAW,SAAU1qK,EAAM6qK,EAAkB,GAAO,CAC3D,OAAI7qK,EAAK,OAAS,aACT,GACE6qK,GAAmBH,GAAS,aAAa1qK,CAAI,EAC/C0qK,GAAS,SAAS1qK,EAAK,KAAK,CAAC,EAAG,EAAK,EAErC,EAEX,EAEA0qK,GAAS,WAAa,SAAU1qK,EAAM6qK,EAAkB,GAAO,CAC7D,OAAI7qK,EAAK,OAAS,eACT,GACE6qK,GAAmBH,GAAS,aAAa1qK,CAAI,GAClD0qK,GAAS,WAAW1qK,EAAK,KAAK,CAAC,EAAG,EAAK,EAC3B,WAAWA,EAAK,KAAK,CAAC,EAAE,KAAK,GAC3B,EAKX,EAEX,EAEA0qK,GAAS,mBAAqB,SAAU1qK,EAAM6qK,EAAkB,GAAO,CACrE,OAAIH,GAAS,WAAW1qK,EAAM,GAAG,EACxBA,EAAK,KAAK,MAAM,GAAK0qK,GAAS,WAAW,EAAGG,CAAe,CAAC,EAE5D,EAEX,EAEAH,GAAS,6BAA+B,SAAU1qK,EAAM6qK,EAAkB,GAAO,CAC/E,MAAI,GAAAH,GAAS,WAAW1qK,EAAM6qK,CAAe,GACzCH,GAAS,mBAAmB1qK,EAAM6qK,CAAe,EAKvD,EAEAH,GAAS,kBAAoB,SAAU1qK,EAAM6qK,EAAkB,GAAO,CACpE,GAAI,CAACH,GAAS,mBAAmB1qK,EAAM6qK,CAAe,EACpD,MAAO,GAET,IAAIz+I,EAAYpsB,EAAK,KAAK,CAAC,EACvBwnB,EAAcxnB,EAAK,KAAK,CAAC,EAC7B,OAAI6qK,IACEH,GAAS,aAAat+I,CAAS,IACjCA,EAAYA,EAAU,KAAK,CAAC,GAE1Bs+I,GAAS,aAAaljJ,CAAW,IACnCA,EAAcA,EAAY,KAAK,CAAC,IAG5B,OAAO,UAAU,WAAW4E,EAAU,KAAK,CAAC,GAC5C,OAAO,UAAU,WAAW5E,EAAY,KAAK,CAAC,CACxD,ECtFA,MAAM2kK,GAAS,CACb,wBAAyB,CAAE,CAC7B,EAEMC,IAAe,CACnB,IAAK,UACL,IAAK,UACL,IAAK,WACL,IAAK,QACP,EAEMC,GAAuB,CAC3B,IAAK,WACL,IAAK,eACL,KAAM,2BACN,IAAK,YACL,KAAM,uBACR,EAIAF,GAAO,aAAe,SAAUprK,EAAM,CACpC,GAAI,EAAEA,EAAK,cAAcorK,GAAO,yBAG9B,eAAQ,MAAMprK,EAAK,WAAa,mCAAmC,EAC5DA,EAAK,WAGd,MAAMurK,EAA0BH,GAAO,wBAAwBprK,EAAK,UAAU,EACxEwrK,EAAoBD,EAAwBvrK,CAAI,EACtD,OAAKwrK,GACI,UAAUJ,GAAO,WAAWprK,EAAK,UAAU,CAAC,GAIvD,EAEA,SAASyrK,GAAgBxsL,EAAM,CAC7B,OAAOA,EAAK,OAAOA,GAAQA,EAAK,WAAW,CAC7C,CAEA,SAASysL,GAAmB1rK,EAAM,CAChC,GAAIA,EAAK,QACP,OAAOyrK,GAAezrK,EAAK,OAAO,EAC7B,GAAIA,EAAK,YAAa,CAC3B,MAAM2rK,EAAwBF,GAAezrK,EAAK,YAAY,QAAQ,EAChE4rK,EAAyBH,GAAezrK,EAAK,YAAY,SAAS,EACxE,MAAO,CAAC,GAAG2rK,EAAuB,GAAGC,CAAsB,CAC5D,CACD,OAAO,IACT,CAEO,SAASC,GAAmB7rK,EAAM,CACvC,GAAIA,EAAK,QACP,OAAOyrK,GAAezrK,EAAK,OAAO,EAC7B,GAAIA,EAAK,YAAa,CAC3B,MAAM2rK,EAAwBF,GAAezrK,EAAK,YAAY,QAAQ,EAChE4rK,EAAyBH,GAAezrK,EAAK,YAAY,SAAS,EACxE,MAAO,CAAC,GAAG2rK,EAAuB,GAAGC,CAAsB,CAC5D,CACD,OAAO,IACT,CAEA,SAASE,GAAe17H,EAAO27H,EAAa,GAAO,CAEjD37H,EAAM,QAAQnxD,GAAQ,CAAEA,EAAK,YAAc,OAAW,EAEtD,IAAImwD,EAAUgB,EAAM,IAAInxD,GAAQA,EAAK,OAAO,EAK5C,OAJK8sL,IACH38H,EAAU,CAAC,GAAG,IAAI,IAAIA,CAAO,CAAC,GAG5BA,EAAQ,SAAW,EACd,GACEA,EAAQ,SAAW,EACrBA,EAAQ,CAAC,EAET,GAAGA,EAAQ,MAAM,EAAG,EAAE,EAAE,KAAK,IAAI,CAAC,kBAAkBA,EAAQ,MAAM,EAAE,CAAC,EAEhF,CAGAg8H,GAAO,wBAAwB9vL,GAAW,YAAC,cAAc,EAAI,SAAU0kB,EAAM,CAC3E,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,EACtB,OAAO,KAGT,MAAMC,EAAUD,EAAS,CAAC,EAC1B,OAAKriB,GAAS,WAAWsiB,EAAS,KAAK,EAKhC,uCADQA,EAAQ,KAAK,CAAC,EAAE,MAAO,CACc,GAJ3C,IAKX,EAGAb,GAAO,wBAAwB9vL,GAAW,YAAC,sBAAsB,EAAI,SAAU0kB,EAAM,CACnF,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACjCksK,EAAWL,GAAkB7rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,GAAKE,EAAS,SAAWF,EAAS,OACxD,OAAO,KAGT,MAAMv5K,EAASq5K,GAAcE,CAAQ,EAC/BG,EAAQL,GAAcI,CAAQ,EACpC,MAAO,oBAAoBz5K,CAAM,iBAAiB05K,CAAK,EACzD,EAGAf,GAAO,wBAAwB9vL,GAAW,YAAC,mBAAmB,EAAI,SAAU0kB,EAAM,CAChF,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACjCksK,EAAWL,GAAkB7rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,GAAKE,EAAS,SAAWF,EAAS,OACxD,OAAO,KAGT,MAAMv5K,EAASq5K,GAAcE,CAAQ,EAC/BG,EAAQL,GAAcI,CAAQ,EACpC,MAAO,oBAAoBz5K,CAAM,iBAAiB05K,CAAK,EACzD,EAGAf,GAAO,wBAAwB9vL,GAAW,YAAC,aAAa,EAAI,SAAU0kB,EAAM,CAC1E,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACjCksK,EAAWL,GAAkB7rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,GAAKE,EAAS,SAAW,EAC/C,OAAO,KAGT,MAAME,EAASJ,EAAS,CAAC,EACzB,GAAI,CAACriB,GAAS,WAAWyiB,CAAM,GAAKA,EAAO,KAAO,KAAOA,EAAO,KAAK,OAAS,EAC5E,OAAO,KAGT,MAAM35K,EAASq5K,GAAcM,EAAO,KAAM,EAAI,EACxCD,EAAQD,EAAS,CAAC,EAAE,MAAO,EACjC,MAAO,gBAAgBz5K,CAAM,qBAAqB05K,CAAK,EACzD,EAGAf,GAAO,wBAAwB9vL,GAAW,YAAC,cAAc,EAAI,SAAU0kB,EAAM,CAC3E,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,oBAAoB,EAAI,SAAU0kB,EAAM,CACjF,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACjCksK,EAAWL,GAAkB7rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,GAAKE,EAAS,SAAW,EAC/C,OAAO,KAGT,MAAME,EAASJ,EAAS,CAAC,EACzB,GAAI,CAACriB,GAAS,WAAWyiB,CAAM,GAAKA,EAAO,KAAO,IAChD,OAAO,KAGT,MAAM35K,EAASq5K,GAAcM,EAAO,KAAM,EAAI,EACxCD,EAAQD,EAAS,CAAC,EAAE,MAAO,EACjC,MAAO,gBAAgBz5K,CAAM,qBAAqB05K,CAAK,EACzD,EAGAf,GAAO,wBAAwB9vL,GAAW,YAAC,iBAAiB,EAAI,SAAU0kB,EAAM,CAE9E,MAAMqsK,EAAYR,GAAkB7rK,CAAI,EACxC,OAAIqsK,EAAU,SAAW,EAChB,KAIF,gBADMA,EAAU,CAAC,EAAE,MAAO,CACN,yBAC7B,EAGAjB,GAAO,wBAAwB9vL,GAAW,YAAC,iBAAiB,EAAI,SAAU0kB,EAAM,CAC9E,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACvC,OAAIgsK,EAAS,SAAW,EACf,KAIF,kCADQF,GAAcE,CAAQ,CACU,EACjD,EAGAZ,GAAO,wBAAwB9vL,GAAW,YAAC,eAAe,EAAI,SAAU0kB,EAAM,CAC5E,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,wBAAwB,EAAI,SAAU0kB,EAAM,CACrF,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,cAAc,EAAI,SAAU0kB,EAAM,CAC3E,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,WAAW,EAAI,SAAU0kB,EAAM,CACxE,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,YAAY,EAAI,SAAU0kB,EAAM,CACzE,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACvC,OAAIgsK,EAAS,SAAW,EACf,KAIF,mBADQF,GAAcE,CAAQ,CACL,8CAClC,EAGAZ,GAAO,wBAAwB9vL,GAAW,YAAC,8BAA8B,EAAI,SAAU0kB,EAAM,CAC3F,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,iBAAiB,EAAI,SAAU0kB,EAAM,CAC9E,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,kBAAkB,EAAI,SAAU0kB,EAAM,CAC/E,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,kBAAkB,EAAI,SAAU0kB,EAAM,CAC/E,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,kBAAkB,EAAI,SAAU0kB,EAAM,CAC/E,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,kBAAkB,EAAI,SAAU0kB,EAAM,CAC/E,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,2BAA2B,EAAI,SAAU0kB,EAAM,CACxF,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACjCksK,EAAWL,GAAkB7rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,GAAKE,EAAS,SAAW,EAC/C,OAAO,KAGT,MAAMz5K,EAASq5K,GAAcE,CAAQ,EAC/BG,EAAQL,GAAcI,CAAQ,EACpC,MAAO,mBAAmBz5K,CAAM,iBAAiB05K,CAAK,+CACxD,EAGAf,GAAO,wBAAwB9vL,GAAW,YAAC,kCAAkC,EAAI,SAAU0kB,EAAM,CAC/F,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACjCksK,EAAWL,GAAkB7rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,GAAKE,EAAS,SAAW,EAC/C,OAAO,KAGT,MAAMz5K,EAASq5K,GAAcE,CAAQ,EAC/BG,EAAQL,GAAcI,CAAQ,EACpC,MAAO,oBAAoBz5K,CAAM,iBAAiB05K,CAAK,EACzD,EAGAf,GAAO,wBAAwB9vL,GAAW,YAAC,UAAU,EAAI,SAAU0kB,EAAM,CACvE,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,uBAAuB,EAAI,SAAU0kB,EAAM,CACpF,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,mBAAmB,EAAI,SAAU0kB,EAAM,CAChF,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,4BAA4B,EAAI,SAAU0kB,EAAM,CACzF,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACjCksK,EAAWL,GAAkB7rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,GAAKE,EAAS,SAAW,EAC/C,OAAO,KAGT,MAAMz5K,EAASq5K,GAAcE,CAAQ,EAC/BG,EAAQL,GAAcI,CAAQ,EACpC,MAAO,mBAAmBz5K,CAAM,0CAA0C05K,CAAK,EACjF,EAGAf,GAAO,wBAAwB9vL,GAAW,YAAC,sBAAsB,EAAI,SAAU0kB,EAAM,CACnF,MAAMqsK,EAAYR,GAAkB7rK,CAAI,EACxC,OAAIqsK,EAAU,SAAW,EAChB,KAIF,iCADMA,EAAU,CAAC,EAAE,MAAO,CACW,EAC9C,EAGAjB,GAAO,wBAAwB9vL,GAAW,YAAC,wBAAwB,EAAI,SAAU0kB,EAAM,CACrF,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACjCksK,EAAWL,GAAkB7rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,GAAKE,EAAS,SAAW,EAC/C,OAAO,KAGT,MAAMz5K,EAASq5K,GAAcE,CAAQ,EAC/BG,EAAQL,GAAcI,CAAQ,EACpC,MAAO,GAAGz5K,CAAM,+BAA+B05K,CAAK,EACtD,EAGAf,GAAO,wBAAwB9vL,GAAW,YAAC,eAAe,EAAI,SAAU0kB,EAAM,CAC5E,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACjCksK,EAAWL,GAAkB7rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,GAAKE,EAAS,SAAW,EAC/C,OAAO,KAGT,MAAMz5K,EAASq5K,GAAcE,CAAQ,EAC/BG,EAAQL,GAAcI,CAAQ,EACpC,MAAO,GAAGz5K,CAAM,8BAA8B05K,CAAK,EACrD,EAGAf,GAAO,wBAAwB9vL,GAAW,YAAC,6BAA6B,EAAI,SAAU0kB,EAAM,CAC1F,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,kBAAkB,EAAI,SAAU0kB,EAAM,CAC/E,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACjCksK,EAAWL,GAAkB7rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,GAAKE,EAAS,OAASF,EAAS,QAAUE,EAAS,OAAS,EAClF,OAAO,KAGT,MAAMz5K,EAASq5K,GAAcE,CAAQ,EAC/BG,EAAQL,GAAcI,CAAQ,EACpC,MAAO,mBAAmBz5K,CAAM,sCAAsC05K,CAAK,EAC7E,EAGAf,GAAO,wBAAwB9vL,GAAW,YAAC,kBAAkB,EAAI,SAAU0kB,EAAM,CAC/E,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,mBAAmB,EAAI,SAAU0kB,EAAM,CAChF,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,uCAAuC,EAAI,SAAU0kB,EAAM,CACpG,MAAMqsK,EAAYR,GAAkB7rK,CAAI,EACxC,OAAIqsK,EAAU,SAAW,EAChB,KAIF,+CADMA,EAAU,CAAC,EAAE,MAAO,CACyB,EAC5D,EAGAjB,GAAO,wBAAwB9vL,GAAW,YAAC,mCAAmC,EAAI,SAAU0kB,EAAM,CAChG,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,mBAAmB,EAAI,SAAU0kB,EAAM,CAChF,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACjCksK,EAAWL,GAAkB7rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,GAAKE,EAAS,SAAW,EAC/C,OAAO,KAGT,MAAMz5K,EAASq5K,GAAcE,EAAU,EAAI,EACrCG,EAAQL,GAAcI,CAAQ,EACpC,MAAO,oBAAoBz5K,CAAM,iBAAiB05K,CAAK,EACzD,EAGAf,GAAO,wBAAwB9vL,GAAW,YAAC,gBAAgB,EAAI,SAAU0kB,EAAM,CAC7E,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACjCksK,EAAWL,GAAkB7rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,GAAKE,EAAS,SAAW,EAC/C,OAAO,KAGT,MAAMz5K,EAASq5K,GAAcE,CAAQ,EAC/BG,EAAQL,GAAcI,CAAQ,EACpC,MAAO,oBAAoBz5K,CAAM,iBAAiB05K,CAAK,EACzD,EAGAf,GAAO,wBAAwB9vL,GAAW,YAAC,qBAAqB,EAAI,SAAU0kB,EAAM,CAClF,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACjCksK,EAAWL,GAAkB7rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,GAAKE,EAAS,SAAW,EAC/C,OAAO,KAGT,MAAME,EAASJ,EAAS,CAAC,EACzB,GAAI,CAACriB,GAAS,WAAWyiB,CAAM,GAAKA,EAAO,KAAO,IAChD,OAAO,KAGT,MAAM35K,EAASq5K,GAAcE,EAAU,EAAI,EACrCG,EAAQD,EAAS,CAAC,EAAE,MAAO,EACjC,MAAO,sCAAsCz5K,CAAM,qBAAqB05K,CAAK,EAC/E,EAGAf,GAAO,wBAAwB9vL,GAAW,YAAC,qBAAqB,EAAI,SAAU0kB,EAAM,CAClF,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,kBAAkB,EAAI,SAAU0kB,EAAM,CAC/E,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACjCksK,EAAWL,GAAkB7rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,GAAKE,EAAS,SAAW,EAC/C,OAAO,KAGT,MAAME,EAASJ,EAAS,CAAC,EACzB,GAAI,CAACriB,GAAS,WAAWyiB,CAAM,GAAKA,EAAO,KAAO,IAChD,OAAO,KAGT,MAAM35K,EAASq5K,GAAcM,EAAO,KAAM,EAAI,EACxCD,EAAQD,EAAS,CAAC,EAAE,MAAO,EACjC,MAAO,qBAAqBz5K,CAAM,qBAAqB05K,CAAK,EAC9D,EAGAf,GAAO,wBAAwB9vL,GAAW,YAAC,mBAAmB,EAAI,SAAU0kB,EAAM,CAChF,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,yBAAyB,EAAI,SAAU0kB,EAAM,CACtF,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACjCksK,EAAWL,GAAkB7rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,GAAKE,EAAS,SAAW,EAC/C,OAAO,KAGT,MAAME,EAASJ,EAAS,CAAC,EACzB,GAAI,CAACriB,GAAS,WAAWyiB,CAAM,GAAKA,EAAO,KAAO,IAChD,OAAO,KAGT,MAAM35K,EAASq5K,GAAcM,EAAO,KAAM,EAAI,EACxCD,EAAQD,EAAS,CAAC,EAAE,MAAO,EACjC,MAAO,qBAAqBz5K,CAAM,qBAAqB05K,CAAK,EAC9D,EAGAf,GAAO,wBAAwB9vL,GAAW,YAAC,sBAAsB,EAAI,SAAU0kB,EAAM,CACnF,MAAMqsK,EAAYR,GAAkB7rK,CAAI,EACxC,OAAIqsK,EAAU,SAAW,EAChB,KAIF,mCADMA,EAAU,CAAC,EAAE,MAAO,CACa,EAChD,EAGAjB,GAAO,wBAAwB9vL,GAAAA,YAAY,SAAS,EAAI,UAAY,CAClE,OAAO,IACT,EAGA8vL,GAAO,wBAAwB9vL,GAAW,YAAC,cAAc,EAAI,SAAU0kB,EAAM,CAC3E,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACvC,OAAIgsK,EAAS,SAAW,EACf,KAIF,6BADQF,GAAcE,CAAQ,CACK,EAC5C,EAGAZ,GAAO,wBAAwB9vL,GAAW,YAAC,eAAe,EAAI,SAAU0kB,EAAM,CAC5E,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,uBAAuB,EAAI,SAAU0kB,EAAM,CACpF,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACjCksK,EAAWL,GAAkB7rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,GAAKE,EAAS,SAAW,EAC/C,OAAO,KAGT,MAAMz5K,EAASq5K,GAAcE,CAAQ,EAC/BG,EAAQL,GAAcI,CAAQ,EACpC,MAAO,oBAAoBz5K,CAAM,iBAAiB05K,CAAK,EACzD,EAGAf,GAAO,wBAAwB9vL,GAAW,YAAC,qBAAqB,EAAI,SAAU0kB,EAAM,CAClF,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACjCksK,EAAWL,GAAkB7rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,GAAKE,EAAS,SAAW,EAC/C,OAAO,KAGT,MAAMz5K,EAASq5K,GAAcE,CAAQ,EAC/BG,EAAQL,GAAcI,CAAQ,EACpC,MAAO,oBAAoBz5K,CAAM,iBAAiB05K,CAAK,EACzD,EAGAf,GAAO,wBAAwB9vL,GAAW,YAAC,kBAAkB,EAAI,SAAU0kB,EAAM,CAC/E,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,sBAAsB,EAAI,SAAU0kB,EAAM,CACnF,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACjCksK,EAAWL,GAAkB7rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,GAAKE,EAAS,SAAW,EAC/C,OAAO,KAGT,MAAMz5K,EAASq5K,GAAcE,CAAQ,EAC/BG,EAAQL,GAAcI,CAAQ,EACpC,MAAO,oBAAoBz5K,CAAM,iBAAiB05K,CAAK,EACzD,EAGAf,GAAO,wBAAwB9vL,GAAW,YAAC,kCAAkC,EAAI,SAAU0kB,EAAM,CAC/F,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACjCksK,EAAWL,GAAkB7rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,GAAKE,EAAS,SAAW,EAC/C,OAAO,KAGT,MAAMz5K,EAASq5K,GAAcE,CAAQ,EAC/BG,EAAQL,GAAcI,CAAQ,EACpC,MAAO,oBAAoBz5K,CAAM,iBAAiB05K,CAAK,EACzD,EAGAf,GAAO,wBAAwB9vL,GAAW,YAAC,yBAAyB,EAAI,SAAU0kB,EAAM,CACtF,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACjCksK,EAAWL,GAAkB7rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,GAAKE,EAAS,SAAW,EAC/C,OAAO,KAGT,MAAMz5K,EAASq5K,GAAcE,CAAQ,EAC/BG,EAAQL,GAAcI,CAAQ,EACpC,MAAO,oBAAoBz5K,CAAM,iBAAiB05K,CAAK,EACzD,EAGAf,GAAO,wBAAwB9vL,GAAW,YAAC,oBAAoB,EAAI,SAAU0kB,EAAM,CACjF,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,mBAAmB,EAAI,SAAU0kB,EAAM,CAChF,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACjCksK,EAAWL,GAAkB7rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,GAAKE,EAAS,SAAW,EAC/C,OAAO,KAGT,MAAME,EAASJ,EAAS,CAAC,EACzB,GAAI,CAACriB,GAAS,WAAWyiB,CAAM,GAAK,QAAQ,QAAQA,EAAO,EAAE,IAAM,GACjE,OAAO,KAGT,MAAM35K,EAASq5K,GAAcM,EAAO,KAAM,EAAI,EACxCD,EAAQD,EAAS,CAAC,EAAE,MAAO,EACjC,MAAO,UAAUb,IAAae,EAAO,EAAE,CAAC,MAAM35K,CAAM,qBAAqB05K,CAAK,EAChF,EAGAf,GAAO,wBAAwB9vL,GAAW,YAAC,iBAAiB,EAAI,SAAU0kB,EAAM,CAC9E,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACjCksK,EAAWL,GAAkB7rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,GAAKE,EAAS,SAAW,EAC/C,OAAO,KAGT,MAAMz5K,EAASq5K,GAAcE,CAAQ,EAC/BG,EAAQL,GAAcI,CAAQ,EACpC,MAAO,oBAAoBz5K,CAAM,iBAAiB05K,CAAK,EACzD,EAGAf,GAAO,wBAAwB9vL,GAAW,YAAC,iBAAiB,EAAI,SAAU0kB,EAAM,CAC9E,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACjCksK,EAAWL,GAAkB7rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,GAAKE,EAAS,SAAW,EAC/C,OAAO,KAGT,MAAMz5K,EAASq5K,GAAcE,CAAQ,EAC/BG,EAAQL,GAAcI,CAAQ,EACpC,MAAO,qBAAqBz5K,CAAM,iBAAiB05K,CAAK,EAC1D,EAGAf,GAAO,wBAAwB9vL,GAAW,YAAC,kBAAkB,EAAI,SAAU0kB,EAAM,CAC/E,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,mBAAmB,EAAI,SAAU0kB,EAAM,CAChF,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,cAAc,EAAI,SAAU0kB,EAAM,CAC3E,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,cAAc,EAAI,SAAU0kB,EAAM,CAC3E,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,kBAAkB,EAAI,SAAU0kB,EAAM,CAC/E,MAAM6nK,EAAa7nK,EAAK,YAAY,WACpC,MAAO,+BAA+BsrK,GAAqBzD,CAAU,CAAC,kBACxE,EAGAuD,GAAO,wBAAwB9vL,GAAW,YAAC,iBAAiB,EAAI,SAAU0kB,EAAM,CAC9E,MAAM6nK,EAAa7nK,EAAK,YAAY,WACpC,MAAO,2BAA2BsrK,GAAqBzD,CAAU,CAAC,kBACpE,EAGAuD,GAAO,wBAAwB9vL,GAAW,YAAC,wBAAwB,EAAI,SAAU0kB,EAAM,CACrF,MAAMqsK,EAAYR,GAAkB7rK,CAAI,EACxC,OAAIqsK,EAAU,SAAW,EAChB,KAIF,qBADMA,EAAU,CAAC,EAAE,MAAO,CACD,2BAClC,EAGAjB,GAAO,wBAAwB9vL,GAAW,YAAC,UAAU,EAAI,SAAU0kB,EAAM,CACvE,MAAO,UAAUorK,GAAO,WAAWprK,EAAK,UAAU,CAAC,GACrD,EAGAorK,GAAO,wBAAwB9vL,GAAW,YAAC,2BAA2B,EAAI,SAAU0kB,EAAM,CACxF,MAAMgsK,EAAWN,GAAkB1rK,CAAI,EACjCksK,EAAWL,GAAkB7rK,CAAI,EACvC,GAAIgsK,EAAS,SAAW,GAAKE,EAAS,SAAWF,EAAS,OACxD,OAAO,KAGT,MAAMv5K,EAASq5K,GAAcE,CAAQ,EAC/BG,EAAQL,GAAcI,CAAQ,EACpC,MAAO,oBAAoBz5K,CAAM,iBAAiB05K,CAAK,EACzD,EAEAf,GAAO,WAAa,CAClB,eAAgB,0BAChB,uBAAwB,0CACxB,oBAAqB,wCACrB,cAAe,6BACf,eAAgB,iCAChB,qBAAsB,oCACtB,kBAAmB,6BACnB,kBAAmB,wBACnB,gBAAiB,sBACjB,yBAA0B,mCAC1B,eAAgB,wDAChB,YAAa,kBACb,aAAc,qDACd,+BAAgC,iCAChC,kBAAmB,wBACnB,mBAAoB,kDACpB,mBAAoB,mDACpB,mBAAoB,wDACpB,mBAAoB,mCACpB,4BAA6B,4DAC7B,mCAAoC,sDACpC,WAAY,kCACZ,wBAAyB,qCACzB,oBAAqB,qCACrB,6BAA8B,qDAC9B,uBAAwB,kCACxB,yBAA0B,6DAC1B,gBAAiB,iDACjB,8BAA+B,iCAC/B,mBAAoB,2CACpB,mBAAoB,kCACpB,oBAAqB,0BACrB,wCAAyC,qDACzC,oCAAqC,4BACrC,oBAAqB,oDACrB,iBAAkB,wCAClB,sBAAuB,qCACvB,sBAAuB,yCACvB,mBAAoB,kCACpB,oBAAqB,uCACrB,0BAA2B,yCAC3B,uBAAwB,kCACxB,eAAgB,8BAChB,UAAW,YACX,gBAAiB,gDACjB,sBAAuB,2CACvB,uBAAwB,+CACxB,wBAAyB,0CACzB,mBAAoB,0BACpB,mCAAoC,gEACpC,0BAA2B,iDAC3B,qBAAsB,4CACtB,oBAAqB,0BACrB,kBAAmB,gCACnB,kBAAmB,6EACnB,mBAAoB,8BACpB,oBAAqB,+BACrB,eAAgB,0CAChB,eAAgB,8BAChB,mBAAoB,yBACpB,kBAAmB,wBACnB,yBAA0B,oCAC1B,WAAY,aACZ,4BAA6B,sCAC/B,EC1uBA,MAAM7rH,GAAOj8D,GAAO+jC,EAAG,EAEvB,SAASilJ,GAAiBrtL,EAAM+pE,EAAI,CAClC,OAAI/pE,EAAK,OAAS,eACTqtL,GAAgBrtL,EAAK,KAAK,CAAC,EAAGA,EAAK,EAAE,EACnCA,EAAK,OAAS,kBAChBqtL,GAAgBrtL,EAAK,QAASA,EAAK,EAAE,EAErC,CAAE,KAAAA,EAAM,GAAA+pE,CAAI,CAEvB,CAEA,SAASujH,GAAgBttL,EAAM+pE,EAAI,CACjC,OAAI/pE,EAAK,OAAS,eACTstL,GAAettL,EAAK,KAAKA,EAAK,KAAK,OAAS,CAAC,EAAGA,EAAK,EAAE,EACrDA,EAAK,OAAS,kBAChBstL,GAAettL,EAAK,QAASA,EAAK,EAAE,EAEpC,CAAE,KAAAA,EAAM,GAAA+pE,CAAI,CAEvB,CAQO,SAASwjH,IAAiB/+G,EAAYi9C,EAAW,CAUtD,OATanrD,GAAK,MAAMkO,CAAU,EAAE,UAClC,SAAUxuE,EAAM,CACd,OAAIA,EAAK,cAAgByrH,EAAUzrH,EAAK,IAAI,IAAM,OACzCsgE,GAAK,MAAMmrD,EAAUzrH,EAAK,IAAI,EAAE,UAAU,EAE1CA,CAEV,CACF,EACW,SAAS,CAAE,YAAa,MAAM,CAAE,CAC9C,CAEA,SAASwtL,GAAextL,EAAM2wD,EAAQu9G,EAAShoK,EAAS,CAAE,OAAQ,GAAM,OAAQ,GAAM,eAAgB,EAAI,EAAI,CAG5G,GAFAA,EAAS,OAAO,OAAO,CAAE,OAAQ,GAAM,OAAQ,GAAM,eAAgB,EAAI,EAAIA,CAAM,EAC/EyqD,IAAW,MAAQ3wD,EAAK,oBAAmBA,EAAOA,EAAK,SACvDkuK,IAAY,QAAaluK,EAAK,SAAQ,IAAOkuK,EAAQ,WAAY,CAkBnE,GAjBAA,EAAUluK,EAAK,MAAO,EAKlBA,EAAK,gBAAkBA,EAAK,KAAO,MACjCA,EAAK,KAAK,CAAC,EAAE,oBACfA,EAAK,KAAK,CAAC,EAAIA,EAAK,KAAK,CAAC,EAAE,SAE1BA,EAAK,KAAK,CAAC,EAAE,oBACfA,EAAK,KAAK,CAAC,EAAIA,EAAK,KAAK,CAAC,EAAE,UAO5BA,EAAK,gBAAkBA,EAAK,KAAO,KAEnCA,EAAK,KAAK,CAAC,EAAE,OAAS,gBACtBA,EAAK,KAAK,CAAC,EAAE,KAAO,eACnBA,EAAK,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,OAAS,gBAAkBA,EAAK,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,OAAS,eAC/E,EACEA,EAAK,KAAK,CAAC,EAAE,OAAS,gBACtBA,EAAK,KAAK,CAAC,EAAE,KAAO,cAEtB,CACA,IAAIumL,EAAO3mH,GAAAA,KAAK,QAAQ,SAAS,IAAK,CAAC5/D,EAAK,KAAK,CAAC,EAAE,KAAK,CAAC,EAAGA,EAAK,KAAK,CAAC,CAAC,CAAC,EAC1EumL,EAAO3mH,GAAI,KAAC,QAAQ,YAAY2mH,CAAI,EACpCvmL,EAAOsgE,GAAK,MAAM,IAAMimH,EAAK,SAAQ,CAAE,CACxC,CAKH,GAAIvmL,EAAK,gBAAkBA,EAAK,KAAO,KACjCA,EAAK,KAAK,CAAC,EAAE,gBAAkBA,EAAK,KAAK,CAAC,EAAE,KAAO,KACjDA,EAAK,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,gBAAkBA,EAAK,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,KAAO,IAAK,CAC1E,MAAMytL,EAAQ7tH,GAAI,KAAC,QAAQ,SAAS,IAAK5/D,EAAK,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,IAAI,EAC5D0tL,EAAQ9tH,GAAAA,KAAK,QAAQ,SAAS,IAAK,CAAC5/D,EAAK,KAAK,CAAC,EAAE,KAAK,CAAC,EAAGA,EAAK,KAAK,CAAC,CAAC,CAAC,EAC7EA,EAAO4/D,GAAI,KAAC,QAAQ,SAAS,IAAK,CAAC6tH,EAAOC,CAAK,CAAC,CACjD,CA4JL,GArJI1tL,EAAK,gBAAkBA,EAAK,KAAO,MACjCkG,EAAO,gBACLlG,EAAK,KAAK,CAAC,EAAE,oBAAmBA,EAAK,KAAK,CAAC,EAAIA,EAAK,KAAK,CAAC,EAAE,SAC5DA,EAAK,KAAK,OAAS,GAAKA,EAAK,KAAK,CAAC,EAAE,oBAAmBA,EAAK,KAAK,CAAC,EAAIA,EAAK,KAAK,CAAC,EAAE,WAEpFA,EAAK,KAAK,CAAC,EAAE,mBAAqBA,EAAK,KAAK,CAAC,EAAE,QAAQ,SAAQ,EAAG,CAAC,IAAM,KAAOA,EAAK,KAAK,CAAC,EAAE,QAAQ,SAAQ,EAAG,CAAC,IAAM,MAAKA,EAAK,KAAK,CAAC,EAAIA,EAAK,KAAK,CAAC,EAAE,SACxJA,EAAK,KAAK,OAAS,GAAKA,EAAK,KAAK,CAAC,EAAE,mBAAqBA,EAAK,KAAK,CAAC,EAAE,QAAQ,SAAU,EAAC,CAAC,IAAM,KAAOA,EAAK,KAAK,CAAC,EAAE,QAAQ,SAAU,EAAC,CAAC,IAAM,MAAKA,EAAK,KAAK,CAAC,EAAIA,EAAK,KAAK,CAAC,EAAE,WAMpLkG,EAAO,QAAUlG,EAAK,gBAAkBA,EAAK,KAAO,KAAOA,EAAK,KAAO,aACrEA,EAAK,KAAK,CAAC,EAAE,SAAQ,IAAO,MAC9BA,EAAOA,EAAK,KAAK,CAAC,GAMlBkG,EAAO,QAAUlG,EAAK,gBAAkBA,EAAK,KAAO,KAAOA,EAAK,KAAO,aAEvEA,EAAK,KAAK,CAAC,EAAE,gBACbA,EAAK,KAAK,CAAC,EAAE,KAAO,KAElBA,EAAK,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,SAAQ,IAAO,MAGtCA,EAAOA,EAAK,KAAK,CAAC,GAMlBkG,EAAO,QAAUlG,EAAK,gBAAkBA,EAAK,KAAO,KAAOqtL,GAAgBrtL,EAAK,KAAK,CAAC,CAAC,EAAE,KAAK,OAAS,iBACrGA,EAAK,KAAK,CAAC,EAAE,SAAQ,IAAO,IAC9BA,EAAOA,EAAK,KAAK,CAAC,EACTA,EAAK,KAAK,CAAC,EAAE,SAAU,IAAK,OACrCA,EAAOsgE,GAAK,MAAM,IAAMtgE,EAAK,KAAK,CAAC,EAAE,UAAU,IAM/CkG,EAAO,QAAUlG,EAAK,gBAAkBA,EAAK,KAAO,MAClDA,EAAK,KAAK,CAAC,EAAE,SAAQ,IAAO,IAC9BA,EAAOA,EAAK,KAAK,CAAC,EACTA,EAAK,KAAK,CAAC,EAAE,SAAU,IAAK,OACrCA,EAAOsgE,GAAK,MAAM,IAAMtgE,EAAK,KAAK,CAAC,EAAE,UAAU,IAQ/CA,EAAK,gBAAkBA,EAAK,KAAO,MACjCA,EAAK,KAAK,CAAC,EAAE,oBAAmBA,EAAK,KAAK,CAAC,EAAIA,EAAK,KAAK,CAAC,EAAE,SAC5DA,EAAK,KAAK,SAAW,GAAKA,EAAK,KAAK,CAAC,EAAE,gBAAkBA,EAAK,KAAK,CAAC,EAAE,MAAQ,IAChFA,EAAK,KAAK,CAAC,EAAI4/D,GAAI,KAAC,QAAQ,YAAY5/D,EAAK,KAAK,CAAC,CAAC,GAElDA,EAAK,KAAK,SAAW,GAAKA,EAAK,KAAK,CAAC,EAAE,gBAAkBA,EAAK,KAAK,CAAC,EAAE,MAAQ,IAChFA,EAAK,KAAK,CAAC,EAAI4/D,GAAI,KAAC,QAAQ,YAAY5/D,EAAK,KAAK,CAAC,CAAC,GAElDA,EAAK,KAAK,SAAW,GAAKA,EAAK,KAAK,CAAC,EAAE,mBAAqBA,EAAK,KAAK,CAAC,EAAE,QAAQ,SAAU,EAAC,CAAC,IAAM,MAAKA,EAAK,KAAK,CAAC,EAAIA,EAAK,KAAK,CAAC,EAAE,SAKtIA,EAAK,KAAO,cAChBA,EAAK,KAAK,CAAC,EAAE,mBACbA,EAAK,KAAK,CAAC,EAAE,QAAQ,iBAEnBA,EAAK,KAAK,CAAC,EAAE,QAAQ,KAAO,KAE1BA,EAAK,KAAK,CAAC,EAAE,QAAQ,KAAO,MAE1B,CAACA,EAAK,KAAK,CAAC,EAAE,QAAQ,KAAK,CAAC,EAAE,gBAE5BA,EAAK,KAAK,CAAC,EAAE,QAAQ,KAAK,CAAC,EAAE,gBAC7BA,EAAK,KAAK,CAAC,EAAE,QAAQ,KAAK,CAAC,EAAE,KAAO,iBAKxCA,EAAK,KAAK,CAAC,EAAIA,EAAK,KAAK,CAAC,EAAE,UAE5BA,EAAK,gBAAkBA,EAAK,KAAO,MACjCA,EAAK,KAAK,CAAC,EAAE,oBAEjB,CAACA,EAAK,KAAK,CAAC,EAAE,QAAQ,gBACrBA,EAAK,KAAK,CAAC,EAAE,QAAQ,gBAAkBA,EAAK,KAAK,CAAC,EAAE,QAAQ,KAAO,KACnEA,EAAK,KAAK,CAAC,EAAE,QAAQ,gBAAkBA,EAAK,KAAK,CAAC,EAAE,QAAQ,KAAO,cAAgBkG,EAAO,kBAGzFlG,EAAK,KAAK,CAAC,EAAIA,EAAK,KAAK,CAAC,EAAE,QAC5BA,EAAK,SAAW,IAEdA,EAAK,KAAK,CAAC,EAAE,oBAEjB,CAACA,EAAK,KAAK,CAAC,EAAE,QAAQ,gBAEpBA,EAAK,KAAK,CAAC,EAAE,QAAQ,gBACrBA,EAAK,KAAK,CAAC,EAAE,QAAQ,KAAO,KAC5B,EACEA,EAAK,KAAK,CAAC,EAAE,QAAQ,KAAK,CAAC,EAAE,OAAS,gBACtCA,EAAK,KAAK,CAAC,EAAE,QAAQ,KAAK,CAAC,EAAE,KAAO,cACpCA,EAAK,KAAK,CAAC,EAAE,QAAQ,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,OAAS,gBAC9C,EAAEA,EAAK,KAAK,CAAC,EAAE,QAAQ,KAAK,CAAC,EAAE,OAAS,gBAAkBA,EAAK,KAAK,CAAC,EAAE,QAAQ,KAAK,CAAC,EAAE,KAAO,kBAIhGA,EAAK,KAAK,CAAC,EAAIA,EAAK,KAAK,CAAC,EAAE,QAC5BA,EAAK,SAAW,KAGhBA,EAAK,OAAS,gBAAkBA,EAAK,KAAO,KAC1CA,EAAK,KAAK,CAAC,EAAE,WAAW,CAAC,IAAM,MACjCA,EAAK,KAAK,CAAC,EAAI4/D,GAAI,KAAC,QAAQ,YAAY5/D,EAAK,KAAK,CAAC,CAAC,GAMpDA,EAAK,gBAAkBA,EAAK,KAAO,OAChCA,EAAK,KAAK,CAAC,EAAE,mBAAqBA,EAAK,KAAK,CAAC,EAAE,eAAiB,CAAEstL,GAAettL,EAAK,KAAK,CAAC,CAAC,EAAE,KAAK,eAAeA,EAAK,SAAW,IACpIA,EAAK,KAAK,CAAC,EAAE,gBAAkBA,EAAK,KAAK,CAAC,EAAE,KAAO,KAAOA,EAAK,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,eAAcA,EAAK,SAAW,KAE/GA,EAAK,gBAAkBA,EAAK,KAAO,MACjCA,EAAK,KAAK,CAAC,EAAE,iBAAgBA,EAAK,SAAW,IAC7CA,EAAK,KAAK,CAAC,EAAE,gBAAkBA,EAAK,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,iBAAgBA,EAAK,SAAW,IACpFA,EAAK,KAAK,CAAC,EAAE,gBAAkBA,EAAK,KAAK,CAAC,EAAE,KAAO,MAAKA,EAAK,SAAW,IACxEA,EAAK,KAAK,CAAC,EAAE,gBAAkBA,EAAK,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,gBAAkBA,EAAK,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,KAAO,MAAKA,EAAK,SAAW,IACvHA,EAAK,KAAK,CAAC,EAAE,mBAAqBA,EAAK,KAAK,CAAC,EAAE,QAAQ,gBAAkBA,EAAK,KAAK,CAAC,EAAE,QAAQ,KAAO,eAAcA,EAAK,SAAW,KAGvIA,EAAK,mBACLA,EAAK,QAAQ,iBAERA,EAAK,QAAQ,KAAO,KAAOA,EAAK,QAAQ,KAAO,MAC/CA,EAAK,QAAQ,SAAU,EAAC,CAAC,IAAM,MAGpCA,EAAOA,EAAK,SAEVA,EAAK,mBAAqBA,EAAK,QAAQ,gBAAkBA,EAAK,QAAQ,KAAO,MAAKA,EAAOA,EAAK,SAC9FA,EAAK,gBAAkBA,EAAK,KAAO,cAAgBA,EAAK,KAAK,CAAC,EAAE,mBAAqBA,EAAK,KAAK,CAAC,EAAE,QAAQ,gBAAkBA,EAAK,KAAK,CAAC,EAAE,QAAQ,KAAO,MAAKA,EAAK,KAAK,CAAC,EAAIA,EAAK,KAAK,CAAC,EAAE,SACzLA,EAAK,gBAAkBA,EAAK,KAAO,cAAgBA,EAAK,KAAK,CAAC,EAAE,gBAAkBA,EAAK,KAAK,CAAC,EAAE,KAAO,MAAKA,EAAO4/D,GAAI,KAAC,QAAQ,SAAS,IAAK,CAAC4sG,GAAQ,SAAC,OAAOxsK,EAAK,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC,EAAGA,EAAK,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAG5MA,EAAK,gBAAkBA,EAAK,KAAO,IAAK,CACxC,MAAMwkL,EAAY6I,GAAgBrtL,EAAK,KAAK,CAAC,CAAC,EAE5CwkL,EAAU,KAAK,OAAS,gBACxBA,EAAU,KAAO,MACfxkL,EAAK,SAAW,GACrB,CACD,OAAOwtL,GAAcxtL,EAAM2wD,EAAQu9G,EAAShoK,CAAM,CACtD,KACI,QAAOlG,CAEX,CAIA,SAAS2tL,GAAwB3tL,EAAM,CACrC,OAAAA,EAAOA,EAAK,UACV,SAAUA,EAAM,CACd,OAAIA,EAAK,OAAS,eACTsgE,GAAK,MAAMtgE,EAAK,MAAM,SAAQ,CAAE,EAElCA,CACR,CACF,EACMA,CACT,CAcO,SAAS4tL,GAAO5tL,EAAMkG,EAAS,CAAE,OAAQ,GAAM,OAAQ,GAAM,eAAgB,GAAM,UAAW,MAAS,EAAI,CAChHA,EAAS,OAAO,OAAO,CAAE,OAAQ,GAAM,OAAQ,GAAM,eAAgB,EAAI,EAAIA,CAAM,EAEnF,IAAI0iL,EACAK,EAAQ,CAAE,EACd,MAAM8C,EAAc,CAAC,IAAK,IAAK,IAAK,KAAM,IAAI,EAC9C,GAAI,OAAO/rL,GAAS,SAAU,CAC5B,QAASrD,EAAI,EAAGA,EAAIovL,EAAY,OAAQpvL,IACtCssL,EAAQjpL,EAAK,MAAM+rL,EAAYpvL,CAAC,CAAC,EAC7BssL,EAAM,OAAS,IACjBL,EAAamD,EAAYpvL,CAAC,GAG1BisL,IAAe,OACjBK,EAAQjpL,EAAK,MAAM4oL,CAAU,EAEzB1iL,EAAO,YAAc,OACvBlG,EAAOsgE,GAAK,MAAMtgE,CAAI,EAEtBA,EAAOsgE,GAAK,MAAMutH,GAAe7tL,EAAMkG,EAAO,SAAS,CAAC,CAGhE,MAOIlG,EAAO2tL,GAAuB3tL,CAAI,EAElCA,EAAOsgE,GAAK,MAAMA,GAAK,OAAOtgE,EAAM,CAAE,SAAU,OAAO,CAAE,CAAC,EAO5D,GAAIipL,EAAM,OAAS,EAAG,CACpB,MAAM6E,EAAU,CAAE,EAClB,QAASnxL,EAAI,EAAGA,EAAIssL,EAAM,OAAQtsL,IAChCmxL,EAAQ,KAAKF,GAAM3E,EAAMtsL,CAAC,EAAGuJ,CAAM,CAAC,EAEtC,OAAO4nL,EAAQ,KAAKlF,EAAW,WAAW,KAAM,YAAY,EAAE,WAAW,KAAM,YAAY,CAAC,CAC7F,CACD,IAAImF,EACJ,GACEA,EAAY/tL,EAAK,UAAW,EAC5BA,EAAOA,EAAK,UACV,SAAUA,EAAMkC,EAAMyuD,EAAQ,CAC5B,OAAA3wD,EAAOwtL,GAAcxtL,EAAM2wD,EAAQ,OAAWzqD,CAAM,EAC7ClG,CACR,CACF,QACMA,EAAK,SAAQ,IAAO+tL,EAAU,SAAQ,GAE/C,IAAIpb,EAAU3yK,EAAK,MAAM,CAAE,SAAU,OAAQ,YAAa,OAAQ,SAAU,OAAO,CAAE,EAAE,WAAW,SAAU,UAAU,EAAE,WAAW,IAAK,KAAK,EAAE,WAAW,SAAU,SAAS,EAE7K,OAAA2yK,EAAUA,EAAQ,QAAQ,mBAAoB,KAAK,EAGnDA,EAAUA,EAAQ,WAAW,WAAY,EAAE,EAE3CA,EAAUA,EAAQ,WAAW,IAAK,EAAE,EAChC3yK,EAAK,gBAAkBA,EAAK,QAAU,SAAW2yK,EAAU,IACxDA,CACT,CAEO,SAASqb,IAAUhuL,EAAMkG,EAAS,CAAE,OAAQ,GAAM,OAAQ,GAAM,eAAgB,GAAM,UAAW,MAAS,EAAI,CACnHA,EAAS,OAAO,OAAO,CAAE,OAAQ,GAAM,OAAQ,GAAM,eAAgB,EAAI,EAAIA,CAAM,EAEnF,IAAI0iL,EACAK,EAAQ,CAAE,EACd,MAAM8C,EAAc,CAAC,IAAK,IAAK,IAAK,KAAM,IAAI,EAC9C,GAAI,OAAO/rL,GAAS,SAAU,CAC5B,QAASrD,EAAI,EAAGA,EAAIovL,EAAY,OAAQpvL,IACtCssL,EAAQjpL,EAAK,MAAM+rL,EAAYpvL,CAAC,CAAC,EAC7BssL,EAAM,OAAS,IACjBL,EAAamD,EAAYpvL,CAAC,GAG1BisL,IAAe,OACjBK,EAAQjpL,EAAK,MAAM4oL,CAAU,EAEzB1iL,EAAO,YAAc,OACvBlG,EAAOsgE,GAAK,MAAMtgE,EAAK,SAAQ,CAAE,EAEjCA,EAAOsgE,GAAK,MAAMutH,GAAe7tL,EAAMkG,EAAO,SAAS,CAAC,CAGhE,MAOIlG,EAAO2tL,GAAuB3tL,CAAI,EAClCA,EAAOsgE,GAAK,MAAMtgE,EAAK,SAAS,CAAE,YAAa,KAAK,CAAE,CAAC,EAOzD,GAAIipL,EAAM,OAAS,EAAG,CACpB,MAAM6E,EAAU,CAAE,EAClB,QAASnxL,EAAI,EAAGA,EAAIssL,EAAM,OAAQtsL,IAChCmxL,EAAQ,KAAKF,GAAM3E,EAAMtsL,CAAC,EAAGuJ,CAAM,CAAC,EAEtC,OAAO4nL,EAAQ,KAAKlF,EAAW,WAAW,KAAM,YAAY,EAAE,WAAW,KAAM,YAAY,CAAC,CAC7F,CACD,IAAImF,EACJ,GACEA,EAAY/tL,EAAK,UAAW,EAC5BA,EAAOA,EAAK,UACV,SAAUA,EAAMkC,EAAMyuD,EAAQ,CAC5B,OAAA3wD,EAAOwtL,GAAcxtL,EAAM2wD,EAAQ,OAAWzqD,CAAM,EAC7ClG,CACR,CACF,QACMA,EAAK,SAAQ,IAAO+tL,EAAU,SAAQ,GAG/C,OAAO/tL,EAAK,SAAS,CAAE,SAAU,OAAQ,YAAa,OAAQ,EAAE,QAAQ,mBAAoB,KAAK,CACnG,CAEO,SAASiuL,GAAqBz/G,EAAa,kBAAmB0/G,EAAe,CAAE,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAE,EAAI,CAE/G,OAAO5tH,GAAK,SAASkO,EAAY,CAAC,CAAE,EAAG,MAAO,EAAG,GAAK,EAAE,CAAE,EAAG,OAAQ,EAAG,IAAI,EAAI,CAAE,EAAG,MAAO,EAAG,GAAG,EAAI,CAAE,EAAG,MAAO,EAAG,GAAK,EAAE,CAAE,EAAG,MAAO,EAAG,GAAG,EAAI,CAAE,EAAG,MAAO,EAAG,GAAG,CAAE,EAAG0/G,CAAY,CACvL,CAEO,SAASL,GAAgBr/G,EAAa,kBAAmB0/G,EAAe,CAAE,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAE,EAAI,CAE1G,MAAMC,EAAwB,OAAO,OAAO,CAAA,EAAIC,GAAcF,CAAY,CAAC,EAC3E,UAAW3gK,KAAK,OAAO,KAAK4gK,CAAqB,EAC3C,OAAOA,EAAsB5gK,CAAC,GAAM,WACtC4gK,EAAsB5gK,CAAC,EAAI4gK,EAAsB5gK,CAAC,EAAE,QAAS,GAGjE,OAAOggK,IAAgB/+G,EAAY2/G,CAAqB,EAAE,SAAS,CAAE,YAAa,OAAQ,CAE5F,CAoBO,SAASC,GAAe3iE,EAAY,CAAE,EAAG,GAAM,EAAG,GAAM,EAAG,GAAM,EAAG,IAAQvlH,EAAS,CAAE,QAAS,GAAM,OAAQ,GAAO,KAAM,UAAY,CAE5Io6D,GAAK,OAAO,CAAE,WAAYF,GAAQ,MAAM,CAAE,EAE1C,MAAM8tH,EAAe,CAAE,EAEvB,IAAIG,EAAM,EAGNpkL,EAAO,GACX,EAAG,CACDokL,IACA,UAAW9gK,KAAK,OAAO,KAAKk+F,CAAS,EACnC,OAAQ,OAAOA,EAAUl+F,CAAC,EAAC,CACzB,IAAK,SACH,MACF,IAAK,UACH2gK,EAAa3gK,CAAC,EAAI+yC,GAAK,SACrBA,GAAK,SACH,2CACA,CAAE,EAAGmrD,EAAUl+F,CAAC,CAAG,CACpB,CACF,EACD,MACF,IAAK,SACCrnB,EAAO,OAAS,UAAWgoL,EAAa3gK,CAAC,EAAI+yC,GAAK,UAAUmrD,EAAUl+F,CAAC,CAAC,EACvE2gK,EAAa3gK,CAAC,EAAI+yC,GAAK,SAASmrD,EAAUl+F,CAAC,CAAC,EACjD,MACF,IAAK,SAGH,GAAI,CACErnB,EAAO,OAAS,WAClBo6D,GAAK,OAAO,CAAE,OAAQ,WAAW,CAAE,EACnC4tH,EAAa3gK,CAAC,EAAI+yC,GAAK,SAASmrD,EAAUl+F,CAAC,EAAG2gK,CAAY,EAC1D5tH,GAAK,OAAO,CAAE,OAAQ,QAAQ,CAAE,GACvBp6D,EAAO,OAAS,YACzBo6D,GAAK,OAAO,CAAE,OAAQ,UAAU,CAAE,EAClC4tH,EAAa3gK,CAAC,EAAI+yC,GAAK,SAASmrD,EAAUl+F,CAAC,EAAG2gK,CAAY,EAC1D5tH,GAAK,OAAO,CAAE,OAAQ,QAAQ,CAAE,GAEhC4tH,EAAa3gK,CAAC,EAAI+yC,GAAK,SAASmrD,EAAUl+F,CAAC,EAAG2gK,CAAY,CAExE,MAAkB,CACN,GAAI,CACEhoL,EAAO,OAAS,UAAWgoL,EAAa3gK,CAAC,EAAI+yC,GAAK,UAAUA,GAAK,SAASmrD,EAAUl+F,CAAC,EAAG2gK,CAAY,CAAC,EACpGA,EAAa3gK,CAAC,EAAI+yC,GAAK,SAASA,GAAK,SAASmrD,EAAUl+F,CAAC,EAAG2gK,CAAY,CAAC,CAC5F,MAAoB,CACN,MAAMhtL,EAAS,OAAO,OAAO,CAAA,EAAIgtL,CAAY,EAC7C,UAAW3gK,KAAK,OAAO,KAAKrsB,CAAM,EAChCA,EAAOqsB,CAAC,EAAIrsB,EAAOqsB,CAAC,EAAE,QAAS,EAE7BrnB,EAAO,OAAS,WAClBo6D,GAAK,OAAO,CAAE,OAAQ,WAAW,CAAE,EACnC4tH,EAAa3gK,CAAC,EAAI+yC,GAAK,SAASmrD,EAAUl+F,CAAC,EAAGrsB,CAAM,EACpDo/D,GAAK,OAAO,CAAE,OAAQ,QAAQ,CAAE,GAC3B4tH,EAAa3gK,CAAC,EAAI+yC,GAAK,SAASmrD,EAAUl+F,CAAC,EAAGrsB,CAAM,CAC5D,CACF,CACD,KACH,CAGCuqH,EAAU,OAAS,SAAWxhH,EAAOq2D,GAAK,SAASmrD,EAAU,KAAMyiE,CAAY,EACvF,OAAW,CAACjkL,GAAQokL,EAAM,KAExB,GADIA,IAAQ,KAAM,OAAO,OAAO;AAAA;AAAA,uCAAkG,EAC9HnoL,EAAO,QACT,UAAWqnB,KAAK,OAAO,KAAK2gK,CAAY,EAClC,OAAOA,EAAa3gK,CAAC,GAAM,WACvB2gK,EAAa3gK,CAAC,YAAazJ,KAAUoqK,EAAa3gK,CAAC,EAAI2gK,EAAa3gK,CAAC,EAAE,QAAS,IAI5F,GAAIrnB,EAAO,OACT,UAAWqnB,KAAK,OAAO,KAAK2gK,CAAY,EACtCA,EAAa3gK,CAAC,EAAI+gK,GAAWJ,EAAa3gK,CAAC,CAAC,EAGhD,OAAO2gK,CACT,CAKO,SAASK,GAAiBhgB,EAAON,EAAa,CAAA,EAAI94J,EAAS,CAAA,EAAI,CACpE,OAAAo5J,EAAM,QAAQ,SAAUxtJ,EAAM,CAC5B,GAAIktJ,EAAW,SAAW,EACxB,OAAIltJ,EAAK,SAAS,SAAW,GAAG5L,EAAO,KAAK4L,CAAI,EACzCwtK,GAAgBxtK,EAAK,SAAUktJ,EAAY94J,CAAM,EAGxD,GADAA,EAAO,KAAK4L,CAAI,EACZktJ,EAAW,KAAKnuK,GAAKihB,EAAK,aAAejhB,CAAC,EAC5C,OAAOyuL,GAAgBxtK,EAAK,SAAUktJ,EAAY94J,CAAM,CAGhE,CAAG,EACMA,CACT,CAOO,SAASq5K,GAAUhgH,EAAYtoE,EAAQ,CAC5CA,EAAS,OAAO,OAAO,CAAE,QAAS,GAAO,SAAU,GAAI,SAAU,GAAO,MAAO,GAAO,KAAM,OAAW,OAAQ,EAAM,EAAEA,CAAM,EAezHA,EAAO,YAAc,SAAWsoE,EAAaq/G,GAAer/G,EAAYtoE,EAAO,SAAS,GAC5F,MAAMuoL,EAAkBb,GAAMp/G,EAAYtoE,CAAM,EAC1CqoK,EAAQroK,EAAO,SAAWqoL,GAAgBhG,GAAkB,mBAAC/5G,CAAU,CAAC,EAAI+5G,GAAkB,mBAAC/5G,CAAU,EACzGkgH,EAAkB,CAAE,EAEpBC,EAAW,CAAE,EAyCnB,GAxCApgB,EAAM,QAAQ,SAAUxtJ,EAAMpkB,EAAG,CAC/B,MAAMuxK,EAAUntJ,EAAK,UAAY,KAAO6sK,GAAM7sK,EAAK,QAAS7a,CAAM,EAAI,GAChEwgH,EAAUknE,GAAM7sK,EAAK,QAAS7a,CAAM,EAE1C,GADIwgH,IAAYwnD,GAASwgB,EAAgB,IAAK,EAC1CxoL,EAAO,QAAS,CAClB,MAAM0oL,EAAUC,GAAY9tK,EAAM7a,EAAO,QAAQ,EAGjDyoL,EAAS,KAAKC,CAAO,EACjBF,EAAgB,SAAW,GAAK/xL,IAAM4xK,EAAM,OAAS,EACnDroK,EAAO,OAAS,OAClBwoL,EAAgB,KAAK,GAAGD,CAAe,KAAK/nE,CAAO,KAAKkoE,CAAO,EAAE,EAE7DF,EAAgB,SAAW,GAC7BA,EAAgB,KAAK,GAAGxoL,EAAO,IAAI,KAAKuoL,CAAe,KAAKG,CAAO,EAAE,EACrEF,EAAgB,KAAK,KAAKhoE,CAAO,KAAKkoE,CAAO,EAAE,GAE/CF,EAAgB,KAAK,GAAGxoL,EAAO,IAAI,KAAKwgH,CAAO,KAAKkoE,CAAO,EAAE,EAIjEF,EAAgB,KAAK,KAAKhoE,CAAO,KAAKkoE,CAAO,EAAE,CAEvD,MACUF,EAAgB,SAAW,GAAK/xL,IAAM4xK,EAAM,OAAS,EACnDroK,EAAO,OAAS,OAClBwoL,EAAgB,KAAK,GAAGD,CAAe,KAAK/nE,CAAO,EAAE,EAEjDgoE,EAAgB,SAAW,GAC7BA,EAAgB,KAAK,GAAGxoL,EAAO,IAAI,KAAKuoL,CAAe,EAAE,EACzDC,EAAgB,KAAK,KAAKhoE,CAAO,EAAE,GAEnCgoE,EAAgB,KAAK,GAAGxoL,EAAO,IAAI,KAAKwgH,CAAO,EAAE,EAIrDgoE,EAAgB,KAAK,KAAKhoE,CAAO,EAAE,CAG3C,CAAG,EACGxgH,EAAO,QAAU,IAAQqoK,EAAMA,EAAM,OAAS,CAAC,EAAE,QAAQ,OAAS,gBACtEA,EAAMA,EAAM,OAAS,CAAC,EAAE,QAAQ,KAAO,KACvCA,EAAMA,EAAM,OAAS,CAAC,EAAE,QAAQ,KAAK,CAAC,EAAE,OAAS,gBACjDA,EAAMA,EAAM,OAAS,CAAC,EAAE,QAAQ,KAAK,CAAC,EAAE,OAAS,iBAE/C,KAAK,IAAIA,EAAMA,EAAM,OAAS,CAAC,EAAE,QAAQ,KAAK,CAAC,EAAE,KAAK,EAAIA,EAAMA,EAAM,OAAS,CAAC,EAAE,QAAQ,KAAK,CAAC,EAAE,OAClGA,EAAMA,EAAM,OAAS,CAAC,EAAE,QAAQ,KAAK,CAAC,EAAE,MAAQ,GAEhD,CACA,MAAMugB,EAAOvgB,EAAMA,EAAM,OAAS,CAAC,EAAE,QAAQ,KAAK,CAAC,EAAE,MAAQ,EAAI,IAAM,IACvEmgB,EAAgB,KACd,KAAOd,GACLttH,GAAK,MACHA,GAAK,SACHiuG,EAAMA,EAAM,OAAS,CAAC,EAAE,QAAQ,KAAK,CAAC,EAAE,MACxCA,EAAMA,EAAM,OAAS,CAAC,EAAE,QAAQ,KAAK,CAAC,EAAE,KACzC,EAAC,WAAW,EAAI,EAAE,QAAQ,IAAKugB,CAAI,CAC9C,EAAW5oL,CACJ,CACF,CACF,CACD,MAAM6oL,EAAQ,aAAaN,CAAe,KACpCO,EAAY;AAAA,EAAsBN,EAAgB,KAAK;AAAA,CAAQ,CAAC;AAAA,iBACtE,MAAO,CAAE,OAAQngB,EAAM,OAAS,EAAIA,EAAMA,EAAM,OAAS,CAAC,EAAE,QAAQ,SAAQ,EAAKkgB,EAAiB,YAAalgB,EAAM,OAAS,EAAIqf,GAAMrf,EAAMA,EAAM,OAAS,CAAC,EAAE,QAASroK,EAAO,KAAK,EAAIuoL,EAAiB,QAASC,EAAgB,OAAQ,WAAYK,EAAQC,EAAW,MAAAD,EAAO,UAAAC,EAAW,WAAYN,EAAiB,MAAAngB,EAAO,aAAcogB,EAAU,gBAAiBF,EAAiB,KAAMvoL,EAAO,IAAM,CAC/Y,CAEO,SAAS+oL,IAAcvf,EAAW,cAAejkD,EAAY,CAAE,EAAG,GAAO,EAAG,GAAO,EAAG,GAAO,EAAG,GAAO,KAAM,aAAe,EAAEvF,EAAQ,GAAO,CAClJ,MAAM6lE,EAAc,CAAC,KAAM,KAAM,IAAK,IAAK,GAAG,EACxCmC,EAAeE,GAAc3iE,EAAWvF,CAAK,EACnD,UAAW34F,KAAK,OAAO,KAAK2gK,CAAY,EACtCA,EAAa3gK,CAAC,EAAI+yC,GAAK,OAAO4tH,EAAa3gK,CAAC,CAAC,EAE/C,IAAIq7J,EACAK,EACJ,QAAStsL,EAAI,EAAGA,EAAIovL,EAAY,OAAQpvL,IAAK,CAC3C,MAAMuyL,EAAmBnD,EAAYpvL,CAAC,EACtCssL,EAAQvZ,EAAS,MAAMwf,CAAgB,EACnCjG,EAAM,SAAW,IACnBL,EAAasG,EAEhB,CACDjG,EAAQvZ,EAAS,MAAMkZ,CAAU,EACjC,MAAMD,EAAWsF,GAAoBhF,EAAM,CAAC,EAAGiF,CAAmB,EAAE,SAAU,EACxE78G,EAAY48G,GAAoBhF,EAAM,CAAC,EAAGiF,CAAmB,EAAE,SAAU,EAC/E,OAAIhoE,GACF,QAAQ,IAAI,yBAA0B,GAAGyiE,CAAQ,GAAGC,CAAU,GAAGv3G,CAAS,EAAE,EAEvE,GAAGs3G,CAAQ,GAAGC,CAAU,GAAGv3G,CAAS,EAC7C,CAEO,SAAS89G,IAAkBzf,EAAW,gBAAiBxpD,EAAQ,GAAO,CAC3E,MAAM6lE,EAAc,CAAC,KAAM,KAAM,IAAK,IAAK,GAAG,EAC9C,IAAInD,EACAK,EACJ,QAAStsL,EAAI,EAAGA,EAAIovL,EAAY,OAAQpvL,IAAK,CAC3C,MAAMuyL,EAAmBnD,EAAYpvL,CAAC,EACtCssL,EAAQvZ,EAAS,MAAMwf,CAAgB,EACnCjG,EAAM,SAAW,IACnBL,EAAasG,EAEhB,CACDjG,EAAQvZ,EAAS,MAAMkZ,CAAU,EAEjC,IAAIwG,EACJ,MAAM7gB,EAAQyd,GAAa,cAACtc,CAAQ,EAChCxpD,IACF,QAAQ,IAAI,WAAW,EACvB,QAAQ,IAAIqoD,CAAK,GAEnB,MAAM8gB,EAAmB,CAAE,EAC3B,IAAIC,EAAa,EACjB/gB,EAAM,QAAQ,SAAUxtJ,EAAMpkB,EAAG,CAC/B,MAAM4yL,EAAaxuK,EAAK,WACpBA,EAAK,cAAgB,OACnBA,EAAK,YAAY,SAAS,SAAU,IAAKA,EAAK,YAAY,SAAS,SAAQ,GAAMA,EAAK,YAAY,UAAU,SAAU,IAAKA,EAAK,YAAY,UAAU,WACpJwuK,IAAe,wBAAuBD,GAAcA,EAAa,GAAK,GAE1EA,EAAa,GAGjB,MAAME,EAAczuK,EAAK,cAAgB,KAAO6sK,GAAM7sK,EAAK,YAAY,QAAQ,EAAI,GACnF,IAAI0uK,EAAc7B,GAAM7sK,EAAK,YAAY,QAAQ,EACjD,MAAM2uK,EAAe3uK,EAAK,cAAgB,KAAO6sK,GAAM7sK,EAAK,YAAY,SAAS,EAAI,GACrF,IAAI4uK,EAAe/B,GAAM7sK,EAAK,YAAY,SAAS,EAK/CmlG,IACF,QAAQ,IAAIqpE,CAAU,EACtB,QAAQ,IAAIE,EAAY,SAAU,EAAG1uK,EAAK,YAAY,WAAa4uK,EAAa,UAAU,GAExFhzL,IAAM,IACRyyL,EAAgB,GAAGI,CAAW,GAAGzuK,EAAK,YAAY,UAAU,GAAG2uK,CAAY,IAE7E,MAAME,EAAQN,IAAe,EAAI,QAAU,MAC3CG,EAAc,YAAYG,CAAK,IAAIH,EAAY,QAAQD,EAAa,kBAAkBA,CAAW,GAAG,CAAC,IACrGG,EAAe,YAAYC,CAAK,IAAID,EAAa,QAAQD,EAAc,kBAAkBA,CAAY,GAAG,CAAC,IACrGxpE,GAAO,QAAQ,IAAIupE,EAAc1uK,EAAK,YAAY,WAAa4uK,CAAY,EAC/E,MAAME,EAAajD,GAAkB7rK,CAAI,EAAE,OAAS,EAAI6sK,GAAMttH,GAAK,MAAMssH,GAAkB7rK,CAAI,EAAE,CAAC,EAAE,SAAQ,EAAI,CAAE,YAAa,OAAQ,CAAC,EAAI,GAC5I,IAAI+uK,EAAe,CACjB,oCAAqC,OAAO,+CAC5C,yBAA0B,OAAO,wBAAwBD,CAAU,0BACnE,kBAAmB,OAAO,qBAAqBA,CAAU,0BACzD,uBAAwB,OAAO,0CAA0CA,CAAU,GACnF,uBAAwB,OAAO,uCAAuCA,CAAU,GAChF,wCAAyC,OAAO,0CAA0CA,CAAU,EACrG,EACG3pE,IACF4pE,EAAe,OAAO,OAAOA,EAAc,CACzC,mBAAoB,OAAO,iCAC3B,kBAAmB,OAAO,gCAC1B,WAAY,OAAO,yBACnB,oBAAqB,OAAO,2CAC5B,mBAAoB,OAAO,2CAC3B,+BAAgC,OAAO,2DACvC,oBAAqB,OAAO,gCAC5B,kBAAmB,OAAO,oCAC1B,mCAAoC,OAAO,8CAC3C,mBAAoB,OAAO,8BAC3B,WAAY,OAAO,sCACnB,eAAgB,OAAO,qCACvB,WAAY,OAAO,4CACnB,eAAgB,OAAO,gCACvB,iBAAkB,OAAO,oCACzB,cAAe,OAAO,sCACtB,kBAAmB,OAAO,iCAC1B,aAAc,OAAO,+BACrB,0BAA2B,OAAO,4CAC1C,CAAO,GAECA,EAAaP,CAAU,IAAM,SAAWO,EAAaP,CAAU,EAAI,IACnED,IAAe,GACjBA,EAAa,EACbD,EAAiB,IAAK,EAClBE,IAAe,sBAAsBF,EAAiB,KAAK,OAAO,MAAMI,CAAW,IAAI1uK,EAAK,YAAY,UAAU,GAAG4uK,CAAY,KAAKG,EAAaP,CAAU,CAAC,EAAE,GAEhKA,IAAe,sBAAsBF,EAAiB,KAAK,OAAO,MAAMI,CAAW,IAAI1uK,EAAK,YAAY,UAAU,GAAG4uK,CAAY,KAAKG,EAAaP,CAAU,CAAC,EAAE,EAElKrpE,GAAO,QAAQ,IAAI,aAAc4pE,EAAaP,CAAU,CAAC,CACjE,CAAG,EACD,IAAIR,EAAQ,OAAO,gBAAgBK,CAAa,IAChD,MAAMJ,EAAY,OAAO;AAAA;AAAA,IAEvBK,EAAiB,KAAK,MAAM,CAAC;AAAA;AAAA,IAG/B,OAAInpE,IAAO6oE,EAAQC,GACZ,CAAE,MAAAD,EAAO,UAAAC,EAAW,SAAUI,CAAe,CACtD,CAEO,SAASP,GAAa9tK,EAAM4tK,EAAU,CAC3C,MAAMY,EAAaxuK,EAAK,WAClB8uK,EAAa9uK,EAAK,WAElBgvK,EAAkB,CACtB,uBAAwB,8BAA8BF,CAAU,KAChE,oCAAqC,+BACrC,yBAA0B,aAAaA,CAAU,sBACjD,kBAAmB,QAAQA,CAAU,mBACrC,uBAAwB,4BAA4BA,CAAU,KAC9D,uBAAwB,0BAA0BA,CAAU,KAC5D,wCAAyC,0BAA0BA,CAAU,KAC7E,WAAY,qBACZ,mBAAoB,qBACpB,kBAAmB,oBACnB,WAAY,gBACZ,oBAAqB,2BACrB,mBAAoB,sBACpB,+BAAgC,+CAChC,oBAAqB,0BACrB,kBAAmB,uBACnB,mCAAoC,oCACpC,mBAAoB,gBACpB,eAAgB,sBAChB,WAAY,wBACZ,eAAgB,iBAChB,iBAAkB,oBAClB,cAAe,iBACf,kBAAmB,uBACnB,aAAc,gBACd,0BAA2B,gCAC3B,mBAAoB,iBACpB,sBAAuB,0BACvB,oBAAqB,kBACrB,6BAA8B,kBAC9B,mBAAoB,4BACpB,oBAAqB,aACrB,mBAAoB,sBACpB,eAAgB,sBAChB,uBAAwB,sBACxB,mBAAoB,sBACpB,SAAU,oCACV,WAAY,oBACZ,mBAAoB,yBACrB,EACD,OAAAlB,EAAW,OAAO,OAAOoB,EAAiBpB,CAAQ,EAC1CA,EAASY,CAAU,IAAM,OAAa,UAAUZ,EAASY,CAAU,EAAE,WAAW,eAAgB,IAAIM,CAAU,GAAG,CAAC,IAAM,EAClI,CAOO,SAAShrK,IAAWvjB,EAAO,CAChC,IAAIyhB,EACJ,OAAI,OAAOzhB,GAAU,SACnByhB,EAAIu9C,GAAK,SAASh/D,CAAK,EACd,OAAOA,GAAU,SAC1ByhB,EAAIu9C,GAAK,SAASh/D,EAAM,WAAW,IAAK,EAAE,CAAC,EAE3CyhB,EAAIzhB,EAAM,MAAO,EAEZyhB,EAAE,IAAM,GAAK,CAACitK,GAA6BjtK,EAAE,CAAC,EAAE,KAAKjjB,GAAKA,IAAM,GAAKA,IAAM,CAAC,CACrF,CAOA,SAASmwL,GAAqBjwL,EAAM,CAClC,IAAImV,EAAS,GACb,OAAAnV,EAAK,SAASF,GAAK,CAAMA,EAAE,eAAcqV,EAAS,IAAM,EACjDA,CACT,CAgBO,SAAS+6K,IAAUxgB,EAAUxpK,EAAQ,CAQ1CA,EAAS,OAAO,OAAO,CAAE,QAAS,GAAO,MAAO,MAAO,SAAU,CAAE,EAAE,YAAa,GAAM,eAAgB,EAAG,SAAU,GAAO,WAAY,CAAA,EAAI,gBAAiB,GAAO,cAAe,EAAK,EAAIA,CAAM,EAI9LA,EAAO,YAAc,SAAWwpK,EAAWuf,IAAavf,EAAUxpK,EAAO,SAAS,GACtF,IAAIiqL,EACA5hB,EAAQroK,EAAO,SAAWqoL,GAAgBvC,GAAa,cAACtc,CAAQ,EAAGxpK,EAAO,UAAU,EAAI8lL,GAAAA,cAActc,CAAQ,EAE9G0gB,EAAW,CAAE,EACjB,GAAIlqL,EAAO,iBAAmBqoK,EAAM,CAAC,EAAE,YAAY,aAAe,IAAK,CACrE,IAAI5xK,EAAI,EACR,EAAG,CACD,MAAMgsL,EAAWpa,EAAM5xK,CAAC,EAAE,YAAY,SAAS,UAAW,EACpD00E,EAAYk9F,EAAM5xK,CAAC,EAAE,YAAY,UAAU,UAAW,EAC5D,GAAIgsL,EAAS,gBAAkBA,EAAS,KAAO,UAAYsH,GAAoBtH,EAAS,KAAK,CAAC,CAAC,GAC7F,GAAIt3G,EAAU,gBAAkBA,EAAU,KAAO,SAAU,CACzDk9F,EAAM5xK,CAAC,EAAE,YAAY,UAAY,IAAI2jE,GAAK,aAAa,IAAK,WAAY,CAACqoH,EAAS,KAAK,CAAC,EAAGt3G,EAAU,KAAK,CAAC,CAAC,CAAC,EAC7Gk9F,EAAM5xK,CAAC,EAAE,YAAY,SAAW,IAAI2jE,GAAK,aAAa,IAAK,WAAY,CAAC+Q,EAAU,KAAK,CAAC,EAAGs3G,EAAS,KAAK,CAAC,CAAC,CAAC,EAC5Gpa,EAAM5xK,CAAC,EAAE,WAAa,yBACtB,MAAM0zL,EAAc,CAAE,EAClBJ,GAAoBtH,EAAS,KAAK,CAAC,CAAC,GAAG0H,EAAY,KAAKzC,GAAMjF,EAAS,KAAK,CAAC,EAAE,SAAQ,CAAE,EAAI,SAAS,EACtGsH,GAAoB5+G,EAAU,KAAK,CAAC,CAAC,GAAGg/G,EAAY,KAAKzC,GAAMv8G,EAAU,KAAK,CAAC,EAAE,SAAQ,CAAE,EAAI,SAAS,EAC5Gk9F,EAAM5xK,CAAC,EAAE,WAAa0zL,EAAY,KAAK,cAAc,EACrD,MAAMjH,EAAc7a,EAAM5xK,CAAC,EAAE,YAAY,MAAO,EAChDyzL,EAAWlqL,EAAO,SAAWqoL,GAAgBvC,GAAa,cAAC5C,CAAW,EAAGljL,EAAO,UAAU,EAAI8lL,GAAAA,cAAc5C,CAAW,EACvH7a,EAAQA,EAAM,MAAM,EAAG5xK,EAAI,CAAC,EAAE,OAAOyzL,CAAQ,CAC9C,UACQ/+G,EAAU,gBAAkBA,EAAU,KAAO,UAAY4+G,GAAoB5+G,EAAU,KAAK,CAAC,CAAC,GACnGs3G,EAAS,gBAAkBA,EAAS,KAAO,SAAU,CACvDpa,EAAM5xK,CAAC,EAAE,YAAY,UAAY,IAAI2jE,GAAK,aAAa,IAAK,WAAY,CAAC+Q,EAAU,KAAK,CAAC,EAAGs3G,EAAS,KAAK,CAAC,CAAC,CAAC,EAC7Gpa,EAAM5xK,CAAC,EAAE,YAAY,SAAW,IAAI2jE,GAAK,aAAa,IAAK,WAAY,CAACqoH,EAAS,KAAK,CAAC,EAAGt3G,EAAU,KAAK,CAAC,CAAC,CAAC,EAC5Gk9F,EAAM5xK,CAAC,EAAE,WAAa,yBACtB,MAAM0zL,EAAc,CAAE,EAClBJ,GAAoBtH,EAAS,KAAK,CAAC,CAAC,GAAG0H,EAAY,KAAKzC,GAAMjF,EAAS,KAAK,CAAC,EAAE,SAAQ,CAAE,EAAI,SAAS,EACtGsH,GAAoB5+G,EAAU,KAAK,CAAC,CAAC,GAAGg/G,EAAY,KAAKzC,GAAMv8G,EAAU,KAAK,CAAC,EAAE,SAAQ,CAAE,EAAI,SAAS,EAC5Gk9F,EAAM5xK,CAAC,EAAE,WAAa0zL,EAAY,KAAK,cAAc,EACrD,MAAMjH,EAAc7a,EAAM5xK,CAAC,EAAE,YAAY,MAAO,EAChDyzL,EAAWlqL,EAAO,SAAWqoL,GAAgBvC,GAAa,cAAC5C,CAAW,EAAGljL,EAAO,UAAU,EAAI8lL,GAAAA,cAAc5C,CAAW,EACvH7a,EAAQA,EAAM,MAAM,EAAG5xK,EAAI,CAAC,EAAE,OAAOyzL,CAAQ,CAC9C,CAEHzzL,GAAK,CACX,OAAaA,EAAI4xK,EAAM,QAAU6hB,EAAS,OAAS,EAChD,CACD,MAAMf,EAAmB,CAAE,EAC3B,IAAIC,EAAa,EACjB/gB,EAAM,QAAQ,SAAUxtJ,EAAMpkB,EAAG,CAC/B,MAAM4yL,EAAaxuK,EAAK,WACpBA,EAAK,aAAe,2BAA0BA,EAAK,WAAa6rK,GAAkB7rK,CAAI,EAAE,OAAS,EAAI6sK,GAAMttH,GAAK,MAAMssH,GAAkB7rK,CAAI,EAAE,CAAC,EAAE,SAAU,EAAE,CAAE,YAAa,MAAQ,CAAA,CAAC,EAAI,IACzLA,EAAK,cAAgB,OACnB7a,EAAO,cAAgB6a,EAAK,YAAY,SAAS,SAAU,IAAKA,EAAK,YAAY,SAAS,SAAQ,GAAMA,EAAK,YAAY,UAAU,SAAQ,IAAOA,EAAK,YAAY,UAAU,SAAQ,GACnLwuK,IAAe,wBAAuBD,GAAcA,EAAa,GAAK,GAE1EA,EAAa,GAGjB,MAAME,EAAczuK,EAAK,cAAgB,KAAO6sK,GAAM7sK,EAAK,YAAY,SAAU7a,CAAM,EAAI,GAC3F,IAAIupL,EAAc7B,GAAM7sK,EAAK,YAAY,SAAU7a,CAAM,EACzD,MAAMwpL,EAAe3uK,EAAK,cAAgB,KAAO6sK,GAAM7sK,EAAK,YAAY,UAAW7a,CAAM,EAAI,GAC7F,IAAIypL,EAAe/B,GAAM7sK,EAAK,YAAY,UAAW7a,CAAM,EAC3D,MAAMoqL,EAAwB1C,GAAM7sK,EAAK,YAAY,UAAU,EAO/D,GANIpkB,IAAM,IAERwzL,EAAgB,GAAGvC,GAAM7sK,EAAK,YAAY,MAAO,CAAA,CAAC,GAClDsuK,EAAiB,KACf,OAAO,MAAMG,CAAW,IAAI5B,GAAM7sK,EAAK,YAAY,UAAU,CAAC,GAAG2uK,CAAY,EAAE,GAE/ExpL,EAAO,QAAU,QAAS,CAC5B,MAAM0pL,EAAQN,IAAe,EAAI,QAAUppL,EAAO,MAClDupL,EAAc,YAAYG,CAAK,IAAIH,EAAY,QAAQD,EAAa,kBAAkBA,CAAW,GAAG,CAAC,IACrGG,EAAe,YAAYC,CAAK,IAAID,EAAa,QAAQD,EAAc,kBAAkBA,CAAY,GAAG,CAAC,GAC1G,CACD,MAAMd,EAAUC,GAAY9tK,EAAM7a,EAAO,QAAQ,EAC7CopL,IAAe,GACjBA,EAAa,EACbD,EAAiB,IAAK,EACtBA,EAAiB,KAAK,GAAGI,CAAW,IAAIa,CAAqB,GAAGX,CAAY,GAAGzpL,EAAO,QAAU,KAAK0oL,CAAO,GAAK,EAAE,EAAE,GAErHS,EAAiB,KAAK,GAAGI,CAAW,IAAIa,CAAqB,GAAGX,CAAY,GAAGzpL,EAAO,QAAU,KAAK0oL,CAAO,GAAK,EAAE,EAAE,CAE3H,CAAG,EACD,MAAM2B,EAAehiB,EAAMA,EAAM,OAAS,CAAC,EAAE,YAC7C,IAAI1yI,EAAS00J,EAAa,UAC1B,GAAIrqL,EAAO,iBAAmB,YAAc,CAAE21B,EAAO,eACnD,GAAI,CAEFykC,GAAK,OAAO,CAAE,OAAQ,UAAU,CAAE,EAClCzkC,EAASykC,GAAK,SAASzkC,EAAO,KAAI,CAAE,EACpCykC,GAAK,OAAO,CAAE,OAAQ,QAAQ,CAAE,EAE5Bz7C,IAAUgX,CAAM,IAClBA,EAASykC,GAAK,MAAMzkC,EAAO,QAAO,EAAI,EAAE,GACpC31B,EAAO,iBAAmB,WAAc,OAAOA,EAAO,gBAAmB,UAAY21B,EAAO,SAAQ,EAAG,MAAM,GAAG,EAAE,CAAC,EAAE,QAAU31B,EAAO,iBAExImpL,EAAiB,KAAK,GAAGzB,GAAM2C,EAAa,SAAUrqL,CAAM,CAAC,IAAI0nL,GAAM2C,EAAa,WAAa10J,EAAO,SAAQ,CAAE,CAAC,EAAE,EAG/H,MAAgB,CAAE,CAGhB,MAAMkzJ,EAAQ,aAAaoB,CAAa,KACxC,IAAInB,EAAY;AAAA,EAAsBK,EAAiB,KAAK;AAAA,CAAQ,CAAC;AAAA,iBACrE,MAAMmB,EAAW,CACf,aAAclC,GAAWhuH,GAAK,SAASiuG,EAAMA,EAAM,OAAS,CAAC,EAAE,YAAY,MAAO,EAAC,MAAMA,EAAMA,EAAM,OAAS,CAAC,EAAE,YAAY,UAAU,EAAE,CAAC,CAAC,CAAC,EAC5I,QAASjuG,GAAK,SAASiuG,EAAMA,EAAM,OAAS,CAAC,EAAE,YAAY,MAAK,EAAG,MAAMA,EAAMA,EAAM,OAAS,CAAC,EAAE,YAAY,UAAU,EAAE,CAAC,CAAC,EAC3H,MAAOA,EAAMA,EAAM,OAAS,CAAC,EAAE,YAAY,MAAO,EAAC,MAAMA,EAAMA,EAAM,OAAS,CAAC,EAAE,YAAY,UAAU,EAAE,CAAC,EAC1G,MAAOqf,GAAMrf,EAAMA,EAAM,OAAS,CAAC,EAAE,YAAY,OAAO,CACzD,EACD,IAAIkiB,EAAmBC,EACvB,GAAIniB,EAAMA,EAAM,OAAS,CAAC,EAAE,YAAY,SAAS,aAAc,CAC7D,MAAM0a,EAAQvZ,EAAS,MAAMnB,EAAM,CAAC,EAAE,YAAY,UAAU,EACtD/hG,EAAa+hG,EAAMA,EAAM,OAAS,CAAC,EAAE,YAAY,SAAS,SAAU,EACpEoiB,EAAcpiB,EAAMA,EAAM,OAAS,CAAC,EAAE,YAAY,UAAU,SAAU,EAC5EkiB,EAAoBjC,GAASvF,EAAM,CAAC,EAAE,WAAWz8G,EAAY,IAAImkH,CAAW,GAAG,CAAC,EAChFD,EAAqBlC,GAASvF,EAAM,CAAC,EAAE,WAAWz8G,EAAY,IAAImkH,CAAW,GAAG,CAAC,CAClF,CACD,OAAIzqL,EAAO,gBACT8oL,EAAY;AAAA,YACJA,CAAS;AAAA,6BACQwB,EAAS,KAAK;AAAA;AAAA;AAAA;AAAA,qCAINC,EAAkB,eAAe,IAAIA,EAAkB,WAAW;AAAA;AAAA,uCAEhEC,EAAmB,eAAe,IAAIA,EAAmB,WAAW;AAAA,aAGlG,CACL,SAAAF,EACA,MAAAzB,EACA,UAAAC,EACA,SAAUmB,EACV,cAAeM,EACf,eAAgBC,EAChB,MAAAniB,EACA,WAAY8gB,CACb,CACH,CAEO,SAASuB,GAAiBC,EAAW,CAAC,IAAK,IAAK,IAAK,IAAK,KAAM,MAAO,MAAO,OAAQ,OAAQ,MAAO,OAAQ,IAAK,KAAM,KAAM,IAAI,EAAGC,EAAc5qE,EAAQ,GAAO,CACvK,MAAML,EAAQvlD,GAAK,SAAS,MAC5BulD,EAAM,EAAE,EAAI,CAAE,EAAG,IAAK,EAAG,GAAK,EAC9BA,EAAM,EAAE,EAAI,CAAE,EAAG,IAAK,EAAG,GAAK,EAE9B,MAAM4F,EAAY,CAAE,EACpBA,EAAU,UAAY,OAAO,OAAOolE,CAAQ,EAC5C,MAAME,EAAY,CAAC,IAAK,IAAK,IAAK,IAAK,KAAM,MAAO,MAAO,OAAQ,OAAQ,MAAO,OAAQ,IAAK,KAAM,KAAM,IAAI,EACzGhnH,EAAK,CAAC,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,GAAG,EAC/EinH,EAAU,CACd,MAAO,WAAY,WAAY,SAC/B,MACA,MAAO,MACP,WAAY,WACZ,MAAO,WACP,MAAO,WACP,WAAY,QAAQ,EAChBC,EAAa,CACjB,IAAK,WACL,SAAU,MACV,SAAU,SACV,OAAQ,UACT,EACKC,EAAe,CACnB,IAAK,IACL,SAAU,IACV,SAAU,IACV,OAAQ,GACT,EACKC,EAAe,CACnB,WAAY,cAAe,kBAAmB,eAC9C,kBACA,qCAAsC,qCACtC,wCAAyC,wCACzC,oCAAqC,uCACrC,2BAA4B,8BAC5B,kCAAmC,8BACpC,EACKC,EAAkB,CACtB,cAAe,WAAY,eAAgB,kBAC3C,0BACA,wCAAyC,wCACzC,qCAAsC,qCACtC,uCAAwC,oCACxC,8BAA+B,2BAC/B,+BAAgC,iCACjC,EACKC,EAAoB,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EAC9CC,EAAoB,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,CAAC,EACjD7lE,EAAU,QAAU,OAAO,OAAOA,EAAU,SAAS,EACrDA,EAAU,aAAe,OAAO,OAAOA,EAAU,SAAS,EAC1DA,EAAU,gBAAkB,OAAO,OAAOA,EAAU,SAAS,EAC7DA,EAAU,GAAK,OAAO,OAAOA,EAAU,SAAS,EAChDA,EAAU,QAAQ,QAAQ,SAAUn2G,EAAG3Y,EAAG,CACxC8uH,EAAU,QAAQ9uH,CAAC,EAAIq0L,EAAQD,EAAU,QAAQz7K,CAAC,CAAC,CACvD,CAAG,EACDm2G,EAAU,aAAa,QAAQ,SAAUn2G,EAAG3Y,EAAG,CAC7C8uH,EAAU,aAAa9uH,CAAC,EAAIw0L,EAAaJ,EAAU,QAAQz7K,CAAC,CAAC,CACjE,CAAG,EACDm2G,EAAU,gBAAgB,QAAQ,SAAUn2G,EAAG3Y,EAAG,CAChD8uH,EAAU,gBAAgB9uH,CAAC,EAAIy0L,EAAgBL,EAAU,QAAQz7K,CAAC,CAAC,CACvE,CAAG,EACDm2G,EAAU,GAAG,QAAQ,SAAUn2G,EAAG3Y,EAAG,CACnC8uH,EAAU,GAAG9uH,CAAC,EAAIotE,EAAGgnH,EAAU,QAAQz7K,CAAC,CAAC,CAC7C,CAAG,EACD,MAAM67C,EAAQ,CAAC,IAAImP,GAAK,WAAW,GAAG,CAAC,EACjCixH,EAAW,CAAE,EACbC,EAAU,CAAC,oBAAoB,EAC/BjjB,EAAQ,CAAC,GAAG,EACZkjB,EAAY,CAAC,IAAInxH,GAAK,WAAW,GAAG,CAAC,EACrCoxH,EAAkB,CAAC,GAAG,EACtBC,EAAW,CAAC,GAAG,EACfC,EAAqB,CAAC,GAAG,EACzBC,EAAa,CAAC,8BAA8B,EAClDf,EAAexwH,GAAK,SAASA,GAAK,OAAOwwH,CAAY,CAAC,EACtD,MAAMgB,EAAwB,CAAChB,CAAY,EACrCiB,EAAsB,CAACjB,CAAY,EACzC,IAAI/vK,EACJ,MAAMixK,EAAWvmE,EAAU,UAAU,OAAS,EAC9C,QAAS9uH,EAAI,EAAGA,EAAIq1L,EAAUr1L,IAAK,CACjC,MAAMs1L,EAAQt1L,EAAI,EAClB,IAAIu1L,EAAWzmE,EAAU,UAAUwmE,CAAK,EACxC,MAAME,EAAS1mE,EAAU,QAAQwmE,CAAK,EAChCG,EAAc3mE,EAAU,aAAawmE,CAAK,EAC1CI,EAAiB5mE,EAAU,gBAAgBwmE,CAAK,EAChDloH,EAAK0hD,EAAU,GAAGwmE,CAAK,EAC7B,IAAIK,EAAY,GAChB,OAAQJ,EAAQ,CACd,IAAK,IACHnxK,EAAO,IAAIu/C,GAAK,aAAaA,GAAK,WAAWgxH,CAAiB,CAAC,EAC/D,MACF,IAAK,IACHvwK,EAAO,IAAIu/C,GAAK,aAAaA,GAAK,WAAWgxH,CAAiB,CAAC,EAC/D,MACF,IAAK,IACHvwK,EAAO,IAAIu/C,GAAK,aAAa,CAAC,EAC9B,MACF,IAAK,IACHv/C,EAAO,IAAIu/C,GAAK,aAAaA,GAAK,WAAW+wH,CAAiB,CAAC,EAC/D,MACF,IAAK,IACHtwK,EAAO,IAAIu/C,GAAK,aAAaA,GAAK,WAAWgxH,CAAiB,CAAC,EAC/D,MACF,QACMY,EAAS,CAAC,IAAM,MAAKA,EAAWA,EAAS,QAAQ,IAAK,EAAE,GAC5DnxK,EAAOu/C,GAAK,MAAM4xH,CAAQ,CAC7B,CACDT,EAAU,KAAK1wK,CAAI,EACfA,EAAK,iBAAgBuxK,EAAY,IAAIvxK,EAAK,SAAU,CAAA,KACxD,IAAIwxK,EAAgBjyH,GAAK,SAASnP,EAAMx0D,EAAI,CAAC,EAAE,SAAS,CAAE,YAAa,MAAQ,CAAA,EAAGkpH,CAAK,EACvF10D,EAAM,KAAK,IAAImP,GAAK,aAAayJ,EAAIooH,EAAQ,CAAC,IAAI7xH,GAAK,gBAAgBiyH,CAAa,EAAGxxK,CAAI,CAAC,CAAC,EAC7FwtJ,EAAM,KAAKqf,GAAMz8H,EAAMx0D,CAAC,EAAG,CAAE,OAAQ,EAAK,CAAS,CAAC,EACpD41L,EAAgBjyH,GAAK,SAASnP,EAAMx0D,CAAC,EAAE,SAAS,CAAE,YAAa,MAAQ,CAAA,EAAGkpH,CAAK,EAC/E0rE,EAAS,KAAK,IAAIjxH,GAAK,aAAa4wH,EAAaiB,CAAM,EAAGlB,EAAWkB,CAAM,EAAG,CAAC,IAAI7xH,GAAK,gBAAgBiyH,CAAa,EAAGxxK,CAAI,CAAC,CAAC,EAC9H4wK,EAAS,KAAK/D,GAAM2D,EAAS50L,EAAI,CAAC,EAAG,CAAE,OAAQ,EAAK,CAAS,CAAC,EAC9D+0L,EAAgB,KAAK9D,GAAM2E,EAAe,CAAE,OAAQ,EAAK,CAAS,CAAC,EACnE,MAAMC,GAAmBlyH,GAAK,MAAMixH,EAAS50L,EAAI,CAAC,EAAE,SAAS,CAAE,YAAa,MAAQ,CAAA,CAAC,EACrFi1L,EAAmB,KAAKhE,GAAM4E,GAAkB,CAAE,OAAQ,EAAK,CAAS,CAAC,EACzEhB,EAAQ,KAAKY,EAAcE,CAAS,EACpCT,EAAW,KAAKQ,EAAiBC,CAAS,EACtC31L,IAAM8uH,EAAU,UAAU,SAC5B8iD,EAAM,KAAKqf,GAAMz8H,EAAMx0D,CAAC,EAAG,CAAE,OAAQ,EAAK,CAAS,CAAC,EACpD+0L,EAAgB,KAAK9D,GAAM2E,EAAe,CAAE,OAAQ,EAAK,CAAS,CAAC,EACnEZ,EAAS,KAAK/D,GAAM2D,EAAS50L,EAAI,CAAC,EAAG,CAAE,OAAQ,EAAK,CAAS,CAAC,EAC9Di1L,EAAmB,KAAKhE,GAAM2E,EAAe,CAAE,OAAQ,EAAK,CAAS,CAAC,EACtEf,EAAQ,KAAK,oBAAoB,EAEjCK,EAAW,KAAK,uBAAuB,GAErCl1L,IAAMq1L,GACRD,EAAoB,KAAKA,EAAoBp1L,EAAI,CAAC,CAAC,EACnDm1L,EAAsB,KAAKC,EAAoBp1L,EAAI,CAAC,CAAC,GAC5CA,EAAI,IACbo1L,EAAoB,KAAK,IAAIzxH,GAAK,aAAamrD,EAAU,GAAGwmE,CAAK,EAAGE,EAAQ,CAACL,EAAsBn1L,EAAI,CAAC,EAAG2jE,GAAK,SAASv/C,EAAM,CAAC,CAAE,EAAG,IAAK,EAAG,GAAK,CAAA,EAAG,CAAE,EAAG+vK,CAAc,CAAA,CAAC,CAAC,CAAC,EAC3KgB,EAAsB,KAAKxxH,GAAK,SAASyxH,EAAoBp1L,CAAC,EAAG,CAAE,EAAGm0L,CAAY,CAAE,CAAC,EAExF,CACD,MAAM2B,EAA2B,CAACX,EAAsBE,EAAW,CAAC,CAAC,EAC/DU,EAAyB,CAACZ,EAAsBE,EAAW,CAAC,CAAC,EACnE,QAASr1L,EAAI,EAAGA,EAAIq1L,EAAUr1L,IAAK,CACjC,MAAMs1L,EAAQt1L,EAAI,EACZw1L,EAAS1mE,EAAU,QAAQumE,EAAW,EAAIC,CAAK,EACjDt1L,IAAMq1L,GACRU,EAAuB,KAAKA,EAAuB/1L,CAAC,CAAC,EACrD81L,EAAyB,KAAKC,EAAuB/1L,CAAC,CAAC,GAC9CA,EAAIq1L,IACbU,EAAuB,KAAK,IAAIpyH,GAAK,aAAa4wH,EAAaiB,CAAM,EAAGlB,EAAWkB,CAAM,EAAG,CAACM,EAAyB91L,EAAI,CAAC,EAAG2jE,GAAK,SAASmxH,EAAUO,EAAWr1L,CAAC,EAAG,CAAC,CAAE,EAAG,IAAK,EAAG,GAAG,CAAE,EAAG,CAAE,EAAGm0L,CAAc,CAAA,CAAC,CAAC,CAAC,EACjN2B,EAAyB,KAAKnyH,GAAK,SAASoyH,EAAuB/1L,CAAC,EAAG,CAAE,EAAGm0L,CAAY,CAAE,CAAC,EAE9F,CACD,MAAO,CAAE,QAAAU,EAAS,MAAAjjB,EAAO,gBAAAmjB,EAAiB,SAAAC,EAAU,mBAAAC,EAAoB,WAAAC,EAAY,MAAA1gI,EAAO,SAAA0/H,EAAU,oBAAAkB,EAAqB,sBAAAD,EAAuB,uBAAAY,EAAwB,yBAAAD,CAA0B,CACrM,CAEO,SAASE,IAAyB9B,EAAW,CAAC,IAAK,IAAK,IAAK,IAAK,KAAM,MAAO,MAAO,OAAQ,OAAQ,MAAO,OAAQ,IAAK,KAAM,KAAM,IAAI,EAAGC,EAAc5qE,EAAQ,GAAO,CAC/K,MAAM0sE,EAAYhC,GAAgBC,EAAUC,EAAc5qE,CAAK,EACzD2sE,EAAyB,OAAO,OAAOD,EAAU,OAAO,EAC9DC,EAAuB,QAAQ,SAAU9xK,EAAMpkB,EAAG,CAChDk2L,EAAuBl2L,CAAC,EAAI,oBAAsBi2L,EAAU,QAAQj2L,CAAC,EAAI,KACzEi2L,EAAU,QAAQj2L,CAAC,EAAI,oBAAsBi2L,EAAU,QAAQj2L,CAAC,EAAI,IACpEk2L,EAAuBl2L,CAAC,GAAK,IAAMi2L,EAAU,MAAMj2L,CAAC,EAChDi2L,EAAU,MAAMj2L,CAAC,IAAMi2L,EAAU,gBAAgBj2L,CAAC,IAAGk2L,EAAuBl2L,CAAC,GAAK,KAAOi2L,EAAU,gBAAgBj2L,CAAC,EAC5H,CAAG,EACD,IAAIoyL,EAAQ,OAAO;AAAA;AAAA;AAAA,YAGT6D,EAAU,QAAQ,KAAK,MAAM,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,YAOxC,MAAM5D,EAAY,OAAO;AAAA;AAAA;AAAA,YAGf6D,EAAuB,KAAK,MAAM,CAAC;AAAA,0BAE7C,OAAI3sE,IAAO6oE,EAAQ,GAAGA,CAAK,OAAOC,CAAS,IACpC,CAAE,MAAAD,EAAO,UAAAC,CAAW,CAC7B,CAEO,SAAS8D,IAAuBjC,EAAW,CAAC,IAAK,IAAK,IAAK,IAAK,KAAM,MAAO,MAAO,OAAQ,OAAQ,MAAO,OAAQ,IAAK,KAAM,KAAM,IAAI,EAAGC,EAAc5qE,EAAQ,GAAO,CAC7K,MAAM0sE,EAAYhC,GAAgBC,EAAUC,EAAc5qE,CAAK,EACzD2sE,EAAyB,OAAO,OAAOD,EAAU,OAAO,EAC9DC,EAAuB,QAAQ,SAAU9xK,EAAMpkB,EAAG,CAChDk2L,EAAuBl2L,CAAC,EAAI,oBAAsBi2L,EAAU,QAAQj2L,CAAC,EAAI,KACzEi2L,EAAU,QAAQj2L,CAAC,EAAI,oBAAsBi2L,EAAU,QAAQj2L,CAAC,EAAI,IACpEk2L,EAAuBl2L,CAAC,GAAK,IAAMi2L,EAAU,MAAMj2L,CAAC,EAChDi2L,EAAU,MAAMj2L,CAAC,IAAMi2L,EAAU,gBAAgBj2L,CAAC,IAAGk2L,EAAuBl2L,CAAC,GAAK,KAAOi2L,EAAU,gBAAgBj2L,CAAC,EAC5H,CAAG,EACD,IAAIoyL,EAAQ,OAAO;AAAA;AAAA,aAER6D,EAAU,gBAAgBA,EAAU,gBAAgB,OAAS,CAAC,CAAC;AAAA,YAE1E,MAAM5D,EAAY,OAAO;AAAA;AAAA;AAAA,YAGf6D,EAAuB,KAAK,MAAM,CAAC;AAAA,0BAE7C,OAAI3sE,IAAO6oE,EAAQ,GAAGA,CAAK,OAAOC,CAAS,IACpC,CAAE,MAAAD,EAAO,UAAAC,CAAW,CAC7B,CAEO,SAAS+D,IAAyBlC,EAAW,CAAC,IAAK,IAAK,IAAK,IAAK,KAAM,MAAO,MAAO,OAAQ,OAAQ,MAAO,OAAQ,IAAK,KAAM,KAAM,IAAI,EAAGC,EAAc5qE,EAAQ,GAAO,CAC/K,MAAM0sE,EAAYhC,GAAgBC,EAAUC,EAAc5qE,CAAK,EACzD2sE,EAAyB,OAAO,OAAOD,EAAU,OAAO,EACxDI,EAA4B,OAAO,OAAOJ,EAAU,OAAO,EAC3DZ,EAAWa,EAAuB,OACxCA,EAAuB,QAAQ,SAAU9xK,EAAMpkB,EAAG,CAChDk2L,EAAuBl2L,CAAC,EAAI,oBAAsBi2L,EAAU,QAAQj2L,CAAC,EAAI,KACzEi2L,EAAU,QAAQj2L,CAAC,EAAI,oBAAsBi2L,EAAU,QAAQj2L,CAAC,EAAI,IACpEk2L,EAAuBl2L,CAAC,GAAK,IAAMi2L,EAAU,MAAMj2L,CAAC,EACpDq2L,EAA0Br2L,CAAC,EAAI,oBAAsBi2L,EAAU,WAAWj2L,CAAC,EAAI,KAC/Ei2L,EAAU,WAAWj2L,CAAC,EAAI,oBAAsBi2L,EAAU,WAAWj2L,CAAC,EAAI,IACtEA,IAAM,EACRq2L,EAA0Br2L,CAAC,GAAK,IAAMixL,GAAMgF,EAAU,yBAAyBZ,EAAW,CAAC,CAAC,EACnFr1L,EAAIk2L,EAAuB,OAAS,EAC7CG,EAA0Br2L,CAAC,GAAK,IAAMixL,GAAMgF,EAAU,uBAAuBZ,EAAW,EAAIr1L,CAAC,CAAC,EAAI,MAAQixL,GAAMgF,EAAU,yBAAyBZ,EAAW,EAAIr1L,CAAC,CAAC,EAEpKq2L,EAA0Br2L,CAAC,GAAK,IAAMixL,GAAMgF,EAAU,yBAAyB,CAAC,CAAC,CAEvF,CAAG,EACD9B,EAAexwH,GAAK,SAASA,GAAK,OAAOwwH,CAAY,CAAC,EACtD,IAAI/B,EAAQ,OAAO,4BAA4BnB,GAAMgF,EAAU,yBAAyB,CAAC,CAAC,CAAC;AAAA;AAAA;AAAA,YAGjFA,EAAU,QAAQ,KAAK,MAAM,CAAC;AAAA;AAAA;AAAA;AAAA,YAKxC,MAAM5D,EAAY,OAAO;AAAA;AAAA;AAAA,YAGfgE,EAA0B,QAAO,EAAG,KAAK,MAAM,CAAC;AAAA;AAAA;AAAA,yCAGnBpF,GAAMkD,CAAY,CAAC;AAAA,YAE1D,OAAI5qE,IAAO6oE,EAAQ,GAAGA,CAAK,OAAOC,CAAS,IACpC,CAAE,MAAAD,EAAO,UAAAC,CAAW,CAC7B,CAEO,SAASiE,IAA0BpC,EAAW,CAAC,IAAK,IAAK,IAAK,IAAK,KAAM,MAAO,MAAO,OAAQ,OAAQ,MAAO,OAAQ,IAAK,KAAM,KAAM,IAAI,EAAGC,EAAc5qE,EAAQ,GAAO,CAChL,MAAM0sE,EAAYhC,GAAgBC,EAAUC,EAAc5qE,CAAK,EACzD2sE,EAAyB,OAAO,OAAOD,EAAU,OAAO,EAC9DC,EAAuB,QAAQ,SAAU9xK,EAAMpkB,EAAG,CAChDk2L,EAAuBl2L,CAAC,EAAI,oBAAsBi2L,EAAU,QAAQj2L,CAAC,EAAI,KACzEi2L,EAAU,QAAQj2L,CAAC,EAAI,oBAAsBi2L,EAAU,QAAQj2L,CAAC,EAAI,IAEhEA,IAAM,EACRk2L,EAAuBl2L,CAAC,GAAK,IAAMixL,GAAMgF,EAAU,sBAAsB,CAAC,CAAC,EAClEj2L,EAAIk2L,EAAuB,OAAS,EAC7CA,EAAuBl2L,CAAC,GAAK,IAAMixL,GAAMgF,EAAU,oBAAoBj2L,CAAC,CAAC,EAAI,MAAQixL,GAAMgF,EAAU,sBAAsBj2L,CAAC,CAAC,EAE7Hk2L,EAAuBl2L,CAAC,GAAK,IAAMixL,GAAMgF,EAAU,sBAAsBj2L,EAAI,CAAC,CAAC,CAErF,CAAG,EACDm0L,EAAexwH,GAAK,SAASA,GAAK,OAAOwwH,CAAY,CAAC,EACtD,IAAI/B,EAAQ,OAAO,yBAAyBnB,GAAMkD,CAAY,CAAC;AAAA;AAAA;AAAA,YAGrD8B,EAAU,QAAQ,KAAK,MAAM,CAAC;AAAA;AAAA;AAAA,YAIxC,MAAM5D,EAAY,OAAO;AAAA;AAAA;AAAA,YAGf6D,EAAuB,KAAK,MAAM,CAAC;AAAA,0BAE7C,OAAI3sE,IAAO6oE,EAAQ,GAAGA,CAAK,OAAOC,CAAS,IACpC,CAAE,MAAAD,EAAO,UAAAC,CAAW,CAC7B,CAEO,SAASkE,IAAmB1kH,EAAa,UAAW2kH,EAAa,GAAOjtE,EAAQ,GAAO,CAC5F,MAAMqoD,EAAqBggB,GAAb4E,EAA6B5+E,GAAM,OAAC/lC,CAAU,EAAqB+5G,sBAAmB/5G,CAAU,CAAjD,EACzD03C,IACF,QAAQ,IAAI,WAAW,EACvB,QAAQ,IAAIqoD,CAAK,GAGnB,MAAMmgB,EAAkB,CAAE,EAC1B,IAAID,EAAkB,GACtBlgB,EAAM,QAAQ,SAAUxtJ,EAAMpkB,EAAG,CAC/B,MAAM4yL,EAAaxuK,EAAK,WACpBA,EAAK,UAAY,OACfA,EAAK,QAAQ,SAAQ,EAAOA,EAAK,QAAQ,SAAQ,GAMnDmlG,IACF,QAAQ,IAAIqpE,CAAU,EACtB,QAAQ,IAAIxuK,EAAK,QAAQ,SAAQ,CAAE,GAErC,MAAMmtJ,EAAUntJ,EAAK,UAAY,KAAO6sK,GAAM7sK,EAAK,QAAS,CAAE,OAAQ,EAAI,CAAS,EAAI,GACjF2lG,EAAUknE,GAAM7sK,EAAK,QAAS,CAAE,OAAQ,GAAa,EACvDmlG,GACF,QAAQ,IAAIQ,EAAQ,UAAU,EAE5B/pH,IAAM,IACR8xL,EAAkB,GAAGvgB,CAAO,IAE1BhoD,GAAO,QAAQ,IAAIQ,CAAO,EAC9B,MAAM0sE,EAAqB,CACzB,mBAAoB,OAAO,8BAC3B,gBAAiB,OAAO,wCACxB,sBAAuB,OAAO,wCAC9B,mBAAoB,OAAO,iCAC3B,sBAAuB,OAAO,uCAC9B,oBAAqB,OAAO,iCAC5B,6BAA8B,OAAO,iCACrC,WAAY,OAAO,yBACnB,uBAAwB,OAAO,qCAC/B,mBAAoB,OAAO,uCAC3B,0BAA2B,OAAO,4CACnC,EACD,IAAItD,EAAe,CACjB,mBAAoB,OAAO,yCAC3B,oBAAqB,OAAO,qBAC5B,mBAAoB,OAAO,qCAC3B,eAAgB,OAAO,wCACvB,SAAU,OAAO,mDACjB,WAAY,OAAO,mCACpB,EACG5pE,IACF4pE,EAAe,OAAO,OAAOA,EAAc,CACzC,mBAAoB,OAAO,iCAC3B,kBAAmB,OAAO,gCAC1B,oBAAqB,OAAO,2CAC5B,mBAAoB,OAAO,2CAC3B,+BAAgC,OAAO,2DACvC,oBAAqB,OAAO,gCAC5B,kBAAmB,OAAO,oCAC1B,mCAAoC,OAAO,8CAC3C,mBAAoB,OAAO,8BAC3B,WAAY,OAAO,sCACnB,eAAgB,OAAO,qCACvB,WAAY,OAAO,4CACnB,eAAgB,OAAO,gCACvB,iBAAkB,OAAO,oCACzB,cAAe,OAAO,sCACtB,kBAAmB,OAAO,iCAC1B,aAAc,OAAO,8BAC7B,CAAO,GAECA,EAAaP,CAAU,IAAM,SAAWO,EAAaP,CAAU,EAAI,IACnE6D,EAAmB7D,CAAU,IAAM,QAAWb,EAAgB,KAAK,OAAO,QAAQhoE,CAAO,EAAE,EAC3FR,GAAO,QAAQ,IAAI,aAAc4pE,EAAaP,CAAU,CAAC,CACjE,CAAG,EACD,IAAIR,EAAQ,OAAO,6BAA6BN,CAAe,KAC/D,MAAMO,EAAY,OAAO,kBAAkBP,CAAe;AAAA;AAAA;AAAA,IAGxDA,CAAe,GAAGC,EAAgB,MAAMA,EAAgB,OAAS,EAAGA,EAAgB,MAAM,EAAE,KAAK,MAAM,CAAC;AAAA;AAAA,IAG1G,OAAIxoE,IAAO6oE,EAAQC,GACZ,CAAE,MAAAD,EAAO,UAAAC,CAAW,CAC7B,CAiBO,SAASqE,IAAUC,EAAOh+K,EAAIg+K,EAAM,OAAQn+K,EAAS,GAAI,CAW9D,OAVI,OAAOm+K,GAAU,SACnBA,EAAQA,EAAM,MAAM,EAAE,EACb,OAAOA,GAAU,UAC1Bh+K,EAAI,EAAIg+K,EACRA,EAAQ,wBAAwB,MAAM,EAAE,GAC/B,MAAM,QAAQA,CAAK,GAAKA,EAAM,SAAW,IAClDh+K,EAAI,EACJg+K,EAAQ,wBAAwB,MAAM,EAAE,GAE1Cn+K,EAAO,KAAKm+K,EAAM,OAAO,KAAK,MAAM,KAAK,OAAQ,EAAGA,EAAM,MAAM,EAAG,CAAC,EAAE,CAAC,CAAC,EACpEn+K,EAAO,SAAWG,EACbH,EAEAk+K,IAASC,EAAOh+K,EAAGH,CAAM,CAEpC","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253,254,255,256,257,258,259,260,261,262,263,264,265,266,267,268,269,270,271,272,273,274,275,276,277,278,279,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,298,299,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,333,334,335,336,337,338,339,340,341,342,343,344,345,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,361,362,363,364,365,366,367,368,369,370,371,372,373,374,375,376,377,378,379,380,381,382,383,384,385,386,387,388,389,390,391,392,393,394,395,396,397,398,399,400,401,402,403,404,405,406,407,408,409,410,411,412,413,414,415,416,417,418,419,420,421,422,423,424,425,426,427,428,429,430,431,432,433,434,435,436,437,438,439,440,441,442,443,444,445,446,447,448,449,450,451,452,453,454,455,456,457,458,459,460,461,462,463,464,465,466,467,468,469,470,471,472,473,474,475,476,477,478,479,480,481,482,483,484,485,486,487,488,489,490,491,492,493,494,495,496,497,498,499,500,501,502,503,504,505,506,507,508,509,510,511,512,513,514,515,516,517,518,519,520,521,522,523,524,525,526,527,528,529,530,531,532,533,534,535,536,537,538,539,540,541,542,543,544,545,546,547,548,549,550,551,552,553,554,555,556,557,558,559,560,561,562,563,564,565,566,567,568,569,570,571,572,573,574,575,576,577,578,579,580,581,582,583,584,585,586,587,588,589,590,591,592,593,594,595,596,597,598,599,600,601,602,603,604,605,606,607,608,609,610,611,612,613,614,615,616,617,618,619,620,621,622,623,624,625,626,627,628,629,630,631,632,633,634,635,636,637,638,639,640,641,642,643,644,645,646,647,648,649,650,651,652,653,654,655,656,657,658,659,660,661,662,663,664,665,666,667,668,669,670,671,672,673,674,675,676,677,678,679,680,681,682,683,684,685,686,687,688,689,690,691,692,693,694,695,696,697,698,699,700,701,702,703,704,705,706,707,708,709,710,711,712,713,714,715,716,717,718,719,720,721,722,723,724,725,726,727,728,729,730,731,732,733,734,735,736,737,738,739,740,741,742,743,744,745,746,747,748,749,750,751,752,753,754,755,756,757,758,759,760,761,762,763,764,765,766,767,768,769,770,771,772,773,774,775,776,777,778,779,780,781,782,783,784,785,786,787,788,789,790,791,792,793,794,795,796,797,798,799,800,801,802,803,804,805,806,807,808,809,810,811,812,813,814,815,816,817,818,819,820,821,822,823,824,825,826,827,828,829,830,831,832,833,834,835,836,837,838,839,840,841,842,843,844,845,846,847,848,849,850,851,852,853,854,855,856,857,858,859,860,861,862,863,864,865,866,867,868,869,870,871,872,873,874,875,876,877,878,879,880,881,882,883,884,885,886,887,888,889,890,891,892,893,894,895,896,897,898,899,900,901,902,903,904,905,906,907,908,909,910,911,912,913,914,915,916,917,918,919,920,921,922,923,924,925,926,927,928,929,930,931,932,933,934,935,936,937,938,939,940,941,942,943,944,945,946,947,948,949,950,951,952,953,954,955,956,957,958,959,960,961,962,963,964,965,966,967,968,969,970,971,972,973,974,975,976,977,978,979,980,981,982,983,984,985,986,987,988,989,990,991,992,993,994,995,996,997,998,999,1000,1001,1002,1003,1004,1005,1006,1007,1008,1009,1010,1011,1012,1013,1014,1015,1016,1017,1018,1019,1020,1021,1022,1023,1024,1025,1026,1027,1028,1029,1030,1031,1032,1033,1034,1035,1036,1037,1038,1039,1040,1041,1042,1043,1044,1045,1046,1047,1048,1049,1050,1051,1052,1053,1054,1055,1056,1057,1058,1059,1060,1061,1062,1063,1064,1065,1066,1067,1068,1069,1070,1071,1072,1073,1074]}
@ Telegram