{
  "version": 3,
  "sources": ["../../../node_modules/@rails/actioncable/src/adapters.js", "../../../node_modules/@rails/actioncable/src/logger.js", "../../../node_modules/@rails/actioncable/src/connection_monitor.js", "../../../node_modules/@rails/actioncable/src/internal.js", "../../../node_modules/@rails/actioncable/src/connection.js", "../../../node_modules/@rails/actioncable/src/subscription.js", "../../../node_modules/@rails/actioncable/src/subscription_guarantor.js", "../../../node_modules/@rails/actioncable/src/subscriptions.js", "../../../node_modules/@rails/actioncable/src/consumer.js", "../../../node_modules/@rails/actioncable/src/index.js", "../../../node_modules/inputmask/dist/inputmask.js", "../../../node_modules/typed-function/lib/esm/typed-function.mjs", "../../../node_modules/javascript-natural-sort/naturalSort.js", "../../../node_modules/escape-latex/dist/index.js", "../../../node_modules/seedrandom/lib/alea.js", "../../../node_modules/seedrandom/lib/xor128.js", "../../../node_modules/seedrandom/lib/xorwow.js", "../../../node_modules/seedrandom/lib/xorshift7.js", "../../../node_modules/seedrandom/lib/xor4096.js", "../../../node_modules/seedrandom/lib/tychei.js", "../../../node_modules/seedrandom/seedrandom.js", "../../../node_modules/seedrandom/index.js", "../../../node_modules/@hotwired/turbo/dist/turbo.es2017-esm.js", "../../../node_modules/@hotwired/turbo-rails/app/javascript/turbo/cable.js", "../../../node_modules/@hotwired/turbo-rails/app/javascript/turbo/snakeize.js", "../../../node_modules/@hotwired/turbo-rails/app/javascript/turbo/cable_stream_source_element.js", "../../../node_modules/@hotwired/turbo-rails/app/javascript/turbo/fetch_requests.js", "../../../node_modules/@hotwired/turbo-rails/app/javascript/turbo/index.js", "../../../node_modules/@hotwired/stimulus/dist/stimulus.js", "../../../node_modules/stimulus-datepicker/src/iso_date.js", "../../../node_modules/stimulus-datepicker/src/datepicker.js", "../../javascript/controllers/application.js", "../../javascript/controllers/date_mask_controller.js", "../../javascript/controllers/attendance_controller.js", "../../javascript/controllers/week_attendance_controller.js", "../../javascript/controllers/shared_resource_attendance_state.js", "../../javascript/controllers/resource_attendance_controller.js", "../../javascript/controllers/removals_controller.js", "../../javascript/controllers/pdf_order_controller.js", "../../javascript/controllers/checkpoint_date_controller.js", "../../javascript/controllers/batch_billable_status_controller.js", "../../javascript/controllers/instruction_invoice_controller.js", "../../../node_modules/sortablejs/modular/sortable.esm.js", "../../javascript/controllers/sortable_controller.js", "../../javascript/controllers/proforma_to_estimate_controller.js", "../../javascript/controllers/proforma_contact_group_sync_controller.js", "../../javascript/controllers/zero_amount_billables_controller.js", "../../javascript/controllers/calculate_recorded_owners_controller.js", "../../javascript/controllers/quick_email_controller.js", "../../javascript/controllers/pdf_visualizer_controller.js", "../../javascript/controllers/new_patent_expense_dropzone_controller.js", "../../../node_modules/@babel/runtime/helpers/esm/extends.js", "../../../node_modules/mathjs/lib/esm/core/config.js", "../../../node_modules/mathjs/lib/esm/utils/customs.js", "../../../node_modules/mathjs/lib/esm/utils/map.js", "../../../node_modules/mathjs/lib/esm/utils/is.js", "../../../node_modules/mathjs/lib/esm/utils/object.js", "../../../node_modules/mathjs/lib/esm/core/function/config.js", "../../../node_modules/mathjs/lib/esm/entry/configReadonly.js", "../../../node_modules/mathjs/lib/esm/core/function/typed.js", "../../../node_modules/mathjs/lib/esm/utils/factory.js", "../../../node_modules/mathjs/lib/esm/utils/number.js", "../../../node_modules/mathjs/lib/esm/type/resultset/ResultSet.js", "../../../node_modules/decimal.js/decimal.mjs", "../../../node_modules/mathjs/lib/esm/type/bignumber/BigNumber.js", "../../../node_modules/complex.js/dist/complex.mjs", "../../../node_modules/mathjs/lib/esm/type/complex/Complex.js", "../../../node_modules/fraction.js/dist/fraction.mjs", "../../../node_modules/mathjs/lib/esm/type/fraction/Fraction.js", "../../../node_modules/mathjs/lib/esm/type/matrix/Range.js", "../../../node_modules/mathjs/lib/esm/type/matrix/Matrix.js", "../../../node_modules/mathjs/lib/esm/utils/bignumber/formatter.js", "../../../node_modules/mathjs/lib/esm/utils/string.js", "../../../node_modules/mathjs/lib/esm/error/DimensionError.js", "../../../node_modules/mathjs/lib/esm/error/IndexError.js", "../../../node_modules/mathjs/lib/esm/utils/array.js", "../../../node_modules/mathjs/lib/esm/utils/optimizeCallback.js", "../../../node_modules/mathjs/lib/esm/type/matrix/DenseMatrix.js", "../../../node_modules/mathjs/lib/esm/function/utils/clone.js", "../../../node_modules/mathjs/lib/esm/utils/switch.js", "../../../node_modules/mathjs/lib/esm/utils/collection.js", "../../../node_modules/mathjs/lib/esm/function/utils/isInteger.js", "../../../node_modules/mathjs/lib/esm/plain/number/arithmetic.js", "../../../node_modules/mathjs/lib/esm/plain/number/bitwise.js", "../../../node_modules/mathjs/lib/esm/utils/product.js", "../../../node_modules/mathjs/lib/esm/plain/number/combinations.js", "../../../node_modules/mathjs/lib/esm/plain/number/constants.js", "../../../node_modules/mathjs/lib/esm/plain/number/logical.js", "../../../node_modules/mathjs/lib/esm/plain/number/probability.js", "../../../node_modules/mathjs/lib/esm/plain/number/trigonometry.js", "../../../node_modules/mathjs/lib/esm/plain/number/utils.js", "../../../node_modules/mathjs/lib/esm/utils/bignumber/nearlyEqual.js", "../../../node_modules/mathjs/lib/esm/function/utils/isNegative.js", "../../../node_modules/mathjs/lib/esm/function/utils/isNumeric.js", "../../../node_modules/mathjs/lib/esm/function/utils/hasNumericValue.js", "../../../node_modules/mathjs/lib/esm/function/utils/isPositive.js", "../../../node_modules/mathjs/lib/esm/function/utils/isZero.js", "../../../node_modules/mathjs/lib/esm/function/utils/isNaN.js", "../../../node_modules/mathjs/lib/esm/function/utils/isBounded.js", "../../../node_modules/mathjs/lib/esm/function/utils/isFinite.js", "../../../node_modules/mathjs/lib/esm/function/utils/typeOf.js", "../../../node_modules/mathjs/lib/esm/utils/complex.js", "../../../node_modules/mathjs/lib/esm/function/relational/compareUnits.js", "../../../node_modules/mathjs/lib/esm/function/relational/equalScalar.js", "../../../node_modules/mathjs/lib/esm/type/matrix/SparseMatrix.js", "../../../node_modules/mathjs/lib/esm/type/number.js", "../../../node_modules/mathjs/lib/esm/type/bigint.js", "../../../node_modules/mathjs/lib/esm/type/string.js", "../../../node_modules/mathjs/lib/esm/type/boolean.js", "../../../node_modules/mathjs/lib/esm/type/bignumber/function/bignumber.js", "../../../node_modules/mathjs/lib/esm/type/complex/function/complex.js", "../../../node_modules/mathjs/lib/esm/type/fraction/function/fraction.js", "../../../node_modules/mathjs/lib/esm/type/matrix/function/matrix.js", "../../../node_modules/mathjs/lib/esm/function/matrix/matrixFromFunction.js", "../../../node_modules/mathjs/lib/esm/function/matrix/matrixFromRows.js", "../../../node_modules/mathjs/lib/esm/function/matrix/matrixFromColumns.js", "../../../node_modules/mathjs/lib/esm/type/unit/function/splitUnit.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/unaryMinus.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/unaryPlus.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/abs.js", "../../../node_modules/mathjs/lib/esm/function/matrix/mapSlices.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/addScalar.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/subtractScalar.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/cbrt.js", "../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo11xS0s.js", "../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo12xSfs.js", "../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo14xDs.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/ceil.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/cube.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/exp.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/expm1.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/fix.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/floor.js", "../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo02xDS0.js", "../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo03xDSf.js", "../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo05xSfSf.js", "../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo13xDD.js", "../../../node_modules/mathjs/lib/esm/type/matrix/utils/broadcast.js", "../../../node_modules/mathjs/lib/esm/type/matrix/utils/matrixAlgorithmSuite.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/mod.js", "../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo01xDSid.js", "../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo04xSidSid.js", "../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo10xSids.js", "../../../node_modules/mathjs/lib/esm/error/ArgumentsError.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/gcd.js", "../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo06xS0S0.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/lcm.js", "../../../node_modules/mathjs/lib/esm/utils/bigint.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/log10.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/log2.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/multiplyScalar.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/multiply.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/nthRoot.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/sign.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/sqrt.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/square.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/subtract.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/xgcd.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/invmod.js", "../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo09xS0Sf.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/dotMultiply.js", "../../../node_modules/mathjs/lib/esm/utils/bignumber/bitwise.js", "../../../node_modules/mathjs/lib/esm/function/bitwise/bitAnd.js", "../../../node_modules/mathjs/lib/esm/function/bitwise/bitNot.js", "../../../node_modules/mathjs/lib/esm/function/bitwise/bitOr.js", "../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo07xSSf.js", "../../../node_modules/mathjs/lib/esm/function/bitwise/bitXor.js", "../../../node_modules/mathjs/lib/esm/function/complex/arg.js", "../../../node_modules/mathjs/lib/esm/function/complex/conj.js", "../../../node_modules/mathjs/lib/esm/function/complex/im.js", "../../../node_modules/mathjs/lib/esm/function/complex/re.js", "../../../node_modules/mathjs/lib/esm/function/logical/not.js", "../../../node_modules/mathjs/lib/esm/function/logical/nullish.js", "../../../node_modules/mathjs/lib/esm/function/logical/or.js", "../../../node_modules/mathjs/lib/esm/function/logical/xor.js", "../../../node_modules/mathjs/lib/esm/function/matrix/concat.js", "../../../node_modules/mathjs/lib/esm/function/matrix/column.js", "../../../node_modules/mathjs/lib/esm/function/matrix/count.js", "../../../node_modules/mathjs/lib/esm/function/matrix/cross.js", "../../../node_modules/mathjs/lib/esm/function/matrix/diag.js", "../../../node_modules/mathjs/lib/esm/function/matrix/filter.js", "../../../node_modules/mathjs/lib/esm/function/matrix/flatten.js", "../../../node_modules/mathjs/lib/esm/function/matrix/forEach.js", "../../../node_modules/mathjs/lib/esm/function/matrix/getMatrixDataType.js", "../../../node_modules/mathjs/lib/esm/function/matrix/identity.js", "../../../node_modules/mathjs/lib/esm/function/matrix/kron.js", "../../../node_modules/mathjs/lib/esm/function/matrix/map.js", "../../../node_modules/mathjs/lib/esm/function/matrix/diff.js", "../../../node_modules/mathjs/lib/esm/function/matrix/ones.js", "../../../node_modules/mathjs/lib/esm/utils/noop.js", "../../../node_modules/mathjs/lib/esm/function/matrix/range.js", "../../../node_modules/mathjs/lib/esm/function/matrix/reshape.js", "../../../node_modules/mathjs/lib/esm/function/matrix/resize.js", "../../../node_modules/mathjs/lib/esm/function/matrix/rotate.js", "../../../node_modules/mathjs/lib/esm/function/matrix/rotationMatrix.js", "../../../node_modules/mathjs/lib/esm/function/matrix/row.js", "../../../node_modules/mathjs/lib/esm/function/matrix/size.js", "../../../node_modules/mathjs/lib/esm/function/matrix/squeeze.js", "../../../node_modules/mathjs/lib/esm/function/matrix/subset.js", "../../../node_modules/mathjs/lib/esm/function/matrix/transpose.js", "../../../node_modules/mathjs/lib/esm/function/matrix/ctranspose.js", "../../../node_modules/mathjs/lib/esm/function/matrix/zeros.js", "../../../node_modules/mathjs/lib/esm/function/matrix/fft.js", "../../../node_modules/mathjs/lib/esm/function/matrix/ifft.js", "../../../node_modules/@babel/runtime/helpers/esm/typeof.js", "../../../node_modules/@babel/runtime/helpers/esm/toPrimitive.js", "../../../node_modules/@babel/runtime/helpers/esm/toPropertyKey.js", "../../../node_modules/@babel/runtime/helpers/esm/defineProperty.js", "../../../node_modules/mathjs/lib/esm/function/numeric/solveODE.js", "../../../node_modules/mathjs/lib/esm/function/special/erf.js", "../../../node_modules/mathjs/lib/esm/function/special/zeta.js", "../../../node_modules/mathjs/lib/esm/function/statistics/mode.js", "../../../node_modules/mathjs/lib/esm/function/statistics/utils/improveErrorMessage.js", "../../../node_modules/mathjs/lib/esm/function/statistics/prod.js", "../../../node_modules/mathjs/lib/esm/function/string/format.js", "../../../node_modules/mathjs/lib/esm/function/string/bin.js", "../../../node_modules/mathjs/lib/esm/function/string/oct.js", "../../../node_modules/mathjs/lib/esm/function/string/hex.js", "../../../node_modules/mathjs/lib/esm/utils/print.js", "../../../node_modules/mathjs/lib/esm/function/string/print.js", "../../../node_modules/mathjs/lib/esm/function/unit/to.js", "../../../node_modules/mathjs/lib/esm/function/unit/toBest.js", "../../../node_modules/mathjs/lib/esm/function/utils/isPrime.js", "../../../node_modules/mathjs/lib/esm/function/utils/numeric.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/divideScalar.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/pow.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/round.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/log.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/log1p.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/nthRoots.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/dotPow.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/dotDivide.js", "../../../node_modules/mathjs/lib/esm/function/algebra/solver/utils/solveValidation.js", "../../../node_modules/mathjs/lib/esm/function/algebra/solver/lsolve.js", "../../../node_modules/mathjs/lib/esm/function/algebra/solver/usolve.js", "../../../node_modules/mathjs/lib/esm/function/algebra/solver/lsolveAll.js", "../../../node_modules/mathjs/lib/esm/function/algebra/solver/usolveAll.js", "../../../node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo08xS0Sid.js", "../../../node_modules/mathjs/lib/esm/function/bitwise/useMatrixForArrayScalar.js", "../../../node_modules/mathjs/lib/esm/function/bitwise/leftShift.js", "../../../node_modules/mathjs/lib/esm/function/bitwise/rightArithShift.js", "../../../node_modules/mathjs/lib/esm/function/bitwise/rightLogShift.js", "../../../node_modules/mathjs/lib/esm/function/logical/and.js", "../../../node_modules/mathjs/lib/esm/function/relational/compare.js", "../../../node_modules/mathjs/lib/esm/function/relational/compareNatural.js", "../../../node_modules/mathjs/lib/esm/function/relational/compareText.js", "../../../node_modules/mathjs/lib/esm/function/relational/equal.js", "../../../node_modules/mathjs/lib/esm/function/relational/equalText.js", "../../../node_modules/mathjs/lib/esm/function/relational/smaller.js", "../../../node_modules/mathjs/lib/esm/function/relational/smallerEq.js", "../../../node_modules/mathjs/lib/esm/function/relational/larger.js", "../../../node_modules/mathjs/lib/esm/function/relational/largerEq.js", "../../../node_modules/mathjs/lib/esm/function/relational/deepEqual.js", "../../../node_modules/mathjs/lib/esm/function/relational/unequal.js", "../../../node_modules/mathjs/lib/esm/function/matrix/partitionSelect.js", "../../../node_modules/mathjs/lib/esm/function/matrix/sort.js", "../../../node_modules/mathjs/lib/esm/function/statistics/max.js", "../../../node_modules/mathjs/lib/esm/function/statistics/min.js", "../../../node_modules/mathjs/lib/esm/type/matrix/ImmutableDenseMatrix.js", "../../../node_modules/mathjs/lib/esm/type/matrix/MatrixIndex.js", "../../../node_modules/mathjs/lib/esm/type/matrix/FibonacciHeap.js", "../../../node_modules/mathjs/lib/esm/type/matrix/Spa.js", "../../../node_modules/mathjs/lib/esm/utils/lruQueue.js", "../../../node_modules/mathjs/lib/esm/utils/function.js", "../../../node_modules/mathjs/lib/esm/utils/bignumber/constants.js", "../../../node_modules/mathjs/lib/esm/type/unit/Unit.js", "../../../node_modules/mathjs/lib/esm/type/unit/function/unit.js", "../../../node_modules/mathjs/lib/esm/type/matrix/function/sparse.js", "../../../node_modules/mathjs/lib/esm/type/unit/function/createUnit.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/acos.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/acosh.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/acot.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/acoth.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/acsc.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/acsch.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/asec.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/asech.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/asin.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/asinh.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/atan.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/atan2.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/atanh.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/trigUnit.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/cos.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/cosh.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/cot.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/coth.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/csc.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/csch.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/sec.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/sech.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/sin.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/sinh.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/tan.js", "../../../node_modules/mathjs/lib/esm/function/trigonometry/tanh.js", "../../../node_modules/mathjs/lib/esm/function/set/setCartesian.js", "../../../node_modules/mathjs/lib/esm/function/set/setDifference.js", "../../../node_modules/mathjs/lib/esm/function/set/setDistinct.js", "../../../node_modules/mathjs/lib/esm/function/set/setIntersect.js", "../../../node_modules/mathjs/lib/esm/function/set/setIsSubset.js", "../../../node_modules/mathjs/lib/esm/function/set/setMultiplicity.js", "../../../node_modules/mathjs/lib/esm/function/set/setPowerset.js", "../../../node_modules/mathjs/lib/esm/function/set/setSize.js", "../../../node_modules/mathjs/lib/esm/function/set/setSymDifference.js", "../../../node_modules/mathjs/lib/esm/function/set/setUnion.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/add.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/hypot.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/norm.js", "../../../node_modules/mathjs/lib/esm/function/matrix/dot.js", "../../../node_modules/mathjs/lib/esm/function/matrix/trace.js", "../../../node_modules/mathjs/lib/esm/type/matrix/function/index.js", "../../../node_modules/mathjs/lib/esm/expression/keywords.js", "../../../node_modules/mathjs/lib/esm/expression/node/Node.js", "../../../node_modules/mathjs/lib/esm/expression/transform/utils/errorTransform.js", "../../../node_modules/mathjs/lib/esm/expression/node/utils/access.js", "../../../node_modules/mathjs/lib/esm/expression/node/AccessorNode.js", "../../../node_modules/mathjs/lib/esm/expression/node/ArrayNode.js", "../../../node_modules/mathjs/lib/esm/expression/node/utils/assign.js", "../../../node_modules/mathjs/lib/esm/expression/operators.js", "../../../node_modules/mathjs/lib/esm/expression/node/AssignmentNode.js", "../../../node_modules/mathjs/lib/esm/expression/node/BlockNode.js", "../../../node_modules/mathjs/lib/esm/expression/node/ConditionalNode.js", "../../../node_modules/mathjs/lib/esm/utils/latex.js", "../../../node_modules/mathjs/lib/esm/expression/node/ConstantNode.js", "../../../node_modules/mathjs/lib/esm/expression/node/FunctionAssignmentNode.js", "../../../node_modules/mathjs/lib/esm/expression/node/IndexNode.js", "../../../node_modules/mathjs/lib/esm/expression/node/ObjectNode.js", "../../../node_modules/mathjs/lib/esm/utils/scope.js", "../../../node_modules/mathjs/lib/esm/expression/node/OperatorNode.js", "../../../node_modules/mathjs/lib/esm/expression/node/ParenthesisNode.js", "../../../node_modules/mathjs/lib/esm/expression/node/RangeNode.js", "../../../node_modules/mathjs/lib/esm/expression/node/RelationalNode.js", "../../../node_modules/mathjs/lib/esm/expression/node/SymbolNode.js", "../../../node_modules/mathjs/lib/esm/expression/node/FunctionNode.js", "../../../node_modules/mathjs/lib/esm/expression/parse.js", "../../../node_modules/mathjs/lib/esm/expression/function/compile.js", "../../../node_modules/mathjs/lib/esm/expression/function/evaluate.js", "../../../node_modules/mathjs/lib/esm/expression/Parser.js", "../../../node_modules/mathjs/lib/esm/expression/function/parser.js", "../../../node_modules/mathjs/lib/esm/function/algebra/decomposition/lup.js", "../../../node_modules/mathjs/lib/esm/function/algebra/decomposition/qr.js", "../../../node_modules/mathjs/lib/esm/function/algebra/sparse/csPermute.js", "../../../node_modules/mathjs/lib/esm/function/algebra/sparse/csTdfs.js", "../../../node_modules/mathjs/lib/esm/function/algebra/sparse/csPost.js", "../../../node_modules/mathjs/lib/esm/function/algebra/sparse/csEtree.js", "../../../node_modules/mathjs/lib/esm/function/algebra/sparse/csFkeep.js", "../../../node_modules/mathjs/lib/esm/function/algebra/sparse/csFlip.js", "../../../node_modules/mathjs/lib/esm/function/algebra/sparse/csAmd.js", "../../../node_modules/mathjs/lib/esm/function/algebra/sparse/csLeaf.js", "../../../node_modules/mathjs/lib/esm/function/algebra/sparse/csCounts.js", "../../../node_modules/mathjs/lib/esm/function/algebra/sparse/csSqr.js", "../../../node_modules/mathjs/lib/esm/function/algebra/sparse/csMarked.js", "../../../node_modules/mathjs/lib/esm/function/algebra/sparse/csMark.js", "../../../node_modules/mathjs/lib/esm/function/algebra/sparse/csUnflip.js", "../../../node_modules/mathjs/lib/esm/function/algebra/sparse/csDfs.js", "../../../node_modules/mathjs/lib/esm/function/algebra/sparse/csReach.js", "../../../node_modules/mathjs/lib/esm/function/algebra/sparse/csSpsolve.js", "../../../node_modules/mathjs/lib/esm/function/algebra/sparse/csLu.js", "../../../node_modules/mathjs/lib/esm/function/algebra/decomposition/slu.js", "../../../node_modules/mathjs/lib/esm/function/algebra/sparse/csIpvec.js", "../../../node_modules/mathjs/lib/esm/function/algebra/solver/lusolve.js", "../../../node_modules/mathjs/lib/esm/function/algebra/polynomialRoot.js", "../../../node_modules/mathjs/lib/esm/expression/Help.js", "../../../node_modules/mathjs/lib/esm/type/chain/Chain.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/e.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/false.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/i.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/Infinity.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LN10.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LN2.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LOG10E.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LOG2E.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/NaN.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/null.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/phi.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/pi.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/SQRT1_2.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/SQRT2.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/tau.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/true.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/version.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/bignumber.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/bigint.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/boolean.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/complex.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/createUnit.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/fraction.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/index.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/matrix.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/number.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/sparse.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/splitUnit.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/string.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/unit.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/core/config.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/core/import.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/core/typed.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/derivative.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/leafCount.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lsolve.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lsolveAll.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lup.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lusolve.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/polynomialRoot.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/qr.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/rationalize.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/resolve.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/simplify.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/simplifyConstant.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/simplifyCore.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/slu.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/symbolicEqual.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/usolve.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/usolveAll.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/abs.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/add.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/cbrt.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/ceil.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/cube.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/divide.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotDivide.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotMultiply.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotPow.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/exp.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/expm.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/expm1.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/fix.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/floor.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/gcd.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/hypot.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/invmod.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/lcm.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log10.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log1p.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log2.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/mod.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/multiply.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/norm.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/nthRoot.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/nthRoots.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/pow.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/round.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sign.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sqrt.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sqrtm.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/sylvester.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/schur.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lyap.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/square.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/subtract.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/unaryMinus.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/unaryPlus.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/xgcd.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitAnd.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitNot.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitOr.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitXor.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/leftShift.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/rightArithShift.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/rightLogShift.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/bellNumbers.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/catalan.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/composition.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/stirlingS2.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/arg.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/conj.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/im.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/re.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/evaluate.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/parser.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/parse.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/compile.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/help.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/geometry/distance.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/geometry/intersect.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/and.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/not.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/nullish.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/or.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/xor.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/mapSlices.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/column.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/concat.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/count.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/cross.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/ctranspose.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/det.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/diag.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/diff.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/dot.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/eigs.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/filter.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/flatten.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/forEach.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/getMatrixDataType.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/identity.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/inv.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/pinv.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/kron.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/map.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/matrixFromColumns.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/matrixFromFunction.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/matrixFromRows.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/ones.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/partitionSelect.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/range.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/reshape.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/resize.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/rotate.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/rotationMatrix.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/row.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/size.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/sort.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/squeeze.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/subset.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/trace.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/transpose.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/zeros.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/fft.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/ifft.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/bernoulli.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/combinations.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/combinationsWithRep.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/factorial.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/gamma.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/lgamma.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/kldivergence.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/multinomial.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/permutations.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/pickRandom.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/random.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/randomInt.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compare.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compareNatural.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compareText.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/deepEqual.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/equal.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/equalText.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/larger.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/largerEq.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/smaller.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/smallerEq.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/unequal.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setCartesian.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setDifference.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setDistinct.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setIntersect.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setIsSubset.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setMultiplicity.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setPowerset.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setSize.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setSymDifference.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setUnion.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/signal/zpk2tf.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/signal/freqz.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/special/erf.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/special/zeta.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mad.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/max.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mean.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/median.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/min.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mode.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/prod.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/quantileSeq.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/std.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/cumsum.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/sum.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/variance.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/corr.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acos.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acosh.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acot.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acoth.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acsc.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acsch.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asec.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asech.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asin.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asinh.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atan.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atan2.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atanh.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cos.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cosh.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cot.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/coth.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/csc.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/csch.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sec.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sech.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sin.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sinh.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/tan.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/tanh.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/units/to.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/units/toBest.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/bin.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/clone.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/format.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/hasNumericValue.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/hex.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isInteger.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNaN.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isBounded.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isFinite.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNegative.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNumeric.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isPositive.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isPrime.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isZero.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/numeric.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/oct.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/print.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/typeOf.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/function/numeric/solveODE.js", "../../../node_modules/mathjs/lib/esm/expression/embeddedDocs/embeddedDocs.js", "../../../node_modules/mathjs/lib/esm/expression/function/help.js", "../../../node_modules/mathjs/lib/esm/type/chain/function/chain.js", "../../../node_modules/mathjs/lib/esm/function/matrix/det.js", "../../../node_modules/mathjs/lib/esm/function/matrix/inv.js", "../../../node_modules/mathjs/lib/esm/function/matrix/pinv.js", "../../../node_modules/mathjs/lib/esm/function/matrix/eigs/complexEigs.js", "../../../node_modules/mathjs/lib/esm/function/matrix/eigs/realSymmetric.js", "../../../node_modules/mathjs/lib/esm/function/matrix/eigs.js", "../../../node_modules/mathjs/lib/esm/function/matrix/expm.js", "../../../node_modules/mathjs/lib/esm/function/matrix/sqrtm.js", "../../../node_modules/mathjs/lib/esm/function/algebra/sylvester.js", "../../../node_modules/mathjs/lib/esm/function/algebra/decomposition/schur.js", "../../../node_modules/mathjs/lib/esm/function/algebra/lyap.js", "../../../node_modules/mathjs/lib/esm/function/arithmetic/divide.js", "../../../node_modules/mathjs/lib/esm/function/geometry/distance.js", "../../../node_modules/mathjs/lib/esm/function/geometry/intersect.js", "../../../node_modules/mathjs/lib/esm/function/statistics/sum.js", "../../../node_modules/mathjs/lib/esm/function/statistics/cumsum.js", "../../../node_modules/mathjs/lib/esm/function/statistics/mean.js", "../../../node_modules/mathjs/lib/esm/function/statistics/median.js", "../../../node_modules/mathjs/lib/esm/function/statistics/mad.js", "../../../node_modules/mathjs/lib/esm/function/statistics/variance.js", "../../../node_modules/mathjs/lib/esm/function/statistics/quantileSeq.js", "../../../node_modules/mathjs/lib/esm/function/statistics/std.js", "../../../node_modules/mathjs/lib/esm/function/statistics/corr.js", "../../../node_modules/mathjs/lib/esm/function/probability/bernoulli.js", "../../../node_modules/mathjs/lib/esm/function/probability/combinations.js", "../../../node_modules/mathjs/lib/esm/function/probability/combinationsWithRep.js", "../../../node_modules/mathjs/lib/esm/function/probability/gamma.js", "../../../node_modules/mathjs/lib/esm/function/probability/lgamma.js", "../../../node_modules/mathjs/lib/esm/function/probability/factorial.js", "../../../node_modules/mathjs/lib/esm/function/probability/kldivergence.js", "../../../node_modules/mathjs/lib/esm/function/probability/multinomial.js", "../../../node_modules/mathjs/lib/esm/function/probability/permutations.js", "../../../node_modules/mathjs/lib/esm/function/probability/util/seededRNG.js", "../../../node_modules/mathjs/lib/esm/function/probability/pickRandom.js", "../../../node_modules/mathjs/lib/esm/function/probability/util/randomMatrix.js", "../../../node_modules/mathjs/lib/esm/function/probability/random.js", "../../../node_modules/mathjs/lib/esm/function/probability/randomInt.js", "../../../node_modules/mathjs/lib/esm/function/combinatorics/stirlingS2.js", "../../../node_modules/mathjs/lib/esm/function/combinatorics/bellNumbers.js", "../../../node_modules/mathjs/lib/esm/function/combinatorics/catalan.js", "../../../node_modules/mathjs/lib/esm/function/combinatorics/composition.js", "../../../node_modules/mathjs/lib/esm/function/algebra/leafCount.js", "../../../node_modules/mathjs/lib/esm/function/algebra/simplify/wildcards.js", "../../../node_modules/mathjs/lib/esm/function/algebra/simplify/util.js", "../../../node_modules/mathjs/lib/esm/function/algebra/simplify.js", "../../../node_modules/mathjs/lib/esm/function/algebra/simplifyConstant.js", "../../../node_modules/mathjs/lib/esm/function/algebra/simplifyCore.js", "../../../node_modules/mathjs/lib/esm/function/algebra/resolve.js", "../../../node_modules/mathjs/lib/esm/function/algebra/symbolicEqual.js", "../../../node_modules/mathjs/lib/esm/function/algebra/derivative.js", "../../../node_modules/mathjs/lib/esm/function/algebra/rationalize.js", "../../../node_modules/mathjs/lib/esm/function/signal/zpk2tf.js", "../../../node_modules/mathjs/lib/esm/function/signal/freqz.js", "../../../node_modules/mathjs/lib/esm/json/reviver.js", "../../../node_modules/mathjs/lib/esm/json/replacer.js", "../../../node_modules/mathjs/lib/esm/version.js", "../../../node_modules/mathjs/lib/esm/constants.js", "../../../node_modules/mathjs/lib/esm/type/unit/physicalConstants.js", "../../../node_modules/mathjs/lib/esm/expression/transform/mapSlices.transform.js", "../../../node_modules/mathjs/lib/esm/expression/transform/column.transform.js", "../../../node_modules/mathjs/lib/esm/expression/transform/utils/compileInlineExpression.js", "../../../node_modules/mathjs/lib/esm/expression/transform/utils/transformCallback.js", "../../../node_modules/mathjs/lib/esm/expression/transform/filter.transform.js", "../../../node_modules/mathjs/lib/esm/expression/transform/forEach.transform.js", "../../../node_modules/mathjs/lib/esm/expression/transform/index.transform.js", "../../../node_modules/mathjs/lib/esm/expression/transform/map.transform.js", "../../../node_modules/mathjs/lib/esm/expression/transform/utils/dimToZeroBase.js", "../../../node_modules/mathjs/lib/esm/expression/transform/utils/lastDimToZeroBase.js", "../../../node_modules/mathjs/lib/esm/expression/transform/max.transform.js", "../../../node_modules/mathjs/lib/esm/expression/transform/mean.transform.js", "../../../node_modules/mathjs/lib/esm/expression/transform/min.transform.js", "../../../node_modules/mathjs/lib/esm/expression/transform/range.transform.js", "../../../node_modules/mathjs/lib/esm/expression/transform/row.transform.js", "../../../node_modules/mathjs/lib/esm/expression/transform/subset.transform.js", "../../../node_modules/mathjs/lib/esm/expression/transform/concat.transform.js", "../../../node_modules/mathjs/lib/esm/expression/transform/diff.transform.js", "../../../node_modules/mathjs/lib/esm/expression/transform/std.transform.js", "../../../node_modules/mathjs/lib/esm/expression/transform/sum.transform.js", "../../../node_modules/mathjs/lib/esm/expression/transform/quantileSeq.transform.js", "../../../node_modules/mathjs/lib/esm/expression/transform/cumsum.transform.js", "../../../node_modules/mathjs/lib/esm/expression/transform/variance.transform.js", "../../../node_modules/mathjs/lib/esm/expression/transform/print.transform.js", "../../../node_modules/mathjs/lib/esm/expression/transform/and.transform.js", "../../../node_modules/mathjs/lib/esm/expression/transform/or.transform.js", "../../../node_modules/mathjs/lib/esm/expression/transform/nullish.transform.js", "../../../node_modules/mathjs/lib/esm/expression/transform/bitAnd.transform.js", "../../../node_modules/mathjs/lib/esm/expression/transform/bitOr.transform.js", "../../../node_modules/mathjs/lib/esm/entry/pureFunctionsAny.generated.js", "../../../node_modules/mathjs/lib/esm/entry/impureFunctionsAny.generated.js", "../../javascript/controllers/inline_calculator_controller.js", "../../javascript/controllers/index.js", "../../javascript/application.js"],
  "sourcesContent": ["export default {\n  logger: typeof console !== \"undefined\" ? console : undefined,\n  WebSocket: typeof WebSocket !== \"undefined\" ? WebSocket : undefined,\n}\n", "import adapters from \"./adapters\"\n\n// The logger is disabled by default. You can enable it with:\n//\n//   ActionCable.logger.enabled = true\n//\n//   Example:\n//\n//   import * as ActionCable from '@rails/actioncable'\n//\n//   ActionCable.logger.enabled = true\n//   ActionCable.logger.log('Connection Established.')\n//\n\nexport default {\n  log(...messages) {\n    if (this.enabled) {\n      messages.push(Date.now())\n      adapters.logger.log(\"[ActionCable]\", ...messages)\n    }\n  },\n}\n", "import logger from \"./logger\"\n\n// Responsible for ensuring the cable connection is in good health by validating the heartbeat pings sent from the server, and attempting\n// revival reconnections if things go astray. Internal class, not intended for direct user manipulation.\n\nconst now = () => new Date().getTime()\n\nconst secondsSince = time => (now() - time) / 1000\n\nclass ConnectionMonitor {\n  constructor(connection) {\n    this.visibilityDidChange = this.visibilityDidChange.bind(this)\n    this.connection = connection\n    this.reconnectAttempts = 0\n  }\n\n  start() {\n    if (!this.isRunning()) {\n      this.startedAt = now()\n      delete this.stoppedAt\n      this.startPolling()\n      addEventListener(\"visibilitychange\", this.visibilityDidChange)\n      logger.log(`ConnectionMonitor started. stale threshold = ${this.constructor.staleThreshold} s`)\n    }\n  }\n\n  stop() {\n    if (this.isRunning()) {\n      this.stoppedAt = now()\n      this.stopPolling()\n      removeEventListener(\"visibilitychange\", this.visibilityDidChange)\n      logger.log(\"ConnectionMonitor stopped\")\n    }\n  }\n\n  isRunning() {\n    return this.startedAt && !this.stoppedAt\n  }\n\n  recordMessage() {\n    this.pingedAt = now()\n  }\n\n  recordConnect() {\n    this.reconnectAttempts = 0\n    delete this.disconnectedAt\n    logger.log(\"ConnectionMonitor recorded connect\")\n  }\n\n  recordDisconnect() {\n    this.disconnectedAt = now()\n    logger.log(\"ConnectionMonitor recorded disconnect\")\n  }\n\n  // Private\n\n  startPolling() {\n    this.stopPolling()\n    this.poll()\n  }\n\n  stopPolling() {\n    clearTimeout(this.pollTimeout)\n  }\n\n  poll() {\n    this.pollTimeout = setTimeout(() => {\n      this.reconnectIfStale()\n      this.poll()\n    }\n    , this.getPollInterval())\n  }\n\n  getPollInterval() {\n    const { staleThreshold, reconnectionBackoffRate } = this.constructor\n    const backoff = Math.pow(1 + reconnectionBackoffRate, Math.min(this.reconnectAttempts, 10))\n    const jitterMax = this.reconnectAttempts === 0 ? 1.0 : reconnectionBackoffRate\n    const jitter = jitterMax * Math.random()\n    return staleThreshold * 1000 * backoff * (1 + jitter)\n  }\n\n  reconnectIfStale() {\n    if (this.connectionIsStale()) {\n      logger.log(`ConnectionMonitor detected stale connection. reconnectAttempts = ${this.reconnectAttempts}, time stale = ${secondsSince(this.refreshedAt)} s, stale threshold = ${this.constructor.staleThreshold} s`)\n      this.reconnectAttempts++\n      if (this.disconnectedRecently()) {\n        logger.log(`ConnectionMonitor skipping reopening recent disconnect. time disconnected = ${secondsSince(this.disconnectedAt)} s`)\n      } else {\n        logger.log(\"ConnectionMonitor reopening\")\n        this.connection.reopen()\n      }\n    }\n  }\n\n  get refreshedAt() {\n    return this.pingedAt ? this.pingedAt : this.startedAt\n  }\n\n  connectionIsStale() {\n    return secondsSince(this.refreshedAt) > this.constructor.staleThreshold\n  }\n\n  disconnectedRecently() {\n    return this.disconnectedAt && (secondsSince(this.disconnectedAt) < this.constructor.staleThreshold)\n  }\n\n  visibilityDidChange() {\n    if (document.visibilityState === \"visible\") {\n      setTimeout(() => {\n        if (this.connectionIsStale() || !this.connection.isOpen()) {\n          logger.log(`ConnectionMonitor reopening stale connection on visibilitychange. visibilityState = ${document.visibilityState}`)\n          this.connection.reopen()\n        }\n      }\n      , 200)\n    }\n  }\n\n}\n\nConnectionMonitor.staleThreshold = 6 // Server::Connections::BEAT_INTERVAL * 2 (missed two pings)\nConnectionMonitor.reconnectionBackoffRate = 0.15\n\nexport default ConnectionMonitor\n", "export default {\n  \"message_types\": {\n    \"welcome\": \"welcome\",\n    \"disconnect\": \"disconnect\",\n    \"ping\": \"ping\",\n    \"confirmation\": \"confirm_subscription\",\n    \"rejection\": \"reject_subscription\"\n  },\n  \"disconnect_reasons\": {\n    \"unauthorized\": \"unauthorized\",\n    \"invalid_request\": \"invalid_request\",\n    \"server_restart\": \"server_restart\",\n    \"remote\": \"remote\"\n  },\n  \"default_mount_path\": \"/cable\",\n  \"protocols\": [\n    \"actioncable-v1-json\",\n    \"actioncable-unsupported\"\n  ]\n}\n", "import adapters from \"./adapters\"\nimport ConnectionMonitor from \"./connection_monitor\"\nimport INTERNAL from \"./internal\"\nimport logger from \"./logger\"\n\n// Encapsulate the cable connection held by the consumer. This is an internal class not intended for direct user manipulation.\n\nconst {message_types, protocols} = INTERNAL\nconst supportedProtocols = protocols.slice(0, protocols.length - 1)\n\nconst indexOf = [].indexOf\n\nclass Connection {\n  constructor(consumer) {\n    this.open = this.open.bind(this)\n    this.consumer = consumer\n    this.subscriptions = this.consumer.subscriptions\n    this.monitor = new ConnectionMonitor(this)\n    this.disconnected = true\n  }\n\n  send(data) {\n    if (this.isOpen()) {\n      this.webSocket.send(JSON.stringify(data))\n      return true\n    } else {\n      return false\n    }\n  }\n\n  open() {\n    if (this.isActive()) {\n      logger.log(`Attempted to open WebSocket, but existing socket is ${this.getState()}`)\n      return false\n    } else {\n      const socketProtocols = [...protocols, ...this.consumer.subprotocols || []]\n      logger.log(`Opening WebSocket, current state is ${this.getState()}, subprotocols: ${socketProtocols}`)\n      if (this.webSocket) { this.uninstallEventHandlers() }\n      this.webSocket = new adapters.WebSocket(this.consumer.url, socketProtocols)\n      this.installEventHandlers()\n      this.monitor.start()\n      return true\n    }\n  }\n\n  close({allowReconnect} = {allowReconnect: true}) {\n    if (!allowReconnect) { this.monitor.stop() }\n    // Avoid closing websockets in a \"connecting\" state due to Safari 15.1+ bug. See: https://github.com/rails/rails/issues/43835#issuecomment-1002288478\n    if (this.isOpen()) {\n      return this.webSocket.close()\n    }\n  }\n\n  reopen() {\n    logger.log(`Reopening WebSocket, current state is ${this.getState()}`)\n    if (this.isActive()) {\n      try {\n        return this.close()\n      } catch (error) {\n        logger.log(\"Failed to reopen WebSocket\", error)\n      }\n      finally {\n        logger.log(`Reopening WebSocket in ${this.constructor.reopenDelay}ms`)\n        setTimeout(this.open, this.constructor.reopenDelay)\n      }\n    } else {\n      return this.open()\n    }\n  }\n\n  getProtocol() {\n    if (this.webSocket) {\n      return this.webSocket.protocol\n    }\n  }\n\n  isOpen() {\n    return this.isState(\"open\")\n  }\n\n  isActive() {\n    return this.isState(\"open\", \"connecting\")\n  }\n\n  triedToReconnect() {\n    return this.monitor.reconnectAttempts > 0\n  }\n\n  // Private\n\n  isProtocolSupported() {\n    return indexOf.call(supportedProtocols, this.getProtocol()) >= 0\n  }\n\n  isState(...states) {\n    return indexOf.call(states, this.getState()) >= 0\n  }\n\n  getState() {\n    if (this.webSocket) {\n      for (let state in adapters.WebSocket) {\n        if (adapters.WebSocket[state] === this.webSocket.readyState) {\n          return state.toLowerCase()\n        }\n      }\n    }\n    return null\n  }\n\n  installEventHandlers() {\n    for (let eventName in this.events) {\n      const handler = this.events[eventName].bind(this)\n      this.webSocket[`on${eventName}`] = handler\n    }\n  }\n\n  uninstallEventHandlers() {\n    for (let eventName in this.events) {\n      this.webSocket[`on${eventName}`] = function() {}\n    }\n  }\n\n}\n\nConnection.reopenDelay = 500\n\nConnection.prototype.events = {\n  message(event) {\n    if (!this.isProtocolSupported()) { return }\n    const {identifier, message, reason, reconnect, type} = JSON.parse(event.data)\n    this.monitor.recordMessage()\n    switch (type) {\n      case message_types.welcome:\n        if (this.triedToReconnect()) {\n          this.reconnectAttempted = true\n        }\n        this.monitor.recordConnect()\n        return this.subscriptions.reload()\n      case message_types.disconnect:\n        logger.log(`Disconnecting. Reason: ${reason}`)\n        return this.close({allowReconnect: reconnect})\n      case message_types.ping:\n        return null\n      case message_types.confirmation:\n        this.subscriptions.confirmSubscription(identifier)\n        if (this.reconnectAttempted) {\n          this.reconnectAttempted = false\n          return this.subscriptions.notify(identifier, \"connected\", {reconnected: true})\n        } else {\n          return this.subscriptions.notify(identifier, \"connected\", {reconnected: false})\n        }\n      case message_types.rejection:\n        return this.subscriptions.reject(identifier)\n      default:\n        return this.subscriptions.notify(identifier, \"received\", message)\n    }\n  },\n\n  open() {\n    logger.log(`WebSocket onopen event, using '${this.getProtocol()}' subprotocol`)\n    this.disconnected = false\n    if (!this.isProtocolSupported()) {\n      logger.log(\"Protocol is unsupported. Stopping monitor and disconnecting.\")\n      return this.close({allowReconnect: false})\n    }\n  },\n\n  close(event) {\n    logger.log(\"WebSocket onclose event\")\n    if (this.disconnected) { return }\n    this.disconnected = true\n    this.monitor.recordDisconnect()\n    return this.subscriptions.notifyAll(\"disconnected\", {willAttemptReconnect: this.monitor.isRunning()})\n  },\n\n  error() {\n    logger.log(\"WebSocket onerror event\")\n  }\n}\n\nexport default Connection\n", "// A new subscription is created through the ActionCable.Subscriptions instance available on the consumer.\n// It provides a number of callbacks and a method for calling remote procedure calls on the corresponding\n// Channel instance on the server side.\n//\n// An example demonstrates the basic functionality:\n//\n//   App.appearance = App.cable.subscriptions.create(\"AppearanceChannel\", {\n//     connected() {\n//       // Called once the subscription has been successfully completed\n//     },\n//\n//     disconnected({ willAttemptReconnect: boolean }) {\n//       // Called when the client has disconnected with the server.\n//       // The object will have an `willAttemptReconnect` property which\n//       // says whether the client has the intention of attempting\n//       // to reconnect.\n//     },\n//\n//     appear() {\n//       this.perform('appear', {appearing_on: this.appearingOn()})\n//     },\n//\n//     away() {\n//       this.perform('away')\n//     },\n//\n//     appearingOn() {\n//       $('main').data('appearing-on')\n//     }\n//   })\n//\n// The methods #appear and #away forward their intent to the remote AppearanceChannel instance on the server\n// by calling the `perform` method with the first parameter being the action (which maps to AppearanceChannel#appear/away).\n// The second parameter is a hash that'll get JSON encoded and made available on the server in the data parameter.\n//\n// This is how the server component would look:\n//\n//   class AppearanceChannel < ApplicationActionCable::Channel\n//     def subscribed\n//       current_user.appear\n//     end\n//\n//     def unsubscribed\n//       current_user.disappear\n//     end\n//\n//     def appear(data)\n//       current_user.appear on: data['appearing_on']\n//     end\n//\n//     def away\n//       current_user.away\n//     end\n//   end\n//\n// The \"AppearanceChannel\" name is automatically mapped between the client-side subscription creation and the server-side Ruby class name.\n// The AppearanceChannel#appear/away public methods are exposed automatically to client-side invocation through the perform method.\n\nconst extend = function(object, properties) {\n  if (properties != null) {\n    for (let key in properties) {\n      const value = properties[key]\n      object[key] = value\n    }\n  }\n  return object\n}\n\nexport default class Subscription {\n  constructor(consumer, params = {}, mixin) {\n    this.consumer = consumer\n    this.identifier = JSON.stringify(params)\n    extend(this, mixin)\n  }\n\n  // Perform a channel action with the optional data passed as an attribute\n  perform(action, data = {}) {\n    data.action = action\n    return this.send(data)\n  }\n\n  send(data) {\n    return this.consumer.send({command: \"message\", identifier: this.identifier, data: JSON.stringify(data)})\n  }\n\n  unsubscribe() {\n    return this.consumer.subscriptions.remove(this)\n  }\n}\n", "import logger from \"./logger\"\n\n// Responsible for ensuring channel subscribe command is confirmed, retrying until confirmation is received.\n// Internal class, not intended for direct user manipulation.\n\nclass SubscriptionGuarantor {\n  constructor(subscriptions) {\n    this.subscriptions = subscriptions\n    this.pendingSubscriptions = []\n  }\n\n  guarantee(subscription) {\n    if(this.pendingSubscriptions.indexOf(subscription) == -1){ \n      logger.log(`SubscriptionGuarantor guaranteeing ${subscription.identifier}`)\n      this.pendingSubscriptions.push(subscription) \n    }\n    else {\n      logger.log(`SubscriptionGuarantor already guaranteeing ${subscription.identifier}`)\n    }\n    this.startGuaranteeing()\n  }\n\n  forget(subscription) {\n    logger.log(`SubscriptionGuarantor forgetting ${subscription.identifier}`)\n    this.pendingSubscriptions = (this.pendingSubscriptions.filter((s) => s !== subscription))\n  }\n\n  startGuaranteeing() {\n    this.stopGuaranteeing()\n    this.retrySubscribing()\n  }\n  \n  stopGuaranteeing() {\n    clearTimeout(this.retryTimeout)\n  }\n\n  retrySubscribing() {\n    this.retryTimeout = setTimeout(() => {\n      if (this.subscriptions && typeof(this.subscriptions.subscribe) === \"function\") {\n        this.pendingSubscriptions.map((subscription) => {\n          logger.log(`SubscriptionGuarantor resubscribing ${subscription.identifier}`)\n          this.subscriptions.subscribe(subscription)\n        })\n      }\n    }\n    , 500)\n  }\n}\n\nexport default SubscriptionGuarantor", "import Subscription from \"./subscription\"\nimport SubscriptionGuarantor from \"./subscription_guarantor\"\nimport logger from \"./logger\"\n\n// Collection class for creating (and internally managing) channel subscriptions.\n// The only method intended to be triggered by the user is ActionCable.Subscriptions#create,\n// and it should be called through the consumer like so:\n//\n//   App = {}\n//   App.cable = ActionCable.createConsumer(\"ws://example.com/accounts/1\")\n//   App.appearance = App.cable.subscriptions.create(\"AppearanceChannel\")\n//\n// For more details on how you'd configure an actual channel subscription, see ActionCable.Subscription.\n\nexport default class Subscriptions {\n  constructor(consumer) {\n    this.consumer = consumer\n    this.guarantor = new SubscriptionGuarantor(this)\n    this.subscriptions = []\n  }\n\n  create(channelName, mixin) {\n    const channel = channelName\n    const params = typeof channel === \"object\" ? channel : {channel}\n    const subscription = new Subscription(this.consumer, params, mixin)\n    return this.add(subscription)\n  }\n\n  // Private\n\n  add(subscription) {\n    this.subscriptions.push(subscription)\n    this.consumer.ensureActiveConnection()\n    this.notify(subscription, \"initialized\")\n    this.subscribe(subscription)\n    return subscription\n  }\n\n  remove(subscription) {\n    this.forget(subscription)\n    if (!this.findAll(subscription.identifier).length) {\n      this.sendCommand(subscription, \"unsubscribe\")\n    }\n    return subscription\n  }\n\n  reject(identifier) {\n    return this.findAll(identifier).map((subscription) => {\n      this.forget(subscription)\n      this.notify(subscription, \"rejected\")\n      return subscription\n    })\n  }\n\n  forget(subscription) {\n    this.guarantor.forget(subscription)\n    this.subscriptions = (this.subscriptions.filter((s) => s !== subscription))\n    return subscription\n  }\n\n  findAll(identifier) {\n    return this.subscriptions.filter((s) => s.identifier === identifier)\n  }\n\n  reload() {\n    return this.subscriptions.map((subscription) =>\n      this.subscribe(subscription))\n  }\n\n  notifyAll(callbackName, ...args) {\n    return this.subscriptions.map((subscription) =>\n      this.notify(subscription, callbackName, ...args))\n  }\n\n  notify(subscription, callbackName, ...args) {\n    let subscriptions\n    if (typeof subscription === \"string\") {\n      subscriptions = this.findAll(subscription)\n    } else {\n      subscriptions = [subscription]\n    }\n\n    return subscriptions.map((subscription) =>\n      (typeof subscription[callbackName] === \"function\" ? subscription[callbackName](...args) : undefined))\n  }\n\n  subscribe(subscription) {\n    if (this.sendCommand(subscription, \"subscribe\")) {\n      this.guarantor.guarantee(subscription)\n    }\n  }\n\n  confirmSubscription(identifier) {\n    logger.log(`Subscription confirmed ${identifier}`)\n    this.findAll(identifier).map((subscription) =>\n      this.guarantor.forget(subscription))\n  }\n\n  sendCommand(subscription, command) {\n    const {identifier} = subscription\n    return this.consumer.send({command, identifier})\n  }\n}\n", "import Connection from \"./connection\"\nimport Subscriptions from \"./subscriptions\"\n\n// The ActionCable.Consumer establishes the connection to a server-side Ruby Connection object. Once established,\n// the ActionCable.ConnectionMonitor will ensure that its properly maintained through heartbeats and checking for stale updates.\n// The Consumer instance is also the gateway to establishing subscriptions to desired channels through the #createSubscription\n// method.\n//\n// The following example shows how this can be set up:\n//\n//   App = {}\n//   App.cable = ActionCable.createConsumer(\"ws://example.com/accounts/1\")\n//   App.appearance = App.cable.subscriptions.create(\"AppearanceChannel\")\n//\n// For more details on how you'd configure an actual channel subscription, see ActionCable.Subscription.\n//\n// When a consumer is created, it automatically connects with the server.\n//\n// To disconnect from the server, call\n//\n//   App.cable.disconnect()\n//\n// and to restart the connection:\n//\n//   App.cable.connect()\n//\n// Any channel subscriptions which existed prior to disconnecting will\n// automatically resubscribe.\n\nexport default class Consumer {\n  constructor(url) {\n    this._url = url\n    this.subscriptions = new Subscriptions(this)\n    this.connection = new Connection(this)\n    this.subprotocols = []\n  }\n\n  get url() {\n    return createWebSocketURL(this._url)\n  }\n\n  send(data) {\n    return this.connection.send(data)\n  }\n\n  connect() {\n    return this.connection.open()\n  }\n\n  disconnect() {\n    return this.connection.close({allowReconnect: false})\n  }\n\n  ensureActiveConnection() {\n    if (!this.connection.isActive()) {\n      return this.connection.open()\n    }\n  }\n\n  addSubProtocol(subprotocol) {\n    this.subprotocols = [...this.subprotocols, subprotocol]\n  }\n}\n\nexport function createWebSocketURL(url) {\n  if (typeof url === \"function\") {\n    url = url()\n  }\n\n  if (url && !/^wss?:/i.test(url)) {\n    const a = document.createElement(\"a\")\n    a.href = url\n    // Fix populating Location properties in IE. Otherwise, protocol will be blank.\n    a.href = a.href\n    a.protocol = a.protocol.replace(\"http\", \"ws\")\n    return a.href\n  } else {\n    return url\n  }\n}\n", "import Connection from \"./connection\"\nimport ConnectionMonitor from \"./connection_monitor\"\nimport Consumer, { createWebSocketURL } from \"./consumer\"\nimport INTERNAL from \"./internal\"\nimport Subscription from \"./subscription\"\nimport Subscriptions from \"./subscriptions\"\nimport SubscriptionGuarantor from \"./subscription_guarantor\"\nimport adapters from \"./adapters\"\nimport logger from \"./logger\"\n\nexport {\n  Connection,\n  ConnectionMonitor,\n  Consumer,\n  INTERNAL,\n  Subscription,\n  Subscriptions,\n  SubscriptionGuarantor,\n  adapters,\n  createWebSocketURL,\n  logger,\n}\n\nexport function createConsumer(url = getConfig(\"url\") || INTERNAL.default_mount_path) {\n  return new Consumer(url)\n}\n\nexport function getConfig(name) {\n  const element = document.head.querySelector(`meta[name='action-cable-${name}']`)\n  if (element) {\n    return element.getAttribute(\"content\")\n  }\n}\n", "/*!\n * dist/inputmask\n * https://github.com/RobinHerbots/Inputmask\n * Copyright (c) 2010 - 2024 Robin Herbots\n * Licensed under the MIT license\n * Version: 5.0.9\n */\n!function(e, t) {\n    if (\"object\" == typeof exports && \"object\" == typeof module) module.exports = t(); else if (\"function\" == typeof define && define.amd) define([], t); else {\n        var n = t();\n        for (var i in n) (\"object\" == typeof exports ? exports : e)[i] = n[i];\n    }\n}(\"undefined\" != typeof self ? self : this, (function() {\n    return function() {\n        \"use strict\";\n        var e = {\n            3976: function(e, t) {\n                Object.defineProperty(t, \"__esModule\", {\n                    value: !0\n                }), t.default = void 0;\n                t.default = {\n                    _maxTestPos: 500,\n                    placeholder: \"_\",\n                    optionalmarker: [ \"[\", \"]\" ],\n                    quantifiermarker: [ \"{\", \"}\" ],\n                    groupmarker: [ \"(\", \")\" ],\n                    alternatormarker: \"|\",\n                    escapeChar: \"\\\\\",\n                    mask: null,\n                    regex: null,\n                    oncomplete: function() {},\n                    onincomplete: function() {},\n                    oncleared: function() {},\n                    repeat: 0,\n                    greedy: !1,\n                    autoUnmask: !1,\n                    removeMaskOnSubmit: !1,\n                    clearMaskOnLostFocus: !0,\n                    insertMode: !0,\n                    insertModeVisual: !0,\n                    clearIncomplete: !1,\n                    alias: null,\n                    onKeyDown: function() {},\n                    onBeforeMask: null,\n                    onBeforePaste: function(e, t) {\n                        return \"function\" == typeof t.onBeforeMask ? t.onBeforeMask.call(this, e, t) : e;\n                    },\n                    onBeforeWrite: null,\n                    onUnMask: null,\n                    showMaskOnFocus: !0,\n                    showMaskOnHover: !0,\n                    onKeyValidation: function() {},\n                    skipOptionalPartCharacter: \" \",\n                    numericInput: !1,\n                    rightAlign: !1,\n                    undoOnEscape: !0,\n                    radixPoint: \"\",\n                    _radixDance: !1,\n                    groupSeparator: \"\",\n                    keepStatic: null,\n                    positionCaretOnTab: !0,\n                    tabThrough: !1,\n                    supportsInputType: [ \"text\", \"tel\", \"url\", \"password\", \"search\" ],\n                    isComplete: null,\n                    preValidation: null,\n                    postValidation: null,\n                    staticDefinitionSymbol: void 0,\n                    jitMasking: !1,\n                    nullable: !0,\n                    inputEventOnly: !1,\n                    noValuePatching: !1,\n                    positionCaretOnClick: \"lvp\",\n                    casing: null,\n                    inputmode: \"text\",\n                    importDataAttributes: !0,\n                    shiftPositions: !0,\n                    usePrototypeDefinitions: !0,\n                    validationEventTimeOut: 3e3,\n                    substitutes: {}\n                };\n            },\n            7392: function(e, t) {\n                Object.defineProperty(t, \"__esModule\", {\n                    value: !0\n                }), t.default = void 0;\n                t.default = {\n                    9: {\n                        validator: \"[0-9\\uff10-\\uff19]\",\n                        definitionSymbol: \"*\"\n                    },\n                    a: {\n                        validator: \"[A-Za-z\\u0410-\\u044f\\u0401\\u0451\\xc0-\\xff\\xb5]\",\n                        definitionSymbol: \"*\"\n                    },\n                    \"*\": {\n                        validator: \"[0-9\\uff10-\\uff19A-Za-z\\u0410-\\u044f\\u0401\\u0451\\xc0-\\xff\\xb5]\"\n                    }\n                };\n            },\n            253: function(e, t) {\n                Object.defineProperty(t, \"__esModule\", {\n                    value: !0\n                }), t.default = function(e, t, n) {\n                    if (void 0 === n) return e.__data ? e.__data[t] : null;\n                    e.__data = e.__data || {}, e.__data[t] = n;\n                };\n            },\n            3776: function(e, t, n) {\n                Object.defineProperty(t, \"__esModule\", {\n                    value: !0\n                }), t.Event = void 0, t.off = function(e, t) {\n                    var n, i;\n                    u(this[0]) && e && (n = this[0].eventRegistry, i = this[0], e.split(\" \").forEach((function(e) {\n                        var a = o(e.split(\".\"), 2);\n                        (function(e, i) {\n                            var a, r, o = [];\n                            if (e.length > 0) if (void 0 === t) for (a = 0, r = n[e][i].length; a < r; a++) o.push({\n                                ev: e,\n                                namespace: i && i.length > 0 ? i : \"global\",\n                                handler: n[e][i][a]\n                            }); else o.push({\n                                ev: e,\n                                namespace: i && i.length > 0 ? i : \"global\",\n                                handler: t\n                            }); else if (i.length > 0) for (var l in n) for (var s in n[l]) if (s === i) if (void 0 === t) for (a = 0, \n                            r = n[l][s].length; a < r; a++) o.push({\n                                ev: l,\n                                namespace: s,\n                                handler: n[l][s][a]\n                            }); else o.push({\n                                ev: l,\n                                namespace: s,\n                                handler: t\n                            });\n                            return o;\n                        })(a[0], a[1]).forEach((function(e) {\n                            var t = e.ev, a = e.handler;\n                            !function(e, t, a) {\n                                if (e in n == 1) if (i.removeEventListener ? i.removeEventListener(e, a, !1) : i.detachEvent && i.detachEvent(\"on\".concat(e), a), \n                                \"global\" === t) for (var r in n[e]) n[e][r].splice(n[e][r].indexOf(a), 1); else n[e][t].splice(n[e][t].indexOf(a), 1);\n                            }(t, e.namespace, a);\n                        }));\n                    })));\n                    return this;\n                }, t.on = function(e, t) {\n                    if (u(this[0])) {\n                        var n = this[0].eventRegistry, i = this[0];\n                        e.split(\" \").forEach((function(e) {\n                            var a = o(e.split(\".\"), 2), r = a[0], l = a[1];\n                            !function(e, a) {\n                                i.addEventListener ? i.addEventListener(e, t, !1) : i.attachEvent && i.attachEvent(\"on\".concat(e), t), \n                                n[e] = n[e] || {}, n[e][a] = n[e][a] || [], n[e][a].push(t);\n                            }(r, void 0 === l ? \"global\" : l);\n                        }));\n                    }\n                    return this;\n                }, t.trigger = function(e) {\n                    var t = arguments;\n                    if (u(this[0])) for (var n = this[0].eventRegistry, i = this[0], o = \"string\" == typeof e ? e.split(\" \") : [ e.type ], l = 0; l < o.length; l++) {\n                        var s = o[l].split(\".\"), f = s[0], p = s[1] || \"global\";\n                        if (void 0 !== c && \"global\" === p) {\n                            var d, h = {\n                                bubbles: !0,\n                                cancelable: !0,\n                                composed: !0,\n                                detail: arguments[1]\n                            };\n                            if (c.createEvent) {\n                                try {\n                                    if (\"input\" === f) h.inputType = \"insertText\", d = new InputEvent(f, h); else d = new CustomEvent(f, h);\n                                } catch (e) {\n                                    (d = c.createEvent(\"CustomEvent\")).initCustomEvent(f, h.bubbles, h.cancelable, h.detail);\n                                }\n                                e.type && (0, a.default)(d, e), i.dispatchEvent(d);\n                            } else (d = c.createEventObject()).eventType = f, d.detail = arguments[1], e.type && (0, \n                            a.default)(d, e), i.fireEvent(\"on\" + d.eventType, d);\n                        } else if (void 0 !== n[f]) {\n                            arguments[0] = arguments[0].type ? arguments[0] : r.default.Event(arguments[0]), \n                            arguments[0].detail = arguments.slice(1);\n                            var v = n[f];\n                            (\"global\" === p ? Object.values(v).flat() : v[p]).forEach((function(e) {\n                                return e.apply(i, t);\n                            }));\n                        }\n                    }\n                    return this;\n                };\n                var i = s(n(9380)), a = s(n(600)), r = s(n(4963));\n                function o(e, t) {\n                    return function(e) {\n                        if (Array.isArray(e)) return e;\n                    }(e) || function(e, t) {\n                        var n = null == e ? null : \"undefined\" != typeof Symbol && e[Symbol.iterator] || e[\"@@iterator\"];\n                        if (null != n) {\n                            var i, a, r, o, l = [], s = !0, c = !1;\n                            try {\n                                if (r = (n = n.call(e)).next, 0 === t) {\n                                    if (Object(n) !== n) return;\n                                    s = !1;\n                                } else for (;!(s = (i = r.call(n)).done) && (l.push(i.value), l.length !== t); s = !0) ;\n                            } catch (e) {\n                                c = !0, a = e;\n                            } finally {\n                                try {\n                                    if (!s && null != n.return && (o = n.return(), Object(o) !== o)) return;\n                                } finally {\n                                    if (c) throw a;\n                                }\n                            }\n                            return l;\n                        }\n                    }(e, t) || function(e, t) {\n                        if (!e) return;\n                        if (\"string\" == typeof e) return l(e, t);\n                        var n = Object.prototype.toString.call(e).slice(8, -1);\n                        \"Object\" === n && e.constructor && (n = e.constructor.name);\n                        if (\"Map\" === n || \"Set\" === n) return Array.from(e);\n                        if (\"Arguments\" === n || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return l(e, t);\n                    }(e, t) || function() {\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                    }();\n                }\n                function l(e, t) {\n                    (null == t || t > e.length) && (t = e.length);\n                    for (var n = 0, i = new Array(t); n < t; n++) i[n] = e[n];\n                    return i;\n                }\n                function s(e) {\n                    return e && e.__esModule ? e : {\n                        default: e\n                    };\n                }\n                var c = i.default.document;\n                function u(e) {\n                    return e instanceof Element;\n                }\n                var f = t.Event = void 0;\n                \"function\" == typeof i.default.CustomEvent ? t.Event = f = i.default.CustomEvent : i.default.Event && c && c.createEvent ? (t.Event = f = function(e, t) {\n                    t = t || {\n                        bubbles: !1,\n                        cancelable: !1,\n                        composed: !0,\n                        detail: void 0\n                    };\n                    var n = c.createEvent(\"CustomEvent\");\n                    return n.initCustomEvent(e, t.bubbles, t.cancelable, t.detail), n;\n                }, f.prototype = i.default.Event.prototype) : \"undefined\" != typeof Event && (t.Event = f = Event);\n            },\n            600: function(e, t) {\n                function n(e) {\n                    return n = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function(e) {\n                        return typeof e;\n                    } : function(e) {\n                        return e && \"function\" == typeof Symbol && e.constructor === Symbol && e !== Symbol.prototype ? \"symbol\" : typeof e;\n                    }, n(e);\n                }\n                Object.defineProperty(t, \"__esModule\", {\n                    value: !0\n                }), t.default = function e() {\n                    var t, i, a, r, o, l, s = arguments[0] || {}, c = 1, u = arguments.length, f = !1;\n                    \"boolean\" == typeof s && (f = s, s = arguments[c] || {}, c++);\n                    \"object\" !== n(s) && \"function\" != typeof s && (s = {});\n                    for (;c < u; c++) if (null != (t = arguments[c])) for (i in t) a = s[i], s !== (r = t[i]) && (f && r && (\"[object Object]\" === Object.prototype.toString.call(r) || (o = Array.isArray(r))) ? (o ? (o = !1, \n                    l = a && Array.isArray(a) ? a : []) : l = a && \"[object Object]\" === Object.prototype.toString.call(a) ? a : {}, \n                    s[i] = e(f, l, r)) : void 0 !== r && (s[i] = r));\n                    return s;\n                };\n            },\n            4963: function(e, t, n) {\n                Object.defineProperty(t, \"__esModule\", {\n                    value: !0\n                }), t.default = void 0;\n                var i = l(n(9380)), a = l(n(253)), r = n(3776), o = l(n(600));\n                function l(e) {\n                    return e && e.__esModule ? e : {\n                        default: e\n                    };\n                }\n                var s = i.default.document;\n                function c(e) {\n                    return e instanceof c ? e : this instanceof c ? void (null != e && e !== i.default && (this[0] = e.nodeName ? e : void 0 !== e[0] && e[0].nodeName ? e[0] : s.querySelector(e), \n                    void 0 !== this[0] && null !== this[0] && (this[0].eventRegistry = this[0].eventRegistry || {}))) : new c(e);\n                }\n                c.prototype = {\n                    on: r.on,\n                    off: r.off,\n                    trigger: r.trigger\n                }, c.extend = o.default, c.data = a.default, c.Event = r.Event;\n                t.default = c;\n            },\n            9845: function(e, t, n) {\n                Object.defineProperty(t, \"__esModule\", {\n                    value: !0\n                }), t.mobile = t.iphone = t.ie = void 0;\n                var i, a = (i = n(9380)) && i.__esModule ? i : {\n                    default: i\n                };\n                var r = a.default.navigator && a.default.navigator.userAgent || \"\";\n                t.ie = r.indexOf(\"MSIE \") > 0 || r.indexOf(\"Trident/\") > 0, t.mobile = a.default.navigator && a.default.navigator.userAgentData && a.default.navigator.userAgentData.mobile || a.default.navigator && a.default.navigator.maxTouchPoints || \"ontouchstart\" in a.default, \n                t.iphone = /iphone/i.test(r);\n            },\n            7184: function(e, t) {\n                Object.defineProperty(t, \"__esModule\", {\n                    value: !0\n                }), t.default = function(e) {\n                    return e.replace(n, \"\\\\$1\");\n                };\n                var n = new RegExp(\"(\\\\\" + [ \"/\", \".\", \"*\", \"+\", \"?\", \"|\", \"(\", \")\", \"[\", \"]\", \"{\", \"}\", \"\\\\\", \"$\", \"^\" ].join(\"|\\\\\") + \")\", \"gim\");\n            },\n            6030: function(e, t, n) {\n                function i(e) {\n                    return i = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function(e) {\n                        return typeof e;\n                    } : function(e) {\n                        return e && \"function\" == typeof Symbol && e.constructor === Symbol && e !== Symbol.prototype ? \"symbol\" : typeof e;\n                    }, i(e);\n                }\n                Object.defineProperty(t, \"__esModule\", {\n                    value: !0\n                }), t.EventHandlers = void 0;\n                var a, r = n(9845), o = (a = n(9380)) && a.__esModule ? a : {\n                    default: a\n                }, l = n(7760), s = n(2839), c = n(8711), u = n(7215), f = n(4713);\n                function p() {\n                    /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ p = function() {\n                        return t;\n                    };\n                    var e, t = {}, n = Object.prototype, a = n.hasOwnProperty, r = Object.defineProperty || function(e, t, n) {\n                        e[t] = n.value;\n                    }, o = \"function\" == typeof Symbol ? Symbol : {}, l = o.iterator || \"@@iterator\", s = o.asyncIterator || \"@@asyncIterator\", c = o.toStringTag || \"@@toStringTag\";\n                    function u(e, t, n) {\n                        return Object.defineProperty(e, t, {\n                            value: n,\n                            enumerable: !0,\n                            configurable: !0,\n                            writable: !0\n                        }), e[t];\n                    }\n                    try {\n                        u({}, \"\");\n                    } catch (e) {\n                        u = function(e, t, n) {\n                            return e[t] = n;\n                        };\n                    }\n                    function f(e, t, n, i) {\n                        var a = t && t.prototype instanceof k ? t : k, o = Object.create(a.prototype), l = new D(i || []);\n                        return r(o, \"_invoke\", {\n                            value: E(e, n, l)\n                        }), o;\n                    }\n                    function d(e, t, n) {\n                        try {\n                            return {\n                                type: \"normal\",\n                                arg: e.call(t, n)\n                            };\n                        } catch (e) {\n                            return {\n                                type: \"throw\",\n                                arg: e\n                            };\n                        }\n                    }\n                    t.wrap = f;\n                    var h = \"suspendedStart\", v = \"suspendedYield\", m = \"executing\", g = \"completed\", y = {};\n                    function k() {}\n                    function b() {}\n                    function x() {}\n                    var w = {};\n                    u(w, l, (function() {\n                        return this;\n                    }));\n                    var P = Object.getPrototypeOf, S = P && P(P(L([])));\n                    S && S !== n && a.call(S, l) && (w = S);\n                    var O = x.prototype = k.prototype = Object.create(w);\n                    function _(e) {\n                        [ \"next\", \"throw\", \"return\" ].forEach((function(t) {\n                            u(e, t, (function(e) {\n                                return this._invoke(t, e);\n                            }));\n                        }));\n                    }\n                    function M(e, t) {\n                        function n(r, o, l, s) {\n                            var c = d(e[r], e, o);\n                            if (\"throw\" !== c.type) {\n                                var u = c.arg, f = u.value;\n                                return f && \"object\" == i(f) && a.call(f, \"__await\") ? t.resolve(f.__await).then((function(e) {\n                                    n(\"next\", e, l, s);\n                                }), (function(e) {\n                                    n(\"throw\", e, l, s);\n                                })) : t.resolve(f).then((function(e) {\n                                    u.value = e, l(u);\n                                }), (function(e) {\n                                    return n(\"throw\", e, l, s);\n                                }));\n                            }\n                            s(c.arg);\n                        }\n                        var o;\n                        r(this, \"_invoke\", {\n                            value: function(e, i) {\n                                function a() {\n                                    return new t((function(t, a) {\n                                        n(e, i, t, a);\n                                    }));\n                                }\n                                return o = o ? o.then(a, a) : a();\n                            }\n                        });\n                    }\n                    function E(t, n, i) {\n                        var a = h;\n                        return function(r, o) {\n                            if (a === m) throw new Error(\"Generator is already running\");\n                            if (a === g) {\n                                if (\"throw\" === r) throw o;\n                                return {\n                                    value: e,\n                                    done: !0\n                                };\n                            }\n                            for (i.method = r, i.arg = o; ;) {\n                                var l = i.delegate;\n                                if (l) {\n                                    var s = j(l, i);\n                                    if (s) {\n                                        if (s === y) continue;\n                                        return s;\n                                    }\n                                }\n                                if (\"next\" === i.method) i.sent = i._sent = i.arg; else if (\"throw\" === i.method) {\n                                    if (a === h) throw a = g, i.arg;\n                                    i.dispatchException(i.arg);\n                                } else \"return\" === i.method && i.abrupt(\"return\", i.arg);\n                                a = m;\n                                var c = d(t, n, i);\n                                if (\"normal\" === c.type) {\n                                    if (a = i.done ? g : v, c.arg === y) continue;\n                                    return {\n                                        value: c.arg,\n                                        done: i.done\n                                    };\n                                }\n                                \"throw\" === c.type && (a = g, i.method = \"throw\", i.arg = c.arg);\n                            }\n                        };\n                    }\n                    function j(t, n) {\n                        var i = n.method, a = t.iterator[i];\n                        if (a === e) return n.delegate = null, \"throw\" === i && t.iterator.return && (n.method = \"return\", \n                        n.arg = e, j(t, n), \"throw\" === n.method) || \"return\" !== i && (n.method = \"throw\", \n                        n.arg = new TypeError(\"The iterator does not provide a '\" + i + \"' method\")), y;\n                        var r = d(a, t.iterator, n.arg);\n                        if (\"throw\" === r.type) return n.method = \"throw\", n.arg = r.arg, n.delegate = null, \n                        y;\n                        var o = r.arg;\n                        return o ? o.done ? (n[t.resultName] = o.value, n.next = t.nextLoc, \"return\" !== n.method && (n.method = \"next\", \n                        n.arg = e), n.delegate = null, y) : o : (n.method = \"throw\", n.arg = new TypeError(\"iterator result is not an object\"), \n                        n.delegate = null, y);\n                    }\n                    function T(e) {\n                        var t = {\n                            tryLoc: e[0]\n                        };\n                        1 in e && (t.catchLoc = e[1]), 2 in e && (t.finallyLoc = e[2], t.afterLoc = e[3]), \n                        this.tryEntries.push(t);\n                    }\n                    function A(e) {\n                        var t = e.completion || {};\n                        t.type = \"normal\", delete t.arg, e.completion = t;\n                    }\n                    function D(e) {\n                        this.tryEntries = [ {\n                            tryLoc: \"root\"\n                        } ], e.forEach(T, this), this.reset(!0);\n                    }\n                    function L(t) {\n                        if (t || \"\" === t) {\n                            var n = t[l];\n                            if (n) return n.call(t);\n                            if (\"function\" == typeof t.next) return t;\n                            if (!isNaN(t.length)) {\n                                var r = -1, o = function n() {\n                                    for (;++r < t.length; ) if (a.call(t, r)) return n.value = t[r], n.done = !1, n;\n                                    return n.value = e, n.done = !0, n;\n                                };\n                                return o.next = o;\n                            }\n                        }\n                        throw new TypeError(i(t) + \" is not iterable\");\n                    }\n                    return b.prototype = x, r(O, \"constructor\", {\n                        value: x,\n                        configurable: !0\n                    }), r(x, \"constructor\", {\n                        value: b,\n                        configurable: !0\n                    }), b.displayName = u(x, c, \"GeneratorFunction\"), t.isGeneratorFunction = function(e) {\n                        var t = \"function\" == typeof e && e.constructor;\n                        return !!t && (t === b || \"GeneratorFunction\" === (t.displayName || t.name));\n                    }, t.mark = function(e) {\n                        return Object.setPrototypeOf ? Object.setPrototypeOf(e, x) : (e.__proto__ = x, u(e, c, \"GeneratorFunction\")), \n                        e.prototype = Object.create(O), e;\n                    }, t.awrap = function(e) {\n                        return {\n                            __await: e\n                        };\n                    }, _(M.prototype), u(M.prototype, s, (function() {\n                        return this;\n                    })), t.AsyncIterator = M, t.async = function(e, n, i, a, r) {\n                        void 0 === r && (r = Promise);\n                        var o = new M(f(e, n, i, a), r);\n                        return t.isGeneratorFunction(n) ? o : o.next().then((function(e) {\n                            return e.done ? e.value : o.next();\n                        }));\n                    }, _(O), u(O, c, \"Generator\"), u(O, l, (function() {\n                        return this;\n                    })), u(O, \"toString\", (function() {\n                        return \"[object Generator]\";\n                    })), t.keys = function(e) {\n                        var t = Object(e), n = [];\n                        for (var i in t) n.push(i);\n                        return n.reverse(), function e() {\n                            for (;n.length; ) {\n                                var i = n.pop();\n                                if (i in t) return e.value = i, e.done = !1, e;\n                            }\n                            return e.done = !0, e;\n                        };\n                    }, t.values = L, D.prototype = {\n                        constructor: D,\n                        reset: function(t) {\n                            if (this.prev = 0, this.next = 0, this.sent = this._sent = e, this.done = !1, this.delegate = null, \n                            this.method = \"next\", this.arg = e, this.tryEntries.forEach(A), !t) for (var n in this) \"t\" === n.charAt(0) && a.call(this, n) && !isNaN(+n.slice(1)) && (this[n] = e);\n                        },\n                        stop: function() {\n                            this.done = !0;\n                            var e = this.tryEntries[0].completion;\n                            if (\"throw\" === e.type) throw e.arg;\n                            return this.rval;\n                        },\n                        dispatchException: function(t) {\n                            if (this.done) throw t;\n                            var n = this;\n                            function i(i, a) {\n                                return l.type = \"throw\", l.arg = t, n.next = i, a && (n.method = \"next\", n.arg = e), \n                                !!a;\n                            }\n                            for (var r = this.tryEntries.length - 1; r >= 0; --r) {\n                                var o = this.tryEntries[r], l = o.completion;\n                                if (\"root\" === o.tryLoc) return i(\"end\");\n                                if (o.tryLoc <= this.prev) {\n                                    var s = a.call(o, \"catchLoc\"), c = a.call(o, \"finallyLoc\");\n                                    if (s && c) {\n                                        if (this.prev < o.catchLoc) return i(o.catchLoc, !0);\n                                        if (this.prev < o.finallyLoc) return i(o.finallyLoc);\n                                    } else if (s) {\n                                        if (this.prev < o.catchLoc) return i(o.catchLoc, !0);\n                                    } else {\n                                        if (!c) throw new Error(\"try statement without catch or finally\");\n                                        if (this.prev < o.finallyLoc) return i(o.finallyLoc);\n                                    }\n                                }\n                            }\n                        },\n                        abrupt: function(e, t) {\n                            for (var n = this.tryEntries.length - 1; n >= 0; --n) {\n                                var i = this.tryEntries[n];\n                                if (i.tryLoc <= this.prev && a.call(i, \"finallyLoc\") && this.prev < i.finallyLoc) {\n                                    var r = i;\n                                    break;\n                                }\n                            }\n                            r && (\"break\" === e || \"continue\" === e) && r.tryLoc <= t && t <= r.finallyLoc && (r = null);\n                            var o = r ? r.completion : {};\n                            return o.type = e, o.arg = t, r ? (this.method = \"next\", this.next = r.finallyLoc, \n                            y) : this.complete(o);\n                        },\n                        complete: function(e, t) {\n                            if (\"throw\" === e.type) throw e.arg;\n                            return \"break\" === e.type || \"continue\" === e.type ? this.next = e.arg : \"return\" === e.type ? (this.rval = this.arg = e.arg, \n                            this.method = \"return\", this.next = \"end\") : \"normal\" === e.type && t && (this.next = t), \n                            y;\n                        },\n                        finish: function(e) {\n                            for (var t = this.tryEntries.length - 1; t >= 0; --t) {\n                                var n = this.tryEntries[t];\n                                if (n.finallyLoc === e) return this.complete(n.completion, n.afterLoc), A(n), y;\n                            }\n                        },\n                        catch: function(e) {\n                            for (var t = this.tryEntries.length - 1; t >= 0; --t) {\n                                var n = this.tryEntries[t];\n                                if (n.tryLoc === e) {\n                                    var i = n.completion;\n                                    if (\"throw\" === i.type) {\n                                        var a = i.arg;\n                                        A(n);\n                                    }\n                                    return a;\n                                }\n                            }\n                            throw new Error(\"illegal catch attempt\");\n                        },\n                        delegateYield: function(t, n, i) {\n                            return this.delegate = {\n                                iterator: L(t),\n                                resultName: n,\n                                nextLoc: i\n                            }, \"next\" === this.method && (this.arg = e), y;\n                        }\n                    }, t;\n                }\n                function d(e, t) {\n                    var n = \"undefined\" != typeof Symbol && e[Symbol.iterator] || e[\"@@iterator\"];\n                    if (!n) {\n                        if (Array.isArray(e) || (n = function(e, t) {\n                            if (!e) return;\n                            if (\"string\" == typeof e) return h(e, t);\n                            var n = Object.prototype.toString.call(e).slice(8, -1);\n                            \"Object\" === n && e.constructor && (n = e.constructor.name);\n                            if (\"Map\" === n || \"Set\" === n) return Array.from(e);\n                            if (\"Arguments\" === n || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return h(e, t);\n                        }(e)) || t && e && \"number\" == typeof e.length) {\n                            n && (e = n);\n                            var i = 0, a = function() {};\n                            return {\n                                s: a,\n                                n: function() {\n                                    return i >= e.length ? {\n                                        done: !0\n                                    } : {\n                                        done: !1,\n                                        value: e[i++]\n                                    };\n                                },\n                                e: function(e) {\n                                    throw e;\n                                },\n                                f: a\n                            };\n                        }\n                        throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n                    }\n                    var r, o = !0, l = !1;\n                    return {\n                        s: function() {\n                            n = n.call(e);\n                        },\n                        n: function() {\n                            var e = n.next();\n                            return o = e.done, e;\n                        },\n                        e: function(e) {\n                            l = !0, r = e;\n                        },\n                        f: function() {\n                            try {\n                                o || null == n.return || n.return();\n                            } finally {\n                                if (l) throw r;\n                            }\n                        }\n                    };\n                }\n                function h(e, t) {\n                    (null == t || t > e.length) && (t = e.length);\n                    for (var n = 0, i = new Array(t); n < t; n++) i[n] = e[n];\n                    return i;\n                }\n                function v(e, t, n, i, a, r, o) {\n                    try {\n                        var l = e[r](o), s = l.value;\n                    } catch (e) {\n                        return void n(e);\n                    }\n                    l.done ? t(s) : Promise.resolve(s).then(i, a);\n                }\n                var m, g, y = t.EventHandlers = {\n                    keyEvent: function(e, t, n, i, a) {\n                        var o = this.inputmask, p = o.opts, d = o.dependencyLib, h = o.maskset, v = this, m = d(v), g = e.key, k = c.caret.call(o, v), b = p.onKeyDown.call(this, e, c.getBuffer.call(o), k, p);\n                        if (void 0 !== b) return b;\n                        if (g === s.keys.Backspace || g === s.keys.Delete || r.iphone && g === s.keys.BACKSPACE_SAFARI || e.ctrlKey && g === s.keys.x && !(\"oncut\" in v)) e.preventDefault(), \n                        u.handleRemove.call(o, v, g, k), (0, l.writeBuffer)(v, c.getBuffer.call(o, !0), h.p, e, v.inputmask._valueGet() !== c.getBuffer.call(o).join(\"\")); else if (g === s.keys.End || g === s.keys.PageDown) {\n                            e.preventDefault();\n                            var x = c.seekNext.call(o, c.getLastValidPosition.call(o));\n                            c.caret.call(o, v, e.shiftKey ? k.begin : x, x, !0);\n                        } else g === s.keys.Home && !e.shiftKey || g === s.keys.PageUp ? (e.preventDefault(), \n                        c.caret.call(o, v, 0, e.shiftKey ? k.begin : 0, !0)) : p.undoOnEscape && g === s.keys.Escape && !0 !== e.altKey ? ((0, \n                        l.checkVal)(v, !0, !1, o.undoValue.split(\"\")), m.trigger(\"click\")) : g !== s.keys.Insert || e.shiftKey || e.ctrlKey || void 0 !== o.userOptions.insertMode ? !0 === p.tabThrough && g === s.keys.Tab ? !0 === e.shiftKey ? (k.end = c.seekPrevious.call(o, k.end, !0), \n                        !0 === f.getTest.call(o, k.end - 1).match.static && k.end--, k.begin = c.seekPrevious.call(o, k.end, !0), \n                        k.begin >= 0 && k.end > 0 && (e.preventDefault(), c.caret.call(o, v, k.begin, k.end))) : (k.begin = c.seekNext.call(o, k.begin, !0), \n                        k.end = c.seekNext.call(o, k.begin, !0), k.end < h.maskLength && k.end--, k.begin <= h.maskLength && (e.preventDefault(), \n                        c.caret.call(o, v, k.begin, k.end))) : e.shiftKey || (p.insertModeVisual && !1 === p.insertMode ? g === s.keys.ArrowRight ? setTimeout((function() {\n                            var e = c.caret.call(o, v);\n                            c.caret.call(o, v, e.begin);\n                        }), 0) : g === s.keys.ArrowLeft && setTimeout((function() {\n                            var e = c.translatePosition.call(o, v.inputmask.caretPos.begin);\n                            c.translatePosition.call(o, v.inputmask.caretPos.end);\n                            o.isRTL ? c.caret.call(o, v, e + (e === h.maskLength ? 0 : 1)) : c.caret.call(o, v, e - (0 === e ? 0 : 1));\n                        }), 0) : void 0 === o.keyEventHook || o.keyEventHook(e)) : u.isSelection.call(o, k) ? p.insertMode = !p.insertMode : (p.insertMode = !p.insertMode, \n                        c.caret.call(o, v, k.begin, k.begin));\n                        return o.isComposing = g == s.keys.Process || g == s.keys.Unidentified, o.ignorable = g.length > 1 && !(\"textarea\" === v.tagName.toLowerCase() && g == s.keys.Enter), \n                        y.keypressEvent.call(this, e, t, n, i, a);\n                    },\n                    keypressEvent: function(e, t, n, i, a) {\n                        var r = this.inputmask || this, o = r.opts, f = r.dependencyLib, p = r.maskset, d = r.el, h = f(d), v = e.key;\n                        if (!0 === t || e.ctrlKey && e.altKey && !r.ignorable || !(e.ctrlKey || e.metaKey || r.ignorable)) {\n                            if (v) {\n                                var m, g = t ? {\n                                    begin: a,\n                                    end: a\n                                } : c.caret.call(r, d);\n                                t || (v = o.substitutes[v] || v), p.writeOutBuffer = !0;\n                                var y = u.isValid.call(r, g, v, i, void 0, void 0, void 0, t);\n                                if (!1 !== y && (c.resetMaskSet.call(r, !0), m = void 0 !== y.caret ? y.caret : c.seekNext.call(r, y.pos.begin ? y.pos.begin : y.pos), \n                                p.p = m), m = o.numericInput && void 0 === y.caret ? c.seekPrevious.call(r, m) : m, \n                                !1 !== n && (setTimeout((function() {\n                                    o.onKeyValidation.call(d, v, y);\n                                }), 0), p.writeOutBuffer && !1 !== y)) {\n                                    var k = c.getBuffer.call(r);\n                                    (0, l.writeBuffer)(d, k, m, e, !0 !== t);\n                                }\n                                if (e.preventDefault(), t) return !1 !== y && (y.forwardPosition = m), y;\n                            }\n                        } else v === s.keys.Enter && r.undoValue !== r._valueGet(!0) && (r.undoValue = r._valueGet(!0), \n                        setTimeout((function() {\n                            h.trigger(\"change\");\n                        }), 0));\n                    },\n                    pasteEvent: (m = p().mark((function e(t) {\n                        var n, i, a, r, s, u;\n                        return p().wrap((function(e) {\n                            for (;;) switch (e.prev = e.next) {\n                              case 0:\n                                n = function(e, n, i, a, o) {\n                                    var s = c.caret.call(e, n, void 0, void 0, !0), u = i.substr(0, s.begin), f = i.substr(s.end, i.length);\n                                    if (u == (e.isRTL ? c.getBufferTemplate.call(e).slice().reverse() : c.getBufferTemplate.call(e)).slice(0, s.begin).join(\"\") && (u = \"\"), \n                                    f == (e.isRTL ? c.getBufferTemplate.call(e).slice().reverse() : c.getBufferTemplate.call(e)).slice(s.end).join(\"\") && (f = \"\"), \n                                    a = u + a + f, e.isRTL && !0 !== r.numericInput) {\n                                        a = a.split(\"\");\n                                        var p, h = d(c.getBufferTemplate.call(e));\n                                        try {\n                                            for (h.s(); !(p = h.n()).done; ) {\n                                                var v = p.value;\n                                                a[0] === v && a.shift();\n                                            }\n                                        } catch (e) {\n                                            h.e(e);\n                                        } finally {\n                                            h.f();\n                                        }\n                                        a = a.reverse().join(\"\");\n                                    }\n                                    var m = a;\n                                    if (\"function\" == typeof o) {\n                                        if (!1 === (m = o.call(e, m, r))) return !1;\n                                        m || (m = i);\n                                    }\n                                    (0, l.checkVal)(n, !0, !1, m.toString().split(\"\"), t);\n                                }, i = this, a = this.inputmask, r = a.opts, s = a._valueGet(!0), a.skipInputEvent = !0, \n                                t.clipboardData && t.clipboardData.getData ? u = t.clipboardData.getData(\"text/plain\") : o.default.clipboardData && o.default.clipboardData.getData && (u = o.default.clipboardData.getData(\"Text\")), \n                                n(a, i, s, u, r.onBeforePaste), t.preventDefault();\n\n                              case 7:\n                              case \"end\":\n                                return e.stop();\n                            }\n                        }), e, this);\n                    })), g = function() {\n                        var e = this, t = arguments;\n                        return new Promise((function(n, i) {\n                            var a = m.apply(e, t);\n                            function r(e) {\n                                v(a, n, i, r, o, \"next\", e);\n                            }\n                            function o(e) {\n                                v(a, n, i, r, o, \"throw\", e);\n                            }\n                            r(void 0);\n                        }));\n                    }, function(e) {\n                        return g.apply(this, arguments);\n                    }),\n                    inputFallBackEvent: function(e) {\n                        var t = this.inputmask, n = t.opts, i = t.dependencyLib;\n                        var a, o = this, u = o.inputmask._valueGet(!0), p = (t.isRTL ? c.getBuffer.call(t).slice().reverse() : c.getBuffer.call(t)).join(\"\"), d = c.caret.call(t, o, void 0, void 0, !0);\n                        if (p !== u) {\n                            if (a = function(e, i, a) {\n                                for (var r, o, l, s = e.substr(0, a.begin).split(\"\"), u = e.substr(a.begin).split(\"\"), p = i.substr(0, a.begin).split(\"\"), d = i.substr(a.begin).split(\"\"), h = s.length >= p.length ? s.length : p.length, v = u.length >= d.length ? u.length : d.length, m = \"\", g = [], y = \"~\"; s.length < h; ) s.push(y);\n                                for (;p.length < h; ) p.push(y);\n                                for (;u.length < v; ) u.unshift(y);\n                                for (;d.length < v; ) d.unshift(y);\n                                var k = s.concat(u), b = p.concat(d);\n                                for (o = 0, r = k.length; o < r; o++) switch (l = f.getPlaceholder.call(t, c.translatePosition.call(t, o)), \n                                m) {\n                                  case \"insertText\":\n                                    b[o - 1] === k[o] && a.begin == k.length - 1 && g.push(k[o]), o = r;\n                                    break;\n\n                                  case \"insertReplacementText\":\n                                  case \"deleteContentBackward\":\n                                    k[o] === y ? a.end++ : o = r;\n                                    break;\n\n                                  default:\n                                    k[o] !== b[o] && (k[o + 1] !== y && k[o + 1] !== l && void 0 !== k[o + 1] || (b[o] !== l || b[o + 1] !== y) && b[o] !== y ? b[o + 1] === y && b[o] === k[o + 1] ? (m = \"insertText\", \n                                    g.push(k[o]), a.begin--, a.end--) : k[o] !== l && k[o] !== y && (k[o + 1] === y || b[o] !== k[o] && b[o + 1] === k[o + 1]) ? (m = \"insertReplacementText\", \n                                    g.push(k[o]), a.begin--) : k[o] === y ? (m = \"deleteContentBackward\", (c.isMask.call(t, c.translatePosition.call(t, o), !0) || b[o] === n.radixPoint) && a.end++) : o = r : (m = \"insertText\", \n                                    g.push(k[o]), a.begin--, a.end--));\n                                }\n                                return {\n                                    action: m,\n                                    data: g,\n                                    caret: a\n                                };\n                            }(u, p, d), (o.inputmask.shadowRoot || o.ownerDocument).activeElement !== o && o.focus(), \n                            (0, l.writeBuffer)(o, c.getBuffer.call(t)), c.caret.call(t, o, d.begin, d.end, !0), \n                            !r.mobile && t.skipNextInsert && \"insertText\" === e.inputType && \"insertText\" === a.action && t.isComposing) return !1;\n                            switch (\"insertCompositionText\" === e.inputType && \"insertText\" === a.action && t.isComposing ? t.skipNextInsert = !0 : t.skipNextInsert = !1, \n                            a.action) {\n                              case \"insertText\":\n                              case \"insertReplacementText\":\n                                a.data.forEach((function(e, n) {\n                                    var a = new i.Event(\"keypress\");\n                                    a.key = e, t.ignorable = !1, y.keypressEvent.call(o, a);\n                                })), setTimeout((function() {\n                                    t.$el.trigger(\"keyup\");\n                                }), 0);\n                                break;\n\n                              case \"deleteContentBackward\":\n                                var h = new i.Event(\"keydown\");\n                                h.key = s.keys.Backspace, y.keyEvent.call(o, h);\n                                break;\n\n                              default:\n                                (0, l.applyInputValue)(o, u), c.caret.call(t, o, d.begin, d.end, !0);\n                            }\n                            e.preventDefault();\n                        }\n                    },\n                    setValueEvent: function(e) {\n                        var t = this.inputmask, n = t.dependencyLib, i = this, a = e && e.detail ? e.detail[0] : arguments[1];\n                        void 0 === a && (a = i.inputmask._valueGet(!0)), (0, l.applyInputValue)(i, a, new n.Event(\"input\")), \n                        (e.detail && void 0 !== e.detail[1] || void 0 !== arguments[2]) && c.caret.call(t, i, e.detail ? e.detail[1] : arguments[2]);\n                    },\n                    focusEvent: function(e) {\n                        var t = this.inputmask, n = t.opts, i = t && t._valueGet();\n                        n.showMaskOnFocus && i !== c.getBuffer.call(t).join(\"\") && (0, l.writeBuffer)(this, c.getBuffer.call(t), c.seekNext.call(t, c.getLastValidPosition.call(t))), \n                        !0 !== n.positionCaretOnTab || !1 !== t.mouseEnter || u.isComplete.call(t, c.getBuffer.call(t)) && -1 !== c.getLastValidPosition.call(t) || y.clickEvent.apply(this, [ e, !0 ]), \n                        t.undoValue = t && t._valueGet(!0);\n                    },\n                    invalidEvent: function(e) {\n                        this.inputmask.validationEvent = !0;\n                    },\n                    mouseleaveEvent: function() {\n                        var e = this.inputmask, t = e.opts, n = this;\n                        e.mouseEnter = !1, t.clearMaskOnLostFocus && (n.inputmask.shadowRoot || n.ownerDocument).activeElement !== n && (0, \n                        l.HandleNativePlaceholder)(n, e.originalPlaceholder);\n                    },\n                    clickEvent: function(e, t) {\n                        var n = this.inputmask;\n                        n.clicked++;\n                        var i = this;\n                        if ((i.inputmask.shadowRoot || i.ownerDocument).activeElement === i) {\n                            var a = c.determineNewCaretPosition.call(n, c.caret.call(n, i), t);\n                            void 0 !== a && c.caret.call(n, i, a);\n                        }\n                    },\n                    cutEvent: function(e) {\n                        var t = this.inputmask, n = t.maskset, i = this, a = c.caret.call(t, i), r = t.isRTL ? c.getBuffer.call(t).slice(a.end, a.begin) : c.getBuffer.call(t).slice(a.begin, a.end), f = t.isRTL ? r.reverse().join(\"\") : r.join(\"\");\n                        o.default.navigator && o.default.navigator.clipboard ? o.default.navigator.clipboard.writeText(f) : o.default.clipboardData && o.default.clipboardData.getData && o.default.clipboardData.setData(\"Text\", f), \n                        u.handleRemove.call(t, i, s.keys.Delete, a), (0, l.writeBuffer)(i, c.getBuffer.call(t), n.p, e, t.undoValue !== t._valueGet(!0));\n                    },\n                    blurEvent: function(e) {\n                        var t = this.inputmask, n = t.opts, i = t.dependencyLib;\n                        t.clicked = 0;\n                        var a = i(this), r = this;\n                        if (r.inputmask) {\n                            (0, l.HandleNativePlaceholder)(r, t.originalPlaceholder);\n                            var o = r.inputmask._valueGet(), s = c.getBuffer.call(t).slice();\n                            \"\" !== o && (n.clearMaskOnLostFocus && (-1 === c.getLastValidPosition.call(t) && o === c.getBufferTemplate.call(t).join(\"\") ? s = [] : l.clearOptionalTail.call(t, s)), \n                            !1 === u.isComplete.call(t, s) && (setTimeout((function() {\n                                a.trigger(\"incomplete\");\n                            }), 0), n.clearIncomplete && (c.resetMaskSet.call(t, !1), s = n.clearMaskOnLostFocus ? [] : c.getBufferTemplate.call(t).slice())), \n                            (0, l.writeBuffer)(r, s, void 0, e)), o = t._valueGet(!0), t.undoValue !== o && (\"\" != o || t.undoValue != c.getBufferTemplate.call(t).join(\"\") || t.undoValue == c.getBufferTemplate.call(t).join(\"\") && t.maskset.validPositions.length > 0) && (t.undoValue = o, \n                            a.trigger(\"change\"));\n                        }\n                    },\n                    mouseenterEvent: function() {\n                        var e = this.inputmask, t = e.opts.showMaskOnHover, n = this;\n                        if (e.mouseEnter = !0, (n.inputmask.shadowRoot || n.ownerDocument).activeElement !== n) {\n                            var i = (e.isRTL ? c.getBufferTemplate.call(e).slice().reverse() : c.getBufferTemplate.call(e)).join(\"\");\n                            t && (0, l.HandleNativePlaceholder)(n, i);\n                        }\n                    },\n                    submitEvent: function() {\n                        var e = this.inputmask, t = e.opts;\n                        e.undoValue !== e._valueGet(!0) && e.$el.trigger(\"change\"), -1 === c.getLastValidPosition.call(e) && e._valueGet && e._valueGet() === c.getBufferTemplate.call(e).join(\"\") && e._valueSet(\"\"), \n                        t.clearIncomplete && !1 === u.isComplete.call(e, c.getBuffer.call(e)) && e._valueSet(\"\"), \n                        t.removeMaskOnSubmit && (e._valueSet(e.unmaskedvalue(), !0), setTimeout((function() {\n                            (0, l.writeBuffer)(e.el, c.getBuffer.call(e));\n                        }), 0));\n                    },\n                    resetEvent: function() {\n                        var e = this.inputmask;\n                        e.refreshValue = !0, setTimeout((function() {\n                            (0, l.applyInputValue)(e.el, e._valueGet(!0));\n                        }), 0);\n                    }\n                };\n            },\n            9716: function(e, t, n) {\n                Object.defineProperty(t, \"__esModule\", {\n                    value: !0\n                }), t.EventRuler = void 0;\n                var i, a = n(7760), r = (i = n(2394)) && i.__esModule ? i : {\n                    default: i\n                }, o = n(2839), l = n(8711);\n                t.EventRuler = {\n                    on: function(e, t, n) {\n                        var i = e.inputmask.dependencyLib, s = function(t) {\n                            t.originalEvent && (t = t.originalEvent || t, arguments[0] = t);\n                            var s, c = this, u = c.inputmask, f = u ? u.opts : void 0;\n                            if (void 0 === u && \"FORM\" !== this.nodeName) {\n                                var p = i.data(c, \"_inputmask_opts\");\n                                i(c).off(), p && new r.default(p).mask(c);\n                            } else {\n                                if ([ \"submit\", \"reset\", \"setvalue\" ].includes(t.type) || \"FORM\" === this.nodeName || !(c.disabled || c.readOnly && !(\"keydown\" === t.type && t.ctrlKey && t.key === o.keys.c || !1 === f.tabThrough && t.key === o.keys.Tab))) {\n                                    switch (t.type) {\n                                      case \"input\":\n                                        if (!0 === u.skipInputEvent) return u.skipInputEvent = !1, t.preventDefault();\n                                        break;\n\n                                      case \"click\":\n                                      case \"focus\":\n                                        return u.validationEvent ? (u.validationEvent = !1, e.blur(), (0, a.HandleNativePlaceholder)(e, (u.isRTL ? l.getBufferTemplate.call(u).slice().reverse() : l.getBufferTemplate.call(u)).join(\"\")), \n                                        setTimeout((function() {\n                                            e.focus();\n                                        }), f.validationEventTimeOut), !1) : (s = arguments, void setTimeout((function() {\n                                            e.inputmask && n.apply(c, s);\n                                        }), 0));\n                                    }\n                                    var d = n.apply(c, arguments);\n                                    return !1 === d && (t.preventDefault(), t.stopPropagation()), d;\n                                }\n                                t.preventDefault();\n                            }\n                        };\n                        [ \"submit\", \"reset\" ].includes(t) ? (s = s.bind(e), null !== e.form && i(e.form).on(t, s)) : i(e).on(t, s), \n                        e.inputmask.events[t] = e.inputmask.events[t] || [], e.inputmask.events[t].push(s);\n                    },\n                    off: function(e, t) {\n                        if (e.inputmask && e.inputmask.events) {\n                            var n = e.inputmask.dependencyLib, i = e.inputmask.events;\n                            for (var a in t && ((i = [])[t] = e.inputmask.events[t]), i) {\n                                for (var r = i[a]; r.length > 0; ) {\n                                    var o = r.pop();\n                                    [ \"submit\", \"reset\" ].includes(a) ? null !== e.form && n(e.form).off(a, o) : n(e).off(a, o);\n                                }\n                                delete e.inputmask.events[a];\n                            }\n                        }\n                    }\n                };\n            },\n            219: function(e, t, n) {\n                var i = p(n(7184)), a = p(n(2394)), r = n(2839), o = n(8711), l = n(4713);\n                function s(e, t) {\n                    return function(e) {\n                        if (Array.isArray(e)) return e;\n                    }(e) || function(e, t) {\n                        var n = null == e ? null : \"undefined\" != typeof Symbol && e[Symbol.iterator] || e[\"@@iterator\"];\n                        if (null != n) {\n                            var i, a, r, o, l = [], s = !0, c = !1;\n                            try {\n                                if (r = (n = n.call(e)).next, 0 === t) {\n                                    if (Object(n) !== n) return;\n                                    s = !1;\n                                } else for (;!(s = (i = r.call(n)).done) && (l.push(i.value), l.length !== t); s = !0) ;\n                            } catch (e) {\n                                c = !0, a = e;\n                            } finally {\n                                try {\n                                    if (!s && null != n.return && (o = n.return(), Object(o) !== o)) return;\n                                } finally {\n                                    if (c) throw a;\n                                }\n                            }\n                            return l;\n                        }\n                    }(e, t) || function(e, t) {\n                        if (!e) return;\n                        if (\"string\" == typeof e) return c(e, t);\n                        var n = Object.prototype.toString.call(e).slice(8, -1);\n                        \"Object\" === n && e.constructor && (n = e.constructor.name);\n                        if (\"Map\" === n || \"Set\" === n) return Array.from(e);\n                        if (\"Arguments\" === n || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return c(e, t);\n                    }(e, t) || function() {\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                    }();\n                }\n                function c(e, t) {\n                    (null == t || t > e.length) && (t = e.length);\n                    for (var n = 0, i = new Array(t); n < t; n++) i[n] = e[n];\n                    return i;\n                }\n                function u(e) {\n                    return u = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function(e) {\n                        return typeof e;\n                    } : function(e) {\n                        return e && \"function\" == typeof Symbol && e.constructor === Symbol && e !== Symbol.prototype ? \"symbol\" : typeof e;\n                    }, u(e);\n                }\n                function f(e, t) {\n                    for (var n = 0; n < t.length; n++) {\n                        var i = t[n];\n                        i.enumerable = i.enumerable || !1, i.configurable = !0, \"value\" in i && (i.writable = !0), \n                        Object.defineProperty(e, (a = i.key, r = void 0, r = function(e, t) {\n                            if (\"object\" !== u(e) || null === e) return e;\n                            var n = e[Symbol.toPrimitive];\n                            if (void 0 !== n) {\n                                var i = n.call(e, t || \"default\");\n                                if (\"object\" !== u(i)) return i;\n                                throw new TypeError(\"@@toPrimitive must return a primitive value.\");\n                            }\n                            return (\"string\" === t ? String : Number)(e);\n                        }(a, \"string\"), \"symbol\" === u(r) ? r : String(r)), i);\n                    }\n                    var a, r;\n                }\n                function p(e) {\n                    return e && e.__esModule ? e : {\n                        default: e\n                    };\n                }\n                n(1313);\n                var d = a.default.dependencyLib, h = function() {\n                    function e(t, n, i, a) {\n                        !function(e, t) {\n                            if (!(e instanceof t)) throw new TypeError(\"Cannot call a class as a function\");\n                        }(this, e), this.mask = t, this.format = n, this.opts = i, this.inputmask = a, this._date = new Date(1, 0, 1), \n                        this.initDateObject(t, this.opts, this.inputmask);\n                    }\n                    var t, n, i;\n                    return t = e, (n = [ {\n                        key: \"date\",\n                        get: function() {\n                            return void 0 === this._date && (this._date = new Date(1, 0, 1), this.initDateObject(void 0, this.opts, this.inputmask)), \n                            this._date;\n                        }\n                    }, {\n                        key: \"initDateObject\",\n                        value: function(e, t, n) {\n                            var i;\n                            for (P(t).lastIndex = 0; i = P(t).exec(this.format); ) {\n                                var a = /\\d+$/.exec(i[0]), r = a ? i[0][0] + \"x\" : i[0], o = void 0;\n                                if (void 0 !== e) {\n                                    if (a) {\n                                        var s = P(t).lastIndex, c = j.call(n, i.index, t, n && n.maskset);\n                                        P(t).lastIndex = s, o = e.slice(0, e.indexOf(c.nextMatch[0]));\n                                    } else {\n                                        for (var u = i[0][0], f = i.index; n && (t.placeholder[l.getTest.call(n, f).match.placeholder] || l.getTest.call(n, f).match.placeholder) === u; ) f++;\n                                        var p = f - i.index;\n                                        o = e.slice(0, p || y[r] && y[r][4] || r.length);\n                                    }\n                                    e = e.slice(o.length);\n                                }\n                                Object.prototype.hasOwnProperty.call(y, r) && this.setValue(this, o, r, y[r][2], y[r][1]);\n                            }\n                        }\n                    }, {\n                        key: \"setValue\",\n                        value: function(e, t, n, i, a) {\n                            if (void 0 !== t) switch (i) {\n                              case \"ampm\":\n                                e[i] = t, e[\"raw\" + i] = t.replace(/\\s/g, \"_\");\n                                break;\n\n                              case \"month\":\n                                if (\"mmm\" === n || \"mmmm\" === n) {\n                                    e[i] = _(\"mmm\" === n ? m.monthNames.slice(0, 12).findIndex((function(e) {\n                                        return t.toLowerCase() === e.toLowerCase();\n                                    })) + 1 : m.monthNames.slice(12, 24).findIndex((function(e) {\n                                        return t.toLowerCase() === e.toLowerCase();\n                                    })) + 1, 2), e[i] = \"00\" === e[i] ? \"\" : e[i].toString(), e[\"raw\" + i] = e[i];\n                                    break;\n                                }\n\n                              default:\n                                e[i] = t.replace(/[^0-9]/g, \"0\"), e[\"raw\" + i] = t.replace(/\\s/g, \"_\");\n                            }\n                            if (void 0 !== a) {\n                                var r = e[i];\n                                (\"day\" === i && 29 === parseInt(r) || \"month\" === i && 2 === parseInt(r)) && (29 !== parseInt(e.day) || 2 !== parseInt(e.month) || \"\" !== e.year && void 0 !== e.year || e._date.setFullYear(2012, 1, 29)), \n                                \"day\" === i && (g = !0, 0 === parseInt(r) && (r = 1)), \"month\" === i && (g = !0), \n                                \"year\" === i && (g = !0, r.length < y[n][4] && (r = _(r, y[n][4], !0))), (\"\" !== r && !isNaN(r) || \"ampm\" === i) && a.call(e._date, r);\n                            }\n                        }\n                    }, {\n                        key: \"reset\",\n                        value: function() {\n                            this._date = new Date(1, 0, 1);\n                        }\n                    }, {\n                        key: \"reInit\",\n                        value: function() {\n                            this._date = void 0, this.date;\n                        }\n                    } ]) && f(t.prototype, n), i && f(t, i), Object.defineProperty(t, \"prototype\", {\n                        writable: !1\n                    }), e;\n                }(), v = (new Date).getFullYear(), m = a.default.prototype.i18n, g = !1, y = {\n                    d: [ \"[1-9]|[12][0-9]|3[01]\", Date.prototype.setDate, \"day\", Date.prototype.getDate ],\n                    dd: [ \"0[1-9]|[12][0-9]|3[01]\", Date.prototype.setDate, \"day\", function() {\n                        return _(Date.prototype.getDate.call(this), 2);\n                    } ],\n                    ddd: [ \"\" ],\n                    dddd: [ \"\" ],\n                    m: [ \"[1-9]|1[012]\", function(e) {\n                        var t = e ? parseInt(e) : 0;\n                        return t > 0 && t--, Date.prototype.setMonth.call(this, t);\n                    }, \"month\", function() {\n                        return Date.prototype.getMonth.call(this) + 1;\n                    } ],\n                    mm: [ \"0[1-9]|1[012]\", function(e) {\n                        var t = e ? parseInt(e) : 0;\n                        return t > 0 && t--, Date.prototype.setMonth.call(this, t);\n                    }, \"month\", function() {\n                        return _(Date.prototype.getMonth.call(this) + 1, 2);\n                    } ],\n                    mmm: [ m.monthNames.slice(0, 12).join(\"|\"), function(e) {\n                        var t = m.monthNames.slice(0, 12).findIndex((function(t) {\n                            return e.toLowerCase() === t.toLowerCase();\n                        }));\n                        return -1 !== t && Date.prototype.setMonth.call(this, t);\n                    }, \"month\", function() {\n                        return m.monthNames.slice(0, 12)[Date.prototype.getMonth.call(this)];\n                    } ],\n                    mmmm: [ m.monthNames.slice(12, 24).join(\"|\"), function(e) {\n                        var t = m.monthNames.slice(12, 24).findIndex((function(t) {\n                            return e.toLowerCase() === t.toLowerCase();\n                        }));\n                        return -1 !== t && Date.prototype.setMonth.call(this, t);\n                    }, \"month\", function() {\n                        return m.monthNames.slice(12, 24)[Date.prototype.getMonth.call(this)];\n                    } ],\n                    yy: [ \"[0-9]{2}\", function(e) {\n                        var t = (new Date).getFullYear().toString().slice(0, 2);\n                        Date.prototype.setFullYear.call(this, \"\".concat(t).concat(e));\n                    }, \"year\", function() {\n                        return _(Date.prototype.getFullYear.call(this), 2);\n                    }, 2 ],\n                    yyyy: [ \"[0-9]{4}\", Date.prototype.setFullYear, \"year\", function() {\n                        return _(Date.prototype.getFullYear.call(this), 4);\n                    }, 4 ],\n                    h: [ \"[1-9]|1[0-2]\", Date.prototype.setHours, \"hours\", Date.prototype.getHours ],\n                    hh: [ \"0[1-9]|1[0-2]\", Date.prototype.setHours, \"hours\", function() {\n                        return _(Date.prototype.getHours.call(this), 2);\n                    } ],\n                    hx: [ function(e) {\n                        return \"[0-9]{\".concat(e, \"}\");\n                    }, Date.prototype.setHours, \"hours\", function(e) {\n                        return Date.prototype.getHours;\n                    } ],\n                    H: [ \"1?[0-9]|2[0-3]\", Date.prototype.setHours, \"hours\", Date.prototype.getHours ],\n                    HH: [ \"0[0-9]|1[0-9]|2[0-3]\", Date.prototype.setHours, \"hours\", function() {\n                        return _(Date.prototype.getHours.call(this), 2);\n                    } ],\n                    Hx: [ function(e) {\n                        return \"[0-9]{\".concat(e, \"}\");\n                    }, Date.prototype.setHours, \"hours\", function(e) {\n                        return function() {\n                            return _(Date.prototype.getHours.call(this), e);\n                        };\n                    } ],\n                    M: [ \"[1-5]?[0-9]\", Date.prototype.setMinutes, \"minutes\", Date.prototype.getMinutes ],\n                    MM: [ \"0[0-9]|1[0-9]|2[0-9]|3[0-9]|4[0-9]|5[0-9]\", Date.prototype.setMinutes, \"minutes\", function() {\n                        return _(Date.prototype.getMinutes.call(this), 2);\n                    } ],\n                    s: [ \"[1-5]?[0-9]\", Date.prototype.setSeconds, \"seconds\", Date.prototype.getSeconds ],\n                    ss: [ \"0[0-9]|1[0-9]|2[0-9]|3[0-9]|4[0-9]|5[0-9]\", Date.prototype.setSeconds, \"seconds\", function() {\n                        return _(Date.prototype.getSeconds.call(this), 2);\n                    } ],\n                    l: [ \"[0-9]{3}\", Date.prototype.setMilliseconds, \"milliseconds\", function() {\n                        return _(Date.prototype.getMilliseconds.call(this), 3);\n                    }, 3 ],\n                    L: [ \"[0-9]{2}\", Date.prototype.setMilliseconds, \"milliseconds\", function() {\n                        return _(Date.prototype.getMilliseconds.call(this), 2);\n                    }, 2 ],\n                    t: [ \"[ap]\", b, \"ampm\", x, 1 ],\n                    tt: [ \"[ap]m\", b, \"ampm\", x, 2 ],\n                    T: [ \"[AP]\", b, \"ampm\", x, 1 ],\n                    TT: [ \"[AP]M\", b, \"ampm\", x, 2 ],\n                    Z: [ \".*\", void 0, \"Z\", function() {\n                        var e = this.toString().match(/\\((.+)\\)/)[1];\n                        e.includes(\" \") && (e = (e = e.replace(\"-\", \" \").toUpperCase()).split(\" \").map((function(e) {\n                            return s(e, 1)[0];\n                        })).join(\"\"));\n                        return e;\n                    } ],\n                    o: [ \"\" ],\n                    S: [ \"\" ]\n                }, k = {\n                    isoDate: \"yyyy-mm-dd\",\n                    isoTime: \"HH:MM:ss\",\n                    isoDateTime: \"yyyy-mm-dd'T'HH:MM:ss\",\n                    isoUtcDateTime: \"UTC:yyyy-mm-dd'T'HH:MM:ss'Z'\"\n                };\n                function b(e) {\n                    var t = this.getHours();\n                    e.toLowerCase().includes(\"p\") ? this.setHours(t + 12) : e.toLowerCase().includes(\"a\") && t >= 12 && this.setHours(t - 12);\n                }\n                function x() {\n                    var e = this.getHours();\n                    return (e = e || 12) >= 12 ? \"PM\" : \"AM\";\n                }\n                function w(e) {\n                    var t = /\\d+$/.exec(e[0]);\n                    if (t && void 0 !== t[0]) {\n                        var n = y[e[0][0] + \"x\"].slice(\"\");\n                        return n[0] = n[0](t[0]), n[3] = n[3](t[0]), n;\n                    }\n                    if (y[e[0]]) return y[e[0]];\n                }\n                function P(e) {\n                    if (!e.tokenizer) {\n                        var t = [], n = [];\n                        for (var i in y) if (/\\.*x$/.test(i)) {\n                            var a = i[0] + \"\\\\d+\";\n                            -1 === n.indexOf(a) && n.push(a);\n                        } else -1 === t.indexOf(i[0]) && t.push(i[0]);\n                        e.tokenizer = \"(\" + (n.length > 0 ? n.join(\"|\") + \"|\" : \"\") + t.join(\"+|\") + \")+?|.\", \n                        e.tokenizer = new RegExp(e.tokenizer, \"g\");\n                    }\n                    return e.tokenizer;\n                }\n                function S(e, t, n) {\n                    if (!g) return !0;\n                    if (void 0 === e.rawday || !isFinite(e.rawday) && new Date(e.date.getFullYear(), isFinite(e.rawmonth) ? e.month : e.date.getMonth() + 1, 0).getDate() >= e.day || \"29\" == e.day && (!isFinite(e.rawyear) || void 0 === e.rawyear || \"\" === e.rawyear) || new Date(e.date.getFullYear(), isFinite(e.rawmonth) ? e.month : e.date.getMonth() + 1, 0).getDate() >= e.day) return t;\n                    if (\"29\" == e.day) {\n                        var i = j.call(this, t.pos, n, this.maskset);\n                        if (i.targetMatch && \"yyyy\" === i.targetMatch[0] && t.pos - i.targetMatchIndex == 2) return t.remove = t.pos + 1, \n                        t;\n                    } else if (2 == e.date.getMonth() && \"30\" == e.day && void 0 !== t.c) return e.day = \"03\", \n                    e.date.setDate(3), e.date.setMonth(1), t.insert = [ {\n                        pos: t.pos,\n                        c: \"0\"\n                    }, {\n                        pos: t.pos + 1,\n                        c: t.c\n                    } ], t.caret = o.seekNext.call(this, t.pos + 1), t;\n                    return !1;\n                }\n                function O(e, t, n, a) {\n                    var r, o, l = \"\", s = 0, c = {};\n                    for (P(n).lastIndex = 0; r = P(n).exec(e); ) {\n                        if (void 0 === t) if (o = w(r)) l += \"(\" + o[0] + \")\", n.placeholder && \"\" !== n.placeholder ? (c[s] = n.placeholder[r.index % n.placeholder.length], \n                        c[n.placeholder[r.index % n.placeholder.length]] = r[0].charAt(0)) : c[s] = r[0].charAt(0); else switch (r[0]) {\n                          case \"[\":\n                            l += \"(\";\n                            break;\n\n                          case \"]\":\n                            l += \")?\";\n                            break;\n\n                          default:\n                            l += (0, i.default)(r[0]), c[s] = r[0].charAt(0);\n                        } else if (o = w(r)) if (!0 !== a && o[3]) l += o[3].call(t.date); else o[2] ? l += t[\"raw\" + o[2]] : l += r[0]; else l += r[0];\n                        s++;\n                    }\n                    return void 0 === t && (n.placeholder = c), l;\n                }\n                function _(e, t, n) {\n                    for (e = String(e), t = t || 2; e.length < t; ) e = n ? e + \"0\" : \"0\" + e;\n                    return e;\n                }\n                function M(e, t, n) {\n                    return \"string\" == typeof e ? new h(e, t, n, this) : e && \"object\" === u(e) && Object.prototype.hasOwnProperty.call(e, \"date\") ? e : void 0;\n                }\n                function E(e, t) {\n                    return O(t.inputFormat, {\n                        date: e\n                    }, t);\n                }\n                function j(e, t, n) {\n                    var i, a, r = this, o = n && n.tests[e] ? t.placeholder[n.tests[e][0].match.placeholder] || n.tests[e][0].match.placeholder : \"\", s = 0, c = 0;\n                    for (P(t).lastIndex = 0; a = P(t).exec(t.inputFormat); ) {\n                        var u = /\\d+$/.exec(a[0]);\n                        if (u) c = parseInt(u[0]); else {\n                            for (var f = a[0][0], p = s; r && (t.placeholder[l.getTest.call(r, p).match.placeholder] || l.getTest.call(r, p).match.placeholder) === f; ) p++;\n                            0 === (c = p - s) && (c = a[0].length);\n                        }\n                        if (s += c, -1 != a[0].indexOf(o) || s >= e + 1) {\n                            i = a, a = P(t).exec(t.inputFormat);\n                            break;\n                        }\n                    }\n                    return {\n                        targetMatchIndex: s - c,\n                        nextMatch: a,\n                        targetMatch: i\n                    };\n                }\n                a.default.extendAliases({\n                    datetime: {\n                        mask: function(e) {\n                            return e.numericInput = !1, y.S = m.ordinalSuffix.join(\"|\"), e.inputFormat = k[e.inputFormat] || e.inputFormat, \n                            e.displayFormat = k[e.displayFormat] || e.displayFormat || e.inputFormat, e.outputFormat = k[e.outputFormat] || e.outputFormat || e.inputFormat, \n                            e.regex = O(e.inputFormat, void 0, e), e.min = M(e.min, e.inputFormat, e), e.max = M(e.max, e.inputFormat, e), \n                            null;\n                        },\n                        placeholder: \"\",\n                        inputFormat: \"isoDateTime\",\n                        displayFormat: null,\n                        outputFormat: null,\n                        min: null,\n                        max: null,\n                        skipOptionalPartCharacter: \"\",\n                        preValidation: function(e, t, n, i, a, r, o, l) {\n                            if (l) return !0;\n                            if (isNaN(n) && e[t] !== n) {\n                                var s = j.call(this, t, a, r);\n                                if (s.nextMatch && s.nextMatch[0] === n && s.targetMatch[0].length > 1) {\n                                    var c = w(s.targetMatch)[0];\n                                    if (new RegExp(c).test(\"0\" + e[t - 1])) return e[t] = e[t - 1], e[t - 1] = \"0\", \n                                    {\n                                        fuzzy: !0,\n                                        buffer: e,\n                                        refreshFromBuffer: {\n                                            start: t - 1,\n                                            end: t + 1\n                                        },\n                                        pos: t + 1\n                                    };\n                                }\n                            }\n                            return !0;\n                        },\n                        postValidation: function(e, t, n, i, a, r, o, s) {\n                            var c, u, f = this;\n                            if (o) return !0;\n                            if (!1 === i && (((c = j.call(f, t + 1, a, r)).targetMatch && c.targetMatchIndex === t && c.targetMatch[0].length > 1 && void 0 !== y[c.targetMatch[0]] || (c = j.call(f, t + 2, a, r)).targetMatch && c.targetMatchIndex === t + 1 && c.targetMatch[0].length > 1 && void 0 !== y[c.targetMatch[0]]) && (u = w(c.targetMatch)[0]), \n                            void 0 !== u && (void 0 !== r.validPositions[t + 1] && new RegExp(u).test(n + \"0\") ? (e[t] = n, \n                            e[t + 1] = \"0\", i = {\n                                pos: t + 2,\n                                caret: t\n                            }) : new RegExp(u).test(\"0\" + n) && (e[t] = \"0\", e[t + 1] = n, i = {\n                                pos: t + 2\n                            })), !1 === i)) return i;\n                            if (i.fuzzy && (e = i.buffer, t = i.pos), (c = j.call(f, t, a, r)).targetMatch && c.targetMatch[0] && void 0 !== y[c.targetMatch[0]]) {\n                                var p = w(c.targetMatch);\n                                u = p[0];\n                                var d = e.slice(c.targetMatchIndex, c.targetMatchIndex + c.targetMatch[0].length);\n                                if (!1 === new RegExp(u).test(d.join(\"\")) && 2 === c.targetMatch[0].length && r.validPositions[c.targetMatchIndex] && r.validPositions[c.targetMatchIndex + 1] && (r.validPositions[c.targetMatchIndex + 1].input = \"0\"), \n                                \"year\" == p[2]) for (var h = l.getMaskTemplate.call(f, !1, 1, void 0, !0), m = t + 1; m < e.length; m++) e[m] = h[m], \n                                r.validPositions.splice(t + 1, 1);\n                            }\n                            var g = i, k = M.call(f, e.join(\"\"), a.inputFormat, a);\n                            return g && !isNaN(k.date.getTime()) && (a.prefillYear && (g = function(e, t, n) {\n                                if (e.year !== e.rawyear) {\n                                    var i = v.toString(), a = e.rawyear.replace(/[^0-9]/g, \"\"), r = i.slice(0, a.length), o = i.slice(a.length);\n                                    if (2 === a.length && a === r) {\n                                        var l = new Date(v, e.month - 1, e.day);\n                                        e.day == l.getDate() && (!n.max || n.max.date.getTime() >= l.getTime()) && (e.date.setFullYear(v), \n                                        e.year = i, t.insert = [ {\n                                            pos: t.pos + 1,\n                                            c: o[0]\n                                        }, {\n                                            pos: t.pos + 2,\n                                            c: o[1]\n                                        } ]);\n                                    }\n                                }\n                                return t;\n                            }(k, g, a)), g = function(e, t, n, i, a) {\n                                if (!t) return t;\n                                if (t && n.min && !isNaN(n.min.date.getTime())) {\n                                    var r;\n                                    for (e.reset(), P(n).lastIndex = 0; r = P(n).exec(n.inputFormat); ) {\n                                        var o;\n                                        if ((o = w(r)) && o[3]) {\n                                            for (var l = o[1], s = e[o[2]], c = n.min[o[2]], u = n.max ? n.max[o[2]] : c + 1, f = [], p = !1, d = 0; d < c.length; d++) void 0 !== i.validPositions[d + r.index] || p ? (f[d] = s[d], \n                                            p = p || s[d] > c[d]) : (d + r.index == 0 && s[d] < c[d] ? (f[d] = s[d], p = !0) : f[d] = c[d], \n                                            \"year\" === o[2] && s.length - 1 == d && c != u && (f = (parseInt(f.join(\"\")) + 1).toString().split(\"\")), \n                                            \"ampm\" === o[2] && c != u && n.min.date.getTime() > e.date.getTime() && (f[d] = u[d]));\n                                            l.call(e._date, f.join(\"\"));\n                                        }\n                                    }\n                                    t = n.min.date.getTime() <= e.date.getTime(), e.reInit();\n                                }\n                                return t && n.max && (isNaN(n.max.date.getTime()) || (t = n.max.date.getTime() >= e.date.getTime())), \n                                t;\n                            }(k, g = S.call(f, k, g, a), a, r)), void 0 !== t && g && i.pos !== t ? {\n                                buffer: O(a.inputFormat, k, a).split(\"\"),\n                                refreshFromBuffer: {\n                                    start: t,\n                                    end: i.pos\n                                },\n                                pos: i.caret || i.pos\n                            } : g;\n                        },\n                        onKeyDown: function(e, t, n, i) {\n                            e.ctrlKey && e.key === r.keys.ArrowRight && (this.inputmask._valueSet(E(new Date, i)), \n                            d(this).trigger(\"setvalue\"));\n                        },\n                        onUnMask: function(e, t, n) {\n                            return t ? O(n.outputFormat, M.call(this, e, n.inputFormat, n), n, !0) : t;\n                        },\n                        casing: function(e, t, n, i) {\n                            if (0 == t.nativeDef.indexOf(\"[ap]\")) return e.toLowerCase();\n                            if (0 == t.nativeDef.indexOf(\"[AP]\")) return e.toUpperCase();\n                            var a = l.getTest.call(this, [ n - 1 ]);\n                            return 0 == a.match.def.indexOf(\"[AP]\") || 0 === n || a && a.input === String.fromCharCode(r.keyCode.Space) || a && a.match.def === String.fromCharCode(r.keyCode.Space) ? e.toUpperCase() : e.toLowerCase();\n                        },\n                        onBeforeMask: function(e, t) {\n                            return \"[object Date]\" === Object.prototype.toString.call(e) && (e = E(e, t)), e;\n                        },\n                        insertMode: !1,\n                        insertModeVisual: !1,\n                        shiftPositions: !1,\n                        keepStatic: !1,\n                        inputmode: \"numeric\",\n                        prefillYear: !0\n                    }\n                });\n            },\n            1313: function(e, t, n) {\n                var i, a = (i = n(2394)) && i.__esModule ? i : {\n                    default: i\n                };\n                a.default.dependencyLib.extend(!0, a.default.prototype.i18n, {\n                    dayNames: [ \"Mon\", \"Tue\", \"Wed\", \"Thu\", \"Fri\", \"Sat\", \"Sun\", \"Monday\", \"Tuesday\", \"Wednesday\", \"Thursday\", \"Friday\", \"Saturday\", \"Sunday\" ],\n                    monthNames: [ \"Jan\", \"Feb\", \"Mar\", \"Apr\", \"May\", \"Jun\", \"Jul\", \"Aug\", \"Sep\", \"Oct\", \"Nov\", \"Dec\", \"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\" ],\n                    ordinalSuffix: [ \"st\", \"nd\", \"rd\", \"th\" ]\n                });\n            },\n            3851: function(e, t, n) {\n                var i, a = (i = n(2394)) && i.__esModule ? i : {\n                    default: i\n                }, r = n(8711), o = n(4713);\n                function l(e) {\n                    return function(e) {\n                        if (Array.isArray(e)) return s(e);\n                    }(e) || function(e) {\n                        if (\"undefined\" != typeof Symbol && null != e[Symbol.iterator] || null != e[\"@@iterator\"]) return Array.from(e);\n                    }(e) || function(e, t) {\n                        if (!e) return;\n                        if (\"string\" == typeof e) return s(e, t);\n                        var n = Object.prototype.toString.call(e).slice(8, -1);\n                        \"Object\" === n && e.constructor && (n = e.constructor.name);\n                        if (\"Map\" === n || \"Set\" === n) return Array.from(e);\n                        if (\"Arguments\" === n || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return s(e, t);\n                    }(e) || function() {\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                    }();\n                }\n                function s(e, t) {\n                    (null == t || t > e.length) && (t = e.length);\n                    for (var n = 0, i = new Array(t); n < t; n++) i[n] = e[n];\n                    return i;\n                }\n                a.default.extendDefinitions({\n                    A: {\n                        validator: \"[A-Za-z\\u0410-\\u044f\\u0401\\u0451\\xc0-\\xff\\xb5]\",\n                        casing: \"upper\"\n                    },\n                    \"&\": {\n                        validator: \"[0-9A-Za-z\\u0410-\\u044f\\u0401\\u0451\\xc0-\\xff\\xb5]\",\n                        casing: \"upper\"\n                    },\n                    \"#\": {\n                        validator: \"[0-9A-Fa-f]\",\n                        casing: \"upper\"\n                    }\n                });\n                var c = /25[0-5]|2[0-4][0-9]|[01][0-9][0-9]/;\n                function u(e, t, n, i, a) {\n                    if (n - 1 > -1 && \".\" !== t.buffer[n - 1] ? (e = t.buffer[n - 1] + e, e = n - 2 > -1 && \".\" !== t.buffer[n - 2] ? t.buffer[n - 2] + e : \"0\" + e) : e = \"00\" + e, \n                    a.greedy && parseInt(e) > 255 && c.test(\"00\" + e.charAt(2))) {\n                        var r = [].concat(l(t.buffer.slice(0, n)), [ \".\", e.charAt(2) ]);\n                        if (r.join(\"\").match(/\\./g).length < 4) return {\n                            refreshFromBuffer: !0,\n                            buffer: r,\n                            caret: n + 2\n                        };\n                    }\n                    return c.test(e);\n                }\n                a.default.extendAliases({\n                    cssunit: {\n                        regex: \"[+-]?[0-9]+\\\\.?([0-9]+)?(px|em|rem|ex|%|in|cm|mm|pt|pc)\"\n                    },\n                    url: {\n                        regex: \"(https?|ftp)://.*\",\n                        autoUnmask: !1,\n                        keepStatic: !1,\n                        tabThrough: !0\n                    },\n                    ip: {\n                        mask: \"i{1,3}.j{1,3}.k{1,3}.l{1,3}\",\n                        definitions: {\n                            i: {\n                                validator: u\n                            },\n                            j: {\n                                validator: u\n                            },\n                            k: {\n                                validator: u\n                            },\n                            l: {\n                                validator: u\n                            }\n                        },\n                        onUnMask: function(e, t, n) {\n                            return e;\n                        },\n                        inputmode: \"decimal\",\n                        substitutes: {\n                            \",\": \".\"\n                        }\n                    },\n                    email: {\n                        mask: function(e) {\n                            var t = e.separator, n = e.quantifier, i = \"*{1,64}[.*{1,64}][.*{1,64}][.*{1,63}]@-{1,63}.-{1,63}[.-{1,63}][.-{1,63}]\", a = i;\n                            if (t) for (var r = 0; r < n; r++) a += \"[\".concat(t).concat(i, \"]\");\n                            return a;\n                        },\n                        greedy: !1,\n                        casing: \"lower\",\n                        separator: null,\n                        quantifier: 5,\n                        skipOptionalPartCharacter: \"\",\n                        onBeforePaste: function(e, t) {\n                            return (e = e.toLowerCase()).replace(\"mailto:\", \"\");\n                        },\n                        definitions: {\n                            \"*\": {\n                                validator: \"[0-9\\uff11-\\uff19A-Za-z\\u0410-\\u044f\\u0401\\u0451\\xc0-\\xff\\xb5!#$%&'*+/=?^_`{|}~-]\"\n                            },\n                            \"-\": {\n                                validator: \"[0-9A-Za-z-]\"\n                            }\n                        },\n                        onUnMask: function(e, t, n) {\n                            return e;\n                        },\n                        inputmode: \"email\"\n                    },\n                    mac: {\n                        mask: \"##:##:##:##:##:##\"\n                    },\n                    vin: {\n                        mask: \"V{13}9{4}\",\n                        definitions: {\n                            V: {\n                                validator: \"[A-HJ-NPR-Za-hj-npr-z\\\\d]\",\n                                casing: \"upper\"\n                            }\n                        },\n                        clearIncomplete: !0,\n                        autoUnmask: !0\n                    },\n                    ssn: {\n                        mask: \"999-99-9999\",\n                        postValidation: function(e, t, n, i, a, l, s) {\n                            var c = o.getMaskTemplate.call(this, !0, r.getLastValidPosition.call(this), !0, !0);\n                            return /^(?!219-09-9999|078-05-1120)(?!666|000|9.{2}).{3}-(?!00).{2}-(?!0{4}).{4}$/.test(c.join(\"\"));\n                        }\n                    }\n                });\n            },\n            207: function(e, t, n) {\n                var i = l(n(7184)), a = l(n(2394)), r = n(2839), o = n(8711);\n                function l(e) {\n                    return e && e.__esModule ? e : {\n                        default: e\n                    };\n                }\n                var s = a.default.dependencyLib;\n                function c(e, t) {\n                    for (var n = \"\", i = 0; i < e.length; i++) a.default.prototype.definitions[e.charAt(i)] || t.definitions[e.charAt(i)] || t.optionalmarker[0] === e.charAt(i) || t.optionalmarker[1] === e.charAt(i) || t.quantifiermarker[0] === e.charAt(i) || t.quantifiermarker[1] === e.charAt(i) || t.groupmarker[0] === e.charAt(i) || t.groupmarker[1] === e.charAt(i) || t.alternatormarker === e.charAt(i) ? n += \"\\\\\" + e.charAt(i) : n += e.charAt(i);\n                    return n;\n                }\n                function u(e, t, n, i) {\n                    if (e.length > 0 && t > 0 && (!n.digitsOptional || i)) {\n                        var a = e.indexOf(n.radixPoint), r = !1;\n                        n.negationSymbol.back === e[e.length - 1] && (r = !0, e.length--), -1 === a && (e.push(n.radixPoint), \n                        a = e.length - 1);\n                        for (var o = 1; o <= t; o++) isFinite(e[a + o]) || (e[a + o] = \"0\");\n                    }\n                    return r && e.push(n.negationSymbol.back), e;\n                }\n                function f(e, t) {\n                    var n = 0;\n                    for (var i in \"+\" === e && (n = o.seekNext.call(this, t.validPositions.length - 1)), \n                    t.tests) if ((i = parseInt(i)) >= n) for (var a = 0, r = t.tests[i].length; a < r; a++) if ((void 0 === t.validPositions[i] || \"-\" === e) && t.tests[i][a].match.def === e) return i + (void 0 !== t.validPositions[i] && \"-\" !== e ? 1 : 0);\n                    return n;\n                }\n                function p(e, t) {\n                    for (var n = -1, i = 0, a = t.validPositions.length; i < a; i++) {\n                        var r = t.validPositions[i];\n                        if (r && r.match.def === e) {\n                            n = i;\n                            break;\n                        }\n                    }\n                    return n;\n                }\n                function d(e, t, n, i, a) {\n                    var r = t.buffer ? t.buffer.indexOf(a.radixPoint) : -1, o = (-1 !== r || i && a.jitMasking) && new RegExp(a.definitions[9].validator).test(e);\n                    return !i && a._radixDance && -1 !== r && o && null == t.validPositions[r] ? {\n                        insert: {\n                            pos: r === n ? r + 1 : r,\n                            c: a.radixPoint\n                        },\n                        pos: n\n                    } : o;\n                }\n                a.default.extendAliases({\n                    numeric: {\n                        mask: function(e) {\n                            e.repeat = 0, e.groupSeparator === e.radixPoint && e.digits && \"0\" !== e.digits && (\".\" === e.radixPoint ? e.groupSeparator = \",\" : \",\" === e.radixPoint ? e.groupSeparator = \".\" : e.groupSeparator = \"\"), \n                            \" \" === e.groupSeparator && (e.skipOptionalPartCharacter = void 0), e.placeholder.length > 1 && (e.placeholder = e.placeholder.charAt(0)), \n                            \"radixFocus\" === e.positionCaretOnClick && \"\" === e.placeholder && (e.positionCaretOnClick = \"lvp\");\n                            var t = \"0\", n = e.radixPoint;\n                            !0 === e.numericInput && void 0 === e.__financeInput ? (t = \"1\", e.positionCaretOnClick = \"radixFocus\" === e.positionCaretOnClick ? \"lvp\" : e.positionCaretOnClick, \n                            e.digitsOptional = !1, isNaN(e.digits) && (e.digits = 2), e._radixDance = !1, n = \",\" === e.radixPoint ? \"?\" : \"!\", \n                            \"\" !== e.radixPoint && void 0 === e.definitions[n] && (e.definitions[n] = {}, e.definitions[n].validator = \"[\" + e.radixPoint + \"]\", \n                            e.definitions[n].placeholder = e.radixPoint, e.definitions[n].static = !0, e.definitions[n].generated = !0)) : (e.__financeInput = !1, \n                            e.numericInput = !0);\n                            var a, r = \"[+]\";\n                            if (r += c(e.prefix, e), \"\" !== e.groupSeparator ? (void 0 === e.definitions[e.groupSeparator] && (e.definitions[e.groupSeparator] = {}, \n                            e.definitions[e.groupSeparator].validator = \"[\" + e.groupSeparator + \"]\", e.definitions[e.groupSeparator].placeholder = e.groupSeparator, \n                            e.definitions[e.groupSeparator].static = !0, e.definitions[e.groupSeparator].generated = !0), \n                            r += e._mask(e)) : r += \"9{+}\", void 0 !== e.digits && 0 !== e.digits) {\n                                var o = e.digits.toString().split(\",\");\n                                isFinite(o[0]) && o[1] && isFinite(o[1]) ? r += n + t + \"{\" + e.digits + \"}\" : (isNaN(e.digits) || parseInt(e.digits) > 0) && (e.digitsOptional || e.jitMasking ? (a = r + n + t + \"{0,\" + e.digits + \"}\", \n                                e.keepStatic = !0) : r += n + t + \"{\" + e.digits + \"}\");\n                            } else e.inputmode = \"numeric\";\n                            return r += c(e.suffix, e), r += \"[-]\", a && (r = [ a + c(e.suffix, e) + \"[-]\", r ]), \n                            e.greedy = !1, function(e) {\n                                void 0 === e.parseMinMaxOptions && (null !== e.min && (e.min = e.min.toString().replace(new RegExp((0, \n                                i.default)(e.groupSeparator), \"g\"), \"\"), \",\" === e.radixPoint && (e.min = e.min.replace(e.radixPoint, \".\")), \n                                e.min = isFinite(e.min) ? parseFloat(e.min) : NaN, isNaN(e.min) && (e.min = Number.MIN_VALUE)), \n                                null !== e.max && (e.max = e.max.toString().replace(new RegExp((0, i.default)(e.groupSeparator), \"g\"), \"\"), \n                                \",\" === e.radixPoint && (e.max = e.max.replace(e.radixPoint, \".\")), e.max = isFinite(e.max) ? parseFloat(e.max) : NaN, \n                                isNaN(e.max) && (e.max = Number.MAX_VALUE)), e.parseMinMaxOptions = \"done\");\n                            }(e), \"\" !== e.radixPoint && e.substituteRadixPoint && (e.substitutes[\".\" == e.radixPoint ? \",\" : \".\"] = e.radixPoint), \n                            r;\n                        },\n                        _mask: function(e) {\n                            return \"(\" + e.groupSeparator + \"999){+|1}\";\n                        },\n                        digits: \"*\",\n                        digitsOptional: !0,\n                        enforceDigitsOnBlur: !1,\n                        radixPoint: \".\",\n                        positionCaretOnClick: \"radixFocus\",\n                        _radixDance: !0,\n                        groupSeparator: \"\",\n                        allowMinus: !0,\n                        negationSymbol: {\n                            front: \"-\",\n                            back: \"\"\n                        },\n                        prefix: \"\",\n                        suffix: \"\",\n                        min: null,\n                        max: null,\n                        SetMaxOnOverflow: !1,\n                        step: 1,\n                        inputType: \"text\",\n                        unmaskAsNumber: !1,\n                        roundingFN: Math.round,\n                        inputmode: \"decimal\",\n                        shortcuts: {\n                            k: \"1000\",\n                            m: \"1000000\"\n                        },\n                        placeholder: \"0\",\n                        greedy: !1,\n                        rightAlign: !0,\n                        insertMode: !0,\n                        autoUnmask: !1,\n                        skipOptionalPartCharacter: \"\",\n                        usePrototypeDefinitions: !1,\n                        stripLeadingZeroes: !0,\n                        substituteRadixPoint: !0,\n                        definitions: {\n                            0: {\n                                validator: d\n                            },\n                            1: {\n                                validator: d,\n                                definitionSymbol: \"9\"\n                            },\n                            9: {\n                                validator: \"[0-9\\uff10-\\uff19\\u0660-\\u0669\\u06f0-\\u06f9]\",\n                                definitionSymbol: \"*\"\n                            },\n                            \"+\": {\n                                validator: function(e, t, n, i, a) {\n                                    return a.allowMinus && (\"-\" === e || e === a.negationSymbol.front);\n                                }\n                            },\n                            \"-\": {\n                                validator: function(e, t, n, i, a) {\n                                    return a.allowMinus && e === a.negationSymbol.back;\n                                }\n                            }\n                        },\n                        preValidation: function(e, t, n, i, a, r, o, l) {\n                            var s = this;\n                            if (!1 !== a.__financeInput && n === a.radixPoint) return !1;\n                            var c = e.indexOf(a.radixPoint), u = t;\n                            if (t = function(e, t, n, i, a) {\n                                return a._radixDance && a.numericInput && t !== a.negationSymbol.back && e <= n && (n > 0 || t == a.radixPoint) && (void 0 === i.validPositions[e - 1] || i.validPositions[e - 1].input !== a.negationSymbol.back) && (e -= 1), \n                                e;\n                            }(t, n, c, r, a), \"-\" === n || n === a.negationSymbol.front) {\n                                if (!0 !== a.allowMinus) return !1;\n                                var d = !1, h = p(\"+\", r), v = p(\"-\", r);\n                                return -1 !== h && (d = [ h ], -1 !== v && d.push(v)), !1 !== d ? {\n                                    remove: d,\n                                    caret: u - a.negationSymbol.back.length\n                                } : {\n                                    insert: [ {\n                                        pos: f.call(s, \"+\", r),\n                                        c: a.negationSymbol.front,\n                                        fromIsValid: !0\n                                    }, {\n                                        pos: f.call(s, \"-\", r),\n                                        c: a.negationSymbol.back,\n                                        fromIsValid: void 0\n                                    } ],\n                                    caret: u + a.negationSymbol.back.length\n                                };\n                            }\n                            if (n === a.groupSeparator) return {\n                                caret: u\n                            };\n                            if (l) return !0;\n                            if (-1 !== c && !0 === a._radixDance && !1 === i && n === a.radixPoint && void 0 !== a.digits && (isNaN(a.digits) || parseInt(a.digits) > 0) && c !== t) {\n                                var m = f.call(s, a.radixPoint, r);\n                                return r.validPositions[m] && (r.validPositions[m].generatedInput = r.validPositions[m].generated || !1), \n                                {\n                                    caret: a._radixDance && t === c - 1 ? c + 1 : c\n                                };\n                            }\n                            if (!1 === a.__financeInput) if (i) {\n                                if (a.digitsOptional) return {\n                                    rewritePosition: o.end\n                                };\n                                if (!a.digitsOptional) {\n                                    if (o.begin > c && o.end <= c) return n === a.radixPoint ? {\n                                        insert: {\n                                            pos: c + 1,\n                                            c: \"0\",\n                                            fromIsValid: !0\n                                        },\n                                        rewritePosition: c\n                                    } : {\n                                        rewritePosition: c + 1\n                                    };\n                                    if (o.begin < c) return {\n                                        rewritePosition: o.begin - 1\n                                    };\n                                }\n                            } else if (!a.showMaskOnHover && !a.showMaskOnFocus && !a.digitsOptional && a.digits > 0 && \"\" === this.__valueGet.call(this.el)) return {\n                                rewritePosition: c\n                            };\n                            return {\n                                rewritePosition: t\n                            };\n                        },\n                        postValidation: function(e, t, n, i, a, r, o) {\n                            if (!1 === i) return i;\n                            if (o) return !0;\n                            if (null !== a.min || null !== a.max) {\n                                var l = a.onUnMask(e.slice().reverse().join(\"\"), void 0, s.extend({}, a, {\n                                    unmaskAsNumber: !0\n                                }));\n                                if (null !== a.min && l < a.min && (l.toString().length > a.min.toString().length || l < 0)) return !1;\n                                if (null !== a.max && l > a.max) return !!a.SetMaxOnOverflow && {\n                                    refreshFromBuffer: !0,\n                                    buffer: u(a.max.toString().replace(\".\", a.radixPoint).split(\"\"), a.digits, a).reverse()\n                                };\n                            }\n                            return i;\n                        },\n                        onUnMask: function(e, t, n) {\n                            if (\"\" === t && !0 === n.nullable) return t;\n                            var a = e.replace(n.prefix, \"\");\n                            return a = (a = a.replace(n.suffix, \"\")).replace(new RegExp((0, i.default)(n.groupSeparator), \"g\"), \"\"), \n                            \"\" !== n.placeholder.charAt(0) && (a = a.replace(new RegExp(n.placeholder.charAt(0), \"g\"), \"0\")), \n                            n.unmaskAsNumber ? (\"\" !== n.radixPoint && -1 !== a.indexOf(n.radixPoint) && (a = a.replace(i.default.call(this, n.radixPoint), \".\")), \n                            a = (a = a.replace(new RegExp(\"^\" + (0, i.default)(n.negationSymbol.front)), \"-\")).replace(new RegExp((0, \n                            i.default)(n.negationSymbol.back) + \"$\"), \"\"), Number(a)) : a;\n                        },\n                        isComplete: function(e, t) {\n                            var n = (t.numericInput ? e.slice().reverse() : e).join(\"\");\n                            return n = (n = (n = (n = (n = n.replace(new RegExp(\"^\" + (0, i.default)(t.negationSymbol.front)), \"-\")).replace(new RegExp((0, \n                            i.default)(t.negationSymbol.back) + \"$\"), \"\")).replace(t.prefix, \"\")).replace(t.suffix, \"\")).replace(new RegExp((0, \n                            i.default)(t.groupSeparator) + \"([0-9]{3})\", \"g\"), \"$1\"), \",\" === t.radixPoint && (n = n.replace((0, \n                            i.default)(t.radixPoint), \".\")), isFinite(n);\n                        },\n                        onBeforeMask: function(e, t) {\n                            var n;\n                            e = null !== (n = e) && void 0 !== n ? n : \"\";\n                            var a = t.radixPoint || \",\";\n                            isFinite(t.digits) && (t.digits = parseInt(t.digits)), \"number\" != typeof e && \"number\" !== t.inputType || \"\" === a || (e = e.toString().replace(\".\", a));\n                            var r = \"-\" === e.charAt(0) || e.charAt(0) === t.negationSymbol.front, o = e.split(a), l = o[0].replace(/[^\\-0-9]/g, \"\"), s = o.length > 1 ? o[1].replace(/[^0-9]/g, \"\") : \"\", c = o.length > 1;\n                            e = l + (\"\" !== s ? a + s : s);\n                            var f = 0;\n                            if (\"\" !== a && (f = t.digitsOptional ? t.digits < s.length ? t.digits : s.length : t.digits, \n                            \"\" !== s || !t.digitsOptional)) {\n                                var p = Math.pow(10, f || 1);\n                                e = e.replace((0, i.default)(a), \".\"), isNaN(parseFloat(e)) || (e = (t.roundingFN(parseFloat(e) * p) / p).toFixed(f)), \n                                e = e.toString().replace(\".\", a);\n                            }\n                            if (0 === t.digits && -1 !== e.indexOf(a) && (e = e.substring(0, e.indexOf(a))), \n                            null !== t.min || null !== t.max) {\n                                var d = e.toString().replace(a, \".\");\n                                null !== t.min && d < t.min ? e = t.min.toString().replace(\".\", a) : null !== t.max && d > t.max && (e = t.max.toString().replace(\".\", a));\n                            }\n                            return r && \"-\" !== e.charAt(0) && (e = \"-\" + e), u(e.toString().split(\"\"), f, t, c).join(\"\");\n                        },\n                        onBeforeWrite: function(e, t, n, a) {\n                            function r(e, t) {\n                                if (!1 !== a.__financeInput || t) {\n                                    var n = e.indexOf(a.radixPoint);\n                                    -1 !== n && e.splice(n, 1);\n                                }\n                                if (\"\" !== a.groupSeparator) for (;-1 !== (n = e.indexOf(a.groupSeparator)); ) e.splice(n, 1);\n                                return e;\n                            }\n                            var o, l;\n                            if (a.stripLeadingZeroes && (l = function(e, t) {\n                                var n = new RegExp(\"(^\" + (\"\" !== t.negationSymbol.front ? (0, i.default)(t.negationSymbol.front) + \"?\" : \"\") + (0, \n                                i.default)(t.prefix) + \")(.*)(\" + (0, i.default)(t.suffix) + (\"\" != t.negationSymbol.back ? (0, \n                                i.default)(t.negationSymbol.back) + \"?\" : \"\") + \"$)\").exec(e.slice().reverse().join(\"\")), a = n ? n[2] : \"\", r = !1;\n                                return a && (a = a.split(t.radixPoint.charAt(0))[0], r = new RegExp(\"^[0\" + t.groupSeparator + \"]*\").exec(a)), \n                                !(!r || !(r[0].length > 1 || r[0].length > 0 && r[0].length < a.length)) && r;\n                            }(t, a))) for (var c = t.join(\"\").lastIndexOf(l[0].split(\"\").reverse().join(\"\")) - (l[0] == l.input ? 0 : 1), f = l[0] == l.input ? 1 : 0, p = l[0].length - f; p > 0; p--) this.maskset.validPositions.splice(c + p, 1), \n                            delete t[c + p];\n                            if (e) switch (e.type) {\n                              case \"blur\":\n                              case \"checkval\":\n                                if (null !== a.min) {\n                                    var d = a.onUnMask(t.slice().reverse().join(\"\"), void 0, s.extend({}, a, {\n                                        unmaskAsNumber: !0\n                                    }));\n                                    if (null !== a.min && d < a.min) return {\n                                        refreshFromBuffer: !0,\n                                        buffer: u(a.min.toString().replace(\".\", a.radixPoint).split(\"\"), a.digits, a).reverse()\n                                    };\n                                }\n                                if (t[t.length - 1] === a.negationSymbol.front) {\n                                    var h = new RegExp(\"(^\" + (\"\" != a.negationSymbol.front ? (0, i.default)(a.negationSymbol.front) + \"?\" : \"\") + (0, \n                                    i.default)(a.prefix) + \")(.*)(\" + (0, i.default)(a.suffix) + (\"\" != a.negationSymbol.back ? (0, \n                                    i.default)(a.negationSymbol.back) + \"?\" : \"\") + \"$)\").exec(r(t.slice(), !0).reverse().join(\"\"));\n                                    0 == (h ? h[2] : \"\") && (o = {\n                                        refreshFromBuffer: !0,\n                                        buffer: [ 0 ]\n                                    });\n                                } else if (\"\" !== a.radixPoint) {\n                                    t.indexOf(a.radixPoint) === a.suffix.length && (o && o.buffer ? o.buffer.splice(0, 1 + a.suffix.length) : (t.splice(0, 1 + a.suffix.length), \n                                    o = {\n                                        refreshFromBuffer: !0,\n                                        buffer: r(t)\n                                    }));\n                                }\n                                if (a.enforceDigitsOnBlur) {\n                                    var v = (o = o || {}) && o.buffer || t.slice().reverse();\n                                    o.refreshFromBuffer = !0, o.buffer = u(v, a.digits, a, !0).reverse();\n                                }\n                            }\n                            return o;\n                        },\n                        onKeyDown: function(e, t, n, i) {\n                            var a, o = s(this);\n                            if (3 != e.location) {\n                                var l, c = e.key;\n                                if ((l = i.shortcuts && i.shortcuts[c]) && l.length > 1) return this.inputmask.__valueSet.call(this, parseFloat(this.inputmask.unmaskedvalue()) * parseInt(l)), \n                                o.trigger(\"setvalue\"), !1;\n                            }\n                            if (e.ctrlKey) switch (e.key) {\n                              case r.keys.ArrowUp:\n                                return this.inputmask.__valueSet.call(this, parseFloat(this.inputmask.unmaskedvalue()) + parseInt(i.step)), \n                                o.trigger(\"setvalue\"), !1;\n\n                              case r.keys.ArrowDown:\n                                return this.inputmask.__valueSet.call(this, parseFloat(this.inputmask.unmaskedvalue()) - parseInt(i.step)), \n                                o.trigger(\"setvalue\"), !1;\n                            }\n                            if (!e.shiftKey && (e.key === r.keys.Delete || e.key === r.keys.Backspace || e.key === r.keys.BACKSPACE_SAFARI) && n.begin !== t.length) {\n                                if (t[e.key === r.keys.Delete ? n.begin - 1 : n.end] === i.negationSymbol.front) return a = t.slice().reverse(), \n                                \"\" !== i.negationSymbol.front && a.shift(), \"\" !== i.negationSymbol.back && a.pop(), \n                                o.trigger(\"setvalue\", [ a.join(\"\"), n.begin ]), !1;\n                                if (!0 === i._radixDance) {\n                                    var f, p = t.indexOf(i.radixPoint);\n                                    if (i.digitsOptional) {\n                                        if (0 === p) return (a = t.slice().reverse()).pop(), o.trigger(\"setvalue\", [ a.join(\"\"), n.begin >= a.length ? a.length : n.begin ]), \n                                        !1;\n                                    } else if (-1 !== p && (n.begin < p || n.end < p || e.key === r.keys.Delete && (n.begin === p || n.begin - 1 === p))) return n.begin === n.end && (e.key === r.keys.Backspace || e.key === r.keys.BACKSPACE_SAFARI ? n.begin++ : e.key === r.keys.Delete && n.begin - 1 === p && (f = s.extend({}, n), \n                                    n.begin--, n.end--)), (a = t.slice().reverse()).splice(a.length - n.begin, n.begin - n.end + 1), \n                                    a = u(a, i.digits, i).join(\"\"), f && (n = f), o.trigger(\"setvalue\", [ a, n.begin >= a.length ? p + 1 : n.begin ]), \n                                    !1;\n                                }\n                            }\n                        }\n                    },\n                    currency: {\n                        prefix: \"\",\n                        groupSeparator: \",\",\n                        alias: \"numeric\",\n                        digits: 2,\n                        digitsOptional: !1\n                    },\n                    decimal: {\n                        alias: \"numeric\"\n                    },\n                    integer: {\n                        alias: \"numeric\",\n                        inputmode: \"numeric\",\n                        digits: 0\n                    },\n                    percentage: {\n                        alias: \"numeric\",\n                        min: 0,\n                        max: 100,\n                        suffix: \" %\",\n                        digits: 0,\n                        allowMinus: !1\n                    },\n                    indianns: {\n                        alias: \"numeric\",\n                        _mask: function(e) {\n                            return \"(\" + e.groupSeparator + \"99){*|1}(\" + e.groupSeparator + \"999){1|1}\";\n                        },\n                        groupSeparator: \",\",\n                        radixPoint: \".\",\n                        placeholder: \"0\",\n                        digits: 2,\n                        digitsOptional: !1\n                    }\n                });\n            },\n            9380: function(e, t) {\n                Object.defineProperty(t, \"__esModule\", {\n                    value: !0\n                }), t.default = void 0;\n                var n = !(\"undefined\" == typeof window || !window.document || !window.document.createElement);\n                t.default = n ? window : {};\n            },\n            7760: function(e, t, n) {\n                Object.defineProperty(t, \"__esModule\", {\n                    value: !0\n                }), t.HandleNativePlaceholder = function(e, t) {\n                    var n = e ? e.inputmask : this;\n                    if (i.ie) {\n                        if (e.inputmask._valueGet() !== t && (e.placeholder !== t || \"\" === e.placeholder)) {\n                            var a = o.getBuffer.call(n).slice(), r = e.inputmask._valueGet();\n                            if (r !== t) {\n                                var l = o.getLastValidPosition.call(n);\n                                -1 === l && r === o.getBufferTemplate.call(n).join(\"\") ? a = [] : -1 !== l && u.call(n, a), \n                                p(e, a);\n                            }\n                        }\n                    } else e.placeholder !== t && (e.placeholder = t, \"\" === e.placeholder && e.removeAttribute(\"placeholder\"));\n                }, t.applyInputValue = c, t.checkVal = f, t.clearOptionalTail = u, t.unmaskedvalue = function(e) {\n                    var t = e ? e.inputmask : this, n = t.opts, i = t.maskset;\n                    if (e) {\n                        if (void 0 === e.inputmask) return e.value;\n                        e.inputmask && e.inputmask.refreshValue && c(e, e.inputmask._valueGet(!0));\n                    }\n                    for (var a = [], r = i.validPositions, l = 0, s = r.length; l < s; l++) r[l] && r[l].match && (1 != r[l].match.static || Array.isArray(i.metadata) && !0 !== r[l].generatedInput) && a.push(r[l].input);\n                    var u = 0 === a.length ? \"\" : (t.isRTL ? a.reverse() : a).join(\"\");\n                    if (\"function\" == typeof n.onUnMask) {\n                        var f = (t.isRTL ? o.getBuffer.call(t).slice().reverse() : o.getBuffer.call(t)).join(\"\");\n                        u = n.onUnMask.call(t, f, u, n);\n                    }\n                    return u;\n                }, t.writeBuffer = p;\n                var i = n(9845), a = n(6030), r = n(2839), o = n(8711), l = n(7215), s = n(4713);\n                function c(e, t, n) {\n                    var i = e ? e.inputmask : this, a = i.opts;\n                    e.inputmask.refreshValue = !1, \"function\" == typeof a.onBeforeMask && (t = a.onBeforeMask.call(i, t, a) || t), \n                    f(e, !0, !1, t = (t || \"\").toString().split(\"\"), n), i.undoValue = i._valueGet(!0), \n                    (a.clearMaskOnLostFocus || a.clearIncomplete) && e.inputmask._valueGet() === o.getBufferTemplate.call(i).join(\"\") && -1 === o.getLastValidPosition.call(i) && e.inputmask._valueSet(\"\");\n                }\n                function u(e) {\n                    e.length = 0;\n                    for (var t, n = s.getMaskTemplate.call(this, !0, 0, !0, void 0, !0); void 0 !== (t = n.shift()); ) e.push(t);\n                    return e;\n                }\n                function f(e, t, n, i, r) {\n                    var c, u = e ? e.inputmask : this, f = u.maskset, d = u.opts, h = u.dependencyLib, v = i.slice(), m = \"\", g = -1, y = d.skipOptionalPartCharacter;\n                    d.skipOptionalPartCharacter = \"\", o.resetMaskSet.call(u, !1), u.clicked = 0, g = d.radixPoint ? o.determineNewCaretPosition.call(u, {\n                        begin: 0,\n                        end: 0\n                    }, !1, !1 === d.__financeInput ? \"radixFocus\" : void 0).begin : 0, f.p = g, u.caretPos = {\n                        begin: g\n                    };\n                    var k = [], b = u.caretPos;\n                    if (v.forEach((function(e, t) {\n                        if (void 0 !== e) {\n                            var i = new h.Event(\"_checkval\");\n                            i.key = e, m += e;\n                            var r = o.getLastValidPosition.call(u, void 0, !0);\n                            !function(e, t) {\n                                for (var n = s.getMaskTemplate.call(u, !0, 0).slice(e, o.seekNext.call(u, e, !1, !1)).join(\"\").replace(/'/g, \"\"), i = n.indexOf(t); i > 0 && \" \" === n[i - 1]; ) i--;\n                                var a = 0 === i && !o.isMask.call(u, e) && (s.getTest.call(u, e).match.nativeDef === t.charAt(0) || !0 === s.getTest.call(u, e).match.static && s.getTest.call(u, e).match.nativeDef === \"'\" + t.charAt(0) || \" \" === s.getTest.call(u, e).match.nativeDef && (s.getTest.call(u, e + 1).match.nativeDef === t.charAt(0) || !0 === s.getTest.call(u, e + 1).match.static && s.getTest.call(u, e + 1).match.nativeDef === \"'\" + t.charAt(0)));\n                                if (!a && i > 0 && !o.isMask.call(u, e, !1, !0)) {\n                                    var r = o.seekNext.call(u, e);\n                                    u.caretPos.begin < r && (u.caretPos = {\n                                        begin: r\n                                    });\n                                }\n                                return a;\n                            }(g, m) ? (c = a.EventHandlers.keypressEvent.call(u, i, !0, !1, n, u.caretPos.begin)) && (g = u.caretPos.begin + 1, \n                            m = \"\") : c = a.EventHandlers.keypressEvent.call(u, i, !0, !1, n, r + 1), c ? (void 0 !== c.pos && f.validPositions[c.pos] && !0 === f.validPositions[c.pos].match.static && void 0 === f.validPositions[c.pos].alternation && (k.push(c.pos), \n                            u.isRTL || (c.forwardPosition = c.pos + 1)), p.call(u, void 0, o.getBuffer.call(u), c.forwardPosition, i, !1), \n                            u.caretPos = {\n                                begin: c.forwardPosition,\n                                end: c.forwardPosition\n                            }, b = u.caretPos) : void 0 === f.validPositions[t] && v[t] === s.getPlaceholder.call(u, t) && o.isMask.call(u, t, !0) ? u.caretPos.begin++ : u.caretPos = b;\n                        }\n                    })), k.length > 0) {\n                        var x, w, P = o.seekNext.call(u, -1, void 0, !1);\n                        if (!l.isComplete.call(u, o.getBuffer.call(u)) && k.length <= P || l.isComplete.call(u, o.getBuffer.call(u)) && k.length > 0 && k.length !== P && 0 === k[0]) for (var S = P; void 0 !== (x = k.shift()); ) if (x < S) {\n                            var O = new h.Event(\"_checkval\");\n                            if ((w = f.validPositions[x]).generatedInput = !0, O.key = w.input, (c = a.EventHandlers.keypressEvent.call(u, O, !0, !1, n, S)) && void 0 !== c.pos && c.pos !== x && f.validPositions[c.pos] && !0 === f.validPositions[c.pos].match.static) k.push(c.pos); else if (!c) break;\n                            S++;\n                        }\n                    }\n                    t && p.call(u, e, o.getBuffer.call(u), c ? c.forwardPosition : u.caretPos.begin, r || new h.Event(\"checkval\"), r && (\"input\" === r.type && u.undoValue !== o.getBuffer.call(u).join(\"\") || \"paste\" === r.type)), \n                    d.skipOptionalPartCharacter = y;\n                }\n                function p(e, t, n, i, a) {\n                    var s = e ? e.inputmask : this, c = s.opts, u = s.dependencyLib;\n                    if (i && \"function\" == typeof c.onBeforeWrite) {\n                        var f = c.onBeforeWrite.call(s, i, t, n, c);\n                        if (f) {\n                            if (f.refreshFromBuffer) {\n                                var p = f.refreshFromBuffer;\n                                l.refreshFromBuffer.call(s, !0 === p ? p : p.start, p.end, f.buffer || t), t = o.getBuffer.call(s, !0);\n                            }\n                            void 0 !== n && (n = void 0 !== f.caret ? f.caret : n);\n                        }\n                    }\n                    if (void 0 !== e && (e.inputmask._valueSet(t.join(\"\")), void 0 === n || void 0 !== i && \"blur\" === i.type || o.caret.call(s, e, n, void 0, void 0, void 0 !== i && \"keydown\" === i.type && (i.key === r.keys.Delete || i.key === r.keys.Backspace)), \n                    void 0 === e.inputmask.writeBufferHook || e.inputmask.writeBufferHook(n), !0 === a)) {\n                        var d = u(e), h = e.inputmask._valueGet();\n                        e.inputmask.skipInputEvent = !0, d.trigger(\"input\"), setTimeout((function() {\n                            h === o.getBufferTemplate.call(s).join(\"\") ? d.trigger(\"cleared\") : !0 === l.isComplete.call(s, t) && d.trigger(\"complete\");\n                        }), 0);\n                    }\n                }\n            },\n            2394: function(e, t, n) {\n                Object.defineProperty(t, \"__esModule\", {\n                    value: !0\n                }), t.default = void 0;\n                var i = v(n(3976)), a = v(n(7392)), r = v(n(4963)), o = n(9716), l = v(n(9380)), s = n(7760), c = n(157), u = n(2391), f = n(8711), p = n(7215), d = n(4713);\n                function h(e) {\n                    return h = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function(e) {\n                        return typeof e;\n                    } : function(e) {\n                        return e && \"function\" == typeof Symbol && e.constructor === Symbol && e !== Symbol.prototype ? \"symbol\" : typeof e;\n                    }, h(e);\n                }\n                function v(e) {\n                    return e && e.__esModule ? e : {\n                        default: e\n                    };\n                }\n                var m = l.default.document, g = \"_inputmask_opts\";\n                function y(e, t, n) {\n                    if (!(this instanceof y)) return new y(e, t, n);\n                    this.dependencyLib = r.default, this.el = void 0, this.events = {}, this.maskset = void 0, \n                    !0 !== n && (\"[object Object]\" === Object.prototype.toString.call(e) ? t = e : (t = t || {}, \n                    e && (t.alias = e)), this.opts = r.default.extend(!0, {}, this.defaults, t), this.noMasksCache = t && void 0 !== t.definitions, \n                    this.userOptions = t || {}, k(this.opts.alias, t, this.opts)), this.refreshValue = !1, \n                    this.undoValue = void 0, this.$el = void 0, this.skipInputEvent = !1, this.validationEvent = !1, \n                    this.ignorable = !1, this.maxLength, this.mouseEnter = !1, this.clicked = 0, this.originalPlaceholder = void 0, \n                    this.isComposing = !1, this.hasAlternator = !1;\n                }\n                function k(e, t, n) {\n                    var i = y.prototype.aliases[e];\n                    return i ? (i.alias && k(i.alias, void 0, n), r.default.extend(!0, n, i), r.default.extend(!0, n, t), \n                    !0) : (null === n.mask && (n.mask = e), !1);\n                }\n                y.prototype = {\n                    dataAttribute: \"data-inputmask\",\n                    defaults: i.default,\n                    definitions: a.default,\n                    aliases: {},\n                    masksCache: {},\n                    i18n: {},\n                    get isRTL() {\n                        return this.opts.isRTL || this.opts.numericInput;\n                    },\n                    mask: function(e) {\n                        var t = this;\n                        return \"string\" == typeof e && (e = m.getElementById(e) || m.querySelectorAll(e)), \n                        (e = e.nodeName ? [ e ] : Array.isArray(e) ? e : [].slice.call(e)).forEach((function(e, n) {\n                            var i = r.default.extend(!0, {}, t.opts);\n                            if (function(e, t, n, i) {\n                                function a(t, a) {\n                                    var r = \"\" === i ? t : i + \"-\" + t;\n                                    null !== (a = void 0 !== a ? a : e.getAttribute(r)) && (\"string\" == typeof a && (0 === t.indexOf(\"on\") ? a = l.default[a] : \"false\" === a ? a = !1 : \"true\" === a && (a = !0)), \n                                    n[t] = a);\n                                }\n                                if (!0 === t.importDataAttributes) {\n                                    var o, s, c, u, f = e.getAttribute(i);\n                                    if (f && \"\" !== f && (f = f.replace(/'/g, '\"'), s = JSON.parse(\"{\" + f + \"}\")), \n                                    s) for (u in c = void 0, s) if (\"alias\" === u.toLowerCase()) {\n                                        c = s[u];\n                                        break;\n                                    }\n                                    for (o in a(\"alias\", c), n.alias && k(n.alias, n, t), t) {\n                                        if (s) for (u in c = void 0, s) if (u.toLowerCase() === o.toLowerCase()) {\n                                            c = s[u];\n                                            break;\n                                        }\n                                        a(o, c);\n                                    }\n                                }\n                                r.default.extend(!0, t, n), (\"rtl\" === e.dir || t.rightAlign) && (e.style.textAlign = \"right\");\n                                (\"rtl\" === e.dir || t.numericInput) && (e.dir = \"ltr\", e.removeAttribute(\"dir\"), \n                                t.isRTL = !0);\n                                return Object.keys(n).length;\n                            }(e, i, r.default.extend(!0, {}, t.userOptions), t.dataAttribute)) {\n                                var a = (0, u.generateMaskSet)(i, t.noMasksCache);\n                                void 0 !== a && (void 0 !== e.inputmask && (e.inputmask.opts.autoUnmask = !0, e.inputmask.remove()), \n                                e.inputmask = new y(void 0, void 0, !0), e.inputmask.opts = i, e.inputmask.noMasksCache = t.noMasksCache, \n                                e.inputmask.userOptions = r.default.extend(!0, {}, t.userOptions), e.inputmask.el = e, \n                                e.inputmask.$el = (0, r.default)(e), e.inputmask.maskset = a, r.default.data(e, g, t.userOptions), \n                                c.mask.call(e.inputmask));\n                            }\n                        })), e && e[0] && e[0].inputmask || this;\n                    },\n                    option: function(e, t) {\n                        return \"string\" == typeof e ? this.opts[e] : \"object\" === h(e) ? (r.default.extend(this.userOptions, e), \n                        this.el && !0 !== t && this.mask(this.el), this) : void 0;\n                    },\n                    unmaskedvalue: function(e) {\n                        if (this.maskset = this.maskset || (0, u.generateMaskSet)(this.opts, this.noMasksCache), \n                        void 0 === this.el || void 0 !== e) {\n                            var t = (\"function\" == typeof this.opts.onBeforeMask && this.opts.onBeforeMask.call(this, e, this.opts) || e).split(\"\");\n                            s.checkVal.call(this, void 0, !1, !1, t), \"function\" == typeof this.opts.onBeforeWrite && this.opts.onBeforeWrite.call(this, void 0, f.getBuffer.call(this), 0, this.opts);\n                        }\n                        return s.unmaskedvalue.call(this, this.el);\n                    },\n                    remove: function() {\n                        if (this.el) {\n                            r.default.data(this.el, g, null);\n                            var e = this.opts.autoUnmask ? (0, s.unmaskedvalue)(this.el) : this._valueGet(this.opts.autoUnmask);\n                            e !== f.getBufferTemplate.call(this).join(\"\") ? this._valueSet(e, this.opts.autoUnmask) : this._valueSet(\"\"), \n                            o.EventRuler.off(this.el), Object.getOwnPropertyDescriptor && Object.getPrototypeOf ? Object.getOwnPropertyDescriptor(Object.getPrototypeOf(this.el), \"value\") && this.__valueGet && Object.defineProperty(this.el, \"value\", {\n                                get: this.__valueGet,\n                                set: this.__valueSet,\n                                configurable: !0\n                            }) : m.__lookupGetter__ && this.el.__lookupGetter__(\"value\") && this.__valueGet && (this.el.__defineGetter__(\"value\", this.__valueGet), \n                            this.el.__defineSetter__(\"value\", this.__valueSet)), this.el.inputmask = void 0;\n                        }\n                        return this.el;\n                    },\n                    getemptymask: function() {\n                        return this.maskset = this.maskset || (0, u.generateMaskSet)(this.opts, this.noMasksCache), \n                        (this.isRTL ? f.getBufferTemplate.call(this).reverse() : f.getBufferTemplate.call(this)).join(\"\");\n                    },\n                    hasMaskedValue: function() {\n                        return !this.opts.autoUnmask;\n                    },\n                    isComplete: function() {\n                        return this.maskset = this.maskset || (0, u.generateMaskSet)(this.opts, this.noMasksCache), \n                        p.isComplete.call(this, f.getBuffer.call(this));\n                    },\n                    getmetadata: function() {\n                        if (this.maskset = this.maskset || (0, u.generateMaskSet)(this.opts, this.noMasksCache), \n                        Array.isArray(this.maskset.metadata)) {\n                            var e = d.getMaskTemplate.call(this, !0, 0, !1).join(\"\");\n                            return this.maskset.metadata.forEach((function(t) {\n                                return t.mask !== e || (e = t, !1);\n                            })), e;\n                        }\n                        return this.maskset.metadata;\n                    },\n                    isValid: function(e) {\n                        if (this.maskset = this.maskset || (0, u.generateMaskSet)(this.opts, this.noMasksCache), \n                        e) {\n                            var t = (\"function\" == typeof this.opts.onBeforeMask && this.opts.onBeforeMask.call(this, e, this.opts) || e).split(\"\");\n                            s.checkVal.call(this, void 0, !0, !1, t);\n                        } else e = this.isRTL ? f.getBuffer.call(this).slice().reverse().join(\"\") : f.getBuffer.call(this).join(\"\");\n                        for (var n = f.getBuffer.call(this), i = f.determineLastRequiredPosition.call(this), a = n.length - 1; a > i && !f.isMask.call(this, a); a--) ;\n                        return n.splice(i, a + 1 - i), p.isComplete.call(this, n) && e === (this.isRTL ? f.getBuffer.call(this).slice().reverse().join(\"\") : f.getBuffer.call(this).join(\"\"));\n                    },\n                    format: function(e, t) {\n                        this.maskset = this.maskset || (0, u.generateMaskSet)(this.opts, this.noMasksCache);\n                        var n = (\"function\" == typeof this.opts.onBeforeMask && this.opts.onBeforeMask.call(this, e, this.opts) || e).split(\"\");\n                        s.checkVal.call(this, void 0, !0, !1, n);\n                        var i = this.isRTL ? f.getBuffer.call(this).slice().reverse().join(\"\") : f.getBuffer.call(this).join(\"\");\n                        return t ? {\n                            value: i,\n                            metadata: this.getmetadata()\n                        } : i;\n                    },\n                    setValue: function(e) {\n                        this.el && (0, r.default)(this.el).trigger(\"setvalue\", [ e ]);\n                    },\n                    analyseMask: u.analyseMask\n                }, y.extendDefaults = function(e) {\n                    r.default.extend(!0, y.prototype.defaults, e);\n                }, y.extendDefinitions = function(e) {\n                    r.default.extend(!0, y.prototype.definitions, e);\n                }, y.extendAliases = function(e) {\n                    r.default.extend(!0, y.prototype.aliases, e);\n                }, y.format = function(e, t, n) {\n                    return y(t).format(e, n);\n                }, y.unmask = function(e, t) {\n                    return y(t).unmaskedvalue(e);\n                }, y.isValid = function(e, t) {\n                    return y(t).isValid(e);\n                }, y.remove = function(e) {\n                    \"string\" == typeof e && (e = m.getElementById(e) || m.querySelectorAll(e)), (e = e.nodeName ? [ e ] : e).forEach((function(e) {\n                        e.inputmask && e.inputmask.remove();\n                    }));\n                }, y.setValue = function(e, t) {\n                    \"string\" == typeof e && (e = m.getElementById(e) || m.querySelectorAll(e)), (e = e.nodeName ? [ e ] : e).forEach((function(e) {\n                        e.inputmask ? e.inputmask.setValue(t) : (0, r.default)(e).trigger(\"setvalue\", [ t ]);\n                    }));\n                }, y.dependencyLib = r.default, l.default.Inputmask = y;\n                t.default = y;\n            },\n            5296: function(e, t, n) {\n                function i(e) {\n                    return i = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function(e) {\n                        return typeof e;\n                    } : function(e) {\n                        return e && \"function\" == typeof Symbol && e.constructor === Symbol && e !== Symbol.prototype ? \"symbol\" : typeof e;\n                    }, i(e);\n                }\n                var a = d(n(9380)), r = d(n(2394));\n                function o(e, t) {\n                    for (var n = 0; n < t.length; n++) {\n                        var a = t[n];\n                        a.enumerable = a.enumerable || !1, a.configurable = !0, \"value\" in a && (a.writable = !0), \n                        Object.defineProperty(e, (r = a.key, o = void 0, o = function(e, t) {\n                            if (\"object\" !== i(e) || null === e) return e;\n                            var n = e[Symbol.toPrimitive];\n                            if (void 0 !== n) {\n                                var a = n.call(e, t || \"default\");\n                                if (\"object\" !== i(a)) return a;\n                                throw new TypeError(\"@@toPrimitive must return a primitive value.\");\n                            }\n                            return (\"string\" === t ? String : Number)(e);\n                        }(r, \"string\"), \"symbol\" === i(o) ? o : String(o)), a);\n                    }\n                    var r, o;\n                }\n                function l(e) {\n                    var t = u();\n                    return function() {\n                        var n, a = p(e);\n                        if (t) {\n                            var r = p(this).constructor;\n                            n = Reflect.construct(a, arguments, r);\n                        } else n = a.apply(this, arguments);\n                        return function(e, t) {\n                            if (t && (\"object\" === i(t) || \"function\" == typeof t)) return t;\n                            if (void 0 !== t) throw new TypeError(\"Derived constructors may only return object or undefined\");\n                            return function(e) {\n                                if (void 0 === e) throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");\n                                return e;\n                            }(e);\n                        }(this, n);\n                    };\n                }\n                function s(e) {\n                    var t = \"function\" == typeof Map ? new Map : void 0;\n                    return s = function(e) {\n                        if (null === e || !function(e) {\n                            try {\n                                return -1 !== Function.toString.call(e).indexOf(\"[native code]\");\n                            } catch (t) {\n                                return \"function\" == typeof e;\n                            }\n                        }(e)) return e;\n                        if (\"function\" != typeof e) throw new TypeError(\"Super expression must either be null or a function\");\n                        if (void 0 !== t) {\n                            if (t.has(e)) return t.get(e);\n                            t.set(e, n);\n                        }\n                        function n() {\n                            return c(e, arguments, p(this).constructor);\n                        }\n                        return n.prototype = Object.create(e.prototype, {\n                            constructor: {\n                                value: n,\n                                enumerable: !1,\n                                writable: !0,\n                                configurable: !0\n                            }\n                        }), f(n, e);\n                    }, s(e);\n                }\n                function c(e, t, n) {\n                    return c = u() ? Reflect.construct.bind() : function(e, t, n) {\n                        var i = [ null ];\n                        i.push.apply(i, t);\n                        var a = new (Function.bind.apply(e, i));\n                        return n && f(a, n.prototype), a;\n                    }, c.apply(null, arguments);\n                }\n                function u() {\n                    if (\"undefined\" == typeof Reflect || !Reflect.construct) return !1;\n                    if (Reflect.construct.sham) return !1;\n                    if (\"function\" == typeof Proxy) return !0;\n                    try {\n                        return Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], (function() {}))), \n                        !0;\n                    } catch (e) {\n                        return !1;\n                    }\n                }\n                function f(e, t) {\n                    return f = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function(e, t) {\n                        return e.__proto__ = t, e;\n                    }, f(e, t);\n                }\n                function p(e) {\n                    return p = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function(e) {\n                        return e.__proto__ || Object.getPrototypeOf(e);\n                    }, p(e);\n                }\n                function d(e) {\n                    return e && e.__esModule ? e : {\n                        default: e\n                    };\n                }\n                var h = a.default.document;\n                if (h && h.head && h.head.attachShadow && a.default.customElements && void 0 === a.default.customElements.get(\"input-mask\")) {\n                    var v = function(e) {\n                        !function(e, t) {\n                            if (\"function\" != typeof t && null !== t) throw new TypeError(\"Super expression must either be null or a function\");\n                            e.prototype = Object.create(t && t.prototype, {\n                                constructor: {\n                                    value: e,\n                                    writable: !0,\n                                    configurable: !0\n                                }\n                            }), Object.defineProperty(e, \"prototype\", {\n                                writable: !1\n                            }), t && f(e, t);\n                        }(s, e);\n                        var t, n, i, a = l(s);\n                        function s() {\n                            var e;\n                            !function(e, t) {\n                                if (!(e instanceof t)) throw new TypeError(\"Cannot call a class as a function\");\n                            }(this, s);\n                            var t = (e = a.call(this)).getAttributeNames(), n = e.attachShadow({\n                                mode: \"closed\"\n                            });\n                            for (var i in e.input = h.createElement(\"input\"), e.input.type = \"text\", n.appendChild(e.input), \n                            t) Object.prototype.hasOwnProperty.call(t, i) && e.input.setAttribute(t[i], e.getAttribute(t[i]));\n                            var o = new r.default;\n                            return o.dataAttribute = \"\", o.mask(e.input), e.input.inputmask.shadowRoot = n, \n                            e;\n                        }\n                        return t = s, (n = [ {\n                            key: \"attributeChangedCallback\",\n                            value: function(e, t, n) {\n                                this.input.setAttribute(e, n);\n                            }\n                        }, {\n                            key: \"value\",\n                            get: function() {\n                                return this.input.value;\n                            },\n                            set: function(e) {\n                                this.input.value = e;\n                            }\n                        } ]) && o(t.prototype, n), i && o(t, i), Object.defineProperty(t, \"prototype\", {\n                            writable: !1\n                        }), s;\n                    }(s(HTMLElement));\n                    a.default.customElements.define(\"input-mask\", v);\n                }\n            },\n            2839: function(e, t) {\n                function n(e) {\n                    return n = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function(e) {\n                        return typeof e;\n                    } : function(e) {\n                        return e && \"function\" == typeof Symbol && e.constructor === Symbol && e !== Symbol.prototype ? \"symbol\" : typeof e;\n                    }, n(e);\n                }\n                function i(e, t) {\n                    return function(e) {\n                        if (Array.isArray(e)) return e;\n                    }(e) || function(e, t) {\n                        var n = null == e ? null : \"undefined\" != typeof Symbol && e[Symbol.iterator] || e[\"@@iterator\"];\n                        if (null != n) {\n                            var i, a, r, o, l = [], s = !0, c = !1;\n                            try {\n                                if (r = (n = n.call(e)).next, 0 === t) {\n                                    if (Object(n) !== n) return;\n                                    s = !1;\n                                } else for (;!(s = (i = r.call(n)).done) && (l.push(i.value), l.length !== t); s = !0) ;\n                            } catch (e) {\n                                c = !0, a = e;\n                            } finally {\n                                try {\n                                    if (!s && null != n.return && (o = n.return(), Object(o) !== o)) return;\n                                } finally {\n                                    if (c) throw a;\n                                }\n                            }\n                            return l;\n                        }\n                    }(e, t) || function(e, t) {\n                        if (!e) return;\n                        if (\"string\" == typeof e) return a(e, t);\n                        var n = Object.prototype.toString.call(e).slice(8, -1);\n                        \"Object\" === n && e.constructor && (n = e.constructor.name);\n                        if (\"Map\" === n || \"Set\" === n) return Array.from(e);\n                        if (\"Arguments\" === n || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return a(e, t);\n                    }(e, t) || function() {\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                    }();\n                }\n                function a(e, t) {\n                    (null == t || t > e.length) && (t = e.length);\n                    for (var n = 0, i = new Array(t); n < t; n++) i[n] = e[n];\n                    return i;\n                }\n                function r(e, t) {\n                    var n = Object.keys(e);\n                    if (Object.getOwnPropertySymbols) {\n                        var i = Object.getOwnPropertySymbols(e);\n                        t && (i = i.filter((function(t) {\n                            return Object.getOwnPropertyDescriptor(e, t).enumerable;\n                        }))), n.push.apply(n, i);\n                    }\n                    return n;\n                }\n                function o(e, t, i) {\n                    return (t = function(e) {\n                        var t = function(e, t) {\n                            if (\"object\" !== n(e) || null === e) return e;\n                            var i = e[Symbol.toPrimitive];\n                            if (void 0 !== i) {\n                                var a = i.call(e, t || \"default\");\n                                if (\"object\" !== n(a)) return a;\n                                throw new TypeError(\"@@toPrimitive must return a primitive value.\");\n                            }\n                            return (\"string\" === t ? String : Number)(e);\n                        }(e, \"string\");\n                        return \"symbol\" === n(t) ? t : String(t);\n                    }(t)) in e ? Object.defineProperty(e, t, {\n                        value: i,\n                        enumerable: !0,\n                        configurable: !0,\n                        writable: !0\n                    }) : e[t] = i, e;\n                }\n                Object.defineProperty(t, \"__esModule\", {\n                    value: !0\n                }), t.keys = t.keyCode = void 0, t.toKey = function(e, t) {\n                    return s[e] || (t ? String.fromCharCode(e) : String.fromCharCode(e).toLowerCase());\n                }, t.toKeyCode = function(e) {\n                    return l[e];\n                };\n                var l = t.keyCode = function(e) {\n                    for (var t = 1; t < arguments.length; t++) {\n                        var n = null != arguments[t] ? arguments[t] : {};\n                        t % 2 ? r(Object(n), !0).forEach((function(t) {\n                            o(e, t, n[t]);\n                        })) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(n)) : r(Object(n)).forEach((function(t) {\n                            Object.defineProperty(e, t, Object.getOwnPropertyDescriptor(n, t));\n                        }));\n                    }\n                    return e;\n                }({\n                    c: 67,\n                    x: 88,\n                    z: 90,\n                    BACKSPACE_SAFARI: 127,\n                    Enter: 13,\n                    Meta_LEFT: 91,\n                    Meta_RIGHT: 92,\n                    Space: 32\n                }, {\n                    Alt: 18,\n                    AltGraph: 18,\n                    ArrowDown: 40,\n                    ArrowLeft: 37,\n                    ArrowRight: 39,\n                    ArrowUp: 38,\n                    Backspace: 8,\n                    CapsLock: 20,\n                    Control: 17,\n                    ContextMenu: 93,\n                    Dead: 221,\n                    Delete: 46,\n                    End: 35,\n                    Escape: 27,\n                    F1: 112,\n                    F2: 113,\n                    F3: 114,\n                    F4: 115,\n                    F5: 116,\n                    F6: 117,\n                    F7: 118,\n                    F8: 119,\n                    F9: 120,\n                    F10: 121,\n                    F11: 122,\n                    F12: 123,\n                    Home: 36,\n                    Insert: 45,\n                    NumLock: 144,\n                    PageDown: 34,\n                    PageUp: 33,\n                    Pause: 19,\n                    PrintScreen: 44,\n                    Process: 229,\n                    Shift: 16,\n                    ScrollLock: 145,\n                    Tab: 9,\n                    Unidentified: 229\n                }), s = Object.entries(l).reduce((function(e, t) {\n                    var n = i(t, 2), a = n[0], r = n[1];\n                    return e[r] = void 0 === e[r] ? a : e[r], e;\n                }), {});\n                t.keys = Object.entries(l).reduce((function(e, t) {\n                    var n = i(t, 2), a = n[0];\n                    n[1];\n                    return e[a] = \"Space\" === a ? \" \" : a, e;\n                }), {});\n            },\n            2391: function(e, t, n) {\n                Object.defineProperty(t, \"__esModule\", {\n                    value: !0\n                }), t.analyseMask = function(e, t, n) {\n                    var i, a, s, c, u, f, p = /(?:[?*+]|\\{[0-9+*]+(?:,[0-9+*]*)?(?:\\|[0-9+*]*)?\\})|[^.?*+^${[]()|\\\\]+|./g, d = /\\[\\^?]?(?:[^\\\\\\]]+|\\\\[\\S\\s]?)*]?|\\\\(?:0(?:[0-3][0-7]{0,2}|[4-7][0-7]?)?|[1-9][0-9]*|x[0-9A-Fa-f]{2}|u[0-9A-Fa-f]{4}|c[A-Za-z]|[\\S\\s]?)|\\((?:\\?[:=!]?)?|(?:[?*+]|\\{[0-9]+(?:,[0-9]*)?\\})\\??|[^.?*+^${[()|\\\\]+|./g, h = !1, v = new o.default, m = [], g = [], y = !1;\n                    function k(e, i, a) {\n                        a = void 0 !== a ? a : e.matches.length;\n                        var o = e.matches[a - 1];\n                        if (t) {\n                            if (0 === i.indexOf(\"[\") || h && /\\\\d|\\\\s|\\\\w|\\\\p/i.test(i) || \".\" === i) {\n                                var s = n.casing ? \"i\" : \"\";\n                                /\\\\p\\{.*}/i.test(i) && (s += \"u\"), e.matches.splice(a++, 0, {\n                                    fn: new RegExp(i, s),\n                                    static: !1,\n                                    optionality: !1,\n                                    newBlockMarker: void 0 === o ? \"master\" : o.def !== i,\n                                    casing: null,\n                                    def: i,\n                                    placeholder: \"object\" === l(n.placeholder) ? n.placeholder[v.matches.length] : void 0,\n                                    nativeDef: i\n                                });\n                            } else h && (i = i[i.length - 1]), i.split(\"\").forEach((function(t, i) {\n                                o = e.matches[a - 1], e.matches.splice(a++, 0, {\n                                    fn: /[a-z]/i.test(n.staticDefinitionSymbol || t) ? new RegExp(\"[\" + (n.staticDefinitionSymbol || t) + \"]\", n.casing ? \"i\" : \"\") : null,\n                                    static: !0,\n                                    optionality: !1,\n                                    newBlockMarker: void 0 === o ? \"master\" : o.def !== t && !0 !== o.static,\n                                    casing: null,\n                                    def: n.staticDefinitionSymbol || t,\n                                    placeholder: void 0 !== n.staticDefinitionSymbol ? t : \"object\" === l(n.placeholder) ? n.placeholder[v.matches.length] : void 0,\n                                    nativeDef: (h ? \"'\" : \"\") + t\n                                });\n                            }));\n                            h = !1;\n                        } else {\n                            var c = n.definitions && n.definitions[i] || n.usePrototypeDefinitions && r.default.prototype.definitions[i];\n                            c && !h ? e.matches.splice(a++, 0, {\n                                fn: c.validator ? \"string\" == typeof c.validator ? new RegExp(c.validator, n.casing ? \"i\" : \"\") : new function() {\n                                    this.test = c.validator;\n                                } : /./,\n                                static: c.static || !1,\n                                optionality: c.optional || !1,\n                                defOptionality: c.optional || !1,\n                                newBlockMarker: void 0 === o || c.optional ? \"master\" : o.def !== (c.definitionSymbol || i),\n                                casing: c.casing,\n                                def: c.definitionSymbol || i,\n                                placeholder: c.placeholder,\n                                nativeDef: i,\n                                generated: c.generated\n                            }) : (e.matches.splice(a++, 0, {\n                                fn: /[a-z]/i.test(n.staticDefinitionSymbol || i) ? new RegExp(\"[\" + (n.staticDefinitionSymbol || i) + \"]\", n.casing ? \"i\" : \"\") : null,\n                                static: !0,\n                                optionality: !1,\n                                newBlockMarker: void 0 === o ? \"master\" : o.def !== i && !0 !== o.static,\n                                casing: null,\n                                def: n.staticDefinitionSymbol || i,\n                                placeholder: void 0 !== n.staticDefinitionSymbol ? i : void 0,\n                                nativeDef: (h ? \"'\" : \"\") + i\n                            }), h = !1);\n                        }\n                    }\n                    function b() {\n                        if (m.length > 0) {\n                            if (k(c = m[m.length - 1], a), c.isAlternator) {\n                                u = m.pop();\n                                for (var e = 0; e < u.matches.length; e++) u.matches[e].isGroup && (u.matches[e].isGroup = !1);\n                                m.length > 0 ? (c = m[m.length - 1]).matches.push(u) : v.matches.push(u);\n                            }\n                        } else k(v, a);\n                    }\n                    function x(e) {\n                        var t = new o.default(!0);\n                        return t.openGroup = !1, t.matches = e, t;\n                    }\n                    function w() {\n                        if ((s = m.pop()).openGroup = !1, void 0 !== s) if (m.length > 0) {\n                            if ((c = m[m.length - 1]).matches.push(s), c.isAlternator) {\n                                u = m.pop();\n                                for (var e = 0; e < u.matches.length; e++) u.matches[e].isGroup = !1, u.matches[e].alternatorGroup = !1;\n                                m.length > 0 ? (c = m[m.length - 1]).matches.push(u) : v.matches.push(u);\n                            }\n                        } else v.matches.push(s); else b();\n                    }\n                    function P(e) {\n                        var t = e.pop();\n                        return t.isQuantifier && (t = x([ e.pop(), t ])), t;\n                    }\n                    t && (n.optionalmarker[0] = void 0, n.optionalmarker[1] = void 0);\n                    for (;i = t ? d.exec(e) : p.exec(e); ) {\n                        if (a = i[0], t) {\n                            switch (a.charAt(0)) {\n                              case \"?\":\n                                a = \"{0,1}\";\n                                break;\n\n                              case \"+\":\n                              case \"*\":\n                                a = \"{\" + a + \"}\";\n                                break;\n\n                              case \"|\":\n                                if (0 === m.length) {\n                                    var S = x(v.matches);\n                                    S.openGroup = !0, m.push(S), v.matches = [], y = !0;\n                                }\n                            }\n                            switch (a) {\n                              case \"\\\\d\":\n                                a = \"[0-9]\";\n                                break;\n\n                              case \"\\\\p\":\n                                a += d.exec(e)[0], a += d.exec(e)[0];\n                            }\n                        }\n                        if (h) b(); else switch (a.charAt(0)) {\n                          case \"$\":\n                          case \"^\":\n                            t || b();\n                            break;\n\n                          case n.escapeChar:\n                            h = !0, t && b();\n                            break;\n\n                          case n.optionalmarker[1]:\n                          case n.groupmarker[1]:\n                            w();\n                            break;\n\n                          case n.optionalmarker[0]:\n                            m.push(new o.default(!1, !0));\n                            break;\n\n                          case n.groupmarker[0]:\n                            m.push(new o.default(!0));\n                            break;\n\n                          case n.quantifiermarker[0]:\n                            var O = new o.default(!1, !1, !0), _ = (a = a.replace(/[{}?]/g, \"\")).split(\"|\"), M = _[0].split(\",\"), E = isNaN(M[0]) ? M[0] : parseInt(M[0]), j = 1 === M.length ? E : isNaN(M[1]) ? M[1] : parseInt(M[1]), T = isNaN(_[1]) ? _[1] : parseInt(_[1]);\n                            \"*\" !== E && \"+\" !== E || (E = \"*\" === j ? 0 : 1), O.quantifier = {\n                                min: E,\n                                max: j,\n                                jit: T\n                            };\n                            var A = m.length > 0 ? m[m.length - 1].matches : v.matches;\n                            (i = A.pop()).isGroup || (i = x([ i ])), A.push(i), A.push(O);\n                            break;\n\n                          case n.alternatormarker:\n                            if (m.length > 0) {\n                                var D = (c = m[m.length - 1]).matches[c.matches.length - 1];\n                                f = c.openGroup && (void 0 === D.matches || !1 === D.isGroup && !1 === D.isAlternator) ? m.pop() : P(c.matches);\n                            } else f = P(v.matches);\n                            if (f.isAlternator) m.push(f); else if (f.alternatorGroup ? (u = m.pop(), f.alternatorGroup = !1) : u = new o.default(!1, !1, !1, !0), \n                            u.matches.push(f), m.push(u), f.openGroup) {\n                                f.openGroup = !1;\n                                var L = new o.default(!0);\n                                L.alternatorGroup = !0, m.push(L);\n                            }\n                            break;\n\n                          default:\n                            b();\n                        }\n                    }\n                    y && w();\n                    for (;m.length > 0; ) s = m.pop(), v.matches.push(s);\n                    v.matches.length > 0 && (!function e(i) {\n                        i && i.matches && i.matches.forEach((function(a, r) {\n                            var o = i.matches[r + 1];\n                            (void 0 === o || void 0 === o.matches || !1 === o.isQuantifier) && a && a.isGroup && (a.isGroup = !1, \n                            t || (k(a, n.groupmarker[0], 0), !0 !== a.openGroup && k(a, n.groupmarker[1]))), \n                            e(a);\n                        }));\n                    }(v), g.push(v));\n                    (n.numericInput || n.isRTL) && function e(t) {\n                        for (var i in t.matches = t.matches.reverse(), t.matches) if (Object.prototype.hasOwnProperty.call(t.matches, i)) {\n                            var a = parseInt(i);\n                            if (t.matches[i].isQuantifier && t.matches[a + 1] && t.matches[a + 1].isGroup) {\n                                var r = t.matches[i];\n                                t.matches.splice(i, 1), t.matches.splice(a + 1, 0, r);\n                            }\n                            void 0 !== t.matches[i].matches ? t.matches[i] = e(t.matches[i]) : t.matches[i] = ((o = t.matches[i]) === n.optionalmarker[0] ? o = n.optionalmarker[1] : o === n.optionalmarker[1] ? o = n.optionalmarker[0] : o === n.groupmarker[0] ? o = n.groupmarker[1] : o === n.groupmarker[1] && (o = n.groupmarker[0]), \n                            o);\n                        }\n                        var o;\n                        return t;\n                    }(g[0]);\n                    return g;\n                }, t.generateMaskSet = function(e, t) {\n                    var n;\n                    function o(e, t) {\n                        var n = t.repeat, i = t.groupmarker, r = t.quantifiermarker, o = t.keepStatic;\n                        if (n > 0 || \"*\" === n || \"+\" === n) {\n                            var l = \"*\" === n ? 0 : \"+\" === n ? 1 : n;\n                            if (l != n) e = i[0] + e + i[1] + r[0] + l + \",\" + n + r[1]; else for (var c = e, u = 1; u < l; u++) e += c;\n                        }\n                        if (!0 === o) {\n                            var f = e.match(new RegExp(\"(.)\\\\[([^\\\\]]*)\\\\]\", \"g\"));\n                            f && f.forEach((function(t, n) {\n                                var i = function(e, t) {\n                                    return function(e) {\n                                        if (Array.isArray(e)) return e;\n                                    }(e) || function(e, t) {\n                                        var n = null == e ? null : \"undefined\" != typeof Symbol && e[Symbol.iterator] || e[\"@@iterator\"];\n                                        if (null != n) {\n                                            var i, a, r, o, l = [], s = !0, c = !1;\n                                            try {\n                                                if (r = (n = n.call(e)).next, 0 === t) {\n                                                    if (Object(n) !== n) return;\n                                                    s = !1;\n                                                } else for (;!(s = (i = r.call(n)).done) && (l.push(i.value), l.length !== t); s = !0) ;\n                                            } catch (e) {\n                                                c = !0, a = e;\n                                            } finally {\n                                                try {\n                                                    if (!s && null != n.return && (o = n.return(), Object(o) !== o)) return;\n                                                } finally {\n                                                    if (c) throw a;\n                                                }\n                                            }\n                                            return l;\n                                        }\n                                    }(e, t) || function(e, t) {\n                                        if (!e) return;\n                                        if (\"string\" == typeof e) return s(e, t);\n                                        var n = Object.prototype.toString.call(e).slice(8, -1);\n                                        \"Object\" === n && e.constructor && (n = e.constructor.name);\n                                        if (\"Map\" === n || \"Set\" === n) return Array.from(e);\n                                        if (\"Arguments\" === n || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return s(e, t);\n                                    }(e, t) || function() {\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                                    }();\n                                }(t.split(\"[\"), 2), r = i[0], o = i[1];\n                                o = o.replace(\"]\", \"\"), e = e.replace(new RegExp(\"\".concat((0, a.default)(r), \"\\\\[\").concat((0, \n                                a.default)(o), \"\\\\]\")), r.charAt(0) === o.charAt(0) ? \"(\".concat(r, \"|\").concat(r).concat(o, \")\") : \"\".concat(r, \"[\").concat(o, \"]\"));\n                            }));\n                        }\n                        return e;\n                    }\n                    function c(e, n, a) {\n                        var s, c, u = !1;\n                        return null !== e && \"\" !== e || ((u = null !== a.regex) ? e = (e = a.regex).replace(/^(\\^)(.*)(\\$)$/, \"$2\") : (u = !0, \n                        e = \".*\")), 1 === e.length && !1 === a.greedy && 0 !== a.repeat && (a.placeholder = \"\"), \n                        e = o(e, a), c = u ? \"regex_\" + a.regex : a.numericInput ? e.split(\"\").reverse().join(\"\") : e, \n                        null !== a.keepStatic && (c = \"ks_\" + a.keepStatic + c), \"object\" === l(a.placeholder) && (c = \"ph_\" + JSON.stringify(a.placeholder) + c), \n                        void 0 === r.default.prototype.masksCache[c] || !0 === t ? (s = {\n                            mask: e,\n                            maskToken: r.default.prototype.analyseMask(e, u, a),\n                            validPositions: [],\n                            _buffer: void 0,\n                            buffer: void 0,\n                            tests: {},\n                            excludes: {},\n                            metadata: n,\n                            maskLength: void 0,\n                            jitOffset: {}\n                        }, !0 !== t && (r.default.prototype.masksCache[c] = s, s = i.default.extend(!0, {}, r.default.prototype.masksCache[c]))) : s = i.default.extend(!0, {}, r.default.prototype.masksCache[c]), \n                        s;\n                    }\n                    \"function\" == typeof e.mask && (e.mask = e.mask(e));\n                    if (Array.isArray(e.mask)) {\n                        if (e.mask.length > 1) {\n                            null === e.keepStatic && (e.keepStatic = !0);\n                            var u = e.groupmarker[0];\n                            return (e.isRTL ? e.mask.reverse() : e.mask).forEach((function(t) {\n                                u.length > 1 && (u += e.alternatormarker), void 0 !== t.mask && \"function\" != typeof t.mask ? u += t.mask : u += t;\n                            })), c(u += e.groupmarker[1], e.mask, e);\n                        }\n                        e.mask = e.mask.pop();\n                    }\n                    n = e.mask && void 0 !== e.mask.mask && \"function\" != typeof e.mask.mask ? c(e.mask.mask, e.mask, e) : c(e.mask, e.mask, e);\n                    null === e.keepStatic && (e.keepStatic = !1);\n                    return n;\n                };\n                var i = c(n(4963)), a = c(n(7184)), r = c(n(2394)), o = c(n(9695));\n                function l(e) {\n                    return l = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function(e) {\n                        return typeof e;\n                    } : function(e) {\n                        return e && \"function\" == typeof Symbol && e.constructor === Symbol && e !== Symbol.prototype ? \"symbol\" : typeof e;\n                    }, l(e);\n                }\n                function s(e, t) {\n                    (null == t || t > e.length) && (t = e.length);\n                    for (var n = 0, i = new Array(t); n < t; n++) i[n] = e[n];\n                    return i;\n                }\n                function c(e) {\n                    return e && e.__esModule ? e : {\n                        default: e\n                    };\n                }\n            },\n            157: function(e, t, n) {\n                Object.defineProperty(t, \"__esModule\", {\n                    value: !0\n                }), t.mask = function() {\n                    var e = this, t = this.opts, n = this.el, c = this.dependencyLib;\n                    r.EventRuler.off(n);\n                    var u = function(t, n) {\n                        var i = t.getAttribute(\"type\"), a = \"input\" === t.tagName.toLowerCase() && n.supportsInputType.includes(i) || t.isContentEditable || \"textarea\" === t.tagName.toLowerCase();\n                        if (!a) if (\"input\" === t.tagName.toLowerCase()) {\n                            var s = document.createElement(\"input\");\n                            s.setAttribute(\"type\", i), a = \"text\" === s.type, s = null;\n                        } else a = \"partial\";\n                        return !1 !== a ? function(t) {\n                            var i, a;\n                            function s() {\n                                return this.inputmask ? this.inputmask.opts.autoUnmask ? this.inputmask.unmaskedvalue() : -1 !== l.getLastValidPosition.call(e) || !0 !== n.nullable ? (this.inputmask.shadowRoot || this.ownerDocument).activeElement === this && n.clearMaskOnLostFocus ? (e.isRTL ? o.clearOptionalTail.call(e, l.getBuffer.call(e).slice()).reverse() : o.clearOptionalTail.call(e, l.getBuffer.call(e).slice())).join(\"\") : i.call(this) : \"\" : i.call(this);\n                            }\n                            function u(e) {\n                                a.call(this, e), this.inputmask && (0, o.applyInputValue)(this, e);\n                            }\n                            if (!t.inputmask.__valueGet) {\n                                if (!0 !== n.noValuePatching) {\n                                    if (Object.getOwnPropertyDescriptor) {\n                                        var f = Object.getPrototypeOf ? Object.getOwnPropertyDescriptor(Object.getPrototypeOf(t), \"value\") : void 0;\n                                        f && f.get && f.set ? (i = f.get, a = f.set, Object.defineProperty(t, \"value\", {\n                                            get: s,\n                                            set: u,\n                                            configurable: !0\n                                        })) : \"input\" !== t.tagName.toLowerCase() && (i = function() {\n                                            return this.textContent;\n                                        }, a = function(e) {\n                                            this.textContent = e;\n                                        }, Object.defineProperty(t, \"value\", {\n                                            get: s,\n                                            set: u,\n                                            configurable: !0\n                                        }));\n                                    } else document.__lookupGetter__ && t.__lookupGetter__(\"value\") && (i = t.__lookupGetter__(\"value\"), \n                                    a = t.__lookupSetter__(\"value\"), t.__defineGetter__(\"value\", s), t.__defineSetter__(\"value\", u));\n                                    t.inputmask.__valueGet = i, t.inputmask.__valueSet = a;\n                                }\n                                t.inputmask._valueGet = function(t) {\n                                    return e.isRTL && !0 !== t ? i.call(this.el).split(\"\").reverse().join(\"\") : i.call(this.el);\n                                }, t.inputmask._valueSet = function(t, n) {\n                                    a.call(this.el, null == t ? \"\" : !0 !== n && e.isRTL ? t.split(\"\").reverse().join(\"\") : t);\n                                }, void 0 === i && (i = function() {\n                                    return this.value;\n                                }, a = function(e) {\n                                    this.value = e;\n                                }, function(t) {\n                                    if (c.valHooks && (void 0 === c.valHooks[t] || !0 !== c.valHooks[t].inputmaskpatch)) {\n                                        var i = c.valHooks[t] && c.valHooks[t].get ? c.valHooks[t].get : function(e) {\n                                            return e.value;\n                                        }, a = c.valHooks[t] && c.valHooks[t].set ? c.valHooks[t].set : function(e, t) {\n                                            return e.value = t, e;\n                                        };\n                                        c.valHooks[t] = {\n                                            get: function(t) {\n                                                if (t.inputmask) {\n                                                    if (t.inputmask.opts.autoUnmask) return t.inputmask.unmaskedvalue();\n                                                    var a = i(t);\n                                                    return -1 !== l.getLastValidPosition.call(e, void 0, void 0, t.inputmask.maskset.validPositions) || !0 !== n.nullable ? a : \"\";\n                                                }\n                                                return i(t);\n                                            },\n                                            set: function(e, t) {\n                                                var n = a(e, t);\n                                                return e.inputmask && (0, o.applyInputValue)(e, t), n;\n                                            },\n                                            inputmaskpatch: !0\n                                        };\n                                    }\n                                }(t.type), function(e) {\n                                    r.EventRuler.on(e, \"mouseenter\", (function() {\n                                        var e = this, t = e.inputmask._valueGet(!0);\n                                        t != (e.inputmask.isRTL ? l.getBuffer.call(e.inputmask).slice().reverse() : l.getBuffer.call(e.inputmask)).join(\"\") && (0, \n                                        o.applyInputValue)(e, t);\n                                    }));\n                                }(t));\n                            }\n                        }(t) : t.inputmask = void 0, a;\n                    }(n, t);\n                    if (!1 !== u) {\n                        e.originalPlaceholder = n.placeholder, e.maxLength = void 0 !== n ? n.maxLength : void 0, \n                        -1 === e.maxLength && (e.maxLength = void 0), \"inputMode\" in n && null === n.getAttribute(\"inputmode\") && (n.inputMode = t.inputmode, \n                        n.setAttribute(\"inputmode\", t.inputmode)), !0 === u && (t.showMaskOnFocus = t.showMaskOnFocus && -1 === [ \"cc-number\", \"cc-exp\" ].indexOf(n.autocomplete), \n                        i.iphone && (t.insertModeVisual = !1, n.setAttribute(\"autocorrect\", \"off\")), r.EventRuler.on(n, \"submit\", a.EventHandlers.submitEvent), \n                        r.EventRuler.on(n, \"reset\", a.EventHandlers.resetEvent), r.EventRuler.on(n, \"blur\", a.EventHandlers.blurEvent), \n                        r.EventRuler.on(n, \"focus\", a.EventHandlers.focusEvent), r.EventRuler.on(n, \"invalid\", a.EventHandlers.invalidEvent), \n                        r.EventRuler.on(n, \"click\", a.EventHandlers.clickEvent), r.EventRuler.on(n, \"mouseleave\", a.EventHandlers.mouseleaveEvent), \n                        r.EventRuler.on(n, \"mouseenter\", a.EventHandlers.mouseenterEvent), r.EventRuler.on(n, \"paste\", a.EventHandlers.pasteEvent), \n                        r.EventRuler.on(n, \"cut\", a.EventHandlers.cutEvent), r.EventRuler.on(n, \"complete\", t.oncomplete), \n                        r.EventRuler.on(n, \"incomplete\", t.onincomplete), r.EventRuler.on(n, \"cleared\", t.oncleared), \n                        !0 !== t.inputEventOnly && r.EventRuler.on(n, \"keydown\", a.EventHandlers.keyEvent), \n                        (i.mobile || t.inputEventOnly) && n.removeAttribute(\"maxLength\"), r.EventRuler.on(n, \"input\", a.EventHandlers.inputFallBackEvent)), \n                        r.EventRuler.on(n, \"setvalue\", a.EventHandlers.setValueEvent), void 0 === e.applyMaskHook || e.applyMaskHook(), \n                        l.getBufferTemplate.call(e).join(\"\"), e.undoValue = e._valueGet(!0);\n                        var f = (n.inputmask.shadowRoot || n.ownerDocument).activeElement;\n                        if (\"\" !== n.inputmask._valueGet(!0) || !1 === t.clearMaskOnLostFocus || f === n) {\n                            (0, o.applyInputValue)(n, n.inputmask._valueGet(!0), t);\n                            var p = l.getBuffer.call(e).slice();\n                            !1 === s.isComplete.call(e, p) && t.clearIncomplete && l.resetMaskSet.call(e, !1), \n                            t.clearMaskOnLostFocus && f !== n && (-1 === l.getLastValidPosition.call(e) ? p = [] : o.clearOptionalTail.call(e, p)), \n                            (!1 === t.clearMaskOnLostFocus || t.showMaskOnFocus && f === n || \"\" !== n.inputmask._valueGet(!0)) && (0, \n                            o.writeBuffer)(n, p), f === n && l.caret.call(e, n, l.seekNext.call(e, l.getLastValidPosition.call(e)));\n                        }\n                    }\n                };\n                var i = n(9845), a = n(6030), r = n(9716), o = n(7760), l = n(8711), s = n(7215);\n            },\n            9695: function(e, t) {\n                Object.defineProperty(t, \"__esModule\", {\n                    value: !0\n                }), t.default = function(e, t, n, i) {\n                    this.matches = [], this.openGroup = e || !1, this.alternatorGroup = !1, this.isGroup = e || !1, \n                    this.isOptional = t || !1, this.isQuantifier = n || !1, this.isAlternator = i || !1, \n                    this.quantifier = {\n                        min: 1,\n                        max: 1\n                    };\n                };\n            },\n            3194: function() {\n                Array.prototype.includes || Object.defineProperty(Array.prototype, \"includes\", {\n                    value: function(e, t) {\n                        if (null == this) throw new TypeError('\"this\" is null or not defined');\n                        var n = Object(this), i = n.length >>> 0;\n                        if (0 === i) return !1;\n                        for (var a = 0 | t, r = Math.max(a >= 0 ? a : i - Math.abs(a), 0); r < i; ) {\n                            if (n[r] === e) return !0;\n                            r++;\n                        }\n                        return !1;\n                    }\n                });\n            },\n            9302: function() {\n                var e = Function.bind.call(Function.call, Array.prototype.reduce), t = Function.bind.call(Function.call, Object.prototype.propertyIsEnumerable), n = Function.bind.call(Function.call, Array.prototype.concat), i = Object.keys;\n                Object.entries || (Object.entries = function(a) {\n                    return e(i(a), (function(e, i) {\n                        return n(e, \"string\" == typeof i && t(a, i) ? [ [ i, a[i] ] ] : []);\n                    }), []);\n                });\n            },\n            7149: function() {\n                function e(t) {\n                    return e = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function(e) {\n                        return typeof e;\n                    } : function(e) {\n                        return e && \"function\" == typeof Symbol && e.constructor === Symbol && e !== Symbol.prototype ? \"symbol\" : typeof e;\n                    }, e(t);\n                }\n                \"function\" != typeof Object.getPrototypeOf && (Object.getPrototypeOf = \"object\" === e(\"test\".__proto__) ? function(e) {\n                    return e.__proto__;\n                } : function(e) {\n                    return e.constructor.prototype;\n                });\n            },\n            4013: function() {\n                String.prototype.includes || (String.prototype.includes = function(e, t) {\n                    return \"number\" != typeof t && (t = 0), !(t + e.length > this.length) && -1 !== this.indexOf(e, t);\n                });\n            },\n            8711: function(e, t, n) {\n                Object.defineProperty(t, \"__esModule\", {\n                    value: !0\n                }), t.caret = function(e, t, n, i, r) {\n                    var o, l = this, s = this.opts;\n                    if (void 0 === t) return \"selectionStart\" in e && \"selectionEnd\" in e ? (t = e.selectionStart, \n                    n = e.selectionEnd) : a.default.getSelection ? (o = a.default.getSelection().getRangeAt(0)).commonAncestorContainer.parentNode !== e && o.commonAncestorContainer !== e || (t = o.startOffset, \n                    n = o.endOffset) : document.selection && document.selection.createRange && (n = (t = 0 - (o = document.selection.createRange()).duplicate().moveStart(\"character\", -e.inputmask._valueGet().length)) + o.text.length), \n                    {\n                        begin: i ? t : f.call(l, t),\n                        end: i ? n : f.call(l, n)\n                    };\n                    if (Array.isArray(t) && (n = l.isRTL ? t[0] : t[1], t = l.isRTL ? t[1] : t[0]), \n                    void 0 !== t.begin && (n = l.isRTL ? t.begin : t.end, t = l.isRTL ? t.end : t.begin), \n                    \"number\" == typeof t) {\n                        t = i ? t : f.call(l, t), n = \"number\" == typeof (n = i ? n : f.call(l, n)) ? n : t;\n                        var c = parseInt(((e.ownerDocument.defaultView || a.default).getComputedStyle ? (e.ownerDocument.defaultView || a.default).getComputedStyle(e, null) : e.currentStyle).fontSize) * n;\n                        if (e.scrollLeft = c > e.scrollWidth ? c : 0, e.inputmask.caretPos = {\n                            begin: t,\n                            end: n\n                        }, s.insertModeVisual && !1 === s.insertMode && t === n && (r || n++), e === (e.inputmask.shadowRoot || e.ownerDocument).activeElement) {\n                            if (\"setSelectionRange\" in e) e.setSelectionRange(t, n); else if (a.default.getSelection) {\n                                if (o = document.createRange(), void 0 === e.firstChild || null === e.firstChild) {\n                                    var u = document.createTextNode(\"\");\n                                    e.appendChild(u);\n                                }\n                                o.setStart(e.firstChild, t < e.inputmask._valueGet().length ? t : e.inputmask._valueGet().length), \n                                o.setEnd(e.firstChild, n < e.inputmask._valueGet().length ? n : e.inputmask._valueGet().length), \n                                o.collapse(!0);\n                                var p = a.default.getSelection();\n                                p.removeAllRanges(), p.addRange(o);\n                            } else e.createTextRange && ((o = e.createTextRange()).collapse(!0), o.moveEnd(\"character\", n), \n                            o.moveStart(\"character\", t), o.select());\n                            void 0 === e.inputmask.caretHook || e.inputmask.caretHook.call(l, {\n                                begin: t,\n                                end: n\n                            });\n                        }\n                    }\n                }, t.determineLastRequiredPosition = function(e) {\n                    var t, n, i = this, a = i.maskset, l = i.dependencyLib, c = s.call(i), u = {}, f = a.validPositions[c], p = o.getMaskTemplate.call(i, !0, s.call(i), !0, !0), d = p.length, h = void 0 !== f ? f.locator.slice() : void 0;\n                    for (t = c + 1; t < p.length; t++) h = (n = o.getTestTemplate.call(i, t, h, t - 1)).locator.slice(), \n                    u[t] = l.extend(!0, {}, n);\n                    var v = f && void 0 !== f.alternation ? f.locator[f.alternation] : void 0;\n                    for (t = d - 1; t > c && (((n = u[t]).match.optionality || n.match.optionalQuantifier && n.match.newBlockMarker || v && (v !== u[t].locator[f.alternation] && !0 !== n.match.static || !0 === n.match.static && n.locator[f.alternation] && r.checkAlternationMatch.call(i, n.locator[f.alternation].toString().split(\",\"), v.toString().split(\",\")) && \"\" !== o.getTests.call(i, t)[0].def)) && p[t] === o.getPlaceholder.call(i, t, n.match)); t--) d--;\n                    return e ? {\n                        l: d,\n                        def: u[d] ? u[d].match : void 0\n                    } : d;\n                }, t.determineNewCaretPosition = function(e, t, n) {\n                    var i, a, r, f = this, p = f.maskset, d = f.opts;\n                    t && (f.isRTL ? e.end = e.begin : e.begin = e.end);\n                    if (e.begin === e.end) {\n                        switch (n = n || d.positionCaretOnClick) {\n                          case \"none\":\n                            break;\n\n                          case \"select\":\n                            e = {\n                                begin: 0,\n                                end: l.call(f).length\n                            };\n                            break;\n\n                          case \"ignore\":\n                            e.end = e.begin = u.call(f, s.call(f));\n                            break;\n\n                          case \"radixFocus\":\n                            if (f.clicked > 1 && 0 === p.validPositions.length) break;\n                            if (function(e) {\n                                if (\"\" !== d.radixPoint && 0 !== d.digits) {\n                                    var t = p.validPositions;\n                                    if (void 0 === t[e] || void 0 === t[e].input) {\n                                        if (e < u.call(f, -1)) return !0;\n                                        var n = l.call(f).indexOf(d.radixPoint);\n                                        if (-1 !== n) {\n                                            for (var i = 0, a = t.length; i < a; i++) if (t[i] && n < i && t[i].input !== o.getPlaceholder.call(f, i)) return !1;\n                                            return !0;\n                                        }\n                                    }\n                                }\n                                return !1;\n                            }(e.begin)) {\n                                var h = l.call(f).join(\"\").indexOf(d.radixPoint);\n                                e.end = e.begin = d.numericInput ? u.call(f, h) : h;\n                                break;\n                            }\n\n                          default:\n                            if (i = e.begin, a = s.call(f, i, !0), i <= (r = u.call(f, -1 !== a || c.call(f, 0) ? a : -1))) e.end = e.begin = c.call(f, i, !1, !0) ? i : u.call(f, i); else {\n                                var v = p.validPositions[a], m = o.getTestTemplate.call(f, r, v ? v.match.locator : void 0, v), g = o.getPlaceholder.call(f, r, m.match);\n                                if (\"\" !== g && l.call(f)[r] !== g && !0 !== m.match.optionalQuantifier && !0 !== m.match.newBlockMarker || !c.call(f, r, d.keepStatic, !0) && m.match.def === g) {\n                                    var y = u.call(f, r);\n                                    (i >= y || i === r) && (r = y);\n                                }\n                                e.end = e.begin = r;\n                            }\n                        }\n                        return e;\n                    }\n                }, t.getBuffer = l, t.getBufferTemplate = function() {\n                    var e = this.maskset;\n                    void 0 === e._buffer && (e._buffer = o.getMaskTemplate.call(this, !1, 1), void 0 === e.buffer && (e.buffer = e._buffer.slice()));\n                    return e._buffer;\n                }, t.getLastValidPosition = s, t.isMask = c, t.resetMaskSet = function(e) {\n                    var t = this.maskset;\n                    t.buffer = void 0, !0 !== e && (t.validPositions = [], t.p = 0);\n                    !1 === e && (t.tests = {}, t.jitOffset = {});\n                }, t.seekNext = u, t.seekPrevious = function(e, t) {\n                    var n = this, i = e - 1;\n                    if (e <= 0) return 0;\n                    for (;i > 0 && (!0 === t && (!0 !== o.getTest.call(n, i).match.newBlockMarker || !c.call(n, i, void 0, !0)) || !0 !== t && !c.call(n, i, void 0, !0)); ) i--;\n                    return i;\n                }, t.translatePosition = f;\n                var i, a = (i = n(9380)) && i.__esModule ? i : {\n                    default: i\n                }, r = n(7215), o = n(4713);\n                function l(e) {\n                    var t = this, n = t.maskset;\n                    return void 0 !== n.buffer && !0 !== e || (n.buffer = o.getMaskTemplate.call(t, !0, s.call(t), !0), \n                    void 0 === n._buffer && (n._buffer = n.buffer.slice())), n.buffer;\n                }\n                function s(e, t, n) {\n                    var i = this.maskset, a = -1, r = -1, o = n || i.validPositions;\n                    void 0 === e && (e = -1);\n                    for (var l = 0, s = o.length; l < s; l++) o[l] && (t || !0 !== o[l].generatedInput) && (l <= e && (a = l), \n                    l >= e && (r = l));\n                    return -1 === a || a === e ? r : -1 === r || e - a < r - e ? a : r;\n                }\n                function c(e, t, n) {\n                    var i = this, a = this.maskset, r = o.getTestTemplate.call(i, e).match;\n                    if (\"\" === r.def && (r = o.getTest.call(i, e).match), !0 !== r.static) return r.fn;\n                    if (!0 === n && void 0 !== a.validPositions[e] && !0 !== a.validPositions[e].generatedInput) return !0;\n                    if (!0 !== t && e > -1) {\n                        if (n) {\n                            var l = o.getTests.call(i, e);\n                            return l.length > 1 + (\"\" === l[l.length - 1].match.def ? 1 : 0);\n                        }\n                        var s = o.determineTestTemplate.call(i, e, o.getTests.call(i, e)), c = o.getPlaceholder.call(i, e, s.match);\n                        return s.match.def !== c;\n                    }\n                    return !1;\n                }\n                function u(e, t, n) {\n                    var i = this;\n                    void 0 === n && (n = !0);\n                    for (var a = e + 1; \"\" !== o.getTest.call(i, a).match.def && (!0 === t && (!0 !== o.getTest.call(i, a).match.newBlockMarker || !c.call(i, a, void 0, !0)) || !0 !== t && !c.call(i, a, void 0, n)); ) a++;\n                    return a;\n                }\n                function f(e) {\n                    var t = this.opts, n = this.el;\n                    return !this.isRTL || \"number\" != typeof e || t.greedy && \"\" === t.placeholder || !n || (e = this._valueGet().length - e) < 0 && (e = 0), \n                    e;\n                }\n            },\n            4713: function(e, t, n) {\n                Object.defineProperty(t, \"__esModule\", {\n                    value: !0\n                }), t.determineTestTemplate = f, t.getDecisionTaker = s, t.getMaskTemplate = function(e, t, n, i, a) {\n                    var r = this, o = this.opts, l = this.maskset, s = o.greedy;\n                    a && o.greedy && (o.greedy = !1, r.maskset.tests = {});\n                    t = t || 0;\n                    var p, d, v, m, g = [], y = 0;\n                    do {\n                        if (!0 === e && l.validPositions[y]) d = (v = a && l.validPositions[y].match.optionality && void 0 === l.validPositions[y + 1] && (!0 === l.validPositions[y].generatedInput || l.validPositions[y].input == o.skipOptionalPartCharacter && y > 0) ? f.call(r, y, h.call(r, y, p, y - 1)) : l.validPositions[y]).match, \n                        p = v.locator.slice(), g.push(!0 === n ? v.input : !1 === n ? d.nativeDef : c.call(r, y, d)); else {\n                            d = (v = u.call(r, y, p, y - 1)).match, p = v.locator.slice();\n                            var k = !0 !== i && (!1 !== o.jitMasking ? o.jitMasking : d.jit);\n                            (m = (m || l.validPositions[y - 1]) && d.static && d.def !== o.groupSeparator && null === d.fn) || !1 === k || void 0 === k || \"number\" == typeof k && isFinite(k) && k > y ? g.push(!1 === n ? d.nativeDef : c.call(r, g.length, d)) : m = !1;\n                        }\n                        y++;\n                    } while (!0 !== d.static || \"\" !== d.def || t > y);\n                    \"\" === g[g.length - 1] && g.pop();\n                    !1 === n && void 0 !== l.maskLength || (l.maskLength = y - 1);\n                    return o.greedy = s, g;\n                }, t.getPlaceholder = c, t.getTest = p, t.getTestTemplate = u, t.getTests = h, t.isSubsetOf = d;\n                var i, a = (i = n(2394)) && i.__esModule ? i : {\n                    default: i\n                }, r = n(8711);\n                function o(e) {\n                    return o = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function(e) {\n                        return typeof e;\n                    } : function(e) {\n                        return e && \"function\" == typeof Symbol && e.constructor === Symbol && e !== Symbol.prototype ? \"symbol\" : typeof e;\n                    }, o(e);\n                }\n                function l(e, t) {\n                    var n = (null != e.alternation ? e.mloc[s(e)] : e.locator).join(\"\");\n                    if (\"\" !== n) for (n = n.split(\":\")[0]; n.length < t; ) n += \"0\";\n                    return n;\n                }\n                function s(e) {\n                    var t = e.locator[e.alternation];\n                    return \"string\" == typeof t && t.length > 0 && (t = t.split(\",\")[0]), void 0 !== t ? t.toString() : \"\";\n                }\n                function c(e, t, n) {\n                    var i = this, a = this.opts, l = this.maskset;\n                    if (void 0 !== (t = t || p.call(i, e).match).placeholder || !0 === n) {\n                        if (\"\" !== t.placeholder && !0 === t.static && !0 !== t.generated) {\n                            var s = r.getLastValidPosition.call(i, e), c = r.seekNext.call(i, s);\n                            return (n ? e <= c : e < c) ? a.staticDefinitionSymbol && t.static ? t.nativeDef : t.def : \"function\" == typeof t.placeholder ? t.placeholder(a) : t.placeholder;\n                        }\n                        return \"function\" == typeof t.placeholder ? t.placeholder(a) : t.placeholder;\n                    }\n                    if (!0 === t.static) {\n                        if (e > -1 && void 0 === l.validPositions[e]) {\n                            var u, f = h.call(i, e), d = [];\n                            if (\"string\" == typeof a.placeholder && f.length > 1 + (\"\" === f[f.length - 1].match.def ? 1 : 0)) for (var v = 0; v < f.length; v++) if (\"\" !== f[v].match.def && !0 !== f[v].match.optionality && !0 !== f[v].match.optionalQuantifier && (!0 === f[v].match.static || void 0 === u || !1 !== f[v].match.fn.test(u.match.def, l, e, !0, a)) && (d.push(f[v]), \n                            !0 === f[v].match.static && (u = f[v]), d.length > 1 && /[0-9a-bA-Z]/.test(d[0].match.def))) return a.placeholder.charAt(e % a.placeholder.length);\n                        }\n                        return t.def;\n                    }\n                    return \"object\" === o(a.placeholder) ? t.def : a.placeholder.charAt(e % a.placeholder.length);\n                }\n                function u(e, t, n) {\n                    return this.maskset.validPositions[e] || f.call(this, e, h.call(this, e, t ? t.slice() : t, n));\n                }\n                function f(e, t) {\n                    var n = this.opts, i = 0, a = function(e, t) {\n                        var n = 0, i = !1;\n                        t.forEach((function(e) {\n                            e.match.optionality && (0 !== n && n !== e.match.optionality && (i = !0), (0 === n || n > e.match.optionality) && (n = e.match.optionality));\n                        })), n && (0 == e || 1 == t.length ? n = 0 : i || (n = 0));\n                        return n;\n                    }(e, t);\n                    e = e > 0 ? e - 1 : 0;\n                    var r, o, s, c = l(p.call(this, e));\n                    n.greedy && t.length > 1 && \"\" === t[t.length - 1].match.def && (i = 1);\n                    for (var u = 0; u < t.length - i; u++) {\n                        var f = t[u];\n                        r = l(f, c.length);\n                        var d = Math.abs(r - c);\n                        (!0 !== f.unMatchedAlternationStopped || t.filter((function(e) {\n                            return !0 !== e.unMatchedAlternationStopped;\n                        })).length <= 1) && (void 0 === o || \"\" !== r && d < o || s && !n.greedy && s.match.optionality && s.match.optionality - a > 0 && \"master\" === s.match.newBlockMarker && (!f.match.optionality || f.match.optionality - a < 1 || !f.match.newBlockMarker) || s && !n.greedy && s.match.optionalQuantifier && !f.match.optionalQuantifier) && (o = d, \n                        s = f);\n                    }\n                    return s;\n                }\n                function p(e, t) {\n                    var n = this.maskset;\n                    return n.validPositions[e] ? n.validPositions[e] : (t || h.call(this, e))[0];\n                }\n                function d(e, t, n) {\n                    function i(e) {\n                        for (var t, n = [], i = -1, a = 0, r = e.length; a < r; a++) if (\"-\" === e.charAt(a)) for (t = e.charCodeAt(a + 1); ++i < t; ) n.push(String.fromCharCode(i)); else i = e.charCodeAt(a), \n                        n.push(e.charAt(a));\n                        return n.join(\"\");\n                    }\n                    return e.match.def === t.match.nativeDef || !(!(n.regex || e.match.fn instanceof RegExp && t.match.fn instanceof RegExp) || !0 === e.match.static || !0 === t.match.static) && (\".\" === t.match.fn.source || -1 !== i(t.match.fn.source.replace(/[[\\]/]/g, \"\")).indexOf(i(e.match.fn.source.replace(/[[\\]/]/g, \"\"))));\n                }\n                function h(e, t, n) {\n                    var i, r, o = this, l = this.dependencyLib, s = this.maskset, c = this.opts, u = this.el, p = s.maskToken, h = t ? n : 0, v = t ? t.slice() : [ 0 ], m = [], g = !1, y = t ? t.join(\"\") : \"\", k = !1;\n                    function b(t, n, r, l) {\n                        function f(r, l, p) {\n                            function v(e, t) {\n                                var n = 0 === t.matches.indexOf(e);\n                                return n || t.matches.every((function(i, a) {\n                                    return !0 === i.isQuantifier ? n = v(e, t.matches[a - 1]) : Object.prototype.hasOwnProperty.call(i, \"matches\") && (n = v(e, i)), \n                                    !n;\n                                })), n;\n                            }\n                            function w(e, t, n) {\n                                var i, a;\n                                if ((s.tests[e] || s.validPositions[e]) && (s.validPositions[e] ? [ s.validPositions[e] ] : s.tests[e]).every((function(e, r) {\n                                    if (e.mloc[t]) return i = e, !1;\n                                    var o = void 0 !== n ? n : e.alternation, l = void 0 !== e.locator[o] ? e.locator[o].toString().indexOf(t) : -1;\n                                    return (void 0 === a || l < a) && -1 !== l && (i = e, a = l), !0;\n                                })), i) {\n                                    var r = i.locator[i.alternation], o = i.mloc[t] || i.mloc[r] || i.locator;\n                                    if (-1 !== o[o.length - 1].toString().indexOf(\":\")) o.pop();\n                                    return o.slice((void 0 !== n ? n : i.alternation) + 1);\n                                }\n                                return void 0 !== n ? w(e, t) : void 0;\n                            }\n                            function P(t, n) {\n                                return !0 === t.match.static && !0 !== n.match.static && n.match.fn.test(t.match.def, s, e, !1, c, !1);\n                            }\n                            function S(e, t) {\n                                var n = e.alternation, i = void 0 === t || n <= t.alternation && -1 === e.locator[n].toString().indexOf(t.locator[n]);\n                                if (!i && n > t.alternation) for (var a = 0; a < n; a++) if (e.locator[a] !== t.locator[a]) {\n                                    n = a, i = !0;\n                                    break;\n                                }\n                                return !!i && function(n) {\n                                    e.mloc = e.mloc || {};\n                                    var i = e.locator[n];\n                                    if (void 0 !== i) {\n                                        if (\"string\" == typeof i && (i = i.split(\",\")[0]), void 0 === e.mloc[i] && (e.mloc[i] = e.locator.slice(), \n                                        e.mloc[i].push(\":\".concat(e.alternation))), void 0 !== t) {\n                                            for (var a in t.mloc) \"string\" == typeof a && (a = parseInt(a.split(\",\")[0])), e.mloc[a + 0] = t.mloc[a];\n                                            e.locator[n] = Object.keys(e.mloc).join(\",\");\n                                        }\n                                        return e.alternation > n && (e.alternation = n), !0;\n                                    }\n                                    return e.alternation = void 0, !1;\n                                }(n);\n                            }\n                            function O(e, t) {\n                                if (e.locator.length !== t.locator.length) return !1;\n                                for (var n = e.alternation + 1; n < e.locator.length; n++) if (e.locator[n] !== t.locator[n]) return !1;\n                                return !0;\n                            }\n                            if (h > e + c._maxTestPos) throw new Error(\"Inputmask: There is probably an error in your mask definition or in the code. Create an issue on github with an example of the mask you are using. \".concat(s.mask));\n                            if (h === e && void 0 === r.matches) {\n                                if (m.push({\n                                    match: r,\n                                    locator: l.reverse(),\n                                    cd: y,\n                                    mloc: {}\n                                }), !r.optionality || void 0 !== p || !(c.definitions && c.definitions[r.nativeDef] && c.definitions[r.nativeDef].optional || a.default.prototype.definitions[r.nativeDef] && a.default.prototype.definitions[r.nativeDef].optional)) return !0;\n                                g = !0, h = e;\n                            } else if (void 0 !== r.matches) {\n                                if (r.isGroup && p !== r) return function() {\n                                    if (r = f(t.matches[t.matches.indexOf(r) + 1], l, p)) return !0;\n                                }();\n                                if (r.isOptional) return function() {\n                                    var t = r, a = m.length;\n                                    if (r = b(r, n, l, p), m.length > 0) {\n                                        if (m.forEach((function(e, t) {\n                                            t >= a && (e.match.optionality = e.match.optionality ? e.match.optionality + 1 : 1);\n                                        })), i = m[m.length - 1].match, void 0 !== p || !v(i, t)) return r;\n                                        g = !0, h = e;\n                                    }\n                                }();\n                                if (r.isAlternator) return function() {\n                                    function i(e) {\n                                        for (var t, n = e.matches[0].matches ? e.matches[0].matches.length : 1, i = 0; i < e.matches.length && n === (t = e.matches[i].matches ? e.matches[i].matches.length : 1); i++) ;\n                                        return n !== t;\n                                    }\n                                    o.hasAlternator = !0;\n                                    var a, v = r, y = [], b = m.slice(), x = l.length, _ = n.length > 0 ? n.shift() : -1;\n                                    if (-1 === _ || \"string\" == typeof _) {\n                                        var M, E = h, j = n.slice(), T = [];\n                                        if (\"string\" == typeof _) T = _.split(\",\"); else for (M = 0; M < v.matches.length; M++) T.push(M.toString());\n                                        if (void 0 !== s.excludes[e]) {\n                                            for (var A = T.slice(), D = 0, L = s.excludes[e].length; D < L; D++) {\n                                                var C = s.excludes[e][D].toString().split(\":\");\n                                                l.length == C[1] && T.splice(T.indexOf(C[0]), 1);\n                                            }\n                                            0 === T.length && (delete s.excludes[e], T = A);\n                                        }\n                                        (!0 === c.keepStatic || isFinite(parseInt(c.keepStatic)) && E >= c.keepStatic) && (T = T.slice(0, 1));\n                                        for (var B = 0; B < T.length; B++) {\n                                            M = parseInt(T[B]), m = [], n = \"string\" == typeof _ && w(h, M, x) || j.slice();\n                                            var I = v.matches[M];\n                                            if (I && f(I, [ M ].concat(l), p)) r = !0; else if (0 === B && (k = i(v)), I && I.matches && I.matches.length > v.matches[0].matches.length) break;\n                                            a = m.slice(), h = E, m = [];\n                                            for (var R = 0; R < a.length; R++) {\n                                                var F = a[R], N = !1;\n                                                F.alternation = F.alternation || x, S(F);\n                                                for (var V = 0; V < y.length; V++) {\n                                                    var G = y[V];\n                                                    if (\"string\" != typeof _ || void 0 !== F.alternation && T.includes(F.locator[F.alternation].toString())) {\n                                                        if (F.match.nativeDef === G.match.nativeDef) {\n                                                            N = !0, S(G, F);\n                                                            break;\n                                                        }\n                                                        if (d(F, G, c)) {\n                                                            S(F, G) && (N = !0, y.splice(y.indexOf(G), 0, F));\n                                                            break;\n                                                        }\n                                                        if (d(G, F, c)) {\n                                                            S(G, F);\n                                                            break;\n                                                        }\n                                                        if (P(F, G)) {\n                                                            O(F, G) || void 0 !== u.inputmask.userOptions.keepStatic ? S(F, G) && (N = !0, y.splice(y.indexOf(G), 0, F)) : c.keepStatic = !0;\n                                                            break;\n                                                        }\n                                                        if (P(G, F)) {\n                                                            S(G, F);\n                                                            break;\n                                                        }\n                                                    }\n                                                }\n                                                N || y.push(F);\n                                            }\n                                        }\n                                        m = b.concat(y), h = e, g = m.length > 0 && k, r = y.length > 0 && !k, k && g && !r && m.forEach((function(e, t) {\n                                            e.unMatchedAlternationStopped = !0;\n                                        })), n = j.slice();\n                                    } else r = f(v.matches[_] || t.matches[_], [ _ ].concat(l), p);\n                                    if (r) return !0;\n                                }();\n                                if (r.isQuantifier && p !== t.matches[t.matches.indexOf(r) - 1]) return function() {\n                                    for (var a = r, o = !1, u = n.length > 0 ? n.shift() : 0; u < (isNaN(a.quantifier.max) ? u + 1 : a.quantifier.max) && h <= e; u++) {\n                                        var p = t.matches[t.matches.indexOf(a) - 1];\n                                        if (r = f(p, [ u ].concat(l), p)) {\n                                            if (m.forEach((function(t, n) {\n                                                (i = x(p, t.match) ? t.match : m[m.length - 1].match).optionalQuantifier = u >= a.quantifier.min, \n                                                i.jit = (u + 1) * (p.matches.indexOf(i) + 1) > a.quantifier.jit, i.optionalQuantifier && v(i, p) && (g = !0, \n                                                h = e, c.greedy && null == s.validPositions[e - 1] && u > a.quantifier.min && -1 != [ \"*\", \"+\" ].indexOf(a.quantifier.max) && (m.pop(), \n                                                y = void 0), o = !0, r = !1), !o && i.jit && (s.jitOffset[e] = p.matches.length - p.matches.indexOf(i));\n                                            })), o) break;\n                                            return !0;\n                                        }\n                                    }\n                                }();\n                                if (r = b(r, n, l, p)) return !0;\n                            } else h++;\n                        }\n                        for (var p = n.length > 0 ? n.shift() : 0; p < t.matches.length; p++) if (!0 !== t.matches[p].isQuantifier) {\n                            var v = f(t.matches[p], [ p ].concat(r), l);\n                            if (v && h === e) return v;\n                            if (h > e) break;\n                        }\n                    }\n                    function x(e, t) {\n                        var n = -1 != e.matches.indexOf(t);\n                        return n || e.matches.forEach((function(e, i) {\n                            void 0 === e.matches || n || (n = x(e, t));\n                        })), n;\n                    }\n                    if (e > -1) {\n                        if (void 0 === t) {\n                            for (var w, P = e - 1; void 0 === (w = s.validPositions[P] || s.tests[P]) && P > -1; ) P--;\n                            void 0 !== w && P > -1 && (v = function(e, t) {\n                                var n, i = [];\n                                return Array.isArray(t) || (t = [ t ]), t.length > 0 && (void 0 === t[0].alternation || !0 === c.keepStatic ? 0 === (i = f.call(o, e, t.slice()).locator.slice()).length && (i = t[0].locator.slice()) : t.forEach((function(e) {\n                                    \"\" !== e.def && (0 === i.length ? (n = e.alternation, i = e.locator.slice()) : e.locator[n] && -1 === i[n].toString().indexOf(e.locator[n]) && (i[n] += \",\" + e.locator[n]));\n                                }))), i;\n                            }(P, w), y = v.join(\"\"), h = P);\n                        }\n                        if (s.tests[e] && s.tests[e][0].cd === y) return s.tests[e];\n                        for (var S = v.shift(); S < p.length; S++) {\n                            if (b(p[S], v, [ S ]) && h === e || h > e) break;\n                        }\n                    }\n                    return (0 === m.length || g) && m.push({\n                        match: {\n                            fn: null,\n                            static: !0,\n                            optionality: !1,\n                            casing: null,\n                            def: \"\",\n                            placeholder: \"\"\n                        },\n                        locator: k && 0 === m.filter((function(e) {\n                            return !0 !== e.unMatchedAlternationStopped;\n                        })).length ? [ 0 ] : [],\n                        mloc: {},\n                        cd: y\n                    }), void 0 !== t && s.tests[e] ? r = l.extend(!0, [], m) : (s.tests[e] = l.extend(!0, [], m), \n                    r = s.tests[e]), m.forEach((function(e) {\n                        e.match.optionality = e.match.defOptionality || !1;\n                    })), r;\n                }\n            },\n            7215: function(e, t, n) {\n                Object.defineProperty(t, \"__esModule\", {\n                    value: !0\n                }), t.alternate = l, t.checkAlternationMatch = function(e, t, n) {\n                    for (var i, a = this.opts.greedy ? t : t.slice(0, 1), r = !1, o = void 0 !== n ? n.split(\",\") : [], l = 0; l < o.length; l++) -1 !== (i = e.indexOf(o[l])) && e.splice(i, 1);\n                    for (var s = 0; s < e.length; s++) if (a.includes(e[s])) {\n                        r = !0;\n                        break;\n                    }\n                    return r;\n                }, t.handleRemove = function(e, t, n, i, s) {\n                    var c = this, u = this.maskset, f = this.opts;\n                    if ((f.numericInput || c.isRTL) && (t === a.keys.Backspace ? t = a.keys.Delete : t === a.keys.Delete && (t = a.keys.Backspace), \n                    c.isRTL)) {\n                        var p = n.end;\n                        n.end = n.begin, n.begin = p;\n                    }\n                    var d, h = r.getLastValidPosition.call(c, void 0, !0);\n                    n.end >= r.getBuffer.call(c).length && h >= n.end && (n.end = h + 1);\n                    t === a.keys.Backspace ? n.end - n.begin < 1 && (n.begin = r.seekPrevious.call(c, n.begin)) : t === a.keys.Delete && n.begin === n.end && (n.end = r.isMask.call(c, n.end, !0, !0) ? n.end + 1 : r.seekNext.call(c, n.end) + 1);\n                    !1 !== (d = v.call(c, n)) && ((!0 !== i && !1 !== f.keepStatic || null !== f.regex && -1 !== o.getTest.call(c, n.begin).match.def.indexOf(\"|\")) && l.call(c, !0), \n                    !0 !== i && (u.p = t === a.keys.Delete ? n.begin + d : n.begin, u.p = r.determineNewCaretPosition.call(c, {\n                        begin: u.p,\n                        end: u.p\n                    }, !1, !1 === f.insertMode && t === a.keys.Backspace ? \"none\" : void 0).begin));\n                }, t.isComplete = c, t.isSelection = u, t.isValid = f, t.refreshFromBuffer = d, \n                t.revalidateMask = v;\n                var i = n(6030), a = n(2839), r = n(8711), o = n(4713);\n                function l(e, t, n, i, a, s) {\n                    var c = this, u = this.dependencyLib, p = this.opts, d = c.maskset;\n                    if (!c.hasAlternator) return !1;\n                    var h, v, m, g, y, k, b, x, w, P, S, O = u.extend(!0, [], d.validPositions), _ = u.extend(!0, {}, d.tests), M = !1, E = !1, j = void 0 !== a ? a : r.getLastValidPosition.call(c);\n                    if (s && (P = s.begin, S = s.end, s.begin > s.end && (P = s.end, S = s.begin)), \n                    -1 === j && void 0 === a) h = 0, v = (g = o.getTest.call(c, h)).alternation; else for (;j >= 0; j--) if ((m = d.validPositions[j]) && void 0 !== m.alternation) {\n                        if (j <= (e || 0) && g && g.locator[m.alternation] !== m.locator[m.alternation]) break;\n                        h = j, v = d.validPositions[h].alternation, g = m;\n                    }\n                    if (void 0 !== v) {\n                        b = parseInt(h), d.excludes[b] = d.excludes[b] || [], !0 !== e && d.excludes[b].push((0, \n                        o.getDecisionTaker)(g) + \":\" + g.alternation);\n                        var T = [], A = -1;\n                        for (y = b; b < r.getLastValidPosition.call(c, void 0, !0) + 1; y++) -1 === A && e <= y && void 0 !== t && (T.push(t), \n                        A = T.length - 1), (k = d.validPositions[b]) && !0 !== k.generatedInput && (void 0 === s || y < P || y >= S) && T.push(k.input), \n                        d.validPositions.splice(b, 1);\n                        for (-1 === A && void 0 !== t && (T.push(t), A = T.length - 1); void 0 !== d.excludes[b] && d.excludes[b].length < 10; ) {\n                            for (d.tests = {}, r.resetMaskSet.call(c, !0), M = !0, y = 0; y < T.length && (x = M.caret || 0 == p.insertMode && null != x ? r.seekNext.call(c, x) : r.getLastValidPosition.call(c, void 0, !0) + 1, \n                            w = T[y], M = f.call(c, x, w, !1, i, !0)); y++) y === A && (E = M), 1 == e && M && (E = {\n                                caretPos: y\n                            });\n                            if (M) break;\n                            if (r.resetMaskSet.call(c), g = o.getTest.call(c, b), d.validPositions = u.extend(!0, [], O), \n                            d.tests = u.extend(!0, {}, _), !d.excludes[b]) {\n                                E = l.call(c, e, t, n, i, b - 1, s);\n                                break;\n                            }\n                            if (null != g.alternation) {\n                                var D = (0, o.getDecisionTaker)(g);\n                                if (-1 !== d.excludes[b].indexOf(D + \":\" + g.alternation)) {\n                                    E = l.call(c, e, t, n, i, b - 1, s);\n                                    break;\n                                }\n                                for (d.excludes[b].push(D + \":\" + g.alternation), y = b; y < r.getLastValidPosition.call(c, void 0, !0) + 1; y++) d.validPositions.splice(b);\n                            } else delete d.excludes[b];\n                        }\n                    }\n                    return E && !1 === p.keepStatic || delete d.excludes[b], E;\n                }\n                function s(e, t, n) {\n                    var i = this.opts, r = this.maskset;\n                    switch (i.casing || t.casing) {\n                      case \"upper\":\n                        e = e.toUpperCase();\n                        break;\n\n                      case \"lower\":\n                        e = e.toLowerCase();\n                        break;\n\n                      case \"title\":\n                        var o = r.validPositions[n - 1];\n                        e = 0 === n || o && o.input === String.fromCharCode(a.keyCode.Space) ? e.toUpperCase() : e.toLowerCase();\n                        break;\n\n                      default:\n                        if (\"function\" == typeof i.casing) {\n                            var l = Array.prototype.slice.call(arguments);\n                            l.push(r.validPositions), e = i.casing.apply(this, l);\n                        }\n                    }\n                    return e;\n                }\n                function c(e) {\n                    var t = this, n = this.opts, i = this.maskset;\n                    if (\"function\" == typeof n.isComplete) return n.isComplete(e, n);\n                    if (\"*\" !== n.repeat) {\n                        var a = !1, l = r.determineLastRequiredPosition.call(t, !0), s = l.l;\n                        if (void 0 === l.def || l.def.newBlockMarker || l.def.optionality || l.def.optionalQuantifier) {\n                            a = !0;\n                            for (var c = 0; c <= s; c++) {\n                                var u = o.getTestTemplate.call(t, c).match;\n                                if (!0 !== u.static && void 0 === i.validPositions[c] && (!1 === u.optionality || void 0 === u.optionality || u.optionality && 0 == u.newBlockMarker) && (!1 === u.optionalQuantifier || void 0 === u.optionalQuantifier) || !0 === u.static && \"\" != u.def && e[c] !== o.getPlaceholder.call(t, c, u)) {\n                                    a = !1;\n                                    break;\n                                }\n                            }\n                        }\n                        return a;\n                    }\n                }\n                function u(e) {\n                    var t = this.opts.insertMode ? 0 : 1;\n                    return this.isRTL ? e.begin - e.end > t : e.end - e.begin > t;\n                }\n                function f(e, t, n, i, a, p, m) {\n                    var g = this, y = this.dependencyLib, k = this.opts, b = g.maskset;\n                    n = !0 === n;\n                    var x = e;\n                    function w(e) {\n                        if (void 0 !== e) {\n                            if (void 0 !== e.remove && (Array.isArray(e.remove) || (e.remove = [ e.remove ]), \n                            e.remove.sort((function(e, t) {\n                                return g.isRTL ? e.pos - t.pos : t.pos - e.pos;\n                            })).forEach((function(e) {\n                                v.call(g, {\n                                    begin: e,\n                                    end: e + 1\n                                });\n                            })), e.remove = void 0), void 0 !== e.insert && (Array.isArray(e.insert) || (e.insert = [ e.insert ]), \n                            e.insert.sort((function(e, t) {\n                                return g.isRTL ? t.pos - e.pos : e.pos - t.pos;\n                            })).forEach((function(e) {\n                                \"\" !== e.c && f.call(g, e.pos, e.c, void 0 === e.strict || e.strict, void 0 !== e.fromIsValid ? e.fromIsValid : i);\n                            })), e.insert = void 0), e.refreshFromBuffer && e.buffer) {\n                                var t = e.refreshFromBuffer;\n                                d.call(g, !0 === t ? t : t.start, t.end, e.buffer), e.refreshFromBuffer = void 0;\n                            }\n                            void 0 !== e.rewritePosition && (x = e.rewritePosition, e = !0);\n                        }\n                        return e;\n                    }\n                    function P(t, n, a) {\n                        var l = !1;\n                        return o.getTests.call(g, t).every((function(c, f) {\n                            var p = c.match;\n                            if (r.getBuffer.call(g, !0), !1 !== (l = (!p.jit || void 0 !== b.validPositions[r.seekPrevious.call(g, t)]) && (null != p.fn ? p.fn.test(n, b, t, a, k, u.call(g, e)) : (n === p.def || n === k.skipOptionalPartCharacter) && \"\" !== p.def && {\n                                c: o.getPlaceholder.call(g, t, p, !0) || p.def,\n                                pos: t\n                            }))) {\n                                var d = void 0 !== l.c ? l.c : n, h = t;\n                                return d = d === k.skipOptionalPartCharacter && !0 === p.static ? o.getPlaceholder.call(g, t, p, !0) || p.def : d, \n                                !0 !== (l = w(l)) && void 0 !== l.pos && l.pos !== t && (h = l.pos), !0 !== l && void 0 === l.pos && void 0 === l.c ? !1 : (!1 === v.call(g, e, y.extend({}, c, {\n                                    input: s.call(g, d, p, h)\n                                }), i, h) && (l = !1), !1);\n                            }\n                            return !0;\n                        })), l;\n                    }\n                    void 0 !== e.begin && (x = g.isRTL ? e.end : e.begin);\n                    var S = !0, O = y.extend(!0, [], b.validPositions);\n                    if (!1 === k.keepStatic && void 0 !== b.excludes[x] && !0 !== a && !0 !== i) for (var _ = x; _ < (g.isRTL ? e.begin : e.end); _++) void 0 !== b.excludes[_] && (b.excludes[_] = void 0, \n                    delete b.tests[_]);\n                    if (\"function\" == typeof k.preValidation && !0 !== i && !0 !== p && (S = w(S = k.preValidation.call(g, r.getBuffer.call(g), x, t, u.call(g, e), k, b, e, n || a))), \n                    !0 === S) {\n                        if (S = P(x, t, n), (!n || !0 === i) && !1 === S && !0 !== p) {\n                            var M = b.validPositions[x];\n                            if (!M || !0 !== M.match.static || M.match.def !== t && t !== k.skipOptionalPartCharacter) {\n                                if (k.insertMode || void 0 === b.validPositions[r.seekNext.call(g, x)] || e.end > x) {\n                                    var E = !1;\n                                    if (b.jitOffset[x] && void 0 === b.validPositions[r.seekNext.call(g, x)] && !1 !== (S = f.call(g, x + b.jitOffset[x], t, !0, !0)) && (!0 !== a && (S.caret = x), \n                                    E = !0), e.end > x && (b.validPositions[x] = void 0), !E && !r.isMask.call(g, x, k.keepStatic && 0 === x)) for (var j = x + 1, T = r.seekNext.call(g, x, !1, 0 !== x); j <= T; j++) if (!1 !== (S = P(j, t, n))) {\n                                        S = h.call(g, x, void 0 !== S.pos ? S.pos : j) || S, x = j;\n                                        break;\n                                    }\n                                }\n                            } else S = {\n                                caret: r.seekNext.call(g, x)\n                            };\n                        }\n                        g.hasAlternator && !0 !== a && !n && (a = !0, !1 === S && k.keepStatic && (c.call(g, r.getBuffer.call(g)) || 0 === x) ? S = l.call(g, x, t, n, i, void 0, e) : (u.call(g, e) && b.tests[x] && b.tests[x].length > 1 && k.keepStatic || 1 == S && !0 !== k.numericInput && b.tests[x] && b.tests[x].length > 1 && r.getLastValidPosition.call(g, void 0, !0) > x) && (S = l.call(g, !0))), \n                        !0 === S && (S = {\n                            pos: x\n                        });\n                    }\n                    if (\"function\" == typeof k.postValidation && !0 !== i && !0 !== p) {\n                        var A = k.postValidation.call(g, r.getBuffer.call(g, !0), void 0 !== e.begin ? g.isRTL ? e.end : e.begin : e, t, S, k, b, n, m);\n                        void 0 !== A && (S = !0 === A ? S : A);\n                    }\n                    S && void 0 === S.pos && (S.pos = x), !1 === S || !0 === p ? (r.resetMaskSet.call(g, !0), \n                    b.validPositions = y.extend(!0, [], O)) : h.call(g, void 0, x, !0);\n                    var D = w(S);\n                    void 0 !== g.maxLength && (r.getBuffer.call(g).length > g.maxLength && !i && (r.resetMaskSet.call(g, !0), \n                    b.validPositions = y.extend(!0, [], O), D = !1));\n                    return D;\n                }\n                function p(e, t, n) {\n                    for (var i = this.maskset, a = !1, r = o.getTests.call(this, e), l = 0; l < r.length; l++) {\n                        if (r[l].match && (r[l].match.nativeDef === t.match[n.shiftPositions ? \"def\" : \"nativeDef\"] && (!n.shiftPositions || !t.match.static) || r[l].match.nativeDef === t.match.nativeDef || n.regex && !r[l].match.static && r[l].match.fn.test(t.input, i, e, !1, n))) {\n                            a = !0;\n                            break;\n                        }\n                        if (r[l].match && r[l].match.def === t.match.nativeDef) {\n                            a = void 0;\n                            break;\n                        }\n                    }\n                    return !1 === a && void 0 !== i.jitOffset[e] && (a = p.call(this, e + i.jitOffset[e], t, n)), \n                    a;\n                }\n                function d(e, t, n) {\n                    var a, o, l = this, s = this.maskset, c = this.opts, u = this.dependencyLib, f = c.skipOptionalPartCharacter, p = l.isRTL ? n.slice().reverse() : n;\n                    if (c.skipOptionalPartCharacter = \"\", !0 === e) r.resetMaskSet.call(l, !1), e = 0, \n                    t = n.length, o = r.determineNewCaretPosition.call(l, {\n                        begin: 0,\n                        end: 0\n                    }, !1).begin; else {\n                        for (a = e; a < t; a++) s.validPositions.splice(e, 0);\n                        o = e;\n                    }\n                    var d = new u.Event(\"keypress\");\n                    for (a = e; a < t; a++) {\n                        d.key = p[a].toString(), l.ignorable = !1;\n                        var h = i.EventHandlers.keypressEvent.call(l, d, !0, !1, !1, o);\n                        !1 !== h && void 0 !== h && (o = h.forwardPosition);\n                    }\n                    c.skipOptionalPartCharacter = f;\n                }\n                function h(e, t, n) {\n                    var i = this, a = this.maskset, l = this.dependencyLib;\n                    if (void 0 === e) for (e = t - 1; e > 0 && !a.validPositions[e]; e--) ;\n                    for (var s = e; s < t; s++) {\n                        if (void 0 === a.validPositions[s] && !r.isMask.call(i, s, !1)) if (0 == s ? o.getTest.call(i, s) : a.validPositions[s - 1]) {\n                            var c = o.getTests.call(i, s).slice();\n                            \"\" === c[c.length - 1].match.def && c.pop();\n                            var u, p = o.determineTestTemplate.call(i, s, c);\n                            if (p && (!0 !== p.match.jit || \"master\" === p.match.newBlockMarker && (u = a.validPositions[s + 1]) && !0 === u.match.optionalQuantifier) && ((p = l.extend({}, p, {\n                                input: o.getPlaceholder.call(i, s, p.match, !0) || p.match.def\n                            })).generatedInput = !0, v.call(i, s, p, !0), !0 !== n)) {\n                                var d = a.validPositions[t].input;\n                                return a.validPositions[t] = void 0, f.call(i, t, d, !0, !0);\n                            }\n                        }\n                    }\n                }\n                function v(e, t, n, i) {\n                    var a = this, l = this.maskset, s = this.opts, c = this.dependencyLib;\n                    function d(e, t, n) {\n                        var i = t[e];\n                        if (void 0 !== i && !0 === i.match.static && !0 !== i.match.optionality && (void 0 === t[0] || void 0 === t[0].alternation)) {\n                            var a = n.begin <= e - 1 ? t[e - 1] && !0 === t[e - 1].match.static && t[e - 1] : t[e - 1], r = n.end > e + 1 ? t[e + 1] && !0 === t[e + 1].match.static && t[e + 1] : t[e + 1];\n                            return a && r;\n                        }\n                        return !1;\n                    }\n                    var h = 0, v = void 0 !== e.begin ? e.begin : e, m = void 0 !== e.end ? e.end : e, g = !0;\n                    if (e.begin > e.end && (v = e.end, m = e.begin), i = void 0 !== i ? i : v, void 0 === n && (v !== m || s.insertMode && void 0 !== l.validPositions[i] || void 0 === t || t.match.optionalQuantifier || t.match.optionality)) {\n                        var y, k = c.extend(!0, [], l.validPositions), b = r.getLastValidPosition.call(a, void 0, !0);\n                        l.p = v;\n                        var x = u.call(a, e) ? v : i;\n                        for (y = b; y >= x; y--) l.validPositions.splice(y, 1), void 0 === t && delete l.tests[y + 1];\n                        var w, P, S = i, O = S;\n                        for (t && (l.validPositions[i] = c.extend(!0, {}, t), O++, S++), null == k[m] && l.jitOffset[m] && (m += l.jitOffset[m] + 1), \n                        y = t ? m : m - 1; y <= b; y++) {\n                            if (void 0 !== (w = k[y]) && !0 !== w.generatedInput && (y >= m || y >= v && d(y, k, {\n                                begin: v,\n                                end: m\n                            }))) {\n                                for (;\"\" !== o.getTest.call(a, O).match.def; ) {\n                                    if (!1 !== (P = p.call(a, O, w, s)) || \"+\" === w.match.def) {\n                                        \"+\" === w.match.def && r.getBuffer.call(a, !0);\n                                        var _ = f.call(a, O, w.input, \"+\" !== w.match.def, !0);\n                                        if (g = !1 !== _, S = (_.pos || O) + 1, !g && P) break;\n                                    } else g = !1;\n                                    if (g) {\n                                        void 0 === t && w.match.static && y === e.begin && h++;\n                                        break;\n                                    }\n                                    if (!g && r.getBuffer.call(a), O > l.maskLength) break;\n                                    O++;\n                                }\n                                \"\" == o.getTest.call(a, O).match.def && (g = !1), O = S;\n                            }\n                            if (!g) break;\n                        }\n                        if (!g) return l.validPositions = c.extend(!0, [], k), r.resetMaskSet.call(a, !0), \n                        !1;\n                    } else t && o.getTest.call(a, i).match.cd === t.match.cd && (l.validPositions[i] = c.extend(!0, {}, t));\n                    return r.resetMaskSet.call(a, !0), h;\n                }\n            }\n        }, t = {};\n        function n(i) {\n            var a = t[i];\n            if (void 0 !== a) return a.exports;\n            var r = t[i] = {\n                exports: {}\n            };\n            return e[i](r, r.exports, n), r.exports;\n        }\n        var i = {};\n        return function() {\n            var e = i;\n            Object.defineProperty(e, \"__esModule\", {\n                value: !0\n            }), e.default = void 0, n(7149), n(3194), n(9302), n(4013), n(3851), n(219), n(207), \n            n(5296);\n            var t, a = (t = n(2394)) && t.__esModule ? t : {\n                default: t\n            };\n            e.default = a.default;\n        }(), i;\n    }();\n}));", "function ok() {\n  return true;\n}\nfunction notOk() {\n  return false;\n}\nfunction undef() {\n  return undefined;\n}\nconst NOT_TYPED_FUNCTION = 'Argument is not a typed-function.';\n\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 */\nfunction 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  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  };\n\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  let typeMap; // primary store of all types\n  let typeList; // Array of just type names, for the sake of ordering\n\n  // And similar data structures for the type conversions:\n  let nConversions = 0;\n  // the actual conversions are stored on a property of the destination types\n\n  // This is a temporary object, will be replaced with a function at the end\n  let typed = {\n    createCount: 0\n  };\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  function findType(typeName) {\n    const type = typeMap.get(typeName);\n    if (type) {\n      return type;\n    }\n    // Remainder is error handling\n    let message = 'Unknown type \"' + typeName + '\"';\n    const name = typeName.toLowerCase();\n    let otherName;\n    for (otherName of typeList) {\n      if (otherName.toLowerCase() === name) {\n        message += '. Did you mean \"' + otherName + '\" ?';\n        break;\n      }\n    }\n    throw new TypeError(message);\n  }\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  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    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      const typeName = types[i].name;\n      if (typeMap.has(typeName)) {\n        throw new TypeError('Duplicate type name \"' + typeName + '\"');\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    const affectedTypes = typeList.slice(beforeIndex);\n    typeList = typeList.slice(0, beforeIndex).concat(newTypes).concat(affectedTypes);\n    // Fix the indices\n    for (let i = beforeIndex + newTypes.length; i < typeList.length; ++i) {\n      typeMap.get(typeList[i]).index = i;\n    }\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  function clear() {\n    typeMap = new Map();\n    typeList = [];\n    nConversions = 0;\n    addTypes([anyType], false);\n  }\n\n  // initialize the types to the default list\n  clear();\n  addTypes(_types);\n\n  /**\n   * Removes all conversions, leaving the types alone.\n   */\n  function clearConversions() {\n    let typeName;\n    for (typeName of typeList) {\n      typeMap.get(typeName).conversionsTo = [];\n    }\n    nConversions = 0;\n  }\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  function findTypeNames(value) {\n    const matches = typeList.filter(name => {\n      const type = typeMap.get(name);\n      return !type.isAny && type.test(value);\n    });\n    if (matches.length) {\n      return matches;\n    }\n    return ['any'];\n  }\n\n  /**\n   * Check if an entity is a typed function created by any instance\n   * @param {any} entity\n   * @returns {boolean}\n   */\n  function isTypedFunction(entity) {\n    return entity && typeof entity === 'function' && '_typedFunctionData' in entity;\n  }\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  function findSignature(fn, signature, options) {\n    if (!isTypedFunction(fn)) {\n      throw new TypeError(NOT_TYPED_FUNCTION);\n    }\n\n    // Canonicalize input\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);\n\n    // First hope we get lucky and exactly match a signature\n    if (!exact || canonicalSignature in fn.signatures) {\n      // OK, we can check the internal signatures\n      const match = fn._typedFunctionData.signatureMap.get(canonicalSignature);\n      if (match) {\n        return match;\n      }\n    }\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    const nParams = params.length;\n    let remainingSignatures;\n    if (exact) {\n      remainingSignatures = [];\n      let name;\n      for (name in fn.signatures) {\n        remainingSignatures.push(fn._typedFunctionData.signatureMap.get(name));\n      }\n    } else {\n      remainingSignatures = fn._typedFunctionData.signatures;\n    }\n    for (let i = 0; i < nParams; ++i) {\n      const want = params[i];\n      const filteredSignatures = [];\n      let possibility;\n      for (possibility of remainingSignatures) {\n        const have = getParamAtIndex(possibility.params, i);\n        if (!have || want.restParam && !have.restParam) {\n          continue;\n        }\n        if (!have.hasAny) {\n          // have to check all of the wanted types are available\n          const haveTypes = paramTypeSet(have);\n          if (want.types.some(wtype => !haveTypes.has(wtype.name))) {\n            continue;\n          }\n        }\n        // OK, this looks good\n        filteredSignatures.push(possibility);\n      }\n      remainingSignatures = filteredSignatures;\n      if (remainingSignatures.length === 0) break;\n    }\n    // Return the first remaining signature that was totally matched:\n    let candidate;\n    for (candidate of remainingSignatures) {\n      if (candidate.params.length <= nParams) {\n        return candidate;\n      }\n    }\n    throw new TypeError('Signature not found (signature: ' + (fn.name || 'unnamed') + '(' + stringifyParams(params, ', ') + '))');\n  }\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  function find(fn, signature, options) {\n    return findSignature(fn, signature, options).implementation;\n  }\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  function convert(value, typeName) {\n    // check conversion is needed\n    const type = findType(typeName);\n    if (type.test(value)) {\n      return value;\n    }\n    const conversions = type.conversionsTo;\n    if (conversions.length === 0) {\n      throw new Error('There are no conversions to ' + typeName + ' defined.');\n    }\n    for (let i = 0; i < conversions.length; i++) {\n      const fromType = findType(conversions[i].from);\n      if (fromType.test(value)) {\n        return conversions[i].convert(value);\n      }\n    }\n    throw new Error('Cannot convert ' + value + ' to ' + typeName);\n  }\n\n  /**\n   * Stringify parameters in a normalized way\n   * @param {Param[]} params\n   * @param {string} [','] separator\n   * @return {string}\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  /**\n   * Parse a parameter, like \"...number | boolean\"\n   * @param {string} param\n   * @return {Param} param\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  /**\n   * Expands a parsed parameter with the types available from currently\n   * defined conversions.\n   * @param {Param} param\n   * @return {Param} param\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  /**\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  function paramTypeSet(param) {\n    if (!param.typeSet) {\n      param.typeSet = new Set();\n      param.types.forEach(type => param.typeSet.add(type.name));\n    }\n    return param.typeSet;\n  }\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  function parseSignature(rawSignature) {\n    const params = [];\n    if (typeof rawSignature !== 'string') {\n      throw new TypeError('Signatures must be strings');\n    }\n    const signature = rawSignature.trim();\n    if (signature === '') {\n      return params;\n    }\n    const rawParams = signature.split(',');\n    for (let i = 0; i < rawParams.length; ++i) {\n      const parsedParam = parseParam(rawParams[i].trim());\n      if (parsedParam.restParam && i !== rawParams.length - 1) {\n        throw new SyntaxError('Unexpected rest parameter \"' + rawParams[i] + '\": ' + 'only allowed for the last parameter');\n      }\n      // if invalid, short-circuit (all the types may have been filtered)\n      if (parsedParam.types.length === 0) {\n        return null;\n      }\n      params.push(parsedParam);\n    }\n    return params;\n  }\n\n  /**\n   * Test whether a set of params contains a restParam\n   * @param {Param[]} params\n   * @return {boolean} Returns true when the last parameter is a restParam\n   */\n  function hasRestParam(params) {\n    const param = last(params);\n    return param ? param.restParam : false;\n  }\n\n  /**\n   * Create a type test for a single parameter, which can have one or multiple\n   * types.\n   * @param {Param} param\n   * @return {function(x: *) : boolean} Returns a test function\n   */\n  function compileTest(param) {\n    if (!param || param.types.length === 0) {\n      // nothing to do\n      return ok;\n    } 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        return false;\n      };\n    }\n  }\n\n  /**\n   * Create a test for all parameters of a signature\n   * @param {Param[]} params\n   * @return {function(args: Array<*>) : boolean}\n   */\n  function compileTests(params) {\n    let tests, test0, test1;\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      const testRestParam = function (args) {\n        for (let i = varIndex; i < args.length; i++) {\n          if (!lastTest(args[i])) {\n            return false;\n          }\n        }\n        return true;\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        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          return args.length === tests.length;\n        };\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  function getParamAtIndex(params, index) {\n    return index < params.length ? params[index] : hasRestParam(params) ? last(params) : null;\n  }\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  function getTypeSetAtIndex(params, index) {\n    const param = getParamAtIndex(params, index);\n    if (!param) {\n      return new Set();\n    }\n    return paramTypeSet(param);\n  }\n\n  /**\n   * Test whether a type is an exact type or conversion\n   * @param {Type} type\n   * @return {boolean} Returns true when\n   */\n  function isExactType(type) {\n    return type.conversion === null || type.conversion === undefined;\n  }\n\n  /**\n   * Helper function for creating error messages: create an array with\n   * all available types on a specific argument index.\n   * @param {Signature[]} signatures\n   * @param {number} index\n   * @return {string[]} Returns an array with available types\n   */\n  function mergeExpectedParams(signatures, index) {\n    const typeSet = new Set();\n    signatures.forEach(signature => {\n      const paramSet = getTypeSetAtIndex(signature.params, index);\n      let name;\n      for (name of paramSet) {\n        typeSet.add(name);\n      }\n    });\n    return typeSet.has('any') ? ['any'] : Array.from(typeSet);\n  }\n\n  /**\n   * Create\n   * @param {string} name             The name of the function\n   * @param {array.<*>} args          The actual arguments passed to the function\n   * @param {Signature[]} signatures  A list with available signatures\n   * @return {TypeError} Returns a type error with additional data\n   *                     attached to it in the property `data`\n   */\n  function createError(name, args, signatures) {\n    let err, expected;\n    const _name = name || 'unnamed';\n\n    // test for wrong type at some index\n    let matchingSignatures = signatures;\n    let index;\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        if ((index < signature.params.length || hasRestParam(signature.params)) && test(args[index])) {\n          nextMatchingDefs.push(signature);\n        }\n      });\n      if (nextMatchingDefs.length === 0) {\n        // no matching signatures anymore, throw error \"wrong type\"\n        expected = mergeExpectedParams(matchingSignatures, index);\n        if (expected.length > 0) {\n          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    }\n\n    // test for too few arguments\n    const lengths = matchingSignatures.map(function (signature) {\n      return hasRestParam(signature.params) ? Infinity : signature.params.length;\n    });\n    if (args.length < Math.min.apply(null, lengths)) {\n      expected = mergeExpectedParams(matchingSignatures, index);\n      err = new TypeError('Too few arguments in function ' + _name + ' (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    }\n\n    // test for too many arguments\n    const maxLength = Math.max.apply(null, lengths);\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    }\n\n    // Generic error\n    const argTypes = [];\n    for (let i = 0; i < args.length; ++i) {\n      argTypes.push(findTypeNames(args[i]).join('|'));\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  /**\n   * Find the lowest index of all types of a parameter\n   * @param {Param} param\n   * @return {number} Returns the index of the lowest type in typed.types\n   */\n  function getLowestTypeIndex(param) {\n    let min = typeList.length + 1;\n    for (let i = 0; i < param.types.length; i++) {\n      min = Math.min(min, param.types[i].typeIndex);\n    }\n    return min;\n  }\n\n  /**\n   * Find the lowest index of the conversion of all types of the parameter\n   * having a conversion\n   * @param {Param} param\n   * @return {number} Returns the lowest index of the conversions of this type\n   */\n  function getLowestConversionIndex(param) {\n    let min = nConversions + 1;\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    return min;\n  }\n\n  /**\n   * Compare two params. The return value is a number that is\n   * negative when param1 should be considered first, positive\n   * when param2 should be considered first, and zero when the\n   * params are indistinguishable. Primarily as a debugging aid,\n   * the value is always less than one in absolute value, and\n   * a smaller absolute value indicates a less important distinction\n   * between the parameters.\n   * @param {Param} param1\n   * @param {Param} param2\n   * @return {number} negative, positive, or zero depending on whether\n   *                  param1 should be ordered before, after, or equivalently\n   *                  to param2\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 0.1;\n      }\n    } else if (param2.hasAny) {\n      return -0.1;\n    }\n\n    // 2) Prefer non-rest to rest parameters\n    if (param1.restParam) {\n      if (!param2.restParam) {\n        return 0.01;\n      }\n    } else if (param2.restParam) {\n      return -0.01;\n    }\n\n    // 3) Prefer lower type index:\n    const typeDiff = getLowestTypeIndex(param1) - getLowestTypeIndex(param2);\n    if (typeDiff < 0) {\n      return -0.001;\n    }\n    if (typeDiff > 0) {\n      return 0.001;\n    }\n\n    // 4) Prefer exact type match to conversions, with a strength that\n    //    grows with the conversion index\n    const conv1 = getLowestConversionIndex(param1);\n    const conv2 = getLowestConversionIndex(param2);\n    if (param1.hasConversion) {\n      if (!param2.hasConversion) {\n        return (1 + conv1) * 0.000001;\n      }\n    } else if (param2.hasConversion) {\n      return -(1 + conv2) * 0.000001;\n    }\n\n    // 5) Prefer lower conversion index\n    const convDiff = conv1 - conv2;\n    if (convDiff < 0) {\n      return -0.0000001;\n    }\n    if (convDiff > 0) {\n      return 0.0000001;\n    }\n\n    // Don't have a basis for preference\n    return 0;\n  }\n\n  /**\n   * Compare two signatures. The result is a number that is negative\n   * when the first signature should be preferred to the second, positive\n   * when the second signature should be preferred, and zero in case the\n   * two signatures are essentially equivalent. Primarily as a debugging\n   * aid, a larger absolute value indicates a more \"important\" difference.\n   *\n   * @param {Signature} signature1\n   * @param {Signature} signature2\n   * @return {number} returns a negative number when signature1 must get a\n   *                  lower index than signature2, a positive number when the\n   *                  opposite holds, or zero when both are equivalent.\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);\n    // We compare a number of metrics on signatures in turn:\n    // 1) An \"any rest param\" is least preferred\n    if (hasRest1 && last1.hasAny) {\n      if (!hasRest2 || !last2.hasAny) {\n        return 10000000;\n      }\n    } else if (hasRest2 && last2.hasAny) {\n      return -10000000;\n    }\n\n    // 2) Minimize the number of 'any' parameters\n    let any1 = 0;\n    let conv1 = 0;\n    let par;\n    for (par of pars1) {\n      if (par.hasAny) ++any1;\n      if (par.hasConversion) ++conv1;\n    }\n    let any2 = 0;\n    let conv2 = 0;\n    for (par of pars2) {\n      if (par.hasAny) ++any2;\n      if (par.hasConversion) ++conv2;\n    }\n    if (any1 !== any2) {\n      return (any1 - any2) * 1000000;\n    }\n\n    // 3) A conversion rest param is less preferred\n    if (hasRest1 && last1.hasConversion) {\n      if (!hasRest2 || !last2.hasConversion) {\n        return 100000;\n      }\n    } else if (hasRest2 && last2.hasConversion) {\n      return -100000;\n    }\n\n    // 4) Minimize the number of conversions\n    if (conv1 !== conv2) {\n      return (conv1 - conv2) * 10000;\n    }\n\n    // 5) Prefer no rest param\n    if (hasRest1) {\n      if (!hasRest2) {\n        return 1000;\n      }\n    } else if (hasRest2) {\n      return -1000;\n    }\n\n    // 6) Prefer shorter with rest param, longer without\n    const lengthCriterion = (pars1.length - pars2.length) * (hasRest1 ? -100 : 100);\n    if (lengthCriterion !== 0) {\n      return lengthCriterion;\n    }\n\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    const comparisons = [];\n    let tc = 0;\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    if (tc !== 0) {\n      return (tc < 0 ? -10 : 10) + tc;\n    }\n\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    let c;\n    let bonus = 9;\n    const decrement = bonus / (comparisons.length + 1);\n    for (c of comparisons) {\n      if (c !== 0) {\n        return (c < 0 ? -bonus : bonus) + c;\n      }\n      bonus -= decrement;\n    }\n\n    // It's a tossup:\n    return 0;\n  }\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  function availableConversions(typeNames) {\n    if (typeNames.length === 0) {\n      return [];\n    }\n    const types = typeNames.map(findType);\n    if (typeNames.length === 1) return types[0].conversionsTo;\n\n    // Here, for each type that occurs as the from-type of any conversion\n    // to any of the types found, we must select the conversion of\n    // lowest index from that type. So first collect the types.\n    const knownTypes = new Set(typeNames);\n    const convertibleTypes = new Set();\n    for (let i = 0; i < types.length; ++i) {\n      for (const match of types[i].conversionsTo) {\n        if (!knownTypes.has(match.from)) convertibleTypes.add(match.from);\n      }\n    }\n\n    // Now get the lowest-index conversion for each type\n    const matches = [];\n    for (const typeName of convertibleTypes) {\n      let bestIndex = nConversions + 1;\n      let bestConversion = null;\n      for (let i = 0; i < types.length; ++i) {\n        for (const match of types[i].conversionsTo) {\n          if (match.from === typeName && match.index < bestIndex) {\n            bestIndex = match.index;\n            bestConversion = match;\n          }\n        }\n      }\n      matches.push(bestConversion);\n    }\n    return matches;\n  }\n\n  /**\n   * Preprocess arguments before calling the original function:\n   * - if needed convert the parameters\n   * - in case of rest parameters, move the rest parameters into an Array\n   * @param {Param[]} params\n   * @param {function} fn\n   * @return {function} Returns fn or a wrapped function if needed. If it\n   *                    has conversions, the function will be named to indicate\n   *                    what conversions are occurring.\n   */\n  function compileArgsPreprocessing(params, fn) {\n    let fnConvert = fn;\n\n    // TODO: can we make this wrapper function smarter/simpler?\n\n    let name = '';\n    if (params.some(p => p.hasConversion)) {\n      const restParam = hasRestParam(params);\n      const compiledConversions = params.map(compileArgConversion);\n      name = compiledConversions.map(conv => conv.name).join(';');\n      fnConvert = function convertArgs() {\n        const args = [];\n        const last = restParam ? arguments.length - 1 : arguments.length;\n        for (let i = 0; i < last; i++) {\n          args[i] = compiledConversions[i](arguments[i]);\n        }\n        if (restParam) {\n          args[last] = arguments[last].map(compiledConversions[last]);\n        }\n        return fn.apply(this, args);\n      };\n    }\n    let fnPreprocess = fnConvert;\n    if (hasRestParam(params)) {\n      const offset = params.length - 1;\n      fnPreprocess = function preprocessRestParams() {\n        return fnConvert.apply(this, slice(arguments, 0, offset).concat([slice(arguments, offset)]));\n      };\n    }\n    if (name) Object.defineProperty(fnPreprocess, 'name', {\n      value: name\n    });\n    return fnPreprocess;\n  }\n\n  /**\n   * Compile conversion for a parameter to the right type\n   * @param {Param} param\n   * @return {function} Returns the wrapped function that will convert arguments\n   *\n   */\n  function compileArgConversion(param) {\n    let test0, test1, conversion0, conversion1;\n    const tests = [];\n    const conversions = [];\n    let name = '';\n    param.types.forEach(function (type) {\n      if (type.conversion) {\n        name += type.conversion.from + '~>' + type.conversion.to + ',';\n        tests.push(findType(type.conversion.from).test);\n        conversions.push(type.conversion.convert);\n      }\n    });\n    if (name) name = name.slice(0, -1);else name = 'pass';\n\n    // create optimized conversion functions depending on the number of conversions\n    let convertor = arg => arg;\n    switch (conversions.length) {\n      case 0:\n        break;\n      case 1:\n        test0 = tests[0];\n        conversion0 = conversions[0];\n        convertor = function convertArg(arg) {\n          if (test0(arg)) {\n            return conversion0(arg);\n          }\n          return arg;\n        };\n        break;\n      case 2:\n        test0 = tests[0];\n        test1 = tests[1];\n        conversion0 = conversions[0];\n        conversion1 = conversions[1];\n        convertor = function convertArg(arg) {\n          if (test0(arg)) {\n            return conversion0(arg);\n          }\n          if (test1(arg)) {\n            return conversion1(arg);\n          }\n          return arg;\n        };\n        break;\n      default:\n        convertor = 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          return arg;\n        };\n    }\n    Object.defineProperty(convertor, 'name', {\n      value: name\n    });\n    return convertor;\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  function splitParams(params) {\n    function _splitParams(params, index, paramsSoFar) {\n      if (index < params.length) {\n        const param = params[index];\n        let resultingParams = [];\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          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          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        }\n\n        // recurse over the groups with types\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    return _splitParams(params, 0, []);\n  }\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  function conflicting(params1, params2) {\n    const ii = Math.max(params1.length, params2.length);\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      for (name of typeSet2) {\n        if (typeSet1.has(name)) {\n          overlap = true;\n          break;\n        }\n      }\n      if (!overlap) {\n        return false;\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  /**\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  function clearResolutions(functionList) {\n    return functionList.map(fn => {\n      if (isReferToSelf(fn)) {\n        return referToSelf(fn.referToSelf.callback);\n      }\n      if (isReferTo(fn)) {\n        return makeReferTo(fn.referTo.references, fn.referTo.callback);\n      }\n      return fn;\n    });\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  function collectResolutions(references, functionList, signatureMap) {\n    const resolvedReferences = [];\n    let reference;\n    for (reference of references) {\n      let resolution = signatureMap[reference];\n      if (typeof resolution !== 'number') {\n        throw new TypeError('No definition for referenced signature \"' + reference + '\"');\n      }\n      resolution = functionList[resolution];\n      if (typeof resolution !== 'function') {\n        return false;\n      }\n      resolvedReferences.push(resolution);\n    }\n    return resolvedReferences;\n  }\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  function resolveReferences(functionList, signatureMap, self) {\n    const resolvedFunctions = clearResolutions(functionList);\n    const isResolved = new Array(resolvedFunctions.length).fill(false);\n    let leftUnresolved = true;\n    while (leftUnresolved) {\n      leftUnresolved = false;\n      let nothingResolved = true;\n      for (let i = 0; i < resolvedFunctions.length; ++i) {\n        if (isResolved[i]) continue;\n        const fn = resolvedFunctions[i];\n        if (isReferToSelf(fn)) {\n          resolvedFunctions[i] = fn.referToSelf.callback(self);\n          // Preserve reference in case signature is reused someday:\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          if (resolvedReferences) {\n            resolvedFunctions[i] = fn.referTo.callback.apply(this, resolvedReferences);\n            // Preserve reference in case signature is reused someday:\n            resolvedFunctions[i].referTo = fn.referTo;\n            isResolved[i] = true;\n            nothingResolved = false;\n          } else {\n            leftUnresolved = true;\n          }\n        }\n      }\n      if (nothingResolved && leftUnresolved) {\n        throw new SyntaxError('Circular reference detected in resolving typed.referTo');\n      }\n    }\n    return resolvedFunctions;\n  }\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  function validateDeprecatedThis(signaturesMap) {\n    // TODO: remove this deprecation warning logic some day (it's introduced in v3)\n\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      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  /**\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  function createTypedFunction(name, rawSignaturesMap) {\n    typed.createCount++;\n    if (Object.keys(rawSignaturesMap).length === 0) {\n      throw new SyntaxError('No signatures provided');\n    }\n    if (typed.warnAgainstDeprecatedThis) {\n      validateDeprecatedThis(rawSignaturesMap);\n    }\n\n    // Main processing loop for signatures\n    const parsedParams = [];\n    const originalFunctions = [];\n    const signaturesMap = {};\n    const preliminarySignatures = []; // may have duplicates from conversions\n    let signature;\n    for (signature in rawSignaturesMap) {\n      // A) Protect against polluted Object prototype:\n      if (!Object.prototype.hasOwnProperty.call(rawSignaturesMap, signature)) {\n        continue;\n      }\n      // B) Parse the signature\n      const params = parseSignature(signature);\n      if (!params) continue;\n      // C) Check for conflicts\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);\n      // D) Store the provided function and add conversions\n      const functionIndex = originalFunctions.length;\n      originalFunctions.push(rawSignaturesMap[signature]);\n      const conversionParams = params.map(expandParam);\n      // E) Split the signatures and collect them up\n      let sp;\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        if (sp.every(p => !p.hasConversion)) {\n          signaturesMap[spName] = functionIndex;\n        }\n      }\n    }\n    preliminarySignatures.sort(compareSignatures);\n\n    // Note the forward reference to theTypedFn\n    const resolvedFunctions = resolveReferences(originalFunctions, signaturesMap, theTypedFn);\n\n    // Fill in the proper function for each signature\n    let s;\n    for (s in signaturesMap) {\n      if (Object.prototype.hasOwnProperty.call(signaturesMap, s)) {\n        signaturesMap[s] = resolvedFunctions[signaturesMap[s]];\n      }\n    }\n    const signatures = [];\n    const internalSignatureMap = new Map(); // benchmarks faster than object\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    }\n\n    // we create a highly optimized checks for the first couple of signatures with max 2 arguments\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;\n\n    // compile the tests\n    for (let i = 0; i < signatures.length; ++i) {\n      signatures[i].test = compileTests(signatures[i].params);\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;\n\n    // compile the functions\n    for (let i = 0; i < signatures.length; ++i) {\n      signatures[i].implementation = compileArgsPreprocessing(signatures[i].params, signatures[i].fn);\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;\n\n    // simple and generic, but also slow\n    const iStart = allOk ? 6 : 0;\n    const iEnd = signatures.length;\n    // de-reference ahead for execution speed:\n    const tests = signatures.map(s => s.test);\n    const fns = signatures.map(s => s.implementation);\n    const generic = function generic() {\n      'use strict';\n\n      for (let i = iStart; i < iEnd; i++) {\n        if (tests[i](arguments)) {\n          return fns[i].apply(this, arguments);\n        }\n      }\n      return typed.onMismatch(name, arguments, signatures);\n    };\n\n    // create the typed function\n    // fast, specialized version. Falls back to the slower, generic one if needed\n    function theTypedFn(arg0, arg1) {\n      'use strict';\n\n      if (arguments.length === len0 && test00(arg0) && test01(arg1)) {\n        return fn0.apply(this, arguments);\n      }\n      if (arguments.length === len1 && test10(arg0) && test11(arg1)) {\n        return fn1.apply(this, arguments);\n      }\n      if (arguments.length === len2 && test20(arg0) && test21(arg1)) {\n        return fn2.apply(this, arguments);\n      }\n      if (arguments.length === len3 && test30(arg0) && test31(arg1)) {\n        return fn3.apply(this, arguments);\n      }\n      if (arguments.length === len4 && test40(arg0) && test41(arg1)) {\n        return fn4.apply(this, arguments);\n      }\n      if (arguments.length === len5 && test50(arg0) && test51(arg1)) {\n        return fn5.apply(this, arguments);\n      }\n      return generic.apply(this, arguments);\n    }\n\n    // attach name the typed function\n    try {\n      Object.defineProperty(theTypedFn, 'name', {\n        value: name\n      });\n    } catch (err) {\n      // old browsers do not support Object.defineProperty and some don't support setting the name property\n      // the function name is not essential for the functioning, it's mostly useful for debugging,\n      // so it's fine to have unnamed functions.\n    }\n\n    // attach signatures to the function.\n    // This property is close to the original collection of signatures\n    // used to create the typed-function, just with unions split:\n    theTypedFn.signatures = signaturesMap;\n\n    // Store internal data for functions like resolve, find, etc.\n    // Also serves as the flag that this is a typed-function\n    theTypedFn._typedFunctionData = {\n      signatures,\n      signatureMap: internalSignatureMap\n    };\n    return theTypedFn;\n  }\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  function _onMismatch(name, args, signatures) {\n    throw createError(name, args, signatures);\n  }\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  function initial(arr) {\n    return slice(arr, 0, arr.length - 1);\n  }\n\n  /**\n   * return the last item of an array or function Arguments\n   * @param {Array | Arguments} arr\n   * @return {*}\n   */\n  function last(arr) {\n    return arr[arr.length - 1];\n  }\n\n  /**\n   * Slice an array or function Arguments\n   * @param {Array | Arguments | IArguments} arr\n   * @param {number} start\n   * @param {number} [end]\n   * @return {Array}\n   */\n  function slice(arr, start, end) {\n    return Array.prototype.slice.call(arr, start, end);\n  }\n\n  /**\n   * Return the first item from an array for which test(arr[i]) returns true\n   * @param {Array} arr\n   * @param {function} test\n   * @return {* | undefined} Returns the first matching item\n   *                         or undefined when there is no match\n   */\n  function findInArray(arr, test) {\n    for (let i = 0; i < arr.length; i++) {\n      if (test(arr[i])) {\n        return arr[i];\n      }\n    }\n    return undefined;\n  }\n\n  /**\n   * Flat map the result invoking a callback for every item in an array.\n   * https://gist.github.com/samgiles/762ee337dff48623e729\n   * @param {Array} arr\n   * @param {function} callback\n   * @return {Array}\n   */\n  function flatMap(arr, callback) {\n    return Array.prototype.concat.apply([], arr.map(callback));\n  }\n\n  /**\n   * 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  function referTo() {\n    const references = initial(arguments).map(s => stringifyParams(parseSignature(s)));\n    const callback = last(arguments);\n    if (typeof callback !== 'function') {\n      throw new TypeError('Callback function expected as last argument');\n    }\n    return makeReferTo(references, callback);\n  }\n  function makeReferTo(references, callback) {\n    return {\n      referTo: {\n        references,\n        callback\n      }\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  function referToSelf(callback) {\n    if (typeof callback !== 'function') {\n      throw new TypeError('Callback function expected as first argument');\n    }\n    return {\n      referToSelf: {\n        callback\n      }\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  function isReferTo(objectOrFn) {\n    return objectOrFn && typeof objectOrFn.referTo === 'object' && Array.isArray(objectOrFn.referTo.references) && typeof objectOrFn.referTo.callback === 'function';\n  }\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  function isReferToSelf(objectOrFn) {\n    return objectOrFn && typeof objectOrFn.referToSelf === 'object' && typeof objectOrFn.referToSelf.callback === 'function';\n  }\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  function checkName(nameSoFar, newName) {\n    if (!nameSoFar) {\n      return newName;\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    return nameSoFar;\n  }\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  function getObjectName(obj) {\n    let name;\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    return name;\n  }\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  function mergeSignatures(dest, source) {\n    let key;\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          }\n          // else: both signatures point to the same function, that's fine\n        }\n        dest[key] = source[key];\n      }\n    }\n  }\n  const saveTyped = typed;\n\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  typed = function (maybeName) {\n    const named = typeof maybeName === 'string';\n    const start = named ? 1 : 0;\n    let name = named ? maybeName : '';\n    const allSignatures = {};\n    for (let i = start; i < arguments.length; ++i) {\n      const item = arguments[i];\n      let theseSignatures = {};\n      let thisName;\n      if (typeof item === 'function') {\n        thisName = item.name;\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        if (!named) {\n          thisName = getObjectName(item);\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      if (!named) {\n        name = checkName(name, thisName);\n      }\n      mergeSignatures(allSignatures, theseSignatures);\n    }\n    return createTypedFunction(name || '', allSignatures);\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  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  /**\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  typed.addType = function (type, beforeObjectTest) {\n    let before = 'any';\n    if (beforeObjectTest !== false && typeMap.has('Object')) {\n      before = 'Object';\n    }\n    typed.addTypes([type], before);\n  };\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  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    if (conversion.to === conversion.from) {\n      throw new SyntaxError('Illegal to define conversion from \"' + conversion.from + '\" to itself.');\n    }\n  }\n\n  /**\n   * Add a conversion\n   *\n   * @param {ConversionDef} conversion\n   * @param {{override: boolean}} [options]\n   * @returns {void}\n   * @throws {TypeError}\n   */\n  typed.addConversion = function (conversion) {\n    let options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {\n      override: false\n    };\n    _validateConversion(conversion);\n    const to = findType(conversion.to);\n    const existing = to.conversionsTo.find(other => other.from === conversion.from);\n    if (existing) {\n      if (options && options.override) {\n        typed.removeConversion({\n          from: existing.from,\n          to: conversion.to,\n          convert: existing.convert\n        });\n      } else {\n        throw new Error('There is already a conversion from \"' + conversion.from + '\" to \"' + to.name + '\"');\n      }\n    }\n    to.conversionsTo.push({\n      from: conversion.from,\n      to: to.name,\n      convert: conversion.convert,\n      index: nConversions++\n    });\n  };\n\n  /**\n   * Convenience wrapper to call addConversion on each conversion in a list.\n   *\n   * @param {ConversionDef[]} conversions\n   * @param {{override: boolean}} [options]\n   * @returns {void}\n   * @throws {TypeError}\n   */\n  typed.addConversions = function (conversions, options) {\n    conversions.forEach(conversion => typed.addConversion(conversion, options));\n  };\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  typed.removeConversion = function (conversion) {\n    _validateConversion(conversion);\n    const to = findType(conversion.to);\n    const existingConversion = findInArray(to.conversionsTo, c => c.from === conversion.from);\n    if (!existingConversion) {\n      throw new Error('Attempt to remove nonexistent conversion from ' + conversion.from + ' to ' + conversion.to);\n    }\n    if (existingConversion.convert !== conversion.convert) {\n      throw new Error('Conversion to remove does not match existing conversion');\n    }\n    const index = to.conversionsTo.indexOf(existingConversion);\n    to.conversionsTo.splice(index, 1);\n  };\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  typed.resolve = function (tf, argList) {\n    if (!isTypedFunction(tf)) {\n      throw new TypeError(NOT_TYPED_FUNCTION);\n    }\n    const sigs = tf._typedFunctionData.signatures;\n    for (let i = 0; i < sigs.length; ++i) {\n      if (sigs[i].test(argList)) {\n        return sigs[i];\n      }\n    }\n    return null;\n  };\n  return typed;\n}\nexport default create();\n//# sourceMappingURL=typed-function.mjs.map", "/*\r\n * Natural Sort algorithm for Javascript - Version 0.7 - Released under MIT license\r\n * Author: Jim Palmer (based on chunking idea from Dave Koelle)\r\n */\r\n/*jshint unused:false */\r\nmodule.exports = function naturalSort (a, b) {\r\n\t\"use strict\";\r\n\tvar re = /(^([+\\-]?(?:0|[1-9]\\d*)(?:\\.\\d*)?(?:[eE][+\\-]?\\d+)?)?$|^0x[0-9a-f]+$|\\d+)/gi,\r\n\t\tsre = /(^[ ]*|[ ]*$)/g,\r\n\t\tdre = /(^([\\w ]+,?[\\w ]+)?[\\w ]+,?[\\w ]+\\d+:\\d+(:\\d+)?[\\w ]?|^\\d{1,4}[\\/\\-]\\d{1,4}[\\/\\-]\\d{1,4}|^\\w+, \\w+ \\d+, \\d{4})/,\r\n\t\thre = /^0x[0-9a-f]+$/i,\r\n\t\tore = /^0/,\r\n\t\ti = function(s) { return naturalSort.insensitive && ('' + s).toLowerCase() || '' + s; },\r\n\t\t// convert all to strings strip whitespace\r\n\t\tx = i(a).replace(sre, '') || '',\r\n\t\ty = i(b).replace(sre, '') || '',\r\n\t\t// chunk/tokenize\r\n\t\txN = x.replace(re, '\\0$1\\0').replace(/\\0$/,'').replace(/^\\0/,'').split('\\0'),\r\n\t\tyN = y.replace(re, '\\0$1\\0').replace(/\\0$/,'').replace(/^\\0/,'').split('\\0'),\r\n\t\t// numeric, hex or date detection\r\n\t\txD = parseInt(x.match(hre), 16) || (xN.length !== 1 && x.match(dre) && Date.parse(x)),\r\n\t\tyD = parseInt(y.match(hre), 16) || xD && y.match(dre) && Date.parse(y) || null,\r\n\t\toFxNcL, oFyNcL;\r\n\t// first try and sort Hex codes or Dates\r\n\tif (yD) {\r\n\t\tif ( xD < yD ) { return -1; }\r\n\t\telse if ( xD > yD ) { return 1; }\r\n\t}\r\n\t// natural sorting through split numeric strings and default strings\r\n\tfor(var cLoc=0, numS=Math.max(xN.length, yN.length); cLoc < numS; cLoc++) {\r\n\t\t// find floats not starting with '0', string or 0 if not defined (Clint Priest)\r\n\t\toFxNcL = !(xN[cLoc] || '').match(ore) && parseFloat(xN[cLoc]) || xN[cLoc] || 0;\r\n\t\toFyNcL = !(yN[cLoc] || '').match(ore) && parseFloat(yN[cLoc]) || yN[cLoc] || 0;\r\n\t\t// handle numeric vs string comparison - number < string - (Kyle Adams)\r\n\t\tif (isNaN(oFxNcL) !== isNaN(oFyNcL)) { return (isNaN(oFxNcL)) ? 1 : -1; }\r\n\t\t// rely on string comparison if different types - i.e. '02' < 2 != '02' < '2'\r\n\t\telse if (typeof oFxNcL !== typeof oFyNcL) {\r\n\t\t\toFxNcL += '';\r\n\t\t\toFyNcL += '';\r\n\t\t}\r\n\t\tif (oFxNcL < oFyNcL) { return -1; }\r\n\t\tif (oFxNcL > oFyNcL) { return 1; }\r\n\t}\r\n\treturn 0;\r\n};\r\n", "\"use strict\";\n\n// Map the characters to escape to their escaped values. The list is derived\n// from http://www.cespedes.org/blog/85/how-to-escape-latex-special-characters\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nvar defaultEscapes = {\n  \"{\": \"\\\\{\",\n  \"}\": \"\\\\}\",\n  \"\\\\\": \"\\\\textbackslash{}\",\n  \"#\": \"\\\\#\",\n  $: \"\\\\$\",\n  \"%\": \"\\\\%\",\n  \"&\": \"\\\\&\",\n  \"^\": \"\\\\textasciicircum{}\",\n  _: \"\\\\_\",\n  \"~\": \"\\\\textasciitilde{}\"\n};\nvar formatEscapes = {\n  \"\\u2013\": \"\\\\--\",\n  \"\\u2014\": \"\\\\---\",\n  \" \": \"~\",\n  \"\\t\": \"\\\\qquad{}\",\n  \"\\r\\n\": \"\\\\newline{}\",\n  \"\\n\": \"\\\\newline{}\"\n};\n\nvar defaultEscapeMapFn = function defaultEscapeMapFn(defaultEscapes, formatEscapes) {\n  return _extends({}, defaultEscapes, formatEscapes);\n};\n\n/**\n * Escape a string to be used in LaTeX documents.\n * @param {string} str the string to be escaped.\n * @param {boolean} params.preserveFormatting whether formatting escapes should\n *  be performed (default: false).\n * @param {function} params.escapeMapFn the function to modify the escape maps.\n * @return {string} the escaped string, ready to be used in LaTeX.\n */\nmodule.exports = function (str) {\n  var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},\n      _ref$preserveFormatti = _ref.preserveFormatting,\n      preserveFormatting = _ref$preserveFormatti === undefined ? false : _ref$preserveFormatti,\n      _ref$escapeMapFn = _ref.escapeMapFn,\n      escapeMapFn = _ref$escapeMapFn === undefined ? defaultEscapeMapFn : _ref$escapeMapFn;\n\n  var runningStr = String(str);\n  var result = \"\";\n\n  var escapes = escapeMapFn(_extends({}, defaultEscapes), preserveFormatting ? _extends({}, formatEscapes) : {});\n  var escapeKeys = Object.keys(escapes); // as it is reused later on\n\n  // Algorithm: Go through the string character by character, if it matches\n  // with one of the special characters then we'll replace it with the escaped\n  // version.\n\n  var _loop = function _loop() {\n    var specialCharFound = false;\n    escapeKeys.forEach(function (key, index) {\n      if (specialCharFound) {\n        return;\n      }\n      if (runningStr.length >= key.length && runningStr.slice(0, key.length) === key) {\n        result += escapes[escapeKeys[index]];\n        runningStr = runningStr.slice(key.length, runningStr.length);\n        specialCharFound = true;\n      }\n    });\n    if (!specialCharFound) {\n      result += runningStr.slice(0, 1);\n      runningStr = runningStr.slice(1, runningStr.length);\n    }\n  };\n\n  while (runningStr) {\n    _loop();\n  }\n  return result;\n};", "// A port of an algorithm by Johannes Baag\u00F8e <baagoe@baagoe.com>, 2010\n// http://baagoe.com/en/RandomMusings/javascript/\n// https://github.com/nquinlan/better-random-numbers-for-javascript-mirror\n// Original work is under MIT license -\n\n// Copyright (C) 2010 by Johannes Baag\u00F8e <baagoe@baagoe.org>\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\n\n\n(function(global, module, define) {\n\nfunction Alea(seed) {\n  var me = this, mash = Mash();\n\n  me.next = function() {\n    var t = 2091639 * me.s0 + me.c * 2.3283064365386963e-10; // 2^-32\n    me.s0 = me.s1;\n    me.s1 = me.s2;\n    return me.s2 = t - (me.c = t | 0);\n  };\n\n  // Apply the seeding algorithm from Baagoe.\n  me.c = 1;\n  me.s0 = mash(' ');\n  me.s1 = mash(' ');\n  me.s2 = mash(' ');\n  me.s0 -= mash(seed);\n  if (me.s0 < 0) { me.s0 += 1; }\n  me.s1 -= mash(seed);\n  if (me.s1 < 0) { me.s1 += 1; }\n  me.s2 -= mash(seed);\n  if (me.s2 < 0) { me.s2 += 1; }\n  mash = null;\n}\n\nfunction copy(f, t) {\n  t.c = f.c;\n  t.s0 = f.s0;\n  t.s1 = f.s1;\n  t.s2 = f.s2;\n  return t;\n}\n\nfunction impl(seed, opts) {\n  var xg = new Alea(seed),\n      state = opts && opts.state,\n      prng = xg.next;\n  prng.int32 = function() { return (xg.next() * 0x100000000) | 0; }\n  prng.double = function() {\n    return prng() + (prng() * 0x200000 | 0) * 1.1102230246251565e-16; // 2^-53\n  };\n  prng.quick = prng;\n  if (state) {\n    if (typeof(state) == 'object') copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nfunction Mash() {\n  var n = 0xefc8249d;\n\n  var mash = function(data) {\n    data = String(data);\n    for (var i = 0; i < data.length; i++) {\n      n += data.charCodeAt(i);\n      var h = 0.02519603282416938 * n;\n      n = h >>> 0;\n      h -= n;\n      h *= n;\n      n = h >>> 0;\n      h -= n;\n      n += h * 0x100000000; // 2^32\n    }\n    return (n >>> 0) * 2.3283064365386963e-10; // 2^-32\n  };\n\n  return mash;\n}\n\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.alea = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n\n", "// A Javascript implementaion of the \"xor128\" prng algorithm by\n// George Marsaglia.  See http://www.jstatsoft.org/v08/i14/paper\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this, strseed = '';\n\n  me.x = 0;\n  me.y = 0;\n  me.z = 0;\n  me.w = 0;\n\n  // Set up generator function.\n  me.next = function() {\n    var t = me.x ^ (me.x << 11);\n    me.x = me.y;\n    me.y = me.z;\n    me.z = me.w;\n    return me.w ^= (me.w >>> 19) ^ t ^ (t >>> 8);\n  };\n\n  if (seed === (seed | 0)) {\n    // Integer seed.\n    me.x = seed;\n  } else {\n    // String seed.\n    strseed += seed;\n  }\n\n  // Mix in string seed, then discard an initial batch of 64 values.\n  for (var k = 0; k < strseed.length + 64; k++) {\n    me.x ^= strseed.charCodeAt(k) | 0;\n    me.next();\n  }\n}\n\nfunction copy(f, t) {\n  t.x = f.x;\n  t.y = f.y;\n  t.z = f.z;\n  t.w = f.w;\n  return t;\n}\n\nfunction impl(seed, opts) {\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (typeof(state) == 'object') copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.xor128 = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n\n", "// A Javascript implementaion of the \"xorwow\" prng algorithm by\n// George Marsaglia.  See http://www.jstatsoft.org/v08/i14/paper\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this, strseed = '';\n\n  // Set up generator function.\n  me.next = function() {\n    var t = (me.x ^ (me.x >>> 2));\n    me.x = me.y; me.y = me.z; me.z = me.w; me.w = me.v;\n    return (me.d = (me.d + 362437 | 0)) +\n       (me.v = (me.v ^ (me.v << 4)) ^ (t ^ (t << 1))) | 0;\n  };\n\n  me.x = 0;\n  me.y = 0;\n  me.z = 0;\n  me.w = 0;\n  me.v = 0;\n\n  if (seed === (seed | 0)) {\n    // Integer seed.\n    me.x = seed;\n  } else {\n    // String seed.\n    strseed += seed;\n  }\n\n  // Mix in string seed, then discard an initial batch of 64 values.\n  for (var k = 0; k < strseed.length + 64; k++) {\n    me.x ^= strseed.charCodeAt(k) | 0;\n    if (k == strseed.length) {\n      me.d = me.x << 10 ^ me.x >>> 4;\n    }\n    me.next();\n  }\n}\n\nfunction copy(f, t) {\n  t.x = f.x;\n  t.y = f.y;\n  t.z = f.z;\n  t.w = f.w;\n  t.v = f.v;\n  t.d = f.d;\n  return t;\n}\n\nfunction impl(seed, opts) {\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (typeof(state) == 'object') copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.xorwow = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n\n", "// A Javascript implementaion of the \"xorshift7\" algorithm by\n// Fran\u00E7ois Panneton and Pierre L'ecuyer:\n// \"On the Xorgshift Random Number Generators\"\n// http://saluc.engr.uconn.edu/refs/crypto/rng/panneton05onthexorshift.pdf\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this;\n\n  // Set up generator function.\n  me.next = function() {\n    // Update xor generator.\n    var X = me.x, i = me.i, t, v, w;\n    t = X[i]; t ^= (t >>> 7); v = t ^ (t << 24);\n    t = X[(i + 1) & 7]; v ^= t ^ (t >>> 10);\n    t = X[(i + 3) & 7]; v ^= t ^ (t >>> 3);\n    t = X[(i + 4) & 7]; v ^= t ^ (t << 7);\n    t = X[(i + 7) & 7]; t = t ^ (t << 13); v ^= t ^ (t << 9);\n    X[i] = v;\n    me.i = (i + 1) & 7;\n    return v;\n  };\n\n  function init(me, seed) {\n    var j, w, X = [];\n\n    if (seed === (seed | 0)) {\n      // Seed state array using a 32-bit integer.\n      w = X[0] = seed;\n    } else {\n      // Seed state using a string.\n      seed = '' + seed;\n      for (j = 0; j < seed.length; ++j) {\n        X[j & 7] = (X[j & 7] << 15) ^\n            (seed.charCodeAt(j) + X[(j + 1) & 7] << 13);\n      }\n    }\n    // Enforce an array length of 8, not all zeroes.\n    while (X.length < 8) X.push(0);\n    for (j = 0; j < 8 && X[j] === 0; ++j);\n    if (j == 8) w = X[7] = -1; else w = X[j];\n\n    me.x = X;\n    me.i = 0;\n\n    // Discard an initial 256 values.\n    for (j = 256; j > 0; --j) {\n      me.next();\n    }\n  }\n\n  init(me, seed);\n}\n\nfunction copy(f, t) {\n  t.x = f.x.slice();\n  t.i = f.i;\n  return t;\n}\n\nfunction impl(seed, opts) {\n  if (seed == null) seed = +(new Date);\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (state.x) copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.xorshift7 = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n", "// A Javascript implementaion of Richard Brent's Xorgens xor4096 algorithm.\n//\n// This fast non-cryptographic random number generator is designed for\n// use in Monte-Carlo algorithms. It combines a long-period xorshift\n// generator with a Weyl generator, and it passes all common batteries\n// of stasticial tests for randomness while consuming only a few nanoseconds\n// for each prng generated.  For background on the generator, see Brent's\n// paper: \"Some long-period random number generators using shifts and xors.\"\n// http://arxiv.org/pdf/1004.3115v1.pdf\n//\n// Usage:\n//\n// var xor4096 = require('xor4096');\n// random = xor4096(1);                        // Seed with int32 or string.\n// assert.equal(random(), 0.1520436450538547); // (0, 1) range, 53 bits.\n// assert.equal(random.int32(), 1806534897);   // signed int32, 32 bits.\n//\n// For nonzero numeric keys, this impelementation provides a sequence\n// identical to that by Brent's xorgens 3 implementaion in C.  This\n// implementation also provides for initalizing the generator with\n// string seeds, or for saving and restoring the state of the generator.\n//\n// On Chrome, this prng benchmarks about 2.1 times slower than\n// Javascript's built-in Math.random().\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this;\n\n  // Set up generator function.\n  me.next = function() {\n    var w = me.w,\n        X = me.X, i = me.i, t, v;\n    // Update Weyl generator.\n    me.w = w = (w + 0x61c88647) | 0;\n    // Update xor generator.\n    v = X[(i + 34) & 127];\n    t = X[i = ((i + 1) & 127)];\n    v ^= v << 13;\n    t ^= t << 17;\n    v ^= v >>> 15;\n    t ^= t >>> 12;\n    // Update Xor generator array state.\n    v = X[i] = v ^ t;\n    me.i = i;\n    // Result is the combination.\n    return (v + (w ^ (w >>> 16))) | 0;\n  };\n\n  function init(me, seed) {\n    var t, v, i, j, w, X = [], limit = 128;\n    if (seed === (seed | 0)) {\n      // Numeric seeds initialize v, which is used to generates X.\n      v = seed;\n      seed = null;\n    } else {\n      // String seeds are mixed into v and X one character at a time.\n      seed = seed + '\\0';\n      v = 0;\n      limit = Math.max(limit, seed.length);\n    }\n    // Initialize circular array and weyl value.\n    for (i = 0, j = -32; j < limit; ++j) {\n      // Put the unicode characters into the array, and shuffle them.\n      if (seed) v ^= seed.charCodeAt((j + 32) % seed.length);\n      // After 32 shuffles, take v as the starting w value.\n      if (j === 0) w = v;\n      v ^= v << 10;\n      v ^= v >>> 15;\n      v ^= v << 4;\n      v ^= v >>> 13;\n      if (j >= 0) {\n        w = (w + 0x61c88647) | 0;     // Weyl.\n        t = (X[j & 127] ^= (v + w));  // Combine xor and weyl to init array.\n        i = (0 == t) ? i + 1 : 0;     // Count zeroes.\n      }\n    }\n    // We have detected all zeroes; make the key nonzero.\n    if (i >= 128) {\n      X[(seed && seed.length || 0) & 127] = -1;\n    }\n    // Run the generator 512 times to further mix the state before using it.\n    // Factoring this as a function slows the main generator, so it is just\n    // unrolled here.  The weyl generator is not advanced while warming up.\n    i = 127;\n    for (j = 4 * 128; j > 0; --j) {\n      v = X[(i + 34) & 127];\n      t = X[i = ((i + 1) & 127)];\n      v ^= v << 13;\n      t ^= t << 17;\n      v ^= v >>> 15;\n      t ^= t >>> 12;\n      X[i] = v ^ t;\n    }\n    // Storing state as object members is faster than using closure variables.\n    me.w = w;\n    me.X = X;\n    me.i = i;\n  }\n\n  init(me, seed);\n}\n\nfunction copy(f, t) {\n  t.i = f.i;\n  t.w = f.w;\n  t.X = f.X.slice();\n  return t;\n};\n\nfunction impl(seed, opts) {\n  if (seed == null) seed = +(new Date);\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (state.X) copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.xor4096 = impl;\n}\n\n})(\n  this,                                     // window object or global\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n", "// A Javascript implementaion of the \"Tyche-i\" prng algorithm by\n// Samuel Neves and Filipe Araujo.\n// See https://eden.dei.uc.pt/~sneves/pubs/2011-snfa2.pdf\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this, strseed = '';\n\n  // Set up generator function.\n  me.next = function() {\n    var b = me.b, c = me.c, d = me.d, a = me.a;\n    b = (b << 25) ^ (b >>> 7) ^ c;\n    c = (c - d) | 0;\n    d = (d << 24) ^ (d >>> 8) ^ a;\n    a = (a - b) | 0;\n    me.b = b = (b << 20) ^ (b >>> 12) ^ c;\n    me.c = c = (c - d) | 0;\n    me.d = (d << 16) ^ (c >>> 16) ^ a;\n    return me.a = (a - b) | 0;\n  };\n\n  /* The following is non-inverted tyche, which has better internal\n   * bit diffusion, but which is about 25% slower than tyche-i in JS.\n  me.next = function() {\n    var a = me.a, b = me.b, c = me.c, d = me.d;\n    a = (me.a + me.b | 0) >>> 0;\n    d = me.d ^ a; d = d << 16 ^ d >>> 16;\n    c = me.c + d | 0;\n    b = me.b ^ c; b = b << 12 ^ d >>> 20;\n    me.a = a = a + b | 0;\n    d = d ^ a; me.d = d = d << 8 ^ d >>> 24;\n    me.c = c = c + d | 0;\n    b = b ^ c;\n    return me.b = (b << 7 ^ b >>> 25);\n  }\n  */\n\n  me.a = 0;\n  me.b = 0;\n  me.c = 2654435769 | 0;\n  me.d = 1367130551;\n\n  if (seed === Math.floor(seed)) {\n    // Integer seed.\n    me.a = (seed / 0x100000000) | 0;\n    me.b = seed | 0;\n  } else {\n    // String seed.\n    strseed += seed;\n  }\n\n  // Mix in string seed, then discard an initial batch of 64 values.\n  for (var k = 0; k < strseed.length + 20; k++) {\n    me.b ^= strseed.charCodeAt(k) | 0;\n    me.next();\n  }\n}\n\nfunction copy(f, t) {\n  t.a = f.a;\n  t.b = f.b;\n  t.c = f.c;\n  t.d = f.d;\n  return t;\n};\n\nfunction impl(seed, opts) {\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (typeof(state) == 'object') copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.tychei = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n\n", "/*\nCopyright 2019 David Bau.\n\nPermission is hereby granted, free of charge, to any person obtaining\na copy of this software and associated documentation files (the\n\"Software\"), to deal in the Software without restriction, including\nwithout limitation the rights to use, copy, modify, merge, publish,\ndistribute, sublicense, and/or sell copies of the Software, and to\npermit persons to whom the Software is furnished to do so, subject to\nthe following conditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\nCLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\nSOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n*/\n\n(function (global, pool, math) {\n//\n// The following constants are related to IEEE 754 limits.\n//\n\nvar width = 256,        // each RC4 output is 0 <= x < 256\n    chunks = 6,         // at least six RC4 outputs for each double\n    digits = 52,        // there are 52 significant digits in a double\n    rngname = 'random', // rngname: name for Math.random and Math.seedrandom\n    startdenom = math.pow(width, chunks),\n    significance = math.pow(2, digits),\n    overflow = significance * 2,\n    mask = width - 1,\n    nodecrypto;         // node.js crypto module, initialized at the bottom.\n\n//\n// seedrandom()\n// This is the seedrandom function described above.\n//\nfunction seedrandom(seed, options, callback) {\n  var key = [];\n  options = (options == true) ? { entropy: true } : (options || {});\n\n  // Flatten the seed string or build one from local entropy if needed.\n  var shortseed = mixkey(flatten(\n    options.entropy ? [seed, tostring(pool)] :\n    (seed == null) ? autoseed() : seed, 3), key);\n\n  // Use the seed to initialize an ARC4 generator.\n  var arc4 = new ARC4(key);\n\n  // This function returns a random double in [0, 1) that contains\n  // randomness in every bit of the mantissa of the IEEE 754 value.\n  var prng = function() {\n    var n = arc4.g(chunks),             // Start with a numerator n < 2 ^ 48\n        d = startdenom,                 //   and denominator d = 2 ^ 48.\n        x = 0;                          //   and no 'extra last byte'.\n    while (n < significance) {          // Fill up all significant digits by\n      n = (n + x) * width;              //   shifting numerator and\n      d *= width;                       //   denominator and generating a\n      x = arc4.g(1);                    //   new least-significant-byte.\n    }\n    while (n >= overflow) {             // To avoid rounding up, before adding\n      n /= 2;                           //   last byte, shift everything\n      d /= 2;                           //   right using integer math until\n      x >>>= 1;                         //   we have exactly the desired bits.\n    }\n    return (n + x) / d;                 // Form the number within [0, 1).\n  };\n\n  prng.int32 = function() { return arc4.g(4) | 0; }\n  prng.quick = function() { return arc4.g(4) / 0x100000000; }\n  prng.double = prng;\n\n  // Mix the randomness into accumulated entropy.\n  mixkey(tostring(arc4.S), pool);\n\n  // Calling convention: what to return as a function of prng, seed, is_math.\n  return (options.pass || callback ||\n      function(prng, seed, is_math_call, state) {\n        if (state) {\n          // Load the arc4 state from the given state if it has an S array.\n          if (state.S) { copy(state, arc4); }\n          // Only provide the .state method if requested via options.state.\n          prng.state = function() { return copy(arc4, {}); }\n        }\n\n        // If called as a method of Math (Math.seedrandom()), mutate\n        // Math.random because that is how seedrandom.js has worked since v1.0.\n        if (is_math_call) { math[rngname] = prng; return seed; }\n\n        // Otherwise, it is a newer calling convention, so return the\n        // prng directly.\n        else return prng;\n      })(\n  prng,\n  shortseed,\n  'global' in options ? options.global : (this == math),\n  options.state);\n}\n\n//\n// ARC4\n//\n// An ARC4 implementation.  The constructor takes a key in the form of\n// an array of at most (width) integers that should be 0 <= x < (width).\n//\n// The g(count) method returns a pseudorandom integer that concatenates\n// the next (count) outputs from ARC4.  Its return value is a number x\n// that is in the range 0 <= x < (width ^ count).\n//\nfunction ARC4(key) {\n  var t, keylen = key.length,\n      me = this, i = 0, j = me.i = me.j = 0, s = me.S = [];\n\n  // The empty key [] is treated as [0].\n  if (!keylen) { key = [keylen++]; }\n\n  // Set up S using the standard key scheduling algorithm.\n  while (i < width) {\n    s[i] = i++;\n  }\n  for (i = 0; i < width; i++) {\n    s[i] = s[j = mask & (j + key[i % keylen] + (t = s[i]))];\n    s[j] = t;\n  }\n\n  // The \"g\" method returns the next (count) outputs as one number.\n  (me.g = function(count) {\n    // Using instance members instead of closure state nearly doubles speed.\n    var t, r = 0,\n        i = me.i, j = me.j, s = me.S;\n    while (count--) {\n      t = s[i = mask & (i + 1)];\n      r = r * width + s[mask & ((s[i] = s[j = mask & (j + t)]) + (s[j] = t))];\n    }\n    me.i = i; me.j = j;\n    return r;\n    // For robust unpredictability, the function call below automatically\n    // discards an initial batch of values.  This is called RC4-drop[256].\n    // See http://google.com/search?q=rsa+fluhrer+response&btnI\n  })(width);\n}\n\n//\n// copy()\n// Copies internal state of ARC4 to or from a plain object.\n//\nfunction copy(f, t) {\n  t.i = f.i;\n  t.j = f.j;\n  t.S = f.S.slice();\n  return t;\n};\n\n//\n// flatten()\n// Converts an object tree to nested arrays of strings.\n//\nfunction flatten(obj, depth) {\n  var result = [], typ = (typeof obj), prop;\n  if (depth && typ == 'object') {\n    for (prop in obj) {\n      try { result.push(flatten(obj[prop], depth - 1)); } catch (e) {}\n    }\n  }\n  return (result.length ? result : typ == 'string' ? obj : obj + '\\0');\n}\n\n//\n// mixkey()\n// Mixes a string seed into a key that is an array of integers, and\n// returns a shortened string seed that is equivalent to the result key.\n//\nfunction mixkey(seed, key) {\n  var stringseed = seed + '', smear, j = 0;\n  while (j < stringseed.length) {\n    key[mask & j] =\n      mask & ((smear ^= key[mask & j] * 19) + stringseed.charCodeAt(j++));\n  }\n  return tostring(key);\n}\n\n//\n// autoseed()\n// Returns an object for autoseeding, using window.crypto and Node crypto\n// module if available.\n//\nfunction autoseed() {\n  try {\n    var out;\n    if (nodecrypto && (out = nodecrypto.randomBytes)) {\n      // The use of 'out' to remember randomBytes makes tight minified code.\n      out = out(width);\n    } else {\n      out = new Uint8Array(width);\n      (global.crypto || global.msCrypto).getRandomValues(out);\n    }\n    return tostring(out);\n  } catch (e) {\n    var browser = global.navigator,\n        plugins = browser && browser.plugins;\n    return [+new Date, global, plugins, global.screen, tostring(pool)];\n  }\n}\n\n//\n// tostring()\n// Converts an array of charcodes to a string\n//\nfunction tostring(a) {\n  return String.fromCharCode.apply(0, a);\n}\n\n//\n// When seedrandom.js is loaded, we immediately mix a few bits\n// from the built-in RNG into the entropy pool.  Because we do\n// not want to interfere with deterministic PRNG state later,\n// seedrandom will not call math.random on its own again after\n// initialization.\n//\nmixkey(math.random(), pool);\n\n//\n// Nodejs and AMD support: export the implementation as a module using\n// either convention.\n//\nif ((typeof module) == 'object' && module.exports) {\n  module.exports = seedrandom;\n  // When in node.js, try using crypto package for autoseeding.\n  try {\n    nodecrypto = require('crypto');\n  } catch (ex) {}\n} else if ((typeof define) == 'function' && define.amd) {\n  define(function() { return seedrandom; });\n} else {\n  // When included as a plain script, set up Math.seedrandom global.\n  math['seed' + rngname] = seedrandom;\n}\n\n\n// End anonymous scope, and pass initial values.\n})(\n  // global: `self` in browsers (including strict mode and web workers),\n  // otherwise `this` in Node and other environments\n  (typeof self !== 'undefined') ? self : this,\n  [],     // pool: entropy pool starts empty\n  Math    // math: package containing random, pow, and seedrandom\n);\n", "// A library of seedable RNGs implemented in Javascript.\n//\n// Usage:\n//\n// var seedrandom = require('seedrandom');\n// var random = seedrandom(1); // or any seed.\n// var x = random();       // 0 <= x < 1.  Every bit is random.\n// var x = random.quick(); // 0 <= x < 1.  32 bits of randomness.\n\n// alea, a 53-bit multiply-with-carry generator by Johannes Baag\u00F8e.\n// Period: ~2^116\n// Reported to pass all BigCrush tests.\nvar alea = require('./lib/alea');\n\n// xor128, a pure xor-shift generator by George Marsaglia.\n// Period: 2^128-1.\n// Reported to fail: MatrixRank and LinearComp.\nvar xor128 = require('./lib/xor128');\n\n// xorwow, George Marsaglia's 160-bit xor-shift combined plus weyl.\n// Period: 2^192-2^32\n// Reported to fail: CollisionOver, SimpPoker, and LinearComp.\nvar xorwow = require('./lib/xorwow');\n\n// xorshift7, by Fran\u00E7ois Panneton and Pierre L'ecuyer, takes\n// a different approach: it adds robustness by allowing more shifts\n// than Marsaglia's original three.  It is a 7-shift generator\n// with 256 bits, that passes BigCrush with no systmatic failures.\n// Period 2^256-1.\n// No systematic BigCrush failures reported.\nvar xorshift7 = require('./lib/xorshift7');\n\n// xor4096, by Richard Brent, is a 4096-bit xor-shift with a\n// very long period that also adds a Weyl generator. It also passes\n// BigCrush with no systematic failures.  Its long period may\n// be useful if you have many generators and need to avoid\n// collisions.\n// Period: 2^4128-2^32.\n// No systematic BigCrush failures reported.\nvar xor4096 = require('./lib/xor4096');\n\n// Tyche-i, by Samuel Neves and Filipe Araujo, is a bit-shifting random\n// number generator derived from ChaCha, a modern stream cipher.\n// https://eden.dei.uc.pt/~sneves/pubs/2011-snfa2.pdf\n// Period: ~2^127\n// No systematic BigCrush failures reported.\nvar tychei = require('./lib/tychei');\n\n// The original ARC4-based prng included in this library.\n// Period: ~2^1600\nvar sr = require('./seedrandom');\n\nsr.alea = alea;\nsr.xor128 = xor128;\nsr.xorwow = xorwow;\nsr.xorshift7 = xorshift7;\nsr.xor4096 = xor4096;\nsr.tychei = tychei;\n\nmodule.exports = sr;\n", "/*!\nTurbo 8.0.13\nCopyright \u00A9 2025 37signals LLC\n */\n/**\n * The MIT License (MIT)\n *\n * Copyright (c) 2019 Javan Makhmali\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n */\n\n(function (prototype) {\n  if (typeof prototype.requestSubmit == \"function\") return\n\n  prototype.requestSubmit = function (submitter) {\n    if (submitter) {\n      validateSubmitter(submitter, this);\n      submitter.click();\n    } else {\n      submitter = document.createElement(\"input\");\n      submitter.type = \"submit\";\n      submitter.hidden = true;\n      this.appendChild(submitter);\n      submitter.click();\n      this.removeChild(submitter);\n    }\n  };\n\n  function validateSubmitter(submitter, form) {\n    submitter instanceof HTMLElement || raise(TypeError, \"parameter 1 is not of type 'HTMLElement'\");\n    submitter.type == \"submit\" || raise(TypeError, \"The specified element is not a submit button\");\n    submitter.form == form ||\n      raise(DOMException, \"The specified element is not owned by this form element\", \"NotFoundError\");\n  }\n\n  function raise(errorConstructor, message, name) {\n    throw new errorConstructor(\"Failed to execute 'requestSubmit' on 'HTMLFormElement': \" + message + \".\", name)\n  }\n})(HTMLFormElement.prototype);\n\nconst submittersByForm = new WeakMap();\n\nfunction findSubmitterFromClickTarget(target) {\n  const element = target instanceof Element ? target : target instanceof Node ? target.parentElement : null;\n  const candidate = element ? element.closest(\"input, button\") : null;\n  return candidate?.type == \"submit\" ? candidate : null\n}\n\nfunction clickCaptured(event) {\n  const submitter = findSubmitterFromClickTarget(event.target);\n\n  if (submitter && submitter.form) {\n    submittersByForm.set(submitter.form, submitter);\n  }\n}\n\n(function () {\n  if (\"submitter\" in Event.prototype) return\n\n  let prototype = window.Event.prototype;\n  // Certain versions of Safari 15 have a bug where they won't\n  // populate the submitter. This hurts TurboDrive's enable/disable detection.\n  // See https://bugs.webkit.org/show_bug.cgi?id=229660\n  if (\"SubmitEvent\" in window) {\n    const prototypeOfSubmitEvent = window.SubmitEvent.prototype;\n\n    if (/Apple Computer/.test(navigator.vendor) && !(\"submitter\" in prototypeOfSubmitEvent)) {\n      prototype = prototypeOfSubmitEvent;\n    } else {\n      return // polyfill not needed\n    }\n  }\n\n  addEventListener(\"click\", clickCaptured, true);\n\n  Object.defineProperty(prototype, \"submitter\", {\n    get() {\n      if (this.type == \"submit\" && this.target instanceof HTMLFormElement) {\n        return submittersByForm.get(this.target)\n      }\n    }\n  });\n})();\n\nconst FrameLoadingStyle = {\n  eager: \"eager\",\n  lazy: \"lazy\"\n};\n\n/**\n * Contains a fragment of HTML which is updated based on navigation within\n * it (e.g. via links or form submissions).\n *\n * @customElement turbo-frame\n * @example\n *   <turbo-frame id=\"messages\">\n *     <a href=\"/messages/expanded\">\n *       Show all expanded messages in this frame.\n *     </a>\n *\n *     <form action=\"/messages\">\n *       Show response from this form within this frame.\n *     </form>\n *   </turbo-frame>\n */\nclass FrameElement extends HTMLElement {\n  static delegateConstructor = undefined\n\n  loaded = Promise.resolve()\n\n  static get observedAttributes() {\n    return [\"disabled\", \"loading\", \"src\"]\n  }\n\n  constructor() {\n    super();\n    this.delegate = new FrameElement.delegateConstructor(this);\n  }\n\n  connectedCallback() {\n    this.delegate.connect();\n  }\n\n  disconnectedCallback() {\n    this.delegate.disconnect();\n  }\n\n  reload() {\n    return this.delegate.sourceURLReloaded()\n  }\n\n  attributeChangedCallback(name) {\n    if (name == \"loading\") {\n      this.delegate.loadingStyleChanged();\n    } else if (name == \"src\") {\n      this.delegate.sourceURLChanged();\n    } else if (name == \"disabled\") {\n      this.delegate.disabledChanged();\n    }\n  }\n\n  /**\n   * Gets the URL to lazily load source HTML from\n   */\n  get src() {\n    return this.getAttribute(\"src\")\n  }\n\n  /**\n   * Sets the URL to lazily load source HTML from\n   */\n  set src(value) {\n    if (value) {\n      this.setAttribute(\"src\", value);\n    } else {\n      this.removeAttribute(\"src\");\n    }\n  }\n\n  /**\n   * Gets the refresh mode for the frame.\n   */\n  get refresh() {\n    return this.getAttribute(\"refresh\")\n  }\n\n  /**\n   * Sets the refresh mode for the frame.\n   */\n  set refresh(value) {\n    if (value) {\n      this.setAttribute(\"refresh\", value);\n    } else {\n      this.removeAttribute(\"refresh\");\n    }\n  }\n\n  get shouldReloadWithMorph() {\n    return this.src && this.refresh === \"morph\"\n  }\n\n  /**\n   * Determines if the element is loading\n   */\n  get loading() {\n    return frameLoadingStyleFromString(this.getAttribute(\"loading\") || \"\")\n  }\n\n  /**\n   * Sets the value of if the element is loading\n   */\n  set loading(value) {\n    if (value) {\n      this.setAttribute(\"loading\", value);\n    } else {\n      this.removeAttribute(\"loading\");\n    }\n  }\n\n  /**\n   * Gets the disabled state of the frame.\n   *\n   * If disabled, no requests will be intercepted by the frame.\n   */\n  get disabled() {\n    return this.hasAttribute(\"disabled\")\n  }\n\n  /**\n   * Sets the disabled state of the frame.\n   *\n   * If disabled, no requests will be intercepted by the frame.\n   */\n  set disabled(value) {\n    if (value) {\n      this.setAttribute(\"disabled\", \"\");\n    } else {\n      this.removeAttribute(\"disabled\");\n    }\n  }\n\n  /**\n   * Gets the autoscroll state of the frame.\n   *\n   * If true, the frame will be scrolled into view automatically on update.\n   */\n  get autoscroll() {\n    return this.hasAttribute(\"autoscroll\")\n  }\n\n  /**\n   * Sets the autoscroll state of the frame.\n   *\n   * If true, the frame will be scrolled into view automatically on update.\n   */\n  set autoscroll(value) {\n    if (value) {\n      this.setAttribute(\"autoscroll\", \"\");\n    } else {\n      this.removeAttribute(\"autoscroll\");\n    }\n  }\n\n  /**\n   * Determines if the element has finished loading\n   */\n  get complete() {\n    return !this.delegate.isLoading\n  }\n\n  /**\n   * Gets the active state of the frame.\n   *\n   * If inactive, source changes will not be observed.\n   */\n  get isActive() {\n    return this.ownerDocument === document && !this.isPreview\n  }\n\n  /**\n   * Sets the active state of the frame.\n   *\n   * If inactive, source changes will not be observed.\n   */\n  get isPreview() {\n    return this.ownerDocument?.documentElement?.hasAttribute(\"data-turbo-preview\")\n  }\n}\n\nfunction frameLoadingStyleFromString(style) {\n  switch (style.toLowerCase()) {\n    case \"lazy\":\n      return FrameLoadingStyle.lazy\n    default:\n      return FrameLoadingStyle.eager\n  }\n}\n\nconst drive = {\n  enabled: true,\n  progressBarDelay: 500,\n  unvisitableExtensions: new Set(\n    [\n      \".7z\", \".aac\", \".apk\", \".avi\", \".bmp\", \".bz2\", \".css\", \".csv\", \".deb\", \".dmg\", \".doc\",\n      \".docx\", \".exe\", \".gif\", \".gz\", \".heic\", \".heif\", \".ico\", \".iso\", \".jpeg\", \".jpg\",\n      \".js\", \".json\", \".m4a\", \".mkv\", \".mov\", \".mp3\", \".mp4\", \".mpeg\", \".mpg\", \".msi\",\n      \".ogg\", \".ogv\", \".pdf\", \".pkg\", \".png\", \".ppt\", \".pptx\", \".rar\", \".rtf\",\n      \".svg\", \".tar\", \".tif\", \".tiff\", \".txt\", \".wav\", \".webm\", \".webp\", \".wma\", \".wmv\",\n      \".xls\", \".xlsx\", \".xml\", \".zip\"\n    ]\n  )\n};\n\nfunction activateScriptElement(element) {\n  if (element.getAttribute(\"data-turbo-eval\") == \"false\") {\n    return element\n  } else {\n    const createdScriptElement = document.createElement(\"script\");\n    const cspNonce = getCspNonce();\n    if (cspNonce) {\n      createdScriptElement.nonce = cspNonce;\n    }\n    createdScriptElement.textContent = element.textContent;\n    createdScriptElement.async = false;\n    copyElementAttributes(createdScriptElement, element);\n    return createdScriptElement\n  }\n}\n\nfunction copyElementAttributes(destinationElement, sourceElement) {\n  for (const { name, value } of sourceElement.attributes) {\n    destinationElement.setAttribute(name, value);\n  }\n}\n\nfunction createDocumentFragment(html) {\n  const template = document.createElement(\"template\");\n  template.innerHTML = html;\n  return template.content\n}\n\nfunction dispatch(eventName, { target, cancelable, detail } = {}) {\n  const event = new CustomEvent(eventName, {\n    cancelable,\n    bubbles: true,\n    composed: true,\n    detail\n  });\n\n  if (target && target.isConnected) {\n    target.dispatchEvent(event);\n  } else {\n    document.documentElement.dispatchEvent(event);\n  }\n\n  return event\n}\n\nfunction cancelEvent(event) {\n  event.preventDefault();\n  event.stopImmediatePropagation();\n}\n\nfunction nextRepaint() {\n  if (document.visibilityState === \"hidden\") {\n    return nextEventLoopTick()\n  } else {\n    return nextAnimationFrame()\n  }\n}\n\nfunction nextAnimationFrame() {\n  return new Promise((resolve) => requestAnimationFrame(() => resolve()))\n}\n\nfunction nextEventLoopTick() {\n  return new Promise((resolve) => setTimeout(() => resolve(), 0))\n}\n\nfunction nextMicrotask() {\n  return Promise.resolve()\n}\n\nfunction parseHTMLDocument(html = \"\") {\n  return new DOMParser().parseFromString(html, \"text/html\")\n}\n\nfunction unindent(strings, ...values) {\n  const lines = interpolate(strings, values).replace(/^\\n/, \"\").split(\"\\n\");\n  const match = lines[0].match(/^\\s+/);\n  const indent = match ? match[0].length : 0;\n  return lines.map((line) => line.slice(indent)).join(\"\\n\")\n}\n\nfunction interpolate(strings, values) {\n  return strings.reduce((result, string, i) => {\n    const value = values[i] == undefined ? \"\" : values[i];\n    return result + string + value\n  }, \"\")\n}\n\nfunction uuid() {\n  return Array.from({ length: 36 })\n    .map((_, i) => {\n      if (i == 8 || i == 13 || i == 18 || i == 23) {\n        return \"-\"\n      } else if (i == 14) {\n        return \"4\"\n      } else if (i == 19) {\n        return (Math.floor(Math.random() * 4) + 8).toString(16)\n      } else {\n        return Math.floor(Math.random() * 15).toString(16)\n      }\n    })\n    .join(\"\")\n}\n\nfunction getAttribute(attributeName, ...elements) {\n  for (const value of elements.map((element) => element?.getAttribute(attributeName))) {\n    if (typeof value == \"string\") return value\n  }\n\n  return null\n}\n\nfunction hasAttribute(attributeName, ...elements) {\n  return elements.some((element) => element && element.hasAttribute(attributeName))\n}\n\nfunction markAsBusy(...elements) {\n  for (const element of elements) {\n    if (element.localName == \"turbo-frame\") {\n      element.setAttribute(\"busy\", \"\");\n    }\n    element.setAttribute(\"aria-busy\", \"true\");\n  }\n}\n\nfunction clearBusyState(...elements) {\n  for (const element of elements) {\n    if (element.localName == \"turbo-frame\") {\n      element.removeAttribute(\"busy\");\n    }\n\n    element.removeAttribute(\"aria-busy\");\n  }\n}\n\nfunction waitForLoad(element, timeoutInMilliseconds = 2000) {\n  return new Promise((resolve) => {\n    const onComplete = () => {\n      element.removeEventListener(\"error\", onComplete);\n      element.removeEventListener(\"load\", onComplete);\n      resolve();\n    };\n\n    element.addEventListener(\"load\", onComplete, { once: true });\n    element.addEventListener(\"error\", onComplete, { once: true });\n    setTimeout(resolve, timeoutInMilliseconds);\n  })\n}\n\nfunction getHistoryMethodForAction(action) {\n  switch (action) {\n    case \"replace\":\n      return history.replaceState\n    case \"advance\":\n    case \"restore\":\n      return history.pushState\n  }\n}\n\nfunction isAction(action) {\n  return action == \"advance\" || action == \"replace\" || action == \"restore\"\n}\n\nfunction getVisitAction(...elements) {\n  const action = getAttribute(\"data-turbo-action\", ...elements);\n\n  return isAction(action) ? action : null\n}\n\nfunction getMetaElement(name) {\n  return document.querySelector(`meta[name=\"${name}\"]`)\n}\n\nfunction getMetaContent(name) {\n  const element = getMetaElement(name);\n  return element && element.content\n}\n\nfunction getCspNonce() {\n  const element = getMetaElement(\"csp-nonce\");\n\n  if (element) {\n    const { nonce, content } = element;\n    return nonce == \"\" ? content : nonce\n  }\n}\n\nfunction setMetaContent(name, content) {\n  let element = getMetaElement(name);\n\n  if (!element) {\n    element = document.createElement(\"meta\");\n    element.setAttribute(\"name\", name);\n\n    document.head.appendChild(element);\n  }\n\n  element.setAttribute(\"content\", content);\n\n  return element\n}\n\nfunction findClosestRecursively(element, selector) {\n  if (element instanceof Element) {\n    return (\n      element.closest(selector) || findClosestRecursively(element.assignedSlot || element.getRootNode()?.host, selector)\n    )\n  }\n}\n\nfunction elementIsFocusable(element) {\n  const inertDisabledOrHidden = \"[inert], :disabled, [hidden], details:not([open]), dialog:not([open])\";\n\n  return !!element && element.closest(inertDisabledOrHidden) == null && typeof element.focus == \"function\"\n}\n\nfunction queryAutofocusableElement(elementOrDocumentFragment) {\n  return Array.from(elementOrDocumentFragment.querySelectorAll(\"[autofocus]\")).find(elementIsFocusable)\n}\n\nasync function around(callback, reader) {\n  const before = reader();\n\n  callback();\n\n  await nextAnimationFrame();\n\n  const after = reader();\n\n  return [before, after]\n}\n\nfunction doesNotTargetIFrame(name) {\n  if (name === \"_blank\") {\n    return false\n  } else if (name) {\n    for (const element of document.getElementsByName(name)) {\n      if (element instanceof HTMLIFrameElement) return false\n    }\n\n    return true\n  } else {\n    return true\n  }\n}\n\nfunction findLinkFromClickTarget(target) {\n  return findClosestRecursively(target, \"a[href]:not([target^=_]):not([download])\")\n}\n\nfunction getLocationForLink(link) {\n  return expandURL(link.getAttribute(\"href\") || \"\")\n}\n\nfunction debounce(fn, delay) {\n  let timeoutId = null;\n\n  return (...args) => {\n    const callback = () => fn.apply(this, args);\n    clearTimeout(timeoutId);\n    timeoutId = setTimeout(callback, delay);\n  }\n}\n\nconst submitter = {\n  \"aria-disabled\": {\n    beforeSubmit: submitter => {\n      submitter.setAttribute(\"aria-disabled\", \"true\");\n      submitter.addEventListener(\"click\", cancelEvent);\n    },\n\n    afterSubmit: submitter => {\n      submitter.removeAttribute(\"aria-disabled\");\n      submitter.removeEventListener(\"click\", cancelEvent);\n    }\n  },\n\n  \"disabled\": {\n    beforeSubmit: submitter => submitter.disabled = true,\n    afterSubmit: submitter => submitter.disabled = false\n  }\n};\n\nclass Config {\n  #submitter = null\n\n  constructor(config) {\n    Object.assign(this, config);\n  }\n\n  get submitter() {\n    return this.#submitter\n  }\n\n  set submitter(value) {\n    this.#submitter = submitter[value] || value;\n  }\n}\n\nconst forms = new Config({\n  mode: \"on\",\n  submitter: \"disabled\"\n});\n\nconst config = {\n  drive,\n  forms\n};\n\nfunction expandURL(locatable) {\n  return new URL(locatable.toString(), document.baseURI)\n}\n\nfunction getAnchor(url) {\n  let anchorMatch;\n  if (url.hash) {\n    return url.hash.slice(1)\n    // eslint-disable-next-line no-cond-assign\n  } else if ((anchorMatch = url.href.match(/#(.*)$/))) {\n    return anchorMatch[1]\n  }\n}\n\nfunction getAction$1(form, submitter) {\n  const action = submitter?.getAttribute(\"formaction\") || form.getAttribute(\"action\") || form.action;\n\n  return expandURL(action)\n}\n\nfunction getExtension(url) {\n  return (getLastPathComponent(url).match(/\\.[^.]*$/) || [])[0] || \"\"\n}\n\nfunction isPrefixedBy(baseURL, url) {\n  const prefix = getPrefix(url);\n  return baseURL.href === expandURL(prefix).href || baseURL.href.startsWith(prefix)\n}\n\nfunction locationIsVisitable(location, rootLocation) {\n  return isPrefixedBy(location, rootLocation) && !config.drive.unvisitableExtensions.has(getExtension(location))\n}\n\nfunction getRequestURL(url) {\n  const anchor = getAnchor(url);\n  return anchor != null ? url.href.slice(0, -(anchor.length + 1)) : url.href\n}\n\nfunction toCacheKey(url) {\n  return getRequestURL(url)\n}\n\nfunction urlsAreEqual(left, right) {\n  return expandURL(left).href == expandURL(right).href\n}\n\nfunction getPathComponents(url) {\n  return url.pathname.split(\"/\").slice(1)\n}\n\nfunction getLastPathComponent(url) {\n  return getPathComponents(url).slice(-1)[0]\n}\n\nfunction getPrefix(url) {\n  return addTrailingSlash(url.origin + url.pathname)\n}\n\nfunction addTrailingSlash(value) {\n  return value.endsWith(\"/\") ? value : value + \"/\"\n}\n\nclass FetchResponse {\n  constructor(response) {\n    this.response = response;\n  }\n\n  get succeeded() {\n    return this.response.ok\n  }\n\n  get failed() {\n    return !this.succeeded\n  }\n\n  get clientError() {\n    return this.statusCode >= 400 && this.statusCode <= 499\n  }\n\n  get serverError() {\n    return this.statusCode >= 500 && this.statusCode <= 599\n  }\n\n  get redirected() {\n    return this.response.redirected\n  }\n\n  get location() {\n    return expandURL(this.response.url)\n  }\n\n  get isHTML() {\n    return this.contentType && this.contentType.match(/^(?:text\\/([^\\s;,]+\\b)?html|application\\/xhtml\\+xml)\\b/)\n  }\n\n  get statusCode() {\n    return this.response.status\n  }\n\n  get contentType() {\n    return this.header(\"Content-Type\")\n  }\n\n  get responseText() {\n    return this.response.clone().text()\n  }\n\n  get responseHTML() {\n    if (this.isHTML) {\n      return this.response.clone().text()\n    } else {\n      return Promise.resolve(undefined)\n    }\n  }\n\n  header(name) {\n    return this.response.headers.get(name)\n  }\n}\n\nclass LimitedSet extends Set {\n  constructor(maxSize) {\n    super();\n    this.maxSize = maxSize;\n  }\n\n  add(value) {\n    if (this.size >= this.maxSize) {\n      const iterator = this.values();\n      const oldestValue = iterator.next().value;\n      this.delete(oldestValue);\n    }\n    super.add(value);\n  }\n}\n\nconst recentRequests = new LimitedSet(20);\n\nconst nativeFetch = window.fetch;\n\nfunction fetchWithTurboHeaders(url, options = {}) {\n  const modifiedHeaders = new Headers(options.headers || {});\n  const requestUID = uuid();\n  recentRequests.add(requestUID);\n  modifiedHeaders.append(\"X-Turbo-Request-Id\", requestUID);\n\n  return nativeFetch(url, {\n    ...options,\n    headers: modifiedHeaders\n  })\n}\n\nfunction fetchMethodFromString(method) {\n  switch (method.toLowerCase()) {\n    case \"get\":\n      return FetchMethod.get\n    case \"post\":\n      return FetchMethod.post\n    case \"put\":\n      return FetchMethod.put\n    case \"patch\":\n      return FetchMethod.patch\n    case \"delete\":\n      return FetchMethod.delete\n  }\n}\n\nconst FetchMethod = {\n  get: \"get\",\n  post: \"post\",\n  put: \"put\",\n  patch: \"patch\",\n  delete: \"delete\"\n};\n\nfunction fetchEnctypeFromString(encoding) {\n  switch (encoding.toLowerCase()) {\n    case FetchEnctype.multipart:\n      return FetchEnctype.multipart\n    case FetchEnctype.plain:\n      return FetchEnctype.plain\n    default:\n      return FetchEnctype.urlEncoded\n  }\n}\n\nconst FetchEnctype = {\n  urlEncoded: \"application/x-www-form-urlencoded\",\n  multipart: \"multipart/form-data\",\n  plain: \"text/plain\"\n};\n\nclass FetchRequest {\n  abortController = new AbortController()\n  #resolveRequestPromise = (_value) => {}\n\n  constructor(delegate, method, location, requestBody = new URLSearchParams(), target = null, enctype = FetchEnctype.urlEncoded) {\n    const [url, body] = buildResourceAndBody(expandURL(location), method, requestBody, enctype);\n\n    this.delegate = delegate;\n    this.url = url;\n    this.target = target;\n    this.fetchOptions = {\n      credentials: \"same-origin\",\n      redirect: \"follow\",\n      method: method.toUpperCase(),\n      headers: { ...this.defaultHeaders },\n      body: body,\n      signal: this.abortSignal,\n      referrer: this.delegate.referrer?.href\n    };\n    this.enctype = enctype;\n  }\n\n  get method() {\n    return this.fetchOptions.method\n  }\n\n  set method(value) {\n    const fetchBody = this.isSafe ? this.url.searchParams : this.fetchOptions.body || new FormData();\n    const fetchMethod = fetchMethodFromString(value) || FetchMethod.get;\n\n    this.url.search = \"\";\n\n    const [url, body] = buildResourceAndBody(this.url, fetchMethod, fetchBody, this.enctype);\n\n    this.url = url;\n    this.fetchOptions.body = body;\n    this.fetchOptions.method = fetchMethod.toUpperCase();\n  }\n\n  get headers() {\n    return this.fetchOptions.headers\n  }\n\n  set headers(value) {\n    this.fetchOptions.headers = value;\n  }\n\n  get body() {\n    if (this.isSafe) {\n      return this.url.searchParams\n    } else {\n      return this.fetchOptions.body\n    }\n  }\n\n  set body(value) {\n    this.fetchOptions.body = value;\n  }\n\n  get location() {\n    return this.url\n  }\n\n  get params() {\n    return this.url.searchParams\n  }\n\n  get entries() {\n    return this.body ? Array.from(this.body.entries()) : []\n  }\n\n  cancel() {\n    this.abortController.abort();\n  }\n\n  async perform() {\n    const { fetchOptions } = this;\n    this.delegate.prepareRequest(this);\n    const event = await this.#allowRequestToBeIntercepted(fetchOptions);\n    try {\n      this.delegate.requestStarted(this);\n\n      if (event.detail.fetchRequest) {\n        this.response = event.detail.fetchRequest.response;\n      } else {\n        this.response = fetchWithTurboHeaders(this.url.href, fetchOptions);\n      }\n\n      const response = await this.response;\n      return await this.receive(response)\n    } catch (error) {\n      if (error.name !== \"AbortError\") {\n        if (this.#willDelegateErrorHandling(error)) {\n          this.delegate.requestErrored(this, error);\n        }\n        throw error\n      }\n    } finally {\n      this.delegate.requestFinished(this);\n    }\n  }\n\n  async receive(response) {\n    const fetchResponse = new FetchResponse(response);\n    const event = dispatch(\"turbo:before-fetch-response\", {\n      cancelable: true,\n      detail: { fetchResponse },\n      target: this.target\n    });\n    if (event.defaultPrevented) {\n      this.delegate.requestPreventedHandlingResponse(this, fetchResponse);\n    } else if (fetchResponse.succeeded) {\n      this.delegate.requestSucceededWithResponse(this, fetchResponse);\n    } else {\n      this.delegate.requestFailedWithResponse(this, fetchResponse);\n    }\n    return fetchResponse\n  }\n\n  get defaultHeaders() {\n    return {\n      Accept: \"text/html, application/xhtml+xml\"\n    }\n  }\n\n  get isSafe() {\n    return isSafe(this.method)\n  }\n\n  get abortSignal() {\n    return this.abortController.signal\n  }\n\n  acceptResponseType(mimeType) {\n    this.headers[\"Accept\"] = [mimeType, this.headers[\"Accept\"]].join(\", \");\n  }\n\n  async #allowRequestToBeIntercepted(fetchOptions) {\n    const requestInterception = new Promise((resolve) => (this.#resolveRequestPromise = resolve));\n    const event = dispatch(\"turbo:before-fetch-request\", {\n      cancelable: true,\n      detail: {\n        fetchOptions,\n        url: this.url,\n        resume: this.#resolveRequestPromise\n      },\n      target: this.target\n    });\n    this.url = event.detail.url;\n    if (event.defaultPrevented) await requestInterception;\n\n    return event\n  }\n\n  #willDelegateErrorHandling(error) {\n    const event = dispatch(\"turbo:fetch-request-error\", {\n      target: this.target,\n      cancelable: true,\n      detail: { request: this, error: error }\n    });\n\n    return !event.defaultPrevented\n  }\n}\n\nfunction isSafe(fetchMethod) {\n  return fetchMethodFromString(fetchMethod) == FetchMethod.get\n}\n\nfunction buildResourceAndBody(resource, method, requestBody, enctype) {\n  const searchParams =\n    Array.from(requestBody).length > 0 ? new URLSearchParams(entriesExcludingFiles(requestBody)) : resource.searchParams;\n\n  if (isSafe(method)) {\n    return [mergeIntoURLSearchParams(resource, searchParams), null]\n  } else if (enctype == FetchEnctype.urlEncoded) {\n    return [resource, searchParams]\n  } else {\n    return [resource, requestBody]\n  }\n}\n\nfunction entriesExcludingFiles(requestBody) {\n  const entries = [];\n\n  for (const [name, value] of requestBody) {\n    if (value instanceof File) continue\n    else entries.push([name, value]);\n  }\n\n  return entries\n}\n\nfunction mergeIntoURLSearchParams(url, requestBody) {\n  const searchParams = new URLSearchParams(entriesExcludingFiles(requestBody));\n\n  url.search = searchParams.toString();\n\n  return url\n}\n\nclass AppearanceObserver {\n  started = false\n\n  constructor(delegate, element) {\n    this.delegate = delegate;\n    this.element = element;\n    this.intersectionObserver = new IntersectionObserver(this.intersect);\n  }\n\n  start() {\n    if (!this.started) {\n      this.started = true;\n      this.intersectionObserver.observe(this.element);\n    }\n  }\n\n  stop() {\n    if (this.started) {\n      this.started = false;\n      this.intersectionObserver.unobserve(this.element);\n    }\n  }\n\n  intersect = (entries) => {\n    const lastEntry = entries.slice(-1)[0];\n    if (lastEntry?.isIntersecting) {\n      this.delegate.elementAppearedInViewport(this.element);\n    }\n  }\n}\n\nclass StreamMessage {\n  static contentType = \"text/vnd.turbo-stream.html\"\n\n  static wrap(message) {\n    if (typeof message == \"string\") {\n      return new this(createDocumentFragment(message))\n    } else {\n      return message\n    }\n  }\n\n  constructor(fragment) {\n    this.fragment = importStreamElements(fragment);\n  }\n}\n\nfunction importStreamElements(fragment) {\n  for (const element of fragment.querySelectorAll(\"turbo-stream\")) {\n    const streamElement = document.importNode(element, true);\n\n    for (const inertScriptElement of streamElement.templateElement.content.querySelectorAll(\"script\")) {\n      inertScriptElement.replaceWith(activateScriptElement(inertScriptElement));\n    }\n\n    element.replaceWith(streamElement);\n  }\n\n  return fragment\n}\n\nconst PREFETCH_DELAY = 100;\n\nclass PrefetchCache {\n  #prefetchTimeout = null\n  #prefetched = null\n\n  get(url) {\n    if (this.#prefetched && this.#prefetched.url === url && this.#prefetched.expire > Date.now()) {\n      return this.#prefetched.request\n    }\n  }\n\n  setLater(url, request, ttl) {\n    this.clear();\n\n    this.#prefetchTimeout = setTimeout(() => {\n      request.perform();\n      this.set(url, request, ttl);\n      this.#prefetchTimeout = null;\n    }, PREFETCH_DELAY);\n  }\n\n  set(url, request, ttl) {\n    this.#prefetched = { url, request, expire: new Date(new Date().getTime() + ttl) };\n  }\n\n  clear() {\n    if (this.#prefetchTimeout) clearTimeout(this.#prefetchTimeout);\n    this.#prefetched = null;\n  }\n}\n\nconst cacheTtl = 10 * 1000;\nconst prefetchCache = new PrefetchCache();\n\nconst FormSubmissionState = {\n  initialized: \"initialized\",\n  requesting: \"requesting\",\n  waiting: \"waiting\",\n  receiving: \"receiving\",\n  stopping: \"stopping\",\n  stopped: \"stopped\"\n};\n\nclass FormSubmission {\n  state = FormSubmissionState.initialized\n\n  static confirmMethod(message) {\n    return Promise.resolve(confirm(message))\n  }\n\n  constructor(delegate, formElement, submitter, mustRedirect = false) {\n    const method = getMethod(formElement, submitter);\n    const action = getAction(getFormAction(formElement, submitter), method);\n    const body = buildFormData(formElement, submitter);\n    const enctype = getEnctype(formElement, submitter);\n\n    this.delegate = delegate;\n    this.formElement = formElement;\n    this.submitter = submitter;\n    this.fetchRequest = new FetchRequest(this, method, action, body, formElement, enctype);\n    this.mustRedirect = mustRedirect;\n  }\n\n  get method() {\n    return this.fetchRequest.method\n  }\n\n  set method(value) {\n    this.fetchRequest.method = value;\n  }\n\n  get action() {\n    return this.fetchRequest.url.toString()\n  }\n\n  set action(value) {\n    this.fetchRequest.url = expandURL(value);\n  }\n\n  get body() {\n    return this.fetchRequest.body\n  }\n\n  get enctype() {\n    return this.fetchRequest.enctype\n  }\n\n  get isSafe() {\n    return this.fetchRequest.isSafe\n  }\n\n  get location() {\n    return this.fetchRequest.url\n  }\n\n  // The submission process\n\n  async start() {\n    const { initialized, requesting } = FormSubmissionState;\n    const confirmationMessage = getAttribute(\"data-turbo-confirm\", this.submitter, this.formElement);\n\n    if (typeof confirmationMessage === \"string\") {\n      const confirmMethod = typeof config.forms.confirm === \"function\" ?\n        config.forms.confirm :\n        FormSubmission.confirmMethod;\n\n      const answer = await confirmMethod(confirmationMessage, this.formElement, this.submitter);\n      if (!answer) {\n        return\n      }\n    }\n\n    if (this.state == initialized) {\n      this.state = requesting;\n      return this.fetchRequest.perform()\n    }\n  }\n\n  stop() {\n    const { stopping, stopped } = FormSubmissionState;\n    if (this.state != stopping && this.state != stopped) {\n      this.state = stopping;\n      this.fetchRequest.cancel();\n      return true\n    }\n  }\n\n  // Fetch request delegate\n\n  prepareRequest(request) {\n    if (!request.isSafe) {\n      const token = getCookieValue(getMetaContent(\"csrf-param\")) || getMetaContent(\"csrf-token\");\n      if (token) {\n        request.headers[\"X-CSRF-Token\"] = token;\n      }\n    }\n\n    if (this.requestAcceptsTurboStreamResponse(request)) {\n      request.acceptResponseType(StreamMessage.contentType);\n    }\n  }\n\n  requestStarted(_request) {\n    this.state = FormSubmissionState.waiting;\n    if (this.submitter) config.forms.submitter.beforeSubmit(this.submitter);\n    this.setSubmitsWith();\n    markAsBusy(this.formElement);\n    dispatch(\"turbo:submit-start\", {\n      target: this.formElement,\n      detail: { formSubmission: this }\n    });\n    this.delegate.formSubmissionStarted(this);\n  }\n\n  requestPreventedHandlingResponse(request, response) {\n    prefetchCache.clear();\n\n    this.result = { success: response.succeeded, fetchResponse: response };\n  }\n\n  requestSucceededWithResponse(request, response) {\n    if (response.clientError || response.serverError) {\n      this.delegate.formSubmissionFailedWithResponse(this, response);\n      return\n    }\n\n    prefetchCache.clear();\n\n    if (this.requestMustRedirect(request) && responseSucceededWithoutRedirect(response)) {\n      const error = new Error(\"Form responses must redirect to another location\");\n      this.delegate.formSubmissionErrored(this, error);\n    } else {\n      this.state = FormSubmissionState.receiving;\n      this.result = { success: true, fetchResponse: response };\n      this.delegate.formSubmissionSucceededWithResponse(this, response);\n    }\n  }\n\n  requestFailedWithResponse(request, response) {\n    this.result = { success: false, fetchResponse: response };\n    this.delegate.formSubmissionFailedWithResponse(this, response);\n  }\n\n  requestErrored(request, error) {\n    this.result = { success: false, error };\n    this.delegate.formSubmissionErrored(this, error);\n  }\n\n  requestFinished(_request) {\n    this.state = FormSubmissionState.stopped;\n    if (this.submitter) config.forms.submitter.afterSubmit(this.submitter);\n    this.resetSubmitterText();\n    clearBusyState(this.formElement);\n    dispatch(\"turbo:submit-end\", {\n      target: this.formElement,\n      detail: { formSubmission: this, ...this.result }\n    });\n    this.delegate.formSubmissionFinished(this);\n  }\n\n  // Private\n\n  setSubmitsWith() {\n    if (!this.submitter || !this.submitsWith) return\n\n    if (this.submitter.matches(\"button\")) {\n      this.originalSubmitText = this.submitter.innerHTML;\n      this.submitter.innerHTML = this.submitsWith;\n    } else if (this.submitter.matches(\"input\")) {\n      const input = this.submitter;\n      this.originalSubmitText = input.value;\n      input.value = this.submitsWith;\n    }\n  }\n\n  resetSubmitterText() {\n    if (!this.submitter || !this.originalSubmitText) return\n\n    if (this.submitter.matches(\"button\")) {\n      this.submitter.innerHTML = this.originalSubmitText;\n    } else if (this.submitter.matches(\"input\")) {\n      const input = this.submitter;\n      input.value = this.originalSubmitText;\n    }\n  }\n\n  requestMustRedirect(request) {\n    return !request.isSafe && this.mustRedirect\n  }\n\n  requestAcceptsTurboStreamResponse(request) {\n    return !request.isSafe || hasAttribute(\"data-turbo-stream\", this.submitter, this.formElement)\n  }\n\n  get submitsWith() {\n    return this.submitter?.getAttribute(\"data-turbo-submits-with\")\n  }\n}\n\nfunction buildFormData(formElement, submitter) {\n  const formData = new FormData(formElement);\n  const name = submitter?.getAttribute(\"name\");\n  const value = submitter?.getAttribute(\"value\");\n\n  if (name) {\n    formData.append(name, value || \"\");\n  }\n\n  return formData\n}\n\nfunction getCookieValue(cookieName) {\n  if (cookieName != null) {\n    const cookies = document.cookie ? document.cookie.split(\"; \") : [];\n    const cookie = cookies.find((cookie) => cookie.startsWith(cookieName));\n    if (cookie) {\n      const value = cookie.split(\"=\").slice(1).join(\"=\");\n      return value ? decodeURIComponent(value) : undefined\n    }\n  }\n}\n\nfunction responseSucceededWithoutRedirect(response) {\n  return response.statusCode == 200 && !response.redirected\n}\n\nfunction getFormAction(formElement, submitter) {\n  const formElementAction = typeof formElement.action === \"string\" ? formElement.action : null;\n\n  if (submitter?.hasAttribute(\"formaction\")) {\n    return submitter.getAttribute(\"formaction\") || \"\"\n  } else {\n    return formElement.getAttribute(\"action\") || formElementAction || \"\"\n  }\n}\n\nfunction getAction(formAction, fetchMethod) {\n  const action = expandURL(formAction);\n\n  if (isSafe(fetchMethod)) {\n    action.search = \"\";\n  }\n\n  return action\n}\n\nfunction getMethod(formElement, submitter) {\n  const method = submitter?.getAttribute(\"formmethod\") || formElement.getAttribute(\"method\") || \"\";\n  return fetchMethodFromString(method.toLowerCase()) || FetchMethod.get\n}\n\nfunction getEnctype(formElement, submitter) {\n  return fetchEnctypeFromString(submitter?.getAttribute(\"formenctype\") || formElement.enctype)\n}\n\nclass Snapshot {\n  constructor(element) {\n    this.element = element;\n  }\n\n  get activeElement() {\n    return this.element.ownerDocument.activeElement\n  }\n\n  get children() {\n    return [...this.element.children]\n  }\n\n  hasAnchor(anchor) {\n    return this.getElementForAnchor(anchor) != null\n  }\n\n  getElementForAnchor(anchor) {\n    return anchor ? this.element.querySelector(`[id='${anchor}'], a[name='${anchor}']`) : null\n  }\n\n  get isConnected() {\n    return this.element.isConnected\n  }\n\n  get firstAutofocusableElement() {\n    return queryAutofocusableElement(this.element)\n  }\n\n  get permanentElements() {\n    return queryPermanentElementsAll(this.element)\n  }\n\n  getPermanentElementById(id) {\n    return getPermanentElementById(this.element, id)\n  }\n\n  getPermanentElementMapForSnapshot(snapshot) {\n    const permanentElementMap = {};\n\n    for (const currentPermanentElement of this.permanentElements) {\n      const { id } = currentPermanentElement;\n      const newPermanentElement = snapshot.getPermanentElementById(id);\n      if (newPermanentElement) {\n        permanentElementMap[id] = [currentPermanentElement, newPermanentElement];\n      }\n    }\n\n    return permanentElementMap\n  }\n}\n\nfunction getPermanentElementById(node, id) {\n  return node.querySelector(`#${id}[data-turbo-permanent]`)\n}\n\nfunction queryPermanentElementsAll(node) {\n  return node.querySelectorAll(\"[id][data-turbo-permanent]\")\n}\n\nclass FormSubmitObserver {\n  started = false\n\n  constructor(delegate, eventTarget) {\n    this.delegate = delegate;\n    this.eventTarget = eventTarget;\n  }\n\n  start() {\n    if (!this.started) {\n      this.eventTarget.addEventListener(\"submit\", this.submitCaptured, true);\n      this.started = true;\n    }\n  }\n\n  stop() {\n    if (this.started) {\n      this.eventTarget.removeEventListener(\"submit\", this.submitCaptured, true);\n      this.started = false;\n    }\n  }\n\n  submitCaptured = () => {\n    this.eventTarget.removeEventListener(\"submit\", this.submitBubbled, false);\n    this.eventTarget.addEventListener(\"submit\", this.submitBubbled, false);\n  }\n\n  submitBubbled = (event) => {\n    if (!event.defaultPrevented) {\n      const form = event.target instanceof HTMLFormElement ? event.target : undefined;\n      const submitter = event.submitter || undefined;\n\n      if (\n        form &&\n        submissionDoesNotDismissDialog(form, submitter) &&\n        submissionDoesNotTargetIFrame(form, submitter) &&\n        this.delegate.willSubmitForm(form, submitter)\n      ) {\n        event.preventDefault();\n        event.stopImmediatePropagation();\n        this.delegate.formSubmitted(form, submitter);\n      }\n    }\n  }\n}\n\nfunction submissionDoesNotDismissDialog(form, submitter) {\n  const method = submitter?.getAttribute(\"formmethod\") || form.getAttribute(\"method\");\n\n  return method != \"dialog\"\n}\n\nfunction submissionDoesNotTargetIFrame(form, submitter) {\n  const target = submitter?.getAttribute(\"formtarget\") || form.getAttribute(\"target\");\n\n  return doesNotTargetIFrame(target)\n}\n\nclass View {\n  #resolveRenderPromise = (_value) => {}\n  #resolveInterceptionPromise = (_value) => {}\n\n  constructor(delegate, element) {\n    this.delegate = delegate;\n    this.element = element;\n  }\n\n  // Scrolling\n\n  scrollToAnchor(anchor) {\n    const element = this.snapshot.getElementForAnchor(anchor);\n    if (element) {\n      this.scrollToElement(element);\n      this.focusElement(element);\n    } else {\n      this.scrollToPosition({ x: 0, y: 0 });\n    }\n  }\n\n  scrollToAnchorFromLocation(location) {\n    this.scrollToAnchor(getAnchor(location));\n  }\n\n  scrollToElement(element) {\n    element.scrollIntoView();\n  }\n\n  focusElement(element) {\n    if (element instanceof HTMLElement) {\n      if (element.hasAttribute(\"tabindex\")) {\n        element.focus();\n      } else {\n        element.setAttribute(\"tabindex\", \"-1\");\n        element.focus();\n        element.removeAttribute(\"tabindex\");\n      }\n    }\n  }\n\n  scrollToPosition({ x, y }) {\n    this.scrollRoot.scrollTo(x, y);\n  }\n\n  scrollToTop() {\n    this.scrollToPosition({ x: 0, y: 0 });\n  }\n\n  get scrollRoot() {\n    return window\n  }\n\n  // Rendering\n\n  async render(renderer) {\n    const { isPreview, shouldRender, willRender, newSnapshot: snapshot } = renderer;\n\n    // A workaround to ignore tracked element mismatch reloads when performing\n    // a promoted Visit from a frame navigation\n    const shouldInvalidate = willRender;\n\n    if (shouldRender) {\n      try {\n        this.renderPromise = new Promise((resolve) => (this.#resolveRenderPromise = resolve));\n        this.renderer = renderer;\n        await this.prepareToRenderSnapshot(renderer);\n\n        const renderInterception = new Promise((resolve) => (this.#resolveInterceptionPromise = resolve));\n        const options = { resume: this.#resolveInterceptionPromise, render: this.renderer.renderElement, renderMethod: this.renderer.renderMethod };\n        const immediateRender = this.delegate.allowsImmediateRender(snapshot, options);\n        if (!immediateRender) await renderInterception;\n\n        await this.renderSnapshot(renderer);\n        this.delegate.viewRenderedSnapshot(snapshot, isPreview, this.renderer.renderMethod);\n        this.delegate.preloadOnLoadLinksForView(this.element);\n        this.finishRenderingSnapshot(renderer);\n      } finally {\n        delete this.renderer;\n        this.#resolveRenderPromise(undefined);\n        delete this.renderPromise;\n      }\n    } else if (shouldInvalidate) {\n      this.invalidate(renderer.reloadReason);\n    }\n  }\n\n  invalidate(reason) {\n    this.delegate.viewInvalidated(reason);\n  }\n\n  async prepareToRenderSnapshot(renderer) {\n    this.markAsPreview(renderer.isPreview);\n    await renderer.prepareToRender();\n  }\n\n  markAsPreview(isPreview) {\n    if (isPreview) {\n      this.element.setAttribute(\"data-turbo-preview\", \"\");\n    } else {\n      this.element.removeAttribute(\"data-turbo-preview\");\n    }\n  }\n\n  markVisitDirection(direction) {\n    this.element.setAttribute(\"data-turbo-visit-direction\", direction);\n  }\n\n  unmarkVisitDirection() {\n    this.element.removeAttribute(\"data-turbo-visit-direction\");\n  }\n\n  async renderSnapshot(renderer) {\n    await renderer.render();\n  }\n\n  finishRenderingSnapshot(renderer) {\n    renderer.finishRendering();\n  }\n}\n\nclass FrameView extends View {\n  missing() {\n    this.element.innerHTML = `<strong class=\"turbo-frame-error\">Content missing</strong>`;\n  }\n\n  get snapshot() {\n    return new Snapshot(this.element)\n  }\n}\n\nclass LinkInterceptor {\n  constructor(delegate, element) {\n    this.delegate = delegate;\n    this.element = element;\n  }\n\n  start() {\n    this.element.addEventListener(\"click\", this.clickBubbled);\n    document.addEventListener(\"turbo:click\", this.linkClicked);\n    document.addEventListener(\"turbo:before-visit\", this.willVisit);\n  }\n\n  stop() {\n    this.element.removeEventListener(\"click\", this.clickBubbled);\n    document.removeEventListener(\"turbo:click\", this.linkClicked);\n    document.removeEventListener(\"turbo:before-visit\", this.willVisit);\n  }\n\n  clickBubbled = (event) => {\n    if (this.clickEventIsSignificant(event)) {\n      this.clickEvent = event;\n    } else {\n      delete this.clickEvent;\n    }\n  }\n\n  linkClicked = (event) => {\n    if (this.clickEvent && this.clickEventIsSignificant(event)) {\n      if (this.delegate.shouldInterceptLinkClick(event.target, event.detail.url, event.detail.originalEvent)) {\n        this.clickEvent.preventDefault();\n        event.preventDefault();\n        this.delegate.linkClickIntercepted(event.target, event.detail.url, event.detail.originalEvent);\n      }\n    }\n    delete this.clickEvent;\n  }\n\n  willVisit = (_event) => {\n    delete this.clickEvent;\n  }\n\n  clickEventIsSignificant(event) {\n    const target = event.composed ? event.target?.parentElement : event.target;\n    const element = findLinkFromClickTarget(target) || target;\n\n    return element instanceof Element && element.closest(\"turbo-frame, html\") == this.element\n  }\n}\n\nclass LinkClickObserver {\n  started = false\n\n  constructor(delegate, eventTarget) {\n    this.delegate = delegate;\n    this.eventTarget = eventTarget;\n  }\n\n  start() {\n    if (!this.started) {\n      this.eventTarget.addEventListener(\"click\", this.clickCaptured, true);\n      this.started = true;\n    }\n  }\n\n  stop() {\n    if (this.started) {\n      this.eventTarget.removeEventListener(\"click\", this.clickCaptured, true);\n      this.started = false;\n    }\n  }\n\n  clickCaptured = () => {\n    this.eventTarget.removeEventListener(\"click\", this.clickBubbled, false);\n    this.eventTarget.addEventListener(\"click\", this.clickBubbled, false);\n  }\n\n  clickBubbled = (event) => {\n    if (event instanceof MouseEvent && this.clickEventIsSignificant(event)) {\n      const target = (event.composedPath && event.composedPath()[0]) || event.target;\n      const link = findLinkFromClickTarget(target);\n      if (link && doesNotTargetIFrame(link.target)) {\n        const location = getLocationForLink(link);\n        if (this.delegate.willFollowLinkToLocation(link, location, event)) {\n          event.preventDefault();\n          this.delegate.followedLinkToLocation(link, location);\n        }\n      }\n    }\n  }\n\n  clickEventIsSignificant(event) {\n    return !(\n      (event.target && event.target.isContentEditable) ||\n      event.defaultPrevented ||\n      event.which > 1 ||\n      event.altKey ||\n      event.ctrlKey ||\n      event.metaKey ||\n      event.shiftKey\n    )\n  }\n}\n\nclass FormLinkClickObserver {\n  constructor(delegate, element) {\n    this.delegate = delegate;\n    this.linkInterceptor = new LinkClickObserver(this, element);\n  }\n\n  start() {\n    this.linkInterceptor.start();\n  }\n\n  stop() {\n    this.linkInterceptor.stop();\n  }\n\n  // Link hover observer delegate\n\n  canPrefetchRequestToLocation(link, location) {\n    return false\n  }\n\n  prefetchAndCacheRequestToLocation(link, location) {\n    return\n  }\n\n  // Link click observer delegate\n\n  willFollowLinkToLocation(link, location, originalEvent) {\n    return (\n      this.delegate.willSubmitFormLinkToLocation(link, location, originalEvent) &&\n      (link.hasAttribute(\"data-turbo-method\") || link.hasAttribute(\"data-turbo-stream\"))\n    )\n  }\n\n  followedLinkToLocation(link, location) {\n    const form = document.createElement(\"form\");\n\n    const type = \"hidden\";\n    for (const [name, value] of location.searchParams) {\n      form.append(Object.assign(document.createElement(\"input\"), { type, name, value }));\n    }\n\n    const action = Object.assign(location, { search: \"\" });\n    form.setAttribute(\"data-turbo\", \"true\");\n    form.setAttribute(\"action\", action.href);\n    form.setAttribute(\"hidden\", \"\");\n\n    const method = link.getAttribute(\"data-turbo-method\");\n    if (method) form.setAttribute(\"method\", method);\n\n    const turboFrame = link.getAttribute(\"data-turbo-frame\");\n    if (turboFrame) form.setAttribute(\"data-turbo-frame\", turboFrame);\n\n    const turboAction = getVisitAction(link);\n    if (turboAction) form.setAttribute(\"data-turbo-action\", turboAction);\n\n    const turboConfirm = link.getAttribute(\"data-turbo-confirm\");\n    if (turboConfirm) form.setAttribute(\"data-turbo-confirm\", turboConfirm);\n\n    const turboStream = link.hasAttribute(\"data-turbo-stream\");\n    if (turboStream) form.setAttribute(\"data-turbo-stream\", \"\");\n\n    this.delegate.submittedFormLinkToLocation(link, location, form);\n\n    document.body.appendChild(form);\n    form.addEventListener(\"turbo:submit-end\", () => form.remove(), { once: true });\n    requestAnimationFrame(() => form.requestSubmit());\n  }\n}\n\nclass Bardo {\n  static async preservingPermanentElements(delegate, permanentElementMap, callback) {\n    const bardo = new this(delegate, permanentElementMap);\n    bardo.enter();\n    await callback();\n    bardo.leave();\n  }\n\n  constructor(delegate, permanentElementMap) {\n    this.delegate = delegate;\n    this.permanentElementMap = permanentElementMap;\n  }\n\n  enter() {\n    for (const id in this.permanentElementMap) {\n      const [currentPermanentElement, newPermanentElement] = this.permanentElementMap[id];\n      this.delegate.enteringBardo(currentPermanentElement, newPermanentElement);\n      this.replaceNewPermanentElementWithPlaceholder(newPermanentElement);\n    }\n  }\n\n  leave() {\n    for (const id in this.permanentElementMap) {\n      const [currentPermanentElement] = this.permanentElementMap[id];\n      this.replaceCurrentPermanentElementWithClone(currentPermanentElement);\n      this.replacePlaceholderWithPermanentElement(currentPermanentElement);\n      this.delegate.leavingBardo(currentPermanentElement);\n    }\n  }\n\n  replaceNewPermanentElementWithPlaceholder(permanentElement) {\n    const placeholder = createPlaceholderForPermanentElement(permanentElement);\n    permanentElement.replaceWith(placeholder);\n  }\n\n  replaceCurrentPermanentElementWithClone(permanentElement) {\n    const clone = permanentElement.cloneNode(true);\n    permanentElement.replaceWith(clone);\n  }\n\n  replacePlaceholderWithPermanentElement(permanentElement) {\n    const placeholder = this.getPlaceholderById(permanentElement.id);\n    placeholder?.replaceWith(permanentElement);\n  }\n\n  getPlaceholderById(id) {\n    return this.placeholders.find((element) => element.content == id)\n  }\n\n  get placeholders() {\n    return [...document.querySelectorAll(\"meta[name=turbo-permanent-placeholder][content]\")]\n  }\n}\n\nfunction createPlaceholderForPermanentElement(permanentElement) {\n  const element = document.createElement(\"meta\");\n  element.setAttribute(\"name\", \"turbo-permanent-placeholder\");\n  element.setAttribute(\"content\", permanentElement.id);\n  return element\n}\n\nclass Renderer {\n  #activeElement = null\n\n  static renderElement(currentElement, newElement) {\n    // Abstract method\n  }\n\n  constructor(currentSnapshot, newSnapshot, isPreview, willRender = true) {\n    this.currentSnapshot = currentSnapshot;\n    this.newSnapshot = newSnapshot;\n    this.isPreview = isPreview;\n    this.willRender = willRender;\n    this.renderElement = this.constructor.renderElement;\n    this.promise = new Promise((resolve, reject) => (this.resolvingFunctions = { resolve, reject }));\n  }\n\n  get shouldRender() {\n    return true\n  }\n\n  get shouldAutofocus() {\n    return true\n  }\n\n  get reloadReason() {\n    return\n  }\n\n  prepareToRender() {\n    return\n  }\n\n  render() {\n    // Abstract method\n  }\n\n  finishRendering() {\n    if (this.resolvingFunctions) {\n      this.resolvingFunctions.resolve();\n      delete this.resolvingFunctions;\n    }\n  }\n\n  async preservingPermanentElements(callback) {\n    await Bardo.preservingPermanentElements(this, this.permanentElementMap, callback);\n  }\n\n  focusFirstAutofocusableElement() {\n    if (this.shouldAutofocus) {\n      const element = this.connectedSnapshot.firstAutofocusableElement;\n      if (element) {\n        element.focus();\n      }\n    }\n  }\n\n  // Bardo delegate\n\n  enteringBardo(currentPermanentElement) {\n    if (this.#activeElement) return\n\n    if (currentPermanentElement.contains(this.currentSnapshot.activeElement)) {\n      this.#activeElement = this.currentSnapshot.activeElement;\n    }\n  }\n\n  leavingBardo(currentPermanentElement) {\n    if (currentPermanentElement.contains(this.#activeElement) && this.#activeElement instanceof HTMLElement) {\n      this.#activeElement.focus();\n\n      this.#activeElement = null;\n    }\n  }\n\n  get connectedSnapshot() {\n    return this.newSnapshot.isConnected ? this.newSnapshot : this.currentSnapshot\n  }\n\n  get currentElement() {\n    return this.currentSnapshot.element\n  }\n\n  get newElement() {\n    return this.newSnapshot.element\n  }\n\n  get permanentElementMap() {\n    return this.currentSnapshot.getPermanentElementMapForSnapshot(this.newSnapshot)\n  }\n\n  get renderMethod() {\n    return \"replace\"\n  }\n}\n\nclass FrameRenderer extends Renderer {\n  static renderElement(currentElement, newElement) {\n    const destinationRange = document.createRange();\n    destinationRange.selectNodeContents(currentElement);\n    destinationRange.deleteContents();\n\n    const frameElement = newElement;\n    const sourceRange = frameElement.ownerDocument?.createRange();\n    if (sourceRange) {\n      sourceRange.selectNodeContents(frameElement);\n      currentElement.appendChild(sourceRange.extractContents());\n    }\n  }\n\n  constructor(delegate, currentSnapshot, newSnapshot, renderElement, isPreview, willRender = true) {\n    super(currentSnapshot, newSnapshot, renderElement, isPreview, willRender);\n    this.delegate = delegate;\n  }\n\n  get shouldRender() {\n    return true\n  }\n\n  async render() {\n    await nextRepaint();\n    this.preservingPermanentElements(() => {\n      this.loadFrameElement();\n    });\n    this.scrollFrameIntoView();\n    await nextRepaint();\n    this.focusFirstAutofocusableElement();\n    await nextRepaint();\n    this.activateScriptElements();\n  }\n\n  loadFrameElement() {\n    this.delegate.willRenderFrame(this.currentElement, this.newElement);\n    this.renderElement(this.currentElement, this.newElement);\n  }\n\n  scrollFrameIntoView() {\n    if (this.currentElement.autoscroll || this.newElement.autoscroll) {\n      const element = this.currentElement.firstElementChild;\n      const block = readScrollLogicalPosition(this.currentElement.getAttribute(\"data-autoscroll-block\"), \"end\");\n      const behavior = readScrollBehavior(this.currentElement.getAttribute(\"data-autoscroll-behavior\"), \"auto\");\n\n      if (element) {\n        element.scrollIntoView({ block, behavior });\n        return true\n      }\n    }\n    return false\n  }\n\n  activateScriptElements() {\n    for (const inertScriptElement of this.newScriptElements) {\n      const activatedScriptElement = activateScriptElement(inertScriptElement);\n      inertScriptElement.replaceWith(activatedScriptElement);\n    }\n  }\n\n  get newScriptElements() {\n    return this.currentElement.querySelectorAll(\"script\")\n  }\n}\n\nfunction readScrollLogicalPosition(value, defaultValue) {\n  if (value == \"end\" || value == \"start\" || value == \"center\" || value == \"nearest\") {\n    return value\n  } else {\n    return defaultValue\n  }\n}\n\nfunction readScrollBehavior(value, defaultValue) {\n  if (value == \"auto\" || value == \"smooth\") {\n    return value\n  } else {\n    return defaultValue\n  }\n}\n\n/**\n * @typedef {object} ConfigHead\n *\n * @property {'merge' | 'append' | 'morph' | 'none'} [style]\n * @property {boolean} [block]\n * @property {boolean} [ignore]\n * @property {function(Element): boolean} [shouldPreserve]\n * @property {function(Element): boolean} [shouldReAppend]\n * @property {function(Element): boolean} [shouldRemove]\n * @property {function(Element, {added: Node[], kept: Element[], removed: Element[]}): void} [afterHeadMorphed]\n */\n\n/**\n * @typedef {object} ConfigCallbacks\n *\n * @property {function(Node): boolean} [beforeNodeAdded]\n * @property {function(Node): void} [afterNodeAdded]\n * @property {function(Element, Node): boolean} [beforeNodeMorphed]\n * @property {function(Element, Node): void} [afterNodeMorphed]\n * @property {function(Element): boolean} [beforeNodeRemoved]\n * @property {function(Element): void} [afterNodeRemoved]\n * @property {function(string, Element, \"update\" | \"remove\"): boolean} [beforeAttributeUpdated]\n */\n\n/**\n * @typedef {object} Config\n *\n * @property {'outerHTML' | 'innerHTML'} [morphStyle]\n * @property {boolean} [ignoreActive]\n * @property {boolean} [ignoreActiveValue]\n * @property {boolean} [restoreFocus]\n * @property {ConfigCallbacks} [callbacks]\n * @property {ConfigHead} [head]\n */\n\n/**\n * @typedef {function} NoOp\n *\n * @returns {void}\n */\n\n/**\n * @typedef {object} ConfigHeadInternal\n *\n * @property {'merge' | 'append' | 'morph' | 'none'} style\n * @property {boolean} [block]\n * @property {boolean} [ignore]\n * @property {(function(Element): boolean) | NoOp} shouldPreserve\n * @property {(function(Element): boolean) | NoOp} shouldReAppend\n * @property {(function(Element): boolean) | NoOp} shouldRemove\n * @property {(function(Element, {added: Node[], kept: Element[], removed: Element[]}): void) | NoOp} afterHeadMorphed\n */\n\n/**\n * @typedef {object} ConfigCallbacksInternal\n *\n * @property {(function(Node): boolean) | NoOp} beforeNodeAdded\n * @property {(function(Node): void) | NoOp} afterNodeAdded\n * @property {(function(Node, Node): boolean) | NoOp} beforeNodeMorphed\n * @property {(function(Node, Node): void) | NoOp} afterNodeMorphed\n * @property {(function(Node): boolean) | NoOp} beforeNodeRemoved\n * @property {(function(Node): void) | NoOp} afterNodeRemoved\n * @property {(function(string, Element, \"update\" | \"remove\"): boolean) | NoOp} beforeAttributeUpdated\n */\n\n/**\n * @typedef {object} ConfigInternal\n *\n * @property {'outerHTML' | 'innerHTML'} morphStyle\n * @property {boolean} [ignoreActive]\n * @property {boolean} [ignoreActiveValue]\n * @property {boolean} [restoreFocus]\n * @property {ConfigCallbacksInternal} callbacks\n * @property {ConfigHeadInternal} head\n */\n\n/**\n * @typedef {Object} IdSets\n * @property {Set<string>} persistentIds\n * @property {Map<Node, Set<string>>} idMap\n */\n\n/**\n * @typedef {Function} Morph\n *\n * @param {Element | Document} oldNode\n * @param {Element | Node | HTMLCollection | Node[] | string | null} newContent\n * @param {Config} [config]\n * @returns {undefined | Node[]}\n */\n\n// base IIFE to define idiomorph\n/**\n *\n * @type {{defaults: ConfigInternal, morph: Morph}}\n */\nvar Idiomorph = (function () {\n\n  /**\n   * @typedef {object} MorphContext\n   *\n   * @property {Element} target\n   * @property {Element} newContent\n   * @property {ConfigInternal} config\n   * @property {ConfigInternal['morphStyle']} morphStyle\n   * @property {ConfigInternal['ignoreActive']} ignoreActive\n   * @property {ConfigInternal['ignoreActiveValue']} ignoreActiveValue\n   * @property {ConfigInternal['restoreFocus']} restoreFocus\n   * @property {Map<Node, Set<string>>} idMap\n   * @property {Set<string>} persistentIds\n   * @property {ConfigInternal['callbacks']} callbacks\n   * @property {ConfigInternal['head']} head\n   * @property {HTMLDivElement} pantry\n   */\n\n  //=============================================================================\n  // AND NOW IT BEGINS...\n  //=============================================================================\n\n  const noOp = () => {};\n  /**\n   * Default configuration values, updatable by users now\n   * @type {ConfigInternal}\n   */\n  const defaults = {\n    morphStyle: \"outerHTML\",\n    callbacks: {\n      beforeNodeAdded: noOp,\n      afterNodeAdded: noOp,\n      beforeNodeMorphed: noOp,\n      afterNodeMorphed: noOp,\n      beforeNodeRemoved: noOp,\n      afterNodeRemoved: noOp,\n      beforeAttributeUpdated: noOp,\n    },\n    head: {\n      style: \"merge\",\n      shouldPreserve: (elt) => elt.getAttribute(\"im-preserve\") === \"true\",\n      shouldReAppend: (elt) => elt.getAttribute(\"im-re-append\") === \"true\",\n      shouldRemove: noOp,\n      afterHeadMorphed: noOp,\n    },\n    restoreFocus: true,\n  };\n\n  /**\n   * Core idiomorph function for morphing one DOM tree to another\n   *\n   * @param {Element | Document} oldNode\n   * @param {Element | Node | HTMLCollection | Node[] | string | null} newContent\n   * @param {Config} [config]\n   * @returns {Promise<Node[]> | Node[]}\n   */\n  function morph(oldNode, newContent, config = {}) {\n    oldNode = normalizeElement(oldNode);\n    const newNode = normalizeParent(newContent);\n    const ctx = createMorphContext(oldNode, newNode, config);\n\n    const morphedNodes = saveAndRestoreFocus(ctx, () => {\n      return withHeadBlocking(\n        ctx,\n        oldNode,\n        newNode,\n        /** @param {MorphContext} ctx */ (ctx) => {\n          if (ctx.morphStyle === \"innerHTML\") {\n            morphChildren(ctx, oldNode, newNode);\n            return Array.from(oldNode.childNodes);\n          } else {\n            return morphOuterHTML(ctx, oldNode, newNode);\n          }\n        },\n      );\n    });\n\n    ctx.pantry.remove();\n    return morphedNodes;\n  }\n\n  /**\n   * Morph just the outerHTML of the oldNode to the newContent\n   * We have to be careful because the oldNode could have siblings which need to be untouched\n   * @param {MorphContext} ctx\n   * @param {Element} oldNode\n   * @param {Element} newNode\n   * @returns {Node[]}\n   */\n  function morphOuterHTML(ctx, oldNode, newNode) {\n    const oldParent = normalizeParent(oldNode);\n\n    // basis for calulating which nodes were morphed\n    // since there may be unmorphed sibling nodes\n    let childNodes = Array.from(oldParent.childNodes);\n    const index = childNodes.indexOf(oldNode);\n    // how many elements are to the right of the oldNode\n    const rightMargin = childNodes.length - (index + 1);\n\n    morphChildren(\n      ctx,\n      oldParent,\n      newNode,\n      // these two optional params are the secret sauce\n      oldNode, // start point for iteration\n      oldNode.nextSibling, // end point for iteration\n    );\n\n    // return just the morphed nodes\n    childNodes = Array.from(oldParent.childNodes);\n    return childNodes.slice(index, childNodes.length - rightMargin);\n  }\n\n  /**\n   * @param {MorphContext} ctx\n   * @param {Function} fn\n   * @returns {Promise<Node[]> | Node[]}\n   */\n  function saveAndRestoreFocus(ctx, fn) {\n    if (!ctx.config.restoreFocus) return fn();\n    let activeElement =\n      /** @type {HTMLInputElement|HTMLTextAreaElement|null} */ (\n        document.activeElement\n      );\n\n    // don't bother if the active element is not an input or textarea\n    if (\n      !(\n        activeElement instanceof HTMLInputElement ||\n        activeElement instanceof HTMLTextAreaElement\n      )\n    ) {\n      return fn();\n    }\n\n    const { id: activeElementId, selectionStart, selectionEnd } = activeElement;\n\n    const results = fn();\n\n    if (activeElementId && activeElementId !== document.activeElement?.id) {\n      activeElement = ctx.target.querySelector(`#${activeElementId}`);\n      activeElement?.focus();\n    }\n    if (activeElement && !activeElement.selectionEnd && selectionEnd) {\n      activeElement.setSelectionRange(selectionStart, selectionEnd);\n    }\n\n    return results;\n  }\n\n  const morphChildren = (function () {\n    /**\n     * This is the core algorithm for matching up children.  The idea is to use id sets to try to match up\n     * nodes as faithfully as possible.  We greedily match, which allows us to keep the algorithm fast, but\n     * by using id sets, we are able to better match up with content deeper in the DOM.\n     *\n     * Basic algorithm:\n     * - for each node in the new content:\n     *   - search self and siblings for an id set match, falling back to a soft match\n     *   - if match found\n     *     - remove any nodes up to the match:\n     *       - pantry persistent nodes\n     *       - delete the rest\n     *     - morph the match\n     *   - elsif no match found, and node is persistent\n     *     - find its match by querying the old root (future) and pantry (past)\n     *     - move it and its children here\n     *     - morph it\n     *   - else\n     *     - create a new node from scratch as a last result\n     *\n     * @param {MorphContext} ctx the merge context\n     * @param {Element} oldParent the old content that we are merging the new content into\n     * @param {Element} newParent the parent element of the new content\n     * @param {Node|null} [insertionPoint] the point in the DOM we start morphing at (defaults to first child)\n     * @param {Node|null} [endPoint] the point in the DOM we stop morphing at (defaults to after last child)\n     */\n    function morphChildren(\n      ctx,\n      oldParent,\n      newParent,\n      insertionPoint = null,\n      endPoint = null,\n    ) {\n      // normalize\n      if (\n        oldParent instanceof HTMLTemplateElement &&\n        newParent instanceof HTMLTemplateElement\n      ) {\n        // @ts-ignore we can pretend the DocumentFragment is an Element\n        oldParent = oldParent.content;\n        // @ts-ignore ditto\n        newParent = newParent.content;\n      }\n      insertionPoint ||= oldParent.firstChild;\n\n      // run through all the new content\n      for (const newChild of newParent.childNodes) {\n        // once we reach the end of the old parent content skip to the end and insert the rest\n        if (insertionPoint && insertionPoint != endPoint) {\n          const bestMatch = findBestMatch(\n            ctx,\n            newChild,\n            insertionPoint,\n            endPoint,\n          );\n          if (bestMatch) {\n            // if the node to morph is not at the insertion point then remove/move up to it\n            if (bestMatch !== insertionPoint) {\n              removeNodesBetween(ctx, insertionPoint, bestMatch);\n            }\n            morphNode(bestMatch, newChild, ctx);\n            insertionPoint = bestMatch.nextSibling;\n            continue;\n          }\n        }\n\n        // if the matching node is elsewhere in the original content\n        if (newChild instanceof Element && ctx.persistentIds.has(newChild.id)) {\n          // move it and all its children here and morph\n          const movedChild = moveBeforeById(\n            oldParent,\n            newChild.id,\n            insertionPoint,\n            ctx,\n          );\n          morphNode(movedChild, newChild, ctx);\n          insertionPoint = movedChild.nextSibling;\n          continue;\n        }\n\n        // last resort: insert the new node from scratch\n        const insertedNode = createNode(\n          oldParent,\n          newChild,\n          insertionPoint,\n          ctx,\n        );\n        // could be null if beforeNodeAdded prevented insertion\n        if (insertedNode) {\n          insertionPoint = insertedNode.nextSibling;\n        }\n      }\n\n      // remove any remaining old nodes that didn't match up with new content\n      while (insertionPoint && insertionPoint != endPoint) {\n        const tempNode = insertionPoint;\n        insertionPoint = insertionPoint.nextSibling;\n        removeNode(ctx, tempNode);\n      }\n    }\n\n    /**\n     * This performs the action of inserting a new node while handling situations where the node contains\n     * elements with persistent ids and possible state info we can still preserve by moving in and then morphing\n     *\n     * @param {Element} oldParent\n     * @param {Node} newChild\n     * @param {Node|null} insertionPoint\n     * @param {MorphContext} ctx\n     * @returns {Node|null}\n     */\n    function createNode(oldParent, newChild, insertionPoint, ctx) {\n      if (ctx.callbacks.beforeNodeAdded(newChild) === false) return null;\n      if (ctx.idMap.has(newChild)) {\n        // node has children with ids with possible state so create a dummy elt of same type and apply full morph algorithm\n        const newEmptyChild = document.createElement(\n          /** @type {Element} */ (newChild).tagName,\n        );\n        oldParent.insertBefore(newEmptyChild, insertionPoint);\n        morphNode(newEmptyChild, newChild, ctx);\n        ctx.callbacks.afterNodeAdded(newEmptyChild);\n        return newEmptyChild;\n      } else {\n        // optimisation: no id state to preserve so we can just insert a clone of the newChild and its descendants\n        const newClonedChild = document.importNode(newChild, true); // importNode to not mutate newParent\n        oldParent.insertBefore(newClonedChild, insertionPoint);\n        ctx.callbacks.afterNodeAdded(newClonedChild);\n        return newClonedChild;\n      }\n    }\n\n    //=============================================================================\n    // Matching Functions\n    //=============================================================================\n    const findBestMatch = (function () {\n      /**\n       * Scans forward from the startPoint to the endPoint looking for a match\n       * for the node. It looks for an id set match first, then a soft match.\n       * We abort softmatching if we find two future soft matches, to reduce churn.\n       * @param {Node} node\n       * @param {MorphContext} ctx\n       * @param {Node | null} startPoint\n       * @param {Node | null} endPoint\n       * @returns {Node | null}\n       */\n      function findBestMatch(ctx, node, startPoint, endPoint) {\n        let softMatch = null;\n        let nextSibling = node.nextSibling;\n        let siblingSoftMatchCount = 0;\n\n        let cursor = startPoint;\n        while (cursor && cursor != endPoint) {\n          // soft matching is a prerequisite for id set matching\n          if (isSoftMatch(cursor, node)) {\n            if (isIdSetMatch(ctx, cursor, node)) {\n              return cursor; // found an id set match, we're done!\n            }\n\n            // we haven't yet saved a soft match fallback\n            if (softMatch === null) {\n              // the current soft match will hard match something else in the future, leave it\n              if (!ctx.idMap.has(cursor)) {\n                // save this as the fallback if we get through the loop without finding a hard match\n                softMatch = cursor;\n              }\n            }\n          }\n          if (\n            softMatch === null &&\n            nextSibling &&\n            isSoftMatch(cursor, nextSibling)\n          ) {\n            // The next new node has a soft match with this node, so\n            // increment the count of future soft matches\n            siblingSoftMatchCount++;\n            nextSibling = nextSibling.nextSibling;\n\n            // If there are two future soft matches, block soft matching for this node to allow\n            // future siblings to soft match. This is to reduce churn in the DOM when an element\n            // is prepended.\n            if (siblingSoftMatchCount >= 2) {\n              softMatch = undefined;\n            }\n          }\n\n          // if the current node contains active element, stop looking for better future matches,\n          // because if one is found, this node will be moved to the pantry, reparenting it and thus losing focus\n          if (cursor.contains(document.activeElement)) break;\n\n          cursor = cursor.nextSibling;\n        }\n\n        return softMatch || null;\n      }\n\n      /**\n       *\n       * @param {MorphContext} ctx\n       * @param {Node} oldNode\n       * @param {Node} newNode\n       * @returns {boolean}\n       */\n      function isIdSetMatch(ctx, oldNode, newNode) {\n        let oldSet = ctx.idMap.get(oldNode);\n        let newSet = ctx.idMap.get(newNode);\n\n        if (!newSet || !oldSet) return false;\n\n        for (const id of oldSet) {\n          // a potential match is an id in the new and old nodes that\n          // has not already been merged into the DOM\n          // But the newNode content we call this on has not been\n          // merged yet and we don't allow duplicate IDs so it is simple\n          if (newSet.has(id)) {\n            return true;\n          }\n        }\n        return false;\n      }\n\n      /**\n       *\n       * @param {Node} oldNode\n       * @param {Node} newNode\n       * @returns {boolean}\n       */\n      function isSoftMatch(oldNode, newNode) {\n        // ok to cast: if one is not element, `id` and `tagName` will be undefined and we'll just compare that.\n        const oldElt = /** @type {Element} */ (oldNode);\n        const newElt = /** @type {Element} */ (newNode);\n\n        return (\n          oldElt.nodeType === newElt.nodeType &&\n          oldElt.tagName === newElt.tagName &&\n          // If oldElt has an `id` with possible state and it doesn't match newElt.id then avoid morphing.\n          // We'll still match an anonymous node with an IDed newElt, though, because if it got this far,\n          // its not persistent, and new nodes can't have any hidden state.\n          (!oldElt.id || oldElt.id === newElt.id)\n        );\n      }\n\n      return findBestMatch;\n    })();\n\n    //=============================================================================\n    // DOM Manipulation Functions\n    //=============================================================================\n\n    /**\n     * Gets rid of an unwanted DOM node; strategy depends on nature of its reuse:\n     * - Persistent nodes will be moved to the pantry for later reuse\n     * - Other nodes will have their hooks called, and then are removed\n     * @param {MorphContext} ctx\n     * @param {Node} node\n     */\n    function removeNode(ctx, node) {\n      // are we going to id set match this later?\n      if (ctx.idMap.has(node)) {\n        // skip callbacks and move to pantry\n        moveBefore(ctx.pantry, node, null);\n      } else {\n        // remove for realsies\n        if (ctx.callbacks.beforeNodeRemoved(node) === false) return;\n        node.parentNode?.removeChild(node);\n        ctx.callbacks.afterNodeRemoved(node);\n      }\n    }\n\n    /**\n     * Remove nodes between the start and end nodes\n     * @param {MorphContext} ctx\n     * @param {Node} startInclusive\n     * @param {Node} endExclusive\n     * @returns {Node|null}\n     */\n    function removeNodesBetween(ctx, startInclusive, endExclusive) {\n      /** @type {Node | null} */\n      let cursor = startInclusive;\n      // remove nodes until the endExclusive node\n      while (cursor && cursor !== endExclusive) {\n        let tempNode = /** @type {Node} */ (cursor);\n        cursor = cursor.nextSibling;\n        removeNode(ctx, tempNode);\n      }\n      return cursor;\n    }\n\n    /**\n     * Search for an element by id within the document and pantry, and move it using moveBefore.\n     *\n     * @param {Element} parentNode - The parent node to which the element will be moved.\n     * @param {string} id - The ID of the element to be moved.\n     * @param {Node | null} after - The reference node to insert the element before.\n     *                              If `null`, the element is appended as the last child.\n     * @param {MorphContext} ctx\n     * @returns {Element} The found element\n     */\n    function moveBeforeById(parentNode, id, after, ctx) {\n      const target =\n        /** @type {Element} - will always be found */\n        (\n          ctx.target.querySelector(`#${id}`) ||\n            ctx.pantry.querySelector(`#${id}`)\n        );\n      removeElementFromAncestorsIdMaps(target, ctx);\n      moveBefore(parentNode, target, after);\n      return target;\n    }\n\n    /**\n     * Removes an element from its ancestors' id maps. This is needed when an element is moved from the\n     * \"future\" via `moveBeforeId`. Otherwise, its erstwhile ancestors could be mistakenly moved to the\n     * pantry rather than being deleted, preventing their removal hooks from being called.\n     *\n     * @param {Element} element - element to remove from its ancestors' id maps\n     * @param {MorphContext} ctx\n     */\n    function removeElementFromAncestorsIdMaps(element, ctx) {\n      const id = element.id;\n      /** @ts-ignore - safe to loop in this way **/\n      while ((element = element.parentNode)) {\n        let idSet = ctx.idMap.get(element);\n        if (idSet) {\n          idSet.delete(id);\n          if (!idSet.size) {\n            ctx.idMap.delete(element);\n          }\n        }\n      }\n    }\n\n    /**\n     * Moves an element before another element within the same parent.\n     * Uses the proposed `moveBefore` API if available (and working), otherwise falls back to `insertBefore`.\n     * This is essentialy a forward-compat wrapper.\n     *\n     * @param {Element} parentNode - The parent node containing the after element.\n     * @param {Node} element - The element to be moved.\n     * @param {Node | null} after - The reference node to insert `element` before.\n     *                              If `null`, `element` is appended as the last child.\n     */\n    function moveBefore(parentNode, element, after) {\n      // @ts-ignore - use proposed moveBefore feature\n      if (parentNode.moveBefore) {\n        try {\n          // @ts-ignore - use proposed moveBefore feature\n          parentNode.moveBefore(element, after);\n        } catch (e) {\n          // fall back to insertBefore as some browsers may fail on moveBefore when trying to move Dom disconnected nodes to pantry\n          parentNode.insertBefore(element, after);\n        }\n      } else {\n        parentNode.insertBefore(element, after);\n      }\n    }\n\n    return morphChildren;\n  })();\n\n  //=============================================================================\n  // Single Node Morphing Code\n  //=============================================================================\n  const morphNode = (function () {\n    /**\n     * @param {Node} oldNode root node to merge content into\n     * @param {Node} newContent new content to merge\n     * @param {MorphContext} ctx the merge context\n     * @returns {Node | null} the element that ended up in the DOM\n     */\n    function morphNode(oldNode, newContent, ctx) {\n      if (ctx.ignoreActive && oldNode === document.activeElement) {\n        // don't morph focused element\n        return null;\n      }\n\n      if (ctx.callbacks.beforeNodeMorphed(oldNode, newContent) === false) {\n        return oldNode;\n      }\n\n      if (oldNode instanceof HTMLHeadElement && ctx.head.ignore) ; else if (\n        oldNode instanceof HTMLHeadElement &&\n        ctx.head.style !== \"morph\"\n      ) {\n        // ok to cast: if newContent wasn't also a <head>, it would've got caught in the `!isSoftMatch` branch above\n        handleHeadElement(\n          oldNode,\n          /** @type {HTMLHeadElement} */ (newContent),\n          ctx,\n        );\n      } else {\n        morphAttributes(oldNode, newContent, ctx);\n        if (!ignoreValueOfActiveElement(oldNode, ctx)) {\n          // @ts-ignore newContent can be a node here because .firstChild will be null\n          morphChildren(ctx, oldNode, newContent);\n        }\n      }\n      ctx.callbacks.afterNodeMorphed(oldNode, newContent);\n      return oldNode;\n    }\n\n    /**\n     * syncs the oldNode to the newNode, copying over all attributes and\n     * inner element state from the newNode to the oldNode\n     *\n     * @param {Node} oldNode the node to copy attributes & state to\n     * @param {Node} newNode the node to copy attributes & state from\n     * @param {MorphContext} ctx the merge context\n     */\n    function morphAttributes(oldNode, newNode, ctx) {\n      let type = newNode.nodeType;\n\n      // if is an element type, sync the attributes from the\n      // new node into the new node\n      if (type === 1 /* element type */) {\n        const oldElt = /** @type {Element} */ (oldNode);\n        const newElt = /** @type {Element} */ (newNode);\n\n        const oldAttributes = oldElt.attributes;\n        const newAttributes = newElt.attributes;\n        for (const newAttribute of newAttributes) {\n          if (ignoreAttribute(newAttribute.name, oldElt, \"update\", ctx)) {\n            continue;\n          }\n          if (oldElt.getAttribute(newAttribute.name) !== newAttribute.value) {\n            oldElt.setAttribute(newAttribute.name, newAttribute.value);\n          }\n        }\n        // iterate backwards to avoid skipping over items when a delete occurs\n        for (let i = oldAttributes.length - 1; 0 <= i; i--) {\n          const oldAttribute = oldAttributes[i];\n\n          // toAttributes is a live NamedNodeMap, so iteration+mutation is unsafe\n          // e.g. custom element attribute callbacks can remove other attributes\n          if (!oldAttribute) continue;\n\n          if (!newElt.hasAttribute(oldAttribute.name)) {\n            if (ignoreAttribute(oldAttribute.name, oldElt, \"remove\", ctx)) {\n              continue;\n            }\n            oldElt.removeAttribute(oldAttribute.name);\n          }\n        }\n\n        if (!ignoreValueOfActiveElement(oldElt, ctx)) {\n          syncInputValue(oldElt, newElt, ctx);\n        }\n      }\n\n      // sync text nodes\n      if (type === 8 /* comment */ || type === 3 /* text */) {\n        if (oldNode.nodeValue !== newNode.nodeValue) {\n          oldNode.nodeValue = newNode.nodeValue;\n        }\n      }\n    }\n\n    /**\n     * NB: many bothans died to bring us information:\n     *\n     *  https://github.com/patrick-steele-idem/morphdom/blob/master/src/specialElHandlers.js\n     *  https://github.com/choojs/nanomorph/blob/master/lib/morph.jsL113\n     *\n     * @param {Element} oldElement the element to sync the input value to\n     * @param {Element} newElement the element to sync the input value from\n     * @param {MorphContext} ctx the merge context\n     */\n    function syncInputValue(oldElement, newElement, ctx) {\n      if (\n        oldElement instanceof HTMLInputElement &&\n        newElement instanceof HTMLInputElement &&\n        newElement.type !== \"file\"\n      ) {\n        let newValue = newElement.value;\n        let oldValue = oldElement.value;\n\n        // sync boolean attributes\n        syncBooleanAttribute(oldElement, newElement, \"checked\", ctx);\n        syncBooleanAttribute(oldElement, newElement, \"disabled\", ctx);\n\n        if (!newElement.hasAttribute(\"value\")) {\n          if (!ignoreAttribute(\"value\", oldElement, \"remove\", ctx)) {\n            oldElement.value = \"\";\n            oldElement.removeAttribute(\"value\");\n          }\n        } else if (oldValue !== newValue) {\n          if (!ignoreAttribute(\"value\", oldElement, \"update\", ctx)) {\n            oldElement.setAttribute(\"value\", newValue);\n            oldElement.value = newValue;\n          }\n        }\n        // TODO: QUESTION(1cg): this used to only check `newElement` unlike the other branches -- why?\n        // did I break something?\n      } else if (\n        oldElement instanceof HTMLOptionElement &&\n        newElement instanceof HTMLOptionElement\n      ) {\n        syncBooleanAttribute(oldElement, newElement, \"selected\", ctx);\n      } else if (\n        oldElement instanceof HTMLTextAreaElement &&\n        newElement instanceof HTMLTextAreaElement\n      ) {\n        let newValue = newElement.value;\n        let oldValue = oldElement.value;\n        if (ignoreAttribute(\"value\", oldElement, \"update\", ctx)) {\n          return;\n        }\n        if (newValue !== oldValue) {\n          oldElement.value = newValue;\n        }\n        if (\n          oldElement.firstChild &&\n          oldElement.firstChild.nodeValue !== newValue\n        ) {\n          oldElement.firstChild.nodeValue = newValue;\n        }\n      }\n    }\n\n    /**\n     * @param {Element} oldElement element to write the value to\n     * @param {Element} newElement element to read the value from\n     * @param {string} attributeName the attribute name\n     * @param {MorphContext} ctx the merge context\n     */\n    function syncBooleanAttribute(oldElement, newElement, attributeName, ctx) {\n      // @ts-ignore this function is only used on boolean attrs that are reflected as dom properties\n      const newLiveValue = newElement[attributeName],\n        // @ts-ignore ditto\n        oldLiveValue = oldElement[attributeName];\n      if (newLiveValue !== oldLiveValue) {\n        const ignoreUpdate = ignoreAttribute(\n          attributeName,\n          oldElement,\n          \"update\",\n          ctx,\n        );\n        if (!ignoreUpdate) {\n          // update attribute's associated DOM property\n          // @ts-ignore this function is only used on boolean attrs that are reflected as dom properties\n          oldElement[attributeName] = newElement[attributeName];\n        }\n        if (newLiveValue) {\n          if (!ignoreUpdate) {\n            // https://developer.mozilla.org/en-US/docs/Glossary/Boolean/HTML\n            // this is the correct way to set a boolean attribute to \"true\"\n            oldElement.setAttribute(attributeName, \"\");\n          }\n        } else {\n          if (!ignoreAttribute(attributeName, oldElement, \"remove\", ctx)) {\n            oldElement.removeAttribute(attributeName);\n          }\n        }\n      }\n    }\n\n    /**\n     * @param {string} attr the attribute to be mutated\n     * @param {Element} element the element that is going to be updated\n     * @param {\"update\" | \"remove\"} updateType\n     * @param {MorphContext} ctx the merge context\n     * @returns {boolean} true if the attribute should be ignored, false otherwise\n     */\n    function ignoreAttribute(attr, element, updateType, ctx) {\n      if (\n        attr === \"value\" &&\n        ctx.ignoreActiveValue &&\n        element === document.activeElement\n      ) {\n        return true;\n      }\n      return (\n        ctx.callbacks.beforeAttributeUpdated(attr, element, updateType) ===\n        false\n      );\n    }\n\n    /**\n     * @param {Node} possibleActiveElement\n     * @param {MorphContext} ctx\n     * @returns {boolean}\n     */\n    function ignoreValueOfActiveElement(possibleActiveElement, ctx) {\n      return (\n        !!ctx.ignoreActiveValue &&\n        possibleActiveElement === document.activeElement &&\n        possibleActiveElement !== document.body\n      );\n    }\n\n    return morphNode;\n  })();\n\n  //=============================================================================\n  // Head Management Functions\n  //=============================================================================\n  /**\n   * @param {MorphContext} ctx\n   * @param {Element} oldNode\n   * @param {Element} newNode\n   * @param {function} callback\n   * @returns {Node[] | Promise<Node[]>}\n   */\n  function withHeadBlocking(ctx, oldNode, newNode, callback) {\n    if (ctx.head.block) {\n      const oldHead = oldNode.querySelector(\"head\");\n      const newHead = newNode.querySelector(\"head\");\n      if (oldHead && newHead) {\n        const promises = handleHeadElement(oldHead, newHead, ctx);\n        // when head promises resolve, proceed ignoring the head tag\n        return Promise.all(promises).then(() => {\n          const newCtx = Object.assign(ctx, {\n            head: {\n              block: false,\n              ignore: true,\n            },\n          });\n          return callback(newCtx);\n        });\n      }\n    }\n    // just proceed if we not head blocking\n    return callback(ctx);\n  }\n\n  /**\n   *  The HEAD tag can be handled specially, either w/ a 'merge' or 'append' style\n   *\n   * @param {Element} oldHead\n   * @param {Element} newHead\n   * @param {MorphContext} ctx\n   * @returns {Promise<void>[]}\n   */\n  function handleHeadElement(oldHead, newHead, ctx) {\n    let added = [];\n    let removed = [];\n    let preserved = [];\n    let nodesToAppend = [];\n\n    // put all new head elements into a Map, by their outerHTML\n    let srcToNewHeadNodes = new Map();\n    for (const newHeadChild of newHead.children) {\n      srcToNewHeadNodes.set(newHeadChild.outerHTML, newHeadChild);\n    }\n\n    // for each elt in the current head\n    for (const currentHeadElt of oldHead.children) {\n      // If the current head element is in the map\n      let inNewContent = srcToNewHeadNodes.has(currentHeadElt.outerHTML);\n      let isReAppended = ctx.head.shouldReAppend(currentHeadElt);\n      let isPreserved = ctx.head.shouldPreserve(currentHeadElt);\n      if (inNewContent || isPreserved) {\n        if (isReAppended) {\n          // remove the current version and let the new version replace it and re-execute\n          removed.push(currentHeadElt);\n        } else {\n          // this element already exists and should not be re-appended, so remove it from\n          // the new content map, preserving it in the DOM\n          srcToNewHeadNodes.delete(currentHeadElt.outerHTML);\n          preserved.push(currentHeadElt);\n        }\n      } else {\n        if (ctx.head.style === \"append\") {\n          // we are appending and this existing element is not new content\n          // so if and only if it is marked for re-append do we do anything\n          if (isReAppended) {\n            removed.push(currentHeadElt);\n            nodesToAppend.push(currentHeadElt);\n          }\n        } else {\n          // if this is a merge, we remove this content since it is not in the new head\n          if (ctx.head.shouldRemove(currentHeadElt) !== false) {\n            removed.push(currentHeadElt);\n          }\n        }\n      }\n    }\n\n    // Push the remaining new head elements in the Map into the\n    // nodes to append to the head tag\n    nodesToAppend.push(...srcToNewHeadNodes.values());\n\n    let promises = [];\n    for (const newNode of nodesToAppend) {\n      // TODO: This could theoretically be null, based on type\n      let newElt = /** @type {ChildNode} */ (\n        document.createRange().createContextualFragment(newNode.outerHTML)\n          .firstChild\n      );\n      if (ctx.callbacks.beforeNodeAdded(newElt) !== false) {\n        if (\n          (\"href\" in newElt && newElt.href) ||\n          (\"src\" in newElt && newElt.src)\n        ) {\n          /** @type {(result?: any) => void} */ let resolve;\n          let promise = new Promise(function (_resolve) {\n            resolve = _resolve;\n          });\n          newElt.addEventListener(\"load\", function () {\n            resolve();\n          });\n          promises.push(promise);\n        }\n        oldHead.appendChild(newElt);\n        ctx.callbacks.afterNodeAdded(newElt);\n        added.push(newElt);\n      }\n    }\n\n    // remove all removed elements, after we have appended the new elements to avoid\n    // additional network requests for things like style sheets\n    for (const removedElement of removed) {\n      if (ctx.callbacks.beforeNodeRemoved(removedElement) !== false) {\n        oldHead.removeChild(removedElement);\n        ctx.callbacks.afterNodeRemoved(removedElement);\n      }\n    }\n\n    ctx.head.afterHeadMorphed(oldHead, {\n      added: added,\n      kept: preserved,\n      removed: removed,\n    });\n    return promises;\n  }\n\n  //=============================================================================\n  // Create Morph Context Functions\n  //=============================================================================\n  const createMorphContext = (function () {\n    /**\n     *\n     * @param {Element} oldNode\n     * @param {Element} newContent\n     * @param {Config} config\n     * @returns {MorphContext}\n     */\n    function createMorphContext(oldNode, newContent, config) {\n      const { persistentIds, idMap } = createIdMaps(oldNode, newContent);\n\n      const mergedConfig = mergeDefaults(config);\n      const morphStyle = mergedConfig.morphStyle || \"outerHTML\";\n      if (![\"innerHTML\", \"outerHTML\"].includes(morphStyle)) {\n        throw `Do not understand how to morph style ${morphStyle}`;\n      }\n\n      return {\n        target: oldNode,\n        newContent: newContent,\n        config: mergedConfig,\n        morphStyle: morphStyle,\n        ignoreActive: mergedConfig.ignoreActive,\n        ignoreActiveValue: mergedConfig.ignoreActiveValue,\n        restoreFocus: mergedConfig.restoreFocus,\n        idMap: idMap,\n        persistentIds: persistentIds,\n        pantry: createPantry(),\n        callbacks: mergedConfig.callbacks,\n        head: mergedConfig.head,\n      };\n    }\n\n    /**\n     * Deep merges the config object and the Idiomorph.defaults object to\n     * produce a final configuration object\n     * @param {Config} config\n     * @returns {ConfigInternal}\n     */\n    function mergeDefaults(config) {\n      let finalConfig = Object.assign({}, defaults);\n\n      // copy top level stuff into final config\n      Object.assign(finalConfig, config);\n\n      // copy callbacks into final config (do this to deep merge the callbacks)\n      finalConfig.callbacks = Object.assign(\n        {},\n        defaults.callbacks,\n        config.callbacks,\n      );\n\n      // copy head config into final config  (do this to deep merge the head)\n      finalConfig.head = Object.assign({}, defaults.head, config.head);\n\n      return finalConfig;\n    }\n\n    /**\n     * @returns {HTMLDivElement}\n     */\n    function createPantry() {\n      const pantry = document.createElement(\"div\");\n      pantry.hidden = true;\n      document.body.insertAdjacentElement(\"afterend\", pantry);\n      return pantry;\n    }\n\n    /**\n     * Returns all elements with an ID contained within the root element and its descendants\n     *\n     * @param {Element} root\n     * @returns {Element[]}\n     */\n    function findIdElements(root) {\n      let elements = Array.from(root.querySelectorAll(\"[id]\"));\n      if (root.id) {\n        elements.push(root);\n      }\n      return elements;\n    }\n\n    /**\n     * A bottom-up algorithm that populates a map of Element -> IdSet.\n     * The idSet for a given element is the set of all IDs contained within its subtree.\n     * As an optimzation, we filter these IDs through the given list of persistent IDs,\n     * because we don't need to bother considering IDed elements that won't be in the new content.\n     *\n     * @param {Map<Node, Set<string>>} idMap\n     * @param {Set<string>} persistentIds\n     * @param {Element} root\n     * @param {Element[]} elements\n     */\n    function populateIdMapWithTree(idMap, persistentIds, root, elements) {\n      for (const elt of elements) {\n        if (persistentIds.has(elt.id)) {\n          /** @type {Element|null} */\n          let current = elt;\n          // walk up the parent hierarchy of that element, adding the id\n          // of element to the parent's id set\n          while (current) {\n            let idSet = idMap.get(current);\n            // if the id set doesn't exist, create it and insert it in the map\n            if (idSet == null) {\n              idSet = new Set();\n              idMap.set(current, idSet);\n            }\n            idSet.add(elt.id);\n\n            if (current === root) break;\n            current = current.parentElement;\n          }\n        }\n      }\n    }\n\n    /**\n     * This function computes a map of nodes to all ids contained within that node (inclusive of the\n     * node).  This map can be used to ask if two nodes have intersecting sets of ids, which allows\n     * for a looser definition of \"matching\" than tradition id matching, and allows child nodes\n     * to contribute to a parent nodes matching.\n     *\n     * @param {Element} oldContent  the old content that will be morphed\n     * @param {Element} newContent  the new content to morph to\n     * @returns {IdSets}\n     */\n    function createIdMaps(oldContent, newContent) {\n      const oldIdElements = findIdElements(oldContent);\n      const newIdElements = findIdElements(newContent);\n\n      const persistentIds = createPersistentIds(oldIdElements, newIdElements);\n\n      /** @type {Map<Node, Set<string>>} */\n      let idMap = new Map();\n      populateIdMapWithTree(idMap, persistentIds, oldContent, oldIdElements);\n\n      /** @ts-ignore - if newContent is a duck-typed parent, pass its single child node as the root to halt upwards iteration */\n      const newRoot = newContent.__idiomorphRoot || newContent;\n      populateIdMapWithTree(idMap, persistentIds, newRoot, newIdElements);\n\n      return { persistentIds, idMap };\n    }\n\n    /**\n     * This function computes the set of ids that persist between the two contents excluding duplicates\n     *\n     * @param {Element[]} oldIdElements\n     * @param {Element[]} newIdElements\n     * @returns {Set<string>}\n     */\n    function createPersistentIds(oldIdElements, newIdElements) {\n      let duplicateIds = new Set();\n\n      /** @type {Map<string, string>} */\n      let oldIdTagNameMap = new Map();\n      for (const { id, tagName } of oldIdElements) {\n        if (oldIdTagNameMap.has(id)) {\n          duplicateIds.add(id);\n        } else {\n          oldIdTagNameMap.set(id, tagName);\n        }\n      }\n\n      let persistentIds = new Set();\n      for (const { id, tagName } of newIdElements) {\n        if (persistentIds.has(id)) {\n          duplicateIds.add(id);\n        } else if (oldIdTagNameMap.get(id) === tagName) {\n          persistentIds.add(id);\n        }\n        // skip if tag types mismatch because its not possible to morph one tag into another\n      }\n\n      for (const id of duplicateIds) {\n        persistentIds.delete(id);\n      }\n      return persistentIds;\n    }\n\n    return createMorphContext;\n  })();\n\n  //=============================================================================\n  // HTML Normalization Functions\n  //=============================================================================\n  const { normalizeElement, normalizeParent } = (function () {\n    /** @type {WeakSet<Node>} */\n    const generatedByIdiomorph = new WeakSet();\n\n    /**\n     *\n     * @param {Element | Document} content\n     * @returns {Element}\n     */\n    function normalizeElement(content) {\n      if (content instanceof Document) {\n        return content.documentElement;\n      } else {\n        return content;\n      }\n    }\n\n    /**\n     *\n     * @param {null | string | Node | HTMLCollection | Node[] | Document & {generatedByIdiomorph:boolean}} newContent\n     * @returns {Element}\n     */\n    function normalizeParent(newContent) {\n      if (newContent == null) {\n        return document.createElement(\"div\"); // dummy parent element\n      } else if (typeof newContent === \"string\") {\n        return normalizeParent(parseContent(newContent));\n      } else if (\n        generatedByIdiomorph.has(/** @type {Element} */ (newContent))\n      ) {\n        // the template tag created by idiomorph parsing can serve as a dummy parent\n        return /** @type {Element} */ (newContent);\n      } else if (newContent instanceof Node) {\n        if (newContent.parentNode) {\n          // we can't use the parent directly because newContent may have siblings\n          // that we don't want in the morph, and reparenting might be expensive (TODO is it?),\n          // so we create a duck-typed parent node instead.\n          return createDuckTypedParent(newContent);\n        } else {\n          // a single node is added as a child to a dummy parent\n          const dummyParent = document.createElement(\"div\");\n          dummyParent.append(newContent);\n          return dummyParent;\n        }\n      } else {\n        // all nodes in the array or HTMLElement collection are consolidated under\n        // a single dummy parent element\n        const dummyParent = document.createElement(\"div\");\n        for (const elt of [...newContent]) {\n          dummyParent.append(elt);\n        }\n        return dummyParent;\n      }\n    }\n\n    /**\n     * Creates a fake duck-typed parent element to wrap a single node, without actually reparenting it.\n     * \"If it walks like a duck, and quacks like a duck, then it must be a duck!\" -- James Whitcomb Riley (1849\u20131916)\n     *\n     * @param {Node} newContent\n     * @returns {Element}\n     */\n    function createDuckTypedParent(newContent) {\n      return /** @type {Element} */ (\n        /** @type {unknown} */ ({\n          childNodes: [newContent],\n          /** @ts-ignore - cover your eyes for a minute, tsc */\n          querySelectorAll: (s) => {\n            /** @ts-ignore */\n            const elements = newContent.querySelectorAll(s);\n            /** @ts-ignore */\n            return newContent.matches(s) ? [newContent, ...elements] : elements;\n          },\n          /** @ts-ignore */\n          insertBefore: (n, r) => newContent.parentNode.insertBefore(n, r),\n          /** @ts-ignore */\n          moveBefore: (n, r) => newContent.parentNode.moveBefore(n, r),\n          // for later use with populateIdMapWithTree to halt upwards iteration\n          get __idiomorphRoot() {\n            return newContent;\n          },\n        })\n      );\n    }\n\n    /**\n     *\n     * @param {string} newContent\n     * @returns {Node | null | DocumentFragment}\n     */\n    function parseContent(newContent) {\n      let parser = new DOMParser();\n\n      // remove svgs to avoid false-positive matches on head, etc.\n      let contentWithSvgsRemoved = newContent.replace(\n        /<svg(\\s[^>]*>|>)([\\s\\S]*?)<\\/svg>/gim,\n        \"\",\n      );\n\n      // if the newContent contains a html, head or body tag, we can simply parse it w/o wrapping\n      if (\n        contentWithSvgsRemoved.match(/<\\/html>/) ||\n        contentWithSvgsRemoved.match(/<\\/head>/) ||\n        contentWithSvgsRemoved.match(/<\\/body>/)\n      ) {\n        let content = parser.parseFromString(newContent, \"text/html\");\n        // if it is a full HTML document, return the document itself as the parent container\n        if (contentWithSvgsRemoved.match(/<\\/html>/)) {\n          generatedByIdiomorph.add(content);\n          return content;\n        } else {\n          // otherwise return the html element as the parent container\n          let htmlElement = content.firstChild;\n          if (htmlElement) {\n            generatedByIdiomorph.add(htmlElement);\n          }\n          return htmlElement;\n        }\n      } else {\n        // if it is partial HTML, wrap it in a template tag to provide a parent element and also to help\n        // deal with touchy tags like tr, tbody, etc.\n        let responseDoc = parser.parseFromString(\n          \"<body><template>\" + newContent + \"</template></body>\",\n          \"text/html\",\n        );\n        let content = /** @type {HTMLTemplateElement} */ (\n          responseDoc.body.querySelector(\"template\")\n        ).content;\n        generatedByIdiomorph.add(content);\n        return content;\n      }\n    }\n\n    return { normalizeElement, normalizeParent };\n  })();\n\n  //=============================================================================\n  // This is what ends up becoming the Idiomorph global object\n  //=============================================================================\n  return {\n    morph,\n    defaults,\n  };\n})();\n\nfunction morphElements(currentElement, newElement, { callbacks, ...options } = {}) {\n  Idiomorph.morph(currentElement, newElement, {\n    ...options,\n    callbacks: new DefaultIdiomorphCallbacks(callbacks)\n  });\n}\n\nfunction morphChildren(currentElement, newElement) {\n  morphElements(currentElement, newElement.childNodes, {\n    morphStyle: \"innerHTML\"\n  });\n}\n\nclass DefaultIdiomorphCallbacks {\n  #beforeNodeMorphed\n\n  constructor({ beforeNodeMorphed } = {}) {\n    this.#beforeNodeMorphed = beforeNodeMorphed || (() => true);\n  }\n\n  beforeNodeAdded = (node) => {\n    return !(node.id && node.hasAttribute(\"data-turbo-permanent\") && document.getElementById(node.id))\n  }\n\n  beforeNodeMorphed = (currentElement, newElement) => {\n    if (currentElement instanceof Element) {\n      if (!currentElement.hasAttribute(\"data-turbo-permanent\") && this.#beforeNodeMorphed(currentElement, newElement)) {\n        const event = dispatch(\"turbo:before-morph-element\", {\n          cancelable: true,\n          target: currentElement,\n          detail: { currentElement, newElement }\n        });\n\n        return !event.defaultPrevented\n      } else {\n        return false\n      }\n    }\n  }\n\n  beforeAttributeUpdated = (attributeName, target, mutationType) => {\n    const event = dispatch(\"turbo:before-morph-attribute\", {\n      cancelable: true,\n      target,\n      detail: { attributeName, mutationType }\n    });\n\n    return !event.defaultPrevented\n  }\n\n  beforeNodeRemoved = (node) => {\n    return this.beforeNodeMorphed(node)\n  }\n\n  afterNodeMorphed = (currentElement, newElement) => {\n    if (currentElement instanceof Element) {\n      dispatch(\"turbo:morph-element\", {\n        target: currentElement,\n        detail: { currentElement, newElement }\n      });\n    }\n  }\n}\n\nclass MorphingFrameRenderer extends FrameRenderer {\n  static renderElement(currentElement, newElement) {\n    dispatch(\"turbo:before-frame-morph\", {\n      target: currentElement,\n      detail: { currentElement, newElement }\n    });\n\n    morphChildren(currentElement, newElement);\n  }\n\n  async preservingPermanentElements(callback) {\n    return await callback()\n  }\n}\n\nclass ProgressBar {\n  static animationDuration = 300 /*ms*/\n\n  static get defaultCSS() {\n    return unindent`\n      .turbo-progress-bar {\n        position: fixed;\n        display: block;\n        top: 0;\n        left: 0;\n        height: 3px;\n        background: #0076ff;\n        z-index: 2147483647;\n        transition:\n          width ${ProgressBar.animationDuration}ms ease-out,\n          opacity ${ProgressBar.animationDuration / 2}ms ${ProgressBar.animationDuration / 2}ms ease-in;\n        transform: translate3d(0, 0, 0);\n      }\n    `\n  }\n\n  hiding = false\n  value = 0\n  visible = false\n\n  constructor() {\n    this.stylesheetElement = this.createStylesheetElement();\n    this.progressElement = this.createProgressElement();\n    this.installStylesheetElement();\n    this.setValue(0);\n  }\n\n  show() {\n    if (!this.visible) {\n      this.visible = true;\n      this.installProgressElement();\n      this.startTrickling();\n    }\n  }\n\n  hide() {\n    if (this.visible && !this.hiding) {\n      this.hiding = true;\n      this.fadeProgressElement(() => {\n        this.uninstallProgressElement();\n        this.stopTrickling();\n        this.visible = false;\n        this.hiding = false;\n      });\n    }\n  }\n\n  setValue(value) {\n    this.value = value;\n    this.refresh();\n  }\n\n  // Private\n\n  installStylesheetElement() {\n    document.head.insertBefore(this.stylesheetElement, document.head.firstChild);\n  }\n\n  installProgressElement() {\n    this.progressElement.style.width = \"0\";\n    this.progressElement.style.opacity = \"1\";\n    document.documentElement.insertBefore(this.progressElement, document.body);\n    this.refresh();\n  }\n\n  fadeProgressElement(callback) {\n    this.progressElement.style.opacity = \"0\";\n    setTimeout(callback, ProgressBar.animationDuration * 1.5);\n  }\n\n  uninstallProgressElement() {\n    if (this.progressElement.parentNode) {\n      document.documentElement.removeChild(this.progressElement);\n    }\n  }\n\n  startTrickling() {\n    if (!this.trickleInterval) {\n      this.trickleInterval = window.setInterval(this.trickle, ProgressBar.animationDuration);\n    }\n  }\n\n  stopTrickling() {\n    window.clearInterval(this.trickleInterval);\n    delete this.trickleInterval;\n  }\n\n  trickle = () => {\n    this.setValue(this.value + Math.random() / 100);\n  }\n\n  refresh() {\n    requestAnimationFrame(() => {\n      this.progressElement.style.width = `${10 + this.value * 90}%`;\n    });\n  }\n\n  createStylesheetElement() {\n    const element = document.createElement(\"style\");\n    element.type = \"text/css\";\n    element.textContent = ProgressBar.defaultCSS;\n    const cspNonce = getCspNonce();\n    if (cspNonce) {\n      element.nonce = cspNonce;\n    }\n    return element\n  }\n\n  createProgressElement() {\n    const element = document.createElement(\"div\");\n    element.className = \"turbo-progress-bar\";\n    return element\n  }\n}\n\nclass HeadSnapshot extends Snapshot {\n  detailsByOuterHTML = this.children\n    .filter((element) => !elementIsNoscript(element))\n    .map((element) => elementWithoutNonce(element))\n    .reduce((result, element) => {\n      const { outerHTML } = element;\n      const details =\n        outerHTML in result\n          ? result[outerHTML]\n          : {\n              type: elementType(element),\n              tracked: elementIsTracked(element),\n              elements: []\n            };\n      return {\n        ...result,\n        [outerHTML]: {\n          ...details,\n          elements: [...details.elements, element]\n        }\n      }\n    }, {})\n\n  get trackedElementSignature() {\n    return Object.keys(this.detailsByOuterHTML)\n      .filter((outerHTML) => this.detailsByOuterHTML[outerHTML].tracked)\n      .join(\"\")\n  }\n\n  getScriptElementsNotInSnapshot(snapshot) {\n    return this.getElementsMatchingTypeNotInSnapshot(\"script\", snapshot)\n  }\n\n  getStylesheetElementsNotInSnapshot(snapshot) {\n    return this.getElementsMatchingTypeNotInSnapshot(\"stylesheet\", snapshot)\n  }\n\n  getElementsMatchingTypeNotInSnapshot(matchedType, snapshot) {\n    return Object.keys(this.detailsByOuterHTML)\n      .filter((outerHTML) => !(outerHTML in snapshot.detailsByOuterHTML))\n      .map((outerHTML) => this.detailsByOuterHTML[outerHTML])\n      .filter(({ type }) => type == matchedType)\n      .map(({ elements: [element] }) => element)\n  }\n\n  get provisionalElements() {\n    return Object.keys(this.detailsByOuterHTML).reduce((result, outerHTML) => {\n      const { type, tracked, elements } = this.detailsByOuterHTML[outerHTML];\n      if (type == null && !tracked) {\n        return [...result, ...elements]\n      } else if (elements.length > 1) {\n        return [...result, ...elements.slice(1)]\n      } else {\n        return result\n      }\n    }, [])\n  }\n\n  getMetaValue(name) {\n    const element = this.findMetaElementByName(name);\n    return element ? element.getAttribute(\"content\") : null\n  }\n\n  findMetaElementByName(name) {\n    return Object.keys(this.detailsByOuterHTML).reduce((result, outerHTML) => {\n      const {\n        elements: [element]\n      } = this.detailsByOuterHTML[outerHTML];\n      return elementIsMetaElementWithName(element, name) ? element : result\n    }, undefined | undefined)\n  }\n}\n\nfunction elementType(element) {\n  if (elementIsScript(element)) {\n    return \"script\"\n  } else if (elementIsStylesheet(element)) {\n    return \"stylesheet\"\n  }\n}\n\nfunction elementIsTracked(element) {\n  return element.getAttribute(\"data-turbo-track\") == \"reload\"\n}\n\nfunction elementIsScript(element) {\n  const tagName = element.localName;\n  return tagName == \"script\"\n}\n\nfunction elementIsNoscript(element) {\n  const tagName = element.localName;\n  return tagName == \"noscript\"\n}\n\nfunction elementIsStylesheet(element) {\n  const tagName = element.localName;\n  return tagName == \"style\" || (tagName == \"link\" && element.getAttribute(\"rel\") == \"stylesheet\")\n}\n\nfunction elementIsMetaElementWithName(element, name) {\n  const tagName = element.localName;\n  return tagName == \"meta\" && element.getAttribute(\"name\") == name\n}\n\nfunction elementWithoutNonce(element) {\n  if (element.hasAttribute(\"nonce\")) {\n    element.setAttribute(\"nonce\", \"\");\n  }\n\n  return element\n}\n\nclass PageSnapshot extends Snapshot {\n  static fromHTMLString(html = \"\") {\n    return this.fromDocument(parseHTMLDocument(html))\n  }\n\n  static fromElement(element) {\n    return this.fromDocument(element.ownerDocument)\n  }\n\n  static fromDocument({ documentElement, body, head }) {\n    return new this(documentElement, body, new HeadSnapshot(head))\n  }\n\n  constructor(documentElement, body, headSnapshot) {\n    super(body);\n    this.documentElement = documentElement;\n    this.headSnapshot = headSnapshot;\n  }\n\n  clone() {\n    const clonedElement = this.element.cloneNode(true);\n\n    const selectElements = this.element.querySelectorAll(\"select\");\n    const clonedSelectElements = clonedElement.querySelectorAll(\"select\");\n\n    for (const [index, source] of selectElements.entries()) {\n      const clone = clonedSelectElements[index];\n      for (const option of clone.selectedOptions) option.selected = false;\n      for (const option of source.selectedOptions) clone.options[option.index].selected = true;\n    }\n\n    for (const clonedPasswordInput of clonedElement.querySelectorAll('input[type=\"password\"]')) {\n      clonedPasswordInput.value = \"\";\n    }\n\n    return new PageSnapshot(this.documentElement, clonedElement, this.headSnapshot)\n  }\n\n  get lang() {\n    return this.documentElement.getAttribute(\"lang\")\n  }\n\n  get headElement() {\n    return this.headSnapshot.element\n  }\n\n  get rootLocation() {\n    const root = this.getSetting(\"root\") ?? \"/\";\n    return expandURL(root)\n  }\n\n  get cacheControlValue() {\n    return this.getSetting(\"cache-control\")\n  }\n\n  get isPreviewable() {\n    return this.cacheControlValue != \"no-preview\"\n  }\n\n  get isCacheable() {\n    return this.cacheControlValue != \"no-cache\"\n  }\n\n  get isVisitable() {\n    return this.getSetting(\"visit-control\") != \"reload\"\n  }\n\n  get prefersViewTransitions() {\n    return this.headSnapshot.getMetaValue(\"view-transition\") === \"same-origin\"\n  }\n\n  get shouldMorphPage() {\n    return this.getSetting(\"refresh-method\") === \"morph\"\n  }\n\n  get shouldPreserveScrollPosition() {\n    return this.getSetting(\"refresh-scroll\") === \"preserve\"\n  }\n\n  // Private\n\n  getSetting(name) {\n    return this.headSnapshot.getMetaValue(`turbo-${name}`)\n  }\n}\n\nclass ViewTransitioner {\n  #viewTransitionStarted = false\n  #lastOperation = Promise.resolve()\n\n  renderChange(useViewTransition, render) {\n    if (useViewTransition && this.viewTransitionsAvailable && !this.#viewTransitionStarted) {\n      this.#viewTransitionStarted = true;\n      this.#lastOperation = this.#lastOperation.then(async () => {\n        await document.startViewTransition(render).finished;\n      });\n    } else {\n      this.#lastOperation = this.#lastOperation.then(render);\n    }\n\n    return this.#lastOperation\n  }\n\n  get viewTransitionsAvailable() {\n    return document.startViewTransition\n  }\n}\n\nconst defaultOptions = {\n  action: \"advance\",\n  historyChanged: false,\n  visitCachedSnapshot: () => {},\n  willRender: true,\n  updateHistory: true,\n  shouldCacheSnapshot: true,\n  acceptsStreamResponse: false\n};\n\nconst TimingMetric = {\n  visitStart: \"visitStart\",\n  requestStart: \"requestStart\",\n  requestEnd: \"requestEnd\",\n  visitEnd: \"visitEnd\"\n};\n\nconst VisitState = {\n  initialized: \"initialized\",\n  started: \"started\",\n  canceled: \"canceled\",\n  failed: \"failed\",\n  completed: \"completed\"\n};\n\nconst SystemStatusCode = {\n  networkFailure: 0,\n  timeoutFailure: -1,\n  contentTypeMismatch: -2\n};\n\nconst Direction = {\n  advance: \"forward\",\n  restore: \"back\",\n  replace: \"none\"\n};\n\nclass Visit {\n  identifier = uuid() // Required by turbo-ios\n  timingMetrics = {}\n\n  followedRedirect = false\n  historyChanged = false\n  scrolled = false\n  shouldCacheSnapshot = true\n  acceptsStreamResponse = false\n  snapshotCached = false\n  state = VisitState.initialized\n  viewTransitioner = new ViewTransitioner()\n\n  constructor(delegate, location, restorationIdentifier, options = {}) {\n    this.delegate = delegate;\n    this.location = location;\n    this.restorationIdentifier = restorationIdentifier || uuid();\n\n    const {\n      action,\n      historyChanged,\n      referrer,\n      snapshot,\n      snapshotHTML,\n      response,\n      visitCachedSnapshot,\n      willRender,\n      updateHistory,\n      shouldCacheSnapshot,\n      acceptsStreamResponse,\n      direction\n    } = {\n      ...defaultOptions,\n      ...options\n    };\n    this.action = action;\n    this.historyChanged = historyChanged;\n    this.referrer = referrer;\n    this.snapshot = snapshot;\n    this.snapshotHTML = snapshotHTML;\n    this.response = response;\n    this.isSamePage = this.delegate.locationWithActionIsSamePage(this.location, this.action);\n    this.isPageRefresh = this.view.isPageRefresh(this);\n    this.visitCachedSnapshot = visitCachedSnapshot;\n    this.willRender = willRender;\n    this.updateHistory = updateHistory;\n    this.scrolled = !willRender;\n    this.shouldCacheSnapshot = shouldCacheSnapshot;\n    this.acceptsStreamResponse = acceptsStreamResponse;\n    this.direction = direction || Direction[action];\n  }\n\n  get adapter() {\n    return this.delegate.adapter\n  }\n\n  get view() {\n    return this.delegate.view\n  }\n\n  get history() {\n    return this.delegate.history\n  }\n\n  get restorationData() {\n    return this.history.getRestorationDataForIdentifier(this.restorationIdentifier)\n  }\n\n  get silent() {\n    return this.isSamePage\n  }\n\n  start() {\n    if (this.state == VisitState.initialized) {\n      this.recordTimingMetric(TimingMetric.visitStart);\n      this.state = VisitState.started;\n      this.adapter.visitStarted(this);\n      this.delegate.visitStarted(this);\n    }\n  }\n\n  cancel() {\n    if (this.state == VisitState.started) {\n      if (this.request) {\n        this.request.cancel();\n      }\n      this.cancelRender();\n      this.state = VisitState.canceled;\n    }\n  }\n\n  complete() {\n    if (this.state == VisitState.started) {\n      this.recordTimingMetric(TimingMetric.visitEnd);\n      this.adapter.visitCompleted(this);\n      this.state = VisitState.completed;\n      this.followRedirect();\n\n      if (!this.followedRedirect) {\n        this.delegate.visitCompleted(this);\n      }\n    }\n  }\n\n  fail() {\n    if (this.state == VisitState.started) {\n      this.state = VisitState.failed;\n      this.adapter.visitFailed(this);\n      this.delegate.visitCompleted(this);\n    }\n  }\n\n  changeHistory() {\n    if (!this.historyChanged && this.updateHistory) {\n      const actionForHistory = this.location.href === this.referrer?.href ? \"replace\" : this.action;\n      const method = getHistoryMethodForAction(actionForHistory);\n      this.history.update(method, this.location, this.restorationIdentifier);\n      this.historyChanged = true;\n    }\n  }\n\n  issueRequest() {\n    if (this.hasPreloadedResponse()) {\n      this.simulateRequest();\n    } else if (this.shouldIssueRequest() && !this.request) {\n      this.request = new FetchRequest(this, FetchMethod.get, this.location);\n      this.request.perform();\n    }\n  }\n\n  simulateRequest() {\n    if (this.response) {\n      this.startRequest();\n      this.recordResponse();\n      this.finishRequest();\n    }\n  }\n\n  startRequest() {\n    this.recordTimingMetric(TimingMetric.requestStart);\n    this.adapter.visitRequestStarted(this);\n  }\n\n  recordResponse(response = this.response) {\n    this.response = response;\n    if (response) {\n      const { statusCode } = response;\n      if (isSuccessful(statusCode)) {\n        this.adapter.visitRequestCompleted(this);\n      } else {\n        this.adapter.visitRequestFailedWithStatusCode(this, statusCode);\n      }\n    }\n  }\n\n  finishRequest() {\n    this.recordTimingMetric(TimingMetric.requestEnd);\n    this.adapter.visitRequestFinished(this);\n  }\n\n  loadResponse() {\n    if (this.response) {\n      const { statusCode, responseHTML } = this.response;\n      this.render(async () => {\n        if (this.shouldCacheSnapshot) this.cacheSnapshot();\n        if (this.view.renderPromise) await this.view.renderPromise;\n\n        if (isSuccessful(statusCode) && responseHTML != null) {\n          const snapshot = PageSnapshot.fromHTMLString(responseHTML);\n          await this.renderPageSnapshot(snapshot, false);\n\n          this.adapter.visitRendered(this);\n          this.complete();\n        } else {\n          await this.view.renderError(PageSnapshot.fromHTMLString(responseHTML), this);\n          this.adapter.visitRendered(this);\n          this.fail();\n        }\n      });\n    }\n  }\n\n  getCachedSnapshot() {\n    const snapshot = this.view.getCachedSnapshotForLocation(this.location) || this.getPreloadedSnapshot();\n\n    if (snapshot && (!getAnchor(this.location) || snapshot.hasAnchor(getAnchor(this.location)))) {\n      if (this.action == \"restore\" || snapshot.isPreviewable) {\n        return snapshot\n      }\n    }\n  }\n\n  getPreloadedSnapshot() {\n    if (this.snapshotHTML) {\n      return PageSnapshot.fromHTMLString(this.snapshotHTML)\n    }\n  }\n\n  hasCachedSnapshot() {\n    return this.getCachedSnapshot() != null\n  }\n\n  loadCachedSnapshot() {\n    const snapshot = this.getCachedSnapshot();\n    if (snapshot) {\n      const isPreview = this.shouldIssueRequest();\n      this.render(async () => {\n        this.cacheSnapshot();\n        if (this.isSamePage || this.isPageRefresh) {\n          this.adapter.visitRendered(this);\n        } else {\n          if (this.view.renderPromise) await this.view.renderPromise;\n\n          await this.renderPageSnapshot(snapshot, isPreview);\n\n          this.adapter.visitRendered(this);\n          if (!isPreview) {\n            this.complete();\n          }\n        }\n      });\n    }\n  }\n\n  followRedirect() {\n    if (this.redirectedToLocation && !this.followedRedirect && this.response?.redirected) {\n      this.adapter.visitProposedToLocation(this.redirectedToLocation, {\n        action: \"replace\",\n        response: this.response,\n        shouldCacheSnapshot: false,\n        willRender: false\n      });\n      this.followedRedirect = true;\n    }\n  }\n\n  goToSamePageAnchor() {\n    if (this.isSamePage) {\n      this.render(async () => {\n        this.cacheSnapshot();\n        this.performScroll();\n        this.changeHistory();\n        this.adapter.visitRendered(this);\n      });\n    }\n  }\n\n  // Fetch request delegate\n\n  prepareRequest(request) {\n    if (this.acceptsStreamResponse) {\n      request.acceptResponseType(StreamMessage.contentType);\n    }\n  }\n\n  requestStarted() {\n    this.startRequest();\n  }\n\n  requestPreventedHandlingResponse(_request, _response) {}\n\n  async requestSucceededWithResponse(request, response) {\n    const responseHTML = await response.responseHTML;\n    const { redirected, statusCode } = response;\n    if (responseHTML == undefined) {\n      this.recordResponse({\n        statusCode: SystemStatusCode.contentTypeMismatch,\n        redirected\n      });\n    } else {\n      this.redirectedToLocation = response.redirected ? response.location : undefined;\n      this.recordResponse({ statusCode: statusCode, responseHTML, redirected });\n    }\n  }\n\n  async requestFailedWithResponse(request, response) {\n    const responseHTML = await response.responseHTML;\n    const { redirected, statusCode } = response;\n    if (responseHTML == undefined) {\n      this.recordResponse({\n        statusCode: SystemStatusCode.contentTypeMismatch,\n        redirected\n      });\n    } else {\n      this.recordResponse({ statusCode: statusCode, responseHTML, redirected });\n    }\n  }\n\n  requestErrored(_request, _error) {\n    this.recordResponse({\n      statusCode: SystemStatusCode.networkFailure,\n      redirected: false\n    });\n  }\n\n  requestFinished() {\n    this.finishRequest();\n  }\n\n  // Scrolling\n\n  performScroll() {\n    if (!this.scrolled && !this.view.forceReloaded && !this.view.shouldPreserveScrollPosition(this)) {\n      if (this.action == \"restore\") {\n        this.scrollToRestoredPosition() || this.scrollToAnchor() || this.view.scrollToTop();\n      } else {\n        this.scrollToAnchor() || this.view.scrollToTop();\n      }\n      if (this.isSamePage) {\n        this.delegate.visitScrolledToSamePageLocation(this.view.lastRenderedLocation, this.location);\n      }\n\n      this.scrolled = true;\n    }\n  }\n\n  scrollToRestoredPosition() {\n    const { scrollPosition } = this.restorationData;\n    if (scrollPosition) {\n      this.view.scrollToPosition(scrollPosition);\n      return true\n    }\n  }\n\n  scrollToAnchor() {\n    const anchor = getAnchor(this.location);\n    if (anchor != null) {\n      this.view.scrollToAnchor(anchor);\n      return true\n    }\n  }\n\n  // Instrumentation\n\n  recordTimingMetric(metric) {\n    this.timingMetrics[metric] = new Date().getTime();\n  }\n\n  getTimingMetrics() {\n    return { ...this.timingMetrics }\n  }\n\n  // Private\n\n  hasPreloadedResponse() {\n    return typeof this.response == \"object\"\n  }\n\n  shouldIssueRequest() {\n    if (this.isSamePage) {\n      return false\n    } else if (this.action == \"restore\") {\n      return !this.hasCachedSnapshot()\n    } else {\n      return this.willRender\n    }\n  }\n\n  cacheSnapshot() {\n    if (!this.snapshotCached) {\n      this.view.cacheSnapshot(this.snapshot).then((snapshot) => snapshot && this.visitCachedSnapshot(snapshot));\n      this.snapshotCached = true;\n    }\n  }\n\n  async render(callback) {\n    this.cancelRender();\n    await new Promise((resolve) => {\n      this.frame =\n        document.visibilityState === \"hidden\" ? setTimeout(() => resolve(), 0) : requestAnimationFrame(() => resolve());\n    });\n    await callback();\n    delete this.frame;\n  }\n\n  async renderPageSnapshot(snapshot, isPreview) {\n    await this.viewTransitioner.renderChange(this.view.shouldTransitionTo(snapshot), async () => {\n      await this.view.renderPage(snapshot, isPreview, this.willRender, this);\n      this.performScroll();\n    });\n  }\n\n  cancelRender() {\n    if (this.frame) {\n      cancelAnimationFrame(this.frame);\n      delete this.frame;\n    }\n  }\n}\n\nfunction isSuccessful(statusCode) {\n  return statusCode >= 200 && statusCode < 300\n}\n\nclass BrowserAdapter {\n  progressBar = new ProgressBar()\n\n  constructor(session) {\n    this.session = session;\n  }\n\n  visitProposedToLocation(location, options) {\n    if (locationIsVisitable(location, this.navigator.rootLocation)) {\n      this.navigator.startVisit(location, options?.restorationIdentifier || uuid(), options);\n    } else {\n      window.location.href = location.toString();\n    }\n  }\n\n  visitStarted(visit) {\n    this.location = visit.location;\n    visit.loadCachedSnapshot();\n    visit.issueRequest();\n    visit.goToSamePageAnchor();\n  }\n\n  visitRequestStarted(visit) {\n    this.progressBar.setValue(0);\n    if (visit.hasCachedSnapshot() || visit.action != \"restore\") {\n      this.showVisitProgressBarAfterDelay();\n    } else {\n      this.showProgressBar();\n    }\n  }\n\n  visitRequestCompleted(visit) {\n    visit.loadResponse();\n  }\n\n  visitRequestFailedWithStatusCode(visit, statusCode) {\n    switch (statusCode) {\n      case SystemStatusCode.networkFailure:\n      case SystemStatusCode.timeoutFailure:\n      case SystemStatusCode.contentTypeMismatch:\n        return this.reload({\n          reason: \"request_failed\",\n          context: {\n            statusCode\n          }\n        })\n      default:\n        return visit.loadResponse()\n    }\n  }\n\n  visitRequestFinished(_visit) {}\n\n  visitCompleted(_visit) {\n    this.progressBar.setValue(1);\n    this.hideVisitProgressBar();\n  }\n\n  pageInvalidated(reason) {\n    this.reload(reason);\n  }\n\n  visitFailed(_visit) {\n    this.progressBar.setValue(1);\n    this.hideVisitProgressBar();\n  }\n\n  visitRendered(_visit) {}\n\n  // Link prefetching\n\n  linkPrefetchingIsEnabledForLocation(location) {\n    return true\n  }\n\n  // Form Submission Delegate\n\n  formSubmissionStarted(_formSubmission) {\n    this.progressBar.setValue(0);\n    this.showFormProgressBarAfterDelay();\n  }\n\n  formSubmissionFinished(_formSubmission) {\n    this.progressBar.setValue(1);\n    this.hideFormProgressBar();\n  }\n\n  // Private\n\n  showVisitProgressBarAfterDelay() {\n    this.visitProgressBarTimeout = window.setTimeout(this.showProgressBar, this.session.progressBarDelay);\n  }\n\n  hideVisitProgressBar() {\n    this.progressBar.hide();\n    if (this.visitProgressBarTimeout != null) {\n      window.clearTimeout(this.visitProgressBarTimeout);\n      delete this.visitProgressBarTimeout;\n    }\n  }\n\n  showFormProgressBarAfterDelay() {\n    if (this.formProgressBarTimeout == null) {\n      this.formProgressBarTimeout = window.setTimeout(this.showProgressBar, this.session.progressBarDelay);\n    }\n  }\n\n  hideFormProgressBar() {\n    this.progressBar.hide();\n    if (this.formProgressBarTimeout != null) {\n      window.clearTimeout(this.formProgressBarTimeout);\n      delete this.formProgressBarTimeout;\n    }\n  }\n\n  showProgressBar = () => {\n    this.progressBar.show();\n  }\n\n  reload(reason) {\n    dispatch(\"turbo:reload\", { detail: reason });\n\n    window.location.href = this.location?.toString() || window.location.href;\n  }\n\n  get navigator() {\n    return this.session.navigator\n  }\n}\n\nclass CacheObserver {\n  selector = \"[data-turbo-temporary]\"\n  deprecatedSelector = \"[data-turbo-cache=false]\"\n\n  started = false\n\n  start() {\n    if (!this.started) {\n      this.started = true;\n      addEventListener(\"turbo:before-cache\", this.removeTemporaryElements, false);\n    }\n  }\n\n  stop() {\n    if (this.started) {\n      this.started = false;\n      removeEventListener(\"turbo:before-cache\", this.removeTemporaryElements, false);\n    }\n  }\n\n  removeTemporaryElements = (_event) => {\n    for (const element of this.temporaryElements) {\n      element.remove();\n    }\n  }\n\n  get temporaryElements() {\n    return [...document.querySelectorAll(this.selector), ...this.temporaryElementsWithDeprecation]\n  }\n\n  get temporaryElementsWithDeprecation() {\n    const elements = document.querySelectorAll(this.deprecatedSelector);\n\n    if (elements.length) {\n      console.warn(\n        `The ${this.deprecatedSelector} selector is deprecated and will be removed in a future version. Use ${this.selector} instead.`\n      );\n    }\n\n    return [...elements]\n  }\n}\n\nclass FrameRedirector {\n  constructor(session, element) {\n    this.session = session;\n    this.element = element;\n    this.linkInterceptor = new LinkInterceptor(this, element);\n    this.formSubmitObserver = new FormSubmitObserver(this, element);\n  }\n\n  start() {\n    this.linkInterceptor.start();\n    this.formSubmitObserver.start();\n  }\n\n  stop() {\n    this.linkInterceptor.stop();\n    this.formSubmitObserver.stop();\n  }\n\n  // Link interceptor delegate\n\n  shouldInterceptLinkClick(element, _location, _event) {\n    return this.#shouldRedirect(element)\n  }\n\n  linkClickIntercepted(element, url, event) {\n    const frame = this.#findFrameElement(element);\n    if (frame) {\n      frame.delegate.linkClickIntercepted(element, url, event);\n    }\n  }\n\n  // Form submit observer delegate\n\n  willSubmitForm(element, submitter) {\n    return (\n      element.closest(\"turbo-frame\") == null &&\n      this.#shouldSubmit(element, submitter) &&\n      this.#shouldRedirect(element, submitter)\n    )\n  }\n\n  formSubmitted(element, submitter) {\n    const frame = this.#findFrameElement(element, submitter);\n    if (frame) {\n      frame.delegate.formSubmitted(element, submitter);\n    }\n  }\n\n  #shouldSubmit(form, submitter) {\n    const action = getAction$1(form, submitter);\n    const meta = this.element.ownerDocument.querySelector(`meta[name=\"turbo-root\"]`);\n    const rootLocation = expandURL(meta?.content ?? \"/\");\n\n    return this.#shouldRedirect(form, submitter) && locationIsVisitable(action, rootLocation)\n  }\n\n  #shouldRedirect(element, submitter) {\n    const isNavigatable =\n      element instanceof HTMLFormElement\n        ? this.session.submissionIsNavigatable(element, submitter)\n        : this.session.elementIsNavigatable(element);\n\n    if (isNavigatable) {\n      const frame = this.#findFrameElement(element, submitter);\n      return frame ? frame != element.closest(\"turbo-frame\") : false\n    } else {\n      return false\n    }\n  }\n\n  #findFrameElement(element, submitter) {\n    const id = submitter?.getAttribute(\"data-turbo-frame\") || element.getAttribute(\"data-turbo-frame\");\n    if (id && id != \"_top\") {\n      const frame = this.element.querySelector(`#${id}:not([disabled])`);\n      if (frame instanceof FrameElement) {\n        return frame\n      }\n    }\n  }\n}\n\nclass History {\n  location\n  restorationIdentifier = uuid()\n  restorationData = {}\n  started = false\n  pageLoaded = false\n  currentIndex = 0\n\n  constructor(delegate) {\n    this.delegate = delegate;\n  }\n\n  start() {\n    if (!this.started) {\n      addEventListener(\"popstate\", this.onPopState, false);\n      addEventListener(\"load\", this.onPageLoad, false);\n      this.currentIndex = history.state?.turbo?.restorationIndex || 0;\n      this.started = true;\n      this.replace(new URL(window.location.href));\n    }\n  }\n\n  stop() {\n    if (this.started) {\n      removeEventListener(\"popstate\", this.onPopState, false);\n      removeEventListener(\"load\", this.onPageLoad, false);\n      this.started = false;\n    }\n  }\n\n  push(location, restorationIdentifier) {\n    this.update(history.pushState, location, restorationIdentifier);\n  }\n\n  replace(location, restorationIdentifier) {\n    this.update(history.replaceState, location, restorationIdentifier);\n  }\n\n  update(method, location, restorationIdentifier = uuid()) {\n    if (method === history.pushState) ++this.currentIndex;\n\n    const state = { turbo: { restorationIdentifier, restorationIndex: this.currentIndex } };\n    method.call(history, state, \"\", location.href);\n    this.location = location;\n    this.restorationIdentifier = restorationIdentifier;\n  }\n\n  // Restoration data\n\n  getRestorationDataForIdentifier(restorationIdentifier) {\n    return this.restorationData[restorationIdentifier] || {}\n  }\n\n  updateRestorationData(additionalData) {\n    const { restorationIdentifier } = this;\n    const restorationData = this.restorationData[restorationIdentifier];\n    this.restorationData[restorationIdentifier] = {\n      ...restorationData,\n      ...additionalData\n    };\n  }\n\n  // Scroll restoration\n\n  assumeControlOfScrollRestoration() {\n    if (!this.previousScrollRestoration) {\n      this.previousScrollRestoration = history.scrollRestoration ?? \"auto\";\n      history.scrollRestoration = \"manual\";\n    }\n  }\n\n  relinquishControlOfScrollRestoration() {\n    if (this.previousScrollRestoration) {\n      history.scrollRestoration = this.previousScrollRestoration;\n      delete this.previousScrollRestoration;\n    }\n  }\n\n  // Event handlers\n\n  onPopState = (event) => {\n    if (this.shouldHandlePopState()) {\n      const { turbo } = event.state || {};\n      if (turbo) {\n        this.location = new URL(window.location.href);\n        const { restorationIdentifier, restorationIndex } = turbo;\n        this.restorationIdentifier = restorationIdentifier;\n        const direction = restorationIndex > this.currentIndex ? \"forward\" : \"back\";\n        this.delegate.historyPoppedToLocationWithRestorationIdentifierAndDirection(this.location, restorationIdentifier, direction);\n        this.currentIndex = restorationIndex;\n      }\n    }\n  }\n\n  onPageLoad = async (_event) => {\n    await nextMicrotask();\n    this.pageLoaded = true;\n  }\n\n  // Private\n\n  shouldHandlePopState() {\n    // Safari dispatches a popstate event after window's load event, ignore it\n    return this.pageIsLoaded()\n  }\n\n  pageIsLoaded() {\n    return this.pageLoaded || document.readyState == \"complete\"\n  }\n}\n\nclass LinkPrefetchObserver {\n  started = false\n  #prefetchedLink = null\n\n  constructor(delegate, eventTarget) {\n    this.delegate = delegate;\n    this.eventTarget = eventTarget;\n  }\n\n  start() {\n    if (this.started) return\n\n    if (this.eventTarget.readyState === \"loading\") {\n      this.eventTarget.addEventListener(\"DOMContentLoaded\", this.#enable, { once: true });\n    } else {\n      this.#enable();\n    }\n  }\n\n  stop() {\n    if (!this.started) return\n\n    this.eventTarget.removeEventListener(\"mouseenter\", this.#tryToPrefetchRequest, {\n      capture: true,\n      passive: true\n    });\n    this.eventTarget.removeEventListener(\"mouseleave\", this.#cancelRequestIfObsolete, {\n      capture: true,\n      passive: true\n    });\n\n    this.eventTarget.removeEventListener(\"turbo:before-fetch-request\", this.#tryToUsePrefetchedRequest, true);\n    this.started = false;\n  }\n\n  #enable = () => {\n    this.eventTarget.addEventListener(\"mouseenter\", this.#tryToPrefetchRequest, {\n      capture: true,\n      passive: true\n    });\n    this.eventTarget.addEventListener(\"mouseleave\", this.#cancelRequestIfObsolete, {\n      capture: true,\n      passive: true\n    });\n\n    this.eventTarget.addEventListener(\"turbo:before-fetch-request\", this.#tryToUsePrefetchedRequest, true);\n    this.started = true;\n  }\n\n  #tryToPrefetchRequest = (event) => {\n    if (getMetaContent(\"turbo-prefetch\") === \"false\") return\n\n    const target = event.target;\n    const isLink = target.matches && target.matches(\"a[href]:not([target^=_]):not([download])\");\n\n    if (isLink && this.#isPrefetchable(target)) {\n      const link = target;\n      const location = getLocationForLink(link);\n\n      if (this.delegate.canPrefetchRequestToLocation(link, location)) {\n        this.#prefetchedLink = link;\n\n        const fetchRequest = new FetchRequest(\n          this,\n          FetchMethod.get,\n          location,\n          new URLSearchParams(),\n          target\n        );\n\n        prefetchCache.setLater(location.toString(), fetchRequest, this.#cacheTtl);\n      }\n    }\n  }\n\n  #cancelRequestIfObsolete = (event) => {\n    if (event.target === this.#prefetchedLink) this.#cancelPrefetchRequest();\n  }\n\n  #cancelPrefetchRequest = () => {\n    prefetchCache.clear();\n    this.#prefetchedLink = null;\n  }\n\n  #tryToUsePrefetchedRequest = (event) => {\n    if (event.target.tagName !== \"FORM\" && event.detail.fetchOptions.method === \"GET\") {\n      const cached = prefetchCache.get(event.detail.url.toString());\n\n      if (cached) {\n        // User clicked link, use cache response\n        event.detail.fetchRequest = cached;\n      }\n\n      prefetchCache.clear();\n    }\n  }\n\n  prepareRequest(request) {\n    const link = request.target;\n\n    request.headers[\"X-Sec-Purpose\"] = \"prefetch\";\n\n    const turboFrame = link.closest(\"turbo-frame\");\n    const turboFrameTarget = link.getAttribute(\"data-turbo-frame\") || turboFrame?.getAttribute(\"target\") || turboFrame?.id;\n\n    if (turboFrameTarget && turboFrameTarget !== \"_top\") {\n      request.headers[\"Turbo-Frame\"] = turboFrameTarget;\n    }\n  }\n\n  // Fetch request interface\n\n  requestSucceededWithResponse() {}\n\n  requestStarted(fetchRequest) {}\n\n  requestErrored(fetchRequest) {}\n\n  requestFinished(fetchRequest) {}\n\n  requestPreventedHandlingResponse(fetchRequest, fetchResponse) {}\n\n  requestFailedWithResponse(fetchRequest, fetchResponse) {}\n\n  get #cacheTtl() {\n    return Number(getMetaContent(\"turbo-prefetch-cache-time\")) || cacheTtl\n  }\n\n  #isPrefetchable(link) {\n    const href = link.getAttribute(\"href\");\n\n    if (!href) return false\n\n    if (unfetchableLink(link)) return false\n    if (linkToTheSamePage(link)) return false\n    if (linkOptsOut(link)) return false\n    if (nonSafeLink(link)) return false\n    if (eventPrevented(link)) return false\n\n    return true\n  }\n}\n\nconst unfetchableLink = (link) => {\n  return link.origin !== document.location.origin || ![\"http:\", \"https:\"].includes(link.protocol) || link.hasAttribute(\"target\")\n};\n\nconst linkToTheSamePage = (link) => {\n  return (link.pathname + link.search === document.location.pathname + document.location.search) || link.href.startsWith(\"#\")\n};\n\nconst linkOptsOut = (link) => {\n  if (link.getAttribute(\"data-turbo-prefetch\") === \"false\") return true\n  if (link.getAttribute(\"data-turbo\") === \"false\") return true\n\n  const turboPrefetchParent = findClosestRecursively(link, \"[data-turbo-prefetch]\");\n  if (turboPrefetchParent && turboPrefetchParent.getAttribute(\"data-turbo-prefetch\") === \"false\") return true\n\n  return false\n};\n\nconst nonSafeLink = (link) => {\n  const turboMethod = link.getAttribute(\"data-turbo-method\");\n  if (turboMethod && turboMethod.toLowerCase() !== \"get\") return true\n\n  if (isUJS(link)) return true\n  if (link.hasAttribute(\"data-turbo-confirm\")) return true\n  if (link.hasAttribute(\"data-turbo-stream\")) return true\n\n  return false\n};\n\nconst isUJS = (link) => {\n  return link.hasAttribute(\"data-remote\") || link.hasAttribute(\"data-behavior\") || link.hasAttribute(\"data-confirm\") || link.hasAttribute(\"data-method\")\n};\n\nconst eventPrevented = (link) => {\n  const event = dispatch(\"turbo:before-prefetch\", { target: link, cancelable: true });\n  return event.defaultPrevented\n};\n\nclass Navigator {\n  constructor(delegate) {\n    this.delegate = delegate;\n  }\n\n  proposeVisit(location, options = {}) {\n    if (this.delegate.allowsVisitingLocationWithAction(location, options.action)) {\n      this.delegate.visitProposedToLocation(location, options);\n    }\n  }\n\n  startVisit(locatable, restorationIdentifier, options = {}) {\n    this.stop();\n    this.currentVisit = new Visit(this, expandURL(locatable), restorationIdentifier, {\n      referrer: this.location,\n      ...options\n    });\n    this.currentVisit.start();\n  }\n\n  submitForm(form, submitter) {\n    this.stop();\n    this.formSubmission = new FormSubmission(this, form, submitter, true);\n\n    this.formSubmission.start();\n  }\n\n  stop() {\n    if (this.formSubmission) {\n      this.formSubmission.stop();\n      delete this.formSubmission;\n    }\n\n    if (this.currentVisit) {\n      this.currentVisit.cancel();\n      delete this.currentVisit;\n    }\n  }\n\n  get adapter() {\n    return this.delegate.adapter\n  }\n\n  get view() {\n    return this.delegate.view\n  }\n\n  get rootLocation() {\n    return this.view.snapshot.rootLocation\n  }\n\n  get history() {\n    return this.delegate.history\n  }\n\n  // Form submission delegate\n\n  formSubmissionStarted(formSubmission) {\n    // Not all adapters implement formSubmissionStarted\n    if (typeof this.adapter.formSubmissionStarted === \"function\") {\n      this.adapter.formSubmissionStarted(formSubmission);\n    }\n  }\n\n  async formSubmissionSucceededWithResponse(formSubmission, fetchResponse) {\n    if (formSubmission == this.formSubmission) {\n      const responseHTML = await fetchResponse.responseHTML;\n      if (responseHTML) {\n        const shouldCacheSnapshot = formSubmission.isSafe;\n        if (!shouldCacheSnapshot) {\n          this.view.clearSnapshotCache();\n        }\n\n        const { statusCode, redirected } = fetchResponse;\n        const action = this.#getActionForFormSubmission(formSubmission, fetchResponse);\n        const visitOptions = {\n          action,\n          shouldCacheSnapshot,\n          response: { statusCode, responseHTML, redirected }\n        };\n        this.proposeVisit(fetchResponse.location, visitOptions);\n      }\n    }\n  }\n\n  async formSubmissionFailedWithResponse(formSubmission, fetchResponse) {\n    const responseHTML = await fetchResponse.responseHTML;\n\n    if (responseHTML) {\n      const snapshot = PageSnapshot.fromHTMLString(responseHTML);\n      if (fetchResponse.serverError) {\n        await this.view.renderError(snapshot, this.currentVisit);\n      } else {\n        await this.view.renderPage(snapshot, false, true, this.currentVisit);\n      }\n      if(!snapshot.shouldPreserveScrollPosition) {\n        this.view.scrollToTop();\n      }\n      this.view.clearSnapshotCache();\n    }\n  }\n\n  formSubmissionErrored(formSubmission, error) {\n    console.error(error);\n  }\n\n  formSubmissionFinished(formSubmission) {\n    // Not all adapters implement formSubmissionFinished\n    if (typeof this.adapter.formSubmissionFinished === \"function\") {\n      this.adapter.formSubmissionFinished(formSubmission);\n    }\n  }\n\n  // Link prefetching\n\n  linkPrefetchingIsEnabledForLocation(location) {\n    // Not all adapters implement linkPrefetchingIsEnabledForLocation\n    if (typeof this.adapter.linkPrefetchingIsEnabledForLocation === \"function\") {\n      return this.adapter.linkPrefetchingIsEnabledForLocation(location)\n    }\n\n    return true\n  }\n\n  // Visit delegate\n\n  visitStarted(visit) {\n    this.delegate.visitStarted(visit);\n  }\n\n  visitCompleted(visit) {\n    this.delegate.visitCompleted(visit);\n    delete this.currentVisit;\n  }\n\n  locationWithActionIsSamePage(location, action) {\n    const anchor = getAnchor(location);\n    const currentAnchor = getAnchor(this.view.lastRenderedLocation);\n    const isRestorationToTop = action === \"restore\" && typeof anchor === \"undefined\";\n\n    return (\n      action !== \"replace\" &&\n      getRequestURL(location) === getRequestURL(this.view.lastRenderedLocation) &&\n      (isRestorationToTop || (anchor != null && anchor !== currentAnchor))\n    )\n  }\n\n  visitScrolledToSamePageLocation(oldURL, newURL) {\n    this.delegate.visitScrolledToSamePageLocation(oldURL, newURL);\n  }\n\n  // Visits\n\n  get location() {\n    return this.history.location\n  }\n\n  get restorationIdentifier() {\n    return this.history.restorationIdentifier\n  }\n\n  #getActionForFormSubmission(formSubmission, fetchResponse) {\n    const { submitter, formElement } = formSubmission;\n    return getVisitAction(submitter, formElement) || this.#getDefaultAction(fetchResponse)\n  }\n\n  #getDefaultAction(fetchResponse) {\n    const sameLocationRedirect = fetchResponse.redirected && fetchResponse.location.href === this.location?.href;\n    return sameLocationRedirect ? \"replace\" : \"advance\"\n  }\n}\n\nconst PageStage = {\n  initial: 0,\n  loading: 1,\n  interactive: 2,\n  complete: 3\n};\n\nclass PageObserver {\n  stage = PageStage.initial\n  started = false\n\n  constructor(delegate) {\n    this.delegate = delegate;\n  }\n\n  start() {\n    if (!this.started) {\n      if (this.stage == PageStage.initial) {\n        this.stage = PageStage.loading;\n      }\n      document.addEventListener(\"readystatechange\", this.interpretReadyState, false);\n      addEventListener(\"pagehide\", this.pageWillUnload, false);\n      this.started = true;\n    }\n  }\n\n  stop() {\n    if (this.started) {\n      document.removeEventListener(\"readystatechange\", this.interpretReadyState, false);\n      removeEventListener(\"pagehide\", this.pageWillUnload, false);\n      this.started = false;\n    }\n  }\n\n  interpretReadyState = () => {\n    const { readyState } = this;\n    if (readyState == \"interactive\") {\n      this.pageIsInteractive();\n    } else if (readyState == \"complete\") {\n      this.pageIsComplete();\n    }\n  }\n\n  pageIsInteractive() {\n    if (this.stage == PageStage.loading) {\n      this.stage = PageStage.interactive;\n      this.delegate.pageBecameInteractive();\n    }\n  }\n\n  pageIsComplete() {\n    this.pageIsInteractive();\n    if (this.stage == PageStage.interactive) {\n      this.stage = PageStage.complete;\n      this.delegate.pageLoaded();\n    }\n  }\n\n  pageWillUnload = () => {\n    this.delegate.pageWillUnload();\n  }\n\n  get readyState() {\n    return document.readyState\n  }\n}\n\nclass ScrollObserver {\n  started = false\n\n  constructor(delegate) {\n    this.delegate = delegate;\n  }\n\n  start() {\n    if (!this.started) {\n      addEventListener(\"scroll\", this.onScroll, false);\n      this.onScroll();\n      this.started = true;\n    }\n  }\n\n  stop() {\n    if (this.started) {\n      removeEventListener(\"scroll\", this.onScroll, false);\n      this.started = false;\n    }\n  }\n\n  onScroll = () => {\n    this.updatePosition({ x: window.pageXOffset, y: window.pageYOffset });\n  }\n\n  // Private\n\n  updatePosition(position) {\n    this.delegate.scrollPositionChanged(position);\n  }\n}\n\nclass StreamMessageRenderer {\n  render({ fragment }) {\n    Bardo.preservingPermanentElements(this, getPermanentElementMapForFragment(fragment), () => {\n      withAutofocusFromFragment(fragment, () => {\n        withPreservedFocus(() => {\n          document.documentElement.appendChild(fragment);\n        });\n      });\n    });\n  }\n\n  // Bardo delegate\n\n  enteringBardo(currentPermanentElement, newPermanentElement) {\n    newPermanentElement.replaceWith(currentPermanentElement.cloneNode(true));\n  }\n\n  leavingBardo() {}\n}\n\nfunction getPermanentElementMapForFragment(fragment) {\n  const permanentElementsInDocument = queryPermanentElementsAll(document.documentElement);\n  const permanentElementMap = {};\n  for (const permanentElementInDocument of permanentElementsInDocument) {\n    const { id } = permanentElementInDocument;\n\n    for (const streamElement of fragment.querySelectorAll(\"turbo-stream\")) {\n      const elementInStream = getPermanentElementById(streamElement.templateElement.content, id);\n\n      if (elementInStream) {\n        permanentElementMap[id] = [permanentElementInDocument, elementInStream];\n      }\n    }\n  }\n\n  return permanentElementMap\n}\n\nasync function withAutofocusFromFragment(fragment, callback) {\n  const generatedID = `turbo-stream-autofocus-${uuid()}`;\n  const turboStreams = fragment.querySelectorAll(\"turbo-stream\");\n  const elementWithAutofocus = firstAutofocusableElementInStreams(turboStreams);\n  let willAutofocusId = null;\n\n  if (elementWithAutofocus) {\n    if (elementWithAutofocus.id) {\n      willAutofocusId = elementWithAutofocus.id;\n    } else {\n      willAutofocusId = generatedID;\n    }\n\n    elementWithAutofocus.id = willAutofocusId;\n  }\n\n  callback();\n  await nextRepaint();\n\n  const hasNoActiveElement = document.activeElement == null || document.activeElement == document.body;\n\n  if (hasNoActiveElement && willAutofocusId) {\n    const elementToAutofocus = document.getElementById(willAutofocusId);\n\n    if (elementIsFocusable(elementToAutofocus)) {\n      elementToAutofocus.focus();\n    }\n    if (elementToAutofocus && elementToAutofocus.id == generatedID) {\n      elementToAutofocus.removeAttribute(\"id\");\n    }\n  }\n}\n\nasync function withPreservedFocus(callback) {\n  const [activeElementBeforeRender, activeElementAfterRender] = await around(callback, () => document.activeElement);\n\n  const restoreFocusTo = activeElementBeforeRender && activeElementBeforeRender.id;\n\n  if (restoreFocusTo) {\n    const elementToFocus = document.getElementById(restoreFocusTo);\n\n    if (elementIsFocusable(elementToFocus) && elementToFocus != activeElementAfterRender) {\n      elementToFocus.focus();\n    }\n  }\n}\n\nfunction firstAutofocusableElementInStreams(nodeListOfStreamElements) {\n  for (const streamElement of nodeListOfStreamElements) {\n    const elementWithAutofocus = queryAutofocusableElement(streamElement.templateElement.content);\n\n    if (elementWithAutofocus) return elementWithAutofocus\n  }\n\n  return null\n}\n\nclass StreamObserver {\n  sources = new Set()\n  #started = false\n\n  constructor(delegate) {\n    this.delegate = delegate;\n  }\n\n  start() {\n    if (!this.#started) {\n      this.#started = true;\n      addEventListener(\"turbo:before-fetch-response\", this.inspectFetchResponse, false);\n    }\n  }\n\n  stop() {\n    if (this.#started) {\n      this.#started = false;\n      removeEventListener(\"turbo:before-fetch-response\", this.inspectFetchResponse, false);\n    }\n  }\n\n  connectStreamSource(source) {\n    if (!this.streamSourceIsConnected(source)) {\n      this.sources.add(source);\n      source.addEventListener(\"message\", this.receiveMessageEvent, false);\n    }\n  }\n\n  disconnectStreamSource(source) {\n    if (this.streamSourceIsConnected(source)) {\n      this.sources.delete(source);\n      source.removeEventListener(\"message\", this.receiveMessageEvent, false);\n    }\n  }\n\n  streamSourceIsConnected(source) {\n    return this.sources.has(source)\n  }\n\n  inspectFetchResponse = (event) => {\n    const response = fetchResponseFromEvent(event);\n    if (response && fetchResponseIsStream(response)) {\n      event.preventDefault();\n      this.receiveMessageResponse(response);\n    }\n  }\n\n  receiveMessageEvent = (event) => {\n    if (this.#started && typeof event.data == \"string\") {\n      this.receiveMessageHTML(event.data);\n    }\n  }\n\n  async receiveMessageResponse(response) {\n    const html = await response.responseHTML;\n    if (html) {\n      this.receiveMessageHTML(html);\n    }\n  }\n\n  receiveMessageHTML(html) {\n    this.delegate.receivedMessageFromStream(StreamMessage.wrap(html));\n  }\n}\n\nfunction fetchResponseFromEvent(event) {\n  const fetchResponse = event.detail?.fetchResponse;\n  if (fetchResponse instanceof FetchResponse) {\n    return fetchResponse\n  }\n}\n\nfunction fetchResponseIsStream(response) {\n  const contentType = response.contentType ?? \"\";\n  return contentType.startsWith(StreamMessage.contentType)\n}\n\nclass ErrorRenderer extends Renderer {\n  static renderElement(currentElement, newElement) {\n    const { documentElement, body } = document;\n\n    documentElement.replaceChild(newElement, body);\n  }\n\n  async render() {\n    this.replaceHeadAndBody();\n    this.activateScriptElements();\n  }\n\n  replaceHeadAndBody() {\n    const { documentElement, head } = document;\n    documentElement.replaceChild(this.newHead, head);\n    this.renderElement(this.currentElement, this.newElement);\n  }\n\n  activateScriptElements() {\n    for (const replaceableElement of this.scriptElements) {\n      const parentNode = replaceableElement.parentNode;\n      if (parentNode) {\n        const element = activateScriptElement(replaceableElement);\n        parentNode.replaceChild(element, replaceableElement);\n      }\n    }\n  }\n\n  get newHead() {\n    return this.newSnapshot.headSnapshot.element\n  }\n\n  get scriptElements() {\n    return document.documentElement.querySelectorAll(\"script\")\n  }\n}\n\nclass PageRenderer extends Renderer {\n  static renderElement(currentElement, newElement) {\n    if (document.body && newElement instanceof HTMLBodyElement) {\n      document.body.replaceWith(newElement);\n    } else {\n      document.documentElement.appendChild(newElement);\n    }\n  }\n\n  get shouldRender() {\n    return this.newSnapshot.isVisitable && this.trackedElementsAreIdentical\n  }\n\n  get reloadReason() {\n    if (!this.newSnapshot.isVisitable) {\n      return {\n        reason: \"turbo_visit_control_is_reload\"\n      }\n    }\n\n    if (!this.trackedElementsAreIdentical) {\n      return {\n        reason: \"tracked_element_mismatch\"\n      }\n    }\n  }\n\n  async prepareToRender() {\n    this.#setLanguage();\n    await this.mergeHead();\n  }\n\n  async render() {\n    if (this.willRender) {\n      await this.replaceBody();\n    }\n  }\n\n  finishRendering() {\n    super.finishRendering();\n    if (!this.isPreview) {\n      this.focusFirstAutofocusableElement();\n    }\n  }\n\n  get currentHeadSnapshot() {\n    return this.currentSnapshot.headSnapshot\n  }\n\n  get newHeadSnapshot() {\n    return this.newSnapshot.headSnapshot\n  }\n\n  get newElement() {\n    return this.newSnapshot.element\n  }\n\n  #setLanguage() {\n    const { documentElement } = this.currentSnapshot;\n    const { lang } = this.newSnapshot;\n\n    if (lang) {\n      documentElement.setAttribute(\"lang\", lang);\n    } else {\n      documentElement.removeAttribute(\"lang\");\n    }\n  }\n\n  async mergeHead() {\n    const mergedHeadElements = this.mergeProvisionalElements();\n    const newStylesheetElements = this.copyNewHeadStylesheetElements();\n    this.copyNewHeadScriptElements();\n\n    await mergedHeadElements;\n    await newStylesheetElements;\n\n    if (this.willRender) {\n      this.removeUnusedDynamicStylesheetElements();\n    }\n  }\n\n  async replaceBody() {\n    await this.preservingPermanentElements(async () => {\n      this.activateNewBody();\n      await this.assignNewBody();\n    });\n  }\n\n  get trackedElementsAreIdentical() {\n    return this.currentHeadSnapshot.trackedElementSignature == this.newHeadSnapshot.trackedElementSignature\n  }\n\n  async copyNewHeadStylesheetElements() {\n    const loadingElements = [];\n\n    for (const element of this.newHeadStylesheetElements) {\n      loadingElements.push(waitForLoad(element));\n\n      document.head.appendChild(element);\n    }\n\n    await Promise.all(loadingElements);\n  }\n\n  copyNewHeadScriptElements() {\n    for (const element of this.newHeadScriptElements) {\n      document.head.appendChild(activateScriptElement(element));\n    }\n  }\n\n  removeUnusedDynamicStylesheetElements() {\n    for (const element of this.unusedDynamicStylesheetElements) {\n      document.head.removeChild(element);\n    }\n  }\n\n  async mergeProvisionalElements() {\n    const newHeadElements = [...this.newHeadProvisionalElements];\n\n    for (const element of this.currentHeadProvisionalElements) {\n      if (!this.isCurrentElementInElementList(element, newHeadElements)) {\n        document.head.removeChild(element);\n      }\n    }\n\n    for (const element of newHeadElements) {\n      document.head.appendChild(element);\n    }\n  }\n\n  isCurrentElementInElementList(element, elementList) {\n    for (const [index, newElement] of elementList.entries()) {\n      // if title element...\n      if (element.tagName == \"TITLE\") {\n        if (newElement.tagName != \"TITLE\") {\n          continue\n        }\n        if (element.innerHTML == newElement.innerHTML) {\n          elementList.splice(index, 1);\n          return true\n        }\n      }\n\n      // if any other element...\n      if (newElement.isEqualNode(element)) {\n        elementList.splice(index, 1);\n        return true\n      }\n    }\n\n    return false\n  }\n\n  removeCurrentHeadProvisionalElements() {\n    for (const element of this.currentHeadProvisionalElements) {\n      document.head.removeChild(element);\n    }\n  }\n\n  copyNewHeadProvisionalElements() {\n    for (const element of this.newHeadProvisionalElements) {\n      document.head.appendChild(element);\n    }\n  }\n\n  activateNewBody() {\n    document.adoptNode(this.newElement);\n    this.activateNewBodyScriptElements();\n  }\n\n  activateNewBodyScriptElements() {\n    for (const inertScriptElement of this.newBodyScriptElements) {\n      const activatedScriptElement = activateScriptElement(inertScriptElement);\n      inertScriptElement.replaceWith(activatedScriptElement);\n    }\n  }\n\n  async assignNewBody() {\n    await this.renderElement(this.currentElement, this.newElement);\n  }\n\n  get unusedDynamicStylesheetElements() {\n    return this.oldHeadStylesheetElements.filter((element) => {\n      return element.getAttribute(\"data-turbo-track\") === \"dynamic\"\n    })\n  }\n\n  get oldHeadStylesheetElements() {\n    return this.currentHeadSnapshot.getStylesheetElementsNotInSnapshot(this.newHeadSnapshot)\n  }\n\n  get newHeadStylesheetElements() {\n    return this.newHeadSnapshot.getStylesheetElementsNotInSnapshot(this.currentHeadSnapshot)\n  }\n\n  get newHeadScriptElements() {\n    return this.newHeadSnapshot.getScriptElementsNotInSnapshot(this.currentHeadSnapshot)\n  }\n\n  get currentHeadProvisionalElements() {\n    return this.currentHeadSnapshot.provisionalElements\n  }\n\n  get newHeadProvisionalElements() {\n    return this.newHeadSnapshot.provisionalElements\n  }\n\n  get newBodyScriptElements() {\n    return this.newElement.querySelectorAll(\"script\")\n  }\n}\n\nclass MorphingPageRenderer extends PageRenderer {\n  static renderElement(currentElement, newElement) {\n    morphElements(currentElement, newElement, {\n      callbacks: {\n        beforeNodeMorphed: element => !canRefreshFrame(element)\n      }\n    });\n\n    for (const frame of currentElement.querySelectorAll(\"turbo-frame\")) {\n      if (canRefreshFrame(frame)) frame.reload();\n    }\n\n    dispatch(\"turbo:morph\", { detail: { currentElement, newElement } });\n  }\n\n  async preservingPermanentElements(callback) {\n    return await callback()\n  }\n\n  get renderMethod() {\n    return \"morph\"\n  }\n\n  get shouldAutofocus() {\n    return false\n  }\n}\n\nfunction canRefreshFrame(frame) {\n  return frame instanceof FrameElement &&\n    frame.src &&\n    frame.refresh === \"morph\" &&\n    !frame.closest(\"[data-turbo-permanent]\")\n}\n\nclass SnapshotCache {\n  keys = []\n  snapshots = {}\n\n  constructor(size) {\n    this.size = size;\n  }\n\n  has(location) {\n    return toCacheKey(location) in this.snapshots\n  }\n\n  get(location) {\n    if (this.has(location)) {\n      const snapshot = this.read(location);\n      this.touch(location);\n      return snapshot\n    }\n  }\n\n  put(location, snapshot) {\n    this.write(location, snapshot);\n    this.touch(location);\n    return snapshot\n  }\n\n  clear() {\n    this.snapshots = {};\n  }\n\n  // Private\n\n  read(location) {\n    return this.snapshots[toCacheKey(location)]\n  }\n\n  write(location, snapshot) {\n    this.snapshots[toCacheKey(location)] = snapshot;\n  }\n\n  touch(location) {\n    const key = toCacheKey(location);\n    const index = this.keys.indexOf(key);\n    if (index > -1) this.keys.splice(index, 1);\n    this.keys.unshift(key);\n    this.trim();\n  }\n\n  trim() {\n    for (const key of this.keys.splice(this.size)) {\n      delete this.snapshots[key];\n    }\n  }\n}\n\nclass PageView extends View {\n  snapshotCache = new SnapshotCache(10)\n  lastRenderedLocation = new URL(location.href)\n  forceReloaded = false\n\n  shouldTransitionTo(newSnapshot) {\n    return this.snapshot.prefersViewTransitions && newSnapshot.prefersViewTransitions\n  }\n\n  renderPage(snapshot, isPreview = false, willRender = true, visit) {\n    const shouldMorphPage = this.isPageRefresh(visit) && this.snapshot.shouldMorphPage;\n    const rendererClass = shouldMorphPage ? MorphingPageRenderer : PageRenderer;\n\n    const renderer = new rendererClass(this.snapshot, snapshot, isPreview, willRender);\n\n    if (!renderer.shouldRender) {\n      this.forceReloaded = true;\n    } else {\n      visit?.changeHistory();\n    }\n\n    return this.render(renderer)\n  }\n\n  renderError(snapshot, visit) {\n    visit?.changeHistory();\n    const renderer = new ErrorRenderer(this.snapshot, snapshot, false);\n    return this.render(renderer)\n  }\n\n  clearSnapshotCache() {\n    this.snapshotCache.clear();\n  }\n\n  async cacheSnapshot(snapshot = this.snapshot) {\n    if (snapshot.isCacheable) {\n      this.delegate.viewWillCacheSnapshot();\n      const { lastRenderedLocation: location } = this;\n      await nextEventLoopTick();\n      const cachedSnapshot = snapshot.clone();\n      this.snapshotCache.put(location, cachedSnapshot);\n      return cachedSnapshot\n    }\n  }\n\n  getCachedSnapshotForLocation(location) {\n    return this.snapshotCache.get(location)\n  }\n\n  isPageRefresh(visit) {\n    return !visit || (this.lastRenderedLocation.pathname === visit.location.pathname && visit.action === \"replace\")\n  }\n\n  shouldPreserveScrollPosition(visit) {\n    return this.isPageRefresh(visit) && this.snapshot.shouldPreserveScrollPosition\n  }\n\n  get snapshot() {\n    return PageSnapshot.fromElement(this.element)\n  }\n}\n\nclass Preloader {\n  selector = \"a[data-turbo-preload]\"\n\n  constructor(delegate, snapshotCache) {\n    this.delegate = delegate;\n    this.snapshotCache = snapshotCache;\n  }\n\n  start() {\n    if (document.readyState === \"loading\") {\n      document.addEventListener(\"DOMContentLoaded\", this.#preloadAll);\n    } else {\n      this.preloadOnLoadLinksForView(document.body);\n    }\n  }\n\n  stop() {\n    document.removeEventListener(\"DOMContentLoaded\", this.#preloadAll);\n  }\n\n  preloadOnLoadLinksForView(element) {\n    for (const link of element.querySelectorAll(this.selector)) {\n      if (this.delegate.shouldPreloadLink(link)) {\n        this.preloadURL(link);\n      }\n    }\n  }\n\n  async preloadURL(link) {\n    const location = new URL(link.href);\n\n    if (this.snapshotCache.has(location)) {\n      return\n    }\n\n    const fetchRequest = new FetchRequest(this, FetchMethod.get, location, new URLSearchParams(), link);\n    await fetchRequest.perform();\n  }\n\n  // Fetch request delegate\n\n  prepareRequest(fetchRequest) {\n    fetchRequest.headers[\"X-Sec-Purpose\"] = \"prefetch\";\n  }\n\n  async requestSucceededWithResponse(fetchRequest, fetchResponse) {\n    try {\n      const responseHTML = await fetchResponse.responseHTML;\n      const snapshot = PageSnapshot.fromHTMLString(responseHTML);\n\n      this.snapshotCache.put(fetchRequest.url, snapshot);\n    } catch (_) {\n      // If we cannot preload that is ok!\n    }\n  }\n\n  requestStarted(fetchRequest) {}\n\n  requestErrored(fetchRequest) {}\n\n  requestFinished(fetchRequest) {}\n\n  requestPreventedHandlingResponse(fetchRequest, fetchResponse) {}\n\n  requestFailedWithResponse(fetchRequest, fetchResponse) {}\n\n  #preloadAll = () => {\n    this.preloadOnLoadLinksForView(document.body);\n  }\n}\n\nclass Cache {\n  constructor(session) {\n    this.session = session;\n  }\n\n  clear() {\n    this.session.clearCache();\n  }\n\n  resetCacheControl() {\n    this.#setCacheControl(\"\");\n  }\n\n  exemptPageFromCache() {\n    this.#setCacheControl(\"no-cache\");\n  }\n\n  exemptPageFromPreview() {\n    this.#setCacheControl(\"no-preview\");\n  }\n\n  #setCacheControl(value) {\n    setMetaContent(\"turbo-cache-control\", value);\n  }\n}\n\nclass Session {\n  navigator = new Navigator(this)\n  history = new History(this)\n  view = new PageView(this, document.documentElement)\n  adapter = new BrowserAdapter(this)\n\n  pageObserver = new PageObserver(this)\n  cacheObserver = new CacheObserver()\n  linkPrefetchObserver = new LinkPrefetchObserver(this, document)\n  linkClickObserver = new LinkClickObserver(this, window)\n  formSubmitObserver = new FormSubmitObserver(this, document)\n  scrollObserver = new ScrollObserver(this)\n  streamObserver = new StreamObserver(this)\n  formLinkClickObserver = new FormLinkClickObserver(this, document.documentElement)\n  frameRedirector = new FrameRedirector(this, document.documentElement)\n  streamMessageRenderer = new StreamMessageRenderer()\n  cache = new Cache(this)\n\n  enabled = true\n  started = false\n  #pageRefreshDebouncePeriod = 150\n\n  constructor(recentRequests) {\n    this.recentRequests = recentRequests;\n    this.preloader = new Preloader(this, this.view.snapshotCache);\n    this.debouncedRefresh = this.refresh;\n    this.pageRefreshDebouncePeriod = this.pageRefreshDebouncePeriod;\n  }\n\n  start() {\n    if (!this.started) {\n      this.pageObserver.start();\n      this.cacheObserver.start();\n      this.linkPrefetchObserver.start();\n      this.formLinkClickObserver.start();\n      this.linkClickObserver.start();\n      this.formSubmitObserver.start();\n      this.scrollObserver.start();\n      this.streamObserver.start();\n      this.frameRedirector.start();\n      this.history.start();\n      this.preloader.start();\n      this.started = true;\n      this.enabled = true;\n    }\n  }\n\n  disable() {\n    this.enabled = false;\n  }\n\n  stop() {\n    if (this.started) {\n      this.pageObserver.stop();\n      this.cacheObserver.stop();\n      this.linkPrefetchObserver.stop();\n      this.formLinkClickObserver.stop();\n      this.linkClickObserver.stop();\n      this.formSubmitObserver.stop();\n      this.scrollObserver.stop();\n      this.streamObserver.stop();\n      this.frameRedirector.stop();\n      this.history.stop();\n      this.preloader.stop();\n      this.started = false;\n    }\n  }\n\n  registerAdapter(adapter) {\n    this.adapter = adapter;\n  }\n\n  visit(location, options = {}) {\n    const frameElement = options.frame ? document.getElementById(options.frame) : null;\n\n    if (frameElement instanceof FrameElement) {\n      const action = options.action || getVisitAction(frameElement);\n\n      frameElement.delegate.proposeVisitIfNavigatedWithAction(frameElement, action);\n      frameElement.src = location.toString();\n    } else {\n      this.navigator.proposeVisit(expandURL(location), options);\n    }\n  }\n\n  refresh(url, requestId) {\n    const isRecentRequest = requestId && this.recentRequests.has(requestId);\n    const isCurrentUrl = url === document.baseURI;\n    if (!isRecentRequest && !this.navigator.currentVisit && isCurrentUrl) {\n      this.visit(url, { action: \"replace\", shouldCacheSnapshot: false });\n    }\n  }\n\n  connectStreamSource(source) {\n    this.streamObserver.connectStreamSource(source);\n  }\n\n  disconnectStreamSource(source) {\n    this.streamObserver.disconnectStreamSource(source);\n  }\n\n  renderStreamMessage(message) {\n    this.streamMessageRenderer.render(StreamMessage.wrap(message));\n  }\n\n  clearCache() {\n    this.view.clearSnapshotCache();\n  }\n\n  setProgressBarDelay(delay) {\n    console.warn(\n      \"Please replace `session.setProgressBarDelay(delay)` with `session.progressBarDelay = delay`. The function is deprecated and will be removed in a future version of Turbo.`\"\n    );\n\n    this.progressBarDelay = delay;\n  }\n\n  set progressBarDelay(delay) {\n    config.drive.progressBarDelay = delay;\n  }\n\n  get progressBarDelay() {\n    return config.drive.progressBarDelay\n  }\n\n  set drive(value) {\n    config.drive.enabled = value;\n  }\n\n  get drive() {\n    return config.drive.enabled\n  }\n\n  set formMode(value) {\n    config.forms.mode = value;\n  }\n\n  get formMode() {\n    return config.forms.mode\n  }\n\n  get location() {\n    return this.history.location\n  }\n\n  get restorationIdentifier() {\n    return this.history.restorationIdentifier\n  }\n\n  get pageRefreshDebouncePeriod() {\n    return this.#pageRefreshDebouncePeriod\n  }\n\n  set pageRefreshDebouncePeriod(value) {\n    this.refresh = debounce(this.debouncedRefresh.bind(this), value);\n    this.#pageRefreshDebouncePeriod = value;\n  }\n\n  // Preloader delegate\n\n  shouldPreloadLink(element) {\n    const isUnsafe = element.hasAttribute(\"data-turbo-method\");\n    const isStream = element.hasAttribute(\"data-turbo-stream\");\n    const frameTarget = element.getAttribute(\"data-turbo-frame\");\n    const frame = frameTarget == \"_top\" ?\n      null :\n      document.getElementById(frameTarget) || findClosestRecursively(element, \"turbo-frame:not([disabled])\");\n\n    if (isUnsafe || isStream || frame instanceof FrameElement) {\n      return false\n    } else {\n      const location = new URL(element.href);\n\n      return this.elementIsNavigatable(element) && locationIsVisitable(location, this.snapshot.rootLocation)\n    }\n  }\n\n  // History delegate\n\n  historyPoppedToLocationWithRestorationIdentifierAndDirection(location, restorationIdentifier, direction) {\n    if (this.enabled) {\n      this.navigator.startVisit(location, restorationIdentifier, {\n        action: \"restore\",\n        historyChanged: true,\n        direction\n      });\n    } else {\n      this.adapter.pageInvalidated({\n        reason: \"turbo_disabled\"\n      });\n    }\n  }\n\n  // Scroll observer delegate\n\n  scrollPositionChanged(position) {\n    this.history.updateRestorationData({ scrollPosition: position });\n  }\n\n  // Form click observer delegate\n\n  willSubmitFormLinkToLocation(link, location) {\n    return this.elementIsNavigatable(link) && locationIsVisitable(location, this.snapshot.rootLocation)\n  }\n\n  submittedFormLinkToLocation() {}\n\n  // Link hover observer delegate\n\n  canPrefetchRequestToLocation(link, location) {\n    return (\n      this.elementIsNavigatable(link) &&\n      locationIsVisitable(location, this.snapshot.rootLocation) &&\n      this.navigator.linkPrefetchingIsEnabledForLocation(location)\n    )\n  }\n\n  // Link click observer delegate\n\n  willFollowLinkToLocation(link, location, event) {\n    return (\n      this.elementIsNavigatable(link) &&\n      locationIsVisitable(location, this.snapshot.rootLocation) &&\n      this.applicationAllowsFollowingLinkToLocation(link, location, event)\n    )\n  }\n\n  followedLinkToLocation(link, location) {\n    const action = this.getActionForLink(link);\n    const acceptsStreamResponse = link.hasAttribute(\"data-turbo-stream\");\n\n    this.visit(location.href, { action, acceptsStreamResponse });\n  }\n\n  // Navigator delegate\n\n  allowsVisitingLocationWithAction(location, action) {\n    return this.locationWithActionIsSamePage(location, action) || this.applicationAllowsVisitingLocation(location)\n  }\n\n  visitProposedToLocation(location, options) {\n    extendURLWithDeprecatedProperties(location);\n    this.adapter.visitProposedToLocation(location, options);\n  }\n\n  // Visit delegate\n\n  visitStarted(visit) {\n    if (!visit.acceptsStreamResponse) {\n      markAsBusy(document.documentElement);\n      this.view.markVisitDirection(visit.direction);\n    }\n    extendURLWithDeprecatedProperties(visit.location);\n    if (!visit.silent) {\n      this.notifyApplicationAfterVisitingLocation(visit.location, visit.action);\n    }\n  }\n\n  visitCompleted(visit) {\n    this.view.unmarkVisitDirection();\n    clearBusyState(document.documentElement);\n    this.notifyApplicationAfterPageLoad(visit.getTimingMetrics());\n  }\n\n  locationWithActionIsSamePage(location, action) {\n    return this.navigator.locationWithActionIsSamePage(location, action)\n  }\n\n  visitScrolledToSamePageLocation(oldURL, newURL) {\n    this.notifyApplicationAfterVisitingSamePageLocation(oldURL, newURL);\n  }\n\n  // Form submit observer delegate\n\n  willSubmitForm(form, submitter) {\n    const action = getAction$1(form, submitter);\n\n    return (\n      this.submissionIsNavigatable(form, submitter) &&\n      locationIsVisitable(expandURL(action), this.snapshot.rootLocation)\n    )\n  }\n\n  formSubmitted(form, submitter) {\n    this.navigator.submitForm(form, submitter);\n  }\n\n  // Page observer delegate\n\n  pageBecameInteractive() {\n    this.view.lastRenderedLocation = this.location;\n    this.notifyApplicationAfterPageLoad();\n  }\n\n  pageLoaded() {\n    this.history.assumeControlOfScrollRestoration();\n  }\n\n  pageWillUnload() {\n    this.history.relinquishControlOfScrollRestoration();\n  }\n\n  // Stream observer delegate\n\n  receivedMessageFromStream(message) {\n    this.renderStreamMessage(message);\n  }\n\n  // Page view delegate\n\n  viewWillCacheSnapshot() {\n    if (!this.navigator.currentVisit?.silent) {\n      this.notifyApplicationBeforeCachingSnapshot();\n    }\n  }\n\n  allowsImmediateRender({ element }, options) {\n    const event = this.notifyApplicationBeforeRender(element, options);\n    const {\n      defaultPrevented,\n      detail: { render }\n    } = event;\n\n    if (this.view.renderer && render) {\n      this.view.renderer.renderElement = render;\n    }\n\n    return !defaultPrevented\n  }\n\n  viewRenderedSnapshot(_snapshot, _isPreview, renderMethod) {\n    this.view.lastRenderedLocation = this.history.location;\n    this.notifyApplicationAfterRender(renderMethod);\n  }\n\n  preloadOnLoadLinksForView(element) {\n    this.preloader.preloadOnLoadLinksForView(element);\n  }\n\n  viewInvalidated(reason) {\n    this.adapter.pageInvalidated(reason);\n  }\n\n  // Frame element\n\n  frameLoaded(frame) {\n    this.notifyApplicationAfterFrameLoad(frame);\n  }\n\n  frameRendered(fetchResponse, frame) {\n    this.notifyApplicationAfterFrameRender(fetchResponse, frame);\n  }\n\n  // Application events\n\n  applicationAllowsFollowingLinkToLocation(link, location, ev) {\n    const event = this.notifyApplicationAfterClickingLinkToLocation(link, location, ev);\n    return !event.defaultPrevented\n  }\n\n  applicationAllowsVisitingLocation(location) {\n    const event = this.notifyApplicationBeforeVisitingLocation(location);\n    return !event.defaultPrevented\n  }\n\n  notifyApplicationAfterClickingLinkToLocation(link, location, event) {\n    return dispatch(\"turbo:click\", {\n      target: link,\n      detail: { url: location.href, originalEvent: event },\n      cancelable: true\n    })\n  }\n\n  notifyApplicationBeforeVisitingLocation(location) {\n    return dispatch(\"turbo:before-visit\", {\n      detail: { url: location.href },\n      cancelable: true\n    })\n  }\n\n  notifyApplicationAfterVisitingLocation(location, action) {\n    return dispatch(\"turbo:visit\", { detail: { url: location.href, action } })\n  }\n\n  notifyApplicationBeforeCachingSnapshot() {\n    return dispatch(\"turbo:before-cache\")\n  }\n\n  notifyApplicationBeforeRender(newBody, options) {\n    return dispatch(\"turbo:before-render\", {\n      detail: { newBody, ...options },\n      cancelable: true\n    })\n  }\n\n  notifyApplicationAfterRender(renderMethod) {\n    return dispatch(\"turbo:render\", { detail: { renderMethod } })\n  }\n\n  notifyApplicationAfterPageLoad(timing = {}) {\n    return dispatch(\"turbo:load\", {\n      detail: { url: this.location.href, timing }\n    })\n  }\n\n  notifyApplicationAfterVisitingSamePageLocation(oldURL, newURL) {\n    dispatchEvent(\n      new HashChangeEvent(\"hashchange\", {\n        oldURL: oldURL.toString(),\n        newURL: newURL.toString()\n      })\n    );\n  }\n\n  notifyApplicationAfterFrameLoad(frame) {\n    return dispatch(\"turbo:frame-load\", { target: frame })\n  }\n\n  notifyApplicationAfterFrameRender(fetchResponse, frame) {\n    return dispatch(\"turbo:frame-render\", {\n      detail: { fetchResponse },\n      target: frame,\n      cancelable: true\n    })\n  }\n\n  // Helpers\n\n  submissionIsNavigatable(form, submitter) {\n    if (config.forms.mode == \"off\") {\n      return false\n    } else {\n      const submitterIsNavigatable = submitter ? this.elementIsNavigatable(submitter) : true;\n\n      if (config.forms.mode == \"optin\") {\n        return submitterIsNavigatable && form.closest('[data-turbo=\"true\"]') != null\n      } else {\n        return submitterIsNavigatable && this.elementIsNavigatable(form)\n      }\n    }\n  }\n\n  elementIsNavigatable(element) {\n    const container = findClosestRecursively(element, \"[data-turbo]\");\n    const withinFrame = findClosestRecursively(element, \"turbo-frame\");\n\n    // Check if Drive is enabled on the session or we're within a Frame.\n    if (config.drive.enabled || withinFrame) {\n      // Element is navigatable by default, unless `data-turbo=\"false\"`.\n      if (container) {\n        return container.getAttribute(\"data-turbo\") != \"false\"\n      } else {\n        return true\n      }\n    } else {\n      // Element isn't navigatable by default, unless `data-turbo=\"true\"`.\n      if (container) {\n        return container.getAttribute(\"data-turbo\") == \"true\"\n      } else {\n        return false\n      }\n    }\n  }\n\n  // Private\n\n  getActionForLink(link) {\n    return getVisitAction(link) || \"advance\"\n  }\n\n  get snapshot() {\n    return this.view.snapshot\n  }\n}\n\n// Older versions of the Turbo Native adapters referenced the\n// `Location#absoluteURL` property in their implementations of\n// the `Adapter#visitProposedToLocation()` and `#visitStarted()`\n// methods. The Location class has since been removed in favor\n// of the DOM URL API, and accordingly all Adapter methods now\n// receive URL objects.\n//\n// We alias #absoluteURL to #toString() here to avoid crashing\n// older adapters which do not expect URL objects. We should\n// consider removing this support at some point in the future.\n\nfunction extendURLWithDeprecatedProperties(url) {\n  Object.defineProperties(url, deprecatedLocationPropertyDescriptors);\n}\n\nconst deprecatedLocationPropertyDescriptors = {\n  absoluteURL: {\n    get() {\n      return this.toString()\n    }\n  }\n};\n\nconst session = new Session(recentRequests);\nconst { cache, navigator: navigator$1 } = session;\n\n/**\n * Starts the main session.\n * This initialises any necessary observers such as those to monitor\n * link interactions.\n */\nfunction start() {\n  session.start();\n}\n\n/**\n * Registers an adapter for the main session.\n *\n * @param adapter Adapter to register\n */\nfunction registerAdapter(adapter) {\n  session.registerAdapter(adapter);\n}\n\n/**\n * Performs an application visit to the given location.\n *\n * @param location Location to visit (a URL or path)\n * @param options Options to apply\n * @param options.action Type of history navigation to apply (\"restore\",\n * \"replace\" or \"advance\")\n * @param options.historyChanged Specifies whether the browser history has\n * already been changed for this visit or not\n * @param options.referrer Specifies the referrer of this visit such that\n * navigations to the same page will not result in a new history entry.\n * @param options.snapshotHTML Cached snapshot to render\n * @param options.response Response of the specified location\n */\nfunction visit(location, options) {\n  session.visit(location, options);\n}\n\n/**\n * Connects a stream source to the main session.\n *\n * @param source Stream source to connect\n */\nfunction connectStreamSource(source) {\n  session.connectStreamSource(source);\n}\n\n/**\n * Disconnects a stream source from the main session.\n *\n * @param source Stream source to disconnect\n */\nfunction disconnectStreamSource(source) {\n  session.disconnectStreamSource(source);\n}\n\n/**\n * Renders a stream message to the main session by appending it to the\n * current document.\n *\n * @param message Message to render\n */\nfunction renderStreamMessage(message) {\n  session.renderStreamMessage(message);\n}\n\n/**\n * Removes all entries from the Turbo Drive page cache.\n * Call this when state has changed on the server that may affect cached pages.\n *\n * @deprecated since version 7.2.0 in favor of `Turbo.cache.clear()`\n */\nfunction clearCache() {\n  console.warn(\n    \"Please replace `Turbo.clearCache()` with `Turbo.cache.clear()`. The top-level function is deprecated and will be removed in a future version of Turbo.`\"\n  );\n  session.clearCache();\n}\n\n/**\n * Sets the delay after which the progress bar will appear during navigation.\n *\n * The progress bar appears after 500ms by default.\n *\n * Note that this method has no effect when used with the iOS or Android\n * adapters.\n *\n * @param delay Time to delay in milliseconds\n */\nfunction setProgressBarDelay(delay) {\n  console.warn(\n    \"Please replace `Turbo.setProgressBarDelay(delay)` with `Turbo.config.drive.progressBarDelay = delay`. The top-level function is deprecated and will be removed in a future version of Turbo.`\"\n  );\n  config.drive.progressBarDelay = delay;\n}\n\nfunction setConfirmMethod(confirmMethod) {\n  console.warn(\n    \"Please replace `Turbo.setConfirmMethod(confirmMethod)` with `Turbo.config.forms.confirm = confirmMethod`. The top-level function is deprecated and will be removed in a future version of Turbo.`\"\n  );\n  config.forms.confirm = confirmMethod;\n}\n\nfunction setFormMode(mode) {\n  console.warn(\n    \"Please replace `Turbo.setFormMode(mode)` with `Turbo.config.forms.mode = mode`. The top-level function is deprecated and will be removed in a future version of Turbo.`\"\n  );\n  config.forms.mode = mode;\n}\n\nvar Turbo = /*#__PURE__*/Object.freeze({\n  __proto__: null,\n  navigator: navigator$1,\n  session: session,\n  cache: cache,\n  PageRenderer: PageRenderer,\n  PageSnapshot: PageSnapshot,\n  FrameRenderer: FrameRenderer,\n  fetch: fetchWithTurboHeaders,\n  config: config,\n  start: start,\n  registerAdapter: registerAdapter,\n  visit: visit,\n  connectStreamSource: connectStreamSource,\n  disconnectStreamSource: disconnectStreamSource,\n  renderStreamMessage: renderStreamMessage,\n  clearCache: clearCache,\n  setProgressBarDelay: setProgressBarDelay,\n  setConfirmMethod: setConfirmMethod,\n  setFormMode: setFormMode\n});\n\nclass TurboFrameMissingError extends Error {}\n\nclass FrameController {\n  fetchResponseLoaded = (_fetchResponse) => Promise.resolve()\n  #currentFetchRequest = null\n  #resolveVisitPromise = () => {}\n  #connected = false\n  #hasBeenLoaded = false\n  #ignoredAttributes = new Set()\n  #shouldMorphFrame = false\n  action = null\n\n  constructor(element) {\n    this.element = element;\n    this.view = new FrameView(this, this.element);\n    this.appearanceObserver = new AppearanceObserver(this, this.element);\n    this.formLinkClickObserver = new FormLinkClickObserver(this, this.element);\n    this.linkInterceptor = new LinkInterceptor(this, this.element);\n    this.restorationIdentifier = uuid();\n    this.formSubmitObserver = new FormSubmitObserver(this, this.element);\n  }\n\n  // Frame delegate\n\n  connect() {\n    if (!this.#connected) {\n      this.#connected = true;\n      if (this.loadingStyle == FrameLoadingStyle.lazy) {\n        this.appearanceObserver.start();\n      } else {\n        this.#loadSourceURL();\n      }\n      this.formLinkClickObserver.start();\n      this.linkInterceptor.start();\n      this.formSubmitObserver.start();\n    }\n  }\n\n  disconnect() {\n    if (this.#connected) {\n      this.#connected = false;\n      this.appearanceObserver.stop();\n      this.formLinkClickObserver.stop();\n      this.linkInterceptor.stop();\n      this.formSubmitObserver.stop();\n    }\n  }\n\n  disabledChanged() {\n    if (this.loadingStyle == FrameLoadingStyle.eager) {\n      this.#loadSourceURL();\n    }\n  }\n\n  sourceURLChanged() {\n    if (this.#isIgnoringChangesTo(\"src\")) return\n\n    if (this.element.isConnected) {\n      this.complete = false;\n    }\n\n    if (this.loadingStyle == FrameLoadingStyle.eager || this.#hasBeenLoaded) {\n      this.#loadSourceURL();\n    }\n  }\n\n  sourceURLReloaded() {\n    const { refresh, src } = this.element;\n\n    this.#shouldMorphFrame = src && refresh === \"morph\";\n\n    this.element.removeAttribute(\"complete\");\n    this.element.src = null;\n    this.element.src = src;\n    return this.element.loaded\n  }\n\n  loadingStyleChanged() {\n    if (this.loadingStyle == FrameLoadingStyle.lazy) {\n      this.appearanceObserver.start();\n    } else {\n      this.appearanceObserver.stop();\n      this.#loadSourceURL();\n    }\n  }\n\n  async #loadSourceURL() {\n    if (this.enabled && this.isActive && !this.complete && this.sourceURL) {\n      this.element.loaded = this.#visit(expandURL(this.sourceURL));\n      this.appearanceObserver.stop();\n      await this.element.loaded;\n      this.#hasBeenLoaded = true;\n    }\n  }\n\n  async loadResponse(fetchResponse) {\n    if (fetchResponse.redirected || (fetchResponse.succeeded && fetchResponse.isHTML)) {\n      this.sourceURL = fetchResponse.response.url;\n    }\n\n    try {\n      const html = await fetchResponse.responseHTML;\n      if (html) {\n        const document = parseHTMLDocument(html);\n        const pageSnapshot = PageSnapshot.fromDocument(document);\n\n        if (pageSnapshot.isVisitable) {\n          await this.#loadFrameResponse(fetchResponse, document);\n        } else {\n          await this.#handleUnvisitableFrameResponse(fetchResponse);\n        }\n      }\n    } finally {\n      this.#shouldMorphFrame = false;\n      this.fetchResponseLoaded = () => Promise.resolve();\n    }\n  }\n\n  // Appearance observer delegate\n\n  elementAppearedInViewport(element) {\n    this.proposeVisitIfNavigatedWithAction(element, getVisitAction(element));\n    this.#loadSourceURL();\n  }\n\n  // Form link click observer delegate\n\n  willSubmitFormLinkToLocation(link) {\n    return this.#shouldInterceptNavigation(link)\n  }\n\n  submittedFormLinkToLocation(link, _location, form) {\n    const frame = this.#findFrameElement(link);\n    if (frame) form.setAttribute(\"data-turbo-frame\", frame.id);\n  }\n\n  // Link interceptor delegate\n\n  shouldInterceptLinkClick(element, _location, _event) {\n    return this.#shouldInterceptNavigation(element)\n  }\n\n  linkClickIntercepted(element, location) {\n    this.#navigateFrame(element, location);\n  }\n\n  // Form submit observer delegate\n\n  willSubmitForm(element, submitter) {\n    return element.closest(\"turbo-frame\") == this.element && this.#shouldInterceptNavigation(element, submitter)\n  }\n\n  formSubmitted(element, submitter) {\n    if (this.formSubmission) {\n      this.formSubmission.stop();\n    }\n\n    this.formSubmission = new FormSubmission(this, element, submitter);\n    const { fetchRequest } = this.formSubmission;\n    this.prepareRequest(fetchRequest);\n    this.formSubmission.start();\n  }\n\n  // Fetch request delegate\n\n  prepareRequest(request) {\n    request.headers[\"Turbo-Frame\"] = this.id;\n\n    if (this.currentNavigationElement?.hasAttribute(\"data-turbo-stream\")) {\n      request.acceptResponseType(StreamMessage.contentType);\n    }\n  }\n\n  requestStarted(_request) {\n    markAsBusy(this.element);\n  }\n\n  requestPreventedHandlingResponse(_request, _response) {\n    this.#resolveVisitPromise();\n  }\n\n  async requestSucceededWithResponse(request, response) {\n    await this.loadResponse(response);\n    this.#resolveVisitPromise();\n  }\n\n  async requestFailedWithResponse(request, response) {\n    await this.loadResponse(response);\n    this.#resolveVisitPromise();\n  }\n\n  requestErrored(request, error) {\n    console.error(error);\n    this.#resolveVisitPromise();\n  }\n\n  requestFinished(_request) {\n    clearBusyState(this.element);\n  }\n\n  // Form submission delegate\n\n  formSubmissionStarted({ formElement }) {\n    markAsBusy(formElement, this.#findFrameElement(formElement));\n  }\n\n  formSubmissionSucceededWithResponse(formSubmission, response) {\n    const frame = this.#findFrameElement(formSubmission.formElement, formSubmission.submitter);\n\n    frame.delegate.proposeVisitIfNavigatedWithAction(frame, getVisitAction(formSubmission.submitter, formSubmission.formElement, frame));\n    frame.delegate.loadResponse(response);\n\n    if (!formSubmission.isSafe) {\n      session.clearCache();\n    }\n  }\n\n  formSubmissionFailedWithResponse(formSubmission, fetchResponse) {\n    this.element.delegate.loadResponse(fetchResponse);\n    session.clearCache();\n  }\n\n  formSubmissionErrored(formSubmission, error) {\n    console.error(error);\n  }\n\n  formSubmissionFinished({ formElement }) {\n    clearBusyState(formElement, this.#findFrameElement(formElement));\n  }\n\n  // View delegate\n\n  allowsImmediateRender({ element: newFrame }, options) {\n    const event = dispatch(\"turbo:before-frame-render\", {\n      target: this.element,\n      detail: { newFrame, ...options },\n      cancelable: true\n    });\n\n    const {\n      defaultPrevented,\n      detail: { render }\n    } = event;\n\n    if (this.view.renderer && render) {\n      this.view.renderer.renderElement = render;\n    }\n\n    return !defaultPrevented\n  }\n\n  viewRenderedSnapshot(_snapshot, _isPreview, _renderMethod) {}\n\n  preloadOnLoadLinksForView(element) {\n    session.preloadOnLoadLinksForView(element);\n  }\n\n  viewInvalidated() {}\n\n  // Frame renderer delegate\n\n  willRenderFrame(currentElement, _newElement) {\n    this.previousFrameElement = currentElement.cloneNode(true);\n  }\n\n  visitCachedSnapshot = ({ element }) => {\n    const frame = element.querySelector(\"#\" + this.element.id);\n\n    if (frame && this.previousFrameElement) {\n      frame.replaceChildren(...this.previousFrameElement.children);\n    }\n\n    delete this.previousFrameElement;\n  }\n\n  // Private\n\n  async #loadFrameResponse(fetchResponse, document) {\n    const newFrameElement = await this.extractForeignFrameElement(document.body);\n    const rendererClass = this.#shouldMorphFrame ? MorphingFrameRenderer : FrameRenderer;\n\n    if (newFrameElement) {\n      const snapshot = new Snapshot(newFrameElement);\n      const renderer = new rendererClass(this, this.view.snapshot, snapshot, false, false);\n      if (this.view.renderPromise) await this.view.renderPromise;\n      this.changeHistory();\n\n      await this.view.render(renderer);\n      this.complete = true;\n      session.frameRendered(fetchResponse, this.element);\n      session.frameLoaded(this.element);\n      await this.fetchResponseLoaded(fetchResponse);\n    } else if (this.#willHandleFrameMissingFromResponse(fetchResponse)) {\n      this.#handleFrameMissingFromResponse(fetchResponse);\n    }\n  }\n\n  async #visit(url) {\n    const request = new FetchRequest(this, FetchMethod.get, url, new URLSearchParams(), this.element);\n\n    this.#currentFetchRequest?.cancel();\n    this.#currentFetchRequest = request;\n\n    return new Promise((resolve) => {\n      this.#resolveVisitPromise = () => {\n        this.#resolveVisitPromise = () => {};\n        this.#currentFetchRequest = null;\n        resolve();\n      };\n      request.perform();\n    })\n  }\n\n  #navigateFrame(element, url, submitter) {\n    const frame = this.#findFrameElement(element, submitter);\n\n    frame.delegate.proposeVisitIfNavigatedWithAction(frame, getVisitAction(submitter, element, frame));\n\n    this.#withCurrentNavigationElement(element, () => {\n      frame.src = url;\n    });\n  }\n\n  proposeVisitIfNavigatedWithAction(frame, action = null) {\n    this.action = action;\n\n    if (this.action) {\n      const pageSnapshot = PageSnapshot.fromElement(frame).clone();\n      const { visitCachedSnapshot } = frame.delegate;\n\n      frame.delegate.fetchResponseLoaded = async (fetchResponse) => {\n        if (frame.src) {\n          const { statusCode, redirected } = fetchResponse;\n          const responseHTML = await fetchResponse.responseHTML;\n          const response = { statusCode, redirected, responseHTML };\n          const options = {\n            response,\n            visitCachedSnapshot,\n            willRender: false,\n            updateHistory: false,\n            restorationIdentifier: this.restorationIdentifier,\n            snapshot: pageSnapshot\n          };\n\n          if (this.action) options.action = this.action;\n\n          session.visit(frame.src, options);\n        }\n      };\n    }\n  }\n\n  changeHistory() {\n    if (this.action) {\n      const method = getHistoryMethodForAction(this.action);\n      session.history.update(method, expandURL(this.element.src || \"\"), this.restorationIdentifier);\n    }\n  }\n\n  async #handleUnvisitableFrameResponse(fetchResponse) {\n    console.warn(\n      `The response (${fetchResponse.statusCode}) from <turbo-frame id=\"${this.element.id}\"> is performing a full page visit due to turbo-visit-control.`\n    );\n\n    await this.#visitResponse(fetchResponse.response);\n  }\n\n  #willHandleFrameMissingFromResponse(fetchResponse) {\n    this.element.setAttribute(\"complete\", \"\");\n\n    const response = fetchResponse.response;\n    const visit = async (url, options) => {\n      if (url instanceof Response) {\n        this.#visitResponse(url);\n      } else {\n        session.visit(url, options);\n      }\n    };\n\n    const event = dispatch(\"turbo:frame-missing\", {\n      target: this.element,\n      detail: { response, visit },\n      cancelable: true\n    });\n\n    return !event.defaultPrevented\n  }\n\n  #handleFrameMissingFromResponse(fetchResponse) {\n    this.view.missing();\n    this.#throwFrameMissingError(fetchResponse);\n  }\n\n  #throwFrameMissingError(fetchResponse) {\n    const message = `The response (${fetchResponse.statusCode}) did not contain the expected <turbo-frame id=\"${this.element.id}\"> and will be ignored. To perform a full page visit instead, set turbo-visit-control to reload.`;\n    throw new TurboFrameMissingError(message)\n  }\n\n  async #visitResponse(response) {\n    const wrapped = new FetchResponse(response);\n    const responseHTML = await wrapped.responseHTML;\n    const { location, redirected, statusCode } = wrapped;\n\n    return session.visit(location, { response: { redirected, statusCode, responseHTML } })\n  }\n\n  #findFrameElement(element, submitter) {\n    const id = getAttribute(\"data-turbo-frame\", submitter, element) || this.element.getAttribute(\"target\");\n    return getFrameElementById(id) ?? this.element\n  }\n\n  async extractForeignFrameElement(container) {\n    let element;\n    const id = CSS.escape(this.id);\n\n    try {\n      element = activateElement(container.querySelector(`turbo-frame#${id}`), this.sourceURL);\n      if (element) {\n        return element\n      }\n\n      element = activateElement(container.querySelector(`turbo-frame[src][recurse~=${id}]`), this.sourceURL);\n      if (element) {\n        await element.loaded;\n        return await this.extractForeignFrameElement(element)\n      }\n    } catch (error) {\n      console.error(error);\n      return new FrameElement()\n    }\n\n    return null\n  }\n\n  #formActionIsVisitable(form, submitter) {\n    const action = getAction$1(form, submitter);\n\n    return locationIsVisitable(expandURL(action), this.rootLocation)\n  }\n\n  #shouldInterceptNavigation(element, submitter) {\n    const id = getAttribute(\"data-turbo-frame\", submitter, element) || this.element.getAttribute(\"target\");\n\n    if (element instanceof HTMLFormElement && !this.#formActionIsVisitable(element, submitter)) {\n      return false\n    }\n\n    if (!this.enabled || id == \"_top\") {\n      return false\n    }\n\n    if (id) {\n      const frameElement = getFrameElementById(id);\n      if (frameElement) {\n        return !frameElement.disabled\n      }\n    }\n\n    if (!session.elementIsNavigatable(element)) {\n      return false\n    }\n\n    if (submitter && !session.elementIsNavigatable(submitter)) {\n      return false\n    }\n\n    return true\n  }\n\n  // Computed properties\n\n  get id() {\n    return this.element.id\n  }\n\n  get enabled() {\n    return !this.element.disabled\n  }\n\n  get sourceURL() {\n    if (this.element.src) {\n      return this.element.src\n    }\n  }\n\n  set sourceURL(sourceURL) {\n    this.#ignoringChangesToAttribute(\"src\", () => {\n      this.element.src = sourceURL ?? null;\n    });\n  }\n\n  get loadingStyle() {\n    return this.element.loading\n  }\n\n  get isLoading() {\n    return this.formSubmission !== undefined || this.#resolveVisitPromise() !== undefined\n  }\n\n  get complete() {\n    return this.element.hasAttribute(\"complete\")\n  }\n\n  set complete(value) {\n    if (value) {\n      this.element.setAttribute(\"complete\", \"\");\n    } else {\n      this.element.removeAttribute(\"complete\");\n    }\n  }\n\n  get isActive() {\n    return this.element.isActive && this.#connected\n  }\n\n  get rootLocation() {\n    const meta = this.element.ownerDocument.querySelector(`meta[name=\"turbo-root\"]`);\n    const root = meta?.content ?? \"/\";\n    return expandURL(root)\n  }\n\n  #isIgnoringChangesTo(attributeName) {\n    return this.#ignoredAttributes.has(attributeName)\n  }\n\n  #ignoringChangesToAttribute(attributeName, callback) {\n    this.#ignoredAttributes.add(attributeName);\n    callback();\n    this.#ignoredAttributes.delete(attributeName);\n  }\n\n  #withCurrentNavigationElement(element, callback) {\n    this.currentNavigationElement = element;\n    callback();\n    delete this.currentNavigationElement;\n  }\n}\n\nfunction getFrameElementById(id) {\n  if (id != null) {\n    const element = document.getElementById(id);\n    if (element instanceof FrameElement) {\n      return element\n    }\n  }\n}\n\nfunction activateElement(element, currentURL) {\n  if (element) {\n    const src = element.getAttribute(\"src\");\n    if (src != null && currentURL != null && urlsAreEqual(src, currentURL)) {\n      throw new Error(`Matching <turbo-frame id=\"${element.id}\"> element has a source URL which references itself`)\n    }\n    if (element.ownerDocument !== document) {\n      element = document.importNode(element, true);\n    }\n\n    if (element instanceof FrameElement) {\n      element.connectedCallback();\n      element.disconnectedCallback();\n      return element\n    }\n  }\n}\n\nconst StreamActions = {\n  after() {\n    this.targetElements.forEach((e) => e.parentElement?.insertBefore(this.templateContent, e.nextSibling));\n  },\n\n  append() {\n    this.removeDuplicateTargetChildren();\n    this.targetElements.forEach((e) => e.append(this.templateContent));\n  },\n\n  before() {\n    this.targetElements.forEach((e) => e.parentElement?.insertBefore(this.templateContent, e));\n  },\n\n  prepend() {\n    this.removeDuplicateTargetChildren();\n    this.targetElements.forEach((e) => e.prepend(this.templateContent));\n  },\n\n  remove() {\n    this.targetElements.forEach((e) => e.remove());\n  },\n\n  replace() {\n    const method = this.getAttribute(\"method\");\n\n    this.targetElements.forEach((targetElement) => {\n      if (method === \"morph\") {\n        morphElements(targetElement, this.templateContent);\n      } else {\n        targetElement.replaceWith(this.templateContent);\n      }\n    });\n  },\n\n  update() {\n    const method = this.getAttribute(\"method\");\n\n    this.targetElements.forEach((targetElement) => {\n      if (method === \"morph\") {\n        morphChildren(targetElement, this.templateContent);\n      } else {\n        targetElement.innerHTML = \"\";\n        targetElement.append(this.templateContent);\n      }\n    });\n  },\n\n  refresh() {\n    session.refresh(this.baseURI, this.requestId);\n  }\n};\n\n// <turbo-stream action=replace target=id><template>...\n\n/**\n * Renders updates to the page from a stream of messages.\n *\n * Using the `action` attribute, this can be configured one of eight ways:\n *\n * - `after` - inserts the result after the target\n * - `append` - appends the result to the target\n * - `before` - inserts the result before the target\n * - `prepend` - prepends the result to the target\n * - `refresh` - initiates a page refresh\n * - `remove` - removes the target\n * - `replace` - replaces the outer HTML of the target\n * - `update` - replaces the inner HTML of the target\n *\n * @customElement turbo-stream\n * @example\n *   <turbo-stream action=\"append\" target=\"dom_id\">\n *     <template>\n *       Content to append to target designated with the dom_id.\n *     </template>\n *   </turbo-stream>\n */\nclass StreamElement extends HTMLElement {\n  static async renderElement(newElement) {\n    await newElement.performAction();\n  }\n\n  async connectedCallback() {\n    try {\n      await this.render();\n    } catch (error) {\n      console.error(error);\n    } finally {\n      this.disconnect();\n    }\n  }\n\n  async render() {\n    return (this.renderPromise ??= (async () => {\n      const event = this.beforeRenderEvent;\n\n      if (this.dispatchEvent(event)) {\n        await nextRepaint();\n        await event.detail.render(this);\n      }\n    })())\n  }\n\n  disconnect() {\n    try {\n      this.remove();\n      // eslint-disable-next-line no-empty\n    } catch {}\n  }\n\n  /**\n   * Removes duplicate children (by ID)\n   */\n  removeDuplicateTargetChildren() {\n    this.duplicateChildren.forEach((c) => c.remove());\n  }\n\n  /**\n   * Gets the list of duplicate children (i.e. those with the same ID)\n   */\n  get duplicateChildren() {\n    const existingChildren = this.targetElements.flatMap((e) => [...e.children]).filter((c) => !!c.getAttribute(\"id\"));\n    const newChildrenIds = [...(this.templateContent?.children || [])].filter((c) => !!c.getAttribute(\"id\")).map((c) => c.getAttribute(\"id\"));\n\n    return existingChildren.filter((c) => newChildrenIds.includes(c.getAttribute(\"id\")))\n  }\n\n  /**\n   * Gets the action function to be performed.\n   */\n  get performAction() {\n    if (this.action) {\n      const actionFunction = StreamActions[this.action];\n      if (actionFunction) {\n        return actionFunction\n      }\n      this.#raise(\"unknown action\");\n    }\n    this.#raise(\"action attribute is missing\");\n  }\n\n  /**\n   * Gets the target elements which the template will be rendered to.\n   */\n  get targetElements() {\n    if (this.target) {\n      return this.targetElementsById\n    } else if (this.targets) {\n      return this.targetElementsByQuery\n    } else {\n      this.#raise(\"target or targets attribute is missing\");\n    }\n  }\n\n  /**\n   * Gets the contents of the main `<template>`.\n   */\n  get templateContent() {\n    return this.templateElement.content.cloneNode(true)\n  }\n\n  /**\n   * Gets the main `<template>` used for rendering\n   */\n  get templateElement() {\n    if (this.firstElementChild === null) {\n      const template = this.ownerDocument.createElement(\"template\");\n      this.appendChild(template);\n      return template\n    } else if (this.firstElementChild instanceof HTMLTemplateElement) {\n      return this.firstElementChild\n    }\n    this.#raise(\"first child element must be a <template> element\");\n  }\n\n  /**\n   * Gets the current action.\n   */\n  get action() {\n    return this.getAttribute(\"action\")\n  }\n\n  /**\n   * Gets the current target (an element ID) to which the result will\n   * be rendered.\n   */\n  get target() {\n    return this.getAttribute(\"target\")\n  }\n\n  /**\n   * Gets the current \"targets\" selector (a CSS selector)\n   */\n  get targets() {\n    return this.getAttribute(\"targets\")\n  }\n\n  /**\n   * Reads the request-id attribute\n   */\n  get requestId() {\n    return this.getAttribute(\"request-id\")\n  }\n\n  #raise(message) {\n    throw new Error(`${this.description}: ${message}`)\n  }\n\n  get description() {\n    return (this.outerHTML.match(/<[^>]+>/) ?? [])[0] ?? \"<turbo-stream>\"\n  }\n\n  get beforeRenderEvent() {\n    return new CustomEvent(\"turbo:before-stream-render\", {\n      bubbles: true,\n      cancelable: true,\n      detail: { newStream: this, render: StreamElement.renderElement }\n    })\n  }\n\n  get targetElementsById() {\n    const element = this.ownerDocument?.getElementById(this.target);\n\n    if (element !== null) {\n      return [element]\n    } else {\n      return []\n    }\n  }\n\n  get targetElementsByQuery() {\n    const elements = this.ownerDocument?.querySelectorAll(this.targets);\n\n    if (elements.length !== 0) {\n      return Array.prototype.slice.call(elements)\n    } else {\n      return []\n    }\n  }\n}\n\nclass StreamSourceElement extends HTMLElement {\n  streamSource = null\n\n  connectedCallback() {\n    this.streamSource = this.src.match(/^ws{1,2}:/) ? new WebSocket(this.src) : new EventSource(this.src);\n\n    connectStreamSource(this.streamSource);\n  }\n\n  disconnectedCallback() {\n    if (this.streamSource) {\n      this.streamSource.close();\n\n      disconnectStreamSource(this.streamSource);\n    }\n  }\n\n  get src() {\n    return this.getAttribute(\"src\") || \"\"\n  }\n}\n\nFrameElement.delegateConstructor = FrameController;\n\nif (customElements.get(\"turbo-frame\") === undefined) {\n  customElements.define(\"turbo-frame\", FrameElement);\n}\n\nif (customElements.get(\"turbo-stream\") === undefined) {\n  customElements.define(\"turbo-stream\", StreamElement);\n}\n\nif (customElements.get(\"turbo-stream-source\") === undefined) {\n  customElements.define(\"turbo-stream-source\", StreamSourceElement);\n}\n\n(() => {\n  let element = document.currentScript;\n  if (!element) return\n  if (element.hasAttribute(\"data-turbo-suppress-warning\")) return\n\n  element = element.parentElement;\n  while (element) {\n    if (element == document.body) {\n      return console.warn(\n        unindent`\n        You are loading Turbo from a <script> element inside the <body> element. This is probably not what you meant to do!\n\n        Load your application\u2019s JavaScript bundle inside the <head> element instead. <script> elements in <body> are evaluated with each page change.\n\n        For more information, see: https://turbo.hotwired.dev/handbook/building#working-with-script-elements\n\n        \u2014\u2014\n        Suppress this warning by adding a \"data-turbo-suppress-warning\" attribute to: %s\n      `,\n        element.outerHTML\n      )\n    }\n\n    element = element.parentElement;\n  }\n})();\n\nwindow.Turbo = { ...Turbo, StreamActions };\nstart();\n\nexport { FetchEnctype, FetchMethod, FetchRequest, FetchResponse, FrameElement, FrameLoadingStyle, FrameRenderer, PageRenderer, PageSnapshot, StreamActions, StreamElement, StreamSourceElement, cache, clearCache, config, connectStreamSource, disconnectStreamSource, fetchWithTurboHeaders as fetch, fetchEnctypeFromString, fetchMethodFromString, isSafe, navigator$1 as navigator, registerAdapter, renderStreamMessage, session, setConfirmMethod, setFormMode, setProgressBarDelay, start, visit };\n", "let consumer\n\nexport async function getConsumer() {\n  return consumer || setConsumer(createConsumer().then(setConsumer))\n}\n\nexport function setConsumer(newConsumer) {\n  return consumer = newConsumer\n}\n\nexport async function createConsumer() {\n  const { createConsumer } = await import(/* webpackChunkName: \"actioncable\" */ \"@rails/actioncable/src\")\n  return createConsumer()\n}\n\nexport async function subscribeTo(channel, mixin) {\n  const { subscriptions } = await getConsumer()\n  return subscriptions.create(channel, mixin)\n}\n", "// Based on https://github.com/nathan7/snakeize\n//\n// This software is released under the MIT license:\n// Permission is hereby granted, free of charge, to any person obtaining a copy of\n// this software and associated documentation files (the \"Software\"), to deal in\n// the Software without restriction, including without limitation the rights to\n// use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of\n// the Software, and to permit persons to whom the Software is furnished to do so,\n// subject to the following conditions:\n\n// The above copyright notice and this permission notice shall be included in all\n// copies or substantial portions of the Software.\n\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS\n// FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\n// COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\n// IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n// CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\nexport default function walk (obj) {\n    if (!obj || typeof obj !== 'object') return obj;\n    if (obj instanceof Date || obj instanceof RegExp) return obj;\n    if (Array.isArray(obj)) return obj.map(walk);\n    return Object.keys(obj).reduce(function (acc, key) {\n        var camel = key[0].toLowerCase() + key.slice(1).replace(/([A-Z]+)/g, function (m, x) {\n            return '_' + x.toLowerCase();\n        });\n        acc[camel] = walk(obj[key]);\n        return acc;\n    }, {});\n};", "import { connectStreamSource, disconnectStreamSource } from \"@hotwired/turbo\"\nimport { subscribeTo } from \"./cable\"\nimport snakeize from \"./snakeize\"\n\nclass TurboCableStreamSourceElement extends HTMLElement {\n  static observedAttributes = [\"channel\", \"signed-stream-name\"]\n\n  async connectedCallback() {\n    connectStreamSource(this)\n    this.subscription = await subscribeTo(this.channel, {\n      received: this.dispatchMessageEvent.bind(this),\n      connected: this.subscriptionConnected.bind(this),\n      disconnected: this.subscriptionDisconnected.bind(this)\n    })\n  }\n\n  disconnectedCallback() {\n    disconnectStreamSource(this)\n    if (this.subscription) this.subscription.unsubscribe()\n    this.subscriptionDisconnected()\n  }\n\n  attributeChangedCallback() {\n    if (this.subscription) {\n      this.disconnectedCallback()\n      this.connectedCallback()\n    }\n  }\n\n  dispatchMessageEvent(data) {\n    const event = new MessageEvent(\"message\", { data })\n    return this.dispatchEvent(event)\n  }\n\n  subscriptionConnected() {\n    this.setAttribute(\"connected\", \"\")\n  }\n\n  subscriptionDisconnected() {\n    this.removeAttribute(\"connected\")\n  }\n\n  get channel() {\n    const channel = this.getAttribute(\"channel\")\n    const signed_stream_name = this.getAttribute(\"signed-stream-name\")\n    return { channel, signed_stream_name, ...snakeize({ ...this.dataset }) }\n  }\n}\n\n\nif (customElements.get(\"turbo-cable-stream-source\") === undefined) {\n  customElements.define(\"turbo-cable-stream-source\", TurboCableStreamSourceElement)\n}\n", "export function encodeMethodIntoRequestBody(event) {\n  if (event.target instanceof HTMLFormElement) {\n    const { target: form, detail: { fetchOptions } } = event\n\n    form.addEventListener(\"turbo:submit-start\", ({ detail: { formSubmission: { submitter } } }) => {\n      const body = isBodyInit(fetchOptions.body) ? fetchOptions.body : new URLSearchParams()\n      const method = determineFetchMethod(submitter, body, form)\n\n      if (!/get/i.test(method)) {\n        if (/post/i.test(method)) {\n          body.delete(\"_method\")\n        } else {\n          body.set(\"_method\", method)\n        }\n\n        fetchOptions.method = \"post\"\n      }\n    }, { once: true })\n  }\n}\n\nfunction determineFetchMethod(submitter, body, form) {\n  const formMethod = determineFormMethod(submitter)\n  const overrideMethod = body.get(\"_method\")\n  const method = form.getAttribute(\"method\") || \"get\"\n\n  if (typeof formMethod == \"string\") {\n    return formMethod\n  } else if (typeof overrideMethod == \"string\") {\n    return overrideMethod\n  } else {\n    return method\n  }\n}\n\nfunction determineFormMethod(submitter) {\n  if (submitter instanceof HTMLButtonElement || submitter instanceof HTMLInputElement) {\n    // Rails 7 ActionView::Helpers::FormBuilder#button method has an override\n    // for formmethod if the button does not have name or value attributes\n    // set, which is the default. This means that if you use <%= f.button\n    // formmethod: :delete %>, it will generate a <button name=\"_method\"\n    // value=\"delete\" formmethod=\"post\">. Therefore, if the submitter's name\n    // is already _method, it's value attribute already contains the desired\n    // method.\n    if (submitter.name === '_method') {\n      return submitter.value\n    } else if (submitter.hasAttribute(\"formmethod\")) {\n      return submitter.formMethod\n    } else {\n      return null\n    }\n  } else {\n    return null\n  }\n}\n\nfunction isBodyInit(body) {\n  return body instanceof FormData || body instanceof URLSearchParams\n}\n", "import \"./cable_stream_source_element\"\n\nimport * as Turbo from \"@hotwired/turbo\"\nexport { Turbo }\n\nimport * as cable from \"./cable\"\nexport { cable }\n\nimport { encodeMethodIntoRequestBody } from \"./fetch_requests\"\n\nwindow.Turbo = Turbo\n\naddEventListener(\"turbo:before-fetch-request\", encodeMethodIntoRequestBody)\n", "/*\nStimulus 3.2.1\nCopyright \u00A9 2023 Basecamp, LLC\n */\nclass EventListener {\n    constructor(eventTarget, eventName, eventOptions) {\n        this.eventTarget = eventTarget;\n        this.eventName = eventName;\n        this.eventOptions = eventOptions;\n        this.unorderedBindings = new Set();\n    }\n    connect() {\n        this.eventTarget.addEventListener(this.eventName, this, this.eventOptions);\n    }\n    disconnect() {\n        this.eventTarget.removeEventListener(this.eventName, this, this.eventOptions);\n    }\n    bindingConnected(binding) {\n        this.unorderedBindings.add(binding);\n    }\n    bindingDisconnected(binding) {\n        this.unorderedBindings.delete(binding);\n    }\n    handleEvent(event) {\n        const extendedEvent = extendEvent(event);\n        for (const binding of this.bindings) {\n            if (extendedEvent.immediatePropagationStopped) {\n                break;\n            }\n            else {\n                binding.handleEvent(extendedEvent);\n            }\n        }\n    }\n    hasBindings() {\n        return this.unorderedBindings.size > 0;\n    }\n    get bindings() {\n        return Array.from(this.unorderedBindings).sort((left, right) => {\n            const leftIndex = left.index, rightIndex = right.index;\n            return leftIndex < rightIndex ? -1 : leftIndex > rightIndex ? 1 : 0;\n        });\n    }\n}\nfunction extendEvent(event) {\n    if (\"immediatePropagationStopped\" in event) {\n        return event;\n    }\n    else {\n        const { stopImmediatePropagation } = event;\n        return Object.assign(event, {\n            immediatePropagationStopped: false,\n            stopImmediatePropagation() {\n                this.immediatePropagationStopped = true;\n                stopImmediatePropagation.call(this);\n            },\n        });\n    }\n}\n\nclass Dispatcher {\n    constructor(application) {\n        this.application = application;\n        this.eventListenerMaps = new Map();\n        this.started = false;\n    }\n    start() {\n        if (!this.started) {\n            this.started = true;\n            this.eventListeners.forEach((eventListener) => eventListener.connect());\n        }\n    }\n    stop() {\n        if (this.started) {\n            this.started = false;\n            this.eventListeners.forEach((eventListener) => eventListener.disconnect());\n        }\n    }\n    get eventListeners() {\n        return Array.from(this.eventListenerMaps.values()).reduce((listeners, map) => listeners.concat(Array.from(map.values())), []);\n    }\n    bindingConnected(binding) {\n        this.fetchEventListenerForBinding(binding).bindingConnected(binding);\n    }\n    bindingDisconnected(binding, clearEventListeners = false) {\n        this.fetchEventListenerForBinding(binding).bindingDisconnected(binding);\n        if (clearEventListeners)\n            this.clearEventListenersForBinding(binding);\n    }\n    handleError(error, message, detail = {}) {\n        this.application.handleError(error, `Error ${message}`, detail);\n    }\n    clearEventListenersForBinding(binding) {\n        const eventListener = this.fetchEventListenerForBinding(binding);\n        if (!eventListener.hasBindings()) {\n            eventListener.disconnect();\n            this.removeMappedEventListenerFor(binding);\n        }\n    }\n    removeMappedEventListenerFor(binding) {\n        const { eventTarget, eventName, eventOptions } = binding;\n        const eventListenerMap = this.fetchEventListenerMapForEventTarget(eventTarget);\n        const cacheKey = this.cacheKey(eventName, eventOptions);\n        eventListenerMap.delete(cacheKey);\n        if (eventListenerMap.size == 0)\n            this.eventListenerMaps.delete(eventTarget);\n    }\n    fetchEventListenerForBinding(binding) {\n        const { eventTarget, eventName, eventOptions } = binding;\n        return this.fetchEventListener(eventTarget, eventName, eventOptions);\n    }\n    fetchEventListener(eventTarget, eventName, eventOptions) {\n        const eventListenerMap = this.fetchEventListenerMapForEventTarget(eventTarget);\n        const cacheKey = this.cacheKey(eventName, eventOptions);\n        let eventListener = eventListenerMap.get(cacheKey);\n        if (!eventListener) {\n            eventListener = this.createEventListener(eventTarget, eventName, eventOptions);\n            eventListenerMap.set(cacheKey, eventListener);\n        }\n        return eventListener;\n    }\n    createEventListener(eventTarget, eventName, eventOptions) {\n        const eventListener = new EventListener(eventTarget, eventName, eventOptions);\n        if (this.started) {\n            eventListener.connect();\n        }\n        return eventListener;\n    }\n    fetchEventListenerMapForEventTarget(eventTarget) {\n        let eventListenerMap = this.eventListenerMaps.get(eventTarget);\n        if (!eventListenerMap) {\n            eventListenerMap = new Map();\n            this.eventListenerMaps.set(eventTarget, eventListenerMap);\n        }\n        return eventListenerMap;\n    }\n    cacheKey(eventName, eventOptions) {\n        const parts = [eventName];\n        Object.keys(eventOptions)\n            .sort()\n            .forEach((key) => {\n            parts.push(`${eventOptions[key] ? \"\" : \"!\"}${key}`);\n        });\n        return parts.join(\":\");\n    }\n}\n\nconst defaultActionDescriptorFilters = {\n    stop({ event, value }) {\n        if (value)\n            event.stopPropagation();\n        return true;\n    },\n    prevent({ event, value }) {\n        if (value)\n            event.preventDefault();\n        return true;\n    },\n    self({ event, value, element }) {\n        if (value) {\n            return element === event.target;\n        }\n        else {\n            return true;\n        }\n    },\n};\nconst descriptorPattern = /^(?:(?:([^.]+?)\\+)?(.+?)(?:\\.(.+?))?(?:@(window|document))?->)?(.+?)(?:#([^:]+?))(?::(.+))?$/;\nfunction parseActionDescriptorString(descriptorString) {\n    const source = descriptorString.trim();\n    const matches = source.match(descriptorPattern) || [];\n    let eventName = matches[2];\n    let keyFilter = matches[3];\n    if (keyFilter && ![\"keydown\", \"keyup\", \"keypress\"].includes(eventName)) {\n        eventName += `.${keyFilter}`;\n        keyFilter = \"\";\n    }\n    return {\n        eventTarget: parseEventTarget(matches[4]),\n        eventName,\n        eventOptions: matches[7] ? parseEventOptions(matches[7]) : {},\n        identifier: matches[5],\n        methodName: matches[6],\n        keyFilter: matches[1] || keyFilter,\n    };\n}\nfunction parseEventTarget(eventTargetName) {\n    if (eventTargetName == \"window\") {\n        return window;\n    }\n    else if (eventTargetName == \"document\") {\n        return document;\n    }\n}\nfunction parseEventOptions(eventOptions) {\n    return eventOptions\n        .split(\":\")\n        .reduce((options, token) => Object.assign(options, { [token.replace(/^!/, \"\")]: !/^!/.test(token) }), {});\n}\nfunction stringifyEventTarget(eventTarget) {\n    if (eventTarget == window) {\n        return \"window\";\n    }\n    else if (eventTarget == document) {\n        return \"document\";\n    }\n}\n\nfunction camelize(value) {\n    return value.replace(/(?:[_-])([a-z0-9])/g, (_, char) => char.toUpperCase());\n}\nfunction namespaceCamelize(value) {\n    return camelize(value.replace(/--/g, \"-\").replace(/__/g, \"_\"));\n}\nfunction capitalize(value) {\n    return value.charAt(0).toUpperCase() + value.slice(1);\n}\nfunction dasherize(value) {\n    return value.replace(/([A-Z])/g, (_, char) => `-${char.toLowerCase()}`);\n}\nfunction tokenize(value) {\n    return value.match(/[^\\s]+/g) || [];\n}\n\nfunction isSomething(object) {\n    return object !== null && object !== undefined;\n}\nfunction hasProperty(object, property) {\n    return Object.prototype.hasOwnProperty.call(object, property);\n}\n\nconst allModifiers = [\"meta\", \"ctrl\", \"alt\", \"shift\"];\nclass Action {\n    constructor(element, index, descriptor, schema) {\n        this.element = element;\n        this.index = index;\n        this.eventTarget = descriptor.eventTarget || element;\n        this.eventName = descriptor.eventName || getDefaultEventNameForElement(element) || error(\"missing event name\");\n        this.eventOptions = descriptor.eventOptions || {};\n        this.identifier = descriptor.identifier || error(\"missing identifier\");\n        this.methodName = descriptor.methodName || error(\"missing method name\");\n        this.keyFilter = descriptor.keyFilter || \"\";\n        this.schema = schema;\n    }\n    static forToken(token, schema) {\n        return new this(token.element, token.index, parseActionDescriptorString(token.content), schema);\n    }\n    toString() {\n        const eventFilter = this.keyFilter ? `.${this.keyFilter}` : \"\";\n        const eventTarget = this.eventTargetName ? `@${this.eventTargetName}` : \"\";\n        return `${this.eventName}${eventFilter}${eventTarget}->${this.identifier}#${this.methodName}`;\n    }\n    shouldIgnoreKeyboardEvent(event) {\n        if (!this.keyFilter) {\n            return false;\n        }\n        const filters = this.keyFilter.split(\"+\");\n        if (this.keyFilterDissatisfied(event, filters)) {\n            return true;\n        }\n        const standardFilter = filters.filter((key) => !allModifiers.includes(key))[0];\n        if (!standardFilter) {\n            return false;\n        }\n        if (!hasProperty(this.keyMappings, standardFilter)) {\n            error(`contains unknown key filter: ${this.keyFilter}`);\n        }\n        return this.keyMappings[standardFilter].toLowerCase() !== event.key.toLowerCase();\n    }\n    shouldIgnoreMouseEvent(event) {\n        if (!this.keyFilter) {\n            return false;\n        }\n        const filters = [this.keyFilter];\n        if (this.keyFilterDissatisfied(event, filters)) {\n            return true;\n        }\n        return false;\n    }\n    get params() {\n        const params = {};\n        const pattern = new RegExp(`^data-${this.identifier}-(.+)-param$`, \"i\");\n        for (const { name, value } of Array.from(this.element.attributes)) {\n            const match = name.match(pattern);\n            const key = match && match[1];\n            if (key) {\n                params[camelize(key)] = typecast(value);\n            }\n        }\n        return params;\n    }\n    get eventTargetName() {\n        return stringifyEventTarget(this.eventTarget);\n    }\n    get keyMappings() {\n        return this.schema.keyMappings;\n    }\n    keyFilterDissatisfied(event, filters) {\n        const [meta, ctrl, alt, shift] = allModifiers.map((modifier) => filters.includes(modifier));\n        return event.metaKey !== meta || event.ctrlKey !== ctrl || event.altKey !== alt || event.shiftKey !== shift;\n    }\n}\nconst defaultEventNames = {\n    a: () => \"click\",\n    button: () => \"click\",\n    form: () => \"submit\",\n    details: () => \"toggle\",\n    input: (e) => (e.getAttribute(\"type\") == \"submit\" ? \"click\" : \"input\"),\n    select: () => \"change\",\n    textarea: () => \"input\",\n};\nfunction getDefaultEventNameForElement(element) {\n    const tagName = element.tagName.toLowerCase();\n    if (tagName in defaultEventNames) {\n        return defaultEventNames[tagName](element);\n    }\n}\nfunction error(message) {\n    throw new Error(message);\n}\nfunction typecast(value) {\n    try {\n        return JSON.parse(value);\n    }\n    catch (o_O) {\n        return value;\n    }\n}\n\nclass Binding {\n    constructor(context, action) {\n        this.context = context;\n        this.action = action;\n    }\n    get index() {\n        return this.action.index;\n    }\n    get eventTarget() {\n        return this.action.eventTarget;\n    }\n    get eventOptions() {\n        return this.action.eventOptions;\n    }\n    get identifier() {\n        return this.context.identifier;\n    }\n    handleEvent(event) {\n        const actionEvent = this.prepareActionEvent(event);\n        if (this.willBeInvokedByEvent(event) && this.applyEventModifiers(actionEvent)) {\n            this.invokeWithEvent(actionEvent);\n        }\n    }\n    get eventName() {\n        return this.action.eventName;\n    }\n    get method() {\n        const method = this.controller[this.methodName];\n        if (typeof method == \"function\") {\n            return method;\n        }\n        throw new Error(`Action \"${this.action}\" references undefined method \"${this.methodName}\"`);\n    }\n    applyEventModifiers(event) {\n        const { element } = this.action;\n        const { actionDescriptorFilters } = this.context.application;\n        const { controller } = this.context;\n        let passes = true;\n        for (const [name, value] of Object.entries(this.eventOptions)) {\n            if (name in actionDescriptorFilters) {\n                const filter = actionDescriptorFilters[name];\n                passes = passes && filter({ name, value, event, element, controller });\n            }\n            else {\n                continue;\n            }\n        }\n        return passes;\n    }\n    prepareActionEvent(event) {\n        return Object.assign(event, { params: this.action.params });\n    }\n    invokeWithEvent(event) {\n        const { target, currentTarget } = event;\n        try {\n            this.method.call(this.controller, event);\n            this.context.logDebugActivity(this.methodName, { event, target, currentTarget, action: this.methodName });\n        }\n        catch (error) {\n            const { identifier, controller, element, index } = this;\n            const detail = { identifier, controller, element, index, event };\n            this.context.handleError(error, `invoking action \"${this.action}\"`, detail);\n        }\n    }\n    willBeInvokedByEvent(event) {\n        const eventTarget = event.target;\n        if (event instanceof KeyboardEvent && this.action.shouldIgnoreKeyboardEvent(event)) {\n            return false;\n        }\n        if (event instanceof MouseEvent && this.action.shouldIgnoreMouseEvent(event)) {\n            return false;\n        }\n        if (this.element === eventTarget) {\n            return true;\n        }\n        else if (eventTarget instanceof Element && this.element.contains(eventTarget)) {\n            return this.scope.containsElement(eventTarget);\n        }\n        else {\n            return this.scope.containsElement(this.action.element);\n        }\n    }\n    get controller() {\n        return this.context.controller;\n    }\n    get methodName() {\n        return this.action.methodName;\n    }\n    get element() {\n        return this.scope.element;\n    }\n    get scope() {\n        return this.context.scope;\n    }\n}\n\nclass ElementObserver {\n    constructor(element, delegate) {\n        this.mutationObserverInit = { attributes: true, childList: true, subtree: true };\n        this.element = element;\n        this.started = false;\n        this.delegate = delegate;\n        this.elements = new Set();\n        this.mutationObserver = new MutationObserver((mutations) => this.processMutations(mutations));\n    }\n    start() {\n        if (!this.started) {\n            this.started = true;\n            this.mutationObserver.observe(this.element, this.mutationObserverInit);\n            this.refresh();\n        }\n    }\n    pause(callback) {\n        if (this.started) {\n            this.mutationObserver.disconnect();\n            this.started = false;\n        }\n        callback();\n        if (!this.started) {\n            this.mutationObserver.observe(this.element, this.mutationObserverInit);\n            this.started = true;\n        }\n    }\n    stop() {\n        if (this.started) {\n            this.mutationObserver.takeRecords();\n            this.mutationObserver.disconnect();\n            this.started = false;\n        }\n    }\n    refresh() {\n        if (this.started) {\n            const matches = new Set(this.matchElementsInTree());\n            for (const element of Array.from(this.elements)) {\n                if (!matches.has(element)) {\n                    this.removeElement(element);\n                }\n            }\n            for (const element of Array.from(matches)) {\n                this.addElement(element);\n            }\n        }\n    }\n    processMutations(mutations) {\n        if (this.started) {\n            for (const mutation of mutations) {\n                this.processMutation(mutation);\n            }\n        }\n    }\n    processMutation(mutation) {\n        if (mutation.type == \"attributes\") {\n            this.processAttributeChange(mutation.target, mutation.attributeName);\n        }\n        else if (mutation.type == \"childList\") {\n            this.processRemovedNodes(mutation.removedNodes);\n            this.processAddedNodes(mutation.addedNodes);\n        }\n    }\n    processAttributeChange(element, attributeName) {\n        if (this.elements.has(element)) {\n            if (this.delegate.elementAttributeChanged && this.matchElement(element)) {\n                this.delegate.elementAttributeChanged(element, attributeName);\n            }\n            else {\n                this.removeElement(element);\n            }\n        }\n        else if (this.matchElement(element)) {\n            this.addElement(element);\n        }\n    }\n    processRemovedNodes(nodes) {\n        for (const node of Array.from(nodes)) {\n            const element = this.elementFromNode(node);\n            if (element) {\n                this.processTree(element, this.removeElement);\n            }\n        }\n    }\n    processAddedNodes(nodes) {\n        for (const node of Array.from(nodes)) {\n            const element = this.elementFromNode(node);\n            if (element && this.elementIsActive(element)) {\n                this.processTree(element, this.addElement);\n            }\n        }\n    }\n    matchElement(element) {\n        return this.delegate.matchElement(element);\n    }\n    matchElementsInTree(tree = this.element) {\n        return this.delegate.matchElementsInTree(tree);\n    }\n    processTree(tree, processor) {\n        for (const element of this.matchElementsInTree(tree)) {\n            processor.call(this, element);\n        }\n    }\n    elementFromNode(node) {\n        if (node.nodeType == Node.ELEMENT_NODE) {\n            return node;\n        }\n    }\n    elementIsActive(element) {\n        if (element.isConnected != this.element.isConnected) {\n            return false;\n        }\n        else {\n            return this.element.contains(element);\n        }\n    }\n    addElement(element) {\n        if (!this.elements.has(element)) {\n            if (this.elementIsActive(element)) {\n                this.elements.add(element);\n                if (this.delegate.elementMatched) {\n                    this.delegate.elementMatched(element);\n                }\n            }\n        }\n    }\n    removeElement(element) {\n        if (this.elements.has(element)) {\n            this.elements.delete(element);\n            if (this.delegate.elementUnmatched) {\n                this.delegate.elementUnmatched(element);\n            }\n        }\n    }\n}\n\nclass AttributeObserver {\n    constructor(element, attributeName, delegate) {\n        this.attributeName = attributeName;\n        this.delegate = delegate;\n        this.elementObserver = new ElementObserver(element, this);\n    }\n    get element() {\n        return this.elementObserver.element;\n    }\n    get selector() {\n        return `[${this.attributeName}]`;\n    }\n    start() {\n        this.elementObserver.start();\n    }\n    pause(callback) {\n        this.elementObserver.pause(callback);\n    }\n    stop() {\n        this.elementObserver.stop();\n    }\n    refresh() {\n        this.elementObserver.refresh();\n    }\n    get started() {\n        return this.elementObserver.started;\n    }\n    matchElement(element) {\n        return element.hasAttribute(this.attributeName);\n    }\n    matchElementsInTree(tree) {\n        const match = this.matchElement(tree) ? [tree] : [];\n        const matches = Array.from(tree.querySelectorAll(this.selector));\n        return match.concat(matches);\n    }\n    elementMatched(element) {\n        if (this.delegate.elementMatchedAttribute) {\n            this.delegate.elementMatchedAttribute(element, this.attributeName);\n        }\n    }\n    elementUnmatched(element) {\n        if (this.delegate.elementUnmatchedAttribute) {\n            this.delegate.elementUnmatchedAttribute(element, this.attributeName);\n        }\n    }\n    elementAttributeChanged(element, attributeName) {\n        if (this.delegate.elementAttributeValueChanged && this.attributeName == attributeName) {\n            this.delegate.elementAttributeValueChanged(element, attributeName);\n        }\n    }\n}\n\nfunction add(map, key, value) {\n    fetch(map, key).add(value);\n}\nfunction del(map, key, value) {\n    fetch(map, key).delete(value);\n    prune(map, key);\n}\nfunction fetch(map, key) {\n    let values = map.get(key);\n    if (!values) {\n        values = new Set();\n        map.set(key, values);\n    }\n    return values;\n}\nfunction prune(map, key) {\n    const values = map.get(key);\n    if (values != null && values.size == 0) {\n        map.delete(key);\n    }\n}\n\nclass Multimap {\n    constructor() {\n        this.valuesByKey = new Map();\n    }\n    get keys() {\n        return Array.from(this.valuesByKey.keys());\n    }\n    get values() {\n        const sets = Array.from(this.valuesByKey.values());\n        return sets.reduce((values, set) => values.concat(Array.from(set)), []);\n    }\n    get size() {\n        const sets = Array.from(this.valuesByKey.values());\n        return sets.reduce((size, set) => size + set.size, 0);\n    }\n    add(key, value) {\n        add(this.valuesByKey, key, value);\n    }\n    delete(key, value) {\n        del(this.valuesByKey, key, value);\n    }\n    has(key, value) {\n        const values = this.valuesByKey.get(key);\n        return values != null && values.has(value);\n    }\n    hasKey(key) {\n        return this.valuesByKey.has(key);\n    }\n    hasValue(value) {\n        const sets = Array.from(this.valuesByKey.values());\n        return sets.some((set) => set.has(value));\n    }\n    getValuesForKey(key) {\n        const values = this.valuesByKey.get(key);\n        return values ? Array.from(values) : [];\n    }\n    getKeysForValue(value) {\n        return Array.from(this.valuesByKey)\n            .filter(([_key, values]) => values.has(value))\n            .map(([key, _values]) => key);\n    }\n}\n\nclass IndexedMultimap extends Multimap {\n    constructor() {\n        super();\n        this.keysByValue = new Map();\n    }\n    get values() {\n        return Array.from(this.keysByValue.keys());\n    }\n    add(key, value) {\n        super.add(key, value);\n        add(this.keysByValue, value, key);\n    }\n    delete(key, value) {\n        super.delete(key, value);\n        del(this.keysByValue, value, key);\n    }\n    hasValue(value) {\n        return this.keysByValue.has(value);\n    }\n    getKeysForValue(value) {\n        const set = this.keysByValue.get(value);\n        return set ? Array.from(set) : [];\n    }\n}\n\nclass SelectorObserver {\n    constructor(element, selector, delegate, details) {\n        this._selector = selector;\n        this.details = details;\n        this.elementObserver = new ElementObserver(element, this);\n        this.delegate = delegate;\n        this.matchesByElement = new Multimap();\n    }\n    get started() {\n        return this.elementObserver.started;\n    }\n    get selector() {\n        return this._selector;\n    }\n    set selector(selector) {\n        this._selector = selector;\n        this.refresh();\n    }\n    start() {\n        this.elementObserver.start();\n    }\n    pause(callback) {\n        this.elementObserver.pause(callback);\n    }\n    stop() {\n        this.elementObserver.stop();\n    }\n    refresh() {\n        this.elementObserver.refresh();\n    }\n    get element() {\n        return this.elementObserver.element;\n    }\n    matchElement(element) {\n        const { selector } = this;\n        if (selector) {\n            const matches = element.matches(selector);\n            if (this.delegate.selectorMatchElement) {\n                return matches && this.delegate.selectorMatchElement(element, this.details);\n            }\n            return matches;\n        }\n        else {\n            return false;\n        }\n    }\n    matchElementsInTree(tree) {\n        const { selector } = this;\n        if (selector) {\n            const match = this.matchElement(tree) ? [tree] : [];\n            const matches = Array.from(tree.querySelectorAll(selector)).filter((match) => this.matchElement(match));\n            return match.concat(matches);\n        }\n        else {\n            return [];\n        }\n    }\n    elementMatched(element) {\n        const { selector } = this;\n        if (selector) {\n            this.selectorMatched(element, selector);\n        }\n    }\n    elementUnmatched(element) {\n        const selectors = this.matchesByElement.getKeysForValue(element);\n        for (const selector of selectors) {\n            this.selectorUnmatched(element, selector);\n        }\n    }\n    elementAttributeChanged(element, _attributeName) {\n        const { selector } = this;\n        if (selector) {\n            const matches = this.matchElement(element);\n            const matchedBefore = this.matchesByElement.has(selector, element);\n            if (matches && !matchedBefore) {\n                this.selectorMatched(element, selector);\n            }\n            else if (!matches && matchedBefore) {\n                this.selectorUnmatched(element, selector);\n            }\n        }\n    }\n    selectorMatched(element, selector) {\n        this.delegate.selectorMatched(element, selector, this.details);\n        this.matchesByElement.add(selector, element);\n    }\n    selectorUnmatched(element, selector) {\n        this.delegate.selectorUnmatched(element, selector, this.details);\n        this.matchesByElement.delete(selector, element);\n    }\n}\n\nclass StringMapObserver {\n    constructor(element, delegate) {\n        this.element = element;\n        this.delegate = delegate;\n        this.started = false;\n        this.stringMap = new Map();\n        this.mutationObserver = new MutationObserver((mutations) => this.processMutations(mutations));\n    }\n    start() {\n        if (!this.started) {\n            this.started = true;\n            this.mutationObserver.observe(this.element, { attributes: true, attributeOldValue: true });\n            this.refresh();\n        }\n    }\n    stop() {\n        if (this.started) {\n            this.mutationObserver.takeRecords();\n            this.mutationObserver.disconnect();\n            this.started = false;\n        }\n    }\n    refresh() {\n        if (this.started) {\n            for (const attributeName of this.knownAttributeNames) {\n                this.refreshAttribute(attributeName, null);\n            }\n        }\n    }\n    processMutations(mutations) {\n        if (this.started) {\n            for (const mutation of mutations) {\n                this.processMutation(mutation);\n            }\n        }\n    }\n    processMutation(mutation) {\n        const attributeName = mutation.attributeName;\n        if (attributeName) {\n            this.refreshAttribute(attributeName, mutation.oldValue);\n        }\n    }\n    refreshAttribute(attributeName, oldValue) {\n        const key = this.delegate.getStringMapKeyForAttribute(attributeName);\n        if (key != null) {\n            if (!this.stringMap.has(attributeName)) {\n                this.stringMapKeyAdded(key, attributeName);\n            }\n            const value = this.element.getAttribute(attributeName);\n            if (this.stringMap.get(attributeName) != value) {\n                this.stringMapValueChanged(value, key, oldValue);\n            }\n            if (value == null) {\n                const oldValue = this.stringMap.get(attributeName);\n                this.stringMap.delete(attributeName);\n                if (oldValue)\n                    this.stringMapKeyRemoved(key, attributeName, oldValue);\n            }\n            else {\n                this.stringMap.set(attributeName, value);\n            }\n        }\n    }\n    stringMapKeyAdded(key, attributeName) {\n        if (this.delegate.stringMapKeyAdded) {\n            this.delegate.stringMapKeyAdded(key, attributeName);\n        }\n    }\n    stringMapValueChanged(value, key, oldValue) {\n        if (this.delegate.stringMapValueChanged) {\n            this.delegate.stringMapValueChanged(value, key, oldValue);\n        }\n    }\n    stringMapKeyRemoved(key, attributeName, oldValue) {\n        if (this.delegate.stringMapKeyRemoved) {\n            this.delegate.stringMapKeyRemoved(key, attributeName, oldValue);\n        }\n    }\n    get knownAttributeNames() {\n        return Array.from(new Set(this.currentAttributeNames.concat(this.recordedAttributeNames)));\n    }\n    get currentAttributeNames() {\n        return Array.from(this.element.attributes).map((attribute) => attribute.name);\n    }\n    get recordedAttributeNames() {\n        return Array.from(this.stringMap.keys());\n    }\n}\n\nclass TokenListObserver {\n    constructor(element, attributeName, delegate) {\n        this.attributeObserver = new AttributeObserver(element, attributeName, this);\n        this.delegate = delegate;\n        this.tokensByElement = new Multimap();\n    }\n    get started() {\n        return this.attributeObserver.started;\n    }\n    start() {\n        this.attributeObserver.start();\n    }\n    pause(callback) {\n        this.attributeObserver.pause(callback);\n    }\n    stop() {\n        this.attributeObserver.stop();\n    }\n    refresh() {\n        this.attributeObserver.refresh();\n    }\n    get element() {\n        return this.attributeObserver.element;\n    }\n    get attributeName() {\n        return this.attributeObserver.attributeName;\n    }\n    elementMatchedAttribute(element) {\n        this.tokensMatched(this.readTokensForElement(element));\n    }\n    elementAttributeValueChanged(element) {\n        const [unmatchedTokens, matchedTokens] = this.refreshTokensForElement(element);\n        this.tokensUnmatched(unmatchedTokens);\n        this.tokensMatched(matchedTokens);\n    }\n    elementUnmatchedAttribute(element) {\n        this.tokensUnmatched(this.tokensByElement.getValuesForKey(element));\n    }\n    tokensMatched(tokens) {\n        tokens.forEach((token) => this.tokenMatched(token));\n    }\n    tokensUnmatched(tokens) {\n        tokens.forEach((token) => this.tokenUnmatched(token));\n    }\n    tokenMatched(token) {\n        this.delegate.tokenMatched(token);\n        this.tokensByElement.add(token.element, token);\n    }\n    tokenUnmatched(token) {\n        this.delegate.tokenUnmatched(token);\n        this.tokensByElement.delete(token.element, token);\n    }\n    refreshTokensForElement(element) {\n        const previousTokens = this.tokensByElement.getValuesForKey(element);\n        const currentTokens = this.readTokensForElement(element);\n        const firstDifferingIndex = zip(previousTokens, currentTokens).findIndex(([previousToken, currentToken]) => !tokensAreEqual(previousToken, currentToken));\n        if (firstDifferingIndex == -1) {\n            return [[], []];\n        }\n        else {\n            return [previousTokens.slice(firstDifferingIndex), currentTokens.slice(firstDifferingIndex)];\n        }\n    }\n    readTokensForElement(element) {\n        const attributeName = this.attributeName;\n        const tokenString = element.getAttribute(attributeName) || \"\";\n        return parseTokenString(tokenString, element, attributeName);\n    }\n}\nfunction parseTokenString(tokenString, element, attributeName) {\n    return tokenString\n        .trim()\n        .split(/\\s+/)\n        .filter((content) => content.length)\n        .map((content, index) => ({ element, attributeName, content, index }));\n}\nfunction zip(left, right) {\n    const length = Math.max(left.length, right.length);\n    return Array.from({ length }, (_, index) => [left[index], right[index]]);\n}\nfunction tokensAreEqual(left, right) {\n    return left && right && left.index == right.index && left.content == right.content;\n}\n\nclass ValueListObserver {\n    constructor(element, attributeName, delegate) {\n        this.tokenListObserver = new TokenListObserver(element, attributeName, this);\n        this.delegate = delegate;\n        this.parseResultsByToken = new WeakMap();\n        this.valuesByTokenByElement = new WeakMap();\n    }\n    get started() {\n        return this.tokenListObserver.started;\n    }\n    start() {\n        this.tokenListObserver.start();\n    }\n    stop() {\n        this.tokenListObserver.stop();\n    }\n    refresh() {\n        this.tokenListObserver.refresh();\n    }\n    get element() {\n        return this.tokenListObserver.element;\n    }\n    get attributeName() {\n        return this.tokenListObserver.attributeName;\n    }\n    tokenMatched(token) {\n        const { element } = token;\n        const { value } = this.fetchParseResultForToken(token);\n        if (value) {\n            this.fetchValuesByTokenForElement(element).set(token, value);\n            this.delegate.elementMatchedValue(element, value);\n        }\n    }\n    tokenUnmatched(token) {\n        const { element } = token;\n        const { value } = this.fetchParseResultForToken(token);\n        if (value) {\n            this.fetchValuesByTokenForElement(element).delete(token);\n            this.delegate.elementUnmatchedValue(element, value);\n        }\n    }\n    fetchParseResultForToken(token) {\n        let parseResult = this.parseResultsByToken.get(token);\n        if (!parseResult) {\n            parseResult = this.parseToken(token);\n            this.parseResultsByToken.set(token, parseResult);\n        }\n        return parseResult;\n    }\n    fetchValuesByTokenForElement(element) {\n        let valuesByToken = this.valuesByTokenByElement.get(element);\n        if (!valuesByToken) {\n            valuesByToken = new Map();\n            this.valuesByTokenByElement.set(element, valuesByToken);\n        }\n        return valuesByToken;\n    }\n    parseToken(token) {\n        try {\n            const value = this.delegate.parseValueForToken(token);\n            return { value };\n        }\n        catch (error) {\n            return { error };\n        }\n    }\n}\n\nclass BindingObserver {\n    constructor(context, delegate) {\n        this.context = context;\n        this.delegate = delegate;\n        this.bindingsByAction = new Map();\n    }\n    start() {\n        if (!this.valueListObserver) {\n            this.valueListObserver = new ValueListObserver(this.element, this.actionAttribute, this);\n            this.valueListObserver.start();\n        }\n    }\n    stop() {\n        if (this.valueListObserver) {\n            this.valueListObserver.stop();\n            delete this.valueListObserver;\n            this.disconnectAllActions();\n        }\n    }\n    get element() {\n        return this.context.element;\n    }\n    get identifier() {\n        return this.context.identifier;\n    }\n    get actionAttribute() {\n        return this.schema.actionAttribute;\n    }\n    get schema() {\n        return this.context.schema;\n    }\n    get bindings() {\n        return Array.from(this.bindingsByAction.values());\n    }\n    connectAction(action) {\n        const binding = new Binding(this.context, action);\n        this.bindingsByAction.set(action, binding);\n        this.delegate.bindingConnected(binding);\n    }\n    disconnectAction(action) {\n        const binding = this.bindingsByAction.get(action);\n        if (binding) {\n            this.bindingsByAction.delete(action);\n            this.delegate.bindingDisconnected(binding);\n        }\n    }\n    disconnectAllActions() {\n        this.bindings.forEach((binding) => this.delegate.bindingDisconnected(binding, true));\n        this.bindingsByAction.clear();\n    }\n    parseValueForToken(token) {\n        const action = Action.forToken(token, this.schema);\n        if (action.identifier == this.identifier) {\n            return action;\n        }\n    }\n    elementMatchedValue(element, action) {\n        this.connectAction(action);\n    }\n    elementUnmatchedValue(element, action) {\n        this.disconnectAction(action);\n    }\n}\n\nclass ValueObserver {\n    constructor(context, receiver) {\n        this.context = context;\n        this.receiver = receiver;\n        this.stringMapObserver = new StringMapObserver(this.element, this);\n        this.valueDescriptorMap = this.controller.valueDescriptorMap;\n    }\n    start() {\n        this.stringMapObserver.start();\n        this.invokeChangedCallbacksForDefaultValues();\n    }\n    stop() {\n        this.stringMapObserver.stop();\n    }\n    get element() {\n        return this.context.element;\n    }\n    get controller() {\n        return this.context.controller;\n    }\n    getStringMapKeyForAttribute(attributeName) {\n        if (attributeName in this.valueDescriptorMap) {\n            return this.valueDescriptorMap[attributeName].name;\n        }\n    }\n    stringMapKeyAdded(key, attributeName) {\n        const descriptor = this.valueDescriptorMap[attributeName];\n        if (!this.hasValue(key)) {\n            this.invokeChangedCallback(key, descriptor.writer(this.receiver[key]), descriptor.writer(descriptor.defaultValue));\n        }\n    }\n    stringMapValueChanged(value, name, oldValue) {\n        const descriptor = this.valueDescriptorNameMap[name];\n        if (value === null)\n            return;\n        if (oldValue === null) {\n            oldValue = descriptor.writer(descriptor.defaultValue);\n        }\n        this.invokeChangedCallback(name, value, oldValue);\n    }\n    stringMapKeyRemoved(key, attributeName, oldValue) {\n        const descriptor = this.valueDescriptorNameMap[key];\n        if (this.hasValue(key)) {\n            this.invokeChangedCallback(key, descriptor.writer(this.receiver[key]), oldValue);\n        }\n        else {\n            this.invokeChangedCallback(key, descriptor.writer(descriptor.defaultValue), oldValue);\n        }\n    }\n    invokeChangedCallbacksForDefaultValues() {\n        for (const { key, name, defaultValue, writer } of this.valueDescriptors) {\n            if (defaultValue != undefined && !this.controller.data.has(key)) {\n                this.invokeChangedCallback(name, writer(defaultValue), undefined);\n            }\n        }\n    }\n    invokeChangedCallback(name, rawValue, rawOldValue) {\n        const changedMethodName = `${name}Changed`;\n        const changedMethod = this.receiver[changedMethodName];\n        if (typeof changedMethod == \"function\") {\n            const descriptor = this.valueDescriptorNameMap[name];\n            try {\n                const value = descriptor.reader(rawValue);\n                let oldValue = rawOldValue;\n                if (rawOldValue) {\n                    oldValue = descriptor.reader(rawOldValue);\n                }\n                changedMethod.call(this.receiver, value, oldValue);\n            }\n            catch (error) {\n                if (error instanceof TypeError) {\n                    error.message = `Stimulus Value \"${this.context.identifier}.${descriptor.name}\" - ${error.message}`;\n                }\n                throw error;\n            }\n        }\n    }\n    get valueDescriptors() {\n        const { valueDescriptorMap } = this;\n        return Object.keys(valueDescriptorMap).map((key) => valueDescriptorMap[key]);\n    }\n    get valueDescriptorNameMap() {\n        const descriptors = {};\n        Object.keys(this.valueDescriptorMap).forEach((key) => {\n            const descriptor = this.valueDescriptorMap[key];\n            descriptors[descriptor.name] = descriptor;\n        });\n        return descriptors;\n    }\n    hasValue(attributeName) {\n        const descriptor = this.valueDescriptorNameMap[attributeName];\n        const hasMethodName = `has${capitalize(descriptor.name)}`;\n        return this.receiver[hasMethodName];\n    }\n}\n\nclass TargetObserver {\n    constructor(context, delegate) {\n        this.context = context;\n        this.delegate = delegate;\n        this.targetsByName = new Multimap();\n    }\n    start() {\n        if (!this.tokenListObserver) {\n            this.tokenListObserver = new TokenListObserver(this.element, this.attributeName, this);\n            this.tokenListObserver.start();\n        }\n    }\n    stop() {\n        if (this.tokenListObserver) {\n            this.disconnectAllTargets();\n            this.tokenListObserver.stop();\n            delete this.tokenListObserver;\n        }\n    }\n    tokenMatched({ element, content: name }) {\n        if (this.scope.containsElement(element)) {\n            this.connectTarget(element, name);\n        }\n    }\n    tokenUnmatched({ element, content: name }) {\n        this.disconnectTarget(element, name);\n    }\n    connectTarget(element, name) {\n        var _a;\n        if (!this.targetsByName.has(name, element)) {\n            this.targetsByName.add(name, element);\n            (_a = this.tokenListObserver) === null || _a === void 0 ? void 0 : _a.pause(() => this.delegate.targetConnected(element, name));\n        }\n    }\n    disconnectTarget(element, name) {\n        var _a;\n        if (this.targetsByName.has(name, element)) {\n            this.targetsByName.delete(name, element);\n            (_a = this.tokenListObserver) === null || _a === void 0 ? void 0 : _a.pause(() => this.delegate.targetDisconnected(element, name));\n        }\n    }\n    disconnectAllTargets() {\n        for (const name of this.targetsByName.keys) {\n            for (const element of this.targetsByName.getValuesForKey(name)) {\n                this.disconnectTarget(element, name);\n            }\n        }\n    }\n    get attributeName() {\n        return `data-${this.context.identifier}-target`;\n    }\n    get element() {\n        return this.context.element;\n    }\n    get scope() {\n        return this.context.scope;\n    }\n}\n\nfunction readInheritableStaticArrayValues(constructor, propertyName) {\n    const ancestors = getAncestorsForConstructor(constructor);\n    return Array.from(ancestors.reduce((values, constructor) => {\n        getOwnStaticArrayValues(constructor, propertyName).forEach((name) => values.add(name));\n        return values;\n    }, new Set()));\n}\nfunction readInheritableStaticObjectPairs(constructor, propertyName) {\n    const ancestors = getAncestorsForConstructor(constructor);\n    return ancestors.reduce((pairs, constructor) => {\n        pairs.push(...getOwnStaticObjectPairs(constructor, propertyName));\n        return pairs;\n    }, []);\n}\nfunction getAncestorsForConstructor(constructor) {\n    const ancestors = [];\n    while (constructor) {\n        ancestors.push(constructor);\n        constructor = Object.getPrototypeOf(constructor);\n    }\n    return ancestors.reverse();\n}\nfunction getOwnStaticArrayValues(constructor, propertyName) {\n    const definition = constructor[propertyName];\n    return Array.isArray(definition) ? definition : [];\n}\nfunction getOwnStaticObjectPairs(constructor, propertyName) {\n    const definition = constructor[propertyName];\n    return definition ? Object.keys(definition).map((key) => [key, definition[key]]) : [];\n}\n\nclass OutletObserver {\n    constructor(context, delegate) {\n        this.started = false;\n        this.context = context;\n        this.delegate = delegate;\n        this.outletsByName = new Multimap();\n        this.outletElementsByName = new Multimap();\n        this.selectorObserverMap = new Map();\n        this.attributeObserverMap = new Map();\n    }\n    start() {\n        if (!this.started) {\n            this.outletDefinitions.forEach((outletName) => {\n                this.setupSelectorObserverForOutlet(outletName);\n                this.setupAttributeObserverForOutlet(outletName);\n            });\n            this.started = true;\n            this.dependentContexts.forEach((context) => context.refresh());\n        }\n    }\n    refresh() {\n        this.selectorObserverMap.forEach((observer) => observer.refresh());\n        this.attributeObserverMap.forEach((observer) => observer.refresh());\n    }\n    stop() {\n        if (this.started) {\n            this.started = false;\n            this.disconnectAllOutlets();\n            this.stopSelectorObservers();\n            this.stopAttributeObservers();\n        }\n    }\n    stopSelectorObservers() {\n        if (this.selectorObserverMap.size > 0) {\n            this.selectorObserverMap.forEach((observer) => observer.stop());\n            this.selectorObserverMap.clear();\n        }\n    }\n    stopAttributeObservers() {\n        if (this.attributeObserverMap.size > 0) {\n            this.attributeObserverMap.forEach((observer) => observer.stop());\n            this.attributeObserverMap.clear();\n        }\n    }\n    selectorMatched(element, _selector, { outletName }) {\n        const outlet = this.getOutlet(element, outletName);\n        if (outlet) {\n            this.connectOutlet(outlet, element, outletName);\n        }\n    }\n    selectorUnmatched(element, _selector, { outletName }) {\n        const outlet = this.getOutletFromMap(element, outletName);\n        if (outlet) {\n            this.disconnectOutlet(outlet, element, outletName);\n        }\n    }\n    selectorMatchElement(element, { outletName }) {\n        const selector = this.selector(outletName);\n        const hasOutlet = this.hasOutlet(element, outletName);\n        const hasOutletController = element.matches(`[${this.schema.controllerAttribute}~=${outletName}]`);\n        if (selector) {\n            return hasOutlet && hasOutletController && element.matches(selector);\n        }\n        else {\n            return false;\n        }\n    }\n    elementMatchedAttribute(_element, attributeName) {\n        const outletName = this.getOutletNameFromOutletAttributeName(attributeName);\n        if (outletName) {\n            this.updateSelectorObserverForOutlet(outletName);\n        }\n    }\n    elementAttributeValueChanged(_element, attributeName) {\n        const outletName = this.getOutletNameFromOutletAttributeName(attributeName);\n        if (outletName) {\n            this.updateSelectorObserverForOutlet(outletName);\n        }\n    }\n    elementUnmatchedAttribute(_element, attributeName) {\n        const outletName = this.getOutletNameFromOutletAttributeName(attributeName);\n        if (outletName) {\n            this.updateSelectorObserverForOutlet(outletName);\n        }\n    }\n    connectOutlet(outlet, element, outletName) {\n        var _a;\n        if (!this.outletElementsByName.has(outletName, element)) {\n            this.outletsByName.add(outletName, outlet);\n            this.outletElementsByName.add(outletName, element);\n            (_a = this.selectorObserverMap.get(outletName)) === null || _a === void 0 ? void 0 : _a.pause(() => this.delegate.outletConnected(outlet, element, outletName));\n        }\n    }\n    disconnectOutlet(outlet, element, outletName) {\n        var _a;\n        if (this.outletElementsByName.has(outletName, element)) {\n            this.outletsByName.delete(outletName, outlet);\n            this.outletElementsByName.delete(outletName, element);\n            (_a = this.selectorObserverMap\n                .get(outletName)) === null || _a === void 0 ? void 0 : _a.pause(() => this.delegate.outletDisconnected(outlet, element, outletName));\n        }\n    }\n    disconnectAllOutlets() {\n        for (const outletName of this.outletElementsByName.keys) {\n            for (const element of this.outletElementsByName.getValuesForKey(outletName)) {\n                for (const outlet of this.outletsByName.getValuesForKey(outletName)) {\n                    this.disconnectOutlet(outlet, element, outletName);\n                }\n            }\n        }\n    }\n    updateSelectorObserverForOutlet(outletName) {\n        const observer = this.selectorObserverMap.get(outletName);\n        if (observer) {\n            observer.selector = this.selector(outletName);\n        }\n    }\n    setupSelectorObserverForOutlet(outletName) {\n        const selector = this.selector(outletName);\n        const selectorObserver = new SelectorObserver(document.body, selector, this, { outletName });\n        this.selectorObserverMap.set(outletName, selectorObserver);\n        selectorObserver.start();\n    }\n    setupAttributeObserverForOutlet(outletName) {\n        const attributeName = this.attributeNameForOutletName(outletName);\n        const attributeObserver = new AttributeObserver(this.scope.element, attributeName, this);\n        this.attributeObserverMap.set(outletName, attributeObserver);\n        attributeObserver.start();\n    }\n    selector(outletName) {\n        return this.scope.outlets.getSelectorForOutletName(outletName);\n    }\n    attributeNameForOutletName(outletName) {\n        return this.scope.schema.outletAttributeForScope(this.identifier, outletName);\n    }\n    getOutletNameFromOutletAttributeName(attributeName) {\n        return this.outletDefinitions.find((outletName) => this.attributeNameForOutletName(outletName) === attributeName);\n    }\n    get outletDependencies() {\n        const dependencies = new Multimap();\n        this.router.modules.forEach((module) => {\n            const constructor = module.definition.controllerConstructor;\n            const outlets = readInheritableStaticArrayValues(constructor, \"outlets\");\n            outlets.forEach((outlet) => dependencies.add(outlet, module.identifier));\n        });\n        return dependencies;\n    }\n    get outletDefinitions() {\n        return this.outletDependencies.getKeysForValue(this.identifier);\n    }\n    get dependentControllerIdentifiers() {\n        return this.outletDependencies.getValuesForKey(this.identifier);\n    }\n    get dependentContexts() {\n        const identifiers = this.dependentControllerIdentifiers;\n        return this.router.contexts.filter((context) => identifiers.includes(context.identifier));\n    }\n    hasOutlet(element, outletName) {\n        return !!this.getOutlet(element, outletName) || !!this.getOutletFromMap(element, outletName);\n    }\n    getOutlet(element, outletName) {\n        return this.application.getControllerForElementAndIdentifier(element, outletName);\n    }\n    getOutletFromMap(element, outletName) {\n        return this.outletsByName.getValuesForKey(outletName).find((outlet) => outlet.element === element);\n    }\n    get scope() {\n        return this.context.scope;\n    }\n    get schema() {\n        return this.context.schema;\n    }\n    get identifier() {\n        return this.context.identifier;\n    }\n    get application() {\n        return this.context.application;\n    }\n    get router() {\n        return this.application.router;\n    }\n}\n\nclass Context {\n    constructor(module, scope) {\n        this.logDebugActivity = (functionName, detail = {}) => {\n            const { identifier, controller, element } = this;\n            detail = Object.assign({ identifier, controller, element }, detail);\n            this.application.logDebugActivity(this.identifier, functionName, detail);\n        };\n        this.module = module;\n        this.scope = scope;\n        this.controller = new module.controllerConstructor(this);\n        this.bindingObserver = new BindingObserver(this, this.dispatcher);\n        this.valueObserver = new ValueObserver(this, this.controller);\n        this.targetObserver = new TargetObserver(this, this);\n        this.outletObserver = new OutletObserver(this, this);\n        try {\n            this.controller.initialize();\n            this.logDebugActivity(\"initialize\");\n        }\n        catch (error) {\n            this.handleError(error, \"initializing controller\");\n        }\n    }\n    connect() {\n        this.bindingObserver.start();\n        this.valueObserver.start();\n        this.targetObserver.start();\n        this.outletObserver.start();\n        try {\n            this.controller.connect();\n            this.logDebugActivity(\"connect\");\n        }\n        catch (error) {\n            this.handleError(error, \"connecting controller\");\n        }\n    }\n    refresh() {\n        this.outletObserver.refresh();\n    }\n    disconnect() {\n        try {\n            this.controller.disconnect();\n            this.logDebugActivity(\"disconnect\");\n        }\n        catch (error) {\n            this.handleError(error, \"disconnecting controller\");\n        }\n        this.outletObserver.stop();\n        this.targetObserver.stop();\n        this.valueObserver.stop();\n        this.bindingObserver.stop();\n    }\n    get application() {\n        return this.module.application;\n    }\n    get identifier() {\n        return this.module.identifier;\n    }\n    get schema() {\n        return this.application.schema;\n    }\n    get dispatcher() {\n        return this.application.dispatcher;\n    }\n    get element() {\n        return this.scope.element;\n    }\n    get parentElement() {\n        return this.element.parentElement;\n    }\n    handleError(error, message, detail = {}) {\n        const { identifier, controller, element } = this;\n        detail = Object.assign({ identifier, controller, element }, detail);\n        this.application.handleError(error, `Error ${message}`, detail);\n    }\n    targetConnected(element, name) {\n        this.invokeControllerMethod(`${name}TargetConnected`, element);\n    }\n    targetDisconnected(element, name) {\n        this.invokeControllerMethod(`${name}TargetDisconnected`, element);\n    }\n    outletConnected(outlet, element, name) {\n        this.invokeControllerMethod(`${namespaceCamelize(name)}OutletConnected`, outlet, element);\n    }\n    outletDisconnected(outlet, element, name) {\n        this.invokeControllerMethod(`${namespaceCamelize(name)}OutletDisconnected`, outlet, element);\n    }\n    invokeControllerMethod(methodName, ...args) {\n        const controller = this.controller;\n        if (typeof controller[methodName] == \"function\") {\n            controller[methodName](...args);\n        }\n    }\n}\n\nfunction bless(constructor) {\n    return shadow(constructor, getBlessedProperties(constructor));\n}\nfunction shadow(constructor, properties) {\n    const shadowConstructor = extend(constructor);\n    const shadowProperties = getShadowProperties(constructor.prototype, properties);\n    Object.defineProperties(shadowConstructor.prototype, shadowProperties);\n    return shadowConstructor;\n}\nfunction getBlessedProperties(constructor) {\n    const blessings = readInheritableStaticArrayValues(constructor, \"blessings\");\n    return blessings.reduce((blessedProperties, blessing) => {\n        const properties = blessing(constructor);\n        for (const key in properties) {\n            const descriptor = blessedProperties[key] || {};\n            blessedProperties[key] = Object.assign(descriptor, properties[key]);\n        }\n        return blessedProperties;\n    }, {});\n}\nfunction getShadowProperties(prototype, properties) {\n    return getOwnKeys(properties).reduce((shadowProperties, key) => {\n        const descriptor = getShadowedDescriptor(prototype, properties, key);\n        if (descriptor) {\n            Object.assign(shadowProperties, { [key]: descriptor });\n        }\n        return shadowProperties;\n    }, {});\n}\nfunction getShadowedDescriptor(prototype, properties, key) {\n    const shadowingDescriptor = Object.getOwnPropertyDescriptor(prototype, key);\n    const shadowedByValue = shadowingDescriptor && \"value\" in shadowingDescriptor;\n    if (!shadowedByValue) {\n        const descriptor = Object.getOwnPropertyDescriptor(properties, key).value;\n        if (shadowingDescriptor) {\n            descriptor.get = shadowingDescriptor.get || descriptor.get;\n            descriptor.set = shadowingDescriptor.set || descriptor.set;\n        }\n        return descriptor;\n    }\n}\nconst getOwnKeys = (() => {\n    if (typeof Object.getOwnPropertySymbols == \"function\") {\n        return (object) => [...Object.getOwnPropertyNames(object), ...Object.getOwnPropertySymbols(object)];\n    }\n    else {\n        return Object.getOwnPropertyNames;\n    }\n})();\nconst extend = (() => {\n    function extendWithReflect(constructor) {\n        function extended() {\n            return Reflect.construct(constructor, arguments, new.target);\n        }\n        extended.prototype = Object.create(constructor.prototype, {\n            constructor: { value: extended },\n        });\n        Reflect.setPrototypeOf(extended, constructor);\n        return extended;\n    }\n    function testReflectExtension() {\n        const a = function () {\n            this.a.call(this);\n        };\n        const b = extendWithReflect(a);\n        b.prototype.a = function () { };\n        return new b();\n    }\n    try {\n        testReflectExtension();\n        return extendWithReflect;\n    }\n    catch (error) {\n        return (constructor) => class extended extends constructor {\n        };\n    }\n})();\n\nfunction blessDefinition(definition) {\n    return {\n        identifier: definition.identifier,\n        controllerConstructor: bless(definition.controllerConstructor),\n    };\n}\n\nclass Module {\n    constructor(application, definition) {\n        this.application = application;\n        this.definition = blessDefinition(definition);\n        this.contextsByScope = new WeakMap();\n        this.connectedContexts = new Set();\n    }\n    get identifier() {\n        return this.definition.identifier;\n    }\n    get controllerConstructor() {\n        return this.definition.controllerConstructor;\n    }\n    get contexts() {\n        return Array.from(this.connectedContexts);\n    }\n    connectContextForScope(scope) {\n        const context = this.fetchContextForScope(scope);\n        this.connectedContexts.add(context);\n        context.connect();\n    }\n    disconnectContextForScope(scope) {\n        const context = this.contextsByScope.get(scope);\n        if (context) {\n            this.connectedContexts.delete(context);\n            context.disconnect();\n        }\n    }\n    fetchContextForScope(scope) {\n        let context = this.contextsByScope.get(scope);\n        if (!context) {\n            context = new Context(this, scope);\n            this.contextsByScope.set(scope, context);\n        }\n        return context;\n    }\n}\n\nclass ClassMap {\n    constructor(scope) {\n        this.scope = scope;\n    }\n    has(name) {\n        return this.data.has(this.getDataKey(name));\n    }\n    get(name) {\n        return this.getAll(name)[0];\n    }\n    getAll(name) {\n        const tokenString = this.data.get(this.getDataKey(name)) || \"\";\n        return tokenize(tokenString);\n    }\n    getAttributeName(name) {\n        return this.data.getAttributeNameForKey(this.getDataKey(name));\n    }\n    getDataKey(name) {\n        return `${name}-class`;\n    }\n    get data() {\n        return this.scope.data;\n    }\n}\n\nclass DataMap {\n    constructor(scope) {\n        this.scope = scope;\n    }\n    get element() {\n        return this.scope.element;\n    }\n    get identifier() {\n        return this.scope.identifier;\n    }\n    get(key) {\n        const name = this.getAttributeNameForKey(key);\n        return this.element.getAttribute(name);\n    }\n    set(key, value) {\n        const name = this.getAttributeNameForKey(key);\n        this.element.setAttribute(name, value);\n        return this.get(key);\n    }\n    has(key) {\n        const name = this.getAttributeNameForKey(key);\n        return this.element.hasAttribute(name);\n    }\n    delete(key) {\n        if (this.has(key)) {\n            const name = this.getAttributeNameForKey(key);\n            this.element.removeAttribute(name);\n            return true;\n        }\n        else {\n            return false;\n        }\n    }\n    getAttributeNameForKey(key) {\n        return `data-${this.identifier}-${dasherize(key)}`;\n    }\n}\n\nclass Guide {\n    constructor(logger) {\n        this.warnedKeysByObject = new WeakMap();\n        this.logger = logger;\n    }\n    warn(object, key, message) {\n        let warnedKeys = this.warnedKeysByObject.get(object);\n        if (!warnedKeys) {\n            warnedKeys = new Set();\n            this.warnedKeysByObject.set(object, warnedKeys);\n        }\n        if (!warnedKeys.has(key)) {\n            warnedKeys.add(key);\n            this.logger.warn(message, object);\n        }\n    }\n}\n\nfunction attributeValueContainsToken(attributeName, token) {\n    return `[${attributeName}~=\"${token}\"]`;\n}\n\nclass TargetSet {\n    constructor(scope) {\n        this.scope = scope;\n    }\n    get element() {\n        return this.scope.element;\n    }\n    get identifier() {\n        return this.scope.identifier;\n    }\n    get schema() {\n        return this.scope.schema;\n    }\n    has(targetName) {\n        return this.find(targetName) != null;\n    }\n    find(...targetNames) {\n        return targetNames.reduce((target, targetName) => target || this.findTarget(targetName) || this.findLegacyTarget(targetName), undefined);\n    }\n    findAll(...targetNames) {\n        return targetNames.reduce((targets, targetName) => [\n            ...targets,\n            ...this.findAllTargets(targetName),\n            ...this.findAllLegacyTargets(targetName),\n        ], []);\n    }\n    findTarget(targetName) {\n        const selector = this.getSelectorForTargetName(targetName);\n        return this.scope.findElement(selector);\n    }\n    findAllTargets(targetName) {\n        const selector = this.getSelectorForTargetName(targetName);\n        return this.scope.findAllElements(selector);\n    }\n    getSelectorForTargetName(targetName) {\n        const attributeName = this.schema.targetAttributeForScope(this.identifier);\n        return attributeValueContainsToken(attributeName, targetName);\n    }\n    findLegacyTarget(targetName) {\n        const selector = this.getLegacySelectorForTargetName(targetName);\n        return this.deprecate(this.scope.findElement(selector), targetName);\n    }\n    findAllLegacyTargets(targetName) {\n        const selector = this.getLegacySelectorForTargetName(targetName);\n        return this.scope.findAllElements(selector).map((element) => this.deprecate(element, targetName));\n    }\n    getLegacySelectorForTargetName(targetName) {\n        const targetDescriptor = `${this.identifier}.${targetName}`;\n        return attributeValueContainsToken(this.schema.targetAttribute, targetDescriptor);\n    }\n    deprecate(element, targetName) {\n        if (element) {\n            const { identifier } = this;\n            const attributeName = this.schema.targetAttribute;\n            const revisedAttributeName = this.schema.targetAttributeForScope(identifier);\n            this.guide.warn(element, `target:${targetName}`, `Please replace ${attributeName}=\"${identifier}.${targetName}\" with ${revisedAttributeName}=\"${targetName}\". ` +\n                `The ${attributeName} attribute is deprecated and will be removed in a future version of Stimulus.`);\n        }\n        return element;\n    }\n    get guide() {\n        return this.scope.guide;\n    }\n}\n\nclass OutletSet {\n    constructor(scope, controllerElement) {\n        this.scope = scope;\n        this.controllerElement = controllerElement;\n    }\n    get element() {\n        return this.scope.element;\n    }\n    get identifier() {\n        return this.scope.identifier;\n    }\n    get schema() {\n        return this.scope.schema;\n    }\n    has(outletName) {\n        return this.find(outletName) != null;\n    }\n    find(...outletNames) {\n        return outletNames.reduce((outlet, outletName) => outlet || this.findOutlet(outletName), undefined);\n    }\n    findAll(...outletNames) {\n        return outletNames.reduce((outlets, outletName) => [...outlets, ...this.findAllOutlets(outletName)], []);\n    }\n    getSelectorForOutletName(outletName) {\n        const attributeName = this.schema.outletAttributeForScope(this.identifier, outletName);\n        return this.controllerElement.getAttribute(attributeName);\n    }\n    findOutlet(outletName) {\n        const selector = this.getSelectorForOutletName(outletName);\n        if (selector)\n            return this.findElement(selector, outletName);\n    }\n    findAllOutlets(outletName) {\n        const selector = this.getSelectorForOutletName(outletName);\n        return selector ? this.findAllElements(selector, outletName) : [];\n    }\n    findElement(selector, outletName) {\n        const elements = this.scope.queryElements(selector);\n        return elements.filter((element) => this.matchesElement(element, selector, outletName))[0];\n    }\n    findAllElements(selector, outletName) {\n        const elements = this.scope.queryElements(selector);\n        return elements.filter((element) => this.matchesElement(element, selector, outletName));\n    }\n    matchesElement(element, selector, outletName) {\n        const controllerAttribute = element.getAttribute(this.scope.schema.controllerAttribute) || \"\";\n        return element.matches(selector) && controllerAttribute.split(\" \").includes(outletName);\n    }\n}\n\nclass Scope {\n    constructor(schema, element, identifier, logger) {\n        this.targets = new TargetSet(this);\n        this.classes = new ClassMap(this);\n        this.data = new DataMap(this);\n        this.containsElement = (element) => {\n            return element.closest(this.controllerSelector) === this.element;\n        };\n        this.schema = schema;\n        this.element = element;\n        this.identifier = identifier;\n        this.guide = new Guide(logger);\n        this.outlets = new OutletSet(this.documentScope, element);\n    }\n    findElement(selector) {\n        return this.element.matches(selector) ? this.element : this.queryElements(selector).find(this.containsElement);\n    }\n    findAllElements(selector) {\n        return [\n            ...(this.element.matches(selector) ? [this.element] : []),\n            ...this.queryElements(selector).filter(this.containsElement),\n        ];\n    }\n    queryElements(selector) {\n        return Array.from(this.element.querySelectorAll(selector));\n    }\n    get controllerSelector() {\n        return attributeValueContainsToken(this.schema.controllerAttribute, this.identifier);\n    }\n    get isDocumentScope() {\n        return this.element === document.documentElement;\n    }\n    get documentScope() {\n        return this.isDocumentScope\n            ? this\n            : new Scope(this.schema, document.documentElement, this.identifier, this.guide.logger);\n    }\n}\n\nclass ScopeObserver {\n    constructor(element, schema, delegate) {\n        this.element = element;\n        this.schema = schema;\n        this.delegate = delegate;\n        this.valueListObserver = new ValueListObserver(this.element, this.controllerAttribute, this);\n        this.scopesByIdentifierByElement = new WeakMap();\n        this.scopeReferenceCounts = new WeakMap();\n    }\n    start() {\n        this.valueListObserver.start();\n    }\n    stop() {\n        this.valueListObserver.stop();\n    }\n    get controllerAttribute() {\n        return this.schema.controllerAttribute;\n    }\n    parseValueForToken(token) {\n        const { element, content: identifier } = token;\n        return this.parseValueForElementAndIdentifier(element, identifier);\n    }\n    parseValueForElementAndIdentifier(element, identifier) {\n        const scopesByIdentifier = this.fetchScopesByIdentifierForElement(element);\n        let scope = scopesByIdentifier.get(identifier);\n        if (!scope) {\n            scope = this.delegate.createScopeForElementAndIdentifier(element, identifier);\n            scopesByIdentifier.set(identifier, scope);\n        }\n        return scope;\n    }\n    elementMatchedValue(element, value) {\n        const referenceCount = (this.scopeReferenceCounts.get(value) || 0) + 1;\n        this.scopeReferenceCounts.set(value, referenceCount);\n        if (referenceCount == 1) {\n            this.delegate.scopeConnected(value);\n        }\n    }\n    elementUnmatchedValue(element, value) {\n        const referenceCount = this.scopeReferenceCounts.get(value);\n        if (referenceCount) {\n            this.scopeReferenceCounts.set(value, referenceCount - 1);\n            if (referenceCount == 1) {\n                this.delegate.scopeDisconnected(value);\n            }\n        }\n    }\n    fetchScopesByIdentifierForElement(element) {\n        let scopesByIdentifier = this.scopesByIdentifierByElement.get(element);\n        if (!scopesByIdentifier) {\n            scopesByIdentifier = new Map();\n            this.scopesByIdentifierByElement.set(element, scopesByIdentifier);\n        }\n        return scopesByIdentifier;\n    }\n}\n\nclass Router {\n    constructor(application) {\n        this.application = application;\n        this.scopeObserver = new ScopeObserver(this.element, this.schema, this);\n        this.scopesByIdentifier = new Multimap();\n        this.modulesByIdentifier = new Map();\n    }\n    get element() {\n        return this.application.element;\n    }\n    get schema() {\n        return this.application.schema;\n    }\n    get logger() {\n        return this.application.logger;\n    }\n    get controllerAttribute() {\n        return this.schema.controllerAttribute;\n    }\n    get modules() {\n        return Array.from(this.modulesByIdentifier.values());\n    }\n    get contexts() {\n        return this.modules.reduce((contexts, module) => contexts.concat(module.contexts), []);\n    }\n    start() {\n        this.scopeObserver.start();\n    }\n    stop() {\n        this.scopeObserver.stop();\n    }\n    loadDefinition(definition) {\n        this.unloadIdentifier(definition.identifier);\n        const module = new Module(this.application, definition);\n        this.connectModule(module);\n        const afterLoad = definition.controllerConstructor.afterLoad;\n        if (afterLoad) {\n            afterLoad.call(definition.controllerConstructor, definition.identifier, this.application);\n        }\n    }\n    unloadIdentifier(identifier) {\n        const module = this.modulesByIdentifier.get(identifier);\n        if (module) {\n            this.disconnectModule(module);\n        }\n    }\n    getContextForElementAndIdentifier(element, identifier) {\n        const module = this.modulesByIdentifier.get(identifier);\n        if (module) {\n            return module.contexts.find((context) => context.element == element);\n        }\n    }\n    proposeToConnectScopeForElementAndIdentifier(element, identifier) {\n        const scope = this.scopeObserver.parseValueForElementAndIdentifier(element, identifier);\n        if (scope) {\n            this.scopeObserver.elementMatchedValue(scope.element, scope);\n        }\n        else {\n            console.error(`Couldn't find or create scope for identifier: \"${identifier}\" and element:`, element);\n        }\n    }\n    handleError(error, message, detail) {\n        this.application.handleError(error, message, detail);\n    }\n    createScopeForElementAndIdentifier(element, identifier) {\n        return new Scope(this.schema, element, identifier, this.logger);\n    }\n    scopeConnected(scope) {\n        this.scopesByIdentifier.add(scope.identifier, scope);\n        const module = this.modulesByIdentifier.get(scope.identifier);\n        if (module) {\n            module.connectContextForScope(scope);\n        }\n    }\n    scopeDisconnected(scope) {\n        this.scopesByIdentifier.delete(scope.identifier, scope);\n        const module = this.modulesByIdentifier.get(scope.identifier);\n        if (module) {\n            module.disconnectContextForScope(scope);\n        }\n    }\n    connectModule(module) {\n        this.modulesByIdentifier.set(module.identifier, module);\n        const scopes = this.scopesByIdentifier.getValuesForKey(module.identifier);\n        scopes.forEach((scope) => module.connectContextForScope(scope));\n    }\n    disconnectModule(module) {\n        this.modulesByIdentifier.delete(module.identifier);\n        const scopes = this.scopesByIdentifier.getValuesForKey(module.identifier);\n        scopes.forEach((scope) => module.disconnectContextForScope(scope));\n    }\n}\n\nconst defaultSchema = {\n    controllerAttribute: \"data-controller\",\n    actionAttribute: \"data-action\",\n    targetAttribute: \"data-target\",\n    targetAttributeForScope: (identifier) => `data-${identifier}-target`,\n    outletAttributeForScope: (identifier, outlet) => `data-${identifier}-${outlet}-outlet`,\n    keyMappings: Object.assign(Object.assign({ enter: \"Enter\", tab: \"Tab\", esc: \"Escape\", space: \" \", up: \"ArrowUp\", down: \"ArrowDown\", left: \"ArrowLeft\", right: \"ArrowRight\", home: \"Home\", end: \"End\", page_up: \"PageUp\", page_down: \"PageDown\" }, objectFromEntries(\"abcdefghijklmnopqrstuvwxyz\".split(\"\").map((c) => [c, c]))), objectFromEntries(\"0123456789\".split(\"\").map((n) => [n, n]))),\n};\nfunction objectFromEntries(array) {\n    return array.reduce((memo, [k, v]) => (Object.assign(Object.assign({}, memo), { [k]: v })), {});\n}\n\nclass Application {\n    constructor(element = document.documentElement, schema = defaultSchema) {\n        this.logger = console;\n        this.debug = false;\n        this.logDebugActivity = (identifier, functionName, detail = {}) => {\n            if (this.debug) {\n                this.logFormattedMessage(identifier, functionName, detail);\n            }\n        };\n        this.element = element;\n        this.schema = schema;\n        this.dispatcher = new Dispatcher(this);\n        this.router = new Router(this);\n        this.actionDescriptorFilters = Object.assign({}, defaultActionDescriptorFilters);\n    }\n    static start(element, schema) {\n        const application = new this(element, schema);\n        application.start();\n        return application;\n    }\n    async start() {\n        await domReady();\n        this.logDebugActivity(\"application\", \"starting\");\n        this.dispatcher.start();\n        this.router.start();\n        this.logDebugActivity(\"application\", \"start\");\n    }\n    stop() {\n        this.logDebugActivity(\"application\", \"stopping\");\n        this.dispatcher.stop();\n        this.router.stop();\n        this.logDebugActivity(\"application\", \"stop\");\n    }\n    register(identifier, controllerConstructor) {\n        this.load({ identifier, controllerConstructor });\n    }\n    registerActionOption(name, filter) {\n        this.actionDescriptorFilters[name] = filter;\n    }\n    load(head, ...rest) {\n        const definitions = Array.isArray(head) ? head : [head, ...rest];\n        definitions.forEach((definition) => {\n            if (definition.controllerConstructor.shouldLoad) {\n                this.router.loadDefinition(definition);\n            }\n        });\n    }\n    unload(head, ...rest) {\n        const identifiers = Array.isArray(head) ? head : [head, ...rest];\n        identifiers.forEach((identifier) => this.router.unloadIdentifier(identifier));\n    }\n    get controllers() {\n        return this.router.contexts.map((context) => context.controller);\n    }\n    getControllerForElementAndIdentifier(element, identifier) {\n        const context = this.router.getContextForElementAndIdentifier(element, identifier);\n        return context ? context.controller : null;\n    }\n    handleError(error, message, detail) {\n        var _a;\n        this.logger.error(`%s\\n\\n%o\\n\\n%o`, message, error, detail);\n        (_a = window.onerror) === null || _a === void 0 ? void 0 : _a.call(window, message, \"\", 0, 0, error);\n    }\n    logFormattedMessage(identifier, functionName, detail = {}) {\n        detail = Object.assign({ application: this }, detail);\n        this.logger.groupCollapsed(`${identifier} #${functionName}`);\n        this.logger.log(\"details:\", Object.assign({}, detail));\n        this.logger.groupEnd();\n    }\n}\nfunction domReady() {\n    return new Promise((resolve) => {\n        if (document.readyState == \"loading\") {\n            document.addEventListener(\"DOMContentLoaded\", () => resolve());\n        }\n        else {\n            resolve();\n        }\n    });\n}\n\nfunction ClassPropertiesBlessing(constructor) {\n    const classes = readInheritableStaticArrayValues(constructor, \"classes\");\n    return classes.reduce((properties, classDefinition) => {\n        return Object.assign(properties, propertiesForClassDefinition(classDefinition));\n    }, {});\n}\nfunction propertiesForClassDefinition(key) {\n    return {\n        [`${key}Class`]: {\n            get() {\n                const { classes } = this;\n                if (classes.has(key)) {\n                    return classes.get(key);\n                }\n                else {\n                    const attribute = classes.getAttributeName(key);\n                    throw new Error(`Missing attribute \"${attribute}\"`);\n                }\n            },\n        },\n        [`${key}Classes`]: {\n            get() {\n                return this.classes.getAll(key);\n            },\n        },\n        [`has${capitalize(key)}Class`]: {\n            get() {\n                return this.classes.has(key);\n            },\n        },\n    };\n}\n\nfunction OutletPropertiesBlessing(constructor) {\n    const outlets = readInheritableStaticArrayValues(constructor, \"outlets\");\n    return outlets.reduce((properties, outletDefinition) => {\n        return Object.assign(properties, propertiesForOutletDefinition(outletDefinition));\n    }, {});\n}\nfunction getOutletController(controller, element, identifier) {\n    return controller.application.getControllerForElementAndIdentifier(element, identifier);\n}\nfunction getControllerAndEnsureConnectedScope(controller, element, outletName) {\n    let outletController = getOutletController(controller, element, outletName);\n    if (outletController)\n        return outletController;\n    controller.application.router.proposeToConnectScopeForElementAndIdentifier(element, outletName);\n    outletController = getOutletController(controller, element, outletName);\n    if (outletController)\n        return outletController;\n}\nfunction propertiesForOutletDefinition(name) {\n    const camelizedName = namespaceCamelize(name);\n    return {\n        [`${camelizedName}Outlet`]: {\n            get() {\n                const outletElement = this.outlets.find(name);\n                const selector = this.outlets.getSelectorForOutletName(name);\n                if (outletElement) {\n                    const outletController = getControllerAndEnsureConnectedScope(this, outletElement, name);\n                    if (outletController)\n                        return outletController;\n                    throw new Error(`The provided outlet element is missing an outlet controller \"${name}\" instance for host controller \"${this.identifier}\"`);\n                }\n                throw new Error(`Missing outlet element \"${name}\" for host controller \"${this.identifier}\". Stimulus couldn't find a matching outlet element using selector \"${selector}\".`);\n            },\n        },\n        [`${camelizedName}Outlets`]: {\n            get() {\n                const outlets = this.outlets.findAll(name);\n                if (outlets.length > 0) {\n                    return outlets\n                        .map((outletElement) => {\n                        const outletController = getControllerAndEnsureConnectedScope(this, outletElement, name);\n                        if (outletController)\n                            return outletController;\n                        console.warn(`The provided outlet element is missing an outlet controller \"${name}\" instance for host controller \"${this.identifier}\"`, outletElement);\n                    })\n                        .filter((controller) => controller);\n                }\n                return [];\n            },\n        },\n        [`${camelizedName}OutletElement`]: {\n            get() {\n                const outletElement = this.outlets.find(name);\n                const selector = this.outlets.getSelectorForOutletName(name);\n                if (outletElement) {\n                    return outletElement;\n                }\n                else {\n                    throw new Error(`Missing outlet element \"${name}\" for host controller \"${this.identifier}\". Stimulus couldn't find a matching outlet element using selector \"${selector}\".`);\n                }\n            },\n        },\n        [`${camelizedName}OutletElements`]: {\n            get() {\n                return this.outlets.findAll(name);\n            },\n        },\n        [`has${capitalize(camelizedName)}Outlet`]: {\n            get() {\n                return this.outlets.has(name);\n            },\n        },\n    };\n}\n\nfunction TargetPropertiesBlessing(constructor) {\n    const targets = readInheritableStaticArrayValues(constructor, \"targets\");\n    return targets.reduce((properties, targetDefinition) => {\n        return Object.assign(properties, propertiesForTargetDefinition(targetDefinition));\n    }, {});\n}\nfunction propertiesForTargetDefinition(name) {\n    return {\n        [`${name}Target`]: {\n            get() {\n                const target = this.targets.find(name);\n                if (target) {\n                    return target;\n                }\n                else {\n                    throw new Error(`Missing target element \"${name}\" for \"${this.identifier}\" controller`);\n                }\n            },\n        },\n        [`${name}Targets`]: {\n            get() {\n                return this.targets.findAll(name);\n            },\n        },\n        [`has${capitalize(name)}Target`]: {\n            get() {\n                return this.targets.has(name);\n            },\n        },\n    };\n}\n\nfunction ValuePropertiesBlessing(constructor) {\n    const valueDefinitionPairs = readInheritableStaticObjectPairs(constructor, \"values\");\n    const propertyDescriptorMap = {\n        valueDescriptorMap: {\n            get() {\n                return valueDefinitionPairs.reduce((result, valueDefinitionPair) => {\n                    const valueDescriptor = parseValueDefinitionPair(valueDefinitionPair, this.identifier);\n                    const attributeName = this.data.getAttributeNameForKey(valueDescriptor.key);\n                    return Object.assign(result, { [attributeName]: valueDescriptor });\n                }, {});\n            },\n        },\n    };\n    return valueDefinitionPairs.reduce((properties, valueDefinitionPair) => {\n        return Object.assign(properties, propertiesForValueDefinitionPair(valueDefinitionPair));\n    }, propertyDescriptorMap);\n}\nfunction propertiesForValueDefinitionPair(valueDefinitionPair, controller) {\n    const definition = parseValueDefinitionPair(valueDefinitionPair, controller);\n    const { key, name, reader: read, writer: write } = definition;\n    return {\n        [name]: {\n            get() {\n                const value = this.data.get(key);\n                if (value !== null) {\n                    return read(value);\n                }\n                else {\n                    return definition.defaultValue;\n                }\n            },\n            set(value) {\n                if (value === undefined) {\n                    this.data.delete(key);\n                }\n                else {\n                    this.data.set(key, write(value));\n                }\n            },\n        },\n        [`has${capitalize(name)}`]: {\n            get() {\n                return this.data.has(key) || definition.hasCustomDefaultValue;\n            },\n        },\n    };\n}\nfunction parseValueDefinitionPair([token, typeDefinition], controller) {\n    return valueDescriptorForTokenAndTypeDefinition({\n        controller,\n        token,\n        typeDefinition,\n    });\n}\nfunction parseValueTypeConstant(constant) {\n    switch (constant) {\n        case Array:\n            return \"array\";\n        case Boolean:\n            return \"boolean\";\n        case Number:\n            return \"number\";\n        case Object:\n            return \"object\";\n        case String:\n            return \"string\";\n    }\n}\nfunction parseValueTypeDefault(defaultValue) {\n    switch (typeof defaultValue) {\n        case \"boolean\":\n            return \"boolean\";\n        case \"number\":\n            return \"number\";\n        case \"string\":\n            return \"string\";\n    }\n    if (Array.isArray(defaultValue))\n        return \"array\";\n    if (Object.prototype.toString.call(defaultValue) === \"[object Object]\")\n        return \"object\";\n}\nfunction parseValueTypeObject(payload) {\n    const { controller, token, typeObject } = payload;\n    const hasType = isSomething(typeObject.type);\n    const hasDefault = isSomething(typeObject.default);\n    const fullObject = hasType && hasDefault;\n    const onlyType = hasType && !hasDefault;\n    const onlyDefault = !hasType && hasDefault;\n    const typeFromObject = parseValueTypeConstant(typeObject.type);\n    const typeFromDefaultValue = parseValueTypeDefault(payload.typeObject.default);\n    if (onlyType)\n        return typeFromObject;\n    if (onlyDefault)\n        return typeFromDefaultValue;\n    if (typeFromObject !== typeFromDefaultValue) {\n        const propertyPath = controller ? `${controller}.${token}` : token;\n        throw new Error(`The specified default value for the Stimulus Value \"${propertyPath}\" must match the defined type \"${typeFromObject}\". The provided default value of \"${typeObject.default}\" is of type \"${typeFromDefaultValue}\".`);\n    }\n    if (fullObject)\n        return typeFromObject;\n}\nfunction parseValueTypeDefinition(payload) {\n    const { controller, token, typeDefinition } = payload;\n    const typeObject = { controller, token, typeObject: typeDefinition };\n    const typeFromObject = parseValueTypeObject(typeObject);\n    const typeFromDefaultValue = parseValueTypeDefault(typeDefinition);\n    const typeFromConstant = parseValueTypeConstant(typeDefinition);\n    const type = typeFromObject || typeFromDefaultValue || typeFromConstant;\n    if (type)\n        return type;\n    const propertyPath = controller ? `${controller}.${typeDefinition}` : token;\n    throw new Error(`Unknown value type \"${propertyPath}\" for \"${token}\" value`);\n}\nfunction defaultValueForDefinition(typeDefinition) {\n    const constant = parseValueTypeConstant(typeDefinition);\n    if (constant)\n        return defaultValuesByType[constant];\n    const hasDefault = hasProperty(typeDefinition, \"default\");\n    const hasType = hasProperty(typeDefinition, \"type\");\n    const typeObject = typeDefinition;\n    if (hasDefault)\n        return typeObject.default;\n    if (hasType) {\n        const { type } = typeObject;\n        const constantFromType = parseValueTypeConstant(type);\n        if (constantFromType)\n            return defaultValuesByType[constantFromType];\n    }\n    return typeDefinition;\n}\nfunction valueDescriptorForTokenAndTypeDefinition(payload) {\n    const { token, typeDefinition } = payload;\n    const key = `${dasherize(token)}-value`;\n    const type = parseValueTypeDefinition(payload);\n    return {\n        type,\n        key,\n        name: camelize(key),\n        get defaultValue() {\n            return defaultValueForDefinition(typeDefinition);\n        },\n        get hasCustomDefaultValue() {\n            return parseValueTypeDefault(typeDefinition) !== undefined;\n        },\n        reader: readers[type],\n        writer: writers[type] || writers.default,\n    };\n}\nconst defaultValuesByType = {\n    get array() {\n        return [];\n    },\n    boolean: false,\n    number: 0,\n    get object() {\n        return {};\n    },\n    string: \"\",\n};\nconst readers = {\n    array(value) {\n        const array = JSON.parse(value);\n        if (!Array.isArray(array)) {\n            throw new TypeError(`expected value of type \"array\" but instead got value \"${value}\" of type \"${parseValueTypeDefault(array)}\"`);\n        }\n        return array;\n    },\n    boolean(value) {\n        return !(value == \"0\" || String(value).toLowerCase() == \"false\");\n    },\n    number(value) {\n        return Number(value.replace(/_/g, \"\"));\n    },\n    object(value) {\n        const object = JSON.parse(value);\n        if (object === null || typeof object != \"object\" || Array.isArray(object)) {\n            throw new TypeError(`expected value of type \"object\" but instead got value \"${value}\" of type \"${parseValueTypeDefault(object)}\"`);\n        }\n        return object;\n    },\n    string(value) {\n        return value;\n    },\n};\nconst writers = {\n    default: writeString,\n    array: writeJSON,\n    object: writeJSON,\n};\nfunction writeJSON(value) {\n    return JSON.stringify(value);\n}\nfunction writeString(value) {\n    return `${value}`;\n}\n\nclass Controller {\n    constructor(context) {\n        this.context = context;\n    }\n    static get shouldLoad() {\n        return true;\n    }\n    static afterLoad(_identifier, _application) {\n        return;\n    }\n    get application() {\n        return this.context.application;\n    }\n    get scope() {\n        return this.context.scope;\n    }\n    get element() {\n        return this.scope.element;\n    }\n    get identifier() {\n        return this.scope.identifier;\n    }\n    get targets() {\n        return this.scope.targets;\n    }\n    get outlets() {\n        return this.scope.outlets;\n    }\n    get classes() {\n        return this.scope.classes;\n    }\n    get data() {\n        return this.scope.data;\n    }\n    initialize() {\n    }\n    connect() {\n    }\n    disconnect() {\n    }\n    dispatch(eventName, { target = this.element, detail = {}, prefix = this.identifier, bubbles = true, cancelable = true, } = {}) {\n        const type = prefix ? `${prefix}:${eventName}` : eventName;\n        const event = new CustomEvent(type, { detail, bubbles, cancelable });\n        target.dispatchEvent(event);\n        return event;\n    }\n}\nController.blessings = [\n    ClassPropertiesBlessing,\n    TargetPropertiesBlessing,\n    ValuePropertiesBlessing,\n    OutletPropertiesBlessing,\n];\nController.targets = [];\nController.outlets = [];\nController.values = {};\n\nexport { Application, AttributeObserver, Context, Controller, ElementObserver, IndexedMultimap, Multimap, SelectorObserver, StringMapObserver, TokenListObserver, ValueListObserver, add, defaultSchema, del, fetch, prune };\n", "export default class IsoDate {\n\n  // new IsoDate()\n  // new IsoDate('')\n  //\n  // new IsoDate(date)\n  //\n  // new IsoDate(\"2022-05-16\")\n  //\n  // new IsoDate(\"2022\", \"05\", \"16\")\n  constructor(dateOrYear, month, day) {\n    if (dateOrYear && month && day) {\n      this.yyyy = dateOrYear.toString()\n      this.mm   = this.zeroPad(month)\n      this.dd   = this.zeroPad(day)\n    } else if (dateOrYear instanceof Date) {\n      this.yyyy = dateOrYear.getFullYear().toString()\n      this.mm   = this.zeroPad(dateOrYear.getMonth() + 1)\n      this.dd   = this.zeroPad(dateOrYear.getDate())\n    } else if (dateOrYear) {\n      [this.yyyy, this.mm, this.dd] = dateOrYear.split('-')\n    } else {\n      const today = new Date()\n      this.yyyy = today.getFullYear().toString()\n      this.mm   = this.zeroPad(today.getMonth() + 1)\n      this.dd   = this.zeroPad(today.getDate())\n    }\n  }\n\n  toString() {\n    return [this.yyyy, this.mm, this.dd].join('-')\n  }\n\n  setDayOfMonth(dayOfMonth) {\n    const date = this.toDate()\n    date.setDate(dayOfMonth)\n    return new IsoDate(date)\n  }\n\n  // @param [Number] first day of the week (Sunday is 0)\n  firstDayOfWeek(weekStart) {\n    const date = this.toDate()\n    date.setDate(date.getDate() - (7 + date.getDay() - weekStart) % 7)\n    return new IsoDate(date)\n  }\n\n  // @param [Number] first day of the week (Sunday is 0)\n  lastDayOfWeek(weekStart) {\n    const date = this.toDate()\n    date.setDate(date.getDate() + (weekStart + 6 - date.getDay()) % 7)\n    return new IsoDate(date)\n  }\n\n  previousYear() {\n    return this.increment('yyyy', -1)\n  }\n\n  nextYear() {\n    return this.increment('yyyy', 1)\n  }\n\n  // @param [Boolean] whether to return the same day in the previous month (true)\n  //    or the same day of the week in the previous month (false).\n  previousMonth(sameDayOfMonth = true) {\n    if (sameDayOfMonth) {\n      return this.increment('mm', -1)\n    } else {\n      const month = this.mm\n      let isoDate = this.increment('dd', -28)\n      if (isoDate.mm == month) isoDate = isoDate.increment('dd', -7)\n      return isoDate\n    }\n  }\n\n  // @param [Boolean] whether to return the same day in the next month (true)\n  //    or the same day of the week in the next month (false).\n  nextMonth(sameDayOfMonth = true) {\n    if (sameDayOfMonth) {\n      return this.increment('mm', 1)\n    } else {\n      const month = this.mm\n      let isoDate = this.increment('dd', 28)\n      if (isoDate.mm == month) isoDate = isoDate.increment('dd', 7)\n      return isoDate\n    }\n  }\n\n  previousWeek() {\n    return this.increment('dd', -7)\n  }\n\n  nextWeek() {\n    return this.increment('dd', 7)\n  }\n\n  previousDay() {\n    return this.increment('dd', -1)\n  }\n\n  nextDay() {\n    return this.increment('dd', 1)\n  }\n\n  isWeekend() {\n    return [0, 6].includes(this.toDate().getDay())\n  }\n\n  isToday() {\n    return this.equals(new IsoDate())\n  }\n\n  isFirstDayOfWeek(weekStart) {\n    return this.toDate().getDay() == weekStart\n  }\n\n  equals(isoDate) {\n    return this.toString() == isoDate.toString()\n  }\n\n  before(isoDate) {\n    return this.toString() < isoDate.toString()\n  }\n\n  after(isoDate) {\n    return this.toString() > isoDate.toString()\n  }\n\n  // @param unit [String] 'dd' | 'mm' | 'yyyy'\n  // @param count [Number]\n  increment(unit, count) {\n    let date\n    if (unit == 'dd') {\n      date = this.toDate()\n      date.setDate(date.getDate() + count)\n    } else {\n      date = unit == 'yyyy'\n           ? new Date(+this.yyyy + count, +this.mm - 1)\n           : new Date(+this.yyyy, +this.mm - 1 + count)\n      const endOfMonth = IsoDate.daysInMonth(date.getMonth() + 1, date.getYear())\n      date.setDate(+this.dd > endOfMonth ? endOfMonth : +this.dd)\n    }\n    return new IsoDate(date)\n  }\n\n  static isValidStr(str) {\n    if (!/^\\d{4}-\\d{2}-\\d{2}$/.test(str)) return false\n    return this.isValidDate(...str.split('-').map(s => +s))\n  }\n\n  // @param year [Number] four-digit year\n  // @param month [Number] month number (January is 1)\n  // @param day [Number] day in month\n  static isValidDate(year, month, day) {\n    if (year  < 1000 || year  > 9999) return false\n    if (month <    1 || month >   12) return false\n    if (day   <    1 || day   > this.daysInMonth(month, year)) return false\n    return true\n  }\n\n  // Returns the number of days in the month.\n  //\n  // @param month [Number] the month (1 is January)\n  // @param year [Number] the year (e.g. 2022)\n  // @return [Number] the number of days\n  static daysInMonth(month, year) {\n    if ([1, 3, 5, 7, 8, 10, 12].includes(month)) return 31\n    if ([4, 6, 9, 11].includes(month)) return 30\n    return this.isLeapYear(year) ? 29 : 28\n  }\n\n  static isLeapYear(year) {\n    if ((year % 400) == 0) return true\n    if ((year % 100) == 0) return false\n    return year % 4 == 0\n  }\n\n  // Returns a two-digit zero-padded string.\n  zeroPad(num) {\n    return num.toString().padStart(2, '0')\n  }\n\n  toDate() {\n    // Cannot use `new Date('YYYY-MM-DD')`: it is treated as UTC, not local.\n    return new Date(+this.yyyy, +this.mm - 1, +this.dd)\n  }\n}\n", "import { Controller } from '@hotwired/stimulus'\nimport IsoDate from './iso_date.js'\n\n// All dates are local, not UTC.\nexport default class Datepicker extends Controller {\n\n  static targets = ['input', 'hidden', 'toggle', 'calendar',\n    'month', 'year', 'prevMonth', 'today', 'nextMonth', 'days']\n\n  static values = {\n    date:           String,\n    min:            String,\n    max:            String,\n    format:         {type: String, default: '%Y-%m-%d'},\n    firstDayOfWeek: {type: Number, default: 1},\n    dayNameLength:  {type: Number, default: 2},\n    allowWeekends:  {type: Boolean, default: true},\n    monthJump:      {type: String, default: 'dayOfMonth'},\n    disallow:       Array,\n    text:           Object,\n    locales:        {type: Array, default: ['default']}\n  }\n\n  static defaultTextValue = {\n    underflow:     '',\n    overflow:      '',\n    previousMonth: 'Previous month',\n    nextMonth:     'Next month',\n    today:         'Today',\n    chooseDate:    'Choose Date',\n    changeDate:    'Change Date'\n  }\n\n  text(key) {\n    return {...this.constructor.defaultTextValue, ...this.textValue}[key]\n  }\n\n  connect() {\n    if (!this.hasHiddenTarget) this.addHiddenInput()\n    this.addInputAction()\n    this.addToggleAction()\n    this.setToggleAriaLabel()\n    this.dateValue = this.inputTarget.value\n  }\n\n  dateValueChanged(value, previousValue) {\n    if (!this.hasHiddenTarget) return\n    const dispatchChangeEvent = value != this.hiddenTarget.value;\n    this.hiddenTarget.value = value\n    this.inputTarget.value = this.format(value)\n    // Trigger change event on input when user selects date from picker.\n    // http://developer.mozilla.org/en-US/docs/Web/API/HTMLElement/change_event\n    if (dispatchChangeEvent) this.inputTarget.dispatchEvent(new Event('change'))\n    this.validate(value)\n  }\n\n  validate(dateStr) {\n    const message = this.validationMessage(dateStr)\n    this.inputTarget.setCustomValidity(message)\n    if (message) this.inputTarget.reportValidity()\n  }\n\n  validationMessage(dateStr) {\n    if (!dateStr) return ''\n    const isoDate = new IsoDate(dateStr)\n    return this.rangeUnderflow(isoDate) ? this.underflowMessage()\n         : this.rangeOverflow(isoDate)  ? this.overflowMessage()\n         : ''\n  }\n\n  underflowMessage() {\n    return this.text('underflow').replace('%s', this.format(this.minValue))\n  }\n\n  overflowMessage() {\n    return this.text('overflow').replace('%s', this.format(this.maxValue))\n  }\n\n  addHiddenInput() {\n    this.inputTarget.insertAdjacentHTML('afterend', `\n      <input type=\"hidden\"\n             name=\"${this.inputTarget.getAttribute('name')}\"\n             value=\"${this.inputTarget.value}\"\n             data-datepicker-target=\"hidden\"/>\n    `)\n  }\n\n  addInputAction() {\n    this.addAction(this.inputTarget, 'datepicker#update')\n  }\n\n  addToggleAction() {\n    if (!this.hasToggleTarget) return\n\n    let action = 'click->datepicker#toggle'\n    if (!(this.toggleTarget instanceof HTMLButtonElement)) action += ' keydown->datepicker#toggle'\n\n    this.addAction(this.toggleTarget, action)\n  }\n\n  addAction(element, action) {\n    if (('action') in element.dataset) {\n      element.dataset.action += ` ${action}`\n    } else {\n      element.dataset.action = action\n    }\n  }\n\n  setToggleAriaLabel(value = this.text('chooseDate')) {\n    if (!this.hasToggleTarget) return\n    this.toggleTarget.setAttribute('aria-label', value);\n  }\n\n  update() {\n    const dateStr = this.parse(this.inputTarget.value)\n    if (dateStr != '') this.dateValue = dateStr\n  }\n\n  toggle(event) {\n    event.preventDefault()\n    event.stopPropagation()\n    if (event.type == 'keydown' && ![' ', 'Enter'].includes(event.key)) return\n    this.hasCalendarTarget ? this.close(true) : this.open(true)\n  }\n\n  close(animate) {\n    if (animate) {\n      this.calendarTarget.classList.add('fade-out')\n      if (this.hasCssAnimation(this.calendarTarget)) {\n        this.calendarTarget.onanimationend = e => e.target.remove()\n      } else {\n        this.calendarTarget.remove()\n      }\n    } else {\n      this.calendarTarget.remove()\n    }\n\n    this.toggleTarget.focus()\n  }\n\n  open(animate, isoDate = this.initialIsoDate()) {\n    this.render(isoDate, animate)\n    this.focusDate(isoDate)\n  }\n\n  // Returns the date to focus on initially.  This is `dateValue` if given\n  // or today.  Whichever is used, it is clamped to `minValue` and/or `maxValue`\n  // dates if given.\n  initialIsoDate() {\n    return this.clamp(new IsoDate(this.dateValue))\n  }\n\n  clamp(isoDate) {\n    return this.rangeUnderflow(isoDate) ? new IsoDate(this.minValue)\n         : this.rangeOverflow(isoDate)  ? new IsoDate(this.maxValue)\n         : isoDate\n  }\n\n  rangeUnderflow(isoDate) {\n    return this.hasMinValue && isoDate.before(new IsoDate(this.minValue))\n  }\n\n  rangeOverflow(isoDate) {\n    return this.hasMaxValue && isoDate.after(new IsoDate(this.maxValue))\n  }\n\n  isOutOfRange(isoDate) {\n    return this.rangeUnderflow(isoDate) || this.rangeOverflow(isoDate)\n  }\n\n  closeOnOutsideClick(event) {\n    // `event.target` could already have been removed from the DOM\n    // (e.g. if the previous-month button was clicked) so we cannot\n    // use `this.calendarTarget.contains(event.target)`.\n    if (event.target.closest('[data-datepicker-target=\"calendar\"]')) return\n    this.close(true)\n  }\n\n  redraw() {\n    const isoDate = this.dateFromMonthYearSelectsAndDayGrid()\n    this.close(false)\n    this.open(false, isoDate)\n  }\n\n  gotoPrevMonth() {\n    const isoDate = this.dateFromMonthYearSelectsAndDayGrid()\n    this.close(false)\n    this.open(false, isoDate.previousMonth(this.monthJumpValue == 'dayOfMonth'))\n    this.prevMonthTarget.focus()\n  }\n\n  gotoNextMonth() {\n    const isoDate = this.dateFromMonthYearSelectsAndDayGrid()\n    this.close(false)\n    this.open(false, isoDate.nextMonth(this.monthJumpValue == 'dayOfMonth'))\n    this.nextMonthTarget.focus()\n  }\n\n  gotoToday() {\n    this.close(false)\n    this.open(false, new IsoDate())\n    this.todayTarget.focus()\n  }\n\n  // Returns a date where the month and year come from the dropdowns\n  // and the day of the month from the grid.\n  // @return [IsoDate]\n  dateFromMonthYearSelectsAndDayGrid() {\n    const year  = this.yearTarget.value\n    const month = this.monthTarget.value\n    let day     = this.daysTarget.querySelector('button[tabindex=\"0\"] time').textContent\n\n    const daysInMonth = IsoDate.daysInMonth(+month, +year)\n    if (day > daysInMonth) day = daysInMonth\n\n    return new IsoDate(year, month, day)\n  }\n\n  // Generates the HTML for the calendar and inserts it into the DOM.\n  //\n  // Does not focus the given date.\n  //\n  // @param isoDate [IsoDate] the date of interest\n  render(isoDate, animate) {\n    const cal = `\n      <div class=\"sdp-cal\" data-datepicker-target=\"calendar\" data-action=\"click@window->datepicker#closeOnOutsideClick keydown->datepicker#key\" role=\"dialog\" aria-modal=\"true\" aria-label=\"${this.text('chooseDate')}\">\n        <div class=\"sdp-nav\">\n          <div class=\"sdp-nav-dropdowns\">\n            <div>\n              <select class=\"sdp-month\" data-datepicker-target=\"month\" data-action=\"datepicker#redraw\">\n                ${this.monthOptions(+isoDate.mm)}\n              </select>\n            </div>\n            <div>\n              <select class=\"sdp-year\" data-datepicker-target=\"year\" data-action=\"datepicker#redraw\">\n                ${this.yearOptions(+isoDate.yyyy)}\n              </select>\n            </div>\n          </div>\n          <div class=\"sdp-nav-buttons\">\n            <button class=\"sdp-goto-prev\" data-datepicker-target=\"prevMonth\" data-action=\"datepicker#gotoPrevMonth\" title=\"${this.text('previousMonth')}\" aria-label=\"${this.text('previousMonth')}\">\n              <svg viewBox=\"0 0 10 10\">\n                <polyline points=\"7,1 3,5 7,9\" />\n              </svg>\n            </button>\n            <button class=\"sdp-goto-today\" data-datepicker-target=\"today\" data-action=\"datepicker#gotoToday\" title=\"${this.text('today')}\" aria-label=\"${this.text('today')}\">\n              <svg viewBox=\"0 0 10 10\">\n                <circle cx=\"5\" cy=\"5\" r=\"4\" />\n              </svg>\n            </button>\n            <button class=\"sdp-goto-next\" data-datepicker-target=\"nextMonth\" data-action=\"datepicker#gotoNextMonth\" title=\"${this.text('nextMonth')}\" aria-label=\"${this.text('nextMonth')}\">\n              <svg viewBox=\"0 0 10 10\">\n                <polyline points=\"3,1 7,5 3,9\" />\n              </svg>\n            </button>\n          </div>\n        </div>\n        <div class=\"sdp-days-of-week\">\n          ${this.daysOfWeek()}\n        </div>\n        <div class=\"sdp-days\" data-datepicker-target=\"days\" data-action=\"click->datepicker#pick\" role=\"grid\">\n          ${this.days(isoDate)}\n        </div>\n      </div>\n    `\n    this.element.insertAdjacentHTML('beforeend', cal)\n    if (animate) {\n      this.calendarTarget.classList.add('fade-in')\n      if (this.hasCssAnimation(this.calendarTarget)) {\n        this.calendarTarget.onanimationend = e => this.calendarTarget.classList.remove('fade-in')\n      } else {\n        this.calendarTarget.classList.remove('fade-in')\n      }\n    }\n  }\n\n  monthTargetConnected() {\n    this.autoSizeSelect(this.monthTarget)\n  }\n\n  yearTargetConnected() {\n    this.autoSizeSelect(this.yearTarget)\n  }\n\n  // Set select's width to the width of the selected option.\n  autoSizeSelect(select) {\n    const tempSelect = document.createElement('select')\n    const tempOption = document.createElement('option')\n    tempOption.textContent = select.options[select.selectedIndex].text\n    tempSelect.style.cssText += 'visibility: hidden; position: fixed;'\n    tempSelect.appendChild(tempOption)\n    select.after(tempSelect)\n    const tempSelectWidth = window.getComputedStyle(tempSelect).width\n    select.style.width = tempSelectWidth\n    tempSelect.remove()\n  }\n\n  pick(event) {\n    event.preventDefault()\n\n    let button, time\n    switch (event.target.constructor) {\n      case HTMLTimeElement:\n        time = event.target\n        button = time.parentElement\n        break\n      case HTMLButtonElement:\n        button = event.target\n        time = button.children[0]\n        break\n      default:\n        return\n    }\n\n    if (button.hasAttribute('aria-disabled')) return\n    const dateStr = time.getAttribute('datetime')\n    this.selectDate(new IsoDate(dateStr))\n  }\n\n  key(event) {\n    switch (event.key) {\n      case 'Escape':\n        this.close(true)\n        return\n      case 'Tab':\n        if (event.shiftKey) {\n          if (document.activeElement == this.firstTabStop()) {\n            event.preventDefault()\n            this.lastTabStop().focus()\n          }\n        } else {\n          if (document.activeElement == this.lastTabStop()) {\n            event.preventDefault()\n            this.firstTabStop().focus()\n          }\n        }\n        return\n    }\n\n    const button = event.target\n    if (!this.daysTarget.contains(button)) return\n\n    const dateStr = button.children[0].getAttribute('datetime')\n    const isoDate = new IsoDate(dateStr)\n\n    switch (event.key) {\n      case 'Enter':\n      case ' ':\n        event.preventDefault()\n        if (!button.hasAttribute('aria-disabled')) this.selectDate(isoDate)\n        break\n      case 'ArrowUp':\n      case 'k':\n        this.focusDate(isoDate.previousWeek())\n        break\n      case 'ArrowDown':\n      case 'j':\n        this.focusDate(isoDate.nextWeek())\n        break\n      case 'ArrowLeft':\n      case 'h':\n        this.focusDate(isoDate.previousDay())\n        break\n      case 'ArrowRight':\n      case 'l':\n        this.focusDate(isoDate.nextDay())\n        break\n      case 'Home':\n      case '0':\n      case '^':\n        this.focusDate(isoDate.firstDayOfWeek(this.firstDayOfWeekValue))\n        break\n      case 'End':\n      case '$':\n        this.focusDate(isoDate.lastDayOfWeek(this.firstDayOfWeekValue))\n        break\n      case 'PageUp':\n        event.shiftKey\n          ? this.focusDate(isoDate.previousYear())\n          : this.focusDate(isoDate.previousMonth(this.monthJumpIsDayOfMonth()))\n        break\n      case 'PageDown':\n        event.shiftKey\n          ? this.focusDate(isoDate.nextYear())\n          : this.focusDate(isoDate.nextMonth(this.monthJumpIsDayOfMonth()))\n        break\n      case 'b':\n        this.focusDate(isoDate.previousMonth(this.monthJumpIsDayOfMonth()))\n        break\n      case 'B':\n        this.focusDate(isoDate.previousYear())\n        break\n      case 'w':\n        this.focusDate(isoDate.nextMonth(this.monthJumpIsDayOfMonth()))\n        break\n      case 'W':\n        this.focusDate(isoDate.nextYear())\n        break\n    }\n  }\n\n  firstTabStop() {\n    return this.monthTarget\n  }\n\n  lastTabStop() {\n    return this.calendarTarget.querySelector('.sdp-days button[tabindex=\"0\"]')\n  }\n\n  monthJumpIsDayOfMonth() {\n    return this.monthJumpValue == 'dayOfMonth'\n  }\n\n\n  // @param isoDate [isoDate] the date to select\n  selectDate(isoDate) {\n    this.close(true)\n    this.toggleTarget.focus()\n    this.dateValue = isoDate.toString()\n  }\n\n  // Focuses the given date in the calendar.\n  // If the date is not visible because it is in the hidden part of the previous or\n  // next month, the calendar is updated to show the corresponding month.\n  //\n  // @param isoDate [IsoDate] the date to focus on in the calendar\n  focusDate(isoDate) {\n    const time = this.daysTarget.querySelector(`time[datetime=\"${isoDate.toString()}\"]`)\n\n    if (!time) {\n      const leadingDatetime = this.daysTarget.querySelector('time').getAttribute('datetime')\n      if (isoDate.before(new IsoDate(leadingDatetime))) {\n        this.gotoPrevMonth()\n      } else {\n        this.gotoNextMonth()\n      }\n      this.focusDate(isoDate)\n      return\n    }\n\n    const currentFocus = this.daysTarget.querySelector('button[tabindex=\"0\"]')\n    if (currentFocus) currentFocus.setAttribute('tabindex', -1)\n\n    const button = time.parentElement\n    button.setAttribute('tabindex', 0)\n    button.focus()\n\n    if (!button.hasAttribute('aria-disabled')) {\n      this.setToggleAriaLabel(`${this.text('changeDate')}, ${this.format(isoDate.toString())}`)\n    }\n  }\n\n  // @param selected [Number] the selected month (January is 1)\n  monthOptions(selected) {\n    return this.monthNames('long')\n      .map((name, i) => `<option value=\"${i + 1}\" ${i + 1 == selected ? 'selected' : ''}>${name}</option>`)\n      .join('')\n  }\n\n  // @param selected [Number] the selected year\n  yearOptions(selected) {\n    const years = []\n    const extent = 10\n    for (let y = selected - extent; y <= selected + extent; y++) years.push(y)\n    return years\n      .map(year => `<option ${year == selected ? 'selected' : ''}>${year}</option>`)\n      .join('')\n  }\n\n  daysOfWeek() {\n    return this.dayNames('long')\n      .map(name => `<div title=\"${name}\">${name.slice(0, this.dayNameLengthValue)}</div>`)\n      .join('')\n  }\n\n  // Generates the day grid for the given date's month.\n  // The end of the previous month and the start of the next month\n  // are shown if there is space in the grid.\n  //\n  // Does not focus on the given date.\n  //\n  // @param isoDate [IsoDate] the month of interest\n  // @return [String] HTML for the day grid\n  days(isoDate) {\n    const days = []\n    const selected = new IsoDate(this.dateValue)\n    let date = isoDate.setDayOfMonth(1).firstDayOfWeek(this.firstDayOfWeekValue)\n\n    while (true) {\n      const isPreviousMonth = date.mm != isoDate.mm && date.before(isoDate)\n      const isNextMonth     = date.mm != isoDate.mm && date.after(isoDate)\n\n      if (isNextMonth && date.isFirstDayOfWeek(this.firstDayOfWeekValue)) break\n\n      const klass = this.classAttribute(\n        isPreviousMonth       ? 'sdp-prev-month' : '',\n        isNextMonth           ? 'sdp-next-month' : '',\n        date.isToday()        ? 'sdp-today'      : '',\n        date.isWeekend()      ? 'sdp-weekend'    : '',\n        date.equals(selected) ? 'sdp-selected'   : ''\n      )\n      days.push(`\n        <button type=\"button\"\n                tabindex=\"-1\"\n                ${klass}\n                ${date.equals(selected) ? 'aria-selected=\"true\"' : ''}\n                ${this.isDisabled(date) ? 'aria-disabled=\"true\"' : ''}\n        >\n          <time datetime=\"${date.toString()}\">${+date.dd}</time>\n        </button>\n      `)\n\n      date = date.nextDay()\n    }\n\n    return days.join('')\n  }\n\n  classAttribute(...classes) {\n    const presentClasses = classes.filter(c => c)\n    if (presentClasses.length == 0) return ''\n    return `class=\"${presentClasses.join(' ')}\"`\n  }\n\n  isDisabled(isoDate) {\n    return this.isOutOfRange(isoDate)\n        || (isoDate.isWeekend() && !this.allowWeekendsValue)\n        || (this.disallowValue.includes(isoDate.toString()))\n  }\n\n  // Formats an ISO8601 date, using the `format` value, for display to the user.\n  // Returns an empty string if `str` cannot be formatted.\n  //\n  // @param str [String] a date in YYYY-MM-DD format\n  // @return [String] the date in a user-facing format, or an empty string if the\n  //   given date cannot be formatted\n  format(str) {\n    if (!IsoDate.isValidStr(str)) return ''\n\n    const [yyyy, mm, dd] = str.split('-')\n\n    return this.formatValue\n      .replace('%d',  dd)\n      .replace('%-d', +dd)\n      .replace('%m',  this.zeroPad(mm))\n      .replace('%-m', +mm)\n      .replace('%B',  this.localisedMonth(mm, 'long'))\n      .replace('%b',  this.localisedMonth(mm, 'short'))\n      .replace('%Y',  yyyy)\n      .replace('%y',  +yyyy % 100)\n  }\n\n  // Returns a two-digit zero-padded string.\n  zeroPad(num) {\n    return num.toString().padStart(2, '0')\n  }\n\n  // Parses a date from the user, using the `format` value, into an ISO8601 date.\n  // Returns an empty string if `str` cannot be parsed.\n  //\n  // @param str [String] a user-facing date, e.g. 19/03/2022\n  // @return [String] the date in ISO8601 format, e.g. 2022-03-19; or an empty string\n  //   if the given date cannot be parsed\n  parse(str) {\n    const directives = {\n       'd': ['\\\\d{2}',   function(match) { this.day = +match }],\n      '-d': ['\\\\d{1,2}', function(match) { this.day = +match }],\n       'm': ['\\\\d{2}',   function(match) { this.month = +match }],\n      '-m': ['\\\\d{1,2}', function(match) { this.month = +match }],\n       'B': ['\\\\w+',     function(match, controller) { this.month = controller.monthNumber(match, 'long') }],\n       'b': ['\\\\w{3}',   function(match, controller) { this.month = controller.monthNumber(match, 'short') }],\n       'Y': ['\\\\d{4}',   function(match) { this.year = +match }],\n       'y': ['\\\\d{2}',   function(match) { this.year = 2000 + +match }]\n    }\n    const funcs = []\n    const re = new RegExp(\n      this.formatValue.replace(/%(d|-d|m|-m|B|b|Y|y)/g, function(_, p) {\n        const directive = directives[p]\n        funcs.push(directive[1])\n        return `(${directive[0]})`\n      }))\n    const matches = str.match(re)\n    if (!matches) return ''\n\n    const parts = {}\n    for (let i = 0, len = funcs.length; i < len; i++) {\n      funcs[i].call(parts, matches[i + 1], this)\n    }\n\n    if (!IsoDate.isValidDate(parts.year, parts.month, parts.day)) return ''\n    return new IsoDate(parts.year, parts.month, parts.day).toString()\n  }\n\n  // Returns the name of the month in the configured locale.\n  //\n  // @param month [Number] the month number (January is 1)\n  // @param monthFormat [String] \"long\" (January) | \"short\" (Jan)\n  // @return [String] the localised month name\n  localisedMonth(month, monthFormat) {\n    // Use the middle of the month to avoid timezone edge cases\n    return new Date(`2022-${month}-15`).toLocaleString(this.localesValue, {month: monthFormat})\n  }\n\n  // Returns the number of the month (January is 1).\n  //\n  // @param name [String] the name of the month in the current locale (e.g. January or Jan)\n  // @param monthFormat [String] \"long\" (January) | \"short\" (Jan)\n  // @return [Number] the number of the month, or 0 if name is not recognised\n  monthNumber(name, monthFormat) {\n    return this.monthNames(monthFormat).findIndex(m => name.includes(m)) + 1\n  }\n\n  // Returns the month names in the configured locale.\n  //\n  // @param format [String] \"long\" (January) | \"short\" (Jan)\n  // @return [Array] localised month names\n  monthNames(format) {\n    const formatter = new Intl.DateTimeFormat(this.localesValue, {month: format})\n    return ['01','02','03','04','05','06','07','08','09','10','11','12'].map(mm =>\n      // Use the middle of the month to avoid timezone edge cases\n      formatter.format(new Date(`2022-${mm}-15`))\n    )\n  }\n\n  // Returns the day names in the configured locale, starting with the\n  // firstDayOfTheWeekValue.\n  //\n  // @param format [String] \"long\" (Monday) | \"short\" (Mon) | \"narrow\" (M)\n  // @return [Array] localised day names\n  dayNames(format) {\n    const formatter = new Intl.DateTimeFormat(this.localesValue, {weekday: format})\n    const names = []\n    // Ensure date in month is two digits. 2022-04-10 is a Sunday\n    for (let i = this.firstDayOfWeekValue + 10, n = i + 7; i < n; i++) {\n      names.push(formatter.format(new Date(`2022-04-${i}T00:00:00`)))\n    }\n    return names\n  }\n\n  hasCssAnimation(el) {\n    return window.getComputedStyle(el).getPropertyValue('animation-name') !== 'none';\n  }\n\n}\n\nexport { Datepicker }\n", "import { Application } from \"@hotwired/stimulus\"\nimport { Datepicker } from 'stimulus-datepicker'\n\nconst application = Application.start()\napplication.register('datepicker', Datepicker)\n\n// Configure Stimulus development experience\napplication.debug = false\nwindow.Stimulus   = application\n\nexport { application }\n", "import { Controller } from \"@hotwired/stimulus\";\nimport Inputmask from \"inputmask\";\n\nexport default class extends Controller {\n  static targets = [\"input\"];\n\n  connect() {\n    this.inputTargets.forEach((input) => {\n      Inputmask({\n        mask: \"99/99/9999\",\n        placeholder: \"dd/mm/yyyy\",\n        clearIncomplete: false,\n      }).mask(input);\n\n      input.addEventListener(\"change\", (event) => {\n        if(event.target.value === '') {\n          event.target.parentElement.querySelector(\"input[data-datepicker-target='hidden']\").value = '';\n          return\n        }\n\n        const feedbackClass = \"invalid-feedback\";\n        let feedbackDiv = event.target.nextElementSibling;\n\n\n        if (!feedbackDiv || !feedbackDiv.classList.contains(feedbackClass)) {\n          feedbackDiv = document.createElement(\"div\");\n          feedbackDiv.classList.add(feedbackClass);\n          event.target.insertAdjacentElement(\"afterend\", feedbackDiv);\n        }\n\n        if (!this.isValidDate(event.target.value)) {\n          feedbackDiv.textContent = \"Invalid date\";\n          feedbackDiv.style.display = \"block\";\n          event.target.classList.add(\"is-invalid\");\n\n          // Because the datepicker does not update the hidden field with invalid date, we have to set it manually to\n          // make sure that the maybe submitted input is invalid with the right error.\n          event.target.parentElement.querySelector(\"input[data-datepicker-target='hidden']\").value = '2024-99-99';\n\n        } else {\n          feedbackDiv.textContent = \"\";\n          feedbackDiv.style.display = \"none\";\n          event.target.classList.remove(\"is-invalid\")\n          event.target.parentElement.querySelector(\"input[data-datepicker-target='hidden']\").value = this.convertDate(event.target.value);\n        }\n      });\n    });\n  }\n\n  isValidDate(dateString) {\n    const [day, month, year] = dateString.split(\"/\").map(Number);\n    const date = new Date(year, month - 1, day);\n    return (\n      date.getFullYear() === year &&\n      date.getMonth() === month - 1 &&\n      date.getDate() === day\n    );\n  }\n\n  convertDate(dateString) {\n    const [day, month, year] = dateString.split(\"/\").map(String);\n    return `${year}-${month}-${day}`;\n  }\n}\n", "import { Controller } from \"@hotwired/stimulus\"\n\nexport default class extends Controller {\n  update(event) {\n    const select = event.currentTarget\n    const userId = select.dataset.user\n    const superAdmin = select.dataset.superAdmin\n    const date = select.dataset.date\n    const period = select.dataset.period\n    const status = select.value\n    const previousStatus = select.dataset.previousStatus;\n\n    if (status === 'not_working' && superAdmin === 'false') {\n      alert(\"Please enter Absence first.\");\n      select.value = previousStatus;\n      return;\n    }\n\n    select.setAttribute('data-previous-status', status);\n\n    fetch('/attendances/update', {\n      method: 'POST',\n      headers: {\n        'Content-Type': 'application/json',\n        'X-CSRF-Token': document.querySelector('[name=\"csrf-token\"]').content\n      },\n      body: JSON.stringify({\n        user_id: userId,\n        date: date,\n        period: period,\n        status: status\n      })\n    })\n  }\n}\n", "import { Controller } from \"@hotwired/stimulus\"\n\nexport default class extends Controller {\n  connect() {\n    this.currentUserId = document.querySelector('meta[name=\"current-user-id\"]')?.content\n  }\n  \n  updateWeek(event) {\n    const status = event.target.value\n    const weekStart = event.target.dataset.weekStart\n    const superAdmin = event.target.dataset.superAdmin\n\n    if (status === 'not_working' && superAdmin === 'false') {\n      alert(\"Please enter Absence first.\");\n      event.target.value = '';\n      return;\n    }\n\n    const attendanceSelects = document.querySelectorAll(\n      `.attendance-select[data-date][data-user=\"${this.currentUserId}\"]`\n    )\n  \n    fetch('/attendances/update', {\n      method: 'POST',\n      headers: {\n        'Content-Type': 'application/json',\n        'X-CSRF-Token': document.querySelector('[name=\"csrf-token\"]').content\n      },\n      body: JSON.stringify({\n        user_id: this.currentUserId,\n        week_start: weekStart,\n        status: status\n      })\n    }).then(response => {\n      if (response.ok) {\n        attendanceSelects.forEach(select => {\n          const date = new Date(select.dataset.date)\n          if (date >= new Date(weekStart) && date <= weekEnd) {\n            select.value = status\n            event.preventDefault()\n          }\n        })\n\n        event.target.value = ''\n      }\n    })\n  }\n}\n", "export const sharedResourceAttendanceState = {\n  refusedReplication: false\n}\n", "import { Controller } from \"@hotwired/stimulus\"\nimport { sharedResourceAttendanceState } from \"./shared_resource_attendance_state\"\n\nexport default class extends Controller {\n  connect() {\n    this.currentUserId = document.querySelector('meta[name=\"current-user-id\"]')?.content\n  }\n\n  getTimePeriod(timeSlot) {\n    const morningSlots = ['8:00', '8:30', '9:00', '9:30', '10:00', '10:30', '11:00', '11:30', '12:00', '12:30', '13:00', '13:30']\n    const afternoonSlots = ['14:00', '14:30', '15:00', '15:30', '16:00', '16:30', '17:00', '17:30', '18:00', '18:30', '19:00', '19:30']\n    \n    return morningSlots.includes(timeSlot) ? 'morning' : \n           afternoonSlots.includes(timeSlot) ? 'afternoon' : null\n  }\n\n  getSlotsForPeriod(period) {\n    return period === 'morning' ? \n      ['8:00', '8:30', '9:00', '9:30', '10:00', '10:30', '11:00', '11:30', '12:00', '12:30', '13:00', '13:30'] :\n      ['14:00', '14:30', '15:00', '15:30', '16:00', '16:30', '17:00', '17:30', '18:00', '18:30', '19:00', '19:30']\n  }\n\n  update(event) {\n    const select = event.currentTarget\n    const resourceId = select.dataset.resource\n    const date = select.dataset.date\n    const timeSlot = select.dataset.timeSlot\n    const userId = select.value\n\n    fetch('/planning_resource_attendances/update', {\n      method: 'POST',\n      headers: {\n        'Content-Type': 'application/json',\n        'X-CSRF-Token': document.querySelector('[name=\"csrf-token\"]').content\n      },\n      body: JSON.stringify({\n        resource_id: resourceId,\n        date: date,\n        time_slot: timeSlot,\n        user_id: userId\n      })\n    }).then(response => {\n      if (!response.ok) {\n        select.value = ''\n        alert('An error occurred while updating the resource.')\n        return\n      }\n\n      if (this.currentUserId === userId) {\n        select.dataset.mine = 'true'\n        const period = this.getTimePeriod(timeSlot)\n        \n        if (period && this.canReplicateOverPeriod(resourceId, date, userId, period)) {\n          if (!sharedResourceAttendanceState.refusedReplication) {\n            if (confirm(\"Replicate on the half day ?\")) {\n              this.replicateOverPeriod(resourceId, date, userId, period)  \n            }\n            sharedResourceAttendanceState.refusedReplication = true\n          }\n        }\n      }\n    })\n  }\n\n  canReplicateOverPeriod(resourceId, date, userId, period) {\n    const slots = this.getSlotsForPeriod(period)\n    const selects = slots.map(slot => \n      document.querySelector(`select[data-resource=\"${resourceId}\"][data-date=\"${date}\"][data-time-slot=\"${slot}\"]`)\n    )\n    \n    return selects.every(select => \n      !select.value || select.value === userId\n    )\n  }\n\n  replicateOverPeriod(resourceId, date, userId, period) {\n    const slots = this.getSlotsForPeriod(period)\n    const selects = slots.map(slot => \n      document.querySelector(`select[data-resource=\"${resourceId}\"][data-date=\"${date}\"][data-time-slot=\"${slot}\"]`)\n    )\n\n    selects.forEach(select => {\n      if (select && select.value !== userId) {\n        select.value = userId\n        select.dataset.mine = 'true'\n        \n        fetch('/planning_resource_attendances/update', {\n          method: 'POST',\n          headers: {\n            'Content-Type': 'application/json',\n            'X-CSRF-Token': document.querySelector('[name=\"csrf-token\"]').content\n          },\n          body: JSON.stringify({\n            resource_id: resourceId,\n            date: date,\n            time_slot: select.dataset.timeSlot,\n            user_id: userId\n          })\n        })\n      }\n    })\n  }\n}\n", "import { Controller } from \"@hotwired/stimulus\"\n\n// Connects to data-controller=\"removals\"\nexport default class extends Controller {\n  remove() {\n    this.element.remove()\n  }\n}\n", "import { Controller } from \"@hotwired/stimulus\"\n\nexport default class extends Controller {\n  static targets = [\"checkbox\", \"orderList\"]\n\n  connect() {\n    this.selectedFiles = []\n    this.updateOrder()\n  }\n\n  updateOrder(event) {\n    if (event) {\n      const checkbox = event.target\n      const filename = checkbox.value\n\n      if (checkbox.checked) {\n        this.selectedFiles.push(filename)\n      } else {\n        this.selectedFiles = this.selectedFiles.filter(f => f !== filename)\n      }\n\n      this.selectedFiles.forEach((filename, index) => {\n        const checkbox = this.checkboxTargets.find(cb => cb.value === filename)\n        if (checkbox) {\n          checkbox.name = `task[attachment_files][${index}]`\n        }\n      })\n    }\n\n    if (this.selectedFiles.length === 0) {\n      this.orderListTarget.innerHTML = '<p class=\"text-muted\">Select PDFs to merge</p>'\n      return\n    }\n\n    const orderList = this.selectedFiles\n      .map((filename, index) => `\n        <div class=\"d-flex align-items-start mb-2 last:!mb-0\">\n          <span class=\"badge badge-dark me-2 mt-1\">${index + 1}</span>\n          <span>${filename}</span>\n        </div>\n      `)\n      .join('')\n\n    this.orderListTarget.innerHTML = orderList\n  }\n}\n", "import { Controller } from \"@hotwired/stimulus\"\n\nexport default class extends Controller {\n  async updateCheckpointDate(event) {\n    event.preventDefault()\n\n    const element = event.target.closest('[data-task-id]')\n    if (!element) {\n      return\n    }\n    \n    const taskId = element.dataset.taskId\n    \n    try {\n      const response = await fetch('/users/checkpoint_popup_count', {\n        headers: {\n          'X-Requested-With': 'XMLHttpRequest'\n        }\n      })\n      \n      const data = await response.json()\n\n      \n      if (data.popup_count < 5) {\n        // Show popup using Turbo Frame\n        const url = `/tasks/${taskId}/new_update_checkpoint_date/`\n        \n        // Use Turbo Frame navigation\n        const frame = document.getElementById('edit_dates')\n        if (frame) {\n          Turbo.visit(url, { frame: 'edit_dates' })\n        }\n      } else {\n        // Do direct update without popup\n        const url = `/tasks/${taskId}/update_checkpoint_date`\n        \n        const response = await fetch(url, {\n          method: 'POST',\n          headers: {\n            'X-CSRF-Token': document.querySelector('[name=\"csrf-token\"]').content,\n            'X-Requested-With': 'XMLHttpRequest',\n            'Accept': 'text/vnd.turbo-stream.html'\n          }\n        })\n        \n        if (response.ok) {\n          const html = await response.text()\n          Turbo.renderStreamMessage(html)\n        }\n      }\n    } catch (error) {\n      // Fallback to popup behavior\n      const url = `/tasks/${taskId}/new_update_checkpoint_date/`\n      const frame = document.getElementById('edit_dates')\n      if (frame) {\n        Turbo.visit(url, { frame: 'edit_dates' })\n      }\n    }\n  }\n}\n", "import { Controller } from \"@hotwired/stimulus\"\n\nexport default class extends Controller {\n  static targets = [\"checkbox\", \"selectAll\", \"batchSelect\", \"taskSelectAll\", \"statusSelect\"]\n\n  connect() {\n    this.updateSelectAllState()\n    this.initializeTaskSelectAll()\n    this.setupStatusChangeListeners()\n  }\n\n  // Setup listeners for status changes\n  setupStatusChangeListeners() {\n    const statusSelects = this.statusSelectTargets.length > 0 \n      ? this.statusSelectTargets \n      : this.element.querySelectorAll('.suggestion-state')\n    \n    statusSelects.forEach(select => {\n      $(select).on('select2:select', (event) => {\n        this.handleStatusChange(event)\n      })\n    })\n  }\n\n  // Handle status change and apply to all selected billables\n  handleStatusChange(event) {\n    const selectedStatus = event.target.value\n    const checkedCheckboxes = this.element.querySelectorAll('.billable-checkbox:checked')\n    \n    if (checkedCheckboxes.length > 1) {\n      // Apply the status to all selected billables\n      checkedCheckboxes.forEach(checkbox => {\n        const statusSelect = checkbox.closest('tr').querySelector('.suggestion-state')\n        if (statusSelect && statusSelect !== event.target) {\n          statusSelect.value = selectedStatus\n          // Update Select2 if it exists\n          if (statusSelect.select2) {\n            statusSelect.select2('val', selectedStatus)\n          }\n          // Trigger change event to ensure any listeners are notified\n          statusSelect.dispatchEvent(new Event('change', { bubbles: true }))\n        }\n      })\n      \n      // Uncheck all selected checkboxes\n      checkedCheckboxes.forEach(checkbox => {\n        checkbox.checked = false\n      })\n      \n      // Update all states\n      this.updateSelectAllState()\n      this.initializeTaskSelectAll()\n      this.updateBatchSelectVisibility()\n    }\n  }\n\n  // Toggle all billables across all tasks (global select all)\n  toggleSelectAll() {\n    const isChecked = this.selectAllTarget.checked\n    \n    const checkboxes = this.checkboxTargets.length > 0 \n      ? this.checkboxTargets \n      : this.element.querySelectorAll('.billable-checkbox')\n    \n    checkboxes.forEach(checkbox => {\n      checkbox.checked = isChecked\n    })\n    \n    // Also update all task select all checkboxes\n    const taskSelectAllCheckboxes = this.taskSelectAllTargets.length > 0 \n      ? this.taskSelectAllTargets \n      : this.element.querySelectorAll('.task-select-all-checkbox')\n    \n    taskSelectAllCheckboxes.forEach(checkbox => {\n      checkbox.checked = isChecked\n      checkbox.indeterminate = false\n    })\n    \n    // If selecting all, don't gray out the selects - allow individual selection\n    if (isChecked) {\n      this.enableAllStatusSelects()\n    } else {\n      this.updateBatchSelectVisibility()\n    }\n  }\n\n  // Toggle all billables for a specific task\n  toggleTaskSelectAll(event) {\n    const taskId = event.target.dataset.taskId\n    const isChecked = event.target.checked\n    \n    // Find the table that contains this task select all checkbox\n    const taskTable = event.target.closest('table')\n    if (!taskTable) return\n    \n    // Find all billable checkboxes in this specific table\n    const taskCheckboxes = taskTable.querySelectorAll('.billable-checkbox')\n    \n    taskCheckboxes.forEach(checkbox => {\n      checkbox.checked = isChecked\n    })\n    \n    // Update the task select all state\n    this.updateTaskSelectAllState(taskTable)\n    \n    // If selecting all in a task, don't gray out the selects - allow individual selection\n    if (isChecked) {\n      this.enableAllStatusSelects()\n    } else {\n      this.updateBatchSelectVisibility()\n    }\n  }\n\n  // Toggle individual billable checkbox\n  toggleIndividual(event) {\n    // Find the table that contains this checkbox\n    const taskTable = event.target.closest('table')\n    if (!taskTable) return\n    \n    this.updateTaskSelectAllState(taskTable)\n    this.updateSelectAllState()\n    this.updateBatchSelectVisibility()\n  }\n\n  // Update the state of a specific task's select all checkbox\n  updateTaskSelectAllState(taskTable) {\n    const taskCheckboxes = taskTable.querySelectorAll('.billable-checkbox')\n    const taskSelectAllCheckbox = taskTable.querySelector('.task-select-all-checkbox')\n    \n    if (!taskSelectAllCheckbox || taskCheckboxes.length === 0) return\n    \n    const totalCheckboxes = taskCheckboxes.length\n    const checkedCheckboxes = Array.from(taskCheckboxes).filter(checkbox => checkbox.checked).length\n    \n    if (checkedCheckboxes === 0) {\n      taskSelectAllCheckbox.checked = false\n      taskSelectAllCheckbox.indeterminate = false\n    } else if (checkedCheckboxes === totalCheckboxes) {\n      taskSelectAllCheckbox.checked = true\n      taskSelectAllCheckbox.indeterminate = false\n    } else {\n      taskSelectAllCheckbox.checked = false\n      taskSelectAllCheckbox.indeterminate = true\n    }\n  }\n\n  // Update global select all state\n  updateSelectAllState() {\n    const checkboxes = this.checkboxTargets.length > 0 \n      ? this.checkboxTargets \n      : this.element.querySelectorAll('.billable-checkbox')\n    \n    const totalCheckboxes = checkboxes.length\n    const checkedCheckboxes = Array.from(checkboxes).filter(checkbox => checkbox.checked).length\n    \n    if (checkedCheckboxes === 0) {\n      this.selectAllTarget.checked = false\n      this.selectAllTarget.indeterminate = false\n    } else if (checkedCheckboxes === totalCheckboxes) {\n      this.selectAllTarget.checked = true\n      this.selectAllTarget.indeterminate = false\n    } else {\n      this.selectAllTarget.checked = false\n      this.selectAllTarget.indeterminate = true\n    }\n  }\n\n  // Initialize task select all checkboxes state\n  initializeTaskSelectAll() {\n    const taskSelectAllCheckboxes = this.taskSelectAllTargets.length > 0 \n      ? this.taskSelectAllTargets \n      : this.element.querySelectorAll('.task-select-all-checkbox')\n    \n    taskSelectAllCheckboxes.forEach(checkbox => {\n      const taskTable = checkbox.closest('table')\n      if (taskTable) {\n        this.updateTaskSelectAllState(taskTable)\n      }\n    })\n  }\n\n  // Update batch select visibility and manage status selects\n  updateBatchSelectVisibility() {\n    const checkboxes = this.checkboxTargets.length > 0 \n      ? this.checkboxTargets \n      : this.element.querySelectorAll('.billable-checkbox')\n    \n    const hasCheckedItems = Array.from(checkboxes).some(checkbox => checkbox.checked)\n    this.batchSelectTarget.style.display = hasCheckedItems ? 'block' : 'none'\n    \n    // Manage status select states\n    this.manageStatusSelectStates()\n  }\n\n  // Enable all status selects\n  enableAllStatusSelects() {\n    const statusSelects = this.statusSelectTargets.length > 0 \n      ? this.statusSelectTargets \n      : this.element.querySelectorAll('.suggestion-state')\n    \n    statusSelects.forEach(select => {\n      select.disabled = false\n      select.style.opacity = '1'\n      // Re-enable Select2 if it exists\n      if (select.select2) {\n        select.select2('enable', true)\n      }\n    })\n  }\n\n  // Manage the state of status select dropdowns\n  manageStatusSelectStates() {\n    const statusSelects = this.statusSelectTargets.length > 0 \n      ? this.statusSelectTargets \n      : this.element.querySelectorAll('.suggestion-state')\n    \n    const checkedCheckboxes = this.element.querySelectorAll('.billable-checkbox:checked')\n    \n    if (checkedCheckboxes.length === 0) {\n      // No items selected, enable all status selects\n      this.enableAllStatusSelects()\n    } else {\n      // Items selected, enable only the last selected one\n      const lastCheckedCheckbox = Array.from(checkedCheckboxes).pop()\n      const lastCheckedRow = lastCheckedCheckbox.closest('tr')\n      const lastCheckedStatusSelect = lastCheckedRow.querySelector('.suggestion-state')\n      \n      statusSelects.forEach(select => {\n        const row = select.closest('tr')\n        const checkbox = row.querySelector('.billable-checkbox')\n        \n        if (checkbox && checkbox.checked && select === lastCheckedStatusSelect) {\n          select.disabled = false\n          select.style.opacity = '1'\n          // Enable Select2 if it exists\n          if (select.select2) {\n            select.select2('enable', true)\n          }\n        } else {\n          select.disabled = true\n          select.style.opacity = '0.5'\n          // Disable Select2 if it exists\n          if (select.select2) {\n            select.select2('enable', false)\n          }\n        }\n      })\n    }\n  }\n\n  // Apply batch status to all selected billables\n  applyBatchStatus() {\n    const batchSelectElement = this.batchSelectTarget.querySelector('select')\n    const selectedStatus = batchSelectElement.value\n    if (!selectedStatus) return\n\n    const checkedCheckboxes = this.element.querySelectorAll('.billable-checkbox:checked')\n    \n    checkedCheckboxes.forEach(checkbox => {\n      const statusSelect = checkbox.closest('tr').querySelector('.suggestion-state')\n      if (statusSelect) {\n        statusSelect.value = selectedStatus\n        // Update Select2 if it exists\n        if (statusSelect.select2) {\n          statusSelect.select2('val', selectedStatus)\n        }\n        // Trigger change event to ensure any listeners are notified\n        statusSelect.dispatchEvent(new Event('change', { bubbles: true }))\n      }\n    })\n\n    // Uncheck all selected checkboxes\n    checkedCheckboxes.forEach(checkbox => {\n      checkbox.checked = false\n    })\n\n    // Reset batch select\n    batchSelectElement.value = ''\n    \n    // Update all states\n    this.updateSelectAllState()\n    this.initializeTaskSelectAll()\n    this.updateBatchSelectVisibility()\n  }\n}\n", "import { Controller } from \"@hotwired/stimulus\";\n\nexport default class extends Controller {\n  connect() {\n    this.bindEvents();\n    this.setupDisabledLastInvoiceDateMessage();\n  }\n\n  bindEvents() {\n    const pendingSelect = document.getElementById('new-invoice-instructions-pending-billables-input');\n    const allSelect = document.getElementById('new-invoice-all-instructions-input');\n\n    const handler = (e) => {\n      const instructionId = e?.params?.data?.id || e?.target?.value;\n      if (!instructionId) return;\n      this.checkInstructionAndMaybeSetDate(instructionId);\n    };\n\n    if (window.$) {\n      if (pendingSelect) {\n        window.$(pendingSelect).on('change', handler);\n      }\n      if (allSelect) {\n        window.$(allSelect).on('change', handler);\n      }\n    } else {\n      if (pendingSelect) pendingSelect.addEventListener('change', handler);\n      if (allSelect) allSelect.addEventListener('change', handler);\n    }\n  }\n\n  checkInstructionAndMaybeSetDate(instructionId) {\n    fetch(`/instructions/${instructionId}/invoicing_style`)\n      .then((r) => r.ok ? r.json() : Promise.reject())\n      .then((data) => {\n        const style = data?.patents_invoicing_style;\n        if (style === 'ByInstruction-OnlyPreviousMonth') {\n          this.setFirstDayOutOfInvoiceToFirstOfMonth();\n        }\n        \n        // Set verifier and contact to liaison if present\n        const liaisonId = data?.liaison_id;\n        if (liaisonId) {\n          this.setVerifierAndContactToLiaison(liaisonId);\n        }\n      })\n      .catch(() => {});\n  }\n\n  setupDisabledLastInvoiceDateMessage() {\n    const input = document.getElementById('new_invoice_form_first_day_out_of_last_invoice');\n    if (!input || !input.disabled) return;\n\n    const container = input.closest('[data-controller=\"date-mask\"]') || input.parentElement;\n    if (!container) return;\n\n    // Ensure the container can host an absolute overlay\n    if (getComputedStyle(container).position === 'static') {\n      container.style.position = 'relative';\n    }\n\n    // Avoid duplicating overlay if connect runs twice\n    if (container.querySelector('.disabled-input-overlay')) return;\n\n    const overlay = document.createElement('div');\n    overlay.className = 'disabled-input-overlay';\n    overlay.style.position = 'absolute';\n    overlay.style.top = '0';\n    overlay.style.left = '0';\n    overlay.style.right = '0';\n    overlay.style.bottom = '0';\n    overlay.style.cursor = 'not-allowed';\n    overlay.style.background = 'transparent';\n    overlay.style.zIndex = '2';\n\n    overlay.addEventListener('click', (e) => {\n      e.preventDefault();\n      e.stopPropagation();\n      window.alert('Please contact SuperAdmin if you wish to edit this value.');\n    });\n\n    container.appendChild(overlay);\n  }\n\n  setFirstDayOutOfInvoiceToFirstOfMonth() {\n    const input = document.getElementById('new_invoice_form_first_day_out_of_invoice');\n    if (!input) return;\n\n    const today = new Date();\n    const first = new Date(today.getFullYear(), today.getMonth(), 1);\n    const dd = String(first.getDate()).padStart(2, '0');\n    const mm = String(first.getMonth() + 1).padStart(2, '0');\n    const yyyy = first.getFullYear();\n    const formatted = `${dd}/${mm}/${yyyy}`;\n\n    input.value = formatted;\n    const event = new Event('change', { bubbles: true });\n    input.dispatchEvent(event);\n  }\n\n  setVerifierAndContactToLiaison(liaisonId) {\n    const verifierInput = document.querySelector('.suggestion-verifier');\n    const contactInput = document.querySelector('.suggestion-contact');\n\n    if (verifierInput) {\n      if (window.$ && window.$(verifierInput).hasClass('select2-hidden-accessible')) {\n        window.$(verifierInput).val(liaisonId).trigger('change');\n      } else {\n        verifierInput.value = liaisonId;\n        const verifierEvent = new Event('change', { bubbles: true });\n        verifierInput.dispatchEvent(verifierEvent);\n      }\n    }\n\n    if (contactInput) {\n      if (window.$ && window.$(contactInput).hasClass('select2-hidden-accessible')) {\n        window.$(contactInput).val(liaisonId).trigger('change');\n      } else {\n        contactInput.value = liaisonId;\n        const contactEvent = new Event('change', { bubbles: true });\n        contactInput.dispatchEvent(contactEvent);\n      }\n    }\n  }\n}\n\n\n", "/**!\n * Sortable 1.15.6\n * @author\tRubaXa   <trash@rubaxa.org>\n * @author\towenm    <owen23355@gmail.com>\n * @license MIT\n */\nfunction ownKeys(object, enumerableOnly) {\n  var keys = Object.keys(object);\n  if (Object.getOwnPropertySymbols) {\n    var symbols = Object.getOwnPropertySymbols(object);\n    if (enumerableOnly) {\n      symbols = symbols.filter(function (sym) {\n        return Object.getOwnPropertyDescriptor(object, sym).enumerable;\n      });\n    }\n    keys.push.apply(keys, symbols);\n  }\n  return keys;\n}\nfunction _objectSpread2(target) {\n  for (var i = 1; i < arguments.length; i++) {\n    var source = arguments[i] != null ? arguments[i] : {};\n    if (i % 2) {\n      ownKeys(Object(source), true).forEach(function (key) {\n        _defineProperty(target, key, source[key]);\n      });\n    } else if (Object.getOwnPropertyDescriptors) {\n      Object.defineProperties(target, Object.getOwnPropertyDescriptors(source));\n    } else {\n      ownKeys(Object(source)).forEach(function (key) {\n        Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key));\n      });\n    }\n  }\n  return target;\n}\nfunction _typeof(obj) {\n  \"@babel/helpers - typeof\";\n\n  if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") {\n    _typeof = function (obj) {\n      return typeof obj;\n    };\n  } else {\n    _typeof = function (obj) {\n      return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n    };\n  }\n  return _typeof(obj);\n}\nfunction _defineProperty(obj, key, value) {\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}\nfunction _extends() {\n  _extends = Object.assign || 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  };\n  return _extends.apply(this, arguments);\n}\nfunction _objectWithoutPropertiesLoose(source, excluded) {\n  if (source == null) return {};\n  var target = {};\n  var sourceKeys = Object.keys(source);\n  var key, i;\n  for (i = 0; i < sourceKeys.length; i++) {\n    key = sourceKeys[i];\n    if (excluded.indexOf(key) >= 0) continue;\n    target[key] = source[key];\n  }\n  return target;\n}\nfunction _objectWithoutProperties(source, excluded) {\n  if (source == null) return {};\n  var target = _objectWithoutPropertiesLoose(source, excluded);\n  var key, i;\n  if (Object.getOwnPropertySymbols) {\n    var sourceSymbolKeys = Object.getOwnPropertySymbols(source);\n    for (i = 0; i < sourceSymbolKeys.length; i++) {\n      key = sourceSymbolKeys[i];\n      if (excluded.indexOf(key) >= 0) continue;\n      if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue;\n      target[key] = source[key];\n    }\n  }\n  return target;\n}\nfunction _toConsumableArray(arr) {\n  return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread();\n}\nfunction _arrayWithoutHoles(arr) {\n  if (Array.isArray(arr)) return _arrayLikeToArray(arr);\n}\nfunction _iterableToArray(iter) {\n  if (typeof Symbol !== \"undefined\" && iter[Symbol.iterator] != null || iter[\"@@iterator\"] != null) return Array.from(iter);\n}\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}\nfunction _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}\nfunction _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}\n\nvar version = \"1.15.6\";\n\nfunction userAgent(pattern) {\n  if (typeof window !== 'undefined' && window.navigator) {\n    return !! /*@__PURE__*/navigator.userAgent.match(pattern);\n  }\n}\nvar IE11OrLess = userAgent(/(?:Trident.*rv[ :]?11\\.|msie|iemobile|Windows Phone)/i);\nvar Edge = userAgent(/Edge/i);\nvar FireFox = userAgent(/firefox/i);\nvar Safari = userAgent(/safari/i) && !userAgent(/chrome/i) && !userAgent(/android/i);\nvar IOS = userAgent(/iP(ad|od|hone)/i);\nvar ChromeForAndroid = userAgent(/chrome/i) && userAgent(/android/i);\n\nvar captureMode = {\n  capture: false,\n  passive: false\n};\nfunction on(el, event, fn) {\n  el.addEventListener(event, fn, !IE11OrLess && captureMode);\n}\nfunction off(el, event, fn) {\n  el.removeEventListener(event, fn, !IE11OrLess && captureMode);\n}\nfunction matches( /**HTMLElement*/el, /**String*/selector) {\n  if (!selector) return;\n  selector[0] === '>' && (selector = selector.substring(1));\n  if (el) {\n    try {\n      if (el.matches) {\n        return el.matches(selector);\n      } else if (el.msMatchesSelector) {\n        return el.msMatchesSelector(selector);\n      } else if (el.webkitMatchesSelector) {\n        return el.webkitMatchesSelector(selector);\n      }\n    } catch (_) {\n      return false;\n    }\n  }\n  return false;\n}\nfunction getParentOrHost(el) {\n  return el.host && el !== document && el.host.nodeType ? el.host : el.parentNode;\n}\nfunction closest( /**HTMLElement*/el, /**String*/selector, /**HTMLElement*/ctx, includeCTX) {\n  if (el) {\n    ctx = ctx || document;\n    do {\n      if (selector != null && (selector[0] === '>' ? el.parentNode === ctx && matches(el, selector) : matches(el, selector)) || includeCTX && el === ctx) {\n        return el;\n      }\n      if (el === ctx) break;\n      /* jshint boss:true */\n    } while (el = getParentOrHost(el));\n  }\n  return null;\n}\nvar R_SPACE = /\\s+/g;\nfunction toggleClass(el, name, state) {\n  if (el && name) {\n    if (el.classList) {\n      el.classList[state ? 'add' : 'remove'](name);\n    } else {\n      var className = (' ' + el.className + ' ').replace(R_SPACE, ' ').replace(' ' + name + ' ', ' ');\n      el.className = (className + (state ? ' ' + name : '')).replace(R_SPACE, ' ');\n    }\n  }\n}\nfunction css(el, prop, val) {\n  var style = el && el.style;\n  if (style) {\n    if (val === void 0) {\n      if (document.defaultView && document.defaultView.getComputedStyle) {\n        val = document.defaultView.getComputedStyle(el, '');\n      } else if (el.currentStyle) {\n        val = el.currentStyle;\n      }\n      return prop === void 0 ? val : val[prop];\n    } else {\n      if (!(prop in style) && prop.indexOf('webkit') === -1) {\n        prop = '-webkit-' + prop;\n      }\n      style[prop] = val + (typeof val === 'string' ? '' : 'px');\n    }\n  }\n}\nfunction matrix(el, selfOnly) {\n  var appliedTransforms = '';\n  if (typeof el === 'string') {\n    appliedTransforms = el;\n  } else {\n    do {\n      var transform = css(el, 'transform');\n      if (transform && transform !== 'none') {\n        appliedTransforms = transform + ' ' + appliedTransforms;\n      }\n      /* jshint boss:true */\n    } while (!selfOnly && (el = el.parentNode));\n  }\n  var matrixFn = window.DOMMatrix || window.WebKitCSSMatrix || window.CSSMatrix || window.MSCSSMatrix;\n  /*jshint -W056 */\n  return matrixFn && new matrixFn(appliedTransforms);\n}\nfunction find(ctx, tagName, iterator) {\n  if (ctx) {\n    var list = ctx.getElementsByTagName(tagName),\n      i = 0,\n      n = list.length;\n    if (iterator) {\n      for (; i < n; i++) {\n        iterator(list[i], i);\n      }\n    }\n    return list;\n  }\n  return [];\n}\nfunction getWindowScrollingElement() {\n  var scrollingElement = document.scrollingElement;\n  if (scrollingElement) {\n    return scrollingElement;\n  } else {\n    return document.documentElement;\n  }\n}\n\n/**\r\n * Returns the \"bounding client rect\" of given element\r\n * @param  {HTMLElement} el                       The element whose boundingClientRect is wanted\r\n * @param  {[Boolean]} relativeToContainingBlock  Whether the rect should be relative to the containing block of (including) the container\r\n * @param  {[Boolean]} relativeToNonStaticParent  Whether the rect should be relative to the relative parent of (including) the contaienr\r\n * @param  {[Boolean]} undoScale                  Whether the container's scale() should be undone\r\n * @param  {[HTMLElement]} container              The parent the element will be placed in\r\n * @return {Object}                               The boundingClientRect of el, with specified adjustments\r\n */\nfunction getRect(el, relativeToContainingBlock, relativeToNonStaticParent, undoScale, container) {\n  if (!el.getBoundingClientRect && el !== window) return;\n  var elRect, top, left, bottom, right, height, width;\n  if (el !== window && el.parentNode && el !== getWindowScrollingElement()) {\n    elRect = el.getBoundingClientRect();\n    top = elRect.top;\n    left = elRect.left;\n    bottom = elRect.bottom;\n    right = elRect.right;\n    height = elRect.height;\n    width = elRect.width;\n  } else {\n    top = 0;\n    left = 0;\n    bottom = window.innerHeight;\n    right = window.innerWidth;\n    height = window.innerHeight;\n    width = window.innerWidth;\n  }\n  if ((relativeToContainingBlock || relativeToNonStaticParent) && el !== window) {\n    // Adjust for translate()\n    container = container || el.parentNode;\n\n    // solves #1123 (see: https://stackoverflow.com/a/37953806/6088312)\n    // Not needed on <= IE11\n    if (!IE11OrLess) {\n      do {\n        if (container && container.getBoundingClientRect && (css(container, 'transform') !== 'none' || relativeToNonStaticParent && css(container, 'position') !== 'static')) {\n          var containerRect = container.getBoundingClientRect();\n\n          // Set relative to edges of padding box of container\n          top -= containerRect.top + parseInt(css(container, 'border-top-width'));\n          left -= containerRect.left + parseInt(css(container, 'border-left-width'));\n          bottom = top + elRect.height;\n          right = left + elRect.width;\n          break;\n        }\n        /* jshint boss:true */\n      } while (container = container.parentNode);\n    }\n  }\n  if (undoScale && el !== window) {\n    // Adjust for scale()\n    var elMatrix = matrix(container || el),\n      scaleX = elMatrix && elMatrix.a,\n      scaleY = elMatrix && elMatrix.d;\n    if (elMatrix) {\n      top /= scaleY;\n      left /= scaleX;\n      width /= scaleX;\n      height /= scaleY;\n      bottom = top + height;\n      right = left + width;\n    }\n  }\n  return {\n    top: top,\n    left: left,\n    bottom: bottom,\n    right: right,\n    width: width,\n    height: height\n  };\n}\n\n/**\r\n * Checks if a side of an element is scrolled past a side of its parents\r\n * @param  {HTMLElement}  el           The element who's side being scrolled out of view is in question\r\n * @param  {String}       elSide       Side of the element in question ('top', 'left', 'right', 'bottom')\r\n * @param  {String}       parentSide   Side of the parent in question ('top', 'left', 'right', 'bottom')\r\n * @return {HTMLElement}               The parent scroll element that the el's side is scrolled past, or null if there is no such element\r\n */\nfunction isScrolledPast(el, elSide, parentSide) {\n  var parent = getParentAutoScrollElement(el, true),\n    elSideVal = getRect(el)[elSide];\n\n  /* jshint boss:true */\n  while (parent) {\n    var parentSideVal = getRect(parent)[parentSide],\n      visible = void 0;\n    if (parentSide === 'top' || parentSide === 'left') {\n      visible = elSideVal >= parentSideVal;\n    } else {\n      visible = elSideVal <= parentSideVal;\n    }\n    if (!visible) return parent;\n    if (parent === getWindowScrollingElement()) break;\n    parent = getParentAutoScrollElement(parent, false);\n  }\n  return false;\n}\n\n/**\r\n * Gets nth child of el, ignoring hidden children, sortable's elements (does not ignore clone if it's visible)\r\n * and non-draggable elements\r\n * @param  {HTMLElement} el       The parent element\r\n * @param  {Number} childNum      The index of the child\r\n * @param  {Object} options       Parent Sortable's options\r\n * @return {HTMLElement}          The child at index childNum, or null if not found\r\n */\nfunction getChild(el, childNum, options, includeDragEl) {\n  var currentChild = 0,\n    i = 0,\n    children = el.children;\n  while (i < children.length) {\n    if (children[i].style.display !== 'none' && children[i] !== Sortable.ghost && (includeDragEl || children[i] !== Sortable.dragged) && closest(children[i], options.draggable, el, false)) {\n      if (currentChild === childNum) {\n        return children[i];\n      }\n      currentChild++;\n    }\n    i++;\n  }\n  return null;\n}\n\n/**\r\n * Gets the last child in the el, ignoring ghostEl or invisible elements (clones)\r\n * @param  {HTMLElement} el       Parent element\r\n * @param  {selector} selector    Any other elements that should be ignored\r\n * @return {HTMLElement}          The last child, ignoring ghostEl\r\n */\nfunction lastChild(el, selector) {\n  var last = el.lastElementChild;\n  while (last && (last === Sortable.ghost || css(last, 'display') === 'none' || selector && !matches(last, selector))) {\n    last = last.previousElementSibling;\n  }\n  return last || null;\n}\n\n/**\r\n * Returns the index of an element within its parent for a selected set of\r\n * elements\r\n * @param  {HTMLElement} el\r\n * @param  {selector} selector\r\n * @return {number}\r\n */\nfunction index(el, selector) {\n  var index = 0;\n  if (!el || !el.parentNode) {\n    return -1;\n  }\n\n  /* jshint boss:true */\n  while (el = el.previousElementSibling) {\n    if (el.nodeName.toUpperCase() !== 'TEMPLATE' && el !== Sortable.clone && (!selector || matches(el, selector))) {\n      index++;\n    }\n  }\n  return index;\n}\n\n/**\r\n * Returns the scroll offset of the given element, added with all the scroll offsets of parent elements.\r\n * The value is returned in real pixels.\r\n * @param  {HTMLElement} el\r\n * @return {Array}             Offsets in the format of [left, top]\r\n */\nfunction getRelativeScrollOffset(el) {\n  var offsetLeft = 0,\n    offsetTop = 0,\n    winScroller = getWindowScrollingElement();\n  if (el) {\n    do {\n      var elMatrix = matrix(el),\n        scaleX = elMatrix.a,\n        scaleY = elMatrix.d;\n      offsetLeft += el.scrollLeft * scaleX;\n      offsetTop += el.scrollTop * scaleY;\n    } while (el !== winScroller && (el = el.parentNode));\n  }\n  return [offsetLeft, offsetTop];\n}\n\n/**\r\n * Returns the index of the object within the given array\r\n * @param  {Array} arr   Array that may or may not hold the object\r\n * @param  {Object} obj  An object that has a key-value pair unique to and identical to a key-value pair in the object you want to find\r\n * @return {Number}      The index of the object in the array, or -1\r\n */\nfunction indexOfObject(arr, obj) {\n  for (var i in arr) {\n    if (!arr.hasOwnProperty(i)) continue;\n    for (var key in obj) {\n      if (obj.hasOwnProperty(key) && obj[key] === arr[i][key]) return Number(i);\n    }\n  }\n  return -1;\n}\nfunction getParentAutoScrollElement(el, includeSelf) {\n  // skip to window\n  if (!el || !el.getBoundingClientRect) return getWindowScrollingElement();\n  var elem = el;\n  var gotSelf = false;\n  do {\n    // we don't need to get elem css if it isn't even overflowing in the first place (performance)\n    if (elem.clientWidth < elem.scrollWidth || elem.clientHeight < elem.scrollHeight) {\n      var elemCSS = css(elem);\n      if (elem.clientWidth < elem.scrollWidth && (elemCSS.overflowX == 'auto' || elemCSS.overflowX == 'scroll') || elem.clientHeight < elem.scrollHeight && (elemCSS.overflowY == 'auto' || elemCSS.overflowY == 'scroll')) {\n        if (!elem.getBoundingClientRect || elem === document.body) return getWindowScrollingElement();\n        if (gotSelf || includeSelf) return elem;\n        gotSelf = true;\n      }\n    }\n    /* jshint boss:true */\n  } while (elem = elem.parentNode);\n  return getWindowScrollingElement();\n}\nfunction extend(dst, src) {\n  if (dst && src) {\n    for (var key in src) {\n      if (src.hasOwnProperty(key)) {\n        dst[key] = src[key];\n      }\n    }\n  }\n  return dst;\n}\nfunction isRectEqual(rect1, rect2) {\n  return Math.round(rect1.top) === Math.round(rect2.top) && Math.round(rect1.left) === Math.round(rect2.left) && Math.round(rect1.height) === Math.round(rect2.height) && Math.round(rect1.width) === Math.round(rect2.width);\n}\nvar _throttleTimeout;\nfunction throttle(callback, ms) {\n  return function () {\n    if (!_throttleTimeout) {\n      var args = arguments,\n        _this = this;\n      if (args.length === 1) {\n        callback.call(_this, args[0]);\n      } else {\n        callback.apply(_this, args);\n      }\n      _throttleTimeout = setTimeout(function () {\n        _throttleTimeout = void 0;\n      }, ms);\n    }\n  };\n}\nfunction cancelThrottle() {\n  clearTimeout(_throttleTimeout);\n  _throttleTimeout = void 0;\n}\nfunction scrollBy(el, x, y) {\n  el.scrollLeft += x;\n  el.scrollTop += y;\n}\nfunction clone(el) {\n  var Polymer = window.Polymer;\n  var $ = window.jQuery || window.Zepto;\n  if (Polymer && Polymer.dom) {\n    return Polymer.dom(el).cloneNode(true);\n  } else if ($) {\n    return $(el).clone(true)[0];\n  } else {\n    return el.cloneNode(true);\n  }\n}\nfunction setRect(el, rect) {\n  css(el, 'position', 'absolute');\n  css(el, 'top', rect.top);\n  css(el, 'left', rect.left);\n  css(el, 'width', rect.width);\n  css(el, 'height', rect.height);\n}\nfunction unsetRect(el) {\n  css(el, 'position', '');\n  css(el, 'top', '');\n  css(el, 'left', '');\n  css(el, 'width', '');\n  css(el, 'height', '');\n}\nfunction getChildContainingRectFromElement(container, options, ghostEl) {\n  var rect = {};\n  Array.from(container.children).forEach(function (child) {\n    var _rect$left, _rect$top, _rect$right, _rect$bottom;\n    if (!closest(child, options.draggable, container, false) || child.animated || child === ghostEl) return;\n    var childRect = getRect(child);\n    rect.left = Math.min((_rect$left = rect.left) !== null && _rect$left !== void 0 ? _rect$left : Infinity, childRect.left);\n    rect.top = Math.min((_rect$top = rect.top) !== null && _rect$top !== void 0 ? _rect$top : Infinity, childRect.top);\n    rect.right = Math.max((_rect$right = rect.right) !== null && _rect$right !== void 0 ? _rect$right : -Infinity, childRect.right);\n    rect.bottom = Math.max((_rect$bottom = rect.bottom) !== null && _rect$bottom !== void 0 ? _rect$bottom : -Infinity, childRect.bottom);\n  });\n  rect.width = rect.right - rect.left;\n  rect.height = rect.bottom - rect.top;\n  rect.x = rect.left;\n  rect.y = rect.top;\n  return rect;\n}\nvar expando = 'Sortable' + new Date().getTime();\n\nfunction AnimationStateManager() {\n  var animationStates = [],\n    animationCallbackId;\n  return {\n    captureAnimationState: function captureAnimationState() {\n      animationStates = [];\n      if (!this.options.animation) return;\n      var children = [].slice.call(this.el.children);\n      children.forEach(function (child) {\n        if (css(child, 'display') === 'none' || child === Sortable.ghost) return;\n        animationStates.push({\n          target: child,\n          rect: getRect(child)\n        });\n        var fromRect = _objectSpread2({}, animationStates[animationStates.length - 1].rect);\n\n        // If animating: compensate for current animation\n        if (child.thisAnimationDuration) {\n          var childMatrix = matrix(child, true);\n          if (childMatrix) {\n            fromRect.top -= childMatrix.f;\n            fromRect.left -= childMatrix.e;\n          }\n        }\n        child.fromRect = fromRect;\n      });\n    },\n    addAnimationState: function addAnimationState(state) {\n      animationStates.push(state);\n    },\n    removeAnimationState: function removeAnimationState(target) {\n      animationStates.splice(indexOfObject(animationStates, {\n        target: target\n      }), 1);\n    },\n    animateAll: function animateAll(callback) {\n      var _this = this;\n      if (!this.options.animation) {\n        clearTimeout(animationCallbackId);\n        if (typeof callback === 'function') callback();\n        return;\n      }\n      var animating = false,\n        animationTime = 0;\n      animationStates.forEach(function (state) {\n        var time = 0,\n          target = state.target,\n          fromRect = target.fromRect,\n          toRect = getRect(target),\n          prevFromRect = target.prevFromRect,\n          prevToRect = target.prevToRect,\n          animatingRect = state.rect,\n          targetMatrix = matrix(target, true);\n        if (targetMatrix) {\n          // Compensate for current animation\n          toRect.top -= targetMatrix.f;\n          toRect.left -= targetMatrix.e;\n        }\n        target.toRect = toRect;\n        if (target.thisAnimationDuration) {\n          // Could also check if animatingRect is between fromRect and toRect\n          if (isRectEqual(prevFromRect, toRect) && !isRectEqual(fromRect, toRect) &&\n          // Make sure animatingRect is on line between toRect & fromRect\n          (animatingRect.top - toRect.top) / (animatingRect.left - toRect.left) === (fromRect.top - toRect.top) / (fromRect.left - toRect.left)) {\n            // If returning to same place as started from animation and on same axis\n            time = calculateRealTime(animatingRect, prevFromRect, prevToRect, _this.options);\n          }\n        }\n\n        // if fromRect != toRect: animate\n        if (!isRectEqual(toRect, fromRect)) {\n          target.prevFromRect = fromRect;\n          target.prevToRect = toRect;\n          if (!time) {\n            time = _this.options.animation;\n          }\n          _this.animate(target, animatingRect, toRect, time);\n        }\n        if (time) {\n          animating = true;\n          animationTime = Math.max(animationTime, time);\n          clearTimeout(target.animationResetTimer);\n          target.animationResetTimer = setTimeout(function () {\n            target.animationTime = 0;\n            target.prevFromRect = null;\n            target.fromRect = null;\n            target.prevToRect = null;\n            target.thisAnimationDuration = null;\n          }, time);\n          target.thisAnimationDuration = time;\n        }\n      });\n      clearTimeout(animationCallbackId);\n      if (!animating) {\n        if (typeof callback === 'function') callback();\n      } else {\n        animationCallbackId = setTimeout(function () {\n          if (typeof callback === 'function') callback();\n        }, animationTime);\n      }\n      animationStates = [];\n    },\n    animate: function animate(target, currentRect, toRect, duration) {\n      if (duration) {\n        css(target, 'transition', '');\n        css(target, 'transform', '');\n        var elMatrix = matrix(this.el),\n          scaleX = elMatrix && elMatrix.a,\n          scaleY = elMatrix && elMatrix.d,\n          translateX = (currentRect.left - toRect.left) / (scaleX || 1),\n          translateY = (currentRect.top - toRect.top) / (scaleY || 1);\n        target.animatingX = !!translateX;\n        target.animatingY = !!translateY;\n        css(target, 'transform', 'translate3d(' + translateX + 'px,' + translateY + 'px,0)');\n        this.forRepaintDummy = repaint(target); // repaint\n\n        css(target, 'transition', 'transform ' + duration + 'ms' + (this.options.easing ? ' ' + this.options.easing : ''));\n        css(target, 'transform', 'translate3d(0,0,0)');\n        typeof target.animated === 'number' && clearTimeout(target.animated);\n        target.animated = setTimeout(function () {\n          css(target, 'transition', '');\n          css(target, 'transform', '');\n          target.animated = false;\n          target.animatingX = false;\n          target.animatingY = false;\n        }, duration);\n      }\n    }\n  };\n}\nfunction repaint(target) {\n  return target.offsetWidth;\n}\nfunction calculateRealTime(animatingRect, fromRect, toRect, options) {\n  return Math.sqrt(Math.pow(fromRect.top - animatingRect.top, 2) + Math.pow(fromRect.left - animatingRect.left, 2)) / Math.sqrt(Math.pow(fromRect.top - toRect.top, 2) + Math.pow(fromRect.left - toRect.left, 2)) * options.animation;\n}\n\nvar plugins = [];\nvar defaults = {\n  initializeByDefault: true\n};\nvar PluginManager = {\n  mount: function mount(plugin) {\n    // Set default static properties\n    for (var option in defaults) {\n      if (defaults.hasOwnProperty(option) && !(option in plugin)) {\n        plugin[option] = defaults[option];\n      }\n    }\n    plugins.forEach(function (p) {\n      if (p.pluginName === plugin.pluginName) {\n        throw \"Sortable: Cannot mount plugin \".concat(plugin.pluginName, \" more than once\");\n      }\n    });\n    plugins.push(plugin);\n  },\n  pluginEvent: function pluginEvent(eventName, sortable, evt) {\n    var _this = this;\n    this.eventCanceled = false;\n    evt.cancel = function () {\n      _this.eventCanceled = true;\n    };\n    var eventNameGlobal = eventName + 'Global';\n    plugins.forEach(function (plugin) {\n      if (!sortable[plugin.pluginName]) return;\n      // Fire global events if it exists in this sortable\n      if (sortable[plugin.pluginName][eventNameGlobal]) {\n        sortable[plugin.pluginName][eventNameGlobal](_objectSpread2({\n          sortable: sortable\n        }, evt));\n      }\n\n      // Only fire plugin event if plugin is enabled in this sortable,\n      // and plugin has event defined\n      if (sortable.options[plugin.pluginName] && sortable[plugin.pluginName][eventName]) {\n        sortable[plugin.pluginName][eventName](_objectSpread2({\n          sortable: sortable\n        }, evt));\n      }\n    });\n  },\n  initializePlugins: function initializePlugins(sortable, el, defaults, options) {\n    plugins.forEach(function (plugin) {\n      var pluginName = plugin.pluginName;\n      if (!sortable.options[pluginName] && !plugin.initializeByDefault) return;\n      var initialized = new plugin(sortable, el, sortable.options);\n      initialized.sortable = sortable;\n      initialized.options = sortable.options;\n      sortable[pluginName] = initialized;\n\n      // Add default options from plugin\n      _extends(defaults, initialized.defaults);\n    });\n    for (var option in sortable.options) {\n      if (!sortable.options.hasOwnProperty(option)) continue;\n      var modified = this.modifyOption(sortable, option, sortable.options[option]);\n      if (typeof modified !== 'undefined') {\n        sortable.options[option] = modified;\n      }\n    }\n  },\n  getEventProperties: function getEventProperties(name, sortable) {\n    var eventProperties = {};\n    plugins.forEach(function (plugin) {\n      if (typeof plugin.eventProperties !== 'function') return;\n      _extends(eventProperties, plugin.eventProperties.call(sortable[plugin.pluginName], name));\n    });\n    return eventProperties;\n  },\n  modifyOption: function modifyOption(sortable, name, value) {\n    var modifiedValue;\n    plugins.forEach(function (plugin) {\n      // Plugin must exist on the Sortable\n      if (!sortable[plugin.pluginName]) return;\n\n      // If static option listener exists for this option, call in the context of the Sortable's instance of this plugin\n      if (plugin.optionListeners && typeof plugin.optionListeners[name] === 'function') {\n        modifiedValue = plugin.optionListeners[name].call(sortable[plugin.pluginName], value);\n      }\n    });\n    return modifiedValue;\n  }\n};\n\nfunction dispatchEvent(_ref) {\n  var sortable = _ref.sortable,\n    rootEl = _ref.rootEl,\n    name = _ref.name,\n    targetEl = _ref.targetEl,\n    cloneEl = _ref.cloneEl,\n    toEl = _ref.toEl,\n    fromEl = _ref.fromEl,\n    oldIndex = _ref.oldIndex,\n    newIndex = _ref.newIndex,\n    oldDraggableIndex = _ref.oldDraggableIndex,\n    newDraggableIndex = _ref.newDraggableIndex,\n    originalEvent = _ref.originalEvent,\n    putSortable = _ref.putSortable,\n    extraEventProperties = _ref.extraEventProperties;\n  sortable = sortable || rootEl && rootEl[expando];\n  if (!sortable) return;\n  var evt,\n    options = sortable.options,\n    onName = 'on' + name.charAt(0).toUpperCase() + name.substr(1);\n  // Support for new CustomEvent feature\n  if (window.CustomEvent && !IE11OrLess && !Edge) {\n    evt = new CustomEvent(name, {\n      bubbles: true,\n      cancelable: true\n    });\n  } else {\n    evt = document.createEvent('Event');\n    evt.initEvent(name, true, true);\n  }\n  evt.to = toEl || rootEl;\n  evt.from = fromEl || rootEl;\n  evt.item = targetEl || rootEl;\n  evt.clone = cloneEl;\n  evt.oldIndex = oldIndex;\n  evt.newIndex = newIndex;\n  evt.oldDraggableIndex = oldDraggableIndex;\n  evt.newDraggableIndex = newDraggableIndex;\n  evt.originalEvent = originalEvent;\n  evt.pullMode = putSortable ? putSortable.lastPutMode : undefined;\n  var allEventProperties = _objectSpread2(_objectSpread2({}, extraEventProperties), PluginManager.getEventProperties(name, sortable));\n  for (var option in allEventProperties) {\n    evt[option] = allEventProperties[option];\n  }\n  if (rootEl) {\n    rootEl.dispatchEvent(evt);\n  }\n  if (options[onName]) {\n    options[onName].call(sortable, evt);\n  }\n}\n\nvar _excluded = [\"evt\"];\nvar pluginEvent = function pluginEvent(eventName, sortable) {\n  var _ref = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {},\n    originalEvent = _ref.evt,\n    data = _objectWithoutProperties(_ref, _excluded);\n  PluginManager.pluginEvent.bind(Sortable)(eventName, sortable, _objectSpread2({\n    dragEl: dragEl,\n    parentEl: parentEl,\n    ghostEl: ghostEl,\n    rootEl: rootEl,\n    nextEl: nextEl,\n    lastDownEl: lastDownEl,\n    cloneEl: cloneEl,\n    cloneHidden: cloneHidden,\n    dragStarted: moved,\n    putSortable: putSortable,\n    activeSortable: Sortable.active,\n    originalEvent: originalEvent,\n    oldIndex: oldIndex,\n    oldDraggableIndex: oldDraggableIndex,\n    newIndex: newIndex,\n    newDraggableIndex: newDraggableIndex,\n    hideGhostForTarget: _hideGhostForTarget,\n    unhideGhostForTarget: _unhideGhostForTarget,\n    cloneNowHidden: function cloneNowHidden() {\n      cloneHidden = true;\n    },\n    cloneNowShown: function cloneNowShown() {\n      cloneHidden = false;\n    },\n    dispatchSortableEvent: function dispatchSortableEvent(name) {\n      _dispatchEvent({\n        sortable: sortable,\n        name: name,\n        originalEvent: originalEvent\n      });\n    }\n  }, data));\n};\nfunction _dispatchEvent(info) {\n  dispatchEvent(_objectSpread2({\n    putSortable: putSortable,\n    cloneEl: cloneEl,\n    targetEl: dragEl,\n    rootEl: rootEl,\n    oldIndex: oldIndex,\n    oldDraggableIndex: oldDraggableIndex,\n    newIndex: newIndex,\n    newDraggableIndex: newDraggableIndex\n  }, info));\n}\nvar dragEl,\n  parentEl,\n  ghostEl,\n  rootEl,\n  nextEl,\n  lastDownEl,\n  cloneEl,\n  cloneHidden,\n  oldIndex,\n  newIndex,\n  oldDraggableIndex,\n  newDraggableIndex,\n  activeGroup,\n  putSortable,\n  awaitingDragStarted = false,\n  ignoreNextClick = false,\n  sortables = [],\n  tapEvt,\n  touchEvt,\n  lastDx,\n  lastDy,\n  tapDistanceLeft,\n  tapDistanceTop,\n  moved,\n  lastTarget,\n  lastDirection,\n  pastFirstInvertThresh = false,\n  isCircumstantialInvert = false,\n  targetMoveDistance,\n  // For positioning ghost absolutely\n  ghostRelativeParent,\n  ghostRelativeParentInitialScroll = [],\n  // (left, top)\n\n  _silent = false,\n  savedInputChecked = [];\n\n/** @const */\nvar documentExists = typeof document !== 'undefined',\n  PositionGhostAbsolutely = IOS,\n  CSSFloatProperty = Edge || IE11OrLess ? 'cssFloat' : 'float',\n  // This will not pass for IE9, because IE9 DnD only works on anchors\n  supportDraggable = documentExists && !ChromeForAndroid && !IOS && 'draggable' in document.createElement('div'),\n  supportCssPointerEvents = function () {\n    if (!documentExists) return;\n    // false when <= IE11\n    if (IE11OrLess) {\n      return false;\n    }\n    var el = document.createElement('x');\n    el.style.cssText = 'pointer-events:auto';\n    return el.style.pointerEvents === 'auto';\n  }(),\n  _detectDirection = function _detectDirection(el, options) {\n    var elCSS = css(el),\n      elWidth = parseInt(elCSS.width) - parseInt(elCSS.paddingLeft) - parseInt(elCSS.paddingRight) - parseInt(elCSS.borderLeftWidth) - parseInt(elCSS.borderRightWidth),\n      child1 = getChild(el, 0, options),\n      child2 = getChild(el, 1, options),\n      firstChildCSS = child1 && css(child1),\n      secondChildCSS = child2 && css(child2),\n      firstChildWidth = firstChildCSS && parseInt(firstChildCSS.marginLeft) + parseInt(firstChildCSS.marginRight) + getRect(child1).width,\n      secondChildWidth = secondChildCSS && parseInt(secondChildCSS.marginLeft) + parseInt(secondChildCSS.marginRight) + getRect(child2).width;\n    if (elCSS.display === 'flex') {\n      return elCSS.flexDirection === 'column' || elCSS.flexDirection === 'column-reverse' ? 'vertical' : 'horizontal';\n    }\n    if (elCSS.display === 'grid') {\n      return elCSS.gridTemplateColumns.split(' ').length <= 1 ? 'vertical' : 'horizontal';\n    }\n    if (child1 && firstChildCSS[\"float\"] && firstChildCSS[\"float\"] !== 'none') {\n      var touchingSideChild2 = firstChildCSS[\"float\"] === 'left' ? 'left' : 'right';\n      return child2 && (secondChildCSS.clear === 'both' || secondChildCSS.clear === touchingSideChild2) ? 'vertical' : 'horizontal';\n    }\n    return child1 && (firstChildCSS.display === 'block' || firstChildCSS.display === 'flex' || firstChildCSS.display === 'table' || firstChildCSS.display === 'grid' || firstChildWidth >= elWidth && elCSS[CSSFloatProperty] === 'none' || child2 && elCSS[CSSFloatProperty] === 'none' && firstChildWidth + secondChildWidth > elWidth) ? 'vertical' : 'horizontal';\n  },\n  _dragElInRowColumn = function _dragElInRowColumn(dragRect, targetRect, vertical) {\n    var dragElS1Opp = vertical ? dragRect.left : dragRect.top,\n      dragElS2Opp = vertical ? dragRect.right : dragRect.bottom,\n      dragElOppLength = vertical ? dragRect.width : dragRect.height,\n      targetS1Opp = vertical ? targetRect.left : targetRect.top,\n      targetS2Opp = vertical ? targetRect.right : targetRect.bottom,\n      targetOppLength = vertical ? targetRect.width : targetRect.height;\n    return dragElS1Opp === targetS1Opp || dragElS2Opp === targetS2Opp || dragElS1Opp + dragElOppLength / 2 === targetS1Opp + targetOppLength / 2;\n  },\n  /**\r\n   * Detects first nearest empty sortable to X and Y position using emptyInsertThreshold.\r\n   * @param  {Number} x      X position\r\n   * @param  {Number} y      Y position\r\n   * @return {HTMLElement}   Element of the first found nearest Sortable\r\n   */\n  _detectNearestEmptySortable = function _detectNearestEmptySortable(x, y) {\n    var ret;\n    sortables.some(function (sortable) {\n      var threshold = sortable[expando].options.emptyInsertThreshold;\n      if (!threshold || lastChild(sortable)) return;\n      var rect = getRect(sortable),\n        insideHorizontally = x >= rect.left - threshold && x <= rect.right + threshold,\n        insideVertically = y >= rect.top - threshold && y <= rect.bottom + threshold;\n      if (insideHorizontally && insideVertically) {\n        return ret = sortable;\n      }\n    });\n    return ret;\n  },\n  _prepareGroup = function _prepareGroup(options) {\n    function toFn(value, pull) {\n      return function (to, from, dragEl, evt) {\n        var sameGroup = to.options.group.name && from.options.group.name && to.options.group.name === from.options.group.name;\n        if (value == null && (pull || sameGroup)) {\n          // Default pull value\n          // Default pull and put value if same group\n          return true;\n        } else if (value == null || value === false) {\n          return false;\n        } else if (pull && value === 'clone') {\n          return value;\n        } else if (typeof value === 'function') {\n          return toFn(value(to, from, dragEl, evt), pull)(to, from, dragEl, evt);\n        } else {\n          var otherGroup = (pull ? to : from).options.group.name;\n          return value === true || typeof value === 'string' && value === otherGroup || value.join && value.indexOf(otherGroup) > -1;\n        }\n      };\n    }\n    var group = {};\n    var originalGroup = options.group;\n    if (!originalGroup || _typeof(originalGroup) != 'object') {\n      originalGroup = {\n        name: originalGroup\n      };\n    }\n    group.name = originalGroup.name;\n    group.checkPull = toFn(originalGroup.pull, true);\n    group.checkPut = toFn(originalGroup.put);\n    group.revertClone = originalGroup.revertClone;\n    options.group = group;\n  },\n  _hideGhostForTarget = function _hideGhostForTarget() {\n    if (!supportCssPointerEvents && ghostEl) {\n      css(ghostEl, 'display', 'none');\n    }\n  },\n  _unhideGhostForTarget = function _unhideGhostForTarget() {\n    if (!supportCssPointerEvents && ghostEl) {\n      css(ghostEl, 'display', '');\n    }\n  };\n\n// #1184 fix - Prevent click event on fallback if dragged but item not changed position\nif (documentExists && !ChromeForAndroid) {\n  document.addEventListener('click', function (evt) {\n    if (ignoreNextClick) {\n      evt.preventDefault();\n      evt.stopPropagation && evt.stopPropagation();\n      evt.stopImmediatePropagation && evt.stopImmediatePropagation();\n      ignoreNextClick = false;\n      return false;\n    }\n  }, true);\n}\nvar nearestEmptyInsertDetectEvent = function nearestEmptyInsertDetectEvent(evt) {\n  if (dragEl) {\n    evt = evt.touches ? evt.touches[0] : evt;\n    var nearest = _detectNearestEmptySortable(evt.clientX, evt.clientY);\n    if (nearest) {\n      // Create imitation event\n      var event = {};\n      for (var i in evt) {\n        if (evt.hasOwnProperty(i)) {\n          event[i] = evt[i];\n        }\n      }\n      event.target = event.rootEl = nearest;\n      event.preventDefault = void 0;\n      event.stopPropagation = void 0;\n      nearest[expando]._onDragOver(event);\n    }\n  }\n};\nvar _checkOutsideTargetEl = function _checkOutsideTargetEl(evt) {\n  if (dragEl) {\n    dragEl.parentNode[expando]._isOutsideThisEl(evt.target);\n  }\n};\n\n/**\r\n * @class  Sortable\r\n * @param  {HTMLElement}  el\r\n * @param  {Object}       [options]\r\n */\nfunction Sortable(el, options) {\n  if (!(el && el.nodeType && el.nodeType === 1)) {\n    throw \"Sortable: `el` must be an HTMLElement, not \".concat({}.toString.call(el));\n  }\n  this.el = el; // root element\n  this.options = options = _extends({}, options);\n\n  // Export instance\n  el[expando] = this;\n  var defaults = {\n    group: null,\n    sort: true,\n    disabled: false,\n    store: null,\n    handle: null,\n    draggable: /^[uo]l$/i.test(el.nodeName) ? '>li' : '>*',\n    swapThreshold: 1,\n    // percentage; 0 <= x <= 1\n    invertSwap: false,\n    // invert always\n    invertedSwapThreshold: null,\n    // will be set to same as swapThreshold if default\n    removeCloneOnHide: true,\n    direction: function direction() {\n      return _detectDirection(el, this.options);\n    },\n    ghostClass: 'sortable-ghost',\n    chosenClass: 'sortable-chosen',\n    dragClass: 'sortable-drag',\n    ignore: 'a, img',\n    filter: null,\n    preventOnFilter: true,\n    animation: 0,\n    easing: null,\n    setData: function setData(dataTransfer, dragEl) {\n      dataTransfer.setData('Text', dragEl.textContent);\n    },\n    dropBubble: false,\n    dragoverBubble: false,\n    dataIdAttr: 'data-id',\n    delay: 0,\n    delayOnTouchOnly: false,\n    touchStartThreshold: (Number.parseInt ? Number : window).parseInt(window.devicePixelRatio, 10) || 1,\n    forceFallback: false,\n    fallbackClass: 'sortable-fallback',\n    fallbackOnBody: false,\n    fallbackTolerance: 0,\n    fallbackOffset: {\n      x: 0,\n      y: 0\n    },\n    // Disabled on Safari: #1571; Enabled on Safari IOS: #2244\n    supportPointer: Sortable.supportPointer !== false && 'PointerEvent' in window && (!Safari || IOS),\n    emptyInsertThreshold: 5\n  };\n  PluginManager.initializePlugins(this, el, defaults);\n\n  // Set default options\n  for (var name in defaults) {\n    !(name in options) && (options[name] = defaults[name]);\n  }\n  _prepareGroup(options);\n\n  // Bind all private methods\n  for (var fn in this) {\n    if (fn.charAt(0) === '_' && typeof this[fn] === 'function') {\n      this[fn] = this[fn].bind(this);\n    }\n  }\n\n  // Setup drag mode\n  this.nativeDraggable = options.forceFallback ? false : supportDraggable;\n  if (this.nativeDraggable) {\n    // Touch start threshold cannot be greater than the native dragstart threshold\n    this.options.touchStartThreshold = 1;\n  }\n\n  // Bind events\n  if (options.supportPointer) {\n    on(el, 'pointerdown', this._onTapStart);\n  } else {\n    on(el, 'mousedown', this._onTapStart);\n    on(el, 'touchstart', this._onTapStart);\n  }\n  if (this.nativeDraggable) {\n    on(el, 'dragover', this);\n    on(el, 'dragenter', this);\n  }\n  sortables.push(this.el);\n\n  // Restore sorting\n  options.store && options.store.get && this.sort(options.store.get(this) || []);\n\n  // Add animation state manager\n  _extends(this, AnimationStateManager());\n}\nSortable.prototype = /** @lends Sortable.prototype */{\n  constructor: Sortable,\n  _isOutsideThisEl: function _isOutsideThisEl(target) {\n    if (!this.el.contains(target) && target !== this.el) {\n      lastTarget = null;\n    }\n  },\n  _getDirection: function _getDirection(evt, target) {\n    return typeof this.options.direction === 'function' ? this.options.direction.call(this, evt, target, dragEl) : this.options.direction;\n  },\n  _onTapStart: function _onTapStart( /** Event|TouchEvent */evt) {\n    if (!evt.cancelable) return;\n    var _this = this,\n      el = this.el,\n      options = this.options,\n      preventOnFilter = options.preventOnFilter,\n      type = evt.type,\n      touch = evt.touches && evt.touches[0] || evt.pointerType && evt.pointerType === 'touch' && evt,\n      target = (touch || evt).target,\n      originalTarget = evt.target.shadowRoot && (evt.path && evt.path[0] || evt.composedPath && evt.composedPath()[0]) || target,\n      filter = options.filter;\n    _saveInputCheckedState(el);\n\n    // Don't trigger start event when an element is been dragged, otherwise the evt.oldindex always wrong when set option.group.\n    if (dragEl) {\n      return;\n    }\n    if (/mousedown|pointerdown/.test(type) && evt.button !== 0 || options.disabled) {\n      return; // only left button and enabled\n    }\n\n    // cancel dnd if original target is content editable\n    if (originalTarget.isContentEditable) {\n      return;\n    }\n\n    // Safari ignores further event handling after mousedown\n    if (!this.nativeDraggable && Safari && target && target.tagName.toUpperCase() === 'SELECT') {\n      return;\n    }\n    target = closest(target, options.draggable, el, false);\n    if (target && target.animated) {\n      return;\n    }\n    if (lastDownEl === target) {\n      // Ignoring duplicate `down`\n      return;\n    }\n\n    // Get the index of the dragged element within its parent\n    oldIndex = index(target);\n    oldDraggableIndex = index(target, options.draggable);\n\n    // Check filter\n    if (typeof filter === 'function') {\n      if (filter.call(this, evt, target, this)) {\n        _dispatchEvent({\n          sortable: _this,\n          rootEl: originalTarget,\n          name: 'filter',\n          targetEl: target,\n          toEl: el,\n          fromEl: el\n        });\n        pluginEvent('filter', _this, {\n          evt: evt\n        });\n        preventOnFilter && evt.preventDefault();\n        return; // cancel dnd\n      }\n    } else if (filter) {\n      filter = filter.split(',').some(function (criteria) {\n        criteria = closest(originalTarget, criteria.trim(), el, false);\n        if (criteria) {\n          _dispatchEvent({\n            sortable: _this,\n            rootEl: criteria,\n            name: 'filter',\n            targetEl: target,\n            fromEl: el,\n            toEl: el\n          });\n          pluginEvent('filter', _this, {\n            evt: evt\n          });\n          return true;\n        }\n      });\n      if (filter) {\n        preventOnFilter && evt.preventDefault();\n        return; // cancel dnd\n      }\n    }\n    if (options.handle && !closest(originalTarget, options.handle, el, false)) {\n      return;\n    }\n\n    // Prepare `dragstart`\n    this._prepareDragStart(evt, touch, target);\n  },\n  _prepareDragStart: function _prepareDragStart( /** Event */evt, /** Touch */touch, /** HTMLElement */target) {\n    var _this = this,\n      el = _this.el,\n      options = _this.options,\n      ownerDocument = el.ownerDocument,\n      dragStartFn;\n    if (target && !dragEl && target.parentNode === el) {\n      var dragRect = getRect(target);\n      rootEl = el;\n      dragEl = target;\n      parentEl = dragEl.parentNode;\n      nextEl = dragEl.nextSibling;\n      lastDownEl = target;\n      activeGroup = options.group;\n      Sortable.dragged = dragEl;\n      tapEvt = {\n        target: dragEl,\n        clientX: (touch || evt).clientX,\n        clientY: (touch || evt).clientY\n      };\n      tapDistanceLeft = tapEvt.clientX - dragRect.left;\n      tapDistanceTop = tapEvt.clientY - dragRect.top;\n      this._lastX = (touch || evt).clientX;\n      this._lastY = (touch || evt).clientY;\n      dragEl.style['will-change'] = 'all';\n      dragStartFn = function dragStartFn() {\n        pluginEvent('delayEnded', _this, {\n          evt: evt\n        });\n        if (Sortable.eventCanceled) {\n          _this._onDrop();\n          return;\n        }\n        // Delayed drag has been triggered\n        // we can re-enable the events: touchmove/mousemove\n        _this._disableDelayedDragEvents();\n        if (!FireFox && _this.nativeDraggable) {\n          dragEl.draggable = true;\n        }\n\n        // Bind the events: dragstart/dragend\n        _this._triggerDragStart(evt, touch);\n\n        // Drag start event\n        _dispatchEvent({\n          sortable: _this,\n          name: 'choose',\n          originalEvent: evt\n        });\n\n        // Chosen item\n        toggleClass(dragEl, options.chosenClass, true);\n      };\n\n      // Disable \"draggable\"\n      options.ignore.split(',').forEach(function (criteria) {\n        find(dragEl, criteria.trim(), _disableDraggable);\n      });\n      on(ownerDocument, 'dragover', nearestEmptyInsertDetectEvent);\n      on(ownerDocument, 'mousemove', nearestEmptyInsertDetectEvent);\n      on(ownerDocument, 'touchmove', nearestEmptyInsertDetectEvent);\n      if (options.supportPointer) {\n        on(ownerDocument, 'pointerup', _this._onDrop);\n        // Native D&D triggers pointercancel\n        !this.nativeDraggable && on(ownerDocument, 'pointercancel', _this._onDrop);\n      } else {\n        on(ownerDocument, 'mouseup', _this._onDrop);\n        on(ownerDocument, 'touchend', _this._onDrop);\n        on(ownerDocument, 'touchcancel', _this._onDrop);\n      }\n\n      // Make dragEl draggable (must be before delay for FireFox)\n      if (FireFox && this.nativeDraggable) {\n        this.options.touchStartThreshold = 4;\n        dragEl.draggable = true;\n      }\n      pluginEvent('delayStart', this, {\n        evt: evt\n      });\n\n      // Delay is impossible for native DnD in Edge or IE\n      if (options.delay && (!options.delayOnTouchOnly || touch) && (!this.nativeDraggable || !(Edge || IE11OrLess))) {\n        if (Sortable.eventCanceled) {\n          this._onDrop();\n          return;\n        }\n        // If the user moves the pointer or let go the click or touch\n        // before the delay has been reached:\n        // disable the delayed drag\n        if (options.supportPointer) {\n          on(ownerDocument, 'pointerup', _this._disableDelayedDrag);\n          on(ownerDocument, 'pointercancel', _this._disableDelayedDrag);\n        } else {\n          on(ownerDocument, 'mouseup', _this._disableDelayedDrag);\n          on(ownerDocument, 'touchend', _this._disableDelayedDrag);\n          on(ownerDocument, 'touchcancel', _this._disableDelayedDrag);\n        }\n        on(ownerDocument, 'mousemove', _this._delayedDragTouchMoveHandler);\n        on(ownerDocument, 'touchmove', _this._delayedDragTouchMoveHandler);\n        options.supportPointer && on(ownerDocument, 'pointermove', _this._delayedDragTouchMoveHandler);\n        _this._dragStartTimer = setTimeout(dragStartFn, options.delay);\n      } else {\n        dragStartFn();\n      }\n    }\n  },\n  _delayedDragTouchMoveHandler: function _delayedDragTouchMoveHandler( /** TouchEvent|PointerEvent **/e) {\n    var touch = e.touches ? e.touches[0] : e;\n    if (Math.max(Math.abs(touch.clientX - this._lastX), Math.abs(touch.clientY - this._lastY)) >= Math.floor(this.options.touchStartThreshold / (this.nativeDraggable && window.devicePixelRatio || 1))) {\n      this._disableDelayedDrag();\n    }\n  },\n  _disableDelayedDrag: function _disableDelayedDrag() {\n    dragEl && _disableDraggable(dragEl);\n    clearTimeout(this._dragStartTimer);\n    this._disableDelayedDragEvents();\n  },\n  _disableDelayedDragEvents: function _disableDelayedDragEvents() {\n    var ownerDocument = this.el.ownerDocument;\n    off(ownerDocument, 'mouseup', this._disableDelayedDrag);\n    off(ownerDocument, 'touchend', this._disableDelayedDrag);\n    off(ownerDocument, 'touchcancel', this._disableDelayedDrag);\n    off(ownerDocument, 'pointerup', this._disableDelayedDrag);\n    off(ownerDocument, 'pointercancel', this._disableDelayedDrag);\n    off(ownerDocument, 'mousemove', this._delayedDragTouchMoveHandler);\n    off(ownerDocument, 'touchmove', this._delayedDragTouchMoveHandler);\n    off(ownerDocument, 'pointermove', this._delayedDragTouchMoveHandler);\n  },\n  _triggerDragStart: function _triggerDragStart( /** Event */evt, /** Touch */touch) {\n    touch = touch || evt.pointerType == 'touch' && evt;\n    if (!this.nativeDraggable || touch) {\n      if (this.options.supportPointer) {\n        on(document, 'pointermove', this._onTouchMove);\n      } else if (touch) {\n        on(document, 'touchmove', this._onTouchMove);\n      } else {\n        on(document, 'mousemove', this._onTouchMove);\n      }\n    } else {\n      on(dragEl, 'dragend', this);\n      on(rootEl, 'dragstart', this._onDragStart);\n    }\n    try {\n      if (document.selection) {\n        _nextTick(function () {\n          document.selection.empty();\n        });\n      } else {\n        window.getSelection().removeAllRanges();\n      }\n    } catch (err) {}\n  },\n  _dragStarted: function _dragStarted(fallback, evt) {\n    awaitingDragStarted = false;\n    if (rootEl && dragEl) {\n      pluginEvent('dragStarted', this, {\n        evt: evt\n      });\n      if (this.nativeDraggable) {\n        on(document, 'dragover', _checkOutsideTargetEl);\n      }\n      var options = this.options;\n\n      // Apply effect\n      !fallback && toggleClass(dragEl, options.dragClass, false);\n      toggleClass(dragEl, options.ghostClass, true);\n      Sortable.active = this;\n      fallback && this._appendGhost();\n\n      // Drag start event\n      _dispatchEvent({\n        sortable: this,\n        name: 'start',\n        originalEvent: evt\n      });\n    } else {\n      this._nulling();\n    }\n  },\n  _emulateDragOver: function _emulateDragOver() {\n    if (touchEvt) {\n      this._lastX = touchEvt.clientX;\n      this._lastY = touchEvt.clientY;\n      _hideGhostForTarget();\n      var target = document.elementFromPoint(touchEvt.clientX, touchEvt.clientY);\n      var parent = target;\n      while (target && target.shadowRoot) {\n        target = target.shadowRoot.elementFromPoint(touchEvt.clientX, touchEvt.clientY);\n        if (target === parent) break;\n        parent = target;\n      }\n      dragEl.parentNode[expando]._isOutsideThisEl(target);\n      if (parent) {\n        do {\n          if (parent[expando]) {\n            var inserted = void 0;\n            inserted = parent[expando]._onDragOver({\n              clientX: touchEvt.clientX,\n              clientY: touchEvt.clientY,\n              target: target,\n              rootEl: parent\n            });\n            if (inserted && !this.options.dragoverBubble) {\n              break;\n            }\n          }\n          target = parent; // store last element\n        }\n        /* jshint boss:true */ while (parent = getParentOrHost(parent));\n      }\n      _unhideGhostForTarget();\n    }\n  },\n  _onTouchMove: function _onTouchMove( /**TouchEvent*/evt) {\n    if (tapEvt) {\n      var options = this.options,\n        fallbackTolerance = options.fallbackTolerance,\n        fallbackOffset = options.fallbackOffset,\n        touch = evt.touches ? evt.touches[0] : evt,\n        ghostMatrix = ghostEl && matrix(ghostEl, true),\n        scaleX = ghostEl && ghostMatrix && ghostMatrix.a,\n        scaleY = ghostEl && ghostMatrix && ghostMatrix.d,\n        relativeScrollOffset = PositionGhostAbsolutely && ghostRelativeParent && getRelativeScrollOffset(ghostRelativeParent),\n        dx = (touch.clientX - tapEvt.clientX + fallbackOffset.x) / (scaleX || 1) + (relativeScrollOffset ? relativeScrollOffset[0] - ghostRelativeParentInitialScroll[0] : 0) / (scaleX || 1),\n        dy = (touch.clientY - tapEvt.clientY + fallbackOffset.y) / (scaleY || 1) + (relativeScrollOffset ? relativeScrollOffset[1] - ghostRelativeParentInitialScroll[1] : 0) / (scaleY || 1);\n\n      // only set the status to dragging, when we are actually dragging\n      if (!Sortable.active && !awaitingDragStarted) {\n        if (fallbackTolerance && Math.max(Math.abs(touch.clientX - this._lastX), Math.abs(touch.clientY - this._lastY)) < fallbackTolerance) {\n          return;\n        }\n        this._onDragStart(evt, true);\n      }\n      if (ghostEl) {\n        if (ghostMatrix) {\n          ghostMatrix.e += dx - (lastDx || 0);\n          ghostMatrix.f += dy - (lastDy || 0);\n        } else {\n          ghostMatrix = {\n            a: 1,\n            b: 0,\n            c: 0,\n            d: 1,\n            e: dx,\n            f: dy\n          };\n        }\n        var cssMatrix = \"matrix(\".concat(ghostMatrix.a, \",\").concat(ghostMatrix.b, \",\").concat(ghostMatrix.c, \",\").concat(ghostMatrix.d, \",\").concat(ghostMatrix.e, \",\").concat(ghostMatrix.f, \")\");\n        css(ghostEl, 'webkitTransform', cssMatrix);\n        css(ghostEl, 'mozTransform', cssMatrix);\n        css(ghostEl, 'msTransform', cssMatrix);\n        css(ghostEl, 'transform', cssMatrix);\n        lastDx = dx;\n        lastDy = dy;\n        touchEvt = touch;\n      }\n      evt.cancelable && evt.preventDefault();\n    }\n  },\n  _appendGhost: function _appendGhost() {\n    // Bug if using scale(): https://stackoverflow.com/questions/2637058\n    // Not being adjusted for\n    if (!ghostEl) {\n      var container = this.options.fallbackOnBody ? document.body : rootEl,\n        rect = getRect(dragEl, true, PositionGhostAbsolutely, true, container),\n        options = this.options;\n\n      // Position absolutely\n      if (PositionGhostAbsolutely) {\n        // Get relatively positioned parent\n        ghostRelativeParent = container;\n        while (css(ghostRelativeParent, 'position') === 'static' && css(ghostRelativeParent, 'transform') === 'none' && ghostRelativeParent !== document) {\n          ghostRelativeParent = ghostRelativeParent.parentNode;\n        }\n        if (ghostRelativeParent !== document.body && ghostRelativeParent !== document.documentElement) {\n          if (ghostRelativeParent === document) ghostRelativeParent = getWindowScrollingElement();\n          rect.top += ghostRelativeParent.scrollTop;\n          rect.left += ghostRelativeParent.scrollLeft;\n        } else {\n          ghostRelativeParent = getWindowScrollingElement();\n        }\n        ghostRelativeParentInitialScroll = getRelativeScrollOffset(ghostRelativeParent);\n      }\n      ghostEl = dragEl.cloneNode(true);\n      toggleClass(ghostEl, options.ghostClass, false);\n      toggleClass(ghostEl, options.fallbackClass, true);\n      toggleClass(ghostEl, options.dragClass, true);\n      css(ghostEl, 'transition', '');\n      css(ghostEl, 'transform', '');\n      css(ghostEl, 'box-sizing', 'border-box');\n      css(ghostEl, 'margin', 0);\n      css(ghostEl, 'top', rect.top);\n      css(ghostEl, 'left', rect.left);\n      css(ghostEl, 'width', rect.width);\n      css(ghostEl, 'height', rect.height);\n      css(ghostEl, 'opacity', '0.8');\n      css(ghostEl, 'position', PositionGhostAbsolutely ? 'absolute' : 'fixed');\n      css(ghostEl, 'zIndex', '100000');\n      css(ghostEl, 'pointerEvents', 'none');\n      Sortable.ghost = ghostEl;\n      container.appendChild(ghostEl);\n\n      // Set transform-origin\n      css(ghostEl, 'transform-origin', tapDistanceLeft / parseInt(ghostEl.style.width) * 100 + '% ' + tapDistanceTop / parseInt(ghostEl.style.height) * 100 + '%');\n    }\n  },\n  _onDragStart: function _onDragStart( /**Event*/evt, /**boolean*/fallback) {\n    var _this = this;\n    var dataTransfer = evt.dataTransfer;\n    var options = _this.options;\n    pluginEvent('dragStart', this, {\n      evt: evt\n    });\n    if (Sortable.eventCanceled) {\n      this._onDrop();\n      return;\n    }\n    pluginEvent('setupClone', this);\n    if (!Sortable.eventCanceled) {\n      cloneEl = clone(dragEl);\n      cloneEl.removeAttribute(\"id\");\n      cloneEl.draggable = false;\n      cloneEl.style['will-change'] = '';\n      this._hideClone();\n      toggleClass(cloneEl, this.options.chosenClass, false);\n      Sortable.clone = cloneEl;\n    }\n\n    // #1143: IFrame support workaround\n    _this.cloneId = _nextTick(function () {\n      pluginEvent('clone', _this);\n      if (Sortable.eventCanceled) return;\n      if (!_this.options.removeCloneOnHide) {\n        rootEl.insertBefore(cloneEl, dragEl);\n      }\n      _this._hideClone();\n      _dispatchEvent({\n        sortable: _this,\n        name: 'clone'\n      });\n    });\n    !fallback && toggleClass(dragEl, options.dragClass, true);\n\n    // Set proper drop events\n    if (fallback) {\n      ignoreNextClick = true;\n      _this._loopId = setInterval(_this._emulateDragOver, 50);\n    } else {\n      // Undo what was set in _prepareDragStart before drag started\n      off(document, 'mouseup', _this._onDrop);\n      off(document, 'touchend', _this._onDrop);\n      off(document, 'touchcancel', _this._onDrop);\n      if (dataTransfer) {\n        dataTransfer.effectAllowed = 'move';\n        options.setData && options.setData.call(_this, dataTransfer, dragEl);\n      }\n      on(document, 'drop', _this);\n\n      // #1276 fix:\n      css(dragEl, 'transform', 'translateZ(0)');\n    }\n    awaitingDragStarted = true;\n    _this._dragStartId = _nextTick(_this._dragStarted.bind(_this, fallback, evt));\n    on(document, 'selectstart', _this);\n    moved = true;\n    window.getSelection().removeAllRanges();\n    if (Safari) {\n      css(document.body, 'user-select', 'none');\n    }\n  },\n  // Returns true - if no further action is needed (either inserted or another condition)\n  _onDragOver: function _onDragOver( /**Event*/evt) {\n    var el = this.el,\n      target = evt.target,\n      dragRect,\n      targetRect,\n      revert,\n      options = this.options,\n      group = options.group,\n      activeSortable = Sortable.active,\n      isOwner = activeGroup === group,\n      canSort = options.sort,\n      fromSortable = putSortable || activeSortable,\n      vertical,\n      _this = this,\n      completedFired = false;\n    if (_silent) return;\n    function dragOverEvent(name, extra) {\n      pluginEvent(name, _this, _objectSpread2({\n        evt: evt,\n        isOwner: isOwner,\n        axis: vertical ? 'vertical' : 'horizontal',\n        revert: revert,\n        dragRect: dragRect,\n        targetRect: targetRect,\n        canSort: canSort,\n        fromSortable: fromSortable,\n        target: target,\n        completed: completed,\n        onMove: function onMove(target, after) {\n          return _onMove(rootEl, el, dragEl, dragRect, target, getRect(target), evt, after);\n        },\n        changed: changed\n      }, extra));\n    }\n\n    // Capture animation state\n    function capture() {\n      dragOverEvent('dragOverAnimationCapture');\n      _this.captureAnimationState();\n      if (_this !== fromSortable) {\n        fromSortable.captureAnimationState();\n      }\n    }\n\n    // Return invocation when dragEl is inserted (or completed)\n    function completed(insertion) {\n      dragOverEvent('dragOverCompleted', {\n        insertion: insertion\n      });\n      if (insertion) {\n        // Clones must be hidden before folding animation to capture dragRectAbsolute properly\n        if (isOwner) {\n          activeSortable._hideClone();\n        } else {\n          activeSortable._showClone(_this);\n        }\n        if (_this !== fromSortable) {\n          // Set ghost class to new sortable's ghost class\n          toggleClass(dragEl, putSortable ? putSortable.options.ghostClass : activeSortable.options.ghostClass, false);\n          toggleClass(dragEl, options.ghostClass, true);\n        }\n        if (putSortable !== _this && _this !== Sortable.active) {\n          putSortable = _this;\n        } else if (_this === Sortable.active && putSortable) {\n          putSortable = null;\n        }\n\n        // Animation\n        if (fromSortable === _this) {\n          _this._ignoreWhileAnimating = target;\n        }\n        _this.animateAll(function () {\n          dragOverEvent('dragOverAnimationComplete');\n          _this._ignoreWhileAnimating = null;\n        });\n        if (_this !== fromSortable) {\n          fromSortable.animateAll();\n          fromSortable._ignoreWhileAnimating = null;\n        }\n      }\n\n      // Null lastTarget if it is not inside a previously swapped element\n      if (target === dragEl && !dragEl.animated || target === el && !target.animated) {\n        lastTarget = null;\n      }\n\n      // no bubbling and not fallback\n      if (!options.dragoverBubble && !evt.rootEl && target !== document) {\n        dragEl.parentNode[expando]._isOutsideThisEl(evt.target);\n\n        // Do not detect for empty insert if already inserted\n        !insertion && nearestEmptyInsertDetectEvent(evt);\n      }\n      !options.dragoverBubble && evt.stopPropagation && evt.stopPropagation();\n      return completedFired = true;\n    }\n\n    // Call when dragEl has been inserted\n    function changed() {\n      newIndex = index(dragEl);\n      newDraggableIndex = index(dragEl, options.draggable);\n      _dispatchEvent({\n        sortable: _this,\n        name: 'change',\n        toEl: el,\n        newIndex: newIndex,\n        newDraggableIndex: newDraggableIndex,\n        originalEvent: evt\n      });\n    }\n    if (evt.preventDefault !== void 0) {\n      evt.cancelable && evt.preventDefault();\n    }\n    target = closest(target, options.draggable, el, true);\n    dragOverEvent('dragOver');\n    if (Sortable.eventCanceled) return completedFired;\n    if (dragEl.contains(evt.target) || target.animated && target.animatingX && target.animatingY || _this._ignoreWhileAnimating === target) {\n      return completed(false);\n    }\n    ignoreNextClick = false;\n    if (activeSortable && !options.disabled && (isOwner ? canSort || (revert = parentEl !== rootEl) // Reverting item into the original list\n    : putSortable === this || (this.lastPutMode = activeGroup.checkPull(this, activeSortable, dragEl, evt)) && group.checkPut(this, activeSortable, dragEl, evt))) {\n      vertical = this._getDirection(evt, target) === 'vertical';\n      dragRect = getRect(dragEl);\n      dragOverEvent('dragOverValid');\n      if (Sortable.eventCanceled) return completedFired;\n      if (revert) {\n        parentEl = rootEl; // actualization\n        capture();\n        this._hideClone();\n        dragOverEvent('revert');\n        if (!Sortable.eventCanceled) {\n          if (nextEl) {\n            rootEl.insertBefore(dragEl, nextEl);\n          } else {\n            rootEl.appendChild(dragEl);\n          }\n        }\n        return completed(true);\n      }\n      var elLastChild = lastChild(el, options.draggable);\n      if (!elLastChild || _ghostIsLast(evt, vertical, this) && !elLastChild.animated) {\n        // Insert to end of list\n\n        // If already at end of list: Do not insert\n        if (elLastChild === dragEl) {\n          return completed(false);\n        }\n\n        // if there is a last element, it is the target\n        if (elLastChild && el === evt.target) {\n          target = elLastChild;\n        }\n        if (target) {\n          targetRect = getRect(target);\n        }\n        if (_onMove(rootEl, el, dragEl, dragRect, target, targetRect, evt, !!target) !== false) {\n          capture();\n          if (elLastChild && elLastChild.nextSibling) {\n            // the last draggable element is not the last node\n            el.insertBefore(dragEl, elLastChild.nextSibling);\n          } else {\n            el.appendChild(dragEl);\n          }\n          parentEl = el; // actualization\n\n          changed();\n          return completed(true);\n        }\n      } else if (elLastChild && _ghostIsFirst(evt, vertical, this)) {\n        // Insert to start of list\n        var firstChild = getChild(el, 0, options, true);\n        if (firstChild === dragEl) {\n          return completed(false);\n        }\n        target = firstChild;\n        targetRect = getRect(target);\n        if (_onMove(rootEl, el, dragEl, dragRect, target, targetRect, evt, false) !== false) {\n          capture();\n          el.insertBefore(dragEl, firstChild);\n          parentEl = el; // actualization\n\n          changed();\n          return completed(true);\n        }\n      } else if (target.parentNode === el) {\n        targetRect = getRect(target);\n        var direction = 0,\n          targetBeforeFirstSwap,\n          differentLevel = dragEl.parentNode !== el,\n          differentRowCol = !_dragElInRowColumn(dragEl.animated && dragEl.toRect || dragRect, target.animated && target.toRect || targetRect, vertical),\n          side1 = vertical ? 'top' : 'left',\n          scrolledPastTop = isScrolledPast(target, 'top', 'top') || isScrolledPast(dragEl, 'top', 'top'),\n          scrollBefore = scrolledPastTop ? scrolledPastTop.scrollTop : void 0;\n        if (lastTarget !== target) {\n          targetBeforeFirstSwap = targetRect[side1];\n          pastFirstInvertThresh = false;\n          isCircumstantialInvert = !differentRowCol && options.invertSwap || differentLevel;\n        }\n        direction = _getSwapDirection(evt, target, targetRect, vertical, differentRowCol ? 1 : options.swapThreshold, options.invertedSwapThreshold == null ? options.swapThreshold : options.invertedSwapThreshold, isCircumstantialInvert, lastTarget === target);\n        var sibling;\n        if (direction !== 0) {\n          // Check if target is beside dragEl in respective direction (ignoring hidden elements)\n          var dragIndex = index(dragEl);\n          do {\n            dragIndex -= direction;\n            sibling = parentEl.children[dragIndex];\n          } while (sibling && (css(sibling, 'display') === 'none' || sibling === ghostEl));\n        }\n        // If dragEl is already beside target: Do not insert\n        if (direction === 0 || sibling === target) {\n          return completed(false);\n        }\n        lastTarget = target;\n        lastDirection = direction;\n        var nextSibling = target.nextElementSibling,\n          after = false;\n        after = direction === 1;\n        var moveVector = _onMove(rootEl, el, dragEl, dragRect, target, targetRect, evt, after);\n        if (moveVector !== false) {\n          if (moveVector === 1 || moveVector === -1) {\n            after = moveVector === 1;\n          }\n          _silent = true;\n          setTimeout(_unsilent, 30);\n          capture();\n          if (after && !nextSibling) {\n            el.appendChild(dragEl);\n          } else {\n            target.parentNode.insertBefore(dragEl, after ? nextSibling : target);\n          }\n\n          // Undo chrome's scroll adjustment (has no effect on other browsers)\n          if (scrolledPastTop) {\n            scrollBy(scrolledPastTop, 0, scrollBefore - scrolledPastTop.scrollTop);\n          }\n          parentEl = dragEl.parentNode; // actualization\n\n          // must be done before animation\n          if (targetBeforeFirstSwap !== undefined && !isCircumstantialInvert) {\n            targetMoveDistance = Math.abs(targetBeforeFirstSwap - getRect(target)[side1]);\n          }\n          changed();\n          return completed(true);\n        }\n      }\n      if (el.contains(dragEl)) {\n        return completed(false);\n      }\n    }\n    return false;\n  },\n  _ignoreWhileAnimating: null,\n  _offMoveEvents: function _offMoveEvents() {\n    off(document, 'mousemove', this._onTouchMove);\n    off(document, 'touchmove', this._onTouchMove);\n    off(document, 'pointermove', this._onTouchMove);\n    off(document, 'dragover', nearestEmptyInsertDetectEvent);\n    off(document, 'mousemove', nearestEmptyInsertDetectEvent);\n    off(document, 'touchmove', nearestEmptyInsertDetectEvent);\n  },\n  _offUpEvents: function _offUpEvents() {\n    var ownerDocument = this.el.ownerDocument;\n    off(ownerDocument, 'mouseup', this._onDrop);\n    off(ownerDocument, 'touchend', this._onDrop);\n    off(ownerDocument, 'pointerup', this._onDrop);\n    off(ownerDocument, 'pointercancel', this._onDrop);\n    off(ownerDocument, 'touchcancel', this._onDrop);\n    off(document, 'selectstart', this);\n  },\n  _onDrop: function _onDrop( /**Event*/evt) {\n    var el = this.el,\n      options = this.options;\n\n    // Get the index of the dragged element within its parent\n    newIndex = index(dragEl);\n    newDraggableIndex = index(dragEl, options.draggable);\n    pluginEvent('drop', this, {\n      evt: evt\n    });\n    parentEl = dragEl && dragEl.parentNode;\n\n    // Get again after plugin event\n    newIndex = index(dragEl);\n    newDraggableIndex = index(dragEl, options.draggable);\n    if (Sortable.eventCanceled) {\n      this._nulling();\n      return;\n    }\n    awaitingDragStarted = false;\n    isCircumstantialInvert = false;\n    pastFirstInvertThresh = false;\n    clearInterval(this._loopId);\n    clearTimeout(this._dragStartTimer);\n    _cancelNextTick(this.cloneId);\n    _cancelNextTick(this._dragStartId);\n\n    // Unbind events\n    if (this.nativeDraggable) {\n      off(document, 'drop', this);\n      off(el, 'dragstart', this._onDragStart);\n    }\n    this._offMoveEvents();\n    this._offUpEvents();\n    if (Safari) {\n      css(document.body, 'user-select', '');\n    }\n    css(dragEl, 'transform', '');\n    if (evt) {\n      if (moved) {\n        evt.cancelable && evt.preventDefault();\n        !options.dropBubble && evt.stopPropagation();\n      }\n      ghostEl && ghostEl.parentNode && ghostEl.parentNode.removeChild(ghostEl);\n      if (rootEl === parentEl || putSortable && putSortable.lastPutMode !== 'clone') {\n        // Remove clone(s)\n        cloneEl && cloneEl.parentNode && cloneEl.parentNode.removeChild(cloneEl);\n      }\n      if (dragEl) {\n        if (this.nativeDraggable) {\n          off(dragEl, 'dragend', this);\n        }\n        _disableDraggable(dragEl);\n        dragEl.style['will-change'] = '';\n\n        // Remove classes\n        // ghostClass is added in dragStarted\n        if (moved && !awaitingDragStarted) {\n          toggleClass(dragEl, putSortable ? putSortable.options.ghostClass : this.options.ghostClass, false);\n        }\n        toggleClass(dragEl, this.options.chosenClass, false);\n\n        // Drag stop event\n        _dispatchEvent({\n          sortable: this,\n          name: 'unchoose',\n          toEl: parentEl,\n          newIndex: null,\n          newDraggableIndex: null,\n          originalEvent: evt\n        });\n        if (rootEl !== parentEl) {\n          if (newIndex >= 0) {\n            // Add event\n            _dispatchEvent({\n              rootEl: parentEl,\n              name: 'add',\n              toEl: parentEl,\n              fromEl: rootEl,\n              originalEvent: evt\n            });\n\n            // Remove event\n            _dispatchEvent({\n              sortable: this,\n              name: 'remove',\n              toEl: parentEl,\n              originalEvent: evt\n            });\n\n            // drag from one list and drop into another\n            _dispatchEvent({\n              rootEl: parentEl,\n              name: 'sort',\n              toEl: parentEl,\n              fromEl: rootEl,\n              originalEvent: evt\n            });\n            _dispatchEvent({\n              sortable: this,\n              name: 'sort',\n              toEl: parentEl,\n              originalEvent: evt\n            });\n          }\n          putSortable && putSortable.save();\n        } else {\n          if (newIndex !== oldIndex) {\n            if (newIndex >= 0) {\n              // drag & drop within the same list\n              _dispatchEvent({\n                sortable: this,\n                name: 'update',\n                toEl: parentEl,\n                originalEvent: evt\n              });\n              _dispatchEvent({\n                sortable: this,\n                name: 'sort',\n                toEl: parentEl,\n                originalEvent: evt\n              });\n            }\n          }\n        }\n        if (Sortable.active) {\n          /* jshint eqnull:true */\n          if (newIndex == null || newIndex === -1) {\n            newIndex = oldIndex;\n            newDraggableIndex = oldDraggableIndex;\n          }\n          _dispatchEvent({\n            sortable: this,\n            name: 'end',\n            toEl: parentEl,\n            originalEvent: evt\n          });\n\n          // Save sorting\n          this.save();\n        }\n      }\n    }\n    this._nulling();\n  },\n  _nulling: function _nulling() {\n    pluginEvent('nulling', this);\n    rootEl = dragEl = parentEl = ghostEl = nextEl = cloneEl = lastDownEl = cloneHidden = tapEvt = touchEvt = moved = newIndex = newDraggableIndex = oldIndex = oldDraggableIndex = lastTarget = lastDirection = putSortable = activeGroup = Sortable.dragged = Sortable.ghost = Sortable.clone = Sortable.active = null;\n    savedInputChecked.forEach(function (el) {\n      el.checked = true;\n    });\n    savedInputChecked.length = lastDx = lastDy = 0;\n  },\n  handleEvent: function handleEvent( /**Event*/evt) {\n    switch (evt.type) {\n      case 'drop':\n      case 'dragend':\n        this._onDrop(evt);\n        break;\n      case 'dragenter':\n      case 'dragover':\n        if (dragEl) {\n          this._onDragOver(evt);\n          _globalDragOver(evt);\n        }\n        break;\n      case 'selectstart':\n        evt.preventDefault();\n        break;\n    }\n  },\n  /**\r\n   * Serializes the item into an array of string.\r\n   * @returns {String[]}\r\n   */\n  toArray: function toArray() {\n    var order = [],\n      el,\n      children = this.el.children,\n      i = 0,\n      n = children.length,\n      options = this.options;\n    for (; i < n; i++) {\n      el = children[i];\n      if (closest(el, options.draggable, this.el, false)) {\n        order.push(el.getAttribute(options.dataIdAttr) || _generateId(el));\n      }\n    }\n    return order;\n  },\n  /**\r\n   * Sorts the elements according to the array.\r\n   * @param  {String[]}  order  order of the items\r\n   */\n  sort: function sort(order, useAnimation) {\n    var items = {},\n      rootEl = this.el;\n    this.toArray().forEach(function (id, i) {\n      var el = rootEl.children[i];\n      if (closest(el, this.options.draggable, rootEl, false)) {\n        items[id] = el;\n      }\n    }, this);\n    useAnimation && this.captureAnimationState();\n    order.forEach(function (id) {\n      if (items[id]) {\n        rootEl.removeChild(items[id]);\n        rootEl.appendChild(items[id]);\n      }\n    });\n    useAnimation && this.animateAll();\n  },\n  /**\r\n   * Save the current sorting\r\n   */\n  save: function save() {\n    var store = this.options.store;\n    store && store.set && store.set(this);\n  },\n  /**\r\n   * For each element in the set, get the first element that matches the selector by testing the element itself and traversing up through its ancestors in the DOM tree.\r\n   * @param   {HTMLElement}  el\r\n   * @param   {String}       [selector]  default: `options.draggable`\r\n   * @returns {HTMLElement|null}\r\n   */\n  closest: function closest$1(el, selector) {\n    return closest(el, selector || this.options.draggable, this.el, false);\n  },\n  /**\r\n   * Set/get option\r\n   * @param   {string} name\r\n   * @param   {*}      [value]\r\n   * @returns {*}\r\n   */\n  option: function option(name, value) {\n    var options = this.options;\n    if (value === void 0) {\n      return options[name];\n    } else {\n      var modifiedValue = PluginManager.modifyOption(this, name, value);\n      if (typeof modifiedValue !== 'undefined') {\n        options[name] = modifiedValue;\n      } else {\n        options[name] = value;\n      }\n      if (name === 'group') {\n        _prepareGroup(options);\n      }\n    }\n  },\n  /**\r\n   * Destroy\r\n   */\n  destroy: function destroy() {\n    pluginEvent('destroy', this);\n    var el = this.el;\n    el[expando] = null;\n    off(el, 'mousedown', this._onTapStart);\n    off(el, 'touchstart', this._onTapStart);\n    off(el, 'pointerdown', this._onTapStart);\n    if (this.nativeDraggable) {\n      off(el, 'dragover', this);\n      off(el, 'dragenter', this);\n    }\n    // Remove draggable attributes\n    Array.prototype.forEach.call(el.querySelectorAll('[draggable]'), function (el) {\n      el.removeAttribute('draggable');\n    });\n    this._onDrop();\n    this._disableDelayedDragEvents();\n    sortables.splice(sortables.indexOf(this.el), 1);\n    this.el = el = null;\n  },\n  _hideClone: function _hideClone() {\n    if (!cloneHidden) {\n      pluginEvent('hideClone', this);\n      if (Sortable.eventCanceled) return;\n      css(cloneEl, 'display', 'none');\n      if (this.options.removeCloneOnHide && cloneEl.parentNode) {\n        cloneEl.parentNode.removeChild(cloneEl);\n      }\n      cloneHidden = true;\n    }\n  },\n  _showClone: function _showClone(putSortable) {\n    if (putSortable.lastPutMode !== 'clone') {\n      this._hideClone();\n      return;\n    }\n    if (cloneHidden) {\n      pluginEvent('showClone', this);\n      if (Sortable.eventCanceled) return;\n\n      // show clone at dragEl or original position\n      if (dragEl.parentNode == rootEl && !this.options.group.revertClone) {\n        rootEl.insertBefore(cloneEl, dragEl);\n      } else if (nextEl) {\n        rootEl.insertBefore(cloneEl, nextEl);\n      } else {\n        rootEl.appendChild(cloneEl);\n      }\n      if (this.options.group.revertClone) {\n        this.animate(dragEl, cloneEl);\n      }\n      css(cloneEl, 'display', '');\n      cloneHidden = false;\n    }\n  }\n};\nfunction _globalDragOver( /**Event*/evt) {\n  if (evt.dataTransfer) {\n    evt.dataTransfer.dropEffect = 'move';\n  }\n  evt.cancelable && evt.preventDefault();\n}\nfunction _onMove(fromEl, toEl, dragEl, dragRect, targetEl, targetRect, originalEvent, willInsertAfter) {\n  var evt,\n    sortable = fromEl[expando],\n    onMoveFn = sortable.options.onMove,\n    retVal;\n  // Support for new CustomEvent feature\n  if (window.CustomEvent && !IE11OrLess && !Edge) {\n    evt = new CustomEvent('move', {\n      bubbles: true,\n      cancelable: true\n    });\n  } else {\n    evt = document.createEvent('Event');\n    evt.initEvent('move', true, true);\n  }\n  evt.to = toEl;\n  evt.from = fromEl;\n  evt.dragged = dragEl;\n  evt.draggedRect = dragRect;\n  evt.related = targetEl || toEl;\n  evt.relatedRect = targetRect || getRect(toEl);\n  evt.willInsertAfter = willInsertAfter;\n  evt.originalEvent = originalEvent;\n  fromEl.dispatchEvent(evt);\n  if (onMoveFn) {\n    retVal = onMoveFn.call(sortable, evt, originalEvent);\n  }\n  return retVal;\n}\nfunction _disableDraggable(el) {\n  el.draggable = false;\n}\nfunction _unsilent() {\n  _silent = false;\n}\nfunction _ghostIsFirst(evt, vertical, sortable) {\n  var firstElRect = getRect(getChild(sortable.el, 0, sortable.options, true));\n  var childContainingRect = getChildContainingRectFromElement(sortable.el, sortable.options, ghostEl);\n  var spacer = 10;\n  return vertical ? evt.clientX < childContainingRect.left - spacer || evt.clientY < firstElRect.top && evt.clientX < firstElRect.right : evt.clientY < childContainingRect.top - spacer || evt.clientY < firstElRect.bottom && evt.clientX < firstElRect.left;\n}\nfunction _ghostIsLast(evt, vertical, sortable) {\n  var lastElRect = getRect(lastChild(sortable.el, sortable.options.draggable));\n  var childContainingRect = getChildContainingRectFromElement(sortable.el, sortable.options, ghostEl);\n  var spacer = 10;\n  return vertical ? evt.clientX > childContainingRect.right + spacer || evt.clientY > lastElRect.bottom && evt.clientX > lastElRect.left : evt.clientY > childContainingRect.bottom + spacer || evt.clientX > lastElRect.right && evt.clientY > lastElRect.top;\n}\nfunction _getSwapDirection(evt, target, targetRect, vertical, swapThreshold, invertedSwapThreshold, invertSwap, isLastTarget) {\n  var mouseOnAxis = vertical ? evt.clientY : evt.clientX,\n    targetLength = vertical ? targetRect.height : targetRect.width,\n    targetS1 = vertical ? targetRect.top : targetRect.left,\n    targetS2 = vertical ? targetRect.bottom : targetRect.right,\n    invert = false;\n  if (!invertSwap) {\n    // Never invert or create dragEl shadow when target movemenet causes mouse to move past the end of regular swapThreshold\n    if (isLastTarget && targetMoveDistance < targetLength * swapThreshold) {\n      // multiplied only by swapThreshold because mouse will already be inside target by (1 - threshold) * targetLength / 2\n      // check if past first invert threshold on side opposite of lastDirection\n      if (!pastFirstInvertThresh && (lastDirection === 1 ? mouseOnAxis > targetS1 + targetLength * invertedSwapThreshold / 2 : mouseOnAxis < targetS2 - targetLength * invertedSwapThreshold / 2)) {\n        // past first invert threshold, do not restrict inverted threshold to dragEl shadow\n        pastFirstInvertThresh = true;\n      }\n      if (!pastFirstInvertThresh) {\n        // dragEl shadow (target move distance shadow)\n        if (lastDirection === 1 ? mouseOnAxis < targetS1 + targetMoveDistance // over dragEl shadow\n        : mouseOnAxis > targetS2 - targetMoveDistance) {\n          return -lastDirection;\n        }\n      } else {\n        invert = true;\n      }\n    } else {\n      // Regular\n      if (mouseOnAxis > targetS1 + targetLength * (1 - swapThreshold) / 2 && mouseOnAxis < targetS2 - targetLength * (1 - swapThreshold) / 2) {\n        return _getInsertDirection(target);\n      }\n    }\n  }\n  invert = invert || invertSwap;\n  if (invert) {\n    // Invert of regular\n    if (mouseOnAxis < targetS1 + targetLength * invertedSwapThreshold / 2 || mouseOnAxis > targetS2 - targetLength * invertedSwapThreshold / 2) {\n      return mouseOnAxis > targetS1 + targetLength / 2 ? 1 : -1;\n    }\n  }\n  return 0;\n}\n\n/**\r\n * Gets the direction dragEl must be swapped relative to target in order to make it\r\n * seem that dragEl has been \"inserted\" into that element's position\r\n * @param  {HTMLElement} target       The target whose position dragEl is being inserted at\r\n * @return {Number}                   Direction dragEl must be swapped\r\n */\nfunction _getInsertDirection(target) {\n  if (index(dragEl) < index(target)) {\n    return 1;\n  } else {\n    return -1;\n  }\n}\n\n/**\r\n * Generate id\r\n * @param   {HTMLElement} el\r\n * @returns {String}\r\n * @private\r\n */\nfunction _generateId(el) {\n  var str = el.tagName + el.className + el.src + el.href + el.textContent,\n    i = str.length,\n    sum = 0;\n  while (i--) {\n    sum += str.charCodeAt(i);\n  }\n  return sum.toString(36);\n}\nfunction _saveInputCheckedState(root) {\n  savedInputChecked.length = 0;\n  var inputs = root.getElementsByTagName('input');\n  var idx = inputs.length;\n  while (idx--) {\n    var el = inputs[idx];\n    el.checked && savedInputChecked.push(el);\n  }\n}\nfunction _nextTick(fn) {\n  return setTimeout(fn, 0);\n}\nfunction _cancelNextTick(id) {\n  return clearTimeout(id);\n}\n\n// Fixed #973:\nif (documentExists) {\n  on(document, 'touchmove', function (evt) {\n    if ((Sortable.active || awaitingDragStarted) && evt.cancelable) {\n      evt.preventDefault();\n    }\n  });\n}\n\n// Export utils\nSortable.utils = {\n  on: on,\n  off: off,\n  css: css,\n  find: find,\n  is: function is(el, selector) {\n    return !!closest(el, selector, el, false);\n  },\n  extend: extend,\n  throttle: throttle,\n  closest: closest,\n  toggleClass: toggleClass,\n  clone: clone,\n  index: index,\n  nextTick: _nextTick,\n  cancelNextTick: _cancelNextTick,\n  detectDirection: _detectDirection,\n  getChild: getChild,\n  expando: expando\n};\n\n/**\r\n * Get the Sortable instance of an element\r\n * @param  {HTMLElement} element The element\r\n * @return {Sortable|undefined}         The instance of Sortable\r\n */\nSortable.get = function (element) {\n  return element[expando];\n};\n\n/**\r\n * Mount a plugin to Sortable\r\n * @param  {...SortablePlugin|SortablePlugin[]} plugins       Plugins being mounted\r\n */\nSortable.mount = function () {\n  for (var _len = arguments.length, plugins = new Array(_len), _key = 0; _key < _len; _key++) {\n    plugins[_key] = arguments[_key];\n  }\n  if (plugins[0].constructor === Array) plugins = plugins[0];\n  plugins.forEach(function (plugin) {\n    if (!plugin.prototype || !plugin.prototype.constructor) {\n      throw \"Sortable: Mounted plugin must be a constructor function, not \".concat({}.toString.call(plugin));\n    }\n    if (plugin.utils) Sortable.utils = _objectSpread2(_objectSpread2({}, Sortable.utils), plugin.utils);\n    PluginManager.mount(plugin);\n  });\n};\n\n/**\r\n * Create sortable instance\r\n * @param {HTMLElement}  el\r\n * @param {Object}      [options]\r\n */\nSortable.create = function (el, options) {\n  return new Sortable(el, options);\n};\n\n// Export\nSortable.version = version;\n\nvar autoScrolls = [],\n  scrollEl,\n  scrollRootEl,\n  scrolling = false,\n  lastAutoScrollX,\n  lastAutoScrollY,\n  touchEvt$1,\n  pointerElemChangedInterval;\nfunction AutoScrollPlugin() {\n  function AutoScroll() {\n    this.defaults = {\n      scroll: true,\n      forceAutoScrollFallback: false,\n      scrollSensitivity: 30,\n      scrollSpeed: 10,\n      bubbleScroll: true\n    };\n\n    // Bind all private methods\n    for (var fn in this) {\n      if (fn.charAt(0) === '_' && typeof this[fn] === 'function') {\n        this[fn] = this[fn].bind(this);\n      }\n    }\n  }\n  AutoScroll.prototype = {\n    dragStarted: function dragStarted(_ref) {\n      var originalEvent = _ref.originalEvent;\n      if (this.sortable.nativeDraggable) {\n        on(document, 'dragover', this._handleAutoScroll);\n      } else {\n        if (this.options.supportPointer) {\n          on(document, 'pointermove', this._handleFallbackAutoScroll);\n        } else if (originalEvent.touches) {\n          on(document, 'touchmove', this._handleFallbackAutoScroll);\n        } else {\n          on(document, 'mousemove', this._handleFallbackAutoScroll);\n        }\n      }\n    },\n    dragOverCompleted: function dragOverCompleted(_ref2) {\n      var originalEvent = _ref2.originalEvent;\n      // For when bubbling is canceled and using fallback (fallback 'touchmove' always reached)\n      if (!this.options.dragOverBubble && !originalEvent.rootEl) {\n        this._handleAutoScroll(originalEvent);\n      }\n    },\n    drop: function drop() {\n      if (this.sortable.nativeDraggable) {\n        off(document, 'dragover', this._handleAutoScroll);\n      } else {\n        off(document, 'pointermove', this._handleFallbackAutoScroll);\n        off(document, 'touchmove', this._handleFallbackAutoScroll);\n        off(document, 'mousemove', this._handleFallbackAutoScroll);\n      }\n      clearPointerElemChangedInterval();\n      clearAutoScrolls();\n      cancelThrottle();\n    },\n    nulling: function nulling() {\n      touchEvt$1 = scrollRootEl = scrollEl = scrolling = pointerElemChangedInterval = lastAutoScrollX = lastAutoScrollY = null;\n      autoScrolls.length = 0;\n    },\n    _handleFallbackAutoScroll: function _handleFallbackAutoScroll(evt) {\n      this._handleAutoScroll(evt, true);\n    },\n    _handleAutoScroll: function _handleAutoScroll(evt, fallback) {\n      var _this = this;\n      var x = (evt.touches ? evt.touches[0] : evt).clientX,\n        y = (evt.touches ? evt.touches[0] : evt).clientY,\n        elem = document.elementFromPoint(x, y);\n      touchEvt$1 = evt;\n\n      // IE does not seem to have native autoscroll,\n      // Edge's autoscroll seems too conditional,\n      // MACOS Safari does not have autoscroll,\n      // Firefox and Chrome are good\n      if (fallback || this.options.forceAutoScrollFallback || Edge || IE11OrLess || Safari) {\n        autoScroll(evt, this.options, elem, fallback);\n\n        // Listener for pointer element change\n        var ogElemScroller = getParentAutoScrollElement(elem, true);\n        if (scrolling && (!pointerElemChangedInterval || x !== lastAutoScrollX || y !== lastAutoScrollY)) {\n          pointerElemChangedInterval && clearPointerElemChangedInterval();\n          // Detect for pointer elem change, emulating native DnD behaviour\n          pointerElemChangedInterval = setInterval(function () {\n            var newElem = getParentAutoScrollElement(document.elementFromPoint(x, y), true);\n            if (newElem !== ogElemScroller) {\n              ogElemScroller = newElem;\n              clearAutoScrolls();\n            }\n            autoScroll(evt, _this.options, newElem, fallback);\n          }, 10);\n          lastAutoScrollX = x;\n          lastAutoScrollY = y;\n        }\n      } else {\n        // if DnD is enabled (and browser has good autoscrolling), first autoscroll will already scroll, so get parent autoscroll of first autoscroll\n        if (!this.options.bubbleScroll || getParentAutoScrollElement(elem, true) === getWindowScrollingElement()) {\n          clearAutoScrolls();\n          return;\n        }\n        autoScroll(evt, this.options, getParentAutoScrollElement(elem, false), false);\n      }\n    }\n  };\n  return _extends(AutoScroll, {\n    pluginName: 'scroll',\n    initializeByDefault: true\n  });\n}\nfunction clearAutoScrolls() {\n  autoScrolls.forEach(function (autoScroll) {\n    clearInterval(autoScroll.pid);\n  });\n  autoScrolls = [];\n}\nfunction clearPointerElemChangedInterval() {\n  clearInterval(pointerElemChangedInterval);\n}\nvar autoScroll = throttle(function (evt, options, rootEl, isFallback) {\n  // Bug: https://bugzilla.mozilla.org/show_bug.cgi?id=505521\n  if (!options.scroll) return;\n  var x = (evt.touches ? evt.touches[0] : evt).clientX,\n    y = (evt.touches ? evt.touches[0] : evt).clientY,\n    sens = options.scrollSensitivity,\n    speed = options.scrollSpeed,\n    winScroller = getWindowScrollingElement();\n  var scrollThisInstance = false,\n    scrollCustomFn;\n\n  // New scroll root, set scrollEl\n  if (scrollRootEl !== rootEl) {\n    scrollRootEl = rootEl;\n    clearAutoScrolls();\n    scrollEl = options.scroll;\n    scrollCustomFn = options.scrollFn;\n    if (scrollEl === true) {\n      scrollEl = getParentAutoScrollElement(rootEl, true);\n    }\n  }\n  var layersOut = 0;\n  var currentParent = scrollEl;\n  do {\n    var el = currentParent,\n      rect = getRect(el),\n      top = rect.top,\n      bottom = rect.bottom,\n      left = rect.left,\n      right = rect.right,\n      width = rect.width,\n      height = rect.height,\n      canScrollX = void 0,\n      canScrollY = void 0,\n      scrollWidth = el.scrollWidth,\n      scrollHeight = el.scrollHeight,\n      elCSS = css(el),\n      scrollPosX = el.scrollLeft,\n      scrollPosY = el.scrollTop;\n    if (el === winScroller) {\n      canScrollX = width < scrollWidth && (elCSS.overflowX === 'auto' || elCSS.overflowX === 'scroll' || elCSS.overflowX === 'visible');\n      canScrollY = height < scrollHeight && (elCSS.overflowY === 'auto' || elCSS.overflowY === 'scroll' || elCSS.overflowY === 'visible');\n    } else {\n      canScrollX = width < scrollWidth && (elCSS.overflowX === 'auto' || elCSS.overflowX === 'scroll');\n      canScrollY = height < scrollHeight && (elCSS.overflowY === 'auto' || elCSS.overflowY === 'scroll');\n    }\n    var vx = canScrollX && (Math.abs(right - x) <= sens && scrollPosX + width < scrollWidth) - (Math.abs(left - x) <= sens && !!scrollPosX);\n    var vy = canScrollY && (Math.abs(bottom - y) <= sens && scrollPosY + height < scrollHeight) - (Math.abs(top - y) <= sens && !!scrollPosY);\n    if (!autoScrolls[layersOut]) {\n      for (var i = 0; i <= layersOut; i++) {\n        if (!autoScrolls[i]) {\n          autoScrolls[i] = {};\n        }\n      }\n    }\n    if (autoScrolls[layersOut].vx != vx || autoScrolls[layersOut].vy != vy || autoScrolls[layersOut].el !== el) {\n      autoScrolls[layersOut].el = el;\n      autoScrolls[layersOut].vx = vx;\n      autoScrolls[layersOut].vy = vy;\n      clearInterval(autoScrolls[layersOut].pid);\n      if (vx != 0 || vy != 0) {\n        scrollThisInstance = true;\n        /* jshint loopfunc:true */\n        autoScrolls[layersOut].pid = setInterval(function () {\n          // emulate drag over during autoscroll (fallback), emulating native DnD behaviour\n          if (isFallback && this.layer === 0) {\n            Sortable.active._onTouchMove(touchEvt$1); // To move ghost if it is positioned absolutely\n          }\n          var scrollOffsetY = autoScrolls[this.layer].vy ? autoScrolls[this.layer].vy * speed : 0;\n          var scrollOffsetX = autoScrolls[this.layer].vx ? autoScrolls[this.layer].vx * speed : 0;\n          if (typeof scrollCustomFn === 'function') {\n            if (scrollCustomFn.call(Sortable.dragged.parentNode[expando], scrollOffsetX, scrollOffsetY, evt, touchEvt$1, autoScrolls[this.layer].el) !== 'continue') {\n              return;\n            }\n          }\n          scrollBy(autoScrolls[this.layer].el, scrollOffsetX, scrollOffsetY);\n        }.bind({\n          layer: layersOut\n        }), 24);\n      }\n    }\n    layersOut++;\n  } while (options.bubbleScroll && currentParent !== winScroller && (currentParent = getParentAutoScrollElement(currentParent, false)));\n  scrolling = scrollThisInstance; // in case another function catches scrolling as false in between when it is not\n}, 30);\n\nvar drop = function drop(_ref) {\n  var originalEvent = _ref.originalEvent,\n    putSortable = _ref.putSortable,\n    dragEl = _ref.dragEl,\n    activeSortable = _ref.activeSortable,\n    dispatchSortableEvent = _ref.dispatchSortableEvent,\n    hideGhostForTarget = _ref.hideGhostForTarget,\n    unhideGhostForTarget = _ref.unhideGhostForTarget;\n  if (!originalEvent) return;\n  var toSortable = putSortable || activeSortable;\n  hideGhostForTarget();\n  var touch = originalEvent.changedTouches && originalEvent.changedTouches.length ? originalEvent.changedTouches[0] : originalEvent;\n  var target = document.elementFromPoint(touch.clientX, touch.clientY);\n  unhideGhostForTarget();\n  if (toSortable && !toSortable.el.contains(target)) {\n    dispatchSortableEvent('spill');\n    this.onSpill({\n      dragEl: dragEl,\n      putSortable: putSortable\n    });\n  }\n};\nfunction Revert() {}\nRevert.prototype = {\n  startIndex: null,\n  dragStart: function dragStart(_ref2) {\n    var oldDraggableIndex = _ref2.oldDraggableIndex;\n    this.startIndex = oldDraggableIndex;\n  },\n  onSpill: function onSpill(_ref3) {\n    var dragEl = _ref3.dragEl,\n      putSortable = _ref3.putSortable;\n    this.sortable.captureAnimationState();\n    if (putSortable) {\n      putSortable.captureAnimationState();\n    }\n    var nextSibling = getChild(this.sortable.el, this.startIndex, this.options);\n    if (nextSibling) {\n      this.sortable.el.insertBefore(dragEl, nextSibling);\n    } else {\n      this.sortable.el.appendChild(dragEl);\n    }\n    this.sortable.animateAll();\n    if (putSortable) {\n      putSortable.animateAll();\n    }\n  },\n  drop: drop\n};\n_extends(Revert, {\n  pluginName: 'revertOnSpill'\n});\nfunction Remove() {}\nRemove.prototype = {\n  onSpill: function onSpill(_ref4) {\n    var dragEl = _ref4.dragEl,\n      putSortable = _ref4.putSortable;\n    var parentSortable = putSortable || this.sortable;\n    parentSortable.captureAnimationState();\n    dragEl.parentNode && dragEl.parentNode.removeChild(dragEl);\n    parentSortable.animateAll();\n  },\n  drop: drop\n};\n_extends(Remove, {\n  pluginName: 'removeOnSpill'\n});\n\nvar lastSwapEl;\nfunction SwapPlugin() {\n  function Swap() {\n    this.defaults = {\n      swapClass: 'sortable-swap-highlight'\n    };\n  }\n  Swap.prototype = {\n    dragStart: function dragStart(_ref) {\n      var dragEl = _ref.dragEl;\n      lastSwapEl = dragEl;\n    },\n    dragOverValid: function dragOverValid(_ref2) {\n      var completed = _ref2.completed,\n        target = _ref2.target,\n        onMove = _ref2.onMove,\n        activeSortable = _ref2.activeSortable,\n        changed = _ref2.changed,\n        cancel = _ref2.cancel;\n      if (!activeSortable.options.swap) return;\n      var el = this.sortable.el,\n        options = this.options;\n      if (target && target !== el) {\n        var prevSwapEl = lastSwapEl;\n        if (onMove(target) !== false) {\n          toggleClass(target, options.swapClass, true);\n          lastSwapEl = target;\n        } else {\n          lastSwapEl = null;\n        }\n        if (prevSwapEl && prevSwapEl !== lastSwapEl) {\n          toggleClass(prevSwapEl, options.swapClass, false);\n        }\n      }\n      changed();\n      completed(true);\n      cancel();\n    },\n    drop: function drop(_ref3) {\n      var activeSortable = _ref3.activeSortable,\n        putSortable = _ref3.putSortable,\n        dragEl = _ref3.dragEl;\n      var toSortable = putSortable || this.sortable;\n      var options = this.options;\n      lastSwapEl && toggleClass(lastSwapEl, options.swapClass, false);\n      if (lastSwapEl && (options.swap || putSortable && putSortable.options.swap)) {\n        if (dragEl !== lastSwapEl) {\n          toSortable.captureAnimationState();\n          if (toSortable !== activeSortable) activeSortable.captureAnimationState();\n          swapNodes(dragEl, lastSwapEl);\n          toSortable.animateAll();\n          if (toSortable !== activeSortable) activeSortable.animateAll();\n        }\n      }\n    },\n    nulling: function nulling() {\n      lastSwapEl = null;\n    }\n  };\n  return _extends(Swap, {\n    pluginName: 'swap',\n    eventProperties: function eventProperties() {\n      return {\n        swapItem: lastSwapEl\n      };\n    }\n  });\n}\nfunction swapNodes(n1, n2) {\n  var p1 = n1.parentNode,\n    p2 = n2.parentNode,\n    i1,\n    i2;\n  if (!p1 || !p2 || p1.isEqualNode(n2) || p2.isEqualNode(n1)) return;\n  i1 = index(n1);\n  i2 = index(n2);\n  if (p1.isEqualNode(p2) && i1 < i2) {\n    i2++;\n  }\n  p1.insertBefore(n2, p1.children[i1]);\n  p2.insertBefore(n1, p2.children[i2]);\n}\n\nvar multiDragElements = [],\n  multiDragClones = [],\n  lastMultiDragSelect,\n  // for selection with modifier key down (SHIFT)\n  multiDragSortable,\n  initialFolding = false,\n  // Initial multi-drag fold when drag started\n  folding = false,\n  // Folding any other time\n  dragStarted = false,\n  dragEl$1,\n  clonesFromRect,\n  clonesHidden;\nfunction MultiDragPlugin() {\n  function MultiDrag(sortable) {\n    // Bind all private methods\n    for (var fn in this) {\n      if (fn.charAt(0) === '_' && typeof this[fn] === 'function') {\n        this[fn] = this[fn].bind(this);\n      }\n    }\n    if (!sortable.options.avoidImplicitDeselect) {\n      if (sortable.options.supportPointer) {\n        on(document, 'pointerup', this._deselectMultiDrag);\n      } else {\n        on(document, 'mouseup', this._deselectMultiDrag);\n        on(document, 'touchend', this._deselectMultiDrag);\n      }\n    }\n    on(document, 'keydown', this._checkKeyDown);\n    on(document, 'keyup', this._checkKeyUp);\n    this.defaults = {\n      selectedClass: 'sortable-selected',\n      multiDragKey: null,\n      avoidImplicitDeselect: false,\n      setData: function setData(dataTransfer, dragEl) {\n        var data = '';\n        if (multiDragElements.length && multiDragSortable === sortable) {\n          multiDragElements.forEach(function (multiDragElement, i) {\n            data += (!i ? '' : ', ') + multiDragElement.textContent;\n          });\n        } else {\n          data = dragEl.textContent;\n        }\n        dataTransfer.setData('Text', data);\n      }\n    };\n  }\n  MultiDrag.prototype = {\n    multiDragKeyDown: false,\n    isMultiDrag: false,\n    delayStartGlobal: function delayStartGlobal(_ref) {\n      var dragged = _ref.dragEl;\n      dragEl$1 = dragged;\n    },\n    delayEnded: function delayEnded() {\n      this.isMultiDrag = ~multiDragElements.indexOf(dragEl$1);\n    },\n    setupClone: function setupClone(_ref2) {\n      var sortable = _ref2.sortable,\n        cancel = _ref2.cancel;\n      if (!this.isMultiDrag) return;\n      for (var i = 0; i < multiDragElements.length; i++) {\n        multiDragClones.push(clone(multiDragElements[i]));\n        multiDragClones[i].sortableIndex = multiDragElements[i].sortableIndex;\n        multiDragClones[i].draggable = false;\n        multiDragClones[i].style['will-change'] = '';\n        toggleClass(multiDragClones[i], this.options.selectedClass, false);\n        multiDragElements[i] === dragEl$1 && toggleClass(multiDragClones[i], this.options.chosenClass, false);\n      }\n      sortable._hideClone();\n      cancel();\n    },\n    clone: function clone(_ref3) {\n      var sortable = _ref3.sortable,\n        rootEl = _ref3.rootEl,\n        dispatchSortableEvent = _ref3.dispatchSortableEvent,\n        cancel = _ref3.cancel;\n      if (!this.isMultiDrag) return;\n      if (!this.options.removeCloneOnHide) {\n        if (multiDragElements.length && multiDragSortable === sortable) {\n          insertMultiDragClones(true, rootEl);\n          dispatchSortableEvent('clone');\n          cancel();\n        }\n      }\n    },\n    showClone: function showClone(_ref4) {\n      var cloneNowShown = _ref4.cloneNowShown,\n        rootEl = _ref4.rootEl,\n        cancel = _ref4.cancel;\n      if (!this.isMultiDrag) return;\n      insertMultiDragClones(false, rootEl);\n      multiDragClones.forEach(function (clone) {\n        css(clone, 'display', '');\n      });\n      cloneNowShown();\n      clonesHidden = false;\n      cancel();\n    },\n    hideClone: function hideClone(_ref5) {\n      var _this = this;\n      var sortable = _ref5.sortable,\n        cloneNowHidden = _ref5.cloneNowHidden,\n        cancel = _ref5.cancel;\n      if (!this.isMultiDrag) return;\n      multiDragClones.forEach(function (clone) {\n        css(clone, 'display', 'none');\n        if (_this.options.removeCloneOnHide && clone.parentNode) {\n          clone.parentNode.removeChild(clone);\n        }\n      });\n      cloneNowHidden();\n      clonesHidden = true;\n      cancel();\n    },\n    dragStartGlobal: function dragStartGlobal(_ref6) {\n      var sortable = _ref6.sortable;\n      if (!this.isMultiDrag && multiDragSortable) {\n        multiDragSortable.multiDrag._deselectMultiDrag();\n      }\n      multiDragElements.forEach(function (multiDragElement) {\n        multiDragElement.sortableIndex = index(multiDragElement);\n      });\n\n      // Sort multi-drag elements\n      multiDragElements = multiDragElements.sort(function (a, b) {\n        return a.sortableIndex - b.sortableIndex;\n      });\n      dragStarted = true;\n    },\n    dragStarted: function dragStarted(_ref7) {\n      var _this2 = this;\n      var sortable = _ref7.sortable;\n      if (!this.isMultiDrag) return;\n      if (this.options.sort) {\n        // Capture rects,\n        // hide multi drag elements (by positioning them absolute),\n        // set multi drag elements rects to dragRect,\n        // show multi drag elements,\n        // animate to rects,\n        // unset rects & remove from DOM\n\n        sortable.captureAnimationState();\n        if (this.options.animation) {\n          multiDragElements.forEach(function (multiDragElement) {\n            if (multiDragElement === dragEl$1) return;\n            css(multiDragElement, 'position', 'absolute');\n          });\n          var dragRect = getRect(dragEl$1, false, true, true);\n          multiDragElements.forEach(function (multiDragElement) {\n            if (multiDragElement === dragEl$1) return;\n            setRect(multiDragElement, dragRect);\n          });\n          folding = true;\n          initialFolding = true;\n        }\n      }\n      sortable.animateAll(function () {\n        folding = false;\n        initialFolding = false;\n        if (_this2.options.animation) {\n          multiDragElements.forEach(function (multiDragElement) {\n            unsetRect(multiDragElement);\n          });\n        }\n\n        // Remove all auxiliary multidrag items from el, if sorting enabled\n        if (_this2.options.sort) {\n          removeMultiDragElements();\n        }\n      });\n    },\n    dragOver: function dragOver(_ref8) {\n      var target = _ref8.target,\n        completed = _ref8.completed,\n        cancel = _ref8.cancel;\n      if (folding && ~multiDragElements.indexOf(target)) {\n        completed(false);\n        cancel();\n      }\n    },\n    revert: function revert(_ref9) {\n      var fromSortable = _ref9.fromSortable,\n        rootEl = _ref9.rootEl,\n        sortable = _ref9.sortable,\n        dragRect = _ref9.dragRect;\n      if (multiDragElements.length > 1) {\n        // Setup unfold animation\n        multiDragElements.forEach(function (multiDragElement) {\n          sortable.addAnimationState({\n            target: multiDragElement,\n            rect: folding ? getRect(multiDragElement) : dragRect\n          });\n          unsetRect(multiDragElement);\n          multiDragElement.fromRect = dragRect;\n          fromSortable.removeAnimationState(multiDragElement);\n        });\n        folding = false;\n        insertMultiDragElements(!this.options.removeCloneOnHide, rootEl);\n      }\n    },\n    dragOverCompleted: function dragOverCompleted(_ref10) {\n      var sortable = _ref10.sortable,\n        isOwner = _ref10.isOwner,\n        insertion = _ref10.insertion,\n        activeSortable = _ref10.activeSortable,\n        parentEl = _ref10.parentEl,\n        putSortable = _ref10.putSortable;\n      var options = this.options;\n      if (insertion) {\n        // Clones must be hidden before folding animation to capture dragRectAbsolute properly\n        if (isOwner) {\n          activeSortable._hideClone();\n        }\n        initialFolding = false;\n        // If leaving sort:false root, or already folding - Fold to new location\n        if (options.animation && multiDragElements.length > 1 && (folding || !isOwner && !activeSortable.options.sort && !putSortable)) {\n          // Fold: Set all multi drag elements's rects to dragEl's rect when multi-drag elements are invisible\n          var dragRectAbsolute = getRect(dragEl$1, false, true, true);\n          multiDragElements.forEach(function (multiDragElement) {\n            if (multiDragElement === dragEl$1) return;\n            setRect(multiDragElement, dragRectAbsolute);\n\n            // Move element(s) to end of parentEl so that it does not interfere with multi-drag clones insertion if they are inserted\n            // while folding, and so that we can capture them again because old sortable will no longer be fromSortable\n            parentEl.appendChild(multiDragElement);\n          });\n          folding = true;\n        }\n\n        // Clones must be shown (and check to remove multi drags) after folding when interfering multiDragElements are moved out\n        if (!isOwner) {\n          // Only remove if not folding (folding will remove them anyways)\n          if (!folding) {\n            removeMultiDragElements();\n          }\n          if (multiDragElements.length > 1) {\n            var clonesHiddenBefore = clonesHidden;\n            activeSortable._showClone(sortable);\n\n            // Unfold animation for clones if showing from hidden\n            if (activeSortable.options.animation && !clonesHidden && clonesHiddenBefore) {\n              multiDragClones.forEach(function (clone) {\n                activeSortable.addAnimationState({\n                  target: clone,\n                  rect: clonesFromRect\n                });\n                clone.fromRect = clonesFromRect;\n                clone.thisAnimationDuration = null;\n              });\n            }\n          } else {\n            activeSortable._showClone(sortable);\n          }\n        }\n      }\n    },\n    dragOverAnimationCapture: function dragOverAnimationCapture(_ref11) {\n      var dragRect = _ref11.dragRect,\n        isOwner = _ref11.isOwner,\n        activeSortable = _ref11.activeSortable;\n      multiDragElements.forEach(function (multiDragElement) {\n        multiDragElement.thisAnimationDuration = null;\n      });\n      if (activeSortable.options.animation && !isOwner && activeSortable.multiDrag.isMultiDrag) {\n        clonesFromRect = _extends({}, dragRect);\n        var dragMatrix = matrix(dragEl$1, true);\n        clonesFromRect.top -= dragMatrix.f;\n        clonesFromRect.left -= dragMatrix.e;\n      }\n    },\n    dragOverAnimationComplete: function dragOverAnimationComplete() {\n      if (folding) {\n        folding = false;\n        removeMultiDragElements();\n      }\n    },\n    drop: function drop(_ref12) {\n      var evt = _ref12.originalEvent,\n        rootEl = _ref12.rootEl,\n        parentEl = _ref12.parentEl,\n        sortable = _ref12.sortable,\n        dispatchSortableEvent = _ref12.dispatchSortableEvent,\n        oldIndex = _ref12.oldIndex,\n        putSortable = _ref12.putSortable;\n      var toSortable = putSortable || this.sortable;\n      if (!evt) return;\n      var options = this.options,\n        children = parentEl.children;\n\n      // Multi-drag selection\n      if (!dragStarted) {\n        if (options.multiDragKey && !this.multiDragKeyDown) {\n          this._deselectMultiDrag();\n        }\n        toggleClass(dragEl$1, options.selectedClass, !~multiDragElements.indexOf(dragEl$1));\n        if (!~multiDragElements.indexOf(dragEl$1)) {\n          multiDragElements.push(dragEl$1);\n          dispatchEvent({\n            sortable: sortable,\n            rootEl: rootEl,\n            name: 'select',\n            targetEl: dragEl$1,\n            originalEvent: evt\n          });\n\n          // Modifier activated, select from last to dragEl\n          if (evt.shiftKey && lastMultiDragSelect && sortable.el.contains(lastMultiDragSelect)) {\n            var lastIndex = index(lastMultiDragSelect),\n              currentIndex = index(dragEl$1);\n            if (~lastIndex && ~currentIndex && lastIndex !== currentIndex) {\n              (function () {\n                // Must include lastMultiDragSelect (select it), in case modified selection from no selection\n                // (but previous selection existed)\n                var n, i;\n                if (currentIndex > lastIndex) {\n                  i = lastIndex;\n                  n = currentIndex;\n                } else {\n                  i = currentIndex;\n                  n = lastIndex + 1;\n                }\n                var filter = options.filter;\n                for (; i < n; i++) {\n                  if (~multiDragElements.indexOf(children[i])) continue;\n                  // Check if element is draggable\n                  if (!closest(children[i], options.draggable, parentEl, false)) continue;\n                  // Check if element is filtered\n                  var filtered = filter && (typeof filter === 'function' ? filter.call(sortable, evt, children[i], sortable) : filter.split(',').some(function (criteria) {\n                    return closest(children[i], criteria.trim(), parentEl, false);\n                  }));\n                  if (filtered) continue;\n                  toggleClass(children[i], options.selectedClass, true);\n                  multiDragElements.push(children[i]);\n                  dispatchEvent({\n                    sortable: sortable,\n                    rootEl: rootEl,\n                    name: 'select',\n                    targetEl: children[i],\n                    originalEvent: evt\n                  });\n                }\n              })();\n            }\n          } else {\n            lastMultiDragSelect = dragEl$1;\n          }\n          multiDragSortable = toSortable;\n        } else {\n          multiDragElements.splice(multiDragElements.indexOf(dragEl$1), 1);\n          lastMultiDragSelect = null;\n          dispatchEvent({\n            sortable: sortable,\n            rootEl: rootEl,\n            name: 'deselect',\n            targetEl: dragEl$1,\n            originalEvent: evt\n          });\n        }\n      }\n\n      // Multi-drag drop\n      if (dragStarted && this.isMultiDrag) {\n        folding = false;\n        // Do not \"unfold\" after around dragEl if reverted\n        if ((parentEl[expando].options.sort || parentEl !== rootEl) && multiDragElements.length > 1) {\n          var dragRect = getRect(dragEl$1),\n            multiDragIndex = index(dragEl$1, ':not(.' + this.options.selectedClass + ')');\n          if (!initialFolding && options.animation) dragEl$1.thisAnimationDuration = null;\n          toSortable.captureAnimationState();\n          if (!initialFolding) {\n            if (options.animation) {\n              dragEl$1.fromRect = dragRect;\n              multiDragElements.forEach(function (multiDragElement) {\n                multiDragElement.thisAnimationDuration = null;\n                if (multiDragElement !== dragEl$1) {\n                  var rect = folding ? getRect(multiDragElement) : dragRect;\n                  multiDragElement.fromRect = rect;\n\n                  // Prepare unfold animation\n                  toSortable.addAnimationState({\n                    target: multiDragElement,\n                    rect: rect\n                  });\n                }\n              });\n            }\n\n            // Multi drag elements are not necessarily removed from the DOM on drop, so to reinsert\n            // properly they must all be removed\n            removeMultiDragElements();\n            multiDragElements.forEach(function (multiDragElement) {\n              if (children[multiDragIndex]) {\n                parentEl.insertBefore(multiDragElement, children[multiDragIndex]);\n              } else {\n                parentEl.appendChild(multiDragElement);\n              }\n              multiDragIndex++;\n            });\n\n            // If initial folding is done, the elements may have changed position because they are now\n            // unfolding around dragEl, even though dragEl may not have his index changed, so update event\n            // must be fired here as Sortable will not.\n            if (oldIndex === index(dragEl$1)) {\n              var update = false;\n              multiDragElements.forEach(function (multiDragElement) {\n                if (multiDragElement.sortableIndex !== index(multiDragElement)) {\n                  update = true;\n                  return;\n                }\n              });\n              if (update) {\n                dispatchSortableEvent('update');\n                dispatchSortableEvent('sort');\n              }\n            }\n          }\n\n          // Must be done after capturing individual rects (scroll bar)\n          multiDragElements.forEach(function (multiDragElement) {\n            unsetRect(multiDragElement);\n          });\n          toSortable.animateAll();\n        }\n        multiDragSortable = toSortable;\n      }\n\n      // Remove clones if necessary\n      if (rootEl === parentEl || putSortable && putSortable.lastPutMode !== 'clone') {\n        multiDragClones.forEach(function (clone) {\n          clone.parentNode && clone.parentNode.removeChild(clone);\n        });\n      }\n    },\n    nullingGlobal: function nullingGlobal() {\n      this.isMultiDrag = dragStarted = false;\n      multiDragClones.length = 0;\n    },\n    destroyGlobal: function destroyGlobal() {\n      this._deselectMultiDrag();\n      off(document, 'pointerup', this._deselectMultiDrag);\n      off(document, 'mouseup', this._deselectMultiDrag);\n      off(document, 'touchend', this._deselectMultiDrag);\n      off(document, 'keydown', this._checkKeyDown);\n      off(document, 'keyup', this._checkKeyUp);\n    },\n    _deselectMultiDrag: function _deselectMultiDrag(evt) {\n      if (typeof dragStarted !== \"undefined\" && dragStarted) return;\n\n      // Only deselect if selection is in this sortable\n      if (multiDragSortable !== this.sortable) return;\n\n      // Only deselect if target is not item in this sortable\n      if (evt && closest(evt.target, this.options.draggable, this.sortable.el, false)) return;\n\n      // Only deselect if left click\n      if (evt && evt.button !== 0) return;\n      while (multiDragElements.length) {\n        var el = multiDragElements[0];\n        toggleClass(el, this.options.selectedClass, false);\n        multiDragElements.shift();\n        dispatchEvent({\n          sortable: this.sortable,\n          rootEl: this.sortable.el,\n          name: 'deselect',\n          targetEl: el,\n          originalEvent: evt\n        });\n      }\n    },\n    _checkKeyDown: function _checkKeyDown(evt) {\n      if (evt.key === this.options.multiDragKey) {\n        this.multiDragKeyDown = true;\n      }\n    },\n    _checkKeyUp: function _checkKeyUp(evt) {\n      if (evt.key === this.options.multiDragKey) {\n        this.multiDragKeyDown = false;\n      }\n    }\n  };\n  return _extends(MultiDrag, {\n    // Static methods & properties\n    pluginName: 'multiDrag',\n    utils: {\n      /**\r\n       * Selects the provided multi-drag item\r\n       * @param  {HTMLElement} el    The element to be selected\r\n       */\n      select: function select(el) {\n        var sortable = el.parentNode[expando];\n        if (!sortable || !sortable.options.multiDrag || ~multiDragElements.indexOf(el)) return;\n        if (multiDragSortable && multiDragSortable !== sortable) {\n          multiDragSortable.multiDrag._deselectMultiDrag();\n          multiDragSortable = sortable;\n        }\n        toggleClass(el, sortable.options.selectedClass, true);\n        multiDragElements.push(el);\n      },\n      /**\r\n       * Deselects the provided multi-drag item\r\n       * @param  {HTMLElement} el    The element to be deselected\r\n       */\n      deselect: function deselect(el) {\n        var sortable = el.parentNode[expando],\n          index = multiDragElements.indexOf(el);\n        if (!sortable || !sortable.options.multiDrag || !~index) return;\n        toggleClass(el, sortable.options.selectedClass, false);\n        multiDragElements.splice(index, 1);\n      }\n    },\n    eventProperties: function eventProperties() {\n      var _this3 = this;\n      var oldIndicies = [],\n        newIndicies = [];\n      multiDragElements.forEach(function (multiDragElement) {\n        oldIndicies.push({\n          multiDragElement: multiDragElement,\n          index: multiDragElement.sortableIndex\n        });\n\n        // multiDragElements will already be sorted if folding\n        var newIndex;\n        if (folding && multiDragElement !== dragEl$1) {\n          newIndex = -1;\n        } else if (folding) {\n          newIndex = index(multiDragElement, ':not(.' + _this3.options.selectedClass + ')');\n        } else {\n          newIndex = index(multiDragElement);\n        }\n        newIndicies.push({\n          multiDragElement: multiDragElement,\n          index: newIndex\n        });\n      });\n      return {\n        items: _toConsumableArray(multiDragElements),\n        clones: [].concat(multiDragClones),\n        oldIndicies: oldIndicies,\n        newIndicies: newIndicies\n      };\n    },\n    optionListeners: {\n      multiDragKey: function multiDragKey(key) {\n        key = key.toLowerCase();\n        if (key === 'ctrl') {\n          key = 'Control';\n        } else if (key.length > 1) {\n          key = key.charAt(0).toUpperCase() + key.substr(1);\n        }\n        return key;\n      }\n    }\n  });\n}\nfunction insertMultiDragElements(clonesInserted, rootEl) {\n  multiDragElements.forEach(function (multiDragElement, i) {\n    var target = rootEl.children[multiDragElement.sortableIndex + (clonesInserted ? Number(i) : 0)];\n    if (target) {\n      rootEl.insertBefore(multiDragElement, target);\n    } else {\n      rootEl.appendChild(multiDragElement);\n    }\n  });\n}\n\n/**\r\n * Insert multi-drag clones\r\n * @param  {[Boolean]} elementsInserted  Whether the multi-drag elements are inserted\r\n * @param  {HTMLElement} rootEl\r\n */\nfunction insertMultiDragClones(elementsInserted, rootEl) {\n  multiDragClones.forEach(function (clone, i) {\n    var target = rootEl.children[clone.sortableIndex + (elementsInserted ? Number(i) : 0)];\n    if (target) {\n      rootEl.insertBefore(clone, target);\n    } else {\n      rootEl.appendChild(clone);\n    }\n  });\n}\nfunction removeMultiDragElements() {\n  multiDragElements.forEach(function (multiDragElement) {\n    if (multiDragElement === dragEl$1) return;\n    multiDragElement.parentNode && multiDragElement.parentNode.removeChild(multiDragElement);\n  });\n}\n\nSortable.mount(new AutoScrollPlugin());\nSortable.mount(Remove, Revert);\n\nexport default Sortable;\nexport { MultiDragPlugin as MultiDrag, Sortable, SwapPlugin as Swap };\n", "import { Controller } from \"@hotwired/stimulus\"\nimport Sortable from \"sortablejs\"\n\nexport default class extends Controller {\n  static values = {\n    handle: String,\n    animation: { type: Number, default: 150 }\n  }\n\n  connect() {\n    this.sortable = Sortable.create(this.element, {\n      handle: this.hasHandleValue ? this.handleValue : undefined,\n      animation: this.animationValue,\n      onEnd: this.end.bind(this)\n    })\n\n    this.updatePositions()\n\n    // Listen for cocoon events\n    this.boundInsertHandler = this.handleCocoonInsert.bind(this)\n    this.boundRemoveHandler = this.handleCocoonRemove.bind(this)\n    \n    this.element.addEventListener('cocoon:after-insert', this.boundInsertHandler)\n    this.element.addEventListener('cocoon:after-remove', this.boundRemoveHandler)\n    \n    // Also use MutationObserver as a fallback to detect DOM changes\n    this.observer = new MutationObserver((mutations) => {\n      let shouldUpdate = false\n      mutations.forEach((mutation) => {\n        if (mutation.type === 'childList' && (mutation.addedNodes.length > 0 || mutation.removedNodes.length > 0)) {\n          shouldUpdate = true\n        }\n      })\n      if (shouldUpdate) {\n        requestAnimationFrame(() => {\n          this.updatePositions()\n        })\n      }\n    })\n    \n    this.observer.observe(this.element, {\n      childList: true,\n      subtree: true\n    })\n  }\n\n  disconnect() {\n    if (this.sortable) {\n      this.sortable.destroy()\n    }\n    \n    if (this.observer) {\n      this.observer.disconnect()\n    }\n    \n    this.element.removeEventListener('cocoon:after-insert', this.boundInsertHandler)\n    this.element.removeEventListener('cocoon:after-remove', this.boundRemoveHandler)\n  }\n\n  end(event) {\n    this.updatePositions()\n  }\n\n  handleCocoonInsert(event) {\n    // Update positions after insertion\n    requestAnimationFrame(() => {\n      this.updatePositions()\n    })\n  }\n\n  handleCocoonRemove(event) {\n    // Update positions after removal\n    requestAnimationFrame(() => {\n      this.updatePositions()\n    })\n  }\n\n  updatePositions() {\n    const items = this.element.querySelectorAll('.nested-fields:not([style*=\"display: none\"]):not([style*=\"display:none\"])')\n    \n    items.forEach((item, index) => {\n      const positionInput = item.querySelector('input[name*=\"[position]\"]')\n      const positionDisplay = item.querySelector('.position-display')\n      \n      const newPosition = index + 1\n      \n      if (positionInput) {\n        positionInput.value = newPosition\n      }\n      \n      if (positionDisplay) {\n        positionDisplay.textContent = newPosition\n      }\n    })\n  }\n}\n\n", "import { Controller } from \"@hotwired/stimulus\";\n\nexport default class extends Controller {\n  static values = {\n    language: String\n  }\n\n  connect() {\n    this.replacementText = this.languageValue === 'fr' ? 'devis' : 'estimate';\n    this.setupFormListeners();\n  }\n\n  setupFormListeners() {\n    const form = this.element.querySelector('form');\n    if (form) {\n      const fields = ['invoice_proforma_info', 'invoice_pdf_name', 'invoice_proforma_no'];\n      fields.forEach(fieldId => {\n        const field = document.getElementById(fieldId);\n        if (field) {\n          field.addEventListener('input', () => this.updateSeePdfLink());\n          field.addEventListener('change', () => this.updateSeePdfLink());\n        }\n      });\n      \n      const dateInput = form.querySelector('input[name*=\"proforma_date\"]');\n      if (dateInput) {\n        dateInput.addEventListener('change', () => this.updateSeePdfLink());\n        dateInput.addEventListener('input', () => this.updateSeePdfLink());\n      }\n    }\n  }\n\n  changeToEstimate() {\n    // Replace in pdf_name field\n    const pdfNameInput = document.getElementById('invoice_pdf_name');\n    if (pdfNameInput) {\n      pdfNameInput.value = this.replaceText(pdfNameInput.value);\n    }\n\n    // Replace in email_subject field\n    const emailSubjectInput = document.getElementById('invoice_email_subject');\n    if (emailSubjectInput) {\n      emailSubjectInput.value = this.replaceText(emailSubjectInput.value);\n    }\n\n    // Replace in email_body (TinyMCE editor)\n    const emailBodyTextarea = document.querySelector('textarea.tinymce');\n    if (emailBodyTextarea) {\n      const editorId = emailBodyTextarea.id;\n      if (window.tinymce && window.tinymce.get(editorId)) {\n        const editor = window.tinymce.get(editorId);\n        const currentContent = editor.getContent();\n        editor.setContent(this.replaceTextInHtml(currentContent));\n      } else {\n        // Fallback if TinyMCE is not initialized yet\n        emailBodyTextarea.value = this.replaceTextInHtml(emailBodyTextarea.value);\n      }\n    }\n\n    // Replace in proforma_info field\n    const proformaInfoInput = document.getElementById('invoice_proforma_info');\n    if (proformaInfoInput) {\n      proformaInfoInput.value = this.replaceText(proformaInfoInput.value);\n    }\n\n    // Update the \"See PDF\" link to include updated form values\n    this.updateSeePdfLink();\n  }\n\n  updateSeePdfLink() {\n    const seePdfLink = document.getElementById('see_proforma_pdf');\n    if (!seePdfLink) return;\n\n    const proformaNoInput = document.getElementById('invoice_proforma_no');\n    const proformaDateInput = document.querySelector('input[name=\"invoice[proforma_date]\"]') || \n                              document.querySelector('input[name*=\"proforma_date\"]') ||\n                              document.querySelector('#invoice_proforma_date');\n    const proformaInfoInput = document.getElementById('invoice_proforma_info');\n    const pdfNameInput = document.getElementById('invoice_pdf_name');\n\n    const proformaNo = proformaNoInput ? proformaNoInput.value : '';\n    let proformaDate = '';\n    if (proformaDateInput) {\n      if (proformaDateInput.type === 'hidden') {\n        proformaDate = proformaDateInput.value;\n      } else {\n        proformaDate = proformaDateInput.value;\n      }\n    }\n    const proformaInfo = proformaInfoInput ? proformaInfoInput.value : '';\n    const pdfName = pdfNameInput ? pdfNameInput.value : '';\n\n    const baseUrl = seePdfLink.getAttribute('href').split('?')[0];\n    const params = new URLSearchParams();\n    if (proformaNo) params.append('proforma_no', proformaNo);\n    if (proformaDate) params.append('proforma_date', proformaDate);\n    if (proformaInfo) params.append('proforma_info', proformaInfo);\n    if (pdfName) params.append('pdf_name', pdfName);\n\n    seePdfLink.setAttribute('href', `${baseUrl}?${params.toString()}`);\n  }\n\n  replaceText(text) {\n    if (!text) return text;\n    \n    let result = text;\n    \n    // For French, replace \"facture proforma\" and \"facture pro forma\" with \"devis\"\n    if (this.languageValue === 'fr') {\n      // Replace \"facture pro forma\" first (with space)\n      result = result.replace(/facture\\s+pro\\s+forma/gi, (match) => {\n        return this.preserveCapitalization(match, 'devis');\n      });\n      // Then replace \"facture proforma\" (without space)\n      result = result.replace(/facture\\s+proforma/gi, (match) => {\n        return this.preserveCapitalization(match, 'devis');\n      });\n    }\n    \n    // Case-insensitive replacement of \"proforma\" and \"pro forma\" (with space)\n    // Replace \"pro forma\" first to avoid partial replacements\n    // Preserve capitalization: if original starts with capital, replacement should too\n    result = result.replace(/pro\\s+forma/gi, (match) => {\n      return this.preserveCapitalization(match, this.replacementText);\n    });\n    result = result.replace(/proforma/gi, (match) => {\n      return this.preserveCapitalization(match, this.replacementText);\n    });\n    \n    return result;\n  }\n\n  replaceTextInHtml(html) {\n    if (!html) return html;\n    \n    // For HTML content, we need to be more careful to preserve HTML structure\n    // Replace in text nodes while preserving HTML tags\n    let result = html;\n    \n    // For French, replace \"facture proforma\" and \"facture pro forma\" with \"devis\"\n    if (this.languageValue === 'fr') {\n      // Replace \"facture pro forma\" first (with space)\n      result = result.replace(/facture\\s+pro\\s+forma/gi, (match) => {\n        return this.preserveCapitalization(match, 'devis');\n      });\n      // Then replace \"facture proforma\" (without space)\n      result = result.replace(/facture\\s+proforma/gi, (match) => {\n        return this.preserveCapitalization(match, 'devis');\n      });\n    }\n    \n    // Replace \"pro forma\" (with space) first, case-insensitive, preserving capitalization\n    result = result.replace(/pro\\s+forma/gi, (match) => {\n      return this.preserveCapitalization(match, this.replacementText);\n    });\n    // Then replace \"proforma\" (without space), case-insensitive, preserving capitalization\n    result = result.replace(/proforma/gi, (match) => {\n      return this.preserveCapitalization(match, this.replacementText);\n    });\n    \n    return result;\n  }\n\n  preserveCapitalization(original, replacement) {\n    if (original[0] === original[0].toUpperCase()) {\n      return replacement.charAt(0).toUpperCase() + replacement.slice(1);\n    }\n    return replacement;\n  }\n}\n", "import { Controller } from \"@hotwired/stimulus\";\n\nexport default class extends Controller {\n  static targets = [\"contactGroupSelect\", \"proformaSelect\"];\n\n  connect() {\n    this.bindEvents();\n  }\n\n  bindEvents() {\n    const contactGroupSelect = this.contactGroupSelectTarget;\n    \n    if (!contactGroupSelect) return;\n\n    if (window.$ && window.$(contactGroupSelect).hasClass('select2-hidden-accessible')) {\n      window.$(contactGroupSelect).on('select2:select', (e) => {\n        this.syncProformaContactGroup(e);\n      });\n    } else {\n      contactGroupSelect.addEventListener('change', (e) => {\n        this.syncProformaContactGroup(e);\n      });\n    }\n  }\n\n  syncProformaContactGroup(event) {\n    if (!this.hasProformaSelectTarget) return;\n\n    const contactGroupSelect = event.target || this.contactGroupSelectTarget;\n    const selectedValue = contactGroupSelect.value;\n    const proformaSelect = this.proformaSelectTarget;\n\n    if (!selectedValue) return;\n\n    if (window.$ && window.$(proformaSelect).hasClass('select2-hidden-accessible')) {\n      window.$(proformaSelect).val(selectedValue).trigger('change');\n    } else {\n      proformaSelect.value = selectedValue;\n      const changeEvent = new Event('change', { bubbles: true });\n      proformaSelect.dispatchEvent(changeEvent);\n    }\n  }\n\n  disconnect() {\n    const contactGroupSelect = this.contactGroupSelectTarget;\n    if (contactGroupSelect && window.$ && window.$(contactGroupSelect).hasClass('select2-hidden-accessible')) {\n      window.$(contactGroupSelect).off('select2:select');\n    }\n  }\n}\n", "import { Controller } from \"@hotwired/stimulus\"\n\nexport default class extends Controller {\n  static targets = [\"displayedAmount\", \"billingStatus\", \"relatedCase\"]\n\n  connect() {\n    if (this.hasDisplayedAmountTarget) {\n      this.previousValue = this.displayedAmountTarget.value\n      this.setupListeners()\n    }\n    \n    // Feature starts disabled, will be enabled based on case selection and financial rights\n    this.featureEnabled = false\n    \n    this.setupCaseListener()\n    \n    // Check financial rights on initial load if a case is already selected\n    if (this.hasRelatedCaseTarget) {\n      const initialCaseId = $(this.relatedCaseTarget).val()\n      if (initialCaseId) {\n        this.checkFinancialRights(initialCaseId)\n      }\n    }\n  }\n\n  setupListeners() {\n    this.displayedAmountTarget.addEventListener('change', this.handleDisplayedAmountChange.bind(this))\n  }\n  \n  setupCaseListener() {\n    if (this.hasRelatedCaseTarget) {\n      const caseSelect = this.relatedCaseTarget\n      $(caseSelect).on('select2:select', this.handleCaseChange.bind(this))\n      $(caseSelect).on('select2:unselect', this.handleCaseClear.bind(this))\n      $(caseSelect).on('select2:clear', this.handleCaseClear.bind(this))\n    }\n  }\n  \n  handleCaseChange(event) {\n    const caseId = event.params.data.real_id\n    if (!caseId) {\n      this.featureEnabled = false\n      return\n    }\n    \n    this.checkFinancialRights(caseId)\n  }\n  \n  handleCaseClear() {\n    this.featureEnabled = false\n  }\n  \n  checkFinancialRights(caseId) {\n    fetch(`/cases/check_financial_rights.json?id=${encodeURIComponent(caseId)}`, {\n      method: 'GET',\n      headers: {\n        'Accept': 'application/json',\n        'X-CSRF-Token': document.querySelector('[name=\"csrf-token\"]').content\n      }\n    })\n    .then(response => response.json())\n    .then(data => {\n      this.featureEnabled = data.has_financial_rights\n    })\n    .catch(error => {\n      this.featureEnabled = false\n    })\n  }\n\n  handleDisplayedAmountChange(event) {\n    if (!this.featureEnabled) {\n      if (this.hasRelatedCaseTarget) {\n        const caseId = $(this.relatedCaseTarget).val()\n        if (caseId) {\n          this.checkFinancialRightsAndProceed(event)\n          return\n        }\n      }\n      this.previousValue = event.target.value.trim()\n      return\n    }\n    \n    this.processAmountChange(event)\n  }\n  \n  checkFinancialRightsAndProceed(event) {\n    const caseId = $(this.relatedCaseTarget).val()\n    \n    fetch(`/cases/check_financial_rights.json?id=${encodeURIComponent(caseId)}`, {\n      method: 'GET',\n      headers: {\n        'Accept': 'application/json',\n        'X-CSRF-Token': document.querySelector('[name=\"csrf-token\"]').content\n      }\n    })\n    .then(response => response.json())\n    .then(data => {\n      if (data.has_financial_rights) {\n        this.processAmountChange(event)\n      } else {\n        this.previousValue = event.target.value.trim()\n      }\n    })\n    .catch(error => {\n      this.previousValue = event.target.value.trim()\n    })\n  }\n  \n  processAmountChange(event) {\n    const currentValue = event.target.value.trim()\n    const numericValue = parseFloat(currentValue)\n\n    if (numericValue === 0) {\n      const userConfirmed = confirm(\"Should this be unbillable? Be careful, if you select yes, this Billable will not be included in any Invoice.\")\n      \n      if (userConfirmed) {\n        this.setBillingStatus('unbillable')\n      }\n      this.previousValue = currentValue\n    } \n    else if (this.previousValue === '0' && currentValue !== '0') {\n      this.setBillingStatus('to be billed')\n      this.previousValue = currentValue\n    }\n    else {\n      this.previousValue = currentValue\n    }\n  }\n\n  setBillingStatus(status) {\n    this.billingStatusTargets.forEach(target => {\n      if (target.tagName === 'SELECT' || target.tagName === 'INPUT') {\n        target.value = status\n        \n        if (target.classList.contains('select2')) {\n          $(target).trigger('change')\n        }\n      }\n    })\n  }\n}\n", "import { Controller } from \"@hotwired/stimulus\";\n\nexport default class extends Controller {\n  static targets = [\"overwriteRecordedOwner\"];\n\n  connect() {\n    this.bindEvents();\n  }\n\n  bindEvents() {\n    if (this.hasOverwriteRecordedOwnerTarget) {\n      this.overwriteRecordedOwnerTarget.addEventListener(\"click\", this.overwriteRecordedOwner.bind(this));\n    }\n  }\n\n  get recordedOwnerTextarea() {\n    // Find the textarea within the controller's scope\n    // Try multiple selectors to be robust\n    return this.element.querySelector('textarea#patent_recorded_owner') ||\n           this.element.querySelector('textarea.tinymce#patent_recorded_owner') ||\n           this.element.querySelector('textarea.tinymce[name*=\"recorded_owner\"]') ||\n           this.element.querySelector('textarea[name*=\"recorded_owner\"]');\n  }\n\n  get ownershipCodesSelect() {\n    return this.element.querySelector('select[name*=\"ownership_codes\"]') ||\n           this.element.querySelector('select#patent_ownership_codes');\n  }\n\n  getOwnershipCodes() {\n    const select = this.ownershipCodesSelect;\n    if (!select) {\n      return [];\n    }\n\n    if (window.$ && window.$(select).data('select2')) {\n      return window.$(select).val() || [];\n    }\n\n    return Array.from(select.selectedOptions).map(option => option.value).filter(Boolean);\n  }\n\n  overwriteRecordedOwner() {\n    const textarea = this.recordedOwnerTextarea;\n    \n    if (!textarea) {\n      return;\n    }\n\n    const ownershipCodes = this.getOwnershipCodes();\n    \n    if (ownershipCodes.length === 0) {\n      return;\n    }\n\n    const params = new URLSearchParams();\n    ownershipCodes.forEach(code => {\n      params.append('ownership_codes[]', code);\n    });\n    \n    const url = `/applicants/calculate_recorded_owner?${params.toString()}`;\n    \n    fetch(url)\n      .then(response => {\n        return response.json();\n      })\n      .then(data => {\n        const editorId = textarea.id;\n        \n        if (window.tinymce && window.tinymce.get(editorId)) {\n          const editor = window.tinymce.get(editorId);\n          editor.setContent(data.recorded_owner);\n          editor.fire('change');\n        } else {\n          // Fallback if TinyMCE is not initialized yet\n          textarea.value = data.recorded_owner;\n          textarea.dispatchEvent(new Event(\"change\", { bubbles: true }));\n        }\n      })\n  }\n}\n", "import { Controller } from \"@hotwired/stimulus\"\n\nexport default class extends Controller {\n  static targets = [\"to\", \"cc\", \"subject\", \"body\"]\n\n  switchContactGroup(event) {\n    const type = event.currentTarget.dataset.type\n    const url = new URL(window.location.href)\n    url.searchParams.set('contact_group_type', type)\n    window.location.href = url.toString()\n  }\n\n  getEmailData() {\n    let bodyContent = ''\n    if (typeof tinymce !== 'undefined' && tinymce.get(this.bodyTarget.id)) {\n      bodyContent = tinymce.get(this.bodyTarget.id).getContent()\n    } else {\n      bodyContent = this.bodyTarget.value\n    }\n\n    return {\n      to: this.toTarget.value,\n      cc: this.ccTarget.value,\n      subject: this.subjectTarget.value,\n      body: bodyContent\n    }\n  }\n\n  stripHtml(html) {\n    let tmp = document.createElement('div')\n    tmp.innerHTML = html\n    tmp.innerHTML = tmp.innerHTML.replace(/<br\\s*\\/?>/gi, '\\n')\n    tmp.innerHTML = tmp.innerHTML.replace(/<\\/(p|div)>/gi, '\\n\\n')\n    const text = tmp.textContent || tmp.innerText || ''\n    // Collapse multiple spaces/newlines from HTML (e.g. </strong> </span> )\n    return text\n      .replace(/[ \\t]+/g, ' ')\n      .replace(/\\n[ \\t]+/g, '\\n')   // no space right after line break\n      .replace(/\\n{3,}/g, '\\n\\n')\n      .trim()\n  }\n\n  openInMailer() {\n    const data = this.getEmailData()\n    const bodyText = this.stripHtml(data.body)\n\n    let mailtoUrl = 'mailto:' + encodeURIComponent(data.to)\n\n    const params = []\n    if (data.cc) {\n      params.push('cc=' + encodeURIComponent(data.cc))\n    }\n    if (data.subject) {\n      params.push('subject=' + encodeURIComponent(data.subject))\n    }\n    if (bodyText) {\n      params.push('body=' + encodeURIComponent(bodyText))\n    }\n\n    if (params.length > 0) {\n      mailtoUrl += '?' + params.join('&')\n    }\n\n    if (mailtoUrl.length > 2000) {\n      alert('Email content is too long for mailto link. The email body has been truncated. Consider using \"Copy to Clipboard\" instead.')\n      const maxBodyLength = Math.max(0, 1800 - mailtoUrl.indexOf('body='))\n      const truncatedBody = bodyText.substring(0, maxBodyLength) + '...'\n\n      mailtoUrl = 'mailto:' + encodeURIComponent(data.to)\n      const newParams = []\n      if (data.cc) newParams.push('cc=' + encodeURIComponent(data.cc))\n      if (data.subject) newParams.push('subject=' + encodeURIComponent(data.subject))\n      newParams.push('body=' + encodeURIComponent(truncatedBody))\n      mailtoUrl += '?' + newParams.join('&')\n    }\n\n    window.location.href = mailtoUrl\n  }\n\n  copyToClipboard() {\n    const data = this.getEmailData()\n    const bodyText = this.stripHtml(data.body)\n\n    const emailText = `To: ${data.to}\n      CC: ${data.cc}\n      Subject: ${data.subject}\n\n      ${bodyText}`\n\n    navigator.clipboard.writeText(emailText)\n  }\n}\n", "import { Controller } from \"@hotwired/stimulus\"\n\nconst IDB_NAME = \"PatentExpensePdf\"\nconst IDB_STORE = \"files\"\nconst PENDING_PDF_KEY = \"pending_invoice_pdf\"\n\nexport default class extends Controller {\n  static targets = [\"dropzone\", \"viewerWrapper\", \"iframe\", \"clearButton\"]\n\n  connect() {\n    if (this.hasDropzoneTarget) {\n      this.initViewer()\n      this.loadPendingPdfFromStorage()\n    }\n  }\n\n  disconnect() {\n    if (this.objectUrl) {\n      URL.revokeObjectURL(this.objectUrl)\n      this.objectUrl = null\n    }\n  }\n\n  initViewer() {\n    this.objectUrl = null\n    this.bindDropzone()\n    this.clearButtonTarget.addEventListener(\"click\", this.clear.bind(this))\n  }\n\n  async loadPendingPdfFromStorage() {\n    try {\n      const db = await this.openDb()\n      const blob = await new Promise((resolve) => {\n        const tx = db.transaction(IDB_STORE, \"readwrite\")\n        const store = tx.objectStore(IDB_STORE)\n        const req = store.get(PENDING_PDF_KEY)\n        req.onsuccess = () => {\n          const blob = req.result\n          if (blob) store.delete(PENDING_PDF_KEY)\n          resolve(blob || null)\n        }\n        req.onerror = () => resolve(null)\n      })\n      db.close()\n      if (blob) {\n        this.objectUrl = URL.createObjectURL(blob)\n        this.showPdf(this.objectUrl)\n      }\n    } catch (_err) {\n      // ignore\n    }\n  }\n\n  openDb() {\n    return new Promise((resolve, reject) => {\n      const req = indexedDB.open(IDB_NAME, 1)\n      req.onsuccess = () => resolve(req.result)\n      req.onerror = () => reject(req.error)\n      req.onupgradeneeded = (e) => {\n        e.target.result.createObjectStore(IDB_STORE)\n      }\n    })\n  }\n\n  bindDropzone() {\n    const dz = this.dropzoneTarget\n    ;[\"drag\", \"dragstart\", \"dragend\", \"dragover\", \"dragenter\", \"dragleave\", \"drop\"].forEach((ev) => {\n      dz.addEventListener(ev, (e) => {\n        e.preventDefault()\n        e.stopPropagation()\n      })\n    })\n    ;[\"dragover\", \"dragenter\"].forEach((ev) => {\n      dz.addEventListener(ev, () => dz.classList.add(\"bg-blue-50\", \"border-blue-500\", \"text-blue-600\"))\n    })\n    ;[\"dragleave\", \"dragend\", \"drop\"].forEach((ev) => {\n      dz.addEventListener(ev, () => dz.classList.remove(\"bg-blue-50\", \"border-blue-500\", \"text-blue-600\"))\n    })\n    dz.addEventListener(\"drop\", (e) => this.onDrop(e))\n  }\n\n  onDrop(e) {\n    const files = e.dataTransfer?.files\n    if (!files?.length) return\n    const file = files[0]\n    if (file.type !== \"application/pdf\") return\n    if (this.objectUrl) {\n      URL.revokeObjectURL(this.objectUrl)\n      this.objectUrl = null\n    }\n    this.objectUrl = URL.createObjectURL(file)\n    this.showPdf(this.objectUrl)\n  }\n\n  showPdf(url) {\n    const isBlob = typeof url === \"string\" && url.startsWith(\"blob:\")\n    if (isBlob) {\n      const previousObjectUrl = this.objectUrl\n      this.objectUrl = url\n      if (previousObjectUrl && previousObjectUrl !== url) {\n        URL.revokeObjectURL(previousObjectUrl)\n      }\n    } else {\n      this.objectUrl = null\n    }\n    this.iframeTarget.src = url\n    this.dropzoneTarget.classList.add(\"hidden\")\n    this.viewerWrapperTarget.classList.remove(\"hidden\")\n    this.clearButtonTarget.classList.remove(\"hidden\")\n  }\n\n  clear() {\n    if (this.objectUrl) {\n      URL.revokeObjectURL(this.objectUrl)\n      this.objectUrl = null\n    }\n    this.iframeTarget.src = \"\"\n    this.dropzoneTarget.classList.remove(\"hidden\")\n    this.viewerWrapperTarget.classList.add(\"hidden\")\n    this.clearButtonTarget.classList.add(\"hidden\")\n  }\n}\n", "import { Controller } from \"@hotwired/stimulus\"\n\nconst IDB_NAME = \"PatentExpensePdf\"\nconst IDB_STORE = \"files\"\nconst PENDING_PDF_KEY = \"pending_invoice_pdf\"\n\n// Wraps the \"New Patent Expense\" link so dropping a PDF stores it in IndexedDB and redirects to the form.\nexport default class extends Controller {\n  static values = {\n    newPatentExpensePath: String\n  }\n\n  connect() {\n    this.bindDropzone()\n  }\n\n  bindDropzone() {\n    const el = this.element\n    ;[\"drag\", \"dragstart\", \"dragend\", \"dragover\", \"dragenter\", \"dragleave\", \"drop\"].forEach((ev) => {\n      el.addEventListener(ev, (e) => {\n        e.preventDefault()\n        e.stopPropagation()\n      })\n    })\n    ;[\"dragover\", \"dragenter\"].forEach((ev) => {\n      el.addEventListener(ev, () => el.classList.add(\"border\", \"border-primary\", \"rounded\"))\n    })\n    ;[\"dragleave\", \"dragend\", \"drop\"].forEach((ev) => {\n      el.addEventListener(ev, () => el.classList.remove(\"border\", \"border-primary\", \"rounded\"))\n    })\n    el.addEventListener(\"drop\", (e) => this.onDrop(e))\n  }\n\n  async onDrop(e) {\n    const files = e.dataTransfer?.files\n    if (!files?.length) return\n    const file = files[0]\n    if (file.type !== \"application/pdf\") return\n\n    const path = this.newPatentExpensePathValue\n    if (!path) return\n\n    try {\n      const db = await this.openDb()\n      await new Promise((resolve, reject) => {\n        const tx = db.transaction(IDB_STORE, \"readwrite\")\n        tx.objectStore(IDB_STORE).put(file, PENDING_PDF_KEY)\n        tx.oncomplete = () => resolve()\n        tx.onerror = () => reject(tx.error)\n      })\n      db.close()\n      window.location.href = path\n    } catch (_err) {\n      // fallback: open form without pre-loaded PDF\n      window.location.href = path\n    }\n  }\n\n  openDb() {\n    return new Promise((resolve, reject) => {\n      const req = indexedDB.open(IDB_NAME, 1)\n      req.onsuccess = () => resolve(req.result)\n      req.onerror = () => reject(req.error)\n      req.onupgradeneeded = (e) => {\n        e.target.result.createObjectStore(IDB_STORE)\n      }\n    })\n  }\n}\n", "function _extends() {\n  return _extends = Object.assign ? Object.assign.bind() : function (n) {\n    for (var e = 1; e < arguments.length; e++) {\n      var t = arguments[e];\n      for (var r in t) ({}).hasOwnProperty.call(t, r) && (n[r] = t[r]);\n    }\n    return n;\n  }, _extends.apply(null, arguments);\n}\nexport { _extends as default };", "export var DEFAULT_CONFIG = {\n  // minimum relative difference between two compared values,\n  // used by all comparison functions\n  relTol: 1e-12,\n  // minimum absolute difference between two compared values,\n  // used by all comparison functions\n  absTol: 1e-15,\n  // type of default matrix output. Choose 'matrix' (default) or 'array'\n  matrix: 'Matrix',\n  // type of default number output. Choose 'number' (default) 'BigNumber', 'bigint', or 'Fraction'\n  number: 'number',\n  // type of fallback used for config { number: 'bigint' } when a value cannot be represented\n  // in the configured numeric type. Choose 'number' (default) or 'BigNumber'.\n  numberFallback: '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  // legacy behavior for matrix subset. When true, the subset function\n  // returns a matrix or array with the same size as the index (except for scalars).\n  // When false, it returns a matrix or array with a size depending on the type of index.\n  legacySubset: false\n};", "import { hasOwnProperty } from './object.js';\n\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 (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 (isSafeProperty(object, prop)) {\n    object[prop] = value;\n    return value;\n  }\n  throw new Error('No access to property \"' + prop + '\"');\n}\n\n/**\n * Test whether a property is safe to use on an object or Array.\n * For example .toString and .constructor are not safe\n * @param {Object | Array} object\n * @param {string} prop\n * @return {boolean} Returns true when safe\n */\nfunction isSafeProperty(object, prop) {\n  if (!isPlainObject(object) && !Array.isArray(object)) {\n    return false;\n  }\n  // SAFE: whitelisted\n  // e.g length\n  if (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 * @return {function} Returns the method when valid\n */\nfunction getSafeMethod(object, method) {\n  if (!isSafeMethod(object, method)) {\n    throw new Error('No access to method \"' + method + '\"');\n  }\n  return object[method];\n}\n\n/**\n * Check whether a method is safe.\n * Throws an error when that's not the case (for example for `constructor`).\n * @param {Object} object\n * @param {string} method\n * @return {boolean} Returns true when safe, false otherwise\n */\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 (hasOwnProperty(object, method) && Object.getPrototypeOf && method in Object.getPrototypeOf(object)) {\n    return false;\n  }\n  // SAFE: whitelisted\n  // e.g toString\n  if (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 typeof 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};\nexport { getSafeProperty };\nexport { setSafeProperty };\nexport { isSafeProperty };\nexport { getSafeMethod };\nexport { isSafeMethod };\nexport { isPlainObject };", "import { getSafeProperty, isSafeProperty, setSafeProperty } from './customs.js';\nimport { isMap, isObject } from './is.js';\n\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 */\nexport class ObjectWrappingMap {\n  constructor(object) {\n    this.wrappedObject = object;\n    this[Symbol.iterator] = this.entries;\n  }\n  keys() {\n    return Object.keys(this.wrappedObject).filter(key => this.has(key)).values();\n  }\n  get(key) {\n    return getSafeProperty(this.wrappedObject, key);\n  }\n  set(key, value) {\n    setSafeProperty(this.wrappedObject, key, value);\n    return this;\n  }\n  has(key) {\n    return isSafeProperty(this.wrappedObject, key) && key in this.wrappedObject;\n  }\n  entries() {\n    return mapIterator(this.keys(), key => [key, this.get(key)]);\n  }\n  forEach(callback) {\n    for (var key of this.keys()) {\n      callback(this.get(key), key, this);\n    }\n  }\n  delete(key) {\n    if (isSafeProperty(this.wrappedObject, key)) {\n      delete this.wrappedObject[key];\n    }\n  }\n  clear() {\n    for (var key of this.keys()) {\n      this.delete(key);\n    }\n  }\n  get size() {\n    return Object.keys(this.wrappedObject).length;\n  }\n}\n\n/**\n * Create a map with two partitions: a and b.\n * The set with bKeys determines which keys/values are read/written to map b,\n * all other values are read/written to map a\n *\n * For example:\n *\n *   const a = new Map()\n *   const b = new Map()\n *   const p = new PartitionedMap(a, b, new Set(['x', 'y']))\n *\n * In this case, values `x` and `y` are read/written to map `b`,\n * all other values are read/written to map `a`.\n */\nexport class PartitionedMap {\n  /**\n   * @param {Map} a\n   * @param {Map} b\n   * @param {Set} bKeys\n   */\n  constructor(a, b, bKeys) {\n    this.a = a;\n    this.b = b;\n    this.bKeys = bKeys;\n    this[Symbol.iterator] = this.entries;\n  }\n  get(key) {\n    return this.bKeys.has(key) ? this.b.get(key) : this.a.get(key);\n  }\n  set(key, value) {\n    if (this.bKeys.has(key)) {\n      this.b.set(key, value);\n    } else {\n      this.a.set(key, value);\n    }\n    return this;\n  }\n  has(key) {\n    return this.b.has(key) || this.a.has(key);\n  }\n  keys() {\n    return new Set([...this.a.keys(), ...this.b.keys()])[Symbol.iterator]();\n  }\n  entries() {\n    return mapIterator(this.keys(), key => [key, this.get(key)]);\n  }\n  forEach(callback) {\n    for (var key of this.keys()) {\n      callback(this.get(key), key, this);\n    }\n  }\n  delete(key) {\n    return this.bKeys.has(key) ? this.b.delete(key) : this.a.delete(key);\n  }\n  clear() {\n    this.a.clear();\n    this.b.clear();\n  }\n  get size() {\n    return [...this.keys()].length;\n  }\n}\n\n/**\n * Create a new iterator that maps over the provided iterator, applying a mapping function to each item\n */\nfunction mapIterator(it, callback) {\n  return {\n    next: () => {\n      var n = it.next();\n      return n.done ? n : {\n        value: callback(n.value),\n        done: false\n      };\n    }\n  };\n}\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 */\nexport function 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 */\nexport function createMap(mapOrObject) {\n  if (!mapOrObject) {\n    return createEmptyMap();\n  }\n  if (isMap(mapOrObject)) {\n    return mapOrObject;\n  }\n  if (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 */\nexport function toObject(map) {\n  if (map instanceof ObjectWrappingMap) {\n    return map.wrappedObject;\n  }\n  var object = {};\n  for (var key of map.keys()) {\n    var value = map.get(key);\n    setSafeProperty(object, key, value);\n  }\n  return object;\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 */\nexport function 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 args of objects) {\n    if (!args) {\n      continue;\n    }\n    if (isMap(args)) {\n      for (var key of args.keys()) {\n        map.set(key, args.get(key));\n      }\n    } else if (isObject(args)) {\n      for (var _key2 of Object.keys(args)) {\n        map.set(_key2, args[_key2]);\n      }\n    }\n  }\n  return map;\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\nimport { ObjectWrappingMap } from './map.js';\nexport function isNumber(x) {\n  return typeof x === 'number';\n}\nexport function isBigNumber(x) {\n  if (!x || typeof x !== 'object' || typeof x.constructor !== 'function') {\n    return false;\n  }\n  if (x.isBigNumber === true && typeof 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}\nexport function isBigInt(x) {\n  return typeof x === 'bigint';\n}\nexport function isComplex(x) {\n  return x && typeof x === 'object' && Object.getPrototypeOf(x).isComplex === true || false;\n}\nexport function isFraction(x) {\n  return x && typeof x === 'object' && Object.getPrototypeOf(x).isFraction === true || false;\n}\nexport function isUnit(x) {\n  return x && x.constructor.prototype.isUnit === true || false;\n}\nexport function isString(x) {\n  return typeof x === 'string';\n}\nexport var isArray = Array.isArray;\nexport function 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 */\nexport function isCollection(x) {\n  return Array.isArray(x) || isMatrix(x);\n}\nexport function isDenseMatrix(x) {\n  return x && x.isDenseMatrix && x.constructor.prototype.isMatrix === true || false;\n}\nexport function isSparseMatrix(x) {\n  return x && x.isSparseMatrix && x.constructor.prototype.isMatrix === true || false;\n}\nexport function isRange(x) {\n  return x && x.constructor.prototype.isRange === true || false;\n}\nexport function isIndex(x) {\n  return x && x.constructor.prototype.isIndex === true || false;\n}\nexport function isBoolean(x) {\n  return typeof x === 'boolean';\n}\nexport function isResultSet(x) {\n  return x && x.constructor.prototype.isResultSet === true || false;\n}\nexport function isHelp(x) {\n  return x && x.constructor.prototype.isHelp === true || false;\n}\nexport function isFunction(x) {\n  return typeof x === 'function';\n}\nexport function isDate(x) {\n  return x instanceof Date;\n}\nexport function isRegExp(x) {\n  return x instanceof RegExp;\n}\nexport function isObject(x) {\n  return !!(x && typeof x === 'object' && x.constructor === Object && !isComplex(x) && !isFraction(x));\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 */\nexport function 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}\nexport function isPartitionedMap(object) {\n  return isMap(object) && isMap(object.a) && isMap(object.b);\n}\nexport function isObjectWrappingMap(object) {\n  return isMap(object) && isObject(object.wrappedObject);\n}\nexport function isNull(x) {\n  return x === null;\n}\nexport function isUndefined(x) {\n  return x === undefined;\n}\nexport function isAccessorNode(x) {\n  return x && x.isAccessorNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isArrayNode(x) {\n  return x && x.isArrayNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isAssignmentNode(x) {\n  return x && x.isAssignmentNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isBlockNode(x) {\n  return x && x.isBlockNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isConditionalNode(x) {\n  return x && x.isConditionalNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function 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*/\nexport function rule2Node(node) {\n  return isConstantNode(node) || isOperatorNode(node) && node.args.length === 1 && isConstantNode(node.args[0]) && '-+~'.includes(node.op);\n}\nexport function isFunctionAssignmentNode(x) {\n  return x && x.isFunctionAssignmentNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isFunctionNode(x) {\n  return x && x.isFunctionNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isIndexNode(x) {\n  return x && x.isIndexNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isNode(x) {\n  return x && x.isNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isObjectNode(x) {\n  return x && x.isObjectNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isOperatorNode(x) {\n  return x && x.isOperatorNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isParenthesisNode(x) {\n  return x && x.isParenthesisNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isRangeNode(x) {\n  return x && x.isRangeNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isRelationalNode(x) {\n  return x && x.isRelationalNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isSymbolNode(x) {\n  return x && x.isSymbolNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isChain(x) {\n  return x && x.constructor.prototype.isChain === true || false;\n}\nexport function typeOf(x) {\n  var t = typeof 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  return t; // can be 'string', 'number', 'boolean', 'function', 'bigint', ...\n}", "import { isBigNumber, isObject } from './is.js';\n\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 */\nexport function clone(x) {\n  var type = typeof x;\n\n  // immutable primitive types\n  if (type === 'number' || type === 'bigint' || 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 (isBigNumber(x)) return x; // bignumbers are immutable\n\n  // object\n  if (isObject(x)) {\n    return mapObject(x, clone);\n  }\n  if (type === 'function') {\n    // we assume that the function is immutable\n    return x;\n  }\n  throw new TypeError(\"Cannot clone: unknown type of value (value: \".concat(x, \")\"));\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 */\nexport function 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 */\nexport function 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 */\nexport function deepExtend(a, b) {\n  // TODO: add support for Arrays to deepExtend\n  if (Array.isArray(b)) {\n    throw new TypeError('Arrays are not supported by deepExtend');\n  }\n  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 */\nexport function 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 */\nexport function 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 (typeof 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 */\nexport function 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 */\nexport function 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 */\nexport function 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 */\nexport function 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 */\nexport function 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 */\nexport function 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 */\nexport function 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 */\nexport function 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 */\nexport function 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}\n\n// helper function to test whether a string contains a path like 'user.name'\nfunction isPath(str) {\n  return str.includes('.');\n}", "import { clone, deepExtend } from '../../utils/object.js';\nimport { DEFAULT_CONFIG } from '../config.js';\nexport var MATRIX_OPTIONS = ['Matrix', 'Array']; // valid values for option matrix\nexport var NUMBER_OPTIONS = ['number', 'BigNumber', 'bigint', 'Fraction']; // valid values for option number\n\nexport function 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   *     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} relTol\n   *                              Minimum relative difference between two\n   *                              compared values, used by all comparison functions.\n   *                            {number} absTol\n   *                              Minimum absolute 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', 'bigint', 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      if (options.epsilon !== undefined) {\n        // this if is only for backwards compatibility, it can be removed in the future.\n        console.warn('Warning: The configuration option \"epsilon\" is deprecated. Use \"relTol\" and \"absTol\" instead.');\n        var optionsFix = clone(options);\n        optionsFix.relTol = options.epsilon;\n        optionsFix.absTol = options.epsilon * 1e-3;\n        delete optionsFix.epsilon;\n        return _config(optionsFix);\n      }\n      if (options.legacySubset === true) {\n        // this if is only for backwards compatibility, it can be removed in the future.\n        console.warn('Warning: The configuration option \"legacySubset\" is for compatibility only and might be deprecated in the future.');\n      }\n      var prev = clone(config);\n\n      // validate some of the options\n      validateOption(options, 'matrix', MATRIX_OPTIONS);\n      validateOption(options, 'number', NUMBER_OPTIONS);\n\n      // merge options\n      deepExtend(config, options);\n      var curr = clone(config);\n      var changes = clone(options);\n\n      // emit 'config' event\n      emit('config', curr, prev, changes);\n      return curr;\n    } else {\n      return clone(config);\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(DEFAULT_CONFIG).forEach(key => {\n    Object.defineProperty(_config, key, {\n      get: () => config[key],\n      enumerable: true,\n      configurable: true\n    });\n  });\n  return _config;\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 && !values.includes(options[name])) {\n    // unknown value\n    console.warn('Warning: Unknown value \"' + options[name] + '\" for configuration option \"' + name + '\". ' + 'Available options: ' + values.map(value => JSON.stringify(value)).join(', ') + '.');\n  }\n}", "import _extends from \"@babel/runtime/helpers/extends\";\nimport { DEFAULT_CONFIG } from '../core/config.js';\nimport { MATRIX_OPTIONS, NUMBER_OPTIONS } from '../core/function/config.js';\n\n// create a read-only version of config\nexport var config = 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(DEFAULT_CONFIG);\n};\n_extends(config, DEFAULT_CONFIG, {\n  MATRIX_OPTIONS,\n  NUMBER_OPTIONS\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\nimport typedFunction from 'typed-function';\nimport { factory } from '../../utils/factory.js';\nimport { isAccessorNode, isArray, isArrayNode, isAssignmentNode, isBigInt, isBigNumber, isBlockNode, isBoolean, isChain, isCollection, isComplex, isConditionalNode, isConstantNode, isDate, isDenseMatrix, isFraction, isFunction, isFunctionAssignmentNode, isFunctionNode, isHelp, isIndex, isIndexNode, isMap, isMatrix, isNode, isNull, isNumber, isObject, isObjectNode, isOperatorNode, isParenthesisNode, isRange, isRangeNode, isRegExp, isRelationalNode, isResultSet, isSparseMatrix, isString, isSymbolNode, isUndefined, isUnit } from '../../utils/is.js';\nimport { digits } from '../../utils/number.js';\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.create;\n  return typedFunction;\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 */\nexport var createTyped = /* #__PURE__ */factory('typed', dependencies, function createTyped(_ref) {\n  var {\n    BigNumber,\n    Complex,\n    DenseMatrix,\n    Fraction\n  } = _ref;\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: isNumber\n  }, {\n    name: 'Complex',\n    test: isComplex\n  }, {\n    name: 'BigNumber',\n    test: isBigNumber\n  }, {\n    name: 'bigint',\n    test: isBigInt\n  }, {\n    name: 'Fraction',\n    test: isFraction\n  }, {\n    name: 'Unit',\n    test: 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  // TODO: deprecate the identifier type (it's not used anymore, see https://github.com/josdejong/mathjs/issues/3253)\n  {\n    name: 'identifier',\n    test: s => 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-\\u088F\\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\\u0C5C\\u0C5D\\u0C60\\u0C61\\u0C80\\u0C85-\\u0C8C\\u0C8E-\\u0C90\\u0C92-\\u0CA8\\u0CAA-\\u0CB3\\u0CB5-\\u0CB9\\u0CBD\\u0CDC-\\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-\\u1C8A\\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-\\uA7DC\\uA7F1-\\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\\uDDC0-\\uDDF3\\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\\uDD40-\\uDD59\\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\\uDD4A-\\uDD65\\uDD6F-\\uDD85\\uDE80-\\uDEA9\\uDEB0\\uDEB1\\uDEC2-\\uDEC7\\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\\uDE3F\\uDE40\\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\\uDF80-\\uDF89\\uDF8B\\uDF8E\\uDF90-\\uDFB5\\uDFB7\\uDFD1\\uDFD3]|\\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\\uDFC0-\\uDFE0]|\\uD807[\\uDC00-\\uDC08\\uDC0A-\\uDC2E\\uDC40\\uDC72-\\uDC8F\\uDD00-\\uDD06\\uDD08\\uDD09\\uDD0B-\\uDD30\\uDD46\\uDD60-\\uDD65\\uDD67\\uDD68\\uDD6A-\\uDD89\\uDD98\\uDDB0-\\uDDDB\\uDEE0-\\uDEF2\\uDF02\\uDF04-\\uDF10\\uDF12-\\uDF33\\uDFB0]|\\uD808[\\uDC00-\\uDF99]|\\uD809[\\uDC80-\\uDD43]|\\uD80B[\\uDF90-\\uDFF0]|[\\uD80C\\uD80E\\uD80F\\uD81C-\\uD822\\uD840-\\uD868\\uD86A-\\uD86D\\uD86F-\\uD872\\uD874-\\uD879\\uD880-\\uD883\\uD885-\\uD88C][\\uDC00-\\uDFFF]|\\uD80D[\\uDC00-\\uDC2F\\uDC41-\\uDC46\\uDC60-\\uDFFF]|\\uD810[\\uDC00-\\uDFFA]|\\uD811[\\uDC00-\\uDE46]|\\uD818[\\uDD00-\\uDD1D]|\\uD81A[\\uDC00-\\uDE38\\uDE40-\\uDE5E\\uDE70-\\uDEBE\\uDED0-\\uDEED\\uDF00-\\uDF2F\\uDF40-\\uDF43\\uDF63-\\uDF77\\uDF7D-\\uDF8F]|\\uD81B[\\uDD40-\\uDD6C\\uDE40-\\uDE7F\\uDEA0-\\uDEB8\\uDEBB-\\uDED3\\uDF00-\\uDF4A\\uDF50\\uDF93-\\uDF9F\\uDFE0\\uDFE1\\uDFE3\\uDFF2\\uDFF3]|\\uD823[\\uDC00-\\uDCD5\\uDCFF-\\uDD1E\\uDD80-\\uDDF2]|\\uD82B[\\uDFF0-\\uDFF3\\uDFF5-\\uDFFB\\uDFFD\\uDFFE]|\\uD82C[\\uDC00-\\uDD22\\uDD32\\uDD50-\\uDD52\\uDD55\\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\\uDF25-\\uDF2A]|\\uD838[\\uDC30-\\uDC6D\\uDD00-\\uDD2C\\uDD37-\\uDD3D\\uDD4E\\uDE90-\\uDEAD\\uDEC0-\\uDEEB]|\\uD839[\\uDCD0-\\uDCEB\\uDDD0-\\uDDED\\uDDF0\\uDEC0-\\uDEDE\\uDEE0-\\uDEE2\\uDEE4\\uDEE5\\uDEE7-\\uDEED\\uDEF0-\\uDEF4\\uDEFE\\uDEFF\\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]|\\uD86E[\\uDC00-\\uDC1D\\uDC20-\\uDFFF]|\\uD873[\\uDC00-\\uDEAD\\uDEB0-\\uDFFF]|\\uD87A[\\uDC00-\\uDFE0\\uDFF0-\\uDFFF]|\\uD87B[\\uDC00-\\uDE5D]|\\uD87E[\\uDC00-\\uDE1D]|\\uD884[\\uDC00-\\uDF4A\\uDF50-\\uDFFF]|\\uD88D[\\uDC00-\\uDC79])(?:[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-\\u088F\\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\\u0C5C\\u0C5D\\u0C60\\u0C61\\u0C80\\u0C85-\\u0C8C\\u0C8E-\\u0C90\\u0C92-\\u0CA8\\u0CAA-\\u0CB3\\u0CB5-\\u0CB9\\u0CBD\\u0CDC-\\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-\\u1C8A\\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-\\uA7DC\\uA7F1-\\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\\uDDC0-\\uDDF3\\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\\uDD40-\\uDD59\\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\\uDD4A-\\uDD65\\uDD6F-\\uDD85\\uDE80-\\uDEA9\\uDEB0\\uDEB1\\uDEC2-\\uDEC7\\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\\uDE3F\\uDE40\\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\\uDF80-\\uDF89\\uDF8B\\uDF8E\\uDF90-\\uDFB5\\uDFB7\\uDFD1\\uDFD3]|\\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\\uDFC0-\\uDFE0]|\\uD807[\\uDC00-\\uDC08\\uDC0A-\\uDC2E\\uDC40\\uDC72-\\uDC8F\\uDD00-\\uDD06\\uDD08\\uDD09\\uDD0B-\\uDD30\\uDD46\\uDD60-\\uDD65\\uDD67\\uDD68\\uDD6A-\\uDD89\\uDD98\\uDDB0-\\uDDDB\\uDEE0-\\uDEF2\\uDF02\\uDF04-\\uDF10\\uDF12-\\uDF33\\uDFB0]|\\uD808[\\uDC00-\\uDF99]|\\uD809[\\uDC80-\\uDD43]|\\uD80B[\\uDF90-\\uDFF0]|[\\uD80C\\uD80E\\uD80F\\uD81C-\\uD822\\uD840-\\uD868\\uD86A-\\uD86D\\uD86F-\\uD872\\uD874-\\uD879\\uD880-\\uD883\\uD885-\\uD88C][\\uDC00-\\uDFFF]|\\uD80D[\\uDC00-\\uDC2F\\uDC41-\\uDC46\\uDC60-\\uDFFF]|\\uD810[\\uDC00-\\uDFFA]|\\uD811[\\uDC00-\\uDE46]|\\uD818[\\uDD00-\\uDD1D]|\\uD81A[\\uDC00-\\uDE38\\uDE40-\\uDE5E\\uDE70-\\uDEBE\\uDED0-\\uDEED\\uDF00-\\uDF2F\\uDF40-\\uDF43\\uDF63-\\uDF77\\uDF7D-\\uDF8F]|\\uD81B[\\uDD40-\\uDD6C\\uDE40-\\uDE7F\\uDEA0-\\uDEB8\\uDEBB-\\uDED3\\uDF00-\\uDF4A\\uDF50\\uDF93-\\uDF9F\\uDFE0\\uDFE1\\uDFE3\\uDFF2\\uDFF3]|\\uD823[\\uDC00-\\uDCD5\\uDCFF-\\uDD1E\\uDD80-\\uDDF2]|\\uD82B[\\uDFF0-\\uDFF3\\uDFF5-\\uDFFB\\uDFFD\\uDFFE]|\\uD82C[\\uDC00-\\uDD22\\uDD32\\uDD50-\\uDD52\\uDD55\\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\\uDF25-\\uDF2A]|\\uD838[\\uDC30-\\uDC6D\\uDD00-\\uDD2C\\uDD37-\\uDD3D\\uDD4E\\uDE90-\\uDEAD\\uDEC0-\\uDEEB]|\\uD839[\\uDCD0-\\uDCEB\\uDDD0-\\uDDED\\uDDF0\\uDEC0-\\uDEDE\\uDEE0-\\uDEE2\\uDEE4\\uDEE5\\uDEE7-\\uDEED\\uDEF0-\\uDEF4\\uDEFE\\uDEFF\\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]|\\uD86E[\\uDC00-\\uDC1D\\uDC20-\\uDFFF]|\\uD873[\\uDC00-\\uDEAD\\uDEB0-\\uDFFF]|\\uD87A[\\uDC00-\\uDFE0\\uDFF0-\\uDFFF]|\\uD87B[\\uDC00-\\uDE5D]|\\uD87E[\\uDC00-\\uDE1D]|\\uD884[\\uDC00-\\uDF4A\\uDF50-\\uDFFF]|\\uD88D[\\uDC00-\\uDC79])*$/.test(s)\n  }, {\n    name: 'string',\n    test: isString\n  }, {\n    name: 'Chain',\n    test: isChain\n  }, {\n    name: 'Array',\n    test: isArray\n  }, {\n    name: 'Matrix',\n    test: isMatrix\n  }, {\n    name: 'DenseMatrix',\n    test: isDenseMatrix\n  }, {\n    name: 'SparseMatrix',\n    test: isSparseMatrix\n  }, {\n    name: 'Range',\n    test: isRange\n  }, {\n    name: 'Index',\n    test: isIndex\n  }, {\n    name: 'boolean',\n    test: isBoolean\n  }, {\n    name: 'ResultSet',\n    test: isResultSet\n  }, {\n    name: 'Help',\n    test: isHelp\n  }, {\n    name: 'function',\n    test: isFunction\n  }, {\n    name: 'Date',\n    test: isDate\n  }, {\n    name: 'RegExp',\n    test: isRegExp\n  }, {\n    name: 'null',\n    test: isNull\n  }, {\n    name: 'undefined',\n    test: isUndefined\n  }, {\n    name: 'AccessorNode',\n    test: isAccessorNode\n  }, {\n    name: 'ArrayNode',\n    test: isArrayNode\n  }, {\n    name: 'AssignmentNode',\n    test: isAssignmentNode\n  }, {\n    name: 'BlockNode',\n    test: isBlockNode\n  }, {\n    name: 'ConditionalNode',\n    test: isConditionalNode\n  }, {\n    name: 'ConstantNode',\n    test: isConstantNode\n  }, {\n    name: 'FunctionNode',\n    test: isFunctionNode\n  }, {\n    name: 'FunctionAssignmentNode',\n    test: isFunctionAssignmentNode\n  }, {\n    name: 'IndexNode',\n    test: isIndexNode\n  }, {\n    name: 'Node',\n    test: isNode\n  }, {\n    name: 'ObjectNode',\n    test: isObjectNode\n  }, {\n    name: 'OperatorNode',\n    test: isOperatorNode\n  }, {\n    name: 'ParenthesisNode',\n    test: isParenthesisNode\n  }, {\n    name: 'RangeNode',\n    test: isRangeNode\n  }, {\n    name: 'RelationalNode',\n    test: isRelationalNode\n  }, {\n    name: 'SymbolNode',\n    test: isSymbolNode\n  }, {\n    name: 'Map',\n    test: isMap\n  }, {\n    name: 'Object',\n    test: isObject\n  } // order 'Object' last, it matches on other classes too\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 (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: 'bigint',\n    to: 'number',\n    convert: function convert(x) {\n      if (x > Number.MAX_SAFE_INTEGER) {\n        throw new TypeError('Cannot implicitly convert bigint to number: ' + 'value exceeds the max safe integer value (value: ' + x + ')');\n      }\n      return Number(x);\n    }\n  }, {\n    from: 'bigint',\n    to: 'BigNumber',\n    convert: function convert(x) {\n      if (!BigNumber) {\n        throwNoBignumber(x);\n      }\n      return new BigNumber(x.toString());\n    }\n  }, {\n    from: 'bigint',\n    to: 'Fraction',\n    convert: function convert(x) {\n      if (!Fraction) {\n        throwNoFraction(x);\n      }\n      return new Fraction(x);\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: 'bigint',\n    convert: function convert(x) {\n      try {\n        return BigInt(x);\n      } catch (err) {\n        throw new Error('Cannot convert \"' + x + '\" to BigInt');\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: 'bigint',\n    convert: function convert(x) {\n      return BigInt(+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 = (name, args, signatures) => {\n    var usualError = typed.createError(name, args, signatures);\n    if (['wrongType', 'mismatch'].includes(usualError.data.category) && args.length === 1 && isCollection(args[0]) &&\n    // check if the function can be unary:\n    signatures.some(sig => !sig.params.includes(','))) {\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 = (name, args, signatures) => {\n    var usualError = typed.createError(name, args, signatures);\n    if (['wrongType', 'mismatch'].includes(usualError.data.category) && args.length === 1 && isCollection(args[0]) &&\n    // check if the function can be unary:\n    signatures.some(sig => !sig.params.includes(','))) {\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});\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}", "import { pickShallow } from './object.js';\n\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]\n *     Optional object with meta information that will be attached\n *     to the created factory function as property `meta`. For explanation\n *     of what meta properties can be specified and what they mean, see\n *     docs/core/extension.md.\n * @returns {function}\n */\nexport function 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 = 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 */\nexport function sortFactories(factories) {\n  var factoriesByName = {};\n  factories.forEach(factory => {\n    factoriesByName[factory.fn] = factory;\n  });\n  function containsDependency(factory, dependency) {\n    // TODO: detect circular references\n    if (isFactory(factory)) {\n      if (factory.dependencies.includes(dependency.fn || dependency.name)) {\n        return true;\n      }\n      if (factory.dependencies.some(d => containsDependency(factoriesByName[d], dependency))) {\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(factory => !isFactory(factory)).forEach(addFactory);\n  return sorted;\n}\n\n// TODO: comment or cleanup if unused in the end\nexport function create(factories) {\n  var scope = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  sortFactories(factories).forEach(factory => factory(scope));\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 */\nexport function 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 */\nexport function assertDependencies(name, dependencies, scope) {\n  var allDefined = dependencies.filter(dependency => !isOptionalDependency(dependency)) // filter optionals\n  .every(dependency => scope[dependency] !== undefined);\n  if (!allDefined) {\n    var missingDependencies = dependencies.filter(dependency => scope[dependency] === undefined);\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(d => \"\\\"\".concat(d, \"\\\"\")).join(', '), \".\"));\n  }\n}\nexport function isOptionalDependency(dependency) {\n  return dependency && dependency[0] === '?';\n}\nexport function stripOptionalNotation(dependency) {\n  return dependency && dependency[0] === '?' ? dependency.slice(1) : dependency;\n}", "import { isBigNumber, isNumber, isObject } from './is.js';\n\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 */\nexport function isInteger(value) {\n  if (typeof value === 'boolean') {\n    return true;\n  }\n  return Number.isFinite(value) ? value === Math.round(value) : false;\n}\n\n/**\n * Ensure the number type is compatible with the provided value.\n * If not, return 'number' instead.\n *\n * For example:\n *\n *     safeNumberType('2.3', { number: 'bigint', numberFallback: 'number' })\n *\n * will return 'number' and not 'bigint' because trying to create a bigint with\n * value 2.3 would throw an exception.\n *\n * @param {string} numberStr\n * @param {{\n *   number: 'number' | 'BigNumber' | 'bigint' | 'Fraction'\n *   numberFallback: 'number' | 'BigNumber'\n * }} config\n * @returns {'number' | 'BigNumber' | 'bigint' | 'Fraction'}\n */\nexport function safeNumberType(numberStr, config) {\n  if (config.number === 'bigint') {\n    try {\n      BigInt(numberStr);\n    } catch (_unused) {\n      return config.numberFallback;\n    }\n  }\n  return config.number;\n}\n\n/**\n * Calculate the sign of a number\n * @param {number} x\n * @returns {number}\n */\nexport var sign = Math.sign || function (x) {\n  if (x > 0) {\n    return 1;\n  } else if (x < 0) {\n    return -1;\n  } else {\n    return 0;\n  }\n};\n\n/**\n * Calculate the base-2 logarithm of a number\n * @param {number} x\n * @returns {number}\n */\nexport var log2 = 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 */\nexport var log10 = 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 */\nexport var log1p = 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 */\nexport var cbrt = 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 (Number.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 */\nexport var expm1 = 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 */\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 > 2 ** (size - 1) - 1 || n < -(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 + 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 */\nexport function 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  var {\n    notation,\n    precision,\n    wordSize\n  } = normalizeFormatOptions(options);\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).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 * Normalize format options into an object:\n *   {\n *     notation: string,\n *     precision: number | undefined,\n *     wordSize: number | undefined\n *   }\n */\nexport function normalizeFormatOptions(options) {\n  // default values for options\n  var notation = 'auto';\n  var precision;\n  var wordSize;\n  if (options !== undefined) {\n    if (isNumber(options)) {\n      precision = options;\n    } else if (isBigNumber(options)) {\n      precision = options.toNumber();\n    } else if (isObject(options)) {\n      if (options.precision !== undefined) {\n        precision = _toNumberOrThrow(options.precision, () => {\n          throw new Error('Option \"precision\" must be a number or BigNumber');\n        });\n      }\n      if (options.wordSize !== undefined) {\n        wordSize = _toNumberOrThrow(options.wordSize, () => {\n          throw new Error('Option \"wordSize\" must be a number or BigNumber');\n        });\n      }\n      if (options.notation) {\n        notation = options.notation;\n      }\n    } else {\n      throw new Error('Unsupported type of options, number, BigNumber, or object expected');\n    }\n  }\n  return {\n    notation,\n    precision,\n    wordSize\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 */\nexport function 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,\n    coefficients,\n    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 */\nexport function toEngineering(value, precision) {\n  if (isNaN(value) || !Number.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 (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 = 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 */\nexport function toFixed(value, precision) {\n  if (isNaN(value) || !Number.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 */\nexport function toExponential(value, precision) {\n  if (isNaN(value) || !Number.isFinite(Number(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 */\nexport function toPrecision(value, precision, options) {\n  if (isNaN(value) || !Number.isFinite(value)) {\n    return String(value);\n  }\n\n  // determine lower and upper bound for exponential notation.\n  var lowerExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.lowerExp, -3);\n  var upperExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : 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 */\nexport function 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 */\nexport function 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 * Compares two floating point numbers.\n * @param {number} a - First value to compare\n * @param {number} b - Second value to compare\n * @param {number} [relTol=1e-09] - The relative tolerance, indicating the maximum allowed difference relative to the larger absolute value. Must be greater than 0.\n * @param {number} [absTol=1e-12] - The minimum absolute tolerance, useful for comparisons near zero. Must be at least 0.\n * @return {boolean} whether the two numbers are nearly equal\n *\n * @throws {Error} If `relTol` is less than or equal to 0.\n * @throws {Error} If `absTol` is less than 0.\n *\n * @example\n * nearlyEqual(1.000000001, 1.0, 1e-8);            // true\n * nearlyEqual(1.000000002, 1.0, 0);            // false\n * nearlyEqual(1.0, 1.009, undefined, 0.01);       // true\n * nearlyEqual(0.000000001, 0.0, undefined, 1e-8); // true\n */\nexport function nearlyEqual(a, b) {\n  var relTol = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1e-8;\n  var absTol = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 0;\n  if (relTol <= 0) {\n    throw new Error('Relative tolerance must be greater than 0');\n  }\n  if (absTol < 0) {\n    throw new Error('Absolute tolerance must be at least 0');\n  }\n\n  // NaN\n  if (isNaN(a) || isNaN(b)) {\n    return false;\n  }\n  if (!Number.isFinite(a) || !Number.isFinite(b)) {\n    return a === b;\n  }\n  if (a === b) {\n    return true;\n  }\n\n  // abs(a-b) <= max(rel_tol * max(abs(a), abs(b)), abs_tol)\n  return Math.abs(a - b) <= Math.max(relTol * Math.max(Math.abs(a), Math.abs(b)), absTol);\n}\n\n/**\n * Calculate the hyperbolic arccos of a number\n * @param {number} x\n * @return {number}\n */\nexport var acosh = Math.acosh || function (x) {\n  return Math.log(Math.sqrt(x * x - 1) + x);\n};\nexport var 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 */\nexport var 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 */\nexport var 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 */\nexport var 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 */\nexport var 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 */\nexport function 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}\nfunction _toNumberOrThrow(value, onError) {\n  if (isNumber(value)) {\n    return value;\n  } else if (isBigNumber(value)) {\n    return value.toNumber();\n  } else {\n    onError();\n  }\n}\nfunction _toNumberOrDefault(value, defaultValue) {\n  if (isNumber(value)) {\n    return value;\n  } else if (isBigNumber(value)) {\n    return value.toNumber();\n  } else {\n    return defaultValue;\n  }\n}", "import { factory } from '../../utils/factory.js';\nvar name = 'ResultSet';\nvar dependencies = [];\nexport var createResultSet = /* #__PURE__ */factory(name, dependencies, () => {\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.map(String).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});", "/*!\r\n *  decimal.js v10.6.0\r\n *  An arbitrary-precision Decimal type for JavaScript.\r\n *  https://github.com/MikeMcl/decimal.js\r\n *  Copyright (c) 2025 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\nvar 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  inexact, 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\nP.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\nP.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|bigint|Decimal}\r\n * max {number|string|bigint|Decimal}\r\n *\r\n */\r\nP.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\nP.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 \u00B1Infinity?\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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.inverseCosine = P.acos = function () {\r\n  var 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  // See https://github.com/MikeMcl/decimal.js/pull/217\r\n  x = new Ctor(1).minus(x).div(x.plus(1)).sqrt().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 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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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|bigint|Decimal} The base of the logarithm.\r\n *\r\n */\r\nP.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|bigint|Decimal}\r\n *\r\nP.max = function () {\r\n  Array.prototype.push.call(arguments, this);\r\n  return maxOrMin(this.constructor, arguments, -1);\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|bigint|Decimal}\r\n *\r\nP.min = function () {\r\n  Array.prototype.push.call(arguments, this);\r\n  return maxOrMin(this.constructor, arguments, 1);\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\nP.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 \u00B1Infinity.\r\n    else if (x.d) y.s = -y.s;\r\n\r\n    // Return x if y is finite and x is \u00B1Infinity.\r\n    // Return x if both are \u00B1Infinity with different signs.\r\n    // Return NaN if both are \u00B1Infinity 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\nP.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 \u00B1Infinity or NaN, or y is NaN or \u00B10.\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 \u00B1Infinity or x is \u00B10.\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\nP.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\nP.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\nP.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\nP.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 \u00B1Infinity.\r\n    // Return x if both are \u00B1Infinity with the same sign.\r\n    // Return NaN if both are \u00B1Infinity with different signs.\r\n    // Return y if x is finite and y is \u00B1Infinity.\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\nP.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\nP.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\nP.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\nP.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\nP.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\nP.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, \u00B1Infinity or \u00B10...\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 \u00B10 and y is \u00B1Infinity, or y is \u00B10 and x is \u00B1Infinity.\r\n      ? NaN\r\n\r\n      // Return \u00B1Infinity if either is \u00B1Infinity.\r\n      // Return \u00B10 if either is \u00B10.\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\nP.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\nP.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\nP.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\nP.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|bigint|Decimal} Maximum denominator. Integer >= 1 and < Infinity.\r\n *\r\n */\r\nP.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\nP.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|bigint|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\nP.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\nP.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\nP.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, \u00B10)                            = 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, \u00B1Infinity)           = 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|bigint|Decimal} The power to which to raise this Decimal.\r\n *\r\n */\r\nP.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 \u00B1Infinity, NaN or \u00B10?\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\nP.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\nP.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\nP.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\nP.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\nP.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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nvar 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 \u00B10 if x is 0 or y is \u00B1Infinity, or return \u00B1Infinity 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction isOdd(n) {\r\n  return n.d[n.d.length - 1] & 1;\r\n}\r\n\r\n\r\n/*\r\n * Handle `max` (`n` is -1) and `min` (`n` is 1).\r\n */\r\nfunction maxOrMin(Ctor, args, n) {\r\n  var k, 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\r\n    // NaN?\r\n    if (!y.s) {\r\n      x = y;\r\n      break;\r\n    }\r\n\r\n    k = x.cmp(y);\r\n\r\n    if (k === n || k === 0 && x.s === n) {\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(\u00B10)        = 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\nfunction 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\nfunction 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// \u00B1Infinity, NaN.\r\nfunction 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\nfunction parseDecimal(x, str) {\r\n  var e, i, len;\r\n\r\n  // TODO BigInt str: no need to check for decimal point, exponential form or leading zeros.\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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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|bigint|Decimal}\r\n *\r\n */\r\nfunction 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|bigint|Decimal}\r\n *\r\n */\r\nfunction 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|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction 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|bigint|Decimal}\r\n * y {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction 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|bigint|Decimal}\r\n *\r\n */\r\nfunction 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|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction 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|bigint|Decimal}\r\n *\r\n */\r\nfunction 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|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction 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|bigint|Decimal} The y-coordinate.\r\n * x {number|string|bigint|Decimal} The x-coordinate.\r\n *\r\n * atan2(\u00B10, -0)               = \u00B1pi\r\n * atan2(\u00B10, +0)               = \u00B10\r\n * atan2(\u00B10, -x)               = \u00B1pi for x > 0\r\n * atan2(\u00B10, x)                = \u00B10 for x > 0\r\n * atan2(-y, \u00B10)               = -pi/2 for y > 0\r\n * atan2(y, \u00B10)                = pi/2 for y > 0\r\n * atan2(\u00B1y, -Infinity)        = \u00B1pi for finite y > 0\r\n * atan2(\u00B1y, +Infinity)        = \u00B10 for finite y > 0\r\n * atan2(\u00B1Infinity, x)         = \u00B1pi/2 for finite x\r\n * atan2(\u00B1Infinity, -Infinity) = \u00B13*pi/4\r\n * atan2(\u00B1Infinity, +Infinity) = \u00B1pi/4\r\n * atan2(NaN, x) = NaN\r\n * atan2(y, NaN) = NaN\r\n *\r\n */\r\nfunction 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 \u00B1Infinity\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 \u00B1Infinity or y is \u00B10\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 \u00B1Infinity or x is \u00B10\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|bigint|Decimal}\r\n *\r\n */\r\nfunction 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|bigint|Decimal}\r\n *\r\n */\r\nfunction 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|bigint|Decimal}\r\n * min {number|string|bigint|Decimal}\r\n * max {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction 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\nfunction 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|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction 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|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction 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\nfunction 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|bigint|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    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\r\n      // Infinity or NaN?\r\n      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\r\n    if (t === 'string') {\r\n      if ((i = v.charCodeAt(0)) === 45) {  // minus sign\r\n        v = v.slice(1);\r\n        x.s = -1;\r\n      } else {\r\n        if (i === 43) v = v.slice(1);  // plus sign\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    if (t === 'bigint') {\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      return parseDecimal(x, v.toString());\r\n    }\r\n\r\n    throw Error(invalidArgument + 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|bigint|Decimal}\r\n * y {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction 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|bigint|Decimal} The power to which to raise the base of the natural log.\r\n *\r\n */\r\nfunction 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|bigint|Decimal}\r\n *\r\n */\r\nfunction 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|bigint|Decimal}\r\n *\r\n */\r\nfunction 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\nfunction 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|bigint|Decimal}\r\n *\r\n */\r\nfunction 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|bigint|Decimal} The argument of the logarithm.\r\n * y {number|string|bigint|Decimal} The base of the logarithm.\r\n *\r\n */\r\nfunction 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|bigint|Decimal}\r\n *\r\n */\r\nfunction 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|bigint|Decimal}\r\n *\r\n */\r\nfunction 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|bigint|Decimal}\r\n *\r\n */\r\nfunction max() {\r\n  return maxOrMin(this, arguments, -1);\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|bigint|Decimal}\r\n *\r\n */\r\nfunction min() {\r\n  return maxOrMin(this, arguments, 1);\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|bigint|Decimal}\r\n * y {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction 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|bigint|Decimal}\r\n * y {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction 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|bigint|Decimal} The base.\r\n * y {number|string|bigint|Decimal} The exponent.\r\n *\r\n */\r\nfunction 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\nfunction 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|bigint|Decimal}\r\n *\r\n */\r\nfunction 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|bigint|Decimal}\r\n *\r\n */\r\nfunction 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|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction 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|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction 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|bigint|Decimal}\r\n *\r\n */\r\nfunction 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|bigint|Decimal}\r\n * y {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction 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|bigint|Decimal}\r\n *\r\n */\r\nfunction 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|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction 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|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction 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|bigint|Decimal}\r\n *\r\n */\r\nfunction trunc(x) {\r\n  return finalise(x = new this(x), x.e + 1, 1);\r\n}\r\n\r\n\r\nP[Symbol.for('nodejs.util.inspect.custom')] = P.toString;\r\nP[Symbol.toStringTag] = 'Decimal';\r\n\r\n// Create and configure initial Decimal constructor.\r\nexport var Decimal = P.constructor = clone(DEFAULTS);\r\n\r\n// Create the internal constants from their string values.\r\nLN10 = new Decimal(LN10);\r\nPI = new Decimal(PI);\r\n\r\nexport default Decimal;\r\n", "import Decimal from 'decimal.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'BigNumber';\nvar dependencies = ['?on', 'config'];\nexport var createBigNumberClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    on,\n    config\n  } = _ref;\n  var BigNumber = Decimal.clone({\n    precision: config.precision,\n    modulo: Decimal.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});", "'use strict';\n\n/**\n *\n * This class allows the manipulation of complex numbers.\n * You can pass a complex number in different formats. Either as object, double, string or two integer parameters.\n *\n * Object form\n * { re: <real>, im: <imaginary> }\n * { arg: <angle>, abs: <radius> }\n * { phi: <angle>, r: <radius> }\n *\n * Array / Vector form\n * [ real, imaginary ]\n *\n * Double form\n * 99.3 - Single double value\n *\n * String form\n * '23.1337' - Simple real number\n * '15+3i' - a simple complex number\n * '3-i' - a simple complex number\n *\n * Example:\n *\n * const c = new Complex('99.3+8i');\n * c.mul({r: 3, i: 9}).div(4.9).sub(3, 2);\n *\n */\n\n\nconst cosh = Math.cosh || function (x) {\n  return Math.abs(x) < 1e-9 ? 1 - x : (Math.exp(x) + Math.exp(-x)) * 0.5;\n};\n\nconst sinh = Math.sinh || function (x) {\n  return Math.abs(x) < 1e-9 ? x : (Math.exp(x) - Math.exp(-x)) * 0.5;\n};\n\n/**\n * Calculates cos(x) - 1 using Taylor series if x is small (-\u00BC\u03C0 \u2264 x \u2264 \u00BC\u03C0).\n *\n * @param {number} x\n * @returns {number} cos(x) - 1\n */\nconst cosm1 = x => {\n  // cos(x) - 1 = \u2212 2sin^2(x / 2)\n  const s = Math.sin(0.5 * x);\n  return -2 * s * s;\n};\n\nconst hypot = function (x, y) {\n\n  x = Math.abs(x);\n  y = Math.abs(y);\n\n  // Ensure `x` is the larger value\n  if (x < y) [x, y] = [y, x];\n\n  // If both are below the threshold, use straightforward Pythagoras\n  if (x < 1e8) return Math.sqrt(x * x + y * y);\n\n  // For larger values, scale to avoid overflow\n  y /= x;\n  return x * Math.sqrt(1 + y * y);\n};\n\nconst parser_exit = function () {\n  throw SyntaxError('Invalid Param');\n};\n\n/**\n * Calculates log(sqrt(a^2+b^2)) in a way to avoid overflows\n *\n * @param {number} a\n * @param {number} b\n * @returns {number}\n */\nfunction logHypot(a, b) {\n\n  const _a = Math.abs(a);\n  const _b = Math.abs(b);\n\n  if (a === 0) {\n    return Math.log(_b);\n  }\n\n  if (b === 0) {\n    return Math.log(_a);\n  }\n\n  if (_a < 3000 && _b < 3000) {\n    return Math.log(a * a + b * b) * 0.5;\n  }\n\n  /* I got 4 ideas to compute this property without overflow:\n   *\n   * Testing 1000000 times with random samples for a,b \u2208 [1, 1000000000] against a big decimal library to get an error estimate\n   *\n   * 1. Only eliminate the square root: (OVERALL ERROR: 3.9122483030951116e-11)\n\n   Math.log(a * a + b * b) / 2\n\n   *\n   *\n   * 2. Try to use the non-overflowing pythagoras: (OVERALL ERROR: 8.889760039210159e-10)\n\n   const fn = function(a, b) {\n   a = Math.abs(a);\n   b = Math.abs(b);\n   let t = Math.min(a, b);\n   a = Math.max(a, b);\n   t = t / a;\n\n   return Math.log(a) + Math.log(1 + t * t) / 2;\n   };\n\n   * 3. Abuse the identity cos(atan(y/x) = x / sqrt(x^2+y^2): (OVERALL ERROR: 3.4780178737037204e-10)\n\n   Math.log(a / Math.cos(Math.atan2(b, a)))\n\n   * 4. Use 3. and apply log rules: (OVERALL ERROR: 1.2014087502620896e-9)\n\n   Math.log(a) - Math.log(Math.cos(Math.atan2(b, a)))\n\n   */\n\n  a = a * 0.5;\n  b = b * 0.5;\n\n  return 0.5 * Math.log(a * a + b * b) + Math.LN2;\n}\n\nconst P = { 're': 0, 'im': 0 };\nconst parse = function (a, b) {\n\n  const z = P;\n\n  if (a === undefined || a === null) {\n    z['re'] =\n      z['im'] = 0;\n  } else if (b !== undefined) {\n    z['re'] = a;\n    z['im'] = b;\n  } else\n    switch (typeof a) {\n\n      case 'object':\n\n        if ('im' in a && 're' in a) {\n          z['re'] = a['re'];\n          z['im'] = a['im'];\n        } else if ('abs' in a && 'arg' in a) {\n          if (!isFinite(a['abs']) && isFinite(a['arg'])) {\n            return Complex['INFINITY'];\n          }\n          z['re'] = a['abs'] * Math.cos(a['arg']);\n          z['im'] = a['abs'] * Math.sin(a['arg']);\n        } else if ('r' in a && 'phi' in a) {\n          if (!isFinite(a['r']) && isFinite(a['phi'])) {\n            return Complex['INFINITY'];\n          }\n          z['re'] = a['r'] * Math.cos(a['phi']);\n          z['im'] = a['r'] * Math.sin(a['phi']);\n        } else if (a.length === 2) { // Quick array check\n          z['re'] = a[0];\n          z['im'] = a[1];\n        } else {\n          parser_exit();\n        }\n        break;\n\n      case 'string':\n\n        z['im'] = /* void */\n          z['re'] = 0;\n\n        const tokens = a.replace(/_/g, '')\n          .match(/\\d+\\.?\\d*e[+-]?\\d+|\\d+\\.?\\d*|\\.\\d+|./g);\n        let plus = 1;\n        let minus = 0;\n\n        if (tokens === null) {\n          parser_exit();\n        }\n\n        for (let i = 0; i < tokens.length; i++) {\n\n          const c = tokens[i];\n\n          if (c === ' ' || c === '\\t' || c === '\\n') {\n            /* void */\n          } else if (c === '+') {\n            plus++;\n          } else if (c === '-') {\n            minus++;\n          } else if (c === 'i' || c === 'I') {\n\n            if (plus + minus === 0) {\n              parser_exit();\n            }\n\n            if (tokens[i + 1] !== ' ' && !isNaN(tokens[i + 1])) {\n              z['im'] += parseFloat((minus % 2 ? '-' : '') + tokens[i + 1]);\n              i++;\n            } else {\n              z['im'] += parseFloat((minus % 2 ? '-' : '') + '1');\n            }\n            plus = minus = 0;\n\n          } else {\n\n            if (plus + minus === 0 || isNaN(c)) {\n              parser_exit();\n            }\n\n            if (tokens[i + 1] === 'i' || tokens[i + 1] === 'I') {\n              z['im'] += parseFloat((minus % 2 ? '-' : '') + c);\n              i++;\n            } else {\n              z['re'] += parseFloat((minus % 2 ? '-' : '') + c);\n            }\n            plus = minus = 0;\n          }\n        }\n\n        // Still something on the stack\n        if (plus + minus > 0) {\n          parser_exit();\n        }\n        break;\n\n      case 'number':\n        z['im'] = 0;\n        z['re'] = a;\n        break;\n\n      default:\n        parser_exit();\n    }\n\n  if (isNaN(z['re']) || isNaN(z['im'])) {\n    // If a calculation is NaN, we treat it as NaN and don't throw\n    //parser_exit();\n  }\n\n  return z;\n};\n\n/**\n * @constructor\n * @returns {Complex}\n */\nfunction Complex(a, b) {\n\n  if (!(this instanceof Complex)) {\n    return new Complex(a, b);\n  }\n\n  const z = parse(a, b);\n\n  this['re'] = z['re'];\n  this['im'] = z['im'];\n}\n\nComplex.prototype = {\n\n  're': 0,\n  'im': 0,\n\n  /**\n   * Calculates the sign of a complex number, which is a normalized complex\n   *\n   * @returns {Complex}\n   */\n  'sign': function () {\n\n    const abs = hypot(this['re'], this['im']);\n\n    return new Complex(\n      this['re'] / abs,\n      this['im'] / abs);\n  },\n\n  /**\n   * Adds two complex numbers\n   *\n   * @returns {Complex}\n   */\n  'add': function (a, b) {\n\n    const z = parse(a, b);\n\n    const tInfin = this['isInfinite']();\n    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));\n\n    if (tInfin || zInfin) {\n\n      if (tInfin && zInfin) {\n        // Infinity + Infinity = NaN\n        return Complex['NAN'];\n      }\n      // Infinity + z = Infinity { where z != Infinity }\n      return Complex['INFINITY'];\n    }\n\n    return new Complex(\n      this['re'] + z['re'],\n      this['im'] + z['im']);\n  },\n\n  /**\n   * Subtracts two complex numbers\n   *\n   * @returns {Complex}\n   */\n  'sub': function (a, b) {\n\n    const z = parse(a, b);\n\n    const tInfin = this['isInfinite']();\n    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));\n\n    if (tInfin || zInfin) {\n\n      if (tInfin && zInfin) {\n        // Infinity - Infinity = NaN\n        return Complex['NAN'];\n      }\n      // Infinity - z = Infinity { where z != Infinity }\n      return Complex['INFINITY'];\n    }\n\n    return new Complex(\n      this['re'] - z['re'],\n      this['im'] - z['im']);\n  },\n\n  /**\n   * Multiplies two complex numbers\n   *\n   * @returns {Complex}\n   */\n  'mul': function (a, b) {\n\n    const z = parse(a, b);\n\n    const tInfin = this['isInfinite']();\n    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));\n    const tIsZero = this['re'] === 0 && this['im'] === 0;\n    const zIsZero = z['re'] === 0 && z['im'] === 0;\n\n    // Infinity * 0 = NaN\n    if (tInfin && zIsZero || zInfin && tIsZero) {\n      return Complex['NAN'];\n    }\n\n    // Infinity * z = Infinity { where z != 0 }\n    if (tInfin || zInfin) {\n      return Complex['INFINITY'];\n    }\n\n    // Shortcut for real values\n    if (z['im'] === 0 && this['im'] === 0) {\n      return new Complex(this['re'] * z['re'], 0);\n    }\n\n    return new Complex(\n      this['re'] * z['re'] - this['im'] * z['im'],\n      this['re'] * z['im'] + this['im'] * z['re']);\n  },\n\n  /**\n   * Divides two complex numbers\n   *\n   * @returns {Complex}\n   */\n  'div': function (a, b) {\n\n    const z = parse(a, b);\n\n    const tInfin = this['isInfinite']();\n    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));\n    const tIsZero = this['re'] === 0 && this['im'] === 0;\n    const zIsZero = z['re'] === 0 && z['im'] === 0;\n\n    // 0 / 0 = NaN and Infinity / Infinity = NaN\n    if (tIsZero && zIsZero || tInfin && zInfin) {\n      return Complex['NAN'];\n    }\n\n    // Infinity / 0 = Infinity\n    if (zIsZero || tInfin) {\n      return Complex['INFINITY'];\n    }\n\n    // 0 / Infinity = 0\n    if (tIsZero || zInfin) {\n      return Complex['ZERO'];\n    }\n\n    if (0 === z['im']) {\n      // Divisor is real\n      return new Complex(this['re'] / z['re'], this['im'] / z['re']);\n    }\n\n    if (Math.abs(z['re']) < Math.abs(z['im'])) {\n\n      const x = z['re'] / z['im'];\n      const t = z['re'] * x + z['im'];\n\n      return new Complex(\n        (this['re'] * x + this['im']) / t,\n        (this['im'] * x - this['re']) / t);\n\n    } else {\n\n      const x = z['im'] / z['re'];\n      const t = z['im'] * x + z['re'];\n\n      return new Complex(\n        (this['re'] + this['im'] * x) / t,\n        (this['im'] - this['re'] * x) / t);\n    }\n  },\n\n  /**\n   * Calculate the power of two complex numbers\n   *\n   * @returns {Complex}\n   */\n  'pow': function (a, b) {\n\n    const z = parse(a, b);\n\n    const tIsZero = this['re'] === 0 && this['im'] === 0;\n    const zIsZero = z['re'] === 0 && z['im'] === 0;\n\n    if (zIsZero) {\n      return Complex['ONE'];\n    }\n\n    // If the exponent is real\n    if (z['im'] === 0) {\n\n      if (this['im'] === 0 && this['re'] > 0) {\n\n        return new Complex(Math.pow(this['re'], z['re']), 0);\n\n      } else if (this['re'] === 0) { // If base is fully imaginary\n\n        switch ((z['re'] % 4 + 4) % 4) {\n          case 0:\n            return new Complex(Math.pow(this['im'], z['re']), 0);\n          case 1:\n            return new Complex(0, Math.pow(this['im'], z['re']));\n          case 2:\n            return new Complex(-Math.pow(this['im'], z['re']), 0);\n          case 3:\n            return new Complex(0, -Math.pow(this['im'], z['re']));\n        }\n      }\n    }\n\n    /* I couldn't find a good formula, so here is a derivation and optimization\n     *\n     * z_1^z_2 = (a + bi)^(c + di)\n     *         = exp((c + di) * log(a + bi)\n     *         = pow(a^2 + b^2, (c + di) / 2) * exp(i(c + di)atan2(b, a))\n     * =>...\n     * Re = (pow(a^2 + b^2, c / 2) * exp(-d * atan2(b, a))) * cos(d * log(a^2 + b^2) / 2 + c * atan2(b, a))\n     * Im = (pow(a^2 + b^2, c / 2) * exp(-d * atan2(b, a))) * sin(d * log(a^2 + b^2) / 2 + c * atan2(b, a))\n     *\n     * =>...\n     * Re = exp(c * log(sqrt(a^2 + b^2)) - d * atan2(b, a)) * cos(d * log(sqrt(a^2 + b^2)) + c * atan2(b, a))\n     * Im = exp(c * log(sqrt(a^2 + b^2)) - d * atan2(b, a)) * sin(d * log(sqrt(a^2 + b^2)) + c * atan2(b, a))\n     *\n     * =>\n     * Re = exp(c * logsq2 - d * arg(z_1)) * cos(d * logsq2 + c * arg(z_1))\n     * Im = exp(c * logsq2 - d * arg(z_1)) * sin(d * logsq2 + c * arg(z_1))\n     *\n     */\n\n    if (tIsZero && z['re'] > 0) { // Same behavior as Wolframalpha, Zero if real part is zero\n      return Complex['ZERO'];\n    }\n\n    const arg = Math.atan2(this['im'], this['re']);\n    const loh = logHypot(this['re'], this['im']);\n\n    let re = Math.exp(z['re'] * loh - z['im'] * arg);\n    let im = z['im'] * loh + z['re'] * arg;\n    return new Complex(\n      re * Math.cos(im),\n      re * Math.sin(im));\n  },\n\n  /**\n   * Calculate the complex square root\n   *\n   * @returns {Complex}\n   */\n  'sqrt': function () {\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0) {\n      // Real number case\n      if (a >= 0) {\n        return new Complex(Math.sqrt(a), 0);\n      } else {\n        return new Complex(0, Math.sqrt(-a));\n      }\n    }\n\n    const r = hypot(a, b);\n\n    let re = Math.sqrt(0.5 * (r + Math.abs(a))); // sqrt(2x) / 2 = sqrt(x / 2)\n    let im = Math.abs(b) / (2 * re);\n\n    if (a >= 0) {\n      return new Complex(re, b < 0 ? -im : im);\n    } else {\n      return new Complex(im, b < 0 ? -re : re);\n    }\n  },\n\n  /**\n   * Calculate the complex exponent\n   *\n   * @returns {Complex}\n   */\n  'exp': function () {\n\n    const er = Math.exp(this['re']);\n\n    if (this['im'] === 0) {\n      return new Complex(er, 0);\n    }\n    return new Complex(\n      er * Math.cos(this['im']),\n      er * Math.sin(this['im']));\n  },\n\n  /**\n   * Calculate the complex exponent and subtracts one.\n   *\n   * This may be more accurate than `Complex(x).exp().sub(1)` if\n   * `x` is small.\n   *\n   * @returns {Complex}\n   */\n  'expm1': function () {\n\n    /**\n     * exp(a + i*b) - 1\n     = exp(a) * (cos(b) + j*sin(b)) - 1\n     = expm1(a)*cos(b) + cosm1(b) + j*exp(a)*sin(b)\n     */\n\n    const a = this['re'];\n    const b = this['im'];\n\n    return new Complex(\n      Math.expm1(a) * Math.cos(b) + cosm1(b),\n      Math.exp(a) * Math.sin(b));\n  },\n\n  /**\n   * Calculate the natural log\n   *\n   * @returns {Complex}\n   */\n  'log': function () {\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0 && a > 0) {\n      return new Complex(Math.log(a), 0);\n    }\n\n    return new Complex(\n      logHypot(a, b),\n      Math.atan2(b, a));\n  },\n\n  /**\n   * Calculate the magnitude of the complex number\n   *\n   * @returns {number}\n   */\n  'abs': function () {\n\n    return hypot(this['re'], this['im']);\n  },\n\n  /**\n   * Calculate the angle of the complex number\n   *\n   * @returns {number}\n   */\n  'arg': function () {\n\n    return Math.atan2(this['im'], this['re']);\n  },\n\n  /**\n   * Calculate the sine of the complex number\n   *\n   * @returns {Complex}\n   */\n  'sin': function () {\n\n    // sin(z) = ( e^iz - e^-iz ) / 2i \n    //        = sin(a)cosh(b) + i cos(a)sinh(b)\n\n    const a = this['re'];\n    const b = this['im'];\n\n    return new Complex(\n      Math.sin(a) * cosh(b),\n      Math.cos(a) * sinh(b));\n  },\n\n  /**\n   * Calculate the cosine\n   *\n   * @returns {Complex}\n   */\n  'cos': function () {\n\n    // cos(z) = ( e^iz + e^-iz ) / 2 \n    //        = cos(a)cosh(b) - i sin(a)sinh(b)\n\n    const a = this['re'];\n    const b = this['im'];\n\n    return new Complex(\n      Math.cos(a) * cosh(b),\n      -Math.sin(a) * sinh(b));\n  },\n\n  /**\n   * Calculate the tangent\n   *\n   * @returns {Complex}\n   */\n  'tan': function () {\n\n    // tan(z) = sin(z) / cos(z) \n    //        = ( e^iz - e^-iz ) / ( i( e^iz + e^-iz ) )\n    //        = ( e^2iz - 1 ) / i( e^2iz + 1 )\n    //        = ( sin(2a) + i sinh(2b) ) / ( cos(2a) + cosh(2b) )\n\n    const a = 2 * this['re'];\n    const b = 2 * this['im'];\n    const d = Math.cos(a) + cosh(b);\n\n    return new Complex(\n      Math.sin(a) / d,\n      sinh(b) / d);\n  },\n\n  /**\n   * Calculate the cotangent\n   *\n   * @returns {Complex}\n   */\n  'cot': function () {\n\n    // cot(c) = i(e^(ci) + e^(-ci)) / (e^(ci) - e^(-ci))\n\n    const a = 2 * this['re'];\n    const b = 2 * this['im'];\n    const d = Math.cos(a) - cosh(b);\n\n    return new Complex(\n      -Math.sin(a) / d,\n      sinh(b) / d);\n  },\n\n  /**\n   * Calculate the secant\n   *\n   * @returns {Complex}\n   */\n  'sec': function () {\n\n    // sec(c) = 2 / (e^(ci) + e^(-ci))\n\n    const a = this['re'];\n    const b = this['im'];\n    const d = 0.5 * cosh(2 * b) + 0.5 * Math.cos(2 * a);\n\n    return new Complex(\n      Math.cos(a) * cosh(b) / d,\n      Math.sin(a) * sinh(b) / d);\n  },\n\n  /**\n   * Calculate the cosecans\n   *\n   * @returns {Complex}\n   */\n  'csc': function () {\n\n    // csc(c) = 2i / (e^(ci) - e^(-ci))\n\n    const a = this['re'];\n    const b = this['im'];\n    const d = 0.5 * cosh(2 * b) - 0.5 * Math.cos(2 * a);\n\n    return new Complex(\n      Math.sin(a) * cosh(b) / d,\n      -Math.cos(a) * sinh(b) / d);\n  },\n\n  /**\n   * Calculate the complex arcus sinus\n   *\n   * @returns {Complex}\n   */\n  'asin': function () {\n\n    // asin(c) = -i * log(ci + sqrt(1 - c^2))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    const t1 = new Complex(\n      b * b - a * a + 1,\n      -2 * a * b)['sqrt']();\n\n    const t2 = new Complex(\n      t1['re'] - b,\n      t1['im'] + a)['log']();\n\n    return new Complex(t2['im'], -t2['re']);\n  },\n\n  /**\n   * Calculate the complex arcus cosinus\n   *\n   * @returns {Complex}\n   */\n  'acos': function () {\n\n    // acos(c) = i * log(c - i * sqrt(1 - c^2))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    const t1 = new Complex(\n      b * b - a * a + 1,\n      -2 * a * b)['sqrt']();\n\n    const t2 = new Complex(\n      t1['re'] - b,\n      t1['im'] + a)['log']();\n\n    return new Complex(Math.PI / 2 - t2['im'], t2['re']);\n  },\n\n  /**\n   * Calculate the complex arcus tangent\n   *\n   * @returns {Complex}\n   */\n  'atan': function () {\n\n    // atan(c) = i / 2 log((i + x) / (i - x))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (a === 0) {\n\n      if (b === 1) {\n        return new Complex(0, Infinity);\n      }\n\n      if (b === -1) {\n        return new Complex(0, -Infinity);\n      }\n    }\n\n    const d = a * a + (1.0 - b) * (1.0 - b);\n\n    const t1 = new Complex(\n      (1 - b * b - a * a) / d,\n      -2 * a / d).log();\n\n    return new Complex(-0.5 * t1['im'], 0.5 * t1['re']);\n  },\n\n  /**\n   * Calculate the complex arcus cotangent\n   *\n   * @returns {Complex}\n   */\n  'acot': function () {\n\n    // acot(c) = i / 2 log((c - i) / (c + i))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0) {\n      return new Complex(Math.atan2(1, a), 0);\n    }\n\n    const d = a * a + b * b;\n    return (d !== 0)\n      ? new Complex(\n        a / d,\n        -b / d).atan()\n      : new Complex(\n        (a !== 0) ? a / 0 : 0,\n        (b !== 0) ? -b / 0 : 0).atan();\n  },\n\n  /**\n   * Calculate the complex arcus secant\n   *\n   * @returns {Complex}\n   */\n  'asec': function () {\n\n    // asec(c) = -i * log(1 / c + sqrt(1 - i / c^2))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (a === 0 && b === 0) {\n      return new Complex(0, Infinity);\n    }\n\n    const d = a * a + b * b;\n    return (d !== 0)\n      ? new Complex(\n        a / d,\n        -b / d).acos()\n      : new Complex(\n        (a !== 0) ? a / 0 : 0,\n        (b !== 0) ? -b / 0 : 0).acos();\n  },\n\n  /**\n   * Calculate the complex arcus cosecans\n   *\n   * @returns {Complex}\n   */\n  'acsc': function () {\n\n    // acsc(c) = -i * log(i / c + sqrt(1 - 1 / c^2))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (a === 0 && b === 0) {\n      return new Complex(Math.PI / 2, Infinity);\n    }\n\n    const d = a * a + b * b;\n    return (d !== 0)\n      ? new Complex(\n        a / d,\n        -b / d).asin()\n      : new Complex(\n        (a !== 0) ? a / 0 : 0,\n        (b !== 0) ? -b / 0 : 0).asin();\n  },\n\n  /**\n   * Calculate the complex sinh\n   *\n   * @returns {Complex}\n   */\n  'sinh': function () {\n\n    // sinh(c) = (e^c - e^-c) / 2\n\n    const a = this['re'];\n    const b = this['im'];\n\n    return new Complex(\n      sinh(a) * Math.cos(b),\n      cosh(a) * Math.sin(b));\n  },\n\n  /**\n   * Calculate the complex cosh\n   *\n   * @returns {Complex}\n   */\n  'cosh': function () {\n\n    // cosh(c) = (e^c + e^-c) / 2\n\n    const a = this['re'];\n    const b = this['im'];\n\n    return new Complex(\n      cosh(a) * Math.cos(b),\n      sinh(a) * Math.sin(b));\n  },\n\n  /**\n   * Calculate the complex tanh\n   *\n   * @returns {Complex}\n   */\n  'tanh': function () {\n\n    // tanh(c) = (e^c - e^-c) / (e^c + e^-c)\n\n    const a = 2 * this['re'];\n    const b = 2 * this['im'];\n    const d = cosh(a) + Math.cos(b);\n\n    return new Complex(\n      sinh(a) / d,\n      Math.sin(b) / d);\n  },\n\n  /**\n   * Calculate the complex coth\n   *\n   * @returns {Complex}\n   */\n  'coth': function () {\n\n    // coth(c) = (e^c + e^-c) / (e^c - e^-c)\n\n    const a = 2 * this['re'];\n    const b = 2 * this['im'];\n    const d = cosh(a) - Math.cos(b);\n\n    return new Complex(\n      sinh(a) / d,\n      -Math.sin(b) / d);\n  },\n\n  /**\n   * Calculate the complex csch\n   *\n   * @returns {Complex}\n   */\n  'csch': function () {\n\n    // csch(c) = 2 / (e^c - e^-c)\n\n    const a = this['re'];\n    const b = this['im'];\n    const d = Math.cos(2 * b) - cosh(2 * a);\n\n    return new Complex(\n      -2 * sinh(a) * Math.cos(b) / d,\n      2 * cosh(a) * Math.sin(b) / d);\n  },\n\n  /**\n   * Calculate the complex sech\n   *\n   * @returns {Complex}\n   */\n  'sech': function () {\n\n    // sech(c) = 2 / (e^c + e^-c)\n\n    const a = this['re'];\n    const b = this['im'];\n    const d = Math.cos(2 * b) + cosh(2 * a);\n\n    return new Complex(\n      2 * cosh(a) * Math.cos(b) / d,\n      -2 * sinh(a) * Math.sin(b) / d);\n  },\n\n  /**\n   * Calculate the complex asinh\n   *\n   * @returns {Complex}\n   */\n  'asinh': function () {\n\n    // asinh(z) = log(z + sqrt(z^2 + 1))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0) {\n\n      if (a === 0) {\n        return new Complex(0, 0);\n      }\n\n      // Use |a| to keep asinh(-a) = -asinh(a) and avoid cancellation for large -a\n      const x = Math.abs(a);\n      const r = Math.log(x + Math.sqrt(x * x + 1));\n\n      return new Complex(a < 0 ? -r : r, 0);\n    }\n\n    // z^2 + 1 = (a^2 - b^2 + 1) + i (2ab)\n    const re2 = a * a - b * b + 1;\n    const im2 = 2 * a * b;\n\n    const t = new Complex(re2, im2)['sqrt'](); // sqrt(z^2 + 1)\n\n    return new Complex(a + t['re'], b + t['im'])['log']();\n  },\n\n  /**\n   * Calculate the complex acosh\n   *\n   * @returns {Complex}\n   */\n  'acosh': function () {\n\n    // acosh(z)= log(z + sqrt(z^2 - 1)) = log(z + sqrt(z - 1) * sqrt(z + 1))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0) {\n\n      // z = a is real\n      if (a > 1) {\n        // acosh(a) = log(a + sqrt(a - 1) * sqrt(a + 1)),  a > 1\n        return new Complex(\n          Math.log(a + Math.sqrt(a - 1) * Math.sqrt(a + 1)), 0);\n      }\n\n      if (a < -1) {\n        // acosh(a) = log(-a + sqrt(a^2 - 1)) + i*pi,  a < -1\n        const t = Math.sqrt(a * a - 1);\n        return new Complex(Math.log(-a + t), Math.PI);\n      }\n\n      // -1 <= a <= 1 : purely imaginary\n      // acosh(a) = i * acos(a)\n      return new Complex(0, Math.acos(a));\n    }\n\n    const t1 = new Complex(a - 1, b)['sqrt'](); // sqrt(z - 1)\n    const t2 = new Complex(a + 1, b)['sqrt'](); // sqrt(z + 1)\n\n    return new Complex(\n      a + t1['re'] * t2['re'] - t1['im'] * t2['im'],\n      b + t1['re'] * t2['im'] + t1['im'] * t2['re']\n    )['log']();\n  },\n\n  /**\n   * Calculate the complex atanh\n   *\n   * @returns {Complex}\n   */\n  'atanh': function () {\n\n    // atanh(z) = log((1 + z) / (1 - z)) / 2\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0) {\n\n      if (a === 0) {\n        return new Complex(0, 0);\n      }\n\n      if (a === 1) {\n        // limit x -> 1^- atanh(x) = +Infinity\n        return new Complex(Infinity, 0);\n      }\n\n      if (a === -1) {\n        // limit x -> -1^+ atanh(x) = -Infinity\n        return new Complex(-Infinity, 0);\n      }\n\n      if (-1 < a && a < 1) {\n        // Purely real\n        return new Complex(\n          0.5 * Math.log((1 + a) / (1 - a)),\n          0\n        );\n      }\n\n      if (a > 1) {\n        // Our branch: Im(atanh(a)) = -\u03C0/2 for a > 1\n        const t = (a + 1) / (a - 1); // > 0\n        return new Complex(\n          0.5 * Math.log(t),\n          -Math.PI / 2\n        );\n      }\n\n      // a < -1: Im(atanh(a)) = +\u03C0/2\n      const t = (1 + a) / (1 - a); // < 0\n      return new Complex(\n        0.5 * Math.log(-t), // log((1 - a)/(1 + a))\n        Math.PI / 2\n      );\n    }\n\n    // Use atanh(z) = 0.5 * Log((1+z)/(1-z)) with principal Log.\n    const oneMinus = 1 - a;\n    const onePlus = 1 + a;\n    const d = oneMinus * oneMinus + b * b; // |1 - z|^2\n\n    if (d === 0) {\n      // (1 - z) == 0 for finite z only at z = 1+0i, already handled above.\n      // If we ever get here, just propagate infinities consistently:\n      return new Complex(\n        (a !== -1) ? (a / 0) : 0,\n        (b !== 0) ? (b / 0) : 0\n      );\n    }\n\n    // (1 + z) / (1 - z) with a single complex division\n    const xr = (onePlus * oneMinus - b * b) / d;\n    const xi = (b * oneMinus + onePlus * b) / d;\n\n    // 0.5 * log(xr + i xi)\n    return new Complex(\n      logHypot(xr, xi) / 2,\n      Math.atan2(xi, xr) / 2\n    );\n  },\n\n  /**\n   * Calculate the complex acoth\n   *\n   * @returns {Complex}\n   */\n  'acoth': function () {\n\n    // acoth(z) = log((z + 1) / (z - 1)) / 2 = atanh(1 / z)\n\n    const a = this['re'];\n    const b = this['im'];\n\n    // z = 0 -> acoth(0) = i * \u03C0 / 2  (log((1+0)/(1-0))/2 = log(-1)/2)\n    if (a === 0 && b === 0) {\n      return new Complex(0, Math.PI / 2);\n    }\n\n    const d = a * a + b * b;\n\n    if (d !== 0) {\n      // 1 / z = (a - i b) / (a^2 + b^2)\n      return new Complex(a / d, -b / d)['atanh']();\n    }\n\n    // Fallback for weird infinities/NaNs: mirror other functions' style\n    return new Complex(\n      (a !== 0) ? a / 0 : 0,\n      (b !== 0) ? -b / 0 : 0\n    )['atanh']();\n  },\n\n  /**\n   * Calculate the complex acsch\n   *\n   * @returns {Complex}\n   */\n  'acsch': function () {\n\n    // acsch(c) = log((1+sqrt(1+c^2))/c) = = asinh(1 / z)\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0) {\n\n      // z = a real\n      if (a === 0) {\n        // acsch(0) -> +/- Infinity, we keep your previous behavior\n        return new Complex(Infinity, 0);\n      }\n\n      // acsch(a) = asinh(1/a) = log(1/a + sqrt(1/a^2 + 1))\n      const inv = 1 / a;\n      return new Complex(\n        Math.log(inv + Math.sqrt(inv * inv + 1)),\n        0\n      );\n    }\n\n    const d = a * a + b * b;\n\n    if (d !== 0) {\n      // 1/z = (a - i b) / (a^2 + b^2)\n      return new Complex(a / d, -b / d)['asinh']();\n    }\n\n    // Handle 0 + 0i or infinities in the same spirit as your existing code\n    return new Complex(\n      (a !== 0) ? a / 0 : 0,\n      (b !== 0) ? -b / 0 : 0)['asinh']();\n  },\n\n  /**\n   * Calculate the complex asech\n   *\n   * @returns {Complex}\n   */\n  'asech': function () {\n\n    // asech(z) = acosh(1 / z)\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (this['isZero']()) {\n      // asech(0) = acosh(\u221E) -> \u221E\n      return Complex['INFINITY'];\n    }\n\n    const d = a * a + b * b;\n\n    if (d !== 0) {\n      // 1 / z = (a - i b) / (a^2 + b^2)\n      return new Complex(a / d, -b / d)['acosh']();\n    }\n\n    // Fallback for weird infinities/NaNs\n    return new Complex(\n      (a !== 0) ? a / 0 : 0,\n      (b !== 0) ? -b / 0 : 0)['acosh']();\n  },\n\n  /**\n   * Calculate the complex inverse 1/z\n   *\n   * @returns {Complex}\n   */\n  'inverse': function () {\n\n    // 1 / 0 = Infinity and 1 / Infinity = 0\n    if (this['isZero']()) {\n      return Complex['INFINITY'];\n    }\n\n    if (this['isInfinite']()) {\n      return Complex['ZERO'];\n    }\n\n    const a = this['re'];\n    const b = this['im'];\n\n    const d = a * a + b * b;\n\n    return new Complex(a / d, -b / d);\n  },\n\n  /**\n   * Returns the complex conjugate\n   *\n   * @returns {Complex}\n   */\n  'conjugate': function () {\n\n    return new Complex(this['re'], -this['im']);\n  },\n\n  /**\n   * Gets the negated complex number\n   *\n   * @returns {Complex}\n   */\n  'neg': function () {\n\n    return new Complex(-this['re'], -this['im']);\n  },\n\n  /**\n   * Ceils the actual complex number\n   *\n   * @returns {Complex}\n   */\n  'ceil': function (places) {\n\n    places = Math.pow(10, places || 0);\n\n    return new Complex(\n      Math.ceil(this['re'] * places) / places,\n      Math.ceil(this['im'] * places) / places);\n  },\n\n  /**\n   * Floors the actual complex number\n   *\n   * @returns {Complex}\n   */\n  'floor': function (places) {\n\n    places = Math.pow(10, places || 0);\n\n    return new Complex(\n      Math.floor(this['re'] * places) / places,\n      Math.floor(this['im'] * places) / places);\n  },\n\n  /**\n   * Ceils the actual complex number\n   *\n   * @returns {Complex}\n   */\n  'round': function (places) {\n\n    places = Math.pow(10, places || 0);\n\n    return new Complex(\n      Math.round(this['re'] * places) / places,\n      Math.round(this['im'] * places) / places);\n  },\n\n  /**\n   * Compares two complex numbers\n   *\n   * **Note:** new Complex(Infinity).equals(Infinity) === false\n   *\n   * @returns {boolean}\n   */\n  'equals': function (a, b) {\n\n    const z = parse(a, b);\n\n    return Math.abs(z['re'] - this['re']) <= Complex['EPSILON'] &&\n      Math.abs(z['im'] - this['im']) <= Complex['EPSILON'];\n  },\n\n  /**\n   * Clones the actual object\n   *\n   * @returns {Complex}\n   */\n  'clone': function () {\n\n    return new Complex(this['re'], this['im']);\n  },\n\n  /**\n   * Gets a string of the actual complex number\n   *\n   * @returns {string}\n   */\n  'toString': function () {\n\n    let a = this['re'];\n    let b = this['im'];\n    let ret = \"\";\n\n    if (this['isNaN']()) {\n      return 'NaN';\n    }\n\n    if (this['isInfinite']()) {\n      return 'Infinity';\n    }\n\n    if (Math.abs(a) < Complex['EPSILON']) {\n      a = 0;\n    }\n\n    if (Math.abs(b) < Complex['EPSILON']) {\n      b = 0;\n    }\n\n    // If is real number\n    if (b === 0) {\n      return ret + a;\n    }\n\n    if (a !== 0) {\n      ret += a;\n      ret += \" \";\n      if (b < 0) {\n        b = -b;\n        ret += \"-\";\n      } else {\n        ret += \"+\";\n      }\n      ret += \" \";\n    } else if (b < 0) {\n      b = -b;\n      ret += \"-\";\n    }\n\n    if (1 !== b) { // b is the absolute imaginary part\n      ret += b;\n    }\n    return ret + \"i\";\n  },\n\n  /**\n   * Returns the actual number as a vector\n   *\n   * @returns {Array}\n   */\n  'toVector': function () {\n\n    return [this['re'], this['im']];\n  },\n\n  /**\n   * Returns the actual real value of the current object\n   *\n   * @returns {number|null}\n   */\n  'valueOf': function () {\n\n    if (this['im'] === 0) {\n      return this['re'];\n    }\n    return null;\n  },\n\n  /**\n   * Determines whether a complex number is not on the Riemann sphere.\n   *\n   * @returns {boolean}\n   */\n  'isNaN': function () {\n    return isNaN(this['re']) || isNaN(this['im']);\n  },\n\n  /**\n   * Determines whether or not a complex number is at the zero pole of the\n   * Riemann sphere.\n   *\n   * @returns {boolean}\n   */\n  'isZero': function () {\n    return this['im'] === 0 && this['re'] === 0;\n  },\n\n  /**\n   * Determines whether a complex number is not at the infinity pole of the\n   * Riemann sphere.\n   *\n   * @returns {boolean}\n   */\n  'isFinite': function () {\n    return isFinite(this['re']) && isFinite(this['im']);\n  },\n\n  /**\n   * Determines whether or not a complex number is at the infinity pole of the\n   * Riemann sphere.\n   *\n   * @returns {boolean}\n   */\n  'isInfinite': function () {\n    return !this['isFinite']();\n  }\n};\n\nComplex['ZERO'] = new Complex(0, 0);\nComplex['ONE'] = new Complex(1, 0);\nComplex['I'] = new Complex(0, 1);\nComplex['PI'] = new Complex(Math.PI, 0);\nComplex['E'] = new Complex(Math.E, 0);\nComplex['INFINITY'] = new Complex(Infinity, Infinity);\nComplex['NAN'] = new Complex(NaN, NaN);\nComplex['EPSILON'] = 1e-15;\nexport {\n  Complex as default, Complex\n};\n", "import Complex from 'complex.js';\nimport { format } from '../../utils/number.js';\nimport { isNumber, isUnit } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'Complex';\nvar dependencies = [];\nexport var createComplexClass = /* #__PURE__ */factory(name, dependencies, () => {\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(Complex, 'name', {\n    value: 'Complex'\n  });\n  Complex.prototype.constructor = Complex;\n  Complex.prototype.type = 'Complex';\n  Complex.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.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.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.prototype.format = function (options) {\n    var str = '';\n    var im = this.im;\n    var re = this.re;\n    var strRe = format(this.re, options);\n    var strIm = format(this.im, options);\n\n    // round either re or im when smaller than the configured precision\n    var precision = 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.fromPolar = function (args) {\n    switch (arguments.length) {\n      case 1:\n        {\n          var arg = arguments[0];\n          if (typeof arg === 'object') {\n            return Complex(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 (isNumber(r)) {\n            if (isUnit(phi) && phi.hasBase('ANGLE')) {\n              // convert unit to a number in radians\n              phi = phi.toNumber('rad');\n            }\n            if (isNumber(phi)) {\n              return new Complex({\n                r,\n                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.prototype.valueOf = Complex.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.fromJSON = function (json) {\n    return new Complex(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.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;\n}, {\n  isClass: true\n});", "'use strict';\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 as BigInt or Number\n *\n * Double form\n * - Single double value as Number\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 * let f = new Fraction(\"9.4'31'\");\n * f.mul([-4, 3]).div(4.9);\n *\n */\n\n// Set Identity function to downgrade BigInt to Number if needed\nif (typeof BigInt === 'undefined') BigInt = function (n) { if (isNaN(n)) throw new Error(\"\"); return n; };\n\nconst C_ZERO = BigInt(0);\nconst C_ONE = BigInt(1);\nconst C_TWO = BigInt(2);\nconst C_THREE = BigInt(3);\nconst C_FIVE = BigInt(5);\nconst C_TEN = BigInt(10);\nconst MAX_INTEGER = BigInt(Number.MAX_SAFE_INTEGER);\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\nconst MAX_CYCLE_LEN = 2000;\n\n// Parsed data to avoid calling \"new\" all the time\nconst P = {\n  \"s\": C_ONE,\n  \"n\": C_ZERO,\n  \"d\": C_ONE\n};\n\nfunction assign(n, s) {\n\n  try {\n    n = BigInt(n);\n  } catch (e) {\n    throw InvalidParameter();\n  }\n  return n * s;\n}\n\nfunction ifloor(x) {\n  return typeof x === 'bigint' ? x : Math.floor(x);\n}\n\n// Creates a new Fraction internally without the need of the bulky constructor\nfunction newFraction(n, d) {\n\n  if (d === C_ZERO) {\n    throw DivisionByZero();\n  }\n\n  const f = Object.create(Fraction.prototype);\n  f[\"s\"] = n < C_ZERO ? -C_ONE : C_ONE;\n\n  n = n < C_ZERO ? -n : n;\n\n  const a = gcd(n, d);\n\n  f[\"n\"] = n / a;\n  f[\"d\"] = d / a;\n  return f;\n}\n\nconst FACTORSTEPS = [C_TWO * C_TWO, C_TWO, C_TWO * C_TWO, C_TWO, C_TWO * C_TWO, C_TWO * C_THREE, C_TWO, C_TWO * C_THREE]; // repeats\nfunction factorize(n) {\n\n  const factors = Object.create(null);\n  if (n <= C_ONE) {\n    factors[n] = C_ONE;\n    return factors;\n  }\n\n  const add = (p) => { factors[p] = (factors[p] || C_ZERO) + C_ONE; };\n\n  while (n % C_TWO === C_ZERO) { add(C_TWO); n /= C_TWO; }\n  while (n % C_THREE === C_ZERO) { add(C_THREE); n /= C_THREE; }\n  while (n % C_FIVE === C_ZERO) { add(C_FIVE); n /= C_FIVE; }\n\n  // 30-wheel trial division: test only residues coprime to 2*3*5\n  // Residue step pattern after 5: 7,11,13,17,19,23,29,31, ...\n  for (let si = 0, p = C_TWO + C_FIVE; p * p <= n;) {\n    while (n % p === C_ZERO) { add(p); n /= p; }\n    p += FACTORSTEPS[si];\n    si = (si + 1) & 7; // fast modulo 8\n  }\n  if (n > C_ONE) add(n);\n  return factors;\n}\n\nconst parse = function (p1, p2) {\n\n  let n = C_ZERO, d = C_ONE, s = C_ONE;\n\n  if (p1 === undefined || p1 === null) { // No argument\n    /* void */\n  } else if (p2 !== undefined) { // Two arguments\n\n    if (typeof p1 === \"bigint\") {\n      n = p1;\n    } else if (isNaN(p1)) {\n      throw InvalidParameter();\n    } else if (p1 % 1 !== 0) {\n      throw NonIntegerParameter();\n    } else {\n      n = BigInt(p1);\n    }\n\n    if (typeof p2 === \"bigint\") {\n      d = p2;\n    } else if (isNaN(p2)) {\n      throw InvalidParameter();\n    } else if (p2 % 1 !== 0) {\n      throw NonIntegerParameter();\n    } else {\n      d = BigInt(p2);\n    }\n\n    s = n * d;\n\n  } else if (typeof p1 === \"object\") {\n    if (\"d\" in p1 && \"n\" in p1) {\n      n = BigInt(p1[\"n\"]);\n      d = BigInt(p1[\"d\"]);\n      if (\"s\" in p1)\n        n *= BigInt(p1[\"s\"]);\n    } else if (0 in p1) {\n      n = BigInt(p1[0]);\n      if (1 in p1)\n        d = BigInt(p1[1]);\n    } else if (typeof p1 === \"bigint\") {\n      n = p1;\n    } else {\n      throw InvalidParameter();\n    }\n    s = n * d;\n  } else if (typeof p1 === \"number\") {\n\n    if (isNaN(p1)) {\n      throw InvalidParameter();\n    }\n\n    if (p1 < 0) {\n      s = -C_ONE;\n      p1 = -p1;\n    }\n\n    if (p1 % 1 === 0) {\n      n = BigInt(p1);\n    } else {\n\n      let z = 1;\n\n      let A = 0, B = 1;\n      let C = 1, D = 1;\n\n      let N = 10000000;\n\n      if (p1 >= 1) {\n        z = 10 ** Math.floor(1 + Math.log10(p1));\n        p1 /= z;\n      }\n\n      // Using Farey Sequences\n\n      while (B <= N && D <= N) {\n        let 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 = BigInt(n) * BigInt(z);\n      d = BigInt(d);\n    }\n\n  } else if (typeof p1 === \"string\") {\n\n    let ndx = 0;\n\n    let v = C_ZERO, w = C_ZERO, x = C_ZERO, y = C_ONE, z = C_ONE;\n\n    let match = p1.replace(/_/g, '').match(/\\d+|./g);\n\n    if (match === null)\n      throw InvalidParameter();\n\n    if (match[ndx] === '-') {// Check for minus sign at the beginning\n      s = -C_ONE;\n      ndx++;\n    } else if (match[ndx] === '+') {// Check for plus sign at the beginning\n      ndx++;\n    }\n\n    if (match.length === ndx + 1) { // Check if it's just a simple number \"1234\"\n      w = assign(match[ndx++], s);\n    } else if (match[ndx + 1] === '.' || match[ndx] === '.') { // Check if it's a decimal number\n\n      if (match[ndx] !== '.') { // Handle 0.5 and .5\n        v = assign(match[ndx++], s);\n      }\n      ndx++;\n\n      // Check for decimal places\n      if (ndx + 1 === match.length || match[ndx + 1] === '(' && match[ndx + 3] === ')' || match[ndx + 1] === \"'\" && match[ndx + 3] === \"'\") {\n        w = assign(match[ndx], s);\n        y = C_TEN ** BigInt(match[ndx].length);\n        ndx++;\n      }\n\n      // Check for repeating places\n      if (match[ndx] === '(' && match[ndx + 2] === ')' || match[ndx] === \"'\" && match[ndx + 2] === \"'\") {\n        x = assign(match[ndx + 1], s);\n        z = C_TEN ** BigInt(match[ndx + 1].length) - C_ONE;\n        ndx += 3;\n      }\n\n    } else if (match[ndx + 1] === '/' || match[ndx + 1] === ':') { // Check for a simple fraction \"123/456\" or \"123:456\"\n      w = assign(match[ndx], s);\n      y = assign(match[ndx + 2], C_ONE);\n      ndx += 3;\n    } else if (match[ndx + 3] === '/' && match[ndx + 1] === ' ') { // Check for a complex fraction \"123 1/2\"\n      v = assign(match[ndx], s);\n      w = assign(match[ndx + 2], s);\n      y = assign(match[ndx + 4], C_ONE);\n      ndx += 5;\n    }\n\n    if (match.length <= ndx) { // Check for more tokens on the stack\n      d = y * z;\n      s = /* void */\n        n = x + d * v + z * w;\n    } else {\n      throw InvalidParameter();\n    }\n\n  } else if (typeof p1 === \"bigint\") {\n    n = p1;\n    s = p1;\n    d = C_ONE;\n  } else {\n    throw InvalidParameter();\n  }\n\n  if (d === C_ZERO) {\n    throw DivisionByZero();\n  }\n\n  P[\"s\"] = s < C_ZERO ? -C_ONE : C_ONE;\n  P[\"n\"] = n < C_ZERO ? -n : n;\n  P[\"d\"] = d < C_ZERO ? -d : d;\n};\n\nfunction modpow(b, e, m) {\n\n  let r = C_ONE;\n  for (; e > C_ZERO; b = (b * b) % m, e >>= C_ONE) {\n\n    if (e & C_ONE) {\n      r = (r * b) % m;\n    }\n  }\n  return r;\n}\n\nfunction cycleLen(n, d) {\n\n  for (; d % C_TWO === C_ZERO;\n    d /= C_TWO) {\n  }\n\n  for (; d % C_FIVE === C_ZERO;\n    d /= C_FIVE) {\n  }\n\n  if (d === C_ONE) // Catch non-cyclic numbers\n    return C_ZERO;\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  let rem = C_TEN % d;\n  let t = 1;\n\n  for (; rem !== C_ONE; t++) {\n    rem = rem * C_TEN % d;\n\n    if (t > MAX_CYCLE_LEN)\n      return C_ZERO; // 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 BigInt(t);\n}\n\nfunction cycleStart(n, d, len) {\n\n  let rem1 = C_ONE;\n  let rem2 = modpow(C_TEN, len, d);\n\n  for (let 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 BigInt(t);\n\n    rem1 = rem1 * C_TEN % d;\n    rem2 = rem2 * C_TEN % d;\n  }\n  return 0;\n}\n\nfunction 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 */\nfunction Fraction(a, b) {\n\n  parse(a, b);\n\n  if (this instanceof Fraction) {\n    a = gcd(P[\"d\"], P[\"n\"]); // Abuse 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\nconst DivisionByZero = function () { return new Error(\"Division by Zero\"); };\nconst InvalidParameter = function () { return new Error(\"Invalid argument\"); };\nconst NonIntegerParameter = function () { return new Error(\"Parameters must be integer\"); };\n\nFraction.prototype = {\n\n  \"s\": C_ONE,\n  \"n\": C_ZERO,\n  \"d\": C_ONE,\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   * Ex: new Fraction(20, 10).mod().equals(0) ? \"is Integer\"\n   **/\n  \"mod\": function (a, b) {\n\n    if (a === undefined) {\n      return newFraction(this[\"s\"] * this[\"n\"] % this[\"d\"], C_ONE);\n    }\n\n    parse(a, b);\n    if (C_ZERO === P[\"n\"] * this[\"d\"]) {\n      throw DivisionByZero();\n    }\n\n    /**\n     * I derived the rational modulo similar to the modulo for integers\n     *\n     * https://raw.org/book/analysis/rational-numbers/\n     *\n     *    n1/d1 = (n2/d2) * q + r, where 0 \u2264 r < n2/d2\n     * => d2 * n1 = n2 * d1 * q + d1 * d2 * r\n     * => r = (d2 * n1 - n2 * d1 * q) / (d1 * d2)\n     *      = (d2 * n1 - n2 * d1 * floor((d2 * n1) / (n2 * d1))) / (d1 * d2)\n     *      = ((d2 * n1) % (n2 * d1)) / (d1 * d2)\n     */\n    return newFraction(\n      this[\"s\"] * (P[\"d\"] * this[\"n\"]) % (P[\"n\"] * this[\"d\"]),\n      P[\"d\"] * this[\"d\"]);\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    // https://raw.org/book/analysis/rational-numbers/\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    // https://raw.org/book/analysis/rational-numbers/\n    // lcm(a / b, c / d) = lcm(a, c) / gcd(b, d)\n\n    if (P[\"n\"] === C_ZERO && this[\"n\"] === C_ZERO) {\n      return newFraction(C_ZERO, C_ONE);\n    }\n    return newFraction(P[\"n\"] * this[\"n\"], gcd(P[\"n\"], this[\"n\"]) * gcd(P[\"d\"], this[\"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    return newFraction(this[\"s\"] * this[\"d\"], this[\"n\"]);\n  },\n\n  /**\n   * Calculates the fraction to some integer exponent\n   *\n   * Ex: new Fraction(-1,2).pow(-3) => -8\n   */\n  \"pow\": function (a, b) {\n\n    parse(a, b);\n\n    // Trivial case when exp is an integer\n\n    if (P['d'] === C_ONE) {\n\n      if (P['s'] < C_ZERO) {\n        return newFraction((this['s'] * this[\"d\"]) ** P['n'], this[\"n\"] ** P['n']);\n      } else {\n        return newFraction((this['s'] * this[\"n\"]) ** P['n'], this[\"d\"] ** P['n']);\n      }\n    }\n\n    // Negative roots become complex\n    //     (-a/b)^(c/d) = x\n    // \u21D4 (-1)^(c/d) * (a/b)^(c/d) = x\n    // \u21D4 (cos(pi) + i*sin(pi))^(c/d) * (a/b)^(c/d) = x\n    // \u21D4 (cos(c*pi/d) + i*sin(c*pi/d)) * (a/b)^(c/d) = x       # DeMoivre's formula\n    // From which follows that only for c=0 the root is non-complex\n    if (this['s'] < C_ZERO) return null;\n\n    // Now prime factor n and d\n    let N = factorize(this['n']);\n    let D = factorize(this['d']);\n\n    // Exponentiate and take root for n and d individually\n    let n = C_ONE;\n    let d = C_ONE;\n    for (let k in N) {\n      if (k === '1') continue;\n      if (k === '0') {\n        n = C_ZERO;\n        break;\n      }\n      N[k] *= P['n'];\n\n      if (N[k] % P['d'] === C_ZERO) {\n        N[k] /= P['d'];\n      } else return null;\n      n *= BigInt(k) ** N[k];\n    }\n\n    for (let k in D) {\n      if (k === '1') continue;\n      D[k] *= P['n'];\n\n      if (D[k] % P['d'] === C_ZERO) {\n        D[k] /= P['d'];\n      } else return null;\n      d *= BigInt(k) ** D[k];\n    }\n\n    if (P['s'] < C_ZERO) {\n      return newFraction(d, n);\n    }\n    return newFraction(n, d);\n  },\n\n  /**\n   * Calculates the logarithm of a fraction to a given rational base\n   *\n   * Ex: new Fraction(27, 8).log(9, 4) => 3/2\n   */\n  \"log\": function (a, b) {\n\n    parse(a, b);\n\n    if (this['s'] <= C_ZERO || P['s'] <= C_ZERO) return null;\n\n    const allPrimes = Object.create(null);\n\n    const baseFactors = factorize(P['n']);\n    const T1 = factorize(P['d']);\n\n    const numberFactors = factorize(this['n']);\n    const T2 = factorize(this['d']);\n\n    for (const prime in T1) {\n      baseFactors[prime] = (baseFactors[prime] || C_ZERO) - T1[prime];\n    }\n    for (const prime in T2) {\n      numberFactors[prime] = (numberFactors[prime] || C_ZERO) - T2[prime];\n    }\n\n    for (const prime in baseFactors) {\n      if (prime === '1') continue;\n      allPrimes[prime] = true;\n    }\n    for (const prime in numberFactors) {\n      if (prime === '1') continue;\n      allPrimes[prime] = true;\n    }\n\n    let retN = null;\n    let retD = null;\n\n    // Iterate over all unique primes to determine if a consistent ratio exists\n    for (const prime in allPrimes) {\n\n      const baseExponent = baseFactors[prime] || C_ZERO;\n      const numberExponent = numberFactors[prime] || C_ZERO;\n\n      if (baseExponent === C_ZERO) {\n        if (numberExponent !== C_ZERO) {\n          return null; // Logarithm cannot be expressed as a rational number\n        }\n        continue; // Skip this prime since both exponents are zero\n      }\n\n      // Calculate the ratio of exponents for this prime\n      let curN = numberExponent;\n      let curD = baseExponent;\n\n      // Simplify the current ratio\n      const gcdValue = gcd(curN, curD);\n      curN /= gcdValue;\n      curD /= gcdValue;\n\n      // Check if this is the first ratio; otherwise, ensure ratios are consistent\n      if (retN === null && retD === null) {\n        retN = curN;\n        retD = curD;\n      } else if (curN * retD !== retN * curD) {\n        return null; // Ratios do not match, logarithm cannot be rational\n      }\n    }\n\n    return retN !== null && retD !== null\n      ? newFraction(retN, retD)\n      : null;\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\"];\n  },\n\n  /**\n   * Check if this rational number is less than another\n   *\n   * Ex: new Fraction(19.6).lt([98, 5]);\n   **/\n  \"lt\": function (a, b) {\n\n    parse(a, b);\n    return this[\"s\"] * this[\"n\"] * P[\"d\"] < P[\"s\"] * P[\"n\"] * this[\"d\"];\n  },\n\n  /**\n   * Check if this rational number is less than or equal another\n   *\n   * Ex: new Fraction(19.6).lt([98, 5]);\n   **/\n  \"lte\": function (a, b) {\n\n    parse(a, b);\n    return this[\"s\"] * this[\"n\"] * P[\"d\"] <= P[\"s\"] * P[\"n\"] * this[\"d\"];\n  },\n\n  /**\n   * Check if this rational number is greater than another\n   *\n   * Ex: new Fraction(19.6).lt([98, 5]);\n   **/\n  \"gt\": function (a, b) {\n\n    parse(a, b);\n    return this[\"s\"] * this[\"n\"] * P[\"d\"] > P[\"s\"] * P[\"n\"] * this[\"d\"];\n  },\n\n  /**\n   * Check if this rational number is greater than or equal another\n   *\n   * Ex: new Fraction(19.6).lt([98, 5]);\n   **/\n  \"gte\": function (a, b) {\n\n    parse(a, b);\n    return this[\"s\"] * this[\"n\"] * P[\"d\"] >= P[\"s\"] * P[\"n\"] * this[\"d\"];\n  },\n\n  /**\n   * Compare two rational numbers\n   * < 0 iff this < that\n   * > 0 iff this > that\n   * = 0 iff this = that\n   *\n   * Ex: new Fraction(19.6).compare([98, 5]);\n   **/\n  \"compare\": function (a, b) {\n\n    parse(a, b);\n    let t = this[\"s\"] * this[\"n\"] * P[\"d\"] - P[\"s\"] * P[\"n\"] * this[\"d\"];\n\n    return (C_ZERO < t) - (t < C_ZERO);\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 = C_TEN ** BigInt(places || 0);\n\n    return newFraction(ifloor(this[\"s\"] * places * this[\"n\"] / this[\"d\"]) +\n      (places * this[\"n\"] % this[\"d\"] > C_ZERO && this[\"s\"] >= C_ZERO ? C_ONE : C_ZERO),\n      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 = C_TEN ** BigInt(places || 0);\n\n    return newFraction(ifloor(this[\"s\"] * places * this[\"n\"] / this[\"d\"]) -\n      (places * this[\"n\"] % this[\"d\"] > C_ZERO && this[\"s\"] < C_ZERO ? C_ONE : C_ZERO),\n      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 = C_TEN ** BigInt(places || 0);\n\n    /* Derivation:\n\n    s >= 0:\n      round(n / d) = ifloor(n / d) + (n % d) / d >= 0.5 ? 1 : 0\n                   = ifloor(n / d) + 2(n % d) >= d ? 1 : 0\n    s < 0:\n      round(n / d) =-ifloor(n / d) - (n % d) / d > 0.5 ? 1 : 0\n                   =-ifloor(n / d) - 2(n % d) > d ? 1 : 0\n\n    =>:\n\n    round(s * n / d) = s * ifloor(n / d) + s * (C + 2(n % d) > d ? 1 : 0)\n        where C = s >= 0 ? 1 : 0, to fix the >= for the positve case.\n    */\n\n    return newFraction(ifloor(this[\"s\"] * places * this[\"n\"] / this[\"d\"]) +\n      this[\"s\"] * ((this[\"s\"] >= C_ZERO ? C_ONE : C_ZERO) + C_TWO * (places * this[\"n\"] % this[\"d\"]) > this[\"d\"] ? C_ONE : C_ZERO),\n      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 \u2264 a/b < (k+1) * x/y\n    \u21D4 k \u2264 a/b / (x/y) < (k+1)\n    \u21D4 k = floor(a/b * y/x)\n    \u21D4 k = floor((a * y) / (b * x))\n    */\n\n    parse(a, b);\n\n    const n = this['n'] * P['d'];\n    const d = this['d'] * P['n'];\n    const r = n % d;\n\n    // round(n / d) = ifloor(n / d) + 2(n % d) >= d ? 1 : 0\n    let k = ifloor(n / d);\n    if (r + r >= d) {\n      k++;\n    }\n    return newFraction(this['s'] * k * P['n'], P['d']);\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    if (P['n'] === C_ZERO) return false;\n    return (this['n'] * P['d']) % (P['n'] * this['d']) === C_ZERO;\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    //if (this['n'] <= MAX_INTEGER && this['d'] <= MAX_INTEGER) {\n    return Number(this['s'] * this['n']) / Number(this['d']);\n    //}\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 = 15) {\n\n    let N = this[\"n\"];\n    let D = this[\"d\"];\n\n    let cycLen = cycleLen(N, D); // Cycle length\n    let cycOff = cycleStart(N, D, cycLen); // Cycle start\n\n    let str = this['s'] < C_ZERO ? \"-\" : \"\";\n\n    // Append integer part\n    str += ifloor(N / D);\n\n    N %= D;\n    N *= C_TEN;\n\n    if (N)\n      str += \".\";\n\n    if (cycLen) {\n\n      for (let i = cycOff; i--;) {\n        str += ifloor(N / D);\n        N %= D;\n        N *= C_TEN;\n      }\n      str += \"(\";\n      for (let i = cycLen; i--;) {\n        str += ifloor(N / D);\n        N %= D;\n        N *= C_TEN;\n      }\n      str += \")\";\n    } else {\n      for (let i = dec; N && i--;) {\n        str += ifloor(N / D);\n        N %= D;\n        N *= C_TEN;\n      }\n    }\n    return str;\n  },\n\n  /**\n   * Returns a string-fraction representation of a Fraction object\n   *\n   * Ex: new Fraction(\"1.'3'\").toFraction() => \"4 1/3\"\n   **/\n  'toFraction': function (showMixed = false) {\n\n    let n = this[\"n\"];\n    let d = this[\"d\"];\n    let str = this['s'] < C_ZERO ? \"-\" : \"\";\n\n    if (d === C_ONE) {\n      str += n;\n    } else {\n      const whole = ifloor(n / d);\n      if (showMixed && whole > C_ZERO) {\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 (showMixed = false) {\n\n    let n = this[\"n\"];\n    let d = this[\"d\"];\n    let str = this['s'] < C_ZERO ? \"-\" : \"\";\n\n    if (d === C_ONE) {\n      str += n;\n    } else {\n      const whole = ifloor(n / d);\n      if (showMixed && whole > C_ZERO) {\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    let a = this['n'];\n    let b = this['d'];\n    const res = [];\n\n    while (b) {\n      res.push(ifloor(a / b));\n      const t = a % b;\n      a = b;\n      b = t;\n    }\n    return res;\n  },\n\n  \"simplify\": function (eps = 1e-3) {\n\n    // Continued fractions give best approximations for a max denominator,\n    // generally outperforming mediants in denominator\u2013accuracy trade-offs.\n    // Semiconvergents can further reduce the denominator within tolerance.\n\n    const ieps = BigInt(Math.ceil(1 / eps));\n\n    const thisABS = this['abs']();\n    const cont = thisABS['toContinued']();\n\n    for (let i = 1; i < cont.length; i++) {\n\n      let s = newFraction(cont[i - 1], C_ONE);\n      for (let k = i - 2; k >= 0; k--) {\n        s = s['inverse']()['add'](cont[k]);\n      }\n\n      let t = s['sub'](thisABS);\n      if (t['n'] * ieps < t['d']) { // More robust than Math.abs(t.valueOf()) < eps\n        return s['mul'](this['s']);\n      }\n    }\n    return this;\n  }\n};\nexport {\n  Fraction as default, Fraction\n};\n", "import Fraction from 'fraction.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'Fraction';\nvar dependencies = [];\nexport var createFractionClass = /* #__PURE__ */factory(name, dependencies, () => {\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(Fraction, 'name', {\n    value: 'Fraction'\n  });\n  Fraction.prototype.constructor = Fraction;\n  Fraction.prototype.type = 'Fraction';\n  Fraction.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.prototype.toJSON = function () {\n    return {\n      mathjs: 'Fraction',\n      n: String(this.s * this.n),\n      d: String(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.fromJSON = function (json) {\n    return new Fraction(json);\n  };\n  return Fraction;\n}, {\n  isClass: true\n});", "import { isBigInt, isBigNumber } from '../../utils/is.js';\nimport { format, sign, nearlyEqual } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'Range';\nvar dependencies = [];\nexport var createRangeClass = /* #__PURE__ */factory(name, dependencies, () => {\n  /**\n   * Create a range of numbers. A range has a start, step, and end,\n   * and contains functions 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   * Note that the endpoints and step may be specified with other numeric\n   * types such as bigint or BigNumber, but they will be demoted to the\n   * built-in `number` type and the Range will only contain numbers. The\n   * rationale for this demotion is that Range objects are primarily used\n   * for indexing Matrix objects, and Matrix objects may only be indexed\n   * with `number`s.\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 (isBigNumber(start)) {\n        start = start.toNumber();\n      } else if (typeof start !== 'number' && !isBigInt(start)) {\n        throw new TypeError('Parameter start must be a number or bigint');\n      }\n    }\n    if (hasEnd) {\n      if (isBigNumber(end)) {\n        end = end.toNumber();\n      } else if (typeof end !== 'number' && !isBigInt(end)) {\n        throw new TypeError('Parameter end must be a number or bigint');\n      }\n    }\n    if (hasStep) {\n      if (isBigNumber(step)) {\n        step = step.toNumber();\n      } else if (typeof step !== 'number' && !isBigInt(step)) {\n        throw new TypeError('Parameter step must be a number or bigint');\n      }\n    }\n    this.start = hasStart ? parseFloat(start) : 0;\n    this.end = hasEnd ? parseFloat(end) : 0;\n    this.step = hasStep ? parseFloat(step) : 1;\n    if (hasStep && nearlyEqual(this.step, 0)) {\n      throw new Error('Step must not be zero');\n    }\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 (sign(step) === 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 = format(this.start, options);\n    if (this.step !== 1) {\n      str += ':' + format(this.step, options);\n    }\n    str += ':' + 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});", "import { factory } from '../../utils/factory.js';\nvar name = 'Matrix';\nvar dependencies = [];\nexport var createMatrixClass = /* #__PURE__ */factory(name, dependencies, () => {\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});", "import { isBigNumber, isNumber } from '../is.js';\nimport { isInteger, normalizeFormatOptions } from '../number.js';\n\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 (!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 | BigNumber} [options]\n * @return {string} str The formatted value\n */\nexport function 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  var {\n    notation,\n    precision,\n    wordSize\n  } = normalizeFormatOptions(options);\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 = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.lowerExp, -3);\n        var upperExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : 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} value\n * @param {number} [precision]        Optional number of significant figures to return.\n */\nexport function 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.includes('e')) {\n    var BigNumber = value.constructor;\n    valueStr = new BigNumber(valueStr).toFixed();\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 */\nexport function 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 */\nexport function toFixed(value, precision) {\n  return value.toFixed(precision);\n}\nfunction _toNumberOrDefault(value, defaultValue) {\n  if (isNumber(value)) {\n    return value;\n  } else if (isBigNumber(value)) {\n    return value.toNumber();\n  } else {\n    return defaultValue;\n  }\n}", "import { isBigNumber, isString, typeOf } from './is.js';\nimport { format as formatNumber } from './number.js';\nimport { format as formatBigNumber } from './bignumber/formatter.js';\n\n/**\n * Check if a text ends with a certain string.\n * @param {string} text\n * @param {string} search\n */\nexport function 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 */\nexport function format(value, options) {\n  var result = _format(value, options);\n  if (options && typeof 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 formatNumber(value, options);\n  }\n  if (isBigNumber(value)) {\n    return formatBigNumber(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 \"\".concat(value.s * value.n, \"/\").concat(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 (isString(value)) {\n    return stringify(value);\n  }\n  if (typeof value === 'function') {\n    return value.syntax ? String(value.syntax) : 'function';\n  }\n  if (value && typeof 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(key => {\n        return stringify(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 */\nexport function 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    escaped += c in controlCharacters ? controlCharacters[c] : c;\n    i++;\n  }\n  return '\"' + escaped + '\"';\n}\nvar controlCharacters = {\n  '\"': '\\\\\"',\n  '\\\\': '\\\\\\\\',\n  '\\b': '\\\\b',\n  '\\f': '\\\\f',\n  '\\n': '\\\\n',\n  '\\r': '\\\\r',\n  '\\t': '\\\\t'\n};\n\n/**\n * Escape special HTML characters\n * @param {*} value\n * @return {string}\n */\nexport function 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 && typeof value === 'object' && typeof value.s === 'bigint' && typeof value.n === 'bigint' && typeof value.d === 'bigint' || false;\n}\n\n/**\n * Compare two strings\n * @param {string} x\n * @param {string} y\n * @returns {number}\n */\nexport function compareText(x, y) {\n  // we don't want to convert numbers to string, only accept string input\n  if (!isString(x)) {\n    throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + typeOf(x) + ', index: 0)');\n  }\n  if (!isString(y)) {\n    throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + typeOf(y) + ', index: 1)');\n  }\n  return x === y ? 0 : x > y ? 1 : -1;\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 */\nexport function 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;", "/**\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 */\nexport function 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;", "import _extends from \"@babel/runtime/helpers/extends\";\nimport { isInteger } from './number.js';\nimport { isNumber, isBigNumber, isArray, isString } from './is.js';\nimport { format } from './string.js';\nimport { DimensionError } from '../error/DimensionError.js';\nimport { IndexError } from '../error/IndexError.js';\nimport { deepStrictEqual } from './object.js';\n\n/**\n * Calculate the size of a multi dimensional array.\n * This function checks the size of the first entry, it does not validate\n * whether all dimensions match. (use function `validate` for that)\n * @param {Array} x\n * @return {number[]} size\n */\nexport function 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(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(size.length - 1, size.length, '<');\n      }\n      _validate(array[i], size, dimNext);\n    }\n  } else {\n    // last dimension. none of the children may be an array\n    for (i = 0; i < len; i++) {\n      if (Array.isArray(array[i])) {\n        throw new 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 */\nexport function validate(array, size) {\n  var isScalar = size.length === 0;\n  if (isScalar) {\n    // scalar\n    if (Array.isArray(array)) {\n      throw new DimensionError(array.length, 0);\n    }\n  } else {\n    // array\n    _validate(array, size, 0);\n  }\n}\n\n/**\n * Validate whether the source of the index matches the size of the Array\n * @param {Array | Matrix} value    Array to be validated\n * @param {Index} index  Index with the source information to validate\n * @throws DimensionError\n */\nexport function validateIndexSourceSize(value, index) {\n  var valueSize = value.isMatrix ? value._size : arraySize(value);\n  var sourceSize = index._sourceSize;\n  // checks if the source size is not null and matches the valueSize\n  sourceSize.forEach((sourceDim, i) => {\n    if (sourceDim !== null && sourceDim !== valueSize[i]) {\n      throw new DimensionError(sourceDim, valueSize[i]);\n    }\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 */\nexport function validateIndex(index, length) {\n  if (index !== undefined) {\n    if (!isNumber(index) || !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(index, length);\n    }\n  }\n}\n\n/**\n * Test if an index has empty values\n * @param {Index} index    Zero-based index\n */\nexport function isEmptyIndex(index) {\n  for (var i = 0; i < index._dimensions.length; ++i) {\n    var dimension = index._dimensions[i];\n    if (dimension._data && isArray(dimension._data)) {\n      if (dimension._size[0] === 0) {\n        return true;\n      }\n    } else if (dimension.isRange) {\n      if (dimension.start === dimension.end) {\n        return true;\n      }\n    } else if (isString(dimension)) {\n      if (dimension.length === 0) {\n        return true;\n      }\n    }\n  }\n  return false;\n}\n\n/**\n * Resize a multi dimensional array. The resized array is returned.\n * @param {Array | number} array         Array to be resized\n * @param {number[]} size Array with the size of each dimension\n * @param {*} [defaultValue=0]  Value to be filled 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 */\nexport function resize(array, size, defaultValue) {\n  // check the type of the arguments\n  if (!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 (!isNumber(value) || !isInteger(value) || value < 0) {\n      throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + format(size) + ')');\n    }\n  });\n\n  // convert number to an array\n  if (isNumber(array) || isBigNumber(array)) {\n    array = [array];\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 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 {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 */\nexport function reshape(array, sizes) {\n  var flatArray = flatten(array, true); // since it has rectangular\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(0, currentLength, '!=');\n  }\n  sizes = processSizesWildcard(sizes, currentLength);\n  var newLength = product(sizes);\n  if (currentLength !== newLength) {\n    throw new DimensionError(newLength, currentLength, '!=');\n  }\n  try {\n    return _reshape(flatArray, sizes);\n  } catch (e) {\n    if (e instanceof DimensionError) {\n      throw new DimensionError(newLength, currentLength, '!=');\n    }\n    throw e;\n  }\n}\n\n/**\n * Replaces the wildcard -1 in the sizes array.\n * @param {number[]} sizes  List of sizes for each dimension. At most one 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 {number[]}      The sizes array with wildcard replaced.\n */\nexport function 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 {number[]} array Array of factors\n * @returns {number}            Product of all elements\n */\nfunction product(array) {\n  return array.reduce((prev, curr) => prev * curr, 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 {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 dimension 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 */\nexport function 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 * Parameter `size` will be mutated to match the new, unsqueezed 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 */\nexport function 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 unsqueezed 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 * @param {boolean} isRectangular Optional. If the array is rectangular (not jagged)\n * @return {Array}        The flattened array (1 dimensional)\n */\nexport function flatten(array) {\n  var isRectangular = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;\n  if (!Array.isArray(array)) {\n    // if not an array, return as is\n    return array;\n  }\n  if (typeof isRectangular !== 'boolean') {\n    throw new TypeError('Boolean expected for second argument of flatten');\n  }\n  var flat = [];\n  if (isRectangular) {\n    _flattenRectangular(array);\n  } else {\n    _flatten(array);\n  }\n  return flat;\n  function _flatten(array) {\n    for (var i = 0; i < array.length; i++) {\n      var item = array[i];\n      if (Array.isArray(item)) {\n        _flatten(item);\n      } else {\n        flat.push(item);\n      }\n    }\n  }\n  function _flattenRectangular(array) {\n    if (Array.isArray(array[0])) {\n      for (var i = 0; i < array.length; i++) {\n        _flattenRectangular(array[i]);\n      }\n    } else {\n      for (var _i = 0; _i < array.length; _i++) {\n        flat.push(array[_i]);\n      }\n    }\n  }\n}\n\n/**\n * A safe map\n * @param {Array} array\n * @param {function} callback\n */\nexport function 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 */\nexport function 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 */\nexport function 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 an array given a regular expression\n * @param {Array} array\n * @param {RegExp} regexp\n * @return {Array} Returns the filtered array\n * @private\n */\nexport function 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, entry => regexp.test(entry));\n}\n\n/**\n * A safe join\n * @param {Array} array\n * @param {string} separator\n */\nexport function 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 */\nexport function 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 */\nexport function 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 */\nexport function 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} array\n * @returns {*}\n */\nexport function last(array) {\n  return array[array.length - 1];\n}\n\n/**\n * Get all but the last element of array.\n * @param {Array} array\n * @returns {Array}\n */\nexport function initial(array) {\n  return array.slice(0, array.length - 1);\n}\n\n/**\n * Recursively concatenate two matrices.\n * The contents of the matrices are 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 */\nfunction concatRecursive(a, b, concatDim, dim) {\n  if (dim < concatDim) {\n    // recurse into next dimension\n    if (a.length !== b.length) {\n      throw new DimensionError(a.length, b.length);\n    }\n    var c = [];\n    for (var i = 0; i < a.length; i++) {\n      c[i] = concatRecursive(a[i], b[i], concatDim, dim + 1);\n    }\n    return c;\n  } else {\n    // concatenate this dimension\n    return a.concat(b);\n  }\n}\n\n/**\n * Concatenates many arrays in the specified direction\n * @param {...Array} arrays All the arrays to concatenate\n * @param {number} concatDim The dimension on which to concatenate (zero-based)\n * @returns {Array}\n */\nexport function concat() {\n  var arrays = Array.prototype.slice.call(arguments, 0, -1);\n  var concatDim = Array.prototype.slice.call(arguments, -1);\n  if (arrays.length === 1) {\n    return arrays[0];\n  }\n  if (arrays.length > 1) {\n    return arrays.slice(1).reduce(function (A, B) {\n      return concatRecursive(A, B, concatDim, 0);\n    }, arrays[0]);\n  } else {\n    throw new Error('Wrong number of arguments in function concat');\n  }\n}\n\n/**\n * Receives two or more sizes and gets the broadcasted size for both.\n * @param  {...number[]} sizes Sizes to broadcast together\n * @returns {number[]} The broadcasted size\n */\nexport function broadcastSizes() {\n  for (var _len = arguments.length, sizes = new Array(_len), _key = 0; _key < _len; _key++) {\n    sizes[_key] = arguments[_key];\n  }\n  var dimensions = sizes.map(s => s.length);\n  var N = Math.max(...dimensions);\n  var sizeMax = new Array(N).fill(null);\n  // check for every size\n  for (var i = 0; i < sizes.length; i++) {\n    var size = sizes[i];\n    var dim = dimensions[i];\n    for (var j = 0; j < dim; j++) {\n      var n = N - dim + j;\n      if (size[j] > sizeMax[n]) {\n        sizeMax[n] = size[j];\n      }\n    }\n  }\n  for (var _i2 = 0; _i2 < sizes.length; _i2++) {\n    checkBroadcastingRules(sizes[_i2], sizeMax);\n  }\n  return sizeMax;\n}\n\n/**\n * Checks if it's possible to broadcast a size to another size\n * @param {number[]} size The size of the array to check\n * @param {number[]} toSize The size of the array to validate if it can be broadcasted to\n */\nexport function checkBroadcastingRules(size, toSize) {\n  var N = toSize.length;\n  var dim = size.length;\n  for (var j = 0; j < dim; j++) {\n    var n = N - dim + j;\n    if (size[j] < toSize[n] && size[j] > 1 || size[j] > toSize[n]) {\n      throw new Error(\"shape mismatch: mismatch is found in arg with shape (\".concat(size, \") not possible to broadcast dimension \").concat(dim, \" with size \").concat(size[j], \" to size \").concat(toSize[n]));\n    }\n  }\n}\n\n/**\n * Broadcasts a single array to a certain size\n * @param {Array} array Array to be broadcasted\n * @param {number[]} toSize Size to broadcast the array\n * @returns {Array} The broadcasted array\n */\nexport function broadcastTo(array, toSize) {\n  var Asize = arraySize(array);\n  if (deepStrictEqual(Asize, toSize)) {\n    return array;\n  }\n  checkBroadcastingRules(Asize, toSize);\n  var broadcastedSize = broadcastSizes(Asize, toSize);\n  var N = broadcastedSize.length;\n  var paddedSize = [...Array(N - Asize.length).fill(1), ...Asize];\n  var A = clone(array);\n  // reshape A if needed to make it ready for concat\n  if (Asize.length < N) {\n    A = reshape(A, paddedSize);\n    Asize = arraySize(A);\n  }\n\n  // stretches the array on each dimension to make it the same size as index\n  for (var dim = 0; dim < N; dim++) {\n    if (Asize[dim] < broadcastedSize[dim]) {\n      A = stretch(A, broadcastedSize[dim], dim);\n      Asize = arraySize(A);\n    }\n  }\n  return A;\n}\n\n/**\n * Broadcasts arrays and returns the broadcasted arrays in an array\n * @param  {...Array | any} arrays\n * @returns {Array[]} The broadcasted arrays\n */\nexport function broadcastArrays() {\n  for (var _len2 = arguments.length, arrays = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n    arrays[_key2] = arguments[_key2];\n  }\n  if (arrays.length === 0) {\n    throw new Error('Insufficient number of arguments in function broadcastArrays');\n  }\n  if (arrays.length === 1) {\n    return arrays[0];\n  }\n  var sizes = arrays.map(function (array) {\n    return arraySize(array);\n  });\n  var broadcastedSize = broadcastSizes(...sizes);\n  var broadcastedArrays = [];\n  arrays.forEach(function (array) {\n    broadcastedArrays.push(broadcastTo(array, broadcastedSize));\n  });\n  return broadcastedArrays;\n}\n\n/**\n * Stretches a matrix up to a certain size in a certain dimension\n * @param {Array} arrayToStretch\n * @param {number[]} sizeToStretch\n * @param {number} dimToStretch\n * @returns {Array} The stretched array\n */\nexport function stretch(arrayToStretch, sizeToStretch, dimToStretch) {\n  return concat(...Array(sizeToStretch).fill(arrayToStretch), dimToStretch);\n}\n\n/**\n* Retrieves a single element from an array given an index.\n*\n* @param {Array} array - The array from which to retrieve the value.\n* @param {Array<number>} index - An array of indices specifying the position of the desired element in each dimension.\n* @returns {*} - The value at the specified position in the array.\n*\n* @example\n* const arr = [[[1, 2], [3, 4]], [[5, 6], [7, 8]]];\n* const index = [1, 0, 1];\n* console.log(get(arr, index)); // 6\n*/\nexport function get(array, index) {\n  if (!Array.isArray(array)) {\n    throw new Error('Array expected');\n  }\n  var size = arraySize(array);\n  if (index.length !== size.length) {\n    throw new DimensionError(index.length, size.length);\n  }\n  for (var x = 0; x < index.length; x++) {\n    validateIndex(index[x], size[x]);\n  }\n  return index.reduce((acc, curr) => acc[curr], array);\n}\n\n/**\n * Recursively maps over each element of nested array using a provided callback function.\n *\n * @param {Array} array - The array to be mapped.\n * @param {Function} callback - The function to execute on each element, taking three arguments:\n *   - `value` (any): The current element being processed in the array.\n *   - `index` (Array<number>): The index of the current element being processed in the array.\n *   - `array` (Array): The array `deepMap` was called upon.\n * @param {boolean} [skipIndex=false] - If true, the callback function is called with only the value.\n * @returns {Array} A new array with each element being the result of the callback function.\n */\nexport function deepMap(array, callback) {\n  var skipIndex = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n  if (array.length === 0) {\n    return [];\n  }\n  if (skipIndex) {\n    return recursiveMap(array);\n  }\n  var index = [];\n  return recursiveMapWithIndex(array, 0);\n  function recursiveMapWithIndex(value, depth) {\n    if (Array.isArray(value)) {\n      var N = value.length;\n      var result = Array(N);\n      for (var i = 0; i < N; i++) {\n        index[depth] = i;\n        result[i] = recursiveMapWithIndex(value[i], depth + 1);\n      }\n      return result;\n    } else {\n      return callback(value, index.slice(0, depth), array);\n    }\n  }\n  function recursiveMap(value) {\n    if (Array.isArray(value)) {\n      var N = value.length;\n      var result = Array(N);\n      for (var i = 0; i < N; i++) {\n        result[i] = recursiveMap(value[i]);\n      }\n      return result;\n    } else {\n      return callback(value);\n    }\n  }\n}\n\n/**\n * Recursively iterates over each element in a multi-dimensional array and applies a callback function.\n *\n * @param {Array} array - The multi-dimensional array to iterate over.\n * @param {Function} callback - The function to execute for each element. It receives three arguments:\n *   - {any} value: The current element being processed in the array.\n *   - {Array<number>} index: The index of the current element in each dimension.\n *   - {Array} array: The original array being processed.\n * @param {boolean} [skipIndex=false] - If true, the callback function is called with only the value.\n */\nexport function deepForEach(array, callback) {\n  var skipIndex = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n  if (array.length === 0) {\n    return;\n  }\n  if (skipIndex) {\n    recursiveForEach(array);\n    return;\n  }\n  var index = [];\n  recursiveForEachWithIndex(array, 0);\n  function recursiveForEachWithIndex(value, depth) {\n    if (Array.isArray(value)) {\n      var N = value.length;\n      for (var i = 0; i < N; i++) {\n        index[depth] = i;\n        recursiveForEachWithIndex(value[i], depth + 1);\n      }\n    } else {\n      callback(value, index.slice(0, depth), array);\n    }\n  }\n  function recursiveForEach(value) {\n    if (Array.isArray(value)) {\n      var N = value.length;\n      for (var i = 0; i < N; i++) {\n        recursiveForEach(value[i]);\n      }\n    } else {\n      callback(value);\n    }\n  }\n}\n\n/**\n * Deep clones a multidimensional array\n * @param {Array} array\n * @returns {Array} cloned array\n */\nexport function clone(array) {\n  return _extends([], array);\n}", "import typed from 'typed-function';\nimport { get, arraySize } from './array.js';\nimport { typeOf as _typeOf } from './is.js';\n\n/**\n * Simplifies a callback function by reducing its complexity and potentially improving its performance.\n *\n * @param {Function} callback The original callback function to simplify.\n * @param {Array|Matrix} array The array that will be used with the callback function.\n * @param {string} name The name of the function that is using the callback.\n * @param {boolean} isUnary If true, the callback function is unary and will be optimized as such.\n * @returns {Function} Returns a simplified version of the callback function.\n */\nexport function optimizeCallback(callback, array, name, isUnary) {\n  if (typed.isTypedFunction(callback)) {\n    var numberOfArguments;\n    if (isUnary) {\n      numberOfArguments = 1;\n    } else {\n      var size = array.isMatrix ? array.size() : arraySize(array);\n\n      // Check the size of the last dimension to see if the array/matrix is empty\n      var isEmpty = size.length ? size[size.length - 1] === 0 : true;\n      if (isEmpty) {\n        // don't optimize callbacks for empty arrays/matrix, as they will never be called\n        // and in fact will throw an exception when we try to access the first element below\n        return {\n          isUnary,\n          fn: callback\n        };\n      }\n      var firstIndex = size.map(() => 0);\n      var firstValue = array.isMatrix ? array.get(firstIndex) : get(array, firstIndex);\n      numberOfArguments = _findNumberOfArgumentsTyped(callback, firstValue, firstIndex, array);\n    }\n    var fastCallback;\n    if (array.isMatrix && array.dataType !== 'mixed' && array.dataType !== undefined) {\n      var singleSignature = _findSingleSignatureWithArity(callback, numberOfArguments);\n      fastCallback = singleSignature !== undefined ? singleSignature : callback;\n    } else {\n      fastCallback = callback;\n    }\n    if (numberOfArguments >= 1 && numberOfArguments <= 3) {\n      return {\n        isUnary: numberOfArguments === 1,\n        fn: function fn() {\n          for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n            args[_key] = arguments[_key];\n          }\n          return _tryFunctionWithArgs(fastCallback, args.slice(0, numberOfArguments), name, callback.name);\n        }\n      };\n    }\n    return {\n      isUnary: false,\n      fn: function fn() {\n        for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n          args[_key2] = arguments[_key2];\n        }\n        return _tryFunctionWithArgs(fastCallback, args, name, callback.name);\n      }\n    };\n  }\n  if (isUnary === undefined) {\n    return {\n      isUnary: _findIfCallbackIsUnary(callback),\n      fn: callback\n    };\n  } else {\n    return {\n      isUnary,\n      fn: callback\n    };\n  }\n}\nfunction _findSingleSignatureWithArity(callback, arity) {\n  var matchingFunctions = [];\n  Object.entries(callback.signatures).forEach(_ref => {\n    var [signature, func] = _ref;\n    if (signature.split(',').length === arity) {\n      matchingFunctions.push(func);\n    }\n  });\n  if (matchingFunctions.length === 1) {\n    return matchingFunctions[0];\n  }\n}\n\n/**\n * Determines if a given callback function is unary (i.e., takes exactly one argument).\n *\n * This function checks the following conditions to determine if the callback is unary:\n * 1. The callback function should have exactly one parameter.\n * 2. The callback function should not use the `arguments` object.\n * 3. The callback function should not use rest parameters (`...`).\n * If in doubt, this function shall return `false` to be safe\n *\n * @param {Function} callback - The callback function to be checked.\n * @returns {boolean} - Returns `true` if the callback is unary, otherwise `false`.\n */\nfunction _findIfCallbackIsUnary(callback) {\n  if (callback.length !== 1) return false;\n  var callbackStr = callback.toString();\n  // Check if the callback function uses `arguments`\n  if (/arguments/.test(callbackStr)) return false;\n\n  // Extract the parameters of the callback function\n  var paramsStr = callbackStr.match(/\\(.*?\\)/);\n  // Check if the callback function uses rest parameters\n  if (/\\.\\.\\./.test(paramsStr)) return false;\n  return true;\n}\nfunction _findNumberOfArgumentsTyped(callback, value, index, array) {\n  var testArgs = [value, index, array];\n  for (var i = 3; i > 0; i--) {\n    var args = testArgs.slice(0, i);\n    if (typed.resolve(callback, args) !== null) {\n      return i;\n    }\n  }\n}\n\n/**\n   * @param {function} func The selected function taken from one of the signatures of the callback function\n   * @param {Array} args List with arguments to apply to the selected signature\n   * @param {string} mappingFnName the name of the function that is using the callback\n   * @param {string} callbackName the name of the callback function\n   * @returns {*} Returns the return value of the invoked signature\n   * @throws {TypeError} Throws an error when no matching signature was found\n   */\nfunction _tryFunctionWithArgs(func, args, mappingFnName, callbackName) {\n  try {\n    return func(...args);\n  } catch (err) {\n    _createCallbackError(err, args, mappingFnName, callbackName);\n  }\n}\n\n/**\n * Creates and throws a detailed TypeError when a callback function fails.\n *\n * @param {Error} err The original error thrown by the callback function.\n * @param {Array} args The arguments that were passed to the callback function.\n * @param {string} mappingFnName The name of the function that is using the callback.\n * @param {string} callbackName The name of the callback function.\n * @throws {TypeError} Throws a detailed TypeError with enriched error message.\n */\nfunction _createCallbackError(err, args, mappingFnName, callbackName) {\n  var _err$data;\n  // Enrich the error message so the user understands that it took place inside the callback function\n  if (err instanceof TypeError && ((_err$data = err.data) === null || _err$data === void 0 ? void 0 : _err$data.category) === 'wrongType') {\n    var argsDesc = [];\n    argsDesc.push(\"value: \".concat(_typeOf(args[0])));\n    if (args.length >= 2) {\n      argsDesc.push(\"index: \".concat(_typeOf(args[1])));\n    }\n    if (args.length >= 3) {\n      argsDesc.push(\"array: \".concat(_typeOf(args[2])));\n    }\n    throw new TypeError(\"Function \".concat(mappingFnName, \" cannot apply callback arguments \") + \"\".concat(callbackName, \"(\").concat(argsDesc.join(', '), \") at index \").concat(JSON.stringify(args[1])));\n  } else {\n    throw new TypeError(\"Function \".concat(mappingFnName, \" cannot apply callback arguments \") + \"to function \".concat(callbackName, \": \").concat(err.message));\n  }\n}", "// deno-lint-ignore-file no-this-alias\nimport { isArray, isBigNumber, isCollection, isIndex, isMatrix, isNumber, isString, typeOf } from '../../utils/is.js';\nimport { arraySize, getArrayDataType, processSizesWildcard, reshape, resize, unsqueeze, validate, validateIndex, broadcastTo, get } from '../../utils/array.js';\nimport { format } from '../../utils/string.js';\nimport { isInteger } from '../../utils/number.js';\nimport { clone, deepStrictEqual } from '../../utils/object.js';\nimport { DimensionError } from '../../error/DimensionError.js';\nimport { factory } from '../../utils/factory.js';\nimport { optimizeCallback } from '../../utils/optimizeCallback.js';\nvar name = 'DenseMatrix';\nvar dependencies = ['Matrix', 'config'];\nexport var createDenseMatrixClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    Matrix,\n    config\n  } = _ref;\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 && !isString(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\n    }\n    if (isMatrix(data)) {\n      // check data is a DenseMatrix\n      if (data.type === 'DenseMatrix') {\n        // clone data & size\n        this._data = clone(data._data);\n        this._size = clone(data._size);\n        this._datatype = datatype || data._datatype;\n      } else {\n        // build data from existing matrix\n        this._data = data.toArray();\n        this._size = data.size();\n        this._datatype = datatype || data._datatype;\n      }\n    } else if (data && isArray(data.data) && isArray(data.size)) {\n      // initialize fields from JSON representation\n      this._data = data.data;\n      this._size = data.size;\n      // verify the dimensions of the array\n      validate(this._data, this._size);\n      this._datatype = datatype || data.datatype;\n    } else if (isArray(data)) {\n      // replace nested Matrices with Arrays\n      this._data = preprocess(data);\n      // get the dimensions of the array\n      this._size = arraySize(this._data);\n      // verify the dimensions of the array, TODO: compute size while processing array\n      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 (' + 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 getArrayDataType(this._data, 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    return get(this._data, index);\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 (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n    if (index.length < this._size.length) {\n      throw new 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      validateIndex(indexI, data.length);\n      data = data[indexI];\n    }\n\n    // set new value\n    indexI = index[index.length - 1];\n    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 (!isIndex(index)) {\n      throw new TypeError('Invalid index');\n    }\n    var isScalar = config.legacySubset ? index.size().every(idx => idx === 1) : 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(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        validateIndex(min[i], matrix._size[i]);\n        validateIndex(max[i], matrix._size[i]);\n      }\n\n      // retrieve submatrix\n      var returnMatrix = new DenseMatrix();\n      var submatrix = _getSubmatrix(matrix._data, index);\n      returnMatrix._size = submatrix.size;\n      returnMatrix._datatype = matrix._datatype;\n      returnMatrix._data = submatrix.data;\n      return config.legacySubset ? returnMatrix.reshape(index.size()) : returnMatrix;\n    }\n  }\n\n  /**\n   * 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   * @return {Array} submatrix\n   * @private\n   */\n  function _getSubmatrix(data, index) {\n    var maxDepth = index.size().length - 1;\n    var size = Array(maxDepth);\n    return {\n      data: getSubmatrixRecursive(data),\n      size: size.filter(x => x !== null)\n    };\n    function getSubmatrixRecursive(data) {\n      var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n      var dims = index.dimension(depth);\n      function _mapIndex(dim, callback) {\n        // applies a callback for when the index is a Number or a Matrix\n        if (isNumber(dim)) return callback(dim);else return dim.map(callback).valueOf();\n      }\n      if (isNumber(dims)) {\n        size[depth] = null;\n      } else {\n        size[depth] = dims.size()[0];\n      }\n      if (depth < maxDepth) {\n        return _mapIndex(dims, dimIndex => {\n          validateIndex(dimIndex, data.length);\n          return getSubmatrixRecursive(data[dimIndex], depth + 1);\n        });\n      } else {\n        return _mapIndex(dims, dimIndex => {\n          validateIndex(dimIndex, data.length);\n          return data[dimIndex];\n        });\n      }\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 submatrixSize;\n    if (isMatrix(submatrix)) {\n      submatrixSize = submatrix.size();\n      submatrix = submatrix.valueOf();\n    } else {\n      submatrixSize = arraySize(submatrix);\n    }\n    if (isScalar) {\n      // set a scalar\n\n      // check whether submatrix is a scalar\n      if (submatrixSize.length !== 0) {\n        throw new TypeError('Scalar expected');\n      }\n      matrix.set(index.min(), submatrix, defaultValue);\n    } else {\n      // set a submatrix\n\n      // broadcast submatrix\n      if (!deepStrictEqual(submatrixSize, iSize)) {\n        if (submatrixSize.length === 0) {\n          submatrix = broadcastTo([submatrix], iSize);\n        } else {\n          try {\n            submatrix = broadcastTo(submatrix, iSize);\n          } catch (error) {}\n        }\n        submatrixSize = arraySize(submatrix);\n      }\n\n      // validate dimensions\n      if (iSize.length < matrix._size.length) {\n        throw new DimensionError(iSize.length, matrix._size.length, '<');\n      }\n      if (submatrixSize.length < iSize.length) {\n        // calculate number of missing outer dimensions\n        var i = 0;\n        var outer = 0;\n        while (iSize[i] === 1 && submatrixSize[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 = unsqueeze(submatrix, iSize.length, outer, submatrixSize);\n      }\n\n      // check whether the size of the submatrix matches the index size\n      if (!deepStrictEqual(iSize, submatrixSize)) {\n        throw new DimensionError(iSize, submatrixSize, '>');\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      _setSubmatrix(matrix._data, index, submatrix);\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   * @private\n   */\n  function _setSubmatrix(data, index, submatrix) {\n    var maxDepth = index.size().length - 1;\n    setSubmatrixRecursive(data, submatrix);\n    function setSubmatrixRecursive(data, submatrix) {\n      var depth = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;\n      var range = index.dimension(depth);\n      var recursiveCallback = (rangeIndex, i) => {\n        validateIndex(rangeIndex, data.length);\n        setSubmatrixRecursive(data[rangeIndex], submatrix[i[0]], depth + 1);\n      };\n      var finalCallback = (rangeIndex, i) => {\n        validateIndex(rangeIndex, data.length);\n        data[rangeIndex] = submatrix[i[0]];\n      };\n      if (depth < maxDepth) {\n        if (isNumber(range)) recursiveCallback(range, [0]);else range.forEach(recursiveCallback);\n      } else {\n        if (isNumber(range)) finalCallback(range, [0]);else range.forEach(finalCallback);\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 (!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(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 (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 = 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 = reshape(m._data, size);\n    var currentLength = m._size.reduce((length, size) => length * size);\n    m._size = 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: clone(this._data),\n      size: 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   * @param {boolean} skipZeros   If true, the callback function is invoked only for non-zero entries\n   * @param {boolean} isUnary     If true, the callback function is invoked with one parameter\n   *\n   * @return {DenseMatrix} matrix\n   */\n  DenseMatrix.prototype.map = function (callback) {\n    var skipZeros = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;\n    var isUnary = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n    var me = this;\n    var maxDepth = me._size.length - 1;\n    if (maxDepth < 0) return me.clone();\n    var fastCallback = optimizeCallback(callback, me, 'map', isUnary);\n    var fastCallbackFn = fastCallback.fn;\n    var result = me.create(undefined, me._datatype);\n    result._size = me._size;\n    if (isUnary || fastCallback.isUnary) {\n      result._data = iterateUnary(me._data);\n      return result;\n    }\n    if (maxDepth === 0) {\n      var inputData = me.valueOf();\n      var data = Array(inputData.length);\n      for (var i = 0; i < inputData.length; i++) {\n        data[i] = fastCallbackFn(inputData[i], [i], me);\n      }\n      result._data = data;\n      return result;\n    }\n    var index = [];\n    result._data = iterate(me._data);\n    return result;\n    function iterate(data) {\n      var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n      var result = Array(data.length);\n      if (depth < maxDepth) {\n        for (var _i = 0; _i < data.length; _i++) {\n          index[depth] = _i;\n          result[_i] = iterate(data[_i], depth + 1);\n        }\n      } else {\n        for (var _i2 = 0; _i2 < data.length; _i2++) {\n          index[depth] = _i2;\n          result[_i2] = fastCallbackFn(data[_i2], index.slice(), me);\n        }\n      }\n      return result;\n    }\n    function iterateUnary(data) {\n      var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n      var result = Array(data.length);\n      if (depth < maxDepth) {\n        for (var _i3 = 0; _i3 < data.length; _i3++) {\n          result[_i3] = iterateUnary(data[_i3], depth + 1);\n        }\n      } else {\n        for (var _i4 = 0; _i4 < data.length; _i4++) {\n          result[_i4] = fastCallbackFn(data[_i4]);\n        }\n      }\n      return result;\n    }\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   * @param {boolean} skipZeros   If true, the callback function is invoked only for non-zero entries\n   * @param {boolean} isUnary     If true, the callback function is invoked with one parameter\n   */\n  DenseMatrix.prototype.forEach = function (callback) {\n    var skipZeros = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;\n    var isUnary = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n    var me = this;\n    var maxDepth = me._size.length - 1;\n    if (maxDepth < 0) return;\n    var fastCallback = optimizeCallback(callback, me, 'map', isUnary);\n    var fastCallbackFn = fastCallback.fn;\n    if (isUnary || fastCallback.isUnary) {\n      iterateUnary(me._data);\n      return;\n    }\n    if (maxDepth === 0) {\n      for (var i = 0; i < me._data.length; i++) {\n        fastCallbackFn(me._data[i], [i], me);\n      }\n      return;\n    }\n    var index = [];\n    iterate(me._data);\n    function iterate(data) {\n      var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n      if (depth < maxDepth) {\n        for (var _i5 = 0; _i5 < data.length; _i5++) {\n          index[depth] = _i5;\n          iterate(data[_i5], depth + 1);\n        }\n      } else {\n        for (var _i6 = 0; _i6 < data.length; _i6++) {\n          index[depth] = _i6;\n          fastCallbackFn(data[_i6], index.slice(), me);\n        }\n      }\n    }\n    function iterateUnary(data) {\n      var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n      if (depth < maxDepth) {\n        for (var _i7 = 0; _i7 < data.length; _i7++) {\n          iterateUnary(data[_i7], depth + 1);\n        }\n      } else {\n        for (var _i8 = 0; _i8 < data.length; _i8++) {\n          fastCallbackFn(data[_i8]);\n        }\n      }\n    }\n  };\n\n  /**\n   * Iterate over the matrix elements\n   * @return {Iterable<{ value, index: number[] }>}\n   */\n  DenseMatrix.prototype[Symbol.iterator] = function* () {\n    var maxDepth = this._size.length - 1;\n    if (maxDepth < 0) {\n      return;\n    }\n    if (maxDepth === 0) {\n      for (var i = 0; i < this._data.length; i++) {\n        yield {\n          value: this._data[i],\n          index: [i]\n        };\n      }\n      return;\n    }\n\n    // Multi-dimensional matrix: iterate over all elements\n    var index = Array(maxDepth + 1).fill(0);\n    var totalElements = this._size.reduce((a, b) => a * b, 1);\n    for (var count = 0; count < totalElements; count++) {\n      // Traverse to the current element using indices\n      var current = this._data;\n      for (var d = 0; d < maxDepth; d++) {\n        current = current[index[d]];\n      }\n      yield {\n        value: current[index[maxDepth]],\n        index: index.slice()\n      };\n\n      // Increment indices for next element\n      for (var _d = maxDepth; _d >= 0; _d--) {\n        index[_d]++;\n        if (index[_d] < this._size[_d]) break;\n        index[_d] = 0;\n      }\n    }\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    for (var row of data) {\n      result.push(new DenseMatrix([row], this._datatype));\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(row => [row[i]]);\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 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 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 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 (isBigNumber(k)) {\n        k = k.toNumber();\n      }\n      // is must be an integer\n      if (!isNumber(k) || !isInteger(k)) {\n        throw new TypeError('The parameter k must be an integer number');\n      }\n    } else {\n      // default value\n      k = 0;\n    }\n    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,\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 (!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 (isBigNumber(s)) {\n        // convert it\n        s = s.toNumber();\n      }\n      // validate arguments\n      if (!isNumber(s) || !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 (isBigNumber(k)) {\n        k = k.toNumber();\n      }\n      // is must be an integer\n      if (!isNumber(k) || !isInteger(k)) {\n        throw new TypeError('The parameter k must be an integer number');\n      }\n    } else {\n      // default value\n      k = 0;\n    }\n    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 (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 (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 = 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 = 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,\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 (!isNumber(i) || !isInteger(i) || !isNumber(j) || !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    validateIndex(i, this._size[0]);\n    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. Clones all (nested) Arrays, and replaces all nested Matrices with Arrays\n   * @memberof DenseMatrix\n   * @param {Array | Matrix} data\n   * @return {Array} data\n   */\n  function preprocess(data) {\n    if (isMatrix(data)) {\n      return preprocess(data.valueOf());\n    }\n    if (isArray(data)) {\n      return data.map(preprocess);\n    }\n    return data;\n  }\n  return DenseMatrix;\n}, {\n  isClass: true\n});", "import { clone as objectClone } from '../../utils/object.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'clone';\nvar dependencies = ['typed'];\nexport var createClone = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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: objectClone\n  });\n});", "/**\n * Transpose a matrix\n * @param {Array} mat\n * @returns {Array} ret\n * @private\n */\nexport function _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}", "import { isCollection, isMatrix } from './is.js';\nimport { IndexError } from '../error/IndexError.js';\nimport { arraySize, deepMap as arrayDeepMap, deepForEach as arrayDeepForEach } from './array.js';\nimport { _switch } from './switch.js';\n\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 */\nexport function containsCollections(array) {\n  for (var i = 0; i < array.length; i++) {\n    if (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 */\nexport function deepForEach(array, callback) {\n  if (isMatrix(array)) {\n    array.forEach(x => callback(x), false, true);\n  } else {\n    arrayDeepForEach(array, callback, true);\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 */\nexport function deepMap(array, callback, skipZeros) {\n  if (!skipZeros) {\n    if (isMatrix(array)) {\n      return array.map(x => callback(x), false, true);\n    } else {\n      return arrayDeepMap(array, callback, true);\n    }\n  }\n  var skipZerosCallback = x => x === 0 ? x : callback(x);\n  if (isMatrix(array)) {\n    return array.map(x => skipZerosCallback(x), false, true);\n  } else {\n    return arrayDeepMap(array, skipZerosCallback, true);\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 */\nexport function reduce(mat, dim, callback) {\n  var size = Array.isArray(mat) ? 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(dim, size.length);\n  }\n  if (isMatrix(mat)) {\n    return mat.create(_reduce(mat.valueOf(), dim, callback), mat.datatype());\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 = _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\nexport function 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}", "import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'isInteger';\nvar dependencies = ['typed', 'equal'];\nexport var createIsInteger = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equal\n  } = _ref;\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 TypeError\n   *\n   * See also:\n   *\n   *    isNumeric, isPositive, isNegative, isZero\n   *\n   * @param {number | BigNumber | bigint | 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: n => Number.isFinite(n) ? equal(n, Math.round(n)) : false,\n    BigNumber: b => b.isFinite() ? equal(b.round(), b) : false,\n    bigint: b => true,\n    Fraction: r => r.d === 1n,\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});", "import { cbrt, expm1, isInteger, log10, log1p, log2, sign, toFixed } from '../../utils/number.js';\nvar n1 = 'number';\nvar n2 = 'number, number';\nexport function absNumber(a) {\n  return Math.abs(a);\n}\nabsNumber.signature = n1;\nexport function addNumber(a, b) {\n  return a + b;\n}\naddNumber.signature = n2;\nexport function subtractNumber(a, b) {\n  return a - b;\n}\nsubtractNumber.signature = n2;\nexport function multiplyNumber(a, b) {\n  return a * b;\n}\nmultiplyNumber.signature = n2;\nexport function divideNumber(a, b) {\n  return a / b;\n}\ndivideNumber.signature = n2;\nexport function unaryMinusNumber(x) {\n  return -x;\n}\nunaryMinusNumber.signature = n1;\nexport function unaryPlusNumber(x) {\n  return x;\n}\nunaryPlusNumber.signature = n1;\nexport function cbrtNumber(x) {\n  return cbrt(x);\n}\ncbrtNumber.signature = n1;\nexport function cubeNumber(x) {\n  return x * x * x;\n}\ncubeNumber.signature = n1;\nexport function expNumber(x) {\n  return Math.exp(x);\n}\nexpNumber.signature = n1;\nexport function expm1Number(x) {\n  return 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 */\nexport function gcdNumber(a, b) {\n  if (!isInteger(a) || !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 */\nexport function lcmNumber(a, b) {\n  if (!isInteger(a) || !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 */\nexport function 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 */\nexport function log10Number(x) {\n  return 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 */\nexport function log2Number(x) {\n  return 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 */\nexport function log1pNumber(x) {\n  return 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 */\nexport function modNumber(x, y) {\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 y === 0 ? x : x - y * Math.floor(x / y);\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 */\nexport function 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}\nexport function signNumber(x) {\n  return sign(x);\n}\nsignNumber.signature = n1;\nexport function sqrtNumber(x) {\n  return Math.sqrt(x);\n}\nsqrtNumber.signature = n1;\nexport function 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 */\nexport function 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 (!isInteger(a) || !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 */\nexport function 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 */\nexport function roundNumber(value) {\n  var decimals = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n  if (!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(toFixed(value, decimals));\n}\n\n/**\n * Calculate the norm of a number, the absolute value.\n * @param {number} x\n * @return {number}\n */\nexport function normNumber(x) {\n  return Math.abs(x);\n}\nnormNumber.signature = n1;", "import { isInteger } from '../../utils/number.js';\nvar n1 = 'number';\nvar n2 = 'number, number';\nexport function bitAndNumber(x, y) {\n  if (!isInteger(x) || !isInteger(y)) {\n    throw new Error('Integers expected in function bitAnd');\n  }\n  return x & y;\n}\nbitAndNumber.signature = n2;\nexport function bitNotNumber(x) {\n  if (!isInteger(x)) {\n    throw new Error('Integer expected in function bitNot');\n  }\n  return ~x;\n}\nbitNotNumber.signature = n1;\nexport function bitOrNumber(x, y) {\n  if (!isInteger(x) || !isInteger(y)) {\n    throw new Error('Integers expected in function bitOr');\n  }\n  return x | y;\n}\nbitOrNumber.signature = n2;\nexport function bitXorNumber(x, y) {\n  if (!isInteger(x) || !isInteger(y)) {\n    throw new Error('Integers expected in function bitXor');\n  }\n  return x ^ y;\n}\nbitXorNumber.signature = n2;\nexport function leftShiftNumber(x, y) {\n  if (!isInteger(x) || !isInteger(y)) {\n    throw new Error('Integers expected in function leftShift');\n  }\n  return x << y;\n}\nleftShiftNumber.signature = n2;\nexport function rightArithShiftNumber(x, y) {\n  if (!isInteger(x) || !isInteger(y)) {\n    throw new Error('Integers expected in function rightArithShift');\n  }\n  return x >> y;\n}\nrightArithShiftNumber.signature = n2;\nexport function rightLogShiftNumber(x, y) {\n  if (!isInteger(x) || !isInteger(y)) {\n    throw new Error('Integers expected in function rightLogShift');\n  }\n  return x >>> y;\n}\nrightLogShiftNumber.signature = n2;", "/** @param {number} i\n *  @param {number} n\n *  @returns {number} product of i to n\n */\nexport function 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}", "import { isInteger } from '../../utils/number.js';\nimport { product } from '../../utils/product.js';\nexport function combinationsNumber(n, k) {\n  if (!isInteger(n) || n < 0) {\n    throw new TypeError('Positive integer value expected in function combinations');\n  }\n  if (!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 /= product(nextdivisor, lastdivisor);\n  }\n  return answer;\n}\ncombinationsNumber.signature = 'number, number';", "export var pi = Math.PI;\nexport var tau = 2 * Math.PI;\nexport var e = Math.E;\nexport var phi = 1.6180339887498948; // eslint-disable-line no-loss-of-precision", "var n1 = 'number';\nvar n2 = 'number, number';\nexport function notNumber(x) {\n  return !x;\n}\nnotNumber.signature = n1;\nexport function orNumber(x, y) {\n  return !!(x || y);\n}\norNumber.signature = n2;\nexport function xorNumber(x, y) {\n  return !!x !== !!y;\n}\nxorNumber.signature = n2;\nexport function andNumber(x, y) {\n  return !!(x && y);\n}\nandNumber.signature = n2;", "/* eslint-disable no-loss-of-precision */\n\nimport { isInteger } from '../../utils/number.js';\nimport { product } from '../../utils/product.js';\nexport function gammaNumber(n) {\n  var x;\n  if (isInteger(n)) {\n    if (n <= 0) {\n      return Number.isFinite(n) ? Infinity : NaN;\n    }\n    if (n > 171) {\n      return Infinity; // Will overflow\n    }\n    return 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  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\nexport var gammaG = 4.7421875;\nexport var 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\nexport var lnSqrt2PI = 0.91893853320467274178;\nexport var lgammaG = 5; // Lanczos parameter \"g\"\nexport var lgammaN = 7; // Range of coefficients \"n\"\n\nexport var lgammaSeries = [1.000000000190015, 76.18009172947146, -86.50532032941677, 24.01409824083091, -1.231739572450155, 0.1208650973866179e-2, -0.5395239384953e-5];\nexport function lgammaNumber(n) {\n  if (n < 0) return NaN;\n  if (n === 0) return Infinity;\n  if (!Number.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';", "import { acosh, asinh, atanh, cosh, sign, sinh, tanh } from '../../utils/number.js';\nvar n1 = 'number';\nvar n2 = 'number, number';\nexport function acosNumber(x) {\n  return Math.acos(x);\n}\nacosNumber.signature = n1;\nexport function acoshNumber(x) {\n  return acosh(x);\n}\nacoshNumber.signature = n1;\nexport function acotNumber(x) {\n  return Math.atan(1 / x);\n}\nacotNumber.signature = n1;\nexport function acothNumber(x) {\n  return Number.isFinite(x) ? (Math.log((x + 1) / x) + Math.log(x / (x - 1))) / 2 : 0;\n}\nacothNumber.signature = n1;\nexport function acscNumber(x) {\n  return Math.asin(1 / x);\n}\nacscNumber.signature = n1;\nexport function acschNumber(x) {\n  var xInv = 1 / x;\n  return Math.log(xInv + Math.sqrt(xInv * xInv + 1));\n}\nacschNumber.signature = n1;\nexport function asecNumber(x) {\n  return Math.acos(1 / x);\n}\nasecNumber.signature = n1;\nexport function 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;\nexport function asinNumber(x) {\n  return Math.asin(x);\n}\nasinNumber.signature = n1;\nexport function asinhNumber(x) {\n  return asinh(x);\n}\nasinhNumber.signature = n1;\nexport function atanNumber(x) {\n  return Math.atan(x);\n}\natanNumber.signature = n1;\nexport function atan2Number(y, x) {\n  return Math.atan2(y, x);\n}\natan2Number.signature = n2;\nexport function atanhNumber(x) {\n  return atanh(x);\n}\natanhNumber.signature = n1;\nexport function cosNumber(x) {\n  return Math.cos(x);\n}\ncosNumber.signature = n1;\nexport function coshNumber(x) {\n  return cosh(x);\n}\ncoshNumber.signature = n1;\nexport function cotNumber(x) {\n  return 1 / Math.tan(x);\n}\ncotNumber.signature = n1;\nexport function cothNumber(x) {\n  var e = Math.exp(2 * x);\n  return (e + 1) / (e - 1);\n}\ncothNumber.signature = n1;\nexport function cscNumber(x) {\n  return 1 / Math.sin(x);\n}\ncscNumber.signature = n1;\nexport function 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))) * sign(x);\n  }\n}\ncschNumber.signature = n1;\nexport function secNumber(x) {\n  return 1 / Math.cos(x);\n}\nsecNumber.signature = n1;\nexport function sechNumber(x) {\n  return 2 / (Math.exp(x) + Math.exp(-x));\n}\nsechNumber.signature = n1;\nexport function sinNumber(x) {\n  return Math.sin(x);\n}\nsinNumber.signature = n1;\nexport function sinhNumber(x) {\n  return sinh(x);\n}\nsinhNumber.signature = n1;\nexport function tanNumber(x) {\n  return Math.tan(x);\n}\ntanNumber.signature = n1;\nexport function tanhNumber(x) {\n  return tanh(x);\n}\ntanhNumber.signature = n1;", "import { isInteger } from '../../utils/number.js';\nvar n1 = 'number';\nexport function isIntegerNumber(x) {\n  return isInteger(x);\n}\nisIntegerNumber.signature = n1;\nexport function isNegativeNumber(x) {\n  return x < 0;\n}\nisNegativeNumber.signature = n1;\nexport function isPositiveNumber(x) {\n  return x > 0;\n}\nisPositiveNumber.signature = n1;\nexport function isZeroNumber(x) {\n  return x === 0;\n}\nisZeroNumber.signature = n1;\nexport function isNaNNumber(x) {\n  return Number.isNaN(x);\n}\nisNaNNumber.signature = n1;", "/**\n * Compares two BigNumbers.\n * @param {BigNumber} a - First value to compare\n * @param {BigNumber} b - Second value to compare\n * @param {number} [relTol=1e-09] - The relative tolerance, indicating the maximum allowed difference relative to the larger absolute value. Must be greater than 0.\n * @param {number} [absTol=0] - The minimum absolute tolerance, useful for comparisons near zero. Must be at least 0.\n * @returns {boolean} whether the two numbers are nearly equal\n * @throws {Error} If `relTol` is less than or equal to 0.\n * @throws {Error} If `absTol` is less than 0.\n *\n * @example\n * nearlyEqual(1.000000001, 1.0, 1e-9);            // true\n * nearlyEqual(1.000000002, 1.0, 0);            // false\n * nearlyEqual(1.0, 1.009, undefined, 0.02);       // true\n * nearlyEqual(0.000000001, 0.0, undefined, 1e-8); // true\n */\nexport function nearlyEqual(a, b) {\n  var relTol = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1e-9;\n  var absTol = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 0;\n  if (relTol <= 0) {\n    throw new Error('Relative tolerance must be greater than 0');\n  }\n  if (absTol < 0) {\n    throw new Error('Absolute tolerance must be at least 0');\n  }\n  // NaN\n  if (a.isNaN() || b.isNaN()) {\n    return false;\n  }\n  if (!a.isFinite() || !b.isFinite()) {\n    return a.eq(b);\n  }\n  // use \"==\" operator, handles infinities\n  if (a.eq(b)) {\n    return true;\n  }\n  // abs(a-b) <= max(relTol * max(abs(a), abs(b)), absTol)\n  return a.minus(b).abs().lte(a.constructor.max(a.constructor.max(a.abs(), b.abs()).mul(relTol), absTol));\n}", "import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { isNegativeNumber } from '../../plain/number/index.js';\nimport { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { nearlyEqual } from '../../utils/number.js';\nvar name = 'isNegative';\nvar dependencies = ['typed', 'config'];\nexport var createIsNegative = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config\n  } = _ref;\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 | bigint | 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: x => nearlyEqual(x, 0, config.relTol, config.absTol) ? false : isNegativeNumber(x),\n    BigNumber: x => bigNearlyEqual(x, new x.constructor(0), config.relTol, config.absTol) ? false : x.isNeg() && !x.isZero() && !x.isNaN(),\n    bigint: x => x < 0n,\n    Fraction: x => x.s < 0n,\n    // It's enough to decide on the sign\n\n    Unit: typed.referToSelf(self => x => typed.find(self, x.valueType())(x.value)),\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});", "import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'isNumeric';\nvar dependencies = ['typed'];\nexport var createIsNumeric = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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('42'))  // returns true\n   *    math.isNumeric(math.bigint('42'))     // 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, isFinite, isBounded\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 | bigint | Fraction | boolean': () => true,\n    'Complex | Unit | string | null | undefined | Node': () => false,\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});", "import { factory } from '../../utils/factory.js';\nvar name = 'hasNumericValue';\nvar dependencies = ['typed', 'isNumeric'];\nexport var createHasNumericValue = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    isNumeric\n  } = _ref;\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.bigint('42'))     // returns true\n   *    math.hasNumericValue(42n)                   // 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: () => true,\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});", "import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { isPositiveNumber } from '../../plain/number/index.js';\nimport { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { nearlyEqual } from '../../utils/number.js';\nvar name = 'isPositive';\nvar dependencies = ['typed', 'config'];\nexport var createIsPositive = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config\n  } = _ref;\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 | bigint | 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: x => nearlyEqual(x, 0, config.relTol, config.absTol) ? false : isPositiveNumber(x),\n    BigNumber: x => bigNearlyEqual(x, new x.constructor(0), config.relTol, config.absTol) ? false : !x.isNeg() && !x.isZero() && !x.isNaN(),\n    bigint: x => x > 0n,\n    Fraction: x => x.s > 0n && x.n > 0n,\n    Unit: typed.referToSelf(self => x => typed.find(self, x.valueType())(x.value)),\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});", "import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'isZero';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createIsZero = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\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 | bigint | 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 | BigNumber | Complex | Fraction': x => equalScalar(x, 0),\n    bigint: x => x === 0n,\n    Unit: typed.referToSelf(self => x => typed.find(self, x.valueType())(x.value)),\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});", "import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { isNaNNumber } from '../../plain/number/index.js';\nvar name = 'isNaN';\nvar dependencies = ['typed'];\nexport var createIsNaN = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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, isFinite, isBounded\n   *\n   * @param {number | BigNumber | bigint | 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: isNaNNumber,\n    BigNumber: function BigNumber(x) {\n      return x.isNaN();\n    },\n    bigint: function bigint(x) {\n      return false;\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': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});", "import { factory } from '../../utils/factory.js';\nvar name = 'isBounded';\nvar dependencies = ['typed'];\nexport var createIsBounded = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Test whether a value is bounded. For scalars, this test is equivalent\n   * to the isFinite finiteness test. On the other hand, a Matrix or Array\n   * is defined to be bounded if every entry is finite.\n   *\n   * Syntax:\n   *\n   *     math.isBounded(x)\n   *\n   * Examples:\n   *\n   *    math.isBounded(0)                        // returns true\n   *    math.isBounded(NaN)                      // returns false\n   *    math.isBounded(math.bignumber(Infinity)) // returns false\n   *    math.isBounded(math.fraction(1,3))       // returns true\n   *    math.isBounded(math.complex('2 - 4i'))   // returns true\n   *    math.isBounded(-10000000000000000n)      // returns true\n   *    math.isBounded(undefined)                // returns false\n   *    math.isBounded(null)                     // returns false\n   *    math.isBounded([0.001, -3n, 0])          // returns true\n   *    math.isBounded([2, -Infinity, -3])       // returns false\n   *\n   * See also:\n   *\n   *    isFinite, isNumeric, isPositive, isNegative, isNaN\n   *\n   * @param {number | BigNumber | bigint | Complex | Fraction | Unit | Array | Matrix} x       Value to be tested\n   * @return {boolean}  Returns true when `x` is bounded.\n   */\n  return typed(name, {\n    number: n => Number.isFinite(n),\n    'BigNumber | Complex': x => x.isFinite(),\n    'bigint | Fraction': () => true,\n    'null | undefined': () => false,\n    Unit: typed.referToSelf(self => x => self(x.value)),\n    'Array | Matrix': typed.referToSelf(self => A => {\n      if (!Array.isArray(A)) A = A.valueOf();\n      return A.every(entry => self(entry));\n    })\n  });\n});", "import { factory } from '../../utils/factory.js';\nvar name = 'isFinite';\nvar dependencies = ['typed', 'isBounded', 'map'];\nexport var createIsFinite = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    isBounded,\n    map\n  } = _ref;\n  /**\n   * Test whether a value is finite.\n   *\n   * Operates elementwise on Array and Matrix values. To test if all entries\n   * of an Array or Matrix are finite, use isBounded.\n   *\n   * Syntax:\n   *\n   *     math.isFinite(x)\n   *\n   * Examples:\n   *\n   *    math.isFinite(0)                        // returns true\n   *    math.isFinite(NaN)                      // returns false\n   *    math.isFinite(math.bignumber(Infinity)) // returns false\n   *    math.isFinite(math.fraction(1,3))       // returns true\n   *    math.isFinite(math.complex('2 - 4i'))   // returns true\n   *    math.isFinite(-10000000000000000n)      // returns true\n   *    math.isFinite(undefined)                // returns false\n   *    math.isFinite(null)                     // returns false\n   *    math.isFinite([0.001, -3n, 0])          // Array [true, true, true]\n   *    math.isFinite([2, -Infinity, -3])       // Array [true, false, true]\n   *\n   * See also:\n   *\n   *    isBounded isNumeric, isPositive, isNegative, isNaN\n   *\n   * History:\n   *\n   *    v15.1   Created\n   *\n   * @param {number | BigNumber | bigint | Complex | Fraction | Unit | Array | Matrix} x\n   *     Value to be tested\n   * @return {boolean | Array | Matrix}\n   *     Whether the value, or its entries, are finite, as appropriate\n   *     to its type\n   */\n  return typed(name, {\n    'Array | Matrix': A => map(A, isBounded),\n    any: x => isBounded(x)\n  });\n});", "import { factory } from '../../utils/factory.js';\nimport { typeOf as _typeOf } from '../../utils/is.js';\nvar name = 'typeOf';\nvar dependencies = ['typed'];\nexport var createTypeOf = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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(42n)                      // returns 'bigint'\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: _typeOf\n  });\n});", "import { nearlyEqual } from './number.js';\n\n/**\n * Test whether two complex values are equal provided a given relTol and absTol.\n * Does not use or change the global Complex.EPSILON setting\n * @param {Complex} x - The first complex number for comparison.\n * @param {Complex} y - The second complex number for comparison.\n * @param {number} relTol - The relative tolerance for comparison.\n * @param {number} absTol - The absolute tolerance for comparison.\n * @returns {boolean} - Returns true if the two complex numbers are equal within the given tolerances, otherwise returns false.\n */\nexport function complexEquals(x, y, relTol, absTol) {\n  return nearlyEqual(x.re, y.re, relTol, absTol) && nearlyEqual(x.im, y.im, relTol, absTol);\n}", "import { factory } from '../../utils/factory.js';\nexport var createCompareUnits = /* #__PURE__ */factory('compareUnits', ['typed'], _ref => {\n  var {\n    typed\n  } = _ref;\n  return {\n    'Unit, Unit': typed.referToSelf(self => (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});", "import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { nearlyEqual } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { complexEquals } from '../../utils/complex.js';\nimport { createCompareUnits } from './compareUnits.js';\nvar name = 'equalScalar';\nvar dependencies = ['typed', 'config'];\nexport var createEqualScalar = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config\n  } = _ref;\n  var compareUnits = createCompareUnits({\n    typed\n  });\n\n  /**\n   * Test whether two scalar values are nearly equal.\n   *\n   * @param  {number | BigNumber | bigint | Fraction | boolean | Complex | Unit} x   First value to compare\n   * @param  {number | BigNumber | bigint | 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 boolean_boolean(x, y) {\n      return x === y;\n    },\n    'number, number': function number_number(x, y) {\n      return nearlyEqual(x, y, config.relTol, config.absTol);\n    },\n    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {\n      return x.eq(y) || bigNearlyEqual(x, y, config.relTol, config.absTol);\n    },\n    'bigint, bigint': function bigint_bigint(x, y) {\n      return x === y;\n    },\n    'Fraction, Fraction': function Fraction_Fraction(x, y) {\n      return x.equals(y);\n    },\n    'Complex, Complex': function Complex_Complex(x, y) {\n      return complexEquals(x, y, config.relTol, config.absTol);\n    }\n  }, compareUnits);\n});\nexport var createEqualScalarNumber = factory(name, ['typed', 'config'], _ref2 => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function number_number(x, y) {\n      return nearlyEqual(x, y, config.relTol, config.absTol);\n    }\n  });\n});", "import { isArray, isBigNumber, isCollection, isIndex, isMatrix, isNumber, isString, typeOf } from '../../utils/is.js';\nimport { isInteger } from '../../utils/number.js';\nimport { format } from '../../utils/string.js';\nimport { clone, deepStrictEqual } from '../../utils/object.js';\nimport { arraySize, getArrayDataType, processSizesWildcard, unsqueeze, validateIndex } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { DimensionError } from '../../error/DimensionError.js';\nimport { optimizeCallback } from '../../utils/optimizeCallback.js';\nvar name = 'SparseMatrix';\nvar dependencies = ['typed', 'equalScalar', 'Matrix'];\nexport var createSparseMatrixClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equalScalar,\n    Matrix\n  } = _ref;\n  /**\n   * Sparse Matrix implementation. This type (currently) implements 2D\n   * matrices only via the format known as\n   * [Compressed Column Storage](https://en.wikipedia.org/wiki/Sparse_matrix#Compressed_sparse_column_(CSC_or_CCS)).\n   *\n   * The structure/invariants of the internal data should be:\n   * 1. _values is an array of the nonzero values in order from top to bottom\n   *    (of each column), left to right.\n   * 2. _index is an array of row numbers, of the same length as and\n   *    corresponding positionally to _values.\n   * 3. _ptr is an array of length one more than the number of columns. For j\n   *    less than the number of columns, the \"half-open\" span of indices\n   *    _ptr[j] to _ptr[j+1] (i.e. including _ptr[j] if it is less than\n   *    _ptr[j+1], but never including _ptr[j+1]) are the indices in _values\n   *    of the nonzero elements in column j. Note there are no nonzero elements\n   *    in column j exactly when _ptr[j] === _ptr[j+1], and that the final\n   *    entry in _ptr is always exactly the number of nonzero entries in the\n   *    matrix.\n   * 4. _size is a length-2 array consisting of the number of rows followed by\n   *    the number of columns.\n   * 5. _datatype, if set, is the mathjs typeOf value of all entries of the\n   *    SparseMatrix.\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 && !isString(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\n    }\n    if (isMatrix(data)) {\n      // create from matrix\n      _createFromMatrix(this, data, datatype);\n    } else if (data && isArray(data.index) && isArray(data.ptr) && isArray(data.size)) {\n      // initialize fields\n      this._values = data.values;\n      this._index = data.index;\n      this._ptr = data.ptr;\n      this._size = data.size;\n      this._datatype = datatype || data.datatype;\n    } else if (isArray(data)) {\n      // create from array\n      _createFromArray(this, data, datatype);\n    } else if (data) {\n      // unsupported type\n      throw new TypeError('Unsupported type of data (' + 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 ? clone(source._values) : undefined;\n      matrix._index = clone(source._index);\n      matrix._ptr = clone(source._ptr);\n      matrix._size = 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 (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 (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    while (matrix._ptr.length <= columns) {\n      matrix._ptr.push(matrix._index.length);\n    }\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 getArrayDataType(this._values, 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 (!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(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      validateIndex(min[i], matrix._size[i]);\n      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    function rowsCallback(i, r) {\n      // update permutation vector\n      pv[i] = r[0];\n      // mark i in workspace\n      w[i] = true;\n    }\n    if (Number.isInteger(rows)) rowsCallback(rows, [0]);else rows.forEach(rowsCallback);\n\n    // result matrix arrays\n    var values = mvalues ? [] : undefined;\n    var index = [];\n    var ptr = [];\n\n    // loop columns in result matrix\n    function columnsCallback(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    if (Number.isInteger(columns)) columnsCallback(columns);else columns.forEach(columnsCallback);\n    // update ptr\n    ptr.push(index.length);\n\n    // return matrix\n    return new SparseMatrix({\n      values,\n      index,\n      ptr,\n      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 (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 = 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(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 = unsqueeze(submatrix, iSize.length, outer, sSize);\n      }\n\n      // check whether the size of the submatrix matches the index size\n      if (!deepStrictEqual(iSize, sSize)) {\n        throw new 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        _forEachIndex(range, (dataIndex, subIndex) => {\n          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        _forEachIndex(firstDimensionRange, (firstDataIndex, firstSubIndex) => {\n          validateIndex(firstDataIndex);\n          _forEachIndex(secondDimensionRange, (secondDataIndex, secondSubIndex) => {\n            validateIndex(secondDataIndex);\n            matrix.set([firstDataIndex, secondDataIndex], submatrix[firstSubIndex[0]][secondSubIndex[0]], defaultValue);\n          });\n        });\n      }\n    }\n    return matrix;\n    function _forEachIndex(index, callback) {\n      // iterate cases where index is a Matrix or a Number\n      if (isNumber(index)) callback(index, [0]);else index.forEach(callback);\n    }\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 (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n    if (index.length !== this._size.length) {\n      throw new 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    validateIndex(i, this._size[0]);\n    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 (!isArray(index)) {\n      throw new TypeError('Array expected');\n    }\n    if (index.length !== this._size.length) {\n      throw new 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 (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    validateIndex(i, rows);\n    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 (!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(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 (!isNumber(value) || !isInteger(value) || value < 0) {\n        throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + 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 (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 (!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 (!isNumber(value) || !isInteger(value) || value <= -2 || value === 0) {\n        throw new TypeError('Invalid size, must contain positive integers or -1 ' + '(size: ' + format(sizes) + ')');\n      }\n    });\n    var currentLength = this._size[0] * this._size[1];\n    sizes = 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 ? clone(this._values) : undefined,\n      index: clone(this._index),\n      ptr: clone(this._ptr),\n      size: 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    var fastCallback = optimizeCallback(callback, me, 'map');\n    // invoke callback\n    var invoke = function invoke(v, i, j) {\n      // invoke callback\n      return fastCallback.fn(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 (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      var value = callback(v, x, y);\n      // check value != 0\n      if (!eq(value, zero)) {\n        // store value\n        values.push(value);\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,\n      index,\n      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    var fastCallback = optimizeCallback(callback, me, 'forEach');\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          // TODO apply a non indexed version of algorithm in case fastCallback is not optimized\n          fastCallback.fn(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          fastCallback.fn(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] = function* () {\n    if (!this._values) {\n      throw new Error('Cannot iterate a Pattern only matrix');\n    }\n    var columns = this._size[1];\n    for (var j = 0; j < columns; j++) {\n      var k0 = this._ptr[j];\n      var k1 = this._ptr[j + 1];\n      for (var k = k0; k < k1; k++) {\n        // row index\n        var i = this._index[k];\n        yield {\n          value: this._values[k],\n          index: [i, j]\n        };\n      }\n    }\n  };\n\n  /**\n   * Create an Array with a copy of the data of the SparseMatrix\n   * @memberof SparseMatrix\n   * @returns {Array} array\n   */\n  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 ? 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 [' + format(rows, options) + ' x ' + format(columns, options) + '] density: ' + 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    (' + format(i, options) + ', ' + format(j, options) + ') ==> ' + (this._values ? 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 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 (isBigNumber(k)) {\n        k = k.toNumber();\n      }\n      // is must be an integer\n      if (!isNumber(k) || !isInteger(k)) {\n        throw new TypeError('The parameter k must be an integer number');\n      }\n    } else {\n      // default value\n      k = 0;\n    }\n    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,\n      index,\n      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 (!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 (isBigNumber(s)) {\n        // convert it\n        s = s.toNumber();\n      }\n      // validate arguments\n      if (!isNumber(s) || !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 (isBigNumber(k)) {\n        k = k.toNumber();\n      }\n      // is must be an integer\n      if (!isNumber(k) || !isInteger(k)) {\n        throw new TypeError('The parameter k must be an integer number');\n      }\n    } else {\n      // default value\n      k = 0;\n    }\n\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    if (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 (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 (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,\n      index,\n      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 (!isNumber(i) || !isInteger(i) || !isNumber(j) || !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    validateIndex(i, this._size[0]);\n    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\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});", "import { factory } from '../utils/factory.js';\nimport { deepMap } from '../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,\n      radix,\n      integerPart,\n      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 not a valid number');\n  }\n  return result;\n}\nexport var createNumber = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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, bigint, boolean, numeric, 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 not a 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 > 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 >= 2 ** (size - 1)) {\n          num = num - 2 ** size;\n        }\n      }\n      return num;\n    },\n    BigNumber: function BigNumber(x) {\n      return x.toNumber();\n    },\n    bigint: function bigint(x) {\n      return Number(x);\n    },\n    Fraction: function Fraction(x) {\n      return x.valueOf();\n    },\n    Unit: typed.referToSelf(self => x => {\n      var clone = x.clone();\n      clone.value = self(x.value);\n      return clone;\n    }),\n    null: function _null(x) {\n      return 0;\n    },\n    'Unit, string | Unit': function Unit_string__Unit(unit, valuelessUnit) {\n      return unit.toNumber(valuelessUnit);\n    },\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\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});", "import { factory } from '../utils/factory.js';\nimport { deepMap } from '../utils/collection.js';\nvar name = 'bigint';\nvar dependencies = ['typed'];\nexport var createBigint = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Create a bigint or convert a string, boolean, or unit to a bigint.\n   * When value is a matrix, all elements will be converted to bigint.\n   *\n   * Syntax:\n   *\n   *    math.bigint(value)\n   *\n   * Examples:\n   *\n   *    math.bigint(2)                         // returns 2n\n   *    math.bigint('123')                     // returns 123n\n   *    math.bigint(true)                      // returns 1n\n   *    math.bigint([true, false, true, true]) // returns [1n, 0n, 1n, 1n]\n   *\n   * See also:\n   *\n   *    number, bignumber, boolean, complex, index, matrix, string, unit\n   *\n   * History:\n   *\n   *    v13      Created\n   *    v14.2.1  Added conversion options\n   *\n   * @param {string | number | BigNumber | bigint | Fraction | boolean | Array | Matrix | null} [value]  Value to be converted\n   * @return {bigint | Array | Matrix} The created bigint\n   */\n  var bigint = typed('bigint', {\n    '': function _() {\n      return 0n;\n    },\n    bigint: function bigint(x) {\n      return x;\n    },\n    number: function number(x) {\n      return BigInt(x.toFixed());\n    },\n    BigNumber: function BigNumber(x) {\n      return BigInt(x.round().toString());\n    },\n    Fraction: function Fraction(x) {\n      return BigInt(x.valueOf().toFixed());\n    },\n    'string | boolean': function string__boolean(x) {\n      return BigInt(x);\n    },\n    null: function _null(x) {\n      return 0n;\n    },\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n\n  // reviver function to parse a JSON object like:\n  //\n  //     {\"mathjs\":\"bigint\",\"value\":\"123\"}\n  //\n  // into a bigint 123n\n  bigint.fromJSON = function (json) {\n    return BigInt(json.value);\n  };\n  return bigint;\n});", "import { factory } from '../utils/factory.js';\nimport { deepMap } from '../utils/collection.js';\nimport { format } from '../utils/number.js';\nvar name = 'string';\nvar dependencies = ['typed'];\nexport var createString = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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   * History:\n   *\n   *    v0.9  Created\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: 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(self => x => deepMap(x, self)),\n    any: function any(x) {\n      return String(x);\n    }\n  });\n});", "import { factory } from '../utils/factory.js';\nimport { deepMap } from '../utils/collection.js';\nvar name = 'boolean';\nvar dependencies = ['typed'];\nexport var createBoolean = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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   * History:\n   *\n   *    v0.11    Created\n   *    v0.16    Added conversion from BigNumber\n   *    v14.2.1  Added conversion from bigint\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(self => x => deepMap(x, self))\n  });\n});", "import { factory } from '../../../utils/factory.js';\nimport { deepMap } from '../../../utils/collection.js';\nvar name = 'bignumber';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createBignumber = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    BigNumber\n  } = _ref;\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   *    number, bigint, boolean, complex, index, matrix, string, unit\n   *\n   * @param {number | string | Fraction | BigNumber | bigint | 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    bigint: function bigint(x) {\n      return new BigNumber(x.toString());\n    },\n    Unit: typed.referToSelf(self => x => {\n      var clone = x.clone();\n      clone.value = self(x.value);\n      return clone;\n    }),\n    Fraction: function Fraction(x) {\n      return new BigNumber(String(x.n)).div(String(x.d)).times(String(x.s));\n    },\n    null: function _null(_x) {\n      return new BigNumber(0);\n    },\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});", "import { factory } from '../../../utils/factory.js';\nimport { deepMap } from '../../../utils/collection.js';\nvar name = 'complex';\nvar dependencies = ['typed', 'Complex'];\nexport var createComplex = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    Complex\n  } = _ref;\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   * History:\n   *\n   *    v0.5   Created\n   *    v0.16  Added conversion from BigNumber\n   *    v6     Added conversion from Fraction\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 number_number(re, im) {\n      return new Complex(re, im);\n    },\n    // TODO: this signature should be redundant\n    'BigNumber, BigNumber': function BigNumber_BigNumber(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    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(self => x => deepMap(x, self))\n  });\n});", "import { factory } from '../../../utils/factory.js';\nimport { deepMap } from '../../../utils/collection.js';\nvar name = 'fraction';\nvar dependencies = ['typed', 'Fraction'];\nexport var createFraction = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    Fraction\n  } = _ref;\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   * History:\n   *\n   *    v2     Created\n   *    v3     Added conversion from BigNumber\n   *    v11.8  Added conversion from Unit\n   *    v13    Added conversion from bigint\n   *    v14    Move to bigint-based fraction.js@5; construct from two bigints\n   *\n   * @param {number | string | Fraction | BigNumber | bigint | Unit | 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 (!Number.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 number_number(numerator, denominator) {\n      return new Fraction(numerator, denominator);\n    },\n    'bigint, bigint': function bigint_bigint(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    bigint: function bigint(x) {\n      return new Fraction(x.toString());\n    },\n    Fraction: function Fraction(x) {\n      return x; // fractions are immutable\n    },\n    Unit: typed.referToSelf(self => x => {\n      var clone = x.clone();\n      clone.value = self(x.value);\n      return clone;\n    }),\n    Object: function Object(x) {\n      return new Fraction(x);\n    },\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});", "import { factory } from '../../../utils/factory.js';\nvar name = 'matrix';\nvar dependencies = ['typed', 'Matrix', 'DenseMatrix', 'SparseMatrix'];\nexport var createMatrix = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    Matrix,\n    DenseMatrix,\n    SparseMatrix\n  } = _ref;\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   * History:\n   *\n   *    v0.5  Created\n   *    v1.5  Support dense or sparse Matrix types; allow construction\n   *          from string, Array, or another Matrix.\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 string_string(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});", "import { factory } from '../../utils/factory.js';\nvar name = 'matrixFromFunction';\nvar dependencies = ['typed', 'matrix', 'isZero'];\nexport var createMatrixFromFunction = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    isZero\n  } = _ref;\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`\n   * is an array.\n   * Passing `size` as a Matrix or specifying a `format` will result in\n   * 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   * Where:\n   *\n   *    - `size: (number[] | Matrix)`\n   *      A vector giving the extent of the array to be created in each\n   *      dimension. If size has one entry, a vector is created; if it\n   *      has two, a rectangular array/Matrix is created; if three, a\n   *      three-dimensional array/Matrix is created; and so on.\n   *    - `fn: (index: number[]) => MathType`\n   *      The callback function that will generate the entries of the\n   *      matrix. It is called in turn with the index of each entry of\n   *      the matrix. The index is always an ordinary array of numbers\n   *      with the same length as _size_. So for vectors, you will get\n   *      indices like `[0]` or `[1]`, whereas for matrices, you will\n   *      get indices like `[2, 0]` or `[1,3]`. The return value may\n   *      be any type that can go in an array or Matrix entry, although\n   *      if you supply the _datatype_ argument, you must yourself ensure\n   *      the type of the return value matches. Note that currently,\n   *      your callback _fn_ will receive 0-based indices for the matrix\n   *      entries, regardless of whether matrixFromFunction is invoked\n   *      directly from JavaScript or via the mathjs expression language.\n   *    - `format: 'dense'|'sparse'`\n   *      Specifies the storage format for the resulting Matrix. Note that\n   *      if this argument is given, the return value will always be a\n   *      Matrix (rather than possibly an Array).\n   *    - `datatype: string`\n   *      Specifies the data type of entries of the new matrix. If given,\n   *      it should be the name of a data type that mathjs supports, as\n   *      returned by the math.typeOf function. It is up to the caller\n   *      to make certain that all values returned by _fn_ are consistent\n   *      with this datatype if specified.\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, typeOf, 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 Array__Matrix_function_string_string(size, fn, format, datatype) {\n      return _create(size, fn, format, datatype);\n    },\n    'Array | Matrix, function, string': function Array__Matrix_function_string(size, fn, format) {\n      return _create(size, fn, format);\n    },\n    'Matrix, function': function Matrix_function(size, fn) {\n      return _create(size, fn, 'dense');\n    },\n    'Array, function': function Array_function(size, fn) {\n      return _create(size, fn, 'dense').toArray();\n    },\n    'Array | Matrix, string, function': function Array__Matrix_string_function(size, format, fn) {\n      return _create(size, fn, format);\n    },\n    'Array | Matrix, string, string, function': function Array__Matrix_string_string_function(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});", "import { factory } from '../../utils/factory.js';\nvar name = 'matrixFromRows';\nvar dependencies = ['typed', 'matrix', 'flatten', 'size'];\nexport var createMatrixFromRows = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    flatten,\n    size\n  } = _ref;\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(m => m.toArray())));\n    }\n\n    // TODO implement this properly for SparseMatrix\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    for (var row of arr) {\n      var rowLength = checkVectorTypeAndReturnLength(row);\n      if (rowLength !== N) {\n        throw new TypeError('The vectors had different length: ' + (N | 0) + ' \u2260 ' + (rowLength | 0));\n      }\n      result.push(flatten(row));\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});", "import { factory } from '../../utils/factory.js';\nvar name = 'matrixFromColumns';\nvar dependencies = ['typed', 'matrix', 'flatten', 'size'];\nexport var createMatrixFromColumns = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    flatten,\n    size\n  } = _ref;\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(m => m.toArray())));\n    }\n\n    // TODO implement this properly for SparseMatrix\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    for (var col of arr) {\n      var colLength = checkVectorTypeAndReturnLength(col);\n      if (colLength !== N) {\n        throw new TypeError('The vectors had different length: ' + (N | 0) + ' \u2260 ' + (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    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});", "import { factory } from '../../../utils/factory.js';\nvar name = 'splitUnit';\nvar dependencies = ['typed'];\nexport var createSplitUnit = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Split a unit in an array of units whose sum is equal to the original unit.\n   *\n   * Syntax:\n   *\n   *     math.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 Unit_Array(unit, parts) {\n      return unit.splitUnit(parts);\n    }\n  });\n});", "import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { unaryMinusNumber } from '../../plain/number/index.js';\nvar name = 'unaryMinus';\nvar dependencies = ['typed'];\nexport var createUnaryMinus = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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 | bigint | Fraction | Complex | Unit | Array | Matrix} x Number to be inverted.\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} Returns the value with inverted sign.\n   */\n  return typed(name, {\n    number: unaryMinusNumber,\n    'Complex | BigNumber | Fraction': x => x.neg(),\n    bigint: x => -x,\n    Unit: typed.referToSelf(self => x => {\n      var res = x.clone();\n      res.value = typed.find(self, res.valueType())(x.value);\n      return res;\n    }),\n    // deep map collection, skip zeros since unaryMinus(0) = 0\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self, true))\n\n    // TODO: add support for string\n  });\n});", "import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { unaryPlusNumber } from '../../plain/number/index.js';\nimport { safeNumberType } from '../../utils/number.js';\nvar name = 'unaryPlus';\nvar dependencies = ['typed', 'config', 'numeric'];\nexport var createUnaryPlus = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    numeric\n  } = _ref;\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 | bigint | Fraction | string | Complex | Unit | Array | Matrix} x\n   *            Input value\n   * @return {number | BigNumber | bigint | 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: unaryPlusNumber,\n    Complex: function Complex(x) {\n      return x; // complex numbers are immutable\n    },\n    BigNumber: function BigNumber(x) {\n      return x; // bignumbers are immutable\n    },\n    bigint: function bigint(x) {\n      return x;\n    },\n    Fraction: function Fraction(x) {\n      return x; // fractions are immutable\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(self => x => deepMap(x, self, true)),\n    boolean: function boolean(x) {\n      return numeric(x ? 1 : 0, config.number);\n    },\n    string: function string(x) {\n      return numeric(x, safeNumberType(x, config));\n    }\n  });\n});", "import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { absNumber } from '../../plain/number/index.js';\nvar name = 'abs';\nvar dependencies = ['typed'];\nexport var createAbs = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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 | bigint | Fraction | Complex | Array | Matrix | Unit} x\n   *            A number or matrix for which to get the absolute value\n   * @return {number | BigNumber | bigint | Fraction | Complex | Array | Matrix | Unit}\n   *            Absolute value of `x`\n   */\n  return typed(name, {\n    number: absNumber,\n    'Complex | BigNumber | Fraction | Unit': x => x.abs(),\n    bigint: x => x < 0n ? -x : x,\n    // deep map collection, skip zeros since abs(0) = 0\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self, true))\n  });\n});", "import { factory } from '../../utils/factory.js';\nimport { arraySize } from '../../utils/array.js';\nimport { isMatrix } from '../../utils/is.js';\nimport { IndexError } from '../../error/IndexError.js';\nvar name = 'mapSlices';\nvar dependencies = ['typed', 'isInteger'];\nexport var createMapSlices = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    isInteger\n  } = _ref;\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.mapSlices(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.mapSlices(A, 0, sum)             // returns [4, 6]\n   *    math.mapSlices(A, 1, sum)             // returns [3, 7]\n   *\n   * See also:\n   *\n   *    map, filter, forEach\n   *\n   * Note:\n   *\n   *    `mapSlices()` is also currently available via its deprecated\n   *    synonym `apply()`.\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 mapped on the slices over some dimension.\n   */\n  return typed(name, {\n    'Array | Matrix, number | BigNumber, function': function Array__Matrix_number__BigNumber_function(mat, dim, callback) {\n      if (!isInteger(dim)) {\n        throw new TypeError('Integer number expected for dimension');\n      }\n      var size = Array.isArray(mat) ? arraySize(mat) : mat.size();\n      if (dim < 0 || dim >= size.length) {\n        throw new IndexError(dim, size.length);\n      }\n      if (isMatrix(mat)) {\n        return mat.create(_mapSlices(mat.valueOf(), dim, callback), mat.datatype());\n      } else {\n        return _mapSlices(mat, dim, callback);\n      }\n    }\n  });\n}, {\n  formerly: 'apply'\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 _mapSlices(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] = _mapSlices(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] = _mapSlices(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}", "import { factory } from '../../utils/factory.js';\nimport { addNumber } from '../../plain/number/index.js';\nvar name = 'addScalar';\nvar dependencies = ['typed'];\nexport var createAddScalar = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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 | bigint | Fraction | Complex | Unit} x   First value to add\n   * @param  {number | BigNumber | bigint | Fraction | Complex} y          Second value to add\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit}     Sum of `x` and `y`\n   * @private\n   */\n  return typed(name, {\n    'number, number': addNumber,\n    'Complex, Complex': function Complex_Complex(x, y) {\n      return x.add(y);\n    },\n    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {\n      return x.plus(y);\n    },\n    'bigint, bigint': function bigint_bigint(x, y) {\n      return x + y;\n    },\n    'Fraction, Fraction': function Fraction_Fraction(x, y) {\n      return x.add(y);\n    },\n    'Unit, Unit': typed.referToSelf(self => (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});", "import { factory } from '../../utils/factory.js';\nimport { subtractNumber } from '../../plain/number/index.js';\nvar name = 'subtractScalar';\nvar dependencies = ['typed'];\nexport var createSubtractScalar = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Subtract two scalar values, `x - y`.\n   * This function is meant for internal use: it is used by the public function\n   * `subtract`\n   *\n   * This function does not support collections (Array or Matrix).\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit} x   First value\n   * @param  {number | BigNumber | bigint | Fraction | Complex} y          Second value to be subtracted from `x`\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit}     Difference of `x` and `y`\n   * @private\n   */\n  return typed(name, {\n    'number, number': subtractNumber,\n    'Complex, Complex': function Complex_Complex(x, y) {\n      return x.sub(y);\n    },\n    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {\n      return x.minus(y);\n    },\n    'bigint, bigint': function bigint_bigint(x, y) {\n      return x - y;\n    },\n    'Fraction, Fraction': function Fraction_Fraction(x, y) {\n      return x.sub(y);\n    },\n    'Unit, Unit': typed.referToSelf(self => (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});", "import { factory } from '../../utils/factory.js';\nimport { isBigNumber, isComplex, isFraction } from '../../utils/is.js';\nimport { cbrtNumber } from '../../plain/number/index.js';\nvar name = 'cbrt';\nvar dependencies = ['config', 'typed', 'isNegative', 'unaryMinus', 'matrix', 'Complex', 'BigNumber', 'Fraction'];\nexport var createCbrt = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    config,\n    typed,\n    isNegative,\n    unaryMinus,\n    matrix,\n    Complex,\n    BigNumber,\n    Fraction\n  } = _ref;\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 1.7320508075689 + i ...\n   *    math.cbrt(x, true)\n   *    // Complex Matrix [\"1.7320508075689+i\", \"-1.7320508075689+i\", \"-2i\"]\n   *\n   * See also:\n   *\n   *    square, sqrt, cube\n   *\n   * History:\n   *\n   *    v2.3  Created\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: 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(cbrtNumber(abs), 0).mul(new Complex(0, arg3).exp());\n    if (allRoots) {\n      var all = [principal, new Complex(cbrtNumber(abs), 0).mul(new Complex(0, arg3 + Math.PI * 2 / 3).exp()), new Complex(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 && 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 (isBigNumber(x.value)) {\n        third = new BigNumber(1).div(3);\n      } else if (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});", "import { factory } from '../../../utils/factory.js';\nvar name = 'matAlgo11xS0s';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createMatAlgo11xS0s = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\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   *          \u250C  f(Sij, b)  ; S(i,j) !== 0\n   * C(i,j) = \u2524\n   *          \u2514  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});", "import { factory } from '../../../utils/factory.js';\nvar name = 'matAlgo12xSfs';\nvar dependencies = ['typed', 'DenseMatrix'];\nexport var createMatAlgo12xSfs = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    DenseMatrix\n  } = _ref;\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   *          \u250C  f(Sij, b)  ; S(i,j) !== 0\n   * C(i,j) = \u2524\n   *          \u2514  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});", "import { factory } from '../../../utils/factory.js';\nimport { clone } from '../../../utils/object.js';\nvar name = 'matAlgo14xDs';\nvar dependencies = ['typed'];\nexport var createMatAlgo14xDs = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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: 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});", "import Decimal from 'decimal.js';\nimport { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { isInteger, nearlyEqual } from '../../utils/number.js';\nimport { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';\nvar name = 'ceil';\nvar dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];\nvar bigTen = new Decimal(10);\nexport var createCeilNumber = /* #__PURE__ */factory(name, ['typed', 'config', 'round'], _ref => {\n  var {\n    typed,\n    config,\n    round\n  } = _ref;\n  function _ceilNumber(x) {\n    // See ./floor.js _floorNumber for rationale here\n    var c = Math.ceil(x);\n    var r = round(x);\n    if (c === r) return c;\n    if (nearlyEqual(x, r, config.relTol, config.absTol) && !nearlyEqual(x, c, config.relTol, config.absTol)) {\n      return r;\n    }\n    return c;\n  }\n  return typed(name, {\n    number: _ceilNumber,\n    'number, number': function number_number(x, n) {\n      if (!isInteger(n)) {\n        throw new RangeError('number of decimals in function ceil must be an integer');\n      }\n      if (n < 0 || n > 15) {\n        throw new RangeError('number of decimals in ceil number must be in range 0-15');\n      }\n      var shift = 10 ** n;\n      return _ceilNumber(x * shift) / shift;\n    }\n  });\n});\nexport var createCeil = /* #__PURE__ */factory(name, dependencies, _ref2 => {\n  var {\n    typed,\n    config,\n    round,\n    matrix,\n    equalScalar,\n    zeros,\n    DenseMatrix\n  } = _ref2;\n  var matAlgo11xS0s = createMatAlgo11xS0s({\n    typed,\n    equalScalar\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matAlgo14xDs = createMatAlgo14xDs({\n    typed\n  });\n  var ceilNumber = createCeilNumber({\n    typed,\n    config,\n    round\n  });\n  function _bigCeil(x) {\n    // see ./floor.js _floorNumber for rationale\n    var bne = (a, b) => bigNearlyEqual(a, b, config.relTol, config.absTol);\n    var c = x.ceil();\n    var r = round(x);\n    if (c.eq(r)) return c;\n    if (bne(x, r) && !bne(x, c)) return r;\n    return c;\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   *    math.ceil(unit, valuelessUnit)\n   *    math.ceil(unit, n, valuelessUnit)\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   *    const unit = math.unit('3.241 cm')\n   *    const cm = math.unit('cm')\n   *    const mm = math.unit('mm')\n   *    math.ceil(unit, 1, cm)      // returns Unit 3.3 cm ...\n   *    math.ceil(unit, 1, mm)      // returns Unit 32.5 mm\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   * History:\n   *\n   *     v14    Handle Units\n   *     v7.4   Allow second \"precision\" argument\n   *     v5.7   Support tolerance for round-off errors\n   *     v2     Handle Fractions\n   *     v0.1   Created\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x  Value to be rounded\n   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals\n   * @param  {Unit} [valuelessUnit]                                        A valueless unit\n   * @return {number | BigNumber | Fraction | Complex | Unit | 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 Complex_number(x, n) {\n      return x.ceil(n);\n    },\n    'Complex, BigNumber': function Complex_BigNumber(x, n) {\n      return x.ceil(n.toNumber());\n    },\n    BigNumber: _bigCeil,\n    'BigNumber, BigNumber': function BigNumber_BigNumber(x, n) {\n      var shift = bigTen.pow(n);\n      return _bigCeil(x.mul(shift)).div(shift);\n    },\n    bigint: b => b,\n    'bigint, number': (b, _dummy) => b,\n    'bigint, BigNumber': (b, _dummy) => b,\n    Fraction: function Fraction(x) {\n      return x.ceil();\n    },\n    'Fraction, number': function Fraction_number(x, n) {\n      return x.ceil(n);\n    },\n    'Fraction, BigNumber': function Fraction_BigNumber(x, n) {\n      return x.ceil(n.toNumber());\n    },\n    'Unit, number, Unit': typed.referToSelf(self => function (x, n, unit) {\n      var valueless = x.toNumeric(unit);\n      return unit.multiply(self(valueless, n));\n    }),\n    'Unit, BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => self(x, n.toNumber(), unit)),\n    'Array | Matrix, number | BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => {\n      // deep map collection, skip zeros since ceil(0) = 0\n      return deepMap(x, value => self(value, n, unit), true);\n    }),\n    'Array | Matrix | Unit, Unit': typed.referToSelf(self => (x, unit) => self(x, 0, unit)),\n    'Array | Matrix': typed.referToSelf(self => x => {\n      // deep map collection, skip zeros since ceil(0) = 0\n      return deepMap(x, self, true);\n    }),\n    'Array, number | BigNumber': typed.referToSelf(self => (x, n) => {\n      // deep map collection, skip zeros since ceil(0) = 0\n      return deepMap(x, i => self(i, n), true);\n    }),\n    'SparseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {\n      return matAlgo11xS0s(x, y, self, false);\n    }),\n    'DenseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {\n      return matAlgo14xDs(x, y, self, false);\n    }),\n    'number | Complex | Fraction | BigNumber, Array': typed.referToSelf(self => (x, y) => {\n      // use matrix implementation\n      return matAlgo14xDs(matrix(y), x, self, true).valueOf();\n    }),\n    'number | Complex | Fraction | BigNumber, Matrix': typed.referToSelf(self => (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});", "import { factory } from '../../utils/factory.js';\nimport { cubeNumber } from '../../plain/number/index.js';\nvar name = 'cube';\nvar dependencies = ['typed'];\nexport var createCube = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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 | bigint | Fraction | Complex | Unit} x  Number for which to calculate the cube\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit} Cube of x\n   */\n  return typed(name, {\n    number: cubeNumber,\n    Complex: function Complex(x) {\n      return x.mul(x).mul(x); // Is faster than pow(x, 3)\n    },\n    BigNumber: function BigNumber(x) {\n      return x.times(x).times(x);\n    },\n    bigint: function bigint(x) {\n      return x * x * x;\n    },\n    Fraction: function Fraction(x) {\n      return x.pow(3); // Is faster than mul()mul()mul()\n    },\n    Unit: function Unit(x) {\n      return x.pow(3);\n    }\n  });\n});", "import { factory } from '../../utils/factory.js';\nimport { expNumber } from '../../plain/number/index.js';\nvar name = 'exp';\nvar dependencies = ['typed'];\nexport var createExp = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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 [2.718281828459045, 7.3890560989306495, 20.085536923187668]\n   *\n   * See also:\n   *\n   *    expm1, expm, log, pow\n   *\n   * History:\n   *\n   *    v11     Don't apply elementwise, avoid confusion with matrix exponential\n   *    v0.20   Handle BigNumbers\n   *    v0.0.2  Created\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: expNumber,\n    Complex: function Complex(x) {\n      return x.exp();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.exp();\n    }\n  });\n});", "import { factory } from '../../utils/factory.js';\nimport { expm1Number } from '../../plain/number/index.js';\nvar name = 'expm1';\nvar dependencies = ['typed', 'Complex'];\nexport var createExpm1 = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    Complex: _Complex\n  } = _ref;\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 [1.718281828459045, 6.3890560989306495, 19.085536923187668]\n   *\n   * See also:\n   *\n   *    exp, expm, log, pow\n   *\n   * History:\n   *\n   *    v11    Don't apply elementwise, avoids confusion with matrix exponential\n   *    v4.2   Created\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: 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});", "import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';\nvar name = 'fix';\nvar dependencies = ['typed', 'Complex', 'matrix', 'ceil', 'floor', 'equalScalar', 'zeros', 'DenseMatrix'];\nexport var createFixNumber = /* #__PURE__ */factory(name, ['typed', 'ceil', 'floor'], _ref => {\n  var {\n    typed,\n    ceil,\n    floor\n  } = _ref;\n  return typed(name, {\n    number: function number(x) {\n      return x > 0 ? floor(x) : ceil(x);\n    },\n    'number, number': function number_number(x, n) {\n      return x > 0 ? floor(x, n) : ceil(x, n);\n    }\n  });\n});\nexport var createFix = /* #__PURE__ */factory(name, dependencies, _ref2 => {\n  var {\n    typed,\n    Complex: _Complex,\n    matrix,\n    ceil,\n    floor,\n    equalScalar,\n    zeros,\n    DenseMatrix\n  } = _ref2;\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matAlgo14xDs = createMatAlgo14xDs({\n    typed\n  });\n  var fixNumber = createFixNumber({\n    typed,\n    ceil,\n    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   *    math.fix(unit, valuelessUnit)\n   *    math.fix(unit, n, valuelessUnit)\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   *    const unit = math.unit('3.241 cm')\n   *    const cm = math.unit('cm')\n   *    const mm = math.unit('mm')\n   *    math.fix(unit, 1, cm)      // returns Unit 3.2 cm ...\n   *    math.fix(unit, 1, mm)      // returns Unit 32.4 mm\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   * History:\n   *\n   *     v14    Handle Units\n   *     v7.4   Allow second \"precision\" argument\n   *     v5.7   Support tolerance for round-off errors\n   *     v2     Handle Fractions\n   *     v0.1   Created\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x  Value to be rounded\n   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals\n   * @param  {Unit} [valuelessUnit]                                        A valueless unit\n   * @return {number | BigNumber | Fraction | Complex | Unit | 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 Complex_number(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 Complex_BigNumber(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 BigNumber_number__BigNumber(x, n) {\n      return x.isNegative() ? ceil(x, n) : floor(x, n);\n    },\n    bigint: b => b,\n    'bigint, number': (b, _dummy) => b,\n    'bigint, BigNumber': (b, _dummy) => b,\n    Fraction: function Fraction(x) {\n      return x.s < 0n ? x.ceil() : x.floor();\n    },\n    'Fraction, number | BigNumber': function Fraction_number__BigNumber(x, n) {\n      return x.s < 0n ? ceil(x, n) : floor(x, n);\n    },\n    'Unit, number, Unit': typed.referToSelf(self => function (x, n, unit) {\n      var valueless = x.toNumeric(unit);\n      return unit.multiply(self(valueless, n));\n    }),\n    'Unit, BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => self(x, n.toNumber(), unit)),\n    'Array | Matrix, number | BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => {\n      // deep map collection, skip zeros since fix(0) = 0\n      return deepMap(x, value => self(value, n, unit), true);\n    }),\n    'Array | Matrix | Unit, Unit': typed.referToSelf(self => (x, unit) => self(x, 0, unit)),\n    'Array | Matrix': typed.referToSelf(self => x => {\n      // deep map collection, skip zeros since fix(0) = 0\n      return deepMap(x, self, true);\n    }),\n    'Array | Matrix, number | BigNumber': typed.referToSelf(self => (x, n) => {\n      // deep map collection, skip zeros since fix(0) = 0\n      return deepMap(x, i => self(i, n), true);\n    }),\n    'number | Complex | Fraction | BigNumber, Array': typed.referToSelf(self => (x, y) => {\n      // use matrix implementation\n      return matAlgo14xDs(matrix(y), x, self, true).valueOf();\n    }),\n    'number | Complex | Fraction | BigNumber, Matrix': typed.referToSelf(self => (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});", "import Decimal from 'decimal.js';\nimport { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { isInteger, nearlyEqual } from '../../utils/number.js';\nimport { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';\nvar name = 'floor';\nvar dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];\nvar bigTen = new Decimal(10);\nexport var createFloorNumber = /* #__PURE__ */factory(name, ['typed', 'config', 'round'], _ref => {\n  var {\n    typed,\n    config,\n    round\n  } = _ref;\n  function _floorNumber(x) {\n    // First, if the floor and the round are identical we can be\n    // quite comfortable that is the best answer:\n    var f = Math.floor(x);\n    var r = round(x);\n    if (f === r) return f;\n    // OK, they are different. If x is truly distinct from f but\n    // appears indistinguishable from r, presume it really is just\n    // the integer r with rounding/computation error, and return that\n    if (nearlyEqual(x, r, config.relTol, config.absTol) && !nearlyEqual(x, f, config.relTol, config.absTol)) {\n      return r;\n    }\n    // Otherwise (x distinct from both r and f, or indistinguishable from\n    // both r and f) may as well just return f, as that's the best\n    // candidate we can discern:\n    return f;\n  }\n  return typed(name, {\n    number: _floorNumber,\n    'number, number': function number_number(x, n) {\n      if (!isInteger(n)) {\n        throw new RangeError('number of decimals in function floor must be an integer');\n      }\n      if (n < 0 || n > 15) {\n        throw new RangeError('number of decimals in floor number must be in range 0 - 15');\n      }\n      var shift = 10 ** n;\n      return _floorNumber(x * shift) / shift;\n    }\n  });\n});\nexport var createFloor = /* #__PURE__ */factory(name, dependencies, _ref2 => {\n  var {\n    typed,\n    config,\n    round,\n    matrix,\n    equalScalar,\n    zeros,\n    DenseMatrix\n  } = _ref2;\n  var matAlgo11xS0s = createMatAlgo11xS0s({\n    typed,\n    equalScalar\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matAlgo14xDs = createMatAlgo14xDs({\n    typed\n  });\n  var floorNumber = createFloorNumber({\n    typed,\n    config,\n    round\n  });\n  function _bigFloor(x) {\n    // see _floorNumber above for rationale\n    var bne = (a, b) => bigNearlyEqual(a, b, config.relTol, config.absTol);\n    var f = x.floor();\n    var r = round(x);\n    if (f.eq(r)) return f;\n    if (bne(x, r) && !bne(x, f)) return r;\n    return f;\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   *    math.floor(unit, valuelessUnit)\n   *    math.floor(unit, n, valuelessUnit)\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   *    const unit = math.unit('3.241 cm')\n   *    const cm = math.unit('cm')\n   *    const mm = math.unit('mm')\n   *    math.floor(unit, 1, cm)      // returns Unit 3.2 cm ...\n   *    math.floor(unit, 1, mm)      // returns Unit 32.4 mm\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   * History:\n   *\n   *     v14    Handle Units\n   *     v7.4   Allow second \"precision\" argument\n   *     v5.7   Support tolerance for round-off errors\n   *     v2     Handle Fractions\n   *     v0.1   Created\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x  Value to be rounded\n   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals\n   * @param  {Unit} [valuelessUnit]                                        A valueless unit\n   * @return {number | BigNumber | Fraction | Complex | Unit | 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 Complex_number(x, n) {\n      return x.floor(n);\n    },\n    'Complex, BigNumber': function Complex_BigNumber(x, n) {\n      return x.floor(n.toNumber());\n    },\n    BigNumber: _bigFloor,\n    'BigNumber, BigNumber': function BigNumber_BigNumber(x, n) {\n      var shift = bigTen.pow(n);\n      return _bigFloor(x.mul(shift)).div(shift);\n    },\n    bigint: b => b,\n    'bigint, number': (b, _dummy) => b,\n    'bigint, BigNumber': (b, _dummy) => b,\n    Fraction: function Fraction(x) {\n      return x.floor();\n    },\n    'Fraction, number': function Fraction_number(x, n) {\n      return x.floor(n);\n    },\n    'Fraction, BigNumber': function Fraction_BigNumber(x, n) {\n      return x.floor(n.toNumber());\n    },\n    'Unit, number, Unit': typed.referToSelf(self => function (x, n, unit) {\n      var valueless = x.toNumeric(unit);\n      return unit.multiply(self(valueless, n));\n    }),\n    'Unit, BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => self(x, n.toNumber(), unit)),\n    'Array | Matrix, number | BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => {\n      // deep map collection, skip zeros since floor(0) = 0\n      return deepMap(x, value => self(value, n, unit), true);\n    }),\n    'Array | Matrix | Unit, Unit': typed.referToSelf(self => (x, unit) => self(x, 0, unit)),\n    'Array | Matrix': typed.referToSelf(self => x => {\n      // deep map collection, skip zeros since floor(0) = 0\n      return deepMap(x, self, true);\n    }),\n    'Array, number | BigNumber': typed.referToSelf(self => (x, n) => {\n      // deep map collection, skip zeros since ceil(0) = 0\n      return deepMap(x, i => self(i, n), true);\n    }),\n    'SparseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {\n      return matAlgo11xS0s(x, y, self, false);\n    }),\n    'DenseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {\n      return matAlgo14xDs(x, y, self, false);\n    }),\n    'number | Complex | Fraction | BigNumber, Array': typed.referToSelf(self => (x, y) => {\n      // use matrix implementation\n      return matAlgo14xDs(matrix(y), x, self, true).valueOf();\n    }),\n    'number | Complex | Fraction | BigNumber, Matrix': typed.referToSelf(self => (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});", "import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'matAlgo02xDS0';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createMatAlgo02xDS0 = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\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   *          \u250C  f(Dij, Sij)  ; S(i,j) !== 0\n   * C(i,j) = \u2524\n   *          \u2514  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 || denseMatrix.getDataType();\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 || sparseMatrix._data === undefined ? sparseMatrix._datatype : sparseMatrix.getDataType();\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new 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 && adt !== 'mixed') {\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: adt === denseMatrix._datatype && bdt === sparseMatrix._datatype ? dt : undefined\n    });\n  };\n});", "import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'matAlgo03xDSf';\nvar dependencies = ['typed'];\nexport var createMatAlgo03xDSf = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Iterates over SparseMatrix items and invokes the callback function f(Dij, Sij).\n   * Callback function invoked M*N times.\n   *\n   *\n   *          \u250C  f(Dij, Sij)  ; S(i,j) !== 0\n   * C(i,j) = \u2524\n   *          \u2514  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 || denseMatrix.getDataType();\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 || sparseMatrix._data === undefined ? sparseMatrix._datatype : sparseMatrix.getDataType();\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new 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 && adt !== 'mixed') {\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: adt === denseMatrix._datatype && bdt === sparseMatrix._datatype ? dt : undefined\n    });\n  };\n});", "import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'matAlgo05xSfSf';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createMatAlgo05xSfSf = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\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   *          \u250C  f(Aij, Bij)  ; A(i,j) !== 0 || B(i,j) !== 0\n   * C(i,j) = \u2524\n   *          \u2514  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 || a._data === undefined ? a._datatype : a.getDataType();\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 || b._data === undefined ? b._datatype : b.getDataType();\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new 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 && adt !== 'mixed') {\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: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\n  };\n});", "import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'matAlgo13xDD';\nvar dependencies = ['typed'];\nexport var createMatAlgo13xDD = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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(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});", "import { broadcastSizes, broadcastTo } from '../../../utils/array.js';\nimport { deepStrictEqual } from '../../../utils/object.js';\n\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\nexport function broadcast(A, B) {\n  if (deepStrictEqual(A.size(), B.size())) {\n    // If matrices have the same size return them\n    return [A, B];\n  }\n\n  // calculate the broadcasted sizes\n  var newSize = broadcastSizes(A.size(), B.size());\n\n  // return the array with the two broadcasted matrices\n  return [A, B].map(M => _broadcastTo(M, newSize));\n}\n\n/**\n * Broadcasts a matrix to the given size.\n *\n * @param {Matrix} M - The matrix to be broadcasted.\n * @param {number[]} size - The desired size of the broadcasted matrix.\n * @returns {Matrix} The broadcasted matrix.\n * @throws {Error} If the size parameter is not an array of numbers.\n */\nfunction _broadcastTo(M, size) {\n  if (deepStrictEqual(M.size(), size)) {\n    return M;\n  }\n  return M.create(broadcastTo(M.valueOf(), size), M.datatype());\n}", "import { factory } from '../../../utils/factory.js';\nimport { extend } from '../../../utils/object.js';\nimport { createMatAlgo13xDD } from './matAlgo13xDD.js';\nimport { createMatAlgo14xDs } from './matAlgo14xDs.js';\nimport { broadcast } from './broadcast.js';\nvar name = 'matrixAlgorithmSuite';\nvar dependencies = ['typed', 'matrix'];\nexport var createMatrixAlgorithmSuite = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix\n  } = _ref;\n  var matAlgo13xDD = createMatAlgo13xDD({\n    typed\n  });\n  var matAlgo14xDs = createMatAlgo14xDs({\n    typed\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': (x, y) => matAlgo13xDD(...broadcast(x, y), elop),\n        'Array, Array': (x, y) => matAlgo13xDD(...broadcast(matrix(x), matrix(y)), elop).valueOf(),\n        'Array, DenseMatrix': (x, y) => matAlgo13xDD(...broadcast(matrix(x), y), elop),\n        'DenseMatrix, Array': (x, y) => matAlgo13xDD(...broadcast(x, matrix(y)), elop)\n      };\n      // Now incorporate sparse matrices\n      if (options.SS) {\n        matrixSignatures['SparseMatrix, SparseMatrix'] = (x, y) => options.SS(...broadcast(x, y), elop, false);\n      }\n      if (options.DS) {\n        matrixSignatures['DenseMatrix, SparseMatrix'] = (x, y) => options.DS(...broadcast(x, y), elop, false);\n        matrixSignatures['Array, SparseMatrix'] = (x, y) => options.DS(...broadcast(matrix(x), y), elop, false);\n      }\n      if (SD) {\n        matrixSignatures['SparseMatrix, DenseMatrix'] = (x, y) => SD(...broadcast(y, x), elop, true);\n        matrixSignatures['SparseMatrix, Array'] = (x, y) => SD(...broadcast(matrix(y), x), elop, true);\n      }\n    } else {\n      // No elop, use this\n      // First the dense ones\n      matrixSignatures = {\n        'DenseMatrix, DenseMatrix': typed.referToSelf(self => (x, y) => {\n          return matAlgo13xDD(...broadcast(x, y), self);\n        }),\n        'Array, Array': typed.referToSelf(self => (x, y) => {\n          return matAlgo13xDD(...broadcast(matrix(x), matrix(y)), self).valueOf();\n        }),\n        'Array, DenseMatrix': typed.referToSelf(self => (x, y) => {\n          return matAlgo13xDD(...broadcast(matrix(x), y), self);\n        }),\n        'DenseMatrix, Array': typed.referToSelf(self => (x, y) => {\n          return matAlgo13xDD(...broadcast(x, matrix(y)), self);\n        })\n      };\n      // Now incorporate sparse matrices\n      if (options.SS) {\n        matrixSignatures['SparseMatrix, SparseMatrix'] = typed.referToSelf(self => (x, y) => {\n          return options.SS(...broadcast(x, y), self, false);\n        });\n      }\n      if (options.DS) {\n        matrixSignatures['DenseMatrix, SparseMatrix'] = typed.referToSelf(self => (x, y) => {\n          return options.DS(...broadcast(x, y), self, false);\n        });\n        matrixSignatures['Array, SparseMatrix'] = typed.referToSelf(self => (x, y) => {\n          return options.DS(...broadcast(matrix(x), y), self, false);\n        });\n      }\n      if (SD) {\n        matrixSignatures['SparseMatrix, DenseMatrix'] = typed.referToSelf(self => (x, y) => {\n          return SD(...broadcast(y, x), self, true);\n        });\n        matrixSignatures['SparseMatrix, Array'] = typed.referToSelf(self => (x, y) => {\n          return SD(...broadcast(matrix(y), x), self, true);\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] = (x, y) => matAlgo14xDs(x, y, elop, false);\n        matrixSignatures[scalar + ', DenseMatrix'] = (x, y) => matAlgo14xDs(y, x, elop, true);\n        matrixSignatures['Array,' + scalar] = (x, y) => matAlgo14xDs(matrix(x), y, elop, false).valueOf();\n        matrixSignatures[scalar + ', Array'] = (x, y) => matAlgo14xDs(matrix(y), x, elop, true).valueOf();\n      } else {\n        matrixSignatures['DenseMatrix,' + scalar] = typed.referToSelf(self => (x, y) => {\n          return matAlgo14xDs(x, y, self, false);\n        });\n        matrixSignatures[scalar + ', DenseMatrix'] = typed.referToSelf(self => (x, y) => {\n          return matAlgo14xDs(y, x, self, true);\n        });\n        matrixSignatures['Array,' + scalar] = typed.referToSelf(self => (x, y) => {\n          return matAlgo14xDs(matrix(x), y, self, false).valueOf();\n        });\n        matrixSignatures[scalar + ', Array'] = typed.referToSelf(self => (x, y) => {\n          return matAlgo14xDs(matrix(y), x, self, true).valueOf();\n        });\n      }\n    }\n    var sS = options.sS !== undefined ? options.sS : options.Ss;\n    if (elop) {\n      if (options.Ss) {\n        matrixSignatures['SparseMatrix,' + scalar] = (x, y) => options.Ss(x, y, elop, false);\n      }\n      if (sS) {\n        matrixSignatures[scalar + ', SparseMatrix'] = (x, y) => sS(y, x, elop, true);\n      }\n    } else {\n      if (options.Ss) {\n        matrixSignatures['SparseMatrix,' + scalar] = typed.referToSelf(self => (x, y) => {\n          return options.Ss(x, y, self, false);\n        });\n      }\n      if (sS) {\n        matrixSignatures[scalar + ', SparseMatrix'] = typed.referToSelf(self => (x, y) => {\n          return sS(y, x, self, true);\n        });\n      }\n    }\n    // Also pull in the scalar signatures if the operator is a typed function\n    if (elop && elop.signatures) {\n      extend(matrixSignatures, elop.signatures);\n    }\n    return matrixSignatures;\n  };\n});", "import { factory } from '../../utils/factory.js';\nimport { createFloor } from './floor.js';\nimport { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo05xSfSf } from '../../type/matrix/utils/matAlgo05xSfSf.js';\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nvar name = 'mod';\nvar dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix', 'concat'];\nexport var createMod = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    round,\n    matrix,\n    equalScalar,\n    zeros,\n    DenseMatrix,\n    concat\n  } = _ref;\n  var floor = createFloor({\n    typed,\n    config,\n    round,\n    matrix,\n    equalScalar,\n    zeros,\n    DenseMatrix\n  });\n  var matAlgo02xDS0 = createMatAlgo02xDS0({\n    typed,\n    equalScalar\n  });\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo05xSfSf = createMatAlgo05xSfSf({\n    typed,\n    equalScalar\n  });\n  var matAlgo11xS0s = createMatAlgo11xS0s({\n    typed,\n    equalScalar\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    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   *    isOdd(2)                      // returns false...\n   *    isOdd(3)                      // returns true\n   *\n   * See also:\n   *\n   *    divide\n   *\n   * History:\n   *\n   *    v13    Handle bigints\n   *    v11.6  Support matrix broadcasting\n   *    v2     Handle Fractions\n   *    v0.2   Created\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Array | Matrix} x Dividend\n   * @param  {number | BigNumber | bigint | Fraction | Array | Matrix} y Divisor\n   * @return {number | BigNumber | bigint | Fraction | Array | Matrix} Returns the remainder of `x` divided by `y`.\n   */\n  return typed(name, {\n    'number, number': _modNumber,\n    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {\n      return y.isZero() ? x : x.sub(y.mul(floor(x.div(y))));\n    },\n    'bigint, bigint': function bigint_bigint(x, y) {\n      if (y === 0n) {\n        return x;\n      }\n      if (x < 0) {\n        var m = x % y;\n        return m === 0n ? m : m + y;\n      }\n      return x % y;\n    },\n    'Fraction, Fraction': function Fraction_Fraction(x, y) {\n      return y.equals(0) ? x : x.sub(y.mul(floor(x.div(y))));\n    }\n  }, matrixAlgorithmSuite({\n    SS: matAlgo05xSfSf,\n    DS: matAlgo03xDSf,\n    SD: matAlgo02xDS0,\n    Ss: matAlgo11xS0s,\n    sS: matAlgo12xSfs\n  }));\n\n  /**\n  * Calculate the modulus of two numbers\n  * @param {number} x\n  * @param {number} y\n  * @returns {number} res\n  * @private\n  */\n  function _modNumber(x, y) {\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\n    // We use mathjs floor to handle errors associated with\n    // precision float approximation\n    return y === 0 ? x : x - y * floor(x / y);\n  }\n});", "import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'matAlgo01xDSid';\nvar dependencies = ['typed'];\nexport var createMatAlgo01xDSid = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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   *          \u250C  f(Dij, Sij)  ; S(i,j) !== 0\n   * C(i,j) = \u2524\n   *          \u2514  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 || denseMatrix.getDataType();\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 || sparseMatrix._data === undefined ? sparseMatrix._datatype : sparseMatrix.getDataType();\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new 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 !== 'mixed' && 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: adt === denseMatrix._datatype && bdt === sparseMatrix._datatype ? dt : undefined\n    });\n  };\n});", "import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'matAlgo04xSidSid';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createMatAlgo04xSidSid = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\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   *          \u250C  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0\n   * C(i,j) = \u2524  A(i,j)       ; A(i,j) !== 0 && B(i,j) === 0\n   *          \u2514  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 || a._data === undefined ? a._datatype : a.getDataType();\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 || b._data === undefined ? b._datatype : b.getDataType();\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new 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 && adt !== 'mixed') {\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: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\n  };\n});", "import { factory } from '../../../utils/factory.js';\nvar name = 'matAlgo10xSids';\nvar dependencies = ['typed', 'DenseMatrix'];\nexport var createMatAlgo10xSids = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    DenseMatrix\n  } = _ref;\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   *          \u250C  f(Sij, b)  ; S(i,j) !== 0\n   * C(i,j) = \u2524\n   *          \u2514  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});", "/**\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 */\nexport function 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;", "import { isInteger } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMod } from './mod.js';\nimport { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js';\nimport { createMatAlgo04xSidSid } from '../../type/matrix/utils/matAlgo04xSidSid.js';\nimport { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { ArgumentsError } from '../../error/ArgumentsError.js';\nvar name = 'gcd';\nvar dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar', 'zeros', '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(element => Array.isArray(element));\n}\nexport var createGcd = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    config,\n    round,\n    equalScalar,\n    zeros,\n    BigNumber,\n    DenseMatrix,\n    concat\n  } = _ref;\n  var mod = createMod({\n    typed,\n    config,\n    round,\n    matrix,\n    equalScalar,\n    zeros,\n    DenseMatrix,\n    concat\n  });\n  var matAlgo01xDSid = createMatAlgo01xDSid({\n    typed\n  });\n  var matAlgo04xSidSid = createMatAlgo04xSidSid({\n    typed,\n    equalScalar\n  });\n  var matAlgo10xSids = createMatAlgo10xSids({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    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': _gcdNumber,\n    'BigNumber, BigNumber': _gcdBigNumber,\n    'Fraction, Fraction': (x, y) => x.gcd(y)\n  }, matrixAlgorithmSuite({\n    SS: matAlgo04xSidSid,\n    DS: matAlgo01xDSid,\n    Ss: matAlgo10xSids\n  }), {\n    [gcdManyTypesSignature]: typed.referToSelf(self => (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    Array: typed.referToSelf(self => array => {\n      if (array.length === 1 && Array.isArray(array[0]) && is1d(array[0])) {\n        return self(...array[0]);\n      }\n      if (is1d(array)) {\n        return self(...array);\n      }\n      throw new ArgumentsError('gcd() supports only 1d matrices!');\n    }),\n    Matrix: typed.referToSelf(self => matrix => {\n      return self(matrix.toArray());\n    })\n  });\n\n  /**\n  * Calculate gcd for numbers\n  * @param {number} a\n  * @param {number} b\n  * @returns {number} Returns the greatest common denominator of a and b\n  * @private\n  */\n  function _gcdNumber(a, b) {\n    if (!isInteger(a) || !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 = mod(a, b);\n      a = b;\n      b = r;\n    }\n    return a < 0 ? -a : a;\n  }\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 = mod(a, b);\n      a = b;\n      b = r;\n    }\n    return a.lt(zero) ? a.neg() : a;\n  }\n});", "import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nimport { scatter } from '../../../utils/collection.js';\nvar name = 'matAlgo06xS0S0';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createMatAlgo06xS0S0 = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\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   *          \u250C  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0\n   * C(i,j) = \u2524\n   *          \u2514  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 || a._data === undefined ? a._datatype : a.getDataType();\n    // sparse matrix arrays\n    var bvalues = b._values;\n    var bsize = b._size;\n    var bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new 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 && adt !== 'mixed') {\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      scatter(a, j, w, x, u, mark, cindex, cf);\n      // scatter the values of B(:,j) into workspace\n      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: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\n  };\n});", "import { factory } from '../../utils/factory.js';\nimport { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js';\nimport { createMatAlgo06xS0S0 } from '../../type/matrix/utils/matAlgo06xS0S0.js';\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { lcmNumber } from '../../plain/number/index.js';\nvar name = 'lcm';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'concat'];\nexport var createLcm = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    concat\n  } = _ref;\n  var matAlgo02xDS0 = createMatAlgo02xDS0({\n    typed,\n    equalScalar\n  });\n  var matAlgo06xS0S0 = createMatAlgo06xS0S0({\n    typed,\n    equalScalar\n  });\n  var matAlgo11xS0s = createMatAlgo11xS0s({\n    typed,\n    equalScalar\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    concat\n  });\n  var lcmTypes = 'number | BigNumber | Fraction | Matrix | Array';\n  var lcmManySignature = {};\n  lcmManySignature[\"\".concat(lcmTypes, \", \").concat(lcmTypes, \", ...\").concat(lcmTypes)] = typed.referToSelf(self => (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   * 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': lcmNumber,\n    'BigNumber, BigNumber': _lcmBigNumber,\n    'Fraction, Fraction': (x, y) => x.lcm(y)\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});", "/**\n * Build a bigint logarithm function from a number logarithm,\n * still returning a number. The idea is that 15 hexadecimal digits\n * (60 bits) saturates the mantissa of the log, and each additional hex\n * digit effectively just adds the log of 16 to the resulting value. So\n * convert the most significant 15 hex digits to a number and take its\n * log, and then add the log of 16 for each additional hex digit that\n * was in the bigint.\n * For negative numbers (complex logarithms), following the bignum\n * implementation, it just downgrades to number and uses the complex result.\n * @param {number} log16  the log of 16\n * @param {(number) -> number} numberLog  the logarithm function for numbers\n * @param {ConfigurationObject} config  the mathjs configuration\n * @param {(number) -> Complex} cplx  the associated Complex log\n * @returns {(bigint) -> number}   the corresponding logarithm for bigints\n */\nexport function promoteLogarithm(log16, numberLog, config, cplx) {\n  return function (b) {\n    if (b > 0 || config.predictable) {\n      if (b <= 0) return NaN;\n      var s = b.toString(16);\n      var s15 = s.substring(0, 15);\n      return log16 * (s.length - s15.length) + numberLog(Number('0x' + s15));\n    }\n    return cplx(b.toNumber());\n  };\n}", "import { log10Number } from '../../plain/number/index.js';\nimport { promoteLogarithm } from '../../utils/bigint.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'log10';\nvar dependencies = ['typed', 'config', 'Complex'];\nvar log16 = log10Number(16);\nexport var createLog10 = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    Complex\n  } = _ref;\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\n  function complexLog(c) {\n    return c.log().div(Math.LN10);\n  }\n  function complexLogNumber(x) {\n    return complexLog(new Complex(x, 0));\n  }\n  return typed(name, {\n    number: function number(x) {\n      if (x >= 0 || config.predictable) {\n        return log10Number(x);\n      } else {\n        // negative value -> complex value computation\n        return complexLogNumber(x);\n      }\n    },\n    bigint: promoteLogarithm(log16, log10Number, config, complexLogNumber),\n    Complex: complexLog,\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 complexLogNumber(x.toNumber());\n      }\n    },\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});", "import { log2Number } from '../../plain/number/index.js';\nimport { promoteLogarithm } from '../../utils/bigint.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'log2';\nvar dependencies = ['typed', 'config', 'Complex'];\nexport var createLog2 = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    Complex\n  } = _ref;\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  function complexLog2Number(x) {\n    return _log2Complex(new Complex(x, 0));\n  }\n  return typed(name, {\n    number: function number(x) {\n      if (x >= 0 || config.predictable) {\n        return log2Number(x);\n      } else {\n        // negative value -> complex value computation\n        return complexLog2Number(x);\n      }\n    },\n    bigint: promoteLogarithm(4, log2Number, config, complexLog2Number),\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 complexLog2Number(x.toNumber());\n      }\n    },\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\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});", "import { factory } from '../../utils/factory.js';\nimport { multiplyNumber } from '../../plain/number/index.js';\nvar name = 'multiplyScalar';\nvar dependencies = ['typed'];\nexport var createMultiplyScalar = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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 | bigint | Fraction | Complex | Unit} x   First value to multiply\n   * @param  {number | BigNumber | bigint | Fraction | Complex} y          Second value to multiply\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit}     Multiplication of `x` and `y`\n   * @private\n   */\n  return typed('multiplyScalar', {\n    'number, number': multiplyNumber,\n    'Complex, Complex': function Complex_Complex(x, y) {\n      return x.mul(y);\n    },\n    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {\n      return x.times(y);\n    },\n    'bigint, bigint': function bigint_bigint(x, y) {\n      return x * y;\n    },\n    'Fraction, Fraction': function Fraction_Fraction(x, y) {\n      return x.mul(y);\n    },\n    'number | Fraction | BigNumber | Complex, Unit': (x, y) => y.multiply(x),\n    'Unit, number | Fraction | BigNumber | Complex | Unit': (x, y) => x.multiply(y)\n  });\n});", "import { factory } from '../../utils/factory.js';\nimport { isMatrix } from '../../utils/is.js';\nimport { arraySize } from '../../utils/array.js';\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';\nvar name = 'multiply';\nvar dependencies = ['typed', 'matrix', 'addScalar', 'multiplyScalar', 'equalScalar', 'dot'];\nexport var createMultiply = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    addScalar,\n    multiplyScalar,\n    equalScalar,\n    dot\n  } = _ref;\n  var matAlgo11xS0s = createMatAlgo11xS0s({\n    typed,\n    equalScalar\n  });\n  var matAlgo14xDs = createMatAlgo14xDs({\n    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 || a.getDataType();\n    // b dense\n    var bdata = b._data;\n    var bsize = b._size;\n    var bdt = b._datatype || b.getDataType();\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' && adt !== 'mixed') {\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: adt === a._datatype && bdt === b._datatype ? dt : undefined\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 || a.getDataType();\n    // b dense\n    var bdata = b._data;\n    var bdt = b._datatype || b.getDataType();\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' && adt !== 'mixed') {\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: adt === a._datatype && bdt === b._datatype ? dt : undefined\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    // getDataType()\n    // a dense\n    var adata = a._data;\n    var asize = a._size;\n    var adt = a._datatype || a.getDataType();\n    // b dense\n    var bdata = b._data;\n    var bsize = b._size;\n    var bdt = b._datatype || b.getDataType();\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' && adt !== 'mixed' && adt !== 'mixed') {\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: adt === a._datatype && bdt === b._datatype ? dt : undefined\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 || a.getDataType();\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 || b._data === undefined ? b._datatype : b.getDataType();\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' && adt !== 'mixed') {\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: adt === a._datatype && bdt === b._datatype ? dt : undefined\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 || a._data === undefined ? a._datatype : a.getDataType();\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 || b.getDataType();\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' && adt !== 'mixed') {\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    // matrix to return\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, 1],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\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 || a._data === undefined ? a._datatype : a.getDataType();\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 || b.getDataType();\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' && adt !== 'mixed') {\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: adt === a._datatype && bdt === b._datatype ? dt : undefined\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 || a._data === undefined ? a._datatype : a.getDataType();\n    // b sparse\n    var bvalues = b._values;\n    var bindex = b._index;\n    var bptr = b._ptr;\n    var bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();\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' && adt !== 'mixed') {\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: adt === a._datatype && bdt === b._datatype ? dt : undefined\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 | bigint | Fraction | Complex | Unit | Array | Matrix} x First value to multiply\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} y Second value to multiply\n   * @return {number | BigNumber | bigint | 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', selfMM => (x, y) => {\n      // check dimensions\n      _validateMatrixDimensions(arraySize(x), arraySize(y));\n\n      // use dense matrix implementation\n      var m = selfMM(matrix(x), matrix(y));\n      // return array or scalar\n      return isMatrix(m) ? m.valueOf() : m;\n    }),\n    'Matrix, Matrix': function Matrix_Matrix(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', selfMM => (x, y) => selfMM(x, matrix(y))),\n    'Array, Matrix': typed.referToSelf(self => (x, y) => {\n      // use Matrix * Matrix implementation\n      return self(matrix(x, y.storage()), y);\n    }),\n    'SparseMatrix, any': function SparseMatrix_any(x, y) {\n      return matAlgo11xS0s(x, y, multiplyScalar, false);\n    },\n    'DenseMatrix, any': function DenseMatrix_any(x, y) {\n      return matAlgo14xDs(x, y, multiplyScalar, false);\n    },\n    'any, SparseMatrix': function any_SparseMatrix(x, y) {\n      return matAlgo11xS0s(y, x, multiplyScalar, true);\n    },\n    'any, DenseMatrix': function any_DenseMatrix(x, y) {\n      return matAlgo14xDs(y, x, multiplyScalar, true);\n    },\n    'Array, any': function Array_any(x, y) {\n      // use matrix implementation\n      return matAlgo14xDs(matrix(x), y, multiplyScalar, false).valueOf();\n    },\n    'any, Array': function any_Array(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(self => (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});", "import { factory } from '../../utils/factory.js';\nimport { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js';\nimport { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js';\nimport { createMatAlgo06xS0S0 } from '../../type/matrix/utils/matAlgo06xS0S0.js';\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { nthRootNumber } from '../../plain/number/index.js';\nvar name = 'nthRoot';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber', 'concat'];\nexport var createNthRoot = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    BigNumber: _BigNumber,\n    concat\n  } = _ref;\n  var matAlgo01xDSid = createMatAlgo01xDSid({\n    typed\n  });\n  var matAlgo02xDS0 = createMatAlgo02xDS0({\n    typed,\n    equalScalar\n  });\n  var matAlgo06xS0S0 = createMatAlgo06xS0S0({\n    typed,\n    equalScalar\n  });\n  var matAlgo11xS0s = createMatAlgo11xS0s({\n    typed,\n    equalScalar\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    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\n   *     math.sqrt(9)          // returns 3\n   *     math.nthRoot(64, 3)   // returns 4\n   *\n   * See also:\n   *\n   *     sqrt, pow\n   *\n   * History:\n   *\n   *     v11.6  Support matrix broadcasting\n   *     v2     Handle Complex\n   *     v1.1   Created\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: nthRootNumber,\n    'number, number': nthRootNumber,\n    BigNumber: x => _bigNthRoot(x, new _BigNumber(2)),\n    'BigNumber, BigNumber': _bigNthRoot,\n    Complex: complexErr,\n    'Complex, number': complexErr,\n    Array: typed.referTo('DenseMatrix,number', selfDn => x => selfDn(matrix(x), 2).valueOf()),\n    DenseMatrix: typed.referTo('DenseMatrix,number', selfDn => x => selfDn(x, 2)),\n    SparseMatrix: typed.referTo('SparseMatrix,number', selfSn => x => selfSn(x, 2)),\n    'SparseMatrix, SparseMatrix': typed.referToSelf(self => (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    'DenseMatrix, SparseMatrix': typed.referToSelf(self => (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    'Array, SparseMatrix': typed.referTo('DenseMatrix,SparseMatrix', selfDS => (x, y) => selfDS(matrix(x), y)),\n    'number | BigNumber, SparseMatrix': typed.referToSelf(self => (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  }, 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});\nexport var createNthRootNumber = /* #__PURE__ */factory(name, ['typed'], _ref2 => {\n  var {\n    typed\n  } = _ref2;\n  return typed(name, {\n    number: nthRootNumber,\n    'number, number': nthRootNumber\n  });\n});", "import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { signNumber } from '../../plain/number/index.js';\nvar name = 'sign';\nvar dependencies = ['typed', 'BigNumber', 'Fraction', 'complex'];\nexport var createSign = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    BigNumber: _BigNumber,\n    complex,\n    Fraction: _Fraction\n  } = _ref;\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 | bigint | Fraction | Complex | Array | Matrix | Unit} x\n   *            The number for which to determine the sign\n   * @return {number | BigNumber | bigint | Fraction | Complex | Array | Matrix | Unit}\n   *            The sign of `x`\n   */\n  return typed(name, {\n    number: signNumber,\n    Complex: function Complex(x) {\n      return x.im === 0 ? complex(signNumber(x.re)) : x.sign();\n    },\n    BigNumber: function BigNumber(x) {\n      return new _BigNumber(x.cmp(0));\n    },\n    bigint: function bigint(x) {\n      return x > 0n ? 1n : x < 0n ? -1n : 0n;\n    },\n    Fraction: function Fraction(x) {\n      return x.n === 0n ? new _Fraction(0) : new _Fraction(x.s);\n    },\n    // deep map collection, skip zeros since sign(0) = 0\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self, true)),\n    Unit: typed.referToSelf(self => 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});", "import { factory } from '../../utils/factory.js';\nvar name = 'sqrt';\nvar dependencies = ['config', 'typed', 'Complex'];\nexport var createSqrt = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    config,\n    typed,\n    Complex\n  } = _ref;\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});", "import { factory } from '../../utils/factory.js';\nimport { squareNumber } from '../../plain/number/index.js';\nvar name = 'square';\nvar dependencies = ['typed'];\nexport var createSquare = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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 | bigint | Fraction | Complex | Unit} x\n   *            Number for which to calculate the square\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit}\n   *            Squared value\n   */\n  return typed(name, {\n    number: squareNumber,\n    Complex: function Complex(x) {\n      return x.mul(x);\n    },\n    BigNumber: function BigNumber(x) {\n      return x.times(x);\n    },\n    bigint: function bigint(x) {\n      return x * 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});", "import { factory } from '../../utils/factory.js';\nimport { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo05xSfSf } from '../../type/matrix/utils/matAlgo05xSfSf.js';\nimport { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nvar name = 'subtract';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'subtractScalar', 'unaryMinus', 'DenseMatrix', 'concat'];\nexport var createSubtract = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    subtractScalar,\n    unaryMinus,\n    DenseMatrix,\n    concat\n  } = _ref;\n  // TODO: split function subtract in two: subtract and subtractScalar\n\n  var matAlgo01xDSid = createMatAlgo01xDSid({\n    typed\n  });\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo05xSfSf = createMatAlgo05xSfSf({\n    typed,\n    equalScalar\n  });\n  var matAlgo10xSids = createMatAlgo10xSids({\n    typed,\n    DenseMatrix\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    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 | bigint | Fraction | Complex | Unit | Array | Matrix} x Initial value\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} y Value to subtract from `x`\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} Subtraction of `x` and `y`\n   */\n  return typed(name, {\n    'any, any': subtractScalar\n  }, matrixAlgorithmSuite({\n    elop: subtractScalar,\n    SS: matAlgo05xSfSf,\n    DS: matAlgo01xDSid,\n    SD: matAlgo03xDSf,\n    Ss: matAlgo12xSfs,\n    sS: matAlgo10xSids\n  }));\n});", "import { factory } from '../../utils/factory.js';\nimport { xgcdNumber } from '../../plain/number/index.js';\nvar name = 'xgcd';\nvar dependencies = ['typed', 'config', 'matrix', 'BigNumber'];\nexport var createXgcd = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    matrix,\n    BigNumber\n  } = _ref;\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 number_number(a, b) {\n      var res = 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});", "import { factory } from '../../utils/factory.js';\nvar name = 'invmod';\nvar dependencies = ['typed', 'config', 'BigNumber', 'xgcd', 'equal', 'smaller', 'mod', 'add', 'isInteger'];\nexport var createInvmod = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    BigNumber,\n    xgcd,\n    equal,\n    smaller,\n    mod,\n    add,\n    isInteger\n  } = _ref;\n  /**\n   * Calculate the (modular) multiplicative inverse of a modulo b. Solution to the equation `ax \u2263 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 \u2263 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 [gcd, inv] = res;\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});", "import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'matAlgo09xS0Sf';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createMatAlgo09xS0Sf = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\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   *          \u250C  f(Aij, Bij)  ; A(i,j) !== 0\n   * C(i,j) = \u2524\n   *          \u2514  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 || a._data === undefined ? a._datatype : a.getDataType();\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 || b._data === undefined ? b._datatype : b.getDataType();\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new 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 && adt !== 'mixed') {\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: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\n  };\n});", "import { factory } from '../../utils/factory.js';\nimport { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js';\nimport { createMatAlgo09xS0Sf } from '../../type/matrix/utils/matAlgo09xS0Sf.js';\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nvar name = 'dotMultiply';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'multiplyScalar', 'concat'];\nexport var createDotMultiply = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    multiplyScalar,\n    concat\n  } = _ref;\n  var matAlgo02xDS0 = createMatAlgo02xDS0({\n    typed,\n    equalScalar\n  });\n  var matAlgo09xS0Sf = createMatAlgo09xS0Sf({\n    typed,\n    equalScalar\n  });\n  var matAlgo11xS0s = createMatAlgo11xS0s({\n    typed,\n    equalScalar\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    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});", "/**\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 */\nexport function 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 */\nexport function 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 */\nexport function 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 */\nexport function bitwise(x, y, func) {\n  var BigNumber = x.constructor;\n  var xBits, yBits;\n  var xSign = +(x.s < 0);\n  var ySign = +(y.s < 0);\n  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 */\nexport function bitXor(x, y) {\n  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {\n    throw new Error('Integers expected in function bitXor');\n  }\n  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 */\nexport function 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 */\nexport function 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}", "import { bitAndBigNumber } from '../../utils/bignumber/bitwise.js';\nimport { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js';\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';\nimport { createMatAlgo06xS0S0 } from '../../type/matrix/utils/matAlgo06xS0S0.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { bitAndNumber } from '../../plain/number/index.js';\nvar name = 'bitAnd';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'concat'];\nexport var createBitAnd = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    concat\n  } = _ref;\n  var matAlgo02xDS0 = createMatAlgo02xDS0({\n    typed,\n    equalScalar\n  });\n  var matAlgo06xS0S0 = createMatAlgo06xS0S0({\n    typed,\n    equalScalar\n  });\n  var matAlgo11xS0s = createMatAlgo11xS0s({\n    typed,\n    equalScalar\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    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 | bigint | Array | Matrix} x First value to and\n   * @param  {number | BigNumber | bigint | Array | Matrix} y Second value to and\n   * @return {number | BigNumber | bigint | Array | Matrix} AND of `x` and `y`\n   */\n  return typed(name, {\n    'number, number': bitAndNumber,\n    'BigNumber, BigNumber': bitAndBigNumber,\n    'bigint, bigint': (x, y) => x & y\n  }, matrixAlgorithmSuite({\n    SS: matAlgo06xS0S0,\n    DS: matAlgo02xDS0,\n    Ss: matAlgo11xS0s\n  }));\n});", "import { bitNotBigNumber } from '../../utils/bignumber/bitwise.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { bitNotNumber } from '../../plain/number/index.js';\nvar name = 'bitNot';\nvar dependencies = ['typed'];\nexport var createBitNot = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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 | bigint | Array | Matrix} x Value to not\n   * @return {number | BigNumber | bigint | Array | Matrix} NOT of `x`\n   */\n  return typed(name, {\n    number: bitNotNumber,\n    BigNumber: bitNotBigNumber,\n    bigint: x => ~x,\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});", "import { bitOrBigNumber } from '../../utils/bignumber/bitwise.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js';\nimport { createMatAlgo04xSidSid } from '../../type/matrix/utils/matAlgo04xSidSid.js';\nimport { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { bitOrNumber } from '../../plain/number/index.js';\nvar name = 'bitOr';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix', 'concat'];\nexport var createBitOr = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    DenseMatrix,\n    concat\n  } = _ref;\n  var matAlgo01xDSid = createMatAlgo01xDSid({\n    typed\n  });\n  var matAlgo04xSidSid = createMatAlgo04xSidSid({\n    typed,\n    equalScalar\n  });\n  var matAlgo10xSids = createMatAlgo10xSids({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    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 | bigint | Array | Matrix} x First value to or\n   * @param  {number | BigNumber | bigint | Array | Matrix} y Second value to or\n   * @return {number | BigNumber | bigint | Array | Matrix} OR of `x` and `y`\n   */\n  return typed(name, {\n    'number, number': bitOrNumber,\n    'BigNumber, BigNumber': bitOrBigNumber,\n    'bigint, bigint': (x, y) => x | y\n  }, matrixAlgorithmSuite({\n    SS: matAlgo04xSidSid,\n    DS: matAlgo01xDSid,\n    Ss: matAlgo10xSids\n  }));\n});", "import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'matAlgo07xSSf';\nvar dependencies = ['typed', 'SparseMatrix'];\nexport var createMatAlgo07xSSf = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    SparseMatrix\n  } = _ref;\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}                    SparseMatrix (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 || a._data === undefined ? a._datatype : a.getDataType();\n    var bsize = b._size;\n    var bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new DimensionError(asize.length, bsize.length);\n    }\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {\n      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    var zero = 0;\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {\n      dt = adt;\n      zero = typed.convert(0, dt);\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result arrays for sparse format\n    var cvalues = [];\n    var cindex = [];\n    var cptr = new Array(columns + 1).fill(0); // Start with column pointer array\n\n    // workspaces\n    var xa = [];\n    var xb = [];\n    var wa = [];\n    var wb = [];\n\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      var mark = j + 1;\n      var nonZeroCount = 0;\n      _scatter(a, j, wa, xa, mark);\n      _scatter(b, j, wb, xb, mark);\n\n      // loop rows\n      for (var i = 0; i < rows; i++) {\n        var va = wa[i] === mark ? xa[i] : zero;\n        var vb = wb[i] === mark ? xb[i] : zero;\n\n        // invoke callback\n        var cij = cf(va, vb);\n        // Store all non zero and true values\n        if (cij !== 0 && cij !== false) {\n          cindex.push(i); // row index\n          cvalues.push(cij); // computed value\n          nonZeroCount++;\n        }\n      }\n\n      // Update column pointer with cumulative count of non-zero values\n      cptr[j + 1] = cptr[j] + nonZeroCount;\n    }\n\n    // Return the result as a sparse matrix\n    return new SparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\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});", "import { bitXor as bigBitXor } from '../../utils/bignumber/bitwise.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { bitXorNumber } from '../../plain/number/index.js';\nvar name = 'bitXor';\nvar dependencies = ['typed', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];\nexport var createBitXor = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    DenseMatrix,\n    concat,\n    SparseMatrix\n  } = _ref;\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo07xSSf = createMatAlgo07xSSf({\n    typed,\n    SparseMatrix\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    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 | bigint | Array | Matrix} x First value to xor\n   * @param  {number | BigNumber | bigint | Array | Matrix} y Second value to xor\n   * @return {number | BigNumber | bigint | Array | Matrix} XOR of `x` and `y`\n   */\n  return typed(name, {\n    'number, number': bitXorNumber,\n    'BigNumber, BigNumber': bigBitXor,\n    'bigint, bigint': (x, y) => x ^ y\n  }, matrixAlgorithmSuite({\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo12xSfs\n  }));\n});", "import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'arg';\nvar dependencies = ['typed'];\nexport var createArg = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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(self => x => deepMap(x, self))\n  });\n});", "import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'conj';\nvar dependencies = ['typed'];\nexport var createConj = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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 | Unit} x\n   *            A complex number or array with complex numbers\n   * @return {number | BigNumber | Complex | Array | Matrix | Unit}\n   *            The complex conjugate of x\n   */\n  return typed(name, {\n    'number | BigNumber | Fraction': x => x,\n    Complex: x => x.conjugate(),\n    Unit: typed.referToSelf(self => x => new x.constructor(self(x.toNumeric()), x.formatUnits())),\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});", "import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 'im';\nvar dependencies = ['typed'];\nexport var createIm = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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: () => 0,\n    'BigNumber | Fraction': x => x.mul(0),\n    Complex: x => x.im,\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});", "import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nvar name = 're';\nvar dependencies = ['typed'];\nexport var createRe = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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': x => x,\n    Complex: x => x.re,\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});", "import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { notNumber } from '../../plain/number/index.js';\nvar name = 'not';\nvar dependencies = ['typed'];\nexport var createNot = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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 | bigint | 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': () => true,\n    number: 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    bigint: x => !x,\n    Unit: typed.referToSelf(self => x => typed.find(self, x.valueType())(x.value)),\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});", "import { factory } from '../../utils/factory.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';\nimport { createMatAlgo13xDD } from '../../type/matrix/utils/matAlgo13xDD.js';\nimport { DimensionError } from '../../error/DimensionError.js';\nvar name = 'nullish';\nvar dependencies = ['typed', 'matrix', 'size', 'flatten', 'deepEqual'];\nexport var createNullish = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    size,\n    flatten,\n    deepEqual\n  } = _ref;\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo14xDs = createMatAlgo14xDs({\n    typed\n  });\n  var matAlgo13xDD = createMatAlgo13xDD({\n    typed\n  });\n\n  /**\n   * Nullish coalescing operator (??). Returns the right-hand side operand\n   * when the left-hand side operand is null or undefined, and otherwise\n   * returns the left-hand side operand.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.nullish(x, y)\n   *\n   * Examples:\n   *\n   *    math.nullish(null, 42)        // returns 42\n   *    math.nullish(undefined, 42)   // returns 42\n   *    math.nullish(0, 42)           // returns 0\n   *    math.nullish(false, 42)       // returns false\n   *    math.nullish('', 42)          // returns ''\n   *\n   *    // Object property access with fallback\n   *    const obj = {foo: 7, bar: 3}\n   *    math.nullish(obj.baz, 0)      // returns 0\n   *\n   * See also:\n   *\n   *    and, or, not\n   *\n   * @param  {*} x First value to check\n   * @param  {*} y Fallback value\n   * @return {*} Returns y when x is null or undefined, otherwise returns x\n   */\n\n  return typed(name, {\n    // Scalar and SparseMatrix-first short-circuit handlers\n    'number|bigint|Complex|BigNumber|Fraction|Unit|string|boolean|SparseMatrix, any': (x, _y) => x,\n    'null, any': (_x, y) => y,\n    'undefined, any': (_x, y) => y,\n    // SparseMatrix-first with collection RHS: enforce exact shape match\n    'SparseMatrix, Array | Matrix': (x, y) => {\n      var sx = size(x);\n      var sy = size(y);\n      if (deepEqual(sx, sy)) return x;\n      throw new DimensionError(sx, sy);\n    },\n    // DenseMatrix-first handlers (no broadcasting between collections)\n    'DenseMatrix, DenseMatrix': typed.referToSelf(self => (x, y) => matAlgo13xDD(x, y, self)),\n    'DenseMatrix, SparseMatrix': typed.referToSelf(self => (x, y) => matAlgo03xDSf(x, y, self, false)),\n    'DenseMatrix, Array': typed.referToSelf(self => (x, y) => matAlgo13xDD(x, matrix(y), self)),\n    'DenseMatrix, any': typed.referToSelf(self => (x, y) => matAlgo14xDs(x, y, self, false)),\n    // Array-first handlers (bridge via matrix() where needed)\n    'Array, Array': typed.referToSelf(self => (x, y) => matAlgo13xDD(matrix(x), matrix(y), self).valueOf()),\n    'Array, DenseMatrix': typed.referToSelf(self => (x, y) => matAlgo13xDD(matrix(x), y, self)),\n    'Array, SparseMatrix': typed.referToSelf(self => (x, y) => matAlgo03xDSf(matrix(x), y, self, false)),\n    'Array, any': typed.referToSelf(self => (x, y) => matAlgo14xDs(matrix(x), y, self, false).valueOf())\n  });\n});", "import { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatAlgo05xSfSf } from '../../type/matrix/utils/matAlgo05xSfSf.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { orNumber } from '../../plain/number/index.js';\nvar name = 'or';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix', 'concat'];\nexport var createOr = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    DenseMatrix,\n    concat\n  } = _ref;\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo05xSfSf = createMatAlgo05xSfSf({\n    typed,\n    equalScalar\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    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 | bigint | Complex | Unit | Array | Matrix} x First value to check\n   * @param  {number | BigNumber | bigint | 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': orNumber,\n    'Complex, Complex': function Complex_Complex(x, y) {\n      return x.re !== 0 || x.im !== 0 || y.re !== 0 || y.im !== 0;\n    },\n    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {\n      return !x.isZero() && !x.isNaN() || !y.isZero() && !y.isNaN();\n    },\n    'bigint, bigint': orNumber,\n    'Unit, Unit': typed.referToSelf(self => (x, y) => self(x.value || 0, y.value || 0))\n  }, matrixAlgorithmSuite({\n    SS: matAlgo05xSfSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo12xSfs\n  }));\n});", "import { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { xorNumber } from '../../plain/number/index.js';\nvar name = 'xor';\nvar dependencies = ['typed', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];\nexport var createXor = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    DenseMatrix,\n    concat,\n    SparseMatrix\n  } = _ref;\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo07xSSf = createMatAlgo07xSSf({\n    typed,\n    SparseMatrix\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    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 | bigint | Complex | Unit | Array | Matrix} x First value to check\n   * @param  {number | BigNumber | bigint | 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': xorNumber,\n    'Complex, Complex': function Complex_Complex(x, y) {\n      return (x.re !== 0 || x.im !== 0) !== (y.re !== 0 || y.im !== 0);\n    },\n    'bigint, bigint': xorNumber,\n    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {\n      return (!x.isZero() && !x.isNaN()) !== (!y.isZero() && !y.isNaN());\n    },\n    'Unit, Unit': typed.referToSelf(self => (x, y) => self(x.value || 0, y.value || 0))\n  }, matrixAlgorithmSuite({\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo12xSfs\n  }));\n});", "import { isBigNumber, isMatrix, isNumber } from '../../utils/is.js';\nimport { clone } from '../../utils/object.js';\nimport { arraySize, concat as _concat } from '../../utils/array.js';\nimport { IndexError } from '../../error/IndexError.js';\nimport { DimensionError } from '../../error/DimensionError.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'concat';\nvar dependencies = ['typed', 'matrix', 'isInteger'];\nexport var createConcat = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    isInteger\n  } = _ref;\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 Array__Matrix__number__BigNumber(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 (isMatrix(arg)) {\n          asMatrix = true;\n        }\n        if (isNumber(arg) || 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(dim, prevDim + 1);\n          }\n        } else {\n          // this is a matrix or array\n          var m = clone(arg).valueOf();\n          var size = 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(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);\n      }\n      return asMatrix ? matrix(res) : res;\n    },\n    '...string': function string(args) {\n      return args.join('');\n    }\n  });\n});", "import { factory } from '../../utils/factory.js';\nimport { isMatrix } from '../../utils/is.js';\nimport { clone } from '../../utils/object.js';\nimport { validateIndex } from '../../utils/array.js';\nvar name = 'column';\nvar dependencies = ['typed', 'Index', 'matrix', 'range'];\nexport var createColumn = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    Index,\n    matrix,\n    range\n  } = _ref;\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 Array_number(value, column) {\n      return _column(matrix(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    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    // once config.legacySubset just return result\n    return isMatrix(result) ? result : matrix([[result]]);\n  }\n});", "import { factory } from '../../utils/factory.js';\nvar name = 'count';\nvar dependencies = ['typed', 'size', 'prod'];\nexport var createCount = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    size,\n    prod\n  } = _ref;\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 Matrix__Array(x) {\n      return prod(size(x));\n    }\n  });\n});", "import { arraySize, squeeze } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'cross';\nvar dependencies = ['typed', 'matrix', 'subtract', 'multiply'];\nexport var createCross = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    subtract,\n    multiply\n  } = _ref;\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 Matrix_Matrix(x, y) {\n      return matrix(_cross(x.toArray(), y.toArray()));\n    },\n    'Matrix, Array': function Matrix_Array(x, y) {\n      return matrix(_cross(x.toArray(), y));\n    },\n    'Array, Matrix': function Array_Matrix(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(arraySize(x).length, arraySize(y).length);\n    x = squeeze(x);\n    y = squeeze(y);\n    var xSize = arraySize(x);\n    var ySize = 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});", "import { isMatrix } from '../../utils/is.js';\nimport { arraySize } from '../../utils/array.js';\nimport { isInteger } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'diag';\nvar dependencies = ['typed', 'matrix', 'DenseMatrix', 'SparseMatrix'];\nexport var createDiag = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    DenseMatrix,\n    SparseMatrix\n  } = _ref;\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, arraySize(x), null);\n    },\n    'Array, number': function Array_number(x, k) {\n      return _diag(x, k, arraySize(x), null);\n    },\n    'Array, BigNumber': function Array_BigNumber(x, k) {\n      return _diag(x, k.toNumber(), arraySize(x), null);\n    },\n    'Array, string': function Array_string(x, format) {\n      return _diag(x, 0, arraySize(x), format);\n    },\n    'Array, number, string': function Array_number_string(x, k, format) {\n      return _diag(x, k, arraySize(x), format);\n    },\n    'Array, BigNumber, string': function Array_BigNumber_string(x, k, format) {\n      return _diag(x, k.toNumber(), arraySize(x), format);\n    },\n    Matrix: function Matrix(x) {\n      return _diag(x, 0, x.size(), x.storage());\n    },\n    'Matrix, number': function Matrix_number(x, k) {\n      return _diag(x, k, x.size(), x.storage());\n    },\n    'Matrix, BigNumber': function Matrix_BigNumber(x, k) {\n      return _diag(x, k.toNumber(), x.size(), x.storage());\n    },\n    'Matrix, string': function Matrix_string(x, format) {\n      return _diag(x, 0, x.size(), format);\n    },\n    'Matrix, number, string': function Matrix_number_string(x, k, format) {\n      return _diag(x, k, x.size(), format);\n    },\n    'Matrix, BigNumber, string': function Matrix_BigNumber_string(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 (!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 (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});", "import { optimizeCallback } from '../../utils/optimizeCallback.js';\nimport { filter, filterRegExp } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'filter';\nvar dependencies = ['typed'];\nexport var createFilter = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Filter the items in an array or one dimensional matrix.\n   *\n   * The callback is invoked with three arguments: the current value,\n   * the current index, and the matrix operated upon.\n   * 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.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 Matrix_function(x, test) {\n      return x.create(_filterCallback(x.valueOf(), test), x.datatype());\n    },\n    'Array, RegExp': filterRegExp,\n    'Matrix, RegExp': function Matrix_RegExp(x, test) {\n      return x.create(filterRegExp(x.valueOf(), test), x.datatype());\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 */\nfunction _filterCallback(x, callback) {\n  var fastCallback = optimizeCallback(callback, x, 'filter');\n  if (fastCallback.isUnary) {\n    return filter(x, fastCallback.fn);\n  }\n  return filter(x, function (value, index, array) {\n    // invoke the callback function with the right number of arguments\n    return fastCallback.fn(value, [index], array);\n  });\n}", "import { flatten as flattenArray } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'flatten';\nvar dependencies = ['typed'];\nexport var createFlatten = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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 {DenseMatrix | Array} x   Matrix to be flattened\n   * @return {DenseMatrix | Array} Returns the flattened matrix\n   */\n  return typed(name, {\n    Array: function Array(x) {\n      return flattenArray(x);\n    },\n    DenseMatrix: function DenseMatrix(x) {\n      // Return the same matrix type as x (Dense or Sparse Matrix)\n      // Return the same data type as x\n      return x.create(flattenArray(x.valueOf(), true), x.datatype());\n    },\n    SparseMatrix: function SparseMatrix(_x) {\n      throw new TypeError('SparseMatrix is not supported by function flatten ' + 'because it does not support 1D vectors. ' + 'Convert to a DenseMatrix or Array first. Example: flatten(x.toArray())');\n    }\n  });\n});", "import { optimizeCallback } from '../../utils/optimizeCallback.js';\nimport { factory } from '../../utils/factory.js';\nimport { deepForEach } from '../../utils/array.js';\nvar name = 'forEach';\nvar dependencies = ['typed'];\nexport var createForEach = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Iterate over all elements of a matrix/array, and executes the given callback function.\n   *\n   * The callback is invoked with three arguments: the current value,\n   * the current index, and the matrix operated upon.\n   * 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.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 Matrix_function(x, callback) {\n      x.forEach(callback);\n    }\n  });\n});\n\n/**\n * forEach for a multidimensional array\n * @param {Array} array\n * @param {Function} callback\n * @private\n */\nfunction _forEach(array, callback) {\n  var fastCallback = optimizeCallback(callback, array, name);\n  deepForEach(array, fastCallback.fn, fastCallback.isUnary);\n}", "import { factory } from '../../utils/factory.js';\nimport { getArrayDataType } from '../../utils/array.js';\nimport { typeOf } from '../../utils/is.js';\nvar name = 'getMatrixDataType';\nvar dependencies = ['typed'];\nexport var createGetMatrixDataType = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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 getArrayDataType(x, typeOf);\n    },\n    Matrix: function Matrix(x) {\n      return x.getDataType();\n    }\n  });\n});", "import { isBigNumber } from '../../utils/is.js';\nimport { resize } from '../../utils/array.js';\nimport { isInteger } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'identity';\nvar dependencies = ['typed', 'config', 'matrix', 'BigNumber', 'DenseMatrix', 'SparseMatrix'];\nexport var createIdentity = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    matrix,\n    BigNumber,\n    DenseMatrix,\n    SparseMatrix\n  } = _ref;\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 number__BigNumber(rows) {\n      return _identity(rows, rows, config.matrix === 'Matrix' ? 'dense' : undefined);\n    },\n    'number | BigNumber, string': function number__BigNumber_string(rows, format) {\n      return _identity(rows, rows, format);\n    },\n    'number | BigNumber, number | BigNumber': function number__BigNumber_number__BigNumber(rows, cols) {\n      return _identity(rows, cols, config.matrix === 'Matrix' ? 'dense' : undefined);\n    },\n    'number | BigNumber, number | BigNumber, string': function number__BigNumber_number__BigNumber_string(rows, cols, format) {\n      return _identity(rows, cols, format);\n    },\n    Array: function Array(size) {\n      return _identityVector(size);\n    },\n    'Array, string': function Array_string(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 Matrix_string(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 = isBigNumber(rows) || isBigNumber(cols) ? BigNumber : null;\n    if (isBigNumber(rows)) rows = rows.toNumber();\n    if (isBigNumber(cols)) cols = cols.toNumber();\n    if (!isInteger(rows) || rows < 1) {\n      throw new Error('Parameters in function identity must be positive integers');\n    }\n    if (!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 = 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});", "import { arraySize as size } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'kron';\nvar dependencies = ['typed', 'matrix', 'multiplyScalar'];\nexport var createKron = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    multiplyScalar\n  } = _ref;\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 Matrix_Matrix(x, y) {\n      return matrix(_kron(x.toArray(), y.toArray()));\n    },\n    'Matrix, Array': function Matrix_Array(x, y) {\n      return matrix(_kron(x.toArray(), y));\n    },\n    'Array, Matrix': function Array_Matrix(x, y) {\n      return matrix(_kron(x, y.toArray()));\n    },\n    'Array, Array': _kron\n  });\n\n  /**\n   * Calculate the Kronecker product of two (1-dimensional) vectors,\n   * with no dimension checking\n   * @param {Array} a  First vector\n   * @param {Array} b  Second vector\n   * @returns {Array}  the 1-dimensional Kronecker product of a and b\n   * @private\n   */\n  function _kron1d(a, b) {\n    // TODO in core overhaul: would be faster to see if we can choose a\n    // particular implementation of multiplyScalar at the beginning,\n    // rather than re-dispatch for _every_ ordered pair of entries.\n    return a.flatMap(x => b.map(y => multiplyScalar(x, y)));\n  }\n\n  /**\n   * Calculate the Kronecker product of two possibly multidimensional arrays\n   * @param {Array} a  First array\n   * @param {Array} b  Second array\n   * @param {number} [d]  common dimension; if missing, compute and match args\n   * @returns {Array} Returns the Kronecker product of x and y\n   * @private\n     */\n  function _kron(a, b) {\n    var d = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : -1;\n    if (d < 0) {\n      var adim = size(a).length;\n      var bdim = size(b).length;\n      d = Math.max(adim, bdim);\n      while (adim++ < d) a = [a];\n      while (bdim++ < d) b = [b];\n    }\n    if (d === 1) return _kron1d(a, b);\n    return a.flatMap(aSlice => b.map(bSlice => _kron(aSlice, bSlice, d - 1)));\n  }\n});", "import { optimizeCallback } from '../../utils/optimizeCallback.js';\nimport { arraySize, broadcastSizes, broadcastTo, get, deepMap } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'map';\nvar dependencies = ['typed'];\nexport var createMap = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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,\n   *\n   * the callback is invoked with 2N + 1 arguments:\n   * the N values of the entry, the index at which that entry occurs, and the N full\n   * broadcasted matrix/array being traversed where N is the number of matrices being traversed.\n   * 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   *    math.map(x, y, ..., callback)\n   *\n   * Examples:\n   *\n   *    math.map([1, 2, 3], function(value) {\n   *      return value * value\n   *    })  // returns [1, 4, 9]\n   *    math.map([1, 2], [3, 4], function(a, b) {\n   *     return a + b\n   *    })  // returns [4, 6]\n   *\n   *    // The callback is normally called with three arguments:\n   *    //    callback(value, index, Array)\n   *    // If you want to call with only one argument, use:\n   *    math.map([1, 2, 3], x => math.format(x)) // returns ['1', '2', '3']\n   *    // It can also be called with 2N + 1 arguments: for N arrays\n   *    //    callback(value1, value2, index, BroadcastedArray1, BroadcastedArray2)\n   *\n   * History:\n   *\n   *    v0.13  Created\n   *    v1.1   Clone the indices on each callback in case callback mutates\n   *    v13.1  Support multiple inputs to the callback\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': _mapArray,\n    'Matrix, function': function Matrix_function(x, callback) {\n      return x.map(callback);\n    },\n    'Array|Matrix, Array|Matrix, ...Array|Matrix|function': (A, B, rest) => _mapMultiple([A, B, ...rest.slice(0, rest.length - 1)], rest[rest.length - 1])\n  });\n\n  /**\n  * Maps over multiple arrays or matrices.\n  *\n  * @param {Array<Array|Matrix>} Arrays - An array of arrays or matrices to map over.\n  * @param {function} multiCallback - The callback function to apply to each element.\n  * @throws {Error} If the last argument is not a callback function.\n  * @returns {Array|Matrix} A new array or matrix with each element being the result of the callback function.\n  *\n  * @example\n  * _mapMultiple([[1, 2, 3], [4, 5, 6]], (a, b) => a + b); // Returns [5, 7, 9]\n  */\n  function _mapMultiple(Arrays, multiCallback) {\n    if (typeof multiCallback !== 'function') {\n      throw new Error('Last argument must be a callback function');\n    }\n    var firstArrayIsMatrix = Arrays[0].isMatrix;\n    var sizes = Arrays.map(M => M.isMatrix ? M.size() : arraySize(M));\n    var newSize = broadcastSizes(...sizes);\n    var numberOfArrays = Arrays.length;\n    var _get = firstArrayIsMatrix ? (matrix, idx) => matrix.get(idx) : get;\n    var firstValues = Arrays.map((collection, i) => {\n      var firstIndex = sizes[i].map(() => 0);\n      return collection.isMatrix ? collection.get(firstIndex) : get(collection, firstIndex);\n    });\n    var callbackArgCount = typed.isTypedFunction(multiCallback) ? _getTypedCallbackArgCount(multiCallback, firstValues, newSize.map(() => 0), Arrays) : _getCallbackArgCount(multiCallback, numberOfArrays);\n    if (callbackArgCount < 2) {\n      var _callback = _getLimitedCallback(callbackArgCount, multiCallback, null);\n      return mapMultiple(Arrays, _callback);\n    }\n    var broadcastedArrays = firstArrayIsMatrix ? Arrays.map(M => M.isMatrix ? M.create(broadcastTo(M.toArray(), newSize), M.datatype()) : Arrays[0].create(broadcastTo(M.valueOf(), newSize))) : Arrays.map(M => M.isMatrix ? broadcastTo(M.toArray(), newSize) : broadcastTo(M, newSize));\n    var callback = _getLimitedCallback(callbackArgCount, multiCallback, broadcastedArrays);\n    var broadcastedArraysCallback = (x, idx) => callback([x, ...broadcastedArrays.slice(1).map(array => _get(array, idx))], idx);\n    if (firstArrayIsMatrix) {\n      return broadcastedArrays[0].map(broadcastedArraysCallback);\n    } else {\n      return _mapArray(broadcastedArrays[0], broadcastedArraysCallback);\n    }\n  }\n  function mapMultiple(collections, callback) {\n    // collections can be matrices or arrays\n    // callback must be a function of the form (collections, [index])\n    var firstCollection = collections[0];\n    var arrays = collections.map(collection => collection.isMatrix ? collection.valueOf() : collection);\n    var sizes = collections.map(collection => collection.isMatrix ? collection.size() : arraySize(collection));\n    var finalSize = broadcastSizes(...sizes);\n    // the offset means for each initial array, how much smaller is it than the final size\n    var offsets = sizes.map(size => finalSize.length - size.length);\n    var maxDepth = finalSize.length - 1;\n    var callbackUsesIndex = callback.length > 1;\n    var index = callbackUsesIndex ? [] : null;\n    var resultsArray = iterate(arrays, 0);\n    if (firstCollection.isMatrix) {\n      var resultsMatrix = firstCollection.create();\n      resultsMatrix._data = resultsArray;\n      resultsMatrix._size = finalSize;\n      return resultsMatrix;\n    } else {\n      return resultsArray;\n    }\n    function iterate(arrays) {\n      var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n      // each array can have different sizes\n      var currentDimensionSize = finalSize[depth];\n      var result = Array(currentDimensionSize);\n      if (depth < maxDepth) {\n        var _loop = function _loop(i) {\n          if (index) index[depth] = i;\n          // if there is an offset greater than the current dimension\n          // pass the array, if the size of the array is 1 pass the first\n          // element of the array\n          result[i] = iterate(arrays.map((array, arrayIndex) => offsets[arrayIndex] > depth ? array : array.length === 1 ? array[0] : array[i]), depth + 1);\n        };\n        for (var i = 0; i < currentDimensionSize; i++) {\n          _loop(i);\n        }\n      } else {\n        var _loop2 = function _loop2(_i) {\n          if (index) index[depth] = _i;\n          result[_i] = callback(arrays.map(a => a.length === 1 ? a[0] : a[_i]), index ? index.slice() : undefined);\n        };\n        for (var _i = 0; _i < currentDimensionSize; _i++) {\n          _loop2(_i);\n        }\n      }\n      return result;\n    }\n  }\n\n  /**\n    * Creates a limited callback based on the argument pattern.\n    * @param {number} callbackArgCount - The argument pattern (0, 1, or 2)\n    * @param {Function} multiCallback - The original callback function\n    * @param {Array} broadcastedArrays - The broadcasted arrays (for case 2)\n    * @returns {Function} The limited callback function\n    */\n  function _getLimitedCallback(callbackArgCount, multiCallback, broadcastedArrays) {\n    switch (callbackArgCount) {\n      case 0:\n        return x => multiCallback(...x);\n      case 1:\n        return (x, idx) => multiCallback(...x, idx);\n      case 2:\n        return (x, idx) => multiCallback(...x, idx, ...broadcastedArrays);\n    }\n  }\n\n  /**\n     * Determines the argument pattern of a regular callback function.\n     * @param {Function} callback - The callback function to analyze\n     * @param {number} numberOfArrays - Number of arrays being processed\n     * @returns {number} 0 = values only, 1 = values + index, 2 = values + index + arrays\n     */\n  function _getCallbackArgCount(callback, numberOfArrays) {\n    var callbackStr = callback.toString();\n    // Check if the callback function uses `arguments`\n    if (/arguments/.test(callbackStr)) return 2;\n\n    // Extract the parameters of the callback function\n    var paramsStr = callbackStr.match(/\\(.*?\\)/);\n    // Check if the callback function uses rest parameters\n    if (/\\.\\.\\./.test(paramsStr)) return 2;\n    if (callback.length > numberOfArrays + 1) {\n      return 2;\n    }\n    if (callback.length === numberOfArrays + 1) {\n      return 1;\n    }\n    return 0;\n  }\n\n  /**\n  * Determines the argument pattern of a typed callback function.\n  * @param {Function} callback - The typed callback function to analyze\n  * @param {Array} values - Sample values for signature resolution\n  * @param {Array} idx - Sample index for signature resolution\n  * @param {Array} arrays - Sample arrays for signature resolution\n  * @returns {number} 0 = values only, 1 = values + index, 2 = values + index + arrays\n  */\n\n  function _getTypedCallbackArgCount(callback, values, idx, arrays) {\n    if (typed.resolve(callback, [...values, idx, ...arrays]) !== null) {\n      return 2;\n    }\n    if (typed.resolve(callback, [...values, idx]) !== null) {\n      return 1;\n    }\n    if (typed.resolve(callback, values) !== null) {\n      return 0;\n    }\n    // this should never happen\n    return 0;\n  }\n  /**\n  * Map for a multi dimensional array\n  * @param {Array} array\n  * @param {Function} callback\n  * @return {Array}\n  * @private\n  */\n  function _mapArray(array, callback) {\n    var fastCallback = optimizeCallback(callback, array, name);\n    return deepMap(array, fastCallback.fn, fastCallback.isUnary);\n  }\n});", "import { factory } from '../../utils/factory.js';\nimport { isInteger } from '../../utils/number.js';\nimport { isMatrix } from '../../utils/is.js';\nvar name = 'diff';\nvar dependencies = ['typed', 'matrix', 'subtract', 'number'];\nexport var createDiff = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    subtract,\n    number\n  } = _ref;\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 Array__Matrix(arr) {\n      // No dimension specified => assume dimension 0\n      if (isMatrix(arr)) {\n        return matrix(_diff(arr.toArray()));\n      } else {\n        return _diff(arr);\n      }\n    },\n    'Array | Matrix, number': function Array__Matrix_number(arr, dim) {\n      if (!isInteger(dim)) throw new RangeError('Dimension must be a whole number');\n      if (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', selfAn => (arr, dim) => selfAn(arr, number(dim))),\n    'Matrix, BigNumber': typed.referTo('Matrix,number', selfMn => (arr, dim) => selfMn(arr, number(dim)))\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 (isMatrix(arr)) {\n      arr = arr.toArray(); // Makes sure arrays like [ matrix([0, 1]), matrix([1, 0]) ] are processed properly\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(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 (isMatrix(obj1)) obj1 = obj1.toArray();\n    if (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    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});", "import { isBigNumber } from '../../utils/is.js';\nimport { isInteger } from '../../utils/number.js';\nimport { resize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'ones';\nvar dependencies = ['typed', 'config', 'matrix', 'BigNumber'];\nexport var createOnes = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    matrix,\n    BigNumber\n  } = _ref;\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 number__BigNumber__string(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 Array__Matrix_string(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 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 (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' || !isInteger(value) || value < 0) {\n        throw new Error('Parameters in function ones must be positive integers');\n      }\n    });\n  }\n});", "export function noBignumber() {\n  throw new Error('No \"bignumber\" implementation available');\n}\nexport function noFraction() {\n  throw new Error('No \"fraction\" implementation available');\n}\nexport function noMatrix() {\n  throw new Error('No \"matrix\" implementation available');\n}\nexport function noIndex() {\n  throw new Error('No \"index\" implementation available');\n}\nexport function noSubset() {\n  throw new Error('No \"matrix\" implementation available');\n}", "import { factory } from '../../utils/factory.js';\nimport { noBignumber, noMatrix } from '../../utils/noop.js';\nvar name = 'range';\nvar dependencies = ['typed', 'config', '?matrix', '?bignumber', 'equal', 'smaller', 'smallerEq', 'larger', 'largerEq', 'add', 'isZero', 'isPositive'];\nexport var createRange = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    matrix,\n    bignumber,\n    smaller,\n    smallerEq,\n    larger,\n    largerEq,\n    add,\n    isZero,\n    isPositive\n  } = _ref;\n  /**\n   * Create a matrix or array containing a range of values.\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 | bigint | BigNumber | Fraction | Unit}`\n   *   Start of the range\n   * - `end: number | bigint | BigNumber | Fraction | Unit`\n   *   End of the range, excluded by default, included when parameter includeEnd=true\n   * - `step: number | bigint | BigNumber | Fraction | Unit`\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   * The function returns a `DenseMatrix` when the library is configured with\n   * `config = { matrix: 'Matrix' }, and returns an Array otherwise.\n   * Note that the type of the returned values is taken from the type of the\n   * provided start/end value. If only one of these is a built-in `number` type,\n   * it will be promoted to the type of the other endpoint. However, in the case\n   * of Unit values, both endpoints must have compatible units, and the return\n   * value will have compatible units as well.\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   *     math.range(2, math.fraction(8,3), math.fraction(1,3)) // [fraction(2), fraction(7,3)]\n   *     math.range(math.unit(2, 'm'), math.unit(-3, 'm'), math.unit(-1, 'm')) // [2 m, 1 m, 0 m , -1 m, -2 m]\n   *\n   * See also:\n   *\n   *     ones, zeros, size, subset\n   *\n   * @param {*} args   Parameters describing the range's `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    string: _strRange,\n    'string, boolean': _strRange,\n    number: function number(oops) {\n      throw new TypeError(\"Too few arguments to function range(): \".concat(oops));\n    },\n    boolean: function boolean(oops) {\n      throw new TypeError(\"Unexpected type of argument 1 to function range(): \".concat(oops, \", number|bigint|BigNumber|Fraction\"));\n    },\n    'number, number': function number_number(start, end) {\n      return _out(_range(start, end, 1, false));\n    },\n    'number, number, number': function number_number_number(start, end, step) {\n      return _out(_range(start, end, step, false));\n    },\n    'number, number, boolean': function number_number_boolean(start, end, includeEnd) {\n      return _out(_range(start, end, 1, includeEnd));\n    },\n    'number, number, number, boolean': function number_number_number_boolean(start, end, step, includeEnd) {\n      return _out(_range(start, end, step, includeEnd));\n    },\n    // Handle bigints; if either limit is bigint, range should be too\n    'bigint, bigint|number': function bigint_bigintNumber(start, end) {\n      return _out(_range(start, end, 1n, false));\n    },\n    'number, bigint': function number_bigint(start, end) {\n      return _out(_range(BigInt(start), end, 1n, false));\n    },\n    'bigint, bigint|number, bigint|number': function bigint_bigintNumber_bigintNumber(start, end, step) {\n      return _out(_range(start, end, BigInt(step), false));\n    },\n    'number, bigint, bigint|number': function number_bigint_bigintNumber(start, end, step) {\n      return _out(_range(BigInt(start), end, BigInt(step), false));\n    },\n    'bigint, bigint|number, boolean': function bigint_bigintNumber_boolean(start, end, includeEnd) {\n      return _out(_range(start, end, 1n, includeEnd));\n    },\n    'number, bigint, boolean': function number_bigint_boolean(start, end, includeEnd) {\n      return _out(_range(BigInt(start), end, 1n, includeEnd));\n    },\n    'bigint, bigint|number, bigint|number, boolean': function bigint_bigintNumber_bigintNumber_boolean(start, end, step, includeEnd) {\n      return _out(_range(start, end, BigInt(step), includeEnd));\n    },\n    'number, bigint, bigint|number, boolean': function number_bigint_bigintNumber_boolean(start, end, step, includeEnd) {\n      return _out(_range(BigInt(start), end, BigInt(step), includeEnd));\n    },\n    'BigNumber, BigNumber': function BigNumber_BigNumber(start, end) {\n      var BigNumber = start.constructor;\n      return _out(_range(start, end, new BigNumber(1), false));\n    },\n    'BigNumber, BigNumber, BigNumber': function BigNumber_BigNumber_BigNumber(start, end, step) {\n      return _out(_range(start, end, step, false));\n    },\n    'BigNumber, BigNumber, boolean': function BigNumber_BigNumber_boolean(start, end, includeEnd) {\n      var BigNumber = start.constructor;\n      return _out(_range(start, end, new BigNumber(1), includeEnd));\n    },\n    'BigNumber, BigNumber, BigNumber, boolean': function BigNumber_BigNumber_BigNumber_boolean(start, end, step, includeEnd) {\n      return _out(_range(start, end, step, includeEnd));\n    },\n    'Fraction, Fraction': function Fraction_Fraction(start, end) {\n      return _out(_range(start, end, 1, false));\n    },\n    'Fraction, Fraction, Fraction': function Fraction_Fraction_Fraction(start, end, step) {\n      return _out(_range(start, end, step, false));\n    },\n    'Fraction, Fraction, boolean': function Fraction_Fraction_boolean(start, end, includeEnd) {\n      return _out(_range(start, end, 1, includeEnd));\n    },\n    'Fraction, Fraction, Fraction, boolean': function Fraction_Fraction_Fraction_boolean(start, end, step, includeEnd) {\n      return _out(_range(start, end, step, includeEnd));\n    },\n    'Unit, Unit, Unit': function Unit_Unit_Unit(start, end, step) {\n      return _out(_range(start, end, step, false));\n    },\n    'Unit, Unit, Unit, boolean': function Unit_Unit_Unit_boolean(start, end, step, includeEnd) {\n      return _out(_range(start, end, step, includeEnd));\n    }\n  });\n  function _out(arr) {\n    if (config.matrix === 'Matrix') {\n      return matrix ? matrix(arr) : 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    if (config.number === 'BigNumber') {\n      if (bignumber === undefined) {\n        noBignumber();\n      }\n      return _out(_range(bignumber(r.start), bignumber(r.end), bignumber(r.step)), includeEnd);\n    } else {\n      return _out(_range(r.start, r.end, r.step, includeEnd));\n    }\n  }\n\n  /**\n   * Create a range with numbers or BigNumbers\n   * @param {number | BigNumber | Unit} start\n   * @param {number | BigNumber | Unit} end\n   * @param {number | BigNumber | Unit} step\n   * @param {boolean} includeEnd\n   * @returns {Array} range\n   * @private\n   */\n  function _range(start, end, step, includeEnd) {\n    var array = [];\n    if (isZero(step)) throw new Error('Step must be non-zero');\n    var ongoing = isPositive(step) ? includeEnd ? smallerEq : smaller : includeEnd ? largerEq : larger;\n    var x = start;\n    while (ongoing(x, end)) {\n      array.push(x);\n      x = add(x, step);\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});", "import { reshape as arrayReshape } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'reshape';\nvar dependencies = ['typed', 'isInteger', 'matrix'];\nexport var createReshape = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    isInteger\n  } = _ref;\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 Matrix_Array(x, sizes) {\n      return x.reshape(sizes, true);\n    },\n    'Array, Array': function Array_Array(x, sizes) {\n      sizes.forEach(function (size) {\n        if (!isInteger(size)) {\n          throw new TypeError('Invalid size for dimension: ' + size);\n        }\n      });\n      return arrayReshape(x, sizes);\n    }\n  });\n});", "import { isBigNumber, isMatrix } from '../../utils/is.js';\nimport { DimensionError } from '../../error/DimensionError.js';\nimport { ArgumentsError } from '../../error/ArgumentsError.js';\nimport { isInteger } from '../../utils/number.js';\nimport { format } from '../../utils/string.js';\nimport { clone } from '../../utils/object.js';\nimport { resize as arrayResize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'resize';\nvar dependencies = ['config', 'matrix'];\nexport var createResize = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    config,\n    matrix\n  } = _ref;\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('resize', arguments.length, 2, 3);\n    }\n    if (isMatrix(size)) {\n      size = size.valueOf(); // get Array\n    }\n    if (isBigNumber(size[0])) {\n      // convert bignumbers to numbers\n      size = size.map(function (value) {\n        return !isBigNumber(value) ? value : value.toNumber();\n      });\n    }\n\n    // check x is a Matrix\n    if (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 clone(x);\n    } else {\n      // output an array/matrix\n      if (!Array.isArray(x)) {\n        x = [x];\n      }\n      x = clone(x);\n      var res = arrayResize(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(size.length, 1);\n    }\n    var len = size[0];\n    if (typeof len !== 'number' || !isInteger(len)) {\n      throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + 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});", "import { factory } from '../../utils/factory.js';\nimport { arraySize } from '../../utils/array.js';\nvar name = 'rotate';\nvar dependencies = ['typed', 'multiply', 'rotationMatrix'];\nexport var createRotate = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    multiply,\n    rotationMatrix\n  } = _ref;\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 Array__number__BigNumber__Complex__Unit(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 Matrix__number__BigNumber__Complex__Unit(w, theta) {\n      _validateSize(w, 2);\n      return multiply(rotationMatrix(theta), w);\n    },\n    'Array, number | BigNumber | Complex | Unit, Array | Matrix': function Array_number__BigNumber__Complex__Unit_Array__Matrix(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 Matrix_number__BigNumber__Complex__Unit_Array__Matrix(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) ? 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});", "import { isBigNumber } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'rotationMatrix';\nvar dependencies = ['typed', 'config', 'multiplyScalar', 'addScalar', 'unaryMinus', 'norm', 'matrix', 'BigNumber', 'DenseMatrix', 'SparseMatrix', 'cos', 'sin'];\nexport var createRotationMatrix = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    multiplyScalar,\n    addScalar,\n    unaryMinus,\n    norm,\n    BigNumber,\n    matrix,\n    DenseMatrix,\n    SparseMatrix,\n    cos,\n    sin\n  } = _ref;\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 number__BigNumber__Complex__Unit(theta) {\n      return _rotationMatrix2x2(theta, config.matrix === 'Matrix' ? 'dense' : undefined);\n    },\n    'number | BigNumber | Complex | Unit, string': function number__BigNumber__Complex__Unit_string(theta, format) {\n      return _rotationMatrix2x2(theta, format);\n    },\n    'number | BigNumber | Complex | Unit, Array': function number__BigNumber__Complex__Unit_Array(theta, v) {\n      var matrixV = matrix(v);\n      _validateVector(matrixV);\n      return _rotationMatrix3x3(theta, matrixV, undefined);\n    },\n    'number | BigNumber | Complex | Unit, Matrix': function number__BigNumber__Complex__Unit_Matrix(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 number__BigNumber__Complex__Unit_Array_string(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 number__BigNumber__Complex__Unit_Matrix_string(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 = 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((p, curr) => multiplyScalar(p, curr));\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 = 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});", "import { factory } from '../../utils/factory.js';\nimport { isMatrix } from '../../utils/is.js';\nimport { clone } from '../../utils/object.js';\nimport { validateIndex } from '../../utils/array.js';\nvar name = 'row';\nvar dependencies = ['typed', 'Index', 'matrix', 'range'];\nexport var createRow = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    Index,\n    matrix,\n    range\n  } = _ref;\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 Array_number(value, row) {\n      return _row(matrix(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    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    // once config.legacySubset just return result\n    return isMatrix(result) ? result : matrix([[result]]);\n  }\n});", "import { arraySize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'size';\nvar dependencies = ['typed'];\nexport var createSize = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Calculate the size of a matrix or scalar. Always returns an Array containing numbers.\n   *\n   * Note that in mathjs v14 and older, function size could return a Matrix depending on\n   * the input type and configuration.\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).toArray()) // 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} A vector with size of `x`.\n   */\n  return typed(name, {\n    Matrix: x => x.size(),\n    Array: arraySize,\n    string: x => [x.length],\n    // scalar\n    'number | Complex | BigNumber | Unit | boolean | null': _x => []\n  });\n});", "import { clone } from '../../utils/object.js';\nimport { squeeze as arraySqueeze } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'squeeze';\nvar dependencies = ['typed'];\nexport var createSqueeze = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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 arraySqueeze(clone(x));\n    },\n    Matrix: function Matrix(x) {\n      var res = arraySqueeze(x.toArray());\n      // FIXME: return the same type of matrix as the input\n      return Array.isArray(res) ? x.create(res, x.datatype()) : res;\n    },\n    any: function any(x) {\n      // scalar\n      return clone(x);\n    }\n  });\n});", "import { isIndex } from '../../utils/is.js';\nimport { clone } from '../../utils/object.js';\nimport { isEmptyIndex, validateIndex, validateIndexSourceSize } from '../../utils/array.js';\nimport { getSafeProperty, setSafeProperty } from '../../utils/customs.js';\nimport { DimensionError } from '../../error/DimensionError.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'subset';\nvar dependencies = ['typed', 'matrix', 'zeros', 'add'];\nexport var createSubset = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    zeros,\n    add\n  } = _ref;\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   *     math.subset(d, math.index([false, true], [0])) // returns [[3]]\n   *\n   *     // replace a subset\n   *     const e = []\n   *     const f = math.subset(e, math.index(0, [0, 2]), [5, 6])  // f = [[5, 0, 6]]\n   *     const g = math.subset(f, math.index(1, 1), 7, 0)         // g = [[5, 0, 6], [0, 7, 0]]\n   *     math.subset(g, math.index([false, true], 1), 8)          // returns [[5, 0, 6], [0, 8, 0]]\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\n  return typed(name, {\n    // get subset\n    'Matrix, Index': function Matrix_Index(value, index) {\n      if (isEmptyIndex(index)) {\n        return matrix();\n      }\n      validateIndexSourceSize(value, index);\n      return value.subset(index);\n    },\n    'Array, Index': typed.referTo('Matrix, Index', function (subsetRef) {\n      return function (value, index) {\n        var subsetResult = subsetRef(matrix(value), index);\n        return index.isScalar() ? subsetResult : subsetResult.valueOf();\n      };\n    }),\n    'Object, Index': _getObjectProperty,\n    'string, Index': _getSubstring,\n    // set subset\n    'Matrix, Index, any, any': function Matrix_Index_any_any(value, index, replacement, defaultValue) {\n      if (isEmptyIndex(index)) {\n        return value;\n      }\n      validateIndexSourceSize(value, index);\n      return value.clone().subset(index, _broadcastReplacement(replacement, index), defaultValue);\n    },\n    'Array, Index, any, any': typed.referTo('Matrix, Index, any, any', function (subsetRef) {\n      return function (value, index, replacement, defaultValue) {\n        var subsetResult = subsetRef(matrix(value), index, replacement, defaultValue);\n        return subsetResult.isMatrix ? subsetResult.valueOf() : subsetResult;\n      };\n    }),\n    'Array, Index, any': typed.referTo('Matrix, Index, any, any', function (subsetRef) {\n      return function (value, index, replacement) {\n        return subsetRef(matrix(value), index, replacement, undefined).valueOf();\n      };\n    }),\n    'Matrix, Index, any': typed.referTo('Matrix, Index, any, any', function (subsetRef) {\n      return function (value, index, replacement) {\n        return subsetRef(value, index, replacement, undefined);\n      };\n    }),\n    'string, Index, string': _setSubstring,\n    'string, Index, string, string': _setSubstring,\n    'Object, Index, any': _setObjectProperty\n  });\n\n  /**\n   * Broadcasts a replacment value to be the same size as index\n   * @param {number | BigNumber | Array | Matrix} replacement Replacement value to try to broadcast\n   * @param {*} index Index value\n   * @returns broadcasted replacement that matches the size of index\n   */\n\n  function _broadcastReplacement(replacement, index) {\n    if (typeof replacement === 'string') {\n      throw new Error('can\\'t boradcast a string');\n    }\n    if (index.isScalar()) {\n      return replacement;\n    }\n    var indexSize = index.size();\n    if (indexSize.every(d => d > 0)) {\n      try {\n        return add(replacement, zeros(indexSize));\n      } catch (error) {\n        return replacement;\n      }\n    } else {\n      return replacement;\n    }\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 */\nfunction _getSubstring(str, index) {\n  if (!isIndex(index)) {\n    // TODO: better error message\n    throw new TypeError('Index expected');\n  }\n  if (isEmptyIndex(index)) {\n    return '';\n  }\n  validateIndexSourceSize(Array.from(str), index);\n  if (index.size().length !== 1) {\n    throw new DimensionError(index.size().length, 1);\n  }\n\n  // validate whether the range is out of range\n  var strLen = str.length;\n  validateIndex(index.min()[0], strLen);\n  validateIndex(index.max()[0], strLen);\n  var range = index.dimension(0);\n  var substr = '';\n  function callback(v) {\n    substr += str.charAt(v);\n  }\n  if (Number.isInteger(range)) {\n    callback(range);\n  } else {\n    range.forEach(callback);\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 used 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 (isEmptyIndex(index)) {\n    return str;\n  }\n  validateIndexSourceSize(Array.from(str), index);\n  if (index.size().length !== 1) {\n    throw new 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 = Number.isInteger(range) ? 1 : range.size()[0];\n  if (len !== replacement.length) {\n    throw new DimensionError(range.size()[0], replacement.length);\n  }\n\n  // validate whether the range is out of range\n  var strLen = str.length;\n  validateIndex(index.min()[0]);\n  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  function callback(v, i) {\n    chars[v] = replacement.charAt(i[0]);\n  }\n  if (Number.isInteger(range)) {\n    callback(range, [0]);\n  } else {\n    range.forEach(callback);\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 (isEmptyIndex(index)) {\n    return undefined;\n  }\n  if (index.size().length !== 1) {\n    throw new 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 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 (isEmptyIndex(index)) {\n    return object;\n  }\n  if (index.size().length !== 1) {\n    throw new 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 = clone(object);\n  setSafeProperty(updated, key, replacement);\n  return updated;\n}", "import { clone } from '../../utils/object.js';\nimport { format } from '../../utils/string.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'transpose';\nvar dependencies = ['typed', 'matrix'];\nexport var createTranspose = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix\n  } = _ref;\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: x => transposeMatrix(matrix(x)).valueOf(),\n    Matrix: transposeMatrix,\n    any: clone // scalars\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: ' + 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: ' + 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] = 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] = 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});", "import { factory } from '../../utils/factory.js';\nvar name = 'ctranspose';\nvar dependencies = ['typed', 'transpose', 'conj'];\nexport var createCtranspose = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    transpose,\n    conj\n  } = _ref;\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});", "import { isBigNumber } from '../../utils/is.js';\nimport { isInteger } from '../../utils/number.js';\nimport { resize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'zeros';\nvar dependencies = ['typed', 'config', 'matrix', 'BigNumber'];\nexport var createZeros = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    matrix,\n    BigNumber\n  } = _ref;\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 number__BigNumber__string(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 Array__Matrix_string(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 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 (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' || !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?", "import { arraySize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'fft';\nvar dependencies = ['typed', 'matrix', 'addScalar', 'multiplyScalar', 'divideScalar', 'exp', 'tau', 'i', 'dotDivide', 'conj', 'pow', 'ceil', 'log2'];\nexport var createFft = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    addScalar,\n    multiplyScalar,\n    divideScalar,\n    exp,\n    tau,\n    i: I,\n    dotDivide,\n    conj,\n    pow,\n    ceil,\n    log2\n  } = _ref;\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.valueOf()), matrix.datatype());\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 = 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(slice => _ndFft(slice, size.slice(1))), 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 = arraySize(arr);\n    if (dim !== 0) return new Array(size[0]).fill(0).map((_, i) => _1dFft(arr[i], dim - 1));\n    if (size.length === 1) return _fft(arr);\n    function _transpose(arr) {\n      // Swap first 2 dimensions\n      var size = arraySize(arr);\n      return new Array(size[1]).fill(0).map((_, j) => new Array(size[0]).fill(0).map((_, i) => arr[i][j]));\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 = [...new Array(n).fill(0).map((_, i) => multiplyScalar(arr[i], chirp[n - 1 + i])), ...new Array(N2 - n).fill(0)];\n    var ichirp = [...new Array(n + n - 1).fill(0).map((_, i) => divideScalar(1, chirp[i])), ...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((_, i) => multiplyScalar(fftXp[i], fftIchirp[i]));\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 = [..._fft(arr.filter((_, i) => i % 2 === 0), len / 2), ..._fft(arr.filter((_, i) => i % 2 === 1), 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});", "import { arraySize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { isMatrix } from '../../utils/is.js';\nvar name = 'ifft';\nvar dependencies = ['typed', 'fft', 'dotDivide', 'conj'];\nexport var createIfft = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    fft,\n    dotDivide,\n    conj\n  } = _ref;\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 Array__Matrix(arr) {\n      var size = isMatrix(arr) ? arr.size() : arraySize(arr);\n      return dotDivide(conj(fft(conj(arr))), size.reduce((acc, curr) => acc * curr, 1));\n    }\n  });\n});", "function _typeof(o) {\n  \"@babel/helpers - typeof\";\n\n  return _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  }, _typeof(o);\n}\nexport { _typeof as default };", "import _typeof from \"./typeof.js\";\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}\nexport { toPrimitive as default };", "import _typeof from \"./typeof.js\";\nimport toPrimitive from \"./toPrimitive.js\";\nfunction toPropertyKey(t) {\n  var i = toPrimitive(t, \"string\");\n  return \"symbol\" == _typeof(i) ? i : i + \"\";\n}\nexport { toPropertyKey as default };", "import toPropertyKey from \"./toPropertyKey.js\";\nfunction _defineProperty(e, r, t) {\n  return (r = toPropertyKey(r)) in e ? Object.defineProperty(e, r, {\n    value: t,\n    enumerable: !0,\n    configurable: !0,\n    writable: !0\n  }) : e[r] = t, e;\n}\nexport { _defineProperty as default };", "import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nfunction ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }\nfunction _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }\nimport { isUnit, isNumber, isBigNumber } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'solveODE';\nvar dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'max', 'map', 'abs', 'isPositive', 'isNegative', 'larger', 'smaller', 'matrix', 'bignumber', 'unaryMinus'];\nexport var createSolveODE = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    add,\n    subtract,\n    multiply,\n    divide,\n    max,\n    map,\n    abs,\n    isPositive,\n    isNegative,\n    larger,\n    smaller,\n    matrix,\n    bignumber,\n    unaryMinus\n  } = _ref;\n  /**\n     * Numerical Integration of Ordinary Differential Equations\n     *\n     * Two variable step methods are provided:\n     * - \"RK23\": Bogacki\u2013Shampine method\n     * - \"RK45\": Dormand-Prince method RK5(4)7M (default)\n     *\n     * The arguments are expected as follows.\n     *\n     * - `func` should be the forcing function `f(t, y)`\n     * - `tspan` should be a vector of two numbers or units `[tStart, tEnd]`\n     * - `y0` the initial state values, should be a scalar or a flat array\n     * - `options` should be an object with the following information:\n     *   - `method` ('RK45'): ['RK23', 'RK45']\n     *   - `tol` (1e-3): Numeric tolerance of the method, the solver keeps the error estimates less than this value\n     *   - `firstStep`: Initial step size\n     *   - `minStep`: minimum step size of the method\n     *   - `maxStep`: maximum step size of the method\n     *   - `minDelta` (0.2): minimum ratio of change for the step\n     *   - `maxDelta` (5): maximum ratio of change for the step\n     *   - `maxIter` (1e4): maximum number of iterations\n     *\n     * The returned value is an object with `{t, y}` please note that even though `t` means time, it can represent any other independant variable like `x`:\n     * - `t` an array of size `[n]`\n     * - `y` the states array can be in two ways\n     *   - **if `y0` is a scalar:** returns an array-like of size `[n]`\n     *   - **if `y0` is a flat array-like of size [m]:** returns an array like of size `[n, m]`\n     *\n     * Syntax:\n     *\n     *     math.solveODE(func, tspan, y0)\n     *     math.solveODE(func, tspan, y0, options)\n     *\n     * Examples:\n     *\n     *     function func(t, y) {return y}\n     *     const tspan = [0, 4]\n     *     const y0 = 1\n     *     math.solveODE(func, tspan, y0)\n     *     math.solveODE(func, tspan, [1, 2])\n     *     math.solveODE(func, tspan, y0, { method:\"RK23\", maxStep:0.1 })\n     *\n     * See also:\n     *\n     *     derivative, simplifyCore\n     *\n     * @param {function} func The forcing function f(t,y)\n     * @param {Array | Matrix} tspan The time span\n     * @param {number | BigNumber | Unit | Array | Matrix} y0 The initial value\n     * @param {Object} [options] Optional configuration options\n     * @return {Object} Return an object with t and y values as arrays\n     */\n\n  function _rk(butcherTableau) {\n    // generates an adaptive runge kutta method from it's butcher tableau\n\n    return function (f, tspan, y0, options) {\n      // adaptive runge kutta methods\n      var wrongTSpan = !(tspan.length === 2 && (tspan.every(isNumOrBig) || tspan.every(isUnit)));\n      if (wrongTSpan) {\n        throw new Error('\"tspan\" must be an Array of two numeric values or two units [tStart, tEnd]');\n      }\n      var t0 = tspan[0]; // initial time\n      var tf = tspan[1]; // final time\n      var isForwards = larger(tf, t0);\n      var firstStep = options.firstStep;\n      if (firstStep !== undefined && !isPositive(firstStep)) {\n        throw new Error('\"firstStep\" must be positive');\n      }\n      var maxStep = options.maxStep;\n      if (maxStep !== undefined && !isPositive(maxStep)) {\n        throw new Error('\"maxStep\" must be positive');\n      }\n      var minStep = options.minStep;\n      if (minStep && isNegative(minStep)) {\n        throw new Error('\"minStep\" must be positive or zero');\n      }\n      var timeVars = [t0, tf, firstStep, minStep, maxStep].filter(x => x !== undefined);\n      if (!(timeVars.every(isNumOrBig) || timeVars.every(isUnit))) {\n        throw new Error('Inconsistent type of \"t\" dependant variables');\n      }\n      var steps = 1; // divide time in this number of steps\n      var tol = options.tol ? options.tol : 1e-4; // define a tolerance (must be an option)\n      var minDelta = options.minDelta ? options.minDelta : 0.2;\n      var maxDelta = options.maxDelta ? options.maxDelta : 5;\n      var maxIter = options.maxIter ? options.maxIter : 10000; // stop inifite evaluation if something goes wrong\n      var hasBigNumbers = [t0, tf, ...y0, maxStep, minStep].some(isBigNumber);\n      var [a, c, b, bp] = hasBigNumbers ? [bignumber(butcherTableau.a), bignumber(butcherTableau.c), bignumber(butcherTableau.b), bignumber(butcherTableau.bp)] : [butcherTableau.a, butcherTableau.c, butcherTableau.b, butcherTableau.bp];\n      var h = firstStep ? isForwards ? firstStep : unaryMinus(firstStep) : divide(subtract(tf, t0), steps); // define the first step size\n      var t = [t0]; // start the time array\n      var y = [y0]; // start the solution array\n\n      var deltaB = subtract(b, bp); // b - bp\n\n      var n = 0;\n      var iter = 0;\n      var ongoing = _createOngoing(isForwards);\n      var trimStep = _createTrimStep(isForwards);\n      // iterate unitil it reaches either the final time or maximum iterations\n      while (ongoing(t[n], tf)) {\n        var k = [];\n\n        // trim the time step so that it doesn't overshoot\n        h = trimStep(t[n], tf, h);\n\n        // calculate the first value of k\n        k.push(f(t[n], y[n]));\n\n        // calculate the rest of the values of k\n        for (var i = 1; i < c.length; ++i) {\n          k.push(f(add(t[n], multiply(c[i], h)), add(y[n], multiply(h, a[i], k))));\n        }\n\n        // estimate the error by comparing solutions of different orders\n        var TE = max(abs(map(multiply(deltaB, k), X => isUnit(X) ? X.value : X)));\n        if (TE < tol && tol / TE > 1 / 4) {\n          // push solution if within tol\n          t.push(add(t[n], h));\n          y.push(add(y[n], multiply(h, b, k)));\n          n++;\n        }\n\n        // estimate the delta value that will affect the step size\n        var delta = 0.84 * (tol / TE) ** (1 / 5);\n        if (smaller(delta, minDelta)) {\n          delta = minDelta;\n        } else if (larger(delta, maxDelta)) {\n          delta = maxDelta;\n        }\n        delta = hasBigNumbers ? bignumber(delta) : delta;\n        h = multiply(h, delta);\n        if (maxStep && larger(abs(h), maxStep)) {\n          h = isForwards ? maxStep : unaryMinus(maxStep);\n        } else if (minStep && smaller(abs(h), minStep)) {\n          h = isForwards ? minStep : unaryMinus(minStep);\n        }\n        iter++;\n        if (iter > maxIter) {\n          throw new Error('Maximum number of iterations reached, try changing options');\n        }\n      }\n      return {\n        t,\n        y\n      };\n    };\n  }\n  function _rk23(f, tspan, y0, options) {\n    // Bogacki\u2013Shampine method\n\n    // Define the butcher table\n    var a = [[], [1 / 2], [0, 3 / 4], [2 / 9, 1 / 3, 4 / 9]];\n    var c = [null, 1 / 2, 3 / 4, 1];\n    var b = [2 / 9, 1 / 3, 4 / 9, 0];\n    var bp = [7 / 24, 1 / 4, 1 / 3, 1 / 8];\n    var butcherTableau = {\n      a,\n      c,\n      b,\n      bp\n    };\n\n    // Solve an adaptive step size rk method\n    return _rk(butcherTableau)(f, tspan, y0, options);\n  }\n  function _rk45(f, tspan, y0, options) {\n    // Dormand Prince method\n\n    // Define the butcher tableau\n    var a = [[], [1 / 5], [3 / 40, 9 / 40], [44 / 45, -56 / 15, 32 / 9], [19372 / 6561, -25360 / 2187, 64448 / 6561, -212 / 729], [9017 / 3168, -355 / 33, 46732 / 5247, 49 / 176, -5103 / 18656], [35 / 384, 0, 500 / 1113, 125 / 192, -2187 / 6784, 11 / 84]];\n    var c = [null, 1 / 5, 3 / 10, 4 / 5, 8 / 9, 1, 1];\n    var b = [35 / 384, 0, 500 / 1113, 125 / 192, -2187 / 6784, 11 / 84, 0];\n    var bp = [5179 / 57600, 0, 7571 / 16695, 393 / 640, -92097 / 339200, 187 / 2100, 1 / 40];\n    var butcherTableau = {\n      a,\n      c,\n      b,\n      bp\n    };\n\n    // Solve an adaptive step size rk method\n    return _rk(butcherTableau)(f, tspan, y0, options);\n  }\n  function _solveODE(f, tspan, y0, opt) {\n    var method = opt.method ? opt.method : 'RK45';\n    var methods = {\n      RK23: _rk23,\n      RK45: _rk45\n    };\n    if (method.toUpperCase() in methods) {\n      var methodOptions = _objectSpread({}, opt); // clone the options object\n      delete methodOptions.method; // delete the method as it won't be needed\n      return methods[method.toUpperCase()](f, tspan, y0, methodOptions);\n    } else {\n      // throw an error indicating there is no such method\n      var methodsWithQuotes = Object.keys(methods).map(x => \"\\\"\".concat(x, \"\\\"\"));\n      // generates a string of methods like: \"BDF\", \"RK23\" and \"RK45\"\n      var availableMethodsString = \"\".concat(methodsWithQuotes.slice(0, -1).join(', '), \" and \").concat(methodsWithQuotes.slice(-1));\n      throw new Error(\"Unavailable method \\\"\".concat(method, \"\\\". Available methods are \").concat(availableMethodsString));\n    }\n  }\n  function _createOngoing(isForwards) {\n    // returns the correct function to test if it's still iterating\n    return isForwards ? smaller : larger;\n  }\n  function _createTrimStep(isForwards) {\n    var outOfBounds = isForwards ? larger : smaller;\n    return function (t, tf, h) {\n      var next = add(t, h);\n      return outOfBounds(next, tf) ? subtract(tf, t) : h;\n    };\n  }\n  function isNumOrBig(x) {\n    // checks if it's a number or bignumber\n    return isBigNumber(x) || isNumber(x);\n  }\n  function _matrixSolveODE(f, T, y0, options) {\n    // receives matrices and returns matrices\n    var sol = _solveODE(f, T.toArray(), y0.toArray(), options);\n    return {\n      t: matrix(sol.t),\n      y: matrix(sol.y)\n    };\n  }\n  return typed('solveODE', {\n    'function, Array, Array, Object': _solveODE,\n    'function, Matrix, Matrix, Object': _matrixSolveODE,\n    'function, Array, Array': (f, T, y0) => _solveODE(f, T, y0, {}),\n    'function, Matrix, Matrix': (f, T, y0) => _matrixSolveODE(f, T, y0, {}),\n    'function, Array, number | BigNumber | Unit': (f, T, y0) => {\n      var sol = _solveODE(f, T, [y0], {});\n      return {\n        t: sol.t,\n        y: sol.y.map(Y => Y[0])\n      };\n    },\n    'function, Matrix, number | BigNumber | Unit': (f, T, y0) => {\n      var sol = _solveODE(f, T.toArray(), [y0], {});\n      return {\n        t: matrix(sol.t),\n        y: matrix(sol.y.map(Y => Y[0]))\n      };\n    },\n    'function, Array, number | BigNumber | Unit, Object': (f, T, y0, options) => {\n      var sol = _solveODE(f, T, [y0], options);\n      return {\n        t: sol.t,\n        y: sol.y.map(Y => Y[0])\n      };\n    },\n    'function, Matrix, number | BigNumber | Unit, Object': (f, T, y0, options) => {\n      var sol = _solveODE(f, T.toArray(), [y0], options);\n      return {\n        t: matrix(sol.t),\n        y: matrix(sol.y.map(Y => Y[0]))\n      };\n    }\n  });\n});", "/* eslint-disable no-loss-of-precision */\n\nimport { deepMap } from '../../utils/collection.js';\nimport { sign } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'erf';\nvar dependencies = ['typed'];\nexport var createErf = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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   * See also:\n   *    zeta\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 sign(x);\n      }\n      if (y <= THRESH) {\n        return sign(x) * erf1(y);\n      }\n      if (y <= 4.0) {\n        return sign(x) * (1 - erfc2(y));\n      }\n      return sign(x) * (1 - erfc3(y));\n    },\n    'Array | Matrix': typed.referToSelf(self => n => deepMap(n, self))\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 */\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);", "import { factory } from '../../utils/factory.js';\nvar name = 'zeta';\nvar dependencies = ['typed', 'config', 'multiply', 'pow', 'divide', 'factorial', 'equal', 'smallerEq', 'isBounded', 'isNegative', 'gamma', 'sin', 'subtract', 'add', '?Complex', '?BigNumber', 'pi'];\nexport var createZeta = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    multiply,\n    pow,\n    divide,\n    factorial,\n    equal,\n    smallerEq,\n    isBounded,\n    isNegative,\n    gamma,\n    sin,\n    subtract,\n    add,\n    Complex,\n    BigNumber: _BigNumber,\n    pi\n  } = _ref;\n  /**\n   * Compute the Riemann Zeta function of a value using an infinite series for\n   * all of the complex plane using Riemann's Functional equation.\n   *\n   * Based off the paper by Xavier Gourdon and Pascal Sebah\n   * ( http://numbers.computation.free.fr/Constants/Miscellaneous/zetaevaluations.pdf )\n   *\n   * Implementation and slight modification by Anik Patel\n   *\n   * Note: the implementation is accurate up to about 6 digits.\n   *\n   * Syntax:\n   *\n   *    math.zeta(n)\n   *\n   * Examples:\n   *\n   *    math.zeta(5)       // returns 1.0369277551433895\n   *    math.zeta(-0.5)    // returns -0.2078862249773449\n   *    math.zeta(math.i)  // returns 0.0033002236853253153 - 0.4181554491413212i\n   *\n   * See also:\n   *    erf\n   *\n   * @param {number | Complex | BigNumber} s   A Real, Complex or BigNumber parameter to the Riemann Zeta Function\n   * @return {number | Complex | BigNumber}    The Riemann Zeta of `s`\n   */\n  return typed(name, {\n    number: s => zetaNumeric(s, value => value, () => 20),\n    BigNumber: s => zetaNumeric(s, value => new _BigNumber(value), () => {\n      // relTol is for example 1e-12. Extract the positive exponent 12 from that\n      return Math.abs(Math.log10(config.relTol));\n    }),\n    Complex: zetaComplex\n  });\n\n  /**\n   * @param {number | BigNumber} s\n   * @param {(value: number) => number | BigNumber} createValue\n   * @param {(value: number | BigNumber | Complex) => number} determineDigits\n   * @returns {number | BigNumber}\n   */\n  function zetaNumeric(s, createValue, determineDigits) {\n    if (equal(s, 0)) {\n      return createValue(-0.5);\n    }\n    if (equal(s, 1)) {\n      return createValue(NaN);\n    }\n    if (!isBounded(s)) {\n      return isNegative(s) ? createValue(NaN) : createValue(1);\n    }\n    return zeta(s, createValue, determineDigits, s => s);\n  }\n\n  /**\n   * @param {Complex} s\n   * @returns {Complex}\n   */\n  function zetaComplex(s) {\n    if (s.re === 0 && s.im === 0) {\n      return new Complex(-0.5);\n    }\n    if (s.re === 1) {\n      return new Complex(NaN, NaN);\n    }\n    if (s.re === Infinity && s.im === 0) {\n      return new Complex(1);\n    }\n    if (s.im === Infinity || s.re === -Infinity) {\n      return new Complex(NaN, NaN);\n    }\n    return zeta(s, value => value, s => Math.round(1.3 * 15 + 0.9 * Math.abs(s.im)), s => s.re);\n  }\n\n  /**\n   * @param {number | BigNumber | Complex} s\n   * @param {(value: number) => number | BigNumber | Complex} createValue\n   * @param {(value: number | BigNumber | Complex) => number} determineDigits\n   * @param {(value: number | BigNumber | Complex) => number} getRe\n   * @returns {*|number}\n   */\n  function zeta(s, createValue, determineDigits, getRe) {\n    var n = determineDigits(s);\n    if (getRe(s) > -(n - 1) / 2) {\n      return f(s, createValue(n), createValue);\n    } else {\n      // Function Equation for reflection to x < 1\n      var c = multiply(pow(2, s), pow(createValue(pi), subtract(s, 1)));\n      c = multiply(c, sin(multiply(divide(createValue(pi), 2), s)));\n      c = multiply(c, gamma(subtract(1, s)));\n      return multiply(c, zeta(subtract(1, s), createValue, determineDigits, getRe));\n    }\n  }\n\n  /**\n   * Calculate a portion of the sum\n   * @param {number | BigNumber} k   a positive integer\n   * @param {number | BigNumber} n   a positive integer\n   * @return {number}    the portion of the sum\n   **/\n  function d(k, n) {\n    var S = k;\n    for (var j = k; smallerEq(j, n); j = add(j, 1)) {\n      var factor = divide(multiply(factorial(add(n, subtract(j, 1))), pow(4, j)), multiply(factorial(subtract(n, j)), factorial(multiply(2, j))));\n      S = add(S, factor);\n    }\n    return multiply(n, S);\n  }\n\n  /**\n   * Calculate the positive Riemann Zeta function\n   * @param {number} s   a real or complex number with s.re > 1\n   * @param {number} n   a positive integer\n   * @param {(number) => number | BigNumber | Complex} createValue\n   * @return {number}    Riemann Zeta of s\n   **/\n  function f(s, n, createValue) {\n    var c = divide(1, multiply(d(createValue(0), n), subtract(1, pow(2, subtract(1, s)))));\n    var S = createValue(0);\n    for (var k = createValue(1); smallerEq(k, n); k = add(k, 1)) {\n      S = add(S, divide(multiply((-1) ** (k - 1), d(k, n)), pow(k, s)));\n    }\n    return multiply(c, S);\n  }\n});", "import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'mode';\nvar dependencies = ['typed', 'isNaN', 'isNumeric'];\nexport var createMode = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    isNaN: mathIsNaN,\n    isNumeric\n  } = _ref;\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 = 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) && mathIsNaN(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});", "import { typeOf } from '../../../utils/is.js';\n\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 */\nexport function improveErrorMessage(err, fnName, value) {\n  // TODO: add information with the index (also needs transform in expression parser)\n  var details;\n  if (String(err).includes('Unexpected type')) {\n    details = arguments.length > 2 ? ' (type: ' + 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).includes('complex numbers')) {\n    details = arguments.length > 2 ? ' (type: ' + 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}", "import { deepForEach } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { safeNumberType } from '../../utils/number.js';\nimport { improveErrorMessage } from './utils/improveErrorMessage.js';\nvar name = 'prod';\nvar dependencies = ['typed', 'config', 'multiplyScalar', 'numeric'];\nexport var createProd = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    multiplyScalar,\n    numeric\n  } = _ref;\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 Array__Matrix_number__BigNumber(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    // 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    deepForEach(array, function (value) {\n      try {\n        prod = prod === undefined ? value : multiplyScalar(prod, value);\n      } catch (err) {\n        throw 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, safeNumberType(prod, config));\n    }\n    if (prod === undefined) {\n      throw new Error('Cannot calculate prod of an empty array');\n    }\n    return prod;\n  }\n});", "import { format as formatString } from '../../utils/string.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'format';\nvar dependencies = ['typed'];\nexport var createFormat = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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 | BigNumber`\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 | BigNumber`\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   * History:\n   *\n   *    v0.4     Created\n   *    v0.7     Round to a consistent number of digits (rather than decimals)\n   *    v0.15    Added multiple number notations and configurable precision\n   *    v3       Added support for JSON objects\n   *    v9       Added binary, hexadecimal, and octal notations\n   *    v10.4.2  Add `truncate` option\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: formatString,\n    'any, Object | function | number | BigNumber': formatString\n  });\n});", "import { factory } from '../../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 | BigNumber} value    Value to be stringified\n * @param {number | BigNumber} wordSize Optional word size (see `format`)\n * @return {string}         The formatted value\n */\nexport var createBin = factory(name, dependencies, _ref => {\n  var {\n    typed,\n    format\n  } = _ref;\n  return typed(name, {\n    'number | BigNumber': function number__BigNumber(n) {\n      return format(n, {\n        notation: 'bin'\n      });\n    },\n    'number | BigNumber, number | BigNumber': function number__BigNumber_number__BigNumber(n, wordSize) {\n      return format(n, {\n        notation: 'bin',\n        wordSize\n      });\n    }\n  });\n});", "import { factory } from '../../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 | BigNumber} value    Value to be stringified\n * @param {number | BigNumber} wordSize Optional word size (see `format`)\n * @return {string}         The formatted value\n */\n\nexport var createOct = factory(name, dependencies, _ref => {\n  var {\n    typed,\n    format\n  } = _ref;\n  return typed(name, {\n    'number | BigNumber': function number__BigNumber(n) {\n      return format(n, {\n        notation: 'oct'\n      });\n    },\n    'number | BigNumber, number | BigNumber': function number__BigNumber_number__BigNumber(n, wordSize) {\n      return format(n, {\n        notation: 'oct',\n        wordSize\n      });\n    }\n  });\n});", "import { factory } from '../../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 | BigNumber} value    Value to be stringified\n * @param {number | BigNumber} wordSize Optional word size (see `format`)\n * @return {string}         The formatted value\n */\nexport var createHex = factory(name, dependencies, _ref => {\n  var {\n    typed,\n    format\n  } = _ref;\n  return typed(name, {\n    'number | BigNumber': function number__BigNumber(n) {\n      return format(n, {\n        notation: 'hex'\n      });\n    },\n    'number | BigNumber, number | BigNumber': function number__BigNumber_number__BigNumber(n, wordSize) {\n      return format(n, {\n        notation: 'hex',\n        wordSize\n      });\n    }\n  });\n});", "export var printTemplate = /\\$([\\w.]+)/g;", "import { format } from '../../utils/string.js';\nimport { isString } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nimport { printTemplate } from '../../utils/print.js';\nvar name = 'print';\nvar dependencies = ['typed'];\nexport var createPrint = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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: '2013-03-23'\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 */\nfunction _print(template, values, options) {\n  return template.replace(printTemplate, function (original, key) {\n    var keys = key.split('.');\n    var value = values[keys.shift()];\n    if (value !== undefined && value.isMatrix) {\n      value = value.toArray();\n    }\n    while (keys.length && value !== undefined) {\n      var k = keys.shift();\n      value = k ? value[k] : value + '.';\n    }\n    if (value !== undefined) {\n      if (!isString(value)) {\n        return format(value, options);\n      } else {\n        return value;\n      }\n    }\n    return original;\n  });\n}", "import { factory } from '../../utils/factory.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nvar name = 'to';\nvar dependencies = ['typed', 'matrix', 'concat'];\nexport var createTo = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    concat\n  } = _ref;\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    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': (x, unit) => x.to(unit)\n  }, matrixAlgorithmSuite({\n    Ds: true\n  }));\n});", "import { factory } from '../../utils/factory.js';\nvar name = 'toBest';\nvar dependencies = ['typed'];\nexport var createToBest = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n   * Converts a unit to the most appropriate display unit.\n   * When no preferred units are provided, the function automatically find the best prefix.\n   * When preferred units are provided, it converts to\n   * the unit that gives a value closest to 1.\n   *\n   * Syntax:\n   *\n   *    math.toBest(unit)\n   *    math.toBest(unit, unitList)\n   *    math.toBest(unit, unitList, options)\n   *\n   * Where:\n   * - `unitList` is an optional array of preferred target units as string or Unit.\n   * - `options` is an optional object with options, formed as follows:\n   * - `offset`: number | BigNumber\n   *\n   * Examples:\n   *\n   *   math.unit(0.05, 'm').toBest(['cm', 'mm'])                 // returns Unit 5 cm\n   *   math.unit(2 / 3, 'cm').toBest()                           // returns Unit 0.6666666666666666 cm\n   *   math.unit(10, 'm').toBest(['mm', 'km'], { offset: 1.5 })  // returns Unit 10000 mm\n   *\n   * See also:\n   *\n   *    unit, to, format\n   *\n   * @param {Unit} x                          The unit to be converted\n   * @param {Array<string>} [unitList=[]]     Optional array of preferred target units\n   * @param {Object} [options]                Optional options object\n   * @return {Unit}                           Value converted to the best matching unit\n   */\n  return typed(name, {\n    Unit: x => x.toBest(),\n    'Unit, string': (x, unitList) => x.toBest(unitList.split(',')),\n    'Unit, string, Object': (x, unitList, options) => x.toBest(unitList.split(','), options),\n    'Unit, Array': (x, unitList) => x.toBest(unitList),\n    'Unit, Array, Object': (x, unitList, options) => x.toBest(unitList, options)\n  });\n});", "import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'isPrime';\nvar dependencies = ['typed'];\nexport var createIsPrime = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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 | bigint | 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 <= 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    bigint: function bigint(x) {\n      if (x <= 3n) {\n        return x > 1n;\n      }\n      if (x % 2n === 0n || x % 3n === 0n) {\n        return false;\n      }\n      for (var i = 5n; i * i <= x; i += 6n) {\n        if (x % i === 0n || x % (i + 2n) === 0n) {\n          return false;\n        }\n      }\n      return true;\n    },\n    BigNumber: function BigNumber(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\u2013Rabin_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(x => x < 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(self => x => deepMap(x, self))\n  });\n});", "import { typeOf } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nimport { noBignumber, noFraction } from '../../utils/noop.js';\nvar name = 'numeric';\nvar dependencies = ['number', '?bignumber', '?fraction'];\nexport var createNumeric = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    number: _number,\n    bignumber,\n    fraction\n  } = _ref;\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: x => _number(x),\n    BigNumber: bignumber ? x => bignumber(x) : noBignumber,\n    bigint: x => BigInt(x),\n    Fraction: fraction ? x => fraction(x) : noFraction\n  };\n\n  /**\n   * Convert a numeric input to a specific numeric type: number, BigNumber, bigint, or Fraction.\n   *\n   * Syntax:\n   *\n   *    math.numeric(x)\n   *    math.numeric(value, outputType)\n   *\n   * Examples:\n   *\n   *    math.numeric('4')                           // returns 4\n   *    math.numeric('4', 'number')                 // returns 4\n   *    math.numeric('4', 'bigint')                 // returns 4n\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, bigint, string, format\n   *\n   * History:\n   *\n   *    v6       Created\n   *    v13      Added `bigint` support\n   *    v14.2.1  Prefer mathjs `bigint()` to built-in `BigInt()`\n   *\n   * @param {string | number | BigNumber | bigint | 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 | bigint | 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 = 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});", "import { factory } from '../../utils/factory.js';\nvar name = 'divideScalar';\nvar dependencies = ['typed', 'numeric'];\nexport var createDivideScalar = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    numeric\n  } = _ref;\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 | bigint | Fraction | Complex | Unit} x   Numerator\n   * @param  {number | BigNumber | bigint | Fraction | Complex} y          Denominator\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit}     Quotient, `x / y`\n   * @private\n   */\n  return typed(name, {\n    'number, number': function number_number(x, y) {\n      return x / y;\n    },\n    'Complex, Complex': function Complex_Complex(x, y) {\n      return x.div(y);\n    },\n    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {\n      return x.div(y);\n    },\n    'bigint, bigint': function bigint_bigint(x, y) {\n      return x / y;\n    },\n    'Fraction, Fraction': function Fraction_Fraction(x, y) {\n      return x.div(y);\n    },\n    'Unit, number | Complex | Fraction | BigNumber | Unit': (x, y) => x.divide(y),\n    'number | Fraction | Complex | BigNumber, Unit': (x, y) => y.divideInto(x)\n  });\n});", "import { factory } from '../../utils/factory.js';\nimport { isInteger } from '../../utils/number.js';\nimport { arraySize as size } from '../../utils/array.js';\nimport { powNumber } from '../../plain/number/index.js';\nvar name = 'pow';\nvar dependencies = ['typed', 'config', 'identity', 'multiply', 'matrix', 'inv', 'fraction', 'number', 'Complex'];\nexport var createPow = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    identity,\n    multiply,\n    matrix,\n    inv,\n    number,\n    fraction,\n    Complex\n  } = _ref;\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 | bigint | Complex | Unit | Array | Matrix} x  The base\n   * @param  {number | BigNumber | bigint | Complex} y                          The exponent\n   * @return {number | BigNumber | bigint | Complex | Array | Matrix} The value of `x` to the power `y`\n   */\n  return typed(name, {\n    'number, number': _pow,\n    'Complex, Complex': function Complex_Complex(x, y) {\n      return x.pow(y);\n    },\n    'BigNumber, BigNumber': function BigNumber_BigNumber(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    'bigint, bigint': (x, y) => x ** y,\n    'Fraction, Fraction': function Fraction_Fraction(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 Array_BigNumber(x, y) {\n      return _powArray(x, y.toNumber());\n    },\n    'Matrix, number': _powMatrix,\n    'Matrix, BigNumber': function Matrix_BigNumber(x, y) {\n      return _powMatrix(x, y.toNumber());\n    },\n    'Unit, number | BigNumber': function Unit_number__BigNumber(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 && !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 % 2n === 1n) {\n            return (yFrac.n % 2n === 0n ? 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 (isInteger(y) || x >= 0 || config.predictable) {\n      return 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 (!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 = size(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});", "import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { nearlyEqual, splitNumber } from '../../utils/number.js';\nimport { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';\nimport { roundNumber } from '../../plain/number/index.js';\nvar NO_INT = 'Number of decimals in function round must be an integer';\nvar name = 'round';\nvar dependencies = ['typed', 'config', 'matrix', 'equalScalar', 'zeros', 'BigNumber', 'DenseMatrix'];\nexport var createRound = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    matrix,\n    equalScalar,\n    zeros,\n    BigNumber: _BigNumber,\n    DenseMatrix\n  } = _ref;\n  var matAlgo11xS0s = createMatAlgo11xS0s({\n    typed,\n    equalScalar\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matAlgo14xDs = createMatAlgo14xDs({\n    typed\n  });\n  function toExponent(epsilon) {\n    return Math.abs(splitNumber(epsilon).exponent);\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   *    math.round(unit, valuelessUnit)\n   *    math.round(unit, n, valuelessUnit)\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   *    const unit = math.unit('3.241 cm')\n   *    const cm = math.unit('cm')\n   *    const mm = math.unit('mm')\n   *    math.round(unit, 1, cm)      // returns Unit 3.2 cm\n   *    math.round(unit, 1, mm)      // returns Unit 32.4 mm\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 | Unit | Array | Matrix} x  Value to be rounded\n   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals\n   * @param  {Unit} [valuelessUnit]                                        A valueless unit\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Rounded value\n   */\n  return typed(name, {\n    number: function number(x) {\n      // Handle round off errors by first rounding to relTol precision\n      var xEpsilon = roundNumber(x, toExponent(config.relTol));\n      var xSelected = nearlyEqual(x, xEpsilon, config.relTol, config.absTol) ? xEpsilon : x;\n      return roundNumber(xSelected);\n    },\n    'number, number': function number_number(x, n) {\n      // Same as number: unless user specifies more decimals than relTol\n      var epsilonExponent = toExponent(config.relTol);\n      if (n >= epsilonExponent) {\n        return roundNumber(x, n);\n      }\n      var xEpsilon = roundNumber(x, epsilonExponent);\n      var xSelected = nearlyEqual(x, xEpsilon, config.relTol, config.absTol) ? xEpsilon : x;\n      return roundNumber(xSelected, n);\n    },\n    'number, BigNumber': function number_BigNumber(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 Complex_number(x, n) {\n      if (n % 1) {\n        throw new TypeError(NO_INT);\n      }\n      return x.round(n);\n    },\n    'Complex, BigNumber': function Complex_BigNumber(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      // Handle round off errors by first rounding to relTol precision\n      var xEpsilon = new _BigNumber(x).toDecimalPlaces(toExponent(config.relTol));\n      var xSelected = bigNearlyEqual(x, xEpsilon, config.relTol, config.absTol) ? xEpsilon : x;\n      return xSelected.toDecimalPlaces(0);\n    },\n    'BigNumber, BigNumber': function BigNumber_BigNumber(x, n) {\n      if (!n.isInteger()) {\n        throw new TypeError(NO_INT);\n      }\n\n      // Same as BigNumber: unless user specifies more decimals than relTol\n      var epsilonExponent = toExponent(config.relTol);\n      if (n >= epsilonExponent) {\n        return x.toDecimalPlaces(n.toNumber());\n      }\n      var xEpsilon = x.toDecimalPlaces(epsilonExponent);\n      var xSelected = bigNearlyEqual(x, xEpsilon, config.relTol, config.absTol) ? xEpsilon : x;\n      return xSelected.toDecimalPlaces(n.toNumber());\n    },\n    // bigints can't be rounded\n    bigint: b => b,\n    'bigint, number': (b, _dummy) => b,\n    'bigint, BigNumber': (b, _dummy) => b,\n    Fraction: function Fraction(x) {\n      return x.round();\n    },\n    'Fraction, number': function Fraction_number(x, n) {\n      if (n % 1) {\n        throw new TypeError(NO_INT);\n      }\n      return x.round(n);\n    },\n    'Fraction, BigNumber': function Fraction_BigNumber(x, n) {\n      if (!n.isInteger()) {\n        throw new TypeError(NO_INT);\n      }\n      return x.round(n.toNumber());\n    },\n    'Unit, number, Unit': typed.referToSelf(self => function (x, n, unit) {\n      var valueless = x.toNumeric(unit);\n      return unit.multiply(self(valueless, n));\n    }),\n    'Unit, BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => self(x, n.toNumber(), unit)),\n    'Array | Matrix, number | BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => {\n      // deep map collection, skip zeros since round(0) = 0\n      return deepMap(x, value => self(value, n, unit), true);\n    }),\n    'Array | Matrix | Unit, Unit': typed.referToSelf(self => (x, unit) => self(x, 0, unit)),\n    'Array | Matrix': typed.referToSelf(self => x => {\n      // deep map collection, skip zeros since round(0) = 0\n      return deepMap(x, self, true);\n    }),\n    'SparseMatrix, number | BigNumber': typed.referToSelf(self => (x, n) => {\n      return matAlgo11xS0s(x, n, self, false);\n    }),\n    'DenseMatrix, number | BigNumber': typed.referToSelf(self => (x, n) => {\n      return matAlgo14xDs(x, n, self, false);\n    }),\n    'Array, number | BigNumber': typed.referToSelf(self => (x, n) => {\n      // use matrix implementation\n      return matAlgo14xDs(matrix(x), n, self, false).valueOf();\n    }),\n    'number | Complex | BigNumber | Fraction, SparseMatrix': typed.referToSelf(self => (x, n) => {\n      // check scalar is zero\n      if (equalScalar(x, 0)) {\n        // do not execute algorithm, result will be a zero matrix\n        return zeros(n.size(), n.storage());\n      }\n      return matAlgo12xSfs(n, x, self, true);\n    }),\n    'number | Complex | BigNumber | Fraction, DenseMatrix': typed.referToSelf(self => (x, n) => {\n      // check scalar is zero\n      if (equalScalar(x, 0)) {\n        // do not execute algorithm, result will be a zero matrix\n        return zeros(n.size(), n.storage());\n      }\n      return matAlgo14xDs(n, x, self, true);\n    }),\n    'number | Complex | BigNumber | Fraction, Array': typed.referToSelf(self => (x, n) => {\n      // use matrix implementation\n      return matAlgo14xDs(matrix(n), x, self, true).valueOf();\n    })\n  });\n});", "import { factory } from '../../utils/factory.js';\nimport { promoteLogarithm } from '../../utils/bigint.js';\nimport { logNumber } from '../../plain/number/index.js';\nvar name = 'log';\nvar dependencies = ['config', 'typed', 'typeOf', 'divideScalar', 'Complex'];\nvar nlg16 = Math.log(16);\nexport var createLog = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    typeOf,\n    config,\n    divideScalar,\n    Complex\n  } = _ref;\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   * History:\n   *\n   *    v0.0.2  Created\n   *    v0.2    Add optional base argument\n   *    v0.3    Handle Array input\n   *    v0.5    Handle Matrix input\n   *    v0.16   Handle BigNumber input\n   *    v0.21   Support negative BigNumbers\n   *    v11     Drop Array/Matrix support in favor of explicit map of\n   *            the scalar log function, to avoid confusion with the log\n   *            of a matrix\n   *    v14     Allow value and base to be Fractions, when the log is rational\n   *\n   * @param {number | BigNumber | Fraction | Complex} x\n   *            Value for which to calculate the logarithm.\n   * @param {number | BigNumber | Fraction | Complex} [base=e]\n   *            Optional base for the logarithm. If not provided, the natural\n   *            logarithm of `x` is calculated.\n   * @return {number | BigNumber | Fraction | Complex}\n   *            Returns the logarithm of `x`\n   */\n  function complexLog(c) {\n    return c.log();\n  }\n  function complexLogNumber(x) {\n    return complexLog(new Complex(x, 0));\n  }\n  return typed(name, {\n    number: function number(x) {\n      if (x >= 0 || config.predictable) {\n        return logNumber(x);\n      } else {\n        // negative value -> complex value computation\n        return complexLogNumber(x);\n      }\n    },\n    bigint: promoteLogarithm(nlg16, logNumber, config, complexLogNumber),\n    Complex: complexLog,\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 complexLogNumber(x.toNumber());\n      }\n    },\n    'any, any': typed.referToSelf(self => (x, base) => {\n      // calculate logarithm for a specified base, log(x, base)\n\n      if (typeOf(x) === 'Fraction' && typeOf(base) === 'Fraction') {\n        var result = x.log(base);\n        if (result !== null) {\n          return result;\n        }\n      }\n      return divideScalar(self(x), self(base));\n    })\n  });\n});", "import { factory } from '../../utils/factory.js';\nimport { deepMap } from '../../utils/collection.js';\nimport { log1p as _log1p } from '../../utils/number.js';\nvar name = 'log1p';\nvar dependencies = ['typed', 'config', 'divideScalar', 'log', 'Complex'];\nexport var createLog1p = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    divideScalar,\n    log,\n    Complex\n  } = _ref;\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 _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(self => x => deepMap(x, self)),\n    'any, any': typed.referToSelf(self => (x, base) => {\n      // calculate logarithm for a specified base, log1p(x, base)\n      return divideScalar(self(x), log(base));\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});", "import { factory } from '../../utils/factory.js';\nvar name = 'nthRoots';\nvar dependencies = ['config', 'typed', 'divideScalar', 'Complex'];\nexport var createNthRoots = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    divideScalar,\n    Complex\n  } = _ref;\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    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,\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   * Note that currently the precision of Complex numbers are limited\n   * to the precision of a 64-bit IEEE floating point, so even if the input\n   * is a BigNumber with greater precision, rounding to 64 bits will occur\n   * in computing the nth roots.\n   *\n   * Syntax:\n   *\n   *    math.nthRoots(x)\n   *    math.nthRoots(x, root)\n   *\n   * Examples:\n   *\n   *    math.nthRoots(1) // returns [ {re: 1, im: 0}, {re: -1, im: 0} ]\n   *\n   *    math.nthRoots(1, 3)\n   *    // Complex [1, \"-0.5+0.866025403784439i\", \"-0.5-0.866025403784439i\"]\n   *\n   * See also:\n   *\n   *    nthRoot, pow, sqrt\n   *\n   * History:\n   *\n   *    v1.1   Created\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});", "import { factory } from '../../utils/factory.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nvar name = 'dotPow';\nvar dependencies = ['typed', 'equalScalar', 'matrix', 'pow', 'DenseMatrix', 'concat', 'SparseMatrix'];\nexport var createDotPow = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equalScalar,\n    matrix,\n    pow,\n    DenseMatrix,\n    concat,\n    SparseMatrix\n  } = _ref;\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo07xSSf = createMatAlgo07xSSf({\n    typed,\n    SparseMatrix\n  });\n  var matAlgo11xS0s = createMatAlgo11xS0s({\n    typed,\n    equalScalar\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    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});", "import { factory } from '../../utils/factory.js';\nimport { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nvar name = 'dotDivide';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'divideScalar', 'DenseMatrix', 'concat', 'SparseMatrix'];\nexport var createDotDivide = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    divideScalar,\n    DenseMatrix,\n    concat,\n    SparseMatrix\n  } = _ref;\n  var matAlgo02xDS0 = createMatAlgo02xDS0({\n    typed,\n    equalScalar\n  });\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo07xSSf = createMatAlgo07xSSf({\n    typed,\n    SparseMatrix\n  });\n  var matAlgo11xS0s = createMatAlgo11xS0s({\n    typed,\n    equalScalar\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    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});", "import { isArray, isMatrix, isDenseMatrix, isSparseMatrix } from '../../../../utils/is.js';\nimport { arraySize } from '../../../../utils/array.js';\nimport { format } from '../../../../utils/string.js';\nexport function createSolveValidation(_ref) {\n  var {\n    DenseMatrix\n  } = _ref;\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: ' + 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: ' + format(mSize) + ')');\n    }\n    var data = [];\n    if (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,\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 (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,\n              size: [rows, 1],\n              datatype: b._datatype\n            });\n          }\n          return b;\n        }\n        if (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,\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 (isArray(b)) {\n      var bsize = 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,\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,\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}", "import { factory } from '../../../utils/factory.js';\nimport { createSolveValidation } from './utils/solveValidation.js';\nvar name = 'lsolve';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtractScalar', 'equalScalar', 'DenseMatrix'];\nexport var createLsolve = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    divideScalar,\n    multiplyScalar,\n    subtractScalar,\n    equalScalar,\n    DenseMatrix\n  } = _ref;\n  var solveValidation = createSolveValidation({\n    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 SparseMatrix_Array__Matrix(m, b) {\n      return _sparseForwardSubstitution(m, b);\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrix_Array__Matrix(m, b) {\n      return _denseForwardSubstitution(m, b);\n    },\n    'Array, Array | Matrix': function Array_Array__Matrix(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] = [subtractScalar(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] = [subtractScalar(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});", "import { factory } from '../../../utils/factory.js';\nimport { createSolveValidation } from './utils/solveValidation.js';\nvar name = 'usolve';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtractScalar', 'equalScalar', 'DenseMatrix'];\nexport var createUsolve = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    divideScalar,\n    multiplyScalar,\n    subtractScalar,\n    equalScalar,\n    DenseMatrix\n  } = _ref;\n  var solveValidation = createSolveValidation({\n    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 SparseMatrix_Array__Matrix(m, b) {\n      return _sparseBackwardSubstitution(m, b);\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrix_Array__Matrix(m, b) {\n      return _denseBackwardSubstitution(m, b);\n    },\n    'Array, Array | Matrix': function Array_Array__Matrix(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] = [subtractScalar(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] = [subtractScalar(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});", "import { factory } from '../../../utils/factory.js';\nimport { createSolveValidation } from './utils/solveValidation.js';\nvar name = 'lsolveAll';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtractScalar', 'equalScalar', 'DenseMatrix'];\nexport var createLsolveAll = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    divideScalar,\n    multiplyScalar,\n    subtractScalar,\n    equalScalar,\n    DenseMatrix\n  } = _ref;\n  var solveValidation = createSolveValidation({\n    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 SparseMatrix_Array__Matrix(m, b) {\n      return _sparseForwardSubstitution(m, b);\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrix_Array__Matrix(m, b) {\n      return _denseForwardSubstitution(m, b);\n    },\n    'Array, Array | Matrix': function Array_Array__Matrix(a, b) {\n      var m = matrix(a);\n      var R = _denseForwardSubstitution(m, b);\n      return R.map(r => r.valueOf());\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(e => e[0])];\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] = subtractScalar(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 = [...b];\n          bNew[i] = 1;\n          for (var _j = i + 1; _j < columns; _j++) {\n            bNew[_j] = subtractScalar(bNew[_j], M[_j][i]);\n          }\n          B.push(bNew);\n        }\n      }\n    }\n    return B.map(x => new DenseMatrix({\n      data: x.map(e => [e]),\n      size: [rows, 1]\n    }));\n  }\n  function _sparseForwardSubstitution(m, b_) {\n    // array of right-hand sides\n    var B = [solveValidation(m, b_, true)._data.map(e => e[0])];\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] = subtractScalar(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 = [...b];\n          bNew[i] = 1;\n          for (var _j3 = 0, _lastIndex2 = iIndices.length; _j3 < _lastIndex2; _j3++) {\n            var _J2 = iIndices[_j3];\n            bNew[_J2] = subtractScalar(bNew[_J2], iValues[_j3]);\n          }\n          B.push(bNew);\n        }\n      }\n    }\n    return B.map(x => new DenseMatrix({\n      data: x.map(e => [e]),\n      size: [rows, 1]\n    }));\n  }\n});", "import { factory } from '../../../utils/factory.js';\nimport { createSolveValidation } from './utils/solveValidation.js';\nvar name = 'usolveAll';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtractScalar', 'equalScalar', 'DenseMatrix'];\nexport var createUsolveAll = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    divideScalar,\n    multiplyScalar,\n    subtractScalar,\n    equalScalar,\n    DenseMatrix\n  } = _ref;\n  var solveValidation = createSolveValidation({\n    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 SparseMatrix_Array__Matrix(m, b) {\n      return _sparseBackwardSubstitution(m, b);\n    },\n    'DenseMatrix, Array | Matrix': function DenseMatrix_Array__Matrix(m, b) {\n      return _denseBackwardSubstitution(m, b);\n    },\n    'Array, Array | Matrix': function Array_Array__Matrix(a, b) {\n      var m = matrix(a);\n      var R = _denseBackwardSubstitution(m, b);\n      return R.map(r => r.valueOf());\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(e => e[0])];\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] = subtractScalar(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 = [...b];\n          bNew[i] = 1;\n          for (var _j = i - 1; _j >= 0; _j--) {\n            bNew[_j] = subtractScalar(bNew[_j], M[_j][i]);\n          }\n          B.push(bNew);\n        }\n      }\n    }\n    return B.map(x => new DenseMatrix({\n      data: x.map(e => [e]),\n      size: [rows, 1]\n    }));\n  }\n  function _sparseBackwardSubstitution(m, b_) {\n    // array of right-hand sides\n    var B = [solveValidation(m, b_, true)._data.map(e => e[0])];\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] = subtractScalar(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 = [...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] = subtractScalar(bNew[_J2], iValues[_j3]);\n          }\n          B.push(bNew);\n        }\n      }\n    }\n    return B.map(x => new DenseMatrix({\n      data: x.map(e => [e]),\n      size: [rows, 1]\n    }));\n  }\n});", "import { factory } from '../../../utils/factory.js';\nimport { DimensionError } from '../../../error/DimensionError.js';\nvar name = 'matAlgo08xS0Sid';\nvar dependencies = ['typed', 'equalScalar'];\nexport var createMatAlgo08xS0Sid = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equalScalar\n  } = _ref;\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   *          \u250C  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0\n   * C(i,j) = \u2524  A(i,j)       ; A(i,j) !== 0 && B(i,j) === 0\n   *          \u2514  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 || a._data === undefined ? a._datatype : a.getDataType();\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 || b._data === undefined ? b._datatype : b.getDataType();\n\n    // validate dimensions\n    if (asize.length !== bsize.length) {\n      throw new 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 && adt !== 'mixed') {\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: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    });\n  };\n});", "import { factory } from '../../utils/factory.js';\nexport var createUseMatrixForArrayScalar = /* #__PURE__ */factory('useMatrixForArrayScalar', ['typed', 'matrix'], _ref => {\n  var {\n    typed,\n    matrix\n  } = _ref;\n  return {\n    'Array, number': typed.referTo('DenseMatrix, number', selfDn => (x, y) => selfDn(matrix(x), y).valueOf()),\n    'Array, BigNumber': typed.referTo('DenseMatrix, BigNumber', selfDB => (x, y) => selfDB(matrix(x), y).valueOf()),\n    'number, Array': typed.referTo('number, DenseMatrix', selfnD => (x, y) => selfnD(x, matrix(y)).valueOf()),\n    'BigNumber, Array': typed.referTo('BigNumber, DenseMatrix', selfBD => (x, y) => selfBD(x, matrix(y)).valueOf())\n  };\n});", "import { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js';\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';\nimport { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js';\nimport { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js';\nimport { createMatAlgo08xS0Sid } from '../../type/matrix/utils/matAlgo08xS0Sid.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { createUseMatrixForArrayScalar } from './useMatrixForArrayScalar.js';\nimport { leftShiftNumber } from '../../plain/number/index.js';\nimport { leftShiftBigNumber } from '../../utils/bignumber/bitwise.js';\nvar name = 'leftShift';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix', 'concat'];\nexport var createLeftShift = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    zeros,\n    DenseMatrix,\n    concat\n  } = _ref;\n  var matAlgo01xDSid = createMatAlgo01xDSid({\n    typed\n  });\n  var matAlgo02xDS0 = createMatAlgo02xDS0({\n    typed,\n    equalScalar\n  });\n  var matAlgo08xS0Sid = createMatAlgo08xS0Sid({\n    typed,\n    equalScalar\n  });\n  var matAlgo10xSids = createMatAlgo10xSids({\n    typed,\n    DenseMatrix\n  });\n  var matAlgo11xS0s = createMatAlgo11xS0s({\n    typed,\n    equalScalar\n  });\n  var matAlgo14xDs = createMatAlgo14xDs({\n    typed\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    concat\n  });\n  var useMatrixForArrayScalar = createUseMatrixForArrayScalar({\n    typed,\n    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 | bigint | Array | Matrix} x Value to be shifted\n   * @param  {number | BigNumber | bigint} y Amount of shifts\n   * @return {number | BigNumber | bigint | Array | Matrix} `x` shifted left `y` times\n   */\n  return typed(name, {\n    'number, number': leftShiftNumber,\n    'BigNumber, BigNumber': leftShiftBigNumber,\n    'bigint, bigint': (x, y) => x << y,\n    'SparseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone();\n      }\n      return matAlgo11xS0s(x, y, self, false);\n    }),\n    'DenseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone();\n      }\n      return matAlgo14xDs(x, y, self, false);\n    }),\n    'number | BigNumber, SparseMatrix': typed.referToSelf(self => (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    'number | BigNumber, DenseMatrix': typed.referToSelf(self => (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  }, useMatrixForArrayScalar, matrixAlgorithmSuite({\n    SS: matAlgo08xS0Sid,\n    DS: matAlgo01xDSid,\n    SD: matAlgo02xDS0\n  }));\n});", "import { rightArithShiftBigNumber } from '../../utils/bignumber/bitwise.js';\nimport { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js';\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';\nimport { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js';\nimport { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js';\nimport { createMatAlgo08xS0Sid } from '../../type/matrix/utils/matAlgo08xS0Sid.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { createUseMatrixForArrayScalar } from './useMatrixForArrayScalar.js';\nimport { rightArithShiftNumber } from '../../plain/number/index.js';\nvar name = 'rightArithShift';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix', 'concat'];\nexport var createRightArithShift = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    zeros,\n    DenseMatrix,\n    concat\n  } = _ref;\n  var matAlgo01xDSid = createMatAlgo01xDSid({\n    typed\n  });\n  var matAlgo02xDS0 = createMatAlgo02xDS0({\n    typed,\n    equalScalar\n  });\n  var matAlgo08xS0Sid = createMatAlgo08xS0Sid({\n    typed,\n    equalScalar\n  });\n  var matAlgo10xSids = createMatAlgo10xSids({\n    typed,\n    DenseMatrix\n  });\n  var matAlgo11xS0s = createMatAlgo11xS0s({\n    typed,\n    equalScalar\n  });\n  var matAlgo14xDs = createMatAlgo14xDs({\n    typed\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    concat\n  });\n  var useMatrixForArrayScalar = createUseMatrixForArrayScalar({\n    typed,\n    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 | bigint | Array | Matrix} x Value to be shifted\n   * @param  {number | BigNumber | bigint} y Amount of shifts\n   * @return {number | BigNumber | bigint | Array | Matrix} `x` zero-filled shifted right `y` times\n   */\n  return typed(name, {\n    'number, number': rightArithShiftNumber,\n    'BigNumber, BigNumber': rightArithShiftBigNumber,\n    'bigint, bigint': (x, y) => x >> y,\n    'SparseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone();\n      }\n      return matAlgo11xS0s(x, y, self, false);\n    }),\n    'DenseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone();\n      }\n      return matAlgo14xDs(x, y, self, false);\n    }),\n    'number | BigNumber, SparseMatrix': typed.referToSelf(self => (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    'number | BigNumber, DenseMatrix': typed.referToSelf(self => (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  }, useMatrixForArrayScalar, matrixAlgorithmSuite({\n    SS: matAlgo08xS0Sid,\n    DS: matAlgo01xDSid,\n    SD: matAlgo02xDS0\n  }));\n});", "import { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js';\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';\nimport { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js';\nimport { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js';\nimport { createMatAlgo08xS0Sid } from '../../type/matrix/utils/matAlgo08xS0Sid.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { rightLogShiftNumber } from '../../plain/number/index.js';\nimport { createUseMatrixForArrayScalar } from './useMatrixForArrayScalar.js';\nvar name = 'rightLogShift';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix', 'concat'];\nexport var createRightLogShift = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    zeros,\n    DenseMatrix,\n    concat\n  } = _ref;\n  var matAlgo01xDSid = createMatAlgo01xDSid({\n    typed\n  });\n  var matAlgo02xDS0 = createMatAlgo02xDS0({\n    typed,\n    equalScalar\n  });\n  var matAlgo08xS0Sid = createMatAlgo08xS0Sid({\n    typed,\n    equalScalar\n  });\n  var matAlgo10xSids = createMatAlgo10xSids({\n    typed,\n    DenseMatrix\n  });\n  var matAlgo11xS0s = createMatAlgo11xS0s({\n    typed,\n    equalScalar\n  });\n  var matAlgo14xDs = createMatAlgo14xDs({\n    typed\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    concat\n  });\n  var useMatrixForArrayScalar = createUseMatrixForArrayScalar({\n    typed,\n    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': rightLogShiftNumber,\n    // 'BigNumber, BigNumber': ..., // TODO: implement BigNumber support for rightLogShift\n\n    'SparseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone();\n      }\n      return matAlgo11xS0s(x, y, self, false);\n    }),\n    'DenseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {\n      // check scalar\n      if (equalScalar(y, 0)) {\n        return x.clone();\n      }\n      return matAlgo14xDs(x, y, self, false);\n    }),\n    'number | BigNumber, SparseMatrix': typed.referToSelf(self => (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    'number | BigNumber, DenseMatrix': typed.referToSelf(self => (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  }, useMatrixForArrayScalar, matrixAlgorithmSuite({\n    SS: matAlgo08xS0Sid,\n    DS: matAlgo01xDSid,\n    SD: matAlgo02xDS0\n  }));\n});", "import { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js';\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';\nimport { createMatAlgo06xS0S0 } from '../../type/matrix/utils/matAlgo06xS0S0.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { andNumber } from '../../plain/number/index.js';\nvar name = 'and';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'not', 'concat'];\nexport var createAnd = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    zeros,\n    not,\n    concat\n  } = _ref;\n  var matAlgo02xDS0 = createMatAlgo02xDS0({\n    typed,\n    equalScalar\n  });\n  var matAlgo06xS0S0 = createMatAlgo06xS0S0({\n    typed,\n    equalScalar\n  });\n  var matAlgo11xS0s = createMatAlgo11xS0s({\n    typed,\n    equalScalar\n  });\n  var matAlgo14xDs = createMatAlgo14xDs({\n    typed\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    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 | bigint | Complex | Unit | Array | Matrix} x First value to check\n   * @param  {number | BigNumber | bigint | 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': andNumber,\n    'Complex, Complex': function Complex_Complex(x, y) {\n      return (x.re !== 0 || x.im !== 0) && (y.re !== 0 || y.im !== 0);\n    },\n    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {\n      return !x.isZero() && !y.isZero() && !x.isNaN() && !y.isNaN();\n    },\n    'bigint, bigint': andNumber,\n    'Unit, Unit': typed.referToSelf(self => (x, y) => self(x.value || 0, y.value || 0)),\n    'SparseMatrix, any': typed.referToSelf(self => (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    'DenseMatrix, any': typed.referToSelf(self => (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    'any, SparseMatrix': typed.referToSelf(self => (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    'any, DenseMatrix': typed.referToSelf(self => (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    'Array, any': typed.referToSelf(self => (x, y) => {\n      // use matrix implementation\n      return self(matrix(x), y).valueOf();\n    }),\n    'any, Array': typed.referToSelf(self => (x, y) => {\n      // use matrix implementation\n      return self(x, matrix(y)).valueOf();\n    })\n  }, matrixAlgorithmSuite({\n    SS: matAlgo06xS0S0,\n    DS: matAlgo02xDS0\n  }));\n});", "import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { nearlyEqual } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatAlgo05xSfSf } from '../../type/matrix/utils/matAlgo05xSfSf.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { createCompareUnits } from './compareUnits.js';\nvar name = 'compare';\nvar dependencies = ['typed', 'config', 'matrix', 'equalScalar', 'BigNumber', 'Fraction', 'DenseMatrix', 'concat'];\nexport var createCompare = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    equalScalar,\n    matrix,\n    BigNumber,\n    Fraction,\n    DenseMatrix,\n    concat\n  } = _ref;\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo05xSfSf = createMatAlgo05xSfSf({\n    typed,\n    equalScalar\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    concat\n  });\n  var compareUnits = createCompareUnits({\n    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 absTol and relTol. 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   * History:\n   *\n   *    v0.19  Created\n   *    v4     Changed to compare strings by numerical value\n   *    v13    Change to use separate relative and absolute tolerances\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | bigint | Fraction | Unit | string | Array | Matrix} y Second value to compare\n   * @return {number | BigNumber | bigint | 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,\n    config\n  }), {\n    'boolean, boolean': function boolean_boolean(x, y) {\n      return x === y ? 0 : x > y ? 1 : -1;\n    },\n    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {\n      return bigNearlyEqual(x, y, config.relTol, config.absTol) ? new BigNumber(0) : new BigNumber(x.cmp(y));\n    },\n    'bigint, bigint': function bigint_bigint(x, y) {\n      return x === y ? 0n : x > y ? 1n : -1n;\n    },\n    'Fraction, Fraction': function Fraction_Fraction(x, y) {\n      return new Fraction(x.compare(y));\n    },\n    'Complex, Complex': function Complex_Complex() {\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});\nexport var createCompareNumber = /* #__PURE__ */factory(name, ['typed', 'config'], _ref2 => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function number_number(x, y) {\n      return nearlyEqual(x, y, config.relTol, config.absTol) ? 0 : x > y ? 1 : -1;\n    }\n  });\n});", "import naturalSort from 'javascript-natural-sort';\nimport { isDenseMatrix, isSparseMatrix, typeOf } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'compareNatural';\nvar dependencies = ['typed', 'compare'];\nexport var createCompareNatural = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    compare\n  } = _ref;\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 relTol and absTol.\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   * History:\n   *\n   *     v15.2   Handle bigints\n   *     v3.14   Created\n   *\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 = typeOf(x);\n    var typeY = typeOf(y);\n    var c;\n\n    // numeric types\n    if ((typeX === 'number' || typeX === 'BigNumber' || typeX === 'Fraction' || typeX === 'bigint') && (typeY === 'number' || typeY === 'BigNumber' || typeY === 'Fraction' || typeY === 'bigint')) {\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 naturalSort(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 naturalSort(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 naturalSort(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 naturalSort(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 (isSparseMatrix(x) && isSparseMatrix(y)) {\n      return compareArrays(compareNatural, x.toJSON().values, y.toJSON().values);\n    }\n    if (isSparseMatrix(x)) {\n      // note: convert to array is expensive\n      return compareMatricesAndArrays(compareNatural, x.toArray(), y);\n    }\n    if (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 (isDenseMatrix(x)) {\n      return compareMatricesAndArrays(compareNatural, x.toJSON().data, y);\n    }\n    if (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(naturalSort);\n    keysY.sort(naturalSort);\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 */\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}", "import { compareText as _compareText } from '../../utils/string.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nvar name = 'compareText';\nvar dependencies = ['typed', 'matrix', 'concat'];\n_compareText.signature = 'any, any';\nexport var createCompareText = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    concat\n  } = _ref;\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    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, _compareText, matrixAlgorithmSuite({\n    elop: _compareText,\n    Ds: true\n  }));\n});\nexport var createCompareTextNumber = /* #__PURE__ */factory(name, ['typed'], _ref2 => {\n  var {\n    typed\n  } = _ref2;\n  return typed(name, _compareText);\n});", "import { factory } from '../../utils/factory.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nvar name = 'equal';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix', 'SparseMatrix'];\nexport var createEqual = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    DenseMatrix,\n    concat,\n    SparseMatrix\n  } = _ref;\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo07xSSf = createMatAlgo07xSSf({\n    typed,\n    SparseMatrix\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix\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 relTol and absTol. 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 false\n   *\n   *    const a = math.unit('500 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   *    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   * History:\n   *\n   *    v13    Handle bigints\n   *    v11.6  Support matrix broadcasting\n   *    v4     Compare strings by their numerical value\n   *    v0.24  Handle `null` and `undefined`\n   *    v0.23  Compare collections elementwise\n   *    v0.20  Compare floating-point numbers within epsilon, allowing roundoff\n   *    v0.2   Created\n   *\n   * @param  {number | BigNumber | bigint | boolean | Complex | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | bigint | 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,\n    equalScalar\n  }), matrixAlgorithmSuite({\n    elop: equalScalar,\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo12xSfs\n  }));\n});\nexport var createEqualNumber = factory(name, ['typed', 'equalScalar'], _ref2 => {\n  var {\n    typed,\n    equalScalar\n  } = _ref2;\n  return typed(name, {\n    'any, any': function any_any(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});", "import { factory } from '../../utils/factory.js';\nvar name = 'equalText';\nvar dependencies = ['typed', 'compareText', 'isZero'];\nexport var createEqualText = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    compareText,\n    isZero\n  } = _ref;\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 any_any(x, y) {\n      return isZero(compareText(x, y));\n    }\n  });\n});", "import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { nearlyEqual } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { createCompareUnits } from './compareUnits.js';\nvar name = 'smaller';\nvar dependencies = ['typed', 'config', 'bignumber', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];\nexport var createSmaller = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    bignumber,\n    matrix,\n    DenseMatrix,\n    concat,\n    SparseMatrix\n  } = _ref;\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo07xSSf = createMatAlgo07xSSf({\n    typed,\n    SparseMatrix\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    concat\n  });\n  var compareUnits = createCompareUnits({\n    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 relTol and absTol. 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 | bigint | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | bigint | 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  function bignumSmaller(x, y) {\n    return x.lt(y) && !bigNearlyEqual(x, y, config.relTol, config.absTol);\n  }\n  return typed(name, createSmallerNumber({\n    typed,\n    config\n  }), {\n    'boolean, boolean': (x, y) => x < y,\n    'BigNumber, BigNumber': bignumSmaller,\n    'bigint, bigint': (x, y) => x < y,\n    'Fraction, Fraction': (x, y) => x.compare(y) === -1,\n    'Fraction, BigNumber': function Fraction_BigNumber(x, y) {\n      return bignumSmaller(bignumber(x), y);\n    },\n    'BigNumber, Fraction': function BigNumber_Fraction(x, y) {\n      return bignumSmaller(x, bignumber(y));\n    },\n    'Complex, Complex': function Complex_Complex(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});\nexport var createSmallerNumber = /* #__PURE__ */factory(name, ['typed', 'config'], _ref2 => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function number_number(x, y) {\n      return x < y && !nearlyEqual(x, y, config.relTol, config.absTol);\n    }\n  });\n});", "import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { nearlyEqual } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { createCompareUnits } from './compareUnits.js';\nvar name = 'smallerEq';\nvar dependencies = ['typed', 'config', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];\nexport var createSmallerEq = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    matrix,\n    DenseMatrix,\n    concat,\n    SparseMatrix\n  } = _ref;\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo07xSSf = createMatAlgo07xSSf({\n    typed,\n    SparseMatrix\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    concat\n  });\n  var compareUnits = createCompareUnits({\n    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 relTol and absTol. 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 | bigint | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | bigint | 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,\n    config\n  }), {\n    'boolean, boolean': (x, y) => x <= y,\n    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {\n      return x.lte(y) || bigNearlyEqual(x, y, config.relTol, config.absTol);\n    },\n    'bigint, bigint': (x, y) => x <= y,\n    'Fraction, Fraction': (x, y) => x.compare(y) !== 1,\n    'Complex, Complex': function Complex_Complex() {\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});\nexport var createSmallerEqNumber = /* #__PURE__ */factory(name, ['typed', 'config'], _ref2 => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function number_number(x, y) {\n      return x <= y || nearlyEqual(x, y, config.relTol, config.absTol);\n    }\n  });\n});", "import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { nearlyEqual } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { createCompareUnits } from './compareUnits.js';\nvar name = 'larger';\nvar dependencies = ['typed', 'config', 'bignumber', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];\nexport var createLarger = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    bignumber,\n    matrix,\n    DenseMatrix,\n    concat,\n    SparseMatrix\n  } = _ref;\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo07xSSf = createMatAlgo07xSSf({\n    typed,\n    SparseMatrix\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    concat\n  });\n  var compareUnits = createCompareUnits({\n    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 relTol and absTol. 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 | bigint | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | bigint | 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  function bignumLarger(x, y) {\n    return x.gt(y) && !bigNearlyEqual(x, y, config.relTol, config.absTol);\n  }\n  return typed(name, createLargerNumber({\n    typed,\n    config\n  }), {\n    'boolean, boolean': (x, y) => x > y,\n    'BigNumber, BigNumber': bignumLarger,\n    'bigint, bigint': (x, y) => x > y,\n    'Fraction, Fraction': (x, y) => x.compare(y) === 1,\n    'Fraction, BigNumber': function Fraction_BigNumber(x, y) {\n      return bignumLarger(bignumber(x), y);\n    },\n    'BigNumber, Fraction': function BigNumber_Fraction(x, y) {\n      return bignumLarger(x, bignumber(y));\n    },\n    'Complex, Complex': function Complex_Complex() {\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});\nexport var createLargerNumber = /* #__PURE__ */factory(name, ['typed', 'config'], _ref2 => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function number_number(x, y) {\n      return x > y && !nearlyEqual(x, y, config.relTol, config.absTol);\n    }\n  });\n});", "import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';\nimport { nearlyEqual } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nimport { createCompareUnits } from './compareUnits.js';\nvar name = 'largerEq';\nvar dependencies = ['typed', 'config', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];\nexport var createLargerEq = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    matrix,\n    DenseMatrix,\n    concat,\n    SparseMatrix\n  } = _ref;\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo07xSSf = createMatAlgo07xSSf({\n    typed,\n    SparseMatrix\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    concat\n  });\n  var compareUnits = createCompareUnits({\n    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 relTol and absTol. 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 | bigint | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | bigint | 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,\n    config\n  }), {\n    'boolean, boolean': (x, y) => x >= y,\n    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {\n      return x.gte(y) || bigNearlyEqual(x, y, config.relTol, config.absTol);\n    },\n    'bigint, bigint': function bigint_bigint(x, y) {\n      return x >= y;\n    },\n    'Fraction, Fraction': (x, y) => x.compare(y) !== -1,\n    'Complex, Complex': function Complex_Complex() {\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});\nexport var createLargerEqNumber = /* #__PURE__ */factory(name, ['typed', 'config'], _ref2 => {\n  var {\n    typed,\n    config\n  } = _ref2;\n  return typed(name, {\n    'number, number': function number_number(x, y) {\n      return x >= y || nearlyEqual(x, y, config.relTol, config.absTol);\n    }\n  });\n});", "import { factory } from '../../utils/factory.js';\nvar name = 'deepEqual';\nvar dependencies = ['typed', 'equal'];\nexport var createDeepEqual = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    equal\n  } = _ref;\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   *    const a = [2, 5, 1]\n   *    const 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   * History:\n   *\n   *    v2     Handle Fractions\n   *    v0.2   Created\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 any_any(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});", "import { factory } from '../../utils/factory.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nvar name = 'unequal';\nvar dependencies = ['typed', 'config', 'equalScalar', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];\nexport var createUnequal = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    equalScalar,\n    matrix,\n    DenseMatrix,\n    concat,\n    SparseMatrix\n  } = _ref;\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo07xSSf = createMatAlgo07xSSf({\n    typed,\n    SparseMatrix\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    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 relTol and absTol. 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 true\n   *\n   *    const a = math.unit('500 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   *    math.unequal(c, d)           // returns [false, true, false]...\n   *    math.deepEqual(c, d)         // returns false\n   *\n   *    math.unequal(0, null)        // returns true\n   *\n   * See also:\n   *\n   *    equal, deepEqual, smaller, smallerEq, larger, largerEq, compare\n   *\n   * History:\n   *\n   *    v13    Handle bigints\n   *    v11.6  Support matrix broadcasting\n   *    v4     Compare strings by their numeric values\n   *    v0.24  Handle `null` and `undefined`\n   *    v0.2   Created\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,\n    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});\nexport var createUnequalNumber = factory(name, ['typed', 'equalScalar'], _ref2 => {\n  var {\n    typed,\n    equalScalar\n  } = _ref2;\n  return typed(name, {\n    'any, any': function any_any(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});", "import { isMatrix } from '../../utils/is.js';\nimport { isInteger } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'partitionSelect';\nvar dependencies = ['typed', 'isNumeric', 'isNaN', 'compare'];\nexport var createPartitionSelect = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    isNumeric,\n    isNaN: mathIsNaN,\n    compare\n  } = _ref;\n  var asc = compare;\n  var desc = (a, b) => -compare(a, b);\n\n  /**\n   * Partition-based selection of an array or 1D matrix.\n   * Will find the kth smallest value, and mutates the input array.\n   * Uses Quickselect.\n   *\n   * Syntax:\n   *\n   *    math.partitionSelect(x, k)\n   *    math.partitionSelect(x, k, compare)\n   *\n   * Examples:\n   *\n   *    math.partitionSelect([5, 10, 1], 2)                               // returns 10\n   *    math.partitionSelect(['C', 'B', 'A', 'D'], 1, 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 Array__Matrix_number(x, k) {\n      return _partitionSelect(x, k, asc);\n    },\n    'Array | Matrix, number, string': function Array__Matrix_number_string(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 (!isInteger(k) || k < 0) {\n      throw new Error('k must be a non-negative integer');\n    }\n    if (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]) && mathIsNaN(arr[i])) {\n        return arr[i]; // return NaN\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});", "import { arraySize as size } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'sort';\nvar dependencies = ['typed', 'matrix', 'compare', 'compareNatural'];\nexport var createSort = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    compare,\n    compareNatural\n  } = _ref;\n  var compareAsc = compare;\n  var compareDesc = (a, b) => -compare(a, b);\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 Array_function(x, _comparator) {\n      _arrayIsVector(x);\n      return x.sort(_comparator);\n    },\n    'Matrix, function': function Matrix_function(x, _comparator) {\n      _matrixIsVector(x);\n      return matrix(x.toArray().sort(_comparator), x.storage());\n    },\n    'Array, string': function Array_string(x, order) {\n      _arrayIsVector(x);\n      return x.sort(_comparator(order));\n    },\n    'Matrix, string': function Matrix_string(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 (size(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});", "import { deepForEach, reduce, containsCollections } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { safeNumberType } from '../../utils/number.js';\nimport { improveErrorMessage } from './utils/improveErrorMessage.js';\nvar name = 'max';\nvar dependencies = ['typed', 'config', 'numeric', 'larger', 'isNaN'];\nexport var createMax = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    numeric,\n    larger,\n    isNaN: mathIsNaN\n  } = _ref;\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 Array__Matrix_number__BigNumber(array, dim) {\n      return reduce(array, dim.valueOf(), _largest);\n    },\n    // max(a, b, c, d, ...)\n    '...': function _(args) {\n      if (containsCollections(args)) {\n        throw new TypeError('Scalar values expected in function max');\n      }\n      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 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    deepForEach(array, function (value) {\n      try {\n        if (mathIsNaN(value)) {\n          res = value;\n        } else if (res === undefined || larger(value, res)) {\n          res = value;\n        }\n      } catch (err) {\n        throw 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, safeNumberType(res, config));\n    }\n    return res;\n  }\n});", "import { containsCollections, deepForEach, reduce } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { safeNumberType } from '../../utils/number.js';\nimport { improveErrorMessage } from './utils/improveErrorMessage.js';\nvar name = 'min';\nvar dependencies = ['typed', 'config', 'numeric', 'smaller', 'isNaN'];\nexport var createMin = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    numeric,\n    smaller,\n    isNaN: mathIsNaN\n  } = _ref;\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 Array__Matrix_number__BigNumber(array, dim) {\n      return reduce(array, dim.valueOf(), _smallest);\n    },\n    // min(a, b, c, d, ...)\n    '...': function _(args) {\n      if (containsCollections(args)) {\n        throw new TypeError('Scalar values expected in function min');\n      }\n      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 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    deepForEach(array, function (value) {\n      try {\n        if (mathIsNaN(value)) {\n          min = value;\n        } else if (min === undefined || smaller(value, min)) {\n          min = value;\n        }\n      } catch (err) {\n        throw 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, safeNumberType(min, config));\n    }\n    return min;\n  }\n});", "import { isArray, isMatrix, isString, typeOf } from '../../utils/is.js';\nimport { clone } from '../../utils/object.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'ImmutableDenseMatrix';\nvar dependencies = ['smaller', 'DenseMatrix'];\nexport var createImmutableDenseMatrixClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    smaller,\n    DenseMatrix\n  } = _ref;\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 && !isString(datatype)) {\n      throw new Error('Invalid datatype: ' + datatype);\n    }\n    if (isMatrix(data) || 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 && isArray(data.data) && isArray(data.size)) {\n      // initialize fields from JSON representation\n      this._data = data.data;\n      this._size = data.size;\n      this._datatype = data.datatype;\n      this._min = typeof data.min !== 'undefined' ? data.min : null;\n      this._max = typeof data.max !== 'undefined' ? data.max : null;\n    } else if (data) {\n      // unsupported type\n      throw new TypeError('Unsupported type of data (' + 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 (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: clone(this._data),\n      size: 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});", "import { isArray, isMatrix, isRange, isNumber, isString } from '../../utils/is.js';\nimport { clone } from '../../utils/object.js';\nimport { isInteger } from '../../utils/number.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'Index';\nvar dependencies = ['ImmutableDenseMatrix', 'getMatrixDataType'];\nexport var createIndexClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    ImmutableDenseMatrix,\n    getMatrixDataType\n  } = _ref;\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   *     An Array with Booleans\n   *     A Matrix with the Set values\n   *     A Matrix with Booleans\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() {\n    if (!(this instanceof Index)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n    this._dimensions = [];\n    this._sourceSize = [];\n    this._isScalar = true;\n    for (var i = 0, ii = arguments.length; i < ii; i++) {\n      var arg = i < 0 || arguments.length <= i ? undefined : arguments[i];\n      var argIsArray = isArray(arg);\n      var argIsMatrix = isMatrix(arg);\n      var argType = typeof arg;\n      var sourceSize = null;\n      if (isRange(arg)) {\n        this._dimensions.push(arg);\n        this._isScalar = false;\n      } else if (argIsArray || argIsMatrix) {\n        // create matrix\n        var m = void 0;\n        this._isScalar = false;\n        if (getMatrixDataType(arg) === 'boolean') {\n          if (argIsArray) m = _createImmutableMatrix(_booleansArrayToNumbersForIndex(arg).valueOf());\n          if (argIsMatrix) m = _createImmutableMatrix(_booleansArrayToNumbersForIndex(arg._data).valueOf());\n          sourceSize = arg.valueOf().length;\n        } else {\n          m = _createImmutableMatrix(arg.valueOf());\n        }\n        this._dimensions.push(m);\n      } else if (argType === 'number') {\n        this._dimensions.push(arg);\n      } else if (argType === 'bigint') {\n        this._dimensions.push(Number(arg));\n      } else if (argType === '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, bigint, string, or Range');\n      }\n      this._sourceSize.push(sourceSize);\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 (!isNumber(arg[i]) || !isInteger(arg[i])) {\n        throw new TypeError('Index parameters must be positive integer numbers');\n      }\n    }\n    // create matrix\n    var matrix = new ImmutableDenseMatrix();\n    matrix._data = arg;\n    matrix._size = [arg.length];\n    return matrix;\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 = clone(this._dimensions);\n    index._isScalar = this._isScalar;\n    index._sourceSize = this._sourceSize;\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] = isString(d) || isNumber(d) ? 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] = isString(range) || isNumber(range) ? 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] = isString(range) || isNumber(range) ? 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    var _this$_dimensions$dim;\n    if (!isNumber(dim)) {\n      return null;\n    }\n    return (_this$_dimensions$dim = this._dimensions[dim]) !== null && _this$_dimensions$dim !== void 0 ? _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 && isString(this._dimensions[0]);\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(isString(dimension) || isNumber(dimension) ? 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 (isString(dimension)) {\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});\n\n/**\n * Receives an array of booleans and returns an array of Numbers for Index\n * @param {Array} booleanArrayIndex An array of booleans\n * @return {Array} A set of numbers ready for index\n */\nfunction _booleansArrayToNumbersForIndex(booleanArrayIndex) {\n  // gets an array of booleans and returns an array of numbers\n  var indexOfNumbers = [];\n  booleanArrayIndex.forEach((bool, idx) => {\n    if (bool) {\n      indexOfNumbers.push(idx);\n    }\n  });\n  return indexOfNumbers;\n}", "import { factory } from '../../utils/factory.js';\nvar name = 'FibonacciHeap';\nvar dependencies = ['smaller', 'larger'];\nexport var createFibonacciHeapClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    smaller,\n    larger\n  } = _ref;\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,\n      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});", "import { factory } from '../../utils/factory.js';\nvar name = 'Spa';\nvar dependencies = ['addScalar', 'equalScalar', 'FibonacciHeap'];\nexport var createSpaClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    addScalar,\n    equalScalar,\n    FibonacciHeap\n  } = _ref;\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});", "// (c) 2018, Mariusz Nowak\n// SPDX-License-Identifier: ISC\n// Derived from https://github.com/medikoo/lru-queue\nexport function 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 (!Object.prototype.hasOwnProperty.call(queue, ++base)) {/* empty */}\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 (!Object.prototype.hasOwnProperty.call(queue, ++base)) {/* empty */}\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}", "// function utils\n\nimport { lruQueue } from './lruQueue.js';\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 */\nexport function memoize(fn) {\n  var {\n    hasher,\n    limit\n  } = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  limit = limit == null ? Number.POSITIVE_INFINITY : limit;\n  hasher = hasher == null ? JSON.stringify : hasher;\n  return function memoize() {\n    if (typeof memoize.cache !== 'object') {\n      memoize.cache = {\n        values: new Map(),\n        lru: 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 */\nexport function 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,\n      res\n    });\n    return res;\n  };\n  memoize.cache = [];\n  return memoize;\n}", "import { memoize } from '../function.js';\n\n/**\n * Calculate BigNumber e\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns e\n */\nexport var createBigNumberE = memoize(function (BigNumber) {\n  return new BigNumber(1).exp();\n}, {\n  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 */\nexport var createBigNumberPhi = memoize(function (BigNumber) {\n  return new BigNumber(1).plus(new BigNumber(5).sqrt()).div(2);\n}, {\n  hasher\n});\n\n/**\n * Calculate BigNumber pi.\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns pi\n */\nexport var createBigNumberPi = memoize(function (BigNumber) {\n  return BigNumber.acos(-1);\n}, {\n  hasher\n});\n\n/**\n * Calculate BigNumber tau, tau = 2 * pi\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns tau\n */\nexport var createBigNumberTau = memoize(function (BigNumber) {\n  return createBigNumberPi(BigNumber).times(2);\n}, {\n  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 */\nfunction hasher(args) {\n  return args[0].precision;\n}", "import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport _extends from \"@babel/runtime/helpers/extends\";\nfunction ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }\nfunction _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }\nimport { isComplex, isUnit, typeOf } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nimport { memoize } from '../../utils/function.js';\nimport { endsWith } from '../../utils/string.js';\nimport { clone, hasOwnProperty } from '../../utils/object.js';\nimport { createBigNumberPi as createPi } from '../../utils/bignumber/constants.js';\nvar name = 'Unit';\nvar dependencies = ['?on', 'config', 'addScalar', 'subtractScalar', 'multiplyScalar', 'divideScalar', 'pow', 'abs', 'fix', 'round', 'equal', 'isNumeric', 'format', 'number', 'Complex', 'BigNumber', 'Fraction'];\nexport var createUnitClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    on,\n    config,\n    addScalar,\n    subtractScalar,\n    multiplyScalar,\n    divideScalar,\n    pow,\n    abs,\n    fix,\n    round,\n    equal,\n    isNumeric,\n    format,\n    number: _number,\n    Complex,\n    BigNumber: _BigNumber,\n    Fraction: _Fraction\n  } = _ref;\n  var toNumber = _number;\n  var fixPrefixDefault = false;\n  var skipAutomaticSimplificationDefault = true;\n\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) || isComplex(value))) {\n      throw new TypeError('First parameter in Unit constructor must be number, BigNumber, Fraction, Complex, or undefined');\n    }\n    this.fixPrefix = fixPrefixDefault; // 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 = skipAutomaticSimplificationDefault;\n    if (valuelessUnit === undefined) {\n      this.units = [];\n      this.dimensions = BASE_DIMENSIONS.map(x => 0);\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 (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(u => _extends({}, u));\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\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 = 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 (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 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   * @private\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(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(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 = memoize(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 (hasOwnProperty(UNITS, str)) {\n      var unit = UNITS[str];\n      var prefix = unit.prefixes[''];\n      return {\n        unit,\n        prefix\n      };\n    }\n    for (var _name in UNITS) {\n      if (hasOwnProperty(UNITS, _name)) {\n        if (endsWith(str, _name)) {\n          var _unit = UNITS[_name];\n          var prefixLen = str.length - _name.length;\n          var prefixName = str.substring(0, prefixLen);\n          var _prefix = 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: args => args[0],\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_UNIT | 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 = 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(one(other.value)) : this.value;\n      var valOther = other.value === null ? other._normalize(one(this.value)) : other.value;\n      res.value = multiplyScalar(valThis, valOther);\n    } else {\n      res.value = null;\n    }\n    if (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 = 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(one(other.value)) : this.value;\n      var valOther = other.value === null ? other._normalize(one(this.value)) : other.value;\n      res.value = divideScalar(valThis, valOther);\n    } else {\n      res.value = null;\n    }\n    if (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   * Create a value one with the numeric type of `typeOfValue`.\n   * For example, `one(new BigNumber(3))` returns `BigNumber(1)`\n   * @param {number | Fraction | BigNumber} typeOfValue\n   * @returns {number | Fraction | BigNumber}\n   */\n  function one(typeOfValue) {\n    // TODO: this is a workaround to prevent the following BigNumber conversion error from throwing:\n    //  \"TypeError: Cannot implicitly convert a number with >15 significant digits to BigNumber\"\n    //  see https://github.com/josdejong/mathjs/issues/3450\n    //      https://github.com/josdejong/mathjs/pull/3375\n    var convert = Unit._getNumberConverter(typeOf(typeOfValue));\n    return convert(1);\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.length === 0 || 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 = subtractScalar(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 (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.length === 0 || other.units.length === 0 || this.units[0].unit.offset === other.units[0].unit.offset) {\n      other.value = clone(value);\n    } else {\n      /* Need to adjust value by difference in offset to convert */\n      var convert = Unit._getNumberConverter(typeOf(value)); // convert to Fraction or BigNumber if needed\n\n      var thisUnitValue = this.units[0].unit.value;\n      var thisNominalOffset = this.units[0].unit.offset;\n      var thisUnitOffset = multiplyScalar(thisUnitValue, thisNominalOffset);\n      var otherUnitValue = other.units[0].unit.value;\n      var otherNominalOffset = other.units[0].unit.offset;\n      var otherUnitOffset = multiplyScalar(otherUnitValue, otherNominalOffset);\n      other.value = addScalar(value, convert(subtractScalar(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, \"skipSimp\": true}`\n   */\n  Unit.prototype.toJSON = function () {\n    return {\n      mathjs: 'Unit',\n      value: this._denormalize(this.value),\n      unit: this.units.length > 0 ? this.formatUnits() : null,\n      fixPrefix: this.fixPrefix,\n      skipSimp: this.skipAutomaticSimplification\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 _json$unit, _json$fixPrefix, _json$skipSimp;\n    var unit = new Unit(json.value, (_json$unit = json.unit) !== null && _json$unit !== void 0 ? _json$unit : undefined);\n    unit.fixPrefix = (_json$fixPrefix = json.fixPrefix) !== null && _json$fixPrefix !== void 0 ? _json$fixPrefix : fixPrefixDefault;\n    unit.skipAutomaticSimplification = (_json$skipSimp = json.skipSimp) !== null && _json$skipSimp !== void 0 ? _json$skipSimp : skipAutomaticSimplificationDefault;\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 (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 (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 (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 (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    if (this.value !== null) {\n      ret.value = null;\n      return this.to(ret);\n    }\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 unit, with optional formatting options.\n   * @memberof Unit\n   * @param {string[] | Unit[]} [units]  Array of units strings or valueLess Unit objects in wich choose the best one\n   * @param {Object} [options]  Options for parsing the unit. See parseUnit for details.\n   *\n   * @return {Unit} Returns a new Unit with the given value and unit.\n   */\n  Unit.prototype.toBest = function () {\n    var unitList = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : [];\n    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n    if (unitList && !Array.isArray(unitList)) {\n      throw new Error('Invalid unit type. Expected string or Unit.');\n    }\n    var startPrefixes = this.units[0].unit.prefixes;\n    if (unitList && unitList.length > 0) {\n      var unitObjects = unitList.map(u => {\n        var unit = null;\n        if (typeof u === 'string') {\n          unit = Unit.parse(u);\n          if (!unit) {\n            throw new Error('Invalid unit type. Expected compatible string or Unit.');\n          }\n        } else if (!isUnit(u)) {\n          throw new Error('Invalid unit type. Expected compatible string or Unit.');\n        }\n        if (unit === null) {\n          unit = u.clone();\n        }\n        try {\n          this.to(unit.formatUnits());\n          return unit;\n        } catch (e) {\n          throw new Error('Invalid unit type. Expected compatible string or Unit.');\n        }\n      });\n      var prefixes = unitObjects.map(el => el.units[0].prefix);\n      this.units[0].unit.prefixes = prefixes.reduce((acc, prefix) => {\n        acc[prefix.name] = prefix;\n        return acc;\n      }, {});\n      this.units[0].prefix = prefixes[0];\n    }\n    var result = formatBest(this, options).simp;\n    this.units[0].unit.prefixes = startPrefixes;\n    result.fixPrefix = true;\n    return result;\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    var {\n      simp,\n      valueStr,\n      unitStr\n    } = formatBest(this, options);\n    var str = valueStr;\n    if (simp.value && isComplex(simp.value)) {\n      str = '(' + str + ')'; // Surround complex values with ( ) to enable better parsing\n    }\n    if (unitStr.length > 0 && str.length > 0) {\n      str += ' ';\n    }\n    str += unitStr;\n    return str;\n  };\n\n  /**\n  * Helper function to normalize a unit for conversion and formatting\n  * @param {Unit} unit The unit to be normalized\n  * @return {Object} Object with normalized unit and value\n  * @private\n  */\n  function formatBest(unit) {\n    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\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 = unit.skipAutomaticSimplification || unit.value === null ? unit.clone() : unit.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    handleVAandVARUnits(simp);\n    // Now apply the best prefix\n    // Units must have only one unit and not have the fixPrefix flag set\n    applyBestPrefixIfNeeded(simp, options.offset);\n    var value = simp._denormalize(simp.value);\n    var valueStr = simp.value !== null ? format(value, options || {}) : '';\n    var unitStr = simp.formatUnits();\n    return {\n      simp,\n      valueStr,\n      unitStr\n    };\n  }\n\n  /**\n   * Helper to handle VA and VAR units\n   * @param {Unit} simp The unit to be normalized\n   */\n  function handleVAandVARUnits(simp) {\n    var isImaginary = false;\n    if (typeof simp.value !== 'undefined' && simp.value !== null && 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 (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\n  /**\n   * Helper to apply the best prefix if needed\n   * @param {Unit} simp The unit to be normalized\n   */\n  function applyBestPrefixIfNeeded(simp, offset) {\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(offset);\n      }\n    }\n  }\n\n  /**\n   * Calculate the best prefix using current value.\n   * @memberof Unit\n   * @returns {Object} prefix\n   * @param {number} [offset]  Optional offset for the best prefix calculation (default 1.2)\n   * @private\n   */\n  Unit.prototype._bestPrefix = function () {\n    var offset = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 1.2;\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 - offset;\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 (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 - offset);\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 = subtractScalar(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      R: {\n        name: 'R',\n        value: 1e27,\n        scientific: true\n      },\n      Q: {\n        name: 'Q',\n        value: 1e30,\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      r: {\n        name: 'r',\n        value: 1e-27,\n        scientific: true\n      },\n      q: {\n        name: 'q',\n        value: 1e-30,\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      ronna: {\n        name: 'ronna',\n        value: 1e27,\n        scientific: true\n      },\n      quetta: {\n        name: 'quetta',\n        value: 1e30,\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      ronto: {\n        name: 'ronto',\n        value: 1e-27,\n        scientific: true\n      },\n      quecto: {\n        name: 'quecto',\n        value: 1e-30,\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      R: {\n        name: 'R',\n        value: 1e54,\n        scientific: true\n      },\n      Q: {\n        name: 'Q',\n        value: 1e60,\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      r: {\n        name: 'r',\n        value: 1e-54,\n        scientific: true\n      },\n      q: {\n        name: 'q',\n        value: 1e-60,\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      R: {\n        name: 'R',\n        value: 1e81,\n        scientific: true\n      },\n      Q: {\n        name: 'Q',\n        value: 1e90,\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      r: {\n        name: 'r',\n        value: 1e-81,\n        scientific: true\n      },\n      q: {\n        name: 'q',\n        value: 1e-90,\n        scientific: true\n      }\n    },\n    BINARY_SHORT_SI: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      k: {\n        name: 'k',\n        value: 1e3,\n        scientific: true\n      },\n      M: {\n        name: 'M',\n        value: 1e6,\n        scientific: true\n      },\n      G: {\n        name: 'G',\n        value: 1e9,\n        scientific: true\n      },\n      T: {\n        name: 'T',\n        value: 1e12,\n        scientific: true\n      },\n      P: {\n        name: 'P',\n        value: 1e15,\n        scientific: true\n      },\n      E: {\n        name: 'E',\n        value: 1e18,\n        scientific: true\n      },\n      Z: {\n        name: 'Z',\n        value: 1e21,\n        scientific: true\n      },\n      Y: {\n        name: 'Y',\n        value: 1e24,\n        scientific: true\n      }\n    },\n    BINARY_SHORT_IEC: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      Ki: {\n        name: 'Ki',\n        value: 1024,\n        scientific: true\n      },\n      Mi: {\n        name: 'Mi',\n        value: Math.pow(1024, 2),\n        scientific: true\n      },\n      Gi: {\n        name: 'Gi',\n        value: Math.pow(1024, 3),\n        scientific: true\n      },\n      Ti: {\n        name: 'Ti',\n        value: Math.pow(1024, 4),\n        scientific: true\n      },\n      Pi: {\n        name: 'Pi',\n        value: Math.pow(1024, 5),\n        scientific: true\n      },\n      Ei: {\n        name: 'Ei',\n        value: Math.pow(1024, 6),\n        scientific: true\n      },\n      Zi: {\n        name: 'Zi',\n        value: Math.pow(1024, 7),\n        scientific: true\n      },\n      Yi: {\n        name: 'Yi',\n        value: Math.pow(1024, 8),\n        scientific: true\n      }\n    },\n    BINARY_LONG_SI: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      kilo: {\n        name: 'kilo',\n        value: 1e3,\n        scientific: true\n      },\n      mega: {\n        name: 'mega',\n        value: 1e6,\n        scientific: true\n      },\n      giga: {\n        name: 'giga',\n        value: 1e9,\n        scientific: true\n      },\n      tera: {\n        name: 'tera',\n        value: 1e12,\n        scientific: true\n      },\n      peta: {\n        name: 'peta',\n        value: 1e15,\n        scientific: true\n      },\n      exa: {\n        name: 'exa',\n        value: 1e18,\n        scientific: true\n      },\n      zetta: {\n        name: 'zetta',\n        value: 1e21,\n        scientific: true\n      },\n      yotta: {\n        name: 'yotta',\n        value: 1e24,\n        scientific: true\n      }\n    },\n    BINARY_LONG_IEC: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      kibi: {\n        name: 'kibi',\n        value: 1024,\n        scientific: true\n      },\n      mebi: {\n        name: 'mebi',\n        value: Math.pow(1024, 2),\n        scientific: true\n      },\n      gibi: {\n        name: 'gibi',\n        value: Math.pow(1024, 3),\n        scientific: true\n      },\n      tebi: {\n        name: 'tebi',\n        value: Math.pow(1024, 4),\n        scientific: true\n      },\n      pebi: {\n        name: 'pebi',\n        value: Math.pow(1024, 5),\n        scientific: true\n      },\n      exi: {\n        name: 'exi',\n        value: Math.pow(1024, 6),\n        scientific: true\n      },\n      zebi: {\n        name: 'zebi',\n        value: Math.pow(1024, 7),\n        scientific: true\n      },\n      yobi: {\n        name: 'yobi',\n        value: Math.pow(1024, 8),\n        scientific: true\n      }\n    },\n    BTU: {\n      '': {\n        name: '',\n        value: 1,\n        scientific: true\n      },\n      MM: {\n        name: 'MM',\n        value: 1e6,\n        scientific: true\n      }\n    }\n  };\n  PREFIXES.SHORTLONG = _extends({}, PREFIXES.SHORT, PREFIXES.LONG);\n  PREFIXES.BINARY_SHORT = _extends({}, PREFIXES.BINARY_SHORT_SI, PREFIXES.BINARY_SHORT_IEC);\n  PREFIXES.BINARY_LONG = _extends({}, PREFIXES.BINARY_LONG_SI, PREFIXES.BINARY_LONG_IEC);\n\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 \u00B0C)\" 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 (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(x => 0)\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.000000061611519921875,\n      offset: 0\n    },\n    // 1/61440 gallons\n    fluiddram: {\n      name: 'fluiddram',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0000036966911953125,\n      offset: 0\n    },\n    // 1/1024 gallons\n    fluidounce: {\n      name: 'fluidounce',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0000295735295625,\n      offset: 0\n    },\n    // 1/128 gallons\n    gill: {\n      name: 'gill',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.00011829411825,\n      offset: 0\n    },\n    // 1/32 gallons\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.0002365882365,\n      offset: 0\n    },\n    // 1/16 gallons\n    pint: {\n      name: 'pint',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.000473176473,\n      offset: 0\n    },\n    // 1/8 gallons\n    quart: {\n      name: 'quart',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.000946352946,\n      offset: 0\n    },\n    // 1/4 gallons\n    gallon: {\n      name: 'gallon',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.003785411784,\n      offset: 0\n    },\n    // 3.785411784 L\n    beerbarrel: {\n      name: 'beerbarrel',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.117347765304,\n      offset: 0\n    },\n    // 31 gallons\n    oilbarrel: {\n      name: 'oilbarrel',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.158987294928,\n      offset: 0\n    },\n    // 42 gallons\n    hogshead: {\n      name: 'hogshead',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.238480942392,\n      offset: 0\n    },\n    // 63 gallons\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) = \u00B0C + 273.15\n    // K(F) = (\u00B0F + 459.67) * (5 / 9)\n    // K(R) = \u00B0R * (5 / 9)\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: new _Fraction(5, 9),\n      offset: 459.67\n    },\n    degR: {\n      name: 'degR',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.SHORT,\n      value: new _Fraction(5, 9),\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: new _Fraction(5, 9),\n      offset: 459.67\n    },\n    rankine: {\n      name: 'rankine',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.LONG,\n      value: new _Fraction(5, 9),\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.LONG,\n      value: 1,\n      offset: 0\n    },\n    erg: {\n      name: 'erg',\n      base: BASE_UNITS.ENERGY,\n      prefixes: PREFIXES.SHORTLONG,\n      // Both kiloerg and kerg are acceptable\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    \u03A9: {\n      name: '\u03A9',\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  // note that ALIASES is only used at creation to create more entries in UNITS by copying the aliased units\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    fldr: 'fluiddram',\n    fluiddrams: 'fluiddram',\n    floz: 'fluidounce',\n    fluidounces: 'fluidounce',\n    gi: 'gill',\n    gills: 'gill',\n    cp: 'cup',\n    cups: 'cup',\n    pt: 'pint',\n    pints: 'pint',\n    qt: 'quart',\n    quarts: 'quart',\n    gal: 'gallon',\n    gallons: 'gallon',\n    bbl: 'beerbarrel',\n    beerbarrels: 'beerbarrel',\n    obl: 'oilbarrel',\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    amps: 'ampere',\n    amp: '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 = createPi(_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   * @memberof Unit\n   * @param {string} [name] The name of the unit system.\n   */\n  Unit.setUnitSystem = function (name) {\n    if (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   * @memberof Unit\n   * @return {string} The current unit system.\n   */\n  Unit.getUnitSystem = function () {\n    for (var _key in UNIT_SYSTEMS) {\n      if (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      if (x !== null && x !== void 0 && x.isFraction) return new _BigNumber(String(x.n)).div(String(x.d)).times(String(x.s));\n      return new _BigNumber(x + ''); // stringify to prevent constructor error\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      if (x !== null && x !== void 0 && x.isFraction) return _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 (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 (hasOwnProperty(ALIASES, _name2)) {\n      var _unit2 = UNITS[ALIASES[_name2]];\n      var alias = {};\n      for (var _key3 in _unit2) {\n        if (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   * @memberof Unit\n   * @param {string} c Tested character\n   * @return {boolean} true if the character is a latin letter\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   *       prefixes: 'long',\n   *       baseName: 'essence-of-foo'\n   *     },\n   *     bar: '40 foo',\n   *     baz: {\n   *       definition: '1 bar/hour',\n   *       prefixes: 'long'\n   *     }\n   *   },\n   *   {\n   *     override: true\n   *   })\n   * @memberof Unit\n   * @param {object} obj      Object map. Each key becomes a unit which is defined by its value.\n   * @param {object} options\n   * @return {Unit} the last created unit\n   */\n  Unit.createUnit = function (obj, options) {\n    if (typeof obj !== 'object') {\n      throw new TypeError(\"createUnit expects first parameter to be of type 'Object'\");\n    }\n\n    // Remove all units and aliases we are overriding\n    if (options && options.override) {\n      for (var _key4 in obj) {\n        if (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 (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   *\n   * @memberof Unit\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 (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 (typeof 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 (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 (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,\n        value: 1,\n        dimensions: BASE_UNITS[baseName].dimensions.slice(0),\n        prefixes,\n        offset,\n        base: BASE_UNITS[baseName]\n      };\n      currentUnitSystem[baseName] = {\n        unit: newUnit,\n        prefix: PREFIXES.NONE['']\n      };\n    } else {\n      newUnit = {\n        name,\n        value: defUnit.value,\n        dimensions: defUnit.dimensions.slice(0),\n        prefixes,\n        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 (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 (hasOwnProperty(newUnit, _key6)) {\n          _alias[_key6] = newUnit[_key6];\n        }\n      }\n      _alias.name = aliasName;\n      Unit.UNITS[aliasName] = _alias;\n    }\n\n    // delete the memoization cache because we created a new unit\n    delete _findUnit.cache;\n    return new Unit(null, name);\n  };\n  Unit.deleteUnit = function (name) {\n    delete Unit.UNITS[name];\n\n    // delete the memoization cache because we deleted a unit\n    delete _findUnit.cache;\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});", "import { factory } from '../../../utils/factory.js';\nimport { deepMap } from '../../../utils/collection.js';\nvar name = 'unit';\nvar dependencies = ['typed', 'Unit'];\n\n// This function is named createUnitFunction to prevent a naming conflict with createUnit\nexport var createUnitFunction = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    Unit\n  } = _ref;\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   * History:\n   *\n   *    v0.5   Created\n   *    v0.16  Support conversion from BigNumber\n   *    v2.5   Support BigNumber and Fraction values in units\n   *    v2.6   Support Complex values in units\n   *    v11.1  Allow the type of unit to be specifed by a unit (not just string)\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      return Unit.parse(x, {\n        allowNoUnits: true\n      }); // a unit with value, like '5cm'\n    },\n    'number | BigNumber | Fraction | Complex, string | Unit': function number__BigNumber__Fraction__Complex_string__Unit(value, unit) {\n      return new Unit(value, unit);\n    },\n    'number | BigNumber | Fraction': function number__BigNumber__Fraction(value) {\n      // dimensionless\n      return new Unit(value);\n    },\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  });\n});", "import { factory } from '../../../utils/factory.js';\nvar name = 'sparse';\nvar dependencies = ['typed', 'SparseMatrix'];\nexport var createSparse = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    SparseMatrix\n  } = _ref;\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   * History:\n   *\n   *    v1.5  Created\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 Array__Matrix(data) {\n      return new SparseMatrix(data);\n    },\n    'Array | Matrix, string': function Array__Matrix_string(data, datatype) {\n      return new SparseMatrix(data, datatype);\n    }\n  });\n});", "import { factory } from '../../../utils/factory.js';\nvar name = 'createUnit';\nvar dependencies = ['typed', 'Unit'];\nexport var createCreateUnit = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    Unit\n  } = _ref;\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 Object_Object(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 string_Unit__string__Object_Object(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 string_Unit__string__Object(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});", "import { factory } from '../../utils/factory.js';\nvar name = 'acos';\nvar dependencies = ['typed', 'config', 'Complex'];\nexport var createAcos = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    Complex\n  } = _ref;\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});", "import { factory } from '../../utils/factory.js';\nimport { acoshNumber } from '../../plain/number/index.js';\nvar name = 'acosh';\nvar dependencies = ['typed', 'config', 'Complex'];\nexport var createAcosh = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    Complex\n  } = _ref;\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 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});", "import { factory } from '../../utils/factory.js';\nimport { acotNumber } from '../../plain/number/index.js';\nvar name = 'acot';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createAcot = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    BigNumber: _BigNumber\n  } = _ref;\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: 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});", "import { factory } from '../../utils/factory.js';\nimport { acothNumber } from '../../plain/number/index.js';\nvar name = 'acoth';\nvar dependencies = ['typed', 'config', 'Complex', 'BigNumber'];\nexport var createAcoth = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    Complex,\n    BigNumber: _BigNumber\n  } = _ref;\n  /**\n   * Calculate the inverse hyperbolic tangent 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 inverse hyperbolic tangent, 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.5493061443340548 - 1.5707963267948966i\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 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});", "import { factory } from '../../utils/factory.js';\nimport { acscNumber } from '../../plain/number/index.js';\nvar name = 'acsc';\nvar dependencies = ['typed', 'config', 'Complex', 'BigNumber'];\nexport var createAcsc = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    Complex,\n    BigNumber: _BigNumber\n  } = _ref;\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 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});", "import { factory } from '../../utils/factory.js';\nimport { acschNumber } from '../../plain/number/index.js';\nvar name = 'acsch';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createAcsch = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    BigNumber: _BigNumber\n  } = _ref;\n  /**\n   * Calculate the inverse hyperbolic cosecant 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 inverse hyperbolic cosecant, 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: 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});", "import { factory } from '../../utils/factory.js';\nimport { asecNumber } from '../../plain/number/index.js';\nvar name = 'asec';\nvar dependencies = ['typed', 'config', 'Complex', 'BigNumber'];\nexport var createAsec = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    Complex,\n    BigNumber: _BigNumber\n  } = _ref;\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 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});", "import { factory } from '../../utils/factory.js';\nimport { asechNumber } from '../../plain/number/index.js';\nvar name = 'asech';\nvar dependencies = ['typed', 'config', 'Complex', 'BigNumber'];\nexport var createAsech = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    Complex,\n    BigNumber: _BigNumber\n  } = _ref;\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 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});", "import { factory } from '../../utils/factory.js';\nvar name = 'asin';\nvar dependencies = ['typed', 'config', 'Complex'];\nexport var createAsin = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    Complex\n  } = _ref;\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});", "import { factory } from '../../utils/factory.js';\nimport { asinhNumber } from '../../plain/number/index.js';\nvar name = 'asinh';\nvar dependencies = ['typed'];\nexport var createAsinh = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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: asinhNumber,\n    Complex: function Complex(x) {\n      return x.asinh();\n    },\n    BigNumber: function BigNumber(x) {\n      return x.asinh();\n    }\n  });\n});", "import { factory } from '../../utils/factory.js';\nvar name = 'atan';\nvar dependencies = ['typed'];\nexport var createAtan = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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});", "import { factory } from '../../utils/factory.js';\nimport { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js';\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';\nimport { createMatAlgo09xS0Sf } from '../../type/matrix/utils/matAlgo09xS0Sf.js';\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nvar name = 'atan2';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber', 'DenseMatrix', 'concat'];\nexport var createAtan2 = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    BigNumber,\n    DenseMatrix,\n    concat\n  } = _ref;\n  var matAlgo02xDS0 = createMatAlgo02xDS0({\n    typed,\n    equalScalar\n  });\n  var matAlgo03xDSf = createMatAlgo03xDSf({\n    typed\n  });\n  var matAlgo09xS0Sf = createMatAlgo09xS0Sf({\n    typed,\n    equalScalar\n  });\n  var matAlgo11xS0s = createMatAlgo11xS0s({\n    typed,\n    equalScalar\n  });\n  var matAlgo12xSfs = createMatAlgo12xSfs({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    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')\n   *    const x = math.cos(angle)\n   *    const y = math.sin(angle)\n   *    math.atan2(y, x) * 180 / math.pi  // returns 60\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': (y, x) => BigNumber.atan2(y, x)\n  }, matrixAlgorithmSuite({\n    scalar: 'number | BigNumber',\n    SS: matAlgo09xS0Sf,\n    DS: matAlgo03xDSf,\n    SD: matAlgo02xDS0,\n    Ss: matAlgo11xS0s,\n    sS: matAlgo12xSfs\n  }));\n});", "import { factory } from '../../utils/factory.js';\nimport { atanhNumber } from '../../plain/number/index.js';\nvar name = 'atanh';\nvar dependencies = ['typed', 'config', 'Complex'];\nexport var createAtanh = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    Complex\n  } = _ref;\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 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});", "import { factory } from '../../utils/factory.js';\nexport var createTrigUnit = /* #__PURE__ */factory('trigUnit', ['typed'], _ref => {\n  var {\n    typed\n  } = _ref;\n  return {\n    Unit: typed.referToSelf(self => 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});", "import { factory } from '../../utils/factory.js';\nimport { createTrigUnit } from './trigUnit.js';\nvar name = 'cos';\nvar dependencies = ['typed'];\nexport var createCos = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  var trigUnit = createTrigUnit({\n    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': x => x.cos()\n  }, trigUnit);\n});", "import { factory } from '../../utils/factory.js';\nimport { cosh as coshNumber } from '../../utils/number.js';\nvar name = 'cosh';\nvar dependencies = ['typed'];\nexport var createCosh = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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: coshNumber,\n    'Complex | BigNumber': x => x.cosh()\n  });\n});", "import { factory } from '../../utils/factory.js';\nimport { cotNumber } from '../../plain/number/index.js';\nimport { createTrigUnit } from './trigUnit.js';\nvar name = 'cot';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createCot = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    BigNumber: _BigNumber\n  } = _ref;\n  var trigUnit = createTrigUnit({\n    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: cotNumber,\n    Complex: x => x.cot(),\n    BigNumber: x => new _BigNumber(1).div(x.tan())\n  }, trigUnit);\n});", "import { factory } from '../../utils/factory.js';\nimport { cothNumber } from '../../plain/number/index.js';\nvar name = 'coth';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createCoth = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    BigNumber: _BigNumber\n  } = _ref;\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: cothNumber,\n    Complex: x => x.coth(),\n    BigNumber: x => new _BigNumber(1).div(x.tanh())\n  });\n});", "import { factory } from '../../utils/factory.js';\nimport { cscNumber } from '../../plain/number/index.js';\nimport { createTrigUnit } from './trigUnit.js';\nvar name = 'csc';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createCsc = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    BigNumber: _BigNumber\n  } = _ref;\n  var trigUnit = createTrigUnit({\n    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: cscNumber,\n    Complex: x => x.csc(),\n    BigNumber: x => new _BigNumber(1).div(x.sin())\n  }, trigUnit);\n});", "import { factory } from '../../utils/factory.js';\nimport { cschNumber } from '../../plain/number/index.js';\nvar name = 'csch';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createCsch = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    BigNumber: _BigNumber\n  } = _ref;\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: cschNumber,\n    Complex: x => x.csch(),\n    BigNumber: x => new _BigNumber(1).div(x.sinh())\n  });\n});", "import { factory } from '../../utils/factory.js';\nimport { secNumber } from '../../plain/number/index.js';\nimport { createTrigUnit } from './trigUnit.js';\nvar name = 'sec';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createSec = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    BigNumber: _BigNumber\n  } = _ref;\n  var trigUnit = createTrigUnit({\n    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: secNumber,\n    Complex: x => x.sec(),\n    BigNumber: x => new _BigNumber(1).div(x.cos())\n  }, trigUnit);\n});", "import { factory } from '../../utils/factory.js';\nimport { sechNumber } from '../../plain/number/index.js';\nvar name = 'sech';\nvar dependencies = ['typed', 'BigNumber'];\nexport var createSech = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    BigNumber: _BigNumber\n  } = _ref;\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: sechNumber,\n    Complex: x => x.sech(),\n    BigNumber: x => new _BigNumber(1).div(x.cosh())\n  });\n});", "import { factory } from '../../utils/factory.js';\nimport { createTrigUnit } from './trigUnit.js';\nvar name = 'sin';\nvar dependencies = ['typed'];\nexport var createSin = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  var trigUnit = createTrigUnit({\n    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': x => x.sin()\n  }, trigUnit);\n});", "import { factory } from '../../utils/factory.js';\nimport { sinhNumber } from '../../plain/number/index.js';\nvar name = 'sinh';\nvar dependencies = ['typed'];\nexport var createSinh = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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: sinhNumber,\n    'Complex | BigNumber': x => x.sinh()\n  });\n});", "import { factory } from '../../utils/factory.js';\nimport { createTrigUnit } from './trigUnit.js';\nvar name = 'tan';\nvar dependencies = ['typed'];\nexport var createTan = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  var trigUnit = createTrigUnit({\n    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': x => x.tan()\n  }, trigUnit);\n});", "import { factory } from '../../utils/factory.js';\nimport { tanh as _tanh } from '../../utils/number.js';\nvar name = 'tanh';\nvar dependencies = ['typed'];\nexport var createTanh = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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: _tanh,\n    'Complex | BigNumber': x => x.tanh()\n  });\n});", "import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setCartesian';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];\nexport var createSetCartesian = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    size,\n    subset,\n    compareNatural,\n    Index,\n    DenseMatrix\n  } = _ref;\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 Array__Matrix_Array__Matrix(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 = flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural);\n        var b2 = 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});", "import { flatten, generalize, identify } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setDifference';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];\nexport var createSetDifference = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    size,\n    subset,\n    compareNatural,\n    Index,\n    DenseMatrix\n  } = _ref;\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 Array__Matrix_Array__Matrix(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 flatten(a1.toArray());\n      } else {\n        var b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));\n        var b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));\n        result = [];\n        var inb2;\n        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 generalize(result);\n      }\n      // return a matrix otherwise\n      return new DenseMatrix(generalize(result));\n    }\n  });\n});", "import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setDistinct';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];\nexport var createSetDistinct = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    size,\n    subset,\n    compareNatural,\n    Index,\n    DenseMatrix\n  } = _ref;\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   * The items of the returned array will be sorted in natural order.\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 distinct elements of the multiset\n   */\n  return typed(name, {\n    'Array | Matrix': function Array__Matrix(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 = 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});", "import { flatten, generalize, identify } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setIntersect';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];\nexport var createSetIntersect = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    size,\n    subset,\n    compareNatural,\n    Index,\n    DenseMatrix\n  } = _ref;\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 Array__Matrix_Array__Matrix(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 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));\n        var b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));\n        result = [];\n        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 generalize(result);\n      }\n      // return a matrix otherwise\n      return new DenseMatrix(generalize(result));\n    }\n  });\n});", "import { flatten, identify } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setIsSubset';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];\nexport var createSetIsSubset = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    size,\n    subset,\n    compareNatural,\n    Index\n  } = _ref;\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 Array__Matrix_Array__Matrix(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 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));\n      var b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));\n      var inb2;\n      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});", "import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setMultiplicity';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];\nexport var createSetMultiplicity = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    size,\n    subset,\n    compareNatural,\n    Index\n  } = _ref;\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 number__BigNumber__Fraction__Complex_Array__Matrix(e, a) {\n      if (subset(size(a), new Index(0)) === 0) {\n        // if empty, return 0\n        return 0;\n      }\n      var b = 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});", "import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setPowerset';\nvar dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];\nexport var createSetPowerset = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    size,\n    subset,\n    compareNatural,\n    Index\n  } = _ref;\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 Array__Matrix(a) {\n      if (subset(size(a), new Index(0)) === 0) {\n        // if empty, return empty\n        return [];\n      }\n      var b = 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});", "import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setSize';\nvar dependencies = ['typed', 'compareNatural'];\nexport var createSetSize = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    compareNatural\n  } = _ref;\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 Array__Matrix(a) {\n      return Array.isArray(a) ? flatten(a).length : flatten(a.toArray()).length;\n    },\n    'Array | Matrix, boolean': function Array__Matrix_boolean(a, unique) {\n      if (unique === false || a.length === 0) {\n        return Array.isArray(a) ? flatten(a).length : flatten(a.toArray()).length;\n      } else {\n        var b = flatten(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);\n        var count = 1;\n        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});", "import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setSymDifference';\nvar dependencies = ['typed', 'size', 'concat', 'subset', 'setDifference', 'Index'];\nexport var createSetSymDifference = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    size,\n    concat,\n    subset,\n    setDifference,\n    Index\n  } = _ref;\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 Array__Matrix_Array__Matrix(a1, a2) {\n      if (subset(size(a1), new Index(0)) === 0) {\n        // if any of them is empty, return the other one\n        return flatten(a2);\n      } else if (subset(size(a2), new Index(0)) === 0) {\n        return flatten(a1);\n      }\n      var b1 = flatten(a1);\n      var b2 = flatten(a2);\n      return concat(setDifference(b1, b2), setDifference(b2, b1));\n    }\n  });\n});", "import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'setUnion';\nvar dependencies = ['typed', 'size', 'concat', 'subset', 'setIntersect', 'setSymDifference', 'Index'];\nexport var createSetUnion = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    size,\n    concat,\n    subset,\n    setIntersect,\n    setSymDifference,\n    Index\n  } = _ref;\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 Array__Matrix_Array__Matrix(a1, a2) {\n      if (subset(size(a1), new Index(0)) === 0) {\n        // if any of them is empty, return the other one\n        return flatten(a2);\n      } else if (subset(size(a2), new Index(0)) === 0) {\n        return flatten(a1);\n      }\n      var b1 = flatten(a1);\n      var b2 = flatten(a2);\n      return concat(setSymDifference(b1, b2), setIntersect(b1, b2));\n    }\n  });\n});", "import { factory } from '../../utils/factory.js';\nimport { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js';\nimport { createMatAlgo04xSidSid } from '../../type/matrix/utils/matAlgo04xSidSid.js';\nimport { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js';\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';\nvar name = 'add';\nvar dependencies = ['typed', 'matrix', 'addScalar', 'equalScalar', 'DenseMatrix', 'SparseMatrix', 'concat'];\nexport var createAdd = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    addScalar,\n    equalScalar,\n    DenseMatrix,\n    SparseMatrix,\n    concat\n  } = _ref;\n  var matAlgo01xDSid = createMatAlgo01xDSid({\n    typed\n  });\n  var matAlgo04xSidSid = createMatAlgo04xSidSid({\n    typed,\n    equalScalar\n  });\n  var matAlgo10xSids = createMatAlgo10xSids({\n    typed,\n    DenseMatrix\n  });\n  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({\n    typed,\n    matrix,\n    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 5.21 cm\n   *\n   *    math.add(\"2.3\", \"4\")         // returns number 6.3\n   *\n   * See also:\n   *\n   *    subtract, sum\n   *\n   * History:\n   *\n   *     v13     Handle bigint arguments\n   *     v11.6   Support matrix broadcasting\n   *     v3.8    Allow more than two arguments\n   *     v0.0.2  Created\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} x First value to add\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} y Second value to add\n   * @return {number | BigNumber | bigint | 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(self => (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  }, matrixAlgorithmSuite({\n    elop: addScalar,\n    DS: matAlgo01xDSid,\n    SS: matAlgo04xSidSid,\n    Ss: matAlgo10xSids\n  }));\n});", "import { factory } from '../../utils/factory.js';\nimport { flatten } from '../../utils/array.js';\nimport { isComplex } from '../../utils/is.js';\nvar name = 'hypot';\nvar dependencies = ['typed', 'abs', 'addScalar', 'divideScalar', 'multiplyScalar', 'sqrt', 'smaller', 'isPositive'];\nexport var createHypot = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    abs,\n    addScalar,\n    divideScalar,\n    multiplyScalar,\n    sqrt,\n    smaller,\n    isPositive\n  } = _ref;\n  /**\n   * Calculate the hypotenuse of a list with values. The hypotenuse is defined as:\n   *\n   *     hypot(a, b, c, ...) = sqrt(a^2 + b^2 + c^2 + ...)\n   *\n   * For matrix input, the hypotenuse 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: M => _hypot(flatten(M.toArray(), true))\n  });\n\n  /**\n   * Calculate the hypotenuse 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 (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});", "import { factory } from '../../utils/factory.js';\nvar name = 'norm';\nvar dependencies = ['typed', 'abs', 'add', 'pow', 'conj', 'sqrt', 'multiply', 'equalScalar', 'larger', 'smaller', 'matrix', 'ctranspose', 'eigs'];\nexport var createNorm = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    abs,\n    add,\n    pow,\n    conj,\n    sqrt,\n    multiply,\n    equalScalar,\n    larger,\n    smaller,\n    matrix,\n    ctranspose,\n    eigs\n  } = _ref;\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 Array_number__BigNumber__string(x, p) {\n      return _norm(matrix(x), p);\n    },\n    'Matrix, number | BigNumber | string': function Matrix_number__BigNumber__string(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});", "import { factory } from '../../utils/factory.js';\nimport { isMatrix } from '../../utils/is.js';\nvar name = 'dot';\nvar dependencies = ['typed', 'addScalar', 'multiplyScalar', 'conj', 'size'];\nexport var createDot = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    addScalar,\n    multiplyScalar,\n    conj,\n    size\n  } = _ref;\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 = isMatrix(a) ? a._data : a;\n    var adt = isMatrix(a) ? a._datatype || a.getDataType() : undefined;\n    var bdata = isMatrix(b) ? b._data : b;\n    var bdt = isMatrix(b) ? b._datatype || b.getDataType() : 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' && adt !== 'mixed') {\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});", "import { clone } from '../../utils/object.js';\nimport { format } from '../../utils/string.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'trace';\nvar dependencies = ['typed', 'matrix', 'add'];\nexport var createTrace = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    add\n  } = _ref;\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: 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 clone(data[0]);\n        }\n        throw new RangeError('Matrix must be square (size: ' + 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: ' + format(size) + ')');\n          }\n        }\n      default:\n        // multi dimensional\n        throw new RangeError('Matrix must be two dimensional (size: ' + 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: ' + format(size) + ')');\n  }\n});", "import { isBigNumber, isMatrix, isArray } from '../../../utils/is.js';\nimport { factory } from '../../../utils/factory.js';\nvar name = 'index';\nvar dependencies = ['typed', 'Index'];\nexport var createIndex = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    Index\n  } = _ref;\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 or booleans\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   *    math.subset(b, math.index([false, true, true, true, false]))  // returns [2, 3, 4]\n   *\n   *    const a = math.matrix([[1, 2], [3, 4]])\n   *    a.subset(math.index(0, 1))             // returns 2\n   *    a.subset(math.index(0, [false, true])) // returns 2\n   *\n   * See also:\n   *\n   *    bignumber, boolean, complex, matrix, number, string, unit\n   *\n   * History:\n   *\n   *    v?      Created\n   *    v2      Dropped support for `[start, end, step]` arguments in favor\n   *            of lists of arbitrary values; added support for Range\n   *            objects.\n   *    v11.10  Added support for arrays of booleans as indices.\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 number__string__BigNumber__Range__Array__Matrix(args) {\n      var ranges = args.map(function (arg) {\n        if (isBigNumber(arg)) {\n          return arg.toNumber(); // convert BigNumber to Number\n        } else if (isArray(arg) || isMatrix(arg)) {\n          return arg.map(function (elem) {\n            // convert BigNumber to Number\n            return 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});", "// Reserved keywords not allowed to use in the parser\nexport var keywords = new Set(['end']);", "import { isNode } from '../../utils/is.js';\nimport { keywords } from '../keywords.js';\nimport { deepStrictEqual } from '../../utils/object.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMap } from '../../utils/map.js';\nvar name = 'Node';\nvar dependencies = ['mathWithTransform'];\nexport var createNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    mathWithTransform\n  } = _ref;\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 symbol of [...keywords]) {\n      if (scope.has(symbol)) {\n        throw new Error('Scope contains an illegal symbol, \"' + symbol + '\" is a reserved keyword');\n      }\n    }\n  }\n  class Node {\n    get type() {\n      return 'Node';\n    }\n    get isNode() {\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    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    compile() {\n      var expr = this._compile(mathWithTransform, {});\n      var args = {};\n      var context = null;\n      function evaluate(scope) {\n        var s = createMap(scope);\n        _validateScope(s);\n        return expr(s, args, context);\n      }\n      return {\n        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    _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    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    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    _ifNode(node) {\n      if (!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    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    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    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    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    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    equals(other) {\n      return other ? this.type === other.type && 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    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     * Internal function to generate the string output.\n     * This has to be implemented by every Node\n     *\n     * @throws {Error}\n     */\n    _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 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    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    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 HTML output.\n     * This has to be implemented by every Node\n     *\n     * @throws {Error}\n     */\n    _toHTML() {\n      // must be implemented by each of the Node implementations\n      throw new Error('_toHTML 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    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    _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    _getCustomString(options) {\n      if (options && typeof options === 'object') {\n        switch (typeof 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    getIdentifier() {\n      return this.type;\n    }\n\n    /**\n     * Get the content of the current Node.\n     * @return {Node} node\n     **/\n    getContent() {\n      return this;\n    }\n  }\n  return Node;\n}, {\n  isClass: true,\n  isNode: true\n});", "import { IndexError } from '../../../error/IndexError.js';\n\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 */\nexport function errorTransform(err) {\n  if (err && err.isIndexError) {\n    return new IndexError(err.index + 1, err.min + 1, err.max !== undefined ? err.max + 1 : undefined);\n  }\n  return err;\n}", "import { errorTransform } from '../../transform/utils/errorTransform.js';\nimport { getSafeProperty } from '../../../utils/customs.js';\nexport function accessFactory(_ref) {\n  var {\n    subset\n  } = _ref;\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 (typeof object === 'object') {\n        if (!index.isObjectProperty()) {\n          throw new TypeError('Cannot apply a numeric index as object property');\n        }\n        return getSafeProperty(object, index.getObjectProperty());\n      } else {\n        throw new TypeError('Cannot apply index: unsupported type of object');\n      }\n    } catch (err) {\n      throw errorTransform(err);\n    }\n  };\n}", "import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { isAccessorNode, isArrayNode, isConstantNode, isFunctionNode, isIndexNode, isNode, isObjectNode, isParenthesisNode, isSymbolNode } from '../../utils/is.js';\nimport { getSafeProperty } from '../../utils/customs.js';\nimport { factory } from '../../utils/factory.js';\nimport { accessFactory } from './utils/access.js';\nvar name = 'AccessorNode';\nvar dependencies = ['subset', 'Node'];\nexport var createAccessorNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    subset,\n    Node\n  } = _ref;\n  var access = accessFactory({\n    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 !(isAccessorNode(node) || isArrayNode(node) || isConstantNode(node) || isFunctionNode(node) || isObjectNode(node) || isParenthesisNode(node) || isSymbolNode(node));\n  }\n  class AccessorNode extends Node {\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     * @param {boolean} [optionalChaining=false]\n     *     Optional property, if the accessor was written as optional-chaining\n     *     using `a?.b`, or `a?.[\"b\"] with bracket notation.\n     *     Forces evaluate to undefined if the given object is undefined or null.\n     */\n    constructor(object, index) {\n      var optionalChaining = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n      super();\n      if (!isNode(object)) {\n        throw new TypeError('Node expected for parameter \"object\"');\n      }\n      if (!isIndexNode(index)) {\n        throw new TypeError('IndexNode expected for parameter \"index\"');\n      }\n      this.object = object;\n      this.index = index;\n      this.optionalChaining = optionalChaining;\n    }\n\n    // readonly property name\n    get name() {\n      if (this.index) {\n        return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';\n      } else {\n        return this.object.name || '';\n      }\n    }\n    get type() {\n      return name;\n    }\n    get isAccessorNode() {\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    _compile(math, argNames) {\n      var evalObject = this.object._compile(math, argNames);\n      var evalIndex = this.index._compile(math, argNames);\n      var optionalChaining = this.optionalChaining;\n      var prevOptionalChaining = isAccessorNode(this.object) && this.object.optionalChaining;\n      if (this.index.isObjectProperty()) {\n        var prop = this.index.getObjectProperty();\n        return function evalAccessorNode(scope, args, context) {\n          var ctx = context || {};\n          var object = evalObject(scope, args, ctx);\n          if (optionalChaining && object == null) {\n            ctx.optionalShortCircuit = true;\n            return undefined;\n          }\n          if (prevOptionalChaining && ctx !== null && ctx !== void 0 && ctx.optionalShortCircuit) {\n            return undefined;\n          }\n\n          // get a property from an object evaluated using the scope.\n          return getSafeProperty(object, prop);\n        };\n      } else {\n        return function evalAccessorNode(scope, args, context) {\n          var ctx = context || {};\n          var object = evalObject(scope, args, ctx);\n          if (optionalChaining && object == null) {\n            ctx.optionalShortCircuit = true;\n            return undefined;\n          }\n          if (prevOptionalChaining && ctx !== null && ctx !== void 0 && ctx.optionalShortCircuit) {\n            return undefined;\n          }\n\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    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    map(callback) {\n      return new AccessorNode(this._ifNode(callback(this.object, 'object', this)), this._ifNode(callback(this.index, 'index', this)), this.optionalChaining);\n    }\n\n    /**\n     * Create a clone of this node, a shallow copy\n     * @return {AccessorNode}\n     */\n    clone() {\n      return new AccessorNode(this.object, this.index, this.optionalChaining);\n    }\n\n    /**\n     * Get string representation\n     * @param {Object} options\n     * @return {string}\n     */\n    _toString(options) {\n      var object = this.object.toString(options);\n      if (needParenthesis(this.object)) {\n        object = '(' + object + ')';\n      }\n      var optionalChaining = this.optionalChaining ? this.index.dotNotation ? '?' : '?.' : '';\n      return object + optionalChaining + this.index.toString(options);\n    }\n\n    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string}\n     */\n    _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    _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    toJSON() {\n      return {\n        mathjs: name,\n        object: this.object,\n        index: this.index,\n        optionalChaining: this.optionalChaining\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    static fromJSON(json) {\n      return new AccessorNode(json.object, json.index, json.optionalChaining);\n    }\n  }\n  _defineProperty(AccessorNode, \"name\", name);\n  return AccessorNode;\n}, {\n  isClass: true,\n  isNode: true\n});", "import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { isArrayNode, isNode } from '../../utils/is.js';\nimport { map } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'ArrayNode';\nvar dependencies = ['Node'];\nexport var createArrayNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    Node\n  } = _ref;\n  class ArrayNode extends Node {\n    /**\n     * @constructor ArrayNode\n     * @extends {Node}\n     * Holds an 1-dimensional array with items\n     * @param {Node[]} [items]   1 dimensional array with items\n     */\n    constructor(items) {\n      super();\n      this.items = items || [];\n\n      // validate input\n      if (!Array.isArray(this.items) || !this.items.every(isNode)) {\n        throw new TypeError('Array containing Nodes expected');\n      }\n    }\n    get type() {\n      return name;\n    }\n    get isArrayNode() {\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    _compile(math, argNames) {\n      var evalItems = map(this.items, function (item) {\n        return item._compile(math, argNames);\n      });\n      var asMatrix = math.config.matrix !== 'Array';\n      if (asMatrix) {\n        var matrix = math.matrix;\n        return function evalArrayNode(scope, args, context) {\n          return matrix(map(evalItems, function (evalItem) {\n            return evalItem(scope, args, context);\n          }));\n        };\n      } else {\n        return function evalArrayNode(scope, args, context) {\n          return map(evalItems, function (evalItem) {\n            return evalItem(scope, args, context);\n          });\n        };\n      }\n    }\n\n    /**\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    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    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    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    _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    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    static fromJSON(json) {\n      return new ArrayNode(json.items);\n    }\n\n    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string} str\n     * @override\n     */\n    _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    _toTex(options) {\n      function itemsToTex(items, nested) {\n        var mixedItems = items.some(isArrayNode) && !items.every(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  _defineProperty(ArrayNode, \"name\", name);\n  return ArrayNode;\n}, {\n  isClass: true,\n  isNode: true\n});", "import { errorTransform } from '../../transform/utils/errorTransform.js';\nimport { setSafeProperty } from '../../../utils/customs.js';\nexport function assignFactory(_ref) {\n  var {\n    subset,\n    matrix\n  } = _ref;\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        var result = matrix(object).subset(index, value).valueOf();\n\n        // shallow copy all (updated) items into the original array\n        result.forEach((item, index) => {\n          object[index] = item;\n        });\n        return object;\n      } else if (object && typeof object.subset === 'function') {\n        // Matrix\n        return object.subset(index, value);\n      } else if (typeof object === 'string') {\n        // TODO: move setStringSubset into a separate util file, use that\n        return subset(object, index, value);\n      } else if (typeof object === 'object') {\n        if (!index.isObjectProperty()) {\n          throw TypeError('Cannot apply a numeric index as object property');\n        }\n        setSafeProperty(object, index.getObjectProperty(), value);\n        return object;\n      } else {\n        throw new TypeError('Cannot apply index: unsupported type of object');\n      }\n    } catch (err) {\n      throw errorTransform(err);\n    }\n  };\n}", "// list of identifiers of nodes in order of their precedence\n// also contains information about left/right associativity\n// and which other operator the operator is associative with\n// Example:\n// addition is associative with addition and subtraction, because:\n// (a+b)+c=a+(b+c)\n// (a+b)-c=a+(b-c)\n//\n// postfix operators are left associative, prefix operators\n// are right associative\n//\n// It's also possible to set the following properties:\n// latexParens: if set to false, this node doesn't need to be enclosed\n//              in parentheses when using LaTeX\n// latexLeftParens: if set to false, this !OperatorNode's!\n//                  left argument doesn't need to be enclosed\n//                  in parentheses\n// latexRightParens: the same for the right argument\nimport { hasOwnProperty } from '../utils/object.js';\nimport { isConstantNode, isParenthesisNode, rule2Node } from '../utils/is.js';\nexport var 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  '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  'OperatorNode:dotPow': {\n    op: '.^',\n    associativity: 'right',\n    associativeWith: []\n  }\n}, {\n  // nullish coalescing\n  'OperatorNode:nullish': {\n    op: '??',\n    associativity: 'left',\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 */\nfunction unwrapParen(_node, parenthesis) {\n  if (!parenthesis || parenthesis !== 'auto') return _node;\n  var node = _node;\n  while (isParenthesisNode(node)) node = node.content;\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 */\nexport function 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 (!(isConstantNode(leftArg) && parent && parent.getIdentifier() === 'OperatorNode:divide' && rule2Node(unwrapParen(parent.args[0], parenthesis))) && !(leftArg.getIdentifier() === 'OperatorNode:divide' && rule2Node(unwrapParen(leftArg.args[0], parenthesis)) && 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 */\nexport function 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 (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 */\nexport function 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 (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 */\nexport function getOperator(fn) {\n  var identifier = 'OperatorNode:' + fn;\n  for (var group of properties) {\n    if (identifier in group) {\n      return group[identifier].op;\n    }\n  }\n  return null;\n}", "import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { isAccessorNode, isIndexNode, isNode, isSymbolNode } from '../../utils/is.js';\nimport { getSafeProperty, setSafeProperty } from '../../utils/customs.js';\nimport { factory } from '../../utils/factory.js';\nimport { accessFactory } from './utils/access.js';\nimport { assignFactory } from './utils/assign.js';\nimport { getPrecedence } from '../operators.js';\nvar name = 'AssignmentNode';\nvar dependencies = ['subset', '?matrix',\n// FIXME: should not be needed at all, should be handled by subset\n'Node'];\nexport var createAssignmentNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    subset,\n    matrix,\n    Node\n  } = _ref;\n  var access = accessFactory({\n    subset\n  });\n  var assign = assignFactory({\n    subset,\n    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 = getPrecedence(node, parenthesis, implicit);\n    var exprPrecedence = getPrecedence(node.value, parenthesis, implicit);\n    return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;\n  }\n  class AssignmentNode extends Node {\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    constructor(object, index, value) {\n      super();\n      this.object = object;\n      this.index = value ? index : null;\n      this.value = value || index;\n\n      // validate input\n      if (!isSymbolNode(object) && !isAccessorNode(object)) {\n        throw new TypeError('SymbolNode or AccessorNode expected as \"object\"');\n      }\n      if (isSymbolNode(object) && object.name === 'end') {\n        throw new Error('Cannot assign to symbol \"end\"');\n      }\n      if (this.index && !isIndexNode(this.index)) {\n        // index is optional\n        throw new TypeError('IndexNode expected as \"index\"');\n      }\n      if (!isNode(this.value)) {\n        throw new TypeError('Node expected as \"value\"');\n      }\n    }\n\n    // class name for typing purposes:\n\n    // readonly property name\n    get name() {\n      if (this.index) {\n        return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';\n      } else {\n        return this.object.name || '';\n      }\n    }\n    get type() {\n      return name;\n    }\n    get isAssignmentNode() {\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    _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 (!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          setSafeProperty(object, prop, value);\n          return value;\n        };\n      } else if (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 = 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            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    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    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    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    _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    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    static fromJSON(json) {\n      return new AssignmentNode(json.object, json.index, json.value);\n    }\n\n    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string}\n     */\n    _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    _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  _defineProperty(AssignmentNode, \"name\", name);\n  return AssignmentNode;\n}, {\n  isClass: true,\n  isNode: true\n});", "import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { isNode } from '../../utils/is.js';\nimport { forEach, map } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'BlockNode';\nvar dependencies = ['ResultSet', 'Node'];\nexport var createBlockNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    ResultSet,\n    Node\n  } = _ref;\n  class BlockNode extends Node {\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    constructor(blocks) {\n      super();\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 (!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,\n          visible\n        };\n      });\n    }\n    get type() {\n      return name;\n    }\n    get isBlockNode() {\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    _compile(math, argNames) {\n      var evalBlocks = 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        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    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    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,\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    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    _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    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    static fromJSON(json) {\n      return new BlockNode(json.blocks);\n    }\n\n    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string} str\n     * @override\n     */\n    _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    _toTex(options) {\n      return this.blocks.map(function (param) {\n        return param.node.toTex(options) + (param.visible ? '' : ';');\n      }).join('\\\\;\\\\;\\n');\n    }\n  }\n  _defineProperty(BlockNode, \"name\", name);\n  return BlockNode;\n}, {\n  isClass: true,\n  isNode: true\n});", "import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { isBigNumber, isComplex, isNode, isUnit, typeOf } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nimport { getPrecedence } from '../operators.js';\nvar name = 'ConditionalNode';\nvar dependencies = ['Node'];\nexport var createConditionalNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    Node\n  } = _ref;\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 (isBigNumber(condition)) {\n        return !condition.isZero();\n      }\n      if (isComplex(condition)) {\n        return !!(condition.re || condition.im);\n      }\n      if (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 \"' + typeOf(condition) + '\"');\n  }\n  class ConditionalNode extends Node {\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    constructor(condition, trueExpr, falseExpr) {\n      super();\n      if (!isNode(condition)) {\n        throw new TypeError('Parameter condition must be a Node');\n      }\n      if (!isNode(trueExpr)) {\n        throw new TypeError('Parameter trueExpr must be a Node');\n      }\n      if (!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    }\n    get type() {\n      return name;\n    }\n    get isConditionalNode() {\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    _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    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    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    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    _toString(options) {\n      var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n      var precedence = 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 = 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 = 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 = 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    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    static fromJSON(json) {\n      return new ConditionalNode(json.condition, json.trueExpr, json.falseExpr);\n    }\n\n    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toHTML(options) {\n      var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n      var precedence = 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 = 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 = 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 = 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    _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  _defineProperty(ConditionalNode, \"name\", name);\n  return ConditionalNode;\n}, {\n  isClass: true,\n  isNode: true\n});", "/* eslint no-template-curly-in-string: \"off\" */\n\nimport escapeLatexLib from 'escape-latex';\nimport { hasOwnProperty } from './object.js';\nexport var 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};\nexport var 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};\nexport var 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  fraction: {\n    2: '\\\\frac{${args[0]}}{${args[1]}}'\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  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  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  bigint: {\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};\nexport var defaultTemplate = '\\\\mathrm{${name}}\\\\left(${args}\\\\right)';\nvar latexUnits = {\n  deg: '^\\\\circ'\n};\nexport function escapeLatex(string) {\n  return escapeLatexLib(string, {\n    preserveFormatting: true\n  });\n}\n\n// @param {string} name\n// @param {boolean} isUnit\nexport function toSymbol(name, isUnit) {\n  isUnit = typeof isUnit === 'undefined' ? false : isUnit;\n  if (isUnit) {\n    if (hasOwnProperty(latexUnits, name)) {\n      return latexUnits[name];\n    }\n    return '\\\\mathrm{' + escapeLatex(name) + '}';\n  }\n  if (hasOwnProperty(latexSymbols, name)) {\n    return latexSymbols[name];\n  }\n  return escapeLatex(name);\n}", "import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { format } from '../../utils/string.js';\nimport { typeOf } from '../../utils/is.js';\nimport { escapeLatex } from '../../utils/latex.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'ConstantNode';\nvar dependencies = ['Node', 'isBounded'];\nexport var createConstantNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    Node,\n    isBounded\n  } = _ref;\n  class ConstantNode extends Node {\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, bigint, string, ...)\n     * @constructor ConstantNode\n     * @extends {Node}\n     */\n    constructor(value) {\n      super();\n      this.value = value;\n    }\n    get type() {\n      return name;\n    }\n    get isConstantNode() {\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    _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    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    map(callback) {\n      return this.clone();\n    }\n\n    /**\n     * Create a clone of this node, a shallow copy\n     * @return {ConstantNode}\n     */\n    clone() {\n      return new ConstantNode(this.value);\n    }\n\n    /**\n     * Get string representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toString(options) {\n      return format(this.value, options);\n    }\n\n    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toHTML(options) {\n      var value = this._toString(options);\n      switch (typeOf(this.value)) {\n        case 'number':\n        case 'bigint':\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    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    static fromJSON(json) {\n      return new ConstantNode(json.value);\n    }\n\n    /**\n     * Get LaTeX representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toTex(options) {\n      var value = this._toString(options);\n      var type = typeOf(this.value);\n      switch (type) {\n        case 'string':\n          return '\\\\mathtt{' + escapeLatex(value) + '}';\n        case 'number':\n        case 'BigNumber':\n          {\n            if (!isBounded(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            return value;\n          }\n        case 'bigint':\n          {\n            return value.toString();\n          }\n        case 'Fraction':\n          return this.value.toLatex();\n        default:\n          return value;\n      }\n    }\n  }\n  _defineProperty(ConstantNode, \"name\", name);\n  return ConstantNode;\n}, {\n  isClass: true,\n  isNode: true\n});", "import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { isNode } from '../../utils/is.js';\nimport { keywords } from '../keywords.js';\nimport { escape } from '../../utils/string.js';\nimport { forEach, join } from '../../utils/array.js';\nimport { toSymbol } from '../../utils/latex.js';\nimport { getPrecedence } from '../operators.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'FunctionAssignmentNode';\nvar dependencies = ['typed', 'Node'];\nexport var createFunctionAssignmentNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    Node\n  } = _ref;\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 = getPrecedence(node, parenthesis, implicit);\n    var exprPrecedence = getPrecedence(node.expr, parenthesis, implicit);\n    return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;\n  }\n  class FunctionAssignmentNode extends Node {\n    /**\n     * @constructor FunctionAssignmentNode\n     * @extends {Node}\n     * Function assignment\n     *\n     * @param {string} name           Function name\n     * @param {string[] | Array.<{name: string, type: string}>} params\n     *                                Array with function parameter names, or an\n     *                                array with objects containing the name\n     *                                and type of the parameter\n     * @param {Node} expr             The function expression\n     */\n    constructor(name, params, expr) {\n      super();\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 (!isNode(expr)) {\n        throw new TypeError('Node expected for parameter \"expr\"');\n      }\n      if (keywords.has(name)) {\n        throw new Error('Illegal function name, \"' + name + '\" is a reserved keyword');\n      }\n      var paramNames = new Set();\n      for (var param of params) {\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      this.name = name;\n      this.params = params.map(function (param) {\n        return param && param.name || param;\n      });\n      this.types = params.map(function (param) {\n        return param && param.type || 'any';\n      });\n      this.expr = expr;\n    }\n    get type() {\n      return name;\n    }\n    get isFunctionAssignmentNode() {\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    _compile(math, argNames) {\n      var childArgNames = Object.create(argNames);\n      forEach(this.params, function (param) {\n        childArgNames[param] = true;\n      });\n\n      // compile the function expression with the child args\n      var expr = this.expr;\n      var evalExpr = expr._compile(math, childArgNames);\n      var name = this.name;\n      var params = this.params;\n      var signature = join(this.types, ',');\n      var syntax = name + '(' + join(this.params, ', ') + ')';\n      return function evalFunctionAssignmentNode(scope, args, context) {\n        var signatures = {};\n        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        fn.expr = expr.toString();\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    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    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    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    _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    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    static fromJSON(json) {\n      return new FunctionAssignmentNode(json.name, json.params, json.expr);\n    }\n\n    /**\n     * get HTML representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _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\">' + 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\">' + 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    _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(toSymbol).join(',') + '\\\\right)=' + expr;\n    }\n  }\n  _defineProperty(FunctionAssignmentNode, \"name\", name);\n  return FunctionAssignmentNode;\n}, {\n  isClass: true,\n  isNode: true\n});", "import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { map } from '../../utils/array.js';\nimport { getSafeProperty } from '../../utils/customs.js';\nimport { factory } from '../../utils/factory.js';\nimport { isArray, isConstantNode, isMatrix, isNode, isString, typeOf } from '../../utils/is.js';\nimport { escape } from '../../utils/string.js';\nvar name = 'IndexNode';\nvar dependencies = ['Node', 'size'];\nexport var createIndexNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    Node,\n    size\n  } = _ref;\n  class IndexNode extends Node {\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    constructor(dimensions, dotNotation) {\n      super();\n      this.dimensions = dimensions;\n      this.dotNotation = dotNotation || false;\n\n      // validate input\n      if (!Array.isArray(dimensions) || !dimensions.every(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    }\n    get type() {\n      return name;\n    }\n    get isIndexNode() {\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    _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 = map(this.dimensions, function (dimension, i) {\n        var needsEnd = dimension.filter(node => node.isSymbolNode && node.name === 'end').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 (!isMatrix(context) && !isArray(context) && !isString(context)) {\n              throw new TypeError('Cannot resolve \"end\": ' + 'context must be a Matrix, Array, or string but is ' + typeOf(context));\n            }\n            var s = size(context);\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 = getSafeProperty(math, 'index');\n      return function evalIndexNode(scope, args, context) {\n        var dimensions = map(evalDimensions, function (evalDimension) {\n          return evalDimension(scope, args, context);\n        });\n        return index(...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    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    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    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    isObjectProperty() {\n      return this.dimensions.length === 1 && 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    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    _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    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    static fromJSON(json) {\n      return new IndexNode(json.dimensions, json.dotNotation);\n    }\n\n    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _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\">' + 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    _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  _defineProperty(IndexNode, \"name\", name);\n  return IndexNode;\n}, {\n  isClass: true,\n  isNode: true\n});", "import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { getSafeProperty } from '../../utils/customs.js';\nimport { factory } from '../../utils/factory.js';\nimport { isNode } from '../../utils/is.js';\nimport { hasOwnProperty } from '../../utils/object.js';\nimport { escape, stringify } from '../../utils/string.js';\nvar name = 'ObjectNode';\nvar dependencies = ['Node'];\nexport var createObjectNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    Node\n  } = _ref;\n  class ObjectNode extends Node {\n    /**\n     * @constructor ObjectNode\n     * @extends {Node}\n     * Holds an object with keys/values\n     * @param {Object.<string, Node>} [properties]   object with key/value pairs\n     */\n    constructor(properties) {\n      super();\n      this.properties = properties || {};\n\n      // validate input\n      if (properties) {\n        if (!(typeof properties === 'object') || !Object.keys(properties).every(function (key) {\n          return isNode(properties[key]);\n        })) {\n          throw new TypeError('Object containing Nodes expected');\n        }\n      }\n    }\n    get type() {\n      return name;\n    }\n    get isObjectNode() {\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    _compile(math, argNames) {\n      var evalEntries = {};\n      for (var key in this.properties) {\n        if (hasOwnProperty(this.properties, key)) {\n          // we stringify/parse the key here to resolve unicode characters,\n          // so you cannot create a key like {\"co\\\\u006Estructor\": null}\n          var stringifiedKey = stringify(key);\n          var parsedKey = JSON.parse(stringifiedKey);\n          var prop = getSafeProperty(this.properties, key);\n          evalEntries[parsedKey] = prop._compile(math, argNames);\n        }\n      }\n      return function evalObjectNode(scope, args, context) {\n        var obj = {};\n        for (var _key in evalEntries) {\n          if (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    forEach(callback) {\n      for (var key in this.properties) {\n        if (hasOwnProperty(this.properties, key)) {\n          callback(this.properties[key], 'properties[' + 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    map(callback) {\n      var properties = {};\n      for (var key in this.properties) {\n        if (hasOwnProperty(this.properties, key)) {\n          properties[key] = this._ifNode(callback(this.properties[key], 'properties[' + 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    clone() {\n      var properties = {};\n      for (var key in this.properties) {\n        if (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    _toString(options) {\n      var entries = [];\n      for (var key in this.properties) {\n        if (hasOwnProperty(this.properties, key)) {\n          entries.push(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    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    static fromJSON(json) {\n      return new ObjectNode(json.properties);\n    }\n\n    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string} str\n     * @override\n     */\n    _toHTML(options) {\n      var entries = [];\n      for (var key in this.properties) {\n        if (hasOwnProperty(this.properties, key)) {\n          entries.push('<span class=\"math-symbol math-property\">' + escape(key) + '</span>' + '<span class=\"math-operator math-assignment-operator ' + 'math-property-assignment-operator math-binary-operator\">' + ':</span>' + this.properties[key].toHTML(options));\n        }\n      }\n      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    _toTex(options) {\n      var entries = [];\n      for (var key in this.properties) {\n        if (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  _defineProperty(ObjectNode, \"name\", name);\n  return ObjectNode;\n}, {\n  isClass: true,\n  isNode: true\n});", "import { ObjectWrappingMap, PartitionedMap } from './map.js';\n\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  {Object} args\n * @returns {PartitionedMap}\n */\nexport function createSubScope(parentScope, args) {\n  return new PartitionedMap(parentScope, new ObjectWrappingMap(args), new Set(Object.keys(args)));\n}", "import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { isNode, isConstantNode, isOperatorNode, isParenthesisNode } from '../../utils/is.js';\nimport { map } from '../../utils/array.js';\nimport { createSubScope } from '../../utils/scope.js';\nimport { escape } from '../../utils/string.js';\nimport { getSafeProperty, isSafeMethod } from '../../utils/customs.js';\nimport { getAssociativity, getPrecedence, isAssociativeWith, properties } from '../operators.js';\nimport { latexOperators } from '../../utils/latex.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'OperatorNode';\nvar dependencies = ['Node'];\nexport var createOperatorNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    Node\n  } = _ref;\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 (isParenthesisNode(curNode)) curNode = curNode.content;\n    }\n    if (isConstantNode(curNode)) return true;\n    if (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 = getPrecedence(root, parenthesis, implicit);\n    var associativity = 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 = 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 (properties[precedence][rootIdentifier].latexLeftParens === false) {\n              result = [false];\n              break;\n            }\n            if (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 = getPrecedence(args[0], parenthesis, implicit, root);\n          // is the root node associative with the left hand side\n          var assocWithLhs = 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 = getPrecedence(args[1], parenthesis, implicit, root);\n          // is the root node associative with the right hand side?\n          var assocWithRhs = 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 (properties[precedence][_rootIdentifier].latexLeftParens === false) {\n                lhsParens = false;\n              }\n              if (properties[lhsPrecedence][lhsIdentifier].latexParens === false) {\n                lhsParens = false;\n              }\n            }\n            if (rhsPrecedence !== null) {\n              if (properties[precedence][_rootIdentifier].latexRightParens === false) {\n                rhsParens = false;\n              }\n              if (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 = getPrecedence(arg, parenthesis, implicit, root);\n            var assocWithArg = isAssociativeWith(root, arg, parenthesis);\n            var argAssociativity = 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' || !isParenthesisNode(args[i - 1]))) {\n          result[i] = true;\n        }\n      }\n    }\n    return result;\n  }\n  class OperatorNode extends Node {\n    /**\n     * @constructor OperatorNode\n     * @extends {Node}\n     * An operator with two arguments, like 2+3\n     *\n     * @param {string} op           Operator name, for example '+'\n     * @param {string} fn           Function name, for example 'add'\n     * @param {Node[]} args         Operator arguments\n     * @param {boolean} [implicit]  Is this an implicit multiplication?\n     * @param {boolean} [isPercentage] Is this an percentage Operation?\n     */\n    constructor(op, fn, args, implicit, isPercentage) {\n      super();\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(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    }\n    get type() {\n      return name;\n    }\n    get isOperatorNode() {\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    _compile(math, argNames) {\n      // validate fn\n      if (typeof this.fn !== 'string' || !isSafeMethod(math, this.fn)) {\n        if (!math[this.fn]) {\n          throw new Error('Function ' + this.fn + ' missing in provided namespace \"math\"');\n        } else {\n          throw new Error('No access to function \"' + this.fn + '\"');\n        }\n      }\n      var fn = getSafeProperty(math, this.fn);\n      var evalArgs = map(this.args, function (arg) {\n        return arg._compile(math, argNames);\n      });\n      if (typeof fn === 'function' && fn.rawArgs === true) {\n        // pass unevaluated parameters (nodes) to the function\n        // \"raw\" evaluation\n        var rawArgs = this.args;\n        return function evalOperatorNode(scope, args, context) {\n          return fn(rawArgs, math, createSubScope(scope, args));\n        };\n      } else if (evalArgs.length === 1) {\n        var evalArg0 = evalArgs[0];\n        return function evalOperatorNode(scope, args, context) {\n          return fn(evalArg0(scope, args, context));\n        };\n      } else if (evalArgs.length === 2) {\n        var _evalArg = evalArgs[0];\n        var evalArg1 = evalArgs[1];\n        return function evalOperatorNode(scope, args, context) {\n          return fn(_evalArg(scope, args, context), evalArg1(scope, args, context));\n        };\n      } else {\n        return function evalOperatorNode(scope, args, context) {\n          return fn.apply(null, map(evalArgs, function (evalArg) {\n            return evalArg(scope, args, context);\n          }));\n        };\n      }\n    }\n\n    /**\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    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    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    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    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    isBinary() {\n      return this.args.length === 2;\n    }\n\n    /**\n     * Get string representation.\n     * @param {Object} options\n     * @return {string} str\n     */\n    _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 = 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    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    static fromJSON(json) {\n      return new OperatorNode(json.op, json.fn, json.args, json.implicit, json.isPercentage);\n    }\n\n    /**\n     * Get HTML representation.\n     * @param {Object} options\n     * @return {string} str\n     */\n    _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 = 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\">' + 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\">' + 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\">' + 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\">' + escape(this.op) + '</span>');\n        } else {\n          // fallback to formatting as a function call\n          return '<span class=\"math-function\">' + escape(this.fn) + '</span><span class=\"math-paranthesis math-round-parenthesis\">' + '(</span>' + stringifiedArgs.join('<span class=\"math-separator\">,</span>') + '<span class=\"math-paranthesis math-round-parenthesis\">)</span>';\n        }\n      }\n    }\n\n    /**\n     * Get LaTeX representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _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 = 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 = 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    getIdentifier() {\n      return this.type + ':' + this.fn;\n    }\n  }\n  _defineProperty(OperatorNode, \"name\", name);\n  return OperatorNode;\n}, {\n  isClass: true,\n  isNode: true\n});", "import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { isNode } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'ParenthesisNode';\nvar dependencies = ['Node'];\nexport var createParenthesisNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    Node\n  } = _ref;\n  class ParenthesisNode extends Node {\n    /**\n     * @constructor ParenthesisNode\n     * @extends {Node}\n     * A parenthesis node describes manual parenthesis from the user input\n     * @param {Node} content\n     * @extends {Node}\n     */\n    constructor(content) {\n      super();\n      // validate input\n      if (!isNode(content)) {\n        throw new TypeError('Node expected for parameter \"content\"');\n      }\n      this.content = content;\n    }\n    get type() {\n      return name;\n    }\n    get isParenthesisNode() {\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    _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    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    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    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    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    _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    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    static fromJSON(json) {\n      return new ParenthesisNode(json.content);\n    }\n\n    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string} str\n     * @override\n     */\n    _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    _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  _defineProperty(ParenthesisNode, \"name\", name);\n  return ParenthesisNode;\n}, {\n  isClass: true,\n  isNode: true\n});", "import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { isNode, isSymbolNode } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nimport { getPrecedence } from '../operators.js';\nvar name = 'RangeNode';\nvar dependencies = ['Node'];\nexport var createRangeNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    Node\n  } = _ref;\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 = getPrecedence(node, parenthesis, implicit);\n    var parens = {};\n    var startPrecedence = getPrecedence(node.start, parenthesis, implicit);\n    parens.start = startPrecedence !== null && startPrecedence <= precedence || parenthesis === 'all';\n    if (node.step) {\n      var stepPrecedence = getPrecedence(node.step, parenthesis, implicit);\n      parens.step = stepPrecedence !== null && stepPrecedence <= precedence || parenthesis === 'all';\n    }\n    var endPrecedence = getPrecedence(node.end, parenthesis, implicit);\n    parens.end = endPrecedence !== null && endPrecedence <= precedence || parenthesis === 'all';\n    return parens;\n  }\n  class RangeNode extends Node {\n    /**\n     * @constructor RangeNode\n     * @extends {Node}\n     * create a range\n     * @param {Node} start  included lower-bound\n     * @param {Node} end    included upper-bound\n     * @param {Node} [step] optional step\n     */\n    constructor(start, end, step) {\n      super();\n      // validate inputs\n      if (!isNode(start)) throw new TypeError('Node expected');\n      if (!isNode(end)) throw new TypeError('Node expected');\n      if (step && !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    }\n    get type() {\n      return name;\n    }\n    get isRangeNode() {\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    needsEnd() {\n      // find all `end` symbols in this RangeNode\n      var endSymbols = this.filter(function (node) {\n        return 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    _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    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    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    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    _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    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    static fromJSON(json) {\n      return new RangeNode(json.start, json.end, json.step);\n    }\n\n    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _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    _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  _defineProperty(RangeNode, \"name\", name);\n  return RangeNode;\n}, {\n  isClass: true,\n  isNode: true\n});", "import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { getPrecedence } from '../operators.js';\nimport { escape } from '../../utils/string.js';\nimport { getSafeProperty } from '../../utils/customs.js';\nimport { latexOperators } from '../../utils/latex.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'RelationalNode';\nvar dependencies = ['Node'];\nexport var createRelationalNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    Node\n  } = _ref;\n  var operatorMap = {\n    equal: '==',\n    unequal: '!=',\n    smaller: '<',\n    larger: '>',\n    smallerEq: '<=',\n    largerEq: '>='\n  };\n  class RelationalNode extends Node {\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    constructor(conditionals, params) {\n      super();\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    }\n    get type() {\n      return name;\n    }\n    get isRelationalNode() {\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    _compile(math, argNames) {\n      var self = this;\n      var compiled = this.params.map(p => p._compile(math, argNames));\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 = 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    forEach(callback) {\n      this.params.forEach((n, i) => callback(n, 'params[' + i + ']', this), 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    map(callback) {\n      return new RelationalNode(this.conditionals.slice(), this.params.map((n, i) => this._ifNode(callback(n, 'params[' + i + ']', this)), this));\n    }\n\n    /**\n     * Create a clone of this node, a shallow copy\n     * @return {RelationalNode}\n     */\n    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    _toString(options) {\n      var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n      var precedence = getPrecedence(this, parenthesis, options && options.implicit);\n      var paramStrings = this.params.map(function (p, index) {\n        var paramPrecedence = 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    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    static fromJSON(json) {\n      return new RelationalNode(json.conditionals, json.params);\n    }\n\n    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toHTML(options) {\n      var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n      var precedence = getPrecedence(this, parenthesis, options && options.implicit);\n      var paramStrings = this.params.map(function (p, index) {\n        var paramPrecedence = 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\">' + 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    _toTex(options) {\n      var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n      var precedence = getPrecedence(this, parenthesis, options && options.implicit);\n      var paramStrings = this.params.map(function (p, index) {\n        var paramPrecedence = 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 += latexOperators[this.conditionals[i]] + paramStrings[i + 1];\n      }\n      return ret;\n    }\n  }\n  _defineProperty(RelationalNode, \"name\", name);\n  return RelationalNode;\n}, {\n  isClass: true,\n  isNode: true\n});", "import { escape } from '../../utils/string.js';\nimport { getSafeProperty } from '../../utils/customs.js';\nimport { factory } from '../../utils/factory.js';\nimport { toSymbol } from '../../utils/latex.js';\nvar name = 'SymbolNode';\nvar dependencies = ['math', '?Unit', 'Node'];\nexport var createSymbolNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    math,\n    Unit,\n    Node\n  } = _ref;\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  class SymbolNode extends Node {\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    constructor(name) {\n      super();\n      // validate input\n      if (typeof name !== 'string') {\n        throw new TypeError('String expected for parameter \"name\"');\n      }\n      this.name = name;\n    }\n    get type() {\n      return 'SymbolNode';\n    }\n    get isSymbolNode() {\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    _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 getSafeProperty(args, name);\n        };\n      } else if (name in math) {\n        return function (scope, args, context) {\n          return scope.has(name) ? scope.get(name) : 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    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    map(callback) {\n      return this.clone();\n    }\n\n    /**\n     * Throws an error 'Undefined symbol {name}'\n     * @param {string} name\n     */\n    static onUndefinedSymbol(name) {\n      throw new Error('Undefined symbol ' + name);\n    }\n\n    /**\n     * Create a clone of this node, a shallow copy\n     * @return {SymbolNode}\n     */\n    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    _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    _toHTML(options) {\n      var name = 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    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    static fromJSON(json) {\n      return new SymbolNode(json.name);\n    }\n\n    /**\n     * Get LaTeX representation\n     * @param {Object} options\n     * @return {string} str\n     * @override\n     */\n    _toTex(options) {\n      var isUnit = false;\n      if (typeof math[this.name] === 'undefined' && isValuelessUnit(this.name)) {\n        isUnit = true;\n      }\n      var symbol = 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  return SymbolNode;\n}, {\n  isClass: true,\n  isNode: true\n});", "import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { isAccessorNode, isFunctionAssignmentNode, isIndexNode, isNode, isSymbolNode } from '../../utils/is.js';\nimport { escape, format } from '../../utils/string.js';\nimport { hasOwnProperty } from '../../utils/object.js';\nimport { getSafeProperty, getSafeMethod } from '../../utils/customs.js';\nimport { createSubScope } from '../../utils/scope.js';\nimport { factory } from '../../utils/factory.js';\nimport { defaultTemplate, latexFunctions } from '../../utils/latex.js';\nvar name = 'FunctionNode';\nvar dependencies = ['math', 'Node', 'SymbolNode'];\nexport var createFunctionNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var _FunctionNode;\n  var {\n    math,\n    Node,\n    SymbolNode\n  } = _ref;\n  /* format to fixed length */\n  var strin = entity => format(entity, {\n    truncate: 78\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 (typeof property) {\n            case 'string':\n              latex += property;\n              break;\n            case 'object':\n              if (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 (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 (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  class FunctionNode extends Node {\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 SymbolNode or AccessorNode\n     * @param {./Node[]} args\n     */\n    constructor(fn, args, optional) {\n      super();\n      if (typeof fn === 'string') {\n        fn = new SymbolNode(fn);\n      }\n\n      // validate input\n      if (!isNode(fn)) throw new TypeError('Node expected as parameter \"fn\"');\n      if (!Array.isArray(args) || !args.every(isNode)) {\n        throw new TypeError('Array containing Nodes expected for parameter \"args\"');\n      }\n      var optionalType = typeof optional;\n      if (!(optionalType === 'undefined' || optionalType === 'boolean')) {\n        throw new TypeError('optional flag, if specified, must be boolean');\n      }\n      this.fn = fn;\n      this.args = args || [];\n      this.optional = !!optional;\n    }\n\n    // readonly property name\n    get name() {\n      return this.fn.name || '';\n    }\n    get type() {\n      return name;\n    }\n    get isFunctionNode() {\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    _compile(math, argNames) {\n      // compile arguments\n      var evalArgs = this.args.map(arg => arg._compile(math, argNames));\n      var fromOptionalChaining = this.optional || isAccessorNode(this.fn) && this.fn.optionalChaining;\n      if (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 ? getSafeProperty(math, _name) : undefined;\n          var isRaw = typeof fn === 'function' && fn.rawArgs === true;\n          var resolveFn = scope => {\n            var value;\n            if (scope.has(_name)) {\n              value = scope.get(_name);\n            } else if (_name in math) {\n              value = getSafeProperty(math, _name);\n            } else if (fromOptionalChaining) value = undefined;else return FunctionNode.onUndefinedFunction(_name);\n            if (typeof value === 'function' || fromOptionalChaining && value === undefined) {\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\n              // the original function can be overwritten in the scope with a non-rawArgs function\n              if (fn.rawArgs === true) {\n                return fn(rawArgs, math, createSubScope(scope, args));\n              } else {\n                // \"regular\" evaluation\n                var values = evalArgs.map(evalArg => evalArg(scope, args, context));\n                return fn(...values);\n              }\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                  if (fromOptionalChaining && fn === undefined) return undefined;\n                  return fn();\n                };\n              case 1:\n                return function evalFunctionNode(scope, args, context) {\n                  var fn = resolveFn(scope);\n                  if (fromOptionalChaining && fn === undefined) return undefined;\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                  if (fromOptionalChaining && fn === undefined) return undefined;\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                  if (fromOptionalChaining && fn === undefined) return undefined;\n                  var values = evalArgs.map(evalArg => evalArg(scope, args, context));\n                  return fn(...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 = getSafeProperty(args, _name);\n            if (fromOptionalChaining && fn === undefined) return undefined;\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, createSubScope(scope, args));\n            } else {\n              var values = evalArgs.map(evalArg => evalArg(scope, args, context));\n              return fn.apply(fn, values);\n            }\n          };\n        }\n      } else if (isAccessorNode(this.fn) && 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\n          // Optional chaining: if the base object is nullish, short-circuit to undefined\n          if (fromOptionalChaining && (object == null || object[prop] === undefined)) {\n            return undefined;\n          }\n          var fn = getSafeMethod(object, prop);\n          if (fn !== null && fn !== void 0 && fn.rawArgs) {\n            // \"Raw\" evaluation\n            return fn(_rawArgs2, math, createSubScope(scope, args));\n          } else {\n            // \"regular\" evaluation\n            var values = evalArgs.map(evalArg => evalArg(scope, args, context));\n            return fn.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 (fromOptionalChaining && fn === undefined) return undefined;\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, createSubScope(scope, args));\n          } else {\n            // \"regular\" evaluation\n            var values = evalArgs.map(evalArg => evalArg(scope, args, context));\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    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    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    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    /**\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    toString(options) {\n      var customString;\n      var name = this.fn.toString(options);\n      if (options && typeof options.handler === 'object' && hasOwnProperty(options.handler, name)) {\n        // callback is a map of callback functions\n        customString = options.handler[name](this, options);\n      }\n      if (typeof customString !== 'undefined') {\n        return customString;\n      }\n\n      // fall back to Node's toString\n      return super.toString(options);\n    }\n\n    /**\n     * Get string representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toString(options) {\n      var args = this.args.map(function (arg) {\n        return arg.toString(options);\n      });\n      var fn = 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    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    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _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\">' + 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    toTex(options) {\n      var customTex;\n      if (options && typeof options.handler === 'object' && hasOwnProperty(options.handler, this.name)) {\n        // callback is a map of callback functions\n        customTex = options.handler[this.name](this, options);\n      }\n      if (typeof customTex !== 'undefined') {\n        return customTex;\n      }\n\n      // fall back to Node's toTex\n      return super.toTex(options);\n    }\n\n    /**\n     * Get LaTeX representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _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 (latexFunctions[this.name]) {\n        latexConverter = latexFunctions[this.name];\n      }\n\n      // toTex property on the function itself\n      if (math[this.name] && (typeof math[this.name].toTex === 'function' || typeof math[this.name].toTex === 'object' || typeof math[this.name].toTex === 'string')) {\n        // .toTex is a callback function\n        latexConverter = math[this.name].toTex;\n      }\n      var customToTex;\n      switch (typeof 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 (typeof 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(defaultTemplate, this, options);\n    }\n\n    /**\n     * Get identifier.\n     * @return {string}\n     */\n    getIdentifier() {\n      return this.type + ':' + this.name;\n    }\n  }\n  _FunctionNode = FunctionNode;\n  _defineProperty(FunctionNode, \"name\", name);\n  _defineProperty(FunctionNode, \"onUndefinedFunction\", function (name) {\n    throw new Error('Undefined function ' + name);\n  });\n  _defineProperty(FunctionNode, \"fromJSON\", function (json) {\n    return new _FunctionNode(json.fn, json.args);\n  });\n  return FunctionNode;\n}, {\n  isClass: true,\n  isNode: true\n});", "import _extends from \"@babel/runtime/helpers/extends\";\nimport { factory } from '../utils/factory.js';\nimport { isAccessorNode, isConstantNode, isFunctionNode, isOperatorNode, isSymbolNode, rule2Node } from '../utils/is.js';\nimport { deepMap } from '../utils/collection.js';\nimport { safeNumberType } from '../utils/number.js';\nimport { hasOwnProperty } from '../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'];\nexport var createParse = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    numeric,\n    config,\n    AccessorNode,\n    ArrayNode,\n    AssignmentNode,\n    BlockNode,\n    ConditionalNode,\n    ConstantNode,\n    FunctionAssignmentNode,\n    FunctionNode,\n    IndexNode,\n    ObjectNode,\n    OperatorNode,\n    ParenthesisNode,\n    RangeNode,\n    RelationalNode,\n    SymbolNode\n  } = _ref;\n  /**\n   * Parse an expression. Returns a node tree, which can be evaluated by\n   * invoking node.evaluate() or transformed into a functional object via node.compile().\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')\n   *     node2.evaluate(scope) // 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   * History:\n   *\n   *     v0.9   Created\n   *     v0.13  Switched to one-based indices\n   *     v0.14  Added `[1,2;3,4]` notation for matrices\n   *     v0.18  Dropped the `function` keyword\n   *     v0.20  Added ternary conditional\n   *     v0.27  Allow multi-line expressions; allow functions that receive\n   *            unevaluated parameters (`rawArgs`)\n   *     v3     Add object notation; allow assignments internal to other\n   *            expressions\n   *     v7.3   Supported binary, octal, and hexadecimal notation\n   *     v9.5   Support for calculations with percentages\n   *     v12.4  Allow trailing commas in matrices\n   *     v14.8  Add nullish coalescing operator\n   *     v15.1  Add optional chaining operator\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 Array__Matrix(expressions) {\n      return parseMultiple(expressions, {});\n    },\n    'string, Object': function string_Object(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 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    '>>': 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\n  };\n  var NUMERIC_CONSTANTS = ['NaN', 'Infinity'];\n  var ESCAPE_CHARACTERS = {\n    '\"': '\"',\n    \"'\": \"'\",\n    '\\\\': '\\\\',\n    '/': '/',\n    b: '\\b',\n    f: '\\f',\n    n: '\\n',\n    r: '\\r',\n    t: '\\t'\n    // note that \\u is handled separately in parseStringToken()\n  };\n  function initialState() {\n    return {\n      extraNodes: {},\n      // current extra nodes, must be careful not to mutate\n      expression: '',\n      // current expression\n      comment: '',\n      // last parsed comment\n      index: 0,\n      // current index in expr\n      token: '',\n      // current token\n      tokenType: TOKENTYPE.NULL,\n      // type of the token\n      nestingLevel: 0,\n      // level of nesting inside parameters, used to ignore newline characters\n      conditionalLevel: null // when a conditional is being parsed, the level of the conditional is stored here\n    };\n  }\n\n  /**\n   * View upto `length` characters of the expression starting at the current character.\n   *\n   * @param {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    // Special case: the check for '?.' is to prevent a case like 'a?.3:.7' from being interpreted as optional chaining\n    // TODO: refactor the tokenization into some better way to deal with cases like 'a?.3:.7', see https://github.com/josdejong/mathjs/pull/3584\n    if (c2.length === 2 && DELIMITERS[c2] && (c2 !== '?.' || !parse.isDigit(state.expression.charAt(state.index + 2)))) {\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.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state)) || parse.isDigit(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.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state)) || parse.isDigit(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 (parse.isDecimalMark(nextCharacter(state), state.expression.charAt(state.index + 2))) {\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 (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 === '\\u00A0' || 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   * 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    _extends(state, {\n      expression,\n      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,\n          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,\n          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 (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 (isAccessorNode(node)) {\n        // parse a matrix subset assignment like 'A[1,2] = 4'\n        if (node.optionalChaining) {\n          throw createSyntaxError(state, 'Cannot assign to optional chain');\n        }\n        getTokenSkipNewline(state);\n        value = parseAssignment(state);\n        return new AssignmentNode(node.object, node.index, value);\n      } else if (isFunctionNode(node) && 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 (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 (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(c => c.fn), 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 (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    while (hasOwnProperty(operators, state.token)) {\n      name = state.token;\n      fn = operators[name];\n      getTokenSkipNewline(state);\n      if (name === 'in' && '])},;'.includes(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      if (state.conditionalLevel === state.nestingLevel) {\n        // we are in the midst of parsing a conditional operator, so not\n        // a range, but rather an empty true-expr, which is considered a\n        // syntax error\n        throw createSyntaxError(state, 'The true-expression of a conditional operator may not be empty');\n      } else {\n        // implicit start of range = 1 (one-based)\n        node = new ConstantNode(1);\n      }\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    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 = parseMultiplyDivideModulus(state);\n    var operators = {\n      '+': 'add',\n      '-': 'subtract'\n    };\n    while (hasOwnProperty(operators, state.token)) {\n      name = state.token;\n      fn = operators[name];\n      getTokenSkipNewline(state);\n      var rightNode = parseMultiplyDivideModulus(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 parseMultiplyDivideModulus(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      '%': 'mod',\n      mod: 'mod'\n    };\n    while (true) {\n      if (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' && isConstantNode(node) || state.token === 'in' && isOperatorNode(node) && node.fn === 'unaryMinus' && isConstantNode(node.args[0]) || state.tokenType === TOKENTYPE.NUMBER && !isConstantNode(last) && (!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 = parseUnaryPercentage(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 === '/' && rule2Node(last)) {\n        // Look ahead to see if the next token is a number\n        tokenStates.push(_extends({}, 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(_extends({}, 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 === '(' || state.token === 'in') {\n            // We've matched the pattern \"number / number symbol\".\n            // Rewind once and build the \"number / number\" node; the symbol will be consumed later\n            _extends(state, tokenStates.pop());\n            tokenStates.pop();\n            last = parseUnaryPercentage(state);\n            node = new OperatorNode('/', 'divide', [node, last]);\n          } else {\n            // Not a match, so rewind\n            tokenStates.pop();\n            _extends(state, tokenStates.pop());\n            break;\n          }\n        } else {\n          // Not a match, so rewind\n          _extends(state, tokenStates.pop());\n          break;\n        }\n      } else {\n        break;\n      }\n    }\n    return node;\n  }\n\n  /**\n   * Unary percentage operator (treated as `value / 100`)\n   * @return {Node} node\n   * @private\n   */\n  function parseUnaryPercentage(state) {\n    var node = parseUnary(state);\n    if (state.token === '%') {\n      var previousState = _extends({}, state);\n      getTokenSkipNewline(state);\n      // We need to decide if this is a unary percentage % or binary modulo %\n      // So we attempt to parse a unary expression at this point.\n      // If it fails, then the only possibility is that this is a unary percentage.\n      // If it succeeds, then we presume that this must be binary modulo, since the\n      // only things that parseUnary can handle are _higher_ precedence than unary %.\n      try {\n        parseUnary(state);\n        // Not sure if we could somehow use the result of that parseUnary? Without\n        // further analysis/testing, safer just to discard and let the parse proceed\n        _extends(state, previousState);\n      } catch (_unused) {\n        // Not seeing a term at this point, so was a unary %\n        node = new OperatorNode('/', 'divide', [node, new ConstantNode(100)], false, true);\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 (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 = parseNullishCoalescing(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   * nullish coalescing operator\n   * @return {Node} node\n   * @private\n   */\n  function parseNullishCoalescing(state) {\n    var node = parseLeftHandOperators(state);\n    while (state.token === '??') {\n      // eslint-disable-line no-unmodified-loop-condition\n      getTokenSkipNewline(state);\n      node = new OperatorNode('??', 'nullish', [node, parseLeftHandOperators(state)]);\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 (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 && 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 (hasOwnProperty(CONSTANTS, name)) {\n        // true, false, null, ...\n        node = new ConstantNode(CONSTANTS[name]);\n      } else if (NUMERIC_CONSTANTS.includes(name)) {\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 parseString(state);\n  }\n\n  /**\n   * parse accessors:\n   * - function invocation in round brackets (...), for example sqrt(2) or sqrt?.(2) with optional chaining\n   * - index enclosed in square brackets [...], for example A[2,3] or A?.[2,3] with optional chaining\n   * - dot notation for properties, like foo.bar or foo?.bar with optional chaining\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\n    // Iterate and handle chained accessors, including repeated optional chaining\n    while (true) {\n      // eslint-disable-line no-unmodified-loop-condition\n      // Track whether an optional chaining operator precedes the next accessor\n      var optional = false;\n\n      // Consume an optional chaining operator if present\n      if (state.token === '?.') {\n        optional = true;\n        // consume the '?.' token\n        getToken(state);\n      }\n      var hasNextAccessor = (state.token === '(' || state.token === '[' || state.token === '.') && (!types || types.includes(state.token));\n      if (!(optional || hasNextAccessor)) {\n        break;\n      }\n      params = [];\n      if (state.token === '(') {\n        if (optional || isSymbolNode(node) || isAccessorNode(node)) {\n          // function invocation: fn(2, 3) or obj.fn(2, 3) or (anything)?.(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, optional);\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), optional);\n      } else {\n        // dot notation like variable.prop\n        // consume the `.` (if it was ?., already consumed):\n        if (!optional) getToken(state);\n        var isPropertyName = state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS;\n        if (!isPropertyName) {\n          var message = 'Property name expected after ';\n          message += optional ? 'optional chain' : 'dot';\n          throw createSyntaxError(state, message);\n        }\n        params.push(new ConstantNode(state.token));\n        getToken(state);\n        var dotNotation = true;\n        node = new AccessorNode(node, new IndexNode(params, dotNotation), optional);\n      }\n    }\n    return node;\n  }\n\n  /**\n   * Parse a single or double quoted string.\n   * @return {Node} node\n   * @private\n   */\n  function parseString(state) {\n    var node, str;\n    if (state.token === '\"' || state.token === \"'\") {\n      str = parseStringToken(state, state.token);\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 or double quotes\n   * @param {Object} state\n   * @param {\"'\" | \"\\\"\"} quote\n   * @return {string}\n   */\n  function parseStringToken(state, quote) {\n    var str = '';\n    while (currentCharacter(state) !== '' && currentCharacter(state) !== quote) {\n      if (currentCharacter(state) === '\\\\') {\n        next(state);\n        var char = currentCharacter(state);\n        var escapeChar = ESCAPE_CHARACTERS[char];\n        if (escapeChar !== undefined) {\n          // an escaped control character like \\\" or \\n\n          str += escapeChar;\n          state.index += 1;\n        } else if (char === 'u') {\n          // escaped unicode character\n          var unicode = state.expression.slice(state.index + 1, state.index + 5);\n          if (/^[0-9A-Fa-f]{4}$/.test(unicode)) {\n            // test whether the string holds four hexadecimal values\n            str += String.fromCharCode(parseInt(unicode, 16));\n            state.index += 5;\n          } else {\n            throw createSyntaxError(state, \"Invalid unicode character \\\\u\".concat(unicode));\n          }\n        } else {\n          throw createSyntaxError(state, \"Bad escape character \\\\\".concat(char));\n        }\n      } else {\n        // any regular character\n        str += currentCharacter(state);\n        next(state);\n      }\n    }\n    getToken(state);\n    if (state.token !== quote) {\n      throw createSyntaxError(state, \"End of string \".concat(quote, \" expected\"));\n    }\n    getToken(state);\n    return str;\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            if (state.token !== ']') {\n              params[rows] = parseRow(state);\n              rows++;\n            }\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      if (state.token !== ']' && state.token !== ';') {\n        params[len] = parseAssignment(state);\n        len++;\n      }\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 === '\"' || state.token === \"'\") {\n            key = parseStringToken(state, state.token);\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      var numericType = safeNumberType(numberStr, config);\n      var value = numeric(numberStr, numericType);\n      return new ConstantNode(value);\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});", "import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'compile';\nvar dependencies = ['typed', 'parse'];\nexport var createCompile = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    parse\n  } = _ref;\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 Array__Matrix(expr) {\n      return deepMap(expr, function (entry) {\n        return parse(entry).compile();\n      });\n    }\n  });\n});", "import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { createEmptyMap } from '../../utils/map.js';\nvar name = 'evaluate';\nvar dependencies = ['typed', 'parse'];\nexport var createEvaluate = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    parse\n  } = _ref;\n  /**\n   * Evaluate an expression.\n   *\n   * The expression parser does not use JavaScript. Its syntax is close\n   * to JavaScript but more suited for mathematical expressions.\n   * See [https://mathjs.org/docs/expressions/syntax.html](https://mathjs.org/docs/expressions/syntax.html) to learn\n   * the syntax and get an overview of the exact differences from JavaScript.\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 = createEmptyMap();\n      return parse(expr).compile().evaluate(scope);\n    },\n    'string, Map | Object': function string_Map__Object(expr, scope) {\n      return parse(expr).compile().evaluate(scope);\n    },\n    'Array | Matrix': function Array__Matrix(expr) {\n      var scope = createEmptyMap();\n      return deepMap(expr, function (entry) {\n        return parse(entry).compile().evaluate(scope);\n      });\n    },\n    'Array | Matrix, Map | Object': function Array__Matrix_Map__Object(expr, scope) {\n      return deepMap(expr, function (entry) {\n        return parse(entry).compile().evaluate(scope);\n      });\n    }\n  });\n});", "import { factory } from '../utils/factory.js';\nimport { isFunction } from '../utils/is.js';\nimport { createEmptyMap, toObject } from '../utils/map.js';\nvar name = 'Parser';\nvar dependencies = ['evaluate', 'parse'];\nexport var createParserClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    evaluate,\n    parse\n  } = _ref;\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')                 // 3.5\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: 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 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  function isValidVariableName(name) {\n    if (name.length === 0) {\n      return false;\n    }\n    for (var i = 0; i < name.length; i++) {\n      var cPrev = name.charAt(i - 1);\n      var c = name.charAt(i);\n      var cNext = name.charAt(i + 1);\n      var valid = parse.isAlpha(c, cPrev, cNext) || i > 0 && parse.isDigit(c);\n      if (!valid) {\n        return false;\n      }\n    }\n    return true;\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    if (!isValidVariableName(name)) {\n      throw new Error(\"Invalid variable name: '\".concat(name, \"'. Variable names must follow the specified rules.\"));\n    }\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  Parser.prototype.toJSON = function () {\n    var json = {\n      mathjs: 'Parser',\n      variables: {},\n      functions: {}\n    };\n    for (var [_name2, value] of this.scope) {\n      if (isFunction(value)) {\n        if (!isExpressionFunction(value)) {\n          throw new Error(\"Cannot serialize external function \".concat(_name2));\n        }\n        json.functions[_name2] = \"\".concat(value.syntax, \" = \").concat(value.expr);\n      } else {\n        json.variables[_name2] = value;\n      }\n    }\n    return json;\n  };\n  Parser.fromJSON = function (json) {\n    var parser = new Parser();\n    Object.entries(json.variables).forEach(_ref2 => {\n      var [name, value] = _ref2;\n      return parser.set(name, value);\n    });\n    Object.entries(json.functions).forEach(_ref3 => {\n      var [_name, fn] = _ref3;\n      return parser.evaluate(fn);\n    });\n    return parser;\n  };\n  return Parser;\n}, {\n  isClass: true\n});\nfunction isExpressionFunction(value) {\n  return typeof value === 'function' && typeof value.syntax === 'string' && typeof value.expr === 'string';\n}", "import { factory } from '../../utils/factory.js';\nvar name = 'parser';\nvar dependencies = ['typed', 'Parser'];\nexport var createParser = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    Parser\n  } = _ref;\n  /**\n   * Create a `math.Parser` object that keeps a context of variables and their values, allowing the evaluation of expressions in that context.\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')                // 3.5\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});", "import { clone } from '../../../utils/object.js';\nimport { factory } from '../../../utils/factory.js';\nvar name = 'lup';\nvar dependencies = ['typed', 'matrix', 'abs', 'addScalar', 'divideScalar', 'multiplyScalar', 'subtractScalar', 'larger', 'equalScalar', 'unaryMinus', 'DenseMatrix', 'SparseMatrix', 'Spa'];\nexport var createLup = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    abs,\n    addScalar,\n    divideScalar,\n    multiplyScalar,\n    subtractScalar,\n    larger,\n    equalScalar,\n    unaryMinus,\n    DenseMatrix,\n    SparseMatrix,\n    Spa\n  } = _ref;\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 = 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] = subtractScalar(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});", "import _extends from \"@babel/runtime/helpers/extends\";\nimport { factory } from '../../../utils/factory.js';\nvar name = 'qr';\nvar dependencies = ['typed', 'matrix', 'zeros', 'identity', 'isZero', 'equal', 'sign', 'sqrt', 'conj', 'unaryMinus', 'addScalar', 'divideScalar', 'multiplyScalar', 'subtractScalar', 'complex'];\nexport var createQr = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    zeros,\n    identity,\n    isZero,\n    equal,\n    sign,\n    sqrt,\n    conj,\n    unaryMinus,\n    addScalar,\n    divideScalar,\n    multiplyScalar,\n    subtractScalar,\n    complex\n  } = _ref;\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 _extends(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\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 = subtractScalar(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(subtractScalar(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(subtractScalar(Qdata[i][j], multiplyScalar(s, conj(w[j]))), conjSgn);\n          }\n        }\n      }\n    }\n\n    // return matrices\n    return {\n      Q,\n      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});", "// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\n\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 */\nexport function csPermute(a, pinv, q, values) {\n  // a arrays\n  var avalues = a._values;\n  var aindex = a._index;\n  var aptr = a._ptr;\n  var asize = a._size;\n  var adt = a._datatype;\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}", "// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\n\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 */\nexport function 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}", "// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\nimport { csTdfs } from './csTdfs.js';\n\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 */\nexport function 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 = csTdfs(j, k, w, head, next, post, stack);\n  }\n  return post;\n}", "// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\n\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 */\nexport function 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}", "// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\n\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 */\nexport function csFkeep(a, callback, other) {\n  // a arrays\n  var avalues = a._values;\n  var aindex = a._index;\n  var aptr = a._ptr;\n  var asize = a._size;\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}", "// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\n\n/**\n * This function \"flips\" its input about the integer -1.\n *\n * @param {Number}  i               The value to flip\n */\nexport function csFlip(i) {\n  // flip the value\n  return -i - 2;\n}", "// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\nimport { factory } from '../../../utils/factory.js';\nimport { csFkeep } from './csFkeep.js';\nimport { csFlip } from './csFlip.js';\nimport { csTdfs } from './csTdfs.js';\nvar name = 'csAmd';\nvar dependencies = ['add', 'multiply', 'transpose'];\nexport var createCsAmd = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    add,\n    multiply,\n    transpose\n  } = _ref;\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   * @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    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      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] = 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] = 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] = 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] = 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] = 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 = 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] = 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});", "// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\n\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 */\nexport function 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    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,\n    q\n  };\n}", "// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\nimport { factory } from '../../../utils/factory.js';\nimport { csLeaf } from './csLeaf.js';\nvar name = 'csCounts';\nvar dependencies = ['transpose'];\nexport var createCsCounts = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    transpose\n  } = _ref;\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  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 = 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});", "// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\nimport { csPermute } from './csPermute.js';\nimport { csPost } from './csPost.js';\nimport { csEtree } from './csEtree.js';\nimport { createCsAmd } from './csAmd.js';\nimport { createCsCounts } from './csCounts.js';\nimport { factory } from '../../../utils/factory.js';\nvar name = 'csSqr';\nvar dependencies = ['add', 'multiply', 'transpose'];\nexport var createCsSqr = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    add,\n    multiply,\n    transpose\n  } = _ref;\n  var csAmd = createCsAmd({\n    add,\n    multiply,\n    transpose\n  });\n  var csCounts = createCsCounts({\n    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  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 ? csPermute(a, null, s.q, 0) : a;\n      // etree of C'*C, where C=A(:,q)\n      s.parent = csEtree(c, 1);\n      // post order elimination tree\n      var post = 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});", "// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\n\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 */\nexport function csMarked(w, j) {\n  // check node is marked\n  return w[j] < 0;\n}", "// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\n\nimport { csFlip } from './csFlip.js';\n\n/**\n * Marks the node at w[j]\n *\n * @param {Array}   w               The array\n * @param {Number}  j               The array index\n */\nexport function csMark(w, j) {\n  // mark w[j]\n  w[j] = csFlip(w[j]);\n}", "// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\nimport { csFlip } from './csFlip.js';\n\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 */\nexport function csUnflip(i) {\n  // flip the value if it is negative\n  return i < 0 ? csFlip(i) : i;\n}", "// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\nimport { csMarked } from './csMarked.js';\nimport { csMark } from './csMark.js';\nimport { csUnflip } from './csUnflip.js';\n\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 */\nexport function csDfs(j, g, top, xi, pinv) {\n  // g arrays\n  var index = g._index;\n  var ptr = g._ptr;\n  var size = g._size;\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 (!csMarked(ptr, j)) {\n      // mark node j as visited\n      csMark(ptr, j);\n      // update stack (last n entries in xi)\n      xi[n + head] = jnew < 0 ? 0 : 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 : 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 (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}", "// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\n\nimport { csMarked } from './csMarked.js';\nimport { csMark } from './csMark.js';\nimport { csDfs } from './csDfs.js';\n\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 */\nexport function 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 (!csMarked(gptr, i)) {\n      // start a dfs at unmarked node i\n      top = 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    csMark(gptr, xi[p]);\n  }\n  return top;\n}", "// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\nimport { csReach } from './csReach.js';\nimport { factory } from '../../../utils/factory.js';\nvar name = 'csSpsolve';\nvar dependencies = ['divideScalar', 'multiply', 'subtract'];\nexport var createCsSpsolve = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    divideScalar,\n    multiply,\n    subtract\n  } = _ref;\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  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 = 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});", "// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\n\nimport { factory } from '../../../utils/factory.js';\nimport { createCsSpsolve } from './csSpsolve.js';\nvar name = 'csLu';\nvar dependencies = ['abs', 'divideScalar', 'multiply', 'subtract', 'larger', 'largerEq', 'SparseMatrix'];\nexport var createCsLu = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    abs,\n    divideScalar,\n    multiply,\n    subtract,\n    larger,\n    largerEq,\n    SparseMatrix\n  } = _ref;\n  var csSpsolve = createCsSpsolve({\n    divideScalar,\n    multiply,\n    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  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,\n      U,\n      pinv\n    };\n  };\n});", "import { isInteger } from '../../../utils/number.js';\nimport { factory } from '../../../utils/factory.js';\nimport { createCsSqr } from '../sparse/csSqr.js';\nimport { createCsLu } from '../sparse/csLu.js';\nvar name = 'slu';\nvar dependencies = ['typed', 'abs', 'add', 'multiply', 'transpose', 'divideScalar', 'subtract', 'larger', 'largerEq', 'SparseMatrix'];\nexport var createSlu = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    abs,\n    add,\n    multiply,\n    transpose,\n    divideScalar,\n    subtract,\n    larger,\n    largerEq,\n    SparseMatrix\n  } = _ref;\n  var csSqr = createCsSqr({\n    add,\n    multiply,\n    transpose\n  });\n  var csLu = createCsLu({\n    abs,\n    divideScalar,\n    multiply,\n    subtract,\n    larger,\n    largerEq,\n    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 SparseMatrix_number_number(a, order, threshold) {\n      // verify order\n      if (!isInteger(order) || order < 0 || order > 3) {\n        throw new Error('Symbolic Ordering and Analysis order must be an integer number in the interval [0, 3]');\n      }\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});", "// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\n\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 */\nexport function 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}", "import { isArray, isMatrix } from '../../../utils/is.js';\nimport { factory } from '../../../utils/factory.js';\nimport { createSolveValidation } from './utils/solveValidation.js';\nimport { csIpvec } from '../sparse/csIpvec.js';\nvar name = 'lusolve';\nvar dependencies = ['typed', 'matrix', 'lup', 'slu', 'usolve', 'lsolve', 'DenseMatrix'];\nexport var createLusolve = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    lup,\n    slu,\n    usolve,\n    lsolve,\n    DenseMatrix\n  } = _ref;\n  var solveValidation = createSolveValidation({\n    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 Array_Array__Matrix(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 DenseMatrix_Array__Matrix(a, b) {\n      var d = lup(a);\n      return _lusolve(d.L, d.U, d.p, null, b);\n    },\n    'SparseMatrix, Array | Matrix': function SparseMatrix_Array__Matrix(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 SparseMatrix_Array__Matrix_number_number(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 Object_Array__Matrix(d, b) {\n      return _lusolve(d.L, d.U, d.p, d.q, b);\n    }\n  });\n  function _toMatrix(a) {\n    if (isMatrix(a)) {\n      return a;\n    }\n    if (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 = 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 = csIpvec(q, x._data);\n    }\n    return x;\n  }\n});", "import { factory } from '../../utils/factory.js';\nvar name = 'polynomialRoot';\nvar dependencies = ['typed', 'isZero', 'equalScalar', 'add', 'subtract', 'multiply', 'divide', 'sqrt', 'unaryMinus', 'cbrt', 'typeOf', 'im', 're'];\nexport var createPolynomialRoot = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    isZero,\n    equalScalar,\n    add,\n    subtract,\n    multiply,\n    divide,\n    sqrt,\n    unaryMinus,\n    cbrt,\n    typeOf,\n    im,\n    re\n  } = _ref;\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   *     math.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   * History:\n   *\n   *     v11.4  Created\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': (constant, restCoeffs) => {\n      var coeffs = [constant, ...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 [c, b, a] = coeffs;\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 [d, _c, _b, _a] = coeffs;\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(C => divide(add(_b, C, divide(Delta0, C)), _denom));\n            return rawRoots.map(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});", "import { isHelp } from '../utils/is.js';\nimport { clone } from '../utils/object.js';\nimport { format } from '../utils/string.js';\nimport { factory } from '../utils/factory.js';\nvar name = 'Help';\nvar dependencies = ['evaluate'];\nexport var createHelpClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    evaluate\n  } = _ref;\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\n      // after evaluating the examples, we restore config in case the examples\n      // did change the config.\n      var configChanged = false;\n      var originalConfig = evaluate('config()');\n      var scope = {\n        config: newConfig => {\n          configChanged = true;\n          return evaluate('config(newConfig)', {\n            newConfig\n          });\n        }\n      };\n      for (var i = 0; i < doc.examples.length; i++) {\n        var expr = doc.examples[i];\n        desc += '    ' + expr + '\\n';\n        var res = void 0;\n        try {\n          // note: res can be undefined when `expr` is an empty string\n          res = evaluate(expr, scope);\n        } catch (e) {\n          res = e;\n        }\n        if (res !== undefined && !isHelp(res)) {\n          desc += '        ' + format(res, {\n            precision: 14\n          }) + '\\n';\n        }\n      }\n      desc += '\\n';\n      if (configChanged) {\n        evaluate('config(originalConfig)', {\n          originalConfig\n        });\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 = 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(prop => prop !== 'mathjs').forEach(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});", "import { isChain } from '../../utils/is.js';\nimport { format } from '../../utils/string.js';\nimport { hasOwnProperty, lazy } from '../../utils/object.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'Chain';\nvar dependencies = ['?on', 'math', 'typed'];\nexport var createChainClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    on,\n    math,\n    typed\n  } = _ref;\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 (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 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    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 (hasOwnProperty(arg0, _name) && excludedNames[_name] === undefined) {\n          createLazyProxy(_name, () => arg0[_name]);\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});", "export var 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};", "export var falseDocs = {\n  name: 'false',\n  category: 'Constants',\n  syntax: ['false'],\n  description: 'Boolean value false',\n  examples: ['false'],\n  seealso: ['true']\n};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var NaNDocs = {\n  name: 'NaN',\n  category: 'Constants',\n  syntax: ['NaN'],\n  description: 'Not a number',\n  examples: ['NaN', '0 / 0'],\n  seealso: []\n};", "export var nullDocs = {\n  name: 'null',\n  category: 'Constants',\n  syntax: ['null'],\n  description: 'Value null',\n  examples: ['null'],\n  seealso: ['true', 'false']\n};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var trueDocs = {\n  name: 'true',\n  category: 'Constants',\n  syntax: ['true'],\n  description: 'Boolean value true',\n  examples: ['true'],\n  seealso: ['false']\n};", "export var 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};", "export var 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', 'bigint', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit']\n};", "export var bigintDocs = {\n  name: 'bigint',\n  category: 'Construction',\n  syntax: ['bigint(x)'],\n  description: 'Create a bigint, an integer with an arbitrary number of digits, from a number or string.',\n  examples: ['123123123123123123 # a large number will lose digits', 'bigint(\"123123123123123123\")', 'bignumber([\"1\", \"3\", \"5\"])'],\n  seealso: ['boolean', 'bignumber', 'number', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit']\n};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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: ['A = [1, 2, 3; 4, 5, 6]', 'A[1, :]', 'A[1, 2] = 50', 'A[1:2, 1:2] = 1', 'B = [1, 2, 3]', 'B[B>1 and B<3]'],\n  seealso: ['bignumber', 'boolean', 'complex', 'matrix', 'number', 'range', 'string', 'unit']\n};", "export var 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};", "export var 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', 'bigint', 'boolean', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit']\n};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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, \"string\": f(x)=concat(x,x) })', 'double(2)', 'double(\"hello\")'],\n  seealso: []\n};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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: ['simplifyConstant(\"(3-3)*x\")', 'simplifyConstant(parse(\"z-cos(tau/8)\"))'],\n  seealso: ['simplify', 'simplifyCore', 'evaluate']\n};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var ceilDocs = {\n  name: 'ceil',\n  category: 'Arithmetic',\n  syntax: ['ceil(x)', 'ceil(x, n)', 'ceil(unit, valuelessUnit)', 'ceil(unit, n, valuelessUnit)'],\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)', 'ceil(3.241cm, cm)', 'ceil(3.241cm, 2, cm)'],\n  seealso: ['floor', 'fix', 'round']\n};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var fixDocs = {\n  name: 'fix',\n  category: 'Arithmetic',\n  syntax: ['fix(x)', 'fix(x, n)', 'fix(unit, valuelessUnit)', 'fix(unit, n, valuelessUnit)'],\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)', 'fix(3.241cm, cm)', 'fix(3.241cm, 2, cm)'],\n  seealso: ['ceil', 'floor', 'round']\n};", "export var floorDocs = {\n  name: 'floor',\n  category: 'Arithmetic',\n  syntax: ['floor(x)', 'floor(x, n)', 'floor(unit, valuelessUnit)', 'floor(unit, n, valuelessUnit)'],\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)', 'floor(3.241cm, cm)', 'floor(3.241cm, 2, cm)'],\n  seealso: ['ceil', 'fix', 'round']\n};", "export var 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};", "export var hypotDocs = {\n  name: 'hypot',\n  category: 'Arithmetic',\n  syntax: ['hypot(a, b, c, ...)', 'hypot([a, b, c, ...])'],\n  description: 'Calculate the hypotenuse 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};", "export var 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 \u2263 1 (mod b)',\n  examples: ['invmod(8, 12)', 'invmod(7, 13)', 'invmod(15151, 15122)'],\n  seealso: ['gcd', 'xgcd']\n};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var roundDocs = {\n  name: 'round',\n  category: 'Arithmetic',\n  syntax: ['round(x)', 'round(x, n)', 'round(unit, valuelessUnit)', 'round(unit, n, valuelessUnit)'],\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)', 'round(3.241cm, 2, cm)', 'round([3.2, 3.8, -4.7])'],\n  seealso: ['ceil', 'floor', 'fix']\n};", "export var 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>0, -1 when x<0, and 0 when x=0.',\n  examples: ['sign(3.5)', 'sign(-4.2)', 'sign(0)'],\n  seealso: ['abs']\n};", "export var 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};", "export var 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};", "export var sylvesterDocs = {\n  name: 'sylvester',\n  category: 'Algebra',\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]])', 'A = [[-1, -2], [1, 1]]; B = [[2, -1], [1, -2]]; C = [[-3, 2], [3, 0]]', 'sylvester(A, B, C)'],\n  seealso: ['schur', 'lyap']\n};", "export var schurDocs = {\n  name: 'schur',\n  category: 'Algebra',\n  syntax: ['schur(A)'],\n  description: 'Performs a real Schur decomposition of the real matrix A = UTU\\'',\n  examples: ['schur([[1, 0], [-4, 3]])', 'A = [[1, 0], [-4, 3]]', 'schur(A)'],\n  seealso: ['lyap', 'sylvester']\n};", "export var lyapDocs = {\n  name: 'lyap',\n  category: 'Algebra',\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]])', 'A = [[-2, 0], [1, -4]]', 'Q = [[3, 1], [1, 3]]', 'lyap(A,Q)'],\n  seealso: ['schur', 'sylvester']\n};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var stirlingS2Docs = {\n  name: 'stirlingS2',\n  category: 'Combinatorics',\n  syntax: ['stirlingS2(n, k)'],\n  description: 'The 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', 'bernoulli']\n};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var evaluateDocs = {\n  name: 'evaluate',\n  category: 'Expression',\n  syntax: ['evaluate(expression)', 'evaluate(expression, scope)', 'evaluate([expr1, expr2, expr3, ...])', 'evaluate([expr1, expr2, expr3, ...], scope)'],\n  description: 'Evaluate an expression or an array with expressions.',\n  examples: ['evaluate(\"2 + 3\")', 'evaluate(\"sqrt(16)\")', 'evaluate(\"2 inch to cm\")', 'evaluate(\"sin(x * pi)\", { \"x\": 1/2 })', 'evaluate([\"width=2\", \"height=4\",\"width*height\"])'],\n  seealso: ['parser', 'parse', 'compile']\n};", "export var parserDocs = {\n  name: 'parser',\n  category: 'Expression',\n  syntax: ['parser()'],\n  description: 'Create a parser object that keeps a context of variables and their values, allowing the evaluation of expressions in that context.',\n  examples: ['myParser = parser()', 'myParser.evaluate(\"sqrt(3^2 + 4^2)\")', 'myParser.set(\"x\", 3)', 'myParser.evaluate(\"y = x + 3\")', 'myParser.evaluate([\"y = x + 3\", \"y = y + 1\"])', 'myParser.get(\"y\")'],\n  seealso: ['evaluate', 'parse', 'compile']\n};", "export var parseDocs = {\n  name: 'parse',\n  category: 'Expression',\n  syntax: ['parse(expr)', 'parse(expr, options)', 'parse([expr1, expr2, expr3, ...])', 'parse([expr1, expr2, expr3, ...], options)'],\n  description: 'Parse an expression. Returns a node tree, which can be evaluated by invoking node.evaluate() or transformed into a functional object via node.compile().',\n  examples: ['node1 = parse(\"sqrt(3^2 + 4^2)\")', 'node1.evaluate()', 'code1 = node1.compile()', 'code1.evaluate()', 'scope = {a: 3, b: 4}', 'node2 = parse(\"a * b\")', 'node2.evaluate(scope)', 'code2 = node2.compile()', 'code2.evaluate(scope)'],\n  seealso: ['parser', 'evaluate', 'compile']\n};", "export var compileDocs = {\n  name: 'compile',\n  category: 'Expression',\n  syntax: ['compile(expr) ', 'compile([expr1, expr2, expr3, ...])'],\n  description: 'Parse and compile an expression. Returns a an object with a function evaluate([scope]) to evaluate the compiled expression.',\n  examples: ['code1 = compile(\"sqrt(3^2 + 4^2)\")', 'code1.evaluate() ', 'code2 = compile(\"a * b\")', 'code2.evaluate({a: 3, b: 4})'],\n  seealso: ['parser', 'parse', 'evaluate']\n};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var nullishDocs = {\n  name: 'nullish',\n  category: 'Logical',\n  syntax: ['x ?? y', 'nullish(x, y)'],\n  description: 'Nullish coalescing operator. Returns the right-hand operand when the left-hand operand is null or undefined, and otherwise returns the left-hand operand.',\n  examples: ['null ?? 42', 'undefined ?? 42', '0 ?? 42', 'false ?? 42', 'null ?? undefined ?? 42'],\n  seealso: ['and', 'or', 'not']\n};", "export var 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};", "export var 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};", "export var mapSlicesDocs = {\n  name: 'mapSlices',\n  category: 'Matrix',\n  syntax: ['mapSlices(A, dim, callback)'],\n  description: 'Generate a matrix one dimension less than A by applying callback to ' + 'each slice of A along dimension dim.',\n  examples: ['A = [[1, 2], [3, 4]]', 'mapSlices(A, 1, sum)',\n  // returns [4, 6]\n  'mapSlices(A, 2, prod)' // returns [2, 12]\n  ],\n  seealso: ['map', 'forEach']\n};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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 indicate 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: ['A = [1, 2, 4, 7, 0]', 'diff(A)', 'diff(A, 1)', 'B = [[1, 2], [3, 4]]', 'diff(B)', 'diff(B, 1)', 'diff(B, 2)', 'diff(B, bignumber(2))', 'diff([[1, 2], matrix([3, 4])], 2)'],\n  seealso: ['subtract', 'partitionSelect']\n};", "export var 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};", "export var eigsDocs = {\n  name: 'eigs',\n  category: 'Matrix',\n  syntax: ['eigs(x)'],\n  description: 'Calculate the eigenvalues and optionally eigenvectors of a square matrix',\n  examples: ['eigs([[5, 2.3], [2.3, 1]])', 'eigs([[1, 2, 3], [4, 5, 6], [7, 8, 9]], { precision: 1e-6, eigenvectors: false })'],\n  seealso: ['inv']\n};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var pinvDocs = {\n  name: 'pinv',\n  category: 'Matrix',\n  syntax: ['pinv(x)'],\n  description: 'Calculate the Moore\u2013Penrose inverse of a matrix',\n  examples: ['pinv([1, 2; 3, 4])', 'pinv([[1, 0], [0, 1], [0, 1]])', 'pinv(4)'],\n  seealso: ['inv']\n};", "export var 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};", "export var mapDocs = {\n  name: 'map',\n  category: 'Matrix',\n  syntax: ['map(x, callback)', 'map(x, y, ..., callback)'],\n  description: 'Create a new matrix or array with the results of the callback function executed on each entry of the matrix/array or the matrices/arrays.',\n  examples: ['map([1, 2, 3], square)', 'map([1, 2], [3, 4], f(a,b) = a + b)'],\n  seealso: ['filter', 'forEach']\n};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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\")', 'range(1m, 1m, 3m)', '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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var bernoulliDocs = {\n  name: 'bernoulli',\n  category: 'Probability',\n  syntax: ['bernoulli(n)'],\n  description: 'The nth Bernoulli number',\n  examples: ['bernoulli(4)', 'bernoulli(fraction(12))'],\n  seealso: ['combinations', 'gamma', 'stirlingS2']\n};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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. Comparing a value with NaN returns false.',\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};", "export var 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};", "export var 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. Comparing a value with NaN returns false.',\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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var zpk2tfDocs = {\n  name: 'zpk2tf',\n  category: 'Signal',\n  syntax: ['zpk2tf(z, p, k)'],\n  description: 'Compute the transfer function of a zero-pole-gain model.',\n  examples: ['zpk2tf([1, 2], [-1, -2], 1)', 'zpk2tf([1, 2], [-1, -2])', 'zpk2tf([1 - 3i, 2 + 2i], [-1, -2])'],\n  seealso: []\n};", "export var freqzDocs = {\n  name: 'freqz',\n  category: 'Signal',\n  syntax: ['freqz(b, a)', 'freqz(b, a, w)'],\n  description: 'Calculates the frequency response of a filter given its numerator and denominator coefficients.',\n  examples: ['freqz([1, 2], [1, 2, 3])', 'freqz([1, 2], [1, 2, 3], [0, 1])', 'freqz([1, 2], [1, 2, 3], 512)'],\n  seealso: []\n};", "export var 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};", "export var zetaDocs = {\n  name: 'zeta',\n  category: 'Special',\n  syntax: ['zeta(s)'],\n  description: 'Compute the Riemann Zeta Function using an infinite series and Riemann\\'s Functional Equation for the entire complex plane',\n  examples: ['zeta(0.2)', 'zeta(-0.5)', 'zeta(4)'],\n  seealso: []\n};", "export var 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};", "export var 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. If any NaN values are found, the function yields the last NaN in the input.',\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};", "export var 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};", "export var 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};", "export var 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. If any NaN values are found, the function yields the last NaN in the input.',\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};", "export var 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};", "export var 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};", "export var 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 probability 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};", "export var 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};", "export var 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};", "export var 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', 'variance']\n};", "export var 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};", "export var corrDocs = {\n  name: 'corr',\n  category: 'Statistics',\n  syntax: ['corr(A,B)'],\n  description: 'Compute the correlation coefficient of a two list with values, For matrices, the matrix correlation coefficient is calculated.',\n  examples: ['corr([2, 4, 6, 8],[1, 2, 3, 6])', 'corr(matrix([[1, 2.2, 3, 4.8, 5], [1, 2, 3, 4, 5]]), matrix([[4, 5.3, 6.6, 7, 8], [1, 2, 3, 4, 5]]))'],\n  seealso: ['max', 'mean', 'min', 'median', 'min', 'prod', 'std', 'sum']\n};", "export var 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};", "export var 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};", "export var 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};", "export var acothDocs = {\n  name: 'acoth',\n  category: 'Trigonometry',\n  syntax: ['acoth(x)'],\n  description: 'Calculate the inverse hyperbolic tangent 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};", "export var 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};", "export var acschDocs = {\n  name: 'acsch',\n  category: 'Trigonometry',\n  syntax: ['acsch(x)'],\n  description: 'Calculate the inverse hyperbolic cosecant 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var toBestDocs = {\n  name: 'toBest',\n  category: 'Units',\n  syntax: ['toBest(x)', 'toBest(x, unitList)', 'toBest(x, unitList, options)'],\n  description: 'Converts to the most appropriate display unit.',\n  examples: ['toBest(unit(5000, \"m\"))', 'toBest(unit(3500000, \"W\"))', 'toBest(unit(0.000000123, \"A\"))', 'toBest(unit(10, \"m\"), \"cm\")', 'toBest(unit(10, \"m\"), \"mm,km\", {offset: 1.5})'],\n  seealso: []\n};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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};", "export var 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', 'isFinite', 'isBounded']\n};", "export var isBoundedDocs = {\n  name: 'isBounded',\n  category: 'Utils',\n  syntax: ['isBounded(x)'],\n  description: 'Test whether a value or its entries are bounded.',\n  examples: ['isBounded(Infinity)', 'isBounded(bigint(3))', 'isBounded([3, -Infinity, -3])'],\n  seealso: ['isFinite', 'isNumeric', 'isNaN', 'isNegative', 'isPositive']\n};", "export var isFiniteDocs = {\n  name: 'isFinite',\n  category: 'Utils',\n  syntax: ['isFinite(x)'],\n  description: 'Test whether a value is finite, elementwise on collections.',\n  examples: ['isFinite(Infinity)', 'isFinite(bigint(3))', 'isFinite([3, -Infinity, -3])'],\n  seealso: ['isBounded', 'isNumeric', 'isNaN', 'isNegative', 'isPositive']\n};", "export var 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};", "export var 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', 'isFinite', 'isBounded']\n};", "export var 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};", "export var 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};", "export var 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};", "export var numericDocs = {\n  name: 'numeric',\n  category: 'Utils',\n  syntax: ['numeric(x)'],\n  description: 'Convert a numeric input to a specific numeric type: number, BigNumber, bigint, or Fraction.',\n  examples: ['numeric(\"4\")', 'numeric(\"4\", \"number\")', 'numeric(\"4\", \"bigint\")', 'numeric(\"4\", \"BigNumber\")', 'numeric(\"4\", \"Fraction\")', 'numeric(4, \"Fraction\")', 'numeric(fraction(2, 5), \"number\")'],\n  seealso: ['number', 'bigint', 'fraction', 'bignumber', 'string', 'format']\n};", "export var 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};", "export var 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: $1, $2, $3\", [6, 9, 4])'],\n  seealso: ['format']\n};", "export var 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};", "export var solveODEDocs = {\n  name: 'solveODE',\n  category: 'Numeric',\n  syntax: ['solveODE(func, tspan, y0)', 'solveODE(func, tspan, y0, options)'],\n  description: 'Numerical Integration of Ordinary Differential Equations.',\n  examples: ['f(t,y) = y', 'tspan = [0, 4]', 'solveODE(f, tspan, 1)', 'solveODE(f, tspan, [1, 2])', 'solveODE(f, tspan, 1, { method:\"RK23\", maxStep:0.1 })'],\n  seealso: ['derivative', 'simplifyCore']\n};", "import { eDocs } from './constants/e.js';\nimport { falseDocs } from './constants/false.js';\nimport { iDocs } from './constants/i.js';\nimport { InfinityDocs } from './constants/Infinity.js';\nimport { LN10Docs } from './constants/LN10.js';\nimport { LN2Docs } from './constants/LN2.js';\nimport { LOG10EDocs } from './constants/LOG10E.js';\nimport { LOG2EDocs } from './constants/LOG2E.js';\nimport { NaNDocs } from './constants/NaN.js';\nimport { nullDocs } from './constants/null.js';\nimport { phiDocs } from './constants/phi.js';\nimport { piDocs } from './constants/pi.js';\nimport { SQRT12Docs } from './constants/SQRT1_2.js';\nimport { SQRT2Docs } from './constants/SQRT2.js';\nimport { tauDocs } from './constants/tau.js';\nimport { trueDocs } from './constants/true.js';\nimport { versionDocs } from './constants/version.js';\nimport { bignumberDocs } from './construction/bignumber.js';\nimport { bigintDocs } from './construction/bigint.js';\nimport { booleanDocs } from './construction/boolean.js';\nimport { complexDocs } from './construction/complex.js';\nimport { createUnitDocs } from './construction/createUnit.js';\nimport { fractionDocs } from './construction/fraction.js';\nimport { indexDocs } from './construction/index.js';\nimport { matrixDocs } from './construction/matrix.js';\nimport { numberDocs } from './construction/number.js';\nimport { sparseDocs } from './construction/sparse.js';\nimport { splitUnitDocs } from './construction/splitUnit.js';\nimport { stringDocs } from './construction/string.js';\nimport { unitDocs } from './construction/unit.js';\nimport { configDocs } from './core/config.js';\nimport { importDocs } from './core/import.js';\nimport { typedDocs } from './core/typed.js';\nimport { derivativeDocs } from './function/algebra/derivative.js';\nimport { leafCountDocs } from './function/algebra/leafCount.js';\nimport { lsolveDocs } from './function/algebra/lsolve.js';\nimport { lsolveAllDocs } from './function/algebra/lsolveAll.js';\nimport { lupDocs } from './function/algebra/lup.js';\nimport { lusolveDocs } from './function/algebra/lusolve.js';\nimport { polynomialRootDocs } from './function/algebra/polynomialRoot.js';\nimport { qrDocs } from './function/algebra/qr.js';\nimport { rationalizeDocs } from './function/algebra/rationalize.js';\nimport { resolveDocs } from './function/algebra/resolve.js';\nimport { simplifyDocs } from './function/algebra/simplify.js';\nimport { simplifyConstantDocs } from './function/algebra/simplifyConstant.js';\nimport { simplifyCoreDocs } from './function/algebra/simplifyCore.js';\nimport { sluDocs } from './function/algebra/slu.js';\nimport { symbolicEqualDocs } from './function/algebra/symbolicEqual.js';\nimport { usolveDocs } from './function/algebra/usolve.js';\nimport { usolveAllDocs } from './function/algebra/usolveAll.js';\nimport { absDocs } from './function/arithmetic/abs.js';\nimport { addDocs } from './function/arithmetic/add.js';\nimport { cbrtDocs } from './function/arithmetic/cbrt.js';\nimport { ceilDocs } from './function/arithmetic/ceil.js';\nimport { cubeDocs } from './function/arithmetic/cube.js';\nimport { divideDocs } from './function/arithmetic/divide.js';\nimport { dotDivideDocs } from './function/arithmetic/dotDivide.js';\nimport { dotMultiplyDocs } from './function/arithmetic/dotMultiply.js';\nimport { dotPowDocs } from './function/arithmetic/dotPow.js';\nimport { expDocs } from './function/arithmetic/exp.js';\nimport { expmDocs } from './function/arithmetic/expm.js';\nimport { expm1Docs } from './function/arithmetic/expm1.js';\nimport { fixDocs } from './function/arithmetic/fix.js';\nimport { floorDocs } from './function/arithmetic/floor.js';\nimport { gcdDocs } from './function/arithmetic/gcd.js';\nimport { hypotDocs } from './function/arithmetic/hypot.js';\nimport { invmodDocs } from './function/arithmetic/invmod.js';\nimport { lcmDocs } from './function/arithmetic/lcm.js';\nimport { logDocs } from './function/arithmetic/log.js';\nimport { log10Docs } from './function/arithmetic/log10.js';\nimport { log1pDocs } from './function/arithmetic/log1p.js';\nimport { log2Docs } from './function/arithmetic/log2.js';\nimport { modDocs } from './function/arithmetic/mod.js';\nimport { multiplyDocs } from './function/arithmetic/multiply.js';\nimport { normDocs } from './function/arithmetic/norm.js';\nimport { nthRootDocs } from './function/arithmetic/nthRoot.js';\nimport { nthRootsDocs } from './function/arithmetic/nthRoots.js';\nimport { powDocs } from './function/arithmetic/pow.js';\nimport { roundDocs } from './function/arithmetic/round.js';\nimport { signDocs } from './function/arithmetic/sign.js';\nimport { sqrtDocs } from './function/arithmetic/sqrt.js';\nimport { sqrtmDocs } from './function/arithmetic/sqrtm.js';\nimport { sylvesterDocs } from './function/algebra/sylvester.js';\nimport { schurDocs } from './function/algebra/schur.js';\nimport { lyapDocs } from './function/algebra/lyap.js';\nimport { squareDocs } from './function/arithmetic/square.js';\nimport { subtractDocs } from './function/arithmetic/subtract.js';\nimport { unaryMinusDocs } from './function/arithmetic/unaryMinus.js';\nimport { unaryPlusDocs } from './function/arithmetic/unaryPlus.js';\nimport { xgcdDocs } from './function/arithmetic/xgcd.js';\nimport { bitAndDocs } from './function/bitwise/bitAnd.js';\nimport { bitNotDocs } from './function/bitwise/bitNot.js';\nimport { bitOrDocs } from './function/bitwise/bitOr.js';\nimport { bitXorDocs } from './function/bitwise/bitXor.js';\nimport { leftShiftDocs } from './function/bitwise/leftShift.js';\nimport { rightArithShiftDocs } from './function/bitwise/rightArithShift.js';\nimport { rightLogShiftDocs } from './function/bitwise/rightLogShift.js';\nimport { bellNumbersDocs } from './function/combinatorics/bellNumbers.js';\nimport { catalanDocs } from './function/combinatorics/catalan.js';\nimport { compositionDocs } from './function/combinatorics/composition.js';\nimport { stirlingS2Docs } from './function/combinatorics/stirlingS2.js';\nimport { argDocs } from './function/complex/arg.js';\nimport { conjDocs } from './function/complex/conj.js';\nimport { imDocs } from './function/complex/im.js';\nimport { reDocs } from './function/complex/re.js';\nimport { evaluateDocs } from './function/expression/evaluate.js';\nimport { parserDocs } from './function/expression/parser.js';\nimport { parseDocs } from './function/expression/parse.js';\nimport { compileDocs } from './function/expression/compile.js';\nimport { helpDocs } from './function/expression/help.js';\nimport { distanceDocs } from './function/geometry/distance.js';\nimport { intersectDocs } from './function/geometry/intersect.js';\nimport { andDocs } from './function/logical/and.js';\nimport { notDocs } from './function/logical/not.js';\nimport { nullishDocs } from './function/logical/nullish.js';\nimport { orDocs } from './function/logical/or.js';\nimport { xorDocs } from './function/logical/xor.js';\nimport { mapSlicesDocs } from './function/matrix/mapSlices.js';\nimport { columnDocs } from './function/matrix/column.js';\nimport { concatDocs } from './function/matrix/concat.js';\nimport { countDocs } from './function/matrix/count.js';\nimport { crossDocs } from './function/matrix/cross.js';\nimport { ctransposeDocs } from './function/matrix/ctranspose.js';\nimport { detDocs } from './function/matrix/det.js';\nimport { diagDocs } from './function/matrix/diag.js';\nimport { diffDocs } from './function/matrix/diff.js';\nimport { dotDocs } from './function/matrix/dot.js';\nimport { eigsDocs } from './function/matrix/eigs.js';\nimport { filterDocs } from './function/matrix/filter.js';\nimport { flattenDocs } from './function/matrix/flatten.js';\nimport { forEachDocs } from './function/matrix/forEach.js';\nimport { getMatrixDataTypeDocs } from './function/matrix/getMatrixDataType.js';\nimport { identityDocs } from './function/matrix/identity.js';\nimport { invDocs } from './function/matrix/inv.js';\nimport { pinvDocs } from './function/matrix/pinv.js';\nimport { kronDocs } from './function/matrix/kron.js';\nimport { mapDocs } from './function/matrix/map.js';\nimport { matrixFromColumnsDocs } from './function/matrix/matrixFromColumns.js';\nimport { matrixFromFunctionDocs } from './function/matrix/matrixFromFunction.js';\nimport { matrixFromRowsDocs } from './function/matrix/matrixFromRows.js';\nimport { onesDocs } from './function/matrix/ones.js';\nimport { partitionSelectDocs } from './function/matrix/partitionSelect.js';\nimport { rangeDocs } from './function/matrix/range.js';\nimport { reshapeDocs } from './function/matrix/reshape.js';\nimport { resizeDocs } from './function/matrix/resize.js';\nimport { rotateDocs } from './function/matrix/rotate.js';\nimport { rotationMatrixDocs } from './function/matrix/rotationMatrix.js';\nimport { rowDocs } from './function/matrix/row.js';\nimport { sizeDocs } from './function/matrix/size.js';\nimport { sortDocs } from './function/matrix/sort.js';\nimport { squeezeDocs } from './function/matrix/squeeze.js';\nimport { subsetDocs } from './function/matrix/subset.js';\nimport { traceDocs } from './function/matrix/trace.js';\nimport { transposeDocs } from './function/matrix/transpose.js';\nimport { zerosDocs } from './function/matrix/zeros.js';\nimport { fftDocs } from './function/matrix/fft.js';\nimport { ifftDocs } from './function/matrix/ifft.js';\nimport { bernoulliDocs } from './function/probability/bernoulli.js';\nimport { combinationsDocs } from './function/probability/combinations.js';\nimport { combinationsWithRepDocs } from './function/probability/combinationsWithRep.js';\nimport { factorialDocs } from './function/probability/factorial.js';\nimport { gammaDocs } from './function/probability/gamma.js';\nimport { lgammaDocs } from './function/probability/lgamma.js';\nimport { kldivergenceDocs } from './function/probability/kldivergence.js';\nimport { multinomialDocs } from './function/probability/multinomial.js';\nimport { permutationsDocs } from './function/probability/permutations.js';\nimport { pickRandomDocs } from './function/probability/pickRandom.js';\nimport { randomDocs } from './function/probability/random.js';\nimport { randomIntDocs } from './function/probability/randomInt.js';\nimport { compareDocs } from './function/relational/compare.js';\nimport { compareNaturalDocs } from './function/relational/compareNatural.js';\nimport { compareTextDocs } from './function/relational/compareText.js';\nimport { deepEqualDocs } from './function/relational/deepEqual.js';\nimport { equalDocs } from './function/relational/equal.js';\nimport { equalTextDocs } from './function/relational/equalText.js';\nimport { largerDocs } from './function/relational/larger.js';\nimport { largerEqDocs } from './function/relational/largerEq.js';\nimport { smallerDocs } from './function/relational/smaller.js';\nimport { smallerEqDocs } from './function/relational/smallerEq.js';\nimport { unequalDocs } from './function/relational/unequal.js';\nimport { setCartesianDocs } from './function/set/setCartesian.js';\nimport { setDifferenceDocs } from './function/set/setDifference.js';\nimport { setDistinctDocs } from './function/set/setDistinct.js';\nimport { setIntersectDocs } from './function/set/setIntersect.js';\nimport { setIsSubsetDocs } from './function/set/setIsSubset.js';\nimport { setMultiplicityDocs } from './function/set/setMultiplicity.js';\nimport { setPowersetDocs } from './function/set/setPowerset.js';\nimport { setSizeDocs } from './function/set/setSize.js';\nimport { setSymDifferenceDocs } from './function/set/setSymDifference.js';\nimport { setUnionDocs } from './function/set/setUnion.js';\nimport { zpk2tfDocs } from './function/signal/zpk2tf.js';\nimport { freqzDocs } from './function/signal/freqz.js';\nimport { erfDocs } from './function/special/erf.js';\nimport { zetaDocs } from './function/special/zeta.js';\nimport { madDocs } from './function/statistics/mad.js';\nimport { maxDocs } from './function/statistics/max.js';\nimport { meanDocs } from './function/statistics/mean.js';\nimport { medianDocs } from './function/statistics/median.js';\nimport { minDocs } from './function/statistics/min.js';\nimport { modeDocs } from './function/statistics/mode.js';\nimport { prodDocs } from './function/statistics/prod.js';\nimport { quantileSeqDocs } from './function/statistics/quantileSeq.js';\nimport { stdDocs } from './function/statistics/std.js';\nimport { cumSumDocs } from './function/statistics/cumsum.js';\nimport { sumDocs } from './function/statistics/sum.js';\nimport { varianceDocs } from './function/statistics/variance.js';\nimport { corrDocs } from './function/statistics/corr.js';\nimport { acosDocs } from './function/trigonometry/acos.js';\nimport { acoshDocs } from './function/trigonometry/acosh.js';\nimport { acotDocs } from './function/trigonometry/acot.js';\nimport { acothDocs } from './function/trigonometry/acoth.js';\nimport { acscDocs } from './function/trigonometry/acsc.js';\nimport { acschDocs } from './function/trigonometry/acsch.js';\nimport { asecDocs } from './function/trigonometry/asec.js';\nimport { asechDocs } from './function/trigonometry/asech.js';\nimport { asinDocs } from './function/trigonometry/asin.js';\nimport { asinhDocs } from './function/trigonometry/asinh.js';\nimport { atanDocs } from './function/trigonometry/atan.js';\nimport { atan2Docs } from './function/trigonometry/atan2.js';\nimport { atanhDocs } from './function/trigonometry/atanh.js';\nimport { cosDocs } from './function/trigonometry/cos.js';\nimport { coshDocs } from './function/trigonometry/cosh.js';\nimport { cotDocs } from './function/trigonometry/cot.js';\nimport { cothDocs } from './function/trigonometry/coth.js';\nimport { cscDocs } from './function/trigonometry/csc.js';\nimport { cschDocs } from './function/trigonometry/csch.js';\nimport { secDocs } from './function/trigonometry/sec.js';\nimport { sechDocs } from './function/trigonometry/sech.js';\nimport { sinDocs } from './function/trigonometry/sin.js';\nimport { sinhDocs } from './function/trigonometry/sinh.js';\nimport { tanDocs } from './function/trigonometry/tan.js';\nimport { tanhDocs } from './function/trigonometry/tanh.js';\nimport { toDocs } from './function/units/to.js';\nimport { toBestDocs } from './function/units/toBest.js';\nimport { binDocs } from './function/utils/bin.js';\nimport { cloneDocs } from './function/utils/clone.js';\nimport { formatDocs } from './function/utils/format.js';\nimport { hasNumericValueDocs } from './function/utils/hasNumericValue.js';\nimport { hexDocs } from './function/utils/hex.js';\nimport { isIntegerDocs } from './function/utils/isInteger.js';\nimport { isNaNDocs } from './function/utils/isNaN.js';\nimport { isBoundedDocs } from './function/utils/isBounded.js';\nimport { isFiniteDocs } from './function/utils/isFinite.js';\nimport { isNegativeDocs } from './function/utils/isNegative.js';\nimport { isNumericDocs } from './function/utils/isNumeric.js';\nimport { isPositiveDocs } from './function/utils/isPositive.js';\nimport { isPrimeDocs } from './function/utils/isPrime.js';\nimport { isZeroDocs } from './function/utils/isZero.js';\nimport { numericDocs } from './function/utils/numeric.js';\nimport { octDocs } from './function/utils/oct.js';\nimport { printDocs } from './function/utils/print.js';\nimport { typeOfDocs } from './function/utils/typeOf.js';\nimport { solveODEDocs } from './function/numeric/solveODE.js';\nexport var embeddedDocs = {\n  // construction functions\n  bignumber: bignumberDocs,\n  bigint: bigintDocs,\n  boolean: booleanDocs,\n  complex: complexDocs,\n  createUnit: createUnitDocs,\n  fraction: fractionDocs,\n  index: indexDocs,\n  matrix: matrixDocs,\n  number: numberDocs,\n  sparse: sparseDocs,\n  splitUnit: splitUnitDocs,\n  string: stringDocs,\n  unit: unitDocs,\n  // constants\n  e: eDocs,\n  E: eDocs,\n  false: falseDocs,\n  i: iDocs,\n  Infinity: InfinityDocs,\n  LN2: LN2Docs,\n  LN10: LN10Docs,\n  LOG2E: LOG2EDocs,\n  LOG10E: LOG10EDocs,\n  NaN: NaNDocs,\n  null: nullDocs,\n  pi: piDocs,\n  PI: piDocs,\n  phi: phiDocs,\n  SQRT1_2: SQRT12Docs,\n  SQRT2: SQRT2Docs,\n  tau: tauDocs,\n  true: trueDocs,\n  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. Deprecated in favor of coulombConstant',\n    examples: ['coulombConstant']\n  },\n  coulombConstant: {\n    description: 'Coulomb\\'s constant',\n    examples: ['coulombConstant']\n  },\n  elementaryCharge: {\n    description: 'Elementary charge',\n    examples: ['elementaryCharge']\n  },\n  bohrMagneton: {\n    description: 'Bohr 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: 'Bohr 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: derivativeDocs,\n  lsolve: lsolveDocs,\n  lsolveAll: lsolveAllDocs,\n  lup: lupDocs,\n  lusolve: lusolveDocs,\n  leafCount: leafCountDocs,\n  polynomialRoot: polynomialRootDocs,\n  resolve: resolveDocs,\n  simplify: simplifyDocs,\n  simplifyConstant: simplifyConstantDocs,\n  simplifyCore: simplifyCoreDocs,\n  symbolicEqual: symbolicEqualDocs,\n  rationalize: rationalizeDocs,\n  slu: sluDocs,\n  usolve: usolveDocs,\n  usolveAll: usolveAllDocs,\n  qr: qrDocs,\n  // functions - arithmetic\n  abs: absDocs,\n  add: addDocs,\n  cbrt: cbrtDocs,\n  ceil: ceilDocs,\n  cube: cubeDocs,\n  divide: divideDocs,\n  dotDivide: dotDivideDocs,\n  dotMultiply: dotMultiplyDocs,\n  dotPow: dotPowDocs,\n  exp: expDocs,\n  expm: expmDocs,\n  expm1: expm1Docs,\n  fix: fixDocs,\n  floor: floorDocs,\n  gcd: gcdDocs,\n  hypot: hypotDocs,\n  lcm: lcmDocs,\n  log: logDocs,\n  log2: log2Docs,\n  log1p: log1pDocs,\n  log10: log10Docs,\n  mod: modDocs,\n  multiply: multiplyDocs,\n  norm: normDocs,\n  nthRoot: nthRootDocs,\n  nthRoots: nthRootsDocs,\n  pow: powDocs,\n  round: roundDocs,\n  sign: signDocs,\n  sqrt: sqrtDocs,\n  sqrtm: sqrtmDocs,\n  square: squareDocs,\n  subtract: subtractDocs,\n  unaryMinus: unaryMinusDocs,\n  unaryPlus: unaryPlusDocs,\n  xgcd: xgcdDocs,\n  invmod: invmodDocs,\n  // functions - bitwise\n  bitAnd: bitAndDocs,\n  bitNot: bitNotDocs,\n  bitOr: bitOrDocs,\n  bitXor: bitXorDocs,\n  leftShift: leftShiftDocs,\n  rightArithShift: rightArithShiftDocs,\n  rightLogShift: rightLogShiftDocs,\n  // functions - combinatorics\n  bellNumbers: bellNumbersDocs,\n  catalan: catalanDocs,\n  composition: compositionDocs,\n  stirlingS2: stirlingS2Docs,\n  // functions - core\n  config: configDocs,\n  import: importDocs,\n  typed: typedDocs,\n  // functions - complex\n  arg: argDocs,\n  conj: conjDocs,\n  re: reDocs,\n  im: imDocs,\n  // functions - expression\n  evaluate: evaluateDocs,\n  help: helpDocs,\n  parse: parseDocs,\n  parser: parserDocs,\n  compile: compileDocs,\n  // functions - geometry\n  distance: distanceDocs,\n  intersect: intersectDocs,\n  // functions - logical\n  and: andDocs,\n  not: notDocs,\n  nullish: nullishDocs,\n  or: orDocs,\n  xor: xorDocs,\n  // functions - matrix\n  mapSlices: mapSlicesDocs,\n  concat: concatDocs,\n  count: countDocs,\n  cross: crossDocs,\n  column: columnDocs,\n  ctranspose: ctransposeDocs,\n  det: detDocs,\n  diag: diagDocs,\n  diff: diffDocs,\n  dot: dotDocs,\n  getMatrixDataType: getMatrixDataTypeDocs,\n  identity: identityDocs,\n  filter: filterDocs,\n  flatten: flattenDocs,\n  forEach: forEachDocs,\n  inv: invDocs,\n  pinv: pinvDocs,\n  eigs: eigsDocs,\n  kron: kronDocs,\n  matrixFromFunction: matrixFromFunctionDocs,\n  matrixFromRows: matrixFromRowsDocs,\n  matrixFromColumns: matrixFromColumnsDocs,\n  map: mapDocs,\n  ones: onesDocs,\n  partitionSelect: partitionSelectDocs,\n  range: rangeDocs,\n  resize: resizeDocs,\n  reshape: reshapeDocs,\n  rotate: rotateDocs,\n  rotationMatrix: rotationMatrixDocs,\n  row: rowDocs,\n  size: sizeDocs,\n  sort: sortDocs,\n  squeeze: squeezeDocs,\n  subset: subsetDocs,\n  trace: traceDocs,\n  transpose: transposeDocs,\n  zeros: zerosDocs,\n  fft: fftDocs,\n  ifft: ifftDocs,\n  sylvester: sylvesterDocs,\n  schur: schurDocs,\n  lyap: lyapDocs,\n  // functions - numeric\n  solveODE: solveODEDocs,\n  // functions - probability\n  bernoulli: bernoulliDocs,\n  combinations: combinationsDocs,\n  combinationsWithRep: combinationsWithRepDocs,\n  // distribution: distributionDocs,\n  factorial: factorialDocs,\n  gamma: gammaDocs,\n  kldivergence: kldivergenceDocs,\n  lgamma: lgammaDocs,\n  multinomial: multinomialDocs,\n  permutations: permutationsDocs,\n  pickRandom: pickRandomDocs,\n  random: randomDocs,\n  randomInt: randomIntDocs,\n  // functions - relational\n  compare: compareDocs,\n  compareNatural: compareNaturalDocs,\n  compareText: compareTextDocs,\n  deepEqual: deepEqualDocs,\n  equal: equalDocs,\n  equalText: equalTextDocs,\n  larger: largerDocs,\n  largerEq: largerEqDocs,\n  smaller: smallerDocs,\n  smallerEq: smallerEqDocs,\n  unequal: unequalDocs,\n  // functions - set\n  setCartesian: setCartesianDocs,\n  setDifference: setDifferenceDocs,\n  setDistinct: setDistinctDocs,\n  setIntersect: setIntersectDocs,\n  setIsSubset: setIsSubsetDocs,\n  setMultiplicity: setMultiplicityDocs,\n  setPowerset: setPowersetDocs,\n  setSize: setSizeDocs,\n  setSymDifference: setSymDifferenceDocs,\n  setUnion: setUnionDocs,\n  // functions - signal\n  zpk2tf: zpk2tfDocs,\n  freqz: freqzDocs,\n  // functions - special\n  erf: erfDocs,\n  zeta: zetaDocs,\n  // functions - statistics\n  cumsum: cumSumDocs,\n  mad: madDocs,\n  max: maxDocs,\n  mean: meanDocs,\n  median: medianDocs,\n  min: minDocs,\n  mode: modeDocs,\n  prod: prodDocs,\n  quantileSeq: quantileSeqDocs,\n  std: stdDocs,\n  sum: sumDocs,\n  variance: varianceDocs,\n  corr: corrDocs,\n  // functions - trigonometry\n  acos: acosDocs,\n  acosh: acoshDocs,\n  acot: acotDocs,\n  acoth: acothDocs,\n  acsc: acscDocs,\n  acsch: acschDocs,\n  asec: asecDocs,\n  asech: asechDocs,\n  asin: asinDocs,\n  asinh: asinhDocs,\n  atan: atanDocs,\n  atanh: atanhDocs,\n  atan2: atan2Docs,\n  cos: cosDocs,\n  cosh: coshDocs,\n  cot: cotDocs,\n  coth: cothDocs,\n  csc: cscDocs,\n  csch: cschDocs,\n  sec: secDocs,\n  sech: sechDocs,\n  sin: sinDocs,\n  sinh: sinhDocs,\n  tan: tanDocs,\n  tanh: tanhDocs,\n  // functions - units\n  to: toDocs,\n  toBest: toBestDocs,\n  // functions - utils\n  clone: cloneDocs,\n  format: formatDocs,\n  bin: binDocs,\n  oct: octDocs,\n  hex: hexDocs,\n  isNaN: isNaNDocs,\n  isBounded: isBoundedDocs,\n  isFinite: isFiniteDocs,\n  isInteger: isIntegerDocs,\n  isNegative: isNegativeDocs,\n  isNumeric: isNumericDocs,\n  hasNumericValue: hasNumericValueDocs,\n  isPositive: isPositiveDocs,\n  isPrime: isPrimeDocs,\n  isZero: isZeroDocs,\n  print: printDocs,\n  typeOf: typeOfDocs,\n  numeric: numericDocs\n};", "import { factory } from '../../utils/factory.js';\nimport { getSafeProperty } from '../../utils/customs.js';\nimport { embeddedDocs } from '../embeddedDocs/embeddedDocs.js';\nimport { hasOwnProperty } from '../../utils/object.js';\nvar name = 'help';\nvar dependencies = ['typed', 'mathWithTransform', 'Help'];\nexport var createHelp = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    mathWithTransform,\n    Help\n  } = _ref;\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 (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      var doc = getSafeProperty(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});", "import { factory } from '../../../utils/factory.js';\nvar name = 'chain';\nvar dependencies = ['typed', 'Chain'];\nexport var createChain = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    Chain\n  } = _ref;\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});", "import { isMatrix } from '../../utils/is.js';\nimport { clone } from '../../utils/object.js';\nimport { format } from '../../utils/string.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'det';\nvar dependencies = ['typed', 'matrix', 'subtractScalar', 'multiply', 'divideScalar', 'isZero', 'unaryMinus'];\nexport var createDet = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    subtractScalar,\n    multiply,\n    divideScalar,\n    isZero,\n    unaryMinus\n  } = _ref;\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 clone(x);\n    },\n    'Array | Matrix': function det(x) {\n      var size;\n      if (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 clone(x);\n        case 1:\n          // vector\n          if (size[0] === 1) {\n            return 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: ' + 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: ' + format(size) + ')');\n            }\n          }\n        default:\n          // multi dimensional array\n          throw new RangeError('Matrix must be two dimensional ' + '(size: ' + 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 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 subtractScalar(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((_, i) => i); // 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        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(subtractScalar(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});", "import { isMatrix } from '../../utils/is.js';\nimport { arraySize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { format } from '../../utils/string.js';\nvar name = 'inv';\nvar dependencies = ['typed', 'matrix', 'divideScalar', 'addScalar', 'multiply', 'unaryMinus', 'det', 'identity', 'abs'];\nexport var createInv = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    divideScalar,\n    addScalar,\n    multiply,\n    unaryMinus,\n    det,\n    identity,\n    abs\n  } = _ref;\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 Array__Matrix(x) {\n      var size = isMatrix(x) ? x.size() : arraySize(x);\n      switch (size.length) {\n        case 1:\n          // vector\n          if (size[0] === 1) {\n            if (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: ' + 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 (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: ' + format(size) + ')');\n            }\n          }\n        default:\n          // multi dimensional array\n          throw new RangeError('Matrix must be two dimensional ' + '(size: ' + 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});", "import { isMatrix } from '../../utils/is.js';\nimport { arraySize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { format } from '../../utils/string.js';\nimport { clone } from '../../utils/object.js';\nvar name = 'pinv';\nvar dependencies = ['typed', 'matrix', 'inv', 'deepEqual', 'equal', 'dotDivide', 'dot', 'ctranspose', 'divideScalar', 'multiply', 'add', 'Complex'];\nexport var createPinv = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    inv,\n    deepEqual,\n    equal,\n    dotDivide,\n    dot,\n    ctranspose,\n    divideScalar,\n    multiply,\n    add,\n    Complex\n  } = _ref;\n  /**\n   * Calculate the Moore\u2013Penrose 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 Array__Matrix(x) {\n      var size = isMatrix(x) ? x.size() : 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 (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: ' + format(size) + ')');\n      }\n    },\n    any: function any(x) {\n      // scalar\n      if (equal(x, 0)) return clone(x); // zero\n      return divideScalar(1, x);\n    }\n  });\n\n  /**\n   * Calculate the Moore\u2013Penrose 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 {\n      C,\n      F\n    } = _rankFact(mat, rows, cols); // 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 = 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      [M[i], M[r]] = [M[r], M[i]];\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((_, i) => _.filter((_, j) => j < rows && !_isZero(dot(rref[j], rref[j]))));\n    var F = rref.filter((_, i) => !_isZero(dot(rref[i], rref[i])));\n    return {\n      C,\n      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});", "import { clone } from '../../../utils/object.js';\nexport function createComplexEigs(_ref) {\n  var {\n    addScalar,\n    subtract,\n    flatten,\n    multiply,\n    multiplyScalar,\n    divideScalar,\n    sqrt,\n    abs,\n    bignumber,\n    diag,\n    size,\n    reshape,\n    inv,\n    qr,\n    usolve,\n    usolveAll,\n    equal,\n    complex,\n    larger,\n    smaller,\n    matrixFromColumns,\n    dot\n  } = _ref;\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) {\n    var findVectors = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : true;\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^-1, A is the original matrix\n    // (if findVectors is false, R is undefined)\n    // (And so to return to original matrix: A = R^-1 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^-1 arr R)\n\n    // find eigenvalues\n    var {\n      values,\n      C\n    } = iterateUntilTriangular(arr, N, prec, type, findVectors);\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^-1 arr C and the relationship between current arr\n    // and original A is unchanged.)\n\n    if (findVectors) {\n      var eigenvectors = findEigenvectors(arr, N, C, R, values, prec, type);\n      return {\n        values,\n        eigenvectors\n      };\n    }\n    return {\n      values\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          colNorm = addScalar(colNorm, abs(arr[j][i]));\n          rowNorm = addScalar(rowNorm, abs(arr[i][j]));\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], g);\n              arr[_j][i] = multiplyScalar(arr[_j][i], f);\n            }\n\n            // keep track of transformations\n            if (findVectors) {\n              Rdiag[i] = multiplyScalar(Rdiag[i], g);\n            }\n          }\n        }\n      }\n    }\n\n    // return the diagonal row transformation matrix\n    return findVectors ? diag(Rdiag) : null;\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' = QtAQ 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 = 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\u00D7N matrix describing the overall transformation done during the QR algorithm\n    var Qtotal = findVectors ? diag(Array(N).fill(one)) : undefined;\n\n    // nxn 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 = arr[n - 1][n - 1]; // TODO this is apparently a somewhat\n      // old-fashioned choice; ideally set close to an eigenvalue, or\n      // perhaps better yet switch to the implicit QR version that is sometimes\n      // specifically called the \"Francis algorithm\" that is alluded to\n      // in the following TODO. (Or perhaps we switch to an independently\n      // optimized third-party package for the linear algebra operations...)\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 {\n        Q,\n        R\n      } = qr(arr);\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(...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((a, b) => +subtract(abs(a), abs(b)));\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\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    for (var lambda of values) {\n      var i = indexOf(uniqueValues, lambda, equal);\n      if (i === -1) {\n        uniqueValues.push(lambda);\n        multiplicities.push(1);\n      } else {\n        multiplicities[i] += 1;\n      }\n    }\n\n    // find eigenvectors by solving U \u2212 lambdaE = 0\n    // TODO replace with an iterative eigenvector algorithm\n    // (this one might fail for imprecise eigenvalues)\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    var _loop = function _loop() {\n      var lambda = uniqueValues[_i4];\n      var S = subtract(U, multiply(lambda, 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      // But if that fails, just presume that the original matrix truly\n      // was defective.\n      while (solutions.length < multiplicities[_i4]) {\n        var approxVec = inverseIterate(S, N, solutions, prec, type);\n        if (approxVec === null) {\n          break;\n        } // no more vectors were found\n        solutions.push(approxVec);\n      }\n\n      // Transform back into original array coordinates\n      var correction = multiply(inv(R), C);\n      solutions = solutions.map(v => multiply(correction, v));\n      vectors.push(...solutions.map(v => ({\n        value: lambda,\n        vector: flatten(v)\n      })));\n    };\n    for (var _i4 = 0; _i4 < len; _i4++) {\n      _loop();\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    // lambda_+- = 1/2 trA +- 1/2 sqrt( tr^2 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^-1 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 diagonal elements of N = A - lambdaI\n    var na = subtract(a, l1);\n    var nd = subtract(d, l1);\n\n    // col(N,2) = 0  implies  S = ( col(N,1), e_1 )\n    // col(N,2) != 0 implies  S = ( col(N,2), e_2 )\n\n    if (smaller(abs(b), prec) && smaller(abs(nd), prec)) {\n      return [[na, one], [c, zero]];\n    } else {\n      return [[b, zero], [nd, one]];\n    }\n  }\n\n  /**\n   * Enlarge the matrix from nxn to NxN, 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      arr[i].push(...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    for (var sub of arr) {\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    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 \u2013 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    for (; i < 5; ++i) {\n      b = randomOrthogonalVector(N, orthog, type);\n      try {\n        b = usolve(A, b);\n      } catch (_unused) {\n        // That direction didn't work, likely because the original matrix\n        // was defective. But still make the full number of tries...\n        continue;\n      }\n      if (larger(norm(b), largeNum)) {\n        break;\n      }\n    }\n    if (i >= 5) {\n      return null; // couldn't find any orthogonal vector in the image\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(_ => 2 * Math.random() - 1);\n    if (big) {\n      v = v.map(n => bignumber(n));\n    }\n    if (cplx) {\n      v = v.map(n => complex(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 vectorShape = size(v);\n    for (var w of orthog) {\n      w = reshape(w, vectorShape); // make sure this is just a vector computation\n      // v := v \u2212 (w, v)/|w|^2 w\n      v = subtract(v, multiply(divideScalar(dot(w, v), dot(w, w)), w));\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}", "import { clone } from '../../../utils/object.js';\nexport function createRealSymmetric(_ref) {\n  var {\n    config,\n    addScalar,\n    subtract,\n    abs,\n    atan,\n    cos,\n    sin,\n    multiplyScalar,\n    inv,\n    bignumber,\n    multiply,\n    add\n  } = _ref;\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.relTol;\n    var type = arguments.length > 3 ? arguments[3] : undefined;\n    var computeVectors = arguments.length > 4 ? arguments[4] : undefined;\n    if (type === 'number') {\n      return diag(arr, prec, computeVectors);\n    }\n    if (type === 'BigNumber') {\n      return diagBig(arr, prec, computeVectors);\n    }\n    throw TypeError('Unsupported data type: ' + type);\n  }\n\n  // diagonalization implementation for number (efficient)\n  function diag(x, precision, computeVectors) {\n    var N = x.length;\n    var e0 = Math.abs(precision / N);\n    var psi;\n    var Sij;\n    if (computeVectors) {\n      Sij = new Array(N);\n      // Sij is Identity Matrix\n      for (var i = 0; i < N; i++) {\n        Sij[i] = Array(N).fill(0);\n        Sij[i][i] = 1.0;\n      }\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      if (computeVectors) Sij = Sij1(Sij, psi, _i, j);\n      Vab = getAij(x);\n    }\n    var Ei = Array(N).fill(0); // eigenvalues\n    for (var _i2 = 0; _i2 < N; _i2++) {\n      Ei[_i2] = x[_i2][_i2];\n    }\n    return sorting(clone(Ei), Sij, computeVectors);\n  }\n\n  // diagonalization implementation for bigNumber\n  function diagBig(x, precision, computeVectors) {\n    var N = x.length;\n    var e0 = abs(precision / N);\n    var psi;\n    var Sij;\n    if (computeVectors) {\n      Sij = new Array(N);\n      // Sij is Identity Matrix\n      for (var i = 0; i < N; i++) {\n        Sij[i] = Array(N).fill(0);\n        Sij[i][i] = 1.0;\n      }\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      if (computeVectors) Sij = Sij1Big(Sij, psi, _i3, j);\n      Vab = getAijBig(x);\n    }\n    var Ei = Array(N).fill(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(clone(Ei), Sij, computeVectors);\n  }\n\n  // get angle\n  function getTheta(aii, ajj, aij) {\n    var denom = ajj - aii;\n    if (Math.abs(denom) <= config.relTol) {\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.relTol) {\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 = Array(N).fill(0);\n    var Skj = Array(N).fill(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 = Array(N).fill(bignumber(0));\n    var Skj = Array(N).fill(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 = Array(N).fill(bignumber(0));\n    var Akj = Array(N).fill(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 = Array(N).fill(0);\n    var Akj = Array(N).fill(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, computeVectors) {\n    var N = E.length;\n    var values = Array(N);\n    var vecs;\n    if (computeVectors) {\n      vecs = Array(N);\n      for (var k = 0; k < N; k++) {\n        vecs[k] = Array(N);\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      if (computeVectors) {\n        for (var _k5 = 0; _k5 < N; _k5++) {\n          vecs[i][_k5] = S[_k5][minID];\n          S[_k5].splice(minID, 1);\n        }\n      }\n    }\n    if (!computeVectors) return {\n      values\n    };\n    var eigenvectors = vecs.map((vector, i) => ({\n      value: values[i],\n      vector\n    }));\n    return {\n      values,\n      eigenvectors\n    };\n  }\n  return main;\n}", "import _extends from \"@babel/runtime/helpers/extends\";\nimport { factory } from '../../utils/factory.js';\nimport { format } from '../../utils/string.js';\nimport { createComplexEigs } from './eigs/complexEigs.js';\nimport { createRealSymmetric } from './eigs/realSymmetric.js';\nimport { typeOf, isNumber, isBigNumber, isComplex, isFraction } from '../../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', 'size', 'reshape', 'qr', 'usolve', 'usolveAll', 'im', 're', 'smaller', 'matrixFromColumns', 'dot'];\nexport var createEigs = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    config,\n    typed,\n    matrix,\n    addScalar,\n    subtract,\n    equal,\n    abs,\n    atan,\n    cos,\n    sin,\n    multiplyScalar,\n    divideScalar,\n    inv,\n    bignumber,\n    multiply,\n    add,\n    larger,\n    column,\n    flatten,\n    number,\n    complex,\n    sqrt,\n    diag,\n    size,\n    reshape,\n    qr,\n    usolve,\n    usolveAll,\n    im,\n    re,\n    smaller,\n    matrixFromColumns,\n    dot\n  } = _ref;\n  var doRealSymmetric = createRealSymmetric({\n    config,\n    addScalar,\n    subtract,\n    column,\n    flatten,\n    equal,\n    abs,\n    atan,\n    cos,\n    sin,\n    multiplyScalar,\n    inv,\n    bignumber,\n    complex,\n    multiply,\n    add\n  });\n  var doComplexEigs = createComplexEigs({\n    config,\n    addScalar,\n    subtract,\n    multiply,\n    multiplyScalar,\n    flatten,\n    divideScalar,\n    sqrt,\n    abs,\n    bignumber,\n    diag,\n    size,\n    reshape,\n    qr,\n    inv,\n    usolve,\n    usolveAll,\n    equal,\n    complex,\n    larger,\n    smaller,\n    matrixFromColumns,\n    dot\n  });\n\n  /**\n   * Compute eigenvalues and optionally eigenvectors of a square matrix.\n   * The eigenvalues are sorted by their absolute value, ascending, and\n   * returned as a vector in the `values` property of the returned project.\n   * An eigenvalue with algebraic multiplicity k will be listed k times, so\n   * that the returned `values` vector always has length equal to the size\n   * of the input matrix.\n   *\n   * The `eigenvectors` property of the return value provides the eigenvectors.\n   * It is an array of plain objects: the `value` property of each gives the\n   * associated eigenvalue, and the `vector` property gives the eigenvector\n   * itself. Note that the same `value` property will occur as many times in\n   * the list provided by `eigenvectors` as the geometric multiplicity of\n   * that value.\n   *\n   * If the algorithm fails to converge, it will throw an error \u2013\n   * in that case, however, you may still find useful information\n   * in `err.values` and `err.vectors`.\n   *\n   * Note that the 'precision' option does not directly specify the _accuracy_\n   * of the returned eigenvalues. Rather, it determines how small an entry\n   * of the iterative approximations to an upper triangular matrix must be\n   * in order to be considered zero. The actual accuracy of the returned\n   * eigenvalues may be greater or less than the precision, depending on the\n   * conditioning of the matrix and how far apart or close the actual\n   * eigenvalues are. Note that currently, relatively simple, \"traditional\"\n   * methods of eigenvalue computation are being used; this is not a modern,\n   * high-precision eigenvalue computation. That said, it should typically\n   * produce fairly reasonable results.\n   *\n   * Syntax:\n   *\n   *     math.eigs(x, [prec])\n   *     math.eigs(x, {options})\n   *\n   * Examples:\n   *\n   *     const { eigs, multiply, column, transpose, matrixFromColumns } = math\n   *     const H = [[5, 2.3], [2.3, 1]]\n   *     const ans = eigs(H) // returns {values: [E1,E2...sorted], eigenvectors: [{value: E1, vector: v2}, {value: e, vector: v2}, ...]\n   *     const E = ans.values\n   *     const V = ans.eigenvectors\n   *     multiply(H, V[0].vector)) // returns multiply(E[0], V[0].vector))\n   *     const U = matrixFromColumns(...V.map(obj => obj.vector))\n   *     const UTxHxU = multiply(transpose(U), H, U) // diagonalizes H if possible\n   *     E[0] == UTxHxU[0][0]  // returns true always\n   *\n   *     // Compute only approximate eigenvalues:\n   *     const {values} = eigs(H, {eigenvectors: false, precision: 1e-6})\n   *\n   * See also:\n   *\n   *     inv\n   *\n   * @param {Array | Matrix} x  Matrix to be diagonalized\n   *\n   * @param {number | BigNumber | OptsObject} [opts] Object with keys `precision`, defaulting to config.relTol, and `eigenvectors`, defaulting to true and specifying whether to compute eigenvectors. If just a number, specifies precision.\n   * @return {{values: Array|Matrix, eigenvectors?: Array<EVobj>}} Object containing an array of eigenvalues and an array of {value: number|BigNumber, vector: Array|Matrix} objects. The eigenvectors property is undefined if eigenvectors were not requested.\n   *\n   */\n  return typed('eigs', {\n    // The conversion to matrix in the first two implementations,\n    // just to convert back to an array right away in\n    // computeValuesAndVectors, is unfortunate, and should perhaps be\n    // streamlined. It is done because the Matrix object carries some\n    // type information about its entries, and so constructing the matrix\n    // is a roundabout way of doing type detection.\n    Array: function Array(x) {\n      return doEigs(matrix(x));\n    },\n    'Array, number|BigNumber': function Array_numberBigNumber(x, prec) {\n      return doEigs(matrix(x), {\n        precision: prec\n      });\n    },\n    'Array, Object'(x, opts) {\n      return doEigs(matrix(x), opts);\n    },\n    Matrix: function Matrix(mat) {\n      return doEigs(mat, {\n        matricize: true\n      });\n    },\n    'Matrix, number|BigNumber': function Matrix_numberBigNumber(mat, prec) {\n      return doEigs(mat, {\n        precision: prec,\n        matricize: true\n      });\n    },\n    'Matrix, Object': function Matrix_Object(mat, opts) {\n      var useOpts = {\n        matricize: true\n      };\n      _extends(useOpts, opts);\n      return doEigs(mat, useOpts);\n    }\n  });\n  function doEigs(mat) {\n    var _opts$precision;\n    var opts = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n    var computeVectors = 'eigenvectors' in opts ? opts.eigenvectors : true;\n    var prec = (_opts$precision = opts.precision) !== null && _opts$precision !== void 0 ? _opts$precision : config.relTol;\n    var result = computeValuesAndVectors(mat, prec, computeVectors);\n    if (opts.matricize) {\n      result.values = matrix(result.values);\n      if (computeVectors) {\n        result.eigenvectors = result.eigenvectors.map(_ref2 => {\n          var {\n            value,\n            vector\n          } = _ref2;\n          return {\n            value,\n            vector: matrix(vector)\n          };\n        });\n      }\n    }\n    if (computeVectors) {\n      Object.defineProperty(result, 'vectors', {\n        enumerable: false,\n        // to make sure that the eigenvectors can still be\n        // converted to string.\n        get: () => {\n          throw new Error('eigs(M).vectors replaced with eigs(M).eigenvectors');\n        }\n      });\n    }\n    return result;\n  }\n  function computeValuesAndVectors(mat, prec, computeVectors) {\n    var arr = mat.toArray(); // NOTE: arr is guaranteed to be unaliased\n    // and so safe to modify in place\n    var asize = mat.size();\n    if (asize.length !== 2 || asize[0] !== asize[1]) {\n      throw new RangeError(\"Matrix must be square (size: \".concat(format(asize), \")\"));\n    }\n    var N = asize[0];\n    if (isReal(arr, N, prec)) {\n      coerceReal(arr, N); // modifies arr by side effect\n\n      if (isSymmetric(arr, N, prec)) {\n        var _type = coerceTypes(mat, arr, N); // modifies arr by side effect\n        return doRealSymmetric(arr, N, prec, _type, computeVectors);\n      }\n    }\n    var type = coerceTypes(mat, arr, N); // modifies arr by side effect\n    return doComplexEigs(arr, N, prec, type, computeVectors);\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 (isNumber(el) || isFraction(el)) {\n          hasNumber = true;\n        } else if (isBigNumber(el)) {\n          hasBig = true;\n        } else if (isComplex(el)) {\n          hasComplex = true;\n        } else {\n          throw TypeError('Unsupported type in Matrix: ' + 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});", "import { isSparseMatrix } from '../../utils/is.js';\nimport { format } from '../../utils/string.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'expm';\nvar dependencies = ['typed', 'abs', 'add', 'identity', 'inv', 'multiply'];\nexport var createExpm = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    abs,\n    add,\n    identity,\n    inv,\n    multiply\n  } = _ref;\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\u00E9 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: ' + 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\u00E9 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\u00E9 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 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,\n            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});", "import { isMatrix } from '../../utils/is.js';\nimport { format } from '../../utils/string.js';\nimport { arraySize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'sqrtm';\nvar dependencies = ['typed', 'abs', 'add', 'multiply', 'map', 'sqrt', 'subtract', 'inv', 'size', 'max', 'identity'];\nexport var createSqrtm = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    abs,\n    add,\n    multiply,\n    map,\n    sqrt,\n    subtract,\n    inv,\n    size,\n    max,\n    identity\n  } = _ref;\n  var _maxIterations = 1e3;\n  var _tolerance = 1e-6;\n\n  /**\n   * Calculate the principal square root matrix using the Denman\u2013Beavers iterative method\n   *\n   * https://en.wikipedia.org/wiki/Square_root_of_a_matrix#By_Denman\u2013Beavers_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   *     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 Array__Matrix(A) {\n      var size = isMatrix(A) ? A.size() : 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: ' + 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: ' + format(size) + ')');\n            }\n          }\n        default:\n          // Multi dimensional array\n          throw new RangeError('Matrix must be at most two dimensional ' + '(size: ' + format(size) + ')');\n      }\n    }\n  });\n});", "import { factory } from '../../utils/factory.js';\nvar name = 'sylvester';\nvar dependencies = ['typed', 'schur', 'matrixFromColumns', 'matrix', 'multiply', 'range', 'concat', 'transpose', 'index', 'subset', 'add', 'subtract', 'identity', 'lusolve', 'abs'];\nexport var createSylvester = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    schur,\n    matrixFromColumns,\n    matrix,\n    multiply,\n    range,\n    concat,\n    transpose,\n    index,\n    subset,\n    add,\n    subtract,\n    identity,\n    lusolve,\n    abs,\n    config\n  } = _ref;\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 Array_Matrix_Matrix(A, B, C) {\n      return _sylvester(matrix(A), B, C);\n    },\n    'Array, Array, Matrix': function Array_Array_Matrix(A, B, C) {\n      return _sylvester(matrix(A), matrix(B), C);\n    },\n    'Array, Matrix, Array': function Array_Matrix_Array(A, B, C) {\n      return _sylvester(matrix(A), B, matrix(C));\n    },\n    'Matrix, Array, Matrix': function Matrix_Array_Matrix(A, B, C) {\n      return _sylvester(A, matrix(B), C);\n    },\n    'Matrix, Array, Array': function Matrix_Array_Array(A, B, C) {\n      return _sylvester(A, matrix(B), matrix(C));\n    },\n    'Matrix, Matrix, Array': function Matrix_Matrix_Array(A, B, C) {\n      return _sylvester(A, B, matrix(C));\n    },\n    'Array, Array, Array': function Array_Array_Array(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 = (a, b) => concat(a, b, 1);\n    var vc = (a, b) => concat(a, b, 0);\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(...y));\n    var X = multiply(U, multiply(Y, transpose(V)));\n    return X;\n  }\n});", "import { factory } from '../../../utils/factory.js';\nvar name = 'schur';\nvar dependencies = ['typed', 'matrix', 'identity', 'multiply', 'qr', 'norm', 'subtract'];\nexport var createSchur = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    identity,\n    multiply,\n    qr,\n    norm,\n    subtract\n  } = _ref;\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,\n      T: A\n    };\n  }\n});", "import { factory } from '../../utils/factory.js';\nvar name = 'lyap';\nvar dependencies = ['typed', 'matrix', 'sylvester', 'multiply', 'transpose'];\nexport var createLyap = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    sylvester,\n    multiply,\n    transpose\n  } = _ref;\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 Matrix_Matrix(A, Q) {\n      return sylvester(A, transpose(A), multiply(-1, Q));\n    },\n    'Array, Matrix': function Array_Matrix(A, Q) {\n      return sylvester(matrix(A), transpose(matrix(A)), multiply(-1, Q));\n    },\n    'Matrix, Array': function Matrix_Array(A, Q) {\n      return sylvester(A, transpose(matrix(A)), matrix(multiply(-1, Q)));\n    },\n    'Array, Array': function Array_Array(A, Q) {\n      return sylvester(matrix(A), transpose(matrix(A)), matrix(multiply(-1, Q))).toArray();\n    }\n  });\n});", "import { factory } from '../../utils/factory.js';\nimport { extend } from '../../utils/object.js';\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';\nvar name = 'divide';\nvar dependencies = ['typed', 'matrix', 'multiply', 'equalScalar', 'divideScalar', 'inv'];\nexport var createDivide = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    multiply,\n    equalScalar,\n    divideScalar,\n    inv\n  } = _ref;\n  var matAlgo11xS0s = createMatAlgo11xS0s({\n    typed,\n    equalScalar\n  });\n  var matAlgo14xDs = createMatAlgo14xDs({\n    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 | bigint | Fraction | Complex | Unit | Array | Matrix} x   Numerator\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Array | Matrix} y          Denominator\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix}                      Quotient, `x / y`\n   */\n  return typed('divide', extend({\n    // we extend the signatures of divideScalar with signatures dealing with matrices\n\n    'Array | Matrix, Array | Matrix': function Array__Matrix_Array__Matrix(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 DenseMatrix_any(x, y) {\n      return matAlgo14xDs(x, y, divideScalar, false);\n    },\n    'SparseMatrix, any': function SparseMatrix_any(x, y) {\n      return matAlgo11xS0s(x, y, divideScalar, false);\n    },\n    'Array, any': function Array_any(x, y) {\n      // use matrix implementation\n      return matAlgo14xDs(matrix(x), y, divideScalar, false).valueOf();\n    },\n    'any, Array | Matrix': function any_Array__Matrix(x, y) {\n      return multiply(x, inv(y));\n    }\n  }, divideScalar.signatures));\n});", "import { isBigNumber } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'distance';\nvar dependencies = ['typed', 'addScalar', 'subtractScalar', 'divideScalar', 'multiplyScalar', 'deepEqual', 'sqrt', 'abs'];\nexport var createDistance = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    addScalar,\n    subtractScalar,\n    multiplyScalar,\n    divideScalar,\n    deepEqual,\n    sqrt,\n    abs\n  } = _ref;\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\u2212x0, y\u2212y0, z\u2212z0) = t(a, b, c)\n    *\n    * Syntax:\n    *\n    *    math.distance([x1,y1], [x2,y2])\n    *    math.distance({pointOneX, pointOneY}, {pointTwoX, pointTwoY})\n    *    math.distance([x1,y1,z1], [x2,y2,z2])\n    *    math.distance({pointOneX, pointOneY, pointOneZ}, {pointTwoX, pointTwoY, pointTwoZ})\n    *    math.distance([x1,y1,z1,a1], [x2,y2,z2,a2])\n    *    math.distance([[x1,y1], [x2,y2], [x3,y3]])\n    *    math.distance([[x1,y1,z1], [x2,y2,z2], [x3,y3,z3]])\n    *    math.distance([pointX,pointY], [a,b,c])\n    *    math.distance([pointX,pointY], [lineOnePtX,lineOnePtY], [lineTwoPtX,lineTwoPtY])\n    *    math.distance({pointX, pointY}, {lineOnePtX, lineOnePtY}, {lineTwoPtX, lineTwoPtY})\n    *    math.distance([pointX,pointY,pointZ], [x0, y0, z0, a, b, c])\n    *    math.distance({pointX, pointY, pointZ}, {x0, y0, z0, a, b, c})\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([0, 0], [3, 0], [0, 4])        // Returns 2.4\n    *    math.distance(\n    *     {pointX: 0, pointY: 0},\n    *     {lineOnePtX: 3, lineOnePtY: 0},\n    *     {lineTwoPtX: 0, lineTwoPtY: 4})                // Returns 2.4\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 Array_Array_Array(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        if (deepEqual(y, z)) {\n          throw new TypeError('LinePoint1 should not be same with LinePoint2');\n        }\n        var xCoeff = subtractScalar(z[1], y[1]);\n        var yCoeff = subtractScalar(y[0], z[0]);\n        var constant = subtractScalar(multiplyScalar(z[0], y[1]), multiplyScalar(y[0], z[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 Object_Object_Object(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 (deepEqual(_objectToArray(y), _objectToArray(z))) {\n          throw new TypeError('LinePoint1 should not be same with LinePoint2');\n        }\n        if ('pointX' in x && 'pointY' in x && 'lineOnePtX' in y && 'lineOnePtY' in y && 'lineTwoPtX' in z && 'lineTwoPtY' in z) {\n          var xCoeff = subtractScalar(z.lineTwoPtY, y.lineOnePtY);\n          var yCoeff = subtractScalar(y.lineOnePtX, z.lineTwoPtX);\n          var constant = subtractScalar(multiplyScalar(z.lineTwoPtX, y.lineOnePtY), multiplyScalar(y.lineOnePtX, z.lineTwoPtY));\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 Array_Array(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 Object_Object(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' || 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(aI => aI.length !== 2 || !_isNumber(aI[0]) || !_isNumber(aI[1]))) {\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(aI => aI.length !== 3 || !_isNumber(aI[0]) || !_isNumber(aI[1]) || !_isNumber(aI[2]))) {\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 = [subtractScalar(multiplyScalar(subtractScalar(y0, y), c), multiplyScalar(subtractScalar(z0, z), b)), subtractScalar(multiplyScalar(subtractScalar(z0, z), a), multiplyScalar(subtractScalar(x0, x), c)), subtractScalar(multiplyScalar(subtractScalar(x0, x), b), multiplyScalar(subtractScalar(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 = subtractScalar(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});", "import { factory } from '../../utils/factory.js';\nvar name = 'intersect';\nvar dependencies = ['typed', 'config', 'abs', 'add', 'addScalar', 'matrix', 'multiply', 'multiplyScalar', 'divideScalar', 'subtract', 'smaller', 'equalScalar', 'flatten', 'isZero', 'isNumeric'];\nexport var createIntersect = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    abs,\n    add,\n    addScalar,\n    matrix,\n    multiply,\n    multiplyScalar,\n    divideScalar,\n    subtract,\n    smaller,\n    equalScalar,\n    flatten,\n    isZero,\n    isNumeric\n  } = _ref;\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 Matrix_Matrix_Matrix(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 Matrix_Matrix_Matrix_Matrix(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(el => Array.isArray(el) && el.length === 1)) 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.relTol)) {\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});", "import { containsCollections, deepForEach, reduce } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { safeNumberType } from '../../utils/number.js';\nimport { improveErrorMessage } from './utils/improveErrorMessage.js';\nvar name = 'sum';\nvar dependencies = ['typed', 'config', 'add', 'numeric'];\nexport var createSum = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    add,\n    numeric\n  } = _ref;\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 (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    deepForEach(array, function (value) {\n      try {\n        sum = sum === undefined ? value : add(sum, value);\n      } catch (err) {\n        throw improveErrorMessage(err, 'sum', value);\n      }\n    });\n\n    // 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, safeNumberType(sum, config));\n    }\n    return sum;\n  }\n  function _nsumDim(array, dim) {\n    try {\n      var sum = reduce(array, dim, add);\n      return sum;\n    } catch (err) {\n      throw improveErrorMessage(err, 'sum');\n    }\n  }\n});", "import { containsCollections } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { _switch } from '../../utils/switch.js';\nimport { improveErrorMessage } from './utils/improveErrorMessage.js';\nimport { arraySize } from '../../utils/array.js';\nimport { IndexError } from '../../error/IndexError.js';\nvar name = 'cumsum';\nvar dependencies = ['typed', 'add', 'unaryPlus'];\nexport var createCumSum = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    add,\n    unaryPlus\n  } = _ref;\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(), matrix.datatype()));\n    },\n    // sum([a, b, c, d, ...], dim)\n    'Array, number | BigNumber': _ncumSumDim,\n    'Matrix, number | BigNumber': function Matrix_number__BigNumber(matrix, dim) {\n      return matrix.create(_ncumSumDim(matrix.valueOf(), dim), matrix.datatype());\n    },\n    // cumsum(a, b, c, d, ...)\n    '...': function _(args) {\n      if (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 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 = arraySize(array);\n    if (dim < 0 || dim >= size.length) {\n      // TODO: would be more clear when throwing a DimensionError here\n      throw new IndexError(dim, size.length);\n    }\n    try {\n      return _cumsumDimensional(array, dim);\n    } catch (err) {\n      throw 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 = _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});", "import { containsCollections, deepForEach, reduce } from '../../utils/collection.js';\nimport { arraySize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { improveErrorMessage } from './utils/improveErrorMessage.js';\nvar name = 'mean';\nvar dependencies = ['typed', 'add', 'divide'];\nexport var createMean = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    add,\n    divide\n  } = _ref;\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 (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 = reduce(array, dim, add);\n      var s = Array.isArray(array) ? arraySize(array) : array.size();\n      return divide(sum, s[dim]);\n    } catch (err) {\n      throw 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    deepForEach(array, function (value) {\n      try {\n        sum = sum === undefined ? value : add(sum, value);\n        num++;\n      } catch (err) {\n        throw 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});", "import { containsCollections } from '../../utils/collection.js';\nimport { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { improveErrorMessage } from './utils/improveErrorMessage.js';\nvar name = 'median';\nvar dependencies = ['typed', 'add', 'divide', 'compare', 'partitionSelect'];\nexport var createMedian = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    add,\n    divide,\n    compare,\n    partitionSelect\n  } = _ref;\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 = 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 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 number__BigNumber__Complex__Unit(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 number__BigNumber__Complex__Unit_number__BigNumber__Complex__Unit(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 Array__Matrix_number__BigNumber(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    // median(a, b, c, d, ...)\n    '...': function _(args) {\n      if (containsCollections(args)) {\n        throw new TypeError('Scalar values expected in function median');\n      }\n      return _median(args);\n    }\n  });\n});", "import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { improveErrorMessage } from './utils/improveErrorMessage.js';\nvar name = 'mad';\nvar dependencies = ['typed', 'abs', 'map', 'median', 'subtract'];\nexport var createMad = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    abs,\n    map,\n    median,\n    subtract\n  } = _ref;\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 = 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.includes('median')) {\n        throw new TypeError(err.message.replace('median', 'mad'));\n      } else {\n        throw improveErrorMessage(err, 'mad');\n      }\n    }\n  }\n});", "import { deepForEach } from '../../utils/collection.js';\nimport { isBigNumber } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nimport { improveErrorMessage } from './utils/improveErrorMessage.js';\nvar DEFAULT_NORMALIZATION = 'unbiased';\nvar name = 'variance';\nvar dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'mapSlices', 'isNaN'];\nexport var createVariance = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    add,\n    subtract,\n    multiply,\n    divide,\n    mapSlices,\n    isNaN: mathIsNaN\n  } = _ref;\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 Array__Matrix(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 Array__Matrix_number__BigNumber(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    deepForEach(array, function (value) {\n      try {\n        sum = sum === undefined ? value : add(sum, value);\n        num++;\n      } catch (err) {\n        throw 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    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 (mathIsNaN(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 = 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 mapSlices(array, dim, x => _var(x, normalization));\n    } catch (err) {\n      throw improveErrorMessage(err, 'variance');\n    }\n  }\n});", "import { isNumber } from '../../utils/is.js';\nimport { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'quantileSeq';\nvar dependencies = ['typed', '?bignumber', 'add', 'subtract', 'divide', 'multiply', 'partitionSelect', 'compare', 'isInteger', 'smaller', 'smallerEq', 'larger', 'mapSlices'];\nexport var createQuantileSeq = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    bignumber,\n    add,\n    subtract,\n    divide,\n    multiply,\n    partitionSelect,\n    compare,\n    isInteger,\n    smaller,\n    smallerEq,\n    larger,\n    mapSlices\n  } = _ref;\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  return typed(name, {\n    'Array | Matrix, number | BigNumber': (data, p) => _quantileSeqProbNumber(data, p, false),\n    'Array | Matrix, number | BigNumber, number': (data, prob, dim) => _quantileSeqDim(data, prob, false, dim, _quantileSeqProbNumber),\n    'Array | Matrix, number | BigNumber, boolean': _quantileSeqProbNumber,\n    'Array | Matrix, number | BigNumber, boolean, number': (data, prob, sorted, dim) => _quantileSeqDim(data, prob, sorted, dim, _quantileSeqProbNumber),\n    'Array | Matrix, Array | Matrix': (data, p) => _quantileSeqProbCollection(data, p, false),\n    'Array | Matrix, Array | Matrix, number': (data, prob, dim) => _quantileSeqDim(data, prob, false, dim, _quantileSeqProbCollection),\n    'Array | Matrix, Array | Matrix, boolean': _quantileSeqProbCollection,\n    'Array | Matrix, Array | Matrix, boolean, number': (data, prob, sorted, dim) => _quantileSeqDim(data, prob, sorted, dim, _quantileSeqProbCollection)\n  });\n  function _quantileSeqDim(data, prob, sorted, dim, fn) {\n    return mapSlices(data, dim, x => fn(x, prob, sorted));\n  }\n  function _quantileSeqProbNumber(data, probOrN, sorted) {\n    var probArr;\n    var dataArr = data.valueOf();\n    if (smaller(probOrN, 0)) {\n      throw new Error('N/prob must be non-negative');\n    }\n    if (smallerEq(probOrN, 1)) {\n      // quantileSeq([a, b, c, d, ...], prob[,sorted])\n      return isNumber(probOrN) ? _quantileSeq(dataArr, probOrN, sorted) : bignumber(_quantileSeq(dataArr, probOrN, sorted));\n    }\n    if (larger(probOrN, 1)) {\n      // quantileSeq([a, b, c, d, ...], N[,sorted])\n      if (!isInteger(probOrN)) {\n        throw new Error('N must be a positive integer');\n      }\n\n      // largest possible Array length is 2^32-1\n      // 2^32 < 10^15, thus safe conversion guaranteed\n      if (larger(probOrN, 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 = add(probOrN, 1);\n      probArr = [];\n      for (var i = 0; smaller(i, probOrN); i++) {\n        var prob = divide(i + 1, nPlusOne);\n        probArr.push(_quantileSeq(dataArr, prob, sorted));\n      }\n      return isNumber(probOrN) ? probArr : bignumber(probArr);\n    }\n  }\n\n  /**\n   * Calculate the prob order quantile of an n-dimensional array.\n   *\n   * @param {Array, Matrix} array\n   * @param {Array, Matrix} prob\n   * @param {Boolean} sorted\n   * @return {Number, BigNumber, Unit} prob order quantile\n   * @private\n   */\n\n  function _quantileSeqProbCollection(data, probOrN, sorted) {\n    var dataArr = data.valueOf();\n    // quantileSeq([a, b, c, d, ...], [prob1, prob2, ...][,sorted])\n    var probOrNArr = probOrN.valueOf();\n    var probArr = [];\n    for (var i = 0; i < probOrNArr.length; ++i) {\n      probArr.push(_quantileSeq(dataArr, probOrNArr[i], sorted));\n    }\n    return probArr;\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 = flatten(array);\n    var len = flat.length;\n    if (len === 0) {\n      throw new Error('Cannot calculate quantile of an empty sequence');\n    }\n    var index = isNumber(prob) ? prob * (len - 1) : prob.times(len - 1);\n    var integerPart = isNumber(prob) ? Math.floor(index) : index.floor().toNumber();\n    var fracPart = isNumber(prob) ? index % 1 : index.minus(integerPart);\n    if (isInteger(index)) {\n      return sorted ? flat[index] : partitionSelect(flat, isNumber(prob) ? index : index.valueOf());\n    }\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    // Q(prob) = (1-f)*A[floor(index)] + f*A[floor(index)+1]\n    return add(multiply(left, subtract(1, fracPart)), multiply(right, fracPart));\n  }\n});", "import { factory } from '../../utils/factory.js';\nimport { isCollection } from '../../utils/is.js';\nvar name = 'std';\nvar dependencies = ['typed', 'map', 'sqrt', 'variance'];\nexport var createStd = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    map,\n    sqrt,\n    variance\n  } = _ref;\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 (isCollection(v)) {\n        return map(v, sqrt);\n      } else {\n        return sqrt(v);\n      }\n    } catch (err) {\n      if (err instanceof TypeError && err.message.includes(' variance')) {\n        throw new TypeError(err.message.replace(' variance', ' std'));\n      } else {\n        throw err;\n      }\n    }\n  }\n});", "import { factory } from '../../utils/factory.js';\nvar name = 'corr';\nvar dependencies = ['typed', 'matrix', 'mean', 'sqrt', 'sum', 'add', 'subtract', 'multiply', 'pow', 'divide'];\nexport var createCorr = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    sqrt,\n    sum,\n    add,\n    subtract,\n    multiply,\n    pow,\n    divide\n  } = _ref;\n  /**\n   * Compute the correlation coefficient of a two list with values, For matrices, the matrix correlation coefficient is calculated.\n   *\n   * Syntax:\n   *\n   *     math.corr(A, B)\n   *\n   * Examples:\n   *\n   *     math.corr([1, 2, 3, 4, 5], [4, 5, 6, 7, 8])     // returns 1\n   *     math.corr([1, 2.2, 3, 4.8, 5], [4, 5.3, 6.6, 7, 8])     //returns 0.9569941688503644\n   *     math.corr([[1, 2.2, 3, 4.8, 5], [4, 5.3, 6.6, 7, 8]],[[1, 2.2, 3, 4.8, 5], [4, 5.3, 6.6, 7, 8]])   // returns [1,1]\n   *\n   * See also:\n   *\n   *     median, mean, min, max, sum, prod, std, variance\n   *\n   * @param {Array | Matrix} A The first array or matrix to compute correlation coefficient\n   * @param {Array | Matrix} B The second array or matrix to compute correlation coefficient\n   * @return {*} The correlation coefficient\n   */\n  return typed(name, {\n    'Array, Array': function Array_Array(A, B) {\n      return _corr(A, B);\n    },\n    'Matrix, Matrix': function Matrix_Matrix(A, B) {\n      var res = _corr(A.toArray(), B.toArray());\n      return Array.isArray(res) ? matrix(res) : res;\n    }\n  });\n  /**\n   * Calculate the correlation coefficient between two arrays or matrices.\n   * @param {Array | Matrix} A\n   * @param {Array | Matrix} B\n   * @return {*} correlation coefficient\n   * @private\n   */\n  function _corr(A, B) {\n    var correlations = [];\n    if (Array.isArray(A[0]) && Array.isArray(B[0])) {\n      if (A.length !== B.length) {\n        throw new SyntaxError('Dimension mismatch. Array A and B must have the same length.');\n      }\n      for (var i = 0; i < A.length; i++) {\n        if (A[i].length !== B[i].length) {\n          throw new SyntaxError('Dimension mismatch. Array A and B must have the same number of elements.');\n        }\n        correlations.push(correlation(A[i], B[i]));\n      }\n      return correlations;\n    } else {\n      if (A.length !== B.length) {\n        throw new SyntaxError('Dimension mismatch. Array A and B must have the same number of elements.');\n      }\n      return correlation(A, B);\n    }\n  }\n  function correlation(A, B) {\n    var n = A.length;\n    var sumX = sum(A);\n    var sumY = sum(B);\n    var sumXY = A.reduce((acc, x, index) => add(acc, multiply(x, B[index])), 0);\n    var sumXSquare = sum(A.map(x => pow(x, 2)));\n    var sumYSquare = sum(B.map(y => pow(y, 2)));\n    var numerator = subtract(multiply(n, sumXY), multiply(sumX, sumY));\n    var denominator = sqrt(multiply(subtract(multiply(n, sumXSquare), pow(sumX, 2)), subtract(multiply(n, sumYSquare), pow(sumY, 2))));\n    return divide(numerator, denominator);\n  }\n});", "import { factory } from '../../utils/factory.js';\nimport { isInteger } from '../../utils/number.js';\nvar name = 'bernoulli';\nvar dependencies = ['typed', 'config', 'isInteger', 'number', '?BigNumber', '?Fraction'];\nexport var createBernoulli = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    number,\n    BigNumber: _BigNumber,\n    Fraction\n  } = _ref;\n  /**\n   * Return the `n`th Bernoulli number, for positive integers `n`\n   *\n   * Syntax:\n   *\n   *     math.bernoulli(n)\n   *\n   * Examples:\n   *\n   *     math.bernoulli(1)                  // returns -0.5\n   *     // All other odd Bernoulli numbers are 0:\n   *     math.bernoulli(7)                  // returns 0\n   *     math.bernoulli(math.bignumber(6))  // value bignumber(1).div(42)\n   *     // Produces exact rationals for bigint or fraction input:\n   *     math.bernoulli(8n)                 // Fraction -1,30\n   *     math.bernoulli(math.fraction(10))  // Fraction 5,66\n   *\n   * See also:\n   *\n   *     combinations, gamma, stirlingS2\n   *\n   * @param {number | BigNumber | bigint | Fraction} n\n   *    Index of the Bernoulli number\n   * @return {number | BigNumber | Fraction}\n   *    nth Bernoulli number, of a type corresponding to the argument n\n   */\n\n  var numberCache = [undefined];\n  var fractionCache = [undefined];\n  var bigCache = [undefined];\n  var cachedPrecision = 50;\n  return typed(name, {\n    number: index => _bernoulli(index, n => n, numberCache, (a, b) => a + b, (a, b) => a * b, (a, b) => a / b),\n    'bigint | Fraction': index => _bernoulli(number(index), n => new Fraction(n), fractionCache, (a, b) => a.add(b), (a, b) => a.mul(b), (a, b) => a.div(b)),\n    BigNumber: index => {\n      if (config.precision !== cachedPrecision) {\n        bigCache = [undefined];\n        cachedPrecision = config.precision;\n      }\n      return _bernoulli(number(index), n => new _BigNumber(n), bigCache, (a, b) => a.add(b), (a, b) => a.mul(b), (a, b) => a.div(b));\n    }\n  });\n});\n\n/**\n * Underlying implementation, with all operations passed in.\n * Parameters:\n * 1. index: a (positive integer) number specifying which Bernoulli number\n *    to compute.\n * 2. promote: a function that takes an integer number and returns\n *    the desired type for the Bernoulli number values.\n * 3. A: a cache array of partial computation data that _bernoulli should use.\n *    Different cache arrays should be provided for different types.\n * 4. plus: a function that adds two values of the desired type.\n * 5. times: a function that multiplies two values of the desired type.\n * 6. divide: a function that divides one value of the desired type by another.\n */\nfunction _bernoulli(index, promote, A, plus, times, divide) {\n  if (index < 0 || !isInteger(index)) {\n    throw new RangeError('Bernoulli index must be nonnegative integer');\n  }\n  if (index === 0) return promote(1);\n  if (index === 1) return divide(promote(-1), promote(2));\n  if (index % 2 === 1) return promote(0);\n  // We proceed as in https://math.stackexchange.com/a/2844337\n  // (by no means the most efficient, but very simple to implement)\n  // A cache entry consists of a triple\n  // [cotangent coefficient a_n, prefactor, Bernouilli number B_2n]\n  var one = promote(1);\n  if (A.length === 1) {\n    A.push([divide(one, promote(-3)), divide(one, promote(-2)), divide(one, promote(6))]);\n  }\n  var half = index / 2;\n  var zero = promote(0);\n  var two = promote(2);\n  while (A.length <= half) {\n    var i = A.length; // next cotangent coefficient to compute\n    var lim = Math.floor((i + 1) / 2);\n    var a = zero;\n    for (var m = 1; m < lim; ++m) {\n      a = plus(a, times(A[m][0], A[i - m][0]));\n    }\n    a = times(a, two);\n    if (i % 2 === 0) a = plus(a, times(A[lim][0], A[lim][0]));\n    a = divide(a, promote(-(2 * i + 1)));\n    var prefactor = divide(times(A[i - 1][1], promote(-i * (2 * i - 1))), two);\n    A.push([a, prefactor, times(prefactor, a)]);\n  }\n  return A[half][2];\n}", "import { factory } from '../../utils/factory.js';\nimport { combinationsNumber } from '../../plain/number/combinations.js';\nvar name = 'combinations';\nvar dependencies = ['typed'];\nexport var createCombinations = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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': combinationsNumber,\n    'BigNumber, BigNumber': function BigNumber_BigNumber(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 */\nfunction isPositiveInteger(n) {\n  return n.isInteger() && n.gte(0);\n}", "import { factory } from '../../utils/factory.js';\nimport { isInteger } from '../../utils/number.js';\nimport { product } from '../../utils/product.js';\nvar name = 'combinationsWithRep';\nvar dependencies = ['typed'];\nexport var createCombinationsWithRep = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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 number_number(n, k) {\n      if (!isInteger(n) || n < 0) {\n        throw new TypeError('Positive integer value expected in function combinationsWithRep');\n      }\n      if (!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 = product(n, n + k - 1);\n        return _prodrange / product(1, k);\n      }\n      var prodrange = product(k + 1, n + k - 1);\n      return prodrange / product(1, n - 1);\n    },\n    'BigNumber, BigNumber': function BigNumber_BigNumber(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 */\nfunction isPositiveInteger(n) {\n  return n.isInteger() && n.gte(0);\n}", "import { factory } from '../../utils/factory.js';\nimport { gammaG, gammaNumber, gammaP } from '../../plain/number/index.js';\nvar name = 'gamma';\nvar dependencies = ['typed', 'config', 'multiplyScalar', 'pow', 'BigNumber', 'Complex'];\nexport var createGamma = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    multiplyScalar,\n    pow,\n    BigNumber: _BigNumber,\n    Complex\n  } = _ref;\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 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(gammaP[0], 0);\n    // for (i, gammaPval) in enumerate(gammaP):\n    for (var i = 1; i < gammaP.length; ++i) {\n      // x += gammaPval / (z + i)\n      var gammaPval = new Complex(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 + 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: 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\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});", "/* 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\nimport { lgammaNumber, lnSqrt2PI } from '../../plain/number/index.js';\nimport { factory } from '../../utils/factory.js';\nimport { copysign } from '../../utils/number.js';\nvar name = 'lgamma';\nvar dependencies = ['Complex', 'typed'];\nexport var createLgamma = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    Complex,\n    typed\n  } = _ref;\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: 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(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 = 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(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});", "import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'factorial';\nvar dependencies = ['typed', 'gamma'];\nexport var createFactorial = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    gamma\n  } = _ref;\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(self => n => deepMap(n, self))\n  });\n});", "import { factory } from '../../utils/factory.js';\nvar name = 'kldivergence';\nvar dependencies = ['typed', 'matrix', 'divide', 'sum', 'multiply', 'map', 'dotDivide', 'log', 'isNumeric'];\nexport var createKldivergence = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    divide,\n    sum,\n    multiply,\n    map,\n    dotDivide,\n    log,\n    isNumeric\n  } = _ref;\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 Array_Array(q, p) {\n      return _kldiv(matrix(q), matrix(p));\n    },\n    'Matrix, Array': function Matrix_Array(q, p) {\n      return _kldiv(q, matrix(p));\n    },\n    'Array, Matrix': function Array_Matrix(q, p) {\n      return _kldiv(matrix(q), p);\n    },\n    'Matrix, Matrix': function Matrix_Matrix(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), x => log(x))));\n    if (isNumeric(result)) {\n      return result;\n    } else {\n      return Number.NaN;\n    }\n  }\n});", "import { deepForEach } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'multinomial';\nvar dependencies = ['typed', 'add', 'divide', 'multiply', 'factorial', 'isInteger', 'isPositive'];\nexport var createMultinomial = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    add,\n    divide,\n    multiply,\n    factorial,\n    isInteger,\n    isPositive\n  } = _ref;\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 Array__Matrix(a) {\n      var sum = 0;\n      var denom = 1;\n      deepForEach(a, function (ai) {\n        if (!isInteger(ai) || !isPositive(ai)) {\n          throw new TypeError('Positive integer value expected in function multinomial');\n        }\n        sum = add(sum, ai);\n        denom = multiply(denom, factorial(ai));\n      });\n      return divide(factorial(sum), denom);\n    }\n  });\n});", "import { isInteger } from '../../utils/number.js';\nimport { product } from '../../utils/product.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'permutations';\nvar dependencies = ['typed', 'factorial'];\nexport var createPermutations = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    factorial\n  } = _ref;\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 number_number(n, k) {\n      if (!isInteger(n) || n < 0) {\n        throw new TypeError('Positive integer value expected in function permutations');\n      }\n      if (!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 product(n - k + 1, n);\n    },\n    'BigNumber, BigNumber': function BigNumber_BigNumber(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 */\nfunction isPositiveInteger(n) {\n  return n.isInteger() && n.gte(0);\n}", "import seedrandom from 'seedrandom';\nvar singletonRandom = /* #__PURE__ */seedrandom(Date.now());\nexport function createRng(randomSeed) {\n  var random;\n\n  // create a new random generator with given seed\n  function setSeed(seed) {\n    random = seed === null ? singletonRandom : seedrandom(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}", "import { flatten } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { isMatrix, isNumber } from '../../utils/is.js';\nimport { createRng } from './util/seededRNG.js';\nvar name = 'pickRandom';\nvar dependencies = ['typed', 'config', '?on'];\nexport var createPickRandom = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    on\n  } = _ref;\n  // seeded pseudo random number generator\n  var rng = createRng(config.randomSeed);\n  if (on) {\n    on('config', function (curr, prev) {\n      if (curr.randomSeed !== prev.randomSeed) {\n        rng = 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 undefined.\n   *                                   Returns an array with the configured number of elements when number is defined.\n   */\n  return typed(name, {\n    'Array | Matrix': function Array__Matrix(possibles) {\n      return _pickRandom(possibles, {});\n    },\n    'Array | Matrix, Object': function Array__Matrix_Object(possibles, options) {\n      return _pickRandom(possibles, options);\n    },\n    'Array | Matrix, number': function Array__Matrix_number(possibles, number) {\n      return _pickRandom(possibles, {\n        number\n      });\n    },\n    'Array | Matrix, Array | Matrix': function Array__Matrix_Array__Matrix(possibles, weights) {\n      return _pickRandom(possibles, {\n        weights\n      });\n    },\n    'Array | Matrix, Array | Matrix, number': function Array__Matrix_Array__Matrix_number(possibles, weights, number) {\n      return _pickRandom(possibles, {\n        number,\n        weights\n      });\n    },\n    'Array | Matrix, number, Array | Matrix': function Array__Matrix_number_Array__Matrix(possibles, number, weights) {\n      return _pickRandom(possibles, {\n        number,\n        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 {\n      number,\n      weights,\n      elementWise = true\n    } = _ref2;\n    var single = typeof number === 'undefined';\n    if (single) {\n      number = 1;\n    }\n    var createMatrix = isMatrix(possibles) ? possibles.create : isMatrix(weights) ? weights.create : null;\n    possibles = possibles.valueOf(); // get Array\n    if (weights) {\n      weights = weights.valueOf(); // get Array\n    }\n    if (elementWise === true) {\n      possibles = flatten(possibles);\n      weights = 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 (!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});", "/**\n * This is a util function for generating a random matrix recursively.\n * @param {number[]} size\n * @param {function} random\n * @returns {Array}\n */\nexport function 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}", "import { factory } from '../../utils/factory.js';\nimport { isMatrix } from '../../utils/is.js';\nimport { createRng } from './util/seededRNG.js';\nimport { randomMatrix } from './util/randomMatrix.js';\nvar name = 'random';\nvar dependencies = ['typed', 'config', '?on'];\nexport var createRandom = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    on\n  } = _ref;\n  // seeded pseudo random number generator\n  var rng = createRng(config.randomSeed);\n  if (on) {\n    on('config', function (curr, prev) {\n      if (curr.randomSeed !== prev.randomSeed) {\n        rng = 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    '': () => _random(0, 1),\n    number: max => _random(0, max),\n    'number, number': (min, max) => _random(min, max),\n    'Array | Matrix': size => _randomMatrix(size, 0, 1),\n    'Array | Matrix, number': (size, max) => _randomMatrix(size, 0, max),\n    'Array | Matrix, number, number': (size, min, max) => _randomMatrix(size, min, max)\n  });\n  function _randomMatrix(size, min, max) {\n    var res = randomMatrix(size.valueOf(), () => _random(min, max));\n    return isMatrix(size) ? size.create(res, 'number') : 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?\nexport var createRandomNumber = /* #__PURE__ */factory(name, ['typed', 'config', '?on'], _ref2 => {\n  var {\n    typed,\n    config,\n    on,\n    matrix\n  } = _ref2;\n  // seeded pseudo random number generator1\n  var rng = createRng(config.randomSeed);\n  if (on) {\n    on('config', function (curr, prev) {\n      if (curr.randomSeed !== prev.randomSeed) {\n        rng = createRng(curr.randomSeed);\n      }\n    });\n  }\n  return typed(name, {\n    '': () => _random(0, 1),\n    number: max => _random(0, max),\n    'number, number': (min, max) => _random(min, max)\n  });\n  function _random(min, max) {\n    return min + rng() * (max - min);\n  }\n});", "import { factory } from '../../utils/factory.js';\nimport { randomMatrix } from './util/randomMatrix.js';\nimport { createRng } from './util/seededRNG.js';\nimport { isMatrix } from '../../utils/is.js';\nvar name = 'randomInt';\nvar dependencies = ['typed', 'config', 'log2', '?on'];\nexport var createRandomInt = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    log2,\n    on\n  } = _ref;\n  // seeded pseudo random number generator\n  var rng = createRng(config.randomSeed);\n  if (on) {\n    on('config', function (curr, prev) {\n      if (curr.randomSeed !== prev.randomSeed) {\n        rng = 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 either 0 or 1, randomly\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    '': () => _randomInt(0, 2),\n    number: max => _randomInt(0, max),\n    'number, number': (min, max) => _randomInt(min, max),\n    bigint: max => _randomBigint(0n, max),\n    'bigint, bigint': _randomBigint,\n    'Array | Matrix': size => _randomIntMatrix(size, 0, 1),\n    'Array | Matrix, number': (size, max) => _randomIntMatrix(size, 0, max),\n    'Array | Matrix, number, number': (size, min, max) => _randomIntMatrix(size, min, max)\n  });\n  function _randomIntMatrix(size, min, max) {\n    var res = randomMatrix(size.valueOf(), () => _randomInt(min, max));\n    return isMatrix(size) ? size.create(res, 'number') : res;\n  }\n  function _randomInt(min, max) {\n    return Math.floor(min + rng() * (max - min));\n  }\n  function _randomBigint(min, max) {\n    var simpleCutoff = 2n ** 30n;\n    var width = max - min; // number of choices\n    if (width <= simpleCutoff) {\n      // do it with number type\n      return min + BigInt(_randomInt(0, Number(width)));\n    }\n    // Too big to choose accurately that way. Instead, choose the correct\n    // number of random bits to cover the width, and repeat until the\n    // resulting number falls within the width\n    var bits = log2(width);\n    var picked = width;\n    while (picked >= width) {\n      picked = 0n;\n      for (var i = 0; i < bits; ++i) {\n        picked = 2n * picked + (rng() < 0.5 ? 0n : 1n);\n      }\n    }\n    return min + picked;\n  }\n});", "import { factory } from '../../utils/factory.js';\nimport { isNumber } from '../../utils/is.js';\nvar name = 'stirlingS2';\nvar dependencies = ['typed', 'addScalar', 'subtractScalar', 'multiplyScalar', 'divideScalar', 'pow', 'factorial', 'combinations', 'isNegative', 'isInteger', 'number', '?bignumber', 'larger'];\nexport var createStirlingS2 = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    addScalar,\n    subtractScalar,\n    multiplyScalar,\n    divideScalar,\n    pow,\n    factorial,\n    combinations,\n    isNegative,\n    isInteger,\n    number,\n    bignumber,\n    larger\n  } = _ref;\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 number__BigNumber_number__BigNumber(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 = !(isNumber(n) && 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});", "import { factory } from '../../utils/factory.js';\nvar name = 'bellNumbers';\nvar dependencies = ['typed', 'addScalar', 'isNegative', 'isInteger', 'stirlingS2'];\nexport var createBellNumbers = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    addScalar,\n    isNegative,\n    isInteger,\n    stirlingS2\n  } = _ref;\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 number__BigNumber(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});", "import { factory } from '../../utils/factory.js';\nvar name = 'catalan';\nvar dependencies = ['typed', 'addScalar', 'divideScalar', 'multiplyScalar', 'combinations', 'isNegative', 'isInteger'];\nexport var createCatalan = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    addScalar,\n    divideScalar,\n    multiplyScalar,\n    combinations,\n    isNegative,\n    isInteger\n  } = _ref;\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 number__BigNumber(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});", "import { factory } from '../../utils/factory.js';\nvar name = 'composition';\nvar dependencies = ['typed', 'addScalar', 'combinations', 'isNegative', 'isPositive', 'isInteger', 'larger'];\nexport var createComposition = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    addScalar,\n    combinations,\n    isPositive,\n    isNegative,\n    isInteger,\n    larger\n  } = _ref;\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 number__BigNumber_number__BigNumber(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});", "import { factory } from '../../utils/factory.js';\nvar name = 'leafCount';\nvar dependencies = ['parse', 'typed'];\nexport var createLeafCount = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    parse,\n    typed\n  } = _ref;\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(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   *     math.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});", "import { isConstantNode, isFunctionNode, isOperatorNode, isParenthesisNode } from '../../../utils/is.js';\nexport { isConstantNode, isSymbolNode as isVariableNode } from '../../../utils/is.js';\nexport function isNumericNode(x) {\n  return isConstantNode(x) || isOperatorNode(x) && x.isUnary() && isConstantNode(x.args[0]);\n}\nexport function isConstantExpression(x) {\n  if (isConstantNode(x)) {\n    // Basic Constant types\n    return true;\n  }\n  if ((isFunctionNode(x) || isOperatorNode(x)) && x.args.every(isConstantExpression)) {\n    // Can be constant depending on arguments\n    return true;\n  }\n  if (isParenthesisNode(x) && isConstantExpression(x.content)) {\n    // Parenthesis are transparent\n    return true;\n  }\n  return false; // Probably missing some edge cases\n}", "import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nfunction ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }\nfunction _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }\nimport { isFunctionNode, isOperatorNode, isParenthesisNode } from '../../../utils/is.js';\nimport { factory } from '../../../utils/factory.js';\nimport { hasOwnProperty } from '../../../utils/object.js';\nvar name = 'simplifyUtil';\nvar dependencies = ['FunctionNode', 'OperatorNode', 'SymbolNode'];\nexport var createUtil = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    FunctionNode,\n    OperatorNode,\n    SymbolNode\n  } = _ref;\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 (isOperatorNode(nodeOrName)) {\n      name = nodeOrName.fn.toString();\n    } else if (isFunctionNode(nodeOrName)) {\n      name = nodeOrName.name;\n    } else if (isParenthesisNode(nodeOrName)) {\n      name = 'paren';\n    }\n    if (hasOwnProperty(context, name)) {\n      var properties = context[name];\n      if (hasOwnProperty(properties, property)) {\n        return properties[property];\n      }\n      if (hasOwnProperty(defaultContext, name)) {\n        return defaultContext[name][property];\n      }\n    }\n    if (hasOwnProperty(context, defaultName)) {\n      var _properties = context[defaultName];\n      if (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 (hasOwnProperty(defaultContext, name)) {\n      var _properties2 = defaultContext[name];\n      if (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 (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 (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 (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,\n    hasProperty,\n    isCommutative,\n    isAssociative,\n    mergeContext,\n    flatten,\n    allChildren,\n    unflattenr,\n    unflattenl,\n    defaultContext,\n    realContext,\n    positiveContext\n  };\n});", "import { isParenthesisNode } from '../../utils/is.js';\nimport { isConstantNode, isVariableNode, isNumericNode, isConstantExpression } from './simplify/wildcards.js';\nimport { factory } from '../../utils/factory.js';\nimport { createUtil } from './simplify/util.js';\nimport { hasOwnProperty } from '../../utils/object.js';\nimport { createEmptyMap, createMap } from '../../utils/map.js';\nvar name = 'simplify';\nvar dependencies = ['typed', 'parse', 'equal', 'resolve', 'simplifyConstant', 'simplifyCore', 'AccessorNode', 'ArrayNode', 'ConstantNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode', 'replacer'];\nexport var createSimplify = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    parse,\n    equal,\n    resolve,\n    simplifyConstant,\n    simplifyCore,\n    AccessorNode,\n    ArrayNode,\n    ConstantNode,\n    FunctionNode,\n    IndexNode,\n    ObjectNode,\n    OperatorNode,\n    ParenthesisNode,\n    SymbolNode,\n    replacer\n  } = _ref;\n  var {\n    hasProperty,\n    isCommutative,\n    isAssociative,\n    mergeContext,\n    flatten,\n    unflattenr,\n    unflattenl,\n    createMakeNodeFunction,\n    defaultContext,\n    realContext,\n    positiveContext\n  } = createUtil({\n    FunctionNode,\n    OperatorNode,\n    SymbolNode\n  });\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 \u221A3) [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 \u221A3) [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   *     math.simplify(expr)\n   *     math.simplify(expr, rules)\n   *     math.simplify(expr, rules)\n   *     math.simplify(expr, rules, scope)\n   *     math.simplify(expr, rules, scope, options)\n   *     math.simplify(expr, scope)\n   *     math.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: createMap\n  });\n  var simplify = typed('simplify', {\n    Node: _simplify,\n    'Node, Map': (expr, scope) => _simplify(expr, false, scope),\n    'Node, Map, Object': (expr, scope, options) => _simplify(expr, false, scope, options),\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: createMap\n  });\n  simplify.defaultContext = defaultContext;\n  simplify.realContext = realContext;\n  simplify.positiveContext = positiveContext;\n  function removeParens(node) {\n    return node.transform(function (node) {\n      return 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    l: 'n+-(n1)',\n    r: 'n-(n1)'\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 prop of ['imposeContext', 'repeat', 'assuming']) {\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 = typeof 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] : 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 && 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    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 _i = 1; _i < node.args.length; _i++) {\n        var left = node.args[0];\n        if (_i > 1) {\n          left = makeNode(node.args.slice(0, _i));\n        }\n        rightArgs = node.args.slice(_i);\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 (hasOwnProperty(match1.placeholders, key)) {\n        res.placeholders[key] = match1.placeholders[key];\n        if (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 (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], replacer);\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 _i2 = 0; _i2 < splits.length; _i2++) {\n          var matchSet = _ruleMatch(rule, splits[_i2], 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 (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 (!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 (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 (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 (!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 (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 (!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});", "import { isFraction, isMatrix, isNode, isArrayNode, isConstantNode, isIndexNode, isObjectNode, isOperatorNode } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nimport { safeNumberType } from '../../utils/number.js';\nimport { createUtil } from './simplify/util.js';\nimport { noBignumber, noFraction } from '../../utils/noop.js';\nvar name = 'simplifyConstant';\nvar dependencies = ['typed', 'config', 'mathWithTransform', 'matrix', 'isBounded', '?fraction', '?bignumber', 'AccessorNode', 'ArrayNode', 'ConstantNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'SymbolNode'];\nexport var createSimplifyConstant = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    mathWithTransform,\n    matrix,\n    isBounded,\n    fraction,\n    bignumber,\n    AccessorNode,\n    ArrayNode,\n    ConstantNode,\n    FunctionNode,\n    IndexNode,\n    ObjectNode,\n    OperatorNode,\n    SymbolNode\n  } = _ref;\n  var {\n    isCommutative,\n    isAssociative,\n    allChildren,\n    createMakeNodeFunction\n  } = createUtil({\n    FunctionNode,\n    OperatorNode,\n    SymbolNode\n  });\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   *     math.simplifyConstant(expr)\n   *     math.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: node => _ensureNode(foldFraction(node, {})),\n    'Node, Object': function Node_Object(expr, options) {\n      return _ensureNode(foldFraction(expr, options));\n    }\n  });\n  function _removeFractions(thing) {\n    if (isFraction(thing)) {\n      return thing.valueOf();\n    }\n    if (thing instanceof Array) {\n      return thing.map(_removeFractions);\n    }\n    if (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    bigint: function bigint(n) {\n      if (n < 0n) {\n        return unaryMinusNode(new ConstantNode(-n));\n      }\n      return new ConstantNode(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(e => _toNode(e)));\n    }\n  });\n  function _ensureNode(thing) {\n    if (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 && isBounded(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 string_Object(s, options) {\n      var numericType = safeNumberType(s, config);\n      if (numericType === 'BigNumber') {\n        if (bignumber === undefined) {\n          noBignumber();\n        }\n        return bignumber(s);\n      } else if (numericType === 'bigint') {\n        return BigInt(s);\n      } else if (numericType === 'Fraction') {\n        if (fraction === undefined) {\n          noFraction();\n        }\n        return fraction(s);\n      } else {\n        var n = parseFloat(s);\n        return _exactFraction(n, options);\n      }\n    },\n    'Fraction, Object': function Fraction_Object(s, options) {\n      return s;\n    },\n    // we don't need options here\n\n    'BigNumber, Object': function BigNumber_Object(s, options) {\n      return s;\n    },\n    // we don't need options here\n\n    'number, Object': function number_Object(s, options) {\n      return _exactFraction(s, options);\n    },\n    'bigint, Object': function bigint_Object(s, options) {\n      return s;\n    },\n    'Complex, Object': function Complex_Object(s, options) {\n      if (s.im !== 0) {\n        return s;\n      }\n      return _exactFraction(s.re, options);\n    },\n    'Matrix, Object': function Matrix_Object(s, options) {\n      return matrix(_exactFraction(s.valueOf()));\n    },\n    'Array, Object': function Array_Object(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    // note: we convert await from bigint values, because bigint values gives issues with divisions: 1n/2n=0n and not 0.5\n    var fromBigInt = value => config.number === 'BigNumber' && bignumber ? bignumber(value) : Number(value);\n    var numeratorValue = f.s * f.n;\n    var numeratorNode = numeratorValue < 0n ? new OperatorNode('-', 'unaryMinus', [new ConstantNode(-fromBigInt(numeratorValue))]) : new ConstantNode(fromBigInt(numeratorValue));\n    return f.d === 1n ? numeratorNode : new OperatorNode('/', 'divide', [numeratorNode, new ConstantNode(fromBigInt(f.d))]);\n  }\n\n  /* Handles constant indexing of ArrayNodes, matrices, and ObjectNodes */\n  function _foldAccessor(obj, index, options) {\n    if (!isIndexNode(index)) {\n      // don't know what to do with that...\n      return new AccessorNode(_ensureNode(obj), _ensureNode(index));\n    }\n    if (isArrayNode(obj) || 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 (isConstantNode(remainingDims[0]) && typeof remainingDims[0].value !== 'string') {\n          var first = _toNumber(remainingDims.shift().value, options);\n          if (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 && isConstantNode(remainingDims[1]) && typeof remainingDims[1].value !== 'string') {\n          var second = _toNumber(remainingDims[1].value, options);\n          var tryItems = [];\n          var fromItems = isArrayNode(obj) ? obj.items : obj.valueOf();\n          for (var item of fromItems) {\n            if (isArrayNode(item)) {\n              tryItems.push(item.items[second - 1]);\n            } else if (isMatrix(obj)) {\n              tryItems.push(item[second - 1]);\n            } else {\n              break;\n            }\n          }\n          if (tryItems.length === fromItems.length) {\n            if (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 (isObjectNode(obj) && index.dimensions.length === 1 && 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((sofar, next) => {\n      if (!isNode(next)) {\n        var last = sofar.pop();\n        if (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 (typeof node.value) {\n          case 'number':\n            return _toNumber(node.value, options);\n          case 'bigint':\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.includes(node.name)) {\n            var args = node.args.map(arg => foldFraction(arg, options));\n\n            // If all args are numbers\n            if (!args.some(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 && isArrayNode(args[0])) {\n              var sz = [];\n              var section = args[0];\n              while (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 (isOperatorNode(node) && node.isUnary()) {\n            _args = [foldFraction(node.args[0], options)];\n            if (!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(arg => foldFraction(arg, options));\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 (!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(arg => foldFraction(arg, options));\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(item => foldFraction(item, options));\n          if (foldItems.some(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(n => simplifyConstant(n, options)));\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});", "import { isAccessorNode, isArrayNode, isConstantNode, isFunctionNode, isIndexNode, isObjectNode, isOperatorNode } from '../../utils/is.js';\nimport { getOperator } from '../../expression/operators.js';\nimport { createUtil } from './simplify/util.js';\nimport { factory } from '../../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'];\nexport var createSimplifyCore = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    parse,\n    equal,\n    isZero,\n    add,\n    subtract,\n    multiply,\n    divide,\n    pow,\n    AccessorNode,\n    ArrayNode,\n    ConstantNode,\n    FunctionNode,\n    IndexNode,\n    ObjectNode,\n    OperatorNode,\n    ParenthesisNode,\n    SymbolNode\n  } = _ref;\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 isOperatorNode(node) && ['and', 'not', 'or'].includes(node.op);\n  }\n  var {\n    hasProperty,\n    isCommutative\n  } = createUtil({\n    FunctionNode,\n    OperatorNode,\n    SymbolNode\n  });\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   *     math.simplifyCore(expr)\n   *     math.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 (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(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 (isFunctionNode(node)) {\n      var op = 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(n => _simplifyCore(n, options)));\n      }\n    }\n    if (isOperatorNode(node) && node.isUnary()) {\n      var a0 = _simplifyCore(node.args[0], options);\n      if (node.op === '~') {\n        // bitwise not\n        if (isOperatorNode(a0) && a0.isUnary() && a0.op === '~') {\n          return a0.args[0];\n        }\n      }\n      if (node.op === 'not') {\n        // logical not\n        if (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 (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          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 (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 (isConstantNode(_a) && isZero(_a.value)) {\n          return a1;\n        }\n        if (isConstantNode(a1) && isZero(a1.value)) {\n          return _a;\n        }\n        if (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 (isOperatorNode(a1) && a1.isUnary() && a1.op === '-') {\n          return _simplifyCore(new OperatorNode('+', 'add', [_a, a1.args[0]]), options);\n        }\n        if (isConstantNode(_a) && isZero(_a.value)) {\n          return _simplifyCore(new OperatorNode('-', 'unaryMinus', [a1]));\n        }\n        if (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 (isConstantNode(_a)) {\n          if (isZero(_a.value)) {\n            return node0;\n          } else if (equal(_a.value, 1)) {\n            return a1;\n          }\n        }\n        if (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        return new OperatorNode(node.op, node.fn, [_a, a1], node.implicit);\n      }\n      if (node.op === '/') {\n        if (isConstantNode(_a) && isZero(_a.value)) {\n          return node0;\n        }\n        if (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 (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 (isConstantNode(_a)) {\n          if (_a.value) {\n            if (isAlwaysBoolean(a1)) return a1;\n            if (isConstantNode(a1)) {\n              return a1.value ? nodeT : nodeF;\n            }\n          } else {\n            return nodeF;\n          }\n        }\n        if (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 (isConstantNode(_a)) {\n          if (_a.value) {\n            return nodeT;\n          } else {\n            if (isAlwaysBoolean(a1)) return a1;\n          }\n        }\n        if (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 (isOperatorNode(node)) {\n      return new OperatorNode(node.op, node.fn, node.args.map(a => _simplifyCore(a, options)));\n    }\n    if (isArrayNode(node)) {\n      return new ArrayNode(node.items.map(n => _simplifyCore(n, options)));\n    }\n    if (isAccessorNode(node)) {\n      return new AccessorNode(_simplifyCore(node.object, options), _simplifyCore(node.index, options));\n    }\n    if (isIndexNode(node)) {\n      return new IndexNode(node.dimensions.map(n => _simplifyCore(n, options)));\n    }\n    if (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});", "import { createMap } from '../../utils/map.js';\nimport { isFunctionNode, isNode, isOperatorNode, isParenthesisNode, isSymbolNode } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'resolve';\nvar dependencies = ['typed', 'parse', 'ConstantNode', 'FunctionNode', 'OperatorNode', 'ParenthesisNode'];\nexport var createResolve = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    parse,\n    ConstantNode,\n    FunctionNode,\n    OperatorNode,\n    ParenthesisNode\n  } = _ref;\n  /**\n   * resolve(expr, scope) replaces variable nodes with their scoped values\n   *\n   * Syntax:\n   *\n   *     math.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 (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 (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 (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 (isParenthesisNode(node)) {\n      return new ParenthesisNode(_resolve(node.content, scope, within));\n    } else if (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(child => _resolve(child, scope, within));\n  }\n  return typed('resolve', {\n    Node: _resolve,\n    'Node, Map | null | undefined': _resolve,\n    'Node, Object': (n, scope) => _resolve(n, createMap(scope)),\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(self => A => A.map(n => self(n))),\n    'Array | Matrix, null | undefined': typed.referToSelf(self => A => A.map(n => self(n))),\n    'Array, Object': typed.referTo('Array,Map', selfAM => (A, scope) => selfAM(A, createMap(scope))),\n    'Matrix, Object': typed.referTo('Matrix,Map', selfMM => (A, scope) => selfMM(A, createMap(scope))),\n    'Array | Matrix, Map': typed.referToSelf(self => (A, scope) => A.map(n => self(n, scope)))\n  });\n});", "import { isConstantNode } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'symbolicEqual';\nvar dependencies = ['parse', 'simplify', 'typed', 'OperatorNode'];\nexport var createSymbolicEqual = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    parse,\n    simplify,\n    typed,\n    OperatorNode\n  } = _ref;\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   *     math.symbolicEqual(expr1, expr2)\n   *     math.symbolicEqual(expr1, expr2, options)\n   *\n   * Examples:\n   *\n   *     math.symbolicEqual('x*y', 'y*x') // Returns true\n   *     math.symbolicEqual('x*y', 'y*x', {context: {multiply: {commutative: false}}}) // Returns false\n   *     math.symbolicEqual('x/y', '(y*x^(-1))^(-1)') // Returns true\n   *     math.symbolicEqual('abs(x)','x') // Returns false\n   *     math.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 isConstantNode(simplified) && !simplified.value;\n  }\n  return typed(name, {\n    'Node, Node': _symbolicEqual,\n    'Node, Node, Object': _symbolicEqual\n  });\n});", "import { isConstantNode, typeOf } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nimport { safeNumberType } from '../../utils/number.js';\nvar name = 'derivative';\nvar dependencies = ['typed', 'config', 'parse', 'simplify', 'equal', 'isZero', 'numeric', 'ConstantNode', 'FunctionNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode'];\nexport var createDerivative = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    parse,\n    simplify,\n    equal,\n    isZero,\n    numeric,\n    ConstantNode,\n    FunctionNode,\n    OperatorNode,\n    ParenthesisNode,\n    SymbolNode\n  } = _ref;\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   *     math.derivative(expr, variable)\n   *     math.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 cache = new Map();\n    var variableName = variable.name;\n    function isConstCached(node) {\n      var cached = cache.get(node);\n      if (cached !== undefined) {\n        return cached;\n      }\n      var res = _isConst(isConstCached, node, variableName);\n      cache.set(node, res);\n      return res;\n    }\n    var res = _derivative(expr, isConstCached);\n    return options.simplify ? simplify(res) : res;\n  }\n  function parseIdentifier(string) {\n    var symbol = parse(string);\n    if (!symbol.isSymbolNode) {\n      throw new TypeError('Invalid variable. ' + \"Cannot parse \".concat(JSON.stringify(string), \" into a variable in function derivative\"));\n    }\n    return symbol;\n  }\n  var derivative = typed(name, {\n    'Node, SymbolNode': plainDerivative,\n    'Node, SymbolNode, Object': plainDerivative,\n    'Node, string': (node, symbol) => plainDerivative(node, parseIdentifier(symbol)),\n    'Node, string, Object': (node, symbol, options) => plainDerivative(node, parseIdentifier(symbol), options)\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        <create caching isConst>\n        res = _derivative(res, isConst)\n      }\n      return res\n    }\n    */\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 Node_SymbolNode(expr, x) {\n      if (isConstantNode(expr) && 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 Node_ConstantNode(expr, x) {\n      if (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 Node_SymbolNode_ConstantNode(expr, x, order) {\n      return _derivTex(expr.toString(), x.name, order.value);\n    },\n    'string, string, number': function string_string_number(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   * Checks if a node is constants (e.g. 2 + 2).\n   * Accepts (usually memoized) version of self as the first parameter for recursive calls.\n   * 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  {function} isConst  Function that tells whether sub-expression is a 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  var _isConst = typed('_isConst', {\n    'function, ConstantNode, string': function function_ConstantNode_string() {\n      return true;\n    },\n    'function, SymbolNode, string': function function_SymbolNode_string(isConst, node, varName) {\n      // Treat other variables like constants. For reasoning, see:\n      //   https://en.wikipedia.org/wiki/Partial_derivative\n      return node.name !== varName;\n    },\n    'function, ParenthesisNode, string': function function_ParenthesisNode_string(isConst, node, varName) {\n      return isConst(node.content, varName);\n    },\n    'function, FunctionAssignmentNode, string': function function_FunctionAssignmentNode_string(isConst, node, varName) {\n      if (!node.params.includes(varName)) {\n        return true;\n      }\n      return isConst(node.expr, varName);\n    },\n    'function, FunctionNode | OperatorNode, string': function function_FunctionNode__OperatorNode_string(isConst, node, varName) {\n      return node.args.every(arg => isConst(arg, varName));\n    }\n  });\n\n  /**\n   * Applies differentiation rules.\n   *\n   * @param  {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node\n   * @param  {function} isConst  Function that tells if a node is constant\n   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode}    The derivative of `expr`\n   */\n  var _derivative = typed('_derivative', {\n    'ConstantNode, function': function ConstantNode_function() {\n      return createConstantNode(0);\n    },\n    'SymbolNode, function': function SymbolNode_function(node, isConst) {\n      if (isConst(node)) {\n        return createConstantNode(0);\n      }\n      return createConstantNode(1);\n    },\n    'ParenthesisNode, function': function ParenthesisNode_function(node, isConst) {\n      return new ParenthesisNode(_derivative(node.content, isConst));\n    },\n    'FunctionAssignmentNode, function': function FunctionAssignmentNode_function(node, isConst) {\n      if (isConst(node)) {\n        return createConstantNode(0);\n      }\n      return _derivative(node.expr, isConst);\n    },\n    'FunctionNode, function': function FunctionNode_function(node, isConst) {\n      if (isConst(node)) {\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            return _derivative(new OperatorNode('^', 'pow', [arg0, arg1]), isConst);\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 && isConst(node.args[1])) {\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]])]), isConst);\n          }\n          break;\n        case 'pow':\n          if (node.args.length === 2) {\n            // Pass to pow operator node parser\n            return _derivative(new OperatorNode('^', 'pow', [arg0, node.args[1]]), isConst);\n          }\n          break;\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('Cannot process function \"' + node.name + '\" in derivative: ' + 'the function is not supported, undefined, or the number of arguments passed to it are not supported');\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, isConst);\n      if (negative) {\n        chainDerivative = new OperatorNode('-', 'unaryMinus', [chainDerivative]);\n      }\n      return new OperatorNode(op, func, [chainDerivative, funcDerivative]);\n    },\n    'OperatorNode, function': function OperatorNode_function(node, isConst) {\n      if (isConst(node)) {\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, isConst);\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], isConst)]);\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], isConst), _derivative(node.args[1], isConst)]);\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 isConst(arg);\n        });\n        if (constantTerms.length > 0) {\n          var nonConstantTerms = node.args.filter(function (arg) {\n            return !isConst(arg);\n          });\n          var nonConstantNode = nonConstantTerms.length === 1 ? nonConstantTerms[0] : new OperatorNode('*', 'multiply', nonConstantTerms);\n          var newArgs = constantTerms.concat(_derivative(nonConstantNode, isConst));\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, isConst) : 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 (isConst(arg1)) {\n          return new OperatorNode('/', 'divide', [_derivative(arg0, isConst), arg1]);\n        }\n\n        // Reciprocal Rule, d/dx(c / f(x)) = -c(f'(x)/f(x)^2)\n        if (isConst(arg0)) {\n          return new OperatorNode('*', 'multiply', [new OperatorNode('-', 'unaryMinus', [arg0]), new OperatorNode('/', 'divide', [_derivative(arg1, isConst), 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, isConst), arg1.clone()]), new OperatorNode('*', 'multiply', [arg0.clone(), _derivative(arg1, isConst)])]), 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 (isConst(_arg)) {\n          // If is secretly constant; 0^f(x) = 1 (in JS), 1^f(x) = 1\n          if (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(), isConst)])]);\n        }\n        if (isConst(_arg2)) {\n          if (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, isConst);\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, isConst), 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, isConst), new OperatorNode('/', 'divide', [_arg2.clone(), _arg.clone()])]), new OperatorNode('*', 'multiply', [_derivative(_arg2, isConst), new FunctionNode('log', [_arg.clone()])])])]);\n      }\n      throw new Error('Cannot process operator \"' + node.op + '\" in derivative: ' + 'the operator is not supported, undefined, or the number of arguments passed to it are not supported');\n    }\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 || safeNumberType(String(value), config)));\n  }\n  return derivative;\n});", "import { isInteger } from '../../utils/number.js';\nimport { factory } from '../../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'];\nexport var createRationalize = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    config,\n    typed,\n    equal,\n    isZero,\n    add,\n    subtract,\n    multiply,\n    divide,\n    pow,\n    parse,\n    simplifyConstant,\n    simplifyCore,\n    simplify,\n    fraction,\n    bignumber,\n    mathWithTransform,\n    matrix,\n    AccessorNode,\n    ArrayNode,\n    ConstantNode,\n    FunctionNode,\n    IndexNode,\n    ObjectNode,\n    OperatorNode,\n    SymbolNode,\n    ParenthesisNode\n  } = _ref;\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   *     math.rationalize(expr)\n   *     math.rationalize(expr, detailed)\n   *     math.rationalize(expr, scope)\n   *     math.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        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': (expr, detailed) => _rationalize(expr, {}, detailed),\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' || !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.includes(node.op)) {\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\uFFFDry 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    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 && 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 (!'+-*^'.includes(node.op)) 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 (!isInteger(valor) || valor <= 0) {\n            throw new Error('Non-integer exponent is not allowed');\n          }\n          for (var _i2 = maxExpo + 1; _i2 < valor; _i2++) coefficients[_i2] = 0;\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});", "import { factory } from '../../utils/factory.js';\nvar name = 'zpk2tf';\nvar dependencies = ['typed', 'add', 'multiply', 'Complex', 'number'];\nexport var createZpk2tf = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    add,\n    multiply,\n    Complex,\n    number\n  } = _ref;\n  /**\n     * Compute the transfer function of a zero-pole-gain model.\n     *\n     * Syntax:\n     *      math.zpk2tf(z, p, k)\n     *\n     * Examples:\n     *    math.zpk2tf([1, 2], [-1, -2], 1)    // returns [[1, -3, 2], [1, 3, 2]]\n     *\n     * See also:\n     *   freqz\n     *\n     * @param {Array} z Array of zeros values\n     * @param {Array} p Array of poles values\n     * @param {number} k Gain value\n     * @return {Array} Two dimensional array containing the numerator (first row) and denominator (second row) polynomials\n     *\n     */\n  return typed(name, {\n    'Array,Array,number': function ArrayArrayNumber(z, p, k) {\n      return _zpk2tf(z, p, k);\n    },\n    'Array,Array': function ArrayArray(z, p) {\n      return _zpk2tf(z, p, 1);\n    },\n    'Matrix,Matrix,number': function MatrixMatrixNumber(z, p, k) {\n      return _zpk2tf(z.valueOf(), p.valueOf(), k);\n    },\n    'Matrix,Matrix': function MatrixMatrix(z, p) {\n      return _zpk2tf(z.valueOf(), p.valueOf(), 1);\n    }\n  });\n  function _zpk2tf(z, p, k) {\n    // if z is bignumber, convert it to number\n    if (z.some(el => el.type === 'BigNumber')) {\n      z = z.map(el => number(el));\n    }\n    // if p is bignumber, convert it to number\n    if (p.some(el => el.type === 'BigNumber')) {\n      p = p.map(el => number(el));\n    }\n    var num = [Complex(1, 0)];\n    var den = [Complex(1, 0)];\n    for (var i = 0; i < z.length; i++) {\n      var zero = z[i];\n      if (typeof zero === 'number') zero = Complex(zero, 0);\n      num = _multiply(num, [Complex(1, 0), Complex(-zero.re, -zero.im)]);\n    }\n    for (var _i = 0; _i < p.length; _i++) {\n      var pole = p[_i];\n      if (typeof pole === 'number') pole = Complex(pole, 0);\n      den = _multiply(den, [Complex(1, 0), Complex(-pole.re, -pole.im)]);\n    }\n    for (var _i2 = 0; _i2 < num.length; _i2++) {\n      num[_i2] = multiply(num[_i2], k);\n    }\n    return [num, den];\n  }\n  function _multiply(a, b) {\n    var c = [];\n    for (var i = 0; i < a.length + b.length - 1; i++) {\n      c[i] = Complex(0, 0);\n      for (var j = 0; j < a.length; j++) {\n        if (i - j >= 0 && i - j < b.length) {\n          c[i] = add(c[i], multiply(a[j], b[i - j]));\n        }\n      }\n    }\n    return c;\n  }\n});", "import { factory } from '../../utils/factory.js';\nvar name = 'freqz';\nvar dependencies = ['typed', 'add', 'multiply', 'Complex', 'divide', 'matrix'];\nexport var createFreqz = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    add,\n    multiply,\n    Complex,\n    divide,\n    matrix\n  } = _ref;\n  /**\n     * Calculates the frequency response of a filter given its numerator and denominator coefficients.\n     *\n     * Syntax:\n     *    math.freqz(b, a)\n     *    math.freqz(b, a, w)\n     *\n     * Examples:\n     *   math.freqz([1, 2], [1, 2, 3], 4) // returns { h: [0.5 + 0i, 0.4768589245763655 + 0.2861153547458193i, 0.25000000000000006 + 0.75i, -0.770976571635189 + 0.4625859429811135i], w: [0, 0.7853981633974483, 1.5707963267948966, 2.356194490192345 ] }\n     *   math.freqz([1, 2], [1, 2, 3], [0, 1]) // returns { h: [0.5 + 0i, 0.45436781 + 0.38598051i], w: [0, 1] }\n     *\n     * See also:\n     *  zpk2tf\n     *\n     * @param {Array.<number>} b The numerator coefficients of the filter.\n     * @param {Array.<number>} a The denominator coefficients of the filter.\n     * @param {Array.<number>} [w] A vector of frequencies (in radians/sample) at which the frequency response is to be computed or the number of points to compute (if a number is not provided, the default is 512 points)\n     * @returns {Object} An object with two properties: h, a vector containing the complex frequency response, and w, a vector containing the normalized frequencies (in radians/sample) at which the response was computed.\n     *\n     *\n     */\n  return typed(name, {\n    'Array, Array': function Array_Array(b, a) {\n      var w = createBins(512);\n      return _freqz(b, a, w);\n    },\n    'Array, Array, Array': function Array_Array_Array(b, a, w) {\n      return _freqz(b, a, w);\n    },\n    'Array, Array, number': function Array_Array_number(b, a, w) {\n      if (w < 0) {\n        throw new Error('w must be a positive number');\n      }\n      var w2 = createBins(w);\n      return _freqz(b, a, w2);\n    },\n    'Matrix, Matrix': function Matrix_Matrix(b, a) {\n      // console.log('here')\n      var _w = createBins(512);\n      var {\n        w,\n        h\n      } = _freqz(b.valueOf(), a.valueOf(), _w);\n      return {\n        w: matrix(w),\n        h: matrix(h)\n      };\n    },\n    'Matrix, Matrix, Matrix': function Matrix_Matrix_Matrix(b, a, w) {\n      var {\n        h\n      } = _freqz(b.valueOf(), a.valueOf(), w.valueOf());\n      return {\n        h: matrix(h),\n        w: matrix(w)\n      };\n    },\n    'Matrix, Matrix, number': function Matrix_Matrix_number(b, a, w) {\n      if (w < 0) {\n        throw new Error('w must be a positive number');\n      }\n      var _w = createBins(w);\n      var {\n        h\n      } = _freqz(b.valueOf(), a.valueOf(), _w);\n      return {\n        h: matrix(h),\n        w: matrix(_w)\n      };\n    }\n  });\n  function _freqz(b, a, w) {\n    var num = [];\n    var den = [];\n    for (var i = 0; i < w.length; i++) {\n      var sumNum = Complex(0, 0);\n      var sumDen = Complex(0, 0);\n      for (var j = 0; j < b.length; j++) {\n        sumNum = add(sumNum, multiply(b[j], Complex(Math.cos(-j * w[i]), Math.sin(-j * w[i]))));\n      }\n      for (var _j = 0; _j < a.length; _j++) {\n        sumDen = add(sumDen, multiply(a[_j], Complex(Math.cos(-_j * w[i]), Math.sin(-_j * w[i]))));\n      }\n      num.push(sumNum);\n      den.push(sumDen);\n    }\n    var h = [];\n    for (var _i = 0; _i < num.length; _i++) {\n      h.push(divide(num[_i], den[_i]));\n    }\n    return {\n      h,\n      w\n    };\n  }\n  function createBins(n) {\n    var bins = [];\n    for (var i = 0; i < n; i++) {\n      bins.push(i / n * Math.PI);\n    }\n    return bins;\n  }\n});", "import { factory } from '../utils/factory.js';\nvar name = 'reviver';\nvar dependencies = ['classes'];\nexport var createReviver = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    classes\n  } = _ref;\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});", "import { factory } from '../utils/factory.js';\nvar name = 'replacer';\nvar dependencies = [];\nexport var createReplacer = /* #__PURE__ */factory(name, dependencies, () => {\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' && (!Number.isFinite(value) || isNaN(value))) {\n      return {\n        mathjs: 'number',\n        value: String(value)\n      };\n    }\n    if (typeof value === 'bigint') {\n      return {\n        mathjs: 'bigint',\n        value: String(value)\n      };\n    }\n    return value;\n  };\n});", "export var version = '15.1.1';\n// Note: This file is automatically generated when building math.js.\n// Changes made in this file will be overwritten.", "import { factory } from './utils/factory.js';\nimport { version } from './version.js';\nimport { createBigNumberE, createBigNumberPhi, createBigNumberPi, createBigNumberTau } from './utils/bignumber/constants.js';\nimport { pi, tau, e, phi } from './plain/number/index.js';\nexport var createTrue = /* #__PURE__ */factory('true', [], () => true);\nexport var createFalse = /* #__PURE__ */factory('false', [], () => false);\nexport var createNull = /* #__PURE__ */factory('null', [], () => null);\nexport var createInfinity = /* #__PURE__ */recreateFactory('Infinity', ['config', '?BigNumber'], _ref => {\n  var {\n    config,\n    BigNumber\n  } = _ref;\n  return config.number === 'BigNumber' ? new BigNumber(Infinity) : Infinity;\n});\nexport var createNaN = /* #__PURE__ */recreateFactory('NaN', ['config', '?BigNumber'], _ref2 => {\n  var {\n    config,\n    BigNumber\n  } = _ref2;\n  return config.number === 'BigNumber' ? new BigNumber(NaN) : NaN;\n});\nexport var createPi = /* #__PURE__ */recreateFactory('pi', ['config', '?BigNumber'], _ref3 => {\n  var {\n    config,\n    BigNumber\n  } = _ref3;\n  return config.number === 'BigNumber' ? createBigNumberPi(BigNumber) : pi;\n});\nexport var createTau = /* #__PURE__ */recreateFactory('tau', ['config', '?BigNumber'], _ref4 => {\n  var {\n    config,\n    BigNumber\n  } = _ref4;\n  return config.number === 'BigNumber' ? createBigNumberTau(BigNumber) : tau;\n});\nexport var createE = /* #__PURE__ */recreateFactory('e', ['config', '?BigNumber'], _ref5 => {\n  var {\n    config,\n    BigNumber\n  } = _ref5;\n  return config.number === 'BigNumber' ? createBigNumberE(BigNumber) : e;\n});\n\n// golden ratio, (1+sqrt(5))/2\nexport var createPhi = /* #__PURE__ */recreateFactory('phi', ['config', '?BigNumber'], _ref6 => {\n  var {\n    config,\n    BigNumber\n  } = _ref6;\n  return config.number === 'BigNumber' ? createBigNumberPhi(BigNumber) : phi;\n});\nexport var createLN2 = /* #__PURE__ */recreateFactory('LN2', ['config', '?BigNumber'], _ref7 => {\n  var {\n    config,\n    BigNumber\n  } = _ref7;\n  return config.number === 'BigNumber' ? new BigNumber(2).ln() : Math.LN2;\n});\nexport var createLN10 = /* #__PURE__ */recreateFactory('LN10', ['config', '?BigNumber'], _ref8 => {\n  var {\n    config,\n    BigNumber\n  } = _ref8;\n  return config.number === 'BigNumber' ? new BigNumber(10).ln() : Math.LN10;\n});\nexport var createLOG2E = /* #__PURE__ */recreateFactory('LOG2E', ['config', '?BigNumber'], _ref9 => {\n  var {\n    config,\n    BigNumber\n  } = _ref9;\n  return config.number === 'BigNumber' ? new BigNumber(1).div(new BigNumber(2).ln()) : Math.LOG2E;\n});\nexport var createLOG10E = /* #__PURE__ */recreateFactory('LOG10E', ['config', '?BigNumber'], _ref0 => {\n  var {\n    config,\n    BigNumber\n  } = _ref0;\n  return config.number === 'BigNumber' ? new BigNumber(1).div(new BigNumber(10).ln()) : Math.LOG10E;\n});\nexport var createSQRT1_2 = /* #__PURE__ */recreateFactory(\n// eslint-disable-line camelcase\n'SQRT1_2', ['config', '?BigNumber'], _ref1 => {\n  var {\n    config,\n    BigNumber\n  } = _ref1;\n  return config.number === 'BigNumber' ? new BigNumber('0.5').sqrt() : Math.SQRT1_2;\n});\nexport var createSQRT2 = /* #__PURE__ */recreateFactory('SQRT2', ['config', '?BigNumber'], _ref10 => {\n  var {\n    config,\n    BigNumber\n  } = _ref10;\n  return config.number === 'BigNumber' ? new BigNumber(2).sqrt() : Math.SQRT2;\n});\nexport var createI = /* #__PURE__ */recreateFactory('i', ['Complex'], _ref11 => {\n  var {\n    Complex\n  } = _ref11;\n  return Complex.I;\n});\n\n// for backward compatibility with v5\nexport var createUppercasePi = /* #__PURE__ */factory('PI', ['pi'], _ref12 => {\n  var {\n    pi\n  } = _ref12;\n  return pi;\n});\nexport var createUppercaseE = /* #__PURE__ */factory('E', ['e'], _ref13 => {\n  var {\n    e\n  } = _ref13;\n  return e;\n});\nexport var createVersion = /* #__PURE__ */factory('version', [], () => version);\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?\nfunction recreateFactory(name, dependencies, create) {\n  return factory(name, dependencies, create, {\n    recreateOnConfigChange: true\n  });\n}", "import { factory } from '../../utils/factory.js';\n\n// Source: https://en.wikipedia.org/wiki/Physical_constant\n\n// Universal constants\nexport var createSpeedOfLight = /* #__PURE__ */unitFactory('speedOfLight', '299792458', 'm s^-1');\nexport var createGravitationConstant = /* #__PURE__ */unitFactory('gravitationConstant', '6.67430e-11', 'm^3 kg^-1 s^-2');\nexport var createPlanckConstant = /* #__PURE__ */unitFactory('planckConstant', '6.62607015e-34', 'J s');\nexport var createReducedPlanckConstant = /* #__PURE__ */unitFactory('reducedPlanckConstant', '1.0545718176461565e-34', 'J s');\n\n// Electromagnetic constants\nexport var createMagneticConstant = /* #__PURE__ */unitFactory('magneticConstant', '1.25663706212e-6', 'N A^-2');\nexport var createElectricConstant = /* #__PURE__ */unitFactory('electricConstant', '8.8541878128e-12', 'F m^-1');\nexport var createVacuumImpedance = /* #__PURE__ */unitFactory('vacuumImpedance', '376.730313667', 'ohm');\nexport var createCoulomb = /* #__PURE__ */unitFactory('coulomb', '8.987551792261171e9', 'N m^2 C^-2'); // Deprecated in favor of coulombConstant\nexport var createCoulombConstant = /* #__PURE__ */unitFactory('coulombConstant', '8.987551792261171e9', 'N m^2 C^-2');\nexport var createElementaryCharge = /* #__PURE__ */unitFactory('elementaryCharge', '1.602176634e-19', 'C');\nexport var createBohrMagneton = /* #__PURE__ */unitFactory('bohrMagneton', '9.2740100783e-24', 'J T^-1');\nexport var createConductanceQuantum = /* #__PURE__ */unitFactory('conductanceQuantum', '7.748091729863649e-5', 'S');\nexport var createInverseConductanceQuantum = /* #__PURE__ */unitFactory('inverseConductanceQuantum', '12906.403729652257', 'ohm');\nexport var createMagneticFluxQuantum = /* #__PURE__ */unitFactory('magneticFluxQuantum', '2.0678338484619295e-15', 'Wb');\nexport var createNuclearMagneton = /* #__PURE__ */unitFactory('nuclearMagneton', '5.0507837461e-27', 'J T^-1');\nexport var createKlitzing = /* #__PURE__ */unitFactory('klitzing', '25812.807459304513', 'ohm');\nexport var createJosephson = /* #__PURE__ */unitFactory('josephson', '4.835978484169836e14 Hz V', 'Hz V^-1'); // TODO: support for Hz needed\n\n// Atomic and nuclear constants\nexport var createBohrRadius = /* #__PURE__ */unitFactory('bohrRadius', '5.29177210903e-11', 'm');\nexport var createClassicalElectronRadius = /* #__PURE__ */unitFactory('classicalElectronRadius', '2.8179403262e-15', 'm');\nexport var createElectronMass = /* #__PURE__ */unitFactory('electronMass', '9.1093837015e-31', 'kg');\nexport var createFermiCoupling = /* #__PURE__ */unitFactory('fermiCoupling', '1.1663787e-5', 'GeV^-2');\nexport var createFineStructure = numberFactory('fineStructure', 7.2973525693e-3);\nexport var createHartreeEnergy = /* #__PURE__ */unitFactory('hartreeEnergy', '4.3597447222071e-18', 'J');\nexport var createProtonMass = /* #__PURE__ */unitFactory('protonMass', '1.67262192369e-27', 'kg');\nexport var createDeuteronMass = /* #__PURE__ */unitFactory('deuteronMass', '3.3435830926e-27', 'kg');\nexport var createNeutronMass = /* #__PURE__ */unitFactory('neutronMass', '1.6749271613e-27', 'kg');\nexport var createQuantumOfCirculation = /* #__PURE__ */unitFactory('quantumOfCirculation', '3.6369475516e-4', 'm^2 s^-1');\nexport var createRydberg = /* #__PURE__ */unitFactory('rydberg', '10973731.568160', 'm^-1');\nexport var createThomsonCrossSection = /* #__PURE__ */unitFactory('thomsonCrossSection', '6.6524587321e-29', 'm^2');\nexport var createWeakMixingAngle = numberFactory('weakMixingAngle', 0.22290);\nexport var createEfimovFactor = numberFactory('efimovFactor', 22.7);\n\n// Physico-chemical constants\nexport var createAtomicMass = /* #__PURE__ */unitFactory('atomicMass', '1.66053906660e-27', 'kg');\nexport var createAvogadro = /* #__PURE__ */unitFactory('avogadro', '6.02214076e23', 'mol^-1');\nexport var createBoltzmann = /* #__PURE__ */unitFactory('boltzmann', '1.380649e-23', 'J K^-1');\nexport var createFaraday = /* #__PURE__ */unitFactory('faraday', '96485.33212331001', 'C mol^-1');\nexport var createFirstRadiation = /* #__PURE__ */unitFactory('firstRadiation', '3.7417718521927573e-16', 'W m^2');\n// TODO spectralRadiance = 1.1910429723971881e-16 W m^2 sr^-1\nexport var createLoschmidt = /* #__PURE__ */unitFactory('loschmidt', '2.686780111798444e25', 'm^-3');\nexport var createGasConstant = /* #__PURE__ */unitFactory('gasConstant', '8.31446261815324', 'J K^-1 mol^-1');\nexport var createMolarPlanckConstant = /* #__PURE__ */unitFactory('molarPlanckConstant', '3.990312712893431e-10', 'J s mol^-1');\nexport var createMolarVolume = /* #__PURE__ */unitFactory('molarVolume', '0.022413969545014137', 'm^3 mol^-1');\nexport var createSackurTetrode = numberFactory('sackurTetrode', -1.16487052358);\nexport var createSecondRadiation = /* #__PURE__ */unitFactory('secondRadiation', '0.014387768775039337', 'm K');\nexport var createStefanBoltzmann = /* #__PURE__ */unitFactory('stefanBoltzmann', '5.67037441918443e-8', 'W m^-2 K^-4');\nexport var createWienDisplacement = /* #__PURE__ */unitFactory('wienDisplacement', '2.897771955e-3', 'm K');\n\n// Adopted values\nexport var createMolarMass = /* #__PURE__ */unitFactory('molarMass', '0.99999999965e-3', 'kg mol^-1');\nexport var createMolarMassC12 = /* #__PURE__ */unitFactory('molarMassC12', '11.9999999958e-3', 'kg mol^-1');\nexport var createGravity = /* #__PURE__ */unitFactory('gravity', '9.80665', 'm s^-2');\n// atm is defined in Unit.js\n\n// Natural units\nexport var createPlanckLength = /* #__PURE__ */unitFactory('planckLength', '1.616255e-35', 'm');\nexport var createPlanckMass = /* #__PURE__ */unitFactory('planckMass', '2.176435e-8', 'kg');\nexport var createPlanckTime = /* #__PURE__ */unitFactory('planckTime', '5.391245e-44', 's');\nexport var createPlanckCharge = /* #__PURE__ */unitFactory('planckCharge', '1.87554603778e-18', 'C');\nexport var 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\nfunction unitFactory(name, valueStr, unitStr) {\n  var dependencies = ['config', 'Unit', 'BigNumber'];\n  return factory(name, dependencies, _ref => {\n    var {\n      config,\n      Unit,\n      BigNumber\n    } = _ref;\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 factory(name, dependencies, _ref2 => {\n    var {\n      config,\n      BigNumber\n    } = _ref2;\n    return config.number === 'BigNumber' ? new BigNumber(value) : value;\n  });\n}", "import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nfunction ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }\nfunction _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }\nimport { errorTransform } from './utils/errorTransform.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMapSlices } from '../../function/matrix/mapSlices.js';\nimport { isBigNumber, isNumber } from '../../utils/is.js';\nvar name = 'mapSlices';\nvar dependencies = ['typed', 'isInteger'];\n\n/**\n * Attach a transform function to math.mapSlices\n * Adds a property transform containing the transform function.\n *\n * This transform changed the last `dim` parameter of function mapSlices\n * from one-based to zero based\n */\nexport var createMapSlicesTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    isInteger\n  } = _ref;\n  var mapSlices = createMapSlices({\n    typed,\n    isInteger\n  });\n\n  // @see: comment of concat itself\n  return typed('mapSlices', {\n    '...any': function any(args) {\n      // change dim from one-based to zero-based\n      var dim = args[1];\n      if (isNumber(dim)) {\n        args[1] = dim - 1;\n      } else if (isBigNumber(dim)) {\n        args[1] = dim.minus(1);\n      }\n      try {\n        return mapSlices.apply(null, args);\n      } catch (err) {\n        throw errorTransform(err);\n      }\n    }\n  });\n}, _objectSpread({\n  isTransformFunction: true\n}, createMapSlices.meta));", "import { errorTransform } from './utils/errorTransform.js';\nimport { factory } from '../../utils/factory.js';\nimport { createColumn } from '../../function/matrix/column.js';\nimport { isNumber } from '../../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 */\nexport var createColumnTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    Index,\n    matrix,\n    range\n  } = _ref;\n  var column = createColumn({\n    typed,\n    Index,\n    matrix,\n    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 (isNumber(last)) {\n        args[lastIndex] = last - 1;\n      }\n      try {\n        return column.apply(null, args);\n      } catch (err) {\n        throw errorTransform(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});", "import { isSymbolNode } from '../../../utils/is.js';\nimport { PartitionedMap } from '../../../utils/map.js';\n\n/**\n * Compile an inline expression like \"x > 0\"\n * @param {Node} expression\n * @param {Object} math\n * @param {Map} scope\n * @return {function} Returns a function with one argument which fills in the\n *                    undefined variable (like \"x\") and evaluates the expression\n */\nexport function compileInlineExpression(expression, math, scope) {\n  // find an undefined symbol\n  var symbol = expression.filter(function (node) {\n    return 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 argsScope = new Map();\n  var subScope = new PartitionedMap(scope, argsScope, new Set([name]));\n  var eq = expression.compile();\n  return function inlineExpression(x) {\n    argsScope.set(name, x);\n    return eq.evaluate(subScope);\n  };\n}", "import { factory } from '../../../utils/factory.js';\nvar name = 'transformCallback';\nvar dependencies = ['typed'];\nexport var createTransformCallback = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\n  /**\n         * Transforms the given callback function based on its type and number of arrays.\n         *\n         * @param {Function} callback - The callback function to transform.\n         * @param {number} numberOfArrays - The number of arrays to pass to the callback function.\n         * @returns {*} - The transformed callback function.\n         */\n  return function (callback, numberOfArrays) {\n    if (typed.isTypedFunction(callback)) {\n      return _transformTypedCallbackFunction(callback, numberOfArrays);\n    } else {\n      return _transformCallbackFunction(callback, callback.length, numberOfArrays);\n    }\n  };\n\n  /**\n       * Transforms the given typed callback function based on the number of arrays.\n       *\n       * @param {Function} typedFunction - The typed callback function to transform.\n       * @param {number} numberOfArrays - The number of arrays to pass to the callback function.\n       * @returns {*} - The transformed callback function.\n       */\n  function _transformTypedCallbackFunction(typedFunction, numberOfArrays) {\n    var signatures = Object.fromEntries(Object.entries(typedFunction.signatures).map(_ref2 => {\n      var [signature, callbackFunction] = _ref2;\n      var numberOfCallbackInputs = signature.split(',').length;\n      if (typed.isTypedFunction(callbackFunction)) {\n        return [signature, _transformTypedCallbackFunction(callbackFunction, numberOfArrays)];\n      } else {\n        return [signature, _transformCallbackFunction(callbackFunction, numberOfCallbackInputs, numberOfArrays)];\n      }\n    }));\n    if (typeof typedFunction.name === 'string') {\n      return typed(typedFunction.name, signatures);\n    } else {\n      return typed(signatures);\n    }\n  }\n});\n\n/**\n     * Transforms the callback function based on the number of callback inputs and arrays.\n     * There are three cases:\n     * 1. The callback function has N arguments.\n     * 2. The callback function has N+1 arguments.\n     * 3. The callback function has 2N+1 arguments.\n     *\n     * @param {Function} callbackFunction - The callback function to transform.\n     * @param {number} numberOfCallbackInputs - The number of callback inputs.\n     * @param {number} numberOfArrays - The number of arrays.\n     * @returns {Function} The transformed callback function.\n     */\nfunction _transformCallbackFunction(callbackFunction, numberOfCallbackInputs, numberOfArrays) {\n  if (numberOfCallbackInputs === numberOfArrays) {\n    return callbackFunction;\n  } else if (numberOfCallbackInputs === numberOfArrays + 1) {\n    return function () {\n      for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n        args[_key] = arguments[_key];\n      }\n      var vals = args.slice(0, numberOfArrays);\n      var idx = _transformDims(args[numberOfArrays]);\n      return callbackFunction(...vals, idx);\n    };\n  } else if (numberOfCallbackInputs > numberOfArrays + 1) {\n    return function () {\n      for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n        args[_key2] = arguments[_key2];\n      }\n      var vals = args.slice(0, numberOfArrays);\n      var idx = _transformDims(args[numberOfArrays]);\n      var rest = args.slice(numberOfArrays + 1);\n      return callbackFunction(...vals, idx, ...rest);\n    };\n  } else {\n    return callbackFunction;\n  }\n}\n\n/**\n   * Transforms the dimensions by adding 1 to each dimension.\n   *\n   * @param {Array} dims - The dimensions to transform.\n   * @returns {Array} The transformed dimensions.\n   */\nfunction _transformDims(dims) {\n  return dims.map(dim => dim + 1);\n}", "import { createFilter } from '../../function/matrix/filter.js';\nimport { factory } from '../../utils/factory.js';\nimport { isFunctionAssignmentNode, isSymbolNode } from '../../utils/is.js';\nimport { compileInlineExpression } from './utils/compileInlineExpression.js';\nimport { createTransformCallback } from './utils/transformCallback.js';\nvar name = 'filter';\nvar dependencies = ['typed'];\nexport var createFilterTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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 filter = createFilter({\n      typed\n    });\n    var transformCallback = createTransformCallback({\n      typed\n    });\n    if (args.length === 0) {\n      return filter();\n    }\n    var x = args[0];\n    if (args.length === 1) {\n      return filter(x);\n    }\n    var N = args.length - 1;\n    var callback = args[N];\n    if (x) {\n      x = _compileAndEvaluate(x, scope);\n    }\n    if (callback) {\n      if (isSymbolNode(callback) || isFunctionAssignmentNode(callback)) {\n        // a function pointer, like filter([3, -2, 5], myTestFunction)\n        callback = _compileAndEvaluate(callback, scope);\n      } else {\n        // an expression like filter([3, -2, 5], x > 0)\n        callback = compileInlineExpression(callback, math, scope);\n      }\n    }\n    return filter(x, transformCallback(callback, N));\n  }\n  filterTransform.rawArgs = true;\n  function _compileAndEvaluate(arg, scope) {\n    return arg.compile().evaluate(scope);\n  }\n  return filterTransform;\n}, {\n  isTransformFunction: true\n});", "import { createForEach } from '../../function/matrix/forEach.js';\nimport { createTransformCallback } from './utils/transformCallback.js';\nimport { factory } from '../../utils/factory.js';\nimport { isFunctionAssignmentNode, isSymbolNode } from '../../utils/is.js';\nimport { compileInlineExpression } from './utils/compileInlineExpression.js';\nvar name = 'forEach';\nvar dependencies = ['typed'];\nexport var createForEachTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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  var forEach = createForEach({\n    typed\n  });\n  var transformCallback = createTransformCallback({\n    typed\n  });\n  function forEachTransform(args, math, scope) {\n    if (args.length === 0) {\n      return forEach();\n    }\n    var x = args[0];\n    if (args.length === 1) {\n      return forEach(x);\n    }\n    var N = args.length - 1;\n    var callback = args[N];\n    if (x) {\n      x = _compileAndEvaluate(x, scope);\n    }\n    if (callback) {\n      if (isSymbolNode(callback) || isFunctionAssignmentNode(callback)) {\n        // a function pointer, like filter([3, -2, 5], myTestFunction)\n        callback = _compileAndEvaluate(callback, scope);\n      } else {\n        // an expression like filter([3, -2, 5], x > 0)\n        callback = compileInlineExpression(callback, math, scope);\n      }\n    }\n    return forEach(x, transformCallback(callback, N));\n  }\n  forEachTransform.rawArgs = true;\n  function _compileAndEvaluate(arg, scope) {\n    return arg.compile().evaluate(scope);\n  }\n  return forEachTransform;\n}, {\n  isTransformFunction: true\n});", "import { isArray, isBigInt, isBigNumber, isMatrix, isNumber, isRange } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'index';\nvar dependencies = ['Index', 'getMatrixDataType'];\nexport var createIndexTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    Index,\n    getMatrixDataType\n  } = _ref;\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, convert BigNumber to number and leave Array of Booleans as is\n      if (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 (isArray(arg) || isMatrix(arg)) {\n        if (getMatrixDataType(arg) !== 'boolean') {\n          arg = arg.map(function (v) {\n            return v - 1;\n          });\n        }\n      } else if (isNumber(arg) || isBigInt(arg)) {\n        arg--;\n      } else if (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, bigint, 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});", "import { factory } from '../../utils/factory.js';\nimport { isFunctionAssignmentNode, isSymbolNode } from '../../utils/is.js';\nimport { createMap } from '../../function/matrix/map.js';\nimport { compileInlineExpression } from './utils/compileInlineExpression.js';\nimport { createTransformCallback } from './utils/transformCallback.js';\nvar name = 'map';\nvar dependencies = ['typed'];\nexport var createMapTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed\n  } = _ref;\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  var map = createMap({\n    typed\n  });\n  var transformCallback = createTransformCallback({\n    typed\n  });\n  function mapTransform(args, math, scope) {\n    if (args.length === 0) {\n      return map();\n    }\n    if (args.length === 1) {\n      return map(args[0]);\n    }\n    var N = args.length - 1;\n    var X = args.slice(0, N);\n    var callback = args[N];\n    X = X.map(arg => _compileAndEvaluate(arg, scope));\n    if (callback) {\n      if (isSymbolNode(callback) || isFunctionAssignmentNode(callback)) {\n        // a function pointer, like filter([3, -2, 5], myTestFunction)\n        callback = _compileAndEvaluate(callback, scope);\n      } else {\n        // an expression like filter([3, -2, 5], x > 0)\n        callback = compileInlineExpression(callback, math, scope);\n      }\n    }\n    return map(...X, transformCallback(callback, N));\n    function _compileAndEvaluate(arg, scope) {\n      return arg.compile().evaluate(scope);\n    }\n  }\n  mapTransform.rawArgs = true;\n  return mapTransform;\n}, {\n  isTransformFunction: true\n});", "import { isNumber, isBigNumber } from '../../../utils/is.js';\n/**\n * Change last argument dim from one-based to zero-based.\n */\nexport function dimToZeroBase(dim) {\n  if (isNumber(dim)) {\n    return dim - 1;\n  } else if (isBigNumber(dim)) {\n    return dim.minus(1);\n  } else {\n    return dim;\n  }\n}\nexport function isNumberOrBigNumber(n) {\n  return isNumber(n) || isBigNumber(n);\n}", "import { isCollection } from '../../../utils/is.js';\nimport { dimToZeroBase, isNumberOrBigNumber } from './dimToZeroBase.js';\n/**\n * Change last argument dim from one-based to zero-based.\n */\nexport function lastDimToZeroBase(args) {\n  if (args.length === 2 && isCollection(args[0])) {\n    args = args.slice();\n    var dim = args[1];\n    if (isNumberOrBigNumber(dim)) {\n      args[1] = dimToZeroBase(dim);\n    }\n  }\n  return args;\n}", "import { factory } from '../../utils/factory.js';\nimport { errorTransform } from './utils/errorTransform.js';\nimport { createMax } from '../../function/statistics/max.js';\nimport { lastDimToZeroBase } from './utils/lastDimToZeroBase.js';\nvar name = 'max';\nvar dependencies = ['typed', 'config', 'numeric', 'larger', 'isNaN'];\nexport var createMaxTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    numeric,\n    larger,\n    isNaN: mathIsNaN\n  } = _ref;\n  var max = createMax({\n    typed,\n    config,\n    numeric,\n    larger,\n    isNaN: mathIsNaN\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 = lastDimToZeroBase(args);\n      try {\n        return max.apply(null, args);\n      } catch (err) {\n        throw errorTransform(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});", "import { factory } from '../../utils/factory.js';\nimport { errorTransform } from './utils/errorTransform.js';\nimport { createMean } from '../../function/statistics/mean.js';\nimport { lastDimToZeroBase } from './utils/lastDimToZeroBase.js';\nvar name = 'mean';\nvar dependencies = ['typed', 'add', 'divide'];\nexport var createMeanTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    add,\n    divide\n  } = _ref;\n  var mean = createMean({\n    typed,\n    add,\n    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 = lastDimToZeroBase(args);\n      try {\n        return mean.apply(null, args);\n      } catch (err) {\n        throw errorTransform(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});", "import { factory } from '../../utils/factory.js';\nimport { errorTransform } from './utils/errorTransform.js';\nimport { createMin } from '../../function/statistics/min.js';\nimport { lastDimToZeroBase } from './utils/lastDimToZeroBase.js';\nvar name = 'min';\nvar dependencies = ['typed', 'config', 'numeric', 'smaller', 'isNaN'];\nexport var createMinTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    numeric,\n    smaller,\n    isNaN: mathIsNaN\n  } = _ref;\n  var min = createMin({\n    typed,\n    config,\n    numeric,\n    smaller,\n    isNaN: mathIsNaN\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 = lastDimToZeroBase(args);\n      try {\n        return min.apply(null, args);\n      } catch (err) {\n        throw errorTransform(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});", "import { factory } from '../../utils/factory.js';\nimport { createRange } from '../../function/matrix/range.js';\nvar name = 'range';\nvar dependencies = ['typed', 'config', '?matrix', '?bignumber', 'equal', 'smaller', 'smallerEq', 'larger', 'largerEq', 'add', 'isZero', 'isPositive'];\nexport var createRangeTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    matrix,\n    bignumber,\n    equal,\n    smaller,\n    smallerEq,\n    larger,\n    largerEq,\n    add,\n    isZero,\n    isPositive\n  } = _ref;\n  var range = createRange({\n    typed,\n    config,\n    matrix,\n    bignumber,\n    equal,\n    smaller,\n    smallerEq,\n    larger,\n    largerEq,\n    add,\n    isZero,\n    isPositive\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});", "import { factory } from '../../utils/factory.js';\nimport { createRow } from '../../function/matrix/row.js';\nimport { errorTransform } from './utils/errorTransform.js';\nimport { isNumber } from '../../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 */\nexport var createRowTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    Index,\n    matrix,\n    range\n  } = _ref;\n  var row = createRow({\n    typed,\n    Index,\n    matrix,\n    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 (isNumber(last)) {\n        args[lastIndex] = last - 1;\n      }\n      try {\n        return row.apply(null, args);\n      } catch (err) {\n        throw errorTransform(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});", "import { factory } from '../../utils/factory.js';\nimport { errorTransform } from './utils/errorTransform.js';\nimport { createSubset } from '../../function/matrix/subset.js';\nvar name = 'subset';\nvar dependencies = ['typed', 'matrix', 'zeros', 'add'];\nexport var createSubsetTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    zeros,\n    add\n  } = _ref;\n  var subset = createSubset({\n    typed,\n    matrix,\n    zeros,\n    add\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 errorTransform(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});", "import { isBigNumber, isNumber } from '../../utils/is.js';\nimport { errorTransform } from './utils/errorTransform.js';\nimport { factory } from '../../utils/factory.js';\nimport { createConcat } from '../../function/matrix/concat.js';\nvar name = 'concat';\nvar dependencies = ['typed', 'matrix', 'isInteger'];\nexport var createConcatTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    isInteger\n  } = _ref;\n  var concat = createConcat({\n    typed,\n    matrix,\n    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 (isNumber(last)) {\n        args[lastIndex] = last - 1;\n      } else if (isBigNumber(last)) {\n        args[lastIndex] = last.minus(1);\n      }\n      try {\n        return concat.apply(null, args);\n      } catch (err) {\n        throw errorTransform(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});", "import { factory } from '../../utils/factory.js';\nimport { errorTransform } from './utils/errorTransform.js';\nimport { createDiff } from '../../function/matrix/diff.js';\nimport { lastDimToZeroBase } from './utils/lastDimToZeroBase.js';\nvar name = 'diff';\nvar dependencies = ['typed', 'matrix', 'subtract', 'number', 'bignumber'];\nexport var createDiffTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    subtract,\n    number,\n    bignumber\n  } = _ref;\n  var diff = createDiff({\n    typed,\n    matrix,\n    subtract,\n    number,\n    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 = lastDimToZeroBase(args);\n      try {\n        return diff.apply(null, args);\n      } catch (err) {\n        throw errorTransform(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});", "import { factory } from '../../utils/factory.js';\nimport { createStd } from '../../function/statistics/std.js';\nimport { errorTransform } from './utils/errorTransform.js';\nimport { lastDimToZeroBase } from './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 */\nexport var createStdTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    map,\n    sqrt,\n    variance\n  } = _ref;\n  var std = createStd({\n    typed,\n    map,\n    sqrt,\n    variance\n  });\n  return typed('std', {\n    '...any': function any(args) {\n      args = lastDimToZeroBase(args);\n      try {\n        return std.apply(null, args);\n      } catch (err) {\n        throw errorTransform(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});", "import { factory } from '../../utils/factory.js';\nimport { errorTransform } from './utils/errorTransform.js';\nimport { createSum } from '../../function/statistics/sum.js';\nimport { lastDimToZeroBase } from './utils/lastDimToZeroBase.js';\n\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'];\nexport var createSumTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    add,\n    numeric\n  } = _ref;\n  var sum = createSum({\n    typed,\n    config,\n    add,\n    numeric\n  });\n  return typed(name, {\n    '...any': function any(args) {\n      args = lastDimToZeroBase(args);\n      try {\n        return sum.apply(null, args);\n      } catch (err) {\n        throw errorTransform(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});", "import { factory } from '../../utils/factory.js';\nimport { createQuantileSeq } from '../../function/statistics/quantileSeq.js';\nimport { lastDimToZeroBase } from './utils/lastDimToZeroBase.js';\nvar name = 'quantileSeq';\nvar dependencies = ['typed', 'bignumber', 'add', 'subtract', 'divide', 'multiply', 'partitionSelect', 'compare', 'isInteger', 'smaller', 'smallerEq', 'larger', 'mapSlices'];\n\n/**\n * Attach a transform function to math.quantileSeq\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 */\nexport var createQuantileSeqTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    bignumber,\n    add,\n    subtract,\n    divide,\n    multiply,\n    partitionSelect,\n    compare,\n    isInteger,\n    smaller,\n    smallerEq,\n    larger,\n    mapSlices\n  } = _ref;\n  var quantileSeq = createQuantileSeq({\n    typed,\n    bignumber,\n    add,\n    subtract,\n    divide,\n    multiply,\n    partitionSelect,\n    compare,\n    isInteger,\n    smaller,\n    smallerEq,\n    larger,\n    mapSlices\n  });\n  return typed('quantileSeq', {\n    'Array | Matrix, number | BigNumber': quantileSeq,\n    'Array | Matrix, number | BigNumber, number': (arr, prob, dim) => quantileSeq(arr, prob, dimToZeroBase(dim)),\n    'Array | Matrix, number | BigNumber, boolean': quantileSeq,\n    'Array | Matrix, number | BigNumber, boolean, number': (arr, prob, sorted, dim) => quantileSeq(arr, prob, sorted, dimToZeroBase(dim)),\n    'Array | Matrix, Array | Matrix': quantileSeq,\n    'Array | Matrix, Array | Matrix, number': (data, prob, dim) => quantileSeq(data, prob, dimToZeroBase(dim)),\n    'Array | Matrix, Array | Matrix, boolean': quantileSeq,\n    'Array | Matrix, Array | Matrix, boolean, number': (data, prob, sorted, dim) => quantileSeq(data, prob, sorted, dimToZeroBase(dim))\n  });\n  function dimToZeroBase(dim) {\n    // TODO: find a better way, maybe lastDimToZeroBase could apply to more cases.\n    return lastDimToZeroBase([[], dim])[1];\n  }\n}, {\n  isTransformFunction: true\n});", "import { isBigNumber, isCollection, isNumber } from '../../utils/is.js';\nimport { factory } from '../../utils/factory.js';\nimport { errorTransform } from './utils/errorTransform.js';\nimport { createCumSum } from '../../function/statistics/cumsum.js';\n\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'];\nexport var createCumSumTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    add,\n    unaryPlus\n  } = _ref;\n  var cumsum = createCumSum({\n    typed,\n    add,\n    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 && isCollection(args[0])) {\n        var dim = args[1];\n        if (isNumber(dim)) {\n          args[1] = dim - 1;\n        } else if (isBigNumber(dim)) {\n          args[1] = dim.minus(1);\n        }\n      }\n      try {\n        return cumsum.apply(null, args);\n      } catch (err) {\n        throw errorTransform(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});", "import { factory } from '../../utils/factory.js';\nimport { errorTransform } from './utils/errorTransform.js';\nimport { createVariance } from '../../function/statistics/variance.js';\nimport { lastDimToZeroBase } from './utils/lastDimToZeroBase.js';\nvar name = 'variance';\nvar dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'mapSlices', '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 */\nexport var createVarianceTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    add,\n    subtract,\n    multiply,\n    divide,\n    mapSlices,\n    isNaN: mathIsNaN\n  } = _ref;\n  var variance = createVariance({\n    typed,\n    add,\n    subtract,\n    multiply,\n    divide,\n    mapSlices,\n    isNaN: mathIsNaN\n  });\n  return typed(name, {\n    '...any': function any(args) {\n      args = lastDimToZeroBase(args);\n      try {\n        return variance.apply(null, args);\n      } catch (err) {\n        throw errorTransform(err);\n      }\n    }\n  });\n}, {\n  isTransformFunction: true\n});", "import { createPrint } from '../../function/string/print.js';\nimport { factory } from '../../utils/factory.js';\nimport { printTemplate } from '../../utils/print.js';\nvar name = 'print';\nvar dependencies = ['typed', 'matrix', 'zeros', 'add'];\nexport var createPrintTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    zeros,\n    add\n  } = _ref;\n  var print = createPrint({\n    typed,\n    matrix,\n    zeros,\n    add\n  });\n  return typed(name, {\n    'string, Object | Array': function string_Object__Array(template, values) {\n      return print(_convertTemplateToZeroBasedIndex(template), values);\n    },\n    'string, Object | Array, number | Object': function string_Object__Array_number__Object(template, values, options) {\n      return print(_convertTemplateToZeroBasedIndex(template), values, options);\n    }\n  });\n  function _convertTemplateToZeroBasedIndex(template) {\n    return template.replace(printTemplate, x => {\n      var parts = x.slice(1).split('.');\n      var result = parts.map(function (part) {\n        if (!isNaN(part) && part.length > 0) {\n          return parseInt(part) - 1;\n        } else {\n          return part;\n        }\n      });\n      return '$' + result.join('.');\n    });\n  }\n}, {\n  isTransformFunction: true\n});", "import { createAnd } from '../../function/logical/and.js';\nimport { factory } from '../../utils/factory.js';\nimport { isCollection } from '../../utils/is.js';\nvar name = 'and';\nvar dependencies = ['typed', 'matrix', 'zeros', 'add', 'equalScalar', 'not', 'concat'];\nexport var createAndTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    zeros,\n    not,\n    concat\n  } = _ref;\n  var and = createAnd({\n    typed,\n    matrix,\n    equalScalar,\n    zeros,\n    not,\n    concat\n  });\n  function andTransform(args, math, scope) {\n    var condition1 = args[0].compile().evaluate(scope);\n    if (!isCollection(condition1) && !and(condition1, true)) {\n      return false;\n    }\n    var condition2 = args[1].compile().evaluate(scope);\n    return and(condition1, condition2);\n  }\n  andTransform.rawArgs = true;\n  return andTransform;\n}, {\n  isTransformFunction: true\n});", "import { createOr } from '../../function/logical/or.js';\nimport { factory } from '../../utils/factory.js';\nimport { isCollection } from '../../utils/is.js';\nvar name = 'or';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix', 'concat'];\nexport var createOrTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    DenseMatrix,\n    concat\n  } = _ref;\n  var or = createOr({\n    typed,\n    matrix,\n    equalScalar,\n    DenseMatrix,\n    concat\n  });\n  function orTransform(args, math, scope) {\n    var condition1 = args[0].compile().evaluate(scope);\n    if (!isCollection(condition1) && or(condition1, false)) {\n      return true;\n    }\n    var condition2 = args[1].compile().evaluate(scope);\n    return or(condition1, condition2);\n  }\n  orTransform.rawArgs = true;\n  return orTransform;\n}, {\n  isTransformFunction: true\n});", "import { createNullish } from '../../function/logical/nullish.js';\nimport { factory } from '../../utils/factory.js';\nimport { isCollection } from '../../utils/is.js';\nvar name = 'nullish';\nvar dependencies = ['typed', 'matrix', 'size', 'flatten', 'deepEqual'];\nexport var createNullishTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    size,\n    flatten,\n    deepEqual\n  } = _ref;\n  var nullish = createNullish({\n    typed,\n    matrix,\n    size,\n    flatten,\n    deepEqual\n  });\n  function nullishTransform(args, math, scope) {\n    var left = args[0].compile().evaluate(scope);\n\n    // If left is not a collection and not nullish, short-circuit and return it\n    if (!isCollection(left) && left != null && left !== undefined) {\n      return left;\n    }\n\n    // Otherwise evaluate right and apply full nullish semantics (incl. element-wise)\n    var right = args[1].compile().evaluate(scope);\n    return nullish(left, right);\n  }\n  nullishTransform.rawArgs = true;\n  return nullishTransform;\n}, {\n  isTransformFunction: true\n});", "import { createBitAnd } from '../../function/bitwise/bitAnd.js';\nimport { factory } from '../../utils/factory.js';\nimport { isCollection } from '../../utils/is.js';\nvar name = 'bitAnd';\nvar dependencies = ['typed', 'matrix', 'zeros', 'add', 'equalScalar', 'not', 'concat'];\nexport var createBitAndTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    zeros,\n    not,\n    concat\n  } = _ref;\n  var bitAnd = createBitAnd({\n    typed,\n    matrix,\n    equalScalar,\n    zeros,\n    not,\n    concat\n  });\n  function bitAndTransform(args, math, scope) {\n    var condition1 = args[0].compile().evaluate(scope);\n    if (!isCollection(condition1)) {\n      if (isNaN(condition1)) {\n        return NaN;\n      }\n      if (condition1 === 0 || condition1 === false) {\n        return 0;\n      }\n    }\n    var condition2 = args[1].compile().evaluate(scope);\n    return bitAnd(condition1, condition2);\n  }\n  bitAndTransform.rawArgs = true;\n  return bitAndTransform;\n}, {\n  isTransformFunction: true\n});", "import { createBitOr } from '../../function/bitwise/bitOr.js';\nimport { factory } from '../../utils/factory.js';\nimport { isCollection } from '../../utils/is.js';\nvar name = 'bitOr';\nvar dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix', 'concat'];\nexport var createBitOrTransform = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    matrix,\n    equalScalar,\n    DenseMatrix,\n    concat\n  } = _ref;\n  var bitOr = createBitOr({\n    typed,\n    matrix,\n    equalScalar,\n    DenseMatrix,\n    concat\n  });\n  function bitOrTransform(args, math, scope) {\n    var condition1 = args[0].compile().evaluate(scope);\n    if (!isCollection(condition1)) {\n      if (isNaN(condition1)) {\n        return NaN;\n      }\n      if (condition1 === -1) {\n        return -1;\n      }\n      if (condition1 === true) {\n        return 1;\n      }\n    }\n    var condition2 = args[1].compile().evaluate(scope);\n    return bitOr(condition1, condition2);\n  }\n  bitOrTransform.rawArgs = true;\n  return bitOrTransform;\n}, {\n  isTransformFunction: true\n});", "/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { config } from './configReadonly.js';\nimport { createBigNumberClass, createComplexClass, createE, createFalse, createFineStructure, createFractionClass, createI, createInfinity, createLN10, createLOG10E, createMatrixClass, createNaN, createNull, createPhi, createRangeClass, createResultSet, createSQRT1_2,\n// eslint-disable-line camelcase\ncreateSackurTetrode, createTau, createTrue, createVersion, createDenseMatrixClass, createEfimovFactor, createLN2, createPi, createReplacer, createSQRT2, createTyped, createWeakMixingAngle, createAbs, createAcos, createAcot, createAcsc, createAddScalar, createArg, createAsech, createAsinh, createAtan, createAtanh, createBigint, createBitNot, createBoolean, createClone, createCombinations, createComplex, createConj, createCos, createCot, createCsc, createCube, createEqualScalar, createErf, createExp, createExpm1, createFilter, createFlatten, createForEach, createFormat, createGetMatrixDataType, createHex, createIm, createIsBounded, createIsNaN, createIsNumeric, createIsPrime, createLOG2E, createLgamma, createLog10, createLog2, createMap, createMode, createMultiplyScalar, createNot, createNumber, createOct, createPickRandom, createPrint, createRandom, createRe, createSec, createSign, createSin, createSize, createSparseMatrixClass, createSplitUnit, createSquare, createString, createSubtractScalar, createTan, createToBest, createTypeOf, createAcosh, createAcsch, createAsec, createBignumber, createCombinationsWithRep, createCosh, createCsch, createDot, createHasNumericValue, createIsFinite, createIsNegative, createIsZero, createMatrix, createMatrixFromFunction, createMultiply, createOnes, createRandomInt, createResize, createSech, createSinh, createSparse, createSqrt, createSqueeze, createTanh, createTranspose, createXgcd, createZeros, createAcoth, createAsin, createBin, createCoth, createCtranspose, createDiag, createEqual, createFraction, createIdentity, createIsInteger, createKron, createMapSlices, createMatrixFromColumns, createNumeric, createProd, createReshape, createRound, createUnaryMinus, createBernoulli, createCbrt, createConcat, createCount, createDeepEqual, createDivideScalar, createDotMultiply, createFloor, createGcd, createIsPositive, createLarger, createLcm, createLeftShift, createLsolve, createMax, createMod, createNthRoot, createNullish, createOr, createQr, createRightArithShift, createSmaller, createSubtract, createTo, createUnaryPlus, createUsolve, createXor, createAdd, createAtan2, createBitAnd, createBitOr, createBitXor, createCatalan, createCompare, createCompareText, createComposition, createCross, createDet, createDiff, createDistance, createDotDivide, createEqualText, createFibonacciHeapClass, createHypot, createImmutableDenseMatrixClass, createIndexClass, createIntersect, createInvmod, createLargerEq, createLog, createLsolveAll, createMatrixFromRows, createMin, createNthRoots, createPartitionSelect, createRightLogShift, createSlu, createSpaClass, createSubset, createSum, createTrace, createUsolveAll, createZpk2tf, createCeil, createCompareNatural, createCumSum, createFix, createIndex, createInv, createLog1p, createLup, createPinv, createPow, createSetCartesian, createSetDistinct, createSetIsSubset, createSetPowerset, createSmallerEq, createSort, createSqrtm, createUnequal, createAnd, createDivide, createExpm, createFft, createFreqz, createGamma, createIfft, createKldivergence, createLusolve, createMean, createMedian, createPolynomialRoot, createQuantileSeq, createRange, createRow, createSetDifference, createSetMultiplicity, createSetSymDifference, createSolveODE, createUnitClass, createVacuumImpedance, createAtomicMass, createBohrMagneton, createBoltzmann, createColumn, createConductanceQuantum, createCoulomb, createCreateUnit, createDeuteronMass, createEigs, createElectronMass, createFactorial, createFermiCoupling, createGasConstant, createGravity, createKlitzing, createLoschmidt, createMad, createMagneticFluxQuantum, createMolarMass, createMolarPlanckConstant, createMultinomial, createNorm, createPermutations, createPlanckConstant, createPlanckMass, createPlanckTime, createReducedPlanckConstant, createRotationMatrix, createRydberg, createSecondRadiation, createSetSize, createSpeedOfLight, createStefanBoltzmann, createThomsonCrossSection, createVariance, createZeta, createAvogadro, createBohrRadius, createCorr, createDotPow, createElementaryCharge, createFaraday, createHartreeEnergy, createInverseConductanceQuantum, createMagneticConstant, createMolarMassC12, createNeutronMass, createPlanckCharge, createPlanckTemperature, createQuantumOfCirculation, createSetIntersect, createStd, createStirlingS2, createUnitFunction, createBellNumbers, createElectricConstant, createFirstRadiation, createNuclearMagneton, createPlanckLength, createRotate, createSetUnion, createWienDisplacement, createClassicalElectronRadius, createMolarVolume, createSchur, createCoulombConstant, createGravitationConstant, createProtonMass, createSylvester, createLyap } from '../factoriesAny.js';\nexport var BigNumber = /* #__PURE__ */createBigNumberClass({\n  config\n});\nexport var Complex = /* #__PURE__ */createComplexClass({});\nexport var e = /* #__PURE__ */createE({\n  BigNumber,\n  config\n});\nexport var _false = /* #__PURE__ */createFalse({});\nexport var fineStructure = /* #__PURE__ */createFineStructure({\n  BigNumber,\n  config\n});\nexport var Fraction = /* #__PURE__ */createFractionClass({});\nexport var i = /* #__PURE__ */createI({\n  Complex\n});\nexport var _Infinity = /* #__PURE__ */createInfinity({\n  BigNumber,\n  config\n});\nexport var LN10 = /* #__PURE__ */createLN10({\n  BigNumber,\n  config\n});\nexport var LOG10E = /* #__PURE__ */createLOG10E({\n  BigNumber,\n  config\n});\nexport var Matrix = /* #__PURE__ */createMatrixClass({});\nexport var _NaN = /* #__PURE__ */createNaN({\n  BigNumber,\n  config\n});\nexport var _null = /* #__PURE__ */createNull({});\nexport var phi = /* #__PURE__ */createPhi({\n  BigNumber,\n  config\n});\nexport var Range = /* #__PURE__ */createRangeClass({});\nexport var ResultSet = /* #__PURE__ */createResultSet({});\nexport var SQRT1_2 = /* #__PURE__ */createSQRT1_2({\n  BigNumber,\n  config\n});\nexport var sackurTetrode = /* #__PURE__ */createSackurTetrode({\n  BigNumber,\n  config\n});\nexport var tau = /* #__PURE__ */createTau({\n  BigNumber,\n  config\n});\nexport var _true = /* #__PURE__ */createTrue({});\nexport var version = /* #__PURE__ */createVersion({});\nexport var DenseMatrix = /* #__PURE__ */createDenseMatrixClass({\n  Matrix,\n  config\n});\nexport var efimovFactor = /* #__PURE__ */createEfimovFactor({\n  BigNumber,\n  config\n});\nexport var LN2 = /* #__PURE__ */createLN2({\n  BigNumber,\n  config\n});\nexport var pi = /* #__PURE__ */createPi({\n  BigNumber,\n  config\n});\nexport var replacer = /* #__PURE__ */createReplacer({});\nexport var SQRT2 = /* #__PURE__ */createSQRT2({\n  BigNumber,\n  config\n});\nexport var typed = /* #__PURE__ */createTyped({\n  BigNumber,\n  Complex,\n  DenseMatrix,\n  Fraction\n});\nexport var weakMixingAngle = /* #__PURE__ */createWeakMixingAngle({\n  BigNumber,\n  config\n});\nexport var abs = /* #__PURE__ */createAbs({\n  typed\n});\nexport var acos = /* #__PURE__ */createAcos({\n  Complex,\n  config,\n  typed\n});\nexport var acot = /* #__PURE__ */createAcot({\n  BigNumber,\n  typed\n});\nexport var acsc = /* #__PURE__ */createAcsc({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var addScalar = /* #__PURE__ */createAddScalar({\n  typed\n});\nexport var arg = /* #__PURE__ */createArg({\n  typed\n});\nexport var asech = /* #__PURE__ */createAsech({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var asinh = /* #__PURE__ */createAsinh({\n  typed\n});\nexport var atan = /* #__PURE__ */createAtan({\n  typed\n});\nexport var atanh = /* #__PURE__ */createAtanh({\n  Complex,\n  config,\n  typed\n});\nexport var bigint = /* #__PURE__ */createBigint({\n  typed\n});\nexport var bitNot = /* #__PURE__ */createBitNot({\n  typed\n});\nexport var boolean = /* #__PURE__ */createBoolean({\n  typed\n});\nexport var clone = /* #__PURE__ */createClone({\n  typed\n});\nexport var combinations = /* #__PURE__ */createCombinations({\n  typed\n});\nexport var complex = /* #__PURE__ */createComplex({\n  Complex,\n  typed\n});\nexport var conj = /* #__PURE__ */createConj({\n  typed\n});\nexport var cos = /* #__PURE__ */createCos({\n  typed\n});\nexport var cot = /* #__PURE__ */createCot({\n  BigNumber,\n  typed\n});\nexport var csc = /* #__PURE__ */createCsc({\n  BigNumber,\n  typed\n});\nexport var cube = /* #__PURE__ */createCube({\n  typed\n});\nexport var equalScalar = /* #__PURE__ */createEqualScalar({\n  config,\n  typed\n});\nexport var erf = /* #__PURE__ */createErf({\n  typed\n});\nexport var exp = /* #__PURE__ */createExp({\n  typed\n});\nexport var expm1 = /* #__PURE__ */createExpm1({\n  Complex,\n  typed\n});\nexport var filter = /* #__PURE__ */createFilter({\n  typed\n});\nexport var flatten = /* #__PURE__ */createFlatten({\n  typed\n});\nexport var forEach = /* #__PURE__ */createForEach({\n  typed\n});\nexport var format = /* #__PURE__ */createFormat({\n  typed\n});\nexport var getMatrixDataType = /* #__PURE__ */createGetMatrixDataType({\n  typed\n});\nexport var hex = /* #__PURE__ */createHex({\n  format,\n  typed\n});\nexport var im = /* #__PURE__ */createIm({\n  typed\n});\nexport var isBounded = /* #__PURE__ */createIsBounded({\n  typed\n});\nexport var isNaN = /* #__PURE__ */createIsNaN({\n  typed\n});\nexport var isNumeric = /* #__PURE__ */createIsNumeric({\n  typed\n});\nexport var isPrime = /* #__PURE__ */createIsPrime({\n  typed\n});\nexport var LOG2E = /* #__PURE__ */createLOG2E({\n  BigNumber,\n  config\n});\nexport var lgamma = /* #__PURE__ */createLgamma({\n  Complex,\n  typed\n});\nexport var log10 = /* #__PURE__ */createLog10({\n  Complex,\n  config,\n  typed\n});\nexport var log2 = /* #__PURE__ */createLog2({\n  Complex,\n  config,\n  typed\n});\nexport var map = /* #__PURE__ */createMap({\n  typed\n});\nexport var mode = /* #__PURE__ */createMode({\n  isNaN,\n  isNumeric,\n  typed\n});\nexport var multiplyScalar = /* #__PURE__ */createMultiplyScalar({\n  typed\n});\nexport var not = /* #__PURE__ */createNot({\n  typed\n});\nexport var number = /* #__PURE__ */createNumber({\n  typed\n});\nexport var oct = /* #__PURE__ */createOct({\n  format,\n  typed\n});\nexport var pickRandom = /* #__PURE__ */createPickRandom({\n  config,\n  typed\n});\nexport var print = /* #__PURE__ */createPrint({\n  typed\n});\nexport var random = /* #__PURE__ */createRandom({\n  config,\n  typed\n});\nexport var re = /* #__PURE__ */createRe({\n  typed\n});\nexport var sec = /* #__PURE__ */createSec({\n  BigNumber,\n  typed\n});\nexport var sign = /* #__PURE__ */createSign({\n  BigNumber,\n  Fraction,\n  complex,\n  typed\n});\nexport var sin = /* #__PURE__ */createSin({\n  typed\n});\nexport var size = /* #__PURE__ */createSize({\n  typed\n});\nexport var SparseMatrix = /* #__PURE__ */createSparseMatrixClass({\n  Matrix,\n  equalScalar,\n  typed\n});\nexport var splitUnit = /* #__PURE__ */createSplitUnit({\n  typed\n});\nexport var square = /* #__PURE__ */createSquare({\n  typed\n});\nexport var string = /* #__PURE__ */createString({\n  typed\n});\nexport var subtractScalar = /* #__PURE__ */createSubtractScalar({\n  typed\n});\nexport var tan = /* #__PURE__ */createTan({\n  typed\n});\nexport var toBest = /* #__PURE__ */createToBest({\n  typed\n});\nexport var typeOf = /* #__PURE__ */createTypeOf({\n  typed\n});\nexport var acosh = /* #__PURE__ */createAcosh({\n  Complex,\n  config,\n  typed\n});\nexport var acsch = /* #__PURE__ */createAcsch({\n  BigNumber,\n  typed\n});\nexport var asec = /* #__PURE__ */createAsec({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var bignumber = /* #__PURE__ */createBignumber({\n  BigNumber,\n  typed\n});\nexport var combinationsWithRep = /* #__PURE__ */createCombinationsWithRep({\n  typed\n});\nexport var cosh = /* #__PURE__ */createCosh({\n  typed\n});\nexport var csch = /* #__PURE__ */createCsch({\n  BigNumber,\n  typed\n});\nexport var dot = /* #__PURE__ */createDot({\n  addScalar,\n  conj,\n  multiplyScalar,\n  size,\n  typed\n});\nexport var hasNumericValue = /* #__PURE__ */createHasNumericValue({\n  isNumeric,\n  typed\n});\nexport var isFinite = /* #__PURE__ */createIsFinite({\n  isBounded,\n  map,\n  typed\n});\nexport var isNegative = /* #__PURE__ */createIsNegative({\n  config,\n  typed\n});\nexport var isZero = /* #__PURE__ */createIsZero({\n  equalScalar,\n  typed\n});\nexport var matrix = /* #__PURE__ */createMatrix({\n  DenseMatrix,\n  Matrix,\n  SparseMatrix,\n  typed\n});\nexport var matrixFromFunction = /* #__PURE__ */createMatrixFromFunction({\n  isZero,\n  matrix,\n  typed\n});\nexport var multiply = /* #__PURE__ */createMultiply({\n  addScalar,\n  dot,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  typed\n});\nexport var ones = /* #__PURE__ */createOnes({\n  BigNumber,\n  config,\n  matrix,\n  typed\n});\nexport var randomInt = /* #__PURE__ */createRandomInt({\n  config,\n  log2,\n  typed\n});\nexport var resize = /* #__PURE__ */createResize({\n  config,\n  matrix\n});\nexport var sech = /* #__PURE__ */createSech({\n  BigNumber,\n  typed\n});\nexport var sinh = /* #__PURE__ */createSinh({\n  typed\n});\nexport var sparse = /* #__PURE__ */createSparse({\n  SparseMatrix,\n  typed\n});\nexport var sqrt = /* #__PURE__ */createSqrt({\n  Complex,\n  config,\n  typed\n});\nexport var squeeze = /* #__PURE__ */createSqueeze({\n  typed\n});\nexport var tanh = /* #__PURE__ */createTanh({\n  typed\n});\nexport var transpose = /* #__PURE__ */createTranspose({\n  matrix,\n  typed\n});\nexport var xgcd = /* #__PURE__ */createXgcd({\n  BigNumber,\n  config,\n  matrix,\n  typed\n});\nexport var zeros = /* #__PURE__ */createZeros({\n  BigNumber,\n  config,\n  matrix,\n  typed\n});\nexport var acoth = /* #__PURE__ */createAcoth({\n  BigNumber,\n  Complex,\n  config,\n  typed\n});\nexport var asin = /* #__PURE__ */createAsin({\n  Complex,\n  config,\n  typed\n});\nexport var bin = /* #__PURE__ */createBin({\n  format,\n  typed\n});\nexport var coth = /* #__PURE__ */createCoth({\n  BigNumber,\n  typed\n});\nexport var ctranspose = /* #__PURE__ */createCtranspose({\n  conj,\n  transpose,\n  typed\n});\nexport var diag = /* #__PURE__ */createDiag({\n  DenseMatrix,\n  SparseMatrix,\n  matrix,\n  typed\n});\nexport var equal = /* #__PURE__ */createEqual({\n  DenseMatrix,\n  SparseMatrix,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var fraction = /* #__PURE__ */createFraction({\n  Fraction,\n  typed\n});\nexport var identity = /* #__PURE__ */createIdentity({\n  BigNumber,\n  DenseMatrix,\n  SparseMatrix,\n  config,\n  matrix,\n  typed\n});\nexport var isInteger = /* #__PURE__ */createIsInteger({\n  equal,\n  typed\n});\nexport var kron = /* #__PURE__ */createKron({\n  matrix,\n  multiplyScalar,\n  typed\n});\nexport var mapSlices = /* #__PURE__ */createMapSlices({\n  isInteger,\n  typed\n});\nexport var apply = mapSlices;\nexport var matrixFromColumns = /* #__PURE__ */createMatrixFromColumns({\n  flatten,\n  matrix,\n  size,\n  typed\n});\nexport var numeric = /* #__PURE__ */createNumeric({\n  bignumber,\n  fraction,\n  number\n});\nexport var prod = /* #__PURE__ */createProd({\n  config,\n  multiplyScalar,\n  numeric,\n  typed\n});\nexport var reshape = /* #__PURE__ */createReshape({\n  isInteger,\n  matrix,\n  typed\n});\nexport var round = /* #__PURE__ */createRound({\n  BigNumber,\n  DenseMatrix,\n  config,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var unaryMinus = /* #__PURE__ */createUnaryMinus({\n  typed\n});\nexport var bernoulli = /* #__PURE__ */createBernoulli({\n  BigNumber,\n  Fraction,\n  config,\n  isInteger,\n  number,\n  typed\n});\nexport var cbrt = /* #__PURE__ */createCbrt({\n  BigNumber,\n  Complex,\n  Fraction,\n  config,\n  isNegative,\n  matrix,\n  typed,\n  unaryMinus\n});\nexport var concat = /* #__PURE__ */createConcat({\n  isInteger,\n  matrix,\n  typed\n});\nexport var count = /* #__PURE__ */createCount({\n  prod,\n  size,\n  typed\n});\nexport var deepEqual = /* #__PURE__ */createDeepEqual({\n  equal,\n  typed\n});\nexport var divideScalar = /* #__PURE__ */createDivideScalar({\n  numeric,\n  typed\n});\nexport var dotMultiply = /* #__PURE__ */createDotMultiply({\n  concat,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  typed\n});\nexport var floor = /* #__PURE__ */createFloor({\n  DenseMatrix,\n  config,\n  equalScalar,\n  matrix,\n  round,\n  typed,\n  zeros\n});\nexport var gcd = /* #__PURE__ */createGcd({\n  BigNumber,\n  DenseMatrix,\n  concat,\n  config,\n  equalScalar,\n  matrix,\n  round,\n  typed,\n  zeros\n});\nexport var isPositive = /* #__PURE__ */createIsPositive({\n  config,\n  typed\n});\nexport var larger = /* #__PURE__ */createLarger({\n  DenseMatrix,\n  SparseMatrix,\n  bignumber,\n  concat,\n  config,\n  matrix,\n  typed\n});\nexport var lcm = /* #__PURE__ */createLcm({\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var leftShift = /* #__PURE__ */createLeftShift({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var lsolve = /* #__PURE__ */createLsolve({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtractScalar,\n  typed\n});\nexport var max = /* #__PURE__ */createMax({\n  config,\n  isNaN,\n  larger,\n  numeric,\n  typed\n});\nexport var mod = /* #__PURE__ */createMod({\n  DenseMatrix,\n  concat,\n  config,\n  equalScalar,\n  matrix,\n  round,\n  typed,\n  zeros\n});\nexport var nthRoot = /* #__PURE__ */createNthRoot({\n  BigNumber,\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var nullish = /* #__PURE__ */createNullish({\n  deepEqual,\n  flatten,\n  matrix,\n  size,\n  typed\n});\nexport var or = /* #__PURE__ */createOr({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var qr = /* #__PURE__ */createQr({\n  addScalar,\n  complex,\n  conj,\n  divideScalar,\n  equal,\n  identity,\n  isZero,\n  matrix,\n  multiplyScalar,\n  sign,\n  sqrt,\n  subtractScalar,\n  typed,\n  unaryMinus,\n  zeros\n});\nexport var rightArithShift = /* #__PURE__ */createRightArithShift({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var smaller = /* #__PURE__ */createSmaller({\n  DenseMatrix,\n  SparseMatrix,\n  bignumber,\n  concat,\n  config,\n  matrix,\n  typed\n});\nexport var subtract = /* #__PURE__ */createSubtract({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  subtractScalar,\n  typed,\n  unaryMinus\n});\nexport var to = /* #__PURE__ */createTo({\n  concat,\n  matrix,\n  typed\n});\nexport var unaryPlus = /* #__PURE__ */createUnaryPlus({\n  config,\n  numeric,\n  typed\n});\nexport var usolve = /* #__PURE__ */createUsolve({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtractScalar,\n  typed\n});\nexport var xor = /* #__PURE__ */createXor({\n  DenseMatrix,\n  SparseMatrix,\n  concat,\n  matrix,\n  typed\n});\nexport var add = /* #__PURE__ */createAdd({\n  DenseMatrix,\n  SparseMatrix,\n  addScalar,\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var atan2 = /* #__PURE__ */createAtan2({\n  BigNumber,\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var bitAnd = /* #__PURE__ */createBitAnd({\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var bitOr = /* #__PURE__ */createBitOr({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var bitXor = /* #__PURE__ */createBitXor({\n  DenseMatrix,\n  SparseMatrix,\n  concat,\n  matrix,\n  typed\n});\nexport var catalan = /* #__PURE__ */createCatalan({\n  addScalar,\n  combinations,\n  divideScalar,\n  isInteger,\n  isNegative,\n  multiplyScalar,\n  typed\n});\nexport var compare = /* #__PURE__ */createCompare({\n  BigNumber,\n  DenseMatrix,\n  Fraction,\n  concat,\n  config,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var compareText = /* #__PURE__ */createCompareText({\n  concat,\n  matrix,\n  typed\n});\nexport var composition = /* #__PURE__ */createComposition({\n  addScalar,\n  combinations,\n  isInteger,\n  isNegative,\n  isPositive,\n  larger,\n  typed\n});\nexport var cross = /* #__PURE__ */createCross({\n  matrix,\n  multiply,\n  subtract,\n  typed\n});\nexport var det = /* #__PURE__ */createDet({\n  divideScalar,\n  isZero,\n  matrix,\n  multiply,\n  subtractScalar,\n  typed,\n  unaryMinus\n});\nexport var diff = /* #__PURE__ */createDiff({\n  matrix,\n  number,\n  subtract,\n  typed\n});\nexport var distance = /* #__PURE__ */createDistance({\n  abs,\n  addScalar,\n  deepEqual,\n  divideScalar,\n  multiplyScalar,\n  sqrt,\n  subtractScalar,\n  typed\n});\nexport var dotDivide = /* #__PURE__ */createDotDivide({\n  DenseMatrix,\n  SparseMatrix,\n  concat,\n  divideScalar,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var equalText = /* #__PURE__ */createEqualText({\n  compareText,\n  isZero,\n  typed\n});\nexport var FibonacciHeap = /* #__PURE__ */createFibonacciHeapClass({\n  larger,\n  smaller\n});\nexport var hypot = /* #__PURE__ */createHypot({\n  abs,\n  addScalar,\n  divideScalar,\n  isPositive,\n  multiplyScalar,\n  smaller,\n  sqrt,\n  typed\n});\nexport var ImmutableDenseMatrix = /* #__PURE__ */createImmutableDenseMatrixClass({\n  DenseMatrix,\n  smaller\n});\nexport var Index = /* #__PURE__ */createIndexClass({\n  ImmutableDenseMatrix,\n  getMatrixDataType\n});\nexport var intersect = /* #__PURE__ */createIntersect({\n  abs,\n  add,\n  addScalar,\n  config,\n  divideScalar,\n  equalScalar,\n  flatten,\n  isNumeric,\n  isZero,\n  matrix,\n  multiply,\n  multiplyScalar,\n  smaller,\n  subtract,\n  typed\n});\nexport var invmod = /* #__PURE__ */createInvmod({\n  BigNumber,\n  add,\n  config,\n  equal,\n  isInteger,\n  mod,\n  smaller,\n  typed,\n  xgcd\n});\nexport var largerEq = /* #__PURE__ */createLargerEq({\n  DenseMatrix,\n  SparseMatrix,\n  concat,\n  config,\n  matrix,\n  typed\n});\nexport var log = /* #__PURE__ */createLog({\n  Complex,\n  config,\n  divideScalar,\n  typeOf,\n  typed\n});\nexport var lsolveAll = /* #__PURE__ */createLsolveAll({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtractScalar,\n  typed\n});\nexport var matrixFromRows = /* #__PURE__ */createMatrixFromRows({\n  flatten,\n  matrix,\n  size,\n  typed\n});\nexport var min = /* #__PURE__ */createMin({\n  config,\n  isNaN,\n  numeric,\n  smaller,\n  typed\n});\nexport var nthRoots = /* #__PURE__ */createNthRoots({\n  Complex,\n  config,\n  divideScalar,\n  typed\n});\nexport var partitionSelect = /* #__PURE__ */createPartitionSelect({\n  compare,\n  isNaN,\n  isNumeric,\n  typed\n});\nexport var rightLogShift = /* #__PURE__ */createRightLogShift({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var slu = /* #__PURE__ */createSlu({\n  SparseMatrix,\n  abs,\n  add,\n  divideScalar,\n  larger,\n  largerEq,\n  multiply,\n  subtract,\n  transpose,\n  typed\n});\nexport var Spa = /* #__PURE__ */createSpaClass({\n  FibonacciHeap,\n  addScalar,\n  equalScalar\n});\nexport var subset = /* #__PURE__ */createSubset({\n  add,\n  matrix,\n  typed,\n  zeros\n});\nexport var sum = /* #__PURE__ */createSum({\n  add,\n  config,\n  numeric,\n  typed\n});\nexport var trace = /* #__PURE__ */createTrace({\n  add,\n  matrix,\n  typed\n});\nexport var usolveAll = /* #__PURE__ */createUsolveAll({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtractScalar,\n  typed\n});\nexport var zpk2tf = /* #__PURE__ */createZpk2tf({\n  Complex,\n  add,\n  multiply,\n  number,\n  typed\n});\nexport var ceil = /* #__PURE__ */createCeil({\n  DenseMatrix,\n  config,\n  equalScalar,\n  matrix,\n  round,\n  typed,\n  zeros\n});\nexport var compareNatural = /* #__PURE__ */createCompareNatural({\n  compare,\n  typed\n});\nexport var cumsum = /* #__PURE__ */createCumSum({\n  add,\n  typed,\n  unaryPlus\n});\nexport var fix = /* #__PURE__ */createFix({\n  Complex,\n  DenseMatrix,\n  ceil,\n  equalScalar,\n  floor,\n  matrix,\n  typed,\n  zeros\n});\nexport var index = /* #__PURE__ */createIndex({\n  Index,\n  typed\n});\nexport var inv = /* #__PURE__ */createInv({\n  abs,\n  addScalar,\n  det,\n  divideScalar,\n  identity,\n  matrix,\n  multiply,\n  typed,\n  unaryMinus\n});\nexport var log1p = /* #__PURE__ */createLog1p({\n  Complex,\n  config,\n  divideScalar,\n  log,\n  typed\n});\nexport var lup = /* #__PURE__ */createLup({\n  DenseMatrix,\n  Spa,\n  SparseMatrix,\n  abs,\n  addScalar,\n  divideScalar,\n  equalScalar,\n  larger,\n  matrix,\n  multiplyScalar,\n  subtractScalar,\n  typed,\n  unaryMinus\n});\nexport var pinv = /* #__PURE__ */createPinv({\n  Complex,\n  add,\n  ctranspose,\n  deepEqual,\n  divideScalar,\n  dot,\n  dotDivide,\n  equal,\n  inv,\n  matrix,\n  multiply,\n  typed\n});\nexport var pow = /* #__PURE__ */createPow({\n  Complex,\n  config,\n  fraction,\n  identity,\n  inv,\n  matrix,\n  multiply,\n  number,\n  typed\n});\nexport var setCartesian = /* #__PURE__ */createSetCartesian({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setDistinct = /* #__PURE__ */createSetDistinct({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setIsSubset = /* #__PURE__ */createSetIsSubset({\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setPowerset = /* #__PURE__ */createSetPowerset({\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var smallerEq = /* #__PURE__ */createSmallerEq({\n  DenseMatrix,\n  SparseMatrix,\n  concat,\n  config,\n  matrix,\n  typed\n});\nexport var sort = /* #__PURE__ */createSort({\n  compare,\n  compareNatural,\n  matrix,\n  typed\n});\nexport var sqrtm = /* #__PURE__ */createSqrtm({\n  abs,\n  add,\n  identity,\n  inv,\n  map,\n  max,\n  multiply,\n  size,\n  sqrt,\n  subtract,\n  typed\n});\nexport var unequal = /* #__PURE__ */createUnequal({\n  DenseMatrix,\n  SparseMatrix,\n  concat,\n  config,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var and = /* #__PURE__ */createAnd({\n  concat,\n  equalScalar,\n  matrix,\n  not,\n  typed,\n  zeros\n});\nexport var divide = /* #__PURE__ */createDivide({\n  divideScalar,\n  equalScalar,\n  inv,\n  matrix,\n  multiply,\n  typed\n});\nexport var expm = /* #__PURE__ */createExpm({\n  abs,\n  add,\n  identity,\n  inv,\n  multiply,\n  typed\n});\nexport var fft = /* #__PURE__ */createFft({\n  addScalar,\n  ceil,\n  conj,\n  divideScalar,\n  dotDivide,\n  exp,\n  i,\n  log2,\n  matrix,\n  multiplyScalar,\n  pow,\n  tau,\n  typed\n});\nexport var freqz = /* #__PURE__ */createFreqz({\n  Complex,\n  add,\n  divide,\n  matrix,\n  multiply,\n  typed\n});\nexport var gamma = /* #__PURE__ */createGamma({\n  BigNumber,\n  Complex,\n  config,\n  multiplyScalar,\n  pow,\n  typed\n});\nexport var ifft = /* #__PURE__ */createIfft({\n  conj,\n  dotDivide,\n  fft,\n  typed\n});\nexport var kldivergence = /* #__PURE__ */createKldivergence({\n  divide,\n  dotDivide,\n  isNumeric,\n  log,\n  map,\n  matrix,\n  multiply,\n  sum,\n  typed\n});\nexport var lusolve = /* #__PURE__ */createLusolve({\n  DenseMatrix,\n  lsolve,\n  lup,\n  matrix,\n  slu,\n  typed,\n  usolve\n});\nexport var mean = /* #__PURE__ */createMean({\n  add,\n  divide,\n  typed\n});\nexport var median = /* #__PURE__ */createMedian({\n  add,\n  compare,\n  divide,\n  partitionSelect,\n  typed\n});\nexport var polynomialRoot = /* #__PURE__ */createPolynomialRoot({\n  add,\n  cbrt,\n  divide,\n  equalScalar,\n  im,\n  isZero,\n  multiply,\n  re,\n  sqrt,\n  subtract,\n  typeOf,\n  typed,\n  unaryMinus\n});\nexport var quantileSeq = /* #__PURE__ */createQuantileSeq({\n  bignumber,\n  add,\n  compare,\n  divide,\n  isInteger,\n  larger,\n  mapSlices,\n  multiply,\n  partitionSelect,\n  smaller,\n  smallerEq,\n  subtract,\n  typed\n});\nexport var range = /* #__PURE__ */createRange({\n  bignumber,\n  matrix,\n  add,\n  config,\n  equal,\n  isPositive,\n  isZero,\n  larger,\n  largerEq,\n  smaller,\n  smallerEq,\n  typed\n});\nexport var row = /* #__PURE__ */createRow({\n  Index,\n  matrix,\n  range,\n  typed\n});\nexport var setDifference = /* #__PURE__ */createSetDifference({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setMultiplicity = /* #__PURE__ */createSetMultiplicity({\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var setSymDifference = /* #__PURE__ */createSetSymDifference({\n  Index,\n  concat,\n  setDifference,\n  size,\n  subset,\n  typed\n});\nexport var solveODE = /* #__PURE__ */createSolveODE({\n  abs,\n  add,\n  bignumber,\n  divide,\n  isNegative,\n  isPositive,\n  larger,\n  map,\n  matrix,\n  max,\n  multiply,\n  smaller,\n  subtract,\n  typed,\n  unaryMinus\n});\nexport var Unit = /* #__PURE__ */createUnitClass({\n  BigNumber,\n  Complex,\n  Fraction,\n  abs,\n  addScalar,\n  config,\n  divideScalar,\n  equal,\n  fix,\n  format,\n  isNumeric,\n  multiplyScalar,\n  number,\n  pow,\n  round,\n  subtractScalar\n});\nexport var vacuumImpedance = /* #__PURE__ */createVacuumImpedance({\n  BigNumber,\n  Unit,\n  config\n});\nexport var atomicMass = /* #__PURE__ */createAtomicMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var bohrMagneton = /* #__PURE__ */createBohrMagneton({\n  BigNumber,\n  Unit,\n  config\n});\nexport var boltzmann = /* #__PURE__ */createBoltzmann({\n  BigNumber,\n  Unit,\n  config\n});\nexport var column = /* #__PURE__ */createColumn({\n  Index,\n  matrix,\n  range,\n  typed\n});\nexport var conductanceQuantum = /* #__PURE__ */createConductanceQuantum({\n  BigNumber,\n  Unit,\n  config\n});\nexport var coulomb = /* #__PURE__ */createCoulomb({\n  BigNumber,\n  Unit,\n  config\n});\nexport var createUnit = /* #__PURE__ */createCreateUnit({\n  Unit,\n  typed\n});\nexport var deuteronMass = /* #__PURE__ */createDeuteronMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var eigs = /* #__PURE__ */createEigs({\n  abs,\n  add,\n  addScalar,\n  atan,\n  bignumber,\n  column,\n  complex,\n  config,\n  cos,\n  diag,\n  divideScalar,\n  dot,\n  equal,\n  flatten,\n  im,\n  inv,\n  larger,\n  matrix,\n  matrixFromColumns,\n  multiply,\n  multiplyScalar,\n  number,\n  qr,\n  re,\n  reshape,\n  sin,\n  size,\n  smaller,\n  sqrt,\n  subtract,\n  typed,\n  usolve,\n  usolveAll\n});\nexport var electronMass = /* #__PURE__ */createElectronMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var factorial = /* #__PURE__ */createFactorial({\n  gamma,\n  typed\n});\nexport var fermiCoupling = /* #__PURE__ */createFermiCoupling({\n  BigNumber,\n  Unit,\n  config\n});\nexport var gasConstant = /* #__PURE__ */createGasConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var gravity = /* #__PURE__ */createGravity({\n  BigNumber,\n  Unit,\n  config\n});\nexport var klitzing = /* #__PURE__ */createKlitzing({\n  BigNumber,\n  Unit,\n  config\n});\nexport var loschmidt = /* #__PURE__ */createLoschmidt({\n  BigNumber,\n  Unit,\n  config\n});\nexport var mad = /* #__PURE__ */createMad({\n  abs,\n  map,\n  median,\n  subtract,\n  typed\n});\nexport var magneticFluxQuantum = /* #__PURE__ */createMagneticFluxQuantum({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarMass = /* #__PURE__ */createMolarMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarPlanckConstant = /* #__PURE__ */createMolarPlanckConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var multinomial = /* #__PURE__ */createMultinomial({\n  add,\n  divide,\n  factorial,\n  isInteger,\n  isPositive,\n  multiply,\n  typed\n});\nexport var norm = /* #__PURE__ */createNorm({\n  abs,\n  add,\n  conj,\n  ctranspose,\n  eigs,\n  equalScalar,\n  larger,\n  matrix,\n  multiply,\n  pow,\n  smaller,\n  sqrt,\n  typed\n});\nexport var permutations = /* #__PURE__ */createPermutations({\n  factorial,\n  typed\n});\nexport var planckConstant = /* #__PURE__ */createPlanckConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckMass = /* #__PURE__ */createPlanckMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckTime = /* #__PURE__ */createPlanckTime({\n  BigNumber,\n  Unit,\n  config\n});\nexport var reducedPlanckConstant = /* #__PURE__ */createReducedPlanckConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var rotationMatrix = /* #__PURE__ */createRotationMatrix({\n  BigNumber,\n  DenseMatrix,\n  SparseMatrix,\n  addScalar,\n  config,\n  cos,\n  matrix,\n  multiplyScalar,\n  norm,\n  sin,\n  typed,\n  unaryMinus\n});\nexport var rydberg = /* #__PURE__ */createRydberg({\n  BigNumber,\n  Unit,\n  config\n});\nexport var secondRadiation = /* #__PURE__ */createSecondRadiation({\n  BigNumber,\n  Unit,\n  config\n});\nexport var setSize = /* #__PURE__ */createSetSize({\n  compareNatural,\n  typed\n});\nexport var speedOfLight = /* #__PURE__ */createSpeedOfLight({\n  BigNumber,\n  Unit,\n  config\n});\nexport var stefanBoltzmann = /* #__PURE__ */createStefanBoltzmann({\n  BigNumber,\n  Unit,\n  config\n});\nexport var thomsonCrossSection = /* #__PURE__ */createThomsonCrossSection({\n  BigNumber,\n  Unit,\n  config\n});\nexport var variance = /* #__PURE__ */createVariance({\n  add,\n  divide,\n  isNaN,\n  mapSlices,\n  multiply,\n  subtract,\n  typed\n});\nexport var zeta = /* #__PURE__ */createZeta({\n  BigNumber,\n  Complex,\n  add,\n  config,\n  divide,\n  equal,\n  factorial,\n  gamma,\n  isBounded,\n  isNegative,\n  multiply,\n  pi,\n  pow,\n  sin,\n  smallerEq,\n  subtract,\n  typed\n});\nexport var avogadro = /* #__PURE__ */createAvogadro({\n  BigNumber,\n  Unit,\n  config\n});\nexport var bohrRadius = /* #__PURE__ */createBohrRadius({\n  BigNumber,\n  Unit,\n  config\n});\nexport var corr = /* #__PURE__ */createCorr({\n  add,\n  divide,\n  matrix,\n  mean,\n  multiply,\n  pow,\n  sqrt,\n  subtract,\n  sum,\n  typed\n});\nexport var dotPow = /* #__PURE__ */createDotPow({\n  DenseMatrix,\n  SparseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  pow,\n  typed\n});\nexport var elementaryCharge = /* #__PURE__ */createElementaryCharge({\n  BigNumber,\n  Unit,\n  config\n});\nexport var faraday = /* #__PURE__ */createFaraday({\n  BigNumber,\n  Unit,\n  config\n});\nexport var hartreeEnergy = /* #__PURE__ */createHartreeEnergy({\n  BigNumber,\n  Unit,\n  config\n});\nexport var inverseConductanceQuantum = /* #__PURE__ */createInverseConductanceQuantum({\n  BigNumber,\n  Unit,\n  config\n});\nexport var magneticConstant = /* #__PURE__ */createMagneticConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarMassC12 = /* #__PURE__ */createMolarMassC12({\n  BigNumber,\n  Unit,\n  config\n});\nexport var neutronMass = /* #__PURE__ */createNeutronMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckCharge = /* #__PURE__ */createPlanckCharge({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckTemperature = /* #__PURE__ */createPlanckTemperature({\n  BigNumber,\n  Unit,\n  config\n});\nexport var quantumOfCirculation = /* #__PURE__ */createQuantumOfCirculation({\n  BigNumber,\n  Unit,\n  config\n});\nexport var setIntersect = /* #__PURE__ */createSetIntersect({\n  DenseMatrix,\n  Index,\n  compareNatural,\n  size,\n  subset,\n  typed\n});\nexport var std = /* #__PURE__ */createStd({\n  map,\n  sqrt,\n  typed,\n  variance\n});\nexport var stirlingS2 = /* #__PURE__ */createStirlingS2({\n  bignumber,\n  addScalar,\n  combinations,\n  divideScalar,\n  factorial,\n  isInteger,\n  isNegative,\n  larger,\n  multiplyScalar,\n  number,\n  pow,\n  subtractScalar,\n  typed\n});\nexport var unit = /* #__PURE__ */createUnitFunction({\n  Unit,\n  typed\n});\nexport var bellNumbers = /* #__PURE__ */createBellNumbers({\n  addScalar,\n  isInteger,\n  isNegative,\n  stirlingS2,\n  typed\n});\nexport var electricConstant = /* #__PURE__ */createElectricConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var firstRadiation = /* #__PURE__ */createFirstRadiation({\n  BigNumber,\n  Unit,\n  config\n});\nexport var nuclearMagneton = /* #__PURE__ */createNuclearMagneton({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckLength = /* #__PURE__ */createPlanckLength({\n  BigNumber,\n  Unit,\n  config\n});\nexport var rotate = /* #__PURE__ */createRotate({\n  multiply,\n  rotationMatrix,\n  typed\n});\nexport var setUnion = /* #__PURE__ */createSetUnion({\n  Index,\n  concat,\n  setIntersect,\n  setSymDifference,\n  size,\n  subset,\n  typed\n});\nexport var wienDisplacement = /* #__PURE__ */createWienDisplacement({\n  BigNumber,\n  Unit,\n  config\n});\nexport var classicalElectronRadius = /* #__PURE__ */createClassicalElectronRadius({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarVolume = /* #__PURE__ */createMolarVolume({\n  BigNumber,\n  Unit,\n  config\n});\nexport var schur = /* #__PURE__ */createSchur({\n  identity,\n  matrix,\n  multiply,\n  norm,\n  qr,\n  subtract,\n  typed\n});\nexport var coulombConstant = /* #__PURE__ */createCoulombConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var gravitationConstant = /* #__PURE__ */createGravitationConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var protonMass = /* #__PURE__ */createProtonMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var sylvester = /* #__PURE__ */createSylvester({\n  abs,\n  add,\n  concat,\n  identity,\n  index,\n  lusolve,\n  matrix,\n  matrixFromColumns,\n  multiply,\n  range,\n  schur,\n  subset,\n  subtract,\n  transpose,\n  typed\n});\nexport var lyap = /* #__PURE__ */createLyap({\n  matrix,\n  multiply,\n  sylvester,\n  transpose,\n  typed\n});", "import _extends from \"@babel/runtime/helpers/extends\";\n/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { config } from './configReadonly.js';\nimport { createNode, createObjectNode, createOperatorNode, createParenthesisNode, createRelationalNode, createArrayNode, createBlockNode, createConditionalNode, createRangeNode, createReviver, createChainClass, createFunctionAssignmentNode, createChain, createConstantNode, createIndexNode, createAccessorNode, createAssignmentNode, createSymbolNode, createFunctionNode, createParse, createResolve, createSimplifyConstant, createCompile, createLeafCount, createSimplifyCore, createEvaluate, createHelpClass, createParserClass, createParser, createSimplify, createSymbolicEqual, createDerivative, createHelp, createRationalize, createMapTransform, createFilterTransform, createForEachTransform, createMapSlicesTransform, createAndTransform, createCumSumTransform, createNullishTransform, createPrintTransform, createBitAndTransform, createConcatTransform, createDiffTransform, createMaxTransform, createMinTransform, createOrTransform, createSubsetTransform, createBitOrTransform, createSumTransform, createVarianceTransform, createIndexTransform, createQuantileSeqTransform, createRangeTransform, createColumnTransform, createRowTransform, createMeanTransform, createStdTransform } from '../factoriesAny.js';\nimport { BigNumber, Complex, e, _false, fineStructure, Fraction, i, _Infinity, LN10, LOG10E, Matrix, _NaN, _null, phi, Range, ResultSet, SQRT1_2,\n// eslint-disable-line camelcase\nsackurTetrode, tau, _true, version, DenseMatrix, efimovFactor, LN2, pi, replacer, SQRT2, typed, weakMixingAngle, abs, acos, acot, acsc, addScalar, arg, asech, asinh, atan, atanh, bigint, bitNot, boolean, clone, combinations, complex, conj, cos, cot, csc, cube, equalScalar, erf, exp, expm1, filter, flatten, forEach, format, getMatrixDataType, hex, im, isBounded, isNaN, isNumeric, isPrime, LOG2E, lgamma, log10, log2, map, mode, multiplyScalar, not, number, oct, pickRandom, print, random, re, sec, sign, sin, size, SparseMatrix, splitUnit, square, string, subtractScalar, tan, toBest, typeOf, acosh, acsch, asec, bignumber, combinationsWithRep, cosh, csch, dot, hasNumericValue, isFinite, isNegative, isZero, matrix, matrixFromFunction, multiply, ones, randomInt, resize, sech, sinh, sparse, sqrt, squeeze, tanh, transpose, xgcd, zeros, acoth, asin, bin, coth, ctranspose, diag, equal, fraction, identity, isInteger, kron, mapSlices, matrixFromColumns, numeric, prod, reshape, round, unaryMinus, bernoulli, cbrt, concat, count, deepEqual, divideScalar, dotMultiply, floor, gcd, isPositive, larger, lcm, leftShift, lsolve, max, mod, nthRoot, nullish, or, qr, rightArithShift, smaller, subtract, to, unaryPlus, usolve, xor, add, atan2, bitAnd, bitOr, bitXor, catalan, compare, compareText, composition, cross, det, diff, distance, dotDivide, equalText, FibonacciHeap, hypot, ImmutableDenseMatrix, Index, intersect, invmod, largerEq, log, lsolveAll, matrixFromRows, min, nthRoots, partitionSelect, rightLogShift, slu, Spa, subset, sum, trace, usolveAll, zpk2tf, ceil, compareNatural, cumsum, fix, index, inv, log1p, lup, pinv, pow, setCartesian, setDistinct, setIsSubset, setPowerset, smallerEq, sort, sqrtm, unequal, and, divide, expm, fft, freqz, gamma, ifft, kldivergence, lusolve, mean, median, polynomialRoot, quantileSeq, range, row, setDifference, setMultiplicity, setSymDifference, solveODE, Unit, vacuumImpedance, atomicMass, bohrMagneton, boltzmann, column, conductanceQuantum, coulomb, createUnit, deuteronMass, eigs, electronMass, factorial, fermiCoupling, gasConstant, gravity, klitzing, loschmidt, mad, magneticFluxQuantum, molarMass, molarPlanckConstant, multinomial, norm, permutations, planckConstant, planckMass, planckTime, reducedPlanckConstant, rotationMatrix, rydberg, secondRadiation, setSize, speedOfLight, stefanBoltzmann, thomsonCrossSection, variance, zeta, avogadro, bohrRadius, corr, dotPow, elementaryCharge, faraday, hartreeEnergy, inverseConductanceQuantum, magneticConstant, molarMassC12, neutronMass, planckCharge, planckTemperature, quantumOfCirculation, setIntersect, std, stirlingS2, unit, bellNumbers, electricConstant, firstRadiation, nuclearMagneton, planckLength, rotate, setUnion, wienDisplacement, classicalElectronRadius, molarVolume, schur, coulombConstant, gravitationConstant, protonMass, sylvester, lyap } from './pureFunctionsAny.generated.js';\nvar math = {}; // NOT pure!\nvar mathWithTransform = {}; // NOT pure!\nvar classes = {}; // NOT pure!\n\nexport var Node = createNode({\n  mathWithTransform\n});\nexport var ObjectNode = createObjectNode({\n  Node\n});\nexport var OperatorNode = createOperatorNode({\n  Node\n});\nexport var ParenthesisNode = createParenthesisNode({\n  Node\n});\nexport var RelationalNode = createRelationalNode({\n  Node\n});\nexport var ArrayNode = createArrayNode({\n  Node\n});\nexport var BlockNode = createBlockNode({\n  Node,\n  ResultSet\n});\nexport var ConditionalNode = createConditionalNode({\n  Node\n});\nexport var RangeNode = createRangeNode({\n  Node\n});\nexport var reviver = createReviver({\n  classes\n});\nexport var Chain = createChainClass({\n  math,\n  typed\n});\nexport var FunctionAssignmentNode = createFunctionAssignmentNode({\n  Node,\n  typed\n});\nexport var chain = createChain({\n  Chain,\n  typed\n});\nexport var ConstantNode = createConstantNode({\n  Node,\n  isBounded\n});\nexport var IndexNode = createIndexNode({\n  Node,\n  size\n});\nexport var AccessorNode = createAccessorNode({\n  Node,\n  subset\n});\nexport var AssignmentNode = createAssignmentNode({\n  matrix,\n  Node,\n  subset\n});\nexport var SymbolNode = createSymbolNode({\n  Unit,\n  Node,\n  math\n});\nexport var FunctionNode = createFunctionNode({\n  Node,\n  SymbolNode,\n  math\n});\nexport var parse = createParse({\n  AccessorNode,\n  ArrayNode,\n  AssignmentNode,\n  BlockNode,\n  ConditionalNode,\n  ConstantNode,\n  FunctionAssignmentNode,\n  FunctionNode,\n  IndexNode,\n  ObjectNode,\n  OperatorNode,\n  ParenthesisNode,\n  RangeNode,\n  RelationalNode,\n  SymbolNode,\n  config,\n  numeric,\n  typed\n});\nexport var resolve = createResolve({\n  ConstantNode,\n  FunctionNode,\n  OperatorNode,\n  ParenthesisNode,\n  parse,\n  typed\n});\nexport var simplifyConstant = createSimplifyConstant({\n  bignumber,\n  fraction,\n  AccessorNode,\n  ArrayNode,\n  ConstantNode,\n  FunctionNode,\n  IndexNode,\n  ObjectNode,\n  OperatorNode,\n  SymbolNode,\n  config,\n  isBounded,\n  mathWithTransform,\n  matrix,\n  typed\n});\nexport var compile = createCompile({\n  parse,\n  typed\n});\nexport var leafCount = createLeafCount({\n  parse,\n  typed\n});\nexport var simplifyCore = createSimplifyCore({\n  AccessorNode,\n  ArrayNode,\n  ConstantNode,\n  FunctionNode,\n  IndexNode,\n  ObjectNode,\n  OperatorNode,\n  ParenthesisNode,\n  SymbolNode,\n  add,\n  divide,\n  equal,\n  isZero,\n  multiply,\n  parse,\n  pow,\n  subtract,\n  typed\n});\nexport var evaluate = createEvaluate({\n  parse,\n  typed\n});\nexport var Help = createHelpClass({\n  evaluate\n});\nexport var Parser = createParserClass({\n  evaluate,\n  parse\n});\nexport var parser = createParser({\n  Parser,\n  typed\n});\nexport var simplify = createSimplify({\n  AccessorNode,\n  ArrayNode,\n  ConstantNode,\n  FunctionNode,\n  IndexNode,\n  ObjectNode,\n  OperatorNode,\n  ParenthesisNode,\n  SymbolNode,\n  equal,\n  parse,\n  replacer,\n  resolve,\n  simplifyConstant,\n  simplifyCore,\n  typed\n});\nexport var symbolicEqual = createSymbolicEqual({\n  OperatorNode,\n  parse,\n  simplify,\n  typed\n});\nexport var derivative = createDerivative({\n  ConstantNode,\n  FunctionNode,\n  OperatorNode,\n  ParenthesisNode,\n  SymbolNode,\n  config,\n  equal,\n  isZero,\n  numeric,\n  parse,\n  simplify,\n  typed\n});\nexport var help = createHelp({\n  Help,\n  mathWithTransform,\n  typed\n});\nexport var rationalize = createRationalize({\n  bignumber,\n  fraction,\n  AccessorNode,\n  ArrayNode,\n  ConstantNode,\n  FunctionNode,\n  IndexNode,\n  ObjectNode,\n  OperatorNode,\n  ParenthesisNode,\n  SymbolNode,\n  add,\n  config,\n  divide,\n  equal,\n  isZero,\n  mathWithTransform,\n  matrix,\n  multiply,\n  parse,\n  pow,\n  simplify,\n  simplifyConstant,\n  simplifyCore,\n  subtract,\n  typed\n});\n_extends(math, {\n  e,\n  false: _false,\n  fineStructure,\n  i,\n  Infinity: _Infinity,\n  LN10,\n  LOG10E,\n  NaN: _NaN,\n  null: _null,\n  phi,\n  SQRT1_2,\n  sackurTetrode,\n  tau,\n  true: _true,\n  'E': e,\n  version,\n  efimovFactor,\n  LN2,\n  pi,\n  replacer,\n  reviver,\n  SQRT2,\n  typed,\n  'PI': pi,\n  weakMixingAngle,\n  abs,\n  acos,\n  acot,\n  acsc,\n  addScalar,\n  arg,\n  asech,\n  asinh,\n  atan,\n  atanh,\n  bigint,\n  bitNot,\n  boolean,\n  clone,\n  combinations,\n  complex,\n  conj,\n  cos,\n  cot,\n  csc,\n  cube,\n  equalScalar,\n  erf,\n  exp,\n  expm1,\n  filter,\n  flatten,\n  forEach,\n  format,\n  getMatrixDataType,\n  hex,\n  im,\n  isBounded,\n  isNaN,\n  isNumeric,\n  isPrime,\n  LOG2E,\n  lgamma,\n  log10,\n  log2,\n  map,\n  mode,\n  multiplyScalar,\n  not,\n  number,\n  oct,\n  pickRandom,\n  print,\n  random,\n  re,\n  sec,\n  sign,\n  sin,\n  size,\n  splitUnit,\n  square,\n  string,\n  subtractScalar,\n  tan,\n  toBest,\n  typeOf,\n  acosh,\n  acsch,\n  asec,\n  bignumber,\n  chain,\n  combinationsWithRep,\n  cosh,\n  csch,\n  dot,\n  hasNumericValue,\n  isFinite,\n  isNegative,\n  isZero,\n  matrix,\n  matrixFromFunction,\n  multiply,\n  ones,\n  randomInt,\n  resize,\n  sech,\n  sinh,\n  sparse,\n  sqrt,\n  squeeze,\n  tanh,\n  transpose,\n  xgcd,\n  zeros,\n  acoth,\n  asin,\n  bin,\n  coth,\n  ctranspose,\n  diag,\n  equal,\n  fraction,\n  identity,\n  isInteger,\n  kron,\n  mapSlices,\n  matrixFromColumns,\n  numeric,\n  prod,\n  reshape,\n  round,\n  unaryMinus,\n  bernoulli,\n  cbrt,\n  concat,\n  count,\n  deepEqual,\n  divideScalar,\n  dotMultiply,\n  floor,\n  gcd,\n  isPositive,\n  larger,\n  lcm,\n  leftShift,\n  lsolve,\n  max,\n  mod,\n  nthRoot,\n  nullish,\n  or,\n  qr,\n  rightArithShift,\n  smaller,\n  subtract,\n  to,\n  unaryPlus,\n  usolve,\n  xor,\n  add,\n  atan2,\n  bitAnd,\n  bitOr,\n  bitXor,\n  catalan,\n  compare,\n  compareText,\n  composition,\n  cross,\n  det,\n  diff,\n  distance,\n  dotDivide,\n  equalText,\n  hypot,\n  intersect,\n  invmod,\n  largerEq,\n  log,\n  lsolveAll,\n  matrixFromRows,\n  min,\n  nthRoots,\n  partitionSelect,\n  rightLogShift,\n  slu,\n  subset,\n  sum,\n  trace,\n  usolveAll,\n  zpk2tf,\n  ceil,\n  compareNatural,\n  cumsum,\n  fix,\n  index,\n  inv,\n  log1p,\n  lup,\n  pinv,\n  pow,\n  setCartesian,\n  setDistinct,\n  setIsSubset,\n  setPowerset,\n  smallerEq,\n  sort,\n  sqrtm,\n  unequal,\n  and,\n  divide,\n  expm,\n  fft,\n  freqz,\n  gamma,\n  ifft,\n  kldivergence,\n  lusolve,\n  mean,\n  median,\n  polynomialRoot,\n  quantileSeq,\n  range,\n  row,\n  setDifference,\n  setMultiplicity,\n  setSymDifference,\n  solveODE,\n  vacuumImpedance,\n  atomicMass,\n  bohrMagneton,\n  boltzmann,\n  column,\n  conductanceQuantum,\n  coulomb,\n  createUnit,\n  deuteronMass,\n  eigs,\n  electronMass,\n  factorial,\n  fermiCoupling,\n  gasConstant,\n  gravity,\n  klitzing,\n  loschmidt,\n  mad,\n  magneticFluxQuantum,\n  molarMass,\n  molarPlanckConstant,\n  multinomial,\n  norm,\n  permutations,\n  planckConstant,\n  planckMass,\n  planckTime,\n  reducedPlanckConstant,\n  rotationMatrix,\n  rydberg,\n  secondRadiation,\n  setSize,\n  speedOfLight,\n  stefanBoltzmann,\n  thomsonCrossSection,\n  variance,\n  zeta,\n  avogadro,\n  bohrRadius,\n  corr,\n  dotPow,\n  elementaryCharge,\n  faraday,\n  hartreeEnergy,\n  inverseConductanceQuantum,\n  magneticConstant,\n  molarMassC12,\n  neutronMass,\n  parse,\n  planckCharge,\n  planckTemperature,\n  quantumOfCirculation,\n  resolve,\n  setIntersect,\n  simplifyConstant,\n  std,\n  stirlingS2,\n  unit,\n  bellNumbers,\n  compile,\n  electricConstant,\n  firstRadiation,\n  leafCount,\n  nuclearMagneton,\n  planckLength,\n  rotate,\n  setUnion,\n  simplifyCore,\n  wienDisplacement,\n  classicalElectronRadius,\n  evaluate,\n  molarVolume,\n  schur,\n  coulombConstant,\n  gravitationConstant,\n  parser,\n  simplify,\n  symbolicEqual,\n  derivative,\n  protonMass,\n  sylvester,\n  help,\n  rationalize,\n  lyap,\n  config\n});\n_extends(mathWithTransform, math, {\n  map: createMapTransform({\n    typed\n  }),\n  filter: createFilterTransform({\n    typed\n  }),\n  forEach: createForEachTransform({\n    typed\n  }),\n  mapSlices: createMapSlicesTransform({\n    isInteger,\n    typed\n  }),\n  and: createAndTransform({\n    add,\n    concat,\n    equalScalar,\n    matrix,\n    not,\n    typed,\n    zeros\n  }),\n  cumsum: createCumSumTransform({\n    add,\n    typed,\n    unaryPlus\n  }),\n  nullish: createNullishTransform({\n    deepEqual,\n    flatten,\n    matrix,\n    size,\n    typed\n  }),\n  print: createPrintTransform({\n    add,\n    matrix,\n    typed,\n    zeros\n  }),\n  bitAnd: createBitAndTransform({\n    add,\n    concat,\n    equalScalar,\n    matrix,\n    not,\n    typed,\n    zeros\n  }),\n  concat: createConcatTransform({\n    isInteger,\n    matrix,\n    typed\n  }),\n  diff: createDiffTransform({\n    bignumber,\n    matrix,\n    number,\n    subtract,\n    typed\n  }),\n  max: createMaxTransform({\n    config,\n    isNaN,\n    larger,\n    numeric,\n    typed\n  }),\n  min: createMinTransform({\n    config,\n    isNaN,\n    numeric,\n    smaller,\n    typed\n  }),\n  or: createOrTransform({\n    DenseMatrix,\n    concat,\n    equalScalar,\n    matrix,\n    typed\n  }),\n  subset: createSubsetTransform({\n    add,\n    matrix,\n    typed,\n    zeros\n  }),\n  bitOr: createBitOrTransform({\n    DenseMatrix,\n    concat,\n    equalScalar,\n    matrix,\n    typed\n  }),\n  sum: createSumTransform({\n    add,\n    config,\n    numeric,\n    typed\n  }),\n  variance: createVarianceTransform({\n    add,\n    divide,\n    isNaN,\n    mapSlices,\n    multiply,\n    subtract,\n    typed\n  }),\n  index: createIndexTransform({\n    Index,\n    getMatrixDataType\n  }),\n  quantileSeq: createQuantileSeqTransform({\n    add,\n    bignumber,\n    compare,\n    divide,\n    isInteger,\n    larger,\n    mapSlices,\n    multiply,\n    partitionSelect,\n    smaller,\n    smallerEq,\n    subtract,\n    typed\n  }),\n  range: createRangeTransform({\n    bignumber,\n    matrix,\n    add,\n    config,\n    equal,\n    isPositive,\n    isZero,\n    larger,\n    largerEq,\n    smaller,\n    smallerEq,\n    typed\n  }),\n  column: createColumnTransform({\n    Index,\n    matrix,\n    range,\n    typed\n  }),\n  row: createRowTransform({\n    Index,\n    matrix,\n    range,\n    typed\n  }),\n  mean: createMeanTransform({\n    add,\n    divide,\n    typed\n  }),\n  std: createStdTransform({\n    map,\n    sqrt,\n    typed,\n    variance\n  })\n});\n_extends(classes, {\n  BigNumber,\n  Complex,\n  Fraction,\n  Matrix,\n  Node,\n  ObjectNode,\n  OperatorNode,\n  ParenthesisNode,\n  Range,\n  RelationalNode,\n  ResultSet,\n  ArrayNode,\n  BlockNode,\n  ConditionalNode,\n  DenseMatrix,\n  RangeNode,\n  Chain,\n  FunctionAssignmentNode,\n  SparseMatrix,\n  ConstantNode,\n  IndexNode,\n  FibonacciHeap,\n  ImmutableDenseMatrix,\n  Index,\n  Spa,\n  AccessorNode,\n  AssignmentNode,\n  Unit,\n  SymbolNode,\n  FunctionNode,\n  Help,\n  Parser\n});\nChain.createProxy(math);\nexport { embeddedDocs as docs } from '../expression/embeddedDocs/embeddedDocs.js';", "import { Controller } from \"@hotwired/stimulus\"\nimport { evaluate } from \"mathjs\"\n\nexport default class extends Controller {\n  static targets = [\"popover\", \"expression\", \"result\"]\n  static values = { fieldId: String }\n\n  connect() {\n    this._closeOnOutsideClick = this._closeOnOutsideClick.bind(this)\n  }\n\n  disconnect() {\n    document.removeEventListener(\"click\", this._closeOnOutsideClick)\n  }\n\n  toggle(event) {\n    event.stopPropagation()\n    if (this.popoverTarget.classList.contains(\"hidden\")) {\n      this._open()\n    } else {\n      this._close()\n    }\n  }\n\n  _open() {\n    document.querySelectorAll(\".inline-calculator-popover:not(.hidden)\").forEach(el => {\n      el.classList.add(\"hidden\")\n    })\n    this.popoverTarget.classList.remove(\"hidden\")\n    this.expressionTarget.value = \"\"\n    this.resultTarget.textContent = \"\u2014\"\n    this.resultTarget.classList.remove(\"text-danger\")\n    this.expressionTarget.focus()\n    setTimeout(() => {\n      document.addEventListener(\"click\", this._closeOnOutsideClick)\n    }, 0)\n  }\n\n  _close() {\n    this.popoverTarget.classList.add(\"hidden\")\n    document.removeEventListener(\"click\", this._closeOnOutsideClick)\n  }\n\n  _closeOnOutsideClick(event) {\n    if (!this.element.contains(event.target)) {\n      this._close()\n    }\n  }\n\n  evaluate() {\n    const expr = this.expressionTarget.value\n    const result = this._safeEval(expr)\n    if (result !== null) {\n      this.resultTarget.textContent = result.toFixed(2)\n      this.resultTarget.classList.remove(\"text-danger\")\n    } else {\n      this.resultTarget.textContent = expr.trim() ? \"Error\" : \"\u2014\"\n      this.resultTarget.classList.toggle(\"text-danger\", expr.trim().length > 0)\n    }\n  }\n\n  apply() {\n    const expr = this.expressionTarget.value\n    const result = this._safeEval(expr)\n    if (result !== null && this.fieldIdValue) {\n      const field = document.getElementById(this.fieldIdValue)\n      if (field && !field.disabled && !field.readOnly) {\n        field.value = result.toFixed(2)\n        field.dispatchEvent(new Event(\"change\", { bubbles: true }))\n        field.dispatchEvent(new Event(\"keyup\", { bubbles: true }))\n      }\n      this._close()\n    }\n  }\n\n  handleKeydown(event) {\n    if (event.key === \"Enter\") {\n      event.preventDefault()\n      this.apply()\n    } else if (event.key === \"Escape\") {\n      this._close()\n    }\n  }\n\n  _safeEval(expr) {\n    const cleaned = expr.replace(/,/g, \".\")\n    if (!cleaned.trim()) return null\n    try {\n      const result = evaluate(cleaned)\n      if (typeof result !== \"number\" || !isFinite(result)) return null\n      return result\n    } catch {\n      return null\n    }\n  }\n}\n", "// This file is auto-generated by ./bin/rails stimulus:manifest:update\n// Run that command whenever you add a new controller or create them with\n// ./bin/rails generate stimulus controllerName\n\nimport { application } from \"./application\"\nimport DateMaskController from \"./date_mask_controller\";\n\nimport AttendanceController from \"./attendance_controller\";\nimport WeekAttendanceController from \"./week_attendance_controller\";\nimport ResourceAttendanceController from \"./resource_attendance_controller\";\nimport RemovalsController from \"./removals_controller\";\nimport PdfOrderController from \"./pdf_order_controller\";\nimport CheckpointDateController from \"./checkpoint_date_controller\";\nimport BatchBillableStatusController from \"./batch_billable_status_controller\";\nimport InstructionInvoiceController from \"./instruction_invoice_controller\";\nimport SortableController from \"./sortable_controller\";\nimport ProformaToEstimateController from \"./proforma_to_estimate_controller\";\nimport ProformaContactGroupSyncController from \"./proforma_contact_group_sync_controller\";\nimport ZeroAmountBillableController from \"./zero_amount_billables_controller\";\nimport CalculateRecordedOwnersController from \"./calculate_recorded_owners_controller\";\nimport QuickEmailController from \"./quick_email_controller\";\nimport PdfVisualizerController from \"./pdf_visualizer_controller\";\nimport NewPatentExpenseDropzoneController from \"./new_patent_expense_dropzone_controller\";\nimport InlineCalculatorController from \"./inline_calculator_controller\";\n\napplication.register(\"date-mask\", DateMaskController);\napplication.register(\"attendance\", AttendanceController);\napplication.register(\"week-attendance\", WeekAttendanceController);\napplication.register(\"resource-attendance\", ResourceAttendanceController);\napplication.register(\"removals\", RemovalsController);\napplication.register(\"pdf-order\", PdfOrderController);\napplication.register(\"checkpoint-date\", CheckpointDateController);\napplication.register(\"batch-billable-status\", BatchBillableStatusController);\napplication.register(\"instruction-invoice\", InstructionInvoiceController);\napplication.register(\"sortable\", SortableController);\napplication.register(\"proforma-to-estimate\", ProformaToEstimateController);\napplication.register(\"proforma-contact-group-sync\", ProformaContactGroupSyncController);\napplication.register(\"zero-amount-billable\", ZeroAmountBillableController);\napplication.register(\"calculate-recorded-owners\", CalculateRecordedOwnersController);\napplication.register(\"quick-email\", QuickEmailController);\napplication.register(\"pdf-visualizer\", PdfVisualizerController);\napplication.register(\"new-patent-expense-dropzone\", NewPatentExpenseDropzoneController);\napplication.register(\"inline-calculator\", InlineCalculatorController);\n", "// Entry point for the build script in your package.json\nimport \"@hotwired/turbo-rails\"\nimport \"./channels\"\n\nimport './controllers'\n\n// check if turbo is enabled\nif (window.Turbo) {\n  console.log('Turbo is loaded successfully!')\n} else {\n  console.error('Turbo is not loaded!')\n}\n"],
  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,MAAO;AAAP;AAAA;AAAA,MAAO,mBAAQ;AAAA,QACb,QAAQ,OAAO,YAAY,cAAc,UAAU;AAAA,QACnD,WAAW,OAAO,cAAc,cAAc,YAAY;AAAA,MAC5D;AAAA;AAAA;;;ACHA,MAcO;AAdP;AAAA;AAAA;AAcA,MAAO,iBAAQ;AAAA,QACb,OAAO,UAAU;AACf,cAAI,KAAK,SAAS;AAChB,qBAAS,KAAK,KAAK,IAAI,CAAC;AACxB,6BAAS,OAAO,IAAI,iBAAiB,GAAG,QAAQ;AAAA,UAClD;AAAA,QACF;AAAA,MACF;AAAA;AAAA;;;ACrBA,MAKM,KAEA,cAEA,mBAkHC;AA3HP;AAAA;AAAA;AAKA,MAAM,MAAM,OAAM,oBAAI,KAAK,GAAE,QAAQ;AAErC,MAAM,eAAe,WAAS,IAAI,IAAI,QAAQ;AAE9C,MAAM,oBAAN,MAAwB;AAAA,QACtB,YAAY,YAAY;AACtB,eAAK,sBAAsB,KAAK,oBAAoB,KAAK,IAAI;AAC7D,eAAK,aAAa;AAClB,eAAK,oBAAoB;AAAA,QAC3B;AAAA,QAEA,QAAQ;AACN,cAAI,CAAC,KAAK,UAAU,GAAG;AACrB,iBAAK,YAAY,IAAI;AACrB,mBAAO,KAAK;AACZ,iBAAK,aAAa;AAClB,6BAAiB,oBAAoB,KAAK,mBAAmB;AAC7D,2BAAO,IAAI,gDAAgD,KAAK,YAAY,cAAc,IAAI;AAAA,UAChG;AAAA,QACF;AAAA,QAEA,OAAO;AACL,cAAI,KAAK,UAAU,GAAG;AACpB,iBAAK,YAAY,IAAI;AACrB,iBAAK,YAAY;AACjB,gCAAoB,oBAAoB,KAAK,mBAAmB;AAChE,2BAAO,IAAI,2BAA2B;AAAA,UACxC;AAAA,QACF;AAAA,QAEA,YAAY;AACV,iBAAO,KAAK,aAAa,CAAC,KAAK;AAAA,QACjC;AAAA,QAEA,gBAAgB;AACd,eAAK,WAAW,IAAI;AAAA,QACtB;AAAA,QAEA,gBAAgB;AACd,eAAK,oBAAoB;AACzB,iBAAO,KAAK;AACZ,yBAAO,IAAI,oCAAoC;AAAA,QACjD;AAAA,QAEA,mBAAmB;AACjB,eAAK,iBAAiB,IAAI;AAC1B,yBAAO,IAAI,uCAAuC;AAAA,QACpD;AAAA;AAAA,QAIA,eAAe;AACb,eAAK,YAAY;AACjB,eAAK,KAAK;AAAA,QACZ;AAAA,QAEA,cAAc;AACZ,uBAAa,KAAK,WAAW;AAAA,QAC/B;AAAA,QAEA,OAAO;AACL,eAAK,cAAc;AAAA,YAAW,MAAM;AAClC,mBAAK,iBAAiB;AACtB,mBAAK,KAAK;AAAA,YACZ;AAAA,YACE,KAAK,gBAAgB;AAAA,UAAC;AAAA,QAC1B;AAAA,QAEA,kBAAkB;AAChB,gBAAM,EAAE,gBAAgB,wBAAwB,IAAI,KAAK;AACzD,gBAAM,UAAU,KAAK,IAAI,IAAI,yBAAyB,KAAK,IAAI,KAAK,mBAAmB,EAAE,CAAC;AAC1F,gBAAM,YAAY,KAAK,sBAAsB,IAAI,IAAM;AACvD,gBAAM,SAAS,YAAY,KAAK,OAAO;AACvC,iBAAO,iBAAiB,MAAO,WAAW,IAAI;AAAA,QAChD;AAAA,QAEA,mBAAmB;AACjB,cAAI,KAAK,kBAAkB,GAAG;AAC5B,2BAAO,IAAI,oEAAoE,KAAK,iBAAiB,kBAAkB,aAAa,KAAK,WAAW,CAAC,yBAAyB,KAAK,YAAY,cAAc,IAAI;AACjN,iBAAK;AACL,gBAAI,KAAK,qBAAqB,GAAG;AAC/B,6BAAO,IAAI,+EAA+E,aAAa,KAAK,cAAc,CAAC,IAAI;AAAA,YACjI,OAAO;AACL,6BAAO,IAAI,6BAA6B;AACxC,mBAAK,WAAW,OAAO;AAAA,YACzB;AAAA,UACF;AAAA,QACF;AAAA,QAEA,IAAI,cAAc;AAChB,iBAAO,KAAK,WAAW,KAAK,WAAW,KAAK;AAAA,QAC9C;AAAA,QAEA,oBAAoB;AAClB,iBAAO,aAAa,KAAK,WAAW,IAAI,KAAK,YAAY;AAAA,QAC3D;AAAA,QAEA,uBAAuB;AACrB,iBAAO,KAAK,kBAAmB,aAAa,KAAK,cAAc,IAAI,KAAK,YAAY;AAAA,QACtF;AAAA,QAEA,sBAAsB;AACpB,cAAI,SAAS,oBAAoB,WAAW;AAC1C;AAAA,cAAW,MAAM;AACf,oBAAI,KAAK,kBAAkB,KAAK,CAAC,KAAK,WAAW,OAAO,GAAG;AACzD,iCAAO,IAAI,uFAAuF,SAAS,eAAe,EAAE;AAC5H,uBAAK,WAAW,OAAO;AAAA,gBACzB;AAAA,cACF;AAAA,cACE;AAAA,YAAG;AAAA,UACP;AAAA,QACF;AAAA,MAEF;AAEA,wBAAkB,iBAAiB;AACnC,wBAAkB,0BAA0B;AAE5C,MAAO,6BAAQ;AAAA;AAAA;;;AC3Hf,MAAO;AAAP;AAAA;AAAA,MAAO,mBAAQ;AAAA,QACb,iBAAiB;AAAA,UACf,WAAW;AAAA,UACX,cAAc;AAAA,UACd,QAAQ;AAAA,UACR,gBAAgB;AAAA,UAChB,aAAa;AAAA,QACf;AAAA,QACA,sBAAsB;AAAA,UACpB,gBAAgB;AAAA,UAChB,mBAAmB;AAAA,UACnB,kBAAkB;AAAA,UAClB,UAAU;AAAA,QACZ;AAAA,QACA,sBAAsB;AAAA,QACtB,aAAa;AAAA,UACX;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA;AAAA;;;ACnBA,MAOO,eAAe,WAChB,oBAEA,SAEA,YAwKC;AApLP;AAAA;AAAA;AACA;AACA;AACA;AAIA,OAAM,EAAC,eAAe,cAAa;AACnC,MAAM,qBAAqB,UAAU,MAAM,GAAG,UAAU,SAAS,CAAC;AAElE,MAAM,UAAU,CAAC,EAAE;AAEnB,MAAM,aAAN,MAAiB;AAAA,QACf,YAAYA,WAAU;AACpB,eAAK,OAAO,KAAK,KAAK,KAAK,IAAI;AAC/B,eAAK,WAAWA;AAChB,eAAK,gBAAgB,KAAK,SAAS;AACnC,eAAK,UAAU,IAAI,2BAAkB,IAAI;AACzC,eAAK,eAAe;AAAA,QACtB;AAAA,QAEA,KAAK,MAAM;AACT,cAAI,KAAK,OAAO,GAAG;AACjB,iBAAK,UAAU,KAAK,KAAK,UAAU,IAAI,CAAC;AACxC,mBAAO;AAAA,UACT,OAAO;AACL,mBAAO;AAAA,UACT;AAAA,QACF;AAAA,QAEA,OAAO;AACL,cAAI,KAAK,SAAS,GAAG;AACnB,2BAAO,IAAI,uDAAuD,KAAK,SAAS,CAAC,EAAE;AACnF,mBAAO;AAAA,UACT,OAAO;AACL,kBAAM,kBAAkB,CAAC,GAAG,WAAW,GAAG,KAAK,SAAS,gBAAgB,CAAC,CAAC;AAC1E,2BAAO,IAAI,uCAAuC,KAAK,SAAS,CAAC,mBAAmB,eAAe,EAAE;AACrG,gBAAI,KAAK,WAAW;AAAE,mBAAK,uBAAuB;AAAA,YAAE;AACpD,iBAAK,YAAY,IAAI,iBAAS,UAAU,KAAK,SAAS,KAAK,eAAe;AAC1E,iBAAK,qBAAqB;AAC1B,iBAAK,QAAQ,MAAM;AACnB,mBAAO;AAAA,UACT;AAAA,QACF;AAAA,QAEA,MAAM,EAAC,eAAc,IAAI,EAAC,gBAAgB,KAAI,GAAG;AAC/C,cAAI,CAAC,gBAAgB;AAAE,iBAAK,QAAQ,KAAK;AAAA,UAAE;AAE3C,cAAI,KAAK,OAAO,GAAG;AACjB,mBAAO,KAAK,UAAU,MAAM;AAAA,UAC9B;AAAA,QACF;AAAA,QAEA,SAAS;AACP,yBAAO,IAAI,yCAAyC,KAAK,SAAS,CAAC,EAAE;AACrE,cAAI,KAAK,SAAS,GAAG;AACnB,gBAAI;AACF,qBAAO,KAAK,MAAM;AAAA,YACpB,SAASC,QAAO;AACd,6BAAO,IAAI,8BAA8BA,MAAK;AAAA,YAChD,UACA;AACE,6BAAO,IAAI,0BAA0B,KAAK,YAAY,WAAW,IAAI;AACrE,yBAAW,KAAK,MAAM,KAAK,YAAY,WAAW;AAAA,YACpD;AAAA,UACF,OAAO;AACL,mBAAO,KAAK,KAAK;AAAA,UACnB;AAAA,QACF;AAAA,QAEA,cAAc;AACZ,cAAI,KAAK,WAAW;AAClB,mBAAO,KAAK,UAAU;AAAA,UACxB;AAAA,QACF;AAAA,QAEA,SAAS;AACP,iBAAO,KAAK,QAAQ,MAAM;AAAA,QAC5B;AAAA,QAEA,WAAW;AACT,iBAAO,KAAK,QAAQ,QAAQ,YAAY;AAAA,QAC1C;AAAA,QAEA,mBAAmB;AACjB,iBAAO,KAAK,QAAQ,oBAAoB;AAAA,QAC1C;AAAA;AAAA,QAIA,sBAAsB;AACpB,iBAAO,QAAQ,KAAK,oBAAoB,KAAK,YAAY,CAAC,KAAK;AAAA,QACjE;AAAA,QAEA,WAAW,QAAQ;AACjB,iBAAO,QAAQ,KAAK,QAAQ,KAAK,SAAS,CAAC,KAAK;AAAA,QAClD;AAAA,QAEA,WAAW;AACT,cAAI,KAAK,WAAW;AAClB,qBAAS,SAAS,iBAAS,WAAW;AACpC,kBAAI,iBAAS,UAAU,KAAK,MAAM,KAAK,UAAU,YAAY;AAC3D,uBAAO,MAAM,YAAY;AAAA,cAC3B;AAAA,YACF;AAAA,UACF;AACA,iBAAO;AAAA,QACT;AAAA,QAEA,uBAAuB;AACrB,mBAAS,aAAa,KAAK,QAAQ;AACjC,kBAAM,UAAU,KAAK,OAAO,SAAS,EAAE,KAAK,IAAI;AAChD,iBAAK,UAAU,KAAK,SAAS,EAAE,IAAI;AAAA,UACrC;AAAA,QACF;AAAA,QAEA,yBAAyB;AACvB,mBAAS,aAAa,KAAK,QAAQ;AACjC,iBAAK,UAAU,KAAK,SAAS,EAAE,IAAI,WAAW;AAAA,YAAC;AAAA,UACjD;AAAA,QACF;AAAA,MAEF;AAEA,iBAAW,cAAc;AAEzB,iBAAW,UAAU,SAAS;AAAA,QAC5B,QAAQ,OAAO;AACb,cAAI,CAAC,KAAK,oBAAoB,GAAG;AAAE;AAAA,UAAO;AAC1C,gBAAM,EAAC,YAAY,SAAS,QAAQ,WAAW,KAAI,IAAI,KAAK,MAAM,MAAM,IAAI;AAC5E,eAAK,QAAQ,cAAc;AAC3B,kBAAQ,MAAM;AAAA,YACZ,KAAK,cAAc;AACjB,kBAAI,KAAK,iBAAiB,GAAG;AAC3B,qBAAK,qBAAqB;AAAA,cAC5B;AACA,mBAAK,QAAQ,cAAc;AAC3B,qBAAO,KAAK,cAAc,OAAO;AAAA,YACnC,KAAK,cAAc;AACjB,6BAAO,IAAI,0BAA0B,MAAM,EAAE;AAC7C,qBAAO,KAAK,MAAM,EAAC,gBAAgB,UAAS,CAAC;AAAA,YAC/C,KAAK,cAAc;AACjB,qBAAO;AAAA,YACT,KAAK,cAAc;AACjB,mBAAK,cAAc,oBAAoB,UAAU;AACjD,kBAAI,KAAK,oBAAoB;AAC3B,qBAAK,qBAAqB;AAC1B,uBAAO,KAAK,cAAc,OAAO,YAAY,aAAa,EAAC,aAAa,KAAI,CAAC;AAAA,cAC/E,OAAO;AACL,uBAAO,KAAK,cAAc,OAAO,YAAY,aAAa,EAAC,aAAa,MAAK,CAAC;AAAA,cAChF;AAAA,YACF,KAAK,cAAc;AACjB,qBAAO,KAAK,cAAc,OAAO,UAAU;AAAA,YAC7C;AACE,qBAAO,KAAK,cAAc,OAAO,YAAY,YAAY,OAAO;AAAA,UACpE;AAAA,QACF;AAAA,QAEA,OAAO;AACL,yBAAO,IAAI,kCAAkC,KAAK,YAAY,CAAC,eAAe;AAC9E,eAAK,eAAe;AACpB,cAAI,CAAC,KAAK,oBAAoB,GAAG;AAC/B,2BAAO,IAAI,8DAA8D;AACzE,mBAAO,KAAK,MAAM,EAAC,gBAAgB,MAAK,CAAC;AAAA,UAC3C;AAAA,QACF;AAAA,QAEA,MAAM,OAAO;AACX,yBAAO,IAAI,yBAAyB;AACpC,cAAI,KAAK,cAAc;AAAE;AAAA,UAAO;AAChC,eAAK,eAAe;AACpB,eAAK,QAAQ,iBAAiB;AAC9B,iBAAO,KAAK,cAAc,UAAU,gBAAgB,EAAC,sBAAsB,KAAK,QAAQ,UAAU,EAAC,CAAC;AAAA,QACtG;AAAA,QAEA,QAAQ;AACN,yBAAO,IAAI,yBAAyB;AAAA,QACtC;AAAA,MACF;AAEA,MAAO,qBAAQ;AAAA;AAAA;;;ACpLf,MA0DM,QAUe;AApErB;AAAA;AA0DA,MAAM,SAAS,SAAS,QAAQC,aAAY;AAC1C,YAAIA,eAAc,MAAM;AACtB,mBAAS,OAAOA,aAAY;AAC1B,kBAAM,QAAQA,YAAW,GAAG;AAC5B,mBAAO,GAAG,IAAI;AAAA,UAChB;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAEA,MAAqB,eAArB,MAAkC;AAAA,QAChC,YAAYC,WAAU,SAAS,CAAC,GAAG,OAAO;AACxC,eAAK,WAAWA;AAChB,eAAK,aAAa,KAAK,UAAU,MAAM;AACvC,iBAAO,MAAM,KAAK;AAAA,QACpB;AAAA;AAAA,QAGA,QAAQ,QAAQ,OAAO,CAAC,GAAG;AACzB,eAAK,SAAS;AACd,iBAAO,KAAK,KAAK,IAAI;AAAA,QACvB;AAAA,QAEA,KAAK,MAAM;AACT,iBAAO,KAAK,SAAS,KAAK,EAAC,SAAS,WAAW,YAAY,KAAK,YAAY,MAAM,KAAK,UAAU,IAAI,EAAC,CAAC;AAAA,QACzG;AAAA,QAEA,cAAc;AACZ,iBAAO,KAAK,SAAS,cAAc,OAAO,IAAI;AAAA,QAChD;AAAA,MACF;AAAA;AAAA;;;ACxFA,MAKM,uBA4CC;AAjDP;AAAA;AAAA;AAKA,MAAM,wBAAN,MAA4B;AAAA,QAC1B,YAAY,eAAe;AACzB,eAAK,gBAAgB;AACrB,eAAK,uBAAuB,CAAC;AAAA,QAC/B;AAAA,QAEA,UAAU,cAAc;AACtB,cAAG,KAAK,qBAAqB,QAAQ,YAAY,KAAK,IAAG;AACvD,2BAAO,IAAI,sCAAsC,aAAa,UAAU,EAAE;AAC1E,iBAAK,qBAAqB,KAAK,YAAY;AAAA,UAC7C,OACK;AACH,2BAAO,IAAI,8CAA8C,aAAa,UAAU,EAAE;AAAA,UACpF;AACA,eAAK,kBAAkB;AAAA,QACzB;AAAA,QAEA,OAAO,cAAc;AACnB,yBAAO,IAAI,oCAAoC,aAAa,UAAU,EAAE;AACxE,eAAK,uBAAwB,KAAK,qBAAqB,OAAO,CAAC,MAAM,MAAM,YAAY;AAAA,QACzF;AAAA,QAEA,oBAAoB;AAClB,eAAK,iBAAiB;AACtB,eAAK,iBAAiB;AAAA,QACxB;AAAA,QAEA,mBAAmB;AACjB,uBAAa,KAAK,YAAY;AAAA,QAChC;AAAA,QAEA,mBAAmB;AACjB,eAAK,eAAe;AAAA,YAAW,MAAM;AACnC,kBAAI,KAAK,iBAAiB,OAAO,KAAK,cAAc,cAAe,YAAY;AAC7E,qBAAK,qBAAqB,IAAI,CAAC,iBAAiB;AAC9C,iCAAO,IAAI,uCAAuC,aAAa,UAAU,EAAE;AAC3E,uBAAK,cAAc,UAAU,YAAY;AAAA,gBAC3C,CAAC;AAAA,cACH;AAAA,YACF;AAAA,YACE;AAAA,UAAG;AAAA,QACP;AAAA,MACF;AAEA,MAAO,iCAAQ;AAAA;AAAA;;;ACjDf,MAcqB;AAdrB;AAAA;AAAA;AACA;AACA;AAYA,MAAqB,gBAArB,MAAmC;AAAA,QACjC,YAAYC,WAAU;AACpB,eAAK,WAAWA;AAChB,eAAK,YAAY,IAAI,+BAAsB,IAAI;AAC/C,eAAK,gBAAgB,CAAC;AAAA,QACxB;AAAA,QAEA,OAAO,aAAa,OAAO;AACzB,gBAAM,UAAU;AAChB,gBAAM,SAAS,OAAO,YAAY,WAAW,UAAU,EAAC,QAAO;AAC/D,gBAAM,eAAe,IAAI,aAAa,KAAK,UAAU,QAAQ,KAAK;AAClE,iBAAO,KAAK,IAAI,YAAY;AAAA,QAC9B;AAAA;AAAA,QAIA,IAAI,cAAc;AAChB,eAAK,cAAc,KAAK,YAAY;AACpC,eAAK,SAAS,uBAAuB;AACrC,eAAK,OAAO,cAAc,aAAa;AACvC,eAAK,UAAU,YAAY;AAC3B,iBAAO;AAAA,QACT;AAAA,QAEA,OAAO,cAAc;AACnB,eAAK,OAAO,YAAY;AACxB,cAAI,CAAC,KAAK,QAAQ,aAAa,UAAU,EAAE,QAAQ;AACjD,iBAAK,YAAY,cAAc,aAAa;AAAA,UAC9C;AACA,iBAAO;AAAA,QACT;AAAA,QAEA,OAAO,YAAY;AACjB,iBAAO,KAAK,QAAQ,UAAU,EAAE,IAAI,CAAC,iBAAiB;AACpD,iBAAK,OAAO,YAAY;AACxB,iBAAK,OAAO,cAAc,UAAU;AACpC,mBAAO;AAAA,UACT,CAAC;AAAA,QACH;AAAA,QAEA,OAAO,cAAc;AACnB,eAAK,UAAU,OAAO,YAAY;AAClC,eAAK,gBAAiB,KAAK,cAAc,OAAO,CAAC,MAAM,MAAM,YAAY;AACzE,iBAAO;AAAA,QACT;AAAA,QAEA,QAAQ,YAAY;AAClB,iBAAO,KAAK,cAAc,OAAO,CAAC,MAAM,EAAE,eAAe,UAAU;AAAA,QACrE;AAAA,QAEA,SAAS;AACP,iBAAO,KAAK,cAAc,IAAI,CAAC,iBAC7B,KAAK,UAAU,YAAY,CAAC;AAAA,QAChC;AAAA,QAEA,UAAU,iBAAiB,MAAM;AAC/B,iBAAO,KAAK,cAAc,IAAI,CAAC,iBAC7B,KAAK,OAAO,cAAc,cAAc,GAAG,IAAI,CAAC;AAAA,QACpD;AAAA,QAEA,OAAO,cAAc,iBAAiB,MAAM;AAC1C,cAAI;AACJ,cAAI,OAAO,iBAAiB,UAAU;AACpC,4BAAgB,KAAK,QAAQ,YAAY;AAAA,UAC3C,OAAO;AACL,4BAAgB,CAAC,YAAY;AAAA,UAC/B;AAEA,iBAAO,cAAc,IAAI,CAACC,kBACvB,OAAOA,cAAa,YAAY,MAAM,aAAaA,cAAa,YAAY,EAAE,GAAG,IAAI,IAAI,MAAU;AAAA,QACxG;AAAA,QAEA,UAAU,cAAc;AACtB,cAAI,KAAK,YAAY,cAAc,WAAW,GAAG;AAC/C,iBAAK,UAAU,UAAU,YAAY;AAAA,UACvC;AAAA,QACF;AAAA,QAEA,oBAAoB,YAAY;AAC9B,yBAAO,IAAI,0BAA0B,UAAU,EAAE;AACjD,eAAK,QAAQ,UAAU,EAAE,IAAI,CAAC,iBAC5B,KAAK,UAAU,OAAO,YAAY,CAAC;AAAA,QACvC;AAAA,QAEA,YAAY,cAAc,SAAS;AACjC,gBAAM,EAAC,WAAU,IAAI;AACrB,iBAAO,KAAK,SAAS,KAAK,EAAC,SAAS,WAAU,CAAC;AAAA,QACjD;AAAA,MACF;AAAA;AAAA;;;ACtCO,WAAS,mBAAmB,KAAK;AACtC,QAAI,OAAO,QAAQ,YAAY;AAC7B,YAAM,IAAI;AAAA,IACZ;AAEA,QAAI,OAAO,CAAC,UAAU,KAAK,GAAG,GAAG;AAC/B,YAAM,IAAI,SAAS,cAAc,GAAG;AACpC,QAAE,OAAO;AAET,QAAE,OAAO,EAAE;AACX,QAAE,WAAW,EAAE,SAAS,QAAQ,QAAQ,IAAI;AAC5C,aAAO,EAAE;AAAA,IACX,OAAO;AACL,aAAO;AAAA,IACT;AAAA,EACF;AA/EA,MA6BqB;AA7BrB;AAAA;AAAA;AACA;AA4BA,MAAqB,WAArB,MAA8B;AAAA,QAC5B,YAAY,KAAK;AACf,eAAK,OAAO;AACZ,eAAK,gBAAgB,IAAI,cAAc,IAAI;AAC3C,eAAK,aAAa,IAAI,mBAAW,IAAI;AACrC,eAAK,eAAe,CAAC;AAAA,QACvB;AAAA,QAEA,IAAI,MAAM;AACR,iBAAO,mBAAmB,KAAK,IAAI;AAAA,QACrC;AAAA,QAEA,KAAK,MAAM;AACT,iBAAO,KAAK,WAAW,KAAK,IAAI;AAAA,QAClC;AAAA,QAEA,UAAU;AACR,iBAAO,KAAK,WAAW,KAAK;AAAA,QAC9B;AAAA,QAEA,aAAa;AACX,iBAAO,KAAK,WAAW,MAAM,EAAC,gBAAgB,MAAK,CAAC;AAAA,QACtD;AAAA,QAEA,yBAAyB;AACvB,cAAI,CAAC,KAAK,WAAW,SAAS,GAAG;AAC/B,mBAAO,KAAK,WAAW,KAAK;AAAA,UAC9B;AAAA,QACF;AAAA,QAEA,eAAe,aAAa;AAC1B,eAAK,eAAe,CAAC,GAAG,KAAK,cAAc,WAAW;AAAA,QACxD;AAAA,MACF;AAAA;AAAA;;;AC9DA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAuBO,WAAS,eAAe,MAAM,UAAU,KAAK,KAAK,iBAAS,oBAAoB;AACpF,WAAO,IAAI,SAAS,GAAG;AAAA,EACzB;AAEO,WAAS,UAAUC,SAAM;AAC9B,UAAM,UAAU,SAAS,KAAK,cAAc,2BAA2BA,OAAI,IAAI;AAC/E,QAAI,SAAS;AACX,aAAO,QAAQ,aAAa,SAAS;AAAA,IACvC;AAAA,EACF;AAhCA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAAA;AAAA;;;ACRA;AAAA;AAOA,OAAC,SAASC,IAAG,GAAG;AACZ,YAAI,YAAY,OAAO,WAAW,YAAY,OAAO,OAAQ,QAAO,UAAU,EAAE;AAAA,iBAAY,cAAc,OAAO,UAAU,OAAO,IAAK,QAAO,CAAC,GAAG,CAAC;AAAA,aAAQ;AACvJ,cAAI,IAAI,EAAE;AACV,mBAASC,MAAK,EAAG,EAAC,YAAY,OAAO,UAAU,UAAUD,IAAGC,EAAC,IAAI,EAAEA,EAAC;AAAA,QACxE;AAAA,MACJ,EAAE,eAAe,OAAO,OAAO,OAAO,SAAO,WAAW;AACpD,eAAO,WAAW;AACd;AACA,cAAID,KAAI;AAAA,YACJ,MAAM,SAASA,IAAGE,IAAG;AACjB,qBAAO,eAAeA,IAAG,cAAc;AAAA,gBACnC,OAAO;AAAA,cACX,CAAC,GAAGA,GAAE,UAAU;AAChB,cAAAA,GAAE,UAAU;AAAA,gBACR,aAAa;AAAA,gBACb,aAAa;AAAA,gBACb,gBAAgB,CAAE,KAAK,GAAI;AAAA,gBAC3B,kBAAkB,CAAE,KAAK,GAAI;AAAA,gBAC7B,aAAa,CAAE,KAAK,GAAI;AAAA,gBACxB,kBAAkB;AAAA,gBAClB,YAAY;AAAA,gBACZ,MAAM;AAAA,gBACN,OAAO;AAAA,gBACP,YAAY,WAAW;AAAA,gBAAC;AAAA,gBACxB,cAAc,WAAW;AAAA,gBAAC;AAAA,gBAC1B,WAAW,WAAW;AAAA,gBAAC;AAAA,gBACvB,QAAQ;AAAA,gBACR,QAAQ;AAAA,gBACR,YAAY;AAAA,gBACZ,oBAAoB;AAAA,gBACpB,sBAAsB;AAAA,gBACtB,YAAY;AAAA,gBACZ,kBAAkB;AAAA,gBAClB,iBAAiB;AAAA,gBACjB,OAAO;AAAA,gBACP,WAAW,WAAW;AAAA,gBAAC;AAAA,gBACvB,cAAc;AAAA,gBACd,eAAe,SAASF,IAAGE,IAAG;AAC1B,yBAAO,cAAc,OAAOA,GAAE,eAAeA,GAAE,aAAa,KAAK,MAAMF,IAAGE,EAAC,IAAIF;AAAA,gBACnF;AAAA,gBACA,eAAe;AAAA,gBACf,UAAU;AAAA,gBACV,iBAAiB;AAAA,gBACjB,iBAAiB;AAAA,gBACjB,iBAAiB,WAAW;AAAA,gBAAC;AAAA,gBAC7B,2BAA2B;AAAA,gBAC3B,cAAc;AAAA,gBACd,YAAY;AAAA,gBACZ,cAAc;AAAA,gBACd,YAAY;AAAA,gBACZ,aAAa;AAAA,gBACb,gBAAgB;AAAA,gBAChB,YAAY;AAAA,gBACZ,oBAAoB;AAAA,gBACpB,YAAY;AAAA,gBACZ,mBAAmB,CAAE,QAAQ,OAAO,OAAO,YAAY,QAAS;AAAA,gBAChE,YAAY;AAAA,gBACZ,eAAe;AAAA,gBACf,gBAAgB;AAAA,gBAChB,wBAAwB;AAAA,gBACxB,YAAY;AAAA,gBACZ,UAAU;AAAA,gBACV,gBAAgB;AAAA,gBAChB,iBAAiB;AAAA,gBACjB,sBAAsB;AAAA,gBACtB,QAAQ;AAAA,gBACR,WAAW;AAAA,gBACX,sBAAsB;AAAA,gBACtB,gBAAgB;AAAA,gBAChB,yBAAyB;AAAA,gBACzB,wBAAwB;AAAA,gBACxB,aAAa,CAAC;AAAA,cAClB;AAAA,YACJ;AAAA,YACA,MAAM,SAASA,IAAGE,IAAG;AACjB,qBAAO,eAAeA,IAAG,cAAc;AAAA,gBACnC,OAAO;AAAA,cACX,CAAC,GAAGA,GAAE,UAAU;AAChB,cAAAA,GAAE,UAAU;AAAA,gBACR,GAAG;AAAA,kBACC,WAAW;AAAA,kBACX,kBAAkB;AAAA,gBACtB;AAAA,gBACA,GAAG;AAAA,kBACC,WAAW;AAAA,kBACX,kBAAkB;AAAA,gBACtB;AAAA,gBACA,KAAK;AAAA,kBACD,WAAW;AAAA,gBACf;AAAA,cACJ;AAAA,YACJ;AAAA,YACA,KAAK,SAASF,IAAGE,IAAG;AAChB,qBAAO,eAAeA,IAAG,cAAc;AAAA,gBACnC,OAAO;AAAA,cACX,CAAC,GAAGA,GAAE,UAAU,SAASF,IAAGE,IAAGC,IAAG;AAC9B,oBAAI,WAAWA,GAAG,QAAOH,GAAE,SAASA,GAAE,OAAOE,EAAC,IAAI;AAClD,gBAAAF,GAAE,SAASA,GAAE,UAAU,CAAC,GAAGA,GAAE,OAAOE,EAAC,IAAIC;AAAA,cAC7C;AAAA,YACJ;AAAA,YACA,MAAM,SAASH,IAAGE,IAAGC,IAAG;AACpB,qBAAO,eAAeD,IAAG,cAAc;AAAA,gBACnC,OAAO;AAAA,cACX,CAAC,GAAGA,GAAE,QAAQ,QAAQA,GAAE,MAAM,SAASF,IAAGE,IAAG;AACzC,oBAAIC,IAAGF;AACP,kBAAE,KAAK,CAAC,CAAC,KAAKD,OAAMG,KAAI,KAAK,CAAC,EAAE,eAAeF,KAAI,KAAK,CAAC,GAAGD,GAAE,MAAM,GAAG,EAAE,QAAS,SAASA,IAAG;AAC1F,sBAAII,KAAI,EAAEJ,GAAE,MAAM,GAAG,GAAG,CAAC;AACzB,mBAAC,SAASA,IAAGC,IAAG;AACZ,wBAAIG,IAAGC,IAAGC,KAAI,CAAC;AACf,wBAAIN,GAAE,SAAS,EAAG,KAAI,WAAWE,GAAG,MAAKE,KAAI,GAAGC,KAAIF,GAAEH,EAAC,EAAEC,EAAC,EAAE,QAAQG,KAAIC,IAAGD,KAAK,CAAAE,GAAE,KAAK;AAAA,sBACnF,IAAIN;AAAA,sBACJ,WAAWC,MAAKA,GAAE,SAAS,IAAIA,KAAI;AAAA,sBACnC,SAASE,GAAEH,EAAC,EAAEC,EAAC,EAAEG,EAAC;AAAA,oBACtB,CAAC;AAAA,wBAAQ,CAAAE,GAAE,KAAK;AAAA,sBACZ,IAAIN;AAAA,sBACJ,WAAWC,MAAKA,GAAE,SAAS,IAAIA,KAAI;AAAA,sBACnC,SAASC;AAAA,oBACb,CAAC;AAAA,6BAAYD,GAAE,SAAS;AAAG,+BAASM,MAAKJ,GAAG,UAASK,MAAKL,GAAEI,EAAC,EAAG,KAAIC,OAAMP,GAAG,KAAI,WAAWC,GAAG,MAAKE,KAAI,GACxGC,KAAIF,GAAEI,EAAC,EAAEC,EAAC,EAAE,QAAQJ,KAAIC,IAAGD,KAAK,CAAAE,GAAE,KAAK;AAAA,wBACnC,IAAIC;AAAA,wBACJ,WAAWC;AAAA,wBACX,SAASL,GAAEI,EAAC,EAAEC,EAAC,EAAEJ,EAAC;AAAA,sBACtB,CAAC;AAAA,0BAAQ,CAAAE,GAAE,KAAK;AAAA,wBACZ,IAAIC;AAAA,wBACJ,WAAWC;AAAA,wBACX,SAASN;AAAA,sBACb,CAAC;AAAA;AACD,2BAAOI;AAAA,kBACX,GAAGF,GAAE,CAAC,GAAGA,GAAE,CAAC,CAAC,EAAE,QAAS,SAASJ,IAAG;AAChC,wBAAIE,KAAIF,GAAE,IAAII,KAAIJ,GAAE;AACpB,qBAAC,SAASA,IAAGE,IAAGE,IAAG;AACf,0BAAIJ,MAAKG,MAAK,EAAG,KAAIF,GAAE,sBAAsBA,GAAE,oBAAoBD,IAAGI,IAAG,KAAE,IAAIH,GAAE,eAAeA,GAAE,YAAY,KAAK,OAAOD,EAAC,GAAGI,EAAC,GAC/H,aAAaF,GAAG,UAASG,MAAKF,GAAEH,EAAC,EAAG,CAAAG,GAAEH,EAAC,EAAEK,EAAC,EAAE,OAAOF,GAAEH,EAAC,EAAEK,EAAC,EAAE,QAAQD,EAAC,GAAG,CAAC;AAAA,0BAAQ,CAAAD,GAAEH,EAAC,EAAEE,EAAC,EAAE,OAAOC,GAAEH,EAAC,EAAEE,EAAC,EAAE,QAAQE,EAAC,GAAG,CAAC;AAAA,oBACxH,EAAEF,IAAGF,GAAE,WAAWI,EAAC;AAAA,kBACvB,CAAE;AAAA,gBACN,CAAE;AACF,uBAAO;AAAA,cACX,GAAGF,GAAE,KAAK,SAASF,IAAGE,IAAG;AACrB,oBAAI,EAAE,KAAK,CAAC,CAAC,GAAG;AACZ,sBAAIC,KAAI,KAAK,CAAC,EAAE,eAAeF,KAAI,KAAK,CAAC;AACzC,kBAAAD,GAAE,MAAM,GAAG,EAAE,QAAS,SAASA,IAAG;AAC9B,wBAAII,KAAI,EAAEJ,GAAE,MAAM,GAAG,GAAG,CAAC,GAAGK,KAAID,GAAE,CAAC,GAAGG,KAAIH,GAAE,CAAC;AAC7C,qBAAC,SAASJ,IAAGI,IAAG;AACZ,sBAAAH,GAAE,mBAAmBA,GAAE,iBAAiBD,IAAGE,IAAG,KAAE,IAAID,GAAE,eAAeA,GAAE,YAAY,KAAK,OAAOD,EAAC,GAAGE,EAAC,GACpGC,GAAEH,EAAC,IAAIG,GAAEH,EAAC,KAAK,CAAC,GAAGG,GAAEH,EAAC,EAAEI,EAAC,IAAID,GAAEH,EAAC,EAAEI,EAAC,KAAK,CAAC,GAAGD,GAAEH,EAAC,EAAEI,EAAC,EAAE,KAAKF,EAAC;AAAA,oBAC9D,EAAEG,IAAG,WAAWE,KAAI,WAAWA,EAAC;AAAA,kBACpC,CAAE;AAAA,gBACN;AACA,uBAAO;AAAA,cACX,GAAGL,GAAE,UAAU,SAASF,IAAG;AACvB,oBAAIE,KAAI;AACR,oBAAI,EAAE,KAAK,CAAC,CAAC,EAAG,UAASC,KAAI,KAAK,CAAC,EAAE,eAAeF,KAAI,KAAK,CAAC,GAAGK,KAAI,YAAY,OAAON,KAAIA,GAAE,MAAM,GAAG,IAAI,CAAEA,GAAE,IAAK,GAAGO,KAAI,GAAGA,KAAID,GAAE,QAAQC,MAAK;AAC7I,sBAAIC,KAAIF,GAAEC,EAAC,EAAE,MAAM,GAAG,GAAGE,KAAID,GAAE,CAAC,GAAG,IAAIA,GAAE,CAAC,KAAK;AAC/C,sBAAI,WAAW,KAAK,aAAa,GAAG;AAChC,wBAAI,GAAG,IAAI;AAAA,sBACP,SAAS;AAAA,sBACT,YAAY;AAAA,sBACZ,UAAU;AAAA,sBACV,QAAQ,UAAU,CAAC;AAAA,oBACvB;AACA,wBAAI,EAAE,aAAa;AACf,0BAAI;AACA,4BAAI,YAAYC,GAAG,GAAE,YAAY,cAAc,IAAI,IAAI,WAAWA,IAAG,CAAC;AAAA,4BAAQ,KAAI,IAAI,YAAYA,IAAG,CAAC;AAAA,sBAC1G,SAAST,IAAG;AACR,yBAAC,IAAI,EAAE,YAAY,aAAa,GAAG,gBAAgBS,IAAG,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM;AAAA,sBAC3F;AACA,sBAAAT,GAAE,SAAS,GAAG,EAAE,SAAS,GAAGA,EAAC,GAAGC,GAAE,cAAc,CAAC;AAAA,oBACrD,MAAO,EAAC,IAAI,EAAE,kBAAkB,GAAG,YAAYQ,IAAG,EAAE,SAAS,UAAU,CAAC,GAAGT,GAAE,SAAS,GACtF,EAAE,SAAS,GAAGA,EAAC,GAAGC,GAAE,UAAU,OAAO,EAAE,WAAW,CAAC;AAAA,kBACvD,WAAW,WAAWE,GAAEM,EAAC,GAAG;AACxB,8BAAU,CAAC,IAAI,UAAU,CAAC,EAAE,OAAO,UAAU,CAAC,IAAI,EAAE,QAAQ,MAAM,UAAU,CAAC,CAAC,GAC9E,UAAU,CAAC,EAAE,SAAS,UAAU,MAAM,CAAC;AACvC,wBAAI,IAAIN,GAAEM,EAAC;AACX,qBAAC,aAAa,IAAI,OAAO,OAAO,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC,GAAG,QAAS,SAAST,IAAG;AACnE,6BAAOA,GAAE,MAAMC,IAAGC,EAAC;AAAA,oBACvB,CAAE;AAAA,kBACN;AAAA,gBACJ;AACA,uBAAO;AAAA,cACX;AACA,kBAAID,KAAI,EAAEE,GAAE,IAAI,CAAC,GAAG,IAAI,EAAEA,GAAE,GAAG,CAAC,GAAG,IAAI,EAAEA,GAAE,IAAI,CAAC;AAChD,uBAAS,EAAEH,IAAGE,IAAG;AACb,uBAAO,SAASF,IAAG;AACf,sBAAI,MAAM,QAAQA,EAAC,EAAG,QAAOA;AAAA,gBACjC,EAAEA,EAAC,KAAK,SAASA,IAAGE,IAAG;AACnB,sBAAIC,KAAI,QAAQH,KAAI,OAAO,eAAe,OAAO,UAAUA,GAAE,OAAO,QAAQ,KAAKA,GAAE,YAAY;AAC/F,sBAAI,QAAQG,IAAG;AACX,wBAAIF,IAAGG,IAAGC,IAAGC,IAAGC,KAAI,CAAC,GAAGC,KAAI,MAAIE,KAAI;AACpC,wBAAI;AACA,0BAAIL,MAAKF,KAAIA,GAAE,KAAKH,EAAC,GAAG,MAAM,MAAME,IAAG;AACnC,4BAAI,OAAOC,EAAC,MAAMA,GAAG;AACrB,wBAAAK,KAAI;AAAA,sBACR,MAAO,QAAM,EAAEA,MAAKP,KAAII,GAAE,KAAKF,EAAC,GAAG,UAAUI,GAAE,KAAKN,GAAE,KAAK,GAAGM,GAAE,WAAWL,KAAIM,KAAI,KAAI;AAAA,oBAC3F,SAASR,IAAG;AACR,sBAAAU,KAAI,MAAIN,KAAIJ;AAAA,oBAChB,UAAE;AACE,0BAAI;AACA,4BAAI,CAACQ,MAAK,QAAQL,GAAE,WAAWG,KAAIH,GAAE,OAAO,GAAG,OAAOG,EAAC,MAAMA,IAAI;AAAA,sBACrE,UAAE;AACE,4BAAII,GAAG,OAAMN;AAAA,sBACjB;AAAA,oBACJ;AACA,2BAAOG;AAAA,kBACX;AAAA,gBACJ,EAAEP,IAAGE,EAAC,KAAK,SAASF,IAAGE,IAAG;AACtB,sBAAI,CAACF,GAAG;AACR,sBAAI,YAAY,OAAOA,GAAG,QAAO,EAAEA,IAAGE,EAAC;AACvC,sBAAIC,KAAI,OAAO,UAAU,SAAS,KAAKH,EAAC,EAAE,MAAM,GAAG,EAAE;AACrD,+BAAaG,MAAKH,GAAE,gBAAgBG,KAAIH,GAAE,YAAY;AACtD,sBAAI,UAAUG,MAAK,UAAUA,GAAG,QAAO,MAAM,KAAKH,EAAC;AACnD,sBAAI,gBAAgBG,MAAK,2CAA2C,KAAKA,EAAC,EAAG,QAAO,EAAEH,IAAGE,EAAC;AAAA,gBAC9F,EAAEF,IAAGE,EAAC,KAAK,WAAW;AAClB,wBAAM,IAAI,UAAU,2IAA2I;AAAA,gBACnK,EAAE;AAAA,cACN;AACA,uBAAS,EAAEF,IAAGE,IAAG;AACb,iBAAC,QAAQA,MAAKA,KAAIF,GAAE,YAAYE,KAAIF,GAAE;AACtC,yBAASG,KAAI,GAAGF,KAAI,IAAI,MAAMC,EAAC,GAAGC,KAAID,IAAGC,KAAK,CAAAF,GAAEE,EAAC,IAAIH,GAAEG,EAAC;AACxD,uBAAOF;AAAA,cACX;AACA,uBAAS,EAAED,IAAG;AACV,uBAAOA,MAAKA,GAAE,aAAaA,KAAI;AAAA,kBAC3B,SAASA;AAAA,gBACb;AAAA,cACJ;AACA,kBAAI,IAAIC,GAAE,QAAQ;AAClB,uBAAS,EAAED,IAAG;AACV,uBAAOA,cAAa;AAAA,cACxB;AACA,kBAAI,IAAIE,GAAE,QAAQ;AAClB,4BAAc,OAAOD,GAAE,QAAQ,cAAcC,GAAE,QAAQ,IAAID,GAAE,QAAQ,cAAcA,GAAE,QAAQ,SAAS,KAAK,EAAE,eAAeC,GAAE,QAAQ,IAAI,SAASF,IAAGE,IAAG;AACrJ,gBAAAA,KAAIA,MAAK;AAAA,kBACL,SAAS;AAAA,kBACT,YAAY;AAAA,kBACZ,UAAU;AAAA,kBACV,QAAQ;AAAA,gBACZ;AACA,oBAAIC,KAAI,EAAE,YAAY,aAAa;AACnC,uBAAOA,GAAE,gBAAgBH,IAAGE,GAAE,SAASA,GAAE,YAAYA,GAAE,MAAM,GAAGC;AAAA,cACpE,GAAG,EAAE,YAAYF,GAAE,QAAQ,MAAM,aAAa,eAAe,OAAO,UAAUC,GAAE,QAAQ,IAAI;AAAA,YAChG;AAAA,YACA,KAAK,SAASF,IAAGE,IAAG;AAChB,uBAASC,GAAEH,IAAG;AACV,uBAAOG,KAAI,cAAc,OAAO,UAAU,YAAY,OAAO,OAAO,WAAW,SAASH,IAAG;AACvF,yBAAO,OAAOA;AAAA,gBAClB,IAAI,SAASA,IAAG;AACZ,yBAAOA,MAAK,cAAc,OAAO,UAAUA,GAAE,gBAAgB,UAAUA,OAAM,OAAO,YAAY,WAAW,OAAOA;AAAA,gBACtH,GAAGG,GAAEH,EAAC;AAAA,cACV;AACA,qBAAO,eAAeE,IAAG,cAAc;AAAA,gBACnC,OAAO;AAAA,cACX,CAAC,GAAGA,GAAE,UAAU,SAASF,KAAI;AACzB,oBAAIE,IAAGD,IAAG,GAAG,GAAG,GAAG,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,GAAG,IAAI,GAAG,IAAI,UAAU,QAAQ,IAAI;AAC/E,6BAAa,OAAO,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,GAAG;AACzD,6BAAaE,GAAE,CAAC,KAAK,cAAc,OAAO,MAAM,IAAI,CAAC;AACrD,uBAAM,IAAI,GAAG,IAAK,KAAI,SAASD,KAAI,UAAU,CAAC,GAAI,MAAKD,MAAKC,GAAG,KAAI,EAAED,EAAC,GAAG,OAAO,IAAIC,GAAED,EAAC,OAAO,KAAK,MAAM,sBAAsB,OAAO,UAAU,SAAS,KAAK,CAAC,MAAM,IAAI,MAAM,QAAQ,CAAC,OAAO,KAAK,IAAI,OACxM,IAAI,KAAK,MAAM,QAAQ,CAAC,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,sBAAsB,OAAO,UAAU,SAAS,KAAK,CAAC,IAAI,IAAI,CAAC,GAC9G,EAAEA,EAAC,IAAID,GAAE,GAAG,GAAG,CAAC,KAAK,WAAW,MAAM,EAAEC,EAAC,IAAI;AAC7C,uBAAO;AAAA,cACX;AAAA,YACJ;AAAA,YACA,MAAM,SAASD,IAAGE,IAAGC,IAAG;AACpB,qBAAO,eAAeD,IAAG,cAAc;AAAA,gBACnC,OAAO;AAAA,cACX,CAAC,GAAGA,GAAE,UAAU;AAChB,kBAAID,KAAI,EAAEE,GAAE,IAAI,CAAC,GAAG,IAAI,EAAEA,GAAE,GAAG,CAAC,GAAG,IAAIA,GAAE,IAAI,GAAG,IAAI,EAAEA,GAAE,GAAG,CAAC;AAC5D,uBAAS,EAAEH,IAAG;AACV,uBAAOA,MAAKA,GAAE,aAAaA,KAAI;AAAA,kBAC3B,SAASA;AAAA,gBACb;AAAA,cACJ;AACA,kBAAI,IAAIC,GAAE,QAAQ;AAClB,uBAAS,EAAED,IAAG;AACV,uBAAOA,cAAa,IAAIA,KAAI,gBAAgB,IAAI,MAAM,QAAQA,MAAKA,OAAMC,GAAE,YAAY,KAAK,CAAC,IAAID,GAAE,WAAWA,KAAI,WAAWA,GAAE,CAAC,KAAKA,GAAE,CAAC,EAAE,WAAWA,GAAE,CAAC,IAAI,EAAE,cAAcA,EAAC,GAC7K,WAAW,KAAK,CAAC,KAAK,SAAS,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,gBAAgB,KAAK,CAAC,EAAE,iBAAiB,CAAC,OAAO,IAAI,EAAEA,EAAC;AAAA,cAC/G;AACA,gBAAE,YAAY;AAAA,gBACV,IAAI,EAAE;AAAA,gBACN,KAAK,EAAE;AAAA,gBACP,SAAS,EAAE;AAAA,cACf,GAAG,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE;AACzD,cAAAE,GAAE,UAAU;AAAA,YAChB;AAAA,YACA,MAAM,SAASF,IAAGE,IAAGC,IAAG;AACpB,qBAAO,eAAeD,IAAG,cAAc;AAAA,gBACnC,OAAO;AAAA,cACX,CAAC,GAAGA,GAAE,SAASA,GAAE,SAASA,GAAE,KAAK;AACjC,kBAAID,IAAG,KAAKA,KAAIE,GAAE,IAAI,MAAMF,GAAE,aAAaA,KAAI;AAAA,gBAC3C,SAASA;AAAA,cACb;AACA,kBAAI,IAAI,EAAE,QAAQ,aAAa,EAAE,QAAQ,UAAU,aAAa;AAChE,cAAAC,GAAE,KAAK,EAAE,QAAQ,OAAO,IAAI,KAAK,EAAE,QAAQ,UAAU,IAAI,GAAGA,GAAE,SAAS,EAAE,QAAQ,aAAa,EAAE,QAAQ,UAAU,iBAAiB,EAAE,QAAQ,UAAU,cAAc,UAAU,EAAE,QAAQ,aAAa,EAAE,QAAQ,UAAU,kBAAkB,kBAAkB,EAAE,SAChQA,GAAE,SAAS,UAAU,KAAK,CAAC;AAAA,YAC/B;AAAA,YACA,MAAM,SAASF,IAAGE,IAAG;AACjB,qBAAO,eAAeA,IAAG,cAAc;AAAA,gBACnC,OAAO;AAAA,cACX,CAAC,GAAGA,GAAE,UAAU,SAASF,IAAG;AACxB,uBAAOA,GAAE,QAAQG,IAAG,MAAM;AAAA,cAC9B;AACA,kBAAIA,KAAI,IAAI,OAAO,QAAQ,CAAE,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,MAAM,KAAK,GAAI,EAAE,KAAK,KAAK,IAAI,KAAK,KAAK;AAAA,YACtI;AAAA,YACA,MAAM,SAASH,IAAGE,IAAGC,IAAG;AACpB,uBAASF,GAAED,IAAG;AACV,uBAAOC,KAAI,cAAc,OAAO,UAAU,YAAY,OAAO,OAAO,WAAW,SAASD,IAAG;AACvF,yBAAO,OAAOA;AAAA,gBAClB,IAAI,SAASA,IAAG;AACZ,yBAAOA,MAAK,cAAc,OAAO,UAAUA,GAAE,gBAAgB,UAAUA,OAAM,OAAO,YAAY,WAAW,OAAOA;AAAA,gBACtH,GAAGC,GAAED,EAAC;AAAA,cACV;AACA,qBAAO,eAAeE,IAAG,cAAc;AAAA,gBACnC,OAAO;AAAA,cACX,CAAC,GAAGA,GAAE,gBAAgB;AACtB,kBAAI,GAAG,IAAIC,GAAE,IAAI,GAAG,KAAK,IAAIA,GAAE,IAAI,MAAM,EAAE,aAAa,IAAI;AAAA,gBACxD,SAAS;AAAA,cACb,GAAG,IAAIA,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI;AACjE,uBAAS,IAAI;AAC4I,oBAAI,WAAW;AAChK,yBAAOD;AAAA,gBACX;AACA,oBAAIF,IAAGE,KAAI,CAAC,GAAGC,KAAI,OAAO,WAAWC,KAAID,GAAE,gBAAgBE,KAAI,OAAO,kBAAkB,SAASL,IAAGE,IAAGC,IAAG;AACtG,kBAAAH,GAAEE,EAAC,IAAIC,GAAE;AAAA,gBACb,GAAGG,KAAI,cAAc,OAAO,SAAS,SAAS,CAAC,GAAGC,KAAID,GAAE,YAAY,cAAcE,KAAIF,GAAE,iBAAiB,mBAAmBI,KAAIJ,GAAE,eAAe;AACjJ,yBAASK,GAAEX,IAAGE,IAAGC,IAAG;AAChB,yBAAO,OAAO,eAAeH,IAAGE,IAAG;AAAA,oBAC/B,OAAOC;AAAA,oBACP,YAAY;AAAA,oBACZ,cAAc;AAAA,oBACd,UAAU;AAAA,kBACd,CAAC,GAAGH,GAAEE,EAAC;AAAA,gBACX;AACA,oBAAI;AACA,kBAAAS,GAAE,CAAC,GAAG,EAAE;AAAA,gBACZ,SAASX,IAAG;AACR,kBAAAW,KAAI,SAASX,IAAGE,IAAGC,IAAG;AAClB,2BAAOH,GAAEE,EAAC,IAAIC;AAAA,kBAClB;AAAA,gBACJ;AACA,yBAASM,GAAET,IAAGE,IAAGC,IAAGF,IAAG;AACnB,sBAAIG,KAAIF,MAAKA,GAAE,qBAAqB,IAAIA,KAAI,GAAGI,KAAI,OAAO,OAAOF,GAAE,SAAS,GAAGG,KAAI,IAAI,EAAEN,MAAK,CAAC,CAAC;AAChG,yBAAOI,GAAEC,IAAG,WAAW;AAAA,oBACnB,OAAO,EAAEN,IAAGG,IAAGI,EAAC;AAAA,kBACpB,CAAC,GAAGD;AAAA,gBACR;AACA,yBAASM,GAAEZ,IAAGE,IAAGC,IAAG;AAChB,sBAAI;AACA,2BAAO;AAAA,sBACH,MAAM;AAAA,sBACN,KAAKH,GAAE,KAAKE,IAAGC,EAAC;AAAA,oBACpB;AAAA,kBACJ,SAASH,IAAG;AACR,2BAAO;AAAA,sBACH,MAAM;AAAA,sBACN,KAAKA;AAAA,oBACT;AAAA,kBACJ;AAAA,gBACJ;AACA,gBAAAE,GAAE,OAAOO;AACT,oBAAII,KAAI,kBAAkBC,KAAI,kBAAkBC,KAAI,aAAaC,KAAI,aAAaC,KAAI,CAAC;AACvF,yBAAS,IAAI;AAAA,gBAAC;AACd,yBAAS,IAAI;AAAA,gBAAC;AACd,yBAAS,IAAI;AAAA,gBAAC;AACd,oBAAI,IAAI,CAAC;AACT,gBAAAN,GAAE,GAAGJ,IAAI,WAAW;AAChB,yBAAO;AAAA,gBACX,CAAE;AACF,oBAAIW,KAAI,OAAO,gBAAgB,IAAIA,MAAKA,GAAEA,GAAE,EAAE,CAAC,CAAC,CAAC,CAAC;AAClD,qBAAK,MAAMf,MAAKC,GAAE,KAAK,GAAGG,EAAC,MAAM,IAAI;AACrC,oBAAI,IAAI,EAAE,YAAY,EAAE,YAAY,OAAO,OAAO,CAAC;AACnD,yBAAS,EAAEP,IAAG;AACV,mBAAE,QAAQ,SAAS,QAAS,EAAE,QAAS,SAASE,IAAG;AAC/C,oBAAAS,GAAEX,IAAGE,IAAI,SAASF,IAAG;AACjB,6BAAO,KAAK,QAAQE,IAAGF,EAAC;AAAA,oBAC5B,CAAE;AAAA,kBACN,CAAE;AAAA,gBACN;AACA,yBAAS,EAAEA,IAAGE,IAAG;AACb,2BAASC,GAAEE,IAAGC,IAAGC,IAAGC,IAAG;AACnB,wBAAIE,KAAIE,GAAEZ,GAAEK,EAAC,GAAGL,IAAGM,EAAC;AACpB,wBAAI,YAAYI,GAAE,MAAM;AACpB,0BAAIC,KAAID,GAAE,KAAKD,KAAIE,GAAE;AACrB,6BAAOF,MAAK,YAAYR,GAAEQ,EAAC,KAAKL,GAAE,KAAKK,IAAG,SAAS,IAAIP,GAAE,QAAQO,GAAE,OAAO,EAAE,KAAM,SAAST,IAAG;AAC1F,wBAAAG,GAAE,QAAQH,IAAGO,IAAGC,EAAC;AAAA,sBACrB,GAAK,SAASR,IAAG;AACb,wBAAAG,GAAE,SAASH,IAAGO,IAAGC,EAAC;AAAA,sBACtB,CAAE,IAAIN,GAAE,QAAQO,EAAC,EAAE,KAAM,SAAST,IAAG;AACjC,wBAAAW,GAAE,QAAQX,IAAGO,GAAEI,EAAC;AAAA,sBACpB,GAAK,SAASX,IAAG;AACb,+BAAOG,GAAE,SAASH,IAAGO,IAAGC,EAAC;AAAA,sBAC7B,CAAE;AAAA,oBACN;AACA,oBAAAA,GAAEE,GAAE,GAAG;AAAA,kBACX;AACA,sBAAIJ;AACJ,kBAAAD,GAAE,MAAM,WAAW;AAAA,oBACf,OAAO,SAASL,IAAGC,IAAG;AAClB,+BAASG,KAAI;AACT,+BAAO,IAAIF,GAAG,SAASA,IAAGE,IAAG;AACzB,0BAAAD,GAAEH,IAAGC,IAAGC,IAAGE,EAAC;AAAA,wBAChB,CAAE;AAAA,sBACN;AACA,6BAAOE,KAAIA,KAAIA,GAAE,KAAKF,IAAGA,EAAC,IAAIA,GAAE;AAAA,oBACpC;AAAA,kBACJ,CAAC;AAAA,gBACL;AACA,yBAAS,EAAEF,IAAGC,IAAGF,IAAG;AAChB,sBAAIG,KAAIS;AACR,yBAAO,SAASR,IAAGC,IAAG;AAClB,wBAAIF,OAAMW,GAAG,OAAM,IAAI,MAAM,8BAA8B;AAC3D,wBAAIX,OAAMY,IAAG;AACT,0BAAI,YAAYX,GAAG,OAAMC;AACzB,6BAAO;AAAA,wBACH,OAAON;AAAA,wBACP,MAAM;AAAA,sBACV;AAAA,oBACJ;AACA,yBAAKC,GAAE,SAASI,IAAGJ,GAAE,MAAMK,QAAM;AAC7B,0BAAIC,KAAIN,GAAE;AACV,0BAAIM,IAAG;AACH,4BAAIC,KAAI,EAAED,IAAGN,EAAC;AACd,4BAAIO,IAAG;AACH,8BAAIA,OAAMS,GAAG;AACb,iCAAOT;AAAA,wBACX;AAAA,sBACJ;AACA,0BAAI,WAAWP,GAAE,OAAQ,CAAAA,GAAE,OAAOA,GAAE,QAAQA,GAAE;AAAA,+BAAc,YAAYA,GAAE,QAAQ;AAC9E,4BAAIG,OAAMS,GAAG,OAAMT,KAAIY,IAAGf,GAAE;AAC5B,wBAAAA,GAAE,kBAAkBA,GAAE,GAAG;AAAA,sBAC7B,MAAO,cAAaA,GAAE,UAAUA,GAAE,OAAO,UAAUA,GAAE,GAAG;AACxD,sBAAAG,KAAIW;AACJ,0BAAIL,KAAIE,GAAEV,IAAGC,IAAGF,EAAC;AACjB,0BAAI,aAAaS,GAAE,MAAM;AACrB,4BAAIN,KAAIH,GAAE,OAAOe,KAAIF,IAAGJ,GAAE,QAAQO,GAAG;AACrC,+BAAO;AAAA,0BACH,OAAOP,GAAE;AAAA,0BACT,MAAMT,GAAE;AAAA,wBACZ;AAAA,sBACJ;AACA,kCAAYS,GAAE,SAASN,KAAIY,IAAGf,GAAE,SAAS,SAASA,GAAE,MAAMS,GAAE;AAAA,oBAChE;AAAA,kBACJ;AAAA,gBACJ;AACA,yBAAS,EAAER,IAAGC,IAAG;AACb,sBAAIF,KAAIE,GAAE,QAAQC,KAAIF,GAAE,SAASD,EAAC;AAClC,sBAAIG,OAAMJ,GAAG,QAAOG,GAAE,WAAW,MAAM,YAAYF,MAAKC,GAAE,SAAS,WAAWC,GAAE,SAAS,UACzFA,GAAE,MAAMH,IAAG,EAAEE,IAAGC,EAAC,GAAG,YAAYA,GAAE,WAAW,aAAaF,OAAME,GAAE,SAAS,SAC3EA,GAAE,MAAM,IAAI,UAAU,sCAAsCF,KAAI,UAAU,IAAIgB;AAC9E,sBAAIZ,KAAIO,GAAER,IAAGF,GAAE,UAAUC,GAAE,GAAG;AAC9B,sBAAI,YAAYE,GAAE,KAAM,QAAOF,GAAE,SAAS,SAASA,GAAE,MAAME,GAAE,KAAKF,GAAE,WAAW,MAC/Ec;AACA,sBAAIX,KAAID,GAAE;AACV,yBAAOC,KAAIA,GAAE,QAAQH,GAAED,GAAE,UAAU,IAAII,GAAE,OAAOH,GAAE,OAAOD,GAAE,SAAS,aAAaC,GAAE,WAAWA,GAAE,SAAS,QACzGA,GAAE,MAAMH,KAAIG,GAAE,WAAW,MAAMc,MAAKX,MAAKH,GAAE,SAAS,SAASA,GAAE,MAAM,IAAI,UAAU,kCAAkC,GACrHA,GAAE,WAAW,MAAMc;AAAA,gBACvB;AACA,yBAAS,EAAEjB,IAAG;AACV,sBAAIE,KAAI;AAAA,oBACJ,QAAQF,GAAE,CAAC;AAAA,kBACf;AACA,uBAAKA,OAAME,GAAE,WAAWF,GAAE,CAAC,IAAI,KAAKA,OAAME,GAAE,aAAaF,GAAE,CAAC,GAAGE,GAAE,WAAWF,GAAE,CAAC,IAC/E,KAAK,WAAW,KAAKE,EAAC;AAAA,gBAC1B;AACA,yBAAS,EAAEF,IAAG;AACV,sBAAIE,KAAIF,GAAE,cAAc,CAAC;AACzB,kBAAAE,GAAE,OAAO,UAAU,OAAOA,GAAE,KAAKF,GAAE,aAAaE;AAAA,gBACpD;AACA,yBAAS,EAAEF,IAAG;AACV,uBAAK,aAAa,CAAE;AAAA,oBAChB,QAAQ;AAAA,kBACZ,CAAE,GAAGA,GAAE,QAAQ,GAAG,IAAI,GAAG,KAAK,MAAM,IAAE;AAAA,gBAC1C;AACA,yBAAS,EAAEE,IAAG;AACV,sBAAIA,MAAK,OAAOA,IAAG;AACf,wBAAIC,KAAID,GAAEK,EAAC;AACX,wBAAIJ,GAAG,QAAOA,GAAE,KAAKD,EAAC;AACtB,wBAAI,cAAc,OAAOA,GAAE,KAAM,QAAOA;AACxC,wBAAI,CAAC,MAAMA,GAAE,MAAM,GAAG;AAClB,0BAAIG,KAAI,IAAIC,KAAI,SAASH,KAAI;AACzB,+BAAM,EAAEE,KAAIH,GAAE,SAAU,KAAIE,GAAE,KAAKF,IAAGG,EAAC,EAAG,QAAOF,GAAE,QAAQD,GAAEG,EAAC,GAAGF,GAAE,OAAO,OAAIA;AAC9E,+BAAOA,GAAE,QAAQH,IAAGG,GAAE,OAAO,MAAIA;AAAA,sBACrC;AACA,6BAAOG,GAAE,OAAOA;AAAA,oBACpB;AAAA,kBACJ;AACA,wBAAM,IAAI,UAAUL,GAAEC,EAAC,IAAI,kBAAkB;AAAA,gBACjD;AACA,uBAAO,EAAE,YAAY,GAAGG,GAAE,GAAG,eAAe;AAAA,kBACxC,OAAO;AAAA,kBACP,cAAc;AAAA,gBAClB,CAAC,GAAGA,GAAE,GAAG,eAAe;AAAA,kBACpB,OAAO;AAAA,kBACP,cAAc;AAAA,gBAClB,CAAC,GAAG,EAAE,cAAcM,GAAE,GAAGD,IAAG,mBAAmB,GAAGR,GAAE,sBAAsB,SAASF,IAAG;AAClF,sBAAIE,KAAI,cAAc,OAAOF,MAAKA,GAAE;AACpC,yBAAO,CAAC,CAACE,OAAMA,OAAM,KAAK,yBAAyBA,GAAE,eAAeA,GAAE;AAAA,gBAC1E,GAAGA,GAAE,OAAO,SAASF,IAAG;AACpB,yBAAO,OAAO,iBAAiB,OAAO,eAAeA,IAAG,CAAC,KAAKA,GAAE,YAAY,GAAGW,GAAEX,IAAGU,IAAG,mBAAmB,IAC1GV,GAAE,YAAY,OAAO,OAAO,CAAC,GAAGA;AAAA,gBACpC,GAAGE,GAAE,QAAQ,SAASF,IAAG;AACrB,yBAAO;AAAA,oBACH,SAASA;AAAA,kBACb;AAAA,gBACJ,GAAG,EAAE,EAAE,SAAS,GAAGW,GAAE,EAAE,WAAWH,IAAI,WAAW;AAC7C,yBAAO;AAAA,gBACX,CAAE,GAAGN,GAAE,gBAAgB,GAAGA,GAAE,QAAQ,SAASF,IAAGG,IAAGF,IAAGG,IAAGC,IAAG;AACxD,6BAAWA,OAAMA,KAAI;AACrB,sBAAIC,KAAI,IAAI,EAAEG,GAAET,IAAGG,IAAGF,IAAGG,EAAC,GAAGC,EAAC;AAC9B,yBAAOH,GAAE,oBAAoBC,EAAC,IAAIG,KAAIA,GAAE,KAAK,EAAE,KAAM,SAASN,IAAG;AAC7D,2BAAOA,GAAE,OAAOA,GAAE,QAAQM,GAAE,KAAK;AAAA,kBACrC,CAAE;AAAA,gBACN,GAAG,EAAE,CAAC,GAAGK,GAAE,GAAGD,IAAG,WAAW,GAAGC,GAAE,GAAGJ,IAAI,WAAW;AAC/C,yBAAO;AAAA,gBACX,CAAE,GAAGI,GAAE,GAAG,YAAa,WAAW;AAC9B,yBAAO;AAAA,gBACX,CAAE,GAAGT,GAAE,OAAO,SAASF,IAAG;AACtB,sBAAIE,KAAI,OAAOF,EAAC,GAAGG,KAAI,CAAC;AACxB,2BAASF,MAAKC,GAAG,CAAAC,GAAE,KAAKF,EAAC;AACzB,yBAAOE,GAAE,QAAQ,GAAG,SAASH,KAAI;AAC7B,2BAAMG,GAAE,UAAU;AACd,0BAAIF,KAAIE,GAAE,IAAI;AACd,0BAAIF,MAAKC,GAAG,QAAOF,GAAE,QAAQC,IAAGD,GAAE,OAAO,OAAIA;AAAA,oBACjD;AACA,2BAAOA,GAAE,OAAO,MAAIA;AAAA,kBACxB;AAAA,gBACJ,GAAGE,GAAE,SAAS,GAAG,EAAE,YAAY;AAAA,kBAC3B,aAAa;AAAA,kBACb,OAAO,SAASA,IAAG;AACf,wBAAI,KAAK,OAAO,GAAG,KAAK,OAAO,GAAG,KAAK,OAAO,KAAK,QAAQF,IAAG,KAAK,OAAO,OAAI,KAAK,WAAW,MAC9F,KAAK,SAAS,QAAQ,KAAK,MAAMA,IAAG,KAAK,WAAW,QAAQ,CAAC,GAAG,CAACE,GAAG,UAASC,MAAK,KAAM,SAAQA,GAAE,OAAO,CAAC,KAAKC,GAAE,KAAK,MAAMD,EAAC,KAAK,CAAC,MAAM,CAACA,GAAE,MAAM,CAAC,CAAC,MAAM,KAAKA,EAAC,IAAIH;AAAA,kBACxK;AAAA,kBACA,MAAM,WAAW;AACb,yBAAK,OAAO;AACZ,wBAAIA,KAAI,KAAK,WAAW,CAAC,EAAE;AAC3B,wBAAI,YAAYA,GAAE,KAAM,OAAMA,GAAE;AAChC,2BAAO,KAAK;AAAA,kBAChB;AAAA,kBACA,mBAAmB,SAASE,IAAG;AAC3B,wBAAI,KAAK,KAAM,OAAMA;AACrB,wBAAIC,KAAI;AACR,6BAASF,GAAEA,IAAGG,IAAG;AACb,6BAAOG,GAAE,OAAO,SAASA,GAAE,MAAML,IAAGC,GAAE,OAAOF,IAAGG,OAAMD,GAAE,SAAS,QAAQA,GAAE,MAAMH,KACjF,CAAC,CAACI;AAAA,oBACN;AACA,6BAASC,KAAI,KAAK,WAAW,SAAS,GAAGA,MAAK,GAAG,EAAEA,IAAG;AAClD,0BAAIC,KAAI,KAAK,WAAWD,EAAC,GAAGE,KAAID,GAAE;AAClC,0BAAI,WAAWA,GAAE,OAAQ,QAAOL,GAAE,KAAK;AACvC,0BAAIK,GAAE,UAAU,KAAK,MAAM;AACvB,4BAAIE,KAAIJ,GAAE,KAAKE,IAAG,UAAU,GAAGI,KAAIN,GAAE,KAAKE,IAAG,YAAY;AACzD,4BAAIE,MAAKE,IAAG;AACR,8BAAI,KAAK,OAAOJ,GAAE,SAAU,QAAOL,GAAEK,GAAE,UAAU,IAAE;AACnD,8BAAI,KAAK,OAAOA,GAAE,WAAY,QAAOL,GAAEK,GAAE,UAAU;AAAA,wBACvD,WAAWE,IAAG;AACV,8BAAI,KAAK,OAAOF,GAAE,SAAU,QAAOL,GAAEK,GAAE,UAAU,IAAE;AAAA,wBACvD,OAAO;AACH,8BAAI,CAACI,GAAG,OAAM,IAAI,MAAM,wCAAwC;AAChE,8BAAI,KAAK,OAAOJ,GAAE,WAAY,QAAOL,GAAEK,GAAE,UAAU;AAAA,wBACvD;AAAA,sBACJ;AAAA,oBACJ;AAAA,kBACJ;AAAA,kBACA,QAAQ,SAASN,IAAGE,IAAG;AACnB,6BAASC,KAAI,KAAK,WAAW,SAAS,GAAGA,MAAK,GAAG,EAAEA,IAAG;AAClD,0BAAIF,KAAI,KAAK,WAAWE,EAAC;AACzB,0BAAIF,GAAE,UAAU,KAAK,QAAQG,GAAE,KAAKH,IAAG,YAAY,KAAK,KAAK,OAAOA,GAAE,YAAY;AAC9E,4BAAII,KAAIJ;AACR;AAAA,sBACJ;AAAA,oBACJ;AACA,oBAAAI,OAAM,YAAYL,MAAK,eAAeA,OAAMK,GAAE,UAAUH,MAAKA,MAAKG,GAAE,eAAeA,KAAI;AACvF,wBAAIC,KAAID,KAAIA,GAAE,aAAa,CAAC;AAC5B,2BAAOC,GAAE,OAAON,IAAGM,GAAE,MAAMJ,IAAGG,MAAK,KAAK,SAAS,QAAQ,KAAK,OAAOA,GAAE,YACvEY,MAAK,KAAK,SAASX,EAAC;AAAA,kBACxB;AAAA,kBACA,UAAU,SAASN,IAAGE,IAAG;AACrB,wBAAI,YAAYF,GAAE,KAAM,OAAMA,GAAE;AAChC,2BAAO,YAAYA,GAAE,QAAQ,eAAeA,GAAE,OAAO,KAAK,OAAOA,GAAE,MAAM,aAAaA,GAAE,QAAQ,KAAK,OAAO,KAAK,MAAMA,GAAE,KACzH,KAAK,SAAS,UAAU,KAAK,OAAO,SAAS,aAAaA,GAAE,QAAQE,OAAM,KAAK,OAAOA,KACtFe;AAAA,kBACJ;AAAA,kBACA,QAAQ,SAASjB,IAAG;AAChB,6BAASE,KAAI,KAAK,WAAW,SAAS,GAAGA,MAAK,GAAG,EAAEA,IAAG;AAClD,0BAAIC,KAAI,KAAK,WAAWD,EAAC;AACzB,0BAAIC,GAAE,eAAeH,GAAG,QAAO,KAAK,SAASG,GAAE,YAAYA,GAAE,QAAQ,GAAG,EAAEA,EAAC,GAAGc;AAAA,oBAClF;AAAA,kBACJ;AAAA,kBACA,OAAO,SAASjB,IAAG;AACf,6BAASE,KAAI,KAAK,WAAW,SAAS,GAAGA,MAAK,GAAG,EAAEA,IAAG;AAClD,0BAAIC,KAAI,KAAK,WAAWD,EAAC;AACzB,0BAAIC,GAAE,WAAWH,IAAG;AAChB,4BAAIC,KAAIE,GAAE;AACV,4BAAI,YAAYF,GAAE,MAAM;AACpB,8BAAIG,KAAIH,GAAE;AACV,4BAAEE,EAAC;AAAA,wBACP;AACA,+BAAOC;AAAA,sBACX;AAAA,oBACJ;AACA,0BAAM,IAAI,MAAM,uBAAuB;AAAA,kBAC3C;AAAA,kBACA,eAAe,SAASF,IAAGC,IAAGF,IAAG;AAC7B,2BAAO,KAAK,WAAW;AAAA,sBACnB,UAAU,EAAEC,EAAC;AAAA,sBACb,YAAYC;AAAA,sBACZ,SAASF;AAAA,oBACb,GAAG,WAAW,KAAK,WAAW,KAAK,MAAMD,KAAIiB;AAAA,kBACjD;AAAA,gBACJ,GAAGf;AAAA,cACP;AACA,uBAAS,EAAEF,IAAGE,IAAG;AACb,oBAAIC,KAAI,eAAe,OAAO,UAAUH,GAAE,OAAO,QAAQ,KAAKA,GAAE,YAAY;AAC5E,oBAAI,CAACG,IAAG;AACJ,sBAAI,MAAM,QAAQH,EAAC,MAAMG,KAAI,SAASH,IAAGE,IAAG;AACxC,wBAAI,CAACF,GAAG;AACR,wBAAI,YAAY,OAAOA,GAAG,QAAO,EAAEA,IAAGE,EAAC;AACvC,wBAAIC,KAAI,OAAO,UAAU,SAAS,KAAKH,EAAC,EAAE,MAAM,GAAG,EAAE;AACrD,iCAAaG,MAAKH,GAAE,gBAAgBG,KAAIH,GAAE,YAAY;AACtD,wBAAI,UAAUG,MAAK,UAAUA,GAAG,QAAO,MAAM,KAAKH,EAAC;AACnD,wBAAI,gBAAgBG,MAAK,2CAA2C,KAAKA,EAAC,EAAG,QAAO,EAAEH,IAAGE,EAAC;AAAA,kBAC9F,EAAEF,EAAC,MAAME,MAAKF,MAAK,YAAY,OAAOA,GAAE,QAAQ;AAC5C,oBAAAG,OAAMH,KAAIG;AACV,wBAAIF,KAAI,GAAGG,KAAI,WAAW;AAAA,oBAAC;AAC3B,2BAAO;AAAA,sBACH,GAAGA;AAAA,sBACH,GAAG,WAAW;AACV,+BAAOH,MAAKD,GAAE,SAAS;AAAA,0BACnB,MAAM;AAAA,wBACV,IAAI;AAAA,0BACA,MAAM;AAAA,0BACN,OAAOA,GAAEC,IAAG;AAAA,wBAChB;AAAA,sBACJ;AAAA,sBACA,GAAG,SAASD,IAAG;AACX,8BAAMA;AAAA,sBACV;AAAA,sBACA,GAAGI;AAAA,oBACP;AAAA,kBACJ;AACA,wBAAM,IAAI,UAAU,uIAAuI;AAAA,gBAC/J;AACA,oBAAIC,IAAGC,KAAI,MAAIC,KAAI;AACnB,uBAAO;AAAA,kBACH,GAAG,WAAW;AACV,oBAAAJ,KAAIA,GAAE,KAAKH,EAAC;AAAA,kBAChB;AAAA,kBACA,GAAG,WAAW;AACV,wBAAIA,KAAIG,GAAE,KAAK;AACf,2BAAOG,KAAIN,GAAE,MAAMA;AAAA,kBACvB;AAAA,kBACA,GAAG,SAASA,IAAG;AACX,oBAAAO,KAAI,MAAIF,KAAIL;AAAA,kBAChB;AAAA,kBACA,GAAG,WAAW;AACV,wBAAI;AACA,sBAAAM,MAAK,QAAQH,GAAE,UAAUA,GAAE,OAAO;AAAA,oBACtC,UAAE;AACE,0BAAII,GAAG,OAAMF;AAAA,oBACjB;AAAA,kBACJ;AAAA,gBACJ;AAAA,cACJ;AACA,uBAAS,EAAEL,IAAGE,IAAG;AACb,iBAAC,QAAQA,MAAKA,KAAIF,GAAE,YAAYE,KAAIF,GAAE;AACtC,yBAASG,KAAI,GAAGF,KAAI,IAAI,MAAMC,EAAC,GAAGC,KAAID,IAAGC,KAAK,CAAAF,GAAEE,EAAC,IAAIH,GAAEG,EAAC;AACxD,uBAAOF;AAAA,cACX;AACA,uBAAS,EAAED,IAAGE,IAAGC,IAAGF,IAAGG,IAAGC,IAAGC,IAAG;AAC5B,oBAAI;AACA,sBAAIC,KAAIP,GAAEK,EAAC,EAAEC,EAAC,GAAGE,KAAID,GAAE;AAAA,gBAC3B,SAASP,IAAG;AACR,yBAAO,KAAKG,GAAEH,EAAC;AAAA,gBACnB;AACA,gBAAAO,GAAE,OAAOL,GAAEM,EAAC,IAAI,QAAQ,QAAQA,EAAC,EAAE,KAAKP,IAAGG,EAAC;AAAA,cAChD;AACA,kBAAI,GAAG,GAAG,IAAIF,GAAE,gBAAgB;AAAA,gBAC5B,UAAU,SAASF,IAAGE,IAAGC,IAAGF,IAAGG,IAAG;AAC9B,sBAAIE,KAAI,KAAK,WAAWa,KAAIb,GAAE,MAAMM,KAAIN,GAAE,eAAeO,KAAIP,GAAE,SAASQ,KAAI,MAAMC,KAAIH,GAAEE,EAAC,GAAGE,KAAIhB,GAAE,KAAK,IAAI,EAAE,MAAM,KAAKM,IAAGQ,EAAC,GAAG,IAAIK,GAAE,UAAU,KAAK,MAAMnB,IAAG,EAAE,UAAU,KAAKM,EAAC,GAAG,GAAGa,EAAC;AACtL,sBAAI,WAAW,EAAG,QAAO;AACzB,sBAAIH,OAAM,EAAE,KAAK,aAAaA,OAAM,EAAE,KAAK,UAAU,EAAE,UAAUA,OAAM,EAAE,KAAK,oBAAoBhB,GAAE,WAAWgB,OAAM,EAAE,KAAK,KAAK,EAAE,WAAWF,IAAI,CAAAd,GAAE,eAAe,GACnK,EAAE,aAAa,KAAKM,IAAGQ,IAAGE,IAAG,CAAC,IAAI,GAAG,EAAE,aAAaF,IAAG,EAAE,UAAU,KAAKR,IAAG,IAAE,GAAGO,GAAE,GAAGb,IAAGc,GAAE,UAAU,UAAU,MAAM,EAAE,UAAU,KAAKR,EAAC,EAAE,KAAK,EAAE,CAAC;AAAA,2BAAYU,OAAM,EAAE,KAAK,OAAOA,OAAM,EAAE,KAAK,UAAU;AACnM,oBAAAhB,GAAE,eAAe;AACjB,wBAAI,IAAI,EAAE,SAAS,KAAKM,IAAG,EAAE,qBAAqB,KAAKA,EAAC,CAAC;AACzD,sBAAE,MAAM,KAAKA,IAAGQ,IAAGd,GAAE,WAAW,EAAE,QAAQ,GAAG,GAAG,IAAE;AAAA,kBACtD,MAAO,CAAAgB,OAAM,EAAE,KAAK,QAAQ,CAAChB,GAAE,YAAYgB,OAAM,EAAE,KAAK,UAAUhB,GAAE,eAAe,GACnF,EAAE,MAAM,KAAKM,IAAGQ,IAAG,GAAGd,GAAE,WAAW,EAAE,QAAQ,GAAG,IAAE,KAAKmB,GAAE,gBAAgBH,OAAM,EAAE,KAAK,UAAU,SAAOhB,GAAE,WAAW,GACpH,EAAE,UAAUc,IAAG,MAAI,OAAIR,GAAE,UAAU,MAAM,EAAE,CAAC,GAAGS,GAAE,QAAQ,OAAO,KAAKC,OAAM,EAAE,KAAK,UAAUhB,GAAE,YAAYA,GAAE,WAAW,WAAWM,GAAE,YAAY,aAAa,SAAOa,GAAE,cAAcH,OAAM,EAAE,KAAK,MAAM,SAAOhB,GAAE,YAAY,EAAE,MAAM,EAAE,aAAa,KAAKM,IAAG,EAAE,KAAK,IAAE,GACpQ,SAAO,EAAE,QAAQ,KAAKA,IAAG,EAAE,MAAM,CAAC,EAAE,MAAM,UAAU,EAAE,OAAO,EAAE,QAAQ,EAAE,aAAa,KAAKA,IAAG,EAAE,KAAK,IAAE,GACvG,EAAE,SAAS,KAAK,EAAE,MAAM,MAAMN,GAAE,eAAe,GAAG,EAAE,MAAM,KAAKM,IAAGQ,IAAG,EAAE,OAAO,EAAE,GAAG,OAAO,EAAE,QAAQ,EAAE,SAAS,KAAKR,IAAG,EAAE,OAAO,IAAE,GAClI,EAAE,MAAM,EAAE,SAAS,KAAKA,IAAG,EAAE,OAAO,IAAE,GAAG,EAAE,MAAMO,GAAE,cAAc,EAAE,OAAO,EAAE,SAASA,GAAE,eAAeb,GAAE,eAAe,GACvH,EAAE,MAAM,KAAKM,IAAGQ,IAAG,EAAE,OAAO,EAAE,GAAG,MAAMd,GAAE,aAAamB,GAAE,oBAAoB,UAAOA,GAAE,aAAaH,OAAM,EAAE,KAAK,aAAa,WAAY,WAAW;AAC/I,wBAAIhB,KAAI,EAAE,MAAM,KAAKM,IAAGQ,EAAC;AACzB,sBAAE,MAAM,KAAKR,IAAGQ,IAAGd,GAAE,KAAK;AAAA,kBAC9B,GAAI,CAAC,IAAIgB,OAAM,EAAE,KAAK,aAAa,WAAY,WAAW;AACtD,wBAAIhB,KAAI,EAAE,kBAAkB,KAAKM,IAAGQ,GAAE,UAAU,SAAS,KAAK;AAC9D,sBAAE,kBAAkB,KAAKR,IAAGQ,GAAE,UAAU,SAAS,GAAG;AACpD,oBAAAR,GAAE,QAAQ,EAAE,MAAM,KAAKA,IAAGQ,IAAGd,MAAKA,OAAMa,GAAE,aAAa,IAAI,EAAE,IAAI,EAAE,MAAM,KAAKP,IAAGQ,IAAGd,MAAK,MAAMA,KAAI,IAAI,EAAE;AAAA,kBAC7G,GAAI,CAAC,IAAI,WAAWM,GAAE,gBAAgBA,GAAE,aAAaN,EAAC,KAAK,EAAE,YAAY,KAAKM,IAAG,CAAC,IAAIa,GAAE,aAAa,CAACA,GAAE,cAAcA,GAAE,aAAa,CAACA,GAAE,YACxI,EAAE,MAAM,KAAKb,IAAGQ,IAAG,EAAE,OAAO,EAAE,KAAK;AACnC,yBAAOR,GAAE,cAAcU,MAAK,EAAE,KAAK,WAAWA,MAAK,EAAE,KAAK,cAAcV,GAAE,YAAYU,GAAE,SAAS,KAAK,EAAE,eAAeF,GAAE,QAAQ,YAAY,KAAKE,MAAK,EAAE,KAAK,QAC9J,EAAE,cAAc,KAAK,MAAMhB,IAAGE,IAAGC,IAAGF,IAAGG,EAAC;AAAA,gBAC5C;AAAA,gBACA,eAAe,SAASJ,IAAGE,IAAGC,IAAGF,IAAGG,IAAG;AACnC,sBAAIC,KAAI,KAAK,aAAa,MAAMC,KAAID,GAAE,MAAMI,KAAIJ,GAAE,eAAec,KAAId,GAAE,SAASO,KAAIP,GAAE,IAAIQ,KAAIJ,GAAEG,EAAC,GAAGE,KAAId,GAAE;AAC1G,sBAAI,SAAOE,MAAKF,GAAE,WAAWA,GAAE,UAAU,CAACK,GAAE,aAAa,EAAEL,GAAE,WAAWA,GAAE,WAAWK,GAAE,YAAY;AAC/F,wBAAIS,IAAG;AACH,0BAAIC,IAAGC,KAAId,KAAI;AAAA,wBACX,OAAOE;AAAA,wBACP,KAAKA;AAAA,sBACT,IAAI,EAAE,MAAM,KAAKC,IAAGO,EAAC;AACrB,sBAAAV,OAAMY,KAAIR,GAAE,YAAYQ,EAAC,KAAKA,KAAIK,GAAE,iBAAiB;AACrD,0BAAIF,KAAI,EAAE,QAAQ,KAAKZ,IAAGW,IAAGF,IAAGb,IAAG,QAAQ,QAAQ,QAAQC,EAAC;AAC5D,0BAAI,UAAOe,OAAM,EAAE,aAAa,KAAKZ,IAAG,IAAE,GAAGU,KAAI,WAAWE,GAAE,QAAQA,GAAE,QAAQ,EAAE,SAAS,KAAKZ,IAAGY,GAAE,IAAI,QAAQA,GAAE,IAAI,QAAQA,GAAE,GAAG,GACpIE,GAAE,IAAIJ,KAAIA,KAAIT,GAAE,gBAAgB,WAAWW,GAAE,QAAQ,EAAE,aAAa,KAAKZ,IAAGU,EAAC,IAAIA,IACjF,UAAOZ,OAAM,WAAY,WAAW;AAChC,wBAAAG,GAAE,gBAAgB,KAAKM,IAAGE,IAAGG,EAAC;AAAA,sBAClC,GAAI,CAAC,GAAGE,GAAE,kBAAkB,UAAOF,KAAI;AACnC,4BAAI,IAAI,EAAE,UAAU,KAAKZ,EAAC;AAC1B,yBAAC,GAAG,EAAE,aAAaO,IAAG,GAAGG,IAAGf,IAAG,SAAOE,EAAC;AAAA,sBAC3C;AACA,0BAAIF,GAAE,eAAe,GAAGE,GAAG,QAAO,UAAOe,OAAMA,GAAE,kBAAkBF,KAAIE;AAAA,oBAC3E;AAAA,kBACJ,MAAO,CAAAH,OAAM,EAAE,KAAK,SAAST,GAAE,cAAcA,GAAE,UAAU,IAAE,MAAMA,GAAE,YAAYA,GAAE,UAAU,IAAE,GAC7F,WAAY,WAAW;AACnB,oBAAAQ,GAAE,QAAQ,QAAQ;AAAA,kBACtB,GAAI,CAAC;AAAA,gBACT;AAAA,gBACA,aAAa,IAAI,EAAE,EAAE,KAAM,SAASb,GAAEE,IAAG;AACrC,sBAAIC,IAAGF,IAAGG,IAAGC,IAAGG,IAAGG;AACnB,yBAAO,EAAE,EAAE,KAAM,SAASX,IAAG;AACzB,8BAAS,SAAQA,GAAE,OAAOA,GAAE,MAAM;AAAA,sBAChC,KAAK;AACH,wBAAAG,KAAI,SAASH,IAAGG,IAAGF,IAAGG,IAAGE,IAAG;AACxB,8BAAIE,KAAI,EAAE,MAAM,KAAKR,IAAGG,IAAG,QAAQ,QAAQ,IAAE,GAAGQ,KAAIV,GAAE,OAAO,GAAGO,GAAE,KAAK,GAAGC,KAAIR,GAAE,OAAOO,GAAE,KAAKP,GAAE,MAAM;AACtG,8BAAIU,OAAMX,GAAE,QAAQ,EAAE,kBAAkB,KAAKA,EAAC,EAAE,MAAM,EAAE,QAAQ,IAAI,EAAE,kBAAkB,KAAKA,EAAC,GAAG,MAAM,GAAGQ,GAAE,KAAK,EAAE,KAAK,EAAE,MAAMG,KAAI,KACpIF,OAAMT,GAAE,QAAQ,EAAE,kBAAkB,KAAKA,EAAC,EAAE,MAAM,EAAE,QAAQ,IAAI,EAAE,kBAAkB,KAAKA,EAAC,GAAG,MAAMQ,GAAE,GAAG,EAAE,KAAK,EAAE,MAAMC,KAAI,KAC3HL,KAAIO,KAAIP,KAAIK,IAAGT,GAAE,SAAS,SAAOK,GAAE,cAAc;AAC7C,4BAAAD,KAAIA,GAAE,MAAM,EAAE;AACd,gCAAIe,IAAGN,KAAI,EAAE,EAAE,kBAAkB,KAAKb,EAAC,CAAC;AACxC,gCAAI;AACA,mCAAKa,GAAE,EAAE,GAAG,EAAEM,KAAIN,GAAE,EAAE,GAAG,QAAQ;AAC7B,oCAAIC,KAAIK,GAAE;AACV,gCAAAf,GAAE,CAAC,MAAMU,MAAKV,GAAE,MAAM;AAAA,8BAC1B;AAAA,4BACJ,SAASJ,IAAG;AACR,8BAAAa,GAAE,EAAEb,EAAC;AAAA,4BACT,UAAE;AACE,8BAAAa,GAAE,EAAE;AAAA,4BACR;AACA,4BAAAT,KAAIA,GAAE,QAAQ,EAAE,KAAK,EAAE;AAAA,0BAC3B;AACA,8BAAIW,KAAIX;AACR,8BAAI,cAAc,OAAOE,IAAG;AACxB,gCAAI,WAAQS,KAAIT,GAAE,KAAKN,IAAGe,IAAGV,EAAC,GAAI,QAAO;AACzC,4BAAAU,OAAMA,KAAId;AAAA,0BACd;AACA,2BAAC,GAAG,EAAE,UAAUE,IAAG,MAAI,OAAIY,GAAE,SAAS,EAAE,MAAM,EAAE,GAAGb,EAAC;AAAA,wBACxD,GAAGD,KAAI,MAAMG,KAAI,KAAK,WAAWC,KAAID,GAAE,MAAMI,KAAIJ,GAAE,UAAU,IAAE,GAAGA,GAAE,iBAAiB,MACrFF,GAAE,iBAAiBA,GAAE,cAAc,UAAUS,KAAIT,GAAE,cAAc,QAAQ,YAAY,IAAI,EAAE,QAAQ,iBAAiB,EAAE,QAAQ,cAAc,YAAYS,KAAI,EAAE,QAAQ,cAAc,QAAQ,MAAM,IAClMR,GAAEC,IAAGH,IAAGO,IAAGG,IAAGN,GAAE,aAAa,GAAGH,GAAE,eAAe;AAAA,sBAEnD,KAAK;AAAA,sBACL,KAAK;AACH,+BAAOF,GAAE,KAAK;AAAA,oBAClB;AAAA,kBACJ,GAAIA,IAAG,IAAI;AAAA,gBACf,CAAE,GAAG,IAAI,WAAW;AAChB,sBAAIA,KAAI,MAAME,KAAI;AAClB,yBAAO,IAAI,QAAS,SAASC,IAAGF,IAAG;AAC/B,wBAAIG,KAAI,EAAE,MAAMJ,IAAGE,EAAC;AACpB,6BAASG,GAAEL,IAAG;AACV,wBAAEI,IAAGD,IAAGF,IAAGI,IAAGC,IAAG,QAAQN,EAAC;AAAA,oBAC9B;AACA,6BAASM,GAAEN,IAAG;AACV,wBAAEI,IAAGD,IAAGF,IAAGI,IAAGC,IAAG,SAASN,EAAC;AAAA,oBAC/B;AACA,oBAAAK,GAAE,MAAM;AAAA,kBACZ,CAAE;AAAA,gBACN,GAAG,SAASL,IAAG;AACX,yBAAO,EAAE,MAAM,MAAM,SAAS;AAAA,gBAClC;AAAA,gBACA,oBAAoB,SAASA,IAAG;AAC5B,sBAAIE,KAAI,KAAK,WAAWC,KAAID,GAAE,MAAMD,KAAIC,GAAE;AAC1C,sBAAIE,IAAGE,KAAI,MAAMK,KAAIL,GAAE,UAAU,UAAU,IAAE,GAAGa,MAAKjB,GAAE,QAAQ,EAAE,UAAU,KAAKA,EAAC,EAAE,MAAM,EAAE,QAAQ,IAAI,EAAE,UAAU,KAAKA,EAAC,GAAG,KAAK,EAAE,GAAGU,KAAI,EAAE,MAAM,KAAKV,IAAGI,IAAG,QAAQ,QAAQ,IAAE;AAC/K,sBAAIa,OAAMR,IAAG;AACT,wBAAIP,KAAI,SAASJ,IAAGC,IAAGG,IAAG;AACtB,+BAASC,IAAGC,IAAGC,IAAGC,KAAIR,GAAE,OAAO,GAAGI,GAAE,KAAK,EAAE,MAAM,EAAE,GAAGO,KAAIX,GAAE,OAAOI,GAAE,KAAK,EAAE,MAAM,EAAE,GAAGe,KAAIlB,GAAE,OAAO,GAAGG,GAAE,KAAK,EAAE,MAAM,EAAE,GAAGQ,KAAIX,GAAE,OAAOG,GAAE,KAAK,EAAE,MAAM,EAAE,GAAGS,KAAIL,GAAE,UAAUW,GAAE,SAASX,GAAE,SAASW,GAAE,QAAQL,KAAIH,GAAE,UAAUC,GAAE,SAASD,GAAE,SAASC,GAAE,QAAQG,KAAI,IAAIC,KAAI,CAAC,GAAGC,KAAI,KAAKT,GAAE,SAASK,KAAK,CAAAL,GAAE,KAAKS,EAAC;AAC7S,6BAAME,GAAE,SAASN,KAAK,CAAAM,GAAE,KAAKF,EAAC;AAC9B,6BAAMN,GAAE,SAASG,KAAK,CAAAH,GAAE,QAAQM,EAAC;AACjC,6BAAML,GAAE,SAASE,KAAK,CAAAF,GAAE,QAAQK,EAAC;AACjC,0BAAI,IAAIT,GAAE,OAAOG,EAAC,GAAG,IAAIQ,GAAE,OAAOP,EAAC;AACnC,2BAAKN,KAAI,GAAGD,KAAI,EAAE,QAAQC,KAAID,IAAGC,KAAK,SAAQC,KAAI,EAAE,eAAe,KAAKL,IAAG,EAAE,kBAAkB,KAAKA,IAAGI,EAAC,CAAC,GACzGS,IAAG;AAAA,wBACD,KAAK;AACH,4BAAET,KAAI,CAAC,MAAM,EAAEA,EAAC,KAAKF,GAAE,SAAS,EAAE,SAAS,KAAKY,GAAE,KAAK,EAAEV,EAAC,CAAC,GAAGA,KAAID;AAClE;AAAA,wBAEF,KAAK;AAAA,wBACL,KAAK;AACH,4BAAEC,EAAC,MAAMW,KAAIb,GAAE,QAAQE,KAAID;AAC3B;AAAA,wBAEF;AACE,4BAAEC,EAAC,MAAM,EAAEA,EAAC,MAAM,EAAEA,KAAI,CAAC,MAAMW,MAAK,EAAEX,KAAI,CAAC,MAAMC,MAAK,WAAW,EAAED,KAAI,CAAC,MAAM,EAAEA,EAAC,MAAMC,MAAK,EAAED,KAAI,CAAC,MAAMW,OAAM,EAAEX,EAAC,MAAMW,KAAI,EAAEX,KAAI,CAAC,MAAMW,MAAK,EAAEX,EAAC,MAAM,EAAEA,KAAI,CAAC,KAAKS,KAAI,cACvKC,GAAE,KAAK,EAAEV,EAAC,CAAC,GAAGF,GAAE,SAASA,GAAE,SAAS,EAAEE,EAAC,MAAMC,MAAK,EAAED,EAAC,MAAMW,OAAM,EAAEX,KAAI,CAAC,MAAMW,MAAK,EAAEX,EAAC,MAAM,EAAEA,EAAC,KAAK,EAAEA,KAAI,CAAC,MAAM,EAAEA,KAAI,CAAC,MAAMS,KAAI,yBAClIC,GAAE,KAAK,EAAEV,EAAC,CAAC,GAAGF,GAAE,WAAW,EAAEE,EAAC,MAAMW,MAAKF,KAAI,0BAA0B,EAAE,OAAO,KAAKb,IAAG,EAAE,kBAAkB,KAAKA,IAAGI,EAAC,GAAG,IAAE,KAAK,EAAEA,EAAC,MAAMH,GAAE,eAAeC,GAAE,SAASE,KAAID,MAAKU,KAAI,cACjLC,GAAE,KAAK,EAAEV,EAAC,CAAC,GAAGF,GAAE,SAASA,GAAE;AAAA,sBAC/B;AACA,6BAAO;AAAA,wBACH,QAAQW;AAAA,wBACR,MAAMC;AAAA,wBACN,OAAOZ;AAAA,sBACX;AAAA,oBACJ,EAAEO,IAAGQ,IAAGP,EAAC,IAAIN,GAAE,UAAU,cAAcA,GAAE,eAAe,kBAAkBA,MAAKA,GAAE,MAAM,IACtF,GAAG,EAAE,aAAaA,IAAG,EAAE,UAAU,KAAKJ,EAAC,CAAC,GAAG,EAAE,MAAM,KAAKA,IAAGI,IAAGM,GAAE,OAAOA,GAAE,KAAK,IAAE,GACjF,CAAC,EAAE,UAAUV,GAAE,kBAAkB,iBAAiBF,GAAE,aAAa,iBAAiBI,GAAE,UAAUF,GAAE,YAAa,QAAO;AACpH,4BAAQ,4BAA4BF,GAAE,aAAa,iBAAiBI,GAAE,UAAUF,GAAE,cAAcA,GAAE,iBAAiB,OAAKA,GAAE,iBAAiB,OAC3IE,GAAE,QAAQ;AAAA,sBACR,KAAK;AAAA,sBACL,KAAK;AACH,wBAAAA,GAAE,KAAK,QAAS,SAASJ,IAAGG,IAAG;AAC3B,8BAAIC,KAAI,IAAIH,GAAE,MAAM,UAAU;AAC9B,0BAAAG,GAAE,MAAMJ,IAAGE,GAAE,YAAY,OAAI,EAAE,cAAc,KAAKI,IAAGF,EAAC;AAAA,wBAC1D,CAAE,GAAG,WAAY,WAAW;AACxB,0BAAAF,GAAE,IAAI,QAAQ,OAAO;AAAA,wBACzB,GAAI,CAAC;AACL;AAAA,sBAEF,KAAK;AACH,4BAAIW,KAAI,IAAIZ,GAAE,MAAM,SAAS;AAC7B,wBAAAY,GAAE,MAAM,EAAE,KAAK,WAAW,EAAE,SAAS,KAAKP,IAAGO,EAAC;AAC9C;AAAA,sBAEF;AACE,yBAAC,GAAG,EAAE,iBAAiBP,IAAGK,EAAC,GAAG,EAAE,MAAM,KAAKT,IAAGI,IAAGM,GAAE,OAAOA,GAAE,KAAK,IAAE;AAAA,oBACvE;AACA,oBAAAZ,GAAE,eAAe;AAAA,kBACrB;AAAA,gBACJ;AAAA,gBACA,eAAe,SAASA,IAAG;AACvB,sBAAIE,KAAI,KAAK,WAAWC,KAAID,GAAE,eAAeD,KAAI,MAAMG,KAAIJ,MAAKA,GAAE,SAASA,GAAE,OAAO,CAAC,IAAI,UAAU,CAAC;AACpG,6BAAWI,OAAMA,KAAIH,GAAE,UAAU,UAAU,IAAE,KAAK,GAAG,EAAE,iBAAiBA,IAAGG,IAAG,IAAID,GAAE,MAAM,OAAO,CAAC,IACjGH,GAAE,UAAU,WAAWA,GAAE,OAAO,CAAC,KAAK,WAAW,UAAU,CAAC,MAAM,EAAE,MAAM,KAAKE,IAAGD,IAAGD,GAAE,SAASA,GAAE,OAAO,CAAC,IAAI,UAAU,CAAC,CAAC;AAAA,gBAC/H;AAAA,gBACA,YAAY,SAASA,IAAG;AACpB,sBAAIE,KAAI,KAAK,WAAWC,KAAID,GAAE,MAAMD,KAAIC,MAAKA,GAAE,UAAU;AACzD,kBAAAC,GAAE,mBAAmBF,OAAM,EAAE,UAAU,KAAKC,EAAC,EAAE,KAAK,EAAE,MAAM,GAAG,EAAE,aAAa,MAAM,EAAE,UAAU,KAAKA,EAAC,GAAG,EAAE,SAAS,KAAKA,IAAG,EAAE,qBAAqB,KAAKA,EAAC,CAAC,CAAC,GAC3J,SAAOC,GAAE,sBAAsB,UAAOD,GAAE,cAAc,EAAE,WAAW,KAAKA,IAAG,EAAE,UAAU,KAAKA,EAAC,CAAC,KAAK,OAAO,EAAE,qBAAqB,KAAKA,EAAC,KAAK,EAAE,WAAW,MAAM,MAAM,CAAEF,IAAG,IAAG,CAAC,GAC9KE,GAAE,YAAYA,MAAKA,GAAE,UAAU,IAAE;AAAA,gBACrC;AAAA,gBACA,cAAc,SAASF,IAAG;AACtB,uBAAK,UAAU,kBAAkB;AAAA,gBACrC;AAAA,gBACA,iBAAiB,WAAW;AACxB,sBAAIA,KAAI,KAAK,WAAWE,KAAIF,GAAE,MAAMG,KAAI;AACxC,kBAAAH,GAAE,aAAa,OAAIE,GAAE,yBAAyBC,GAAE,UAAU,cAAcA,GAAE,eAAe,kBAAkBA,OAAM,GACjH,EAAE,yBAAyBA,IAAGH,GAAE,mBAAmB;AAAA,gBACvD;AAAA,gBACA,YAAY,SAASA,IAAGE,IAAG;AACvB,sBAAIC,KAAI,KAAK;AACb,kBAAAA,GAAE;AACF,sBAAIF,KAAI;AACR,uBAAKA,GAAE,UAAU,cAAcA,GAAE,eAAe,kBAAkBA,IAAG;AACjE,wBAAIG,KAAI,EAAE,0BAA0B,KAAKD,IAAG,EAAE,MAAM,KAAKA,IAAGF,EAAC,GAAGC,EAAC;AACjE,+BAAWE,MAAK,EAAE,MAAM,KAAKD,IAAGF,IAAGG,EAAC;AAAA,kBACxC;AAAA,gBACJ;AAAA,gBACA,UAAU,SAASJ,IAAG;AAClB,sBAAIE,KAAI,KAAK,WAAWC,KAAID,GAAE,SAASD,KAAI,MAAMG,KAAI,EAAE,MAAM,KAAKF,IAAGD,EAAC,GAAGI,KAAIH,GAAE,QAAQ,EAAE,UAAU,KAAKA,EAAC,EAAE,MAAME,GAAE,KAAKA,GAAE,KAAK,IAAI,EAAE,UAAU,KAAKF,EAAC,EAAE,MAAME,GAAE,OAAOA,GAAE,GAAG,GAAGK,KAAIP,GAAE,QAAQG,GAAE,QAAQ,EAAE,KAAK,EAAE,IAAIA,GAAE,KAAK,EAAE;AAC5N,oBAAE,QAAQ,aAAa,EAAE,QAAQ,UAAU,YAAY,EAAE,QAAQ,UAAU,UAAU,UAAUI,EAAC,IAAI,EAAE,QAAQ,iBAAiB,EAAE,QAAQ,cAAc,WAAW,EAAE,QAAQ,cAAc,QAAQ,QAAQA,EAAC,GAC3M,EAAE,aAAa,KAAKP,IAAGD,IAAG,EAAE,KAAK,QAAQG,EAAC,IAAI,GAAG,EAAE,aAAaH,IAAG,EAAE,UAAU,KAAKC,EAAC,GAAGC,GAAE,GAAGH,IAAGE,GAAE,cAAcA,GAAE,UAAU,IAAE,CAAC;AAAA,gBACnI;AAAA,gBACA,WAAW,SAASF,IAAG;AACnB,sBAAIE,KAAI,KAAK,WAAWC,KAAID,GAAE,MAAMD,KAAIC,GAAE;AAC1C,kBAAAA,GAAE,UAAU;AACZ,sBAAIE,KAAIH,GAAE,IAAI,GAAGI,KAAI;AACrB,sBAAIA,GAAE,WAAW;AACb,qBAAC,GAAG,EAAE,yBAAyBA,IAAGH,GAAE,mBAAmB;AACvD,wBAAII,KAAID,GAAE,UAAU,UAAU,GAAGG,KAAI,EAAE,UAAU,KAAKN,EAAC,EAAE,MAAM;AAC/D,2BAAOI,OAAMH,GAAE,yBAAyB,OAAO,EAAE,qBAAqB,KAAKD,EAAC,KAAKI,OAAM,EAAE,kBAAkB,KAAKJ,EAAC,EAAE,KAAK,EAAE,IAAIM,KAAI,CAAC,IAAI,EAAE,kBAAkB,KAAKN,IAAGM,EAAC,IACpK,UAAO,EAAE,WAAW,KAAKN,IAAGM,EAAC,MAAM,WAAY,WAAW;AACtD,sBAAAJ,GAAE,QAAQ,YAAY;AAAA,oBAC1B,GAAI,CAAC,GAAGD,GAAE,oBAAoB,EAAE,aAAa,KAAKD,IAAG,KAAE,GAAGM,KAAIL,GAAE,uBAAuB,CAAC,IAAI,EAAE,kBAAkB,KAAKD,EAAC,EAAE,MAAM,MAC7H,GAAG,EAAE,aAAaG,IAAGG,IAAG,QAAQR,EAAC,IAAIM,KAAIJ,GAAE,UAAU,IAAE,GAAGA,GAAE,cAAcI,OAAM,MAAMA,MAAKJ,GAAE,aAAa,EAAE,kBAAkB,KAAKA,EAAC,EAAE,KAAK,EAAE,KAAKA,GAAE,aAAa,EAAE,kBAAkB,KAAKA,EAAC,EAAE,KAAK,EAAE,KAAKA,GAAE,QAAQ,eAAe,SAAS,OAAOA,GAAE,YAAYI,IACjQF,GAAE,QAAQ,QAAQ;AAAA,kBACtB;AAAA,gBACJ;AAAA,gBACA,iBAAiB,WAAW;AACxB,sBAAIJ,KAAI,KAAK,WAAWE,KAAIF,GAAE,KAAK,iBAAiBG,KAAI;AACxD,sBAAIH,GAAE,aAAa,OAAKG,GAAE,UAAU,cAAcA,GAAE,eAAe,kBAAkBA,IAAG;AACpF,wBAAIF,MAAKD,GAAE,QAAQ,EAAE,kBAAkB,KAAKA,EAAC,EAAE,MAAM,EAAE,QAAQ,IAAI,EAAE,kBAAkB,KAAKA,EAAC,GAAG,KAAK,EAAE;AACvG,oBAAAE,OAAM,GAAG,EAAE,yBAAyBC,IAAGF,EAAC;AAAA,kBAC5C;AAAA,gBACJ;AAAA,gBACA,aAAa,WAAW;AACpB,sBAAID,KAAI,KAAK,WAAWE,KAAIF,GAAE;AAC9B,kBAAAA,GAAE,cAAcA,GAAE,UAAU,IAAE,KAAKA,GAAE,IAAI,QAAQ,QAAQ,GAAG,OAAO,EAAE,qBAAqB,KAAKA,EAAC,KAAKA,GAAE,aAAaA,GAAE,UAAU,MAAM,EAAE,kBAAkB,KAAKA,EAAC,EAAE,KAAK,EAAE,KAAKA,GAAE,UAAU,EAAE,GAC5LE,GAAE,mBAAmB,UAAO,EAAE,WAAW,KAAKF,IAAG,EAAE,UAAU,KAAKA,EAAC,CAAC,KAAKA,GAAE,UAAU,EAAE,GACvFE,GAAE,uBAAuBF,GAAE,UAAUA,GAAE,cAAc,GAAG,IAAE,GAAG,WAAY,WAAW;AAChF,qBAAC,GAAG,EAAE,aAAaA,GAAE,IAAI,EAAE,UAAU,KAAKA,EAAC,CAAC;AAAA,kBAChD,GAAI,CAAC;AAAA,gBACT;AAAA,gBACA,YAAY,WAAW;AACnB,sBAAIA,KAAI,KAAK;AACb,kBAAAA,GAAE,eAAe,MAAI,WAAY,WAAW;AACxC,qBAAC,GAAG,EAAE,iBAAiBA,GAAE,IAAIA,GAAE,UAAU,IAAE,CAAC;AAAA,kBAChD,GAAI,CAAC;AAAA,gBACT;AAAA,cACJ;AAAA,YACJ;AAAA,YACA,MAAM,SAASA,IAAGE,IAAGC,IAAG;AACpB,qBAAO,eAAeD,IAAG,cAAc;AAAA,gBACnC,OAAO;AAAA,cACX,CAAC,GAAGA,GAAE,aAAa;AACnB,kBAAID,IAAG,IAAIE,GAAE,IAAI,GAAG,KAAKF,KAAIE,GAAE,IAAI,MAAMF,GAAE,aAAaA,KAAI;AAAA,gBACxD,SAASA;AAAA,cACb,GAAG,IAAIE,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI;AAC1B,cAAAD,GAAE,aAAa;AAAA,gBACX,IAAI,SAASF,IAAGE,IAAGC,IAAG;AAClB,sBAAIF,KAAID,GAAE,UAAU,eAAe,IAAI,SAASE,IAAG;AAC/C,oBAAAA,GAAE,kBAAkBA,KAAIA,GAAE,iBAAiBA,IAAG,UAAU,CAAC,IAAIA;AAC7D,wBAAIM,IAAG,IAAI,MAAM,IAAI,EAAE,WAAW,IAAI,IAAI,EAAE,OAAO;AACnD,wBAAI,WAAW,KAAK,WAAW,KAAK,UAAU;AAC1C,0BAAI,IAAIP,GAAE,KAAK,GAAG,iBAAiB;AACnC,sBAAAA,GAAE,CAAC,EAAE,IAAI,GAAG,KAAK,IAAI,EAAE,QAAQ,CAAC,EAAE,KAAK,CAAC;AAAA,oBAC5C,OAAO;AACH,0BAAI,CAAE,UAAU,SAAS,UAAW,EAAE,SAASC,GAAE,IAAI,KAAK,WAAW,KAAK,YAAY,EAAE,EAAE,YAAY,EAAE,YAAY,EAAE,cAAcA,GAAE,QAAQA,GAAE,WAAWA,GAAE,QAAQ,EAAE,KAAK,KAAK,UAAO,EAAE,cAAcA,GAAE,QAAQ,EAAE,KAAK,OAAO;AAC5N,gCAAQA,GAAE,MAAM;AAAA,0BACd,KAAK;AACH,gCAAI,SAAO,EAAE,eAAgB,QAAO,EAAE,iBAAiB,OAAIA,GAAE,eAAe;AAC5E;AAAA,0BAEF,KAAK;AAAA,0BACL,KAAK;AACH,mCAAO,EAAE,mBAAmB,EAAE,kBAAkB,OAAIF,GAAE,KAAK,IAAI,GAAG,EAAE,yBAAyBA,KAAI,EAAE,QAAQ,EAAE,kBAAkB,KAAK,CAAC,EAAE,MAAM,EAAE,QAAQ,IAAI,EAAE,kBAAkB,KAAK,CAAC,GAAG,KAAK,EAAE,CAAC,GAChM,WAAY,WAAW;AACnB,8BAAAA,GAAE,MAAM;AAAA,4BACZ,GAAI,EAAE,sBAAsB,GAAG,UAAOQ,KAAI,WAAW,KAAK,WAAY,WAAW;AAC7E,8BAAAR,GAAE,aAAaG,GAAE,MAAM,GAAGK,EAAC;AAAA,4BAC/B,GAAI,CAAC;AAAA,wBACT;AACA,4BAAI,IAAIL,GAAE,MAAM,GAAG,SAAS;AAC5B,+BAAO,UAAO,MAAMD,GAAE,eAAe,GAAGA,GAAE,gBAAgB,IAAI;AAAA,sBAClE;AACA,sBAAAA,GAAE,eAAe;AAAA,oBACrB;AAAA,kBACJ;AACA,mBAAE,UAAU,OAAQ,EAAE,SAASA,EAAC,KAAK,IAAI,EAAE,KAAKF,EAAC,GAAG,SAASA,GAAE,QAAQC,GAAED,GAAE,IAAI,EAAE,GAAGE,IAAG,CAAC,KAAKD,GAAED,EAAC,EAAE,GAAGE,IAAG,CAAC,GACzGF,GAAE,UAAU,OAAOE,EAAC,IAAIF,GAAE,UAAU,OAAOE,EAAC,KAAK,CAAC,GAAGF,GAAE,UAAU,OAAOE,EAAC,EAAE,KAAK,CAAC;AAAA,gBACrF;AAAA,gBACA,KAAK,SAASF,IAAGE,IAAG;AAChB,sBAAIF,GAAE,aAAaA,GAAE,UAAU,QAAQ;AACnC,wBAAIG,KAAIH,GAAE,UAAU,eAAeC,KAAID,GAAE,UAAU;AACnD,6BAASI,MAAKF,QAAOD,KAAI,CAAC,GAAGC,EAAC,IAAIF,GAAE,UAAU,OAAOE,EAAC,IAAID,IAAG;AACzD,+BAASI,KAAIJ,GAAEG,EAAC,GAAGC,GAAE,SAAS,KAAK;AAC/B,4BAAIC,KAAID,GAAE,IAAI;AACd,yBAAE,UAAU,OAAQ,EAAE,SAASD,EAAC,IAAI,SAASJ,GAAE,QAAQG,GAAEH,GAAE,IAAI,EAAE,IAAII,IAAGE,EAAC,IAAIH,GAAEH,EAAC,EAAE,IAAII,IAAGE,EAAC;AAAA,sBAC9F;AACA,6BAAON,GAAE,UAAU,OAAOI,EAAC;AAAA,oBAC/B;AAAA,kBACJ;AAAA,gBACJ;AAAA,cACJ;AAAA,YACJ;AAAA,YACA,KAAK,SAASJ,IAAGE,IAAGC,IAAG;AACnB,kBAAIF,KAAI,EAAEE,GAAE,IAAI,CAAC,GAAG,IAAI,EAAEA,GAAE,IAAI,CAAC,GAAG,IAAIA,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI;AACxE,uBAAS,EAAEH,IAAGE,IAAG;AACb,uBAAO,SAASF,IAAG;AACf,sBAAI,MAAM,QAAQA,EAAC,EAAG,QAAOA;AAAA,gBACjC,EAAEA,EAAC,KAAK,SAASA,IAAGE,IAAG;AACnB,sBAAIC,KAAI,QAAQH,KAAI,OAAO,eAAe,OAAO,UAAUA,GAAE,OAAO,QAAQ,KAAKA,GAAE,YAAY;AAC/F,sBAAI,QAAQG,IAAG;AACX,wBAAIF,IAAGG,IAAGC,IAAGC,IAAGC,KAAI,CAAC,GAAGC,KAAI,MAAIE,KAAI;AACpC,wBAAI;AACA,0BAAIL,MAAKF,KAAIA,GAAE,KAAKH,EAAC,GAAG,MAAM,MAAME,IAAG;AACnC,4BAAI,OAAOC,EAAC,MAAMA,GAAG;AACrB,wBAAAK,KAAI;AAAA,sBACR,MAAO,QAAM,EAAEA,MAAKP,KAAII,GAAE,KAAKF,EAAC,GAAG,UAAUI,GAAE,KAAKN,GAAE,KAAK,GAAGM,GAAE,WAAWL,KAAIM,KAAI,KAAI;AAAA,oBAC3F,SAASR,IAAG;AACR,sBAAAU,KAAI,MAAIN,KAAIJ;AAAA,oBAChB,UAAE;AACE,0BAAI;AACA,4BAAI,CAACQ,MAAK,QAAQL,GAAE,WAAWG,KAAIH,GAAE,OAAO,GAAG,OAAOG,EAAC,MAAMA,IAAI;AAAA,sBACrE,UAAE;AACE,4BAAII,GAAG,OAAMN;AAAA,sBACjB;AAAA,oBACJ;AACA,2BAAOG;AAAA,kBACX;AAAA,gBACJ,EAAEP,IAAGE,EAAC,KAAK,SAASF,IAAGE,IAAG;AACtB,sBAAI,CAACF,GAAG;AACR,sBAAI,YAAY,OAAOA,GAAG,QAAO,EAAEA,IAAGE,EAAC;AACvC,sBAAIC,KAAI,OAAO,UAAU,SAAS,KAAKH,EAAC,EAAE,MAAM,GAAG,EAAE;AACrD,+BAAaG,MAAKH,GAAE,gBAAgBG,KAAIH,GAAE,YAAY;AACtD,sBAAI,UAAUG,MAAK,UAAUA,GAAG,QAAO,MAAM,KAAKH,EAAC;AACnD,sBAAI,gBAAgBG,MAAK,2CAA2C,KAAKA,EAAC,EAAG,QAAO,EAAEH,IAAGE,EAAC;AAAA,gBAC9F,EAAEF,IAAGE,EAAC,KAAK,WAAW;AAClB,wBAAM,IAAI,UAAU,2IAA2I;AAAA,gBACnK,EAAE;AAAA,cACN;AACA,uBAAS,EAAEF,IAAGE,IAAG;AACb,iBAAC,QAAQA,MAAKA,KAAIF,GAAE,YAAYE,KAAIF,GAAE;AACtC,yBAASG,KAAI,GAAGF,KAAI,IAAI,MAAMC,EAAC,GAAGC,KAAID,IAAGC,KAAK,CAAAF,GAAEE,EAAC,IAAIH,GAAEG,EAAC;AACxD,uBAAOF;AAAA,cACX;AACA,uBAAS,EAAED,IAAG;AACV,uBAAO,IAAI,cAAc,OAAO,UAAU,YAAY,OAAO,OAAO,WAAW,SAASA,IAAG;AACvF,yBAAO,OAAOA;AAAA,gBAClB,IAAI,SAASA,IAAG;AACZ,yBAAOA,MAAK,cAAc,OAAO,UAAUA,GAAE,gBAAgB,UAAUA,OAAM,OAAO,YAAY,WAAW,OAAOA;AAAA,gBACtH,GAAG,EAAEA,EAAC;AAAA,cACV;AACA,uBAAS,EAAEA,IAAGE,IAAG;AACb,yBAASC,KAAI,GAAGA,KAAID,GAAE,QAAQC,MAAK;AAC/B,sBAAIF,KAAIC,GAAEC,EAAC;AACX,kBAAAF,GAAE,aAAaA,GAAE,cAAc,OAAIA,GAAE,eAAe,MAAI,WAAWA,OAAMA,GAAE,WAAW,OACtF,OAAO,eAAeD,KAAII,KAAIH,GAAE,KAAKI,KAAI,QAAQA,KAAI,SAASL,IAAGE,IAAG;AAChE,wBAAI,aAAa,EAAEF,EAAC,KAAK,SAASA,GAAG,QAAOA;AAC5C,wBAAIG,KAAIH,GAAE,OAAO,WAAW;AAC5B,wBAAI,WAAWG,IAAG;AACd,0BAAIF,KAAIE,GAAE,KAAKH,IAAGE,MAAK,SAAS;AAChC,0BAAI,aAAa,EAAED,EAAC,EAAG,QAAOA;AAC9B,4BAAM,IAAI,UAAU,8CAA8C;AAAA,oBACtE;AACA,4BAAQ,aAAaC,KAAI,SAAS,QAAQF,EAAC;AAAA,kBAC/C,EAAEI,IAAG,QAAQ,GAAG,aAAa,EAAEC,EAAC,IAAIA,KAAI,OAAOA,EAAC,IAAIJ,EAAC;AAAA,gBACzD;AACA,oBAAIG,IAAGC;AAAA,cACX;AACA,uBAAS,EAAEL,IAAG;AACV,uBAAOA,MAAKA,GAAE,aAAaA,KAAI;AAAA,kBAC3B,SAASA;AAAA,gBACb;AAAA,cACJ;AACA,cAAAG,GAAE,IAAI;AACN,kBAAI,IAAI,EAAE,QAAQ,eAAe,IAAI,WAAW;AAC5C,yBAASH,GAAEE,IAAGC,IAAGF,IAAGG,IAAG;AACnB,mBAAC,SAASJ,IAAGE,IAAG;AACZ,wBAAI,EAAEF,cAAaE,IAAI,OAAM,IAAI,UAAU,mCAAmC;AAAA,kBAClF,EAAE,MAAMF,EAAC,GAAG,KAAK,OAAOE,IAAG,KAAK,SAASC,IAAG,KAAK,OAAOF,IAAG,KAAK,YAAYG,IAAG,KAAK,QAAQ,IAAI,KAAK,GAAG,GAAG,CAAC,GAC5G,KAAK,eAAeF,IAAG,KAAK,MAAM,KAAK,SAAS;AAAA,gBACpD;AACA,oBAAIA,IAAGC,IAAGF;AACV,uBAAOC,KAAIF,KAAIG,KAAI,CAAE;AAAA,kBACjB,KAAK;AAAA,kBACL,KAAK,WAAW;AACZ,2BAAO,WAAW,KAAK,UAAU,KAAK,QAAQ,IAAI,KAAK,GAAG,GAAG,CAAC,GAAG,KAAK,eAAe,QAAQ,KAAK,MAAM,KAAK,SAAS,IACtH,KAAK;AAAA,kBACT;AAAA,gBACJ,GAAG;AAAA,kBACC,KAAK;AAAA,kBACL,OAAO,SAASH,IAAGE,IAAGC,IAAG;AACrB,wBAAIF;AACJ,yBAAKiB,GAAEhB,EAAC,EAAE,YAAY,GAAGD,KAAIiB,GAAEhB,EAAC,EAAE,KAAK,KAAK,MAAM,KAAK;AACnD,0BAAIE,KAAI,OAAO,KAAKH,GAAE,CAAC,CAAC,GAAGI,KAAID,KAAIH,GAAE,CAAC,EAAE,CAAC,IAAI,MAAMA,GAAE,CAAC,GAAGK,KAAI;AAC7D,0BAAI,WAAWN,IAAG;AACd,4BAAII,IAAG;AACH,8BAAII,KAAIU,GAAEhB,EAAC,EAAE,WAAWQ,KAAI,EAAE,KAAKP,IAAGF,GAAE,OAAOC,IAAGC,MAAKA,GAAE,OAAO;AAChE,0BAAAe,GAAEhB,EAAC,EAAE,YAAYM,IAAGF,KAAIN,GAAE,MAAM,GAAGA,GAAE,QAAQU,GAAE,UAAU,CAAC,CAAC,CAAC;AAAA,wBAChE,OAAO;AACH,mCAASC,KAAIV,GAAE,CAAC,EAAE,CAAC,GAAGQ,KAAIR,GAAE,OAAOE,OAAMD,GAAE,YAAY,EAAE,QAAQ,KAAKC,IAAGM,EAAC,EAAE,MAAM,WAAW,KAAK,EAAE,QAAQ,KAAKN,IAAGM,EAAC,EAAE,MAAM,iBAAiBE,KAAK,CAAAF;AACnJ,8BAAIU,KAAIV,KAAIR,GAAE;AACd,0BAAAK,KAAIN,GAAE,MAAM,GAAGmB,MAAK,EAAEd,EAAC,KAAK,EAAEA,EAAC,EAAE,CAAC,KAAKA,GAAE,MAAM;AAAA,wBACnD;AACA,wBAAAL,KAAIA,GAAE,MAAMM,GAAE,MAAM;AAAA,sBACxB;AACA,6BAAO,UAAU,eAAe,KAAK,GAAGD,EAAC,KAAK,KAAK,SAAS,MAAMC,IAAGD,IAAG,EAAEA,EAAC,EAAE,CAAC,GAAG,EAAEA,EAAC,EAAE,CAAC,CAAC;AAAA,oBAC5F;AAAA,kBACJ;AAAA,gBACJ,GAAG;AAAA,kBACC,KAAK;AAAA,kBACL,OAAO,SAASL,IAAGE,IAAGC,IAAGF,IAAGG,IAAG;AAC3B,wBAAI,WAAWF,GAAG,SAAQD,IAAG;AAAA,sBAC3B,KAAK;AACH,wBAAAD,GAAEC,EAAC,IAAIC,IAAGF,GAAE,QAAQC,EAAC,IAAIC,GAAE,QAAQ,OAAO,GAAG;AAC7C;AAAA,sBAEF,KAAK;AACH,4BAAI,UAAUC,MAAK,WAAWA,IAAG;AAC7B,0BAAAH,GAAEC,EAAC,IAAI,EAAE,UAAUE,KAAI,EAAE,WAAW,MAAM,GAAG,EAAE,EAAE,UAAW,SAASH,IAAG;AACpE,mCAAOE,GAAE,YAAY,MAAMF,GAAE,YAAY;AAAA,0BAC7C,CAAE,IAAI,IAAI,EAAE,WAAW,MAAM,IAAI,EAAE,EAAE,UAAW,SAASA,IAAG;AACxD,mCAAOE,GAAE,YAAY,MAAMF,GAAE,YAAY;AAAA,0BAC7C,CAAE,IAAI,GAAG,CAAC,GAAGA,GAAEC,EAAC,IAAI,SAASD,GAAEC,EAAC,IAAI,KAAKD,GAAEC,EAAC,EAAE,SAAS,GAAGD,GAAE,QAAQC,EAAC,IAAID,GAAEC,EAAC;AAC5E;AAAA,wBACJ;AAAA,sBAEF;AACE,wBAAAD,GAAEC,EAAC,IAAIC,GAAE,QAAQ,WAAW,GAAG,GAAGF,GAAE,QAAQC,EAAC,IAAIC,GAAE,QAAQ,OAAO,GAAG;AAAA,oBACzE;AACA,wBAAI,WAAWE,IAAG;AACd,0BAAIC,KAAIL,GAAEC,EAAC;AACX,uBAAC,UAAUA,MAAK,OAAO,SAASI,EAAC,KAAK,YAAYJ,MAAK,MAAM,SAASI,EAAC,OAAO,OAAO,SAASL,GAAE,GAAG,KAAK,MAAM,SAASA,GAAE,KAAK,KAAK,OAAOA,GAAE,QAAQ,WAAWA,GAAE,QAAQA,GAAE,MAAM,YAAY,MAAM,GAAG,EAAE,IACxM,UAAUC,OAAM,IAAI,MAAI,MAAM,SAASI,EAAC,MAAMA,KAAI,KAAK,YAAYJ,OAAM,IAAI,OAC7E,WAAWA,OAAM,IAAI,MAAII,GAAE,SAAS,EAAEF,EAAC,EAAE,CAAC,MAAME,KAAI,EAAEA,IAAG,EAAEF,EAAC,EAAE,CAAC,GAAG,IAAE,MAAM,OAAOE,MAAK,CAAC,MAAMA,EAAC,KAAK,WAAWJ,OAAMG,GAAE,KAAKJ,GAAE,OAAOK,EAAC;AAAA,oBACzI;AAAA,kBACJ;AAAA,gBACJ,GAAG;AAAA,kBACC,KAAK;AAAA,kBACL,OAAO,WAAW;AACd,yBAAK,QAAQ,IAAI,KAAK,GAAG,GAAG,CAAC;AAAA,kBACjC;AAAA,gBACJ,GAAG;AAAA,kBACC,KAAK;AAAA,kBACL,OAAO,WAAW;AACd,yBAAK,QAAQ,QAAQ,KAAK;AAAA,kBAC9B;AAAA,gBACJ,CAAE,MAAM,EAAEH,GAAE,WAAWC,EAAC,GAAGF,MAAK,EAAEC,IAAGD,EAAC,GAAG,OAAO,eAAeC,IAAG,aAAa;AAAA,kBAC3E,UAAU;AAAA,gBACd,CAAC,GAAGF;AAAA,cACR,EAAE,GAAG,KAAK,oBAAI,QAAM,YAAY,GAAG,IAAI,EAAE,QAAQ,UAAU,MAAM,IAAI,OAAI,IAAI;AAAA,gBACzE,GAAG,CAAE,yBAAyB,KAAK,UAAU,SAAS,OAAO,KAAK,UAAU,OAAQ;AAAA,gBACpF,IAAI,CAAE,0BAA0B,KAAK,UAAU,SAAS,OAAO,WAAW;AACtE,yBAAO,EAAE,KAAK,UAAU,QAAQ,KAAK,IAAI,GAAG,CAAC;AAAA,gBACjD,CAAE;AAAA,gBACF,KAAK,CAAE,EAAG;AAAA,gBACV,MAAM,CAAE,EAAG;AAAA,gBACX,GAAG,CAAE,gBAAgB,SAASA,IAAG;AAC7B,sBAAIE,KAAIF,KAAI,SAASA,EAAC,IAAI;AAC1B,yBAAOE,KAAI,KAAKA,MAAK,KAAK,UAAU,SAAS,KAAK,MAAMA,EAAC;AAAA,gBAC7D,GAAG,SAAS,WAAW;AACnB,yBAAO,KAAK,UAAU,SAAS,KAAK,IAAI,IAAI;AAAA,gBAChD,CAAE;AAAA,gBACF,IAAI,CAAE,iBAAiB,SAASF,IAAG;AAC/B,sBAAIE,KAAIF,KAAI,SAASA,EAAC,IAAI;AAC1B,yBAAOE,KAAI,KAAKA,MAAK,KAAK,UAAU,SAAS,KAAK,MAAMA,EAAC;AAAA,gBAC7D,GAAG,SAAS,WAAW;AACnB,yBAAO,EAAE,KAAK,UAAU,SAAS,KAAK,IAAI,IAAI,GAAG,CAAC;AAAA,gBACtD,CAAE;AAAA,gBACF,KAAK,CAAE,EAAE,WAAW,MAAM,GAAG,EAAE,EAAE,KAAK,GAAG,GAAG,SAASF,IAAG;AACpD,sBAAIE,KAAI,EAAE,WAAW,MAAM,GAAG,EAAE,EAAE,UAAW,SAASA,IAAG;AACrD,2BAAOF,GAAE,YAAY,MAAME,GAAE,YAAY;AAAA,kBAC7C,CAAE;AACF,yBAAO,OAAOA,MAAK,KAAK,UAAU,SAAS,KAAK,MAAMA,EAAC;AAAA,gBAC3D,GAAG,SAAS,WAAW;AACnB,yBAAO,EAAE,WAAW,MAAM,GAAG,EAAE,EAAE,KAAK,UAAU,SAAS,KAAK,IAAI,CAAC;AAAA,gBACvE,CAAE;AAAA,gBACF,MAAM,CAAE,EAAE,WAAW,MAAM,IAAI,EAAE,EAAE,KAAK,GAAG,GAAG,SAASF,IAAG;AACtD,sBAAIE,KAAI,EAAE,WAAW,MAAM,IAAI,EAAE,EAAE,UAAW,SAASA,IAAG;AACtD,2BAAOF,GAAE,YAAY,MAAME,GAAE,YAAY;AAAA,kBAC7C,CAAE;AACF,yBAAO,OAAOA,MAAK,KAAK,UAAU,SAAS,KAAK,MAAMA,EAAC;AAAA,gBAC3D,GAAG,SAAS,WAAW;AACnB,yBAAO,EAAE,WAAW,MAAM,IAAI,EAAE,EAAE,KAAK,UAAU,SAAS,KAAK,IAAI,CAAC;AAAA,gBACxE,CAAE;AAAA,gBACF,IAAI,CAAE,YAAY,SAASF,IAAG;AAC1B,sBAAIE,MAAK,oBAAI,QAAM,YAAY,EAAE,SAAS,EAAE,MAAM,GAAG,CAAC;AACtD,uBAAK,UAAU,YAAY,KAAK,MAAM,GAAG,OAAOA,EAAC,EAAE,OAAOF,EAAC,CAAC;AAAA,gBAChE,GAAG,QAAQ,WAAW;AAClB,yBAAO,EAAE,KAAK,UAAU,YAAY,KAAK,IAAI,GAAG,CAAC;AAAA,gBACrD,GAAG,CAAE;AAAA,gBACL,MAAM,CAAE,YAAY,KAAK,UAAU,aAAa,QAAQ,WAAW;AAC/D,yBAAO,EAAE,KAAK,UAAU,YAAY,KAAK,IAAI,GAAG,CAAC;AAAA,gBACrD,GAAG,CAAE;AAAA,gBACL,GAAG,CAAE,gBAAgB,KAAK,UAAU,UAAU,SAAS,KAAK,UAAU,QAAS;AAAA,gBAC/E,IAAI,CAAE,iBAAiB,KAAK,UAAU,UAAU,SAAS,WAAW;AAChE,yBAAO,EAAE,KAAK,UAAU,SAAS,KAAK,IAAI,GAAG,CAAC;AAAA,gBAClD,CAAE;AAAA,gBACF,IAAI,CAAE,SAASA,IAAG;AACd,yBAAO,SAAS,OAAOA,IAAG,GAAG;AAAA,gBACjC,GAAG,KAAK,UAAU,UAAU,SAAS,SAASA,IAAG;AAC7C,yBAAO,KAAK,UAAU;AAAA,gBAC1B,CAAE;AAAA,gBACF,GAAG,CAAE,kBAAkB,KAAK,UAAU,UAAU,SAAS,KAAK,UAAU,QAAS;AAAA,gBACjF,IAAI,CAAE,wBAAwB,KAAK,UAAU,UAAU,SAAS,WAAW;AACvE,yBAAO,EAAE,KAAK,UAAU,SAAS,KAAK,IAAI,GAAG,CAAC;AAAA,gBAClD,CAAE;AAAA,gBACF,IAAI,CAAE,SAASA,IAAG;AACd,yBAAO,SAAS,OAAOA,IAAG,GAAG;AAAA,gBACjC,GAAG,KAAK,UAAU,UAAU,SAAS,SAASA,IAAG;AAC7C,yBAAO,WAAW;AACd,2BAAO,EAAE,KAAK,UAAU,SAAS,KAAK,IAAI,GAAGA,EAAC;AAAA,kBAClD;AAAA,gBACJ,CAAE;AAAA,gBACF,GAAG,CAAE,eAAe,KAAK,UAAU,YAAY,WAAW,KAAK,UAAU,UAAW;AAAA,gBACpF,IAAI,CAAE,6CAA6C,KAAK,UAAU,YAAY,WAAW,WAAW;AAChG,yBAAO,EAAE,KAAK,UAAU,WAAW,KAAK,IAAI,GAAG,CAAC;AAAA,gBACpD,CAAE;AAAA,gBACF,GAAG,CAAE,eAAe,KAAK,UAAU,YAAY,WAAW,KAAK,UAAU,UAAW;AAAA,gBACpF,IAAI,CAAE,6CAA6C,KAAK,UAAU,YAAY,WAAW,WAAW;AAChG,yBAAO,EAAE,KAAK,UAAU,WAAW,KAAK,IAAI,GAAG,CAAC;AAAA,gBACpD,CAAE;AAAA,gBACF,GAAG,CAAE,YAAY,KAAK,UAAU,iBAAiB,gBAAgB,WAAW;AACxE,yBAAO,EAAE,KAAK,UAAU,gBAAgB,KAAK,IAAI,GAAG,CAAC;AAAA,gBACzD,GAAG,CAAE;AAAA,gBACL,GAAG,CAAE,YAAY,KAAK,UAAU,iBAAiB,gBAAgB,WAAW;AACxE,yBAAO,EAAE,KAAK,UAAU,gBAAgB,KAAK,IAAI,GAAG,CAAC;AAAA,gBACzD,GAAG,CAAE;AAAA,gBACL,GAAG,CAAE,QAAQ,GAAG,QAAQ,GAAG,CAAE;AAAA,gBAC7B,IAAI,CAAE,SAAS,GAAG,QAAQ,GAAG,CAAE;AAAA,gBAC/B,GAAG,CAAE,QAAQ,GAAG,QAAQ,GAAG,CAAE;AAAA,gBAC7B,IAAI,CAAE,SAAS,GAAG,QAAQ,GAAG,CAAE;AAAA,gBAC/B,GAAG,CAAE,MAAM,QAAQ,KAAK,WAAW;AAC/B,sBAAIA,KAAI,KAAK,SAAS,EAAE,MAAM,UAAU,EAAE,CAAC;AAC3C,kBAAAA,GAAE,SAAS,GAAG,MAAMA,MAAKA,KAAIA,GAAE,QAAQ,KAAK,GAAG,EAAE,YAAY,GAAG,MAAM,GAAG,EAAE,IAAK,SAASA,IAAG;AACxF,2BAAO,EAAEA,IAAG,CAAC,EAAE,CAAC;AAAA,kBACpB,CAAE,EAAE,KAAK,EAAE;AACX,yBAAOA;AAAA,gBACX,CAAE;AAAA,gBACF,GAAG,CAAE,EAAG;AAAA,gBACR,GAAG,CAAE,EAAG;AAAA,cACZ,GAAG,IAAI;AAAA,gBACH,SAAS;AAAA,gBACT,SAAS;AAAA,gBACT,aAAa;AAAA,gBACb,gBAAgB;AAAA,cACpB;AACA,uBAAS,EAAEA,IAAG;AACV,oBAAIE,KAAI,KAAK,SAAS;AACtB,gBAAAF,GAAE,YAAY,EAAE,SAAS,GAAG,IAAI,KAAK,SAASE,KAAI,EAAE,IAAIF,GAAE,YAAY,EAAE,SAAS,GAAG,KAAKE,MAAK,MAAM,KAAK,SAASA,KAAI,EAAE;AAAA,cAC5H;AACA,uBAAS,IAAI;AACT,oBAAIF,KAAI,KAAK,SAAS;AACtB,wBAAQA,KAAIA,MAAK,OAAO,KAAK,OAAO;AAAA,cACxC;AACA,uBAAS,EAAEA,IAAG;AACV,oBAAIE,KAAI,OAAO,KAAKF,GAAE,CAAC,CAAC;AACxB,oBAAIE,MAAK,WAAWA,GAAE,CAAC,GAAG;AACtB,sBAAIC,KAAI,EAAEH,GAAE,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,MAAM,EAAE;AACjC,yBAAOG,GAAE,CAAC,IAAIA,GAAE,CAAC,EAAED,GAAE,CAAC,CAAC,GAAGC,GAAE,CAAC,IAAIA,GAAE,CAAC,EAAED,GAAE,CAAC,CAAC,GAAGC;AAAA,gBACjD;AACA,oBAAI,EAAEH,GAAE,CAAC,CAAC,EAAG,QAAO,EAAEA,GAAE,CAAC,CAAC;AAAA,cAC9B;AACA,uBAASkB,GAAElB,IAAG;AACV,oBAAI,CAACA,GAAE,WAAW;AACd,sBAAIE,KAAI,CAAC,GAAGC,KAAI,CAAC;AACjB,2BAASF,MAAK,EAAG,KAAI,QAAQ,KAAKA,EAAC,GAAG;AAClC,wBAAIG,KAAIH,GAAE,CAAC,IAAI;AACf,2BAAOE,GAAE,QAAQC,EAAC,KAAKD,GAAE,KAAKC,EAAC;AAAA,kBACnC,MAAO,QAAOF,GAAE,QAAQD,GAAE,CAAC,CAAC,KAAKC,GAAE,KAAKD,GAAE,CAAC,CAAC;AAC5C,kBAAAD,GAAE,YAAY,OAAOG,GAAE,SAAS,IAAIA,GAAE,KAAK,GAAG,IAAI,MAAM,MAAMD,GAAE,KAAK,IAAI,IAAI,SAC7EF,GAAE,YAAY,IAAI,OAAOA,GAAE,WAAW,GAAG;AAAA,gBAC7C;AACA,uBAAOA,GAAE;AAAA,cACb;AACA,uBAAS,EAAEA,IAAGE,IAAGC,IAAG;AAChB,oBAAI,CAAC,EAAG,QAAO;AACf,oBAAI,WAAWH,GAAE,UAAU,CAAC,SAASA,GAAE,MAAM,KAAK,IAAI,KAAKA,GAAE,KAAK,YAAY,GAAG,SAASA,GAAE,QAAQ,IAAIA,GAAE,QAAQA,GAAE,KAAK,SAAS,IAAI,GAAG,CAAC,EAAE,QAAQ,KAAKA,GAAE,OAAO,QAAQA,GAAE,QAAQ,CAAC,SAASA,GAAE,OAAO,KAAK,WAAWA,GAAE,WAAW,OAAOA,GAAE,YAAY,IAAI,KAAKA,GAAE,KAAK,YAAY,GAAG,SAASA,GAAE,QAAQ,IAAIA,GAAE,QAAQA,GAAE,KAAK,SAAS,IAAI,GAAG,CAAC,EAAE,QAAQ,KAAKA,GAAE,IAAK,QAAOE;AAC9W,oBAAI,QAAQF,GAAE,KAAK;AACf,sBAAIC,KAAI,EAAE,KAAK,MAAMC,GAAE,KAAKC,IAAG,KAAK,OAAO;AAC3C,sBAAIF,GAAE,eAAe,WAAWA,GAAE,YAAY,CAAC,KAAKC,GAAE,MAAMD,GAAE,oBAAoB,EAAG,QAAOC,GAAE,SAASA,GAAE,MAAM,GAC/GA;AAAA,gBACJ,WAAW,KAAKF,GAAE,KAAK,SAAS,KAAK,QAAQA,GAAE,OAAO,WAAWE,GAAE,EAAG,QAAOF,GAAE,MAAM,MACrFA,GAAE,KAAK,QAAQ,CAAC,GAAGA,GAAE,KAAK,SAAS,CAAC,GAAGE,GAAE,SAAS,CAAE;AAAA,kBAChD,KAAKA,GAAE;AAAA,kBACP,GAAG;AAAA,gBACP,GAAG;AAAA,kBACC,KAAKA,GAAE,MAAM;AAAA,kBACb,GAAGA,GAAE;AAAA,gBACT,CAAE,GAAGA,GAAE,QAAQ,EAAE,SAAS,KAAK,MAAMA,GAAE,MAAM,CAAC,GAAGA;AACjD,uBAAO;AAAA,cACX;AACA,uBAAS,EAAEF,IAAGE,IAAGC,IAAGC,IAAG;AACnB,oBAAIC,IAAGC,IAAGC,KAAI,IAAIC,KAAI,GAAGE,KAAI,CAAC;AAC9B,qBAAKQ,GAAEf,EAAC,EAAE,YAAY,GAAGE,KAAIa,GAAEf,EAAC,EAAE,KAAKH,EAAC,KAAK;AACzC,sBAAI,WAAWE,GAAG,KAAII,KAAI,EAAED,EAAC,EAAG,CAAAE,MAAK,MAAMD,GAAE,CAAC,IAAI,KAAKH,GAAE,eAAe,OAAOA,GAAE,eAAeO,GAAEF,EAAC,IAAIL,GAAE,YAAYE,GAAE,QAAQF,GAAE,YAAY,MAAM,GACnJO,GAAEP,GAAE,YAAYE,GAAE,QAAQF,GAAE,YAAY,MAAM,CAAC,IAAIE,GAAE,CAAC,EAAE,OAAO,CAAC,KAAKK,GAAEF,EAAC,IAAIH,GAAE,CAAC,EAAE,OAAO,CAAC;AAAA,sBAAQ,SAAQA,GAAE,CAAC,GAAG;AAAA,oBAC7G,KAAK;AACH,sBAAAE,MAAK;AACL;AAAA,oBAEF,KAAK;AACH,sBAAAA,MAAK;AACL;AAAA,oBAEF;AACE,sBAAAA,OAAM,GAAGN,GAAE,SAASI,GAAE,CAAC,CAAC,GAAGK,GAAEF,EAAC,IAAIH,GAAE,CAAC,EAAE,OAAO,CAAC;AAAA,kBACnD;AAAA,2BAAWC,KAAI,EAAED,EAAC,EAAG,KAAI,SAAOD,MAAKE,GAAE,CAAC,EAAG,CAAAC,MAAKD,GAAE,CAAC,EAAE,KAAKJ,GAAE,IAAI;AAAA,sBAAQ,CAAAI,GAAE,CAAC,IAAIC,MAAKL,GAAE,QAAQI,GAAE,CAAC,CAAC,IAAIC,MAAKF,GAAE,CAAC;AAAA,sBAAQ,CAAAE,MAAKF,GAAE,CAAC;AAC9H,kBAAAG;AAAA,gBACJ;AACA,uBAAO,WAAWN,OAAMC,GAAE,cAAcO,KAAIH;AAAA,cAChD;AACA,uBAAS,EAAEP,IAAGE,IAAGC,IAAG;AAChB,qBAAKH,KAAI,OAAOA,EAAC,GAAGE,KAAIA,MAAK,GAAGF,GAAE,SAASE,KAAK,CAAAF,KAAIG,KAAIH,KAAI,MAAM,MAAMA;AACxE,uBAAOA;AAAA,cACX;AACA,uBAAS,EAAEA,IAAGE,IAAGC,IAAG;AAChB,uBAAO,YAAY,OAAOH,KAAI,IAAI,EAAEA,IAAGE,IAAGC,IAAG,IAAI,IAAIH,MAAK,aAAa,EAAEA,EAAC,KAAK,OAAO,UAAU,eAAe,KAAKA,IAAG,MAAM,IAAIA,KAAI;AAAA,cACzI;AACA,uBAAS,EAAEA,IAAGE,IAAG;AACb,uBAAO,EAAEA,GAAE,aAAa;AAAA,kBACpB,MAAMF;AAAA,gBACV,GAAGE,EAAC;AAAA,cACR;AACA,uBAAS,EAAEF,IAAGE,IAAGC,IAAG;AAChB,oBAAIF,IAAGG,IAAGC,KAAI,MAAMC,KAAIH,MAAKA,GAAE,MAAMH,EAAC,IAAIE,GAAE,YAAYC,GAAE,MAAMH,EAAC,EAAE,CAAC,EAAE,MAAM,WAAW,KAAKG,GAAE,MAAMH,EAAC,EAAE,CAAC,EAAE,MAAM,cAAc,IAAIQ,KAAI,GAAGE,KAAI;AAC7I,qBAAKQ,GAAEhB,EAAC,EAAE,YAAY,GAAGE,KAAIc,GAAEhB,EAAC,EAAE,KAAKA,GAAE,WAAW,KAAK;AACrD,sBAAIS,KAAI,OAAO,KAAKP,GAAE,CAAC,CAAC;AACxB,sBAAIO,GAAG,CAAAD,KAAI,SAASC,GAAE,CAAC,CAAC;AAAA,uBAAQ;AAC5B,6BAASF,KAAIL,GAAE,CAAC,EAAE,CAAC,GAAGe,KAAIX,IAAGH,OAAMH,GAAE,YAAY,EAAE,QAAQ,KAAKG,IAAGc,EAAC,EAAE,MAAM,WAAW,KAAK,EAAE,QAAQ,KAAKd,IAAGc,EAAC,EAAE,MAAM,iBAAiBV,KAAK,CAAAU;AAC7I,2BAAOT,KAAIS,KAAIX,QAAOE,KAAIN,GAAE,CAAC,EAAE;AAAA,kBACnC;AACA,sBAAII,MAAKE,IAAG,MAAMN,GAAE,CAAC,EAAE,QAAQE,EAAC,KAAKE,MAAKR,KAAI,GAAG;AAC7C,oBAAAC,KAAIG,IAAGA,KAAIc,GAAEhB,EAAC,EAAE,KAAKA,GAAE,WAAW;AAClC;AAAA,kBACJ;AAAA,gBACJ;AACA,uBAAO;AAAA,kBACH,kBAAkBM,KAAIE;AAAA,kBACtB,WAAWN;AAAA,kBACX,aAAaH;AAAA,gBACjB;AAAA,cACJ;AACA,gBAAE,QAAQ,cAAc;AAAA,gBACpB,UAAU;AAAA,kBACN,MAAM,SAASD,IAAG;AACd,2BAAOA,GAAE,eAAe,OAAI,EAAE,IAAI,EAAE,cAAc,KAAK,GAAG,GAAGA,GAAE,cAAc,EAAEA,GAAE,WAAW,KAAKA,GAAE,aACnGA,GAAE,gBAAgB,EAAEA,GAAE,aAAa,KAAKA,GAAE,iBAAiBA,GAAE,aAAaA,GAAE,eAAe,EAAEA,GAAE,YAAY,KAAKA,GAAE,gBAAgBA,GAAE,aACpIA,GAAE,QAAQ,EAAEA,GAAE,aAAa,QAAQA,EAAC,GAAGA,GAAE,MAAM,EAAEA,GAAE,KAAKA,GAAE,aAAaA,EAAC,GAAGA,GAAE,MAAM,EAAEA,GAAE,KAAKA,GAAE,aAAaA,EAAC,GAC5G;AAAA,kBACJ;AAAA,kBACA,aAAa;AAAA,kBACb,aAAa;AAAA,kBACb,eAAe;AAAA,kBACf,cAAc;AAAA,kBACd,KAAK;AAAA,kBACL,KAAK;AAAA,kBACL,2BAA2B;AAAA,kBAC3B,eAAe,SAASA,IAAGE,IAAGC,IAAGF,IAAGG,IAAGC,IAAGC,IAAGC,IAAG;AAC5C,wBAAIA,GAAG,QAAO;AACd,wBAAI,MAAMJ,EAAC,KAAKH,GAAEE,EAAC,MAAMC,IAAG;AACxB,0BAAIK,KAAI,EAAE,KAAK,MAAMN,IAAGE,IAAGC,EAAC;AAC5B,0BAAIG,GAAE,aAAaA,GAAE,UAAU,CAAC,MAAML,MAAKK,GAAE,YAAY,CAAC,EAAE,SAAS,GAAG;AACpE,4BAAIE,KAAI,EAAEF,GAAE,WAAW,EAAE,CAAC;AAC1B,4BAAI,IAAI,OAAOE,EAAC,EAAE,KAAK,MAAMV,GAAEE,KAAI,CAAC,CAAC,EAAG,QAAOF,GAAEE,EAAC,IAAIF,GAAEE,KAAI,CAAC,GAAGF,GAAEE,KAAI,CAAC,IAAI,KAC3E;AAAA,0BACI,OAAO;AAAA,0BACP,QAAQF;AAAA,0BACR,mBAAmB;AAAA,4BACf,OAAOE,KAAI;AAAA,4BACX,KAAKA,KAAI;AAAA,0BACb;AAAA,0BACA,KAAKA,KAAI;AAAA,wBACb;AAAA,sBACJ;AAAA,oBACJ;AACA,2BAAO;AAAA,kBACX;AAAA,kBACA,gBAAgB,SAASF,IAAGE,IAAGC,IAAGF,IAAGG,IAAGC,IAAGC,IAAGE,IAAG;AAC7C,wBAAIE,IAAGC,IAAGF,KAAI;AACd,wBAAIH,GAAG,QAAO;AACd,wBAAI,UAAOL,SAAQS,KAAI,EAAE,KAAKD,IAAGP,KAAI,GAAGE,IAAGC,EAAC,GAAG,eAAeK,GAAE,qBAAqBR,MAAKQ,GAAE,YAAY,CAAC,EAAE,SAAS,KAAK,WAAW,EAAEA,GAAE,YAAY,CAAC,CAAC,MAAMA,KAAI,EAAE,KAAKD,IAAGP,KAAI,GAAGE,IAAGC,EAAC,GAAG,eAAeK,GAAE,qBAAqBR,KAAI,KAAKQ,GAAE,YAAY,CAAC,EAAE,SAAS,KAAK,WAAW,EAAEA,GAAE,YAAY,CAAC,CAAC,OAAOC,KAAI,EAAED,GAAE,WAAW,EAAE,CAAC,IAChU,WAAWC,OAAM,WAAWN,GAAE,eAAeH,KAAI,CAAC,KAAK,IAAI,OAAOS,EAAC,EAAE,KAAKR,KAAI,GAAG,KAAKH,GAAEE,EAAC,IAAIC,IAC7FH,GAAEE,KAAI,CAAC,IAAI,KAAKD,KAAI;AAAA,sBAChB,KAAKC,KAAI;AAAA,sBACT,OAAOA;AAAA,oBACX,KAAK,IAAI,OAAOS,EAAC,EAAE,KAAK,MAAMR,EAAC,MAAMH,GAAEE,EAAC,IAAI,KAAKF,GAAEE,KAAI,CAAC,IAAIC,IAAGF,KAAI;AAAA,sBAC/D,KAAKC,KAAI;AAAA,oBACb,KAAK,UAAOD,IAAI,QAAOA;AACvB,wBAAIA,GAAE,UAAUD,KAAIC,GAAE,QAAQC,KAAID,GAAE,OAAOS,KAAI,EAAE,KAAKD,IAAGP,IAAGE,IAAGC,EAAC,GAAG,eAAeK,GAAE,YAAY,CAAC,KAAK,WAAW,EAAEA,GAAE,YAAY,CAAC,CAAC,GAAG;AAClI,0BAAIS,KAAI,EAAET,GAAE,WAAW;AACvB,sBAAAC,KAAIQ,GAAE,CAAC;AACP,0BAAIP,KAAIZ,GAAE,MAAMU,GAAE,kBAAkBA,GAAE,mBAAmBA,GAAE,YAAY,CAAC,EAAE,MAAM;AAChF,0BAAI,UAAO,IAAI,OAAOC,EAAC,EAAE,KAAKC,GAAE,KAAK,EAAE,CAAC,KAAK,MAAMF,GAAE,YAAY,CAAC,EAAE,UAAUL,GAAE,eAAeK,GAAE,gBAAgB,KAAKL,GAAE,eAAeK,GAAE,mBAAmB,CAAC,MAAML,GAAE,eAAeK,GAAE,mBAAmB,CAAC,EAAE,QAAQ,MACpN,UAAUS,GAAE,CAAC,EAAG,UAASN,KAAI,EAAE,gBAAgB,KAAKJ,IAAG,OAAI,GAAG,QAAQ,IAAE,GAAGM,KAAIb,KAAI,GAAGa,KAAIf,GAAE,QAAQe,KAAK,CAAAf,GAAEe,EAAC,IAAIF,GAAEE,EAAC,GACnHV,GAAE,eAAe,OAAOH,KAAI,GAAG,CAAC;AAAA,oBACpC;AACA,wBAAIc,KAAIf,IAAGmB,KAAI,EAAE,KAAKX,IAAGT,GAAE,KAAK,EAAE,GAAGI,GAAE,aAAaA,EAAC;AACrD,2BAAOY,MAAK,CAAC,MAAMI,GAAE,KAAK,QAAQ,CAAC,MAAMhB,GAAE,gBAAgBY,KAAI,SAAShB,IAAGE,IAAGC,IAAG;AAC7E,0BAAIH,GAAE,SAASA,GAAE,SAAS;AACtB,4BAAIC,KAAI,EAAE,SAAS,GAAGG,KAAIJ,GAAE,QAAQ,QAAQ,WAAW,EAAE,GAAGK,KAAIJ,GAAE,MAAM,GAAGG,GAAE,MAAM,GAAGE,KAAIL,GAAE,MAAMG,GAAE,MAAM;AAC1G,4BAAI,MAAMA,GAAE,UAAUA,OAAMC,IAAG;AAC3B,8BAAIE,KAAI,IAAI,KAAK,GAAGP,GAAE,QAAQ,GAAGA,GAAE,GAAG;AACtC,0BAAAA,GAAE,OAAOO,GAAE,QAAQ,MAAM,CAACJ,GAAE,OAAOA,GAAE,IAAI,KAAK,QAAQ,KAAKI,GAAE,QAAQ,OAAOP,GAAE,KAAK,YAAY,CAAC,GAChGA,GAAE,OAAOC,IAAGC,GAAE,SAAS,CAAE;AAAA,4BACrB,KAAKA,GAAE,MAAM;AAAA,4BACb,GAAGI,GAAE,CAAC;AAAA,0BACV,GAAG;AAAA,4BACC,KAAKJ,GAAE,MAAM;AAAA,4BACb,GAAGI,GAAE,CAAC;AAAA,0BACV,CAAE;AAAA,wBACN;AAAA,sBACJ;AACA,6BAAOJ;AAAA,oBACX,EAAEkB,IAAGJ,IAAGZ,EAAC,IAAIY,KAAI,SAAShB,IAAGE,IAAGC,IAAGF,IAAGG,IAAG;AACrC,0BAAI,CAACF,GAAG,QAAOA;AACf,0BAAIA,MAAKC,GAAE,OAAO,CAAC,MAAMA,GAAE,IAAI,KAAK,QAAQ,CAAC,GAAG;AAC5C,4BAAIE;AACJ,6BAAKL,GAAE,MAAM,GAAGkB,GAAEf,EAAC,EAAE,YAAY,GAAGE,KAAIa,GAAEf,EAAC,EAAE,KAAKA,GAAE,WAAW,KAAK;AAChE,8BAAIG;AACJ,+BAAKA,KAAI,EAAED,EAAC,MAAMC,GAAE,CAAC,GAAG;AACpB,qCAASC,KAAID,GAAE,CAAC,GAAGE,KAAIR,GAAEM,GAAE,CAAC,CAAC,GAAGI,KAAIP,GAAE,IAAIG,GAAE,CAAC,CAAC,GAAGK,KAAIR,GAAE,MAAMA,GAAE,IAAIG,GAAE,CAAC,CAAC,IAAII,KAAI,GAAGD,KAAI,CAAC,GAAGU,KAAI,OAAIP,KAAI,GAAGA,KAAIF,GAAE,QAAQE,KAAK,YAAWX,GAAE,eAAeW,KAAIP,GAAE,KAAK,KAAKc,MAAKV,GAAEG,EAAC,IAAIJ,GAAEI,EAAC,GACvLO,KAAIA,MAAKX,GAAEI,EAAC,IAAIF,GAAEE,EAAC,MAAMA,KAAIP,GAAE,SAAS,KAAKG,GAAEI,EAAC,IAAIF,GAAEE,EAAC,KAAKH,GAAEG,EAAC,IAAIJ,GAAEI,EAAC,GAAGO,KAAI,QAAMV,GAAEG,EAAC,IAAIF,GAAEE,EAAC,GAC7F,WAAWN,GAAE,CAAC,KAAKE,GAAE,SAAS,KAAKI,MAAKF,MAAKC,OAAMF,MAAK,SAASA,GAAE,KAAK,EAAE,CAAC,IAAI,GAAG,SAAS,EAAE,MAAM,EAAE,IACrG,WAAWH,GAAE,CAAC,KAAKI,MAAKC,MAAKR,GAAE,IAAI,KAAK,QAAQ,IAAIH,GAAE,KAAK,QAAQ,MAAMS,GAAEG,EAAC,IAAID,GAAEC,EAAC;AACnF,4BAAAL,GAAE,KAAKP,GAAE,OAAOS,GAAE,KAAK,EAAE,CAAC;AAAA,0BAC9B;AAAA,wBACJ;AACA,wBAAAP,KAAIC,GAAE,IAAI,KAAK,QAAQ,KAAKH,GAAE,KAAK,QAAQ,GAAGA,GAAE,OAAO;AAAA,sBAC3D;AACA,6BAAOE,MAAKC,GAAE,QAAQ,MAAMA,GAAE,IAAI,KAAK,QAAQ,CAAC,MAAMD,KAAIC,GAAE,IAAI,KAAK,QAAQ,KAAKH,GAAE,KAAK,QAAQ,KACjGE;AAAA,oBACJ,EAAEkB,IAAGJ,KAAI,EAAE,KAAKP,IAAGW,IAAGJ,IAAGZ,EAAC,GAAGA,IAAGC,EAAC,IAAI,WAAWH,MAAKc,MAAKf,GAAE,QAAQC,KAAI;AAAA,sBACpE,QAAQ,EAAEE,GAAE,aAAagB,IAAGhB,EAAC,EAAE,MAAM,EAAE;AAAA,sBACvC,mBAAmB;AAAA,wBACf,OAAOF;AAAA,wBACP,KAAKD,GAAE;AAAA,sBACX;AAAA,sBACA,KAAKA,GAAE,SAASA,GAAE;AAAA,oBACtB,IAAIe;AAAA,kBACR;AAAA,kBACA,WAAW,SAAShB,IAAGE,IAAGC,IAAGF,IAAG;AAC5B,oBAAAD,GAAE,WAAWA,GAAE,QAAQ,EAAE,KAAK,eAAe,KAAK,UAAU,UAAU,EAAE,oBAAI,QAAMC,EAAC,CAAC,GACpF,EAAE,IAAI,EAAE,QAAQ,UAAU;AAAA,kBAC9B;AAAA,kBACA,UAAU,SAASD,IAAGE,IAAGC,IAAG;AACxB,2BAAOD,KAAI,EAAEC,GAAE,cAAc,EAAE,KAAK,MAAMH,IAAGG,GAAE,aAAaA,EAAC,GAAGA,IAAG,IAAE,IAAID;AAAA,kBAC7E;AAAA,kBACA,QAAQ,SAASF,IAAGE,IAAGC,IAAGF,IAAG;AACzB,wBAAI,KAAKC,GAAE,UAAU,QAAQ,MAAM,EAAG,QAAOF,GAAE,YAAY;AAC3D,wBAAI,KAAKE,GAAE,UAAU,QAAQ,MAAM,EAAG,QAAOF,GAAE,YAAY;AAC3D,wBAAII,KAAI,EAAE,QAAQ,KAAK,MAAM,CAAED,KAAI,CAAE,CAAC;AACtC,2BAAO,KAAKC,GAAE,MAAM,IAAI,QAAQ,MAAM,KAAK,MAAMD,MAAKC,MAAKA,GAAE,UAAU,OAAO,aAAa,EAAE,QAAQ,KAAK,KAAKA,MAAKA,GAAE,MAAM,QAAQ,OAAO,aAAa,EAAE,QAAQ,KAAK,IAAIJ,GAAE,YAAY,IAAIA,GAAE,YAAY;AAAA,kBAC/M;AAAA,kBACA,cAAc,SAASA,IAAGE,IAAG;AACzB,2BAAO,oBAAoB,OAAO,UAAU,SAAS,KAAKF,EAAC,MAAMA,KAAI,EAAEA,IAAGE,EAAC,IAAIF;AAAA,kBACnF;AAAA,kBACA,YAAY;AAAA,kBACZ,kBAAkB;AAAA,kBAClB,gBAAgB;AAAA,kBAChB,YAAY;AAAA,kBACZ,WAAW;AAAA,kBACX,aAAa;AAAA,gBACjB;AAAA,cACJ,CAAC;AAAA,YACL;AAAA,YACA,MAAM,SAASA,IAAGE,IAAGC,IAAG;AACpB,kBAAIF,IAAG,KAAKA,KAAIE,GAAE,IAAI,MAAMF,GAAE,aAAaA,KAAI;AAAA,gBAC3C,SAASA;AAAA,cACb;AACA,gBAAE,QAAQ,cAAc,OAAO,MAAI,EAAE,QAAQ,UAAU,MAAM;AAAA,gBACzD,UAAU,CAAE,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,UAAU,WAAW,aAAa,YAAY,UAAU,YAAY,QAAS;AAAA,gBAC1I,YAAY,CAAE,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,WAAW,YAAY,SAAS,SAAS,OAAO,QAAQ,QAAQ,UAAU,aAAa,WAAW,YAAY,UAAW;AAAA,gBAC3N,eAAe,CAAE,MAAM,MAAM,MAAM,IAAK;AAAA,cAC5C,CAAC;AAAA,YACL;AAAA,YACA,MAAM,SAASD,IAAGE,IAAGC,IAAG;AACpB,kBAAIF,IAAG,KAAKA,KAAIE,GAAE,IAAI,MAAMF,GAAE,aAAaA,KAAI;AAAA,gBAC3C,SAASA;AAAA,cACb,GAAG,IAAIE,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI;AAC1B,uBAAS,EAAEH,IAAG;AACV,uBAAO,SAASA,IAAG;AACf,sBAAI,MAAM,QAAQA,EAAC,EAAG,QAAO,EAAEA,EAAC;AAAA,gBACpC,EAAEA,EAAC,KAAK,SAASA,IAAG;AAChB,sBAAI,eAAe,OAAO,UAAU,QAAQA,GAAE,OAAO,QAAQ,KAAK,QAAQA,GAAE,YAAY,EAAG,QAAO,MAAM,KAAKA,EAAC;AAAA,gBAClH,EAAEA,EAAC,KAAK,SAASA,IAAGE,IAAG;AACnB,sBAAI,CAACF,GAAG;AACR,sBAAI,YAAY,OAAOA,GAAG,QAAO,EAAEA,IAAGE,EAAC;AACvC,sBAAIC,KAAI,OAAO,UAAU,SAAS,KAAKH,EAAC,EAAE,MAAM,GAAG,EAAE;AACrD,+BAAaG,MAAKH,GAAE,gBAAgBG,KAAIH,GAAE,YAAY;AACtD,sBAAI,UAAUG,MAAK,UAAUA,GAAG,QAAO,MAAM,KAAKH,EAAC;AACnD,sBAAI,gBAAgBG,MAAK,2CAA2C,KAAKA,EAAC,EAAG,QAAO,EAAEH,IAAGE,EAAC;AAAA,gBAC9F,EAAEF,EAAC,KAAK,WAAW;AACf,wBAAM,IAAI,UAAU,sIAAsI;AAAA,gBAC9J,EAAE;AAAA,cACN;AACA,uBAAS,EAAEA,IAAGE,IAAG;AACb,iBAAC,QAAQA,MAAKA,KAAIF,GAAE,YAAYE,KAAIF,GAAE;AACtC,yBAASG,KAAI,GAAGF,KAAI,IAAI,MAAMC,EAAC,GAAGC,KAAID,IAAGC,KAAK,CAAAF,GAAEE,EAAC,IAAIH,GAAEG,EAAC;AACxD,uBAAOF;AAAA,cACX;AACA,gBAAE,QAAQ,kBAAkB;AAAA,gBACxB,GAAG;AAAA,kBACC,WAAW;AAAA,kBACX,QAAQ;AAAA,gBACZ;AAAA,gBACA,KAAK;AAAA,kBACD,WAAW;AAAA,kBACX,QAAQ;AAAA,gBACZ;AAAA,gBACA,KAAK;AAAA,kBACD,WAAW;AAAA,kBACX,QAAQ;AAAA,gBACZ;AAAA,cACJ,CAAC;AACD,kBAAI,IAAI;AACR,uBAAS,EAAED,IAAGE,IAAGC,IAAGF,IAAGG,IAAG;AACtB,oBAAID,KAAI,IAAI,MAAM,QAAQD,GAAE,OAAOC,KAAI,CAAC,KAAKH,KAAIE,GAAE,OAAOC,KAAI,CAAC,IAAIH,IAAGA,KAAIG,KAAI,IAAI,MAAM,QAAQD,GAAE,OAAOC,KAAI,CAAC,IAAID,GAAE,OAAOC,KAAI,CAAC,IAAIH,KAAI,MAAMA,MAAKA,KAAI,OAAOA,IAC9JI,GAAE,UAAU,SAASJ,EAAC,IAAI,OAAO,EAAE,KAAK,OAAOA,GAAE,OAAO,CAAC,CAAC,GAAG;AACzD,sBAAIK,KAAI,CAAC,EAAE,OAAO,EAAEH,GAAE,OAAO,MAAM,GAAGC,EAAC,CAAC,GAAG,CAAE,KAAKH,GAAE,OAAO,CAAC,CAAE,CAAC;AAC/D,sBAAIK,GAAE,KAAK,EAAE,EAAE,MAAM,KAAK,EAAE,SAAS,EAAG,QAAO;AAAA,oBAC3C,mBAAmB;AAAA,oBACnB,QAAQA;AAAA,oBACR,OAAOF,KAAI;AAAA,kBACf;AAAA,gBACJ;AACA,uBAAO,EAAE,KAAKH,EAAC;AAAA,cACnB;AACA,gBAAE,QAAQ,cAAc;AAAA,gBACpB,SAAS;AAAA,kBACL,OAAO;AAAA,gBACX;AAAA,gBACA,KAAK;AAAA,kBACD,OAAO;AAAA,kBACP,YAAY;AAAA,kBACZ,YAAY;AAAA,kBACZ,YAAY;AAAA,gBAChB;AAAA,gBACA,IAAI;AAAA,kBACA,MAAM;AAAA,kBACN,aAAa;AAAA,oBACT,GAAG;AAAA,sBACC,WAAW;AAAA,oBACf;AAAA,oBACA,GAAG;AAAA,sBACC,WAAW;AAAA,oBACf;AAAA,oBACA,GAAG;AAAA,sBACC,WAAW;AAAA,oBACf;AAAA,oBACA,GAAG;AAAA,sBACC,WAAW;AAAA,oBACf;AAAA,kBACJ;AAAA,kBACA,UAAU,SAASA,IAAGE,IAAGC,IAAG;AACxB,2BAAOH;AAAA,kBACX;AAAA,kBACA,WAAW;AAAA,kBACX,aAAa;AAAA,oBACT,KAAK;AAAA,kBACT;AAAA,gBACJ;AAAA,gBACA,OAAO;AAAA,kBACH,MAAM,SAASA,IAAG;AACd,wBAAIE,KAAIF,GAAE,WAAWG,KAAIH,GAAE,YAAYC,KAAI,6EAA6EG,KAAIH;AAC5H,wBAAIC,GAAG,UAASG,KAAI,GAAGA,KAAIF,IAAGE,KAAK,CAAAD,MAAK,IAAI,OAAOF,EAAC,EAAE,OAAOD,IAAG,GAAG;AACnE,2BAAOG;AAAA,kBACX;AAAA,kBACA,QAAQ;AAAA,kBACR,QAAQ;AAAA,kBACR,WAAW;AAAA,kBACX,YAAY;AAAA,kBACZ,2BAA2B;AAAA,kBAC3B,eAAe,SAASJ,IAAGE,IAAG;AAC1B,4BAAQF,KAAIA,GAAE,YAAY,GAAG,QAAQ,WAAW,EAAE;AAAA,kBACtD;AAAA,kBACA,aAAa;AAAA,oBACT,KAAK;AAAA,sBACD,WAAW;AAAA,oBACf;AAAA,oBACA,KAAK;AAAA,sBACD,WAAW;AAAA,oBACf;AAAA,kBACJ;AAAA,kBACA,UAAU,SAASA,IAAGE,IAAGC,IAAG;AACxB,2BAAOH;AAAA,kBACX;AAAA,kBACA,WAAW;AAAA,gBACf;AAAA,gBACA,KAAK;AAAA,kBACD,MAAM;AAAA,gBACV;AAAA,gBACA,KAAK;AAAA,kBACD,MAAM;AAAA,kBACN,aAAa;AAAA,oBACT,GAAG;AAAA,sBACC,WAAW;AAAA,sBACX,QAAQ;AAAA,oBACZ;AAAA,kBACJ;AAAA,kBACA,iBAAiB;AAAA,kBACjB,YAAY;AAAA,gBAChB;AAAA,gBACA,KAAK;AAAA,kBACD,MAAM;AAAA,kBACN,gBAAgB,SAASA,IAAGE,IAAGC,IAAGF,IAAGG,IAAGG,IAAGC,IAAG;AAC1C,wBAAIE,KAAI,EAAE,gBAAgB,KAAK,MAAM,MAAI,EAAE,qBAAqB,KAAK,IAAI,GAAG,MAAI,IAAE;AAClF,2BAAO,6EAA6E,KAAKA,GAAE,KAAK,EAAE,CAAC;AAAA,kBACvG;AAAA,gBACJ;AAAA,cACJ,CAAC;AAAA,YACL;AAAA,YACA,KAAK,SAASV,IAAGE,IAAGC,IAAG;AACnB,kBAAIF,KAAI,EAAEE,GAAE,IAAI,CAAC,GAAG,IAAI,EAAEA,GAAE,IAAI,CAAC,GAAG,IAAIA,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI;AAC3D,uBAAS,EAAEH,IAAG;AACV,uBAAOA,MAAKA,GAAE,aAAaA,KAAI;AAAA,kBAC3B,SAASA;AAAA,gBACb;AAAA,cACJ;AACA,kBAAI,IAAI,EAAE,QAAQ;AAClB,uBAAS,EAAEA,IAAGE,IAAG;AACb,yBAASC,KAAI,IAAIF,KAAI,GAAGA,KAAID,GAAE,QAAQC,KAAK,GAAE,QAAQ,UAAU,YAAYD,GAAE,OAAOC,EAAC,CAAC,KAAKC,GAAE,YAAYF,GAAE,OAAOC,EAAC,CAAC,KAAKC,GAAE,eAAe,CAAC,MAAMF,GAAE,OAAOC,EAAC,KAAKC,GAAE,eAAe,CAAC,MAAMF,GAAE,OAAOC,EAAC,KAAKC,GAAE,iBAAiB,CAAC,MAAMF,GAAE,OAAOC,EAAC,KAAKC,GAAE,iBAAiB,CAAC,MAAMF,GAAE,OAAOC,EAAC,KAAKC,GAAE,YAAY,CAAC,MAAMF,GAAE,OAAOC,EAAC,KAAKC,GAAE,YAAY,CAAC,MAAMF,GAAE,OAAOC,EAAC,KAAKC,GAAE,qBAAqBF,GAAE,OAAOC,EAAC,IAAIE,MAAK,OAAOH,GAAE,OAAOC,EAAC,IAAIE,MAAKH,GAAE,OAAOC,EAAC;AAC/a,uBAAOE;AAAA,cACX;AACA,uBAAS,EAAEH,IAAGE,IAAGC,IAAGF,IAAG;AACnB,oBAAID,GAAE,SAAS,KAAKE,KAAI,MAAM,CAACC,GAAE,kBAAkBF,KAAI;AACnD,sBAAIG,KAAIJ,GAAE,QAAQG,GAAE,UAAU,GAAGE,KAAI;AACrC,kBAAAF,GAAE,eAAe,SAASH,GAAEA,GAAE,SAAS,CAAC,MAAMK,KAAI,MAAIL,GAAE,WAAW,OAAOI,OAAMJ,GAAE,KAAKG,GAAE,UAAU,GACnGC,KAAIJ,GAAE,SAAS;AACf,2BAASM,KAAI,GAAGA,MAAKJ,IAAGI,KAAK,UAASN,GAAEI,KAAIE,EAAC,CAAC,MAAMN,GAAEI,KAAIE,EAAC,IAAI;AAAA,gBACnE;AACA,uBAAOD,MAAKL,GAAE,KAAKG,GAAE,eAAe,IAAI,GAAGH;AAAA,cAC/C;AACA,uBAAS,EAAEA,IAAGE,IAAG;AACb,oBAAIC,KAAI;AACR,yBAASF,MAAK,QAAQD,OAAMG,KAAI,EAAE,SAAS,KAAK,MAAMD,GAAE,eAAe,SAAS,CAAC,IACjFA,GAAE,MAAO,MAAKD,KAAI,SAASA,EAAC,MAAME;AAAG,2BAASC,KAAI,GAAGC,KAAIH,GAAE,MAAMD,EAAC,EAAE,QAAQG,KAAIC,IAAGD,KAAK,MAAK,WAAWF,GAAE,eAAeD,EAAC,KAAK,QAAQD,OAAME,GAAE,MAAMD,EAAC,EAAEG,EAAC,EAAE,MAAM,QAAQJ,GAAG,QAAOC,MAAK,WAAWC,GAAE,eAAeD,EAAC,KAAK,QAAQD,KAAI,IAAI;AAAA;AAC1O,uBAAOG;AAAA,cACX;AACA,uBAAS,EAAEH,IAAGE,IAAG;AACb,yBAASC,KAAI,IAAIF,KAAI,GAAGG,KAAIF,GAAE,eAAe,QAAQD,KAAIG,IAAGH,MAAK;AAC7D,sBAAII,KAAIH,GAAE,eAAeD,EAAC;AAC1B,sBAAII,MAAKA,GAAE,MAAM,QAAQL,IAAG;AACxB,oBAAAG,KAAIF;AACJ;AAAA,kBACJ;AAAA,gBACJ;AACA,uBAAOE;AAAA,cACX;AACA,uBAAS,EAAEH,IAAGE,IAAGC,IAAGF,IAAGG,IAAG;AACtB,oBAAIC,KAAIH,GAAE,SAASA,GAAE,OAAO,QAAQE,GAAE,UAAU,IAAI,IAAIE,MAAK,OAAOD,MAAKJ,MAAKG,GAAE,eAAe,IAAI,OAAOA,GAAE,YAAY,CAAC,EAAE,SAAS,EAAE,KAAKJ,EAAC;AAC5I,uBAAO,CAACC,MAAKG,GAAE,eAAe,OAAOC,MAAKC,MAAK,QAAQJ,GAAE,eAAeG,EAAC,IAAI;AAAA,kBACzE,QAAQ;AAAA,oBACJ,KAAKA,OAAMF,KAAIE,KAAI,IAAIA;AAAA,oBACvB,GAAGD,GAAE;AAAA,kBACT;AAAA,kBACA,KAAKD;AAAA,gBACT,IAAIG;AAAA,cACR;AACA,gBAAE,QAAQ,cAAc;AAAA,gBACpB,SAAS;AAAA,kBACL,MAAM,SAASN,IAAG;AACd,oBAAAA,GAAE,SAAS,GAAGA,GAAE,mBAAmBA,GAAE,cAAcA,GAAE,UAAU,QAAQA,GAAE,WAAW,QAAQA,GAAE,aAAaA,GAAE,iBAAiB,MAAM,QAAQA,GAAE,aAAaA,GAAE,iBAAiB,MAAMA,GAAE,iBAAiB,KACvM,QAAQA,GAAE,mBAAmBA,GAAE,4BAA4B,SAASA,GAAE,YAAY,SAAS,MAAMA,GAAE,cAAcA,GAAE,YAAY,OAAO,CAAC,IACvI,iBAAiBA,GAAE,wBAAwB,OAAOA,GAAE,gBAAgBA,GAAE,uBAAuB;AAC7F,wBAAIE,KAAI,KAAKC,KAAIH,GAAE;AACnB,6BAAOA,GAAE,gBAAgB,WAAWA,GAAE,kBAAkBE,KAAI,KAAKF,GAAE,uBAAuB,iBAAiBA,GAAE,uBAAuB,QAAQA,GAAE,sBAC9IA,GAAE,iBAAiB,OAAI,MAAMA,GAAE,MAAM,MAAMA,GAAE,SAAS,IAAIA,GAAE,cAAc,OAAIG,KAAI,QAAQH,GAAE,aAAa,MAAM,KAC/G,OAAOA,GAAE,cAAc,WAAWA,GAAE,YAAYG,EAAC,MAAMH,GAAE,YAAYG,EAAC,IAAI,CAAC,GAAGH,GAAE,YAAYG,EAAC,EAAE,YAAY,MAAMH,GAAE,aAAa,KAChIA,GAAE,YAAYG,EAAC,EAAE,cAAcH,GAAE,YAAYA,GAAE,YAAYG,EAAC,EAAE,SAAS,MAAIH,GAAE,YAAYG,EAAC,EAAE,YAAY,UAAQH,GAAE,iBAAiB,OACnIA,GAAE,eAAe;AACjB,wBAAII,IAAGC,KAAI;AACX,wBAAIA,MAAK,EAAEL,GAAE,QAAQA,EAAC,GAAG,OAAOA,GAAE,kBAAkB,WAAWA,GAAE,YAAYA,GAAE,cAAc,MAAMA,GAAE,YAAYA,GAAE,cAAc,IAAI,CAAC,GACtIA,GAAE,YAAYA,GAAE,cAAc,EAAE,YAAY,MAAMA,GAAE,iBAAiB,KAAKA,GAAE,YAAYA,GAAE,cAAc,EAAE,cAAcA,GAAE,gBAC1HA,GAAE,YAAYA,GAAE,cAAc,EAAE,SAAS,MAAIA,GAAE,YAAYA,GAAE,cAAc,EAAE,YAAY,OACzFK,MAAKL,GAAE,MAAMA,EAAC,KAAKK,MAAK,QAAQ,WAAWL,GAAE,UAAU,MAAMA,GAAE,QAAQ;AACnE,0BAAIM,KAAIN,GAAE,OAAO,SAAS,EAAE,MAAM,GAAG;AACrC,+BAASM,GAAE,CAAC,CAAC,KAAKA,GAAE,CAAC,KAAK,SAASA,GAAE,CAAC,CAAC,IAAID,MAAKF,KAAID,KAAI,MAAMF,GAAE,SAAS,OAAO,MAAMA,GAAE,MAAM,KAAK,SAASA,GAAE,MAAM,IAAI,OAAOA,GAAE,kBAAkBA,GAAE,cAAcI,KAAIC,KAAIF,KAAID,KAAI,QAAQF,GAAE,SAAS,KACtMA,GAAE,aAAa,QAAMK,MAAKF,KAAID,KAAI,MAAMF,GAAE,SAAS;AAAA,oBACvD,MAAO,CAAAA,GAAE,YAAY;AACrB,2BAAOK,MAAK,EAAEL,GAAE,QAAQA,EAAC,GAAGK,MAAK,OAAOD,OAAMC,KAAI,CAAED,KAAI,EAAEJ,GAAE,QAAQA,EAAC,IAAI,OAAOK,EAAE,IAClFL,GAAE,SAAS,OAAI,SAASA,IAAG;AACvB,iCAAWA,GAAE,uBAAuB,SAASA,GAAE,QAAQA,GAAE,MAAMA,GAAE,IAAI,SAAS,EAAE,QAAQ,IAAI,QAAQ,GACpGC,GAAE,SAASD,GAAE,cAAc,GAAG,GAAG,GAAG,EAAE,GAAG,QAAQA,GAAE,eAAeA,GAAE,MAAMA,GAAE,IAAI,QAAQA,GAAE,YAAY,GAAG,IACzGA,GAAE,MAAM,SAASA,GAAE,GAAG,IAAI,WAAWA,GAAE,GAAG,IAAI,KAAK,MAAMA,GAAE,GAAG,MAAMA,GAAE,MAAM,OAAO,aACnF,SAASA,GAAE,QAAQA,GAAE,MAAMA,GAAE,IAAI,SAAS,EAAE,QAAQ,IAAI,QAAQ,GAAGC,GAAE,SAASD,GAAE,cAAc,GAAG,GAAG,GAAG,EAAE,GACzG,QAAQA,GAAE,eAAeA,GAAE,MAAMA,GAAE,IAAI,QAAQA,GAAE,YAAY,GAAG,IAAIA,GAAE,MAAM,SAASA,GAAE,GAAG,IAAI,WAAWA,GAAE,GAAG,IAAI,KAClH,MAAMA,GAAE,GAAG,MAAMA,GAAE,MAAM,OAAO,aAAaA,GAAE,qBAAqB;AAAA,oBACxE,EAAEA,EAAC,GAAG,OAAOA,GAAE,cAAcA,GAAE,yBAAyBA,GAAE,YAAY,OAAOA,GAAE,aAAa,MAAM,GAAG,IAAIA,GAAE,aAC3GK;AAAA,kBACJ;AAAA,kBACA,OAAO,SAASL,IAAG;AACf,2BAAO,MAAMA,GAAE,iBAAiB;AAAA,kBACpC;AAAA,kBACA,QAAQ;AAAA,kBACR,gBAAgB;AAAA,kBAChB,qBAAqB;AAAA,kBACrB,YAAY;AAAA,kBACZ,sBAAsB;AAAA,kBACtB,aAAa;AAAA,kBACb,gBAAgB;AAAA,kBAChB,YAAY;AAAA,kBACZ,gBAAgB;AAAA,oBACZ,OAAO;AAAA,oBACP,MAAM;AAAA,kBACV;AAAA,kBACA,QAAQ;AAAA,kBACR,QAAQ;AAAA,kBACR,KAAK;AAAA,kBACL,KAAK;AAAA,kBACL,kBAAkB;AAAA,kBAClB,MAAM;AAAA,kBACN,WAAW;AAAA,kBACX,gBAAgB;AAAA,kBAChB,YAAY,KAAK;AAAA,kBACjB,WAAW;AAAA,kBACX,WAAW;AAAA,oBACP,GAAG;AAAA,oBACH,GAAG;AAAA,kBACP;AAAA,kBACA,aAAa;AAAA,kBACb,QAAQ;AAAA,kBACR,YAAY;AAAA,kBACZ,YAAY;AAAA,kBACZ,YAAY;AAAA,kBACZ,2BAA2B;AAAA,kBAC3B,yBAAyB;AAAA,kBACzB,oBAAoB;AAAA,kBACpB,sBAAsB;AAAA,kBACtB,aAAa;AAAA,oBACT,GAAG;AAAA,sBACC,WAAW;AAAA,oBACf;AAAA,oBACA,GAAG;AAAA,sBACC,WAAW;AAAA,sBACX,kBAAkB;AAAA,oBACtB;AAAA,oBACA,GAAG;AAAA,sBACC,WAAW;AAAA,sBACX,kBAAkB;AAAA,oBACtB;AAAA,oBACA,KAAK;AAAA,sBACD,WAAW,SAASA,IAAGE,IAAGC,IAAGF,IAAGG,IAAG;AAC/B,+BAAOA,GAAE,eAAe,QAAQJ,MAAKA,OAAMI,GAAE,eAAe;AAAA,sBAChE;AAAA,oBACJ;AAAA,oBACA,KAAK;AAAA,sBACD,WAAW,SAASJ,IAAGE,IAAGC,IAAGF,IAAGG,IAAG;AAC/B,+BAAOA,GAAE,cAAcJ,OAAMI,GAAE,eAAe;AAAA,sBAClD;AAAA,oBACJ;AAAA,kBACJ;AAAA,kBACA,eAAe,SAASJ,IAAGE,IAAGC,IAAGF,IAAGG,IAAGC,IAAGC,IAAGC,IAAG;AAC5C,wBAAIC,KAAI;AACR,wBAAI,UAAOJ,GAAE,kBAAkBD,OAAMC,GAAE,WAAY,QAAO;AAC1D,wBAAIM,KAAIV,GAAE,QAAQI,GAAE,UAAU,GAAGO,KAAIT;AACrC,wBAAIA,KAAI,SAASF,IAAGE,IAAGC,IAAGF,IAAGG,IAAG;AAC5B,6BAAOA,GAAE,eAAeA,GAAE,gBAAgBF,OAAME,GAAE,eAAe,QAAQJ,MAAKG,OAAMA,KAAI,KAAKD,MAAKE,GAAE,gBAAgB,WAAWH,GAAE,eAAeD,KAAI,CAAC,KAAKC,GAAE,eAAeD,KAAI,CAAC,EAAE,UAAUI,GAAE,eAAe,UAAUJ,MAAK,IAC5NA;AAAA,oBACJ,EAAEE,IAAGC,IAAGO,IAAGL,IAAGD,EAAC,GAAG,QAAQD,MAAKA,OAAMC,GAAE,eAAe,OAAO;AACzD,0BAAI,SAAOA,GAAE,WAAY,QAAO;AAChC,0BAAIQ,KAAI,OAAI,IAAI,EAAE,KAAKP,EAAC,GAAG,IAAI,EAAE,KAAKA,EAAC;AACvC,6BAAO,OAAO,MAAMO,KAAI,CAAE,CAAE,GAAG,OAAO,KAAKA,GAAE,KAAK,CAAC,IAAI,UAAOA,KAAI;AAAA,wBAC9D,QAAQA;AAAA,wBACR,OAAOD,KAAIP,GAAE,eAAe,KAAK;AAAA,sBACrC,IAAI;AAAA,wBACA,QAAQ,CAAE;AAAA,0BACN,KAAK,EAAE,KAAKI,IAAG,KAAKH,EAAC;AAAA,0BACrB,GAAGD,GAAE,eAAe;AAAA,0BACpB,aAAa;AAAA,wBACjB,GAAG;AAAA,0BACC,KAAK,EAAE,KAAKI,IAAG,KAAKH,EAAC;AAAA,0BACrB,GAAGD,GAAE,eAAe;AAAA,0BACpB,aAAa;AAAA,wBACjB,CAAE;AAAA,wBACF,OAAOO,KAAIP,GAAE,eAAe,KAAK;AAAA,sBACrC;AAAA,oBACJ;AACA,wBAAID,OAAMC,GAAE,eAAgB,QAAO;AAAA,sBAC/B,OAAOO;AAAA,oBACX;AACA,wBAAIJ,GAAG,QAAO;AACd,wBAAI,OAAOG,MAAK,SAAON,GAAE,eAAe,UAAOH,MAAKE,OAAMC,GAAE,cAAc,WAAWA,GAAE,WAAW,MAAMA,GAAE,MAAM,KAAK,SAASA,GAAE,MAAM,IAAI,MAAMM,OAAMR,IAAG;AACrJ,0BAAI,IAAI,EAAE,KAAKM,IAAGJ,GAAE,YAAYC,EAAC;AACjC,6BAAOA,GAAE,eAAe,CAAC,MAAMA,GAAE,eAAe,CAAC,EAAE,iBAAiBA,GAAE,eAAe,CAAC,EAAE,aAAa,QACrG;AAAA,wBACI,OAAOD,GAAE,eAAeF,OAAMQ,KAAI,IAAIA,KAAI,IAAIA;AAAA,sBAClD;AAAA,oBACJ;AACA,wBAAI,UAAON,GAAE;AAAgB,0BAAIH,IAAG;AAChC,4BAAIG,GAAE,eAAgB,QAAO;AAAA,0BACzB,iBAAiBE,GAAE;AAAA,wBACvB;AACA,4BAAI,CAACF,GAAE,gBAAgB;AACnB,8BAAIE,GAAE,QAAQI,MAAKJ,GAAE,OAAOI,GAAG,QAAOP,OAAMC,GAAE,aAAa;AAAA,4BACvD,QAAQ;AAAA,8BACJ,KAAKM,KAAI;AAAA,8BACT,GAAG;AAAA,8BACH,aAAa;AAAA,4BACjB;AAAA,4BACA,iBAAiBA;AAAA,0BACrB,IAAI;AAAA,4BACA,iBAAiBA,KAAI;AAAA,0BACzB;AACA,8BAAIJ,GAAE,QAAQI,GAAG,QAAO;AAAA,4BACpB,iBAAiBJ,GAAE,QAAQ;AAAA,0BAC/B;AAAA,wBACJ;AAAA,sBACJ,WAAW,CAACF,GAAE,mBAAmB,CAACA,GAAE,mBAAmB,CAACA,GAAE,kBAAkBA,GAAE,SAAS,KAAK,OAAO,KAAK,WAAW,KAAK,KAAK,EAAE,EAAG,QAAO;AAAA,wBACrI,iBAAiBM;AAAA,sBACrB;AAAA;AACA,2BAAO;AAAA,sBACH,iBAAiBR;AAAA,oBACrB;AAAA,kBACJ;AAAA,kBACA,gBAAgB,SAASF,IAAGE,IAAGC,IAAGF,IAAGG,IAAGC,IAAGC,IAAG;AAC1C,wBAAI,UAAOL,GAAG,QAAOA;AACrB,wBAAIK,GAAG,QAAO;AACd,wBAAI,SAASF,GAAE,OAAO,SAASA,GAAE,KAAK;AAClC,0BAAIG,KAAIH,GAAE,SAASJ,GAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,QAAQ,EAAE,OAAO,CAAC,GAAGI,IAAG;AAAA,wBACrE,gBAAgB;AAAA,sBACpB,CAAC,CAAC;AACF,0BAAI,SAASA,GAAE,OAAOG,KAAIH,GAAE,QAAQG,GAAE,SAAS,EAAE,SAASH,GAAE,IAAI,SAAS,EAAE,UAAUG,KAAI,GAAI,QAAO;AACpG,0BAAI,SAASH,GAAE,OAAOG,KAAIH,GAAE,IAAK,QAAO,CAAC,CAACA,GAAE,oBAAoB;AAAA,wBAC5D,mBAAmB;AAAA,wBACnB,QAAQ,EAAEA,GAAE,IAAI,SAAS,EAAE,QAAQ,KAAKA,GAAE,UAAU,EAAE,MAAM,EAAE,GAAGA,GAAE,QAAQA,EAAC,EAAE,QAAQ;AAAA,sBAC1F;AAAA,oBACJ;AACA,2BAAOH;AAAA,kBACX;AAAA,kBACA,UAAU,SAASD,IAAGE,IAAGC,IAAG;AACxB,wBAAI,OAAOD,MAAK,SAAOC,GAAE,SAAU,QAAOD;AAC1C,wBAAIE,KAAIJ,GAAE,QAAQG,GAAE,QAAQ,EAAE;AAC9B,2BAAOC,MAAKA,KAAIA,GAAE,QAAQD,GAAE,QAAQ,EAAE,GAAG,QAAQ,IAAI,QAAQ,GAAGF,GAAE,SAASE,GAAE,cAAc,GAAG,GAAG,GAAG,EAAE,GACtG,OAAOA,GAAE,YAAY,OAAO,CAAC,MAAMC,KAAIA,GAAE,QAAQ,IAAI,OAAOD,GAAE,YAAY,OAAO,CAAC,GAAG,GAAG,GAAG,GAAG,IAC9FA,GAAE,kBAAkB,OAAOA,GAAE,cAAc,OAAOC,GAAE,QAAQD,GAAE,UAAU,MAAMC,KAAIA,GAAE,QAAQH,GAAE,QAAQ,KAAK,MAAME,GAAE,UAAU,GAAG,GAAG,IACnIC,MAAKA,KAAIA,GAAE,QAAQ,IAAI,OAAO,OAAO,GAAGH,GAAE,SAASE,GAAE,eAAe,KAAK,CAAC,GAAG,GAAG,GAAG,QAAQ,IAAI,QAAQ,GACvGF,GAAE,SAASE,GAAE,eAAe,IAAI,IAAI,GAAG,GAAG,EAAE,GAAG,OAAOC,EAAC,KAAKA;AAAA,kBAChE;AAAA,kBACA,YAAY,SAASJ,IAAGE,IAAG;AACvB,wBAAIC,MAAKD,GAAE,eAAeF,GAAE,MAAM,EAAE,QAAQ,IAAIA,IAAG,KAAK,EAAE;AAC1D,2BAAOG,MAAKA,MAAKA,MAAKA,MAAKA,KAAIA,GAAE,QAAQ,IAAI,OAAO,OAAO,GAAGF,GAAE,SAASC,GAAE,eAAe,KAAK,CAAC,GAAG,GAAG,GAAG,QAAQ,IAAI,QAAQ,GAC7HD,GAAE,SAASC,GAAE,eAAe,IAAI,IAAI,GAAG,GAAG,EAAE,GAAG,QAAQA,GAAE,QAAQ,EAAE,GAAG,QAAQA,GAAE,QAAQ,EAAE,GAAG,QAAQ,IAAI,QAAQ,GACjHD,GAAE,SAASC,GAAE,cAAc,IAAI,cAAc,GAAG,GAAG,IAAI,GAAG,QAAQA,GAAE,eAAeC,KAAIA,GAAE,SAAS,GAClGF,GAAE,SAASC,GAAE,UAAU,GAAG,GAAG,IAAI,SAASC,EAAC;AAAA,kBAC/C;AAAA,kBACA,cAAc,SAASH,IAAGE,IAAG;AACzB,wBAAIC;AACJ,oBAAAH,KAAI,UAAUG,KAAIH,OAAM,WAAWG,KAAIA,KAAI;AAC3C,wBAAIC,KAAIF,GAAE,cAAc;AACxB,6BAASA,GAAE,MAAM,MAAMA,GAAE,SAAS,SAASA,GAAE,MAAM,IAAI,YAAY,OAAOF,MAAK,aAAaE,GAAE,aAAa,OAAOE,OAAMJ,KAAIA,GAAE,SAAS,EAAE,QAAQ,KAAKI,EAAC;AACvJ,wBAAIC,KAAI,QAAQL,GAAE,OAAO,CAAC,KAAKA,GAAE,OAAO,CAAC,MAAME,GAAE,eAAe,OAAOI,KAAIN,GAAE,MAAMI,EAAC,GAAGG,KAAID,GAAE,CAAC,EAAE,QAAQ,aAAa,EAAE,GAAGE,KAAIF,GAAE,SAAS,IAAIA,GAAE,CAAC,EAAE,QAAQ,WAAW,EAAE,IAAI,IAAII,KAAIJ,GAAE,SAAS;AAC9L,oBAAAN,KAAIO,MAAK,OAAOC,KAAIJ,KAAII,KAAIA;AAC5B,wBAAIC,KAAI;AACR,wBAAI,OAAOL,OAAMK,KAAIP,GAAE,iBAAiBA,GAAE,SAASM,GAAE,SAASN,GAAE,SAASM,GAAE,SAASN,GAAE,QACtF,OAAOM,MAAK,CAACN,GAAE,iBAAiB;AAC5B,0BAAIiB,KAAI,KAAK,IAAI,IAAIV,MAAK,CAAC;AAC3B,sBAAAT,KAAIA,GAAE,SAAS,GAAGC,GAAE,SAASG,EAAC,GAAG,GAAG,GAAG,MAAM,WAAWJ,EAAC,CAAC,MAAMA,MAAKE,GAAE,WAAW,WAAWF,EAAC,IAAImB,EAAC,IAAIA,IAAG,QAAQV,EAAC,IACnHT,KAAIA,GAAE,SAAS,EAAE,QAAQ,KAAKI,EAAC;AAAA,oBACnC;AACA,wBAAI,MAAMF,GAAE,UAAU,OAAOF,GAAE,QAAQI,EAAC,MAAMJ,KAAIA,GAAE,UAAU,GAAGA,GAAE,QAAQI,EAAC,CAAC,IAC7E,SAASF,GAAE,OAAO,SAASA,GAAE,KAAK;AAC9B,0BAAIU,KAAIZ,GAAE,SAAS,EAAE,QAAQI,IAAG,GAAG;AACnC,+BAASF,GAAE,OAAOU,KAAIV,GAAE,MAAMF,KAAIE,GAAE,IAAI,SAAS,EAAE,QAAQ,KAAKE,EAAC,IAAI,SAASF,GAAE,OAAOU,KAAIV,GAAE,QAAQF,KAAIE,GAAE,IAAI,SAAS,EAAE,QAAQ,KAAKE,EAAC;AAAA,oBAC5I;AACA,2BAAOC,MAAK,QAAQL,GAAE,OAAO,CAAC,MAAMA,KAAI,MAAMA,KAAI,EAAEA,GAAE,SAAS,EAAE,MAAM,EAAE,GAAGS,IAAGP,IAAGQ,EAAC,EAAE,KAAK,EAAE;AAAA,kBAChG;AAAA,kBACA,eAAe,SAASV,IAAGE,IAAGC,IAAGC,IAAG;AAChC,6BAASC,GAAEL,IAAGE,IAAG;AACb,0BAAI,UAAOE,GAAE,kBAAkBF,IAAG;AAC9B,4BAAIC,KAAIH,GAAE,QAAQI,GAAE,UAAU;AAC9B,+BAAOD,MAAKH,GAAE,OAAOG,IAAG,CAAC;AAAA,sBAC7B;AACA,0BAAI,OAAOC,GAAE,eAAgB,QAAM,QAAQD,KAAIH,GAAE,QAAQI,GAAE,cAAc,KAAM,CAAAJ,GAAE,OAAOG,IAAG,CAAC;AAC5F,6BAAOH;AAAA,oBACX;AACA,wBAAIM,IAAGC;AACP,wBAAIH,GAAE,uBAAuBG,KAAI,SAASP,IAAGE,IAAG;AAC5C,0BAAIC,KAAI,IAAI,OAAO,QAAQ,OAAOD,GAAE,eAAe,SAAS,GAAGD,GAAE,SAASC,GAAE,eAAe,KAAK,IAAI,MAAM,OAAO,GACjHD,GAAE,SAASC,GAAE,MAAM,IAAI,YAAY,GAAGD,GAAE,SAASC,GAAE,MAAM,KAAK,MAAMA,GAAE,eAAe,QAAQ,GAC7FD,GAAE,SAASC,GAAE,eAAe,IAAI,IAAI,MAAM,MAAM,IAAI,EAAE,KAAKF,GAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,GAAGI,KAAID,KAAIA,GAAE,CAAC,IAAI,IAAIE,KAAI;AACjH,6BAAOD,OAAMA,KAAIA,GAAE,MAAMF,GAAE,WAAW,OAAO,CAAC,CAAC,EAAE,CAAC,GAAGG,KAAI,IAAI,OAAO,QAAQH,GAAE,iBAAiB,IAAI,EAAE,KAAKE,EAAC,IAC3G,EAAE,CAACC,MAAK,EAAEA,GAAE,CAAC,EAAE,SAAS,KAAKA,GAAE,CAAC,EAAE,SAAS,KAAKA,GAAE,CAAC,EAAE,SAASD,GAAE,YAAYC;AAAA,oBAChF,EAAEH,IAAGE,EAAC,GAAI,UAASM,KAAIR,GAAE,KAAK,EAAE,EAAE,YAAYK,GAAE,CAAC,EAAE,MAAM,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,KAAKA,GAAE,CAAC,KAAKA,GAAE,QAAQ,IAAI,IAAIE,KAAIF,GAAE,CAAC,KAAKA,GAAE,QAAQ,IAAI,GAAGY,KAAIZ,GAAE,CAAC,EAAE,SAASE,IAAGU,KAAI,GAAGA,KAAK,MAAK,QAAQ,eAAe,OAAOT,KAAIS,IAAG,CAAC,GACvN,OAAOjB,GAAEQ,KAAIS,EAAC;AACd,wBAAInB,GAAG,SAAQA,GAAE,MAAM;AAAA,sBACrB,KAAK;AAAA,sBACL,KAAK;AACH,4BAAI,SAASI,GAAE,KAAK;AAChB,8BAAIQ,KAAIR,GAAE,SAASF,GAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,QAAQ,EAAE,OAAO,CAAC,GAAGE,IAAG;AAAA,4BACrE,gBAAgB;AAAA,0BACpB,CAAC,CAAC;AACF,8BAAI,SAASA,GAAE,OAAOQ,KAAIR,GAAE,IAAK,QAAO;AAAA,4BACpC,mBAAmB;AAAA,4BACnB,QAAQ,EAAEA,GAAE,IAAI,SAAS,EAAE,QAAQ,KAAKA,GAAE,UAAU,EAAE,MAAM,EAAE,GAAGA,GAAE,QAAQA,EAAC,EAAE,QAAQ;AAAA,0BAC1F;AAAA,wBACJ;AACA,4BAAIF,GAAEA,GAAE,SAAS,CAAC,MAAME,GAAE,eAAe,OAAO;AAC5C,8BAAI,IAAI,IAAI,OAAO,QAAQ,MAAMA,GAAE,eAAe,SAAS,GAAGH,GAAE,SAASG,GAAE,eAAe,KAAK,IAAI,MAAM,OAAO,GAChHH,GAAE,SAASG,GAAE,MAAM,IAAI,YAAY,GAAGH,GAAE,SAASG,GAAE,MAAM,KAAK,MAAMA,GAAE,eAAe,QAAQ,GAC7FH,GAAE,SAASG,GAAE,eAAe,IAAI,IAAI,MAAM,MAAM,IAAI,EAAE,KAAKC,GAAEH,GAAE,MAAM,GAAG,IAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;AAC9F,gCAAM,IAAI,EAAE,CAAC,IAAI,QAAQI,KAAI;AAAA,4BACzB,mBAAmB;AAAA,4BACnB,QAAQ,CAAE,CAAE;AAAA,0BAChB;AAAA,wBACJ,WAAW,OAAOF,GAAE,YAAY;AAC5B,0BAAAF,GAAE,QAAQE,GAAE,UAAU,MAAMA,GAAE,OAAO,WAAWE,MAAKA,GAAE,SAASA,GAAE,OAAO,OAAO,GAAG,IAAIF,GAAE,OAAO,MAAM,KAAKF,GAAE,OAAO,GAAG,IAAIE,GAAE,OAAO,MAAM,GAC1IE,KAAI;AAAA,4BACA,mBAAmB;AAAA,4BACnB,QAAQD,GAAEH,EAAC;AAAA,0BACf;AAAA,wBACJ;AACA,4BAAIE,GAAE,qBAAqB;AACvB,8BAAI,KAAKE,KAAIA,MAAK,CAAC,MAAMA,GAAE,UAAUJ,GAAE,MAAM,EAAE,QAAQ;AACvD,0BAAAI,GAAE,oBAAoB,MAAIA,GAAE,SAAS,EAAE,GAAGF,GAAE,QAAQA,IAAG,IAAE,EAAE,QAAQ;AAAA,wBACvE;AAAA,oBACJ;AACA,2BAAOE;AAAA,kBACX;AAAA,kBACA,WAAW,SAASN,IAAGE,IAAGC,IAAGF,IAAG;AAC5B,wBAAIG,IAAGE,KAAI,EAAE,IAAI;AACjB,wBAAI,KAAKN,GAAE,UAAU;AACjB,0BAAIO,IAAGG,KAAIV,GAAE;AACb,2BAAKO,KAAIN,GAAE,aAAaA,GAAE,UAAUS,EAAC,MAAMH,GAAE,SAAS,EAAG,QAAO,KAAK,UAAU,WAAW,KAAK,MAAM,WAAW,KAAK,UAAU,cAAc,CAAC,IAAI,SAASA,EAAC,CAAC,GAC7JD,GAAE,QAAQ,UAAU,GAAG;AAAA,oBAC3B;AACA,wBAAIN,GAAE,QAAS,SAAQA,GAAE,KAAK;AAAA,sBAC5B,KAAK,EAAE,KAAK;AACV,+BAAO,KAAK,UAAU,WAAW,KAAK,MAAM,WAAW,KAAK,UAAU,cAAc,CAAC,IAAI,SAASC,GAAE,IAAI,CAAC,GACzGK,GAAE,QAAQ,UAAU,GAAG;AAAA,sBAEzB,KAAK,EAAE,KAAK;AACV,+BAAO,KAAK,UAAU,WAAW,KAAK,MAAM,WAAW,KAAK,UAAU,cAAc,CAAC,IAAI,SAASL,GAAE,IAAI,CAAC,GACzGK,GAAE,QAAQ,UAAU,GAAG;AAAA,oBAC3B;AACA,wBAAI,CAACN,GAAE,aAAaA,GAAE,QAAQ,EAAE,KAAK,UAAUA,GAAE,QAAQ,EAAE,KAAK,aAAaA,GAAE,QAAQ,EAAE,KAAK,qBAAqBG,GAAE,UAAUD,GAAE,QAAQ;AACrI,0BAAIA,GAAEF,GAAE,QAAQ,EAAE,KAAK,SAASG,GAAE,QAAQ,IAAIA,GAAE,GAAG,MAAMF,GAAE,eAAe,MAAO,QAAOG,KAAIF,GAAE,MAAM,EAAE,QAAQ,GAC9G,OAAOD,GAAE,eAAe,SAASG,GAAE,MAAM,GAAG,OAAOH,GAAE,eAAe,QAAQG,GAAE,IAAI,GAClFE,GAAE,QAAQ,YAAY,CAAEF,GAAE,KAAK,EAAE,GAAGD,GAAE,KAAM,CAAC,GAAG;AAChD,0BAAI,SAAOF,GAAE,aAAa;AACtB,4BAAIQ,IAAGU,KAAIjB,GAAE,QAAQD,GAAE,UAAU;AACjC,4BAAIA,GAAE,gBAAgB;AAClB,8BAAI,MAAMkB,GAAG,SAAQf,KAAIF,GAAE,MAAM,EAAE,QAAQ,GAAG,IAAI,GAAGI,GAAE,QAAQ,YAAY,CAAEF,GAAE,KAAK,EAAE,GAAGD,GAAE,SAASC,GAAE,SAASA,GAAE,SAASD,GAAE,KAAM,CAAC,GACnI;AAAA,wBACJ,WAAW,OAAOgB,OAAMhB,GAAE,QAAQgB,MAAKhB,GAAE,MAAMgB,MAAKnB,GAAE,QAAQ,EAAE,KAAK,WAAWG,GAAE,UAAUgB,MAAKhB,GAAE,QAAQ,MAAMgB,KAAK,QAAOhB,GAAE,UAAUA,GAAE,QAAQH,GAAE,QAAQ,EAAE,KAAK,aAAaA,GAAE,QAAQ,EAAE,KAAK,mBAAmBG,GAAE,UAAUH,GAAE,QAAQ,EAAE,KAAK,UAAUG,GAAE,QAAQ,MAAMgB,OAAMV,KAAI,EAAE,OAAO,CAAC,GAAGN,EAAC,GACpSA,GAAE,SAASA,GAAE,UAAUC,KAAIF,GAAE,MAAM,EAAE,QAAQ,GAAG,OAAOE,GAAE,SAASD,GAAE,OAAOA,GAAE,QAAQA,GAAE,MAAM,CAAC,GAC9FC,KAAI,EAAEA,IAAGH,GAAE,QAAQA,EAAC,EAAE,KAAK,EAAE,GAAGQ,OAAMN,KAAIM,KAAIH,GAAE,QAAQ,YAAY,CAAEF,IAAGD,GAAE,SAASC,GAAE,SAASe,KAAI,IAAIhB,GAAE,KAAM,CAAC,GAChH;AAAA,sBACJ;AAAA,oBACJ;AAAA,kBACJ;AAAA,gBACJ;AAAA,gBACA,UAAU;AAAA,kBACN,QAAQ;AAAA,kBACR,gBAAgB;AAAA,kBAChB,OAAO;AAAA,kBACP,QAAQ;AAAA,kBACR,gBAAgB;AAAA,gBACpB;AAAA,gBACA,SAAS;AAAA,kBACL,OAAO;AAAA,gBACX;AAAA,gBACA,SAAS;AAAA,kBACL,OAAO;AAAA,kBACP,WAAW;AAAA,kBACX,QAAQ;AAAA,gBACZ;AAAA,gBACA,YAAY;AAAA,kBACR,OAAO;AAAA,kBACP,KAAK;AAAA,kBACL,KAAK;AAAA,kBACL,QAAQ;AAAA,kBACR,QAAQ;AAAA,kBACR,YAAY;AAAA,gBAChB;AAAA,gBACA,UAAU;AAAA,kBACN,OAAO;AAAA,kBACP,OAAO,SAASH,IAAG;AACf,2BAAO,MAAMA,GAAE,iBAAiB,cAAcA,GAAE,iBAAiB;AAAA,kBACrE;AAAA,kBACA,gBAAgB;AAAA,kBAChB,YAAY;AAAA,kBACZ,aAAa;AAAA,kBACb,QAAQ;AAAA,kBACR,gBAAgB;AAAA,gBACpB;AAAA,cACJ,CAAC;AAAA,YACL;AAAA,YACA,MAAM,SAASA,IAAGE,IAAG;AACjB,qBAAO,eAAeA,IAAG,cAAc;AAAA,gBACnC,OAAO;AAAA,cACX,CAAC,GAAGA,GAAE,UAAU;AAChB,kBAAIC,KAAI,EAAE,eAAe,OAAO,UAAU,CAAC,OAAO,YAAY,CAAC,OAAO,SAAS;AAC/E,cAAAD,GAAE,UAAUC,KAAI,SAAS,CAAC;AAAA,YAC9B;AAAA,YACA,MAAM,SAASH,IAAGE,IAAGC,IAAG;AACpB,qBAAO,eAAeD,IAAG,cAAc;AAAA,gBACnC,OAAO;AAAA,cACX,CAAC,GAAGA,GAAE,0BAA0B,SAASF,IAAGE,IAAG;AAC3C,oBAAIC,KAAIH,KAAIA,GAAE,YAAY;AAC1B,oBAAIC,GAAE,IAAI;AACN,sBAAID,GAAE,UAAU,UAAU,MAAME,OAAMF,GAAE,gBAAgBE,MAAK,OAAOF,GAAE,cAAc;AAChF,wBAAII,KAAI,EAAE,UAAU,KAAKD,EAAC,EAAE,MAAM,GAAGE,KAAIL,GAAE,UAAU,UAAU;AAC/D,wBAAIK,OAAMH,IAAG;AACT,0BAAIK,KAAI,EAAE,qBAAqB,KAAKJ,EAAC;AACrC,6BAAOI,MAAKF,OAAM,EAAE,kBAAkB,KAAKF,EAAC,EAAE,KAAK,EAAE,IAAIC,KAAI,CAAC,IAAI,OAAOG,MAAK,EAAE,KAAKJ,IAAGC,EAAC,GACzF,EAAEJ,IAAGI,EAAC;AAAA,oBACV;AAAA,kBACJ;AAAA,gBACJ,MAAO,CAAAJ,GAAE,gBAAgBE,OAAMF,GAAE,cAAcE,IAAG,OAAOF,GAAE,eAAeA,GAAE,gBAAgB,aAAa;AAAA,cAC7G,GAAGE,GAAE,kBAAkB,GAAGA,GAAE,WAAW,GAAGA,GAAE,oBAAoB,GAAGA,GAAE,gBAAgB,SAASF,IAAG;AAC7F,oBAAIE,KAAIF,KAAIA,GAAE,YAAY,MAAMG,KAAID,GAAE,MAAMD,KAAIC,GAAE;AAClD,oBAAIF,IAAG;AACH,sBAAI,WAAWA,GAAE,UAAW,QAAOA,GAAE;AACrC,kBAAAA,GAAE,aAAaA,GAAE,UAAU,gBAAgB,EAAEA,IAAGA,GAAE,UAAU,UAAU,IAAE,CAAC;AAAA,gBAC7E;AACA,yBAASI,KAAI,CAAC,GAAGC,KAAIJ,GAAE,gBAAgBM,KAAI,GAAGC,KAAIH,GAAE,QAAQE,KAAIC,IAAGD,KAAK,CAAAF,GAAEE,EAAC,KAAKF,GAAEE,EAAC,EAAE,UAAU,KAAKF,GAAEE,EAAC,EAAE,MAAM,UAAU,MAAM,QAAQN,GAAE,QAAQ,KAAK,SAAOI,GAAEE,EAAC,EAAE,mBAAmBH,GAAE,KAAKC,GAAEE,EAAC,EAAE,KAAK;AACtM,oBAAII,KAAI,MAAMP,GAAE,SAAS,MAAMF,GAAE,QAAQE,GAAE,QAAQ,IAAIA,IAAG,KAAK,EAAE;AACjE,oBAAI,cAAc,OAAOD,GAAE,UAAU;AACjC,sBAAIM,MAAKP,GAAE,QAAQ,EAAE,UAAU,KAAKA,EAAC,EAAE,MAAM,EAAE,QAAQ,IAAI,EAAE,UAAU,KAAKA,EAAC,GAAG,KAAK,EAAE;AACvF,kBAAAS,KAAIR,GAAE,SAAS,KAAKD,IAAGO,IAAGE,IAAGR,EAAC;AAAA,gBAClC;AACA,uBAAOQ;AAAA,cACX,GAAGT,GAAE,cAAc;AACnB,kBAAID,KAAIE,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI;AAC/E,uBAAS,EAAEH,IAAGE,IAAGC,IAAG;AAChB,oBAAIF,KAAID,KAAIA,GAAE,YAAY,MAAMI,KAAIH,GAAE;AACtC,gBAAAD,GAAE,UAAU,eAAe,OAAI,cAAc,OAAOI,GAAE,iBAAiBF,KAAIE,GAAE,aAAa,KAAKH,IAAGC,IAAGE,EAAC,KAAKF,KAC3G,EAAEF,IAAG,MAAI,OAAIE,MAAKA,MAAK,IAAI,SAAS,EAAE,MAAM,EAAE,GAAGC,EAAC,GAAGF,GAAE,YAAYA,GAAE,UAAU,IAAE,IAChFG,GAAE,wBAAwBA,GAAE,oBAAoBJ,GAAE,UAAU,UAAU,MAAM,EAAE,kBAAkB,KAAKC,EAAC,EAAE,KAAK,EAAE,KAAK,OAAO,EAAE,qBAAqB,KAAKA,EAAC,KAAKD,GAAE,UAAU,UAAU,EAAE;AAAA,cAC1L;AACA,uBAAS,EAAEA,IAAG;AACV,gBAAAA,GAAE,SAAS;AACX,yBAASE,IAAGC,KAAI,EAAE,gBAAgB,KAAK,MAAM,MAAI,GAAG,MAAI,QAAQ,IAAE,GAAG,YAAYD,KAAIC,GAAE,MAAM,KAAM,CAAAH,GAAE,KAAKE,EAAC;AAC3G,uBAAOF;AAAA,cACX;AACA,uBAAS,EAAEA,IAAGE,IAAGC,IAAGF,IAAGI,IAAG;AACtB,oBAAIK,IAAGC,KAAIX,KAAIA,GAAE,YAAY,MAAMS,KAAIE,GAAE,SAAS,IAAIA,GAAE,MAAM,IAAIA,GAAE,eAAe,IAAIV,GAAE,MAAM,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AACxH,kBAAE,4BAA4B,IAAI,EAAE,aAAa,KAAKU,IAAG,KAAE,GAAGA,GAAE,UAAU,GAAG,IAAI,EAAE,aAAa,EAAE,0BAA0B,KAAKA,IAAG;AAAA,kBAChI,OAAO;AAAA,kBACP,KAAK;AAAA,gBACT,GAAG,OAAI,UAAO,EAAE,iBAAiB,eAAe,MAAM,EAAE,QAAQ,GAAGF,GAAE,IAAI,GAAGE,GAAE,WAAW;AAAA,kBACrF,OAAO;AAAA,gBACX;AACA,oBAAI,IAAI,CAAC,GAAG,IAAIA,GAAE;AAClB,oBAAI,EAAE,QAAS,SAASX,IAAGE,IAAG;AAC1B,sBAAI,WAAWF,IAAG;AACd,wBAAIC,KAAI,IAAI,EAAE,MAAM,WAAW;AAC/B,oBAAAA,GAAE,MAAMD,IAAG,KAAKA;AAChB,wBAAIK,KAAI,EAAE,qBAAqB,KAAKM,IAAG,QAAQ,IAAE;AACjD,qBAAC,SAASX,IAAGE,IAAG;AACZ,+BAASC,KAAI,EAAE,gBAAgB,KAAKQ,IAAG,MAAI,CAAC,EAAE,MAAMX,IAAG,EAAE,SAAS,KAAKW,IAAGX,IAAG,OAAI,KAAE,CAAC,EAAE,KAAK,EAAE,EAAE,QAAQ,MAAM,EAAE,GAAGC,KAAIE,GAAE,QAAQD,EAAC,GAAGD,KAAI,KAAK,QAAQE,GAAEF,KAAI,CAAC,IAAK,CAAAA;AACjK,0BAAIG,KAAI,MAAMH,MAAK,CAAC,EAAE,OAAO,KAAKU,IAAGX,EAAC,MAAM,EAAE,QAAQ,KAAKW,IAAGX,EAAC,EAAE,MAAM,cAAcE,GAAE,OAAO,CAAC,KAAK,SAAO,EAAE,QAAQ,KAAKS,IAAGX,EAAC,EAAE,MAAM,UAAU,EAAE,QAAQ,KAAKW,IAAGX,EAAC,EAAE,MAAM,cAAc,MAAME,GAAE,OAAO,CAAC,KAAK,QAAQ,EAAE,QAAQ,KAAKS,IAAGX,EAAC,EAAE,MAAM,cAAc,EAAE,QAAQ,KAAKW,IAAGX,KAAI,CAAC,EAAE,MAAM,cAAcE,GAAE,OAAO,CAAC,KAAK,SAAO,EAAE,QAAQ,KAAKS,IAAGX,KAAI,CAAC,EAAE,MAAM,UAAU,EAAE,QAAQ,KAAKW,IAAGX,KAAI,CAAC,EAAE,MAAM,cAAc,MAAME,GAAE,OAAO,CAAC;AACxa,0BAAI,CAACE,MAAKH,KAAI,KAAK,CAAC,EAAE,OAAO,KAAKU,IAAGX,IAAG,OAAI,IAAE,GAAG;AAC7C,4BAAIK,KAAI,EAAE,SAAS,KAAKM,IAAGX,EAAC;AAC5B,wBAAAW,GAAE,SAAS,QAAQN,OAAMM,GAAE,WAAW;AAAA,0BAClC,OAAON;AAAA,wBACX;AAAA,sBACJ;AACA,6BAAOD;AAAA,oBACX,EAAE,GAAG,CAAC,KAAKM,KAAI,EAAE,cAAc,cAAc,KAAKC,IAAGV,IAAG,MAAI,OAAIE,IAAGQ,GAAE,SAAS,KAAK,OAAO,IAAIA,GAAE,SAAS,QAAQ,GACjH,IAAI,MAAMD,KAAI,EAAE,cAAc,cAAc,KAAKC,IAAGV,IAAG,MAAI,OAAIE,IAAGE,KAAI,CAAC,GAAGK,MAAK,WAAWA,GAAE,OAAOD,GAAE,eAAeC,GAAE,GAAG,KAAK,SAAOD,GAAE,eAAeC,GAAE,GAAG,EAAE,MAAM,UAAU,WAAWD,GAAE,eAAeC,GAAE,GAAG,EAAE,gBAAgB,EAAE,KAAKA,GAAE,GAAG,GAC5OC,GAAE,UAAUD,GAAE,kBAAkBA,GAAE,MAAM,KAAK,EAAE,KAAKC,IAAG,QAAQ,EAAE,UAAU,KAAKA,EAAC,GAAGD,GAAE,iBAAiBT,IAAG,KAAE,GAC5GU,GAAE,WAAW;AAAA,sBACT,OAAOD,GAAE;AAAA,sBACT,KAAKA,GAAE;AAAA,oBACX,GAAG,IAAIC,GAAE,YAAY,WAAWF,GAAE,eAAeP,EAAC,KAAK,EAAEA,EAAC,MAAM,EAAE,eAAe,KAAKS,IAAGT,EAAC,KAAK,EAAE,OAAO,KAAKS,IAAGT,IAAG,IAAE,IAAIS,GAAE,SAAS,UAAUA,GAAE,WAAW;AAAA,kBAC/J;AAAA,gBACJ,CAAE,GAAG,EAAE,SAAS,GAAG;AACf,sBAAI,GAAG,GAAGO,KAAI,EAAE,SAAS,KAAKP,IAAG,IAAI,QAAQ,KAAE;AAC/C,sBAAI,CAAC,EAAE,WAAW,KAAKA,IAAG,EAAE,UAAU,KAAKA,EAAC,CAAC,KAAK,EAAE,UAAUO,MAAK,EAAE,WAAW,KAAKP,IAAG,EAAE,UAAU,KAAKA,EAAC,CAAC,KAAK,EAAE,SAAS,KAAK,EAAE,WAAWO,MAAK,MAAM,EAAE,CAAC;AAAG,6BAAS,IAAIA,IAAG,YAAY,IAAI,EAAE,MAAM,KAAM,KAAI,IAAI,GAAG;AACnN,0BAAI,IAAI,IAAI,EAAE,MAAM,WAAW;AAC/B,2BAAK,IAAIT,GAAE,eAAe,CAAC,GAAG,iBAAiB,MAAI,EAAE,MAAM,EAAE,QAAQC,KAAI,EAAE,cAAc,cAAc,KAAKC,IAAG,GAAG,MAAI,OAAIR,IAAG,CAAC,MAAM,WAAWO,GAAE,OAAOA,GAAE,QAAQ,KAAKD,GAAE,eAAeC,GAAE,GAAG,KAAK,SAAOD,GAAE,eAAeC,GAAE,GAAG,EAAE,MAAM,OAAQ,GAAE,KAAKA,GAAE,GAAG;AAAA,+BAAY,CAACA,GAAG;AAC3Q;AAAA,oBACJ;AAAA;AAAA,gBACJ;AACA,gBAAAR,MAAK,EAAE,KAAKS,IAAGX,IAAG,EAAE,UAAU,KAAKW,EAAC,GAAGD,KAAIA,GAAE,kBAAkBC,GAAE,SAAS,OAAON,MAAK,IAAI,EAAE,MAAM,UAAU,GAAGA,OAAM,YAAYA,GAAE,QAAQM,GAAE,cAAc,EAAE,UAAU,KAAKA,EAAC,EAAE,KAAK,EAAE,KAAK,YAAYN,GAAE,KAAK,GAC9M,EAAE,4BAA4B;AAAA,cAClC;AACA,uBAAS,EAAEL,IAAGE,IAAGC,IAAGF,IAAGG,IAAG;AACtB,oBAAII,KAAIR,KAAIA,GAAE,YAAY,MAAMU,KAAIF,GAAE,MAAMG,KAAIH,GAAE;AAClD,oBAAIP,MAAK,cAAc,OAAOS,GAAE,eAAe;AAC3C,sBAAID,KAAIC,GAAE,cAAc,KAAKF,IAAGP,IAAGC,IAAGC,IAAGO,EAAC;AAC1C,sBAAID,IAAG;AACH,wBAAIA,GAAE,mBAAmB;AACrB,0BAAIU,KAAIV,GAAE;AACV,wBAAE,kBAAkB,KAAKD,IAAG,SAAOW,KAAIA,KAAIA,GAAE,OAAOA,GAAE,KAAKV,GAAE,UAAUP,EAAC,GAAGA,KAAI,EAAE,UAAU,KAAKM,IAAG,IAAE;AAAA,oBACzG;AACA,+BAAWL,OAAMA,KAAI,WAAWM,GAAE,QAAQA,GAAE,QAAQN;AAAA,kBACxD;AAAA,gBACJ;AACA,oBAAI,WAAWH,OAAMA,GAAE,UAAU,UAAUE,GAAE,KAAK,EAAE,CAAC,GAAG,WAAWC,MAAK,WAAWF,MAAK,WAAWA,GAAE,QAAQ,EAAE,MAAM,KAAKO,IAAGR,IAAGG,IAAG,QAAQ,QAAQ,WAAWF,MAAK,cAAcA,GAAE,SAASA,GAAE,QAAQ,EAAE,KAAK,UAAUA,GAAE,QAAQ,EAAE,KAAK,UAAU,GAClP,WAAWD,GAAE,UAAU,mBAAmBA,GAAE,UAAU,gBAAgBG,EAAC,GAAG,SAAOC,KAAI;AACjF,sBAAI,IAAIO,GAAEX,EAAC,GAAG,IAAIA,GAAE,UAAU,UAAU;AACxC,kBAAAA,GAAE,UAAU,iBAAiB,MAAI,EAAE,QAAQ,OAAO,GAAG,WAAY,WAAW;AACxE,0BAAM,EAAE,kBAAkB,KAAKQ,EAAC,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,SAAS,IAAI,SAAO,EAAE,WAAW,KAAKA,IAAGN,EAAC,KAAK,EAAE,QAAQ,UAAU;AAAA,kBAC9H,GAAI,CAAC;AAAA,gBACT;AAAA,cACJ;AAAA,YACJ;AAAA,YACA,MAAM,SAASF,IAAGE,IAAGC,IAAG;AACpB,qBAAO,eAAeD,IAAG,cAAc;AAAA,gBACnC,OAAO;AAAA,cACX,CAAC,GAAGA,GAAE,UAAU;AAChB,kBAAID,KAAI,EAAEE,GAAE,IAAI,CAAC,GAAG,IAAI,EAAEA,GAAE,IAAI,CAAC,GAAG,IAAI,EAAEA,GAAE,IAAI,CAAC,GAAG,IAAIA,GAAE,IAAI,GAAG,IAAI,EAAEA,GAAE,IAAI,CAAC,GAAG,IAAIA,GAAE,IAAI,GAAG,IAAIA,GAAE,GAAG,GAAG,IAAIA,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI;AAC3J,uBAAS,EAAEH,IAAG;AACV,uBAAO,IAAI,cAAc,OAAO,UAAU,YAAY,OAAO,OAAO,WAAW,SAASA,IAAG;AACvF,yBAAO,OAAOA;AAAA,gBAClB,IAAI,SAASA,IAAG;AACZ,yBAAOA,MAAK,cAAc,OAAO,UAAUA,GAAE,gBAAgB,UAAUA,OAAM,OAAO,YAAY,WAAW,OAAOA;AAAA,gBACtH,GAAG,EAAEA,EAAC;AAAA,cACV;AACA,uBAAS,EAAEA,IAAG;AACV,uBAAOA,MAAKA,GAAE,aAAaA,KAAI;AAAA,kBAC3B,SAASA;AAAA,gBACb;AAAA,cACJ;AACA,kBAAI,IAAI,EAAE,QAAQ,UAAU,IAAI;AAChC,uBAAS,EAAEA,IAAGE,IAAGC,IAAG;AAChB,oBAAI,EAAE,gBAAgB,GAAI,QAAO,IAAI,EAAEH,IAAGE,IAAGC,EAAC;AAC9C,qBAAK,gBAAgB,EAAE,SAAS,KAAK,KAAK,QAAQ,KAAK,SAAS,CAAC,GAAG,KAAK,UAAU,QACnF,SAAOA,OAAM,sBAAsB,OAAO,UAAU,SAAS,KAAKH,EAAC,IAAIE,KAAIF,MAAKE,KAAIA,MAAK,CAAC,GAC1FF,OAAME,GAAE,QAAQF,MAAK,KAAK,OAAO,EAAE,QAAQ,OAAO,MAAI,CAAC,GAAG,KAAK,UAAUE,EAAC,GAAG,KAAK,eAAeA,MAAK,WAAWA,GAAE,aACnH,KAAK,cAAcA,MAAK,CAAC,GAAG,EAAE,KAAK,KAAK,OAAOA,IAAG,KAAK,IAAI,IAAI,KAAK,eAAe,OACnF,KAAK,YAAY,QAAQ,KAAK,MAAM,QAAQ,KAAK,iBAAiB,OAAI,KAAK,kBAAkB,OAC7F,KAAK,YAAY,OAAI,KAAK,WAAW,KAAK,aAAa,OAAI,KAAK,UAAU,GAAG,KAAK,sBAAsB,QACxG,KAAK,cAAc,OAAI,KAAK,gBAAgB;AAAA,cAChD;AACA,uBAAS,EAAEF,IAAGE,IAAGC,IAAG;AAChB,oBAAIF,KAAI,EAAE,UAAU,QAAQD,EAAC;AAC7B,uBAAOC,MAAKA,GAAE,SAAS,EAAEA,GAAE,OAAO,QAAQE,EAAC,GAAG,EAAE,QAAQ,OAAO,MAAIA,IAAGF,EAAC,GAAG,EAAE,QAAQ,OAAO,MAAIE,IAAGD,EAAC,GACnG,SAAO,SAASC,GAAE,SAASA,GAAE,OAAOH,KAAI;AAAA,cAC5C;AACA,gBAAE,YAAY;AAAA,gBACV,eAAe;AAAA,gBACf,UAAUC,GAAE;AAAA,gBACZ,aAAa,EAAE;AAAA,gBACf,SAAS,CAAC;AAAA,gBACV,YAAY,CAAC;AAAA,gBACb,MAAM,CAAC;AAAA,gBACP,IAAI,QAAQ;AACR,yBAAO,KAAK,KAAK,SAAS,KAAK,KAAK;AAAA,gBACxC;AAAA,gBACA,MAAM,SAASD,IAAG;AACd,sBAAIE,KAAI;AACR,yBAAO,YAAY,OAAOF,OAAMA,KAAI,EAAE,eAAeA,EAAC,KAAK,EAAE,iBAAiBA,EAAC,KAC9EA,KAAIA,GAAE,WAAW,CAAEA,EAAE,IAAI,MAAM,QAAQA,EAAC,IAAIA,KAAI,CAAC,EAAE,MAAM,KAAKA,EAAC,GAAG,QAAS,SAASA,IAAGG,IAAG;AACvF,wBAAIF,KAAI,EAAE,QAAQ,OAAO,MAAI,CAAC,GAAGC,GAAE,IAAI;AACvC,wBAAI,SAASF,IAAGE,IAAGC,IAAGF,IAAG;AACrB,+BAASG,GAAEF,IAAGE,IAAG;AACb,4BAAIC,KAAI,OAAOJ,KAAIC,KAAID,KAAI,MAAMC;AACjC,kCAAUE,KAAI,WAAWA,KAAIA,KAAIJ,GAAE,aAAaK,EAAC,OAAO,YAAY,OAAOD,OAAM,MAAMF,GAAE,QAAQ,IAAI,IAAIE,KAAI,EAAE,QAAQA,EAAC,IAAI,YAAYA,KAAIA,KAAI,QAAK,WAAWA,OAAMA,KAAI,QAC1KD,GAAED,EAAC,IAAIE;AAAA,sBACX;AACA,0BAAI,SAAOF,GAAE,sBAAsB;AAC/B,4BAAII,IAAGE,IAAGE,IAAGC,IAAGF,KAAIT,GAAE,aAAaC,EAAC;AACpC,4BAAIQ,MAAK,OAAOA,OAAMA,KAAIA,GAAE,QAAQ,MAAM,GAAG,GAAGD,KAAI,KAAK,MAAM,MAAMC,KAAI,GAAG,IAC5ED;AAAG,+BAAKG,MAAKD,KAAI,QAAQF,GAAG,KAAI,YAAYG,GAAE,YAAY,GAAG;AACzD,4BAAAD,KAAIF,GAAEG,EAAC;AACP;AAAA,0BACJ;AAAA;AACA,6BAAKL,MAAKF,GAAE,SAASM,EAAC,GAAGP,GAAE,SAAS,EAAEA,GAAE,OAAOA,IAAGD,EAAC,GAAGA,IAAG;AACrD,8BAAIM;AAAG,iCAAKG,MAAKD,KAAI,QAAQF,GAAG,KAAIG,GAAE,YAAY,MAAML,GAAE,YAAY,GAAG;AACrE,8BAAAI,KAAIF,GAAEG,EAAC;AACP;AAAA,4BACJ;AAAA;AACA,0BAAAP,GAAEE,IAAGI,EAAC;AAAA,wBACV;AAAA,sBACJ;AACA,wBAAE,QAAQ,OAAO,MAAIR,IAAGC,EAAC,IAAI,UAAUH,GAAE,OAAOE,GAAE,gBAAgBF,GAAE,MAAM,YAAY;AACtF,uBAAC,UAAUA,GAAE,OAAOE,GAAE,kBAAkBF,GAAE,MAAM,OAAOA,GAAE,gBAAgB,KAAK,GAC9EE,GAAE,QAAQ;AACV,6BAAO,OAAO,KAAKC,EAAC,EAAE;AAAA,oBAC1B,EAAEH,IAAGC,IAAG,EAAE,QAAQ,OAAO,MAAI,CAAC,GAAGC,GAAE,WAAW,GAAGA,GAAE,aAAa,GAAG;AAC/D,0BAAIE,MAAK,GAAG,EAAE,iBAAiBH,IAAGC,GAAE,YAAY;AAChD,iCAAWE,OAAM,WAAWJ,GAAE,cAAcA,GAAE,UAAU,KAAK,aAAa,MAAIA,GAAE,UAAU,OAAO,IACjGA,GAAE,YAAY,IAAI,EAAE,QAAQ,QAAQ,IAAE,GAAGA,GAAE,UAAU,OAAOC,IAAGD,GAAE,UAAU,eAAeE,GAAE,cAC5FF,GAAE,UAAU,cAAc,EAAE,QAAQ,OAAO,MAAI,CAAC,GAAGE,GAAE,WAAW,GAAGF,GAAE,UAAU,KAAKA,IACpFA,GAAE,UAAU,OAAO,GAAG,EAAE,SAASA,EAAC,GAAGA,GAAE,UAAU,UAAUI,IAAG,EAAE,QAAQ,KAAKJ,IAAG,GAAGE,GAAE,WAAW,GAChG,EAAE,KAAK,KAAKF,GAAE,SAAS;AAAA,oBAC3B;AAAA,kBACJ,CAAE,GAAGA,MAAKA,GAAE,CAAC,KAAKA,GAAE,CAAC,EAAE,aAAa;AAAA,gBACxC;AAAA,gBACA,QAAQ,SAASA,IAAGE,IAAG;AACnB,yBAAO,YAAY,OAAOF,KAAI,KAAK,KAAKA,EAAC,IAAI,aAAa,EAAEA,EAAC,KAAK,EAAE,QAAQ,OAAO,KAAK,aAAaA,EAAC,GACtG,KAAK,MAAM,SAAOE,MAAK,KAAK,KAAK,KAAK,EAAE,GAAG,QAAQ;AAAA,gBACvD;AAAA,gBACA,eAAe,SAASF,IAAG;AACvB,sBAAI,KAAK,UAAU,KAAK,YAAY,GAAG,EAAE,iBAAiB,KAAK,MAAM,KAAK,YAAY,GACtF,WAAW,KAAK,MAAM,WAAWA,IAAG;AAChC,wBAAIE,MAAK,cAAc,OAAO,KAAK,KAAK,gBAAgB,KAAK,KAAK,aAAa,KAAK,MAAMF,IAAG,KAAK,IAAI,KAAKA,IAAG,MAAM,EAAE;AACtH,sBAAE,SAAS,KAAK,MAAM,QAAQ,OAAI,OAAIE,EAAC,GAAG,cAAc,OAAO,KAAK,KAAK,iBAAiB,KAAK,KAAK,cAAc,KAAK,MAAM,QAAQ,EAAE,UAAU,KAAK,IAAI,GAAG,GAAG,KAAK,IAAI;AAAA,kBAC7K;AACA,yBAAO,EAAE,cAAc,KAAK,MAAM,KAAK,EAAE;AAAA,gBAC7C;AAAA,gBACA,QAAQ,WAAW;AACf,sBAAI,KAAK,IAAI;AACT,sBAAE,QAAQ,KAAK,KAAK,IAAI,GAAG,IAAI;AAC/B,wBAAIF,KAAI,KAAK,KAAK,cAAc,GAAG,EAAE,eAAe,KAAK,EAAE,IAAI,KAAK,UAAU,KAAK,KAAK,UAAU;AAClG,oBAAAA,OAAM,EAAE,kBAAkB,KAAK,IAAI,EAAE,KAAK,EAAE,IAAI,KAAK,UAAUA,IAAG,KAAK,KAAK,UAAU,IAAI,KAAK,UAAU,EAAE,GAC3G,EAAE,WAAW,IAAI,KAAK,EAAE,GAAG,OAAO,4BAA4B,OAAO,iBAAiB,OAAO,yBAAyB,OAAO,eAAe,KAAK,EAAE,GAAG,OAAO,KAAK,KAAK,cAAc,OAAO,eAAe,KAAK,IAAI,SAAS;AAAA,sBACzN,KAAK,KAAK;AAAA,sBACV,KAAK,KAAK;AAAA,sBACV,cAAc;AAAA,oBAClB,CAAC,IAAI,EAAE,oBAAoB,KAAK,GAAG,iBAAiB,OAAO,KAAK,KAAK,eAAe,KAAK,GAAG,iBAAiB,SAAS,KAAK,UAAU,GACrI,KAAK,GAAG,iBAAiB,SAAS,KAAK,UAAU,IAAI,KAAK,GAAG,YAAY;AAAA,kBAC7E;AACA,yBAAO,KAAK;AAAA,gBAChB;AAAA,gBACA,cAAc,WAAW;AACrB,yBAAO,KAAK,UAAU,KAAK,YAAY,GAAG,EAAE,iBAAiB,KAAK,MAAM,KAAK,YAAY,IACxF,KAAK,QAAQ,EAAE,kBAAkB,KAAK,IAAI,EAAE,QAAQ,IAAI,EAAE,kBAAkB,KAAK,IAAI,GAAG,KAAK,EAAE;AAAA,gBACpG;AAAA,gBACA,gBAAgB,WAAW;AACvB,yBAAO,CAAC,KAAK,KAAK;AAAA,gBACtB;AAAA,gBACA,YAAY,WAAW;AACnB,yBAAO,KAAK,UAAU,KAAK,YAAY,GAAG,EAAE,iBAAiB,KAAK,MAAM,KAAK,YAAY,GACzF,EAAE,WAAW,KAAK,MAAM,EAAE,UAAU,KAAK,IAAI,CAAC;AAAA,gBAClD;AAAA,gBACA,aAAa,WAAW;AACpB,sBAAI,KAAK,UAAU,KAAK,YAAY,GAAG,EAAE,iBAAiB,KAAK,MAAM,KAAK,YAAY,GACtF,MAAM,QAAQ,KAAK,QAAQ,QAAQ,GAAG;AAClC,wBAAIA,KAAI,EAAE,gBAAgB,KAAK,MAAM,MAAI,GAAG,KAAE,EAAE,KAAK,EAAE;AACvD,2BAAO,KAAK,QAAQ,SAAS,QAAS,SAASE,IAAG;AAC9C,6BAAOA,GAAE,SAASF,OAAMA,KAAIE,IAAG;AAAA,oBACnC,CAAE,GAAGF;AAAA,kBACT;AACA,yBAAO,KAAK,QAAQ;AAAA,gBACxB;AAAA,gBACA,SAAS,SAASA,IAAG;AACjB,sBAAI,KAAK,UAAU,KAAK,YAAY,GAAG,EAAE,iBAAiB,KAAK,MAAM,KAAK,YAAY,GACtFA,IAAG;AACC,wBAAIE,MAAK,cAAc,OAAO,KAAK,KAAK,gBAAgB,KAAK,KAAK,aAAa,KAAK,MAAMF,IAAG,KAAK,IAAI,KAAKA,IAAG,MAAM,EAAE;AACtH,sBAAE,SAAS,KAAK,MAAM,QAAQ,MAAI,OAAIE,EAAC;AAAA,kBAC3C,MAAO,CAAAF,KAAI,KAAK,QAAQ,EAAE,UAAU,KAAK,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,UAAU,KAAK,IAAI,EAAE,KAAK,EAAE;AAC1G,2BAASG,KAAI,EAAE,UAAU,KAAK,IAAI,GAAGF,KAAI,EAAE,8BAA8B,KAAK,IAAI,GAAGG,KAAID,GAAE,SAAS,GAAGC,KAAIH,MAAK,CAAC,EAAE,OAAO,KAAK,MAAMG,EAAC,GAAGA,KAAK;AAC9I,yBAAOD,GAAE,OAAOF,IAAGG,KAAI,IAAIH,EAAC,GAAG,EAAE,WAAW,KAAK,MAAME,EAAC,KAAKH,QAAO,KAAK,QAAQ,EAAE,UAAU,KAAK,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,UAAU,KAAK,IAAI,EAAE,KAAK,EAAE;AAAA,gBACvK;AAAA,gBACA,QAAQ,SAASA,IAAGE,IAAG;AACnB,uBAAK,UAAU,KAAK,YAAY,GAAG,EAAE,iBAAiB,KAAK,MAAM,KAAK,YAAY;AAClF,sBAAIC,MAAK,cAAc,OAAO,KAAK,KAAK,gBAAgB,KAAK,KAAK,aAAa,KAAK,MAAMH,IAAG,KAAK,IAAI,KAAKA,IAAG,MAAM,EAAE;AACtH,oBAAE,SAAS,KAAK,MAAM,QAAQ,MAAI,OAAIG,EAAC;AACvC,sBAAIF,KAAI,KAAK,QAAQ,EAAE,UAAU,KAAK,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,UAAU,KAAK,IAAI,EAAE,KAAK,EAAE;AACvG,yBAAOC,KAAI;AAAA,oBACP,OAAOD;AAAA,oBACP,UAAU,KAAK,YAAY;AAAA,kBAC/B,IAAIA;AAAA,gBACR;AAAA,gBACA,UAAU,SAASD,IAAG;AAClB,uBAAK,OAAO,GAAG,EAAE,SAAS,KAAK,EAAE,EAAE,QAAQ,YAAY,CAAEA,EAAE,CAAC;AAAA,gBAChE;AAAA,gBACA,aAAa,EAAE;AAAA,cACnB,GAAG,EAAE,iBAAiB,SAASA,IAAG;AAC9B,kBAAE,QAAQ,OAAO,MAAI,EAAE,UAAU,UAAUA,EAAC;AAAA,cAChD,GAAG,EAAE,oBAAoB,SAASA,IAAG;AACjC,kBAAE,QAAQ,OAAO,MAAI,EAAE,UAAU,aAAaA,EAAC;AAAA,cACnD,GAAG,EAAE,gBAAgB,SAASA,IAAG;AAC7B,kBAAE,QAAQ,OAAO,MAAI,EAAE,UAAU,SAASA,EAAC;AAAA,cAC/C,GAAG,EAAE,SAAS,SAASA,IAAGE,IAAGC,IAAG;AAC5B,uBAAO,EAAED,EAAC,EAAE,OAAOF,IAAGG,EAAC;AAAA,cAC3B,GAAG,EAAE,SAAS,SAASH,IAAGE,IAAG;AACzB,uBAAO,EAAEA,EAAC,EAAE,cAAcF,EAAC;AAAA,cAC/B,GAAG,EAAE,UAAU,SAASA,IAAGE,IAAG;AAC1B,uBAAO,EAAEA,EAAC,EAAE,QAAQF,EAAC;AAAA,cACzB,GAAG,EAAE,SAAS,SAASA,IAAG;AACtB,4BAAY,OAAOA,OAAMA,KAAI,EAAE,eAAeA,EAAC,KAAK,EAAE,iBAAiBA,EAAC,KAAKA,KAAIA,GAAE,WAAW,CAAEA,EAAE,IAAIA,IAAG,QAAS,SAASA,IAAG;AAC1H,kBAAAA,GAAE,aAAaA,GAAE,UAAU,OAAO;AAAA,gBACtC,CAAE;AAAA,cACN,GAAG,EAAE,WAAW,SAASA,IAAGE,IAAG;AAC3B,4BAAY,OAAOF,OAAMA,KAAI,EAAE,eAAeA,EAAC,KAAK,EAAE,iBAAiBA,EAAC,KAAKA,KAAIA,GAAE,WAAW,CAAEA,EAAE,IAAIA,IAAG,QAAS,SAASA,IAAG;AAC1H,kBAAAA,GAAE,YAAYA,GAAE,UAAU,SAASE,EAAC,KAAK,GAAG,EAAE,SAASF,EAAC,EAAE,QAAQ,YAAY,CAAEE,EAAE,CAAC;AAAA,gBACvF,CAAE;AAAA,cACN,GAAG,EAAE,gBAAgB,EAAE,SAAS,EAAE,QAAQ,YAAY;AACtD,cAAAA,GAAE,UAAU;AAAA,YAChB;AAAA,YACA,MAAM,SAASF,IAAGE,IAAGC,IAAG;AACpB,uBAASF,GAAED,IAAG;AACV,uBAAOC,KAAI,cAAc,OAAO,UAAU,YAAY,OAAO,OAAO,WAAW,SAASD,IAAG;AACvF,yBAAO,OAAOA;AAAA,gBAClB,IAAI,SAASA,IAAG;AACZ,yBAAOA,MAAK,cAAc,OAAO,UAAUA,GAAE,gBAAgB,UAAUA,OAAM,OAAO,YAAY,WAAW,OAAOA;AAAA,gBACtH,GAAGC,GAAED,EAAC;AAAA,cACV;AACA,kBAAI,IAAI,EAAEG,GAAE,IAAI,CAAC,GAAG,IAAI,EAAEA,GAAE,IAAI,CAAC;AACjC,uBAAS,EAAEH,IAAGE,IAAG;AACb,yBAASC,KAAI,GAAGA,KAAID,GAAE,QAAQC,MAAK;AAC/B,sBAAIC,KAAIF,GAAEC,EAAC;AACX,kBAAAC,GAAE,aAAaA,GAAE,cAAc,OAAIA,GAAE,eAAe,MAAI,WAAWA,OAAMA,GAAE,WAAW,OACtF,OAAO,eAAeJ,KAAIK,KAAID,GAAE,KAAKE,KAAI,QAAQA,KAAI,SAASN,IAAGE,IAAG;AAChE,wBAAI,aAAaD,GAAED,EAAC,KAAK,SAASA,GAAG,QAAOA;AAC5C,wBAAIG,KAAIH,GAAE,OAAO,WAAW;AAC5B,wBAAI,WAAWG,IAAG;AACd,0BAAIC,KAAID,GAAE,KAAKH,IAAGE,MAAK,SAAS;AAChC,0BAAI,aAAaD,GAAEG,EAAC,EAAG,QAAOA;AAC9B,4BAAM,IAAI,UAAU,8CAA8C;AAAA,oBACtE;AACA,4BAAQ,aAAaF,KAAI,SAAS,QAAQF,EAAC;AAAA,kBAC/C,EAAEK,IAAG,QAAQ,GAAG,aAAaJ,GAAEK,EAAC,IAAIA,KAAI,OAAOA,EAAC,IAAIF,EAAC;AAAA,gBACzD;AACA,oBAAIC,IAAGC;AAAA,cACX;AACA,uBAAS,EAAEN,IAAG;AACV,oBAAIE,KAAI,EAAE;AACV,uBAAO,WAAW;AACd,sBAAIC,IAAGC,KAAI,EAAEJ,EAAC;AACd,sBAAIE,IAAG;AACH,wBAAIG,KAAI,EAAE,IAAI,EAAE;AAChB,oBAAAF,KAAI,QAAQ,UAAUC,IAAG,WAAWC,EAAC;AAAA,kBACzC,MAAO,CAAAF,KAAIC,GAAE,MAAM,MAAM,SAAS;AAClC,yBAAO,SAASJ,IAAGE,IAAG;AAClB,wBAAIA,OAAM,aAAaD,GAAEC,EAAC,KAAK,cAAc,OAAOA,IAAI,QAAOA;AAC/D,wBAAI,WAAWA,GAAG,OAAM,IAAI,UAAU,0DAA0D;AAChG,2BAAO,SAASF,IAAG;AACf,0BAAI,WAAWA,GAAG,OAAM,IAAI,eAAe,2DAA2D;AACtG,6BAAOA;AAAA,oBACX,EAAEA,EAAC;AAAA,kBACP,EAAE,MAAMG,EAAC;AAAA,gBACb;AAAA,cACJ;AACA,uBAAS,EAAEH,IAAG;AACV,oBAAIE,KAAI,cAAc,OAAO,MAAM,oBAAI,QAAM;AAC7C,uBAAO,IAAI,SAASF,IAAG;AACnB,sBAAI,SAASA,MAAK,CAAC,SAASA,IAAG;AAC3B,wBAAI;AACA,6BAAO,OAAO,SAAS,SAAS,KAAKA,EAAC,EAAE,QAAQ,eAAe;AAAA,oBACnE,SAASE,IAAG;AACR,6BAAO,cAAc,OAAOF;AAAA,oBAChC;AAAA,kBACJ,EAAEA,EAAC,EAAG,QAAOA;AACb,sBAAI,cAAc,OAAOA,GAAG,OAAM,IAAI,UAAU,oDAAoD;AACpG,sBAAI,WAAWE,IAAG;AACd,wBAAIA,GAAE,IAAIF,EAAC,EAAG,QAAOE,GAAE,IAAIF,EAAC;AAC5B,oBAAAE,GAAE,IAAIF,IAAGG,EAAC;AAAA,kBACd;AACA,2BAASA,KAAI;AACT,2BAAO,EAAEH,IAAG,WAAW,EAAE,IAAI,EAAE,WAAW;AAAA,kBAC9C;AACA,yBAAOG,GAAE,YAAY,OAAO,OAAOH,GAAE,WAAW;AAAA,oBAC5C,aAAa;AAAA,sBACT,OAAOG;AAAA,sBACP,YAAY;AAAA,sBACZ,UAAU;AAAA,sBACV,cAAc;AAAA,oBAClB;AAAA,kBACJ,CAAC,GAAG,EAAEA,IAAGH,EAAC;AAAA,gBACd,GAAG,EAAEA,EAAC;AAAA,cACV;AACA,uBAAS,EAAEA,IAAGE,IAAGC,IAAG;AAChB,uBAAO,IAAI,EAAE,IAAI,QAAQ,UAAU,KAAK,IAAI,SAASH,IAAGE,IAAGC,IAAG;AAC1D,sBAAIF,KAAI,CAAE,IAAK;AACf,kBAAAA,GAAE,KAAK,MAAMA,IAAGC,EAAC;AACjB,sBAAIE,KAAI,KAAK,SAAS,KAAK,MAAMJ,IAAGC,EAAC;AACrC,yBAAOE,MAAK,EAAEC,IAAGD,GAAE,SAAS,GAAGC;AAAA,gBACnC,GAAG,EAAE,MAAM,MAAM,SAAS;AAAA,cAC9B;AACA,uBAAS,IAAI;AACT,oBAAI,eAAe,OAAO,WAAW,CAAC,QAAQ,UAAW,QAAO;AAChE,oBAAI,QAAQ,UAAU,KAAM,QAAO;AACnC,oBAAI,cAAc,OAAO,MAAO,QAAO;AACvC,oBAAI;AACA,yBAAO,QAAQ,UAAU,QAAQ,KAAK,QAAQ,UAAU,SAAS,CAAC,GAAI,WAAW;AAAA,kBAAC,CAAE,CAAC,GACrF;AAAA,gBACJ,SAASJ,IAAG;AACR,yBAAO;AAAA,gBACX;AAAA,cACJ;AACA,uBAAS,EAAEA,IAAGE,IAAG;AACb,uBAAO,IAAI,OAAO,iBAAiB,OAAO,eAAe,KAAK,IAAI,SAASF,IAAGE,IAAG;AAC7E,yBAAOF,GAAE,YAAYE,IAAGF;AAAA,gBAC5B,GAAG,EAAEA,IAAGE,EAAC;AAAA,cACb;AACA,uBAAS,EAAEF,IAAG;AACV,uBAAO,IAAI,OAAO,iBAAiB,OAAO,eAAe,KAAK,IAAI,SAASA,IAAG;AAC1E,yBAAOA,GAAE,aAAa,OAAO,eAAeA,EAAC;AAAA,gBACjD,GAAG,EAAEA,EAAC;AAAA,cACV;AACA,uBAAS,EAAEA,IAAG;AACV,uBAAOA,MAAKA,GAAE,aAAaA,KAAI;AAAA,kBAC3B,SAASA;AAAA,gBACb;AAAA,cACJ;AACA,kBAAI,IAAI,EAAE,QAAQ;AAClB,kBAAI,KAAK,EAAE,QAAQ,EAAE,KAAK,gBAAgB,EAAE,QAAQ,kBAAkB,WAAW,EAAE,QAAQ,eAAe,IAAI,YAAY,GAAG;AACzH,oBAAI,IAAI,SAASA,IAAG;AAChB,mBAAC,SAASA,IAAGE,IAAG;AACZ,wBAAI,cAAc,OAAOA,MAAK,SAASA,GAAG,OAAM,IAAI,UAAU,oDAAoD;AAClH,oBAAAF,GAAE,YAAY,OAAO,OAAOE,MAAKA,GAAE,WAAW;AAAA,sBAC1C,aAAa;AAAA,wBACT,OAAOF;AAAA,wBACP,UAAU;AAAA,wBACV,cAAc;AAAA,sBAClB;AAAA,oBACJ,CAAC,GAAG,OAAO,eAAeA,IAAG,aAAa;AAAA,sBACtC,UAAU;AAAA,oBACd,CAAC,GAAGE,MAAK,EAAEF,IAAGE,EAAC;AAAA,kBACnB,EAAEM,IAAGR,EAAC;AACN,sBAAIE,IAAGC,IAAGF,IAAGG,KAAI,EAAEI,EAAC;AACpB,2BAASA,KAAI;AACT,wBAAIR;AACJ,qBAAC,SAASA,IAAGE,IAAG;AACZ,0BAAI,EAAEF,cAAaE,IAAI,OAAM,IAAI,UAAU,mCAAmC;AAAA,oBAClF,EAAE,MAAMM,EAAC;AACT,wBAAIN,MAAKF,KAAII,GAAE,KAAK,IAAI,GAAG,kBAAkB,GAAGD,KAAIH,GAAE,aAAa;AAAA,sBAC/D,MAAM;AAAA,oBACV,CAAC;AACD,6BAASC,MAAKD,GAAE,QAAQ,EAAE,cAAc,OAAO,GAAGA,GAAE,MAAM,OAAO,QAAQG,GAAE,YAAYH,GAAE,KAAK,GAC9FE,GAAG,QAAO,UAAU,eAAe,KAAKA,IAAGD,EAAC,KAAKD,GAAE,MAAM,aAAaE,GAAED,EAAC,GAAGD,GAAE,aAAaE,GAAED,EAAC,CAAC,CAAC;AAChG,wBAAIK,KAAI,IAAI,EAAE;AACd,2BAAOA,GAAE,gBAAgB,IAAIA,GAAE,KAAKN,GAAE,KAAK,GAAGA,GAAE,MAAM,UAAU,aAAaG,IAC7EH;AAAA,kBACJ;AACA,yBAAOE,KAAIM,KAAIL,KAAI,CAAE;AAAA,oBACjB,KAAK;AAAA,oBACL,OAAO,SAASH,IAAGE,IAAGC,IAAG;AACrB,2BAAK,MAAM,aAAaH,IAAGG,EAAC;AAAA,oBAChC;AAAA,kBACJ,GAAG;AAAA,oBACC,KAAK;AAAA,oBACL,KAAK,WAAW;AACZ,6BAAO,KAAK,MAAM;AAAA,oBACtB;AAAA,oBACA,KAAK,SAASH,IAAG;AACb,2BAAK,MAAM,QAAQA;AAAA,oBACvB;AAAA,kBACJ,CAAE,MAAM,EAAEE,GAAE,WAAWC,EAAC,GAAGF,MAAK,EAAEC,IAAGD,EAAC,GAAG,OAAO,eAAeC,IAAG,aAAa;AAAA,oBAC3E,UAAU;AAAA,kBACd,CAAC,GAAGM;AAAA,gBACR,EAAE,EAAE,WAAW,CAAC;AAChB,kBAAE,QAAQ,eAAe,OAAO,cAAc,CAAC;AAAA,cACnD;AAAA,YACJ;AAAA,YACA,MAAM,SAASR,IAAGE,IAAG;AACjB,uBAASC,GAAEH,IAAG;AACV,uBAAOG,KAAI,cAAc,OAAO,UAAU,YAAY,OAAO,OAAO,WAAW,SAASH,IAAG;AACvF,yBAAO,OAAOA;AAAA,gBAClB,IAAI,SAASA,IAAG;AACZ,yBAAOA,MAAK,cAAc,OAAO,UAAUA,GAAE,gBAAgB,UAAUA,OAAM,OAAO,YAAY,WAAW,OAAOA;AAAA,gBACtH,GAAGG,GAAEH,EAAC;AAAA,cACV;AACA,uBAASC,GAAED,IAAGE,IAAG;AACb,uBAAO,SAASF,IAAG;AACf,sBAAI,MAAM,QAAQA,EAAC,EAAG,QAAOA;AAAA,gBACjC,EAAEA,EAAC,KAAK,SAASA,IAAGE,IAAG;AACnB,sBAAIC,KAAI,QAAQH,KAAI,OAAO,eAAe,OAAO,UAAUA,GAAE,OAAO,QAAQ,KAAKA,GAAE,YAAY;AAC/F,sBAAI,QAAQG,IAAG;AACX,wBAAIF,IAAGG,IAAGC,IAAGC,IAAGC,KAAI,CAAC,GAAGC,KAAI,MAAI,IAAI;AACpC,wBAAI;AACA,0BAAIH,MAAKF,KAAIA,GAAE,KAAKH,EAAC,GAAG,MAAM,MAAME,IAAG;AACnC,4BAAI,OAAOC,EAAC,MAAMA,GAAG;AACrB,wBAAAK,KAAI;AAAA,sBACR,MAAO,QAAM,EAAEA,MAAKP,KAAII,GAAE,KAAKF,EAAC,GAAG,UAAUI,GAAE,KAAKN,GAAE,KAAK,GAAGM,GAAE,WAAWL,KAAIM,KAAI,KAAI;AAAA,oBAC3F,SAASR,IAAG;AACR,0BAAI,MAAII,KAAIJ;AAAA,oBAChB,UAAE;AACE,0BAAI;AACA,4BAAI,CAACQ,MAAK,QAAQL,GAAE,WAAWG,KAAIH,GAAE,OAAO,GAAG,OAAOG,EAAC,MAAMA,IAAI;AAAA,sBACrE,UAAE;AACE,4BAAI,EAAG,OAAMF;AAAA,sBACjB;AAAA,oBACJ;AACA,2BAAOG;AAAA,kBACX;AAAA,gBACJ,EAAEP,IAAGE,EAAC,KAAK,SAASF,IAAGE,IAAG;AACtB,sBAAI,CAACF,GAAG;AACR,sBAAI,YAAY,OAAOA,GAAG,QAAO,EAAEA,IAAGE,EAAC;AACvC,sBAAIC,KAAI,OAAO,UAAU,SAAS,KAAKH,EAAC,EAAE,MAAM,GAAG,EAAE;AACrD,+BAAaG,MAAKH,GAAE,gBAAgBG,KAAIH,GAAE,YAAY;AACtD,sBAAI,UAAUG,MAAK,UAAUA,GAAG,QAAO,MAAM,KAAKH,EAAC;AACnD,sBAAI,gBAAgBG,MAAK,2CAA2C,KAAKA,EAAC,EAAG,QAAO,EAAEH,IAAGE,EAAC;AAAA,gBAC9F,EAAEF,IAAGE,EAAC,KAAK,WAAW;AAClB,wBAAM,IAAI,UAAU,2IAA2I;AAAA,gBACnK,EAAE;AAAA,cACN;AACA,uBAAS,EAAEF,IAAGE,IAAG;AACb,iBAAC,QAAQA,MAAKA,KAAIF,GAAE,YAAYE,KAAIF,GAAE;AACtC,yBAASG,KAAI,GAAGF,KAAI,IAAI,MAAMC,EAAC,GAAGC,KAAID,IAAGC,KAAK,CAAAF,GAAEE,EAAC,IAAIH,GAAEG,EAAC;AACxD,uBAAOF;AAAA,cACX;AACA,uBAAS,EAAED,IAAGE,IAAG;AACb,oBAAIC,KAAI,OAAO,KAAKH,EAAC;AACrB,oBAAI,OAAO,uBAAuB;AAC9B,sBAAIC,KAAI,OAAO,sBAAsBD,EAAC;AACtC,kBAAAE,OAAMD,KAAIA,GAAE,OAAQ,SAASC,IAAG;AAC5B,2BAAO,OAAO,yBAAyBF,IAAGE,EAAC,EAAE;AAAA,kBACjD,CAAE,IAAIC,GAAE,KAAK,MAAMA,IAAGF,EAAC;AAAA,gBAC3B;AACA,uBAAOE;AAAA,cACX;AACA,uBAAS,EAAEH,IAAGE,IAAGD,IAAG;AAChB,wBAAQC,KAAI,SAASF,IAAG;AACpB,sBAAIE,KAAI,SAASF,IAAGE,IAAG;AACnB,wBAAI,aAAaC,GAAEH,EAAC,KAAK,SAASA,GAAG,QAAOA;AAC5C,wBAAIC,KAAID,GAAE,OAAO,WAAW;AAC5B,wBAAI,WAAWC,IAAG;AACd,0BAAIG,KAAIH,GAAE,KAAKD,IAAGE,MAAK,SAAS;AAChC,0BAAI,aAAaC,GAAEC,EAAC,EAAG,QAAOA;AAC9B,4BAAM,IAAI,UAAU,8CAA8C;AAAA,oBACtE;AACA,4BAAQ,aAAaF,KAAI,SAAS,QAAQF,EAAC;AAAA,kBAC/C,EAAEA,IAAG,QAAQ;AACb,yBAAO,aAAaG,GAAED,EAAC,IAAIA,KAAI,OAAOA,EAAC;AAAA,gBAC3C,EAAEA,EAAC,MAAMF,KAAI,OAAO,eAAeA,IAAGE,IAAG;AAAA,kBACrC,OAAOD;AAAA,kBACP,YAAY;AAAA,kBACZ,cAAc;AAAA,kBACd,UAAU;AAAA,gBACd,CAAC,IAAID,GAAEE,EAAC,IAAID,IAAGD;AAAA,cACnB;AACA,qBAAO,eAAeE,IAAG,cAAc;AAAA,gBACnC,OAAO;AAAA,cACX,CAAC,GAAGA,GAAE,OAAOA,GAAE,UAAU,QAAQA,GAAE,QAAQ,SAASF,IAAGE,IAAG;AACtD,uBAAO,EAAEF,EAAC,MAAME,KAAI,OAAO,aAAaF,EAAC,IAAI,OAAO,aAAaA,EAAC,EAAE,YAAY;AAAA,cACpF,GAAGE,GAAE,YAAY,SAASF,IAAG;AACzB,uBAAO,EAAEA,EAAC;AAAA,cACd;AACA,kBAAI,IAAIE,GAAE,UAAU,SAASF,IAAG;AAC5B,yBAASE,KAAI,GAAGA,KAAI,UAAU,QAAQA,MAAK;AACvC,sBAAIC,KAAI,QAAQ,UAAUD,EAAC,IAAI,UAAUA,EAAC,IAAI,CAAC;AAC/C,kBAAAA,KAAI,IAAI,EAAE,OAAOC,EAAC,GAAG,IAAE,EAAE,QAAS,SAASD,IAAG;AAC1C,sBAAEF,IAAGE,IAAGC,GAAED,EAAC,CAAC;AAAA,kBAChB,CAAE,IAAI,OAAO,4BAA4B,OAAO,iBAAiBF,IAAG,OAAO,0BAA0BG,EAAC,CAAC,IAAI,EAAE,OAAOA,EAAC,CAAC,EAAE,QAAS,SAASD,IAAG;AACzI,2BAAO,eAAeF,IAAGE,IAAG,OAAO,yBAAyBC,IAAGD,EAAC,CAAC;AAAA,kBACrE,CAAE;AAAA,gBACN;AACA,uBAAOF;AAAA,cACX,EAAE;AAAA,gBACE,GAAG;AAAA,gBACH,GAAG;AAAA,gBACH,GAAG;AAAA,gBACH,kBAAkB;AAAA,gBAClB,OAAO;AAAA,gBACP,WAAW;AAAA,gBACX,YAAY;AAAA,gBACZ,OAAO;AAAA,cACX,GAAG;AAAA,gBACC,KAAK;AAAA,gBACL,UAAU;AAAA,gBACV,WAAW;AAAA,gBACX,WAAW;AAAA,gBACX,YAAY;AAAA,gBACZ,SAAS;AAAA,gBACT,WAAW;AAAA,gBACX,UAAU;AAAA,gBACV,SAAS;AAAA,gBACT,aAAa;AAAA,gBACb,MAAM;AAAA,gBACN,QAAQ;AAAA,gBACR,KAAK;AAAA,gBACL,QAAQ;AAAA,gBACR,IAAI;AAAA,gBACJ,IAAI;AAAA,gBACJ,IAAI;AAAA,gBACJ,IAAI;AAAA,gBACJ,IAAI;AAAA,gBACJ,IAAI;AAAA,gBACJ,IAAI;AAAA,gBACJ,IAAI;AAAA,gBACJ,IAAI;AAAA,gBACJ,KAAK;AAAA,gBACL,KAAK;AAAA,gBACL,KAAK;AAAA,gBACL,MAAM;AAAA,gBACN,QAAQ;AAAA,gBACR,SAAS;AAAA,gBACT,UAAU;AAAA,gBACV,QAAQ;AAAA,gBACR,OAAO;AAAA,gBACP,aAAa;AAAA,gBACb,SAAS;AAAA,gBACT,OAAO;AAAA,gBACP,YAAY;AAAA,gBACZ,KAAK;AAAA,gBACL,cAAc;AAAA,cAClB,CAAC,GAAG,IAAI,OAAO,QAAQ,CAAC,EAAE,OAAQ,SAASA,IAAGE,IAAG;AAC7C,oBAAIC,KAAIF,GAAEC,IAAG,CAAC,GAAGE,KAAID,GAAE,CAAC,GAAGE,KAAIF,GAAE,CAAC;AAClC,uBAAOH,GAAEK,EAAC,IAAI,WAAWL,GAAEK,EAAC,IAAID,KAAIJ,GAAEK,EAAC,GAAGL;AAAA,cAC9C,GAAI,CAAC,CAAC;AACN,cAAAE,GAAE,OAAO,OAAO,QAAQ,CAAC,EAAE,OAAQ,SAASF,IAAGE,IAAG;AAC9C,oBAAIC,KAAIF,GAAEC,IAAG,CAAC,GAAGE,KAAID,GAAE,CAAC;AACxB,gBAAAA,GAAE,CAAC;AACH,uBAAOH,GAAEI,EAAC,IAAI,YAAYA,KAAI,MAAMA,IAAGJ;AAAA,cAC3C,GAAI,CAAC,CAAC;AAAA,YACV;AAAA,YACA,MAAM,SAASA,IAAGE,IAAGC,IAAG;AACpB,qBAAO,eAAeD,IAAG,cAAc;AAAA,gBACnC,OAAO;AAAA,cACX,CAAC,GAAGA,GAAE,cAAc,SAASF,IAAGE,IAAGC,IAAG;AAClC,oBAAIF,IAAGG,IAAGI,IAAGE,IAAG,GAAG,GAAG,IAAI,6EAA6E,IAAI,mNAAmN,IAAI,OAAI,IAAI,IAAI,EAAE,WAAS,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI;AAC7W,yBAAS,EAAEV,IAAGC,IAAGG,IAAG;AAChB,kBAAAA,KAAI,WAAWA,KAAIA,KAAIJ,GAAE,QAAQ;AACjC,sBAAIM,KAAIN,GAAE,QAAQI,KAAI,CAAC;AACvB,sBAAIF,IAAG;AACH,wBAAI,MAAMD,GAAE,QAAQ,GAAG,KAAK,KAAK,mBAAmB,KAAKA,EAAC,KAAK,QAAQA,IAAG;AACtE,0BAAIO,KAAIL,GAAE,SAAS,MAAM;AACzB,kCAAY,KAAKF,EAAC,MAAMO,MAAK,MAAMR,GAAE,QAAQ,OAAOI,MAAK,GAAG;AAAA,wBACxD,IAAI,IAAI,OAAOH,IAAGO,EAAC;AAAA,wBACnB,QAAQ;AAAA,wBACR,aAAa;AAAA,wBACb,gBAAgB,WAAWF,KAAI,WAAWA,GAAE,QAAQL;AAAA,wBACpD,QAAQ;AAAA,wBACR,KAAKA;AAAA,wBACL,aAAa,aAAa,EAAEE,GAAE,WAAW,IAAIA,GAAE,YAAY,EAAE,QAAQ,MAAM,IAAI;AAAA,wBAC/E,WAAWF;AAAA,sBACf,CAAC;AAAA,oBACL,MAAO,OAAMA,KAAIA,GAAEA,GAAE,SAAS,CAAC,IAAIA,GAAE,MAAM,EAAE,EAAE,QAAS,SAASC,IAAGD,IAAG;AACnE,sBAAAK,KAAIN,GAAE,QAAQI,KAAI,CAAC,GAAGJ,GAAE,QAAQ,OAAOI,MAAK,GAAG;AAAA,wBAC3C,IAAI,SAAS,KAAKD,GAAE,0BAA0BD,EAAC,IAAI,IAAI,OAAO,OAAOC,GAAE,0BAA0BD,MAAK,KAAKC,GAAE,SAAS,MAAM,EAAE,IAAI;AAAA,wBAClI,QAAQ;AAAA,wBACR,aAAa;AAAA,wBACb,gBAAgB,WAAWG,KAAI,WAAWA,GAAE,QAAQJ,MAAK,SAAOI,GAAE;AAAA,wBAClE,QAAQ;AAAA,wBACR,KAAKH,GAAE,0BAA0BD;AAAA,wBACjC,aAAa,WAAWC,GAAE,yBAAyBD,KAAI,aAAa,EAAEC,GAAE,WAAW,IAAIA,GAAE,YAAY,EAAE,QAAQ,MAAM,IAAI;AAAA,wBACzH,YAAY,IAAI,MAAM,MAAMD;AAAA,sBAChC,CAAC;AAAA,oBACL,CAAE;AACF,wBAAI;AAAA,kBACR,OAAO;AACH,wBAAIQ,KAAIP,GAAE,eAAeA,GAAE,YAAYF,EAAC,KAAKE,GAAE,2BAA2B,EAAE,QAAQ,UAAU,YAAYF,EAAC;AAC3G,oBAAAS,MAAK,CAAC,IAAIV,GAAE,QAAQ,OAAOI,MAAK,GAAG;AAAA,sBAC/B,IAAIM,GAAE,YAAY,YAAY,OAAOA,GAAE,YAAY,IAAI,OAAOA,GAAE,WAAWP,GAAE,SAAS,MAAM,EAAE,IAAI,IAAI,WAAW;AAC7G,6BAAK,OAAOO,GAAE;AAAA,sBAClB,MAAI;AAAA,sBACJ,QAAQA,GAAE,UAAU;AAAA,sBACpB,aAAaA,GAAE,YAAY;AAAA,sBAC3B,gBAAgBA,GAAE,YAAY;AAAA,sBAC9B,gBAAgB,WAAWJ,MAAKI,GAAE,WAAW,WAAWJ,GAAE,SAASI,GAAE,oBAAoBT;AAAA,sBACzF,QAAQS,GAAE;AAAA,sBACV,KAAKA,GAAE,oBAAoBT;AAAA,sBAC3B,aAAaS,GAAE;AAAA,sBACf,WAAWT;AAAA,sBACX,WAAWS,GAAE;AAAA,oBACjB,CAAC,KAAKV,GAAE,QAAQ,OAAOI,MAAK,GAAG;AAAA,sBAC3B,IAAI,SAAS,KAAKD,GAAE,0BAA0BF,EAAC,IAAI,IAAI,OAAO,OAAOE,GAAE,0BAA0BF,MAAK,KAAKE,GAAE,SAAS,MAAM,EAAE,IAAI;AAAA,sBAClI,QAAQ;AAAA,sBACR,aAAa;AAAA,sBACb,gBAAgB,WAAWG,KAAI,WAAWA,GAAE,QAAQL,MAAK,SAAOK,GAAE;AAAA,sBAClE,QAAQ;AAAA,sBACR,KAAKH,GAAE,0BAA0BF;AAAA,sBACjC,aAAa,WAAWE,GAAE,yBAAyBF,KAAI;AAAA,sBACvD,YAAY,IAAI,MAAM,MAAMA;AAAA,oBAChC,CAAC,GAAG,IAAI;AAAA,kBACZ;AAAA,gBACJ;AACA,yBAAS,IAAI;AACT,sBAAI,EAAE,SAAS,GAAG;AACd,wBAAI,EAAES,KAAI,EAAE,EAAE,SAAS,CAAC,GAAGN,EAAC,GAAGM,GAAE,cAAc;AAC3C,0BAAI,EAAE,IAAI;AACV,+BAASV,KAAI,GAAGA,KAAI,EAAE,QAAQ,QAAQA,KAAK,GAAE,QAAQA,EAAC,EAAE,YAAY,EAAE,QAAQA,EAAC,EAAE,UAAU;AAC3F,wBAAE,SAAS,KAAKU,KAAI,EAAE,EAAE,SAAS,CAAC,GAAG,QAAQ,KAAK,CAAC,IAAI,EAAE,QAAQ,KAAK,CAAC;AAAA,oBAC3E;AAAA,kBACJ,MAAO,GAAE,GAAGN,EAAC;AAAA,gBACjB;AACA,yBAAS,EAAEJ,IAAG;AACV,sBAAIE,KAAI,IAAI,EAAE,QAAQ,IAAE;AACxB,yBAAOA,GAAE,YAAY,OAAIA,GAAE,UAAUF,IAAGE;AAAA,gBAC5C;AACA,yBAAS,IAAI;AACT,uBAAKM,KAAI,EAAE,IAAI,GAAG,YAAY,OAAI,WAAWA,GAAG,KAAI,EAAE,SAAS,GAAG;AAC9D,yBAAKE,KAAI,EAAE,EAAE,SAAS,CAAC,GAAG,QAAQ,KAAKF,EAAC,GAAGE,GAAE,cAAc;AACvD,0BAAI,EAAE,IAAI;AACV,+BAASV,KAAI,GAAGA,KAAI,EAAE,QAAQ,QAAQA,KAAK,GAAE,QAAQA,EAAC,EAAE,UAAU,OAAI,EAAE,QAAQA,EAAC,EAAE,kBAAkB;AACrG,wBAAE,SAAS,KAAKU,KAAI,EAAE,EAAE,SAAS,CAAC,GAAG,QAAQ,KAAK,CAAC,IAAI,EAAE,QAAQ,KAAK,CAAC;AAAA,oBAC3E;AAAA,kBACJ,MAAO,GAAE,QAAQ,KAAKF,EAAC;AAAA,sBAAQ,GAAE;AAAA,gBACrC;AACA,yBAASU,GAAElB,IAAG;AACV,sBAAIE,KAAIF,GAAE,IAAI;AACd,yBAAOE,GAAE,iBAAiBA,KAAI,EAAE,CAAEF,GAAE,IAAI,GAAGE,EAAE,CAAC,IAAIA;AAAA,gBACtD;AACA,gBAAAA,OAAMC,GAAE,eAAe,CAAC,IAAI,QAAQA,GAAE,eAAe,CAAC,IAAI;AAC1D,uBAAMF,KAAIC,KAAI,EAAE,KAAKF,EAAC,IAAI,EAAE,KAAKA,EAAC,KAAK;AACnC,sBAAII,KAAIH,GAAE,CAAC,GAAGC,IAAG;AACb,4BAAQE,GAAE,OAAO,CAAC,GAAG;AAAA,sBACnB,KAAK;AACH,wBAAAA,KAAI;AACJ;AAAA,sBAEF,KAAK;AAAA,sBACL,KAAK;AACH,wBAAAA,KAAI,MAAMA,KAAI;AACd;AAAA,sBAEF,KAAK;AACH,4BAAI,MAAM,EAAE,QAAQ;AAChB,8BAAI,IAAI,EAAE,EAAE,OAAO;AACnB,4BAAE,YAAY,MAAI,EAAE,KAAK,CAAC,GAAG,EAAE,UAAU,CAAC,GAAG,IAAI;AAAA,wBACrD;AAAA,oBACJ;AACA,4BAAQA,IAAG;AAAA,sBACT,KAAK;AACH,wBAAAA,KAAI;AACJ;AAAA,sBAEF,KAAK;AACH,wBAAAA,MAAK,EAAE,KAAKJ,EAAC,EAAE,CAAC,GAAGI,MAAK,EAAE,KAAKJ,EAAC,EAAE,CAAC;AAAA,oBACvC;AAAA,kBACJ;AACA,sBAAI,EAAG,GAAE;AAAA,sBAAQ,SAAQI,GAAE,OAAO,CAAC,GAAG;AAAA,oBACpC,KAAK;AAAA,oBACL,KAAK;AACH,sBAAAF,MAAK,EAAE;AACP;AAAA,oBAEF,KAAKC,GAAE;AACL,0BAAI,MAAID,MAAK,EAAE;AACf;AAAA,oBAEF,KAAKC,GAAE,eAAe,CAAC;AAAA,oBACvB,KAAKA,GAAE,YAAY,CAAC;AAClB,wBAAE;AACF;AAAA,oBAEF,KAAKA,GAAE,eAAe,CAAC;AACrB,wBAAE,KAAK,IAAI,EAAE,QAAQ,OAAI,IAAE,CAAC;AAC5B;AAAA,oBAEF,KAAKA,GAAE,YAAY,CAAC;AAClB,wBAAE,KAAK,IAAI,EAAE,QAAQ,IAAE,CAAC;AACxB;AAAA,oBAEF,KAAKA,GAAE,iBAAiB,CAAC;AACvB,0BAAI,IAAI,IAAI,EAAE,QAAQ,OAAI,OAAI,IAAE,GAAG,KAAKC,KAAIA,GAAE,QAAQ,UAAU,EAAE,GAAG,MAAM,GAAG,GAAG,IAAI,EAAE,CAAC,EAAE,MAAM,GAAG,GAAG,IAAI,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC,CAAC,GAAG,IAAI,MAAM,EAAE,SAAS,IAAI,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC,CAAC,GAAG,IAAI,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC,CAAC;AACnP,8BAAQ,KAAK,QAAQ,MAAM,IAAI,QAAQ,IAAI,IAAI,IAAI,EAAE,aAAa;AAAA,wBAC9D,KAAK;AAAA,wBACL,KAAK;AAAA,wBACL,KAAK;AAAA,sBACT;AACA,0BAAI,IAAI,EAAE,SAAS,IAAI,EAAE,EAAE,SAAS,CAAC,EAAE,UAAU,EAAE;AACnD,uBAACH,KAAI,EAAE,IAAI,GAAG,YAAYA,KAAI,EAAE,CAAEA,EAAE,CAAC,IAAI,EAAE,KAAKA,EAAC,GAAG,EAAE,KAAK,CAAC;AAC5D;AAAA,oBAEF,KAAKE,GAAE;AACL,0BAAI,EAAE,SAAS,GAAG;AACd,4BAAI,KAAKO,KAAI,EAAE,EAAE,SAAS,CAAC,GAAG,QAAQA,GAAE,QAAQ,SAAS,CAAC;AAC1D,4BAAIA,GAAE,cAAc,WAAW,EAAE,WAAW,UAAO,EAAE,WAAW,UAAO,EAAE,gBAAgB,EAAE,IAAI,IAAIQ,GAAER,GAAE,OAAO;AAAA,sBAClH,MAAO,KAAIQ,GAAE,EAAE,OAAO;AACtB,0BAAI,EAAE,aAAc,GAAE,KAAK,CAAC;AAAA,+BAAY,EAAE,mBAAmB,IAAI,EAAE,IAAI,GAAG,EAAE,kBAAkB,SAAM,IAAI,IAAI,EAAE,QAAQ,OAAI,OAAI,OAAI,IAAE,GACpI,EAAE,QAAQ,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,WAAW;AACvC,0BAAE,YAAY;AACd,4BAAI,IAAI,IAAI,EAAE,QAAQ,IAAE;AACxB,0BAAE,kBAAkB,MAAI,EAAE,KAAK,CAAC;AAAA,sBACpC;AACA;AAAA,oBAEF;AACE,wBAAE;AAAA,kBACN;AAAA,gBACJ;AACA,qBAAK,EAAE;AACP,uBAAM,EAAE,SAAS,IAAK,CAAAV,KAAI,EAAE,IAAI,GAAG,EAAE,QAAQ,KAAKA,EAAC;AACnD,kBAAE,QAAQ,SAAS,MAAM,CAAC,SAASR,GAAEC,IAAG;AACpC,kBAAAA,MAAKA,GAAE,WAAWA,GAAE,QAAQ,QAAS,SAASG,IAAGC,IAAG;AAChD,wBAAIC,KAAIL,GAAE,QAAQI,KAAI,CAAC;AACvB,qBAAC,WAAWC,MAAK,WAAWA,GAAE,WAAW,UAAOA,GAAE,iBAAiBF,MAAKA,GAAE,YAAYA,GAAE,UAAU,OAClGF,OAAM,EAAEE,IAAGD,GAAE,YAAY,CAAC,GAAG,CAAC,GAAG,SAAOC,GAAE,aAAa,EAAEA,IAAGD,GAAE,YAAY,CAAC,CAAC,KAC5EH,GAAEI,EAAC;AAAA,kBACP,CAAE;AAAA,gBACN,EAAE,CAAC,GAAG,EAAE,KAAK,CAAC;AACd,iBAACD,GAAE,gBAAgBA,GAAE,UAAU,SAASH,GAAEE,IAAG;AACzC,2BAASD,MAAKC,GAAE,UAAUA,GAAE,QAAQ,QAAQ,GAAGA,GAAE,QAAS,KAAI,OAAO,UAAU,eAAe,KAAKA,GAAE,SAASD,EAAC,GAAG;AAC9G,wBAAIG,KAAI,SAASH,EAAC;AAClB,wBAAIC,GAAE,QAAQD,EAAC,EAAE,gBAAgBC,GAAE,QAAQE,KAAI,CAAC,KAAKF,GAAE,QAAQE,KAAI,CAAC,EAAE,SAAS;AAC3E,0BAAIC,KAAIH,GAAE,QAAQD,EAAC;AACnB,sBAAAC,GAAE,QAAQ,OAAOD,IAAG,CAAC,GAAGC,GAAE,QAAQ,OAAOE,KAAI,GAAG,GAAGC,EAAC;AAAA,oBACxD;AACA,+BAAWH,GAAE,QAAQD,EAAC,EAAE,UAAUC,GAAE,QAAQD,EAAC,IAAID,GAAEE,GAAE,QAAQD,EAAC,CAAC,IAAIC,GAAE,QAAQD,EAAC,MAAMK,KAAIJ,GAAE,QAAQD,EAAC,OAAOE,GAAE,eAAe,CAAC,IAAIG,KAAIH,GAAE,eAAe,CAAC,IAAIG,OAAMH,GAAE,eAAe,CAAC,IAAIG,KAAIH,GAAE,eAAe,CAAC,IAAIG,OAAMH,GAAE,YAAY,CAAC,IAAIG,KAAIH,GAAE,YAAY,CAAC,IAAIG,OAAMH,GAAE,YAAY,CAAC,MAAMG,KAAIH,GAAE,YAAY,CAAC,IAC9SG;AAAA,kBACJ;AACA,sBAAIA;AACJ,yBAAOJ;AAAA,gBACX,EAAE,EAAE,CAAC,CAAC;AACN,uBAAO;AAAA,cACX,GAAGA,GAAE,kBAAkB,SAASF,IAAGE,IAAG;AAClC,oBAAIC;AACJ,yBAASG,GAAEN,IAAGE,IAAG;AACb,sBAAIC,KAAID,GAAE,QAAQD,KAAIC,GAAE,aAAaG,KAAIH,GAAE,kBAAkBI,KAAIJ,GAAE;AACnE,sBAAIC,KAAI,KAAK,QAAQA,MAAK,QAAQA,IAAG;AACjC,wBAAII,KAAI,QAAQJ,KAAI,IAAI,QAAQA,KAAI,IAAIA;AACxC,wBAAII,MAAKJ,GAAG,CAAAH,KAAIC,GAAE,CAAC,IAAID,KAAIC,GAAE,CAAC,IAAII,GAAE,CAAC,IAAIE,KAAI,MAAMJ,KAAIE,GAAE,CAAC;AAAA,wBAAQ,UAASK,KAAIV,IAAGW,KAAI,GAAGA,KAAIJ,IAAGI,KAAK,CAAAX,MAAKU;AAAA,kBAC9G;AACA,sBAAI,SAAOJ,IAAG;AACV,wBAAI,IAAIN,GAAE,MAAM,IAAI,OAAO,sBAAsB,GAAG,CAAC;AACrD,yBAAK,EAAE,QAAS,SAASE,IAAGC,IAAG;AAC3B,0BAAIF,KAAI,SAASD,IAAGE,IAAG;AACnB,+BAAO,SAASF,IAAG;AACf,8BAAI,MAAM,QAAQA,EAAC,EAAG,QAAOA;AAAA,wBACjC,EAAEA,EAAC,KAAK,SAASA,IAAGE,IAAG;AACnB,8BAAIC,KAAI,QAAQH,KAAI,OAAO,eAAe,OAAO,UAAUA,GAAE,OAAO,QAAQ,KAAKA,GAAE,YAAY;AAC/F,8BAAI,QAAQG,IAAG;AACX,gCAAIF,IAAGG,IAAGC,IAAGC,IAAGC,KAAI,CAAC,GAAGC,KAAI,MAAIE,KAAI;AACpC,gCAAI;AACA,kCAAIL,MAAKF,KAAIA,GAAE,KAAKH,EAAC,GAAG,MAAM,MAAME,IAAG;AACnC,oCAAI,OAAOC,EAAC,MAAMA,GAAG;AACrB,gCAAAK,KAAI;AAAA,8BACR,MAAO,QAAM,EAAEA,MAAKP,KAAII,GAAE,KAAKF,EAAC,GAAG,UAAUI,GAAE,KAAKN,GAAE,KAAK,GAAGM,GAAE,WAAWL,KAAIM,KAAI,KAAI;AAAA,4BAC3F,SAASR,IAAG;AACR,8BAAAU,KAAI,MAAIN,KAAIJ;AAAA,4BAChB,UAAE;AACE,kCAAI;AACA,oCAAI,CAACQ,MAAK,QAAQL,GAAE,WAAWG,KAAIH,GAAE,OAAO,GAAG,OAAOG,EAAC,MAAMA,IAAI;AAAA,8BACrE,UAAE;AACE,oCAAII,GAAG,OAAMN;AAAA,8BACjB;AAAA,4BACJ;AACA,mCAAOG;AAAA,0BACX;AAAA,wBACJ,EAAEP,IAAGE,EAAC,KAAK,SAASF,IAAGE,IAAG;AACtB,8BAAI,CAACF,GAAG;AACR,8BAAI,YAAY,OAAOA,GAAG,QAAO,EAAEA,IAAGE,EAAC;AACvC,8BAAIC,KAAI,OAAO,UAAU,SAAS,KAAKH,EAAC,EAAE,MAAM,GAAG,EAAE;AACrD,uCAAaG,MAAKH,GAAE,gBAAgBG,KAAIH,GAAE,YAAY;AACtD,8BAAI,UAAUG,MAAK,UAAUA,GAAG,QAAO,MAAM,KAAKH,EAAC;AACnD,8BAAI,gBAAgBG,MAAK,2CAA2C,KAAKA,EAAC,EAAG,QAAO,EAAEH,IAAGE,EAAC;AAAA,wBAC9F,EAAEF,IAAGE,EAAC,KAAK,WAAW;AAClB,gCAAM,IAAI,UAAU,2IAA2I;AAAA,wBACnK,EAAE;AAAA,sBACN,EAAEA,GAAE,MAAM,GAAG,GAAG,CAAC,GAAGG,KAAIJ,GAAE,CAAC,GAAGK,KAAIL,GAAE,CAAC;AACrC,sBAAAK,KAAIA,GAAE,QAAQ,KAAK,EAAE,GAAGN,KAAIA,GAAE,QAAQ,IAAI,OAAO,GAAG,QAAQ,GAAG,EAAE,SAASK,EAAC,GAAG,KAAK,EAAE,QAAQ,GAC7F,EAAE,SAASC,EAAC,GAAG,KAAK,CAAC,GAAGD,GAAE,OAAO,CAAC,MAAMC,GAAE,OAAO,CAAC,IAAI,IAAI,OAAOD,IAAG,GAAG,EAAE,OAAOA,EAAC,EAAE,OAAOC,IAAG,GAAG,IAAI,GAAG,OAAOD,IAAG,GAAG,EAAE,OAAOC,IAAG,GAAG,CAAC;AAAA,oBACxI,CAAE;AAAA,kBACN;AACA,yBAAON;AAAA,gBACX;AACA,yBAASU,GAAEV,IAAGG,IAAGC,IAAG;AAChB,sBAAII,IAAGE,IAAGC,KAAI;AACd,yBAAO,SAASX,MAAK,OAAOA,QAAOW,KAAI,SAASP,GAAE,SAASJ,MAAKA,KAAII,GAAE,OAAO,QAAQ,kBAAkB,IAAI,KAAKO,KAAI,MACpHX,KAAI,QAAQ,MAAMA,GAAE,UAAU,UAAOI,GAAE,UAAU,MAAMA,GAAE,WAAWA,GAAE,cAAc,KACpFJ,KAAIM,GAAEN,IAAGI,EAAC,GAAGM,KAAIC,KAAI,WAAWP,GAAE,QAAQA,GAAE,eAAeJ,GAAE,MAAM,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAIA,IAC5F,SAASI,GAAE,eAAeM,KAAI,QAAQN,GAAE,aAAaM,KAAI,aAAa,EAAEN,GAAE,WAAW,MAAMM,KAAI,QAAQ,KAAK,UAAUN,GAAE,WAAW,IAAIM,KACvI,WAAW,EAAE,QAAQ,UAAU,WAAWA,EAAC,KAAK,SAAOR,MAAKM,KAAI;AAAA,oBAC5D,MAAMR;AAAA,oBACN,WAAW,EAAE,QAAQ,UAAU,YAAYA,IAAGW,IAAGP,EAAC;AAAA,oBAClD,gBAAgB,CAAC;AAAA,oBACjB,SAAS;AAAA,oBACT,QAAQ;AAAA,oBACR,OAAO,CAAC;AAAA,oBACR,UAAU,CAAC;AAAA,oBACX,UAAUD;AAAA,oBACV,YAAY;AAAA,oBACZ,WAAW,CAAC;AAAA,kBAChB,GAAG,SAAOD,OAAM,EAAE,QAAQ,UAAU,WAAWQ,EAAC,IAAIF,IAAGA,KAAIP,GAAE,QAAQ,OAAO,MAAI,CAAC,GAAG,EAAE,QAAQ,UAAU,WAAWS,EAAC,CAAC,MAAMF,KAAIP,GAAE,QAAQ,OAAO,MAAI,CAAC,GAAG,EAAE,QAAQ,UAAU,WAAWS,EAAC,CAAC,GACzLF;AAAA,gBACJ;AACA,8BAAc,OAAOR,GAAE,SAASA,GAAE,OAAOA,GAAE,KAAKA,EAAC;AACjD,oBAAI,MAAM,QAAQA,GAAE,IAAI,GAAG;AACvB,sBAAIA,GAAE,KAAK,SAAS,GAAG;AACnB,6BAASA,GAAE,eAAeA,GAAE,aAAa;AACzC,wBAAI,IAAIA,GAAE,YAAY,CAAC;AACvB,4BAAQA,GAAE,QAAQA,GAAE,KAAK,QAAQ,IAAIA,GAAE,MAAM,QAAS,SAASE,IAAG;AAC9D,wBAAE,SAAS,MAAM,KAAKF,GAAE,mBAAmB,WAAWE,GAAE,QAAQ,cAAc,OAAOA,GAAE,OAAO,KAAKA,GAAE,OAAO,KAAKA;AAAA,oBACrH,CAAE,GAAGQ,GAAE,KAAKV,GAAE,YAAY,CAAC,GAAGA,GAAE,MAAMA,EAAC;AAAA,kBAC3C;AACA,kBAAAA,GAAE,OAAOA,GAAE,KAAK,IAAI;AAAA,gBACxB;AACA,gBAAAG,KAAIH,GAAE,QAAQ,WAAWA,GAAE,KAAK,QAAQ,cAAc,OAAOA,GAAE,KAAK,OAAOU,GAAEV,GAAE,KAAK,MAAMA,GAAE,MAAMA,EAAC,IAAIU,GAAEV,GAAE,MAAMA,GAAE,MAAMA,EAAC;AAC1H,yBAASA,GAAE,eAAeA,GAAE,aAAa;AACzC,uBAAOG;AAAA,cACX;AACA,kBAAIF,KAAI,EAAEE,GAAE,IAAI,CAAC,GAAG,IAAI,EAAEA,GAAE,IAAI,CAAC,GAAG,IAAI,EAAEA,GAAE,IAAI,CAAC,GAAG,IAAI,EAAEA,GAAE,IAAI,CAAC;AACjE,uBAAS,EAAEH,IAAG;AACV,uBAAO,IAAI,cAAc,OAAO,UAAU,YAAY,OAAO,OAAO,WAAW,SAASA,IAAG;AACvF,yBAAO,OAAOA;AAAA,gBAClB,IAAI,SAASA,IAAG;AACZ,yBAAOA,MAAK,cAAc,OAAO,UAAUA,GAAE,gBAAgB,UAAUA,OAAM,OAAO,YAAY,WAAW,OAAOA;AAAA,gBACtH,GAAG,EAAEA,EAAC;AAAA,cACV;AACA,uBAAS,EAAEA,IAAGE,IAAG;AACb,iBAAC,QAAQA,MAAKA,KAAIF,GAAE,YAAYE,KAAIF,GAAE;AACtC,yBAASG,KAAI,GAAGF,KAAI,IAAI,MAAMC,EAAC,GAAGC,KAAID,IAAGC,KAAK,CAAAF,GAAEE,EAAC,IAAIH,GAAEG,EAAC;AACxD,uBAAOF;AAAA,cACX;AACA,uBAAS,EAAED,IAAG;AACV,uBAAOA,MAAKA,GAAE,aAAaA,KAAI;AAAA,kBAC3B,SAASA;AAAA,gBACb;AAAA,cACJ;AAAA,YACJ;AAAA,YACA,KAAK,SAASA,IAAGE,IAAGC,IAAG;AACnB,qBAAO,eAAeD,IAAG,cAAc;AAAA,gBACnC,OAAO;AAAA,cACX,CAAC,GAAGA,GAAE,OAAO,WAAW;AACpB,oBAAIF,KAAI,MAAME,KAAI,KAAK,MAAMC,KAAI,KAAK,IAAI,IAAI,KAAK;AACnD,kBAAE,WAAW,IAAIA,EAAC;AAClB,oBAAI,IAAI,SAASD,IAAGC,IAAG;AACnB,sBAAIF,KAAIC,GAAE,aAAa,MAAM,GAAGE,KAAI,YAAYF,GAAE,QAAQ,YAAY,KAAKC,GAAE,kBAAkB,SAASF,EAAC,KAAKC,GAAE,qBAAqB,eAAeA,GAAE,QAAQ,YAAY;AAC1K,sBAAI,CAACE,GAAG,KAAI,YAAYF,GAAE,QAAQ,YAAY,GAAG;AAC7C,wBAAIM,KAAI,SAAS,cAAc,OAAO;AACtC,oBAAAA,GAAE,aAAa,QAAQP,EAAC,GAAGG,KAAI,WAAWI,GAAE,MAAMA,KAAI;AAAA,kBAC1D,MAAO,CAAAJ,KAAI;AACX,yBAAO,UAAOA,KAAI,SAASF,IAAG;AAC1B,wBAAID,IAAGG;AACP,6BAASI,KAAI;AACT,6BAAO,KAAK,YAAY,KAAK,UAAU,KAAK,aAAa,KAAK,UAAU,cAAc,IAAI,OAAO,EAAE,qBAAqB,KAAKR,EAAC,KAAK,SAAOG,GAAE,YAAY,KAAK,UAAU,cAAc,KAAK,eAAe,kBAAkB,QAAQA,GAAE,wBAAwBH,GAAE,QAAQ,EAAE,kBAAkB,KAAKA,IAAG,EAAE,UAAU,KAAKA,EAAC,EAAE,MAAM,CAAC,EAAE,QAAQ,IAAI,EAAE,kBAAkB,KAAKA,IAAG,EAAE,UAAU,KAAKA,EAAC,EAAE,MAAM,CAAC,GAAG,KAAK,EAAE,IAAIC,GAAE,KAAK,IAAI,IAAI,KAAKA,GAAE,KAAK,IAAI;AAAA,oBACpb;AACA,6BAASU,GAAEX,IAAG;AACV,sBAAAI,GAAE,KAAK,MAAMJ,EAAC,GAAG,KAAK,cAAc,GAAG,EAAE,iBAAiB,MAAMA,EAAC;AAAA,oBACrE;AACA,wBAAI,CAACE,GAAE,UAAU,YAAY;AACzB,0BAAI,SAAOC,GAAE,iBAAiB;AAC1B,4BAAI,OAAO,0BAA0B;AACjC,8BAAIM,KAAI,OAAO,iBAAiB,OAAO,yBAAyB,OAAO,eAAeP,EAAC,GAAG,OAAO,IAAI;AACrG,0BAAAO,MAAKA,GAAE,OAAOA,GAAE,OAAOR,KAAIQ,GAAE,KAAKL,KAAIK,GAAE,KAAK,OAAO,eAAeP,IAAG,SAAS;AAAA,4BAC3E,KAAKM;AAAA,4BACL,KAAKG;AAAA,4BACL,cAAc;AAAA,0BAClB,CAAC,KAAK,YAAYT,GAAE,QAAQ,YAAY,MAAMD,KAAI,WAAW;AACzD,mCAAO,KAAK;AAAA,0BAChB,GAAGG,KAAI,SAASJ,IAAG;AACf,iCAAK,cAAcA;AAAA,0BACvB,GAAG,OAAO,eAAeE,IAAG,SAAS;AAAA,4BACjC,KAAKM;AAAA,4BACL,KAAKG;AAAA,4BACL,cAAc;AAAA,0BAClB,CAAC;AAAA,wBACL,MAAO,UAAS,oBAAoBT,GAAE,iBAAiB,OAAO,MAAMD,KAAIC,GAAE,iBAAiB,OAAO,GAClGE,KAAIF,GAAE,iBAAiB,OAAO,GAAGA,GAAE,iBAAiB,SAASM,EAAC,GAAGN,GAAE,iBAAiB,SAASS,EAAC;AAC9F,wBAAAT,GAAE,UAAU,aAAaD,IAAGC,GAAE,UAAU,aAAaE;AAAA,sBACzD;AACA,sBAAAF,GAAE,UAAU,YAAY,SAASA,IAAG;AAChC,+BAAOF,GAAE,SAAS,SAAOE,KAAID,GAAE,KAAK,KAAK,EAAE,EAAE,MAAM,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAIA,GAAE,KAAK,KAAK,EAAE;AAAA,sBAC9F,GAAGC,GAAE,UAAU,YAAY,SAASA,IAAGC,IAAG;AACtC,wBAAAC,GAAE,KAAK,KAAK,IAAI,QAAQF,KAAI,KAAK,SAAOC,MAAKH,GAAE,QAAQE,GAAE,MAAM,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAIA,EAAC;AAAA,sBAC7F,GAAG,WAAWD,OAAMA,KAAI,WAAW;AAC/B,+BAAO,KAAK;AAAA,sBAChB,GAAGG,KAAI,SAASJ,IAAG;AACf,6BAAK,QAAQA;AAAA,sBACjB,GAAG,SAASE,IAAG;AACX,4BAAI,EAAE,aAAa,WAAW,EAAE,SAASA,EAAC,KAAK,SAAO,EAAE,SAASA,EAAC,EAAE,iBAAiB;AACjF,8BAAID,KAAI,EAAE,SAASC,EAAC,KAAK,EAAE,SAASA,EAAC,EAAE,MAAM,EAAE,SAASA,EAAC,EAAE,MAAM,SAASF,IAAG;AACzE,mCAAOA,GAAE;AAAA,0BACb,GAAGI,KAAI,EAAE,SAASF,EAAC,KAAK,EAAE,SAASA,EAAC,EAAE,MAAM,EAAE,SAASA,EAAC,EAAE,MAAM,SAASF,IAAGE,IAAG;AAC3E,mCAAOF,GAAE,QAAQE,IAAGF;AAAA,0BACxB;AACA,4BAAE,SAASE,EAAC,IAAI;AAAA,4BACZ,KAAK,SAASA,IAAG;AACb,kCAAIA,GAAE,WAAW;AACb,oCAAIA,GAAE,UAAU,KAAK,WAAY,QAAOA,GAAE,UAAU,cAAc;AAClE,oCAAIE,KAAIH,GAAEC,EAAC;AACX,uCAAO,OAAO,EAAE,qBAAqB,KAAKF,IAAG,QAAQ,QAAQE,GAAE,UAAU,QAAQ,cAAc,KAAK,SAAOC,GAAE,WAAWC,KAAI;AAAA,8BAChI;AACA,qCAAOH,GAAEC,EAAC;AAAA,4BACd;AAAA,4BACA,KAAK,SAASF,IAAGE,IAAG;AAChB,kCAAIC,KAAIC,GAAEJ,IAAGE,EAAC;AACd,qCAAOF,GAAE,cAAc,GAAG,EAAE,iBAAiBA,IAAGE,EAAC,GAAGC;AAAA,4BACxD;AAAA,4BACA,gBAAgB;AAAA,0BACpB;AAAA,wBACJ;AAAA,sBACJ,EAAED,GAAE,IAAI,GAAG,SAASF,IAAG;AACnB,0BAAE,WAAW,GAAGA,IAAG,cAAe,WAAW;AACzC,8BAAIA,KAAI,MAAME,KAAIF,GAAE,UAAU,UAAU,IAAE;AAC1C,0BAAAE,OAAMF,GAAE,UAAU,QAAQ,EAAE,UAAU,KAAKA,GAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,IAAI,EAAE,UAAU,KAAKA,GAAE,SAAS,GAAG,KAAK,EAAE,MAAM,GACxH,EAAE,iBAAiBA,IAAGE,EAAC;AAAA,wBAC3B,CAAE;AAAA,sBACN,EAAEA,EAAC;AAAA,oBACP;AAAA,kBACJ,EAAEA,EAAC,IAAIA,GAAE,YAAY,QAAQE;AAAA,gBACjC,EAAED,IAAGD,EAAC;AACN,oBAAI,UAAO,GAAG;AACV,kBAAAF,GAAE,sBAAsBG,GAAE,aAAaH,GAAE,YAAY,WAAWG,KAAIA,GAAE,YAAY,QAClF,OAAOH,GAAE,cAAcA,GAAE,YAAY,SAAS,eAAeG,MAAK,SAASA,GAAE,aAAa,WAAW,MAAMA,GAAE,YAAYD,GAAE,WAC3HC,GAAE,aAAa,aAAaD,GAAE,SAAS,IAAI,SAAO,MAAMA,GAAE,kBAAkBA,GAAE,mBAAmB,OAAO,CAAE,aAAa,QAAS,EAAE,QAAQC,GAAE,YAAY,GACxJF,GAAE,WAAWC,GAAE,mBAAmB,OAAIC,GAAE,aAAa,eAAe,KAAK,IAAI,EAAE,WAAW,GAAGA,IAAG,UAAU,EAAE,cAAc,WAAW,GACrI,EAAE,WAAW,GAAGA,IAAG,SAAS,EAAE,cAAc,UAAU,GAAG,EAAE,WAAW,GAAGA,IAAG,QAAQ,EAAE,cAAc,SAAS,GAC7G,EAAE,WAAW,GAAGA,IAAG,SAAS,EAAE,cAAc,UAAU,GAAG,EAAE,WAAW,GAAGA,IAAG,WAAW,EAAE,cAAc,YAAY,GACnH,EAAE,WAAW,GAAGA,IAAG,SAAS,EAAE,cAAc,UAAU,GAAG,EAAE,WAAW,GAAGA,IAAG,cAAc,EAAE,cAAc,eAAe,GACzH,EAAE,WAAW,GAAGA,IAAG,cAAc,EAAE,cAAc,eAAe,GAAG,EAAE,WAAW,GAAGA,IAAG,SAAS,EAAE,cAAc,UAAU,GACzH,EAAE,WAAW,GAAGA,IAAG,OAAO,EAAE,cAAc,QAAQ,GAAG,EAAE,WAAW,GAAGA,IAAG,YAAYD,GAAE,UAAU,GAChG,EAAE,WAAW,GAAGC,IAAG,cAAcD,GAAE,YAAY,GAAG,EAAE,WAAW,GAAGC,IAAG,WAAWD,GAAE,SAAS,GAC3F,SAAOA,GAAE,kBAAkB,EAAE,WAAW,GAAGC,IAAG,WAAW,EAAE,cAAc,QAAQ,IAChFF,GAAE,UAAUC,GAAE,mBAAmBC,GAAE,gBAAgB,WAAW,GAAG,EAAE,WAAW,GAAGA,IAAG,SAAS,EAAE,cAAc,kBAAkB,IAChI,EAAE,WAAW,GAAGA,IAAG,YAAY,EAAE,cAAc,aAAa,GAAG,WAAWH,GAAE,iBAAiBA,GAAE,cAAc,GAC7G,EAAE,kBAAkB,KAAKA,EAAC,EAAE,KAAK,EAAE,GAAGA,GAAE,YAAYA,GAAE,UAAU,IAAE;AAClE,sBAAI,KAAKG,GAAE,UAAU,cAAcA,GAAE,eAAe;AACpD,sBAAI,OAAOA,GAAE,UAAU,UAAU,IAAE,KAAK,UAAOD,GAAE,wBAAwB,MAAMC,IAAG;AAC9E,qBAAC,GAAG,EAAE,iBAAiBA,IAAGA,GAAE,UAAU,UAAU,IAAE,GAAGD,EAAC;AACtD,wBAAI,IAAI,EAAE,UAAU,KAAKF,EAAC,EAAE,MAAM;AAClC,8BAAO,EAAE,WAAW,KAAKA,IAAG,CAAC,KAAKE,GAAE,mBAAmB,EAAE,aAAa,KAAKF,IAAG,KAAE,GAChFE,GAAE,wBAAwB,MAAMC,OAAM,OAAO,EAAE,qBAAqB,KAAKH,EAAC,IAAI,IAAI,CAAC,IAAI,EAAE,kBAAkB,KAAKA,IAAG,CAAC,KACnH,UAAOE,GAAE,wBAAwBA,GAAE,mBAAmB,MAAMC,MAAK,OAAOA,GAAE,UAAU,UAAU,IAAE,OAAO,GACxG,EAAE,aAAaA,IAAG,CAAC,GAAG,MAAMA,MAAK,EAAE,MAAM,KAAKH,IAAGG,IAAG,EAAE,SAAS,KAAKH,IAAG,EAAE,qBAAqB,KAAKA,EAAC,CAAC,CAAC;AAAA,kBAC1G;AAAA,gBACJ;AAAA,cACJ;AACA,kBAAIC,KAAIE,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI;AAAA,YACnF;AAAA,YACA,MAAM,SAASH,IAAGE,IAAG;AACjB,qBAAO,eAAeA,IAAG,cAAc;AAAA,gBACnC,OAAO;AAAA,cACX,CAAC,GAAGA,GAAE,UAAU,SAASF,IAAGE,IAAGC,IAAGF,IAAG;AACjC,qBAAK,UAAU,CAAC,GAAG,KAAK,YAAYD,MAAK,OAAI,KAAK,kBAAkB,OAAI,KAAK,UAAUA,MAAK,OAC5F,KAAK,aAAaE,MAAK,OAAI,KAAK,eAAeC,MAAK,OAAI,KAAK,eAAeF,MAAK,OACjF,KAAK,aAAa;AAAA,kBACd,KAAK;AAAA,kBACL,KAAK;AAAA,gBACT;AAAA,cACJ;AAAA,YACJ;AAAA,YACA,MAAM,WAAW;AACb,oBAAM,UAAU,YAAY,OAAO,eAAe,MAAM,WAAW,YAAY;AAAA,gBAC3E,OAAO,SAASD,IAAGE,IAAG;AAClB,sBAAI,QAAQ,KAAM,OAAM,IAAI,UAAU,+BAA+B;AACrE,sBAAIC,KAAI,OAAO,IAAI,GAAGF,KAAIE,GAAE,WAAW;AACvC,sBAAI,MAAMF,GAAG,QAAO;AACpB,2BAAS,IAAI,IAAIC,IAAG,IAAI,KAAK,IAAI,KAAK,IAAI,IAAID,KAAI,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,IAAIA,MAAK;AACxE,wBAAIE,GAAE,CAAC,MAAMH,GAAG,QAAO;AACvB;AAAA,kBACJ;AACA,yBAAO;AAAA,gBACX;AAAA,cACJ,CAAC;AAAA,YACL;AAAA,YACA,MAAM,WAAW;AACb,kBAAIA,KAAI,SAAS,KAAK,KAAK,SAAS,MAAM,MAAM,UAAU,MAAM,GAAGE,KAAI,SAAS,KAAK,KAAK,SAAS,MAAM,OAAO,UAAU,oBAAoB,GAAGC,KAAI,SAAS,KAAK,KAAK,SAAS,MAAM,MAAM,UAAU,MAAM,GAAGF,KAAI,OAAO;AAC3N,qBAAO,YAAY,OAAO,UAAU,SAAS,GAAG;AAC5C,uBAAOD,GAAEC,GAAE,CAAC,GAAI,SAASD,IAAGC,IAAG;AAC3B,yBAAOE,GAAEH,IAAG,YAAY,OAAOC,MAAKC,GAAE,GAAGD,EAAC,IAAI,CAAE,CAAEA,IAAG,EAAEA,EAAC,CAAE,CAAE,IAAI,CAAC,CAAC;AAAA,gBACtE,GAAI,CAAC,CAAC;AAAA,cACV;AAAA,YACJ;AAAA,YACA,MAAM,WAAW;AACb,uBAASD,GAAEE,IAAG;AACV,uBAAOF,KAAI,cAAc,OAAO,UAAU,YAAY,OAAO,OAAO,WAAW,SAASA,IAAG;AACvF,yBAAO,OAAOA;AAAA,gBAClB,IAAI,SAASA,IAAG;AACZ,yBAAOA,MAAK,cAAc,OAAO,UAAUA,GAAE,gBAAgB,UAAUA,OAAM,OAAO,YAAY,WAAW,OAAOA;AAAA,gBACtH,GAAGA,GAAEE,EAAC;AAAA,cACV;AACA,4BAAc,OAAO,OAAO,mBAAmB,OAAO,iBAAiB,aAAaF,GAAE,OAAO,SAAS,IAAI,SAASA,IAAG;AAClH,uBAAOA,GAAE;AAAA,cACb,IAAI,SAASA,IAAG;AACZ,uBAAOA,GAAE,YAAY;AAAA,cACzB;AAAA,YACJ;AAAA,YACA,MAAM,WAAW;AACb,qBAAO,UAAU,aAAa,OAAO,UAAU,WAAW,SAASA,IAAGE,IAAG;AACrE,uBAAO,YAAY,OAAOA,OAAMA,KAAI,IAAI,EAAEA,KAAIF,GAAE,SAAS,KAAK,WAAW,OAAO,KAAK,QAAQA,IAAGE,EAAC;AAAA,cACrG;AAAA,YACJ;AAAA,YACA,MAAM,SAASF,IAAGE,IAAGC,IAAG;AACpB,qBAAO,eAAeD,IAAG,cAAc;AAAA,gBACnC,OAAO;AAAA,cACX,CAAC,GAAGA,GAAE,QAAQ,SAASF,IAAGE,IAAGC,IAAGF,IAAGI,IAAG;AAClC,oBAAIC,IAAGC,KAAI,MAAMC,KAAI,KAAK;AAC1B,oBAAI,WAAWN,GAAG,QAAO,oBAAoBF,MAAK,kBAAkBA,MAAKE,KAAIF,GAAE,gBAC/EG,KAAIH,GAAE,gBAAgB,EAAE,QAAQ,gBAAgBM,KAAI,EAAE,QAAQ,aAAa,EAAE,WAAW,CAAC,GAAG,wBAAwB,eAAeN,MAAKM,GAAE,4BAA4BN,OAAME,KAAII,GAAE,aAClLH,KAAIG,GAAE,aAAa,SAAS,aAAa,SAAS,UAAU,gBAAgBH,MAAKD,KAAI,KAAKI,KAAI,SAAS,UAAU,YAAY,GAAG,UAAU,EAAE,UAAU,aAAa,CAACN,GAAE,UAAU,UAAU,EAAE,MAAM,KAAKM,GAAE,KAAK,SAC9M;AAAA,kBACI,OAAOL,KAAIC,KAAI,EAAE,KAAKK,IAAGL,EAAC;AAAA,kBAC1B,KAAKD,KAAIE,KAAI,EAAE,KAAKI,IAAGJ,EAAC;AAAA,gBAC5B;AACA,oBAAI,MAAM,QAAQD,EAAC,MAAMC,KAAII,GAAE,QAAQL,GAAE,CAAC,IAAIA,GAAE,CAAC,GAAGA,KAAIK,GAAE,QAAQL,GAAE,CAAC,IAAIA,GAAE,CAAC,IAC5E,WAAWA,GAAE,UAAUC,KAAII,GAAE,QAAQL,GAAE,QAAQA,GAAE,KAAKA,KAAIK,GAAE,QAAQL,GAAE,MAAMA,GAAE,QAC9E,YAAY,OAAOA,IAAG;AAClB,kBAAAA,KAAID,KAAIC,KAAI,EAAE,KAAKK,IAAGL,EAAC,GAAGC,KAAI,YAAY,QAAQA,KAAIF,KAAIE,KAAI,EAAE,KAAKI,IAAGJ,EAAC,KAAKA,KAAID;AAClF,sBAAIQ,KAAI,WAAWV,GAAE,cAAc,eAAe,EAAE,SAAS,oBAAoBA,GAAE,cAAc,eAAe,EAAE,SAAS,iBAAiBA,IAAG,IAAI,IAAIA,GAAE,cAAc,QAAQ,IAAIG;AACnL,sBAAIH,GAAE,aAAaU,KAAIV,GAAE,cAAcU,KAAI,GAAGV,GAAE,UAAU,WAAW;AAAA,oBACjE,OAAOE;AAAA,oBACP,KAAKC;AAAA,kBACT,GAAGK,GAAE,oBAAoB,UAAOA,GAAE,cAAcN,OAAMC,OAAME,MAAKF,OAAMH,QAAOA,GAAE,UAAU,cAAcA,GAAE,eAAe,eAAe;AACpI,wBAAI,uBAAuBA,GAAG,CAAAA,GAAE,kBAAkBE,IAAGC,EAAC;AAAA,6BAAY,EAAE,QAAQ,cAAc;AACtF,0BAAIG,KAAI,SAAS,YAAY,GAAG,WAAWN,GAAE,cAAc,SAASA,GAAE,YAAY;AAC9E,4BAAIW,KAAI,SAAS,eAAe,EAAE;AAClC,wBAAAX,GAAE,YAAYW,EAAC;AAAA,sBACnB;AACA,sBAAAL,GAAE,SAASN,GAAE,YAAYE,KAAIF,GAAE,UAAU,UAAU,EAAE,SAASE,KAAIF,GAAE,UAAU,UAAU,EAAE,MAAM,GAChGM,GAAE,OAAON,GAAE,YAAYG,KAAIH,GAAE,UAAU,UAAU,EAAE,SAASG,KAAIH,GAAE,UAAU,UAAU,EAAE,MAAM,GAC9FM,GAAE,SAAS,IAAE;AACb,0BAAI,IAAI,EAAE,QAAQ,aAAa;AAC/B,wBAAE,gBAAgB,GAAG,EAAE,SAASA,EAAC;AAAA,oBACrC,MAAO,CAAAN,GAAE,qBAAqBM,KAAIN,GAAE,gBAAgB,GAAG,SAAS,IAAE,GAAGM,GAAE,QAAQ,aAAaH,EAAC,GAC7FG,GAAE,UAAU,aAAaJ,EAAC,GAAGI,GAAE,OAAO;AACtC,+BAAWN,GAAE,UAAU,aAAaA,GAAE,UAAU,UAAU,KAAKO,IAAG;AAAA,sBAC9D,OAAOL;AAAA,sBACP,KAAKC;AAAA,oBACT,CAAC;AAAA,kBACL;AAAA,gBACJ;AAAA,cACJ,GAAGD,GAAE,gCAAgC,SAASF,IAAG;AAC7C,oBAAIE,IAAGC,IAAGF,KAAI,MAAMG,KAAIH,GAAE,SAASM,KAAIN,GAAE,eAAeS,KAAI,EAAE,KAAKT,EAAC,GAAGU,KAAI,CAAC,GAAGF,KAAIL,GAAE,eAAeM,EAAC,GAAG,IAAI,EAAE,gBAAgB,KAAKT,IAAG,MAAI,EAAE,KAAKA,EAAC,GAAG,MAAI,IAAE,GAAG,IAAI,EAAE,QAAQ,IAAI,WAAWQ,KAAIA,GAAE,QAAQ,MAAM,IAAI;AACnN,qBAAKP,KAAIQ,KAAI,GAAGR,KAAI,EAAE,QAAQA,KAAK,MAAKC,KAAI,EAAE,gBAAgB,KAAKF,IAAGC,IAAG,GAAGA,KAAI,CAAC,GAAG,QAAQ,MAAM,GAClGS,GAAET,EAAC,IAAIK,GAAE,OAAO,MAAI,CAAC,GAAGJ,EAAC;AACzB,oBAAI,IAAIM,MAAK,WAAWA,GAAE,cAAcA,GAAE,QAAQA,GAAE,WAAW,IAAI;AACnE,qBAAKP,KAAI,IAAI,GAAGA,KAAIQ,SAAQP,KAAIQ,GAAET,EAAC,GAAG,MAAM,eAAeC,GAAE,MAAM,sBAAsBA,GAAE,MAAM,kBAAkB,MAAM,MAAMQ,GAAET,EAAC,EAAE,QAAQO,GAAE,WAAW,KAAK,SAAON,GAAE,MAAM,UAAU,SAAOA,GAAE,MAAM,UAAUA,GAAE,QAAQM,GAAE,WAAW,KAAK,EAAE,sBAAsB,KAAKR,IAAGE,GAAE,QAAQM,GAAE,WAAW,EAAE,SAAS,EAAE,MAAM,GAAG,GAAG,EAAE,SAAS,EAAE,MAAM,GAAG,CAAC,KAAK,OAAO,EAAE,SAAS,KAAKR,IAAGC,EAAC,EAAE,CAAC,EAAE,SAAS,EAAEA,EAAC,MAAM,EAAE,eAAe,KAAKD,IAAGC,IAAGC,GAAE,KAAK,IAAID,KAAK;AACtb,uBAAOF,KAAI;AAAA,kBACP,GAAG;AAAA,kBACH,KAAKW,GAAE,CAAC,IAAIA,GAAE,CAAC,EAAE,QAAQ;AAAA,gBAC7B,IAAI;AAAA,cACR,GAAGT,GAAE,4BAA4B,SAASF,IAAGE,IAAGC,IAAG;AAC/C,oBAAIF,IAAGG,IAAGC,IAAGI,KAAI,MAAM,IAAIA,GAAE,SAAS,IAAIA,GAAE;AAC5C,gBAAAP,OAAMO,GAAE,QAAQT,GAAE,MAAMA,GAAE,QAAQA,GAAE,QAAQA,GAAE;AAC9C,oBAAIA,GAAE,UAAUA,GAAE,KAAK;AACnB,0BAAQG,KAAIA,MAAK,EAAE,sBAAsB;AAAA,oBACvC,KAAK;AACH;AAAA,oBAEF,KAAK;AACH,sBAAAH,KAAI;AAAA,wBACA,OAAO;AAAA,wBACP,KAAK,EAAE,KAAKS,EAAC,EAAE;AAAA,sBACnB;AACA;AAAA,oBAEF,KAAK;AACH,sBAAAT,GAAE,MAAMA,GAAE,QAAQ,EAAE,KAAKS,IAAG,EAAE,KAAKA,EAAC,CAAC;AACrC;AAAA,oBAEF,KAAK;AACH,0BAAIA,GAAE,UAAU,KAAK,MAAM,EAAE,eAAe,OAAQ;AACpD,0BAAI,SAAST,IAAG;AACZ,4BAAI,OAAO,EAAE,cAAc,MAAM,EAAE,QAAQ;AACvC,8BAAIE,KAAI,EAAE;AACV,8BAAI,WAAWA,GAAEF,EAAC,KAAK,WAAWE,GAAEF,EAAC,EAAE,OAAO;AAC1C,gCAAIA,KAAI,EAAE,KAAKS,IAAG,EAAE,EAAG,QAAO;AAC9B,gCAAIN,KAAI,EAAE,KAAKM,EAAC,EAAE,QAAQ,EAAE,UAAU;AACtC,gCAAI,OAAON,IAAG;AACV,uCAASF,KAAI,GAAGG,KAAIF,GAAE,QAAQD,KAAIG,IAAGH,KAAK,KAAIC,GAAED,EAAC,KAAKE,KAAIF,MAAKC,GAAED,EAAC,EAAE,UAAU,EAAE,eAAe,KAAKQ,IAAGR,EAAC,EAAG,QAAO;AAClH,qCAAO;AAAA,4BACX;AAAA,0BACJ;AAAA,wBACJ;AACA,+BAAO;AAAA,sBACX,EAAED,GAAE,KAAK,GAAG;AACR,4BAAI,IAAI,EAAE,KAAKS,EAAC,EAAE,KAAK,EAAE,EAAE,QAAQ,EAAE,UAAU;AAC/C,wBAAAT,GAAE,MAAMA,GAAE,QAAQ,EAAE,eAAe,EAAE,KAAKS,IAAG,CAAC,IAAI;AAClD;AAAA,sBACJ;AAAA,oBAEF;AACE,0BAAIR,KAAID,GAAE,OAAOI,KAAI,EAAE,KAAKK,IAAGR,IAAG,IAAE,GAAGA,OAAMI,KAAI,EAAE,KAAKI,IAAG,OAAOL,MAAK,EAAE,KAAKK,IAAG,CAAC,IAAIL,KAAI,EAAE,GAAI,CAAAJ,GAAE,MAAMA,GAAE,QAAQ,EAAE,KAAKS,IAAGR,IAAG,OAAI,IAAE,IAAIA,KAAI,EAAE,KAAKQ,IAAGR,EAAC;AAAA,2BAAQ;AAC5J,4BAAI,IAAI,EAAE,eAAeG,EAAC,GAAG,IAAI,EAAE,gBAAgB,KAAKK,IAAGJ,IAAG,IAAI,EAAE,MAAM,UAAU,QAAQ,CAAC,GAAG,IAAI,EAAE,eAAe,KAAKI,IAAGJ,IAAG,EAAE,KAAK;AACvI,4BAAI,OAAO,KAAK,EAAE,KAAKI,EAAC,EAAEJ,EAAC,MAAM,KAAK,SAAO,EAAE,MAAM,sBAAsB,SAAO,EAAE,MAAM,kBAAkB,CAAC,EAAE,KAAKI,IAAGJ,IAAG,EAAE,YAAY,IAAE,KAAK,EAAE,MAAM,QAAQ,GAAG;AAC9J,8BAAI,IAAI,EAAE,KAAKI,IAAGJ,EAAC;AACnB,2BAACJ,MAAK,KAAKA,OAAMI,QAAOA,KAAI;AAAA,wBAChC;AACA,wBAAAL,GAAE,MAAMA,GAAE,QAAQK;AAAA,sBACtB;AAAA,kBACJ;AACA,yBAAOL;AAAA,gBACX;AAAA,cACJ,GAAGE,GAAE,YAAY,GAAGA,GAAE,oBAAoB,WAAW;AACjD,oBAAIF,KAAI,KAAK;AACb,2BAAWA,GAAE,YAAYA,GAAE,UAAU,EAAE,gBAAgB,KAAK,MAAM,OAAI,CAAC,GAAG,WAAWA,GAAE,WAAWA,GAAE,SAASA,GAAE,QAAQ,MAAM;AAC7H,uBAAOA,GAAE;AAAA,cACb,GAAGE,GAAE,uBAAuB,GAAGA,GAAE,SAAS,GAAGA,GAAE,eAAe,SAASF,IAAG;AACtE,oBAAIE,KAAI,KAAK;AACb,gBAAAA,GAAE,SAAS,QAAQ,SAAOF,OAAME,GAAE,iBAAiB,CAAC,GAAGA,GAAE,IAAI;AAC7D,0BAAOF,OAAME,GAAE,QAAQ,CAAC,GAAGA,GAAE,YAAY,CAAC;AAAA,cAC9C,GAAGA,GAAE,WAAW,GAAGA,GAAE,eAAe,SAASF,IAAGE,IAAG;AAC/C,oBAAIC,KAAI,MAAMF,KAAID,KAAI;AACtB,oBAAIA,MAAK,EAAG,QAAO;AACnB,uBAAMC,KAAI,MAAM,SAAOC,OAAM,SAAO,EAAE,QAAQ,KAAKC,IAAGF,EAAC,EAAE,MAAM,kBAAkB,CAAC,EAAE,KAAKE,IAAGF,IAAG,QAAQ,IAAE,MAAM,SAAOC,MAAK,CAAC,EAAE,KAAKC,IAAGF,IAAG,QAAQ,IAAE,KAAM,CAAAA;AACzJ,uBAAOA;AAAA,cACX,GAAGC,GAAE,oBAAoB;AACzB,kBAAID,IAAG,KAAKA,KAAIE,GAAE,IAAI,MAAMF,GAAE,aAAaA,KAAI;AAAA,gBAC3C,SAASA;AAAA,cACb,GAAG,IAAIE,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI;AAC1B,uBAAS,EAAEH,IAAG;AACV,oBAAIE,KAAI,MAAMC,KAAID,GAAE;AACpB,uBAAO,WAAWC,GAAE,UAAU,SAAOH,OAAMG,GAAE,SAAS,EAAE,gBAAgB,KAAKD,IAAG,MAAI,EAAE,KAAKA,EAAC,GAAG,IAAE,GACjG,WAAWC,GAAE,YAAYA,GAAE,UAAUA,GAAE,OAAO,MAAM,KAAKA,GAAE;AAAA,cAC/D;AACA,uBAAS,EAAEH,IAAGE,IAAGC,IAAG;AAChB,oBAAIF,KAAI,KAAK,SAASG,KAAI,IAAIC,KAAI,IAAIC,KAAIH,MAAKF,GAAE;AACjD,2BAAWD,OAAMA,KAAI;AACrB,yBAASO,KAAI,GAAGC,KAAIF,GAAE,QAAQC,KAAIC,IAAGD,KAAK,CAAAD,GAAEC,EAAC,MAAML,MAAK,SAAOI,GAAEC,EAAC,EAAE,oBAAoBA,MAAKP,OAAMI,KAAIG,KACvGA,MAAKP,OAAMK,KAAIE;AACf,uBAAO,OAAOH,MAAKA,OAAMJ,KAAIK,KAAI,OAAOA,MAAKL,KAAII,KAAIC,KAAIL,KAAII,KAAIC;AAAA,cACrE;AACA,uBAAS,EAAEL,IAAGE,IAAGC,IAAG;AAChB,oBAAIF,KAAI,MAAMG,KAAI,KAAK,SAASC,KAAI,EAAE,gBAAgB,KAAKJ,IAAGD,EAAC,EAAE;AACjE,oBAAI,OAAOK,GAAE,QAAQA,KAAI,EAAE,QAAQ,KAAKJ,IAAGD,EAAC,EAAE,QAAQ,SAAOK,GAAE,OAAQ,QAAOA,GAAE;AAChF,oBAAI,SAAOF,MAAK,WAAWC,GAAE,eAAeJ,EAAC,KAAK,SAAOI,GAAE,eAAeJ,EAAC,EAAE,eAAgB,QAAO;AACpG,oBAAI,SAAOE,MAAKF,KAAI,IAAI;AACpB,sBAAIG,IAAG;AACH,wBAAII,KAAI,EAAE,SAAS,KAAKN,IAAGD,EAAC;AAC5B,2BAAOO,GAAE,SAAS,KAAK,OAAOA,GAAEA,GAAE,SAAS,CAAC,EAAE,MAAM,MAAM,IAAI;AAAA,kBAClE;AACA,sBAAIC,KAAI,EAAE,sBAAsB,KAAKP,IAAGD,IAAG,EAAE,SAAS,KAAKC,IAAGD,EAAC,CAAC,GAAGU,KAAI,EAAE,eAAe,KAAKT,IAAGD,IAAGQ,GAAE,KAAK;AAC1G,yBAAOA,GAAE,MAAM,QAAQE;AAAA,gBAC3B;AACA,uBAAO;AAAA,cACX;AACA,uBAAS,EAAEV,IAAGE,IAAGC,IAAG;AAChB,oBAAIF,KAAI;AACR,2BAAWE,OAAMA,KAAI;AACrB,yBAASC,KAAIJ,KAAI,GAAG,OAAO,EAAE,QAAQ,KAAKC,IAAGG,EAAC,EAAE,MAAM,QAAQ,SAAOF,OAAM,SAAO,EAAE,QAAQ,KAAKD,IAAGG,EAAC,EAAE,MAAM,kBAAkB,CAAC,EAAE,KAAKH,IAAGG,IAAG,QAAQ,IAAE,MAAM,SAAOF,MAAK,CAAC,EAAE,KAAKD,IAAGG,IAAG,QAAQD,EAAC,KAAM,CAAAC;AACtM,uBAAOA;AAAA,cACX;AACA,uBAAS,EAAEJ,IAAG;AACV,oBAAIE,KAAI,KAAK,MAAMC,KAAI,KAAK;AAC5B,uBAAO,CAAC,KAAK,SAAS,YAAY,OAAOH,MAAKE,GAAE,UAAU,OAAOA,GAAE,eAAe,CAACC,OAAMH,KAAI,KAAK,UAAU,EAAE,SAASA,MAAK,MAAMA,KAAI,IACtIA;AAAA,cACJ;AAAA,YACJ;AAAA,YACA,MAAM,SAASA,IAAGE,IAAGC,IAAG;AACpB,qBAAO,eAAeD,IAAG,cAAc;AAAA,gBACnC,OAAO;AAAA,cACX,CAAC,GAAGA,GAAE,wBAAwB,GAAGA,GAAE,mBAAmB,GAAGA,GAAE,kBAAkB,SAASF,IAAGE,IAAGC,IAAGF,IAAGG,IAAG;AACjG,oBAAIC,KAAI,MAAMC,KAAI,KAAK,MAAMC,KAAI,KAAK,SAASC,KAAIF,GAAE;AACrD,gBAAAF,MAAKE,GAAE,WAAWA,GAAE,SAAS,OAAID,GAAE,QAAQ,QAAQ,CAAC;AACpD,gBAAAH,KAAIA,MAAK;AACT,oBAAIiB,IAAGP,IAAG,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI;AAC5B,mBAAG;AACC,sBAAI,SAAOZ,MAAKO,GAAE,eAAe,CAAC,EAAG,CAAAK,MAAK,IAAIR,MAAKG,GAAE,eAAe,CAAC,EAAE,MAAM,eAAe,WAAWA,GAAE,eAAe,IAAI,CAAC,MAAM,SAAOA,GAAE,eAAe,CAAC,EAAE,kBAAkBA,GAAE,eAAe,CAAC,EAAE,SAASD,GAAE,6BAA6B,IAAI,KAAK,EAAE,KAAKD,IAAG,GAAG,EAAE,KAAKA,IAAG,GAAGc,IAAG,IAAI,CAAC,CAAC,IAAIZ,GAAE,eAAe,CAAC,GAAG,OACjTY,KAAI,EAAE,QAAQ,MAAM,GAAG,EAAE,KAAK,SAAOhB,KAAI,EAAE,QAAQ,UAAOA,KAAIS,GAAE,YAAY,EAAE,KAAKP,IAAG,GAAGO,EAAC,CAAC;AAAA,uBAAQ;AAC/F,oBAAAA,MAAK,IAAI,EAAE,KAAKP,IAAG,GAAGc,IAAG,IAAI,CAAC,GAAG,OAAOA,KAAI,EAAE,QAAQ,MAAM;AAC5D,wBAAI,IAAI,SAAOlB,OAAM,UAAOK,GAAE,aAAaA,GAAE,aAAaM,GAAE;AAC5D,qBAAC,KAAK,KAAKL,GAAE,eAAe,IAAI,CAAC,MAAMK,GAAE,UAAUA,GAAE,QAAQN,GAAE,kBAAkB,SAASM,GAAE,OAAO,UAAO,KAAK,WAAW,KAAK,YAAY,OAAO,KAAK,SAAS,CAAC,KAAK,IAAI,IAAI,EAAE,KAAK,UAAOT,KAAIS,GAAE,YAAY,EAAE,KAAKP,IAAG,EAAE,QAAQO,EAAC,CAAC,IAAI,IAAI;AAAA,kBAChP;AACA;AAAA,gBACJ,SAAS,SAAOA,GAAE,UAAU,OAAOA,GAAE,OAAOV,KAAI;AAChD,uBAAO,EAAE,EAAE,SAAS,CAAC,KAAK,EAAE,IAAI;AAChC,0BAAOC,MAAK,WAAWI,GAAE,eAAeA,GAAE,aAAa,IAAI;AAC3D,uBAAOD,GAAE,SAASE,IAAG;AAAA,cACzB,GAAGN,GAAE,iBAAiB,GAAGA,GAAE,UAAU,GAAGA,GAAE,kBAAkB,GAAGA,GAAE,WAAW,GAAGA,GAAE,aAAa;AAC9F,kBAAID,IAAG,KAAKA,KAAIE,GAAE,IAAI,MAAMF,GAAE,aAAaA,KAAI;AAAA,gBAC3C,SAASA;AAAA,cACb,GAAG,IAAIE,GAAE,IAAI;AACb,uBAAS,EAAEH,IAAG;AACV,uBAAO,IAAI,cAAc,OAAO,UAAU,YAAY,OAAO,OAAO,WAAW,SAASA,IAAG;AACvF,yBAAO,OAAOA;AAAA,gBAClB,IAAI,SAASA,IAAG;AACZ,yBAAOA,MAAK,cAAc,OAAO,UAAUA,GAAE,gBAAgB,UAAUA,OAAM,OAAO,YAAY,WAAW,OAAOA;AAAA,gBACtH,GAAG,EAAEA,EAAC;AAAA,cACV;AACA,uBAAS,EAAEA,IAAGE,IAAG;AACb,oBAAIC,MAAK,QAAQH,GAAE,cAAcA,GAAE,KAAK,EAAEA,EAAC,CAAC,IAAIA,GAAE,SAAS,KAAK,EAAE;AAClE,oBAAI,OAAOG,GAAG,MAAKA,KAAIA,GAAE,MAAM,GAAG,EAAE,CAAC,GAAGA,GAAE,SAASD,KAAK,CAAAC,MAAK;AAC7D,uBAAOA;AAAA,cACX;AACA,uBAAS,EAAEH,IAAG;AACV,oBAAIE,KAAIF,GAAE,QAAQA,GAAE,WAAW;AAC/B,uBAAO,YAAY,OAAOE,MAAKA,GAAE,SAAS,MAAMA,KAAIA,GAAE,MAAM,GAAG,EAAE,CAAC,IAAI,WAAWA,KAAIA,GAAE,SAAS,IAAI;AAAA,cACxG;AACA,uBAAS,EAAEF,IAAGE,IAAGC,IAAG;AAChB,oBAAIF,KAAI,MAAMG,KAAI,KAAK,MAAMG,KAAI,KAAK;AACtC,oBAAI,YAAYL,KAAIA,MAAK,EAAE,KAAKD,IAAGD,EAAC,EAAE,OAAO,eAAe,SAAOG,IAAG;AAClE,sBAAI,OAAOD,GAAE,eAAe,SAAOA,GAAE,UAAU,SAAOA,GAAE,WAAW;AAC/D,wBAAIM,KAAI,EAAE,qBAAqB,KAAKP,IAAGD,EAAC,GAAGU,KAAI,EAAE,SAAS,KAAKT,IAAGO,EAAC;AACnE,4BAAQL,KAAIH,MAAKU,KAAIV,KAAIU,MAAKN,GAAE,0BAA0BF,GAAE,SAASA,GAAE,YAAYA,GAAE,MAAM,cAAc,OAAOA,GAAE,cAAcA,GAAE,YAAYE,EAAC,IAAIF,GAAE;AAAA,kBACzJ;AACA,yBAAO,cAAc,OAAOA,GAAE,cAAcA,GAAE,YAAYE,EAAC,IAAIF,GAAE;AAAA,gBACrE;AACA,oBAAI,SAAOA,GAAE,QAAQ;AACjB,sBAAIF,KAAI,MAAM,WAAWO,GAAE,eAAeP,EAAC,GAAG;AAC1C,wBAAIW,IAAGF,KAAI,EAAE,KAAKR,IAAGD,EAAC,GAAGY,KAAI,CAAC;AAC9B,wBAAI,YAAY,OAAOR,GAAE,eAAeK,GAAE,SAAS,KAAK,OAAOA,GAAEA,GAAE,SAAS,CAAC,EAAE,MAAM,MAAM,IAAI;AAAI,+BAAS,IAAI,GAAG,IAAIA,GAAE,QAAQ,IAAK,KAAI,OAAOA,GAAE,CAAC,EAAE,MAAM,OAAO,SAAOA,GAAE,CAAC,EAAE,MAAM,eAAe,SAAOA,GAAE,CAAC,EAAE,MAAM,uBAAuB,SAAOA,GAAE,CAAC,EAAE,MAAM,UAAU,WAAWE,MAAK,UAAOF,GAAE,CAAC,EAAE,MAAM,GAAG,KAAKE,GAAE,MAAM,KAAKJ,IAAGP,IAAG,MAAII,EAAC,OAAOQ,GAAE,KAAKH,GAAE,CAAC,CAAC,GAC7V,SAAOA,GAAE,CAAC,EAAE,MAAM,WAAWE,KAAIF,GAAE,CAAC,IAAIG,GAAE,SAAS,KAAK,cAAc,KAAKA,GAAE,CAAC,EAAE,MAAM,GAAG,GAAI,QAAOR,GAAE,YAAY,OAAOJ,KAAII,GAAE,YAAY,MAAM;AAAA;AAAA,kBACrJ;AACA,yBAAOF,GAAE;AAAA,gBACb;AACA,uBAAO,aAAa,EAAEE,GAAE,WAAW,IAAIF,GAAE,MAAME,GAAE,YAAY,OAAOJ,KAAII,GAAE,YAAY,MAAM;AAAA,cAChG;AACA,uBAAS,EAAEJ,IAAGE,IAAGC,IAAG;AAChB,uBAAO,KAAK,QAAQ,eAAeH,EAAC,KAAK,EAAE,KAAK,MAAMA,IAAG,EAAE,KAAK,MAAMA,IAAGE,KAAIA,GAAE,MAAM,IAAIA,IAAGC,EAAC,CAAC;AAAA,cAClG;AACA,uBAAS,EAAEH,IAAGE,IAAG;AACb,oBAAIC,KAAI,KAAK,MAAMF,KAAI,GAAGG,KAAI,SAASJ,IAAGE,IAAG;AACzC,sBAAIC,KAAI,GAAGF,KAAI;AACf,kBAAAC,GAAE,QAAS,SAASF,IAAG;AACnB,oBAAAA,GAAE,MAAM,gBAAgB,MAAMG,MAAKA,OAAMH,GAAE,MAAM,gBAAgBC,KAAI,QAAM,MAAME,MAAKA,KAAIH,GAAE,MAAM,iBAAiBG,KAAIH,GAAE,MAAM;AAAA,kBACnI,CAAE,GAAGG,OAAM,KAAKH,MAAK,KAAKE,GAAE,SAASC,KAAI,IAAIF,OAAME,KAAI;AACvD,yBAAOA;AAAA,gBACX,EAAEH,IAAGE,EAAC;AACN,gBAAAF,KAAIA,KAAI,IAAIA,KAAI,IAAI;AACpB,oBAAIK,IAAGC,IAAGE,IAAGE,KAAI,EAAE,EAAE,KAAK,MAAMV,EAAC,CAAC;AAClC,gBAAAG,GAAE,UAAUD,GAAE,SAAS,KAAK,OAAOA,GAAEA,GAAE,SAAS,CAAC,EAAE,MAAM,QAAQD,KAAI;AACrE,yBAASU,KAAI,GAAGA,KAAIT,GAAE,SAASD,IAAGU,MAAK;AACnC,sBAAIF,KAAIP,GAAES,EAAC;AACX,kBAAAN,KAAI,EAAEI,IAAGC,GAAE,MAAM;AACjB,sBAAIE,KAAI,KAAK,IAAIP,KAAIK,EAAC;AACtB,mBAAC,SAAOD,GAAE,+BAA+BP,GAAE,OAAQ,SAASF,IAAG;AAC3D,2BAAO,SAAOA,GAAE;AAAA,kBACpB,CAAE,EAAE,UAAU,OAAO,WAAWM,MAAK,OAAOD,MAAKO,KAAIN,MAAKE,MAAK,CAACL,GAAE,UAAUK,GAAE,MAAM,eAAeA,GAAE,MAAM,cAAcJ,KAAI,KAAK,aAAaI,GAAE,MAAM,mBAAmB,CAACC,GAAE,MAAM,eAAeA,GAAE,MAAM,cAAcL,KAAI,KAAK,CAACK,GAAE,MAAM,mBAAmBD,MAAK,CAACL,GAAE,UAAUK,GAAE,MAAM,sBAAsB,CAACC,GAAE,MAAM,wBAAwBH,KAAIM,IAClVJ,KAAIC;AAAA,gBACR;AACA,uBAAOD;AAAA,cACX;AACA,uBAAS,EAAER,IAAGE,IAAG;AACb,oBAAIC,KAAI,KAAK;AACb,uBAAOA,GAAE,eAAeH,EAAC,IAAIG,GAAE,eAAeH,EAAC,KAAKE,MAAK,EAAE,KAAK,MAAMF,EAAC,GAAG,CAAC;AAAA,cAC/E;AACA,uBAAS,EAAEA,IAAGE,IAAGC,IAAG;AAChB,yBAASF,GAAED,IAAG;AACV,2BAASE,IAAGC,KAAI,CAAC,GAAGF,KAAI,IAAIG,KAAI,GAAGC,KAAIL,GAAE,QAAQI,KAAIC,IAAGD,KAAK,KAAI,QAAQJ,GAAE,OAAOI,EAAC,EAAG,MAAKF,KAAIF,GAAE,WAAWI,KAAI,CAAC,GAAG,EAAEH,KAAIC,KAAK,CAAAC,GAAE,KAAK,OAAO,aAAaF,EAAC,CAAC;AAAA,sBAAQ,CAAAA,KAAID,GAAE,WAAWI,EAAC,GACtLD,GAAE,KAAKH,GAAE,OAAOI,EAAC,CAAC;AAClB,yBAAOD,GAAE,KAAK,EAAE;AAAA,gBACpB;AACA,uBAAOH,GAAE,MAAM,QAAQE,GAAE,MAAM,aAAa,EAAE,EAAEC,GAAE,SAASH,GAAE,MAAM,cAAc,UAAUE,GAAE,MAAM,cAAc,WAAW,SAAOF,GAAE,MAAM,UAAU,SAAOE,GAAE,MAAM,YAAY,QAAQA,GAAE,MAAM,GAAG,UAAU,OAAOD,GAAEC,GAAE,MAAM,GAAG,OAAO,QAAQ,WAAW,EAAE,CAAC,EAAE,QAAQD,GAAED,GAAE,MAAM,GAAG,OAAO,QAAQ,WAAW,EAAE,CAAC,CAAC;AAAA,cACvT;AACA,uBAAS,EAAEA,IAAGE,IAAGC,IAAG;AAChB,oBAAIF,IAAGI,IAAGC,KAAI,MAAMC,KAAI,KAAK,eAAeC,KAAI,KAAK,SAASE,KAAI,KAAK,MAAMC,KAAI,KAAK,IAAIQ,KAAIX,GAAE,WAAWK,KAAIX,KAAIC,KAAI,GAAG,IAAID,KAAIA,GAAE,MAAM,IAAI,CAAE,CAAE,GAAG,IAAI,CAAC,GAAG,IAAI,OAAI,IAAIA,KAAIA,GAAE,KAAK,EAAE,IAAI,IAAI,IAAI;AAClM,yBAAS,EAAEA,IAAGC,IAAGE,IAAGE,IAAG;AACnB,2BAASE,GAAEJ,IAAGE,IAAGY,IAAG;AAChB,6BAASL,GAAEd,IAAGE,IAAG;AACb,0BAAIC,KAAI,MAAMD,GAAE,QAAQ,QAAQF,EAAC;AACjC,6BAAOG,MAAKD,GAAE,QAAQ,MAAO,SAASD,IAAGG,IAAG;AACxC,+BAAO,SAAOH,GAAE,eAAeE,KAAIW,GAAEd,IAAGE,GAAE,QAAQE,KAAI,CAAC,CAAC,IAAI,OAAO,UAAU,eAAe,KAAKH,IAAG,SAAS,MAAME,KAAIW,GAAEd,IAAGC,EAAC,IAC7H,CAACE;AAAA,sBACL,CAAE,GAAGA;AAAA,oBACT;AACA,6BAASkB,GAAErB,IAAGE,IAAGC,IAAG;AAChB,0BAAIF,IAAGG;AACP,2BAAKI,GAAE,MAAMR,EAAC,KAAKQ,GAAE,eAAeR,EAAC,OAAOQ,GAAE,eAAeR,EAAC,IAAI,CAAEQ,GAAE,eAAeR,EAAC,CAAE,IAAIQ,GAAE,MAAMR,EAAC,GAAG,MAAO,SAASA,IAAGK,IAAG;AAC1H,4BAAIL,GAAE,KAAKE,EAAC,EAAG,QAAOD,KAAID,IAAG;AAC7B,4BAAIM,KAAI,WAAWH,KAAIA,KAAIH,GAAE,aAAaO,KAAI,WAAWP,GAAE,QAAQM,EAAC,IAAIN,GAAE,QAAQM,EAAC,EAAE,SAAS,EAAE,QAAQJ,EAAC,IAAI;AAC7G,gCAAQ,WAAWE,MAAKG,KAAIH,OAAM,OAAOG,OAAMN,KAAID,IAAGI,KAAIG,KAAI;AAAA,sBAClE,CAAE,GAAGN,IAAG;AACJ,4BAAII,KAAIJ,GAAE,QAAQA,GAAE,WAAW,GAAGK,KAAIL,GAAE,KAAKC,EAAC,KAAKD,GAAE,KAAKI,EAAC,KAAKJ,GAAE;AAClE,4BAAI,OAAOK,GAAEA,GAAE,SAAS,CAAC,EAAE,SAAS,EAAE,QAAQ,GAAG,EAAG,CAAAA,GAAE,IAAI;AAC1D,+BAAOA,GAAE,OAAO,WAAWH,KAAIA,KAAIF,GAAE,eAAe,CAAC;AAAA,sBACzD;AACA,6BAAO,WAAWE,KAAIkB,GAAErB,IAAGE,EAAC,IAAI;AAAA,oBACpC;AACA,6BAASgB,GAAEhB,IAAGC,IAAG;AACb,6BAAO,SAAOD,GAAE,MAAM,UAAU,SAAOC,GAAE,MAAM,UAAUA,GAAE,MAAM,GAAG,KAAKD,GAAE,MAAM,KAAKM,IAAGR,IAAG,OAAIU,IAAG,KAAE;AAAA,oBACzG;AACA,6BAASY,GAAEtB,IAAGE,IAAG;AACb,0BAAIC,KAAIH,GAAE,aAAaC,KAAI,WAAWC,MAAKC,MAAKD,GAAE,eAAe,OAAOF,GAAE,QAAQG,EAAC,EAAE,SAAS,EAAE,QAAQD,GAAE,QAAQC,EAAC,CAAC;AACpH,0BAAI,CAACF,MAAKE,KAAID,GAAE;AAAa,iCAASE,KAAI,GAAGA,KAAID,IAAGC,KAAK,KAAIJ,GAAE,QAAQI,EAAC,MAAMF,GAAE,QAAQE,EAAC,GAAG;AACxF,0BAAAD,KAAIC,IAAGH,KAAI;AACX;AAAA,wBACJ;AAAA;AACA,6BAAO,CAAC,CAACA,MAAK,SAASE,IAAG;AACtB,wBAAAH,GAAE,OAAOA,GAAE,QAAQ,CAAC;AACpB,4BAAIC,KAAID,GAAE,QAAQG,EAAC;AACnB,4BAAI,WAAWF,IAAG;AACd,8BAAI,YAAY,OAAOA,OAAMA,KAAIA,GAAE,MAAM,GAAG,EAAE,CAAC,IAAI,WAAWD,GAAE,KAAKC,EAAC,MAAMD,GAAE,KAAKC,EAAC,IAAID,GAAE,QAAQ,MAAM,GACxGA,GAAE,KAAKC,EAAC,EAAE,KAAK,IAAI,OAAOD,GAAE,WAAW,CAAC,IAAI,WAAWE,IAAG;AACtD,qCAASE,MAAKF,GAAE,KAAM,aAAY,OAAOE,OAAMA,KAAI,SAASA,GAAE,MAAM,GAAG,EAAE,CAAC,CAAC,IAAIJ,GAAE,KAAKI,KAAI,CAAC,IAAIF,GAAE,KAAKE,EAAC;AACvG,4BAAAJ,GAAE,QAAQG,EAAC,IAAI,OAAO,KAAKH,GAAE,IAAI,EAAE,KAAK,GAAG;AAAA,0BAC/C;AACA,iCAAOA,GAAE,cAAcG,OAAMH,GAAE,cAAcG,KAAI;AAAA,wBACrD;AACA,+BAAOH,GAAE,cAAc,QAAQ;AAAA,sBACnC,EAAEG,EAAC;AAAA,oBACP;AACA,6BAAS,EAAEH,IAAGE,IAAG;AACb,0BAAIF,GAAE,QAAQ,WAAWE,GAAE,QAAQ,OAAQ,QAAO;AAClD,+BAASC,KAAIH,GAAE,cAAc,GAAGG,KAAIH,GAAE,QAAQ,QAAQG,KAAK,KAAIH,GAAE,QAAQG,EAAC,MAAMD,GAAE,QAAQC,EAAC,EAAG,QAAO;AACrG,6BAAO;AAAA,oBACX;AACA,wBAAIU,KAAIb,KAAIU,GAAE,YAAa,OAAM,IAAI,MAAM,sJAAsJ,OAAOF,GAAE,IAAI,CAAC;AAC/M,wBAAIK,OAAMb,MAAK,WAAWK,GAAE,SAAS;AACjC,0BAAI,EAAE,KAAK;AAAA,wBACP,OAAOA;AAAA,wBACP,SAASE,GAAE,QAAQ;AAAA,wBACnB,IAAI;AAAA,wBACJ,MAAM,CAAC;AAAA,sBACX,CAAC,GAAG,CAACF,GAAE,eAAe,WAAWc,MAAK,EAAET,GAAE,eAAeA,GAAE,YAAYL,GAAE,SAAS,KAAKK,GAAE,YAAYL,GAAE,SAAS,EAAE,YAAY,EAAE,QAAQ,UAAU,YAAYA,GAAE,SAAS,KAAK,EAAE,QAAQ,UAAU,YAAYA,GAAE,SAAS,EAAE,UAAW,QAAO;AAC7O,0BAAI,MAAIQ,KAAIb;AAAA,oBAChB,WAAW,WAAWK,GAAE,SAAS;AAC7B,0BAAIA,GAAE,WAAWc,OAAMd,GAAG,QAAO,WAAW;AACxC,4BAAIA,KAAII,GAAEP,GAAE,QAAQA,GAAE,QAAQ,QAAQG,EAAC,IAAI,CAAC,GAAGE,IAAGY,EAAC,EAAG,QAAO;AAAA,sBACjE,EAAE;AACF,0BAAId,GAAE,WAAY,QAAO,WAAW;AAChC,4BAAIH,KAAIG,IAAGD,KAAI,EAAE;AACjB,4BAAIC,KAAI,EAAEA,IAAGF,IAAGI,IAAGY,EAAC,GAAG,EAAE,SAAS,GAAG;AACjC,8BAAI,EAAE,QAAS,SAASnB,IAAGE,IAAG;AAC1B,4BAAAA,MAAKE,OAAMJ,GAAE,MAAM,cAAcA,GAAE,MAAM,cAAcA,GAAE,MAAM,cAAc,IAAI;AAAA,0BACrF,CAAE,GAAGC,KAAI,EAAE,EAAE,SAAS,CAAC,EAAE,OAAO,WAAWkB,MAAK,CAACL,GAAEb,IAAGC,EAAC,EAAG,QAAOG;AACjE,8BAAI,MAAIQ,KAAIb;AAAA,wBAChB;AAAA,sBACJ,EAAE;AACF,0BAAIK,GAAE,aAAc,QAAO,WAAW;AAClC,iCAASJ,GAAED,IAAG;AACV,mCAASE,IAAGC,KAAIH,GAAE,QAAQ,CAAC,EAAE,UAAUA,GAAE,QAAQ,CAAC,EAAE,QAAQ,SAAS,GAAGC,KAAI,GAAGA,KAAID,GAAE,QAAQ,UAAUG,QAAOD,KAAIF,GAAE,QAAQC,EAAC,EAAE,UAAUD,GAAE,QAAQC,EAAC,EAAE,QAAQ,SAAS,IAAIA,KAAK;AAChL,iCAAOE,OAAMD;AAAA,wBACjB;AACA,wBAAAI,GAAE,gBAAgB;AAClB,4BAAIF,IAAGU,KAAIT,IAAGY,KAAI,CAAC,GAAGM,KAAI,EAAE,MAAM,GAAGC,KAAIjB,GAAE,QAAQ,IAAIJ,GAAE,SAAS,IAAIA,GAAE,MAAM,IAAI;AAClF,4BAAI,OAAO,KAAK,YAAY,OAAO,GAAG;AAClC,8BAAI,GAAG,IAAIU,IAAG,IAAIV,GAAE,MAAM,GAAG,IAAI,CAAC;AAClC,8BAAI,YAAY,OAAO,EAAG,KAAI,EAAE,MAAM,GAAG;AAAA,8BAAQ,MAAK,IAAI,GAAG,IAAIW,GAAE,QAAQ,QAAQ,IAAK,GAAE,KAAK,EAAE,SAAS,CAAC;AAC3G,8BAAI,WAAWN,GAAE,SAASR,EAAC,GAAG;AAC1B,qCAAS,IAAI,EAAE,MAAM,GAAG,IAAI,GAAG,IAAIQ,GAAE,SAASR,EAAC,EAAE,QAAQ,IAAI,GAAG,KAAK;AACjE,kCAAI,IAAIQ,GAAE,SAASR,EAAC,EAAE,CAAC,EAAE,SAAS,EAAE,MAAM,GAAG;AAC7C,8BAAAO,GAAE,UAAU,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC,GAAG,CAAC;AAAA,4BACnD;AACA,kCAAM,EAAE,WAAW,OAAOC,GAAE,SAASR,EAAC,GAAG,IAAI;AAAA,0BACjD;AACA,2BAAC,SAAOU,GAAE,cAAc,SAAS,SAASA,GAAE,UAAU,CAAC,KAAK,KAAKA,GAAE,gBAAgB,IAAI,EAAE,MAAM,GAAG,CAAC;AACnG,mCAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AAC/B,gCAAI,SAAS,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAGP,KAAI,YAAY,OAAO,KAAKkB,GAAER,IAAG,GAAGW,EAAC,KAAK,EAAE,MAAM;AAC9E,gCAAI,IAAIV,GAAE,QAAQ,CAAC;AACnB,gCAAI,KAAKL,GAAE,GAAG,CAAE,CAAE,EAAE,OAAOF,EAAC,GAAGY,EAAC,EAAG,CAAAd,KAAI;AAAA,qCAAa,MAAM,MAAM,IAAIJ,GAAEa,EAAC,IAAI,KAAK,EAAE,WAAW,EAAE,QAAQ,SAASA,GAAE,QAAQ,CAAC,EAAE,QAAQ,OAAQ;AAC7I,4BAAAV,KAAI,EAAE,MAAM,GAAGS,KAAI,GAAG,IAAI,CAAC;AAC3B,qCAAS,IAAI,GAAG,IAAIT,GAAE,QAAQ,KAAK;AAC/B,kCAAI,IAAIA,GAAE,CAAC,GAAG,IAAI;AAClB,gCAAE,cAAc,EAAE,eAAeoB,IAAGF,GAAE,CAAC;AACvC,uCAAS,IAAI,GAAG,IAAIL,GAAE,QAAQ,KAAK;AAC/B,oCAAI,IAAIA,GAAE,CAAC;AACX,oCAAI,YAAY,OAAO,KAAK,WAAW,EAAE,eAAe,EAAE,SAAS,EAAE,QAAQ,EAAE,WAAW,EAAE,SAAS,CAAC,GAAG;AACrG,sCAAI,EAAE,MAAM,cAAc,EAAE,MAAM,WAAW;AACzC,wCAAI,MAAIK,GAAE,GAAG,CAAC;AACd;AAAA,kCACJ;AACA,sCAAI,EAAE,GAAG,GAAGZ,EAAC,GAAG;AACZ,oCAAAY,GAAE,GAAG,CAAC,MAAM,IAAI,MAAIL,GAAE,OAAOA,GAAE,QAAQ,CAAC,GAAG,GAAG,CAAC;AAC/C;AAAA,kCACJ;AACA,sCAAI,EAAE,GAAG,GAAGP,EAAC,GAAG;AACZ,oCAAAY,GAAE,GAAG,CAAC;AACN;AAAA,kCACJ;AACA,sCAAIJ,GAAE,GAAG,CAAC,GAAG;AACT,sCAAE,GAAG,CAAC,KAAK,WAAWP,GAAE,UAAU,YAAY,aAAaW,GAAE,GAAG,CAAC,MAAM,IAAI,MAAIL,GAAE,OAAOA,GAAE,QAAQ,CAAC,GAAG,GAAG,CAAC,KAAKP,GAAE,aAAa;AAC9H;AAAA,kCACJ;AACA,sCAAIQ,GAAE,GAAG,CAAC,GAAG;AACT,oCAAAI,GAAE,GAAG,CAAC;AACN;AAAA,kCACJ;AAAA,gCACJ;AAAA,8BACJ;AACA,mCAAKL,GAAE,KAAK,CAAC;AAAA,4BACjB;AAAA,0BACJ;AACA,8BAAIM,GAAE,OAAON,EAAC,GAAGJ,KAAIb,IAAG,IAAI,EAAE,SAAS,KAAK,GAAGK,KAAIY,GAAE,SAAS,KAAK,CAAC,GAAG,KAAK,KAAK,CAACZ,MAAK,EAAE,QAAS,SAASL,IAAGE,IAAG;AAC7G,4BAAAF,GAAE,8BAA8B;AAAA,0BACpC,CAAE,GAAGG,KAAI,EAAE,MAAM;AAAA,wBACrB,MAAO,CAAAE,KAAII,GAAEK,GAAE,QAAQ,CAAC,KAAKZ,GAAE,QAAQ,CAAC,GAAG,CAAE,CAAE,EAAE,OAAOK,EAAC,GAAGY,EAAC;AAC7D,4BAAId,GAAG,QAAO;AAAA,sBAClB,EAAE;AACF,0BAAIA,GAAE,gBAAgBc,OAAMjB,GAAE,QAAQA,GAAE,QAAQ,QAAQG,EAAC,IAAI,CAAC,EAAG,QAAO,WAAW;AAC/E,iCAASD,KAAIC,IAAGC,KAAI,OAAIK,KAAIR,GAAE,SAAS,IAAIA,GAAE,MAAM,IAAI,GAAGQ,MAAK,MAAMP,GAAE,WAAW,GAAG,IAAIO,KAAI,IAAIP,GAAE,WAAW,QAAQS,MAAKb,IAAGW,MAAK;AAC/H,8BAAIQ,KAAIjB,GAAE,QAAQA,GAAE,QAAQ,QAAQE,EAAC,IAAI,CAAC;AAC1C,8BAAIC,KAAII,GAAEU,IAAG,CAAER,EAAE,EAAE,OAAOJ,EAAC,GAAGY,EAAC,GAAG;AAC9B,gCAAI,EAAE,QAAS,SAASjB,IAAGC,IAAG;AAC1B,+BAACF,KAAI,EAAEkB,IAAGjB,GAAE,KAAK,IAAIA,GAAE,QAAQ,EAAE,EAAE,SAAS,CAAC,EAAE,OAAO,qBAAqBS,MAAKP,GAAE,WAAW,KAC7FH,GAAE,OAAOU,KAAI,MAAMQ,GAAE,QAAQ,QAAQlB,EAAC,IAAI,KAAKG,GAAE,WAAW,KAAKH,GAAE,sBAAsBa,GAAEb,IAAGkB,EAAC,MAAM,IAAI,MACzGN,KAAIb,IAAGU,GAAE,UAAU,QAAQF,GAAE,eAAeR,KAAI,CAAC,KAAKW,KAAIP,GAAE,WAAW,OAAO,MAAM,CAAE,KAAK,GAAI,EAAE,QAAQA,GAAE,WAAW,GAAG,MAAM,EAAE,IAAI,GACrI,IAAI,SAASE,KAAI,MAAID,KAAI,QAAK,CAACC,MAAKL,GAAE,QAAQO,GAAE,UAAUR,EAAC,IAAImB,GAAE,QAAQ,SAASA,GAAE,QAAQ,QAAQlB,EAAC;AAAA,4BACzG,CAAE,GAAGK,GAAG;AACR,mCAAO;AAAA,0BACX;AAAA,wBACJ;AAAA,sBACJ,EAAE;AACF,0BAAID,KAAI,EAAEA,IAAGF,IAAGI,IAAGY,EAAC,EAAG,QAAO;AAAA,oBAClC,MAAO,CAAAN;AAAA,kBACX;AACA,2BAASM,KAAIhB,GAAE,SAAS,IAAIA,GAAE,MAAM,IAAI,GAAGgB,KAAIjB,GAAE,QAAQ,QAAQiB,KAAK,KAAI,SAAOjB,GAAE,QAAQiB,EAAC,EAAE,cAAc;AACxG,wBAAIL,KAAIL,GAAEP,GAAE,QAAQiB,EAAC,GAAG,CAAEA,EAAE,EAAE,OAAOd,EAAC,GAAGE,EAAC;AAC1C,wBAAIO,MAAKD,OAAMb,GAAG,QAAOc;AACzB,wBAAID,KAAIb,GAAG;AAAA,kBACf;AAAA,gBACJ;AACA,yBAAS,EAAEA,IAAGE,IAAG;AACb,sBAAIC,KAAI,MAAMH,GAAE,QAAQ,QAAQE,EAAC;AACjC,yBAAOC,MAAKH,GAAE,QAAQ,QAAS,SAASA,IAAGC,IAAG;AAC1C,+BAAWD,GAAE,WAAWG,OAAMA,KAAI,EAAEH,IAAGE,EAAC;AAAA,kBAC5C,CAAE,GAAGC;AAAA,gBACT;AACA,oBAAIH,KAAI,IAAI;AACR,sBAAI,WAAWE,IAAG;AACd,6BAAS,GAAGgB,KAAIlB,KAAI,GAAG,YAAY,IAAIQ,GAAE,eAAeU,EAAC,KAAKV,GAAE,MAAMU,EAAC,MAAMA,KAAI,KAAM,CAAAA;AACvF,+BAAW,KAAKA,KAAI,OAAO,IAAI,SAASlB,IAAGE,IAAG;AAC1C,0BAAIC,IAAGF,KAAI,CAAC;AACZ,6BAAO,MAAM,QAAQC,EAAC,MAAMA,KAAI,CAAEA,EAAE,IAAIA,GAAE,SAAS,MAAM,WAAWA,GAAE,CAAC,EAAE,eAAe,SAAOQ,GAAE,aAAa,OAAOT,KAAI,EAAE,KAAKK,IAAGN,IAAGE,GAAE,MAAM,CAAC,EAAE,QAAQ,MAAM,GAAG,WAAWD,KAAIC,GAAE,CAAC,EAAE,QAAQ,MAAM,KAAKA,GAAE,QAAS,SAASF,IAAG;AAC5N,+BAAOA,GAAE,QAAQ,MAAMC,GAAE,UAAUE,KAAIH,GAAE,aAAaC,KAAID,GAAE,QAAQ,MAAM,KAAKA,GAAE,QAAQG,EAAC,KAAK,OAAOF,GAAEE,EAAC,EAAE,SAAS,EAAE,QAAQH,GAAE,QAAQG,EAAC,CAAC,MAAMF,GAAEE,EAAC,KAAK,MAAMH,GAAE,QAAQG,EAAC;AAAA,sBAC7K,CAAE,IAAIF;AAAA,oBACV,EAAEiB,IAAG,CAAC,GAAG,IAAI,EAAE,KAAK,EAAE,GAAGL,KAAIK;AAAA,kBACjC;AACA,sBAAIV,GAAE,MAAMR,EAAC,KAAKQ,GAAE,MAAMR,EAAC,EAAE,CAAC,EAAE,OAAO,EAAG,QAAOQ,GAAE,MAAMR,EAAC;AAC1D,2BAAS,IAAI,EAAE,MAAM,GAAG,IAAImB,GAAE,QAAQ,KAAK;AACvC,wBAAI,EAAEA,GAAE,CAAC,GAAG,GAAG,CAAE,CAAE,CAAC,KAAKN,OAAMb,MAAKa,KAAIb,GAAG;AAAA,kBAC/C;AAAA,gBACJ;AACA,wBAAQ,MAAM,EAAE,UAAU,MAAM,EAAE,KAAK;AAAA,kBACnC,OAAO;AAAA,oBACH,IAAI;AAAA,oBACJ,QAAQ;AAAA,oBACR,aAAa;AAAA,oBACb,QAAQ;AAAA,oBACR,KAAK;AAAA,oBACL,aAAa;AAAA,kBACjB;AAAA,kBACA,SAAS,KAAK,MAAM,EAAE,OAAQ,SAASA,IAAG;AACtC,2BAAO,SAAOA,GAAE;AAAA,kBACpB,CAAE,EAAE,SAAS,CAAE,CAAE,IAAI,CAAC;AAAA,kBACtB,MAAM,CAAC;AAAA,kBACP,IAAI;AAAA,gBACR,CAAC,GAAG,WAAWE,MAAKM,GAAE,MAAMR,EAAC,IAAIK,KAAIE,GAAE,OAAO,MAAI,CAAC,GAAG,CAAC,KAAKC,GAAE,MAAMR,EAAC,IAAIO,GAAE,OAAO,MAAI,CAAC,GAAG,CAAC,GAC3FF,KAAIG,GAAE,MAAMR,EAAC,IAAI,EAAE,QAAS,SAASA,IAAG;AACpC,kBAAAA,GAAE,MAAM,cAAcA,GAAE,MAAM,kBAAkB;AAAA,gBACpD,CAAE,GAAGK;AAAA,cACT;AAAA,YACJ;AAAA,YACA,MAAM,SAASL,IAAGE,IAAGC,IAAG;AACpB,qBAAO,eAAeD,IAAG,cAAc;AAAA,gBACnC,OAAO;AAAA,cACX,CAAC,GAAGA,GAAE,YAAY,GAAGA,GAAE,wBAAwB,SAASF,IAAGE,IAAGC,IAAG;AAC7D,yBAASF,IAAGG,KAAI,KAAK,KAAK,SAASF,KAAIA,GAAE,MAAM,GAAG,CAAC,GAAGG,KAAI,OAAIC,KAAI,WAAWH,KAAIA,GAAE,MAAM,GAAG,IAAI,CAAC,GAAGI,KAAI,GAAGA,KAAID,GAAE,QAAQC,KAAK,SAAQN,KAAID,GAAE,QAAQM,GAAEC,EAAC,CAAC,MAAMP,GAAE,OAAOC,IAAG,CAAC;AAC3K,yBAASO,KAAI,GAAGA,KAAIR,GAAE,QAAQQ,KAAK,KAAIJ,GAAE,SAASJ,GAAEQ,EAAC,CAAC,GAAG;AACrD,kBAAAH,KAAI;AACJ;AAAA,gBACJ;AACA,uBAAOA;AAAA,cACX,GAAGH,GAAE,eAAe,SAASF,IAAGE,IAAGC,IAAGF,IAAGO,IAAG;AACxC,oBAAIE,KAAI,MAAMC,KAAI,KAAK,SAASF,KAAI,KAAK;AACzC,qBAAKA,GAAE,gBAAgBC,GAAE,WAAWR,OAAM,EAAE,KAAK,YAAYA,KAAI,EAAE,KAAK,SAASA,OAAM,EAAE,KAAK,WAAWA,KAAI,EAAE,KAAK,YACpHQ,GAAE,QAAQ;AACN,sBAAIS,KAAIhB,GAAE;AACV,kBAAAA,GAAE,MAAMA,GAAE,OAAOA,GAAE,QAAQgB;AAAA,gBAC/B;AACA,oBAAIP,IAAGC,KAAI,EAAE,qBAAqB,KAAKH,IAAG,QAAQ,IAAE;AACpD,gBAAAP,GAAE,OAAO,EAAE,UAAU,KAAKO,EAAC,EAAE,UAAUG,MAAKV,GAAE,QAAQA,GAAE,MAAMU,KAAI;AAClE,gBAAAX,OAAM,EAAE,KAAK,YAAYC,GAAE,MAAMA,GAAE,QAAQ,MAAMA,GAAE,QAAQ,EAAE,aAAa,KAAKO,IAAGP,GAAE,KAAK,KAAKD,OAAM,EAAE,KAAK,UAAUC,GAAE,UAAUA,GAAE,QAAQA,GAAE,MAAM,EAAE,OAAO,KAAKO,IAAGP,GAAE,KAAK,MAAI,IAAE,IAAIA,GAAE,MAAM,IAAI,EAAE,SAAS,KAAKO,IAAGP,GAAE,GAAG,IAAI;AAC7N,2BAAQS,KAAI,EAAE,KAAKF,IAAGP,EAAC,QAAQ,SAAOF,MAAK,UAAOQ,GAAE,cAAc,SAASA,GAAE,SAAS,OAAO,EAAE,QAAQ,KAAKC,IAAGP,GAAE,KAAK,EAAE,MAAM,IAAI,QAAQ,GAAG,MAAM,EAAE,KAAKO,IAAG,IAAE,GAC/J,SAAOT,OAAMU,GAAE,IAAIT,OAAM,EAAE,KAAK,SAASC,GAAE,QAAQS,KAAIT,GAAE,OAAOQ,GAAE,IAAI,EAAE,0BAA0B,KAAKD,IAAG;AAAA,kBACtG,OAAOC,GAAE;AAAA,kBACT,KAAKA,GAAE;AAAA,gBACX,GAAG,OAAI,UAAOF,GAAE,cAAcP,OAAM,EAAE,KAAK,YAAY,SAAS,MAAM,EAAE;AAAA,cAC5E,GAAGA,GAAE,aAAa,GAAGA,GAAE,cAAc,GAAGA,GAAE,UAAU,GAAGA,GAAE,oBAAoB,GAC7EA,GAAE,iBAAiB;AACnB,kBAAID,KAAIE,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI,GAAG,IAAIA,GAAE,IAAI;AACrD,uBAAS,EAAEH,IAAGE,IAAGC,IAAGF,IAAGG,IAAGI,IAAG;AACzB,oBAAIE,KAAI,MAAMC,KAAI,KAAK,eAAeQ,KAAI,KAAK,MAAMP,KAAIF,GAAE;AAC3D,oBAAI,CAACA,GAAE,cAAe,QAAO;AAC7B,oBAAIG,IAAGC,IAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAGI,IAAG,GAAG,IAAIP,GAAE,OAAO,MAAI,CAAC,GAAGC,GAAE,cAAc,GAAG,IAAID,GAAE,OAAO,MAAI,CAAC,GAAGC,GAAE,KAAK,GAAG,IAAI,OAAI,IAAI,OAAI,IAAI,WAAWR,KAAIA,KAAI,EAAE,qBAAqB,KAAKM,EAAC;AAChL,oBAAIF,OAAMU,KAAIV,GAAE,OAAO,IAAIA,GAAE,KAAKA,GAAE,QAAQA,GAAE,QAAQU,KAAIV,GAAE,KAAK,IAAIA,GAAE,SACvE,OAAO,KAAK,WAAWJ,GAAG,CAAAS,KAAI,GAAGC,MAAK,IAAI,EAAE,QAAQ,KAAKJ,IAAGG,EAAC,GAAG;AAAA,oBAAkB,QAAM,KAAK,GAAG,IAAK,MAAK,IAAID,GAAE,eAAe,CAAC,MAAM,WAAW,EAAE,aAAa;AAC5J,sBAAI,MAAMZ,MAAK,MAAM,KAAK,EAAE,QAAQ,EAAE,WAAW,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAG;AACjF,kBAAAa,KAAI,GAAGC,KAAIF,GAAE,eAAeC,EAAC,EAAE,aAAa,IAAI;AAAA,gBACpD;AACA,oBAAI,WAAWC,IAAG;AACd,sBAAI,SAASD,EAAC,GAAGD,GAAE,SAAS,CAAC,IAAIA,GAAE,SAAS,CAAC,KAAK,CAAC,GAAG,SAAOZ,MAAKY,GAAE,SAAS,CAAC,EAAE,MAAM,GACtF,EAAE,kBAAkB,CAAC,IAAI,MAAM,EAAE,WAAW;AAC5C,sBAAI,IAAI,CAAC,GAAG,IAAI;AAChB,uBAAK,IAAI,GAAG,IAAI,EAAE,qBAAqB,KAAKF,IAAG,QAAQ,IAAE,IAAI,GAAG,IAAK,QAAO,KAAKV,MAAK,KAAK,WAAWE,OAAM,EAAE,KAAKA,EAAC,GACpH,IAAI,EAAE,SAAS,KAAK,IAAIU,GAAE,eAAe,CAAC,MAAM,SAAO,EAAE,mBAAmB,WAAWJ,MAAK,IAAIU,MAAK,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,GAC9HN,GAAE,eAAe,OAAO,GAAG,CAAC;AAC5B,uBAAK,OAAO,KAAK,WAAWV,OAAM,EAAE,KAAKA,EAAC,GAAG,IAAI,EAAE,SAAS,IAAI,WAAWU,GAAE,SAAS,CAAC,KAAKA,GAAE,SAAS,CAAC,EAAE,SAAS,MAAM;AACrH,yBAAKA,GAAE,QAAQ,CAAC,GAAG,EAAE,aAAa,KAAKF,IAAG,IAAE,GAAG,IAAI,MAAI,IAAI,GAAG,IAAI,EAAE,WAAW,IAAI,EAAE,SAAS,KAAKS,GAAE,cAAc,QAAQ,IAAI,EAAE,SAAS,KAAKT,IAAG,CAAC,IAAI,EAAE,qBAAqB,KAAKA,IAAG,QAAQ,IAAE,IAAI,GACpM,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,KAAKA,IAAG,GAAG,GAAG,OAAIT,IAAG,IAAE,IAAI,IAAK,OAAM,MAAM,IAAI,IAAI,KAAKD,MAAK,MAAM,IAAI;AAAA,sBACpF,UAAU;AAAA,oBACd;AACA,wBAAI,EAAG;AACP,wBAAI,EAAE,aAAa,KAAKU,EAAC,GAAG,IAAI,EAAE,QAAQ,KAAKA,IAAG,CAAC,GAAGE,GAAE,iBAAiBD,GAAE,OAAO,MAAI,CAAC,GAAG,CAAC,GAC3FC,GAAE,QAAQD,GAAE,OAAO,MAAI,CAAC,GAAG,CAAC,GAAG,CAACC,GAAE,SAAS,CAAC,GAAG;AAC3C,0BAAI,EAAE,KAAKF,IAAGV,IAAGE,IAAGC,IAAGF,IAAG,IAAI,GAAGO,EAAC;AAClC;AAAA,oBACJ;AACA,wBAAI,QAAQ,EAAE,aAAa;AACvB,0BAAI,KAAK,GAAG,EAAE,kBAAkB,CAAC;AACjC,0BAAI,OAAOI,GAAE,SAAS,CAAC,EAAE,QAAQ,IAAI,MAAM,EAAE,WAAW,GAAG;AACvD,4BAAI,EAAE,KAAKF,IAAGV,IAAGE,IAAGC,IAAGF,IAAG,IAAI,GAAGO,EAAC;AAClC;AAAA,sBACJ;AACA,2BAAKI,GAAE,SAAS,CAAC,EAAE,KAAK,IAAI,MAAM,EAAE,WAAW,GAAG,IAAI,GAAG,IAAI,EAAE,qBAAqB,KAAKF,IAAG,QAAQ,IAAE,IAAI,GAAG,IAAK,CAAAE,GAAE,eAAe,OAAO,CAAC;AAAA,oBAC/I,MAAO,QAAOA,GAAE,SAAS,CAAC;AAAA,kBAC9B;AAAA,gBACJ;AACA,uBAAO,KAAK,UAAOO,GAAE,cAAc,OAAOP,GAAE,SAAS,CAAC,GAAG;AAAA,cAC7D;AACA,uBAAS,EAAEZ,IAAGE,IAAGC,IAAG;AAChB,oBAAIF,KAAI,KAAK,MAAMI,KAAI,KAAK;AAC5B,wBAAQJ,GAAE,UAAUC,GAAE,QAAQ;AAAA,kBAC5B,KAAK;AACH,oBAAAF,KAAIA,GAAE,YAAY;AAClB;AAAA,kBAEF,KAAK;AACH,oBAAAA,KAAIA,GAAE,YAAY;AAClB;AAAA,kBAEF,KAAK;AACH,wBAAIM,KAAID,GAAE,eAAeF,KAAI,CAAC;AAC9B,oBAAAH,KAAI,MAAMG,MAAKG,MAAKA,GAAE,UAAU,OAAO,aAAa,EAAE,QAAQ,KAAK,IAAIN,GAAE,YAAY,IAAIA,GAAE,YAAY;AACvG;AAAA,kBAEF;AACE,wBAAI,cAAc,OAAOC,GAAE,QAAQ;AAC/B,0BAAIM,KAAI,MAAM,UAAU,MAAM,KAAK,SAAS;AAC5C,sBAAAA,GAAE,KAAKF,GAAE,cAAc,GAAGL,KAAIC,GAAE,OAAO,MAAM,MAAMM,EAAC;AAAA,oBACxD;AAAA,gBACJ;AACA,uBAAOP;AAAA,cACX;AACA,uBAAS,EAAEA,IAAG;AACV,oBAAIE,KAAI,MAAMC,KAAI,KAAK,MAAMF,KAAI,KAAK;AACtC,oBAAI,cAAc,OAAOE,GAAE,WAAY,QAAOA,GAAE,WAAWH,IAAGG,EAAC;AAC/D,oBAAI,QAAQA,GAAE,QAAQ;AAClB,sBAAIC,KAAI,OAAIG,KAAI,EAAE,8BAA8B,KAAKL,IAAG,IAAE,GAAGM,KAAID,GAAE;AACnE,sBAAI,WAAWA,GAAE,OAAOA,GAAE,IAAI,kBAAkBA,GAAE,IAAI,eAAeA,GAAE,IAAI,oBAAoB;AAC3F,oBAAAH,KAAI;AACJ,6BAASM,KAAI,GAAGA,MAAKF,IAAGE,MAAK;AACzB,0BAAIC,KAAI,EAAE,gBAAgB,KAAKT,IAAGQ,EAAC,EAAE;AACrC,0BAAI,SAAOC,GAAE,UAAU,WAAWV,GAAE,eAAeS,EAAC,MAAM,UAAOC,GAAE,eAAe,WAAWA,GAAE,eAAeA,GAAE,eAAe,KAAKA,GAAE,oBAAoB,UAAOA,GAAE,sBAAsB,WAAWA,GAAE,uBAAuB,SAAOA,GAAE,UAAU,MAAMA,GAAE,OAAOX,GAAEU,EAAC,MAAM,EAAE,eAAe,KAAKR,IAAGQ,IAAGC,EAAC,GAAG;AACpS,wBAAAP,KAAI;AACJ;AAAA,sBACJ;AAAA,oBACJ;AAAA,kBACJ;AACA,yBAAOA;AAAA,gBACX;AAAA,cACJ;AACA,uBAAS,EAAEJ,IAAG;AACV,oBAAIE,KAAI,KAAK,KAAK,aAAa,IAAI;AACnC,uBAAO,KAAK,QAAQF,GAAE,QAAQA,GAAE,MAAME,KAAIF,GAAE,MAAMA,GAAE,QAAQE;AAAA,cAChE;AACA,uBAAS,EAAEF,IAAGE,IAAGC,IAAGF,IAAGG,IAAGe,IAAG,GAAG;AAC5B,oBAAI,IAAI,MAAM,IAAI,KAAK,eAAe,IAAI,KAAK,MAAM,IAAI,EAAE;AAC3D,gBAAAhB,KAAI,SAAOA;AACX,oBAAI,IAAIH;AACR,yBAAS,EAAEA,IAAG;AACV,sBAAI,WAAWA,IAAG;AACd,wBAAI,WAAWA,GAAE,WAAW,MAAM,QAAQA,GAAE,MAAM,MAAMA,GAAE,SAAS,CAAEA,GAAE,MAAO,IAC9EA,GAAE,OAAO,KAAM,SAASA,IAAGE,IAAG;AAC1B,6BAAO,EAAE,QAAQF,GAAE,MAAME,GAAE,MAAMA,GAAE,MAAMF,GAAE;AAAA,oBAC/C,CAAE,EAAE,QAAS,SAASA,IAAG;AACrB,wBAAE,KAAK,GAAG;AAAA,wBACN,OAAOA;AAAA,wBACP,KAAKA,KAAI;AAAA,sBACb,CAAC;AAAA,oBACL,CAAE,GAAGA,GAAE,SAAS,SAAS,WAAWA,GAAE,WAAW,MAAM,QAAQA,GAAE,MAAM,MAAMA,GAAE,SAAS,CAAEA,GAAE,MAAO,IACnGA,GAAE,OAAO,KAAM,SAASA,IAAGE,IAAG;AAC1B,6BAAO,EAAE,QAAQA,GAAE,MAAMF,GAAE,MAAMA,GAAE,MAAME,GAAE;AAAA,oBAC/C,CAAE,EAAE,QAAS,SAASF,IAAG;AACrB,6BAAOA,GAAE,KAAK,EAAE,KAAK,GAAGA,GAAE,KAAKA,GAAE,GAAG,WAAWA,GAAE,UAAUA,GAAE,QAAQ,WAAWA,GAAE,cAAcA,GAAE,cAAcC,EAAC;AAAA,oBACrH,CAAE,GAAGD,GAAE,SAAS,SAASA,GAAE,qBAAqBA,GAAE,QAAQ;AACtD,0BAAIE,KAAIF,GAAE;AACV,wBAAE,KAAK,GAAG,SAAOE,KAAIA,KAAIA,GAAE,OAAOA,GAAE,KAAKF,GAAE,MAAM,GAAGA,GAAE,oBAAoB;AAAA,oBAC9E;AACA,+BAAWA,GAAE,oBAAoB,IAAIA,GAAE,iBAAiBA,KAAI;AAAA,kBAChE;AACA,yBAAOA;AAAA,gBACX;AACA,yBAASkB,GAAEhB,IAAGC,IAAGC,IAAG;AAChB,sBAAIG,KAAI;AACR,yBAAO,EAAE,SAAS,KAAK,GAAGL,EAAC,EAAE,MAAO,SAASQ,IAAGD,IAAG;AAC/C,wBAAIU,KAAIT,GAAE;AACV,wBAAI,EAAE,UAAU,KAAK,GAAG,IAAE,GAAG,WAAQH,MAAK,CAACY,GAAE,OAAO,WAAW,EAAE,eAAe,EAAE,aAAa,KAAK,GAAGjB,EAAC,CAAC,OAAO,QAAQiB,GAAE,KAAKA,GAAE,GAAG,KAAKhB,IAAG,GAAGD,IAAGE,IAAG,GAAG,EAAE,KAAK,GAAGJ,EAAC,CAAC,KAAKG,OAAMgB,GAAE,OAAOhB,OAAM,EAAE,8BAA8B,OAAOgB,GAAE,OAAO;AAAA,sBAC1O,GAAG,EAAE,eAAe,KAAK,GAAGjB,IAAGiB,IAAG,IAAE,KAAKA,GAAE;AAAA,sBAC3C,KAAKjB;AAAA,oBACT,KAAK;AACD,0BAAIU,KAAI,WAAWL,GAAE,IAAIA,GAAE,IAAIJ,IAAGU,KAAIX;AACtC,6BAAOU,KAAIA,OAAM,EAAE,6BAA6B,SAAOO,GAAE,SAAS,EAAE,eAAe,KAAK,GAAGjB,IAAGiB,IAAG,IAAE,KAAKA,GAAE,MAAMP,IAChH,UAAQL,KAAI,EAAEA,EAAC,MAAM,WAAWA,GAAE,OAAOA,GAAE,QAAQL,OAAMW,KAAIN,GAAE,MAAM,SAAOA,MAAK,WAAWA,GAAE,OAAO,WAAWA,GAAE,IAAI,SAAM,UAAO,EAAE,KAAK,GAAGP,IAAG,EAAE,OAAO,CAAC,GAAGU,IAAG;AAAA,wBAC5J,OAAO,EAAE,KAAK,GAAGE,IAAGO,IAAGN,EAAC;AAAA,sBAC5B,CAAC,GAAGZ,IAAGY,EAAC,MAAMN,KAAI,QAAK;AAAA,oBAC3B;AACA,2BAAO;AAAA,kBACX,CAAE,GAAGA;AAAA,gBACT;AACA,2BAAWP,GAAE,UAAU,IAAI,EAAE,QAAQA,GAAE,MAAMA,GAAE;AAC/C,oBAAI,IAAI,MAAI,IAAI,EAAE,OAAO,MAAI,CAAC,GAAG,EAAE,cAAc;AACjD,oBAAI,UAAO,EAAE,cAAc,WAAW,EAAE,SAAS,CAAC,KAAK,SAAOI,MAAK,SAAOH,GAAG,UAAS,IAAI,GAAG,KAAK,EAAE,QAAQD,GAAE,QAAQA,GAAE,MAAM,IAAK,YAAW,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,QAChL,OAAO,EAAE,MAAM,CAAC;AAChB,oBAAI,cAAc,OAAO,EAAE,iBAAiB,SAAOC,MAAK,SAAOkB,OAAM,IAAI,EAAE,IAAI,EAAE,cAAc,KAAK,GAAG,EAAE,UAAU,KAAK,CAAC,GAAG,GAAGjB,IAAG,EAAE,KAAK,GAAGF,EAAC,GAAG,GAAG,GAAGA,IAAGG,MAAKC,EAAC,CAAC,IAChK,SAAO,GAAG;AACN,sBAAI,IAAIc,GAAE,GAAGhB,IAAGC,EAAC,IAAI,CAACA,MAAK,SAAOF,OAAM,UAAO,KAAK,SAAOkB,IAAG;AAC1D,wBAAI,IAAI,EAAE,eAAe,CAAC;AAC1B,wBAAI,CAAC,KAAK,SAAO,EAAE,MAAM,UAAU,EAAE,MAAM,QAAQjB,MAAKA,OAAM,EAAE,2BAA2B;AACvF,0BAAI,EAAE,cAAc,WAAW,EAAE,eAAe,EAAE,SAAS,KAAK,GAAG,CAAC,CAAC,KAAKF,GAAE,MAAM,GAAG;AACjF,4BAAI,IAAI;AACR,4BAAI,EAAE,UAAU,CAAC,KAAK,WAAW,EAAE,eAAe,EAAE,SAAS,KAAK,GAAG,CAAC,CAAC,KAAK,WAAQ,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,UAAU,CAAC,GAAGE,IAAG,MAAI,IAAE,OAAO,SAAOE,OAAM,EAAE,QAAQ,IAC7J,IAAI,OAAKJ,GAAE,MAAM,MAAM,EAAE,eAAe,CAAC,IAAI,SAAS,CAAC,KAAK,CAAC,EAAE,OAAO,KAAK,GAAG,GAAG,EAAE,cAAc,MAAM,CAAC;AAAG,mCAAS,IAAI,IAAI,GAAG,IAAI,EAAE,SAAS,KAAK,GAAG,GAAG,OAAI,MAAM,CAAC,GAAG,KAAK,GAAG,IAAK,KAAI,WAAQ,IAAIkB,GAAE,GAAGhB,IAAGC,EAAC,IAAI;AAC7M,gCAAI,EAAE,KAAK,GAAG,GAAG,WAAW,EAAE,MAAM,EAAE,MAAM,CAAC,KAAK,GAAG,IAAI;AACzD;AAAA,0BACJ;AAAA;AAAA,sBACJ;AAAA,oBACJ,MAAO,KAAI;AAAA,sBACP,OAAO,EAAE,SAAS,KAAK,GAAG,CAAC;AAAA,oBAC/B;AAAA,kBACJ;AACA,oBAAE,iBAAiB,SAAOC,MAAK,CAACD,OAAMC,KAAI,MAAI,UAAO,KAAK,EAAE,eAAe,EAAE,KAAK,GAAG,EAAE,UAAU,KAAK,CAAC,CAAC,KAAK,MAAM,KAAK,IAAI,EAAE,KAAK,GAAG,GAAGF,IAAGC,IAAGF,IAAG,QAAQD,EAAC,KAAK,EAAE,KAAK,GAAGA,EAAC,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,SAAS,KAAK,EAAE,cAAc,KAAK,KAAK,SAAO,EAAE,gBAAgB,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,SAAS,KAAK,EAAE,qBAAqB,KAAK,GAAG,QAAQ,IAAE,IAAI,OAAO,IAAI,EAAE,KAAK,GAAG,IAAE,KACrX,SAAO,MAAM,IAAI;AAAA,oBACb,KAAK;AAAA,kBACT;AAAA,gBACJ;AACA,oBAAI,cAAc,OAAO,EAAE,kBAAkB,SAAOC,MAAK,SAAOkB,IAAG;AAC/D,sBAAI,IAAI,EAAE,eAAe,KAAK,GAAG,EAAE,UAAU,KAAK,GAAG,IAAE,GAAG,WAAWnB,GAAE,QAAQ,EAAE,QAAQA,GAAE,MAAMA,GAAE,QAAQA,IAAGE,IAAG,GAAG,GAAG,GAAGC,IAAG,CAAC;AAC9H,6BAAW,MAAM,IAAI,SAAO,IAAI,IAAI;AAAA,gBACxC;AACA,qBAAK,WAAW,EAAE,QAAQ,EAAE,MAAM,IAAI,UAAO,KAAK,SAAOgB,MAAK,EAAE,aAAa,KAAK,GAAG,IAAE,GACvF,EAAE,iBAAiB,EAAE,OAAO,MAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,GAAG,QAAQ,GAAG,IAAE;AACjE,oBAAI,IAAI,EAAE,CAAC;AACX,2BAAW,EAAE,cAAc,EAAE,UAAU,KAAK,CAAC,EAAE,SAAS,EAAE,aAAa,CAAClB,OAAM,EAAE,aAAa,KAAK,GAAG,IAAE,GACvG,EAAE,iBAAiB,EAAE,OAAO,MAAI,CAAC,GAAG,CAAC,GAAG,IAAI;AAC5C,uBAAO;AAAA,cACX;AACA,uBAAS,EAAED,IAAGE,IAAGC,IAAG;AAChB,yBAASF,KAAI,KAAK,SAASG,KAAI,OAAIC,KAAI,EAAE,SAAS,KAAK,MAAML,EAAC,GAAGO,KAAI,GAAGA,KAAIF,GAAE,QAAQE,MAAK;AACvF,sBAAIF,GAAEE,EAAC,EAAE,UAAUF,GAAEE,EAAC,EAAE,MAAM,cAAcL,GAAE,MAAMC,GAAE,iBAAiB,QAAQ,WAAW,MAAM,CAACA,GAAE,kBAAkB,CAACD,GAAE,MAAM,WAAWG,GAAEE,EAAC,EAAE,MAAM,cAAcL,GAAE,MAAM,aAAaC,GAAE,SAAS,CAACE,GAAEE,EAAC,EAAE,MAAM,UAAUF,GAAEE,EAAC,EAAE,MAAM,GAAG,KAAKL,GAAE,OAAOD,IAAGD,IAAG,OAAIG,EAAC,IAAI;AAC/P,oBAAAC,KAAI;AACJ;AAAA,kBACJ;AACA,sBAAIC,GAAEE,EAAC,EAAE,SAASF,GAAEE,EAAC,EAAE,MAAM,QAAQL,GAAE,MAAM,WAAW;AACpD,oBAAAE,KAAI;AACJ;AAAA,kBACJ;AAAA,gBACJ;AACA,uBAAO,UAAOA,MAAK,WAAWH,GAAE,UAAUD,EAAC,MAAMI,KAAI,EAAE,KAAK,MAAMJ,KAAIC,GAAE,UAAUD,EAAC,GAAGE,IAAGC,EAAC,IAC1FC;AAAA,cACJ;AACA,uBAAS,EAAEJ,IAAGE,IAAGC,IAAG;AAChB,oBAAIC,IAAGE,IAAGC,KAAI,MAAMC,KAAI,KAAK,SAASE,KAAI,KAAK,MAAMC,KAAI,KAAK,eAAeF,KAAIC,GAAE,2BAA2BS,KAAIZ,GAAE,QAAQJ,GAAE,MAAM,EAAE,QAAQ,IAAIA;AAClJ,oBAAIO,GAAE,4BAA4B,IAAI,SAAOV,GAAG,GAAE,aAAa,KAAKO,IAAG,KAAE,GAAGP,KAAI,GAChFE,KAAIC,GAAE,QAAQG,KAAI,EAAE,0BAA0B,KAAKC,IAAG;AAAA,kBAClD,OAAO;AAAA,kBACP,KAAK;AAAA,gBACT,GAAG,KAAE,EAAE;AAAA,qBAAY;AACf,uBAAKH,KAAIJ,IAAGI,KAAIF,IAAGE,KAAK,CAAAI,GAAE,eAAe,OAAOR,IAAG,CAAC;AACpD,kBAAAM,KAAIN;AAAA,gBACR;AACA,oBAAIY,KAAI,IAAID,GAAE,MAAM,UAAU;AAC9B,qBAAKP,KAAIJ,IAAGI,KAAIF,IAAGE,MAAK;AACpB,kBAAAQ,GAAE,MAAMO,GAAEf,EAAC,EAAE,SAAS,GAAGG,GAAE,YAAY;AACvC,sBAAIM,KAAIZ,GAAE,cAAc,cAAc,KAAKM,IAAGK,IAAG,MAAI,OAAI,OAAIN,EAAC;AAC9D,4BAAOO,MAAK,WAAWA,OAAMP,KAAIO,GAAE;AAAA,gBACvC;AACA,gBAAAH,GAAE,4BAA4BD;AAAA,cAClC;AACA,uBAAS,EAAET,IAAGE,IAAGC,IAAG;AAChB,oBAAIF,KAAI,MAAMG,KAAI,KAAK,SAASG,KAAI,KAAK;AACzC,oBAAI,WAAWP,GAAG,MAAKA,KAAIE,KAAI,GAAGF,KAAI,KAAK,CAACI,GAAE,eAAeJ,EAAC,GAAGA,KAAK;AACtE,yBAASQ,KAAIR,IAAGQ,KAAIN,IAAGM,MAAK;AACxB,sBAAI,WAAWJ,GAAE,eAAeI,EAAC,KAAK,CAAC,EAAE,OAAO,KAAKP,IAAGO,IAAG,KAAE;AAAG,wBAAI,KAAKA,KAAI,EAAE,QAAQ,KAAKP,IAAGO,EAAC,IAAIJ,GAAE,eAAeI,KAAI,CAAC,GAAG;AACzH,0BAAIE,KAAI,EAAE,SAAS,KAAKT,IAAGO,EAAC,EAAE,MAAM;AACpC,6BAAOE,GAAEA,GAAE,SAAS,CAAC,EAAE,MAAM,OAAOA,GAAE,IAAI;AAC1C,0BAAIC,IAAGQ,KAAI,EAAE,sBAAsB,KAAKlB,IAAGO,IAAGE,EAAC;AAC/C,0BAAIS,OAAM,SAAOA,GAAE,MAAM,OAAO,aAAaA,GAAE,MAAM,mBAAmBR,KAAIP,GAAE,eAAeI,KAAI,CAAC,MAAM,SAAOG,GAAE,MAAM,yBAAyBQ,KAAIZ,GAAE,OAAO,CAAC,GAAGY,IAAG;AAAA,wBAChK,OAAO,EAAE,eAAe,KAAKlB,IAAGO,IAAGW,GAAE,OAAO,IAAE,KAAKA,GAAE,MAAM;AAAA,sBAC/D,CAAC,GAAG,iBAAiB,MAAI,EAAE,KAAKlB,IAAGO,IAAGW,IAAG,IAAE,GAAG,SAAOhB,KAAI;AACrD,4BAAIS,KAAIR,GAAE,eAAeF,EAAC,EAAE;AAC5B,+BAAOE,GAAE,eAAeF,EAAC,IAAI,QAAQ,EAAE,KAAKD,IAAGC,IAAGU,IAAG,MAAI,IAAE;AAAA,sBAC/D;AAAA,oBACJ;AAAA;AAAA,gBACJ;AAAA,cACJ;AACA,uBAAS,EAAEZ,IAAGE,IAAGC,IAAGF,IAAG;AACnB,oBAAIG,KAAI,MAAMG,KAAI,KAAK,SAASC,KAAI,KAAK,MAAME,KAAI,KAAK;AACxD,yBAASE,GAAEZ,IAAGE,IAAGC,IAAG;AAChB,sBAAIF,KAAIC,GAAEF,EAAC;AACX,sBAAI,WAAWC,MAAK,SAAOA,GAAE,MAAM,UAAU,SAAOA,GAAE,MAAM,gBAAgB,WAAWC,GAAE,CAAC,KAAK,WAAWA,GAAE,CAAC,EAAE,cAAc;AACzH,wBAAIE,KAAID,GAAE,SAASH,KAAI,IAAIE,GAAEF,KAAI,CAAC,KAAK,SAAOE,GAAEF,KAAI,CAAC,EAAE,MAAM,UAAUE,GAAEF,KAAI,CAAC,IAAIE,GAAEF,KAAI,CAAC,GAAGK,KAAIF,GAAE,MAAMH,KAAI,IAAIE,GAAEF,KAAI,CAAC,KAAK,SAAOE,GAAEF,KAAI,CAAC,EAAE,MAAM,UAAUE,GAAEF,KAAI,CAAC,IAAIE,GAAEF,KAAI,CAAC;AAC9K,2BAAOI,MAAKC;AAAA,kBAChB;AACA,yBAAO;AAAA,gBACX;AACA,oBAAIQ,KAAI,GAAGC,KAAI,WAAWd,GAAE,QAAQA,GAAE,QAAQA,IAAG,IAAI,WAAWA,GAAE,MAAMA,GAAE,MAAMA,IAAG,IAAI;AACvF,oBAAIA,GAAE,QAAQA,GAAE,QAAQc,KAAId,GAAE,KAAK,IAAIA,GAAE,QAAQC,KAAI,WAAWA,KAAIA,KAAIa,IAAG,WAAWX,OAAMW,OAAM,KAAKN,GAAE,cAAc,WAAWD,GAAE,eAAeN,EAAC,KAAK,WAAWC,MAAKA,GAAE,MAAM,sBAAsBA,GAAE,MAAM,cAAc;AACzN,sBAAI,GAAG,IAAIQ,GAAE,OAAO,MAAI,CAAC,GAAGH,GAAE,cAAc,GAAG,IAAI,EAAE,qBAAqB,KAAKH,IAAG,QAAQ,IAAE;AAC5F,kBAAAG,GAAE,IAAIO;AACN,sBAAI,IAAI,EAAE,KAAKV,IAAGJ,EAAC,IAAIc,KAAIb;AAC3B,uBAAK,IAAI,GAAG,KAAK,GAAG,IAAK,CAAAM,GAAE,eAAe,OAAO,GAAG,CAAC,GAAG,WAAWL,MAAK,OAAOK,GAAE,MAAM,IAAI,CAAC;AAC5F,sBAAI,GAAGW,IAAG,IAAIjB,IAAG,IAAI;AACrB,uBAAKC,OAAMK,GAAE,eAAeN,EAAC,IAAIS,GAAE,OAAO,MAAI,CAAC,GAAGR,EAAC,GAAG,KAAK,MAAM,QAAQ,EAAE,CAAC,KAAKK,GAAE,UAAU,CAAC,MAAM,KAAKA,GAAE,UAAU,CAAC,IAAI,IAC1H,IAAIL,KAAI,IAAI,IAAI,GAAG,KAAK,GAAG,KAAK;AAC5B,wBAAI,YAAY,IAAI,EAAE,CAAC,MAAM,SAAO,EAAE,mBAAmB,KAAK,KAAK,KAAKY,MAAKF,GAAE,GAAG,GAAG;AAAA,sBACjF,OAAOE;AAAA,sBACP,KAAK;AAAA,oBACT,CAAC,IAAI;AACD,6BAAM,OAAO,EAAE,QAAQ,KAAKV,IAAG,CAAC,EAAE,MAAM,OAAO;AAC3C,4BAAI,WAAQc,KAAI,EAAE,KAAKd,IAAG,GAAG,GAAGI,EAAC,MAAM,QAAQ,EAAE,MAAM,KAAK;AACxD,kCAAQ,EAAE,MAAM,OAAO,EAAE,UAAU,KAAKJ,IAAG,IAAE;AAC7C,8BAAI,IAAI,EAAE,KAAKA,IAAG,GAAG,EAAE,OAAO,QAAQ,EAAE,MAAM,KAAK,IAAE;AACrD,8BAAI,IAAI,UAAO,GAAG,KAAK,EAAE,OAAO,KAAK,GAAG,CAAC,KAAKc,GAAG;AAAA,wBACrD,MAAO,KAAI;AACX,4BAAI,GAAG;AACH,qCAAWhB,MAAK,EAAE,MAAM,UAAU,MAAMF,GAAE,SAASa;AACnD;AAAA,wBACJ;AACA,4BAAI,CAAC,KAAK,EAAE,UAAU,KAAKT,EAAC,GAAG,IAAIG,GAAE,WAAY;AACjD;AAAA,sBACJ;AACA,4BAAM,EAAE,QAAQ,KAAKH,IAAG,CAAC,EAAE,MAAM,QAAQ,IAAI,QAAK,IAAI;AAAA,oBAC1D;AACA,wBAAI,CAAC,EAAG;AAAA,kBACZ;AACA,sBAAI,CAAC,EAAG,QAAOG,GAAE,iBAAiBG,GAAE,OAAO,MAAI,CAAC,GAAG,CAAC,GAAG,EAAE,aAAa,KAAKN,IAAG,IAAE,GAChF;AAAA,gBACJ,MAAO,CAAAF,MAAK,EAAE,QAAQ,KAAKE,IAAGH,EAAC,EAAE,MAAM,OAAOC,GAAE,MAAM,OAAOK,GAAE,eAAeN,EAAC,IAAIS,GAAE,OAAO,MAAI,CAAC,GAAGR,EAAC;AACrG,uBAAO,EAAE,aAAa,KAAKE,IAAG,IAAE,GAAGS;AAAA,cACvC;AAAA,YACJ;AAAA,UACJ,GAAG,IAAI,CAAC;AACR,mBAAS,EAAEZ,IAAG;AACV,gBAAI,IAAI,EAAEA,EAAC;AACX,gBAAI,WAAW,EAAG,QAAO,EAAE;AAC3B,gBAAI,IAAI,EAAEA,EAAC,IAAI;AAAA,cACX,SAAS,CAAC;AAAA,YACd;AACA,mBAAOD,GAAEC,EAAC,EAAE,GAAG,EAAE,SAAS,CAAC,GAAG,EAAE;AAAA,UACpC;AACA,cAAIA,KAAI,CAAC;AACT,iBAAO,WAAW;AACd,gBAAID,KAAIC;AACR,mBAAO,eAAeD,IAAG,cAAc;AAAA,cACnC,OAAO;AAAA,YACX,CAAC,GAAGA,GAAE,UAAU,QAAQ,EAAE,IAAI,GAAG,EAAE,IAAI,GAAG,EAAE,IAAI,GAAG,EAAE,IAAI,GAAG,EAAE,IAAI,GAAG,EAAE,GAAG,GAAG,EAAE,GAAG,GAClF,EAAE,IAAI;AACN,gBAAIE,IAAG,KAAKA,KAAI,EAAE,IAAI,MAAMA,GAAE,aAAaA,KAAI;AAAA,cAC3C,SAASA;AAAA,YACb;AACA,YAAAF,GAAE,UAAU,EAAE;AAAA,UAClB,EAAE,GAAGC;AAAA,QACT,EAAE;AAAA,MACN,CAAE;AAAA;AAAA;;;;;;;;;ACxrHF,iBAAS,KAAK;AACZ,iBAAO;QACT;AACA,iBAAS,QAAQ;AACf,iBAAO;QACT;AACA,iBAAS,QAAQ;AACf,iBAAO;QACT;AACA,cAAM,qBAAqB;AA0C3B,iBAAS,SAAS;AAMhB,mBAASwB,eAAc,GAAG;AACxB,mBAAO,OAAO,MAAM,YAAY,MAAM,QAAQ,EAAE,gBAAgB;UAClE;AACA,gBAAM,SAAS,CAAC;YACd,MAAM;YACN,MAAM,SAAU,GAAG;AACjB,qBAAO,OAAO,MAAM;YACtB;UACJ,GAAK;YACD,MAAM;YACN,MAAM,SAAU,GAAG;AACjB,qBAAO,OAAO,MAAM;YACtB;UACJ,GAAK;YACD,MAAM;YACN,MAAM,SAAU,GAAG;AACjB,qBAAO,OAAO,MAAM;YACtB;UACJ,GAAK;YACD,MAAM;YACN,MAAM,SAAU,GAAG;AACjB,qBAAO,OAAO,MAAM;YACtB;UACJ,GAAK;YACD,MAAM;YACN,MAAM,MAAM;UAChB,GAAK;YACD,MAAM;YACN,MAAM,SAAU,GAAG;AACjB,qBAAO,aAAa;YACtB;UACJ,GAAK;YACD,MAAM;YACN,MAAM,SAAU,GAAG;AACjB,qBAAO,aAAa;YACtB;UACJ,GAAK;YACD,MAAM;YACN,MAAMA;UACV,GAAK;YACD,MAAM;YACN,MAAM,SAAU,GAAG;AACjB,qBAAO,MAAM;YACf;UACJ,GAAK;YACD,MAAM;YACN,MAAM,SAAU,GAAG;AACjB,qBAAO,MAAM;YACf;UACJ,CAAG;AACD,gBAAM,UAAU;YACd,MAAM;YACN,MAAM;YACN,OAAO;UACX;AAOE,cAAI;AACJ,cAAI;AAGJ,cAAI,eAAe;AAInB,cAAIC,SAAQ;YACV,aAAa;UACjB;AASE,mBAAS,SAAS,UAAU;AAC1B,kBAAM,OAAO,QAAQ,IAAI,QAAQ;AACjC,gBAAI,MAAM;AACR,qBAAO;YACT;AAEA,gBAAI,UAAU,mBAAmB,WAAW;AAC5C,kBAAMC,UAAO,SAAS,YAAW;AACjC,gBAAI;AACJ,iBAAK,aAAa,UAAU;AAC1B,kBAAI,UAAU,YAAW,MAAOA,SAAM;AACpC,2BAAW,qBAAqB,YAAY;AAC5C;cACF;YACF;AACA,kBAAM,IAAI,UAAU,OAAO;UAC7B;AAeA,mBAAS,SAAS,OAAO;AACvB,gBAAI,aAAa,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACrF,kBAAM,cAAc,aAAa,SAAS,UAAU,EAAE,QAAQ,SAAS;AACvE,kBAAM,WAAW,CAAA;AACjB,qBAASC,KAAI,GAAGA,KAAI,MAAM,QAAQ,EAAEA,IAAG;AACrC,kBAAI,CAAC,MAAMA,EAAC,KAAK,OAAO,MAAMA,EAAC,EAAE,SAAS,YAAY,OAAO,MAAMA,EAAC,EAAE,SAAS,YAAY;AACzF,sBAAM,IAAI,UAAU,gEAAgE;cACtF;AACA,oBAAM,WAAW,MAAMA,EAAC,EAAE;AAC1B,kBAAI,QAAQ,IAAI,QAAQ,GAAG;AACzB,sBAAM,IAAI,UAAU,0BAA0B,WAAW,GAAG;cAC9D;AACA,uBAAS,KAAK,QAAQ;AACtB,sBAAQ,IAAI,UAAU;gBACpB,MAAM;gBACN,MAAM,MAAMA,EAAC,EAAE;gBACf,OAAO,MAAMA,EAAC,EAAE;gBAChB,OAAO,cAAcA;gBACrB,eAAe,CAAA;;cACvB,CAAO;YACH;AAEA,kBAAM,gBAAgB,SAAS,MAAM,WAAW;AAChD,uBAAW,SAAS,MAAM,GAAG,WAAW,EAAE,OAAO,QAAQ,EAAE,OAAO,aAAa;AAE/E,qBAASA,KAAI,cAAc,SAAS,QAAQA,KAAI,SAAS,QAAQ,EAAEA,IAAG;AACpE,sBAAQ,IAAI,SAASA,EAAC,CAAC,EAAE,QAAQA;YACnC;UACF;AAQA,mBAAS,QAAQ;AACf,sBAAU,oBAAI,IAAG;AACjB,uBAAW,CAAA;AACX,2BAAe;AACf,qBAAS,CAAC,OAAO,GAAG,KAAK;UAC3B;AAGA,gBAAK;AACL,mBAAS,MAAM;AAKf,mBAAS,mBAAmB;AAC1B,gBAAI;AACJ,iBAAK,YAAY,UAAU;AACzB,sBAAQ,IAAI,QAAQ,EAAE,gBAAgB,CAAA;YACxC;AACA,2BAAe;UACjB;AAQA,mBAAS,cAAc,OAAO;AAC5B,kBAAMC,WAAU,SAAS,OAAO,CAAAF,YAAQ;AACtC,oBAAM,OAAO,QAAQ,IAAIA,OAAI;AAC7B,qBAAO,CAAC,KAAK,SAAS,KAAK,KAAK,KAAK;YACvC,CAAC;AACD,gBAAIE,SAAQ,QAAQ;AAClB,qBAAOA;YACT;AACA,mBAAO,CAAC,KAAK;UACf;AAOA,mBAAS,gBAAgB,QAAQ;AAC/B,mBAAO,UAAU,OAAO,WAAW,cAAc,wBAAwB;UAC3E;AAoCA,mBAAS,cAAc,IAAI,WAAW,SAAS;AAC7C,gBAAI,CAAC,gBAAgB,EAAE,GAAG;AACxB,oBAAM,IAAI,UAAU,kBAAkB;YACxC;AAGA,kBAAM,QAAQ,WAAW,QAAQ;AACjC,kBAAM,kBAAkB,MAAM,QAAQ,SAAS,IAAI,UAAU,KAAK,GAAG,IAAI;AACzE,kBAAM,SAAS,eAAe,eAAe;AAC7C,kBAAM,qBAAqB,gBAAgB,MAAM;AAGjD,gBAAI,CAAC,SAAS,sBAAsB,GAAG,YAAY;AAEjD,oBAAM,QAAQ,GAAG,mBAAmB,aAAa,IAAI,kBAAkB;AACvE,kBAAI,OAAO;AACT,uBAAO;cACT;YACF;AAMA,kBAAM,UAAU,OAAO;AACvB,gBAAI;AACJ,gBAAI,OAAO;AACT,oCAAsB,CAAA;AACtB,kBAAIF;AACJ,mBAAKA,WAAQ,GAAG,YAAY;AAC1B,oCAAoB,KAAK,GAAG,mBAAmB,aAAa,IAAIA,OAAI,CAAC;cACvE;YACF,OAAO;AACL,oCAAsB,GAAG,mBAAmB;YAC9C;AACA,qBAASC,KAAI,GAAGA,KAAI,SAAS,EAAEA,IAAG;AAChC,oBAAM,OAAO,OAAOA,EAAC;AACrB,oBAAM,qBAAqB,CAAA;AAC3B,kBAAI;AACJ,mBAAK,eAAe,qBAAqB;AACvC,sBAAM,OAAO,gBAAgB,YAAY,QAAQA,EAAC;AAClD,oBAAI,CAAC,QAAQ,KAAK,aAAa,CAAC,KAAK,WAAW;AAC9C;gBACF;AACA,oBAAI,CAAC,KAAK,QAAQ;AAEhB,wBAAM,YAAY,aAAa,IAAI;AACnC,sBAAI,KAAK,MAAM,KAAK,WAAS,CAAC,UAAU,IAAI,MAAM,IAAI,CAAC,GAAG;AACxD;kBACF;gBACF;AAEA,mCAAmB,KAAK,WAAW;cACrC;AACA,oCAAsB;AACtB,kBAAI,oBAAoB,WAAW,EAAG;YACxC;AAEA,gBAAI;AACJ,iBAAK,aAAa,qBAAqB;AACrC,kBAAI,UAAU,OAAO,UAAU,SAAS;AACtC,uBAAO;cACT;YACF;AACA,kBAAM,IAAI,UAAU,sCAAsC,GAAG,QAAQ,aAAa,MAAM,gBAAgB,QAAQ,IAAI,IAAI,IAAI;UAC9H;AA4BA,mBAASE,MAAK,IAAI,WAAW,SAAS;AACpC,mBAAO,cAAc,IAAI,WAAW,OAAO,EAAE;UAC/C;AAQA,mBAAS,QAAQ,OAAO,UAAU;AAEhC,kBAAM,OAAO,SAAS,QAAQ;AAC9B,gBAAI,KAAK,KAAK,KAAK,GAAG;AACpB,qBAAO;YACT;AACA,kBAAM,cAAc,KAAK;AACzB,gBAAI,YAAY,WAAW,GAAG;AAC5B,oBAAM,IAAI,MAAM,iCAAiC,WAAW,WAAW;YACzE;AACA,qBAASF,KAAI,GAAGA,KAAI,YAAY,QAAQA,MAAK;AAC3C,oBAAM,WAAW,SAAS,YAAYA,EAAC,EAAE,IAAI;AAC7C,kBAAI,SAAS,KAAK,KAAK,GAAG;AACxB,uBAAO,YAAYA,EAAC,EAAE,QAAQ,KAAK;cACrC;YACF;AACA,kBAAM,IAAI,MAAM,oBAAoB,QAAQ,SAAS,QAAQ;UAC/D;AAQA,mBAAS,gBAAgB,QAAQ;AAC/B,gBAAI,YAAY,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACpF,mBAAO,OAAO,IAAI,OAAK,EAAE,IAAI,EAAE,KAAK,SAAS;UAC/C;AAOA,mBAAS,WAAW,OAAO;AACzB,kBAAM,YAAY,MAAM,QAAQ,KAAK,MAAM;AAC3C,kBAAM,QAAQ,CAAC,YAAY,QAAQ,MAAM,SAAS,IAAI,MAAM,MAAM,CAAC,IAAI;AACvE,kBAAM,WAAW,MAAM,MAAM,GAAG,EAAE,IAAI,OAAK,SAAS,EAAE,KAAI,CAAE,CAAC;AAC7D,gBAAI,SAAS;AACb,gBAAI,YAAY,YAAY,QAAQ;AACpC,kBAAM,aAAa,SAAS,IAAI,SAAU,MAAM;AAC9C,uBAAS,KAAK,SAAS;AACvB,2BAAa,KAAK,OAAO;AACzB,qBAAO;gBACL,MAAM,KAAK;gBACX,WAAW,KAAK;gBAChB,MAAM,KAAK;gBACX,OAAO,KAAK;gBACZ,YAAY;gBACZ,iBAAiB;cACzB;YACI,CAAC;AACD,mBAAO;cACL,OAAO;cACP,MAAM,UAAU,MAAM,GAAG,EAAE;;cAE3B;cACA,eAAe;cACf;YACN;UACE;AAQA,mBAAS,YAAY,OAAO;AAC1B,kBAAM,YAAY,MAAM,MAAM,IAAI,OAAK,EAAE,IAAI;AAC7C,kBAAM,sBAAsB,qBAAqB,SAAS;AAC1D,gBAAI,SAAS,MAAM;AACnB,gBAAI,UAAU,MAAM;AACpB,kBAAM,mBAAmB,oBAAoB,IAAI,SAAU,YAAY;AACrE,oBAAM,OAAO,SAAS,WAAW,IAAI;AACrC,uBAAS,KAAK,SAAS;AACvB,yBAAW,MAAM,WAAW;AAC5B,qBAAO;gBACL,MAAM,WAAW;gBACjB,WAAW,KAAK;gBAChB,MAAM,KAAK;gBACX,OAAO,KAAK;gBACZ;gBACA,iBAAiB,WAAW;cACpC;YACI,CAAC;AACD,mBAAO;cACL,OAAO,MAAM,MAAM,OAAO,gBAAgB;cAC1C,MAAM;cACN;cACA,eAAe,iBAAiB,SAAS;cACzC,WAAW,MAAM;YACvB;UACE;AASA,mBAAS,aAAa,OAAO;AAC3B,gBAAI,CAAC,MAAM,SAAS;AAClB,oBAAM,UAAU,oBAAI,IAAG;AACvB,oBAAM,MAAM,QAAQ,UAAQ,MAAM,QAAQ,IAAI,KAAK,IAAI,CAAC;YAC1D;AACA,mBAAO,MAAM;UACf;AASA,mBAAS,eAAe,cAAc;AACpC,kBAAM,SAAS,CAAA;AACf,gBAAI,OAAO,iBAAiB,UAAU;AACpC,oBAAM,IAAI,UAAU,4BAA4B;YAClD;AACA,kBAAM,YAAY,aAAa,KAAI;AACnC,gBAAI,cAAc,IAAI;AACpB,qBAAO;YACT;AACA,kBAAM,YAAY,UAAU,MAAM,GAAG;AACrC,qBAASA,KAAI,GAAGA,KAAI,UAAU,QAAQ,EAAEA,IAAG;AACzC,oBAAM,cAAc,WAAW,UAAUA,EAAC,EAAE,KAAI,CAAE;AAClD,kBAAI,YAAY,aAAaA,OAAM,UAAU,SAAS,GAAG;AACvD,sBAAM,IAAI,YAAY,gCAAgC,UAAUA,EAAC,IAAI,wCAA6C;cACpH;AAEA,kBAAI,YAAY,MAAM,WAAW,GAAG;AAClC,uBAAO;cACT;AACA,qBAAO,KAAK,WAAW;YACzB;AACA,mBAAO;UACT;AAOA,mBAAS,aAAa,QAAQ;AAC5B,kBAAM,QAAQ,KAAK,MAAM;AACzB,mBAAO,QAAQ,MAAM,YAAY;UACnC;AAQA,mBAAS,YAAY,OAAO;AAC1B,gBAAI,CAAC,SAAS,MAAM,MAAM,WAAW,GAAG;AAEtC,qBAAO;YACT,WAAW,MAAM,MAAM,WAAW,GAAG;AACnC,qBAAO,SAAS,MAAM,MAAM,CAAC,EAAE,IAAI,EAAE;YACvC,WAAW,MAAM,MAAM,WAAW,GAAG;AACnC,oBAAM,QAAQ,SAAS,MAAM,MAAM,CAAC,EAAE,IAAI,EAAE;AAC5C,oBAAM,QAAQ,SAAS,MAAM,MAAM,CAAC,EAAE,IAAI,EAAE;AAC5C,qBAAO,SAASG,IAAG,GAAG;AACpB,uBAAO,MAAM,CAAC,KAAK,MAAM,CAAC;cAC5B;YACF,OAAO;AAEL,oBAAM,QAAQ,MAAM,MAAM,IAAI,SAAU,MAAM;AAC5C,uBAAO,SAAS,KAAK,IAAI,EAAE;cAC7B,CAAC;AACD,qBAAO,SAASA,IAAG,GAAG;AACpB,yBAASH,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AACrC,sBAAI,MAAMA,EAAC,EAAE,CAAC,GAAG;AACf,2BAAO;kBACT;gBACF;AACA,uBAAO;cACT;YACF;UACF;AAOA,mBAAS,aAAa,QAAQ;AAC5B,gBAAI,OAAO,OAAO;AAClB,gBAAI,aAAa,MAAM,GAAG;AAExB,sBAAQ,QAAQ,MAAM,EAAE,IAAI,WAAW;AACvC,oBAAM,WAAW,MAAM;AACvB,oBAAM,WAAW,YAAY,KAAK,MAAM,CAAC;AACzC,oBAAM,gBAAgB,SAAU,MAAM;AACpC,yBAASA,KAAI,UAAUA,KAAI,KAAK,QAAQA,MAAK;AAC3C,sBAAI,CAAC,SAAS,KAAKA,EAAC,CAAC,GAAG;AACtB,2BAAO;kBACT;gBACF;AACA,uBAAO;cACT;AACA,qBAAO,SAAS,SAAS,MAAM;AAC7B,yBAASA,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AACrC,sBAAI,CAAC,MAAMA,EAAC,EAAE,KAAKA,EAAC,CAAC,GAAG;AACtB,2BAAO;kBACT;gBACF;AACA,uBAAO,cAAc,IAAI,KAAK,KAAK,UAAU,WAAW;cAC1D;YACF,OAAO;AAEL,kBAAI,OAAO,WAAW,GAAG;AACvB,uBAAO,SAAS,SAAS,MAAM;AAC7B,yBAAO,KAAK,WAAW;gBACzB;cACF,WAAW,OAAO,WAAW,GAAG;AAC9B,wBAAQ,YAAY,OAAO,CAAC,CAAC;AAC7B,uBAAO,SAAS,SAAS,MAAM;AAC7B,yBAAO,MAAM,KAAK,CAAC,CAAC,KAAK,KAAK,WAAW;gBAC3C;cACF,WAAW,OAAO,WAAW,GAAG;AAC9B,wBAAQ,YAAY,OAAO,CAAC,CAAC;AAC7B,wBAAQ,YAAY,OAAO,CAAC,CAAC;AAC7B,uBAAO,SAAS,SAAS,MAAM;AAC7B,yBAAO,MAAM,KAAK,CAAC,CAAC,KAAK,MAAM,KAAK,CAAC,CAAC,KAAK,KAAK,WAAW;gBAC7D;cACF,OAAO;AAEL,wBAAQ,OAAO,IAAI,WAAW;AAC9B,uBAAO,SAAS,SAAS,MAAM;AAC7B,2BAASA,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AACrC,wBAAI,CAAC,MAAMA,EAAC,EAAE,KAAKA,EAAC,CAAC,GAAG;AACtB,6BAAO;oBACT;kBACF;AACA,yBAAO,KAAK,WAAW,MAAM;gBAC/B;cACF;YACF;UACF;AAUA,mBAAS,gBAAgB,QAAQI,QAAO;AACtC,mBAAOA,SAAQ,OAAO,SAAS,OAAOA,MAAK,IAAI,aAAa,MAAM,IAAI,KAAK,MAAM,IAAI;UACvF;AAQA,mBAAS,kBAAkB,QAAQA,QAAO;AACxC,kBAAM,QAAQ,gBAAgB,QAAQA,MAAK;AAC3C,gBAAI,CAAC,OAAO;AACV,qBAAO,oBAAI,IAAG;YAChB;AACA,mBAAO,aAAa,KAAK;UAC3B;AAOA,mBAAS,YAAY,MAAM;AACzB,mBAAO,KAAK,eAAe,QAAQ,KAAK,eAAe;UACzD;AASA,mBAAS,oBAAoB,YAAYA,QAAO;AAC9C,kBAAM,UAAU,oBAAI,IAAG;AACvB,uBAAW,QAAQ,eAAa;AAC9B,oBAAM,WAAW,kBAAkB,UAAU,QAAQA,MAAK;AAC1D,kBAAIL;AACJ,mBAAKA,WAAQ,UAAU;AACrB,wBAAQ,IAAIA,OAAI;cAClB;YACF,CAAC;AACD,mBAAO,QAAQ,IAAI,KAAK,IAAI,CAAC,KAAK,IAAI,MAAM,KAAK,OAAO;UAC1D;AAUA,mBAAS,YAAYA,SAAM,MAAM,YAAY;AAC3C,gBAAI,KAAK;AACT,kBAAM,QAAQA,WAAQ;AAGtB,gBAAI,qBAAqB;AACzB,gBAAIK;AACJ,iBAAKA,SAAQ,GAAGA,SAAQ,KAAK,QAAQA,UAAS;AAC5C,oBAAM,mBAAmB,CAAA;AACzB,iCAAmB,QAAQ,eAAa;AACtC,sBAAM,QAAQ,gBAAgB,UAAU,QAAQA,MAAK;AACrD,sBAAM,OAAO,YAAY,KAAK;AAC9B,qBAAKA,SAAQ,UAAU,OAAO,UAAU,aAAa,UAAU,MAAM,MAAM,KAAK,KAAKA,MAAK,CAAC,GAAG;AAC5F,mCAAiB,KAAK,SAAS;gBACjC;cACF,CAAC;AACD,kBAAI,iBAAiB,WAAW,GAAG;AAEjC,2BAAW,oBAAoB,oBAAoBA,MAAK;AACxD,oBAAI,SAAS,SAAS,GAAG;AACvB,wBAAM,cAAc,cAAc,KAAKA,MAAK,CAAC;AAC7C,wBAAM,IAAI,UAAU,6CAA6C,QAAQ,iBAAiB,SAAS,KAAK,MAAM,IAAI,eAAe,YAAY,KAAK,KAAK,IAAI,cAAcA,SAAQ,GAAG;AACpL,sBAAI,OAAO;oBACT,UAAU;oBACV,IAAI;oBACJ,OAAAA;oBACA,QAAQ;oBACR;kBACZ;AACU,yBAAO;gBACT;cACF,OAAO;AACL,qCAAqB;cACvB;YACF;AAGA,kBAAM,UAAU,mBAAmB,IAAI,SAAU,WAAW;AAC1D,qBAAO,aAAa,UAAU,MAAM,IAAI,WAAW,UAAU,OAAO;YACtE,CAAC;AACD,gBAAI,KAAK,SAAS,KAAK,IAAI,MAAM,MAAM,OAAO,GAAG;AAC/C,yBAAW,oBAAoB,oBAAoBA,MAAK;AACxD,oBAAM,IAAI,UAAU,mCAAmC,QAAQ,iBAAiB,SAAS,KAAK,MAAM,IAAI,cAAc,KAAK,SAAS,GAAG;AACvI,kBAAI,OAAO;gBACT,UAAU;gBACV,IAAI;gBACJ,OAAO,KAAK;gBACZ;cACR;AACM,qBAAO;YACT;AAGA,kBAAM,YAAY,KAAK,IAAI,MAAM,MAAM,OAAO;AAC9C,gBAAI,KAAK,SAAS,WAAW;AAC3B,oBAAM,IAAI,UAAU,oCAAoC,QAAQ,iBAAiB,YAAY,eAAe,KAAK,SAAS,GAAG;AAC7H,kBAAI,OAAO;gBACT,UAAU;gBACV,IAAI;gBACJ,OAAO,KAAK;gBACZ,gBAAgB;cACxB;AACM,qBAAO;YACT;AAGA,kBAAM,WAAW,CAAA;AACjB,qBAASJ,KAAI,GAAGA,KAAI,KAAK,QAAQ,EAAEA,IAAG;AACpC,uBAAS,KAAK,cAAc,KAAKA,EAAC,CAAC,EAAE,KAAK,GAAG,CAAC;YAChD;AACA,kBAAM,IAAI,UAAU,wBAAwB,SAAS,KAAK,IAAI,IAAI,8DAA8D,QAAQ,GAAG;AAC3I,gBAAI,OAAO;cACT,UAAU;cACV,QAAQ;YACd;AACI,mBAAO;UACT;AAOA,mBAAS,mBAAmB,OAAO;AACjC,gBAAIK,OAAM,SAAS,SAAS;AAC5B,qBAASL,KAAI,GAAGA,KAAI,MAAM,MAAM,QAAQA,MAAK;AAC3C,cAAAK,OAAM,KAAK,IAAIA,MAAK,MAAM,MAAML,EAAC,EAAE,SAAS;YAC9C;AACA,mBAAOK;UACT;AAQA,mBAAS,yBAAyB,OAAO;AACvC,gBAAIA,OAAM,eAAe;AACzB,qBAASL,KAAI,GAAGA,KAAI,MAAM,MAAM,QAAQA,MAAK;AAC3C,kBAAI,CAAC,YAAY,MAAM,MAAMA,EAAC,CAAC,GAAG;AAChC,gBAAAK,OAAM,KAAK,IAAIA,MAAK,MAAM,MAAML,EAAC,EAAE,eAAe;cACpD;YACF;AACA,mBAAOK;UACT;AAgBA,mBAAS,cAAc,QAAQ,QAAQ;AAGrC,gBAAI,OAAO,QAAQ;AACjB,kBAAI,CAAC,OAAO,QAAQ;AAClB,uBAAO;cACT;YACF,WAAW,OAAO,QAAQ;AACxB,qBAAO;YACT;AAGA,gBAAI,OAAO,WAAW;AACpB,kBAAI,CAAC,OAAO,WAAW;AACrB,uBAAO;cACT;YACF,WAAW,OAAO,WAAW;AAC3B,qBAAO;YACT;AAGA,kBAAM,WAAW,mBAAmB,MAAM,IAAI,mBAAmB,MAAM;AACvE,gBAAI,WAAW,GAAG;AAChB,qBAAO;YACT;AACA,gBAAI,WAAW,GAAG;AAChB,qBAAO;YACT;AAIA,kBAAM,QAAQ,yBAAyB,MAAM;AAC7C,kBAAM,QAAQ,yBAAyB,MAAM;AAC7C,gBAAI,OAAO,eAAe;AACxB,kBAAI,CAAC,OAAO,eAAe;AACzB,wBAAQ,IAAI,SAAS;cACvB;YACF,WAAW,OAAO,eAAe;AAC/B,qBAAO,EAAE,IAAI,SAAS;YACxB;AAGA,kBAAM,WAAW,QAAQ;AACzB,gBAAI,WAAW,GAAG;AAChB,qBAAO;YACT;AACA,gBAAI,WAAW,GAAG;AAChB,qBAAO;YACT;AAGA,mBAAO;UACT;AAeA,mBAAS,kBAAkB,YAAY,YAAY;AACjD,kBAAM,QAAQ,WAAW;AACzB,kBAAM,QAAQ,WAAW;AACzB,kBAAM,QAAQ,KAAK,KAAK;AACxB,kBAAM,QAAQ,KAAK,KAAK;AACxB,kBAAM,WAAW,aAAa,KAAK;AACnC,kBAAM,WAAW,aAAa,KAAK;AAGnC,gBAAI,YAAY,MAAM,QAAQ;AAC5B,kBAAI,CAAC,YAAY,CAAC,MAAM,QAAQ;AAC9B,uBAAO;cACT;YACF,WAAW,YAAY,MAAM,QAAQ;AACnC,qBAAO;YACT;AAGA,gBAAI,OAAO;AACX,gBAAI,QAAQ;AACZ,gBAAI;AACJ,iBAAK,OAAO,OAAO;AACjB,kBAAI,IAAI,OAAQ,GAAE;AAClB,kBAAI,IAAI,cAAe,GAAE;YAC3B;AACA,gBAAI,OAAO;AACX,gBAAI,QAAQ;AACZ,iBAAK,OAAO,OAAO;AACjB,kBAAI,IAAI,OAAQ,GAAE;AAClB,kBAAI,IAAI,cAAe,GAAE;YAC3B;AACA,gBAAI,SAAS,MAAM;AACjB,sBAAQ,OAAO,QAAQ;YACzB;AAGA,gBAAI,YAAY,MAAM,eAAe;AACnC,kBAAI,CAAC,YAAY,CAAC,MAAM,eAAe;AACrC,uBAAO;cACT;YACF,WAAW,YAAY,MAAM,eAAe;AAC1C,qBAAO;YACT;AAGA,gBAAI,UAAU,OAAO;AACnB,sBAAQ,QAAQ,SAAS;YAC3B;AAGA,gBAAI,UAAU;AACZ,kBAAI,CAAC,UAAU;AACb,uBAAO;cACT;YACF,WAAW,UAAU;AACnB,qBAAO;YACT;AAGA,kBAAM,mBAAmB,MAAM,SAAS,MAAM,WAAW,WAAW,OAAO;AAC3E,gBAAI,oBAAoB,GAAG;AACzB,qBAAO;YACT;AAMA,kBAAM,cAAc,CAAA;AACpB,gBAAI,KAAK;AACT,qBAASL,KAAI,GAAGA,KAAI,MAAM,QAAQ,EAAEA,IAAG;AACrC,oBAAM,iBAAiB,cAAc,MAAMA,EAAC,GAAG,MAAMA,EAAC,CAAC;AACvD,0BAAY,KAAK,cAAc;AAC/B,oBAAM;YACR;AACA,gBAAI,OAAO,GAAG;AACZ,sBAAQ,KAAK,IAAI,MAAM,MAAM;YAC/B;AAMA,gBAAI;AACJ,gBAAI,QAAQ;AACZ,kBAAM,YAAY,SAAS,YAAY,SAAS;AAChD,iBAAK,KAAK,aAAa;AACrB,kBAAI,MAAM,GAAG;AACX,wBAAQ,IAAI,IAAI,CAAC,QAAQ,SAAS;cACpC;AACA,uBAAS;YACX;AAGA,mBAAO;UACT;AAUA,mBAAS,qBAAqB,WAAW;AACvC,gBAAI,UAAU,WAAW,GAAG;AAC1B,qBAAO,CAAA;YACT;AACA,kBAAM,QAAQ,UAAU,IAAI,QAAQ;AACpC,gBAAI,UAAU,WAAW,EAAG,QAAO,MAAM,CAAC,EAAE;AAK5C,kBAAM,aAAa,IAAI,IAAI,SAAS;AACpC,kBAAM,mBAAmB,oBAAI,IAAG;AAChC,qBAASA,KAAI,GAAGA,KAAI,MAAM,QAAQ,EAAEA,IAAG;AACrC,yBAAW,SAAS,MAAMA,EAAC,EAAE,eAAe;AAC1C,oBAAI,CAAC,WAAW,IAAI,MAAM,IAAI,EAAG,kBAAiB,IAAI,MAAM,IAAI;cAClE;YACF;AAGA,kBAAMC,WAAU,CAAA;AAChB,uBAAW,YAAY,kBAAkB;AACvC,kBAAI,YAAY,eAAe;AAC/B,kBAAI,iBAAiB;AACrB,uBAASD,KAAI,GAAGA,KAAI,MAAM,QAAQ,EAAEA,IAAG;AACrC,2BAAW,SAAS,MAAMA,EAAC,EAAE,eAAe;AAC1C,sBAAI,MAAM,SAAS,YAAY,MAAM,QAAQ,WAAW;AACtD,gCAAY,MAAM;AAClB,qCAAiB;kBACnB;gBACF;cACF;AACA,cAAAC,SAAQ,KAAK,cAAc;YAC7B;AACA,mBAAOA;UACT;AAYA,mBAAS,yBAAyB,QAAQ,IAAI;AAC5C,gBAAI,YAAY;AAIhB,gBAAIF,UAAO;AACX,gBAAI,OAAO,KAAK,OAAK,EAAE,aAAa,GAAG;AACrC,oBAAM,YAAY,aAAa,MAAM;AACrC,oBAAM,sBAAsB,OAAO,IAAI,oBAAoB;AAC3D,cAAAA,UAAO,oBAAoB,IAAI,UAAQ,KAAK,IAAI,EAAE,KAAK,GAAG;AAC1D,0BAAY,SAAS,cAAc;AACjC,sBAAM,OAAO,CAAA;AACb,sBAAMO,QAAO,YAAY,UAAU,SAAS,IAAI,UAAU;AAC1D,yBAASN,KAAI,GAAGA,KAAIM,OAAMN,MAAK;AAC7B,uBAAKA,EAAC,IAAI,oBAAoBA,EAAC,EAAE,UAAUA,EAAC,CAAC;gBAC/C;AACA,oBAAI,WAAW;AACb,uBAAKM,KAAI,IAAI,UAAUA,KAAI,EAAE,IAAI,oBAAoBA,KAAI,CAAC;gBAC5D;AACA,uBAAO,GAAG,MAAM,MAAM,IAAI;cAC5B;YACF;AACA,gBAAI,eAAe;AACnB,gBAAI,aAAa,MAAM,GAAG;AACxB,oBAAM,SAAS,OAAO,SAAS;AAC/B,6BAAe,SAAS,uBAAuB;AAC7C,uBAAO,UAAU,MAAM,MAAM,MAAM,WAAW,GAAG,MAAM,EAAE,OAAO,CAAC,MAAM,WAAW,MAAM,CAAC,CAAC,CAAC;cAC7F;YACF;AACA,gBAAIP,QAAM,QAAO,eAAe,cAAc,QAAQ;cACpD,OAAOA;YACb,CAAK;AACD,mBAAO;UACT;AAQA,mBAAS,qBAAqB,OAAO;AACnC,gBAAI,OAAO,OAAO,aAAa;AAC/B,kBAAM,QAAQ,CAAA;AACd,kBAAM,cAAc,CAAA;AACpB,gBAAIA,UAAO;AACX,kBAAM,MAAM,QAAQ,SAAU,MAAM;AAClC,kBAAI,KAAK,YAAY;AACnB,gBAAAA,WAAQ,KAAK,WAAW,OAAO,OAAO,KAAK,WAAW,KAAK;AAC3D,sBAAM,KAAK,SAAS,KAAK,WAAW,IAAI,EAAE,IAAI;AAC9C,4BAAY,KAAK,KAAK,WAAW,OAAO;cAC1C;YACF,CAAC;AACD,gBAAIA,QAAM,CAAAA,UAAOA,QAAK,MAAM,GAAG,EAAE;gBAAO,CAAAA,UAAO;AAG/C,gBAAI,YAAY,CAAAQ,SAAOA;AACvB,oBAAQ,YAAY,QAAM;cACxB,KAAK;AACH;cACF,KAAK;AACH,wBAAQ,MAAM,CAAC;AACf,8BAAc,YAAY,CAAC;AAC3B,4BAAY,SAAS,WAAWA,MAAK;AACnC,sBAAI,MAAMA,IAAG,GAAG;AACd,2BAAO,YAAYA,IAAG;kBACxB;AACA,yBAAOA;gBACT;AACA;cACF,KAAK;AACH,wBAAQ,MAAM,CAAC;AACf,wBAAQ,MAAM,CAAC;AACf,8BAAc,YAAY,CAAC;AAC3B,8BAAc,YAAY,CAAC;AAC3B,4BAAY,SAAS,WAAWA,MAAK;AACnC,sBAAI,MAAMA,IAAG,GAAG;AACd,2BAAO,YAAYA,IAAG;kBACxB;AACA,sBAAI,MAAMA,IAAG,GAAG;AACd,2BAAO,YAAYA,IAAG;kBACxB;AACA,yBAAOA;gBACT;AACA;cACF;AACE,4BAAY,SAAS,WAAWA,MAAK;AACnC,2BAASP,KAAI,GAAGA,KAAI,YAAY,QAAQA,MAAK;AAC3C,wBAAI,MAAMA,EAAC,EAAEO,IAAG,GAAG;AACjB,6BAAO,YAAYP,EAAC,EAAEO,IAAG;oBAC3B;kBACF;AACA,yBAAOA;gBACT;YACR;AACI,mBAAO,eAAe,WAAW,QAAQ;cACvC,OAAOR;YACb,CAAK;AACD,mBAAO;UACT;AAmBA,mBAAS,YAAY,QAAQ;AAC3B,qBAAS,aAAaS,SAAQJ,QAAO,aAAa;AAChD,kBAAIA,SAAQI,QAAO,QAAQ;AACzB,sBAAM,QAAQA,QAAOJ,MAAK;AAC1B,oBAAI,kBAAkB,CAAA;AACtB,oBAAI,MAAM,WAAW;AAGnB,wBAAM,aAAa,MAAM,MAAM,OAAO,WAAW;AACjD,sBAAI,WAAW,SAAS,MAAM,MAAM,QAAQ;AAC1C,oCAAgB,KAAK;sBACnB,OAAO;sBACP,MAAM,QAAQ,WAAW,IAAI,OAAK,EAAE,IAAI,EAAE,KAAK,GAAG;sBAClD,QAAQ,WAAW,KAAK,OAAK,EAAE,KAAK;sBACpC,eAAe;sBACf,WAAW;oBACzB,CAAa;kBACH;AACA,kCAAgB,KAAK,KAAK;gBAC5B,OAAO;AAEL,oCAAkB,MAAM,MAAM,IAAI,SAAU,MAAM;AAChD,2BAAO;sBACL,OAAO,CAAC,IAAI;sBACZ,MAAM,KAAK;sBACX,QAAQ,KAAK;sBACb,eAAe,KAAK;sBACpB,WAAW;oBACzB;kBACU,CAAC;gBACH;AAGA,uBAAO,QAAQ,iBAAiB,SAAU,WAAW;AACnD,yBAAO,aAAaI,SAAQJ,SAAQ,GAAG,YAAY,OAAO,CAAC,SAAS,CAAC,CAAC;gBACxE,CAAC;cACH,OAAO;AAEL,uBAAO,CAAC,WAAW;cACrB;YACF;AACA,mBAAO,aAAa,QAAQ,GAAG,CAAA,CAAE;UACnC;AAQA,mBAAS,YAAY,SAAS,SAAS;AACrC,kBAAM,KAAK,KAAK,IAAI,QAAQ,QAAQ,QAAQ,MAAM;AAClD,qBAASJ,KAAI,GAAGA,KAAI,IAAIA,MAAK;AAC3B,oBAAM,WAAW,kBAAkB,SAASA,EAAC;AAC7C,oBAAM,WAAW,kBAAkB,SAASA,EAAC;AAC7C,kBAAI,UAAU;AACd,kBAAID;AACJ,mBAAKA,WAAQ,UAAU;AACrB,oBAAI,SAAS,IAAIA,OAAI,GAAG;AACtB,4BAAU;AACV;gBACF;cACF;AACA,kBAAI,CAAC,SAAS;AACZ,uBAAO;cACT;YACF;AACA,kBAAM,OAAO,QAAQ;AACrB,kBAAM,OAAO,QAAQ;AACrB,kBAAM,aAAa,aAAa,OAAO;AACvC,kBAAM,aAAa,aAAa,OAAO;AACvC,mBAAO,aAAa,aAAa,SAAS,OAAO,QAAQ,OAAO,aAAa,QAAQ,OAAO,SAAS;UACvG;AAUA,mBAAS,iBAAiB,cAAc;AACtC,mBAAO,aAAa,IAAI,QAAM;AAC5B,kBAAI,cAAc,EAAE,GAAG;AACrB,uBAAO,YAAY,GAAG,YAAY,QAAQ;cAC5C;AACA,kBAAI,UAAU,EAAE,GAAG;AACjB,uBAAO,YAAY,GAAG,QAAQ,YAAY,GAAG,QAAQ,QAAQ;cAC/D;AACA,qBAAO;YACT,CAAC;UACH;AAaA,mBAAS,mBAAmB,YAAY,cAAc,cAAc;AAClE,kBAAM,qBAAqB,CAAA;AAC3B,gBAAI;AACJ,iBAAK,aAAa,YAAY;AAC5B,kBAAI,aAAa,aAAa,SAAS;AACvC,kBAAI,OAAO,eAAe,UAAU;AAClC,sBAAM,IAAI,UAAU,6CAA6C,YAAY,GAAG;cAClF;AACA,2BAAa,aAAa,UAAU;AACpC,kBAAI,OAAO,eAAe,YAAY;AACpC,uBAAO;cACT;AACA,iCAAmB,KAAK,UAAU;YACpC;AACA,mBAAO;UACT;AAaA,mBAAS,kBAAkB,cAAc,cAAcU,OAAM;AAC3D,kBAAM,oBAAoB,iBAAiB,YAAY;AACvD,kBAAM,aAAa,IAAI,MAAM,kBAAkB,MAAM,EAAE,KAAK,KAAK;AACjE,gBAAI,iBAAiB;AACrB,mBAAO,gBAAgB;AACrB,+BAAiB;AACjB,kBAAI,kBAAkB;AACtB,uBAAST,KAAI,GAAGA,KAAI,kBAAkB,QAAQ,EAAEA,IAAG;AACjD,oBAAI,WAAWA,EAAC,EAAG;AACnB,sBAAM,KAAK,kBAAkBA,EAAC;AAC9B,oBAAI,cAAc,EAAE,GAAG;AACrB,oCAAkBA,EAAC,IAAI,GAAG,YAAY,SAASS,KAAI;AAEnD,oCAAkBT,EAAC,EAAE,cAAc,GAAG;AACtC,6BAAWA,EAAC,IAAI;AAChB,oCAAkB;gBACpB,WAAW,UAAU,EAAE,GAAG;AACxB,wBAAM,qBAAqB,mBAAmB,GAAG,QAAQ,YAAY,mBAAmB,YAAY;AACpG,sBAAI,oBAAoB;AACtB,sCAAkBA,EAAC,IAAI,GAAG,QAAQ,SAAS,MAAM,MAAM,kBAAkB;AAEzE,sCAAkBA,EAAC,EAAE,UAAU,GAAG;AAClC,+BAAWA,EAAC,IAAI;AAChB,sCAAkB;kBACpB,OAAO;AACL,qCAAiB;kBACnB;gBACF;cACF;AACA,kBAAI,mBAAmB,gBAAgB;AACrC,sBAAM,IAAI,YAAY,wDAAwD;cAChF;YACF;AACA,mBAAO;UACT;AASA,mBAAS,uBAAuB,eAAe;AAI7C,kBAAM,sBAAsB;AAC5B,mBAAO,KAAK,aAAa,EAAE,QAAQ,eAAa;AAC9C,oBAAM,KAAK,cAAc,SAAS;AAClC,kBAAI,oBAAoB,KAAK,GAAG,SAAQ,CAAE,GAAG;AAC3C,sBAAM,IAAI,YAAY,kIAA4I;cACpK;YACF,CAAC;UACH;AAYA,mBAAS,oBAAoBD,SAAM,kBAAkB;AACnD,YAAAD,OAAM;AACN,gBAAI,OAAO,KAAK,gBAAgB,EAAE,WAAW,GAAG;AAC9C,oBAAM,IAAI,YAAY,wBAAwB;YAChD;AACA,gBAAIA,OAAM,2BAA2B;AACnC,qCAAuB,gBAAgB;YACzC;AAGA,kBAAM,eAAe,CAAA;AACrB,kBAAM,oBAAoB,CAAA;AAC1B,kBAAM,gBAAgB,CAAA;AACtB,kBAAM,wBAAwB,CAAA;AAC9B,gBAAI;AACJ,iBAAK,aAAa,kBAAkB;AAElC,kBAAI,CAAC,OAAO,UAAU,eAAe,KAAK,kBAAkB,SAAS,GAAG;AACtE;cACF;AAEA,oBAAM,SAAS,eAAe,SAAS;AACvC,kBAAI,CAAC,OAAQ;AAEb,2BAAa,QAAQ,SAAU,IAAI;AACjC,oBAAI,YAAY,IAAI,MAAM,GAAG;AAC3B,wBAAM,IAAI,UAAU,6BAA6B,gBAAgB,EAAE,IAAI,YAAY,gBAAgB,MAAM,IAAI,IAAI;gBACnH;cACF,CAAC;AACD,2BAAa,KAAK,MAAM;AAExB,oBAAM,gBAAgB,kBAAkB;AACxC,gCAAkB,KAAK,iBAAiB,SAAS,CAAC;AAClD,oBAAM,mBAAmB,OAAO,IAAI,WAAW;AAE/C,kBAAI;AACJ,mBAAK,MAAM,YAAY,gBAAgB,GAAG;AACxC,sBAAM,SAAS,gBAAgB,EAAE;AACjC,sCAAsB,KAAK;kBACzB,QAAQ;kBACR,MAAM;kBACN,IAAI;gBACd,CAAS;AACD,oBAAI,GAAG,MAAM,OAAK,CAAC,EAAE,aAAa,GAAG;AACnC,gCAAc,MAAM,IAAI;gBAC1B;cACF;YACF;AACA,kCAAsB,KAAK,iBAAiB;AAG5C,kBAAM,oBAAoB,kBAAkB,mBAAmB,eAAe,UAAU;AAGxF,gBAAI;AACJ,iBAAK,KAAK,eAAe;AACvB,kBAAI,OAAO,UAAU,eAAe,KAAK,eAAe,CAAC,GAAG;AAC1D,8BAAc,CAAC,IAAI,kBAAkB,cAAc,CAAC,CAAC;cACvD;YACF;AACA,kBAAM,aAAa,CAAA;AACnB,kBAAM,uBAAuB,oBAAI,IAAG;AACpC,iBAAK,KAAK,uBAAuB;AAI/B,kBAAI,CAAC,qBAAqB,IAAI,EAAE,IAAI,GAAG;AACrC,kBAAE,KAAK,kBAAkB,EAAE,EAAE;AAC7B,2BAAW,KAAK,CAAC;AACjB,qCAAqB,IAAI,EAAE,MAAM,CAAC;cACpC;YACF;AAGA,kBAAM,MAAM,WAAW,CAAC,KAAK,WAAW,CAAC,EAAE,OAAO,UAAU,KAAK,CAAC,aAAa,WAAW,CAAC,EAAE,MAAM;AACnG,kBAAM,MAAM,WAAW,CAAC,KAAK,WAAW,CAAC,EAAE,OAAO,UAAU,KAAK,CAAC,aAAa,WAAW,CAAC,EAAE,MAAM;AACnG,kBAAM,MAAM,WAAW,CAAC,KAAK,WAAW,CAAC,EAAE,OAAO,UAAU,KAAK,CAAC,aAAa,WAAW,CAAC,EAAE,MAAM;AACnG,kBAAM,MAAM,WAAW,CAAC,KAAK,WAAW,CAAC,EAAE,OAAO,UAAU,KAAK,CAAC,aAAa,WAAW,CAAC,EAAE,MAAM;AACnG,kBAAM,MAAM,WAAW,CAAC,KAAK,WAAW,CAAC,EAAE,OAAO,UAAU,KAAK,CAAC,aAAa,WAAW,CAAC,EAAE,MAAM;AACnG,kBAAM,MAAM,WAAW,CAAC,KAAK,WAAW,CAAC,EAAE,OAAO,UAAU,KAAK,CAAC,aAAa,WAAW,CAAC,EAAE,MAAM;AACnG,kBAAM,QAAQ,OAAO,OAAO,OAAO,OAAO,OAAO;AAGjD,qBAASE,KAAI,GAAGA,KAAI,WAAW,QAAQ,EAAEA,IAAG;AAC1C,yBAAWA,EAAC,EAAE,OAAO,aAAa,WAAWA,EAAC,EAAE,MAAM;YACxD;AACA,kBAAM,SAAS,MAAM,YAAY,WAAW,CAAC,EAAE,OAAO,CAAC,CAAC,IAAI;AAC5D,kBAAM,SAAS,MAAM,YAAY,WAAW,CAAC,EAAE,OAAO,CAAC,CAAC,IAAI;AAC5D,kBAAM,SAAS,MAAM,YAAY,WAAW,CAAC,EAAE,OAAO,CAAC,CAAC,IAAI;AAC5D,kBAAM,SAAS,MAAM,YAAY,WAAW,CAAC,EAAE,OAAO,CAAC,CAAC,IAAI;AAC5D,kBAAM,SAAS,MAAM,YAAY,WAAW,CAAC,EAAE,OAAO,CAAC,CAAC,IAAI;AAC5D,kBAAM,SAAS,MAAM,YAAY,WAAW,CAAC,EAAE,OAAO,CAAC,CAAC,IAAI;AAC5D,kBAAM,SAAS,MAAM,YAAY,WAAW,CAAC,EAAE,OAAO,CAAC,CAAC,IAAI;AAC5D,kBAAM,SAAS,MAAM,YAAY,WAAW,CAAC,EAAE,OAAO,CAAC,CAAC,IAAI;AAC5D,kBAAM,SAAS,MAAM,YAAY,WAAW,CAAC,EAAE,OAAO,CAAC,CAAC,IAAI;AAC5D,kBAAM,SAAS,MAAM,YAAY,WAAW,CAAC,EAAE,OAAO,CAAC,CAAC,IAAI;AAC5D,kBAAM,SAAS,MAAM,YAAY,WAAW,CAAC,EAAE,OAAO,CAAC,CAAC,IAAI;AAC5D,kBAAM,SAAS,MAAM,YAAY,WAAW,CAAC,EAAE,OAAO,CAAC,CAAC,IAAI;AAG5D,qBAASA,KAAI,GAAGA,KAAI,WAAW,QAAQ,EAAEA,IAAG;AAC1C,yBAAWA,EAAC,EAAE,iBAAiB,yBAAyB,WAAWA,EAAC,EAAE,QAAQ,WAAWA,EAAC,EAAE,EAAE;YAChG;AACA,kBAAM,MAAM,MAAM,WAAW,CAAC,EAAE,iBAAiB;AACjD,kBAAM,MAAM,MAAM,WAAW,CAAC,EAAE,iBAAiB;AACjD,kBAAM,MAAM,MAAM,WAAW,CAAC,EAAE,iBAAiB;AACjD,kBAAM,MAAM,MAAM,WAAW,CAAC,EAAE,iBAAiB;AACjD,kBAAM,MAAM,MAAM,WAAW,CAAC,EAAE,iBAAiB;AACjD,kBAAM,MAAM,MAAM,WAAW,CAAC,EAAE,iBAAiB;AACjD,kBAAM,OAAO,MAAM,WAAW,CAAC,EAAE,OAAO,SAAS;AACjD,kBAAM,OAAO,MAAM,WAAW,CAAC,EAAE,OAAO,SAAS;AACjD,kBAAM,OAAO,MAAM,WAAW,CAAC,EAAE,OAAO,SAAS;AACjD,kBAAM,OAAO,MAAM,WAAW,CAAC,EAAE,OAAO,SAAS;AACjD,kBAAM,OAAO,MAAM,WAAW,CAAC,EAAE,OAAO,SAAS;AACjD,kBAAM,OAAO,MAAM,WAAW,CAAC,EAAE,OAAO,SAAS;AAGjD,kBAAM,SAAS,QAAQ,IAAI;AAC3B,kBAAM,OAAO,WAAW;AAExB,kBAAM,QAAQ,WAAW,IAAI,CAAAU,OAAKA,GAAE,IAAI;AACxC,kBAAM,MAAM,WAAW,IAAI,CAAAA,OAAKA,GAAE,cAAc;AAChD,kBAAM,UAAU,SAASC,WAAU;AAGjC,uBAASX,KAAI,QAAQA,KAAI,MAAMA,MAAK;AAClC,oBAAI,MAAMA,EAAC,EAAE,SAAS,GAAG;AACvB,yBAAO,IAAIA,EAAC,EAAE,MAAM,MAAM,SAAS;gBACrC;cACF;AACA,qBAAOF,OAAM,WAAWC,SAAM,WAAW,UAAU;YACrD;AAIA,qBAAS,WAAW,MAAM,MAAM;AAG9B,kBAAI,UAAU,WAAW,QAAQ,OAAO,IAAI,KAAK,OAAO,IAAI,GAAG;AAC7D,uBAAO,IAAI,MAAM,MAAM,SAAS;cAClC;AACA,kBAAI,UAAU,WAAW,QAAQ,OAAO,IAAI,KAAK,OAAO,IAAI,GAAG;AAC7D,uBAAO,IAAI,MAAM,MAAM,SAAS;cAClC;AACA,kBAAI,UAAU,WAAW,QAAQ,OAAO,IAAI,KAAK,OAAO,IAAI,GAAG;AAC7D,uBAAO,IAAI,MAAM,MAAM,SAAS;cAClC;AACA,kBAAI,UAAU,WAAW,QAAQ,OAAO,IAAI,KAAK,OAAO,IAAI,GAAG;AAC7D,uBAAO,IAAI,MAAM,MAAM,SAAS;cAClC;AACA,kBAAI,UAAU,WAAW,QAAQ,OAAO,IAAI,KAAK,OAAO,IAAI,GAAG;AAC7D,uBAAO,IAAI,MAAM,MAAM,SAAS;cAClC;AACA,kBAAI,UAAU,WAAW,QAAQ,OAAO,IAAI,KAAK,OAAO,IAAI,GAAG;AAC7D,uBAAO,IAAI,MAAM,MAAM,SAAS;cAClC;AACA,qBAAO,QAAQ,MAAM,MAAM,SAAS;YACtC;AAGA,gBAAI;AACF,qBAAO,eAAe,YAAY,QAAQ;gBACxC,OAAOA;cACf,CAAO;YACH,SAAS,KAAK;YAId;AAKA,uBAAW,aAAa;AAIxB,uBAAW,qBAAqB;cAC9B;cACA,cAAc;YACpB;AACI,mBAAO;UACT;AAQA,mBAAS,YAAYA,SAAM,MAAM,YAAY;AAC3C,kBAAM,YAAYA,SAAM,MAAM,UAAU;UAC1C;AAOA,mBAAS,QAAQ,KAAK;AACpB,mBAAO,MAAM,KAAK,GAAG,IAAI,SAAS,CAAC;UACrC;AAOA,mBAAS,KAAK,KAAK;AACjB,mBAAO,IAAI,IAAI,SAAS,CAAC;UAC3B;AASA,mBAAS,MAAM,KAAKa,QAAO,KAAK;AAC9B,mBAAO,MAAM,UAAU,MAAM,KAAK,KAAKA,QAAO,GAAG;UACnD;AASA,mBAAS,YAAY,KAAK,MAAM;AAC9B,qBAASZ,KAAI,GAAGA,KAAI,IAAI,QAAQA,MAAK;AACnC,kBAAI,KAAK,IAAIA,EAAC,CAAC,GAAG;AAChB,uBAAO,IAAIA,EAAC;cACd;YACF;AACA,mBAAO;UACT;AASA,mBAAS,QAAQ,KAAK,UAAU;AAC9B,mBAAO,MAAM,UAAU,OAAO,MAAM,CAAA,GAAI,IAAI,IAAI,QAAQ,CAAC;UAC3D;AAaA,mBAAS,UAAU;AACjB,kBAAM,aAAa,QAAQ,SAAS,EAAE,IAAI,OAAK,gBAAgB,eAAe,CAAC,CAAC,CAAC;AACjF,kBAAM,WAAW,KAAK,SAAS;AAC/B,gBAAI,OAAO,aAAa,YAAY;AAClC,oBAAM,IAAI,UAAU,6CAA6C;YACnE;AACA,mBAAO,YAAY,YAAY,QAAQ;UACzC;AACA,mBAAS,YAAY,YAAY,UAAU;AACzC,mBAAO;cACL,SAAS;gBACP;gBACA;cACR;YACA;UACE;AAQA,mBAAS,YAAY,UAAU;AAC7B,gBAAI,OAAO,aAAa,YAAY;AAClC,oBAAM,IAAI,UAAU,8CAA8C;YACpE;AACA,mBAAO;cACL,aAAa;gBACX;cACR;YACA;UACE;AASA,mBAAS,UAAU,YAAY;AAC7B,mBAAO,cAAc,OAAO,WAAW,YAAY,YAAY,MAAM,QAAQ,WAAW,QAAQ,UAAU,KAAK,OAAO,WAAW,QAAQ,aAAa;UACxJ;AASA,mBAAS,cAAc,YAAY;AACjC,mBAAO,cAAc,OAAO,WAAW,gBAAgB,YAAY,OAAO,WAAW,YAAY,aAAa;UAChH;AAUA,mBAAS,UAAU,WAAW,SAAS;AACrC,gBAAI,CAAC,WAAW;AACd,qBAAO;YACT;AACA,gBAAI,WAAW,YAAY,WAAW;AACpC,oBAAM,MAAM,IAAI,MAAM,4CAA4C,YAAY,eAAe,UAAU,GAAG;AAC1G,kBAAI,OAAO;gBACT,QAAQ;gBACR,UAAU;cAClB;AACM,oBAAM;YACR;AACA,mBAAO;UACT;AAQA,mBAAS,cAAc,KAAK;AAC1B,gBAAID;AACJ,uBAAW,OAAO,KAAK;AAGrB,kBAAI,OAAO,UAAU,eAAe,KAAK,KAAK,GAAG,MAAM,gBAAgB,IAAI,GAAG,CAAC,KAAK,OAAO,IAAI,GAAG,EAAE,cAAc,WAAW;AAC3H,gBAAAA,UAAO,UAAUA,SAAM,IAAI,GAAG,EAAE,IAAI;cACtC;YACF;AACA,mBAAOA;UACT;AASA,mBAAS,gBAAgB,MAAM,QAAQ;AACrC,gBAAI;AACJ,iBAAK,OAAO,QAAQ;AAClB,kBAAI,OAAO,UAAU,eAAe,KAAK,QAAQ,GAAG,GAAG;AACrD,oBAAI,OAAO,MAAM;AACf,sBAAI,OAAO,GAAG,MAAM,KAAK,GAAG,GAAG;AAC7B,0BAAM,MAAM,IAAI,MAAM,gBAAgB,MAAM,oBAAoB;AAChE,wBAAI,OAAO;sBACT,WAAW;sBACX,gBAAgB,OAAO,GAAG;sBAC1B,cAAc,KAAK,GAAG;oBACpC;AACY,0BAAM;kBACR;gBAEF;AACA,qBAAK,GAAG,IAAI,OAAO,GAAG;cACxB;YACF;UACF;AACA,gBAAM,YAAYD;AAwBlB,UAAAA,SAAQ,SAAU,WAAW;AAC3B,kBAAM,QAAQ,OAAO,cAAc;AACnC,kBAAMc,SAAQ,QAAQ,IAAI;AAC1B,gBAAIb,UAAO,QAAQ,YAAY;AAC/B,kBAAM,gBAAgB,CAAA;AACtB,qBAASC,KAAIY,QAAOZ,KAAI,UAAU,QAAQ,EAAEA,IAAG;AAC7C,oBAAM,OAAO,UAAUA,EAAC;AACxB,kBAAI,kBAAkB,CAAA;AACtB,kBAAI;AACJ,kBAAI,OAAO,SAAS,YAAY;AAC9B,2BAAW,KAAK;AAChB,oBAAI,OAAO,KAAK,cAAc,UAAU;AAEtC,kCAAgB,KAAK,SAAS,IAAI;gBACpC,WAAW,gBAAgB,IAAI,GAAG;AAEhC,oCAAkB,KAAK;gBACzB;cACF,WAAWH,eAAc,IAAI,GAAG;AAE9B,kCAAkB;AAClB,oBAAI,CAAC,OAAO;AACV,6BAAW,cAAc,IAAI;gBAC/B;cACF;AACA,kBAAI,OAAO,KAAK,eAAe,EAAE,WAAW,GAAG;AAC7C,sBAAM,MAAM,IAAI,UAAU,kCAAoCG,KAAI,4FAAiG;AACnK,oBAAI,OAAO;kBACT,OAAOA;kBACP,UAAU;gBACpB;AACQ,sBAAM;cACR;AACA,kBAAI,CAAC,OAAO;AACV,gBAAAD,UAAO,UAAUA,SAAM,QAAQ;cACjC;AACA,8BAAgB,eAAe,eAAe;YAChD;AACA,mBAAO,oBAAoBA,WAAQ,IAAI,aAAa;UACtD;AACA,UAAAD,OAAM,SAAS;AACf,UAAAA,OAAM,cAAc,UAAU;AAC9B,UAAAA,OAAM,aAAa;AACnB,UAAAA,OAAM,qBAAqB;AAC3B,UAAAA,OAAM,cAAc;AACpB,UAAAA,OAAM,QAAQ;AACd,UAAAA,OAAM,mBAAmB;AACzB,UAAAA,OAAM,WAAW;AACjB,UAAAA,OAAM,YAAY;AAClB,UAAAA,OAAM,UAAU;AAChB,UAAAA,OAAM,cAAc;AACpB,UAAAA,OAAM,UAAU;AAChB,UAAAA,OAAM,gBAAgB;AACtB,UAAAA,OAAM,OAAOI;AACb,UAAAJ,OAAM,kBAAkB;AACxB,UAAAA,OAAM,4BAA4B;AAUlC,UAAAA,OAAM,UAAU,SAAU,MAAM,kBAAkB;AAChD,gBAAI,SAAS;AACb,gBAAI,qBAAqB,SAAS,QAAQ,IAAI,QAAQ,GAAG;AACvD,uBAAS;YACX;AACA,YAAAA,OAAM,SAAS,CAAC,IAAI,GAAG,MAAM;UAC/B;AASA,mBAAS,oBAAoB,YAAY;AACvC,gBAAI,CAAC,cAAc,OAAO,WAAW,SAAS,YAAY,OAAO,WAAW,OAAO,YAAY,OAAO,WAAW,YAAY,YAAY;AACvI,oBAAM,IAAI,UAAU,+EAA+E;YACrG;AACA,gBAAI,WAAW,OAAO,WAAW,MAAM;AACrC,oBAAM,IAAI,YAAY,wCAAwC,WAAW,OAAO,cAAc;YAChG;UACF;AAUA,UAAAA,OAAM,gBAAgB,SAAU,YAAY;AAC1C,gBAAI,UAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;cAChF,UAAU;YAChB;AACI,gCAAoB,UAAU;AAC9B,kBAAMe,MAAK,SAAS,WAAW,EAAE;AACjC,kBAAM,WAAWA,IAAG,cAAc,KAAK,WAAS,MAAM,SAAS,WAAW,IAAI;AAC9E,gBAAI,UAAU;AACZ,kBAAI,WAAW,QAAQ,UAAU;AAC/B,gBAAAf,OAAM,iBAAiB;kBACrB,MAAM,SAAS;kBACf,IAAI,WAAW;kBACf,SAAS,SAAS;gBAC5B,CAAS;cACH,OAAO;AACL,sBAAM,IAAI,MAAM,yCAAyC,WAAW,OAAO,WAAWe,IAAG,OAAO,GAAG;cACrG;YACF;AACA,YAAAA,IAAG,cAAc,KAAK;cACpB,MAAM,WAAW;cACjB,IAAIA,IAAG;cACP,SAAS,WAAW;cACpB,OAAO;YACb,CAAK;UACH;AAUA,UAAAf,OAAM,iBAAiB,SAAU,aAAa,SAAS;AACrD,wBAAY,QAAQ,gBAAcA,OAAM,cAAc,YAAY,OAAO,CAAC;UAC5E;AAWA,UAAAA,OAAM,mBAAmB,SAAU,YAAY;AAC7C,gCAAoB,UAAU;AAC9B,kBAAMe,MAAK,SAAS,WAAW,EAAE;AACjC,kBAAM,qBAAqB,YAAYA,IAAG,eAAe,OAAK,EAAE,SAAS,WAAW,IAAI;AACxF,gBAAI,CAAC,oBAAoB;AACvB,oBAAM,IAAI,MAAM,mDAAmD,WAAW,OAAO,SAAS,WAAW,EAAE;YAC7G;AACA,gBAAI,mBAAmB,YAAY,WAAW,SAAS;AACrD,oBAAM,IAAI,MAAM,yDAAyD;YAC3E;AACA,kBAAMT,SAAQS,IAAG,cAAc,QAAQ,kBAAkB;AACzD,YAAAA,IAAG,cAAc,OAAOT,QAAO,CAAC;UAClC;AAYA,UAAAN,OAAM,UAAU,SAAU,IAAI,SAAS;AACrC,gBAAI,CAAC,gBAAgB,EAAE,GAAG;AACxB,oBAAM,IAAI,UAAU,kBAAkB;YACxC;AACA,kBAAM,OAAO,GAAG,mBAAmB;AACnC,qBAASE,KAAI,GAAGA,KAAI,KAAK,QAAQ,EAAEA,IAAG;AACpC,kBAAI,KAAKA,EAAC,EAAE,KAAK,OAAO,GAAG;AACzB,uBAAO,KAAKA,EAAC;cACf;YACF;AACA,mBAAO;UACT;AACA,iBAAOF;QACT;AACA,YAAAgB,iBAAe,OAAM;;;;;;;ACx5DrB;AAAA;AAKA,aAAO,UAAU,SAASC,aAAa,GAAG,GAAG;AAC5C;AACA,YAAIC,MAAK,+EACR,MAAM,kBACN,MAAM,kHACN,MAAM,kBACN,MAAM,MACNC,KAAI,SAAS,GAAG;AAAE,iBAAOF,aAAY,gBAAgB,KAAK,GAAG,YAAY,KAAK,KAAK;AAAA,QAAG,GAEtF,IAAIE,GAAE,CAAC,EAAE,QAAQ,KAAK,EAAE,KAAK,IAC7B,IAAIA,GAAE,CAAC,EAAE,QAAQ,KAAK,EAAE,KAAK,IAE7B,KAAK,EAAE,QAAQD,KAAI,QAAQ,EAAE,QAAQ,OAAM,EAAE,EAAE,QAAQ,OAAM,EAAE,EAAE,MAAM,IAAI,GAC3E,KAAK,EAAE,QAAQA,KAAI,QAAQ,EAAE,QAAQ,OAAM,EAAE,EAAE,QAAQ,OAAM,EAAE,EAAE,MAAM,IAAI,GAE3E,KAAK,SAAS,EAAE,MAAM,GAAG,GAAG,EAAE,KAAM,GAAG,WAAW,KAAK,EAAE,MAAM,GAAG,KAAK,KAAK,MAAM,CAAC,GACnF,KAAK,SAAS,EAAE,MAAM,GAAG,GAAG,EAAE,KAAK,MAAM,EAAE,MAAM,GAAG,KAAK,KAAK,MAAM,CAAC,KAAK,MAC1E,QAAQ;AAET,YAAI,IAAI;AACP,cAAK,KAAK,IAAK;AAAE,mBAAO;AAAA,UAAI,WAClB,KAAK,IAAK;AAAE,mBAAO;AAAA,UAAG;AAAA,QACjC;AAEA,iBAAQ,OAAK,GAAG,OAAK,KAAK,IAAI,GAAG,QAAQ,GAAG,MAAM,GAAG,OAAO,MAAM,QAAQ;AAEzE,mBAAS,EAAE,GAAG,IAAI,KAAK,IAAI,MAAM,GAAG,KAAK,WAAW,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK;AAC7E,mBAAS,EAAE,GAAG,IAAI,KAAK,IAAI,MAAM,GAAG,KAAK,WAAW,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK;AAE7E,cAAI,MAAM,MAAM,MAAM,MAAM,MAAM,GAAG;AAAE,mBAAQ,MAAM,MAAM,IAAK,IAAI;AAAA,UAAI,WAE/D,OAAO,WAAW,OAAO,QAAQ;AACzC,sBAAU;AACV,sBAAU;AAAA,UACX;AACA,cAAI,SAAS,QAAQ;AAAE,mBAAO;AAAA,UAAI;AAClC,cAAI,SAAS,QAAQ;AAAE,mBAAO;AAAA,UAAG;AAAA,QAClC;AACA,eAAO;AAAA,MACR;AAAA;AAAA;;;AC5CA;AAAA;AAAA;AAKA,UAAIE,YAAW,OAAO,UAAU,SAAU,QAAQ;AAAE,iBAASC,KAAI,GAAGA,KAAI,UAAU,QAAQA,MAAK;AAAE,cAAI,SAAS,UAAUA,EAAC;AAAG,mBAAS,OAAO,QAAQ;AAAE,gBAAI,OAAO,UAAU,eAAe,KAAK,QAAQ,GAAG,GAAG;AAAE,qBAAO,GAAG,IAAI,OAAO,GAAG;AAAA,YAAG;AAAA,UAAE;AAAA,QAAE;AAAE,eAAO;AAAA,MAAQ;AAE/P,UAAI,iBAAiB;AAAA,QACnB,KAAK;AAAA,QACL,KAAK;AAAA,QACL,MAAM;AAAA,QACN,KAAK;AAAA,QACL,GAAG;AAAA,QACH,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,GAAG;AAAA,QACH,KAAK;AAAA,MACP;AACA,UAAI,gBAAgB;AAAA,QAClB,UAAU;AAAA,QACV,UAAU;AAAA,QACV,KAAK;AAAA,QACL,KAAM;AAAA,QACN,QAAQ;AAAA,QACR,MAAM;AAAA,MACR;AAEA,UAAI,qBAAqB,SAASC,oBAAmBC,iBAAgBC,gBAAe;AAClF,eAAOJ,UAAS,CAAC,GAAGG,iBAAgBC,cAAa;AAAA,MACnD;AAUA,aAAO,UAAU,SAAU,KAAK;AAC9B,YAAI,OAAO,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAC,GAC5E,wBAAwB,KAAK,oBAC7B,qBAAqB,0BAA0B,SAAY,QAAQ,uBACnE,mBAAmB,KAAK,aACxB,cAAc,qBAAqB,SAAY,qBAAqB;AAExE,YAAI,aAAa,OAAO,GAAG;AAC3B,YAAI,SAAS;AAEb,YAAI,UAAU,YAAYJ,UAAS,CAAC,GAAG,cAAc,GAAG,qBAAqBA,UAAS,CAAC,GAAG,aAAa,IAAI,CAAC,CAAC;AAC7G,YAAI,aAAa,OAAO,KAAK,OAAO;AAMpC,YAAI,QAAQ,SAASK,SAAQ;AAC3B,cAAI,mBAAmB;AACvB,qBAAW,QAAQ,SAAU,KAAKC,QAAO;AACvC,gBAAI,kBAAkB;AACpB;AAAA,YACF;AACA,gBAAI,WAAW,UAAU,IAAI,UAAU,WAAW,MAAM,GAAG,IAAI,MAAM,MAAM,KAAK;AAC9E,wBAAU,QAAQ,WAAWA,MAAK,CAAC;AACnC,2BAAa,WAAW,MAAM,IAAI,QAAQ,WAAW,MAAM;AAC3D,iCAAmB;AAAA,YACrB;AAAA,UACF,CAAC;AACD,cAAI,CAAC,kBAAkB;AACrB,sBAAU,WAAW,MAAM,GAAG,CAAC;AAC/B,yBAAa,WAAW,MAAM,GAAG,WAAW,MAAM;AAAA,UACpD;AAAA,QACF;AAEA,eAAO,YAAY;AACjB,gBAAM;AAAA,QACR;AACA,eAAO;AAAA,MACT;AAAA;AAAA;;;AC/EA;AAAA;AA2BA,OAAC,SAAS,QAAQC,SAAQC,SAAQ;AAElC,iBAAS,KAAK,MAAM;AAClB,cAAI,KAAK,MAAM,OAAO,KAAK;AAE3B,aAAG,OAAO,WAAW;AACnB,gBAAI,IAAI,UAAU,GAAG,KAAK,GAAG,IAAI;AACjC,eAAG,KAAK,GAAG;AACX,eAAG,KAAK,GAAG;AACX,mBAAO,GAAG,KAAK,KAAK,GAAG,IAAI,IAAI;AAAA,UACjC;AAGA,aAAG,IAAI;AACP,aAAG,KAAK,KAAK,GAAG;AAChB,aAAG,KAAK,KAAK,GAAG;AAChB,aAAG,KAAK,KAAK,GAAG;AAChB,aAAG,MAAM,KAAK,IAAI;AAClB,cAAI,GAAG,KAAK,GAAG;AAAE,eAAG,MAAM;AAAA,UAAG;AAC7B,aAAG,MAAM,KAAK,IAAI;AAClB,cAAI,GAAG,KAAK,GAAG;AAAE,eAAG,MAAM;AAAA,UAAG;AAC7B,aAAG,MAAM,KAAK,IAAI;AAClB,cAAI,GAAG,KAAK,GAAG;AAAE,eAAG,MAAM;AAAA,UAAG;AAC7B,iBAAO;AAAA,QACT;AAEA,iBAAS,KAAK,GAAG,GAAG;AAClB,YAAE,IAAI,EAAE;AACR,YAAE,KAAK,EAAE;AACT,YAAE,KAAK,EAAE;AACT,YAAE,KAAK,EAAE;AACT,iBAAO;AAAA,QACT;AAEA,iBAAS,KAAK,MAAM,MAAM;AACxB,cAAI,KAAK,IAAI,KAAK,IAAI,GAClB,QAAQ,QAAQ,KAAK,OACrB,OAAO,GAAG;AACd,eAAK,QAAQ,WAAW;AAAE,mBAAQ,GAAG,KAAK,IAAI,aAAe;AAAA,UAAG;AAChE,eAAK,SAAS,WAAW;AACvB,mBAAO,KAAK,KAAK,KAAK,IAAI,UAAW,KAAK;AAAA,UAC5C;AACA,eAAK,QAAQ;AACb,cAAI,OAAO;AACT,gBAAI,OAAO,SAAU,SAAU,MAAK,OAAO,EAAE;AAC7C,iBAAK,QAAQ,WAAW;AAAE,qBAAO,KAAK,IAAI,CAAC,CAAC;AAAA,YAAG;AAAA,UACjD;AACA,iBAAO;AAAA,QACT;AAEA,iBAAS,OAAO;AACd,cAAI,IAAI;AAER,cAAI,OAAO,SAAS,MAAM;AACxB,mBAAO,OAAO,IAAI;AAClB,qBAASC,KAAI,GAAGA,KAAI,KAAK,QAAQA,MAAK;AACpC,mBAAK,KAAK,WAAWA,EAAC;AACtB,kBAAI,IAAI,sBAAsB;AAC9B,kBAAI,MAAM;AACV,mBAAK;AACL,mBAAK;AACL,kBAAI,MAAM;AACV,mBAAK;AACL,mBAAK,IAAI;AAAA,YACX;AACA,oBAAQ,MAAM,KAAK;AAAA,UACrB;AAEA,iBAAO;AAAA,QACT;AAGA,YAAIF,WAAUA,QAAO,SAAS;AAC5B,UAAAA,QAAO,UAAU;AAAA,QACnB,WAAWC,WAAUA,QAAO,KAAK;AAC/B,UAAAA,QAAO,WAAW;AAAE,mBAAO;AAAA,UAAM,CAAC;AAAA,QACpC,OAAO;AACL,eAAK,OAAO;AAAA,QACd;AAAA,MAEA;AAAA,QACE;AAAA,QACC,OAAO,UAAW,YAAY;AAAA;AAAA,QAC9B,OAAO,UAAW,cAAc;AAAA;AAAA,MACnC;AAAA;AAAA;;;AC/GA;AAAA;AAGA,OAAC,SAAS,QAAQE,SAAQC,SAAQ;AAElC,iBAAS,OAAO,MAAM;AACpB,cAAI,KAAK,MAAM,UAAU;AAEzB,aAAG,IAAI;AACP,aAAG,IAAI;AACP,aAAG,IAAI;AACP,aAAG,IAAI;AAGP,aAAG,OAAO,WAAW;AACnB,gBAAI,IAAI,GAAG,IAAK,GAAG,KAAK;AACxB,eAAG,IAAI,GAAG;AACV,eAAG,IAAI,GAAG;AACV,eAAG,IAAI,GAAG;AACV,mBAAO,GAAG,KAAM,GAAG,MAAM,KAAM,IAAK,MAAM;AAAA,UAC5C;AAEA,cAAI,UAAU,OAAO,IAAI;AAEvB,eAAG,IAAI;AAAA,UACT,OAAO;AAEL,uBAAW;AAAA,UACb;AAGA,mBAAS,IAAI,GAAG,IAAI,QAAQ,SAAS,IAAI,KAAK;AAC5C,eAAG,KAAK,QAAQ,WAAW,CAAC,IAAI;AAChC,eAAG,KAAK;AAAA,UACV;AAAA,QACF;AAEA,iBAAS,KAAK,GAAG,GAAG;AAClB,YAAE,IAAI,EAAE;AACR,YAAE,IAAI,EAAE;AACR,YAAE,IAAI,EAAE;AACR,YAAE,IAAI,EAAE;AACR,iBAAO;AAAA,QACT;AAEA,iBAAS,KAAK,MAAM,MAAM;AACxB,cAAI,KAAK,IAAI,OAAO,IAAI,GACpB,QAAQ,QAAQ,KAAK,OACrB,OAAO,WAAW;AAAE,oBAAQ,GAAG,KAAK,MAAM,KAAK;AAAA,UAAa;AAChE,eAAK,SAAS,WAAW;AACvB,eAAG;AACD,kBAAI,MAAM,GAAG,KAAK,MAAM,IACpB,OAAO,GAAG,KAAK,MAAM,KAAK,YAC1B,UAAU,MAAM,QAAQ,KAAK;AAAA,YACnC,SAAS,WAAW;AACpB,mBAAO;AAAA,UACT;AACA,eAAK,QAAQ,GAAG;AAChB,eAAK,QAAQ;AACb,cAAI,OAAO;AACT,gBAAI,OAAO,SAAU,SAAU,MAAK,OAAO,EAAE;AAC7C,iBAAK,QAAQ,WAAW;AAAE,qBAAO,KAAK,IAAI,CAAC,CAAC;AAAA,YAAG;AAAA,UACjD;AACA,iBAAO;AAAA,QACT;AAEA,YAAID,WAAUA,QAAO,SAAS;AAC5B,UAAAA,QAAO,UAAU;AAAA,QACnB,WAAWC,WAAUA,QAAO,KAAK;AAC/B,UAAAA,QAAO,WAAW;AAAE,mBAAO;AAAA,UAAM,CAAC;AAAA,QACpC,OAAO;AACL,eAAK,SAAS;AAAA,QAChB;AAAA,MAEA;AAAA,QACE;AAAA,QACC,OAAO,UAAW,YAAY;AAAA;AAAA,QAC9B,OAAO,UAAW,cAAc;AAAA;AAAA,MACnC;AAAA;AAAA;;;AC9EA;AAAA;AAGA,OAAC,SAAS,QAAQC,SAAQC,SAAQ;AAElC,iBAAS,OAAO,MAAM;AACpB,cAAI,KAAK,MAAM,UAAU;AAGzB,aAAG,OAAO,WAAW;AACnB,gBAAI,IAAK,GAAG,IAAK,GAAG,MAAM;AAC1B,eAAG,IAAI,GAAG;AAAG,eAAG,IAAI,GAAG;AAAG,eAAG,IAAI,GAAG;AAAG,eAAG,IAAI,GAAG;AACjD,oBAAQ,GAAG,IAAK,GAAG,IAAI,SAAS,MAC5B,GAAG,IAAK,GAAG,IAAK,GAAG,KAAK,KAAO,IAAK,KAAK,MAAO;AAAA,UACtD;AAEA,aAAG,IAAI;AACP,aAAG,IAAI;AACP,aAAG,IAAI;AACP,aAAG,IAAI;AACP,aAAG,IAAI;AAEP,cAAI,UAAU,OAAO,IAAI;AAEvB,eAAG,IAAI;AAAA,UACT,OAAO;AAEL,uBAAW;AAAA,UACb;AAGA,mBAAS,IAAI,GAAG,IAAI,QAAQ,SAAS,IAAI,KAAK;AAC5C,eAAG,KAAK,QAAQ,WAAW,CAAC,IAAI;AAChC,gBAAI,KAAK,QAAQ,QAAQ;AACvB,iBAAG,IAAI,GAAG,KAAK,KAAK,GAAG,MAAM;AAAA,YAC/B;AACA,eAAG,KAAK;AAAA,UACV;AAAA,QACF;AAEA,iBAAS,KAAK,GAAG,GAAG;AAClB,YAAE,IAAI,EAAE;AACR,YAAE,IAAI,EAAE;AACR,YAAE,IAAI,EAAE;AACR,YAAE,IAAI,EAAE;AACR,YAAE,IAAI,EAAE;AACR,YAAE,IAAI,EAAE;AACR,iBAAO;AAAA,QACT;AAEA,iBAAS,KAAK,MAAM,MAAM;AACxB,cAAI,KAAK,IAAI,OAAO,IAAI,GACpB,QAAQ,QAAQ,KAAK,OACrB,OAAO,WAAW;AAAE,oBAAQ,GAAG,KAAK,MAAM,KAAK;AAAA,UAAa;AAChE,eAAK,SAAS,WAAW;AACvB,eAAG;AACD,kBAAI,MAAM,GAAG,KAAK,MAAM,IACpB,OAAO,GAAG,KAAK,MAAM,KAAK,YAC1B,UAAU,MAAM,QAAQ,KAAK;AAAA,YACnC,SAAS,WAAW;AACpB,mBAAO;AAAA,UACT;AACA,eAAK,QAAQ,GAAG;AAChB,eAAK,QAAQ;AACb,cAAI,OAAO;AACT,gBAAI,OAAO,SAAU,SAAU,MAAK,OAAO,EAAE;AAC7C,iBAAK,QAAQ,WAAW;AAAE,qBAAO,KAAK,IAAI,CAAC,CAAC;AAAA,YAAG;AAAA,UACjD;AACA,iBAAO;AAAA,QACT;AAEA,YAAID,WAAUA,QAAO,SAAS;AAC5B,UAAAA,QAAO,UAAU;AAAA,QACnB,WAAWC,WAAUA,QAAO,KAAK;AAC/B,UAAAA,QAAO,WAAW;AAAE,mBAAO;AAAA,UAAM,CAAC;AAAA,QACpC,OAAO;AACL,eAAK,SAAS;AAAA,QAChB;AAAA,MAEA;AAAA,QACE;AAAA,QACC,OAAO,UAAW,YAAY;AAAA;AAAA,QAC9B,OAAO,UAAW,cAAc;AAAA;AAAA,MACnC;AAAA;AAAA;;;ACnFA;AAAA;AAKA,OAAC,SAAS,QAAQC,SAAQC,SAAQ;AAElC,iBAAS,OAAO,MAAM;AACpB,cAAI,KAAK;AAGT,aAAG,OAAO,WAAW;AAEnB,gBAAI,IAAI,GAAG,GAAGC,KAAI,GAAG,GAAG,GAAG,GAAG;AAC9B,gBAAI,EAAEA,EAAC;AAAG,iBAAM,MAAM;AAAI,gBAAI,IAAK,KAAK;AACxC,gBAAI,EAAGA,KAAI,IAAK,CAAC;AAAG,iBAAK,IAAK,MAAM;AACpC,gBAAI,EAAGA,KAAI,IAAK,CAAC;AAAG,iBAAK,IAAK,MAAM;AACpC,gBAAI,EAAGA,KAAI,IAAK,CAAC;AAAG,iBAAK,IAAK,KAAK;AACnC,gBAAI,EAAGA,KAAI,IAAK,CAAC;AAAG,gBAAI,IAAK,KAAK;AAAK,iBAAK,IAAK,KAAK;AACtD,cAAEA,EAAC,IAAI;AACP,eAAG,IAAKA,KAAI,IAAK;AACjB,mBAAO;AAAA,UACT;AAEA,mBAAS,KAAKC,KAAIC,OAAM;AACtB,gBAAI,GAAG,GAAG,IAAI,CAAC;AAEf,gBAAIA,WAAUA,QAAO,IAAI;AAEvB,kBAAI,EAAE,CAAC,IAAIA;AAAA,YACb,OAAO;AAEL,cAAAA,QAAO,KAAKA;AACZ,mBAAK,IAAI,GAAG,IAAIA,MAAK,QAAQ,EAAE,GAAG;AAChC,kBAAE,IAAI,CAAC,IAAK,EAAE,IAAI,CAAC,KAAK,KACnBA,MAAK,WAAW,CAAC,IAAI,EAAG,IAAI,IAAK,CAAC,KAAK;AAAA,cAC9C;AAAA,YACF;AAEA,mBAAO,EAAE,SAAS,EAAG,GAAE,KAAK,CAAC;AAC7B,iBAAK,IAAI,GAAG,IAAI,KAAK,EAAE,CAAC,MAAM,GAAG,EAAE,EAAE;AACrC,gBAAI,KAAK,EAAG,KAAI,EAAE,CAAC,IAAI;AAAA,gBAAS,KAAI,EAAE,CAAC;AAEvC,YAAAD,IAAG,IAAI;AACP,YAAAA,IAAG,IAAI;AAGP,iBAAK,IAAI,KAAK,IAAI,GAAG,EAAE,GAAG;AACxB,cAAAA,IAAG,KAAK;AAAA,YACV;AAAA,UACF;AAEA,eAAK,IAAI,IAAI;AAAA,QACf;AAEA,iBAAS,KAAK,GAAG,GAAG;AAClB,YAAE,IAAI,EAAE,EAAE,MAAM;AAChB,YAAE,IAAI,EAAE;AACR,iBAAO;AAAA,QACT;AAEA,iBAAS,KAAK,MAAM,MAAM;AACxB,cAAI,QAAQ,KAAM,QAAO,CAAE,oBAAI;AAC/B,cAAI,KAAK,IAAI,OAAO,IAAI,GACpB,QAAQ,QAAQ,KAAK,OACrB,OAAO,WAAW;AAAE,oBAAQ,GAAG,KAAK,MAAM,KAAK;AAAA,UAAa;AAChE,eAAK,SAAS,WAAW;AACvB,eAAG;AACD,kBAAI,MAAM,GAAG,KAAK,MAAM,IACpB,OAAO,GAAG,KAAK,MAAM,KAAK,YAC1B,UAAU,MAAM,QAAQ,KAAK;AAAA,YACnC,SAAS,WAAW;AACpB,mBAAO;AAAA,UACT;AACA,eAAK,QAAQ,GAAG;AAChB,eAAK,QAAQ;AACb,cAAI,OAAO;AACT,gBAAI,MAAM,EAAG,MAAK,OAAO,EAAE;AAC3B,iBAAK,QAAQ,WAAW;AAAE,qBAAO,KAAK,IAAI,CAAC,CAAC;AAAA,YAAG;AAAA,UACjD;AACA,iBAAO;AAAA,QACT;AAEA,YAAIH,WAAUA,QAAO,SAAS;AAC5B,UAAAA,QAAO,UAAU;AAAA,QACnB,WAAWC,WAAUA,QAAO,KAAK;AAC/B,UAAAA,QAAO,WAAW;AAAE,mBAAO;AAAA,UAAM,CAAC;AAAA,QACpC,OAAO;AACL,eAAK,YAAY;AAAA,QACnB;AAAA,MAEA;AAAA,QACE;AAAA,QACC,OAAO,UAAW,YAAY;AAAA;AAAA,QAC9B,OAAO,UAAW,cAAc;AAAA;AAAA,MACnC;AAAA;AAAA;;;AC/FA;AAAA;AAyBA,OAAC,SAAS,QAAQI,SAAQC,SAAQ;AAElC,iBAAS,OAAO,MAAM;AACpB,cAAI,KAAK;AAGT,aAAG,OAAO,WAAW;AACnB,gBAAI,IAAI,GAAG,GACP,IAAI,GAAG,GAAGC,KAAI,GAAG,GAAG,GAAG;AAE3B,eAAG,IAAI,IAAK,IAAI,aAAc;AAE9B,gBAAI,EAAGA,KAAI,KAAM,GAAG;AACpB,gBAAI,EAAEA,KAAMA,KAAI,IAAK,GAAI;AACzB,iBAAK,KAAK;AACV,iBAAK,KAAK;AACV,iBAAK,MAAM;AACX,iBAAK,MAAM;AAEX,gBAAI,EAAEA,EAAC,IAAI,IAAI;AACf,eAAG,IAAIA;AAEP,mBAAQ,KAAK,IAAK,MAAM,MAAQ;AAAA,UAClC;AAEA,mBAAS,KAAKC,KAAIC,OAAM;AACtB,gBAAI,GAAG,GAAGF,IAAG,GAAG,GAAG,IAAI,CAAC,GAAG,QAAQ;AACnC,gBAAIE,WAAUA,QAAO,IAAI;AAEvB,kBAAIA;AACJ,cAAAA,QAAO;AAAA,YACT,OAAO;AAEL,cAAAA,QAAOA,QAAO;AACd,kBAAI;AACJ,sBAAQ,KAAK,IAAI,OAAOA,MAAK,MAAM;AAAA,YACrC;AAEA,iBAAKF,KAAI,GAAG,IAAI,KAAK,IAAI,OAAO,EAAE,GAAG;AAEnC,kBAAIE,MAAM,MAAKA,MAAK,YAAY,IAAI,MAAMA,MAAK,MAAM;AAErD,kBAAI,MAAM,EAAG,KAAI;AACjB,mBAAK,KAAK;AACV,mBAAK,MAAM;AACX,mBAAK,KAAK;AACV,mBAAK,MAAM;AACX,kBAAI,KAAK,GAAG;AACV,oBAAK,IAAI,aAAc;AACvB,oBAAK,EAAE,IAAI,GAAG,KAAM,IAAI;AACxB,gBAAAF,KAAK,KAAK,IAAKA,KAAI,IAAI;AAAA,cACzB;AAAA,YACF;AAEA,gBAAIA,MAAK,KAAK;AACZ,iBAAGE,SAAQA,MAAK,UAAU,KAAK,GAAG,IAAI;AAAA,YACxC;AAIA,YAAAF,KAAI;AACJ,iBAAK,IAAI,IAAI,KAAK,IAAI,GAAG,EAAE,GAAG;AAC5B,kBAAI,EAAGA,KAAI,KAAM,GAAG;AACpB,kBAAI,EAAEA,KAAMA,KAAI,IAAK,GAAI;AACzB,mBAAK,KAAK;AACV,mBAAK,KAAK;AACV,mBAAK,MAAM;AACX,mBAAK,MAAM;AACX,gBAAEA,EAAC,IAAI,IAAI;AAAA,YACb;AAEA,YAAAC,IAAG,IAAI;AACP,YAAAA,IAAG,IAAI;AACP,YAAAA,IAAG,IAAID;AAAA,UACT;AAEA,eAAK,IAAI,IAAI;AAAA,QACf;AAEA,iBAAS,KAAK,GAAG,GAAG;AAClB,YAAE,IAAI,EAAE;AACR,YAAE,IAAI,EAAE;AACR,YAAE,IAAI,EAAE,EAAE,MAAM;AAChB,iBAAO;AAAA,QACT;AAAC;AAED,iBAAS,KAAK,MAAM,MAAM;AACxB,cAAI,QAAQ,KAAM,QAAO,CAAE,oBAAI;AAC/B,cAAI,KAAK,IAAI,OAAO,IAAI,GACpB,QAAQ,QAAQ,KAAK,OACrB,OAAO,WAAW;AAAE,oBAAQ,GAAG,KAAK,MAAM,KAAK;AAAA,UAAa;AAChE,eAAK,SAAS,WAAW;AACvB,eAAG;AACD,kBAAI,MAAM,GAAG,KAAK,MAAM,IACpB,OAAO,GAAG,KAAK,MAAM,KAAK,YAC1B,UAAU,MAAM,QAAQ,KAAK;AAAA,YACnC,SAAS,WAAW;AACpB,mBAAO;AAAA,UACT;AACA,eAAK,QAAQ,GAAG;AAChB,eAAK,QAAQ;AACb,cAAI,OAAO;AACT,gBAAI,MAAM,EAAG,MAAK,OAAO,EAAE;AAC3B,iBAAK,QAAQ,WAAW;AAAE,qBAAO,KAAK,IAAI,CAAC,CAAC;AAAA,YAAG;AAAA,UACjD;AACA,iBAAO;AAAA,QACT;AAEA,YAAIF,WAAUA,QAAO,SAAS;AAC5B,UAAAA,QAAO,UAAU;AAAA,QACnB,WAAWC,WAAUA,QAAO,KAAK;AAC/B,UAAAA,QAAO,WAAW;AAAE,mBAAO;AAAA,UAAM,CAAC;AAAA,QACpC,OAAO;AACL,eAAK,UAAU;AAAA,QACjB;AAAA,MAEA;AAAA,QACE;AAAA;AAAA,QACC,OAAO,UAAW,YAAY;AAAA;AAAA,QAC9B,OAAO,UAAW,cAAc;AAAA;AAAA,MACnC;AAAA;AAAA;;;ACjJA;AAAA;AAIA,OAAC,SAAS,QAAQI,SAAQC,SAAQ;AAElC,iBAAS,OAAO,MAAM;AACpB,cAAI,KAAK,MAAM,UAAU;AAGzB,aAAG,OAAO,WAAW;AACnB,gBAAI,IAAI,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG;AACzC,gBAAK,KAAK,KAAO,MAAM,IAAK;AAC5B,gBAAK,IAAI,IAAK;AACd,gBAAK,KAAK,KAAO,MAAM,IAAK;AAC5B,gBAAK,IAAI,IAAK;AACd,eAAG,IAAI,IAAK,KAAK,KAAO,MAAM,KAAM;AACpC,eAAG,IAAI,IAAK,IAAI,IAAK;AACrB,eAAG,IAAK,KAAK,KAAO,MAAM,KAAM;AAChC,mBAAO,GAAG,IAAK,IAAI,IAAK;AAAA,UAC1B;AAkBA,aAAG,IAAI;AACP,aAAG,IAAI;AACP,aAAG,IAAI,aAAa;AACpB,aAAG,IAAI;AAEP,cAAI,SAAS,KAAK,MAAM,IAAI,GAAG;AAE7B,eAAG,IAAK,OAAO,aAAe;AAC9B,eAAG,IAAI,OAAO;AAAA,UAChB,OAAO;AAEL,uBAAW;AAAA,UACb;AAGA,mBAAS,IAAI,GAAG,IAAI,QAAQ,SAAS,IAAI,KAAK;AAC5C,eAAG,KAAK,QAAQ,WAAW,CAAC,IAAI;AAChC,eAAG,KAAK;AAAA,UACV;AAAA,QACF;AAEA,iBAAS,KAAK,GAAG,GAAG;AAClB,YAAE,IAAI,EAAE;AACR,YAAE,IAAI,EAAE;AACR,YAAE,IAAI,EAAE;AACR,YAAE,IAAI,EAAE;AACR,iBAAO;AAAA,QACT;AAAC;AAED,iBAAS,KAAK,MAAM,MAAM;AACxB,cAAI,KAAK,IAAI,OAAO,IAAI,GACpB,QAAQ,QAAQ,KAAK,OACrB,OAAO,WAAW;AAAE,oBAAQ,GAAG,KAAK,MAAM,KAAK;AAAA,UAAa;AAChE,eAAK,SAAS,WAAW;AACvB,eAAG;AACD,kBAAI,MAAM,GAAG,KAAK,MAAM,IACpB,OAAO,GAAG,KAAK,MAAM,KAAK,YAC1B,UAAU,MAAM,QAAQ,KAAK;AAAA,YACnC,SAAS,WAAW;AACpB,mBAAO;AAAA,UACT;AACA,eAAK,QAAQ,GAAG;AAChB,eAAK,QAAQ;AACb,cAAI,OAAO;AACT,gBAAI,OAAO,SAAU,SAAU,MAAK,OAAO,EAAE;AAC7C,iBAAK,QAAQ,WAAW;AAAE,qBAAO,KAAK,IAAI,CAAC,CAAC;AAAA,YAAG;AAAA,UACjD;AACA,iBAAO;AAAA,QACT;AAEA,YAAID,WAAUA,QAAO,SAAS;AAC5B,UAAAA,QAAO,UAAU;AAAA,QACnB,WAAWC,WAAUA,QAAO,KAAK;AAC/B,UAAAA,QAAO,WAAW;AAAE,mBAAO;AAAA,UAAM,CAAC;AAAA,QACpC,OAAO;AACL,eAAK,SAAS;AAAA,QAChB;AAAA,MAEA;AAAA,QACE;AAAA,QACC,OAAO,UAAW,YAAY;AAAA;AAAA,QAC9B,OAAO,UAAW,cAAc;AAAA;AAAA,MACnC;AAAA;AAAA;;;;;;;;;ACpGA;AAAA;AAwBA,OAAC,SAAU,QAAQ,MAAMC,OAAM;AAK/B,YAAI,QAAQ,KACR,SAAS,GACTC,UAAS,IACT,UAAU,UACV,aAAaD,MAAK,IAAI,OAAO,MAAM,GACnC,eAAeA,MAAK,IAAI,GAAGC,OAAM,GACjC,WAAW,eAAe,GAC1B,OAAO,QAAQ,GACf;AAMJ,iBAASC,YAAW,MAAM,SAAS,UAAU;AAC3C,cAAI,MAAM,CAAC;AACX,oBAAW,WAAW,OAAQ,EAAE,SAAS,KAAK,IAAK,WAAW,CAAC;AAG/D,cAAI,YAAY,OAAOC;AAAA,YACrB,QAAQ,UAAU,CAAC,MAAM,SAAS,IAAI,CAAC,IACtC,QAAQ,OAAQ,SAAS,IAAI;AAAA,YAAM;AAAA,UAAC,GAAG,GAAG;AAG7C,cAAI,OAAO,IAAI,KAAK,GAAG;AAIvB,cAAI,OAAO,WAAW;AACpB,gBAAI,IAAI,KAAK,EAAE,MAAM,GACjB,IAAI,YACJ,IAAI;AACR,mBAAO,IAAI,cAAc;AACvB,mBAAK,IAAI,KAAK;AACd,mBAAK;AACL,kBAAI,KAAK,EAAE,CAAC;AAAA,YACd;AACA,mBAAO,KAAK,UAAU;AACpB,mBAAK;AACL,mBAAK;AACL,qBAAO;AAAA,YACT;AACA,oBAAQ,IAAI,KAAK;AAAA,UACnB;AAEA,eAAK,QAAQ,WAAW;AAAE,mBAAO,KAAK,EAAE,CAAC,IAAI;AAAA,UAAG;AAChD,eAAK,QAAQ,WAAW;AAAE,mBAAO,KAAK,EAAE,CAAC,IAAI;AAAA,UAAa;AAC1D,eAAK,SAAS;AAGd,iBAAO,SAAS,KAAK,CAAC,GAAG,IAAI;AAG7B,kBAAQ,QAAQ,QAAQ,YACpB,SAASC,OAAMC,OAAM,cAAc,OAAO;AACxC,gBAAI,OAAO;AAET,kBAAI,MAAM,GAAG;AAAE,qBAAK,OAAO,IAAI;AAAA,cAAG;AAElC,cAAAD,MAAK,QAAQ,WAAW;AAAE,uBAAO,KAAK,MAAM,CAAC,CAAC;AAAA,cAAG;AAAA,YACnD;AAIA,gBAAI,cAAc;AAAE,cAAAJ,MAAK,OAAO,IAAII;AAAM,qBAAOC;AAAA,YAAM,MAIlD,QAAOD;AAAA,UACd;AAAA,YACJ;AAAA,YACA;AAAA,YACA,YAAY,UAAU,QAAQ,SAAU,QAAQJ;AAAA,YAChD,QAAQ;AAAA,UAAK;AAAA,QACf;AAYA,iBAAS,KAAK,KAAK;AACjB,cAAI,GAAG,SAAS,IAAI,QAChB,KAAK,MAAMM,KAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC;AAGvD,cAAI,CAAC,QAAQ;AAAE,kBAAM,CAAC,QAAQ;AAAA,UAAG;AAGjC,iBAAOA,KAAI,OAAO;AAChB,cAAEA,EAAC,IAAIA;AAAA,UACT;AACA,eAAKA,KAAI,GAAGA,KAAI,OAAOA,MAAK;AAC1B,cAAEA,EAAC,IAAI,EAAE,IAAI,OAAQ,IAAI,IAAIA,KAAI,MAAM,KAAK,IAAI,EAAEA,EAAC,EAAG;AACtD,cAAE,CAAC,IAAI;AAAA,UACT;AAGA,WAAC,GAAG,IAAI,SAASC,QAAO;AAEtB,gBAAIC,IAAG,IAAI,GACPF,KAAI,GAAG,GAAGG,KAAI,GAAG,GAAGC,KAAI,GAAG;AAC/B,mBAAOH,UAAS;AACd,cAAAC,KAAIE,GAAEJ,KAAI,OAAQA,KAAI,CAAE;AACxB,kBAAI,IAAI,QAAQI,GAAE,QAASA,GAAEJ,EAAC,IAAII,GAAED,KAAI,OAAQA,KAAID,EAAE,MAAME,GAAED,EAAC,IAAID,GAAG;AAAA,YACxE;AACA,eAAG,IAAIF;AAAG,eAAG,IAAIG;AACjB,mBAAO;AAAA,UAIT,GAAG,KAAK;AAAA,QACV;AAMA,iBAAS,KAAK,GAAG,GAAG;AAClB,YAAE,IAAI,EAAE;AACR,YAAE,IAAI,EAAE;AACR,YAAE,IAAI,EAAE,EAAE,MAAM;AAChB,iBAAO;AAAA,QACT;AAAC;AAMD,iBAASN,SAAQ,KAAK,OAAO;AAC3B,cAAI,SAAS,CAAC,GAAG,MAAO,OAAO,KAAM;AACrC,cAAI,SAAS,OAAO,UAAU;AAC5B,iBAAK,QAAQ,KAAK;AAChB,kBAAI;AAAE,uBAAO,KAAKA,SAAQ,IAAI,IAAI,GAAG,QAAQ,CAAC,CAAC;AAAA,cAAG,SAASQ,IAAG;AAAA,cAAC;AAAA,YACjE;AAAA,UACF;AACA,iBAAQ,OAAO,SAAS,SAAS,OAAO,WAAW,MAAM,MAAM;AAAA,QACjE;AAOA,iBAAS,OAAO,MAAM,KAAK;AACzB,cAAI,aAAa,OAAO,IAAI,OAAO,IAAI;AACvC,iBAAO,IAAI,WAAW,QAAQ;AAC5B,gBAAI,OAAO,CAAC,IACV,QAAS,SAAS,IAAI,OAAO,CAAC,IAAI,MAAM,WAAW,WAAW,GAAG;AAAA,UACrE;AACA,iBAAO,SAAS,GAAG;AAAA,QACrB;AAOA,iBAAS,WAAW;AAClB,cAAI;AACF,gBAAI;AACJ,gBAAI,eAAe,MAAM,WAAW,cAAc;AAEhD,oBAAM,IAAI,KAAK;AAAA,YACjB,OAAO;AACL,oBAAM,IAAI,WAAW,KAAK;AAC1B,eAAC,OAAO,UAAU,OAAO,UAAU,gBAAgB,GAAG;AAAA,YACxD;AACA,mBAAO,SAAS,GAAG;AAAA,UACrB,SAASA,IAAG;AACV,gBAAI,UAAU,OAAO,WACjBC,WAAU,WAAW,QAAQ;AACjC,mBAAO,CAAC,CAAC,oBAAI,QAAM,QAAQA,UAAS,OAAO,QAAQ,SAAS,IAAI,CAAC;AAAA,UACnE;AAAA,QACF;AAMA,iBAAS,SAAS,GAAG;AACnB,iBAAO,OAAO,aAAa,MAAM,GAAG,CAAC;AAAA,QACvC;AASA,eAAOZ,MAAK,OAAO,GAAG,IAAI;AAM1B,YAAK,OAAO,UAAW,YAAY,OAAO,SAAS;AACjD,iBAAO,UAAUE;AAEjB,cAAI;AACF,yBAAa;AAAA,UACf,SAAS,IAAI;AAAA,UAAC;AAAA,QAChB,WAAY,OAAO,UAAW,cAAc,OAAO,KAAK;AACtD,iBAAO,WAAW;AAAE,mBAAOA;AAAA,UAAY,CAAC;AAAA,QAC1C,OAAO;AAEL,UAAAF,MAAK,SAAS,OAAO,IAAIE;AAAA,QAC3B;AAAA,MAIA;AAAA;AAAA;AAAA,QAGG,OAAO,SAAS,cAAe,OAAO;AAAA,QACvC,CAAC;AAAA;AAAA,QACD;AAAA;AAAA,MACF;AAAA;AAAA;;;AC5PA,MAAAW,sBAAA;AAAA;AAYA,UAAI,OAAO;AAKX,UAAI,SAAS;AAKb,UAAI,SAAS;AAQb,UAAI,YAAY;AAShB,UAAI,UAAU;AAOd,UAAI,SAAS;AAIb,UAAI,KAAK;AAET,SAAG,OAAO;AACV,SAAG,SAAS;AACZ,SAAG,SAAS;AACZ,SAAG,YAAY;AACf,SAAG,UAAU;AACb,SAAG,SAAS;AAEZ,aAAO,UAAU;AAAA;AAAA;;;AC3DjB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AA4BA,GAAC,SAAU,WAAW;AACpB,QAAI,OAAO,UAAU,iBAAiB,WAAY;AAElD,cAAU,gBAAgB,SAAUC,YAAW;AAC7C,UAAIA,YAAW;AACb,0BAAkBA,YAAW,IAAI;AACjC,QAAAA,WAAU,MAAM;AAAA,MAClB,OAAO;AACL,QAAAA,aAAY,SAAS,cAAc,OAAO;AAC1C,QAAAA,WAAU,OAAO;AACjB,QAAAA,WAAU,SAAS;AACnB,aAAK,YAAYA,UAAS;AAC1B,QAAAA,WAAU,MAAM;AAChB,aAAK,YAAYA,UAAS;AAAA,MAC5B;AAAA,IACF;AAEA,aAAS,kBAAkBA,YAAW,MAAM;AAC1C,MAAAA,sBAAqB,eAAe,MAAM,WAAW,0CAA0C;AAC/F,MAAAA,WAAU,QAAQ,YAAY,MAAM,WAAW,8CAA8C;AAC7F,MAAAA,WAAU,QAAQ,QAChB,MAAM,cAAc,2DAA2D,eAAe;AAAA,IAClG;AAEA,aAAS,MAAM,kBAAkB,SAASC,SAAM;AAC9C,YAAM,IAAI,iBAAiB,6DAA6D,UAAU,KAAKA,OAAI;AAAA,IAC7G;AAAA,EACF,GAAG,gBAAgB,SAAS;AAE5B,MAAM,mBAAmB,oBAAI,QAAQ;AAErC,WAAS,6BAA6B,QAAQ;AAC5C,UAAM,UAAU,kBAAkB,UAAU,SAAS,kBAAkB,OAAO,OAAO,gBAAgB;AACrG,UAAM,YAAY,UAAU,QAAQ,QAAQ,eAAe,IAAI;AAC/D,WAAO,WAAW,QAAQ,WAAW,YAAY;AAAA,EACnD;AAEA,WAAS,cAAc,OAAO;AAC5B,UAAMD,aAAY,6BAA6B,MAAM,MAAM;AAE3D,QAAIA,cAAaA,WAAU,MAAM;AAC/B,uBAAiB,IAAIA,WAAU,MAAMA,UAAS;AAAA,IAChD;AAAA,EACF;AAEA,GAAC,WAAY;AACX,QAAI,eAAe,MAAM,UAAW;AAEpC,QAAI,YAAY,OAAO,MAAM;AAI7B,QAAI,iBAAiB,QAAQ;AAC3B,YAAM,yBAAyB,OAAO,YAAY;AAElD,UAAI,iBAAiB,KAAK,UAAU,MAAM,KAAK,EAAE,eAAe,yBAAyB;AACvF,oBAAY;AAAA,MACd,OAAO;AACL;AAAA,MACF;AAAA,IACF;AAEA,qBAAiB,SAAS,eAAe,IAAI;AAE7C,WAAO,eAAe,WAAW,aAAa;AAAA,MAC5C,MAAM;AACJ,YAAI,KAAK,QAAQ,YAAY,KAAK,kBAAkB,iBAAiB;AACnE,iBAAO,iBAAiB,IAAI,KAAK,MAAM;AAAA,QACzC;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,GAAG;AAEH,MAAM,oBAAoB;AAAA,IACxB,OAAO;AAAA,IACP,MAAM;AAAA,EACR;AAkBA,MAAM,eAAN,MAAM,sBAAqB,YAAY;AAAA,IACrC,OAAO,sBAAsB;AAAA,IAE7B,SAAS,QAAQ,QAAQ;AAAA,IAEzB,WAAW,qBAAqB;AAC9B,aAAO,CAAC,YAAY,WAAW,KAAK;AAAA,IACtC;AAAA,IAEA,cAAc;AACZ,YAAM;AACN,WAAK,WAAW,IAAI,cAAa,oBAAoB,IAAI;AAAA,IAC3D;AAAA,IAEA,oBAAoB;AAClB,WAAK,SAAS,QAAQ;AAAA,IACxB;AAAA,IAEA,uBAAuB;AACrB,WAAK,SAAS,WAAW;AAAA,IAC3B;AAAA,IAEA,SAAS;AACP,aAAO,KAAK,SAAS,kBAAkB;AAAA,IACzC;AAAA,IAEA,yBAAyBC,SAAM;AAC7B,UAAIA,WAAQ,WAAW;AACrB,aAAK,SAAS,oBAAoB;AAAA,MACpC,WAAWA,WAAQ,OAAO;AACxB,aAAK,SAAS,iBAAiB;AAAA,MACjC,WAAWA,WAAQ,YAAY;AAC7B,aAAK,SAAS,gBAAgB;AAAA,MAChC;AAAA,IACF;AAAA;AAAA;AAAA;AAAA,IAKA,IAAI,MAAM;AACR,aAAO,KAAK,aAAa,KAAK;AAAA,IAChC;AAAA;AAAA;AAAA;AAAA,IAKA,IAAI,IAAI,OAAO;AACb,UAAI,OAAO;AACT,aAAK,aAAa,OAAO,KAAK;AAAA,MAChC,OAAO;AACL,aAAK,gBAAgB,KAAK;AAAA,MAC5B;AAAA,IACF;AAAA;AAAA;AAAA;AAAA,IAKA,IAAI,UAAU;AACZ,aAAO,KAAK,aAAa,SAAS;AAAA,IACpC;AAAA;AAAA;AAAA;AAAA,IAKA,IAAI,QAAQ,OAAO;AACjB,UAAI,OAAO;AACT,aAAK,aAAa,WAAW,KAAK;AAAA,MACpC,OAAO;AACL,aAAK,gBAAgB,SAAS;AAAA,MAChC;AAAA,IACF;AAAA,IAEA,IAAI,wBAAwB;AAC1B,aAAO,KAAK,OAAO,KAAK,YAAY;AAAA,IACtC;AAAA;AAAA;AAAA;AAAA,IAKA,IAAI,UAAU;AACZ,aAAO,4BAA4B,KAAK,aAAa,SAAS,KAAK,EAAE;AAAA,IACvE;AAAA;AAAA;AAAA;AAAA,IAKA,IAAI,QAAQ,OAAO;AACjB,UAAI,OAAO;AACT,aAAK,aAAa,WAAW,KAAK;AAAA,MACpC,OAAO;AACL,aAAK,gBAAgB,SAAS;AAAA,MAChC;AAAA,IACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,IAAI,WAAW;AACb,aAAO,KAAK,aAAa,UAAU;AAAA,IACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,IAAI,SAAS,OAAO;AAClB,UAAI,OAAO;AACT,aAAK,aAAa,YAAY,EAAE;AAAA,MAClC,OAAO;AACL,aAAK,gBAAgB,UAAU;AAAA,MACjC;AAAA,IACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,IAAI,aAAa;AACf,aAAO,KAAK,aAAa,YAAY;AAAA,IACvC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,IAAI,WAAW,OAAO;AACpB,UAAI,OAAO;AACT,aAAK,aAAa,cAAc,EAAE;AAAA,MACpC,OAAO;AACL,aAAK,gBAAgB,YAAY;AAAA,MACnC;AAAA,IACF;AAAA;AAAA;AAAA;AAAA,IAKA,IAAI,WAAW;AACb,aAAO,CAAC,KAAK,SAAS;AAAA,IACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,IAAI,WAAW;AACb,aAAO,KAAK,kBAAkB,YAAY,CAAC,KAAK;AAAA,IAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,IAAI,YAAY;AACd,aAAO,KAAK,eAAe,iBAAiB,aAAa,oBAAoB;AAAA,IAC/E;AAAA,EACF;AAEA,WAAS,4BAA4B,OAAO;AAC1C,YAAQ,MAAM,YAAY,GAAG;AAAA,MAC3B,KAAK;AACH,eAAO,kBAAkB;AAAA,MAC3B;AACE,eAAO,kBAAkB;AAAA,IAC7B;AAAA,EACF;AAEA,MAAM,QAAQ;AAAA,IACZ,SAAS;AAAA,IACT,kBAAkB;AAAA,IAClB,uBAAuB,oBAAI;AAAA,MACzB;AAAA,QACE;AAAA,QAAO;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAC/E;AAAA,QAAS;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAAO;AAAA,QAAS;AAAA,QAAS;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAAS;AAAA,QAC3E;AAAA,QAAO;AAAA,QAAS;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAAS;AAAA,QAAQ;AAAA,QACzE;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAAS;AAAA,QAAQ;AAAA,QACjE;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAAS;AAAA,QAAQ;AAAA,QAAQ;AAAA,QAAS;AAAA,QAAS;AAAA,QAAQ;AAAA,QAC3E;AAAA,QAAQ;AAAA,QAAS;AAAA,QAAQ;AAAA,MAC3B;AAAA,IACF;AAAA,EACF;AAEA,WAAS,sBAAsB,SAAS;AACtC,QAAI,QAAQ,aAAa,iBAAiB,KAAK,SAAS;AACtD,aAAO;AAAA,IACT,OAAO;AACL,YAAM,uBAAuB,SAAS,cAAc,QAAQ;AAC5D,YAAM,WAAW,YAAY;AAC7B,UAAI,UAAU;AACZ,6BAAqB,QAAQ;AAAA,MAC/B;AACA,2BAAqB,cAAc,QAAQ;AAC3C,2BAAqB,QAAQ;AAC7B,4BAAsB,sBAAsB,OAAO;AACnD,aAAO;AAAA,IACT;AAAA,EACF;AAEA,WAAS,sBAAsB,oBAAoB,eAAe;AAChE,eAAW,EAAE,MAAAA,SAAM,MAAM,KAAK,cAAc,YAAY;AACtD,yBAAmB,aAAaA,SAAM,KAAK;AAAA,IAC7C;AAAA,EACF;AAEA,WAAS,uBAAuB,MAAM;AACpC,UAAM,WAAW,SAAS,cAAc,UAAU;AAClD,aAAS,YAAY;AACrB,WAAO,SAAS;AAAA,EAClB;AAEA,WAAS,SAAS,WAAW,EAAE,QAAQ,YAAY,OAAO,IAAI,CAAC,GAAG;AAChE,UAAM,QAAQ,IAAI,YAAY,WAAW;AAAA,MACvC;AAAA,MACA,SAAS;AAAA,MACT,UAAU;AAAA,MACV;AAAA,IACF,CAAC;AAED,QAAI,UAAU,OAAO,aAAa;AAChC,aAAO,cAAc,KAAK;AAAA,IAC5B,OAAO;AACL,eAAS,gBAAgB,cAAc,KAAK;AAAA,IAC9C;AAEA,WAAO;AAAA,EACT;AAEA,WAAS,YAAY,OAAO;AAC1B,UAAM,eAAe;AACrB,UAAM,yBAAyB;AAAA,EACjC;AAEA,WAAS,cAAc;AACrB,QAAI,SAAS,oBAAoB,UAAU;AACzC,aAAO,kBAAkB;AAAA,IAC3B,OAAO;AACL,aAAO,mBAAmB;AAAA,IAC5B;AAAA,EACF;AAEA,WAAS,qBAAqB;AAC5B,WAAO,IAAI,QAAQ,CAACC,aAAY,sBAAsB,MAAMA,SAAQ,CAAC,CAAC;AAAA,EACxE;AAEA,WAAS,oBAAoB;AAC3B,WAAO,IAAI,QAAQ,CAACA,aAAY,WAAW,MAAMA,SAAQ,GAAG,CAAC,CAAC;AAAA,EAChE;AAEA,WAAS,gBAAgB;AACvB,WAAO,QAAQ,QAAQ;AAAA,EACzB;AAEA,WAAS,kBAAkB,OAAO,IAAI;AACpC,WAAO,IAAI,UAAU,EAAE,gBAAgB,MAAM,WAAW;AAAA,EAC1D;AAEA,WAAS,SAAS,YAAY,QAAQ;AACpC,UAAM,QAAQ,YAAY,SAAS,MAAM,EAAE,QAAQ,OAAO,EAAE,EAAE,MAAM,IAAI;AACxE,UAAM,QAAQ,MAAM,CAAC,EAAE,MAAM,MAAM;AACnC,UAAM,SAAS,QAAQ,MAAM,CAAC,EAAE,SAAS;AACzC,WAAO,MAAM,IAAI,CAAC,SAAS,KAAK,MAAM,MAAM,CAAC,EAAE,KAAK,IAAI;AAAA,EAC1D;AAEA,WAAS,YAAY,SAAS,QAAQ;AACpC,WAAO,QAAQ,OAAO,CAAC,QAAQC,SAAQC,OAAM;AAC3C,YAAM,QAAQ,OAAOA,EAAC,KAAK,SAAY,KAAK,OAAOA,EAAC;AACpD,aAAO,SAASD,UAAS;AAAA,IAC3B,GAAG,EAAE;AAAA,EACP;AAEA,WAAS,OAAO;AACd,WAAO,MAAM,KAAK,EAAE,QAAQ,GAAG,CAAC,EAC7B,IAAI,CAAC,GAAGC,OAAM;AACb,UAAIA,MAAK,KAAKA,MAAK,MAAMA,MAAK,MAAMA,MAAK,IAAI;AAC3C,eAAO;AAAA,MACT,WAAWA,MAAK,IAAI;AAClB,eAAO;AAAA,MACT,WAAWA,MAAK,IAAI;AAClB,gBAAQ,KAAK,MAAM,KAAK,OAAO,IAAI,CAAC,IAAI,GAAG,SAAS,EAAE;AAAA,MACxD,OAAO;AACL,eAAO,KAAK,MAAM,KAAK,OAAO,IAAI,EAAE,EAAE,SAAS,EAAE;AAAA,MACnD;AAAA,IACF,CAAC,EACA,KAAK,EAAE;AAAA,EACZ;AAEA,WAAS,aAAa,kBAAkB,UAAU;AAChD,eAAW,SAAS,SAAS,IAAI,CAAC,YAAY,SAAS,aAAa,aAAa,CAAC,GAAG;AACnF,UAAI,OAAO,SAAS,SAAU,QAAO;AAAA,IACvC;AAEA,WAAO;AAAA,EACT;AAEA,WAAS,aAAa,kBAAkB,UAAU;AAChD,WAAO,SAAS,KAAK,CAAC,YAAY,WAAW,QAAQ,aAAa,aAAa,CAAC;AAAA,EAClF;AAEA,WAAS,cAAc,UAAU;AAC/B,eAAW,WAAW,UAAU;AAC9B,UAAI,QAAQ,aAAa,eAAe;AACtC,gBAAQ,aAAa,QAAQ,EAAE;AAAA,MACjC;AACA,cAAQ,aAAa,aAAa,MAAM;AAAA,IAC1C;AAAA,EACF;AAEA,WAAS,kBAAkB,UAAU;AACnC,eAAW,WAAW,UAAU;AAC9B,UAAI,QAAQ,aAAa,eAAe;AACtC,gBAAQ,gBAAgB,MAAM;AAAA,MAChC;AAEA,cAAQ,gBAAgB,WAAW;AAAA,IACrC;AAAA,EACF;AAEA,WAAS,YAAY,SAAS,wBAAwB,KAAM;AAC1D,WAAO,IAAI,QAAQ,CAACF,aAAY;AAC9B,YAAM,aAAa,MAAM;AACvB,gBAAQ,oBAAoB,SAAS,UAAU;AAC/C,gBAAQ,oBAAoB,QAAQ,UAAU;AAC9C,QAAAA,SAAQ;AAAA,MACV;AAEA,cAAQ,iBAAiB,QAAQ,YAAY,EAAE,MAAM,KAAK,CAAC;AAC3D,cAAQ,iBAAiB,SAAS,YAAY,EAAE,MAAM,KAAK,CAAC;AAC5D,iBAAWA,UAAS,qBAAqB;AAAA,IAC3C,CAAC;AAAA,EACH;AAEA,WAAS,0BAA0B,QAAQ;AACzC,YAAQ,QAAQ;AAAA,MACd,KAAK;AACH,eAAO,QAAQ;AAAA,MACjB,KAAK;AAAA,MACL,KAAK;AACH,eAAO,QAAQ;AAAA,IACnB;AAAA,EACF;AAEA,WAAS,SAAS,QAAQ;AACxB,WAAO,UAAU,aAAa,UAAU,aAAa,UAAU;AAAA,EACjE;AAEA,WAAS,kBAAkB,UAAU;AACnC,UAAM,SAAS,aAAa,qBAAqB,GAAG,QAAQ;AAE5D,WAAO,SAAS,MAAM,IAAI,SAAS;AAAA,EACrC;AAEA,WAAS,eAAeD,SAAM;AAC5B,WAAO,SAAS,cAAc,cAAcA,OAAI,IAAI;AAAA,EACtD;AAEA,WAAS,eAAeA,SAAM;AAC5B,UAAM,UAAU,eAAeA,OAAI;AACnC,WAAO,WAAW,QAAQ;AAAA,EAC5B;AAEA,WAAS,cAAc;AACrB,UAAM,UAAU,eAAe,WAAW;AAE1C,QAAI,SAAS;AACX,YAAM,EAAE,OAAO,QAAQ,IAAI;AAC3B,aAAO,SAAS,KAAK,UAAU;AAAA,IACjC;AAAA,EACF;AAEA,WAAS,eAAeA,SAAM,SAAS;AACrC,QAAI,UAAU,eAAeA,OAAI;AAEjC,QAAI,CAAC,SAAS;AACZ,gBAAU,SAAS,cAAc,MAAM;AACvC,cAAQ,aAAa,QAAQA,OAAI;AAEjC,eAAS,KAAK,YAAY,OAAO;AAAA,IACnC;AAEA,YAAQ,aAAa,WAAW,OAAO;AAEvC,WAAO;AAAA,EACT;AAEA,WAAS,uBAAuB,SAAS,UAAU;AACjD,QAAI,mBAAmB,SAAS;AAC9B,aACE,QAAQ,QAAQ,QAAQ,KAAK,uBAAuB,QAAQ,gBAAgB,QAAQ,YAAY,GAAG,MAAM,QAAQ;AAAA,IAErH;AAAA,EACF;AAEA,WAAS,mBAAmB,SAAS;AACnC,UAAM,wBAAwB;AAE9B,WAAO,CAAC,CAAC,WAAW,QAAQ,QAAQ,qBAAqB,KAAK,QAAQ,OAAO,QAAQ,SAAS;AAAA,EAChG;AAEA,WAAS,0BAA0B,2BAA2B;AAC5D,WAAO,MAAM,KAAK,0BAA0B,iBAAiB,aAAa,CAAC,EAAE,KAAK,kBAAkB;AAAA,EACtG;AAEA,iBAAe,OAAO,UAAU,QAAQ;AACtC,UAAM,SAAS,OAAO;AAEtB,aAAS;AAET,UAAM,mBAAmB;AAEzB,UAAM,QAAQ,OAAO;AAErB,WAAO,CAAC,QAAQ,KAAK;AAAA,EACvB;AAEA,WAAS,oBAAoBA,SAAM;AACjC,QAAIA,YAAS,UAAU;AACrB,aAAO;AAAA,IACT,WAAWA,SAAM;AACf,iBAAW,WAAW,SAAS,kBAAkBA,OAAI,GAAG;AACtD,YAAI,mBAAmB,kBAAmB,QAAO;AAAA,MACnD;AAEA,aAAO;AAAA,IACT,OAAO;AACL,aAAO;AAAA,IACT;AAAA,EACF;AAEA,WAAS,wBAAwB,QAAQ;AACvC,WAAO,uBAAuB,QAAQ,0CAA0C;AAAA,EAClF;AAEA,WAAS,mBAAmB,MAAM;AAChC,WAAO,UAAU,KAAK,aAAa,MAAM,KAAK,EAAE;AAAA,EAClD;AAEA,WAAS,SAAS,IAAI,OAAO;AAC3B,QAAI,YAAY;AAEhB,WAAO,IAAI,SAAS;AAClB,YAAM,WAAW,MAAM,GAAG,MAAM,MAAM,IAAI;AAC1C,mBAAa,SAAS;AACtB,kBAAY,WAAW,UAAU,KAAK;AAAA,IACxC;AAAA,EACF;AAEA,MAAM,YAAY;AAAA,IAChB,iBAAiB;AAAA,MACf,cAAc,CAAAD,eAAa;AACzB,QAAAA,WAAU,aAAa,iBAAiB,MAAM;AAC9C,QAAAA,WAAU,iBAAiB,SAAS,WAAW;AAAA,MACjD;AAAA,MAEA,aAAa,CAAAA,eAAa;AACxB,QAAAA,WAAU,gBAAgB,eAAe;AACzC,QAAAA,WAAU,oBAAoB,SAAS,WAAW;AAAA,MACpD;AAAA,IACF;AAAA,IAEA,YAAY;AAAA,MACV,cAAc,CAAAA,eAAaA,WAAU,WAAW;AAAA,MAChD,aAAa,CAAAA,eAAaA,WAAU,WAAW;AAAA,IACjD;AAAA,EACF;AAEA,MAAM,SAAN,MAAa;AAAA,IACX,aAAa;AAAA,IAEb,YAAYK,SAAQ;AAClB,aAAO,OAAO,MAAMA,OAAM;AAAA,IAC5B;AAAA,IAEA,IAAI,YAAY;AACd,aAAO,KAAK;AAAA,IACd;AAAA,IAEA,IAAI,UAAU,OAAO;AACnB,WAAK,aAAa,UAAU,KAAK,KAAK;AAAA,IACxC;AAAA,EACF;AAEA,MAAM,QAAQ,IAAI,OAAO;AAAA,IACvB,MAAM;AAAA,IACN,WAAW;AAAA,EACb,CAAC;AAED,MAAM,SAAS;AAAA,IACb;AAAA,IACA;AAAA,EACF;AAEA,WAAS,UAAU,WAAW;AAC5B,WAAO,IAAI,IAAI,UAAU,SAAS,GAAG,SAAS,OAAO;AAAA,EACvD;AAEA,WAAS,UAAU,KAAK;AACtB,QAAI;AACJ,QAAI,IAAI,MAAM;AACZ,aAAO,IAAI,KAAK,MAAM,CAAC;AAAA,IAEzB,WAAY,cAAc,IAAI,KAAK,MAAM,QAAQ,GAAI;AACnD,aAAO,YAAY,CAAC;AAAA,IACtB;AAAA,EACF;AAEA,WAAS,YAAY,MAAML,YAAW;AACpC,UAAM,SAASA,YAAW,aAAa,YAAY,KAAK,KAAK,aAAa,QAAQ,KAAK,KAAK;AAE5F,WAAO,UAAU,MAAM;AAAA,EACzB;AAEA,WAAS,aAAa,KAAK;AACzB,YAAQ,qBAAqB,GAAG,EAAE,MAAM,UAAU,KAAK,CAAC,GAAG,CAAC,KAAK;AAAA,EACnE;AAEA,WAAS,aAAa,SAAS,KAAK;AAClC,UAAM,SAAS,UAAU,GAAG;AAC5B,WAAO,QAAQ,SAAS,UAAU,MAAM,EAAE,QAAQ,QAAQ,KAAK,WAAW,MAAM;AAAA,EAClF;AAEA,WAAS,oBAAoBM,WAAU,cAAc;AACnD,WAAO,aAAaA,WAAU,YAAY,KAAK,CAAC,OAAO,MAAM,sBAAsB,IAAI,aAAaA,SAAQ,CAAC;AAAA,EAC/G;AAEA,WAAS,cAAc,KAAK;AAC1B,UAAM,SAAS,UAAU,GAAG;AAC5B,WAAO,UAAU,OAAO,IAAI,KAAK,MAAM,GAAG,EAAE,OAAO,SAAS,EAAE,IAAI,IAAI;AAAA,EACxE;AAEA,WAAS,WAAW,KAAK;AACvB,WAAO,cAAc,GAAG;AAAA,EAC1B;AAEA,WAAS,aAAa,MAAM,OAAO;AACjC,WAAO,UAAU,IAAI,EAAE,QAAQ,UAAU,KAAK,EAAE;AAAA,EAClD;AAEA,WAAS,kBAAkB,KAAK;AAC9B,WAAO,IAAI,SAAS,MAAM,GAAG,EAAE,MAAM,CAAC;AAAA,EACxC;AAEA,WAAS,qBAAqB,KAAK;AACjC,WAAO,kBAAkB,GAAG,EAAE,MAAM,EAAE,EAAE,CAAC;AAAA,EAC3C;AAEA,WAAS,UAAU,KAAK;AACtB,WAAO,iBAAiB,IAAI,SAAS,IAAI,QAAQ;AAAA,EACnD;AAEA,WAAS,iBAAiB,OAAO;AAC/B,WAAO,MAAM,SAAS,GAAG,IAAI,QAAQ,QAAQ;AAAA,EAC/C;AAEA,MAAM,gBAAN,MAAoB;AAAA,IAClB,YAAY,UAAU;AACpB,WAAK,WAAW;AAAA,IAClB;AAAA,IAEA,IAAI,YAAY;AACd,aAAO,KAAK,SAAS;AAAA,IACvB;AAAA,IAEA,IAAI,SAAS;AACX,aAAO,CAAC,KAAK;AAAA,IACf;AAAA,IAEA,IAAI,cAAc;AAChB,aAAO,KAAK,cAAc,OAAO,KAAK,cAAc;AAAA,IACtD;AAAA,IAEA,IAAI,cAAc;AAChB,aAAO,KAAK,cAAc,OAAO,KAAK,cAAc;AAAA,IACtD;AAAA,IAEA,IAAI,aAAa;AACf,aAAO,KAAK,SAAS;AAAA,IACvB;AAAA,IAEA,IAAI,WAAW;AACb,aAAO,UAAU,KAAK,SAAS,GAAG;AAAA,IACpC;AAAA,IAEA,IAAI,SAAS;AACX,aAAO,KAAK,eAAe,KAAK,YAAY,MAAM,wDAAwD;AAAA,IAC5G;AAAA,IAEA,IAAI,aAAa;AACf,aAAO,KAAK,SAAS;AAAA,IACvB;AAAA,IAEA,IAAI,cAAc;AAChB,aAAO,KAAK,OAAO,cAAc;AAAA,IACnC;AAAA,IAEA,IAAI,eAAe;AACjB,aAAO,KAAK,SAAS,MAAM,EAAE,KAAK;AAAA,IACpC;AAAA,IAEA,IAAI,eAAe;AACjB,UAAI,KAAK,QAAQ;AACf,eAAO,KAAK,SAAS,MAAM,EAAE,KAAK;AAAA,MACpC,OAAO;AACL,eAAO,QAAQ,QAAQ,MAAS;AAAA,MAClC;AAAA,IACF;AAAA,IAEA,OAAOL,SAAM;AACX,aAAO,KAAK,SAAS,QAAQ,IAAIA,OAAI;AAAA,IACvC;AAAA,EACF;AAEA,MAAM,aAAN,cAAyB,IAAI;AAAA,IAC3B,YAAY,SAAS;AACnB,YAAM;AACN,WAAK,UAAU;AAAA,IACjB;AAAA,IAEA,IAAI,OAAO;AACT,UAAI,KAAK,QAAQ,KAAK,SAAS;AAC7B,cAAM,WAAW,KAAK,OAAO;AAC7B,cAAM,cAAc,SAAS,KAAK,EAAE;AACpC,aAAK,OAAO,WAAW;AAAA,MACzB;AACA,YAAM,IAAI,KAAK;AAAA,IACjB;AAAA,EACF;AAEA,MAAM,iBAAiB,IAAI,WAAW,EAAE;AAExC,MAAM,cAAc,OAAO;AAE3B,WAAS,sBAAsB,KAAK,UAAU,CAAC,GAAG;AAChD,UAAM,kBAAkB,IAAI,QAAQ,QAAQ,WAAW,CAAC,CAAC;AACzD,UAAM,aAAa,KAAK;AACxB,mBAAe,IAAI,UAAU;AAC7B,oBAAgB,OAAO,sBAAsB,UAAU;AAEvD,WAAO,YAAY,KAAK;AAAA,MACtB,GAAG;AAAA,MACH,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AAEA,WAAS,sBAAsB,QAAQ;AACrC,YAAQ,OAAO,YAAY,GAAG;AAAA,MAC5B,KAAK;AACH,eAAO,YAAY;AAAA,MACrB,KAAK;AACH,eAAO,YAAY;AAAA,MACrB,KAAK;AACH,eAAO,YAAY;AAAA,MACrB,KAAK;AACH,eAAO,YAAY;AAAA,MACrB,KAAK;AACH,eAAO,YAAY;AAAA,IACvB;AAAA,EACF;AAEA,MAAM,cAAc;AAAA,IAClB,KAAK;AAAA,IACL,MAAM;AAAA,IACN,KAAK;AAAA,IACL,OAAO;AAAA,IACP,QAAQ;AAAA,EACV;AAEA,WAAS,uBAAuB,UAAU;AACxC,YAAQ,SAAS,YAAY,GAAG;AAAA,MAC9B,KAAK,aAAa;AAChB,eAAO,aAAa;AAAA,MACtB,KAAK,aAAa;AAChB,eAAO,aAAa;AAAA,MACtB;AACE,eAAO,aAAa;AAAA,IACxB;AAAA,EACF;AAEA,MAAM,eAAe;AAAA,IACnB,YAAY;AAAA,IACZ,WAAW;AAAA,IACX,OAAO;AAAA,EACT;AAEA,MAAM,eAAN,MAAmB;AAAA,IACjB,kBAAkB,IAAI,gBAAgB;AAAA,IACtC,yBAAyB,CAAC,WAAW;AAAA,IAAC;AAAA,IAEtC,YAAY,UAAU,QAAQK,WAAU,cAAc,IAAI,gBAAgB,GAAG,SAAS,MAAM,UAAU,aAAa,YAAY;AAC7H,YAAM,CAAC,KAAK,IAAI,IAAI,qBAAqB,UAAUA,SAAQ,GAAG,QAAQ,aAAa,OAAO;AAE1F,WAAK,WAAW;AAChB,WAAK,MAAM;AACX,WAAK,SAAS;AACd,WAAK,eAAe;AAAA,QAClB,aAAa;AAAA,QACb,UAAU;AAAA,QACV,QAAQ,OAAO,YAAY;AAAA,QAC3B,SAAS,EAAE,GAAG,KAAK,eAAe;AAAA,QAClC;AAAA,QACA,QAAQ,KAAK;AAAA,QACb,UAAU,KAAK,SAAS,UAAU;AAAA,MACpC;AACA,WAAK,UAAU;AAAA,IACjB;AAAA,IAEA,IAAI,SAAS;AACX,aAAO,KAAK,aAAa;AAAA,IAC3B;AAAA,IAEA,IAAI,OAAO,OAAO;AAChB,YAAM,YAAY,KAAK,SAAS,KAAK,IAAI,eAAe,KAAK,aAAa,QAAQ,IAAI,SAAS;AAC/F,YAAM,cAAc,sBAAsB,KAAK,KAAK,YAAY;AAEhE,WAAK,IAAI,SAAS;AAElB,YAAM,CAAC,KAAK,IAAI,IAAI,qBAAqB,KAAK,KAAK,aAAa,WAAW,KAAK,OAAO;AAEvF,WAAK,MAAM;AACX,WAAK,aAAa,OAAO;AACzB,WAAK,aAAa,SAAS,YAAY,YAAY;AAAA,IACrD;AAAA,IAEA,IAAI,UAAU;AACZ,aAAO,KAAK,aAAa;AAAA,IAC3B;AAAA,IAEA,IAAI,QAAQ,OAAO;AACjB,WAAK,aAAa,UAAU;AAAA,IAC9B;AAAA,IAEA,IAAI,OAAO;AACT,UAAI,KAAK,QAAQ;AACf,eAAO,KAAK,IAAI;AAAA,MAClB,OAAO;AACL,eAAO,KAAK,aAAa;AAAA,MAC3B;AAAA,IACF;AAAA,IAEA,IAAI,KAAK,OAAO;AACd,WAAK,aAAa,OAAO;AAAA,IAC3B;AAAA,IAEA,IAAI,WAAW;AACb,aAAO,KAAK;AAAA,IACd;AAAA,IAEA,IAAI,SAAS;AACX,aAAO,KAAK,IAAI;AAAA,IAClB;AAAA,IAEA,IAAI,UAAU;AACZ,aAAO,KAAK,OAAO,MAAM,KAAK,KAAK,KAAK,QAAQ,CAAC,IAAI,CAAC;AAAA,IACxD;AAAA,IAEA,SAAS;AACP,WAAK,gBAAgB,MAAM;AAAA,IAC7B;AAAA,IAEA,MAAM,UAAU;AACd,YAAM,EAAE,aAAa,IAAI;AACzB,WAAK,SAAS,eAAe,IAAI;AACjC,YAAM,QAAQ,MAAM,KAAK,6BAA6B,YAAY;AAClE,UAAI;AACF,aAAK,SAAS,eAAe,IAAI;AAEjC,YAAI,MAAM,OAAO,cAAc;AAC7B,eAAK,WAAW,MAAM,OAAO,aAAa;AAAA,QAC5C,OAAO;AACL,eAAK,WAAW,sBAAsB,KAAK,IAAI,MAAM,YAAY;AAAA,QACnE;AAEA,cAAM,WAAW,MAAM,KAAK;AAC5B,eAAO,MAAM,KAAK,QAAQ,QAAQ;AAAA,MACpC,SAASC,QAAO;AACd,YAAIA,OAAM,SAAS,cAAc;AAC/B,cAAI,KAAK,2BAA2BA,MAAK,GAAG;AAC1C,iBAAK,SAAS,eAAe,MAAMA,MAAK;AAAA,UAC1C;AACA,gBAAMA;AAAA,QACR;AAAA,MACF,UAAE;AACA,aAAK,SAAS,gBAAgB,IAAI;AAAA,MACpC;AAAA,IACF;AAAA,IAEA,MAAM,QAAQ,UAAU;AACtB,YAAM,gBAAgB,IAAI,cAAc,QAAQ;AAChD,YAAM,QAAQ,SAAS,+BAA+B;AAAA,QACpD,YAAY;AAAA,QACZ,QAAQ,EAAE,cAAc;AAAA,QACxB,QAAQ,KAAK;AAAA,MACf,CAAC;AACD,UAAI,MAAM,kBAAkB;AAC1B,aAAK,SAAS,iCAAiC,MAAM,aAAa;AAAA,MACpE,WAAW,cAAc,WAAW;AAClC,aAAK,SAAS,6BAA6B,MAAM,aAAa;AAAA,MAChE,OAAO;AACL,aAAK,SAAS,0BAA0B,MAAM,aAAa;AAAA,MAC7D;AACA,aAAO;AAAA,IACT;AAAA,IAEA,IAAI,iBAAiB;AACnB,aAAO;AAAA,QACL,QAAQ;AAAA,MACV;AAAA,IACF;AAAA,IAEA,IAAI,SAAS;AACX,aAAO,OAAO,KAAK,MAAM;AAAA,IAC3B;AAAA,IAEA,IAAI,cAAc;AAChB,aAAO,KAAK,gBAAgB;AAAA,IAC9B;AAAA,IAEA,mBAAmB,UAAU;AAC3B,WAAK,QAAQ,QAAQ,IAAI,CAAC,UAAU,KAAK,QAAQ,QAAQ,CAAC,EAAE,KAAK,IAAI;AAAA,IACvE;AAAA,IAEA,MAAM,6BAA6B,cAAc;AAC/C,YAAM,sBAAsB,IAAI,QAAQ,CAACL,aAAa,KAAK,yBAAyBA,QAAQ;AAC5F,YAAM,QAAQ,SAAS,8BAA8B;AAAA,QACnD,YAAY;AAAA,QACZ,QAAQ;AAAA,UACN;AAAA,UACA,KAAK,KAAK;AAAA,UACV,QAAQ,KAAK;AAAA,QACf;AAAA,QACA,QAAQ,KAAK;AAAA,MACf,CAAC;AACD,WAAK,MAAM,MAAM,OAAO;AACxB,UAAI,MAAM,iBAAkB,OAAM;AAElC,aAAO;AAAA,IACT;AAAA,IAEA,2BAA2BK,QAAO;AAChC,YAAM,QAAQ,SAAS,6BAA6B;AAAA,QAClD,QAAQ,KAAK;AAAA,QACb,YAAY;AAAA,QACZ,QAAQ,EAAE,SAAS,MAAM,OAAOA,OAAM;AAAA,MACxC,CAAC;AAED,aAAO,CAAC,MAAM;AAAA,IAChB;AAAA,EACF;AAEA,WAAS,OAAO,aAAa;AAC3B,WAAO,sBAAsB,WAAW,KAAK,YAAY;AAAA,EAC3D;AAEA,WAAS,qBAAqB,UAAU,QAAQ,aAAa,SAAS;AACpE,UAAM,eACJ,MAAM,KAAK,WAAW,EAAE,SAAS,IAAI,IAAI,gBAAgB,sBAAsB,WAAW,CAAC,IAAI,SAAS;AAE1G,QAAI,OAAO,MAAM,GAAG;AAClB,aAAO,CAAC,yBAAyB,UAAU,YAAY,GAAG,IAAI;AAAA,IAChE,WAAW,WAAW,aAAa,YAAY;AAC7C,aAAO,CAAC,UAAU,YAAY;AAAA,IAChC,OAAO;AACL,aAAO,CAAC,UAAU,WAAW;AAAA,IAC/B;AAAA,EACF;AAEA,WAAS,sBAAsB,aAAa;AAC1C,UAAM,UAAU,CAAC;AAEjB,eAAW,CAACN,SAAM,KAAK,KAAK,aAAa;AACvC,UAAI,iBAAiB,KAAM;AAAA,UACtB,SAAQ,KAAK,CAACA,SAAM,KAAK,CAAC;AAAA,IACjC;AAEA,WAAO;AAAA,EACT;AAEA,WAAS,yBAAyB,KAAK,aAAa;AAClD,UAAM,eAAe,IAAI,gBAAgB,sBAAsB,WAAW,CAAC;AAE3E,QAAI,SAAS,aAAa,SAAS;AAEnC,WAAO;AAAA,EACT;AAEA,MAAM,qBAAN,MAAyB;AAAA,IACvB,UAAU;AAAA,IAEV,YAAY,UAAU,SAAS;AAC7B,WAAK,WAAW;AAChB,WAAK,UAAU;AACf,WAAK,uBAAuB,IAAI,qBAAqB,KAAK,SAAS;AAAA,IACrE;AAAA,IAEA,QAAQ;AACN,UAAI,CAAC,KAAK,SAAS;AACjB,aAAK,UAAU;AACf,aAAK,qBAAqB,QAAQ,KAAK,OAAO;AAAA,MAChD;AAAA,IACF;AAAA,IAEA,OAAO;AACL,UAAI,KAAK,SAAS;AAChB,aAAK,UAAU;AACf,aAAK,qBAAqB,UAAU,KAAK,OAAO;AAAA,MAClD;AAAA,IACF;AAAA,IAEA,YAAY,CAAC,YAAY;AACvB,YAAM,YAAY,QAAQ,MAAM,EAAE,EAAE,CAAC;AACrC,UAAI,WAAW,gBAAgB;AAC7B,aAAK,SAAS,0BAA0B,KAAK,OAAO;AAAA,MACtD;AAAA,IACF;AAAA,EACF;AAEA,MAAM,gBAAN,MAAoB;AAAA,IAClB,OAAO,cAAc;AAAA,IAErB,OAAO,KAAK,SAAS;AACnB,UAAI,OAAO,WAAW,UAAU;AAC9B,eAAO,IAAI,KAAK,uBAAuB,OAAO,CAAC;AAAA,MACjD,OAAO;AACL,eAAO;AAAA,MACT;AAAA,IACF;AAAA,IAEA,YAAY,UAAU;AACpB,WAAK,WAAW,qBAAqB,QAAQ;AAAA,IAC/C;AAAA,EACF;AAEA,WAAS,qBAAqB,UAAU;AACtC,eAAW,WAAW,SAAS,iBAAiB,cAAc,GAAG;AAC/D,YAAM,gBAAgB,SAAS,WAAW,SAAS,IAAI;AAEvD,iBAAW,sBAAsB,cAAc,gBAAgB,QAAQ,iBAAiB,QAAQ,GAAG;AACjG,2BAAmB,YAAY,sBAAsB,kBAAkB,CAAC;AAAA,MAC1E;AAEA,cAAQ,YAAY,aAAa;AAAA,IACnC;AAEA,WAAO;AAAA,EACT;AAEA,MAAM,iBAAiB;AAEvB,MAAM,gBAAN,MAAoB;AAAA,IAClB,mBAAmB;AAAA,IACnB,cAAc;AAAA,IAEd,IAAI,KAAK;AACP,UAAI,KAAK,eAAe,KAAK,YAAY,QAAQ,OAAO,KAAK,YAAY,SAAS,KAAK,IAAI,GAAG;AAC5F,eAAO,KAAK,YAAY;AAAA,MAC1B;AAAA,IACF;AAAA,IAEA,SAAS,KAAK,SAAS,KAAK;AAC1B,WAAK,MAAM;AAEX,WAAK,mBAAmB,WAAW,MAAM;AACvC,gBAAQ,QAAQ;AAChB,aAAK,IAAI,KAAK,SAAS,GAAG;AAC1B,aAAK,mBAAmB;AAAA,MAC1B,GAAG,cAAc;AAAA,IACnB;AAAA,IAEA,IAAI,KAAK,SAAS,KAAK;AACrB,WAAK,cAAc,EAAE,KAAK,SAAS,QAAQ,IAAI,MAAK,oBAAI,KAAK,GAAE,QAAQ,IAAI,GAAG,EAAE;AAAA,IAClF;AAAA,IAEA,QAAQ;AACN,UAAI,KAAK,iBAAkB,cAAa,KAAK,gBAAgB;AAC7D,WAAK,cAAc;AAAA,IACrB;AAAA,EACF;AAEA,MAAM,WAAW,KAAK;AACtB,MAAM,gBAAgB,IAAI,cAAc;AAExC,MAAM,sBAAsB;AAAA,IAC1B,aAAa;AAAA,IACb,YAAY;AAAA,IACZ,SAAS;AAAA,IACT,WAAW;AAAA,IACX,UAAU;AAAA,IACV,SAAS;AAAA,EACX;AAEA,MAAM,iBAAN,MAAM,gBAAe;AAAA,IACnB,QAAQ,oBAAoB;AAAA,IAE5B,OAAO,cAAc,SAAS;AAC5B,aAAO,QAAQ,QAAQ,QAAQ,OAAO,CAAC;AAAA,IACzC;AAAA,IAEA,YAAY,UAAU,aAAaD,YAAW,eAAe,OAAO;AAClE,YAAM,SAAS,UAAU,aAAaA,UAAS;AAC/C,YAAM,SAAS,UAAU,cAAc,aAAaA,UAAS,GAAG,MAAM;AACtE,YAAM,OAAO,cAAc,aAAaA,UAAS;AACjD,YAAM,UAAU,WAAW,aAAaA,UAAS;AAEjD,WAAK,WAAW;AAChB,WAAK,cAAc;AACnB,WAAK,YAAYA;AACjB,WAAK,eAAe,IAAI,aAAa,MAAM,QAAQ,QAAQ,MAAM,aAAa,OAAO;AACrF,WAAK,eAAe;AAAA,IACtB;AAAA,IAEA,IAAI,SAAS;AACX,aAAO,KAAK,aAAa;AAAA,IAC3B;AAAA,IAEA,IAAI,OAAO,OAAO;AAChB,WAAK,aAAa,SAAS;AAAA,IAC7B;AAAA,IAEA,IAAI,SAAS;AACX,aAAO,KAAK,aAAa,IAAI,SAAS;AAAA,IACxC;AAAA,IAEA,IAAI,OAAO,OAAO;AAChB,WAAK,aAAa,MAAM,UAAU,KAAK;AAAA,IACzC;AAAA,IAEA,IAAI,OAAO;AACT,aAAO,KAAK,aAAa;AAAA,IAC3B;AAAA,IAEA,IAAI,UAAU;AACZ,aAAO,KAAK,aAAa;AAAA,IAC3B;AAAA,IAEA,IAAI,SAAS;AACX,aAAO,KAAK,aAAa;AAAA,IAC3B;AAAA,IAEA,IAAI,WAAW;AACb,aAAO,KAAK,aAAa;AAAA,IAC3B;AAAA;AAAA,IAIA,MAAM,QAAQ;AACZ,YAAM,EAAE,aAAa,WAAW,IAAI;AACpC,YAAM,sBAAsB,aAAa,sBAAsB,KAAK,WAAW,KAAK,WAAW;AAE/F,UAAI,OAAO,wBAAwB,UAAU;AAC3C,cAAM,gBAAgB,OAAO,OAAO,MAAM,YAAY,aACpD,OAAO,MAAM,UACb,gBAAe;AAEjB,cAAM,SAAS,MAAM,cAAc,qBAAqB,KAAK,aAAa,KAAK,SAAS;AACxF,YAAI,CAAC,QAAQ;AACX;AAAA,QACF;AAAA,MACF;AAEA,UAAI,KAAK,SAAS,aAAa;AAC7B,aAAK,QAAQ;AACb,eAAO,KAAK,aAAa,QAAQ;AAAA,MACnC;AAAA,IACF;AAAA,IAEA,OAAO;AACL,YAAM,EAAE,UAAU,QAAQ,IAAI;AAC9B,UAAI,KAAK,SAAS,YAAY,KAAK,SAAS,SAAS;AACnD,aAAK,QAAQ;AACb,aAAK,aAAa,OAAO;AACzB,eAAO;AAAA,MACT;AAAA,IACF;AAAA;AAAA,IAIA,eAAe,SAAS;AACtB,UAAI,CAAC,QAAQ,QAAQ;AACnB,cAAM,QAAQ,eAAe,eAAe,YAAY,CAAC,KAAK,eAAe,YAAY;AACzF,YAAI,OAAO;AACT,kBAAQ,QAAQ,cAAc,IAAI;AAAA,QACpC;AAAA,MACF;AAEA,UAAI,KAAK,kCAAkC,OAAO,GAAG;AACnD,gBAAQ,mBAAmB,cAAc,WAAW;AAAA,MACtD;AAAA,IACF;AAAA,IAEA,eAAe,UAAU;AACvB,WAAK,QAAQ,oBAAoB;AACjC,UAAI,KAAK,UAAW,QAAO,MAAM,UAAU,aAAa,KAAK,SAAS;AACtE,WAAK,eAAe;AACpB,iBAAW,KAAK,WAAW;AAC3B,eAAS,sBAAsB;AAAA,QAC7B,QAAQ,KAAK;AAAA,QACb,QAAQ,EAAE,gBAAgB,KAAK;AAAA,MACjC,CAAC;AACD,WAAK,SAAS,sBAAsB,IAAI;AAAA,IAC1C;AAAA,IAEA,iCAAiC,SAAS,UAAU;AAClD,oBAAc,MAAM;AAEpB,WAAK,SAAS,EAAE,SAAS,SAAS,WAAW,eAAe,SAAS;AAAA,IACvE;AAAA,IAEA,6BAA6B,SAAS,UAAU;AAC9C,UAAI,SAAS,eAAe,SAAS,aAAa;AAChD,aAAK,SAAS,iCAAiC,MAAM,QAAQ;AAC7D;AAAA,MACF;AAEA,oBAAc,MAAM;AAEpB,UAAI,KAAK,oBAAoB,OAAO,KAAK,iCAAiC,QAAQ,GAAG;AACnF,cAAMO,SAAQ,IAAI,MAAM,kDAAkD;AAC1E,aAAK,SAAS,sBAAsB,MAAMA,MAAK;AAAA,MACjD,OAAO;AACL,aAAK,QAAQ,oBAAoB;AACjC,aAAK,SAAS,EAAE,SAAS,MAAM,eAAe,SAAS;AACvD,aAAK,SAAS,oCAAoC,MAAM,QAAQ;AAAA,MAClE;AAAA,IACF;AAAA,IAEA,0BAA0B,SAAS,UAAU;AAC3C,WAAK,SAAS,EAAE,SAAS,OAAO,eAAe,SAAS;AACxD,WAAK,SAAS,iCAAiC,MAAM,QAAQ;AAAA,IAC/D;AAAA,IAEA,eAAe,SAASA,QAAO;AAC7B,WAAK,SAAS,EAAE,SAAS,OAAO,OAAAA,OAAM;AACtC,WAAK,SAAS,sBAAsB,MAAMA,MAAK;AAAA,IACjD;AAAA,IAEA,gBAAgB,UAAU;AACxB,WAAK,QAAQ,oBAAoB;AACjC,UAAI,KAAK,UAAW,QAAO,MAAM,UAAU,YAAY,KAAK,SAAS;AACrE,WAAK,mBAAmB;AACxB,qBAAe,KAAK,WAAW;AAC/B,eAAS,oBAAoB;AAAA,QAC3B,QAAQ,KAAK;AAAA,QACb,QAAQ,EAAE,gBAAgB,MAAM,GAAG,KAAK,OAAO;AAAA,MACjD,CAAC;AACD,WAAK,SAAS,uBAAuB,IAAI;AAAA,IAC3C;AAAA;AAAA,IAIA,iBAAiB;AACf,UAAI,CAAC,KAAK,aAAa,CAAC,KAAK,YAAa;AAE1C,UAAI,KAAK,UAAU,QAAQ,QAAQ,GAAG;AACpC,aAAK,qBAAqB,KAAK,UAAU;AACzC,aAAK,UAAU,YAAY,KAAK;AAAA,MAClC,WAAW,KAAK,UAAU,QAAQ,OAAO,GAAG;AAC1C,cAAM,QAAQ,KAAK;AACnB,aAAK,qBAAqB,MAAM;AAChC,cAAM,QAAQ,KAAK;AAAA,MACrB;AAAA,IACF;AAAA,IAEA,qBAAqB;AACnB,UAAI,CAAC,KAAK,aAAa,CAAC,KAAK,mBAAoB;AAEjD,UAAI,KAAK,UAAU,QAAQ,QAAQ,GAAG;AACpC,aAAK,UAAU,YAAY,KAAK;AAAA,MAClC,WAAW,KAAK,UAAU,QAAQ,OAAO,GAAG;AAC1C,cAAM,QAAQ,KAAK;AACnB,cAAM,QAAQ,KAAK;AAAA,MACrB;AAAA,IACF;AAAA,IAEA,oBAAoB,SAAS;AAC3B,aAAO,CAAC,QAAQ,UAAU,KAAK;AAAA,IACjC;AAAA,IAEA,kCAAkC,SAAS;AACzC,aAAO,CAAC,QAAQ,UAAU,aAAa,qBAAqB,KAAK,WAAW,KAAK,WAAW;AAAA,IAC9F;AAAA,IAEA,IAAI,cAAc;AAChB,aAAO,KAAK,WAAW,aAAa,yBAAyB;AAAA,IAC/D;AAAA,EACF;AAEA,WAAS,cAAc,aAAaP,YAAW;AAC7C,UAAM,WAAW,IAAI,SAAS,WAAW;AACzC,UAAMC,UAAOD,YAAW,aAAa,MAAM;AAC3C,UAAM,QAAQA,YAAW,aAAa,OAAO;AAE7C,QAAIC,SAAM;AACR,eAAS,OAAOA,SAAM,SAAS,EAAE;AAAA,IACnC;AAEA,WAAO;AAAA,EACT;AAEA,WAAS,eAAe,YAAY;AAClC,QAAI,cAAc,MAAM;AACtB,YAAM,UAAU,SAAS,SAAS,SAAS,OAAO,MAAM,IAAI,IAAI,CAAC;AACjE,YAAM,SAAS,QAAQ,KAAK,CAACO,YAAWA,QAAO,WAAW,UAAU,CAAC;AACrE,UAAI,QAAQ;AACV,cAAM,QAAQ,OAAO,MAAM,GAAG,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG;AACjD,eAAO,QAAQ,mBAAmB,KAAK,IAAI;AAAA,MAC7C;AAAA,IACF;AAAA,EACF;AAEA,WAAS,iCAAiC,UAAU;AAClD,WAAO,SAAS,cAAc,OAAO,CAAC,SAAS;AAAA,EACjD;AAEA,WAAS,cAAc,aAAaR,YAAW;AAC7C,UAAM,oBAAoB,OAAO,YAAY,WAAW,WAAW,YAAY,SAAS;AAExF,QAAIA,YAAW,aAAa,YAAY,GAAG;AACzC,aAAOA,WAAU,aAAa,YAAY,KAAK;AAAA,IACjD,OAAO;AACL,aAAO,YAAY,aAAa,QAAQ,KAAK,qBAAqB;AAAA,IACpE;AAAA,EACF;AAEA,WAAS,UAAU,YAAY,aAAa;AAC1C,UAAM,SAAS,UAAU,UAAU;AAEnC,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO,SAAS;AAAA,IAClB;AAEA,WAAO;AAAA,EACT;AAEA,WAAS,UAAU,aAAaA,YAAW;AACzC,UAAM,SAASA,YAAW,aAAa,YAAY,KAAK,YAAY,aAAa,QAAQ,KAAK;AAC9F,WAAO,sBAAsB,OAAO,YAAY,CAAC,KAAK,YAAY;AAAA,EACpE;AAEA,WAAS,WAAW,aAAaA,YAAW;AAC1C,WAAO,uBAAuBA,YAAW,aAAa,aAAa,KAAK,YAAY,OAAO;AAAA,EAC7F;AAEA,MAAM,WAAN,MAAe;AAAA,IACb,YAAY,SAAS;AACnB,WAAK,UAAU;AAAA,IACjB;AAAA,IAEA,IAAI,gBAAgB;AAClB,aAAO,KAAK,QAAQ,cAAc;AAAA,IACpC;AAAA,IAEA,IAAI,WAAW;AACb,aAAO,CAAC,GAAG,KAAK,QAAQ,QAAQ;AAAA,IAClC;AAAA,IAEA,UAAU,QAAQ;AAChB,aAAO,KAAK,oBAAoB,MAAM,KAAK;AAAA,IAC7C;AAAA,IAEA,oBAAoB,QAAQ;AAC1B,aAAO,SAAS,KAAK,QAAQ,cAAc,QAAQ,MAAM,eAAe,MAAM,IAAI,IAAI;AAAA,IACxF;AAAA,IAEA,IAAI,cAAc;AAChB,aAAO,KAAK,QAAQ;AAAA,IACtB;AAAA,IAEA,IAAI,4BAA4B;AAC9B,aAAO,0BAA0B,KAAK,OAAO;AAAA,IAC/C;AAAA,IAEA,IAAI,oBAAoB;AACtB,aAAO,0BAA0B,KAAK,OAAO;AAAA,IAC/C;AAAA,IAEA,wBAAwB,IAAI;AAC1B,aAAO,wBAAwB,KAAK,SAAS,EAAE;AAAA,IACjD;AAAA,IAEA,kCAAkC,UAAU;AAC1C,YAAM,sBAAsB,CAAC;AAE7B,iBAAW,2BAA2B,KAAK,mBAAmB;AAC5D,cAAM,EAAE,GAAG,IAAI;AACf,cAAM,sBAAsB,SAAS,wBAAwB,EAAE;AAC/D,YAAI,qBAAqB;AACvB,8BAAoB,EAAE,IAAI,CAAC,yBAAyB,mBAAmB;AAAA,QACzE;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAAA,EACF;AAEA,WAAS,wBAAwB,MAAM,IAAI;AACzC,WAAO,KAAK,cAAc,IAAI,EAAE,wBAAwB;AAAA,EAC1D;AAEA,WAAS,0BAA0B,MAAM;AACvC,WAAO,KAAK,iBAAiB,4BAA4B;AAAA,EAC3D;AAEA,MAAM,qBAAN,MAAyB;AAAA,IACvB,UAAU;AAAA,IAEV,YAAY,UAAU,aAAa;AACjC,WAAK,WAAW;AAChB,WAAK,cAAc;AAAA,IACrB;AAAA,IAEA,QAAQ;AACN,UAAI,CAAC,KAAK,SAAS;AACjB,aAAK,YAAY,iBAAiB,UAAU,KAAK,gBAAgB,IAAI;AACrE,aAAK,UAAU;AAAA,MACjB;AAAA,IACF;AAAA,IAEA,OAAO;AACL,UAAI,KAAK,SAAS;AAChB,aAAK,YAAY,oBAAoB,UAAU,KAAK,gBAAgB,IAAI;AACxE,aAAK,UAAU;AAAA,MACjB;AAAA,IACF;AAAA,IAEA,iBAAiB,MAAM;AACrB,WAAK,YAAY,oBAAoB,UAAU,KAAK,eAAe,KAAK;AACxE,WAAK,YAAY,iBAAiB,UAAU,KAAK,eAAe,KAAK;AAAA,IACvE;AAAA,IAEA,gBAAgB,CAAC,UAAU;AACzB,UAAI,CAAC,MAAM,kBAAkB;AAC3B,cAAM,OAAO,MAAM,kBAAkB,kBAAkB,MAAM,SAAS;AACtE,cAAMA,aAAY,MAAM,aAAa;AAErC,YACE,QACA,+BAA+B,MAAMA,UAAS,KAC9C,8BAA8B,MAAMA,UAAS,KAC7C,KAAK,SAAS,eAAe,MAAMA,UAAS,GAC5C;AACA,gBAAM,eAAe;AACrB,gBAAM,yBAAyB;AAC/B,eAAK,SAAS,cAAc,MAAMA,UAAS;AAAA,QAC7C;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,WAAS,+BAA+B,MAAMA,YAAW;AACvD,UAAM,SAASA,YAAW,aAAa,YAAY,KAAK,KAAK,aAAa,QAAQ;AAElF,WAAO,UAAU;AAAA,EACnB;AAEA,WAAS,8BAA8B,MAAMA,YAAW;AACtD,UAAM,SAASA,YAAW,aAAa,YAAY,KAAK,KAAK,aAAa,QAAQ;AAElF,WAAO,oBAAoB,MAAM;AAAA,EACnC;AAEA,MAAM,OAAN,MAAW;AAAA,IACT,wBAAwB,CAAC,WAAW;AAAA,IAAC;AAAA,IACrC,8BAA8B,CAAC,WAAW;AAAA,IAAC;AAAA,IAE3C,YAAY,UAAU,SAAS;AAC7B,WAAK,WAAW;AAChB,WAAK,UAAU;AAAA,IACjB;AAAA;AAAA,IAIA,eAAe,QAAQ;AACrB,YAAM,UAAU,KAAK,SAAS,oBAAoB,MAAM;AACxD,UAAI,SAAS;AACX,aAAK,gBAAgB,OAAO;AAC5B,aAAK,aAAa,OAAO;AAAA,MAC3B,OAAO;AACL,aAAK,iBAAiB,EAAE,GAAG,GAAG,GAAG,EAAE,CAAC;AAAA,MACtC;AAAA,IACF;AAAA,IAEA,2BAA2BM,WAAU;AACnC,WAAK,eAAe,UAAUA,SAAQ,CAAC;AAAA,IACzC;AAAA,IAEA,gBAAgB,SAAS;AACvB,cAAQ,eAAe;AAAA,IACzB;AAAA,IAEA,aAAa,SAAS;AACpB,UAAI,mBAAmB,aAAa;AAClC,YAAI,QAAQ,aAAa,UAAU,GAAG;AACpC,kBAAQ,MAAM;AAAA,QAChB,OAAO;AACL,kBAAQ,aAAa,YAAY,IAAI;AACrC,kBAAQ,MAAM;AACd,kBAAQ,gBAAgB,UAAU;AAAA,QACpC;AAAA,MACF;AAAA,IACF;AAAA,IAEA,iBAAiB,EAAE,GAAG,EAAE,GAAG;AACzB,WAAK,WAAW,SAAS,GAAG,CAAC;AAAA,IAC/B;AAAA,IAEA,cAAc;AACZ,WAAK,iBAAiB,EAAE,GAAG,GAAG,GAAG,EAAE,CAAC;AAAA,IACtC;AAAA,IAEA,IAAI,aAAa;AACf,aAAO;AAAA,IACT;AAAA;AAAA,IAIA,MAAM,OAAO,UAAU;AACrB,YAAM,EAAE,WAAW,cAAc,YAAY,aAAa,SAAS,IAAI;AAIvE,YAAM,mBAAmB;AAEzB,UAAI,cAAc;AAChB,YAAI;AACF,eAAK,gBAAgB,IAAI,QAAQ,CAACJ,aAAa,KAAK,wBAAwBA,QAAQ;AACpF,eAAK,WAAW;AAChB,gBAAM,KAAK,wBAAwB,QAAQ;AAE3C,gBAAM,qBAAqB,IAAI,QAAQ,CAACA,aAAa,KAAK,8BAA8BA,QAAQ;AAChG,gBAAM,UAAU,EAAE,QAAQ,KAAK,6BAA6B,QAAQ,KAAK,SAAS,eAAe,cAAc,KAAK,SAAS,aAAa;AAC1I,gBAAM,kBAAkB,KAAK,SAAS,sBAAsB,UAAU,OAAO;AAC7E,cAAI,CAAC,gBAAiB,OAAM;AAE5B,gBAAM,KAAK,eAAe,QAAQ;AAClC,eAAK,SAAS,qBAAqB,UAAU,WAAW,KAAK,SAAS,YAAY;AAClF,eAAK,SAAS,0BAA0B,KAAK,OAAO;AACpD,eAAK,wBAAwB,QAAQ;AAAA,QACvC,UAAE;AACA,iBAAO,KAAK;AACZ,eAAK,sBAAsB,MAAS;AACpC,iBAAO,KAAK;AAAA,QACd;AAAA,MACF,WAAW,kBAAkB;AAC3B,aAAK,WAAW,SAAS,YAAY;AAAA,MACvC;AAAA,IACF;AAAA,IAEA,WAAW,QAAQ;AACjB,WAAK,SAAS,gBAAgB,MAAM;AAAA,IACtC;AAAA,IAEA,MAAM,wBAAwB,UAAU;AACtC,WAAK,cAAc,SAAS,SAAS;AACrC,YAAM,SAAS,gBAAgB;AAAA,IACjC;AAAA,IAEA,cAAc,WAAW;AACvB,UAAI,WAAW;AACb,aAAK,QAAQ,aAAa,sBAAsB,EAAE;AAAA,MACpD,OAAO;AACL,aAAK,QAAQ,gBAAgB,oBAAoB;AAAA,MACnD;AAAA,IACF;AAAA,IAEA,mBAAmB,WAAW;AAC5B,WAAK,QAAQ,aAAa,8BAA8B,SAAS;AAAA,IACnE;AAAA,IAEA,uBAAuB;AACrB,WAAK,QAAQ,gBAAgB,4BAA4B;AAAA,IAC3D;AAAA,IAEA,MAAM,eAAe,UAAU;AAC7B,YAAM,SAAS,OAAO;AAAA,IACxB;AAAA,IAEA,wBAAwB,UAAU;AAChC,eAAS,gBAAgB;AAAA,IAC3B;AAAA,EACF;AAEA,MAAM,YAAN,cAAwB,KAAK;AAAA,IAC3B,UAAU;AACR,WAAK,QAAQ,YAAY;AAAA,IAC3B;AAAA,IAEA,IAAI,WAAW;AACb,aAAO,IAAI,SAAS,KAAK,OAAO;AAAA,IAClC;AAAA,EACF;AAEA,MAAM,kBAAN,MAAsB;AAAA,IACpB,YAAY,UAAU,SAAS;AAC7B,WAAK,WAAW;AAChB,WAAK,UAAU;AAAA,IACjB;AAAA,IAEA,QAAQ;AACN,WAAK,QAAQ,iBAAiB,SAAS,KAAK,YAAY;AACxD,eAAS,iBAAiB,eAAe,KAAK,WAAW;AACzD,eAAS,iBAAiB,sBAAsB,KAAK,SAAS;AAAA,IAChE;AAAA,IAEA,OAAO;AACL,WAAK,QAAQ,oBAAoB,SAAS,KAAK,YAAY;AAC3D,eAAS,oBAAoB,eAAe,KAAK,WAAW;AAC5D,eAAS,oBAAoB,sBAAsB,KAAK,SAAS;AAAA,IACnE;AAAA,IAEA,eAAe,CAAC,UAAU;AACxB,UAAI,KAAK,wBAAwB,KAAK,GAAG;AACvC,aAAK,aAAa;AAAA,MACpB,OAAO;AACL,eAAO,KAAK;AAAA,MACd;AAAA,IACF;AAAA,IAEA,cAAc,CAAC,UAAU;AACvB,UAAI,KAAK,cAAc,KAAK,wBAAwB,KAAK,GAAG;AAC1D,YAAI,KAAK,SAAS,yBAAyB,MAAM,QAAQ,MAAM,OAAO,KAAK,MAAM,OAAO,aAAa,GAAG;AACtG,eAAK,WAAW,eAAe;AAC/B,gBAAM,eAAe;AACrB,eAAK,SAAS,qBAAqB,MAAM,QAAQ,MAAM,OAAO,KAAK,MAAM,OAAO,aAAa;AAAA,QAC/F;AAAA,MACF;AACA,aAAO,KAAK;AAAA,IACd;AAAA,IAEA,YAAY,CAAC,WAAW;AACtB,aAAO,KAAK;AAAA,IACd;AAAA,IAEA,wBAAwB,OAAO;AAC7B,YAAM,SAAS,MAAM,WAAW,MAAM,QAAQ,gBAAgB,MAAM;AACpE,YAAM,UAAU,wBAAwB,MAAM,KAAK;AAEnD,aAAO,mBAAmB,WAAW,QAAQ,QAAQ,mBAAmB,KAAK,KAAK;AAAA,IACpF;AAAA,EACF;AAEA,MAAM,oBAAN,MAAwB;AAAA,IACtB,UAAU;AAAA,IAEV,YAAY,UAAU,aAAa;AACjC,WAAK,WAAW;AAChB,WAAK,cAAc;AAAA,IACrB;AAAA,IAEA,QAAQ;AACN,UAAI,CAAC,KAAK,SAAS;AACjB,aAAK,YAAY,iBAAiB,SAAS,KAAK,eAAe,IAAI;AACnE,aAAK,UAAU;AAAA,MACjB;AAAA,IACF;AAAA,IAEA,OAAO;AACL,UAAI,KAAK,SAAS;AAChB,aAAK,YAAY,oBAAoB,SAAS,KAAK,eAAe,IAAI;AACtE,aAAK,UAAU;AAAA,MACjB;AAAA,IACF;AAAA,IAEA,gBAAgB,MAAM;AACpB,WAAK,YAAY,oBAAoB,SAAS,KAAK,cAAc,KAAK;AACtE,WAAK,YAAY,iBAAiB,SAAS,KAAK,cAAc,KAAK;AAAA,IACrE;AAAA,IAEA,eAAe,CAAC,UAAU;AACxB,UAAI,iBAAiB,cAAc,KAAK,wBAAwB,KAAK,GAAG;AACtE,cAAM,SAAU,MAAM,gBAAgB,MAAM,aAAa,EAAE,CAAC,KAAM,MAAM;AACxE,cAAM,OAAO,wBAAwB,MAAM;AAC3C,YAAI,QAAQ,oBAAoB,KAAK,MAAM,GAAG;AAC5C,gBAAMI,YAAW,mBAAmB,IAAI;AACxC,cAAI,KAAK,SAAS,yBAAyB,MAAMA,WAAU,KAAK,GAAG;AACjE,kBAAM,eAAe;AACrB,iBAAK,SAAS,uBAAuB,MAAMA,SAAQ;AAAA,UACrD;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,IAEA,wBAAwB,OAAO;AAC7B,aAAO,EACJ,MAAM,UAAU,MAAM,OAAO,qBAC9B,MAAM,oBACN,MAAM,QAAQ,KACd,MAAM,UACN,MAAM,WACN,MAAM,WACN,MAAM;AAAA,IAEV;AAAA,EACF;AAEA,MAAM,wBAAN,MAA4B;AAAA,IAC1B,YAAY,UAAU,SAAS;AAC7B,WAAK,WAAW;AAChB,WAAK,kBAAkB,IAAI,kBAAkB,MAAM,OAAO;AAAA,IAC5D;AAAA,IAEA,QAAQ;AACN,WAAK,gBAAgB,MAAM;AAAA,IAC7B;AAAA,IAEA,OAAO;AACL,WAAK,gBAAgB,KAAK;AAAA,IAC5B;AAAA;AAAA,IAIA,6BAA6B,MAAMA,WAAU;AAC3C,aAAO;AAAA,IACT;AAAA,IAEA,kCAAkC,MAAMA,WAAU;AAChD;AAAA,IACF;AAAA;AAAA,IAIA,yBAAyB,MAAMA,WAAU,eAAe;AACtD,aACE,KAAK,SAAS,6BAA6B,MAAMA,WAAU,aAAa,MACvE,KAAK,aAAa,mBAAmB,KAAK,KAAK,aAAa,mBAAmB;AAAA,IAEpF;AAAA,IAEA,uBAAuB,MAAMA,WAAU;AACrC,YAAM,OAAO,SAAS,cAAc,MAAM;AAE1C,YAAM,OAAO;AACb,iBAAW,CAACL,SAAM,KAAK,KAAKK,UAAS,cAAc;AACjD,aAAK,OAAO,OAAO,OAAO,SAAS,cAAc,OAAO,GAAG,EAAE,MAAM,MAAAL,SAAM,MAAM,CAAC,CAAC;AAAA,MACnF;AAEA,YAAM,SAAS,OAAO,OAAOK,WAAU,EAAE,QAAQ,GAAG,CAAC;AACrD,WAAK,aAAa,cAAc,MAAM;AACtC,WAAK,aAAa,UAAU,OAAO,IAAI;AACvC,WAAK,aAAa,UAAU,EAAE;AAE9B,YAAM,SAAS,KAAK,aAAa,mBAAmB;AACpD,UAAI,OAAQ,MAAK,aAAa,UAAU,MAAM;AAE9C,YAAM,aAAa,KAAK,aAAa,kBAAkB;AACvD,UAAI,WAAY,MAAK,aAAa,oBAAoB,UAAU;AAEhE,YAAM,cAAc,eAAe,IAAI;AACvC,UAAI,YAAa,MAAK,aAAa,qBAAqB,WAAW;AAEnE,YAAM,eAAe,KAAK,aAAa,oBAAoB;AAC3D,UAAI,aAAc,MAAK,aAAa,sBAAsB,YAAY;AAEtE,YAAM,cAAc,KAAK,aAAa,mBAAmB;AACzD,UAAI,YAAa,MAAK,aAAa,qBAAqB,EAAE;AAE1D,WAAK,SAAS,4BAA4B,MAAMA,WAAU,IAAI;AAE9D,eAAS,KAAK,YAAY,IAAI;AAC9B,WAAK,iBAAiB,oBAAoB,MAAM,KAAK,OAAO,GAAG,EAAE,MAAM,KAAK,CAAC;AAC7E,4BAAsB,MAAM,KAAK,cAAc,CAAC;AAAA,IAClD;AAAA,EACF;AAEA,MAAM,QAAN,MAAY;AAAA,IACV,aAAa,4BAA4B,UAAU,qBAAqB,UAAU;AAChF,YAAM,QAAQ,IAAI,KAAK,UAAU,mBAAmB;AACpD,YAAM,MAAM;AACZ,YAAM,SAAS;AACf,YAAM,MAAM;AAAA,IACd;AAAA,IAEA,YAAY,UAAU,qBAAqB;AACzC,WAAK,WAAW;AAChB,WAAK,sBAAsB;AAAA,IAC7B;AAAA,IAEA,QAAQ;AACN,iBAAW,MAAM,KAAK,qBAAqB;AACzC,cAAM,CAAC,yBAAyB,mBAAmB,IAAI,KAAK,oBAAoB,EAAE;AAClF,aAAK,SAAS,cAAc,yBAAyB,mBAAmB;AACxE,aAAK,0CAA0C,mBAAmB;AAAA,MACpE;AAAA,IACF;AAAA,IAEA,QAAQ;AACN,iBAAW,MAAM,KAAK,qBAAqB;AACzC,cAAM,CAAC,uBAAuB,IAAI,KAAK,oBAAoB,EAAE;AAC7D,aAAK,wCAAwC,uBAAuB;AACpE,aAAK,uCAAuC,uBAAuB;AACnE,aAAK,SAAS,aAAa,uBAAuB;AAAA,MACpD;AAAA,IACF;AAAA,IAEA,0CAA0C,kBAAkB;AAC1D,YAAM,cAAc,qCAAqC,gBAAgB;AACzE,uBAAiB,YAAY,WAAW;AAAA,IAC1C;AAAA,IAEA,wCAAwC,kBAAkB;AACxD,YAAMG,SAAQ,iBAAiB,UAAU,IAAI;AAC7C,uBAAiB,YAAYA,MAAK;AAAA,IACpC;AAAA,IAEA,uCAAuC,kBAAkB;AACvD,YAAM,cAAc,KAAK,mBAAmB,iBAAiB,EAAE;AAC/D,mBAAa,YAAY,gBAAgB;AAAA,IAC3C;AAAA,IAEA,mBAAmB,IAAI;AACrB,aAAO,KAAK,aAAa,KAAK,CAAC,YAAY,QAAQ,WAAW,EAAE;AAAA,IAClE;AAAA,IAEA,IAAI,eAAe;AACjB,aAAO,CAAC,GAAG,SAAS,iBAAiB,iDAAiD,CAAC;AAAA,IACzF;AAAA,EACF;AAEA,WAAS,qCAAqC,kBAAkB;AAC9D,UAAM,UAAU,SAAS,cAAc,MAAM;AAC7C,YAAQ,aAAa,QAAQ,6BAA6B;AAC1D,YAAQ,aAAa,WAAW,iBAAiB,EAAE;AACnD,WAAO;AAAA,EACT;AAEA,MAAM,WAAN,MAAe;AAAA,IACb,iBAAiB;AAAA,IAEjB,OAAO,cAAc,gBAAgB,YAAY;AAAA,IAEjD;AAAA,IAEA,YAAY,iBAAiB,aAAa,WAAW,aAAa,MAAM;AACtE,WAAK,kBAAkB;AACvB,WAAK,cAAc;AACnB,WAAK,YAAY;AACjB,WAAK,aAAa;AAClB,WAAK,gBAAgB,KAAK,YAAY;AACtC,WAAK,UAAU,IAAI,QAAQ,CAACP,UAAS,WAAY,KAAK,qBAAqB,EAAE,SAAAA,UAAS,OAAO,CAAE;AAAA,IACjG;AAAA,IAEA,IAAI,eAAe;AACjB,aAAO;AAAA,IACT;AAAA,IAEA,IAAI,kBAAkB;AACpB,aAAO;AAAA,IACT;AAAA,IAEA,IAAI,eAAe;AACjB;AAAA,IACF;AAAA,IAEA,kBAAkB;AAChB;AAAA,IACF;AAAA,IAEA,SAAS;AAAA,IAET;AAAA,IAEA,kBAAkB;AAChB,UAAI,KAAK,oBAAoB;AAC3B,aAAK,mBAAmB,QAAQ;AAChC,eAAO,KAAK;AAAA,MACd;AAAA,IACF;AAAA,IAEA,MAAM,4BAA4B,UAAU;AAC1C,YAAM,MAAM,4BAA4B,MAAM,KAAK,qBAAqB,QAAQ;AAAA,IAClF;AAAA,IAEA,iCAAiC;AAC/B,UAAI,KAAK,iBAAiB;AACxB,cAAM,UAAU,KAAK,kBAAkB;AACvC,YAAI,SAAS;AACX,kBAAQ,MAAM;AAAA,QAChB;AAAA,MACF;AAAA,IACF;AAAA;AAAA,IAIA,cAAc,yBAAyB;AACrC,UAAI,KAAK,eAAgB;AAEzB,UAAI,wBAAwB,SAAS,KAAK,gBAAgB,aAAa,GAAG;AACxE,aAAK,iBAAiB,KAAK,gBAAgB;AAAA,MAC7C;AAAA,IACF;AAAA,IAEA,aAAa,yBAAyB;AACpC,UAAI,wBAAwB,SAAS,KAAK,cAAc,KAAK,KAAK,0BAA0B,aAAa;AACvG,aAAK,eAAe,MAAM;AAE1B,aAAK,iBAAiB;AAAA,MACxB;AAAA,IACF;AAAA,IAEA,IAAI,oBAAoB;AACtB,aAAO,KAAK,YAAY,cAAc,KAAK,cAAc,KAAK;AAAA,IAChE;AAAA,IAEA,IAAI,iBAAiB;AACnB,aAAO,KAAK,gBAAgB;AAAA,IAC9B;AAAA,IAEA,IAAI,aAAa;AACf,aAAO,KAAK,YAAY;AAAA,IAC1B;AAAA,IAEA,IAAI,sBAAsB;AACxB,aAAO,KAAK,gBAAgB,kCAAkC,KAAK,WAAW;AAAA,IAChF;AAAA,IAEA,IAAI,eAAe;AACjB,aAAO;AAAA,IACT;AAAA,EACF;AAEA,MAAM,gBAAN,cAA4B,SAAS;AAAA,IACnC,OAAO,cAAc,gBAAgB,YAAY;AAC/C,YAAM,mBAAmB,SAAS,YAAY;AAC9C,uBAAiB,mBAAmB,cAAc;AAClD,uBAAiB,eAAe;AAEhC,YAAM,eAAe;AACrB,YAAM,cAAc,aAAa,eAAe,YAAY;AAC5D,UAAI,aAAa;AACf,oBAAY,mBAAmB,YAAY;AAC3C,uBAAe,YAAY,YAAY,gBAAgB,CAAC;AAAA,MAC1D;AAAA,IACF;AAAA,IAEA,YAAY,UAAU,iBAAiB,aAAa,eAAe,WAAW,aAAa,MAAM;AAC/F,YAAM,iBAAiB,aAAa,eAAe,WAAW,UAAU;AACxE,WAAK,WAAW;AAAA,IAClB;AAAA,IAEA,IAAI,eAAe;AACjB,aAAO;AAAA,IACT;AAAA,IAEA,MAAM,SAAS;AACb,YAAM,YAAY;AAClB,WAAK,4BAA4B,MAAM;AACrC,aAAK,iBAAiB;AAAA,MACxB,CAAC;AACD,WAAK,oBAAoB;AACzB,YAAM,YAAY;AAClB,WAAK,+BAA+B;AACpC,YAAM,YAAY;AAClB,WAAK,uBAAuB;AAAA,IAC9B;AAAA,IAEA,mBAAmB;AACjB,WAAK,SAAS,gBAAgB,KAAK,gBAAgB,KAAK,UAAU;AAClE,WAAK,cAAc,KAAK,gBAAgB,KAAK,UAAU;AAAA,IACzD;AAAA,IAEA,sBAAsB;AACpB,UAAI,KAAK,eAAe,cAAc,KAAK,WAAW,YAAY;AAChE,cAAM,UAAU,KAAK,eAAe;AACpC,cAAM,QAAQ,0BAA0B,KAAK,eAAe,aAAa,uBAAuB,GAAG,KAAK;AACxG,cAAM,WAAW,mBAAmB,KAAK,eAAe,aAAa,0BAA0B,GAAG,MAAM;AAExG,YAAI,SAAS;AACX,kBAAQ,eAAe,EAAE,OAAO,SAAS,CAAC;AAC1C,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,IAEA,yBAAyB;AACvB,iBAAW,sBAAsB,KAAK,mBAAmB;AACvD,cAAM,yBAAyB,sBAAsB,kBAAkB;AACvE,2BAAmB,YAAY,sBAAsB;AAAA,MACvD;AAAA,IACF;AAAA,IAEA,IAAI,oBAAoB;AACtB,aAAO,KAAK,eAAe,iBAAiB,QAAQ;AAAA,IACtD;AAAA,EACF;AAEA,WAAS,0BAA0B,OAAO,cAAc;AACtD,QAAI,SAAS,SAAS,SAAS,WAAW,SAAS,YAAY,SAAS,WAAW;AACjF,aAAO;AAAA,IACT,OAAO;AACL,aAAO;AAAA,IACT;AAAA,EACF;AAEA,WAAS,mBAAmB,OAAO,cAAc;AAC/C,QAAI,SAAS,UAAU,SAAS,UAAU;AACxC,aAAO;AAAA,IACT,OAAO;AACL,aAAO;AAAA,IACT;AAAA,EACF;AAkGA,MAAI,YAAa,WAAY;AAuB3B,UAAM,OAAO,MAAM;AAAA,IAAC;AAKpB,UAAMQ,YAAW;AAAA,MACf,YAAY;AAAA,MACZ,WAAW;AAAA,QACT,iBAAiB;AAAA,QACjB,gBAAgB;AAAA,QAChB,mBAAmB;AAAA,QACnB,kBAAkB;AAAA,QAClB,mBAAmB;AAAA,QACnB,kBAAkB;AAAA,QAClB,wBAAwB;AAAA,MAC1B;AAAA,MACA,MAAM;AAAA,QACJ,OAAO;AAAA,QACP,gBAAgB,CAAC,QAAQ,IAAI,aAAa,aAAa,MAAM;AAAA,QAC7D,gBAAgB,CAAC,QAAQ,IAAI,aAAa,cAAc,MAAM;AAAA,QAC9D,cAAc;AAAA,QACd,kBAAkB;AAAA,MACpB;AAAA,MACA,cAAc;AAAA,IAChB;AAUA,aAAS,MAAM,SAAS,YAAYL,UAAS,CAAC,GAAG;AAC/C,gBAAU,iBAAiB,OAAO;AAClC,YAAM,UAAU,gBAAgB,UAAU;AAC1C,YAAM,MAAM,mBAAmB,SAAS,SAASA,OAAM;AAEvD,YAAM,eAAe,oBAAoB,KAAK,MAAM;AAClD,eAAO;AAAA,UACL;AAAA,UACA;AAAA,UACA;AAAA;AAAA,UACiC,CAACM,SAAQ;AACxC,gBAAIA,KAAI,eAAe,aAAa;AAClC,cAAAC,eAAcD,MAAK,SAAS,OAAO;AACnC,qBAAO,MAAM,KAAK,QAAQ,UAAU;AAAA,YACtC,OAAO;AACL,qBAAO,eAAeA,MAAK,SAAS,OAAO;AAAA,YAC7C;AAAA,UACF;AAAA,QACF;AAAA,MACF,CAAC;AAED,UAAI,OAAO,OAAO;AAClB,aAAO;AAAA,IACT;AAUA,aAAS,eAAe,KAAK,SAAS,SAAS;AAC7C,YAAM,YAAY,gBAAgB,OAAO;AAIzC,UAAI,aAAa,MAAM,KAAK,UAAU,UAAU;AAChD,YAAME,SAAQ,WAAW,QAAQ,OAAO;AAExC,YAAM,cAAc,WAAW,UAAUA,SAAQ;AAEjD,MAAAD;AAAA,QACE;AAAA,QACA;AAAA,QACA;AAAA;AAAA,QAEA;AAAA;AAAA,QACA,QAAQ;AAAA;AAAA,MACV;AAGA,mBAAa,MAAM,KAAK,UAAU,UAAU;AAC5C,aAAO,WAAW,MAAMC,QAAO,WAAW,SAAS,WAAW;AAAA,IAChE;AAOA,aAAS,oBAAoB,KAAK,IAAI;AACpC,UAAI,CAAC,IAAI,OAAO,aAAc,QAAO,GAAG;AACxC,UAAI;AAAA;AAAA,QAEA,SAAS;AAAA;AAIb,UACE,EACE,yBAAyB,oBACzB,yBAAyB,sBAE3B;AACA,eAAO,GAAG;AAAA,MACZ;AAEA,YAAM,EAAE,IAAI,iBAAiB,gBAAgB,aAAa,IAAI;AAE9D,YAAM,UAAU,GAAG;AAEnB,UAAI,mBAAmB,oBAAoB,SAAS,eAAe,IAAI;AACrE,wBAAgB,IAAI,OAAO,cAAc,IAAI,eAAe,EAAE;AAC9D,uBAAe,MAAM;AAAA,MACvB;AACA,UAAI,iBAAiB,CAAC,cAAc,gBAAgB,cAAc;AAChE,sBAAc,kBAAkB,gBAAgB,YAAY;AAAA,MAC9D;AAEA,aAAO;AAAA,IACT;AAEA,UAAMD,iBAAiB,2BAAY;AA2BjC,eAASA,eACP,KACA,WACA,WACA,iBAAiB,MACjB,WAAW,MACX;AAEA,YACE,qBAAqB,uBACrB,qBAAqB,qBACrB;AAEA,sBAAY,UAAU;AAEtB,sBAAY,UAAU;AAAA,QACxB;AACA,2BAAmB,UAAU;AAG7B,mBAAW,YAAY,UAAU,YAAY;AAE3C,cAAI,kBAAkB,kBAAkB,UAAU;AAChD,kBAAM,YAAY;AAAA,cAChB;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AACA,gBAAI,WAAW;AAEb,kBAAI,cAAc,gBAAgB;AAChC,mCAAmB,KAAK,gBAAgB,SAAS;AAAA,cACnD;AACA,wBAAU,WAAW,UAAU,GAAG;AAClC,+BAAiB,UAAU;AAC3B;AAAA,YACF;AAAA,UACF;AAGA,cAAI,oBAAoB,WAAW,IAAI,cAAc,IAAI,SAAS,EAAE,GAAG;AAErE,kBAAM,aAAa;AAAA,cACjB;AAAA,cACA,SAAS;AAAA,cACT;AAAA,cACA;AAAA,YACF;AACA,sBAAU,YAAY,UAAU,GAAG;AACnC,6BAAiB,WAAW;AAC5B;AAAA,UACF;AAGA,gBAAM,eAAeE;AAAA,YACnB;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,UACF;AAEA,cAAI,cAAc;AAChB,6BAAiB,aAAa;AAAA,UAChC;AAAA,QACF;AAGA,eAAO,kBAAkB,kBAAkB,UAAU;AACnD,gBAAM,WAAW;AACjB,2BAAiB,eAAe;AAChC,qBAAW,KAAK,QAAQ;AAAA,QAC1B;AAAA,MACF;AAYA,eAASA,YAAW,WAAW,UAAU,gBAAgB,KAAK;AAC5D,YAAI,IAAI,UAAU,gBAAgB,QAAQ,MAAM,MAAO,QAAO;AAC9D,YAAI,IAAI,MAAM,IAAI,QAAQ,GAAG;AAE3B,gBAAM,gBAAgB,SAAS;AAAA;AAAA,YACL,SAAU;AAAA,UACpC;AACA,oBAAU,aAAa,eAAe,cAAc;AACpD,oBAAU,eAAe,UAAU,GAAG;AACtC,cAAI,UAAU,eAAe,aAAa;AAC1C,iBAAO;AAAA,QACT,OAAO;AAEL,gBAAM,iBAAiB,SAAS,WAAW,UAAU,IAAI;AACzD,oBAAU,aAAa,gBAAgB,cAAc;AACrD,cAAI,UAAU,eAAe,cAAc;AAC3C,iBAAO;AAAA,QACT;AAAA,MACF;AAKA,YAAM,gBAAiB,2BAAY;AAWjC,iBAASC,eAAc,KAAK,MAAM,YAAY,UAAU;AACtD,cAAI,YAAY;AAChB,cAAI,cAAc,KAAK;AACvB,cAAI,wBAAwB;AAE5B,cAAI,SAAS;AACb,iBAAO,UAAU,UAAU,UAAU;AAEnC,gBAAI,YAAY,QAAQ,IAAI,GAAG;AAC7B,kBAAI,aAAa,KAAK,QAAQ,IAAI,GAAG;AACnC,uBAAO;AAAA,cACT;AAGA,kBAAI,cAAc,MAAM;AAEtB,oBAAI,CAAC,IAAI,MAAM,IAAI,MAAM,GAAG;AAE1B,8BAAY;AAAA,gBACd;AAAA,cACF;AAAA,YACF;AACA,gBACE,cAAc,QACd,eACA,YAAY,QAAQ,WAAW,GAC/B;AAGA;AACA,4BAAc,YAAY;AAK1B,kBAAI,yBAAyB,GAAG;AAC9B,4BAAY;AAAA,cACd;AAAA,YACF;AAIA,gBAAI,OAAO,SAAS,SAAS,aAAa,EAAG;AAE7C,qBAAS,OAAO;AAAA,UAClB;AAEA,iBAAO,aAAa;AAAA,QACtB;AASA,iBAAS,aAAa,KAAK,SAAS,SAAS;AAC3C,cAAI,SAAS,IAAI,MAAM,IAAI,OAAO;AAClC,cAAI,SAAS,IAAI,MAAM,IAAI,OAAO;AAElC,cAAI,CAAC,UAAU,CAAC,OAAQ,QAAO;AAE/B,qBAAW,MAAM,QAAQ;AAKvB,gBAAI,OAAO,IAAI,EAAE,GAAG;AAClB,qBAAO;AAAA,YACT;AAAA,UACF;AACA,iBAAO;AAAA,QACT;AAQA,iBAAS,YAAY,SAAS,SAAS;AAErC,gBAAM;AAAA;AAAA,YAAiC;AAAA;AACvC,gBAAM;AAAA;AAAA,YAAiC;AAAA;AAEvC,iBACE,OAAO,aAAa,OAAO,YAC3B,OAAO,YAAY,OAAO;AAAA;AAAA;AAAA,WAIzB,CAAC,OAAO,MAAM,OAAO,OAAO,OAAO;AAAA,QAExC;AAEA,eAAOA;AAAA,MACT,EAAG;AAaH,eAAS,WAAW,KAAK,MAAM;AAE7B,YAAI,IAAI,MAAM,IAAI,IAAI,GAAG;AAEvB,qBAAW,IAAI,QAAQ,MAAM,IAAI;AAAA,QACnC,OAAO;AAEL,cAAI,IAAI,UAAU,kBAAkB,IAAI,MAAM,MAAO;AACrD,eAAK,YAAY,YAAY,IAAI;AACjC,cAAI,UAAU,iBAAiB,IAAI;AAAA,QACrC;AAAA,MACF;AASA,eAAS,mBAAmB,KAAK,gBAAgB,cAAc;AAE7D,YAAI,SAAS;AAEb,eAAO,UAAU,WAAW,cAAc;AACxC,cAAI;AAAA;AAAA,YAAgC;AAAA;AACpC,mBAAS,OAAO;AAChB,qBAAW,KAAK,QAAQ;AAAA,QAC1B;AACA,eAAO;AAAA,MACT;AAYA,eAAS,eAAe,YAAY,IAAI,OAAO,KAAK;AAClD,cAAM;AAAA;AAAA,UAGF,IAAI,OAAO,cAAc,IAAI,EAAE,EAAE,KAC/B,IAAI,OAAO,cAAc,IAAI,EAAE,EAAE;AAAA;AAEvC,yCAAiC,QAAQ,GAAG;AAC5C,mBAAW,YAAY,QAAQ,KAAK;AACpC,eAAO;AAAA,MACT;AAUA,eAAS,iCAAiC,SAAS,KAAK;AACtD,cAAM,KAAK,QAAQ;AAEnB,eAAQ,UAAU,QAAQ,YAAa;AACrC,cAAI,QAAQ,IAAI,MAAM,IAAI,OAAO;AACjC,cAAI,OAAO;AACT,kBAAM,OAAO,EAAE;AACf,gBAAI,CAAC,MAAM,MAAM;AACf,kBAAI,MAAM,OAAO,OAAO;AAAA,YAC1B;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAYA,eAAS,WAAW,YAAY,SAAS,OAAO;AAE9C,YAAI,WAAW,YAAY;AACzB,cAAI;AAEF,uBAAW,WAAW,SAAS,KAAK;AAAA,UACtC,SAASC,IAAG;AAEV,uBAAW,aAAa,SAAS,KAAK;AAAA,UACxC;AAAA,QACF,OAAO;AACL,qBAAW,aAAa,SAAS,KAAK;AAAA,QACxC;AAAA,MACF;AAEA,aAAOJ;AAAA,IACT,EAAG;AAKH,UAAM,YAAa,2BAAY;AAO7B,eAASK,WAAU,SAAS,YAAY,KAAK;AAC3C,YAAI,IAAI,gBAAgB,YAAY,SAAS,eAAe;AAE1D,iBAAO;AAAA,QACT;AAEA,YAAI,IAAI,UAAU,kBAAkB,SAAS,UAAU,MAAM,OAAO;AAClE,iBAAO;AAAA,QACT;AAEA,YAAI,mBAAmB,mBAAmB,IAAI,KAAK,OAAQ;AAAA,iBACzD,mBAAmB,mBACnB,IAAI,KAAK,UAAU,SACnB;AAEA;AAAA,YACE;AAAA;AAAA,YACgC;AAAA,YAChC;AAAA,UACF;AAAA,QACF,OAAO;AACL,0BAAgB,SAAS,YAAY,GAAG;AACxC,cAAI,CAAC,2BAA2B,SAAS,GAAG,GAAG;AAE7C,YAAAL,eAAc,KAAK,SAAS,UAAU;AAAA,UACxC;AAAA,QACF;AACA,YAAI,UAAU,iBAAiB,SAAS,UAAU;AAClD,eAAO;AAAA,MACT;AAUA,eAAS,gBAAgB,SAAS,SAAS,KAAK;AAC9C,YAAI,OAAO,QAAQ;AAInB,YAAI,SAAS,GAAsB;AACjC,gBAAM;AAAA;AAAA,YAAiC;AAAA;AACvC,gBAAM;AAAA;AAAA,YAAiC;AAAA;AAEvC,gBAAM,gBAAgB,OAAO;AAC7B,gBAAM,gBAAgB,OAAO;AAC7B,qBAAW,gBAAgB,eAAe;AACxC,gBAAI,gBAAgB,aAAa,MAAM,QAAQ,UAAU,GAAG,GAAG;AAC7D;AAAA,YACF;AACA,gBAAI,OAAO,aAAa,aAAa,IAAI,MAAM,aAAa,OAAO;AACjE,qBAAO,aAAa,aAAa,MAAM,aAAa,KAAK;AAAA,YAC3D;AAAA,UACF;AAEA,mBAASR,KAAI,cAAc,SAAS,GAAG,KAAKA,IAAGA,MAAK;AAClD,kBAAM,eAAe,cAAcA,EAAC;AAIpC,gBAAI,CAAC,aAAc;AAEnB,gBAAI,CAAC,OAAO,aAAa,aAAa,IAAI,GAAG;AAC3C,kBAAI,gBAAgB,aAAa,MAAM,QAAQ,UAAU,GAAG,GAAG;AAC7D;AAAA,cACF;AACA,qBAAO,gBAAgB,aAAa,IAAI;AAAA,YAC1C;AAAA,UACF;AAEA,cAAI,CAAC,2BAA2B,QAAQ,GAAG,GAAG;AAC5C,2BAAe,QAAQ,QAAQ,GAAG;AAAA,UACpC;AAAA,QACF;AAGA,YAAI,SAAS,KAAmB,SAAS,GAAc;AACrD,cAAI,QAAQ,cAAc,QAAQ,WAAW;AAC3C,oBAAQ,YAAY,QAAQ;AAAA,UAC9B;AAAA,QACF;AAAA,MACF;AAYA,eAAS,eAAe,YAAY,YAAY,KAAK;AACnD,YACE,sBAAsB,oBACtB,sBAAsB,oBACtB,WAAW,SAAS,QACpB;AACA,cAAI,WAAW,WAAW;AAC1B,cAAI,WAAW,WAAW;AAG1B,+BAAqB,YAAY,YAAY,WAAW,GAAG;AAC3D,+BAAqB,YAAY,YAAY,YAAY,GAAG;AAE5D,cAAI,CAAC,WAAW,aAAa,OAAO,GAAG;AACrC,gBAAI,CAAC,gBAAgB,SAAS,YAAY,UAAU,GAAG,GAAG;AACxD,yBAAW,QAAQ;AACnB,yBAAW,gBAAgB,OAAO;AAAA,YACpC;AAAA,UACF,WAAW,aAAa,UAAU;AAChC,gBAAI,CAAC,gBAAgB,SAAS,YAAY,UAAU,GAAG,GAAG;AACxD,yBAAW,aAAa,SAAS,QAAQ;AACzC,yBAAW,QAAQ;AAAA,YACrB;AAAA,UACF;AAAA,QAGF,WACE,sBAAsB,qBACtB,sBAAsB,mBACtB;AACA,+BAAqB,YAAY,YAAY,YAAY,GAAG;AAAA,QAC9D,WACE,sBAAsB,uBACtB,sBAAsB,qBACtB;AACA,cAAI,WAAW,WAAW;AAC1B,cAAI,WAAW,WAAW;AAC1B,cAAI,gBAAgB,SAAS,YAAY,UAAU,GAAG,GAAG;AACvD;AAAA,UACF;AACA,cAAI,aAAa,UAAU;AACzB,uBAAW,QAAQ;AAAA,UACrB;AACA,cACE,WAAW,cACX,WAAW,WAAW,cAAc,UACpC;AACA,uBAAW,WAAW,YAAY;AAAA,UACpC;AAAA,QACF;AAAA,MACF;AAQA,eAAS,qBAAqB,YAAY,YAAY,eAAe,KAAK;AAExE,cAAM,eAAe,WAAW,aAAa,GAE3C,eAAe,WAAW,aAAa;AACzC,YAAI,iBAAiB,cAAc;AACjC,gBAAM,eAAe;AAAA,YACnB;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,UACF;AACA,cAAI,CAAC,cAAc;AAGjB,uBAAW,aAAa,IAAI,WAAW,aAAa;AAAA,UACtD;AACA,cAAI,cAAc;AAChB,gBAAI,CAAC,cAAc;AAGjB,yBAAW,aAAa,eAAe,EAAE;AAAA,YAC3C;AAAA,UACF,OAAO;AACL,gBAAI,CAAC,gBAAgB,eAAe,YAAY,UAAU,GAAG,GAAG;AAC9D,yBAAW,gBAAgB,aAAa;AAAA,YAC1C;AAAA,UACF;AAAA,QACF;AAAA,MACF;AASA,eAAS,gBAAgB,MAAM,SAAS,YAAY,KAAK;AACvD,YACE,SAAS,WACT,IAAI,qBACJ,YAAY,SAAS,eACrB;AACA,iBAAO;AAAA,QACT;AACA,eACE,IAAI,UAAU,uBAAuB,MAAM,SAAS,UAAU,MAC9D;AAAA,MAEJ;AAOA,eAAS,2BAA2B,uBAAuB,KAAK;AAC9D,eACE,CAAC,CAAC,IAAI,qBACN,0BAA0B,SAAS,iBACnC,0BAA0B,SAAS;AAAA,MAEvC;AAEA,aAAOa;AAAA,IACT,EAAG;AAYH,aAAS,iBAAiB,KAAK,SAAS,SAAS,UAAU;AACzD,UAAI,IAAI,KAAK,OAAO;AAClB,cAAM,UAAU,QAAQ,cAAc,MAAM;AAC5C,cAAM,UAAU,QAAQ,cAAc,MAAM;AAC5C,YAAI,WAAW,SAAS;AACtB,gBAAM,WAAW,kBAAkB,SAAS,SAAS,GAAG;AAExD,iBAAO,QAAQ,IAAI,QAAQ,EAAE,KAAK,MAAM;AACtC,kBAAM,SAAS,OAAO,OAAO,KAAK;AAAA,cAChC,MAAM;AAAA,gBACJ,OAAO;AAAA,gBACP,QAAQ;AAAA,cACV;AAAA,YACF,CAAC;AACD,mBAAO,SAAS,MAAM;AAAA,UACxB,CAAC;AAAA,QACH;AAAA,MACF;AAEA,aAAO,SAAS,GAAG;AAAA,IACrB;AAUA,aAAS,kBAAkB,SAAS,SAAS,KAAK;AAChD,UAAI,QAAQ,CAAC;AACb,UAAI,UAAU,CAAC;AACf,UAAI,YAAY,CAAC;AACjB,UAAI,gBAAgB,CAAC;AAGrB,UAAI,oBAAoB,oBAAI,IAAI;AAChC,iBAAW,gBAAgB,QAAQ,UAAU;AAC3C,0BAAkB,IAAI,aAAa,WAAW,YAAY;AAAA,MAC5D;AAGA,iBAAW,kBAAkB,QAAQ,UAAU;AAE7C,YAAI,eAAe,kBAAkB,IAAI,eAAe,SAAS;AACjE,YAAI,eAAe,IAAI,KAAK,eAAe,cAAc;AACzD,YAAI,cAAc,IAAI,KAAK,eAAe,cAAc;AACxD,YAAI,gBAAgB,aAAa;AAC/B,cAAI,cAAc;AAEhB,oBAAQ,KAAK,cAAc;AAAA,UAC7B,OAAO;AAGL,8BAAkB,OAAO,eAAe,SAAS;AACjD,sBAAU,KAAK,cAAc;AAAA,UAC/B;AAAA,QACF,OAAO;AACL,cAAI,IAAI,KAAK,UAAU,UAAU;AAG/B,gBAAI,cAAc;AAChB,sBAAQ,KAAK,cAAc;AAC3B,4BAAc,KAAK,cAAc;AAAA,YACnC;AAAA,UACF,OAAO;AAEL,gBAAI,IAAI,KAAK,aAAa,cAAc,MAAM,OAAO;AACnD,sBAAQ,KAAK,cAAc;AAAA,YAC7B;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAIA,oBAAc,KAAK,GAAG,kBAAkB,OAAO,CAAC;AAEhD,UAAI,WAAW,CAAC;AAChB,iBAAW,WAAW,eAAe;AAEnC,YAAI;AAAA;AAAA,UACF,SAAS,YAAY,EAAE,yBAAyB,QAAQ,SAAS,EAC9D;AAAA;AAEL,YAAI,IAAI,UAAU,gBAAgB,MAAM,MAAM,OAAO;AACnD,cACG,UAAU,UAAU,OAAO,QAC3B,SAAS,UAAU,OAAO,KAC3B;AACsC,gBAAIf;AAC1C,gBAAI,UAAU,IAAI,QAAQ,SAAU,UAAU;AAC5C,cAAAA,WAAU;AAAA,YACZ,CAAC;AACD,mBAAO,iBAAiB,QAAQ,WAAY;AAC1C,cAAAA,SAAQ;AAAA,YACV,CAAC;AACD,qBAAS,KAAK,OAAO;AAAA,UACvB;AACA,kBAAQ,YAAY,MAAM;AAC1B,cAAI,UAAU,eAAe,MAAM;AACnC,gBAAM,KAAK,MAAM;AAAA,QACnB;AAAA,MACF;AAIA,iBAAW,kBAAkB,SAAS;AACpC,YAAI,IAAI,UAAU,kBAAkB,cAAc,MAAM,OAAO;AAC7D,kBAAQ,YAAY,cAAc;AAClC,cAAI,UAAU,iBAAiB,cAAc;AAAA,QAC/C;AAAA,MACF;AAEA,UAAI,KAAK,iBAAiB,SAAS;AAAA,QACjC;AAAA,QACA,MAAM;AAAA,QACN;AAAA,MACF,CAAC;AACD,aAAO;AAAA,IACT;AAKA,UAAM,qBAAsB,2BAAY;AAQtC,eAASgB,oBAAmB,SAAS,YAAYb,SAAQ;AACvD,cAAM,EAAE,eAAe,MAAM,IAAI,aAAa,SAAS,UAAU;AAEjE,cAAM,eAAe,cAAcA,OAAM;AACzC,cAAM,aAAa,aAAa,cAAc;AAC9C,YAAI,CAAC,CAAC,aAAa,WAAW,EAAE,SAAS,UAAU,GAAG;AACpD,gBAAM,wCAAwC,UAAU;AAAA,QAC1D;AAEA,eAAO;AAAA,UACL,QAAQ;AAAA,UACR;AAAA,UACA,QAAQ;AAAA,UACR;AAAA,UACA,cAAc,aAAa;AAAA,UAC3B,mBAAmB,aAAa;AAAA,UAChC,cAAc,aAAa;AAAA,UAC3B;AAAA,UACA;AAAA,UACA,QAAQ,aAAa;AAAA,UACrB,WAAW,aAAa;AAAA,UACxB,MAAM,aAAa;AAAA,QACrB;AAAA,MACF;AAQA,eAAS,cAAcA,SAAQ;AAC7B,YAAI,cAAc,OAAO,OAAO,CAAC,GAAGK,SAAQ;AAG5C,eAAO,OAAO,aAAaL,OAAM;AAGjC,oBAAY,YAAY,OAAO;AAAA,UAC7B,CAAC;AAAA,UACDK,UAAS;AAAA,UACTL,QAAO;AAAA,QACT;AAGA,oBAAY,OAAO,OAAO,OAAO,CAAC,GAAGK,UAAS,MAAML,QAAO,IAAI;AAE/D,eAAO;AAAA,MACT;AAKA,eAAS,eAAe;AACtB,cAAM,SAAS,SAAS,cAAc,KAAK;AAC3C,eAAO,SAAS;AAChB,iBAAS,KAAK,sBAAsB,YAAY,MAAM;AACtD,eAAO;AAAA,MACT;AAQA,eAAS,eAAe,MAAM;AAC5B,YAAI,WAAW,MAAM,KAAK,KAAK,iBAAiB,MAAM,CAAC;AACvD,YAAI,KAAK,IAAI;AACX,mBAAS,KAAK,IAAI;AAAA,QACpB;AACA,eAAO;AAAA,MACT;AAaA,eAAS,sBAAsB,OAAO,eAAe,MAAM,UAAU;AACnE,mBAAW,OAAO,UAAU;AAC1B,cAAI,cAAc,IAAI,IAAI,EAAE,GAAG;AAE7B,gBAAI,UAAU;AAGd,mBAAO,SAAS;AACd,kBAAI,QAAQ,MAAM,IAAI,OAAO;AAE7B,kBAAI,SAAS,MAAM;AACjB,wBAAQ,oBAAI,IAAI;AAChB,sBAAM,IAAI,SAAS,KAAK;AAAA,cAC1B;AACA,oBAAM,IAAI,IAAI,EAAE;AAEhB,kBAAI,YAAY,KAAM;AACtB,wBAAU,QAAQ;AAAA,YACpB;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAYA,eAAS,aAAa,YAAY,YAAY;AAC5C,cAAM,gBAAgB,eAAe,UAAU;AAC/C,cAAM,gBAAgB,eAAe,UAAU;AAE/C,cAAM,gBAAgB,oBAAoB,eAAe,aAAa;AAGtE,YAAI,QAAQ,oBAAI,IAAI;AACpB,8BAAsB,OAAO,eAAe,YAAY,aAAa;AAGrE,cAAM,UAAU,WAAW,mBAAmB;AAC9C,8BAAsB,OAAO,eAAe,SAAS,aAAa;AAElE,eAAO,EAAE,eAAe,MAAM;AAAA,MAChC;AASA,eAAS,oBAAoB,eAAe,eAAe;AACzD,YAAI,eAAe,oBAAI,IAAI;AAG3B,YAAI,kBAAkB,oBAAI,IAAI;AAC9B,mBAAW,EAAE,IAAI,QAAQ,KAAK,eAAe;AAC3C,cAAI,gBAAgB,IAAI,EAAE,GAAG;AAC3B,yBAAa,IAAI,EAAE;AAAA,UACrB,OAAO;AACL,4BAAgB,IAAI,IAAI,OAAO;AAAA,UACjC;AAAA,QACF;AAEA,YAAI,gBAAgB,oBAAI,IAAI;AAC5B,mBAAW,EAAE,IAAI,QAAQ,KAAK,eAAe;AAC3C,cAAI,cAAc,IAAI,EAAE,GAAG;AACzB,yBAAa,IAAI,EAAE;AAAA,UACrB,WAAW,gBAAgB,IAAI,EAAE,MAAM,SAAS;AAC9C,0BAAc,IAAI,EAAE;AAAA,UACtB;AAAA,QAEF;AAEA,mBAAW,MAAM,cAAc;AAC7B,wBAAc,OAAO,EAAE;AAAA,QACzB;AACA,eAAO;AAAA,MACT;AAEA,aAAOa;AAAA,IACT,EAAG;AAKH,UAAM,EAAE,kBAAkB,gBAAgB,IAAK,2BAAY;AAEzD,YAAM,uBAAuB,oBAAI,QAAQ;AAOzC,eAASC,kBAAiB,SAAS;AACjC,YAAI,mBAAmB,UAAU;AAC/B,iBAAO,QAAQ;AAAA,QACjB,OAAO;AACL,iBAAO;AAAA,QACT;AAAA,MACF;AAOA,eAASC,iBAAgB,YAAY;AACnC,YAAI,cAAc,MAAM;AACtB,iBAAO,SAAS,cAAc,KAAK;AAAA,QACrC,WAAW,OAAO,eAAe,UAAU;AACzC,iBAAOA,iBAAgB,aAAa,UAAU,CAAC;AAAA,QACjD,WACE,qBAAqB;AAAA;AAAA,UAA4B;AAAA,QAAW,GAC5D;AAEA;AAAA;AAAA,YAA+B;AAAA;AAAA,QACjC,WAAW,sBAAsB,MAAM;AACrC,cAAI,WAAW,YAAY;AAIzB,mBAAO,sBAAsB,UAAU;AAAA,UACzC,OAAO;AAEL,kBAAM,cAAc,SAAS,cAAc,KAAK;AAChD,wBAAY,OAAO,UAAU;AAC7B,mBAAO;AAAA,UACT;AAAA,QACF,OAAO;AAGL,gBAAM,cAAc,SAAS,cAAc,KAAK;AAChD,qBAAW,OAAO,CAAC,GAAG,UAAU,GAAG;AACjC,wBAAY,OAAO,GAAG;AAAA,UACxB;AACA,iBAAO;AAAA,QACT;AAAA,MACF;AASA,eAAS,sBAAsB,YAAY;AACzC;AAAA;AAAA;AAAA,UAC0B;AAAA,YACtB,YAAY,CAAC,UAAU;AAAA;AAAA,YAEvB,kBAAkB,CAAC,MAAM;AAEvB,oBAAM,WAAW,WAAW,iBAAiB,CAAC;AAE9C,qBAAO,WAAW,QAAQ,CAAC,IAAI,CAAC,YAAY,GAAG,QAAQ,IAAI;AAAA,YAC7D;AAAA;AAAA,YAEA,cAAc,CAAC,GAAG,MAAM,WAAW,WAAW,aAAa,GAAG,CAAC;AAAA;AAAA,YAE/D,YAAY,CAAC,GAAG,MAAM,WAAW,WAAW,WAAW,GAAG,CAAC;AAAA;AAAA,YAE3D,IAAI,kBAAkB;AACpB,qBAAO;AAAA,YACT;AAAA,UACF;AAAA;AAAA,MAEJ;AAOA,eAAS,aAAa,YAAY;AAChC,YAAIC,UAAS,IAAI,UAAU;AAG3B,YAAI,yBAAyB,WAAW;AAAA,UACtC;AAAA,UACA;AAAA,QACF;AAGA,YACE,uBAAuB,MAAM,UAAU,KACvC,uBAAuB,MAAM,UAAU,KACvC,uBAAuB,MAAM,UAAU,GACvC;AACA,cAAI,UAAUA,QAAO,gBAAgB,YAAY,WAAW;AAE5D,cAAI,uBAAuB,MAAM,UAAU,GAAG;AAC5C,iCAAqB,IAAI,OAAO;AAChC,mBAAO;AAAA,UACT,OAAO;AAEL,gBAAI,cAAc,QAAQ;AAC1B,gBAAI,aAAa;AACf,mCAAqB,IAAI,WAAW;AAAA,YACtC;AACA,mBAAO;AAAA,UACT;AAAA,QACF,OAAO;AAGL,cAAI,cAAcA,QAAO;AAAA,YACvB,qBAAqB,aAAa;AAAA,YAClC;AAAA,UACF;AACA,cAAI;AAAA;AAAA,YACF,YAAY,KAAK,cAAc,UAAU,EACzC;AAAA;AACF,+BAAqB,IAAI,OAAO;AAChC,iBAAO;AAAA,QACT;AAAA,MACF;AAEA,aAAO,EAAE,kBAAAF,mBAAkB,iBAAAC,iBAAgB;AAAA,IAC7C,EAAG;AAKH,WAAO;AAAA,MACL;AAAA,MACA,UAAAV;AAAA,IACF;AAAA,EACF,EAAG;AAEH,WAAS,cAAc,gBAAgB,YAAY,EAAE,WAAW,GAAG,QAAQ,IAAI,CAAC,GAAG;AACjF,cAAU,MAAM,gBAAgB,YAAY;AAAA,MAC1C,GAAG;AAAA,MACH,WAAW,IAAI,0BAA0B,SAAS;AAAA,IACpD,CAAC;AAAA,EACH;AAEA,WAAS,cAAc,gBAAgB,YAAY;AACjD,kBAAc,gBAAgB,WAAW,YAAY;AAAA,MACnD,YAAY;AAAA,IACd,CAAC;AAAA,EACH;AAEA,MAAM,4BAAN,MAAgC;AAAA,IAC9B;AAAA,IAEA,YAAY,EAAE,kBAAkB,IAAI,CAAC,GAAG;AACtC,WAAK,qBAAqB,sBAAsB,MAAM;AAAA,IACxD;AAAA,IAEA,kBAAkB,CAAC,SAAS;AAC1B,aAAO,EAAE,KAAK,MAAM,KAAK,aAAa,sBAAsB,KAAK,SAAS,eAAe,KAAK,EAAE;AAAA,IAClG;AAAA,IAEA,oBAAoB,CAAC,gBAAgB,eAAe;AAClD,UAAI,0BAA0B,SAAS;AACrC,YAAI,CAAC,eAAe,aAAa,sBAAsB,KAAK,KAAK,mBAAmB,gBAAgB,UAAU,GAAG;AAC/G,gBAAM,QAAQ,SAAS,8BAA8B;AAAA,YACnD,YAAY;AAAA,YACZ,QAAQ;AAAA,YACR,QAAQ,EAAE,gBAAgB,WAAW;AAAA,UACvC,CAAC;AAED,iBAAO,CAAC,MAAM;AAAA,QAChB,OAAO;AACL,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAAA,IAEA,yBAAyB,CAAC,eAAe,QAAQ,iBAAiB;AAChE,YAAM,QAAQ,SAAS,gCAAgC;AAAA,QACrD,YAAY;AAAA,QACZ;AAAA,QACA,QAAQ,EAAE,eAAe,aAAa;AAAA,MACxC,CAAC;AAED,aAAO,CAAC,MAAM;AAAA,IAChB;AAAA,IAEA,oBAAoB,CAAC,SAAS;AAC5B,aAAO,KAAK,kBAAkB,IAAI;AAAA,IACpC;AAAA,IAEA,mBAAmB,CAAC,gBAAgB,eAAe;AACjD,UAAI,0BAA0B,SAAS;AACrC,iBAAS,uBAAuB;AAAA,UAC9B,QAAQ;AAAA,UACR,QAAQ,EAAE,gBAAgB,WAAW;AAAA,QACvC,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,MAAM,wBAAN,cAAoC,cAAc;AAAA,IAChD,OAAO,cAAc,gBAAgB,YAAY;AAC/C,eAAS,4BAA4B;AAAA,QACnC,QAAQ;AAAA,QACR,QAAQ,EAAE,gBAAgB,WAAW;AAAA,MACvC,CAAC;AAED,oBAAc,gBAAgB,UAAU;AAAA,IAC1C;AAAA,IAEA,MAAM,4BAA4B,UAAU;AAC1C,aAAO,MAAM,SAAS;AAAA,IACxB;AAAA,EACF;AAEA,MAAM,cAAN,MAAM,aAAY;AAAA,IAChB,OAAO,oBAAoB;AAAA;AAAA,IAE3B,WAAW,aAAa;AACtB,aAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,kBAUO,aAAY,iBAAiB;AAAA,oBAC3B,aAAY,oBAAoB,CAAC,MAAM,aAAY,oBAAoB,CAAC;AAAA;AAAA;AAAA;AAAA,IAI1F;AAAA,IAEA,SAAS;AAAA,IACT,QAAQ;AAAA,IACR,UAAU;AAAA,IAEV,cAAc;AACZ,WAAK,oBAAoB,KAAK,wBAAwB;AACtD,WAAK,kBAAkB,KAAK,sBAAsB;AAClD,WAAK,yBAAyB;AAC9B,WAAK,SAAS,CAAC;AAAA,IACjB;AAAA,IAEA,OAAO;AACL,UAAI,CAAC,KAAK,SAAS;AACjB,aAAK,UAAU;AACf,aAAK,uBAAuB;AAC5B,aAAK,eAAe;AAAA,MACtB;AAAA,IACF;AAAA,IAEA,OAAO;AACL,UAAI,KAAK,WAAW,CAAC,KAAK,QAAQ;AAChC,aAAK,SAAS;AACd,aAAK,oBAAoB,MAAM;AAC7B,eAAK,yBAAyB;AAC9B,eAAK,cAAc;AACnB,eAAK,UAAU;AACf,eAAK,SAAS;AAAA,QAChB,CAAC;AAAA,MACH;AAAA,IACF;AAAA,IAEA,SAAS,OAAO;AACd,WAAK,QAAQ;AACb,WAAK,QAAQ;AAAA,IACf;AAAA;AAAA,IAIA,2BAA2B;AACzB,eAAS,KAAK,aAAa,KAAK,mBAAmB,SAAS,KAAK,UAAU;AAAA,IAC7E;AAAA,IAEA,yBAAyB;AACvB,WAAK,gBAAgB,MAAM,QAAQ;AACnC,WAAK,gBAAgB,MAAM,UAAU;AACrC,eAAS,gBAAgB,aAAa,KAAK,iBAAiB,SAAS,IAAI;AACzE,WAAK,QAAQ;AAAA,IACf;AAAA,IAEA,oBAAoB,UAAU;AAC5B,WAAK,gBAAgB,MAAM,UAAU;AACrC,iBAAW,UAAU,aAAY,oBAAoB,GAAG;AAAA,IAC1D;AAAA,IAEA,2BAA2B;AACzB,UAAI,KAAK,gBAAgB,YAAY;AACnC,iBAAS,gBAAgB,YAAY,KAAK,eAAe;AAAA,MAC3D;AAAA,IACF;AAAA,IAEA,iBAAiB;AACf,UAAI,CAAC,KAAK,iBAAiB;AACzB,aAAK,kBAAkB,OAAO,YAAY,KAAK,SAAS,aAAY,iBAAiB;AAAA,MACvF;AAAA,IACF;AAAA,IAEA,gBAAgB;AACd,aAAO,cAAc,KAAK,eAAe;AACzC,aAAO,KAAK;AAAA,IACd;AAAA,IAEA,UAAU,MAAM;AACd,WAAK,SAAS,KAAK,QAAQ,KAAK,OAAO,IAAI,GAAG;AAAA,IAChD;AAAA,IAEA,UAAU;AACR,4BAAsB,MAAM;AAC1B,aAAK,gBAAgB,MAAM,QAAQ,GAAG,KAAK,KAAK,QAAQ,EAAE;AAAA,MAC5D,CAAC;AAAA,IACH;AAAA,IAEA,0BAA0B;AACxB,YAAM,UAAU,SAAS,cAAc,OAAO;AAC9C,cAAQ,OAAO;AACf,cAAQ,cAAc,aAAY;AAClC,YAAM,WAAW,YAAY;AAC7B,UAAI,UAAU;AACZ,gBAAQ,QAAQ;AAAA,MAClB;AACA,aAAO;AAAA,IACT;AAAA,IAEA,wBAAwB;AACtB,YAAM,UAAU,SAAS,cAAc,KAAK;AAC5C,cAAQ,YAAY;AACpB,aAAO;AAAA,IACT;AAAA,EACF;AAEA,MAAM,eAAN,cAA2B,SAAS;AAAA,IAClC,qBAAqB,KAAK,SACvB,OAAO,CAAC,YAAY,CAAC,kBAAkB,OAAO,CAAC,EAC/C,IAAI,CAAC,YAAY,oBAAoB,OAAO,CAAC,EAC7C,OAAO,CAAC,QAAQ,YAAY;AAC3B,YAAM,EAAE,UAAU,IAAI;AACtB,YAAM,UACJ,aAAa,SACT,OAAO,SAAS,IAChB;AAAA,QACE,MAAM,YAAY,OAAO;AAAA,QACzB,SAAS,iBAAiB,OAAO;AAAA,QACjC,UAAU,CAAC;AAAA,MACb;AACN,aAAO;AAAA,QACL,GAAG;AAAA,QACH,CAAC,SAAS,GAAG;AAAA,UACX,GAAG;AAAA,UACH,UAAU,CAAC,GAAG,QAAQ,UAAU,OAAO;AAAA,QACzC;AAAA,MACF;AAAA,IACF,GAAG,CAAC,CAAC;AAAA,IAEP,IAAI,0BAA0B;AAC5B,aAAO,OAAO,KAAK,KAAK,kBAAkB,EACvC,OAAO,CAAC,cAAc,KAAK,mBAAmB,SAAS,EAAE,OAAO,EAChE,KAAK,EAAE;AAAA,IACZ;AAAA,IAEA,+BAA+B,UAAU;AACvC,aAAO,KAAK,qCAAqC,UAAU,QAAQ;AAAA,IACrE;AAAA,IAEA,mCAAmC,UAAU;AAC3C,aAAO,KAAK,qCAAqC,cAAc,QAAQ;AAAA,IACzE;AAAA,IAEA,qCAAqC,aAAa,UAAU;AAC1D,aAAO,OAAO,KAAK,KAAK,kBAAkB,EACvC,OAAO,CAAC,cAAc,EAAE,aAAa,SAAS,mBAAmB,EACjE,IAAI,CAAC,cAAc,KAAK,mBAAmB,SAAS,CAAC,EACrD,OAAO,CAAC,EAAE,KAAK,MAAM,QAAQ,WAAW,EACxC,IAAI,CAAC,EAAE,UAAU,CAAC,OAAO,EAAE,MAAM,OAAO;AAAA,IAC7C;AAAA,IAEA,IAAI,sBAAsB;AACxB,aAAO,OAAO,KAAK,KAAK,kBAAkB,EAAE,OAAO,CAAC,QAAQ,cAAc;AACxE,cAAM,EAAE,MAAM,SAAS,SAAS,IAAI,KAAK,mBAAmB,SAAS;AACrE,YAAI,QAAQ,QAAQ,CAAC,SAAS;AAC5B,iBAAO,CAAC,GAAG,QAAQ,GAAG,QAAQ;AAAA,QAChC,WAAW,SAAS,SAAS,GAAG;AAC9B,iBAAO,CAAC,GAAG,QAAQ,GAAG,SAAS,MAAM,CAAC,CAAC;AAAA,QACzC,OAAO;AACL,iBAAO;AAAA,QACT;AAAA,MACF,GAAG,CAAC,CAAC;AAAA,IACP;AAAA,IAEA,aAAaT,SAAM;AACjB,YAAM,UAAU,KAAK,sBAAsBA,OAAI;AAC/C,aAAO,UAAU,QAAQ,aAAa,SAAS,IAAI;AAAA,IACrD;AAAA,IAEA,sBAAsBA,SAAM;AAC1B,aAAO,OAAO,KAAK,KAAK,kBAAkB,EAAE,OAAO,CAAC,QAAQ,cAAc;AACxE,cAAM;AAAA,UACJ,UAAU,CAAC,OAAO;AAAA,QACpB,IAAI,KAAK,mBAAmB,SAAS;AACrC,eAAO,6BAA6B,SAASA,OAAI,IAAI,UAAU;AAAA,MACjE,GAAG,SAAY,MAAS;AAAA,IAC1B;AAAA,EACF;AAEA,WAAS,YAAY,SAAS;AAC5B,QAAI,gBAAgB,OAAO,GAAG;AAC5B,aAAO;AAAA,IACT,WAAW,oBAAoB,OAAO,GAAG;AACvC,aAAO;AAAA,IACT;AAAA,EACF;AAEA,WAAS,iBAAiB,SAAS;AACjC,WAAO,QAAQ,aAAa,kBAAkB,KAAK;AAAA,EACrD;AAEA,WAAS,gBAAgB,SAAS;AAChC,UAAM,UAAU,QAAQ;AACxB,WAAO,WAAW;AAAA,EACpB;AAEA,WAAS,kBAAkB,SAAS;AAClC,UAAM,UAAU,QAAQ;AACxB,WAAO,WAAW;AAAA,EACpB;AAEA,WAAS,oBAAoB,SAAS;AACpC,UAAM,UAAU,QAAQ;AACxB,WAAO,WAAW,WAAY,WAAW,UAAU,QAAQ,aAAa,KAAK,KAAK;AAAA,EACpF;AAEA,WAAS,6BAA6B,SAASA,SAAM;AACnD,UAAM,UAAU,QAAQ;AACxB,WAAO,WAAW,UAAU,QAAQ,aAAa,MAAM,KAAKA;AAAA,EAC9D;AAEA,WAAS,oBAAoB,SAAS;AACpC,QAAI,QAAQ,aAAa,OAAO,GAAG;AACjC,cAAQ,aAAa,SAAS,EAAE;AAAA,IAClC;AAEA,WAAO;AAAA,EACT;AAEA,MAAM,eAAN,MAAM,sBAAqB,SAAS;AAAA,IAClC,OAAO,eAAe,OAAO,IAAI;AAC/B,aAAO,KAAK,aAAa,kBAAkB,IAAI,CAAC;AAAA,IAClD;AAAA,IAEA,OAAO,YAAY,SAAS;AAC1B,aAAO,KAAK,aAAa,QAAQ,aAAa;AAAA,IAChD;AAAA,IAEA,OAAO,aAAa,EAAE,iBAAiB,MAAM,KAAK,GAAG;AACnD,aAAO,IAAI,KAAK,iBAAiB,MAAM,IAAI,aAAa,IAAI,CAAC;AAAA,IAC/D;AAAA,IAEA,YAAY,iBAAiB,MAAM,cAAc;AAC/C,YAAM,IAAI;AACV,WAAK,kBAAkB;AACvB,WAAK,eAAe;AAAA,IACtB;AAAA,IAEA,QAAQ;AACN,YAAM,gBAAgB,KAAK,QAAQ,UAAU,IAAI;AAEjD,YAAM,iBAAiB,KAAK,QAAQ,iBAAiB,QAAQ;AAC7D,YAAM,uBAAuB,cAAc,iBAAiB,QAAQ;AAEpE,iBAAW,CAACY,QAAO,MAAM,KAAK,eAAe,QAAQ,GAAG;AACtD,cAAMJ,SAAQ,qBAAqBI,MAAK;AACxC,mBAAWS,WAAUb,OAAM,gBAAiB,CAAAa,QAAO,WAAW;AAC9D,mBAAWA,WAAU,OAAO,gBAAiB,CAAAb,OAAM,QAAQa,QAAO,KAAK,EAAE,WAAW;AAAA,MACtF;AAEA,iBAAW,uBAAuB,cAAc,iBAAiB,wBAAwB,GAAG;AAC1F,4BAAoB,QAAQ;AAAA,MAC9B;AAEA,aAAO,IAAI,cAAa,KAAK,iBAAiB,eAAe,KAAK,YAAY;AAAA,IAChF;AAAA,IAEA,IAAI,OAAO;AACT,aAAO,KAAK,gBAAgB,aAAa,MAAM;AAAA,IACjD;AAAA,IAEA,IAAI,cAAc;AAChB,aAAO,KAAK,aAAa;AAAA,IAC3B;AAAA,IAEA,IAAI,eAAe;AACjB,YAAM,OAAO,KAAK,WAAW,MAAM,KAAK;AACxC,aAAO,UAAU,IAAI;AAAA,IACvB;AAAA,IAEA,IAAI,oBAAoB;AACtB,aAAO,KAAK,WAAW,eAAe;AAAA,IACxC;AAAA,IAEA,IAAI,gBAAgB;AAClB,aAAO,KAAK,qBAAqB;AAAA,IACnC;AAAA,IAEA,IAAI,cAAc;AAChB,aAAO,KAAK,qBAAqB;AAAA,IACnC;AAAA,IAEA,IAAI,cAAc;AAChB,aAAO,KAAK,WAAW,eAAe,KAAK;AAAA,IAC7C;AAAA,IAEA,IAAI,yBAAyB;AAC3B,aAAO,KAAK,aAAa,aAAa,iBAAiB,MAAM;AAAA,IAC/D;AAAA,IAEA,IAAI,kBAAkB;AACpB,aAAO,KAAK,WAAW,gBAAgB,MAAM;AAAA,IAC/C;AAAA,IAEA,IAAI,+BAA+B;AACjC,aAAO,KAAK,WAAW,gBAAgB,MAAM;AAAA,IAC/C;AAAA;AAAA,IAIA,WAAWrB,SAAM;AACf,aAAO,KAAK,aAAa,aAAa,SAASA,OAAI,EAAE;AAAA,IACvD;AAAA,EACF;AAEA,MAAM,mBAAN,MAAuB;AAAA,IACrB,yBAAyB;AAAA,IACzB,iBAAiB,QAAQ,QAAQ;AAAA,IAEjC,aAAa,mBAAmB,QAAQ;AACtC,UAAI,qBAAqB,KAAK,4BAA4B,CAAC,KAAK,wBAAwB;AACtF,aAAK,yBAAyB;AAC9B,aAAK,iBAAiB,KAAK,eAAe,KAAK,YAAY;AACzD,gBAAM,SAAS,oBAAoB,MAAM,EAAE;AAAA,QAC7C,CAAC;AAAA,MACH,OAAO;AACL,aAAK,iBAAiB,KAAK,eAAe,KAAK,MAAM;AAAA,MACvD;AAEA,aAAO,KAAK;AAAA,IACd;AAAA,IAEA,IAAI,2BAA2B;AAC7B,aAAO,SAAS;AAAA,IAClB;AAAA,EACF;AAEA,MAAM,iBAAiB;AAAA,IACrB,QAAQ;AAAA,IACR,gBAAgB;AAAA,IAChB,qBAAqB,MAAM;AAAA,IAAC;AAAA,IAC5B,YAAY;AAAA,IACZ,eAAe;AAAA,IACf,qBAAqB;AAAA,IACrB,uBAAuB;AAAA,EACzB;AAEA,MAAM,eAAe;AAAA,IACnB,YAAY;AAAA,IACZ,cAAc;AAAA,IACd,YAAY;AAAA,IACZ,UAAU;AAAA,EACZ;AAEA,MAAM,aAAa;AAAA,IACjB,aAAa;AAAA,IACb,SAAS;AAAA,IACT,UAAU;AAAA,IACV,QAAQ;AAAA,IACR,WAAW;AAAA,EACb;AAEA,MAAM,mBAAmB;AAAA,IACvB,gBAAgB;AAAA,IAChB,gBAAgB;AAAA,IAChB,qBAAqB;AAAA,EACvB;AAEA,MAAM,YAAY;AAAA,IAChB,SAAS;AAAA,IACT,SAAS;AAAA,IACT,SAAS;AAAA,EACX;AAEA,MAAM,QAAN,MAAY;AAAA,IACV,aAAa,KAAK;AAAA;AAAA,IAClB,gBAAgB,CAAC;AAAA,IAEjB,mBAAmB;AAAA,IACnB,iBAAiB;AAAA,IACjB,WAAW;AAAA,IACX,sBAAsB;AAAA,IACtB,wBAAwB;AAAA,IACxB,iBAAiB;AAAA,IACjB,QAAQ,WAAW;AAAA,IACnB,mBAAmB,IAAI,iBAAiB;AAAA,IAExC,YAAY,UAAUK,WAAU,uBAAuB,UAAU,CAAC,GAAG;AACnE,WAAK,WAAW;AAChB,WAAK,WAAWA;AAChB,WAAK,wBAAwB,yBAAyB,KAAK;AAE3D,YAAM;AAAA,QACJ;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF,IAAI;AAAA,QACF,GAAG;AAAA,QACH,GAAG;AAAA,MACL;AACA,WAAK,SAAS;AACd,WAAK,iBAAiB;AACtB,WAAK,WAAW;AAChB,WAAK,WAAW;AAChB,WAAK,eAAe;AACpB,WAAK,WAAW;AAChB,WAAK,aAAa,KAAK,SAAS,6BAA6B,KAAK,UAAU,KAAK,MAAM;AACvF,WAAK,gBAAgB,KAAK,KAAK,cAAc,IAAI;AACjD,WAAK,sBAAsB;AAC3B,WAAK,aAAa;AAClB,WAAK,gBAAgB;AACrB,WAAK,WAAW,CAAC;AACjB,WAAK,sBAAsB;AAC3B,WAAK,wBAAwB;AAC7B,WAAK,YAAY,aAAa,UAAU,MAAM;AAAA,IAChD;AAAA,IAEA,IAAI,UAAU;AACZ,aAAO,KAAK,SAAS;AAAA,IACvB;AAAA,IAEA,IAAI,OAAO;AACT,aAAO,KAAK,SAAS;AAAA,IACvB;AAAA,IAEA,IAAI,UAAU;AACZ,aAAO,KAAK,SAAS;AAAA,IACvB;AAAA,IAEA,IAAI,kBAAkB;AACpB,aAAO,KAAK,QAAQ,gCAAgC,KAAK,qBAAqB;AAAA,IAChF;AAAA,IAEA,IAAI,SAAS;AACX,aAAO,KAAK;AAAA,IACd;AAAA,IAEA,QAAQ;AACN,UAAI,KAAK,SAAS,WAAW,aAAa;AACxC,aAAK,mBAAmB,aAAa,UAAU;AAC/C,aAAK,QAAQ,WAAW;AACxB,aAAK,QAAQ,aAAa,IAAI;AAC9B,aAAK,SAAS,aAAa,IAAI;AAAA,MACjC;AAAA,IACF;AAAA,IAEA,SAAS;AACP,UAAI,KAAK,SAAS,WAAW,SAAS;AACpC,YAAI,KAAK,SAAS;AAChB,eAAK,QAAQ,OAAO;AAAA,QACtB;AACA,aAAK,aAAa;AAClB,aAAK,QAAQ,WAAW;AAAA,MAC1B;AAAA,IACF;AAAA,IAEA,WAAW;AACT,UAAI,KAAK,SAAS,WAAW,SAAS;AACpC,aAAK,mBAAmB,aAAa,QAAQ;AAC7C,aAAK,QAAQ,eAAe,IAAI;AAChC,aAAK,QAAQ,WAAW;AACxB,aAAK,eAAe;AAEpB,YAAI,CAAC,KAAK,kBAAkB;AAC1B,eAAK,SAAS,eAAe,IAAI;AAAA,QACnC;AAAA,MACF;AAAA,IACF;AAAA,IAEA,OAAO;AACL,UAAI,KAAK,SAAS,WAAW,SAAS;AACpC,aAAK,QAAQ,WAAW;AACxB,aAAK,QAAQ,YAAY,IAAI;AAC7B,aAAK,SAAS,eAAe,IAAI;AAAA,MACnC;AAAA,IACF;AAAA,IAEA,gBAAgB;AACd,UAAI,CAAC,KAAK,kBAAkB,KAAK,eAAe;AAC9C,cAAM,mBAAmB,KAAK,SAAS,SAAS,KAAK,UAAU,OAAO,YAAY,KAAK;AACvF,cAAM,SAAS,0BAA0B,gBAAgB;AACzD,aAAK,QAAQ,OAAO,QAAQ,KAAK,UAAU,KAAK,qBAAqB;AACrE,aAAK,iBAAiB;AAAA,MACxB;AAAA,IACF;AAAA,IAEA,eAAe;AACb,UAAI,KAAK,qBAAqB,GAAG;AAC/B,aAAK,gBAAgB;AAAA,MACvB,WAAW,KAAK,mBAAmB,KAAK,CAAC,KAAK,SAAS;AACrD,aAAK,UAAU,IAAI,aAAa,MAAM,YAAY,KAAK,KAAK,QAAQ;AACpE,aAAK,QAAQ,QAAQ;AAAA,MACvB;AAAA,IACF;AAAA,IAEA,kBAAkB;AAChB,UAAI,KAAK,UAAU;AACjB,aAAK,aAAa;AAClB,aAAK,eAAe;AACpB,aAAK,cAAc;AAAA,MACrB;AAAA,IACF;AAAA,IAEA,eAAe;AACb,WAAK,mBAAmB,aAAa,YAAY;AACjD,WAAK,QAAQ,oBAAoB,IAAI;AAAA,IACvC;AAAA,IAEA,eAAe,WAAW,KAAK,UAAU;AACvC,WAAK,WAAW;AAChB,UAAI,UAAU;AACZ,cAAM,EAAE,WAAW,IAAI;AACvB,YAAI,aAAa,UAAU,GAAG;AAC5B,eAAK,QAAQ,sBAAsB,IAAI;AAAA,QACzC,OAAO;AACL,eAAK,QAAQ,iCAAiC,MAAM,UAAU;AAAA,QAChE;AAAA,MACF;AAAA,IACF;AAAA,IAEA,gBAAgB;AACd,WAAK,mBAAmB,aAAa,UAAU;AAC/C,WAAK,QAAQ,qBAAqB,IAAI;AAAA,IACxC;AAAA,IAEA,eAAe;AACb,UAAI,KAAK,UAAU;AACjB,cAAM,EAAE,YAAY,aAAa,IAAI,KAAK;AAC1C,aAAK,OAAO,YAAY;AACtB,cAAI,KAAK,oBAAqB,MAAK,cAAc;AACjD,cAAI,KAAK,KAAK,cAAe,OAAM,KAAK,KAAK;AAE7C,cAAI,aAAa,UAAU,KAAK,gBAAgB,MAAM;AACpD,kBAAM,WAAW,aAAa,eAAe,YAAY;AACzD,kBAAM,KAAK,mBAAmB,UAAU,KAAK;AAE7C,iBAAK,QAAQ,cAAc,IAAI;AAC/B,iBAAK,SAAS;AAAA,UAChB,OAAO;AACL,kBAAM,KAAK,KAAK,YAAY,aAAa,eAAe,YAAY,GAAG,IAAI;AAC3E,iBAAK,QAAQ,cAAc,IAAI;AAC/B,iBAAK,KAAK;AAAA,UACZ;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAAA,IAEA,oBAAoB;AAClB,YAAM,WAAW,KAAK,KAAK,6BAA6B,KAAK,QAAQ,KAAK,KAAK,qBAAqB;AAEpG,UAAI,aAAa,CAAC,UAAU,KAAK,QAAQ,KAAK,SAAS,UAAU,UAAU,KAAK,QAAQ,CAAC,IAAI;AAC3F,YAAI,KAAK,UAAU,aAAa,SAAS,eAAe;AACtD,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAAA,IAEA,uBAAuB;AACrB,UAAI,KAAK,cAAc;AACrB,eAAO,aAAa,eAAe,KAAK,YAAY;AAAA,MACtD;AAAA,IACF;AAAA,IAEA,oBAAoB;AAClB,aAAO,KAAK,kBAAkB,KAAK;AAAA,IACrC;AAAA,IAEA,qBAAqB;AACnB,YAAM,WAAW,KAAK,kBAAkB;AACxC,UAAI,UAAU;AACZ,cAAM,YAAY,KAAK,mBAAmB;AAC1C,aAAK,OAAO,YAAY;AACtB,eAAK,cAAc;AACnB,cAAI,KAAK,cAAc,KAAK,eAAe;AACzC,iBAAK,QAAQ,cAAc,IAAI;AAAA,UACjC,OAAO;AACL,gBAAI,KAAK,KAAK,cAAe,OAAM,KAAK,KAAK;AAE7C,kBAAM,KAAK,mBAAmB,UAAU,SAAS;AAEjD,iBAAK,QAAQ,cAAc,IAAI;AAC/B,gBAAI,CAAC,WAAW;AACd,mBAAK,SAAS;AAAA,YAChB;AAAA,UACF;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAAA,IAEA,iBAAiB;AACf,UAAI,KAAK,wBAAwB,CAAC,KAAK,oBAAoB,KAAK,UAAU,YAAY;AACpF,aAAK,QAAQ,wBAAwB,KAAK,sBAAsB;AAAA,UAC9D,QAAQ;AAAA,UACR,UAAU,KAAK;AAAA,UACf,qBAAqB;AAAA,UACrB,YAAY;AAAA,QACd,CAAC;AACD,aAAK,mBAAmB;AAAA,MAC1B;AAAA,IACF;AAAA,IAEA,qBAAqB;AACnB,UAAI,KAAK,YAAY;AACnB,aAAK,OAAO,YAAY;AACtB,eAAK,cAAc;AACnB,eAAK,cAAc;AACnB,eAAK,cAAc;AACnB,eAAK,QAAQ,cAAc,IAAI;AAAA,QACjC,CAAC;AAAA,MACH;AAAA,IACF;AAAA;AAAA,IAIA,eAAe,SAAS;AACtB,UAAI,KAAK,uBAAuB;AAC9B,gBAAQ,mBAAmB,cAAc,WAAW;AAAA,MACtD;AAAA,IACF;AAAA,IAEA,iBAAiB;AACf,WAAK,aAAa;AAAA,IACpB;AAAA,IAEA,iCAAiC,UAAU,WAAW;AAAA,IAAC;AAAA,IAEvD,MAAM,6BAA6B,SAAS,UAAU;AACpD,YAAM,eAAe,MAAM,SAAS;AACpC,YAAM,EAAE,YAAY,WAAW,IAAI;AACnC,UAAI,gBAAgB,QAAW;AAC7B,aAAK,eAAe;AAAA,UAClB,YAAY,iBAAiB;AAAA,UAC7B;AAAA,QACF,CAAC;AAAA,MACH,OAAO;AACL,aAAK,uBAAuB,SAAS,aAAa,SAAS,WAAW;AACtE,aAAK,eAAe,EAAE,YAAwB,cAAc,WAAW,CAAC;AAAA,MAC1E;AAAA,IACF;AAAA,IAEA,MAAM,0BAA0B,SAAS,UAAU;AACjD,YAAM,eAAe,MAAM,SAAS;AACpC,YAAM,EAAE,YAAY,WAAW,IAAI;AACnC,UAAI,gBAAgB,QAAW;AAC7B,aAAK,eAAe;AAAA,UAClB,YAAY,iBAAiB;AAAA,UAC7B;AAAA,QACF,CAAC;AAAA,MACH,OAAO;AACL,aAAK,eAAe,EAAE,YAAwB,cAAc,WAAW,CAAC;AAAA,MAC1E;AAAA,IACF;AAAA,IAEA,eAAe,UAAU,QAAQ;AAC/B,WAAK,eAAe;AAAA,QAClB,YAAY,iBAAiB;AAAA,QAC7B,YAAY;AAAA,MACd,CAAC;AAAA,IACH;AAAA,IAEA,kBAAkB;AAChB,WAAK,cAAc;AAAA,IACrB;AAAA;AAAA,IAIA,gBAAgB;AACd,UAAI,CAAC,KAAK,YAAY,CAAC,KAAK,KAAK,iBAAiB,CAAC,KAAK,KAAK,6BAA6B,IAAI,GAAG;AAC/F,YAAI,KAAK,UAAU,WAAW;AAC5B,eAAK,yBAAyB,KAAK,KAAK,eAAe,KAAK,KAAK,KAAK,YAAY;AAAA,QACpF,OAAO;AACL,eAAK,eAAe,KAAK,KAAK,KAAK,YAAY;AAAA,QACjD;AACA,YAAI,KAAK,YAAY;AACnB,eAAK,SAAS,gCAAgC,KAAK,KAAK,sBAAsB,KAAK,QAAQ;AAAA,QAC7F;AAEA,aAAK,WAAW;AAAA,MAClB;AAAA,IACF;AAAA,IAEA,2BAA2B;AACzB,YAAM,EAAE,eAAe,IAAI,KAAK;AAChC,UAAI,gBAAgB;AAClB,aAAK,KAAK,iBAAiB,cAAc;AACzC,eAAO;AAAA,MACT;AAAA,IACF;AAAA,IAEA,iBAAiB;AACf,YAAM,SAAS,UAAU,KAAK,QAAQ;AACtC,UAAI,UAAU,MAAM;AAClB,aAAK,KAAK,eAAe,MAAM;AAC/B,eAAO;AAAA,MACT;AAAA,IACF;AAAA;AAAA,IAIA,mBAAmB,QAAQ;AACzB,WAAK,cAAc,MAAM,KAAI,oBAAI,KAAK,GAAE,QAAQ;AAAA,IAClD;AAAA,IAEA,mBAAmB;AACjB,aAAO,EAAE,GAAG,KAAK,cAAc;AAAA,IACjC;AAAA;AAAA,IAIA,uBAAuB;AACrB,aAAO,OAAO,KAAK,YAAY;AAAA,IACjC;AAAA,IAEA,qBAAqB;AACnB,UAAI,KAAK,YAAY;AACnB,eAAO;AAAA,MACT,WAAW,KAAK,UAAU,WAAW;AACnC,eAAO,CAAC,KAAK,kBAAkB;AAAA,MACjC,OAAO;AACL,eAAO,KAAK;AAAA,MACd;AAAA,IACF;AAAA,IAEA,gBAAgB;AACd,UAAI,CAAC,KAAK,gBAAgB;AACxB,aAAK,KAAK,cAAc,KAAK,QAAQ,EAAE,KAAK,CAAC,aAAa,YAAY,KAAK,oBAAoB,QAAQ,CAAC;AACxG,aAAK,iBAAiB;AAAA,MACxB;AAAA,IACF;AAAA,IAEA,MAAM,OAAO,UAAU;AACrB,WAAK,aAAa;AAClB,YAAM,IAAI,QAAQ,CAACJ,aAAY;AAC7B,aAAK,QACH,SAAS,oBAAoB,WAAW,WAAW,MAAMA,SAAQ,GAAG,CAAC,IAAI,sBAAsB,MAAMA,SAAQ,CAAC;AAAA,MAClH,CAAC;AACD,YAAM,SAAS;AACf,aAAO,KAAK;AAAA,IACd;AAAA,IAEA,MAAM,mBAAmB,UAAU,WAAW;AAC5C,YAAM,KAAK,iBAAiB,aAAa,KAAK,KAAK,mBAAmB,QAAQ,GAAG,YAAY;AAC3F,cAAM,KAAK,KAAK,WAAW,UAAU,WAAW,KAAK,YAAY,IAAI;AACrE,aAAK,cAAc;AAAA,MACrB,CAAC;AAAA,IACH;AAAA,IAEA,eAAe;AACb,UAAI,KAAK,OAAO;AACd,6BAAqB,KAAK,KAAK;AAC/B,eAAO,KAAK;AAAA,MACd;AAAA,IACF;AAAA,EACF;AAEA,WAAS,aAAa,YAAY;AAChC,WAAO,cAAc,OAAO,aAAa;AAAA,EAC3C;AAEA,MAAM,iBAAN,MAAqB;AAAA,IACnB,cAAc,IAAI,YAAY;AAAA,IAE9B,YAAYqB,UAAS;AACnB,WAAK,UAAUA;AAAA,IACjB;AAAA,IAEA,wBAAwBjB,WAAU,SAAS;AACzC,UAAI,oBAAoBA,WAAU,KAAK,UAAU,YAAY,GAAG;AAC9D,aAAK,UAAU,WAAWA,WAAU,SAAS,yBAAyB,KAAK,GAAG,OAAO;AAAA,MACvF,OAAO;AACL,eAAO,SAAS,OAAOA,UAAS,SAAS;AAAA,MAC3C;AAAA,IACF;AAAA,IAEA,aAAakB,QAAO;AAClB,WAAK,WAAWA,OAAM;AACtB,MAAAA,OAAM,mBAAmB;AACzB,MAAAA,OAAM,aAAa;AACnB,MAAAA,OAAM,mBAAmB;AAAA,IAC3B;AAAA,IAEA,oBAAoBA,QAAO;AACzB,WAAK,YAAY,SAAS,CAAC;AAC3B,UAAIA,OAAM,kBAAkB,KAAKA,OAAM,UAAU,WAAW;AAC1D,aAAK,+BAA+B;AAAA,MACtC,OAAO;AACL,aAAK,gBAAgB;AAAA,MACvB;AAAA,IACF;AAAA,IAEA,sBAAsBA,QAAO;AAC3B,MAAAA,OAAM,aAAa;AAAA,IACrB;AAAA,IAEA,iCAAiCA,QAAO,YAAY;AAClD,cAAQ,YAAY;AAAA,QAClB,KAAK,iBAAiB;AAAA,QACtB,KAAK,iBAAiB;AAAA,QACtB,KAAK,iBAAiB;AACpB,iBAAO,KAAK,OAAO;AAAA,YACjB,QAAQ;AAAA,YACR,SAAS;AAAA,cACP;AAAA,YACF;AAAA,UACF,CAAC;AAAA,QACH;AACE,iBAAOA,OAAM,aAAa;AAAA,MAC9B;AAAA,IACF;AAAA,IAEA,qBAAqB,QAAQ;AAAA,IAAC;AAAA,IAE9B,eAAe,QAAQ;AACrB,WAAK,YAAY,SAAS,CAAC;AAC3B,WAAK,qBAAqB;AAAA,IAC5B;AAAA,IAEA,gBAAgB,QAAQ;AACtB,WAAK,OAAO,MAAM;AAAA,IACpB;AAAA,IAEA,YAAY,QAAQ;AAClB,WAAK,YAAY,SAAS,CAAC;AAC3B,WAAK,qBAAqB;AAAA,IAC5B;AAAA,IAEA,cAAc,QAAQ;AAAA,IAAC;AAAA;AAAA,IAIvB,oCAAoClB,WAAU;AAC5C,aAAO;AAAA,IACT;AAAA;AAAA,IAIA,sBAAsB,iBAAiB;AACrC,WAAK,YAAY,SAAS,CAAC;AAC3B,WAAK,8BAA8B;AAAA,IACrC;AAAA,IAEA,uBAAuB,iBAAiB;AACtC,WAAK,YAAY,SAAS,CAAC;AAC3B,WAAK,oBAAoB;AAAA,IAC3B;AAAA;AAAA,IAIA,iCAAiC;AAC/B,WAAK,0BAA0B,OAAO,WAAW,KAAK,iBAAiB,KAAK,QAAQ,gBAAgB;AAAA,IACtG;AAAA,IAEA,uBAAuB;AACrB,WAAK,YAAY,KAAK;AACtB,UAAI,KAAK,2BAA2B,MAAM;AACxC,eAAO,aAAa,KAAK,uBAAuB;AAChD,eAAO,KAAK;AAAA,MACd;AAAA,IACF;AAAA,IAEA,gCAAgC;AAC9B,UAAI,KAAK,0BAA0B,MAAM;AACvC,aAAK,yBAAyB,OAAO,WAAW,KAAK,iBAAiB,KAAK,QAAQ,gBAAgB;AAAA,MACrG;AAAA,IACF;AAAA,IAEA,sBAAsB;AACpB,WAAK,YAAY,KAAK;AACtB,UAAI,KAAK,0BAA0B,MAAM;AACvC,eAAO,aAAa,KAAK,sBAAsB;AAC/C,eAAO,KAAK;AAAA,MACd;AAAA,IACF;AAAA,IAEA,kBAAkB,MAAM;AACtB,WAAK,YAAY,KAAK;AAAA,IACxB;AAAA,IAEA,OAAO,QAAQ;AACb,eAAS,gBAAgB,EAAE,QAAQ,OAAO,CAAC;AAE3C,aAAO,SAAS,OAAO,KAAK,UAAU,SAAS,KAAK,OAAO,SAAS;AAAA,IACtE;AAAA,IAEA,IAAI,YAAY;AACd,aAAO,KAAK,QAAQ;AAAA,IACtB;AAAA,EACF;AAEA,MAAM,gBAAN,MAAoB;AAAA,IAClB,WAAW;AAAA,IACX,qBAAqB;AAAA,IAErB,UAAU;AAAA,IAEV,QAAQ;AACN,UAAI,CAAC,KAAK,SAAS;AACjB,aAAK,UAAU;AACf,yBAAiB,sBAAsB,KAAK,yBAAyB,KAAK;AAAA,MAC5E;AAAA,IACF;AAAA,IAEA,OAAO;AACL,UAAI,KAAK,SAAS;AAChB,aAAK,UAAU;AACf,4BAAoB,sBAAsB,KAAK,yBAAyB,KAAK;AAAA,MAC/E;AAAA,IACF;AAAA,IAEA,0BAA0B,CAAC,WAAW;AACpC,iBAAW,WAAW,KAAK,mBAAmB;AAC5C,gBAAQ,OAAO;AAAA,MACjB;AAAA,IACF;AAAA,IAEA,IAAI,oBAAoB;AACtB,aAAO,CAAC,GAAG,SAAS,iBAAiB,KAAK,QAAQ,GAAG,GAAG,KAAK,gCAAgC;AAAA,IAC/F;AAAA,IAEA,IAAI,mCAAmC;AACrC,YAAM,WAAW,SAAS,iBAAiB,KAAK,kBAAkB;AAElE,UAAI,SAAS,QAAQ;AACnB,gBAAQ;AAAA,UACN,OAAO,KAAK,kBAAkB,wEAAwE,KAAK,QAAQ;AAAA,QACrH;AAAA,MACF;AAEA,aAAO,CAAC,GAAG,QAAQ;AAAA,IACrB;AAAA,EACF;AAEA,MAAM,kBAAN,MAAsB;AAAA,IACpB,YAAYiB,UAAS,SAAS;AAC5B,WAAK,UAAUA;AACf,WAAK,UAAU;AACf,WAAK,kBAAkB,IAAI,gBAAgB,MAAM,OAAO;AACxD,WAAK,qBAAqB,IAAI,mBAAmB,MAAM,OAAO;AAAA,IAChE;AAAA,IAEA,QAAQ;AACN,WAAK,gBAAgB,MAAM;AAC3B,WAAK,mBAAmB,MAAM;AAAA,IAChC;AAAA,IAEA,OAAO;AACL,WAAK,gBAAgB,KAAK;AAC1B,WAAK,mBAAmB,KAAK;AAAA,IAC/B;AAAA;AAAA,IAIA,yBAAyB,SAAS,WAAW,QAAQ;AACnD,aAAO,KAAK,gBAAgB,OAAO;AAAA,IACrC;AAAA,IAEA,qBAAqB,SAAS,KAAK,OAAO;AACxC,YAAM,QAAQ,KAAK,kBAAkB,OAAO;AAC5C,UAAI,OAAO;AACT,cAAM,SAAS,qBAAqB,SAAS,KAAK,KAAK;AAAA,MACzD;AAAA,IACF;AAAA;AAAA,IAIA,eAAe,SAASvB,YAAW;AACjC,aACE,QAAQ,QAAQ,aAAa,KAAK,QAClC,KAAK,cAAc,SAASA,UAAS,KACrC,KAAK,gBAAgB,SAASA,UAAS;AAAA,IAE3C;AAAA,IAEA,cAAc,SAASA,YAAW;AAChC,YAAM,QAAQ,KAAK,kBAAkB,SAASA,UAAS;AACvD,UAAI,OAAO;AACT,cAAM,SAAS,cAAc,SAASA,UAAS;AAAA,MACjD;AAAA,IACF;AAAA,IAEA,cAAc,MAAMA,YAAW;AAC7B,YAAM,SAAS,YAAY,MAAMA,UAAS;AAC1C,YAAM,OAAO,KAAK,QAAQ,cAAc,cAAc,yBAAyB;AAC/E,YAAM,eAAe,UAAU,MAAM,WAAW,GAAG;AAEnD,aAAO,KAAK,gBAAgB,MAAMA,UAAS,KAAK,oBAAoB,QAAQ,YAAY;AAAA,IAC1F;AAAA,IAEA,gBAAgB,SAASA,YAAW;AAClC,YAAM,gBACJ,mBAAmB,kBACf,KAAK,QAAQ,wBAAwB,SAASA,UAAS,IACvD,KAAK,QAAQ,qBAAqB,OAAO;AAE/C,UAAI,eAAe;AACjB,cAAM,QAAQ,KAAK,kBAAkB,SAASA,UAAS;AACvD,eAAO,QAAQ,SAAS,QAAQ,QAAQ,aAAa,IAAI;AAAA,MAC3D,OAAO;AACL,eAAO;AAAA,MACT;AAAA,IACF;AAAA,IAEA,kBAAkB,SAASA,YAAW;AACpC,YAAM,KAAKA,YAAW,aAAa,kBAAkB,KAAK,QAAQ,aAAa,kBAAkB;AACjG,UAAI,MAAM,MAAM,QAAQ;AACtB,cAAM,QAAQ,KAAK,QAAQ,cAAc,IAAI,EAAE,kBAAkB;AACjE,YAAI,iBAAiB,cAAc;AACjC,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,MAAM,UAAN,MAAc;AAAA,IACZ;AAAA,IACA,wBAAwB,KAAK;AAAA,IAC7B,kBAAkB,CAAC;AAAA,IACnB,UAAU;AAAA,IACV,aAAa;AAAA,IACb,eAAe;AAAA,IAEf,YAAY,UAAU;AACpB,WAAK,WAAW;AAAA,IAClB;AAAA,IAEA,QAAQ;AACN,UAAI,CAAC,KAAK,SAAS;AACjB,yBAAiB,YAAY,KAAK,YAAY,KAAK;AACnD,yBAAiB,QAAQ,KAAK,YAAY,KAAK;AAC/C,aAAK,eAAe,QAAQ,OAAO,OAAO,oBAAoB;AAC9D,aAAK,UAAU;AACf,aAAK,QAAQ,IAAI,IAAI,OAAO,SAAS,IAAI,CAAC;AAAA,MAC5C;AAAA,IACF;AAAA,IAEA,OAAO;AACL,UAAI,KAAK,SAAS;AAChB,4BAAoB,YAAY,KAAK,YAAY,KAAK;AACtD,4BAAoB,QAAQ,KAAK,YAAY,KAAK;AAClD,aAAK,UAAU;AAAA,MACjB;AAAA,IACF;AAAA,IAEA,KAAKM,WAAU,uBAAuB;AACpC,WAAK,OAAO,QAAQ,WAAWA,WAAU,qBAAqB;AAAA,IAChE;AAAA,IAEA,QAAQA,WAAU,uBAAuB;AACvC,WAAK,OAAO,QAAQ,cAAcA,WAAU,qBAAqB;AAAA,IACnE;AAAA,IAEA,OAAO,QAAQA,WAAU,wBAAwB,KAAK,GAAG;AACvD,UAAI,WAAW,QAAQ,UAAW,GAAE,KAAK;AAEzC,YAAM,QAAQ,EAAE,OAAO,EAAE,uBAAuB,kBAAkB,KAAK,aAAa,EAAE;AACtF,aAAO,KAAK,SAAS,OAAO,IAAIA,UAAS,IAAI;AAC7C,WAAK,WAAWA;AAChB,WAAK,wBAAwB;AAAA,IAC/B;AAAA;AAAA,IAIA,gCAAgC,uBAAuB;AACrD,aAAO,KAAK,gBAAgB,qBAAqB,KAAK,CAAC;AAAA,IACzD;AAAA,IAEA,sBAAsB,gBAAgB;AACpC,YAAM,EAAE,sBAAsB,IAAI;AAClC,YAAM,kBAAkB,KAAK,gBAAgB,qBAAqB;AAClE,WAAK,gBAAgB,qBAAqB,IAAI;AAAA,QAC5C,GAAG;AAAA,QACH,GAAG;AAAA,MACL;AAAA,IACF;AAAA;AAAA,IAIA,mCAAmC;AACjC,UAAI,CAAC,KAAK,2BAA2B;AACnC,aAAK,4BAA4B,QAAQ,qBAAqB;AAC9D,gBAAQ,oBAAoB;AAAA,MAC9B;AAAA,IACF;AAAA,IAEA,uCAAuC;AACrC,UAAI,KAAK,2BAA2B;AAClC,gBAAQ,oBAAoB,KAAK;AACjC,eAAO,KAAK;AAAA,MACd;AAAA,IACF;AAAA;AAAA,IAIA,aAAa,CAAC,UAAU;AACtB,UAAI,KAAK,qBAAqB,GAAG;AAC/B,cAAM,EAAE,MAAM,IAAI,MAAM,SAAS,CAAC;AAClC,YAAI,OAAO;AACT,eAAK,WAAW,IAAI,IAAI,OAAO,SAAS,IAAI;AAC5C,gBAAM,EAAE,uBAAuB,iBAAiB,IAAI;AACpD,eAAK,wBAAwB;AAC7B,gBAAM,YAAY,mBAAmB,KAAK,eAAe,YAAY;AACrE,eAAK,SAAS,6DAA6D,KAAK,UAAU,uBAAuB,SAAS;AAC1H,eAAK,eAAe;AAAA,QACtB;AAAA,MACF;AAAA,IACF;AAAA,IAEA,aAAa,OAAO,WAAW;AAC7B,YAAM,cAAc;AACpB,WAAK,aAAa;AAAA,IACpB;AAAA;AAAA,IAIA,uBAAuB;AAErB,aAAO,KAAK,aAAa;AAAA,IAC3B;AAAA,IAEA,eAAe;AACb,aAAO,KAAK,cAAc,SAAS,cAAc;AAAA,IACnD;AAAA,EACF;AAEA,MAAM,uBAAN,MAA2B;AAAA,IACzB,UAAU;AAAA,IACV,kBAAkB;AAAA,IAElB,YAAY,UAAU,aAAa;AACjC,WAAK,WAAW;AAChB,WAAK,cAAc;AAAA,IACrB;AAAA,IAEA,QAAQ;AACN,UAAI,KAAK,QAAS;AAElB,UAAI,KAAK,YAAY,eAAe,WAAW;AAC7C,aAAK,YAAY,iBAAiB,oBAAoB,KAAK,SAAS,EAAE,MAAM,KAAK,CAAC;AAAA,MACpF,OAAO;AACL,aAAK,QAAQ;AAAA,MACf;AAAA,IACF;AAAA,IAEA,OAAO;AACL,UAAI,CAAC,KAAK,QAAS;AAEnB,WAAK,YAAY,oBAAoB,cAAc,KAAK,uBAAuB;AAAA,QAC7E,SAAS;AAAA,QACT,SAAS;AAAA,MACX,CAAC;AACD,WAAK,YAAY,oBAAoB,cAAc,KAAK,0BAA0B;AAAA,QAChF,SAAS;AAAA,QACT,SAAS;AAAA,MACX,CAAC;AAED,WAAK,YAAY,oBAAoB,8BAA8B,KAAK,4BAA4B,IAAI;AACxG,WAAK,UAAU;AAAA,IACjB;AAAA,IAEA,UAAU,MAAM;AACd,WAAK,YAAY,iBAAiB,cAAc,KAAK,uBAAuB;AAAA,QAC1E,SAAS;AAAA,QACT,SAAS;AAAA,MACX,CAAC;AACD,WAAK,YAAY,iBAAiB,cAAc,KAAK,0BAA0B;AAAA,QAC7E,SAAS;AAAA,QACT,SAAS;AAAA,MACX,CAAC;AAED,WAAK,YAAY,iBAAiB,8BAA8B,KAAK,4BAA4B,IAAI;AACrG,WAAK,UAAU;AAAA,IACjB;AAAA,IAEA,wBAAwB,CAAC,UAAU;AACjC,UAAI,eAAe,gBAAgB,MAAM,QAAS;AAElD,YAAM,SAAS,MAAM;AACrB,YAAM,SAAS,OAAO,WAAW,OAAO,QAAQ,0CAA0C;AAE1F,UAAI,UAAU,KAAK,gBAAgB,MAAM,GAAG;AAC1C,cAAM,OAAO;AACb,cAAMA,YAAW,mBAAmB,IAAI;AAExC,YAAI,KAAK,SAAS,6BAA6B,MAAMA,SAAQ,GAAG;AAC9D,eAAK,kBAAkB;AAEvB,gBAAM,eAAe,IAAI;AAAA,YACvB;AAAA,YACA,YAAY;AAAA,YACZA;AAAA,YACA,IAAI,gBAAgB;AAAA,YACpB;AAAA,UACF;AAEA,wBAAc,SAASA,UAAS,SAAS,GAAG,cAAc,KAAK,SAAS;AAAA,QAC1E;AAAA,MACF;AAAA,IACF;AAAA,IAEA,2BAA2B,CAAC,UAAU;AACpC,UAAI,MAAM,WAAW,KAAK,gBAAiB,MAAK,uBAAuB;AAAA,IACzE;AAAA,IAEA,yBAAyB,MAAM;AAC7B,oBAAc,MAAM;AACpB,WAAK,kBAAkB;AAAA,IACzB;AAAA,IAEA,6BAA6B,CAAC,UAAU;AACtC,UAAI,MAAM,OAAO,YAAY,UAAU,MAAM,OAAO,aAAa,WAAW,OAAO;AACjF,cAAM,SAAS,cAAc,IAAI,MAAM,OAAO,IAAI,SAAS,CAAC;AAE5D,YAAI,QAAQ;AAEV,gBAAM,OAAO,eAAe;AAAA,QAC9B;AAEA,sBAAc,MAAM;AAAA,MACtB;AAAA,IACF;AAAA,IAEA,eAAe,SAAS;AACtB,YAAM,OAAO,QAAQ;AAErB,cAAQ,QAAQ,eAAe,IAAI;AAEnC,YAAM,aAAa,KAAK,QAAQ,aAAa;AAC7C,YAAM,mBAAmB,KAAK,aAAa,kBAAkB,KAAK,YAAY,aAAa,QAAQ,KAAK,YAAY;AAEpH,UAAI,oBAAoB,qBAAqB,QAAQ;AACnD,gBAAQ,QAAQ,aAAa,IAAI;AAAA,MACnC;AAAA,IACF;AAAA;AAAA,IAIA,+BAA+B;AAAA,IAAC;AAAA,IAEhC,eAAe,cAAc;AAAA,IAAC;AAAA,IAE9B,eAAe,cAAc;AAAA,IAAC;AAAA,IAE9B,gBAAgB,cAAc;AAAA,IAAC;AAAA,IAE/B,iCAAiC,cAAc,eAAe;AAAA,IAAC;AAAA,IAE/D,0BAA0B,cAAc,eAAe;AAAA,IAAC;AAAA,IAExD,IAAI,YAAY;AACd,aAAO,OAAO,eAAe,2BAA2B,CAAC,KAAK;AAAA,IAChE;AAAA,IAEA,gBAAgB,MAAM;AACpB,YAAM,OAAO,KAAK,aAAa,MAAM;AAErC,UAAI,CAAC,KAAM,QAAO;AAElB,UAAI,gBAAgB,IAAI,EAAG,QAAO;AAClC,UAAI,kBAAkB,IAAI,EAAG,QAAO;AACpC,UAAI,YAAY,IAAI,EAAG,QAAO;AAC9B,UAAI,YAAY,IAAI,EAAG,QAAO;AAC9B,UAAI,eAAe,IAAI,EAAG,QAAO;AAEjC,aAAO;AAAA,IACT;AAAA,EACF;AAEA,MAAM,kBAAkB,CAAC,SAAS;AAChC,WAAO,KAAK,WAAW,SAAS,SAAS,UAAU,CAAC,CAAC,SAAS,QAAQ,EAAE,SAAS,KAAK,QAAQ,KAAK,KAAK,aAAa,QAAQ;AAAA,EAC/H;AAEA,MAAM,oBAAoB,CAAC,SAAS;AAClC,WAAQ,KAAK,WAAW,KAAK,WAAW,SAAS,SAAS,WAAW,SAAS,SAAS,UAAW,KAAK,KAAK,WAAW,GAAG;AAAA,EAC5H;AAEA,MAAM,cAAc,CAAC,SAAS;AAC5B,QAAI,KAAK,aAAa,qBAAqB,MAAM,QAAS,QAAO;AACjE,QAAI,KAAK,aAAa,YAAY,MAAM,QAAS,QAAO;AAExD,UAAM,sBAAsB,uBAAuB,MAAM,uBAAuB;AAChF,QAAI,uBAAuB,oBAAoB,aAAa,qBAAqB,MAAM,QAAS,QAAO;AAEvG,WAAO;AAAA,EACT;AAEA,MAAM,cAAc,CAAC,SAAS;AAC5B,UAAM,cAAc,KAAK,aAAa,mBAAmB;AACzD,QAAI,eAAe,YAAY,YAAY,MAAM,MAAO,QAAO;AAE/D,QAAI,MAAM,IAAI,EAAG,QAAO;AACxB,QAAI,KAAK,aAAa,oBAAoB,EAAG,QAAO;AACpD,QAAI,KAAK,aAAa,mBAAmB,EAAG,QAAO;AAEnD,WAAO;AAAA,EACT;AAEA,MAAM,QAAQ,CAAC,SAAS;AACtB,WAAO,KAAK,aAAa,aAAa,KAAK,KAAK,aAAa,eAAe,KAAK,KAAK,aAAa,cAAc,KAAK,KAAK,aAAa,aAAa;AAAA,EACvJ;AAEA,MAAM,iBAAiB,CAAC,SAAS;AAC/B,UAAM,QAAQ,SAAS,yBAAyB,EAAE,QAAQ,MAAM,YAAY,KAAK,CAAC;AAClF,WAAO,MAAM;AAAA,EACf;AAEA,MAAM,YAAN,MAAgB;AAAA,IACd,YAAY,UAAU;AACpB,WAAK,WAAW;AAAA,IAClB;AAAA,IAEA,aAAaA,WAAU,UAAU,CAAC,GAAG;AACnC,UAAI,KAAK,SAAS,iCAAiCA,WAAU,QAAQ,MAAM,GAAG;AAC5E,aAAK,SAAS,wBAAwBA,WAAU,OAAO;AAAA,MACzD;AAAA,IACF;AAAA,IAEA,WAAW,WAAW,uBAAuB,UAAU,CAAC,GAAG;AACzD,WAAK,KAAK;AACV,WAAK,eAAe,IAAI,MAAM,MAAM,UAAU,SAAS,GAAG,uBAAuB;AAAA,QAC/E,UAAU,KAAK;AAAA,QACf,GAAG;AAAA,MACL,CAAC;AACD,WAAK,aAAa,MAAM;AAAA,IAC1B;AAAA,IAEA,WAAW,MAAMN,YAAW;AAC1B,WAAK,KAAK;AACV,WAAK,iBAAiB,IAAI,eAAe,MAAM,MAAMA,YAAW,IAAI;AAEpE,WAAK,eAAe,MAAM;AAAA,IAC5B;AAAA,IAEA,OAAO;AACL,UAAI,KAAK,gBAAgB;AACvB,aAAK,eAAe,KAAK;AACzB,eAAO,KAAK;AAAA,MACd;AAEA,UAAI,KAAK,cAAc;AACrB,aAAK,aAAa,OAAO;AACzB,eAAO,KAAK;AAAA,MACd;AAAA,IACF;AAAA,IAEA,IAAI,UAAU;AACZ,aAAO,KAAK,SAAS;AAAA,IACvB;AAAA,IAEA,IAAI,OAAO;AACT,aAAO,KAAK,SAAS;AAAA,IACvB;AAAA,IAEA,IAAI,eAAe;AACjB,aAAO,KAAK,KAAK,SAAS;AAAA,IAC5B;AAAA,IAEA,IAAI,UAAU;AACZ,aAAO,KAAK,SAAS;AAAA,IACvB;AAAA;AAAA,IAIA,sBAAsB,gBAAgB;AAEpC,UAAI,OAAO,KAAK,QAAQ,0BAA0B,YAAY;AAC5D,aAAK,QAAQ,sBAAsB,cAAc;AAAA,MACnD;AAAA,IACF;AAAA,IAEA,MAAM,oCAAoC,gBAAgB,eAAe;AACvE,UAAI,kBAAkB,KAAK,gBAAgB;AACzC,cAAM,eAAe,MAAM,cAAc;AACzC,YAAI,cAAc;AAChB,gBAAM,sBAAsB,eAAe;AAC3C,cAAI,CAAC,qBAAqB;AACxB,iBAAK,KAAK,mBAAmB;AAAA,UAC/B;AAEA,gBAAM,EAAE,YAAY,WAAW,IAAI;AACnC,gBAAM,SAAS,KAAK,4BAA4B,gBAAgB,aAAa;AAC7E,gBAAM,eAAe;AAAA,YACnB;AAAA,YACA;AAAA,YACA,UAAU,EAAE,YAAY,cAAc,WAAW;AAAA,UACnD;AACA,eAAK,aAAa,cAAc,UAAU,YAAY;AAAA,QACxD;AAAA,MACF;AAAA,IACF;AAAA,IAEA,MAAM,iCAAiC,gBAAgB,eAAe;AACpE,YAAM,eAAe,MAAM,cAAc;AAEzC,UAAI,cAAc;AAChB,cAAM,WAAW,aAAa,eAAe,YAAY;AACzD,YAAI,cAAc,aAAa;AAC7B,gBAAM,KAAK,KAAK,YAAY,UAAU,KAAK,YAAY;AAAA,QACzD,OAAO;AACL,gBAAM,KAAK,KAAK,WAAW,UAAU,OAAO,MAAM,KAAK,YAAY;AAAA,QACrE;AACA,YAAG,CAAC,SAAS,8BAA8B;AACzC,eAAK,KAAK,YAAY;AAAA,QACxB;AACA,aAAK,KAAK,mBAAmB;AAAA,MAC/B;AAAA,IACF;AAAA,IAEA,sBAAsB,gBAAgBO,QAAO;AAC3C,cAAQ,MAAMA,MAAK;AAAA,IACrB;AAAA,IAEA,uBAAuB,gBAAgB;AAErC,UAAI,OAAO,KAAK,QAAQ,2BAA2B,YAAY;AAC7D,aAAK,QAAQ,uBAAuB,cAAc;AAAA,MACpD;AAAA,IACF;AAAA;AAAA,IAIA,oCAAoCD,WAAU;AAE5C,UAAI,OAAO,KAAK,QAAQ,wCAAwC,YAAY;AAC1E,eAAO,KAAK,QAAQ,oCAAoCA,SAAQ;AAAA,MAClE;AAEA,aAAO;AAAA,IACT;AAAA;AAAA,IAIA,aAAakB,QAAO;AAClB,WAAK,SAAS,aAAaA,MAAK;AAAA,IAClC;AAAA,IAEA,eAAeA,QAAO;AACpB,WAAK,SAAS,eAAeA,MAAK;AAClC,aAAO,KAAK;AAAA,IACd;AAAA,IAEA,6BAA6BlB,WAAU,QAAQ;AAC7C,YAAM,SAAS,UAAUA,SAAQ;AACjC,YAAM,gBAAgB,UAAU,KAAK,KAAK,oBAAoB;AAC9D,YAAM,qBAAqB,WAAW,aAAa,OAAO,WAAW;AAErE,aACE,WAAW,aACX,cAAcA,SAAQ,MAAM,cAAc,KAAK,KAAK,oBAAoB,MACvE,sBAAuB,UAAU,QAAQ,WAAW;AAAA,IAEzD;AAAA,IAEA,gCAAgC,QAAQ,QAAQ;AAC9C,WAAK,SAAS,gCAAgC,QAAQ,MAAM;AAAA,IAC9D;AAAA;AAAA,IAIA,IAAI,WAAW;AACb,aAAO,KAAK,QAAQ;AAAA,IACtB;AAAA,IAEA,IAAI,wBAAwB;AAC1B,aAAO,KAAK,QAAQ;AAAA,IACtB;AAAA,IAEA,4BAA4B,gBAAgB,eAAe;AACzD,YAAM,EAAE,WAAAN,YAAW,YAAY,IAAI;AACnC,aAAO,eAAeA,YAAW,WAAW,KAAK,KAAK,kBAAkB,aAAa;AAAA,IACvF;AAAA,IAEA,kBAAkB,eAAe;AAC/B,YAAM,uBAAuB,cAAc,cAAc,cAAc,SAAS,SAAS,KAAK,UAAU;AACxG,aAAO,uBAAuB,YAAY;AAAA,IAC5C;AAAA,EACF;AAEA,MAAM,YAAY;AAAA,IAChB,SAAS;AAAA,IACT,SAAS;AAAA,IACT,aAAa;AAAA,IACb,UAAU;AAAA,EACZ;AAEA,MAAM,eAAN,MAAmB;AAAA,IACjB,QAAQ,UAAU;AAAA,IAClB,UAAU;AAAA,IAEV,YAAY,UAAU;AACpB,WAAK,WAAW;AAAA,IAClB;AAAA,IAEA,QAAQ;AACN,UAAI,CAAC,KAAK,SAAS;AACjB,YAAI,KAAK,SAAS,UAAU,SAAS;AACnC,eAAK,QAAQ,UAAU;AAAA,QACzB;AACA,iBAAS,iBAAiB,oBAAoB,KAAK,qBAAqB,KAAK;AAC7E,yBAAiB,YAAY,KAAK,gBAAgB,KAAK;AACvD,aAAK,UAAU;AAAA,MACjB;AAAA,IACF;AAAA,IAEA,OAAO;AACL,UAAI,KAAK,SAAS;AAChB,iBAAS,oBAAoB,oBAAoB,KAAK,qBAAqB,KAAK;AAChF,4BAAoB,YAAY,KAAK,gBAAgB,KAAK;AAC1D,aAAK,UAAU;AAAA,MACjB;AAAA,IACF;AAAA,IAEA,sBAAsB,MAAM;AAC1B,YAAM,EAAE,WAAW,IAAI;AACvB,UAAI,cAAc,eAAe;AAC/B,aAAK,kBAAkB;AAAA,MACzB,WAAW,cAAc,YAAY;AACnC,aAAK,eAAe;AAAA,MACtB;AAAA,IACF;AAAA,IAEA,oBAAoB;AAClB,UAAI,KAAK,SAAS,UAAU,SAAS;AACnC,aAAK,QAAQ,UAAU;AACvB,aAAK,SAAS,sBAAsB;AAAA,MACtC;AAAA,IACF;AAAA,IAEA,iBAAiB;AACf,WAAK,kBAAkB;AACvB,UAAI,KAAK,SAAS,UAAU,aAAa;AACvC,aAAK,QAAQ,UAAU;AACvB,aAAK,SAAS,WAAW;AAAA,MAC3B;AAAA,IACF;AAAA,IAEA,iBAAiB,MAAM;AACrB,WAAK,SAAS,eAAe;AAAA,IAC/B;AAAA,IAEA,IAAI,aAAa;AACf,aAAO,SAAS;AAAA,IAClB;AAAA,EACF;AAEA,MAAM,iBAAN,MAAqB;AAAA,IACnB,UAAU;AAAA,IAEV,YAAY,UAAU;AACpB,WAAK,WAAW;AAAA,IAClB;AAAA,IAEA,QAAQ;AACN,UAAI,CAAC,KAAK,SAAS;AACjB,yBAAiB,UAAU,KAAK,UAAU,KAAK;AAC/C,aAAK,SAAS;AACd,aAAK,UAAU;AAAA,MACjB;AAAA,IACF;AAAA,IAEA,OAAO;AACL,UAAI,KAAK,SAAS;AAChB,4BAAoB,UAAU,KAAK,UAAU,KAAK;AAClD,aAAK,UAAU;AAAA,MACjB;AAAA,IACF;AAAA,IAEA,WAAW,MAAM;AACf,WAAK,eAAe,EAAE,GAAG,OAAO,aAAa,GAAG,OAAO,YAAY,CAAC;AAAA,IACtE;AAAA;AAAA,IAIA,eAAe,UAAU;AACvB,WAAK,SAAS,sBAAsB,QAAQ;AAAA,IAC9C;AAAA,EACF;AAEA,MAAM,wBAAN,MAA4B;AAAA,IAC1B,OAAO,EAAE,SAAS,GAAG;AACnB,YAAM,4BAA4B,MAAM,kCAAkC,QAAQ,GAAG,MAAM;AACzF,kCAA0B,UAAU,MAAM;AACxC,6BAAmB,MAAM;AACvB,qBAAS,gBAAgB,YAAY,QAAQ;AAAA,UAC/C,CAAC;AAAA,QACH,CAAC;AAAA,MACH,CAAC;AAAA,IACH;AAAA;AAAA,IAIA,cAAc,yBAAyB,qBAAqB;AAC1D,0BAAoB,YAAY,wBAAwB,UAAU,IAAI,CAAC;AAAA,IACzE;AAAA,IAEA,eAAe;AAAA,IAAC;AAAA,EAClB;AAEA,WAAS,kCAAkC,UAAU;AACnD,UAAM,8BAA8B,0BAA0B,SAAS,eAAe;AACtF,UAAM,sBAAsB,CAAC;AAC7B,eAAW,8BAA8B,6BAA6B;AACpE,YAAM,EAAE,GAAG,IAAI;AAEf,iBAAW,iBAAiB,SAAS,iBAAiB,cAAc,GAAG;AACrE,cAAM,kBAAkB,wBAAwB,cAAc,gBAAgB,SAAS,EAAE;AAEzF,YAAI,iBAAiB;AACnB,8BAAoB,EAAE,IAAI,CAAC,4BAA4B,eAAe;AAAA,QACxE;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAEA,iBAAe,0BAA0B,UAAU,UAAU;AAC3D,UAAM,cAAc,0BAA0B,KAAK,CAAC;AACpD,UAAM,eAAe,SAAS,iBAAiB,cAAc;AAC7D,UAAM,uBAAuB,mCAAmC,YAAY;AAC5E,QAAI,kBAAkB;AAEtB,QAAI,sBAAsB;AACxB,UAAI,qBAAqB,IAAI;AAC3B,0BAAkB,qBAAqB;AAAA,MACzC,OAAO;AACL,0BAAkB;AAAA,MACpB;AAEA,2BAAqB,KAAK;AAAA,IAC5B;AAEA,aAAS;AACT,UAAM,YAAY;AAElB,UAAM,qBAAqB,SAAS,iBAAiB,QAAQ,SAAS,iBAAiB,SAAS;AAEhG,QAAI,sBAAsB,iBAAiB;AACzC,YAAM,qBAAqB,SAAS,eAAe,eAAe;AAElE,UAAI,mBAAmB,kBAAkB,GAAG;AAC1C,2BAAmB,MAAM;AAAA,MAC3B;AACA,UAAI,sBAAsB,mBAAmB,MAAM,aAAa;AAC9D,2BAAmB,gBAAgB,IAAI;AAAA,MACzC;AAAA,IACF;AAAA,EACF;AAEA,iBAAe,mBAAmB,UAAU;AAC1C,UAAM,CAAC,2BAA2B,wBAAwB,IAAI,MAAM,OAAO,UAAU,MAAM,SAAS,aAAa;AAEjH,UAAM,iBAAiB,6BAA6B,0BAA0B;AAE9E,QAAI,gBAAgB;AAClB,YAAM,iBAAiB,SAAS,eAAe,cAAc;AAE7D,UAAI,mBAAmB,cAAc,KAAK,kBAAkB,0BAA0B;AACpF,uBAAe,MAAM;AAAA,MACvB;AAAA,IACF;AAAA,EACF;AAEA,WAAS,mCAAmC,0BAA0B;AACpE,eAAW,iBAAiB,0BAA0B;AACpD,YAAM,uBAAuB,0BAA0B,cAAc,gBAAgB,OAAO;AAE5F,UAAI,qBAAsB,QAAO;AAAA,IACnC;AAEA,WAAO;AAAA,EACT;AAEA,MAAM,iBAAN,MAAqB;AAAA,IACnB,UAAU,oBAAI,IAAI;AAAA,IAClB,WAAW;AAAA,IAEX,YAAY,UAAU;AACpB,WAAK,WAAW;AAAA,IAClB;AAAA,IAEA,QAAQ;AACN,UAAI,CAAC,KAAK,UAAU;AAClB,aAAK,WAAW;AAChB,yBAAiB,+BAA+B,KAAK,sBAAsB,KAAK;AAAA,MAClF;AAAA,IACF;AAAA,IAEA,OAAO;AACL,UAAI,KAAK,UAAU;AACjB,aAAK,WAAW;AAChB,4BAAoB,+BAA+B,KAAK,sBAAsB,KAAK;AAAA,MACrF;AAAA,IACF;AAAA,IAEA,oBAAoB,QAAQ;AAC1B,UAAI,CAAC,KAAK,wBAAwB,MAAM,GAAG;AACzC,aAAK,QAAQ,IAAI,MAAM;AACvB,eAAO,iBAAiB,WAAW,KAAK,qBAAqB,KAAK;AAAA,MACpE;AAAA,IACF;AAAA,IAEA,uBAAuB,QAAQ;AAC7B,UAAI,KAAK,wBAAwB,MAAM,GAAG;AACxC,aAAK,QAAQ,OAAO,MAAM;AAC1B,eAAO,oBAAoB,WAAW,KAAK,qBAAqB,KAAK;AAAA,MACvE;AAAA,IACF;AAAA,IAEA,wBAAwB,QAAQ;AAC9B,aAAO,KAAK,QAAQ,IAAI,MAAM;AAAA,IAChC;AAAA,IAEA,uBAAuB,CAAC,UAAU;AAChC,YAAM,WAAW,uBAAuB,KAAK;AAC7C,UAAI,YAAY,sBAAsB,QAAQ,GAAG;AAC/C,cAAM,eAAe;AACrB,aAAK,uBAAuB,QAAQ;AAAA,MACtC;AAAA,IACF;AAAA,IAEA,sBAAsB,CAAC,UAAU;AAC/B,UAAI,KAAK,YAAY,OAAO,MAAM,QAAQ,UAAU;AAClD,aAAK,mBAAmB,MAAM,IAAI;AAAA,MACpC;AAAA,IACF;AAAA,IAEA,MAAM,uBAAuB,UAAU;AACrC,YAAM,OAAO,MAAM,SAAS;AAC5B,UAAI,MAAM;AACR,aAAK,mBAAmB,IAAI;AAAA,MAC9B;AAAA,IACF;AAAA,IAEA,mBAAmB,MAAM;AACvB,WAAK,SAAS,0BAA0B,cAAc,KAAK,IAAI,CAAC;AAAA,IAClE;AAAA,EACF;AAEA,WAAS,uBAAuB,OAAO;AACrC,UAAM,gBAAgB,MAAM,QAAQ;AACpC,QAAI,yBAAyB,eAAe;AAC1C,aAAO;AAAA,IACT;AAAA,EACF;AAEA,WAAS,sBAAsB,UAAU;AACvC,UAAM,cAAc,SAAS,eAAe;AAC5C,WAAO,YAAY,WAAW,cAAc,WAAW;AAAA,EACzD;AAEA,MAAM,gBAAN,cAA4B,SAAS;AAAA,IACnC,OAAO,cAAc,gBAAgB,YAAY;AAC/C,YAAM,EAAE,iBAAiB,KAAK,IAAI;AAElC,sBAAgB,aAAa,YAAY,IAAI;AAAA,IAC/C;AAAA,IAEA,MAAM,SAAS;AACb,WAAK,mBAAmB;AACxB,WAAK,uBAAuB;AAAA,IAC9B;AAAA,IAEA,qBAAqB;AACnB,YAAM,EAAE,iBAAiB,KAAK,IAAI;AAClC,sBAAgB,aAAa,KAAK,SAAS,IAAI;AAC/C,WAAK,cAAc,KAAK,gBAAgB,KAAK,UAAU;AAAA,IACzD;AAAA,IAEA,yBAAyB;AACvB,iBAAW,sBAAsB,KAAK,gBAAgB;AACpD,cAAM,aAAa,mBAAmB;AACtC,YAAI,YAAY;AACd,gBAAM,UAAU,sBAAsB,kBAAkB;AACxD,qBAAW,aAAa,SAAS,kBAAkB;AAAA,QACrD;AAAA,MACF;AAAA,IACF;AAAA,IAEA,IAAI,UAAU;AACZ,aAAO,KAAK,YAAY,aAAa;AAAA,IACvC;AAAA,IAEA,IAAI,iBAAiB;AACnB,aAAO,SAAS,gBAAgB,iBAAiB,QAAQ;AAAA,IAC3D;AAAA,EACF;AAEA,MAAM,eAAN,cAA2B,SAAS;AAAA,IAClC,OAAO,cAAc,gBAAgB,YAAY;AAC/C,UAAI,SAAS,QAAQ,sBAAsB,iBAAiB;AAC1D,iBAAS,KAAK,YAAY,UAAU;AAAA,MACtC,OAAO;AACL,iBAAS,gBAAgB,YAAY,UAAU;AAAA,MACjD;AAAA,IACF;AAAA,IAEA,IAAI,eAAe;AACjB,aAAO,KAAK,YAAY,eAAe,KAAK;AAAA,IAC9C;AAAA,IAEA,IAAI,eAAe;AACjB,UAAI,CAAC,KAAK,YAAY,aAAa;AACjC,eAAO;AAAA,UACL,QAAQ;AAAA,QACV;AAAA,MACF;AAEA,UAAI,CAAC,KAAK,6BAA6B;AACrC,eAAO;AAAA,UACL,QAAQ;AAAA,QACV;AAAA,MACF;AAAA,IACF;AAAA,IAEA,MAAM,kBAAkB;AACtB,WAAK,aAAa;AAClB,YAAM,KAAK,UAAU;AAAA,IACvB;AAAA,IAEA,MAAM,SAAS;AACb,UAAI,KAAK,YAAY;AACnB,cAAM,KAAK,YAAY;AAAA,MACzB;AAAA,IACF;AAAA,IAEA,kBAAkB;AAChB,YAAM,gBAAgB;AACtB,UAAI,CAAC,KAAK,WAAW;AACnB,aAAK,+BAA+B;AAAA,MACtC;AAAA,IACF;AAAA,IAEA,IAAI,sBAAsB;AACxB,aAAO,KAAK,gBAAgB;AAAA,IAC9B;AAAA,IAEA,IAAI,kBAAkB;AACpB,aAAO,KAAK,YAAY;AAAA,IAC1B;AAAA,IAEA,IAAI,aAAa;AACf,aAAO,KAAK,YAAY;AAAA,IAC1B;AAAA,IAEA,eAAe;AACb,YAAM,EAAE,gBAAgB,IAAI,KAAK;AACjC,YAAM,EAAE,KAAK,IAAI,KAAK;AAEtB,UAAI,MAAM;AACR,wBAAgB,aAAa,QAAQ,IAAI;AAAA,MAC3C,OAAO;AACL,wBAAgB,gBAAgB,MAAM;AAAA,MACxC;AAAA,IACF;AAAA,IAEA,MAAM,YAAY;AAChB,YAAM,qBAAqB,KAAK,yBAAyB;AACzD,YAAM,wBAAwB,KAAK,8BAA8B;AACjE,WAAK,0BAA0B;AAE/B,YAAM;AACN,YAAM;AAEN,UAAI,KAAK,YAAY;AACnB,aAAK,sCAAsC;AAAA,MAC7C;AAAA,IACF;AAAA,IAEA,MAAM,cAAc;AAClB,YAAM,KAAK,4BAA4B,YAAY;AACjD,aAAK,gBAAgB;AACrB,cAAM,KAAK,cAAc;AAAA,MAC3B,CAAC;AAAA,IACH;AAAA,IAEA,IAAI,8BAA8B;AAChC,aAAO,KAAK,oBAAoB,2BAA2B,KAAK,gBAAgB;AAAA,IAClF;AAAA,IAEA,MAAM,gCAAgC;AACpC,YAAM,kBAAkB,CAAC;AAEzB,iBAAW,WAAW,KAAK,2BAA2B;AACpD,wBAAgB,KAAK,YAAY,OAAO,CAAC;AAEzC,iBAAS,KAAK,YAAY,OAAO;AAAA,MACnC;AAEA,YAAM,QAAQ,IAAI,eAAe;AAAA,IACnC;AAAA,IAEA,4BAA4B;AAC1B,iBAAW,WAAW,KAAK,uBAAuB;AAChD,iBAAS,KAAK,YAAY,sBAAsB,OAAO,CAAC;AAAA,MAC1D;AAAA,IACF;AAAA,IAEA,wCAAwC;AACtC,iBAAW,WAAW,KAAK,iCAAiC;AAC1D,iBAAS,KAAK,YAAY,OAAO;AAAA,MACnC;AAAA,IACF;AAAA,IAEA,MAAM,2BAA2B;AAC/B,YAAM,kBAAkB,CAAC,GAAG,KAAK,0BAA0B;AAE3D,iBAAW,WAAW,KAAK,gCAAgC;AACzD,YAAI,CAAC,KAAK,8BAA8B,SAAS,eAAe,GAAG;AACjE,mBAAS,KAAK,YAAY,OAAO;AAAA,QACnC;AAAA,MACF;AAEA,iBAAW,WAAW,iBAAiB;AACrC,iBAAS,KAAK,YAAY,OAAO;AAAA,MACnC;AAAA,IACF;AAAA,IAEA,8BAA8B,SAAS,aAAa;AAClD,iBAAW,CAACa,QAAO,UAAU,KAAK,YAAY,QAAQ,GAAG;AAEvD,YAAI,QAAQ,WAAW,SAAS;AAC9B,cAAI,WAAW,WAAW,SAAS;AACjC;AAAA,UACF;AACA,cAAI,QAAQ,aAAa,WAAW,WAAW;AAC7C,wBAAY,OAAOA,QAAO,CAAC;AAC3B,mBAAO;AAAA,UACT;AAAA,QACF;AAGA,YAAI,WAAW,YAAY,OAAO,GAAG;AACnC,sBAAY,OAAOA,QAAO,CAAC;AAC3B,iBAAO;AAAA,QACT;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAAA,IAEA,uCAAuC;AACrC,iBAAW,WAAW,KAAK,gCAAgC;AACzD,iBAAS,KAAK,YAAY,OAAO;AAAA,MACnC;AAAA,IACF;AAAA,IAEA,iCAAiC;AAC/B,iBAAW,WAAW,KAAK,4BAA4B;AACrD,iBAAS,KAAK,YAAY,OAAO;AAAA,MACnC;AAAA,IACF;AAAA,IAEA,kBAAkB;AAChB,eAAS,UAAU,KAAK,UAAU;AAClC,WAAK,8BAA8B;AAAA,IACrC;AAAA,IAEA,gCAAgC;AAC9B,iBAAW,sBAAsB,KAAK,uBAAuB;AAC3D,cAAM,yBAAyB,sBAAsB,kBAAkB;AACvE,2BAAmB,YAAY,sBAAsB;AAAA,MACvD;AAAA,IACF;AAAA,IAEA,MAAM,gBAAgB;AACpB,YAAM,KAAK,cAAc,KAAK,gBAAgB,KAAK,UAAU;AAAA,IAC/D;AAAA,IAEA,IAAI,kCAAkC;AACpC,aAAO,KAAK,0BAA0B,OAAO,CAAC,YAAY;AACxD,eAAO,QAAQ,aAAa,kBAAkB,MAAM;AAAA,MACtD,CAAC;AAAA,IACH;AAAA,IAEA,IAAI,4BAA4B;AAC9B,aAAO,KAAK,oBAAoB,mCAAmC,KAAK,eAAe;AAAA,IACzF;AAAA,IAEA,IAAI,4BAA4B;AAC9B,aAAO,KAAK,gBAAgB,mCAAmC,KAAK,mBAAmB;AAAA,IACzF;AAAA,IAEA,IAAI,wBAAwB;AAC1B,aAAO,KAAK,gBAAgB,+BAA+B,KAAK,mBAAmB;AAAA,IACrF;AAAA,IAEA,IAAI,iCAAiC;AACnC,aAAO,KAAK,oBAAoB;AAAA,IAClC;AAAA,IAEA,IAAI,6BAA6B;AAC/B,aAAO,KAAK,gBAAgB;AAAA,IAC9B;AAAA,IAEA,IAAI,wBAAwB;AAC1B,aAAO,KAAK,WAAW,iBAAiB,QAAQ;AAAA,IAClD;AAAA,EACF;AAEA,MAAM,uBAAN,cAAmC,aAAa;AAAA,IAC9C,OAAO,cAAc,gBAAgB,YAAY;AAC/C,oBAAc,gBAAgB,YAAY;AAAA,QACxC,WAAW;AAAA,UACT,mBAAmB,aAAW,CAAC,gBAAgB,OAAO;AAAA,QACxD;AAAA,MACF,CAAC;AAED,iBAAW,SAAS,eAAe,iBAAiB,aAAa,GAAG;AAClE,YAAI,gBAAgB,KAAK,EAAG,OAAM,OAAO;AAAA,MAC3C;AAEA,eAAS,eAAe,EAAE,QAAQ,EAAE,gBAAgB,WAAW,EAAE,CAAC;AAAA,IACpE;AAAA,IAEA,MAAM,4BAA4B,UAAU;AAC1C,aAAO,MAAM,SAAS;AAAA,IACxB;AAAA,IAEA,IAAI,eAAe;AACjB,aAAO;AAAA,IACT;AAAA,IAEA,IAAI,kBAAkB;AACpB,aAAO;AAAA,IACT;AAAA,EACF;AAEA,WAAS,gBAAgB,OAAO;AAC9B,WAAO,iBAAiB,gBACtB,MAAM,OACN,MAAM,YAAY,WAClB,CAAC,MAAM,QAAQ,wBAAwB;AAAA,EAC3C;AAEA,MAAM,gBAAN,MAAoB;AAAA,IAClB,OAAO,CAAC;AAAA,IACR,YAAY,CAAC;AAAA,IAEb,YAAYY,OAAM;AAChB,WAAK,OAAOA;AAAA,IACd;AAAA,IAEA,IAAInB,WAAU;AACZ,aAAO,WAAWA,SAAQ,KAAK,KAAK;AAAA,IACtC;AAAA,IAEA,IAAIA,WAAU;AACZ,UAAI,KAAK,IAAIA,SAAQ,GAAG;AACtB,cAAM,WAAW,KAAK,KAAKA,SAAQ;AACnC,aAAK,MAAMA,SAAQ;AACnB,eAAO;AAAA,MACT;AAAA,IACF;AAAA,IAEA,IAAIA,WAAU,UAAU;AACtB,WAAK,MAAMA,WAAU,QAAQ;AAC7B,WAAK,MAAMA,SAAQ;AACnB,aAAO;AAAA,IACT;AAAA,IAEA,QAAQ;AACN,WAAK,YAAY,CAAC;AAAA,IACpB;AAAA;AAAA,IAIA,KAAKA,WAAU;AACb,aAAO,KAAK,UAAU,WAAWA,SAAQ,CAAC;AAAA,IAC5C;AAAA,IAEA,MAAMA,WAAU,UAAU;AACxB,WAAK,UAAU,WAAWA,SAAQ,CAAC,IAAI;AAAA,IACzC;AAAA,IAEA,MAAMA,WAAU;AACd,YAAM,MAAM,WAAWA,SAAQ;AAC/B,YAAMO,SAAQ,KAAK,KAAK,QAAQ,GAAG;AACnC,UAAIA,SAAQ,GAAI,MAAK,KAAK,OAAOA,QAAO,CAAC;AACzC,WAAK,KAAK,QAAQ,GAAG;AACrB,WAAK,KAAK;AAAA,IACZ;AAAA,IAEA,OAAO;AACL,iBAAW,OAAO,KAAK,KAAK,OAAO,KAAK,IAAI,GAAG;AAC7C,eAAO,KAAK,UAAU,GAAG;AAAA,MAC3B;AAAA,IACF;AAAA,EACF;AAEA,MAAM,WAAN,cAAuB,KAAK;AAAA,IAC1B,gBAAgB,IAAI,cAAc,EAAE;AAAA,IACpC,uBAAuB,IAAI,IAAI,SAAS,IAAI;AAAA,IAC5C,gBAAgB;AAAA,IAEhB,mBAAmB,aAAa;AAC9B,aAAO,KAAK,SAAS,0BAA0B,YAAY;AAAA,IAC7D;AAAA,IAEA,WAAW,UAAU,YAAY,OAAO,aAAa,MAAMW,QAAO;AAChE,YAAM,kBAAkB,KAAK,cAAcA,MAAK,KAAK,KAAK,SAAS;AACnE,YAAM,gBAAgB,kBAAkB,uBAAuB;AAE/D,YAAM,WAAW,IAAI,cAAc,KAAK,UAAU,UAAU,WAAW,UAAU;AAEjF,UAAI,CAAC,SAAS,cAAc;AAC1B,aAAK,gBAAgB;AAAA,MACvB,OAAO;AACL,QAAAA,QAAO,cAAc;AAAA,MACvB;AAEA,aAAO,KAAK,OAAO,QAAQ;AAAA,IAC7B;AAAA,IAEA,YAAY,UAAUA,QAAO;AAC3B,MAAAA,QAAO,cAAc;AACrB,YAAM,WAAW,IAAI,cAAc,KAAK,UAAU,UAAU,KAAK;AACjE,aAAO,KAAK,OAAO,QAAQ;AAAA,IAC7B;AAAA,IAEA,qBAAqB;AACnB,WAAK,cAAc,MAAM;AAAA,IAC3B;AAAA,IAEA,MAAM,cAAc,WAAW,KAAK,UAAU;AAC5C,UAAI,SAAS,aAAa;AACxB,aAAK,SAAS,sBAAsB;AACpC,cAAM,EAAE,sBAAsBlB,UAAS,IAAI;AAC3C,cAAM,kBAAkB;AACxB,cAAM,iBAAiB,SAAS,MAAM;AACtC,aAAK,cAAc,IAAIA,WAAU,cAAc;AAC/C,eAAO;AAAA,MACT;AAAA,IACF;AAAA,IAEA,6BAA6BA,WAAU;AACrC,aAAO,KAAK,cAAc,IAAIA,SAAQ;AAAA,IACxC;AAAA,IAEA,cAAckB,QAAO;AACnB,aAAO,CAACA,UAAU,KAAK,qBAAqB,aAAaA,OAAM,SAAS,YAAYA,OAAM,WAAW;AAAA,IACvG;AAAA,IAEA,6BAA6BA,QAAO;AAClC,aAAO,KAAK,cAAcA,MAAK,KAAK,KAAK,SAAS;AAAA,IACpD;AAAA,IAEA,IAAI,WAAW;AACb,aAAO,aAAa,YAAY,KAAK,OAAO;AAAA,IAC9C;AAAA,EACF;AAEA,MAAM,YAAN,MAAgB;AAAA,IACd,WAAW;AAAA,IAEX,YAAY,UAAU,eAAe;AACnC,WAAK,WAAW;AAChB,WAAK,gBAAgB;AAAA,IACvB;AAAA,IAEA,QAAQ;AACN,UAAI,SAAS,eAAe,WAAW;AACrC,iBAAS,iBAAiB,oBAAoB,KAAK,WAAW;AAAA,MAChE,OAAO;AACL,aAAK,0BAA0B,SAAS,IAAI;AAAA,MAC9C;AAAA,IACF;AAAA,IAEA,OAAO;AACL,eAAS,oBAAoB,oBAAoB,KAAK,WAAW;AAAA,IACnE;AAAA,IAEA,0BAA0B,SAAS;AACjC,iBAAW,QAAQ,QAAQ,iBAAiB,KAAK,QAAQ,GAAG;AAC1D,YAAI,KAAK,SAAS,kBAAkB,IAAI,GAAG;AACzC,eAAK,WAAW,IAAI;AAAA,QACtB;AAAA,MACF;AAAA,IACF;AAAA,IAEA,MAAM,WAAW,MAAM;AACrB,YAAMlB,YAAW,IAAI,IAAI,KAAK,IAAI;AAElC,UAAI,KAAK,cAAc,IAAIA,SAAQ,GAAG;AACpC;AAAA,MACF;AAEA,YAAM,eAAe,IAAI,aAAa,MAAM,YAAY,KAAKA,WAAU,IAAI,gBAAgB,GAAG,IAAI;AAClG,YAAM,aAAa,QAAQ;AAAA,IAC7B;AAAA;AAAA,IAIA,eAAe,cAAc;AAC3B,mBAAa,QAAQ,eAAe,IAAI;AAAA,IAC1C;AAAA,IAEA,MAAM,6BAA6B,cAAc,eAAe;AAC9D,UAAI;AACF,cAAM,eAAe,MAAM,cAAc;AACzC,cAAM,WAAW,aAAa,eAAe,YAAY;AAEzD,aAAK,cAAc,IAAI,aAAa,KAAK,QAAQ;AAAA,MACnD,SAAS,GAAG;AAAA,MAEZ;AAAA,IACF;AAAA,IAEA,eAAe,cAAc;AAAA,IAAC;AAAA,IAE9B,eAAe,cAAc;AAAA,IAAC;AAAA,IAE9B,gBAAgB,cAAc;AAAA,IAAC;AAAA,IAE/B,iCAAiC,cAAc,eAAe;AAAA,IAAC;AAAA,IAE/D,0BAA0B,cAAc,eAAe;AAAA,IAAC;AAAA,IAExD,cAAc,MAAM;AAClB,WAAK,0BAA0B,SAAS,IAAI;AAAA,IAC9C;AAAA,EACF;AAEA,MAAM,QAAN,MAAY;AAAA,IACV,YAAYiB,UAAS;AACnB,WAAK,UAAUA;AAAA,IACjB;AAAA,IAEA,QAAQ;AACN,WAAK,QAAQ,WAAW;AAAA,IAC1B;AAAA,IAEA,oBAAoB;AAClB,WAAK,iBAAiB,EAAE;AAAA,IAC1B;AAAA,IAEA,sBAAsB;AACpB,WAAK,iBAAiB,UAAU;AAAA,IAClC;AAAA,IAEA,wBAAwB;AACtB,WAAK,iBAAiB,YAAY;AAAA,IACpC;AAAA,IAEA,iBAAiB,OAAO;AACtB,qBAAe,uBAAuB,KAAK;AAAA,IAC7C;AAAA,EACF;AAEA,MAAM,UAAN,MAAc;AAAA,IACZ,YAAY,IAAI,UAAU,IAAI;AAAA,IAC9B,UAAU,IAAI,QAAQ,IAAI;AAAA,IAC1B,OAAO,IAAI,SAAS,MAAM,SAAS,eAAe;AAAA,IAClD,UAAU,IAAI,eAAe,IAAI;AAAA,IAEjC,eAAe,IAAI,aAAa,IAAI;AAAA,IACpC,gBAAgB,IAAI,cAAc;AAAA,IAClC,uBAAuB,IAAI,qBAAqB,MAAM,QAAQ;AAAA,IAC9D,oBAAoB,IAAI,kBAAkB,MAAM,MAAM;AAAA,IACtD,qBAAqB,IAAI,mBAAmB,MAAM,QAAQ;AAAA,IAC1D,iBAAiB,IAAI,eAAe,IAAI;AAAA,IACxC,iBAAiB,IAAI,eAAe,IAAI;AAAA,IACxC,wBAAwB,IAAI,sBAAsB,MAAM,SAAS,eAAe;AAAA,IAChF,kBAAkB,IAAI,gBAAgB,MAAM,SAAS,eAAe;AAAA,IACpE,wBAAwB,IAAI,sBAAsB;AAAA,IAClD,QAAQ,IAAI,MAAM,IAAI;AAAA,IAEtB,UAAU;AAAA,IACV,UAAU;AAAA,IACV,6BAA6B;AAAA,IAE7B,YAAYG,iBAAgB;AAC1B,WAAK,iBAAiBA;AACtB,WAAK,YAAY,IAAI,UAAU,MAAM,KAAK,KAAK,aAAa;AAC5D,WAAK,mBAAmB,KAAK;AAC7B,WAAK,4BAA4B,KAAK;AAAA,IACxC;AAAA,IAEA,QAAQ;AACN,UAAI,CAAC,KAAK,SAAS;AACjB,aAAK,aAAa,MAAM;AACxB,aAAK,cAAc,MAAM;AACzB,aAAK,qBAAqB,MAAM;AAChC,aAAK,sBAAsB,MAAM;AACjC,aAAK,kBAAkB,MAAM;AAC7B,aAAK,mBAAmB,MAAM;AAC9B,aAAK,eAAe,MAAM;AAC1B,aAAK,eAAe,MAAM;AAC1B,aAAK,gBAAgB,MAAM;AAC3B,aAAK,QAAQ,MAAM;AACnB,aAAK,UAAU,MAAM;AACrB,aAAK,UAAU;AACf,aAAK,UAAU;AAAA,MACjB;AAAA,IACF;AAAA,IAEA,UAAU;AACR,WAAK,UAAU;AAAA,IACjB;AAAA,IAEA,OAAO;AACL,UAAI,KAAK,SAAS;AAChB,aAAK,aAAa,KAAK;AACvB,aAAK,cAAc,KAAK;AACxB,aAAK,qBAAqB,KAAK;AAC/B,aAAK,sBAAsB,KAAK;AAChC,aAAK,kBAAkB,KAAK;AAC5B,aAAK,mBAAmB,KAAK;AAC7B,aAAK,eAAe,KAAK;AACzB,aAAK,eAAe,KAAK;AACzB,aAAK,gBAAgB,KAAK;AAC1B,aAAK,QAAQ,KAAK;AAClB,aAAK,UAAU,KAAK;AACpB,aAAK,UAAU;AAAA,MACjB;AAAA,IACF;AAAA,IAEA,gBAAgB,SAAS;AACvB,WAAK,UAAU;AAAA,IACjB;AAAA,IAEA,MAAMpB,WAAU,UAAU,CAAC,GAAG;AAC5B,YAAM,eAAe,QAAQ,QAAQ,SAAS,eAAe,QAAQ,KAAK,IAAI;AAE9E,UAAI,wBAAwB,cAAc;AACxC,cAAM,SAAS,QAAQ,UAAU,eAAe,YAAY;AAE5D,qBAAa,SAAS,kCAAkC,cAAc,MAAM;AAC5E,qBAAa,MAAMA,UAAS,SAAS;AAAA,MACvC,OAAO;AACL,aAAK,UAAU,aAAa,UAAUA,SAAQ,GAAG,OAAO;AAAA,MAC1D;AAAA,IACF;AAAA,IAEA,QAAQ,KAAK,WAAW;AACtB,YAAM,kBAAkB,aAAa,KAAK,eAAe,IAAI,SAAS;AACtE,YAAM,eAAe,QAAQ,SAAS;AACtC,UAAI,CAAC,mBAAmB,CAAC,KAAK,UAAU,gBAAgB,cAAc;AACpE,aAAK,MAAM,KAAK,EAAE,QAAQ,WAAW,qBAAqB,MAAM,CAAC;AAAA,MACnE;AAAA,IACF;AAAA,IAEA,oBAAoB,QAAQ;AAC1B,WAAK,eAAe,oBAAoB,MAAM;AAAA,IAChD;AAAA,IAEA,uBAAuB,QAAQ;AAC7B,WAAK,eAAe,uBAAuB,MAAM;AAAA,IACnD;AAAA,IAEA,oBAAoB,SAAS;AAC3B,WAAK,sBAAsB,OAAO,cAAc,KAAK,OAAO,CAAC;AAAA,IAC/D;AAAA,IAEA,aAAa;AACX,WAAK,KAAK,mBAAmB;AAAA,IAC/B;AAAA,IAEA,oBAAoB,OAAO;AACzB,cAAQ;AAAA,QACN;AAAA,MACF;AAEA,WAAK,mBAAmB;AAAA,IAC1B;AAAA,IAEA,IAAI,iBAAiB,OAAO;AAC1B,aAAO,MAAM,mBAAmB;AAAA,IAClC;AAAA,IAEA,IAAI,mBAAmB;AACrB,aAAO,OAAO,MAAM;AAAA,IACtB;AAAA,IAEA,IAAI,MAAM,OAAO;AACf,aAAO,MAAM,UAAU;AAAA,IACzB;AAAA,IAEA,IAAI,QAAQ;AACV,aAAO,OAAO,MAAM;AAAA,IACtB;AAAA,IAEA,IAAI,SAAS,OAAO;AAClB,aAAO,MAAM,OAAO;AAAA,IACtB;AAAA,IAEA,IAAI,WAAW;AACb,aAAO,OAAO,MAAM;AAAA,IACtB;AAAA,IAEA,IAAI,WAAW;AACb,aAAO,KAAK,QAAQ;AAAA,IACtB;AAAA,IAEA,IAAI,wBAAwB;AAC1B,aAAO,KAAK,QAAQ;AAAA,IACtB;AAAA,IAEA,IAAI,4BAA4B;AAC9B,aAAO,KAAK;AAAA,IACd;AAAA,IAEA,IAAI,0BAA0B,OAAO;AACnC,WAAK,UAAU,SAAS,KAAK,iBAAiB,KAAK,IAAI,GAAG,KAAK;AAC/D,WAAK,6BAA6B;AAAA,IACpC;AAAA;AAAA,IAIA,kBAAkB,SAAS;AACzB,YAAM,WAAW,QAAQ,aAAa,mBAAmB;AACzD,YAAM,WAAW,QAAQ,aAAa,mBAAmB;AACzD,YAAM,cAAc,QAAQ,aAAa,kBAAkB;AAC3D,YAAM,QAAQ,eAAe,SAC3B,OACA,SAAS,eAAe,WAAW,KAAK,uBAAuB,SAAS,6BAA6B;AAEvG,UAAI,YAAY,YAAY,iBAAiB,cAAc;AACzD,eAAO;AAAA,MACT,OAAO;AACL,cAAMA,YAAW,IAAI,IAAI,QAAQ,IAAI;AAErC,eAAO,KAAK,qBAAqB,OAAO,KAAK,oBAAoBA,WAAU,KAAK,SAAS,YAAY;AAAA,MACvG;AAAA,IACF;AAAA;AAAA,IAIA,6DAA6DA,WAAU,uBAAuB,WAAW;AACvG,UAAI,KAAK,SAAS;AAChB,aAAK,UAAU,WAAWA,WAAU,uBAAuB;AAAA,UACzD,QAAQ;AAAA,UACR,gBAAgB;AAAA,UAChB;AAAA,QACF,CAAC;AAAA,MACH,OAAO;AACL,aAAK,QAAQ,gBAAgB;AAAA,UAC3B,QAAQ;AAAA,QACV,CAAC;AAAA,MACH;AAAA,IACF;AAAA;AAAA,IAIA,sBAAsB,UAAU;AAC9B,WAAK,QAAQ,sBAAsB,EAAE,gBAAgB,SAAS,CAAC;AAAA,IACjE;AAAA;AAAA,IAIA,6BAA6B,MAAMA,WAAU;AAC3C,aAAO,KAAK,qBAAqB,IAAI,KAAK,oBAAoBA,WAAU,KAAK,SAAS,YAAY;AAAA,IACpG;AAAA,IAEA,8BAA8B;AAAA,IAAC;AAAA;AAAA,IAI/B,6BAA6B,MAAMA,WAAU;AAC3C,aACE,KAAK,qBAAqB,IAAI,KAC9B,oBAAoBA,WAAU,KAAK,SAAS,YAAY,KACxD,KAAK,UAAU,oCAAoCA,SAAQ;AAAA,IAE/D;AAAA;AAAA,IAIA,yBAAyB,MAAMA,WAAU,OAAO;AAC9C,aACE,KAAK,qBAAqB,IAAI,KAC9B,oBAAoBA,WAAU,KAAK,SAAS,YAAY,KACxD,KAAK,yCAAyC,MAAMA,WAAU,KAAK;AAAA,IAEvE;AAAA,IAEA,uBAAuB,MAAMA,WAAU;AACrC,YAAM,SAAS,KAAK,iBAAiB,IAAI;AACzC,YAAM,wBAAwB,KAAK,aAAa,mBAAmB;AAEnE,WAAK,MAAMA,UAAS,MAAM,EAAE,QAAQ,sBAAsB,CAAC;AAAA,IAC7D;AAAA;AAAA,IAIA,iCAAiCA,WAAU,QAAQ;AACjD,aAAO,KAAK,6BAA6BA,WAAU,MAAM,KAAK,KAAK,kCAAkCA,SAAQ;AAAA,IAC/G;AAAA,IAEA,wBAAwBA,WAAU,SAAS;AACzC,wCAAkCA,SAAQ;AAC1C,WAAK,QAAQ,wBAAwBA,WAAU,OAAO;AAAA,IACxD;AAAA;AAAA,IAIA,aAAakB,QAAO;AAClB,UAAI,CAACA,OAAM,uBAAuB;AAChC,mBAAW,SAAS,eAAe;AACnC,aAAK,KAAK,mBAAmBA,OAAM,SAAS;AAAA,MAC9C;AACA,wCAAkCA,OAAM,QAAQ;AAChD,UAAI,CAACA,OAAM,QAAQ;AACjB,aAAK,uCAAuCA,OAAM,UAAUA,OAAM,MAAM;AAAA,MAC1E;AAAA,IACF;AAAA,IAEA,eAAeA,QAAO;AACpB,WAAK,KAAK,qBAAqB;AAC/B,qBAAe,SAAS,eAAe;AACvC,WAAK,+BAA+BA,OAAM,iBAAiB,CAAC;AAAA,IAC9D;AAAA,IAEA,6BAA6BlB,WAAU,QAAQ;AAC7C,aAAO,KAAK,UAAU,6BAA6BA,WAAU,MAAM;AAAA,IACrE;AAAA,IAEA,gCAAgC,QAAQ,QAAQ;AAC9C,WAAK,+CAA+C,QAAQ,MAAM;AAAA,IACpE;AAAA;AAAA,IAIA,eAAe,MAAMN,YAAW;AAC9B,YAAM,SAAS,YAAY,MAAMA,UAAS;AAE1C,aACE,KAAK,wBAAwB,MAAMA,UAAS,KAC5C,oBAAoB,UAAU,MAAM,GAAG,KAAK,SAAS,YAAY;AAAA,IAErE;AAAA,IAEA,cAAc,MAAMA,YAAW;AAC7B,WAAK,UAAU,WAAW,MAAMA,UAAS;AAAA,IAC3C;AAAA;AAAA,IAIA,wBAAwB;AACtB,WAAK,KAAK,uBAAuB,KAAK;AACtC,WAAK,+BAA+B;AAAA,IACtC;AAAA,IAEA,aAAa;AACX,WAAK,QAAQ,iCAAiC;AAAA,IAChD;AAAA,IAEA,iBAAiB;AACf,WAAK,QAAQ,qCAAqC;AAAA,IACpD;AAAA;AAAA,IAIA,0BAA0B,SAAS;AACjC,WAAK,oBAAoB,OAAO;AAAA,IAClC;AAAA;AAAA,IAIA,wBAAwB;AACtB,UAAI,CAAC,KAAK,UAAU,cAAc,QAAQ;AACxC,aAAK,uCAAuC;AAAA,MAC9C;AAAA,IACF;AAAA,IAEA,sBAAsB,EAAE,QAAQ,GAAG,SAAS;AAC1C,YAAM,QAAQ,KAAK,8BAA8B,SAAS,OAAO;AACjE,YAAM;AAAA,QACJ;AAAA,QACA,QAAQ,EAAE,OAAO;AAAA,MACnB,IAAI;AAEJ,UAAI,KAAK,KAAK,YAAY,QAAQ;AAChC,aAAK,KAAK,SAAS,gBAAgB;AAAA,MACrC;AAEA,aAAO,CAAC;AAAA,IACV;AAAA,IAEA,qBAAqB,WAAW,YAAY,cAAc;AACxD,WAAK,KAAK,uBAAuB,KAAK,QAAQ;AAC9C,WAAK,6BAA6B,YAAY;AAAA,IAChD;AAAA,IAEA,0BAA0B,SAAS;AACjC,WAAK,UAAU,0BAA0B,OAAO;AAAA,IAClD;AAAA,IAEA,gBAAgB,QAAQ;AACtB,WAAK,QAAQ,gBAAgB,MAAM;AAAA,IACrC;AAAA;AAAA,IAIA,YAAY,OAAO;AACjB,WAAK,gCAAgC,KAAK;AAAA,IAC5C;AAAA,IAEA,cAAc,eAAe,OAAO;AAClC,WAAK,kCAAkC,eAAe,KAAK;AAAA,IAC7D;AAAA;AAAA,IAIA,yCAAyC,MAAMM,WAAU,IAAI;AAC3D,YAAM,QAAQ,KAAK,6CAA6C,MAAMA,WAAU,EAAE;AAClF,aAAO,CAAC,MAAM;AAAA,IAChB;AAAA,IAEA,kCAAkCA,WAAU;AAC1C,YAAM,QAAQ,KAAK,wCAAwCA,SAAQ;AACnE,aAAO,CAAC,MAAM;AAAA,IAChB;AAAA,IAEA,6CAA6C,MAAMA,WAAU,OAAO;AAClE,aAAO,SAAS,eAAe;AAAA,QAC7B,QAAQ;AAAA,QACR,QAAQ,EAAE,KAAKA,UAAS,MAAM,eAAe,MAAM;AAAA,QACnD,YAAY;AAAA,MACd,CAAC;AAAA,IACH;AAAA,IAEA,wCAAwCA,WAAU;AAChD,aAAO,SAAS,sBAAsB;AAAA,QACpC,QAAQ,EAAE,KAAKA,UAAS,KAAK;AAAA,QAC7B,YAAY;AAAA,MACd,CAAC;AAAA,IACH;AAAA,IAEA,uCAAuCA,WAAU,QAAQ;AACvD,aAAO,SAAS,eAAe,EAAE,QAAQ,EAAE,KAAKA,UAAS,MAAM,OAAO,EAAE,CAAC;AAAA,IAC3E;AAAA,IAEA,yCAAyC;AACvC,aAAO,SAAS,oBAAoB;AAAA,IACtC;AAAA,IAEA,8BAA8B,SAAS,SAAS;AAC9C,aAAO,SAAS,uBAAuB;AAAA,QACrC,QAAQ,EAAE,SAAS,GAAG,QAAQ;AAAA,QAC9B,YAAY;AAAA,MACd,CAAC;AAAA,IACH;AAAA,IAEA,6BAA6B,cAAc;AACzC,aAAO,SAAS,gBAAgB,EAAE,QAAQ,EAAE,aAAa,EAAE,CAAC;AAAA,IAC9D;AAAA,IAEA,+BAA+B,SAAS,CAAC,GAAG;AAC1C,aAAO,SAAS,cAAc;AAAA,QAC5B,QAAQ,EAAE,KAAK,KAAK,SAAS,MAAM,OAAO;AAAA,MAC5C,CAAC;AAAA,IACH;AAAA,IAEA,+CAA+C,QAAQ,QAAQ;AAC7D;AAAA,QACE,IAAI,gBAAgB,cAAc;AAAA,UAChC,QAAQ,OAAO,SAAS;AAAA,UACxB,QAAQ,OAAO,SAAS;AAAA,QAC1B,CAAC;AAAA,MACH;AAAA,IACF;AAAA,IAEA,gCAAgC,OAAO;AACrC,aAAO,SAAS,oBAAoB,EAAE,QAAQ,MAAM,CAAC;AAAA,IACvD;AAAA,IAEA,kCAAkC,eAAe,OAAO;AACtD,aAAO,SAAS,sBAAsB;AAAA,QACpC,QAAQ,EAAE,cAAc;AAAA,QACxB,QAAQ;AAAA,QACR,YAAY;AAAA,MACd,CAAC;AAAA,IACH;AAAA;AAAA,IAIA,wBAAwB,MAAMN,YAAW;AACvC,UAAI,OAAO,MAAM,QAAQ,OAAO;AAC9B,eAAO;AAAA,MACT,OAAO;AACL,cAAM,yBAAyBA,aAAY,KAAK,qBAAqBA,UAAS,IAAI;AAElF,YAAI,OAAO,MAAM,QAAQ,SAAS;AAChC,iBAAO,0BAA0B,KAAK,QAAQ,qBAAqB,KAAK;AAAA,QAC1E,OAAO;AACL,iBAAO,0BAA0B,KAAK,qBAAqB,IAAI;AAAA,QACjE;AAAA,MACF;AAAA,IACF;AAAA,IAEA,qBAAqB,SAAS;AAC5B,YAAM,YAAY,uBAAuB,SAAS,cAAc;AAChE,YAAM,cAAc,uBAAuB,SAAS,aAAa;AAGjE,UAAI,OAAO,MAAM,WAAW,aAAa;AAEvC,YAAI,WAAW;AACb,iBAAO,UAAU,aAAa,YAAY,KAAK;AAAA,QACjD,OAAO;AACL,iBAAO;AAAA,QACT;AAAA,MACF,OAAO;AAEL,YAAI,WAAW;AACb,iBAAO,UAAU,aAAa,YAAY,KAAK;AAAA,QACjD,OAAO;AACL,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAAA;AAAA,IAIA,iBAAiB,MAAM;AACrB,aAAO,eAAe,IAAI,KAAK;AAAA,IACjC;AAAA,IAEA,IAAI,WAAW;AACb,aAAO,KAAK,KAAK;AAAA,IACnB;AAAA,EACF;AAaA,WAAS,kCAAkC,KAAK;AAC9C,WAAO,iBAAiB,KAAK,qCAAqC;AAAA,EACpE;AAEA,MAAM,wCAAwC;AAAA,IAC5C,aAAa;AAAA,MACX,MAAM;AACJ,eAAO,KAAK,SAAS;AAAA,MACvB;AAAA,IACF;AAAA,EACF;AAEA,MAAM,UAAU,IAAI,QAAQ,cAAc;AAC1C,MAAM,EAAE,OAAO,WAAW,YAAY,IAAI;AAO1C,WAAS,QAAQ;AACf,YAAQ,MAAM;AAAA,EAChB;AAOA,WAAS,gBAAgB,SAAS;AAChC,YAAQ,gBAAgB,OAAO;AAAA,EACjC;AAgBA,WAAS,MAAMM,WAAU,SAAS;AAChC,YAAQ,MAAMA,WAAU,OAAO;AAAA,EACjC;AAOA,WAAS,oBAAoB,QAAQ;AACnC,YAAQ,oBAAoB,MAAM;AAAA,EACpC;AAOA,WAAS,uBAAuB,QAAQ;AACtC,YAAQ,uBAAuB,MAAM;AAAA,EACvC;AAQA,WAAS,oBAAoB,SAAS;AACpC,YAAQ,oBAAoB,OAAO;AAAA,EACrC;AAQA,WAAS,aAAa;AACpB,YAAQ;AAAA,MACN;AAAA,IACF;AACA,YAAQ,WAAW;AAAA,EACrB;AAYA,WAAS,oBAAoB,OAAO;AAClC,YAAQ;AAAA,MACN;AAAA,IACF;AACA,WAAO,MAAM,mBAAmB;AAAA,EAClC;AAEA,WAAS,iBAAiB,eAAe;AACvC,YAAQ;AAAA,MACN;AAAA,IACF;AACA,WAAO,MAAM,UAAU;AAAA,EACzB;AAEA,WAAS,YAAYqB,OAAM;AACzB,YAAQ;AAAA,MACN;AAAA,IACF;AACA,WAAO,MAAM,OAAOA;AAAA,EACtB;AAEA,MAAIC,SAAqB,uBAAO,OAAO;AAAA,IACrC,WAAW;AAAA,IACX,WAAW;AAAA,IACX;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAO;AAAA,IACP;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AAED,MAAM,yBAAN,cAAqC,MAAM;AAAA,EAAC;AAE5C,MAAM,kBAAN,MAAsB;AAAA,IACpB,sBAAsB,CAAC,mBAAmB,QAAQ,QAAQ;AAAA,IAC1D,uBAAuB;AAAA,IACvB,uBAAuB,MAAM;AAAA,IAAC;AAAA,IAC9B,aAAa;AAAA,IACb,iBAAiB;AAAA,IACjB,qBAAqB,oBAAI,IAAI;AAAA,IAC7B,oBAAoB;AAAA,IACpB,SAAS;AAAA,IAET,YAAY,SAAS;AACnB,WAAK,UAAU;AACf,WAAK,OAAO,IAAI,UAAU,MAAM,KAAK,OAAO;AAC5C,WAAK,qBAAqB,IAAI,mBAAmB,MAAM,KAAK,OAAO;AACnE,WAAK,wBAAwB,IAAI,sBAAsB,MAAM,KAAK,OAAO;AACzE,WAAK,kBAAkB,IAAI,gBAAgB,MAAM,KAAK,OAAO;AAC7D,WAAK,wBAAwB,KAAK;AAClC,WAAK,qBAAqB,IAAI,mBAAmB,MAAM,KAAK,OAAO;AAAA,IACrE;AAAA;AAAA,IAIA,UAAU;AACR,UAAI,CAAC,KAAK,YAAY;AACpB,aAAK,aAAa;AAClB,YAAI,KAAK,gBAAgB,kBAAkB,MAAM;AAC/C,eAAK,mBAAmB,MAAM;AAAA,QAChC,OAAO;AACL,eAAK,eAAe;AAAA,QACtB;AACA,aAAK,sBAAsB,MAAM;AACjC,aAAK,gBAAgB,MAAM;AAC3B,aAAK,mBAAmB,MAAM;AAAA,MAChC;AAAA,IACF;AAAA,IAEA,aAAa;AACX,UAAI,KAAK,YAAY;AACnB,aAAK,aAAa;AAClB,aAAK,mBAAmB,KAAK;AAC7B,aAAK,sBAAsB,KAAK;AAChC,aAAK,gBAAgB,KAAK;AAC1B,aAAK,mBAAmB,KAAK;AAAA,MAC/B;AAAA,IACF;AAAA,IAEA,kBAAkB;AAChB,UAAI,KAAK,gBAAgB,kBAAkB,OAAO;AAChD,aAAK,eAAe;AAAA,MACtB;AAAA,IACF;AAAA,IAEA,mBAAmB;AACjB,UAAI,KAAK,qBAAqB,KAAK,EAAG;AAEtC,UAAI,KAAK,QAAQ,aAAa;AAC5B,aAAK,WAAW;AAAA,MAClB;AAEA,UAAI,KAAK,gBAAgB,kBAAkB,SAAS,KAAK,gBAAgB;AACvE,aAAK,eAAe;AAAA,MACtB;AAAA,IACF;AAAA,IAEA,oBAAoB;AAClB,YAAM,EAAE,SAAS,IAAI,IAAI,KAAK;AAE9B,WAAK,oBAAoB,OAAO,YAAY;AAE5C,WAAK,QAAQ,gBAAgB,UAAU;AACvC,WAAK,QAAQ,MAAM;AACnB,WAAK,QAAQ,MAAM;AACnB,aAAO,KAAK,QAAQ;AAAA,IACtB;AAAA,IAEA,sBAAsB;AACpB,UAAI,KAAK,gBAAgB,kBAAkB,MAAM;AAC/C,aAAK,mBAAmB,MAAM;AAAA,MAChC,OAAO;AACL,aAAK,mBAAmB,KAAK;AAC7B,aAAK,eAAe;AAAA,MACtB;AAAA,IACF;AAAA,IAEA,MAAM,iBAAiB;AACrB,UAAI,KAAK,WAAW,KAAK,YAAY,CAAC,KAAK,YAAY,KAAK,WAAW;AACrE,aAAK,QAAQ,SAAS,KAAK,OAAO,UAAU,KAAK,SAAS,CAAC;AAC3D,aAAK,mBAAmB,KAAK;AAC7B,cAAM,KAAK,QAAQ;AACnB,aAAK,iBAAiB;AAAA,MACxB;AAAA,IACF;AAAA,IAEA,MAAM,aAAa,eAAe;AAChC,UAAI,cAAc,cAAe,cAAc,aAAa,cAAc,QAAS;AACjF,aAAK,YAAY,cAAc,SAAS;AAAA,MAC1C;AAEA,UAAI;AACF,cAAM,OAAO,MAAM,cAAc;AACjC,YAAI,MAAM;AACR,gBAAMC,YAAW,kBAAkB,IAAI;AACvC,gBAAM,eAAe,aAAa,aAAaA,SAAQ;AAEvD,cAAI,aAAa,aAAa;AAC5B,kBAAM,KAAK,mBAAmB,eAAeA,SAAQ;AAAA,UACvD,OAAO;AACL,kBAAM,KAAK,gCAAgC,aAAa;AAAA,UAC1D;AAAA,QACF;AAAA,MACF,UAAE;AACA,aAAK,oBAAoB;AACzB,aAAK,sBAAsB,MAAM,QAAQ,QAAQ;AAAA,MACnD;AAAA,IACF;AAAA;AAAA,IAIA,0BAA0B,SAAS;AACjC,WAAK,kCAAkC,SAAS,eAAe,OAAO,CAAC;AACvE,WAAK,eAAe;AAAA,IACtB;AAAA;AAAA,IAIA,6BAA6B,MAAM;AACjC,aAAO,KAAK,2BAA2B,IAAI;AAAA,IAC7C;AAAA,IAEA,4BAA4B,MAAM,WAAW,MAAM;AACjD,YAAM,QAAQ,KAAK,kBAAkB,IAAI;AACzC,UAAI,MAAO,MAAK,aAAa,oBAAoB,MAAM,EAAE;AAAA,IAC3D;AAAA;AAAA,IAIA,yBAAyB,SAAS,WAAW,QAAQ;AACnD,aAAO,KAAK,2BAA2B,OAAO;AAAA,IAChD;AAAA,IAEA,qBAAqB,SAASvB,WAAU;AACtC,WAAK,eAAe,SAASA,SAAQ;AAAA,IACvC;AAAA;AAAA,IAIA,eAAe,SAASN,YAAW;AACjC,aAAO,QAAQ,QAAQ,aAAa,KAAK,KAAK,WAAW,KAAK,2BAA2B,SAASA,UAAS;AAAA,IAC7G;AAAA,IAEA,cAAc,SAASA,YAAW;AAChC,UAAI,KAAK,gBAAgB;AACvB,aAAK,eAAe,KAAK;AAAA,MAC3B;AAEA,WAAK,iBAAiB,IAAI,eAAe,MAAM,SAASA,UAAS;AACjE,YAAM,EAAE,aAAa,IAAI,KAAK;AAC9B,WAAK,eAAe,YAAY;AAChC,WAAK,eAAe,MAAM;AAAA,IAC5B;AAAA;AAAA,IAIA,eAAe,SAAS;AACtB,cAAQ,QAAQ,aAAa,IAAI,KAAK;AAEtC,UAAI,KAAK,0BAA0B,aAAa,mBAAmB,GAAG;AACpE,gBAAQ,mBAAmB,cAAc,WAAW;AAAA,MACtD;AAAA,IACF;AAAA,IAEA,eAAe,UAAU;AACvB,iBAAW,KAAK,OAAO;AAAA,IACzB;AAAA,IAEA,iCAAiC,UAAU,WAAW;AACpD,WAAK,qBAAqB;AAAA,IAC5B;AAAA,IAEA,MAAM,6BAA6B,SAAS,UAAU;AACpD,YAAM,KAAK,aAAa,QAAQ;AAChC,WAAK,qBAAqB;AAAA,IAC5B;AAAA,IAEA,MAAM,0BAA0B,SAAS,UAAU;AACjD,YAAM,KAAK,aAAa,QAAQ;AAChC,WAAK,qBAAqB;AAAA,IAC5B;AAAA,IAEA,eAAe,SAASO,QAAO;AAC7B,cAAQ,MAAMA,MAAK;AACnB,WAAK,qBAAqB;AAAA,IAC5B;AAAA,IAEA,gBAAgB,UAAU;AACxB,qBAAe,KAAK,OAAO;AAAA,IAC7B;AAAA;AAAA,IAIA,sBAAsB,EAAE,YAAY,GAAG;AACrC,iBAAW,aAAa,KAAK,kBAAkB,WAAW,CAAC;AAAA,IAC7D;AAAA,IAEA,oCAAoC,gBAAgB,UAAU;AAC5D,YAAM,QAAQ,KAAK,kBAAkB,eAAe,aAAa,eAAe,SAAS;AAEzF,YAAM,SAAS,kCAAkC,OAAO,eAAe,eAAe,WAAW,eAAe,aAAa,KAAK,CAAC;AACnI,YAAM,SAAS,aAAa,QAAQ;AAEpC,UAAI,CAAC,eAAe,QAAQ;AAC1B,gBAAQ,WAAW;AAAA,MACrB;AAAA,IACF;AAAA,IAEA,iCAAiC,gBAAgB,eAAe;AAC9D,WAAK,QAAQ,SAAS,aAAa,aAAa;AAChD,cAAQ,WAAW;AAAA,IACrB;AAAA,IAEA,sBAAsB,gBAAgBA,QAAO;AAC3C,cAAQ,MAAMA,MAAK;AAAA,IACrB;AAAA,IAEA,uBAAuB,EAAE,YAAY,GAAG;AACtC,qBAAe,aAAa,KAAK,kBAAkB,WAAW,CAAC;AAAA,IACjE;AAAA;AAAA,IAIA,sBAAsB,EAAE,SAAS,SAAS,GAAG,SAAS;AACpD,YAAM,QAAQ,SAAS,6BAA6B;AAAA,QAClD,QAAQ,KAAK;AAAA,QACb,QAAQ,EAAE,UAAU,GAAG,QAAQ;AAAA,QAC/B,YAAY;AAAA,MACd,CAAC;AAED,YAAM;AAAA,QACJ;AAAA,QACA,QAAQ,EAAE,OAAO;AAAA,MACnB,IAAI;AAEJ,UAAI,KAAK,KAAK,YAAY,QAAQ;AAChC,aAAK,KAAK,SAAS,gBAAgB;AAAA,MACrC;AAEA,aAAO,CAAC;AAAA,IACV;AAAA,IAEA,qBAAqB,WAAW,YAAY,eAAe;AAAA,IAAC;AAAA,IAE5D,0BAA0B,SAAS;AACjC,cAAQ,0BAA0B,OAAO;AAAA,IAC3C;AAAA,IAEA,kBAAkB;AAAA,IAAC;AAAA;AAAA,IAInB,gBAAgB,gBAAgB,aAAa;AAC3C,WAAK,uBAAuB,eAAe,UAAU,IAAI;AAAA,IAC3D;AAAA,IAEA,sBAAsB,CAAC,EAAE,QAAQ,MAAM;AACrC,YAAM,QAAQ,QAAQ,cAAc,MAAM,KAAK,QAAQ,EAAE;AAEzD,UAAI,SAAS,KAAK,sBAAsB;AACtC,cAAM,gBAAgB,GAAG,KAAK,qBAAqB,QAAQ;AAAA,MAC7D;AAEA,aAAO,KAAK;AAAA,IACd;AAAA;AAAA,IAIA,MAAM,mBAAmB,eAAesB,WAAU;AAChD,YAAM,kBAAkB,MAAM,KAAK,2BAA2BA,UAAS,IAAI;AAC3E,YAAM,gBAAgB,KAAK,oBAAoB,wBAAwB;AAEvE,UAAI,iBAAiB;AACnB,cAAM,WAAW,IAAI,SAAS,eAAe;AAC7C,cAAM,WAAW,IAAI,cAAc,MAAM,KAAK,KAAK,UAAU,UAAU,OAAO,KAAK;AACnF,YAAI,KAAK,KAAK,cAAe,OAAM,KAAK,KAAK;AAC7C,aAAK,cAAc;AAEnB,cAAM,KAAK,KAAK,OAAO,QAAQ;AAC/B,aAAK,WAAW;AAChB,gBAAQ,cAAc,eAAe,KAAK,OAAO;AACjD,gBAAQ,YAAY,KAAK,OAAO;AAChC,cAAM,KAAK,oBAAoB,aAAa;AAAA,MAC9C,WAAW,KAAK,oCAAoC,aAAa,GAAG;AAClE,aAAK,gCAAgC,aAAa;AAAA,MACpD;AAAA,IACF;AAAA,IAEA,MAAM,OAAO,KAAK;AAChB,YAAM,UAAU,IAAI,aAAa,MAAM,YAAY,KAAK,KAAK,IAAI,gBAAgB,GAAG,KAAK,OAAO;AAEhG,WAAK,sBAAsB,OAAO;AAClC,WAAK,uBAAuB;AAE5B,aAAO,IAAI,QAAQ,CAAC3B,aAAY;AAC9B,aAAK,uBAAuB,MAAM;AAChC,eAAK,uBAAuB,MAAM;AAAA,UAAC;AACnC,eAAK,uBAAuB;AAC5B,UAAAA,SAAQ;AAAA,QACV;AACA,gBAAQ,QAAQ;AAAA,MAClB,CAAC;AAAA,IACH;AAAA,IAEA,eAAe,SAAS,KAAKF,YAAW;AACtC,YAAM,QAAQ,KAAK,kBAAkB,SAASA,UAAS;AAEvD,YAAM,SAAS,kCAAkC,OAAO,eAAeA,YAAW,SAAS,KAAK,CAAC;AAEjG,WAAK,8BAA8B,SAAS,MAAM;AAChD,cAAM,MAAM;AAAA,MACd,CAAC;AAAA,IACH;AAAA,IAEA,kCAAkC,OAAO,SAAS,MAAM;AACtD,WAAK,SAAS;AAEd,UAAI,KAAK,QAAQ;AACf,cAAM,eAAe,aAAa,YAAY,KAAK,EAAE,MAAM;AAC3D,cAAM,EAAE,oBAAoB,IAAI,MAAM;AAEtC,cAAM,SAAS,sBAAsB,OAAO,kBAAkB;AAC5D,cAAI,MAAM,KAAK;AACb,kBAAM,EAAE,YAAY,WAAW,IAAI;AACnC,kBAAM,eAAe,MAAM,cAAc;AACzC,kBAAM,WAAW,EAAE,YAAY,YAAY,aAAa;AACxD,kBAAM,UAAU;AAAA,cACd;AAAA,cACA;AAAA,cACA,YAAY;AAAA,cACZ,eAAe;AAAA,cACf,uBAAuB,KAAK;AAAA,cAC5B,UAAU;AAAA,YACZ;AAEA,gBAAI,KAAK,OAAQ,SAAQ,SAAS,KAAK;AAEvC,oBAAQ,MAAM,MAAM,KAAK,OAAO;AAAA,UAClC;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,IAEA,gBAAgB;AACd,UAAI,KAAK,QAAQ;AACf,cAAM,SAAS,0BAA0B,KAAK,MAAM;AACpD,gBAAQ,QAAQ,OAAO,QAAQ,UAAU,KAAK,QAAQ,OAAO,EAAE,GAAG,KAAK,qBAAqB;AAAA,MAC9F;AAAA,IACF;AAAA,IAEA,MAAM,gCAAgC,eAAe;AACnD,cAAQ;AAAA,QACN,iBAAiB,cAAc,UAAU,2BAA2B,KAAK,QAAQ,EAAE;AAAA,MACrF;AAEA,YAAM,KAAK,eAAe,cAAc,QAAQ;AAAA,IAClD;AAAA,IAEA,oCAAoC,eAAe;AACjD,WAAK,QAAQ,aAAa,YAAY,EAAE;AAExC,YAAM,WAAW,cAAc;AAC/B,YAAMwB,SAAQ,OAAO,KAAK,YAAY;AACpC,YAAI,eAAe,UAAU;AAC3B,eAAK,eAAe,GAAG;AAAA,QACzB,OAAO;AACL,kBAAQ,MAAM,KAAK,OAAO;AAAA,QAC5B;AAAA,MACF;AAEA,YAAM,QAAQ,SAAS,uBAAuB;AAAA,QAC5C,QAAQ,KAAK;AAAA,QACb,QAAQ,EAAE,UAAU,OAAAA,OAAM;AAAA,QAC1B,YAAY;AAAA,MACd,CAAC;AAED,aAAO,CAAC,MAAM;AAAA,IAChB;AAAA,IAEA,gCAAgC,eAAe;AAC7C,WAAK,KAAK,QAAQ;AAClB,WAAK,wBAAwB,aAAa;AAAA,IAC5C;AAAA,IAEA,wBAAwB,eAAe;AACrC,YAAM,UAAU,iBAAiB,cAAc,UAAU,mDAAmD,KAAK,QAAQ,EAAE;AAC3H,YAAM,IAAI,uBAAuB,OAAO;AAAA,IAC1C;AAAA,IAEA,MAAM,eAAe,UAAU;AAC7B,YAAM,UAAU,IAAI,cAAc,QAAQ;AAC1C,YAAM,eAAe,MAAM,QAAQ;AACnC,YAAM,EAAE,UAAAlB,WAAU,YAAY,WAAW,IAAI;AAE7C,aAAO,QAAQ,MAAMA,WAAU,EAAE,UAAU,EAAE,YAAY,YAAY,aAAa,EAAE,CAAC;AAAA,IACvF;AAAA,IAEA,kBAAkB,SAASN,YAAW;AACpC,YAAM,KAAK,aAAa,oBAAoBA,YAAW,OAAO,KAAK,KAAK,QAAQ,aAAa,QAAQ;AACrG,aAAO,oBAAoB,EAAE,KAAK,KAAK;AAAA,IACzC;AAAA,IAEA,MAAM,2BAA2B,WAAW;AAC1C,UAAI;AACJ,YAAM,KAAK,IAAI,OAAO,KAAK,EAAE;AAE7B,UAAI;AACF,kBAAU,gBAAgB,UAAU,cAAc,eAAe,EAAE,EAAE,GAAG,KAAK,SAAS;AACtF,YAAI,SAAS;AACX,iBAAO;AAAA,QACT;AAEA,kBAAU,gBAAgB,UAAU,cAAc,6BAA6B,EAAE,GAAG,GAAG,KAAK,SAAS;AACrG,YAAI,SAAS;AACX,gBAAM,QAAQ;AACd,iBAAO,MAAM,KAAK,2BAA2B,OAAO;AAAA,QACtD;AAAA,MACF,SAASO,QAAO;AACd,gBAAQ,MAAMA,MAAK;AACnB,eAAO,IAAI,aAAa;AAAA,MAC1B;AAEA,aAAO;AAAA,IACT;AAAA,IAEA,uBAAuB,MAAMP,YAAW;AACtC,YAAM,SAAS,YAAY,MAAMA,UAAS;AAE1C,aAAO,oBAAoB,UAAU,MAAM,GAAG,KAAK,YAAY;AAAA,IACjE;AAAA,IAEA,2BAA2B,SAASA,YAAW;AAC7C,YAAM,KAAK,aAAa,oBAAoBA,YAAW,OAAO,KAAK,KAAK,QAAQ,aAAa,QAAQ;AAErG,UAAI,mBAAmB,mBAAmB,CAAC,KAAK,uBAAuB,SAASA,UAAS,GAAG;AAC1F,eAAO;AAAA,MACT;AAEA,UAAI,CAAC,KAAK,WAAW,MAAM,QAAQ;AACjC,eAAO;AAAA,MACT;AAEA,UAAI,IAAI;AACN,cAAM,eAAe,oBAAoB,EAAE;AAC3C,YAAI,cAAc;AAChB,iBAAO,CAAC,aAAa;AAAA,QACvB;AAAA,MACF;AAEA,UAAI,CAAC,QAAQ,qBAAqB,OAAO,GAAG;AAC1C,eAAO;AAAA,MACT;AAEA,UAAIA,cAAa,CAAC,QAAQ,qBAAqBA,UAAS,GAAG;AACzD,eAAO;AAAA,MACT;AAEA,aAAO;AAAA,IACT;AAAA;AAAA,IAIA,IAAI,KAAK;AACP,aAAO,KAAK,QAAQ;AAAA,IACtB;AAAA,IAEA,IAAI,UAAU;AACZ,aAAO,CAAC,KAAK,QAAQ;AAAA,IACvB;AAAA,IAEA,IAAI,YAAY;AACd,UAAI,KAAK,QAAQ,KAAK;AACpB,eAAO,KAAK,QAAQ;AAAA,MACtB;AAAA,IACF;AAAA,IAEA,IAAI,UAAU,WAAW;AACvB,WAAK,4BAA4B,OAAO,MAAM;AAC5C,aAAK,QAAQ,MAAM,aAAa;AAAA,MAClC,CAAC;AAAA,IACH;AAAA,IAEA,IAAI,eAAe;AACjB,aAAO,KAAK,QAAQ;AAAA,IACtB;AAAA,IAEA,IAAI,YAAY;AACd,aAAO,KAAK,mBAAmB,UAAa,KAAK,qBAAqB,MAAM;AAAA,IAC9E;AAAA,IAEA,IAAI,WAAW;AACb,aAAO,KAAK,QAAQ,aAAa,UAAU;AAAA,IAC7C;AAAA,IAEA,IAAI,SAAS,OAAO;AAClB,UAAI,OAAO;AACT,aAAK,QAAQ,aAAa,YAAY,EAAE;AAAA,MAC1C,OAAO;AACL,aAAK,QAAQ,gBAAgB,UAAU;AAAA,MACzC;AAAA,IACF;AAAA,IAEA,IAAI,WAAW;AACb,aAAO,KAAK,QAAQ,YAAY,KAAK;AAAA,IACvC;AAAA,IAEA,IAAI,eAAe;AACjB,YAAM,OAAO,KAAK,QAAQ,cAAc,cAAc,yBAAyB;AAC/E,YAAM,OAAO,MAAM,WAAW;AAC9B,aAAO,UAAU,IAAI;AAAA,IACvB;AAAA,IAEA,qBAAqB,eAAe;AAClC,aAAO,KAAK,mBAAmB,IAAI,aAAa;AAAA,IAClD;AAAA,IAEA,4BAA4B,eAAe,UAAU;AACnD,WAAK,mBAAmB,IAAI,aAAa;AACzC,eAAS;AACT,WAAK,mBAAmB,OAAO,aAAa;AAAA,IAC9C;AAAA,IAEA,8BAA8B,SAAS,UAAU;AAC/C,WAAK,2BAA2B;AAChC,eAAS;AACT,aAAO,KAAK;AAAA,IACd;AAAA,EACF;AAEA,WAAS,oBAAoB,IAAI;AAC/B,QAAI,MAAM,MAAM;AACd,YAAM,UAAU,SAAS,eAAe,EAAE;AAC1C,UAAI,mBAAmB,cAAc;AACnC,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAEA,WAAS,gBAAgB,SAAS,YAAY;AAC5C,QAAI,SAAS;AACX,YAAM,MAAM,QAAQ,aAAa,KAAK;AACtC,UAAI,OAAO,QAAQ,cAAc,QAAQ,aAAa,KAAK,UAAU,GAAG;AACtE,cAAM,IAAI,MAAM,6BAA6B,QAAQ,EAAE,qDAAqD;AAAA,MAC9G;AACA,UAAI,QAAQ,kBAAkB,UAAU;AACtC,kBAAU,SAAS,WAAW,SAAS,IAAI;AAAA,MAC7C;AAEA,UAAI,mBAAmB,cAAc;AACnC,gBAAQ,kBAAkB;AAC1B,gBAAQ,qBAAqB;AAC7B,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAEA,MAAM,gBAAgB;AAAA,IACpB,QAAQ;AACN,WAAK,eAAe,QAAQ,CAACgB,OAAMA,GAAE,eAAe,aAAa,KAAK,iBAAiBA,GAAE,WAAW,CAAC;AAAA,IACvG;AAAA,IAEA,SAAS;AACP,WAAK,8BAA8B;AACnC,WAAK,eAAe,QAAQ,CAACA,OAAMA,GAAE,OAAO,KAAK,eAAe,CAAC;AAAA,IACnE;AAAA,IAEA,SAAS;AACP,WAAK,eAAe,QAAQ,CAACA,OAAMA,GAAE,eAAe,aAAa,KAAK,iBAAiBA,EAAC,CAAC;AAAA,IAC3F;AAAA,IAEA,UAAU;AACR,WAAK,8BAA8B;AACnC,WAAK,eAAe,QAAQ,CAACA,OAAMA,GAAE,QAAQ,KAAK,eAAe,CAAC;AAAA,IACpE;AAAA,IAEA,SAAS;AACP,WAAK,eAAe,QAAQ,CAACA,OAAMA,GAAE,OAAO,CAAC;AAAA,IAC/C;AAAA,IAEA,UAAU;AACR,YAAM,SAAS,KAAK,aAAa,QAAQ;AAEzC,WAAK,eAAe,QAAQ,CAAC,kBAAkB;AAC7C,YAAI,WAAW,SAAS;AACtB,wBAAc,eAAe,KAAK,eAAe;AAAA,QACnD,OAAO;AACL,wBAAc,YAAY,KAAK,eAAe;AAAA,QAChD;AAAA,MACF,CAAC;AAAA,IACH;AAAA,IAEA,SAAS;AACP,YAAM,SAAS,KAAK,aAAa,QAAQ;AAEzC,WAAK,eAAe,QAAQ,CAAC,kBAAkB;AAC7C,YAAI,WAAW,SAAS;AACtB,wBAAc,eAAe,KAAK,eAAe;AAAA,QACnD,OAAO;AACL,wBAAc,YAAY;AAC1B,wBAAc,OAAO,KAAK,eAAe;AAAA,QAC3C;AAAA,MACF,CAAC;AAAA,IACH;AAAA,IAEA,UAAU;AACR,cAAQ,QAAQ,KAAK,SAAS,KAAK,SAAS;AAAA,IAC9C;AAAA,EACF;AA0BA,MAAM,gBAAN,MAAM,uBAAsB,YAAY;AAAA,IACtC,aAAa,cAAc,YAAY;AACrC,YAAM,WAAW,cAAc;AAAA,IACjC;AAAA,IAEA,MAAM,oBAAoB;AACxB,UAAI;AACF,cAAM,KAAK,OAAO;AAAA,MACpB,SAAST,QAAO;AACd,gBAAQ,MAAMA,MAAK;AAAA,MACrB,UAAE;AACA,aAAK,WAAW;AAAA,MAClB;AAAA,IACF;AAAA,IAEA,MAAM,SAAS;AACb,aAAQ,KAAK,mBAAmB,YAAY;AAC1C,cAAM,QAAQ,KAAK;AAEnB,YAAI,KAAK,cAAc,KAAK,GAAG;AAC7B,gBAAM,YAAY;AAClB,gBAAM,MAAM,OAAO,OAAO,IAAI;AAAA,QAChC;AAAA,MACF,GAAG;AAAA,IACL;AAAA,IAEA,aAAa;AACX,UAAI;AACF,aAAK,OAAO;AAAA,MAEd,QAAQ;AAAA,MAAC;AAAA,IACX;AAAA;AAAA;AAAA;AAAA,IAKA,gCAAgC;AAC9B,WAAK,kBAAkB,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;AAAA,IAClD;AAAA;AAAA;AAAA;AAAA,IAKA,IAAI,oBAAoB;AACtB,YAAM,mBAAmB,KAAK,eAAe,QAAQ,CAACS,OAAM,CAAC,GAAGA,GAAE,QAAQ,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,aAAa,IAAI,CAAC;AACjH,YAAM,iBAAiB,CAAC,GAAI,KAAK,iBAAiB,YAAY,CAAC,CAAE,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,aAAa,IAAI,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,aAAa,IAAI,CAAC;AAExI,aAAO,iBAAiB,OAAO,CAAC,MAAM,eAAe,SAAS,EAAE,aAAa,IAAI,CAAC,CAAC;AAAA,IACrF;AAAA;AAAA;AAAA;AAAA,IAKA,IAAI,gBAAgB;AAClB,UAAI,KAAK,QAAQ;AACf,cAAM,iBAAiB,cAAc,KAAK,MAAM;AAChD,YAAI,gBAAgB;AAClB,iBAAO;AAAA,QACT;AACA,aAAK,OAAO,gBAAgB;AAAA,MAC9B;AACA,WAAK,OAAO,6BAA6B;AAAA,IAC3C;AAAA;AAAA;AAAA;AAAA,IAKA,IAAI,iBAAiB;AACnB,UAAI,KAAK,QAAQ;AACf,eAAO,KAAK;AAAA,MACd,WAAW,KAAK,SAAS;AACvB,eAAO,KAAK;AAAA,MACd,OAAO;AACL,aAAK,OAAO,wCAAwC;AAAA,MACtD;AAAA,IACF;AAAA;AAAA;AAAA;AAAA,IAKA,IAAI,kBAAkB;AACpB,aAAO,KAAK,gBAAgB,QAAQ,UAAU,IAAI;AAAA,IACpD;AAAA;AAAA;AAAA;AAAA,IAKA,IAAI,kBAAkB;AACpB,UAAI,KAAK,sBAAsB,MAAM;AACnC,cAAM,WAAW,KAAK,cAAc,cAAc,UAAU;AAC5D,aAAK,YAAY,QAAQ;AACzB,eAAO;AAAA,MACT,WAAW,KAAK,6BAA6B,qBAAqB;AAChE,eAAO,KAAK;AAAA,MACd;AACA,WAAK,OAAO,kDAAkD;AAAA,IAChE;AAAA;AAAA;AAAA;AAAA,IAKA,IAAI,SAAS;AACX,aAAO,KAAK,aAAa,QAAQ;AAAA,IACnC;AAAA;AAAA;AAAA;AAAA;AAAA,IAMA,IAAI,SAAS;AACX,aAAO,KAAK,aAAa,QAAQ;AAAA,IACnC;AAAA;AAAA;AAAA;AAAA,IAKA,IAAI,UAAU;AACZ,aAAO,KAAK,aAAa,SAAS;AAAA,IACpC;AAAA;AAAA;AAAA;AAAA,IAKA,IAAI,YAAY;AACd,aAAO,KAAK,aAAa,YAAY;AAAA,IACvC;AAAA,IAEA,OAAO,SAAS;AACd,YAAM,IAAI,MAAM,GAAG,KAAK,WAAW,KAAK,OAAO,EAAE;AAAA,IACnD;AAAA,IAEA,IAAI,cAAc;AAChB,cAAQ,KAAK,UAAU,MAAM,SAAS,KAAK,CAAC,GAAG,CAAC,KAAK;AAAA,IACvD;AAAA,IAEA,IAAI,oBAAoB;AACtB,aAAO,IAAI,YAAY,8BAA8B;AAAA,QACnD,SAAS;AAAA,QACT,YAAY;AAAA,QACZ,QAAQ,EAAE,WAAW,MAAM,QAAQ,eAAc,cAAc;AAAA,MACjE,CAAC;AAAA,IACH;AAAA,IAEA,IAAI,qBAAqB;AACvB,YAAM,UAAU,KAAK,eAAe,eAAe,KAAK,MAAM;AAE9D,UAAI,YAAY,MAAM;AACpB,eAAO,CAAC,OAAO;AAAA,MACjB,OAAO;AACL,eAAO,CAAC;AAAA,MACV;AAAA,IACF;AAAA,IAEA,IAAI,wBAAwB;AAC1B,YAAM,WAAW,KAAK,eAAe,iBAAiB,KAAK,OAAO;AAElE,UAAI,SAAS,WAAW,GAAG;AACzB,eAAO,MAAM,UAAU,MAAM,KAAK,QAAQ;AAAA,MAC5C,OAAO;AACL,eAAO,CAAC;AAAA,MACV;AAAA,IACF;AAAA,EACF;AAEA,MAAM,sBAAN,cAAkC,YAAY;AAAA,IAC5C,eAAe;AAAA,IAEf,oBAAoB;AAClB,WAAK,eAAe,KAAK,IAAI,MAAM,WAAW,IAAI,IAAI,UAAU,KAAK,GAAG,IAAI,IAAI,YAAY,KAAK,GAAG;AAEpG,0BAAoB,KAAK,YAAY;AAAA,IACvC;AAAA,IAEA,uBAAuB;AACrB,UAAI,KAAK,cAAc;AACrB,aAAK,aAAa,MAAM;AAExB,+BAAuB,KAAK,YAAY;AAAA,MAC1C;AAAA,IACF;AAAA,IAEA,IAAI,MAAM;AACR,aAAO,KAAK,aAAa,KAAK,KAAK;AAAA,IACrC;AAAA,EACF;AAEA,eAAa,sBAAsB;AAEnC,MAAI,eAAe,IAAI,aAAa,MAAM,QAAW;AACnD,mBAAe,OAAO,eAAe,YAAY;AAAA,EACnD;AAEA,MAAI,eAAe,IAAI,cAAc,MAAM,QAAW;AACpD,mBAAe,OAAO,gBAAgB,aAAa;AAAA,EACrD;AAEA,MAAI,eAAe,IAAI,qBAAqB,MAAM,QAAW;AAC3D,mBAAe,OAAO,uBAAuB,mBAAmB;AAAA,EAClE;AAEA,GAAC,MAAM;AACL,QAAI,UAAU,SAAS;AACvB,QAAI,CAAC,QAAS;AACd,QAAI,QAAQ,aAAa,6BAA6B,EAAG;AAEzD,cAAU,QAAQ;AAClB,WAAO,SAAS;AACd,UAAI,WAAW,SAAS,MAAM;AAC5B,eAAO,QAAQ;AAAA,UACb;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAUA,QAAQ;AAAA,QACV;AAAA,MACF;AAEA,gBAAU,QAAQ;AAAA,IACpB;AAAA,EACF,GAAG;AAEH,SAAO,QAAQ,EAAE,GAAGY,QAAO,cAAc;AACzC,QAAM;;;ACvgON,MAAI;AAEJ,iBAAsB,cAAc;AAClC,WAAO,YAAY,YAAYE,gBAAe,EAAE,KAAK,WAAW,CAAC;AAAA,EACnE;AAEO,WAAS,YAAY,aAAa;AACvC,WAAO,WAAW;AAAA,EACpB;AAEA,iBAAsBA,kBAAiB;AACrC,UAAM,EAAE,gBAAAA,gBAAe,IAAI,MAAM;AACjC,WAAOA,gBAAe;AAAA,EACxB;AAEA,iBAAsB,YAAY,SAAS,OAAO;AAChD,UAAM,EAAE,cAAc,IAAI,MAAM,YAAY;AAC5C,WAAO,cAAc,OAAO,SAAS,KAAK;AAAA,EAC5C;;;ACCe,WAAR,KAAuB,KAAK;AAC/B,QAAI,CAAC,OAAO,OAAO,QAAQ,SAAU,QAAO;AAC5C,QAAI,eAAe,QAAQ,eAAe,OAAQ,QAAO;AACzD,QAAI,MAAM,QAAQ,GAAG,EAAG,QAAO,IAAI,IAAI,IAAI;AAC3C,WAAO,OAAO,KAAK,GAAG,EAAE,OAAO,SAAU,KAAK,KAAK;AAC/C,UAAI,QAAQ,IAAI,CAAC,EAAE,YAAY,IAAI,IAAI,MAAM,CAAC,EAAE,QAAQ,aAAa,SAAU,GAAG,GAAG;AACjF,eAAO,MAAM,EAAE,YAAY;AAAA,MAC/B,CAAC;AACD,UAAI,KAAK,IAAI,KAAK,IAAI,GAAG,CAAC;AAC1B,aAAO;AAAA,IACX,GAAG,CAAC,CAAC;AAAA,EACT;;;AC1BA,MAAM,gCAAN,cAA4C,YAAY;AAAA,IACtD,OAAO,qBAAqB,CAAC,WAAW,oBAAoB;AAAA,IAE5D,MAAM,oBAAoB;AACxB,0BAAoB,IAAI;AACxB,WAAK,eAAe,MAAM,YAAY,KAAK,SAAS;AAAA,QAClD,UAAU,KAAK,qBAAqB,KAAK,IAAI;AAAA,QAC7C,WAAW,KAAK,sBAAsB,KAAK,IAAI;AAAA,QAC/C,cAAc,KAAK,yBAAyB,KAAK,IAAI;AAAA,MACvD,CAAC;AAAA,IACH;AAAA,IAEA,uBAAuB;AACrB,6BAAuB,IAAI;AAC3B,UAAI,KAAK,aAAc,MAAK,aAAa,YAAY;AACrD,WAAK,yBAAyB;AAAA,IAChC;AAAA,IAEA,2BAA2B;AACzB,UAAI,KAAK,cAAc;AACrB,aAAK,qBAAqB;AAC1B,aAAK,kBAAkB;AAAA,MACzB;AAAA,IACF;AAAA,IAEA,qBAAqB,MAAM;AACzB,YAAM,QAAQ,IAAI,aAAa,WAAW,EAAE,KAAK,CAAC;AAClD,aAAO,KAAK,cAAc,KAAK;AAAA,IACjC;AAAA,IAEA,wBAAwB;AACtB,WAAK,aAAa,aAAa,EAAE;AAAA,IACnC;AAAA,IAEA,2BAA2B;AACzB,WAAK,gBAAgB,WAAW;AAAA,IAClC;AAAA,IAEA,IAAI,UAAU;AACZ,YAAM,UAAU,KAAK,aAAa,SAAS;AAC3C,YAAM,qBAAqB,KAAK,aAAa,oBAAoB;AACjE,aAAO,EAAE,SAAS,oBAAoB,GAAG,KAAS,EAAE,GAAG,KAAK,QAAQ,CAAC,EAAE;AAAA,IACzE;AAAA,EACF;AAGA,MAAI,eAAe,IAAI,2BAA2B,MAAM,QAAW;AACjE,mBAAe,OAAO,6BAA6B,6BAA6B;AAAA,EAClF;;;ACpDO,WAAS,4BAA4B,OAAO;AACjD,QAAI,MAAM,kBAAkB,iBAAiB;AAC3C,YAAM,EAAE,QAAQ,MAAM,QAAQ,EAAE,aAAa,EAAE,IAAI;AAEnD,WAAK,iBAAiB,sBAAsB,CAAC,EAAE,QAAQ,EAAE,gBAAgB,EAAE,WAAAC,WAAU,EAAE,EAAE,MAAM;AAC7F,cAAM,OAAO,WAAW,aAAa,IAAI,IAAI,aAAa,OAAO,IAAI,gBAAgB;AACrF,cAAM,SAAS,qBAAqBA,YAAW,MAAM,IAAI;AAEzD,YAAI,CAAC,OAAO,KAAK,MAAM,GAAG;AACxB,cAAI,QAAQ,KAAK,MAAM,GAAG;AACxB,iBAAK,OAAO,SAAS;AAAA,UACvB,OAAO;AACL,iBAAK,IAAI,WAAW,MAAM;AAAA,UAC5B;AAEA,uBAAa,SAAS;AAAA,QACxB;AAAA,MACF,GAAG,EAAE,MAAM,KAAK,CAAC;AAAA,IACnB;AAAA,EACF;AAEA,WAAS,qBAAqBA,YAAW,MAAM,MAAM;AACnD,UAAM,aAAa,oBAAoBA,UAAS;AAChD,UAAM,iBAAiB,KAAK,IAAI,SAAS;AACzC,UAAM,SAAS,KAAK,aAAa,QAAQ,KAAK;AAE9C,QAAI,OAAO,cAAc,UAAU;AACjC,aAAO;AAAA,IACT,WAAW,OAAO,kBAAkB,UAAU;AAC5C,aAAO;AAAA,IACT,OAAO;AACL,aAAO;AAAA,IACT;AAAA,EACF;AAEA,WAAS,oBAAoBA,YAAW;AACtC,QAAIA,sBAAqB,qBAAqBA,sBAAqB,kBAAkB;AAQnF,UAAIA,WAAU,SAAS,WAAW;AAChC,eAAOA,WAAU;AAAA,MACnB,WAAWA,WAAU,aAAa,YAAY,GAAG;AAC/C,eAAOA,WAAU;AAAA,MACnB,OAAO;AACL,eAAO;AAAA,MACT;AAAA,IACF,OAAO;AACL,aAAO;AAAA,IACT;AAAA,EACF;AAEA,WAAS,WAAW,MAAM;AACxB,WAAO,gBAAgB,YAAY,gBAAgB;AAAA,EACrD;;;AChDA,SAAO,QAAQ;AAEf,mBAAiB,8BAA8B,2BAA2B;;;ACR1E,MAAM,gBAAN,MAAoB;AAAA,IAChB,YAAY,aAAa,WAAW,cAAc;AAC9C,WAAK,cAAc;AACnB,WAAK,YAAY;AACjB,WAAK,eAAe;AACpB,WAAK,oBAAoB,oBAAI,IAAI;AAAA,IACrC;AAAA,IACA,UAAU;AACN,WAAK,YAAY,iBAAiB,KAAK,WAAW,MAAM,KAAK,YAAY;AAAA,IAC7E;AAAA,IACA,aAAa;AACT,WAAK,YAAY,oBAAoB,KAAK,WAAW,MAAM,KAAK,YAAY;AAAA,IAChF;AAAA,IACA,iBAAiB,SAAS;AACtB,WAAK,kBAAkB,IAAI,OAAO;AAAA,IACtC;AAAA,IACA,oBAAoB,SAAS;AACzB,WAAK,kBAAkB,OAAO,OAAO;AAAA,IACzC;AAAA,IACA,YAAY,OAAO;AACf,YAAM,gBAAgB,YAAY,KAAK;AACvC,iBAAW,WAAW,KAAK,UAAU;AACjC,YAAI,cAAc,6BAA6B;AAC3C;AAAA,QACJ,OACK;AACD,kBAAQ,YAAY,aAAa;AAAA,QACrC;AAAA,MACJ;AAAA,IACJ;AAAA,IACA,cAAc;AACV,aAAO,KAAK,kBAAkB,OAAO;AAAA,IACzC;AAAA,IACA,IAAI,WAAW;AACX,aAAO,MAAM,KAAK,KAAK,iBAAiB,EAAE,KAAK,CAAC,MAAM,UAAU;AAC5D,cAAM,YAAY,KAAK,OAAO,aAAa,MAAM;AACjD,eAAO,YAAY,aAAa,KAAK,YAAY,aAAa,IAAI;AAAA,MACtE,CAAC;AAAA,IACL;AAAA,EACJ;AACA,WAAS,YAAY,OAAO;AACxB,QAAI,iCAAiC,OAAO;AACxC,aAAO;AAAA,IACX,OACK;AACD,YAAM,EAAE,yBAAyB,IAAI;AACrC,aAAO,OAAO,OAAO,OAAO;AAAA,QACxB,6BAA6B;AAAA,QAC7B,2BAA2B;AACvB,eAAK,8BAA8B;AACnC,mCAAyB,KAAK,IAAI;AAAA,QACtC;AAAA,MACJ,CAAC;AAAA,IACL;AAAA,EACJ;AAEA,MAAM,aAAN,MAAiB;AAAA,IACb,YAAYC,cAAa;AACrB,WAAK,cAAcA;AACnB,WAAK,oBAAoB,oBAAI,IAAI;AACjC,WAAK,UAAU;AAAA,IACnB;AAAA,IACA,QAAQ;AACJ,UAAI,CAAC,KAAK,SAAS;AACf,aAAK,UAAU;AACf,aAAK,eAAe,QAAQ,CAAC,kBAAkB,cAAc,QAAQ,CAAC;AAAA,MAC1E;AAAA,IACJ;AAAA,IACA,OAAO;AACH,UAAI,KAAK,SAAS;AACd,aAAK,UAAU;AACf,aAAK,eAAe,QAAQ,CAAC,kBAAkB,cAAc,WAAW,CAAC;AAAA,MAC7E;AAAA,IACJ;AAAA,IACA,IAAI,iBAAiB;AACjB,aAAO,MAAM,KAAK,KAAK,kBAAkB,OAAO,CAAC,EAAE,OAAO,CAAC,WAAWC,SAAQ,UAAU,OAAO,MAAM,KAAKA,KAAI,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC;AAAA,IAChI;AAAA,IACA,iBAAiB,SAAS;AACtB,WAAK,6BAA6B,OAAO,EAAE,iBAAiB,OAAO;AAAA,IACvE;AAAA,IACA,oBAAoB,SAAS,sBAAsB,OAAO;AACtD,WAAK,6BAA6B,OAAO,EAAE,oBAAoB,OAAO;AACtE,UAAI;AACA,aAAK,8BAA8B,OAAO;AAAA,IAClD;AAAA,IACA,YAAYC,QAAO,SAAS,SAAS,CAAC,GAAG;AACrC,WAAK,YAAY,YAAYA,QAAO,SAAS,OAAO,IAAI,MAAM;AAAA,IAClE;AAAA,IACA,8BAA8B,SAAS;AACnC,YAAM,gBAAgB,KAAK,6BAA6B,OAAO;AAC/D,UAAI,CAAC,cAAc,YAAY,GAAG;AAC9B,sBAAc,WAAW;AACzB,aAAK,6BAA6B,OAAO;AAAA,MAC7C;AAAA,IACJ;AAAA,IACA,6BAA6B,SAAS;AAClC,YAAM,EAAE,aAAa,WAAW,aAAa,IAAI;AACjD,YAAM,mBAAmB,KAAK,oCAAoC,WAAW;AAC7E,YAAM,WAAW,KAAK,SAAS,WAAW,YAAY;AACtD,uBAAiB,OAAO,QAAQ;AAChC,UAAI,iBAAiB,QAAQ;AACzB,aAAK,kBAAkB,OAAO,WAAW;AAAA,IACjD;AAAA,IACA,6BAA6B,SAAS;AAClC,YAAM,EAAE,aAAa,WAAW,aAAa,IAAI;AACjD,aAAO,KAAK,mBAAmB,aAAa,WAAW,YAAY;AAAA,IACvE;AAAA,IACA,mBAAmB,aAAa,WAAW,cAAc;AACrD,YAAM,mBAAmB,KAAK,oCAAoC,WAAW;AAC7E,YAAM,WAAW,KAAK,SAAS,WAAW,YAAY;AACtD,UAAI,gBAAgB,iBAAiB,IAAI,QAAQ;AACjD,UAAI,CAAC,eAAe;AAChB,wBAAgB,KAAK,oBAAoB,aAAa,WAAW,YAAY;AAC7E,yBAAiB,IAAI,UAAU,aAAa;AAAA,MAChD;AACA,aAAO;AAAA,IACX;AAAA,IACA,oBAAoB,aAAa,WAAW,cAAc;AACtD,YAAM,gBAAgB,IAAI,cAAc,aAAa,WAAW,YAAY;AAC5E,UAAI,KAAK,SAAS;AACd,sBAAc,QAAQ;AAAA,MAC1B;AACA,aAAO;AAAA,IACX;AAAA,IACA,oCAAoC,aAAa;AAC7C,UAAI,mBAAmB,KAAK,kBAAkB,IAAI,WAAW;AAC7D,UAAI,CAAC,kBAAkB;AACnB,2BAAmB,oBAAI,IAAI;AAC3B,aAAK,kBAAkB,IAAI,aAAa,gBAAgB;AAAA,MAC5D;AACA,aAAO;AAAA,IACX;AAAA,IACA,SAAS,WAAW,cAAc;AAC9B,YAAM,QAAQ,CAAC,SAAS;AACxB,aAAO,KAAK,YAAY,EACnB,KAAK,EACL,QAAQ,CAAC,QAAQ;AAClB,cAAM,KAAK,GAAG,aAAa,GAAG,IAAI,KAAK,GAAG,GAAG,GAAG,EAAE;AAAA,MACtD,CAAC;AACD,aAAO,MAAM,KAAK,GAAG;AAAA,IACzB;AAAA,EACJ;AAEA,MAAM,iCAAiC;AAAA,IACnC,KAAK,EAAE,OAAO,MAAM,GAAG;AACnB,UAAI;AACA,cAAM,gBAAgB;AAC1B,aAAO;AAAA,IACX;AAAA,IACA,QAAQ,EAAE,OAAO,MAAM,GAAG;AACtB,UAAI;AACA,cAAM,eAAe;AACzB,aAAO;AAAA,IACX;AAAA,IACA,KAAK,EAAE,OAAO,OAAO,QAAQ,GAAG;AAC5B,UAAI,OAAO;AACP,eAAO,YAAY,MAAM;AAAA,MAC7B,OACK;AACD,eAAO;AAAA,MACX;AAAA,IACJ;AAAA,EACJ;AACA,MAAM,oBAAoB;AAC1B,WAAS,4BAA4B,kBAAkB;AACnD,UAAM,SAAS,iBAAiB,KAAK;AACrC,UAAMC,WAAU,OAAO,MAAM,iBAAiB,KAAK,CAAC;AACpD,QAAI,YAAYA,SAAQ,CAAC;AACzB,QAAI,YAAYA,SAAQ,CAAC;AACzB,QAAI,aAAa,CAAC,CAAC,WAAW,SAAS,UAAU,EAAE,SAAS,SAAS,GAAG;AACpE,mBAAa,IAAI,SAAS;AAC1B,kBAAY;AAAA,IAChB;AACA,WAAO;AAAA,MACH,aAAa,iBAAiBA,SAAQ,CAAC,CAAC;AAAA,MACxC;AAAA,MACA,cAAcA,SAAQ,CAAC,IAAI,kBAAkBA,SAAQ,CAAC,CAAC,IAAI,CAAC;AAAA,MAC5D,YAAYA,SAAQ,CAAC;AAAA,MACrB,YAAYA,SAAQ,CAAC;AAAA,MACrB,WAAWA,SAAQ,CAAC,KAAK;AAAA,IAC7B;AAAA,EACJ;AACA,WAAS,iBAAiB,iBAAiB;AACvC,QAAI,mBAAmB,UAAU;AAC7B,aAAO;AAAA,IACX,WACS,mBAAmB,YAAY;AACpC,aAAO;AAAA,IACX;AAAA,EACJ;AACA,WAAS,kBAAkB,cAAc;AACrC,WAAO,aACF,MAAM,GAAG,EACT,OAAO,CAAC,SAAS,UAAU,OAAO,OAAO,SAAS,EAAE,CAAC,MAAM,QAAQ,MAAM,EAAE,CAAC,GAAG,CAAC,KAAK,KAAK,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC;AAAA,EAChH;AACA,WAAS,qBAAqB,aAAa;AACvC,QAAI,eAAe,QAAQ;AACvB,aAAO;AAAA,IACX,WACS,eAAe,UAAU;AAC9B,aAAO;AAAA,IACX;AAAA,EACJ;AAEA,WAAS,SAAS,OAAO;AACrB,WAAO,MAAM,QAAQ,uBAAuB,CAAC,GAAG,SAAS,KAAK,YAAY,CAAC;AAAA,EAC/E;AACA,WAAS,kBAAkB,OAAO;AAC9B,WAAO,SAAS,MAAM,QAAQ,OAAO,GAAG,EAAE,QAAQ,OAAO,GAAG,CAAC;AAAA,EACjE;AACA,WAAS,WAAW,OAAO;AACvB,WAAO,MAAM,OAAO,CAAC,EAAE,YAAY,IAAI,MAAM,MAAM,CAAC;AAAA,EACxD;AACA,WAAS,UAAU,OAAO;AACtB,WAAO,MAAM,QAAQ,YAAY,CAAC,GAAG,SAAS,IAAI,KAAK,YAAY,CAAC,EAAE;AAAA,EAC1E;AACA,WAAS,SAAS,OAAO;AACrB,WAAO,MAAM,MAAM,SAAS,KAAK,CAAC;AAAA,EACtC;AAEA,WAAS,YAAY,QAAQ;AACzB,WAAO,WAAW,QAAQ,WAAW;AAAA,EACzC;AACA,WAAS,YAAY,QAAQ,UAAU;AACnC,WAAO,OAAO,UAAU,eAAe,KAAK,QAAQ,QAAQ;AAAA,EAChE;AAEA,MAAM,eAAe,CAAC,QAAQ,QAAQ,OAAO,OAAO;AACpD,MAAM,SAAN,MAAa;AAAA,IACT,YAAY,SAASC,QAAO,YAAY,QAAQ;AAC5C,WAAK,UAAU;AACf,WAAK,QAAQA;AACb,WAAK,cAAc,WAAW,eAAe;AAC7C,WAAK,YAAY,WAAW,aAAa,8BAA8B,OAAO,KAAK,MAAM,oBAAoB;AAC7G,WAAK,eAAe,WAAW,gBAAgB,CAAC;AAChD,WAAK,aAAa,WAAW,cAAc,MAAM,oBAAoB;AACrE,WAAK,aAAa,WAAW,cAAc,MAAM,qBAAqB;AACtE,WAAK,YAAY,WAAW,aAAa;AACzC,WAAK,SAAS;AAAA,IAClB;AAAA,IACA,OAAO,SAAS,OAAO,QAAQ;AAC3B,aAAO,IAAI,KAAK,MAAM,SAAS,MAAM,OAAO,4BAA4B,MAAM,OAAO,GAAG,MAAM;AAAA,IAClG;AAAA,IACA,WAAW;AACP,YAAM,cAAc,KAAK,YAAY,IAAI,KAAK,SAAS,KAAK;AAC5D,YAAM,cAAc,KAAK,kBAAkB,IAAI,KAAK,eAAe,KAAK;AACxE,aAAO,GAAG,KAAK,SAAS,GAAG,WAAW,GAAG,WAAW,KAAK,KAAK,UAAU,IAAI,KAAK,UAAU;AAAA,IAC/F;AAAA,IACA,0BAA0B,OAAO;AAC7B,UAAI,CAAC,KAAK,WAAW;AACjB,eAAO;AAAA,MACX;AACA,YAAM,UAAU,KAAK,UAAU,MAAM,GAAG;AACxC,UAAI,KAAK,sBAAsB,OAAO,OAAO,GAAG;AAC5C,eAAO;AAAA,MACX;AACA,YAAM,iBAAiB,QAAQ,OAAO,CAAC,QAAQ,CAAC,aAAa,SAAS,GAAG,CAAC,EAAE,CAAC;AAC7E,UAAI,CAAC,gBAAgB;AACjB,eAAO;AAAA,MACX;AACA,UAAI,CAAC,YAAY,KAAK,aAAa,cAAc,GAAG;AAChD,cAAM,gCAAgC,KAAK,SAAS,EAAE;AAAA,MAC1D;AACA,aAAO,KAAK,YAAY,cAAc,EAAE,YAAY,MAAM,MAAM,IAAI,YAAY;AAAA,IACpF;AAAA,IACA,uBAAuB,OAAO;AAC1B,UAAI,CAAC,KAAK,WAAW;AACjB,eAAO;AAAA,MACX;AACA,YAAM,UAAU,CAAC,KAAK,SAAS;AAC/B,UAAI,KAAK,sBAAsB,OAAO,OAAO,GAAG;AAC5C,eAAO;AAAA,MACX;AACA,aAAO;AAAA,IACX;AAAA,IACA,IAAI,SAAS;AACT,YAAM,SAAS,CAAC;AAChB,YAAM,UAAU,IAAI,OAAO,SAAS,KAAK,UAAU,gBAAgB,GAAG;AACtE,iBAAW,EAAE,MAAAC,SAAM,MAAM,KAAK,MAAM,KAAK,KAAK,QAAQ,UAAU,GAAG;AAC/D,cAAM,QAAQA,QAAK,MAAM,OAAO;AAChC,cAAM,MAAM,SAAS,MAAM,CAAC;AAC5B,YAAI,KAAK;AACL,iBAAO,SAAS,GAAG,CAAC,IAAI,SAAS,KAAK;AAAA,QAC1C;AAAA,MACJ;AACA,aAAO;AAAA,IACX;AAAA,IACA,IAAI,kBAAkB;AAClB,aAAO,qBAAqB,KAAK,WAAW;AAAA,IAChD;AAAA,IACA,IAAI,cAAc;AACd,aAAO,KAAK,OAAO;AAAA,IACvB;AAAA,IACA,sBAAsB,OAAO,SAAS;AAClC,YAAM,CAAC,MAAM,MAAM,KAAK,KAAK,IAAI,aAAa,IAAI,CAAC,aAAa,QAAQ,SAAS,QAAQ,CAAC;AAC1F,aAAO,MAAM,YAAY,QAAQ,MAAM,YAAY,QAAQ,MAAM,WAAW,OAAO,MAAM,aAAa;AAAA,IAC1G;AAAA,EACJ;AACA,MAAM,oBAAoB;AAAA,IACtB,GAAG,MAAM;AAAA,IACT,QAAQ,MAAM;AAAA,IACd,MAAM,MAAM;AAAA,IACZ,SAAS,MAAM;AAAA,IACf,OAAO,CAACC,OAAOA,GAAE,aAAa,MAAM,KAAK,WAAW,UAAU;AAAA,IAC9D,QAAQ,MAAM;AAAA,IACd,UAAU,MAAM;AAAA,EACpB;AACA,WAAS,8BAA8B,SAAS;AAC5C,UAAM,UAAU,QAAQ,QAAQ,YAAY;AAC5C,QAAI,WAAW,mBAAmB;AAC9B,aAAO,kBAAkB,OAAO,EAAE,OAAO;AAAA,IAC7C;AAAA,EACJ;AACA,WAAS,MAAM,SAAS;AACpB,UAAM,IAAI,MAAM,OAAO;AAAA,EAC3B;AACA,WAAS,SAAS,OAAO;AACrB,QAAI;AACA,aAAO,KAAK,MAAM,KAAK;AAAA,IAC3B,SACO,KAAK;AACR,aAAO;AAAA,IACX;AAAA,EACJ;AAEA,MAAM,UAAN,MAAc;AAAA,IACV,YAAY,SAAS,QAAQ;AACzB,WAAK,UAAU;AACf,WAAK,SAAS;AAAA,IAClB;AAAA,IACA,IAAI,QAAQ;AACR,aAAO,KAAK,OAAO;AAAA,IACvB;AAAA,IACA,IAAI,cAAc;AACd,aAAO,KAAK,OAAO;AAAA,IACvB;AAAA,IACA,IAAI,eAAe;AACf,aAAO,KAAK,OAAO;AAAA,IACvB;AAAA,IACA,IAAI,aAAa;AACb,aAAO,KAAK,QAAQ;AAAA,IACxB;AAAA,IACA,YAAY,OAAO;AACf,YAAM,cAAc,KAAK,mBAAmB,KAAK;AACjD,UAAI,KAAK,qBAAqB,KAAK,KAAK,KAAK,oBAAoB,WAAW,GAAG;AAC3E,aAAK,gBAAgB,WAAW;AAAA,MACpC;AAAA,IACJ;AAAA,IACA,IAAI,YAAY;AACZ,aAAO,KAAK,OAAO;AAAA,IACvB;AAAA,IACA,IAAI,SAAS;AACT,YAAM,SAAS,KAAK,WAAW,KAAK,UAAU;AAC9C,UAAI,OAAO,UAAU,YAAY;AAC7B,eAAO;AAAA,MACX;AACA,YAAM,IAAI,MAAM,WAAW,KAAK,MAAM,kCAAkC,KAAK,UAAU,GAAG;AAAA,IAC9F;AAAA,IACA,oBAAoB,OAAO;AACvB,YAAM,EAAE,QAAQ,IAAI,KAAK;AACzB,YAAM,EAAE,wBAAwB,IAAI,KAAK,QAAQ;AACjD,YAAM,EAAE,WAAW,IAAI,KAAK;AAC5B,UAAI,SAAS;AACb,iBAAW,CAACD,SAAM,KAAK,KAAK,OAAO,QAAQ,KAAK,YAAY,GAAG;AAC3D,YAAIA,WAAQ,yBAAyB;AACjC,gBAAME,UAAS,wBAAwBF,OAAI;AAC3C,mBAAS,UAAUE,QAAO,EAAE,MAAAF,SAAM,OAAO,OAAO,SAAS,WAAW,CAAC;AAAA,QACzE,OACK;AACD;AAAA,QACJ;AAAA,MACJ;AACA,aAAO;AAAA,IACX;AAAA,IACA,mBAAmB,OAAO;AACtB,aAAO,OAAO,OAAO,OAAO,EAAE,QAAQ,KAAK,OAAO,OAAO,CAAC;AAAA,IAC9D;AAAA,IACA,gBAAgB,OAAO;AACnB,YAAM,EAAE,QAAQ,cAAc,IAAI;AAClC,UAAI;AACA,aAAK,OAAO,KAAK,KAAK,YAAY,KAAK;AACvC,aAAK,QAAQ,iBAAiB,KAAK,YAAY,EAAE,OAAO,QAAQ,eAAe,QAAQ,KAAK,WAAW,CAAC;AAAA,MAC5G,SACOH,QAAO;AACV,cAAM,EAAE,YAAY,YAAY,SAAS,OAAAE,OAAM,IAAI;AACnD,cAAM,SAAS,EAAE,YAAY,YAAY,SAAS,OAAAA,QAAO,MAAM;AAC/D,aAAK,QAAQ,YAAYF,QAAO,oBAAoB,KAAK,MAAM,KAAK,MAAM;AAAA,MAC9E;AAAA,IACJ;AAAA,IACA,qBAAqB,OAAO;AACxB,YAAM,cAAc,MAAM;AAC1B,UAAI,iBAAiB,iBAAiB,KAAK,OAAO,0BAA0B,KAAK,GAAG;AAChF,eAAO;AAAA,MACX;AACA,UAAI,iBAAiB,cAAc,KAAK,OAAO,uBAAuB,KAAK,GAAG;AAC1E,eAAO;AAAA,MACX;AACA,UAAI,KAAK,YAAY,aAAa;AAC9B,eAAO;AAAA,MACX,WACS,uBAAuB,WAAW,KAAK,QAAQ,SAAS,WAAW,GAAG;AAC3E,eAAO,KAAK,MAAM,gBAAgB,WAAW;AAAA,MACjD,OACK;AACD,eAAO,KAAK,MAAM,gBAAgB,KAAK,OAAO,OAAO;AAAA,MACzD;AAAA,IACJ;AAAA,IACA,IAAI,aAAa;AACb,aAAO,KAAK,QAAQ;AAAA,IACxB;AAAA,IACA,IAAI,aAAa;AACb,aAAO,KAAK,OAAO;AAAA,IACvB;AAAA,IACA,IAAI,UAAU;AACV,aAAO,KAAK,MAAM;AAAA,IACtB;AAAA,IACA,IAAI,QAAQ;AACR,aAAO,KAAK,QAAQ;AAAA,IACxB;AAAA,EACJ;AAEA,MAAM,kBAAN,MAAsB;AAAA,IAClB,YAAY,SAAS,UAAU;AAC3B,WAAK,uBAAuB,EAAE,YAAY,MAAM,WAAW,MAAM,SAAS,KAAK;AAC/E,WAAK,UAAU;AACf,WAAK,UAAU;AACf,WAAK,WAAW;AAChB,WAAK,WAAW,oBAAI,IAAI;AACxB,WAAK,mBAAmB,IAAI,iBAAiB,CAAC,cAAc,KAAK,iBAAiB,SAAS,CAAC;AAAA,IAChG;AAAA,IACA,QAAQ;AACJ,UAAI,CAAC,KAAK,SAAS;AACf,aAAK,UAAU;AACf,aAAK,iBAAiB,QAAQ,KAAK,SAAS,KAAK,oBAAoB;AACrE,aAAK,QAAQ;AAAA,MACjB;AAAA,IACJ;AAAA,IACA,MAAM,UAAU;AACZ,UAAI,KAAK,SAAS;AACd,aAAK,iBAAiB,WAAW;AACjC,aAAK,UAAU;AAAA,MACnB;AACA,eAAS;AACT,UAAI,CAAC,KAAK,SAAS;AACf,aAAK,iBAAiB,QAAQ,KAAK,SAAS,KAAK,oBAAoB;AACrE,aAAK,UAAU;AAAA,MACnB;AAAA,IACJ;AAAA,IACA,OAAO;AACH,UAAI,KAAK,SAAS;AACd,aAAK,iBAAiB,YAAY;AAClC,aAAK,iBAAiB,WAAW;AACjC,aAAK,UAAU;AAAA,MACnB;AAAA,IACJ;AAAA,IACA,UAAU;AACN,UAAI,KAAK,SAAS;AACd,cAAMC,WAAU,IAAI,IAAI,KAAK,oBAAoB,CAAC;AAClD,mBAAW,WAAW,MAAM,KAAK,KAAK,QAAQ,GAAG;AAC7C,cAAI,CAACA,SAAQ,IAAI,OAAO,GAAG;AACvB,iBAAK,cAAc,OAAO;AAAA,UAC9B;AAAA,QACJ;AACA,mBAAW,WAAW,MAAM,KAAKA,QAAO,GAAG;AACvC,eAAK,WAAW,OAAO;AAAA,QAC3B;AAAA,MACJ;AAAA,IACJ;AAAA,IACA,iBAAiB,WAAW;AACxB,UAAI,KAAK,SAAS;AACd,mBAAW,YAAY,WAAW;AAC9B,eAAK,gBAAgB,QAAQ;AAAA,QACjC;AAAA,MACJ;AAAA,IACJ;AAAA,IACA,gBAAgB,UAAU;AACtB,UAAI,SAAS,QAAQ,cAAc;AAC/B,aAAK,uBAAuB,SAAS,QAAQ,SAAS,aAAa;AAAA,MACvE,WACS,SAAS,QAAQ,aAAa;AACnC,aAAK,oBAAoB,SAAS,YAAY;AAC9C,aAAK,kBAAkB,SAAS,UAAU;AAAA,MAC9C;AAAA,IACJ;AAAA,IACA,uBAAuB,SAAS,eAAe;AAC3C,UAAI,KAAK,SAAS,IAAI,OAAO,GAAG;AAC5B,YAAI,KAAK,SAAS,2BAA2B,KAAK,aAAa,OAAO,GAAG;AACrE,eAAK,SAAS,wBAAwB,SAAS,aAAa;AAAA,QAChE,OACK;AACD,eAAK,cAAc,OAAO;AAAA,QAC9B;AAAA,MACJ,WACS,KAAK,aAAa,OAAO,GAAG;AACjC,aAAK,WAAW,OAAO;AAAA,MAC3B;AAAA,IACJ;AAAA,IACA,oBAAoB,OAAO;AACvB,iBAAW,QAAQ,MAAM,KAAK,KAAK,GAAG;AAClC,cAAM,UAAU,KAAK,gBAAgB,IAAI;AACzC,YAAI,SAAS;AACT,eAAK,YAAY,SAAS,KAAK,aAAa;AAAA,QAChD;AAAA,MACJ;AAAA,IACJ;AAAA,IACA,kBAAkB,OAAO;AACrB,iBAAW,QAAQ,MAAM,KAAK,KAAK,GAAG;AAClC,cAAM,UAAU,KAAK,gBAAgB,IAAI;AACzC,YAAI,WAAW,KAAK,gBAAgB,OAAO,GAAG;AAC1C,eAAK,YAAY,SAAS,KAAK,UAAU;AAAA,QAC7C;AAAA,MACJ;AAAA,IACJ;AAAA,IACA,aAAa,SAAS;AAClB,aAAO,KAAK,SAAS,aAAa,OAAO;AAAA,IAC7C;AAAA,IACA,oBAAoB,OAAO,KAAK,SAAS;AACrC,aAAO,KAAK,SAAS,oBAAoB,IAAI;AAAA,IACjD;AAAA,IACA,YAAY,MAAM,WAAW;AACzB,iBAAW,WAAW,KAAK,oBAAoB,IAAI,GAAG;AAClD,kBAAU,KAAK,MAAM,OAAO;AAAA,MAChC;AAAA,IACJ;AAAA,IACA,gBAAgB,MAAM;AAClB,UAAI,KAAK,YAAY,KAAK,cAAc;AACpC,eAAO;AAAA,MACX;AAAA,IACJ;AAAA,IACA,gBAAgB,SAAS;AACrB,UAAI,QAAQ,eAAe,KAAK,QAAQ,aAAa;AACjD,eAAO;AAAA,MACX,OACK;AACD,eAAO,KAAK,QAAQ,SAAS,OAAO;AAAA,MACxC;AAAA,IACJ;AAAA,IACA,WAAW,SAAS;AAChB,UAAI,CAAC,KAAK,SAAS,IAAI,OAAO,GAAG;AAC7B,YAAI,KAAK,gBAAgB,OAAO,GAAG;AAC/B,eAAK,SAAS,IAAI,OAAO;AACzB,cAAI,KAAK,SAAS,gBAAgB;AAC9B,iBAAK,SAAS,eAAe,OAAO;AAAA,UACxC;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAAA,IACA,cAAc,SAAS;AACnB,UAAI,KAAK,SAAS,IAAI,OAAO,GAAG;AAC5B,aAAK,SAAS,OAAO,OAAO;AAC5B,YAAI,KAAK,SAAS,kBAAkB;AAChC,eAAK,SAAS,iBAAiB,OAAO;AAAA,QAC1C;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAEA,MAAM,oBAAN,MAAwB;AAAA,IACpB,YAAY,SAAS,eAAe,UAAU;AAC1C,WAAK,gBAAgB;AACrB,WAAK,WAAW;AAChB,WAAK,kBAAkB,IAAI,gBAAgB,SAAS,IAAI;AAAA,IAC5D;AAAA,IACA,IAAI,UAAU;AACV,aAAO,KAAK,gBAAgB;AAAA,IAChC;AAAA,IACA,IAAI,WAAW;AACX,aAAO,IAAI,KAAK,aAAa;AAAA,IACjC;AAAA,IACA,QAAQ;AACJ,WAAK,gBAAgB,MAAM;AAAA,IAC/B;AAAA,IACA,MAAM,UAAU;AACZ,WAAK,gBAAgB,MAAM,QAAQ;AAAA,IACvC;AAAA,IACA,OAAO;AACH,WAAK,gBAAgB,KAAK;AAAA,IAC9B;AAAA,IACA,UAAU;AACN,WAAK,gBAAgB,QAAQ;AAAA,IACjC;AAAA,IACA,IAAI,UAAU;AACV,aAAO,KAAK,gBAAgB;AAAA,IAChC;AAAA,IACA,aAAa,SAAS;AAClB,aAAO,QAAQ,aAAa,KAAK,aAAa;AAAA,IAClD;AAAA,IACA,oBAAoB,MAAM;AACtB,YAAM,QAAQ,KAAK,aAAa,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC;AAClD,YAAMA,WAAU,MAAM,KAAK,KAAK,iBAAiB,KAAK,QAAQ,CAAC;AAC/D,aAAO,MAAM,OAAOA,QAAO;AAAA,IAC/B;AAAA,IACA,eAAe,SAAS;AACpB,UAAI,KAAK,SAAS,yBAAyB;AACvC,aAAK,SAAS,wBAAwB,SAAS,KAAK,aAAa;AAAA,MACrE;AAAA,IACJ;AAAA,IACA,iBAAiB,SAAS;AACtB,UAAI,KAAK,SAAS,2BAA2B;AACzC,aAAK,SAAS,0BAA0B,SAAS,KAAK,aAAa;AAAA,MACvE;AAAA,IACJ;AAAA,IACA,wBAAwB,SAAS,eAAe;AAC5C,UAAI,KAAK,SAAS,gCAAgC,KAAK,iBAAiB,eAAe;AACnF,aAAK,SAAS,6BAA6B,SAAS,aAAa;AAAA,MACrE;AAAA,IACJ;AAAA,EACJ;AAEA,WAAS,IAAIF,MAAK,KAAK,OAAO;AAC1B,IAAAO,OAAMP,MAAK,GAAG,EAAE,IAAI,KAAK;AAAA,EAC7B;AACA,WAAS,IAAIA,MAAK,KAAK,OAAO;AAC1B,IAAAO,OAAMP,MAAK,GAAG,EAAE,OAAO,KAAK;AAC5B,UAAMA,MAAK,GAAG;AAAA,EAClB;AACA,WAASO,OAAMP,MAAK,KAAK;AACrB,QAAI,SAASA,KAAI,IAAI,GAAG;AACxB,QAAI,CAAC,QAAQ;AACT,eAAS,oBAAI,IAAI;AACjB,MAAAA,KAAI,IAAI,KAAK,MAAM;AAAA,IACvB;AACA,WAAO;AAAA,EACX;AACA,WAAS,MAAMA,MAAK,KAAK;AACrB,UAAM,SAASA,KAAI,IAAI,GAAG;AAC1B,QAAI,UAAU,QAAQ,OAAO,QAAQ,GAAG;AACpC,MAAAA,KAAI,OAAO,GAAG;AAAA,IAClB;AAAA,EACJ;AAEA,MAAM,WAAN,MAAe;AAAA,IACX,cAAc;AACV,WAAK,cAAc,oBAAI,IAAI;AAAA,IAC/B;AAAA,IACA,IAAI,OAAO;AACP,aAAO,MAAM,KAAK,KAAK,YAAY,KAAK,CAAC;AAAA,IAC7C;AAAA,IACA,IAAI,SAAS;AACT,YAAM,OAAO,MAAM,KAAK,KAAK,YAAY,OAAO,CAAC;AACjD,aAAO,KAAK,OAAO,CAAC,QAAQ,QAAQ,OAAO,OAAO,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;AAAA,IAC1E;AAAA,IACA,IAAI,OAAO;AACP,YAAM,OAAO,MAAM,KAAK,KAAK,YAAY,OAAO,CAAC;AACjD,aAAO,KAAK,OAAO,CAACQ,OAAM,QAAQA,QAAO,IAAI,MAAM,CAAC;AAAA,IACxD;AAAA,IACA,IAAI,KAAK,OAAO;AACZ,UAAI,KAAK,aAAa,KAAK,KAAK;AAAA,IACpC;AAAA,IACA,OAAO,KAAK,OAAO;AACf,UAAI,KAAK,aAAa,KAAK,KAAK;AAAA,IACpC;AAAA,IACA,IAAI,KAAK,OAAO;AACZ,YAAM,SAAS,KAAK,YAAY,IAAI,GAAG;AACvC,aAAO,UAAU,QAAQ,OAAO,IAAI,KAAK;AAAA,IAC7C;AAAA,IACA,OAAO,KAAK;AACR,aAAO,KAAK,YAAY,IAAI,GAAG;AAAA,IACnC;AAAA,IACA,SAAS,OAAO;AACZ,YAAM,OAAO,MAAM,KAAK,KAAK,YAAY,OAAO,CAAC;AACjD,aAAO,KAAK,KAAK,CAAC,QAAQ,IAAI,IAAI,KAAK,CAAC;AAAA,IAC5C;AAAA,IACA,gBAAgB,KAAK;AACjB,YAAM,SAAS,KAAK,YAAY,IAAI,GAAG;AACvC,aAAO,SAAS,MAAM,KAAK,MAAM,IAAI,CAAC;AAAA,IAC1C;AAAA,IACA,gBAAgB,OAAO;AACnB,aAAO,MAAM,KAAK,KAAK,WAAW,EAC7B,OAAO,CAAC,CAAC,MAAM,MAAM,MAAM,OAAO,IAAI,KAAK,CAAC,EAC5C,IAAI,CAAC,CAAC,KAAK,OAAO,MAAM,GAAG;AAAA,IACpC;AAAA,EACJ;AA2BA,MAAM,mBAAN,MAAuB;AAAA,IACnB,YAAY,SAAS,UAAU,UAAU,SAAS;AAC9C,WAAK,YAAY;AACjB,WAAK,UAAU;AACf,WAAK,kBAAkB,IAAI,gBAAgB,SAAS,IAAI;AACxD,WAAK,WAAW;AAChB,WAAK,mBAAmB,IAAI,SAAS;AAAA,IACzC;AAAA,IACA,IAAI,UAAU;AACV,aAAO,KAAK,gBAAgB;AAAA,IAChC;AAAA,IACA,IAAI,WAAW;AACX,aAAO,KAAK;AAAA,IAChB;AAAA,IACA,IAAI,SAAS,UAAU;AACnB,WAAK,YAAY;AACjB,WAAK,QAAQ;AAAA,IACjB;AAAA,IACA,QAAQ;AACJ,WAAK,gBAAgB,MAAM;AAAA,IAC/B;AAAA,IACA,MAAM,UAAU;AACZ,WAAK,gBAAgB,MAAM,QAAQ;AAAA,IACvC;AAAA,IACA,OAAO;AACH,WAAK,gBAAgB,KAAK;AAAA,IAC9B;AAAA,IACA,UAAU;AACN,WAAK,gBAAgB,QAAQ;AAAA,IACjC;AAAA,IACA,IAAI,UAAU;AACV,aAAO,KAAK,gBAAgB;AAAA,IAChC;AAAA,IACA,aAAa,SAAS;AAClB,YAAM,EAAE,SAAS,IAAI;AACrB,UAAI,UAAU;AACV,cAAMC,WAAU,QAAQ,QAAQ,QAAQ;AACxC,YAAI,KAAK,SAAS,sBAAsB;AACpC,iBAAOA,YAAW,KAAK,SAAS,qBAAqB,SAAS,KAAK,OAAO;AAAA,QAC9E;AACA,eAAOA;AAAA,MACX,OACK;AACD,eAAO;AAAA,MACX;AAAA,IACJ;AAAA,IACA,oBAAoB,MAAM;AACtB,YAAM,EAAE,SAAS,IAAI;AACrB,UAAI,UAAU;AACV,cAAM,QAAQ,KAAK,aAAa,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC;AAClD,cAAMA,WAAU,MAAM,KAAK,KAAK,iBAAiB,QAAQ,CAAC,EAAE,OAAO,CAACC,WAAU,KAAK,aAAaA,MAAK,CAAC;AACtG,eAAO,MAAM,OAAOD,QAAO;AAAA,MAC/B,OACK;AACD,eAAO,CAAC;AAAA,MACZ;AAAA,IACJ;AAAA,IACA,eAAe,SAAS;AACpB,YAAM,EAAE,SAAS,IAAI;AACrB,UAAI,UAAU;AACV,aAAK,gBAAgB,SAAS,QAAQ;AAAA,MAC1C;AAAA,IACJ;AAAA,IACA,iBAAiB,SAAS;AACtB,YAAM,YAAY,KAAK,iBAAiB,gBAAgB,OAAO;AAC/D,iBAAW,YAAY,WAAW;AAC9B,aAAK,kBAAkB,SAAS,QAAQ;AAAA,MAC5C;AAAA,IACJ;AAAA,IACA,wBAAwB,SAAS,gBAAgB;AAC7C,YAAM,EAAE,SAAS,IAAI;AACrB,UAAI,UAAU;AACV,cAAMA,WAAU,KAAK,aAAa,OAAO;AACzC,cAAM,gBAAgB,KAAK,iBAAiB,IAAI,UAAU,OAAO;AACjE,YAAIA,YAAW,CAAC,eAAe;AAC3B,eAAK,gBAAgB,SAAS,QAAQ;AAAA,QAC1C,WACS,CAACA,YAAW,eAAe;AAChC,eAAK,kBAAkB,SAAS,QAAQ;AAAA,QAC5C;AAAA,MACJ;AAAA,IACJ;AAAA,IACA,gBAAgB,SAAS,UAAU;AAC/B,WAAK,SAAS,gBAAgB,SAAS,UAAU,KAAK,OAAO;AAC7D,WAAK,iBAAiB,IAAI,UAAU,OAAO;AAAA,IAC/C;AAAA,IACA,kBAAkB,SAAS,UAAU;AACjC,WAAK,SAAS,kBAAkB,SAAS,UAAU,KAAK,OAAO;AAC/D,WAAK,iBAAiB,OAAO,UAAU,OAAO;AAAA,IAClD;AAAA,EACJ;AAEA,MAAM,oBAAN,MAAwB;AAAA,IACpB,YAAY,SAAS,UAAU;AAC3B,WAAK,UAAU;AACf,WAAK,WAAW;AAChB,WAAK,UAAU;AACf,WAAK,YAAY,oBAAI,IAAI;AACzB,WAAK,mBAAmB,IAAI,iBAAiB,CAAC,cAAc,KAAK,iBAAiB,SAAS,CAAC;AAAA,IAChG;AAAA,IACA,QAAQ;AACJ,UAAI,CAAC,KAAK,SAAS;AACf,aAAK,UAAU;AACf,aAAK,iBAAiB,QAAQ,KAAK,SAAS,EAAE,YAAY,MAAM,mBAAmB,KAAK,CAAC;AACzF,aAAK,QAAQ;AAAA,MACjB;AAAA,IACJ;AAAA,IACA,OAAO;AACH,UAAI,KAAK,SAAS;AACd,aAAK,iBAAiB,YAAY;AAClC,aAAK,iBAAiB,WAAW;AACjC,aAAK,UAAU;AAAA,MACnB;AAAA,IACJ;AAAA,IACA,UAAU;AACN,UAAI,KAAK,SAAS;AACd,mBAAW,iBAAiB,KAAK,qBAAqB;AAClD,eAAK,iBAAiB,eAAe,IAAI;AAAA,QAC7C;AAAA,MACJ;AAAA,IACJ;AAAA,IACA,iBAAiB,WAAW;AACxB,UAAI,KAAK,SAAS;AACd,mBAAW,YAAY,WAAW;AAC9B,eAAK,gBAAgB,QAAQ;AAAA,QACjC;AAAA,MACJ;AAAA,IACJ;AAAA,IACA,gBAAgB,UAAU;AACtB,YAAM,gBAAgB,SAAS;AAC/B,UAAI,eAAe;AACf,aAAK,iBAAiB,eAAe,SAAS,QAAQ;AAAA,MAC1D;AAAA,IACJ;AAAA,IACA,iBAAiB,eAAe,UAAU;AACtC,YAAM,MAAM,KAAK,SAAS,4BAA4B,aAAa;AACnE,UAAI,OAAO,MAAM;AACb,YAAI,CAAC,KAAK,UAAU,IAAI,aAAa,GAAG;AACpC,eAAK,kBAAkB,KAAK,aAAa;AAAA,QAC7C;AACA,cAAM,QAAQ,KAAK,QAAQ,aAAa,aAAa;AACrD,YAAI,KAAK,UAAU,IAAI,aAAa,KAAK,OAAO;AAC5C,eAAK,sBAAsB,OAAO,KAAK,QAAQ;AAAA,QACnD;AACA,YAAI,SAAS,MAAM;AACf,gBAAME,YAAW,KAAK,UAAU,IAAI,aAAa;AACjD,eAAK,UAAU,OAAO,aAAa;AACnC,cAAIA;AACA,iBAAK,oBAAoB,KAAK,eAAeA,SAAQ;AAAA,QAC7D,OACK;AACD,eAAK,UAAU,IAAI,eAAe,KAAK;AAAA,QAC3C;AAAA,MACJ;AAAA,IACJ;AAAA,IACA,kBAAkB,KAAK,eAAe;AAClC,UAAI,KAAK,SAAS,mBAAmB;AACjC,aAAK,SAAS,kBAAkB,KAAK,aAAa;AAAA,MACtD;AAAA,IACJ;AAAA,IACA,sBAAsB,OAAO,KAAK,UAAU;AACxC,UAAI,KAAK,SAAS,uBAAuB;AACrC,aAAK,SAAS,sBAAsB,OAAO,KAAK,QAAQ;AAAA,MAC5D;AAAA,IACJ;AAAA,IACA,oBAAoB,KAAK,eAAe,UAAU;AAC9C,UAAI,KAAK,SAAS,qBAAqB;AACnC,aAAK,SAAS,oBAAoB,KAAK,eAAe,QAAQ;AAAA,MAClE;AAAA,IACJ;AAAA,IACA,IAAI,sBAAsB;AACtB,aAAO,MAAM,KAAK,IAAI,IAAI,KAAK,sBAAsB,OAAO,KAAK,sBAAsB,CAAC,CAAC;AAAA,IAC7F;AAAA,IACA,IAAI,wBAAwB;AACxB,aAAO,MAAM,KAAK,KAAK,QAAQ,UAAU,EAAE,IAAI,CAAC,cAAc,UAAU,IAAI;AAAA,IAChF;AAAA,IACA,IAAI,yBAAyB;AACzB,aAAO,MAAM,KAAK,KAAK,UAAU,KAAK,CAAC;AAAA,IAC3C;AAAA,EACJ;AAEA,MAAM,oBAAN,MAAwB;AAAA,IACpB,YAAY,SAAS,eAAe,UAAU;AAC1C,WAAK,oBAAoB,IAAI,kBAAkB,SAAS,eAAe,IAAI;AAC3E,WAAK,WAAW;AAChB,WAAK,kBAAkB,IAAI,SAAS;AAAA,IACxC;AAAA,IACA,IAAI,UAAU;AACV,aAAO,KAAK,kBAAkB;AAAA,IAClC;AAAA,IACA,QAAQ;AACJ,WAAK,kBAAkB,MAAM;AAAA,IACjC;AAAA,IACA,MAAM,UAAU;AACZ,WAAK,kBAAkB,MAAM,QAAQ;AAAA,IACzC;AAAA,IACA,OAAO;AACH,WAAK,kBAAkB,KAAK;AAAA,IAChC;AAAA,IACA,UAAU;AACN,WAAK,kBAAkB,QAAQ;AAAA,IACnC;AAAA,IACA,IAAI,UAAU;AACV,aAAO,KAAK,kBAAkB;AAAA,IAClC;AAAA,IACA,IAAI,gBAAgB;AAChB,aAAO,KAAK,kBAAkB;AAAA,IAClC;AAAA,IACA,wBAAwB,SAAS;AAC7B,WAAK,cAAc,KAAK,qBAAqB,OAAO,CAAC;AAAA,IACzD;AAAA,IACA,6BAA6B,SAAS;AAClC,YAAM,CAAC,iBAAiB,aAAa,IAAI,KAAK,wBAAwB,OAAO;AAC7E,WAAK,gBAAgB,eAAe;AACpC,WAAK,cAAc,aAAa;AAAA,IACpC;AAAA,IACA,0BAA0B,SAAS;AAC/B,WAAK,gBAAgB,KAAK,gBAAgB,gBAAgB,OAAO,CAAC;AAAA,IACtE;AAAA,IACA,cAAc,QAAQ;AAClB,aAAO,QAAQ,CAAC,UAAU,KAAK,aAAa,KAAK,CAAC;AAAA,IACtD;AAAA,IACA,gBAAgB,QAAQ;AACpB,aAAO,QAAQ,CAAC,UAAU,KAAK,eAAe,KAAK,CAAC;AAAA,IACxD;AAAA,IACA,aAAa,OAAO;AAChB,WAAK,SAAS,aAAa,KAAK;AAChC,WAAK,gBAAgB,IAAI,MAAM,SAAS,KAAK;AAAA,IACjD;AAAA,IACA,eAAe,OAAO;AAClB,WAAK,SAAS,eAAe,KAAK;AAClC,WAAK,gBAAgB,OAAO,MAAM,SAAS,KAAK;AAAA,IACpD;AAAA,IACA,wBAAwB,SAAS;AAC7B,YAAM,iBAAiB,KAAK,gBAAgB,gBAAgB,OAAO;AACnE,YAAM,gBAAgB,KAAK,qBAAqB,OAAO;AACvD,YAAM,sBAAsB,IAAI,gBAAgB,aAAa,EAAE,UAAU,CAAC,CAAC,eAAe,YAAY,MAAM,CAAC,eAAe,eAAe,YAAY,CAAC;AACxJ,UAAI,uBAAuB,IAAI;AAC3B,eAAO,CAAC,CAAC,GAAG,CAAC,CAAC;AAAA,MAClB,OACK;AACD,eAAO,CAAC,eAAe,MAAM,mBAAmB,GAAG,cAAc,MAAM,mBAAmB,CAAC;AAAA,MAC/F;AAAA,IACJ;AAAA,IACA,qBAAqB,SAAS;AAC1B,YAAM,gBAAgB,KAAK;AAC3B,YAAM,cAAc,QAAQ,aAAa,aAAa,KAAK;AAC3D,aAAO,iBAAiB,aAAa,SAAS,aAAa;AAAA,IAC/D;AAAA,EACJ;AACA,WAAS,iBAAiB,aAAa,SAAS,eAAe;AAC3D,WAAO,YACF,KAAK,EACL,MAAM,KAAK,EACX,OAAO,CAAC,YAAY,QAAQ,MAAM,EAClC,IAAI,CAAC,SAASC,YAAW,EAAE,SAAS,eAAe,SAAS,OAAAA,OAAM,EAAE;AAAA,EAC7E;AACA,WAAS,IAAI,MAAM,OAAO;AACtB,UAAM,SAAS,KAAK,IAAI,KAAK,QAAQ,MAAM,MAAM;AACjD,WAAO,MAAM,KAAK,EAAE,OAAO,GAAG,CAAC,GAAGA,WAAU,CAAC,KAAKA,MAAK,GAAG,MAAMA,MAAK,CAAC,CAAC;AAAA,EAC3E;AACA,WAAS,eAAe,MAAM,OAAO;AACjC,WAAO,QAAQ,SAAS,KAAK,SAAS,MAAM,SAAS,KAAK,WAAW,MAAM;AAAA,EAC/E;AAEA,MAAM,oBAAN,MAAwB;AAAA,IACpB,YAAY,SAAS,eAAe,UAAU;AAC1C,WAAK,oBAAoB,IAAI,kBAAkB,SAAS,eAAe,IAAI;AAC3E,WAAK,WAAW;AAChB,WAAK,sBAAsB,oBAAI,QAAQ;AACvC,WAAK,yBAAyB,oBAAI,QAAQ;AAAA,IAC9C;AAAA,IACA,IAAI,UAAU;AACV,aAAO,KAAK,kBAAkB;AAAA,IAClC;AAAA,IACA,QAAQ;AACJ,WAAK,kBAAkB,MAAM;AAAA,IACjC;AAAA,IACA,OAAO;AACH,WAAK,kBAAkB,KAAK;AAAA,IAChC;AAAA,IACA,UAAU;AACN,WAAK,kBAAkB,QAAQ;AAAA,IACnC;AAAA,IACA,IAAI,UAAU;AACV,aAAO,KAAK,kBAAkB;AAAA,IAClC;AAAA,IACA,IAAI,gBAAgB;AAChB,aAAO,KAAK,kBAAkB;AAAA,IAClC;AAAA,IACA,aAAa,OAAO;AAChB,YAAM,EAAE,QAAQ,IAAI;AACpB,YAAM,EAAE,MAAM,IAAI,KAAK,yBAAyB,KAAK;AACrD,UAAI,OAAO;AACP,aAAK,6BAA6B,OAAO,EAAE,IAAI,OAAO,KAAK;AAC3D,aAAK,SAAS,oBAAoB,SAAS,KAAK;AAAA,MACpD;AAAA,IACJ;AAAA,IACA,eAAe,OAAO;AAClB,YAAM,EAAE,QAAQ,IAAI;AACpB,YAAM,EAAE,MAAM,IAAI,KAAK,yBAAyB,KAAK;AACrD,UAAI,OAAO;AACP,aAAK,6BAA6B,OAAO,EAAE,OAAO,KAAK;AACvD,aAAK,SAAS,sBAAsB,SAAS,KAAK;AAAA,MACtD;AAAA,IACJ;AAAA,IACA,yBAAyB,OAAO;AAC5B,UAAI,cAAc,KAAK,oBAAoB,IAAI,KAAK;AACpD,UAAI,CAAC,aAAa;AACd,sBAAc,KAAK,WAAW,KAAK;AACnC,aAAK,oBAAoB,IAAI,OAAO,WAAW;AAAA,MACnD;AACA,aAAO;AAAA,IACX;AAAA,IACA,6BAA6B,SAAS;AAClC,UAAI,gBAAgB,KAAK,uBAAuB,IAAI,OAAO;AAC3D,UAAI,CAAC,eAAe;AAChB,wBAAgB,oBAAI,IAAI;AACxB,aAAK,uBAAuB,IAAI,SAAS,aAAa;AAAA,MAC1D;AACA,aAAO;AAAA,IACX;AAAA,IACA,WAAW,OAAO;AACd,UAAI;AACA,cAAM,QAAQ,KAAK,SAAS,mBAAmB,KAAK;AACpD,eAAO,EAAE,MAAM;AAAA,MACnB,SACOC,QAAO;AACV,eAAO,EAAE,OAAAA,OAAM;AAAA,MACnB;AAAA,IACJ;AAAA,EACJ;AAEA,MAAM,kBAAN,MAAsB;AAAA,IAClB,YAAY,SAAS,UAAU;AAC3B,WAAK,UAAU;AACf,WAAK,WAAW;AAChB,WAAK,mBAAmB,oBAAI,IAAI;AAAA,IACpC;AAAA,IACA,QAAQ;AACJ,UAAI,CAAC,KAAK,mBAAmB;AACzB,aAAK,oBAAoB,IAAI,kBAAkB,KAAK,SAAS,KAAK,iBAAiB,IAAI;AACvF,aAAK,kBAAkB,MAAM;AAAA,MACjC;AAAA,IACJ;AAAA,IACA,OAAO;AACH,UAAI,KAAK,mBAAmB;AACxB,aAAK,kBAAkB,KAAK;AAC5B,eAAO,KAAK;AACZ,aAAK,qBAAqB;AAAA,MAC9B;AAAA,IACJ;AAAA,IACA,IAAI,UAAU;AACV,aAAO,KAAK,QAAQ;AAAA,IACxB;AAAA,IACA,IAAI,aAAa;AACb,aAAO,KAAK,QAAQ;AAAA,IACxB;AAAA,IACA,IAAI,kBAAkB;AAClB,aAAO,KAAK,OAAO;AAAA,IACvB;AAAA,IACA,IAAI,SAAS;AACT,aAAO,KAAK,QAAQ;AAAA,IACxB;AAAA,IACA,IAAI,WAAW;AACX,aAAO,MAAM,KAAK,KAAK,iBAAiB,OAAO,CAAC;AAAA,IACpD;AAAA,IACA,cAAc,QAAQ;AAClB,YAAM,UAAU,IAAI,QAAQ,KAAK,SAAS,MAAM;AAChD,WAAK,iBAAiB,IAAI,QAAQ,OAAO;AACzC,WAAK,SAAS,iBAAiB,OAAO;AAAA,IAC1C;AAAA,IACA,iBAAiB,QAAQ;AACrB,YAAM,UAAU,KAAK,iBAAiB,IAAI,MAAM;AAChD,UAAI,SAAS;AACT,aAAK,iBAAiB,OAAO,MAAM;AACnC,aAAK,SAAS,oBAAoB,OAAO;AAAA,MAC7C;AAAA,IACJ;AAAA,IACA,uBAAuB;AACnB,WAAK,SAAS,QAAQ,CAAC,YAAY,KAAK,SAAS,oBAAoB,SAAS,IAAI,CAAC;AACnF,WAAK,iBAAiB,MAAM;AAAA,IAChC;AAAA,IACA,mBAAmB,OAAO;AACtB,YAAM,SAAS,OAAO,SAAS,OAAO,KAAK,MAAM;AACjD,UAAI,OAAO,cAAc,KAAK,YAAY;AACtC,eAAO;AAAA,MACX;AAAA,IACJ;AAAA,IACA,oBAAoB,SAAS,QAAQ;AACjC,WAAK,cAAc,MAAM;AAAA,IAC7B;AAAA,IACA,sBAAsB,SAAS,QAAQ;AACnC,WAAK,iBAAiB,MAAM;AAAA,IAChC;AAAA,EACJ;AAEA,MAAM,gBAAN,MAAoB;AAAA,IAChB,YAAY,SAAS,UAAU;AAC3B,WAAK,UAAU;AACf,WAAK,WAAW;AAChB,WAAK,oBAAoB,IAAI,kBAAkB,KAAK,SAAS,IAAI;AACjE,WAAK,qBAAqB,KAAK,WAAW;AAAA,IAC9C;AAAA,IACA,QAAQ;AACJ,WAAK,kBAAkB,MAAM;AAC7B,WAAK,uCAAuC;AAAA,IAChD;AAAA,IACA,OAAO;AACH,WAAK,kBAAkB,KAAK;AAAA,IAChC;AAAA,IACA,IAAI,UAAU;AACV,aAAO,KAAK,QAAQ;AAAA,IACxB;AAAA,IACA,IAAI,aAAa;AACb,aAAO,KAAK,QAAQ;AAAA,IACxB;AAAA,IACA,4BAA4B,eAAe;AACvC,UAAI,iBAAiB,KAAK,oBAAoB;AAC1C,eAAO,KAAK,mBAAmB,aAAa,EAAE;AAAA,MAClD;AAAA,IACJ;AAAA,IACA,kBAAkB,KAAK,eAAe;AAClC,YAAM,aAAa,KAAK,mBAAmB,aAAa;AACxD,UAAI,CAAC,KAAK,SAAS,GAAG,GAAG;AACrB,aAAK,sBAAsB,KAAK,WAAW,OAAO,KAAK,SAAS,GAAG,CAAC,GAAG,WAAW,OAAO,WAAW,YAAY,CAAC;AAAA,MACrH;AAAA,IACJ;AAAA,IACA,sBAAsB,OAAOC,SAAM,UAAU;AACzC,YAAM,aAAa,KAAK,uBAAuBA,OAAI;AACnD,UAAI,UAAU;AACV;AACJ,UAAI,aAAa,MAAM;AACnB,mBAAW,WAAW,OAAO,WAAW,YAAY;AAAA,MACxD;AACA,WAAK,sBAAsBA,SAAM,OAAO,QAAQ;AAAA,IACpD;AAAA,IACA,oBAAoB,KAAK,eAAe,UAAU;AAC9C,YAAM,aAAa,KAAK,uBAAuB,GAAG;AAClD,UAAI,KAAK,SAAS,GAAG,GAAG;AACpB,aAAK,sBAAsB,KAAK,WAAW,OAAO,KAAK,SAAS,GAAG,CAAC,GAAG,QAAQ;AAAA,MACnF,OACK;AACD,aAAK,sBAAsB,KAAK,WAAW,OAAO,WAAW,YAAY,GAAG,QAAQ;AAAA,MACxF;AAAA,IACJ;AAAA,IACA,yCAAyC;AACrC,iBAAW,EAAE,KAAK,MAAAA,SAAM,cAAc,OAAO,KAAK,KAAK,kBAAkB;AACrE,YAAI,gBAAgB,UAAa,CAAC,KAAK,WAAW,KAAK,IAAI,GAAG,GAAG;AAC7D,eAAK,sBAAsBA,SAAM,OAAO,YAAY,GAAG,MAAS;AAAA,QACpE;AAAA,MACJ;AAAA,IACJ;AAAA,IACA,sBAAsBA,SAAM,UAAU,aAAa;AAC/C,YAAM,oBAAoB,GAAGA,OAAI;AACjC,YAAM,gBAAgB,KAAK,SAAS,iBAAiB;AACrD,UAAI,OAAO,iBAAiB,YAAY;AACpC,cAAM,aAAa,KAAK,uBAAuBA,OAAI;AACnD,YAAI;AACA,gBAAM,QAAQ,WAAW,OAAO,QAAQ;AACxC,cAAI,WAAW;AACf,cAAI,aAAa;AACb,uBAAW,WAAW,OAAO,WAAW;AAAA,UAC5C;AACA,wBAAc,KAAK,KAAK,UAAU,OAAO,QAAQ;AAAA,QACrD,SACOD,QAAO;AACV,cAAIA,kBAAiB,WAAW;AAC5B,YAAAA,OAAM,UAAU,mBAAmB,KAAK,QAAQ,UAAU,IAAI,WAAW,IAAI,OAAOA,OAAM,OAAO;AAAA,UACrG;AACA,gBAAMA;AAAA,QACV;AAAA,MACJ;AAAA,IACJ;AAAA,IACA,IAAI,mBAAmB;AACnB,YAAM,EAAE,mBAAmB,IAAI;AAC/B,aAAO,OAAO,KAAK,kBAAkB,EAAE,IAAI,CAAC,QAAQ,mBAAmB,GAAG,CAAC;AAAA,IAC/E;AAAA,IACA,IAAI,yBAAyB;AACzB,YAAM,cAAc,CAAC;AACrB,aAAO,KAAK,KAAK,kBAAkB,EAAE,QAAQ,CAAC,QAAQ;AAClD,cAAM,aAAa,KAAK,mBAAmB,GAAG;AAC9C,oBAAY,WAAW,IAAI,IAAI;AAAA,MACnC,CAAC;AACD,aAAO;AAAA,IACX;AAAA,IACA,SAAS,eAAe;AACpB,YAAM,aAAa,KAAK,uBAAuB,aAAa;AAC5D,YAAM,gBAAgB,MAAM,WAAW,WAAW,IAAI,CAAC;AACvD,aAAO,KAAK,SAAS,aAAa;AAAA,IACtC;AAAA,EACJ;AAEA,MAAM,iBAAN,MAAqB;AAAA,IACjB,YAAY,SAAS,UAAU;AAC3B,WAAK,UAAU;AACf,WAAK,WAAW;AAChB,WAAK,gBAAgB,IAAI,SAAS;AAAA,IACtC;AAAA,IACA,QAAQ;AACJ,UAAI,CAAC,KAAK,mBAAmB;AACzB,aAAK,oBAAoB,IAAI,kBAAkB,KAAK,SAAS,KAAK,eAAe,IAAI;AACrF,aAAK,kBAAkB,MAAM;AAAA,MACjC;AAAA,IACJ;AAAA,IACA,OAAO;AACH,UAAI,KAAK,mBAAmB;AACxB,aAAK,qBAAqB;AAC1B,aAAK,kBAAkB,KAAK;AAC5B,eAAO,KAAK;AAAA,MAChB;AAAA,IACJ;AAAA,IACA,aAAa,EAAE,SAAS,SAASC,QAAK,GAAG;AACrC,UAAI,KAAK,MAAM,gBAAgB,OAAO,GAAG;AACrC,aAAK,cAAc,SAASA,OAAI;AAAA,MACpC;AAAA,IACJ;AAAA,IACA,eAAe,EAAE,SAAS,SAASA,QAAK,GAAG;AACvC,WAAK,iBAAiB,SAASA,OAAI;AAAA,IACvC;AAAA,IACA,cAAc,SAASA,SAAM;AACzB,UAAI;AACJ,UAAI,CAAC,KAAK,cAAc,IAAIA,SAAM,OAAO,GAAG;AACxC,aAAK,cAAc,IAAIA,SAAM,OAAO;AACpC,SAAC,KAAK,KAAK,uBAAuB,QAAQ,OAAO,SAAS,SAAS,GAAG,MAAM,MAAM,KAAK,SAAS,gBAAgB,SAASA,OAAI,CAAC;AAAA,MAClI;AAAA,IACJ;AAAA,IACA,iBAAiB,SAASA,SAAM;AAC5B,UAAI;AACJ,UAAI,KAAK,cAAc,IAAIA,SAAM,OAAO,GAAG;AACvC,aAAK,cAAc,OAAOA,SAAM,OAAO;AACvC,SAAC,KAAK,KAAK,uBAAuB,QAAQ,OAAO,SAAS,SAAS,GAAG,MAAM,MAAM,KAAK,SAAS,mBAAmB,SAASA,OAAI,CAAC;AAAA,MACrI;AAAA,IACJ;AAAA,IACA,uBAAuB;AACnB,iBAAWA,WAAQ,KAAK,cAAc,MAAM;AACxC,mBAAW,WAAW,KAAK,cAAc,gBAAgBA,OAAI,GAAG;AAC5D,eAAK,iBAAiB,SAASA,OAAI;AAAA,QACvC;AAAA,MACJ;AAAA,IACJ;AAAA,IACA,IAAI,gBAAgB;AAChB,aAAO,QAAQ,KAAK,QAAQ,UAAU;AAAA,IAC1C;AAAA,IACA,IAAI,UAAU;AACV,aAAO,KAAK,QAAQ;AAAA,IACxB;AAAA,IACA,IAAI,QAAQ;AACR,aAAO,KAAK,QAAQ;AAAA,IACxB;AAAA,EACJ;AAEA,WAAS,iCAAiC,aAAa,cAAc;AACjE,UAAM,YAAY,2BAA2B,WAAW;AACxD,WAAO,MAAM,KAAK,UAAU,OAAO,CAAC,QAAQC,iBAAgB;AACxD,8BAAwBA,cAAa,YAAY,EAAE,QAAQ,CAACD,YAAS,OAAO,IAAIA,OAAI,CAAC;AACrF,aAAO;AAAA,IACX,GAAG,oBAAI,IAAI,CAAC,CAAC;AAAA,EACjB;AACA,WAAS,iCAAiC,aAAa,cAAc;AACjE,UAAM,YAAY,2BAA2B,WAAW;AACxD,WAAO,UAAU,OAAO,CAAC,OAAOC,iBAAgB;AAC5C,YAAM,KAAK,GAAG,wBAAwBA,cAAa,YAAY,CAAC;AAChE,aAAO;AAAA,IACX,GAAG,CAAC,CAAC;AAAA,EACT;AACA,WAAS,2BAA2B,aAAa;AAC7C,UAAM,YAAY,CAAC;AACnB,WAAO,aAAa;AAChB,gBAAU,KAAK,WAAW;AAC1B,oBAAc,OAAO,eAAe,WAAW;AAAA,IACnD;AACA,WAAO,UAAU,QAAQ;AAAA,EAC7B;AACA,WAAS,wBAAwB,aAAa,cAAc;AACxD,UAAM,aAAa,YAAY,YAAY;AAC3C,WAAO,MAAM,QAAQ,UAAU,IAAI,aAAa,CAAC;AAAA,EACrD;AACA,WAAS,wBAAwB,aAAa,cAAc;AACxD,UAAM,aAAa,YAAY,YAAY;AAC3C,WAAO,aAAa,OAAO,KAAK,UAAU,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,WAAW,GAAG,CAAC,CAAC,IAAI,CAAC;AAAA,EACxF;AAEA,MAAM,iBAAN,MAAqB;AAAA,IACjB,YAAY,SAAS,UAAU;AAC3B,WAAK,UAAU;AACf,WAAK,UAAU;AACf,WAAK,WAAW;AAChB,WAAK,gBAAgB,IAAI,SAAS;AAClC,WAAK,uBAAuB,IAAI,SAAS;AACzC,WAAK,sBAAsB,oBAAI,IAAI;AACnC,WAAK,uBAAuB,oBAAI,IAAI;AAAA,IACxC;AAAA,IACA,QAAQ;AACJ,UAAI,CAAC,KAAK,SAAS;AACf,aAAK,kBAAkB,QAAQ,CAAC,eAAe;AAC3C,eAAK,+BAA+B,UAAU;AAC9C,eAAK,gCAAgC,UAAU;AAAA,QACnD,CAAC;AACD,aAAK,UAAU;AACf,aAAK,kBAAkB,QAAQ,CAAC,YAAY,QAAQ,QAAQ,CAAC;AAAA,MACjE;AAAA,IACJ;AAAA,IACA,UAAU;AACN,WAAK,oBAAoB,QAAQ,CAAC,aAAa,SAAS,QAAQ,CAAC;AACjE,WAAK,qBAAqB,QAAQ,CAAC,aAAa,SAAS,QAAQ,CAAC;AAAA,IACtE;AAAA,IACA,OAAO;AACH,UAAI,KAAK,SAAS;AACd,aAAK,UAAU;AACf,aAAK,qBAAqB;AAC1B,aAAK,sBAAsB;AAC3B,aAAK,uBAAuB;AAAA,MAChC;AAAA,IACJ;AAAA,IACA,wBAAwB;AACpB,UAAI,KAAK,oBAAoB,OAAO,GAAG;AACnC,aAAK,oBAAoB,QAAQ,CAAC,aAAa,SAAS,KAAK,CAAC;AAC9D,aAAK,oBAAoB,MAAM;AAAA,MACnC;AAAA,IACJ;AAAA,IACA,yBAAyB;AACrB,UAAI,KAAK,qBAAqB,OAAO,GAAG;AACpC,aAAK,qBAAqB,QAAQ,CAAC,aAAa,SAAS,KAAK,CAAC;AAC/D,aAAK,qBAAqB,MAAM;AAAA,MACpC;AAAA,IACJ;AAAA,IACA,gBAAgB,SAAS,WAAW,EAAE,WAAW,GAAG;AAChD,YAAM,SAAS,KAAK,UAAU,SAAS,UAAU;AACjD,UAAI,QAAQ;AACR,aAAK,cAAc,QAAQ,SAAS,UAAU;AAAA,MAClD;AAAA,IACJ;AAAA,IACA,kBAAkB,SAAS,WAAW,EAAE,WAAW,GAAG;AAClD,YAAM,SAAS,KAAK,iBAAiB,SAAS,UAAU;AACxD,UAAI,QAAQ;AACR,aAAK,iBAAiB,QAAQ,SAAS,UAAU;AAAA,MACrD;AAAA,IACJ;AAAA,IACA,qBAAqB,SAAS,EAAE,WAAW,GAAG;AAC1C,YAAM,WAAW,KAAK,SAAS,UAAU;AACzC,YAAM,YAAY,KAAK,UAAU,SAAS,UAAU;AACpD,YAAM,sBAAsB,QAAQ,QAAQ,IAAI,KAAK,OAAO,mBAAmB,KAAK,UAAU,GAAG;AACjG,UAAI,UAAU;AACV,eAAO,aAAa,uBAAuB,QAAQ,QAAQ,QAAQ;AAAA,MACvE,OACK;AACD,eAAO;AAAA,MACX;AAAA,IACJ;AAAA,IACA,wBAAwB,UAAU,eAAe;AAC7C,YAAM,aAAa,KAAK,qCAAqC,aAAa;AAC1E,UAAI,YAAY;AACZ,aAAK,gCAAgC,UAAU;AAAA,MACnD;AAAA,IACJ;AAAA,IACA,6BAA6B,UAAU,eAAe;AAClD,YAAM,aAAa,KAAK,qCAAqC,aAAa;AAC1E,UAAI,YAAY;AACZ,aAAK,gCAAgC,UAAU;AAAA,MACnD;AAAA,IACJ;AAAA,IACA,0BAA0B,UAAU,eAAe;AAC/C,YAAM,aAAa,KAAK,qCAAqC,aAAa;AAC1E,UAAI,YAAY;AACZ,aAAK,gCAAgC,UAAU;AAAA,MACnD;AAAA,IACJ;AAAA,IACA,cAAc,QAAQ,SAAS,YAAY;AACvC,UAAI;AACJ,UAAI,CAAC,KAAK,qBAAqB,IAAI,YAAY,OAAO,GAAG;AACrD,aAAK,cAAc,IAAI,YAAY,MAAM;AACzC,aAAK,qBAAqB,IAAI,YAAY,OAAO;AACjD,SAAC,KAAK,KAAK,oBAAoB,IAAI,UAAU,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,MAAM,MAAM,KAAK,SAAS,gBAAgB,QAAQ,SAAS,UAAU,CAAC;AAAA,MAClK;AAAA,IACJ;AAAA,IACA,iBAAiB,QAAQ,SAAS,YAAY;AAC1C,UAAI;AACJ,UAAI,KAAK,qBAAqB,IAAI,YAAY,OAAO,GAAG;AACpD,aAAK,cAAc,OAAO,YAAY,MAAM;AAC5C,aAAK,qBAAqB,OAAO,YAAY,OAAO;AACpD,SAAC,KAAK,KAAK,oBACN,IAAI,UAAU,OAAO,QAAQ,OAAO,SAAS,SAAS,GAAG,MAAM,MAAM,KAAK,SAAS,mBAAmB,QAAQ,SAAS,UAAU,CAAC;AAAA,MAC3I;AAAA,IACJ;AAAA,IACA,uBAAuB;AACnB,iBAAW,cAAc,KAAK,qBAAqB,MAAM;AACrD,mBAAW,WAAW,KAAK,qBAAqB,gBAAgB,UAAU,GAAG;AACzE,qBAAW,UAAU,KAAK,cAAc,gBAAgB,UAAU,GAAG;AACjE,iBAAK,iBAAiB,QAAQ,SAAS,UAAU;AAAA,UACrD;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAAA,IACA,gCAAgC,YAAY;AACxC,YAAM,WAAW,KAAK,oBAAoB,IAAI,UAAU;AACxD,UAAI,UAAU;AACV,iBAAS,WAAW,KAAK,SAAS,UAAU;AAAA,MAChD;AAAA,IACJ;AAAA,IACA,+BAA+B,YAAY;AACvC,YAAM,WAAW,KAAK,SAAS,UAAU;AACzC,YAAM,mBAAmB,IAAI,iBAAiB,SAAS,MAAM,UAAU,MAAM,EAAE,WAAW,CAAC;AAC3F,WAAK,oBAAoB,IAAI,YAAY,gBAAgB;AACzD,uBAAiB,MAAM;AAAA,IAC3B;AAAA,IACA,gCAAgC,YAAY;AACxC,YAAM,gBAAgB,KAAK,2BAA2B,UAAU;AAChE,YAAM,oBAAoB,IAAI,kBAAkB,KAAK,MAAM,SAAS,eAAe,IAAI;AACvF,WAAK,qBAAqB,IAAI,YAAY,iBAAiB;AAC3D,wBAAkB,MAAM;AAAA,IAC5B;AAAA,IACA,SAAS,YAAY;AACjB,aAAO,KAAK,MAAM,QAAQ,yBAAyB,UAAU;AAAA,IACjE;AAAA,IACA,2BAA2B,YAAY;AACnC,aAAO,KAAK,MAAM,OAAO,wBAAwB,KAAK,YAAY,UAAU;AAAA,IAChF;AAAA,IACA,qCAAqC,eAAe;AAChD,aAAO,KAAK,kBAAkB,KAAK,CAAC,eAAe,KAAK,2BAA2B,UAAU,MAAM,aAAa;AAAA,IACpH;AAAA,IACA,IAAI,qBAAqB;AACrB,YAAMC,kBAAe,IAAI,SAAS;AAClC,WAAK,OAAO,QAAQ,QAAQ,CAAC,WAAW;AACpC,cAAM,cAAc,OAAO,WAAW;AACtC,cAAM,UAAU,iCAAiC,aAAa,SAAS;AACvE,gBAAQ,QAAQ,CAAC,WAAWA,gBAAa,IAAI,QAAQ,OAAO,UAAU,CAAC;AAAA,MAC3E,CAAC;AACD,aAAOA;AAAA,IACX;AAAA,IACA,IAAI,oBAAoB;AACpB,aAAO,KAAK,mBAAmB,gBAAgB,KAAK,UAAU;AAAA,IAClE;AAAA,IACA,IAAI,iCAAiC;AACjC,aAAO,KAAK,mBAAmB,gBAAgB,KAAK,UAAU;AAAA,IAClE;AAAA,IACA,IAAI,oBAAoB;AACpB,YAAM,cAAc,KAAK;AACzB,aAAO,KAAK,OAAO,SAAS,OAAO,CAAC,YAAY,YAAY,SAAS,QAAQ,UAAU,CAAC;AAAA,IAC5F;AAAA,IACA,UAAU,SAAS,YAAY;AAC3B,aAAO,CAAC,CAAC,KAAK,UAAU,SAAS,UAAU,KAAK,CAAC,CAAC,KAAK,iBAAiB,SAAS,UAAU;AAAA,IAC/F;AAAA,IACA,UAAU,SAAS,YAAY;AAC3B,aAAO,KAAK,YAAY,qCAAqC,SAAS,UAAU;AAAA,IACpF;AAAA,IACA,iBAAiB,SAAS,YAAY;AAClC,aAAO,KAAK,cAAc,gBAAgB,UAAU,EAAE,KAAK,CAAC,WAAW,OAAO,YAAY,OAAO;AAAA,IACrG;AAAA,IACA,IAAI,QAAQ;AACR,aAAO,KAAK,QAAQ;AAAA,IACxB;AAAA,IACA,IAAI,SAAS;AACT,aAAO,KAAK,QAAQ;AAAA,IACxB;AAAA,IACA,IAAI,aAAa;AACb,aAAO,KAAK,QAAQ;AAAA,IACxB;AAAA,IACA,IAAI,cAAc;AACd,aAAO,KAAK,QAAQ;AAAA,IACxB;AAAA,IACA,IAAI,SAAS;AACT,aAAO,KAAK,YAAY;AAAA,IAC5B;AAAA,EACJ;AAEA,MAAM,UAAN,MAAc;AAAA,IACV,YAAY,QAAQ,OAAO;AACvB,WAAK,mBAAmB,CAAC,cAAc,SAAS,CAAC,MAAM;AACnD,cAAM,EAAE,YAAY,YAAY,QAAQ,IAAI;AAC5C,iBAAS,OAAO,OAAO,EAAE,YAAY,YAAY,QAAQ,GAAG,MAAM;AAClE,aAAK,YAAY,iBAAiB,KAAK,YAAY,cAAc,MAAM;AAAA,MAC3E;AACA,WAAK,SAAS;AACd,WAAK,QAAQ;AACb,WAAK,aAAa,IAAI,OAAO,sBAAsB,IAAI;AACvD,WAAK,kBAAkB,IAAI,gBAAgB,MAAM,KAAK,UAAU;AAChE,WAAK,gBAAgB,IAAI,cAAc,MAAM,KAAK,UAAU;AAC5D,WAAK,iBAAiB,IAAI,eAAe,MAAM,IAAI;AACnD,WAAK,iBAAiB,IAAI,eAAe,MAAM,IAAI;AACnD,UAAI;AACA,aAAK,WAAW,WAAW;AAC3B,aAAK,iBAAiB,YAAY;AAAA,MACtC,SACOH,QAAO;AACV,aAAK,YAAYA,QAAO,yBAAyB;AAAA,MACrD;AAAA,IACJ;AAAA,IACA,UAAU;AACN,WAAK,gBAAgB,MAAM;AAC3B,WAAK,cAAc,MAAM;AACzB,WAAK,eAAe,MAAM;AAC1B,WAAK,eAAe,MAAM;AAC1B,UAAI;AACA,aAAK,WAAW,QAAQ;AACxB,aAAK,iBAAiB,SAAS;AAAA,MACnC,SACOA,QAAO;AACV,aAAK,YAAYA,QAAO,uBAAuB;AAAA,MACnD;AAAA,IACJ;AAAA,IACA,UAAU;AACN,WAAK,eAAe,QAAQ;AAAA,IAChC;AAAA,IACA,aAAa;AACT,UAAI;AACA,aAAK,WAAW,WAAW;AAC3B,aAAK,iBAAiB,YAAY;AAAA,MACtC,SACOA,QAAO;AACV,aAAK,YAAYA,QAAO,0BAA0B;AAAA,MACtD;AACA,WAAK,eAAe,KAAK;AACzB,WAAK,eAAe,KAAK;AACzB,WAAK,cAAc,KAAK;AACxB,WAAK,gBAAgB,KAAK;AAAA,IAC9B;AAAA,IACA,IAAI,cAAc;AACd,aAAO,KAAK,OAAO;AAAA,IACvB;AAAA,IACA,IAAI,aAAa;AACb,aAAO,KAAK,OAAO;AAAA,IACvB;AAAA,IACA,IAAI,SAAS;AACT,aAAO,KAAK,YAAY;AAAA,IAC5B;AAAA,IACA,IAAI,aAAa;AACb,aAAO,KAAK,YAAY;AAAA,IAC5B;AAAA,IACA,IAAI,UAAU;AACV,aAAO,KAAK,MAAM;AAAA,IACtB;AAAA,IACA,IAAI,gBAAgB;AAChB,aAAO,KAAK,QAAQ;AAAA,IACxB;AAAA,IACA,YAAYA,QAAO,SAAS,SAAS,CAAC,GAAG;AACrC,YAAM,EAAE,YAAY,YAAY,QAAQ,IAAI;AAC5C,eAAS,OAAO,OAAO,EAAE,YAAY,YAAY,QAAQ,GAAG,MAAM;AAClE,WAAK,YAAY,YAAYA,QAAO,SAAS,OAAO,IAAI,MAAM;AAAA,IAClE;AAAA,IACA,gBAAgB,SAASC,SAAM;AAC3B,WAAK,uBAAuB,GAAGA,OAAI,mBAAmB,OAAO;AAAA,IACjE;AAAA,IACA,mBAAmB,SAASA,SAAM;AAC9B,WAAK,uBAAuB,GAAGA,OAAI,sBAAsB,OAAO;AAAA,IACpE;AAAA,IACA,gBAAgB,QAAQ,SAASA,SAAM;AACnC,WAAK,uBAAuB,GAAG,kBAAkBA,OAAI,CAAC,mBAAmB,QAAQ,OAAO;AAAA,IAC5F;AAAA,IACA,mBAAmB,QAAQ,SAASA,SAAM;AACtC,WAAK,uBAAuB,GAAG,kBAAkBA,OAAI,CAAC,sBAAsB,QAAQ,OAAO;AAAA,IAC/F;AAAA,IACA,uBAAuB,eAAe,MAAM;AACxC,YAAM,aAAa,KAAK;AACxB,UAAI,OAAO,WAAW,UAAU,KAAK,YAAY;AAC7C,mBAAW,UAAU,EAAE,GAAG,IAAI;AAAA,MAClC;AAAA,IACJ;AAAA,EACJ;AAEA,WAAS,MAAM,aAAa;AACxB,WAAO,OAAO,aAAa,qBAAqB,WAAW,CAAC;AAAA,EAChE;AACA,WAAS,OAAO,aAAaG,aAAY;AACrC,UAAM,oBAAoBC,QAAO,WAAW;AAC5C,UAAM,mBAAmB,oBAAoB,YAAY,WAAWD,WAAU;AAC9E,WAAO,iBAAiB,kBAAkB,WAAW,gBAAgB;AACrE,WAAO;AAAA,EACX;AACA,WAAS,qBAAqB,aAAa;AACvC,UAAM,YAAY,iCAAiC,aAAa,WAAW;AAC3E,WAAO,UAAU,OAAO,CAAC,mBAAmB,aAAa;AACrD,YAAMA,cAAa,SAAS,WAAW;AACvC,iBAAW,OAAOA,aAAY;AAC1B,cAAM,aAAa,kBAAkB,GAAG,KAAK,CAAC;AAC9C,0BAAkB,GAAG,IAAI,OAAO,OAAO,YAAYA,YAAW,GAAG,CAAC;AAAA,MACtE;AACA,aAAO;AAAA,IACX,GAAG,CAAC,CAAC;AAAA,EACT;AACA,WAAS,oBAAoB,WAAWA,aAAY;AAChD,WAAO,WAAWA,WAAU,EAAE,OAAO,CAAC,kBAAkB,QAAQ;AAC5D,YAAM,aAAa,sBAAsB,WAAWA,aAAY,GAAG;AACnE,UAAI,YAAY;AACZ,eAAO,OAAO,kBAAkB,EAAE,CAAC,GAAG,GAAG,WAAW,CAAC;AAAA,MACzD;AACA,aAAO;AAAA,IACX,GAAG,CAAC,CAAC;AAAA,EACT;AACA,WAAS,sBAAsB,WAAWA,aAAY,KAAK;AACvD,UAAM,sBAAsB,OAAO,yBAAyB,WAAW,GAAG;AAC1E,UAAM,kBAAkB,uBAAuB,WAAW;AAC1D,QAAI,CAAC,iBAAiB;AAClB,YAAM,aAAa,OAAO,yBAAyBA,aAAY,GAAG,EAAE;AACpE,UAAI,qBAAqB;AACrB,mBAAW,MAAM,oBAAoB,OAAO,WAAW;AACvD,mBAAW,MAAM,oBAAoB,OAAO,WAAW;AAAA,MAC3D;AACA,aAAO;AAAA,IACX;AAAA,EACJ;AACA,MAAM,cAAc,MAAM;AACtB,QAAI,OAAO,OAAO,yBAAyB,YAAY;AACnD,aAAO,CAAC,WAAW,CAAC,GAAG,OAAO,oBAAoB,MAAM,GAAG,GAAG,OAAO,sBAAsB,MAAM,CAAC;AAAA,IACtG,OACK;AACD,aAAO,OAAO;AAAA,IAClB;AAAA,EACJ,GAAG;AACH,MAAMC,WAAU,MAAM;AAClB,aAAS,kBAAkB,aAAa;AACpC,eAAS,WAAW;AAChB,eAAO,QAAQ,UAAU,aAAa,WAAW,UAAU;AAAA,MAC/D;AACA,eAAS,YAAY,OAAO,OAAO,YAAY,WAAW;AAAA,QACtD,aAAa,EAAE,OAAO,SAAS;AAAA,MACnC,CAAC;AACD,cAAQ,eAAe,UAAU,WAAW;AAC5C,aAAO;AAAA,IACX;AACA,aAAS,uBAAuB;AAC5B,YAAM,IAAI,WAAY;AAClB,aAAK,EAAE,KAAK,IAAI;AAAA,MACpB;AACA,YAAM,IAAI,kBAAkB,CAAC;AAC7B,QAAE,UAAU,IAAI,WAAY;AAAA,MAAE;AAC9B,aAAO,IAAI,EAAE;AAAA,IACjB;AACA,QAAI;AACA,2BAAqB;AACrB,aAAO;AAAA,IACX,SACOL,QAAO;AACV,aAAO,CAAC,gBAAgB,MAAM,iBAAiB,YAAY;AAAA,MAC3D;AAAA,IACJ;AAAA,EACJ,GAAG;AAEH,WAAS,gBAAgB,YAAY;AACjC,WAAO;AAAA,MACH,YAAY,WAAW;AAAA,MACvB,uBAAuB,MAAM,WAAW,qBAAqB;AAAA,IACjE;AAAA,EACJ;AAEA,MAAM,SAAN,MAAa;AAAA,IACT,YAAYM,cAAa,YAAY;AACjC,WAAK,cAAcA;AACnB,WAAK,aAAa,gBAAgB,UAAU;AAC5C,WAAK,kBAAkB,oBAAI,QAAQ;AACnC,WAAK,oBAAoB,oBAAI,IAAI;AAAA,IACrC;AAAA,IACA,IAAI,aAAa;AACb,aAAO,KAAK,WAAW;AAAA,IAC3B;AAAA,IACA,IAAI,wBAAwB;AACxB,aAAO,KAAK,WAAW;AAAA,IAC3B;AAAA,IACA,IAAI,WAAW;AACX,aAAO,MAAM,KAAK,KAAK,iBAAiB;AAAA,IAC5C;AAAA,IACA,uBAAuB,OAAO;AAC1B,YAAM,UAAU,KAAK,qBAAqB,KAAK;AAC/C,WAAK,kBAAkB,IAAI,OAAO;AAClC,cAAQ,QAAQ;AAAA,IACpB;AAAA,IACA,0BAA0B,OAAO;AAC7B,YAAM,UAAU,KAAK,gBAAgB,IAAI,KAAK;AAC9C,UAAI,SAAS;AACT,aAAK,kBAAkB,OAAO,OAAO;AACrC,gBAAQ,WAAW;AAAA,MACvB;AAAA,IACJ;AAAA,IACA,qBAAqB,OAAO;AACxB,UAAI,UAAU,KAAK,gBAAgB,IAAI,KAAK;AAC5C,UAAI,CAAC,SAAS;AACV,kBAAU,IAAI,QAAQ,MAAM,KAAK;AACjC,aAAK,gBAAgB,IAAI,OAAO,OAAO;AAAA,MAC3C;AACA,aAAO;AAAA,IACX;AAAA,EACJ;AAEA,MAAM,WAAN,MAAe;AAAA,IACX,YAAY,OAAO;AACf,WAAK,QAAQ;AAAA,IACjB;AAAA,IACA,IAAIL,SAAM;AACN,aAAO,KAAK,KAAK,IAAI,KAAK,WAAWA,OAAI,CAAC;AAAA,IAC9C;AAAA,IACA,IAAIA,SAAM;AACN,aAAO,KAAK,OAAOA,OAAI,EAAE,CAAC;AAAA,IAC9B;AAAA,IACA,OAAOA,SAAM;AACT,YAAM,cAAc,KAAK,KAAK,IAAI,KAAK,WAAWA,OAAI,CAAC,KAAK;AAC5D,aAAO,SAAS,WAAW;AAAA,IAC/B;AAAA,IACA,iBAAiBA,SAAM;AACnB,aAAO,KAAK,KAAK,uBAAuB,KAAK,WAAWA,OAAI,CAAC;AAAA,IACjE;AAAA,IACA,WAAWA,SAAM;AACb,aAAO,GAAGA,OAAI;AAAA,IAClB;AAAA,IACA,IAAI,OAAO;AACP,aAAO,KAAK,MAAM;AAAA,IACtB;AAAA,EACJ;AAEA,MAAM,UAAN,MAAc;AAAA,IACV,YAAY,OAAO;AACf,WAAK,QAAQ;AAAA,IACjB;AAAA,IACA,IAAI,UAAU;AACV,aAAO,KAAK,MAAM;AAAA,IACtB;AAAA,IACA,IAAI,aAAa;AACb,aAAO,KAAK,MAAM;AAAA,IACtB;AAAA,IACA,IAAI,KAAK;AACL,YAAMA,UAAO,KAAK,uBAAuB,GAAG;AAC5C,aAAO,KAAK,QAAQ,aAAaA,OAAI;AAAA,IACzC;AAAA,IACA,IAAI,KAAK,OAAO;AACZ,YAAMA,UAAO,KAAK,uBAAuB,GAAG;AAC5C,WAAK,QAAQ,aAAaA,SAAM,KAAK;AACrC,aAAO,KAAK,IAAI,GAAG;AAAA,IACvB;AAAA,IACA,IAAI,KAAK;AACL,YAAMA,UAAO,KAAK,uBAAuB,GAAG;AAC5C,aAAO,KAAK,QAAQ,aAAaA,OAAI;AAAA,IACzC;AAAA,IACA,OAAO,KAAK;AACR,UAAI,KAAK,IAAI,GAAG,GAAG;AACf,cAAMA,UAAO,KAAK,uBAAuB,GAAG;AAC5C,aAAK,QAAQ,gBAAgBA,OAAI;AACjC,eAAO;AAAA,MACX,OACK;AACD,eAAO;AAAA,MACX;AAAA,IACJ;AAAA,IACA,uBAAuB,KAAK;AACxB,aAAO,QAAQ,KAAK,UAAU,IAAI,UAAU,GAAG,CAAC;AAAA,IACpD;AAAA,EACJ;AAEA,MAAM,QAAN,MAAY;AAAA,IACR,YAAY,QAAQ;AAChB,WAAK,qBAAqB,oBAAI,QAAQ;AACtC,WAAK,SAAS;AAAA,IAClB;AAAA,IACA,KAAK,QAAQ,KAAK,SAAS;AACvB,UAAI,aAAa,KAAK,mBAAmB,IAAI,MAAM;AACnD,UAAI,CAAC,YAAY;AACb,qBAAa,oBAAI,IAAI;AACrB,aAAK,mBAAmB,IAAI,QAAQ,UAAU;AAAA,MAClD;AACA,UAAI,CAAC,WAAW,IAAI,GAAG,GAAG;AACtB,mBAAW,IAAI,GAAG;AAClB,aAAK,OAAO,KAAK,SAAS,MAAM;AAAA,MACpC;AAAA,IACJ;AAAA,EACJ;AAEA,WAAS,4BAA4B,eAAe,OAAO;AACvD,WAAO,IAAI,aAAa,MAAM,KAAK;AAAA,EACvC;AAEA,MAAM,YAAN,MAAgB;AAAA,IACZ,YAAY,OAAO;AACf,WAAK,QAAQ;AAAA,IACjB;AAAA,IACA,IAAI,UAAU;AACV,aAAO,KAAK,MAAM;AAAA,IACtB;AAAA,IACA,IAAI,aAAa;AACb,aAAO,KAAK,MAAM;AAAA,IACtB;AAAA,IACA,IAAI,SAAS;AACT,aAAO,KAAK,MAAM;AAAA,IACtB;AAAA,IACA,IAAI,YAAY;AACZ,aAAO,KAAK,KAAK,UAAU,KAAK;AAAA,IACpC;AAAA,IACA,QAAQ,aAAa;AACjB,aAAO,YAAY,OAAO,CAAC,QAAQ,eAAe,UAAU,KAAK,WAAW,UAAU,KAAK,KAAK,iBAAiB,UAAU,GAAG,MAAS;AAAA,IAC3I;AAAA,IACA,WAAW,aAAa;AACpB,aAAO,YAAY,OAAO,CAAC,SAAS,eAAe;AAAA,QAC/C,GAAG;AAAA,QACH,GAAG,KAAK,eAAe,UAAU;AAAA,QACjC,GAAG,KAAK,qBAAqB,UAAU;AAAA,MAC3C,GAAG,CAAC,CAAC;AAAA,IACT;AAAA,IACA,WAAW,YAAY;AACnB,YAAM,WAAW,KAAK,yBAAyB,UAAU;AACzD,aAAO,KAAK,MAAM,YAAY,QAAQ;AAAA,IAC1C;AAAA,IACA,eAAe,YAAY;AACvB,YAAM,WAAW,KAAK,yBAAyB,UAAU;AACzD,aAAO,KAAK,MAAM,gBAAgB,QAAQ;AAAA,IAC9C;AAAA,IACA,yBAAyB,YAAY;AACjC,YAAM,gBAAgB,KAAK,OAAO,wBAAwB,KAAK,UAAU;AACzE,aAAO,4BAA4B,eAAe,UAAU;AAAA,IAChE;AAAA,IACA,iBAAiB,YAAY;AACzB,YAAM,WAAW,KAAK,+BAA+B,UAAU;AAC/D,aAAO,KAAK,UAAU,KAAK,MAAM,YAAY,QAAQ,GAAG,UAAU;AAAA,IACtE;AAAA,IACA,qBAAqB,YAAY;AAC7B,YAAM,WAAW,KAAK,+BAA+B,UAAU;AAC/D,aAAO,KAAK,MAAM,gBAAgB,QAAQ,EAAE,IAAI,CAAC,YAAY,KAAK,UAAU,SAAS,UAAU,CAAC;AAAA,IACpG;AAAA,IACA,+BAA+B,YAAY;AACvC,YAAM,mBAAmB,GAAG,KAAK,UAAU,IAAI,UAAU;AACzD,aAAO,4BAA4B,KAAK,OAAO,iBAAiB,gBAAgB;AAAA,IACpF;AAAA,IACA,UAAU,SAAS,YAAY;AAC3B,UAAI,SAAS;AACT,cAAM,EAAE,WAAW,IAAI;AACvB,cAAM,gBAAgB,KAAK,OAAO;AAClC,cAAM,uBAAuB,KAAK,OAAO,wBAAwB,UAAU;AAC3E,aAAK,MAAM,KAAK,SAAS,UAAU,UAAU,IAAI,kBAAkB,aAAa,KAAK,UAAU,IAAI,UAAU,UAAU,oBAAoB,KAAK,UAAU,UAC/I,aAAa,+EAA+E;AAAA,MAC3G;AACA,aAAO;AAAA,IACX;AAAA,IACA,IAAI,QAAQ;AACR,aAAO,KAAK,MAAM;AAAA,IACtB;AAAA,EACJ;AAEA,MAAM,YAAN,MAAgB;AAAA,IACZ,YAAY,OAAO,mBAAmB;AAClC,WAAK,QAAQ;AACb,WAAK,oBAAoB;AAAA,IAC7B;AAAA,IACA,IAAI,UAAU;AACV,aAAO,KAAK,MAAM;AAAA,IACtB;AAAA,IACA,IAAI,aAAa;AACb,aAAO,KAAK,MAAM;AAAA,IACtB;AAAA,IACA,IAAI,SAAS;AACT,aAAO,KAAK,MAAM;AAAA,IACtB;AAAA,IACA,IAAI,YAAY;AACZ,aAAO,KAAK,KAAK,UAAU,KAAK;AAAA,IACpC;AAAA,IACA,QAAQ,aAAa;AACjB,aAAO,YAAY,OAAO,CAAC,QAAQ,eAAe,UAAU,KAAK,WAAW,UAAU,GAAG,MAAS;AAAA,IACtG;AAAA,IACA,WAAW,aAAa;AACpB,aAAO,YAAY,OAAO,CAAC,SAAS,eAAe,CAAC,GAAG,SAAS,GAAG,KAAK,eAAe,UAAU,CAAC,GAAG,CAAC,CAAC;AAAA,IAC3G;AAAA,IACA,yBAAyB,YAAY;AACjC,YAAM,gBAAgB,KAAK,OAAO,wBAAwB,KAAK,YAAY,UAAU;AACrF,aAAO,KAAK,kBAAkB,aAAa,aAAa;AAAA,IAC5D;AAAA,IACA,WAAW,YAAY;AACnB,YAAM,WAAW,KAAK,yBAAyB,UAAU;AACzD,UAAI;AACA,eAAO,KAAK,YAAY,UAAU,UAAU;AAAA,IACpD;AAAA,IACA,eAAe,YAAY;AACvB,YAAM,WAAW,KAAK,yBAAyB,UAAU;AACzD,aAAO,WAAW,KAAK,gBAAgB,UAAU,UAAU,IAAI,CAAC;AAAA,IACpE;AAAA,IACA,YAAY,UAAU,YAAY;AAC9B,YAAM,WAAW,KAAK,MAAM,cAAc,QAAQ;AAClD,aAAO,SAAS,OAAO,CAAC,YAAY,KAAK,eAAe,SAAS,UAAU,UAAU,CAAC,EAAE,CAAC;AAAA,IAC7F;AAAA,IACA,gBAAgB,UAAU,YAAY;AAClC,YAAM,WAAW,KAAK,MAAM,cAAc,QAAQ;AAClD,aAAO,SAAS,OAAO,CAAC,YAAY,KAAK,eAAe,SAAS,UAAU,UAAU,CAAC;AAAA,IAC1F;AAAA,IACA,eAAe,SAAS,UAAU,YAAY;AAC1C,YAAM,sBAAsB,QAAQ,aAAa,KAAK,MAAM,OAAO,mBAAmB,KAAK;AAC3F,aAAO,QAAQ,QAAQ,QAAQ,KAAK,oBAAoB,MAAM,GAAG,EAAE,SAAS,UAAU;AAAA,IAC1F;AAAA,EACJ;AAEA,MAAM,QAAN,MAAM,OAAM;AAAA,IACR,YAAY,QAAQ,SAAS,YAAY,QAAQ;AAC7C,WAAK,UAAU,IAAI,UAAU,IAAI;AACjC,WAAK,UAAU,IAAI,SAAS,IAAI;AAChC,WAAK,OAAO,IAAI,QAAQ,IAAI;AAC5B,WAAK,kBAAkB,CAACM,aAAY;AAChC,eAAOA,SAAQ,QAAQ,KAAK,kBAAkB,MAAM,KAAK;AAAA,MAC7D;AACA,WAAK,SAAS;AACd,WAAK,UAAU;AACf,WAAK,aAAa;AAClB,WAAK,QAAQ,IAAI,MAAM,MAAM;AAC7B,WAAK,UAAU,IAAI,UAAU,KAAK,eAAe,OAAO;AAAA,IAC5D;AAAA,IACA,YAAY,UAAU;AAClB,aAAO,KAAK,QAAQ,QAAQ,QAAQ,IAAI,KAAK,UAAU,KAAK,cAAc,QAAQ,EAAE,KAAK,KAAK,eAAe;AAAA,IACjH;AAAA,IACA,gBAAgB,UAAU;AACtB,aAAO;AAAA,QACH,GAAI,KAAK,QAAQ,QAAQ,QAAQ,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC;AAAA,QACvD,GAAG,KAAK,cAAc,QAAQ,EAAE,OAAO,KAAK,eAAe;AAAA,MAC/D;AAAA,IACJ;AAAA,IACA,cAAc,UAAU;AACpB,aAAO,MAAM,KAAK,KAAK,QAAQ,iBAAiB,QAAQ,CAAC;AAAA,IAC7D;AAAA,IACA,IAAI,qBAAqB;AACrB,aAAO,4BAA4B,KAAK,OAAO,qBAAqB,KAAK,UAAU;AAAA,IACvF;AAAA,IACA,IAAI,kBAAkB;AAClB,aAAO,KAAK,YAAY,SAAS;AAAA,IACrC;AAAA,IACA,IAAI,gBAAgB;AAChB,aAAO,KAAK,kBACN,OACA,IAAI,OAAM,KAAK,QAAQ,SAAS,iBAAiB,KAAK,YAAY,KAAK,MAAM,MAAM;AAAA,IAC7F;AAAA,EACJ;AAEA,MAAM,gBAAN,MAAoB;AAAA,IAChB,YAAY,SAAS,QAAQ,UAAU;AACnC,WAAK,UAAU;AACf,WAAK,SAAS;AACd,WAAK,WAAW;AAChB,WAAK,oBAAoB,IAAI,kBAAkB,KAAK,SAAS,KAAK,qBAAqB,IAAI;AAC3F,WAAK,8BAA8B,oBAAI,QAAQ;AAC/C,WAAK,uBAAuB,oBAAI,QAAQ;AAAA,IAC5C;AAAA,IACA,QAAQ;AACJ,WAAK,kBAAkB,MAAM;AAAA,IACjC;AAAA,IACA,OAAO;AACH,WAAK,kBAAkB,KAAK;AAAA,IAChC;AAAA,IACA,IAAI,sBAAsB;AACtB,aAAO,KAAK,OAAO;AAAA,IACvB;AAAA,IACA,mBAAmB,OAAO;AACtB,YAAM,EAAE,SAAS,SAAS,WAAW,IAAI;AACzC,aAAO,KAAK,kCAAkC,SAAS,UAAU;AAAA,IACrE;AAAA,IACA,kCAAkC,SAAS,YAAY;AACnD,YAAM,qBAAqB,KAAK,kCAAkC,OAAO;AACzE,UAAI,QAAQ,mBAAmB,IAAI,UAAU;AAC7C,UAAI,CAAC,OAAO;AACR,gBAAQ,KAAK,SAAS,mCAAmC,SAAS,UAAU;AAC5E,2BAAmB,IAAI,YAAY,KAAK;AAAA,MAC5C;AACA,aAAO;AAAA,IACX;AAAA,IACA,oBAAoB,SAAS,OAAO;AAChC,YAAM,kBAAkB,KAAK,qBAAqB,IAAI,KAAK,KAAK,KAAK;AACrE,WAAK,qBAAqB,IAAI,OAAO,cAAc;AACnD,UAAI,kBAAkB,GAAG;AACrB,aAAK,SAAS,eAAe,KAAK;AAAA,MACtC;AAAA,IACJ;AAAA,IACA,sBAAsB,SAAS,OAAO;AAClC,YAAM,iBAAiB,KAAK,qBAAqB,IAAI,KAAK;AAC1D,UAAI,gBAAgB;AAChB,aAAK,qBAAqB,IAAI,OAAO,iBAAiB,CAAC;AACvD,YAAI,kBAAkB,GAAG;AACrB,eAAK,SAAS,kBAAkB,KAAK;AAAA,QACzC;AAAA,MACJ;AAAA,IACJ;AAAA,IACA,kCAAkC,SAAS;AACvC,UAAI,qBAAqB,KAAK,4BAA4B,IAAI,OAAO;AACrE,UAAI,CAAC,oBAAoB;AACrB,6BAAqB,oBAAI,IAAI;AAC7B,aAAK,4BAA4B,IAAI,SAAS,kBAAkB;AAAA,MACpE;AACA,aAAO;AAAA,IACX;AAAA,EACJ;AAEA,MAAM,SAAN,MAAa;AAAA,IACT,YAAYD,cAAa;AACrB,WAAK,cAAcA;AACnB,WAAK,gBAAgB,IAAI,cAAc,KAAK,SAAS,KAAK,QAAQ,IAAI;AACtE,WAAK,qBAAqB,IAAI,SAAS;AACvC,WAAK,sBAAsB,oBAAI,IAAI;AAAA,IACvC;AAAA,IACA,IAAI,UAAU;AACV,aAAO,KAAK,YAAY;AAAA,IAC5B;AAAA,IACA,IAAI,SAAS;AACT,aAAO,KAAK,YAAY;AAAA,IAC5B;AAAA,IACA,IAAI,SAAS;AACT,aAAO,KAAK,YAAY;AAAA,IAC5B;AAAA,IACA,IAAI,sBAAsB;AACtB,aAAO,KAAK,OAAO;AAAA,IACvB;AAAA,IACA,IAAI,UAAU;AACV,aAAO,MAAM,KAAK,KAAK,oBAAoB,OAAO,CAAC;AAAA,IACvD;AAAA,IACA,IAAI,WAAW;AACX,aAAO,KAAK,QAAQ,OAAO,CAAC,UAAU,WAAW,SAAS,OAAO,OAAO,QAAQ,GAAG,CAAC,CAAC;AAAA,IACzF;AAAA,IACA,QAAQ;AACJ,WAAK,cAAc,MAAM;AAAA,IAC7B;AAAA,IACA,OAAO;AACH,WAAK,cAAc,KAAK;AAAA,IAC5B;AAAA,IACA,eAAe,YAAY;AACvB,WAAK,iBAAiB,WAAW,UAAU;AAC3C,YAAM,SAAS,IAAI,OAAO,KAAK,aAAa,UAAU;AACtD,WAAK,cAAc,MAAM;AACzB,YAAM,YAAY,WAAW,sBAAsB;AACnD,UAAI,WAAW;AACX,kBAAU,KAAK,WAAW,uBAAuB,WAAW,YAAY,KAAK,WAAW;AAAA,MAC5F;AAAA,IACJ;AAAA,IACA,iBAAiB,YAAY;AACzB,YAAM,SAAS,KAAK,oBAAoB,IAAI,UAAU;AACtD,UAAI,QAAQ;AACR,aAAK,iBAAiB,MAAM;AAAA,MAChC;AAAA,IACJ;AAAA,IACA,kCAAkC,SAAS,YAAY;AACnD,YAAM,SAAS,KAAK,oBAAoB,IAAI,UAAU;AACtD,UAAI,QAAQ;AACR,eAAO,OAAO,SAAS,KAAK,CAAC,YAAY,QAAQ,WAAW,OAAO;AAAA,MACvE;AAAA,IACJ;AAAA,IACA,6CAA6C,SAAS,YAAY;AAC9D,YAAM,QAAQ,KAAK,cAAc,kCAAkC,SAAS,UAAU;AACtF,UAAI,OAAO;AACP,aAAK,cAAc,oBAAoB,MAAM,SAAS,KAAK;AAAA,MAC/D,OACK;AACD,gBAAQ,MAAM,kDAAkD,UAAU,kBAAkB,OAAO;AAAA,MACvG;AAAA,IACJ;AAAA,IACA,YAAYN,QAAO,SAAS,QAAQ;AAChC,WAAK,YAAY,YAAYA,QAAO,SAAS,MAAM;AAAA,IACvD;AAAA,IACA,mCAAmC,SAAS,YAAY;AACpD,aAAO,IAAI,MAAM,KAAK,QAAQ,SAAS,YAAY,KAAK,MAAM;AAAA,IAClE;AAAA,IACA,eAAe,OAAO;AAClB,WAAK,mBAAmB,IAAI,MAAM,YAAY,KAAK;AACnD,YAAM,SAAS,KAAK,oBAAoB,IAAI,MAAM,UAAU;AAC5D,UAAI,QAAQ;AACR,eAAO,uBAAuB,KAAK;AAAA,MACvC;AAAA,IACJ;AAAA,IACA,kBAAkB,OAAO;AACrB,WAAK,mBAAmB,OAAO,MAAM,YAAY,KAAK;AACtD,YAAM,SAAS,KAAK,oBAAoB,IAAI,MAAM,UAAU;AAC5D,UAAI,QAAQ;AACR,eAAO,0BAA0B,KAAK;AAAA,MAC1C;AAAA,IACJ;AAAA,IACA,cAAc,QAAQ;AAClB,WAAK,oBAAoB,IAAI,OAAO,YAAY,MAAM;AACtD,YAAM,SAAS,KAAK,mBAAmB,gBAAgB,OAAO,UAAU;AACxE,aAAO,QAAQ,CAAC,UAAU,OAAO,uBAAuB,KAAK,CAAC;AAAA,IAClE;AAAA,IACA,iBAAiB,QAAQ;AACrB,WAAK,oBAAoB,OAAO,OAAO,UAAU;AACjD,YAAM,SAAS,KAAK,mBAAmB,gBAAgB,OAAO,UAAU;AACxE,aAAO,QAAQ,CAAC,UAAU,OAAO,0BAA0B,KAAK,CAAC;AAAA,IACrE;AAAA,EACJ;AAEA,MAAM,gBAAgB;AAAA,IAClB,qBAAqB;AAAA,IACrB,iBAAiB;AAAA,IACjB,iBAAiB;AAAA,IACjB,yBAAyB,CAAC,eAAe,QAAQ,UAAU;AAAA,IAC3D,yBAAyB,CAAC,YAAY,WAAW,QAAQ,UAAU,IAAI,MAAM;AAAA,IAC7E,aAAa,OAAO,OAAO,OAAO,OAAO,EAAE,OAAO,SAAS,KAAK,OAAO,KAAK,UAAU,OAAO,KAAK,IAAI,WAAW,MAAM,aAAa,MAAM,aAAa,OAAO,cAAc,MAAM,QAAQ,KAAK,OAAO,SAAS,UAAU,WAAW,WAAW,GAAG,kBAAkB,6BAA6B,MAAM,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,kBAAkB,aAAa,MAAM,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAAA,EACjY;AACA,WAAS,kBAAkB,OAAO;AAC9B,WAAO,MAAM,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,MAAO,OAAO,OAAO,OAAO,OAAO,CAAC,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,GAAI,CAAC,CAAC;AAAA,EAClG;AAEA,MAAM,cAAN,MAAkB;AAAA,IACd,YAAY,UAAU,SAAS,iBAAiB,SAAS,eAAe;AACpE,WAAK,SAAS;AACd,WAAK,QAAQ;AACb,WAAK,mBAAmB,CAAC,YAAY,cAAc,SAAS,CAAC,MAAM;AAC/D,YAAI,KAAK,OAAO;AACZ,eAAK,oBAAoB,YAAY,cAAc,MAAM;AAAA,QAC7D;AAAA,MACJ;AACA,WAAK,UAAU;AACf,WAAK,SAAS;AACd,WAAK,aAAa,IAAI,WAAW,IAAI;AACrC,WAAK,SAAS,IAAI,OAAO,IAAI;AAC7B,WAAK,0BAA0B,OAAO,OAAO,CAAC,GAAG,8BAA8B;AAAA,IACnF;AAAA,IACA,OAAO,MAAM,SAAS,QAAQ;AAC1B,YAAMM,eAAc,IAAI,KAAK,SAAS,MAAM;AAC5C,MAAAA,aAAY,MAAM;AAClB,aAAOA;AAAA,IACX;AAAA,IACA,MAAM,QAAQ;AACV,YAAM,SAAS;AACf,WAAK,iBAAiB,eAAe,UAAU;AAC/C,WAAK,WAAW,MAAM;AACtB,WAAK,OAAO,MAAM;AAClB,WAAK,iBAAiB,eAAe,OAAO;AAAA,IAChD;AAAA,IACA,OAAO;AACH,WAAK,iBAAiB,eAAe,UAAU;AAC/C,WAAK,WAAW,KAAK;AACrB,WAAK,OAAO,KAAK;AACjB,WAAK,iBAAiB,eAAe,MAAM;AAAA,IAC/C;AAAA,IACA,SAAS,YAAY,uBAAuB;AACxC,WAAK,KAAK,EAAE,YAAY,sBAAsB,CAAC;AAAA,IACnD;AAAA,IACA,qBAAqBL,SAAMO,SAAQ;AAC/B,WAAK,wBAAwBP,OAAI,IAAIO;AAAA,IACzC;AAAA,IACA,KAAK,SAAS,MAAM;AAChB,YAAM,cAAc,MAAM,QAAQ,IAAI,IAAI,OAAO,CAAC,MAAM,GAAG,IAAI;AAC/D,kBAAY,QAAQ,CAAC,eAAe;AAChC,YAAI,WAAW,sBAAsB,YAAY;AAC7C,eAAK,OAAO,eAAe,UAAU;AAAA,QACzC;AAAA,MACJ,CAAC;AAAA,IACL;AAAA,IACA,OAAO,SAAS,MAAM;AAClB,YAAM,cAAc,MAAM,QAAQ,IAAI,IAAI,OAAO,CAAC,MAAM,GAAG,IAAI;AAC/D,kBAAY,QAAQ,CAAC,eAAe,KAAK,OAAO,iBAAiB,UAAU,CAAC;AAAA,IAChF;AAAA,IACA,IAAI,cAAc;AACd,aAAO,KAAK,OAAO,SAAS,IAAI,CAAC,YAAY,QAAQ,UAAU;AAAA,IACnE;AAAA,IACA,qCAAqC,SAAS,YAAY;AACtD,YAAM,UAAU,KAAK,OAAO,kCAAkC,SAAS,UAAU;AACjF,aAAO,UAAU,QAAQ,aAAa;AAAA,IAC1C;AAAA,IACA,YAAYR,QAAO,SAAS,QAAQ;AAChC,UAAI;AACJ,WAAK,OAAO,MAAM;AAAA;AAAA;AAAA;AAAA,KAAkB,SAASA,QAAO,MAAM;AAC1D,OAAC,KAAK,OAAO,aAAa,QAAQ,OAAO,SAAS,SAAS,GAAG,KAAK,QAAQ,SAAS,IAAI,GAAG,GAAGA,MAAK;AAAA,IACvG;AAAA,IACA,oBAAoB,YAAY,cAAc,SAAS,CAAC,GAAG;AACvD,eAAS,OAAO,OAAO,EAAE,aAAa,KAAK,GAAG,MAAM;AACpD,WAAK,OAAO,eAAe,GAAG,UAAU,KAAK,YAAY,EAAE;AAC3D,WAAK,OAAO,IAAI,YAAY,OAAO,OAAO,CAAC,GAAG,MAAM,CAAC;AACrD,WAAK,OAAO,SAAS;AAAA,IACzB;AAAA,EACJ;AACA,WAAS,WAAW;AAChB,WAAO,IAAI,QAAQ,CAACS,aAAY;AAC5B,UAAI,SAAS,cAAc,WAAW;AAClC,iBAAS,iBAAiB,oBAAoB,MAAMA,SAAQ,CAAC;AAAA,MACjE,OACK;AACD,QAAAA,SAAQ;AAAA,MACZ;AAAA,IACJ,CAAC;AAAA,EACL;AAEA,WAAS,wBAAwB,aAAa;AAC1C,UAAMC,WAAU,iCAAiC,aAAa,SAAS;AACvE,WAAOA,SAAQ,OAAO,CAACN,aAAY,oBAAoB;AACnD,aAAO,OAAO,OAAOA,aAAY,6BAA6B,eAAe,CAAC;AAAA,IAClF,GAAG,CAAC,CAAC;AAAA,EACT;AACA,WAAS,6BAA6B,KAAK;AACvC,WAAO;AAAA,MACH,CAAC,GAAG,GAAG,OAAO,GAAG;AAAA,QACb,MAAM;AACF,gBAAM,EAAE,SAAAM,SAAQ,IAAI;AACpB,cAAIA,SAAQ,IAAI,GAAG,GAAG;AAClB,mBAAOA,SAAQ,IAAI,GAAG;AAAA,UAC1B,OACK;AACD,kBAAM,YAAYA,SAAQ,iBAAiB,GAAG;AAC9C,kBAAM,IAAI,MAAM,sBAAsB,SAAS,GAAG;AAAA,UACtD;AAAA,QACJ;AAAA,MACJ;AAAA,MACA,CAAC,GAAG,GAAG,SAAS,GAAG;AAAA,QACf,MAAM;AACF,iBAAO,KAAK,QAAQ,OAAO,GAAG;AAAA,QAClC;AAAA,MACJ;AAAA,MACA,CAAC,MAAM,WAAW,GAAG,CAAC,OAAO,GAAG;AAAA,QAC5B,MAAM;AACF,iBAAO,KAAK,QAAQ,IAAI,GAAG;AAAA,QAC/B;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAEA,WAAS,yBAAyB,aAAa;AAC3C,UAAM,UAAU,iCAAiC,aAAa,SAAS;AACvE,WAAO,QAAQ,OAAO,CAACN,aAAY,qBAAqB;AACpD,aAAO,OAAO,OAAOA,aAAY,8BAA8B,gBAAgB,CAAC;AAAA,IACpF,GAAG,CAAC,CAAC;AAAA,EACT;AACA,WAAS,oBAAoB,YAAY,SAAS,YAAY;AAC1D,WAAO,WAAW,YAAY,qCAAqC,SAAS,UAAU;AAAA,EAC1F;AACA,WAAS,qCAAqC,YAAY,SAAS,YAAY;AAC3E,QAAI,mBAAmB,oBAAoB,YAAY,SAAS,UAAU;AAC1E,QAAI;AACA,aAAO;AACX,eAAW,YAAY,OAAO,6CAA6C,SAAS,UAAU;AAC9F,uBAAmB,oBAAoB,YAAY,SAAS,UAAU;AACtE,QAAI;AACA,aAAO;AAAA,EACf;AACA,WAAS,8BAA8BH,SAAM;AACzC,UAAM,gBAAgB,kBAAkBA,OAAI;AAC5C,WAAO;AAAA,MACH,CAAC,GAAG,aAAa,QAAQ,GAAG;AAAA,QACxB,MAAM;AACF,gBAAM,gBAAgB,KAAK,QAAQ,KAAKA,OAAI;AAC5C,gBAAM,WAAW,KAAK,QAAQ,yBAAyBA,OAAI;AAC3D,cAAI,eAAe;AACf,kBAAM,mBAAmB,qCAAqC,MAAM,eAAeA,OAAI;AACvF,gBAAI;AACA,qBAAO;AACX,kBAAM,IAAI,MAAM,gEAAgEA,OAAI,mCAAmC,KAAK,UAAU,GAAG;AAAA,UAC7I;AACA,gBAAM,IAAI,MAAM,2BAA2BA,OAAI,0BAA0B,KAAK,UAAU,uEAAuE,QAAQ,IAAI;AAAA,QAC/K;AAAA,MACJ;AAAA,MACA,CAAC,GAAG,aAAa,SAAS,GAAG;AAAA,QACzB,MAAM;AACF,gBAAM,UAAU,KAAK,QAAQ,QAAQA,OAAI;AACzC,cAAI,QAAQ,SAAS,GAAG;AACpB,mBAAO,QACF,IAAI,CAAC,kBAAkB;AACxB,oBAAM,mBAAmB,qCAAqC,MAAM,eAAeA,OAAI;AACvF,kBAAI;AACA,uBAAO;AACX,sBAAQ,KAAK,gEAAgEA,OAAI,mCAAmC,KAAK,UAAU,KAAK,aAAa;AAAA,YACzJ,CAAC,EACI,OAAO,CAAC,eAAe,UAAU;AAAA,UAC1C;AACA,iBAAO,CAAC;AAAA,QACZ;AAAA,MACJ;AAAA,MACA,CAAC,GAAG,aAAa,eAAe,GAAG;AAAA,QAC/B,MAAM;AACF,gBAAM,gBAAgB,KAAK,QAAQ,KAAKA,OAAI;AAC5C,gBAAM,WAAW,KAAK,QAAQ,yBAAyBA,OAAI;AAC3D,cAAI,eAAe;AACf,mBAAO;AAAA,UACX,OACK;AACD,kBAAM,IAAI,MAAM,2BAA2BA,OAAI,0BAA0B,KAAK,UAAU,uEAAuE,QAAQ,IAAI;AAAA,UAC/K;AAAA,QACJ;AAAA,MACJ;AAAA,MACA,CAAC,GAAG,aAAa,gBAAgB,GAAG;AAAA,QAChC,MAAM;AACF,iBAAO,KAAK,QAAQ,QAAQA,OAAI;AAAA,QACpC;AAAA,MACJ;AAAA,MACA,CAAC,MAAM,WAAW,aAAa,CAAC,QAAQ,GAAG;AAAA,QACvC,MAAM;AACF,iBAAO,KAAK,QAAQ,IAAIA,OAAI;AAAA,QAChC;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAEA,WAAS,yBAAyB,aAAa;AAC3C,UAAM,UAAU,iCAAiC,aAAa,SAAS;AACvE,WAAO,QAAQ,OAAO,CAACG,aAAY,qBAAqB;AACpD,aAAO,OAAO,OAAOA,aAAY,8BAA8B,gBAAgB,CAAC;AAAA,IACpF,GAAG,CAAC,CAAC;AAAA,EACT;AACA,WAAS,8BAA8BH,SAAM;AACzC,WAAO;AAAA,MACH,CAAC,GAAGA,OAAI,QAAQ,GAAG;AAAA,QACf,MAAM;AACF,gBAAM,SAAS,KAAK,QAAQ,KAAKA,OAAI;AACrC,cAAI,QAAQ;AACR,mBAAO;AAAA,UACX,OACK;AACD,kBAAM,IAAI,MAAM,2BAA2BA,OAAI,UAAU,KAAK,UAAU,cAAc;AAAA,UAC1F;AAAA,QACJ;AAAA,MACJ;AAAA,MACA,CAAC,GAAGA,OAAI,SAAS,GAAG;AAAA,QAChB,MAAM;AACF,iBAAO,KAAK,QAAQ,QAAQA,OAAI;AAAA,QACpC;AAAA,MACJ;AAAA,MACA,CAAC,MAAM,WAAWA,OAAI,CAAC,QAAQ,GAAG;AAAA,QAC9B,MAAM;AACF,iBAAO,KAAK,QAAQ,IAAIA,OAAI;AAAA,QAChC;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AAEA,WAAS,wBAAwB,aAAa;AAC1C,UAAM,uBAAuB,iCAAiC,aAAa,QAAQ;AACnF,UAAM,wBAAwB;AAAA,MAC1B,oBAAoB;AAAA,QAChB,MAAM;AACF,iBAAO,qBAAqB,OAAO,CAAC,QAAQ,wBAAwB;AAChE,kBAAM,kBAAkB,yBAAyB,qBAAqB,KAAK,UAAU;AACrF,kBAAM,gBAAgB,KAAK,KAAK,uBAAuB,gBAAgB,GAAG;AAC1E,mBAAO,OAAO,OAAO,QAAQ,EAAE,CAAC,aAAa,GAAG,gBAAgB,CAAC;AAAA,UACrE,GAAG,CAAC,CAAC;AAAA,QACT;AAAA,MACJ;AAAA,IACJ;AACA,WAAO,qBAAqB,OAAO,CAACG,aAAY,wBAAwB;AACpE,aAAO,OAAO,OAAOA,aAAY,iCAAiC,mBAAmB,CAAC;AAAA,IAC1F,GAAG,qBAAqB;AAAA,EAC5B;AACA,WAAS,iCAAiC,qBAAqB,YAAY;AACvE,UAAM,aAAa,yBAAyB,qBAAqB,UAAU;AAC3E,UAAM,EAAE,KAAK,MAAAH,SAAM,QAAQ,MAAM,QAAQ,MAAM,IAAI;AACnD,WAAO;AAAA,MACH,CAACA,OAAI,GAAG;AAAA,QACJ,MAAM;AACF,gBAAM,QAAQ,KAAK,KAAK,IAAI,GAAG;AAC/B,cAAI,UAAU,MAAM;AAChB,mBAAO,KAAK,KAAK;AAAA,UACrB,OACK;AACD,mBAAO,WAAW;AAAA,UACtB;AAAA,QACJ;AAAA,QACA,IAAI,OAAO;AACP,cAAI,UAAU,QAAW;AACrB,iBAAK,KAAK,OAAO,GAAG;AAAA,UACxB,OACK;AACD,iBAAK,KAAK,IAAI,KAAK,MAAM,KAAK,CAAC;AAAA,UACnC;AAAA,QACJ;AAAA,MACJ;AAAA,MACA,CAAC,MAAM,WAAWA,OAAI,CAAC,EAAE,GAAG;AAAA,QACxB,MAAM;AACF,iBAAO,KAAK,KAAK,IAAI,GAAG,KAAK,WAAW;AAAA,QAC5C;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AACA,WAAS,yBAAyB,CAAC,OAAO,cAAc,GAAG,YAAY;AACnE,WAAO,yCAAyC;AAAA,MAC5C;AAAA,MACA;AAAA,MACA;AAAA,IACJ,CAAC;AAAA,EACL;AACA,WAAS,uBAAuB,UAAU;AACtC,YAAQ,UAAU;AAAA,MACd,KAAK;AACD,eAAO;AAAA,MACX,KAAK;AACD,eAAO;AAAA,MACX,KAAK;AACD,eAAO;AAAA,MACX,KAAK;AACD,eAAO;AAAA,MACX,KAAK;AACD,eAAO;AAAA,IACf;AAAA,EACJ;AACA,WAAS,sBAAsB,cAAc;AACzC,YAAQ,OAAO,cAAc;AAAA,MACzB,KAAK;AACD,eAAO;AAAA,MACX,KAAK;AACD,eAAO;AAAA,MACX,KAAK;AACD,eAAO;AAAA,IACf;AACA,QAAI,MAAM,QAAQ,YAAY;AAC1B,aAAO;AACX,QAAI,OAAO,UAAU,SAAS,KAAK,YAAY,MAAM;AACjD,aAAO;AAAA,EACf;AACA,WAAS,qBAAqB,SAAS;AACnC,UAAM,EAAE,YAAY,OAAO,WAAW,IAAI;AAC1C,UAAM,UAAU,YAAY,WAAW,IAAI;AAC3C,UAAM,aAAa,YAAY,WAAW,OAAO;AACjD,UAAM,aAAa,WAAW;AAC9B,UAAM,WAAW,WAAW,CAAC;AAC7B,UAAM,cAAc,CAAC,WAAW;AAChC,UAAM,iBAAiB,uBAAuB,WAAW,IAAI;AAC7D,UAAM,uBAAuB,sBAAsB,QAAQ,WAAW,OAAO;AAC7E,QAAI;AACA,aAAO;AACX,QAAI;AACA,aAAO;AACX,QAAI,mBAAmB,sBAAsB;AACzC,YAAM,eAAe,aAAa,GAAG,UAAU,IAAI,KAAK,KAAK;AAC7D,YAAM,IAAI,MAAM,uDAAuD,YAAY,kCAAkC,cAAc,qCAAqC,WAAW,OAAO,iBAAiB,oBAAoB,IAAI;AAAA,IACvO;AACA,QAAI;AACA,aAAO;AAAA,EACf;AACA,WAAS,yBAAyB,SAAS;AACvC,UAAM,EAAE,YAAY,OAAO,eAAe,IAAI;AAC9C,UAAM,aAAa,EAAE,YAAY,OAAO,YAAY,eAAe;AACnE,UAAM,iBAAiB,qBAAqB,UAAU;AACtD,UAAM,uBAAuB,sBAAsB,cAAc;AACjE,UAAM,mBAAmB,uBAAuB,cAAc;AAC9D,UAAM,OAAO,kBAAkB,wBAAwB;AACvD,QAAI;AACA,aAAO;AACX,UAAM,eAAe,aAAa,GAAG,UAAU,IAAI,cAAc,KAAK;AACtE,UAAM,IAAI,MAAM,uBAAuB,YAAY,UAAU,KAAK,SAAS;AAAA,EAC/E;AACA,WAAS,0BAA0B,gBAAgB;AAC/C,UAAM,WAAW,uBAAuB,cAAc;AACtD,QAAI;AACA,aAAO,oBAAoB,QAAQ;AACvC,UAAM,aAAa,YAAY,gBAAgB,SAAS;AACxD,UAAM,UAAU,YAAY,gBAAgB,MAAM;AAClD,UAAM,aAAa;AACnB,QAAI;AACA,aAAO,WAAW;AACtB,QAAI,SAAS;AACT,YAAM,EAAE,KAAK,IAAI;AACjB,YAAM,mBAAmB,uBAAuB,IAAI;AACpD,UAAI;AACA,eAAO,oBAAoB,gBAAgB;AAAA,IACnD;AACA,WAAO;AAAA,EACX;AACA,WAAS,yCAAyC,SAAS;AACvD,UAAM,EAAE,OAAO,eAAe,IAAI;AAClC,UAAM,MAAM,GAAG,UAAU,KAAK,CAAC;AAC/B,UAAM,OAAO,yBAAyB,OAAO;AAC7C,WAAO;AAAA,MACH;AAAA,MACA;AAAA,MACA,MAAM,SAAS,GAAG;AAAA,MAClB,IAAI,eAAe;AACf,eAAO,0BAA0B,cAAc;AAAA,MACnD;AAAA,MACA,IAAI,wBAAwB;AACxB,eAAO,sBAAsB,cAAc,MAAM;AAAA,MACrD;AAAA,MACA,QAAQ,QAAQ,IAAI;AAAA,MACpB,QAAQ,QAAQ,IAAI,KAAK,QAAQ;AAAA,IACrC;AAAA,EACJ;AACA,MAAM,sBAAsB;AAAA,IACxB,IAAI,QAAQ;AACR,aAAO,CAAC;AAAA,IACZ;AAAA,IACA,SAAS;AAAA,IACT,QAAQ;AAAA,IACR,IAAI,SAAS;AACT,aAAO,CAAC;AAAA,IACZ;AAAA,IACA,QAAQ;AAAA,EACZ;AACA,MAAM,UAAU;AAAA,IACZ,MAAM,OAAO;AACT,YAAM,QAAQ,KAAK,MAAM,KAAK;AAC9B,UAAI,CAAC,MAAM,QAAQ,KAAK,GAAG;AACvB,cAAM,IAAI,UAAU,yDAAyD,KAAK,cAAc,sBAAsB,KAAK,CAAC,GAAG;AAAA,MACnI;AACA,aAAO;AAAA,IACX;AAAA,IACA,QAAQ,OAAO;AACX,aAAO,EAAE,SAAS,OAAO,OAAO,KAAK,EAAE,YAAY,KAAK;AAAA,IAC5D;AAAA,IACA,OAAO,OAAO;AACV,aAAO,OAAO,MAAM,QAAQ,MAAM,EAAE,CAAC;AAAA,IACzC;AAAA,IACA,OAAO,OAAO;AACV,YAAM,SAAS,KAAK,MAAM,KAAK;AAC/B,UAAI,WAAW,QAAQ,OAAO,UAAU,YAAY,MAAM,QAAQ,MAAM,GAAG;AACvE,cAAM,IAAI,UAAU,0DAA0D,KAAK,cAAc,sBAAsB,MAAM,CAAC,GAAG;AAAA,MACrI;AACA,aAAO;AAAA,IACX;AAAA,IACA,OAAO,OAAO;AACV,aAAO;AAAA,IACX;AAAA,EACJ;AACA,MAAM,UAAU;AAAA,IACZ,SAAS;AAAA,IACT,OAAO;AAAA,IACP,QAAQ;AAAA,EACZ;AACA,WAAS,UAAU,OAAO;AACtB,WAAO,KAAK,UAAU,KAAK;AAAA,EAC/B;AACA,WAAS,YAAY,OAAO;AACxB,WAAO,GAAG,KAAK;AAAA,EACnB;AAEA,MAAM,aAAN,MAAiB;AAAA,IACb,YAAY,SAAS;AACjB,WAAK,UAAU;AAAA,IACnB;AAAA,IACA,WAAW,aAAa;AACpB,aAAO;AAAA,IACX;AAAA,IACA,OAAO,UAAU,aAAa,cAAc;AACxC;AAAA,IACJ;AAAA,IACA,IAAI,cAAc;AACd,aAAO,KAAK,QAAQ;AAAA,IACxB;AAAA,IACA,IAAI,QAAQ;AACR,aAAO,KAAK,QAAQ;AAAA,IACxB;AAAA,IACA,IAAI,UAAU;AACV,aAAO,KAAK,MAAM;AAAA,IACtB;AAAA,IACA,IAAI,aAAa;AACb,aAAO,KAAK,MAAM;AAAA,IACtB;AAAA,IACA,IAAI,UAAU;AACV,aAAO,KAAK,MAAM;AAAA,IACtB;AAAA,IACA,IAAI,UAAU;AACV,aAAO,KAAK,MAAM;AAAA,IACtB;AAAA,IACA,IAAI,UAAU;AACV,aAAO,KAAK,MAAM;AAAA,IACtB;AAAA,IACA,IAAI,OAAO;AACP,aAAO,KAAK,MAAM;AAAA,IACtB;AAAA,IACA,aAAa;AAAA,IACb;AAAA,IACA,UAAU;AAAA,IACV;AAAA,IACA,aAAa;AAAA,IACb;AAAA,IACA,SAAS,WAAW,EAAE,SAAS,KAAK,SAAS,SAAS,CAAC,GAAG,SAAS,KAAK,YAAY,UAAU,MAAM,aAAa,KAAM,IAAI,CAAC,GAAG;AAC3H,YAAM,OAAO,SAAS,GAAG,MAAM,IAAI,SAAS,KAAK;AACjD,YAAM,QAAQ,IAAI,YAAY,MAAM,EAAE,QAAQ,SAAS,WAAW,CAAC;AACnE,aAAO,cAAc,KAAK;AAC1B,aAAO;AAAA,IACX;AAAA,EACJ;AACA,aAAW,YAAY;AAAA,IACnB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACJ;AACA,aAAW,UAAU,CAAC;AACtB,aAAW,UAAU,CAAC;AACtB,aAAW,SAAS,CAAC;;;AChgFrB,MAAqB,UAArB,MAAqB,SAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAU3B,YAAY,YAAY,OAAO,KAAK;AAClC,UAAI,cAAc,SAAS,KAAK;AAC9B,aAAK,OAAO,WAAW,SAAS;AAChC,aAAK,KAAO,KAAK,QAAQ,KAAK;AAC9B,aAAK,KAAO,KAAK,QAAQ,GAAG;AAAA,MAC9B,WAAW,sBAAsB,MAAM;AACrC,aAAK,OAAO,WAAW,YAAY,EAAE,SAAS;AAC9C,aAAK,KAAO,KAAK,QAAQ,WAAW,SAAS,IAAI,CAAC;AAClD,aAAK,KAAO,KAAK,QAAQ,WAAW,QAAQ,CAAC;AAAA,MAC/C,WAAW,YAAY;AACrB,SAAC,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,IAAI,WAAW,MAAM,GAAG;AAAA,MACtD,OAAO;AACL,cAAM,QAAQ,oBAAI,KAAK;AACvB,aAAK,OAAO,MAAM,YAAY,EAAE,SAAS;AACzC,aAAK,KAAO,KAAK,QAAQ,MAAM,SAAS,IAAI,CAAC;AAC7C,aAAK,KAAO,KAAK,QAAQ,MAAM,QAAQ,CAAC;AAAA,MAC1C;AAAA,IACF;AAAA,IAEA,WAAW;AACT,aAAO,CAAC,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,EAAE,KAAK,GAAG;AAAA,IAC/C;AAAA,IAEA,cAAc,YAAY;AACxB,YAAM,OAAO,KAAK,OAAO;AACzB,WAAK,QAAQ,UAAU;AACvB,aAAO,IAAI,SAAQ,IAAI;AAAA,IACzB;AAAA;AAAA,IAGA,eAAe,WAAW;AACxB,YAAM,OAAO,KAAK,OAAO;AACzB,WAAK,QAAQ,KAAK,QAAQ,KAAK,IAAI,KAAK,OAAO,IAAI,aAAa,CAAC;AACjE,aAAO,IAAI,SAAQ,IAAI;AAAA,IACzB;AAAA;AAAA,IAGA,cAAc,WAAW;AACvB,YAAM,OAAO,KAAK,OAAO;AACzB,WAAK,QAAQ,KAAK,QAAQ,KAAK,YAAY,IAAI,KAAK,OAAO,KAAK,CAAC;AACjE,aAAO,IAAI,SAAQ,IAAI;AAAA,IACzB;AAAA,IAEA,eAAe;AACb,aAAO,KAAK,UAAU,QAAQ,EAAE;AAAA,IAClC;AAAA,IAEA,WAAW;AACT,aAAO,KAAK,UAAU,QAAQ,CAAC;AAAA,IACjC;AAAA;AAAA;AAAA,IAIA,cAAc,iBAAiB,MAAM;AACnC,UAAI,gBAAgB;AAClB,eAAO,KAAK,UAAU,MAAM,EAAE;AAAA,MAChC,OAAO;AACL,cAAM,QAAQ,KAAK;AACnB,YAAI,UAAU,KAAK,UAAU,MAAM,GAAG;AACtC,YAAI,QAAQ,MAAM,MAAO,WAAU,QAAQ,UAAU,MAAM,EAAE;AAC7D,eAAO;AAAA,MACT;AAAA,IACF;AAAA;AAAA;AAAA,IAIA,UAAU,iBAAiB,MAAM;AAC/B,UAAI,gBAAgB;AAClB,eAAO,KAAK,UAAU,MAAM,CAAC;AAAA,MAC/B,OAAO;AACL,cAAM,QAAQ,KAAK;AACnB,YAAI,UAAU,KAAK,UAAU,MAAM,EAAE;AACrC,YAAI,QAAQ,MAAM,MAAO,WAAU,QAAQ,UAAU,MAAM,CAAC;AAC5D,eAAO;AAAA,MACT;AAAA,IACF;AAAA,IAEA,eAAe;AACb,aAAO,KAAK,UAAU,MAAM,EAAE;AAAA,IAChC;AAAA,IAEA,WAAW;AACT,aAAO,KAAK,UAAU,MAAM,CAAC;AAAA,IAC/B;AAAA,IAEA,cAAc;AACZ,aAAO,KAAK,UAAU,MAAM,EAAE;AAAA,IAChC;AAAA,IAEA,UAAU;AACR,aAAO,KAAK,UAAU,MAAM,CAAC;AAAA,IAC/B;AAAA,IAEA,YAAY;AACV,aAAO,CAAC,GAAG,CAAC,EAAE,SAAS,KAAK,OAAO,EAAE,OAAO,CAAC;AAAA,IAC/C;AAAA,IAEA,UAAU;AACR,aAAO,KAAK,OAAO,IAAI,SAAQ,CAAC;AAAA,IAClC;AAAA,IAEA,iBAAiB,WAAW;AAC1B,aAAO,KAAK,OAAO,EAAE,OAAO,KAAK;AAAA,IACnC;AAAA,IAEA,OAAO,SAAS;AACd,aAAO,KAAK,SAAS,KAAK,QAAQ,SAAS;AAAA,IAC7C;AAAA,IAEA,OAAO,SAAS;AACd,aAAO,KAAK,SAAS,IAAI,QAAQ,SAAS;AAAA,IAC5C;AAAA,IAEA,MAAM,SAAS;AACb,aAAO,KAAK,SAAS,IAAI,QAAQ,SAAS;AAAA,IAC5C;AAAA;AAAA;AAAA,IAIA,UAAUU,OAAMC,QAAO;AACrB,UAAI;AACJ,UAAID,SAAQ,MAAM;AAChB,eAAO,KAAK,OAAO;AACnB,aAAK,QAAQ,KAAK,QAAQ,IAAIC,MAAK;AAAA,MACrC,OAAO;AACL,eAAOD,SAAQ,SACR,IAAI,KAAK,CAAC,KAAK,OAAOC,QAAO,CAAC,KAAK,KAAK,CAAC,IACzC,IAAI,KAAK,CAAC,KAAK,MAAM,CAAC,KAAK,KAAK,IAAIA,MAAK;AAChD,cAAM,aAAa,SAAQ,YAAY,KAAK,SAAS,IAAI,GAAG,KAAK,QAAQ,CAAC;AAC1E,aAAK,QAAQ,CAAC,KAAK,KAAK,aAAa,aAAa,CAAC,KAAK,EAAE;AAAA,MAC5D;AACA,aAAO,IAAI,SAAQ,IAAI;AAAA,IACzB;AAAA,IAEA,OAAO,WAAW,KAAK;AACrB,UAAI,CAAC,sBAAsB,KAAK,GAAG,EAAG,QAAO;AAC7C,aAAO,KAAK,YAAY,GAAG,IAAI,MAAM,GAAG,EAAE,IAAI,OAAK,CAAC,CAAC,CAAC;AAAA,IACxD;AAAA;AAAA;AAAA;AAAA,IAKA,OAAO,YAAY,MAAM,OAAO,KAAK;AACnC,UAAI,OAAQ,OAAQ,OAAQ,KAAM,QAAO;AACzC,UAAI,QAAW,KAAK,QAAU,GAAI,QAAO;AACzC,UAAI,MAAW,KAAK,MAAQ,KAAK,YAAY,OAAO,IAAI,EAAG,QAAO;AAClE,aAAO;AAAA,IACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,YAAY,OAAO,MAAM;AAC9B,UAAI,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,EAAE,EAAE,SAAS,KAAK,EAAG,QAAO;AACpD,UAAI,CAAC,GAAG,GAAG,GAAG,EAAE,EAAE,SAAS,KAAK,EAAG,QAAO;AAC1C,aAAO,KAAK,WAAW,IAAI,IAAI,KAAK;AAAA,IACtC;AAAA,IAEA,OAAO,WAAW,MAAM;AACtB,UAAK,OAAO,OAAQ,EAAG,QAAO;AAC9B,UAAK,OAAO,OAAQ,EAAG,QAAO;AAC9B,aAAO,OAAO,KAAK;AAAA,IACrB;AAAA;AAAA,IAGA,QAAQ,KAAK;AACX,aAAO,IAAI,SAAS,EAAE,SAAS,GAAG,GAAG;AAAA,IACvC;AAAA,IAEA,SAAS;AAEP,aAAO,IAAI,KAAK,CAAC,KAAK,MAAM,CAAC,KAAK,KAAK,GAAG,CAAC,KAAK,EAAE;AAAA,IACpD;AAAA,EACF;;;ACrLA,MAAqB,aAArB,cAAwC,WAAW;AAAA,IAEjD,OAAO,UAAU;AAAA,MAAC;AAAA,MAAS;AAAA,MAAU;AAAA,MAAU;AAAA,MAC7C;AAAA,MAAS;AAAA,MAAQ;AAAA,MAAa;AAAA,MAAS;AAAA,MAAa;AAAA,IAAM;AAAA,IAE5D,OAAO,SAAS;AAAA,MACd,MAAgB;AAAA,MAChB,KAAgB;AAAA,MAChB,KAAgB;AAAA,MAChB,QAAgB,EAAC,MAAM,QAAQ,SAAS,WAAU;AAAA,MAClD,gBAAgB,EAAC,MAAM,QAAQ,SAAS,EAAC;AAAA,MACzC,eAAgB,EAAC,MAAM,QAAQ,SAAS,EAAC;AAAA,MACzC,eAAgB,EAAC,MAAM,SAAS,SAAS,KAAI;AAAA,MAC7C,WAAgB,EAAC,MAAM,QAAQ,SAAS,aAAY;AAAA,MACpD,UAAgB;AAAA,MAChB,MAAgB;AAAA,MAChB,SAAgB,EAAC,MAAM,OAAO,SAAS,CAAC,SAAS,EAAC;AAAA,IACpD;AAAA,IAEA,OAAO,mBAAmB;AAAA,MACxB,WAAe;AAAA,MACf,UAAe;AAAA,MACf,eAAe;AAAA,MACf,WAAe;AAAA,MACf,OAAe;AAAA,MACf,YAAe;AAAA,MACf,YAAe;AAAA,IACjB;AAAA,IAEA,KAAK,KAAK;AACR,aAAO,EAAC,GAAG,KAAK,YAAY,kBAAkB,GAAG,KAAK,UAAS,EAAE,GAAG;AAAA,IACtE;AAAA,IAEA,UAAU;AACR,UAAI,CAAC,KAAK,gBAAiB,MAAK,eAAe;AAC/C,WAAK,eAAe;AACpB,WAAK,gBAAgB;AACrB,WAAK,mBAAmB;AACxB,WAAK,YAAY,KAAK,YAAY;AAAA,IACpC;AAAA,IAEA,iBAAiB,OAAO,eAAe;AACrC,UAAI,CAAC,KAAK,gBAAiB;AAC3B,YAAM,sBAAsB,SAAS,KAAK,aAAa;AACvD,WAAK,aAAa,QAAQ;AAC1B,WAAK,YAAY,QAAQ,KAAK,OAAO,KAAK;AAG1C,UAAI,oBAAqB,MAAK,YAAY,cAAc,IAAI,MAAM,QAAQ,CAAC;AAC3E,WAAK,SAAS,KAAK;AAAA,IACrB;AAAA,IAEA,SAAS,SAAS;AAChB,YAAM,UAAU,KAAK,kBAAkB,OAAO;AAC9C,WAAK,YAAY,kBAAkB,OAAO;AAC1C,UAAI,QAAS,MAAK,YAAY,eAAe;AAAA,IAC/C;AAAA,IAEA,kBAAkB,SAAS;AACzB,UAAI,CAAC,QAAS,QAAO;AACrB,YAAM,UAAU,IAAI,QAAQ,OAAO;AACnC,aAAO,KAAK,eAAe,OAAO,IAAI,KAAK,iBAAiB,IACrD,KAAK,cAAc,OAAO,IAAK,KAAK,gBAAgB,IACpD;AAAA,IACT;AAAA,IAEA,mBAAmB;AACjB,aAAO,KAAK,KAAK,WAAW,EAAE,QAAQ,MAAM,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,IACxE;AAAA,IAEA,kBAAkB;AAChB,aAAO,KAAK,KAAK,UAAU,EAAE,QAAQ,MAAM,KAAK,OAAO,KAAK,QAAQ,CAAC;AAAA,IACvE;AAAA,IAEA,iBAAiB;AACf,WAAK,YAAY,mBAAmB,YAAY;AAAA;AAAA,qBAE/B,KAAK,YAAY,aAAa,MAAM,CAAC;AAAA,sBACpC,KAAK,YAAY,KAAK;AAAA;AAAA,KAEvC;AAAA,IACH;AAAA,IAEA,iBAAiB;AACf,WAAK,UAAU,KAAK,aAAa,mBAAmB;AAAA,IACtD;AAAA,IAEA,kBAAkB;AAChB,UAAI,CAAC,KAAK,gBAAiB;AAE3B,UAAI,SAAS;AACb,UAAI,EAAE,KAAK,wBAAwB,mBAAoB,WAAU;AAEjE,WAAK,UAAU,KAAK,cAAc,MAAM;AAAA,IAC1C;AAAA,IAEA,UAAU,SAAS,QAAQ;AACzB,UAAK,YAAa,QAAQ,SAAS;AACjC,gBAAQ,QAAQ,UAAU,IAAI,MAAM;AAAA,MACtC,OAAO;AACL,gBAAQ,QAAQ,SAAS;AAAA,MAC3B;AAAA,IACF;AAAA,IAEA,mBAAmB,QAAQ,KAAK,KAAK,YAAY,GAAG;AAClD,UAAI,CAAC,KAAK,gBAAiB;AAC3B,WAAK,aAAa,aAAa,cAAc,KAAK;AAAA,IACpD;AAAA,IAEA,SAAS;AACP,YAAM,UAAU,KAAK,MAAM,KAAK,YAAY,KAAK;AACjD,UAAI,WAAW,GAAI,MAAK,YAAY;AAAA,IACtC;AAAA,IAEA,OAAO,OAAO;AACZ,YAAM,eAAe;AACrB,YAAM,gBAAgB;AACtB,UAAI,MAAM,QAAQ,aAAa,CAAC,CAAC,KAAK,OAAO,EAAE,SAAS,MAAM,GAAG,EAAG;AACpE,WAAK,oBAAoB,KAAK,MAAM,IAAI,IAAI,KAAK,KAAK,IAAI;AAAA,IAC5D;AAAA,IAEA,MAAM,SAAS;AACb,UAAI,SAAS;AACX,aAAK,eAAe,UAAU,IAAI,UAAU;AAC5C,YAAI,KAAK,gBAAgB,KAAK,cAAc,GAAG;AAC7C,eAAK,eAAe,iBAAiB,CAAAC,OAAKA,GAAE,OAAO,OAAO;AAAA,QAC5D,OAAO;AACL,eAAK,eAAe,OAAO;AAAA,QAC7B;AAAA,MACF,OAAO;AACL,aAAK,eAAe,OAAO;AAAA,MAC7B;AAEA,WAAK,aAAa,MAAM;AAAA,IAC1B;AAAA,IAEA,KAAK,SAAS,UAAU,KAAK,eAAe,GAAG;AAC7C,WAAK,OAAO,SAAS,OAAO;AAC5B,WAAK,UAAU,OAAO;AAAA,IACxB;AAAA;AAAA;AAAA;AAAA,IAKA,iBAAiB;AACf,aAAO,KAAK,MAAM,IAAI,QAAQ,KAAK,SAAS,CAAC;AAAA,IAC/C;AAAA,IAEA,MAAM,SAAS;AACb,aAAO,KAAK,eAAe,OAAO,IAAI,IAAI,QAAQ,KAAK,QAAQ,IACxD,KAAK,cAAc,OAAO,IAAK,IAAI,QAAQ,KAAK,QAAQ,IACxD;AAAA,IACT;AAAA,IAEA,eAAe,SAAS;AACtB,aAAO,KAAK,eAAe,QAAQ,OAAO,IAAI,QAAQ,KAAK,QAAQ,CAAC;AAAA,IACtE;AAAA,IAEA,cAAc,SAAS;AACrB,aAAO,KAAK,eAAe,QAAQ,MAAM,IAAI,QAAQ,KAAK,QAAQ,CAAC;AAAA,IACrE;AAAA,IAEA,aAAa,SAAS;AACpB,aAAO,KAAK,eAAe,OAAO,KAAK,KAAK,cAAc,OAAO;AAAA,IACnE;AAAA,IAEA,oBAAoB,OAAO;AAIzB,UAAI,MAAM,OAAO,QAAQ,qCAAqC,EAAG;AACjE,WAAK,MAAM,IAAI;AAAA,IACjB;AAAA,IAEA,SAAS;AACP,YAAM,UAAU,KAAK,mCAAmC;AACxD,WAAK,MAAM,KAAK;AAChB,WAAK,KAAK,OAAO,OAAO;AAAA,IAC1B;AAAA,IAEA,gBAAgB;AACd,YAAM,UAAU,KAAK,mCAAmC;AACxD,WAAK,MAAM,KAAK;AAChB,WAAK,KAAK,OAAO,QAAQ,cAAc,KAAK,kBAAkB,YAAY,CAAC;AAC3E,WAAK,gBAAgB,MAAM;AAAA,IAC7B;AAAA,IAEA,gBAAgB;AACd,YAAM,UAAU,KAAK,mCAAmC;AACxD,WAAK,MAAM,KAAK;AAChB,WAAK,KAAK,OAAO,QAAQ,UAAU,KAAK,kBAAkB,YAAY,CAAC;AACvE,WAAK,gBAAgB,MAAM;AAAA,IAC7B;AAAA,IAEA,YAAY;AACV,WAAK,MAAM,KAAK;AAChB,WAAK,KAAK,OAAO,IAAI,QAAQ,CAAC;AAC9B,WAAK,YAAY,MAAM;AAAA,IACzB;AAAA;AAAA;AAAA;AAAA,IAKA,qCAAqC;AACnC,YAAM,OAAQ,KAAK,WAAW;AAC9B,YAAM,QAAQ,KAAK,YAAY;AAC/B,UAAI,MAAU,KAAK,WAAW,cAAc,2BAA2B,EAAE;AAEzE,YAAM,cAAc,QAAQ,YAAY,CAAC,OAAO,CAAC,IAAI;AACrD,UAAI,MAAM,YAAa,OAAM;AAE7B,aAAO,IAAI,QAAQ,MAAM,OAAO,GAAG;AAAA,IACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,SAAS,SAAS;AACvB,YAAM,MAAM;AAAA,8LAC8K,KAAK,KAAK,YAAY,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA,kBAKnM,KAAK,aAAa,CAAC,QAAQ,EAAE,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA,kBAK9B,KAAK,YAAY,CAAC,QAAQ,IAAI,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA,6HAK4E,KAAK,KAAK,eAAe,CAAC,iBAAiB,KAAK,KAAK,eAAe,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA,sHAK5E,KAAK,KAAK,OAAO,CAAC,iBAAiB,KAAK,KAAK,OAAO,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA,6HAK9C,KAAK,KAAK,WAAW,CAAC,iBAAiB,KAAK,KAAK,WAAW,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,YAQ9K,KAAK,WAAW,CAAC;AAAA;AAAA;AAAA,YAGjB,KAAK,KAAK,OAAO,CAAC;AAAA;AAAA;AAAA;AAI1B,WAAK,QAAQ,mBAAmB,aAAa,GAAG;AAChD,UAAI,SAAS;AACX,aAAK,eAAe,UAAU,IAAI,SAAS;AAC3C,YAAI,KAAK,gBAAgB,KAAK,cAAc,GAAG;AAC7C,eAAK,eAAe,iBAAiB,CAAAA,OAAK,KAAK,eAAe,UAAU,OAAO,SAAS;AAAA,QAC1F,OAAO;AACL,eAAK,eAAe,UAAU,OAAO,SAAS;AAAA,QAChD;AAAA,MACF;AAAA,IACF;AAAA,IAEA,uBAAuB;AACrB,WAAK,eAAe,KAAK,WAAW;AAAA,IACtC;AAAA,IAEA,sBAAsB;AACpB,WAAK,eAAe,KAAK,UAAU;AAAA,IACrC;AAAA;AAAA,IAGA,eAAe,QAAQ;AACrB,YAAM,aAAa,SAAS,cAAc,QAAQ;AAClD,YAAM,aAAa,SAAS,cAAc,QAAQ;AAClD,iBAAW,cAAc,OAAO,QAAQ,OAAO,aAAa,EAAE;AAC9D,iBAAW,MAAM,WAAW;AAC5B,iBAAW,YAAY,UAAU;AACjC,aAAO,MAAM,UAAU;AACvB,YAAM,kBAAkB,OAAO,iBAAiB,UAAU,EAAE;AAC5D,aAAO,MAAM,QAAQ;AACrB,iBAAW,OAAO;AAAA,IACpB;AAAA,IAEA,KAAK,OAAO;AACV,YAAM,eAAe;AAErB,UAAI,QAAQ;AACZ,cAAQ,MAAM,OAAO,aAAa;AAAA,QAChC,KAAK;AACH,iBAAO,MAAM;AACb,mBAAS,KAAK;AACd;AAAA,QACF,KAAK;AACH,mBAAS,MAAM;AACf,iBAAO,OAAO,SAAS,CAAC;AACxB;AAAA,QACF;AACE;AAAA,MACJ;AAEA,UAAI,OAAO,aAAa,eAAe,EAAG;AAC1C,YAAM,UAAU,KAAK,aAAa,UAAU;AAC5C,WAAK,WAAW,IAAI,QAAQ,OAAO,CAAC;AAAA,IACtC;AAAA,IAEA,IAAI,OAAO;AACT,cAAQ,MAAM,KAAK;AAAA,QACjB,KAAK;AACH,eAAK,MAAM,IAAI;AACf;AAAA,QACF,KAAK;AACH,cAAI,MAAM,UAAU;AAClB,gBAAI,SAAS,iBAAiB,KAAK,aAAa,GAAG;AACjD,oBAAM,eAAe;AACrB,mBAAK,YAAY,EAAE,MAAM;AAAA,YAC3B;AAAA,UACF,OAAO;AACL,gBAAI,SAAS,iBAAiB,KAAK,YAAY,GAAG;AAChD,oBAAM,eAAe;AACrB,mBAAK,aAAa,EAAE,MAAM;AAAA,YAC5B;AAAA,UACF;AACA;AAAA,MACJ;AAEA,YAAM,SAAS,MAAM;AACrB,UAAI,CAAC,KAAK,WAAW,SAAS,MAAM,EAAG;AAEvC,YAAM,UAAU,OAAO,SAAS,CAAC,EAAE,aAAa,UAAU;AAC1D,YAAM,UAAU,IAAI,QAAQ,OAAO;AAEnC,cAAQ,MAAM,KAAK;AAAA,QACjB,KAAK;AAAA,QACL,KAAK;AACH,gBAAM,eAAe;AACrB,cAAI,CAAC,OAAO,aAAa,eAAe,EAAG,MAAK,WAAW,OAAO;AAClE;AAAA,QACF,KAAK;AAAA,QACL,KAAK;AACH,eAAK,UAAU,QAAQ,aAAa,CAAC;AACrC;AAAA,QACF,KAAK;AAAA,QACL,KAAK;AACH,eAAK,UAAU,QAAQ,SAAS,CAAC;AACjC;AAAA,QACF,KAAK;AAAA,QACL,KAAK;AACH,eAAK,UAAU,QAAQ,YAAY,CAAC;AACpC;AAAA,QACF,KAAK;AAAA,QACL,KAAK;AACH,eAAK,UAAU,QAAQ,QAAQ,CAAC;AAChC;AAAA,QACF,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AACH,eAAK,UAAU,QAAQ,eAAe,KAAK,mBAAmB,CAAC;AAC/D;AAAA,QACF,KAAK;AAAA,QACL,KAAK;AACH,eAAK,UAAU,QAAQ,cAAc,KAAK,mBAAmB,CAAC;AAC9D;AAAA,QACF,KAAK;AACH,gBAAM,WACF,KAAK,UAAU,QAAQ,aAAa,CAAC,IACrC,KAAK,UAAU,QAAQ,cAAc,KAAK,sBAAsB,CAAC,CAAC;AACtE;AAAA,QACF,KAAK;AACH,gBAAM,WACF,KAAK,UAAU,QAAQ,SAAS,CAAC,IACjC,KAAK,UAAU,QAAQ,UAAU,KAAK,sBAAsB,CAAC,CAAC;AAClE;AAAA,QACF,KAAK;AACH,eAAK,UAAU,QAAQ,cAAc,KAAK,sBAAsB,CAAC,CAAC;AAClE;AAAA,QACF,KAAK;AACH,eAAK,UAAU,QAAQ,aAAa,CAAC;AACrC;AAAA,QACF,KAAK;AACH,eAAK,UAAU,QAAQ,UAAU,KAAK,sBAAsB,CAAC,CAAC;AAC9D;AAAA,QACF,KAAK;AACH,eAAK,UAAU,QAAQ,SAAS,CAAC;AACjC;AAAA,MACJ;AAAA,IACF;AAAA,IAEA,eAAe;AACb,aAAO,KAAK;AAAA,IACd;AAAA,IAEA,cAAc;AACZ,aAAO,KAAK,eAAe,cAAc,gCAAgC;AAAA,IAC3E;AAAA,IAEA,wBAAwB;AACtB,aAAO,KAAK,kBAAkB;AAAA,IAChC;AAAA;AAAA,IAIA,WAAW,SAAS;AAClB,WAAK,MAAM,IAAI;AACf,WAAK,aAAa,MAAM;AACxB,WAAK,YAAY,QAAQ,SAAS;AAAA,IACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,UAAU,SAAS;AACjB,YAAM,OAAO,KAAK,WAAW,cAAc,kBAAkB,QAAQ,SAAS,CAAC,IAAI;AAEnF,UAAI,CAAC,MAAM;AACT,cAAM,kBAAkB,KAAK,WAAW,cAAc,MAAM,EAAE,aAAa,UAAU;AACrF,YAAI,QAAQ,OAAO,IAAI,QAAQ,eAAe,CAAC,GAAG;AAChD,eAAK,cAAc;AAAA,QACrB,OAAO;AACL,eAAK,cAAc;AAAA,QACrB;AACA,aAAK,UAAU,OAAO;AACtB;AAAA,MACF;AAEA,YAAM,eAAe,KAAK,WAAW,cAAc,sBAAsB;AACzE,UAAI,aAAc,cAAa,aAAa,YAAY,EAAE;AAE1D,YAAM,SAAS,KAAK;AACpB,aAAO,aAAa,YAAY,CAAC;AACjC,aAAO,MAAM;AAEb,UAAI,CAAC,OAAO,aAAa,eAAe,GAAG;AACzC,aAAK,mBAAmB,GAAG,KAAK,KAAK,YAAY,CAAC,KAAK,KAAK,OAAO,QAAQ,SAAS,CAAC,CAAC,EAAE;AAAA,MAC1F;AAAA,IACF;AAAA;AAAA,IAGA,aAAa,UAAU;AACrB,aAAO,KAAK,WAAW,MAAM,EAC1B,IAAI,CAACC,SAAMC,OAAM,kBAAkBA,KAAI,CAAC,KAAKA,KAAI,KAAK,WAAW,aAAa,EAAE,IAAID,OAAI,WAAW,EACnG,KAAK,EAAE;AAAA,IACZ;AAAA;AAAA,IAGA,YAAY,UAAU;AACpB,YAAM,QAAQ,CAAC;AACf,YAAM,SAAS;AACf,eAAS,IAAI,WAAW,QAAQ,KAAK,WAAW,QAAQ,IAAK,OAAM,KAAK,CAAC;AACzE,aAAO,MACJ,IAAI,UAAQ,WAAW,QAAQ,WAAW,aAAa,EAAE,IAAI,IAAI,WAAW,EAC5E,KAAK,EAAE;AAAA,IACZ;AAAA,IAEA,aAAa;AACX,aAAO,KAAK,SAAS,MAAM,EACxB,IAAI,CAAAA,YAAQ,eAAeA,OAAI,KAAKA,QAAK,MAAM,GAAG,KAAK,kBAAkB,CAAC,QAAQ,EAClF,KAAK,EAAE;AAAA,IACZ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAUA,KAAK,SAAS;AACZ,YAAM,OAAO,CAAC;AACd,YAAM,WAAW,IAAI,QAAQ,KAAK,SAAS;AAC3C,UAAI,OAAO,QAAQ,cAAc,CAAC,EAAE,eAAe,KAAK,mBAAmB;AAE3E,aAAO,MAAM;AACX,cAAM,kBAAkB,KAAK,MAAM,QAAQ,MAAM,KAAK,OAAO,OAAO;AACpE,cAAM,cAAkB,KAAK,MAAM,QAAQ,MAAM,KAAK,MAAM,OAAO;AAEnE,YAAI,eAAe,KAAK,iBAAiB,KAAK,mBAAmB,EAAG;AAEpE,cAAM,QAAQ,KAAK;AAAA,UACjB,kBAAwB,mBAAmB;AAAA,UAC3C,cAAwB,mBAAmB;AAAA,UAC3C,KAAK,QAAQ,IAAW,cAAmB;AAAA,UAC3C,KAAK,UAAU,IAAS,gBAAmB;AAAA,UAC3C,KAAK,OAAO,QAAQ,IAAI,iBAAmB;AAAA,QAC7C;AACA,aAAK,KAAK;AAAA;AAAA;AAAA,kBAGE,KAAK;AAAA,kBACL,KAAK,OAAO,QAAQ,IAAI,yBAAyB,EAAE;AAAA,kBACnD,KAAK,WAAW,IAAI,IAAI,yBAAyB,EAAE;AAAA;AAAA,4BAEzC,KAAK,SAAS,CAAC,KAAK,CAAC,KAAK,EAAE;AAAA;AAAA,OAEjD;AAED,eAAO,KAAK,QAAQ;AAAA,MACtB;AAEA,aAAO,KAAK,KAAK,EAAE;AAAA,IACrB;AAAA,IAEA,kBAAkBE,UAAS;AACzB,YAAM,iBAAiBA,SAAQ,OAAO,OAAK,CAAC;AAC5C,UAAI,eAAe,UAAU,EAAG,QAAO;AACvC,aAAO,UAAU,eAAe,KAAK,GAAG,CAAC;AAAA,IAC3C;AAAA,IAEA,WAAW,SAAS;AAClB,aAAO,KAAK,aAAa,OAAO,KACxB,QAAQ,UAAU,KAAK,CAAC,KAAK,sBAC7B,KAAK,cAAc,SAAS,QAAQ,SAAS,CAAC;AAAA,IACxD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQA,OAAO,KAAK;AACV,UAAI,CAAC,QAAQ,WAAW,GAAG,EAAG,QAAO;AAErC,YAAM,CAAC,MAAM,IAAI,EAAE,IAAI,IAAI,MAAM,GAAG;AAEpC,aAAO,KAAK,YACT,QAAQ,MAAO,EAAE,EACjB,QAAQ,OAAO,CAAC,EAAE,EAClB,QAAQ,MAAO,KAAK,QAAQ,EAAE,CAAC,EAC/B,QAAQ,OAAO,CAAC,EAAE,EAClB,QAAQ,MAAO,KAAK,eAAe,IAAI,MAAM,CAAC,EAC9C,QAAQ,MAAO,KAAK,eAAe,IAAI,OAAO,CAAC,EAC/C,QAAQ,MAAO,IAAI,EACnB,QAAQ,MAAO,CAAC,OAAO,GAAG;AAAA,IAC/B;AAAA;AAAA,IAGA,QAAQ,KAAK;AACX,aAAO,IAAI,SAAS,EAAE,SAAS,GAAG,GAAG;AAAA,IACvC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQA,MAAM,KAAK;AACT,YAAM,aAAa;AAAA,QAChB,KAAK,CAAC,UAAY,SAAS,OAAO;AAAE,eAAK,MAAM,CAAC;AAAA,QAAM,CAAC;AAAA,QACxD,MAAM,CAAC,YAAY,SAAS,OAAO;AAAE,eAAK,MAAM,CAAC;AAAA,QAAM,CAAC;AAAA,QACvD,KAAK,CAAC,UAAY,SAAS,OAAO;AAAE,eAAK,QAAQ,CAAC;AAAA,QAAM,CAAC;AAAA,QAC1D,MAAM,CAAC,YAAY,SAAS,OAAO;AAAE,eAAK,QAAQ,CAAC;AAAA,QAAM,CAAC;AAAA,QACzD,KAAK,CAAC,QAAY,SAAS,OAAO,YAAY;AAAE,eAAK,QAAQ,WAAW,YAAY,OAAO,MAAM;AAAA,QAAE,CAAC;AAAA,QACpG,KAAK,CAAC,UAAY,SAAS,OAAO,YAAY;AAAE,eAAK,QAAQ,WAAW,YAAY,OAAO,OAAO;AAAA,QAAE,CAAC;AAAA,QACrG,KAAK,CAAC,UAAY,SAAS,OAAO;AAAE,eAAK,OAAO,CAAC;AAAA,QAAM,CAAC;AAAA,QACxD,KAAK,CAAC,UAAY,SAAS,OAAO;AAAE,eAAK,OAAO,MAAO,CAAC;AAAA,QAAM,CAAC;AAAA,MAClE;AACA,YAAM,QAAQ,CAAC;AACf,YAAMC,MAAK,IAAI;AAAA,QACb,KAAK,YAAY,QAAQ,yBAAyB,SAAS,GAAG,GAAG;AAC/D,gBAAM,YAAY,WAAW,CAAC;AAC9B,gBAAM,KAAK,UAAU,CAAC,CAAC;AACvB,iBAAO,IAAI,UAAU,CAAC,CAAC;AAAA,QACzB,CAAC;AAAA,MAAC;AACJ,YAAMC,WAAU,IAAI,MAAMD,GAAE;AAC5B,UAAI,CAACC,SAAS,QAAO;AAErB,YAAM,QAAQ,CAAC;AACf,eAASH,KAAI,GAAG,MAAM,MAAM,QAAQA,KAAI,KAAKA,MAAK;AAChD,cAAMA,EAAC,EAAE,KAAK,OAAOG,SAAQH,KAAI,CAAC,GAAG,IAAI;AAAA,MAC3C;AAEA,UAAI,CAAC,QAAQ,YAAY,MAAM,MAAM,MAAM,OAAO,MAAM,GAAG,EAAG,QAAO;AACrE,aAAO,IAAI,QAAQ,MAAM,MAAM,MAAM,OAAO,MAAM,GAAG,EAAE,SAAS;AAAA,IAClE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,eAAe,OAAO,aAAa;AAEjC,cAAO,oBAAI,KAAK,QAAQ,KAAK,KAAK,GAAE,eAAe,KAAK,cAAc,EAAC,OAAO,YAAW,CAAC;AAAA,IAC5F;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,YAAYD,SAAM,aAAa;AAC7B,aAAO,KAAK,WAAW,WAAW,EAAE,UAAU,OAAKA,QAAK,SAAS,CAAC,CAAC,IAAI;AAAA,IACzE;AAAA;AAAA;AAAA;AAAA;AAAA,IAMA,WAAWK,SAAQ;AACjB,YAAM,YAAY,IAAI,KAAK,eAAe,KAAK,cAAc,EAAC,OAAOA,QAAM,CAAC;AAC5E,aAAO,CAAC,MAAK,MAAK,MAAK,MAAK,MAAK,MAAK,MAAK,MAAK,MAAK,MAAK,MAAK,IAAI,EAAE;AAAA,QAAI;AAAA;AAAA,UAEvE,UAAU,OAAO,oBAAI,KAAK,QAAQ,EAAE,KAAK,CAAC;AAAA;AAAA,MAC5C;AAAA,IACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,SAASA,SAAQ;AACf,YAAM,YAAY,IAAI,KAAK,eAAe,KAAK,cAAc,EAAC,SAASA,QAAM,CAAC;AAC9E,YAAM,QAAQ,CAAC;AAEf,eAASJ,KAAI,KAAK,sBAAsB,IAAI,IAAIA,KAAI,GAAGA,KAAI,GAAGA,MAAK;AACjE,cAAM,KAAK,UAAU,OAAO,oBAAI,KAAK,WAAWA,EAAC,WAAW,CAAC,CAAC;AAAA,MAChE;AACA,aAAO;AAAA,IACT;AAAA,IAEA,gBAAgB,IAAI;AAClB,aAAO,OAAO,iBAAiB,EAAE,EAAE,iBAAiB,gBAAgB,MAAM;AAAA,IAC5E;AAAA,EAEF;;;AChoBA,MAAM,cAAc,YAAY,MAAM;AACtC,cAAY,SAAS,cAAc,UAAU;AAG7C,cAAY,QAAQ;AACpB,SAAO,WAAa;;;ACPpB,yBAAsB;AAEtB,MAAO,+BAAP,cAA6B,WAAW;AAAA,IACtC,OAAO,UAAU,CAAC,OAAO;AAAA,IAEzB,UAAU;AACR,WAAK,aAAa,QAAQ,CAAC,UAAU;AACnC,6BAAAK,SAAU;AAAA,UACR,MAAM;AAAA,UACN,aAAa;AAAA,UACb,iBAAiB;AAAA,QACnB,CAAC,EAAE,KAAK,KAAK;AAEb,cAAM,iBAAiB,UAAU,CAAC,UAAU;AAC1C,cAAG,MAAM,OAAO,UAAU,IAAI;AAC5B,kBAAM,OAAO,cAAc,cAAc,wCAAwC,EAAE,QAAQ;AAC3F;AAAA,UACF;AAEA,gBAAM,gBAAgB;AACtB,cAAI,cAAc,MAAM,OAAO;AAG/B,cAAI,CAAC,eAAe,CAAC,YAAY,UAAU,SAAS,aAAa,GAAG;AAClE,0BAAc,SAAS,cAAc,KAAK;AAC1C,wBAAY,UAAU,IAAI,aAAa;AACvC,kBAAM,OAAO,sBAAsB,YAAY,WAAW;AAAA,UAC5D;AAEA,cAAI,CAAC,KAAK,YAAY,MAAM,OAAO,KAAK,GAAG;AACzC,wBAAY,cAAc;AAC1B,wBAAY,MAAM,UAAU;AAC5B,kBAAM,OAAO,UAAU,IAAI,YAAY;AAIvC,kBAAM,OAAO,cAAc,cAAc,wCAAwC,EAAE,QAAQ;AAAA,UAE7F,OAAO;AACL,wBAAY,cAAc;AAC1B,wBAAY,MAAM,UAAU;AAC5B,kBAAM,OAAO,UAAU,OAAO,YAAY;AAC1C,kBAAM,OAAO,cAAc,cAAc,wCAAwC,EAAE,QAAQ,KAAK,YAAY,MAAM,OAAO,KAAK;AAAA,UAChI;AAAA,QACF,CAAC;AAAA,MACH,CAAC;AAAA,IACH;AAAA,IAEA,YAAY,YAAY;AACtB,YAAM,CAAC,KAAK,OAAO,IAAI,IAAI,WAAW,MAAM,GAAG,EAAE,IAAI,MAAM;AAC3D,YAAM,OAAO,IAAI,KAAK,MAAM,QAAQ,GAAG,GAAG;AAC1C,aACE,KAAK,YAAY,MAAM,QACvB,KAAK,SAAS,MAAM,QAAQ,KAC5B,KAAK,QAAQ,MAAM;AAAA,IAEvB;AAAA,IAEA,YAAY,YAAY;AACtB,YAAM,CAAC,KAAK,OAAO,IAAI,IAAI,WAAW,MAAM,GAAG,EAAE,IAAI,MAAM;AAC3D,aAAO,GAAG,IAAI,IAAI,KAAK,IAAI,GAAG;AAAA,IAChC;AAAA,EACF;;;AC7DA,MAAO,gCAAP,cAA6B,WAAW;AAAA,IACtC,OAAO,OAAO;AACZ,YAAM,SAAS,MAAM;AACrB,YAAM,SAAS,OAAO,QAAQ;AAC9B,YAAM,aAAa,OAAO,QAAQ;AAClC,YAAM,OAAO,OAAO,QAAQ;AAC5B,YAAM,SAAS,OAAO,QAAQ;AAC9B,YAAM,SAAS,OAAO;AACtB,YAAM,iBAAiB,OAAO,QAAQ;AAEtC,UAAI,WAAW,iBAAiB,eAAe,SAAS;AACtD,cAAM,6BAA6B;AACnC,eAAO,QAAQ;AACf;AAAA,MACF;AAEA,aAAO,aAAa,wBAAwB,MAAM;AAElD,YAAM,uBAAuB;AAAA,QAC3B,QAAQ;AAAA,QACR,SAAS;AAAA,UACP,gBAAgB;AAAA,UAChB,gBAAgB,SAAS,cAAc,qBAAqB,EAAE;AAAA,QAChE;AAAA,QACA,MAAM,KAAK,UAAU;AAAA,UACnB,SAAS;AAAA,UACT;AAAA,UACA;AAAA,UACA;AAAA,QACF,CAAC;AAAA,MACH,CAAC;AAAA,IACH;AAAA,EACF;;;AChCA,MAAO,qCAAP,cAA6B,WAAW;AAAA,IACtC,UAAU;AACR,WAAK,gBAAgB,SAAS,cAAc,8BAA8B,GAAG;AAAA,IAC/E;AAAA,IAEA,WAAW,OAAO;AAChB,YAAM,SAAS,MAAM,OAAO;AAC5B,YAAM,YAAY,MAAM,OAAO,QAAQ;AACvC,YAAM,aAAa,MAAM,OAAO,QAAQ;AAExC,UAAI,WAAW,iBAAiB,eAAe,SAAS;AACtD,cAAM,6BAA6B;AACnC,cAAM,OAAO,QAAQ;AACrB;AAAA,MACF;AAEA,YAAM,oBAAoB,SAAS;AAAA,QACjC,4CAA4C,KAAK,aAAa;AAAA,MAChE;AAEA,YAAM,uBAAuB;AAAA,QAC3B,QAAQ;AAAA,QACR,SAAS;AAAA,UACP,gBAAgB;AAAA,UAChB,gBAAgB,SAAS,cAAc,qBAAqB,EAAE;AAAA,QAChE;AAAA,QACA,MAAM,KAAK,UAAU;AAAA,UACnB,SAAS,KAAK;AAAA,UACd,YAAY;AAAA,UACZ;AAAA,QACF,CAAC;AAAA,MACH,CAAC,EAAE,KAAK,cAAY;AAClB,YAAI,SAAS,IAAI;AACf,4BAAkB,QAAQ,YAAU;AAClC,kBAAM,OAAO,IAAI,KAAK,OAAO,QAAQ,IAAI;AACzC,gBAAI,QAAQ,IAAI,KAAK,SAAS,KAAK,QAAQ,SAAS;AAClD,qBAAO,QAAQ;AACf,oBAAM,eAAe;AAAA,YACvB;AAAA,UACF,CAAC;AAED,gBAAM,OAAO,QAAQ;AAAA,QACvB;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;;;AC/CO,MAAM,gCAAgC;AAAA,IAC3C,oBAAoB;AAAA,EACtB;;;ACCA,MAAO,yCAAP,cAA6B,WAAW;AAAA,IACtC,UAAU;AACR,WAAK,gBAAgB,SAAS,cAAc,8BAA8B,GAAG;AAAA,IAC/E;AAAA,IAEA,cAAc,UAAU;AACtB,YAAM,eAAe,CAAC,QAAQ,QAAQ,QAAQ,QAAQ,SAAS,SAAS,SAAS,SAAS,SAAS,SAAS,SAAS,OAAO;AAC5H,YAAM,iBAAiB,CAAC,SAAS,SAAS,SAAS,SAAS,SAAS,SAAS,SAAS,SAAS,SAAS,SAAS,SAAS,OAAO;AAElI,aAAO,aAAa,SAAS,QAAQ,IAAI,YAClC,eAAe,SAAS,QAAQ,IAAI,cAAc;AAAA,IAC3D;AAAA,IAEA,kBAAkB,QAAQ;AACxB,aAAO,WAAW,YAChB,CAAC,QAAQ,QAAQ,QAAQ,QAAQ,SAAS,SAAS,SAAS,SAAS,SAAS,SAAS,SAAS,OAAO,IACvG,CAAC,SAAS,SAAS,SAAS,SAAS,SAAS,SAAS,SAAS,SAAS,SAAS,SAAS,SAAS,OAAO;AAAA,IAC/G;AAAA,IAEA,OAAO,OAAO;AACZ,YAAM,SAAS,MAAM;AACrB,YAAM,aAAa,OAAO,QAAQ;AAClC,YAAM,OAAO,OAAO,QAAQ;AAC5B,YAAM,WAAW,OAAO,QAAQ;AAChC,YAAM,SAAS,OAAO;AAEtB,YAAM,yCAAyC;AAAA,QAC7C,QAAQ;AAAA,QACR,SAAS;AAAA,UACP,gBAAgB;AAAA,UAChB,gBAAgB,SAAS,cAAc,qBAAqB,EAAE;AAAA,QAChE;AAAA,QACA,MAAM,KAAK,UAAU;AAAA,UACnB,aAAa;AAAA,UACb;AAAA,UACA,WAAW;AAAA,UACX,SAAS;AAAA,QACX,CAAC;AAAA,MACH,CAAC,EAAE,KAAK,cAAY;AAClB,YAAI,CAAC,SAAS,IAAI;AAChB,iBAAO,QAAQ;AACf,gBAAM,gDAAgD;AACtD;AAAA,QACF;AAEA,YAAI,KAAK,kBAAkB,QAAQ;AACjC,iBAAO,QAAQ,OAAO;AACtB,gBAAM,SAAS,KAAK,cAAc,QAAQ;AAE1C,cAAI,UAAU,KAAK,uBAAuB,YAAY,MAAM,QAAQ,MAAM,GAAG;AAC3E,gBAAI,CAAC,8BAA8B,oBAAoB;AACrD,kBAAI,QAAQ,6BAA6B,GAAG;AAC1C,qBAAK,oBAAoB,YAAY,MAAM,QAAQ,MAAM;AAAA,cAC3D;AACA,4CAA8B,qBAAqB;AAAA,YACrD;AAAA,UACF;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACH;AAAA,IAEA,uBAAuB,YAAY,MAAM,QAAQ,QAAQ;AACvD,YAAM,QAAQ,KAAK,kBAAkB,MAAM;AAC3C,YAAM,UAAU,MAAM;AAAA,QAAI,UACxB,SAAS,cAAc,yBAAyB,UAAU,iBAAiB,IAAI,sBAAsB,IAAI,IAAI;AAAA,MAC/G;AAEA,aAAO,QAAQ;AAAA,QAAM,YACnB,CAAC,OAAO,SAAS,OAAO,UAAU;AAAA,MACpC;AAAA,IACF;AAAA,IAEA,oBAAoB,YAAY,MAAM,QAAQ,QAAQ;AACpD,YAAM,QAAQ,KAAK,kBAAkB,MAAM;AAC3C,YAAM,UAAU,MAAM;AAAA,QAAI,UACxB,SAAS,cAAc,yBAAyB,UAAU,iBAAiB,IAAI,sBAAsB,IAAI,IAAI;AAAA,MAC/G;AAEA,cAAQ,QAAQ,YAAU;AACxB,YAAI,UAAU,OAAO,UAAU,QAAQ;AACrC,iBAAO,QAAQ;AACf,iBAAO,QAAQ,OAAO;AAEtB,gBAAM,yCAAyC;AAAA,YAC7C,QAAQ;AAAA,YACR,SAAS;AAAA,cACP,gBAAgB;AAAA,cAChB,gBAAgB,SAAS,cAAc,qBAAqB,EAAE;AAAA,YAChE;AAAA,YACA,MAAM,KAAK,UAAU;AAAA,cACnB,aAAa;AAAA,cACb;AAAA,cACA,WAAW,OAAO,QAAQ;AAAA,cAC1B,SAAS;AAAA,YACX,CAAC;AAAA,UACH,CAAC;AAAA,QACH;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;;;ACnGA,MAAO,8BAAP,cAA6B,WAAW;AAAA,IACtC,SAAS;AACP,WAAK,QAAQ,OAAO;AAAA,IACtB;AAAA,EACF;;;ACLA,MAAO,+BAAP,cAA6B,WAAW;AAAA,IACtC,OAAO,UAAU,CAAC,YAAY,WAAW;AAAA,IAEzC,UAAU;AACR,WAAK,gBAAgB,CAAC;AACtB,WAAK,YAAY;AAAA,IACnB;AAAA,IAEA,YAAY,OAAO;AACjB,UAAI,OAAO;AACT,cAAM,WAAW,MAAM;AACvB,cAAM,WAAW,SAAS;AAE1B,YAAI,SAAS,SAAS;AACpB,eAAK,cAAc,KAAK,QAAQ;AAAA,QAClC,OAAO;AACL,eAAK,gBAAgB,KAAK,cAAc,OAAO,OAAK,MAAM,QAAQ;AAAA,QACpE;AAEA,aAAK,cAAc,QAAQ,CAACC,WAAUC,WAAU;AAC9C,gBAAMC,YAAW,KAAK,gBAAgB,KAAK,QAAM,GAAG,UAAUF,SAAQ;AACtE,cAAIE,WAAU;AACZ,YAAAA,UAAS,OAAO,0BAA0BD,MAAK;AAAA,UACjD;AAAA,QACF,CAAC;AAAA,MACH;AAEA,UAAI,KAAK,cAAc,WAAW,GAAG;AACnC,aAAK,gBAAgB,YAAY;AACjC;AAAA,MACF;AAEA,YAAM,YAAY,KAAK,cACpB,IAAI,CAAC,UAAUA,WAAU;AAAA;AAAA,qDAEqBA,SAAQ,CAAC;AAAA,kBAC5C,QAAQ;AAAA;AAAA,OAEnB,EACA,KAAK,EAAE;AAEV,WAAK,gBAAgB,YAAY;AAAA,IACnC;AAAA,EACF;;;AC3CA,MAAO,qCAAP,cAA6B,WAAW;AAAA,IACtC,MAAM,qBAAqB,OAAO;AAChC,YAAM,eAAe;AAErB,YAAM,UAAU,MAAM,OAAO,QAAQ,gBAAgB;AACrD,UAAI,CAAC,SAAS;AACZ;AAAA,MACF;AAEA,YAAM,SAAS,QAAQ,QAAQ;AAE/B,UAAI;AACF,cAAM,WAAW,MAAM,MAAM,iCAAiC;AAAA,UAC5D,SAAS;AAAA,YACP,oBAAoB;AAAA,UACtB;AAAA,QACF,CAAC;AAED,cAAM,OAAO,MAAM,SAAS,KAAK;AAGjC,YAAI,KAAK,cAAc,GAAG;AAExB,gBAAM,MAAM,UAAU,MAAM;AAG5B,gBAAM,QAAQ,SAAS,eAAe,YAAY;AAClD,cAAI,OAAO;AACT,kBAAM,MAAM,KAAK,EAAE,OAAO,aAAa,CAAC;AAAA,UAC1C;AAAA,QACF,OAAO;AAEL,gBAAM,MAAM,UAAU,MAAM;AAE5B,gBAAME,YAAW,MAAM,MAAM,KAAK;AAAA,YAChC,QAAQ;AAAA,YACR,SAAS;AAAA,cACP,gBAAgB,SAAS,cAAc,qBAAqB,EAAE;AAAA,cAC9D,oBAAoB;AAAA,cACpB,UAAU;AAAA,YACZ;AAAA,UACF,CAAC;AAED,cAAIA,UAAS,IAAI;AACf,kBAAM,OAAO,MAAMA,UAAS,KAAK;AACjC,kBAAM,oBAAoB,IAAI;AAAA,UAChC;AAAA,QACF;AAAA,MACF,SAASC,QAAO;AAEd,cAAM,MAAM,UAAU,MAAM;AAC5B,cAAM,QAAQ,SAAS,eAAe,YAAY;AAClD,YAAI,OAAO;AACT,gBAAM,MAAM,KAAK,EAAE,OAAO,aAAa,CAAC;AAAA,QAC1C;AAAA,MACF;AAAA,IACF;AAAA,EACF;;;ACzDA,MAAO,2CAAP,cAA6B,WAAW;AAAA,IACtC,OAAO,UAAU,CAAC,YAAY,aAAa,eAAe,iBAAiB,cAAc;AAAA,IAEzF,UAAU;AACR,WAAK,qBAAqB;AAC1B,WAAK,wBAAwB;AAC7B,WAAK,2BAA2B;AAAA,IAClC;AAAA;AAAA,IAGA,6BAA6B;AAC3B,YAAM,gBAAgB,KAAK,oBAAoB,SAAS,IACpD,KAAK,sBACL,KAAK,QAAQ,iBAAiB,mBAAmB;AAErD,oBAAc,QAAQ,YAAU;AAC9B,UAAE,MAAM,EAAE,GAAG,kBAAkB,CAAC,UAAU;AACxC,eAAK,mBAAmB,KAAK;AAAA,QAC/B,CAAC;AAAA,MACH,CAAC;AAAA,IACH;AAAA;AAAA,IAGA,mBAAmB,OAAO;AACxB,YAAM,iBAAiB,MAAM,OAAO;AACpC,YAAM,oBAAoB,KAAK,QAAQ,iBAAiB,4BAA4B;AAEpF,UAAI,kBAAkB,SAAS,GAAG;AAEhC,0BAAkB,QAAQ,cAAY;AACpC,gBAAM,eAAe,SAAS,QAAQ,IAAI,EAAE,cAAc,mBAAmB;AAC7E,cAAI,gBAAgB,iBAAiB,MAAM,QAAQ;AACjD,yBAAa,QAAQ;AAErB,gBAAI,aAAa,SAAS;AACxB,2BAAa,QAAQ,OAAO,cAAc;AAAA,YAC5C;AAEA,yBAAa,cAAc,IAAI,MAAM,UAAU,EAAE,SAAS,KAAK,CAAC,CAAC;AAAA,UACnE;AAAA,QACF,CAAC;AAGD,0BAAkB,QAAQ,cAAY;AACpC,mBAAS,UAAU;AAAA,QACrB,CAAC;AAGD,aAAK,qBAAqB;AAC1B,aAAK,wBAAwB;AAC7B,aAAK,4BAA4B;AAAA,MACnC;AAAA,IACF;AAAA;AAAA,IAGA,kBAAkB;AAChB,YAAM,YAAY,KAAK,gBAAgB;AAEvC,YAAM,aAAa,KAAK,gBAAgB,SAAS,IAC7C,KAAK,kBACL,KAAK,QAAQ,iBAAiB,oBAAoB;AAEtD,iBAAW,QAAQ,cAAY;AAC7B,iBAAS,UAAU;AAAA,MACrB,CAAC;AAGD,YAAM,0BAA0B,KAAK,qBAAqB,SAAS,IAC/D,KAAK,uBACL,KAAK,QAAQ,iBAAiB,2BAA2B;AAE7D,8BAAwB,QAAQ,cAAY;AAC1C,iBAAS,UAAU;AACnB,iBAAS,gBAAgB;AAAA,MAC3B,CAAC;AAGD,UAAI,WAAW;AACb,aAAK,uBAAuB;AAAA,MAC9B,OAAO;AACL,aAAK,4BAA4B;AAAA,MACnC;AAAA,IACF;AAAA;AAAA,IAGA,oBAAoB,OAAO;AACzB,YAAM,SAAS,MAAM,OAAO,QAAQ;AACpC,YAAM,YAAY,MAAM,OAAO;AAG/B,YAAM,YAAY,MAAM,OAAO,QAAQ,OAAO;AAC9C,UAAI,CAAC,UAAW;AAGhB,YAAM,iBAAiB,UAAU,iBAAiB,oBAAoB;AAEtE,qBAAe,QAAQ,cAAY;AACjC,iBAAS,UAAU;AAAA,MACrB,CAAC;AAGD,WAAK,yBAAyB,SAAS;AAGvC,UAAI,WAAW;AACb,aAAK,uBAAuB;AAAA,MAC9B,OAAO;AACL,aAAK,4BAA4B;AAAA,MACnC;AAAA,IACF;AAAA;AAAA,IAGA,iBAAiB,OAAO;AAEtB,YAAM,YAAY,MAAM,OAAO,QAAQ,OAAO;AAC9C,UAAI,CAAC,UAAW;AAEhB,WAAK,yBAAyB,SAAS;AACvC,WAAK,qBAAqB;AAC1B,WAAK,4BAA4B;AAAA,IACnC;AAAA;AAAA,IAGA,yBAAyB,WAAW;AAClC,YAAM,iBAAiB,UAAU,iBAAiB,oBAAoB;AACtE,YAAM,wBAAwB,UAAU,cAAc,2BAA2B;AAEjF,UAAI,CAAC,yBAAyB,eAAe,WAAW,EAAG;AAE3D,YAAM,kBAAkB,eAAe;AACvC,YAAM,oBAAoB,MAAM,KAAK,cAAc,EAAE,OAAO,cAAY,SAAS,OAAO,EAAE;AAE1F,UAAI,sBAAsB,GAAG;AAC3B,8BAAsB,UAAU;AAChC,8BAAsB,gBAAgB;AAAA,MACxC,WAAW,sBAAsB,iBAAiB;AAChD,8BAAsB,UAAU;AAChC,8BAAsB,gBAAgB;AAAA,MACxC,OAAO;AACL,8BAAsB,UAAU;AAChC,8BAAsB,gBAAgB;AAAA,MACxC;AAAA,IACF;AAAA;AAAA,IAGA,uBAAuB;AACrB,YAAM,aAAa,KAAK,gBAAgB,SAAS,IAC7C,KAAK,kBACL,KAAK,QAAQ,iBAAiB,oBAAoB;AAEtD,YAAM,kBAAkB,WAAW;AACnC,YAAM,oBAAoB,MAAM,KAAK,UAAU,EAAE,OAAO,cAAY,SAAS,OAAO,EAAE;AAEtF,UAAI,sBAAsB,GAAG;AAC3B,aAAK,gBAAgB,UAAU;AAC/B,aAAK,gBAAgB,gBAAgB;AAAA,MACvC,WAAW,sBAAsB,iBAAiB;AAChD,aAAK,gBAAgB,UAAU;AAC/B,aAAK,gBAAgB,gBAAgB;AAAA,MACvC,OAAO;AACL,aAAK,gBAAgB,UAAU;AAC/B,aAAK,gBAAgB,gBAAgB;AAAA,MACvC;AAAA,IACF;AAAA;AAAA,IAGA,0BAA0B;AACxB,YAAM,0BAA0B,KAAK,qBAAqB,SAAS,IAC/D,KAAK,uBACL,KAAK,QAAQ,iBAAiB,2BAA2B;AAE7D,8BAAwB,QAAQ,cAAY;AAC1C,cAAM,YAAY,SAAS,QAAQ,OAAO;AAC1C,YAAI,WAAW;AACb,eAAK,yBAAyB,SAAS;AAAA,QACzC;AAAA,MACF,CAAC;AAAA,IACH;AAAA;AAAA,IAGA,8BAA8B;AAC5B,YAAM,aAAa,KAAK,gBAAgB,SAAS,IAC7C,KAAK,kBACL,KAAK,QAAQ,iBAAiB,oBAAoB;AAEtD,YAAM,kBAAkB,MAAM,KAAK,UAAU,EAAE,KAAK,cAAY,SAAS,OAAO;AAChF,WAAK,kBAAkB,MAAM,UAAU,kBAAkB,UAAU;AAGnE,WAAK,yBAAyB;AAAA,IAChC;AAAA;AAAA,IAGA,yBAAyB;AACvB,YAAM,gBAAgB,KAAK,oBAAoB,SAAS,IACpD,KAAK,sBACL,KAAK,QAAQ,iBAAiB,mBAAmB;AAErD,oBAAc,QAAQ,YAAU;AAC9B,eAAO,WAAW;AAClB,eAAO,MAAM,UAAU;AAEvB,YAAI,OAAO,SAAS;AAClB,iBAAO,QAAQ,UAAU,IAAI;AAAA,QAC/B;AAAA,MACF,CAAC;AAAA,IACH;AAAA;AAAA,IAGA,2BAA2B;AACzB,YAAM,gBAAgB,KAAK,oBAAoB,SAAS,IACpD,KAAK,sBACL,KAAK,QAAQ,iBAAiB,mBAAmB;AAErD,YAAM,oBAAoB,KAAK,QAAQ,iBAAiB,4BAA4B;AAEpF,UAAI,kBAAkB,WAAW,GAAG;AAElC,aAAK,uBAAuB;AAAA,MAC9B,OAAO;AAEL,cAAM,sBAAsB,MAAM,KAAK,iBAAiB,EAAE,IAAI;AAC9D,cAAM,iBAAiB,oBAAoB,QAAQ,IAAI;AACvD,cAAM,0BAA0B,eAAe,cAAc,mBAAmB;AAEhF,sBAAc,QAAQ,YAAU;AAC9B,gBAAMC,OAAM,OAAO,QAAQ,IAAI;AAC/B,gBAAM,WAAWA,KAAI,cAAc,oBAAoB;AAEvD,cAAI,YAAY,SAAS,WAAW,WAAW,yBAAyB;AACtE,mBAAO,WAAW;AAClB,mBAAO,MAAM,UAAU;AAEvB,gBAAI,OAAO,SAAS;AAClB,qBAAO,QAAQ,UAAU,IAAI;AAAA,YAC/B;AAAA,UACF,OAAO;AACL,mBAAO,WAAW;AAClB,mBAAO,MAAM,UAAU;AAEvB,gBAAI,OAAO,SAAS;AAClB,qBAAO,QAAQ,UAAU,KAAK;AAAA,YAChC;AAAA,UACF;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAAA;AAAA,IAGA,mBAAmB;AACjB,YAAM,qBAAqB,KAAK,kBAAkB,cAAc,QAAQ;AACxE,YAAM,iBAAiB,mBAAmB;AAC1C,UAAI,CAAC,eAAgB;AAErB,YAAM,oBAAoB,KAAK,QAAQ,iBAAiB,4BAA4B;AAEpF,wBAAkB,QAAQ,cAAY;AACpC,cAAM,eAAe,SAAS,QAAQ,IAAI,EAAE,cAAc,mBAAmB;AAC7E,YAAI,cAAc;AAChB,uBAAa,QAAQ;AAErB,cAAI,aAAa,SAAS;AACxB,yBAAa,QAAQ,OAAO,cAAc;AAAA,UAC5C;AAEA,uBAAa,cAAc,IAAI,MAAM,UAAU,EAAE,SAAS,KAAK,CAAC,CAAC;AAAA,QACnE;AAAA,MACF,CAAC;AAGD,wBAAkB,QAAQ,cAAY;AACpC,iBAAS,UAAU;AAAA,MACrB,CAAC;AAGD,yBAAmB,QAAQ;AAG3B,WAAK,qBAAqB;AAC1B,WAAK,wBAAwB;AAC7B,WAAK,4BAA4B;AAAA,IACnC;AAAA,EACF;;;AC1RA,MAAO,yCAAP,cAA6B,WAAW;AAAA,IACtC,UAAU;AACR,WAAK,WAAW;AAChB,WAAK,oCAAoC;AAAA,IAC3C;AAAA,IAEA,aAAa;AACX,YAAM,gBAAgB,SAAS,eAAe,kDAAkD;AAChG,YAAM,YAAY,SAAS,eAAe,oCAAoC;AAE9E,YAAM,UAAU,CAACC,OAAM;AACrB,cAAM,gBAAgBA,IAAG,QAAQ,MAAM,MAAMA,IAAG,QAAQ;AACxD,YAAI,CAAC,cAAe;AACpB,aAAK,gCAAgC,aAAa;AAAA,MACpD;AAEA,UAAI,OAAO,GAAG;AACZ,YAAI,eAAe;AACjB,iBAAO,EAAE,aAAa,EAAE,GAAG,UAAU,OAAO;AAAA,QAC9C;AACA,YAAI,WAAW;AACb,iBAAO,EAAE,SAAS,EAAE,GAAG,UAAU,OAAO;AAAA,QAC1C;AAAA,MACF,OAAO;AACL,YAAI,cAAe,eAAc,iBAAiB,UAAU,OAAO;AACnE,YAAI,UAAW,WAAU,iBAAiB,UAAU,OAAO;AAAA,MAC7D;AAAA,IACF;AAAA,IAEA,gCAAgC,eAAe;AAC7C,YAAM,iBAAiB,aAAa,kBAAkB,EACnD,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,IAAI,QAAQ,OAAO,CAAC,EAC9C,KAAK,CAAC,SAAS;AACd,cAAM,QAAQ,MAAM;AACpB,YAAI,UAAU,mCAAmC;AAC/C,eAAK,sCAAsC;AAAA,QAC7C;AAGA,cAAM,YAAY,MAAM;AACxB,YAAI,WAAW;AACb,eAAK,+BAA+B,SAAS;AAAA,QAC/C;AAAA,MACF,CAAC,EACA,MAAM,MAAM;AAAA,MAAC,CAAC;AAAA,IACnB;AAAA,IAEA,sCAAsC;AACpC,YAAM,QAAQ,SAAS,eAAe,gDAAgD;AACtF,UAAI,CAAC,SAAS,CAAC,MAAM,SAAU;AAE/B,YAAM,YAAY,MAAM,QAAQ,+BAA+B,KAAK,MAAM;AAC1E,UAAI,CAAC,UAAW;AAGhB,UAAI,iBAAiB,SAAS,EAAE,aAAa,UAAU;AACrD,kBAAU,MAAM,WAAW;AAAA,MAC7B;AAGA,UAAI,UAAU,cAAc,yBAAyB,EAAG;AAExD,YAAM,UAAU,SAAS,cAAc,KAAK;AAC5C,cAAQ,YAAY;AACpB,cAAQ,MAAM,WAAW;AACzB,cAAQ,MAAM,MAAM;AACpB,cAAQ,MAAM,OAAO;AACrB,cAAQ,MAAM,QAAQ;AACtB,cAAQ,MAAM,SAAS;AACvB,cAAQ,MAAM,SAAS;AACvB,cAAQ,MAAM,aAAa;AAC3B,cAAQ,MAAM,SAAS;AAEvB,cAAQ,iBAAiB,SAAS,CAACA,OAAM;AACvC,QAAAA,GAAE,eAAe;AACjB,QAAAA,GAAE,gBAAgB;AAClB,eAAO,MAAM,2DAA2D;AAAA,MAC1E,CAAC;AAED,gBAAU,YAAY,OAAO;AAAA,IAC/B;AAAA,IAEA,wCAAwC;AACtC,YAAM,QAAQ,SAAS,eAAe,2CAA2C;AACjF,UAAI,CAAC,MAAO;AAEZ,YAAM,QAAQ,oBAAI,KAAK;AACvB,YAAM,QAAQ,IAAI,KAAK,MAAM,YAAY,GAAG,MAAM,SAAS,GAAG,CAAC;AAC/D,YAAM,KAAK,OAAO,MAAM,QAAQ,CAAC,EAAE,SAAS,GAAG,GAAG;AAClD,YAAM,KAAK,OAAO,MAAM,SAAS,IAAI,CAAC,EAAE,SAAS,GAAG,GAAG;AACvD,YAAM,OAAO,MAAM,YAAY;AAC/B,YAAM,YAAY,GAAG,EAAE,IAAI,EAAE,IAAI,IAAI;AAErC,YAAM,QAAQ;AACd,YAAM,QAAQ,IAAI,MAAM,UAAU,EAAE,SAAS,KAAK,CAAC;AACnD,YAAM,cAAc,KAAK;AAAA,IAC3B;AAAA,IAEA,+BAA+B,WAAW;AACxC,YAAM,gBAAgB,SAAS,cAAc,sBAAsB;AACnE,YAAM,eAAe,SAAS,cAAc,qBAAqB;AAEjE,UAAI,eAAe;AACjB,YAAI,OAAO,KAAK,OAAO,EAAE,aAAa,EAAE,SAAS,2BAA2B,GAAG;AAC7E,iBAAO,EAAE,aAAa,EAAE,IAAI,SAAS,EAAE,QAAQ,QAAQ;AAAA,QACzD,OAAO;AACL,wBAAc,QAAQ;AACtB,gBAAM,gBAAgB,IAAI,MAAM,UAAU,EAAE,SAAS,KAAK,CAAC;AAC3D,wBAAc,cAAc,aAAa;AAAA,QAC3C;AAAA,MACF;AAEA,UAAI,cAAc;AAChB,YAAI,OAAO,KAAK,OAAO,EAAE,YAAY,EAAE,SAAS,2BAA2B,GAAG;AAC5E,iBAAO,EAAE,YAAY,EAAE,IAAI,SAAS,EAAE,QAAQ,QAAQ;AAAA,QACxD,OAAO;AACL,uBAAa,QAAQ;AACrB,gBAAM,eAAe,IAAI,MAAM,UAAU,EAAE,SAAS,KAAK,CAAC;AAC1D,uBAAa,cAAc,YAAY;AAAA,QACzC;AAAA,MACF;AAAA,IACF;AAAA,EACF;;;ACtHA,WAAS,QAAQ,QAAQ,gBAAgB;AACvC,QAAI,OAAO,OAAO,KAAK,MAAM;AAC7B,QAAI,OAAO,uBAAuB;AAChC,UAAI,UAAU,OAAO,sBAAsB,MAAM;AACjD,UAAI,gBAAgB;AAClB,kBAAU,QAAQ,OAAO,SAAU,KAAK;AACtC,iBAAO,OAAO,yBAAyB,QAAQ,GAAG,EAAE;AAAA,QACtD,CAAC;AAAA,MACH;AACA,WAAK,KAAK,MAAM,MAAM,OAAO;AAAA,IAC/B;AACA,WAAO;AAAA,EACT;AACA,WAAS,eAAe,QAAQ;AAC9B,aAASC,KAAI,GAAGA,KAAI,UAAU,QAAQA,MAAK;AACzC,UAAI,SAAS,UAAUA,EAAC,KAAK,OAAO,UAAUA,EAAC,IAAI,CAAC;AACpD,UAAIA,KAAI,GAAG;AACT,gBAAQ,OAAO,MAAM,GAAG,IAAI,EAAE,QAAQ,SAAU,KAAK;AACnD,0BAAgB,QAAQ,KAAK,OAAO,GAAG,CAAC;AAAA,QAC1C,CAAC;AAAA,MACH,WAAW,OAAO,2BAA2B;AAC3C,eAAO,iBAAiB,QAAQ,OAAO,0BAA0B,MAAM,CAAC;AAAA,MAC1E,OAAO;AACL,gBAAQ,OAAO,MAAM,CAAC,EAAE,QAAQ,SAAU,KAAK;AAC7C,iBAAO,eAAe,QAAQ,KAAK,OAAO,yBAAyB,QAAQ,GAAG,CAAC;AAAA,QACjF,CAAC;AAAA,MACH;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,WAAS,QAAQ,KAAK;AACpB;AAEA,QAAI,OAAO,WAAW,cAAc,OAAO,OAAO,aAAa,UAAU;AACvE,gBAAU,SAAUC,MAAK;AACvB,eAAO,OAAOA;AAAA,MAChB;AAAA,IACF,OAAO;AACL,gBAAU,SAAUA,MAAK;AACvB,eAAOA,QAAO,OAAO,WAAW,cAAcA,KAAI,gBAAgB,UAAUA,SAAQ,OAAO,YAAY,WAAW,OAAOA;AAAA,MAC3H;AAAA,IACF;AACA,WAAO,QAAQ,GAAG;AAAA,EACpB;AACA,WAAS,gBAAgB,KAAK,KAAK,OAAO;AACxC,QAAI,OAAO,KAAK;AACd,aAAO,eAAe,KAAK,KAAK;AAAA,QAC9B;AAAA,QACA,YAAY;AAAA,QACZ,cAAc;AAAA,QACd,UAAU;AAAA,MACZ,CAAC;AAAA,IACH,OAAO;AACL,UAAI,GAAG,IAAI;AAAA,IACb;AACA,WAAO;AAAA,EACT;AACA,WAAS,WAAW;AAClB,eAAW,OAAO,UAAU,SAAU,QAAQ;AAC5C,eAASD,KAAI,GAAGA,KAAI,UAAU,QAAQA,MAAK;AACzC,YAAI,SAAS,UAAUA,EAAC;AACxB,iBAAS,OAAO,QAAQ;AACtB,cAAI,OAAO,UAAU,eAAe,KAAK,QAAQ,GAAG,GAAG;AACrD,mBAAO,GAAG,IAAI,OAAO,GAAG;AAAA,UAC1B;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT;AACA,WAAO,SAAS,MAAM,MAAM,SAAS;AAAA,EACvC;AACA,WAAS,8BAA8B,QAAQ,UAAU;AACvD,QAAI,UAAU,KAAM,QAAO,CAAC;AAC5B,QAAI,SAAS,CAAC;AACd,QAAI,aAAa,OAAO,KAAK,MAAM;AACnC,QAAI,KAAKA;AACT,SAAKA,KAAI,GAAGA,KAAI,WAAW,QAAQA,MAAK;AACtC,YAAM,WAAWA,EAAC;AAClB,UAAI,SAAS,QAAQ,GAAG,KAAK,EAAG;AAChC,aAAO,GAAG,IAAI,OAAO,GAAG;AAAA,IAC1B;AACA,WAAO;AAAA,EACT;AACA,WAAS,yBAAyB,QAAQ,UAAU;AAClD,QAAI,UAAU,KAAM,QAAO,CAAC;AAC5B,QAAI,SAAS,8BAA8B,QAAQ,QAAQ;AAC3D,QAAI,KAAKA;AACT,QAAI,OAAO,uBAAuB;AAChC,UAAI,mBAAmB,OAAO,sBAAsB,MAAM;AAC1D,WAAKA,KAAI,GAAGA,KAAI,iBAAiB,QAAQA,MAAK;AAC5C,cAAM,iBAAiBA,EAAC;AACxB,YAAI,SAAS,QAAQ,GAAG,KAAK,EAAG;AAChC,YAAI,CAAC,OAAO,UAAU,qBAAqB,KAAK,QAAQ,GAAG,EAAG;AAC9D,eAAO,GAAG,IAAI,OAAO,GAAG;AAAA,MAC1B;AAAA,IACF;AACA,WAAO;AAAA,EACT;AA2BA,MAAI,UAAU;AAEd,WAAS,UAAU,SAAS;AAC1B,QAAI,OAAO,WAAW,eAAe,OAAO,WAAW;AACrD,aAAO,CAAC,CAAe,0BAAU,UAAU,MAAM,OAAO;AAAA,IAC1D;AAAA,EACF;AACA,MAAI,aAAa,UAAU,uDAAuD;AAClF,MAAI,OAAO,UAAU,OAAO;AAC5B,MAAI,UAAU,UAAU,UAAU;AAClC,MAAI,SAAS,UAAU,SAAS,KAAK,CAAC,UAAU,SAAS,KAAK,CAAC,UAAU,UAAU;AACnF,MAAI,MAAM,UAAU,iBAAiB;AACrC,MAAI,mBAAmB,UAAU,SAAS,KAAK,UAAU,UAAU;AAEnE,MAAI,cAAc;AAAA,IAChB,SAAS;AAAA,IACT,SAAS;AAAA,EACX;AACA,WAAS,GAAG,IAAI,OAAO,IAAI;AACzB,OAAG,iBAAiB,OAAO,IAAI,CAAC,cAAc,WAAW;AAAA,EAC3D;AACA,WAAS,IAAI,IAAI,OAAO,IAAI;AAC1B,OAAG,oBAAoB,OAAO,IAAI,CAAC,cAAc,WAAW;AAAA,EAC9D;AACA,WAAS,QAAyB,IAAe,UAAU;AACzD,QAAI,CAAC,SAAU;AACf,aAAS,CAAC,MAAM,QAAQ,WAAW,SAAS,UAAU,CAAC;AACvD,QAAI,IAAI;AACN,UAAI;AACF,YAAI,GAAG,SAAS;AACd,iBAAO,GAAG,QAAQ,QAAQ;AAAA,QAC5B,WAAW,GAAG,mBAAmB;AAC/B,iBAAO,GAAG,kBAAkB,QAAQ;AAAA,QACtC,WAAW,GAAG,uBAAuB;AACnC,iBAAO,GAAG,sBAAsB,QAAQ;AAAA,QAC1C;AAAA,MACF,SAAS,GAAG;AACV,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,WAAS,gBAAgB,IAAI;AAC3B,WAAO,GAAG,QAAQ,OAAO,YAAY,GAAG,KAAK,WAAW,GAAG,OAAO,GAAG;AAAA,EACvE;AACA,WAAS,QAAyB,IAAe,UAA0B,KAAK,YAAY;AAC1F,QAAI,IAAI;AACN,YAAM,OAAO;AACb,SAAG;AACD,YAAI,YAAY,SAAS,SAAS,CAAC,MAAM,MAAM,GAAG,eAAe,OAAO,QAAQ,IAAI,QAAQ,IAAI,QAAQ,IAAI,QAAQ,MAAM,cAAc,OAAO,KAAK;AAClJ,iBAAO;AAAA,QACT;AACA,YAAI,OAAO,IAAK;AAAA,MAElB,SAAS,KAAK,gBAAgB,EAAE;AAAA,IAClC;AACA,WAAO;AAAA,EACT;AACA,MAAI,UAAU;AACd,WAAS,YAAY,IAAIE,SAAM,OAAO;AACpC,QAAI,MAAMA,SAAM;AACd,UAAI,GAAG,WAAW;AAChB,WAAG,UAAU,QAAQ,QAAQ,QAAQ,EAAEA,OAAI;AAAA,MAC7C,OAAO;AACL,YAAI,aAAa,MAAM,GAAG,YAAY,KAAK,QAAQ,SAAS,GAAG,EAAE,QAAQ,MAAMA,UAAO,KAAK,GAAG;AAC9F,WAAG,aAAa,aAAa,QAAQ,MAAMA,UAAO,KAAK,QAAQ,SAAS,GAAG;AAAA,MAC7E;AAAA,IACF;AAAA,EACF;AACA,WAAS,IAAI,IAAI,MAAM,KAAK;AAC1B,QAAI,QAAQ,MAAM,GAAG;AACrB,QAAI,OAAO;AACT,UAAI,QAAQ,QAAQ;AAClB,YAAI,SAAS,eAAe,SAAS,YAAY,kBAAkB;AACjE,gBAAM,SAAS,YAAY,iBAAiB,IAAI,EAAE;AAAA,QACpD,WAAW,GAAG,cAAc;AAC1B,gBAAM,GAAG;AAAA,QACX;AACA,eAAO,SAAS,SAAS,MAAM,IAAI,IAAI;AAAA,MACzC,OAAO;AACL,YAAI,EAAE,QAAQ,UAAU,KAAK,QAAQ,QAAQ,MAAM,IAAI;AACrD,iBAAO,aAAa;AAAA,QACtB;AACA,cAAM,IAAI,IAAI,OAAO,OAAO,QAAQ,WAAW,KAAK;AAAA,MACtD;AAAA,IACF;AAAA,EACF;AACA,WAAS,OAAO,IAAI,UAAU;AAC5B,QAAI,oBAAoB;AACxB,QAAI,OAAO,OAAO,UAAU;AAC1B,0BAAoB;AAAA,IACtB,OAAO;AACL,SAAG;AACD,YAAI,YAAY,IAAI,IAAI,WAAW;AACnC,YAAI,aAAa,cAAc,QAAQ;AACrC,8BAAoB,YAAY,MAAM;AAAA,QACxC;AAAA,MAEF,SAAS,CAAC,aAAa,KAAK,GAAG;AAAA,IACjC;AACA,QAAI,WAAW,OAAO,aAAa,OAAO,mBAAmB,OAAO,aAAa,OAAO;AAExF,WAAO,YAAY,IAAI,SAAS,iBAAiB;AAAA,EACnD;AACA,WAAS,KAAK,KAAK,SAAS,UAAU;AACpC,QAAI,KAAK;AACP,UAAI,OAAO,IAAI,qBAAqB,OAAO,GACzCC,KAAI,GACJ,IAAI,KAAK;AACX,UAAI,UAAU;AACZ,eAAOA,KAAI,GAAGA,MAAK;AACjB,mBAAS,KAAKA,EAAC,GAAGA,EAAC;AAAA,QACrB;AAAA,MACF;AACA,aAAO;AAAA,IACT;AACA,WAAO,CAAC;AAAA,EACV;AACA,WAAS,4BAA4B;AACnC,QAAI,mBAAmB,SAAS;AAChC,QAAI,kBAAkB;AACpB,aAAO;AAAA,IACT,OAAO;AACL,aAAO,SAAS;AAAA,IAClB;AAAA,EACF;AAWA,WAAS,QAAQ,IAAI,2BAA2B,2BAA2B,WAAW,WAAW;AAC/F,QAAI,CAAC,GAAG,yBAAyB,OAAO,OAAQ;AAChD,QAAI,QAAQ,KAAK,MAAM,QAAQ,OAAO,QAAQ;AAC9C,QAAI,OAAO,UAAU,GAAG,cAAc,OAAO,0BAA0B,GAAG;AACxE,eAAS,GAAG,sBAAsB;AAClC,YAAM,OAAO;AACb,aAAO,OAAO;AACd,eAAS,OAAO;AAChB,cAAQ,OAAO;AACf,eAAS,OAAO;AAChB,cAAQ,OAAO;AAAA,IACjB,OAAO;AACL,YAAM;AACN,aAAO;AACP,eAAS,OAAO;AAChB,cAAQ,OAAO;AACf,eAAS,OAAO;AAChB,cAAQ,OAAO;AAAA,IACjB;AACA,SAAK,6BAA6B,8BAA8B,OAAO,QAAQ;AAE7E,kBAAY,aAAa,GAAG;AAI5B,UAAI,CAAC,YAAY;AACf,WAAG;AACD,cAAI,aAAa,UAAU,0BAA0B,IAAI,WAAW,WAAW,MAAM,UAAU,6BAA6B,IAAI,WAAW,UAAU,MAAM,WAAW;AACpK,gBAAI,gBAAgB,UAAU,sBAAsB;AAGpD,mBAAO,cAAc,MAAM,SAAS,IAAI,WAAW,kBAAkB,CAAC;AACtE,oBAAQ,cAAc,OAAO,SAAS,IAAI,WAAW,mBAAmB,CAAC;AACzE,qBAAS,MAAM,OAAO;AACtB,oBAAQ,OAAO,OAAO;AACtB;AAAA,UACF;AAAA,QAEF,SAAS,YAAY,UAAU;AAAA,MACjC;AAAA,IACF;AACA,QAAI,aAAa,OAAO,QAAQ;AAE9B,UAAI,WAAW,OAAO,aAAa,EAAE,GACnC,SAAS,YAAY,SAAS,GAC9B,SAAS,YAAY,SAAS;AAChC,UAAI,UAAU;AACZ,eAAO;AACP,gBAAQ;AACR,iBAAS;AACT,kBAAU;AACV,iBAAS,MAAM;AACf,gBAAQ,OAAO;AAAA,MACjB;AAAA,IACF;AACA,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AASA,WAAS,eAAe,IAAI,QAAQ,YAAY;AAC9C,QAAI,SAAS,2BAA2B,IAAI,IAAI,GAC9C,YAAY,QAAQ,EAAE,EAAE,MAAM;AAGhC,WAAO,QAAQ;AACb,UAAI,gBAAgB,QAAQ,MAAM,EAAE,UAAU,GAC5C,UAAU;AACZ,UAAI,eAAe,SAAS,eAAe,QAAQ;AACjD,kBAAU,aAAa;AAAA,MACzB,OAAO;AACL,kBAAU,aAAa;AAAA,MACzB;AACA,UAAI,CAAC,QAAS,QAAO;AACrB,UAAI,WAAW,0BAA0B,EAAG;AAC5C,eAAS,2BAA2B,QAAQ,KAAK;AAAA,IACnD;AACA,WAAO;AAAA,EACT;AAUA,WAAS,SAAS,IAAI,UAAU,SAAS,eAAe;AACtD,QAAI,eAAe,GACjBA,KAAI,GACJ,WAAW,GAAG;AAChB,WAAOA,KAAI,SAAS,QAAQ;AAC1B,UAAI,SAASA,EAAC,EAAE,MAAM,YAAY,UAAU,SAASA,EAAC,MAAM,SAAS,UAAU,iBAAiB,SAASA,EAAC,MAAM,SAAS,YAAY,QAAQ,SAASA,EAAC,GAAG,QAAQ,WAAW,IAAI,KAAK,GAAG;AACvL,YAAI,iBAAiB,UAAU;AAC7B,iBAAO,SAASA,EAAC;AAAA,QACnB;AACA;AAAA,MACF;AACA,MAAAA;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAQA,WAAS,UAAU,IAAI,UAAU;AAC/B,QAAI,OAAO,GAAG;AACd,WAAO,SAAS,SAAS,SAAS,SAAS,IAAI,MAAM,SAAS,MAAM,UAAU,YAAY,CAAC,QAAQ,MAAM,QAAQ,IAAI;AACnH,aAAO,KAAK;AAAA,IACd;AACA,WAAO,QAAQ;AAAA,EACjB;AASA,WAAS,MAAM,IAAI,UAAU;AAC3B,QAAIC,SAAQ;AACZ,QAAI,CAAC,MAAM,CAAC,GAAG,YAAY;AACzB,aAAO;AAAA,IACT;AAGA,WAAO,KAAK,GAAG,wBAAwB;AACrC,UAAI,GAAG,SAAS,YAAY,MAAM,cAAc,OAAO,SAAS,UAAU,CAAC,YAAY,QAAQ,IAAI,QAAQ,IAAI;AAC7G,QAAAA;AAAA,MACF;AAAA,IACF;AACA,WAAOA;AAAA,EACT;AAQA,WAAS,wBAAwB,IAAI;AACnC,QAAI,aAAa,GACf,YAAY,GACZ,cAAc,0BAA0B;AAC1C,QAAI,IAAI;AACN,SAAG;AACD,YAAI,WAAW,OAAO,EAAE,GACtB,SAAS,SAAS,GAClB,SAAS,SAAS;AACpB,sBAAc,GAAG,aAAa;AAC9B,qBAAa,GAAG,YAAY;AAAA,MAC9B,SAAS,OAAO,gBAAgB,KAAK,GAAG;AAAA,IAC1C;AACA,WAAO,CAAC,YAAY,SAAS;AAAA,EAC/B;AAQA,WAAS,cAAc,KAAK,KAAK;AAC/B,aAASD,MAAK,KAAK;AACjB,UAAI,CAAC,IAAI,eAAeA,EAAC,EAAG;AAC5B,eAAS,OAAO,KAAK;AACnB,YAAI,IAAI,eAAe,GAAG,KAAK,IAAI,GAAG,MAAM,IAAIA,EAAC,EAAE,GAAG,EAAG,QAAO,OAAOA,EAAC;AAAA,MAC1E;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,WAAS,2BAA2B,IAAI,aAAa;AAEnD,QAAI,CAAC,MAAM,CAAC,GAAG,sBAAuB,QAAO,0BAA0B;AACvE,QAAI,OAAO;AACX,QAAI,UAAU;AACd,OAAG;AAED,UAAI,KAAK,cAAc,KAAK,eAAe,KAAK,eAAe,KAAK,cAAc;AAChF,YAAI,UAAU,IAAI,IAAI;AACtB,YAAI,KAAK,cAAc,KAAK,gBAAgB,QAAQ,aAAa,UAAU,QAAQ,aAAa,aAAa,KAAK,eAAe,KAAK,iBAAiB,QAAQ,aAAa,UAAU,QAAQ,aAAa,WAAW;AACpN,cAAI,CAAC,KAAK,yBAAyB,SAAS,SAAS,KAAM,QAAO,0BAA0B;AAC5F,cAAI,WAAW,YAAa,QAAO;AACnC,oBAAU;AAAA,QACZ;AAAA,MACF;AAAA,IAEF,SAAS,OAAO,KAAK;AACrB,WAAO,0BAA0B;AAAA,EACnC;AACA,WAASE,QAAO,KAAK,KAAK;AACxB,QAAI,OAAO,KAAK;AACd,eAAS,OAAO,KAAK;AACnB,YAAI,IAAI,eAAe,GAAG,GAAG;AAC3B,cAAI,GAAG,IAAI,IAAI,GAAG;AAAA,QACpB;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,WAAS,YAAY,OAAO,OAAO;AACjC,WAAO,KAAK,MAAM,MAAM,GAAG,MAAM,KAAK,MAAM,MAAM,GAAG,KAAK,KAAK,MAAM,MAAM,IAAI,MAAM,KAAK,MAAM,MAAM,IAAI,KAAK,KAAK,MAAM,MAAM,MAAM,MAAM,KAAK,MAAM,MAAM,MAAM,KAAK,KAAK,MAAM,MAAM,KAAK,MAAM,KAAK,MAAM,MAAM,KAAK;AAAA,EAC5N;AACA,MAAI;AACJ,WAAS,SAAS,UAAU,IAAI;AAC9B,WAAO,WAAY;AACjB,UAAI,CAAC,kBAAkB;AACrB,YAAI,OAAO,WACT,QAAQ;AACV,YAAI,KAAK,WAAW,GAAG;AACrB,mBAAS,KAAK,OAAO,KAAK,CAAC,CAAC;AAAA,QAC9B,OAAO;AACL,mBAAS,MAAM,OAAO,IAAI;AAAA,QAC5B;AACA,2BAAmB,WAAW,WAAY;AACxC,6BAAmB;AAAA,QACrB,GAAG,EAAE;AAAA,MACP;AAAA,IACF;AAAA,EACF;AACA,WAAS,iBAAiB;AACxB,iBAAa,gBAAgB;AAC7B,uBAAmB;AAAA,EACrB;AACA,WAAS,SAAS,IAAI,GAAG,GAAG;AAC1B,OAAG,cAAc;AACjB,OAAG,aAAa;AAAA,EAClB;AACA,WAAS,MAAM,IAAI;AACjB,QAAI,UAAU,OAAO;AACrB,QAAIC,KAAI,OAAO,UAAU,OAAO;AAChC,QAAI,WAAW,QAAQ,KAAK;AAC1B,aAAO,QAAQ,IAAI,EAAE,EAAE,UAAU,IAAI;AAAA,IACvC,WAAWA,IAAG;AACZ,aAAOA,GAAE,EAAE,EAAE,MAAM,IAAI,EAAE,CAAC;AAAA,IAC5B,OAAO;AACL,aAAO,GAAG,UAAU,IAAI;AAAA,IAC1B;AAAA,EACF;AAeA,WAAS,kCAAkC,WAAW,SAASC,UAAS;AACtE,QAAI,OAAO,CAAC;AACZ,UAAM,KAAK,UAAU,QAAQ,EAAE,QAAQ,SAAU,OAAO;AACtD,UAAI,YAAY,WAAW,aAAa;AACxC,UAAI,CAAC,QAAQ,OAAO,QAAQ,WAAW,WAAW,KAAK,KAAK,MAAM,YAAY,UAAUA,SAAS;AACjG,UAAI,YAAY,QAAQ,KAAK;AAC7B,WAAK,OAAO,KAAK,KAAK,aAAa,KAAK,UAAU,QAAQ,eAAe,SAAS,aAAa,UAAU,UAAU,IAAI;AACvH,WAAK,MAAM,KAAK,KAAK,YAAY,KAAK,SAAS,QAAQ,cAAc,SAAS,YAAY,UAAU,UAAU,GAAG;AACjH,WAAK,QAAQ,KAAK,KAAK,cAAc,KAAK,WAAW,QAAQ,gBAAgB,SAAS,cAAc,WAAW,UAAU,KAAK;AAC9H,WAAK,SAAS,KAAK,KAAK,eAAe,KAAK,YAAY,QAAQ,iBAAiB,SAAS,eAAe,WAAW,UAAU,MAAM;AAAA,IACtI,CAAC;AACD,SAAK,QAAQ,KAAK,QAAQ,KAAK;AAC/B,SAAK,SAAS,KAAK,SAAS,KAAK;AACjC,SAAK,IAAI,KAAK;AACd,SAAK,IAAI,KAAK;AACd,WAAO;AAAA,EACT;AACA,MAAI,UAAU,cAAa,oBAAI,KAAK,GAAE,QAAQ;AAE9C,WAAS,wBAAwB;AAC/B,QAAI,kBAAkB,CAAC,GACrB;AACF,WAAO;AAAA,MACL,uBAAuB,SAAS,wBAAwB;AACtD,0BAAkB,CAAC;AACnB,YAAI,CAAC,KAAK,QAAQ,UAAW;AAC7B,YAAI,WAAW,CAAC,EAAE,MAAM,KAAK,KAAK,GAAG,QAAQ;AAC7C,iBAAS,QAAQ,SAAU,OAAO;AAChC,cAAI,IAAI,OAAO,SAAS,MAAM,UAAU,UAAU,SAAS,MAAO;AAClE,0BAAgB,KAAK;AAAA,YACnB,QAAQ;AAAA,YACR,MAAM,QAAQ,KAAK;AAAA,UACrB,CAAC;AACD,cAAI,WAAW,eAAe,CAAC,GAAG,gBAAgB,gBAAgB,SAAS,CAAC,EAAE,IAAI;AAGlF,cAAI,MAAM,uBAAuB;AAC/B,gBAAI,cAAc,OAAO,OAAO,IAAI;AACpC,gBAAI,aAAa;AACf,uBAAS,OAAO,YAAY;AAC5B,uBAAS,QAAQ,YAAY;AAAA,YAC/B;AAAA,UACF;AACA,gBAAM,WAAW;AAAA,QACnB,CAAC;AAAA,MACH;AAAA,MACA,mBAAmB,SAAS,kBAAkB,OAAO;AACnD,wBAAgB,KAAK,KAAK;AAAA,MAC5B;AAAA,MACA,sBAAsB,SAAS,qBAAqB,QAAQ;AAC1D,wBAAgB,OAAO,cAAc,iBAAiB;AAAA,UACpD;AAAA,QACF,CAAC,GAAG,CAAC;AAAA,MACP;AAAA,MACA,YAAY,SAAS,WAAW,UAAU;AACxC,YAAI,QAAQ;AACZ,YAAI,CAAC,KAAK,QAAQ,WAAW;AAC3B,uBAAa,mBAAmB;AAChC,cAAI,OAAO,aAAa,WAAY,UAAS;AAC7C;AAAA,QACF;AACA,YAAI,YAAY,OACd,gBAAgB;AAClB,wBAAgB,QAAQ,SAAU,OAAO;AACvC,cAAI,OAAO,GACT,SAAS,MAAM,QACf,WAAW,OAAO,UAClB,SAAS,QAAQ,MAAM,GACvB,eAAe,OAAO,cACtB,aAAa,OAAO,YACpB,gBAAgB,MAAM,MACtB,eAAe,OAAO,QAAQ,IAAI;AACpC,cAAI,cAAc;AAEhB,mBAAO,OAAO,aAAa;AAC3B,mBAAO,QAAQ,aAAa;AAAA,UAC9B;AACA,iBAAO,SAAS;AAChB,cAAI,OAAO,uBAAuB;AAEhC,gBAAI,YAAY,cAAc,MAAM,KAAK,CAAC,YAAY,UAAU,MAAM;AAAA,aAErE,cAAc,MAAM,OAAO,QAAQ,cAAc,OAAO,OAAO,WAAW,SAAS,MAAM,OAAO,QAAQ,SAAS,OAAO,OAAO,OAAO;AAErI,qBAAO,kBAAkB,eAAe,cAAc,YAAY,MAAM,OAAO;AAAA,YACjF;AAAA,UACF;AAGA,cAAI,CAAC,YAAY,QAAQ,QAAQ,GAAG;AAClC,mBAAO,eAAe;AACtB,mBAAO,aAAa;AACpB,gBAAI,CAAC,MAAM;AACT,qBAAO,MAAM,QAAQ;AAAA,YACvB;AACA,kBAAM,QAAQ,QAAQ,eAAe,QAAQ,IAAI;AAAA,UACnD;AACA,cAAI,MAAM;AACR,wBAAY;AACZ,4BAAgB,KAAK,IAAI,eAAe,IAAI;AAC5C,yBAAa,OAAO,mBAAmB;AACvC,mBAAO,sBAAsB,WAAW,WAAY;AAClD,qBAAO,gBAAgB;AACvB,qBAAO,eAAe;AACtB,qBAAO,WAAW;AAClB,qBAAO,aAAa;AACpB,qBAAO,wBAAwB;AAAA,YACjC,GAAG,IAAI;AACP,mBAAO,wBAAwB;AAAA,UACjC;AAAA,QACF,CAAC;AACD,qBAAa,mBAAmB;AAChC,YAAI,CAAC,WAAW;AACd,cAAI,OAAO,aAAa,WAAY,UAAS;AAAA,QAC/C,OAAO;AACL,gCAAsB,WAAW,WAAY;AAC3C,gBAAI,OAAO,aAAa,WAAY,UAAS;AAAA,UAC/C,GAAG,aAAa;AAAA,QAClB;AACA,0BAAkB,CAAC;AAAA,MACrB;AAAA,MACA,SAAS,SAAS,QAAQ,QAAQ,aAAa,QAAQ,UAAU;AAC/D,YAAI,UAAU;AACZ,cAAI,QAAQ,cAAc,EAAE;AAC5B,cAAI,QAAQ,aAAa,EAAE;AAC3B,cAAI,WAAW,OAAO,KAAK,EAAE,GAC3B,SAAS,YAAY,SAAS,GAC9B,SAAS,YAAY,SAAS,GAC9B,cAAc,YAAY,OAAO,OAAO,SAAS,UAAU,IAC3D,cAAc,YAAY,MAAM,OAAO,QAAQ,UAAU;AAC3D,iBAAO,aAAa,CAAC,CAAC;AACtB,iBAAO,aAAa,CAAC,CAAC;AACtB,cAAI,QAAQ,aAAa,iBAAiB,aAAa,QAAQ,aAAa,OAAO;AACnF,eAAK,kBAAkB,QAAQ,MAAM;AAErC,cAAI,QAAQ,cAAc,eAAe,WAAW,QAAQ,KAAK,QAAQ,SAAS,MAAM,KAAK,QAAQ,SAAS,GAAG;AACjH,cAAI,QAAQ,aAAa,oBAAoB;AAC7C,iBAAO,OAAO,aAAa,YAAY,aAAa,OAAO,QAAQ;AACnE,iBAAO,WAAW,WAAW,WAAY;AACvC,gBAAI,QAAQ,cAAc,EAAE;AAC5B,gBAAI,QAAQ,aAAa,EAAE;AAC3B,mBAAO,WAAW;AAClB,mBAAO,aAAa;AACpB,mBAAO,aAAa;AAAA,UACtB,GAAG,QAAQ;AAAA,QACb;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,WAAS,QAAQ,QAAQ;AACvB,WAAO,OAAO;AAAA,EAChB;AACA,WAAS,kBAAkB,eAAe,UAAU,QAAQ,SAAS;AACnE,WAAO,KAAK,KAAK,KAAK,IAAI,SAAS,MAAM,cAAc,KAAK,CAAC,IAAI,KAAK,IAAI,SAAS,OAAO,cAAc,MAAM,CAAC,CAAC,IAAI,KAAK,KAAK,KAAK,IAAI,SAAS,MAAM,OAAO,KAAK,CAAC,IAAI,KAAK,IAAI,SAAS,OAAO,OAAO,MAAM,CAAC,CAAC,IAAI,QAAQ;AAAA,EAC7N;AAEA,MAAI,UAAU,CAAC;AACf,MAAI,WAAW;AAAA,IACb,qBAAqB;AAAA,EACvB;AACA,MAAI,gBAAgB;AAAA,IAClB,OAAO,SAAS,MAAM,QAAQ;AAE5B,eAASC,WAAU,UAAU;AAC3B,YAAI,SAAS,eAAeA,OAAM,KAAK,EAAEA,WAAU,SAAS;AAC1D,iBAAOA,OAAM,IAAI,SAASA,OAAM;AAAA,QAClC;AAAA,MACF;AACA,cAAQ,QAAQ,SAAU,GAAG;AAC3B,YAAI,EAAE,eAAe,OAAO,YAAY;AACtC,gBAAM,iCAAiC,OAAO,OAAO,YAAY,iBAAiB;AAAA,QACpF;AAAA,MACF,CAAC;AACD,cAAQ,KAAK,MAAM;AAAA,IACrB;AAAA,IACA,aAAa,SAAS,YAAY,WAAW,UAAU,KAAK;AAC1D,UAAI,QAAQ;AACZ,WAAK,gBAAgB;AACrB,UAAI,SAAS,WAAY;AACvB,cAAM,gBAAgB;AAAA,MACxB;AACA,UAAI,kBAAkB,YAAY;AAClC,cAAQ,QAAQ,SAAU,QAAQ;AAChC,YAAI,CAAC,SAAS,OAAO,UAAU,EAAG;AAElC,YAAI,SAAS,OAAO,UAAU,EAAE,eAAe,GAAG;AAChD,mBAAS,OAAO,UAAU,EAAE,eAAe,EAAE,eAAe;AAAA,YAC1D;AAAA,UACF,GAAG,GAAG,CAAC;AAAA,QACT;AAIA,YAAI,SAAS,QAAQ,OAAO,UAAU,KAAK,SAAS,OAAO,UAAU,EAAE,SAAS,GAAG;AACjF,mBAAS,OAAO,UAAU,EAAE,SAAS,EAAE,eAAe;AAAA,YACpD;AAAA,UACF,GAAG,GAAG,CAAC;AAAA,QACT;AAAA,MACF,CAAC;AAAA,IACH;AAAA,IACA,mBAAmB,SAAS,kBAAkB,UAAU,IAAIC,WAAU,SAAS;AAC7E,cAAQ,QAAQ,SAAU,QAAQ;AAChC,YAAI,aAAa,OAAO;AACxB,YAAI,CAAC,SAAS,QAAQ,UAAU,KAAK,CAAC,OAAO,oBAAqB;AAClE,YAAI,cAAc,IAAI,OAAO,UAAU,IAAI,SAAS,OAAO;AAC3D,oBAAY,WAAW;AACvB,oBAAY,UAAU,SAAS;AAC/B,iBAAS,UAAU,IAAI;AAGvB,iBAASA,WAAU,YAAY,QAAQ;AAAA,MACzC,CAAC;AACD,eAASD,WAAU,SAAS,SAAS;AACnC,YAAI,CAAC,SAAS,QAAQ,eAAeA,OAAM,EAAG;AAC9C,YAAI,WAAW,KAAK,aAAa,UAAUA,SAAQ,SAAS,QAAQA,OAAM,CAAC;AAC3E,YAAI,OAAO,aAAa,aAAa;AACnC,mBAAS,QAAQA,OAAM,IAAI;AAAA,QAC7B;AAAA,MACF;AAAA,IACF;AAAA,IACA,oBAAoB,SAAS,mBAAmBE,SAAM,UAAU;AAC9D,UAAI,kBAAkB,CAAC;AACvB,cAAQ,QAAQ,SAAU,QAAQ;AAChC,YAAI,OAAO,OAAO,oBAAoB,WAAY;AAClD,iBAAS,iBAAiB,OAAO,gBAAgB,KAAK,SAAS,OAAO,UAAU,GAAGA,OAAI,CAAC;AAAA,MAC1F,CAAC;AACD,aAAO;AAAA,IACT;AAAA,IACA,cAAc,SAAS,aAAa,UAAUA,SAAM,OAAO;AACzD,UAAI;AACJ,cAAQ,QAAQ,SAAU,QAAQ;AAEhC,YAAI,CAAC,SAAS,OAAO,UAAU,EAAG;AAGlC,YAAI,OAAO,mBAAmB,OAAO,OAAO,gBAAgBA,OAAI,MAAM,YAAY;AAChF,0BAAgB,OAAO,gBAAgBA,OAAI,EAAE,KAAK,SAAS,OAAO,UAAU,GAAG,KAAK;AAAA,QACtF;AAAA,MACF,CAAC;AACD,aAAO;AAAA,IACT;AAAA,EACF;AAEA,WAASC,eAAc,MAAM;AAC3B,QAAI,WAAW,KAAK,UAClBC,UAAS,KAAK,QACdF,UAAO,KAAK,MACZ,WAAW,KAAK,UAChBG,WAAU,KAAK,SACf,OAAO,KAAK,MACZ,SAAS,KAAK,QACdC,YAAW,KAAK,UAChBC,YAAW,KAAK,UAChBC,qBAAoB,KAAK,mBACzBC,qBAAoB,KAAK,mBACzB,gBAAgB,KAAK,eACrBC,eAAc,KAAK,aACnB,uBAAuB,KAAK;AAC9B,eAAW,YAAYN,WAAUA,QAAO,OAAO;AAC/C,QAAI,CAAC,SAAU;AACf,QAAI,KACF,UAAU,SAAS,SACnB,SAAS,OAAOF,QAAK,OAAO,CAAC,EAAE,YAAY,IAAIA,QAAK,OAAO,CAAC;AAE9D,QAAI,OAAO,eAAe,CAAC,cAAc,CAAC,MAAM;AAC9C,YAAM,IAAI,YAAYA,SAAM;AAAA,QAC1B,SAAS;AAAA,QACT,YAAY;AAAA,MACd,CAAC;AAAA,IACH,OAAO;AACL,YAAM,SAAS,YAAY,OAAO;AAClC,UAAI,UAAUA,SAAM,MAAM,IAAI;AAAA,IAChC;AACA,QAAI,KAAK,QAAQE;AACjB,QAAI,OAAO,UAAUA;AACrB,QAAI,OAAO,YAAYA;AACvB,QAAI,QAAQC;AACZ,QAAI,WAAWC;AACf,QAAI,WAAWC;AACf,QAAI,oBAAoBC;AACxB,QAAI,oBAAoBC;AACxB,QAAI,gBAAgB;AACpB,QAAI,WAAWC,eAAcA,aAAY,cAAc;AACvD,QAAI,qBAAqB,eAAe,eAAe,CAAC,GAAG,oBAAoB,GAAG,cAAc,mBAAmBR,SAAM,QAAQ,CAAC;AAClI,aAASF,WAAU,oBAAoB;AACrC,UAAIA,OAAM,IAAI,mBAAmBA,OAAM;AAAA,IACzC;AACA,QAAII,SAAQ;AACV,MAAAA,QAAO,cAAc,GAAG;AAAA,IAC1B;AACA,QAAI,QAAQ,MAAM,GAAG;AACnB,cAAQ,MAAM,EAAE,KAAK,UAAU,GAAG;AAAA,IACpC;AAAA,EACF;AAEA,MAAI,YAAY,CAAC,KAAK;AACtB,MAAIO,eAAc,SAASA,aAAY,WAAW,UAAU;AAC1D,QAAI,OAAO,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAC,GAC9E,gBAAgB,KAAK,KACrB,OAAO,yBAAyB,MAAM,SAAS;AACjD,kBAAc,YAAY,KAAK,QAAQ,EAAE,WAAW,UAAU,eAAe;AAAA,MAC3E;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa;AAAA,MACb;AAAA,MACA,gBAAgB,SAAS;AAAA,MACzB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,oBAAoB;AAAA,MACpB,sBAAsB;AAAA,MACtB,gBAAgB,SAAS,iBAAiB;AACxC,sBAAc;AAAA,MAChB;AAAA,MACA,eAAe,SAAS,gBAAgB;AACtC,sBAAc;AAAA,MAChB;AAAA,MACA,uBAAuB,SAAS,sBAAsBT,SAAM;AAC1D,uBAAe;AAAA,UACb;AAAA,UACA,MAAMA;AAAA,UACN;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF,GAAG,IAAI,CAAC;AAAA,EACV;AACA,WAAS,eAAe,MAAM;AAC5B,IAAAC,eAAc,eAAe;AAAA,MAC3B;AAAA,MACA;AAAA,MACA,UAAU;AAAA,MACV;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,GAAG,IAAI,CAAC;AAAA,EACV;AACA,MAAI;AAAJ,MACE;AADF,MAEE;AAFF,MAGE;AAHF,MAIE;AAJF,MAKE;AALF,MAME;AANF,MAOE;AAPF,MAQE;AARF,MASE;AATF,MAUE;AAVF,MAWE;AAXF,MAYE;AAZF,MAaE;AAbF,MAcE,sBAAsB;AAdxB,MAeE,kBAAkB;AAfpB,MAgBE,YAAY,CAAC;AAhBf,MAiBE;AAjBF,MAkBE;AAlBF,MAmBE;AAnBF,MAoBE;AApBF,MAqBE;AArBF,MAsBE;AAtBF,MAuBE;AAvBF,MAwBE;AAxBF,MAyBE;AAzBF,MA0BE,wBAAwB;AA1B1B,MA2BE,yBAAyB;AA3B3B,MA4BE;AA5BF,MA8BE;AA9BF,MA+BE,mCAAmC,CAAC;AA/BtC,MAkCE,UAAU;AAlCZ,MAmCE,oBAAoB,CAAC;AAGvB,MAAI,iBAAiB,OAAO,aAAa;AAAzC,MACE,0BAA0B;AAD5B,MAEE,mBAAmB,QAAQ,aAAa,aAAa;AAFvD,MAIE,mBAAmB,kBAAkB,CAAC,oBAAoB,CAAC,OAAO,eAAe,SAAS,cAAc,KAAK;AAJ/G,MAKE,0BAA0B,WAAY;AACpC,QAAI,CAAC,eAAgB;AAErB,QAAI,YAAY;AACd,aAAO;AAAA,IACT;AACA,QAAI,KAAK,SAAS,cAAc,GAAG;AACnC,OAAG,MAAM,UAAU;AACnB,WAAO,GAAG,MAAM,kBAAkB;AAAA,EACpC,EAAE;AAdJ,MAeE,mBAAmB,SAASS,kBAAiB,IAAI,SAAS;AACxD,QAAI,QAAQ,IAAI,EAAE,GAChB,UAAU,SAAS,MAAM,KAAK,IAAI,SAAS,MAAM,WAAW,IAAI,SAAS,MAAM,YAAY,IAAI,SAAS,MAAM,eAAe,IAAI,SAAS,MAAM,gBAAgB,GAChK,SAAS,SAAS,IAAI,GAAG,OAAO,GAChC,SAAS,SAAS,IAAI,GAAG,OAAO,GAChC,gBAAgB,UAAU,IAAI,MAAM,GACpC,iBAAiB,UAAU,IAAI,MAAM,GACrC,kBAAkB,iBAAiB,SAAS,cAAc,UAAU,IAAI,SAAS,cAAc,WAAW,IAAI,QAAQ,MAAM,EAAE,OAC9H,mBAAmB,kBAAkB,SAAS,eAAe,UAAU,IAAI,SAAS,eAAe,WAAW,IAAI,QAAQ,MAAM,EAAE;AACpI,QAAI,MAAM,YAAY,QAAQ;AAC5B,aAAO,MAAM,kBAAkB,YAAY,MAAM,kBAAkB,mBAAmB,aAAa;AAAA,IACrG;AACA,QAAI,MAAM,YAAY,QAAQ;AAC5B,aAAO,MAAM,oBAAoB,MAAM,GAAG,EAAE,UAAU,IAAI,aAAa;AAAA,IACzE;AACA,QAAI,UAAU,cAAc,OAAO,KAAK,cAAc,OAAO,MAAM,QAAQ;AACzE,UAAI,qBAAqB,cAAc,OAAO,MAAM,SAAS,SAAS;AACtE,aAAO,WAAW,eAAe,UAAU,UAAU,eAAe,UAAU,sBAAsB,aAAa;AAAA,IACnH;AACA,WAAO,WAAW,cAAc,YAAY,WAAW,cAAc,YAAY,UAAU,cAAc,YAAY,WAAW,cAAc,YAAY,UAAU,mBAAmB,WAAW,MAAM,gBAAgB,MAAM,UAAU,UAAU,MAAM,gBAAgB,MAAM,UAAU,kBAAkB,mBAAmB,WAAW,aAAa;AAAA,EACvV;AAnCF,MAoCE,qBAAqB,SAASC,oBAAmB,UAAU,YAAY,UAAU;AAC/E,QAAI,cAAc,WAAW,SAAS,OAAO,SAAS,KACpD,cAAc,WAAW,SAAS,QAAQ,SAAS,QACnD,kBAAkB,WAAW,SAAS,QAAQ,SAAS,QACvD,cAAc,WAAW,WAAW,OAAO,WAAW,KACtD,cAAc,WAAW,WAAW,QAAQ,WAAW,QACvD,kBAAkB,WAAW,WAAW,QAAQ,WAAW;AAC7D,WAAO,gBAAgB,eAAe,gBAAgB,eAAe,cAAc,kBAAkB,MAAM,cAAc,kBAAkB;AAAA,EAC7I;AA5CF,MAmDE,8BAA8B,SAASC,6BAA4B,GAAG,GAAG;AACvE,QAAI;AACJ,cAAU,KAAK,SAAU,UAAU;AACjC,UAAI,YAAY,SAAS,OAAO,EAAE,QAAQ;AAC1C,UAAI,CAAC,aAAa,UAAU,QAAQ,EAAG;AACvC,UAAI,OAAO,QAAQ,QAAQ,GACzB,qBAAqB,KAAK,KAAK,OAAO,aAAa,KAAK,KAAK,QAAQ,WACrE,mBAAmB,KAAK,KAAK,MAAM,aAAa,KAAK,KAAK,SAAS;AACrE,UAAI,sBAAsB,kBAAkB;AAC1C,eAAO,MAAM;AAAA,MACf;AAAA,IACF,CAAC;AACD,WAAO;AAAA,EACT;AAhEF,MAiEE,gBAAgB,SAASC,eAAc,SAAS;AAC9C,aAAS,KAAK,OAAO,MAAM;AACzB,aAAO,SAAUC,KAAI,MAAMC,SAAQ,KAAK;AACtC,YAAI,YAAYD,IAAG,QAAQ,MAAM,QAAQ,KAAK,QAAQ,MAAM,QAAQA,IAAG,QAAQ,MAAM,SAAS,KAAK,QAAQ,MAAM;AACjH,YAAI,SAAS,SAAS,QAAQ,YAAY;AAGxC,iBAAO;AAAA,QACT,WAAW,SAAS,QAAQ,UAAU,OAAO;AAC3C,iBAAO;AAAA,QACT,WAAW,QAAQ,UAAU,SAAS;AACpC,iBAAO;AAAA,QACT,WAAW,OAAO,UAAU,YAAY;AACtC,iBAAO,KAAK,MAAMA,KAAI,MAAMC,SAAQ,GAAG,GAAG,IAAI,EAAED,KAAI,MAAMC,SAAQ,GAAG;AAAA,QACvE,OAAO;AACL,cAAI,cAAc,OAAOD,MAAK,MAAM,QAAQ,MAAM;AAClD,iBAAO,UAAU,QAAQ,OAAO,UAAU,YAAY,UAAU,cAAc,MAAM,QAAQ,MAAM,QAAQ,UAAU,IAAI;AAAA,QAC1H;AAAA,MACF;AAAA,IACF;AACA,QAAI,QAAQ,CAAC;AACb,QAAI,gBAAgB,QAAQ;AAC5B,QAAI,CAAC,iBAAiB,QAAQ,aAAa,KAAK,UAAU;AACxD,sBAAgB;AAAA,QACd,MAAM;AAAA,MACR;AAAA,IACF;AACA,UAAM,OAAO,cAAc;AAC3B,UAAM,YAAY,KAAK,cAAc,MAAM,IAAI;AAC/C,UAAM,WAAW,KAAK,cAAc,GAAG;AACvC,UAAM,cAAc,cAAc;AAClC,YAAQ,QAAQ;AAAA,EAClB;AAjGF,MAkGE,sBAAsB,SAASE,uBAAsB;AACnD,QAAI,CAAC,2BAA2B,SAAS;AACvC,UAAI,SAAS,WAAW,MAAM;AAAA,IAChC;AAAA,EACF;AAtGF,MAuGE,wBAAwB,SAASC,yBAAwB;AACvD,QAAI,CAAC,2BAA2B,SAAS;AACvC,UAAI,SAAS,WAAW,EAAE;AAAA,IAC5B;AAAA,EACF;AAGF,MAAI,kBAAkB,CAAC,kBAAkB;AACvC,aAAS,iBAAiB,SAAS,SAAU,KAAK;AAChD,UAAI,iBAAiB;AACnB,YAAI,eAAe;AACnB,YAAI,mBAAmB,IAAI,gBAAgB;AAC3C,YAAI,4BAA4B,IAAI,yBAAyB;AAC7D,0BAAkB;AAClB,eAAO;AAAA,MACT;AAAA,IACF,GAAG,IAAI;AAAA,EACT;AACA,MAAI,gCAAgC,SAASC,+BAA8B,KAAK;AAC9E,QAAI,QAAQ;AACV,YAAM,IAAI,UAAU,IAAI,QAAQ,CAAC,IAAI;AACrC,UAAI,UAAU,4BAA4B,IAAI,SAAS,IAAI,OAAO;AAClE,UAAI,SAAS;AAEX,YAAI,QAAQ,CAAC;AACb,iBAASC,MAAK,KAAK;AACjB,cAAI,IAAI,eAAeA,EAAC,GAAG;AACzB,kBAAMA,EAAC,IAAI,IAAIA,EAAC;AAAA,UAClB;AAAA,QACF;AACA,cAAM,SAAS,MAAM,SAAS;AAC9B,cAAM,iBAAiB;AACvB,cAAM,kBAAkB;AACxB,gBAAQ,OAAO,EAAE,YAAY,KAAK;AAAA,MACpC;AAAA,IACF;AAAA,EACF;AACA,MAAI,wBAAwB,SAASC,uBAAsB,KAAK;AAC9D,QAAI,QAAQ;AACV,aAAO,WAAW,OAAO,EAAE,iBAAiB,IAAI,MAAM;AAAA,IACxD;AAAA,EACF;AAOA,WAAS,SAAS,IAAI,SAAS;AAC7B,QAAI,EAAE,MAAM,GAAG,YAAY,GAAG,aAAa,IAAI;AAC7C,YAAM,8CAA8C,OAAO,CAAC,EAAE,SAAS,KAAK,EAAE,CAAC;AAAA,IACjF;AACA,SAAK,KAAK;AACV,SAAK,UAAU,UAAU,SAAS,CAAC,GAAG,OAAO;AAG7C,OAAG,OAAO,IAAI;AACd,QAAIrB,YAAW;AAAA,MACb,OAAO;AAAA,MACP,MAAM;AAAA,MACN,UAAU;AAAA,MACV,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,WAAW,WAAW,KAAK,GAAG,QAAQ,IAAI,QAAQ;AAAA,MAClD,eAAe;AAAA;AAAA,MAEf,YAAY;AAAA;AAAA,MAEZ,uBAAuB;AAAA;AAAA,MAEvB,mBAAmB;AAAA,MACnB,WAAW,SAAS,YAAY;AAC9B,eAAO,iBAAiB,IAAI,KAAK,OAAO;AAAA,MAC1C;AAAA,MACA,YAAY;AAAA,MACZ,aAAa;AAAA,MACb,WAAW;AAAA,MACX,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,iBAAiB;AAAA,MACjB,WAAW;AAAA,MACX,QAAQ;AAAA,MACR,SAAS,SAAS,QAAQ,cAAcgB,SAAQ;AAC9C,qBAAa,QAAQ,QAAQA,QAAO,WAAW;AAAA,MACjD;AAAA,MACA,YAAY;AAAA,MACZ,gBAAgB;AAAA,MAChB,YAAY;AAAA,MACZ,OAAO;AAAA,MACP,kBAAkB;AAAA,MAClB,sBAAsB,OAAO,WAAW,SAAS,QAAQ,SAAS,OAAO,kBAAkB,EAAE,KAAK;AAAA,MAClG,eAAe;AAAA,MACf,eAAe;AAAA,MACf,gBAAgB;AAAA,MAChB,mBAAmB;AAAA,MACnB,gBAAgB;AAAA,QACd,GAAG;AAAA,QACH,GAAG;AAAA,MACL;AAAA;AAAA,MAEA,gBAAgB,SAAS,mBAAmB,SAAS,kBAAkB,WAAW,CAAC,UAAU;AAAA,MAC7F,sBAAsB;AAAA,IACxB;AACA,kBAAc,kBAAkB,MAAM,IAAIhB,SAAQ;AAGlD,aAASC,WAAQD,WAAU;AACzB,QAAEC,WAAQ,aAAa,QAAQA,OAAI,IAAID,UAASC,OAAI;AAAA,IACtD;AACA,kBAAc,OAAO;AAGrB,aAAS,MAAM,MAAM;AACnB,UAAI,GAAG,OAAO,CAAC,MAAM,OAAO,OAAO,KAAK,EAAE,MAAM,YAAY;AAC1D,aAAK,EAAE,IAAI,KAAK,EAAE,EAAE,KAAK,IAAI;AAAA,MAC/B;AAAA,IACF;AAGA,SAAK,kBAAkB,QAAQ,gBAAgB,QAAQ;AACvD,QAAI,KAAK,iBAAiB;AAExB,WAAK,QAAQ,sBAAsB;AAAA,IACrC;AAGA,QAAI,QAAQ,gBAAgB;AAC1B,SAAG,IAAI,eAAe,KAAK,WAAW;AAAA,IACxC,OAAO;AACL,SAAG,IAAI,aAAa,KAAK,WAAW;AACpC,SAAG,IAAI,cAAc,KAAK,WAAW;AAAA,IACvC;AACA,QAAI,KAAK,iBAAiB;AACxB,SAAG,IAAI,YAAY,IAAI;AACvB,SAAG,IAAI,aAAa,IAAI;AAAA,IAC1B;AACA,cAAU,KAAK,KAAK,EAAE;AAGtB,YAAQ,SAAS,QAAQ,MAAM,OAAO,KAAK,KAAK,QAAQ,MAAM,IAAI,IAAI,KAAK,CAAC,CAAC;AAG7E,aAAS,MAAM,sBAAsB,CAAC;AAAA,EACxC;AACA,WAAS;AAAA,EAA4C;AAAA,IACnD,aAAa;AAAA,IACb,kBAAkB,SAAS,iBAAiB,QAAQ;AAClD,UAAI,CAAC,KAAK,GAAG,SAAS,MAAM,KAAK,WAAW,KAAK,IAAI;AACnD,qBAAa;AAAA,MACf;AAAA,IACF;AAAA,IACA,eAAe,SAAS,cAAc,KAAK,QAAQ;AACjD,aAAO,OAAO,KAAK,QAAQ,cAAc,aAAa,KAAK,QAAQ,UAAU,KAAK,MAAM,KAAK,QAAQ,MAAM,IAAI,KAAK,QAAQ;AAAA,IAC9H;AAAA,IACA,aAAa,SAAS,YAAoC,KAAK;AAC7D,UAAI,CAAC,IAAI,WAAY;AACrB,UAAI,QAAQ,MACV,KAAK,KAAK,IACV,UAAU,KAAK,SACf,kBAAkB,QAAQ,iBAC1B,OAAO,IAAI,MACX,QAAQ,IAAI,WAAW,IAAI,QAAQ,CAAC,KAAK,IAAI,eAAe,IAAI,gBAAgB,WAAW,KAC3F,UAAU,SAAS,KAAK,QACxB,iBAAiB,IAAI,OAAO,eAAe,IAAI,QAAQ,IAAI,KAAK,CAAC,KAAK,IAAI,gBAAgB,IAAI,aAAa,EAAE,CAAC,MAAM,QACpHqB,UAAS,QAAQ;AACnB,6BAAuB,EAAE;AAGzB,UAAI,QAAQ;AACV;AAAA,MACF;AACA,UAAI,wBAAwB,KAAK,IAAI,KAAK,IAAI,WAAW,KAAK,QAAQ,UAAU;AAC9E;AAAA,MACF;AAGA,UAAI,eAAe,mBAAmB;AACpC;AAAA,MACF;AAGA,UAAI,CAAC,KAAK,mBAAmB,UAAU,UAAU,OAAO,QAAQ,YAAY,MAAM,UAAU;AAC1F;AAAA,MACF;AACA,eAAS,QAAQ,QAAQ,QAAQ,WAAW,IAAI,KAAK;AACrD,UAAI,UAAU,OAAO,UAAU;AAC7B;AAAA,MACF;AACA,UAAI,eAAe,QAAQ;AAEzB;AAAA,MACF;AAGA,iBAAW,MAAM,MAAM;AACvB,0BAAoB,MAAM,QAAQ,QAAQ,SAAS;AAGnD,UAAI,OAAOA,YAAW,YAAY;AAChC,YAAIA,QAAO,KAAK,MAAM,KAAK,QAAQ,IAAI,GAAG;AACxC,yBAAe;AAAA,YACb,UAAU;AAAA,YACV,QAAQ;AAAA,YACR,MAAM;AAAA,YACN,UAAU;AAAA,YACV,MAAM;AAAA,YACN,QAAQ;AAAA,UACV,CAAC;AACD,UAAAZ,aAAY,UAAU,OAAO;AAAA,YAC3B;AAAA,UACF,CAAC;AACD,6BAAmB,IAAI,eAAe;AACtC;AAAA,QACF;AAAA,MACF,WAAWY,SAAQ;AACjB,QAAAA,UAASA,QAAO,MAAM,GAAG,EAAE,KAAK,SAAU,UAAU;AAClD,qBAAW,QAAQ,gBAAgB,SAAS,KAAK,GAAG,IAAI,KAAK;AAC7D,cAAI,UAAU;AACZ,2BAAe;AAAA,cACb,UAAU;AAAA,cACV,QAAQ;AAAA,cACR,MAAM;AAAA,cACN,UAAU;AAAA,cACV,QAAQ;AAAA,cACR,MAAM;AAAA,YACR,CAAC;AACD,YAAAZ,aAAY,UAAU,OAAO;AAAA,cAC3B;AAAA,YACF,CAAC;AACD,mBAAO;AAAA,UACT;AAAA,QACF,CAAC;AACD,YAAIY,SAAQ;AACV,6BAAmB,IAAI,eAAe;AACtC;AAAA,QACF;AAAA,MACF;AACA,UAAI,QAAQ,UAAU,CAAC,QAAQ,gBAAgB,QAAQ,QAAQ,IAAI,KAAK,GAAG;AACzE;AAAA,MACF;AAGA,WAAK,kBAAkB,KAAK,OAAO,MAAM;AAAA,IAC3C;AAAA,IACA,mBAAmB,SAAS,kBAA+B,KAAiB,OAAyB,QAAQ;AAC3G,UAAI,QAAQ,MACV,KAAK,MAAM,IACX,UAAU,MAAM,SAChB,gBAAgB,GAAG,eACnB;AACF,UAAI,UAAU,CAAC,UAAU,OAAO,eAAe,IAAI;AACjD,YAAI,WAAW,QAAQ,MAAM;AAC7B,iBAAS;AACT,iBAAS;AACT,mBAAW,OAAO;AAClB,iBAAS,OAAO;AAChB,qBAAa;AACb,sBAAc,QAAQ;AACtB,iBAAS,UAAU;AACnB,iBAAS;AAAA,UACP,QAAQ;AAAA,UACR,UAAU,SAAS,KAAK;AAAA,UACxB,UAAU,SAAS,KAAK;AAAA,QAC1B;AACA,0BAAkB,OAAO,UAAU,SAAS;AAC5C,yBAAiB,OAAO,UAAU,SAAS;AAC3C,aAAK,UAAU,SAAS,KAAK;AAC7B,aAAK,UAAU,SAAS,KAAK;AAC7B,eAAO,MAAM,aAAa,IAAI;AAC9B,sBAAc,SAASC,eAAc;AACnC,UAAAb,aAAY,cAAc,OAAO;AAAA,YAC/B;AAAA,UACF,CAAC;AACD,cAAI,SAAS,eAAe;AAC1B,kBAAM,QAAQ;AACd;AAAA,UACF;AAGA,gBAAM,0BAA0B;AAChC,cAAI,CAAC,WAAW,MAAM,iBAAiB;AACrC,mBAAO,YAAY;AAAA,UACrB;AAGA,gBAAM,kBAAkB,KAAK,KAAK;AAGlC,yBAAe;AAAA,YACb,UAAU;AAAA,YACV,MAAM;AAAA,YACN,eAAe;AAAA,UACjB,CAAC;AAGD,sBAAY,QAAQ,QAAQ,aAAa,IAAI;AAAA,QAC/C;AAGA,gBAAQ,OAAO,MAAM,GAAG,EAAE,QAAQ,SAAU,UAAU;AACpD,eAAK,QAAQ,SAAS,KAAK,GAAG,iBAAiB;AAAA,QACjD,CAAC;AACD,WAAG,eAAe,YAAY,6BAA6B;AAC3D,WAAG,eAAe,aAAa,6BAA6B;AAC5D,WAAG,eAAe,aAAa,6BAA6B;AAC5D,YAAI,QAAQ,gBAAgB;AAC1B,aAAG,eAAe,aAAa,MAAM,OAAO;AAE5C,WAAC,KAAK,mBAAmB,GAAG,eAAe,iBAAiB,MAAM,OAAO;AAAA,QAC3E,OAAO;AACL,aAAG,eAAe,WAAW,MAAM,OAAO;AAC1C,aAAG,eAAe,YAAY,MAAM,OAAO;AAC3C,aAAG,eAAe,eAAe,MAAM,OAAO;AAAA,QAChD;AAGA,YAAI,WAAW,KAAK,iBAAiB;AACnC,eAAK,QAAQ,sBAAsB;AACnC,iBAAO,YAAY;AAAA,QACrB;AACA,QAAAA,aAAY,cAAc,MAAM;AAAA,UAC9B;AAAA,QACF,CAAC;AAGD,YAAI,QAAQ,UAAU,CAAC,QAAQ,oBAAoB,WAAW,CAAC,KAAK,mBAAmB,EAAE,QAAQ,cAAc;AAC7G,cAAI,SAAS,eAAe;AAC1B,iBAAK,QAAQ;AACb;AAAA,UACF;AAIA,cAAI,QAAQ,gBAAgB;AAC1B,eAAG,eAAe,aAAa,MAAM,mBAAmB;AACxD,eAAG,eAAe,iBAAiB,MAAM,mBAAmB;AAAA,UAC9D,OAAO;AACL,eAAG,eAAe,WAAW,MAAM,mBAAmB;AACtD,eAAG,eAAe,YAAY,MAAM,mBAAmB;AACvD,eAAG,eAAe,eAAe,MAAM,mBAAmB;AAAA,UAC5D;AACA,aAAG,eAAe,aAAa,MAAM,4BAA4B;AACjE,aAAG,eAAe,aAAa,MAAM,4BAA4B;AACjE,kBAAQ,kBAAkB,GAAG,eAAe,eAAe,MAAM,4BAA4B;AAC7F,gBAAM,kBAAkB,WAAW,aAAa,QAAQ,KAAK;AAAA,QAC/D,OAAO;AACL,sBAAY;AAAA,QACd;AAAA,MACF;AAAA,IACF;AAAA,IACA,8BAA8B,SAAS,6BAA6Dc,IAAG;AACrG,UAAI,QAAQA,GAAE,UAAUA,GAAE,QAAQ,CAAC,IAAIA;AACvC,UAAI,KAAK,IAAI,KAAK,IAAI,MAAM,UAAU,KAAK,MAAM,GAAG,KAAK,IAAI,MAAM,UAAU,KAAK,MAAM,CAAC,KAAK,KAAK,MAAM,KAAK,QAAQ,uBAAuB,KAAK,mBAAmB,OAAO,oBAAoB,EAAE,GAAG;AACnM,aAAK,oBAAoB;AAAA,MAC3B;AAAA,IACF;AAAA,IACA,qBAAqB,SAAS,sBAAsB;AAClD,gBAAU,kBAAkB,MAAM;AAClC,mBAAa,KAAK,eAAe;AACjC,WAAK,0BAA0B;AAAA,IACjC;AAAA,IACA,2BAA2B,SAAS,4BAA4B;AAC9D,UAAI,gBAAgB,KAAK,GAAG;AAC5B,UAAI,eAAe,WAAW,KAAK,mBAAmB;AACtD,UAAI,eAAe,YAAY,KAAK,mBAAmB;AACvD,UAAI,eAAe,eAAe,KAAK,mBAAmB;AAC1D,UAAI,eAAe,aAAa,KAAK,mBAAmB;AACxD,UAAI,eAAe,iBAAiB,KAAK,mBAAmB;AAC5D,UAAI,eAAe,aAAa,KAAK,4BAA4B;AACjE,UAAI,eAAe,aAAa,KAAK,4BAA4B;AACjE,UAAI,eAAe,eAAe,KAAK,4BAA4B;AAAA,IACrE;AAAA,IACA,mBAAmB,SAAS,kBAA+B,KAAiB,OAAO;AACjF,cAAQ,SAAS,IAAI,eAAe,WAAW;AAC/C,UAAI,CAAC,KAAK,mBAAmB,OAAO;AAClC,YAAI,KAAK,QAAQ,gBAAgB;AAC/B,aAAG,UAAU,eAAe,KAAK,YAAY;AAAA,QAC/C,WAAW,OAAO;AAChB,aAAG,UAAU,aAAa,KAAK,YAAY;AAAA,QAC7C,OAAO;AACL,aAAG,UAAU,aAAa,KAAK,YAAY;AAAA,QAC7C;AAAA,MACF,OAAO;AACL,WAAG,QAAQ,WAAW,IAAI;AAC1B,WAAG,QAAQ,aAAa,KAAK,YAAY;AAAA,MAC3C;AACA,UAAI;AACF,YAAI,SAAS,WAAW;AACtB,oBAAU,WAAY;AACpB,qBAAS,UAAU,MAAM;AAAA,UAC3B,CAAC;AAAA,QACH,OAAO;AACL,iBAAO,aAAa,EAAE,gBAAgB;AAAA,QACxC;AAAA,MACF,SAAS,KAAK;AAAA,MAAC;AAAA,IACjB;AAAA,IACA,cAAc,SAAS,aAAa,UAAU,KAAK;AACjD,4BAAsB;AACtB,UAAI,UAAU,QAAQ;AACpB,QAAAd,aAAY,eAAe,MAAM;AAAA,UAC/B;AAAA,QACF,CAAC;AACD,YAAI,KAAK,iBAAiB;AACxB,aAAG,UAAU,YAAY,qBAAqB;AAAA,QAChD;AACA,YAAI,UAAU,KAAK;AAGnB,SAAC,YAAY,YAAY,QAAQ,QAAQ,WAAW,KAAK;AACzD,oBAAY,QAAQ,QAAQ,YAAY,IAAI;AAC5C,iBAAS,SAAS;AAClB,oBAAY,KAAK,aAAa;AAG9B,uBAAe;AAAA,UACb,UAAU;AAAA,UACV,MAAM;AAAA,UACN,eAAe;AAAA,QACjB,CAAC;AAAA,MACH,OAAO;AACL,aAAK,SAAS;AAAA,MAChB;AAAA,IACF;AAAA,IACA,kBAAkB,SAAS,mBAAmB;AAC5C,UAAI,UAAU;AACZ,aAAK,SAAS,SAAS;AACvB,aAAK,SAAS,SAAS;AACvB,4BAAoB;AACpB,YAAI,SAAS,SAAS,iBAAiB,SAAS,SAAS,SAAS,OAAO;AACzE,YAAI,SAAS;AACb,eAAO,UAAU,OAAO,YAAY;AAClC,mBAAS,OAAO,WAAW,iBAAiB,SAAS,SAAS,SAAS,OAAO;AAC9E,cAAI,WAAW,OAAQ;AACvB,mBAAS;AAAA,QACX;AACA,eAAO,WAAW,OAAO,EAAE,iBAAiB,MAAM;AAClD,YAAI,QAAQ;AACV,aAAG;AACD,gBAAI,OAAO,OAAO,GAAG;AACnB,kBAAI,WAAW;AACf,yBAAW,OAAO,OAAO,EAAE,YAAY;AAAA,gBACrC,SAAS,SAAS;AAAA,gBAClB,SAAS,SAAS;AAAA,gBAClB;AAAA,gBACA,QAAQ;AAAA,cACV,CAAC;AACD,kBAAI,YAAY,CAAC,KAAK,QAAQ,gBAAgB;AAC5C;AAAA,cACF;AAAA,YACF;AACA,qBAAS;AAAA,UACX,SAC8B,SAAS,gBAAgB,MAAM;AAAA,QAC/D;AACA,8BAAsB;AAAA,MACxB;AAAA,IACF;AAAA,IACA,cAAc,SAAS,aAA6B,KAAK;AACvD,UAAI,QAAQ;AACV,YAAI,UAAU,KAAK,SACjB,oBAAoB,QAAQ,mBAC5B,iBAAiB,QAAQ,gBACzB,QAAQ,IAAI,UAAU,IAAI,QAAQ,CAAC,IAAI,KACvC,cAAc,WAAW,OAAO,SAAS,IAAI,GAC7C,SAAS,WAAW,eAAe,YAAY,GAC/C,SAAS,WAAW,eAAe,YAAY,GAC/C,uBAAuB,2BAA2B,uBAAuB,wBAAwB,mBAAmB,GACpH,MAAM,MAAM,UAAU,OAAO,UAAU,eAAe,MAAM,UAAU,MAAM,uBAAuB,qBAAqB,CAAC,IAAI,iCAAiC,CAAC,IAAI,MAAM,UAAU,IACnL,MAAM,MAAM,UAAU,OAAO,UAAU,eAAe,MAAM,UAAU,MAAM,uBAAuB,qBAAqB,CAAC,IAAI,iCAAiC,CAAC,IAAI,MAAM,UAAU;AAGrL,YAAI,CAAC,SAAS,UAAU,CAAC,qBAAqB;AAC5C,cAAI,qBAAqB,KAAK,IAAI,KAAK,IAAI,MAAM,UAAU,KAAK,MAAM,GAAG,KAAK,IAAI,MAAM,UAAU,KAAK,MAAM,CAAC,IAAI,mBAAmB;AACnI;AAAA,UACF;AACA,eAAK,aAAa,KAAK,IAAI;AAAA,QAC7B;AACA,YAAI,SAAS;AACX,cAAI,aAAa;AACf,wBAAY,KAAK,MAAM,UAAU;AACjC,wBAAY,KAAK,MAAM,UAAU;AAAA,UACnC,OAAO;AACL,0BAAc;AAAA,cACZ,GAAG;AAAA,cACH,GAAG;AAAA,cACH,GAAG;AAAA,cACH,GAAG;AAAA,cACH,GAAG;AAAA,cACH,GAAG;AAAA,YACL;AAAA,UACF;AACA,cAAI,YAAY,UAAU,OAAO,YAAY,GAAG,GAAG,EAAE,OAAO,YAAY,GAAG,GAAG,EAAE,OAAO,YAAY,GAAG,GAAG,EAAE,OAAO,YAAY,GAAG,GAAG,EAAE,OAAO,YAAY,GAAG,GAAG,EAAE,OAAO,YAAY,GAAG,GAAG;AAC1L,cAAI,SAAS,mBAAmB,SAAS;AACzC,cAAI,SAAS,gBAAgB,SAAS;AACtC,cAAI,SAAS,eAAe,SAAS;AACrC,cAAI,SAAS,aAAa,SAAS;AACnC,mBAAS;AACT,mBAAS;AACT,qBAAW;AAAA,QACb;AACA,YAAI,cAAc,IAAI,eAAe;AAAA,MACvC;AAAA,IACF;AAAA,IACA,cAAc,SAAS,eAAe;AAGpC,UAAI,CAAC,SAAS;AACZ,YAAI,YAAY,KAAK,QAAQ,iBAAiB,SAAS,OAAO,QAC5D,OAAO,QAAQ,QAAQ,MAAM,yBAAyB,MAAM,SAAS,GACrE,UAAU,KAAK;AAGjB,YAAI,yBAAyB;AAE3B,gCAAsB;AACtB,iBAAO,IAAI,qBAAqB,UAAU,MAAM,YAAY,IAAI,qBAAqB,WAAW,MAAM,UAAU,wBAAwB,UAAU;AAChJ,kCAAsB,oBAAoB;AAAA,UAC5C;AACA,cAAI,wBAAwB,SAAS,QAAQ,wBAAwB,SAAS,iBAAiB;AAC7F,gBAAI,wBAAwB,SAAU,uBAAsB,0BAA0B;AACtF,iBAAK,OAAO,oBAAoB;AAChC,iBAAK,QAAQ,oBAAoB;AAAA,UACnC,OAAO;AACL,kCAAsB,0BAA0B;AAAA,UAClD;AACA,6CAAmC,wBAAwB,mBAAmB;AAAA,QAChF;AACA,kBAAU,OAAO,UAAU,IAAI;AAC/B,oBAAY,SAAS,QAAQ,YAAY,KAAK;AAC9C,oBAAY,SAAS,QAAQ,eAAe,IAAI;AAChD,oBAAY,SAAS,QAAQ,WAAW,IAAI;AAC5C,YAAI,SAAS,cAAc,EAAE;AAC7B,YAAI,SAAS,aAAa,EAAE;AAC5B,YAAI,SAAS,cAAc,YAAY;AACvC,YAAI,SAAS,UAAU,CAAC;AACxB,YAAI,SAAS,OAAO,KAAK,GAAG;AAC5B,YAAI,SAAS,QAAQ,KAAK,IAAI;AAC9B,YAAI,SAAS,SAAS,KAAK,KAAK;AAChC,YAAI,SAAS,UAAU,KAAK,MAAM;AAClC,YAAI,SAAS,WAAW,KAAK;AAC7B,YAAI,SAAS,YAAY,0BAA0B,aAAa,OAAO;AACvE,YAAI,SAAS,UAAU,QAAQ;AAC/B,YAAI,SAAS,iBAAiB,MAAM;AACpC,iBAAS,QAAQ;AACjB,kBAAU,YAAY,OAAO;AAG7B,YAAI,SAAS,oBAAoB,kBAAkB,SAAS,QAAQ,MAAM,KAAK,IAAI,MAAM,OAAO,iBAAiB,SAAS,QAAQ,MAAM,MAAM,IAAI,MAAM,GAAG;AAAA,MAC7J;AAAA,IACF;AAAA,IACA,cAAc,SAAS,aAAwB,KAAiB,UAAU;AACxE,UAAI,QAAQ;AACZ,UAAI,eAAe,IAAI;AACvB,UAAI,UAAU,MAAM;AACpB,MAAAA,aAAY,aAAa,MAAM;AAAA,QAC7B;AAAA,MACF,CAAC;AACD,UAAI,SAAS,eAAe;AAC1B,aAAK,QAAQ;AACb;AAAA,MACF;AACA,MAAAA,aAAY,cAAc,IAAI;AAC9B,UAAI,CAAC,SAAS,eAAe;AAC3B,kBAAU,MAAM,MAAM;AACtB,gBAAQ,gBAAgB,IAAI;AAC5B,gBAAQ,YAAY;AACpB,gBAAQ,MAAM,aAAa,IAAI;AAC/B,aAAK,WAAW;AAChB,oBAAY,SAAS,KAAK,QAAQ,aAAa,KAAK;AACpD,iBAAS,QAAQ;AAAA,MACnB;AAGA,YAAM,UAAU,UAAU,WAAY;AACpC,QAAAA,aAAY,SAAS,KAAK;AAC1B,YAAI,SAAS,cAAe;AAC5B,YAAI,CAAC,MAAM,QAAQ,mBAAmB;AACpC,iBAAO,aAAa,SAAS,MAAM;AAAA,QACrC;AACA,cAAM,WAAW;AACjB,uBAAe;AAAA,UACb,UAAU;AAAA,UACV,MAAM;AAAA,QACR,CAAC;AAAA,MACH,CAAC;AACD,OAAC,YAAY,YAAY,QAAQ,QAAQ,WAAW,IAAI;AAGxD,UAAI,UAAU;AACZ,0BAAkB;AAClB,cAAM,UAAU,YAAY,MAAM,kBAAkB,EAAE;AAAA,MACxD,OAAO;AAEL,YAAI,UAAU,WAAW,MAAM,OAAO;AACtC,YAAI,UAAU,YAAY,MAAM,OAAO;AACvC,YAAI,UAAU,eAAe,MAAM,OAAO;AAC1C,YAAI,cAAc;AAChB,uBAAa,gBAAgB;AAC7B,kBAAQ,WAAW,QAAQ,QAAQ,KAAK,OAAO,cAAc,MAAM;AAAA,QACrE;AACA,WAAG,UAAU,QAAQ,KAAK;AAG1B,YAAI,QAAQ,aAAa,eAAe;AAAA,MAC1C;AACA,4BAAsB;AACtB,YAAM,eAAe,UAAU,MAAM,aAAa,KAAK,OAAO,UAAU,GAAG,CAAC;AAC5E,SAAG,UAAU,eAAe,KAAK;AACjC,cAAQ;AACR,aAAO,aAAa,EAAE,gBAAgB;AACtC,UAAI,QAAQ;AACV,YAAI,SAAS,MAAM,eAAe,MAAM;AAAA,MAC1C;AAAA,IACF;AAAA;AAAA,IAEA,aAAa,SAAS,YAAuB,KAAK;AAChD,UAAI,KAAK,KAAK,IACZ,SAAS,IAAI,QACb,UACA,YACA,QACA,UAAU,KAAK,SACf,QAAQ,QAAQ,OAChB,iBAAiB,SAAS,QAC1B,UAAU,gBAAgB,OAC1B,UAAU,QAAQ,MAClB,eAAe,eAAe,gBAC9B,UACA,QAAQ,MACR,iBAAiB;AACnB,UAAI,QAAS;AACb,eAAS,cAAcT,SAAM,OAAO;AAClC,QAAAS,aAAYT,SAAM,OAAO,eAAe;AAAA,UACtC;AAAA,UACA;AAAA,UACA,MAAM,WAAW,aAAa;AAAA,UAC9B;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA,QAAQ,SAAS,OAAOwB,SAAQC,QAAO;AACrC,mBAAO,QAAQ,QAAQ,IAAI,QAAQ,UAAUD,SAAQ,QAAQA,OAAM,GAAG,KAAKC,MAAK;AAAA,UAClF;AAAA,UACA;AAAA,QACF,GAAG,KAAK,CAAC;AAAA,MACX;AAGA,eAAS,UAAU;AACjB,sBAAc,0BAA0B;AACxC,cAAM,sBAAsB;AAC5B,YAAI,UAAU,cAAc;AAC1B,uBAAa,sBAAsB;AAAA,QACrC;AAAA,MACF;AAGA,eAAS,UAAU,WAAW;AAC5B,sBAAc,qBAAqB;AAAA,UACjC;AAAA,QACF,CAAC;AACD,YAAI,WAAW;AAEb,cAAI,SAAS;AACX,2BAAe,WAAW;AAAA,UAC5B,OAAO;AACL,2BAAe,WAAW,KAAK;AAAA,UACjC;AACA,cAAI,UAAU,cAAc;AAE1B,wBAAY,QAAQ,cAAc,YAAY,QAAQ,aAAa,eAAe,QAAQ,YAAY,KAAK;AAC3G,wBAAY,QAAQ,QAAQ,YAAY,IAAI;AAAA,UAC9C;AACA,cAAI,gBAAgB,SAAS,UAAU,SAAS,QAAQ;AACtD,0BAAc;AAAA,UAChB,WAAW,UAAU,SAAS,UAAU,aAAa;AACnD,0BAAc;AAAA,UAChB;AAGA,cAAI,iBAAiB,OAAO;AAC1B,kBAAM,wBAAwB;AAAA,UAChC;AACA,gBAAM,WAAW,WAAY;AAC3B,0BAAc,2BAA2B;AACzC,kBAAM,wBAAwB;AAAA,UAChC,CAAC;AACD,cAAI,UAAU,cAAc;AAC1B,yBAAa,WAAW;AACxB,yBAAa,wBAAwB;AAAA,UACvC;AAAA,QACF;AAGA,YAAI,WAAW,UAAU,CAAC,OAAO,YAAY,WAAW,MAAM,CAAC,OAAO,UAAU;AAC9E,uBAAa;AAAA,QACf;AAGA,YAAI,CAAC,QAAQ,kBAAkB,CAAC,IAAI,UAAU,WAAW,UAAU;AACjE,iBAAO,WAAW,OAAO,EAAE,iBAAiB,IAAI,MAAM;AAGtD,WAAC,aAAa,8BAA8B,GAAG;AAAA,QACjD;AACA,SAAC,QAAQ,kBAAkB,IAAI,mBAAmB,IAAI,gBAAgB;AACtE,eAAO,iBAAiB;AAAA,MAC1B;AAGA,eAAS,UAAU;AACjB,mBAAW,MAAM,MAAM;AACvB,4BAAoB,MAAM,QAAQ,QAAQ,SAAS;AACnD,uBAAe;AAAA,UACb,UAAU;AAAA,UACV,MAAM;AAAA,UACN,MAAM;AAAA,UACN;AAAA,UACA;AAAA,UACA,eAAe;AAAA,QACjB,CAAC;AAAA,MACH;AACA,UAAI,IAAI,mBAAmB,QAAQ;AACjC,YAAI,cAAc,IAAI,eAAe;AAAA,MACvC;AACA,eAAS,QAAQ,QAAQ,QAAQ,WAAW,IAAI,IAAI;AACpD,oBAAc,UAAU;AACxB,UAAI,SAAS,cAAe,QAAO;AACnC,UAAI,OAAO,SAAS,IAAI,MAAM,KAAK,OAAO,YAAY,OAAO,cAAc,OAAO,cAAc,MAAM,0BAA0B,QAAQ;AACtI,eAAO,UAAU,KAAK;AAAA,MACxB;AACA,wBAAkB;AAClB,UAAI,kBAAkB,CAAC,QAAQ,aAAa,UAAU,YAAY,SAAS,aAAa,UACtF,gBAAgB,SAAS,KAAK,cAAc,YAAY,UAAU,MAAM,gBAAgB,QAAQ,GAAG,MAAM,MAAM,SAAS,MAAM,gBAAgB,QAAQ,GAAG,IAAI;AAC7J,mBAAW,KAAK,cAAc,KAAK,MAAM,MAAM;AAC/C,mBAAW,QAAQ,MAAM;AACzB,sBAAc,eAAe;AAC7B,YAAI,SAAS,cAAe,QAAO;AACnC,YAAI,QAAQ;AACV,qBAAW;AACX,kBAAQ;AACR,eAAK,WAAW;AAChB,wBAAc,QAAQ;AACtB,cAAI,CAAC,SAAS,eAAe;AAC3B,gBAAI,QAAQ;AACV,qBAAO,aAAa,QAAQ,MAAM;AAAA,YACpC,OAAO;AACL,qBAAO,YAAY,MAAM;AAAA,YAC3B;AAAA,UACF;AACA,iBAAO,UAAU,IAAI;AAAA,QACvB;AACA,YAAI,cAAc,UAAU,IAAI,QAAQ,SAAS;AACjD,YAAI,CAAC,eAAe,aAAa,KAAK,UAAU,IAAI,KAAK,CAAC,YAAY,UAAU;AAI9E,cAAI,gBAAgB,QAAQ;AAC1B,mBAAO,UAAU,KAAK;AAAA,UACxB;AAGA,cAAI,eAAe,OAAO,IAAI,QAAQ;AACpC,qBAAS;AAAA,UACX;AACA,cAAI,QAAQ;AACV,yBAAa,QAAQ,MAAM;AAAA,UAC7B;AACA,cAAI,QAAQ,QAAQ,IAAI,QAAQ,UAAU,QAAQ,YAAY,KAAK,CAAC,CAAC,MAAM,MAAM,OAAO;AACtF,oBAAQ;AACR,gBAAI,eAAe,YAAY,aAAa;AAE1C,iBAAG,aAAa,QAAQ,YAAY,WAAW;AAAA,YACjD,OAAO;AACL,iBAAG,YAAY,MAAM;AAAA,YACvB;AACA,uBAAW;AAEX,oBAAQ;AACR,mBAAO,UAAU,IAAI;AAAA,UACvB;AAAA,QACF,WAAW,eAAe,cAAc,KAAK,UAAU,IAAI,GAAG;AAE5D,cAAI,aAAa,SAAS,IAAI,GAAG,SAAS,IAAI;AAC9C,cAAI,eAAe,QAAQ;AACzB,mBAAO,UAAU,KAAK;AAAA,UACxB;AACA,mBAAS;AACT,uBAAa,QAAQ,MAAM;AAC3B,cAAI,QAAQ,QAAQ,IAAI,QAAQ,UAAU,QAAQ,YAAY,KAAK,KAAK,MAAM,OAAO;AACnF,oBAAQ;AACR,eAAG,aAAa,QAAQ,UAAU;AAClC,uBAAW;AAEX,oBAAQ;AACR,mBAAO,UAAU,IAAI;AAAA,UACvB;AAAA,QACF,WAAW,OAAO,eAAe,IAAI;AACnC,uBAAa,QAAQ,MAAM;AAC3B,cAAI,YAAY,GACd,uBACA,iBAAiB,OAAO,eAAe,IACvC,kBAAkB,CAAC,mBAAmB,OAAO,YAAY,OAAO,UAAU,UAAU,OAAO,YAAY,OAAO,UAAU,YAAY,QAAQ,GAC5I,QAAQ,WAAW,QAAQ,QAC3B,kBAAkB,eAAe,QAAQ,OAAO,KAAK,KAAK,eAAe,QAAQ,OAAO,KAAK,GAC7F,eAAe,kBAAkB,gBAAgB,YAAY;AAC/D,cAAI,eAAe,QAAQ;AACzB,oCAAwB,WAAW,KAAK;AACxC,oCAAwB;AACxB,qCAAyB,CAAC,mBAAmB,QAAQ,cAAc;AAAA,UACrE;AACA,sBAAY,kBAAkB,KAAK,QAAQ,YAAY,UAAU,kBAAkB,IAAI,QAAQ,eAAe,QAAQ,yBAAyB,OAAO,QAAQ,gBAAgB,QAAQ,uBAAuB,wBAAwB,eAAe,MAAM;AAC1P,cAAI;AACJ,cAAI,cAAc,GAAG;AAEnB,gBAAI,YAAY,MAAM,MAAM;AAC5B,eAAG;AACD,2BAAa;AACb,wBAAU,SAAS,SAAS,SAAS;AAAA,YACvC,SAAS,YAAY,IAAI,SAAS,SAAS,MAAM,UAAU,YAAY;AAAA,UACzE;AAEA,cAAI,cAAc,KAAK,YAAY,QAAQ;AACzC,mBAAO,UAAU,KAAK;AAAA,UACxB;AACA,uBAAa;AACb,0BAAgB;AAChB,cAAI,cAAc,OAAO,oBACvB,QAAQ;AACV,kBAAQ,cAAc;AACtB,cAAI,aAAa,QAAQ,QAAQ,IAAI,QAAQ,UAAU,QAAQ,YAAY,KAAK,KAAK;AACrF,cAAI,eAAe,OAAO;AACxB,gBAAI,eAAe,KAAK,eAAe,IAAI;AACzC,sBAAQ,eAAe;AAAA,YACzB;AACA,sBAAU;AACV,uBAAW,WAAW,EAAE;AACxB,oBAAQ;AACR,gBAAI,SAAS,CAAC,aAAa;AACzB,iBAAG,YAAY,MAAM;AAAA,YACvB,OAAO;AACL,qBAAO,WAAW,aAAa,QAAQ,QAAQ,cAAc,MAAM;AAAA,YACrE;AAGA,gBAAI,iBAAiB;AACnB,uBAAS,iBAAiB,GAAG,eAAe,gBAAgB,SAAS;AAAA,YACvE;AACA,uBAAW,OAAO;AAGlB,gBAAI,0BAA0B,UAAa,CAAC,wBAAwB;AAClE,mCAAqB,KAAK,IAAI,wBAAwB,QAAQ,MAAM,EAAE,KAAK,CAAC;AAAA,YAC9E;AACA,oBAAQ;AACR,mBAAO,UAAU,IAAI;AAAA,UACvB;AAAA,QACF;AACA,YAAI,GAAG,SAAS,MAAM,GAAG;AACvB,iBAAO,UAAU,KAAK;AAAA,QACxB;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,IACA,uBAAuB;AAAA,IACvB,gBAAgB,SAAS,iBAAiB;AACxC,UAAI,UAAU,aAAa,KAAK,YAAY;AAC5C,UAAI,UAAU,aAAa,KAAK,YAAY;AAC5C,UAAI,UAAU,eAAe,KAAK,YAAY;AAC9C,UAAI,UAAU,YAAY,6BAA6B;AACvD,UAAI,UAAU,aAAa,6BAA6B;AACxD,UAAI,UAAU,aAAa,6BAA6B;AAAA,IAC1D;AAAA,IACA,cAAc,SAAS,eAAe;AACpC,UAAI,gBAAgB,KAAK,GAAG;AAC5B,UAAI,eAAe,WAAW,KAAK,OAAO;AAC1C,UAAI,eAAe,YAAY,KAAK,OAAO;AAC3C,UAAI,eAAe,aAAa,KAAK,OAAO;AAC5C,UAAI,eAAe,iBAAiB,KAAK,OAAO;AAChD,UAAI,eAAe,eAAe,KAAK,OAAO;AAC9C,UAAI,UAAU,eAAe,IAAI;AAAA,IACnC;AAAA,IACA,SAAS,SAAS,QAAmB,KAAK;AACxC,UAAI,KAAK,KAAK,IACZ,UAAU,KAAK;AAGjB,iBAAW,MAAM,MAAM;AACvB,0BAAoB,MAAM,QAAQ,QAAQ,SAAS;AACnD,MAAAhB,aAAY,QAAQ,MAAM;AAAA,QACxB;AAAA,MACF,CAAC;AACD,iBAAW,UAAU,OAAO;AAG5B,iBAAW,MAAM,MAAM;AACvB,0BAAoB,MAAM,QAAQ,QAAQ,SAAS;AACnD,UAAI,SAAS,eAAe;AAC1B,aAAK,SAAS;AACd;AAAA,MACF;AACA,4BAAsB;AACtB,+BAAyB;AACzB,8BAAwB;AACxB,oBAAc,KAAK,OAAO;AAC1B,mBAAa,KAAK,eAAe;AACjC,sBAAgB,KAAK,OAAO;AAC5B,sBAAgB,KAAK,YAAY;AAGjC,UAAI,KAAK,iBAAiB;AACxB,YAAI,UAAU,QAAQ,IAAI;AAC1B,YAAI,IAAI,aAAa,KAAK,YAAY;AAAA,MACxC;AACA,WAAK,eAAe;AACpB,WAAK,aAAa;AAClB,UAAI,QAAQ;AACV,YAAI,SAAS,MAAM,eAAe,EAAE;AAAA,MACtC;AACA,UAAI,QAAQ,aAAa,EAAE;AAC3B,UAAI,KAAK;AACP,YAAI,OAAO;AACT,cAAI,cAAc,IAAI,eAAe;AACrC,WAAC,QAAQ,cAAc,IAAI,gBAAgB;AAAA,QAC7C;AACA,mBAAW,QAAQ,cAAc,QAAQ,WAAW,YAAY,OAAO;AACvE,YAAI,WAAW,YAAY,eAAe,YAAY,gBAAgB,SAAS;AAE7E,qBAAW,QAAQ,cAAc,QAAQ,WAAW,YAAY,OAAO;AAAA,QACzE;AACA,YAAI,QAAQ;AACV,cAAI,KAAK,iBAAiB;AACxB,gBAAI,QAAQ,WAAW,IAAI;AAAA,UAC7B;AACA,4BAAkB,MAAM;AACxB,iBAAO,MAAM,aAAa,IAAI;AAI9B,cAAI,SAAS,CAAC,qBAAqB;AACjC,wBAAY,QAAQ,cAAc,YAAY,QAAQ,aAAa,KAAK,QAAQ,YAAY,KAAK;AAAA,UACnG;AACA,sBAAY,QAAQ,KAAK,QAAQ,aAAa,KAAK;AAGnD,yBAAe;AAAA,YACb,UAAU;AAAA,YACV,MAAM;AAAA,YACN,MAAM;AAAA,YACN,UAAU;AAAA,YACV,mBAAmB;AAAA,YACnB,eAAe;AAAA,UACjB,CAAC;AACD,cAAI,WAAW,UAAU;AACvB,gBAAI,YAAY,GAAG;AAEjB,6BAAe;AAAA,gBACb,QAAQ;AAAA,gBACR,MAAM;AAAA,gBACN,MAAM;AAAA,gBACN,QAAQ;AAAA,gBACR,eAAe;AAAA,cACjB,CAAC;AAGD,6BAAe;AAAA,gBACb,UAAU;AAAA,gBACV,MAAM;AAAA,gBACN,MAAM;AAAA,gBACN,eAAe;AAAA,cACjB,CAAC;AAGD,6BAAe;AAAA,gBACb,QAAQ;AAAA,gBACR,MAAM;AAAA,gBACN,MAAM;AAAA,gBACN,QAAQ;AAAA,gBACR,eAAe;AAAA,cACjB,CAAC;AACD,6BAAe;AAAA,gBACb,UAAU;AAAA,gBACV,MAAM;AAAA,gBACN,MAAM;AAAA,gBACN,eAAe;AAAA,cACjB,CAAC;AAAA,YACH;AACA,2BAAe,YAAY,KAAK;AAAA,UAClC,OAAO;AACL,gBAAI,aAAa,UAAU;AACzB,kBAAI,YAAY,GAAG;AAEjB,+BAAe;AAAA,kBACb,UAAU;AAAA,kBACV,MAAM;AAAA,kBACN,MAAM;AAAA,kBACN,eAAe;AAAA,gBACjB,CAAC;AACD,+BAAe;AAAA,kBACb,UAAU;AAAA,kBACV,MAAM;AAAA,kBACN,MAAM;AAAA,kBACN,eAAe;AAAA,gBACjB,CAAC;AAAA,cACH;AAAA,YACF;AAAA,UACF;AACA,cAAI,SAAS,QAAQ;AAEnB,gBAAI,YAAY,QAAQ,aAAa,IAAI;AACvC,yBAAW;AACX,kCAAoB;AAAA,YACtB;AACA,2BAAe;AAAA,cACb,UAAU;AAAA,cACV,MAAM;AAAA,cACN,MAAM;AAAA,cACN,eAAe;AAAA,YACjB,CAAC;AAGD,iBAAK,KAAK;AAAA,UACZ;AAAA,QACF;AAAA,MACF;AACA,WAAK,SAAS;AAAA,IAChB;AAAA,IACA,UAAU,SAAS,WAAW;AAC5B,MAAAA,aAAY,WAAW,IAAI;AAC3B,eAAS,SAAS,WAAW,UAAU,SAAS,UAAU,aAAa,cAAc,SAAS,WAAW,QAAQ,WAAW,oBAAoB,WAAW,oBAAoB,aAAa,gBAAgB,cAAc,cAAc,SAAS,UAAU,SAAS,QAAQ,SAAS,QAAQ,SAAS,SAAS;AAC/S,wBAAkB,QAAQ,SAAU,IAAI;AACtC,WAAG,UAAU;AAAA,MACf,CAAC;AACD,wBAAkB,SAAS,SAAS,SAAS;AAAA,IAC/C;AAAA,IACA,aAAa,SAAS,YAAuB,KAAK;AAChD,cAAQ,IAAI,MAAM;AAAA,QAChB,KAAK;AAAA,QACL,KAAK;AACH,eAAK,QAAQ,GAAG;AAChB;AAAA,QACF,KAAK;AAAA,QACL,KAAK;AACH,cAAI,QAAQ;AACV,iBAAK,YAAY,GAAG;AACpB,4BAAgB,GAAG;AAAA,UACrB;AACA;AAAA,QACF,KAAK;AACH,cAAI,eAAe;AACnB;AAAA,MACJ;AAAA,IACF;AAAA;AAAA;AAAA;AAAA;AAAA,IAKA,SAAS,SAAS,UAAU;AAC1B,UAAI,QAAQ,CAAC,GACX,IACA,WAAW,KAAK,GAAG,UACnBU,KAAI,GACJ,IAAI,SAAS,QACb,UAAU,KAAK;AACjB,aAAOA,KAAI,GAAGA,MAAK;AACjB,aAAK,SAASA,EAAC;AACf,YAAI,QAAQ,IAAI,QAAQ,WAAW,KAAK,IAAI,KAAK,GAAG;AAClD,gBAAM,KAAK,GAAG,aAAa,QAAQ,UAAU,KAAK,YAAY,EAAE,CAAC;AAAA,QACnE;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA;AAAA;AAAA;AAAA;AAAA,IAKA,MAAM,SAAS,KAAK,OAAO,cAAc;AACvC,UAAI,QAAQ,CAAC,GACXjB,UAAS,KAAK;AAChB,WAAK,QAAQ,EAAE,QAAQ,SAAU,IAAIiB,IAAG;AACtC,YAAI,KAAKjB,QAAO,SAASiB,EAAC;AAC1B,YAAI,QAAQ,IAAI,KAAK,QAAQ,WAAWjB,SAAQ,KAAK,GAAG;AACtD,gBAAM,EAAE,IAAI;AAAA,QACd;AAAA,MACF,GAAG,IAAI;AACP,sBAAgB,KAAK,sBAAsB;AAC3C,YAAM,QAAQ,SAAU,IAAI;AAC1B,YAAI,MAAM,EAAE,GAAG;AACb,UAAAA,QAAO,YAAY,MAAM,EAAE,CAAC;AAC5B,UAAAA,QAAO,YAAY,MAAM,EAAE,CAAC;AAAA,QAC9B;AAAA,MACF,CAAC;AACD,sBAAgB,KAAK,WAAW;AAAA,IAClC;AAAA;AAAA;AAAA;AAAA,IAIA,MAAM,SAAS,OAAO;AACpB,UAAI,QAAQ,KAAK,QAAQ;AACzB,eAAS,MAAM,OAAO,MAAM,IAAI,IAAI;AAAA,IACtC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,SAAS,SAAS,UAAU,IAAI,UAAU;AACxC,aAAO,QAAQ,IAAI,YAAY,KAAK,QAAQ,WAAW,KAAK,IAAI,KAAK;AAAA,IACvE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,QAAQ,SAAS,OAAOF,SAAM,OAAO;AACnC,UAAI,UAAU,KAAK;AACnB,UAAI,UAAU,QAAQ;AACpB,eAAO,QAAQA,OAAI;AAAA,MACrB,OAAO;AACL,YAAI,gBAAgB,cAAc,aAAa,MAAMA,SAAM,KAAK;AAChE,YAAI,OAAO,kBAAkB,aAAa;AACxC,kBAAQA,OAAI,IAAI;AAAA,QAClB,OAAO;AACL,kBAAQA,OAAI,IAAI;AAAA,QAClB;AACA,YAAIA,YAAS,SAAS;AACpB,wBAAc,OAAO;AAAA,QACvB;AAAA,MACF;AAAA,IACF;AAAA;AAAA;AAAA;AAAA,IAIA,SAAS,SAAS,UAAU;AAC1B,MAAAS,aAAY,WAAW,IAAI;AAC3B,UAAI,KAAK,KAAK;AACd,SAAG,OAAO,IAAI;AACd,UAAI,IAAI,aAAa,KAAK,WAAW;AACrC,UAAI,IAAI,cAAc,KAAK,WAAW;AACtC,UAAI,IAAI,eAAe,KAAK,WAAW;AACvC,UAAI,KAAK,iBAAiB;AACxB,YAAI,IAAI,YAAY,IAAI;AACxB,YAAI,IAAI,aAAa,IAAI;AAAA,MAC3B;AAEA,YAAM,UAAU,QAAQ,KAAK,GAAG,iBAAiB,aAAa,GAAG,SAAUiB,KAAI;AAC7E,QAAAA,IAAG,gBAAgB,WAAW;AAAA,MAChC,CAAC;AACD,WAAK,QAAQ;AACb,WAAK,0BAA0B;AAC/B,gBAAU,OAAO,UAAU,QAAQ,KAAK,EAAE,GAAG,CAAC;AAC9C,WAAK,KAAK,KAAK;AAAA,IACjB;AAAA,IACA,YAAY,SAAS,aAAa;AAChC,UAAI,CAAC,aAAa;AAChB,QAAAjB,aAAY,aAAa,IAAI;AAC7B,YAAI,SAAS,cAAe;AAC5B,YAAI,SAAS,WAAW,MAAM;AAC9B,YAAI,KAAK,QAAQ,qBAAqB,QAAQ,YAAY;AACxD,kBAAQ,WAAW,YAAY,OAAO;AAAA,QACxC;AACA,sBAAc;AAAA,MAChB;AAAA,IACF;AAAA,IACA,YAAY,SAAS,WAAWD,cAAa;AAC3C,UAAIA,aAAY,gBAAgB,SAAS;AACvC,aAAK,WAAW;AAChB;AAAA,MACF;AACA,UAAI,aAAa;AACf,QAAAC,aAAY,aAAa,IAAI;AAC7B,YAAI,SAAS,cAAe;AAG5B,YAAI,OAAO,cAAc,UAAU,CAAC,KAAK,QAAQ,MAAM,aAAa;AAClE,iBAAO,aAAa,SAAS,MAAM;AAAA,QACrC,WAAW,QAAQ;AACjB,iBAAO,aAAa,SAAS,MAAM;AAAA,QACrC,OAAO;AACL,iBAAO,YAAY,OAAO;AAAA,QAC5B;AACA,YAAI,KAAK,QAAQ,MAAM,aAAa;AAClC,eAAK,QAAQ,QAAQ,OAAO;AAAA,QAC9B;AACA,YAAI,SAAS,WAAW,EAAE;AAC1B,sBAAc;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AACA,WAAS,gBAA2B,KAAK;AACvC,QAAI,IAAI,cAAc;AACpB,UAAI,aAAa,aAAa;AAAA,IAChC;AACA,QAAI,cAAc,IAAI,eAAe;AAAA,EACvC;AACA,WAAS,QAAQ,QAAQ,MAAMM,SAAQ,UAAU,UAAU,YAAY,eAAe,iBAAiB;AACrG,QAAI,KACF,WAAW,OAAO,OAAO,GACzB,WAAW,SAAS,QAAQ,QAC5B;AAEF,QAAI,OAAO,eAAe,CAAC,cAAc,CAAC,MAAM;AAC9C,YAAM,IAAI,YAAY,QAAQ;AAAA,QAC5B,SAAS;AAAA,QACT,YAAY;AAAA,MACd,CAAC;AAAA,IACH,OAAO;AACL,YAAM,SAAS,YAAY,OAAO;AAClC,UAAI,UAAU,QAAQ,MAAM,IAAI;AAAA,IAClC;AACA,QAAI,KAAK;AACT,QAAI,OAAO;AACX,QAAI,UAAUA;AACd,QAAI,cAAc;AAClB,QAAI,UAAU,YAAY;AAC1B,QAAI,cAAc,cAAc,QAAQ,IAAI;AAC5C,QAAI,kBAAkB;AACtB,QAAI,gBAAgB;AACpB,WAAO,cAAc,GAAG;AACxB,QAAI,UAAU;AACZ,eAAS,SAAS,KAAK,UAAU,KAAK,aAAa;AAAA,IACrD;AACA,WAAO;AAAA,EACT;AACA,WAAS,kBAAkB,IAAI;AAC7B,OAAG,YAAY;AAAA,EACjB;AACA,WAAS,YAAY;AACnB,cAAU;AAAA,EACZ;AACA,WAAS,cAAc,KAAK,UAAU,UAAU;AAC9C,QAAI,cAAc,QAAQ,SAAS,SAAS,IAAI,GAAG,SAAS,SAAS,IAAI,CAAC;AAC1E,QAAI,sBAAsB,kCAAkC,SAAS,IAAI,SAAS,SAAS,OAAO;AAClG,QAAI,SAAS;AACb,WAAO,WAAW,IAAI,UAAU,oBAAoB,OAAO,UAAU,IAAI,UAAU,YAAY,OAAO,IAAI,UAAU,YAAY,QAAQ,IAAI,UAAU,oBAAoB,MAAM,UAAU,IAAI,UAAU,YAAY,UAAU,IAAI,UAAU,YAAY;AAAA,EAC1P;AACA,WAAS,aAAa,KAAK,UAAU,UAAU;AAC7C,QAAI,aAAa,QAAQ,UAAU,SAAS,IAAI,SAAS,QAAQ,SAAS,CAAC;AAC3E,QAAI,sBAAsB,kCAAkC,SAAS,IAAI,SAAS,SAAS,OAAO;AAClG,QAAI,SAAS;AACb,WAAO,WAAW,IAAI,UAAU,oBAAoB,QAAQ,UAAU,IAAI,UAAU,WAAW,UAAU,IAAI,UAAU,WAAW,OAAO,IAAI,UAAU,oBAAoB,SAAS,UAAU,IAAI,UAAU,WAAW,SAAS,IAAI,UAAU,WAAW;AAAA,EAC3P;AACA,WAAS,kBAAkB,KAAK,QAAQ,YAAY,UAAU,eAAe,uBAAuB,YAAY,cAAc;AAC5H,QAAI,cAAc,WAAW,IAAI,UAAU,IAAI,SAC7C,eAAe,WAAW,WAAW,SAAS,WAAW,OACzD,WAAW,WAAW,WAAW,MAAM,WAAW,MAClD,WAAW,WAAW,WAAW,SAAS,WAAW,OACrD,SAAS;AACX,QAAI,CAAC,YAAY;AAEf,UAAI,gBAAgB,qBAAqB,eAAe,eAAe;AAGrE,YAAI,CAAC,0BAA0B,kBAAkB,IAAI,cAAc,WAAW,eAAe,wBAAwB,IAAI,cAAc,WAAW,eAAe,wBAAwB,IAAI;AAE3L,kCAAwB;AAAA,QAC1B;AACA,YAAI,CAAC,uBAAuB;AAE1B,cAAI,kBAAkB,IAAI,cAAc,WAAW,qBACjD,cAAc,WAAW,oBAAoB;AAC7C,mBAAO,CAAC;AAAA,UACV;AAAA,QACF,OAAO;AACL,mBAAS;AAAA,QACX;AAAA,MACF,OAAO;AAEL,YAAI,cAAc,WAAW,gBAAgB,IAAI,iBAAiB,KAAK,cAAc,WAAW,gBAAgB,IAAI,iBAAiB,GAAG;AACtI,iBAAO,oBAAoB,MAAM;AAAA,QACnC;AAAA,MACF;AAAA,IACF;AACA,aAAS,UAAU;AACnB,QAAI,QAAQ;AAEV,UAAI,cAAc,WAAW,eAAe,wBAAwB,KAAK,cAAc,WAAW,eAAe,wBAAwB,GAAG;AAC1I,eAAO,cAAc,WAAW,eAAe,IAAI,IAAI;AAAA,MACzD;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAQA,WAAS,oBAAoB,QAAQ;AACnC,QAAI,MAAM,MAAM,IAAI,MAAM,MAAM,GAAG;AACjC,aAAO;AAAA,IACT,OAAO;AACL,aAAO;AAAA,IACT;AAAA,EACF;AAQA,WAAS,YAAY,IAAI;AACvB,QAAI,MAAM,GAAG,UAAU,GAAG,YAAY,GAAG,MAAM,GAAG,OAAO,GAAG,aAC1DI,KAAI,IAAI,QACRQ,OAAM;AACR,WAAOR,MAAK;AACV,MAAAQ,QAAO,IAAI,WAAWR,EAAC;AAAA,IACzB;AACA,WAAOQ,KAAI,SAAS,EAAE;AAAA,EACxB;AACA,WAAS,uBAAuB,MAAM;AACpC,sBAAkB,SAAS;AAC3B,QAAI,SAAS,KAAK,qBAAqB,OAAO;AAC9C,QAAI,MAAM,OAAO;AACjB,WAAO,OAAO;AACZ,UAAI,KAAK,OAAO,GAAG;AACnB,SAAG,WAAW,kBAAkB,KAAK,EAAE;AAAA,IACzC;AAAA,EACF;AACA,WAAS,UAAU,IAAI;AACrB,WAAO,WAAW,IAAI,CAAC;AAAA,EACzB;AACA,WAAS,gBAAgB,IAAI;AAC3B,WAAO,aAAa,EAAE;AAAA,EACxB;AAGA,MAAI,gBAAgB;AAClB,OAAG,UAAU,aAAa,SAAU,KAAK;AACvC,WAAK,SAAS,UAAU,wBAAwB,IAAI,YAAY;AAC9D,YAAI,eAAe;AAAA,MACrB;AAAA,IACF,CAAC;AAAA,EACH;AAGA,WAAS,QAAQ;AAAA,IACf;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,IAAI,SAAS,GAAG,IAAI,UAAU;AAC5B,aAAO,CAAC,CAAC,QAAQ,IAAI,UAAU,IAAI,KAAK;AAAA,IAC1C;AAAA,IACA,QAAQC;AAAA,IACR;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAU;AAAA,IACV,gBAAgB;AAAA,IAChB,iBAAiB;AAAA,IACjB;AAAA,IACA;AAAA,EACF;AAOA,WAAS,MAAM,SAAU,SAAS;AAChC,WAAO,QAAQ,OAAO;AAAA,EACxB;AAMA,WAAS,QAAQ,WAAY;AAC3B,aAAS,OAAO,UAAU,QAAQC,WAAU,IAAI,MAAM,IAAI,GAAG,OAAO,GAAG,OAAO,MAAM,QAAQ;AAC1F,MAAAA,SAAQ,IAAI,IAAI,UAAU,IAAI;AAAA,IAChC;AACA,QAAIA,SAAQ,CAAC,EAAE,gBAAgB,MAAO,CAAAA,WAAUA,SAAQ,CAAC;AACzD,IAAAA,SAAQ,QAAQ,SAAU,QAAQ;AAChC,UAAI,CAAC,OAAO,aAAa,CAAC,OAAO,UAAU,aAAa;AACtD,cAAM,gEAAgE,OAAO,CAAC,EAAE,SAAS,KAAK,MAAM,CAAC;AAAA,MACvG;AACA,UAAI,OAAO,MAAO,UAAS,QAAQ,eAAe,eAAe,CAAC,GAAG,SAAS,KAAK,GAAG,OAAO,KAAK;AAClG,oBAAc,MAAM,MAAM;AAAA,IAC5B,CAAC;AAAA,EACH;AAOA,WAAS,SAAS,SAAU,IAAI,SAAS;AACvC,WAAO,IAAI,SAAS,IAAI,OAAO;AAAA,EACjC;AAGA,WAAS,UAAU;AAEnB,MAAI,cAAc,CAAC;AAAnB,MACE;AADF,MAEE;AAFF,MAGE,YAAY;AAHd,MAIE;AAJF,MAKE;AALF,MAME;AANF,MAOE;AACF,WAAS,mBAAmB;AAC1B,aAAS,aAAa;AACpB,WAAK,WAAW;AAAA,QACd,QAAQ;AAAA,QACR,yBAAyB;AAAA,QACzB,mBAAmB;AAAA,QACnB,aAAa;AAAA,QACb,cAAc;AAAA,MAChB;AAGA,eAAS,MAAM,MAAM;AACnB,YAAI,GAAG,OAAO,CAAC,MAAM,OAAO,OAAO,KAAK,EAAE,MAAM,YAAY;AAC1D,eAAK,EAAE,IAAI,KAAK,EAAE,EAAE,KAAK,IAAI;AAAA,QAC/B;AAAA,MACF;AAAA,IACF;AACA,eAAW,YAAY;AAAA,MACrB,aAAa,SAAS,YAAY,MAAM;AACtC,YAAI,gBAAgB,KAAK;AACzB,YAAI,KAAK,SAAS,iBAAiB;AACjC,aAAG,UAAU,YAAY,KAAK,iBAAiB;AAAA,QACjD,OAAO;AACL,cAAI,KAAK,QAAQ,gBAAgB;AAC/B,eAAG,UAAU,eAAe,KAAK,yBAAyB;AAAA,UAC5D,WAAW,cAAc,SAAS;AAChC,eAAG,UAAU,aAAa,KAAK,yBAAyB;AAAA,UAC1D,OAAO;AACL,eAAG,UAAU,aAAa,KAAK,yBAAyB;AAAA,UAC1D;AAAA,QACF;AAAA,MACF;AAAA,MACA,mBAAmB,SAAS,kBAAkB,OAAO;AACnD,YAAI,gBAAgB,MAAM;AAE1B,YAAI,CAAC,KAAK,QAAQ,kBAAkB,CAAC,cAAc,QAAQ;AACzD,eAAK,kBAAkB,aAAa;AAAA,QACtC;AAAA,MACF;AAAA,MACA,MAAM,SAASC,QAAO;AACpB,YAAI,KAAK,SAAS,iBAAiB;AACjC,cAAI,UAAU,YAAY,KAAK,iBAAiB;AAAA,QAClD,OAAO;AACL,cAAI,UAAU,eAAe,KAAK,yBAAyB;AAC3D,cAAI,UAAU,aAAa,KAAK,yBAAyB;AACzD,cAAI,UAAU,aAAa,KAAK,yBAAyB;AAAA,QAC3D;AACA,wCAAgC;AAChC,yBAAiB;AACjB,uBAAe;AAAA,MACjB;AAAA,MACA,SAAS,SAAS,UAAU;AAC1B,qBAAa,eAAe,WAAW,YAAY,6BAA6B,kBAAkB,kBAAkB;AACpH,oBAAY,SAAS;AAAA,MACvB;AAAA,MACA,2BAA2B,SAAS,0BAA0B,KAAK;AACjE,aAAK,kBAAkB,KAAK,IAAI;AAAA,MAClC;AAAA,MACA,mBAAmB,SAAS,kBAAkB,KAAK,UAAU;AAC3D,YAAI,QAAQ;AACZ,YAAI,KAAK,IAAI,UAAU,IAAI,QAAQ,CAAC,IAAI,KAAK,SAC3C,KAAK,IAAI,UAAU,IAAI,QAAQ,CAAC,IAAI,KAAK,SACzC,OAAO,SAAS,iBAAiB,GAAG,CAAC;AACvC,qBAAa;AAMb,YAAI,YAAY,KAAK,QAAQ,2BAA2B,QAAQ,cAAc,QAAQ;AACpF,qBAAW,KAAK,KAAK,SAAS,MAAM,QAAQ;AAG5C,cAAI,iBAAiB,2BAA2B,MAAM,IAAI;AAC1D,cAAI,cAAc,CAAC,8BAA8B,MAAM,mBAAmB,MAAM,kBAAkB;AAChG,0CAA8B,gCAAgC;AAE9D,yCAA6B,YAAY,WAAY;AACnD,kBAAI,UAAU,2BAA2B,SAAS,iBAAiB,GAAG,CAAC,GAAG,IAAI;AAC9E,kBAAI,YAAY,gBAAgB;AAC9B,iCAAiB;AACjB,iCAAiB;AAAA,cACnB;AACA,yBAAW,KAAK,MAAM,SAAS,SAAS,QAAQ;AAAA,YAClD,GAAG,EAAE;AACL,8BAAkB;AAClB,8BAAkB;AAAA,UACpB;AAAA,QACF,OAAO;AAEL,cAAI,CAAC,KAAK,QAAQ,gBAAgB,2BAA2B,MAAM,IAAI,MAAM,0BAA0B,GAAG;AACxG,6BAAiB;AACjB;AAAA,UACF;AACA,qBAAW,KAAK,KAAK,SAAS,2BAA2B,MAAM,KAAK,GAAG,KAAK;AAAA,QAC9E;AAAA,MACF;AAAA,IACF;AACA,WAAO,SAAS,YAAY;AAAA,MAC1B,YAAY;AAAA,MACZ,qBAAqB;AAAA,IACvB,CAAC;AAAA,EACH;AACA,WAAS,mBAAmB;AAC1B,gBAAY,QAAQ,SAAUC,aAAY;AACxC,oBAAcA,YAAW,GAAG;AAAA,IAC9B,CAAC;AACD,kBAAc,CAAC;AAAA,EACjB;AACA,WAAS,kCAAkC;AACzC,kBAAc,0BAA0B;AAAA,EAC1C;AACA,MAAI,aAAa,SAAS,SAAU,KAAK,SAAS7B,SAAQ,YAAY;AAEpE,QAAI,CAAC,QAAQ,OAAQ;AACrB,QAAI,KAAK,IAAI,UAAU,IAAI,QAAQ,CAAC,IAAI,KAAK,SAC3C,KAAK,IAAI,UAAU,IAAI,QAAQ,CAAC,IAAI,KAAK,SACzC,OAAO,QAAQ,mBACf,QAAQ,QAAQ,aAChB,cAAc,0BAA0B;AAC1C,QAAI,qBAAqB,OACvB;AAGF,QAAI,iBAAiBA,SAAQ;AAC3B,qBAAeA;AACf,uBAAiB;AACjB,iBAAW,QAAQ;AACnB,uBAAiB,QAAQ;AACzB,UAAI,aAAa,MAAM;AACrB,mBAAW,2BAA2BA,SAAQ,IAAI;AAAA,MACpD;AAAA,IACF;AACA,QAAI,YAAY;AAChB,QAAI,gBAAgB;AACpB,OAAG;AACD,UAAI,KAAK,eACP,OAAO,QAAQ,EAAE,GACjB,MAAM,KAAK,KACX,SAAS,KAAK,QACd,OAAO,KAAK,MACZ,QAAQ,KAAK,OACb,QAAQ,KAAK,OACb,SAAS,KAAK,QACd,aAAa,QACb,aAAa,QACb,cAAc,GAAG,aACjB,eAAe,GAAG,cAClB,QAAQ,IAAI,EAAE,GACd,aAAa,GAAG,YAChB,aAAa,GAAG;AAClB,UAAI,OAAO,aAAa;AACtB,qBAAa,QAAQ,gBAAgB,MAAM,cAAc,UAAU,MAAM,cAAc,YAAY,MAAM,cAAc;AACvH,qBAAa,SAAS,iBAAiB,MAAM,cAAc,UAAU,MAAM,cAAc,YAAY,MAAM,cAAc;AAAA,MAC3H,OAAO;AACL,qBAAa,QAAQ,gBAAgB,MAAM,cAAc,UAAU,MAAM,cAAc;AACvF,qBAAa,SAAS,iBAAiB,MAAM,cAAc,UAAU,MAAM,cAAc;AAAA,MAC3F;AACA,UAAI,KAAK,eAAe,KAAK,IAAI,QAAQ,CAAC,KAAK,QAAQ,aAAa,QAAQ,gBAAgB,KAAK,IAAI,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC;AAC5H,UAAI,KAAK,eAAe,KAAK,IAAI,SAAS,CAAC,KAAK,QAAQ,aAAa,SAAS,iBAAiB,KAAK,IAAI,MAAM,CAAC,KAAK,QAAQ,CAAC,CAAC;AAC9H,UAAI,CAAC,YAAY,SAAS,GAAG;AAC3B,iBAASiB,KAAI,GAAGA,MAAK,WAAWA,MAAK;AACnC,cAAI,CAAC,YAAYA,EAAC,GAAG;AACnB,wBAAYA,EAAC,IAAI,CAAC;AAAA,UACpB;AAAA,QACF;AAAA,MACF;AACA,UAAI,YAAY,SAAS,EAAE,MAAM,MAAM,YAAY,SAAS,EAAE,MAAM,MAAM,YAAY,SAAS,EAAE,OAAO,IAAI;AAC1G,oBAAY,SAAS,EAAE,KAAK;AAC5B,oBAAY,SAAS,EAAE,KAAK;AAC5B,oBAAY,SAAS,EAAE,KAAK;AAC5B,sBAAc,YAAY,SAAS,EAAE,GAAG;AACxC,YAAI,MAAM,KAAK,MAAM,GAAG;AACtB,+BAAqB;AAErB,sBAAY,SAAS,EAAE,MAAM,YAAY,WAAY;AAEnD,gBAAI,cAAc,KAAK,UAAU,GAAG;AAClC,uBAAS,OAAO,aAAa,UAAU;AAAA,YACzC;AACA,gBAAI,gBAAgB,YAAY,KAAK,KAAK,EAAE,KAAK,YAAY,KAAK,KAAK,EAAE,KAAK,QAAQ;AACtF,gBAAI,gBAAgB,YAAY,KAAK,KAAK,EAAE,KAAK,YAAY,KAAK,KAAK,EAAE,KAAK,QAAQ;AACtF,gBAAI,OAAO,mBAAmB,YAAY;AACxC,kBAAI,eAAe,KAAK,SAAS,QAAQ,WAAW,OAAO,GAAG,eAAe,eAAe,KAAK,YAAY,YAAY,KAAK,KAAK,EAAE,EAAE,MAAM,YAAY;AACvJ;AAAA,cACF;AAAA,YACF;AACA,qBAAS,YAAY,KAAK,KAAK,EAAE,IAAI,eAAe,aAAa;AAAA,UACnE,EAAE,KAAK;AAAA,YACL,OAAO;AAAA,UACT,CAAC,GAAG,EAAE;AAAA,QACR;AAAA,MACF;AACA;AAAA,IACF,SAAS,QAAQ,gBAAgB,kBAAkB,gBAAgB,gBAAgB,2BAA2B,eAAe,KAAK;AAClI,gBAAY;AAAA,EACd,GAAG,EAAE;AAEL,MAAI,OAAO,SAASW,MAAK,MAAM;AAC7B,QAAI,gBAAgB,KAAK,eACvBtB,eAAc,KAAK,aACnBO,UAAS,KAAK,QACd,iBAAiB,KAAK,gBACtB,wBAAwB,KAAK,uBAC7B,qBAAqB,KAAK,oBAC1B,uBAAuB,KAAK;AAC9B,QAAI,CAAC,cAAe;AACpB,QAAI,aAAaP,gBAAe;AAChC,uBAAmB;AACnB,QAAI,QAAQ,cAAc,kBAAkB,cAAc,eAAe,SAAS,cAAc,eAAe,CAAC,IAAI;AACpH,QAAI,SAAS,SAAS,iBAAiB,MAAM,SAAS,MAAM,OAAO;AACnE,yBAAqB;AACrB,QAAI,cAAc,CAAC,WAAW,GAAG,SAAS,MAAM,GAAG;AACjD,4BAAsB,OAAO;AAC7B,WAAK,QAAQ;AAAA,QACX,QAAQO;AAAA,QACR,aAAaP;AAAA,MACf,CAAC;AAAA,IACH;AAAA,EACF;AACA,WAAS,SAAS;AAAA,EAAC;AACnB,SAAO,YAAY;AAAA,IACjB,YAAY;AAAA,IACZ,WAAW,SAAS,UAAU,OAAO;AACnC,UAAIF,qBAAoB,MAAM;AAC9B,WAAK,aAAaA;AAAA,IACpB;AAAA,IACA,SAAS,SAAS,QAAQ,OAAO;AAC/B,UAAIS,UAAS,MAAM,QACjBP,eAAc,MAAM;AACtB,WAAK,SAAS,sBAAsB;AACpC,UAAIA,cAAa;AACf,QAAAA,aAAY,sBAAsB;AAAA,MACpC;AACA,UAAI,cAAc,SAAS,KAAK,SAAS,IAAI,KAAK,YAAY,KAAK,OAAO;AAC1E,UAAI,aAAa;AACf,aAAK,SAAS,GAAG,aAAaO,SAAQ,WAAW;AAAA,MACnD,OAAO;AACL,aAAK,SAAS,GAAG,YAAYA,OAAM;AAAA,MACrC;AACA,WAAK,SAAS,WAAW;AACzB,UAAIP,cAAa;AACf,QAAAA,aAAY,WAAW;AAAA,MACzB;AAAA,IACF;AAAA,IACA;AAAA,EACF;AACA,WAAS,QAAQ;AAAA,IACf,YAAY;AAAA,EACd,CAAC;AACD,WAAS,SAAS;AAAA,EAAC;AACnB,SAAO,YAAY;AAAA,IACjB,SAAS,SAASwB,SAAQ,OAAO;AAC/B,UAAIjB,UAAS,MAAM,QACjBP,eAAc,MAAM;AACtB,UAAI,iBAAiBA,gBAAe,KAAK;AACzC,qBAAe,sBAAsB;AACrC,MAAAO,QAAO,cAAcA,QAAO,WAAW,YAAYA,OAAM;AACzD,qBAAe,WAAW;AAAA,IAC5B;AAAA,IACA;AAAA,EACF;AACA,WAAS,QAAQ;AAAA,IACf,YAAY;AAAA,EACd,CAAC;AAkqBD,WAAS,MAAM,IAAI,iBAAiB,CAAC;AACrC,WAAS,MAAM,QAAQ,MAAM;AAE7B,MAAO,uBAAQ;;;AC7yGf,MAAO,8BAAP,cAA6B,WAAW;AAAA,IACtC,OAAO,SAAS;AAAA,MACd,QAAQ;AAAA,MACR,WAAW,EAAE,MAAM,QAAQ,SAAS,IAAI;AAAA,IAC1C;AAAA,IAEA,UAAU;AACR,WAAK,WAAW,qBAAS,OAAO,KAAK,SAAS;AAAA,QAC5C,QAAQ,KAAK,iBAAiB,KAAK,cAAc;AAAA,QACjD,WAAW,KAAK;AAAA,QAChB,OAAO,KAAK,IAAI,KAAK,IAAI;AAAA,MAC3B,CAAC;AAED,WAAK,gBAAgB;AAGrB,WAAK,qBAAqB,KAAK,mBAAmB,KAAK,IAAI;AAC3D,WAAK,qBAAqB,KAAK,mBAAmB,KAAK,IAAI;AAE3D,WAAK,QAAQ,iBAAiB,uBAAuB,KAAK,kBAAkB;AAC5E,WAAK,QAAQ,iBAAiB,uBAAuB,KAAK,kBAAkB;AAG5E,WAAK,WAAW,IAAI,iBAAiB,CAAC,cAAc;AAClD,YAAI,eAAe;AACnB,kBAAU,QAAQ,CAAC,aAAa;AAC9B,cAAI,SAAS,SAAS,gBAAgB,SAAS,WAAW,SAAS,KAAK,SAAS,aAAa,SAAS,IAAI;AACzG,2BAAe;AAAA,UACjB;AAAA,QACF,CAAC;AACD,YAAI,cAAc;AAChB,gCAAsB,MAAM;AAC1B,iBAAK,gBAAgB;AAAA,UACvB,CAAC;AAAA,QACH;AAAA,MACF,CAAC;AAED,WAAK,SAAS,QAAQ,KAAK,SAAS;AAAA,QAClC,WAAW;AAAA,QACX,SAAS;AAAA,MACX,CAAC;AAAA,IACH;AAAA,IAEA,aAAa;AACX,UAAI,KAAK,UAAU;AACjB,aAAK,SAAS,QAAQ;AAAA,MACxB;AAEA,UAAI,KAAK,UAAU;AACjB,aAAK,SAAS,WAAW;AAAA,MAC3B;AAEA,WAAK,QAAQ,oBAAoB,uBAAuB,KAAK,kBAAkB;AAC/E,WAAK,QAAQ,oBAAoB,uBAAuB,KAAK,kBAAkB;AAAA,IACjF;AAAA,IAEA,IAAI,OAAO;AACT,WAAK,gBAAgB;AAAA,IACvB;AAAA,IAEA,mBAAmB,OAAO;AAExB,4BAAsB,MAAM;AAC1B,aAAK,gBAAgB;AAAA,MACvB,CAAC;AAAA,IACH;AAAA,IAEA,mBAAmB,OAAO;AAExB,4BAAsB,MAAM;AAC1B,aAAK,gBAAgB;AAAA,MACvB,CAAC;AAAA,IACH;AAAA,IAEA,kBAAkB;AAChB,YAAM,QAAQ,KAAK,QAAQ,iBAAiB,2EAA2E;AAEvH,YAAM,QAAQ,CAAC,MAAMkB,WAAU;AAC7B,cAAM,gBAAgB,KAAK,cAAc,2BAA2B;AACpE,cAAM,kBAAkB,KAAK,cAAc,mBAAmB;AAE9D,cAAM,cAAcA,SAAQ;AAE5B,YAAI,eAAe;AACjB,wBAAc,QAAQ;AAAA,QACxB;AAEA,YAAI,iBAAiB;AACnB,0BAAgB,cAAc;AAAA,QAChC;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;;;AC7FA,MAAO,0CAAP,cAA6B,WAAW;AAAA,IACtC,OAAO,SAAS;AAAA,MACd,UAAU;AAAA,IACZ;AAAA,IAEA,UAAU;AACR,WAAK,kBAAkB,KAAK,kBAAkB,OAAO,UAAU;AAC/D,WAAK,mBAAmB;AAAA,IAC1B;AAAA,IAEA,qBAAqB;AACnB,YAAM,OAAO,KAAK,QAAQ,cAAc,MAAM;AAC9C,UAAI,MAAM;AACR,cAAM,SAAS,CAAC,yBAAyB,oBAAoB,qBAAqB;AAClF,eAAO,QAAQ,aAAW;AACxB,gBAAM,QAAQ,SAAS,eAAe,OAAO;AAC7C,cAAI,OAAO;AACT,kBAAM,iBAAiB,SAAS,MAAM,KAAK,iBAAiB,CAAC;AAC7D,kBAAM,iBAAiB,UAAU,MAAM,KAAK,iBAAiB,CAAC;AAAA,UAChE;AAAA,QACF,CAAC;AAED,cAAM,YAAY,KAAK,cAAc,8BAA8B;AACnE,YAAI,WAAW;AACb,oBAAU,iBAAiB,UAAU,MAAM,KAAK,iBAAiB,CAAC;AAClE,oBAAU,iBAAiB,SAAS,MAAM,KAAK,iBAAiB,CAAC;AAAA,QACnE;AAAA,MACF;AAAA,IACF;AAAA,IAEA,mBAAmB;AAEjB,YAAM,eAAe,SAAS,eAAe,kBAAkB;AAC/D,UAAI,cAAc;AAChB,qBAAa,QAAQ,KAAK,YAAY,aAAa,KAAK;AAAA,MAC1D;AAGA,YAAM,oBAAoB,SAAS,eAAe,uBAAuB;AACzE,UAAI,mBAAmB;AACrB,0BAAkB,QAAQ,KAAK,YAAY,kBAAkB,KAAK;AAAA,MACpE;AAGA,YAAM,oBAAoB,SAAS,cAAc,kBAAkB;AACnE,UAAI,mBAAmB;AACrB,cAAM,WAAW,kBAAkB;AACnC,YAAI,OAAO,WAAW,OAAO,QAAQ,IAAI,QAAQ,GAAG;AAClD,gBAAM,SAAS,OAAO,QAAQ,IAAI,QAAQ;AAC1C,gBAAM,iBAAiB,OAAO,WAAW;AACzC,iBAAO,WAAW,KAAK,kBAAkB,cAAc,CAAC;AAAA,QAC1D,OAAO;AAEL,4BAAkB,QAAQ,KAAK,kBAAkB,kBAAkB,KAAK;AAAA,QAC1E;AAAA,MACF;AAGA,YAAM,oBAAoB,SAAS,eAAe,uBAAuB;AACzE,UAAI,mBAAmB;AACrB,0BAAkB,QAAQ,KAAK,YAAY,kBAAkB,KAAK;AAAA,MACpE;AAGA,WAAK,iBAAiB;AAAA,IACxB;AAAA,IAEA,mBAAmB;AACjB,YAAM,aAAa,SAAS,eAAe,kBAAkB;AAC7D,UAAI,CAAC,WAAY;AAEjB,YAAM,kBAAkB,SAAS,eAAe,qBAAqB;AACrE,YAAM,oBAAoB,SAAS,cAAc,sCAAsC,KAC7D,SAAS,cAAc,8BAA8B,KACrD,SAAS,cAAc,wBAAwB;AACzE,YAAM,oBAAoB,SAAS,eAAe,uBAAuB;AACzE,YAAM,eAAe,SAAS,eAAe,kBAAkB;AAE/D,YAAM,aAAa,kBAAkB,gBAAgB,QAAQ;AAC7D,UAAI,eAAe;AACnB,UAAI,mBAAmB;AACrB,YAAI,kBAAkB,SAAS,UAAU;AACvC,yBAAe,kBAAkB;AAAA,QACnC,OAAO;AACL,yBAAe,kBAAkB;AAAA,QACnC;AAAA,MACF;AACA,YAAM,eAAe,oBAAoB,kBAAkB,QAAQ;AACnE,YAAM,UAAU,eAAe,aAAa,QAAQ;AAEpD,YAAM,UAAU,WAAW,aAAa,MAAM,EAAE,MAAM,GAAG,EAAE,CAAC;AAC5D,YAAM,SAAS,IAAI,gBAAgB;AACnC,UAAI,WAAY,QAAO,OAAO,eAAe,UAAU;AACvD,UAAI,aAAc,QAAO,OAAO,iBAAiB,YAAY;AAC7D,UAAI,aAAc,QAAO,OAAO,iBAAiB,YAAY;AAC7D,UAAI,QAAS,QAAO,OAAO,YAAY,OAAO;AAE9C,iBAAW,aAAa,QAAQ,GAAG,OAAO,IAAI,OAAO,SAAS,CAAC,EAAE;AAAA,IACnE;AAAA,IAEA,YAAY,MAAM;AAChB,UAAI,CAAC,KAAM,QAAO;AAElB,UAAI,SAAS;AAGb,UAAI,KAAK,kBAAkB,MAAM;AAE/B,iBAAS,OAAO,QAAQ,2BAA2B,CAAC,UAAU;AAC5D,iBAAO,KAAK,uBAAuB,OAAO,OAAO;AAAA,QACnD,CAAC;AAED,iBAAS,OAAO,QAAQ,wBAAwB,CAAC,UAAU;AACzD,iBAAO,KAAK,uBAAuB,OAAO,OAAO;AAAA,QACnD,CAAC;AAAA,MACH;AAKA,eAAS,OAAO,QAAQ,iBAAiB,CAAC,UAAU;AAClD,eAAO,KAAK,uBAAuB,OAAO,KAAK,eAAe;AAAA,MAChE,CAAC;AACD,eAAS,OAAO,QAAQ,cAAc,CAAC,UAAU;AAC/C,eAAO,KAAK,uBAAuB,OAAO,KAAK,eAAe;AAAA,MAChE,CAAC;AAED,aAAO;AAAA,IACT;AAAA,IAEA,kBAAkB,MAAM;AACtB,UAAI,CAAC,KAAM,QAAO;AAIlB,UAAI,SAAS;AAGb,UAAI,KAAK,kBAAkB,MAAM;AAE/B,iBAAS,OAAO,QAAQ,2BAA2B,CAAC,UAAU;AAC5D,iBAAO,KAAK,uBAAuB,OAAO,OAAO;AAAA,QACnD,CAAC;AAED,iBAAS,OAAO,QAAQ,wBAAwB,CAAC,UAAU;AACzD,iBAAO,KAAK,uBAAuB,OAAO,OAAO;AAAA,QACnD,CAAC;AAAA,MACH;AAGA,eAAS,OAAO,QAAQ,iBAAiB,CAAC,UAAU;AAClD,eAAO,KAAK,uBAAuB,OAAO,KAAK,eAAe;AAAA,MAChE,CAAC;AAED,eAAS,OAAO,QAAQ,cAAc,CAAC,UAAU;AAC/C,eAAO,KAAK,uBAAuB,OAAO,KAAK,eAAe;AAAA,MAChE,CAAC;AAED,aAAO;AAAA,IACT;AAAA,IAEA,uBAAuB,UAAU,aAAa;AAC5C,UAAI,SAAS,CAAC,MAAM,SAAS,CAAC,EAAE,YAAY,GAAG;AAC7C,eAAO,YAAY,OAAO,CAAC,EAAE,YAAY,IAAI,YAAY,MAAM,CAAC;AAAA,MAClE;AACA,aAAO;AAAA,IACT;AAAA,EACF;;;ACvKA,MAAO,iDAAP,cAA6B,WAAW;AAAA,IACtC,OAAO,UAAU,CAAC,sBAAsB,gBAAgB;AAAA,IAExD,UAAU;AACR,WAAK,WAAW;AAAA,IAClB;AAAA,IAEA,aAAa;AACX,YAAM,qBAAqB,KAAK;AAEhC,UAAI,CAAC,mBAAoB;AAEzB,UAAI,OAAO,KAAK,OAAO,EAAE,kBAAkB,EAAE,SAAS,2BAA2B,GAAG;AAClF,eAAO,EAAE,kBAAkB,EAAE,GAAG,kBAAkB,CAACC,OAAM;AACvD,eAAK,yBAAyBA,EAAC;AAAA,QACjC,CAAC;AAAA,MACH,OAAO;AACL,2BAAmB,iBAAiB,UAAU,CAACA,OAAM;AACnD,eAAK,yBAAyBA,EAAC;AAAA,QACjC,CAAC;AAAA,MACH;AAAA,IACF;AAAA,IAEA,yBAAyB,OAAO;AAC9B,UAAI,CAAC,KAAK,wBAAyB;AAEnC,YAAM,qBAAqB,MAAM,UAAU,KAAK;AAChD,YAAM,gBAAgB,mBAAmB;AACzC,YAAM,iBAAiB,KAAK;AAE5B,UAAI,CAAC,cAAe;AAEpB,UAAI,OAAO,KAAK,OAAO,EAAE,cAAc,EAAE,SAAS,2BAA2B,GAAG;AAC9E,eAAO,EAAE,cAAc,EAAE,IAAI,aAAa,EAAE,QAAQ,QAAQ;AAAA,MAC9D,OAAO;AACL,uBAAe,QAAQ;AACvB,cAAM,cAAc,IAAI,MAAM,UAAU,EAAE,SAAS,KAAK,CAAC;AACzD,uBAAe,cAAc,WAAW;AAAA,MAC1C;AAAA,IACF;AAAA,IAEA,aAAa;AACX,YAAM,qBAAqB,KAAK;AAChC,UAAI,sBAAsB,OAAO,KAAK,OAAO,EAAE,kBAAkB,EAAE,SAAS,2BAA2B,GAAG;AACxG,eAAO,EAAE,kBAAkB,EAAE,IAAI,gBAAgB;AAAA,MACnD;AAAA,IACF;AAAA,EACF;;;AC/CA,MAAO,2CAAP,cAA6B,WAAW;AAAA,IACtC,OAAO,UAAU,CAAC,mBAAmB,iBAAiB,aAAa;AAAA,IAEnE,UAAU;AACR,UAAI,KAAK,0BAA0B;AACjC,aAAK,gBAAgB,KAAK,sBAAsB;AAChD,aAAK,eAAe;AAAA,MACtB;AAGA,WAAK,iBAAiB;AAEtB,WAAK,kBAAkB;AAGvB,UAAI,KAAK,sBAAsB;AAC7B,cAAM,gBAAgB,EAAE,KAAK,iBAAiB,EAAE,IAAI;AACpD,YAAI,eAAe;AACjB,eAAK,qBAAqB,aAAa;AAAA,QACzC;AAAA,MACF;AAAA,IACF;AAAA,IAEA,iBAAiB;AACf,WAAK,sBAAsB,iBAAiB,UAAU,KAAK,4BAA4B,KAAK,IAAI,CAAC;AAAA,IACnG;AAAA,IAEA,oBAAoB;AAClB,UAAI,KAAK,sBAAsB;AAC7B,cAAM,aAAa,KAAK;AACxB,UAAE,UAAU,EAAE,GAAG,kBAAkB,KAAK,iBAAiB,KAAK,IAAI,CAAC;AACnE,UAAE,UAAU,EAAE,GAAG,oBAAoB,KAAK,gBAAgB,KAAK,IAAI,CAAC;AACpE,UAAE,UAAU,EAAE,GAAG,iBAAiB,KAAK,gBAAgB,KAAK,IAAI,CAAC;AAAA,MACnE;AAAA,IACF;AAAA,IAEA,iBAAiB,OAAO;AACtB,YAAM,SAAS,MAAM,OAAO,KAAK;AACjC,UAAI,CAAC,QAAQ;AACX,aAAK,iBAAiB;AACtB;AAAA,MACF;AAEA,WAAK,qBAAqB,MAAM;AAAA,IAClC;AAAA,IAEA,kBAAkB;AAChB,WAAK,iBAAiB;AAAA,IACxB;AAAA,IAEA,qBAAqB,QAAQ;AAC3B,YAAM,yCAAyC,mBAAmB,MAAM,CAAC,IAAI;AAAA,QAC3E,QAAQ;AAAA,QACR,SAAS;AAAA,UACP,UAAU;AAAA,UACV,gBAAgB,SAAS,cAAc,qBAAqB,EAAE;AAAA,QAChE;AAAA,MACF,CAAC,EACA,KAAK,cAAY,SAAS,KAAK,CAAC,EAChC,KAAK,UAAQ;AACZ,aAAK,iBAAiB,KAAK;AAAA,MAC7B,CAAC,EACA,MAAM,CAAAC,WAAS;AACd,aAAK,iBAAiB;AAAA,MACxB,CAAC;AAAA,IACH;AAAA,IAEA,4BAA4B,OAAO;AACjC,UAAI,CAAC,KAAK,gBAAgB;AACxB,YAAI,KAAK,sBAAsB;AAC7B,gBAAM,SAAS,EAAE,KAAK,iBAAiB,EAAE,IAAI;AAC7C,cAAI,QAAQ;AACV,iBAAK,+BAA+B,KAAK;AACzC;AAAA,UACF;AAAA,QACF;AACA,aAAK,gBAAgB,MAAM,OAAO,MAAM,KAAK;AAC7C;AAAA,MACF;AAEA,WAAK,oBAAoB,KAAK;AAAA,IAChC;AAAA,IAEA,+BAA+B,OAAO;AACpC,YAAM,SAAS,EAAE,KAAK,iBAAiB,EAAE,IAAI;AAE7C,YAAM,yCAAyC,mBAAmB,MAAM,CAAC,IAAI;AAAA,QAC3E,QAAQ;AAAA,QACR,SAAS;AAAA,UACP,UAAU;AAAA,UACV,gBAAgB,SAAS,cAAc,qBAAqB,EAAE;AAAA,QAChE;AAAA,MACF,CAAC,EACA,KAAK,cAAY,SAAS,KAAK,CAAC,EAChC,KAAK,UAAQ;AACZ,YAAI,KAAK,sBAAsB;AAC7B,eAAK,oBAAoB,KAAK;AAAA,QAChC,OAAO;AACL,eAAK,gBAAgB,MAAM,OAAO,MAAM,KAAK;AAAA,QAC/C;AAAA,MACF,CAAC,EACA,MAAM,CAAAA,WAAS;AACd,aAAK,gBAAgB,MAAM,OAAO,MAAM,KAAK;AAAA,MAC/C,CAAC;AAAA,IACH;AAAA,IAEA,oBAAoB,OAAO;AACzB,YAAM,eAAe,MAAM,OAAO,MAAM,KAAK;AAC7C,YAAM,eAAe,WAAW,YAAY;AAE5C,UAAI,iBAAiB,GAAG;AACtB,cAAM,gBAAgB,QAAQ,8GAA8G;AAE5I,YAAI,eAAe;AACjB,eAAK,iBAAiB,YAAY;AAAA,QACpC;AACA,aAAK,gBAAgB;AAAA,MACvB,WACS,KAAK,kBAAkB,OAAO,iBAAiB,KAAK;AAC3D,aAAK,iBAAiB,cAAc;AACpC,aAAK,gBAAgB;AAAA,MACvB,OACK;AACH,aAAK,gBAAgB;AAAA,MACvB;AAAA,IACF;AAAA,IAEA,iBAAiB,QAAQ;AACvB,WAAK,qBAAqB,QAAQ,YAAU;AAC1C,YAAI,OAAO,YAAY,YAAY,OAAO,YAAY,SAAS;AAC7D,iBAAO,QAAQ;AAEf,cAAI,OAAO,UAAU,SAAS,SAAS,GAAG;AACxC,cAAE,MAAM,EAAE,QAAQ,QAAQ;AAAA,UAC5B;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;;;AC1IA,MAAO,+CAAP,cAA6B,WAAW;AAAA,IACtC,OAAO,UAAU,CAAC,wBAAwB;AAAA,IAE1C,UAAU;AACR,WAAK,WAAW;AAAA,IAClB;AAAA,IAEA,aAAa;AACX,UAAI,KAAK,iCAAiC;AACxC,aAAK,6BAA6B,iBAAiB,SAAS,KAAK,uBAAuB,KAAK,IAAI,CAAC;AAAA,MACpG;AAAA,IACF;AAAA,IAEA,IAAI,wBAAwB;AAG1B,aAAO,KAAK,QAAQ,cAAc,gCAAgC,KAC3D,KAAK,QAAQ,cAAc,wCAAwC,KACnE,KAAK,QAAQ,cAAc,0CAA0C,KACrE,KAAK,QAAQ,cAAc,kCAAkC;AAAA,IACtE;AAAA,IAEA,IAAI,uBAAuB;AACzB,aAAO,KAAK,QAAQ,cAAc,iCAAiC,KAC5D,KAAK,QAAQ,cAAc,+BAA+B;AAAA,IACnE;AAAA,IAEA,oBAAoB;AAClB,YAAM,SAAS,KAAK;AACpB,UAAI,CAAC,QAAQ;AACX,eAAO,CAAC;AAAA,MACV;AAEA,UAAI,OAAO,KAAK,OAAO,EAAE,MAAM,EAAE,KAAK,SAAS,GAAG;AAChD,eAAO,OAAO,EAAE,MAAM,EAAE,IAAI,KAAK,CAAC;AAAA,MACpC;AAEA,aAAO,MAAM,KAAK,OAAO,eAAe,EAAE,IAAI,CAAAC,YAAUA,QAAO,KAAK,EAAE,OAAO,OAAO;AAAA,IACtF;AAAA,IAEA,yBAAyB;AACvB,YAAM,WAAW,KAAK;AAEtB,UAAI,CAAC,UAAU;AACb;AAAA,MACF;AAEA,YAAM,iBAAiB,KAAK,kBAAkB;AAE9C,UAAI,eAAe,WAAW,GAAG;AAC/B;AAAA,MACF;AAEA,YAAM,SAAS,IAAI,gBAAgB;AACnC,qBAAe,QAAQ,UAAQ;AAC7B,eAAO,OAAO,qBAAqB,IAAI;AAAA,MACzC,CAAC;AAED,YAAM,MAAM,wCAAwC,OAAO,SAAS,CAAC;AAErE,YAAM,GAAG,EACN,KAAK,cAAY;AAChB,eAAO,SAAS,KAAK;AAAA,MACvB,CAAC,EACA,KAAK,UAAQ;AACZ,cAAM,WAAW,SAAS;AAE1B,YAAI,OAAO,WAAW,OAAO,QAAQ,IAAI,QAAQ,GAAG;AAClD,gBAAM,SAAS,OAAO,QAAQ,IAAI,QAAQ;AAC1C,iBAAO,WAAW,KAAK,cAAc;AACrC,iBAAO,KAAK,QAAQ;AAAA,QACtB,OAAO;AAEL,mBAAS,QAAQ,KAAK;AACtB,mBAAS,cAAc,IAAI,MAAM,UAAU,EAAE,SAAS,KAAK,CAAC,CAAC;AAAA,QAC/D;AAAA,MACF,CAAC;AAAA,IACL;AAAA,EACF;;;AC9EA,MAAO,iCAAP,cAA6B,WAAW;AAAA,IACtC,OAAO,UAAU,CAAC,MAAM,MAAM,WAAW,MAAM;AAAA,IAE/C,mBAAmB,OAAO;AACxB,YAAM,OAAO,MAAM,cAAc,QAAQ;AACzC,YAAM,MAAM,IAAI,IAAI,OAAO,SAAS,IAAI;AACxC,UAAI,aAAa,IAAI,sBAAsB,IAAI;AAC/C,aAAO,SAAS,OAAO,IAAI,SAAS;AAAA,IACtC;AAAA,IAEA,eAAe;AACb,UAAI,cAAc;AAClB,UAAI,OAAO,YAAY,eAAe,QAAQ,IAAI,KAAK,WAAW,EAAE,GAAG;AACrE,sBAAc,QAAQ,IAAI,KAAK,WAAW,EAAE,EAAE,WAAW;AAAA,MAC3D,OAAO;AACL,sBAAc,KAAK,WAAW;AAAA,MAChC;AAEA,aAAO;AAAA,QACL,IAAI,KAAK,SAAS;AAAA,QAClB,IAAI,KAAK,SAAS;AAAA,QAClB,SAAS,KAAK,cAAc;AAAA,QAC5B,MAAM;AAAA,MACR;AAAA,IACF;AAAA,IAEA,UAAU,MAAM;AACd,UAAI,MAAM,SAAS,cAAc,KAAK;AACtC,UAAI,YAAY;AAChB,UAAI,YAAY,IAAI,UAAU,QAAQ,gBAAgB,IAAI;AAC1D,UAAI,YAAY,IAAI,UAAU,QAAQ,iBAAiB,MAAM;AAC7D,YAAM,OAAO,IAAI,eAAe,IAAI,aAAa;AAEjD,aAAO,KACJ,QAAQ,WAAW,GAAG,EACtB,QAAQ,aAAa,IAAI,EACzB,QAAQ,WAAW,MAAM,EACzB,KAAK;AAAA,IACV;AAAA,IAEA,eAAe;AACb,YAAM,OAAO,KAAK,aAAa;AAC/B,YAAM,WAAW,KAAK,UAAU,KAAK,IAAI;AAEzC,UAAI,YAAY,YAAY,mBAAmB,KAAK,EAAE;AAEtD,YAAM,SAAS,CAAC;AAChB,UAAI,KAAK,IAAI;AACX,eAAO,KAAK,QAAQ,mBAAmB,KAAK,EAAE,CAAC;AAAA,MACjD;AACA,UAAI,KAAK,SAAS;AAChB,eAAO,KAAK,aAAa,mBAAmB,KAAK,OAAO,CAAC;AAAA,MAC3D;AACA,UAAI,UAAU;AACZ,eAAO,KAAK,UAAU,mBAAmB,QAAQ,CAAC;AAAA,MACpD;AAEA,UAAI,OAAO,SAAS,GAAG;AACrB,qBAAa,MAAM,OAAO,KAAK,GAAG;AAAA,MACpC;AAEA,UAAI,UAAU,SAAS,KAAM;AAC3B,cAAM,2HAA2H;AACjI,cAAM,gBAAgB,KAAK,IAAI,GAAG,OAAO,UAAU,QAAQ,OAAO,CAAC;AACnE,cAAM,gBAAgB,SAAS,UAAU,GAAG,aAAa,IAAI;AAE7D,oBAAY,YAAY,mBAAmB,KAAK,EAAE;AAClD,cAAM,YAAY,CAAC;AACnB,YAAI,KAAK,GAAI,WAAU,KAAK,QAAQ,mBAAmB,KAAK,EAAE,CAAC;AAC/D,YAAI,KAAK,QAAS,WAAU,KAAK,aAAa,mBAAmB,KAAK,OAAO,CAAC;AAC9E,kBAAU,KAAK,UAAU,mBAAmB,aAAa,CAAC;AAC1D,qBAAa,MAAM,UAAU,KAAK,GAAG;AAAA,MACvC;AAEA,aAAO,SAAS,OAAO;AAAA,IACzB;AAAA,IAEA,kBAAkB;AAChB,YAAM,OAAO,KAAK,aAAa;AAC/B,YAAM,WAAW,KAAK,UAAU,KAAK,IAAI;AAEzC,YAAM,YAAY,OAAO,KAAK,EAAE;AAAA,YACxB,KAAK,EAAE;AAAA,iBACF,KAAK,OAAO;AAAA;AAAA,QAErB,QAAQ;AAEZ,gBAAU,UAAU,UAAU,SAAS;AAAA,IACzC;AAAA,EACF;;;ACzFA,MAAM,WAAW;AACjB,MAAM,YAAY;AAClB,MAAM,kBAAkB;AAExB,MAAO,oCAAP,cAA6B,WAAW;AAAA,IACtC,OAAO,UAAU,CAAC,YAAY,iBAAiB,UAAU,aAAa;AAAA,IAEtE,UAAU;AACR,UAAI,KAAK,mBAAmB;AAC1B,aAAK,WAAW;AAChB,aAAK,0BAA0B;AAAA,MACjC;AAAA,IACF;AAAA,IAEA,aAAa;AACX,UAAI,KAAK,WAAW;AAClB,YAAI,gBAAgB,KAAK,SAAS;AAClC,aAAK,YAAY;AAAA,MACnB;AAAA,IACF;AAAA,IAEA,aAAa;AACX,WAAK,YAAY;AACjB,WAAK,aAAa;AAClB,WAAK,kBAAkB,iBAAiB,SAAS,KAAK,MAAM,KAAK,IAAI,CAAC;AAAA,IACxE;AAAA,IAEA,MAAM,4BAA4B;AAChC,UAAI;AACF,cAAM,KAAK,MAAM,KAAK,OAAO;AAC7B,cAAM,OAAO,MAAM,IAAI,QAAQ,CAACC,aAAY;AAC1C,gBAAM,KAAK,GAAG,YAAY,WAAW,WAAW;AAChD,gBAAM,QAAQ,GAAG,YAAY,SAAS;AACtC,gBAAM,MAAM,MAAM,IAAI,eAAe;AACrC,cAAI,YAAY,MAAM;AACpB,kBAAMC,QAAO,IAAI;AACjB,gBAAIA,MAAM,OAAM,OAAO,eAAe;AACtC,YAAAD,SAAQC,SAAQ,IAAI;AAAA,UACtB;AACA,cAAI,UAAU,MAAMD,SAAQ,IAAI;AAAA,QAClC,CAAC;AACD,WAAG,MAAM;AACT,YAAI,MAAM;AACR,eAAK,YAAY,IAAI,gBAAgB,IAAI;AACzC,eAAK,QAAQ,KAAK,SAAS;AAAA,QAC7B;AAAA,MACF,SAAS,MAAM;AAAA,MAEf;AAAA,IACF;AAAA,IAEA,SAAS;AACP,aAAO,IAAI,QAAQ,CAACA,UAAS,WAAW;AACtC,cAAM,MAAM,UAAU,KAAK,UAAU,CAAC;AACtC,YAAI,YAAY,MAAMA,SAAQ,IAAI,MAAM;AACxC,YAAI,UAAU,MAAM,OAAO,IAAI,KAAK;AACpC,YAAI,kBAAkB,CAACE,OAAM;AAC3B,UAAAA,GAAE,OAAO,OAAO,kBAAkB,SAAS;AAAA,QAC7C;AAAA,MACF,CAAC;AAAA,IACH;AAAA,IAEA,eAAe;AACb,YAAM,KAAK,KAAK;AACf,OAAC,QAAQ,aAAa,WAAW,YAAY,aAAa,aAAa,MAAM,EAAE,QAAQ,CAAC,OAAO;AAC9F,WAAG,iBAAiB,IAAI,CAACA,OAAM;AAC7B,UAAAA,GAAE,eAAe;AACjB,UAAAA,GAAE,gBAAgB;AAAA,QACpB,CAAC;AAAA,MACH,CAAC;AACA,OAAC,YAAY,WAAW,EAAE,QAAQ,CAAC,OAAO;AACzC,WAAG,iBAAiB,IAAI,MAAM,GAAG,UAAU,IAAI,cAAc,mBAAmB,eAAe,CAAC;AAAA,MAClG,CAAC;AACA,OAAC,aAAa,WAAW,MAAM,EAAE,QAAQ,CAAC,OAAO;AAChD,WAAG,iBAAiB,IAAI,MAAM,GAAG,UAAU,OAAO,cAAc,mBAAmB,eAAe,CAAC;AAAA,MACrG,CAAC;AACD,SAAG,iBAAiB,QAAQ,CAACA,OAAM,KAAK,OAAOA,EAAC,CAAC;AAAA,IACnD;AAAA,IAEA,OAAOA,IAAG;AACR,YAAM,QAAQA,GAAE,cAAc;AAC9B,UAAI,CAAC,OAAO,OAAQ;AACpB,YAAM,OAAO,MAAM,CAAC;AACpB,UAAI,KAAK,SAAS,kBAAmB;AACrC,UAAI,KAAK,WAAW;AAClB,YAAI,gBAAgB,KAAK,SAAS;AAClC,aAAK,YAAY;AAAA,MACnB;AACA,WAAK,YAAY,IAAI,gBAAgB,IAAI;AACzC,WAAK,QAAQ,KAAK,SAAS;AAAA,IAC7B;AAAA,IAEA,QAAQ,KAAK;AACX,YAAM,SAAS,OAAO,QAAQ,YAAY,IAAI,WAAW,OAAO;AAChE,UAAI,QAAQ;AACV,cAAM,oBAAoB,KAAK;AAC/B,aAAK,YAAY;AACjB,YAAI,qBAAqB,sBAAsB,KAAK;AAClD,cAAI,gBAAgB,iBAAiB;AAAA,QACvC;AAAA,MACF,OAAO;AACL,aAAK,YAAY;AAAA,MACnB;AACA,WAAK,aAAa,MAAM;AACxB,WAAK,eAAe,UAAU,IAAI,QAAQ;AAC1C,WAAK,oBAAoB,UAAU,OAAO,QAAQ;AAClD,WAAK,kBAAkB,UAAU,OAAO,QAAQ;AAAA,IAClD;AAAA,IAEA,QAAQ;AACN,UAAI,KAAK,WAAW;AAClB,YAAI,gBAAgB,KAAK,SAAS;AAClC,aAAK,YAAY;AAAA,MACnB;AACA,WAAK,aAAa,MAAM;AACxB,WAAK,eAAe,UAAU,OAAO,QAAQ;AAC7C,WAAK,oBAAoB,UAAU,IAAI,QAAQ;AAC/C,WAAK,kBAAkB,UAAU,IAAI,QAAQ;AAAA,IAC/C;AAAA,EACF;;;ACvHA,MAAMC,YAAW;AACjB,MAAMC,aAAY;AAClB,MAAMC,mBAAkB;AAGxB,MAAO,iDAAP,cAA6B,WAAW;AAAA,IACtC,OAAO,SAAS;AAAA,MACd,sBAAsB;AAAA,IACxB;AAAA,IAEA,UAAU;AACR,WAAK,aAAa;AAAA,IACpB;AAAA,IAEA,eAAe;AACb,YAAM,KAAK,KAAK;AACf,OAAC,QAAQ,aAAa,WAAW,YAAY,aAAa,aAAa,MAAM,EAAE,QAAQ,CAAC,OAAO;AAC9F,WAAG,iBAAiB,IAAI,CAACC,OAAM;AAC7B,UAAAA,GAAE,eAAe;AACjB,UAAAA,GAAE,gBAAgB;AAAA,QACpB,CAAC;AAAA,MACH,CAAC;AACA,OAAC,YAAY,WAAW,EAAE,QAAQ,CAAC,OAAO;AACzC,WAAG,iBAAiB,IAAI,MAAM,GAAG,UAAU,IAAI,UAAU,kBAAkB,SAAS,CAAC;AAAA,MACvF,CAAC;AACA,OAAC,aAAa,WAAW,MAAM,EAAE,QAAQ,CAAC,OAAO;AAChD,WAAG,iBAAiB,IAAI,MAAM,GAAG,UAAU,OAAO,UAAU,kBAAkB,SAAS,CAAC;AAAA,MAC1F,CAAC;AACD,SAAG,iBAAiB,QAAQ,CAACA,OAAM,KAAK,OAAOA,EAAC,CAAC;AAAA,IACnD;AAAA,IAEA,MAAM,OAAOA,IAAG;AACd,YAAM,QAAQA,GAAE,cAAc;AAC9B,UAAI,CAAC,OAAO,OAAQ;AACpB,YAAM,OAAO,MAAM,CAAC;AACpB,UAAI,KAAK,SAAS,kBAAmB;AAErC,YAAM,OAAO,KAAK;AAClB,UAAI,CAAC,KAAM;AAEX,UAAI;AACF,cAAM,KAAK,MAAM,KAAK,OAAO;AAC7B,cAAM,IAAI,QAAQ,CAACC,UAAS,WAAW;AACrC,gBAAM,KAAK,GAAG,YAAYH,YAAW,WAAW;AAChD,aAAG,YAAYA,UAAS,EAAE,IAAI,MAAMC,gBAAe;AACnD,aAAG,aAAa,MAAME,SAAQ;AAC9B,aAAG,UAAU,MAAM,OAAO,GAAG,KAAK;AAAA,QACpC,CAAC;AACD,WAAG,MAAM;AACT,eAAO,SAAS,OAAO;AAAA,MACzB,SAAS,MAAM;AAEb,eAAO,SAAS,OAAO;AAAA,MACzB;AAAA,IACF;AAAA,IAEA,SAAS;AACP,aAAO,IAAI,QAAQ,CAACA,UAAS,WAAW;AACtC,cAAM,MAAM,UAAU,KAAKJ,WAAU,CAAC;AACtC,YAAI,YAAY,MAAMI,SAAQ,IAAI,MAAM;AACxC,YAAI,UAAU,MAAM,OAAO,IAAI,KAAK;AACpC,YAAI,kBAAkB,CAACD,OAAM;AAC3B,UAAAA,GAAE,OAAO,OAAO,kBAAkBF,UAAS;AAAA,QAC7C;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;;;ACpEA,WAASI,YAAW;AAClB,WAAOA,YAAW,OAAO,SAAS,OAAO,OAAO,KAAK,IAAI,SAAU,GAAG;AACpE,eAASC,KAAI,GAAGA,KAAI,UAAU,QAAQA,MAAK;AACzC,YAAI,IAAI,UAAUA,EAAC;AACnB,iBAAS,KAAK,EAAG,EAAC,CAAC,GAAG,eAAe,KAAK,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,MAChE;AACA,aAAO;AAAA,IACT,GAAGD,UAAS,MAAM,MAAM,SAAS;AAAA,EACnC;;;ACRO,MAAI,iBAAiB;AAAA;AAAA;AAAA,IAG1B,QAAQ;AAAA;AAAA;AAAA,IAGR,QAAQ;AAAA;AAAA,IAER,QAAQ;AAAA;AAAA,IAER,QAAQ;AAAA;AAAA;AAAA,IAGR,gBAAgB;AAAA;AAAA,IAEhB,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA,IAKX,aAAa;AAAA;AAAA;AAAA,IAGb,YAAY;AAAA;AAAA;AAAA;AAAA,IAIZ,cAAc;AAAA,EAChB;;;AClBA,WAAS,gBAAgB,QAAQ,MAAM;AAErC,QAAI,eAAe,QAAQ,IAAI,GAAG;AAChC,aAAO,OAAO,IAAI;AAAA,IACpB;AACA,QAAI,OAAO,OAAO,IAAI,MAAM,cAAc,aAAa,QAAQ,IAAI,GAAG;AACpE,YAAM,IAAI,MAAM,2BAA2B,OAAO,iBAAiB;AAAA,IACrE;AACA,UAAM,IAAI,MAAM,4BAA4B,OAAO,GAAG;AAAA,EACxD;AAYA,WAAS,gBAAgB,QAAQ,MAAM,OAAO;AAE5C,QAAI,eAAe,QAAQ,IAAI,GAAG;AAChC,aAAO,IAAI,IAAI;AACf,aAAO;AAAA,IACT;AACA,UAAM,IAAI,MAAM,4BAA4B,OAAO,GAAG;AAAA,EACxD;AASA,WAAS,eAAe,QAAQ,MAAM;AACpC,QAAI,CAAC,cAAc,MAAM,KAAK,CAAC,MAAM,QAAQ,MAAM,GAAG;AACpD,aAAO;AAAA,IACT;AAGA,QAAI,eAAe,sBAAsB,IAAI,GAAG;AAC9C,aAAO;AAAA,IACT;AAGA,QAAI,QAAQ,OAAO,WAAW;AAI5B,aAAO;AAAA,IACT;AAGA,QAAI,QAAQ,SAAS,WAAW;AAI9B,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AASA,WAAS,cAAc,QAAQ,QAAQ;AACrC,QAAI,CAAC,aAAa,QAAQ,MAAM,GAAG;AACjC,YAAM,IAAI,MAAM,0BAA0B,SAAS,GAAG;AAAA,IACxD;AACA,WAAO,OAAO,MAAM;AAAA,EACtB;AASA,WAAS,aAAa,QAAQ,QAAQ;AACpC,QAAI,WAAW,QAAQ,WAAW,UAAa,OAAO,OAAO,MAAM,MAAM,YAAY;AACnF,aAAO;AAAA,IACT;AAIA,QAAI,eAAe,QAAQ,MAAM,KAAK,OAAO,kBAAkB,UAAU,OAAO,eAAe,MAAM,GAAG;AACtG,aAAO;AAAA,IACT;AAGA,QAAI,eAAe,mBAAmB,MAAM,GAAG;AAC7C,aAAO;AAAA,IACT;AAGA,QAAI,UAAU,OAAO,WAAW;AAI9B,aAAO;AAAA,IACT;AAGA,QAAI,UAAU,SAAS,WAAW;AAIhC,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AACA,WAAS,cAAc,QAAQ;AAC7B,WAAO,OAAO,WAAW,YAAY,UAAU,OAAO,gBAAgB;AAAA,EACxE;AACA,MAAI,uBAAuB;AAAA,IACzB,QAAQ;AAAA,IACR,MAAM;AAAA,EACR;AACA,MAAI,oBAAoB;AAAA,IACtB,UAAU;AAAA,IACV,SAAS;AAAA,IACT,gBAAgB;AAAA,EAClB;;;ACjIO,MAAM,oBAAN,MAAwB;AAAA,IAC7B,YAAY,QAAQ;AAClB,WAAK,gBAAgB;AACrB,WAAK,OAAO,QAAQ,IAAI,KAAK;AAAA,IAC/B;AAAA,IACA,OAAO;AACL,aAAO,OAAO,KAAK,KAAK,aAAa,EAAE,OAAO,SAAO,KAAK,IAAI,GAAG,CAAC,EAAE,OAAO;AAAA,IAC7E;AAAA,IACA,IAAI,KAAK;AACP,aAAO,gBAAgB,KAAK,eAAe,GAAG;AAAA,IAChD;AAAA,IACA,IAAI,KAAK,OAAO;AACd,sBAAgB,KAAK,eAAe,KAAK,KAAK;AAC9C,aAAO;AAAA,IACT;AAAA,IACA,IAAI,KAAK;AACP,aAAO,eAAe,KAAK,eAAe,GAAG,KAAK,OAAO,KAAK;AAAA,IAChE;AAAA,IACA,UAAU;AACR,aAAO,YAAY,KAAK,KAAK,GAAG,SAAO,CAAC,KAAK,KAAK,IAAI,GAAG,CAAC,CAAC;AAAA,IAC7D;AAAA,IACA,QAAQ,UAAU;AAChB,eAAS,OAAO,KAAK,KAAK,GAAG;AAC3B,iBAAS,KAAK,IAAI,GAAG,GAAG,KAAK,IAAI;AAAA,MACnC;AAAA,IACF;AAAA,IACA,OAAO,KAAK;AACV,UAAI,eAAe,KAAK,eAAe,GAAG,GAAG;AAC3C,eAAO,KAAK,cAAc,GAAG;AAAA,MAC/B;AAAA,IACF;AAAA,IACA,QAAQ;AACN,eAAS,OAAO,KAAK,KAAK,GAAG;AAC3B,aAAK,OAAO,GAAG;AAAA,MACjB;AAAA,IACF;AAAA,IACA,IAAI,OAAO;AACT,aAAO,OAAO,KAAK,KAAK,aAAa,EAAE;AAAA,IACzC;AAAA,EACF;AAgBO,MAAM,iBAAN,MAAqB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAM1B,YAAY,GAAG,GAAG,OAAO;AACvB,WAAK,IAAI;AACT,WAAK,IAAI;AACT,WAAK,QAAQ;AACb,WAAK,OAAO,QAAQ,IAAI,KAAK;AAAA,IAC/B;AAAA,IACA,IAAI,KAAK;AACP,aAAO,KAAK,MAAM,IAAI,GAAG,IAAI,KAAK,EAAE,IAAI,GAAG,IAAI,KAAK,EAAE,IAAI,GAAG;AAAA,IAC/D;AAAA,IACA,IAAI,KAAK,OAAO;AACd,UAAI,KAAK,MAAM,IAAI,GAAG,GAAG;AACvB,aAAK,EAAE,IAAI,KAAK,KAAK;AAAA,MACvB,OAAO;AACL,aAAK,EAAE,IAAI,KAAK,KAAK;AAAA,MACvB;AACA,aAAO;AAAA,IACT;AAAA,IACA,IAAI,KAAK;AACP,aAAO,KAAK,EAAE,IAAI,GAAG,KAAK,KAAK,EAAE,IAAI,GAAG;AAAA,IAC1C;AAAA,IACA,OAAO;AACL,cAAO,oBAAI,IAAI,CAAC,GAAG,KAAK,EAAE,KAAK,GAAG,GAAG,KAAK,EAAE,KAAK,CAAC,CAAC,GAAE,OAAO,QAAQ,EAAE;AAAA,IACxE;AAAA,IACA,UAAU;AACR,aAAO,YAAY,KAAK,KAAK,GAAG,SAAO,CAAC,KAAK,KAAK,IAAI,GAAG,CAAC,CAAC;AAAA,IAC7D;AAAA,IACA,QAAQ,UAAU;AAChB,eAAS,OAAO,KAAK,KAAK,GAAG;AAC3B,iBAAS,KAAK,IAAI,GAAG,GAAG,KAAK,IAAI;AAAA,MACnC;AAAA,IACF;AAAA,IACA,OAAO,KAAK;AACV,aAAO,KAAK,MAAM,IAAI,GAAG,IAAI,KAAK,EAAE,OAAO,GAAG,IAAI,KAAK,EAAE,OAAO,GAAG;AAAA,IACrE;AAAA,IACA,QAAQ;AACN,WAAK,EAAE,MAAM;AACb,WAAK,EAAE,MAAM;AAAA,IACf;AAAA,IACA,IAAI,OAAO;AACT,aAAO,CAAC,GAAG,KAAK,KAAK,CAAC,EAAE;AAAA,IAC1B;AAAA,EACF;AAKA,WAAS,YAAY,IAAI,UAAU;AACjC,WAAO;AAAA,MACL,MAAM,MAAM;AACV,YAAI,IAAI,GAAG,KAAK;AAChB,eAAO,EAAE,OAAO,IAAI;AAAA,UAClB,OAAO,SAAS,EAAE,KAAK;AAAA,UACvB,MAAM;AAAA,QACR;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAOO,WAAS,iBAAiB;AAC/B,WAAO,oBAAI,IAAI;AAAA,EACjB;AAQO,WAAS,UAAU,aAAa;AACrC,QAAI,CAAC,aAAa;AAChB,aAAO,eAAe;AAAA,IACxB;AACA,QAAI,MAAM,WAAW,GAAG;AACtB,aAAO;AAAA,IACT;AACA,QAAI,SAAS,WAAW,GAAG;AACzB,aAAO,IAAI,kBAAkB,WAAW;AAAA,IAC1C;AACA,UAAM,IAAI,MAAM,gDAAgD;AAAA,EAClE;AAQO,WAAS,SAASE,MAAK;AAC5B,QAAIA,gBAAe,mBAAmB;AACpC,aAAOA,KAAI;AAAA,IACb;AACA,QAAI,SAAS,CAAC;AACd,aAAS,OAAOA,KAAI,KAAK,GAAG;AAC1B,UAAI,QAAQA,KAAI,IAAI,GAAG;AACvB,sBAAgB,QAAQ,KAAK,KAAK;AAAA,IACpC;AACA,WAAO;AAAA,EACT;;;AC/JO,WAAS,SAAS,GAAG;AAC1B,WAAO,OAAO,MAAM;AAAA,EACtB;AACO,WAAS,YAAY,GAAG;AAC7B,QAAI,CAAC,KAAK,OAAO,MAAM,YAAY,OAAO,EAAE,gBAAgB,YAAY;AACtE,aAAO;AAAA,IACT;AACA,QAAI,EAAE,gBAAgB,QAAQ,OAAO,EAAE,YAAY,cAAc,YAAY,EAAE,YAAY,UAAU,gBAAgB,MAAM;AACzH,aAAO;AAAA,IACT;AACA,QAAI,OAAO,EAAE,YAAY,cAAc,cAAc,EAAE,YAAY,UAAU,CAAC,MAAM,MAAM;AACxF,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AACO,WAAS,SAAS,GAAG;AAC1B,WAAO,OAAO,MAAM;AAAA,EACtB;AACO,WAAS,UAAU,GAAG;AAC3B,WAAO,KAAK,OAAO,MAAM,YAAY,OAAO,eAAe,CAAC,EAAE,cAAc,QAAQ;AAAA,EACtF;AACO,WAAS,WAAW,GAAG;AAC5B,WAAO,KAAK,OAAO,MAAM,YAAY,OAAO,eAAe,CAAC,EAAE,eAAe,QAAQ;AAAA,EACvF;AACO,WAAS,OAAO,GAAG;AACxB,WAAO,KAAK,EAAE,YAAY,UAAU,WAAW,QAAQ;AAAA,EACzD;AACO,WAAS,SAAS,GAAG;AAC1B,WAAO,OAAO,MAAM;AAAA,EACtB;AACO,MAAI,UAAU,MAAM;AACpB,WAAS,SAAS,GAAG;AAC1B,WAAO,KAAK,EAAE,YAAY,UAAU,aAAa,QAAQ;AAAA,EAC3D;AAOO,WAAS,aAAa,GAAG;AAC9B,WAAO,MAAM,QAAQ,CAAC,KAAK,SAAS,CAAC;AAAA,EACvC;AACO,WAAS,cAAc,GAAG;AAC/B,WAAO,KAAK,EAAE,iBAAiB,EAAE,YAAY,UAAU,aAAa,QAAQ;AAAA,EAC9E;AACO,WAAS,eAAe,GAAG;AAChC,WAAO,KAAK,EAAE,kBAAkB,EAAE,YAAY,UAAU,aAAa,QAAQ;AAAA,EAC/E;AACO,WAAS,QAAQ,GAAG;AACzB,WAAO,KAAK,EAAE,YAAY,UAAU,YAAY,QAAQ;AAAA,EAC1D;AACO,WAAS,QAAQ,GAAG;AACzB,WAAO,KAAK,EAAE,YAAY,UAAU,YAAY,QAAQ;AAAA,EAC1D;AACO,WAAS,UAAU,GAAG;AAC3B,WAAO,OAAO,MAAM;AAAA,EACtB;AACO,WAAS,YAAY,GAAG;AAC7B,WAAO,KAAK,EAAE,YAAY,UAAU,gBAAgB,QAAQ;AAAA,EAC9D;AACO,WAAS,OAAO,GAAG;AACxB,WAAO,KAAK,EAAE,YAAY,UAAU,WAAW,QAAQ;AAAA,EACzD;AACO,WAAS,WAAW,GAAG;AAC5B,WAAO,OAAO,MAAM;AAAA,EACtB;AACO,WAAS,OAAO,GAAG;AACxB,WAAO,aAAa;AAAA,EACtB;AACO,WAAS,SAAS,GAAG;AAC1B,WAAO,aAAa;AAAA,EACtB;AACO,WAAS,SAAS,GAAG;AAC1B,WAAO,CAAC,EAAE,KAAK,OAAO,MAAM,YAAY,EAAE,gBAAgB,UAAU,CAAC,UAAU,CAAC,KAAK,CAAC,WAAW,CAAC;AAAA,EACpG;AAUO,WAAS,MAAM,QAAQ;AAG5B,QAAI,CAAC,QAAQ;AACX,aAAO;AAAA,IACT;AACA,WAAO,kBAAkB,OAAO,kBAAkB,qBAAqB,OAAO,OAAO,QAAQ,cAAc,OAAO,OAAO,QAAQ,cAAc,OAAO,OAAO,SAAS,cAAc,OAAO,OAAO,QAAQ;AAAA,EAC5M;AAOO,WAAS,OAAO,GAAG;AACxB,WAAO,MAAM;AAAA,EACf;AACO,WAAS,YAAY,GAAG;AAC7B,WAAO,MAAM;AAAA,EACf;AACO,WAAS,eAAe,GAAG;AAChC,WAAO,KAAK,EAAE,mBAAmB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AAAA,EACtF;AACO,WAAS,YAAY,GAAG;AAC7B,WAAO,KAAK,EAAE,gBAAgB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AAAA,EACnF;AACO,WAAS,iBAAiB,GAAG;AAClC,WAAO,KAAK,EAAE,qBAAqB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AAAA,EACxF;AACO,WAAS,YAAY,GAAG;AAC7B,WAAO,KAAK,EAAE,gBAAgB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AAAA,EACnF;AACO,WAAS,kBAAkB,GAAG;AACnC,WAAO,KAAK,EAAE,sBAAsB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AAAA,EACzF;AACO,WAAS,eAAe,GAAG;AAChC,WAAO,KAAK,EAAE,mBAAmB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AAAA,EACtF;AAYO,WAAS,UAAU,MAAM;AAC9B,WAAO,eAAe,IAAI,KAAK,eAAe,IAAI,KAAK,KAAK,KAAK,WAAW,KAAK,eAAe,KAAK,KAAK,CAAC,CAAC,KAAK,MAAM,SAAS,KAAK,EAAE;AAAA,EACzI;AACO,WAAS,yBAAyB,GAAG;AAC1C,WAAO,KAAK,EAAE,6BAA6B,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AAAA,EAChG;AACO,WAAS,eAAe,GAAG;AAChC,WAAO,KAAK,EAAE,mBAAmB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AAAA,EACtF;AACO,WAAS,YAAY,GAAG;AAC7B,WAAO,KAAK,EAAE,gBAAgB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AAAA,EACnF;AACO,WAAS,OAAO,GAAG;AACxB,WAAO,KAAK,EAAE,WAAW,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AAAA,EAC9E;AACO,WAAS,aAAa,GAAG;AAC9B,WAAO,KAAK,EAAE,iBAAiB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AAAA,EACpF;AACO,WAAS,eAAe,GAAG;AAChC,WAAO,KAAK,EAAE,mBAAmB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AAAA,EACtF;AACO,WAAS,kBAAkB,GAAG;AACnC,WAAO,KAAK,EAAE,sBAAsB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AAAA,EACzF;AACO,WAAS,YAAY,GAAG;AAC7B,WAAO,KAAK,EAAE,gBAAgB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AAAA,EACnF;AACO,WAAS,iBAAiB,GAAG;AAClC,WAAO,KAAK,EAAE,qBAAqB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AAAA,EACxF;AACO,WAAS,aAAa,GAAG;AAC9B,WAAO,KAAK,EAAE,iBAAiB,QAAQ,EAAE,YAAY,UAAU,WAAW,QAAQ;AAAA,EACpF;AACO,WAAS,QAAQ,GAAG;AACzB,WAAO,KAAK,EAAE,YAAY,UAAU,YAAY,QAAQ;AAAA,EAC1D;AACO,WAAS,OAAO,GAAG;AACxB,QAAI,IAAI,OAAO;AACf,QAAI,MAAM,UAAU;AAClB,UAAI,MAAM,KAAM,QAAO;AACvB,UAAI,YAAY,CAAC,EAAG,QAAO;AAC3B,UAAI,EAAE,eAAe,EAAE,YAAY,KAAM,QAAO,EAAE,YAAY;AAC9D,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;;;ACrLO,WAASC,OAAM,GAAG;AACvB,QAAI,OAAO,OAAO;AAGlB,QAAI,SAAS,YAAY,SAAS,YAAY,SAAS,YAAY,SAAS,aAAa,MAAM,QAAQ,MAAM,QAAW;AACtH,aAAO;AAAA,IACT;AAGA,QAAI,OAAO,EAAE,UAAU,YAAY;AACjC,aAAO,EAAE,MAAM;AAAA,IACjB;AAGA,QAAI,MAAM,QAAQ,CAAC,GAAG;AACpB,aAAO,EAAE,IAAI,SAAU,OAAO;AAC5B,eAAOA,OAAM,KAAK;AAAA,MACpB,CAAC;AAAA,IACH;AACA,QAAI,aAAa,KAAM,QAAO,IAAI,KAAK,EAAE,QAAQ,CAAC;AAClD,QAAI,YAAY,CAAC,EAAG,QAAO;AAG3B,QAAI,SAAS,CAAC,GAAG;AACf,aAAO,UAAU,GAAGA,MAAK;AAAA,IAC3B;AACA,QAAI,SAAS,YAAY;AAEvB,aAAO;AAAA,IACT;AACA,UAAM,IAAI,UAAU,+CAA+C,OAAO,GAAG,GAAG,CAAC;AAAA,EACnF;AAQO,WAAS,UAAU,QAAQ,UAAU;AAC1C,QAAIA,SAAQ,CAAC;AACb,aAAS,OAAO,QAAQ;AACtB,UAAI,eAAe,QAAQ,GAAG,GAAG;AAC/B,QAAAA,OAAM,GAAG,IAAI,SAAS,OAAO,GAAG,CAAC;AAAA,MACnC;AAAA,IACF;AACA,WAAOA;AAAA,EACT;AAQO,WAASC,QAAO,GAAG,GAAG;AAC3B,aAAS,QAAQ,GAAG;AAClB,UAAI,eAAe,GAAG,IAAI,GAAG;AAC3B,UAAE,IAAI,IAAI,EAAE,IAAI;AAAA,MAClB;AAAA,IACF;AACA,WAAO;AAAA,EACT;AA2CO,WAAS,gBAAgB,GAAG,GAAG;AACpC,QAAI,MAAMC,IAAG;AACb,QAAI,MAAM,QAAQ,CAAC,GAAG;AACpB,UAAI,CAAC,MAAM,QAAQ,CAAC,GAAG;AACrB,eAAO;AAAA,MACT;AACA,UAAI,EAAE,WAAW,EAAE,QAAQ;AACzB,eAAO;AAAA,MACT;AACA,WAAKA,KAAI,GAAG,MAAM,EAAE,QAAQA,KAAI,KAAKA,MAAK;AACxC,YAAI,CAAC,gBAAgB,EAAEA,EAAC,GAAG,EAAEA,EAAC,CAAC,GAAG;AAChC,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO;AAAA,IACT,WAAW,OAAO,MAAM,YAAY;AAClC,aAAO,MAAM;AAAA,IACf,WAAW,aAAa,QAAQ;AAC9B,UAAI,MAAM,QAAQ,CAAC,KAAK,EAAE,aAAa,SAAS;AAC9C,eAAO;AAAA,MACT;AACA,WAAK,QAAQ,GAAG;AAEd,YAAI,EAAE,QAAQ,MAAM,CAAC,gBAAgB,EAAE,IAAI,GAAG,EAAE,IAAI,CAAC,GAAG;AACtD,iBAAO;AAAA,QACT;AAAA,MACF;AACA,WAAK,QAAQ,GAAG;AAEd,YAAI,EAAE,QAAQ,IAAI;AAChB,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO;AAAA,IACT,OAAO;AACL,aAAO,MAAM;AAAA,IACf;AAAA,EACF;AAuDO,WAAS,KAAK,QAAQ,MAAM,eAAe;AAChD,QAAI,iBAAiB;AACrB,QAAI;AACJ,WAAO,eAAe,QAAQ,MAAM;AAAA,MAClC,KAAK,SAASC,OAAM;AAClB,YAAI,gBAAgB;AAClB,mBAAS,cAAc;AACvB,2BAAiB;AAAA,QACnB;AACA,eAAO;AAAA,MACT;AAAA,MACA,KAAK,SAAS,IAAI,OAAO;AACvB,iBAAS;AACT,yBAAiB;AAAA,MACnB;AAAA,MACA,cAAc;AAAA,MACd,YAAY;AAAA,IACd,CAAC;AAAA,EACH;AA+BO,WAAS,eAAe,QAAQ,UAAU;AAC/C,WAAO,UAAU,OAAO,eAAe,KAAK,QAAQ,QAAQ;AAAA,EAC9D;AAmGO,WAAS,YAAY,QAAQC,aAAY;AAC9C,QAAI,OAAO,CAAC;AACZ,aAASC,KAAI,GAAGA,KAAID,YAAW,QAAQC,MAAK;AAC1C,UAAI,MAAMD,YAAWC,EAAC;AACtB,UAAI,QAAQ,OAAO,GAAG;AACtB,UAAI,UAAU,QAAW;AACvB,aAAK,GAAG,IAAI;AAAA,MACd;AAAA,IACF;AACA,WAAO;AAAA,EACT;;;AChXO,MAAI,iBAAiB,CAAC,UAAU,OAAO;AACvC,MAAI,iBAAiB,CAAC,UAAU,aAAa,UAAU,UAAU;;;ACEjE,MAAIC,UAAS,SAASA,QAAO,SAAS;AAC3C,QAAI,SAAS;AACX,YAAM,IAAI,MAAM,qPAAuR;AAAA,IACzS;AACA,WAAO,OAAO,OAAO,cAAc;AAAA,EACrC;AACA,EAAAC,UAASD,SAAQ,gBAAgB;AAAA,IAC/B;AAAA,IACA;AAAA,EACF,CAAC;;;ACwBD,8BAA0B;;;ACTnB,WAAS,QAAQE,SAAMC,iBAAc,QAAQ,MAAM;AACxD,aAAS,gBAAgB,OAAO;AAI9B,UAAI,OAAO,YAAY,OAAOA,gBAAa,IAAI,qBAAqB,CAAC;AACrE,yBAAmBD,SAAMC,iBAAc,KAAK;AAC5C,aAAO,OAAO,IAAI;AAAA,IACpB;AACA,oBAAgB,YAAY;AAC5B,oBAAgB,KAAKD;AACrB,oBAAgB,eAAeC,gBAAa,MAAM,EAAE,KAAK;AACzD,QAAI,MAAM;AACR,sBAAgB,OAAO;AAAA,IACzB;AACA,WAAO;AAAA,EACT;AAoEO,WAAS,mBAAmBC,SAAMC,iBAAc,OAAO;AAC5D,QAAI,aAAaA,gBAAa,OAAO,gBAAc,CAAC,qBAAqB,UAAU,CAAC,EACnF,MAAM,gBAAc,MAAM,UAAU,MAAM,MAAS;AACpD,QAAI,CAAC,YAAY;AACf,UAAI,sBAAsBA,gBAAa,OAAO,gBAAc,MAAM,UAAU,MAAM,MAAS;AAG3F,YAAM,IAAI,MAAM,2BAA4B,OAAOD,SAAM,KAAM,IAAI,kCAAkC,OAAO,oBAAoB,IAAI,OAAK,IAAK,OAAO,GAAG,GAAI,CAAC,EAAE,KAAK,IAAI,GAAG,GAAG,CAAC;AAAA,IACjL;AAAA,EACF;AACO,WAAS,qBAAqB,YAAY;AAC/C,WAAO,cAAc,WAAW,CAAC,MAAM;AAAA,EACzC;AACO,WAAS,sBAAsB,YAAY;AAChD,WAAO,cAAc,WAAW,CAAC,MAAM,MAAM,WAAW,MAAM,CAAC,IAAI;AAAA,EACrE;;;ACrHO,WAAS,UAAU,OAAO;AAC/B,QAAI,OAAO,UAAU,WAAW;AAC9B,aAAO;AAAA,IACT;AACA,WAAO,OAAO,SAAS,KAAK,IAAI,UAAU,KAAK,MAAM,KAAK,IAAI;AAAA,EAChE;AAoBO,WAAS,eAAe,WAAWE,SAAQ;AAChD,QAAIA,QAAO,WAAW,UAAU;AAC9B,UAAI;AACF,eAAO,SAAS;AAAA,MAClB,SAAS,SAAS;AAChB,eAAOA,QAAO;AAAA,MAChB;AAAA,IACF;AACA,WAAOA,QAAO;AAAA,EAChB;AAOO,MAAI,OAAO,KAAK,QAAQ,SAAU,GAAG;AAC1C,QAAI,IAAI,GAAG;AACT,aAAO;AAAA,IACT,WAAW,IAAI,GAAG;AAChB,aAAO;AAAA,IACT,OAAO;AACL,aAAO;AAAA,IACT;AAAA,EACF;AAOO,MAAI,OAAO,KAAK,QAAQ,SAASC,MAAK,GAAG;AAC9C,WAAO,KAAK,IAAI,CAAC,IAAI,KAAK;AAAA,EAC5B;AAOO,MAAI,QAAQ,KAAK,SAAS,SAASC,OAAM,GAAG;AACjD,WAAO,KAAK,IAAI,CAAC,IAAI,KAAK;AAAA,EAC5B;AAOO,MAAI,QAAQ,KAAK,SAAS,SAAU,GAAG;AAC5C,WAAO,KAAK,IAAI,IAAI,CAAC;AAAA,EACvB;AAWO,MAAI,OAAO,KAAK,QAAQ,SAASC,MAAK,GAAG;AAC9C,QAAI,MAAM,GAAG;AACX,aAAO;AAAA,IACT;AACA,QAAI,SAAS,IAAI;AACjB,QAAI;AACJ,QAAI,QAAQ;AACV,UAAI,CAAC;AAAA,IACP;AACA,QAAI,OAAO,SAAS,CAAC,GAAG;AACtB,eAAS,KAAK,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;AAEjC,gBAAU,KAAK,SAAS,UAAU,IAAI,UAAU;AAAA,IAClD,OAAO;AACL,eAAS;AAAA,IACX;AACA,WAAO,SAAS,CAAC,SAAS;AAAA,EAC5B;AAOO,MAAI,QAAQ,KAAK,SAAS,SAASC,OAAM,GAAG;AACjD,WAAO,KAAK,QAAQ,KAAK,QAAQ,KAAK,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;AAAA,EACjF;AASA,WAAS,mBAAmB,GAAG,MAAMC,OAAM;AACzC,QAAI,WAAW;AAAA,MACb,GAAG;AAAA,MACH,GAAG;AAAA,MACH,IAAI;AAAA,IACN;AACA,QAAI,SAAS,SAAS,IAAI;AAC1B,QAAI,SAAS;AACb,QAAIA,OAAM;AACR,UAAIA,QAAO,GAAG;AACZ,cAAM,IAAI,MAAM,gCAAgC;AAAA,MAClD;AACA,UAAI,CAAC,UAAUA,KAAI,GAAG;AACpB,cAAM,IAAI,MAAM,yBAAyB;AAAA,MAC3C;AACA,UAAI,IAAI,MAAMA,QAAO,KAAK,KAAK,IAAI,EAAE,MAAMA,QAAO,KAAK;AACrD,cAAM,IAAI,MAAM,8BAA8B,OAAOA,QAAO,GAAG,MAAM,EAAE,OAAOA,QAAO,GAAG,KAAK,CAAC;AAAA,MAChG;AACA,UAAI,CAAC,UAAU,CAAC,GAAG;AACjB,cAAM,IAAI,MAAM,0BAA0B;AAAA,MAC5C;AACA,UAAI,IAAI,GAAG;AACT,YAAI,IAAI,KAAKA;AAAA,MACf;AACA,eAAS,IAAI,OAAOA,KAAI;AAAA,IAC1B;AACA,QAAIC,QAAO;AACX,QAAI,IAAI,GAAG;AACT,UAAI,CAAC;AACL,MAAAA,QAAO;AAAA,IACT;AACA,WAAO,GAAG,OAAOA,KAAI,EAAE,OAAO,MAAM,EAAE,OAAO,EAAE,SAAS,IAAI,CAAC,EAAE,OAAO,MAAM;AAAA,EAC9E;AAsFO,WAAS,OAAO,OAAO,SAAS;AACrC,QAAI,OAAO,YAAY,YAAY;AAEjC,aAAO,QAAQ,KAAK;AAAA,IACtB;AAGA,QAAI,UAAU,UAAU;AACtB,aAAO;AAAA,IACT,WAAW,UAAU,WAAW;AAC9B,aAAO;AAAA,IACT,WAAW,MAAM,KAAK,GAAG;AACvB,aAAO;AAAA,IACT;AACA,QAAI;AAAA,MACF;AAAA,MACA;AAAA,MACA;AAAA,IACF,IAAI,uBAAuB,OAAO;AAGlC,YAAQ,UAAU;AAAA,MAChB,KAAK;AACH,eAAO,QAAQ,OAAO,SAAS;AAAA,MACjC,KAAK;AACH,eAAO,cAAc,OAAO,SAAS;AAAA,MACvC,KAAK;AACH,eAAO,cAAc,OAAO,SAAS;AAAA,MACvC,KAAK;AACH,eAAO,mBAAmB,OAAO,GAAG,QAAQ;AAAA,MAC9C,KAAK;AACH,eAAO,mBAAmB,OAAO,GAAG,QAAQ;AAAA,MAC9C,KAAK;AACH,eAAO,mBAAmB,OAAO,IAAI,QAAQ;AAAA,MAC/C,KAAK;AAEH,eAAO,YAAY,OAAO,WAAW,OAAO,EAAE,QAAQ,uBAAuB,WAAY;AACvF,cAAIC,UAAS,UAAU,CAAC;AACxB,cAAIC,KAAI,UAAU,CAAC;AACnB,iBAAOD,YAAW,MAAMA,UAASC,KAAIA;AAAA,QACvC,CAAC;AAAA,MACH;AACE,cAAM,IAAI,MAAM,uBAAuB,WAAW,kEAAuE;AAAA,IAC7H;AAAA,EACF;AAUO,WAAS,uBAAuB,SAAS;AAE9C,QAAI,WAAW;AACf,QAAI;AACJ,QAAI;AACJ,QAAI,YAAY,QAAW;AACzB,UAAI,SAAS,OAAO,GAAG;AACrB,oBAAY;AAAA,MACd,WAAW,YAAY,OAAO,GAAG;AAC/B,oBAAY,QAAQ,SAAS;AAAA,MAC/B,WAAW,SAAS,OAAO,GAAG;AAC5B,YAAI,QAAQ,cAAc,QAAW;AACnC,sBAAY,iBAAiB,QAAQ,WAAW,MAAM;AACpD,kBAAM,IAAI,MAAM,kDAAkD;AAAA,UACpE,CAAC;AAAA,QACH;AACA,YAAI,QAAQ,aAAa,QAAW;AAClC,qBAAW,iBAAiB,QAAQ,UAAU,MAAM;AAClD,kBAAM,IAAI,MAAM,iDAAiD;AAAA,UACnE,CAAC;AAAA,QACH;AACA,YAAI,QAAQ,UAAU;AACpB,qBAAW,QAAQ;AAAA,QACrB;AAAA,MACF,OAAO;AACL,cAAM,IAAI,MAAM,oEAAoE;AAAA,MACtF;AAAA,IACF;AACA,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAQO,WAAS,YAAY,OAAO;AAEjC,QAAI,QAAQ,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,iCAAiC;AAC/E,QAAI,CAAC,OAAO;AACV,YAAM,IAAI,YAAY,oBAAoB,KAAK;AAAA,IACjD;AACA,QAAIF,QAAO,MAAM,CAAC;AAClB,QAAIC,UAAS,MAAM,CAAC;AACpB,QAAI,WAAW,WAAW,MAAM,CAAC,KAAK,GAAG;AACzC,QAAIE,OAAMF,QAAO,QAAQ,GAAG;AAC5B,gBAAYE,SAAQ,KAAKA,OAAM,IAAIF,QAAO,SAAS;AACnD,QAAI,eAAeA,QAAO,QAAQ,KAAK,EAAE,EACxC,QAAQ,OAAO,SAAUG,QAAO;AAE/B,kBAAYA,OAAM;AAClB,aAAO;AAAA,IACT,CAAC,EAAE,QAAQ,OAAO,EAAE,EACnB,MAAM,EAAE,EAAE,IAAI,SAAU,GAAG;AAC1B,aAAO,SAAS,CAAC;AAAA,IACnB,CAAC;AACD,QAAI,aAAa,WAAW,GAAG;AAC7B,mBAAa,KAAK,CAAC;AACnB;AAAA,IACF;AACA,WAAO;AAAA,MACL,MAAAJ;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAOO,WAAS,cAAc,OAAO,WAAW;AAC9C,QAAI,MAAM,KAAK,KAAK,CAAC,OAAO,SAAS,KAAK,GAAG;AAC3C,aAAO,OAAO,KAAK;AAAA,IACrB;AACA,QAAI,QAAQ,YAAY,KAAK;AAC7B,QAAI,UAAU,YAAY,OAAO,SAAS;AAC1C,QAAIE,KAAI,QAAQ;AAChB,QAAI,IAAI,QAAQ;AAGhB,QAAI,SAASA,KAAI,MAAM,IAAIA,KAAIA,KAAI,IAAIA,KAAI,IAAIA,KAAI,IAAIA,KAAIA,KAAI;AAC/D,QAAI,SAAS,SAAS,GAAG;AAEvB,aAAO,YAAY,EAAE,UAAUA,KAAI,SAAS,IAAI,EAAE,QAAQ;AACxD,UAAE,KAAK,CAAC;AAAA,MACV;AAAA,IACF,OAAO;AAGL,UAAI,eAAe,KAAK,IAAIA,KAAI,MAAM,KAAK,EAAE,SAAS;AACtD,eAASG,KAAI,GAAGA,KAAI,cAAcA,MAAK;AACrC,UAAE,KAAK,CAAC;AAAA,MACV;AAAA,IACF;AAGA,QAAI,UAAU,KAAK,IAAIH,KAAI,MAAM;AACjC,QAAI,aAAa;AAGjB,WAAO,UAAU,GAAG;AAClB;AACA;AAAA,IACF;AAIA,QAAI,WAAW,EAAE,MAAM,UAAU,EAAE,KAAK,EAAE;AAC1C,QAAI,aAAa,SAAS,SAAS,KAAK,SAAS,UAAU,SAAS,MAAM,OAAO,IAAI,MAAM,WAAW;AACtG,QAAI,MAAM,EAAE,MAAM,GAAG,UAAU,EAAE,KAAK,EAAE,IAAI,aAAa,OAAOA,MAAK,IAAI,MAAM,MAAM,OAAO,SAAS;AACrG,WAAO,QAAQ,OAAO;AAAA,EACxB;AAQO,WAAS,QAAQ,OAAO,WAAW;AACxC,QAAI,MAAM,KAAK,KAAK,CAAC,OAAO,SAAS,KAAK,GAAG;AAC3C,aAAO,OAAO,KAAK;AAAA,IACrB;AACA,QAAI,aAAa,YAAY,KAAK;AAClC,QAAI,UAAU,OAAO,cAAc,WAAW,YAAY,YAAY,WAAW,WAAW,IAAI,SAAS,IAAI;AAC7G,QAAI,IAAI,QAAQ;AAChB,QAAI,IAAI,QAAQ,WAAW;AAG3B,QAAI,KAAK,KAAK,aAAa;AAC3B,QAAI,EAAE,SAAS,IAAI;AACjB,UAAI,EAAE,OAAO,MAAM,KAAK,EAAE,MAAM,CAAC;AAAA,IACnC;AAGA,QAAI,IAAI,GAAG;AACT,UAAI,MAAM,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC;AAC1B,UAAI;AAAA,IACN;AAGA,QAAI,IAAI,EAAE,QAAQ;AAChB,QAAE,OAAO,GAAG,GAAG,MAAM,IAAI,OAAO,GAAG;AAAA,IACrC;AACA,WAAO,QAAQ,OAAO,EAAE,KAAK,EAAE;AAAA,EACjC;AASO,WAAS,cAAc,OAAO,WAAW;AAC9C,QAAI,MAAM,KAAK,KAAK,CAAC,OAAO,SAAS,OAAO,KAAK,CAAC,GAAG;AACnD,aAAO,OAAO,KAAK;AAAA,IACrB;AAGA,QAAI,QAAQ,YAAY,KAAK;AAC7B,QAAI,UAAU,YAAY,YAAY,OAAO,SAAS,IAAI;AAC1D,QAAI,IAAI,QAAQ;AAChB,QAAIA,KAAI,QAAQ;AAGhB,QAAI,EAAE,SAAS,WAAW;AACxB,UAAI,EAAE,OAAO,MAAM,YAAY,EAAE,MAAM,CAAC;AAAA,IAC1C;AAGA,QAAI,QAAQ,EAAE,MAAM;AACpB,WAAO,QAAQ,OAAO,SAAS,EAAE,SAAS,IAAI,MAAM,EAAE,KAAK,EAAE,IAAI,MAAM,OAAOA,MAAK,IAAI,MAAM,MAAMA;AAAA,EACrG;AAYO,WAAS,YAAY,OAAO,WAAW,SAAS;AACrD,QAAI,MAAM,KAAK,KAAK,CAAC,OAAO,SAAS,KAAK,GAAG;AAC3C,aAAO,OAAO,KAAK;AAAA,IACrB;AAGA,QAAI,WAAW,mBAAmB,YAAY,QAAQ,YAAY,SAAS,SAAS,QAAQ,UAAU,EAAE;AACxG,QAAI,WAAW,mBAAmB,YAAY,QAAQ,YAAY,SAAS,SAAS,QAAQ,UAAU,CAAC;AACvG,QAAI,QAAQ,YAAY,KAAK;AAC7B,QAAI,UAAU,YAAY,YAAY,OAAO,SAAS,IAAI;AAC1D,QAAI,QAAQ,WAAW,YAAY,QAAQ,YAAY,UAAU;AAE/D,aAAO,cAAc,OAAO,SAAS;AAAA,IACvC,OAAO;AACL,UAAI,IAAI,QAAQ;AAChB,UAAIA,KAAI,QAAQ;AAGhB,UAAI,EAAE,SAAS,WAAW;AACxB,YAAI,EAAE,OAAO,MAAM,YAAY,EAAE,MAAM,CAAC;AAAA,MAC1C;AAIA,UAAI,EAAE,OAAO,MAAMA,KAAI,EAAE,SAAS,KAAK,EAAE,SAAS,YAAY,YAAY,EAAE,SAAS,EAAE,CAAC;AAGxF,UAAI,MAAM,CAACA,EAAC,EAAE,OAAO,CAAC;AACtB,UAAIC,OAAMD,KAAI,IAAIA,KAAI;AACtB,UAAIC,OAAM,EAAE,SAAS,GAAG;AACtB,UAAE,OAAOA,OAAM,GAAG,GAAG,GAAG;AAAA,MAC1B;AACA,aAAO,QAAQ,OAAO,EAAE,KAAK,EAAE;AAAA,IACjC;AAAA,EACF;AAUO,WAAS,YAAY,OAAO,WAAW;AAE5C,QAAI,UAAU;AAAA,MACZ,MAAM,MAAM;AAAA,MACZ,cAAc,MAAM;AAAA,MACpB,UAAU,MAAM;AAAA,IAClB;AACA,QAAI,IAAI,QAAQ;AAGhB,WAAO,aAAa,GAAG;AACrB,QAAE,QAAQ,CAAC;AACX,cAAQ;AACR;AAAA,IACF;AACA,QAAI,EAAE,SAAS,WAAW;AACxB,UAAI,UAAU,EAAE,OAAO,WAAW,EAAE,SAAS,SAAS;AACtD,UAAI,QAAQ,CAAC,KAAK,GAAG;AACnB,YAAIE,KAAI,YAAY;AACpB,UAAEA,EAAC;AACH,eAAO,EAAEA,EAAC,MAAM,IAAI;AAClB,YAAE,IAAI;AACN,cAAIA,OAAM,GAAG;AACX,cAAE,QAAQ,CAAC;AACX,oBAAQ;AACR,YAAAA;AAAA,UACF;AACA,UAAAA;AACA,YAAEA,EAAC;AAAA,QACL;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAOA,WAAS,MAAM,QAAQ;AACrB,QAAI,MAAM,CAAC;AACX,aAASA,KAAI,GAAGA,KAAI,QAAQA,MAAK;AAC/B,UAAI,KAAK,CAAC;AAAA,IACZ;AACA,WAAO;AAAA,EACT;AAaO,WAAS,OAAO,OAAO;AAC5B,WAAO,MAAM,cAAc,EAAE,QAAQ,QAAQ,EAAE,EAC9C,QAAQ,cAAc,EAAE,EACxB;AAAA,EACH;AAmBO,WAAS,YAAY,GAAG,GAAG;AAChC,QAAI,SAAS,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACjF,QAAI,SAAS,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACjF,QAAI,UAAU,GAAG;AACf,YAAM,IAAI,MAAM,2CAA2C;AAAA,IAC7D;AACA,QAAI,SAAS,GAAG;AACd,YAAM,IAAI,MAAM,uCAAuC;AAAA,IACzD;AAGA,QAAI,MAAM,CAAC,KAAK,MAAM,CAAC,GAAG;AACxB,aAAO;AAAA,IACT;AACA,QAAI,CAAC,OAAO,SAAS,CAAC,KAAK,CAAC,OAAO,SAAS,CAAC,GAAG;AAC9C,aAAO,MAAM;AAAA,IACf;AACA,QAAI,MAAM,GAAG;AACX,aAAO;AAAA,IACT;AAGA,WAAO,KAAK,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,SAAS,KAAK,IAAI,KAAK,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,GAAG,MAAM;AAAA,EACxF;AAOO,MAAI,QAAQ,KAAK,SAAS,SAAU,GAAG;AAC5C,WAAO,KAAK,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC;AAAA,EAC1C;AACO,MAAI,QAAQ,KAAK,SAAS,SAAU,GAAG;AAC5C,WAAO,KAAK,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC;AAAA,EAC1C;AAOO,MAAI,QAAQ,KAAK,SAAS,SAAU,GAAG;AAC5C,WAAO,KAAK,KAAK,IAAI,MAAM,IAAI,EAAE,IAAI;AAAA,EACvC;AAOO,MAAI,OAAO,KAAK,QAAQ,SAAU,GAAG;AAC1C,YAAQ,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,KAAK;AAAA,EACxC;AAOO,MAAI,OAAO,KAAK,QAAQ,SAAU,GAAG;AAC1C,YAAQ,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,KAAK;AAAA,EACxC;AAOO,MAAI,OAAO,KAAK,QAAQ,SAAU,GAAG;AAC1C,QAAIH,KAAI,KAAK,IAAI,IAAI,CAAC;AACtB,YAAQA,KAAI,MAAMA,KAAI;AAAA,EACxB;AAQO,WAAS,SAAS,GAAG,GAAG;AAC7B,QAAI,QAAQ,IAAI,IAAI,OAAO,IAAI,IAAI,QAAQ,IAAI,MAAM;AACrD,QAAI,QAAQ,IAAI,IAAI,OAAO,IAAI,IAAI,QAAQ,IAAI,MAAM;AACrD,WAAO,QAAQ,QAAQ,CAAC,IAAI;AAAA,EAC9B;AACA,WAAS,iBAAiB,OAAO,SAAS;AACxC,QAAI,SAAS,KAAK,GAAG;AACnB,aAAO;AAAA,IACT,WAAW,YAAY,KAAK,GAAG;AAC7B,aAAO,MAAM,SAAS;AAAA,IACxB,OAAO;AACL,cAAQ;AAAA,IACV;AAAA,EACF;AACA,WAAS,mBAAmB,OAAO,cAAc;AAC/C,QAAI,SAAS,KAAK,GAAG;AACnB,aAAO;AAAA,IACT,WAAW,YAAY,KAAK,GAAG;AAC7B,aAAO,MAAM,SAAS;AAAA,IACxB,OAAO;AACL,aAAO;AAAA,IACT;AAAA,EACF;;;AFzqBA,MAAI,gBAAgB,SAAS,eAAe;AAG1C,oBAAgB,sBAAAI,QAAc;AAC9B,WAAO,sBAAAA;AAAA,EACT;AACA,MAAI,eAAe,CAAC,cAAc,YAAY,gBAAgB,WAAW;AAOlE,MAAI,cAA6B,wBAAQ,SAAS,cAAc,SAASC,aAAY,MAAM;AAChG,QAAI;AAAA,MACF,WAAAC;AAAA,MACA,SAAAC;AAAA,MACA,aAAAC;AAAA,MACA,UAAAC;AAAA,IACF,IAAI;AAIJ,QAAIC,SAAQ,cAAc;AAK1B,IAAAA,OAAM,MAAM;AACZ,IAAAA,OAAM,SAAS;AAAA,MAAC;AAAA,QACd,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA;AAAA,QACE,MAAM;AAAA,QACN,MAAM,OAAK,YAAY,6xgBAA6xgB,KAAK,CAAC;AAAA,MAC5zgB;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA,MAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AAAA;AAAA,IACA,CAAC;AACD,IAAAA,OAAM,eAAe,CAAC;AAAA,MACpB,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,YAAI,CAACJ,YAAW;AACd,2BAAiB,CAAC;AAAA,QACpB;AAGA,YAAI,OAAO,CAAC,IAAI,IAAI;AAClB,gBAAM,IAAI,UAAU,yFAA8F,IAAI,uDAA4D;AAAA,QACpL;AACA,eAAO,IAAIA,WAAU,CAAC;AAAA,MACxB;AAAA,IACF,GAAG;AAAA,MACD,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,YAAI,CAACC,UAAS;AACZ,yBAAe,CAAC;AAAA,QAClB;AACA,eAAO,IAAIA,SAAQ,GAAG,CAAC;AAAA,MACzB;AAAA,IACF,GAAG;AAAA,MACD,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,YAAI,CAACA,UAAS;AACZ,yBAAe,CAAC;AAAA,QAClB;AACA,eAAO,IAAIA,SAAQ,EAAE,SAAS,GAAG,CAAC;AAAA,MACpC;AAAA,IACF,GAAG;AAAA,MACD,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,YAAI,IAAI,OAAO,kBAAkB;AAC/B,gBAAM,IAAI,UAAU,kGAAuG,IAAI,GAAG;AAAA,QACpI;AACA,eAAO,OAAO,CAAC;AAAA,MACjB;AAAA,IACF,GAAG;AAAA,MACD,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,YAAI,CAACD,YAAW;AACd,2BAAiB,CAAC;AAAA,QACpB;AACA,eAAO,IAAIA,WAAU,EAAE,SAAS,CAAC;AAAA,MACnC;AAAA,IACF,GAAG;AAAA,MACD,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,YAAI,CAACG,WAAU;AACb,0BAAgB,CAAC;AAAA,QACnB;AACA,eAAO,IAAIA,UAAS,CAAC;AAAA,MACvB;AAAA,IACF,GAAG;AAAA,MACD,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,cAAM,IAAI,UAAU,2JAAgK;AAAA,MACtL;AAAA,IACF,GAAG;AAAA,MACD,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,YAAI,CAACF,UAAS;AACZ,yBAAe,CAAC;AAAA,QAClB;AACA,eAAO,IAAIA,SAAQ,EAAE,QAAQ,GAAG,CAAC;AAAA,MACnC;AAAA,IACF,GAAG;AAAA,MACD,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,YAAI,CAACE,WAAU;AACb,0BAAgB,CAAC;AAAA,QACnB;AACA,YAAI,IAAI,IAAIA,UAAS,CAAC;AACtB,YAAI,EAAE,QAAQ,MAAM,GAAG;AACrB,gBAAM,IAAI,UAAU,qGAA0G,IAAI,qDAA0D;AAAA,QAC9L;AACA,eAAO;AAAA,MACT;AAAA,IACF,GAAG;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQD,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,YAAI,IAAI,OAAO,CAAC;AAChB,YAAI,MAAM,CAAC,GAAG;AACZ,gBAAM,IAAI,MAAM,qBAAqB,IAAI,eAAe;AAAA,QAC1D;AACA,eAAO;AAAA,MACT;AAAA,IACF,GAAG;AAAA,MACD,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,YAAI,CAACH,YAAW;AACd,2BAAiB,CAAC;AAAA,QACpB;AACA,YAAI;AACF,iBAAO,IAAIA,WAAU,CAAC;AAAA,QACxB,SAAS,KAAK;AACZ,gBAAM,IAAI,MAAM,qBAAqB,IAAI,gBAAgB;AAAA,QAC3D;AAAA,MACF;AAAA,IACF,GAAG;AAAA,MACD,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,YAAI;AACF,iBAAO,OAAO,CAAC;AAAA,QACjB,SAAS,KAAK;AACZ,gBAAM,IAAI,MAAM,qBAAqB,IAAI,aAAa;AAAA,QACxD;AAAA,MACF;AAAA,IACF,GAAG;AAAA,MACD,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,YAAI,CAACG,WAAU;AACb,0BAAgB,CAAC;AAAA,QACnB;AACA,YAAI;AACF,iBAAO,IAAIA,UAAS,CAAC;AAAA,QACvB,SAAS,KAAK;AACZ,gBAAM,IAAI,MAAM,qBAAqB,IAAI,eAAe;AAAA,QAC1D;AAAA,MACF;AAAA,IACF,GAAG;AAAA,MACD,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,YAAI,CAACF,UAAS;AACZ,yBAAe,CAAC;AAAA,QAClB;AACA,YAAI;AACF,iBAAO,IAAIA,SAAQ,CAAC;AAAA,QACtB,SAAS,KAAK;AACZ,gBAAM,IAAI,MAAM,qBAAqB,IAAI,cAAc;AAAA,QACzD;AAAA,MACF;AAAA,IACF,GAAG;AAAA,MACD,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,eAAO,CAAC;AAAA,MACV;AAAA,IACF,GAAG;AAAA,MACD,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,YAAI,CAACD,YAAW;AACd,2BAAiB,CAAC;AAAA,QACpB;AACA,eAAO,IAAIA,WAAU,CAAC,CAAC;AAAA,MACzB;AAAA,IACF,GAAG;AAAA,MACD,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,eAAO,OAAO,CAAC,CAAC;AAAA,MAClB;AAAA,IACF,GAAG;AAAA,MACD,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,YAAI,CAACG,WAAU;AACb,0BAAgB,CAAC;AAAA,QACnB;AACA,eAAO,IAAIA,UAAS,CAAC,CAAC;AAAA,MACxB;AAAA,IACF,GAAG;AAAA,MACD,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,SAAS,SAAS,QAAQ,GAAG;AAC3B,eAAO,OAAO,CAAC;AAAA,MACjB;AAAA,IACF,GAAG;AAAA,MACD,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,SAAS,SAAS,QAAQ,OAAO;AAC/B,YAAI,CAACD,cAAa;AAChB,wBAAc;AAAA,QAChB;AACA,eAAO,IAAIA,aAAY,KAAK;AAAA,MAC9B;AAAA,IACF,GAAG;AAAA,MACD,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,SAAS,SAAS,QAAQG,SAAQ;AAChC,eAAOA,QAAO,QAAQ;AAAA,MACxB;AAAA,IACF,CAAC,CAAC;AAMF,IAAAD,OAAM,aAAa,CAACE,SAAM,MAAM,eAAe;AAC7C,UAAI,aAAaF,OAAM,YAAYE,SAAM,MAAM,UAAU;AACzD,UAAI,CAAC,aAAa,UAAU,EAAE,SAAS,WAAW,KAAK,QAAQ,KAAK,KAAK,WAAW,KAAK,aAAa,KAAK,CAAC,CAAC;AAAA,MAE7G,WAAW,KAAK,SAAO,CAAC,IAAI,OAAO,SAAS,GAAG,CAAC,GAAG;AACjD,YAAI,MAAM,IAAI,UAAU,aAAa,OAAOA,SAAM,0CAA0C,IAAI,4CAA4C,OAAOA,SAAM,KAAK,CAAC;AAC/J,YAAI,OAAO,WAAW;AACtB,cAAM;AAAA,MACR;AACA,YAAM;AAAA,IACR;AAMA,IAAAF,OAAM,aAAa,CAACE,SAAM,MAAM,eAAe;AAC7C,UAAI,aAAaF,OAAM,YAAYE,SAAM,MAAM,UAAU;AACzD,UAAI,CAAC,aAAa,UAAU,EAAE,SAAS,WAAW,KAAK,QAAQ,KAAK,KAAK,WAAW,KAAK,aAAa,KAAK,CAAC,CAAC;AAAA,MAE7G,WAAW,KAAK,SAAO,CAAC,IAAI,OAAO,SAAS,GAAG,CAAC,GAAG;AACjD,YAAI,MAAM,IAAI,UAAU,aAAa,OAAOA,SAAM,0CAA0C,IAAI,4CAA4C,OAAOA,SAAM,KAAK,CAAC;AAC/J,YAAI,OAAO,WAAW;AACtB,cAAM;AAAA,MACR;AACA,YAAM;AAAA,IACR;AACA,WAAOF;AAAA,EACT,CAAC;AACD,WAAS,iBAAiB,GAAG;AAC3B,UAAM,IAAI,MAAM,wBAAwB,OAAO,GAAG,kDAAkD,CAAC;AAAA,EACvG;AACA,WAAS,eAAe,GAAG;AACzB,UAAM,IAAI,MAAM,wBAAwB,OAAO,GAAG,qDAAqD,CAAC;AAAA,EAC1G;AACA,WAAS,gBAAgB;AACvB,UAAM,IAAI,MAAM,qEAAuE;AAAA,EACzF;AACA,WAAS,gBAAgB,GAAG;AAC1B,UAAM,IAAI,MAAM,wBAAwB,OAAO,GAAG,iDAAiD,CAAC;AAAA,EACtG;;;AGrcA,MAAI,OAAO;AACX,MAAIG,gBAAe,CAAC;AACb,MAAI,kBAAiC,wBAAQ,MAAMA,eAAc,MAAM;AAO5E,aAASC,WAAU,SAAS;AAC1B,UAAI,EAAE,gBAAgBA,aAAY;AAChC,cAAM,IAAI,YAAY,kDAAkD;AAAA,MAC1E;AACA,WAAK,UAAU,WAAW,CAAC;AAAA,IAC7B;AAKA,IAAAA,WAAU,UAAU,OAAO;AAC3B,IAAAA,WAAU,UAAU,cAAc;AAOlC,IAAAA,WAAU,UAAU,UAAU,WAAY;AACxC,aAAO,KAAK;AAAA,IACd;AAOA,IAAAA,WAAU,UAAU,WAAW,WAAY;AACzC,aAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,EAAE,KAAK,IAAI,IAAI;AAAA,IACrD;AAQA,IAAAA,WAAU,UAAU,SAAS,WAAY;AACvC,aAAO;AAAA,QACL,QAAQ;AAAA,QACR,SAAS,KAAK;AAAA,MAChB;AAAA,IACF;AASA,IAAAA,WAAU,WAAW,SAAU,MAAM;AACnC,aAAO,IAAIA,WAAU,KAAK,OAAO;AAAA,IACnC;AACA,WAAOA;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,EACX,CAAC;;;ACrDD,MAAI,YAAY;AAAhB,MAIE,aAAa;AAJf,MAOE,WAAW;AAPb,MAUE,OAAO;AAVT,MAaE,KAAK;AAbP,MAiBE,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA,IAOT,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAiBX,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAeV,QAAQ;AAAA;AAAA;AAAA;AAAA,IAIR,UAAU;AAAA;AAAA;AAAA;AAAA,IAIV,UAAW;AAAA;AAAA;AAAA;AAAA,IAIX,MAAM,CAAC;AAAA;AAAA;AAAA;AAAA,IAIP,MAAM;AAAA;AAAA;AAAA,IAGN,QAAQ;AAAA;AAAA,EACV;AA5EF,MAkFE;AAlFF,MAkFW;AAlFX,MAmFE,WAAW;AAnFb,MAqFE,eAAe;AArFjB,MAsFE,kBAAkB,eAAe;AAtFnC,MAuFE,yBAAyB,eAAe;AAvF1C,MAwFE,oBAAoB,eAAe;AAxFrC,MAyFE,MAAM;AAzFR,MA2FE,YAAY,KAAK;AA3FnB,MA4FE,UAAU,KAAK;AA5FjB,MA8FE,WAAW;AA9Fb,MA+FE,QAAQ;AA/FV,MAgGE,UAAU;AAhGZ,MAiGE,YAAY;AAjGd,MAmGE,OAAO;AAnGT,MAoGE,WAAW;AApGb,MAqGE,mBAAmB;AArGrB,MAuGE,iBAAiB,KAAK,SAAS;AAvGjC,MAwGE,eAAe,GAAG,SAAS;AAxG7B,MA2GE,IAAI,EAAE,aAAa,IAAI;AA0EzB,IAAE,gBAAgB,EAAE,MAAM,WAAY;AACpC,QAAI,IAAI,IAAI,KAAK,YAAY,IAAI;AACjC,QAAI,EAAE,IAAI,EAAG,GAAE,IAAI;AACnB,WAAO,SAAS,CAAC;AAAA,EACnB;AAQA,IAAE,OAAO,WAAY;AACnB,WAAO,SAAS,IAAI,KAAK,YAAY,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC;AAAA,EAC3D;AAWA,IAAE,YAAY,EAAE,QAAQ,SAAUC,MAAKC,MAAK;AAC1C,QAAI,GACF,IAAI,MACJ,OAAO,EAAE;AACX,IAAAD,OAAM,IAAI,KAAKA,IAAG;AAClB,IAAAC,OAAM,IAAI,KAAKA,IAAG;AAClB,QAAI,CAACD,KAAI,KAAK,CAACC,KAAI,EAAG,QAAO,IAAI,KAAK,GAAG;AACzC,QAAID,KAAI,GAAGC,IAAG,EAAG,OAAM,MAAM,kBAAkBA,IAAG;AAClD,QAAI,EAAE,IAAID,IAAG;AACb,WAAO,IAAI,IAAIA,OAAM,EAAE,IAAIC,IAAG,IAAI,IAAIA,OAAM,IAAI,KAAK,CAAC;AAAA,EACxD;AAWA,IAAE,aAAa,EAAE,MAAM,SAAU,GAAG;AAClC,QAAIC,IAAG,GAAG,KAAK,KACb,IAAI,MACJ,KAAK,EAAE,GACP,MAAM,IAAI,IAAI,EAAE,YAAY,CAAC,GAAG,GAChC,KAAK,EAAE,GACP,KAAK,EAAE;AAGT,QAAI,CAAC,MAAM,CAAC,IAAI;AACd,aAAO,CAAC,MAAM,CAAC,KAAK,MAAM,OAAO,KAAK,KAAK,OAAO,KAAK,IAAI,CAAC,KAAK,KAAK,IAAI,IAAI;AAAA,IAChF;AAGA,QAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAG,QAAO,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK;AAGxD,QAAI,OAAO,GAAI,QAAO;AAGtB,QAAI,EAAE,MAAM,EAAE,EAAG,QAAO,EAAE,IAAI,EAAE,IAAI,KAAK,IAAI,IAAI;AAEjD,UAAM,GAAG;AACT,UAAM,GAAG;AAGT,SAAKA,KAAI,GAAG,IAAI,MAAM,MAAM,MAAM,KAAKA,KAAI,GAAG,EAAEA,IAAG;AACjD,UAAI,GAAGA,EAAC,MAAM,GAAGA,EAAC,EAAG,QAAO,GAAGA,EAAC,IAAI,GAAGA,EAAC,IAAI,KAAK,IAAI,IAAI;AAAA,IAC3D;AAGA,WAAO,QAAQ,MAAM,IAAI,MAAM,MAAM,KAAK,IAAI,IAAI;AAAA,EACpD;AAgBA,IAAE,SAAS,EAAE,MAAM,WAAY;AAC7B,QAAI,IAAI,IACN,IAAI,MACJ,OAAO,EAAE;AAEX,QAAI,CAAC,EAAE,EAAG,QAAO,IAAI,KAAK,GAAG;AAG7B,QAAI,CAAC,EAAE,EAAE,CAAC,EAAG,QAAO,IAAI,KAAK,CAAC;AAE9B,SAAK,KAAK;AACV,SAAK,KAAK;AACV,SAAK,YAAY,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI;AAC9C,SAAK,WAAW;AAEhB,QAAI,OAAO,MAAM,iBAAiB,MAAM,CAAC,CAAC;AAE1C,SAAK,YAAY;AACjB,SAAK,WAAW;AAEhB,WAAO,SAAS,YAAY,KAAK,YAAY,IAAI,EAAE,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI;AAAA,EAC5E;AAmBA,IAAE,WAAW,EAAE,OAAO,WAAY;AAChC,QAAIC,IAAG,GAAG,GAAG,GAAG,KAAK,GAAG,IAAI,GAAG,IAAI,SACjC,IAAI,MACJ,OAAO,EAAE;AAEX,QAAI,CAAC,EAAE,SAAS,KAAK,EAAE,OAAO,EAAG,QAAO,IAAI,KAAK,CAAC;AAClD,eAAW;AAGX,QAAI,EAAE,IAAI,QAAQ,EAAE,IAAI,GAAG,IAAI,CAAC;AAIhC,QAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,IAAI,GAAG;AAC9B,UAAI,eAAe,EAAE,CAAC;AACtB,MAAAA,KAAI,EAAE;AAGN,UAAI,KAAKA,KAAI,EAAE,SAAS,KAAK,EAAG,MAAM,KAAK,KAAK,KAAK,KAAK,MAAM;AAChE,UAAI,QAAQ,GAAG,IAAI,CAAC;AAGpB,MAAAA,KAAI,WAAWA,KAAI,KAAK,CAAC,KAAKA,KAAI,MAAMA,KAAI,IAAI,KAAK;AAErD,UAAI,KAAK,IAAI,GAAG;AACd,YAAI,OAAOA;AAAA,MACb,OAAO;AACL,YAAI,EAAE,cAAc;AACpB,YAAI,EAAE,MAAM,GAAG,EAAE,QAAQ,GAAG,IAAI,CAAC,IAAIA;AAAA,MACvC;AAEA,UAAI,IAAI,KAAK,CAAC;AACd,QAAE,IAAI,EAAE;AAAA,IACV,OAAO;AACL,UAAI,IAAI,KAAK,EAAE,SAAS,CAAC;AAAA,IAC3B;AAEA,UAAMA,KAAI,KAAK,aAAa;AAI5B,eAAS;AACP,UAAI;AACJ,WAAK,EAAE,MAAM,CAAC,EAAE,MAAM,CAAC;AACvB,gBAAU,GAAG,KAAK,CAAC;AACnB,UAAI,OAAO,QAAQ,KAAK,CAAC,EAAE,MAAM,CAAC,GAAG,QAAQ,KAAK,EAAE,GAAG,KAAK,GAAG,CAAC;AAGhE,UAAI,eAAe,EAAE,CAAC,EAAE,MAAM,GAAG,EAAE,OAAO,IAAI,eAAe,EAAE,CAAC,GAAG,MAAM,GAAG,EAAE,GAAG;AAC/E,YAAI,EAAE,MAAM,KAAK,GAAG,KAAK,CAAC;AAI1B,YAAI,KAAK,UAAU,CAAC,OAAO,KAAK,QAAQ;AAItC,cAAI,CAAC,KAAK;AACR,qBAAS,GAAGA,KAAI,GAAG,CAAC;AAEpB,gBAAI,EAAE,MAAM,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,GAAG;AAC7B,kBAAI;AACJ;AAAA,YACF;AAAA,UACF;AAEA,gBAAM;AACN,gBAAM;AAAA,QACR,OAAO;AAIL,cAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,KAAK;AAG7C,qBAAS,GAAGA,KAAI,GAAG,CAAC;AACpB,gBAAI,CAAC,EAAE,MAAM,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC;AAAA,UAC/B;AAEA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,eAAW;AAEX,WAAO,SAAS,GAAGA,IAAG,KAAK,UAAU,CAAC;AAAA,EACxC;AAOA,IAAE,gBAAgB,EAAE,KAAK,WAAY;AACnC,QAAI,GACF,IAAI,KAAK,GACT,IAAI;AAEN,QAAI,GAAG;AACL,UAAI,EAAE,SAAS;AACf,WAAK,IAAI,UAAU,KAAK,IAAI,QAAQ,KAAK;AAGzC,UAAI,EAAE,CAAC;AACP,UAAI,EAAG,QAAO,IAAI,MAAM,GAAG,KAAK,GAAI;AACpC,UAAI,IAAI,EAAG,KAAI;AAAA,IACjB;AAEA,WAAO;AAAA,EACT;AAwBA,IAAE,YAAY,EAAE,MAAM,SAAU,GAAG;AACjC,WAAO,OAAO,MAAM,IAAI,KAAK,YAAY,CAAC,CAAC;AAAA,EAC7C;AAQA,IAAE,qBAAqB,EAAE,WAAW,SAAU,GAAG;AAC/C,QAAI,IAAI,MACN,OAAO,EAAE;AACX,WAAO,SAAS,OAAO,GAAG,IAAI,KAAK,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,KAAK,WAAW,KAAK,QAAQ;AAAA,EAChF;AAOA,IAAE,SAAS,EAAE,KAAK,SAAU,GAAG;AAC7B,WAAO,KAAK,IAAI,CAAC,MAAM;AAAA,EACzB;AAQA,IAAE,QAAQ,WAAY;AACpB,WAAO,SAAS,IAAI,KAAK,YAAY,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC;AAAA,EAC3D;AAQA,IAAE,cAAc,EAAE,KAAK,SAAU,GAAG;AAClC,WAAO,KAAK,IAAI,CAAC,IAAI;AAAA,EACvB;AAQA,IAAE,uBAAuB,EAAE,MAAM,SAAU,GAAG;AAC5C,QAAI,IAAI,KAAK,IAAI,CAAC;AAClB,WAAO,KAAK,KAAK,MAAM;AAAA,EACzB;AA4BA,IAAE,mBAAmB,EAAE,OAAO,WAAY;AACxC,QAAI,GAAG,GAAG,IAAI,IAAI,KAChB,IAAI,MACJ,OAAO,EAAE,aACT,MAAM,IAAI,KAAK,CAAC;AAElB,QAAI,CAAC,EAAE,SAAS,EAAG,QAAO,IAAI,KAAK,EAAE,IAAI,IAAI,IAAI,GAAG;AACpD,QAAI,EAAE,OAAO,EAAG,QAAO;AAEvB,SAAK,KAAK;AACV,SAAK,KAAK;AACV,SAAK,YAAY,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI;AAC9C,SAAK,WAAW;AAChB,UAAM,EAAE,EAAE;AAOV,QAAI,MAAM,IAAI;AACZ,UAAI,KAAK,KAAK,MAAM,CAAC;AACrB,WAAK,IAAI,QAAQ,GAAG,CAAC,GAAG,SAAS;AAAA,IACnC,OAAO;AACL,UAAI;AACJ,UAAI;AAAA,IACN;AAEA,QAAI,aAAa,MAAM,GAAG,EAAE,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,GAAG,IAAI;AAGvD,QAAI,SACFD,KAAI,GACJ,KAAK,IAAI,KAAK,CAAC;AACjB,WAAOA,QAAM;AACX,gBAAU,EAAE,MAAM,CAAC;AACnB,UAAI,IAAI,MAAM,QAAQ,MAAM,GAAG,MAAM,QAAQ,MAAM,EAAE,CAAC,CAAC,CAAC;AAAA,IAC1D;AAEA,WAAO,SAAS,GAAG,KAAK,YAAY,IAAI,KAAK,WAAW,IAAI,IAAI;AAAA,EAClE;AAiCA,IAAE,iBAAiB,EAAE,OAAO,WAAY;AACtC,QAAI,GAAG,IAAI,IAAI,KACb,IAAI,MACJ,OAAO,EAAE;AAEX,QAAI,CAAC,EAAE,SAAS,KAAK,EAAE,OAAO,EAAG,QAAO,IAAI,KAAK,CAAC;AAElD,SAAK,KAAK;AACV,SAAK,KAAK;AACV,SAAK,YAAY,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI;AAC9C,SAAK,WAAW;AAChB,UAAM,EAAE,EAAE;AAEV,QAAI,MAAM,GAAG;AACX,UAAI,aAAa,MAAM,GAAG,GAAG,GAAG,IAAI;AAAA,IACtC,OAAO;AAWL,UAAI,MAAM,KAAK,KAAK,GAAG;AACvB,UAAI,IAAI,KAAK,KAAK,IAAI;AAEtB,UAAI,EAAE,MAAM,IAAI,QAAQ,GAAG,CAAC,CAAC;AAC7B,UAAI,aAAa,MAAM,GAAG,GAAG,GAAG,IAAI;AAGpC,UAAI,SACF,KAAK,IAAI,KAAK,CAAC,GACf,MAAM,IAAI,KAAK,EAAE,GACjB,MAAM,IAAI,KAAK,EAAE;AACnB,aAAO,OAAM;AACX,kBAAU,EAAE,MAAM,CAAC;AACnB,YAAI,EAAE,MAAM,GAAG,KAAK,QAAQ,MAAM,IAAI,MAAM,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;AAAA,MAClE;AAAA,IACF;AAEA,SAAK,YAAY;AACjB,SAAK,WAAW;AAEhB,WAAO,SAAS,GAAG,IAAI,IAAI,IAAI;AAAA,EACjC;AAmBA,IAAE,oBAAoB,EAAE,OAAO,WAAY;AACzC,QAAI,IAAI,IACN,IAAI,MACJ,OAAO,EAAE;AAEX,QAAI,CAAC,EAAE,SAAS,EAAG,QAAO,IAAI,KAAK,EAAE,CAAC;AACtC,QAAI,EAAE,OAAO,EAAG,QAAO,IAAI,KAAK,CAAC;AAEjC,SAAK,KAAK;AACV,SAAK,KAAK;AACV,SAAK,YAAY,KAAK;AACtB,SAAK,WAAW;AAEhB,WAAO,OAAO,EAAE,KAAK,GAAG,EAAE,KAAK,GAAG,KAAK,YAAY,IAAI,KAAK,WAAW,EAAE;AAAA,EAC3E;AAsBA,IAAE,gBAAgB,EAAE,OAAO,WAAY;AACrC,QAAI,IAAI,MACN,OAAO,EAAE,aACT,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,GACjB,KAAK,KAAK,WACV,KAAK,KAAK;AAEZ,QAAI,MAAM,IAAI;AACZ,aAAO,MAAM,IAET,EAAE,MAAM,IAAI,MAAM,MAAM,IAAI,EAAE,IAAI,IAAI,KAAK,CAAC,IAE5C,IAAI,KAAK,GAAG;AAAA,IAClB;AAEA,QAAI,EAAE,OAAO,EAAG,QAAO,MAAM,MAAM,KAAK,GAAG,EAAE,EAAE,MAAM,GAAG;AAIxD,SAAK,YAAY,KAAK;AACtB,SAAK,WAAW;AAGhB,QAAI,IAAI,KAAK,CAAC,EAAE,MAAM,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK;AAEpD,SAAK,YAAY;AACjB,SAAK,WAAW;AAEhB,WAAO,EAAE,MAAM,CAAC;AAAA,EAClB;AAsBA,IAAE,0BAA0B,EAAE,QAAQ,WAAY;AAChD,QAAI,IAAI,IACN,IAAI,MACJ,OAAO,EAAE;AAEX,QAAI,EAAE,IAAI,CAAC,EAAG,QAAO,IAAI,KAAK,EAAE,GAAG,CAAC,IAAI,IAAI,GAAG;AAC/C,QAAI,CAAC,EAAE,SAAS,EAAG,QAAO,IAAI,KAAK,CAAC;AAEpC,SAAK,KAAK;AACV,SAAK,KAAK;AACV,SAAK,YAAY,KAAK,KAAK,IAAI,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI;AACxD,SAAK,WAAW;AAChB,eAAW;AAEX,QAAI,EAAE,MAAM,CAAC,EAAE,MAAM,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC;AAErC,eAAW;AACX,SAAK,YAAY;AACjB,SAAK,WAAW;AAEhB,WAAO,EAAE,GAAG;AAAA,EACd;AAmBA,IAAE,wBAAwB,EAAE,QAAQ,WAAY;AAC9C,QAAI,IAAI,IACN,IAAI,MACJ,OAAO,EAAE;AAEX,QAAI,CAAC,EAAE,SAAS,KAAK,EAAE,OAAO,EAAG,QAAO,IAAI,KAAK,CAAC;AAElD,SAAK,KAAK;AACV,SAAK,KAAK;AACV,SAAK,YAAY,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI;AAC5D,SAAK,WAAW;AAChB,eAAW;AAEX,QAAI,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC;AAEpC,eAAW;AACX,SAAK,YAAY;AACjB,SAAK,WAAW;AAEhB,WAAO,EAAE,GAAG;AAAA,EACd;AAsBA,IAAE,2BAA2B,EAAE,QAAQ,WAAY;AACjD,QAAI,IAAI,IAAI,KAAK,KACf,IAAI,MACJ,OAAO,EAAE;AAEX,QAAI,CAAC,EAAE,SAAS,EAAG,QAAO,IAAI,KAAK,GAAG;AACtC,QAAI,EAAE,KAAK,EAAG,QAAO,IAAI,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,IAAI,IAAI,EAAE,OAAO,IAAI,IAAI,GAAG;AAE5E,SAAK,KAAK;AACV,SAAK,KAAK;AACV,UAAM,EAAE,GAAG;AAEX,QAAI,KAAK,IAAI,KAAK,EAAE,IAAI,IAAI,CAAC,EAAE,IAAI,EAAG,QAAO,SAAS,IAAI,KAAK,CAAC,GAAG,IAAI,IAAI,IAAI;AAE/E,SAAK,YAAY,MAAM,MAAM,EAAE;AAE/B,QAAI,OAAO,EAAE,KAAK,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC;AAEvD,SAAK,YAAY,KAAK;AACtB,SAAK,WAAW;AAEhB,QAAI,EAAE,GAAG;AAET,SAAK,YAAY;AACjB,SAAK,WAAW;AAEhB,WAAO,EAAE,MAAM,GAAG;AAAA,EACpB;AAwBA,IAAE,cAAc,EAAE,OAAO,WAAY;AACnC,QAAI,QAAQ,GACV,IAAI,IACJ,IAAI,MACJ,OAAO,EAAE;AAEX,QAAI,EAAE,OAAO,EAAG,QAAO,IAAI,KAAK,CAAC;AAEjC,QAAI,EAAE,IAAI,EAAE,IAAI,CAAC;AACjB,SAAK,KAAK;AACV,SAAK,KAAK;AAEV,QAAI,MAAM,IAAI;AAGZ,UAAI,MAAM,GAAG;AACX,iBAAS,MAAM,MAAM,KAAK,GAAG,EAAE,EAAE,MAAM,GAAG;AAC1C,eAAO,IAAI,EAAE;AACb,eAAO;AAAA,MACT;AAGA,aAAO,IAAI,KAAK,GAAG;AAAA,IACrB;AAIA,SAAK,YAAY,KAAK;AACtB,SAAK,WAAW;AAEhB,QAAI,EAAE,IAAI,IAAI,KAAK,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK;AAE7D,SAAK,YAAY;AACjB,SAAK,WAAW;AAEhB,WAAO,EAAE,MAAM,CAAC;AAAA,EAClB;AAqBA,IAAE,iBAAiB,EAAE,OAAO,WAAY;AACtC,QAAIA,IAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,KAAK,IAC7B,IAAI,MACJ,OAAO,EAAE,aACT,KAAK,KAAK,WACV,KAAK,KAAK;AAEZ,QAAI,CAAC,EAAE,SAAS,GAAG;AACjB,UAAI,CAAC,EAAE,EAAG,QAAO,IAAI,KAAK,GAAG;AAC7B,UAAI,KAAK,KAAK,cAAc;AAC1B,YAAI,MAAM,MAAM,KAAK,GAAG,EAAE,EAAE,MAAM,GAAG;AACrC,UAAE,IAAI,EAAE;AACR,eAAO;AAAA,MACT;AAAA,IACF,WAAW,EAAE,OAAO,GAAG;AACrB,aAAO,IAAI,KAAK,CAAC;AAAA,IACnB,WAAW,EAAE,IAAI,EAAE,GAAG,CAAC,KAAK,KAAK,KAAK,cAAc;AAClD,UAAI,MAAM,MAAM,KAAK,GAAG,EAAE,EAAE,MAAM,IAAI;AACtC,QAAE,IAAI,EAAE;AACR,aAAO;AAAA,IACT;AAEA,SAAK,YAAY,MAAM,KAAK;AAC5B,SAAK,WAAW;AAQhB,QAAI,KAAK,IAAI,IAAI,MAAM,WAAW,IAAI,CAAC;AAEvC,SAAKA,KAAI,GAAGA,IAAG,EAAEA,GAAG,KAAI,EAAE,IAAI,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;AAE/D,eAAW;AAEX,QAAI,KAAK,KAAK,MAAM,QAAQ;AAC5B,QAAI;AACJ,SAAK,EAAE,MAAM,CAAC;AACd,QAAI,IAAI,KAAK,CAAC;AACd,SAAK;AAGL,WAAOA,OAAM,MAAK;AAChB,WAAK,GAAG,MAAM,EAAE;AAChB,UAAI,EAAE,MAAM,GAAG,IAAI,KAAK,CAAC,CAAC;AAE1B,WAAK,GAAG,MAAM,EAAE;AAChB,UAAI,EAAE,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC;AAEzB,UAAI,EAAE,EAAE,CAAC,MAAM,OAAQ,MAAKA,KAAI,GAAG,EAAE,EAAEA,EAAC,MAAM,EAAE,EAAEA,EAAC,KAAKA,OAAK;AAAA,IAC/D;AAEA,QAAI,EAAG,KAAI,EAAE,MAAM,KAAM,IAAI,CAAE;AAE/B,eAAW;AAEX,WAAO,SAAS,GAAG,KAAK,YAAY,IAAI,KAAK,WAAW,IAAI,IAAI;AAAA,EAClE;AAOA,IAAE,WAAW,WAAY;AACvB,WAAO,CAAC,CAAC,KAAK;AAAA,EAChB;AAOA,IAAE,YAAY,EAAE,QAAQ,WAAY;AAClC,WAAO,CAAC,CAAC,KAAK,KAAK,UAAU,KAAK,IAAI,QAAQ,IAAI,KAAK,EAAE,SAAS;AAAA,EACpE;AAOA,IAAE,QAAQ,WAAY;AACpB,WAAO,CAAC,KAAK;AAAA,EACf;AAOA,IAAE,aAAa,EAAE,QAAQ,WAAY;AACnC,WAAO,KAAK,IAAI;AAAA,EAClB;AAOA,IAAE,aAAa,EAAE,QAAQ,WAAY;AACnC,WAAO,KAAK,IAAI;AAAA,EAClB;AAOA,IAAE,SAAS,WAAY;AACrB,WAAO,CAAC,CAAC,KAAK,KAAK,KAAK,EAAE,CAAC,MAAM;AAAA,EACnC;AAOA,IAAE,WAAW,EAAE,KAAK,SAAU,GAAG;AAC/B,WAAO,KAAK,IAAI,CAAC,IAAI;AAAA,EACvB;AAOA,IAAE,oBAAoB,EAAE,MAAM,SAAU,GAAG;AACzC,WAAO,KAAK,IAAI,CAAC,IAAI;AAAA,EACvB;AAiCA,IAAE,YAAY,EAAE,MAAM,SAAU,MAAM;AACpC,QAAI,UAAU,GAAG,aAAa,GAAG,KAAK,KAAK,IAAI,GAC7CE,OAAM,MACN,OAAOA,KAAI,aACX,KAAK,KAAK,WACV,KAAK,KAAK,UACV,QAAQ;AAGV,QAAI,QAAQ,MAAM;AAChB,aAAO,IAAI,KAAK,EAAE;AAClB,iBAAW;AAAA,IACb,OAAO;AACL,aAAO,IAAI,KAAK,IAAI;AACpB,UAAI,KAAK;AAGT,UAAI,KAAK,IAAI,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,GAAG,CAAC,EAAG,QAAO,IAAI,KAAK,GAAG;AAEhE,iBAAW,KAAK,GAAG,EAAE;AAAA,IACvB;AAEA,QAAIA,KAAI;AAGR,QAAIA,KAAI,IAAI,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,KAAKA,KAAI,GAAG,CAAC,GAAG;AACzC,aAAO,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC,IAAI,KAAK,IAAIA,KAAI,KAAK,IAAI,MAAM,IAAI,IAAI,IAAI,CAAC;AAAA,IACxE;AAIA,QAAI,UAAU;AACZ,UAAI,EAAE,SAAS,GAAG;AAChB,cAAM;AAAA,MACR,OAAO;AACL,aAAK,IAAI,EAAE,CAAC,GAAG,IAAI,OAAO,IAAI,MAAK;AACnC,cAAM,MAAM;AAAA,MACd;AAAA,IACF;AAEA,eAAW;AACX,SAAK,KAAK;AACV,UAAM,iBAAiBA,MAAK,EAAE;AAC9B,kBAAc,WAAW,QAAQ,MAAM,KAAK,EAAE,IAAI,iBAAiB,MAAM,EAAE;AAG3E,QAAI,OAAO,KAAK,aAAa,IAAI,CAAC;AAgBlC,QAAI,oBAAoB,EAAE,GAAG,IAAI,IAAI,EAAE,GAAG;AAExC,SAAG;AACD,cAAM;AACN,cAAM,iBAAiBA,MAAK,EAAE;AAC9B,sBAAc,WAAW,QAAQ,MAAM,KAAK,EAAE,IAAI,iBAAiB,MAAM,EAAE;AAC3E,YAAI,OAAO,KAAK,aAAa,IAAI,CAAC;AAElC,YAAI,CAAC,KAAK;AAGR,cAAI,CAAC,eAAe,EAAE,CAAC,EAAE,MAAM,IAAI,GAAG,IAAI,EAAE,IAAI,KAAK,MAAM;AACzD,gBAAI,SAAS,GAAG,KAAK,GAAG,CAAC;AAAA,UAC3B;AAEA;AAAA,QACF;AAAA,MACF,SAAS,oBAAoB,EAAE,GAAG,KAAK,IAAI,EAAE;AAAA,IAC/C;AAEA,eAAW;AAEX,WAAO,SAAS,GAAG,IAAI,EAAE;AAAA,EAC3B;AAgDA,IAAE,QAAQ,EAAE,MAAM,SAAU,GAAG;AAC7B,QAAI,GAAGD,IAAGD,IAAG,GAAG,GAAG,KAAK,IAAI,IAAI,IAAI,IAAI,MAAM,IAC5C,IAAI,MACJ,OAAO,EAAE;AAEX,QAAI,IAAI,KAAK,CAAC;AAGd,QAAI,CAAC,EAAE,KAAK,CAAC,EAAE,GAAG;AAGhB,UAAI,CAAC,EAAE,KAAK,CAAC,EAAE,EAAG,KAAI,IAAI,KAAK,GAAG;AAAA,eAGzB,EAAE,EAAG,GAAE,IAAI,CAAC,EAAE;AAAA,UAKlB,KAAI,IAAI,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,IAAI,GAAG;AAE9C,aAAO;AAAA,IACT;AAGA,QAAI,EAAE,KAAK,EAAE,GAAG;AACd,QAAE,IAAI,CAAC,EAAE;AACT,aAAO,EAAE,KAAK,CAAC;AAAA,IACjB;AAEA,SAAK,EAAE;AACP,SAAK,EAAE;AACP,SAAK,KAAK;AACV,SAAK,KAAK;AAGV,QAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG;AAGpB,UAAI,GAAG,CAAC,EAAG,GAAE,IAAI,CAAC,EAAE;AAAA,eAGX,GAAG,CAAC,EAAG,KAAI,IAAI,KAAK,CAAC;AAAA,UAIzB,QAAO,IAAI,KAAK,OAAO,IAAI,KAAK,CAAC;AAEtC,aAAO,WAAW,SAAS,GAAG,IAAI,EAAE,IAAI;AAAA,IAC1C;AAKA,IAAAC,KAAI,UAAU,EAAE,IAAI,QAAQ;AAC5B,SAAK,UAAU,EAAE,IAAI,QAAQ;AAE7B,SAAK,GAAG,MAAM;AACd,QAAI,KAAKA;AAGT,QAAI,GAAG;AACL,aAAO,IAAI;AAEX,UAAI,MAAM;AACR,YAAI;AACJ,YAAI,CAAC;AACL,cAAM,GAAG;AAAA,MACX,OAAO;AACL,YAAI;AACJ,QAAAA,KAAI;AACJ,cAAM,GAAG;AAAA,MACX;AAKA,MAAAD,KAAI,KAAK,IAAI,KAAK,KAAK,KAAK,QAAQ,GAAG,GAAG,IAAI;AAE9C,UAAI,IAAIA,IAAG;AACT,YAAIA;AACJ,UAAE,SAAS;AAAA,MACb;AAGA,QAAE,QAAQ;AACV,WAAKA,KAAI,GAAGA,OAAM,GAAE,KAAK,CAAC;AAC1B,QAAE,QAAQ;AAAA,IAGZ,OAAO;AAIL,MAAAA,KAAI,GAAG;AACP,YAAM,GAAG;AACT,aAAOA,KAAI;AACX,UAAI,KAAM,OAAMA;AAEhB,WAAKA,KAAI,GAAGA,KAAI,KAAKA,MAAK;AACxB,YAAI,GAAGA,EAAC,KAAK,GAAGA,EAAC,GAAG;AAClB,iBAAO,GAAGA,EAAC,IAAI,GAAGA,EAAC;AACnB;AAAA,QACF;AAAA,MACF;AAEA,UAAI;AAAA,IACN;AAEA,QAAI,MAAM;AACR,UAAI;AACJ,WAAK;AACL,WAAK;AACL,QAAE,IAAI,CAAC,EAAE;AAAA,IACX;AAEA,UAAM,GAAG;AAIT,SAAKA,KAAI,GAAG,SAAS,KAAKA,KAAI,GAAG,EAAEA,GAAG,IAAG,KAAK,IAAI;AAGlD,SAAKA,KAAI,GAAG,QAAQA,KAAI,KAAI;AAE1B,UAAI,GAAG,EAAEA,EAAC,IAAI,GAAGA,EAAC,GAAG;AACnB,aAAK,IAAIA,IAAG,KAAK,GAAG,EAAE,CAAC,MAAM,IAAI,IAAG,CAAC,IAAI,OAAO;AAChD,UAAE,GAAG,CAAC;AACN,WAAGA,EAAC,KAAK;AAAA,MACX;AAEA,SAAGA,EAAC,KAAK,GAAGA,EAAC;AAAA,IACf;AAGA,WAAO,GAAG,EAAE,GAAG,MAAM,IAAI,IAAG,IAAI;AAGhC,WAAO,GAAG,CAAC,MAAM,GAAG,GAAG,MAAM,EAAG,GAAEC;AAGlC,QAAI,CAAC,GAAG,CAAC,EAAG,QAAO,IAAI,KAAK,OAAO,IAAI,KAAK,CAAC;AAE7C,MAAE,IAAI;AACN,MAAE,IAAI,kBAAkB,IAAIA,EAAC;AAE7B,WAAO,WAAW,SAAS,GAAG,IAAI,EAAE,IAAI;AAAA,EAC1C;AA2BA,IAAE,SAAS,EAAE,MAAM,SAAU,GAAG;AAC9B,QAAI,GACF,IAAI,MACJ,OAAO,EAAE;AAEX,QAAI,IAAI,KAAK,CAAC;AAGd,QAAI,CAAC,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,EAAG,QAAO,IAAI,KAAK,GAAG;AAGvD,QAAI,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,GAAG;AAC1B,aAAO,SAAS,IAAI,KAAK,CAAC,GAAG,KAAK,WAAW,KAAK,QAAQ;AAAA,IAC5D;AAGA,eAAW;AAEX,QAAI,KAAK,UAAU,GAAG;AAIpB,UAAI,OAAO,GAAG,EAAE,IAAI,GAAG,GAAG,GAAG,CAAC;AAC9B,QAAE,KAAK,EAAE;AAAA,IACX,OAAO;AACL,UAAI,OAAO,GAAG,GAAG,GAAG,KAAK,QAAQ,CAAC;AAAA,IACpC;AAEA,QAAI,EAAE,MAAM,CAAC;AAEb,eAAW;AAEX,WAAO,EAAE,MAAM,CAAC;AAAA,EAClB;AASA,IAAE,qBAAqB,EAAE,MAAM,WAAY;AACzC,WAAO,mBAAmB,IAAI;AAAA,EAChC;AAQA,IAAE,mBAAmB,EAAE,KAAK,WAAY;AACtC,WAAO,iBAAiB,IAAI;AAAA,EAC9B;AAQA,IAAE,UAAU,EAAE,MAAM,WAAY;AAC9B,QAAI,IAAI,IAAI,KAAK,YAAY,IAAI;AACjC,MAAE,IAAI,CAAC,EAAE;AACT,WAAO,SAAS,CAAC;AAAA,EACnB;AAwBA,IAAE,OAAO,EAAE,MAAM,SAAU,GAAG;AAC5B,QAAI,OAAO,GAAGA,IAAGD,IAAG,GAAG,KAAK,IAAI,IAAI,IAAI,IACtC,IAAI,MACJ,OAAO,EAAE;AAEX,QAAI,IAAI,KAAK,CAAC;AAGd,QAAI,CAAC,EAAE,KAAK,CAAC,EAAE,GAAG;AAGhB,UAAI,CAAC,EAAE,KAAK,CAAC,EAAE,EAAG,KAAI,IAAI,KAAK,GAAG;AAAA,eAMzB,CAAC,EAAE,EAAG,KAAI,IAAI,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,IAAI,GAAG;AAExD,aAAO;AAAA,IACT;AAGA,QAAI,EAAE,KAAK,EAAE,GAAG;AACd,QAAE,IAAI,CAAC,EAAE;AACT,aAAO,EAAE,MAAM,CAAC;AAAA,IAClB;AAEA,SAAK,EAAE;AACP,SAAK,EAAE;AACP,SAAK,KAAK;AACV,SAAK,KAAK;AAGV,QAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG;AAIpB,UAAI,CAAC,GAAG,CAAC,EAAG,KAAI,IAAI,KAAK,CAAC;AAE1B,aAAO,WAAW,SAAS,GAAG,IAAI,EAAE,IAAI;AAAA,IAC1C;AAKA,QAAI,UAAU,EAAE,IAAI,QAAQ;AAC5B,IAAAC,KAAI,UAAU,EAAE,IAAI,QAAQ;AAE5B,SAAK,GAAG,MAAM;AACd,IAAAD,KAAI,IAAIC;AAGR,QAAID,IAAG;AAEL,UAAIA,KAAI,GAAG;AACT,YAAI;AACJ,QAAAA,KAAI,CAACA;AACL,cAAM,GAAG;AAAA,MACX,OAAO;AACL,YAAI;AACJ,QAAAC,KAAI;AACJ,cAAM,GAAG;AAAA,MACX;AAGA,UAAI,KAAK,KAAK,KAAK,QAAQ;AAC3B,YAAM,IAAI,MAAM,IAAI,IAAI,MAAM;AAE9B,UAAID,KAAI,KAAK;AACX,QAAAA,KAAI;AACJ,UAAE,SAAS;AAAA,MACb;AAGA,QAAE,QAAQ;AACV,aAAOA,OAAM,GAAE,KAAK,CAAC;AACrB,QAAE,QAAQ;AAAA,IACZ;AAEA,UAAM,GAAG;AACT,IAAAA,KAAI,GAAG;AAGP,QAAI,MAAMA,KAAI,GAAG;AACf,MAAAA,KAAI;AACJ,UAAI;AACJ,WAAK;AACL,WAAK;AAAA,IACP;AAGA,SAAK,QAAQ,GAAGA,MAAI;AAClB,eAAS,GAAG,EAAEA,EAAC,IAAI,GAAGA,EAAC,IAAI,GAAGA,EAAC,IAAI,SAAS,OAAO;AACnD,SAAGA,EAAC,KAAK;AAAA,IACX;AAEA,QAAI,OAAO;AACT,SAAG,QAAQ,KAAK;AAChB,QAAEC;AAAA,IACJ;AAIA,SAAK,MAAM,GAAG,QAAQ,GAAG,EAAE,GAAG,KAAK,IAAI,IAAG,IAAI;AAE9C,MAAE,IAAI;AACN,MAAE,IAAI,kBAAkB,IAAIA,EAAC;AAE7B,WAAO,WAAW,SAAS,GAAG,IAAI,EAAE,IAAI;AAAA,EAC1C;AASA,IAAE,YAAY,EAAE,KAAK,SAAU,GAAG;AAChC,QAAI,GACF,IAAI;AAEN,QAAI,MAAM,UAAU,MAAM,CAAC,CAAC,KAAK,MAAM,KAAK,MAAM,EAAG,OAAM,MAAM,kBAAkB,CAAC;AAEpF,QAAI,EAAE,GAAG;AACP,UAAI,aAAa,EAAE,CAAC;AACpB,UAAI,KAAK,EAAE,IAAI,IAAI,EAAG,KAAI,EAAE,IAAI;AAAA,IAClC,OAAO;AACL,UAAI;AAAA,IACN;AAEA,WAAO;AAAA,EACT;AAQA,IAAE,QAAQ,WAAY;AACpB,QAAI,IAAI,MACN,OAAO,EAAE;AAEX,WAAO,SAAS,IAAI,KAAK,CAAC,GAAG,EAAE,IAAI,GAAG,KAAK,QAAQ;AAAA,EACrD;AAkBA,IAAE,OAAO,EAAE,MAAM,WAAY;AAC3B,QAAI,IAAI,IACN,IAAI,MACJ,OAAO,EAAE;AAEX,QAAI,CAAC,EAAE,SAAS,EAAG,QAAO,IAAI,KAAK,GAAG;AACtC,QAAI,EAAE,OAAO,EAAG,QAAO,IAAI,KAAK,CAAC;AAEjC,SAAK,KAAK;AACV,SAAK,KAAK;AACV,SAAK,YAAY,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI;AAC9C,SAAK,WAAW;AAEhB,QAAI,KAAK,MAAM,iBAAiB,MAAM,CAAC,CAAC;AAExC,SAAK,YAAY;AACjB,SAAK,WAAW;AAEhB,WAAO,SAAS,WAAW,IAAI,EAAE,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI;AAAA,EAC1D;AAeA,IAAE,aAAa,EAAE,OAAO,WAAY;AAClC,QAAI,GAAG,GAAG,IAAI,GAAG,KAAK,GACpB,IAAI,MACJ,IAAI,EAAE,GACNA,KAAI,EAAE,GACN,IAAI,EAAE,GACN,OAAO,EAAE;AAGX,QAAI,MAAM,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG;AAC1B,aAAO,IAAI,KAAK,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC;AAAA,IACnE;AAEA,eAAW;AAGX,QAAI,KAAK,KAAK,CAAC,CAAC;AAIhB,QAAI,KAAK,KAAK,KAAK,IAAI,GAAG;AACxB,UAAI,eAAe,CAAC;AAEpB,WAAK,EAAE,SAASA,MAAK,KAAK,EAAG,MAAK;AAClC,UAAI,KAAK,KAAK,CAAC;AACf,MAAAA,KAAI,WAAWA,KAAI,KAAK,CAAC,KAAKA,KAAI,KAAKA,KAAI;AAE3C,UAAI,KAAK,IAAI,GAAG;AACd,YAAI,OAAOA;AAAA,MACb,OAAO;AACL,YAAI,EAAE,cAAc;AACpB,YAAI,EAAE,MAAM,GAAG,EAAE,QAAQ,GAAG,IAAI,CAAC,IAAIA;AAAA,MACvC;AAEA,UAAI,IAAI,KAAK,CAAC;AAAA,IAChB,OAAO;AACL,UAAI,IAAI,KAAK,EAAE,SAAS,CAAC;AAAA,IAC3B;AAEA,UAAMA,KAAI,KAAK,aAAa;AAG5B,eAAS;AACP,UAAI;AACJ,UAAI,EAAE,KAAK,OAAO,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG;AAG7C,UAAI,eAAe,EAAE,CAAC,EAAE,MAAM,GAAG,EAAE,OAAO,IAAI,eAAe,EAAE,CAAC,GAAG,MAAM,GAAG,EAAE,GAAG;AAC/E,YAAI,EAAE,MAAM,KAAK,GAAG,KAAK,CAAC;AAI1B,YAAI,KAAK,UAAU,CAAC,OAAO,KAAK,QAAQ;AAItC,cAAI,CAAC,KAAK;AACR,qBAAS,GAAGA,KAAI,GAAG,CAAC;AAEpB,gBAAI,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,GAAG;AACpB,kBAAI;AACJ;AAAA,YACF;AAAA,UACF;AAEA,gBAAM;AACN,gBAAM;AAAA,QACR,OAAO;AAIL,cAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,KAAK;AAG7C,qBAAS,GAAGA,KAAI,GAAG,CAAC;AACpB,gBAAI,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC;AAAA,UACtB;AAEA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,eAAW;AAEX,WAAO,SAAS,GAAGA,IAAG,KAAK,UAAU,CAAC;AAAA,EACxC;AAgBA,IAAE,UAAU,EAAE,MAAM,WAAY;AAC9B,QAAI,IAAI,IACN,IAAI,MACJ,OAAO,EAAE;AAEX,QAAI,CAAC,EAAE,SAAS,EAAG,QAAO,IAAI,KAAK,GAAG;AACtC,QAAI,EAAE,OAAO,EAAG,QAAO,IAAI,KAAK,CAAC;AAEjC,SAAK,KAAK;AACV,SAAK,KAAK;AACV,SAAK,YAAY,KAAK;AACtB,SAAK,WAAW;AAEhB,QAAI,EAAE,IAAI;AACV,MAAE,IAAI;AACN,QAAI,OAAO,GAAG,IAAI,KAAK,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE,KAAK,GAAG,KAAK,IAAI,CAAC;AAE9D,SAAK,YAAY;AACjB,SAAK,WAAW;AAEhB,WAAO,SAAS,YAAY,KAAK,YAAY,IAAI,EAAE,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI;AAAA,EAC5E;AAwBA,IAAE,QAAQ,EAAE,MAAM,SAAU,GAAG;AAC7B,QAAI,OAAOA,IAAGD,IAAG,GAAG,GAAG,IAAI,GAAG,KAAK,KACjC,IAAI,MACJ,OAAO,EAAE,aACT,KAAK,EAAE,GACP,MAAM,IAAI,IAAI,KAAK,CAAC,GAAG;AAEzB,MAAE,KAAK,EAAE;AAGT,QAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG;AAElC,aAAO,IAAI,KAAK,CAAC,EAAE,KAAK,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,KAI5D,MAIA,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,IAAI,EAAE,IAAI,CAAC;AAAA,IACpC;AAEA,IAAAC,KAAI,UAAU,EAAE,IAAI,QAAQ,IAAI,UAAU,EAAE,IAAI,QAAQ;AACxD,UAAM,GAAG;AACT,UAAM,GAAG;AAGT,QAAI,MAAM,KAAK;AACb,UAAI;AACJ,WAAK;AACL,WAAK;AACL,WAAK;AACL,YAAM;AACN,YAAM;AAAA,IACR;AAGA,QAAI,CAAC;AACL,SAAK,MAAM;AACX,SAAKD,KAAI,IAAIA,OAAM,GAAE,KAAK,CAAC;AAG3B,SAAKA,KAAI,KAAK,EAAEA,MAAK,KAAI;AACvB,cAAQ;AACR,WAAK,IAAI,MAAMA,IAAG,IAAIA,MAAI;AACxB,YAAI,EAAE,CAAC,IAAI,GAAGA,EAAC,IAAI,GAAG,IAAIA,KAAI,CAAC,IAAI;AACnC,UAAE,GAAG,IAAI,IAAI,OAAO;AACpB,gBAAQ,IAAI,OAAO;AAAA,MACrB;AAEA,QAAE,CAAC,KAAK,EAAE,CAAC,IAAI,SAAS,OAAO;AAAA,IACjC;AAGA,WAAO,CAAC,EAAE,EAAE,EAAE,IAAI,GAAE,IAAI;AAExB,QAAI,MAAO,GAAEC;AAAA,QACR,GAAE,MAAM;AAEb,MAAE,IAAI;AACN,MAAE,IAAI,kBAAkB,GAAGA,EAAC;AAE5B,WAAO,WAAW,SAAS,GAAG,KAAK,WAAW,KAAK,QAAQ,IAAI;AAAA,EACjE;AAaA,IAAE,WAAW,SAAU,IAAI,IAAI;AAC7B,WAAO,eAAe,MAAM,GAAG,IAAI,EAAE;AAAA,EACvC;AAaA,IAAE,kBAAkB,EAAE,OAAO,SAAU,IAAI,IAAI;AAC7C,QAAI,IAAI,MACN,OAAO,EAAE;AAEX,QAAI,IAAI,KAAK,CAAC;AACd,QAAI,OAAO,OAAQ,QAAO;AAE1B,eAAW,IAAI,GAAG,UAAU;AAE5B,QAAI,OAAO,OAAQ,MAAK,KAAK;AAAA,QACxB,YAAW,IAAI,GAAG,CAAC;AAExB,WAAO,SAAS,GAAG,KAAK,EAAE,IAAI,GAAG,EAAE;AAAA,EACrC;AAWA,IAAE,gBAAgB,SAAU,IAAI,IAAI;AAClC,QAAI,KACF,IAAI,MACJ,OAAO,EAAE;AAEX,QAAI,OAAO,QAAQ;AACjB,YAAM,eAAe,GAAG,IAAI;AAAA,IAC9B,OAAO;AACL,iBAAW,IAAI,GAAG,UAAU;AAE5B,UAAI,OAAO,OAAQ,MAAK,KAAK;AAAA,UACxB,YAAW,IAAI,GAAG,CAAC;AAExB,UAAI,SAAS,IAAI,KAAK,CAAC,GAAG,KAAK,GAAG,EAAE;AACpC,YAAM,eAAe,GAAG,MAAM,KAAK,CAAC;AAAA,IACtC;AAEA,WAAO,EAAE,MAAM,KAAK,CAAC,EAAE,OAAO,IAAI,MAAM,MAAM;AAAA,EAChD;AAmBA,IAAE,UAAU,SAAU,IAAI,IAAI;AAC5B,QAAI,KAAK,GACP,IAAI,MACJ,OAAO,EAAE;AAEX,QAAI,OAAO,QAAQ;AACjB,YAAM,eAAe,CAAC;AAAA,IACxB,OAAO;AACL,iBAAW,IAAI,GAAG,UAAU;AAE5B,UAAI,OAAO,OAAQ,MAAK,KAAK;AAAA,UACxB,YAAW,IAAI,GAAG,CAAC;AAExB,UAAI,SAAS,IAAI,KAAK,CAAC,GAAG,KAAK,EAAE,IAAI,GAAG,EAAE;AAC1C,YAAM,eAAe,GAAG,OAAO,KAAK,EAAE,IAAI,CAAC;AAAA,IAC7C;AAIA,WAAO,EAAE,MAAM,KAAK,CAAC,EAAE,OAAO,IAAI,MAAM,MAAM;AAAA,EAChD;AAcA,IAAE,aAAa,SAAU,MAAM;AAC7B,QAAI,GAAG,IAAI,IAAI,IAAIA,IAAG,GAAG,GAAG,IAAIE,KAAI,IAAI,GAAG,GACzC,IAAI,MACJ,KAAK,EAAE,GACP,OAAO,EAAE;AAEX,QAAI,CAAC,GAAI,QAAO,IAAI,KAAK,CAAC;AAE1B,IAAAA,MAAK,KAAK,IAAI,KAAK,CAAC;AACpB,SAAK,KAAK,IAAI,KAAK,CAAC;AAEpB,QAAI,IAAI,KAAK,EAAE;AACf,IAAAF,KAAI,EAAE,IAAI,aAAa,EAAE,IAAI,EAAE,IAAI;AACnC,QAAIA,KAAI;AACR,MAAE,EAAE,CAAC,IAAI,QAAQ,IAAI,IAAI,IAAI,WAAW,IAAI,CAAC;AAE7C,QAAI,QAAQ,MAAM;AAGhB,aAAOA,KAAI,IAAI,IAAIE;AAAA,IACrB,OAAO;AACL,UAAI,IAAI,KAAK,IAAI;AACjB,UAAI,CAAC,EAAE,MAAM,KAAK,EAAE,GAAGA,GAAE,EAAG,OAAM,MAAM,kBAAkB,CAAC;AAC3D,aAAO,EAAE,GAAG,CAAC,IAAKF,KAAI,IAAI,IAAIE,MAAM;AAAA,IACtC;AAEA,eAAW;AACX,QAAI,IAAI,KAAK,eAAe,EAAE,CAAC;AAC/B,SAAK,KAAK;AACV,SAAK,YAAYF,KAAI,GAAG,SAAS,WAAW;AAE5C,eAAU;AACR,UAAI,OAAO,GAAG,GAAG,GAAG,GAAG,CAAC;AACxB,WAAK,GAAG,KAAK,EAAE,MAAM,EAAE,CAAC;AACxB,UAAI,GAAG,IAAI,IAAI,KAAK,EAAG;AACvB,WAAK;AACL,WAAK;AACL,WAAKE;AACL,MAAAA,MAAK,GAAG,KAAK,EAAE,MAAM,EAAE,CAAC;AACxB,WAAK;AACL,WAAK;AACL,UAAI,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;AACvB,UAAI;AAAA,IACN;AAEA,SAAK,OAAO,KAAK,MAAM,EAAE,GAAG,IAAI,GAAG,GAAG,CAAC;AACvC,SAAK,GAAG,KAAK,GAAG,MAAMA,GAAE,CAAC;AACzB,SAAK,GAAG,KAAK,GAAG,MAAM,EAAE,CAAC;AACzB,OAAG,IAAIA,IAAG,IAAI,EAAE;AAGhB,QAAI,OAAOA,KAAI,IAAIF,IAAG,CAAC,EAAE,MAAM,CAAC,EAAE,IAAI,EAAE,IAAI,OAAO,IAAI,IAAIA,IAAG,CAAC,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,IAC7E,CAACE,KAAI,EAAE,IAAI,CAAC,IAAI,EAAE;AAExB,SAAK,YAAY;AACjB,eAAW;AAEX,WAAO;AAAA,EACT;AAaA,IAAE,gBAAgB,EAAE,QAAQ,SAAU,IAAI,IAAI;AAC5C,WAAO,eAAe,MAAM,IAAI,IAAI,EAAE;AAAA,EACxC;AAmBA,IAAE,YAAY,SAAU,GAAG,IAAI;AAC7B,QAAI,IAAI,MACN,OAAO,EAAE;AAEX,QAAI,IAAI,KAAK,CAAC;AAEd,QAAI,KAAK,MAAM;AAGb,UAAI,CAAC,EAAE,EAAG,QAAO;AAEjB,UAAI,IAAI,KAAK,CAAC;AACd,WAAK,KAAK;AAAA,IACZ,OAAO;AACL,UAAI,IAAI,KAAK,CAAC;AACd,UAAI,OAAO,QAAQ;AACjB,aAAK,KAAK;AAAA,MACZ,OAAO;AACL,mBAAW,IAAI,GAAG,CAAC;AAAA,MACrB;AAGA,UAAI,CAAC,EAAE,EAAG,QAAO,EAAE,IAAI,IAAI;AAG3B,UAAI,CAAC,EAAE,GAAG;AACR,YAAI,EAAE,EAAG,GAAE,IAAI,EAAE;AACjB,eAAO;AAAA,MACT;AAAA,IACF;AAGA,QAAI,EAAE,EAAE,CAAC,GAAG;AACV,iBAAW;AACX,UAAI,OAAO,GAAG,GAAG,GAAG,IAAI,CAAC,EAAE,MAAM,CAAC;AAClC,iBAAW;AACX,eAAS,CAAC;AAAA,IAGZ,OAAO;AACL,QAAE,IAAI,EAAE;AACR,UAAI;AAAA,IACN;AAEA,WAAO;AAAA,EACT;AAQA,IAAE,WAAW,WAAY;AACvB,WAAO,CAAC;AAAA,EACV;AAaA,IAAE,UAAU,SAAU,IAAI,IAAI;AAC5B,WAAO,eAAe,MAAM,GAAG,IAAI,EAAE;AAAA,EACvC;AA8CA,IAAE,UAAU,EAAE,MAAM,SAAU,GAAG;AAC/B,QAAIF,IAAG,GAAG,IAAI,GAAG,IAAI,GACnB,IAAI,MACJ,OAAO,EAAE,aACT,KAAK,EAAE,IAAI,IAAI,KAAK,CAAC;AAGvB,QAAI,CAAC,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,EAAG,QAAO,IAAI,KAAK,QAAQ,CAAC,GAAG,EAAE,CAAC;AAEvE,QAAI,IAAI,KAAK,CAAC;AAEd,QAAI,EAAE,GAAG,CAAC,EAAG,QAAO;AAEpB,SAAK,KAAK;AACV,SAAK,KAAK;AAEV,QAAI,EAAE,GAAG,CAAC,EAAG,QAAO,SAAS,GAAG,IAAI,EAAE;AAGtC,IAAAA,KAAI,UAAU,EAAE,IAAI,QAAQ;AAG5B,QAAIA,MAAK,EAAE,EAAE,SAAS,MAAM,IAAI,KAAK,IAAI,CAAC,KAAK,OAAO,kBAAkB;AACtE,UAAI,OAAO,MAAM,GAAG,GAAG,EAAE;AACzB,aAAO,EAAE,IAAI,IAAI,IAAI,KAAK,CAAC,EAAE,IAAI,CAAC,IAAI,SAAS,GAAG,IAAI,EAAE;AAAA,IAC1D;AAEA,QAAI,EAAE;AAGN,QAAI,IAAI,GAAG;AAGT,UAAIA,KAAI,EAAE,EAAE,SAAS,EAAG,QAAO,IAAI,KAAK,GAAG;AAG3C,WAAK,EAAE,EAAEA,EAAC,IAAI,MAAM,EAAG,KAAI;AAG3B,UAAI,EAAE,KAAK,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,EAAE,EAAE,UAAU,GAAG;AAC9C,UAAE,IAAI;AACN,eAAO;AAAA,MACT;AAAA,IACF;AAMA,QAAI,QAAQ,CAAC,GAAG,EAAE;AAClB,IAAAA,KAAI,KAAK,KAAK,CAAC,SAAS,CAAC,IACrB,UAAU,MAAM,KAAK,IAAI,OAAO,eAAe,EAAE,CAAC,CAAC,IAAI,KAAK,OAAO,EAAE,IAAI,EAAE,IAC3E,IAAI,KAAK,IAAI,EAAE,EAAE;AAKrB,QAAIA,KAAI,KAAK,OAAO,KAAKA,KAAI,KAAK,OAAO,EAAG,QAAO,IAAI,KAAKA,KAAI,IAAI,IAAI,IAAI,CAAC;AAE7E,eAAW;AACX,SAAK,WAAW,EAAE,IAAI;AAMtB,QAAI,KAAK,IAAI,KAAKA,KAAI,IAAI,MAAM;AAGhC,QAAI,mBAAmB,EAAE,MAAM,iBAAiB,GAAG,KAAK,CAAC,CAAC,GAAG,EAAE;AAG/D,QAAI,EAAE,GAAG;AAGP,UAAI,SAAS,GAAG,KAAK,GAAG,CAAC;AAIzB,UAAI,oBAAoB,EAAE,GAAG,IAAI,EAAE,GAAG;AACpC,QAAAA,KAAI,KAAK;AAGT,YAAI,SAAS,mBAAmB,EAAE,MAAM,iBAAiB,GAAGA,KAAI,CAAC,CAAC,GAAGA,EAAC,GAAGA,KAAI,GAAG,CAAC;AAGjF,YAAI,CAAC,eAAe,EAAE,CAAC,EAAE,MAAM,KAAK,GAAG,KAAK,EAAE,IAAI,KAAK,MAAM;AAC3D,cAAI,SAAS,GAAG,KAAK,GAAG,CAAC;AAAA,QAC3B;AAAA,MACF;AAAA,IACF;AAEA,MAAE,IAAI;AACN,eAAW;AACX,SAAK,WAAW;AAEhB,WAAO,SAAS,GAAG,IAAI,EAAE;AAAA,EAC3B;AAcA,IAAE,cAAc,SAAU,IAAI,IAAI;AAChC,QAAI,KACF,IAAI,MACJ,OAAO,EAAE;AAEX,QAAI,OAAO,QAAQ;AACjB,YAAM,eAAe,GAAG,EAAE,KAAK,KAAK,YAAY,EAAE,KAAK,KAAK,QAAQ;AAAA,IACtE,OAAO;AACL,iBAAW,IAAI,GAAG,UAAU;AAE5B,UAAI,OAAO,OAAQ,MAAK,KAAK;AAAA,UACxB,YAAW,IAAI,GAAG,CAAC;AAExB,UAAI,SAAS,IAAI,KAAK,CAAC,GAAG,IAAI,EAAE;AAChC,YAAM,eAAe,GAAG,MAAM,EAAE,KAAK,EAAE,KAAK,KAAK,UAAU,EAAE;AAAA,IAC/D;AAEA,WAAO,EAAE,MAAM,KAAK,CAAC,EAAE,OAAO,IAAI,MAAM,MAAM;AAAA,EAChD;AAiBA,IAAE,sBAAsB,EAAE,OAAO,SAAU,IAAI,IAAI;AACjD,QAAI,IAAI,MACN,OAAO,EAAE;AAEX,QAAI,OAAO,QAAQ;AACjB,WAAK,KAAK;AACV,WAAK,KAAK;AAAA,IACZ,OAAO;AACL,iBAAW,IAAI,GAAG,UAAU;AAE5B,UAAI,OAAO,OAAQ,MAAK,KAAK;AAAA,UACxB,YAAW,IAAI,GAAG,CAAC;AAAA,IAC1B;AAEA,WAAO,SAAS,IAAI,KAAK,CAAC,GAAG,IAAI,EAAE;AAAA,EACrC;AAUA,IAAE,WAAW,WAAY;AACvB,QAAI,IAAI,MACN,OAAO,EAAE,aACT,MAAM,eAAe,GAAG,EAAE,KAAK,KAAK,YAAY,EAAE,KAAK,KAAK,QAAQ;AAEtE,WAAO,EAAE,MAAM,KAAK,CAAC,EAAE,OAAO,IAAI,MAAM,MAAM;AAAA,EAChD;AAOA,IAAE,YAAY,EAAE,QAAQ,WAAY;AAClC,WAAO,SAAS,IAAI,KAAK,YAAY,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC;AAAA,EAC3D;AAQA,IAAE,UAAU,EAAE,SAAS,WAAY;AACjC,QAAI,IAAI,MACN,OAAO,EAAE,aACT,MAAM,eAAe,GAAG,EAAE,KAAK,KAAK,YAAY,EAAE,KAAK,KAAK,QAAQ;AAEtE,WAAO,EAAE,MAAM,IAAI,MAAM,MAAM;AAAA,EACjC;AAoDA,WAAS,eAAe,GAAG;AACzB,QAAID,IAAG,GAAG,IACR,kBAAkB,EAAE,SAAS,GAC7B,MAAM,IACN,IAAI,EAAE,CAAC;AAET,QAAI,kBAAkB,GAAG;AACvB,aAAO;AACP,WAAKA,KAAI,GAAGA,KAAI,iBAAiBA,MAAK;AACpC,aAAK,EAAEA,EAAC,IAAI;AACZ,YAAI,WAAW,GAAG;AAClB,YAAI,EAAG,QAAO,cAAc,CAAC;AAC7B,eAAO;AAAA,MACT;AAEA,UAAI,EAAEA,EAAC;AACP,WAAK,IAAI;AACT,UAAI,WAAW,GAAG;AAClB,UAAI,EAAG,QAAO,cAAc,CAAC;AAAA,IAC/B,WAAW,MAAM,GAAG;AAClB,aAAO;AAAA,IACT;AAGA,WAAO,IAAI,OAAO,IAAI,MAAK;AAE3B,WAAO,MAAM;AAAA,EACf;AAGA,WAAS,WAAWA,IAAGF,MAAKC,MAAK;AAC/B,QAAIC,OAAM,CAAC,CAACA,MAAKA,KAAIF,QAAOE,KAAID,MAAK;AACnC,YAAM,MAAM,kBAAkBC,EAAC;AAAA,IACjC;AAAA,EACF;AAQA,WAAS,oBAAoB,GAAGA,IAAG,IAAI,WAAW;AAChD,QAAI,IAAI,GAAG,GAAG;AAGd,SAAK,IAAI,EAAE,CAAC,GAAG,KAAK,IAAI,KAAK,GAAI,GAAEA;AAGnC,QAAI,EAAEA,KAAI,GAAG;AACX,MAAAA,MAAK;AACL,WAAK;AAAA,IACP,OAAO;AACL,WAAK,KAAK,MAAMA,KAAI,KAAK,QAAQ;AACjC,MAAAA,MAAK;AAAA,IACP;AAKA,QAAI,QAAQ,IAAI,WAAWA,EAAC;AAC5B,SAAK,EAAE,EAAE,IAAI,IAAI;AAEjB,QAAI,aAAa,MAAM;AACrB,UAAIA,KAAI,GAAG;AACT,YAAIA,MAAK,EAAG,MAAK,KAAK,MAAM;AAAA,iBACnBA,MAAK,EAAG,MAAK,KAAK,KAAK;AAChC,YAAI,KAAK,KAAK,MAAM,SAAS,KAAK,KAAK,MAAM,SAAS,MAAM,OAAS,MAAM;AAAA,MAC7E,OAAO;AACL,aAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,OACnD,EAAE,KAAK,CAAC,IAAI,IAAI,MAAM,MAAM,QAAQ,IAAIA,KAAI,CAAC,IAAI,MAC/C,MAAM,IAAI,KAAK,MAAM,OAAO,EAAE,KAAK,CAAC,IAAI,IAAI,MAAM,MAAM;AAAA,MAC/D;AAAA,IACF,OAAO;AACL,UAAIA,KAAI,GAAG;AACT,YAAIA,MAAK,EAAG,MAAK,KAAK,MAAO;AAAA,iBACpBA,MAAK,EAAG,MAAK,KAAK,MAAM;AAAA,iBACxBA,MAAK,EAAG,MAAK,KAAK,KAAK;AAChC,aAAK,aAAa,KAAK,MAAM,MAAM,QAAQ,CAAC,aAAa,KAAK,KAAK,MAAM;AAAA,MAC3E,OAAO;AACL,cAAM,aAAa,KAAK,MAAM,KAAK,KAAK,KACvC,CAAC,aAAa,KAAK,KAAM,KAAK,KAAK,IAAI,OACrC,EAAE,KAAK,CAAC,IAAI,IAAI,MAAO,MAAM,QAAQ,IAAIA,KAAI,CAAC,IAAI;AAAA,MACvD;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAMA,WAAS,YAAY,KAAK,QAAQ,SAAS;AACzC,QAAI,GACF,MAAM,CAAC,CAAC,GACR,MACAA,KAAI,GACJ,OAAO,IAAI;AAEb,WAAOA,KAAI,QAAO;AAChB,WAAK,OAAO,IAAI,QAAQ,SAAS,KAAI,IAAI,KAAK;AAC9C,UAAI,CAAC,KAAK,SAAS,QAAQ,IAAI,OAAOA,IAAG,CAAC;AAC1C,WAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AAC/B,YAAI,IAAI,CAAC,IAAI,UAAU,GAAG;AACxB,cAAI,IAAI,IAAI,CAAC,MAAM,OAAQ,KAAI,IAAI,CAAC,IAAI;AACxC,cAAI,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,UAAU;AACjC,cAAI,CAAC,KAAK;AAAA,QACZ;AAAA,MACF;AAAA,IACF;AAEA,WAAO,IAAI,QAAQ;AAAA,EACrB;AAQA,WAAS,OAAO,MAAM,GAAG;AACvB,QAAI,GAAG,KAAK;AAEZ,QAAI,EAAE,OAAO,EAAG,QAAO;AAMvB,UAAM,EAAE,EAAE;AACV,QAAI,MAAM,IAAI;AACZ,UAAI,KAAK,KAAK,MAAM,CAAC;AACrB,WAAK,IAAI,QAAQ,GAAG,CAAC,GAAG,SAAS;AAAA,IACnC,OAAO;AACL,UAAI;AACJ,UAAI;AAAA,IACN;AAEA,SAAK,aAAa;AAElB,QAAI,aAAa,MAAM,GAAG,EAAE,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC;AAGjD,aAASA,KAAI,GAAGA,QAAM;AACpB,UAAI,QAAQ,EAAE,MAAM,CAAC;AACrB,UAAI,MAAM,MAAM,KAAK,EAAE,MAAM,KAAK,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC;AAAA,IACrD;AAEA,SAAK,aAAa;AAElB,WAAO;AAAA,EACT;AAMA,MAAI,SAAU,2BAAY;AAGxB,aAAS,gBAAgB,GAAG,GAAG,MAAM;AACnC,UAAI,MACF,QAAQ,GACRA,KAAI,EAAE;AAER,WAAK,IAAI,EAAE,MAAM,GAAGA,QAAM;AACxB,eAAO,EAAEA,EAAC,IAAI,IAAI;AAClB,UAAEA,EAAC,IAAI,OAAO,OAAO;AACrB,gBAAQ,OAAO,OAAO;AAAA,MACxB;AAEA,UAAI,MAAO,GAAE,QAAQ,KAAK;AAE1B,aAAO;AAAA,IACT;AAEA,aAASI,SAAQ,GAAG,GAAG,IAAI,IAAI;AAC7B,UAAIJ,IAAG;AAEP,UAAI,MAAM,IAAI;AACZ,YAAI,KAAK,KAAK,IAAI;AAAA,MACpB,OAAO;AACL,aAAKA,KAAI,IAAI,GAAGA,KAAI,IAAIA,MAAK;AAC3B,cAAI,EAAEA,EAAC,KAAK,EAAEA,EAAC,GAAG;AAChB,gBAAI,EAAEA,EAAC,IAAI,EAAEA,EAAC,IAAI,IAAI;AACtB;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAEA,aAASK,UAAS,GAAG,GAAG,IAAI,MAAM;AAChC,UAAIL,KAAI;AAGR,aAAO,QAAO;AACZ,UAAE,EAAE,KAAKA;AACT,QAAAA,KAAI,EAAE,EAAE,IAAI,EAAE,EAAE,IAAI,IAAI;AACxB,UAAE,EAAE,IAAIA,KAAI,OAAO,EAAE,EAAE,IAAI,EAAE,EAAE;AAAA,MACjC;AAGA,aAAO,CAAC,EAAE,CAAC,KAAK,EAAE,SAAS,IAAI,GAAE,MAAM;AAAA,IACzC;AAEA,WAAO,SAAU,GAAG,GAAG,IAAI,IAAI,IAAI,MAAM;AACvC,UAAI,KAAKC,IAAGD,IAAG,GAAG,SAAS,MAAMM,OAAM,OAAO,GAAG,IAAI,KAAK,MAAM,MAAM,IAAI,GAAG,IAAI,IAAI,KACnF,IAAI,IACJ,OAAO,EAAE,aACTC,QAAO,EAAE,KAAK,EAAE,IAAI,IAAI,IACxB,KAAK,EAAE,GACP,KAAK,EAAE;AAGT,UAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG;AAElC,eAAO,IAAI;AAAA;AAAA,UACT,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM,KAAK,MAAM,GAAG,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,MAAM;AAAA;AAAA,YAGpD,MAAM,GAAG,CAAC,KAAK,KAAK,CAAC,KAAKA,QAAO,IAAIA,QAAO;AAAA;AAAA,QAAC;AAAA,MACjD;AAEA,UAAI,MAAM;AACR,kBAAU;AACV,QAAAN,KAAI,EAAE,IAAI,EAAE;AAAA,MACd,OAAO;AACL,eAAO;AACP,kBAAU;AACV,QAAAA,KAAI,UAAU,EAAE,IAAI,OAAO,IAAI,UAAU,EAAE,IAAI,OAAO;AAAA,MACxD;AAEA,WAAK,GAAG;AACR,WAAK,GAAG;AACR,UAAI,IAAI,KAAKM,KAAI;AACjB,WAAK,EAAE,IAAI,CAAC;AAIZ,WAAKP,KAAI,GAAG,GAAGA,EAAC,MAAM,GAAGA,EAAC,KAAK,IAAIA,KAAI;AAEvC,UAAI,GAAGA,EAAC,KAAK,GAAGA,EAAC,KAAK,GAAI,CAAAC;AAE1B,UAAI,MAAM,MAAM;AACd,aAAK,KAAK,KAAK;AACf,aAAK,KAAK;AAAA,MACZ,WAAW,IAAI;AACb,aAAK,MAAM,EAAE,IAAI,EAAE,KAAK;AAAA,MAC1B,OAAO;AACL,aAAK;AAAA,MACP;AAEA,UAAI,KAAK,GAAG;AACV,WAAG,KAAK,CAAC;AACT,eAAO;AAAA,MACT,OAAO;AAGL,aAAK,KAAK,UAAU,IAAI;AACxB,QAAAD,KAAI;AAGJ,YAAI,MAAM,GAAG;AACX,cAAI;AACJ,eAAK,GAAG,CAAC;AACT;AAGA,kBAAQA,KAAI,MAAM,MAAM,MAAMA,MAAK;AACjC,gBAAI,IAAI,QAAQ,GAAGA,EAAC,KAAK;AACzB,eAAGA,EAAC,IAAI,IAAI,KAAK;AACjB,gBAAI,IAAI,KAAK;AAAA,UACf;AAEA,iBAAO,KAAKA,KAAI;AAAA,QAGlB,OAAO;AAGL,cAAI,QAAQ,GAAG,CAAC,IAAI,KAAK;AAEzB,cAAI,IAAI,GAAG;AACT,iBAAK,gBAAgB,IAAI,GAAG,IAAI;AAChC,iBAAK,gBAAgB,IAAI,GAAG,IAAI;AAChC,iBAAK,GAAG;AACR,iBAAK,GAAG;AAAA,UACV;AAEA,eAAK;AACL,gBAAM,GAAG,MAAM,GAAG,EAAE;AACpB,iBAAO,IAAI;AAGX,iBAAO,OAAO,KAAK,KAAI,MAAM,IAAI;AAEjC,eAAK,GAAG,MAAM;AACd,aAAG,QAAQ,CAAC;AACZ,gBAAM,GAAG,CAAC;AAEV,cAAI,GAAG,CAAC,KAAK,OAAO,EAAG,GAAE;AAEzB,aAAG;AACD,gBAAI;AAGJ,kBAAMI,SAAQ,IAAI,KAAK,IAAI,IAAI;AAG/B,gBAAI,MAAM,GAAG;AAGX,qBAAO,IAAI,CAAC;AACZ,kBAAI,MAAM,KAAM,QAAO,OAAO,QAAQ,IAAI,CAAC,KAAK;AAGhD,kBAAI,OAAO,MAAM;AAUjB,kBAAI,IAAI,GAAG;AACT,oBAAI,KAAK,KAAM,KAAI,OAAO;AAG1B,gBAAAE,QAAO,gBAAgB,IAAI,GAAG,IAAI;AAClC,wBAAQA,MAAK;AACb,uBAAO,IAAI;AAGX,sBAAMF,SAAQE,OAAM,KAAK,OAAO,IAAI;AAGpC,oBAAI,OAAO,GAAG;AACZ;AAGA,kBAAAD,UAASC,OAAM,KAAK,QAAQ,KAAK,IAAI,OAAO,IAAI;AAAA,gBAClD;AAAA,cACF,OAAO;AAKL,oBAAI,KAAK,EAAG,OAAM,IAAI;AACtB,gBAAAA,QAAO,GAAG,MAAM;AAAA,cAClB;AAEA,sBAAQA,MAAK;AACb,kBAAI,QAAQ,KAAM,CAAAA,MAAK,QAAQ,CAAC;AAGhC,cAAAD,UAAS,KAAKC,OAAM,MAAM,IAAI;AAG9B,kBAAI,OAAO,IAAI;AACb,uBAAO,IAAI;AAGX,sBAAMF,SAAQ,IAAI,KAAK,IAAI,IAAI;AAG/B,oBAAI,MAAM,GAAG;AACX;AAGA,kBAAAC,UAAS,KAAK,KAAK,OAAO,KAAK,IAAI,MAAM,IAAI;AAAA,gBAC/C;AAAA,cACF;AAEA,qBAAO,IAAI;AAAA,YACb,WAAW,QAAQ,GAAG;AACpB;AACA,oBAAM,CAAC,CAAC;AAAA,YACV;AAGA,eAAGL,IAAG,IAAI;AAGV,gBAAI,OAAO,IAAI,CAAC,GAAG;AACjB,kBAAI,MAAM,IAAI,GAAG,EAAE,KAAK;AAAA,YAC1B,OAAO;AACL,oBAAM,CAAC,GAAG,EAAE,CAAC;AACb,qBAAO;AAAA,YACT;AAAA,UAEF,UAAU,OAAO,MAAM,IAAI,CAAC,MAAM,WAAW;AAE7C,iBAAO,IAAI,CAAC,MAAM;AAAA,QACpB;AAGA,YAAI,CAAC,GAAG,CAAC,EAAG,IAAG,MAAM;AAAA,MACvB;AAGA,UAAI,WAAW,GAAG;AAChB,UAAE,IAAIC;AACN,kBAAU;AAAA,MACZ,OAAO;AAGL,aAAKD,KAAI,GAAG,IAAI,GAAG,CAAC,GAAG,KAAK,IAAI,KAAK,GAAI,CAAAA;AACzC,UAAE,IAAIA,KAAIC,KAAI,UAAU;AAExB,iBAAS,GAAG,KAAK,KAAK,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI;AAAA,MAC9C;AAEA,aAAO;AAAA,IACT;AAAA,EACF,EAAG;AAOF,WAAS,SAAS,GAAG,IAAI,IAAI,aAAa;AACzC,QAAIO,SAAQR,IAAG,GAAG,GAAG,IAAI,SAAS,GAAG,IAAI,KACvC,OAAO,EAAE;AAGX,QAAK,KAAI,MAAM,MAAM;AACnB,WAAK,EAAE;AAGP,UAAI,CAAC,GAAI,QAAO;AAWhB,WAAKQ,UAAS,GAAG,IAAI,GAAG,CAAC,GAAG,KAAK,IAAI,KAAK,GAAI,CAAAA;AAC9C,MAAAR,KAAI,KAAKQ;AAGT,UAAIR,KAAI,GAAG;AACT,QAAAA,MAAK;AACL,YAAI;AACJ,YAAI,GAAG,MAAM,CAAC;AAGd,aAAK,IAAI,QAAQ,IAAIQ,UAAS,IAAI,CAAC,IAAI,KAAK;AAAA,MAC9C,OAAO;AACL,cAAM,KAAK,MAAMR,KAAI,KAAK,QAAQ;AAClC,YAAI,GAAG;AACP,YAAI,OAAO,GAAG;AACZ,cAAI,aAAa;AAGf,mBAAO,OAAO,MAAM,IAAG,KAAK,CAAC;AAC7B,gBAAI,KAAK;AACT,YAAAQ,UAAS;AACT,YAAAR,MAAK;AACL,gBAAIA,KAAI,WAAW;AAAA,UACrB,OAAO;AACL,kBAAM;AAAA,UACR;AAAA,QACF,OAAO;AACL,cAAI,IAAI,GAAG,GAAG;AAGd,eAAKQ,UAAS,GAAG,KAAK,IAAI,KAAK,GAAI,CAAAA;AAGnC,UAAAR,MAAK;AAIL,cAAIA,KAAI,WAAWQ;AAGnB,eAAK,IAAI,IAAI,IAAI,IAAI,QAAQ,IAAIA,UAAS,IAAI,CAAC,IAAI,KAAK;AAAA,QAC1D;AAAA,MACF;AAGA,oBAAc,eAAe,KAAK,KAChC,GAAG,MAAM,CAAC,MAAM,WAAW,IAAI,IAAI,IAAI,IAAI,QAAQ,IAAIA,UAAS,IAAI,CAAC;AAMvE,gBAAU,KAAK,KACV,MAAM,iBAAiB,MAAM,KAAK,OAAO,EAAE,IAAI,IAAI,IAAI,MACxD,KAAK,KAAK,MAAM,MAAM,MAAM,KAAK,eAAe,MAAM;AAAA,OAGpDR,KAAI,IAAI,IAAI,IAAI,IAAI,QAAQ,IAAIQ,UAAS,CAAC,IAAI,IAAI,GAAG,MAAM,CAAC,KAAK,KAAM,KACvE,OAAO,EAAE,IAAI,IAAI,IAAI;AAE3B,UAAI,KAAK,KAAK,CAAC,GAAG,CAAC,GAAG;AACpB,WAAG,SAAS;AACZ,YAAI,SAAS;AAGX,gBAAM,EAAE,IAAI;AAGZ,aAAG,CAAC,IAAI,QAAQ,KAAK,WAAW,KAAK,YAAY,QAAQ;AACzD,YAAE,IAAI,CAAC,MAAM;AAAA,QACf,OAAO;AAGL,aAAG,CAAC,IAAI,EAAE,IAAI;AAAA,QAChB;AAEA,eAAO;AAAA,MACT;AAGA,UAAIR,MAAK,GAAG;AACV,WAAG,SAAS;AACZ,YAAI;AACJ;AAAA,MACF,OAAO;AACL,WAAG,SAAS,MAAM;AAClB,YAAI,QAAQ,IAAI,WAAWA,EAAC;AAI5B,WAAG,GAAG,IAAI,IAAI,KAAK,IAAI,QAAQ,IAAIQ,UAAS,CAAC,IAAI,QAAQ,IAAI,CAAC,IAAI,KAAK,IAAI;AAAA,MAC7E;AAEA,UAAI,SAAS;AACX,mBAAS;AAGP,cAAI,OAAO,GAAG;AAGZ,iBAAKR,KAAI,GAAG,IAAI,GAAG,CAAC,GAAG,KAAK,IAAI,KAAK,GAAI,CAAAA;AACzC,gBAAI,GAAG,CAAC,KAAK;AACb,iBAAK,IAAI,GAAG,KAAK,IAAI,KAAK,GAAI;AAG9B,gBAAIA,MAAK,GAAG;AACV,gBAAE;AACF,kBAAI,GAAG,CAAC,KAAK,KAAM,IAAG,CAAC,IAAI;AAAA,YAC7B;AAEA;AAAA,UACF,OAAO;AACL,eAAG,GAAG,KAAK;AACX,gBAAI,GAAG,GAAG,KAAK,KAAM;AACrB,eAAG,KAAK,IAAI;AACZ,gBAAI;AAAA,UACN;AAAA,QACF;AAAA,MACF;AAGA,WAAKA,KAAI,GAAG,QAAQ,GAAG,EAAEA,EAAC,MAAM,IAAI,IAAG,IAAI;AAAA,IAC7C;AAEA,QAAI,UAAU;AAGZ,UAAI,EAAE,IAAI,KAAK,MAAM;AAGnB,UAAE,IAAI;AACN,UAAE,IAAI;AAAA,MAGR,WAAW,EAAE,IAAI,KAAK,MAAM;AAG1B,UAAE,IAAI;AACN,UAAE,IAAI,CAAC,CAAC;AAAA,MAEV;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAGA,WAAS,eAAe,GAAG,OAAO,IAAI;AACpC,QAAI,CAAC,EAAE,SAAS,EAAG,QAAO,kBAAkB,CAAC;AAC7C,QAAI,GACFC,KAAI,EAAE,GACN,MAAM,eAAe,EAAE,CAAC,GACxB,MAAM,IAAI;AAEZ,QAAI,OAAO;AACT,UAAI,OAAO,IAAI,KAAK,OAAO,GAAG;AAC5B,cAAM,IAAI,OAAO,CAAC,IAAI,MAAM,IAAI,MAAM,CAAC,IAAI,cAAc,CAAC;AAAA,MAC5D,WAAW,MAAM,GAAG;AAClB,cAAM,IAAI,OAAO,CAAC,IAAI,MAAM,IAAI,MAAM,CAAC;AAAA,MACzC;AAEA,YAAM,OAAO,EAAE,IAAI,IAAI,MAAM,QAAQ,EAAE;AAAA,IACzC,WAAWA,KAAI,GAAG;AAChB,YAAM,OAAO,cAAc,CAACA,KAAI,CAAC,IAAI;AACrC,UAAI,OAAO,IAAI,KAAK,OAAO,EAAG,QAAO,cAAc,CAAC;AAAA,IACtD,WAAWA,MAAK,KAAK;AACnB,aAAO,cAAcA,KAAI,IAAI,GAAG;AAChC,UAAI,OAAO,IAAI,KAAKA,KAAI,KAAK,EAAG,OAAM,MAAM,MAAM,cAAc,CAAC;AAAA,IACnE,OAAO;AACL,WAAK,IAAIA,KAAI,KAAK,IAAK,OAAM,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI,MAAM,CAAC;AAChE,UAAI,OAAO,IAAI,KAAK,OAAO,GAAG;AAC5B,YAAIA,KAAI,MAAM,IAAK,QAAO;AAC1B,eAAO,cAAc,CAAC;AAAA,MACxB;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAIA,WAAS,kBAAkBO,SAAQP,IAAG;AACpC,QAAI,IAAIO,QAAO,CAAC;AAGhB,SAAMP,MAAK,UAAU,KAAK,IAAI,KAAK,GAAI,CAAAA;AACvC,WAAOA;AAAA,EACT;AAGA,WAAS,QAAQ,MAAM,IAAI,IAAI;AAC7B,QAAI,KAAK,gBAAgB;AAGvB,iBAAW;AACX,UAAI,GAAI,MAAK,YAAY;AACzB,YAAM,MAAM,sBAAsB;AAAA,IACpC;AACA,WAAO,SAAS,IAAI,KAAK,IAAI,GAAG,IAAI,GAAG,IAAI;AAAA,EAC7C;AAGA,WAAS,MAAM,MAAM,IAAI,IAAI;AAC3B,QAAI,KAAK,aAAc,OAAM,MAAM,sBAAsB;AACzD,WAAO,SAAS,IAAI,KAAK,EAAE,GAAG,IAAI,IAAI,IAAI;AAAA,EAC5C;AAGA,WAAS,aAAaO,SAAQ;AAC5B,QAAI,IAAIA,QAAO,SAAS,GACtB,MAAM,IAAI,WAAW;AAEvB,QAAIA,QAAO,CAAC;AAGZ,QAAI,GAAG;AAGL,aAAO,IAAI,MAAM,GAAG,KAAK,GAAI;AAG7B,WAAK,IAAIA,QAAO,CAAC,GAAG,KAAK,IAAI,KAAK,GAAI;AAAA,IACxC;AAEA,WAAO;AAAA,EACT;AAGA,WAAS,cAAc,GAAG;AACxB,QAAI,KAAK;AACT,WAAO,MAAM,OAAM;AACnB,WAAO;AAAA,EACT;AAUA,WAAS,OAAO,MAAM,GAAG,GAAG,IAAI;AAC9B,QAAI,aACF,IAAI,IAAI,KAAK,CAAC,GAId,IAAI,KAAK,KAAK,KAAK,WAAW,CAAC;AAEjC,eAAW;AAEX,eAAS;AACP,UAAI,IAAI,GAAG;AACT,YAAI,EAAE,MAAM,CAAC;AACb,YAAI,SAAS,EAAE,GAAG,CAAC,EAAG,eAAc;AAAA,MACtC;AAEA,UAAI,UAAU,IAAI,CAAC;AACnB,UAAI,MAAM,GAAG;AAGX,YAAI,EAAE,EAAE,SAAS;AACjB,YAAI,eAAe,EAAE,EAAE,CAAC,MAAM,EAAG,GAAE,EAAE,EAAE,CAAC;AACxC;AAAA,MACF;AAEA,UAAI,EAAE,MAAM,CAAC;AACb,eAAS,EAAE,GAAG,CAAC;AAAA,IACjB;AAEA,eAAW;AAEX,WAAO;AAAA,EACT;AAGA,WAAS,MAAM,GAAG;AAChB,WAAO,EAAE,EAAE,EAAE,EAAE,SAAS,CAAC,IAAI;AAAA,EAC/B;AAMA,WAAS,SAAS,MAAM,MAAM,GAAG;AAC/B,QAAI,GAAG,GACL,IAAI,IAAI,KAAK,KAAK,CAAC,CAAC,GACpBR,KAAI;AAEN,WAAO,EAAEA,KAAI,KAAK,UAAS;AACzB,UAAI,IAAI,KAAK,KAAKA,EAAC,CAAC;AAGpB,UAAI,CAAC,EAAE,GAAG;AACR,YAAI;AACJ;AAAA,MACF;AAEA,UAAI,EAAE,IAAI,CAAC;AAEX,UAAI,MAAM,KAAK,MAAM,KAAK,EAAE,MAAM,GAAG;AACnC,YAAI;AAAA,MACN;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAkCA,WAAS,mBAAmB,GAAG,IAAI;AACjC,QAAI,aAAa,OAAO,GAAGS,MAAKC,MAAK,GAAG,KACtC,MAAM,GACNV,KAAI,GACJ,IAAI,GACJ,OAAO,EAAE,aACT,KAAK,KAAK,UACV,KAAK,KAAK;AAGZ,QAAI,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,EAAE,IAAI,IAAI;AAE/B,aAAO,IAAI,KAAK,EAAE,IACd,CAAC,EAAE,EAAE,CAAC,IAAI,IAAI,EAAE,IAAI,IAAI,IAAI,IAAI,IAChC,EAAE,IAAI,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC;AAAA,IACnC;AAEA,QAAI,MAAM,MAAM;AACd,iBAAW;AACX,YAAM;AAAA,IACR,OAAO;AACL,YAAM;AAAA,IACR;AAEA,QAAI,IAAI,KAAK,OAAO;AAGpB,WAAO,EAAE,IAAI,IAAI;AAGf,UAAI,EAAE,MAAM,CAAC;AACb,WAAK;AAAA,IACP;AAIA,YAAQ,KAAK,IAAI,QAAQ,GAAG,CAAC,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI;AACtD,WAAO;AACP,kBAAcS,OAAMC,OAAM,IAAI,KAAK,CAAC;AACpC,SAAK,YAAY;AAEjB,eAAS;AACP,MAAAD,OAAM,SAASA,KAAI,MAAM,CAAC,GAAG,KAAK,CAAC;AACnC,oBAAc,YAAY,MAAM,EAAET,EAAC;AACnC,UAAIU,KAAI,KAAK,OAAOD,MAAK,aAAa,KAAK,CAAC,CAAC;AAE7C,UAAI,eAAe,EAAE,CAAC,EAAE,MAAM,GAAG,GAAG,MAAM,eAAeC,KAAI,CAAC,EAAE,MAAM,GAAG,GAAG,GAAG;AAC7E,YAAI;AACJ,eAAO,IAAK,CAAAA,OAAM,SAASA,KAAI,MAAMA,IAAG,GAAG,KAAK,CAAC;AAOjD,YAAI,MAAM,MAAM;AAEd,cAAI,MAAM,KAAK,oBAAoBA,KAAI,GAAG,MAAM,OAAO,IAAI,GAAG,GAAG;AAC/D,iBAAK,YAAY,OAAO;AACxB,0BAAcD,OAAM,IAAI,IAAI,KAAK,CAAC;AAClC,YAAAT,KAAI;AACJ;AAAA,UACF,OAAO;AACL,mBAAO,SAASU,MAAK,KAAK,YAAY,IAAI,IAAI,WAAW,IAAI;AAAA,UAC/D;AAAA,QACF,OAAO;AACL,eAAK,YAAY;AACjB,iBAAOA;AAAA,QACT;AAAA,MACF;AAEA,MAAAA,OAAM;AAAA,IACR;AAAA,EACF;AAkBA,WAAS,iBAAiB,GAAG,IAAI;AAC/B,QAAI,GAAG,IAAI,aAAaT,IAAG,WAAW,KAAKS,MAAK,GAAG,KAAK,IAAI,IAC1D,IAAI,GACJ,QAAQ,IACR,IAAI,GACJ,KAAK,EAAE,GACP,OAAO,EAAE,aACT,KAAK,KAAK,UACV,KAAK,KAAK;AAGZ,QAAI,EAAE,IAAI,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,KAAK,GAAG,CAAC,KAAK,KAAK,GAAG,UAAU,GAAG;AACpE,aAAO,IAAI,KAAK,MAAM,CAAC,GAAG,CAAC,IAAI,KAAK,IAAI,EAAE,KAAK,IAAI,MAAM,KAAK,IAAI,CAAC;AAAA,IACrE;AAEA,QAAI,MAAM,MAAM;AACd,iBAAW;AACX,YAAM;AAAA,IACR,OAAO;AACL,YAAM;AAAA,IACR;AAEA,SAAK,YAAY,OAAO;AACxB,QAAI,eAAe,EAAE;AACrB,SAAK,EAAE,OAAO,CAAC;AAEf,QAAI,KAAK,IAAIT,KAAI,EAAE,CAAC,IAAI,OAAQ;AAa9B,aAAO,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,EAAE,OAAO,CAAC,IAAI,GAAG;AACtD,YAAI,EAAE,MAAM,CAAC;AACb,YAAI,eAAe,EAAE,CAAC;AACtB,aAAK,EAAE,OAAO,CAAC;AACf;AAAA,MACF;AAEA,MAAAA,KAAI,EAAE;AAEN,UAAI,KAAK,GAAG;AACV,YAAI,IAAI,KAAK,OAAO,CAAC;AACrB,QAAAA;AAAA,MACF,OAAO;AACL,YAAI,IAAI,KAAK,KAAK,MAAM,EAAE,MAAM,CAAC,CAAC;AAAA,MACpC;AAAA,IACF,OAAO;AAKL,UAAI,QAAQ,MAAM,MAAM,GAAG,EAAE,EAAE,MAAMA,KAAI,EAAE;AAC3C,UAAI,iBAAiB,IAAI,KAAK,KAAK,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,KAAK,EAAE,KAAK,CAAC;AACzE,WAAK,YAAY;AAEjB,aAAO,MAAM,OAAO,SAAS,GAAG,IAAI,IAAI,WAAW,IAAI,IAAI;AAAA,IAC7D;AAGA,SAAK;AAKL,IAAAS,OAAM,YAAY,IAAI,OAAO,EAAE,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,KAAK,CAAC;AAC1D,SAAK,SAAS,EAAE,MAAM,CAAC,GAAG,KAAK,CAAC;AAChC,kBAAc;AAEd,eAAS;AACP,kBAAY,SAAS,UAAU,MAAM,EAAE,GAAG,KAAK,CAAC;AAChD,UAAIA,KAAI,KAAK,OAAO,WAAW,IAAI,KAAK,WAAW,GAAG,KAAK,CAAC,CAAC;AAE7D,UAAI,eAAe,EAAE,CAAC,EAAE,MAAM,GAAG,GAAG,MAAM,eAAeA,KAAI,CAAC,EAAE,MAAM,GAAG,GAAG,GAAG;AAC7E,QAAAA,OAAMA,KAAI,MAAM,CAAC;AAIjB,YAAIT,OAAM,EAAG,CAAAS,OAAMA,KAAI,KAAK,QAAQ,MAAM,MAAM,GAAG,EAAE,EAAE,MAAMT,KAAI,EAAE,CAAC;AACpE,QAAAS,OAAM,OAAOA,MAAK,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC;AAQrC,YAAI,MAAM,MAAM;AACd,cAAI,oBAAoBA,KAAI,GAAG,MAAM,OAAO,IAAI,GAAG,GAAG;AACpD,iBAAK,YAAY,OAAO;AACxB,gBAAI,YAAY,IAAI,OAAO,GAAG,MAAM,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC;AAC1D,iBAAK,SAAS,EAAE,MAAM,CAAC,GAAG,KAAK,CAAC;AAChC,0BAAc,MAAM;AAAA,UACtB,OAAO;AACL,mBAAO,SAASA,MAAK,KAAK,YAAY,IAAI,IAAI,WAAW,IAAI;AAAA,UAC/D;AAAA,QACF,OAAO;AACL,eAAK,YAAY;AACjB,iBAAOA;AAAA,QACT;AAAA,MACF;AAEA,MAAAA,OAAM;AACN,qBAAe;AAAA,IACjB;AAAA,EACF;AAIA,WAAS,kBAAkB,GAAG;AAE5B,WAAO,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC;AAAA,EAC7B;AAMA,WAAS,aAAa,GAAG,KAAK;AAC5B,QAAIT,IAAGD,IAAG;AAIV,SAAKC,KAAI,IAAI,QAAQ,GAAG,KAAK,GAAI,OAAM,IAAI,QAAQ,KAAK,EAAE;AAG1D,SAAKD,KAAI,IAAI,OAAO,IAAI,KAAK,GAAG;AAG9B,UAAIC,KAAI,EAAG,CAAAA,KAAID;AACf,MAAAC,MAAK,CAAC,IAAI,MAAMD,KAAI,CAAC;AACrB,YAAM,IAAI,UAAU,GAAGA,EAAC;AAAA,IAC1B,WAAWC,KAAI,GAAG;AAGhB,MAAAA,KAAI,IAAI;AAAA,IACV;AAGA,SAAKD,KAAI,GAAG,IAAI,WAAWA,EAAC,MAAM,IAAIA,KAAI;AAG1C,SAAK,MAAM,IAAI,QAAQ,IAAI,WAAW,MAAM,CAAC,MAAM,IAAI,EAAE,IAAI;AAC7D,UAAM,IAAI,MAAMA,IAAG,GAAG;AAEtB,QAAI,KAAK;AACP,aAAOA;AACP,QAAE,IAAIC,KAAIA,KAAID,KAAI;AAClB,QAAE,IAAI,CAAC;AAMP,MAAAA,MAAKC,KAAI,KAAK;AACd,UAAIA,KAAI,EAAG,CAAAD,MAAK;AAEhB,UAAIA,KAAI,KAAK;AACX,YAAIA,GAAG,GAAE,EAAE,KAAK,CAAC,IAAI,MAAM,GAAGA,EAAC,CAAC;AAChC,aAAK,OAAO,UAAUA,KAAI,MAAM,GAAE,EAAE,KAAK,CAAC,IAAI,MAAMA,IAAGA,MAAK,QAAQ,CAAC;AACrE,cAAM,IAAI,MAAMA,EAAC;AACjB,QAAAA,KAAI,WAAW,IAAI;AAAA,MACrB,OAAO;AACL,QAAAA,MAAK;AAAA,MACP;AAEA,aAAOA,OAAM,QAAO;AACpB,QAAE,EAAE,KAAK,CAAC,GAAG;AAEb,UAAI,UAAU;AAGZ,YAAI,EAAE,IAAI,EAAE,YAAY,MAAM;AAG5B,YAAE,IAAI;AACN,YAAE,IAAI;AAAA,QAGR,WAAW,EAAE,IAAI,EAAE,YAAY,MAAM;AAGnC,YAAE,IAAI;AACN,YAAE,IAAI,CAAC,CAAC;AAAA,QAEV;AAAA,MACF;AAAA,IACF,OAAO;AAGL,QAAE,IAAI;AACN,QAAE,IAAI,CAAC,CAAC;AAAA,IACV;AAEA,WAAO;AAAA,EACT;AAMA,WAAS,WAAW,GAAG,KAAK;AAC1B,QAAI,MAAM,MAAM,SAASA,IAAG,SAAS,KAAK,GAAG,IAAI;AAEjD,QAAI,IAAI,QAAQ,GAAG,IAAI,IAAI;AACzB,YAAM,IAAI,QAAQ,gBAAgB,IAAI;AACtC,UAAI,UAAU,KAAK,GAAG,EAAG,QAAO,aAAa,GAAG,GAAG;AAAA,IACrD,WAAW,QAAQ,cAAc,QAAQ,OAAO;AAC9C,UAAI,CAAC,CAAC,IAAK,GAAE,IAAI;AACjB,QAAE,IAAI;AACN,QAAE,IAAI;AACN,aAAO;AAAA,IACT;AAEA,QAAI,MAAM,KAAK,GAAG,GAAI;AACpB,aAAO;AACP,YAAM,IAAI,YAAY;AAAA,IACxB,WAAW,SAAS,KAAK,GAAG,GAAI;AAC9B,aAAO;AAAA,IACT,WAAW,QAAQ,KAAK,GAAG,GAAI;AAC7B,aAAO;AAAA,IACT,OAAO;AACL,YAAM,MAAM,kBAAkB,GAAG;AAAA,IACnC;AAGA,IAAAA,KAAI,IAAI,OAAO,IAAI;AAEnB,QAAIA,KAAI,GAAG;AACT,UAAI,CAAC,IAAI,MAAMA,KAAI,CAAC;AACpB,YAAM,IAAI,UAAU,GAAGA,EAAC;AAAA,IAC1B,OAAO;AACL,YAAM,IAAI,MAAM,CAAC;AAAA,IACnB;AAIA,IAAAA,KAAI,IAAI,QAAQ,GAAG;AACnB,cAAUA,MAAK;AACf,WAAO,EAAE;AAET,QAAI,SAAS;AACX,YAAM,IAAI,QAAQ,KAAK,EAAE;AACzB,YAAM,IAAI;AACV,MAAAA,KAAI,MAAMA;AAGV,gBAAU,OAAO,MAAM,IAAI,KAAK,IAAI,GAAGA,IAAGA,KAAI,CAAC;AAAA,IACjD;AAEA,SAAK,YAAY,KAAK,MAAM,IAAI;AAChC,SAAK,GAAG,SAAS;AAGjB,SAAKA,KAAI,IAAI,GAAGA,EAAC,MAAM,GAAG,EAAEA,GAAG,IAAG,IAAI;AACtC,QAAIA,KAAI,EAAG,QAAO,IAAI,KAAK,EAAE,IAAI,CAAC;AAClC,MAAE,IAAI,kBAAkB,IAAI,EAAE;AAC9B,MAAE,IAAI;AACN,eAAW;AAQX,QAAI,QAAS,KAAI,OAAO,GAAG,SAAS,MAAM,CAAC;AAG3C,QAAI,EAAG,KAAI,EAAE,MAAM,KAAK,IAAI,CAAC,IAAI,KAAK,QAAQ,GAAG,CAAC,IAAI,QAAQ,IAAI,GAAG,CAAC,CAAC;AACvE,eAAW;AAEX,WAAO;AAAA,EACT;AAQA,WAAS,KAAK,MAAM,GAAG;AACrB,QAAI,GACF,MAAM,EAAE,EAAE;AAEZ,QAAI,MAAM,GAAG;AACX,aAAO,EAAE,OAAO,IAAI,IAAI,aAAa,MAAM,GAAG,GAAG,CAAC;AAAA,IACpD;AAOA,QAAI,MAAM,KAAK,KAAK,GAAG;AACvB,QAAI,IAAI,KAAK,KAAK,IAAI;AAEtB,QAAI,EAAE,MAAM,IAAI,QAAQ,GAAG,CAAC,CAAC;AAC7B,QAAI,aAAa,MAAM,GAAG,GAAG,CAAC;AAG9B,QAAI,QACF,KAAK,IAAI,KAAK,CAAC,GACf,MAAM,IAAI,KAAK,EAAE,GACjB,MAAM,IAAI,KAAK,EAAE;AACnB,WAAO,OAAM;AACX,eAAS,EAAE,MAAM,CAAC;AAClB,UAAI,EAAE,MAAM,GAAG,KAAK,OAAO,MAAM,IAAI,MAAM,MAAM,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;AAAA,IACjE;AAEA,WAAO;AAAA,EACT;AAIA,WAAS,aAAa,MAAM,GAAG,GAAG,GAAG,cAAc;AACjD,QAAI,GAAG,GAAG,GAAG,IACXA,KAAI,GACJ,KAAK,KAAK,WACV,IAAI,KAAK,KAAK,KAAK,QAAQ;AAE7B,eAAW;AACX,SAAK,EAAE,MAAM,CAAC;AACd,QAAI,IAAI,KAAK,CAAC;AAEd,eAAS;AACP,UAAI,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI,KAAK,MAAM,GAAG,GAAG,IAAI,CAAC;AAClD,UAAI,eAAe,EAAE,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC;AACxC,UAAI,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI,KAAK,MAAM,GAAG,GAAG,IAAI,CAAC;AAClD,UAAI,EAAE,KAAK,CAAC;AAEZ,UAAI,EAAE,EAAE,CAAC,MAAM,QAAQ;AACrB,aAAK,IAAI,GAAG,EAAE,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,KAAK,MAAK;AACtC,YAAI,KAAK,GAAI;AAAA,MACf;AAEA,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,MAAAA;AAAA,IACF;AAEA,eAAW;AACX,MAAE,EAAE,SAAS,IAAI;AAEjB,WAAO;AAAA,EACT;AAIA,WAAS,QAAQ,GAAGC,IAAG;AACrB,QAAI,IAAI;AACR,WAAO,EAAEA,GAAG,MAAK;AACjB,WAAO;AAAA,EACT;AAIA,WAAS,iBAAiB,MAAM,GAAG;AACjC,QAAI,GACF,QAAQ,EAAE,IAAI,GACdU,MAAK,MAAM,MAAM,KAAK,WAAW,CAAC,GAClC,SAASA,IAAG,MAAM,GAAG;AAEvB,QAAI,EAAE,IAAI;AAEV,QAAI,EAAE,IAAI,MAAM,GAAG;AACjB,iBAAW,QAAQ,IAAI;AACvB,aAAO;AAAA,IACT;AAEA,QAAI,EAAE,SAASA,GAAE;AAEjB,QAAI,EAAE,OAAO,GAAG;AACd,iBAAW,QAAQ,IAAI;AAAA,IACzB,OAAO;AACL,UAAI,EAAE,MAAM,EAAE,MAAMA,GAAE,CAAC;AAGvB,UAAI,EAAE,IAAI,MAAM,GAAG;AACjB,mBAAW,MAAM,CAAC,IAAK,QAAQ,IAAI,IAAM,QAAQ,IAAI;AACrD,eAAO;AAAA,MACT;AAEA,iBAAW,MAAM,CAAC,IAAK,QAAQ,IAAI,IAAM,QAAQ,IAAI;AAAA,IACvD;AAEA,WAAO,EAAE,MAAMA,GAAE,EAAE,IAAI;AAAA,EACzB;AAQA,WAAS,eAAe,GAAG,SAAS,IAAI,IAAI;AAC1C,QAAI,MAAMV,IAAGD,IAAG,GAAG,KAAK,SAAS,KAAK,IAAI,GACxC,OAAO,EAAE,aACT,QAAQ,OAAO;AAEjB,QAAI,OAAO;AACT,iBAAW,IAAI,GAAG,UAAU;AAC5B,UAAI,OAAO,OAAQ,MAAK,KAAK;AAAA,UACxB,YAAW,IAAI,GAAG,CAAC;AAAA,IAC1B,OAAO;AACL,WAAK,KAAK;AACV,WAAK,KAAK;AAAA,IACZ;AAEA,QAAI,CAAC,EAAE,SAAS,GAAG;AACjB,YAAM,kBAAkB,CAAC;AAAA,IAC3B,OAAO;AACL,YAAM,eAAe,CAAC;AACtB,MAAAA,KAAI,IAAI,QAAQ,GAAG;AAOnB,UAAI,OAAO;AACT,eAAO;AACP,YAAI,WAAW,IAAI;AACjB,eAAK,KAAK,IAAI;AAAA,QAChB,WAAW,WAAW,GAAG;AACvB,eAAK,KAAK,IAAI;AAAA,QAChB;AAAA,MACF,OAAO;AACL,eAAO;AAAA,MACT;AAMA,UAAIA,MAAK,GAAG;AACV,cAAM,IAAI,QAAQ,KAAK,EAAE;AACzB,YAAI,IAAI,KAAK,CAAC;AACd,UAAE,IAAI,IAAI,SAASA;AACnB,UAAE,IAAI,YAAY,eAAe,CAAC,GAAG,IAAI,IAAI;AAC7C,UAAE,IAAI,EAAE,EAAE;AAAA,MACZ;AAEA,WAAK,YAAY,KAAK,IAAI,IAAI;AAC9B,MAAAC,KAAI,MAAM,GAAG;AAGb,aAAO,GAAG,EAAE,GAAG,KAAK,IAAI,IAAG,IAAI;AAE/B,UAAI,CAAC,GAAG,CAAC,GAAG;AACV,cAAM,QAAQ,SAAS;AAAA,MACzB,OAAO;AACL,YAAID,KAAI,GAAG;AACT,UAAAC;AAAA,QACF,OAAO;AACL,cAAI,IAAI,KAAK,CAAC;AACd,YAAE,IAAI;AACN,YAAE,IAAIA;AACN,cAAI,OAAO,GAAG,GAAG,IAAI,IAAI,GAAG,IAAI;AAChC,eAAK,EAAE;AACP,UAAAA,KAAI,EAAE;AACN,oBAAU;AAAA,QACZ;AAGA,QAAAD,KAAI,GAAG,EAAE;AACT,YAAI,OAAO;AACX,kBAAU,WAAW,GAAG,KAAK,CAAC,MAAM;AAEpC,kBAAU,KAAK,KACVA,OAAM,UAAU,aAAa,OAAO,KAAK,QAAQ,EAAE,IAAI,IAAI,IAAI,MAChEA,KAAI,KAAKA,OAAM,MAAM,OAAO,KAAK,WAAW,OAAO,KAAK,GAAG,KAAK,CAAC,IAAI,KACrE,QAAQ,EAAE,IAAI,IAAI,IAAI;AAE1B,WAAG,SAAS;AAEZ,YAAI,SAAS;AAGX,iBAAO,EAAE,GAAG,EAAE,EAAE,IAAI,OAAO,KAAI;AAC7B,eAAG,EAAE,IAAI;AACT,gBAAI,CAAC,IAAI;AACP,gBAAEC;AACF,iBAAG,QAAQ,CAAC;AAAA,YACd;AAAA,UACF;AAAA,QACF;AAGA,aAAK,MAAM,GAAG,QAAQ,CAAC,GAAG,MAAM,CAAC,GAAG,EAAE,IAAI;AAG1C,aAAKD,KAAI,GAAG,MAAM,IAAIA,KAAI,KAAKA,KAAK,QAAO,SAAS,OAAO,GAAGA,EAAC,CAAC;AAGhE,YAAI,OAAO;AACT,cAAI,MAAM,GAAG;AACX,gBAAI,WAAW,MAAM,WAAW,GAAG;AACjC,cAAAA,KAAI,WAAW,KAAK,IAAI;AACxB,mBAAK,EAAE,KAAK,MAAMA,IAAG,MAAO,QAAO;AACnC,mBAAK,YAAY,KAAK,MAAM,OAAO;AACnC,mBAAK,MAAM,GAAG,QAAQ,CAAC,GAAG,MAAM,CAAC,GAAG,EAAE,IAAI;AAG1C,mBAAKA,KAAI,GAAG,MAAM,MAAMA,KAAI,KAAKA,KAAK,QAAO,SAAS,OAAO,GAAGA,EAAC,CAAC;AAAA,YACpE,OAAO;AACL,oBAAM,IAAI,OAAO,CAAC,IAAI,MAAM,IAAI,MAAM,CAAC;AAAA,YACzC;AAAA,UACF;AAEA,gBAAO,OAAOC,KAAI,IAAI,MAAM,QAAQA;AAAA,QACtC,WAAWA,KAAI,GAAG;AAChB,iBAAO,EAAEA,KAAI,OAAM,MAAM;AACzB,gBAAM,OAAO;AAAA,QACf,OAAO;AACL,cAAI,EAAEA,KAAI,IAAK,MAAKA,MAAK,KAAKA,OAAO,QAAO;AAAA,mBACnCA,KAAI,IAAK,OAAM,IAAI,MAAM,GAAGA,EAAC,IAAI,MAAM,IAAI,MAAMA,EAAC;AAAA,QAC7D;AAAA,MACF;AAEA,aAAO,WAAW,KAAK,OAAO,WAAW,IAAI,OAAO,WAAW,IAAI,OAAO,MAAM;AAAA,IAClF;AAEA,WAAO,EAAE,IAAI,IAAI,MAAM,MAAM;AAAA,EAC/B;AAIA,WAAS,SAAS,KAAK,KAAK;AAC1B,QAAI,IAAI,SAAS,KAAK;AACpB,UAAI,SAAS;AACb,aAAO;AAAA,IACT;AAAA,EACF;AAyDA,WAAS,IAAI,GAAG;AACd,WAAO,IAAI,KAAK,CAAC,EAAE,IAAI;AAAA,EACzB;AASA,WAAS,KAAK,GAAG;AACf,WAAO,IAAI,KAAK,CAAC,EAAE,KAAK;AAAA,EAC1B;AAUA,WAASW,OAAM,GAAG;AAChB,WAAO,IAAI,KAAK,CAAC,EAAE,MAAM;AAAA,EAC3B;AAWA,WAASC,KAAI,GAAG,GAAG;AACjB,WAAO,IAAI,KAAK,CAAC,EAAE,KAAK,CAAC;AAAA,EAC3B;AAUA,WAAS,KAAK,GAAG;AACf,WAAO,IAAI,KAAK,CAAC,EAAE,KAAK;AAAA,EAC1B;AAUA,WAASC,OAAM,GAAG;AAChB,WAAO,IAAI,KAAK,CAAC,EAAE,MAAM;AAAA,EAC3B;AAUA,WAAS,KAAK,GAAG;AACf,WAAO,IAAI,KAAK,CAAC,EAAE,KAAK;AAAA,EAC1B;AAUA,WAASC,OAAM,GAAG;AAChB,WAAO,IAAI,KAAK,CAAC,EAAE,MAAM;AAAA,EAC3B;AA4BA,WAAS,MAAM,GAAG,GAAG;AACnB,QAAI,IAAI,KAAK,CAAC;AACd,QAAI,IAAI,KAAK,CAAC;AACd,QAAI,GACF,KAAK,KAAK,WACV,KAAK,KAAK,UACV,MAAM,KAAK;AAGb,QAAI,CAAC,EAAE,KAAK,CAAC,EAAE,GAAG;AAChB,UAAI,IAAI,KAAK,GAAG;AAAA,IAGlB,WAAW,CAAC,EAAE,KAAK,CAAC,EAAE,GAAG;AACvB,UAAI,MAAM,MAAM,KAAK,CAAC,EAAE,MAAM,EAAE,IAAI,IAAI,OAAO,IAAI;AACnD,QAAE,IAAI,EAAE;AAAA,IAGV,WAAW,CAAC,EAAE,KAAK,EAAE,OAAO,GAAG;AAC7B,UAAI,EAAE,IAAI,IAAI,MAAM,MAAM,IAAI,EAAE,IAAI,IAAI,KAAK,CAAC;AAC9C,QAAE,IAAI,EAAE;AAAA,IAGV,WAAW,CAAC,EAAE,KAAK,EAAE,OAAO,GAAG;AAC7B,UAAI,MAAM,MAAM,KAAK,CAAC,EAAE,MAAM,GAAG;AACjC,QAAE,IAAI,EAAE;AAAA,IAGV,WAAW,EAAE,IAAI,GAAG;AAClB,WAAK,YAAY;AACjB,WAAK,WAAW;AAChB,UAAI,KAAK,KAAK,OAAO,GAAG,GAAG,KAAK,CAAC,CAAC;AAClC,UAAI,MAAM,MAAM,KAAK,CAAC;AACtB,WAAK,YAAY;AACjB,WAAK,WAAW;AAChB,UAAI,EAAE,IAAI,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC;AAAA,IACrC,OAAO;AACL,UAAI,KAAK,KAAK,OAAO,GAAG,GAAG,KAAK,CAAC,CAAC;AAAA,IACpC;AAEA,WAAO;AAAA,EACT;AAUA,WAASC,MAAK,GAAG;AACf,WAAO,IAAI,KAAK,CAAC,EAAE,KAAK;AAAA,EAC1B;AASA,WAAS,KAAK,GAAG;AACf,WAAO,SAAS,IAAI,IAAI,KAAK,CAAC,GAAG,EAAE,IAAI,GAAG,CAAC;AAAA,EAC7C;AAWA,WAAS,MAAM,GAAGlB,MAAKC,MAAK;AAC1B,WAAO,IAAI,KAAK,CAAC,EAAE,MAAMD,MAAKC,IAAG;AAAA,EACnC;AAqBA,WAASkB,QAAO,KAAK;AACnB,QAAI,CAAC,OAAO,OAAO,QAAQ,SAAU,OAAM,MAAM,eAAe,iBAAiB;AACjF,QAAIjB,IAAG,GAAG,GACR,cAAc,IAAI,aAAa,MAC/B,KAAK;AAAA,MACH;AAAA,MAAa;AAAA,MAAG;AAAA,MAChB;AAAA,MAAY;AAAA,MAAG;AAAA,MACf;AAAA,MAAY,CAAC;AAAA,MAAW;AAAA,MACxB;AAAA,MAAY;AAAA,MAAG;AAAA,MACf;AAAA,MAAQ;AAAA,MAAG;AAAA,MACX;AAAA,MAAQ,CAAC;AAAA,MAAW;AAAA,MACpB;AAAA,MAAU;AAAA,MAAG;AAAA,IACf;AAEF,SAAKA,KAAI,GAAGA,KAAI,GAAG,QAAQA,MAAK,GAAG;AACjC,UAAI,IAAI,GAAGA,EAAC,GAAG,YAAa,MAAK,CAAC,IAAI,SAAS,CAAC;AAChD,WAAK,IAAI,IAAI,CAAC,OAAO,QAAQ;AAC3B,YAAI,UAAU,CAAC,MAAM,KAAK,KAAK,GAAGA,KAAI,CAAC,KAAK,KAAK,GAAGA,KAAI,CAAC,EAAG,MAAK,CAAC,IAAI;AAAA,YACjE,OAAM,MAAM,kBAAkB,IAAI,OAAO,CAAC;AAAA,MACjD;AAAA,IACF;AAEA,QAAI,IAAI,UAAU,YAAa,MAAK,CAAC,IAAI,SAAS,CAAC;AACnD,SAAK,IAAI,IAAI,CAAC,OAAO,QAAQ;AAC3B,UAAI,MAAM,QAAQ,MAAM,SAAS,MAAM,KAAK,MAAM,GAAG;AACnD,YAAI,GAAG;AACL,cAAI,OAAO,UAAU,eAAe,WACjC,OAAO,mBAAmB,OAAO,cAAc;AAChD,iBAAK,CAAC,IAAI;AAAA,UACZ,OAAO;AACL,kBAAM,MAAM,iBAAiB;AAAA,UAC/B;AAAA,QACF,OAAO;AACL,eAAK,CAAC,IAAI;AAAA,QACZ;AAAA,MACF,OAAO;AACL,cAAM,MAAM,kBAAkB,IAAI,OAAO,CAAC;AAAA,MAC5C;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAUA,WAAS,IAAI,GAAG;AACd,WAAO,IAAI,KAAK,CAAC,EAAE,IAAI;AAAA,EACzB;AAUA,WAASkB,MAAK,GAAG;AACf,WAAO,IAAI,KAAK,CAAC,EAAE,KAAK;AAAA,EAC1B;AAQA,WAASC,OAAM,KAAK;AAClB,QAAInB,IAAG,GAAG;AASV,aAASoB,SAAQ,GAAG;AAClB,UAAInB,IAAGD,IAAG,GACR,IAAI;AAGN,UAAI,EAAE,aAAaoB,UAAU,QAAO,IAAIA,SAAQ,CAAC;AAIjD,QAAE,cAAcA;AAEhB,UAAI,kBAAkB,CAAC,GAAG;AACxB,UAAE,IAAI,EAAE;AAER,YAAI,UAAU;AACZ,cAAI,CAAC,EAAE,KAAK,EAAE,IAAIA,SAAQ,MAAM;AAG9B,cAAE,IAAI;AACN,cAAE,IAAI;AAAA,UACR,WAAW,EAAE,IAAIA,SAAQ,MAAM;AAG7B,cAAE,IAAI;AACN,cAAE,IAAI,CAAC,CAAC;AAAA,UACV,OAAO;AACL,cAAE,IAAI,EAAE;AACR,cAAE,IAAI,EAAE,EAAE,MAAM;AAAA,UAClB;AAAA,QACF,OAAO;AACL,YAAE,IAAI,EAAE;AACR,YAAE,IAAI,EAAE,IAAI,EAAE,EAAE,MAAM,IAAI,EAAE;AAAA,QAC9B;AAEA;AAAA,MACF;AAEA,UAAI,OAAO;AAEX,UAAI,MAAM,UAAU;AAClB,YAAI,MAAM,GAAG;AACX,YAAE,IAAI,IAAI,IAAI,IAAI,KAAK;AACvB,YAAE,IAAI;AACN,YAAE,IAAI,CAAC,CAAC;AACR;AAAA,QACF;AAEA,YAAI,IAAI,GAAG;AACT,cAAI,CAAC;AACL,YAAE,IAAI;AAAA,QACR,OAAO;AACL,YAAE,IAAI;AAAA,QACR;AAGA,YAAI,MAAM,CAAC,CAAC,KAAK,IAAI,KAAK;AACxB,eAAKnB,KAAI,GAAGD,KAAI,GAAGA,MAAK,IAAIA,MAAK,GAAI,CAAAC;AAErC,cAAI,UAAU;AACZ,gBAAIA,KAAImB,SAAQ,MAAM;AACpB,gBAAE,IAAI;AACN,gBAAE,IAAI;AAAA,YACR,WAAWnB,KAAImB,SAAQ,MAAM;AAC3B,gBAAE,IAAI;AACN,gBAAE,IAAI,CAAC,CAAC;AAAA,YACV,OAAO;AACL,gBAAE,IAAInB;AACN,gBAAE,IAAI,CAAC,CAAC;AAAA,YACV;AAAA,UACF,OAAO;AACL,cAAE,IAAIA;AACN,cAAE,IAAI,CAAC,CAAC;AAAA,UACV;AAEA;AAAA,QACF;AAGA,YAAI,IAAI,MAAM,GAAG;AACf,cAAI,CAAC,EAAG,GAAE,IAAI;AACd,YAAE,IAAI;AACN,YAAE,IAAI;AACN;AAAA,QACF;AAEA,eAAO,aAAa,GAAG,EAAE,SAAS,CAAC;AAAA,MACrC;AAEA,UAAI,MAAM,UAAU;AAClB,aAAKD,KAAI,EAAE,WAAW,CAAC,OAAO,IAAI;AAChC,cAAI,EAAE,MAAM,CAAC;AACb,YAAE,IAAI;AAAA,QACR,OAAO;AACL,cAAIA,OAAM,GAAI,KAAI,EAAE,MAAM,CAAC;AAC3B,YAAE,IAAI;AAAA,QACR;AAEA,eAAO,UAAU,KAAK,CAAC,IAAI,aAAa,GAAG,CAAC,IAAI,WAAW,GAAG,CAAC;AAAA,MACjE;AAEA,UAAI,MAAM,UAAU;AAClB,YAAI,IAAI,GAAG;AACT,cAAI,CAAC;AACL,YAAE,IAAI;AAAA,QACR,OAAO;AACL,YAAE,IAAI;AAAA,QACR;AAEA,eAAO,aAAa,GAAG,EAAE,SAAS,CAAC;AAAA,MACrC;AAEA,YAAM,MAAM,kBAAkB,CAAC;AAAA,IACjC;AAEA,IAAAoB,SAAQ,YAAY;AAEpB,IAAAA,SAAQ,WAAW;AACnB,IAAAA,SAAQ,aAAa;AACrB,IAAAA,SAAQ,aAAa;AACrB,IAAAA,SAAQ,cAAc;AACtB,IAAAA,SAAQ,gBAAgB;AACxB,IAAAA,SAAQ,kBAAkB;AAC1B,IAAAA,SAAQ,kBAAkB;AAC1B,IAAAA,SAAQ,kBAAkB;AAC1B,IAAAA,SAAQ,mBAAmB;AAC3B,IAAAA,SAAQ,SAAS;AAEjB,IAAAA,SAAQ,SAASA,SAAQ,MAAMH;AAC/B,IAAAG,SAAQ,QAAQD;AAChB,IAAAC,SAAQ,YAAY;AAEpB,IAAAA,SAAQ,MAAM;AACd,IAAAA,SAAQ,OAAO;AACf,IAAAA,SAAQ,QAAQR;AAChB,IAAAQ,SAAQ,MAAMP;AACd,IAAAO,SAAQ,OAAO;AACf,IAAAA,SAAQ,QAAQN;AAChB,IAAAM,SAAQ,OAAO;AACf,IAAAA,SAAQ,QAAQL;AAChB,IAAAK,SAAQ,QAAQ;AAChB,IAAAA,SAAQ,OAAOJ;AACf,IAAAI,SAAQ,OAAO;AACf,IAAAA,SAAQ,QAAQ;AAChB,IAAAA,SAAQ,MAAM;AACd,IAAAA,SAAQ,OAAOF;AACf,IAAAE,SAAQ,MAAM;AACd,IAAAA,SAAQ,MAAM;AACd,IAAAA,SAAQ,QAAQ;AAChB,IAAAA,SAAQ,QAAQ;AAChB,IAAAA,SAAQ,KAAK;AACb,IAAAA,SAAQ,MAAM;AACd,IAAAA,SAAQ,QAAQC;AAChB,IAAAD,SAAQ,OAAOE;AACf,IAAAF,SAAQ,MAAM;AACd,IAAAA,SAAQ,MAAM;AACd,IAAAA,SAAQ,MAAM;AACd,IAAAA,SAAQ,MAAM;AACd,IAAAA,SAAQ,MAAM;AACd,IAAAA,SAAQ,SAAS;AACjB,IAAAA,SAAQ,QAAQ;AAChB,IAAAA,SAAQ,OAAOb;AACf,IAAAa,SAAQ,MAAM;AACd,IAAAA,SAAQ,OAAOG;AACf,IAAAH,SAAQ,OAAO;AACf,IAAAA,SAAQ,MAAM;AACd,IAAAA,SAAQ,MAAM;AACd,IAAAA,SAAQ,MAAM;AACd,IAAAA,SAAQ,OAAOI;AACf,IAAAJ,SAAQ,QAAQ;AAEhB,QAAI,QAAQ,OAAQ,OAAM,CAAC;AAC3B,QAAI,KAAK;AACP,UAAI,IAAI,aAAa,MAAM;AACzB,aAAK,CAAC,aAAa,YAAY,YAAY,YAAY,QAAQ,QAAQ,UAAU,QAAQ;AACzF,aAAKpB,KAAI,GAAGA,KAAI,GAAG,SAAS,KAAI,CAAC,IAAI,eAAe,IAAI,GAAGA,IAAG,CAAC,EAAG,KAAI,CAAC,IAAI,KAAK,CAAC;AAAA,MACnF;AAAA,IACF;AAEA,IAAAoB,SAAQ,OAAO,GAAG;AAElB,WAAOA;AAAA,EACT;AAWA,WAAS,IAAI,GAAG,GAAG;AACjB,WAAO,IAAI,KAAK,CAAC,EAAE,IAAI,CAAC;AAAA,EAC1B;AAUA,WAAS,IAAI,GAAG;AACd,WAAO,IAAI,KAAK,CAAC,EAAE,IAAI;AAAA,EACzB;AASA,WAAS,MAAM,GAAG;AAChB,WAAO,SAAS,IAAI,IAAI,KAAK,CAAC,GAAG,EAAE,IAAI,GAAG,CAAC;AAAA,EAC7C;AAYA,WAAS,QAAQ;AACf,QAAIpB,IAAG,GACL,IAAI,IAAI,KAAK,CAAC;AAEhB,eAAW;AAEX,SAAKA,KAAI,GAAGA,KAAI,UAAU,UAAS;AACjC,UAAI,IAAI,KAAK,UAAUA,IAAG,CAAC;AAC3B,UAAI,CAAC,EAAE,GAAG;AACR,YAAI,EAAE,GAAG;AACP,qBAAW;AACX,iBAAO,IAAI,KAAK,IAAI,CAAC;AAAA,QACvB;AACA,YAAI;AAAA,MACN,WAAW,EAAE,GAAG;AACd,YAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;AAAA,MACvB;AAAA,IACF;AAEA,eAAW;AAEX,WAAO,EAAE,KAAK;AAAA,EAChB;AAQA,WAAS,kBAAkB,KAAK;AAC9B,WAAO,eAAe,WAAW,OAAO,IAAI,gBAAgB,OAAO;AAAA,EACrE;AAUA,WAAS,GAAG,GAAG;AACb,WAAO,IAAI,KAAK,CAAC,EAAE,GAAG;AAAA,EACxB;AAaA,WAAS,IAAI,GAAG,GAAG;AACjB,WAAO,IAAI,KAAK,CAAC,EAAE,IAAI,CAAC;AAAA,EAC1B;AAUA,WAASsB,MAAK,GAAG;AACf,WAAO,IAAI,KAAK,CAAC,EAAE,IAAI,CAAC;AAAA,EAC1B;AAUA,WAASD,OAAM,GAAG;AAChB,WAAO,IAAI,KAAK,CAAC,EAAE,IAAI,EAAE;AAAA,EAC3B;AASA,WAAS,MAAM;AACb,WAAO,SAAS,MAAM,WAAW,EAAE;AAAA,EACrC;AASA,WAAS,MAAM;AACb,WAAO,SAAS,MAAM,WAAW,CAAC;AAAA,EACpC;AAWA,WAAS,IAAI,GAAG,GAAG;AACjB,WAAO,IAAI,KAAK,CAAC,EAAE,IAAI,CAAC;AAAA,EAC1B;AAWA,WAAS,IAAI,GAAG,GAAG;AACjB,WAAO,IAAI,KAAK,CAAC,EAAE,IAAI,CAAC;AAAA,EAC1B;AAWA,WAAS,IAAI,GAAG,GAAG;AACjB,WAAO,IAAI,KAAK,CAAC,EAAE,IAAI,CAAC;AAAA,EAC1B;AAWA,WAAS,OAAO,IAAI;AAClB,QAAI,GAAGpB,IAAG,GAAG,GACXD,KAAI,GACJ,IAAI,IAAI,KAAK,CAAC,GACd,KAAK,CAAC;AAER,QAAI,OAAO,OAAQ,MAAK,KAAK;AAAA,QACxB,YAAW,IAAI,GAAG,UAAU;AAEjC,QAAI,KAAK,KAAK,KAAK,QAAQ;AAE3B,QAAI,CAAC,KAAK,QAAQ;AAChB,aAAOA,KAAI,IAAI,IAAGA,IAAG,IAAI,KAAK,OAAO,IAAI,MAAM;AAAA,IAGjD,WAAW,OAAO,iBAAiB;AACjC,UAAI,OAAO,gBAAgB,IAAI,YAAY,CAAC,CAAC;AAE7C,aAAOA,KAAI,KAAI;AACb,YAAI,EAAEA,EAAC;AAIP,YAAI,KAAK,OAAQ;AACf,YAAEA,EAAC,IAAI,OAAO,gBAAgB,IAAI,YAAY,CAAC,CAAC,EAAE,CAAC;AAAA,QACrD,OAAO;AAIL,aAAGA,IAAG,IAAI,IAAI;AAAA,QAChB;AAAA,MACF;AAAA,IAGF,WAAW,OAAO,aAAa;AAG7B,UAAI,OAAO,YAAY,KAAK,CAAC;AAE7B,aAAOA,KAAI,KAAI;AAGb,YAAI,EAAEA,EAAC,KAAK,EAAEA,KAAI,CAAC,KAAK,MAAM,EAAEA,KAAI,CAAC,KAAK,QAAQ,EAAEA,KAAI,CAAC,IAAI,QAAS;AAGtE,YAAI,KAAK,OAAQ;AACf,iBAAO,YAAY,CAAC,EAAE,KAAK,GAAGA,EAAC;AAAA,QACjC,OAAO;AAIL,aAAG,KAAK,IAAI,GAAG;AACf,UAAAA,MAAK;AAAA,QACP;AAAA,MACF;AAEA,MAAAA,KAAI,IAAI;AAAA,IACV,OAAO;AACL,YAAM,MAAM,iBAAiB;AAAA,IAC/B;AAEA,QAAI,GAAG,EAAEA,EAAC;AACV,UAAM;AAGN,QAAI,KAAK,IAAI;AACX,UAAI,QAAQ,IAAI,WAAW,EAAE;AAC7B,SAAGA,EAAC,KAAK,IAAI,IAAI,KAAK;AAAA,IACxB;AAGA,WAAO,GAAGA,EAAC,MAAM,GAAGA,KAAK,IAAG,IAAI;AAGhC,QAAIA,KAAI,GAAG;AACT,MAAAC,KAAI;AACJ,WAAK,CAAC,CAAC;AAAA,IACT,OAAO;AACL,MAAAA,KAAI;AAGJ,aAAO,GAAG,CAAC,MAAM,GAAGA,MAAK,SAAU,IAAG,MAAM;AAG5C,WAAK,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,KAAK,IAAI,KAAK,GAAI;AAGzC,UAAI,IAAI,SAAU,CAAAA,MAAK,WAAW;AAAA,IACpC;AAEA,MAAE,IAAIA;AACN,MAAE,IAAI;AAEN,WAAO;AAAA,EACT;AAWA,WAAS,MAAM,GAAG;AAChB,WAAO,SAAS,IAAI,IAAI,KAAK,CAAC,GAAG,EAAE,IAAI,GAAG,KAAK,QAAQ;AAAA,EACzD;AAcA,WAASM,MAAK,GAAG;AACf,QAAI,IAAI,KAAK,CAAC;AACd,WAAO,EAAE,IAAK,EAAE,EAAE,CAAC,IAAI,EAAE,IAAI,IAAI,EAAE,IAAK,EAAE,KAAK;AAAA,EACjD;AAUA,WAAS,IAAI,GAAG;AACd,WAAO,IAAI,KAAK,CAAC,EAAE,IAAI;AAAA,EACzB;AAUA,WAASgB,MAAK,GAAG;AACf,WAAO,IAAI,KAAK,CAAC,EAAE,KAAK;AAAA,EAC1B;AAUA,WAAS,KAAK,GAAG;AACf,WAAO,IAAI,KAAK,CAAC,EAAE,KAAK;AAAA,EAC1B;AAWA,WAAS,IAAI,GAAG,GAAG;AACjB,WAAO,IAAI,KAAK,CAAC,EAAE,IAAI,CAAC;AAAA,EAC1B;AAYA,WAAS,MAAM;AACb,QAAIvB,KAAI,GACN,OAAO,WACP,IAAI,IAAI,KAAK,KAAKA,EAAC,CAAC;AAEtB,eAAW;AACX,WAAO,EAAE,KAAK,EAAEA,KAAI,KAAK,SAAS,KAAI,EAAE,KAAK,KAAKA,EAAC,CAAC;AACpD,eAAW;AAEX,WAAO,SAAS,GAAG,KAAK,WAAW,KAAK,QAAQ;AAAA,EAClD;AAUA,WAAS,IAAI,GAAG;AACd,WAAO,IAAI,KAAK,CAAC,EAAE,IAAI;AAAA,EACzB;AAUA,WAASwB,MAAK,GAAG;AACf,WAAO,IAAI,KAAK,CAAC,EAAE,KAAK;AAAA,EAC1B;AASA,WAAS,MAAM,GAAG;AAChB,WAAO,SAAS,IAAI,IAAI,KAAK,CAAC,GAAG,EAAE,IAAI,GAAG,CAAC;AAAA,EAC7C;AAGA,IAAE,OAAO,IAAI,4BAA4B,CAAC,IAAI,EAAE;AAChD,IAAE,OAAO,WAAW,IAAI;AAGjB,MAAI,UAAU,EAAE,cAAcL,OAAM,QAAQ;AAGnD,SAAO,IAAI,QAAQ,IAAI;AACvB,OAAK,IAAI,QAAQ,EAAE;AAEnB,MAAO,kBAAQ;;;AC/yJf,MAAIM,QAAO;AACX,MAAIC,gBAAe,CAAC,OAAO,QAAQ;AAC5B,MAAI,uBAAsC,wBAAQD,OAAMC,eAAc,UAAQ;AACnF,QAAI;AAAA,MACF,IAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAIC,aAAY,gBAAQ,MAAM;AAAA,MAC5B,WAAWD,QAAO;AAAA,MAClB,QAAQ,gBAAQ;AAAA,IAClB,CAAC;AACD,IAAAC,WAAU,YAAY,OAAO,OAAOA,WAAU,SAAS;AAKvD,IAAAA,WAAU,UAAU,OAAO;AAC3B,IAAAA,WAAU,UAAU,cAAc;AAQlC,IAAAA,WAAU,UAAU,SAAS,WAAY;AACvC,aAAO;AAAA,QACL,QAAQ;AAAA,QACR,OAAO,KAAK,SAAS;AAAA,MACvB;AAAA,IACF;AAQA,IAAAA,WAAU,WAAW,SAAU,MAAM;AACnC,aAAO,IAAIA,WAAU,KAAK,KAAK;AAAA,IACjC;AACA,QAAIF,KAAI;AAEN,MAAAA,IAAG,UAAU,SAAU,MAAM,MAAM;AACjC,YAAI,KAAK,cAAc,KAAK,WAAW;AACrC,UAAAE,WAAU,OAAO;AAAA,YACf,WAAW,KAAK;AAAA,UAClB,CAAC;AAAA,QACH;AAAA,MACF,CAAC;AAAA,IACH;AACA,WAAOA;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,EACX,CAAC;;;ACzBD,MAAMC,QAAO,KAAK,QAAQ,SAAU,GAAG;AACrC,WAAO,KAAK,IAAI,CAAC,IAAI,OAAO,IAAI,KAAK,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,KAAK;AAAA,EACrE;AAEA,MAAMC,QAAO,KAAK,QAAQ,SAAU,GAAG;AACrC,WAAO,KAAK,IAAI,CAAC,IAAI,OAAO,KAAK,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,KAAK;AAAA,EACjE;AAQA,MAAM,QAAQ,OAAK;AAEjB,UAAM,IAAI,KAAK,IAAI,MAAM,CAAC;AAC1B,WAAO,KAAK,IAAI;AAAA,EAClB;AAEA,MAAMC,SAAQ,SAAU,GAAG,GAAG;AAE5B,QAAI,KAAK,IAAI,CAAC;AACd,QAAI,KAAK,IAAI,CAAC;AAGd,QAAI,IAAI,EAAG,EAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;AAGzB,QAAI,IAAI,IAAK,QAAO,KAAK,KAAK,IAAI,IAAI,IAAI,CAAC;AAG3C,SAAK;AACL,WAAO,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC;AAAA,EAChC;AAEA,MAAM,cAAc,WAAY;AAC9B,UAAM,YAAY,eAAe;AAAA,EACnC;AASA,WAAS,SAAS,GAAG,GAAG;AAEtB,UAAM,KAAK,KAAK,IAAI,CAAC;AACrB,UAAM,KAAK,KAAK,IAAI,CAAC;AAErB,QAAI,MAAM,GAAG;AACX,aAAO,KAAK,IAAI,EAAE;AAAA,IACpB;AAEA,QAAI,MAAM,GAAG;AACX,aAAO,KAAK,IAAI,EAAE;AAAA,IACpB;AAEA,QAAI,KAAK,OAAQ,KAAK,KAAM;AAC1B,aAAO,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI;AAAA,IACnC;AAkCA,QAAI,IAAI;AACR,QAAI,IAAI;AAER,WAAO,MAAM,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK;AAAA,EAC9C;AAEA,MAAMC,KAAI,EAAE,MAAM,GAAG,MAAM,EAAE;AAC7B,MAAM,QAAQ,SAAU,GAAG,GAAG;AAE5B,UAAM,IAAIA;AAEV,QAAI,MAAM,UAAa,MAAM,MAAM;AACjC,QAAE,IAAI,IACJ,EAAE,IAAI,IAAI;AAAA,IACd,WAAW,MAAM,QAAW;AAC1B,QAAE,IAAI,IAAI;AACV,QAAE,IAAI,IAAI;AAAA,IACZ;AACE,cAAQ,OAAO,GAAG;AAAA,QAEhB,KAAK;AAEH,cAAI,QAAQ,KAAK,QAAQ,GAAG;AAC1B,cAAE,IAAI,IAAI,EAAE,IAAI;AAChB,cAAE,IAAI,IAAI,EAAE,IAAI;AAAA,UAClB,WAAW,SAAS,KAAK,SAAS,GAAG;AACnC,gBAAI,CAAC,SAAS,EAAE,KAAK,CAAC,KAAK,SAAS,EAAE,KAAK,CAAC,GAAG;AAC7C,qBAAO,QAAQ,UAAU;AAAA,YAC3B;AACA,cAAE,IAAI,IAAI,EAAE,KAAK,IAAI,KAAK,IAAI,EAAE,KAAK,CAAC;AACtC,cAAE,IAAI,IAAI,EAAE,KAAK,IAAI,KAAK,IAAI,EAAE,KAAK,CAAC;AAAA,UACxC,WAAW,OAAO,KAAK,SAAS,GAAG;AACjC,gBAAI,CAAC,SAAS,EAAE,GAAG,CAAC,KAAK,SAAS,EAAE,KAAK,CAAC,GAAG;AAC3C,qBAAO,QAAQ,UAAU;AAAA,YAC3B;AACA,cAAE,IAAI,IAAI,EAAE,GAAG,IAAI,KAAK,IAAI,EAAE,KAAK,CAAC;AACpC,cAAE,IAAI,IAAI,EAAE,GAAG,IAAI,KAAK,IAAI,EAAE,KAAK,CAAC;AAAA,UACtC,WAAW,EAAE,WAAW,GAAG;AACzB,cAAE,IAAI,IAAI,EAAE,CAAC;AACb,cAAE,IAAI,IAAI,EAAE,CAAC;AAAA,UACf,OAAO;AACL,wBAAY;AAAA,UACd;AACA;AAAA,QAEF,KAAK;AAEH,YAAE,IAAI;AAAA,UACJ,EAAE,IAAI,IAAI;AAEZ,gBAAM,SAAS,EAAE,QAAQ,MAAM,EAAE,EAC9B,MAAM,uCAAuC;AAChD,cAAI,OAAO;AACX,cAAI,QAAQ;AAEZ,cAAI,WAAW,MAAM;AACnB,wBAAY;AAAA,UACd;AAEA,mBAASC,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AAEtC,kBAAM,IAAI,OAAOA,EAAC;AAElB,gBAAI,MAAM,OAAO,MAAM,OAAQ,MAAM,MAAM;AAAA,YAE3C,WAAW,MAAM,KAAK;AACpB;AAAA,YACF,WAAW,MAAM,KAAK;AACpB;AAAA,YACF,WAAW,MAAM,OAAO,MAAM,KAAK;AAEjC,kBAAI,OAAO,UAAU,GAAG;AACtB,4BAAY;AAAA,cACd;AAEA,kBAAI,OAAOA,KAAI,CAAC,MAAM,OAAO,CAAC,MAAM,OAAOA,KAAI,CAAC,CAAC,GAAG;AAClD,kBAAE,IAAI,KAAK,YAAY,QAAQ,IAAI,MAAM,MAAM,OAAOA,KAAI,CAAC,CAAC;AAC5D,gBAAAA;AAAA,cACF,OAAO;AACL,kBAAE,IAAI,KAAK,YAAY,QAAQ,IAAI,MAAM,MAAM,GAAG;AAAA,cACpD;AACA,qBAAO,QAAQ;AAAA,YAEjB,OAAO;AAEL,kBAAI,OAAO,UAAU,KAAK,MAAM,CAAC,GAAG;AAClC,4BAAY;AAAA,cACd;AAEA,kBAAI,OAAOA,KAAI,CAAC,MAAM,OAAO,OAAOA,KAAI,CAAC,MAAM,KAAK;AAClD,kBAAE,IAAI,KAAK,YAAY,QAAQ,IAAI,MAAM,MAAM,CAAC;AAChD,gBAAAA;AAAA,cACF,OAAO;AACL,kBAAE,IAAI,KAAK,YAAY,QAAQ,IAAI,MAAM,MAAM,CAAC;AAAA,cAClD;AACA,qBAAO,QAAQ;AAAA,YACjB;AAAA,UACF;AAGA,cAAI,OAAO,QAAQ,GAAG;AACpB,wBAAY;AAAA,UACd;AACA;AAAA,QAEF,KAAK;AACH,YAAE,IAAI,IAAI;AACV,YAAE,IAAI,IAAI;AACV;AAAA,QAEF;AACE,sBAAY;AAAA,MAChB;AAEF,QAAI,MAAM,EAAE,IAAI,CAAC,KAAK,MAAM,EAAE,IAAI,CAAC,GAAG;AAAA,IAGtC;AAEA,WAAO;AAAA,EACT;AAMA,WAAS,QAAQ,GAAG,GAAG;AAErB,QAAI,EAAE,gBAAgB,UAAU;AAC9B,aAAO,IAAI,QAAQ,GAAG,CAAC;AAAA,IACzB;AAEA,UAAM,IAAI,MAAM,GAAG,CAAC;AAEpB,SAAK,IAAI,IAAI,EAAE,IAAI;AACnB,SAAK,IAAI,IAAI,EAAE,IAAI;AAAA,EACrB;AAEA,UAAQ,YAAY;AAAA,IAElB,MAAM;AAAA,IACN,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAON,QAAQ,WAAY;AAElB,YAAMC,OAAMH,OAAM,KAAK,IAAI,GAAG,KAAK,IAAI,CAAC;AAExC,aAAO,IAAI;AAAA,QACT,KAAK,IAAI,IAAIG;AAAA,QACb,KAAK,IAAI,IAAIA;AAAA,MAAG;AAAA,IACpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,SAAU,GAAG,GAAG;AAErB,YAAM,IAAI,MAAM,GAAG,CAAC;AAEpB,YAAM,SAAS,KAAK,YAAY,EAAE;AAClC,YAAM,SAAS,EAAE,SAAS,EAAE,IAAI,CAAC,KAAK,SAAS,EAAE,IAAI,CAAC;AAEtD,UAAI,UAAU,QAAQ;AAEpB,YAAI,UAAU,QAAQ;AAEpB,iBAAO,QAAQ,KAAK;AAAA,QACtB;AAEA,eAAO,QAAQ,UAAU;AAAA,MAC3B;AAEA,aAAO,IAAI;AAAA,QACT,KAAK,IAAI,IAAI,EAAE,IAAI;AAAA,QACnB,KAAK,IAAI,IAAI,EAAE,IAAI;AAAA,MAAC;AAAA,IACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,SAAU,GAAG,GAAG;AAErB,YAAM,IAAI,MAAM,GAAG,CAAC;AAEpB,YAAM,SAAS,KAAK,YAAY,EAAE;AAClC,YAAM,SAAS,EAAE,SAAS,EAAE,IAAI,CAAC,KAAK,SAAS,EAAE,IAAI,CAAC;AAEtD,UAAI,UAAU,QAAQ;AAEpB,YAAI,UAAU,QAAQ;AAEpB,iBAAO,QAAQ,KAAK;AAAA,QACtB;AAEA,eAAO,QAAQ,UAAU;AAAA,MAC3B;AAEA,aAAO,IAAI;AAAA,QACT,KAAK,IAAI,IAAI,EAAE,IAAI;AAAA,QACnB,KAAK,IAAI,IAAI,EAAE,IAAI;AAAA,MAAC;AAAA,IACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,SAAU,GAAG,GAAG;AAErB,YAAM,IAAI,MAAM,GAAG,CAAC;AAEpB,YAAM,SAAS,KAAK,YAAY,EAAE;AAClC,YAAM,SAAS,EAAE,SAAS,EAAE,IAAI,CAAC,KAAK,SAAS,EAAE,IAAI,CAAC;AACtD,YAAM,UAAU,KAAK,IAAI,MAAM,KAAK,KAAK,IAAI,MAAM;AACnD,YAAM,UAAU,EAAE,IAAI,MAAM,KAAK,EAAE,IAAI,MAAM;AAG7C,UAAI,UAAU,WAAW,UAAU,SAAS;AAC1C,eAAO,QAAQ,KAAK;AAAA,MACtB;AAGA,UAAI,UAAU,QAAQ;AACpB,eAAO,QAAQ,UAAU;AAAA,MAC3B;AAGA,UAAI,EAAE,IAAI,MAAM,KAAK,KAAK,IAAI,MAAM,GAAG;AACrC,eAAO,IAAI,QAAQ,KAAK,IAAI,IAAI,EAAE,IAAI,GAAG,CAAC;AAAA,MAC5C;AAEA,aAAO,IAAI;AAAA,QACT,KAAK,IAAI,IAAI,EAAE,IAAI,IAAI,KAAK,IAAI,IAAI,EAAE,IAAI;AAAA,QAC1C,KAAK,IAAI,IAAI,EAAE,IAAI,IAAI,KAAK,IAAI,IAAI,EAAE,IAAI;AAAA,MAAC;AAAA,IAC/C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,SAAU,GAAG,GAAG;AAErB,YAAM,IAAI,MAAM,GAAG,CAAC;AAEpB,YAAM,SAAS,KAAK,YAAY,EAAE;AAClC,YAAM,SAAS,EAAE,SAAS,EAAE,IAAI,CAAC,KAAK,SAAS,EAAE,IAAI,CAAC;AACtD,YAAM,UAAU,KAAK,IAAI,MAAM,KAAK,KAAK,IAAI,MAAM;AACnD,YAAM,UAAU,EAAE,IAAI,MAAM,KAAK,EAAE,IAAI,MAAM;AAG7C,UAAI,WAAW,WAAW,UAAU,QAAQ;AAC1C,eAAO,QAAQ,KAAK;AAAA,MACtB;AAGA,UAAI,WAAW,QAAQ;AACrB,eAAO,QAAQ,UAAU;AAAA,MAC3B;AAGA,UAAI,WAAW,QAAQ;AACrB,eAAO,QAAQ,MAAM;AAAA,MACvB;AAEA,UAAI,MAAM,EAAE,IAAI,GAAG;AAEjB,eAAO,IAAI,QAAQ,KAAK,IAAI,IAAI,EAAE,IAAI,GAAG,KAAK,IAAI,IAAI,EAAE,IAAI,CAAC;AAAA,MAC/D;AAEA,UAAI,KAAK,IAAI,EAAE,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,IAAI,CAAC,GAAG;AAEzC,cAAM,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI;AAC1B,cAAM,IAAI,EAAE,IAAI,IAAI,IAAI,EAAE,IAAI;AAE9B,eAAO,IAAI;AAAA,WACR,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,KAAK;AAAA,WAC/B,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,KAAK;AAAA,QAAC;AAAA,MAErC,OAAO;AAEL,cAAM,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI;AAC1B,cAAM,IAAI,EAAE,IAAI,IAAI,IAAI,EAAE,IAAI;AAE9B,eAAO,IAAI;AAAA,WACR,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK;AAAA,WAC/B,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK;AAAA,QAAC;AAAA,MACrC;AAAA,IACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,SAAU,GAAG,GAAG;AAErB,YAAM,IAAI,MAAM,GAAG,CAAC;AAEpB,YAAM,UAAU,KAAK,IAAI,MAAM,KAAK,KAAK,IAAI,MAAM;AACnD,YAAM,UAAU,EAAE,IAAI,MAAM,KAAK,EAAE,IAAI,MAAM;AAE7C,UAAI,SAAS;AACX,eAAO,QAAQ,KAAK;AAAA,MACtB;AAGA,UAAI,EAAE,IAAI,MAAM,GAAG;AAEjB,YAAI,KAAK,IAAI,MAAM,KAAK,KAAK,IAAI,IAAI,GAAG;AAEtC,iBAAO,IAAI,QAAQ,KAAK,IAAI,KAAK,IAAI,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC;AAAA,QAErD,WAAW,KAAK,IAAI,MAAM,GAAG;AAE3B,mBAAS,EAAE,IAAI,IAAI,IAAI,KAAK,GAAG;AAAA,YAC7B,KAAK;AACH,qBAAO,IAAI,QAAQ,KAAK,IAAI,KAAK,IAAI,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC;AAAA,YACrD,KAAK;AACH,qBAAO,IAAI,QAAQ,GAAG,KAAK,IAAI,KAAK,IAAI,GAAG,EAAE,IAAI,CAAC,CAAC;AAAA,YACrD,KAAK;AACH,qBAAO,IAAI,QAAQ,CAAC,KAAK,IAAI,KAAK,IAAI,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC;AAAA,YACtD,KAAK;AACH,qBAAO,IAAI,QAAQ,GAAG,CAAC,KAAK,IAAI,KAAK,IAAI,GAAG,EAAE,IAAI,CAAC,CAAC;AAAA,UACxD;AAAA,QACF;AAAA,MACF;AAqBA,UAAI,WAAW,EAAE,IAAI,IAAI,GAAG;AAC1B,eAAO,QAAQ,MAAM;AAAA,MACvB;AAEA,YAAMC,OAAM,KAAK,MAAM,KAAK,IAAI,GAAG,KAAK,IAAI,CAAC;AAC7C,YAAM,MAAM,SAAS,KAAK,IAAI,GAAG,KAAK,IAAI,CAAC;AAE3C,UAAIC,MAAK,KAAK,IAAI,EAAE,IAAI,IAAI,MAAM,EAAE,IAAI,IAAID,IAAG;AAC/C,UAAIE,MAAK,EAAE,IAAI,IAAI,MAAM,EAAE,IAAI,IAAIF;AACnC,aAAO,IAAI;AAAA,QACTC,MAAK,KAAK,IAAIC,GAAE;AAAA,QAChBD,MAAK,KAAK,IAAIC,GAAE;AAAA,MAAC;AAAA,IACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,QAAQ,WAAY;AAElB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI;AAEnB,UAAI,MAAM,GAAG;AAEX,YAAI,KAAK,GAAG;AACV,iBAAO,IAAI,QAAQ,KAAK,KAAK,CAAC,GAAG,CAAC;AAAA,QACpC,OAAO;AACL,iBAAO,IAAI,QAAQ,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC;AAAA,QACrC;AAAA,MACF;AAEA,YAAM,IAAIN,OAAM,GAAG,CAAC;AAEpB,UAAIK,MAAK,KAAK,KAAK,OAAO,IAAI,KAAK,IAAI,CAAC,EAAE;AAC1C,UAAIC,MAAK,KAAK,IAAI,CAAC,KAAK,IAAID;AAE5B,UAAI,KAAK,GAAG;AACV,eAAO,IAAI,QAAQA,KAAI,IAAI,IAAI,CAACC,MAAKA,GAAE;AAAA,MACzC,OAAO;AACL,eAAO,IAAI,QAAQA,KAAI,IAAI,IAAI,CAACD,MAAKA,GAAE;AAAA,MACzC;AAAA,IACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,WAAY;AAEjB,YAAM,KAAK,KAAK,IAAI,KAAK,IAAI,CAAC;AAE9B,UAAI,KAAK,IAAI,MAAM,GAAG;AACpB,eAAO,IAAI,QAAQ,IAAI,CAAC;AAAA,MAC1B;AACA,aAAO,IAAI;AAAA,QACT,KAAK,KAAK,IAAI,KAAK,IAAI,CAAC;AAAA,QACxB,KAAK,KAAK,IAAI,KAAK,IAAI,CAAC;AAAA,MAAC;AAAA,IAC7B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAUA,SAAS,WAAY;AAQnB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI;AAEnB,aAAO,IAAI;AAAA,QACT,KAAK,MAAM,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,MAAM,CAAC;AAAA,QACrC,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;AAAA,MAAC;AAAA,IAC7B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,WAAY;AAEjB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI;AAEnB,UAAI,MAAM,KAAK,IAAI,GAAG;AACpB,eAAO,IAAI,QAAQ,KAAK,IAAI,CAAC,GAAG,CAAC;AAAA,MACnC;AAEA,aAAO,IAAI;AAAA,QACT,SAAS,GAAG,CAAC;AAAA,QACb,KAAK,MAAM,GAAG,CAAC;AAAA,MAAC;AAAA,IACpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,WAAY;AAEjB,aAAOL,OAAM,KAAK,IAAI,GAAG,KAAK,IAAI,CAAC;AAAA,IACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,WAAY;AAEjB,aAAO,KAAK,MAAM,KAAK,IAAI,GAAG,KAAK,IAAI,CAAC;AAAA,IAC1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,WAAY;AAKjB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI;AAEnB,aAAO,IAAI;AAAA,QACT,KAAK,IAAI,CAAC,IAAIF,MAAK,CAAC;AAAA,QACpB,KAAK,IAAI,CAAC,IAAIC,MAAK,CAAC;AAAA,MAAC;AAAA,IACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,WAAY;AAKjB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI;AAEnB,aAAO,IAAI;AAAA,QACT,KAAK,IAAI,CAAC,IAAID,MAAK,CAAC;AAAA,QACpB,CAAC,KAAK,IAAI,CAAC,IAAIC,MAAK,CAAC;AAAA,MAAC;AAAA,IAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,WAAY;AAOjB,YAAM,IAAI,IAAI,KAAK,IAAI;AACvB,YAAM,IAAI,IAAI,KAAK,IAAI;AACvB,YAAM,IAAI,KAAK,IAAI,CAAC,IAAID,MAAK,CAAC;AAE9B,aAAO,IAAI;AAAA,QACT,KAAK,IAAI,CAAC,IAAI;AAAA,QACdC,MAAK,CAAC,IAAI;AAAA,MAAC;AAAA,IACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,WAAY;AAIjB,YAAM,IAAI,IAAI,KAAK,IAAI;AACvB,YAAM,IAAI,IAAI,KAAK,IAAI;AACvB,YAAM,IAAI,KAAK,IAAI,CAAC,IAAID,MAAK,CAAC;AAE9B,aAAO,IAAI;AAAA,QACT,CAAC,KAAK,IAAI,CAAC,IAAI;AAAA,QACfC,MAAK,CAAC,IAAI;AAAA,MAAC;AAAA,IACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,WAAY;AAIjB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,MAAMD,MAAK,IAAI,CAAC,IAAI,MAAM,KAAK,IAAI,IAAI,CAAC;AAElD,aAAO,IAAI;AAAA,QACT,KAAK,IAAI,CAAC,IAAIA,MAAK,CAAC,IAAI;AAAA,QACxB,KAAK,IAAI,CAAC,IAAIC,MAAK,CAAC,IAAI;AAAA,MAAC;AAAA,IAC7B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,WAAY;AAIjB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,MAAMD,MAAK,IAAI,CAAC,IAAI,MAAM,KAAK,IAAI,IAAI,CAAC;AAElD,aAAO,IAAI;AAAA,QACT,KAAK,IAAI,CAAC,IAAIA,MAAK,CAAC,IAAI;AAAA,QACxB,CAAC,KAAK,IAAI,CAAC,IAAIC,MAAK,CAAC,IAAI;AAAA,MAAC;AAAA,IAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,QAAQ,WAAY;AAIlB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI;AAEnB,YAAM,KAAK,IAAI;AAAA,QACb,IAAI,IAAI,IAAI,IAAI;AAAA,QAChB,KAAK,IAAI;AAAA,MAAC,EAAE,MAAM,EAAE;AAEtB,YAAM,KAAK,IAAI;AAAA,QACb,GAAG,IAAI,IAAI;AAAA,QACX,GAAG,IAAI,IAAI;AAAA,MAAC,EAAE,KAAK,EAAE;AAEvB,aAAO,IAAI,QAAQ,GAAG,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC;AAAA,IACxC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,QAAQ,WAAY;AAIlB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI;AAEnB,YAAM,KAAK,IAAI;AAAA,QACb,IAAI,IAAI,IAAI,IAAI;AAAA,QAChB,KAAK,IAAI;AAAA,MAAC,EAAE,MAAM,EAAE;AAEtB,YAAM,KAAK,IAAI;AAAA,QACb,GAAG,IAAI,IAAI;AAAA,QACX,GAAG,IAAI,IAAI;AAAA,MAAC,EAAE,KAAK,EAAE;AAEvB,aAAO,IAAI,QAAQ,KAAK,KAAK,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI,CAAC;AAAA,IACrD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,QAAQ,WAAY;AAIlB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI;AAEnB,UAAI,MAAM,GAAG;AAEX,YAAI,MAAM,GAAG;AACX,iBAAO,IAAI,QAAQ,GAAG,QAAQ;AAAA,QAChC;AAEA,YAAI,MAAM,IAAI;AACZ,iBAAO,IAAI,QAAQ,GAAG,SAAS;AAAA,QACjC;AAAA,MACF;AAEA,YAAM,IAAI,IAAI,KAAK,IAAM,MAAM,IAAM;AAErC,YAAM,KAAK,IAAI;AAAA,SACZ,IAAI,IAAI,IAAI,IAAI,KAAK;AAAA,QACtB,KAAK,IAAI;AAAA,MAAC,EAAE,IAAI;AAElB,aAAO,IAAI,QAAQ,OAAO,GAAG,IAAI,GAAG,MAAM,GAAG,IAAI,CAAC;AAAA,IACpD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,QAAQ,WAAY;AAIlB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI;AAEnB,UAAI,MAAM,GAAG;AACX,eAAO,IAAI,QAAQ,KAAK,MAAM,GAAG,CAAC,GAAG,CAAC;AAAA,MACxC;AAEA,YAAM,IAAI,IAAI,IAAI,IAAI;AACtB,aAAQ,MAAM,IACV,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,CAAC,IAAI;AAAA,MAAC,EAAE,KAAK,IACb,IAAI;AAAA,QACH,MAAM,IAAK,IAAI,IAAI;AAAA,QACnB,MAAM,IAAK,CAAC,IAAI,IAAI;AAAA,MAAC,EAAE,KAAK;AAAA,IACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,QAAQ,WAAY;AAIlB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI;AAEnB,UAAI,MAAM,KAAK,MAAM,GAAG;AACtB,eAAO,IAAI,QAAQ,GAAG,QAAQ;AAAA,MAChC;AAEA,YAAM,IAAI,IAAI,IAAI,IAAI;AACtB,aAAQ,MAAM,IACV,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,CAAC,IAAI;AAAA,MAAC,EAAE,KAAK,IACb,IAAI;AAAA,QACH,MAAM,IAAK,IAAI,IAAI;AAAA,QACnB,MAAM,IAAK,CAAC,IAAI,IAAI;AAAA,MAAC,EAAE,KAAK;AAAA,IACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,QAAQ,WAAY;AAIlB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI;AAEnB,UAAI,MAAM,KAAK,MAAM,GAAG;AACtB,eAAO,IAAI,QAAQ,KAAK,KAAK,GAAG,QAAQ;AAAA,MAC1C;AAEA,YAAM,IAAI,IAAI,IAAI,IAAI;AACtB,aAAQ,MAAM,IACV,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,CAAC,IAAI;AAAA,MAAC,EAAE,KAAK,IACb,IAAI;AAAA,QACH,MAAM,IAAK,IAAI,IAAI;AAAA,QACnB,MAAM,IAAK,CAAC,IAAI,IAAI;AAAA,MAAC,EAAE,KAAK;AAAA,IACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,QAAQ,WAAY;AAIlB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI;AAEnB,aAAO,IAAI;AAAA,QACTA,MAAK,CAAC,IAAI,KAAK,IAAI,CAAC;AAAA,QACpBD,MAAK,CAAC,IAAI,KAAK,IAAI,CAAC;AAAA,MAAC;AAAA,IACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,QAAQ,WAAY;AAIlB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI;AAEnB,aAAO,IAAI;AAAA,QACTA,MAAK,CAAC,IAAI,KAAK,IAAI,CAAC;AAAA,QACpBC,MAAK,CAAC,IAAI,KAAK,IAAI,CAAC;AAAA,MAAC;AAAA,IACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,QAAQ,WAAY;AAIlB,YAAM,IAAI,IAAI,KAAK,IAAI;AACvB,YAAM,IAAI,IAAI,KAAK,IAAI;AACvB,YAAM,IAAID,MAAK,CAAC,IAAI,KAAK,IAAI,CAAC;AAE9B,aAAO,IAAI;AAAA,QACTC,MAAK,CAAC,IAAI;AAAA,QACV,KAAK,IAAI,CAAC,IAAI;AAAA,MAAC;AAAA,IACnB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,QAAQ,WAAY;AAIlB,YAAM,IAAI,IAAI,KAAK,IAAI;AACvB,YAAM,IAAI,IAAI,KAAK,IAAI;AACvB,YAAM,IAAID,MAAK,CAAC,IAAI,KAAK,IAAI,CAAC;AAE9B,aAAO,IAAI;AAAA,QACTC,MAAK,CAAC,IAAI;AAAA,QACV,CAAC,KAAK,IAAI,CAAC,IAAI;AAAA,MAAC;AAAA,IACpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,QAAQ,WAAY;AAIlB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI,IAAI,CAAC,IAAID,MAAK,IAAI,CAAC;AAEtC,aAAO,IAAI;AAAA,QACT,KAAKC,MAAK,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI;AAAA,QAC7B,IAAID,MAAK,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI;AAAA,MAAC;AAAA,IACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,QAAQ,WAAY;AAIlB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI,IAAI,CAAC,IAAIA,MAAK,IAAI,CAAC;AAEtC,aAAO,IAAI;AAAA,QACT,IAAIA,MAAK,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI;AAAA,QAC5B,KAAKC,MAAK,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI;AAAA,MAAC;AAAA,IAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,SAAS,WAAY;AAInB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI;AAEnB,UAAI,MAAM,GAAG;AAEX,YAAI,MAAM,GAAG;AACX,iBAAO,IAAI,QAAQ,GAAG,CAAC;AAAA,QACzB;AAGA,cAAM,IAAI,KAAK,IAAI,CAAC;AACpB,cAAM,IAAI,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,CAAC;AAE3C,eAAO,IAAI,QAAQ,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC;AAAA,MACtC;AAGA,YAAM,MAAM,IAAI,IAAI,IAAI,IAAI;AAC5B,YAAM,MAAM,IAAI,IAAI;AAEpB,YAAM,IAAI,IAAI,QAAQ,KAAK,GAAG,EAAE,MAAM,EAAE;AAExC,aAAO,IAAI,QAAQ,IAAI,EAAE,IAAI,GAAG,IAAI,EAAE,IAAI,CAAC,EAAE,KAAK,EAAE;AAAA,IACtD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,SAAS,WAAY;AAInB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI;AAEnB,UAAI,MAAM,GAAG;AAGX,YAAI,IAAI,GAAG;AAET,iBAAO,IAAI;AAAA,YACT,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC;AAAA,YAAG;AAAA,UAAC;AAAA,QACxD;AAEA,YAAI,IAAI,IAAI;AAEV,gBAAM,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC;AAC7B,iBAAO,IAAI,QAAQ,KAAK,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,EAAE;AAAA,QAC9C;AAIA,eAAO,IAAI,QAAQ,GAAG,KAAK,KAAK,CAAC,CAAC;AAAA,MACpC;AAEA,YAAM,KAAK,IAAI,QAAQ,IAAI,GAAG,CAAC,EAAE,MAAM,EAAE;AACzC,YAAM,KAAK,IAAI,QAAQ,IAAI,GAAG,CAAC,EAAE,MAAM,EAAE;AAEzC,aAAO,IAAI;AAAA,QACT,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI;AAAA,QAC5C,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI,IAAI,GAAG,IAAI;AAAA,MAC9C,EAAE,KAAK,EAAE;AAAA,IACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,SAAS,WAAY;AAInB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI;AAEnB,UAAI,MAAM,GAAG;AAEX,YAAI,MAAM,GAAG;AACX,iBAAO,IAAI,QAAQ,GAAG,CAAC;AAAA,QACzB;AAEA,YAAI,MAAM,GAAG;AAEX,iBAAO,IAAI,QAAQ,UAAU,CAAC;AAAA,QAChC;AAEA,YAAI,MAAM,IAAI;AAEZ,iBAAO,IAAI,QAAQ,WAAW,CAAC;AAAA,QACjC;AAEA,YAAI,KAAK,KAAK,IAAI,GAAG;AAEnB,iBAAO,IAAI;AAAA,YACT,MAAM,KAAK,KAAK,IAAI,MAAM,IAAI,EAAE;AAAA,YAChC;AAAA,UACF;AAAA,QACF;AAEA,YAAI,IAAI,GAAG;AAET,gBAAMQ,MAAK,IAAI,MAAM,IAAI;AACzB,iBAAO,IAAI;AAAA,YACT,MAAM,KAAK,IAAIA,EAAC;AAAA,YAChB,CAAC,KAAK,KAAK;AAAA,UACb;AAAA,QACF;AAGA,cAAM,KAAK,IAAI,MAAM,IAAI;AACzB,eAAO,IAAI;AAAA,UACT,MAAM,KAAK,IAAI,CAAC,CAAC;AAAA;AAAA,UACjB,KAAK,KAAK;AAAA,QACZ;AAAA,MACF;AAGA,YAAM,WAAW,IAAI;AACrB,YAAM,UAAU,IAAI;AACpB,YAAM,IAAI,WAAW,WAAW,IAAI;AAEpC,UAAI,MAAM,GAAG;AAGX,eAAO,IAAI;AAAA,UACR,MAAM,KAAO,IAAI,IAAK;AAAA,UACtB,MAAM,IAAM,IAAI,IAAK;AAAA,QACxB;AAAA,MACF;AAGA,YAAM,MAAM,UAAU,WAAW,IAAI,KAAK;AAC1C,YAAM,MAAM,IAAI,WAAW,UAAU,KAAK;AAG1C,aAAO,IAAI;AAAA,QACT,SAAS,IAAI,EAAE,IAAI;AAAA,QACnB,KAAK,MAAM,IAAI,EAAE,IAAI;AAAA,MACvB;AAAA,IACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,SAAS,WAAY;AAInB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI;AAGnB,UAAI,MAAM,KAAK,MAAM,GAAG;AACtB,eAAO,IAAI,QAAQ,GAAG,KAAK,KAAK,CAAC;AAAA,MACnC;AAEA,YAAM,IAAI,IAAI,IAAI,IAAI;AAEtB,UAAI,MAAM,GAAG;AAEX,eAAO,IAAI,QAAQ,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE;AAAA,MAC7C;AAGA,aAAO,IAAI;AAAA,QACR,MAAM,IAAK,IAAI,IAAI;AAAA,QACnB,MAAM,IAAK,CAAC,IAAI,IAAI;AAAA,MACvB,EAAE,OAAO,EAAE;AAAA,IACb;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,SAAS,WAAY;AAInB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI;AAEnB,UAAI,MAAM,GAAG;AAGX,YAAI,MAAM,GAAG;AAEX,iBAAO,IAAI,QAAQ,UAAU,CAAC;AAAA,QAChC;AAGA,cAAMC,OAAM,IAAI;AAChB,eAAO,IAAI;AAAA,UACT,KAAK,IAAIA,OAAM,KAAK,KAAKA,OAAMA,OAAM,CAAC,CAAC;AAAA,UACvC;AAAA,QACF;AAAA,MACF;AAEA,YAAM,IAAI,IAAI,IAAI,IAAI;AAEtB,UAAI,MAAM,GAAG;AAEX,eAAO,IAAI,QAAQ,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE;AAAA,MAC7C;AAGA,aAAO,IAAI;AAAA,QACR,MAAM,IAAK,IAAI,IAAI;AAAA,QACnB,MAAM,IAAK,CAAC,IAAI,IAAI;AAAA,MAAC,EAAE,OAAO,EAAE;AAAA,IACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,SAAS,WAAY;AAInB,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI;AAEnB,UAAI,KAAK,QAAQ,EAAE,GAAG;AAEpB,eAAO,QAAQ,UAAU;AAAA,MAC3B;AAEA,YAAM,IAAI,IAAI,IAAI,IAAI;AAEtB,UAAI,MAAM,GAAG;AAEX,eAAO,IAAI,QAAQ,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE;AAAA,MAC7C;AAGA,aAAO,IAAI;AAAA,QACR,MAAM,IAAK,IAAI,IAAI;AAAA,QACnB,MAAM,IAAK,CAAC,IAAI,IAAI;AAAA,MAAC,EAAE,OAAO,EAAE;AAAA,IACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,WAAW,WAAY;AAGrB,UAAI,KAAK,QAAQ,EAAE,GAAG;AACpB,eAAO,QAAQ,UAAU;AAAA,MAC3B;AAEA,UAAI,KAAK,YAAY,EAAE,GAAG;AACxB,eAAO,QAAQ,MAAM;AAAA,MACvB;AAEA,YAAM,IAAI,KAAK,IAAI;AACnB,YAAM,IAAI,KAAK,IAAI;AAEnB,YAAM,IAAI,IAAI,IAAI,IAAI;AAEtB,aAAO,IAAI,QAAQ,IAAI,GAAG,CAAC,IAAI,CAAC;AAAA,IAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,aAAa,WAAY;AAEvB,aAAO,IAAI,QAAQ,KAAK,IAAI,GAAG,CAAC,KAAK,IAAI,CAAC;AAAA,IAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,WAAY;AAEjB,aAAO,IAAI,QAAQ,CAAC,KAAK,IAAI,GAAG,CAAC,KAAK,IAAI,CAAC;AAAA,IAC7C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,QAAQ,SAAU,QAAQ;AAExB,eAAS,KAAK,IAAI,IAAI,UAAU,CAAC;AAEjC,aAAO,IAAI;AAAA,QACT,KAAK,KAAK,KAAK,IAAI,IAAI,MAAM,IAAI;AAAA,QACjC,KAAK,KAAK,KAAK,IAAI,IAAI,MAAM,IAAI;AAAA,MAAM;AAAA,IAC3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,SAAS,SAAU,QAAQ;AAEzB,eAAS,KAAK,IAAI,IAAI,UAAU,CAAC;AAEjC,aAAO,IAAI;AAAA,QACT,KAAK,MAAM,KAAK,IAAI,IAAI,MAAM,IAAI;AAAA,QAClC,KAAK,MAAM,KAAK,IAAI,IAAI,MAAM,IAAI;AAAA,MAAM;AAAA,IAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,SAAS,SAAU,QAAQ;AAEzB,eAAS,KAAK,IAAI,IAAI,UAAU,CAAC;AAEjC,aAAO,IAAI;AAAA,QACT,KAAK,MAAM,KAAK,IAAI,IAAI,MAAM,IAAI;AAAA,QAClC,KAAK,MAAM,KAAK,IAAI,IAAI,MAAM,IAAI;AAAA,MAAM;AAAA,IAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASA,UAAU,SAAU,GAAG,GAAG;AAExB,YAAM,IAAI,MAAM,GAAG,CAAC;AAEpB,aAAO,KAAK,IAAI,EAAE,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,QAAQ,SAAS,KACxD,KAAK,IAAI,EAAE,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,QAAQ,SAAS;AAAA,IACvD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,SAAS,WAAY;AAEnB,aAAO,IAAI,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,CAAC;AAAA,IAC3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,YAAY,WAAY;AAEtB,UAAI,IAAI,KAAK,IAAI;AACjB,UAAI,IAAI,KAAK,IAAI;AACjB,UAAI,MAAM;AAEV,UAAI,KAAK,OAAO,EAAE,GAAG;AACnB,eAAO;AAAA,MACT;AAEA,UAAI,KAAK,YAAY,EAAE,GAAG;AACxB,eAAO;AAAA,MACT;AAEA,UAAI,KAAK,IAAI,CAAC,IAAI,QAAQ,SAAS,GAAG;AACpC,YAAI;AAAA,MACN;AAEA,UAAI,KAAK,IAAI,CAAC,IAAI,QAAQ,SAAS,GAAG;AACpC,YAAI;AAAA,MACN;AAGA,UAAI,MAAM,GAAG;AACX,eAAO,MAAM;AAAA,MACf;AAEA,UAAI,MAAM,GAAG;AACX,eAAO;AACP,eAAO;AACP,YAAI,IAAI,GAAG;AACT,cAAI,CAAC;AACL,iBAAO;AAAA,QACT,OAAO;AACL,iBAAO;AAAA,QACT;AACA,eAAO;AAAA,MACT,WAAW,IAAI,GAAG;AAChB,YAAI,CAAC;AACL,eAAO;AAAA,MACT;AAEA,UAAI,MAAM,GAAG;AACX,eAAO;AAAA,MACT;AACA,aAAO,MAAM;AAAA,IACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,YAAY,WAAY;AAEtB,aAAO,CAAC,KAAK,IAAI,GAAG,KAAK,IAAI,CAAC;AAAA,IAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,WAAW,WAAY;AAErB,UAAI,KAAK,IAAI,MAAM,GAAG;AACpB,eAAO,KAAK,IAAI;AAAA,MAClB;AACA,aAAO;AAAA,IACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,SAAS,WAAY;AACnB,aAAO,MAAM,KAAK,IAAI,CAAC,KAAK,MAAM,KAAK,IAAI,CAAC;AAAA,IAC9C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQA,UAAU,WAAY;AACpB,aAAO,KAAK,IAAI,MAAM,KAAK,KAAK,IAAI,MAAM;AAAA,IAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQA,YAAY,WAAY;AACtB,aAAO,SAAS,KAAK,IAAI,CAAC,KAAK,SAAS,KAAK,IAAI,CAAC;AAAA,IACpD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQA,cAAc,WAAY;AACxB,aAAO,CAAC,KAAK,UAAU,EAAE;AAAA,IAC3B;AAAA,EACF;AAEA,UAAQ,MAAM,IAAI,IAAI,QAAQ,GAAG,CAAC;AAClC,UAAQ,KAAK,IAAI,IAAI,QAAQ,GAAG,CAAC;AACjC,UAAQ,GAAG,IAAI,IAAI,QAAQ,GAAG,CAAC;AAC/B,UAAQ,IAAI,IAAI,IAAI,QAAQ,KAAK,IAAI,CAAC;AACtC,UAAQ,GAAG,IAAI,IAAI,QAAQ,KAAK,GAAG,CAAC;AACpC,UAAQ,UAAU,IAAI,IAAI,QAAQ,UAAU,QAAQ;AACpD,UAAQ,KAAK,IAAI,IAAI,QAAQ,KAAK,GAAG;AACrC,UAAQ,SAAS,IAAI;;;AC17CrB,MAAIC,QAAO;AACX,MAAIC,gBAAe,CAAC;AACb,MAAI,qBAAoC,wBAAQD,OAAMC,eAAc,MAAM;AAI/E,WAAO,eAAe,SAAS,QAAQ;AAAA,MACrC,OAAO;AAAA,IACT,CAAC;AACD,YAAQ,UAAU,cAAc;AAChC,YAAQ,UAAU,OAAO;AACzB,YAAQ,UAAU,YAAY;AAO9B,YAAQ,UAAU,SAAS,WAAY;AACrC,aAAO;AAAA,QACL,QAAQ;AAAA,QACR,IAAI,KAAK;AAAA,QACT,IAAI,KAAK;AAAA,MACX;AAAA,IACF;AAOA,YAAQ,UAAU,UAAU,WAAY;AACtC,aAAO;AAAA,QACL,GAAG,KAAK,IAAI;AAAA,QACZ,KAAK,KAAK,IAAI;AAAA,MAChB;AAAA,IACF;AAWA,YAAQ,UAAU,SAAS,SAAU,SAAS;AAC5C,UAAI,MAAM;AACV,UAAIC,MAAK,KAAK;AACd,UAAIC,MAAK,KAAK;AACd,UAAI,QAAQ,OAAO,KAAK,IAAI,OAAO;AACnC,UAAI,QAAQ,OAAO,KAAK,IAAI,OAAO;AAGnC,UAAI,YAAY,SAAS,OAAO,IAAI,UAAU,UAAU,QAAQ,YAAY;AAC5E,UAAI,cAAc,MAAM;AACtB,YAAI,UAAU,KAAK,IAAI,IAAI,CAAC,SAAS;AACrC,YAAI,KAAK,IAAIA,MAAKD,GAAE,IAAI,SAAS;AAC/B,UAAAC,MAAK;AAAA,QACP;AACA,YAAI,KAAK,IAAID,MAAKC,GAAE,IAAI,SAAS;AAC/B,UAAAD,MAAK;AAAA,QACP;AAAA,MACF;AACA,UAAIA,QAAO,GAAG;AAEZ,cAAM;AAAA,MACR,WAAWC,QAAO,GAAG;AAEnB,YAAID,QAAO,GAAG;AACZ,gBAAM;AAAA,QACR,WAAWA,QAAO,IAAI;AACpB,gBAAM;AAAA,QACR,OAAO;AACL,gBAAM,QAAQ;AAAA,QAChB;AAAA,MACF,OAAO;AAEL,YAAIA,MAAK,GAAG;AACV,cAAIA,QAAO,IAAI;AACb,kBAAM,QAAQ;AAAA,UAChB,OAAO;AACL,kBAAM,QAAQ,QAAQ,MAAM,UAAU,CAAC,IAAI;AAAA,UAC7C;AAAA,QACF,OAAO;AACL,cAAIA,QAAO,GAAG;AACZ,kBAAM,QAAQ;AAAA,UAChB,OAAO;AACL,kBAAM,QAAQ,QAAQ,QAAQ;AAAA,UAChC;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAaA,YAAQ,YAAY,SAAU,MAAM;AAClC,cAAQ,UAAU,QAAQ;AAAA,QACxB,KAAK,GACH;AACE,cAAIE,OAAM,UAAU,CAAC;AACrB,cAAI,OAAOA,SAAQ,UAAU;AAC3B,mBAAO,QAAQA,IAAG;AAAA,UACpB,OAAO;AACL,kBAAM,IAAI,UAAU,gDAAgD;AAAA,UACtE;AAAA,QACF;AAAA,QACF,KAAK,GACH;AACE,cAAI,IAAI,UAAU,CAAC;AACnB,cAAIC,OAAM,UAAU,CAAC;AACrB,cAAI,SAAS,CAAC,GAAG;AACf,gBAAI,OAAOA,IAAG,KAAKA,KAAI,QAAQ,OAAO,GAAG;AAEvC,cAAAA,OAAMA,KAAI,SAAS,KAAK;AAAA,YAC1B;AACA,gBAAI,SAASA,IAAG,GAAG;AACjB,qBAAO,IAAI,QAAQ;AAAA,gBACjB;AAAA,gBACA,KAAAA;AAAA,cACF,CAAC;AAAA,YACH;AACA,kBAAM,IAAI,UAAU,wCAAwC;AAAA,UAC9D,OAAO;AACL,kBAAM,IAAI,UAAU,2BAA2B;AAAA,UACjD;AAAA,QACF;AAAA,QACF;AACE,gBAAM,IAAI,YAAY,iDAAiD;AAAA,MAC3E;AAAA,IACF;AACA,YAAQ,UAAU,UAAU,QAAQ,UAAU;AAU9C,YAAQ,WAAW,SAAU,MAAM;AACjC,aAAO,IAAI,QAAQ,IAAI;AAAA,IACzB;AAiBA,YAAQ,UAAU,SAAU,GAAG,GAAG;AAChC,UAAI,EAAE,KAAK,EAAE,IAAI;AACf,eAAO;AAAA,MACT;AACA,UAAI,EAAE,KAAK,EAAE,IAAI;AACf,eAAO;AAAA,MACT;AACA,UAAI,EAAE,KAAK,EAAE,IAAI;AACf,eAAO;AAAA,MACT;AACA,UAAI,EAAE,KAAK,EAAE,IAAI;AACf,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,EACX,CAAC;;;ACjKD,MAAI,OAAO,WAAW,YAAa,UAAS,SAAU,GAAG;AAAE,QAAI,MAAM,CAAC,EAAG,OAAM,IAAI,MAAM,EAAE;AAAG,WAAO;AAAA,EAAG;AAExG,MAAM,SAAS,OAAO,CAAC;AACvB,MAAM,QAAQ,OAAO,CAAC;AACtB,MAAM,QAAQ,OAAO,CAAC;AACtB,MAAM,UAAU,OAAO,CAAC;AACxB,MAAM,SAAS,OAAO,CAAC;AACvB,MAAM,QAAQ,OAAO,EAAE;AACvB,MAAM,cAAc,OAAO,OAAO,gBAAgB;AAKlD,MAAM,gBAAgB;AAGtB,MAAMC,KAAI;AAAA,IACR,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,EACP;AAEA,WAAS,OAAO,GAAG,GAAG;AAEpB,QAAI;AACF,UAAI,OAAO,CAAC;AAAA,IACd,SAASC,IAAG;AACV,YAAM,iBAAiB;AAAA,IACzB;AACA,WAAO,IAAI;AAAA,EACb;AAEA,WAAS,OAAO,GAAG;AACjB,WAAO,OAAO,MAAM,WAAW,IAAI,KAAK,MAAM,CAAC;AAAA,EACjD;AAGA,WAAS,YAAY,GAAG,GAAG;AAEzB,QAAI,MAAM,QAAQ;AAChB,YAAM,eAAe;AAAA,IACvB;AAEA,UAAM,IAAI,OAAO,OAAO,SAAS,SAAS;AAC1C,MAAE,GAAG,IAAI,IAAI,SAAS,CAAC,QAAQ;AAE/B,QAAI,IAAI,SAAS,CAAC,IAAI;AAEtB,UAAM,IAAI,IAAI,GAAG,CAAC;AAElB,MAAE,GAAG,IAAI,IAAI;AACb,MAAE,GAAG,IAAI,IAAI;AACb,WAAO;AAAA,EACT;AAEA,MAAM,cAAc,CAAC,QAAQ,OAAO,OAAO,QAAQ,OAAO,OAAO,QAAQ,OAAO,QAAQ,SAAS,OAAO,QAAQ,OAAO;AACvH,WAAS,UAAU,GAAG;AAEpB,UAAM,UAAU,uBAAO,OAAO,IAAI;AAClC,QAAI,KAAK,OAAO;AACd,cAAQ,CAAC,IAAI;AACb,aAAO;AAAA,IACT;AAEA,UAAMC,OAAM,CAAC,MAAM;AAAE,cAAQ,CAAC,KAAK,QAAQ,CAAC,KAAK,UAAU;AAAA,IAAO;AAElE,WAAO,IAAI,UAAU,QAAQ;AAAE,MAAAA,KAAI,KAAK;AAAG,WAAK;AAAA,IAAO;AACvD,WAAO,IAAI,YAAY,QAAQ;AAAE,MAAAA,KAAI,OAAO;AAAG,WAAK;AAAA,IAAS;AAC7D,WAAO,IAAI,WAAW,QAAQ;AAAE,MAAAA,KAAI,MAAM;AAAG,WAAK;AAAA,IAAQ;AAI1D,aAAS,KAAK,GAAG,IAAI,QAAQ,QAAQ,IAAI,KAAK,KAAI;AAChD,aAAO,IAAI,MAAM,QAAQ;AAAE,QAAAA,KAAI,CAAC;AAAG,aAAK;AAAA,MAAG;AAC3C,WAAK,YAAY,EAAE;AACnB,WAAM,KAAK,IAAK;AAAA,IAClB;AACA,QAAI,IAAI,MAAO,CAAAA,KAAI,CAAC;AACpB,WAAO;AAAA,EACT;AAEA,MAAMC,SAAQ,SAAU,IAAI,IAAI;AAE9B,QAAI,IAAI,QAAQ,IAAI,OAAO,IAAI;AAE/B,QAAI,OAAO,UAAa,OAAO,MAAM;AAAA,IAErC,WAAW,OAAO,QAAW;AAE3B,UAAI,OAAO,OAAO,UAAU;AAC1B,YAAI;AAAA,MACN,WAAW,MAAM,EAAE,GAAG;AACpB,cAAM,iBAAiB;AAAA,MACzB,WAAW,KAAK,MAAM,GAAG;AACvB,cAAM,oBAAoB;AAAA,MAC5B,OAAO;AACL,YAAI,OAAO,EAAE;AAAA,MACf;AAEA,UAAI,OAAO,OAAO,UAAU;AAC1B,YAAI;AAAA,MACN,WAAW,MAAM,EAAE,GAAG;AACpB,cAAM,iBAAiB;AAAA,MACzB,WAAW,KAAK,MAAM,GAAG;AACvB,cAAM,oBAAoB;AAAA,MAC5B,OAAO;AACL,YAAI,OAAO,EAAE;AAAA,MACf;AAEA,UAAI,IAAI;AAAA,IAEV,WAAW,OAAO,OAAO,UAAU;AACjC,UAAI,OAAO,MAAM,OAAO,IAAI;AAC1B,YAAI,OAAO,GAAG,GAAG,CAAC;AAClB,YAAI,OAAO,GAAG,GAAG,CAAC;AAClB,YAAI,OAAO;AACT,eAAK,OAAO,GAAG,GAAG,CAAC;AAAA,MACvB,WAAW,KAAK,IAAI;AAClB,YAAI,OAAO,GAAG,CAAC,CAAC;AAChB,YAAI,KAAK;AACP,cAAI,OAAO,GAAG,CAAC,CAAC;AAAA,MACpB,WAAW,OAAO,OAAO,UAAU;AACjC,YAAI;AAAA,MACN,OAAO;AACL,cAAM,iBAAiB;AAAA,MACzB;AACA,UAAI,IAAI;AAAA,IACV,WAAW,OAAO,OAAO,UAAU;AAEjC,UAAI,MAAM,EAAE,GAAG;AACb,cAAM,iBAAiB;AAAA,MACzB;AAEA,UAAI,KAAK,GAAG;AACV,YAAI,CAAC;AACL,aAAK,CAAC;AAAA,MACR;AAEA,UAAI,KAAK,MAAM,GAAG;AAChB,YAAI,OAAO,EAAE;AAAA,MACf,OAAO;AAEL,YAAI,IAAI;AAER,YAAI,IAAI,GAAG,IAAI;AACf,YAAI,IAAI,GAAG,IAAI;AAEf,YAAI,IAAI;AAER,YAAI,MAAM,GAAG;AACX,cAAI,MAAM,KAAK,MAAM,IAAI,KAAK,MAAM,EAAE,CAAC;AACvC,gBAAM;AAAA,QACR;AAIA,eAAO,KAAK,KAAK,KAAK,GAAG;AACvB,cAAI,KAAK,IAAI,MAAM,IAAI;AAEvB,cAAI,OAAO,GAAG;AACZ,gBAAI,IAAI,KAAK,GAAG;AACd,kBAAI,IAAI;AACR,kBAAI,IAAI;AAAA,YACV,WAAW,IAAI,GAAG;AAChB,kBAAI;AACJ,kBAAI;AAAA,YACN,OAAO;AACL,kBAAI;AACJ,kBAAI;AAAA,YACN;AACA;AAAA,UAEF,OAAO;AAEL,gBAAI,KAAK,GAAG;AACV,mBAAK;AACL,mBAAK;AAAA,YACP,OAAO;AACL,mBAAK;AACL,mBAAK;AAAA,YACP;AAEA,gBAAI,IAAI,GAAG;AACT,kBAAI;AACJ,kBAAI;AAAA,YACN,OAAO;AACL,kBAAI;AACJ,kBAAI;AAAA,YACN;AAAA,UACF;AAAA,QACF;AACA,YAAI,OAAO,CAAC,IAAI,OAAO,CAAC;AACxB,YAAI,OAAO,CAAC;AAAA,MACd;AAAA,IAEF,WAAW,OAAO,OAAO,UAAU;AAEjC,UAAI,MAAM;AAEV,UAAI,IAAI,QAAQ,IAAI,QAAQ,IAAI,QAAQ,IAAI,OAAO,IAAI;AAEvD,UAAI,QAAQ,GAAG,QAAQ,MAAM,EAAE,EAAE,MAAM,QAAQ;AAE/C,UAAI,UAAU;AACZ,cAAM,iBAAiB;AAEzB,UAAI,MAAM,GAAG,MAAM,KAAK;AACtB,YAAI,CAAC;AACL;AAAA,MACF,WAAW,MAAM,GAAG,MAAM,KAAK;AAC7B;AAAA,MACF;AAEA,UAAI,MAAM,WAAW,MAAM,GAAG;AAC5B,YAAI,OAAO,MAAM,KAAK,GAAG,CAAC;AAAA,MAC5B,WAAW,MAAM,MAAM,CAAC,MAAM,OAAO,MAAM,GAAG,MAAM,KAAK;AAEvD,YAAI,MAAM,GAAG,MAAM,KAAK;AACtB,cAAI,OAAO,MAAM,KAAK,GAAG,CAAC;AAAA,QAC5B;AACA;AAGA,YAAI,MAAM,MAAM,MAAM,UAAU,MAAM,MAAM,CAAC,MAAM,OAAO,MAAM,MAAM,CAAC,MAAM,OAAO,MAAM,MAAM,CAAC,MAAM,OAAO,MAAM,MAAM,CAAC,MAAM,KAAK;AACpI,cAAI,OAAO,MAAM,GAAG,GAAG,CAAC;AACxB,cAAI,SAAS,OAAO,MAAM,GAAG,EAAE,MAAM;AACrC;AAAA,QACF;AAGA,YAAI,MAAM,GAAG,MAAM,OAAO,MAAM,MAAM,CAAC,MAAM,OAAO,MAAM,GAAG,MAAM,OAAO,MAAM,MAAM,CAAC,MAAM,KAAK;AAChG,cAAI,OAAO,MAAM,MAAM,CAAC,GAAG,CAAC;AAC5B,cAAI,SAAS,OAAO,MAAM,MAAM,CAAC,EAAE,MAAM,IAAI;AAC7C,iBAAO;AAAA,QACT;AAAA,MAEF,WAAW,MAAM,MAAM,CAAC,MAAM,OAAO,MAAM,MAAM,CAAC,MAAM,KAAK;AAC3D,YAAI,OAAO,MAAM,GAAG,GAAG,CAAC;AACxB,YAAI,OAAO,MAAM,MAAM,CAAC,GAAG,KAAK;AAChC,eAAO;AAAA,MACT,WAAW,MAAM,MAAM,CAAC,MAAM,OAAO,MAAM,MAAM,CAAC,MAAM,KAAK;AAC3D,YAAI,OAAO,MAAM,GAAG,GAAG,CAAC;AACxB,YAAI,OAAO,MAAM,MAAM,CAAC,GAAG,CAAC;AAC5B,YAAI,OAAO,MAAM,MAAM,CAAC,GAAG,KAAK;AAChC,eAAO;AAAA,MACT;AAEA,UAAI,MAAM,UAAU,KAAK;AACvB,YAAI,IAAI;AACR;AAAA,QACE,IAAI,IAAI,IAAI,IAAI,IAAI;AAAA,MACxB,OAAO;AACL,cAAM,iBAAiB;AAAA,MACzB;AAAA,IAEF,WAAW,OAAO,OAAO,UAAU;AACjC,UAAI;AACJ,UAAI;AACJ,UAAI;AAAA,IACN,OAAO;AACL,YAAM,iBAAiB;AAAA,IACzB;AAEA,QAAI,MAAM,QAAQ;AAChB,YAAM,eAAe;AAAA,IACvB;AAEA,IAAAH,GAAE,GAAG,IAAI,IAAI,SAAS,CAAC,QAAQ;AAC/B,IAAAA,GAAE,GAAG,IAAI,IAAI,SAAS,CAAC,IAAI;AAC3B,IAAAA,GAAE,GAAG,IAAI,IAAI,SAAS,CAAC,IAAI;AAAA,EAC7B;AAEA,WAAS,OAAO,GAAGC,IAAG,GAAG;AAEvB,QAAI,IAAI;AACR,WAAOA,KAAI,QAAQ,IAAK,IAAI,IAAK,GAAGA,OAAM,OAAO;AAE/C,UAAIA,KAAI,OAAO;AACb,YAAK,IAAI,IAAK;AAAA,MAChB;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,WAAS,SAAS,GAAG,GAAG;AAEtB,WAAO,IAAI,UAAU,QACnB,KAAK,OAAO;AAAA,IACd;AAEA,WAAO,IAAI,WAAW,QACpB,KAAK,QAAQ;AAAA,IACf;AAEA,QAAI,MAAM;AACR,aAAO;AAOT,QAAI,MAAM,QAAQ;AAClB,QAAI,IAAI;AAER,WAAO,QAAQ,OAAO,KAAK;AACzB,YAAM,MAAM,QAAQ;AAEpB,UAAI,IAAI;AACN,eAAO;AAAA,IACX;AACA,WAAO,OAAO,CAAC;AAAA,EACjB;AAEA,WAAS,WAAW,GAAG,GAAG,KAAK;AAE7B,QAAI,OAAO;AACX,QAAI,OAAO,OAAO,OAAO,KAAK,CAAC;AAE/B,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAG5B,UAAI,SAAS;AACX,eAAO,OAAO,CAAC;AAEjB,aAAO,OAAO,QAAQ;AACtB,aAAO,OAAO,QAAQ;AAAA,IACxB;AACA,WAAO;AAAA,EACT;AAEA,WAAS,IAAI,GAAG,GAAG;AAEjB,QAAI,CAAC;AACH,aAAO;AACT,QAAI,CAAC;AACH,aAAO;AAET,WAAO,GAAG;AACR,WAAK;AACL,UAAI,CAAC;AACH,eAAO;AACT,WAAK;AACL,UAAI,CAAC;AACH,eAAO;AAAA,IACX;AAAA,EACF;AASA,WAAS,SAAS,GAAG,GAAG;AAEtB,IAAAE,OAAM,GAAG,CAAC;AAEV,QAAI,gBAAgB,UAAU;AAC5B,UAAI,IAAIH,GAAE,GAAG,GAAGA,GAAE,GAAG,CAAC;AACtB,WAAK,GAAG,IAAIA,GAAE,GAAG;AACjB,WAAK,GAAG,IAAIA,GAAE,GAAG,IAAI;AACrB,WAAK,GAAG,IAAIA,GAAE,GAAG,IAAI;AAAA,IACvB,OAAO;AACL,aAAO,YAAYA,GAAE,GAAG,IAAIA,GAAE,GAAG,GAAGA,GAAE,GAAG,CAAC;AAAA,IAC5C;AAAA,EACF;AAEA,MAAM,iBAAiB,WAAY;AAAE,WAAO,IAAI,MAAM,kBAAkB;AAAA,EAAG;AAC3E,MAAM,mBAAmB,WAAY;AAAE,WAAO,IAAI,MAAM,kBAAkB;AAAA,EAAG;AAC7E,MAAM,sBAAsB,WAAY;AAAE,WAAO,IAAI,MAAM,4BAA4B;AAAA,EAAG;AAE1F,WAAS,YAAY;AAAA,IAEnB,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOL,OAAO,WAAY;AAEjB,aAAO,YAAY,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC;AAAA,IACzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,WAAY;AAEjB,aAAO,YAAY,CAAC,KAAK,GAAG,IAAI,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC;AAAA,IACtD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,SAAU,GAAG,GAAG;AAErB,MAAAG,OAAM,GAAG,CAAC;AACV,aAAO;AAAA,QACL,KAAK,GAAG,IAAI,KAAK,GAAG,IAAIH,GAAE,GAAG,IAAIA,GAAE,GAAG,IAAI,KAAK,GAAG,IAAIA,GAAE,GAAG;AAAA,QAC3D,KAAK,GAAG,IAAIA,GAAE,GAAG;AAAA,MACnB;AAAA,IACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,SAAU,GAAG,GAAG;AAErB,MAAAG,OAAM,GAAG,CAAC;AACV,aAAO;AAAA,QACL,KAAK,GAAG,IAAI,KAAK,GAAG,IAAIH,GAAE,GAAG,IAAIA,GAAE,GAAG,IAAI,KAAK,GAAG,IAAIA,GAAE,GAAG;AAAA,QAC3D,KAAK,GAAG,IAAIA,GAAE,GAAG;AAAA,MACnB;AAAA,IACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,SAAU,GAAG,GAAG;AAErB,MAAAG,OAAM,GAAG,CAAC;AACV,aAAO;AAAA,QACL,KAAK,GAAG,IAAIH,GAAE,GAAG,IAAI,KAAK,GAAG,IAAIA,GAAE,GAAG;AAAA,QACtC,KAAK,GAAG,IAAIA,GAAE,GAAG;AAAA,MACnB;AAAA,IACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,SAAU,GAAG,GAAG;AAErB,MAAAG,OAAM,GAAG,CAAC;AACV,aAAO;AAAA,QACL,KAAK,GAAG,IAAIH,GAAE,GAAG,IAAI,KAAK,GAAG,IAAIA,GAAE,GAAG;AAAA,QACtC,KAAK,GAAG,IAAIA,GAAE,GAAG;AAAA,MACnB;AAAA,IACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,SAAS,WAAY;AACnB,aAAO,YAAY,KAAK,GAAG,IAAI,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC;AAAA,IACrD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQA,OAAO,SAAU,GAAG,GAAG;AAErB,UAAI,MAAM,QAAW;AACnB,eAAO,YAAY,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,KAAK,GAAG,GAAG,KAAK;AAAA,MAC7D;AAEA,MAAAG,OAAM,GAAG,CAAC;AACV,UAAI,WAAWH,GAAE,GAAG,IAAI,KAAK,GAAG,GAAG;AACjC,cAAM,eAAe;AAAA,MACvB;AAaA,aAAO;AAAA,QACL,KAAK,GAAG,KAAKA,GAAE,GAAG,IAAI,KAAK,GAAG,MAAMA,GAAE,GAAG,IAAI,KAAK,GAAG;AAAA,QACrDA,GAAE,GAAG,IAAI,KAAK,GAAG;AAAA,MAAC;AAAA,IACtB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,SAAU,GAAG,GAAG;AAErB,MAAAG,OAAM,GAAG,CAAC;AAKV,aAAO,YAAY,IAAIH,GAAE,GAAG,GAAG,KAAK,GAAG,CAAC,IAAI,IAAIA,GAAE,GAAG,GAAG,KAAK,GAAG,CAAC,GAAGA,GAAE,GAAG,IAAI,KAAK,GAAG,CAAC;AAAA,IACxF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,SAAU,GAAG,GAAG;AAErB,MAAAG,OAAM,GAAG,CAAC;AAKV,UAAIH,GAAE,GAAG,MAAM,UAAU,KAAK,GAAG,MAAM,QAAQ;AAC7C,eAAO,YAAY,QAAQ,KAAK;AAAA,MAClC;AACA,aAAO,YAAYA,GAAE,GAAG,IAAI,KAAK,GAAG,GAAG,IAAIA,GAAE,GAAG,GAAG,KAAK,GAAG,CAAC,IAAI,IAAIA,GAAE,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC;AAAA,IACxF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,WAAW,WAAY;AACrB,aAAO,YAAY,KAAK,GAAG,IAAI,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC;AAAA,IACrD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,SAAU,GAAG,GAAG;AAErB,MAAAG,OAAM,GAAG,CAAC;AAIV,UAAIH,GAAE,GAAG,MAAM,OAAO;AAEpB,YAAIA,GAAE,GAAG,IAAI,QAAQ;AACnB,iBAAO,aAAa,KAAK,GAAG,IAAI,KAAK,GAAG,MAAMA,GAAE,GAAG,GAAG,KAAK,GAAG,KAAKA,GAAE,GAAG,CAAC;AAAA,QAC3E,OAAO;AACL,iBAAO,aAAa,KAAK,GAAG,IAAI,KAAK,GAAG,MAAMA,GAAE,GAAG,GAAG,KAAK,GAAG,KAAKA,GAAE,GAAG,CAAC;AAAA,QAC3E;AAAA,MACF;AAQA,UAAI,KAAK,GAAG,IAAI,OAAQ,QAAO;AAG/B,UAAI,IAAI,UAAU,KAAK,GAAG,CAAC;AAC3B,UAAI,IAAI,UAAU,KAAK,GAAG,CAAC;AAG3B,UAAI,IAAI;AACR,UAAI,IAAI;AACR,eAAS,KAAK,GAAG;AACf,YAAI,MAAM,IAAK;AACf,YAAI,MAAM,KAAK;AACb,cAAI;AACJ;AAAA,QACF;AACA,UAAE,CAAC,KAAKA,GAAE,GAAG;AAEb,YAAI,EAAE,CAAC,IAAIA,GAAE,GAAG,MAAM,QAAQ;AAC5B,YAAE,CAAC,KAAKA,GAAE,GAAG;AAAA,QACf,MAAO,QAAO;AACd,aAAK,OAAO,CAAC,KAAK,EAAE,CAAC;AAAA,MACvB;AAEA,eAAS,KAAK,GAAG;AACf,YAAI,MAAM,IAAK;AACf,UAAE,CAAC,KAAKA,GAAE,GAAG;AAEb,YAAI,EAAE,CAAC,IAAIA,GAAE,GAAG,MAAM,QAAQ;AAC5B,YAAE,CAAC,KAAKA,GAAE,GAAG;AAAA,QACf,MAAO,QAAO;AACd,aAAK,OAAO,CAAC,KAAK,EAAE,CAAC;AAAA,MACvB;AAEA,UAAIA,GAAE,GAAG,IAAI,QAAQ;AACnB,eAAO,YAAY,GAAG,CAAC;AAAA,MACzB;AACA,aAAO,YAAY,GAAG,CAAC;AAAA,IACzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,SAAU,GAAG,GAAG;AAErB,MAAAG,OAAM,GAAG,CAAC;AAEV,UAAI,KAAK,GAAG,KAAK,UAAUH,GAAE,GAAG,KAAK,OAAQ,QAAO;AAEpD,YAAM,YAAY,uBAAO,OAAO,IAAI;AAEpC,YAAM,cAAc,UAAUA,GAAE,GAAG,CAAC;AACpC,YAAM,KAAK,UAAUA,GAAE,GAAG,CAAC;AAE3B,YAAM,gBAAgB,UAAU,KAAK,GAAG,CAAC;AACzC,YAAM,KAAK,UAAU,KAAK,GAAG,CAAC;AAE9B,iBAAW,SAAS,IAAI;AACtB,oBAAY,KAAK,KAAK,YAAY,KAAK,KAAK,UAAU,GAAG,KAAK;AAAA,MAChE;AACA,iBAAW,SAAS,IAAI;AACtB,sBAAc,KAAK,KAAK,cAAc,KAAK,KAAK,UAAU,GAAG,KAAK;AAAA,MACpE;AAEA,iBAAW,SAAS,aAAa;AAC/B,YAAI,UAAU,IAAK;AACnB,kBAAU,KAAK,IAAI;AAAA,MACrB;AACA,iBAAW,SAAS,eAAe;AACjC,YAAI,UAAU,IAAK;AACnB,kBAAU,KAAK,IAAI;AAAA,MACrB;AAEA,UAAI,OAAO;AACX,UAAI,OAAO;AAGX,iBAAW,SAAS,WAAW;AAE7B,cAAM,eAAe,YAAY,KAAK,KAAK;AAC3C,cAAM,iBAAiB,cAAc,KAAK,KAAK;AAE/C,YAAI,iBAAiB,QAAQ;AAC3B,cAAI,mBAAmB,QAAQ;AAC7B,mBAAO;AAAA,UACT;AACA;AAAA,QACF;AAGA,YAAI,OAAO;AACX,YAAI,OAAO;AAGX,cAAM,WAAW,IAAI,MAAM,IAAI;AAC/B,gBAAQ;AACR,gBAAQ;AAGR,YAAI,SAAS,QAAQ,SAAS,MAAM;AAClC,iBAAO;AACP,iBAAO;AAAA,QACT,WAAW,OAAO,SAAS,OAAO,MAAM;AACtC,iBAAO;AAAA,QACT;AAAA,MACF;AAEA,aAAO,SAAS,QAAQ,SAAS,OAC7B,YAAY,MAAM,IAAI,IACtB;AAAA,IACN;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,UAAU,SAAU,GAAG,GAAG;AAExB,MAAAG,OAAM,GAAG,CAAC;AACV,aAAO,KAAK,GAAG,IAAI,KAAK,GAAG,IAAIH,GAAE,GAAG,MAAMA,GAAE,GAAG,IAAIA,GAAE,GAAG,IAAI,KAAK,GAAG;AAAA,IACtE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,MAAM,SAAU,GAAG,GAAG;AAEpB,MAAAG,OAAM,GAAG,CAAC;AACV,aAAO,KAAK,GAAG,IAAI,KAAK,GAAG,IAAIH,GAAE,GAAG,IAAIA,GAAE,GAAG,IAAIA,GAAE,GAAG,IAAI,KAAK,GAAG;AAAA,IACpE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,SAAU,GAAG,GAAG;AAErB,MAAAG,OAAM,GAAG,CAAC;AACV,aAAO,KAAK,GAAG,IAAI,KAAK,GAAG,IAAIH,GAAE,GAAG,KAAKA,GAAE,GAAG,IAAIA,GAAE,GAAG,IAAI,KAAK,GAAG;AAAA,IACrE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,MAAM,SAAU,GAAG,GAAG;AAEpB,MAAAG,OAAM,GAAG,CAAC;AACV,aAAO,KAAK,GAAG,IAAI,KAAK,GAAG,IAAIH,GAAE,GAAG,IAAIA,GAAE,GAAG,IAAIA,GAAE,GAAG,IAAI,KAAK,GAAG;AAAA,IACpE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,OAAO,SAAU,GAAG,GAAG;AAErB,MAAAG,OAAM,GAAG,CAAC;AACV,aAAO,KAAK,GAAG,IAAI,KAAK,GAAG,IAAIH,GAAE,GAAG,KAAKA,GAAE,GAAG,IAAIA,GAAE,GAAG,IAAI,KAAK,GAAG;AAAA,IACrE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAUA,WAAW,SAAU,GAAG,GAAG;AAEzB,MAAAG,OAAM,GAAG,CAAC;AACV,UAAI,IAAI,KAAK,GAAG,IAAI,KAAK,GAAG,IAAIH,GAAE,GAAG,IAAIA,GAAE,GAAG,IAAIA,GAAE,GAAG,IAAI,KAAK,GAAG;AAEnE,cAAQ,SAAS,MAAM,IAAI;AAAA,IAC7B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,QAAQ,SAAU,QAAQ;AAExB,eAAS,SAAS,OAAO,UAAU,CAAC;AAEpC,aAAO;AAAA,QAAY,OAAO,KAAK,GAAG,IAAI,SAAS,KAAK,GAAG,IAAI,KAAK,GAAG,CAAC,KACjE,SAAS,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,UAAU,KAAK,GAAG,KAAK,SAAS,QAAQ;AAAA,QAC1E;AAAA,MAAM;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,SAAS,SAAU,QAAQ;AAEzB,eAAS,SAAS,OAAO,UAAU,CAAC;AAEpC,aAAO;AAAA,QAAY,OAAO,KAAK,GAAG,IAAI,SAAS,KAAK,GAAG,IAAI,KAAK,GAAG,CAAC,KACjE,SAAS,KAAK,GAAG,IAAI,KAAK,GAAG,IAAI,UAAU,KAAK,GAAG,IAAI,SAAS,QAAQ;AAAA,QACzE;AAAA,MAAM;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,SAAS,SAAU,QAAQ;AAEzB,eAAS,SAAS,OAAO,UAAU,CAAC;AAiBpC,aAAO;AAAA,QAAY,OAAO,KAAK,GAAG,IAAI,SAAS,KAAK,GAAG,IAAI,KAAK,GAAG,CAAC,IAClE,KAAK,GAAG,MAAM,KAAK,GAAG,KAAK,SAAS,QAAQ,UAAU,SAAS,SAAS,KAAK,GAAG,IAAI,KAAK,GAAG,KAAK,KAAK,GAAG,IAAI,QAAQ;AAAA,QACrH;AAAA,MAAM;AAAA,IACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,WAAW,SAAU,GAAG,GAAG;AASzB,MAAAG,OAAM,GAAG,CAAC;AAEV,YAAM,IAAI,KAAK,GAAG,IAAIH,GAAE,GAAG;AAC3B,YAAM,IAAI,KAAK,GAAG,IAAIA,GAAE,GAAG;AAC3B,YAAM,IAAI,IAAI;AAGd,UAAI,IAAI,OAAO,IAAI,CAAC;AACpB,UAAI,IAAI,KAAK,GAAG;AACd;AAAA,MACF;AACA,aAAO,YAAY,KAAK,GAAG,IAAI,IAAIA,GAAE,GAAG,GAAGA,GAAE,GAAG,CAAC;AAAA,IACnD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,aAAa,SAAU,GAAG,GAAG;AAE3B,MAAAG,OAAM,GAAG,CAAC;AACV,UAAIH,GAAE,GAAG,MAAM,OAAQ,QAAO;AAC9B,aAAQ,KAAK,GAAG,IAAIA,GAAE,GAAG,KAAMA,GAAE,GAAG,IAAI,KAAK,GAAG,OAAO;AAAA,IACzD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,WAAW,WAAY;AAErB,aAAO,OAAO,KAAK,GAAG,IAAI,KAAK,GAAG,CAAC,IAAI,OAAO,KAAK,GAAG,CAAC;AAAA,IAEzD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,YAAY,SAAU,MAAM,IAAI;AAE9B,UAAI,IAAI,KAAK,GAAG;AAChB,UAAI,IAAI,KAAK,GAAG;AAEhB,UAAI,SAAS,SAAS,GAAG,CAAC;AAC1B,UAAI,SAAS,WAAW,GAAG,GAAG,MAAM;AAEpC,UAAI,MAAM,KAAK,GAAG,IAAI,SAAS,MAAM;AAGrC,aAAO,OAAO,IAAI,CAAC;AAEnB,WAAK;AACL,WAAK;AAEL,UAAI;AACF,eAAO;AAET,UAAI,QAAQ;AAEV,iBAASI,KAAI,QAAQA,QAAM;AACzB,iBAAO,OAAO,IAAI,CAAC;AACnB,eAAK;AACL,eAAK;AAAA,QACP;AACA,eAAO;AACP,iBAASA,KAAI,QAAQA,QAAM;AACzB,iBAAO,OAAO,IAAI,CAAC;AACnB,eAAK;AACL,eAAK;AAAA,QACP;AACA,eAAO;AAAA,MACT,OAAO;AACL,iBAASA,KAAI,KAAK,KAAKA,QAAM;AAC3B,iBAAO,OAAO,IAAI,CAAC;AACnB,eAAK;AACL,eAAK;AAAA,QACP;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,cAAc,SAAU,YAAY,OAAO;AAEzC,UAAI,IAAI,KAAK,GAAG;AAChB,UAAI,IAAI,KAAK,GAAG;AAChB,UAAI,MAAM,KAAK,GAAG,IAAI,SAAS,MAAM;AAErC,UAAI,MAAM,OAAO;AACf,eAAO;AAAA,MACT,OAAO;AACL,cAAM,QAAQ,OAAO,IAAI,CAAC;AAC1B,YAAI,aAAa,QAAQ,QAAQ;AAC/B,iBAAO;AACP,iBAAO;AACP,eAAK;AAAA,QACP;AAEA,eAAO;AACP,eAAO;AACP,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,WAAW,SAAU,YAAY,OAAO;AAEtC,UAAI,IAAI,KAAK,GAAG;AAChB,UAAI,IAAI,KAAK,GAAG;AAChB,UAAI,MAAM,KAAK,GAAG,IAAI,SAAS,MAAM;AAErC,UAAI,MAAM,OAAO;AACf,eAAO;AAAA,MACT,OAAO;AACL,cAAM,QAAQ,OAAO,IAAI,CAAC;AAC1B,YAAI,aAAa,QAAQ,QAAQ;AAC/B,iBAAO;AACP,eAAK;AAAA,QACP;AAEA,eAAO;AACP,eAAO;AACP,eAAO;AACP,eAAO;AACP,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,eAAe,WAAY;AAEzB,UAAI,IAAI,KAAK,GAAG;AAChB,UAAI,IAAI,KAAK,GAAG;AAChB,YAAM,MAAM,CAAC;AAEb,aAAO,GAAG;AACR,YAAI,KAAK,OAAO,IAAI,CAAC,CAAC;AACtB,cAAM,IAAI,IAAI;AACd,YAAI;AACJ,YAAI;AAAA,MACN;AACA,aAAO;AAAA,IACT;AAAA,IAEA,YAAY,SAAU,MAAM,MAAM;AAMhC,YAAM,OAAO,OAAO,KAAK,KAAK,IAAI,GAAG,CAAC;AAEtC,YAAM,UAAU,KAAK,KAAK,EAAE;AAC5B,YAAM,OAAO,QAAQ,aAAa,EAAE;AAEpC,eAASA,KAAI,GAAGA,KAAI,KAAK,QAAQA,MAAK;AAEpC,YAAI,IAAI,YAAY,KAAKA,KAAI,CAAC,GAAG,KAAK;AACtC,iBAAS,IAAIA,KAAI,GAAG,KAAK,GAAG,KAAK;AAC/B,cAAI,EAAE,SAAS,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;AAAA,QACnC;AAEA,YAAI,IAAI,EAAE,KAAK,EAAE,OAAO;AACxB,YAAI,EAAE,GAAG,IAAI,OAAO,EAAE,GAAG,GAAG;AAC1B,iBAAO,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC;AAAA,QAC3B;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,EACF;;;AC7gCA,MAAIC,QAAO;AACX,MAAIC,gBAAe,CAAC;AACb,MAAI,sBAAqC,wBAAQD,OAAMC,eAAc,MAAM;AAIhF,WAAO,eAAe,UAAU,QAAQ;AAAA,MACtC,OAAO;AAAA,IACT,CAAC;AACD,aAAS,UAAU,cAAc;AACjC,aAAS,UAAU,OAAO;AAC1B,aAAS,UAAU,aAAa;AAOhC,aAAS,UAAU,SAAS,WAAY;AACtC,aAAO;AAAA,QACL,QAAQ;AAAA,QACR,GAAG,OAAO,KAAK,IAAI,KAAK,CAAC;AAAA,QACzB,GAAG,OAAO,KAAK,CAAC;AAAA,MAClB;AAAA,IACF;AAQA,aAAS,WAAW,SAAU,MAAM;AAClC,aAAO,IAAI,SAAS,IAAI;AAAA,IAC1B;AACA,WAAO;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,EACX,CAAC;;;ACrCD,MAAIC,QAAO;AACX,MAAIC,gBAAe,CAAC;AACb,MAAI,mBAAkC,wBAAQD,OAAMC,eAAc,MAAM;AAuC7E,aAASC,OAAMC,QAAO,KAAK,MAAM;AAC/B,UAAI,EAAE,gBAAgBD,SAAQ;AAC5B,cAAM,IAAI,YAAY,kDAAkD;AAAA,MAC1E;AACA,UAAI,WAAWC,WAAU,QAAQA,WAAU;AAC3C,UAAI,SAAS,QAAQ,QAAQ,QAAQ;AACrC,UAAI,UAAU,SAAS,QAAQ,SAAS;AACxC,UAAI,UAAU;AACZ,YAAI,YAAYA,MAAK,GAAG;AACtB,UAAAA,SAAQA,OAAM,SAAS;AAAA,QACzB,WAAW,OAAOA,WAAU,YAAY,CAAC,SAASA,MAAK,GAAG;AACxD,gBAAM,IAAI,UAAU,4CAA4C;AAAA,QAClE;AAAA,MACF;AACA,UAAI,QAAQ;AACV,YAAI,YAAY,GAAG,GAAG;AACpB,gBAAM,IAAI,SAAS;AAAA,QACrB,WAAW,OAAO,QAAQ,YAAY,CAAC,SAAS,GAAG,GAAG;AACpD,gBAAM,IAAI,UAAU,0CAA0C;AAAA,QAChE;AAAA,MACF;AACA,UAAI,SAAS;AACX,YAAI,YAAY,IAAI,GAAG;AACrB,iBAAO,KAAK,SAAS;AAAA,QACvB,WAAW,OAAO,SAAS,YAAY,CAAC,SAAS,IAAI,GAAG;AACtD,gBAAM,IAAI,UAAU,2CAA2C;AAAA,QACjE;AAAA,MACF;AACA,WAAK,QAAQ,WAAW,WAAWA,MAAK,IAAI;AAC5C,WAAK,MAAM,SAAS,WAAW,GAAG,IAAI;AACtC,WAAK,OAAO,UAAU,WAAW,IAAI,IAAI;AACzC,UAAI,WAAW,YAAY,KAAK,MAAM,CAAC,GAAG;AACxC,cAAM,IAAI,MAAM,uBAAuB;AAAA,MACzC;AAAA,IACF;AAKA,IAAAD,OAAM,UAAU,OAAO;AACvB,IAAAA,OAAM,UAAU,UAAU;AAW1B,IAAAA,OAAM,QAAQ,SAAU,KAAK;AAC3B,UAAI,OAAO,QAAQ,UAAU;AAC3B,eAAO;AAAA,MACT;AACA,UAAI,OAAO,IAAI,MAAM,GAAG;AACxB,UAAI,OAAO,KAAK,IAAI,SAAUE,MAAK;AACjC,eAAO,WAAWA,IAAG;AAAA,MACvB,CAAC;AACD,UAAI,UAAU,KAAK,KAAK,SAAU,KAAK;AACrC,eAAO,MAAM,GAAG;AAAA,MAClB,CAAC;AACD,UAAI,SAAS;AACX,eAAO;AAAA,MACT;AACA,cAAQ,KAAK,QAAQ;AAAA,QACnB,KAAK;AACH,iBAAO,IAAIF,OAAM,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,QACnC,KAAK;AACH,iBAAO,IAAIA,OAAM,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,QAC5C;AACE,iBAAO;AAAA,MACX;AAAA,IACF;AAMA,IAAAA,OAAM,UAAU,QAAQ,WAAY;AAClC,aAAO,IAAIA,OAAM,KAAK,OAAO,KAAK,KAAK,KAAK,IAAI;AAAA,IAClD;AAQA,IAAAA,OAAM,UAAU,OAAO,WAAY;AACjC,UAAI,MAAM;AACV,UAAIC,SAAQ,KAAK;AACjB,UAAI,OAAO,KAAK;AAChB,UAAI,MAAM,KAAK;AACf,UAAIE,QAAO,MAAMF;AACjB,UAAI,KAAK,IAAI,MAAM,KAAKE,KAAI,GAAG;AAC7B,cAAM,KAAK,KAAKA,QAAO,IAAI;AAAA,MAC7B,WAAWA,UAAS,GAAG;AACrB,cAAM;AAAA,MACR;AACA,UAAI,MAAM,GAAG,GAAG;AACd,cAAM;AAAA,MACR;AACA,aAAO,CAAC,GAAG;AAAA,IACb;AAOA,IAAAH,OAAM,UAAU,MAAM,WAAY;AAChC,UAAII,QAAO,KAAK,KAAK,EAAE,CAAC;AACxB,UAAIA,QAAO,GAAG;AACZ,YAAI,KAAK,OAAO,GAAG;AAEjB,iBAAO,KAAK;AAAA,QACd,OAAO;AAEL,iBAAO,KAAK,SAASA,QAAO,KAAK,KAAK;AAAA,QACxC;AAAA,MACF,OAAO;AACL,eAAO;AAAA,MACT;AAAA,IACF;AAOA,IAAAJ,OAAM,UAAU,MAAM,WAAY;AAChC,UAAII,QAAO,KAAK,KAAK,EAAE,CAAC;AACxB,UAAIA,QAAO,GAAG;AACZ,YAAI,KAAK,OAAO,GAAG;AAEjB,iBAAO,KAAK,SAASA,QAAO,KAAK,KAAK;AAAA,QACxC,OAAO;AAEL,iBAAO,KAAK;AAAA,QACd;AAAA,MACF,OAAO;AACL,eAAO;AAAA,MACT;AAAA,IACF;AASA,IAAAJ,OAAM,UAAU,UAAU,SAAU,UAAU;AAC5C,UAAI,IAAI,KAAK;AACb,UAAI,OAAO,KAAK;AAChB,UAAI,MAAM,KAAK;AACf,UAAIK,KAAI;AACR,UAAI,OAAO,GAAG;AACZ,eAAO,IAAI,KAAK;AACd,mBAAS,GAAG,CAACA,EAAC,GAAG,IAAI;AACrB,eAAK;AACL,UAAAA;AAAA,QACF;AAAA,MACF,WAAW,OAAO,GAAG;AACnB,eAAO,IAAI,KAAK;AACd,mBAAS,GAAG,CAACA,EAAC,GAAG,IAAI;AACrB,eAAK;AACL,UAAAA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAWA,IAAAL,OAAM,UAAU,MAAM,SAAU,UAAU;AACxC,UAAI,QAAQ,CAAC;AACb,WAAK,QAAQ,SAAU,OAAOM,QAAO,KAAK;AACxC,cAAMA,OAAM,CAAC,CAAC,IAAI,SAAS,OAAOA,QAAO,GAAG;AAAA,MAC9C,CAAC;AACD,aAAO;AAAA,IACT;AAOA,IAAAN,OAAM,UAAU,UAAU,WAAY;AACpC,UAAI,QAAQ,CAAC;AACb,WAAK,QAAQ,SAAU,OAAOM,QAAO;AACnC,cAAMA,OAAM,CAAC,CAAC,IAAI;AAAA,MACpB,CAAC;AACD,aAAO;AAAA,IACT;AAOA,IAAAN,OAAM,UAAU,UAAU,WAAY;AAEpC,aAAO,KAAK,QAAQ;AAAA,IACtB;AAYA,IAAAA,OAAM,UAAU,SAAS,SAAU,SAAS;AAC1C,UAAI,MAAM,OAAO,KAAK,OAAO,OAAO;AACpC,UAAI,KAAK,SAAS,GAAG;AACnB,eAAO,MAAM,OAAO,KAAK,MAAM,OAAO;AAAA,MACxC;AACA,aAAO,MAAM,OAAO,KAAK,KAAK,OAAO;AACrC,aAAO;AAAA,IACT;AAOA,IAAAA,OAAM,UAAU,WAAW,WAAY;AACrC,aAAO,KAAK,OAAO;AAAA,IACrB;AAQA,IAAAA,OAAM,UAAU,SAAS,WAAY;AACnC,aAAO;AAAA,QACL,QAAQ;AAAA,QACR,OAAO,KAAK;AAAA,QACZ,KAAK,KAAK;AAAA,QACV,MAAM,KAAK;AAAA,MACb;AAAA,IACF;AASA,IAAAA,OAAM,WAAW,SAAU,MAAM;AAC/B,aAAO,IAAIA,OAAM,KAAK,OAAO,KAAK,KAAK,KAAK,IAAI;AAAA,IAClD;AACA,WAAOA;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,EACX,CAAC;;;ACxTD,MAAIO,QAAO;AACX,MAAIC,gBAAe,CAAC;AACb,MAAI,oBAAmC,wBAAQD,OAAMC,eAAc,MAAM;AAuB9E,aAASC,UAAS;AAChB,UAAI,EAAE,gBAAgBA,UAAS;AAC7B,cAAM,IAAI,YAAY,kDAAkD;AAAA,MAC1E;AAAA,IACF;AAKA,IAAAA,QAAO,UAAU,OAAO;AACxB,IAAAA,QAAO,UAAU,WAAW;AAU5B,IAAAA,QAAO,UAAU,UAAU,WAAY;AAErC,YAAM,IAAI,MAAM,6CAA6C;AAAA,IAC/D;AAUA,IAAAA,QAAO,UAAU,WAAW,WAAY;AAEtC,YAAM,IAAI,MAAM,8CAA8C;AAAA,IAChE;AAOA,IAAAA,QAAO,UAAU,SAAS,SAAU,MAAM,UAAU;AAClD,YAAM,IAAI,MAAM,4CAA4C;AAAA,IAC9D;AAeA,IAAAA,QAAO,UAAU,SAAS,SAAUC,QAAO,aAAa,cAAc;AAEpE,YAAM,IAAI,MAAM,4CAA4C;AAAA,IAC9D;AAOA,IAAAD,QAAO,UAAU,MAAM,SAAUC,QAAO;AAEtC,YAAM,IAAI,MAAM,yCAAyC;AAAA,IAC3D;AAWA,IAAAD,QAAO,UAAU,MAAM,SAAUC,QAAO,OAAO,cAAc;AAE3D,YAAM,IAAI,MAAM,yCAAyC;AAAA,IAC3D;AAcA,IAAAD,QAAO,UAAU,SAAS,SAAUE,OAAM,cAAc;AAEtD,YAAM,IAAI,MAAM,4CAA4C;AAAA,IAC9D;AAWA,IAAAF,QAAO,UAAU,UAAU,SAAUE,OAAM,cAAc;AAEvD,YAAM,IAAI,MAAM,6CAA6C;AAAA,IAC/D;AAMA,IAAAF,QAAO,UAAU,QAAQ,WAAY;AAEnC,YAAM,IAAI,MAAM,2CAA2C;AAAA,IAC7D;AAMA,IAAAA,QAAO,UAAU,OAAO,WAAY;AAElC,YAAM,IAAI,MAAM,0CAA0C;AAAA,IAC5D;AAYA,IAAAA,QAAO,UAAU,MAAM,SAAU,UAAU,WAAW;AAEpD,YAAM,IAAI,MAAM,yCAAyC;AAAA,IAC3D;AAQA,IAAAA,QAAO,UAAU,UAAU,SAAU,UAAU;AAE7C,YAAM,IAAI,MAAM,6CAA6C;AAAA,IAC/D;AAMA,IAAAA,QAAO,UAAU,OAAO,QAAQ,IAAI,WAAY;AAE9C,YAAM,IAAI,MAAM,mCAAmC;AAAA,IACrD;AAMA,IAAAA,QAAO,UAAU,UAAU,WAAY;AAErC,YAAM,IAAI,MAAM,6CAA6C;AAAA,IAC/D;AAMA,IAAAA,QAAO,UAAU,UAAU,WAAY;AAErC,YAAM,IAAI,MAAM,6CAA6C;AAAA,IAC/D;AAUA,IAAAA,QAAO,UAAU,SAAS,SAAU,SAAS;AAE3C,YAAM,IAAI,MAAM,4CAA4C;AAAA,IAC9D;AAMA,IAAAA,QAAO,UAAU,WAAW,WAAY;AAEtC,YAAM,IAAI,MAAM,8CAA8C;AAAA,IAChE;AACA,WAAOA;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,EACX,CAAC;;;ACvOD,WAAS,sBAAsB,GAAG,MAAMG,OAAM;AAC5C,QAAI,gBAAgB,EAAE;AACtB,QAAI,OAAO,IAAI,cAAc,CAAC;AAC9B,QAAI,SAAS;AACb,QAAIA,OAAM;AACR,UAAIA,QAAO,GAAG;AACZ,cAAM,IAAI,MAAM,gCAAgC;AAAA,MAClD;AACA,UAAI,CAAC,UAAUA,KAAI,GAAG;AACpB,cAAM,IAAI,MAAM,yBAAyB;AAAA,MAC3C;AACA,UAAI,EAAE,YAAY,KAAK,IAAIA,QAAO,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,EAAE,SAAS,KAAK,IAAIA,QAAO,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG;AACtF,cAAM,IAAI,MAAM,8BAA8B,OAAOA,QAAO,GAAG,MAAM,EAAE,OAAOA,QAAO,GAAG,KAAK,CAAC;AAAA,MAChG;AACA,UAAI,CAAC,EAAE,UAAU,GAAG;AAClB,cAAM,IAAI,MAAM,0BAA0B;AAAA,MAC5C;AACA,UAAI,EAAE,SAAS,CAAC,GAAG;AACjB,YAAI,EAAE,IAAI,KAAK,IAAIA,KAAI,CAAC;AAAA,MAC1B;AACA,eAAS,IAAI,OAAOA,KAAI;AAAA,IAC1B;AACA,YAAQ,MAAM;AAAA,MACZ,KAAK;AACH,eAAO,GAAG,OAAO,EAAE,SAAS,CAAC,EAAE,OAAO,MAAM;AAAA,MAC9C,KAAK;AACH,eAAO,GAAG,OAAO,EAAE,QAAQ,CAAC,EAAE,OAAO,MAAM;AAAA,MAC7C,KAAK;AACH,eAAO,GAAG,OAAO,EAAE,cAAc,CAAC,EAAE,OAAO,MAAM;AAAA,MACnD;AACE,cAAM,IAAI,MAAM,QAAQ,OAAO,MAAM,iBAAiB,CAAC;AAAA,IAC3D;AAAA,EACF;AAmFO,WAASC,QAAO,OAAO,SAAS;AACrC,QAAI,OAAO,YAAY,YAAY;AAEjC,aAAO,QAAQ,KAAK;AAAA,IACtB;AAGA,QAAI,CAAC,MAAM,SAAS,GAAG;AACrB,aAAO,MAAM,MAAM,IAAI,QAAQ,MAAM,GAAG,CAAC,IAAI,aAAa;AAAA,IAC5D;AACA,QAAI;AAAA,MACF;AAAA,MACA;AAAA,MACA;AAAA,IACF,IAAI,uBAAuB,OAAO;AAGlC,YAAQ,UAAU;AAAA,MAChB,KAAK;AACH,eAAOC,SAAQ,OAAO,SAAS;AAAA,MACjC,KAAK;AACH,eAAOC,eAAc,OAAO,SAAS;AAAA,MACvC,KAAK;AACH,eAAOC,eAAc,OAAO,SAAS;AAAA,MACvC,KAAK;AACH,eAAO,sBAAsB,OAAO,GAAG,QAAQ;AAAA,MACjD,KAAK;AACH,eAAO,sBAAsB,OAAO,GAAG,QAAQ;AAAA,MACjD,KAAK;AACH,eAAO,sBAAsB,OAAO,IAAI,QAAQ;AAAA,MAClD,KAAK,QACH;AAGE,YAAI,WAAWC,oBAAmB,YAAY,QAAQ,YAAY,SAAS,SAAS,QAAQ,UAAU,EAAE;AACxG,YAAI,WAAWA,oBAAmB,YAAY,QAAQ,YAAY,SAAS,SAAS,QAAQ,UAAU,CAAC;AAGvG,YAAI,MAAM,OAAO,EAAG,QAAO;AAG3B,YAAI;AACJ,YAAI,UAAU,MAAM,oBAAoB,SAAS;AACjD,YAAIC,OAAM,QAAQ;AAClB,YAAIA,QAAO,YAAYA,OAAM,UAAU;AAErC,gBAAM,QAAQ,QAAQ;AAAA,QACxB,OAAO;AAEL,gBAAMH,eAAc,OAAO,SAAS;AAAA,QACtC;AAGA,eAAO,IAAI,QAAQ,uBAAuB,WAAY;AACpD,cAAII,UAAS,UAAU,CAAC;AACxB,cAAIC,KAAI,UAAU,CAAC;AACnB,iBAAOD,YAAW,MAAMA,UAASC,KAAIA;AAAA,QACvC,CAAC;AAAA,MACH;AAAA,MACF;AACE,cAAM,IAAI,MAAM,uBAAuB,WAAW,kEAAuE;AAAA,IAC7H;AAAA,EACF;AAOO,WAASJ,eAAc,OAAO,WAAW;AAE9C,QAAII,KAAI,MAAM;AACd,QAAI,SAASA,KAAI,MAAM,IAAIA,KAAIA,KAAI,IAAIA,KAAI,IAAIA,KAAI,IAAIA,KAAIA,KAAI;AAG/D,QAAI,kBAAkB,MAAM,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC;AACrD,QAAI,WAAW,gBAAgB,YAAY,SAAS;AACpD,QAAI,SAAS,SAAS,GAAG,GAAG;AAC1B,UAAIC,aAAY,MAAM;AACtB,iBAAW,IAAIA,WAAU,QAAQ,EAAE,QAAQ;AAAA,IAC7C;AACA,WAAO,WAAW,OAAOD,MAAK,IAAI,MAAM,MAAM,OAAO,SAAS;AAAA,EAChE;AAUO,WAASL,eAAc,OAAO,WAAW;AAC9C,QAAI,cAAc,QAAW;AAC3B,aAAO,MAAM,cAAc,YAAY,CAAC;AAAA,IAC1C,OAAO;AACL,aAAO,MAAM,cAAc;AAAA,IAC7B;AAAA,EACF;AAQO,WAASD,SAAQ,OAAO,WAAW;AACxC,WAAO,MAAM,QAAQ,SAAS;AAAA,EAChC;AACA,WAASG,oBAAmB,OAAO,cAAc;AAC/C,QAAI,SAAS,KAAK,GAAG;AACnB,aAAO;AAAA,IACT,WAAW,YAAY,KAAK,GAAG;AAC7B,aAAO,MAAM,SAAS;AAAA,IACxB,OAAO;AACL,aAAO;AAAA,IACT;AAAA,EACF;;;ACzOO,WAAS,SAAS,MAAM,QAAQ;AACrC,QAAIK,SAAQ,KAAK,SAAS,OAAO;AACjC,QAAI,MAAM,KAAK;AACf,WAAO,KAAK,UAAUA,QAAO,GAAG,MAAM;AAAA,EACxC;AAwCO,WAASC,QAAO,OAAO,SAAS;AACrC,QAAI,SAAS,QAAQ,OAAO,OAAO;AACnC,QAAI,WAAW,OAAO,YAAY,YAAY,cAAc,WAAW,OAAO,SAAS,QAAQ,UAAU;AACvG,aAAO,OAAO,UAAU,GAAG,QAAQ,WAAW,CAAC,IAAI;AAAA,IACrD;AACA,WAAO;AAAA,EACT;AACA,WAAS,QAAQ,OAAO,SAAS;AAC/B,QAAI,OAAO,UAAU,UAAU;AAC7B,aAAO,OAAa,OAAO,OAAO;AAAA,IACpC;AACA,QAAI,YAAY,KAAK,GAAG;AACtB,aAAOA,QAAgB,OAAO,OAAO;AAAA,IACvC;AAIA,QAAI,kBAAkB,KAAK,GAAG;AAC5B,UAAI,CAAC,WAAW,QAAQ,aAAa,WAAW;AAE9C,eAAO,GAAG,OAAO,MAAM,IAAI,MAAM,GAAG,GAAG,EAAE,OAAO,MAAM,CAAC;AAAA,MACzD,OAAO;AAEL,eAAO,MAAM,SAAS;AAAA,MACxB;AAAA,IACF;AACA,QAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,aAAO,YAAY,OAAO,OAAO;AAAA,IACnC;AACA,QAAI,SAAS,KAAK,GAAG;AACnB,aAAO,UAAU,KAAK;AAAA,IACxB;AACA,QAAI,OAAO,UAAU,YAAY;AAC/B,aAAO,MAAM,SAAS,OAAO,MAAM,MAAM,IAAI;AAAA,IAC/C;AACA,QAAI,SAAS,OAAO,UAAU,UAAU;AACtC,UAAI,OAAO,MAAM,WAAW,YAAY;AACtC,eAAO,MAAM,OAAO,OAAO;AAAA,MAC7B,WAAW,SAAS,MAAM,SAAS,OAAO,MAAM,CAAC,EAAE,SAAS,GAAG;AAE7D,eAAO,MAAM,SAAS,OAAO;AAAA,MAC/B,OAAO;AACL,YAAI,UAAU,OAAO,KAAK,KAAK,EAAE,IAAI,SAAO;AAC1C,iBAAO,UAAU,GAAG,IAAI,OAAOA,QAAO,MAAM,GAAG,GAAG,OAAO;AAAA,QAC3D,CAAC;AACD,eAAO,MAAM,QAAQ,KAAK,IAAI,IAAI;AAAA,MACpC;AAAA,IACF;AACA,WAAO,OAAO,KAAK;AAAA,EACrB;AAQO,WAAS,UAAU,OAAO;AAC/B,QAAI,OAAO,OAAO,KAAK;AACvB,QAAI,UAAU;AACd,QAAIC,KAAI;AACR,WAAOA,KAAI,KAAK,QAAQ;AACtB,UAAI,IAAI,KAAK,OAAOA,EAAC;AACrB,iBAAW,KAAK,oBAAoB,kBAAkB,CAAC,IAAI;AAC3D,MAAAA;AAAA,IACF;AACA,WAAO,MAAM,UAAU;AAAA,EACzB;AACA,MAAI,oBAAoB;AAAA,IACtB,KAAK;AAAA,IACL,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,KAAM;AAAA,EACR;AAOO,WAAS,OAAO,OAAO;AAC5B,QAAI,OAAO,OAAO,KAAK;AACvB,WAAO,KAAK,QAAQ,MAAM,OAAO,EAAE,QAAQ,MAAM,QAAQ,EAAE,QAAQ,MAAM,OAAO,EAAE,QAAQ,MAAM,MAAM,EAAE,QAAQ,MAAM,MAAM;AAC5H,WAAO;AAAA,EACT;AAYA,WAAS,YAAY,OAAO,SAAS;AACnC,QAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,UAAI,MAAM;AACV,UAAI,MAAM,MAAM;AAChB,eAASA,KAAI,GAAGA,KAAI,KAAKA,MAAK;AAC5B,YAAIA,OAAM,GAAG;AACX,iBAAO;AAAA,QACT;AACA,eAAO,YAAY,MAAMA,EAAC,GAAG,OAAO;AAAA,MACtC;AACA,aAAO;AACP,aAAO;AAAA,IACT,OAAO;AACL,aAAOD,QAAO,OAAO,OAAO;AAAA,IAC9B;AAAA,EACF;AAOA,WAAS,kBAAkB,OAAO;AAChC,WAAO,SAAS,OAAO,UAAU,YAAY,OAAO,MAAM,MAAM,YAAY,OAAO,MAAM,MAAM,YAAY,OAAO,MAAM,MAAM,YAAY;AAAA,EAC5I;AAQO,WAAS,YAAY,GAAG,GAAG;AAEhC,QAAI,CAAC,SAAS,CAAC,GAAG;AAChB,YAAM,IAAI,UAAU,uGAA4G,OAAO,CAAC,IAAI,aAAa;AAAA,IAC3J;AACA,QAAI,CAAC,SAAS,CAAC,GAAG;AAChB,YAAM,IAAI,UAAU,uGAA4G,OAAO,CAAC,IAAI,aAAa;AAAA,IAC3J;AACA,WAAO,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI;AAAA,EACnC;;;ACxLO,WAAS,eAAe,QAAQ,UAAU,UAAU;AACzD,QAAI,EAAE,gBAAgB,iBAAiB;AACrC,YAAM,IAAI,YAAY,kDAAkD;AAAA,IAC1E;AACA,SAAK,SAAS;AACd,SAAK,WAAW;AAChB,SAAK,WAAW;AAChB,SAAK,UAAU,0BAA0B,MAAM,QAAQ,MAAM,IAAI,MAAM,OAAO,KAAK,IAAI,IAAI,MAAM,UAAU,OAAO,KAAK,YAAY,QAAQ,OAAO,MAAM,QAAQ,QAAQ,IAAI,MAAM,SAAS,KAAK,IAAI,IAAI,MAAM,YAAY;AAC1N,SAAK,QAAQ,IAAI,MAAM,EAAE;AAAA,EAC3B;AACA,iBAAe,YAAY,IAAI,WAAW;AAC1C,iBAAe,UAAU,cAAc;AACvC,iBAAe,UAAU,OAAO;AAChC,iBAAe,UAAU,mBAAmB;;;ACZrC,WAAS,WAAWE,QAAOC,MAAKC,MAAK;AAC1C,QAAI,EAAE,gBAAgB,aAAa;AACjC,YAAM,IAAI,YAAY,kDAAkD;AAAA,IAC1E;AACA,SAAK,QAAQF;AACb,QAAI,UAAU,SAAS,GAAG;AACxB,WAAK,MAAM;AACX,WAAK,MAAMC;AAAA,IACb,OAAO;AACL,WAAK,MAAMA;AACX,WAAK,MAAMC;AAAA,IACb;AACA,QAAI,KAAK,QAAQ,UAAa,KAAK,QAAQ,KAAK,KAAK;AACnD,WAAK,UAAU,yBAAyB,KAAK,QAAQ,QAAQ,KAAK,MAAM;AAAA,IAC1E,WAAW,KAAK,QAAQ,UAAa,KAAK,SAAS,KAAK,KAAK;AAC3D,WAAK,UAAU,yBAAyB,KAAK,QAAQ,SAAS,KAAK,MAAM,KAAK;AAAA,IAChF,OAAO;AACL,WAAK,UAAU,yBAAyB,KAAK,QAAQ;AAAA,IACvD;AACA,SAAK,QAAQ,IAAI,MAAM,EAAE;AAAA,EAC3B;AACA,aAAW,YAAY,IAAI,WAAW;AACtC,aAAW,UAAU,cAAc;AACnC,aAAW,UAAU,OAAO;AAC5B,aAAW,UAAU,eAAe;;;ACnB7B,WAAS,UAAU,GAAG;AAC3B,QAAI,IAAI,CAAC;AACT,WAAO,MAAM,QAAQ,CAAC,GAAG;AACvB,QAAE,KAAK,EAAE,MAAM;AACf,UAAI,EAAE,CAAC;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAWA,WAAS,UAAU,OAAOC,OAAM,KAAK;AACnC,QAAIC;AACJ,QAAI,MAAM,MAAM;AAChB,QAAI,QAAQD,MAAK,GAAG,GAAG;AACrB,YAAM,IAAI,eAAe,KAAKA,MAAK,GAAG,CAAC;AAAA,IACzC;AACA,QAAI,MAAMA,MAAK,SAAS,GAAG;AAEzB,UAAI,UAAU,MAAM;AACpB,WAAKC,KAAI,GAAGA,KAAI,KAAKA,MAAK;AACxB,YAAI,QAAQ,MAAMA,EAAC;AACnB,YAAI,CAAC,MAAM,QAAQ,KAAK,GAAG;AACzB,gBAAM,IAAI,eAAeD,MAAK,SAAS,GAAGA,MAAK,QAAQ,GAAG;AAAA,QAC5D;AACA,kBAAU,MAAMC,EAAC,GAAGD,OAAM,OAAO;AAAA,MACnC;AAAA,IACF,OAAO;AAEL,WAAKC,KAAI,GAAGA,KAAI,KAAKA,MAAK;AACxB,YAAI,MAAM,QAAQ,MAAMA,EAAC,CAAC,GAAG;AAC3B,gBAAM,IAAI,eAAeD,MAAK,SAAS,GAAGA,MAAK,QAAQ,GAAG;AAAA,QAC5D;AAAA,MACF;AAAA,IACF;AAAA,EACF;AASO,WAAS,SAAS,OAAOA,OAAM;AACpC,QAAI,WAAWA,MAAK,WAAW;AAC/B,QAAI,UAAU;AAEZ,UAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,cAAM,IAAI,eAAe,MAAM,QAAQ,CAAC;AAAA,MAC1C;AAAA,IACF,OAAO;AAEL,gBAAU,OAAOA,OAAM,CAAC;AAAA,IAC1B;AAAA,EACF;AAQO,WAAS,wBAAwB,OAAOE,QAAO;AACpD,QAAI,YAAY,MAAM,WAAW,MAAM,QAAQ,UAAU,KAAK;AAC9D,QAAI,aAAaA,OAAM;AAEvB,eAAW,QAAQ,CAAC,WAAWD,OAAM;AACnC,UAAI,cAAc,QAAQ,cAAc,UAAUA,EAAC,GAAG;AACpD,cAAM,IAAI,eAAe,WAAW,UAAUA,EAAC,CAAC;AAAA,MAClD;AAAA,IACF,CAAC;AAAA,EACH;AAQO,WAAS,cAAcC,QAAO,QAAQ;AAC3C,QAAIA,WAAU,QAAW;AACvB,UAAI,CAAC,SAASA,MAAK,KAAK,CAAC,UAAUA,MAAK,GAAG;AACzC,cAAM,IAAI,UAAU,sCAAsCA,SAAQ,GAAG;AAAA,MACvE;AACA,UAAIA,SAAQ,KAAK,OAAO,WAAW,YAAYA,UAAS,QAAQ;AAC9D,cAAM,IAAI,WAAWA,QAAO,MAAM;AAAA,MACpC;AAAA,IACF;AAAA,EACF;AAMO,WAAS,aAAaA,QAAO;AAClC,aAASD,KAAI,GAAGA,KAAIC,OAAM,YAAY,QAAQ,EAAED,IAAG;AACjD,UAAI,YAAYC,OAAM,YAAYD,EAAC;AACnC,UAAI,UAAU,SAAS,QAAQ,UAAU,KAAK,GAAG;AAC/C,YAAI,UAAU,MAAM,CAAC,MAAM,GAAG;AAC5B,iBAAO;AAAA,QACT;AAAA,MACF,WAAW,UAAU,SAAS;AAC5B,YAAI,UAAU,UAAU,UAAU,KAAK;AACrC,iBAAO;AAAA,QACT;AAAA,MACF,WAAW,SAAS,SAAS,GAAG;AAC9B,YAAI,UAAU,WAAW,GAAG;AAC1B,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAYO,WAAS,OAAO,OAAOD,OAAM,cAAc;AAEhD,QAAI,CAAC,MAAM,QAAQA,KAAI,GAAG;AACxB,YAAM,IAAI,UAAU,gBAAgB;AAAA,IACtC;AACA,QAAIA,MAAK,WAAW,GAAG;AACrB,YAAM,IAAI,MAAM,qCAAqC;AAAA,IACvD;AAGA,IAAAA,MAAK,QAAQ,SAAU,OAAO;AAC5B,UAAI,CAAC,SAAS,KAAK,KAAK,CAAC,UAAU,KAAK,KAAK,QAAQ,GAAG;AACtD,cAAM,IAAI,UAAU,yDAA8DG,QAAOH,KAAI,IAAI,GAAG;AAAA,MACtG;AAAA,IACF,CAAC;AAGD,QAAI,SAAS,KAAK,KAAK,YAAY,KAAK,GAAG;AACzC,cAAQ,CAAC,KAAK;AAAA,IAChB;AAGA,QAAI,gBAAgB,iBAAiB,SAAY,eAAe;AAChE,YAAQ,OAAOA,OAAM,GAAG,aAAa;AACrC,WAAO;AAAA,EACT;AAWA,WAAS,QAAQ,OAAOA,OAAM,KAAK,cAAc;AAC/C,QAAIC;AACJ,QAAI;AACJ,QAAI,SAAS,MAAM;AACnB,QAAI,SAASD,MAAK,GAAG;AACrB,QAAI,SAAS,KAAK,IAAI,QAAQ,MAAM;AAGpC,UAAM,SAAS;AACf,QAAI,MAAMA,MAAK,SAAS,GAAG;AAEzB,UAAI,UAAU,MAAM;AAGpB,WAAKC,KAAI,GAAGA,KAAI,QAAQA,MAAK;AAE3B,eAAO,MAAMA,EAAC;AACd,YAAI,CAAC,MAAM,QAAQ,IAAI,GAAG;AACxB,iBAAO,CAAC,IAAI;AACZ,gBAAMA,EAAC,IAAI;AAAA,QACb;AACA,gBAAQ,MAAMD,OAAM,SAAS,YAAY;AAAA,MAC3C;AAGA,WAAKC,KAAI,QAAQA,KAAI,QAAQA,MAAK;AAEhC,eAAO,CAAC;AACR,cAAMA,EAAC,IAAI;AAGX,gBAAQ,MAAMD,OAAM,SAAS,YAAY;AAAA,MAC3C;AAAA,IACF,OAAO;AAIL,WAAKC,KAAI,GAAGA,KAAI,QAAQA,MAAK;AAC3B,eAAO,MAAM,QAAQ,MAAMA,EAAC,CAAC,GAAG;AAC9B,gBAAMA,EAAC,IAAI,MAAMA,EAAC,EAAE,CAAC;AAAA,QACvB;AAAA,MACF;AAGA,WAAKA,KAAI,QAAQA,KAAI,QAAQA,MAAK;AAChC,cAAMA,EAAC,IAAI;AAAA,MACb;AAAA,IACF;AAAA,EACF;AAYO,WAAS,QAAQ,OAAO,OAAO;AACpC,QAAI,YAAY,QAAQ,OAAO,IAAI;AACnC,QAAI,gBAAgB,UAAU;AAC9B,QAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,CAAC,MAAM,QAAQ,KAAK,GAAG;AAClD,YAAM,IAAI,UAAU,gBAAgB;AAAA,IACtC;AACA,QAAI,MAAM,WAAW,GAAG;AACtB,YAAM,IAAI,eAAe,GAAG,eAAe,IAAI;AAAA,IACjD;AACA,YAAQ,qBAAqB,OAAO,aAAa;AACjD,QAAI,YAAY,QAAQ,KAAK;AAC7B,QAAI,kBAAkB,WAAW;AAC/B,YAAM,IAAI,eAAe,WAAW,eAAe,IAAI;AAAA,IACzD;AACA,QAAI;AACF,aAAO,SAAS,WAAW,KAAK;AAAA,IAClC,SAASG,IAAG;AACV,UAAIA,cAAa,gBAAgB;AAC/B,cAAM,IAAI,eAAe,WAAW,eAAe,IAAI;AAAA,MACzD;AACA,YAAMA;AAAA,IACR;AAAA,EACF;AASO,WAAS,qBAAqB,OAAO,eAAe;AACzD,QAAI,YAAY,QAAQ,KAAK;AAC7B,QAAI,iBAAiB,MAAM,MAAM;AACjC,QAAI,WAAW;AACf,QAAI,gBAAgB,MAAM,QAAQ,QAAQ;AAC1C,QAAI,wBAAwB,MAAM,QAAQ,UAAU,gBAAgB,CAAC,KAAK;AAC1E,QAAI,uBAAuB;AACzB,YAAM,IAAI,MAAM,iCAAiC;AAAA,IACnD;AACA,QAAI,cAAc,iBAAiB;AACnC,QAAI,qBAAqB,gBAAgB,cAAc;AACvD,QAAI,aAAa;AACf,UAAI,oBAAoB;AACtB,uBAAe,aAAa,IAAI,CAAC,gBAAgB;AAAA,MACnD,OAAO;AACL,cAAM,IAAI,MAAM,uCAAuC,gBAAgB,wBAAwB,CAAC,SAAS;AAAA,MAC3G;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAOA,WAAS,QAAQ,OAAO;AACtB,WAAO,MAAM,OAAO,CAAC,MAAM,SAAS,OAAO,MAAM,CAAC;AAAA,EACpD;AAUA,WAAS,SAAS,OAAO,OAAO;AAE9B,QAAI,WAAW;AACf,QAAI;AAEJ,aAAS,YAAY,MAAM,SAAS,GAAG,YAAY,GAAG,aAAa;AACjE,UAAIJ,QAAO,MAAM,SAAS;AAC1B,kBAAY,CAAC;AAGb,UAAI,SAAS,SAAS,SAASA;AAC/B,eAASC,KAAI,GAAGA,KAAI,QAAQA,MAAK;AAC/B,kBAAU,KAAK,SAAS,MAAMA,KAAID,QAAOC,KAAI,KAAKD,KAAI,CAAC;AAAA,MACzD;AAEA,iBAAW;AAAA,IACb;AACA,WAAO;AAAA,EACT;AAQO,WAAS,QAAQ,OAAOA,OAAM;AACnC,QAAI,IAAIA,SAAQ,UAAU,KAAK;AAG/B,WAAO,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,GAAG;AACjD,cAAQ,MAAM,CAAC;AACf,QAAE,MAAM;AAAA,IACV;AAGA,QAAI,OAAO,EAAE;AACb,WAAO,EAAE,OAAO,CAAC,MAAM,GAAG;AACxB;AAAA,IACF;AAGA,QAAI,OAAO,EAAE,QAAQ;AACnB,cAAQ,SAAS,OAAO,MAAM,CAAC;AAC/B,QAAE,SAAS;AAAA,IACb;AACA,WAAO;AAAA,EACT;AAUA,WAAS,SAAS,OAAO,MAAM,KAAK;AAClC,QAAIC,IAAG;AACP,QAAI,MAAM,MAAM;AACd,UAAI,OAAO,MAAM;AACjB,WAAKA,KAAI,GAAG,KAAK,MAAM,QAAQA,KAAI,IAAIA,MAAK;AAC1C,cAAMA,EAAC,IAAI,SAAS,MAAMA,EAAC,GAAG,MAAM,IAAI;AAAA,MAC1C;AAAA,IACF,OAAO;AACL,aAAO,MAAM,QAAQ,KAAK,GAAG;AAC3B,gBAAQ,MAAM,CAAC;AAAA,MACjB;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAcO,WAAS,UAAU,OAAO,MAAM,OAAOD,OAAM;AAClD,QAAI,IAAIA,SAAQ,UAAU,KAAK;AAG/B,QAAI,OAAO;AACT,eAASC,KAAI,GAAGA,KAAI,OAAOA,MAAK;AAC9B,gBAAQ,CAAC,KAAK;AACd,UAAE,QAAQ,CAAC;AAAA,MACb;AAAA,IACF;AAGA,YAAQ,WAAW,OAAO,MAAM,CAAC;AACjC,WAAO,EAAE,SAAS,MAAM;AACtB,QAAE,KAAK,CAAC;AAAA,IACV;AACA,WAAO;AAAA,EACT;AAUA,WAAS,WAAW,OAAO,MAAM,KAAK;AACpC,QAAIA,IAAG;AACP,QAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,UAAI,OAAO,MAAM;AACjB,WAAKA,KAAI,GAAG,KAAK,MAAM,QAAQA,KAAI,IAAIA,MAAK;AAC1C,cAAMA,EAAC,IAAI,WAAW,MAAMA,EAAC,GAAG,MAAM,IAAI;AAAA,MAC5C;AAAA,IACF,OAAO;AACL,eAAS,IAAI,KAAK,IAAI,MAAM,KAAK;AAC/B,gBAAQ,CAAC,KAAK;AAAA,MAChB;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAQO,WAAS,QAAQ,OAAO;AAC7B,QAAI,gBAAgB,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACxF,QAAI,CAAC,MAAM,QAAQ,KAAK,GAAG;AAEzB,aAAO;AAAA,IACT;AACA,QAAI,OAAO,kBAAkB,WAAW;AACtC,YAAM,IAAI,UAAU,iDAAiD;AAAA,IACvE;AACA,QAAI,OAAO,CAAC;AACZ,QAAI,eAAe;AACjB,0BAAoB,KAAK;AAAA,IAC3B,OAAO;AACL,eAAS,KAAK;AAAA,IAChB;AACA,WAAO;AACP,aAAS,SAASI,QAAO;AACvB,eAASJ,KAAI,GAAGA,KAAII,OAAM,QAAQJ,MAAK;AACrC,YAAI,OAAOI,OAAMJ,EAAC;AAClB,YAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,mBAAS,IAAI;AAAA,QACf,OAAO;AACL,eAAK,KAAK,IAAI;AAAA,QAChB;AAAA,MACF;AAAA,IACF;AACA,aAAS,oBAAoBI,QAAO;AAClC,UAAI,MAAM,QAAQA,OAAM,CAAC,CAAC,GAAG;AAC3B,iBAASJ,KAAI,GAAGA,KAAII,OAAM,QAAQJ,MAAK;AACrC,8BAAoBI,OAAMJ,EAAC,CAAC;AAAA,QAC9B;AAAA,MACF,OAAO;AACL,iBAAS,KAAK,GAAG,KAAKI,OAAM,QAAQ,MAAM;AACxC,eAAK,KAAKA,OAAM,EAAE,CAAC;AAAA,QACrB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAOO,WAAS,IAAI,OAAO,UAAU;AACnC,WAAO,MAAM,UAAU,IAAI,KAAK,OAAO,QAAQ;AAAA,EACjD;AAOO,WAAS,QAAQ,OAAO,UAAU;AACvC,UAAM,UAAU,QAAQ,KAAK,OAAO,QAAQ;AAAA,EAC9C;AAOO,WAAS,OAAO,OAAO,UAAU;AACtC,QAAI,UAAU,KAAK,EAAE,WAAW,GAAG;AACjC,YAAM,IAAI,MAAM,yCAAyC;AAAA,IAC3D;AACA,WAAO,MAAM,UAAU,OAAO,KAAK,OAAO,QAAQ;AAAA,EACpD;AASO,WAAS,aAAa,OAAO,QAAQ;AAC1C,QAAI,UAAU,KAAK,EAAE,WAAW,GAAG;AACjC,YAAM,IAAI,MAAM,yCAAyC;AAAA,IAC3D;AACA,WAAO,MAAM,UAAU,OAAO,KAAK,OAAO,WAAS,OAAO,KAAK,KAAK,CAAC;AAAA,EACvE;AAOO,WAAS,KAAK,OAAO,WAAW;AACrC,WAAO,MAAM,UAAU,KAAK,KAAK,OAAO,SAAS;AAAA,EACnD;AAOO,WAAS,SAAS,GAAG;AAC1B,QAAI,CAAC,MAAM,QAAQ,CAAC,GAAG;AACrB,YAAM,IAAI,UAAU,sBAAsB;AAAA,IAC5C;AACA,QAAI,EAAE,WAAW,GAAG;AAClB,aAAO;AAAA,IACT;AACA,QAAI,IAAI,CAAC;AACT,QAAIC,SAAQ;AACZ,MAAE,CAAC,IAAI;AAAA,MACL,OAAO,EAAE,CAAC;AAAA,MACV,YAAY;AAAA,IACd;AACA,aAASL,KAAI,GAAGA,KAAI,EAAE,QAAQA,MAAK;AACjC,UAAI,EAAEA,EAAC,MAAM,EAAEA,KAAI,CAAC,GAAG;AACrB,QAAAK;AAAA,MACF,OAAO;AACL,QAAAA,SAAQ;AAAA,MACV;AACA,QAAE,KAAK;AAAA,QACL,OAAO,EAAEL,EAAC;AAAA,QACV,YAAYK;AAAA,MACd,CAAC;AAAA,IACH;AACA,WAAO;AAAA,EACT;AAOO,WAAS,WAAW,GAAG;AAC5B,QAAI,CAAC,MAAM,QAAQ,CAAC,GAAG;AACrB,YAAM,IAAI,UAAU,sBAAsB;AAAA,IAC5C;AACA,QAAI,EAAE,WAAW,GAAG;AAClB,aAAO;AAAA,IACT;AACA,QAAI,IAAI,CAAC;AACT,aAASL,KAAI,GAAGA,KAAI,EAAE,QAAQA,MAAK;AACjC,QAAE,KAAK,EAAEA,EAAC,EAAE,KAAK;AAAA,IACnB;AACA,WAAO;AAAA,EACT;AAWO,WAAS,iBAAiB,OAAOM,SAAQ;AAC9C,QAAI;AACJ,QAAI,SAAS;AAEb,aAASN,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AACrC,UAAI,OAAO,MAAMA,EAAC;AAClB,UAAI,WAAW,MAAM,QAAQ,IAAI;AAGjC,UAAIA,OAAM,KAAK,UAAU;AACvB,iBAAS,KAAK;AAAA,MAChB;AAGA,UAAI,YAAY,KAAK,WAAW,QAAQ;AACtC,eAAO;AAAA,MACT;AACA,UAAI,WAAW,WAAW,iBAAiB,MAAMM,OAAM,IACrDA,QAAO,IAAI;AACb,UAAI,SAAS,QAAW;AACtB,eAAO;AAAA,MACT,WAAW,SAAS,UAAU;AAC5B,eAAO;AAAA,MACT,OAAO;AAAA,MAEP;AAAA,IACF;AACA,WAAO;AAAA,EACT;AA8BA,WAAS,gBAAgB,GAAG,GAAG,WAAW,KAAK;AAC7C,QAAI,MAAM,WAAW;AAEnB,UAAI,EAAE,WAAW,EAAE,QAAQ;AACzB,cAAM,IAAI,eAAe,EAAE,QAAQ,EAAE,MAAM;AAAA,MAC7C;AACA,UAAI,IAAI,CAAC;AACT,eAASC,KAAI,GAAGA,KAAI,EAAE,QAAQA,MAAK;AACjC,UAAEA,EAAC,IAAI,gBAAgB,EAAEA,EAAC,GAAG,EAAEA,EAAC,GAAG,WAAW,MAAM,CAAC;AAAA,MACvD;AACA,aAAO;AAAA,IACT,OAAO;AAEL,aAAO,EAAE,OAAO,CAAC;AAAA,IACnB;AAAA,EACF;AAQO,WAAS,SAAS;AACvB,QAAI,SAAS,MAAM,UAAU,MAAM,KAAK,WAAW,GAAG,EAAE;AACxD,QAAI,YAAY,MAAM,UAAU,MAAM,KAAK,WAAW,EAAE;AACxD,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO,OAAO,CAAC;AAAA,IACjB;AACA,QAAI,OAAO,SAAS,GAAG;AACrB,aAAO,OAAO,MAAM,CAAC,EAAE,OAAO,SAAU,GAAG,GAAG;AAC5C,eAAO,gBAAgB,GAAG,GAAG,WAAW,CAAC;AAAA,MAC3C,GAAG,OAAO,CAAC,CAAC;AAAA,IACd,OAAO;AACL,YAAM,IAAI,MAAM,8CAA8C;AAAA,IAChE;AAAA,EACF;AAOO,WAAS,iBAAiB;AAC/B,aAAS,OAAO,UAAU,QAAQ,QAAQ,IAAI,MAAM,IAAI,GAAG,OAAO,GAAG,OAAO,MAAM,QAAQ;AACxF,YAAM,IAAI,IAAI,UAAU,IAAI;AAAA,IAC9B;AACA,QAAI,aAAa,MAAM,IAAI,OAAK,EAAE,MAAM;AACxC,QAAI,IAAI,KAAK,IAAI,GAAG,UAAU;AAC9B,QAAI,UAAU,IAAI,MAAM,CAAC,EAAE,KAAK,IAAI;AAEpC,aAASA,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AACrC,UAAIC,QAAO,MAAMD,EAAC;AAClB,UAAI,MAAM,WAAWA,EAAC;AACtB,eAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,YAAI,IAAI,IAAI,MAAM;AAClB,YAAIC,MAAK,CAAC,IAAI,QAAQ,CAAC,GAAG;AACxB,kBAAQ,CAAC,IAAIA,MAAK,CAAC;AAAA,QACrB;AAAA,MACF;AAAA,IACF;AACA,aAAS,MAAM,GAAG,MAAM,MAAM,QAAQ,OAAO;AAC3C,6BAAuB,MAAM,GAAG,GAAG,OAAO;AAAA,IAC5C;AACA,WAAO;AAAA,EACT;AAOO,WAAS,uBAAuBA,OAAM,QAAQ;AACnD,QAAI,IAAI,OAAO;AACf,QAAI,MAAMA,MAAK;AACf,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,UAAI,IAAI,IAAI,MAAM;AAClB,UAAIA,MAAK,CAAC,IAAI,OAAO,CAAC,KAAKA,MAAK,CAAC,IAAI,KAAKA,MAAK,CAAC,IAAI,OAAO,CAAC,GAAG;AAC7D,cAAM,IAAI,MAAM,wDAAwD,OAAOA,OAAM,wCAAwC,EAAE,OAAO,KAAK,aAAa,EAAE,OAAOA,MAAK,CAAC,GAAG,WAAW,EAAE,OAAO,OAAO,CAAC,CAAC,CAAC;AAAA,MAC1M;AAAA,IACF;AAAA,EACF;AAQO,WAAS,YAAY,OAAO,QAAQ;AACzC,QAAI,QAAQ,UAAU,KAAK;AAC3B,QAAI,gBAAgB,OAAO,MAAM,GAAG;AAClC,aAAO;AAAA,IACT;AACA,2BAAuB,OAAO,MAAM;AACpC,QAAI,kBAAkB,eAAe,OAAO,MAAM;AAClD,QAAI,IAAI,gBAAgB;AACxB,QAAI,aAAa,CAAC,GAAG,MAAM,IAAI,MAAM,MAAM,EAAE,KAAK,CAAC,GAAG,GAAG,KAAK;AAC9D,QAAI,IAAIC,OAAM,KAAK;AAEnB,QAAI,MAAM,SAAS,GAAG;AACpB,UAAI,QAAQ,GAAG,UAAU;AACzB,cAAQ,UAAU,CAAC;AAAA,IACrB;AAGA,aAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,UAAI,MAAM,GAAG,IAAI,gBAAgB,GAAG,GAAG;AACrC,YAAI,QAAQ,GAAG,gBAAgB,GAAG,GAAG,GAAG;AACxC,gBAAQ,UAAU,CAAC;AAAA,MACrB;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAmCO,WAAS,QAAQ,gBAAgB,eAAe,cAAc;AACnE,WAAO,OAAO,GAAG,MAAM,aAAa,EAAE,KAAK,cAAc,GAAG,YAAY;AAAA,EAC1E;AAcO,WAAS,IAAI,OAAOC,QAAO;AAChC,QAAI,CAAC,MAAM,QAAQ,KAAK,GAAG;AACzB,YAAM,IAAI,MAAM,gBAAgB;AAAA,IAClC;AACA,QAAIC,QAAO,UAAU,KAAK;AAC1B,QAAID,OAAM,WAAWC,MAAK,QAAQ;AAChC,YAAM,IAAI,eAAeD,OAAM,QAAQC,MAAK,MAAM;AAAA,IACpD;AACA,aAAS,IAAI,GAAG,IAAID,OAAM,QAAQ,KAAK;AACrC,oBAAcA,OAAM,CAAC,GAAGC,MAAK,CAAC,CAAC;AAAA,IACjC;AACA,WAAOD,OAAM,OAAO,CAAC,KAAK,SAAS,IAAI,IAAI,GAAG,KAAK;AAAA,EACrD;AAaO,WAAS,QAAQ,OAAO,UAAU;AACvC,QAAI,YAAY,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACpF,QAAI,MAAM,WAAW,GAAG;AACtB,aAAO,CAAC;AAAA,IACV;AACA,QAAI,WAAW;AACb,aAAO,aAAa,KAAK;AAAA,IAC3B;AACA,QAAIA,SAAQ,CAAC;AACb,WAAO,sBAAsB,OAAO,CAAC;AACrC,aAAS,sBAAsB,OAAO,OAAO;AAC3C,UAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,YAAI,IAAI,MAAM;AACd,YAAI,SAAS,MAAM,CAAC;AACpB,iBAASE,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,UAAAF,OAAM,KAAK,IAAIE;AACf,iBAAOA,EAAC,IAAI,sBAAsB,MAAMA,EAAC,GAAG,QAAQ,CAAC;AAAA,QACvD;AACA,eAAO;AAAA,MACT,OAAO;AACL,eAAO,SAAS,OAAOF,OAAM,MAAM,GAAG,KAAK,GAAG,KAAK;AAAA,MACrD;AAAA,IACF;AACA,aAAS,aAAa,OAAO;AAC3B,UAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,YAAI,IAAI,MAAM;AACd,YAAI,SAAS,MAAM,CAAC;AACpB,iBAASE,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,iBAAOA,EAAC,IAAI,aAAa,MAAMA,EAAC,CAAC;AAAA,QACnC;AACA,eAAO;AAAA,MACT,OAAO;AACL,eAAO,SAAS,KAAK;AAAA,MACvB;AAAA,IACF;AAAA,EACF;AAYO,WAAS,YAAY,OAAO,UAAU;AAC3C,QAAI,YAAY,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACpF,QAAI,MAAM,WAAW,GAAG;AACtB;AAAA,IACF;AACA,QAAI,WAAW;AACb,uBAAiB,KAAK;AACtB;AAAA,IACF;AACA,QAAIF,SAAQ,CAAC;AACb,8BAA0B,OAAO,CAAC;AAClC,aAAS,0BAA0B,OAAO,OAAO;AAC/C,UAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,YAAI,IAAI,MAAM;AACd,iBAASE,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,UAAAF,OAAM,KAAK,IAAIE;AACf,oCAA0B,MAAMA,EAAC,GAAG,QAAQ,CAAC;AAAA,QAC/C;AAAA,MACF,OAAO;AACL,iBAAS,OAAOF,OAAM,MAAM,GAAG,KAAK,GAAG,KAAK;AAAA,MAC9C;AAAA,IACF;AACA,aAAS,iBAAiB,OAAO;AAC/B,UAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,YAAI,IAAI,MAAM;AACd,iBAASE,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,2BAAiB,MAAMA,EAAC,CAAC;AAAA,QAC3B;AAAA,MACF,OAAO;AACL,iBAAS,KAAK;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AAOO,WAASC,OAAM,OAAO;AAC3B,WAAOC,UAAS,CAAC,GAAG,KAAK;AAAA,EAC3B;;;ACn6BA,MAAAC,yBAAkB;AAaX,WAAS,iBAAiB,UAAU,OAAOC,SAAM,SAAS;AAC/D,QAAI,uBAAAC,QAAM,gBAAgB,QAAQ,GAAG;AACnC,UAAI;AACJ,UAAI,SAAS;AACX,4BAAoB;AAAA,MACtB,OAAO;AACL,YAAIC,QAAO,MAAM,WAAW,MAAM,KAAK,IAAI,UAAU,KAAK;AAG1D,YAAI,UAAUA,MAAK,SAASA,MAAKA,MAAK,SAAS,CAAC,MAAM,IAAI;AAC1D,YAAI,SAAS;AAGX,iBAAO;AAAA,YACL;AAAA,YACA,IAAI;AAAA,UACN;AAAA,QACF;AACA,YAAI,aAAaA,MAAK,IAAI,MAAM,CAAC;AACjC,YAAI,aAAa,MAAM,WAAW,MAAM,IAAI,UAAU,IAAI,IAAI,OAAO,UAAU;AAC/E,4BAAoB,4BAA4B,UAAU,YAAY,YAAY,KAAK;AAAA,MACzF;AACA,UAAI;AACJ,UAAI,MAAM,YAAY,MAAM,aAAa,WAAW,MAAM,aAAa,QAAW;AAChF,YAAI,kBAAkB,8BAA8B,UAAU,iBAAiB;AAC/E,uBAAe,oBAAoB,SAAY,kBAAkB;AAAA,MACnE,OAAO;AACL,uBAAe;AAAA,MACjB;AACA,UAAI,qBAAqB,KAAK,qBAAqB,GAAG;AACpD,eAAO;AAAA,UACL,SAAS,sBAAsB;AAAA,UAC/B,IAAI,SAAS,KAAK;AAChB,qBAAS,OAAO,UAAU,QAAQ,OAAO,IAAI,MAAM,IAAI,GAAG,OAAO,GAAG,OAAO,MAAM,QAAQ;AACvF,mBAAK,IAAI,IAAI,UAAU,IAAI;AAAA,YAC7B;AACA,mBAAO,qBAAqB,cAAc,KAAK,MAAM,GAAG,iBAAiB,GAAGF,SAAM,SAAS,IAAI;AAAA,UACjG;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,QACL,SAAS;AAAA,QACT,IAAI,SAAS,KAAK;AAChB,mBAAS,QAAQ,UAAU,QAAQ,OAAO,IAAI,MAAM,KAAK,GAAG,QAAQ,GAAG,QAAQ,OAAO,SAAS;AAC7F,iBAAK,KAAK,IAAI,UAAU,KAAK;AAAA,UAC/B;AACA,iBAAO,qBAAqB,cAAc,MAAMA,SAAM,SAAS,IAAI;AAAA,QACrE;AAAA,MACF;AAAA,IACF;AACA,QAAI,YAAY,QAAW;AACzB,aAAO;AAAA,QACL,SAAS,uBAAuB,QAAQ;AAAA,QACxC,IAAI;AAAA,MACN;AAAA,IACF,OAAO;AACL,aAAO;AAAA,QACL;AAAA,QACA,IAAI;AAAA,MACN;AAAA,IACF;AAAA,EACF;AACA,WAAS,8BAA8B,UAAU,OAAO;AACtD,QAAI,oBAAoB,CAAC;AACzB,WAAO,QAAQ,SAAS,UAAU,EAAE,QAAQ,UAAQ;AAClD,UAAI,CAAC,WAAW,IAAI,IAAI;AACxB,UAAI,UAAU,MAAM,GAAG,EAAE,WAAW,OAAO;AACzC,0BAAkB,KAAK,IAAI;AAAA,MAC7B;AAAA,IACF,CAAC;AACD,QAAI,kBAAkB,WAAW,GAAG;AAClC,aAAO,kBAAkB,CAAC;AAAA,IAC5B;AAAA,EACF;AAcA,WAAS,uBAAuB,UAAU;AACxC,QAAI,SAAS,WAAW,EAAG,QAAO;AAClC,QAAI,cAAc,SAAS,SAAS;AAEpC,QAAI,YAAY,KAAK,WAAW,EAAG,QAAO;AAG1C,QAAI,YAAY,YAAY,MAAM,SAAS;AAE3C,QAAI,SAAS,KAAK,SAAS,EAAG,QAAO;AACrC,WAAO;AAAA,EACT;AACA,WAAS,4BAA4B,UAAU,OAAOG,QAAO,OAAO;AAClE,QAAI,WAAW,CAAC,OAAOA,QAAO,KAAK;AACnC,aAASC,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,UAAI,OAAO,SAAS,MAAM,GAAGA,EAAC;AAC9B,UAAI,uBAAAH,QAAM,QAAQ,UAAU,IAAI,MAAM,MAAM;AAC1C,eAAOG;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAUA,WAAS,qBAAqB,MAAM,MAAM,eAAe,cAAc;AACrE,QAAI;AACF,aAAO,KAAK,GAAG,IAAI;AAAA,IACrB,SAAS,KAAK;AACZ,2BAAqB,KAAK,MAAM,eAAe,YAAY;AAAA,IAC7D;AAAA,EACF;AAWA,WAAS,qBAAqB,KAAK,MAAM,eAAe,cAAc;AACpE,QAAI;AAEJ,QAAI,eAAe,eAAe,YAAY,IAAI,UAAU,QAAQ,cAAc,SAAS,SAAS,UAAU,cAAc,aAAa;AACvI,UAAI,WAAW,CAAC;AAChB,eAAS,KAAK,UAAU,OAAO,OAAQ,KAAK,CAAC,CAAC,CAAC,CAAC;AAChD,UAAI,KAAK,UAAU,GAAG;AACpB,iBAAS,KAAK,UAAU,OAAO,OAAQ,KAAK,CAAC,CAAC,CAAC,CAAC;AAAA,MAClD;AACA,UAAI,KAAK,UAAU,GAAG;AACpB,iBAAS,KAAK,UAAU,OAAO,OAAQ,KAAK,CAAC,CAAC,CAAC,CAAC;AAAA,MAClD;AACA,YAAM,IAAI,UAAU,YAAY,OAAO,eAAe,mCAAmC,IAAI,GAAG,OAAO,cAAc,GAAG,EAAE,OAAO,SAAS,KAAK,IAAI,GAAG,aAAa,EAAE,OAAO,KAAK,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC;AAAA,IACtM,OAAO;AACL,YAAM,IAAI,UAAU,YAAY,OAAO,eAAe,mCAAmC,IAAI,eAAe,OAAO,cAAc,IAAI,EAAE,OAAO,IAAI,OAAO,CAAC;AAAA,IAC5J;AAAA,EACF;;;AC1JA,MAAIC,QAAO;AACX,MAAIC,gBAAe,CAAC,UAAU,QAAQ;AAC/B,MAAI,yBAAwC,wBAAQD,OAAMC,eAAc,UAAQ;AACrF,QAAI;AAAA,MACF,QAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AAMJ,aAASC,aAAY,MAAM,UAAU;AACnC,UAAI,EAAE,gBAAgBA,eAAc;AAClC,cAAM,IAAI,YAAY,kDAAkD;AAAA,MAC1E;AACA,UAAI,YAAY,CAAC,SAAS,QAAQ,GAAG;AACnC,cAAM,IAAI,MAAM,uBAAuB,QAAQ;AAAA,MACjD;AACA,UAAI,SAAS,IAAI,GAAG;AAElB,YAAI,KAAK,SAAS,eAAe;AAE/B,eAAK,QAAQC,OAAM,KAAK,KAAK;AAC7B,eAAK,QAAQA,OAAM,KAAK,KAAK;AAC7B,eAAK,YAAY,YAAY,KAAK;AAAA,QACpC,OAAO;AAEL,eAAK,QAAQ,KAAK,QAAQ;AAC1B,eAAK,QAAQ,KAAK,KAAK;AACvB,eAAK,YAAY,YAAY,KAAK;AAAA,QACpC;AAAA,MACF,WAAW,QAAQ,QAAQ,KAAK,IAAI,KAAK,QAAQ,KAAK,IAAI,GAAG;AAE3D,aAAK,QAAQ,KAAK;AAClB,aAAK,QAAQ,KAAK;AAElB,iBAAS,KAAK,OAAO,KAAK,KAAK;AAC/B,aAAK,YAAY,YAAY,KAAK;AAAA,MACpC,WAAW,QAAQ,IAAI,GAAG;AAExB,aAAK,QAAQ,WAAW,IAAI;AAE5B,aAAK,QAAQ,UAAU,KAAK,KAAK;AAEjC,iBAAS,KAAK,OAAO,KAAK,KAAK;AAE/B,aAAK,YAAY;AAAA,MACnB,WAAW,MAAM;AAEf,cAAM,IAAI,UAAU,+BAA+B,OAAO,IAAI,IAAI,GAAG;AAAA,MACvE,OAAO;AAEL,aAAK,QAAQ,CAAC;AACd,aAAK,QAAQ,CAAC,CAAC;AACf,aAAK,YAAY;AAAA,MACnB;AAAA,IACF;AACA,IAAAD,aAAY,YAAY,IAAIF,QAAO;AAKnC,IAAAE,aAAY,UAAU,oBAAoB,SAAU,MAAM,UAAU;AAClE,aAAO,IAAIA,aAAY,MAAM,QAAQ;AAAA,IACvC;AAKA,WAAO,eAAeA,cAAa,QAAQ;AAAA,MACzC,OAAO;AAAA,IACT,CAAC;AACD,IAAAA,aAAY,UAAU,cAAcA;AACpC,IAAAA,aAAY,UAAU,OAAO;AAC7B,IAAAA,aAAY,UAAU,gBAAgB;AAWtC,IAAAA,aAAY,UAAU,cAAc,WAAY;AAC9C,aAAO,iBAAiB,KAAK,OAAO,MAAM;AAAA,IAC5C;AAWA,IAAAA,aAAY,UAAU,UAAU,WAAY;AAC1C,aAAO;AAAA,IACT;AAWA,IAAAA,aAAY,UAAU,WAAW,WAAY;AAC3C,aAAO,KAAK;AAAA,IACd;AAQA,IAAAA,aAAY,UAAU,SAAS,SAAU,MAAM,UAAU;AACvD,aAAO,IAAIA,aAAY,MAAM,QAAQ;AAAA,IACvC;AAgBA,IAAAA,aAAY,UAAU,SAAS,SAAUE,QAAO,aAAa,cAAc;AACzE,cAAQ,UAAU,QAAQ;AAAA,QACxB,KAAK;AACH,iBAAO,KAAK,MAAMA,MAAK;AAAA;AAAA,QAGzB,KAAK;AAAA,QACL,KAAK;AACH,iBAAO,KAAK,MAAMA,QAAO,aAAa,YAAY;AAAA,QACpD;AACE,gBAAM,IAAI,YAAY,2BAA2B;AAAA,MACrD;AAAA,IACF;AAQA,IAAAF,aAAY,UAAU,MAAM,SAAUE,QAAO;AAC3C,aAAO,IAAI,KAAK,OAAOA,MAAK;AAAA,IAC9B;AAYA,IAAAF,aAAY,UAAU,MAAM,SAAUE,QAAO,OAAO,cAAc;AAChE,UAAI,CAAC,QAAQA,MAAK,GAAG;AACnB,cAAM,IAAI,UAAU,gBAAgB;AAAA,MACtC;AACA,UAAIA,OAAM,SAAS,KAAK,MAAM,QAAQ;AACpC,cAAM,IAAI,eAAeA,OAAM,QAAQ,KAAK,MAAM,QAAQ,GAAG;AAAA,MAC/D;AACA,UAAIC,IAAG,IAAI;AAGX,UAAIC,QAAOF,OAAM,IAAI,SAAUC,IAAG;AAChC,eAAOA,KAAI;AAAA,MACb,CAAC;AACD,WAAK,MAAMC,OAAM,YAAY;AAG7B,UAAI,OAAO,KAAK;AAChB,WAAKD,KAAI,GAAG,KAAKD,OAAM,SAAS,GAAGC,KAAI,IAAIA,MAAK;AAC9C,iBAASD,OAAMC,EAAC;AAChB,sBAAc,QAAQ,KAAK,MAAM;AACjC,eAAO,KAAK,MAAM;AAAA,MACpB;AAGA,eAASD,OAAMA,OAAM,SAAS,CAAC;AAC/B,oBAAc,QAAQ,KAAK,MAAM;AACjC,WAAK,MAAM,IAAI;AACf,aAAO;AAAA,IACT;AASA,aAAS,KAAKG,SAAQH,QAAO;AAC3B,UAAI,CAAC,QAAQA,MAAK,GAAG;AACnB,cAAM,IAAI,UAAU,eAAe;AAAA,MACrC;AACA,UAAI,WAAWH,QAAO,eAAeG,OAAM,KAAK,EAAE,MAAM,SAAO,QAAQ,CAAC,IAAIA,OAAM,SAAS;AAC3F,UAAI,UAAU;AAEZ,eAAOG,QAAO,IAAIH,OAAM,IAAI,CAAC;AAAA,MAC/B,OAAO;AAEL,YAAIE,QAAOF,OAAM,KAAK;AACtB,YAAIE,MAAK,WAAWC,QAAO,MAAM,QAAQ;AACvC,gBAAM,IAAI,eAAeD,MAAK,QAAQC,QAAO,MAAM,MAAM;AAAA,QAC3D;AAGA,YAAIC,OAAMJ,OAAM,IAAI;AACpB,YAAIK,OAAML,OAAM,IAAI;AACpB,iBAASC,KAAI,GAAG,KAAKE,QAAO,MAAM,QAAQF,KAAI,IAAIA,MAAK;AACrD,wBAAcG,KAAIH,EAAC,GAAGE,QAAO,MAAMF,EAAC,CAAC;AACrC,wBAAcI,KAAIJ,EAAC,GAAGE,QAAO,MAAMF,EAAC,CAAC;AAAA,QACvC;AAGA,YAAI,eAAe,IAAIH,aAAY;AACnC,YAAI,YAAY,cAAcK,QAAO,OAAOH,MAAK;AACjD,qBAAa,QAAQ,UAAU;AAC/B,qBAAa,YAAYG,QAAO;AAChC,qBAAa,QAAQ,UAAU;AAC/B,eAAON,QAAO,eAAe,aAAa,QAAQG,OAAM,KAAK,CAAC,IAAI;AAAA,MACpE;AAAA,IACF;AAWA,aAAS,cAAc,MAAMA,QAAO;AAClC,UAAI,WAAWA,OAAM,KAAK,EAAE,SAAS;AACrC,UAAIE,QAAO,MAAM,QAAQ;AACzB,aAAO;AAAA,QACL,MAAM,sBAAsB,IAAI;AAAA,QAChC,MAAMA,MAAK,OAAO,OAAK,MAAM,IAAI;AAAA,MACnC;AACA,eAAS,sBAAsBI,OAAM;AACnC,YAAI,QAAQ,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAChF,YAAI,OAAON,OAAM,UAAU,KAAK;AAChC,iBAAS,UAAU,KAAK,UAAU;AAEhC,cAAI,SAAS,GAAG,EAAG,QAAO,SAAS,GAAG;AAAA,cAAO,QAAO,IAAI,IAAI,QAAQ,EAAE,QAAQ;AAAA,QAChF;AACA,YAAI,SAAS,IAAI,GAAG;AAClB,UAAAE,MAAK,KAAK,IAAI;AAAA,QAChB,OAAO;AACL,UAAAA,MAAK,KAAK,IAAI,KAAK,KAAK,EAAE,CAAC;AAAA,QAC7B;AACA,YAAI,QAAQ,UAAU;AACpB,iBAAO,UAAU,MAAM,cAAY;AACjC,0BAAc,UAAUI,MAAK,MAAM;AACnC,mBAAO,sBAAsBA,MAAK,QAAQ,GAAG,QAAQ,CAAC;AAAA,UACxD,CAAC;AAAA,QACH,OAAO;AACL,iBAAO,UAAU,MAAM,cAAY;AACjC,0BAAc,UAAUA,MAAK,MAAM;AACnC,mBAAOA,MAAK,QAAQ;AAAA,UACtB,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAcA,aAAS,KAAKH,SAAQH,QAAO,WAAW,cAAc;AACpD,UAAI,CAACA,UAASA,OAAM,YAAY,MAAM;AACpC,cAAM,IAAI,UAAU,eAAe;AAAA,MACrC;AAGA,UAAI,QAAQA,OAAM,KAAK;AACvB,UAAI,WAAWA,OAAM,SAAS;AAG9B,UAAI;AACJ,UAAI,SAAS,SAAS,GAAG;AACvB,wBAAgB,UAAU,KAAK;AAC/B,oBAAY,UAAU,QAAQ;AAAA,MAChC,OAAO;AACL,wBAAgB,UAAU,SAAS;AAAA,MACrC;AACA,UAAI,UAAU;AAIZ,YAAI,cAAc,WAAW,GAAG;AAC9B,gBAAM,IAAI,UAAU,iBAAiB;AAAA,QACvC;AACA,QAAAG,QAAO,IAAIH,OAAM,IAAI,GAAG,WAAW,YAAY;AAAA,MACjD,OAAO;AAIL,YAAI,CAAC,gBAAgB,eAAe,KAAK,GAAG;AAC1C,cAAI,cAAc,WAAW,GAAG;AAC9B,wBAAY,YAAY,CAAC,SAAS,GAAG,KAAK;AAAA,UAC5C,OAAO;AACL,gBAAI;AACF,0BAAY,YAAY,WAAW,KAAK;AAAA,YAC1C,SAASO,QAAO;AAAA,YAAC;AAAA,UACnB;AACA,0BAAgB,UAAU,SAAS;AAAA,QACrC;AAGA,YAAI,MAAM,SAASJ,QAAO,MAAM,QAAQ;AACtC,gBAAM,IAAI,eAAe,MAAM,QAAQA,QAAO,MAAM,QAAQ,GAAG;AAAA,QACjE;AACA,YAAI,cAAc,SAAS,MAAM,QAAQ;AAEvC,cAAIF,KAAI;AACR,cAAI,QAAQ;AACZ,iBAAO,MAAMA,EAAC,MAAM,KAAK,cAAcA,EAAC,MAAM,GAAG;AAC/C,YAAAA;AAAA,UACF;AACA,iBAAO,MAAMA,EAAC,MAAM,GAAG;AACrB;AACA,YAAAA;AAAA,UACF;AAGA,sBAAY,UAAU,WAAW,MAAM,QAAQ,OAAO,aAAa;AAAA,QACrE;AAGA,YAAI,CAAC,gBAAgB,OAAO,aAAa,GAAG;AAC1C,gBAAM,IAAI,eAAe,OAAO,eAAe,GAAG;AAAA,QACpD;AAGA,YAAIC,QAAOF,OAAM,IAAI,EAAE,IAAI,SAAUC,IAAG;AACtC,iBAAOA,KAAI;AAAA,QACb,CAAC;AACD,aAAKE,SAAQD,OAAM,YAAY;AAG/B,sBAAcC,QAAO,OAAOH,QAAO,SAAS;AAAA,MAC9C;AACA,aAAOG;AAAA,IACT;AAUA,aAAS,cAAc,MAAMH,QAAO,WAAW;AAC7C,UAAI,WAAWA,OAAM,KAAK,EAAE,SAAS;AACrC,4BAAsB,MAAM,SAAS;AACrC,eAAS,sBAAsBM,OAAME,YAAW;AAC9C,YAAI,QAAQ,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAChF,YAAIC,SAAQT,OAAM,UAAU,KAAK;AACjC,YAAI,oBAAoB,CAAC,YAAYC,OAAM;AACzC,wBAAc,YAAYK,MAAK,MAAM;AACrC,gCAAsBA,MAAK,UAAU,GAAGE,WAAUP,GAAE,CAAC,CAAC,GAAG,QAAQ,CAAC;AAAA,QACpE;AACA,YAAI,gBAAgB,CAAC,YAAYA,OAAM;AACrC,wBAAc,YAAYK,MAAK,MAAM;AACrC,UAAAA,MAAK,UAAU,IAAIE,WAAUP,GAAE,CAAC,CAAC;AAAA,QACnC;AACA,YAAI,QAAQ,UAAU;AACpB,cAAI,SAASQ,MAAK,EAAG,mBAAkBA,QAAO,CAAC,CAAC,CAAC;AAAA,cAAO,CAAAA,OAAM,QAAQ,iBAAiB;AAAA,QACzF,OAAO;AACL,cAAI,SAASA,MAAK,EAAG,eAAcA,QAAO,CAAC,CAAC,CAAC;AAAA,cAAO,CAAAA,OAAM,QAAQ,aAAa;AAAA,QACjF;AAAA,MACF;AAAA,IACF;AAeA,IAAAX,aAAY,UAAU,SAAS,SAAUI,OAAM,cAAc,MAAM;AAEjE,UAAI,CAAC,aAAaA,KAAI,GAAG;AACvB,cAAM,IAAI,UAAU,0BAA0B;AAAA,MAChD;AAGA,UAAI,YAAYA,MAAK,QAAQ,EAAE,IAAI,WAAS;AAC1C,eAAO,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,IAAI;AAAA,MACjE,CAAC;AAGD,UAAI,IAAI,OAAO,KAAK,MAAM,IAAI;AAE9B,aAAOQ,SAAQ,GAAG,WAAW,YAAY;AAAA,IAC3C;AACA,aAASA,SAAQP,SAAQD,OAAM,cAAc;AAE3C,UAAIA,MAAK,WAAW,GAAG;AAErB,YAAI,IAAIC,QAAO;AAEf,eAAO,QAAQ,CAAC,GAAG;AACjB,cAAI,EAAE,CAAC;AAAA,QACT;AACA,eAAO;AAAA,MACT;AAEA,MAAAA,QAAO,QAAQD,MAAK,MAAM,CAAC;AAC3B,MAAAC,QAAO,QAAQ,OAAOA,QAAO,OAAOA,QAAO,OAAO,YAAY;AAE9D,aAAOA;AAAA,IACT;AAgBA,IAAAL,aAAY,UAAU,UAAU,SAAUI,OAAM,MAAM;AACpD,UAAI,IAAI,OAAO,KAAK,MAAM,IAAI;AAC9B,QAAE,QAAQ,QAAQ,EAAE,OAAOA,KAAI;AAC/B,UAAI,gBAAgB,EAAE,MAAM,OAAO,CAAC,QAAQA,UAAS,SAASA,KAAI;AAClE,QAAE,QAAQ,qBAAqBA,OAAM,aAAa;AAClD,aAAO;AAAA,IACT;AAWA,aAAS,KAAKC,SAAQD,OAAM,cAAc;AACxC,UAEA,UAAUC,QAAO,MAAM,MAAM,CAAC;AAC9B,UAAI,UAAU;AAGd,aAAO,QAAQ,SAASD,MAAK,QAAQ;AACnC,gBAAQ,KAAK,CAAC;AACd,kBAAU;AAAA,MACZ;AAGA,eAASD,KAAI,GAAG,KAAKC,MAAK,QAAQD,KAAI,IAAIA,MAAK;AAC7C,YAAIC,MAAKD,EAAC,IAAI,QAAQA,EAAC,GAAG;AACxB,kBAAQA,EAAC,IAAIC,MAAKD,EAAC;AACnB,oBAAU;AAAA,QACZ;AAAA,MACF;AACA,UAAI,SAAS;AAEX,QAAAS,SAAQP,SAAQ,SAAS,YAAY;AAAA,MACvC;AAAA,IACF;AAOA,IAAAL,aAAY,UAAU,QAAQ,WAAY;AACxC,UAAI,IAAI,IAAIA,aAAY;AAAA,QACtB,MAAMC,OAAM,KAAK,KAAK;AAAA,QACtB,MAAMA,OAAM,KAAK,KAAK;AAAA,QACtB,UAAU,KAAK;AAAA,MACjB,CAAC;AACD,aAAO;AAAA,IACT;AAOA,IAAAD,aAAY,UAAU,OAAO,WAAY;AACvC,aAAO,KAAK,MAAM,MAAM,CAAC;AAAA,IAC3B;AAcA,IAAAA,aAAY,UAAU,MAAM,SAAU,UAAU;AAC9C,UAAI,YAAY,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACpF,UAAI,UAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAClF,UAAI,KAAK;AACT,UAAI,WAAW,GAAG,MAAM,SAAS;AACjC,UAAI,WAAW,EAAG,QAAO,GAAG,MAAM;AAClC,UAAI,eAAe,iBAAiB,UAAU,IAAI,OAAO,OAAO;AAChE,UAAI,iBAAiB,aAAa;AAClC,UAAI,SAAS,GAAG,OAAO,QAAW,GAAG,SAAS;AAC9C,aAAO,QAAQ,GAAG;AAClB,UAAI,WAAW,aAAa,SAAS;AACnC,eAAO,QAAQ,aAAa,GAAG,KAAK;AACpC,eAAO;AAAA,MACT;AACA,UAAI,aAAa,GAAG;AAClB,YAAI,YAAY,GAAG,QAAQ;AAC3B,YAAI,OAAO,MAAM,UAAU,MAAM;AACjC,iBAASG,KAAI,GAAGA,KAAI,UAAU,QAAQA,MAAK;AACzC,eAAKA,EAAC,IAAI,eAAe,UAAUA,EAAC,GAAG,CAACA,EAAC,GAAG,EAAE;AAAA,QAChD;AACA,eAAO,QAAQ;AACf,eAAO;AAAA,MACT;AACA,UAAID,SAAQ,CAAC;AACb,aAAO,QAAQ,QAAQ,GAAG,KAAK;AAC/B,aAAO;AACP,eAAS,QAAQM,OAAM;AACrB,YAAI,QAAQ,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAChF,YAAIK,UAAS,MAAML,MAAK,MAAM;AAC9B,YAAI,QAAQ,UAAU;AACpB,mBAAS,KAAK,GAAG,KAAKA,MAAK,QAAQ,MAAM;AACvC,YAAAN,OAAM,KAAK,IAAI;AACf,YAAAW,QAAO,EAAE,IAAI,QAAQL,MAAK,EAAE,GAAG,QAAQ,CAAC;AAAA,UAC1C;AAAA,QACF,OAAO;AACL,mBAAS,MAAM,GAAG,MAAMA,MAAK,QAAQ,OAAO;AAC1C,YAAAN,OAAM,KAAK,IAAI;AACf,YAAAW,QAAO,GAAG,IAAI,eAAeL,MAAK,GAAG,GAAGN,OAAM,MAAM,GAAG,EAAE;AAAA,UAC3D;AAAA,QACF;AACA,eAAOW;AAAA,MACT;AACA,eAAS,aAAaL,OAAM;AAC1B,YAAI,QAAQ,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAChF,YAAIK,UAAS,MAAML,MAAK,MAAM;AAC9B,YAAI,QAAQ,UAAU;AACpB,mBAAS,MAAM,GAAG,MAAMA,MAAK,QAAQ,OAAO;AAC1C,YAAAK,QAAO,GAAG,IAAI,aAAaL,MAAK,GAAG,GAAG,QAAQ,CAAC;AAAA,UACjD;AAAA,QACF,OAAO;AACL,mBAAS,MAAM,GAAG,MAAMA,MAAK,QAAQ,OAAO;AAC1C,YAAAK,QAAO,GAAG,IAAI,eAAeL,MAAK,GAAG,CAAC;AAAA,UACxC;AAAA,QACF;AACA,eAAOK;AAAA,MACT;AAAA,IACF;AAWA,IAAAb,aAAY,UAAU,UAAU,SAAU,UAAU;AAClD,UAAI,YAAY,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACpF,UAAI,UAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAClF,UAAI,KAAK;AACT,UAAI,WAAW,GAAG,MAAM,SAAS;AACjC,UAAI,WAAW,EAAG;AAClB,UAAI,eAAe,iBAAiB,UAAU,IAAI,OAAO,OAAO;AAChE,UAAI,iBAAiB,aAAa;AAClC,UAAI,WAAW,aAAa,SAAS;AACnC,qBAAa,GAAG,KAAK;AACrB;AAAA,MACF;AACA,UAAI,aAAa,GAAG;AAClB,iBAASG,KAAI,GAAGA,KAAI,GAAG,MAAM,QAAQA,MAAK;AACxC,yBAAe,GAAG,MAAMA,EAAC,GAAG,CAACA,EAAC,GAAG,EAAE;AAAA,QACrC;AACA;AAAA,MACF;AACA,UAAID,SAAQ,CAAC;AACb,cAAQ,GAAG,KAAK;AAChB,eAAS,QAAQ,MAAM;AACrB,YAAI,QAAQ,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAChF,YAAI,QAAQ,UAAU;AACpB,mBAAS,MAAM,GAAG,MAAM,KAAK,QAAQ,OAAO;AAC1C,YAAAA,OAAM,KAAK,IAAI;AACf,oBAAQ,KAAK,GAAG,GAAG,QAAQ,CAAC;AAAA,UAC9B;AAAA,QACF,OAAO;AACL,mBAAS,MAAM,GAAG,MAAM,KAAK,QAAQ,OAAO;AAC1C,YAAAA,OAAM,KAAK,IAAI;AACf,2BAAe,KAAK,GAAG,GAAGA,OAAM,MAAM,GAAG,EAAE;AAAA,UAC7C;AAAA,QACF;AAAA,MACF;AACA,eAAS,aAAa,MAAM;AAC1B,YAAI,QAAQ,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAChF,YAAI,QAAQ,UAAU;AACpB,mBAAS,MAAM,GAAG,MAAM,KAAK,QAAQ,OAAO;AAC1C,yBAAa,KAAK,GAAG,GAAG,QAAQ,CAAC;AAAA,UACnC;AAAA,QACF,OAAO;AACL,mBAAS,MAAM,GAAG,MAAM,KAAK,QAAQ,OAAO;AAC1C,2BAAe,KAAK,GAAG,CAAC;AAAA,UAC1B;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAMA,IAAAF,aAAY,UAAU,OAAO,QAAQ,IAAI,aAAa;AACpD,UAAI,WAAW,KAAK,MAAM,SAAS;AACnC,UAAI,WAAW,GAAG;AAChB;AAAA,MACF;AACA,UAAI,aAAa,GAAG;AAClB,iBAASG,KAAI,GAAGA,KAAI,KAAK,MAAM,QAAQA,MAAK;AAC1C,gBAAM;AAAA,YACJ,OAAO,KAAK,MAAMA,EAAC;AAAA,YACnB,OAAO,CAACA,EAAC;AAAA,UACX;AAAA,QACF;AACA;AAAA,MACF;AAGA,UAAID,SAAQ,MAAM,WAAW,CAAC,EAAE,KAAK,CAAC;AACtC,UAAI,gBAAgB,KAAK,MAAM,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AACxD,eAASY,SAAQ,GAAGA,SAAQ,eAAeA,UAAS;AAElD,YAAI,UAAU,KAAK;AACnB,iBAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AACjC,oBAAU,QAAQZ,OAAM,CAAC,CAAC;AAAA,QAC5B;AACA,cAAM;AAAA,UACJ,OAAO,QAAQA,OAAM,QAAQ,CAAC;AAAA,UAC9B,OAAOA,OAAM,MAAM;AAAA,QACrB;AAGA,iBAAS,KAAK,UAAU,MAAM,GAAG,MAAM;AACrC,UAAAA,OAAM,EAAE;AACR,cAAIA,OAAM,EAAE,IAAI,KAAK,MAAM,EAAE,EAAG;AAChC,UAAAA,OAAM,EAAE,IAAI;AAAA,QACd;AAAA,MACF;AAAA,IACF;AAMA,IAAAF,aAAY,UAAU,OAAO,WAAY;AACvC,UAAI,SAAS,CAAC;AACd,UAAI,IAAI,KAAK,KAAK;AAClB,UAAI,EAAE,WAAW,GAAG;AAClB,cAAM,IAAI,UAAU,4CAA4C;AAAA,MAClE;AACA,UAAI,OAAO,KAAK;AAChB,eAASe,QAAO,MAAM;AACpB,eAAO,KAAK,IAAIf,aAAY,CAACe,IAAG,GAAG,KAAK,SAAS,CAAC;AAAA,MACpD;AACA,aAAO;AAAA,IACT;AAMA,IAAAf,aAAY,UAAU,UAAU,WAAY;AAC1C,UAAI,QAAQ;AACZ,UAAI,SAAS,CAAC;AACd,UAAI,IAAI,KAAK,KAAK;AAClB,UAAI,EAAE,WAAW,GAAG;AAClB,cAAM,IAAI,UAAU,4CAA4C;AAAA,MAClE;AACA,UAAI,OAAO,KAAK;AAChB,UAAI,QAAQ,SAASgB,OAAMb,IAAG;AAC5B,YAAI,MAAM,KAAK,IAAI,CAAAY,SAAO,CAACA,KAAIZ,EAAC,CAAC,CAAC;AAClC,eAAO,KAAK,IAAIH,aAAY,KAAK,MAAM,SAAS,CAAC;AAAA,MACnD;AACA,eAASG,KAAI,GAAGA,KAAI,EAAE,CAAC,GAAGA,MAAK;AAC7B,cAAMA,EAAC;AAAA,MACT;AACA,aAAO;AAAA,IACT;AAOA,IAAAH,aAAY,UAAU,UAAU,WAAY;AAC1C,aAAOC,OAAM,KAAK,KAAK;AAAA,IACzB;AAOA,IAAAD,aAAY,UAAU,UAAU,WAAY;AAC1C,aAAO,KAAK;AAAA,IACd;AAWA,IAAAA,aAAY,UAAU,SAAS,SAAU,SAAS;AAChD,aAAOiB,QAAO,KAAK,OAAO,OAAO;AAAA,IACnC;AAOA,IAAAjB,aAAY,UAAU,WAAW,WAAY;AAC3C,aAAOiB,QAAO,KAAK,KAAK;AAAA,IAC1B;AAOA,IAAAjB,aAAY,UAAU,SAAS,WAAY;AACzC,aAAO;AAAA,QACL,QAAQ;AAAA,QACR,MAAM,KAAK;AAAA,QACX,MAAM,KAAK;AAAA,QACX,UAAU,KAAK;AAAA,MACjB;AAAA,IACF;AAUA,IAAAA,aAAY,UAAU,WAAW,SAAU,GAAG;AAE5C,UAAI,GAAG;AAEL,YAAI,YAAY,CAAC,GAAG;AAClB,cAAI,EAAE,SAAS;AAAA,QACjB;AAEA,YAAI,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AACjC,gBAAM,IAAI,UAAU,2CAA2C;AAAA,QACjE;AAAA,MACF,OAAO;AAEL,YAAI;AAAA,MACN;AACA,UAAI,SAAS,IAAI,IAAI,IAAI;AACzB,UAAI,OAAO,IAAI,IAAI,CAAC,IAAI;AAGxB,UAAI,OAAO,KAAK,MAAM,CAAC;AACvB,UAAI,UAAU,KAAK,MAAM,CAAC;AAG1B,UAAI,IAAI,KAAK,IAAI,OAAO,MAAM,UAAU,MAAM;AAG9C,UAAI,OAAO,CAAC;AAGZ,eAASG,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,aAAKA,EAAC,IAAI,KAAK,MAAMA,KAAI,IAAI,EAAEA,KAAI,MAAM;AAAA,MAC3C;AAGA,aAAO,IAAIH,aAAY;AAAA,QACrB;AAAA,QACA,MAAM,CAAC,CAAC;AAAA,QACR,UAAU,KAAK;AAAA,MACjB,CAAC;AAAA,IACH;AAcA,IAAAA,aAAY,WAAW,SAAUI,OAAM,OAAO,GAAG,cAAc;AAC7D,UAAI,CAAC,QAAQA,KAAI,GAAG;AAClB,cAAM,IAAI,UAAU,gCAAgC;AAAA,MACtD;AACA,UAAIA,MAAK,WAAW,GAAG;AACrB,cAAM,IAAI,MAAM,0CAA0C;AAAA,MAC5D;AAGA,MAAAA,QAAOA,MAAK,IAAI,SAAU,GAAG;AAE3B,YAAI,YAAY,CAAC,GAAG;AAElB,cAAI,EAAE,SAAS;AAAA,QACjB;AAEA,YAAI,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,IAAI,GAAG;AAC1C,gBAAM,IAAI,MAAM,uCAAuC;AAAA,QACzD;AACA,eAAO;AAAA,MACT,CAAC;AAGD,UAAI,GAAG;AAEL,YAAI,YAAY,CAAC,GAAG;AAClB,cAAI,EAAE,SAAS;AAAA,QACjB;AAEA,YAAI,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AACjC,gBAAM,IAAI,UAAU,2CAA2C;AAAA,QACjE;AAAA,MACF,OAAO;AAEL,YAAI;AAAA,MACN;AACA,UAAI,SAAS,IAAI,IAAI,IAAI;AACzB,UAAI,OAAO,IAAI,IAAI,CAAC,IAAI;AAGxB,UAAI,OAAOA,MAAK,CAAC;AACjB,UAAI,UAAUA,MAAK,CAAC;AAGpB,UAAI,IAAI,KAAK,IAAI,OAAO,MAAM,UAAU,MAAM;AAG9C,UAAI;AAGJ,UAAI,QAAQ,KAAK,GAAG;AAElB,YAAI,MAAM,WAAW,GAAG;AAEtB,gBAAM,IAAI,MAAM,4BAA4B;AAAA,QAC9C;AAEA,iBAAS,SAASc,QAAOf,IAAG;AAE1B,iBAAO,MAAMA,EAAC;AAAA,QAChB;AAAA,MACF,WAAW,SAAS,KAAK,GAAG;AAE1B,YAAI,KAAK,MAAM,KAAK;AAEpB,YAAI,GAAG,WAAW,KAAK,GAAG,CAAC,MAAM,GAAG;AAElC,gBAAM,IAAI,MAAM,uBAAuB;AAAA,QACzC;AAEA,iBAAS,SAASe,QAAOf,IAAG;AAE1B,iBAAO,MAAM,IAAI,CAACA,EAAC,CAAC;AAAA,QACtB;AAAA,MACF,OAAO;AAEL,iBAAS,SAASe,UAAS;AAEzB,iBAAO;AAAA,QACT;AAAA,MACF;AAGA,UAAI,CAAC,cAAc;AAEjB,uBAAe,YAAY,OAAO,CAAC,CAAC,IAAI,OAAO,CAAC,EAAE,IAAI,CAAC,IACrD;AAAA,MACJ;AAGA,UAAI,OAAO,CAAC;AAGZ,UAAId,MAAK,SAAS,GAAG;AAEnB,eAAO,OAAO,MAAMA,OAAM,YAAY;AAEtC,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,eAAK,IAAI,IAAI,EAAE,IAAI,MAAM,IAAI,OAAO,CAAC;AAAA,QACvC;AAAA,MACF;AAGA,aAAO,IAAIJ,aAAY;AAAA,QACrB;AAAA,QACA,MAAM,CAAC,MAAM,OAAO;AAAA,MACtB,CAAC;AAAA,IACH;AAUA,IAAAA,aAAY,WAAW,SAAU,MAAM;AACrC,aAAO,IAAIA,aAAY,IAAI;AAAA,IAC7B;AAWA,IAAAA,aAAY,UAAU,WAAW,SAAUG,IAAG,GAAG;AAE/C,UAAI,CAAC,SAASA,EAAC,KAAK,CAAC,UAAUA,EAAC,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AAClE,cAAM,IAAI,MAAM,qCAAqC;AAAA,MACvD;AAEA,UAAI,KAAK,MAAM,WAAW,GAAG;AAC3B,cAAM,IAAI,MAAM,0CAA0C;AAAA,MAC5D;AAEA,oBAAcA,IAAG,KAAK,MAAM,CAAC,CAAC;AAC9B,oBAAc,GAAG,KAAK,MAAM,CAAC,CAAC;AAG9B,MAAAH,aAAY,UAAUG,IAAG,GAAG,KAAK,KAAK;AAEtC,aAAO;AAAA,IACT;AASA,IAAAH,aAAY,YAAY,SAAUG,IAAG,GAAG,MAAM;AAE5C,UAAI,KAAK,KAAKA,EAAC;AACf,WAAKA,EAAC,IAAI,KAAK,CAAC;AAChB,WAAK,CAAC,IAAI;AAAA,IACZ;AASA,aAAS,WAAW,MAAM;AACxB,UAAI,SAAS,IAAI,GAAG;AAClB,eAAO,WAAW,KAAK,QAAQ,CAAC;AAAA,MAClC;AACA,UAAI,QAAQ,IAAI,GAAG;AACjB,eAAO,KAAK,IAAI,UAAU;AAAA,MAC5B;AACA,aAAO;AAAA,IACT;AACA,WAAOH;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,EACX,CAAC;;;ACnhCD,MAAImB,QAAO;AACX,MAAIC,gBAAe,CAAC,OAAO;AACpB,MAAI,cAA6B,wBAAQD,OAAMC,eAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAmBJ,WAAOA,OAAMF,OAAM;AAAA,MACjB,KAAKG;AAAA,IACP,CAAC;AAAA,EACH,CAAC;;;ACvBM,WAAS,QAAQ,KAAK;AAC3B,QAAI,IAAI,IAAI;AACZ,QAAI,IAAI,IAAI,CAAC,EAAE;AACf,QAAIC,IAAG;AACP,QAAI,MAAM,CAAC;AACX,SAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AACtB,UAAI,MAAM,CAAC;AACX,WAAKA,KAAI,GAAGA,KAAI,GAAGA,MAAK;AACtB,YAAI,KAAK,IAAIA,EAAC,EAAE,CAAC,CAAC;AAAA,MACpB;AACA,UAAI,KAAK,GAAG;AAAA,IACd;AACA,WAAO;AAAA,EACT;;;ACRO,WAAS,oBAAoB,OAAO;AACzC,aAASC,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AACrC,UAAI,aAAa,MAAMA,EAAC,CAAC,GAAG;AAC1B,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AASO,WAASC,aAAY,OAAO,UAAU;AAC3C,QAAI,SAAS,KAAK,GAAG;AACnB,YAAM,QAAQ,OAAK,SAAS,CAAC,GAAG,OAAO,IAAI;AAAA,IAC7C,OAAO;AACL,kBAAiB,OAAO,UAAU,IAAI;AAAA,IACxC;AAAA,EACF;AAcO,WAASC,SAAQ,OAAO,UAAU,WAAW;AAClD,QAAI,CAAC,WAAW;AACd,UAAI,SAAS,KAAK,GAAG;AACnB,eAAO,MAAM,IAAI,OAAK,SAAS,CAAC,GAAG,OAAO,IAAI;AAAA,MAChD,OAAO;AACL,eAAO,QAAa,OAAO,UAAU,IAAI;AAAA,MAC3C;AAAA,IACF;AACA,QAAI,oBAAoB,OAAK,MAAM,IAAI,IAAI,SAAS,CAAC;AACrD,QAAI,SAAS,KAAK,GAAG;AACnB,aAAO,MAAM,IAAI,OAAK,kBAAkB,CAAC,GAAG,OAAO,IAAI;AAAA,IACzD,OAAO;AACL,aAAO,QAAa,OAAO,mBAAmB,IAAI;AAAA,IACpD;AAAA,EACF;AAWO,WAAS,OAAO,KAAK,KAAK,UAAU;AACzC,QAAIC,QAAO,MAAM,QAAQ,GAAG,IAAI,UAAU,GAAG,IAAI,IAAI,KAAK;AAC1D,QAAI,MAAM,KAAK,OAAOA,MAAK,QAAQ;AAEjC,YAAM,IAAI,WAAW,KAAKA,MAAK,MAAM;AAAA,IACvC;AACA,QAAI,SAAS,GAAG,GAAG;AACjB,aAAO,IAAI,OAAO,QAAQ,IAAI,QAAQ,GAAG,KAAK,QAAQ,GAAG,IAAI,SAAS,CAAC;AAAA,IACzE,OAAO;AACL,aAAO,QAAQ,KAAK,KAAK,QAAQ;AAAA,IACnC;AAAA,EACF;AAUA,WAAS,QAAQ,KAAK,KAAK,UAAU;AACnC,QAAIH,IAAG,KAAK,KAAK;AACjB,QAAI,OAAO,GAAG;AACZ,UAAI,CAAC,MAAM,QAAQ,IAAI,CAAC,CAAC,GAAG;AAC1B,cAAM,IAAI,CAAC;AACX,aAAKA,KAAI,GAAGA,KAAI,IAAI,QAAQA,MAAK;AAC/B,gBAAM,SAAS,KAAK,IAAIA,EAAC,CAAC;AAAA,QAC5B;AACA,eAAO;AAAA,MACT,OAAO;AACL,eAAO,QAAQ,GAAG;AAClB,cAAM,CAAC;AACP,aAAKA,KAAI,GAAGA,KAAI,KAAK,QAAQA,MAAK;AAChC,cAAIA,EAAC,IAAI,QAAQ,KAAKA,EAAC,GAAG,MAAM,GAAG,QAAQ;AAAA,QAC7C;AACA,eAAO;AAAA,MACT;AAAA,IACF,OAAO;AACL,YAAM,CAAC;AACP,WAAKA,KAAI,GAAGA,KAAI,IAAI,QAAQA,MAAK;AAC/B,YAAIA,EAAC,IAAI,QAAQ,IAAIA,EAAC,GAAG,MAAM,GAAG,QAAQ;AAAA,MAC5C;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAGO,WAAS,QAAQ,GAAG,GAAG,GAAG,GAAG,GAAG,MAAM,QAAQ,GAAG,SAAS,QAAQ,OAAO;AAE9E,QAAI,UAAU,EAAE;AAChB,QAAI,SAAS,EAAE;AACf,QAAI,OAAO,EAAE;AAGb,QAAI,GAAG,IAAI,IAAIA;AAGf,QAAI,GAAG;AAEL,WAAK,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAExD,QAAAA,KAAI,OAAO,CAAC;AAEZ,YAAI,EAAEA,EAAC,MAAM,MAAM;AAEjB,YAAEA,EAAC,IAAI;AAEP,iBAAO,KAAKA,EAAC;AAEb,cAAI,QAAQ;AAEV,cAAEA,EAAC,IAAI,UAAU,EAAE,QAAQ,CAAC,GAAG,KAAK,IAAI,EAAE,OAAO,QAAQ,CAAC,CAAC;AAE3D,cAAEA,EAAC,IAAI;AAAA,UACT,OAAO;AAEL,cAAEA,EAAC,IAAI,QAAQ,CAAC;AAAA,UAClB;AAAA,QACF,OAAO;AAEL,YAAEA,EAAC,IAAI,UAAU,EAAE,QAAQ,CAAC,GAAG,EAAEA,EAAC,CAAC,IAAI,EAAE,EAAEA,EAAC,GAAG,QAAQ,CAAC,CAAC;AAEzD,YAAEA,EAAC,IAAI;AAAA,QACT;AAAA,MACF;AAAA,IACF,OAAO;AAEL,WAAK,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAExD,QAAAA,KAAI,OAAO,CAAC;AAEZ,YAAI,EAAEA,EAAC,MAAM,MAAM;AAEjB,YAAEA,EAAC,IAAI;AAEP,iBAAO,KAAKA,EAAC;AAAA,QACf,OAAO;AAEL,YAAEA,EAAC,IAAI;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAAA,EACF;;;AC7KA,MAAII,QAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,OAAO;AAC7B,MAAI,kBAAiC,wBAAQD,OAAMC,gBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,OAAAC;AAAA,IACF,IAAI;AA8BJ,WAAOD,OAAMF,OAAM;AAAA,MACjB,QAAQ,OAAK,OAAO,SAAS,CAAC,IAAIG,OAAM,GAAG,KAAK,MAAM,CAAC,CAAC,IAAI;AAAA,MAC5D,WAAW,OAAK,EAAE,SAAS,IAAIA,OAAM,EAAE,MAAM,GAAG,CAAC,IAAI;AAAA,MACrD,QAAQ,OAAK;AAAA,MACb,UAAU,OAAK,EAAE,MAAM;AAAA,MACvB,kBAAkBD,OAAM,YAAY,CAAAE,UAAQ,OAAKC,SAAQ,GAAGD,KAAI,CAAC;AAAA,IACnE,CAAC;AAAA,EACH,CAAC;;;AC5CD,MAAI,KAAK;AACT,MAAI,KAAK;AACF,WAAS,UAAU,GAAG;AAC3B,WAAO,KAAK,IAAI,CAAC;AAAA,EACnB;AACA,YAAU,YAAY;AACf,WAAS,UAAU,GAAG,GAAG;AAC9B,WAAO,IAAI;AAAA,EACb;AACA,YAAU,YAAY;AACf,WAAS,eAAe,GAAG,GAAG;AACnC,WAAO,IAAI;AAAA,EACb;AACA,iBAAe,YAAY;AACpB,WAAS,eAAe,GAAG,GAAG;AACnC,WAAO,IAAI;AAAA,EACb;AACA,iBAAe,YAAY;AACpB,WAAS,aAAa,GAAG,GAAG;AACjC,WAAO,IAAI;AAAA,EACb;AACA,eAAa,YAAY;AAClB,WAAS,iBAAiB,GAAG;AAClC,WAAO,CAAC;AAAA,EACV;AACA,mBAAiB,YAAY;AACtB,WAAS,gBAAgB,GAAG;AACjC,WAAO;AAAA,EACT;AACA,kBAAgB,YAAY;AACrB,WAAS,WAAW,GAAG;AAC5B,WAAO,KAAK,CAAC;AAAA,EACf;AACA,aAAW,YAAY;AAChB,WAAS,WAAW,GAAG;AAC5B,WAAO,IAAI,IAAI;AAAA,EACjB;AACA,aAAW,YAAY;AAChB,WAAS,UAAU,GAAG;AAC3B,WAAO,KAAK,IAAI,CAAC;AAAA,EACnB;AACA,YAAU,YAAY;AACf,WAAS,YAAY,GAAG;AAC7B,WAAO,MAAM,CAAC;AAAA,EAChB;AACA,cAAY,YAAY;AAQjB,WAAS,UAAU,GAAG,GAAG;AAC9B,QAAI,CAAC,UAAU,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AAClC,YAAM,IAAI,MAAM,oDAAoD;AAAA,IACtE;AAGA,QAAI;AACJ,WAAO,MAAM,GAAG;AACd,UAAI,IAAI;AACR,UAAI;AACJ,UAAI;AAAA,IACN;AACA,WAAO,IAAI,IAAI,CAAC,IAAI;AAAA,EACtB;AACA,YAAU,YAAY;AAQf,WAAS,UAAU,GAAG,GAAG;AAC9B,QAAI,CAAC,UAAU,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AAClC,YAAM,IAAI,MAAM,oDAAoD;AAAA,IACtE;AACA,QAAI,MAAM,KAAK,MAAM,GAAG;AACtB,aAAO;AAAA,IACT;AAIA,QAAI;AACJ,QAAIE,QAAO,IAAI;AACf,WAAO,MAAM,GAAG;AACd,UAAI;AACJ,UAAI,IAAI;AACR,UAAI;AAAA,IACN;AACA,WAAO,KAAK,IAAIA,QAAO,CAAC;AAAA,EAC1B;AACA,YAAU,YAAY;AAQf,WAAS,UAAU,GAAG,GAAG;AAC9B,QAAI,GAAG;AACL,aAAO,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;AAAA,IACjC;AACA,WAAO,KAAK,IAAI,CAAC;AAAA,EACnB;AAOO,WAAS,YAAY,GAAG;AAC7B,WAAO,MAAM,CAAC;AAAA,EAChB;AACA,cAAY,YAAY;AAOjB,WAAS,WAAW,GAAG;AAC5B,WAAO,KAAK,CAAC;AAAA,EACf;AACA,aAAW,YAAY;AAOhB,WAAS,YAAY,GAAG;AAC7B,WAAO,MAAM,CAAC;AAAA,EAChB;AACA,cAAY,YAAY;AASjB,WAAS,UAAU,GAAG,GAAG;AAI9B,WAAO,MAAM,IAAI,IAAI,IAAI,IAAI,KAAK,MAAM,IAAI,CAAC;AAAA,EAC/C;AACA,YAAU,YAAY;AASf,WAAS,cAAc,GAAG;AAC/B,QAAI,OAAO,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAC/E,QAAIC,OAAM,OAAO;AACjB,QAAIA,MAAK;AACP,aAAO,CAAC;AAAA,IACV;AACA,QAAI,SAAS,GAAG;AACd,YAAM,IAAI,MAAM,uBAAuB;AAAA,IACzC;AACA,QAAI,IAAI,KAAK,KAAK,IAAI,IAAI,IAAI,MAAM,GAAG;AACrC,YAAM,IAAI,MAAM,sCAAsC;AAAA,IACxD;AAGA,QAAI,MAAM,GAAG;AACX,aAAOA,OAAM,WAAW;AAAA,IAC1B;AACA,QAAI,CAAC,SAAS,CAAC,GAAG;AAChB,aAAOA,OAAM,IAAI;AAAA,IACnB;AACA,QAAI,IAAI,KAAK,IAAI,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI;AAGtC,QAAI,IAAI,IAAI,CAAC,IAAI;AACjB,WAAOA,OAAM,IAAI,IAAI;AAAA,EAsBvB;AACO,WAAS,WAAW,GAAG;AAC5B,WAAO,KAAK,CAAC;AAAA,EACf;AACA,aAAW,YAAY;AAChB,WAAS,WAAW,GAAG;AAC5B,WAAO,KAAK,KAAK,CAAC;AAAA,EACpB;AACA,aAAW,YAAY;AAChB,WAAS,aAAa,GAAG;AAC9B,WAAO,IAAI;AAAA,EACb;AACA,eAAa,YAAY;AASlB,WAAS,WAAW,GAAG,GAAG;AAE/B,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI,IAAI;AACR,QAAI,QAAQ;AACZ,QAAI,IAAI;AACR,QAAI,QAAQ;AACZ,QAAI,CAAC,UAAU,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AAClC,YAAM,IAAI,MAAM,qDAAqD;AAAA,IACvE;AACA,WAAO,GAAG;AACR,UAAI,KAAK,MAAM,IAAI,CAAC;AACpB,UAAI,IAAI,IAAI;AACZ,UAAI;AACJ,UAAI,QAAQ,IAAI;AAChB,cAAQ;AACR,UAAI;AACJ,UAAI,QAAQ,IAAI;AAChB,cAAQ;AACR,UAAI;AACJ,UAAI;AAAA,IACN;AACA,QAAI;AACJ,QAAI,IAAI,GAAG;AACT,YAAM,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK;AAAA,IAC3B,OAAO;AACL,YAAM,CAAC,GAAG,IAAI,QAAQ,GAAG,KAAK;AAAA,IAChC;AACA,WAAO;AAAA,EACT;AACA,aAAW,YAAY;AAQhB,WAAS,UAAU,GAAG,GAAG;AAG9B,QAAI,IAAI,IAAI,KAAK,MAAM,YAAY,IAAI,IAAI,KAAK,MAAM,WAAW;AAC/D,aAAO;AAAA,IACT;AACA,WAAO,KAAK,IAAI,GAAG,CAAC;AAAA,EACtB;AACA,YAAU,YAAY;AASf,WAAS,YAAY,OAAO;AACjC,QAAI,WAAW,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACnF,QAAI,CAAC,UAAU,QAAQ,KAAK,WAAW,KAAK,WAAW,IAAI;AACzD,YAAM,IAAI,MAAM,gFAAgF;AAAA,IAClG;AACA,WAAO,WAAW,QAAQ,OAAO,QAAQ,CAAC;AAAA,EAC5C;AAOO,WAAS,WAAW,GAAG;AAC5B,WAAO,KAAK,IAAI,CAAC;AAAA,EACnB;AACA,aAAW,YAAY;;;AC7SvB,MAAIC,MAAK;AACT,MAAIC,MAAK;AACF,WAAS,aAAa,GAAG,GAAG;AACjC,QAAI,CAAC,UAAU,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AAClC,YAAM,IAAI,MAAM,sCAAsC;AAAA,IACxD;AACA,WAAO,IAAI;AAAA,EACb;AACA,eAAa,YAAYA;AAClB,WAAS,aAAa,GAAG;AAC9B,QAAI,CAAC,UAAU,CAAC,GAAG;AACjB,YAAM,IAAI,MAAM,qCAAqC;AAAA,IACvD;AACA,WAAO,CAAC;AAAA,EACV;AACA,eAAa,YAAYD;AAClB,WAAS,YAAY,GAAG,GAAG;AAChC,QAAI,CAAC,UAAU,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AAClC,YAAM,IAAI,MAAM,qCAAqC;AAAA,IACvD;AACA,WAAO,IAAI;AAAA,EACb;AACA,cAAY,YAAYC;AACjB,WAAS,aAAa,GAAG,GAAG;AACjC,QAAI,CAAC,UAAU,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AAClC,YAAM,IAAI,MAAM,sCAAsC;AAAA,IACxD;AACA,WAAO,IAAI;AAAA,EACb;AACA,eAAa,YAAYA;AAClB,WAAS,gBAAgB,GAAG,GAAG;AACpC,QAAI,CAAC,UAAU,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AAClC,YAAM,IAAI,MAAM,yCAAyC;AAAA,IAC3D;AACA,WAAO,KAAK;AAAA,EACd;AACA,kBAAgB,YAAYA;AACrB,WAAS,sBAAsB,GAAG,GAAG;AAC1C,QAAI,CAAC,UAAU,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AAClC,YAAM,IAAI,MAAM,+CAA+C;AAAA,IACjE;AACA,WAAO,KAAK;AAAA,EACd;AACA,wBAAsB,YAAYA;AAC3B,WAAS,oBAAoB,GAAG,GAAG;AACxC,QAAI,CAAC,UAAU,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AAClC,YAAM,IAAI,MAAM,6CAA6C;AAAA,IAC/D;AACA,WAAO,MAAM;AAAA,EACf;AACA,sBAAoB,YAAYA;;;AC/CzB,WAASC,SAAQC,IAAG,GAAG;AAC5B,QAAI,IAAIA,IAAG;AACT,aAAO;AAAA,IACT;AACA,QAAI,MAAMA,IAAG;AACX,aAAO;AAAA,IACT;AACA,QAAI,OAAO,IAAIA,MAAK;AACpB,WAAOD,SAAQC,IAAG,IAAI,IAAID,SAAQ,OAAO,GAAG,CAAC;AAAA,EAC/C;;;ACXO,WAAS,mBAAmB,GAAG,GAAG;AACvC,QAAI,CAAC,UAAU,CAAC,KAAK,IAAI,GAAG;AAC1B,YAAM,IAAI,UAAU,0DAA0D;AAAA,IAChF;AACA,QAAI,CAAC,UAAU,CAAC,KAAK,IAAI,GAAG;AAC1B,YAAM,IAAI,UAAU,0DAA0D;AAAA,IAChF;AACA,QAAI,IAAI,GAAG;AACT,YAAM,IAAI,UAAU,mCAAmC;AAAA,IACzD;AACA,QAAI,UAAU,IAAI;AAClB,QAAI,SAAS;AACb,QAAI,iBAAiB,IAAI,UAAU,UAAU,IAAI,IAAI;AACrD,QAAI,cAAc;AAClB,QAAI,cAAc,IAAI,UAAU,IAAI;AAGpC,aAAS,gBAAgB,gBAAgB,iBAAiB,GAAG,EAAE,eAAe;AAC5E,gBAAU;AACV,aAAO,eAAe,eAAe,SAAS,gBAAgB,GAAG;AAC/D,kBAAU;AACV,UAAE;AAAA,MACJ;AAAA,IACF;AAEA,QAAI,eAAe,aAAa;AAC9B,gBAAUE,SAAQ,aAAa,WAAW;AAAA,IAC5C;AACA,WAAO;AAAA,EACT;AACA,qBAAmB,YAAY;;;AChCxB,MAAI,KAAK,KAAK;AACd,MAAI,MAAM,IAAI,KAAK;AACnB,MAAI,IAAI,KAAK;AACb,MAAI,MAAM;;;ACHjB,MAAIC,MAAK;AACT,MAAIC,MAAK;AACF,WAAS,UAAU,GAAG;AAC3B,WAAO,CAAC;AAAA,EACV;AACA,YAAU,YAAYD;AACf,WAAS,SAAS,GAAG,GAAG;AAC7B,WAAO,CAAC,EAAE,KAAK;AAAA,EACjB;AACA,WAAS,YAAYC;AACd,WAAS,UAAU,GAAG,GAAG;AAC9B,WAAO,CAAC,CAAC,MAAM,CAAC,CAAC;AAAA,EACnB;AACA,YAAU,YAAYA;AACf,WAAS,UAAU,GAAG,GAAG;AAC9B,WAAO,CAAC,EAAE,KAAK;AAAA,EACjB;AACA,YAAU,YAAYA;;;ACbf,WAAS,YAAY,GAAG;AAC7B,QAAI;AACJ,QAAI,UAAU,CAAC,GAAG;AAChB,UAAI,KAAK,GAAG;AACV,eAAO,OAAO,SAAS,CAAC,IAAI,WAAW;AAAA,MACzC;AACA,UAAI,IAAI,KAAK;AACX,eAAO;AAAA,MACT;AACA,aAAOC,SAAQ,GAAG,IAAI,CAAC;AAAA,IACzB;AACA,QAAI,IAAI,KAAK;AACX,aAAO,KAAK,MAAM,KAAK,IAAI,KAAK,KAAK,CAAC,IAAI,YAAY,IAAI,CAAC;AAAA,IAC7D;AACA,QAAI,KAAK,QAAQ;AACf,aAAO;AAAA,IACT;AACA,QAAI,IAAI,IAAM;AAEZ,UAAI,OAAO,IAAI;AACf,UAAI,SAAS,OAAO;AACpB,UAAI,QAAQ,SAAS;AACrB,UAAI,QAAQ,QAAQ;AACpB,aAAO,KAAK,KAAK,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,IAAI,IAAI,KAAK,GAAG,CAAC,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,MAAM,QAAQ,OAAO,QAAQ,UAAU,OAAO,UAAU,SAAS,UAAU,YAAY,SAAS,WAAW,cAAc,QAAQ;AAAA,IAC1N;AACA,MAAE;AACF,QAAI,OAAO,CAAC;AACZ,aAASC,KAAI,GAAGA,KAAI,OAAO,QAAQ,EAAEA,IAAG;AACtC,WAAK,OAAOA,EAAC,KAAK,IAAIA;AAAA,IACxB;AACA,QAAI,IAAI,IAAI,SAAS;AACrB,WAAO,KAAK,KAAK,IAAI,KAAK,EAAE,IAAI,KAAK,IAAI,GAAG,IAAI,GAAG,IAAI,KAAK,IAAI,CAAC,CAAC,IAAI;AAAA,EACxE;AACA,cAAY,YAAY;AAIjB,MAAI,SAAS;AACb,MAAI,SAAS,CAAC,oBAAwB,mBAAuB,oBAAwB,oBAAuB,qBAAyB,sBAA2B,sBAA2B,uBAA4B,sBAA2B,wBAA4B,uBAA2B,uBAA4B,sBAA2B,wBAA4B,qBAAyB;AAKrZ,MAAI,YAAY;AAChB,MAAI,UAAU;AACd,MAAI,UAAU;AAEd,MAAI,eAAe,CAAC,mBAAmB,mBAAmB,oBAAoB,mBAAmB,oBAAoB,sBAAuB,kBAAmB;AAC/J,WAAS,aAAa,GAAG;AAC9B,QAAI,IAAI,EAAG,QAAO;AAClB,QAAI,MAAM,EAAG,QAAO;AACpB,QAAI,CAAC,OAAO,SAAS,CAAC,EAAG,QAAO;AAChC,QAAI,IAAI,KAAK;AAGX,aAAO,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,CAAC,CAAC,IAAI,aAAa,IAAI,CAAC;AAAA,IACvE;AAIA,QAAI,IAAI;AACR,QAAI,OAAO,IAAI,UAAU;AACzB,QAAIC,OAAM,aAAa,CAAC;AAGxB,aAASD,KAAI,UAAU,GAAGA,MAAK,GAAGA,MAAK;AACrC,MAAAC,QAAO,aAAaD,EAAC,KAAK,IAAIA;AAAA,IAChC;AACA,WAAO,aAAa,IAAI,OAAO,KAAK,IAAI,IAAI,IAAI,OAAO,KAAK,IAAIC,IAAG;AAAA,EACrE;AACA,eAAa,YAAY;;;ACzEzB,MAAIC,MAAK;AACT,MAAIC,MAAK;AACF,WAAS,WAAW,GAAG;AAC5B,WAAO,KAAK,KAAK,CAAC;AAAA,EACpB;AACA,aAAW,YAAYD;AAChB,WAAS,YAAY,GAAG;AAC7B,WAAO,MAAM,CAAC;AAAA,EAChB;AACA,cAAY,YAAYA;AACjB,WAAS,WAAW,GAAG;AAC5B,WAAO,KAAK,KAAK,IAAI,CAAC;AAAA,EACxB;AACA,aAAW,YAAYA;AAChB,WAAS,YAAY,GAAG;AAC7B,WAAO,OAAO,SAAS,CAAC,KAAK,KAAK,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI,KAAK,IAAI,EAAE,KAAK,IAAI;AAAA,EACpF;AACA,cAAY,YAAYA;AACjB,WAAS,WAAW,GAAG;AAC5B,WAAO,KAAK,KAAK,IAAI,CAAC;AAAA,EACxB;AACA,aAAW,YAAYA;AAChB,WAAS,YAAY,GAAG;AAC7B,QAAI,OAAO,IAAI;AACf,WAAO,KAAK,IAAI,OAAO,KAAK,KAAK,OAAO,OAAO,CAAC,CAAC;AAAA,EACnD;AACA,cAAY,YAAYA;AACjB,WAAS,WAAW,GAAG;AAC5B,WAAO,KAAK,KAAK,IAAI,CAAC;AAAA,EACxB;AACA,aAAW,YAAYA;AAChB,WAAS,YAAY,GAAG;AAC7B,QAAI,OAAO,IAAI;AACf,QAAI,MAAM,KAAK,KAAK,OAAO,OAAO,CAAC;AACnC,WAAO,KAAK,IAAI,MAAM,IAAI;AAAA,EAC5B;AACA,cAAY,YAAYA;AACjB,WAAS,WAAW,GAAG;AAC5B,WAAO,KAAK,KAAK,CAAC;AAAA,EACpB;AACA,aAAW,YAAYA;AAChB,WAAS,YAAY,GAAG;AAC7B,WAAO,MAAM,CAAC;AAAA,EAChB;AACA,cAAY,YAAYA;AACjB,WAAS,WAAW,GAAG;AAC5B,WAAO,KAAK,KAAK,CAAC;AAAA,EACpB;AACA,aAAW,YAAYA;AAChB,WAAS,YAAY,GAAG,GAAG;AAChC,WAAO,KAAK,MAAM,GAAG,CAAC;AAAA,EACxB;AACA,cAAY,YAAYC;AACjB,WAAS,YAAY,GAAG;AAC7B,WAAO,MAAM,CAAC;AAAA,EAChB;AACA,cAAY,YAAYD;AACjB,WAAS,UAAU,GAAG;AAC3B,WAAO,KAAK,IAAI,CAAC;AAAA,EACnB;AACA,YAAU,YAAYA;AACf,WAAS,WAAW,GAAG;AAC5B,WAAO,KAAK,CAAC;AAAA,EACf;AACA,aAAW,YAAYA;AAChB,WAAS,UAAU,GAAG;AAC3B,WAAO,IAAI,KAAK,IAAI,CAAC;AAAA,EACvB;AACA,YAAU,YAAYA;AACf,WAAS,WAAW,GAAG;AAC5B,QAAIE,KAAI,KAAK,IAAI,IAAI,CAAC;AACtB,YAAQA,KAAI,MAAMA,KAAI;AAAA,EACxB;AACA,aAAW,YAAYF;AAChB,WAAS,UAAU,GAAG;AAC3B,WAAO,IAAI,KAAK,IAAI,CAAC;AAAA,EACvB;AACA,YAAU,YAAYA;AACf,WAAS,WAAW,GAAG;AAE5B,QAAI,MAAM,GAAG;AACX,aAAO,OAAO;AAAA,IAChB,OAAO;AACL,aAAO,KAAK,IAAI,KAAK,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,EAAE,IAAI,KAAK,CAAC;AAAA,IAC5D;AAAA,EACF;AACA,aAAW,YAAYA;AAChB,WAAS,UAAU,GAAG;AAC3B,WAAO,IAAI,KAAK,IAAI,CAAC;AAAA,EACvB;AACA,YAAU,YAAYA;AACf,WAAS,WAAW,GAAG;AAC5B,WAAO,KAAK,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;AAAA,EACvC;AACA,aAAW,YAAYA;AAChB,WAAS,UAAU,GAAG;AAC3B,WAAO,KAAK,IAAI,CAAC;AAAA,EACnB;AACA,YAAU,YAAYA;AACf,WAAS,WAAW,GAAG;AAC5B,WAAO,KAAK,CAAC;AAAA,EACf;AACA,aAAW,YAAYA;AAChB,WAAS,UAAU,GAAG;AAC3B,WAAO,KAAK,IAAI,CAAC;AAAA,EACnB;AACA,YAAU,YAAYA;AACf,WAAS,WAAW,GAAG;AAC5B,WAAO,KAAK,CAAC;AAAA,EACf;AACA,aAAW,YAAYA;;;AC9GvB,MAAIG,MAAK;AACF,WAAS,gBAAgB,GAAG;AACjC,WAAO,UAAU,CAAC;AAAA,EACpB;AACA,kBAAgB,YAAYA;AACrB,WAAS,iBAAiB,GAAG;AAClC,WAAO,IAAI;AAAA,EACb;AACA,mBAAiB,YAAYA;AACtB,WAAS,iBAAiB,GAAG;AAClC,WAAO,IAAI;AAAA,EACb;AACA,mBAAiB,YAAYA;AACtB,WAAS,aAAa,GAAG;AAC9B,WAAO,MAAM;AAAA,EACf;AACA,eAAa,YAAYA;AAClB,WAAS,YAAY,GAAG;AAC7B,WAAO,OAAO,MAAM,CAAC;AAAA,EACvB;AACA,cAAY,YAAYA;;;ACLjB,WAASC,aAAY,GAAG,GAAG;AAChC,QAAI,SAAS,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACjF,QAAI,SAAS,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACjF,QAAI,UAAU,GAAG;AACf,YAAM,IAAI,MAAM,2CAA2C;AAAA,IAC7D;AACA,QAAI,SAAS,GAAG;AACd,YAAM,IAAI,MAAM,uCAAuC;AAAA,IACzD;AAEA,QAAI,EAAE,MAAM,KAAK,EAAE,MAAM,GAAG;AAC1B,aAAO;AAAA,IACT;AACA,QAAI,CAAC,EAAE,SAAS,KAAK,CAAC,EAAE,SAAS,GAAG;AAClC,aAAO,EAAE,GAAG,CAAC;AAAA,IACf;AAEA,QAAI,EAAE,GAAG,CAAC,GAAG;AACX,aAAO;AAAA,IACT;AAEA,WAAO,EAAE,MAAM,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,YAAY,IAAI,EAAE,YAAY,IAAI,EAAE,IAAI,GAAG,EAAE,IAAI,CAAC,EAAE,IAAI,MAAM,GAAG,MAAM,CAAC;AAAA,EACxG;;;ACjCA,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,QAAQ;AAC9B,MAAI,mBAAkC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC/E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AA8BJ,WAAOD,OAAMF,QAAM;AAAA,MACjB,QAAQ,OAAK,YAAY,GAAG,GAAGG,QAAO,QAAQA,QAAO,MAAM,IAAI,QAAQ,iBAAiB,CAAC;AAAA,MACzF,WAAW,OAAKC,aAAe,GAAG,IAAI,EAAE,YAAY,CAAC,GAAGD,QAAO,QAAQA,QAAO,MAAM,IAAI,QAAQ,EAAE,MAAM,KAAK,CAAC,EAAE,OAAO,KAAK,CAAC,EAAE,MAAM;AAAA,MACrI,QAAQ,OAAK,IAAI;AAAA,MACjB,UAAU,OAAK,EAAE,IAAI;AAAA;AAAA,MAGrB,MAAMD,OAAM,YAAY,CAAAG,UAAQ,OAAKH,OAAM,KAAKG,OAAM,EAAE,UAAU,CAAC,EAAE,EAAE,KAAK,CAAC;AAAA,MAC7E,kBAAkBH,OAAM,YAAY,CAAAG,UAAQ,OAAKC,SAAQ,GAAGD,KAAI,CAAC;AAAA,IACnE,CAAC;AAAA,EACH,CAAC;;;ACjDD,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,kBAAiC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AA+BJ,WAAOA,OAAMF,QAAM;AAAA,MACjB,oDAAoD,MAAM;AAAA,MAC1D,qDAAqD,MAAM;AAAA,MAC3D,kBAAkBE,OAAM,YAAY,CAAAC,UAAQ,OAAKC,SAAQ,GAAGD,KAAI,CAAC;AAAA,IACnE,CAAC;AAAA,EACH,CAAC;;;AC1CD,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,WAAW;AACjC,MAAI,wBAAuC,wBAAQD,QAAMC,gBAAc,UAAQ;AACpF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AAiCJ,WAAOD,OAAMF,QAAM;AAAA,MACjB,SAAS,MAAM;AAAA,MACf,QAAQ,SAASI,QAAO,GAAG;AACzB,eAAO,EAAE,KAAK,EAAE,SAAS,KAAK,CAAC,MAAM,OAAO,CAAC,CAAC;AAAA,MAChD;AAAA,MACA,KAAK,SAAS,IAAI,GAAG;AACnB,eAAOD,WAAU,CAAC;AAAA,MACpB;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC5CD,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,QAAQ;AAC9B,MAAI,mBAAkC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC/E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AAgCJ,WAAOD,OAAMF,QAAM;AAAA,MACjB,QAAQ,OAAK,YAAY,GAAG,GAAGG,QAAO,QAAQA,QAAO,MAAM,IAAI,QAAQ,iBAAiB,CAAC;AAAA,MACzF,WAAW,OAAKC,aAAe,GAAG,IAAI,EAAE,YAAY,CAAC,GAAGD,QAAO,QAAQA,QAAO,MAAM,IAAI,QAAQ,CAAC,EAAE,MAAM,KAAK,CAAC,EAAE,OAAO,KAAK,CAAC,EAAE,MAAM;AAAA,MACtI,QAAQ,OAAK,IAAI;AAAA,MACjB,UAAU,OAAK,EAAE,IAAI,MAAM,EAAE,IAAI;AAAA,MACjC,MAAMD,OAAM,YAAY,CAAAG,UAAQ,OAAKH,OAAM,KAAKG,OAAM,EAAE,UAAU,CAAC,EAAE,EAAE,KAAK,CAAC;AAAA,MAC7E,kBAAkBH,OAAM,YAAY,CAAAG,UAAQ,OAAKC,SAAQ,GAAGD,KAAI,CAAC;AAAA,IACnE,CAAC;AAAA,EACH,CAAC;;;ACjDD,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,aAAa;AACnC,MAAI,eAA8B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,aAAAC;AAAA,IACF,IAAI;AAkCJ,WAAOD,OAAMF,QAAM;AAAA,MACjB,2CAA2C,OAAKG,aAAY,GAAG,CAAC;AAAA,MAChE,QAAQ,OAAK,MAAM;AAAA,MACnB,MAAMD,OAAM,YAAY,CAAAE,UAAQ,OAAKF,OAAM,KAAKE,OAAM,EAAE,UAAU,CAAC,EAAE,EAAE,KAAK,CAAC;AAAA,MAC7E,kBAAkBF,OAAM,YAAY,CAAAE,UAAQ,OAAKC,SAAQ,GAAGD,KAAI,CAAC;AAAA,IACnE,CAAC;AAAA,EACH,CAAC;;;AC7CD,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,cAA6B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AA8BJ,WAAOA,OAAMF,QAAM;AAAA,MACjB,QAAQ;AAAA,MACR,WAAW,SAASG,WAAU,GAAG;AAC/B,eAAO,EAAE,MAAM;AAAA,MACjB;AAAA,MACA,QAAQ,SAASC,QAAO,GAAG;AACzB,eAAO;AAAA,MACT;AAAA,MACA,UAAU,SAASC,UAAS,GAAG;AAC7B,eAAO;AAAA,MACT;AAAA,MACA,SAAS,SAASC,SAAQ,GAAG;AAC3B,eAAO,EAAE,MAAM;AAAA,MACjB;AAAA,MACA,MAAM,SAASC,MAAK,GAAG;AACrB,eAAO,OAAO,MAAM,EAAE,KAAK;AAAA,MAC7B;AAAA,MACA,kBAAkBL,OAAM,YAAY,CAAAM,UAAQ,OAAKC,SAAQ,GAAGD,KAAI,CAAC;AAAA,IACnE,CAAC;AAAA,EACH,CAAC;;;ACxDD,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,kBAAiC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AA8BJ,WAAOA,OAAMF,QAAM;AAAA,MACjB,QAAQ,OAAK,OAAO,SAAS,CAAC;AAAA,MAC9B,uBAAuB,OAAK,EAAE,SAAS;AAAA,MACvC,qBAAqB,MAAM;AAAA,MAC3B,oBAAoB,MAAM;AAAA,MAC1B,MAAME,OAAM,YAAY,CAAAC,UAAQ,OAAKA,MAAK,EAAE,KAAK,CAAC;AAAA,MAClD,kBAAkBD,OAAM,YAAY,CAAAC,UAAQ,OAAK;AAC/C,YAAI,CAAC,MAAM,QAAQ,CAAC,EAAG,KAAI,EAAE,QAAQ;AACrC,eAAO,EAAE,MAAM,WAASA,MAAK,KAAK,CAAC;AAAA,MACrC,CAAC;AAAA,IACH,CAAC;AAAA,EACH,CAAC;;;AC9CD,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,aAAa,KAAK;AACxC,MAAI,iBAAgC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC7E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAAC;AAAA,MACA,KAAAC;AAAA,IACF,IAAI;AAsCJ,WAAOF,OAAMF,QAAM;AAAA,MACjB,kBAAkB,OAAKI,KAAI,GAAGD,UAAS;AAAA,MACvC,KAAK,OAAKA,WAAU,CAAC;AAAA,IACvB,CAAC;AAAA,EACH,CAAC;;;AChDD,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,eAA8B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAsDJ,WAAOA,OAAMF,QAAM;AAAA,MACjB,KAAK;AAAA,IACP,CAAC;AAAA,EACH,CAAC;;;ACrDM,WAAS,cAAc,GAAG,GAAG,QAAQ,QAAQ;AAClD,WAAO,YAAY,EAAE,IAAI,EAAE,IAAI,QAAQ,MAAM,KAAK,YAAY,EAAE,IAAI,EAAE,IAAI,QAAQ,MAAM;AAAA,EAC1F;;;ACZO,MAAI,qBAAoC,wBAAQ,gBAAgB,CAAC,OAAO,GAAG,UAAQ;AACxF,QAAI;AAAA,MACF,OAAAG;AAAA,IACF,IAAI;AACJ,WAAO;AAAA,MACL,cAAcA,OAAM,YAAY,CAAAC,UAAQ,CAAC,GAAG,MAAM;AAChD,YAAI,CAAC,EAAE,UAAU,CAAC,GAAG;AACnB,gBAAM,IAAI,MAAM,0CAA0C;AAAA,QAC5D;AACA,eAAOD,OAAM,KAAKC,OAAM,CAAC,EAAE,UAAU,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,KAAK;AAAA,MAC1E,CAAC;AAAA,IACH;AAAA,EACF,CAAC;;;ACRD,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,QAAQ;AAC9B,MAAI,oBAAmC,wBAAQD,QAAMC,gBAAc,UAAQ;AAChF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAI,eAAe,mBAAmB;AAAA,MACpC,OAAAD;AAAA,IACF,CAAC;AAUD,WAAOA,OAAMF,QAAM;AAAA,MACjB,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,eAAO,MAAM;AAAA,MACf;AAAA,MACA,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,eAAO,YAAY,GAAG,GAAGG,QAAO,QAAQA,QAAO,MAAM;AAAA,MACvD;AAAA,MACA,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,eAAO,EAAE,GAAG,CAAC,KAAKC,aAAe,GAAG,GAAGD,QAAO,QAAQA,QAAO,MAAM;AAAA,MACrE;AAAA,MACA,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,eAAO,MAAM;AAAA,MACf;AAAA,MACA,sBAAsB,SAAS,kBAAkB,GAAG,GAAG;AACrD,eAAO,EAAE,OAAO,CAAC;AAAA,MACnB;AAAA,MACA,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,eAAO,cAAc,GAAG,GAAGA,QAAO,QAAQA,QAAO,MAAM;AAAA,MACzD;AAAA,IACF,GAAG,YAAY;AAAA,EACjB,CAAC;AACM,MAAI,0BAA0B,QAAQH,QAAM,CAAC,SAAS,QAAQ,GAAG,WAAS;AAC/E,QAAI;AAAA,MACF,OAAAE;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,WAAOD,OAAMF,QAAM;AAAA,MACjB,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,eAAO,YAAY,GAAG,GAAGG,QAAO,QAAQA,QAAO,MAAM;AAAA,MACvD;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC/CD,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,eAAe,QAAQ;AAC7C,MAAI,0BAAyC,wBAAQD,QAAMC,gBAAc,UAAQ;AACtF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AAyBJ,aAASC,cAAa,MAAM,UAAU;AACpC,UAAI,EAAE,gBAAgBA,gBAAe;AACnC,cAAM,IAAI,YAAY,kDAAkD;AAAA,MAC1E;AACA,UAAI,YAAY,CAAC,SAAS,QAAQ,GAAG;AACnC,cAAM,IAAI,MAAM,uBAAuB,QAAQ;AAAA,MACjD;AACA,UAAI,SAAS,IAAI,GAAG;AAElB,0BAAkB,MAAM,MAAM,QAAQ;AAAA,MACxC,WAAW,QAAQ,QAAQ,KAAK,KAAK,KAAK,QAAQ,KAAK,GAAG,KAAK,QAAQ,KAAK,IAAI,GAAG;AAEjF,aAAK,UAAU,KAAK;AACpB,aAAK,SAAS,KAAK;AACnB,aAAK,OAAO,KAAK;AACjB,aAAK,QAAQ,KAAK;AAClB,aAAK,YAAY,YAAY,KAAK;AAAA,MACpC,WAAW,QAAQ,IAAI,GAAG;AAExB,yBAAiB,MAAM,MAAM,QAAQ;AAAA,MACvC,WAAW,MAAM;AAEf,cAAM,IAAI,UAAU,+BAA+B,OAAO,IAAI,IAAI,GAAG;AAAA,MACvE,OAAO;AAEL,aAAK,UAAU,CAAC;AAChB,aAAK,SAAS,CAAC;AACf,aAAK,OAAO,CAAC,CAAC;AACd,aAAK,QAAQ,CAAC,GAAG,CAAC;AAClB,aAAK,YAAY;AAAA,MACnB;AAAA,IACF;AACA,aAAS,kBAAkBC,SAAQ,QAAQ,UAAU;AAEnD,UAAI,OAAO,SAAS,gBAAgB;AAElC,QAAAA,QAAO,UAAU,OAAO,UAAUC,OAAM,OAAO,OAAO,IAAI;AAC1D,QAAAD,QAAO,SAASC,OAAM,OAAO,MAAM;AACnC,QAAAD,QAAO,OAAOC,OAAM,OAAO,IAAI;AAC/B,QAAAD,QAAO,QAAQC,OAAM,OAAO,KAAK;AACjC,QAAAD,QAAO,YAAY,YAAY,OAAO;AAAA,MACxC,OAAO;AAEL,yBAAiBA,SAAQ,OAAO,QAAQ,GAAG,YAAY,OAAO,SAAS;AAAA,MACzE;AAAA,IACF;AACA,aAAS,iBAAiBA,SAAQ,MAAM,UAAU;AAEhD,MAAAA,QAAO,UAAU,CAAC;AAClB,MAAAA,QAAO,SAAS,CAAC;AACjB,MAAAA,QAAO,OAAO,CAAC;AACf,MAAAA,QAAO,YAAY;AAEnB,UAAI,OAAO,KAAK;AAChB,UAAI,UAAU;AAGd,UAAI,KAAKH;AAET,UAAI,OAAO;AACX,UAAI,SAAS,QAAQ,GAAG;AAEtB,aAAKD,OAAM,KAAKC,cAAa,CAAC,UAAU,QAAQ,CAAC,KAAKA;AAEtD,eAAOD,OAAM,QAAQ,GAAG,QAAQ;AAAA,MAClC;AAGA,UAAI,OAAO,GAAG;AAEZ,YAAI,IAAI;AACR,WAAG;AAED,UAAAI,QAAO,KAAK,KAAKA,QAAO,OAAO,MAAM;AAErC,mBAASE,KAAI,GAAGA,KAAI,MAAMA,MAAK;AAE7B,gBAAIC,OAAM,KAAKD,EAAC;AAEhB,gBAAI,QAAQC,IAAG,GAAG;AAEhB,kBAAI,MAAM,KAAK,UAAUA,KAAI,QAAQ;AACnC,0BAAUA,KAAI;AAAA,cAChB;AAEA,kBAAI,IAAIA,KAAI,QAAQ;AAElB,oBAAI,IAAIA,KAAI,CAAC;AAEb,oBAAI,CAAC,GAAG,GAAG,IAAI,GAAG;AAEhB,kBAAAH,QAAO,QAAQ,KAAK,CAAC;AAErB,kBAAAA,QAAO,OAAO,KAAKE,EAAC;AAAA,gBACtB;AAAA,cACF;AAAA,YACF,OAAO;AAEL,kBAAI,MAAM,KAAK,UAAU,GAAG;AAC1B,0BAAU;AAAA,cACZ;AAEA,kBAAI,CAAC,GAAGC,MAAK,IAAI,GAAG;AAElB,gBAAAH,QAAO,QAAQ,KAAKG,IAAG;AAEvB,gBAAAH,QAAO,OAAO,KAAKE,EAAC;AAAA,cACtB;AAAA,YACF;AAAA,UACF;AAEA;AAAA,QACF,SAAS,IAAI;AAAA,MACf;AAEA,aAAOF,QAAO,KAAK,UAAU,SAAS;AACpC,QAAAA,QAAO,KAAK,KAAKA,QAAO,OAAO,MAAM;AAAA,MACvC;AAEA,MAAAA,QAAO,QAAQ,CAAC,MAAM,OAAO;AAAA,IAC/B;AACA,IAAAD,cAAa,YAAY,IAAID,QAAO;AAKpC,IAAAC,cAAa,UAAU,qBAAqB,SAAU,MAAM,UAAU;AACpE,aAAO,IAAIA,cAAa,MAAM,QAAQ;AAAA,IACxC;AAKA,WAAO,eAAeA,eAAc,QAAQ;AAAA,MAC1C,OAAO;AAAA,IACT,CAAC;AACD,IAAAA,cAAa,UAAU,cAAcA;AACrC,IAAAA,cAAa,UAAU,OAAO;AAC9B,IAAAA,cAAa,UAAU,iBAAiB;AAWxC,IAAAA,cAAa,UAAU,cAAc,WAAY;AAC/C,aAAO,iBAAiB,KAAK,SAAS,MAAM;AAAA,IAC9C;AAWA,IAAAA,cAAa,UAAU,UAAU,WAAY;AAC3C,aAAO;AAAA,IACT;AAWA,IAAAA,cAAa,UAAU,WAAW,WAAY;AAC5C,aAAO,KAAK;AAAA,IACd;AAQA,IAAAA,cAAa,UAAU,SAAS,SAAU,MAAM,UAAU;AACxD,aAAO,IAAIA,cAAa,MAAM,QAAQ;AAAA,IACxC;AAWA,IAAAA,cAAa,UAAU,UAAU,WAAY;AAE3C,UAAI,OAAO,KAAK,MAAM,CAAC;AACvB,UAAI,UAAU,KAAK,MAAM,CAAC;AAE1B,aAAO,SAAS,KAAK,YAAY,IAAI,KAAK,OAAO,UAAU,OAAO,WAAW;AAAA,IAC/E;AAgBA,IAAAA,cAAa,UAAU,SAAS,SAAUK,QAAO,aAAa,cAAc;AAE1E,UAAI,CAAC,KAAK,SAAS;AACjB,cAAM,IAAI,MAAM,+CAA+C;AAAA,MACjE;AAGA,cAAQ,UAAU,QAAQ;AAAA,QACxB,KAAK;AACH,iBAAO,WAAW,MAAMA,MAAK;AAAA;AAAA,QAG/B,KAAK;AAAA,QACL,KAAK;AACH,iBAAO,WAAW,MAAMA,QAAO,aAAa,YAAY;AAAA,QAC1D;AACE,gBAAM,IAAI,YAAY,2BAA2B;AAAA,MACrD;AAAA,IACF;AACA,aAAS,WAAWJ,SAAQ,KAAK;AAE/B,UAAI,CAAC,QAAQ,GAAG,GAAG;AACjB,cAAM,IAAI,UAAU,eAAe;AAAA,MACrC;AACA,UAAI,WAAW,IAAI,SAAS;AAC5B,UAAI,UAAU;AAEZ,eAAOA,QAAO,IAAI,IAAI,IAAI,CAAC;AAAA,MAC7B;AAEA,UAAIK,QAAO,IAAI,KAAK;AACpB,UAAIA,MAAK,WAAWL,QAAO,MAAM,QAAQ;AACvC,cAAM,IAAI,eAAeK,MAAK,QAAQL,QAAO,MAAM,MAAM;AAAA,MAC3D;AAGA,UAAIE,IAAG,IAAI,GAAG;AAGd,UAAII,OAAM,IAAI,IAAI;AAClB,UAAIC,OAAM,IAAI,IAAI;AAClB,WAAKL,KAAI,GAAG,KAAKF,QAAO,MAAM,QAAQE,KAAI,IAAIA,MAAK;AACjD,sBAAcI,KAAIJ,EAAC,GAAGF,QAAO,MAAME,EAAC,CAAC;AACrC,sBAAcK,KAAIL,EAAC,GAAGF,QAAO,MAAME,EAAC,CAAC;AAAA,MACvC;AAGA,UAAI,UAAUF,QAAO;AACrB,UAAI,SAASA,QAAO;AACpB,UAAI,OAAOA,QAAO;AAGlB,UAAI,OAAO,IAAI,UAAU,CAAC;AAC1B,UAAI,UAAU,IAAI,UAAU,CAAC;AAG7B,UAAI,IAAI,CAAC;AACT,UAAI,KAAK,CAAC;AAGV,eAAS,aAAaE,IAAG,GAAG;AAE1B,WAAGA,EAAC,IAAI,EAAE,CAAC;AAEX,UAAEA,EAAC,IAAI;AAAA,MACT;AACA,UAAI,OAAO,UAAU,IAAI,EAAG,cAAa,MAAM,CAAC,CAAC,CAAC;AAAA,UAAO,MAAK,QAAQ,YAAY;AAGlF,UAAI,SAAS,UAAU,CAAC,IAAI;AAC5B,UAAIE,SAAQ,CAAC;AACb,UAAI,MAAM,CAAC;AAGX,eAAS,gBAAgB,GAAG;AAE1B,YAAI,KAAKA,OAAM,MAAM;AAErB,aAAK,IAAI,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,KAAK;AAE/C,UAAAF,KAAI,OAAO,CAAC;AAEZ,cAAI,EAAEA,EAAC,MAAM,MAAM;AAEjB,YAAAE,OAAM,KAAK,GAAGF,EAAC,CAAC;AAEhB,gBAAI,QAAQ;AACV,qBAAO,KAAK,QAAQ,CAAC,CAAC;AAAA,YACxB;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,UAAI,OAAO,UAAU,OAAO,EAAG,iBAAgB,OAAO;AAAA,UAAO,SAAQ,QAAQ,eAAe;AAE5F,UAAI,KAAKE,OAAM,MAAM;AAGrB,aAAO,IAAIL,cAAa;AAAA,QACtB;AAAA,QACA,OAAAK;AAAA,QACA;AAAA,QACA,MAAAC;AAAA,QACA,UAAUL,QAAO;AAAA,MACnB,CAAC;AAAA,IACH;AACA,aAAS,WAAWA,SAAQI,QAAO,WAAW,cAAc;AAE1D,UAAI,CAACA,UAASA,OAAM,YAAY,MAAM;AACpC,cAAM,IAAI,UAAU,eAAe;AAAA,MACrC;AAGA,UAAI,QAAQA,OAAM,KAAK;AACvB,UAAI,WAAWA,OAAM,SAAS;AAG9B,UAAI;AACJ,UAAI,SAAS,SAAS,GAAG;AAEvB,gBAAQ,UAAU,KAAK;AAEvB,oBAAY,UAAU,QAAQ;AAAA,MAChC,OAAO;AAEL,gBAAQ,UAAU,SAAS;AAAA,MAC7B;AAGA,UAAI,UAAU;AAEZ,YAAI,MAAM,WAAW,GAAG;AACtB,gBAAM,IAAI,UAAU,iBAAiB;AAAA,QACvC;AAEA,QAAAJ,QAAO,IAAII,OAAM,IAAI,GAAG,WAAW,YAAY;AAAA,MACjD,OAAO;AAEL,YAAI,MAAM,WAAW,KAAK,MAAM,WAAW,GAAG;AAC5C,gBAAM,IAAI,eAAe,MAAM,QAAQJ,QAAO,MAAM,QAAQ,GAAG;AAAA,QACjE;AAGA,YAAI,MAAM,SAAS,MAAM,QAAQ;AAE/B,cAAIE,KAAI;AACR,cAAI,QAAQ;AACZ,iBAAO,MAAMA,EAAC,MAAM,KAAK,MAAMA,EAAC,MAAM,GAAG;AACvC,YAAAA;AAAA,UACF;AACA,iBAAO,MAAMA,EAAC,MAAM,GAAG;AACrB;AACA,YAAAA;AAAA,UACF;AAEA,sBAAY,UAAU,WAAW,MAAM,QAAQ,OAAO,KAAK;AAAA,QAC7D;AAGA,YAAI,CAAC,gBAAgB,OAAO,KAAK,GAAG;AAClC,gBAAM,IAAI,eAAe,OAAO,OAAO,GAAG;AAAA,QAC5C;AAGA,YAAI,MAAM,WAAW,GAAG;AAEtB,cAAIM,SAAQJ,OAAM,UAAU,CAAC;AAC7B,wBAAcI,QAAO,CAAC,WAAW,aAAa;AAC5C,0BAAc,SAAS;AACvB,YAAAR,QAAO,IAAI,CAAC,WAAW,CAAC,GAAG,UAAU,SAAS,CAAC,CAAC,GAAG,YAAY;AAAA,UACjE,CAAC;AAAA,QACH,OAAO;AAEL,cAAI,sBAAsBI,OAAM,UAAU,CAAC;AAC3C,cAAI,uBAAuBA,OAAM,UAAU,CAAC;AAC5C,wBAAc,qBAAqB,CAAC,gBAAgB,kBAAkB;AACpE,0BAAc,cAAc;AAC5B,0BAAc,sBAAsB,CAAC,iBAAiB,mBAAmB;AACvE,4BAAc,eAAe;AAC7B,cAAAJ,QAAO,IAAI,CAAC,gBAAgB,eAAe,GAAG,UAAU,cAAc,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,GAAG,YAAY;AAAA,YAC5G,CAAC;AAAA,UACH,CAAC;AAAA,QACH;AAAA,MACF;AACA,aAAOA;AACP,eAAS,cAAcI,QAAO,UAAU;AAEtC,YAAI,SAASA,MAAK,EAAG,UAASA,QAAO,CAAC,CAAC,CAAC;AAAA,YAAO,CAAAA,OAAM,QAAQ,QAAQ;AAAA,MACvE;AAAA,IACF;AAQA,IAAAL,cAAa,UAAU,MAAM,SAAUK,QAAO;AAC5C,UAAI,CAAC,QAAQA,MAAK,GAAG;AACnB,cAAM,IAAI,UAAU,gBAAgB;AAAA,MACtC;AACA,UAAIA,OAAM,WAAW,KAAK,MAAM,QAAQ;AACtC,cAAM,IAAI,eAAeA,OAAM,QAAQ,KAAK,MAAM,MAAM;AAAA,MAC1D;AAGA,UAAI,CAAC,KAAK,SAAS;AACjB,cAAM,IAAI,MAAM,4CAA4C;AAAA,MAC9D;AAGA,UAAIF,KAAIE,OAAM,CAAC;AACf,UAAI,IAAIA,OAAM,CAAC;AAGf,oBAAcF,IAAG,KAAK,MAAM,CAAC,CAAC;AAC9B,oBAAc,GAAG,KAAK,MAAM,CAAC,CAAC;AAG9B,UAAI,IAAI,eAAeA,IAAG,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,KAAK,MAAM;AAErE,UAAI,IAAI,KAAK,KAAK,IAAI,CAAC,KAAK,KAAK,OAAO,CAAC,MAAMA,IAAG;AAChD,eAAO,KAAK,QAAQ,CAAC;AAAA,MACvB;AACA,aAAO;AAAA,IACT;AAYA,IAAAH,cAAa,UAAU,MAAM,SAAUK,QAAO,GAAG,cAAc;AAC7D,UAAI,CAAC,QAAQA,MAAK,GAAG;AACnB,cAAM,IAAI,UAAU,gBAAgB;AAAA,MACtC;AACA,UAAIA,OAAM,WAAW,KAAK,MAAM,QAAQ;AACtC,cAAM,IAAI,eAAeA,OAAM,QAAQ,KAAK,MAAM,MAAM;AAAA,MAC1D;AAGA,UAAI,CAAC,KAAK,SAAS;AACjB,cAAM,IAAI,MAAM,4CAA4C;AAAA,MAC9D;AAGA,UAAIF,KAAIE,OAAM,CAAC;AACf,UAAI,IAAIA,OAAM,CAAC;AAGf,UAAI,OAAO,KAAK,MAAM,CAAC;AACvB,UAAI,UAAU,KAAK,MAAM,CAAC;AAG1B,UAAI,KAAKP;AAET,UAAI,OAAO;AACX,UAAI,SAAS,KAAK,SAAS,GAAG;AAE5B,aAAKD,OAAM,KAAKC,cAAa,CAAC,KAAK,WAAW,KAAK,SAAS,CAAC,KAAKA;AAElE,eAAOD,OAAM,QAAQ,GAAG,KAAK,SAAS;AAAA,MACxC;AAGA,UAAIM,KAAI,OAAO,KAAK,IAAI,UAAU,GAAG;AAEnC,QAAAO,SAAQ,MAAM,KAAK,IAAIP,KAAI,GAAG,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,OAAO,GAAG,YAAY;AAE3E,eAAO,KAAK,MAAM,CAAC;AACnB,kBAAU,KAAK,MAAM,CAAC;AAAA,MACxB;AAGA,oBAAcA,IAAG,IAAI;AACrB,oBAAc,GAAG,OAAO;AAGxB,UAAI,IAAI,eAAeA,IAAG,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,KAAK,MAAM;AAErE,UAAI,IAAI,KAAK,KAAK,IAAI,CAAC,KAAK,KAAK,OAAO,CAAC,MAAMA,IAAG;AAEhD,YAAI,CAAC,GAAG,GAAG,IAAI,GAAG;AAEhB,eAAK,QAAQ,CAAC,IAAI;AAAA,QACpB,OAAO;AAEL,kBAAQ,GAAG,GAAG,KAAK,SAAS,KAAK,QAAQ,KAAK,IAAI;AAAA,QACpD;AAAA,MACF,OAAO;AACL,YAAI,CAAC,GAAG,GAAG,IAAI,GAAG;AAEhB,kBAAQ,GAAGA,IAAG,GAAG,GAAG,KAAK,SAAS,KAAK,QAAQ,KAAK,IAAI;AAAA,QAC1D;AAAA,MACF;AACA,aAAO;AAAA,IACT;AACA,aAAS,eAAeA,IAAG,KAAK,QAAQE,QAAO;AAE7C,UAAI,SAAS,QAAQ,GAAG;AACtB,eAAO;AAAA,MACT;AAEA,eAAS,IAAI,KAAK,IAAI,QAAQ,KAAK;AAEjC,YAAIA,OAAM,CAAC,MAAMF,IAAG;AAClB,iBAAO;AAAA,QACT;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AACA,aAAS,QAAQ,GAAG,GAAG,QAAQE,QAAO,KAAK;AAEzC,aAAO,OAAO,GAAG,CAAC;AAClB,MAAAA,OAAM,OAAO,GAAG,CAAC;AAEjB,eAAS,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACvC,YAAI,CAAC;AAAA,MACP;AAAA,IACF;AACA,aAAS,QAAQ,GAAGF,IAAG,GAAG,GAAG,QAAQE,QAAO,KAAK;AAE/C,aAAO,OAAO,GAAG,GAAG,CAAC;AAErB,MAAAA,OAAM,OAAO,GAAG,GAAGF,EAAC;AAEpB,eAAS,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACvC,YAAI,CAAC;AAAA,MACP;AAAA,IACF;AAiBA,IAAAH,cAAa,UAAU,SAAS,SAAUM,OAAM,cAAc,MAAM;AAElE,UAAI,CAAC,aAAaA,KAAI,GAAG;AACvB,cAAM,IAAI,UAAU,0BAA0B;AAAA,MAChD;AAGA,UAAI,YAAYA,MAAK,QAAQ,EAAE,IAAI,WAAS;AAC1C,eAAO,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,IAAI;AAAA,MACjE,CAAC;AACD,UAAI,UAAU,WAAW,GAAG;AAC1B,cAAM,IAAI,MAAM,0CAA0C;AAAA,MAC5D;AAGA,gBAAU,QAAQ,SAAU,OAAO;AACjC,YAAI,CAAC,SAAS,KAAK,KAAK,CAAC,UAAU,KAAK,KAAK,QAAQ,GAAG;AACtD,gBAAM,IAAI,UAAU,yDAA8DK,QAAO,SAAS,IAAI,GAAG;AAAA,QAC3G;AAAA,MACF,CAAC;AAGD,UAAI,IAAI,OAAO,KAAK,MAAM,IAAI;AAE9B,aAAOD,SAAQ,GAAG,UAAU,CAAC,GAAG,UAAU,CAAC,GAAG,YAAY;AAAA,IAC5D;AACA,aAASA,SAAQT,SAAQ,MAAM,SAAS,cAAc;AAEpD,UAAI,QAAQ,gBAAgB;AAG5B,UAAI,KAAKH;AAET,UAAI,OAAO;AACX,UAAI,SAASG,QAAO,SAAS,GAAG;AAE9B,aAAKJ,OAAM,KAAKC,cAAa,CAACG,QAAO,WAAWA,QAAO,SAAS,CAAC,KAAKH;AAEtE,eAAOD,OAAM,QAAQ,GAAGI,QAAO,SAAS;AAExC,gBAAQJ,OAAM,QAAQ,OAAOI,QAAO,SAAS;AAAA,MAC/C;AAGA,UAAI,MAAM,CAAC,GAAG,OAAO,IAAI;AAGzB,UAAI,IAAIA,QAAO,MAAM,CAAC;AACtB,UAAI,IAAIA,QAAO,MAAM,CAAC;AACtB,UAAIE,IAAG,GAAG;AAGV,UAAI,UAAU,GAAG;AAEf,aAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAE5B,UAAAF,QAAO,KAAK,CAAC,IAAIA,QAAO,QAAQ;AAEhC,cAAI,KAAK;AAEP,iBAAKE,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAEtB,cAAAF,QAAO,QAAQ,KAAK,KAAK;AAEzB,cAAAA,QAAO,OAAO,KAAKE,EAAC;AAAA,YACtB;AAAA,UACF;AAAA,QACF;AAEA,QAAAF,QAAO,KAAK,OAAO,IAAIA,QAAO,QAAQ;AAAA,MACxC,WAAW,UAAU,GAAG;AAEtB,QAAAA,QAAO,KAAK,OAAO,UAAU,GAAG,IAAI,OAAO;AAE3C,QAAAA,QAAO,QAAQ,OAAOA,QAAO,KAAK,OAAO,GAAGA,QAAO,QAAQ,MAAM;AACjE,QAAAA,QAAO,OAAO,OAAOA,QAAO,KAAK,OAAO,GAAGA,QAAO,OAAO,MAAM;AAAA,MACjE;AAEA,UAAI;AAGJ,UAAI,OAAO,GAAG;AAEZ,YAAI,KAAK;AAEP,cAAI,IAAI;AAER,eAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AAEtB,YAAAA,QAAO,KAAK,CAAC,IAAIA,QAAO,KAAK,CAAC,IAAI;AAElC,gBAAIA,QAAO,KAAK,IAAI,CAAC,IAAI;AAEzB,gBAAI,IAAI;AAER,iBAAKE,KAAI,GAAGA,KAAI,MAAMA,MAAK,KAAK;AAE9B,cAAAF,QAAO,QAAQ,OAAO,IAAI,GAAG,GAAG,KAAK;AAErC,cAAAA,QAAO,OAAO,OAAO,IAAI,GAAG,GAAGE,EAAC;AAEhC;AAAA,YACF;AAAA,UACF;AAEA,UAAAF,QAAO,KAAK,CAAC,IAAIA,QAAO,QAAQ;AAAA,QAClC;AAAA,MACF,WAAW,OAAO,GAAG;AAEnB,YAAI,IAAI;AAER,aAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AAEtB,UAAAA,QAAO,KAAK,CAAC,IAAIA,QAAO,KAAK,CAAC,IAAI;AAElC,cAAI,KAAKA,QAAO,KAAK,CAAC;AACtB,cAAI,KAAKA,QAAO,KAAK,IAAI,CAAC,IAAI;AAE9B,eAAK,IAAI,IAAI,IAAI,IAAI,KAAK;AAExB,YAAAE,KAAIF,QAAO,OAAO,CAAC;AAEnB,gBAAIE,KAAI,OAAO,GAAG;AAEhB,cAAAF,QAAO,QAAQ,OAAO,GAAG,CAAC;AAE1B,cAAAA,QAAO,OAAO,OAAO,GAAG,CAAC;AAEzB;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAEA,QAAAA,QAAO,KAAK,CAAC,IAAIA,QAAO,QAAQ;AAAA,MAClC;AAEA,MAAAA,QAAO,MAAM,CAAC,IAAI;AAClB,MAAAA,QAAO,MAAM,CAAC,IAAI;AAElB,aAAOA;AAAA,IACT;AAkBA,IAAAD,cAAa,UAAU,UAAU,SAAU,OAAO,MAAM;AAEtD,UAAI,CAAC,QAAQ,KAAK,GAAG;AACnB,cAAM,IAAI,UAAU,gBAAgB;AAAA,MACtC;AACA,UAAI,MAAM,WAAW,GAAG;AACtB,cAAM,IAAI,MAAM,wDAAwD;AAAA,MAC1E;AAGA,YAAM,QAAQ,SAAU,OAAO;AAC7B,YAAI,CAAC,SAAS,KAAK,KAAK,CAAC,UAAU,KAAK,KAAK,SAAS,MAAM,UAAU,GAAG;AACvE,gBAAM,IAAI,UAAU,+DAAoEW,QAAO,KAAK,IAAI,GAAG;AAAA,QAC7G;AAAA,MACF,CAAC;AACD,UAAI,gBAAgB,KAAK,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC;AAChD,cAAQ,qBAAqB,OAAO,aAAa;AACjD,UAAI,YAAY,MAAM,CAAC,IAAI,MAAM,CAAC;AAGlC,UAAI,kBAAkB,WAAW;AAC/B,cAAM,IAAI,MAAM,qEAAqE;AAAA,MACvF;AAGA,UAAI,IAAI,OAAO,KAAK,MAAM,IAAI;AAG9B,UAAI,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC,KAAK,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAC5D,eAAO;AAAA,MACT;AAGA,UAAI,WAAW,CAAC;AAChB,eAASR,KAAI,GAAGA,KAAI,EAAE,KAAK,QAAQA,MAAK;AACtC,iBAAS,IAAI,GAAG,IAAI,EAAE,KAAKA,KAAI,CAAC,IAAI,EAAE,KAAKA,EAAC,GAAG,KAAK;AAClD,mBAAS,KAAKA,EAAC;AAAA,QACjB;AAAA,MACF;AAGA,UAAI,SAAS,EAAE,QAAQ,MAAM;AAG7B,UAAI,WAAW,EAAE,OAAO,MAAM;AAG9B,eAAS,KAAK,GAAG,KAAK,EAAE,OAAO,QAAQ,MAAM;AAC3C,YAAI,KAAK,SAAS,EAAE;AACpB,YAAI,KAAK,SAAS,EAAE;AACpB,YAAI,OAAO,KAAK,EAAE,MAAM,CAAC,IAAI;AAC7B,iBAAS,EAAE,IAAI,OAAO,MAAM,CAAC;AAC7B,iBAAS,EAAE,IAAI,KAAK,MAAM,OAAO,MAAM,CAAC,CAAC;AAAA,MAC3C;AASA,QAAE,QAAQ,SAAS;AACnB,QAAE,OAAO,SAAS;AAClB,QAAE,KAAK,SAAS,MAAM,CAAC,IAAI;AAC3B,QAAE,QAAQ,MAAM,MAAM;AACtB,eAAS,MAAM,GAAG,MAAM,EAAE,KAAK,QAAQ,OAAO;AAC5C,UAAE,KAAK,GAAG,IAAI;AAAA,MAChB;AAIA,eAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,YAAI,MAAM,SAAS,CAAC;AACpB,YAAI,KAAK,SAAS,CAAC;AACnB,YAAI,IAAI,OAAO,CAAC;AAChB,YAAI,IAAI,eAAe,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,KAAK,CAAC,GAAG,EAAE,MAAM;AAChE,gBAAQ,GAAG,KAAK,IAAI,GAAG,EAAE,SAAS,EAAE,QAAQ,EAAE,IAAI;AAAA,MACpD;AAIA,aAAO;AAAA,IACT;AAOA,IAAAH,cAAa,UAAU,QAAQ,WAAY;AACzC,UAAI,IAAI,IAAIA,cAAa;AAAA,QACvB,QAAQ,KAAK,UAAUE,OAAM,KAAK,OAAO,IAAI;AAAA,QAC7C,OAAOA,OAAM,KAAK,MAAM;AAAA,QACxB,KAAKA,OAAM,KAAK,IAAI;AAAA,QACpB,MAAMA,OAAM,KAAK,KAAK;AAAA,QACtB,UAAU,KAAK;AAAA,MACjB,CAAC;AACD,aAAO;AAAA,IACT;AAOA,IAAAF,cAAa,UAAU,OAAO,WAAY;AACxC,aAAO,KAAK,MAAM,MAAM,CAAC;AAAA,IAC3B;AAaA,IAAAA,cAAa,UAAU,MAAM,SAAU,UAAU,WAAW;AAE1D,UAAI,CAAC,KAAK,SAAS;AACjB,cAAM,IAAI,MAAM,4CAA4C;AAAA,MAC9D;AAEA,UAAI,KAAK;AAET,UAAI,OAAO,KAAK,MAAM,CAAC;AACvB,UAAI,UAAU,KAAK,MAAM,CAAC;AAC1B,UAAI,eAAe,iBAAiB,UAAU,IAAI,KAAK;AAEvD,UAAI,SAAS,SAASY,QAAO,GAAGT,IAAG,GAAG;AAEpC,eAAO,aAAa,GAAG,GAAG,CAACA,IAAG,CAAC,GAAG,EAAE;AAAA,MACtC;AAEA,aAAO,KAAK,MAAM,GAAG,OAAO,GAAG,GAAG,UAAU,GAAG,QAAQ,SAAS;AAAA,IAClE;AAMA,aAAS,KAAKF,SAAQ,QAAQ,QAAQ,WAAW,WAAW,UAAU,WAAW;AAE/E,UAAI,SAAS,CAAC;AACd,UAAII,SAAQ,CAAC;AACb,UAAI,MAAM,CAAC;AAGX,UAAI,KAAKP;AAET,UAAI,OAAO;AACX,UAAI,SAASG,QAAO,SAAS,GAAG;AAE9B,aAAKJ,OAAM,KAAKC,cAAa,CAACG,QAAO,WAAWA,QAAO,SAAS,CAAC,KAAKH;AAEtE,eAAOD,OAAM,QAAQ,GAAGI,QAAO,SAAS;AAAA,MAC1C;AAGA,UAAI,SAAS,SAASW,QAAO,GAAG,GAAG,GAAG;AAEpC,YAAIC,SAAQ,SAAS,GAAG,GAAG,CAAC;AAE5B,YAAI,CAAC,GAAGA,QAAO,IAAI,GAAG;AAEpB,iBAAO,KAAKA,MAAK;AAEjB,UAAAR,OAAM,KAAK,CAAC;AAAA,QACd;AAAA,MACF;AAEA,eAAS,IAAI,WAAW,KAAK,WAAW,KAAK;AAE3C,YAAI,KAAK,OAAO,MAAM;AAEtB,YAAI,KAAKJ,QAAO,KAAK,CAAC;AACtB,YAAI,KAAKA,QAAO,KAAK,IAAI,CAAC;AAC1B,YAAI,WAAW;AAEb,mBAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5B,gBAAIE,KAAIF,QAAO,OAAO,CAAC;AAEvB,gBAAIE,MAAK,UAAUA,MAAK,QAAQ;AAE9B,qBAAOF,QAAO,QAAQ,CAAC,GAAGE,KAAI,QAAQ,IAAI,SAAS;AAAA,YACrD;AAAA,UACF;AAAA,QACF,OAAO;AAEL,cAAI,UAAU,CAAC;AACf,mBAAS,KAAK,IAAI,KAAK,IAAI,MAAM;AAC/B,gBAAI,MAAMF,QAAO,OAAO,EAAE;AAC1B,oBAAQ,GAAG,IAAIA,QAAO,QAAQ,EAAE;AAAA,UAClC;AAIA,mBAAS,MAAM,QAAQ,OAAO,QAAQ,OAAO;AAC3C,gBAAI,QAAQ,OAAO,UAAU,QAAQ,GAAG,IAAI;AAC5C,mBAAO,OAAO,MAAM,QAAQ,IAAI,SAAS;AAAA,UAC3C;AAAA,QACF;AAAA,MACF;AAGA,UAAI,KAAK,OAAO,MAAM;AAEtB,aAAO,IAAID,cAAa;AAAA,QACtB;AAAA,QACA,OAAAK;AAAA,QACA;AAAA,QACA,MAAM,CAAC,SAAS,SAAS,GAAG,YAAY,YAAY,CAAC;AAAA,MACvD,CAAC;AAAA,IACH;AAYA,IAAAL,cAAa,UAAU,UAAU,SAAU,UAAU,WAAW;AAE9D,UAAI,CAAC,KAAK,SAAS;AACjB,cAAM,IAAI,MAAM,gDAAgD;AAAA,MAClE;AAEA,UAAI,KAAK;AAET,UAAI,OAAO,KAAK,MAAM,CAAC;AACvB,UAAI,UAAU,KAAK,MAAM,CAAC;AAC1B,UAAI,eAAe,iBAAiB,UAAU,IAAI,SAAS;AAE3D,eAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAEhC,YAAI,KAAK,KAAK,KAAK,CAAC;AACpB,YAAI,KAAK,KAAK,KAAK,IAAI,CAAC;AACxB,YAAI,WAAW;AAEb,mBAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5B,gBAAIG,KAAI,KAAK,OAAO,CAAC;AAIrB,yBAAa,GAAG,KAAK,QAAQ,CAAC,GAAG,CAACA,IAAG,CAAC,GAAG,EAAE;AAAA,UAC7C;AAAA,QACF,OAAO;AAEL,cAAI,SAAS,CAAC;AACd,mBAAS,MAAM,IAAI,MAAM,IAAI,OAAO;AAClC,gBAAI,MAAM,KAAK,OAAO,GAAG;AACzB,mBAAO,GAAG,IAAI,KAAK,QAAQ,GAAG;AAAA,UAChC;AAIA,mBAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,gBAAI,QAAQ,OAAO,SAAS,OAAO,GAAG,IAAI;AAC1C,yBAAa,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE;AAAA,UACrC;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAMA,IAAAH,cAAa,UAAU,OAAO,QAAQ,IAAI,aAAa;AACrD,UAAI,CAAC,KAAK,SAAS;AACjB,cAAM,IAAI,MAAM,sCAAsC;AAAA,MACxD;AACA,UAAI,UAAU,KAAK,MAAM,CAAC;AAC1B,eAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,YAAI,KAAK,KAAK,KAAK,CAAC;AACpB,YAAI,KAAK,KAAK,KAAK,IAAI,CAAC;AACxB,iBAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5B,cAAIG,KAAI,KAAK,OAAO,CAAC;AACrB,gBAAM;AAAA,YACJ,OAAO,KAAK,QAAQ,CAAC;AAAA,YACrB,OAAO,CAACA,IAAG,CAAC;AAAA,UACd;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAOA,IAAAH,cAAa,UAAU,UAAU,WAAY;AAC3C,aAAO,SAAS,KAAK,SAAS,KAAK,QAAQ,KAAK,MAAM,KAAK,OAAO,IAAI;AAAA,IACxE;AAOA,IAAAA,cAAa,UAAU,UAAU,WAAY;AAC3C,aAAO,SAAS,KAAK,SAAS,KAAK,QAAQ,KAAK,MAAM,KAAK,OAAO,KAAK;AAAA,IACzE;AACA,aAAS,SAAS,QAAQK,QAAO,KAAKC,OAAM,MAAM;AAEhD,UAAI,OAAOA,MAAK,CAAC;AACjB,UAAI,UAAUA,MAAK,CAAC;AAEpB,UAAI,IAAI,CAAC;AAET,UAAIH,IAAG;AAEP,WAAKA,KAAI,GAAGA,KAAI,MAAMA,MAAK;AACzB,UAAEA,EAAC,IAAI,CAAC;AACR,aAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAC5B,YAAEA,EAAC,EAAE,CAAC,IAAI;AAAA,QACZ;AAAA,MACF;AAGA,WAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAE5B,YAAI,KAAK,IAAI,CAAC;AACd,YAAI,KAAK,IAAI,IAAI,CAAC;AAElB,iBAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5B,UAAAA,KAAIE,OAAM,CAAC;AAEX,YAAEF,EAAC,EAAE,CAAC,IAAI,SAAS,OAAOD,OAAM,OAAO,CAAC,CAAC,IAAI,OAAO,CAAC,IAAI;AAAA,QAC3D;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAWA,IAAAF,cAAa,UAAU,SAAS,SAAU,SAAS;AAEjD,UAAI,OAAO,KAAK,MAAM,CAAC;AACvB,UAAI,UAAU,KAAK,MAAM,CAAC;AAE1B,UAAI,UAAU,KAAK,QAAQ;AAE3B,UAAI,MAAM,oBAAoBW,QAAO,MAAM,OAAO,IAAI,QAAQA,QAAO,SAAS,OAAO,IAAI,gBAAgBA,QAAO,SAAS,OAAO,IAAI;AAEpI,eAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAEhC,YAAI,KAAK,KAAK,KAAK,CAAC;AACpB,YAAI,KAAK,KAAK,KAAK,IAAI,CAAC;AAExB,iBAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5B,cAAIR,KAAI,KAAK,OAAO,CAAC;AAErB,iBAAO,YAAYQ,QAAOR,IAAG,OAAO,IAAI,OAAOQ,QAAO,GAAG,OAAO,IAAI,YAAY,KAAK,UAAUA,QAAO,KAAK,QAAQ,CAAC,GAAG,OAAO,IAAI;AAAA,QACpI;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAOA,IAAAX,cAAa,UAAU,WAAW,WAAY;AAC5C,aAAOW,QAAO,KAAK,QAAQ,CAAC;AAAA,IAC9B;AAOA,IAAAX,cAAa,UAAU,SAAS,WAAY;AAC1C,aAAO;AAAA,QACL,QAAQ;AAAA,QACR,QAAQ,KAAK;AAAA,QACb,OAAO,KAAK;AAAA,QACZ,KAAK,KAAK;AAAA,QACV,MAAM,KAAK;AAAA,QACX,UAAU,KAAK;AAAA,MACjB;AAAA,IACF;AAUA,IAAAA,cAAa,UAAU,WAAW,SAAU,GAAG;AAE7C,UAAI,GAAG;AAEL,YAAI,YAAY,CAAC,GAAG;AAClB,cAAI,EAAE,SAAS;AAAA,QACjB;AAEA,YAAI,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AACjC,gBAAM,IAAI,UAAU,2CAA2C;AAAA,QACjE;AAAA,MACF,OAAO;AAEL,YAAI;AAAA,MACN;AACA,UAAI,SAAS,IAAI,IAAI,IAAI;AACzB,UAAI,OAAO,IAAI,IAAI,CAAC,IAAI;AAGxB,UAAI,OAAO,KAAK,MAAM,CAAC;AACvB,UAAI,UAAU,KAAK,MAAM,CAAC;AAG1B,UAAI,IAAI,KAAK,IAAI,OAAO,MAAM,UAAU,MAAM;AAG9C,UAAI,SAAS,CAAC;AACd,UAAIK,SAAQ,CAAC;AACb,UAAI,MAAM,CAAC;AAEX,UAAI,CAAC,IAAI;AAET,eAAS,IAAI,QAAQ,IAAI,WAAW,OAAO,SAAS,GAAG,KAAK;AAE1D,YAAI,KAAK,KAAK,KAAK,CAAC;AACpB,YAAI,KAAK,KAAK,KAAK,IAAI,CAAC;AAExB,iBAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5B,cAAIF,KAAI,KAAK,OAAO,CAAC;AAErB,cAAIA,OAAM,IAAI,SAAS,MAAM;AAE3B,mBAAO,KAAK,KAAK,QAAQ,CAAC,CAAC;AAE3B,YAAAE,OAAM,OAAO,SAAS,CAAC,IAAIF,KAAI;AAE/B;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,UAAI,KAAK,OAAO,MAAM;AAEtB,aAAO,IAAIH,cAAa;AAAA,QACtB;AAAA,QACA,OAAAK;AAAA,QACA;AAAA,QACA,MAAM,CAAC,GAAG,CAAC;AAAA,MACb,CAAC;AAAA,IACH;AAUA,IAAAL,cAAa,WAAW,SAAU,MAAM;AACtC,aAAO,IAAIA,cAAa,IAAI;AAAA,IAC9B;AAcA,IAAAA,cAAa,WAAW,SAAUM,OAAM,OAAO,GAAG,cAAc,UAAU;AACxE,UAAI,CAAC,QAAQA,KAAI,GAAG;AAClB,cAAM,IAAI,UAAU,gCAAgC;AAAA,MACtD;AACA,UAAIA,MAAK,WAAW,GAAG;AACrB,cAAM,IAAI,MAAM,0CAA0C;AAAA,MAC5D;AAGA,MAAAA,QAAOA,MAAK,IAAI,SAAU,GAAG;AAE3B,YAAI,YAAY,CAAC,GAAG;AAElB,cAAI,EAAE,SAAS;AAAA,QACjB;AAEA,YAAI,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,IAAI,GAAG;AAC1C,gBAAM,IAAI,MAAM,uCAAuC;AAAA,QACzD;AACA,eAAO;AAAA,MACT,CAAC;AAGD,UAAI,GAAG;AAEL,YAAI,YAAY,CAAC,GAAG;AAClB,cAAI,EAAE,SAAS;AAAA,QACjB;AAEA,YAAI,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AACjC,gBAAM,IAAI,UAAU,2CAA2C;AAAA,QACjE;AAAA,MACF,OAAO;AAEL,YAAI;AAAA,MACN;AAGA,UAAI,KAAKR;AAET,UAAI,OAAO;AACX,UAAI,SAAS,QAAQ,GAAG;AAEtB,aAAKD,OAAM,KAAKC,cAAa,CAAC,UAAU,QAAQ,CAAC,KAAKA;AAEtD,eAAOD,OAAM,QAAQ,GAAG,QAAQ;AAAA,MAClC;AACA,UAAI,SAAS,IAAI,IAAI,IAAI;AACzB,UAAI,OAAO,IAAI,IAAI,CAAC,IAAI;AAGxB,UAAI,OAAOS,MAAK,CAAC;AACjB,UAAI,UAAUA,MAAK,CAAC;AAGpB,UAAI,IAAI,KAAK,IAAI,OAAO,MAAM,UAAU,MAAM;AAG9C,UAAI;AAGJ,UAAI,QAAQ,KAAK,GAAG;AAElB,YAAI,MAAM,WAAW,GAAG;AAEtB,gBAAM,IAAI,MAAM,4BAA4B;AAAA,QAC9C;AAEA,iBAAS,SAASQ,QAAOX,IAAG;AAE1B,iBAAO,MAAMA,EAAC;AAAA,QAChB;AAAA,MACF,WAAW,SAAS,KAAK,GAAG;AAE1B,YAAI,KAAK,MAAM,KAAK;AAEpB,YAAI,GAAG,WAAW,KAAK,GAAG,CAAC,MAAM,GAAG;AAElC,gBAAM,IAAI,MAAM,uBAAuB;AAAA,QACzC;AAEA,iBAAS,SAASW,QAAOX,IAAG;AAE1B,iBAAO,MAAM,IAAI,CAACA,EAAC,CAAC;AAAA,QACtB;AAAA,MACF,OAAO;AAEL,iBAAS,SAASW,UAAS;AAEzB,iBAAO;AAAA,QACT;AAAA,MACF;AAGA,UAAI,SAAS,CAAC;AACd,UAAIT,SAAQ,CAAC;AACb,UAAI,MAAM,CAAC;AAGX,eAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAEhC,YAAI,KAAK,OAAO,MAAM;AAEtB,YAAIF,KAAI,IAAI;AAEZ,YAAIA,MAAK,KAAKA,KAAI,GAAG;AAEnB,cAAI,IAAI,OAAOA,EAAC;AAEhB,cAAI,CAAC,GAAG,GAAG,IAAI,GAAG;AAEhB,YAAAE,OAAM,KAAKF,KAAI,IAAI;AAEnB,mBAAO,KAAK,CAAC;AAAA,UACf;AAAA,QACF;AAAA,MACF;AAEA,UAAI,KAAK,OAAO,MAAM;AAEtB,aAAO,IAAIH,cAAa;AAAA,QACtB;AAAA,QACA,OAAAK;AAAA,QACA;AAAA,QACA,MAAM,CAAC,MAAM,OAAO;AAAA,MACtB,CAAC;AAAA,IACH;AAWA,IAAAL,cAAa,UAAU,WAAW,SAAUG,IAAG,GAAG;AAEhD,UAAI,CAAC,SAASA,EAAC,KAAK,CAAC,UAAUA,EAAC,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AAClE,cAAM,IAAI,MAAM,qCAAqC;AAAA,MACvD;AAEA,UAAI,KAAK,MAAM,WAAW,GAAG;AAC3B,cAAM,IAAI,MAAM,0CAA0C;AAAA,MAC5D;AAEA,oBAAcA,IAAG,KAAK,MAAM,CAAC,CAAC;AAC9B,oBAAc,GAAG,KAAK,MAAM,CAAC,CAAC;AAG9B,MAAAH,cAAa,UAAUG,IAAG,GAAG,KAAK,MAAM,CAAC,GAAG,KAAK,SAAS,KAAK,QAAQ,KAAK,IAAI;AAEhF,aAAO;AAAA,IACT;AAWA,IAAAH,cAAa,cAAc,SAAU,GAAG,QAAQK,QAAO,KAAK,UAAU;AAEpE,UAAI,KAAK,IAAI,CAAC;AACd,UAAI,KAAK,IAAI,IAAI,CAAC;AAGlB,eAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5B,iBAASA,OAAM,CAAC,GAAG,OAAO,CAAC,CAAC;AAAA,MAC9B;AAAA,IACF;AAYA,IAAAL,cAAa,YAAY,SAAU,GAAG,GAAG,SAAS,QAAQK,QAAO,KAAK;AAEpE,eAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAEhC,YAAI,KAAK,IAAI,CAAC;AACd,YAAI,KAAK,IAAI,IAAI,CAAC;AAElB,YAAI,KAAK,eAAe,GAAG,IAAI,IAAIA,MAAK;AAExC,YAAI,KAAK,eAAe,GAAG,IAAI,IAAIA,MAAK;AAExC,YAAI,KAAK,MAAM,KAAK,MAAMA,OAAM,EAAE,MAAM,KAAKA,OAAM,EAAE,MAAM,GAAG;AAE5D,cAAI,QAAQ;AACV,gBAAI,IAAI,OAAO,EAAE;AACjB,mBAAO,EAAE,IAAI,OAAO,EAAE;AACtB,mBAAO,EAAE,IAAI;AAAA,UACf;AAEA;AAAA,QACF;AAEA,YAAI,KAAK,MAAMA,OAAM,EAAE,MAAM,MAAM,MAAM,MAAMA,OAAM,EAAE,MAAM,IAAI;AAE/D,cAAI,KAAK,SAAS,OAAO,EAAE,IAAI;AAE/B,UAAAA,OAAM,OAAO,IAAI,GAAG,CAAC;AACrB,cAAI,QAAQ;AACV,mBAAO,OAAO,IAAI,GAAG,EAAE;AAAA,UACzB;AAEA,UAAAA,OAAM,OAAO,MAAM,KAAK,KAAK,IAAI,IAAI,CAAC;AACtC,cAAI,QAAQ;AACV,mBAAO,OAAO,MAAM,KAAK,KAAK,IAAI,IAAI,CAAC;AAAA,UACzC;AAEA;AAAA,QACF;AAEA,YAAI,KAAK,MAAMA,OAAM,EAAE,MAAM,MAAM,MAAM,MAAMA,OAAM,EAAE,MAAM,IAAI;AAE/D,cAAI,KAAK,SAAS,OAAO,EAAE,IAAI;AAE/B,UAAAA,OAAM,OAAO,IAAI,GAAG,CAAC;AACrB,cAAI,QAAQ;AACV,mBAAO,OAAO,IAAI,GAAG,EAAE;AAAA,UACzB;AAEA,UAAAA,OAAM,OAAO,MAAM,KAAK,KAAK,IAAI,IAAI,CAAC;AACtC,cAAI,QAAQ;AACV,mBAAO,OAAO,MAAM,KAAK,KAAK,IAAI,IAAI,CAAC;AAAA,UACzC;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,WAAOL;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,EACX,CAAC;;;ACt+CD,MAAIe,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AAO3B,WAAS,yBAAyB,OAAO;AACvC,QAAI,2BAA2B,MAAM,MAAM,wCAAwC;AACnF,QAAI,0BAA0B;AAC5B,UAAI,QAAQ;AAAA,QACV,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,MACR,EAAE,yBAAyB,CAAC,CAAC;AAC7B,UAAI,cAAc,yBAAyB,CAAC;AAC5C,UAAI,iBAAiB,yBAAyB,CAAC;AAC/C,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF,OAAO;AACL,aAAO;AAAA,IACT;AAAA,EACF;AAOA,WAAS,8BAA8B,OAAO;AAC5C,QAAI,IAAI,SAAS,MAAM,aAAa,MAAM,KAAK;AAC/C,QAAI,IAAI;AACR,aAASC,KAAI,GAAGA,KAAI,MAAM,eAAe,QAAQA,MAAK;AACpD,UAAI,aAAa,SAAS,MAAM,eAAeA,EAAC,GAAG,MAAM,KAAK;AAC9D,WAAK,aAAa,KAAK,IAAI,MAAM,OAAOA,KAAI,CAAC;AAAA,IAC/C;AACA,QAAI,SAAS,IAAI;AACjB,QAAI,MAAM,MAAM,GAAG;AACjB,YAAM,IAAI,YAAY,aAAa,MAAM,QAAQ,yBAAyB;AAAA,IAC5E;AACA,WAAO;AAAA,EACT;AACO,MAAI,eAA8B,wBAAQF,QAAMC,gBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAE;AAAA,IACF,IAAI;AA0BJ,QAAIC,UAASD,OAAM,UAAU;AAAA,MAC3B,IAAI,SAAS,IAAI;AACf,eAAO;AAAA,MACT;AAAA,MACA,QAAQ,SAASC,QAAO,GAAG;AACzB,eAAO;AAAA,MACT;AAAA,MACA,QAAQ,SAASC,QAAO,GAAG;AACzB,YAAI,MAAM,MAAO,QAAO;AACxB,YAAI,wBAAwB,yBAAyB,CAAC;AACtD,YAAI,uBAAuB;AACzB,iBAAO,8BAA8B,qBAAqB;AAAA,QAC5D;AACA,YAAIC,QAAO;AACX,YAAI,sBAAsB,EAAE,MAAM,+BAA+B;AACjE,YAAI,qBAAqB;AAGvB,UAAAA,QAAO,OAAO,oBAAoB,CAAC,CAAC;AACpC,cAAI,oBAAoB,CAAC;AAAA,QAC3B;AACA,YAAI,MAAM,OAAO,CAAC;AAClB,YAAI,MAAM,GAAG,GAAG;AACd,gBAAM,IAAI,YAAY,aAAa,IAAI,yBAAyB;AAAA,QAClE;AACA,YAAI,qBAAqB;AAGvB,cAAI,MAAM,KAAKA,QAAO,GAAG;AAEvB,kBAAM,IAAI,YAAY,WAAY,OAAO,GAAG,mBAAoB,CAAC;AAAA,UACnE;AAEA,cAAI,OAAO,MAAMA,QAAO,IAAI;AAC1B,kBAAM,MAAM,KAAKA;AAAA,UACnB;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAAA,MACA,WAAW,SAASC,WAAU,GAAG;AAC/B,eAAO,EAAE,SAAS;AAAA,MACpB;AAAA,MACA,QAAQ,SAASC,QAAO,GAAG;AACzB,eAAO,OAAO,CAAC;AAAA,MACjB;AAAA,MACA,UAAU,SAASC,UAAS,GAAG;AAC7B,eAAO,EAAE,QAAQ;AAAA,MACnB;AAAA,MACA,MAAMN,OAAM,YAAY,CAAAO,UAAQ,OAAK;AACnC,YAAIC,SAAQ,EAAE,MAAM;AACpB,QAAAA,OAAM,QAAQD,MAAK,EAAE,KAAK;AAC1B,eAAOC;AAAA,MACT,CAAC;AAAA,MACD,MAAM,SAASC,OAAM,GAAG;AACtB,eAAO;AAAA,MACT;AAAA,MACA,uBAAuB,SAAS,kBAAkBC,OAAM,eAAe;AACrE,eAAOA,MAAK,SAAS,aAAa;AAAA,MACpC;AAAA,MACA,kBAAkBV,OAAM,YAAY,CAAAO,UAAQ,OAAKI,SAAQ,GAAGJ,KAAI,CAAC;AAAA,IACnE,CAAC;AAOD,IAAAN,QAAO,WAAW,SAAU,MAAM;AAChC,aAAO,WAAW,KAAK,KAAK;AAAA,IAC9B;AACA,WAAOA;AAAA,EACT,CAAC;;;ACnJD,MAAIW,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,eAA8B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AA4BJ,QAAIC,UAASD,OAAM,UAAU;AAAA,MAC3B,IAAI,SAAS,IAAI;AACf,eAAO;AAAA,MACT;AAAA,MACA,QAAQ,SAASC,QAAO,GAAG;AACzB,eAAO;AAAA,MACT;AAAA,MACA,QAAQ,SAASC,QAAO,GAAG;AACzB,eAAO,OAAO,EAAE,QAAQ,CAAC;AAAA,MAC3B;AAAA,MACA,WAAW,SAASC,WAAU,GAAG;AAC/B,eAAO,OAAO,EAAE,MAAM,EAAE,SAAS,CAAC;AAAA,MACpC;AAAA,MACA,UAAU,SAASC,UAAS,GAAG;AAC7B,eAAO,OAAO,EAAE,QAAQ,EAAE,QAAQ,CAAC;AAAA,MACrC;AAAA,MACA,oBAAoB,SAAS,gBAAgB,GAAG;AAC9C,eAAO,OAAO,CAAC;AAAA,MACjB;AAAA,MACA,MAAM,SAASC,OAAM,GAAG;AACtB,eAAO;AAAA,MACT;AAAA,MACA,kBAAkBL,OAAM,YAAY,CAAAM,UAAQ,OAAKC,SAAQ,GAAGD,KAAI,CAAC;AAAA,IACnE,CAAC;AAOD,IAAAL,QAAO,WAAW,SAAU,MAAM;AAChC,aAAO,OAAO,KAAK,KAAK;AAAA,IAC1B;AACA,WAAOA;AAAA,EACT,CAAC;;;AClED,MAAIO,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,eAA8B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AA8BJ,WAAOA,OAAMF,QAAM;AAAA,MACjB,IAAI,SAAS,IAAI;AACf,eAAO;AAAA,MACT;AAAA,MACA,QAAQ;AAAA,MACR,MAAM,SAASG,OAAM,GAAG;AACtB,eAAO;AAAA,MACT;AAAA,MACA,SAAS,SAASC,SAAQ,GAAG;AAC3B,eAAO,IAAI;AAAA,MACb;AAAA,MACA,QAAQ,SAASC,QAAO,GAAG;AACzB,eAAO;AAAA,MACT;AAAA,MACA,kBAAkBH,OAAM,YAAY,CAAAI,UAAQ,OAAKC,SAAQ,GAAGD,KAAI,CAAC;AAAA,MACjE,KAAK,SAAS,IAAI,GAAG;AACnB,eAAO,OAAO,CAAC;AAAA,MACjB;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACvDD,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,gBAA+B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC5E,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAkCJ,WAAOA,OAAMF,QAAM;AAAA,MACjB,IAAI,SAAS,IAAI;AACf,eAAO;AAAA,MACT;AAAA,MACA,SAAS,SAASG,SAAQ,GAAG;AAC3B,eAAO;AAAA,MACT;AAAA,MACA,QAAQ,SAASC,QAAO,GAAG;AACzB,eAAO,CAAC,CAAC;AAAA,MACX;AAAA,MACA,MAAM,SAASC,OAAM,GAAG;AACtB,eAAO;AAAA,MACT;AAAA,MACA,WAAW,SAASC,WAAU,GAAG;AAC/B,eAAO,CAAC,EAAE,OAAO;AAAA,MACnB;AAAA,MACA,QAAQ,SAASC,QAAO,GAAG;AAEzB,YAAI,QAAQ,EAAE,YAAY;AAC1B,YAAI,UAAU,QAAQ;AACpB,iBAAO;AAAA,QACT,WAAW,UAAU,SAAS;AAC5B,iBAAO;AAAA,QACT;AAGA,YAAI,MAAM,OAAO,CAAC;AAClB,YAAI,MAAM,MAAM,CAAC,MAAM,GAAG,GAAG;AAC3B,iBAAO,CAAC,CAAC;AAAA,QACX;AACA,cAAM,IAAI,MAAM,qBAAqB,IAAI,gBAAgB;AAAA,MAC3D;AAAA,MACA,kBAAkBL,OAAM,YAAY,CAAAM,UAAQ,OAAKC,SAAQ,GAAGD,KAAI,CAAC;AAAA,IACnE,CAAC;AAAA,EACH,CAAC;;;ACzED,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,WAAW;AACjC,MAAI,kBAAiC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AA0BJ,WAAOD,OAAM,aAAa;AAAA,MACxB,IAAI,SAAS,IAAI;AACf,eAAO,IAAIC,WAAU,CAAC;AAAA,MACxB;AAAA,MACA,QAAQ,SAASC,QAAO,GAAG;AAEzB,eAAO,IAAID,WAAU,IAAI,EAAE;AAAA,MAC7B;AAAA,MACA,QAAQ,SAASE,QAAO,GAAG;AACzB,YAAI,sBAAsB,EAAE,MAAM,+BAA+B;AACjE,YAAI,qBAAqB;AAEvB,cAAIC,QAAO,oBAAoB,CAAC;AAChC,cAAI,IAAIH,WAAU,oBAAoB,CAAC,CAAC;AACxC,cAAI,aAAa,IAAIA,WAAU,CAAC,EAAE,IAAI,OAAOG,KAAI,CAAC;AAClD,cAAI,EAAE,GAAG,WAAW,IAAI,CAAC,CAAC,GAAG;AAC3B,kBAAM,IAAI,YAAY,WAAY,OAAO,GAAG,mBAAoB,CAAC;AAAA,UACnE;AACA,cAAI,mBAAmB,IAAIH,WAAU,CAAC,EAAE,IAAI,OAAOG,KAAI,IAAI,CAAC;AAC5D,cAAI,EAAE,IAAI,gBAAgB,GAAG;AAC3B,mBAAO,EAAE,IAAI,UAAU;AAAA,UACzB,OAAO;AACL,mBAAO;AAAA,UACT;AAAA,QACF;AACA,eAAO,IAAIH,WAAU,CAAC;AAAA,MACxB;AAAA,MACA,WAAW,SAASA,WAAU,GAAG;AAE/B,eAAO;AAAA,MACT;AAAA,MACA,QAAQ,SAASI,QAAO,GAAG;AACzB,eAAO,IAAIJ,WAAU,EAAE,SAAS,CAAC;AAAA,MACnC;AAAA,MACA,MAAMD,OAAM,YAAY,CAAAM,UAAQ,OAAK;AACnC,YAAIC,SAAQ,EAAE,MAAM;AACpB,QAAAA,OAAM,QAAQD,MAAK,EAAE,KAAK;AAC1B,eAAOC;AAAA,MACT,CAAC;AAAA,MACD,UAAU,SAASC,UAAS,GAAG;AAC7B,eAAO,IAAIP,WAAU,OAAO,EAAE,CAAC,CAAC,EAAE,IAAI,OAAO,EAAE,CAAC,CAAC,EAAE,MAAM,OAAO,EAAE,CAAC,CAAC;AAAA,MACtE;AAAA,MACA,MAAM,SAASQ,OAAM,IAAI;AACvB,eAAO,IAAIR,WAAU,CAAC;AAAA,MACxB;AAAA,MACA,kBAAkBD,OAAM,YAAY,CAAAM,UAAQ,OAAKI,SAAQ,GAAGJ,KAAI,CAAC;AAAA,IACnE,CAAC;AAAA,EACH,CAAC;;;AC/ED,MAAIK,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,SAAS;AAC/B,MAAI,gBAA+B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC5E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,SAAAC;AAAA,IACF,IAAI;AA6CJ,WAAOD,OAAM,WAAW;AAAA,MACtB,IAAI,SAAS,IAAI;AACf,eAAOC,SAAQ;AAAA,MACjB;AAAA,MACA,QAAQ,SAASC,QAAO,GAAG;AACzB,eAAO,IAAID,SAAQ,GAAG,CAAC;AAAA,MACzB;AAAA,MACA,kBAAkB,SAAS,cAAcE,KAAIC,KAAI;AAC/C,eAAO,IAAIH,SAAQE,KAAIC,GAAE;AAAA,MAC3B;AAAA;AAAA,MAEA,wBAAwB,SAAS,oBAAoBD,KAAIC,KAAI;AAC3D,eAAO,IAAIH,SAAQE,IAAG,SAAS,GAAGC,IAAG,SAAS,CAAC;AAAA,MACjD;AAAA,MACA,UAAU,SAASC,UAAS,GAAG;AAC7B,eAAO,IAAIJ,SAAQ,EAAE,QAAQ,GAAG,CAAC;AAAA,MACnC;AAAA,MACA,SAAS,SAASA,SAAQ,GAAG;AAC3B,eAAO,EAAE,MAAM;AAAA,MACjB;AAAA,MACA,QAAQ,SAASK,QAAO,GAAG;AACzB,eAAOL,SAAQ,CAAC;AAAA,MAClB;AAAA,MACA,MAAM,SAASM,OAAM,GAAG;AACtB,eAAON,SAAQ,CAAC;AAAA,MAClB;AAAA,MACA,QAAQ,SAASO,QAAO,GAAG;AACzB,YAAI,QAAQ,KAAK,QAAQ,GAAG;AAC1B,iBAAO,IAAIP,SAAQ,EAAE,IAAI,EAAE,EAAE;AAAA,QAC/B;AACA,YAAI,OAAO,KAAK,SAAS,KAAK,SAAS,KAAK,SAAS,GAAG;AACtD,iBAAO,IAAIA,SAAQ,CAAC;AAAA,QACtB;AACA,cAAM,IAAI,MAAM,6EAA6E;AAAA,MAC/F;AAAA,MACA,kBAAkBD,OAAM,YAAY,CAAAS,UAAQ,OAAKC,SAAQ,GAAGD,KAAI,CAAC;AAAA,IACnE,CAAC;AAAA,EACH,CAAC;;;ACxFD,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU;AAChC,MAAI,iBAAgC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC7E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,UAAAC;AAAA,IACF,IAAI;AA8CJ,WAAOD,OAAM,YAAY;AAAA,MACvB,QAAQ,SAASE,QAAO,GAAG;AACzB,YAAI,CAAC,OAAO,SAAS,CAAC,KAAK,MAAM,CAAC,GAAG;AACnC,gBAAM,IAAI,MAAM,IAAI,sCAAsC;AAAA,QAC5D;AACA,eAAO,IAAID,UAAS,CAAC;AAAA,MACvB;AAAA,MACA,QAAQ,SAASE,QAAO,GAAG;AACzB,eAAO,IAAIF,UAAS,CAAC;AAAA,MACvB;AAAA,MACA,kBAAkB,SAAS,cAAc,WAAW,aAAa;AAC/D,eAAO,IAAIA,UAAS,WAAW,WAAW;AAAA,MAC5C;AAAA,MACA,kBAAkB,SAAS,cAAc,WAAW,aAAa;AAC/D,eAAO,IAAIA,UAAS,WAAW,WAAW;AAAA,MAC5C;AAAA,MACA,MAAM,SAASG,OAAM,GAAG;AACtB,eAAO,IAAIH,UAAS,CAAC;AAAA,MACvB;AAAA,MACA,WAAW,SAASI,WAAU,GAAG;AAC/B,eAAO,IAAIJ,UAAS,EAAE,SAAS,CAAC;AAAA,MAClC;AAAA,MACA,QAAQ,SAASK,QAAO,GAAG;AACzB,eAAO,IAAIL,UAAS,EAAE,SAAS,CAAC;AAAA,MAClC;AAAA,MACA,UAAU,SAASA,UAAS,GAAG;AAC7B,eAAO;AAAA,MACT;AAAA,MACA,MAAMD,OAAM,YAAY,CAAAO,UAAQ,OAAK;AACnC,YAAIC,SAAQ,EAAE,MAAM;AACpB,QAAAA,OAAM,QAAQD,MAAK,EAAE,KAAK;AAC1B,eAAOC;AAAA,MACT,CAAC;AAAA,MACD,QAAQ,SAASC,QAAO,GAAG;AACzB,eAAO,IAAIR,UAAS,CAAC;AAAA,MACvB;AAAA,MACA,kBAAkBD,OAAM,YAAY,CAAAO,UAAQ,OAAKG,SAAQ,GAAGH,KAAI,CAAC;AAAA,IACnE,CAAC;AAAA,EACH,CAAC;;;AC3FD,MAAII,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,eAAe,cAAc;AAC7D,MAAI,eAA8B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,cAAAC;AAAA,IACF,IAAI;AAwCJ,WAAOH,OAAMF,QAAM;AAAA,MACjB,IAAI,SAAS,IAAI;AACf,eAAO,QAAQ,CAAC,CAAC;AAAA,MACnB;AAAA,MACA,QAAQ,SAASM,QAAOC,SAAQ;AAC9B,eAAO,QAAQ,CAAC,GAAGA,OAAM;AAAA,MAC3B;AAAA,MACA,kBAAkB,SAAS,cAAcA,SAAQ,UAAU;AACzD,eAAO,QAAQ,CAAC,GAAGA,SAAQ,QAAQ;AAAA,MACrC;AAAA,MACA,OAAO,SAASC,OAAM,MAAM;AAC1B,eAAO,QAAQ,IAAI;AAAA,MACrB;AAAA,MACA,QAAQ,SAASL,QAAO,MAAM;AAC5B,eAAO,QAAQ,MAAM,KAAK,QAAQ,CAAC;AAAA,MACrC;AAAA,MACA,0BAA0B;AAAA,MAC1B,kCAAkC;AAAA,IACpC,CAAC;AAUD,aAAS,QAAQ,MAAMI,SAAQ,UAAU;AAEvC,UAAIA,YAAW,WAAWA,YAAW,aAAaA,YAAW,QAAW;AACtE,eAAO,IAAIH,aAAY,MAAM,QAAQ;AAAA,MACvC;AACA,UAAIG,YAAW,UAAU;AACvB,eAAO,IAAIF,cAAa,MAAM,QAAQ;AAAA,MACxC;AACA,YAAM,IAAI,UAAU,yBAAyB,KAAK,UAAUE,OAAM,IAAI,GAAG;AAAA,IAC3E;AAAA,EACF,CAAC;;;ACtFD,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,QAAQ;AACxC,MAAI,2BAA0C,wBAAQD,QAAMC,gBAAc,UAAQ;AACvF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AA+DJ,WAAOF,OAAMF,QAAM;AAAA,MACjB,4CAA4C,SAAS,qCAAqCK,OAAM,IAAIC,SAAQ,UAAU;AACpH,eAAO,QAAQD,OAAM,IAAIC,SAAQ,QAAQ;AAAA,MAC3C;AAAA,MACA,oCAAoC,SAAS,8BAA8BD,OAAM,IAAIC,SAAQ;AAC3F,eAAO,QAAQD,OAAM,IAAIC,OAAM;AAAA,MACjC;AAAA,MACA,oBAAoB,SAAS,gBAAgBD,OAAM,IAAI;AACrD,eAAO,QAAQA,OAAM,IAAI,OAAO;AAAA,MAClC;AAAA,MACA,mBAAmB,SAAS,eAAeA,OAAM,IAAI;AACnD,eAAO,QAAQA,OAAM,IAAI,OAAO,EAAE,QAAQ;AAAA,MAC5C;AAAA,MACA,oCAAoC,SAAS,8BAA8BA,OAAMC,SAAQ,IAAI;AAC3F,eAAO,QAAQD,OAAM,IAAIC,OAAM;AAAA,MACjC;AAAA,MACA,4CAA4C,SAAS,qCAAqCD,OAAMC,SAAQ,UAAU,IAAI;AACpH,eAAO,QAAQD,OAAM,IAAIC,SAAQ,QAAQ;AAAA,MAC3C;AAAA,IACF,CAAC;AACD,aAAS,QAAQD,OAAM,IAAIC,SAAQ,UAAU;AAC3C,UAAI;AACJ,UAAI,aAAa,QAAW;AAC1B,YAAIH,QAAOG,SAAQ,QAAQ;AAAA,MAC7B,OAAO;AACL,YAAIH,QAAOG,OAAM;AAAA,MACnB;AACA,QAAE,OAAOD,KAAI;AACb,QAAE,QAAQ,SAAU,GAAGE,QAAO;AAC5B,YAAI,MAAM,GAAGA,MAAK;AAClB,YAAIH,QAAO,GAAG,EAAG;AACjB,UAAE,IAAIG,QAAO,GAAG;AAAA,MAClB,CAAC;AACD,aAAO;AAAA,IACT;AAAA,EACF,CAAC;;;ACzGD,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,WAAW,MAAM;AACjD,MAAI,uBAAsC,wBAAQD,QAAMC,gBAAc,UAAQ;AACnF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,MACA,MAAAC;AAAA,IACF,IAAI;AAuBJ,WAAOH,OAAMF,QAAM;AAAA,MACjB,YAAY,SAASM,OAAM,KAAK;AAC9B,eAAO,aAAa,GAAG;AAAA,MACzB;AAAA,MACA,aAAa,SAASC,QAAO,KAAK;AAChC,eAAOJ,QAAO,aAAa,IAAI,IAAI,OAAK,EAAE,QAAQ,CAAC,CAAC,CAAC;AAAA,MACvD;AAAA;AAAA,IAGF,CAAC;AACD,aAAS,aAAa,KAAK;AACzB,UAAI,IAAI,WAAW,EAAG,OAAM,IAAI,UAAU,mDAAmD;AAC7F,UAAI,IAAI,+BAA+B,IAAI,CAAC,CAAC;AAC7C,UAAI,SAAS,CAAC;AACd,eAASK,QAAO,KAAK;AACnB,YAAI,YAAY,+BAA+BA,IAAG;AAClD,YAAI,cAAc,GAAG;AACnB,gBAAM,IAAI,UAAU,wCAAwC,IAAI,KAAK,cAAS,YAAY,EAAE;AAAA,QAC9F;AACA,eAAO,KAAKJ,SAAQI,IAAG,CAAC;AAAA,MAC1B;AACA,aAAO;AAAA,IACT;AACA,aAAS,+BAA+B,KAAK;AAC3C,UAAI,IAAIH,MAAK,GAAG;AAChB,UAAI,EAAE,WAAW,GAAG;AAElB,eAAO,EAAE,CAAC;AAAA,MACZ,WAAW,EAAE,WAAW,GAAG;AAEzB,YAAI,EAAE,CAAC,MAAM,GAAG;AAEd,iBAAO,EAAE,CAAC;AAAA,QACZ,WAAW,EAAE,CAAC,MAAM,GAAG;AAErB,iBAAO,EAAE,CAAC;AAAA,QACZ,OAAO;AACL,gBAAM,IAAI,UAAU,gDAAgD;AAAA,QACtE;AAAA,MACF,OAAO;AACL,cAAM,IAAI,UAAU,qDAAqD;AAAA,MAC3E;AAAA,IACF;AAAA,EACF,CAAC;;;AC1ED,MAAII,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,WAAW,MAAM;AACjD,MAAI,0BAAyC,wBAAQD,QAAMC,gBAAc,UAAQ;AACtF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,MACA,MAAAC;AAAA,IACF,IAAI;AAuBJ,WAAOH,OAAMF,QAAM;AAAA,MACjB,YAAY,SAASM,OAAM,KAAK;AAC9B,eAAO,aAAa,GAAG;AAAA,MACzB;AAAA,MACA,aAAa,SAASC,QAAO,KAAK;AAChC,eAAOJ,QAAO,aAAa,IAAI,IAAI,OAAK,EAAE,QAAQ,CAAC,CAAC,CAAC;AAAA,MACvD;AAAA;AAAA,IAGF,CAAC;AACD,aAAS,aAAa,KAAK;AACzB,UAAI,IAAI,WAAW,EAAG,OAAM,IAAI,UAAU,sDAAsD;AAChG,UAAI,IAAI,+BAA+B,IAAI,CAAC,CAAC;AAG7C,UAAI,SAAS,CAAC;AACd,eAASK,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,eAAOA,EAAC,IAAI,CAAC;AAAA,MACf;AAGA,eAAS,OAAO,KAAK;AACnB,YAAI,YAAY,+BAA+B,GAAG;AAClD,YAAI,cAAc,GAAG;AACnB,gBAAM,IAAI,UAAU,wCAAwC,IAAI,KAAK,cAAS,YAAY,EAAE;AAAA,QAC9F;AACA,YAAI,IAAIJ,SAAQ,GAAG;AAGnB,iBAAS,KAAK,GAAG,KAAK,GAAG,MAAM;AAC7B,iBAAO,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC;AAAA,QACvB;AAAA,MACF;AACA,aAAO;AAAA,IACT;AACA,aAAS,+BAA+B,KAAK;AAC3C,UAAI,IAAIC,MAAK,GAAG;AAChB,UAAI,EAAE,WAAW,GAAG;AAElB,eAAO,EAAE,CAAC;AAAA,MACZ,WAAW,EAAE,WAAW,GAAG;AAEzB,YAAI,EAAE,CAAC,MAAM,GAAG;AAEd,iBAAO,EAAE,CAAC;AAAA,QACZ,WAAW,EAAE,CAAC,MAAM,GAAG;AAErB,iBAAO,EAAE,CAAC;AAAA,QACZ,OAAO;AACL,gBAAM,IAAI,UAAU,gDAAgD;AAAA,QACtE;AAAA,MACF,OAAO;AACL,cAAM,IAAI,UAAU,qDAAqD;AAAA,MAC3E;AAAA,IACF;AAAA,EACF,CAAC;;;ACtFD,MAAII,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,kBAAiC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAoBJ,WAAOA,OAAMF,QAAM;AAAA,MACjB,eAAe,SAAS,WAAWG,OAAM,OAAO;AAC9C,eAAOA,MAAK,UAAU,KAAK;AAAA,MAC7B;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC5BD,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,mBAAkC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC/E,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAwBJ,WAAOA,OAAMF,QAAM;AAAA,MACjB,QAAQ;AAAA,MACR,kCAAkC,OAAK,EAAE,IAAI;AAAA,MAC7C,QAAQ,OAAK,CAAC;AAAA,MACd,MAAME,OAAM,YAAY,CAAAC,UAAQ,OAAK;AACnC,YAAI,MAAM,EAAE,MAAM;AAClB,YAAI,QAAQD,OAAM,KAAKC,OAAM,IAAI,UAAU,CAAC,EAAE,EAAE,KAAK;AACrD,eAAO;AAAA,MACT,CAAC;AAAA;AAAA,MAED,kBAAkBD,OAAM,YAAY,CAAAC,UAAQ,OAAKC,SAAQ,GAAGD,OAAM,IAAI,CAAC;AAAA;AAAA,IAGzE,CAAC;AAAA,EACH,CAAC;;;AC1CD,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,SAAS;AACzC,MAAI,kBAAiC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,IACF,IAAI;AAyBJ,WAAOF,OAAMF,QAAM;AAAA,MACjB,QAAQ;AAAA,MACR,SAAS,SAASK,SAAQ,GAAG;AAC3B,eAAO;AAAA,MACT;AAAA,MACA,WAAW,SAASC,WAAU,GAAG;AAC/B,eAAO;AAAA,MACT;AAAA,MACA,QAAQ,SAASC,QAAO,GAAG;AACzB,eAAO;AAAA,MACT;AAAA,MACA,UAAU,SAASC,UAAS,GAAG;AAC7B,eAAO;AAAA,MACT;AAAA,MACA,MAAM,SAASC,MAAK,GAAG;AACrB,eAAO,EAAE,MAAM;AAAA,MACjB;AAAA;AAAA,MAEA,kBAAkBP,OAAM,YAAY,CAAAQ,UAAQ,OAAKC,SAAQ,GAAGD,OAAM,IAAI,CAAC;AAAA,MACvE,SAAS,SAASE,SAAQ,GAAG;AAC3B,eAAOR,SAAQ,IAAI,IAAI,GAAGD,QAAO,MAAM;AAAA,MACzC;AAAA,MACA,QAAQ,SAASU,QAAO,GAAG;AACzB,eAAOT,SAAQ,GAAG,eAAe,GAAGD,OAAM,CAAC;AAAA,MAC7C;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC3DD,MAAIW,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,YAA2B,wBAAQD,QAAMC,gBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAyBJ,WAAOA,OAAMF,QAAM;AAAA,MACjB,QAAQ;AAAA,MACR,yCAAyC,OAAK,EAAE,IAAI;AAAA,MACpD,QAAQ,OAAK,IAAI,KAAK,CAAC,IAAI;AAAA;AAAA,MAE3B,kBAAkBE,OAAM,YAAY,CAAAC,UAAQ,OAAKC,SAAQ,GAAGD,OAAM,IAAI,CAAC;AAAA,IACzE,CAAC;AAAA,EACH,CAAC;;;ACpCD,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,WAAW;AACjC,MAAI,kBAAiC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AAsCJ,WAAOD,OAAMF,QAAM;AAAA,MACjB,gDAAgD,SAAS,yCAAyC,KAAK,KAAK,UAAU;AACpH,YAAI,CAACG,WAAU,GAAG,GAAG;AACnB,gBAAM,IAAI,UAAU,uCAAuC;AAAA,QAC7D;AACA,YAAIC,QAAO,MAAM,QAAQ,GAAG,IAAI,UAAU,GAAG,IAAI,IAAI,KAAK;AAC1D,YAAI,MAAM,KAAK,OAAOA,MAAK,QAAQ;AACjC,gBAAM,IAAI,WAAW,KAAKA,MAAK,MAAM;AAAA,QACvC;AACA,YAAI,SAAS,GAAG,GAAG;AACjB,iBAAO,IAAI,OAAO,WAAW,IAAI,QAAQ,GAAG,KAAK,QAAQ,GAAG,IAAI,SAAS,CAAC;AAAA,QAC5E,OAAO;AACL,iBAAO,WAAW,KAAK,KAAK,QAAQ;AAAA,QACtC;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,GAAG;AAAA,IACD,UAAU;AAAA,EACZ,CAAC;AAUD,WAAS,WAAW,KAAK,KAAK,UAAU;AACtC,QAAIC,IAAG,KAAK;AACZ,QAAI,OAAO,GAAG;AACZ,UAAI,CAAC,MAAM,QAAQ,IAAI,CAAC,CAAC,GAAG;AAC1B,eAAO,SAAS,GAAG;AAAA,MACrB,OAAO;AACL,eAAOC,SAAQ,GAAG;AAClB,cAAM,CAAC;AACP,aAAKD,KAAI,GAAGA,KAAI,KAAK,QAAQA,MAAK;AAChC,cAAIA,EAAC,IAAI,WAAW,KAAKA,EAAC,GAAG,MAAM,GAAG,QAAQ;AAAA,QAChD;AACA,eAAO;AAAA,MACT;AAAA,IACF,OAAO;AACL,YAAM,CAAC;AACP,WAAKA,KAAI,GAAGA,KAAI,IAAI,QAAQA,MAAK;AAC/B,YAAIA,EAAC,IAAI,WAAW,IAAIA,EAAC,GAAG,MAAM,GAAG,QAAQ;AAAA,MAC/C;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAQA,WAASC,SAAQ,KAAK;AACpB,QAAI,IAAI,IAAI;AACZ,QAAI,IAAI,IAAI,CAAC,EAAE;AACf,QAAID,IAAG;AACP,QAAI,MAAM,CAAC;AACX,SAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AACtB,UAAI,MAAM,CAAC;AACX,WAAKA,KAAI,GAAGA,KAAI,GAAGA,MAAK;AACtB,YAAI,KAAK,IAAIA,EAAC,EAAE,CAAC,CAAC;AAAA,MACpB;AACA,UAAI,KAAK,GAAG;AAAA,IACd;AACA,WAAO;AAAA,EACT;;;ACnHA,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,kBAAiC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAaJ,WAAOA,OAAMF,QAAM;AAAA,MACjB,kBAAkB;AAAA,MAClB,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,eAAO,EAAE,IAAI,CAAC;AAAA,MAChB;AAAA,MACA,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,eAAO,EAAE,KAAK,CAAC;AAAA,MACjB;AAAA,MACA,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,eAAO,IAAI;AAAA,MACb;AAAA,MACA,sBAAsB,SAAS,kBAAkB,GAAG,GAAG;AACrD,eAAO,EAAE,IAAI,CAAC;AAAA,MAChB;AAAA,MACA,cAAcE,OAAM,YAAY,CAAAC,UAAQ,CAAC,GAAG,MAAM;AAChD,YAAI,EAAE,UAAU,QAAQ,EAAE,UAAU,QAAW;AAC7C,gBAAM,IAAI,MAAM,kDAAkD;AAAA,QACpE;AACA,YAAI,EAAE,UAAU,QAAQ,EAAE,UAAU,QAAW;AAC7C,gBAAM,IAAI,MAAM,kDAAkD;AAAA,QACpE;AACA,YAAI,CAAC,EAAE,UAAU,CAAC,EAAG,OAAM,IAAI,MAAM,oBAAoB;AACzD,YAAI,MAAM,EAAE,MAAM;AAClB,YAAI,QAAQD,OAAM,KAAKC,OAAM,CAAC,IAAI,UAAU,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,IAAI,OAAO,EAAE,KAAK;AACjF,YAAI,YAAY;AAChB,eAAO;AAAA,MACT,CAAC;AAAA,IACH,CAAC;AAAA,EACH,CAAC;;;AC9CD,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,uBAAsC,wBAAQD,QAAMC,gBAAc,UAAQ;AACnF,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAaJ,WAAOA,OAAMF,QAAM;AAAA,MACjB,kBAAkB;AAAA,MAClB,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,eAAO,EAAE,IAAI,CAAC;AAAA,MAChB;AAAA,MACA,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,eAAO,EAAE,MAAM,CAAC;AAAA,MAClB;AAAA,MACA,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,eAAO,IAAI;AAAA,MACb;AAAA,MACA,sBAAsB,SAAS,kBAAkB,GAAG,GAAG;AACrD,eAAO,EAAE,IAAI,CAAC;AAAA,MAChB;AAAA,MACA,cAAcE,OAAM,YAAY,CAAAC,UAAQ,CAAC,GAAG,MAAM;AAChD,YAAI,EAAE,UAAU,QAAQ,EAAE,UAAU,QAAW;AAC7C,gBAAM,IAAI,MAAM,kDAAkD;AAAA,QACpE;AACA,YAAI,EAAE,UAAU,QAAQ,EAAE,UAAU,QAAW;AAC7C,gBAAM,IAAI,MAAM,kDAAkD;AAAA,QACpE;AACA,YAAI,CAAC,EAAE,UAAU,CAAC,EAAG,OAAM,IAAI,MAAM,oBAAoB;AACzD,YAAI,MAAM,EAAE,MAAM;AAClB,YAAI,QAAQD,OAAM,KAAKC,OAAM,CAAC,IAAI,UAAU,GAAG,EAAE,UAAU,CAAC,CAAC,EAAE,IAAI,OAAO,EAAE,KAAK;AACjF,YAAI,YAAY;AAChB,eAAO;AAAA,MACT,CAAC;AAAA,IACH,CAAC;AAAA,EACH,CAAC;;;AC7CD,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,UAAU,SAAS,cAAc,cAAc,UAAU,WAAW,aAAa,UAAU;AACxG,MAAI,aAA4B,wBAAQD,QAAMC,gBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,QAAAC;AAAA,MACA,OAAAC;AAAA,MACA,YAAAC;AAAA,MACA,YAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,MACA,WAAAC;AAAA,MACA,UAAAC;AAAA,IACF,IAAI;AA2CJ,WAAON,OAAMH,QAAM;AAAA,MACjB,QAAQ;AAAA;AAAA;AAAA,MAIR,SAAS;AAAA,MACT,oBAAoB;AAAA,MACpB,WAAW,SAASQ,WAAU,GAAG;AAC/B,eAAO,EAAE,KAAK;AAAA,MAChB;AAAA,MACA,MAAM;AAAA,IACR,CAAC;AAWD,aAAS,aAAa,GAAG,UAAU;AAGjC,UAAI,OAAO,EAAE,IAAI,IAAI;AACrB,UAAIE,OAAM,EAAE,IAAI;AAGhB,UAAI,YAAY,IAAIH,SAAQ,WAAWG,IAAG,GAAG,CAAC,EAAE,IAAI,IAAIH,SAAQ,GAAG,IAAI,EAAE,IAAI,CAAC;AAC9E,UAAI,UAAU;AACZ,YAAI,MAAM,CAAC,WAAW,IAAIA,SAAQ,WAAWG,IAAG,GAAG,CAAC,EAAE,IAAI,IAAIH,SAAQ,GAAG,OAAO,KAAK,KAAK,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,IAAIA,SAAQ,WAAWG,IAAG,GAAG,CAAC,EAAE,IAAI,IAAIH,SAAQ,GAAG,OAAO,KAAK,KAAK,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;AAC1L,eAAOL,QAAO,WAAW,UAAU,MAAMI,QAAO,GAAG;AAAA,MACrD,OAAO;AACL,eAAO;AAAA,MACT;AAAA,IACF;AAQA,aAAS,UAAU,GAAG;AACpB,UAAI,EAAE,SAAS,UAAU,EAAE,KAAK,GAAG;AACjC,YAAI,SAAS,EAAE,MAAM;AACrB,eAAO,QAAQ;AACf,iBAAS,OAAO,IAAI,IAAM,CAAC;AAC3B,eAAO,QAAQ,aAAa,EAAE,KAAK;AACnC,eAAO;AAAA,MACT,OAAO;AACL,YAAI,SAASF,YAAW,EAAE,KAAK;AAC/B,YAAI,QAAQ;AACV,YAAE,QAAQC,YAAW,EAAE,KAAK;AAAA,QAC9B;AAGA,YAAI;AACJ,YAAI,YAAY,EAAE,KAAK,GAAG;AACxB,kBAAQ,IAAIG,WAAU,CAAC,EAAE,IAAI,CAAC;AAAA,QAChC,WAAW,WAAW,EAAE,KAAK,GAAG;AAC9B,kBAAQ,IAAIC,UAAS,GAAG,CAAC;AAAA,QAC3B,OAAO;AACL,kBAAQ,IAAI;AAAA,QACd;AACA,YAAI,UAAU,EAAE,IAAI,KAAK;AACzB,YAAI,QAAQ;AACV,kBAAQ,QAAQJ,YAAW,QAAQ,KAAK;AAAA,QAC1C;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF,CAAC;;;AClID,MAAIM,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,aAAa;AACnC,MAAI,sBAAqC,wBAAQD,QAAMC,gBAAc,UAAQ;AAClF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,aAAAC;AAAA,IACF,IAAI;AAoBJ,WAAO,SAAS,cAAc,GAAG,GAAG,UAAU,SAAS;AAErD,UAAI,UAAU,EAAE;AAChB,UAAI,SAAS,EAAE;AACf,UAAI,OAAO,EAAE;AACb,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE;AAGZ,UAAI,CAAC,SAAS;AACZ,cAAM,IAAI,MAAM,oEAAoE;AAAA,MACtF;AAGA,UAAI,OAAO,MAAM,CAAC;AAClB,UAAI,UAAU,MAAM,CAAC;AAGrB,UAAI;AAEJ,UAAI,KAAKA;AAET,UAAI,OAAO;AAEX,UAAI,KAAK;AAGT,UAAI,OAAO,QAAQ,UAAU;AAE3B,aAAK;AAEL,aAAKD,OAAM,KAAKC,cAAa,CAAC,IAAI,EAAE,CAAC;AAErC,eAAOD,OAAM,QAAQ,GAAG,EAAE;AAE1B,YAAIA,OAAM,QAAQ,GAAG,EAAE;AAEvB,aAAKA,OAAM,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;AAAA,MACpC;AAGA,UAAI,UAAU,CAAC;AACf,UAAI,SAAS,CAAC;AACd,UAAI,OAAO,CAAC;AAGZ,eAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAEhC,aAAK,CAAC,IAAI,OAAO;AAEjB,iBAAS,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5D,cAAIE,KAAI,OAAO,CAAC;AAEhB,cAAI,IAAI,UAAU,GAAG,GAAG,QAAQ,CAAC,CAAC,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC;AAEtD,cAAI,CAAC,GAAG,GAAG,IAAI,GAAG;AAEhB,mBAAO,KAAKA,EAAC;AACb,oBAAQ,KAAK,CAAC;AAAA,UAChB;AAAA,QACF;AAAA,MACF;AAEA,WAAK,OAAO,IAAI,OAAO;AAGvB,aAAO,EAAE,mBAAmB;AAAA,QAC1B,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,KAAK;AAAA,QACL,MAAM,CAAC,MAAM,OAAO;AAAA,QACpB,UAAU;AAAA,MACZ,CAAC;AAAA,IACH;AAAA,EACF,CAAC;;;ACrGD,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,aAAa;AACnC,MAAI,sBAAqC,wBAAQD,QAAMC,gBAAc,UAAQ;AAClF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,aAAAC;AAAA,IACF,IAAI;AAoBJ,WAAO,SAAS,cAAc,GAAG,GAAG,UAAU,SAAS;AAErD,UAAI,UAAU,EAAE;AAChB,UAAI,SAAS,EAAE;AACf,UAAI,OAAO,EAAE;AACb,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE;AAGZ,UAAI,CAAC,SAAS;AACZ,cAAM,IAAI,MAAM,oEAAoE;AAAA,MACtF;AAGA,UAAI,OAAO,MAAM,CAAC;AAClB,UAAI,UAAU,MAAM,CAAC;AAGrB,UAAI;AAEJ,UAAI,KAAK;AAGT,UAAI,OAAO,QAAQ,UAAU;AAE3B,aAAK;AAEL,YAAID,OAAM,QAAQ,GAAG,EAAE;AAEvB,aAAKA,OAAM,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;AAAA,MACpC;AAGA,UAAI,QAAQ,CAAC;AAGb,UAAI,IAAI,CAAC;AAET,UAAI,IAAI,CAAC;AAGT,eAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAEhC,YAAI,OAAO,IAAI;AAEf,iBAAS,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5D,cAAI,IAAI,OAAO,CAAC;AAEhB,YAAE,CAAC,IAAI,QAAQ,CAAC;AAChB,YAAE,CAAC,IAAI;AAAA,QACT;AAEA,iBAASE,KAAI,GAAGA,KAAI,MAAMA,MAAK;AAE7B,cAAI,MAAM,GAAG;AAEX,kBAAMA,EAAC,IAAI,CAAC;AAAA,UACd;AAEA,cAAI,EAAEA,EAAC,MAAM,MAAM;AAEjB,kBAAMA,EAAC,EAAE,CAAC,IAAI,UAAU,GAAG,GAAG,EAAEA,EAAC,CAAC,IAAI,GAAG,EAAEA,EAAC,GAAG,CAAC;AAAA,UAClD,OAAO;AAEL,kBAAMA,EAAC,EAAE,CAAC,IAAI,UAAU,GAAG,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC;AAAA,UAC5C;AAAA,QACF;AAAA,MACF;AAGA,aAAO,IAAID,aAAY;AAAA,QACrB,MAAM;AAAA,QACN,MAAM,CAAC,MAAM,OAAO;AAAA,QACpB,UAAU;AAAA,MACZ,CAAC;AAAA,IACH;AAAA,EACF,CAAC;;;ACtGD,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,qBAAoC,wBAAQD,QAAMC,gBAAc,UAAQ;AACjF,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAgBJ,WAAO,SAAS,aAAa,GAAG,GAAG,UAAU,SAAS;AAEpD,UAAI,QAAQ,EAAE;AACd,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE;AAGZ,UAAI;AAEJ,UAAI,KAAK;AAGT,UAAI,OAAO,QAAQ,UAAU;AAE3B,aAAK;AAEL,YAAIA,OAAM,QAAQ,GAAG,EAAE;AAEvB,aAAKA,OAAM,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;AAAA,MACpC;AAGA,UAAI,QAAQ,MAAM,SAAS,IAAI,SAAS,IAAI,GAAG,OAAO,MAAM,CAAC,GAAG,OAAO,GAAG,OAAO,IAAI,CAAC;AAGtF,aAAO,EAAE,kBAAkB;AAAA,QACzB,MAAM;AAAA,QACN,MAAMC,OAAM,KAAK;AAAA,QACjB,UAAU;AAAA,MACZ,CAAC;AAAA,IACH;AAGA,aAAS,SAAS,GAAG,OAAO,GAAG,GAAG,IAAI,IAAI,SAAS;AAEjD,UAAI,KAAK,CAAC;AAEV,UAAI,UAAU,EAAE,SAAS,GAAG;AAE1B,iBAASC,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAE1B,aAAGA,EAAC,IAAI,UAAU,EAAE,IAAI,GAAGA,EAAC,CAAC,IAAI,EAAE,GAAGA,EAAC,GAAG,EAAE;AAAA,QAC9C;AAAA,MACF,OAAO;AAEL,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAE1B,aAAG,CAAC,IAAI,SAAS,GAAG,QAAQ,GAAG,GAAG,EAAE,QAAQ,CAAC,GAAG,GAAG,CAAC,GAAG,IAAI,OAAO;AAAA,QACpE;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,EACF,CAAC;;;ACnED,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,SAAS,UAAU,eAAe,SAAS,aAAa;AAC/F,MAAI,SAAS,IAAI,gBAAQ,EAAE;AACpB,MAAI,mBAAkC,wBAAQD,QAAM,CAAC,SAAS,UAAU,OAAO,GAAG,UAAQ;AAC/F,QAAI;AAAA,MACF,OAAAE;AAAA,MACA,QAAAC;AAAA,MACA,OAAAC;AAAA,IACF,IAAI;AACJ,aAAS,YAAY,GAAG;AAEtB,UAAI,IAAI,KAAK,KAAK,CAAC;AACnB,UAAI,IAAIA,OAAM,CAAC;AACf,UAAI,MAAM,EAAG,QAAO;AACpB,UAAI,YAAY,GAAG,GAAGD,QAAO,QAAQA,QAAO,MAAM,KAAK,CAAC,YAAY,GAAG,GAAGA,QAAO,QAAQA,QAAO,MAAM,GAAG;AACvG,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AACA,WAAOD,OAAMF,QAAM;AAAA,MACjB,QAAQ;AAAA,MACR,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,YAAI,CAAC,UAAU,CAAC,GAAG;AACjB,gBAAM,IAAI,WAAW,wDAAwD;AAAA,QAC/E;AACA,YAAI,IAAI,KAAK,IAAI,IAAI;AACnB,gBAAM,IAAI,WAAW,yDAAyD;AAAA,QAChF;AACA,YAAI,QAAQ,MAAM;AAClB,eAAO,YAAY,IAAI,KAAK,IAAI;AAAA,MAClC;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AACM,MAAI,aAA4B,wBAAQA,QAAMC,gBAAc,WAAS;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,OAAAC;AAAA,MACA,aAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAN;AAAA,MACA,aAAAI;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAJ;AAAA,MACA,aAAAM;AAAA,IACF,CAAC;AACD,QAAI,eAAe,mBAAmB;AAAA,MACpC,OAAAN;AAAA,IACF,CAAC;AACD,QAAI,aAAa,iBAAiB;AAAA,MAChC,OAAAA;AAAA,MACA,QAAAC;AAAA,MACA,OAAAC;AAAA,IACF,CAAC;AACD,aAAS,SAAS,GAAG;AAEnB,UAAI,MAAM,CAAC,GAAG,MAAMK,aAAe,GAAG,GAAGN,QAAO,QAAQA,QAAO,MAAM;AACrE,UAAI,IAAI,EAAE,KAAK;AACf,UAAI,IAAIC,OAAM,CAAC;AACf,UAAI,EAAE,GAAG,CAAC,EAAG,QAAO;AACpB,UAAI,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,EAAG,QAAO;AACpC,aAAO;AAAA,IACT;AAuDA,WAAOF,OAAM,QAAQ;AAAA,MACnB,QAAQ,WAAW,WAAW;AAAA,MAC9B,iBAAiB,WAAW,WAAW,eAAe;AAAA,MACtD,SAAS,SAASQ,SAAQ,GAAG;AAC3B,eAAO,EAAE,KAAK;AAAA,MAChB;AAAA,MACA,mBAAmB,SAAS,eAAe,GAAG,GAAG;AAC/C,eAAO,EAAE,KAAK,CAAC;AAAA,MACjB;AAAA,MACA,sBAAsB,SAAS,kBAAkB,GAAG,GAAG;AACrD,eAAO,EAAE,KAAK,EAAE,SAAS,CAAC;AAAA,MAC5B;AAAA,MACA,WAAW;AAAA,MACX,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,YAAI,QAAQ,OAAO,IAAI,CAAC;AACxB,eAAO,SAAS,EAAE,IAAI,KAAK,CAAC,EAAE,IAAI,KAAK;AAAA,MACzC;AAAA,MACA,QAAQ,OAAK;AAAA,MACb,kBAAkB,CAAC,GAAG,WAAW;AAAA,MACjC,qBAAqB,CAAC,GAAG,WAAW;AAAA,MACpC,UAAU,SAASC,UAAS,GAAG;AAC7B,eAAO,EAAE,KAAK;AAAA,MAChB;AAAA,MACA,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,eAAO,EAAE,KAAK,CAAC;AAAA,MACjB;AAAA,MACA,uBAAuB,SAAS,mBAAmB,GAAG,GAAG;AACvD,eAAO,EAAE,KAAK,EAAE,SAAS,CAAC;AAAA,MAC5B;AAAA,MACA,sBAAsBT,OAAM,YAAY,CAAAU,UAAQ,SAAU,GAAG,GAAGC,OAAM;AACpE,YAAI,YAAY,EAAE,UAAUA,KAAI;AAChC,eAAOA,MAAK,SAASD,MAAK,WAAW,CAAC,CAAC;AAAA,MACzC,CAAC;AAAA,MACD,yBAAyBV,OAAM,YAAY,CAAAU,UAAQ,CAAC,GAAG,GAAGC,UAASD,MAAK,GAAG,EAAE,SAAS,GAAGC,KAAI,CAAC;AAAA,MAC9F,4CAA4CX,OAAM,YAAY,CAAAU,UAAQ,CAAC,GAAG,GAAGC,UAAS;AAEpF,eAAOC,SAAQ,GAAG,WAASF,MAAK,OAAO,GAAGC,KAAI,GAAG,IAAI;AAAA,MACvD,CAAC;AAAA,MACD,+BAA+BX,OAAM,YAAY,CAAAU,UAAQ,CAAC,GAAGC,UAASD,MAAK,GAAG,GAAGC,KAAI,CAAC;AAAA,MACtF,kBAAkBX,OAAM,YAAY,CAAAU,UAAQ,OAAK;AAE/C,eAAOE,SAAQ,GAAGF,OAAM,IAAI;AAAA,MAC9B,CAAC;AAAA,MACD,6BAA6BV,OAAM,YAAY,CAAAU,UAAQ,CAAC,GAAG,MAAM;AAE/D,eAAOE,SAAQ,GAAG,CAAAC,OAAKH,MAAKG,IAAG,CAAC,GAAG,IAAI;AAAA,MACzC,CAAC;AAAA,MACD,oCAAoCb,OAAM,YAAY,CAAAU,UAAQ,CAAC,GAAG,MAAM;AACtE,eAAO,cAAc,GAAG,GAAGA,OAAM,KAAK;AAAA,MACxC,CAAC;AAAA,MACD,mCAAmCV,OAAM,YAAY,CAAAU,UAAQ,CAAC,GAAG,MAAM;AACrE,eAAO,aAAa,GAAG,GAAGA,OAAM,KAAK;AAAA,MACvC,CAAC;AAAA,MACD,kDAAkDV,OAAM,YAAY,CAAAU,UAAQ,CAAC,GAAG,MAAM;AAEpF,eAAO,aAAaP,QAAO,CAAC,GAAG,GAAGO,OAAM,IAAI,EAAE,QAAQ;AAAA,MACxD,CAAC;AAAA,MACD,mDAAmDV,OAAM,YAAY,CAAAU,UAAQ,CAAC,GAAG,MAAM;AACrF,YAAIN,aAAY,GAAG,CAAC,EAAG,QAAOC,OAAM,EAAE,KAAK,GAAG,EAAE,QAAQ,CAAC;AACzD,YAAI,EAAE,QAAQ,MAAM,SAAS;AAC3B,iBAAO,aAAa,GAAG,GAAGK,OAAM,IAAI;AAAA,QACtC;AACA,eAAO,cAAc,GAAG,GAAGA,OAAM,IAAI;AAAA,MACvC,CAAC;AAAA,IACH,CAAC;AAAA,EACH,CAAC;;;ACjMD,MAAII,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,aAA4B,wBAAQD,QAAMC,gBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AA0BJ,WAAOA,OAAMF,QAAM;AAAA,MACjB,QAAQ;AAAA,MACR,SAAS,SAASG,SAAQ,GAAG;AAC3B,eAAO,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC;AAAA,MACvB;AAAA,MACA,WAAW,SAASC,WAAU,GAAG;AAC/B,eAAO,EAAE,MAAM,CAAC,EAAE,MAAM,CAAC;AAAA,MAC3B;AAAA,MACA,QAAQ,SAASC,QAAO,GAAG;AACzB,eAAO,IAAI,IAAI;AAAA,MACjB;AAAA,MACA,UAAU,SAASC,UAAS,GAAG;AAC7B,eAAO,EAAE,IAAI,CAAC;AAAA,MAChB;AAAA,MACA,MAAM,SAASC,MAAK,GAAG;AACrB,eAAO,EAAE,IAAI,CAAC;AAAA,MAChB;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACjDD,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,YAA2B,wBAAQD,QAAMC,gBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAiCJ,WAAOA,OAAMF,QAAM;AAAA,MACjB,QAAQ;AAAA,MACR,SAAS,SAASG,SAAQ,GAAG;AAC3B,eAAO,EAAE,IAAI;AAAA,MACf;AAAA,MACA,WAAW,SAASC,WAAU,GAAG;AAC/B,eAAO,EAAE,IAAI;AAAA,MACf;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC/CD,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,SAAS;AAC/B,MAAI,cAA6B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,SAAS;AAAA,IACX,IAAI;AAmCJ,WAAOA,OAAMF,QAAM;AAAA,MACjB,QAAQ;AAAA,MACR,SAAS,SAASG,SAAQ,GAAG;AAC3B,YAAI,IAAI,KAAK,IAAI,EAAE,EAAE;AACrB,eAAO,IAAI,SAAS,IAAI,KAAK,IAAI,EAAE,EAAE,IAAI,GAAG,IAAI,KAAK,IAAI,EAAE,EAAE,CAAC;AAAA,MAChE;AAAA,MACA,WAAW,SAASC,WAAU,GAAG;AAC/B,eAAO,EAAE,IAAI,EAAE,MAAM,CAAC;AAAA,MACxB;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACjDD,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,WAAW,UAAU,QAAQ,SAAS,eAAe,SAAS,aAAa;AACjG,MAAI,kBAAiC,wBAAQD,QAAM,CAAC,SAAS,QAAQ,OAAO,GAAG,UAAQ;AAC5F,QAAI;AAAA,MACF,OAAAE;AAAA,MACA,MAAAC;AAAA,MACA,OAAAC;AAAA,IACF,IAAI;AACJ,WAAOF,OAAMF,QAAM;AAAA,MACjB,QAAQ,SAASK,QAAO,GAAG;AACzB,eAAO,IAAI,IAAID,OAAM,CAAC,IAAID,MAAK,CAAC;AAAA,MAClC;AAAA,MACA,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,eAAO,IAAI,IAAIC,OAAM,GAAG,CAAC,IAAID,MAAK,GAAG,CAAC;AAAA,MACxC;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AACM,MAAI,YAA2B,wBAAQH,QAAMC,gBAAc,WAAS;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,SAAS;AAAA,MACT,QAAAI;AAAA,MACA,MAAAH;AAAA,MACA,OAAAC;AAAA,MACA,aAAAG;AAAA,MACA,OAAAC;AAAA,MACA,aAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAP;AAAA,MACA,aAAAO;AAAA,IACF,CAAC;AACD,QAAI,eAAe,mBAAmB;AAAA,MACpC,OAAAP;AAAA,IACF,CAAC;AACD,QAAI,YAAY,gBAAgB;AAAA,MAC9B,OAAAA;AAAA,MACA,MAAAC;AAAA,MACA,OAAAC;AAAA,IACF,CAAC;AAsDD,WAAOF,OAAM,OAAO;AAAA,MAClB,QAAQ,UAAU,WAAW;AAAA,MAC7B,8BAA8B,UAAU,WAAW,eAAe;AAAA,MAClE,SAAS,SAASQ,SAAQ,GAAG;AAC3B,eAAO,IAAI,SAAS,EAAE,KAAK,IAAI,KAAK,MAAM,EAAE,EAAE,IAAI,KAAK,KAAK,EAAE,EAAE,GAAG,EAAE,KAAK,IAAI,KAAK,MAAM,EAAE,EAAE,IAAI,KAAK,KAAK,EAAE,EAAE,CAAC;AAAA,MAClH;AAAA,MACA,mBAAmB,SAAS,eAAe,GAAG,GAAG;AAC/C,eAAO,IAAI,SAAS,EAAE,KAAK,IAAIN,OAAM,EAAE,IAAI,CAAC,IAAID,MAAK,EAAE,IAAI,CAAC,GAAG,EAAE,KAAK,IAAIC,OAAM,EAAE,IAAI,CAAC,IAAID,MAAK,EAAE,IAAI,CAAC,CAAC;AAAA,MAC1G;AAAA,MACA,sBAAsB,SAAS,kBAAkB,GAAG,IAAI;AACtD,YAAI,IAAI,GAAG,SAAS;AACpB,eAAO,IAAI,SAAS,EAAE,KAAK,IAAIC,OAAM,EAAE,IAAI,CAAC,IAAID,MAAK,EAAE,IAAI,CAAC,GAAG,EAAE,KAAK,IAAIC,OAAM,EAAE,IAAI,CAAC,IAAID,MAAK,EAAE,IAAI,CAAC,CAAC;AAAA,MAC1G;AAAA,MACA,WAAW,SAASQ,WAAU,GAAG;AAC/B,eAAO,EAAE,WAAW,IAAIR,MAAK,CAAC,IAAIC,OAAM,CAAC;AAAA,MAC3C;AAAA,MACA,iCAAiC,SAAS,4BAA4B,GAAG,GAAG;AAC1E,eAAO,EAAE,WAAW,IAAID,MAAK,GAAG,CAAC,IAAIC,OAAM,GAAG,CAAC;AAAA,MACjD;AAAA,MACA,QAAQ,OAAK;AAAA,MACb,kBAAkB,CAAC,GAAG,WAAW;AAAA,MACjC,qBAAqB,CAAC,GAAG,WAAW;AAAA,MACpC,UAAU,SAASQ,UAAS,GAAG;AAC7B,eAAO,EAAE,IAAI,KAAK,EAAE,KAAK,IAAI,EAAE,MAAM;AAAA,MACvC;AAAA,MACA,gCAAgC,SAAS,2BAA2B,GAAG,GAAG;AACxE,eAAO,EAAE,IAAI,KAAKT,MAAK,GAAG,CAAC,IAAIC,OAAM,GAAG,CAAC;AAAA,MAC3C;AAAA,MACA,sBAAsBF,OAAM,YAAY,CAAAW,UAAQ,SAAU,GAAG,GAAGC,OAAM;AACpE,YAAI,YAAY,EAAE,UAAUA,KAAI;AAChC,eAAOA,MAAK,SAASD,MAAK,WAAW,CAAC,CAAC;AAAA,MACzC,CAAC;AAAA,MACD,yBAAyBX,OAAM,YAAY,CAAAW,UAAQ,CAAC,GAAG,GAAGC,UAASD,MAAK,GAAG,EAAE,SAAS,GAAGC,KAAI,CAAC;AAAA,MAC9F,4CAA4CZ,OAAM,YAAY,CAAAW,UAAQ,CAAC,GAAG,GAAGC,UAAS;AAEpF,eAAOC,SAAQ,GAAG,WAASF,MAAK,OAAO,GAAGC,KAAI,GAAG,IAAI;AAAA,MACvD,CAAC;AAAA,MACD,+BAA+BZ,OAAM,YAAY,CAAAW,UAAQ,CAAC,GAAGC,UAASD,MAAK,GAAG,GAAGC,KAAI,CAAC;AAAA,MACtF,kBAAkBZ,OAAM,YAAY,CAAAW,UAAQ,OAAK;AAE/C,eAAOE,SAAQ,GAAGF,OAAM,IAAI;AAAA,MAC9B,CAAC;AAAA,MACD,sCAAsCX,OAAM,YAAY,CAAAW,UAAQ,CAAC,GAAG,MAAM;AAExE,eAAOE,SAAQ,GAAG,CAAAC,OAAKH,MAAKG,IAAG,CAAC,GAAG,IAAI;AAAA,MACzC,CAAC;AAAA,MACD,kDAAkDd,OAAM,YAAY,CAAAW,UAAQ,CAAC,GAAG,MAAM;AAEpF,eAAO,aAAaP,QAAO,CAAC,GAAG,GAAGO,OAAM,IAAI,EAAE,QAAQ;AAAA,MACxD,CAAC;AAAA,MACD,mDAAmDX,OAAM,YAAY,CAAAW,UAAQ,CAAC,GAAG,MAAM;AACrF,YAAIN,aAAY,GAAG,CAAC,EAAG,QAAOC,OAAM,EAAE,KAAK,GAAG,EAAE,QAAQ,CAAC;AACzD,YAAI,EAAE,QAAQ,MAAM,SAAS;AAC3B,iBAAO,aAAa,GAAG,GAAGK,OAAM,IAAI;AAAA,QACtC;AACA,eAAO,cAAc,GAAG,GAAGA,OAAM,IAAI;AAAA,MACvC,CAAC;AAAA,IACH,CAAC;AAAA,EACH,CAAC;;;ACnJD,MAAII,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,SAAS,UAAU,eAAe,SAAS,aAAa;AAC/F,MAAIC,UAAS,IAAI,gBAAQ,EAAE;AACpB,MAAI,oBAAmC,wBAAQF,QAAM,CAAC,SAAS,UAAU,OAAO,GAAG,UAAQ;AAChG,QAAI;AAAA,MACF,OAAAG;AAAA,MACA,QAAAC;AAAA,MACA,OAAAC;AAAA,IACF,IAAI;AACJ,aAAS,aAAa,GAAG;AAGvB,UAAI,IAAI,KAAK,MAAM,CAAC;AACpB,UAAI,IAAIA,OAAM,CAAC;AACf,UAAI,MAAM,EAAG,QAAO;AAIpB,UAAI,YAAY,GAAG,GAAGD,QAAO,QAAQA,QAAO,MAAM,KAAK,CAAC,YAAY,GAAG,GAAGA,QAAO,QAAQA,QAAO,MAAM,GAAG;AACvG,eAAO;AAAA,MACT;AAIA,aAAO;AAAA,IACT;AACA,WAAOD,OAAMH,QAAM;AAAA,MACjB,QAAQ;AAAA,MACR,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,YAAI,CAAC,UAAU,CAAC,GAAG;AACjB,gBAAM,IAAI,WAAW,yDAAyD;AAAA,QAChF;AACA,YAAI,IAAI,KAAK,IAAI,IAAI;AACnB,gBAAM,IAAI,WAAW,4DAA4D;AAAA,QACnF;AACA,YAAI,QAAQ,MAAM;AAClB,eAAO,aAAa,IAAI,KAAK,IAAI;AAAA,MACnC;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AACM,MAAI,cAA6B,wBAAQA,QAAMC,gBAAc,WAAS;AAC3E,QAAI;AAAA,MACF,OAAAE;AAAA,MACA,QAAAC;AAAA,MACA,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,OAAAC;AAAA,MACA,aAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAN;AAAA,MACA,aAAAI;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAJ;AAAA,MACA,aAAAM;AAAA,IACF,CAAC;AACD,QAAI,eAAe,mBAAmB;AAAA,MACpC,OAAAN;AAAA,IACF,CAAC;AACD,QAAI,cAAc,kBAAkB;AAAA,MAClC,OAAAA;AAAA,MACA,QAAAC;AAAA,MACA,OAAAC;AAAA,IACF,CAAC;AACD,aAAS,UAAU,GAAG;AAEpB,UAAI,MAAM,CAAC,GAAG,MAAMK,aAAe,GAAG,GAAGN,QAAO,QAAQA,QAAO,MAAM;AACrE,UAAI,IAAI,EAAE,MAAM;AAChB,UAAI,IAAIC,OAAM,CAAC;AACf,UAAI,EAAE,GAAG,CAAC,EAAG,QAAO;AACpB,UAAI,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,EAAG,QAAO;AACpC,aAAO;AAAA,IACT;AA0DA,WAAOF,OAAM,SAAS;AAAA,MACpB,QAAQ,YAAY,WAAW;AAAA,MAC/B,iBAAiB,YAAY,WAAW,eAAe;AAAA,MACvD,SAAS,SAASQ,SAAQ,GAAG;AAC3B,eAAO,EAAE,MAAM;AAAA,MACjB;AAAA,MACA,mBAAmB,SAAS,eAAe,GAAG,GAAG;AAC/C,eAAO,EAAE,MAAM,CAAC;AAAA,MAClB;AAAA,MACA,sBAAsB,SAAS,kBAAkB,GAAG,GAAG;AACrD,eAAO,EAAE,MAAM,EAAE,SAAS,CAAC;AAAA,MAC7B;AAAA,MACA,WAAW;AAAA,MACX,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,YAAI,QAAQT,QAAO,IAAI,CAAC;AACxB,eAAO,UAAU,EAAE,IAAI,KAAK,CAAC,EAAE,IAAI,KAAK;AAAA,MAC1C;AAAA,MACA,QAAQ,OAAK;AAAA,MACb,kBAAkB,CAAC,GAAG,WAAW;AAAA,MACjC,qBAAqB,CAAC,GAAG,WAAW;AAAA,MACpC,UAAU,SAASU,UAAS,GAAG;AAC7B,eAAO,EAAE,MAAM;AAAA,MACjB;AAAA,MACA,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,eAAO,EAAE,MAAM,CAAC;AAAA,MAClB;AAAA,MACA,uBAAuB,SAAS,mBAAmB,GAAG,GAAG;AACvD,eAAO,EAAE,MAAM,EAAE,SAAS,CAAC;AAAA,MAC7B;AAAA,MACA,sBAAsBT,OAAM,YAAY,CAAAU,UAAQ,SAAU,GAAG,GAAGC,OAAM;AACpE,YAAI,YAAY,EAAE,UAAUA,KAAI;AAChC,eAAOA,MAAK,SAASD,MAAK,WAAW,CAAC,CAAC;AAAA,MACzC,CAAC;AAAA,MACD,yBAAyBV,OAAM,YAAY,CAAAU,UAAQ,CAAC,GAAG,GAAGC,UAASD,MAAK,GAAG,EAAE,SAAS,GAAGC,KAAI,CAAC;AAAA,MAC9F,4CAA4CX,OAAM,YAAY,CAAAU,UAAQ,CAAC,GAAG,GAAGC,UAAS;AAEpF,eAAOC,SAAQ,GAAG,WAASF,MAAK,OAAO,GAAGC,KAAI,GAAG,IAAI;AAAA,MACvD,CAAC;AAAA,MACD,+BAA+BX,OAAM,YAAY,CAAAU,UAAQ,CAAC,GAAGC,UAASD,MAAK,GAAG,GAAGC,KAAI,CAAC;AAAA,MACtF,kBAAkBX,OAAM,YAAY,CAAAU,UAAQ,OAAK;AAE/C,eAAOE,SAAQ,GAAGF,OAAM,IAAI;AAAA,MAC9B,CAAC;AAAA,MACD,6BAA6BV,OAAM,YAAY,CAAAU,UAAQ,CAAC,GAAG,MAAM;AAE/D,eAAOE,SAAQ,GAAG,CAAAC,OAAKH,MAAKG,IAAG,CAAC,GAAG,IAAI;AAAA,MACzC,CAAC;AAAA,MACD,oCAAoCb,OAAM,YAAY,CAAAU,UAAQ,CAAC,GAAG,MAAM;AACtE,eAAO,cAAc,GAAG,GAAGA,OAAM,KAAK;AAAA,MACxC,CAAC;AAAA,MACD,mCAAmCV,OAAM,YAAY,CAAAU,UAAQ,CAAC,GAAG,MAAM;AACrE,eAAO,aAAa,GAAG,GAAGA,OAAM,KAAK;AAAA,MACvC,CAAC;AAAA,MACD,kDAAkDV,OAAM,YAAY,CAAAU,UAAQ,CAAC,GAAG,MAAM;AAEpF,eAAO,aAAaP,QAAO,CAAC,GAAG,GAAGO,OAAM,IAAI,EAAE,QAAQ;AAAA,MACxD,CAAC;AAAA,MACD,mDAAmDV,OAAM,YAAY,CAAAU,UAAQ,CAAC,GAAG,MAAM;AACrF,YAAIN,aAAY,GAAG,CAAC,EAAG,QAAOC,OAAM,EAAE,KAAK,GAAG,EAAE,QAAQ,CAAC;AACzD,YAAI,EAAE,QAAQ,MAAM,SAAS;AAC3B,iBAAO,aAAa,GAAG,GAAGK,OAAM,IAAI;AAAA,QACtC;AACA,eAAO,cAAc,GAAG,GAAGA,OAAM,IAAI;AAAA,MACvC,CAAC;AAAA,IACH,CAAC;AAAA,EACH,CAAC;;;AC3MD,MAAII,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,aAAa;AACnC,MAAI,sBAAqC,wBAAQD,QAAMC,gBAAc,UAAQ;AAClF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,aAAAC;AAAA,IACF,IAAI;AAoBJ,WAAO,SAAS,cAAc,aAAa,cAAc,UAAU,SAAS;AAE1E,UAAI,QAAQ,YAAY;AACxB,UAAI,QAAQ,YAAY;AACxB,UAAI,MAAM,YAAY,aAAa,YAAY,YAAY;AAE3D,UAAI,UAAU,aAAa;AAC3B,UAAI,SAAS,aAAa;AAC1B,UAAI,OAAO,aAAa;AACxB,UAAI,QAAQ,aAAa;AACzB,UAAI,MAAM,aAAa,aAAa,aAAa,UAAU,SAAY,aAAa,YAAY,aAAa,YAAY;AAGzH,UAAI,MAAM,WAAW,MAAM,QAAQ;AACjC,cAAM,IAAI,eAAe,MAAM,QAAQ,MAAM,MAAM;AAAA,MACrD;AAGA,UAAI,MAAM,CAAC,MAAM,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAClD,cAAM,IAAI,WAAW,mCAAmC,QAAQ,4BAA4B,QAAQ,GAAG;AAAA,MACzG;AAGA,UAAI,CAAC,SAAS;AACZ,cAAM,IAAI,MAAM,oEAAoE;AAAA,MACtF;AAGA,UAAI,OAAO,MAAM,CAAC;AAClB,UAAI,UAAU,MAAM,CAAC;AAGrB,UAAI;AAEJ,UAAI,KAAKA;AAET,UAAI,OAAO;AAEX,UAAI,KAAK;AAGT,UAAI,OAAO,QAAQ,YAAY,QAAQ,OAAO,QAAQ,SAAS;AAE7D,aAAK;AAEL,aAAKD,OAAM,KAAKC,cAAa,CAAC,IAAI,EAAE,CAAC;AAErC,eAAOD,OAAM,QAAQ,GAAG,EAAE;AAE1B,aAAKA,OAAM,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;AAAA,MACpC;AAGA,UAAI,UAAU,CAAC;AACf,UAAI,SAAS,CAAC;AACd,UAAI,OAAO,CAAC;AAGZ,eAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAEhC,aAAK,CAAC,IAAI,OAAO;AAEjB,iBAAS,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5D,cAAIE,KAAI,OAAO,CAAC;AAEhB,cAAI,MAAM,UAAU,GAAG,QAAQ,CAAC,GAAG,MAAMA,EAAC,EAAE,CAAC,CAAC,IAAI,GAAG,MAAMA,EAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC;AAE5E,cAAI,CAAC,GAAG,KAAK,IAAI,GAAG;AAElB,mBAAO,KAAKA,EAAC;AACb,oBAAQ,KAAK,GAAG;AAAA,UAClB;AAAA,QACF;AAAA,MACF;AAEA,WAAK,OAAO,IAAI,OAAO;AAGvB,aAAO,aAAa,mBAAmB;AAAA,QACrC,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,KAAK;AAAA,QACL,MAAM,CAAC,MAAM,OAAO;AAAA,QACpB,UAAU,QAAQ,YAAY,aAAa,QAAQ,aAAa,YAAY,KAAK;AAAA,MACnF,CAAC;AAAA,IACH;AAAA,EACF,CAAC;;;ACjHD,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,sBAAqC,wBAAQD,QAAMC,gBAAc,UAAQ;AAClF,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAoBJ,WAAO,SAAS,cAAc,aAAa,cAAc,UAAU,SAAS;AAE1E,UAAI,QAAQ,YAAY;AACxB,UAAI,QAAQ,YAAY;AACxB,UAAI,MAAM,YAAY,aAAa,YAAY,YAAY;AAE3D,UAAI,UAAU,aAAa;AAC3B,UAAI,SAAS,aAAa;AAC1B,UAAI,OAAO,aAAa;AACxB,UAAI,QAAQ,aAAa;AACzB,UAAI,MAAM,aAAa,aAAa,aAAa,UAAU,SAAY,aAAa,YAAY,aAAa,YAAY;AAGzH,UAAI,MAAM,WAAW,MAAM,QAAQ;AACjC,cAAM,IAAI,eAAe,MAAM,QAAQ,MAAM,MAAM;AAAA,MACrD;AAGA,UAAI,MAAM,CAAC,MAAM,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAClD,cAAM,IAAI,WAAW,mCAAmC,QAAQ,4BAA4B,QAAQ,GAAG;AAAA,MACzG;AAGA,UAAI,CAAC,SAAS;AACZ,cAAM,IAAI,MAAM,oEAAoE;AAAA,MACtF;AAGA,UAAI,OAAO,MAAM,CAAC;AAClB,UAAI,UAAU,MAAM,CAAC;AAGrB,UAAI;AAEJ,UAAI,OAAO;AAEX,UAAI,KAAK;AAGT,UAAI,OAAO,QAAQ,YAAY,QAAQ,OAAO,QAAQ,SAAS;AAE7D,aAAK;AAEL,eAAOA,OAAM,QAAQ,GAAG,EAAE;AAE1B,aAAKA,OAAM,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;AAAA,MACpC;AAGA,UAAI,QAAQ,CAAC;AAGb,eAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAE7B,cAAM,CAAC,IAAI,CAAC;AAAA,MACd;AAGA,UAAI,IAAI,CAAC;AAET,UAAI,IAAI,CAAC;AAGT,eAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAEhC,YAAI,OAAO,IAAI;AAEf,iBAAS,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5D,cAAIC,KAAI,OAAO,CAAC;AAEhB,YAAEA,EAAC,IAAI,UAAU,GAAG,QAAQ,CAAC,GAAG,MAAMA,EAAC,EAAE,CAAC,CAAC,IAAI,GAAG,MAAMA,EAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC;AACzE,YAAEA,EAAC,IAAI;AAAA,QACT;AAEA,iBAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAE7B,cAAI,EAAE,CAAC,MAAM,MAAM;AAEjB,kBAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;AAAA,UACnB,OAAO;AAEL,kBAAM,CAAC,EAAE,CAAC,IAAI,UAAU,GAAG,MAAM,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI;AAAA,UACtE;AAAA,QACF;AAAA,MACF;AAGA,aAAO,YAAY,kBAAkB;AAAA,QACnC,MAAM;AAAA,QACN,MAAM,CAAC,MAAM,OAAO;AAAA,QACpB,UAAU,QAAQ,YAAY,aAAa,QAAQ,aAAa,YAAY,KAAK;AAAA,MACnF,CAAC;AAAA,IACH;AAAA,EACF,CAAC;;;ACvHD,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,aAAa;AACnC,MAAI,uBAAsC,wBAAQD,QAAMC,gBAAc,UAAQ;AACnF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,aAAAC;AAAA,IACF,IAAI;AAmBJ,WAAO,SAAS,eAAe,GAAG,GAAG,UAAU;AAE7C,UAAI,UAAU,EAAE;AAChB,UAAI,SAAS,EAAE;AACf,UAAI,OAAO,EAAE;AACb,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAE7E,UAAI,UAAU,EAAE;AAChB,UAAI,SAAS,EAAE;AACf,UAAI,OAAO,EAAE;AACb,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAG7E,UAAI,MAAM,WAAW,MAAM,QAAQ;AACjC,cAAM,IAAI,eAAe,MAAM,QAAQ,MAAM,MAAM;AAAA,MACrD;AAGA,UAAI,MAAM,CAAC,MAAM,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAClD,cAAM,IAAI,WAAW,mCAAmC,QAAQ,4BAA4B,QAAQ,GAAG;AAAA,MACzG;AAGA,UAAI,OAAO,MAAM,CAAC;AAClB,UAAI,UAAU,MAAM,CAAC;AAGrB,UAAI;AAEJ,UAAI,KAAKA;AAET,UAAI,OAAO;AAEX,UAAI,KAAK;AAGT,UAAI,OAAO,QAAQ,YAAY,QAAQ,OAAO,QAAQ,SAAS;AAE7D,aAAK;AAEL,aAAKD,OAAM,KAAKC,cAAa,CAAC,IAAI,EAAE,CAAC;AAErC,eAAOD,OAAM,QAAQ,GAAG,EAAE;AAE1B,aAAKA,OAAM,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;AAAA,MACpC;AAGA,UAAI,UAAU,WAAW,UAAU,CAAC,IAAI;AACxC,UAAI,SAAS,CAAC;AACd,UAAI,OAAO,CAAC;AAGZ,UAAI,KAAK,UAAU,CAAC,IAAI;AACxB,UAAI,KAAK,UAAU,CAAC,IAAI;AAExB,UAAI,KAAK,CAAC;AACV,UAAI,KAAK,CAAC;AAGV,UAAIE,IAAG,GAAG,GAAG;AAGb,WAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAE5B,aAAK,CAAC,IAAI,OAAO;AAEjB,YAAI,OAAO,IAAI;AAEf,aAAK,IAAI,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,KAAK;AAE/C,UAAAA,KAAI,OAAO,CAAC;AAEZ,iBAAO,KAAKA,EAAC;AAEb,aAAGA,EAAC,IAAI;AAER,cAAI,IAAI;AACN,eAAGA,EAAC,IAAI,QAAQ,CAAC;AAAA,UACnB;AAAA,QACF;AAEA,aAAK,IAAI,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,KAAK;AAE/C,UAAAA,KAAI,OAAO,CAAC;AAEZ,cAAI,GAAGA,EAAC,MAAM,MAAM;AAElB,mBAAO,KAAKA,EAAC;AAAA,UACf;AAEA,aAAGA,EAAC,IAAI;AAER,cAAI,IAAI;AACN,eAAGA,EAAC,IAAI,QAAQ,CAAC;AAAA,UACnB;AAAA,QACF;AAEA,YAAI,SAAS;AAEX,cAAI,KAAK,CAAC;AAEV,iBAAO,IAAI,OAAO,QAAQ;AAExB,YAAAA,KAAI,OAAO,CAAC;AAEZ,gBAAI,MAAM,GAAGA,EAAC;AACd,gBAAI,MAAM,GAAGA,EAAC;AAEd,gBAAI,QAAQ,QAAQ,QAAQ,MAAM;AAEhC,kBAAI,KAAK,QAAQ,OAAO,GAAGA,EAAC,IAAI;AAChC,kBAAI,KAAK,QAAQ,OAAO,GAAGA,EAAC,IAAI;AAEhC,kBAAI,KAAK,GAAG,IAAI,EAAE;AAElB,kBAAI,CAAC,GAAG,IAAI,IAAI,GAAG;AAEjB,wBAAQ,KAAK,EAAE;AAEf;AAAA,cACF,OAAO;AAEL,uBAAO,OAAO,GAAG,CAAC;AAAA,cACpB;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,WAAK,OAAO,IAAI,OAAO;AAGvB,aAAO,EAAE,mBAAmB;AAAA,QAC1B,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,KAAK;AAAA,QACL,MAAM,CAAC,MAAM,OAAO;AAAA,QACpB,UAAU,QAAQ,EAAE,aAAa,QAAQ,EAAE,YAAY,KAAK;AAAA,MAC9D,CAAC;AAAA,IACH;AAAA,EACF,CAAC;;;ACxKD,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,qBAAoC,wBAAQD,QAAMC,gBAAc,UAAQ;AACjF,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAeJ,WAAO,SAAS,aAAa,GAAG,GAAG,UAAU;AAE3C,UAAI,QAAQ,EAAE;AACd,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE;AAEZ,UAAI,QAAQ,EAAE;AACd,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE;AAEZ,UAAI,QAAQ,CAAC;AAGb,UAAI,MAAM,WAAW,MAAM,QAAQ;AACjC,cAAM,IAAI,eAAe,MAAM,QAAQ,MAAM,MAAM;AAAA,MACrD;AAGA,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AAErC,YAAI,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AACzB,gBAAM,IAAI,WAAW,mCAAmC,QAAQ,4BAA4B,QAAQ,GAAG;AAAA,QACzG;AAEA,cAAM,CAAC,IAAI,MAAM,CAAC;AAAA,MACpB;AAGA,UAAI;AAEJ,UAAI,KAAK;AAGT,UAAI,OAAO,QAAQ,YAAY,QAAQ,KAAK;AAE1C,aAAK;AAEL,aAAKA,OAAM,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;AAAA,MACpC;AAGA,UAAI,QAAQ,MAAM,SAAS,IAAI,SAAS,IAAI,GAAG,OAAO,MAAM,CAAC,GAAG,OAAO,KAAK,IAAI,CAAC;AAGjF,aAAO,EAAE,kBAAkB;AAAA,QACzB,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,MACZ,CAAC;AAAA,IACH;AAGA,aAAS,SAAS,GAAG,OAAO,GAAG,GAAG,IAAI,IAAI;AAExC,UAAI,KAAK,CAAC;AAEV,UAAI,UAAU,EAAE,SAAS,GAAG;AAE1B,iBAASC,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAE1B,aAAGA,EAAC,IAAI,EAAE,GAAGA,EAAC,GAAG,GAAGA,EAAC,CAAC;AAAA,QACxB;AAAA,MACF,OAAO;AAEL,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAE1B,aAAG,CAAC,IAAI,SAAS,GAAG,QAAQ,GAAG,GAAG,EAAE,QAAQ,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AAAA,QAC9D;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,EACF,CAAC;;;AChFM,WAAS,UAAU,GAAG,GAAG;AAC9B,QAAI,gBAAgB,EAAE,KAAK,GAAG,EAAE,KAAK,CAAC,GAAG;AAEvC,aAAO,CAAC,GAAG,CAAC;AAAA,IACd;AAGA,QAAI,UAAU,eAAe,EAAE,KAAK,GAAG,EAAE,KAAK,CAAC;AAG/C,WAAO,CAAC,GAAG,CAAC,EAAE,IAAI,OAAK,aAAa,GAAG,OAAO,CAAC;AAAA,EACjD;AAUA,WAAS,aAAa,GAAGC,OAAM;AAC7B,QAAI,gBAAgB,EAAE,KAAK,GAAGA,KAAI,GAAG;AACnC,aAAO;AAAA,IACT;AACA,WAAO,EAAE,OAAO,YAAY,EAAE,QAAQ,GAAGA,KAAI,GAAG,EAAE,SAAS,CAAC;AAAA,EAC9D;;;AClCA,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,QAAQ;AAC9B,MAAI,6BAA4C,wBAAQD,QAAMC,gBAAc,UAAQ;AACzF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAI,eAAe,mBAAmB;AAAA,MACpC,OAAAD;AAAA,IACF,CAAC;AACD,QAAI,eAAe,mBAAmB;AAAA,MACpC,OAAAA;AAAA,IACF,CAAC;AAmBD,WAAO,SAAS,qBAAqB,SAAS;AAC5C,UAAI,OAAO,QAAQ;AACnB,UAAI,KAAK,QAAQ,MAAM,QAAQ;AAC/B,UAAI;AACJ,UAAI,MAAM;AAER,2BAAmB;AAAA,UACjB,4BAA4B,CAAC,GAAG,MAAM,aAAa,GAAG,UAAU,GAAG,CAAC,GAAG,IAAI;AAAA,UAC3E,gBAAgB,CAAC,GAAG,MAAM,aAAa,GAAG,UAAUC,QAAO,CAAC,GAAGA,QAAO,CAAC,CAAC,GAAG,IAAI,EAAE,QAAQ;AAAA,UACzF,sBAAsB,CAAC,GAAG,MAAM,aAAa,GAAG,UAAUA,QAAO,CAAC,GAAG,CAAC,GAAG,IAAI;AAAA,UAC7E,sBAAsB,CAAC,GAAG,MAAM,aAAa,GAAG,UAAU,GAAGA,QAAO,CAAC,CAAC,GAAG,IAAI;AAAA,QAC/E;AAEA,YAAI,QAAQ,IAAI;AACd,2BAAiB,4BAA4B,IAAI,CAAC,GAAG,MAAM,QAAQ,GAAG,GAAG,UAAU,GAAG,CAAC,GAAG,MAAM,KAAK;AAAA,QACvG;AACA,YAAI,QAAQ,IAAI;AACd,2BAAiB,2BAA2B,IAAI,CAAC,GAAG,MAAM,QAAQ,GAAG,GAAG,UAAU,GAAG,CAAC,GAAG,MAAM,KAAK;AACpG,2BAAiB,qBAAqB,IAAI,CAAC,GAAG,MAAM,QAAQ,GAAG,GAAG,UAAUA,QAAO,CAAC,GAAG,CAAC,GAAG,MAAM,KAAK;AAAA,QACxG;AACA,YAAI,IAAI;AACN,2BAAiB,2BAA2B,IAAI,CAAC,GAAG,MAAM,GAAG,GAAG,UAAU,GAAG,CAAC,GAAG,MAAM,IAAI;AAC3F,2BAAiB,qBAAqB,IAAI,CAAC,GAAG,MAAM,GAAG,GAAG,UAAUA,QAAO,CAAC,GAAG,CAAC,GAAG,MAAM,IAAI;AAAA,QAC/F;AAAA,MACF,OAAO;AAGL,2BAAmB;AAAA,UACjB,4BAA4BD,OAAM,YAAY,CAAAE,UAAQ,CAAC,GAAG,MAAM;AAC9D,mBAAO,aAAa,GAAG,UAAU,GAAG,CAAC,GAAGA,KAAI;AAAA,UAC9C,CAAC;AAAA,UACD,gBAAgBF,OAAM,YAAY,CAAAE,UAAQ,CAAC,GAAG,MAAM;AAClD,mBAAO,aAAa,GAAG,UAAUD,QAAO,CAAC,GAAGA,QAAO,CAAC,CAAC,GAAGC,KAAI,EAAE,QAAQ;AAAA,UACxE,CAAC;AAAA,UACD,sBAAsBF,OAAM,YAAY,CAAAE,UAAQ,CAAC,GAAG,MAAM;AACxD,mBAAO,aAAa,GAAG,UAAUD,QAAO,CAAC,GAAG,CAAC,GAAGC,KAAI;AAAA,UACtD,CAAC;AAAA,UACD,sBAAsBF,OAAM,YAAY,CAAAE,UAAQ,CAAC,GAAG,MAAM;AACxD,mBAAO,aAAa,GAAG,UAAU,GAAGD,QAAO,CAAC,CAAC,GAAGC,KAAI;AAAA,UACtD,CAAC;AAAA,QACH;AAEA,YAAI,QAAQ,IAAI;AACd,2BAAiB,4BAA4B,IAAIF,OAAM,YAAY,CAAAE,UAAQ,CAAC,GAAG,MAAM;AACnF,mBAAO,QAAQ,GAAG,GAAG,UAAU,GAAG,CAAC,GAAGA,OAAM,KAAK;AAAA,UACnD,CAAC;AAAA,QACH;AACA,YAAI,QAAQ,IAAI;AACd,2BAAiB,2BAA2B,IAAIF,OAAM,YAAY,CAAAE,UAAQ,CAAC,GAAG,MAAM;AAClF,mBAAO,QAAQ,GAAG,GAAG,UAAU,GAAG,CAAC,GAAGA,OAAM,KAAK;AAAA,UACnD,CAAC;AACD,2BAAiB,qBAAqB,IAAIF,OAAM,YAAY,CAAAE,UAAQ,CAAC,GAAG,MAAM;AAC5E,mBAAO,QAAQ,GAAG,GAAG,UAAUD,QAAO,CAAC,GAAG,CAAC,GAAGC,OAAM,KAAK;AAAA,UAC3D,CAAC;AAAA,QACH;AACA,YAAI,IAAI;AACN,2BAAiB,2BAA2B,IAAIF,OAAM,YAAY,CAAAE,UAAQ,CAAC,GAAG,MAAM;AAClF,mBAAO,GAAG,GAAG,UAAU,GAAG,CAAC,GAAGA,OAAM,IAAI;AAAA,UAC1C,CAAC;AACD,2BAAiB,qBAAqB,IAAIF,OAAM,YAAY,CAAAE,UAAQ,CAAC,GAAG,MAAM;AAC5E,mBAAO,GAAG,GAAG,UAAUD,QAAO,CAAC,GAAG,CAAC,GAAGC,OAAM,IAAI;AAAA,UAClD,CAAC;AAAA,QACH;AAAA,MACF;AAGA,UAAI,SAAS,QAAQ,UAAU;AAC/B,UAAI,KAAK,QAAQ,MAAM,QAAQ;AAC/B,UAAI,IAAI;AACN,YAAI,MAAM;AACR,2BAAiB,iBAAiB,MAAM,IAAI,CAAC,GAAG,MAAM,aAAa,GAAG,GAAG,MAAM,KAAK;AACpF,2BAAiB,SAAS,eAAe,IAAI,CAAC,GAAG,MAAM,aAAa,GAAG,GAAG,MAAM,IAAI;AACpF,2BAAiB,WAAW,MAAM,IAAI,CAAC,GAAG,MAAM,aAAaD,QAAO,CAAC,GAAG,GAAG,MAAM,KAAK,EAAE,QAAQ;AAChG,2BAAiB,SAAS,SAAS,IAAI,CAAC,GAAG,MAAM,aAAaA,QAAO,CAAC,GAAG,GAAG,MAAM,IAAI,EAAE,QAAQ;AAAA,QAClG,OAAO;AACL,2BAAiB,iBAAiB,MAAM,IAAID,OAAM,YAAY,CAAAE,UAAQ,CAAC,GAAG,MAAM;AAC9E,mBAAO,aAAa,GAAG,GAAGA,OAAM,KAAK;AAAA,UACvC,CAAC;AACD,2BAAiB,SAAS,eAAe,IAAIF,OAAM,YAAY,CAAAE,UAAQ,CAAC,GAAG,MAAM;AAC/E,mBAAO,aAAa,GAAG,GAAGA,OAAM,IAAI;AAAA,UACtC,CAAC;AACD,2BAAiB,WAAW,MAAM,IAAIF,OAAM,YAAY,CAAAE,UAAQ,CAAC,GAAG,MAAM;AACxE,mBAAO,aAAaD,QAAO,CAAC,GAAG,GAAGC,OAAM,KAAK,EAAE,QAAQ;AAAA,UACzD,CAAC;AACD,2BAAiB,SAAS,SAAS,IAAIF,OAAM,YAAY,CAAAE,UAAQ,CAAC,GAAG,MAAM;AACzE,mBAAO,aAAaD,QAAO,CAAC,GAAG,GAAGC,OAAM,IAAI,EAAE,QAAQ;AAAA,UACxD,CAAC;AAAA,QACH;AAAA,MACF;AACA,UAAI,KAAK,QAAQ,OAAO,SAAY,QAAQ,KAAK,QAAQ;AACzD,UAAI,MAAM;AACR,YAAI,QAAQ,IAAI;AACd,2BAAiB,kBAAkB,MAAM,IAAI,CAAC,GAAG,MAAM,QAAQ,GAAG,GAAG,GAAG,MAAM,KAAK;AAAA,QACrF;AACA,YAAI,IAAI;AACN,2BAAiB,SAAS,gBAAgB,IAAI,CAAC,GAAG,MAAM,GAAG,GAAG,GAAG,MAAM,IAAI;AAAA,QAC7E;AAAA,MACF,OAAO;AACL,YAAI,QAAQ,IAAI;AACd,2BAAiB,kBAAkB,MAAM,IAAIF,OAAM,YAAY,CAAAE,UAAQ,CAAC,GAAG,MAAM;AAC/E,mBAAO,QAAQ,GAAG,GAAG,GAAGA,OAAM,KAAK;AAAA,UACrC,CAAC;AAAA,QACH;AACA,YAAI,IAAI;AACN,2BAAiB,SAAS,gBAAgB,IAAIF,OAAM,YAAY,CAAAE,UAAQ,CAAC,GAAG,MAAM;AAChF,mBAAO,GAAG,GAAG,GAAGA,OAAM,IAAI;AAAA,UAC5B,CAAC;AAAA,QACH;AAAA,MACF;AAEA,UAAI,QAAQ,KAAK,YAAY;AAC3B,QAAAC,QAAO,kBAAkB,KAAK,UAAU;AAAA,MAC1C;AACA,aAAO;AAAA,IACT;AAAA,EACF,CAAC;;;AC/ID,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,SAAS,UAAU,eAAe,SAAS,eAAe,QAAQ;AAClG,MAAI,YAA2B,wBAAQD,QAAMC,gBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,OAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAIC,SAAQ,YAAY;AAAA,MACtB,OAAAR;AAAA,MACA,QAAAC;AAAA,MACA,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,OAAAC;AAAA,MACA,aAAAC;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAN;AAAA,MACA,aAAAI;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAJ;AAAA,IACF,CAAC;AACD,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAA;AAAA,MACA,aAAAI;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAJ;AAAA,MACA,aAAAI;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAJ;AAAA,MACA,aAAAM;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAN;AAAA,MACA,QAAAG;AAAA,MACA,QAAAI;AAAA,IACF,CAAC;AA2CD,WAAOP,OAAMF,QAAM;AAAA,MACjB,kBAAkB;AAAA,MAClB,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,eAAO,EAAE,OAAO,IAAI,IAAI,EAAE,IAAI,EAAE,IAAIU,OAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;AAAA,MACtD;AAAA,MACA,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,YAAI,MAAM,IAAI;AACZ,iBAAO;AAAA,QACT;AACA,YAAI,IAAI,GAAG;AACT,cAAI,IAAI,IAAI;AACZ,iBAAO,MAAM,KAAK,IAAI,IAAI;AAAA,QAC5B;AACA,eAAO,IAAI;AAAA,MACb;AAAA,MACA,sBAAsB,SAAS,kBAAkB,GAAG,GAAG;AACrD,eAAO,EAAE,OAAO,CAAC,IAAI,IAAI,EAAE,IAAI,EAAE,IAAIA,OAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;AAAA,MACvD;AAAA,IACF,GAAG,qBAAqB;AAAA,MACtB,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,CAAC;AASF,aAAS,WAAW,GAAG,GAAG;AAOxB,aAAO,MAAM,IAAI,IAAI,IAAI,IAAIA,OAAM,IAAI,CAAC;AAAA,IAC1C;AAAA,EACF,CAAC;;;ACxID,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,uBAAsC,wBAAQD,QAAMC,gBAAc,UAAQ;AACnF,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAoBJ,WAAO,SAAS,WAAW,aAAa,cAAc,UAAU,SAAS;AAEvE,UAAI,QAAQ,YAAY;AACxB,UAAI,QAAQ,YAAY;AACxB,UAAI,MAAM,YAAY,aAAa,YAAY,YAAY;AAE3D,UAAI,UAAU,aAAa;AAC3B,UAAI,SAAS,aAAa;AAC1B,UAAI,OAAO,aAAa;AACxB,UAAI,QAAQ,aAAa;AACzB,UAAI,MAAM,aAAa,aAAa,aAAa,UAAU,SAAY,aAAa,YAAY,aAAa,YAAY;AAGzH,UAAI,MAAM,WAAW,MAAM,QAAQ;AACjC,cAAM,IAAI,eAAe,MAAM,QAAQ,MAAM,MAAM;AAAA,MACrD;AAGA,UAAI,MAAM,CAAC,MAAM,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAClD,cAAM,IAAI,WAAW,mCAAmC,QAAQ,4BAA4B,QAAQ,GAAG;AAAA,MACzG;AAGA,UAAI,CAAC,SAAS;AACZ,cAAM,IAAI,MAAM,oEAAoE;AAAA,MACtF;AAGA,UAAI,OAAO,MAAM,CAAC;AAClB,UAAI,UAAU,MAAM,CAAC;AAGrB,UAAI,KAAK,OAAO,QAAQ,YAAY,QAAQ,WAAW,QAAQ,MAAM,MAAM;AAE3E,UAAI,KAAK,KAAKA,OAAM,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC,IAAI;AAG/C,UAAIC,IAAG;AAGP,UAAI,QAAQ,CAAC;AAEb,WAAKA,KAAI,GAAGA,KAAI,MAAMA,MAAK;AACzB,cAAMA,EAAC,IAAI,CAAC;AAAA,MACd;AAGA,UAAI,IAAI,CAAC;AAET,UAAI,IAAI,CAAC;AAGT,WAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAE5B,YAAI,OAAO,IAAI;AAEf,iBAAS,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5D,UAAAA,KAAI,OAAO,CAAC;AAEZ,YAAEA,EAAC,IAAI,UAAU,GAAG,QAAQ,CAAC,GAAG,MAAMA,EAAC,EAAE,CAAC,CAAC,IAAI,GAAG,MAAMA,EAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC;AAEzE,YAAEA,EAAC,IAAI;AAAA,QACT;AAEA,aAAKA,KAAI,GAAGA,KAAI,MAAMA,MAAK;AAEzB,cAAI,EAAEA,EAAC,MAAM,MAAM;AAEjB,kBAAMA,EAAC,EAAE,CAAC,IAAI,EAAEA,EAAC;AAAA,UACnB,OAAO;AAEL,kBAAMA,EAAC,EAAE,CAAC,IAAI,MAAMA,EAAC,EAAE,CAAC;AAAA,UAC1B;AAAA,QACF;AAAA,MACF;AAGA,aAAO,YAAY,kBAAkB;AAAA,QACnC,MAAM;AAAA,QACN,MAAM,CAAC,MAAM,OAAO;AAAA,QACpB,UAAU,QAAQ,YAAY,aAAa,QAAQ,aAAa,YAAY,KAAK;AAAA,MACnF,CAAC;AAAA,IACH;AAAA,EACF,CAAC;;;AC7GD,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,aAAa;AACnC,MAAI,yBAAwC,wBAAQD,QAAMC,gBAAc,UAAQ;AACrF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,aAAAC;AAAA,IACF,IAAI;AAmBJ,WAAO,SAAS,iBAAiB,GAAG,GAAG,UAAU;AAE/C,UAAI,UAAU,EAAE;AAChB,UAAI,SAAS,EAAE;AACf,UAAI,OAAO,EAAE;AACb,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAE7E,UAAI,UAAU,EAAE;AAChB,UAAI,SAAS,EAAE;AACf,UAAI,OAAO,EAAE;AACb,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAG7E,UAAI,MAAM,WAAW,MAAM,QAAQ;AACjC,cAAM,IAAI,eAAe,MAAM,QAAQ,MAAM,MAAM;AAAA,MACrD;AAGA,UAAI,MAAM,CAAC,MAAM,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAClD,cAAM,IAAI,WAAW,mCAAmC,QAAQ,4BAA4B,QAAQ,GAAG;AAAA,MACzG;AAGA,UAAI,OAAO,MAAM,CAAC;AAClB,UAAI,UAAU,MAAM,CAAC;AAGrB,UAAI;AAEJ,UAAI,KAAKA;AAET,UAAI,OAAO;AAEX,UAAI,KAAK;AAGT,UAAI,OAAO,QAAQ,YAAY,QAAQ,OAAO,QAAQ,SAAS;AAE7D,aAAK;AAEL,aAAKD,OAAM,KAAKC,cAAa,CAAC,IAAI,EAAE,CAAC;AAErC,eAAOD,OAAM,QAAQ,GAAG,EAAE;AAE1B,aAAKA,OAAM,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;AAAA,MACpC;AAGA,UAAI,UAAU,WAAW,UAAU,CAAC,IAAI;AACxC,UAAI,SAAS,CAAC;AACd,UAAI,OAAO,CAAC;AAGZ,UAAI,KAAK,WAAW,UAAU,CAAC,IAAI;AACnC,UAAI,KAAK,WAAW,UAAU,CAAC,IAAI;AAEnC,UAAI,KAAK,CAAC;AACV,UAAI,KAAK,CAAC;AAGV,UAAIE,IAAG,GAAG,GAAG,IAAI;AAGjB,WAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAE5B,aAAK,CAAC,IAAI,OAAO;AAEjB,YAAI,OAAO,IAAI;AAEf,aAAK,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAExD,UAAAA,KAAI,OAAO,CAAC;AAEZ,iBAAO,KAAKA,EAAC;AAEb,aAAGA,EAAC,IAAI;AAER,cAAI,IAAI;AACN,eAAGA,EAAC,IAAI,QAAQ,CAAC;AAAA,UACnB;AAAA,QACF;AAEA,aAAK,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAExD,UAAAA,KAAI,OAAO,CAAC;AAEZ,cAAI,GAAGA,EAAC,MAAM,MAAM;AAElB,gBAAI,IAAI;AAEN,kBAAI,IAAI,GAAG,GAAGA,EAAC,GAAG,QAAQ,CAAC,CAAC;AAE5B,kBAAI,CAAC,GAAG,GAAG,IAAI,GAAG;AAEhB,mBAAGA,EAAC,IAAI;AAAA,cACV,OAAO;AAEL,mBAAGA,EAAC,IAAI;AAAA,cACV;AAAA,YACF;AAAA,UACF,OAAO;AAEL,mBAAO,KAAKA,EAAC;AAEb,eAAGA,EAAC,IAAI;AAER,gBAAI,IAAI;AACN,iBAAGA,EAAC,IAAI,QAAQ,CAAC;AAAA,YACnB;AAAA,UACF;AAAA,QACF;AAEA,YAAI,MAAM,IAAI;AAEZ,cAAI,KAAK,CAAC;AAEV,iBAAO,IAAI,OAAO,QAAQ;AAExB,YAAAA,KAAI,OAAO,CAAC;AAEZ,gBAAI,GAAGA,EAAC,MAAM,MAAM;AAElB,sBAAQ,CAAC,IAAI,GAAGA,EAAC;AAEjB;AAAA,YACF,WAAW,GAAGA,EAAC,MAAM,MAAM;AAEzB,sBAAQ,CAAC,IAAI,GAAGA,EAAC;AAEjB;AAAA,YACF,OAAO;AAEL,qBAAO,OAAO,GAAG,CAAC;AAAA,YACpB;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,WAAK,OAAO,IAAI,OAAO;AAGvB,aAAO,EAAE,mBAAmB;AAAA,QAC1B,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,KAAK;AAAA,QACL,MAAM,CAAC,MAAM,OAAO;AAAA,QACpB,UAAU,QAAQ,EAAE,aAAa,QAAQ,EAAE,YAAY,KAAK;AAAA,MAC9D,CAAC;AAAA,IACH;AAAA,EACF,CAAC;;;ACjLD,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,aAAa;AACnC,MAAI,uBAAsC,wBAAQD,QAAMC,gBAAc,UAAQ;AACnF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,aAAAC;AAAA,IACF,IAAI;AAoBJ,WAAO,SAAS,eAAe,GAAG,GAAG,UAAU,SAAS;AAEtD,UAAI,UAAU,EAAE;AAChB,UAAI,SAAS,EAAE;AACf,UAAI,OAAO,EAAE;AACb,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE;AAGZ,UAAI,CAAC,SAAS;AACZ,cAAM,IAAI,MAAM,oEAAoE;AAAA,MACtF;AAGA,UAAI,OAAO,MAAM,CAAC;AAClB,UAAI,UAAU,MAAM,CAAC;AAGrB,UAAI;AAEJ,UAAI,KAAK;AAGT,UAAI,OAAO,QAAQ,UAAU;AAE3B,aAAK;AAEL,YAAID,OAAM,QAAQ,GAAG,EAAE;AAEvB,aAAKA,OAAM,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;AAAA,MACpC;AAGA,UAAI,QAAQ,CAAC;AAGb,UAAI,IAAI,CAAC;AAET,UAAI,IAAI,CAAC;AAGT,eAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAEhC,YAAI,OAAO,IAAI;AAEf,iBAAS,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5D,cAAI,IAAI,OAAO,CAAC;AAEhB,YAAE,CAAC,IAAI,QAAQ,CAAC;AAChB,YAAE,CAAC,IAAI;AAAA,QACT;AAEA,iBAASE,KAAI,GAAGA,KAAI,MAAMA,MAAK;AAE7B,cAAI,MAAM,GAAG;AAEX,kBAAMA,EAAC,IAAI,CAAC;AAAA,UACd;AAEA,cAAI,EAAEA,EAAC,MAAM,MAAM;AAEjB,kBAAMA,EAAC,EAAE,CAAC,IAAI,UAAU,GAAG,GAAG,EAAEA,EAAC,CAAC,IAAI,GAAG,EAAEA,EAAC,GAAG,CAAC;AAAA,UAClD,OAAO;AAEL,kBAAMA,EAAC,EAAE,CAAC,IAAI;AAAA,UAChB;AAAA,QACF;AAAA,MACF;AAGA,aAAO,IAAID,aAAY;AAAA,QACrB,MAAM;AAAA,QACN,MAAM,CAAC,MAAM,OAAO;AAAA,QACpB,UAAU;AAAA,MACZ,CAAC;AAAA,IACH;AAAA,EACF,CAAC;;;AC/FM,WAAS,eAAe,IAAIE,QAAOC,MAAKC,MAAK;AAClD,QAAI,EAAE,gBAAgB,iBAAiB;AACrC,YAAM,IAAI,YAAY,kDAAkD;AAAA,IAC1E;AACA,SAAK,KAAK;AACV,SAAK,QAAQF;AACb,SAAK,MAAMC;AACX,SAAK,MAAMC;AACX,SAAK,UAAU,2CAA2C,KAAK,OAAOF,SAAQ,gBAAgBC,QAAOC,SAAQ,UAAaA,SAAQ,OAAO,MAAMA,OAAM,MAAM;AAC3J,SAAK,QAAQ,IAAI,MAAM,EAAE;AAAA,EAC3B;AACA,iBAAe,YAAY,IAAI,MAAM;AACrC,iBAAe,UAAU,cAAc;AACvC,iBAAe,UAAU,OAAO;AAChC,iBAAe,UAAU,mBAAmB;;;ACf5C,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,SAAS,UAAU,eAAe,SAAS,aAAa,eAAe,QAAQ;AACtH,MAAI,WAAW;AACf,MAAI,wBAAwB,GAAG,OAAO,UAAU,IAAI,EAAE,OAAO,UAAU,OAAO,EAAE,OAAO,QAAQ;AAC/F,WAAS,KAAK,OAAO;AACnB,WAAO,CAAC,MAAM,KAAK,aAAW,MAAM,QAAQ,OAAO,CAAC;AAAA,EACtD;AACO,MAAI,YAA2B,wBAAQD,QAAMC,gBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,QAAAC;AAAA,MACA,OAAAC;AAAA,MACA,aAAAC;AAAA,MACA,OAAAC;AAAA,MACA,WAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAIC,OAAM,UAAU;AAAA,MAClB,OAAAT;AAAA,MACA,QAAAE;AAAA,MACA,OAAAC;AAAA,MACA,QAAAF;AAAA,MACA,aAAAG;AAAA,MACA,OAAAC;AAAA,MACA,aAAAE;AAAA,MACA,QAAAC;AAAA,IACF,CAAC;AACD,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAR;AAAA,IACF,CAAC;AACD,QAAI,mBAAmB,uBAAuB;AAAA,MAC5C,OAAAA;AAAA,MACA,aAAAI;AAAA,IACF,CAAC;AACD,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAJ;AAAA,MACA,aAAAO;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAP;AAAA,MACA,QAAAC;AAAA,MACA,QAAAO;AAAA,IACF,CAAC;AA2BD,WAAOR,OAAMF,QAAM;AAAA,MACjB,kBAAkB;AAAA,MAClB,wBAAwB;AAAA,MACxB,sBAAsB,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC;AAAA,IACzC,GAAG,qBAAqB;AAAA,MACtB,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,GAAG;AAAA,MACF,CAAC,qBAAqB,GAAGE,OAAM,YAAY,CAAAU,UAAQ,CAAC,GAAG,GAAG,SAAS;AACjE,YAAI,MAAMA,MAAK,GAAG,CAAC;AACnB,iBAASC,KAAI,GAAGA,KAAI,KAAK,QAAQA,MAAK;AACpC,gBAAMD,MAAK,KAAK,KAAKC,EAAC,CAAC;AAAA,QACzB;AACA,eAAO;AAAA,MACT,CAAC;AAAA,MACD,OAAOX,OAAM,YAAY,CAAAU,UAAQ,WAAS;AACxC,YAAI,MAAM,WAAW,KAAK,MAAM,QAAQ,MAAM,CAAC,CAAC,KAAK,KAAK,MAAM,CAAC,CAAC,GAAG;AACnE,iBAAOA,MAAK,GAAG,MAAM,CAAC,CAAC;AAAA,QACzB;AACA,YAAI,KAAK,KAAK,GAAG;AACf,iBAAOA,MAAK,GAAG,KAAK;AAAA,QACtB;AACA,cAAM,IAAI,eAAe,kCAAkC;AAAA,MAC7D,CAAC;AAAA,MACD,QAAQV,OAAM,YAAY,CAAAU,UAAQ,CAAAT,YAAU;AAC1C,eAAOS,MAAKT,QAAO,QAAQ,CAAC;AAAA,MAC9B,CAAC;AAAA,IACH,CAAC;AASD,aAAS,WAAW,GAAG,GAAG;AACxB,UAAI,CAAC,UAAU,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG;AAClC,cAAM,IAAI,MAAM,oDAAoD;AAAA,MACtE;AAGA,UAAI;AACJ,aAAO,MAAM,GAAG;AACd,YAAIQ,KAAI,GAAG,CAAC;AACZ,YAAI;AACJ,YAAI;AAAA,MACN;AACA,aAAO,IAAI,IAAI,CAAC,IAAI;AAAA,IACtB;AASA,aAAS,cAAc,GAAG,GAAG;AAC3B,UAAI,CAAC,EAAE,MAAM,KAAK,CAAC,EAAE,MAAM,GAAG;AAC5B,cAAM,IAAI,MAAM,oDAAoD;AAAA,MACtE;AAGA,UAAI,OAAO,IAAIH,WAAU,CAAC;AAC1B,aAAO,CAAC,EAAE,OAAO,GAAG;AAClB,YAAI,IAAIG,KAAI,GAAG,CAAC;AAChB,YAAI;AACJ,YAAI;AAAA,MACN;AACA,aAAO,EAAE,GAAG,IAAI,IAAI,EAAE,IAAI,IAAI;AAAA,IAChC;AAAA,EACF,CAAC;;;ACrJD,MAAIG,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,aAAa;AACnC,MAAI,uBAAsC,wBAAQD,QAAMC,gBAAc,UAAQ;AACnF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,aAAAC;AAAA,IACF,IAAI;AAmBJ,WAAO,SAAS,eAAe,GAAG,GAAG,UAAU;AAE7C,UAAI,UAAU,EAAE;AAChB,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAE7E,UAAI,UAAU,EAAE;AAChB,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAG7E,UAAI,MAAM,WAAW,MAAM,QAAQ;AACjC,cAAM,IAAI,eAAe,MAAM,QAAQ,MAAM,MAAM;AAAA,MACrD;AAGA,UAAI,MAAM,CAAC,MAAM,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAClD,cAAM,IAAI,WAAW,mCAAmC,QAAQ,4BAA4B,QAAQ,GAAG;AAAA,MACzG;AAGA,UAAI,OAAO,MAAM,CAAC;AAClB,UAAI,UAAU,MAAM,CAAC;AAGrB,UAAI;AAEJ,UAAI,KAAKA;AAET,UAAI,OAAO;AAEX,UAAI,KAAK;AAGT,UAAI,OAAO,QAAQ,YAAY,QAAQ,OAAO,QAAQ,SAAS;AAE7D,aAAK;AAEL,aAAKD,OAAM,KAAKC,cAAa,CAAC,IAAI,EAAE,CAAC;AAErC,eAAOD,OAAM,QAAQ,GAAG,EAAE;AAE1B,aAAKA,OAAM,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;AAAA,MACpC;AAGA,UAAI,UAAU,WAAW,UAAU,CAAC,IAAI;AACxC,UAAI,SAAS,CAAC;AACd,UAAI,OAAO,CAAC;AAGZ,UAAI,IAAI,UAAU,CAAC,IAAI;AAEvB,UAAI,IAAI,CAAC;AAET,UAAI,IAAI,CAAC;AAGT,eAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAEhC,aAAK,CAAC,IAAI,OAAO;AAEjB,YAAI,OAAO,IAAI;AAEf,gBAAQ,GAAG,GAAG,GAAG,GAAG,GAAG,MAAM,QAAQ,EAAE;AAEvC,gBAAQ,GAAG,GAAG,GAAG,GAAG,GAAG,MAAM,QAAQ,EAAE;AAEvC,YAAI,GAAG;AAEL,cAAI,IAAI,KAAK,CAAC;AAEd,iBAAO,IAAI,OAAO,QAAQ;AAExB,gBAAIE,KAAI,OAAO,CAAC;AAEhB,gBAAI,EAAEA,EAAC,MAAM,MAAM;AAEjB,kBAAI,IAAI,EAAEA,EAAC;AAEX,kBAAI,CAAC,GAAG,GAAG,IAAI,GAAG;AAEhB,wBAAQ,KAAK,CAAC;AAEd;AAAA,cACF,OAAO;AAEL,uBAAO,OAAO,GAAG,CAAC;AAAA,cACpB;AAAA,YACF,OAAO;AAEL,qBAAO,OAAO,GAAG,CAAC;AAAA,YACpB;AAAA,UACF;AAAA,QACF,OAAO;AAEL,cAAI,IAAI,KAAK,CAAC;AAEd,iBAAO,IAAI,OAAO,QAAQ;AAExB,gBAAI,IAAI,OAAO,CAAC;AAEhB,gBAAI,EAAE,CAAC,MAAM,MAAM;AAEjB,qBAAO,OAAO,GAAG,CAAC;AAAA,YACpB,OAAO;AAEL;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,WAAK,OAAO,IAAI,OAAO;AAGvB,aAAO,EAAE,mBAAmB;AAAA,QAC1B,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,KAAK;AAAA,QACL,MAAM,CAAC,MAAM,OAAO;AAAA,QACpB,UAAU,QAAQ,EAAE,aAAa,QAAQ,EAAE,YAAY,KAAK;AAAA,MAC9D,CAAC;AAAA,IACH;AAAA,EACF,CAAC;;;AClJD,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,eAAe,QAAQ;AACvD,MAAI,YAA2B,wBAAQD,QAAMC,gBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAH;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAF;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAF;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAF;AAAA,MACA,QAAAC;AAAA,MACA,QAAAE;AAAA,IACF,CAAC;AACD,QAAI,WAAW;AACf,QAAI,mBAAmB,CAAC;AACxB,qBAAiB,GAAG,OAAO,UAAU,IAAI,EAAE,OAAO,UAAU,OAAO,EAAE,OAAO,QAAQ,CAAC,IAAIH,OAAM,YAAY,CAAAI,UAAQ,CAAC,GAAG,GAAG,SAAS;AACjI,UAAI,MAAMA,MAAK,GAAG,CAAC;AACnB,eAASC,KAAI,GAAGA,KAAI,KAAK,QAAQA,MAAK;AACpC,cAAMD,MAAK,KAAK,KAAKC,EAAC,CAAC;AAAA,MACzB;AACA,aAAO;AAAA,IACT,CAAC;AA+BD,WAAOL,OAAMF,QAAM;AAAA,MACjB,kBAAkB;AAAA,MAClB,wBAAwB;AAAA,MACxB,sBAAsB,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC;AAAA,IACzC,GAAG,qBAAqB;AAAA,MACtB,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,GAAG,gBAAgB;AASpB,aAAS,cAAc,GAAG,GAAG;AAC3B,UAAI,CAAC,EAAE,MAAM,KAAK,CAAC,EAAE,MAAM,GAAG;AAC5B,cAAM,IAAI,MAAM,oDAAoD;AAAA,MACtE;AACA,UAAI,EAAE,OAAO,GAAG;AACd,eAAO;AAAA,MACT;AACA,UAAI,EAAE,OAAO,GAAG;AACd,eAAO;AAAA,MACT;AAIA,UAAIQ,QAAO,EAAE,MAAM,CAAC;AACpB,aAAO,CAAC,EAAE,OAAO,GAAG;AAClB,YAAI,IAAI;AACR,YAAI,EAAE,IAAI,CAAC;AACX,YAAI;AAAA,MACN;AACA,aAAOA,MAAK,IAAI,CAAC,EAAE,IAAI;AAAA,IACzB;AAAA,EACF,CAAC;;;AC7FM,WAAS,iBAAiBC,QAAO,WAAWC,SAAQ,MAAM;AAC/D,WAAO,SAAU,GAAG;AAClB,UAAI,IAAI,KAAKA,QAAO,aAAa;AAC/B,YAAI,KAAK,EAAG,QAAO;AACnB,YAAI,IAAI,EAAE,SAAS,EAAE;AACrB,YAAI,MAAM,EAAE,UAAU,GAAG,EAAE;AAC3B,eAAOD,UAAS,EAAE,SAAS,IAAI,UAAU,UAAU,OAAO,OAAO,GAAG,CAAC;AAAA,MACvE;AACA,aAAO,KAAK,EAAE,SAAS,CAAC;AAAA,IAC1B;AAAA,EACF;;;ACtBA,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,SAAS;AAChD,MAAI,QAAQ,YAAY,EAAE;AACnB,MAAI,cAA6B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,IACF,IAAI;AA2BJ,aAAS,WAAW,GAAG;AACrB,aAAO,EAAE,IAAI,EAAE,IAAI,KAAK,IAAI;AAAA,IAC9B;AACA,aAAS,iBAAiB,GAAG;AAC3B,aAAO,WAAW,IAAIA,SAAQ,GAAG,CAAC,CAAC;AAAA,IACrC;AACA,WAAOF,OAAMF,QAAM;AAAA,MACjB,QAAQ,SAASK,QAAO,GAAG;AACzB,YAAI,KAAK,KAAKF,QAAO,aAAa;AAChC,iBAAO,YAAY,CAAC;AAAA,QACtB,OAAO;AAEL,iBAAO,iBAAiB,CAAC;AAAA,QAC3B;AAAA,MACF;AAAA,MACA,QAAQ,iBAAiB,OAAO,aAAaA,SAAQ,gBAAgB;AAAA,MACrE,SAAS;AAAA,MACT,WAAW,SAASG,WAAU,GAAG;AAC/B,YAAI,CAAC,EAAE,WAAW,KAAKH,QAAO,aAAa;AACzC,iBAAO,EAAE,IAAI;AAAA,QACf,OAAO;AAEL,iBAAO,iBAAiB,EAAE,SAAS,CAAC;AAAA,QACtC;AAAA,MACF;AAAA,MACA,kBAAkBD,OAAM,YAAY,CAAAK,UAAQ,OAAKC,SAAQ,GAAGD,KAAI,CAAC;AAAA,IACnE,CAAC;AAAA,EACH,CAAC;;;AC9DD,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,SAAS;AACzC,MAAI,aAA4B,wBAAQD,QAAMC,gBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,IACF,IAAI;AA0BJ,aAAS,kBAAkB,GAAG;AAC5B,aAAO,aAAa,IAAIA,SAAQ,GAAG,CAAC,CAAC;AAAA,IACvC;AACA,WAAOF,OAAMF,QAAM;AAAA,MACjB,QAAQ,SAASK,QAAO,GAAG;AACzB,YAAI,KAAK,KAAKF,QAAO,aAAa;AAChC,iBAAO,WAAW,CAAC;AAAA,QACrB,OAAO;AAEL,iBAAO,kBAAkB,CAAC;AAAA,QAC5B;AAAA,MACF;AAAA,MACA,QAAQ,iBAAiB,GAAG,YAAYA,SAAQ,iBAAiB;AAAA,MACjE,SAAS;AAAA,MACT,WAAW,SAASG,WAAU,GAAG;AAC/B,YAAI,CAAC,EAAE,WAAW,KAAKH,QAAO,aAAa;AACzC,iBAAO,EAAE,IAAI,CAAC;AAAA,QAChB,OAAO;AAEL,iBAAO,kBAAkB,EAAE,SAAS,CAAC;AAAA,QACvC;AAAA,MACF;AAAA,MACA,kBAAkBD,OAAM,YAAY,CAAAK,UAAQ,OAAKC,SAAQ,GAAGD,KAAI,CAAC;AAAA,IACnE,CAAC;AAQD,aAAS,aAAa,GAAG;AACvB,UAAI,OAAO,KAAK,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE;AAC9C,aAAO,IAAIH,SAAQ,KAAK,OAAO,KAAK,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,KAAK,KAAK,MAAM,EAAE,IAAI,EAAE,EAAE,IAAI,KAAK,GAAG;AAAA,IAC/G;AAAA,EACF,CAAC;;;ACtED,MAAIK,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,uBAAsC,wBAAQD,QAAMC,gBAAc,UAAQ;AACnF,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAaJ,WAAOA,OAAM,kBAAkB;AAAA,MAC7B,kBAAkB;AAAA,MAClB,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,eAAO,EAAE,IAAI,CAAC;AAAA,MAChB;AAAA,MACA,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,eAAO,EAAE,MAAM,CAAC;AAAA,MAClB;AAAA,MACA,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,eAAO,IAAI;AAAA,MACb;AAAA,MACA,sBAAsB,SAAS,kBAAkB,GAAG,GAAG;AACrD,eAAO,EAAE,IAAI,CAAC;AAAA,MAChB;AAAA,MACA,iDAAiD,CAAC,GAAG,MAAM,EAAE,SAAS,CAAC;AAAA,MACvE,wDAAwD,CAAC,GAAG,MAAM,EAAE,SAAS,CAAC;AAAA,IAChF,CAAC;AAAA,EACH,CAAC;;;AChCD,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,aAAa,kBAAkB,eAAe,KAAK;AACnF,MAAI,iBAAgC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC7E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,aAAAC;AAAA,MACA,KAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAL;AAAA,MACA,aAAAI;AAAA,IACF,CAAC;AACD,QAAI,eAAe,mBAAmB;AAAA,MACpC,OAAAJ;AAAA,IACF,CAAC;AACD,aAAS,0BAA0B,OAAO,OAAO;AAE/C,cAAQ,MAAM,QAAQ;AAAA,QACpB,KAAK;AAEH,kBAAQ,MAAM,QAAQ;AAAA,YACpB,KAAK;AAEH,kBAAI,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAEzB,sBAAM,IAAI,WAAW,yEAAyE;AAAA,cAChG;AACA;AAAA,YACF,KAAK;AAEH,kBAAI,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAEzB,sBAAM,IAAI,WAAW,0DAA0D,MAAM,CAAC,IAAI,+BAA+B,MAAM,CAAC,IAAI,GAAG;AAAA,cACzI;AACA;AAAA,YACF;AACE,oBAAM,IAAI,MAAM,iEAAiE,MAAM,SAAS,cAAc;AAAA,UAClH;AACA;AAAA,QACF,KAAK;AAEH,kBAAQ,MAAM,QAAQ;AAAA,YACpB,KAAK;AAEH,kBAAI,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAEzB,sBAAM,IAAI,WAAW,2DAA2D,MAAM,CAAC,IAAI,iCAAiC,MAAM,CAAC,IAAI,GAAG;AAAA,cAC5I;AACA;AAAA,YACF,KAAK;AAEH,kBAAI,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAEzB,sBAAM,IAAI,WAAW,6DAA6D,MAAM,CAAC,IAAI,iCAAiC,MAAM,CAAC,IAAI,GAAG;AAAA,cAC9I;AACA;AAAA,YACF;AACE,oBAAM,IAAI,MAAM,iEAAiE,MAAM,SAAS,cAAc;AAAA,UAClH;AACA;AAAA,QACF;AACE,gBAAM,IAAI,MAAM,iEAAiE,MAAM,SAAS,cAAc;AAAA,MAClH;AAAA,IACF;AAUA,aAAS,sBAAsB,GAAG,GAAG,GAAG;AAEtC,UAAI,MAAM,GAAG;AACX,cAAM,IAAI,MAAM,mCAAmC;AAAA,MACrD;AACA,aAAOK,KAAI,GAAG,CAAC;AAAA,IACjB;AAUA,aAAS,sBAAsB,GAAG,GAAG;AAEnC,UAAI,EAAE,QAAQ,MAAM,SAAS;AAC3B,cAAM,IAAI,MAAM,0CAA0C;AAAA,MAC5D;AACA,aAAO,2BAA2B,GAAG,CAAC;AAAA,IACxC;AAUA,aAAS,2BAA2B,GAAG,GAAG;AAExC,UAAI,QAAQ,EAAE;AACd,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE,aAAa,EAAE,YAAY;AAEvC,UAAI,QAAQ,EAAE;AACd,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE,aAAa,EAAE,YAAY;AAEvC,UAAI,UAAU,MAAM,CAAC;AACrB,UAAI,WAAW,MAAM,CAAC;AAGtB,UAAI;AAEJ,UAAI,KAAKH;AAET,UAAI,KAAKC;AAGT,UAAI,OAAO,OAAO,QAAQ,OAAO,OAAO,QAAQ,YAAY,QAAQ,SAAS;AAE3E,aAAK;AAEL,aAAKH,OAAM,KAAKE,YAAW,CAAC,IAAI,EAAE,CAAC;AACnC,aAAKF,OAAM,KAAKG,iBAAgB,CAAC,IAAI,EAAE,CAAC;AAAA,MAC1C;AAGA,UAAI,IAAI,CAAC;AAGT,eAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AAEjC,YAAIG,OAAM,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;AAElC,iBAASC,KAAI,GAAGA,KAAI,SAASA,MAAK;AAEhC,UAAAD,OAAM,GAAGA,MAAK,GAAG,MAAMC,EAAC,GAAG,MAAMA,EAAC,EAAE,CAAC,CAAC,CAAC;AAAA,QACzC;AACA,UAAE,CAAC,IAAID;AAAA,MACT;AAGA,aAAO,EAAE,kBAAkB;AAAA,QACzB,MAAM;AAAA,QACN,MAAM,CAAC,QAAQ;AAAA,QACf,UAAU,QAAQ,EAAE,aAAa,QAAQ,EAAE,YAAY,KAAK;AAAA,MAC9D,CAAC;AAAA,IACH;AAUA,QAAI,wBAAwBN,OAAM,yBAAyB;AAAA,MACzD,oBAAoB;AAAA,MACpB,qBAAqB;AAAA,IACvB,CAAC;AAUD,QAAI,wBAAwBA,OAAM,yBAAyB;AAAA,MACzD,4BAA4B;AAAA,MAC5B,6BAA6B;AAAA,MAC7B,6BAA6B;AAAA,MAC7B,8BAA8B;AAAA,IAChC,CAAC;AAUD,aAAS,2BAA2B,GAAG,GAAG;AAExC,UAAI,QAAQ,EAAE;AACd,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE,aAAa,EAAE,YAAY;AAEvC,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE,aAAa,EAAE,YAAY;AAEvC,UAAI,QAAQ,MAAM,CAAC;AACnB,UAAI,WAAW,MAAM,CAAC;AAGtB,UAAI;AAEJ,UAAI,KAAKE;AAET,UAAI,KAAKC;AAGT,UAAI,OAAO,OAAO,QAAQ,OAAO,OAAO,QAAQ,YAAY,QAAQ,SAAS;AAE3E,aAAK;AAEL,aAAKH,OAAM,KAAKE,YAAW,CAAC,IAAI,EAAE,CAAC;AACnC,aAAKF,OAAM,KAAKG,iBAAgB,CAAC,IAAI,EAAE,CAAC;AAAA,MAC1C;AAGA,UAAI,IAAI,CAAC;AAGT,eAASI,KAAI,GAAGA,KAAI,OAAOA,MAAK;AAE9B,YAAIC,OAAM,MAAMD,EAAC;AAEjB,YAAID,OAAM,GAAGE,KAAI,CAAC,GAAG,MAAM,CAAC,CAAC;AAE7B,iBAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AAEjC,UAAAF,OAAM,GAAGA,MAAK,GAAGE,KAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;AAAA,QACpC;AACA,UAAED,EAAC,IAAID;AAAA,MACT;AAGA,aAAO,EAAE,kBAAkB;AAAA,QACzB,MAAM;AAAA,QACN,MAAM,CAAC,KAAK;AAAA,QACZ,UAAU,QAAQ,EAAE,aAAa,QAAQ,EAAE,YAAY,KAAK;AAAA,MAC9D,CAAC;AAAA,IACH;AAUA,aAAS,gCAAgC,GAAG,GAAG;AAG7C,UAAI,QAAQ,EAAE;AACd,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE,aAAa,EAAE,YAAY;AAEvC,UAAI,QAAQ,EAAE;AACd,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE,aAAa,EAAE,YAAY;AAEvC,UAAI,QAAQ,MAAM,CAAC;AACnB,UAAI,WAAW,MAAM,CAAC;AACtB,UAAI,WAAW,MAAM,CAAC;AAGtB,UAAI;AAEJ,UAAI,KAAKJ;AAET,UAAI,KAAKC;AAGT,UAAI,OAAO,OAAO,QAAQ,OAAO,OAAO,QAAQ,YAAY,QAAQ,WAAW,QAAQ,SAAS;AAE9F,aAAK;AAEL,aAAKH,OAAM,KAAKE,YAAW,CAAC,IAAI,EAAE,CAAC;AACnC,aAAKF,OAAM,KAAKG,iBAAgB,CAAC,IAAI,EAAE,CAAC;AAAA,MAC1C;AAGA,UAAI,IAAI,CAAC;AAGT,eAASI,KAAI,GAAGA,KAAI,OAAOA,MAAK;AAE9B,YAAIC,OAAM,MAAMD,EAAC;AAEjB,UAAEA,EAAC,IAAI,CAAC;AAER,iBAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AAEjC,cAAID,OAAM,GAAGE,KAAI,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;AAEhC,mBAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AAEjC,YAAAF,OAAM,GAAGA,MAAK,GAAGE,KAAI,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;AAAA,UACvC;AACA,YAAED,EAAC,EAAE,CAAC,IAAID;AAAA,QACZ;AAAA,MACF;AAGA,aAAO,EAAE,kBAAkB;AAAA,QACzB,MAAM;AAAA,QACN,MAAM,CAAC,OAAO,QAAQ;AAAA,QACtB,UAAU,QAAQ,EAAE,aAAa,QAAQ,EAAE,YAAY,KAAK;AAAA,MAC9D,CAAC;AAAA,IACH;AAUA,aAAS,iCAAiC,GAAG,GAAG;AAE9C,UAAI,QAAQ,EAAE;AACd,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE,aAAa,EAAE,YAAY;AAEvC,UAAI,UAAU,EAAE;AAChB,UAAI,SAAS,EAAE;AACf,UAAI,OAAO,EAAE;AACb,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAE7E,UAAI,CAAC,SAAS;AACZ,cAAM,IAAI,MAAM,wDAAwD;AAAA,MAC1E;AAEA,UAAI,QAAQ,MAAM,CAAC;AACnB,UAAI,WAAW,MAAM,CAAC;AAGtB,UAAI;AAEJ,UAAI,KAAKJ;AAET,UAAI,KAAKC;AAET,UAAI,KAAKC;AAET,UAAI,OAAO;AAGX,UAAI,OAAO,OAAO,QAAQ,OAAO,OAAO,QAAQ,YAAY,QAAQ,SAAS;AAE3E,aAAK;AAEL,aAAKJ,OAAM,KAAKE,YAAW,CAAC,IAAI,EAAE,CAAC;AACnC,aAAKF,OAAM,KAAKG,iBAAgB,CAAC,IAAI,EAAE,CAAC;AACxC,aAAKH,OAAM,KAAKI,cAAa,CAAC,IAAI,EAAE,CAAC;AAErC,eAAOJ,OAAM,QAAQ,GAAG,EAAE;AAAA,MAC5B;AAGA,UAAI,UAAU,CAAC;AACf,UAAI,SAAS,CAAC;AACd,UAAI,OAAO,CAAC;AAEZ,UAAI,IAAI,EAAE,mBAAmB;AAAA,QAC3B,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,KAAK;AAAA,QACL,MAAM,CAAC,OAAO,QAAQ;AAAA,QACtB,UAAU,QAAQ,EAAE,aAAa,QAAQ,EAAE,YAAY,KAAK;AAAA,MAC9D,CAAC;AAGD,eAAS,KAAK,GAAG,KAAK,UAAU,MAAM;AAEpC,aAAK,EAAE,IAAI,OAAO;AAElB,YAAI,MAAM,KAAK,EAAE;AACjB,YAAI,MAAM,KAAK,KAAK,CAAC;AAErB,YAAI,MAAM,KAAK;AAEb,cAAI,OAAO;AAEX,mBAASO,KAAI,GAAGA,KAAI,OAAOA,MAAK;AAE9B,gBAAI,OAAOA,KAAI;AAEf,gBAAI,MAAM;AAEV,qBAAS,KAAK,KAAK,KAAK,KAAK,MAAM;AAEjC,kBAAI,KAAK,OAAO,EAAE;AAElB,kBAAI,SAAS,MAAM;AAEjB,sBAAM,GAAG,MAAMA,EAAC,EAAE,EAAE,GAAG,QAAQ,EAAE,CAAC;AAElC,uBAAO;AAAA,cACT,OAAO;AAEL,sBAAM,GAAG,KAAK,GAAG,MAAMA,EAAC,EAAE,EAAE,GAAG,QAAQ,EAAE,CAAC,CAAC;AAAA,cAC7C;AAAA,YACF;AAEA,gBAAI,SAAS,QAAQ,CAAC,GAAG,KAAK,IAAI,GAAG;AAEnC,qBAAO,KAAKA,EAAC;AACb,sBAAQ,KAAK,GAAG;AAAA,YAClB;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,WAAK,QAAQ,IAAI,OAAO;AAGxB,aAAO;AAAA,IACT;AAUA,aAAS,4BAA4B,GAAG,GAAG;AAEzC,UAAI,UAAU,EAAE;AAChB,UAAI,SAAS,EAAE;AACf,UAAI,OAAO,EAAE;AACb,UAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAE7E,UAAI,CAAC,SAAS;AACZ,cAAM,IAAI,MAAM,wDAAwD;AAAA,MAC1E;AAEA,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE,aAAa,EAAE,YAAY;AAEvC,UAAI,QAAQ,EAAE,MAAM,CAAC;AACrB,UAAI,QAAQ,EAAE,MAAM,CAAC;AAErB,UAAI,UAAU,CAAC;AACf,UAAI,SAAS,CAAC;AACd,UAAI,OAAO,CAAC;AAGZ,UAAI;AAEJ,UAAI,KAAKL;AAET,UAAI,KAAKC;AAET,UAAI,KAAKC;AAET,UAAI,OAAO;AAGX,UAAI,OAAO,OAAO,QAAQ,OAAO,OAAO,QAAQ,YAAY,QAAQ,SAAS;AAE3E,aAAK;AAEL,aAAKJ,OAAM,KAAKE,YAAW,CAAC,IAAI,EAAE,CAAC;AACnC,aAAKF,OAAM,KAAKG,iBAAgB,CAAC,IAAI,EAAE,CAAC;AACxC,aAAKH,OAAM,KAAKI,cAAa,CAAC,IAAI,EAAE,CAAC;AAErC,eAAOJ,OAAM,QAAQ,GAAG,EAAE;AAAA,MAC5B;AAGA,UAAI,IAAI,CAAC;AAET,UAAI,IAAI,CAAC;AAGT,WAAK,CAAC,IAAI;AAEV,eAAS,KAAK,GAAG,KAAK,OAAO,MAAM;AAEjC,YAAI,MAAM,MAAM,EAAE;AAElB,YAAI,CAAC,GAAG,KAAK,IAAI,GAAG;AAElB,mBAAS,MAAM,KAAK,EAAE,GAAG,MAAM,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,KAAK,KAAK,MAAM;AAErE,gBAAI,KAAK,OAAO,EAAE;AAElB,gBAAI,CAAC,EAAE,EAAE,GAAG;AAEV,gBAAE,EAAE,IAAI;AAER,qBAAO,KAAK,EAAE;AAEd,gBAAE,EAAE,IAAI,GAAG,KAAK,QAAQ,EAAE,CAAC;AAAA,YAC7B,OAAO;AAEL,gBAAE,EAAE,IAAI,GAAG,EAAE,EAAE,GAAG,GAAG,KAAK,QAAQ,EAAE,CAAC,CAAC;AAAA,YACxC;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,eAAS,KAAK,OAAO,QAAQ,IAAI,GAAG,IAAI,IAAI,KAAK;AAE/C,YAAI,KAAK,OAAO,CAAC;AAEjB,gBAAQ,CAAC,IAAI,EAAE,EAAE;AAAA,MACnB;AAEA,WAAK,CAAC,IAAI,OAAO;AAGjB,aAAO,EAAE,mBAAmB;AAAA,QAC1B,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,KAAK;AAAA,QACL,MAAM,CAAC,OAAO,CAAC;AAAA,QACf,UAAU,QAAQ,EAAE,aAAa,QAAQ,EAAE,YAAY,KAAK;AAAA,MAC9D,CAAC;AAAA,IACH;AAUA,aAAS,iCAAiC,GAAG,GAAG;AAE9C,UAAI,UAAU,EAAE;AAChB,UAAI,SAAS,EAAE;AACf,UAAI,OAAO,EAAE;AACb,UAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAE7E,UAAI,CAAC,SAAS;AACZ,cAAM,IAAI,MAAM,wDAAwD;AAAA,MAC1E;AAEA,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE,aAAa,EAAE,YAAY;AAEvC,UAAI,QAAQ,EAAE,MAAM,CAAC;AACrB,UAAI,QAAQ,EAAE,MAAM,CAAC;AACrB,UAAI,WAAW,EAAE,MAAM,CAAC;AAGxB,UAAI;AAEJ,UAAI,KAAKE;AAET,UAAI,KAAKC;AAET,UAAI,KAAKC;AAET,UAAI,OAAO;AAGX,UAAI,OAAO,OAAO,QAAQ,OAAO,OAAO,QAAQ,YAAY,QAAQ,SAAS;AAE3E,aAAK;AAEL,aAAKJ,OAAM,KAAKE,YAAW,CAAC,IAAI,EAAE,CAAC;AACnC,aAAKF,OAAM,KAAKG,iBAAgB,CAAC,IAAI,EAAE,CAAC;AACxC,aAAKH,OAAM,KAAKI,cAAa,CAAC,IAAI,EAAE,CAAC;AAErC,eAAOJ,OAAM,QAAQ,GAAG,EAAE;AAAA,MAC5B;AAGA,UAAI,UAAU,CAAC;AACf,UAAI,SAAS,CAAC;AACd,UAAI,OAAO,CAAC;AAEZ,UAAI,IAAI,EAAE,mBAAmB;AAAA,QAC3B,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,KAAK;AAAA,QACL,MAAM,CAAC,OAAO,QAAQ;AAAA,QACtB,UAAU,QAAQ,EAAE,aAAa,QAAQ,EAAE,YAAY,KAAK;AAAA,MAC9D,CAAC;AAGD,UAAI,IAAI,CAAC;AAET,UAAI,IAAI,CAAC;AAGT,eAAS,KAAK,GAAG,KAAK,UAAU,MAAM;AAEpC,aAAK,EAAE,IAAI,OAAO;AAElB,YAAI,OAAO,KAAK;AAEhB,iBAAS,KAAK,GAAG,KAAK,OAAO,MAAM;AAEjC,cAAI,OAAO,MAAM,EAAE,EAAE,EAAE;AAEvB,cAAI,CAAC,GAAG,MAAM,IAAI,GAAG;AAEnB,qBAAS,MAAM,KAAK,EAAE,GAAG,MAAM,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,KAAK,KAAK,MAAM;AAErE,kBAAI,KAAK,OAAO,EAAE;AAElB,kBAAI,EAAE,EAAE,MAAM,MAAM;AAElB,kBAAE,EAAE,IAAI;AAER,uBAAO,KAAK,EAAE;AAEd,kBAAE,EAAE,IAAI,GAAG,MAAM,QAAQ,EAAE,CAAC;AAAA,cAC9B,OAAO;AAEL,kBAAE,EAAE,IAAI,GAAG,EAAE,EAAE,GAAG,GAAG,MAAM,QAAQ,EAAE,CAAC,CAAC;AAAA,cACzC;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAEA,iBAAS,KAAK,KAAK,EAAE,GAAG,KAAK,OAAO,QAAQ,IAAI,IAAI,IAAI,IAAI,KAAK;AAE/D,cAAI,KAAK,OAAO,CAAC;AAEjB,kBAAQ,CAAC,IAAI,EAAE,EAAE;AAAA,QACnB;AAAA,MACF;AAEA,WAAK,QAAQ,IAAI,OAAO;AAGxB,aAAO;AAAA,IACT;AAUA,aAAS,kCAAkC,GAAG,GAAG;AAE/C,UAAI,UAAU,EAAE;AAChB,UAAI,SAAS,EAAE;AACf,UAAI,OAAO,EAAE;AACb,UAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAE7E,UAAI,UAAU,EAAE;AAChB,UAAI,SAAS,EAAE;AACf,UAAI,OAAO,EAAE;AACb,UAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAG7E,UAAI,QAAQ,EAAE,MAAM,CAAC;AACrB,UAAI,WAAW,EAAE,MAAM,CAAC;AAExB,UAAI,SAAS,WAAW;AAGxB,UAAI;AAEJ,UAAI,KAAKE;AAET,UAAI,KAAKC;AAGT,UAAI,OAAO,OAAO,QAAQ,OAAO,OAAO,QAAQ,YAAY,QAAQ,SAAS;AAE3E,aAAK;AAEL,aAAKH,OAAM,KAAKE,YAAW,CAAC,IAAI,EAAE,CAAC;AACnC,aAAKF,OAAM,KAAKG,iBAAgB,CAAC,IAAI,EAAE,CAAC;AAAA,MAC1C;AAGA,UAAI,UAAU,SAAS,CAAC,IAAI;AAC5B,UAAI,SAAS,CAAC;AACd,UAAI,OAAO,CAAC;AAEZ,UAAI,IAAI,EAAE,mBAAmB;AAAA,QAC3B,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,KAAK;AAAA,QACL,MAAM,CAAC,OAAO,QAAQ;AAAA,QACtB,UAAU,QAAQ,EAAE,aAAa,QAAQ,EAAE,YAAY,KAAK;AAAA,MAC9D,CAAC;AAGD,UAAI,IAAI,SAAS,CAAC,IAAI;AAEtB,UAAI,IAAI,CAAC;AAET,UAAI,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,IAAI;AAEpC,eAAS,KAAK,GAAG,KAAK,UAAU,MAAM;AAEpC,aAAK,EAAE,IAAI,OAAO;AAElB,YAAI,OAAO,KAAK;AAEhB,aAAK,MAAM,KAAK,EAAE,GAAG,MAAM,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,KAAK,KAAK,MAAM;AAEjE,eAAK,OAAO,EAAE;AAEd,cAAI,QAAQ;AAEV,iBAAK,MAAM,KAAK,EAAE,GAAG,MAAM,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,KAAK,KAAK,MAAM;AAEjE,mBAAK,OAAO,EAAE;AAEd,kBAAI,EAAE,EAAE,MAAM,MAAM;AAElB,kBAAE,EAAE,IAAI;AAER,uBAAO,KAAK,EAAE;AAEd,kBAAE,EAAE,IAAI,GAAG,QAAQ,EAAE,GAAG,QAAQ,EAAE,CAAC;AAAA,cACrC,OAAO;AAEL,kBAAE,EAAE,IAAI,GAAG,EAAE,EAAE,GAAG,GAAG,QAAQ,EAAE,GAAG,QAAQ,EAAE,CAAC,CAAC;AAAA,cAChD;AAAA,YACF;AAAA,UACF,OAAO;AAEL,iBAAK,MAAM,KAAK,EAAE,GAAG,MAAM,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,KAAK,KAAK,MAAM;AAEjE,mBAAK,OAAO,EAAE;AAEd,kBAAI,EAAE,EAAE,MAAM,MAAM;AAElB,kBAAE,EAAE,IAAI;AAER,uBAAO,KAAK,EAAE;AAAA,cAChB;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAEA,YAAI,QAAQ;AAEV,mBAAS,KAAK,KAAK,EAAE,GAAG,KAAK,OAAO,QAAQ,IAAI,IAAI,IAAI,IAAI,KAAK;AAE/D,gBAAI,KAAK,OAAO,CAAC;AAEjB,oBAAQ,CAAC,IAAI,EAAE,EAAE;AAAA,UACnB;AAAA,QACF;AAAA,MACF;AAEA,WAAK,QAAQ,IAAI,OAAO;AAGxB,aAAO;AAAA,IACT;AAmCA,WAAOH,OAAMF,QAAMK,iBAAgB;AAAA;AAAA,MAGjC,gBAAgBH,OAAM,QAAQ,kBAAkB,YAAU,CAAC,GAAG,MAAM;AAElE,kCAA0B,UAAU,CAAC,GAAG,UAAU,CAAC,CAAC;AAGpD,YAAI,IAAI,OAAOC,QAAO,CAAC,GAAGA,QAAO,CAAC,CAAC;AAEnC,eAAO,SAAS,CAAC,IAAI,EAAE,QAAQ,IAAI;AAAA,MACrC,CAAC;AAAA,MACD,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAE7C,YAAI,QAAQ,EAAE,KAAK;AACnB,YAAI,QAAQ,EAAE,KAAK;AAGnB,kCAA0B,OAAO,KAAK;AAGtC,YAAI,MAAM,WAAW,GAAG;AAEtB,cAAI,MAAM,WAAW,GAAG;AAEtB,mBAAO,sBAAsB,GAAG,GAAG,MAAM,CAAC,CAAC;AAAA,UAC7C;AAEA,iBAAO,sBAAsB,GAAG,CAAC;AAAA,QACnC;AAEA,YAAI,MAAM,WAAW,GAAG;AAEtB,iBAAO,sBAAsB,GAAG,CAAC;AAAA,QACnC;AAEA,eAAO,sBAAsB,GAAG,CAAC;AAAA,MACnC;AAAA,MACA,iBAAiBD,OAAM,QAAQ,iBAAiB,YAAU,CAAC,GAAG,MAAM,OAAO,GAAGC,QAAO,CAAC,CAAC,CAAC;AAAA,MACxF,iBAAiBD,OAAM,YAAY,CAAAS,UAAQ,CAAC,GAAG,MAAM;AAEnD,eAAOA,MAAKR,QAAO,GAAG,EAAE,QAAQ,CAAC,GAAG,CAAC;AAAA,MACvC,CAAC;AAAA,MACD,qBAAqB,SAAS,iBAAiB,GAAG,GAAG;AACnD,eAAO,cAAc,GAAG,GAAGE,iBAAgB,KAAK;AAAA,MAClD;AAAA,MACA,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,eAAO,aAAa,GAAG,GAAGA,iBAAgB,KAAK;AAAA,MACjD;AAAA,MACA,qBAAqB,SAAS,iBAAiB,GAAG,GAAG;AACnD,eAAO,cAAc,GAAG,GAAGA,iBAAgB,IAAI;AAAA,MACjD;AAAA,MACA,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,eAAO,aAAa,GAAG,GAAGA,iBAAgB,IAAI;AAAA,MAChD;AAAA,MACA,cAAc,SAAS,UAAU,GAAG,GAAG;AAErC,eAAO,aAAaF,QAAO,CAAC,GAAG,GAAGE,iBAAgB,KAAK,EAAE,QAAQ;AAAA,MACnE;AAAA,MACA,cAAc,SAAS,UAAU,GAAG,GAAG;AAErC,eAAO,aAAaF,QAAO,CAAC,GAAG,GAAGE,iBAAgB,IAAI,EAAE,QAAQ;AAAA,MAClE;AAAA,MACA,YAAYA;AAAA,MACZ,oBAAoBH,OAAM,YAAY,CAAAS,UAAQ,CAAC,GAAG,GAAG,SAAS;AAC5D,YAAI,SAASA,MAAK,GAAG,CAAC;AACtB,iBAASF,KAAI,GAAGA,KAAI,KAAK,QAAQA,MAAK;AACpC,mBAASE,MAAK,QAAQ,KAAKF,EAAC,CAAC;AAAA,QAC/B;AACA,eAAO;AAAA,MACT,CAAC;AAAA,IACH,CAAC;AAAA,EACH,CAAC;;;ACx2BD,MAAIG,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,eAAe,aAAa,QAAQ;AACpE,MAAI,gBAA+B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC5E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,WAAW;AAAA,MACX,QAAAC;AAAA,IACF,IAAI;AACJ,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAH;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAA;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAF;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAF;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAF;AAAA,MACA,QAAAC;AAAA,MACA,QAAAE;AAAA,IACF,CAAC;AAqCD,aAAS,aAAa;AACpB,YAAM,IAAI,MAAM,yEAAyE;AAAA,IAC3F;AACA,WAAOH,OAAMF,QAAM;AAAA,MACjB,QAAQ;AAAA,MACR,kBAAkB;AAAA,MAClB,WAAW,OAAK,YAAY,GAAG,IAAI,WAAW,CAAC,CAAC;AAAA,MAChD,wBAAwB;AAAA,MACxB,SAAS;AAAA,MACT,mBAAmB;AAAA,MACnB,OAAOE,OAAM,QAAQ,sBAAsB,YAAU,OAAK,OAAOC,QAAO,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC;AAAA,MACxF,aAAaD,OAAM,QAAQ,sBAAsB,YAAU,OAAK,OAAO,GAAG,CAAC,CAAC;AAAA,MAC5E,cAAcA,OAAM,QAAQ,uBAAuB,YAAU,OAAK,OAAO,GAAG,CAAC,CAAC;AAAA,MAC9E,8BAA8BA,OAAM,YAAY,CAAAI,UAAQ,CAAC,GAAG,MAAM;AAEhE,YAAI,EAAE,QAAQ,MAAM,GAAG;AAErB,iBAAO,eAAe,GAAG,GAAGA,KAAI;AAAA,QAClC,OAAO;AAEL,gBAAM,IAAI,MAAM,uBAAuB;AAAA,QACzC;AAAA,MACF,CAAC;AAAA,MACD,6BAA6BJ,OAAM,YAAY,CAAAI,UAAQ,CAAC,GAAG,MAAM;AAE/D,YAAI,EAAE,QAAQ,MAAM,GAAG;AAErB,iBAAO,eAAe,GAAG,GAAGA,OAAM,KAAK;AAAA,QACzC,OAAO;AAEL,gBAAM,IAAI,MAAM,uBAAuB;AAAA,QACzC;AAAA,MACF,CAAC;AAAA,MACD,uBAAuBJ,OAAM,QAAQ,4BAA4B,YAAU,CAAC,GAAG,MAAM,OAAOC,QAAO,CAAC,GAAG,CAAC,CAAC;AAAA,MACzG,oCAAoCD,OAAM,YAAY,CAAAI,UAAQ,CAAC,GAAG,MAAM;AAEtE,YAAI,EAAE,QAAQ,MAAM,GAAG;AAErB,iBAAO,cAAc,GAAG,GAAGA,OAAM,IAAI;AAAA,QACvC,OAAO;AAEL,gBAAM,IAAI,MAAM,uBAAuB;AAAA,QACzC;AAAA,MACF,CAAC;AAAA,IACH,GAAG,qBAAqB;AAAA,MACtB,QAAQ;AAAA,MACR,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,CAAC;AASF,aAAS,YAAY,GAAG,MAAM;AAC5B,UAAI,YAAY,WAAW;AAC3B,UAAI,MAAM,WAAW,MAAM;AAAA,QACzB,WAAW,YAAY;AAAA,MACzB,CAAC;AACD,UAAI,OAAO,IAAI,WAAW,CAAC;AAC3B,UAAI,MAAM,IAAI,IAAI,CAAC;AACnB,UAAIC,OAAM,KAAK,WAAW;AAC1B,UAAIA,MAAK;AACP,eAAO,KAAK,IAAI;AAAA,MAClB;AACA,UAAI,KAAK,OAAO,GAAG;AACjB,cAAM,IAAI,MAAM,uBAAuB;AAAA,MACzC;AACA,UAAI,EAAE,WAAW,KAAK,CAAC,KAAK,IAAI,EAAE,IAAI,CAAC,EAAE,OAAO,CAAC,GAAG;AAClD,cAAM,IAAI,MAAM,sCAAsC;AAAA,MACxD;AAGA,UAAI,EAAE,OAAO,GAAG;AACd,eAAOA,OAAM,IAAI,IAAI,QAAQ,IAAI;AAAA,MACnC;AACA,UAAI,CAAC,EAAE,SAAS,GAAG;AACjB,eAAOA,OAAM,OAAO;AAAA,MACtB;AACA,UAAI,IAAI,EAAE,IAAI,EAAE,IAAI,IAAI,IAAI,IAAI,CAAC;AAGjC,UAAI,EAAE,MAAM,IAAI,EAAE,IAAI,IAAI;AAC1B,aAAO,IAAI,YAAYA,OAAM,IAAI,IAAI,CAAC,IAAI,GAAG,YAAY,SAAS,CAAC;AAAA,IACrE;AAAA,EACF,CAAC;;;AC/JD,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,aAAa,YAAY,SAAS;AACxD,MAAI,aAA4B,wBAAQD,QAAMC,gBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAW;AAAA,MACX,SAAAC;AAAA,MACA,UAAU;AAAA,IACZ,IAAI;AA+BJ,WAAOD,OAAMF,QAAM;AAAA,MACjB,QAAQ;AAAA,MACR,SAAS,SAASI,SAAQ,GAAG;AAC3B,eAAO,EAAE,OAAO,IAAID,SAAQ,WAAW,EAAE,EAAE,CAAC,IAAI,EAAE,KAAK;AAAA,MACzD;AAAA,MACA,WAAW,SAASE,WAAU,GAAG;AAC/B,eAAO,IAAI,WAAW,EAAE,IAAI,CAAC,CAAC;AAAA,MAChC;AAAA,MACA,QAAQ,SAASC,QAAO,GAAG;AACzB,eAAO,IAAI,KAAK,KAAK,IAAI,KAAK,CAAC,KAAK;AAAA,MACtC;AAAA,MACA,UAAU,SAASC,UAAS,GAAG;AAC7B,eAAO,EAAE,MAAM,KAAK,IAAI,UAAU,CAAC,IAAI,IAAI,UAAU,EAAE,CAAC;AAAA,MAC1D;AAAA;AAAA,MAEA,kBAAkBL,OAAM,YAAY,CAAAM,UAAQ,OAAKC,SAAQ,GAAGD,OAAM,IAAI,CAAC;AAAA,MACvE,MAAMN,OAAM,YAAY,CAAAM,UAAQ,OAAK;AACnC,YAAI,CAAC,EAAE,WAAW,KAAK,EAAE,MAAM,CAAC,EAAE,KAAK,WAAW,GAAG;AACnD,gBAAM,IAAI,UAAU,yCAAyC;AAAA,QAC/D;AACA,eAAON,OAAM,KAAKM,OAAM,EAAE,UAAU,CAAC,EAAE,EAAE,KAAK;AAAA,MAChD,CAAC;AAAA,IACH,CAAC;AAAA,EACH,CAAC;;;AChED,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,UAAU,SAAS,SAAS;AACzC,MAAI,aAA4B,wBAAQD,QAAMC,gBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,QAAAC;AAAA,MACA,OAAAC;AAAA,MACA,SAAAC;AAAA,IACF,IAAI;AA2BJ,WAAOD,OAAM,QAAQ;AAAA,MACnB,QAAQ;AAAA,MACR,SAAS,SAASC,SAAQ,GAAG;AAC3B,eAAO,EAAE,KAAK;AAAA,MAChB;AAAA,MACA,WAAW,SAASC,WAAU,GAAG;AAC/B,YAAI,CAAC,EAAE,WAAW,KAAKH,QAAO,aAAa;AACzC,iBAAO,EAAE,KAAK;AAAA,QAChB,OAAO;AAEL,iBAAO,YAAY,EAAE,SAAS,CAAC;AAAA,QACjC;AAAA,MACF;AAAA,MACA,MAAM,SAASI,MAAK,GAAG;AAErB,eAAO,EAAE,IAAI,GAAG;AAAA,MAClB;AAAA,IACF,CAAC;AAQD,aAAS,YAAY,GAAG;AACtB,UAAI,MAAM,CAAC,GAAG;AACZ,eAAO;AAAA,MACT,WAAW,KAAK,KAAKJ,QAAO,aAAa;AACvC,eAAO,KAAK,KAAK,CAAC;AAAA,MACpB,OAAO;AACL,eAAO,IAAIE,SAAQ,GAAG,CAAC,EAAE,KAAK;AAAA,MAChC;AAAA,IACF;AAAA,EACF,CAAC;;;ACnED,MAAIG,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,eAA8B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AA6BJ,WAAOA,OAAMF,QAAM;AAAA,MACjB,QAAQ;AAAA,MACR,SAAS,SAASG,SAAQ,GAAG;AAC3B,eAAO,EAAE,IAAI,CAAC;AAAA,MAChB;AAAA,MACA,WAAW,SAASC,WAAU,GAAG;AAC/B,eAAO,EAAE,MAAM,CAAC;AAAA,MAClB;AAAA,MACA,QAAQ,SAASC,QAAO,GAAG;AACzB,eAAO,IAAI;AAAA,MACb;AAAA,MACA,UAAU,SAASC,UAAS,GAAG;AAC7B,eAAO,EAAE,IAAI,CAAC;AAAA,MAChB;AAAA,MACA,MAAM,SAASC,MAAK,GAAG;AACrB,eAAO,EAAE,IAAI,CAAC;AAAA,MAChB;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC/CD,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,eAAe,kBAAkB,cAAc,eAAe,QAAQ;AACtG,MAAI,iBAAgC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC7E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,YAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AAGJ,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAN;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAA;AAAA,IACF,CAAC;AACD,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAA;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAF;AAAA,MACA,aAAAK;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAL;AAAA,MACA,aAAAK;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAL;AAAA,MACA,QAAAC;AAAA,MACA,QAAAK;AAAA,IACF,CAAC;AAgCD,WAAON,OAAMF,QAAM;AAAA,MACjB,YAAYK;AAAA,IACd,GAAG,qBAAqB;AAAA,MACtB,MAAMA;AAAA,MACN,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,CAAC;AAAA,EACJ,CAAC;;;ACnFD,MAAII,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,UAAU,WAAW;AACrD,MAAI,aAA4B,wBAAQD,QAAMC,gBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AAwBJ,WAAOH,OAAMF,QAAM;AAAA,MACjB,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,YAAI,MAAM,WAAW,GAAG,CAAC;AACzB,eAAOG,QAAO,WAAW,UAAU,MAAMC,QAAO,GAAG;AAAA,MACrD;AAAA,MACA,wBAAwB;AAAA;AAAA,IAE1B,CAAC;AASD,aAAS,eAAe,GAAG,GAAG;AAE5B,UAEA;AACA,UAEA;AACA,UAEA;AACA,UAAI,OAAO,IAAIC,WAAU,CAAC;AAC1B,UAAI,MAAM,IAAIA,WAAU,CAAC;AACzB,UAAI,IAAI;AACR,UAAI,QAAQ;AACZ,UAAI,IAAI;AACR,UAAI,QAAQ;AACZ,UAAI,CAAC,EAAE,MAAM,KAAK,CAAC,EAAE,MAAM,GAAG;AAC5B,cAAM,IAAI,MAAM,qDAAqD;AAAA,MACvE;AACA,aAAO,CAAC,EAAE,OAAO,GAAG;AAClB,YAAI,EAAE,IAAI,CAAC,EAAE,MAAM;AACnB,YAAI,EAAE,IAAI,CAAC;AACX,YAAI;AACJ,YAAI,MAAM,MAAM,EAAE,MAAM,CAAC,CAAC;AAC1B,gBAAQ;AACR,YAAI;AACJ,YAAI,MAAM,MAAM,EAAE,MAAM,CAAC,CAAC;AAC1B,gBAAQ;AACR,YAAI;AACJ,YAAI;AAAA,MACN;AACA,UAAI;AACJ,UAAI,EAAE,GAAG,IAAI,GAAG;AACd,cAAM,CAAC,EAAE,IAAI,GAAG,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC;AAAA,MAC1C,OAAO;AACL,cAAM,CAAC,GAAG,CAAC,EAAE,OAAO,IAAI,QAAQ,GAAG,KAAK;AAAA,MAC1C;AACA,aAAOF,QAAO,WAAW,UAAU,MAAMC,QAAO,GAAG;AAAA,IACrD;AAAA,EACF,CAAC;;;ACzFD,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,aAAa,QAAQ,SAAS,WAAW,OAAO,OAAO,WAAW;AAClG,MAAI,eAA8B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,MAAAC;AAAA,MACA,OAAAC;AAAA,MACA,SAAAC;AAAA,MACA,KAAAC;AAAA,MACA,KAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AAwBJ,WAAOR,OAAMF,QAAM;AAAA,MACjB,kBAAkBW;AAAA,MAClB,wBAAwBA;AAAA,IAC1B,CAAC;AACD,aAASA,QAAO,GAAG,GAAG;AACpB,UAAI,CAACD,WAAU,CAAC,KAAK,CAACA,WAAU,CAAC,EAAG,OAAM,IAAI,MAAM,uDAAuD;AAC3G,UAAIF,KAAI,GAAG,CAAC;AACZ,UAAIF,OAAM,GAAG,CAAC,EAAG,OAAM,IAAI,MAAM,0BAA0B;AAC3D,UAAI,MAAMD,MAAK,GAAG,CAAC;AACnB,YAAM,IAAI,QAAQ;AAClB,UAAI,CAACO,MAAKC,IAAG,IAAI;AACjB,UAAI,CAACP,OAAMM,MAAKR,WAAU,CAAC,CAAC,EAAG,QAAO;AACtC,MAAAS,OAAML,KAAIK,MAAK,CAAC;AAChB,UAAIN,SAAQM,MAAKT,WAAU,CAAC,CAAC,EAAG,CAAAS,OAAMJ,KAAII,MAAK,CAAC;AAChD,aAAOA;AAAA,IACT;AAAA,EACF,CAAC;;;ACpDD,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,aAAa;AACnC,MAAI,uBAAsC,wBAAQD,QAAMC,gBAAc,UAAQ;AACnF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,aAAAC;AAAA,IACF,IAAI;AAmBJ,WAAO,SAAS,eAAe,GAAG,GAAG,UAAU;AAE7C,UAAI,UAAU,EAAE;AAChB,UAAI,SAAS,EAAE;AACf,UAAI,OAAO,EAAE;AACb,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAE7E,UAAI,UAAU,EAAE;AAChB,UAAI,SAAS,EAAE;AACf,UAAI,OAAO,EAAE;AACb,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAG7E,UAAI,MAAM,WAAW,MAAM,QAAQ;AACjC,cAAM,IAAI,eAAe,MAAM,QAAQ,MAAM,MAAM;AAAA,MACrD;AAGA,UAAI,MAAM,CAAC,MAAM,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAClD,cAAM,IAAI,WAAW,mCAAmC,QAAQ,4BAA4B,QAAQ,GAAG;AAAA,MACzG;AAGA,UAAI,OAAO,MAAM,CAAC;AAClB,UAAI,UAAU,MAAM,CAAC;AAGrB,UAAI;AAEJ,UAAI,KAAKA;AAET,UAAI,OAAO;AAEX,UAAI,KAAK;AAGT,UAAI,OAAO,QAAQ,YAAY,QAAQ,OAAO,QAAQ,SAAS;AAE7D,aAAK;AAEL,aAAKD,OAAM,KAAKC,cAAa,CAAC,IAAI,EAAE,CAAC;AAErC,eAAOD,OAAM,QAAQ,GAAG,EAAE;AAE1B,aAAKA,OAAM,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;AAAA,MACpC;AAGA,UAAI,UAAU,WAAW,UAAU,CAAC,IAAI;AACxC,UAAI,SAAS,CAAC;AACd,UAAI,OAAO,CAAC;AAGZ,UAAI,IAAI,UAAU,CAAC,IAAI;AAEvB,UAAI,IAAI,CAAC;AAGT,UAAIE,IAAG,GAAG,GAAG,IAAI;AAGjB,WAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAE5B,aAAK,CAAC,IAAI,OAAO;AAEjB,YAAI,OAAO,IAAI;AAEf,YAAI,GAAG;AAEL,eAAK,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAExD,YAAAA,KAAI,OAAO,CAAC;AAEZ,cAAEA,EAAC,IAAI;AACP,cAAEA,EAAC,IAAI,QAAQ,CAAC;AAAA,UAClB;AAAA,QACF;AAEA,aAAK,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAExD,UAAAA,KAAI,OAAO,CAAC;AAEZ,cAAI,GAAG;AAEL,gBAAI,KAAK,EAAEA,EAAC,MAAM,OAAO,EAAEA,EAAC,IAAI;AAEhC,gBAAI,KAAK,GAAG,QAAQ,CAAC,GAAG,EAAE;AAE1B,gBAAI,CAAC,GAAG,IAAI,IAAI,GAAG;AAEjB,qBAAO,KAAKA,EAAC;AAEb,sBAAQ,KAAK,EAAE;AAAA,YACjB;AAAA,UACF,OAAO;AAEL,mBAAO,KAAKA,EAAC;AAAA,UACf;AAAA,QACF;AAAA,MACF;AAEA,WAAK,OAAO,IAAI,OAAO;AAGvB,aAAO,EAAE,mBAAmB;AAAA,QAC1B,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,KAAK;AAAA,QACL,MAAM,CAAC,MAAM,OAAO;AAAA,QACpB,UAAU,QAAQ,EAAE,aAAa,QAAQ,EAAE,YAAY,KAAK;AAAA,MAC9D,CAAC;AAAA,IACH;AAAA,EACF,CAAC;;;ACxID,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,eAAe,kBAAkB,QAAQ;AACzE,MAAI,oBAAmC,wBAAQD,QAAMC,gBAAc,UAAQ;AAChF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAJ;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAF;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAF;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAF;AAAA,MACA,QAAAC;AAAA,MACA,QAAAG;AAAA,IACF,CAAC;AA4BD,WAAOJ,OAAMF,QAAM,qBAAqB;AAAA,MACtC,MAAMK;AAAA,MACN,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,CAAC;AAAA,EACJ,CAAC;;;AC5CM,WAAS,gBAAgB,GAAG,GAAG;AACpC,QAAI,EAAE,SAAS,KAAK,CAAC,EAAE,UAAU,KAAK,EAAE,SAAS,KAAK,CAAC,EAAE,UAAU,GAAG;AACpE,YAAM,IAAI,MAAM,sCAAsC;AAAA,IACxD;AACA,QAAIE,aAAY,EAAE;AAClB,QAAI,EAAE,MAAM,KAAK,EAAE,MAAM,GAAG;AAC1B,aAAO,IAAIA,WAAU,GAAG;AAAA,IAC1B;AACA,QAAI,EAAE,OAAO,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,GAAG;AACrC,aAAO;AAAA,IACT;AACA,QAAI,EAAE,OAAO,KAAK,EAAE,GAAG,EAAE,GAAG;AAC1B,aAAO;AAAA,IACT;AACA,QAAI,CAAC,EAAE,SAAS,KAAK,CAAC,EAAE,SAAS,GAAG;AAClC,UAAI,CAAC,EAAE,SAAS,KAAK,CAAC,EAAE,SAAS,GAAG;AAClC,YAAI,EAAE,WAAW,MAAM,EAAE,WAAW,GAAG;AACrC,iBAAO;AAAA,QACT;AACA,eAAO,IAAIA,WAAU,CAAC;AAAA,MACxB;AACA,UAAI,CAAC,EAAE,SAAS,GAAG;AACjB,YAAI,EAAE,WAAW,GAAG;AAClB,iBAAO;AAAA,QACT;AACA,YAAI,EAAE,WAAW,GAAG;AAClB,iBAAO,IAAIA,WAAU,CAAC;AAAA,QACxB;AACA,eAAO;AAAA,MACT;AACA,UAAI,CAAC,EAAE,SAAS,GAAG;AACjB,YAAI,EAAE,WAAW,GAAG;AAClB,iBAAO;AAAA,QACT;AACA,YAAI,EAAE,WAAW,GAAG;AAClB,iBAAO,IAAIA,WAAU,CAAC;AAAA,QACxB;AACA,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO,QAAQ,GAAG,GAAG,SAAU,GAAG,GAAG;AACnC,aAAO,IAAI;AAAA,IACb,CAAC;AAAA,EACH;AAQO,WAAS,gBAAgB,GAAG;AACjC,QAAI,EAAE,SAAS,KAAK,CAAC,EAAE,UAAU,GAAG;AAClC,YAAM,IAAI,MAAM,qCAAqC;AAAA,IACvD;AACA,QAAIA,aAAY,EAAE;AAClB,QAAI,WAAWA,WAAU;AACzB,IAAAA,WAAU,OAAO;AAAA,MACf,WAAW;AAAA,IACb,CAAC;AACD,QAAI,SAAS,EAAE,KAAK,IAAIA,WAAU,CAAC,CAAC;AACpC,WAAO,IAAI,CAAC,OAAO,KAAK;AACxB,IAAAA,WAAU,OAAO;AAAA,MACf,WAAW;AAAA,IACb,CAAC;AACD,WAAO;AAAA,EACT;AAsBO,WAAS,eAAe,GAAG,GAAG;AACnC,QAAI,EAAE,SAAS,KAAK,CAAC,EAAE,UAAU,KAAK,EAAE,SAAS,KAAK,CAAC,EAAE,UAAU,GAAG;AACpE,YAAM,IAAI,MAAM,qCAAqC;AAAA,IACvD;AACA,QAAIA,aAAY,EAAE;AAClB,QAAI,EAAE,MAAM,KAAK,EAAE,MAAM,GAAG;AAC1B,aAAO,IAAIA,WAAU,GAAG;AAAA,IAC1B;AACA,QAAI,SAAS,IAAIA,WAAU,EAAE;AAC7B,QAAI,EAAE,OAAO,KAAK,EAAE,GAAG,MAAM,KAAK,EAAE,GAAG,CAAC,GAAG;AACzC,aAAO;AAAA,IACT;AACA,QAAI,EAAE,OAAO,KAAK,EAAE,GAAG,MAAM,GAAG;AAC9B,aAAO;AAAA,IACT;AACA,QAAI,CAAC,EAAE,SAAS,KAAK,CAAC,EAAE,SAAS,GAAG;AAClC,UAAI,CAAC,EAAE,SAAS,KAAK,CAAC,EAAE,WAAW,KAAK,EAAE,WAAW,KAAK,EAAE,WAAW,KAAK,CAAC,EAAE,WAAW,KAAK,CAAC,EAAE,SAAS,GAAG;AAC5G,eAAO;AAAA,MACT;AACA,UAAI,EAAE,WAAW,KAAK,EAAE,WAAW,GAAG;AACpC,eAAO,EAAE,SAAS,IAAI,IAAI;AAAA,MAC5B;AACA,aAAO,EAAE,SAAS,IAAI,IAAI;AAAA,IAC5B;AACA,WAAO,QAAQ,GAAG,GAAG,SAAU,GAAG,GAAG;AACnC,aAAO,IAAI;AAAA,IACb,CAAC;AAAA,EACH;AASO,WAAS,QAAQ,GAAG,GAAG,MAAM;AAClC,QAAIA,aAAY,EAAE;AAClB,QAAI,OAAO;AACX,QAAI,QAAQ,EAAE,EAAE,IAAI;AACpB,QAAI,QAAQ,EAAE,EAAE,IAAI;AACpB,QAAI,OAAO;AACT,cAAQ,6BAA6B,gBAAgB,CAAC,CAAC;AACvD,eAASC,KAAI,GAAGA,KAAI,MAAM,QAAQ,EAAEA,IAAG;AACrC,cAAMA,EAAC,KAAK;AAAA,MACd;AAAA,IACF,OAAO;AACL,cAAQ,6BAA6B,CAAC;AAAA,IACxC;AACA,QAAI,OAAO;AACT,cAAQ,6BAA6B,gBAAgB,CAAC,CAAC;AACvD,eAAS,KAAK,GAAG,KAAK,MAAM,QAAQ,EAAE,IAAI;AACxC,cAAM,EAAE,KAAK;AAAA,MACf;AAAA,IACF,OAAO;AACL,cAAQ,6BAA6B,CAAC;AAAA,IACxC;AACA,QAAI,SAAS,SAAS;AACtB,QAAI,MAAM,UAAU,MAAM,QAAQ;AAChC,gBAAU;AACV,gBAAU;AACV,gBAAU;AAAA,IACZ,OAAO;AACL,gBAAU;AACV,gBAAU;AACV,gBAAU;AAAA,IACZ;AACA,QAAI,WAAW,QAAQ;AACvB,QAAI,UAAU,QAAQ;AACtB,QAAI,aAAa,KAAK,OAAO,KAAK,IAAI;AACtC,QAAI,SAAS,IAAID,WAAU,aAAa,CAAC;AACzC,QAAI,WAAW,IAAIA,WAAU,CAAC;AAC9B,QAAI,MAAM,IAAIA,WAAU,CAAC;AACzB,QAAI,WAAWA,WAAU;AACzB,IAAAA,WAAU,OAAO;AAAA,MACf,WAAW;AAAA,IACb,CAAC;AACD,WAAO,WAAW,GAAG;AACnB,UAAI,KAAK,QAAQ,EAAE,QAAQ,GAAG,QAAQ,EAAE,OAAO,CAAC,MAAM,YAAY;AAChE,iBAAS,OAAO,KAAK,QAAQ;AAAA,MAC/B;AACA,iBAAW,SAAS,MAAM,GAAG;AAAA,IAC/B;AACA,WAAO,UAAU,GAAG;AAClB,UAAI,KAAK,SAAS,QAAQ,EAAE,OAAO,CAAC,MAAM,YAAY;AACpD,iBAAS,OAAO,KAAK,QAAQ;AAAA,MAC/B;AACA,iBAAW,SAAS,MAAM,GAAG;AAAA,IAC/B;AACA,IAAAA,WAAU,OAAO;AAAA,MACf,WAAW;AAAA,IACb,CAAC;AACD,QAAI,eAAe,GAAG;AACpB,aAAO,IAAI,CAAC,OAAO;AAAA,IACrB;AACA,WAAO;AAAA,EACT;AAGA,WAAS,6BAA6B,GAAG;AAEvC,QAAI,IAAI,EAAE;AACV,QAAI,IAAI,EAAE,CAAC,IAAI;AACf,aAASC,KAAI,GAAGA,KAAI,EAAE,QAAQ,EAAEA,IAAG;AACjC,UAAI,IAAI,EAAEA,EAAC,IAAI;AACf,eAAS,IAAI,IAAI,EAAE,QAAQ,OAAM;AAC/B,YAAI,MAAM;AAAA,MACZ;AACA,WAAK;AAAA,IACP;AACA,QAAI,IAAI,EAAE;AACV,WAAO,EAAE,OAAO,CAAC,MAAM,KAAK;AAC1B;AAAA,IACF;AACA,QAAI,KAAK,EAAE;AACX,QAAI,MAAM,EAAE,MAAM,GAAG,IAAI,KAAK,CAAC;AAC/B,QAAI,OAAO,IAAI;AACf,QAAI,KAAK,GAAG;AACV,UAAI,EAAE,KAAK,MAAM;AAEf,cAAM;AACN,eAAO,MAAM;AACX,iBAAO;AAAA,QACT;AAAA,MACF,WAAW,KAAK,MAAM;AACpB,cAAM,IAAI,MAAM,GAAG,EAAE,IAAI,MAAM,IAAI,MAAM,EAAE;AAAA,MAC7C;AAAA,IACF;AAGA,QAAI,MAAM,CAAC,CAAC;AACZ,aAAS,MAAM,GAAG,MAAM,IAAI,UAAS;AACnC,UAAI,OAAO,IAAI;AACf,aAAO,QAAQ;AACb,YAAI,IAAI,KAAK;AAAA,MACf;AACA,UAAI,CAAC,KAAK,SAAS,IAAI,OAAO,KAAK,CAAC;AACpC,eAAS,KAAK,GAAG,KAAK,IAAI,QAAQ,EAAE,IAAI;AACtC,YAAI,IAAI,EAAE,IAAI,GAAG;AACf,cAAI,IAAI,KAAK,CAAC,MAAM,QAAQ,IAAI,KAAK,CAAC,MAAM,QAAW;AACrD,gBAAI,KAAK,CAAC,IAAI;AAAA,UAChB;AACA,cAAI,KAAK,CAAC,KAAK,IAAI,EAAE,KAAK;AAC1B,cAAI,EAAE,KAAK;AAAA,QACb;AAAA,MACF;AAAA,IACF;AACA,WAAO,IAAI,QAAQ;AAAA,EACrB;AAqBO,WAAS,OAAO,GAAG,GAAG;AAC3B,QAAI,EAAE,SAAS,KAAK,CAAC,EAAE,UAAU,KAAK,EAAE,SAAS,KAAK,CAAC,EAAE,UAAU,GAAG;AACpE,YAAM,IAAI,MAAM,sCAAsC;AAAA,IACxD;AACA,QAAID,aAAY,EAAE;AAClB,QAAI,EAAE,MAAM,KAAK,EAAE,MAAM,GAAG;AAC1B,aAAO,IAAIA,WAAU,GAAG;AAAA,IAC1B;AACA,QAAI,EAAE,OAAO,GAAG;AACd,aAAO;AAAA,IACT;AACA,QAAI,EAAE,OAAO,GAAG;AACd,aAAO;AAAA,IACT;AACA,QAAI,EAAE,GAAG,CAAC,GAAG;AACX,aAAO,IAAIA,WAAU,CAAC;AAAA,IACxB;AACA,QAAI,SAAS,IAAIA,WAAU,EAAE;AAC7B,QAAI,EAAE,GAAG,MAAM,GAAG;AAChB,aAAO,gBAAgB,CAAC;AAAA,IAC1B;AACA,QAAI,EAAE,GAAG,MAAM,GAAG;AAChB,aAAO,gBAAgB,CAAC;AAAA,IAC1B;AACA,QAAI,CAAC,EAAE,SAAS,KAAK,CAAC,EAAE,SAAS,GAAG;AAClC,UAAI,CAAC,EAAE,SAAS,KAAK,CAAC,EAAE,SAAS,GAAG;AAClC,eAAO;AAAA,MACT;AACA,aAAO,IAAIA,WAAU,EAAE,WAAW,MAAM,EAAE,WAAW,IAAI,WAAW,SAAS;AAAA,IAC/E;AACA,WAAO,QAAQ,GAAG,GAAG,SAAU,GAAG,GAAG;AACnC,aAAO,IAAI;AAAA,IACb,CAAC;AAAA,EACH;AAoBO,WAAS,mBAAmB,GAAG,GAAG;AACvC,QAAI,EAAE,SAAS,KAAK,CAAC,EAAE,UAAU,KAAK,EAAE,SAAS,KAAK,CAAC,EAAE,UAAU,GAAG;AACpE,YAAM,IAAI,MAAM,yCAAyC;AAAA,IAC3D;AACA,QAAIA,aAAY,EAAE;AAClB,QAAI,EAAE,MAAM,KAAK,EAAE,MAAM,KAAK,EAAE,WAAW,KAAK,CAAC,EAAE,OAAO,GAAG;AAC3D,aAAO,IAAIA,WAAU,GAAG;AAAA,IAC1B;AACA,QAAI,EAAE,OAAO,KAAK,EAAE,OAAO,GAAG;AAC5B,aAAO;AAAA,IACT;AACA,QAAI,CAAC,EAAE,SAAS,KAAK,CAAC,EAAE,SAAS,GAAG;AAClC,aAAO,IAAIA,WAAU,GAAG;AAAA,IAC1B;AAGA,QAAI,EAAE,GAAG,EAAE,GAAG;AACZ,aAAO,EAAE,MAAM,KAAK,IAAI,GAAG,EAAE,SAAS,CAAC,IAAI,EAAE;AAAA,IAC/C;AACA,WAAO,EAAE,MAAM,IAAIA,WAAU,CAAC,EAAE,IAAI,CAAC,CAAC;AAAA,EACxC;AAqBO,WAAS,yBAAyB,GAAG,GAAG;AAC7C,QAAI,EAAE,SAAS,KAAK,CAAC,EAAE,UAAU,KAAK,EAAE,SAAS,KAAK,CAAC,EAAE,UAAU,GAAG;AACpE,YAAM,IAAI,MAAM,+CAA+C;AAAA,IACjE;AACA,QAAIA,aAAY,EAAE;AAClB,QAAI,EAAE,MAAM,KAAK,EAAE,MAAM,KAAK,EAAE,WAAW,KAAK,CAAC,EAAE,OAAO,GAAG;AAC3D,aAAO,IAAIA,WAAU,GAAG;AAAA,IAC1B;AACA,QAAI,EAAE,OAAO,KAAK,EAAE,OAAO,GAAG;AAC5B,aAAO;AAAA,IACT;AACA,QAAI,CAAC,EAAE,SAAS,GAAG;AACjB,UAAI,EAAE,WAAW,GAAG;AAClB,eAAO,IAAIA,WAAU,EAAE;AAAA,MACzB;AACA,UAAI,CAAC,EAAE,SAAS,GAAG;AACjB,eAAO,IAAIA,WAAU,GAAG;AAAA,MAC1B;AACA,aAAO,IAAIA,WAAU,CAAC;AAAA,IACxB;AAGA,QAAI,EAAE,GAAG,EAAE,GAAG;AACZ,aAAO,EAAE,IAAI,KAAK,IAAI,GAAG,EAAE,SAAS,CAAC,IAAI,EAAE,EAAE,MAAM;AAAA,IACrD;AACA,WAAO,EAAE,IAAI,IAAIA,WAAU,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,MAAM;AAAA,EAC9C;;;ACvYA,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,eAAe,QAAQ;AACvD,MAAI,eAA8B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAH;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAF;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAF;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAF;AAAA,MACA,QAAAC;AAAA,MACA,QAAAE;AAAA,IACF,CAAC;AAwBD,WAAOH,OAAMF,QAAM;AAAA,MACjB,kBAAkB;AAAA,MAClB,wBAAwB;AAAA,MACxB,kBAAkB,CAAC,GAAG,MAAM,IAAI;AAAA,IAClC,GAAG,qBAAqB;AAAA,MACtB,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,CAAC;AAAA,EACJ,CAAC;;;AC7DD,MAAIM,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,eAA8B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAuBJ,WAAOA,OAAMF,QAAM;AAAA,MACjB,QAAQ;AAAA,MACR,WAAW;AAAA,MACX,QAAQ,OAAK,CAAC;AAAA,MACd,kBAAkBE,OAAM,YAAY,CAAAC,UAAQ,OAAKC,SAAQ,GAAGD,KAAI,CAAC;AAAA,IACnE,CAAC;AAAA,EACH,CAAC;;;AC/BD,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,eAAe,eAAe,QAAQ;AACtE,MAAI,cAA6B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAJ;AAAA,IACF,CAAC;AACD,QAAI,mBAAmB,uBAAuB;AAAA,MAC5C,OAAAA;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAF;AAAA,MACA,aAAAG;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAH;AAAA,MACA,QAAAC;AAAA,MACA,QAAAG;AAAA,IACF,CAAC;AAyBD,WAAOJ,OAAMF,QAAM;AAAA,MACjB,kBAAkB;AAAA,MAClB,wBAAwB;AAAA,MACxB,kBAAkB,CAAC,GAAG,MAAM,IAAI;AAAA,IAClC,GAAG,qBAAqB;AAAA,MACtB,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,CAAC;AAAA,EACJ,CAAC;;;AChED,MAAIO,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,cAAc;AACpC,MAAI,sBAAqC,wBAAQD,QAAMC,gBAAc,UAAQ;AAClF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,cAAAC;AAAA,IACF,IAAI;AAeJ,WAAO,SAAS,cAAc,GAAG,GAAG,UAAU;AAE5C,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAC7E,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAG7E,UAAI,MAAM,WAAW,MAAM,QAAQ;AACjC,cAAM,IAAI,eAAe,MAAM,QAAQ,MAAM,MAAM;AAAA,MACrD;AACA,UAAI,MAAM,CAAC,MAAM,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAClD,cAAM,IAAI,WAAW,mCAAmC,QAAQ,4BAA4B,QAAQ,GAAG;AAAA,MACzG;AAGA,UAAI,OAAO,MAAM,CAAC;AAClB,UAAI,UAAU,MAAM,CAAC;AAGrB,UAAI;AACJ,UAAI,OAAO;AACX,UAAI,KAAK;AAGT,UAAI,OAAO,QAAQ,YAAY,QAAQ,OAAO,QAAQ,SAAS;AAC7D,aAAK;AACL,eAAOD,OAAM,QAAQ,GAAG,EAAE;AAC1B,aAAKA,OAAM,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;AAAA,MACpC;AAGA,UAAI,UAAU,CAAC;AACf,UAAI,SAAS,CAAC;AACd,UAAI,OAAO,IAAI,MAAM,UAAU,CAAC,EAAE,KAAK,CAAC;AAGxC,UAAI,KAAK,CAAC;AACV,UAAI,KAAK,CAAC;AACV,UAAI,KAAK,CAAC;AACV,UAAI,KAAK,CAAC;AAGV,eAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,YAAI,OAAO,IAAI;AACf,YAAI,eAAe;AACnB,iBAAS,GAAG,GAAG,IAAI,IAAI,IAAI;AAC3B,iBAAS,GAAG,GAAG,IAAI,IAAI,IAAI;AAG3B,iBAASE,KAAI,GAAGA,KAAI,MAAMA,MAAK;AAC7B,cAAI,KAAK,GAAGA,EAAC,MAAM,OAAO,GAAGA,EAAC,IAAI;AAClC,cAAI,KAAK,GAAGA,EAAC,MAAM,OAAO,GAAGA,EAAC,IAAI;AAGlC,cAAI,MAAM,GAAG,IAAI,EAAE;AAEnB,cAAI,QAAQ,KAAK,QAAQ,OAAO;AAC9B,mBAAO,KAAKA,EAAC;AACb,oBAAQ,KAAK,GAAG;AAChB;AAAA,UACF;AAAA,QACF;AAGA,aAAK,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI;AAAA,MAC1B;AAGA,aAAO,IAAID,cAAa;AAAA,QACtB,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,KAAK;AAAA,QACL,MAAM,CAAC,MAAM,OAAO;AAAA,QACpB,UAAU,QAAQ,EAAE,aAAa,QAAQ,EAAE,YAAY,KAAK;AAAA,MAC9D,CAAC;AAAA,IACH;AACA,aAAS,SAAS,GAAG,GAAG,GAAG,GAAG,MAAM;AAElC,UAAI,SAAS,EAAE;AACf,UAAIE,SAAQ,EAAE;AACd,UAAI,MAAM,EAAE;AAEZ,eAAS,IAAI,IAAI,CAAC,GAAG,KAAK,IAAI,IAAI,CAAC,GAAG,IAAI,IAAI,KAAK;AAEjD,YAAID,KAAIC,OAAM,CAAC;AAEf,UAAED,EAAC,IAAI;AACP,UAAEA,EAAC,IAAI,OAAO,CAAC;AAAA,MACjB;AAAA,IACF;AAAA,EACF,CAAC;;;AC3GD,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,eAAe,UAAU,cAAc;AACvE,MAAI,eAA8B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,MACA,cAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAJ;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAA;AAAA,MACA,cAAAI;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAJ;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAF;AAAA,MACA,QAAAC;AAAA,MACA,QAAAE;AAAA,IACF,CAAC;AAwBD,WAAOH,OAAMF,QAAM;AAAA,MACjB,kBAAkB;AAAA,MAClB,wBAAwB;AAAA,MACxB,kBAAkB,CAAC,GAAG,MAAM,IAAI;AAAA,IAClC,GAAG,qBAAqB;AAAA,MACtB,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,CAAC;AAAA,EACJ,CAAC;;;AC/DD,MAAIO,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,YAA2B,wBAAQD,QAAMC,gBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AA4BJ,WAAOA,OAAMF,QAAM;AAAA,MACjB,QAAQ,SAASG,QAAO,GAAG;AACzB,eAAO,KAAK,MAAM,GAAG,CAAC;AAAA,MACxB;AAAA,MACA,WAAW,SAASC,WAAU,GAAG;AAC/B,eAAO,EAAE,YAAY,MAAM,GAAG,CAAC;AAAA,MACjC;AAAA,MACA,SAAS,SAASC,SAAQ,GAAG;AAC3B,eAAO,EAAE,IAAI;AAAA,MACf;AAAA;AAAA,MAGA,kBAAkBH,OAAM,YAAY,CAAAI,UAAQ,OAAKC,SAAQ,GAAGD,KAAI,CAAC;AAAA,IACnE,CAAC;AAAA,EACH,CAAC;;;AC/CD,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,aAA4B,wBAAQD,QAAMC,gBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AA0BJ,WAAOA,OAAMF,QAAM;AAAA,MACjB,iCAAiC,OAAK;AAAA,MACtC,SAAS,OAAK,EAAE,UAAU;AAAA,MAC1B,MAAME,OAAM,YAAY,CAAAC,UAAQ,OAAK,IAAI,EAAE,YAAYA,MAAK,EAAE,UAAU,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;AAAA,MAC5F,kBAAkBD,OAAM,YAAY,CAAAC,UAAQ,OAAKC,SAAQ,GAAGD,KAAI,CAAC;AAAA,IACnE,CAAC;AAAA,EACH,CAAC;;;ACrCD,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,WAA0B,wBAAQD,QAAMC,gBAAc,UAAQ;AACvE,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AA4BJ,WAAOA,OAAMF,QAAM;AAAA,MACjB,QAAQ,MAAM;AAAA,MACd,wBAAwB,OAAK,EAAE,IAAI,CAAC;AAAA,MACpC,SAAS,OAAK,EAAE;AAAA,MAChB,kBAAkBE,OAAM,YAAY,CAAAC,UAAQ,OAAKC,SAAQ,GAAGD,KAAI,CAAC;AAAA,IACnE,CAAC;AAAA,EACH,CAAC;;;ACvCD,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,WAA0B,wBAAQD,QAAMC,gBAAc,UAAQ;AACvE,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AA4BJ,WAAOA,OAAMF,QAAM;AAAA,MACjB,iCAAiC,OAAK;AAAA,MACtC,SAAS,OAAK,EAAE;AAAA,MAChB,kBAAkBE,OAAM,YAAY,CAAAC,UAAQ,OAAKC,SAAQ,GAAGD,KAAI,CAAC;AAAA,IACnE,CAAC;AAAA,EACH,CAAC;;;ACrCD,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,YAA2B,wBAAQD,QAAMC,gBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AA0BJ,WAAOA,OAAMF,QAAM;AAAA,MACjB,oBAAoB,MAAM;AAAA,MAC1B,QAAQ;AAAA,MACR,SAAS,SAASG,SAAQ,GAAG;AAC3B,eAAO,EAAE,OAAO,KAAK,EAAE,OAAO;AAAA,MAChC;AAAA,MACA,WAAW,SAASC,WAAU,GAAG;AAC/B,eAAO,EAAE,OAAO,KAAK,EAAE,MAAM;AAAA,MAC/B;AAAA,MACA,QAAQ,OAAK,CAAC;AAAA,MACd,MAAMF,OAAM,YAAY,CAAAG,UAAQ,OAAKH,OAAM,KAAKG,OAAM,EAAE,UAAU,CAAC,EAAE,EAAE,KAAK,CAAC;AAAA,MAC7E,kBAAkBH,OAAM,YAAY,CAAAG,UAAQ,OAAKC,SAAQ,GAAGD,KAAI,CAAC;AAAA,IACnE,CAAC;AAAA,EACH,CAAC;;;AC1CD,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,QAAQ,WAAW,WAAW;AAC9D,MAAI,gBAA+B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC5E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,MAAAC;AAAA,MACA,SAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAJ;AAAA,IACF,CAAC;AACD,QAAI,eAAe,mBAAmB;AAAA,MACpC,OAAAA;AAAA,IACF,CAAC;AACD,QAAI,eAAe,mBAAmB;AAAA,MACpC,OAAAA;AAAA,IACF,CAAC;AAkCD,WAAOA,OAAMF,QAAM;AAAA;AAAA,MAEjB,kFAAkF,CAAC,GAAG,OAAO;AAAA,MAC7F,aAAa,CAAC,IAAI,MAAM;AAAA,MACxB,kBAAkB,CAAC,IAAI,MAAM;AAAA;AAAA,MAE7B,gCAAgC,CAAC,GAAG,MAAM;AACxC,YAAI,KAAKI,MAAK,CAAC;AACf,YAAI,KAAKA,MAAK,CAAC;AACf,YAAIE,WAAU,IAAI,EAAE,EAAG,QAAO;AAC9B,cAAM,IAAI,eAAe,IAAI,EAAE;AAAA,MACjC;AAAA;AAAA,MAEA,4BAA4BJ,OAAM,YAAY,CAAAK,UAAQ,CAAC,GAAG,MAAM,aAAa,GAAG,GAAGA,KAAI,CAAC;AAAA,MACxF,6BAA6BL,OAAM,YAAY,CAAAK,UAAQ,CAAC,GAAG,MAAM,cAAc,GAAG,GAAGA,OAAM,KAAK,CAAC;AAAA,MACjG,sBAAsBL,OAAM,YAAY,CAAAK,UAAQ,CAAC,GAAG,MAAM,aAAa,GAAGJ,QAAO,CAAC,GAAGI,KAAI,CAAC;AAAA,MAC1F,oBAAoBL,OAAM,YAAY,CAAAK,UAAQ,CAAC,GAAG,MAAM,aAAa,GAAG,GAAGA,OAAM,KAAK,CAAC;AAAA;AAAA,MAEvF,gBAAgBL,OAAM,YAAY,CAAAK,UAAQ,CAAC,GAAG,MAAM,aAAaJ,QAAO,CAAC,GAAGA,QAAO,CAAC,GAAGI,KAAI,EAAE,QAAQ,CAAC;AAAA,MACtG,sBAAsBL,OAAM,YAAY,CAAAK,UAAQ,CAAC,GAAG,MAAM,aAAaJ,QAAO,CAAC,GAAG,GAAGI,KAAI,CAAC;AAAA,MAC1F,uBAAuBL,OAAM,YAAY,CAAAK,UAAQ,CAAC,GAAG,MAAM,cAAcJ,QAAO,CAAC,GAAG,GAAGI,OAAM,KAAK,CAAC;AAAA,MACnG,cAAcL,OAAM,YAAY,CAAAK,UAAQ,CAAC,GAAG,MAAM,aAAaJ,QAAO,CAAC,GAAG,GAAGI,OAAM,KAAK,EAAE,QAAQ,CAAC;AAAA,IACrG,CAAC;AAAA,EACH,CAAC;;;AC1ED,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,eAAe,eAAe,QAAQ;AACtE,MAAI,WAA0B,wBAAQD,QAAMC,gBAAc,UAAQ;AACvE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAJ;AAAA,IACF,CAAC;AACD,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAA;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAF;AAAA,MACA,aAAAG;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAH;AAAA,MACA,QAAAC;AAAA,MACA,QAAAG;AAAA,IACF,CAAC;AA8BD,WAAOJ,OAAMF,QAAM;AAAA,MACjB,kBAAkB;AAAA,MAClB,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,eAAO,EAAE,OAAO,KAAK,EAAE,OAAO,KAAK,EAAE,OAAO,KAAK,EAAE,OAAO;AAAA,MAC5D;AAAA,MACA,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,eAAO,CAAC,EAAE,OAAO,KAAK,CAAC,EAAE,MAAM,KAAK,CAAC,EAAE,OAAO,KAAK,CAAC,EAAE,MAAM;AAAA,MAC9D;AAAA,MACA,kBAAkB;AAAA,MAClB,cAAcE,OAAM,YAAY,CAAAK,UAAQ,CAAC,GAAG,MAAMA,MAAK,EAAE,SAAS,GAAG,EAAE,SAAS,CAAC,CAAC;AAAA,IACpF,GAAG,qBAAqB;AAAA,MACtB,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,CAAC;AAAA,EACJ,CAAC;;;ACtED,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,eAAe,UAAU,cAAc;AACvE,MAAI,YAA2B,wBAAQD,QAAMC,gBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,MACA,cAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAJ;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAA;AAAA,MACA,cAAAI;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAJ;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAF;AAAA,MACA,QAAAC;AAAA,MACA,QAAAE;AAAA,IACF,CAAC;AA8BD,WAAOH,OAAMF,QAAM;AAAA,MACjB,kBAAkB;AAAA,MAClB,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,gBAAQ,EAAE,OAAO,KAAK,EAAE,OAAO,QAAQ,EAAE,OAAO,KAAK,EAAE,OAAO;AAAA,MAChE;AAAA,MACA,kBAAkB;AAAA,MAClB,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,gBAAQ,CAAC,EAAE,OAAO,KAAK,CAAC,EAAE,MAAM,QAAQ,CAAC,EAAE,OAAO,KAAK,CAAC,EAAE,MAAM;AAAA,MAClE;AAAA,MACA,cAAcE,OAAM,YAAY,CAAAK,UAAQ,CAAC,GAAG,MAAMA,MAAK,EAAE,SAAS,GAAG,EAAE,SAAS,CAAC,CAAC;AAAA,IACpF,GAAG,qBAAqB;AAAA,MACtB,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,CAAC;AAAA,EACJ,CAAC;;;ACtED,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,WAAW;AAC3C,MAAI,eAA8B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AA8BJ,WAAOF,OAAMF,QAAM;AAAA;AAAA,MAEjB,0CAA0C,SAAS,iCAAiC,MAAM;AACxF,YAAIK;AACJ,YAAI,MAAM,KAAK;AACf,YAAI,MAAM;AACV,YAAI;AACJ,YAAI,WAAW;AACf,YAAI,WAAW,CAAC;AAEhB,aAAKA,KAAI,GAAGA,KAAI,KAAKA,MAAK;AACxB,cAAIC,OAAM,KAAKD,EAAC;AAGhB,cAAI,SAASC,IAAG,GAAG;AACjB,uBAAW;AAAA,UACb;AACA,cAAI,SAASA,IAAG,KAAK,YAAYA,IAAG,GAAG;AACrC,gBAAID,OAAM,MAAM,GAAG;AACjB,oBAAM,IAAI,MAAM,8CAA8C;AAAA,YAChE;AAGA,sBAAU;AACV,kBAAMC,KAAI,QAAQ;AAElB,gBAAI,CAACF,WAAU,GAAG,GAAG;AACnB,oBAAM,IAAI,UAAU,uCAAuC;AAAA,YAC7D;AACA,gBAAI,MAAM,KAAKC,KAAI,KAAK,MAAM,SAAS;AAErC,oBAAM,IAAI,WAAW,KAAK,UAAU,CAAC;AAAA,YACvC;AAAA,UACF,OAAO;AAEL,gBAAI,IAAIE,OAAMD,IAAG,EAAE,QAAQ;AAC3B,gBAAIE,QAAO,UAAU,CAAC;AACtB,qBAASH,EAAC,IAAI;AACd,sBAAU;AACV,kBAAMG,MAAK,SAAS;AAGpB,gBAAIH,KAAI,KAAK,QAAQ,SAAS;AAC5B,oBAAM,IAAI,eAAe,UAAU,GAAG,MAAM,CAAC;AAAA,YAC/C;AAAA,UACF;AAAA,QACF;AACA,YAAI,SAAS,WAAW,GAAG;AACzB,gBAAM,IAAI,YAAY,8BAA8B;AAAA,QACtD;AACA,YAAI,MAAM,SAAS,MAAM;AACzB,eAAO,SAAS,QAAQ;AACtB,gBAAM,OAAQ,KAAK,SAAS,MAAM,GAAG,GAAG;AAAA,QAC1C;AACA,eAAO,WAAWF,QAAO,GAAG,IAAI;AAAA,MAClC;AAAA,MACA,aAAa,SAASM,QAAO,MAAM;AACjC,eAAO,KAAK,KAAK,EAAE;AAAA,MACrB;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACnGD,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,SAAS,UAAU,OAAO;AAChD,MAAI,eAA8B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,OAAAC;AAAA,IACF,IAAI;AAsBJ,WAAOH,OAAMF,QAAM;AAAA,MACjB,kBAAkB;AAAA,MAClB,iBAAiB,SAAS,aAAa,OAAOM,SAAQ;AACpD,eAAO,QAAQF,QAAOG,OAAM,KAAK,CAAC,GAAGD,OAAM,EAAE,QAAQ;AAAA,MACvD;AAAA,IACF,CAAC;AAQD,aAAS,QAAQ,OAAOA,SAAQ;AAE9B,UAAI,MAAM,KAAK,EAAE,WAAW,GAAG;AAC7B,cAAM,IAAI,MAAM,0CAA0C;AAAA,MAC5D;AACA,oBAAcA,SAAQ,MAAM,KAAK,EAAE,CAAC,CAAC;AACrC,UAAI,WAAWD,OAAM,GAAG,MAAM,KAAK,EAAE,CAAC,CAAC;AACvC,UAAIG,SAAQ,IAAIL,OAAM,UAAU,CAACG,OAAM,CAAC;AACxC,UAAI,SAAS,MAAM,OAAOE,MAAK;AAE/B,aAAO,SAAS,MAAM,IAAI,SAASJ,QAAO,CAAC,CAAC,MAAM,CAAC,CAAC;AAAA,IACtD;AAAA,EACF,CAAC;;;AC1DD,MAAIK,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,QAAQ,MAAM;AACpC,MAAI,cAA6B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,MAAAC;AAAA,MACA,MAAAC;AAAA,IACF,IAAI;AAsBJ,WAAOF,OAAMF,QAAM;AAAA,MACjB,QAAQ,SAASK,QAAO,GAAG;AACzB,eAAO,EAAE;AAAA,MACX;AAAA,MACA,kBAAkB,SAAS,cAAc,GAAG;AAC1C,eAAOD,MAAKD,MAAK,CAAC,CAAC;AAAA,MACrB;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACpCD,MAAIG,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,YAAY,UAAU;AACtD,MAAI,cAA6B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,UAAAC;AAAA,MACA,UAAAC;AAAA,IACF,IAAI;AAkCJ,WAAOH,OAAMF,QAAM;AAAA,MACjB,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,eAAOG,QAAO,OAAO,EAAE,QAAQ,GAAG,EAAE,QAAQ,CAAC,CAAC;AAAA,MAChD;AAAA,MACA,iBAAiB,SAAS,aAAa,GAAG,GAAG;AAC3C,eAAOA,QAAO,OAAO,EAAE,QAAQ,GAAG,CAAC,CAAC;AAAA,MACtC;AAAA,MACA,iBAAiB,SAAS,aAAa,GAAG,GAAG;AAC3C,eAAOA,QAAO,OAAO,GAAG,EAAE,QAAQ,CAAC,CAAC;AAAA,MACtC;AAAA,MACA,gBAAgB;AAAA,IAClB,CAAC;AASD,aAAS,OAAO,GAAG,GAAG;AACpB,UAAI,mBAAmB,KAAK,IAAI,UAAU,CAAC,EAAE,QAAQ,UAAU,CAAC,EAAE,MAAM;AACxE,UAAI,QAAQ,CAAC;AACb,UAAI,QAAQ,CAAC;AACb,UAAI,QAAQ,UAAU,CAAC;AACvB,UAAI,QAAQ,UAAU,CAAC;AACvB,UAAI,MAAM,WAAW,KAAK,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,GAAG;AAChF,cAAM,IAAI,WAAW,+CAAoD,MAAM,KAAK,IAAI,IAAI,aAAa,MAAM,KAAK,IAAI,IAAI,IAAI;AAAA,MAClI;AACA,UAAIG,WAAU,CAACF,UAASC,UAAS,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,GAAGA,UAAS,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAGD,UAASC,UAAS,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,GAAGA,UAAS,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAGD,UAASC,UAAS,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,GAAGA,UAAS,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;AAC/K,UAAI,mBAAmB,GAAG;AACxB,eAAO,CAACC,QAAO;AAAA,MACjB,OAAO;AACL,eAAOA;AAAA,MACT;AAAA,IACF;AAAA,EACF,CAAC;;;AC5ED,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,eAAe,cAAc;AAC7D,MAAI,aAA4B,wBAAQD,QAAMC,gBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,cAAAC;AAAA,IACF,IAAI;AAsCJ,WAAOH,OAAMF,QAAM;AAAA;AAAA,MAGjB,OAAO,SAASM,OAAM,GAAG;AACvB,eAAO,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,IAAI;AAAA,MACvC;AAAA,MACA,iBAAiB,SAAS,aAAa,GAAG,GAAG;AAC3C,eAAO,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,IAAI;AAAA,MACvC;AAAA,MACA,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,eAAO,MAAM,GAAG,EAAE,SAAS,GAAG,UAAU,CAAC,GAAG,IAAI;AAAA,MAClD;AAAA,MACA,iBAAiB,SAAS,aAAa,GAAGC,SAAQ;AAChD,eAAO,MAAM,GAAG,GAAG,UAAU,CAAC,GAAGA,OAAM;AAAA,MACzC;AAAA,MACA,yBAAyB,SAAS,oBAAoB,GAAG,GAAGA,SAAQ;AAClE,eAAO,MAAM,GAAG,GAAG,UAAU,CAAC,GAAGA,OAAM;AAAA,MACzC;AAAA,MACA,4BAA4B,SAAS,uBAAuB,GAAG,GAAGA,SAAQ;AACxE,eAAO,MAAM,GAAG,EAAE,SAAS,GAAG,UAAU,CAAC,GAAGA,OAAM;AAAA,MACpD;AAAA,MACA,QAAQ,SAASC,QAAO,GAAG;AACzB,eAAO,MAAM,GAAG,GAAG,EAAE,KAAK,GAAG,EAAE,QAAQ,CAAC;AAAA,MAC1C;AAAA,MACA,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,eAAO,MAAM,GAAG,GAAG,EAAE,KAAK,GAAG,EAAE,QAAQ,CAAC;AAAA,MAC1C;AAAA,MACA,qBAAqB,SAAS,iBAAiB,GAAG,GAAG;AACnD,eAAO,MAAM,GAAG,EAAE,SAAS,GAAG,EAAE,KAAK,GAAG,EAAE,QAAQ,CAAC;AAAA,MACrD;AAAA,MACA,kBAAkB,SAAS,cAAc,GAAGD,SAAQ;AAClD,eAAO,MAAM,GAAG,GAAG,EAAE,KAAK,GAAGA,OAAM;AAAA,MACrC;AAAA,MACA,0BAA0B,SAAS,qBAAqB,GAAG,GAAGA,SAAQ;AACpE,eAAO,MAAM,GAAG,GAAG,EAAE,KAAK,GAAGA,OAAM;AAAA,MACrC;AAAA,MACA,6BAA6B,SAAS,wBAAwB,GAAG,GAAGA,SAAQ;AAC1E,eAAO,MAAM,GAAG,EAAE,SAAS,GAAG,EAAE,KAAK,GAAGA,OAAM;AAAA,MAChD;AAAA,IACF,CAAC;AAWD,aAAS,MAAM,GAAG,GAAGE,OAAMF,SAAQ;AACjC,UAAI,CAAC,UAAU,CAAC,GAAG;AACjB,cAAM,IAAI,UAAU,sDAAsD;AAAA,MAC5E;AACA,UAAI,SAAS,IAAI,IAAI,IAAI;AACzB,UAAI,OAAO,IAAI,IAAI,CAAC,IAAI;AAGxB,cAAQE,MAAK,QAAQ;AAAA,QACnB,KAAK;AACH,iBAAO,sBAAsB,GAAG,GAAGF,SAAQE,MAAK,CAAC,GAAG,MAAM,MAAM;AAAA,QAClE,KAAK;AACH,iBAAO,aAAa,GAAG,GAAGF,SAAQE,OAAM,MAAM,MAAM;AAAA,MACxD;AACA,YAAM,IAAI,WAAW,gDAAgD;AAAA,IACvE;AACA,aAAS,sBAAsB,GAAG,GAAGF,SAAQ,GAAG,MAAM,QAAQ;AAE5D,UAAI,KAAK,CAAC,IAAI,MAAM,IAAI,MAAM;AAC9B,UAAIA,WAAUA,YAAW,YAAYA,YAAW,SAAS;AACvD,cAAM,IAAI,UAAU,uBAAuB,OAAOA,SAAQ,GAAI,CAAC;AAAA,MACjE;AAGA,UAAI,IAAIA,YAAW,WAAWF,cAAa,SAAS,IAAI,GAAG,CAAC,IAAID,aAAY,SAAS,IAAI,GAAG,CAAC;AAE7F,aAAOG,YAAW,OAAO,IAAI,EAAE,QAAQ;AAAA,IACzC;AACA,aAAS,aAAa,GAAG,GAAGA,SAAQ,GAAG,MAAM,QAAQ;AAEnD,UAAI,SAAS,CAAC,GAAG;AAEf,YAAI,KAAK,EAAE,SAAS,CAAC;AAErB,YAAIA,YAAW,MAAM;AAEnB,cAAIA,YAAW,GAAG,QAAQ,GAAG;AAC3B,mBAAOJ,QAAO,IAAII,OAAM;AAAA,UAC1B;AACA,iBAAO;AAAA,QACT;AACA,eAAO,GAAG,QAAQ;AAAA,MACpB;AAEA,UAAI,IAAI,KAAK,IAAI,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC,IAAI,MAAM;AAE3C,UAAI,SAAS,CAAC;AAEd,eAASG,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,eAAOA,EAAC,IAAI,EAAEA,KAAI,IAAI,EAAEA,KAAI,MAAM;AAAA,MACpC;AAEA,aAAOH,YAAW,OAAOJ,QAAO,MAAM,IAAI;AAAA,IAC5C;AAAA,EACF,CAAC;;;ACvJD,MAAIQ,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,eAA8B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAqCJ,WAAOA,OAAM,UAAU;AAAA,MACrB,mBAAmB;AAAA,MACnB,oBAAoB,SAAS,gBAAgB,GAAG,MAAM;AACpD,eAAO,EAAE,OAAO,gBAAgB,EAAE,QAAQ,GAAG,IAAI,GAAG,EAAE,SAAS,CAAC;AAAA,MAClE;AAAA,MACA,iBAAiB;AAAA,MACjB,kBAAkB,SAAS,cAAc,GAAG,MAAM;AAChD,eAAO,EAAE,OAAO,aAAa,EAAE,QAAQ,GAAG,IAAI,GAAG,EAAE,SAAS,CAAC;AAAA,MAC/D;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AASD,WAAS,gBAAgB,GAAG,UAAU;AACpC,QAAI,eAAe,iBAAiB,UAAU,GAAG,QAAQ;AACzD,QAAI,aAAa,SAAS;AACxB,aAAO,OAAO,GAAG,aAAa,EAAE;AAAA,IAClC;AACA,WAAO,OAAO,GAAG,SAAU,OAAOC,QAAO,OAAO;AAE9C,aAAO,aAAa,GAAG,OAAO,CAACA,MAAK,GAAG,KAAK;AAAA,IAC9C,CAAC;AAAA,EACH;;;ACvEA,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,gBAA+B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC5E,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAoBJ,WAAOA,OAAMF,QAAM;AAAA,MACjB,OAAO,SAASG,OAAM,GAAG;AACvB,eAAO,QAAa,CAAC;AAAA,MACvB;AAAA,MACA,aAAa,SAASC,aAAY,GAAG;AAGnC,eAAO,EAAE,OAAO,QAAa,EAAE,QAAQ,GAAG,IAAI,GAAG,EAAE,SAAS,CAAC;AAAA,MAC/D;AAAA,MACA,cAAc,SAASC,cAAa,IAAI;AACtC,cAAM,IAAI,UAAU,kKAA4K;AAAA,MAClM;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACrCD,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,gBAA+B,wBAAQD,QAAMC,gBAAc,UAAQ;AAC5E,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AA+BJ,WAAOA,OAAMF,QAAM;AAAA,MACjB,mBAAmB;AAAA,MACnB,oBAAoB,SAAS,gBAAgB,GAAG,UAAU;AACxD,UAAE,QAAQ,QAAQ;AAAA,MACpB;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AAQD,WAAS,SAAS,OAAO,UAAU;AACjC,QAAI,eAAe,iBAAiB,UAAU,OAAOA,MAAI;AACzD,gBAAY,OAAO,aAAa,IAAI,aAAa,OAAO;AAAA,EAC1D;;;ACrDA,MAAIG,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAI,0BAAyC,wBAAQD,QAAMC,gBAAc,UAAQ;AACtF,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAmCJ,WAAOA,OAAMF,QAAM;AAAA,MACjB,OAAO,SAASG,OAAM,GAAG;AACvB,eAAO,iBAAiB,GAAG,MAAM;AAAA,MACnC;AAAA,MACA,QAAQ,SAASC,QAAO,GAAG;AACzB,eAAO,EAAE,YAAY;AAAA,MACvB;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC/CD,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,UAAU,aAAa,eAAe,cAAc;AACpF,MAAI,iBAAgC,wBAAQD,QAAMC,gBAAc,UAAQ;AAC7E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,aAAAC;AAAA,MACA,cAAAC;AAAA,IACF,IAAI;AA+BJ,WAAOL,OAAMF,QAAM;AAAA,MACjB,IAAI,SAAS,IAAI;AACf,eAAOG,QAAO,WAAW,WAAWC,QAAO,CAAC,CAAC,IAAI,CAAC;AAAA,MACpD;AAAA,MACA,QAAQ,SAASI,QAAOC,SAAQ;AAC9B,eAAOL,QAAOK,OAAM;AAAA,MACtB;AAAA,MACA,sBAAsB,SAAS,kBAAkB,MAAM;AACrD,eAAO,UAAU,MAAM,MAAMN,QAAO,WAAW,WAAW,UAAU,MAAS;AAAA,MAC/E;AAAA,MACA,8BAA8B,SAAS,yBAAyB,MAAMM,SAAQ;AAC5E,eAAO,UAAU,MAAM,MAAMA,OAAM;AAAA,MACrC;AAAA,MACA,0CAA0C,SAAS,oCAAoC,MAAM,MAAM;AACjG,eAAO,UAAU,MAAM,MAAMN,QAAO,WAAW,WAAW,UAAU,MAAS;AAAA,MAC/E;AAAA,MACA,kDAAkD,SAAS,2CAA2C,MAAM,MAAMM,SAAQ;AACxH,eAAO,UAAU,MAAM,MAAMA,OAAM;AAAA,MACrC;AAAA,MACA,OAAO,SAASC,OAAMC,OAAM;AAC1B,eAAO,gBAAgBA,KAAI;AAAA,MAC7B;AAAA,MACA,iBAAiB,SAAS,aAAaA,OAAMF,SAAQ;AACnD,eAAO,gBAAgBE,OAAMF,OAAM;AAAA,MACrC;AAAA,MACA,QAAQ,SAASG,QAAOD,OAAM;AAC5B,eAAO,gBAAgBA,MAAK,QAAQ,GAAGA,MAAK,QAAQ,CAAC;AAAA,MACvD;AAAA,MACA,kBAAkB,SAAS,cAAcA,OAAMF,SAAQ;AACrD,eAAO,gBAAgBE,MAAK,QAAQ,GAAGF,OAAM;AAAA,MAC/C;AAAA,IACF,CAAC;AACD,aAAS,gBAAgBE,OAAMF,SAAQ;AACrC,cAAQE,MAAK,QAAQ;AAAA,QACnB,KAAK;AACH,iBAAOF,UAASL,QAAOK,OAAM,IAAI,CAAC;AAAA,QACpC,KAAK;AACH,iBAAO,UAAUE,MAAK,CAAC,GAAGA,MAAK,CAAC,GAAGF,OAAM;AAAA,QAC3C,KAAK;AACH,iBAAO,UAAUE,MAAK,CAAC,GAAGA,MAAK,CAAC,GAAGF,OAAM;AAAA,QAC3C;AACE,gBAAM,IAAI,MAAM,uCAAuC;AAAA,MAC3D;AAAA,IACF;AAUA,aAAS,UAAU,MAAM,MAAMA,SAAQ;AAErC,UAAI,MAAM,YAAY,IAAI,KAAK,YAAY,IAAI,IAAIJ,aAAY;AAC/D,UAAI,YAAY,IAAI,EAAG,QAAO,KAAK,SAAS;AAC5C,UAAI,YAAY,IAAI,EAAG,QAAO,KAAK,SAAS;AAC5C,UAAI,CAAC,UAAU,IAAI,KAAK,OAAO,GAAG;AAChC,cAAM,IAAI,MAAM,2DAA2D;AAAA,MAC7E;AACA,UAAI,CAAC,UAAU,IAAI,KAAK,OAAO,GAAG;AAChC,cAAM,IAAI,MAAM,2DAA2D;AAAA,MAC7E;AACA,UAAI,MAAM,MAAM,IAAIA,WAAU,CAAC,IAAI;AACnC,UAAI,eAAe,MAAM,IAAI,IAAI,CAAC,IAAI;AACtC,UAAIM,QAAO,CAAC,MAAM,IAAI;AAGtB,UAAIF,SAAQ;AAEV,YAAIA,YAAW,UAAU;AACvB,iBAAOF,cAAa,SAASI,OAAM,KAAK,GAAG,YAAY;AAAA,QACzD;AACA,YAAIF,YAAW,SAAS;AACtB,iBAAOH,aAAY,SAASK,OAAM,KAAK,GAAG,YAAY;AAAA,QACxD;AACA,cAAM,IAAI,UAAU,wBAAyB,OAAOF,SAAQ,GAAI,CAAC;AAAA,MACnE;AAGA,UAAI,MAAM,OAAO,CAAC,GAAGE,OAAM,YAAY;AAEvC,UAAI,UAAU,OAAO,OAAO,OAAO;AAEnC,eAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,YAAI,CAAC,EAAE,CAAC,IAAI;AAAA,MACd;AACA,aAAO;AAAA,IACT;AAAA,EACF,CAAC;;;ACrID,MAAIE,SAAO;AACX,MAAIC,iBAAe,CAAC,SAAS,UAAU,gBAAgB;AAChD,MAAI,aAA4B,wBAAQD,QAAMC,gBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,gBAAAC;AAAA,IACF,IAAI;AA4BJ,WAAOF,OAAMF,QAAM;AAAA,MACjB,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,eAAOG,QAAO,MAAM,EAAE,QAAQ,GAAG,EAAE,QAAQ,CAAC,CAAC;AAAA,MAC/C;AAAA,MACA,iBAAiB,SAAS,aAAa,GAAG,GAAG;AAC3C,eAAOA,QAAO,MAAM,EAAE,QAAQ,GAAG,CAAC,CAAC;AAAA,MACrC;AAAA,MACA,iBAAiB,SAAS,aAAa,GAAG,GAAG;AAC3C,eAAOA,QAAO,MAAM,GAAG,EAAE,QAAQ,CAAC,CAAC;AAAA,MACrC;AAAA,MACA,gBAAgB;AAAA,IAClB,CAAC;AAUD,aAAS,QAAQ,GAAG,GAAG;AAIrB,aAAO,EAAE,QAAQ,OAAK,EAAE,IAAI,OAAKC,gBAAe,GAAG,CAAC,CAAC,CAAC;AAAA,IACxD;AAUA,aAAS,MAAM,GAAG,GAAG;AACnB,UAAI,IAAI,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAC5E,UAAI,IAAI,GAAG;AACT,YAAI,OAAO,UAAK,CAAC,EAAE;AACnB,YAAI,OAAO,UAAK,CAAC,EAAE;AACnB,YAAI,KAAK,IAAI,MAAM,IAAI;AACvB,eAAO,SAAS,EAAG,KAAI,CAAC,CAAC;AACzB,eAAO,SAAS,EAAG,KAAI,CAAC,CAAC;AAAA,MAC3B;AACA,UAAI,MAAM,EAAG,QAAO,QAAQ,GAAG,CAAC;AAChC,aAAO,EAAE,QAAQ,YAAU,EAAE,IAAI,YAAU,MAAM,QAAQ,QAAQ,IAAI,CAAC,CAAC,CAAC;AAAA,IAC1E;AAAA,EACF,CAAC;;;AClFD,MAAIC,SAAO;AACX,MAAIC,iBAAe,CAAC,OAAO;AACpB,MAAIC,aAA2B,wBAAQF,QAAMC,gBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAE;AAAA,IACF,IAAI;AAoDJ,WAAOA,OAAMH,QAAM;AAAA,MACjB,mBAAmB;AAAA,MACnB,oBAAoB,SAAS,gBAAgB,GAAG,UAAU;AACxD,eAAO,EAAE,IAAI,QAAQ;AAAA,MACvB;AAAA,MACA,wDAAwD,CAAC,GAAG,GAAG,SAAS,aAAa,CAAC,GAAG,GAAG,GAAG,KAAK,MAAM,GAAG,KAAK,SAAS,CAAC,CAAC,GAAG,KAAK,KAAK,SAAS,CAAC,CAAC;AAAA,IACvJ,CAAC;AAaD,aAAS,aAAa,QAAQ,eAAe;AAC3C,UAAI,OAAO,kBAAkB,YAAY;AACvC,cAAM,IAAI,MAAM,2CAA2C;AAAA,MAC7D;AACA,UAAI,qBAAqB,OAAO,CAAC,EAAE;AACnC,UAAI,QAAQ,OAAO,IAAI,OAAK,EAAE,WAAW,EAAE,KAAK,IAAI,UAAU,CAAC,CAAC;AAChE,UAAI,UAAU,eAAe,GAAG,KAAK;AACrC,UAAI,iBAAiB,OAAO;AAC5B,UAAI,OAAO,qBAAqB,CAACI,SAAQ,QAAQA,QAAO,IAAI,GAAG,IAAI;AACnE,UAAI,cAAc,OAAO,IAAI,CAAC,YAAYC,OAAM;AAC9C,YAAI,aAAa,MAAMA,EAAC,EAAE,IAAI,MAAM,CAAC;AACrC,eAAO,WAAW,WAAW,WAAW,IAAI,UAAU,IAAI,IAAI,YAAY,UAAU;AAAA,MACtF,CAAC;AACD,UAAI,mBAAmBF,OAAM,gBAAgB,aAAa,IAAI,0BAA0B,eAAe,aAAa,QAAQ,IAAI,MAAM,CAAC,GAAG,MAAM,IAAI,qBAAqB,eAAe,cAAc;AACtM,UAAI,mBAAmB,GAAG;AACxB,YAAI,YAAY,oBAAoB,kBAAkB,eAAe,IAAI;AACzE,eAAO,YAAY,QAAQ,SAAS;AAAA,MACtC;AACA,UAAI,oBAAoB,qBAAqB,OAAO,IAAI,OAAK,EAAE,WAAW,EAAE,OAAO,YAAY,EAAE,QAAQ,GAAG,OAAO,GAAG,EAAE,SAAS,CAAC,IAAI,OAAO,CAAC,EAAE,OAAO,YAAY,EAAE,QAAQ,GAAG,OAAO,CAAC,CAAC,IAAI,OAAO,IAAI,OAAK,EAAE,WAAW,YAAY,EAAE,QAAQ,GAAG,OAAO,IAAI,YAAY,GAAG,OAAO,CAAC;AACrR,UAAI,WAAW,oBAAoB,kBAAkB,eAAe,iBAAiB;AACrF,UAAI,4BAA4B,CAAC,GAAG,QAAQ,SAAS,CAAC,GAAG,GAAG,kBAAkB,MAAM,CAAC,EAAE,IAAI,WAAS,KAAK,OAAO,GAAG,CAAC,CAAC,GAAG,GAAG;AAC3H,UAAI,oBAAoB;AACtB,eAAO,kBAAkB,CAAC,EAAE,IAAI,yBAAyB;AAAA,MAC3D,OAAO;AACL,eAAO,UAAU,kBAAkB,CAAC,GAAG,yBAAyB;AAAA,MAClE;AAAA,IACF;AACA,aAAS,YAAY,aAAa,UAAU;AAG1C,UAAI,kBAAkB,YAAY,CAAC;AACnC,UAAI,SAAS,YAAY,IAAI,gBAAc,WAAW,WAAW,WAAW,QAAQ,IAAI,UAAU;AAClG,UAAI,QAAQ,YAAY,IAAI,gBAAc,WAAW,WAAW,WAAW,KAAK,IAAI,UAAU,UAAU,CAAC;AACzG,UAAI,YAAY,eAAe,GAAG,KAAK;AAEvC,UAAI,UAAU,MAAM,IAAI,CAAAG,UAAQ,UAAU,SAASA,MAAK,MAAM;AAC9D,UAAI,WAAW,UAAU,SAAS;AAClC,UAAI,oBAAoB,SAAS,SAAS;AAC1C,UAAIC,SAAQ,oBAAoB,CAAC,IAAI;AACrC,UAAI,eAAe,QAAQ,QAAQ,CAAC;AACpC,UAAI,gBAAgB,UAAU;AAC5B,YAAI,gBAAgB,gBAAgB,OAAO;AAC3C,sBAAc,QAAQ;AACtB,sBAAc,QAAQ;AACtB,eAAO;AAAA,MACT,OAAO;AACL,eAAO;AAAA,MACT;AACA,eAAS,QAAQC,SAAQ;AACvB,YAAI,QAAQ,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAEhF,YAAI,uBAAuB,UAAU,KAAK;AAC1C,YAAI,SAAS,MAAM,oBAAoB;AACvC,YAAI,QAAQ,UAAU;AACpB,cAAI,QAAQ,SAASC,OAAMJ,IAAG;AAC5B,gBAAIE,OAAO,CAAAA,OAAM,KAAK,IAAIF;AAI1B,mBAAOA,EAAC,IAAI,QAAQG,QAAO,IAAI,CAAC,OAAO,eAAe,QAAQ,UAAU,IAAI,QAAQ,QAAQ,MAAM,WAAW,IAAI,MAAM,CAAC,IAAI,MAAMH,EAAC,CAAC,GAAG,QAAQ,CAAC;AAAA,UAClJ;AACA,mBAASA,KAAI,GAAGA,KAAI,sBAAsBA,MAAK;AAC7C,kBAAMA,EAAC;AAAA,UACT;AAAA,QACF,OAAO;AACL,cAAI,SAAS,SAASK,QAAOC,KAAI;AAC/B,gBAAIJ,OAAO,CAAAA,OAAM,KAAK,IAAII;AAC1B,mBAAOA,GAAE,IAAI,SAASH,QAAO,IAAI,OAAK,EAAE,WAAW,IAAI,EAAE,CAAC,IAAI,EAAEG,GAAE,CAAC,GAAGJ,SAAQA,OAAM,MAAM,IAAI,MAAS;AAAA,UACzG;AACA,mBAAS,KAAK,GAAG,KAAK,sBAAsB,MAAM;AAChD,mBAAO,EAAE;AAAA,UACX;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAAA,IACF;AASA,aAAS,oBAAoB,kBAAkB,eAAe,mBAAmB;AAC/E,cAAQ,kBAAkB;AAAA,QACxB,KAAK;AACH,iBAAO,OAAK,cAAc,GAAG,CAAC;AAAA,QAChC,KAAK;AACH,iBAAO,CAAC,GAAG,QAAQ,cAAc,GAAG,GAAG,GAAG;AAAA,QAC5C,KAAK;AACH,iBAAO,CAAC,GAAG,QAAQ,cAAc,GAAG,GAAG,KAAK,GAAG,iBAAiB;AAAA,MACpE;AAAA,IACF;AAQA,aAAS,qBAAqB,UAAU,gBAAgB;AACtD,UAAI,cAAc,SAAS,SAAS;AAEpC,UAAI,YAAY,KAAK,WAAW,EAAG,QAAO;AAG1C,UAAI,YAAY,YAAY,MAAM,SAAS;AAE3C,UAAI,SAAS,KAAK,SAAS,EAAG,QAAO;AACrC,UAAI,SAAS,SAAS,iBAAiB,GAAG;AACxC,eAAO;AAAA,MACT;AACA,UAAI,SAAS,WAAW,iBAAiB,GAAG;AAC1C,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AAWA,aAAS,0BAA0B,UAAU,QAAQ,KAAK,QAAQ;AAChE,UAAIJ,OAAM,QAAQ,UAAU,CAAC,GAAG,QAAQ,KAAK,GAAG,MAAM,CAAC,MAAM,MAAM;AACjE,eAAO;AAAA,MACT;AACA,UAAIA,OAAM,QAAQ,UAAU,CAAC,GAAG,QAAQ,GAAG,CAAC,MAAM,MAAM;AACtD,eAAO;AAAA,MACT;AACA,UAAIA,OAAM,QAAQ,UAAU,MAAM,MAAM,MAAM;AAC5C,eAAO;AAAA,MACT;AAEA,aAAO;AAAA,IACT;AAQA,aAAS,UAAU,OAAO,UAAU;AAClC,UAAI,eAAe,iBAAiB,UAAU,OAAOH,MAAI;AACzD,aAAO,QAAQ,OAAO,aAAa,IAAI,aAAa,OAAO;AAAA,IAC7D;AAAA,EACF,CAAC;;;ACpOD,MAAIY,SAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,YAAY,QAAQ;AACpD,MAAI,aAA4B,wBAAQD,QAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,UAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AA+CJ,WAAOH,OAAMF,QAAM;AAAA,MACjB,kBAAkB,SAAS,cAAc,KAAK;AAE5C,YAAI,SAAS,GAAG,GAAG;AACjB,iBAAOG,QAAO,MAAM,IAAI,QAAQ,CAAC,CAAC;AAAA,QACpC,OAAO;AACL,iBAAO,MAAM,GAAG;AAAA,QAClB;AAAA,MACF;AAAA,MACA,0BAA0B,SAAS,qBAAqB,KAAK,KAAK;AAChE,YAAI,CAAC,UAAU,GAAG,EAAG,OAAM,IAAI,WAAW,kCAAkC;AAC5E,YAAI,SAAS,GAAG,GAAG;AACjB,iBAAOA,QAAO,WAAW,IAAI,QAAQ,GAAG,GAAG,CAAC;AAAA,QAC9C,OAAO;AACL,iBAAO,WAAW,KAAK,GAAG;AAAA,QAC5B;AAAA,MACF;AAAA,MACA,oBAAoBD,OAAM,QAAQ,gBAAgB,YAAU,CAAC,KAAK,QAAQ,OAAO,KAAKG,QAAO,GAAG,CAAC,CAAC;AAAA,MAClG,qBAAqBH,OAAM,QAAQ,iBAAiB,YAAU,CAAC,KAAK,QAAQ,OAAO,KAAKG,QAAO,GAAG,CAAC,CAAC;AAAA,IACtG,CAAC;AAUD,aAAS,WAAW,KAAK,KAAK;AAC5B,UAAI,SAAS,GAAG,GAAG;AACjB,cAAM,IAAI,QAAQ;AAAA,MACpB;AACA,UAAI,CAAC,MAAM,QAAQ,GAAG,GAAG;AACvB,cAAM,WAAW,iDAAiD;AAAA,MACpE;AACA,UAAI,MAAM,GAAG;AACX,YAAI,SAAS,CAAC;AACd,YAAI,QAAQ,aAAW;AACrB,iBAAO,KAAK,WAAW,SAAS,MAAM,CAAC,CAAC;AAAA,QAC1C,CAAC;AACD,eAAO;AAAA,MACT,WAAW,QAAQ,GAAG;AACpB,eAAO,MAAM,GAAG;AAAA,MAClB,OAAO;AACL,cAAM,WAAW,gCAAgC;AAAA,MACnD;AAAA,IACF;AAQA,aAAS,MAAM,KAAK;AAClB,UAAI,SAAS,CAAC;AACd,UAAIC,QAAO,IAAI;AACf,eAASC,KAAI,GAAGA,KAAID,OAAMC,MAAK;AAC7B,eAAO,KAAK,aAAa,IAAIA,KAAI,CAAC,GAAG,IAAIA,EAAC,CAAC,CAAC;AAAA,MAC9C;AACA,aAAO;AAAA,IACT;AASA,aAAS,aAAa,MAAM,MAAM;AAEhC,UAAI,SAAS,IAAI,EAAG,QAAO,KAAK,QAAQ;AACxC,UAAI,SAAS,IAAI,EAAG,QAAO,KAAK,QAAQ;AACxC,UAAI,cAAc,MAAM,QAAQ,IAAI;AACpC,UAAI,cAAc,MAAM,QAAQ,IAAI;AACpC,UAAI,eAAe,aAAa;AAC9B,eAAO,WAAW,MAAM,IAAI;AAAA,MAC9B;AACA,UAAI,CAAC,eAAe,CAAC,aAAa;AAChC,eAAOH,UAAS,MAAM,IAAI;AAAA,MAC5B;AACA,YAAM,UAAU,6DAA6D;AAAA,IAC/E;AASA,aAAS,WAAW,MAAM,MAAM;AAC9B,UAAI,KAAK,WAAW,KAAK,QAAQ;AAC/B,cAAM,WAAW,yCAAyC;AAAA,MAC5D;AACA,UAAI,SAAS,CAAC;AACd,UAAIE,QAAO,KAAK;AAChB,eAASC,KAAI,GAAGA,KAAID,OAAMC,MAAK;AAC7B,eAAO,KAAK,aAAa,KAAKA,EAAC,GAAG,KAAKA,EAAC,CAAC,CAAC;AAAA,MAC5C;AACA,aAAO;AAAA,IACT;AAAA,EACF,CAAC;;;AC9JD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,UAAU,WAAW;AACrD,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AAmCJ,WAAOH,OAAM,QAAQ;AAAA,MACnB,IAAI,SAAS,IAAI;AACf,eAAOC,QAAO,WAAW,UAAU,MAAM,CAAC,CAAC,IAAI,MAAM,CAAC,GAAG,SAAS;AAAA,MACpE;AAAA;AAAA;AAAA,MAGA,kCAAkC,SAAS,0BAA0BG,OAAM;AACzE,YAAI,OAAOA,MAAKA,MAAK,SAAS,CAAC;AAC/B,YAAI,OAAO,SAAS,UAAU;AAC5B,cAAIC,UAASD,MAAK,IAAI;AACtB,iBAAO,MAAMA,OAAMC,OAAM;AAAA,QAC3B,WAAWJ,QAAO,WAAW,SAAS;AACpC,iBAAO,MAAMG,KAAI;AAAA,QACnB,OAAO;AACL,iBAAO,MAAMA,OAAM,SAAS;AAAA,QAC9B;AAAA,MACF;AAAA,MACA,OAAO;AAAA,MACP,QAAQ,SAASE,QAAOF,OAAM;AAC5B,YAAIC,UAASD,MAAK,QAAQ;AAC1B,eAAO,MAAMA,MAAK,QAAQ,GAAGC,OAAM;AAAA,MACrC;AAAA,MACA,0BAA0B,SAAS,qBAAqBD,OAAMC,SAAQ;AACpE,eAAO,MAAMD,MAAK,QAAQ,GAAGC,OAAM;AAAA,MACrC;AAAA,IACF,CAAC;AASD,aAAS,MAAMD,OAAMC,SAAQ;AAC3B,UAAI,gBAAgB,WAAWD,KAAI;AACnC,UAAI,eAAe,gBAAgB,IAAID,WAAU,CAAC,IAAI;AACtD,MAAAI,WAAUH,KAAI;AACd,UAAIC,SAAQ;AAEV,YAAI,IAAIH,QAAOG,OAAM;AACrB,YAAID,MAAK,SAAS,GAAG;AACnB,iBAAO,EAAE,OAAOA,OAAM,YAAY;AAAA,QACpC;AACA,eAAO;AAAA,MACT,OAAO;AAEL,YAAI,MAAM,CAAC;AACX,YAAIA,MAAK,SAAS,GAAG;AACnB,iBAAO,OAAO,KAAKA,OAAM,YAAY;AAAA,QACvC;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAGA,aAAS,WAAWA,OAAM;AACxB,UAAI,gBAAgB;AACpB,MAAAA,MAAK,QAAQ,SAAU,OAAOI,QAAO,KAAK;AACxC,YAAI,YAAY,KAAK,GAAG;AACtB,0BAAgB;AAChB,cAAIA,MAAK,IAAI,MAAM,SAAS;AAAA,QAC9B;AAAA,MACF,CAAC;AACD,aAAO;AAAA,IACT;AAGA,aAASD,WAAUH,OAAM;AACvB,MAAAA,MAAK,QAAQ,SAAU,OAAO;AAC5B,YAAI,OAAO,UAAU,YAAY,CAAC,UAAU,KAAK,KAAK,QAAQ,GAAG;AAC/D,gBAAM,IAAI,MAAM,uDAAuD;AAAA,QACzE;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF,CAAC;;;AC1HM,WAAS,cAAc;AAC5B,UAAM,IAAI,MAAM,yCAAyC;AAAA,EAC3D;AACO,WAAS,aAAa;AAC3B,UAAM,IAAI,MAAM,wCAAwC;AAAA,EAC1D;AACO,WAAS,WAAW;AACzB,UAAM,IAAI,MAAM,sCAAsC;AAAA,EACxD;;;ACNA,MAAIK,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,WAAW,cAAc,SAAS,WAAW,aAAa,UAAU,YAAY,OAAO,UAAU,YAAY;AAC7I,MAAI,cAA6B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,SAAAC;AAAA,MACA,WAAAC;AAAA,MACA,QAAAC;AAAA,MACA,UAAAC;AAAA,MACA,KAAAC;AAAA,MACA,QAAAC;AAAA,MACA,YAAAC;AAAA,IACF,IAAI;AAsDJ,WAAOV,OAAMF,SAAM;AAAA;AAAA,MAGjB,QAAQ;AAAA,MACR,mBAAmB;AAAA,MACnB,QAAQ,SAASa,QAAO,MAAM;AAC5B,cAAM,IAAI,UAAU,0CAA0C,OAAO,IAAI,CAAC;AAAA,MAC5E;AAAA,MACA,SAAS,SAASC,SAAQ,MAAM;AAC9B,cAAM,IAAI,UAAU,sDAAsD,OAAO,MAAM,oCAAoC,CAAC;AAAA,MAC9H;AAAA,MACA,kBAAkB,SAAS,cAAcC,QAAO,KAAK;AACnD,eAAO,KAAK,OAAOA,QAAO,KAAK,GAAG,KAAK,CAAC;AAAA,MAC1C;AAAA,MACA,0BAA0B,SAAS,qBAAqBA,QAAO,KAAK,MAAM;AACxE,eAAO,KAAK,OAAOA,QAAO,KAAK,MAAM,KAAK,CAAC;AAAA,MAC7C;AAAA,MACA,2BAA2B,SAAS,sBAAsBA,QAAO,KAAK,YAAY;AAChF,eAAO,KAAK,OAAOA,QAAO,KAAK,GAAG,UAAU,CAAC;AAAA,MAC/C;AAAA,MACA,mCAAmC,SAAS,6BAA6BA,QAAO,KAAK,MAAM,YAAY;AACrG,eAAO,KAAK,OAAOA,QAAO,KAAK,MAAM,UAAU,CAAC;AAAA,MAClD;AAAA;AAAA,MAEA,yBAAyB,SAAS,oBAAoBA,QAAO,KAAK;AAChE,eAAO,KAAK,OAAOA,QAAO,KAAK,IAAI,KAAK,CAAC;AAAA,MAC3C;AAAA,MACA,kBAAkB,SAAS,cAAcA,QAAO,KAAK;AACnD,eAAO,KAAK,OAAO,OAAOA,MAAK,GAAG,KAAK,IAAI,KAAK,CAAC;AAAA,MACnD;AAAA,MACA,wCAAwC,SAAS,iCAAiCA,QAAO,KAAK,MAAM;AAClG,eAAO,KAAK,OAAOA,QAAO,KAAK,OAAO,IAAI,GAAG,KAAK,CAAC;AAAA,MACrD;AAAA,MACA,iCAAiC,SAAS,2BAA2BA,QAAO,KAAK,MAAM;AACrF,eAAO,KAAK,OAAO,OAAOA,MAAK,GAAG,KAAK,OAAO,IAAI,GAAG,KAAK,CAAC;AAAA,MAC7D;AAAA,MACA,kCAAkC,SAAS,4BAA4BA,QAAO,KAAK,YAAY;AAC7F,eAAO,KAAK,OAAOA,QAAO,KAAK,IAAI,UAAU,CAAC;AAAA,MAChD;AAAA,MACA,2BAA2B,SAAS,sBAAsBA,QAAO,KAAK,YAAY;AAChF,eAAO,KAAK,OAAO,OAAOA,MAAK,GAAG,KAAK,IAAI,UAAU,CAAC;AAAA,MACxD;AAAA,MACA,iDAAiD,SAAS,yCAAyCA,QAAO,KAAK,MAAM,YAAY;AAC/H,eAAO,KAAK,OAAOA,QAAO,KAAK,OAAO,IAAI,GAAG,UAAU,CAAC;AAAA,MAC1D;AAAA,MACA,0CAA0C,SAAS,mCAAmCA,QAAO,KAAK,MAAM,YAAY;AAClH,eAAO,KAAK,OAAO,OAAOA,MAAK,GAAG,KAAK,OAAO,IAAI,GAAG,UAAU,CAAC;AAAA,MAClE;AAAA,MACA,wBAAwB,SAAS,oBAAoBA,QAAO,KAAK;AAC/D,YAAIC,aAAYD,OAAM;AACtB,eAAO,KAAK,OAAOA,QAAO,KAAK,IAAIC,WAAU,CAAC,GAAG,KAAK,CAAC;AAAA,MACzD;AAAA,MACA,mCAAmC,SAAS,8BAA8BD,QAAO,KAAK,MAAM;AAC1F,eAAO,KAAK,OAAOA,QAAO,KAAK,MAAM,KAAK,CAAC;AAAA,MAC7C;AAAA,MACA,iCAAiC,SAAS,4BAA4BA,QAAO,KAAK,YAAY;AAC5F,YAAIC,aAAYD,OAAM;AACtB,eAAO,KAAK,OAAOA,QAAO,KAAK,IAAIC,WAAU,CAAC,GAAG,UAAU,CAAC;AAAA,MAC9D;AAAA,MACA,4CAA4C,SAAS,sCAAsCD,QAAO,KAAK,MAAM,YAAY;AACvH,eAAO,KAAK,OAAOA,QAAO,KAAK,MAAM,UAAU,CAAC;AAAA,MAClD;AAAA,MACA,sBAAsB,SAAS,kBAAkBA,QAAO,KAAK;AAC3D,eAAO,KAAK,OAAOA,QAAO,KAAK,GAAG,KAAK,CAAC;AAAA,MAC1C;AAAA,MACA,gCAAgC,SAAS,2BAA2BA,QAAO,KAAK,MAAM;AACpF,eAAO,KAAK,OAAOA,QAAO,KAAK,MAAM,KAAK,CAAC;AAAA,MAC7C;AAAA,MACA,+BAA+B,SAAS,0BAA0BA,QAAO,KAAK,YAAY;AACxF,eAAO,KAAK,OAAOA,QAAO,KAAK,GAAG,UAAU,CAAC;AAAA,MAC/C;AAAA,MACA,yCAAyC,SAAS,mCAAmCA,QAAO,KAAK,MAAM,YAAY;AACjH,eAAO,KAAK,OAAOA,QAAO,KAAK,MAAM,UAAU,CAAC;AAAA,MAClD;AAAA,MACA,oBAAoB,SAAS,eAAeA,QAAO,KAAK,MAAM;AAC5D,eAAO,KAAK,OAAOA,QAAO,KAAK,MAAM,KAAK,CAAC;AAAA,MAC7C;AAAA,MACA,6BAA6B,SAAS,uBAAuBA,QAAO,KAAK,MAAM,YAAY;AACzF,eAAO,KAAK,OAAOA,QAAO,KAAK,MAAM,UAAU,CAAC;AAAA,MAClD;AAAA,IACF,CAAC;AACD,aAAS,KAAK,KAAK;AACjB,UAAIZ,QAAO,WAAW,UAAU;AAC9B,eAAOC,UAASA,QAAO,GAAG,IAAI,SAAS;AAAA,MACzC;AACA,aAAO;AAAA,IACT;AACA,aAAS,UAAU,KAAK,YAAY;AAClC,UAAI,IAAI,OAAO,GAAG;AAClB,UAAI,CAAC,GAAG;AACN,cAAM,IAAI,YAAY,aAAa,MAAM,qBAAqB;AAAA,MAChE;AACA,UAAID,QAAO,WAAW,aAAa;AACjC,YAAIE,eAAc,QAAW;AAC3B,sBAAY;AAAA,QACd;AACA,eAAO,KAAK,OAAOA,WAAU,EAAE,KAAK,GAAGA,WAAU,EAAE,GAAG,GAAGA,WAAU,EAAE,IAAI,CAAC,GAAG,UAAU;AAAA,MACzF,OAAO;AACL,eAAO,KAAK,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AAAA,MACxD;AAAA,IACF;AAWA,aAAS,OAAOU,QAAO,KAAK,MAAM,YAAY;AAC5C,UAAI,QAAQ,CAAC;AACb,UAAIJ,QAAO,IAAI,EAAG,OAAM,IAAI,MAAM,uBAAuB;AACzD,UAAI,UAAUC,YAAW,IAAI,IAAI,aAAaL,aAAYD,WAAU,aAAaG,YAAWD;AAC5F,UAAI,IAAIO;AACR,aAAO,QAAQ,GAAG,GAAG,GAAG;AACtB,cAAM,KAAK,CAAC;AACZ,YAAIL,KAAI,GAAG,IAAI;AAAA,MACjB;AACA,aAAO;AAAA,IACT;AAWA,aAAS,OAAO,KAAK;AACnB,UAAI,OAAO,IAAI,MAAM,GAAG;AAGxB,UAAI,OAAO,KAAK,IAAI,SAAUO,MAAK;AAEjC,eAAO,OAAOA,IAAG;AAAA,MACnB,CAAC;AACD,UAAI,UAAU,KAAK,KAAK,SAAU,KAAK;AACrC,eAAO,MAAM,GAAG;AAAA,MAClB,CAAC;AACD,UAAI,SAAS;AACX,eAAO;AAAA,MACT;AACA,cAAQ,KAAK,QAAQ;AAAA,QACnB,KAAK;AACH,iBAAO;AAAA,YACL,OAAO,KAAK,CAAC;AAAA,YACb,KAAK,KAAK,CAAC;AAAA,YACX,MAAM;AAAA,UACR;AAAA,QACF,KAAK;AACH,iBAAO;AAAA,YACL,OAAO,KAAK,CAAC;AAAA,YACb,KAAK,KAAK,CAAC;AAAA,YACX,MAAM,KAAK,CAAC;AAAA,UACd;AAAA,QACF;AACE,iBAAO;AAAA,MACX;AAAA,IACF;AAAA,EACF,CAAC;;;ACxOD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,aAAa,QAAQ;AAC3C,MAAI,gBAA+B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC5E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AAyCJ,WAAOD,OAAMF,SAAM;AAAA,MACjB,iBAAiB,SAAS,aAAa,GAAG,OAAO;AAC/C,eAAO,EAAE,QAAQ,OAAO,IAAI;AAAA,MAC9B;AAAA,MACA,gBAAgB,SAAS,YAAY,GAAG,OAAO;AAC7C,cAAM,QAAQ,SAAUI,OAAM;AAC5B,cAAI,CAACD,WAAUC,KAAI,GAAG;AACpB,kBAAM,IAAI,UAAU,iCAAiCA,KAAI;AAAA,UAC3D;AAAA,QACF,CAAC;AACD,eAAO,QAAa,GAAG,KAAK;AAAA,MAC9B;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACtDD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,UAAU,QAAQ;AAC/B,MAAI,eAA8B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,QAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AA4BJ,WAAO,SAASC,QAAO,GAAGC,OAAM,cAAc;AAC5C,UAAI,UAAU,WAAW,KAAK,UAAU,WAAW,GAAG;AACpD,cAAM,IAAI,eAAe,UAAU,UAAU,QAAQ,GAAG,CAAC;AAAA,MAC3D;AACA,UAAI,SAASA,KAAI,GAAG;AAClB,QAAAA,QAAOA,MAAK,QAAQ;AAAA,MACtB;AACA,UAAI,YAAYA,MAAK,CAAC,CAAC,GAAG;AAExB,QAAAA,QAAOA,MAAK,IAAI,SAAU,OAAO;AAC/B,iBAAO,CAAC,YAAY,KAAK,IAAI,QAAQ,MAAM,SAAS;AAAA,QACtD,CAAC;AAAA,MACH;AAGA,UAAI,SAAS,CAAC,GAAG;AAEf,eAAO,EAAE,OAAOA,OAAM,cAAc,IAAI;AAAA,MAC1C;AACA,UAAI,OAAO,MAAM,UAAU;AAEzB,eAAO,cAAc,GAAGA,OAAM,YAAY;AAAA,MAC5C;AAGA,UAAI,WAAW,MAAM,QAAQ,CAAC,IAAI,QAAQH,QAAO,WAAW;AAC5D,UAAIG,MAAK,WAAW,GAAG;AAErB,eAAO,MAAM,QAAQ,CAAC,GAAG;AACvB,cAAI,EAAE,CAAC;AAAA,QACT;AACA,eAAOC,OAAM,CAAC;AAAA,MAChB,OAAO;AAEL,YAAI,CAAC,MAAM,QAAQ,CAAC,GAAG;AACrB,cAAI,CAAC,CAAC;AAAA,QACR;AACA,YAAIA,OAAM,CAAC;AACX,YAAI,MAAM,OAAY,GAAGD,OAAM,YAAY;AAC3C,eAAO,WAAWF,QAAO,GAAG,IAAI;AAAA,MAClC;AAAA,IACF;AASA,aAAS,cAAc,KAAKE,OAAM,aAAa;AAC7C,UAAI,gBAAgB,QAAW;AAC7B,YAAI,OAAO,gBAAgB,YAAY,YAAY,WAAW,GAAG;AAC/D,gBAAM,IAAI,UAAU,2CAA2C;AAAA,QACjE;AAAA,MACF,OAAO;AACL,sBAAc;AAAA,MAChB;AACA,UAAIA,MAAK,WAAW,GAAG;AACrB,cAAM,IAAI,eAAeA,MAAK,QAAQ,CAAC;AAAA,MACzC;AACA,UAAI,MAAMA,MAAK,CAAC;AAChB,UAAI,OAAO,QAAQ,YAAY,CAAC,UAAU,GAAG,GAAG;AAC9C,cAAM,IAAI,UAAU,yDAA8DE,QAAOF,KAAI,IAAI,GAAG;AAAA,MACtG;AACA,UAAI,IAAI,SAAS,KAAK;AACpB,eAAO,IAAI,UAAU,GAAG,GAAG;AAAA,MAC7B,WAAW,IAAI,SAAS,KAAK;AAC3B,YAAI,MAAM;AACV,iBAASG,KAAI,GAAG,KAAK,MAAM,IAAI,QAAQA,KAAI,IAAIA,MAAK;AAClD,iBAAO;AAAA,QACT;AACA,eAAO;AAAA,MACT,OAAO;AACL,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF,CAAC;;;ACrHD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,YAAY,gBAAgB;AAClD,MAAI,eAA8B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,UAAAC;AAAA,MACA,gBAAAC;AAAA,IACF,IAAI;AA6BJ,WAAOF,OAAMF,SAAM;AAAA,MACjB,+CAA+C,SAAS,wCAAwC,GAAG,OAAO;AACxG,sBAAc,GAAG,CAAC;AAClB,YAAI,YAAYG,UAASC,gBAAe,KAAK,GAAG,CAAC;AACjD,eAAO,UAAU,QAAQ;AAAA,MAC3B;AAAA,MACA,gDAAgD,SAAS,yCAAyC,GAAG,OAAO;AAC1G,sBAAc,GAAG,CAAC;AAClB,eAAOD,UAASC,gBAAe,KAAK,GAAG,CAAC;AAAA,MAC1C;AAAA,MACA,8DAA8D,SAAS,qDAAqD,GAAG,OAAO,GAAG;AACvI,sBAAc,GAAG,CAAC;AAClB,YAAI,YAAYD,UAASC,gBAAe,OAAO,CAAC,GAAG,CAAC;AACpD,eAAO;AAAA,MACT;AAAA,MACA,+DAA+D,SAAS,sDAAsD,GAAG,OAAO,GAAG;AACzI,sBAAc,GAAG,CAAC;AAClB,eAAOD,UAASC,gBAAe,OAAO,CAAC,GAAG,CAAC;AAAA,MAC7C;AAAA,IACF,CAAC;AACD,aAAS,cAAc,GAAG,cAAc;AACtC,UAAI,aAAa,MAAM,QAAQ,CAAC,IAAI,UAAU,CAAC,IAAI,EAAE,KAAK;AAC1D,UAAI,WAAW,SAAS,GAAG;AACzB,cAAM,IAAI,WAAW,kCAAkC,OAAO,YAAY,CAAC;AAAA,MAC7E;AACA,UAAI,WAAW,WAAW,KAAK,WAAW,CAAC,MAAM,GAAG;AAClD,cAAM,IAAI,WAAW,kCAAkC,OAAO,YAAY,CAAC;AAAA,MAC7E;AACA,UAAI,WAAW,CAAC,MAAM,cAAc;AAClC,cAAM,IAAI,WAAW,kCAAkC,OAAO,YAAY,CAAC;AAAA,MAC7E;AAAA,IACF;AAAA,EACF,CAAC;;;ACpED,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,kBAAkB,aAAa,cAAc,QAAQ,UAAU,aAAa,eAAe,gBAAgB,OAAO,KAAK;AACvJ,MAAI,uBAAsC,wBAAQD,SAAMC,iBAAc,UAAQ;AACnF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,WAAAC;AAAA,MACA,YAAAC;AAAA,MACA,MAAAC;AAAA,MACA,WAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,cAAAC;AAAA,MACA,KAAAC;AAAA,MACA,KAAAC;AAAA,IACF,IAAI;AAkCJ,WAAOX,OAAMF,SAAM;AAAA,MACjB,IAAI,SAAS,IAAI;AACf,eAAOG,QAAO,WAAW,WAAWM,QAAO,CAAC,CAAC,IAAI,CAAC;AAAA,MACpD;AAAA,MACA,QAAQ,SAASK,QAAOC,SAAQ;AAC9B,eAAON,QAAOM,OAAM;AAAA,MACtB;AAAA,MACA,uCAAuC,SAAS,iCAAiC,OAAO;AACtF,eAAO,mBAAmB,OAAOZ,QAAO,WAAW,WAAW,UAAU,MAAS;AAAA,MACnF;AAAA,MACA,+CAA+C,SAAS,wCAAwC,OAAOY,SAAQ;AAC7G,eAAO,mBAAmB,OAAOA,OAAM;AAAA,MACzC;AAAA,MACA,8CAA8C,SAAS,uCAAuC,OAAO,GAAG;AACtG,YAAI,UAAUN,QAAO,CAAC;AACtB,wBAAgB,OAAO;AACvB,eAAO,mBAAmB,OAAO,SAAS,MAAS;AAAA,MACrD;AAAA,MACA,+CAA+C,SAAS,wCAAwC,OAAO,GAAG;AACxG,wBAAgB,CAAC;AACjB,YAAI,cAAc,EAAE,QAAQ,MAAMN,QAAO,WAAW,WAAW,UAAU;AACzE,eAAO,mBAAmB,OAAO,GAAG,WAAW;AAAA,MACjD;AAAA,MACA,sDAAsD,SAAS,8CAA8C,OAAO,GAAGY,SAAQ;AAC7H,YAAI,UAAUN,QAAO,CAAC;AACtB,wBAAgB,OAAO;AACvB,eAAO,mBAAmB,OAAO,SAASM,OAAM;AAAA,MAClD;AAAA,MACA,uDAAuD,SAAS,+CAA+C,OAAO,GAAGA,SAAQ;AAC/H,wBAAgB,CAAC;AACjB,eAAO,mBAAmB,OAAO,GAAGA,OAAM;AAAA,MAC5C;AAAA,IACF,CAAC;AAUD,aAAS,mBAAmB,OAAOA,SAAQ;AACzC,UAAI,MAAM,YAAY,KAAK;AAC3B,UAAI,WAAW,MAAM,IAAIP,WAAU,EAAE,IAAI;AACzC,UAAI,WAAWI,KAAI,KAAK;AACxB,UAAI,WAAWC,KAAI,KAAK;AACxB,UAAI,OAAO,CAAC,CAAC,UAAUT,gBAAe,UAAU,QAAQ,CAAC,GAAG,CAAC,UAAU,QAAQ,CAAC;AAChF,aAAO,iBAAiB,MAAMW,OAAM;AAAA,IACtC;AACA,aAAS,gBAAgB,GAAG;AAC1B,UAAIC,QAAO,EAAE,KAAK;AAClB,UAAIA,MAAK,SAAS,KAAKA,MAAK,CAAC,MAAM,GAAG;AACpC,cAAM,IAAI,WAAW,kCAAkC;AAAA,MACzD;AAAA,IACF;AACA,aAAS,KAAK,OAAO;AACnB,aAAO,MAAM,OAAO,CAAC,GAAG,SAASZ,gBAAe,GAAG,IAAI,CAAC;AAAA,IAC1D;AACA,aAAS,iBAAiB,MAAMW,SAAQ;AACtC,UAAIA,SAAQ;AACV,YAAIA,YAAW,UAAU;AACvB,iBAAO,IAAIJ,cAAa,IAAI;AAAA,QAC9B;AACA,YAAII,YAAW,SAAS;AACtB,iBAAO,IAAIL,aAAY,IAAI;AAAA,QAC7B;AACA,cAAM,IAAI,UAAU,wBAAyB,OAAOK,SAAQ,GAAI,CAAC;AAAA,MACnE;AACA,aAAO;AAAA,IACT;AAWA,aAAS,mBAAmB,OAAO,GAAGA,SAAQ;AAC5C,UAAI,QAAQR,MAAK,CAAC;AAClB,UAAI,UAAU,GAAG;AACf,cAAM,IAAI,WAAW,6BAA6B;AAAA,MACpD;AACA,UAAI,MAAM,YAAY,KAAK,IAAIC,aAAY;AAC3C,UAAI,MAAM,MAAM,IAAI,IAAI,CAAC,IAAI;AAC7B,UAAI,WAAW,MAAM,IAAI,IAAI,EAAE,IAAI;AACnC,UAAI,KAAK,MAAM,IAAI,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI;AAC1D,UAAI,KAAK,MAAM,IAAI,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI;AAC1D,UAAI,KAAK,MAAM,IAAI,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI;AAC1D,UAAI,IAAII,KAAI,KAAK;AACjB,UAAI,YAAYP,WAAU,KAAKC,YAAW,CAAC,CAAC;AAC5C,UAAI,IAAIO,KAAI,KAAK;AACjB,UAAI,MAAMR,WAAU,GAAG,KAAK,CAAC,IAAI,IAAI,SAAS,CAAC,CAAC;AAChD,UAAI,MAAMA,WAAU,KAAK,CAAC,IAAI,IAAI,SAAS,CAAC,GAAG,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC,CAAC;AACtE,UAAI,MAAMA,WAAU,KAAK,CAAC,IAAI,IAAI,SAAS,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;AAC5D,UAAI,MAAMA,WAAU,KAAK,CAAC,IAAI,IAAI,SAAS,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;AAC5D,UAAI,MAAMA,WAAU,GAAG,KAAK,CAAC,IAAI,IAAI,SAAS,CAAC,CAAC;AAChD,UAAI,MAAMA,WAAU,KAAK,CAAC,IAAI,IAAI,SAAS,CAAC,GAAG,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC,CAAC;AACtE,UAAI,MAAMA,WAAU,KAAK,CAAC,IAAI,IAAI,SAAS,CAAC,GAAG,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC,CAAC;AACtE,UAAI,MAAMA,WAAU,KAAK,CAAC,IAAI,IAAI,SAAS,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;AAC5D,UAAI,MAAMA,WAAU,GAAG,KAAK,CAAC,IAAI,IAAI,SAAS,CAAC,CAAC;AAChD,UAAI,OAAO,CAAC,CAAC,KAAK,KAAK,GAAG,GAAG,CAAC,KAAK,KAAK,GAAG,GAAG,CAAC,KAAK,KAAK,GAAG,CAAC;AAC7D,aAAO,iBAAiB,MAAMU,OAAM;AAAA,IACtC;AAAA,EACF,CAAC;;;AC3JD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,SAAS,UAAU,OAAO;AAChD,MAAI,YAA2B,wBAAQD,SAAMC,iBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,OAAAC;AAAA,IACF,IAAI;AAsBJ,WAAOH,OAAMF,SAAM;AAAA,MACjB,kBAAkB;AAAA,MAClB,iBAAiB,SAAS,aAAa,OAAOM,MAAK;AACjD,eAAO,KAAKF,QAAOG,OAAM,KAAK,CAAC,GAAGD,IAAG,EAAE,QAAQ;AAAA,MACjD;AAAA,IACF,CAAC;AAQD,aAAS,KAAK,OAAOA,MAAK;AAExB,UAAI,MAAM,KAAK,EAAE,WAAW,GAAG;AAC7B,cAAM,IAAI,MAAM,0CAA0C;AAAA,MAC5D;AACA,oBAAcA,MAAK,MAAM,KAAK,EAAE,CAAC,CAAC;AAClC,UAAI,cAAcD,OAAM,GAAG,MAAM,KAAK,EAAE,CAAC,CAAC;AAC1C,UAAIG,SAAQ,IAAIL,OAAM,CAACG,IAAG,GAAG,WAAW;AACxC,UAAI,SAAS,MAAM,OAAOE,MAAK;AAE/B,aAAO,SAAS,MAAM,IAAI,SAASJ,QAAO,CAAC,CAAC,MAAM,CAAC,CAAC;AAAA,IACtD;AAAA,EACF,CAAC;;;ACzDD,MAAIK,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO;AACpB,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AA2BJ,WAAOA,OAAMF,SAAM;AAAA,MACjB,QAAQ,OAAK,EAAE,KAAK;AAAA,MACpB,OAAO;AAAA,MACP,QAAQ,OAAK,CAAC,EAAE,MAAM;AAAA;AAAA,MAEtB,wDAAwD,QAAM,CAAC;AAAA,IACjE,CAAC;AAAA,EACH,CAAC;;;ACtCD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO;AACpB,MAAI,gBAA+B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC5E,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AA8BJ,WAAOA,OAAMF,SAAM;AAAA,MACjB,OAAO,SAASG,OAAM,GAAG;AACvB,eAAO,QAAaC,OAAM,CAAC,CAAC;AAAA,MAC9B;AAAA,MACA,QAAQ,SAASC,QAAO,GAAG;AACzB,YAAI,MAAM,QAAa,EAAE,QAAQ,CAAC;AAElC,eAAO,MAAM,QAAQ,GAAG,IAAI,EAAE,OAAO,KAAK,EAAE,SAAS,CAAC,IAAI;AAAA,MAC5D;AAAA,MACA,KAAK,SAAS,IAAI,GAAG;AAEnB,eAAOD,OAAM,CAAC;AAAA,MAChB;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC9CD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,SAAS,KAAK;AAC9C,MAAI,eAA8B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,OAAAC;AAAA,MACA,KAAAC;AAAA,IACF,IAAI;AAgDJ,WAAOH,OAAMF,SAAM;AAAA;AAAA,MAEjB,iBAAiB,SAAS,aAAa,OAAOM,QAAO;AACnD,YAAI,aAAaA,MAAK,GAAG;AACvB,iBAAOH,QAAO;AAAA,QAChB;AACA,gCAAwB,OAAOG,MAAK;AACpC,eAAO,MAAM,OAAOA,MAAK;AAAA,MAC3B;AAAA,MACA,gBAAgBJ,OAAM,QAAQ,iBAAiB,SAAU,WAAW;AAClE,eAAO,SAAU,OAAOI,QAAO;AAC7B,cAAI,eAAe,UAAUH,QAAO,KAAK,GAAGG,MAAK;AACjD,iBAAOA,OAAM,SAAS,IAAI,eAAe,aAAa,QAAQ;AAAA,QAChE;AAAA,MACF,CAAC;AAAA,MACD,iBAAiB;AAAA,MACjB,iBAAiB;AAAA;AAAA,MAEjB,2BAA2B,SAAS,qBAAqB,OAAOA,QAAO,aAAa,cAAc;AAChG,YAAI,aAAaA,MAAK,GAAG;AACvB,iBAAO;AAAA,QACT;AACA,gCAAwB,OAAOA,MAAK;AACpC,eAAO,MAAM,MAAM,EAAE,OAAOA,QAAO,sBAAsB,aAAaA,MAAK,GAAG,YAAY;AAAA,MAC5F;AAAA,MACA,0BAA0BJ,OAAM,QAAQ,2BAA2B,SAAU,WAAW;AACtF,eAAO,SAAU,OAAOI,QAAO,aAAa,cAAc;AACxD,cAAI,eAAe,UAAUH,QAAO,KAAK,GAAGG,QAAO,aAAa,YAAY;AAC5E,iBAAO,aAAa,WAAW,aAAa,QAAQ,IAAI;AAAA,QAC1D;AAAA,MACF,CAAC;AAAA,MACD,qBAAqBJ,OAAM,QAAQ,2BAA2B,SAAU,WAAW;AACjF,eAAO,SAAU,OAAOI,QAAO,aAAa;AAC1C,iBAAO,UAAUH,QAAO,KAAK,GAAGG,QAAO,aAAa,MAAS,EAAE,QAAQ;AAAA,QACzE;AAAA,MACF,CAAC;AAAA,MACD,sBAAsBJ,OAAM,QAAQ,2BAA2B,SAAU,WAAW;AAClF,eAAO,SAAU,OAAOI,QAAO,aAAa;AAC1C,iBAAO,UAAU,OAAOA,QAAO,aAAa,MAAS;AAAA,QACvD;AAAA,MACF,CAAC;AAAA,MACD,yBAAyB;AAAA,MACzB,iCAAiC;AAAA,MACjC,sBAAsB;AAAA,IACxB,CAAC;AASD,aAAS,sBAAsB,aAAaA,QAAO;AACjD,UAAI,OAAO,gBAAgB,UAAU;AACnC,cAAM,IAAI,MAAM,0BAA2B;AAAA,MAC7C;AACA,UAAIA,OAAM,SAAS,GAAG;AACpB,eAAO;AAAA,MACT;AACA,UAAI,YAAYA,OAAM,KAAK;AAC3B,UAAI,UAAU,MAAM,OAAK,IAAI,CAAC,GAAG;AAC/B,YAAI;AACF,iBAAOD,KAAI,aAAaD,OAAM,SAAS,CAAC;AAAA,QAC1C,SAASG,QAAO;AACd,iBAAO;AAAA,QACT;AAAA,MACF,OAAO;AACL,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF,CAAC;AASD,WAAS,cAAc,KAAKD,QAAO;AACjC,QAAI,CAAC,QAAQA,MAAK,GAAG;AAEnB,YAAM,IAAI,UAAU,gBAAgB;AAAA,IACtC;AACA,QAAI,aAAaA,MAAK,GAAG;AACvB,aAAO;AAAA,IACT;AACA,4BAAwB,MAAM,KAAK,GAAG,GAAGA,MAAK;AAC9C,QAAIA,OAAM,KAAK,EAAE,WAAW,GAAG;AAC7B,YAAM,IAAI,eAAeA,OAAM,KAAK,EAAE,QAAQ,CAAC;AAAA,IACjD;AAGA,QAAI,SAAS,IAAI;AACjB,kBAAcA,OAAM,IAAI,EAAE,CAAC,GAAG,MAAM;AACpC,kBAAcA,OAAM,IAAI,EAAE,CAAC,GAAG,MAAM;AACpC,QAAIE,SAAQF,OAAM,UAAU,CAAC;AAC7B,QAAI,SAAS;AACb,aAAS,SAAS,GAAG;AACnB,gBAAU,IAAI,OAAO,CAAC;AAAA,IACxB;AACA,QAAI,OAAO,UAAUE,MAAK,GAAG;AAC3B,eAASA,MAAK;AAAA,IAChB,OAAO;AACL,MAAAA,OAAM,QAAQ,QAAQ;AAAA,IACxB;AACA,WAAO;AAAA,EACT;AAYA,WAAS,cAAc,KAAKF,QAAO,aAAa,cAAc;AAC5D,QAAI,CAACA,UAASA,OAAM,YAAY,MAAM;AAEpC,YAAM,IAAI,UAAU,gBAAgB;AAAA,IACtC;AACA,QAAI,aAAaA,MAAK,GAAG;AACvB,aAAO;AAAA,IACT;AACA,4BAAwB,MAAM,KAAK,GAAG,GAAGA,MAAK;AAC9C,QAAIA,OAAM,KAAK,EAAE,WAAW,GAAG;AAC7B,YAAM,IAAI,eAAeA,OAAM,KAAK,EAAE,QAAQ,CAAC;AAAA,IACjD;AACA,QAAI,iBAAiB,QAAW;AAC9B,UAAI,OAAO,iBAAiB,YAAY,aAAa,WAAW,GAAG;AACjE,cAAM,IAAI,UAAU,2CAA2C;AAAA,MACjE;AAAA,IACF,OAAO;AACL,qBAAe;AAAA,IACjB;AACA,QAAIE,SAAQF,OAAM,UAAU,CAAC;AAC7B,QAAI,MAAM,OAAO,UAAUE,MAAK,IAAI,IAAIA,OAAM,KAAK,EAAE,CAAC;AACtD,QAAI,QAAQ,YAAY,QAAQ;AAC9B,YAAM,IAAI,eAAeA,OAAM,KAAK,EAAE,CAAC,GAAG,YAAY,MAAM;AAAA,IAC9D;AAGA,QAAI,SAAS,IAAI;AACjB,kBAAcF,OAAM,IAAI,EAAE,CAAC,CAAC;AAC5B,kBAAcA,OAAM,IAAI,EAAE,CAAC,CAAC;AAG5B,QAAI,QAAQ,CAAC;AACb,aAASG,KAAI,GAAGA,KAAI,QAAQA,MAAK;AAC/B,YAAMA,EAAC,IAAI,IAAI,OAAOA,EAAC;AAAA,IACzB;AACA,aAAS,SAAS,GAAGA,IAAG;AACtB,YAAM,CAAC,IAAI,YAAY,OAAOA,GAAE,CAAC,CAAC;AAAA,IACpC;AACA,QAAI,OAAO,UAAUD,MAAK,GAAG;AAC3B,eAASA,QAAO,CAAC,CAAC,CAAC;AAAA,IACrB,OAAO;AACL,MAAAA,OAAM,QAAQ,QAAQ;AAAA,IACxB;AAGA,QAAI,MAAM,SAAS,QAAQ;AACzB,eAAS,KAAK,SAAS,GAAG,OAAO,MAAM,QAAQ,KAAK,MAAM,MAAM;AAC9D,YAAI,CAAC,MAAM,EAAE,GAAG;AACd,gBAAM,EAAE,IAAI;AAAA,QACd;AAAA,MACF;AAAA,IACF;AACA,WAAO,MAAM,KAAK,EAAE;AAAA,EACtB;AASA,WAAS,mBAAmB,QAAQF,QAAO;AACzC,QAAI,aAAaA,MAAK,GAAG;AACvB,aAAO;AAAA,IACT;AACA,QAAIA,OAAM,KAAK,EAAE,WAAW,GAAG;AAC7B,YAAM,IAAI,eAAeA,OAAM,KAAK,GAAG,CAAC;AAAA,IAC1C;AACA,QAAI,MAAMA,OAAM,UAAU,CAAC;AAC3B,QAAI,OAAO,QAAQ,UAAU;AAC3B,YAAM,IAAI,UAAU,yDAAyD;AAAA,IAC/E;AACA,WAAO,gBAAgB,QAAQ,GAAG;AAAA,EACpC;AAUA,WAAS,mBAAmB,QAAQA,QAAO,aAAa;AACtD,QAAI,aAAaA,MAAK,GAAG;AACvB,aAAO;AAAA,IACT;AACA,QAAIA,OAAM,KAAK,EAAE,WAAW,GAAG;AAC7B,YAAM,IAAI,eAAeA,OAAM,KAAK,GAAG,CAAC;AAAA,IAC1C;AACA,QAAI,MAAMA,OAAM,UAAU,CAAC;AAC3B,QAAI,OAAO,QAAQ,UAAU;AAC3B,YAAM,IAAI,UAAU,yDAAyD;AAAA,IAC/E;AAGA,QAAI,UAAUI,OAAM,MAAM;AAC1B,oBAAgB,SAAS,KAAK,WAAW;AACzC,WAAO;AAAA,EACT;;;ACvRA,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,QAAQ;AAC9B,MAAI,kBAAiC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AAuBJ,WAAOD,OAAMF,SAAM;AAAA,MACjB,OAAO,OAAK,gBAAgBG,QAAO,CAAC,CAAC,EAAE,QAAQ;AAAA,MAC/C,QAAQ;AAAA,MACR,KAAKC;AAAA;AAAA,IACP,CAAC;AACD,aAAS,gBAAgB,GAAG;AAE1B,UAAIC,QAAO,EAAE,KAAK;AAGlB,UAAI;AAGJ,cAAQA,MAAK,QAAQ;AAAA,QACnB,KAAK;AAEH,cAAI,EAAE,MAAM;AACZ;AAAA,QACF,KAAK;AACH;AAEE,gBAAI,OAAOA,MAAK,CAAC;AACjB,gBAAI,UAAUA,MAAK,CAAC;AAGpB,gBAAI,YAAY,GAAG;AAEjB,oBAAM,IAAI,WAAW,yDAAyDC,QAAOD,KAAI,IAAI,GAAG;AAAA,YAClG;AAGA,oBAAQ,EAAE,QAAQ,GAAG;AAAA,cACnB,KAAK;AACH,oBAAI,gBAAgB,GAAG,MAAM,OAAO;AACpC;AAAA,cACF,KAAK;AACH,oBAAI,iBAAiB,GAAG,MAAM,OAAO;AACrC;AAAA,YACJ;AAAA,UACF;AACA;AAAA,QACF;AAEE,gBAAM,IAAI,WAAW,uDAAuDC,QAAOD,KAAI,IAAI,GAAG;AAAA,MAClG;AACA,aAAO;AAAA,IACT;AACA,aAAS,gBAAgB,GAAG,MAAM,SAAS;AAEzC,UAAI,OAAO,EAAE;AAEb,UAAI,aAAa,CAAC;AAClB,UAAI;AAEJ,eAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAEhC,wBAAgB,WAAW,CAAC,IAAI,CAAC;AAEjC,iBAASE,KAAI,GAAGA,KAAI,MAAMA,MAAK;AAE7B,wBAAcA,EAAC,IAAIH,OAAM,KAAKG,EAAC,EAAE,CAAC,CAAC;AAAA,QACrC;AAAA,MACF;AAEA,aAAO,EAAE,kBAAkB;AAAA,QACzB,MAAM;AAAA,QACN,MAAM,CAAC,SAAS,IAAI;AAAA,QACpB,UAAU,EAAE;AAAA,MACd,CAAC;AAAA,IACH;AACA,aAAS,iBAAiB,GAAG,MAAM,SAAS;AAE1C,UAAI,SAAS,EAAE;AACf,UAAIC,SAAQ,EAAE;AACd,UAAI,MAAM,EAAE;AAEZ,UAAI,UAAU,SAAS,CAAC,IAAI;AAC5B,UAAI,SAAS,CAAC;AACd,UAAI,OAAO,CAAC;AAEZ,UAAI,IAAI,CAAC;AACT,eAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC7B,UAAE,CAAC,IAAI;AAAA,MACT;AAEA,UAAI,GAAG,GAAG;AAEV,WAAK,IAAI,GAAG,IAAIA,OAAM,QAAQ,IAAI,GAAG,KAAK;AAExC,UAAEA,OAAM,CAAC,CAAC;AAAA,MACZ;AAEA,UAAIC,OAAM;AAEV,eAASF,KAAI,GAAGA,KAAI,MAAMA,MAAK;AAE7B,aAAK,KAAKE,IAAG;AAEb,QAAAA,QAAO,EAAEF,EAAC;AAEV,UAAEA,EAAC,IAAI,KAAKA,EAAC;AAAA,MACf;AAEA,WAAK,KAAKE,IAAG;AAEb,WAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAE5B,iBAAS,KAAK,IAAI,CAAC,GAAG,KAAK,IAAI,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAE1D,cAAI,IAAI,EAAED,OAAM,CAAC,CAAC;AAElB,iBAAO,CAAC,IAAI;AAEZ,cAAI,QAAQ;AACV,oBAAQ,CAAC,IAAIJ,OAAM,OAAO,CAAC,CAAC;AAAA,UAC9B;AAAA,QACF;AAAA,MACF;AAEA,aAAO,EAAE,mBAAmB;AAAA,QAC1B,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,KAAK;AAAA,QACL,MAAM,CAAC,SAAS,IAAI;AAAA,QACpB,UAAU,EAAE;AAAA,MACd,CAAC;AAAA,IACH;AAAA,EACF,CAAC;;;AC9JD,MAAIM,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,aAAa,MAAM;AACzC,MAAI,mBAAkC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC/E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAAC;AAAA,MACA,MAAAC;AAAA,IACF,IAAI;AAuBJ,WAAOF,OAAMF,SAAM;AAAA,MACjB,KAAK,SAAS,IAAI,GAAG;AACnB,eAAOI,MAAKD,WAAU,CAAC,CAAC;AAAA,MAC1B;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AChCD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,UAAU,WAAW;AACrD,MAAI,cAA6B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AAiCJ,WAAOH,OAAMF,SAAM;AAAA,MACjB,IAAI,SAAS,IAAI;AACf,eAAOG,QAAO,WAAW,UAAU,OAAO,CAAC,CAAC,IAAI,OAAO,CAAC,GAAG,SAAS;AAAA,MACtE;AAAA;AAAA;AAAA,MAGA,kCAAkC,SAAS,0BAA0BG,OAAM;AACzE,YAAI,OAAOA,MAAKA,MAAK,SAAS,CAAC;AAC/B,YAAI,OAAO,SAAS,UAAU;AAC5B,cAAIC,UAASD,MAAK,IAAI;AACtB,iBAAO,OAAOA,OAAMC,OAAM;AAAA,QAC5B,WAAWJ,QAAO,WAAW,SAAS;AACpC,iBAAO,OAAOG,KAAI;AAAA,QACpB,OAAO;AACL,iBAAO,OAAOA,OAAM,SAAS;AAAA,QAC/B;AAAA,MACF;AAAA,MACA,OAAO;AAAA,MACP,QAAQ,SAASE,QAAOF,OAAM;AAC5B,YAAIC,UAASD,MAAK,QAAQ;AAC1B,eAAO,OAAOA,MAAK,QAAQ,GAAGC,OAAM;AAAA,MACtC;AAAA,MACA,0BAA0B,SAAS,qBAAqBD,OAAMC,SAAQ;AACpE,eAAO,OAAOD,MAAK,QAAQ,GAAGC,OAAM;AAAA,MACtC;AAAA,IACF,CAAC;AASD,aAAS,OAAOD,OAAMC,SAAQ;AAC5B,UAAI,gBAAgB,WAAWD,KAAI;AACnC,UAAI,eAAe,gBAAgB,IAAID,WAAU,CAAC,IAAI;AACtD,MAAAI,WAAUH,KAAI;AACd,UAAIC,SAAQ;AAEV,YAAI,IAAIH,QAAOG,OAAM;AACrB,YAAID,MAAK,SAAS,GAAG;AACnB,iBAAO,EAAE,OAAOA,OAAM,YAAY;AAAA,QACpC;AACA,eAAO;AAAA,MACT,OAAO;AAEL,YAAI,MAAM,CAAC;AACX,YAAIA,MAAK,SAAS,GAAG;AACnB,iBAAO,OAAO,KAAKA,OAAM,YAAY;AAAA,QACvC;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAGA,aAAS,WAAWA,OAAM;AACxB,UAAI,gBAAgB;AACpB,MAAAA,MAAK,QAAQ,SAAU,OAAOI,QAAO,KAAK;AACxC,YAAI,YAAY,KAAK,GAAG;AACtB,0BAAgB;AAChB,cAAIA,MAAK,IAAI,MAAM,SAAS;AAAA,QAC9B;AAAA,MACF,CAAC;AACD,aAAO;AAAA,IACT;AAGA,aAASD,WAAUH,OAAM;AACvB,MAAAA,MAAK,QAAQ,SAAU,OAAO;AAC5B,YAAI,OAAO,UAAU,YAAY,CAAC,UAAU,KAAK,KAAK,QAAQ,GAAG;AAC/D,gBAAM,IAAI,MAAM,wDAAwD;AAAA,QAC1E;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF,CAAC;;;ACtHD,MAAIK,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,aAAa,kBAAkB,gBAAgB,OAAO,OAAO,KAAK,aAAa,QAAQ,OAAO,QAAQ,MAAM;AAC5I,MAAI,YAA2B,wBAAQD,SAAMC,iBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,cAAAC;AAAA,MACA,KAAAC;AAAA,MACA,KAAAC;AAAA,MACA,GAAG;AAAA,MACH,WAAAC;AAAA,MACA,MAAAC;AAAA,MACA,KAAAC;AAAA,MACA,MAAAC;AAAA,MACA,MAAAC;AAAA,IACF,IAAI;AAoBJ,WAAOX,OAAMF,SAAM;AAAA,MACjB,OAAO;AAAA,MACP,QAAQ,SAASc,QAAOX,SAAQ;AAC9B,eAAOA,QAAO,OAAO,OAAOA,QAAO,QAAQ,CAAC,GAAGA,QAAO,SAAS,CAAC;AAAA,MAClE;AAAA,IACF,CAAC;AAQD,aAAS,OAAO,KAAK;AACnB,UAAIY,QAAO,UAAU,GAAG;AACxB,UAAIA,MAAK,WAAW,EAAG,QAAO,KAAK,KAAKA,MAAK,CAAC,CAAC;AAE/C,aAAO,OAAO,IAAI,IAAI,WAAS,OAAO,OAAOA,MAAK,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC;AAAA,IACjE;AASA,aAAS,OAAO,KAAK,KAAK;AACxB,UAAIA,QAAO,UAAU,GAAG;AACxB,UAAI,QAAQ,EAAG,QAAO,IAAI,MAAMA,MAAK,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,GAAGC,OAAM,OAAO,IAAIA,EAAC,GAAG,MAAM,CAAC,CAAC;AACtF,UAAID,MAAK,WAAW,EAAG,QAAO,KAAK,GAAG;AACtC,eAAS,WAAWE,MAAK;AAEvB,YAAIF,QAAO,UAAUE,IAAG;AACxB,eAAO,IAAI,MAAMF,MAAK,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,GAAG,MAAM,IAAI,MAAMA,MAAK,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,IAAI,CAACG,IAAGF,OAAMC,KAAID,EAAC,EAAE,CAAC,CAAC,CAAC;AAAA,MACrG;AACA,aAAO,WAAW,OAAO,WAAW,GAAG,GAAG,CAAC,CAAC;AAAA,IAC9C;AAOA,aAAS,KAAK,KAAK;AACjB,UAAI,IAAI,IAAI;AACZ,UAAI,IAAIT,KAAID,cAAaD,gBAAe,IAAIA,gBAAe,GAAGG,IAAG,CAAC,GAAG,CAAC,CAAC;AACvE,UAAI,QAAQ,CAAC;AACb,eAASQ,KAAI,IAAI,GAAGA,KAAI,GAAGA,MAAK;AAC9B,cAAM,KAAKL,KAAI,GAAGL,cAAaK,KAAIK,IAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AAAA,MAC/C;AACA,UAAI,KAAKL,KAAI,GAAGC,MAAKC,MAAK,IAAI,IAAI,CAAC,CAAC,CAAC;AACrC,UAAI,KAAK,CAAC,GAAG,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,GAAGG,OAAMX,gBAAe,IAAIW,EAAC,GAAG,MAAM,IAAI,IAAIA,EAAC,CAAC,CAAC,GAAG,GAAG,IAAI,MAAM,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;AACvH,UAAI,SAAS,CAAC,GAAG,IAAI,MAAM,IAAI,IAAI,CAAC,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,GAAGA,OAAMV,cAAa,GAAG,MAAMU,EAAC,CAAC,CAAC,GAAG,GAAG,IAAI,MAAM,MAAM,IAAI,IAAI,EAAE,EAAE,KAAK,CAAC,CAAC;AAC9H,UAAI,QAAQ,KAAK,EAAE;AACnB,UAAI,YAAY,KAAK,MAAM;AAC3B,UAAI,aAAa,IAAI,MAAM,EAAE,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,GAAGA,OAAMX,gBAAe,MAAMW,EAAC,GAAG,UAAUA,EAAC,CAAC,CAAC;AAC3F,UAAI,cAAcP,WAAUC,MAAK,OAAOA,MAAK,UAAU,CAAC,CAAC,GAAG,EAAE;AAC9D,UAAI,MAAM,CAAC;AACX,eAAS,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,MAAM;AACzC,YAAI,KAAKL,gBAAe,YAAY,EAAE,GAAG,MAAM,EAAE,CAAC,CAAC;AAAA,MACrD;AACA,aAAO;AAAA,IACT;AAOA,aAAS,KAAK,KAAK;AACjB,UAAI,MAAM,IAAI;AACd,UAAI,QAAQ,EAAG,QAAO,CAAC,IAAI,CAAC,CAAC;AAC7B,UAAI,MAAM,MAAM,GAAG;AACjB,YAAI,MAAM,CAAC,GAAG,KAAK,IAAI,OAAO,CAAC,GAAGW,OAAMA,KAAI,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,GAAG,KAAK,IAAI,OAAO,CAAC,GAAGA,OAAMA,KAAI,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;AACnH,iBAAS,IAAI,GAAG,IAAI,MAAM,GAAG,KAAK;AAChC,cAAI,IAAI,IAAI,CAAC;AACb,cAAI,IAAIX,gBAAe,IAAI,IAAI,MAAM,CAAC,GAAGE,KAAIF,gBAAeA,gBAAeG,MAAK,CAAC,GAAGF,cAAa,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;AAC3G,cAAI,CAAC,IAAIF,WAAU,GAAG,CAAC;AACvB,cAAI,IAAI,MAAM,CAAC,IAAIA,WAAU,GAAGC,gBAAe,IAAI,CAAC,CAAC;AAAA,QACvD;AACA,eAAO;AAAA,MACT,OAAO;AAEL,eAAO,KAAK,GAAG;AAAA,MACjB;AAAA,IAEF;AAAA,EACF,CAAC;;;AC5HD,MAAIc,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO,aAAa,MAAM;AAChD,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,WAAAC;AAAA,MACA,MAAAC;AAAA,IACF,IAAI;AAmBJ,WAAOH,OAAMF,SAAM;AAAA,MACjB,kBAAkB,SAAS,cAAc,KAAK;AAC5C,YAAIM,QAAO,SAAS,GAAG,IAAI,IAAI,KAAK,IAAI,UAAU,GAAG;AACrD,eAAOF,WAAUC,MAAKF,KAAIE,MAAK,GAAG,CAAC,CAAC,GAAGC,MAAK,OAAO,CAAC,KAAK,SAAS,MAAM,MAAM,CAAC,CAAC;AAAA,MAClF;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACpCD,WAASC,SAAQ,GAAG;AAClB;AAEA,WAAOA,WAAU,cAAc,OAAO,UAAU,YAAY,OAAO,OAAO,WAAW,SAAUC,IAAG;AAChG,aAAO,OAAOA;AAAA,IAChB,IAAI,SAAUA,IAAG;AACf,aAAOA,MAAK,cAAc,OAAO,UAAUA,GAAE,gBAAgB,UAAUA,OAAM,OAAO,YAAY,WAAW,OAAOA;AAAA,IACpH,GAAGD,SAAQ,CAAC;AAAA,EACd;;;ACPA,WAAS,YAAY,GAAG,GAAG;AACzB,QAAI,YAAYE,SAAQ,CAAC,KAAK,CAAC,EAAG,QAAO;AACzC,QAAIC,KAAI,EAAE,OAAO,WAAW;AAC5B,QAAI,WAAWA,IAAG;AAChB,UAAIC,KAAID,GAAE,KAAK,GAAG,KAAK,SAAS;AAChC,UAAI,YAAYD,SAAQE,EAAC,EAAG,QAAOA;AACnC,YAAM,IAAI,UAAU,8CAA8C;AAAA,IACpE;AACA,YAAQ,aAAa,IAAI,SAAS,QAAQ,CAAC;AAAA,EAC7C;;;ACRA,WAAS,cAAc,GAAG;AACxB,QAAIC,KAAI,YAAY,GAAG,QAAQ;AAC/B,WAAO,YAAYC,SAAQD,EAAC,IAAIA,KAAIA,KAAI;AAAA,EAC1C;;;ACJA,WAASE,iBAAgBC,IAAG,GAAG,GAAG;AAChC,YAAQ,IAAI,cAAc,CAAC,MAAMA,KAAI,OAAO,eAAeA,IAAG,GAAG;AAAA,MAC/D,OAAO;AAAA,MACP,YAAY;AAAA,MACZ,cAAc;AAAA,MACd,UAAU;AAAA,IACZ,CAAC,IAAIA,GAAE,CAAC,IAAI,GAAGA;AAAA,EACjB;;;ACPA,WAASC,SAAQC,IAAG,GAAG;AAAE,QAAI,IAAI,OAAO,KAAKA,EAAC;AAAG,QAAI,OAAO,uBAAuB;AAAE,UAAI,IAAI,OAAO,sBAAsBA,EAAC;AAAG,YAAM,IAAI,EAAE,OAAO,SAAUC,IAAG;AAAE,eAAO,OAAO,yBAAyBD,IAAGC,EAAC,EAAE;AAAA,MAAY,CAAC,IAAI,EAAE,KAAK,MAAM,GAAG,CAAC;AAAA,IAAG;AAAE,WAAO;AAAA,EAAG;AAC9P,WAAS,cAAcD,IAAG;AAAE,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AAAE,UAAI,IAAI,QAAQ,UAAU,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC;AAAG,UAAI,IAAID,SAAQ,OAAO,CAAC,GAAG,IAAE,EAAE,QAAQ,SAAUE,IAAG;AAAE,QAAAC,iBAAgBF,IAAGC,IAAG,EAAEA,EAAC,CAAC;AAAA,MAAG,CAAC,IAAI,OAAO,4BAA4B,OAAO,iBAAiBD,IAAG,OAAO,0BAA0B,CAAC,CAAC,IAAID,SAAQ,OAAO,CAAC,CAAC,EAAE,QAAQ,SAAUE,IAAG;AAAE,eAAO,eAAeD,IAAGC,IAAG,OAAO,yBAAyB,GAAGA,EAAC,CAAC;AAAA,MAAG,CAAC;AAAA,IAAG;AAAE,WAAOD;AAAA,EAAG;AAGtb,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO,YAAY,YAAY,UAAU,OAAO,OAAO,OAAO,cAAc,cAAc,UAAU,WAAW,UAAU,aAAa,YAAY;AACxK,MAAI,iBAAgC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC7E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,UAAAC;AAAA,MACA,UAAAC;AAAA,MACA,QAAAC;AAAA,MACA,KAAAC;AAAA,MACA,KAAAC;AAAA,MACA,KAAAC;AAAA,MACA,YAAAC;AAAA,MACA,YAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,YAAAC;AAAA,IACF,IAAI;AAsDJ,aAAS,IAAI,gBAAgB;AAG3B,aAAO,SAAU,GAAG,OAAO,IAAI,SAAS;AAEtC,YAAI,aAAa,EAAE,MAAM,WAAW,MAAM,MAAM,MAAM,UAAU,KAAK,MAAM,MAAM,MAAM;AACvF,YAAI,YAAY;AACd,gBAAM,IAAI,MAAM,4EAA4E;AAAA,QAC9F;AACA,YAAI,KAAK,MAAM,CAAC;AAChB,YAAI,KAAK,MAAM,CAAC;AAChB,YAAI,aAAaJ,QAAO,IAAI,EAAE;AAC9B,YAAI,YAAY,QAAQ;AACxB,YAAI,cAAc,UAAa,CAACF,YAAW,SAAS,GAAG;AACrD,gBAAM,IAAI,MAAM,8BAA8B;AAAA,QAChD;AACA,YAAI,UAAU,QAAQ;AACtB,YAAI,YAAY,UAAa,CAACA,YAAW,OAAO,GAAG;AACjD,gBAAM,IAAI,MAAM,4BAA4B;AAAA,QAC9C;AACA,YAAI,UAAU,QAAQ;AACtB,YAAI,WAAWC,YAAW,OAAO,GAAG;AAClC,gBAAM,IAAI,MAAM,oCAAoC;AAAA,QACtD;AACA,YAAI,WAAW,CAAC,IAAI,IAAI,WAAW,SAAS,OAAO,EAAE,OAAO,OAAK,MAAM,MAAS;AAChF,YAAI,EAAE,SAAS,MAAM,UAAU,KAAK,SAAS,MAAM,MAAM,IAAI;AAC3D,gBAAM,IAAI,MAAM,8CAA8C;AAAA,QAChE;AACA,YAAI,QAAQ;AACZ,YAAI,MAAM,QAAQ,MAAM,QAAQ,MAAM;AACtC,YAAI,WAAW,QAAQ,WAAW,QAAQ,WAAW;AACrD,YAAI,WAAW,QAAQ,WAAW,QAAQ,WAAW;AACrD,YAAI,UAAU,QAAQ,UAAU,QAAQ,UAAU;AAClD,YAAI,gBAAgB,CAAC,IAAI,IAAI,GAAG,IAAI,SAAS,OAAO,EAAE,KAAK,WAAW;AACtE,YAAI,CAAC,GAAG,GAAG,GAAG,EAAE,IAAI,gBAAgB,CAACI,WAAU,eAAe,CAAC,GAAGA,WAAU,eAAe,CAAC,GAAGA,WAAU,eAAe,CAAC,GAAGA,WAAU,eAAe,EAAE,CAAC,IAAI,CAAC,eAAe,GAAG,eAAe,GAAG,eAAe,GAAG,eAAe,EAAE;AACpO,YAAI,IAAI,YAAY,aAAa,YAAYC,YAAW,SAAS,IAAIV,QAAOF,UAAS,IAAI,EAAE,GAAG,KAAK;AACnG,YAAI,IAAI,CAAC,EAAE;AACX,YAAI,IAAI,CAAC,EAAE;AAEX,YAAI,SAASA,UAAS,GAAG,EAAE;AAE3B,YAAI,IAAI;AACR,YAAI,OAAO;AACX,YAAI,UAAU,eAAe,UAAU;AACvC,YAAI,WAAW,gBAAgB,UAAU;AAEzC,eAAO,QAAQ,EAAE,CAAC,GAAG,EAAE,GAAG;AACxB,cAAI,IAAI,CAAC;AAGT,cAAI,SAAS,EAAE,CAAC,GAAG,IAAI,CAAC;AAGxB,YAAE,KAAK,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AAGpB,mBAASa,KAAI,GAAGA,KAAI,EAAE,QAAQ,EAAEA,IAAG;AACjC,cAAE,KAAK,EAAEd,KAAI,EAAE,CAAC,GAAGE,UAAS,EAAEY,EAAC,GAAG,CAAC,CAAC,GAAGd,KAAI,EAAE,CAAC,GAAGE,UAAS,GAAG,EAAEY,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAAA,UACzE;AAGA,cAAI,KAAKV,KAAIE,KAAID,KAAIH,UAAS,QAAQ,CAAC,GAAG,OAAK,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC;AACxE,cAAI,KAAK,OAAO,MAAM,KAAK,IAAI,GAAG;AAEhC,cAAE,KAAKF,KAAI,EAAE,CAAC,GAAG,CAAC,CAAC;AACnB,cAAE,KAAKA,KAAI,EAAE,CAAC,GAAGE,UAAS,GAAG,GAAG,CAAC,CAAC,CAAC;AACnC;AAAA,UACF;AAGA,cAAI,QAAQ,QAAQ,MAAM,QAAQ,IAAI;AACtC,cAAIQ,SAAQ,OAAO,QAAQ,GAAG;AAC5B,oBAAQ;AAAA,UACV,WAAWD,QAAO,OAAO,QAAQ,GAAG;AAClC,oBAAQ;AAAA,UACV;AACA,kBAAQ,gBAAgBG,WAAU,KAAK,IAAI;AAC3C,cAAIV,UAAS,GAAG,KAAK;AACrB,cAAI,WAAWO,QAAOH,KAAI,CAAC,GAAG,OAAO,GAAG;AACtC,gBAAI,aAAa,UAAUO,YAAW,OAAO;AAAA,UAC/C,WAAW,WAAWH,SAAQJ,KAAI,CAAC,GAAG,OAAO,GAAG;AAC9C,gBAAI,aAAa,UAAUO,YAAW,OAAO;AAAA,UAC/C;AACA;AACA,cAAI,OAAO,SAAS;AAClB,kBAAM,IAAI,MAAM,4DAA4D;AAAA,UAC9E;AAAA,QACF;AACA,eAAO;AAAA,UACL;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,aAAS,MAAM,GAAG,OAAO,IAAI,SAAS;AAIpC,UAAI,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC;AACvD,UAAI,IAAI,CAAC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC;AAC9B,UAAI,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC;AAC/B,UAAI,KAAK,CAAC,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC;AACrC,UAAI,iBAAiB;AAAA,QACnB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAGA,aAAO,IAAI,cAAc,EAAE,GAAG,OAAO,IAAI,OAAO;AAAA,IAClD;AACA,aAAS,MAAM,GAAG,OAAO,IAAI,SAAS;AAIpC,UAAI,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,EAAE,GAAG,CAAC,KAAK,IAAI,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,QAAQ,MAAM,SAAS,MAAM,QAAQ,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,MAAM,OAAO,IAAI,QAAQ,MAAM,KAAK,KAAK,QAAQ,KAAK,GAAG,CAAC,KAAK,KAAK,GAAG,MAAM,MAAM,MAAM,KAAK,QAAQ,MAAM,KAAK,EAAE,CAAC;AAC1P,UAAI,IAAI,CAAC,MAAM,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,GAAG,CAAC;AAChD,UAAI,IAAI,CAAC,KAAK,KAAK,GAAG,MAAM,MAAM,MAAM,KAAK,QAAQ,MAAM,KAAK,IAAI,CAAC;AACrE,UAAI,KAAK,CAAC,OAAO,OAAO,GAAG,OAAO,OAAO,MAAM,KAAK,SAAS,QAAQ,MAAM,MAAM,IAAI,EAAE;AACvF,UAAI,iBAAiB;AAAA,QACnB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAGA,aAAO,IAAI,cAAc,EAAE,GAAG,OAAO,IAAI,OAAO;AAAA,IAClD;AACA,aAAS,UAAU,GAAG,OAAO,IAAI,KAAK;AACpC,UAAI,SAAS,IAAI,SAAS,IAAI,SAAS;AACvC,UAAI,UAAU;AAAA,QACZ,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AACA,UAAI,OAAO,YAAY,KAAK,SAAS;AACnC,YAAI,gBAAgB,cAAc,CAAC,GAAG,GAAG;AACzC,eAAO,cAAc;AACrB,eAAO,QAAQ,OAAO,YAAY,CAAC,EAAE,GAAG,OAAO,IAAI,aAAa;AAAA,MAClE,OAAO;AAEL,YAAI,oBAAoB,OAAO,KAAK,OAAO,EAAE,IAAI,OAAK,IAAK,OAAO,GAAG,GAAI,CAAC;AAE1E,YAAI,yBAAyB,GAAG,OAAO,kBAAkB,MAAM,GAAG,EAAE,EAAE,KAAK,IAAI,GAAG,OAAO,EAAE,OAAO,kBAAkB,MAAM,EAAE,CAAC;AAC7H,cAAM,IAAI,MAAM,uBAAwB,OAAO,QAAQ,2BAA4B,EAAE,OAAO,sBAAsB,CAAC;AAAA,MACrH;AAAA,IACF;AACA,aAAS,eAAe,YAAY;AAElC,aAAO,aAAaH,WAAUD;AAAA,IAChC;AACA,aAAS,gBAAgB,YAAY;AACnC,UAAI,cAAc,aAAaA,UAASC;AACxC,aAAO,SAAU,GAAG,IAAI,GAAG;AACzB,YAAI,OAAOV,KAAI,GAAG,CAAC;AACnB,eAAO,YAAY,MAAM,EAAE,IAAIC,UAAS,IAAI,CAAC,IAAI;AAAA,MACnD;AAAA,IACF;AACA,aAAS,WAAW,GAAG;AAErB,aAAO,YAAY,CAAC,KAAK,SAAS,CAAC;AAAA,IACrC;AACA,aAAS,gBAAgB,GAAG,GAAG,IAAI,SAAS;AAE1C,UAAI,MAAM,UAAU,GAAG,EAAE,QAAQ,GAAG,GAAG,QAAQ,GAAG,OAAO;AACzD,aAAO;AAAA,QACL,GAAGU,QAAO,IAAI,CAAC;AAAA,QACf,GAAGA,QAAO,IAAI,CAAC;AAAA,MACjB;AAAA,IACF;AACA,WAAOZ,OAAM,YAAY;AAAA,MACvB,kCAAkC;AAAA,MAClC,oCAAoC;AAAA,MACpC,0BAA0B,CAAC,GAAG,GAAG,OAAO,UAAU,GAAG,GAAG,IAAI,CAAC,CAAC;AAAA,MAC9D,4BAA4B,CAAC,GAAG,GAAG,OAAO,gBAAgB,GAAG,GAAG,IAAI,CAAC,CAAC;AAAA,MACtE,8CAA8C,CAAC,GAAG,GAAG,OAAO;AAC1D,YAAI,MAAM,UAAU,GAAG,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;AAClC,eAAO;AAAA,UACL,GAAG,IAAI;AAAA,UACP,GAAG,IAAI,EAAE,IAAI,OAAK,EAAE,CAAC,CAAC;AAAA,QACxB;AAAA,MACF;AAAA,MACA,+CAA+C,CAAC,GAAG,GAAG,OAAO;AAC3D,YAAI,MAAM,UAAU,GAAG,EAAE,QAAQ,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;AAC5C,eAAO;AAAA,UACL,GAAGY,QAAO,IAAI,CAAC;AAAA,UACf,GAAGA,QAAO,IAAI,EAAE,IAAI,OAAK,EAAE,CAAC,CAAC,CAAC;AAAA,QAChC;AAAA,MACF;AAAA,MACA,sDAAsD,CAAC,GAAG,GAAG,IAAI,YAAY;AAC3E,YAAI,MAAM,UAAU,GAAG,GAAG,CAAC,EAAE,GAAG,OAAO;AACvC,eAAO;AAAA,UACL,GAAG,IAAI;AAAA,UACP,GAAG,IAAI,EAAE,IAAI,OAAK,EAAE,CAAC,CAAC;AAAA,QACxB;AAAA,MACF;AAAA,MACA,uDAAuD,CAAC,GAAG,GAAG,IAAI,YAAY;AAC5E,YAAI,MAAM,UAAU,GAAG,EAAE,QAAQ,GAAG,CAAC,EAAE,GAAG,OAAO;AACjD,eAAO;AAAA,UACL,GAAGA,QAAO,IAAI,CAAC;AAAA,UACf,GAAGA,QAAO,IAAI,EAAE,IAAI,OAAK,EAAE,CAAC,CAAC,CAAC;AAAA,QAChC;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACtRD,MAAII,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO;AACpB,MAAI,YAA2B,wBAAQD,SAAMC,iBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AA4BJ,WAAOA,OAAM,QAAQ;AAAA,MACnB,QAAQ,SAASC,QAAO,GAAG;AACzB,YAAI,IAAI,KAAK,IAAI,CAAC;AAClB,YAAI,KAAK,SAAS;AAChB,iBAAO,KAAK,CAAC;AAAA,QACf;AACA,YAAI,KAAK,QAAQ;AACf,iBAAO,KAAK,CAAC,IAAI,KAAK,CAAC;AAAA,QACzB;AACA,YAAI,KAAK,GAAK;AACZ,iBAAO,KAAK,CAAC,KAAK,IAAI,MAAM,CAAC;AAAA,QAC/B;AACA,eAAO,KAAK,CAAC,KAAK,IAAI,MAAM,CAAC;AAAA,MAC/B;AAAA,MACA,kBAAkBD,OAAM,YAAY,CAAAE,UAAQ,OAAKC,SAAQ,GAAGD,KAAI,CAAC;AAAA;AAAA;AAAA,IAInE,CAAC;AAQD,aAAS,KAAK,GAAG;AACf,UAAI,MAAM,IAAI;AACd,UAAI,OAAOE,GAAE,CAAC,EAAE,CAAC,IAAI;AACrB,UAAI,OAAO;AACX,UAAIC;AACJ,WAAKA,KAAI,GAAGA,KAAI,GAAGA,MAAK,GAAG;AACzB,gBAAQ,OAAOD,GAAE,CAAC,EAAEC,EAAC,KAAK;AAC1B,gBAAQ,OAAO,EAAE,CAAC,EAAEA,EAAC,KAAK;AAAA,MAC5B;AACA,aAAO,KAAK,OAAOD,GAAE,CAAC,EAAE,CAAC,MAAM,OAAO,EAAE,CAAC,EAAE,CAAC;AAAA,IAC9C;AASA,aAAS,MAAM,GAAG;AAChB,UAAI,OAAOA,GAAE,CAAC,EAAE,CAAC,IAAI;AACrB,UAAI,OAAO;AACX,UAAIC;AACJ,WAAKA,KAAI,GAAGA,KAAI,GAAGA,MAAK,GAAG;AACzB,gBAAQ,OAAOD,GAAE,CAAC,EAAEC,EAAC,KAAK;AAC1B,gBAAQ,OAAO,EAAE,CAAC,EAAEA,EAAC,KAAK;AAAA,MAC5B;AACA,UAAI,UAAU,OAAOD,GAAE,CAAC,EAAE,CAAC,MAAM,OAAO,EAAE,CAAC,EAAE,CAAC;AAC9C,UAAI,MAAM,SAAS,IAAI,EAAE,IAAI;AAC7B,UAAIE,QAAO,IAAI,QAAQ,IAAI;AAC3B,aAAO,KAAK,IAAI,CAAC,MAAM,GAAG,IAAI,KAAK,IAAI,CAACA,IAAG,IAAI;AAAA,IACjD;AAWA,aAAS,MAAM,GAAG;AAChB,UAAI,MAAM,KAAK,IAAI;AACnB,UAAI,OAAOF,GAAE,CAAC,EAAE,CAAC,IAAI;AACrB,UAAI,OAAO;AACX,UAAIC;AACJ,WAAKA,KAAI,GAAGA,KAAI,GAAGA,MAAK,GAAG;AACzB,gBAAQ,OAAOD,GAAE,CAAC,EAAEC,EAAC,KAAK;AAC1B,gBAAQ,OAAO,EAAE,CAAC,EAAEA,EAAC,KAAK;AAAA,MAC5B;AACA,UAAI,SAAS,OAAO,OAAOD,GAAE,CAAC,EAAE,CAAC,MAAM,OAAO,EAAE,CAAC,EAAE,CAAC;AACpD,gBAAU,QAAQ,UAAU;AAC5B,YAAM,SAAS,IAAI,EAAE,IAAI;AACzB,UAAIE,QAAO,IAAI,QAAQ,IAAI;AAC3B,aAAO,KAAK,IAAI,CAAC,MAAM,GAAG,IAAI,KAAK,IAAI,CAACA,IAAG,IAAI;AAAA,IACjD;AAAA,EACF,CAAC;AAMD,MAAI,SAAS;AAMb,MAAI,QAAQ;AAOZ,MAAIF,KAAI,CAAC,CAAC,oBAAwB,oBAAwB,kBAAwB,oBAAwB,mBAAsB,GAAG,CAAC,oBAAwB,mBAAwB,mBAAwB,mBAAwB,kBAAwB,oBAAwB,oBAAwB,oBAAwB,qBAAsB,GAAG,CAAC,qBAAwB,qBAAwB,qBAAwB,sBAAwB,sBAAwB,oBAAsB,CAAC;AAO7e,MAAI,IAAI,CAAC,CAAC,oBAAwB,oBAAwB,oBAAwB,iBAAsB,GAAG,CAAC,oBAAwB,mBAAwB,mBAAwB,oBAAwB,oBAAwB,mBAAwB,oBAAwB,kBAAsB,GAAG,CAAC,mBAAwB,oBAAwB,oBAAwB,qBAAwB,qBAAsB,CAAC;AAOra,MAAI,UAAU,KAAK,IAAI,GAAG,EAAE;;;ACzJ5B,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,YAAY,OAAO,UAAU,aAAa,SAAS,aAAa,aAAa,cAAc,SAAS,OAAO,YAAY,OAAO,YAAY,cAAc,IAAI;AAC5L,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,UAAAC;AAAA,MACA,KAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,OAAAC;AAAA,MACA,WAAAC;AAAA,MACA,WAAAC;AAAA,MACA,YAAAC;AAAA,MACA,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,UAAAC;AAAA,MACA,KAAAC;AAAA,MACA,SAAAC;AAAA,MACA,WAAW;AAAA,MACX,IAAAC;AAAA,IACF,IAAI;AA4BJ,WAAOf,OAAMF,SAAM;AAAA,MACjB,QAAQ,OAAK,YAAY,GAAG,WAAS,OAAO,MAAM,EAAE;AAAA,MACpD,WAAW,OAAK,YAAY,GAAG,WAAS,IAAI,WAAW,KAAK,GAAG,MAAM;AAEnE,eAAO,KAAK,IAAI,KAAK,MAAMG,QAAO,MAAM,CAAC;AAAA,MAC3C,CAAC;AAAA,MACD,SAAS;AAAA,IACX,CAAC;AAQD,aAAS,YAAY,GAAG,aAAa,iBAAiB;AACpD,UAAIK,OAAM,GAAG,CAAC,GAAG;AACf,eAAO,YAAY,IAAI;AAAA,MACzB;AACA,UAAIA,OAAM,GAAG,CAAC,GAAG;AACf,eAAO,YAAY,GAAG;AAAA,MACxB;AACA,UAAI,CAACE,WAAU,CAAC,GAAG;AACjB,eAAOC,YAAW,CAAC,IAAI,YAAY,GAAG,IAAI,YAAY,CAAC;AAAA,MACzD;AACA,aAAOO,MAAK,GAAG,aAAa,iBAAiB,CAAAC,OAAKA,EAAC;AAAA,IACrD;AAMA,aAAS,YAAY,GAAG;AACtB,UAAI,EAAE,OAAO,KAAK,EAAE,OAAO,GAAG;AAC5B,eAAO,IAAIH,SAAQ,IAAI;AAAA,MACzB;AACA,UAAI,EAAE,OAAO,GAAG;AACd,eAAO,IAAIA,SAAQ,KAAK,GAAG;AAAA,MAC7B;AACA,UAAI,EAAE,OAAO,YAAY,EAAE,OAAO,GAAG;AACnC,eAAO,IAAIA,SAAQ,CAAC;AAAA,MACtB;AACA,UAAI,EAAE,OAAO,YAAY,EAAE,OAAO,WAAW;AAC3C,eAAO,IAAIA,SAAQ,KAAK,GAAG;AAAA,MAC7B;AACA,aAAOE,MAAK,GAAG,WAAS,OAAO,CAAAC,OAAK,KAAK,MAAM,MAAM,KAAK,MAAM,KAAK,IAAIA,GAAE,EAAE,CAAC,GAAG,CAAAA,OAAKA,GAAE,EAAE;AAAA,IAC5F;AASA,aAASD,MAAK,GAAG,aAAa,iBAAiB,OAAO;AACpD,UAAI,IAAI,gBAAgB,CAAC;AACzB,UAAI,MAAM,CAAC,IAAI,EAAE,IAAI,KAAK,GAAG;AAC3B,eAAO,EAAE,GAAG,YAAY,CAAC,GAAG,WAAW;AAAA,MACzC,OAAO;AAEL,YAAI,IAAId,UAASC,KAAI,GAAG,CAAC,GAAGA,KAAI,YAAYY,GAAE,GAAGH,UAAS,GAAG,CAAC,CAAC,CAAC;AAChE,YAAIV,UAAS,GAAGS,KAAIT,UAASE,QAAO,YAAYW,GAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AAC5D,YAAIb,UAAS,GAAGQ,OAAME,UAAS,GAAG,CAAC,CAAC,CAAC;AACrC,eAAOV,UAAS,GAAGc,MAAKJ,UAAS,GAAG,CAAC,GAAG,aAAa,iBAAiB,KAAK,CAAC;AAAA,MAC9E;AAAA,IACF;AAQA,aAAS,EAAE,GAAG,GAAG;AACf,UAAI,IAAI;AACR,eAAS,IAAI,GAAGL,WAAU,GAAG,CAAC,GAAG,IAAIM,KAAI,GAAG,CAAC,GAAG;AAC9C,YAAI,SAAST,QAAOF,UAASG,WAAUQ,KAAI,GAAGD,UAAS,GAAG,CAAC,CAAC,CAAC,GAAGT,KAAI,GAAG,CAAC,CAAC,GAAGD,UAASG,WAAUO,UAAS,GAAG,CAAC,CAAC,GAAGP,WAAUH,UAAS,GAAG,CAAC,CAAC,CAAC,CAAC;AAC1I,YAAIW,KAAI,GAAG,MAAM;AAAA,MACnB;AACA,aAAOX,UAAS,GAAG,CAAC;AAAA,IACtB;AASA,aAAS,EAAE,GAAG,GAAG,aAAa;AAC5B,UAAI,IAAIE,QAAO,GAAGF,UAAS,EAAE,YAAY,CAAC,GAAG,CAAC,GAAGU,UAAS,GAAGT,KAAI,GAAGS,UAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACrF,UAAI,IAAI,YAAY,CAAC;AACrB,eAAS,IAAI,YAAY,CAAC,GAAGL,WAAU,GAAG,CAAC,GAAG,IAAIM,KAAI,GAAG,CAAC,GAAG;AAC3D,YAAIA,KAAI,GAAGT,QAAOF,UAAU,SAAQ,IAAI,IAAI,EAAE,GAAG,CAAC,CAAC,GAAGC,KAAI,GAAG,CAAC,CAAC,CAAC;AAAA,MAClE;AACA,aAAOD,UAAS,GAAG,CAAC;AAAA,IACtB;AAAA,EACF,CAAC;;;AClJD,MAAIgB,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,SAAS,WAAW;AAC1C,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,OAAO;AAAA,MACP,WAAAC;AAAA,IACF,IAAI;AA0BJ,WAAOD,OAAMF,SAAM;AAAA,MACjB,kBAAkB;AAAA,MAClB,OAAO,SAAS,EAAE,MAAM;AACtB,eAAO,MAAM,IAAI;AAAA,MACnB;AAAA,IACF,CAAC;AAQD,aAAS,MAAM,QAAQ;AACrB,eAAS,QAAQ,OAAO,QAAQ,CAAC;AACjC,UAAI,MAAM,OAAO;AACjB,UAAI,QAAQ,GAAG;AACb,cAAM,IAAI,MAAM,yCAAyC;AAAA,MAC3D;AACA,UAAII,SAAQ,CAAC;AACb,UAAIC,QAAO,CAAC;AACZ,UAAIC,OAAM;AACV,eAASC,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AACtC,YAAI,QAAQ,OAAOA,EAAC;AACpB,YAAIJ,WAAU,KAAK,KAAK,UAAU,KAAK,GAAG;AACxC,gBAAM,IAAI,MAAM,yDAAyD;AAAA,QAC3E;AACA,YAAI,EAAE,SAASC,SAAQ;AACrB,UAAAA,OAAM,KAAK,IAAI;AAAA,QACjB;AACA,QAAAA,OAAM,KAAK;AACX,YAAIA,OAAM,KAAK,MAAME,MAAK;AACxB,UAAAD,MAAK,KAAK,KAAK;AAAA,QACjB,WAAWD,OAAM,KAAK,IAAIE,MAAK;AAC7B,UAAAA,OAAMF,OAAM,KAAK;AACjB,UAAAC,QAAO,CAAC,KAAK;AAAA,QACf;AAAA,MACF;AACA,aAAOA;AAAA,IACT;AAAA,EACF,CAAC;;;AC/DM,WAAS,oBAAoB,KAAK,QAAQ,OAAO;AAEtD,QAAI;AACJ,QAAI,OAAO,GAAG,EAAE,SAAS,iBAAiB,GAAG;AAC3C,gBAAU,UAAU,SAAS,IAAI,aAAa,OAAO,KAAK,IAAI,cAAc,KAAK,UAAU,KAAK,IAAI,MAAM,aAAa,IAAI,KAAK,SAAS;AACzI,aAAO,IAAI,UAAU,sBAAsB,SAAS,kCAAkC,OAAO;AAAA,IAC/F;AACA,QAAI,OAAO,GAAG,EAAE,SAAS,iBAAiB,GAAG;AAC3C,gBAAU,UAAU,SAAS,IAAI,aAAa,OAAO,KAAK,IAAI,cAAc,KAAK,UAAU,KAAK,IAAI,MAAM;AAC1G,aAAO,IAAI,UAAU,sBAAsB,SAAS,0DAA0D,OAAO;AAAA,IACvH;AACA,WAAO;AAAA,EACT;;;ACpBA,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,kBAAkB,SAAS;AAC3D,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,SAAAC;AAAA,IACF,IAAI;AA0BJ,WAAOH,OAAMF,SAAM;AAAA;AAAA,MAEjB,kBAAkB;AAAA;AAAA,MAElB,sCAAsC,SAAS,gCAAgC,OAAO,KAAK;AAEzF,cAAM,IAAI,MAAM,mCAAmC;AAAA,MAErD;AAAA;AAAA,MAEA,OAAO,SAAS,EAAE,MAAM;AACtB,eAAO,MAAM,IAAI;AAAA,MACnB;AAAA,IACF,CAAC;AAQD,aAAS,MAAM,OAAO;AACpB,UAAIM;AACJ,MAAAC,aAAY,OAAO,SAAU,OAAO;AAClC,YAAI;AACF,UAAAD,QAAOA,UAAS,SAAY,QAAQF,gBAAeE,OAAM,KAAK;AAAA,QAChE,SAAS,KAAK;AACZ,gBAAM,oBAAoB,KAAK,QAAQ,KAAK;AAAA,QAC9C;AAAA,MACF,CAAC;AAGD,UAAI,OAAOA,UAAS,UAAU;AAC5B,QAAAA,QAAOD,SAAQC,OAAM,eAAeA,OAAMH,OAAM,CAAC;AAAA,MACnD;AACA,UAAIG,UAAS,QAAW;AACtB,cAAM,IAAI,MAAM,yCAAyC;AAAA,MAC3D;AACA,aAAOA;AAAA,IACT;AAAA,EACF,CAAC;;;AC5ED,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO;AACpB,MAAI,eAA8B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAgIJ,WAAOA,OAAMF,SAAM;AAAA,MACjB,KAAKG;AAAA,MACL,+CAA+CA;AAAA,IACjD,CAAC;AAAA,EACH,CAAC;;;AC1ID,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,QAAQ;AAuB9B,MAAI,YAAY,QAAQD,SAAMC,iBAAc,UAAQ;AACzD,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,WAAOD,OAAMF,SAAM;AAAA,MACjB,sBAAsB,SAAS,kBAAkB,GAAG;AAClD,eAAOG,QAAO,GAAG;AAAA,UACf,UAAU;AAAA,QACZ,CAAC;AAAA,MACH;AAAA,MACA,0CAA0C,SAAS,oCAAoC,GAAG,UAAU;AAClG,eAAOA,QAAO,GAAG;AAAA,UACf,UAAU;AAAA,UACV;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC1CD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,QAAQ;AAwB9B,MAAI,YAAY,QAAQD,SAAMC,iBAAc,UAAQ;AACzD,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,WAAOD,OAAMF,SAAM;AAAA,MACjB,sBAAsB,SAAS,kBAAkB,GAAG;AAClD,eAAOG,QAAO,GAAG;AAAA,UACf,UAAU;AAAA,QACZ,CAAC;AAAA,MACH;AAAA,MACA,0CAA0C,SAAS,oCAAoC,GAAG,UAAU;AAClG,eAAOA,QAAO,GAAG;AAAA,UACf,UAAU;AAAA,UACV;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC3CD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,QAAQ;AAsB9B,MAAI,YAAY,QAAQD,SAAMC,iBAAc,UAAQ;AACzD,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,WAAOD,OAAMF,SAAM;AAAA,MACjB,sBAAsB,SAAS,kBAAkB,GAAG;AAClD,eAAOG,QAAO,GAAG;AAAA,UACf,UAAU;AAAA,QACZ,CAAC;AAAA,MACH;AAAA,MACA,0CAA0C,SAAS,oCAAoC,GAAG,UAAU;AAClG,eAAOA,QAAO,GAAG;AAAA,UACf,UAAU;AAAA,UACV;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC1CM,MAAI,gBAAgB;;;ACI3B,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO;AACpB,MAAI,cAA6B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AA6CJ,WAAOA,OAAMF,SAAM;AAAA;AAAA,MAEjB,0BAA0B;AAAA,MAC1B,2CAA2C;AAAA,IAC7C,CAAC;AAAA,EACH,CAAC;AAUD,WAAS,OAAO,UAAU,QAAQ,SAAS;AACzC,WAAO,SAAS,QAAQ,eAAe,SAAU,UAAU,KAAK;AAC9D,UAAI,OAAO,IAAI,MAAM,GAAG;AACxB,UAAI,QAAQ,OAAO,KAAK,MAAM,CAAC;AAC/B,UAAI,UAAU,UAAa,MAAM,UAAU;AACzC,gBAAQ,MAAM,QAAQ;AAAA,MACxB;AACA,aAAO,KAAK,UAAU,UAAU,QAAW;AACzC,YAAI,IAAI,KAAK,MAAM;AACnB,gBAAQ,IAAI,MAAM,CAAC,IAAI,QAAQ;AAAA,MACjC;AACA,UAAI,UAAU,QAAW;AACvB,YAAI,CAAC,SAAS,KAAK,GAAG;AACpB,iBAAOG,QAAO,OAAO,OAAO;AAAA,QAC9B,OAAO;AACL,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO;AAAA,IACT,CAAC;AAAA,EACH;;;ACvFA,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,QAAQ;AACxC,MAAI,WAA0B,wBAAQD,SAAMC,iBAAc,UAAQ;AACvE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAF;AAAA,MACA,QAAAC;AAAA,MACA,QAAAC;AAAA,IACF,CAAC;AA0BD,WAAOF,OAAMF,SAAM;AAAA,MACjB,uBAAuB,CAAC,GAAGK,UAAS,EAAE,GAAGA,KAAI;AAAA,IAC/C,GAAG,qBAAqB;AAAA,MACtB,IAAI;AAAA,IACN,CAAC,CAAC;AAAA,EACJ,CAAC;;;AC5CD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO;AACpB,MAAI,eAA8B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAiCJ,WAAOA,OAAMF,SAAM;AAAA,MACjB,MAAM,OAAK,EAAE,OAAO;AAAA,MACpB,gBAAgB,CAAC,GAAG,aAAa,EAAE,OAAO,SAAS,MAAM,GAAG,CAAC;AAAA,MAC7D,wBAAwB,CAAC,GAAG,UAAU,YAAY,EAAE,OAAO,SAAS,MAAM,GAAG,GAAG,OAAO;AAAA,MACvF,eAAe,CAAC,GAAG,aAAa,EAAE,OAAO,QAAQ;AAAA,MACjD,uBAAuB,CAAC,GAAG,UAAU,YAAY,EAAE,OAAO,UAAU,OAAO;AAAA,IAC7E,CAAC;AAAA,EACH,CAAC;;;AC5CD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO;AACpB,MAAI,gBAA+B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC5E,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AA6BJ,WAAOA,OAAMF,SAAM;AAAA,MACjB,QAAQ,SAASG,QAAO,GAAG;AACzB,YAAI,KAAK,GAAG;AACV,iBAAO,IAAI;AAAA,QACb;AACA,YAAI,IAAI,MAAM,KAAK,IAAI,MAAM,GAAG;AAC9B,iBAAO;AAAA,QACT;AACA,iBAASC,KAAI,GAAGA,KAAIA,MAAK,GAAGA,MAAK,GAAG;AAClC,cAAI,IAAIA,OAAM,KAAK,KAAKA,KAAI,OAAO,GAAG;AACpC,mBAAO;AAAA,UACT;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAAA,MACA,QAAQ,SAASC,QAAO,GAAG;AACzB,YAAI,KAAK,IAAI;AACX,iBAAO,IAAI;AAAA,QACb;AACA,YAAI,IAAI,OAAO,MAAM,IAAI,OAAO,IAAI;AAClC,iBAAO;AAAA,QACT;AACA,iBAASD,KAAI,IAAIA,KAAIA,MAAK,GAAGA,MAAK,IAAI;AACpC,cAAI,IAAIA,OAAM,MAAM,KAAKA,KAAI,QAAQ,IAAI;AACvC,mBAAO;AAAA,UACT;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAAA,MACA,WAAW,SAASE,WAAU,GAAG;AAC/B,YAAI,EAAE,IAAI,CAAC,EAAG,QAAO,EAAE,GAAG,CAAC;AAC3B,YAAI,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,EAAG,QAAO;AAC7C,YAAI,EAAE,GAAG,KAAK,IAAI,GAAG,EAAE,CAAC,GAAG;AACzB,cAAI,IAAI,EAAE,SAAS;AACnB,mBAASF,KAAI,GAAGA,KAAIA,MAAK,GAAGA,MAAK,GAAG;AAClC,gBAAI,IAAIA,OAAM,KAAK,KAAKA,KAAI,OAAO,GAAG;AACpC,qBAAO;AAAA,YACT;AAAA,UACF;AACA,iBAAO;AAAA,QACT;AACA,iBAAS,OAAO,MAAM,UAAU,SAAS;AAEvC,cAAI,cAAc;AAClB,iBAAO,CAAC,SAAS,GAAG,CAAC,GAAG;AACtB,gBAAI,SAAS,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG;AACzB,yBAAW,SAAS,IAAI,CAAC;AACzB,qBAAO,KAAK,IAAI,IAAI,EAAE,IAAI,OAAO;AAAA,YACnC,OAAO;AACL,yBAAW,SAAS,IAAI,CAAC;AACzB,4BAAc,KAAK,IAAI,WAAW,EAAE,IAAI,OAAO;AAAA,YACjD;AAAA,UACF;AACA,iBAAO;AAAA,QACT;AAGA,YAAIG,WAAU,EAAE,YAAY,MAAM;AAAA,UAChC,WAAW,EAAE,QAAQ,CAAC,EAAE,SAAS;AAAA,QACnC,CAAC;AACD,YAAI,IAAIA,SAAQ,CAAC;AACjB,YAAI,IAAI;AACR,YAAI,IAAI,EAAE,IAAI,CAAC;AACf,eAAO,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG;AACrB,cAAI,EAAE,IAAI,CAAC;AACX,eAAK;AAAA,QACP;AACA,YAAI,QAAQ;AAEZ,YAAI,EAAE,GAAG,2BAA2B,GAAG;AACrC,kBAAQ,CAAC,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE,EAAE,OAAO,CAAAC,OAAKA,KAAI,CAAC;AAAA,QAC5E,OAAO;AACL,cAAIC,OAAM,KAAK,IAAI,EAAE,SAAS,IAAI,GAAG,KAAK,MAAM,IAAI,KAAK,IAAI,EAAE,QAAQ,CAAC,EAAE,SAAS,KAAK,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;AACpG,kBAAQ,CAAC;AACT,mBAAS,KAAK,GAAG,MAAMA,MAAK,MAAM,GAAG;AACnC,kBAAM,KAAKA,IAAG;AAAA,UAChB;AAAA,QACF;AACA,iBAAS,MAAM,GAAG,MAAM,MAAM,QAAQ,OAAO,GAAG;AAC9C,cAAI,IAAI,MAAM,GAAG;AACjB,cAAI,MAAM,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,GAAG,CAAC;AACtC,cAAI,CAAC,IAAI,GAAG,CAAC,GAAG;AACd,qBAAS,MAAM,GAAG,KAAK,KAAK,CAAC,GAAG,GAAG,EAAE,IAAI,CAAC,CAAC,GAAG,OAAO,GAAG,KAAK,GAAG,IAAI,EAAE,EAAE,IAAI,CAAC,GAAG;AAC9E,kBAAI,QAAQ,IAAI,GAAG;AACjB,uBAAO;AAAA,cACT;AAAA,YACF;AAAA,UACF;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAAA,MACA,kBAAkBP,OAAM,YAAY,CAAAQ,UAAQ,OAAKC,SAAQ,GAAGD,KAAI,CAAC;AAAA,IACnE,CAAC;AAAA,EACH,CAAC;;;AC9HD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,UAAU,cAAc,WAAW;AAChD,MAAI,gBAA+B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC5E,QAAI;AAAA,MACF,QAAQ;AAAA,MACR,WAAAC;AAAA,MACA,UAAAC;AAAA,IACF,IAAI;AACJ,QAAI,kBAAkB;AAAA,MACpB,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,WAAW;AAAA,MACX,UAAU;AAAA,IACZ;AAGA,QAAI,mBAAmB;AAAA,MACrB,QAAQ,OAAK,QAAQ,CAAC;AAAA,MACtB,WAAWD,aAAY,OAAKA,WAAU,CAAC,IAAI;AAAA,MAC3C,QAAQ,OAAK,OAAO,CAAC;AAAA,MACrB,UAAUC,YAAW,OAAKA,UAAS,CAAC,IAAI;AAAA,IAC1C;AAsCA,WAAO,SAASC,SAAQ,OAAO;AAC7B,UAAI,aAAa,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACrF,UAAI,QAAQ,UAAU,SAAS,IAAI,UAAU,CAAC,IAAI;AAClD,UAAI,UAAU,QAAW;AACvB,cAAM,IAAI,YAAY,sCAAsC;AAAA,MAC9D;AACA,UAAI,YAAY,OAAO,KAAK;AAC5B,UAAI,EAAE,aAAa,kBAAkB;AACnC,cAAM,IAAI,UAAU,oBAAoB,QAAQ,eAAe,YAAY,8BAA8B,OAAO,KAAK,eAAe,EAAE,KAAK,IAAI,CAAC;AAAA,MAClJ;AACA,UAAI,EAAE,cAAc,mBAAmB;AACrC,cAAM,IAAI,UAAU,oBAAoB,QAAQ,eAAe,aAAa,+BAA+B,OAAO,KAAK,gBAAgB,EAAE,KAAK,IAAI,CAAC;AAAA,MACrJ;AACA,UAAI,eAAe,WAAW;AAC5B,eAAO;AAAA,MACT,OAAO;AACL,eAAO,iBAAiB,UAAU,EAAE,KAAK;AAAA,MAC3C;AAAA,IACF;AAAA,EACF,CAAC;;;AChFD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,SAAS;AAC/B,MAAI,qBAAoC,wBAAQD,SAAMC,iBAAc,UAAQ;AACjF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,SAAAC;AAAA,IACF,IAAI;AAaJ,WAAOD,OAAMF,SAAM;AAAA,MACjB,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,eAAO,IAAI;AAAA,MACb;AAAA,MACA,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,eAAO,EAAE,IAAI,CAAC;AAAA,MAChB;AAAA,MACA,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,eAAO,EAAE,IAAI,CAAC;AAAA,MAChB;AAAA,MACA,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,eAAO,IAAI;AAAA,MACb;AAAA,MACA,sBAAsB,SAAS,kBAAkB,GAAG,GAAG;AACrD,eAAO,EAAE,IAAI,CAAC;AAAA,MAChB;AAAA,MACA,wDAAwD,CAAC,GAAG,MAAM,EAAE,OAAO,CAAC;AAAA,MAC5E,iDAAiD,CAAC,GAAG,MAAM,EAAE,WAAW,CAAC;AAAA,IAC3E,CAAC;AAAA,EACH,CAAC;;;ACnCD,MAAII,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,YAAY,YAAY,UAAU,OAAO,YAAY,UAAU,SAAS;AACxG,MAAI,YAA2B,wBAAQD,SAAMC,iBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,UAAAC;AAAA,MACA,UAAAC;AAAA,MACA,QAAAC;AAAA,MACA,KAAAC;AAAA,MACA,QAAAC;AAAA,MACA,UAAAC;AAAA,MACA,SAAAC;AAAA,IACF,IAAI;AAuCJ,WAAOR,OAAMF,SAAM;AAAA,MACjB,kBAAkB;AAAA,MAClB,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,eAAO,EAAE,IAAI,CAAC;AAAA,MAChB;AAAA,MACA,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,YAAI,EAAE,UAAU,KAAK,KAAK,KAAKG,QAAO,aAAa;AACjD,iBAAO,EAAE,IAAI,CAAC;AAAA,QAChB,OAAO;AACL,iBAAO,IAAIO,SAAQ,EAAE,SAAS,GAAG,CAAC,EAAE,IAAI,EAAE,SAAS,GAAG,CAAC;AAAA,QACzD;AAAA,MACF;AAAA,MACA,kBAAkB,CAAC,GAAG,MAAM,KAAK;AAAA,MACjC,sBAAsB,SAAS,kBAAkB,GAAG,GAAG;AACrD,YAAI,SAAS,EAAE,IAAI,CAAC;AACpB,YAAI,UAAU,MAAM;AAClB,iBAAO;AAAA,QACT;AACA,YAAIP,QAAO,aAAa;AACtB,gBAAM,IAAI,MAAM,qEAAqE;AAAA,QACvF,OAAO;AACL,iBAAO,KAAK,EAAE,QAAQ,GAAG,EAAE,QAAQ,CAAC;AAAA,QACtC;AAAA,MACF;AAAA,MACA,iBAAiB;AAAA,MACjB,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,eAAO,UAAU,GAAG,EAAE,SAAS,CAAC;AAAA,MAClC;AAAA,MACA,kBAAkB;AAAA,MAClB,qBAAqB,SAAS,iBAAiB,GAAG,GAAG;AACnD,eAAO,WAAW,GAAG,EAAE,SAAS,CAAC;AAAA,MACnC;AAAA,MACA,4BAA4B,SAAS,uBAAuB,GAAG,GAAG;AAChE,eAAO,EAAE,IAAI,CAAC;AAAA,MAChB;AAAA,IACF,CAAC;AASD,aAAS,KAAK,GAAG,GAAG;AAGlB,UAAIA,QAAO,eAAe,CAAC,UAAU,CAAC,KAAK,IAAI,GAAG;AAEhD,YAAI;AACF,cAAI,QAAQM,UAAS,CAAC;AACtB,cAAI,OAAOD,QAAO,KAAK;AACvB,cAAI,MAAM,QAAQ,KAAK,KAAK,IAAI,QAAQ,CAAC,IAAI,OAAO;AAClD,gBAAI,MAAM,IAAI,OAAO,IAAI;AACvB,sBAAQ,MAAM,IAAI,OAAO,KAAK,IAAI,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC;AAAA,YACxD;AAAA,UACF;AAAA,QACF,SAAS,IAAI;AAAA,QAEb;AAAA,MAGF;AAKA,UAAIL,QAAO,gBAAgB,IAAI,MAAM,MAAM,YAAY,IAAI,MAAM,IAAI,KAAK,MAAM,YAAY;AAC1F,eAAO;AAAA,MACT;AACA,UAAI,UAAU,CAAC,KAAK,KAAK,KAAKA,QAAO,aAAa;AAChD,eAAO,UAAU,GAAG,CAAC;AAAA,MACvB,OAAO;AAKL,YAAI,IAAI,IAAI,KAAK,MAAM,YAAY,IAAI,IAAI,KAAK,MAAM,WAAW;AAC/D,iBAAO;AAAA,QACT;AACA,eAAO,IAAIO,SAAQ,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC;AAAA,MACnC;AAAA,IACF;AASA,aAAS,UAAU,GAAG,GAAG;AACvB,UAAI,CAAC,UAAU,CAAC,GAAG;AACjB,cAAM,IAAI,UAAU,6CAA6C,IAAI,GAAG;AAAA,MAC1E;AAEA,UAAI,IAAI,UAAK,CAAC;AACd,UAAI,EAAE,WAAW,GAAG;AAClB,cAAM,IAAI,MAAM,6CAA6C,EAAE,SAAS,cAAc;AAAA,MACxF;AACA,UAAI,EAAE,CAAC,MAAM,EAAE,CAAC,GAAG;AACjB,cAAM,IAAI,MAAM,wCAAwC,EAAE,CAAC,IAAI,MAAM,EAAE,CAAC,IAAI,GAAG;AAAA,MACjF;AACA,UAAI,IAAI,GAAG;AACT,YAAI;AACF,iBAAO,UAAUH,KAAI,CAAC,GAAG,CAAC,CAAC;AAAA,QAC7B,SAASI,QAAO;AACd,cAAIA,OAAM,YAAY,iDAAiD;AACrE,kBAAM,IAAI,UAAU,+EAA+E,IAAI,GAAG;AAAA,UAC5G;AACA,gBAAMA;AAAA,QACR;AAAA,MACF;AACA,UAAI,MAAMP,UAAS,EAAE,CAAC,CAAC,EAAE,QAAQ;AACjC,UAAI,KAAK;AACT,aAAO,KAAK,GAAG;AACb,aAAK,IAAI,OAAO,GAAG;AACjB,gBAAMC,UAAS,IAAI,GAAG;AAAA,QACxB;AACA,cAAM;AACN,aAAKA,UAAS,IAAI,EAAE;AAAA,MACtB;AACA,aAAO;AAAA,IACT;AASA,aAAS,WAAW,GAAG,GAAG;AACxB,aAAOC,QAAO,UAAU,EAAE,QAAQ,GAAG,CAAC,CAAC;AAAA,IACzC;AAAA,EACF,CAAC;;;ACvLD,MAAI,SAAS;AACb,MAAIM,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,UAAU,eAAe,SAAS,aAAa,aAAa;AAC5F,MAAI,cAA6B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,OAAAC;AAAA,MACA,WAAW;AAAA,MACX,aAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAL;AAAA,MACA,aAAAG;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAH;AAAA,MACA,aAAAK;AAAA,IACF,CAAC;AACD,QAAI,eAAe,mBAAmB;AAAA,MACpC,OAAAL;AAAA,IACF,CAAC;AACD,aAAS,WAAW,SAAS;AAC3B,aAAO,KAAK,IAAI,YAAY,OAAO,EAAE,QAAQ;AAAA,IAC/C;AA8CA,WAAOA,OAAMF,SAAM;AAAA,MACjB,QAAQ,SAASQ,QAAO,GAAG;AAEzB,YAAI,WAAW,YAAY,GAAG,WAAWL,QAAO,MAAM,CAAC;AACvD,YAAI,YAAY,YAAY,GAAG,UAAUA,QAAO,QAAQA,QAAO,MAAM,IAAI,WAAW;AACpF,eAAO,YAAY,SAAS;AAAA,MAC9B;AAAA,MACA,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAE7C,YAAI,kBAAkB,WAAWA,QAAO,MAAM;AAC9C,YAAI,KAAK,iBAAiB;AACxB,iBAAO,YAAY,GAAG,CAAC;AAAA,QACzB;AACA,YAAI,WAAW,YAAY,GAAG,eAAe;AAC7C,YAAI,YAAY,YAAY,GAAG,UAAUA,QAAO,QAAQA,QAAO,MAAM,IAAI,WAAW;AACpF,eAAO,YAAY,WAAW,CAAC;AAAA,MACjC;AAAA,MACA,qBAAqB,SAAS,iBAAiB,GAAG,GAAG;AACnD,YAAI,CAAC,EAAE,UAAU,GAAG;AAClB,gBAAM,IAAI,UAAU,MAAM;AAAA,QAC5B;AACA,eAAO,IAAI,WAAW,CAAC,EAAE,gBAAgB,EAAE,SAAS,CAAC;AAAA,MACvD;AAAA,MACA,SAAS,SAASM,SAAQ,GAAG;AAC3B,eAAO,EAAE,MAAM;AAAA,MACjB;AAAA,MACA,mBAAmB,SAAS,eAAe,GAAG,GAAG;AAC/C,YAAI,IAAI,GAAG;AACT,gBAAM,IAAI,UAAU,MAAM;AAAA,QAC5B;AACA,eAAO,EAAE,MAAM,CAAC;AAAA,MAClB;AAAA,MACA,sBAAsB,SAAS,kBAAkB,GAAG,GAAG;AACrD,YAAI,CAAC,EAAE,UAAU,GAAG;AAClB,gBAAM,IAAI,UAAU,MAAM;AAAA,QAC5B;AACA,YAAI,KAAK,EAAE,SAAS;AACpB,eAAO,EAAE,MAAM,EAAE;AAAA,MACnB;AAAA,MACA,WAAW,SAASC,WAAU,GAAG;AAE/B,YAAI,WAAW,IAAI,WAAW,CAAC,EAAE,gBAAgB,WAAWP,QAAO,MAAM,CAAC;AAC1E,YAAI,YAAYQ,aAAe,GAAG,UAAUR,QAAO,QAAQA,QAAO,MAAM,IAAI,WAAW;AACvF,eAAO,UAAU,gBAAgB,CAAC;AAAA,MACpC;AAAA,MACA,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,YAAI,CAAC,EAAE,UAAU,GAAG;AAClB,gBAAM,IAAI,UAAU,MAAM;AAAA,QAC5B;AAGA,YAAI,kBAAkB,WAAWA,QAAO,MAAM;AAC9C,YAAI,KAAK,iBAAiB;AACxB,iBAAO,EAAE,gBAAgB,EAAE,SAAS,CAAC;AAAA,QACvC;AACA,YAAI,WAAW,EAAE,gBAAgB,eAAe;AAChD,YAAI,YAAYQ,aAAe,GAAG,UAAUR,QAAO,QAAQA,QAAO,MAAM,IAAI,WAAW;AACvF,eAAO,UAAU,gBAAgB,EAAE,SAAS,CAAC;AAAA,MAC/C;AAAA;AAAA,MAEA,QAAQ,OAAK;AAAA,MACb,kBAAkB,CAAC,GAAG,WAAW;AAAA,MACjC,qBAAqB,CAAC,GAAG,WAAW;AAAA,MACpC,UAAU,SAASS,UAAS,GAAG;AAC7B,eAAO,EAAE,MAAM;AAAA,MACjB;AAAA,MACA,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,YAAI,IAAI,GAAG;AACT,gBAAM,IAAI,UAAU,MAAM;AAAA,QAC5B;AACA,eAAO,EAAE,MAAM,CAAC;AAAA,MAClB;AAAA,MACA,uBAAuB,SAAS,mBAAmB,GAAG,GAAG;AACvD,YAAI,CAAC,EAAE,UAAU,GAAG;AAClB,gBAAM,IAAI,UAAU,MAAM;AAAA,QAC5B;AACA,eAAO,EAAE,MAAM,EAAE,SAAS,CAAC;AAAA,MAC7B;AAAA,MACA,sBAAsBV,OAAM,YAAY,CAAAW,UAAQ,SAAU,GAAG,GAAGC,OAAM;AACpE,YAAI,YAAY,EAAE,UAAUA,KAAI;AAChC,eAAOA,MAAK,SAASD,MAAK,WAAW,CAAC,CAAC;AAAA,MACzC,CAAC;AAAA,MACD,yBAAyBX,OAAM,YAAY,CAAAW,UAAQ,CAAC,GAAG,GAAGC,UAASD,MAAK,GAAG,EAAE,SAAS,GAAGC,KAAI,CAAC;AAAA,MAC9F,4CAA4CZ,OAAM,YAAY,CAAAW,UAAQ,CAAC,GAAG,GAAGC,UAAS;AAEpF,eAAOC,SAAQ,GAAG,WAASF,MAAK,OAAO,GAAGC,KAAI,GAAG,IAAI;AAAA,MACvD,CAAC;AAAA,MACD,+BAA+BZ,OAAM,YAAY,CAAAW,UAAQ,CAAC,GAAGC,UAASD,MAAK,GAAG,GAAGC,KAAI,CAAC;AAAA,MACtF,kBAAkBZ,OAAM,YAAY,CAAAW,UAAQ,OAAK;AAE/C,eAAOE,SAAQ,GAAGF,OAAM,IAAI;AAAA,MAC9B,CAAC;AAAA,MACD,oCAAoCX,OAAM,YAAY,CAAAW,UAAQ,CAAC,GAAG,MAAM;AACtE,eAAO,cAAc,GAAG,GAAGA,OAAM,KAAK;AAAA,MACxC,CAAC;AAAA,MACD,mCAAmCX,OAAM,YAAY,CAAAW,UAAQ,CAAC,GAAG,MAAM;AACrE,eAAO,aAAa,GAAG,GAAGA,OAAM,KAAK;AAAA,MACvC,CAAC;AAAA,MACD,6BAA6BX,OAAM,YAAY,CAAAW,UAAQ,CAAC,GAAG,MAAM;AAE/D,eAAO,aAAaT,QAAO,CAAC,GAAG,GAAGS,OAAM,KAAK,EAAE,QAAQ;AAAA,MACzD,CAAC;AAAA,MACD,yDAAyDX,OAAM,YAAY,CAAAW,UAAQ,CAAC,GAAG,MAAM;AAE3F,YAAIR,aAAY,GAAG,CAAC,GAAG;AAErB,iBAAOC,OAAM,EAAE,KAAK,GAAG,EAAE,QAAQ,CAAC;AAAA,QACpC;AACA,eAAO,cAAc,GAAG,GAAGO,OAAM,IAAI;AAAA,MACvC,CAAC;AAAA,MACD,wDAAwDX,OAAM,YAAY,CAAAW,UAAQ,CAAC,GAAG,MAAM;AAE1F,YAAIR,aAAY,GAAG,CAAC,GAAG;AAErB,iBAAOC,OAAM,EAAE,KAAK,GAAG,EAAE,QAAQ,CAAC;AAAA,QACpC;AACA,eAAO,aAAa,GAAG,GAAGO,OAAM,IAAI;AAAA,MACtC,CAAC;AAAA,MACD,kDAAkDX,OAAM,YAAY,CAAAW,UAAQ,CAAC,GAAG,MAAM;AAEpF,eAAO,aAAaT,QAAO,CAAC,GAAG,GAAGS,OAAM,IAAI,EAAE,QAAQ;AAAA,MACxD,CAAC;AAAA,IACH,CAAC;AAAA,EACH,CAAC;;;ACxMD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,UAAU,SAAS,UAAU,gBAAgB,SAAS;AAC1E,MAAI,QAAQ,KAAK,IAAI,EAAE;AAChB,MAAI,YAA2B,wBAAQD,SAAMC,iBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,QAAAC;AAAA,MACA,cAAAC;AAAA,MACA,SAAAC;AAAA,IACF,IAAI;AAiDJ,aAAS,WAAW,GAAG;AACrB,aAAO,EAAE,IAAI;AAAA,IACf;AACA,aAAS,iBAAiB,GAAG;AAC3B,aAAO,WAAW,IAAIA,SAAQ,GAAG,CAAC,CAAC;AAAA,IACrC;AACA,WAAOJ,OAAMF,SAAM;AAAA,MACjB,QAAQ,SAASO,QAAO,GAAG;AACzB,YAAI,KAAK,KAAKH,QAAO,aAAa;AAChC,iBAAO,UAAU,CAAC;AAAA,QACpB,OAAO;AAEL,iBAAO,iBAAiB,CAAC;AAAA,QAC3B;AAAA,MACF;AAAA,MACA,QAAQ,iBAAiB,OAAO,WAAWA,SAAQ,gBAAgB;AAAA,MACnE,SAAS;AAAA,MACT,WAAW,SAASI,WAAU,GAAG;AAC/B,YAAI,CAAC,EAAE,WAAW,KAAKJ,QAAO,aAAa;AACzC,iBAAO,EAAE,GAAG;AAAA,QACd,OAAO;AAEL,iBAAO,iBAAiB,EAAE,SAAS,CAAC;AAAA,QACtC;AAAA,MACF;AAAA,MACA,YAAYF,OAAM,YAAY,CAAAO,UAAQ,CAAC,GAAG,SAAS;AAGjD,YAAIN,QAAO,CAAC,MAAM,cAAcA,QAAO,IAAI,MAAM,YAAY;AAC3D,cAAI,SAAS,EAAE,IAAI,IAAI;AACvB,cAAI,WAAW,MAAM;AACnB,mBAAO;AAAA,UACT;AAAA,QACF;AACA,eAAOE,cAAaI,MAAK,CAAC,GAAGA,MAAK,IAAI,CAAC;AAAA,MACzC,CAAC;AAAA,IACH,CAAC;AAAA,EACH,CAAC;;;AChGD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,gBAAgB,OAAO,SAAS;AAChE,MAAI,cAA6B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,cAAAC;AAAA,MACA,KAAAC;AAAA,MACA,SAAAC;AAAA,IACF,IAAI;AAgCJ,WAAOJ,OAAMF,SAAM;AAAA,MACjB,QAAQ,SAASO,QAAO,GAAG;AACzB,YAAI,KAAK,MAAMJ,QAAO,aAAa;AACjC,iBAAO,MAAO,CAAC;AAAA,QACjB,OAAO;AAEL,iBAAO,cAAc,IAAIG,SAAQ,GAAG,CAAC,CAAC;AAAA,QACxC;AAAA,MACF;AAAA,MACA,SAAS;AAAA,MACT,WAAW,SAASE,WAAU,GAAG;AAC/B,YAAI,IAAI,EAAE,KAAK,CAAC;AAChB,YAAI,CAAC,EAAE,WAAW,KAAKL,QAAO,aAAa;AACzC,iBAAO,EAAE,GAAG;AAAA,QACd,OAAO;AAEL,iBAAO,cAAc,IAAIG,SAAQ,EAAE,SAAS,GAAG,CAAC,CAAC;AAAA,QACnD;AAAA,MACF;AAAA,MACA,kBAAkBJ,OAAM,YAAY,CAAAO,UAAQ,OAAKC,SAAQ,GAAGD,KAAI,CAAC;AAAA,MACjE,YAAYP,OAAM,YAAY,CAAAO,UAAQ,CAAC,GAAG,SAAS;AAEjD,eAAOL,cAAaK,MAAK,CAAC,GAAGJ,KAAI,IAAI,CAAC;AAAA,MACxC,CAAC;AAAA,IACH,CAAC;AAQD,aAAS,cAAc,GAAG;AACxB,UAAI,QAAQ,EAAE,KAAK;AACnB,aAAO,IAAIC,SAAQ,KAAK,IAAI,KAAK,KAAK,QAAQ,QAAQ,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC;AAAA,IAC9F;AAAA,EACF,CAAC;;;AC/ED,MAAIK,UAAO;AACX,MAAIC,kBAAe,CAAC,UAAU,SAAS,gBAAgB,SAAS;AACzD,MAAI,iBAAgC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC7E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,cAAAC;AAAA,MACA,SAAAC;AAAA,IACF,IAAI;AAOJ,QAAI,wBAAwB,CAAC,SAAS,QAAQ,KAAK;AACjD,aAAO,IAAIA,SAAQ,KAAK,CAAC;AAAA,IAC3B,GAAG,SAAS,QAAQ,KAAK;AACvB,aAAO,IAAIA,SAAQ,GAAG,GAAG;AAAA,IAC3B,GAAG,SAAS,QAAQ,KAAK;AACvB,aAAO,IAAIA,SAAQ,CAAC,KAAK,CAAC;AAAA,IAC5B,GAAG,SAAS,QAAQ,KAAK;AACvB,aAAO,IAAIA,SAAQ,GAAG,CAAC,GAAG;AAAA,IAC5B,CAAC;AAQD,aAAS,iBAAiB,GAAG,MAAM;AACjC,UAAI,OAAO,EAAG,OAAM,IAAI,MAAM,gCAAgC;AAC9D,UAAI,SAAS,EAAG,OAAM,IAAI,MAAM,uBAAuB;AACvD,UAAI,OAAO,MAAM,EAAG,OAAM,IAAI,MAAM,yBAAyB;AAC7D,UAAI,MAAM,KAAK,EAAE,IAAI,MAAM,EAAG,QAAO,CAAC,IAAIA,SAAQ,GAAG,CAAC,CAAC;AACvD,UAAI,aAAa,OAAO,MAAM;AAC9B,UAAI;AAEJ,UAAI,cAAc,EAAE,OAAO,KAAK,EAAE,OAAO,GAAG;AAC1C,YAAI,YAAY;AACd,mBAAS,IAAI,EAAE,IAAI;AAAA,QACrB,WAAW,EAAE,OAAO,GAAG;AACrB,mBAAS,IAAI,EAAE,EAAE,KAAK;AAAA,QACxB,OAAO;AACL,mBAAS,IAAI,EAAE,EAAE,KAAK,KAAK;AAAA,QAC7B;AAAA,MACF;AACA,UAAIC,OAAM,EAAE,IAAI;AAChB,UAAIC,OAAM,EAAE,IAAI;AAChB,UAAI,QAAQ,CAAC;AACb,UAAI,IAAI,KAAK,IAAIA,MAAK,IAAI,IAAI;AAC9B,eAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC7B,YAAI,gBAAgB,SAAS,IAAI,KAAK;AAKtC,YAAI,iBAAiB,KAAK,MAAM,YAAY,GAAG;AAC7C,gBAAM,KAAK,sBAAsB,eAAe,CAAC,EAAE,CAAC,CAAC;AACrD;AAAA,QACF;AACA,cAAM,KAAK,IAAIF,SAAQ;AAAA,UACrB;AAAA,UACA,MAAMC,OAAM,IAAI,KAAK,KAAK,KAAK;AAAA,QACjC,CAAC,CAAC;AAAA,MACJ;AACA,aAAO;AAAA,IACT;AAoCA,WAAOJ,OAAMF,SAAM;AAAA,MACjB,SAAS,SAASK,SAAQ,GAAG;AAC3B,eAAO,iBAAiB,GAAG,CAAC;AAAA,MAC9B;AAAA,MACA,mBAAmB;AAAA,IACrB,CAAC;AAAA,EACH,CAAC;;;ACzGD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,eAAe,UAAU,OAAO,eAAe,UAAU,cAAc;AAC7F,MAAI,eAA8B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,MACA,KAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,MACA,cAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAN;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAA;AAAA,MACA,cAAAM;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAN;AAAA,MACA,aAAAC;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAD;AAAA,MACA,aAAAI;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAJ;AAAA,MACA,QAAAE;AAAA,MACA,QAAAG;AAAA,IACF,CAAC;AACD,QAAI,sBAAsB,CAAC;AAC3B,aAAS,aAAaF,KAAI,YAAY;AACpC,UAAI,OAAO,UAAU,eAAe,KAAKA,KAAI,YAAY,SAAS,GAAG;AACnE,YAAI,CAAC,UAAU,SAAS,QAAQ,KAAK,CAAC,UAAU,SAAS,OAAO,GAAG;AACjE,8BAAoB,SAAS,IAAIA,KAAI,WAAW,SAAS;AAAA,QAC3D;AAAA,MACF;AAAA,IACF;AACA,QAAI,YAAYH,OAAM,mBAAmB;AAyBzC,WAAOA,OAAMF,SAAM,qBAAqB;AAAA,MACtC,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,CAAC;AAAA,EACJ,CAAC;;;ACvED,MAAIS,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,eAAe,gBAAgB,eAAe,UAAU,cAAc;AACtG,MAAI,kBAAiC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,cAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,MACA,cAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAN;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAF;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAA;AAAA,MACA,cAAAM;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAN;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAF;AAAA,MACA,aAAAI;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAJ;AAAA,MACA,QAAAC;AAAA,MACA,QAAAI;AAAA,IACF,CAAC;AA4BD,WAAOL,OAAMF,SAAM,qBAAqB;AAAA,MACtC,MAAMK;AAAA,MACN,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,CAAC;AAAA,EACJ,CAAC;;;AC3EM,WAAS,sBAAsB,MAAM;AAC1C,QAAI;AAAA,MACF,aAAAI;AAAA,IACF,IAAI;AAUJ,WAAO,SAAS,gBAAgB,GAAG,GAAG,MAAM;AAC1C,UAAI,QAAQ,EAAE,KAAK;AACnB,UAAI,MAAM,WAAW,GAAG;AACtB,cAAM,IAAI,WAAW,2CAA2CC,QAAO,KAAK,IAAI,GAAG;AAAA,MACrF;AACA,UAAI,OAAO,MAAM,CAAC;AAClB,UAAI,UAAU,MAAM,CAAC;AACrB,UAAI,SAAS,SAAS;AACpB,cAAM,IAAI,WAAW,kCAAkCA,QAAO,KAAK,IAAI,GAAG;AAAA,MAC5E;AACA,UAAI,OAAO,CAAC;AACZ,UAAI,SAAS,CAAC,GAAG;AACf,YAAI,QAAQ,EAAE,KAAK;AACnB,YAAI,QAAQ,EAAE;AAGd,YAAI,MAAM,WAAW,GAAG;AACtB,cAAI,MAAM,CAAC,MAAM,MAAM;AACrB,kBAAM,IAAI,WAAW,8DAA8D;AAAA,UACrF;AACA,mBAASC,KAAI,GAAGA,KAAI,MAAMA,MAAK;AAC7B,iBAAKA,EAAC,IAAI,CAAC,MAAMA,EAAC,CAAC;AAAA,UACrB;AACA,iBAAO,IAAIF,aAAY;AAAA,YACrB;AAAA,YACA,MAAM,CAAC,MAAM,CAAC;AAAA,YACd,UAAU,EAAE;AAAA,UACd,CAAC;AAAA,QACH;AAGA,YAAI,MAAM,WAAW,GAAG;AACtB,cAAI,MAAM,CAAC,MAAM,QAAQ,MAAM,CAAC,MAAM,GAAG;AACvC,kBAAM,IAAI,WAAW,8DAA8D;AAAA,UACrF;AACA,cAAI,cAAc,CAAC,GAAG;AACpB,gBAAI,MAAM;AACR,qBAAO,CAAC;AACR,uBAAS,KAAK,GAAG,KAAK,MAAM,MAAM;AAChC,qBAAK,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;AAAA,cAC1B;AACA,qBAAO,IAAIA,aAAY;AAAA,gBACrB;AAAA,gBACA,MAAM,CAAC,MAAM,CAAC;AAAA,gBACd,UAAU,EAAE;AAAA,cACd,CAAC;AAAA,YACH;AACA,mBAAO;AAAA,UACT;AACA,cAAI,eAAe,CAAC,GAAG;AACrB,qBAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,mBAAK,GAAG,IAAI,CAAC,CAAC;AAAA,YAChB;AACA,gBAAI,SAAS,EAAE;AACf,gBAAIG,SAAQ,EAAE;AACd,gBAAI,MAAM,EAAE;AACZ,qBAAS,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,IAAI,IAAI,KAAK;AAC7C,kBAAI,MAAMA,OAAM,CAAC;AACjB,mBAAK,GAAG,EAAE,CAAC,IAAI,OAAO,CAAC;AAAA,YACzB;AACA,mBAAO,IAAIH,aAAY;AAAA,cACrB;AAAA,cACA,MAAM,CAAC,MAAM,CAAC;AAAA,cACd,UAAU,EAAE;AAAA,YACd,CAAC;AAAA,UACH;AAAA,QACF;AACA,cAAM,IAAI,WAAW,iFAAiF;AAAA,MACxG;AACA,UAAI,QAAQ,CAAC,GAAG;AACd,YAAI,QAAQ,UAAU,CAAC;AACvB,YAAI,MAAM,WAAW,GAAG;AACtB,cAAI,MAAM,CAAC,MAAM,MAAM;AACrB,kBAAM,IAAI,WAAW,8DAA8D;AAAA,UACrF;AACA,mBAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,iBAAK,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC;AAAA,UACrB;AACA,iBAAO,IAAIA,aAAY;AAAA,YACrB;AAAA,YACA,MAAM,CAAC,MAAM,CAAC;AAAA,UAChB,CAAC;AAAA,QACH;AACA,YAAI,MAAM,WAAW,GAAG;AACtB,cAAI,MAAM,CAAC,MAAM,QAAQ,MAAM,CAAC,MAAM,GAAG;AACvC,kBAAM,IAAI,WAAW,8DAA8D;AAAA,UACrF;AACA,mBAAS,MAAM,GAAG,MAAM,MAAM,OAAO;AACnC,iBAAK,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;AAAA,UACxB;AACA,iBAAO,IAAIA,aAAY;AAAA,YACrB;AAAA,YACA,MAAM,CAAC,MAAM,CAAC;AAAA,UAChB,CAAC;AAAA,QACH;AACA,cAAM,IAAI,WAAW,iFAAiF;AAAA,MACxG;AAAA,IACF;AAAA,EACF;;;AChHA,MAAII,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,gBAAgB,kBAAkB,kBAAkB,eAAe,aAAa;AAChH,MAAI,eAA8B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,cAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,aAAAC;AAAA,MACA,aAAAC;AAAA,IACF,IAAI;AACJ,QAAI,kBAAkB,sBAAsB;AAAA,MAC1C,aAAAA;AAAA,IACF,CAAC;AA0BD,WAAON,OAAMF,SAAM;AAAA,MACjB,gCAAgC,SAAS,2BAA2B,GAAG,GAAG;AACxE,eAAO,2BAA2B,GAAG,CAAC;AAAA,MACxC;AAAA,MACA,+BAA+B,SAAS,0BAA0B,GAAG,GAAG;AACtE,eAAO,0BAA0B,GAAG,CAAC;AAAA,MACvC;AAAA,MACA,yBAAyB,SAAS,oBAAoB,GAAG,GAAG;AAC1D,YAAI,IAAIG,QAAO,CAAC;AAChB,YAAI,IAAI,0BAA0B,GAAG,CAAC;AACtC,eAAO,EAAE,QAAQ;AAAA,MACnB;AAAA,IACF,CAAC;AACD,aAAS,0BAA0B,GAAG,GAAG;AAEvC,UAAI,gBAAgB,GAAG,GAAG,IAAI;AAC9B,UAAI,QAAQ,EAAE;AACd,UAAI,OAAO,EAAE,MAAM,CAAC;AACpB,UAAI,UAAU,EAAE,MAAM,CAAC;AAGvB,UAAI,IAAI,CAAC;AACT,UAAI,QAAQ,EAAE;AAGd,eAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,YAAI,KAAK,MAAM,CAAC,EAAE,CAAC,KAAK;AACxB,YAAI,KAAK;AACT,YAAI,CAACI,aAAY,IAAI,CAAC,GAAG;AAGvB,cAAI,MAAM,MAAM,CAAC,EAAE,CAAC;AACpB,cAAIA,aAAY,KAAK,CAAC,GAAG;AACvB,kBAAM,IAAI,MAAM,yDAAyD;AAAA,UAC3E;AACA,eAAKH,cAAa,IAAI,GAAG;AAGzB,mBAASK,KAAI,IAAI,GAAGA,KAAI,MAAMA,MAAK;AACjC,kBAAMA,EAAC,IAAI,CAACH,gBAAe,MAAMG,EAAC,EAAE,CAAC,KAAK,GAAGJ,gBAAe,IAAI,MAAMI,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAAA,UAC/E;AAAA,QACF,OAAO;AAEL,eAAK;AAAA,QACP;AACA,UAAE,CAAC,IAAI,CAAC,EAAE;AAAA,MACZ;AACA,aAAO,IAAID,aAAY;AAAA,QACrB,MAAM;AAAA,QACN,MAAM,CAAC,MAAM,CAAC;AAAA,MAChB,CAAC;AAAA,IACH;AACA,aAAS,2BAA2B,GAAG,GAAG;AAExC,UAAI,gBAAgB,GAAG,GAAG,IAAI;AAC9B,UAAI,QAAQ,EAAE;AACd,UAAI,OAAO,EAAE,MAAM,CAAC;AACpB,UAAI,UAAU,EAAE,MAAM,CAAC;AACvB,UAAI,SAAS,EAAE;AACf,UAAIE,SAAQ,EAAE;AACd,UAAI,MAAM,EAAE;AAGZ,UAAI,IAAI,CAAC;AAGT,eAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,YAAI,KAAK,MAAM,CAAC,EAAE,CAAC,KAAK;AACxB,YAAI,CAACH,aAAY,IAAI,CAAC,GAAG;AAGvB,cAAI,MAAM;AAEV,cAAI,UAAU,CAAC;AACf,cAAI,WAAW,CAAC;AAGhB,cAAI,aAAa,IAAI,CAAC;AACtB,cAAI,YAAY,IAAI,IAAI,CAAC;AAGzB,mBAAS,IAAI,YAAY,IAAI,WAAW,KAAK;AAC3C,gBAAIE,KAAIC,OAAM,CAAC;AAGf,gBAAID,OAAM,GAAG;AACX,oBAAM,OAAO,CAAC;AAAA,YAChB,WAAWA,KAAI,GAAG;AAEhB,sBAAQ,KAAK,OAAO,CAAC,CAAC;AACtB,uBAAS,KAAKA,EAAC;AAAA,YACjB;AAAA,UACF;AAGA,cAAIF,aAAY,KAAK,CAAC,GAAG;AACvB,kBAAM,IAAI,MAAM,yDAAyD;AAAA,UAC3E;AACA,cAAI,KAAKH,cAAa,IAAI,GAAG;AAC7B,mBAAS,KAAK,GAAG,IAAI,SAAS,QAAQ,KAAK,GAAG,MAAM;AAClD,gBAAI,KAAK,SAAS,EAAE;AACpB,kBAAM,EAAE,IAAI,CAACE,gBAAe,MAAM,EAAE,EAAE,CAAC,KAAK,GAAGD,gBAAe,IAAI,QAAQ,EAAE,CAAC,CAAC,CAAC;AAAA,UACjF;AACA,YAAE,CAAC,IAAI,CAAC,EAAE;AAAA,QACZ,OAAO;AAEL,YAAE,CAAC,IAAI,CAAC,CAAC;AAAA,QACX;AAAA,MACF;AACA,aAAO,IAAIG,aAAY;AAAA,QACrB,MAAM;AAAA,QACN,MAAM,CAAC,MAAM,CAAC;AAAA,MAChB,CAAC;AAAA,IACH;AAAA,EACF,CAAC;;;AC1JD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,gBAAgB,kBAAkB,kBAAkB,eAAe,aAAa;AAChH,MAAI,eAA8B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,cAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,aAAAC;AAAA,MACA,aAAAC;AAAA,IACF,IAAI;AACJ,QAAI,kBAAkB,sBAAsB;AAAA,MAC1C,aAAAA;AAAA,IACF,CAAC;AA0BD,WAAON,OAAMF,SAAM;AAAA,MACjB,gCAAgC,SAAS,2BAA2B,GAAG,GAAG;AACxE,eAAO,4BAA4B,GAAG,CAAC;AAAA,MACzC;AAAA,MACA,+BAA+B,SAAS,0BAA0B,GAAG,GAAG;AACtE,eAAO,2BAA2B,GAAG,CAAC;AAAA,MACxC;AAAA,MACA,yBAAyB,SAAS,oBAAoB,GAAG,GAAG;AAC1D,YAAI,IAAIG,QAAO,CAAC;AAChB,YAAI,IAAI,2BAA2B,GAAG,CAAC;AACvC,eAAO,EAAE,QAAQ;AAAA,MACnB;AAAA,IACF,CAAC;AACD,aAAS,2BAA2B,GAAG,GAAG;AAExC,UAAI,gBAAgB,GAAG,GAAG,IAAI;AAC9B,UAAI,QAAQ,EAAE;AACd,UAAI,OAAO,EAAE,MAAM,CAAC;AACpB,UAAI,UAAU,EAAE,MAAM,CAAC;AAGvB,UAAI,IAAI,CAAC;AACT,UAAI,QAAQ,EAAE;AAEd,eAAS,IAAI,UAAU,GAAG,KAAK,GAAG,KAAK;AAErC,YAAI,KAAK,MAAM,CAAC,EAAE,CAAC,KAAK;AAExB,YAAI,KAAK;AACT,YAAI,CAACI,aAAY,IAAI,CAAC,GAAG;AAEvB,cAAI,MAAM,MAAM,CAAC,EAAE,CAAC;AACpB,cAAIA,aAAY,KAAK,CAAC,GAAG;AAEvB,kBAAM,IAAI,MAAM,yDAAyD;AAAA,UAC3E;AACA,eAAKH,cAAa,IAAI,GAAG;AAGzB,mBAASK,KAAI,IAAI,GAAGA,MAAK,GAAGA,MAAK;AAE/B,kBAAMA,EAAC,IAAI,CAACH,gBAAe,MAAMG,EAAC,EAAE,CAAC,KAAK,GAAGJ,gBAAe,IAAI,MAAMI,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAAA,UAC/E;AAAA,QACF,OAAO;AAEL,eAAK;AAAA,QACP;AAEA,UAAE,CAAC,IAAI,CAAC,EAAE;AAAA,MACZ;AACA,aAAO,IAAID,aAAY;AAAA,QACrB,MAAM;AAAA,QACN,MAAM,CAAC,MAAM,CAAC;AAAA,MAChB,CAAC;AAAA,IACH;AACA,aAAS,4BAA4B,GAAG,GAAG;AAEzC,UAAI,gBAAgB,GAAG,GAAG,IAAI;AAC9B,UAAI,QAAQ,EAAE;AACd,UAAI,OAAO,EAAE,MAAM,CAAC;AACpB,UAAI,UAAU,EAAE,MAAM,CAAC;AACvB,UAAI,SAAS,EAAE;AACf,UAAIE,SAAQ,EAAE;AACd,UAAI,MAAM,EAAE;AAGZ,UAAI,IAAI,CAAC;AAGT,eAAS,IAAI,UAAU,GAAG,KAAK,GAAG,KAAK;AACrC,YAAI,KAAK,MAAM,CAAC,EAAE,CAAC,KAAK;AACxB,YAAI,CAACH,aAAY,IAAI,CAAC,GAAG;AAGvB,cAAI,MAAM;AAGV,cAAI,UAAU,CAAC;AACf,cAAI,WAAW,CAAC;AAGhB,cAAI,aAAa,IAAI,CAAC;AACtB,cAAI,YAAY,IAAI,IAAI,CAAC;AAGzB,mBAAS,IAAI,YAAY,GAAG,KAAK,YAAY,KAAK;AAChD,gBAAIE,KAAIC,OAAM,CAAC;AAGf,gBAAID,OAAM,GAAG;AACX,oBAAM,OAAO,CAAC;AAAA,YAChB,WAAWA,KAAI,GAAG;AAEhB,sBAAQ,KAAK,OAAO,CAAC,CAAC;AACtB,uBAAS,KAAKA,EAAC;AAAA,YACjB;AAAA,UACF;AAGA,cAAIF,aAAY,KAAK,CAAC,GAAG;AACvB,kBAAM,IAAI,MAAM,yDAAyD;AAAA,UAC3E;AACA,cAAI,KAAKH,cAAa,IAAI,GAAG;AAC7B,mBAAS,KAAK,GAAG,aAAa,SAAS,QAAQ,KAAK,YAAY,MAAM;AACpE,gBAAI,KAAK,SAAS,EAAE;AACpB,kBAAM,EAAE,IAAI,CAACE,gBAAe,MAAM,EAAE,EAAE,CAAC,GAAGD,gBAAe,IAAI,QAAQ,EAAE,CAAC,CAAC,CAAC;AAAA,UAC5E;AACA,YAAE,CAAC,IAAI,CAAC,EAAE;AAAA,QACZ,OAAO;AAEL,YAAE,CAAC,IAAI,CAAC,CAAC;AAAA,QACX;AAAA,MACF;AACA,aAAO,IAAIG,aAAY;AAAA,QACrB,MAAM;AAAA,QACN,MAAM,CAAC,MAAM,CAAC;AAAA,MAChB,CAAC;AAAA,IACH;AAAA,EACF,CAAC;;;AC9JD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,gBAAgB,kBAAkB,kBAAkB,eAAe,aAAa;AAChH,MAAI,kBAAiC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,cAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,aAAAC;AAAA,MACA,aAAAC;AAAA,IACF,IAAI;AACJ,QAAI,kBAAkB,sBAAsB;AAAA,MAC1C,aAAAA;AAAA,IACF,CAAC;AA0BD,WAAON,OAAMF,SAAM;AAAA,MACjB,gCAAgC,SAAS,2BAA2B,GAAG,GAAG;AACxE,eAAO,2BAA2B,GAAG,CAAC;AAAA,MACxC;AAAA,MACA,+BAA+B,SAAS,0BAA0B,GAAG,GAAG;AACtE,eAAO,0BAA0B,GAAG,CAAC;AAAA,MACvC;AAAA,MACA,yBAAyB,SAAS,oBAAoB,GAAG,GAAG;AAC1D,YAAI,IAAIG,QAAO,CAAC;AAChB,YAAI,IAAI,0BAA0B,GAAG,CAAC;AACtC,eAAO,EAAE,IAAI,OAAK,EAAE,QAAQ,CAAC;AAAA,MAC/B;AAAA,IACF,CAAC;AACD,aAAS,0BAA0B,GAAG,IAAI;AAKxC,UAAI,IAAI,CAAC,gBAAgB,GAAG,IAAI,IAAI,EAAE,MAAM,IAAI,CAAAM,OAAKA,GAAE,CAAC,CAAC,CAAC;AAC1D,UAAI,IAAI,EAAE;AACV,UAAI,OAAO,EAAE,MAAM,CAAC;AACpB,UAAI,UAAU,EAAE,MAAM,CAAC;AAGvB,eAASC,KAAI,GAAGA,KAAI,SAASA,MAAK;AAChC,YAAI,IAAI,EAAE;AAGV,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,cAAI,IAAI,EAAE,CAAC;AACX,cAAI,CAACH,aAAY,EAAEG,EAAC,EAAEA,EAAC,GAAG,CAAC,GAAG;AAG5B,cAAEA,EAAC,IAAIN,cAAa,EAAEM,EAAC,GAAG,EAAEA,EAAC,EAAEA,EAAC,CAAC;AACjC,qBAAS,IAAIA,KAAI,GAAG,IAAI,SAAS,KAAK;AAEpC,gBAAE,CAAC,IAAIJ,gBAAe,EAAE,CAAC,GAAGD,gBAAe,EAAEK,EAAC,GAAG,EAAE,CAAC,EAAEA,EAAC,CAAC,CAAC;AAAA,YAC3D;AAAA,UACF,WAAW,CAACH,aAAY,EAAEG,EAAC,GAAG,CAAC,GAAG;AAGhC,gBAAI,MAAM,GAAG;AAEX,qBAAO,CAAC;AAAA,YACV,OAAO;AAEL,gBAAE,OAAO,GAAG,CAAC;AACb,mBAAK;AACL,mBAAK;AAAA,YACP;AAAA,UACF,WAAW,MAAM,GAAG;AAGlB,gBAAI,OAAO,CAAC,GAAG,CAAC;AAChB,iBAAKA,EAAC,IAAI;AACV,qBAAS,KAAKA,KAAI,GAAG,KAAK,SAAS,MAAM;AACvC,mBAAK,EAAE,IAAIJ,gBAAe,KAAK,EAAE,GAAG,EAAE,EAAE,EAAEI,EAAC,CAAC;AAAA,YAC9C;AACA,cAAE,KAAK,IAAI;AAAA,UACb;AAAA,QACF;AAAA,MACF;AACA,aAAO,EAAE,IAAI,OAAK,IAAIF,aAAY;AAAA,QAChC,MAAM,EAAE,IAAI,CAAAC,OAAK,CAACA,EAAC,CAAC;AAAA,QACpB,MAAM,CAAC,MAAM,CAAC;AAAA,MAChB,CAAC,CAAC;AAAA,IACJ;AACA,aAAS,2BAA2B,GAAG,IAAI;AAEzC,UAAI,IAAI,CAAC,gBAAgB,GAAG,IAAI,IAAI,EAAE,MAAM,IAAI,CAAAA,OAAKA,GAAE,CAAC,CAAC,CAAC;AAC1D,UAAI,OAAO,EAAE,MAAM,CAAC;AACpB,UAAI,UAAU,EAAE,MAAM,CAAC;AACvB,UAAI,SAAS,EAAE;AACf,UAAIE,SAAQ,EAAE;AACd,UAAI,MAAM,EAAE;AAGZ,eAASD,KAAI,GAAGA,KAAI,SAASA,MAAK;AAChC,YAAI,IAAI,EAAE;AAGV,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,cAAI,IAAI,EAAE,CAAC;AAGX,cAAI,UAAU,CAAC;AACf,cAAI,WAAW,CAAC;AAGhB,cAAI,aAAa,IAAIA,EAAC;AACtB,cAAI,YAAY,IAAIA,KAAI,CAAC;AAGzB,cAAI,MAAM;AACV,mBAAS,IAAI,YAAY,IAAI,WAAW,KAAK;AAC3C,gBAAI,IAAIC,OAAM,CAAC;AAEf,gBAAI,MAAMD,IAAG;AACX,oBAAM,OAAO,CAAC;AAAA,YAChB,WAAW,IAAIA,IAAG;AAEhB,sBAAQ,KAAK,OAAO,CAAC,CAAC;AACtB,uBAAS,KAAK,CAAC;AAAA,YACjB;AAAA,UACF;AACA,cAAI,CAACH,aAAY,KAAK,CAAC,GAAG;AAGxB,cAAEG,EAAC,IAAIN,cAAa,EAAEM,EAAC,GAAG,GAAG;AAC7B,qBAAS,MAAM,GAAG,aAAa,SAAS,QAAQ,MAAM,YAAY,OAAO;AACvE,kBAAI,KAAK,SAAS,GAAG;AACrB,gBAAE,EAAE,IAAIJ,gBAAe,EAAE,EAAE,GAAGD,gBAAe,EAAEK,EAAC,GAAG,QAAQ,GAAG,CAAC,CAAC;AAAA,YAClE;AAAA,UACF,WAAW,CAACH,aAAY,EAAEG,EAAC,GAAG,CAAC,GAAG;AAGhC,gBAAI,MAAM,GAAG;AAEX,qBAAO,CAAC;AAAA,YACV,OAAO;AAEL,gBAAE,OAAO,GAAG,CAAC;AACb,mBAAK;AACL,mBAAK;AAAA,YACP;AAAA,UACF,WAAW,MAAM,GAAG;AAGlB,gBAAI,OAAO,CAAC,GAAG,CAAC;AAChB,iBAAKA,EAAC,IAAI;AACV,qBAAS,MAAM,GAAG,cAAc,SAAS,QAAQ,MAAM,aAAa,OAAO;AACzE,kBAAI,MAAM,SAAS,GAAG;AACtB,mBAAK,GAAG,IAAIJ,gBAAe,KAAK,GAAG,GAAG,QAAQ,GAAG,CAAC;AAAA,YACpD;AACA,cAAE,KAAK,IAAI;AAAA,UACb;AAAA,QACF;AAAA,MACF;AACA,aAAO,EAAE,IAAI,OAAK,IAAIE,aAAY;AAAA,QAChC,MAAM,EAAE,IAAI,CAAAC,OAAK,CAACA,EAAC,CAAC;AAAA,QACpB,MAAM,CAAC,MAAM,CAAC;AAAA,MAChB,CAAC,CAAC;AAAA,IACJ;AAAA,EACF,CAAC;;;ACvLD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,gBAAgB,kBAAkB,kBAAkB,eAAe,aAAa;AAChH,MAAI,kBAAiC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,cAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,aAAAC;AAAA,MACA,aAAAC;AAAA,IACF,IAAI;AACJ,QAAI,kBAAkB,sBAAsB;AAAA,MAC1C,aAAAA;AAAA,IACF,CAAC;AA0BD,WAAON,OAAMF,SAAM;AAAA,MACjB,gCAAgC,SAAS,2BAA2B,GAAG,GAAG;AACxE,eAAO,4BAA4B,GAAG,CAAC;AAAA,MACzC;AAAA,MACA,+BAA+B,SAAS,0BAA0B,GAAG,GAAG;AACtE,eAAO,2BAA2B,GAAG,CAAC;AAAA,MACxC;AAAA,MACA,yBAAyB,SAAS,oBAAoB,GAAG,GAAG;AAC1D,YAAI,IAAIG,QAAO,CAAC;AAChB,YAAI,IAAI,2BAA2B,GAAG,CAAC;AACvC,eAAO,EAAE,IAAI,OAAK,EAAE,QAAQ,CAAC;AAAA,MAC/B;AAAA,IACF,CAAC;AACD,aAAS,2BAA2B,GAAG,IAAI;AAKzC,UAAI,IAAI,CAAC,gBAAgB,GAAG,IAAI,IAAI,EAAE,MAAM,IAAI,CAAAM,OAAKA,GAAE,CAAC,CAAC,CAAC;AAC1D,UAAI,IAAI,EAAE;AACV,UAAI,OAAO,EAAE,MAAM,CAAC;AACpB,UAAI,UAAU,EAAE,MAAM,CAAC;AAGvB,eAASC,KAAI,UAAU,GAAGA,MAAK,GAAGA,MAAK;AACrC,YAAI,IAAI,EAAE;AAGV,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,cAAI,IAAI,EAAE,CAAC;AACX,cAAI,CAACH,aAAY,EAAEG,EAAC,EAAEA,EAAC,GAAG,CAAC,GAAG;AAG5B,cAAEA,EAAC,IAAIN,cAAa,EAAEM,EAAC,GAAG,EAAEA,EAAC,EAAEA,EAAC,CAAC;AACjC,qBAAS,IAAIA,KAAI,GAAG,KAAK,GAAG,KAAK;AAE/B,gBAAE,CAAC,IAAIJ,gBAAe,EAAE,CAAC,GAAGD,gBAAe,EAAEK,EAAC,GAAG,EAAE,CAAC,EAAEA,EAAC,CAAC,CAAC;AAAA,YAC3D;AAAA,UACF,WAAW,CAACH,aAAY,EAAEG,EAAC,GAAG,CAAC,GAAG;AAGhC,gBAAI,MAAM,GAAG;AAEX,qBAAO,CAAC;AAAA,YACV,OAAO;AAEL,gBAAE,OAAO,GAAG,CAAC;AACb,mBAAK;AACL,mBAAK;AAAA,YACP;AAAA,UACF,WAAW,MAAM,GAAG;AAGlB,gBAAI,OAAO,CAAC,GAAG,CAAC;AAChB,iBAAKA,EAAC,IAAI;AACV,qBAAS,KAAKA,KAAI,GAAG,MAAM,GAAG,MAAM;AAClC,mBAAK,EAAE,IAAIJ,gBAAe,KAAK,EAAE,GAAG,EAAE,EAAE,EAAEI,EAAC,CAAC;AAAA,YAC9C;AACA,cAAE,KAAK,IAAI;AAAA,UACb;AAAA,QACF;AAAA,MACF;AACA,aAAO,EAAE,IAAI,OAAK,IAAIF,aAAY;AAAA,QAChC,MAAM,EAAE,IAAI,CAAAC,OAAK,CAACA,EAAC,CAAC;AAAA,QACpB,MAAM,CAAC,MAAM,CAAC;AAAA,MAChB,CAAC,CAAC;AAAA,IACJ;AACA,aAAS,4BAA4B,GAAG,IAAI;AAE1C,UAAI,IAAI,CAAC,gBAAgB,GAAG,IAAI,IAAI,EAAE,MAAM,IAAI,CAAAA,OAAKA,GAAE,CAAC,CAAC,CAAC;AAC1D,UAAI,OAAO,EAAE,MAAM,CAAC;AACpB,UAAI,UAAU,EAAE,MAAM,CAAC;AACvB,UAAI,SAAS,EAAE;AACf,UAAIE,SAAQ,EAAE;AACd,UAAI,MAAM,EAAE;AAGZ,eAASD,KAAI,UAAU,GAAGA,MAAK,GAAGA,MAAK;AACrC,YAAI,IAAI,EAAE;AAGV,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,cAAI,IAAI,EAAE,CAAC;AAGX,cAAI,UAAU,CAAC;AACf,cAAI,WAAW,CAAC;AAGhB,cAAI,aAAa,IAAIA,EAAC;AACtB,cAAI,YAAY,IAAIA,KAAI,CAAC;AAGzB,cAAI,MAAM;AACV,mBAAS,IAAI,YAAY,GAAG,KAAK,YAAY,KAAK;AAChD,gBAAI,IAAIC,OAAM,CAAC;AAEf,gBAAI,MAAMD,IAAG;AACX,oBAAM,OAAO,CAAC;AAAA,YAChB,WAAW,IAAIA,IAAG;AAEhB,sBAAQ,KAAK,OAAO,CAAC,CAAC;AACtB,uBAAS,KAAK,CAAC;AAAA,YACjB;AAAA,UACF;AACA,cAAI,CAACH,aAAY,KAAK,CAAC,GAAG;AAGxB,cAAEG,EAAC,IAAIN,cAAa,EAAEM,EAAC,GAAG,GAAG;AAG7B,qBAAS,MAAM,GAAG,aAAa,SAAS,QAAQ,MAAM,YAAY,OAAO;AACvE,kBAAI,KAAK,SAAS,GAAG;AACrB,gBAAE,EAAE,IAAIJ,gBAAe,EAAE,EAAE,GAAGD,gBAAe,EAAEK,EAAC,GAAG,QAAQ,GAAG,CAAC,CAAC;AAAA,YAClE;AAAA,UACF,WAAW,CAACH,aAAY,EAAEG,EAAC,GAAG,CAAC,GAAG;AAGhC,gBAAI,MAAM,GAAG;AAEX,qBAAO,CAAC;AAAA,YACV,OAAO;AAEL,gBAAE,OAAO,GAAG,CAAC;AACb,mBAAK;AACL,mBAAK;AAAA,YACP;AAAA,UACF,WAAW,MAAM,GAAG;AAGlB,gBAAI,OAAO,CAAC,GAAG,CAAC;AAChB,iBAAKA,EAAC,IAAI;AAGV,qBAAS,MAAM,GAAG,cAAc,SAAS,QAAQ,MAAM,aAAa,OAAO;AACzE,kBAAI,MAAM,SAAS,GAAG;AACtB,mBAAK,GAAG,IAAIJ,gBAAe,KAAK,GAAG,GAAG,QAAQ,GAAG,CAAC;AAAA,YACpD;AACA,cAAE,KAAK,IAAI;AAAA,UACb;AAAA,QACF;AAAA,MACF;AACA,aAAO,EAAE,IAAI,OAAK,IAAIE,aAAY;AAAA,QAChC,MAAM,EAAE,IAAI,CAAAC,OAAK,CAACA,EAAC,CAAC;AAAA,QACpB,MAAM,CAAC,MAAM,CAAC;AAAA,MAChB,CAAC,CAAC;AAAA,IACJ;AAAA,EACF,CAAC;;;AC3LD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,aAAa;AACnC,MAAI,wBAAuC,wBAAQD,SAAMC,iBAAc,UAAQ;AACpF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,aAAAC;AAAA,IACF,IAAI;AAmBJ,WAAO,SAAS,gBAAgB,GAAG,GAAG,UAAU;AAE9C,UAAI,UAAU,EAAE;AAChB,UAAI,SAAS,EAAE;AACf,UAAI,OAAO,EAAE;AACb,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAE7E,UAAI,UAAU,EAAE;AAChB,UAAI,SAAS,EAAE;AACf,UAAI,OAAO,EAAE;AACb,UAAI,QAAQ,EAAE;AACd,UAAI,MAAM,EAAE,aAAa,EAAE,UAAU,SAAY,EAAE,YAAY,EAAE,YAAY;AAG7E,UAAI,MAAM,WAAW,MAAM,QAAQ;AACjC,cAAM,IAAI,eAAe,MAAM,QAAQ,MAAM,MAAM;AAAA,MACrD;AAGA,UAAI,MAAM,CAAC,MAAM,MAAM,CAAC,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAClD,cAAM,IAAI,WAAW,mCAAmC,QAAQ,4BAA4B,QAAQ,GAAG;AAAA,MACzG;AAGA,UAAI,CAAC,WAAW,CAAC,SAAS;AACxB,cAAM,IAAI,MAAM,qDAAqD;AAAA,MACvE;AAGA,UAAI,OAAO,MAAM,CAAC;AAClB,UAAI,UAAU,MAAM,CAAC;AAGrB,UAAI;AAEJ,UAAI,KAAKA;AAET,UAAI,OAAO;AAEX,UAAI,KAAK;AAGT,UAAI,OAAO,QAAQ,YAAY,QAAQ,OAAO,QAAQ,SAAS;AAE7D,aAAK;AAEL,aAAKD,OAAM,KAAKC,cAAa,CAAC,IAAI,EAAE,CAAC;AAErC,eAAOD,OAAM,QAAQ,GAAG,EAAE;AAE1B,aAAKA,OAAM,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;AAAA,MACpC;AAGA,UAAI,UAAU,CAAC;AACf,UAAI,SAAS,CAAC;AACd,UAAI,OAAO,CAAC;AAGZ,UAAI,IAAI,CAAC;AAET,UAAI,IAAI,CAAC;AAGT,UAAI,GAAG,IAAI,IAAIE;AAGf,eAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAEhC,aAAK,CAAC,IAAI,OAAO;AAEjB,YAAI,OAAO,IAAI;AAEf,aAAK,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAExD,UAAAA,KAAI,OAAO,CAAC;AAEZ,YAAEA,EAAC,IAAI;AAEP,YAAEA,EAAC,IAAI,QAAQ,CAAC;AAEhB,iBAAO,KAAKA,EAAC;AAAA,QACf;AAEA,aAAK,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAExD,UAAAA,KAAI,OAAO,CAAC;AAEZ,cAAI,EAAEA,EAAC,MAAM,MAAM;AAEjB,cAAEA,EAAC,IAAI,GAAG,EAAEA,EAAC,GAAG,QAAQ,CAAC,CAAC;AAAA,UAC5B;AAAA,QACF;AAEA,YAAI,KAAK,CAAC;AAEV,eAAO,IAAI,OAAO,QAAQ;AAExB,UAAAA,KAAI,OAAO,CAAC;AAEZ,cAAI,IAAI,EAAEA,EAAC;AAEX,cAAI,CAAC,GAAG,GAAG,IAAI,GAAG;AAEhB,oBAAQ,KAAK,CAAC;AAEd;AAAA,UACF,OAAO;AAEL,mBAAO,OAAO,GAAG,CAAC;AAAA,UACpB;AAAA,QACF;AAAA,MACF;AAEA,WAAK,OAAO,IAAI,OAAO;AAGvB,aAAO,EAAE,mBAAmB;AAAA,QAC1B,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,KAAK;AAAA,QACL,MAAM,CAAC,MAAM,OAAO;AAAA,QACpB,UAAU,QAAQ,EAAE,aAAa,QAAQ,EAAE,YAAY,KAAK;AAAA,MAC9D,CAAC;AAAA,IACH;AAAA,EACF,CAAC;;;ACxJM,MAAI,gCAA+C,wBAAQ,2BAA2B,CAAC,SAAS,QAAQ,GAAG,UAAQ;AACxH,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,WAAO;AAAA,MACL,iBAAiBD,OAAM,QAAQ,uBAAuB,YAAU,CAAC,GAAG,MAAM,OAAOC,QAAO,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC;AAAA,MACxG,oBAAoBD,OAAM,QAAQ,0BAA0B,YAAU,CAAC,GAAG,MAAM,OAAOC,QAAO,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC;AAAA,MAC9G,iBAAiBD,OAAM,QAAQ,uBAAuB,YAAU,CAAC,GAAG,MAAM,OAAO,GAAGC,QAAO,CAAC,CAAC,EAAE,QAAQ,CAAC;AAAA,MACxG,oBAAoBD,OAAM,QAAQ,0BAA0B,YAAU,CAAC,GAAG,MAAM,OAAO,GAAGC,QAAO,CAAC,CAAC,EAAE,QAAQ,CAAC;AAAA,IAChH;AAAA,EACF,CAAC;;;ACDD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,eAAe,SAAS,eAAe,QAAQ;AAC/E,MAAI,kBAAiC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,OAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAL;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAA;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,kBAAkB,sBAAsB;AAAA,MAC1C,OAAAF;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAF;AAAA,MACA,aAAAI;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAJ;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,eAAe,mBAAmB;AAAA,MACpC,OAAAF;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAA;AAAA,MACA,QAAAC;AAAA,MACA,QAAAI;AAAA,IACF,CAAC;AACD,QAAI,0BAA0B,8BAA8B;AAAA,MAC1D,OAAAL;AAAA,MACA,QAAAC;AAAA,IACF,CAAC;AAyBD,WAAOD,OAAMF,SAAM;AAAA,MACjB,kBAAkB;AAAA,MAClB,wBAAwB;AAAA,MACxB,kBAAkB,CAAC,GAAG,MAAM,KAAK;AAAA,MACjC,oCAAoCE,OAAM,YAAY,CAAAM,UAAQ,CAAC,GAAG,MAAM;AAEtE,YAAIJ,aAAY,GAAG,CAAC,GAAG;AACrB,iBAAO,EAAE,MAAM;AAAA,QACjB;AACA,eAAO,cAAc,GAAG,GAAGI,OAAM,KAAK;AAAA,MACxC,CAAC;AAAA,MACD,mCAAmCN,OAAM,YAAY,CAAAM,UAAQ,CAAC,GAAG,MAAM;AAErE,YAAIJ,aAAY,GAAG,CAAC,GAAG;AACrB,iBAAO,EAAE,MAAM;AAAA,QACjB;AACA,eAAO,aAAa,GAAG,GAAGI,OAAM,KAAK;AAAA,MACvC,CAAC;AAAA,MACD,oCAAoCN,OAAM,YAAY,CAAAM,UAAQ,CAAC,GAAG,MAAM;AAEtE,YAAIJ,aAAY,GAAG,CAAC,GAAG;AACrB,iBAAOC,OAAM,EAAE,KAAK,GAAG,EAAE,QAAQ,CAAC;AAAA,QACpC;AACA,eAAO,eAAe,GAAG,GAAGG,OAAM,IAAI;AAAA,MACxC,CAAC;AAAA,MACD,mCAAmCN,OAAM,YAAY,CAAAM,UAAQ,CAAC,GAAG,MAAM;AAErE,YAAIJ,aAAY,GAAG,CAAC,GAAG;AACrB,iBAAOC,OAAM,EAAE,KAAK,GAAG,EAAE,QAAQ,CAAC;AAAA,QACpC;AACA,eAAO,aAAa,GAAG,GAAGG,OAAM,IAAI;AAAA,MACtC,CAAC;AAAA,IACH,GAAG,yBAAyB,qBAAqB;AAAA,MAC/C,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,CAAC;AAAA,EACJ,CAAC;;;ACvGD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,eAAe,SAAS,eAAe,QAAQ;AAC/E,MAAI,wBAAuC,wBAAQD,SAAMC,iBAAc,UAAQ;AACpF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,OAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAL;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAA;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,kBAAkB,sBAAsB;AAAA,MAC1C,OAAAF;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAF;AAAA,MACA,aAAAI;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAJ;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,eAAe,mBAAmB;AAAA,MACpC,OAAAF;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAA;AAAA,MACA,QAAAC;AAAA,MACA,QAAAI;AAAA,IACF,CAAC;AACD,QAAI,0BAA0B,8BAA8B;AAAA,MAC1D,OAAAL;AAAA,MACA,QAAAC;AAAA,IACF,CAAC;AAyBD,WAAOD,OAAMF,SAAM;AAAA,MACjB,kBAAkB;AAAA,MAClB,wBAAwB;AAAA,MACxB,kBAAkB,CAAC,GAAG,MAAM,KAAK;AAAA,MACjC,oCAAoCE,OAAM,YAAY,CAAAM,UAAQ,CAAC,GAAG,MAAM;AAEtE,YAAIJ,aAAY,GAAG,CAAC,GAAG;AACrB,iBAAO,EAAE,MAAM;AAAA,QACjB;AACA,eAAO,cAAc,GAAG,GAAGI,OAAM,KAAK;AAAA,MACxC,CAAC;AAAA,MACD,mCAAmCN,OAAM,YAAY,CAAAM,UAAQ,CAAC,GAAG,MAAM;AAErE,YAAIJ,aAAY,GAAG,CAAC,GAAG;AACrB,iBAAO,EAAE,MAAM;AAAA,QACjB;AACA,eAAO,aAAa,GAAG,GAAGI,OAAM,KAAK;AAAA,MACvC,CAAC;AAAA,MACD,oCAAoCN,OAAM,YAAY,CAAAM,UAAQ,CAAC,GAAG,MAAM;AAEtE,YAAIJ,aAAY,GAAG,CAAC,GAAG;AACrB,iBAAOC,OAAM,EAAE,KAAK,GAAG,EAAE,QAAQ,CAAC;AAAA,QACpC;AACA,eAAO,eAAe,GAAG,GAAGG,OAAM,IAAI;AAAA,MACxC,CAAC;AAAA,MACD,mCAAmCN,OAAM,YAAY,CAAAM,UAAQ,CAAC,GAAG,MAAM;AAErE,YAAIJ,aAAY,GAAG,CAAC,GAAG;AACrB,iBAAOC,OAAM,EAAE,KAAK,GAAG,EAAE,QAAQ,CAAC;AAAA,QACpC;AACA,eAAO,aAAa,GAAG,GAAGG,OAAM,IAAI;AAAA,MACtC,CAAC;AAAA,IACH,GAAG,yBAAyB,qBAAqB;AAAA,MAC/C,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,CAAC;AAAA,EACJ,CAAC;;;ACxGD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,eAAe,SAAS,eAAe,QAAQ;AAC/E,MAAI,sBAAqC,wBAAQD,SAAMC,iBAAc,UAAQ;AAClF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,OAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAL;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAA;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,kBAAkB,sBAAsB;AAAA,MAC1C,OAAAF;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAF;AAAA,MACA,aAAAI;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAJ;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,eAAe,mBAAmB;AAAA,MACpC,OAAAF;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAA;AAAA,MACA,QAAAC;AAAA,MACA,QAAAI;AAAA,IACF,CAAC;AACD,QAAI,0BAA0B,8BAA8B;AAAA,MAC1D,OAAAL;AAAA,MACA,QAAAC;AAAA,IACF,CAAC;AA0BD,WAAOD,OAAMF,SAAM;AAAA,MACjB,kBAAkB;AAAA;AAAA,MAGlB,oCAAoCE,OAAM,YAAY,CAAAM,UAAQ,CAAC,GAAG,MAAM;AAEtE,YAAIJ,aAAY,GAAG,CAAC,GAAG;AACrB,iBAAO,EAAE,MAAM;AAAA,QACjB;AACA,eAAO,cAAc,GAAG,GAAGI,OAAM,KAAK;AAAA,MACxC,CAAC;AAAA,MACD,mCAAmCN,OAAM,YAAY,CAAAM,UAAQ,CAAC,GAAG,MAAM;AAErE,YAAIJ,aAAY,GAAG,CAAC,GAAG;AACrB,iBAAO,EAAE,MAAM;AAAA,QACjB;AACA,eAAO,aAAa,GAAG,GAAGI,OAAM,KAAK;AAAA,MACvC,CAAC;AAAA,MACD,oCAAoCN,OAAM,YAAY,CAAAM,UAAQ,CAAC,GAAG,MAAM;AAEtE,YAAIJ,aAAY,GAAG,CAAC,GAAG;AACrB,iBAAOC,OAAM,EAAE,KAAK,GAAG,EAAE,QAAQ,CAAC;AAAA,QACpC;AACA,eAAO,eAAe,GAAG,GAAGG,OAAM,IAAI;AAAA,MACxC,CAAC;AAAA,MACD,mCAAmCN,OAAM,YAAY,CAAAM,UAAQ,CAAC,GAAG,MAAM;AAErE,YAAIJ,aAAY,GAAG,CAAC,GAAG;AACrB,iBAAOC,OAAM,EAAE,KAAK,GAAG,EAAE,QAAQ,CAAC;AAAA,QACpC;AACA,eAAO,aAAa,GAAG,GAAGG,OAAM,IAAI;AAAA,MACtC,CAAC;AAAA,IACH,GAAG,yBAAyB,qBAAqB;AAAA,MAC/C,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,CAAC;AAAA,EACJ,CAAC;;;AC3GD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,eAAe,SAAS,OAAO,QAAQ;AACvE,MAAI,YAA2B,wBAAQD,SAAMC,iBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAL;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAF;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAF;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,eAAe,mBAAmB;AAAA,MACpC,OAAAF;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAA;AAAA,MACA,QAAAC;AAAA,MACA,QAAAI;AAAA,IACF,CAAC;AA8BD,WAAOL,OAAMF,SAAM;AAAA,MACjB,kBAAkB;AAAA,MAClB,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,gBAAQ,EAAE,OAAO,KAAK,EAAE,OAAO,OAAO,EAAE,OAAO,KAAK,EAAE,OAAO;AAAA,MAC/D;AAAA,MACA,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,eAAO,CAAC,EAAE,OAAO,KAAK,CAAC,EAAE,OAAO,KAAK,CAAC,EAAE,MAAM,KAAK,CAAC,EAAE,MAAM;AAAA,MAC9D;AAAA,MACA,kBAAkB;AAAA,MAClB,cAAcE,OAAM,YAAY,CAAAM,UAAQ,CAAC,GAAG,MAAMA,MAAK,EAAE,SAAS,GAAG,EAAE,SAAS,CAAC,CAAC;AAAA,MAClF,qBAAqBN,OAAM,YAAY,CAAAM,UAAQ,CAAC,GAAG,MAAM;AAEvD,YAAIF,KAAI,CAAC,GAAG;AAEV,iBAAOD,OAAM,EAAE,KAAK,GAAG,EAAE,QAAQ,CAAC;AAAA,QACpC;AACA,eAAO,cAAc,GAAG,GAAGG,OAAM,KAAK;AAAA,MACxC,CAAC;AAAA,MACD,oBAAoBN,OAAM,YAAY,CAAAM,UAAQ,CAAC,GAAG,MAAM;AAEtD,YAAIF,KAAI,CAAC,GAAG;AAEV,iBAAOD,OAAM,EAAE,KAAK,GAAG,EAAE,QAAQ,CAAC;AAAA,QACpC;AACA,eAAO,aAAa,GAAG,GAAGG,OAAM,KAAK;AAAA,MACvC,CAAC;AAAA,MACD,qBAAqBN,OAAM,YAAY,CAAAM,UAAQ,CAAC,GAAG,MAAM;AAEvD,YAAIF,KAAI,CAAC,GAAG;AAEV,iBAAOD,OAAM,EAAE,KAAK,GAAG,EAAE,QAAQ,CAAC;AAAA,QACpC;AACA,eAAO,cAAc,GAAG,GAAGG,OAAM,IAAI;AAAA,MACvC,CAAC;AAAA,MACD,oBAAoBN,OAAM,YAAY,CAAAM,UAAQ,CAAC,GAAG,MAAM;AAEtD,YAAIF,KAAI,CAAC,GAAG;AAEV,iBAAOD,OAAM,EAAE,KAAK,GAAG,EAAE,QAAQ,CAAC;AAAA,QACpC;AACA,eAAO,aAAa,GAAG,GAAGG,OAAM,IAAI;AAAA,MACtC,CAAC;AAAA,MACD,cAAcN,OAAM,YAAY,CAAAM,UAAQ,CAAC,GAAG,MAAM;AAEhD,eAAOA,MAAKL,QAAO,CAAC,GAAG,CAAC,EAAE,QAAQ;AAAA,MACpC,CAAC;AAAA,MACD,cAAcD,OAAM,YAAY,CAAAM,UAAQ,CAAC,GAAG,MAAM;AAEhD,eAAOA,MAAK,GAAGL,QAAO,CAAC,CAAC,EAAE,QAAQ;AAAA,MACpC,CAAC;AAAA,IACH,GAAG,qBAAqB;AAAA,MACtB,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,CAAC;AAAA,EACJ,CAAC;;;ACjHD,MAAIM,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,UAAU,eAAe,aAAa,YAAY,eAAe,QAAQ;AACzG,MAAI,gBAA+B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC5E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,UAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAP;AAAA,IACF,CAAC;AACD,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAA;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAF;AAAA,MACA,aAAAM;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAN;AAAA,MACA,QAAAG;AAAA,MACA,QAAAI;AAAA,IACF,CAAC;AACD,QAAI,eAAe,mBAAmB;AAAA,MACpC,OAAAP;AAAA,IACF,CAAC;AA6CD,WAAOA,OAAMF,SAAM,oBAAoB;AAAA,MACrC,OAAAE;AAAA,MACA,QAAAC;AAAA,IACF,CAAC,GAAG;AAAA,MACF,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,eAAO,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI;AAAA,MACnC;AAAA,MACA,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,eAAOO,aAAe,GAAG,GAAGP,QAAO,QAAQA,QAAO,MAAM,IAAI,IAAIG,WAAU,CAAC,IAAI,IAAIA,WAAU,EAAE,IAAI,CAAC,CAAC;AAAA,MACvG;AAAA,MACA,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,eAAO,MAAM,IAAI,KAAK,IAAI,IAAI,KAAK,CAAC;AAAA,MACtC;AAAA,MACA,sBAAsB,SAAS,kBAAkB,GAAG,GAAG;AACrD,eAAO,IAAIC,UAAS,EAAE,QAAQ,CAAC,CAAC;AAAA,MAClC;AAAA,MACA,oBAAoB,SAAS,kBAAkB;AAC7C,cAAM,IAAI,UAAU,qDAAqD;AAAA,MAC3E;AAAA,IACF,GAAG,cAAc,qBAAqB;AAAA,MACpC,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,CAAC;AAAA,EACJ,CAAC;AACM,MAAI,sBAAqC,wBAAQP,SAAM,CAAC,SAAS,QAAQ,GAAG,WAAS;AAC1F,QAAI;AAAA,MACF,OAAAE;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,WAAOD,OAAMF,SAAM;AAAA,MACjB,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,eAAO,YAAY,GAAG,GAAGG,QAAO,QAAQA,QAAO,MAAM,IAAI,IAAI,IAAI,IAAI,IAAI;AAAA,MAC3E;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACvHD,uCAAwB;AAGxB,MAAIQ,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,SAAS;AAC/B,MAAI,uBAAsC,wBAAQD,SAAMC,iBAAc,UAAQ;AACnF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,SAAAC;AAAA,IACF,IAAI;AACJ,QAAI,kBAAkBA,SAAQ,WAAW,iBAAiB;AA4E1D,WAAOD,OAAMF,SAAM;AAAA,MACjB,YAAY;AAAA,IACd,CAAC;AAED,aAAS,gBAAgB,GAAG,GAAG;AAC7B,UAAI,QAAQ,OAAO,CAAC;AACpB,UAAI,QAAQ,OAAO,CAAC;AACpB,UAAI;AAGJ,WAAK,UAAU,YAAY,UAAU,eAAe,UAAU,cAAc,UAAU,cAAc,UAAU,YAAY,UAAU,eAAe,UAAU,cAAc,UAAU,WAAW;AAC9L,YAAIG,SAAQ,GAAG,CAAC;AAChB,YAAI,EAAE,SAAS,MAAM,KAAK;AAExB,iBAAO,IAAI,IAAI,IAAI;AAAA,QACrB,OAAO;AACL,qBAAO,+BAAAC,SAAY,OAAO,KAAK;AAAA,QACjC;AAAA,MACF;AAGA,UAAI,WAAW,CAAC,SAAS,eAAe,cAAc;AACtD,UAAI,SAAS,SAAS,KAAK,KAAK,SAAS,SAAS,KAAK,GAAG;AACxD,YAAI,yBAAyB,iBAAiB,GAAG,CAAC;AAClD,YAAI,MAAM,GAAG;AACX,iBAAO;AAAA,QACT,OAAO;AACL,qBAAO,+BAAAA,SAAY,OAAO,KAAK;AAAA,QACjC;AAAA,MACF;AAGA,UAAI,UAAU,OAAO;AACnB,mBAAO,+BAAAA,SAAY,OAAO,KAAK;AAAA,MACjC;AACA,UAAI,UAAU,WAAW;AACvB,eAAO,sBAAsB,GAAG,CAAC;AAAA,MACnC;AACA,UAAI,UAAU,QAAQ;AACpB,YAAI,EAAE,UAAU,CAAC,GAAG;AAClB,iBAAO,gBAAgB,EAAE,OAAO,EAAE,KAAK;AAAA,QACzC;AAGA,eAAO,cAAc,iBAAiB,EAAE,YAAY,GAAG,EAAE,YAAY,CAAC;AAAA,MACxE;AACA,UAAI,UAAU,WAAW;AACvB,eAAO,gBAAgB,GAAG,CAAC;AAAA,MAC7B;AACA,UAAI,UAAU,UAAU;AACtB,mBAAO,+BAAAA,SAAY,GAAG,CAAC;AAAA,MACzB;AACA,UAAI,UAAU,UAAU;AACtB,eAAO,eAAe,iBAAiB,GAAG,CAAC;AAAA,MAC7C;AACA,UAAI,UAAU,QAAQ;AACpB,eAAO;AAAA,MACT;AACA,UAAI,UAAU,aAAa;AACzB,eAAO;AAAA,MACT;AAGA,YAAM,IAAI,UAAU,gCAAgC,QAAQ,GAAG;AAAA,IACjE;AASA,aAAS,yBAAyBC,iBAAgB,GAAG,GAAG;AACtD,UAAI,eAAe,CAAC,KAAK,eAAe,CAAC,GAAG;AAC1C,eAAO,cAAcA,iBAAgB,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM;AAAA,MAC3E;AACA,UAAI,eAAe,CAAC,GAAG;AAErB,eAAO,yBAAyBA,iBAAgB,EAAE,QAAQ,GAAG,CAAC;AAAA,MAChE;AACA,UAAI,eAAe,CAAC,GAAG;AAErB,eAAO,yBAAyBA,iBAAgB,GAAG,EAAE,QAAQ,CAAC;AAAA,MAChE;AAGA,UAAI,cAAc,CAAC,GAAG;AACpB,eAAO,yBAAyBA,iBAAgB,EAAE,OAAO,EAAE,MAAM,CAAC;AAAA,MACpE;AACA,UAAI,cAAc,CAAC,GAAG;AACpB,eAAO,yBAAyBA,iBAAgB,GAAG,EAAE,OAAO,EAAE,IAAI;AAAA,MACpE;AAGA,UAAI,CAAC,MAAM,QAAQ,CAAC,GAAG;AACrB,eAAO,yBAAyBA,iBAAgB,CAAC,CAAC,GAAG,CAAC;AAAA,MACxD;AACA,UAAI,CAAC,MAAM,QAAQ,CAAC,GAAG;AACrB,eAAO,yBAAyBA,iBAAgB,GAAG,CAAC,CAAC,CAAC;AAAA,MACxD;AACA,aAAO,cAAcA,iBAAgB,GAAG,CAAC;AAAA,IAC3C;AAaA,aAAS,cAAcA,iBAAgB,GAAG,GAAG;AAE3C,eAASC,KAAI,GAAG,KAAK,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM,GAAGA,KAAI,IAAIA,MAAK;AAC9D,YAAI,IAAID,gBAAe,EAAEC,EAAC,GAAG,EAAEA,EAAC,CAAC;AACjC,YAAI,MAAM,GAAG;AACX,iBAAO;AAAA,QACT;AAAA,MACF;AAGA,UAAI,EAAE,SAAS,EAAE,QAAQ;AACvB,eAAO;AAAA,MACT;AACA,UAAI,EAAE,SAAS,EAAE,QAAQ;AACvB,eAAO;AAAA,MACT;AAGA,aAAO;AAAA,IACT;AAYA,aAAS,eAAeD,iBAAgB,GAAG,GAAG;AAC5C,UAAI,QAAQ,OAAO,KAAK,CAAC;AACzB,UAAI,QAAQ,OAAO,KAAK,CAAC;AAGzB,YAAM,KAAK,+BAAAD,OAAW;AACtB,YAAM,KAAK,+BAAAA,OAAW;AACtB,UAAI,IAAI,cAAcC,iBAAgB,OAAO,KAAK;AAClD,UAAI,MAAM,GAAG;AACX,eAAO;AAAA,MACT;AAGA,eAASC,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AACrC,YAAI,IAAID,gBAAe,EAAE,MAAMC,EAAC,CAAC,GAAG,EAAE,MAAMA,EAAC,CAAC,CAAC;AAC/C,YAAI,MAAM,GAAG;AACX,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,EACF,CAAC;AAYD,WAAS,sBAAsB,GAAG,GAAG;AACnC,QAAI,EAAE,KAAK,EAAE,IAAI;AACf,aAAO;AAAA,IACT;AACA,QAAI,EAAE,KAAK,EAAE,IAAI;AACf,aAAO;AAAA,IACT;AACA,QAAI,EAAE,KAAK,EAAE,IAAI;AACf,aAAO;AAAA,IACT;AACA,QAAI,EAAE,KAAK,EAAE,IAAI;AACf,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;;;ACpRA,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,QAAQ;AAC/C,cAAa,YAAY;AAClB,MAAI,oBAAmC,wBAAQD,SAAMC,iBAAc,UAAQ;AAChF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAF;AAAA,MACA,QAAAC;AAAA,MACA,QAAAC;AAAA,IACF,CAAC;AA8BD,WAAOF,OAAMF,SAAM,aAAc,qBAAqB;AAAA,MACpD,MAAM;AAAA,MACN,IAAI;AAAA,IACN,CAAC,CAAC;AAAA,EACJ,CAAC;;;AC7CD,MAAIK,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,eAAe,eAAe,cAAc;AAC5E,MAAI,cAA6B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,MACA,cAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAL;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAA;AAAA,MACA,cAAAK;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAL;AAAA,MACA,aAAAG;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAH;AAAA,MACA,QAAAC;AAAA,IACF,CAAC;AA2DD,WAAOD,OAAMF,SAAM,kBAAkB;AAAA,MACnC,OAAAE;AAAA,MACA,aAAAE;AAAA,IACF,CAAC,GAAG,qBAAqB;AAAA,MACvB,MAAMA;AAAA,MACN,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,CAAC;AAAA,EACJ,CAAC;AACM,MAAI,oBAAoB,QAAQJ,SAAM,CAAC,SAAS,aAAa,GAAG,WAAS;AAC9E,QAAI;AAAA,MACF,OAAAE;AAAA,MACA,aAAAE;AAAA,IACF,IAAI;AACJ,WAAOF,OAAMF,SAAM;AAAA,MACjB,YAAY,SAAS,QAAQ,GAAG,GAAG;AAEjC,YAAI,MAAM,MAAM;AACd,iBAAO,MAAM;AAAA,QACf;AACA,YAAI,MAAM,MAAM;AACd,iBAAO,MAAM;AAAA,QACf;AACA,YAAI,MAAM,QAAW;AACnB,iBAAO,MAAM;AAAA,QACf;AACA,YAAI,MAAM,QAAW;AACnB,iBAAO,MAAM;AAAA,QACf;AACA,eAAOI,aAAY,GAAG,CAAC;AAAA,MACzB;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACzHD,MAAII,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,eAAe,QAAQ;AAC7C,MAAI,kBAAiC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AA2BJ,WAAOF,OAAMF,SAAM;AAAA,MACjB,YAAY,SAAS,QAAQ,GAAG,GAAG;AACjC,eAAOI,QAAOD,aAAY,GAAG,CAAC,CAAC;AAAA,MACjC;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AChCD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,aAAa,UAAU,eAAe,UAAU,cAAc;AAC9F,MAAI,gBAA+B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC5E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,MACA,cAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAN;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAA;AAAA,MACA,cAAAM;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAN;AAAA,MACA,aAAAI;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAJ;AAAA,MACA,QAAAG;AAAA,MACA,QAAAE;AAAA,IACF,CAAC;AACD,QAAI,eAAe,mBAAmB;AAAA,MACpC,OAAAL;AAAA,IACF,CAAC;AAiCD,aAAS,cAAc,GAAG,GAAG;AAC3B,aAAO,EAAE,GAAG,CAAC,KAAK,CAACO,aAAe,GAAG,GAAGN,QAAO,QAAQA,QAAO,MAAM;AAAA,IACtE;AACA,WAAOD,OAAMF,SAAM,oBAAoB;AAAA,MACrC,OAAAE;AAAA,MACA,QAAAC;AAAA,IACF,CAAC,GAAG;AAAA,MACF,oBAAoB,CAAC,GAAG,MAAM,IAAI;AAAA,MAClC,wBAAwB;AAAA,MACxB,kBAAkB,CAAC,GAAG,MAAM,IAAI;AAAA,MAChC,sBAAsB,CAAC,GAAG,MAAM,EAAE,QAAQ,CAAC,MAAM;AAAA,MACjD,uBAAuB,SAAS,mBAAmB,GAAG,GAAG;AACvD,eAAO,cAAcC,WAAU,CAAC,GAAG,CAAC;AAAA,MACtC;AAAA,MACA,uBAAuB,SAAS,mBAAmB,GAAG,GAAG;AACvD,eAAO,cAAc,GAAGA,WAAU,CAAC,CAAC;AAAA,MACtC;AAAA,MACA,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,cAAM,IAAI,UAAU,qDAAqD;AAAA,MAC3E;AAAA,IACF,GAAG,cAAc,qBAAqB;AAAA,MACpC,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,CAAC;AAAA,EACJ,CAAC;AACM,MAAI,sBAAqC,wBAAQJ,SAAM,CAAC,SAAS,QAAQ,GAAG,WAAS;AAC1F,QAAI;AAAA,MACF,OAAAE;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,WAAOD,OAAMF,SAAM;AAAA,MACjB,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,eAAO,IAAI,KAAK,CAAC,YAAY,GAAG,GAAGG,QAAO,QAAQA,QAAO,MAAM;AAAA,MACjE;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACnGD,MAAIO,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,UAAU,eAAe,UAAU,cAAc;AACjF,MAAI,kBAAiC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,MACA,cAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAL;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAA;AAAA,MACA,cAAAK;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAL;AAAA,MACA,aAAAG;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAH;AAAA,MACA,QAAAE;AAAA,MACA,QAAAE;AAAA,IACF,CAAC;AACD,QAAI,eAAe,mBAAmB;AAAA,MACpC,OAAAJ;AAAA,IACF,CAAC;AA6BD,WAAOA,OAAMF,SAAM,sBAAsB;AAAA,MACvC,OAAAE;AAAA,MACA,QAAAC;AAAA,IACF,CAAC,GAAG;AAAA,MACF,oBAAoB,CAAC,GAAG,MAAM,KAAK;AAAA,MACnC,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,eAAO,EAAE,IAAI,CAAC,KAAKK,aAAe,GAAG,GAAGL,QAAO,QAAQA,QAAO,MAAM;AAAA,MACtE;AAAA,MACA,kBAAkB,CAAC,GAAG,MAAM,KAAK;AAAA,MACjC,sBAAsB,CAAC,GAAG,MAAM,EAAE,QAAQ,CAAC,MAAM;AAAA,MACjD,oBAAoB,SAAS,kBAAkB;AAC7C,cAAM,IAAI,UAAU,qDAAqD;AAAA,MAC3E;AAAA,IACF,GAAG,cAAc,qBAAqB;AAAA,MACpC,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,CAAC;AAAA,EACJ,CAAC;AACM,MAAI,wBAAuC,wBAAQH,SAAM,CAAC,SAAS,QAAQ,GAAG,WAAS;AAC5F,QAAI;AAAA,MACF,OAAAE;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,WAAOD,OAAMF,SAAM;AAAA,MACjB,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,eAAO,KAAK,KAAK,YAAY,GAAG,GAAGG,QAAO,QAAQA,QAAO,MAAM;AAAA,MACjE;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACvFD,MAAIM,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,aAAa,UAAU,eAAe,UAAU,cAAc;AAC9F,MAAI,eAA8B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,MACA,cAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAN;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAA;AAAA,MACA,cAAAM;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAN;AAAA,MACA,aAAAI;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAJ;AAAA,MACA,QAAAG;AAAA,MACA,QAAAE;AAAA,IACF,CAAC;AACD,QAAI,eAAe,mBAAmB;AAAA,MACpC,OAAAL;AAAA,IACF,CAAC;AAiCD,aAAS,aAAa,GAAG,GAAG;AAC1B,aAAO,EAAE,GAAG,CAAC,KAAK,CAACO,aAAe,GAAG,GAAGN,QAAO,QAAQA,QAAO,MAAM;AAAA,IACtE;AACA,WAAOD,OAAMF,SAAM,mBAAmB;AAAA,MACpC,OAAAE;AAAA,MACA,QAAAC;AAAA,IACF,CAAC,GAAG;AAAA,MACF,oBAAoB,CAAC,GAAG,MAAM,IAAI;AAAA,MAClC,wBAAwB;AAAA,MACxB,kBAAkB,CAAC,GAAG,MAAM,IAAI;AAAA,MAChC,sBAAsB,CAAC,GAAG,MAAM,EAAE,QAAQ,CAAC,MAAM;AAAA,MACjD,uBAAuB,SAAS,mBAAmB,GAAG,GAAG;AACvD,eAAO,aAAaC,WAAU,CAAC,GAAG,CAAC;AAAA,MACrC;AAAA,MACA,uBAAuB,SAAS,mBAAmB,GAAG,GAAG;AACvD,eAAO,aAAa,GAAGA,WAAU,CAAC,CAAC;AAAA,MACrC;AAAA,MACA,oBAAoB,SAAS,kBAAkB;AAC7C,cAAM,IAAI,UAAU,qDAAqD;AAAA,MAC3E;AAAA,IACF,GAAG,cAAc,qBAAqB;AAAA,MACpC,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,CAAC;AAAA,EACJ,CAAC;AACM,MAAI,qBAAoC,wBAAQJ,SAAM,CAAC,SAAS,QAAQ,GAAG,WAAS;AACzF,QAAI;AAAA,MACF,OAAAE;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,WAAOD,OAAMF,SAAM;AAAA,MACjB,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,eAAO,IAAI,KAAK,CAAC,YAAY,GAAG,GAAGG,QAAO,QAAQA,QAAO,MAAM;AAAA,MACjE;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACnGD,MAAIO,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,UAAU,eAAe,UAAU,cAAc;AACjF,MAAI,iBAAgC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC7E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,MACA,cAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAL;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAA;AAAA,MACA,cAAAK;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAL;AAAA,MACA,aAAAG;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAH;AAAA,MACA,QAAAE;AAAA,MACA,QAAAE;AAAA,IACF,CAAC;AACD,QAAI,eAAe,mBAAmB;AAAA,MACpC,OAAAJ;AAAA,IACF,CAAC;AA6BD,WAAOA,OAAMF,SAAM,qBAAqB;AAAA,MACtC,OAAAE;AAAA,MACA,QAAAC;AAAA,IACF,CAAC,GAAG;AAAA,MACF,oBAAoB,CAAC,GAAG,MAAM,KAAK;AAAA,MACnC,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,eAAO,EAAE,IAAI,CAAC,KAAKK,aAAe,GAAG,GAAGL,QAAO,QAAQA,QAAO,MAAM;AAAA,MACtE;AAAA,MACA,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,eAAO,KAAK;AAAA,MACd;AAAA,MACA,sBAAsB,CAAC,GAAG,MAAM,EAAE,QAAQ,CAAC,MAAM;AAAA,MACjD,oBAAoB,SAAS,kBAAkB;AAC7C,cAAM,IAAI,UAAU,qDAAqD;AAAA,MAC3E;AAAA,IACF,GAAG,cAAc,qBAAqB;AAAA,MACpC,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,CAAC;AAAA,EACJ,CAAC;AACM,MAAI,uBAAsC,wBAAQH,SAAM,CAAC,SAAS,QAAQ,GAAG,WAAS;AAC3F,QAAI;AAAA,MACF,OAAAE;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,WAAOD,OAAMF,SAAM;AAAA,MACjB,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,eAAO,KAAK,KAAK,YAAY,GAAG,GAAGG,QAAO,QAAQA,QAAO,MAAM;AAAA,MACjE;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AChGD,MAAIM,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO;AAC7B,MAAI,kBAAiC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,OAAAC;AAAA,IACF,IAAI;AAmCJ,WAAOD,OAAMF,SAAM;AAAA,MACjB,YAAY,SAAS,QAAQ,GAAG,GAAG;AACjC,eAAO,WAAW,EAAE,QAAQ,GAAG,EAAE,QAAQ,CAAC;AAAA,MAC5C;AAAA,IACF,CAAC;AAQD,aAAS,WAAW,GAAG,GAAG;AACxB,UAAI,MAAM,QAAQ,CAAC,GAAG;AACpB,YAAI,MAAM,QAAQ,CAAC,GAAG;AACpB,cAAI,MAAM,EAAE;AACZ,cAAI,QAAQ,EAAE,QAAQ;AACpB,mBAAO;AAAA,UACT;AACA,mBAASI,KAAI,GAAGA,KAAI,KAAKA,MAAK;AAC5B,gBAAI,CAAC,WAAW,EAAEA,EAAC,GAAG,EAAEA,EAAC,CAAC,GAAG;AAC3B,qBAAO;AAAA,YACT;AAAA,UACF;AACA,iBAAO;AAAA,QACT,OAAO;AACL,iBAAO;AAAA,QACT;AAAA,MACF,OAAO;AACL,YAAI,MAAM,QAAQ,CAAC,GAAG;AACpB,iBAAO;AAAA,QACT,OAAO;AACL,iBAAOD,OAAM,GAAG,CAAC;AAAA,QACnB;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAC;;;ACzED,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,eAAe,UAAU,eAAe,UAAU,cAAc;AAChG,MAAI,gBAA+B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC5E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,MACA,cAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAN;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAA;AAAA,MACA,cAAAM;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAN;AAAA,MACA,aAAAI;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAJ;AAAA,MACA,QAAAG;AAAA,MACA,QAAAE;AAAA,IACF,CAAC;AAyDD,WAAOL,OAAMF,SAAM,oBAAoB;AAAA,MACrC,OAAAE;AAAA,MACA,aAAAE;AAAA,IACF,CAAC,GAAG,qBAAqB;AAAA,MACvB,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,CAAC;AACF,aAAS,SAAS,GAAG,GAAG;AACtB,aAAO,CAACA,aAAY,GAAG,CAAC;AAAA,IAC1B;AAAA,EACF,CAAC;AACM,MAAI,sBAAsB,QAAQJ,SAAM,CAAC,SAAS,aAAa,GAAG,WAAS;AAChF,QAAI;AAAA,MACF,OAAAE;AAAA,MACA,aAAAE;AAAA,IACF,IAAI;AACJ,WAAOF,OAAMF,SAAM;AAAA,MACjB,YAAY,SAAS,QAAQ,GAAG,GAAG;AAEjC,YAAI,MAAM,MAAM;AACd,iBAAO,MAAM;AAAA,QACf;AACA,YAAI,MAAM,MAAM;AACd,iBAAO,MAAM;AAAA,QACf;AACA,YAAI,MAAM,QAAW;AACnB,iBAAO,MAAM;AAAA,QACf;AACA,YAAI,MAAM,QAAW;AACnB,iBAAO,MAAM;AAAA,QACf;AACA,eAAO,CAACI,aAAY,GAAG,CAAC;AAAA,MAC1B;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC1HD,MAAIK,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,aAAa,SAAS,SAAS;AACrD,MAAI,wBAAuC,wBAAQD,SAAMC,iBAAc,UAAQ;AACpF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAAC;AAAA,MACA,OAAO;AAAA,MACP,SAAAC;AAAA,IACF,IAAI;AACJ,QAAI,MAAMA;AACV,QAAI,OAAO,CAAC,GAAG,MAAM,CAACA,SAAQ,GAAG,CAAC;AAuClC,WAAOF,OAAMF,SAAM;AAAA,MACjB,0BAA0B,SAAS,qBAAqB,GAAG,GAAG;AAC5D,eAAO,iBAAiB,GAAG,GAAG,GAAG;AAAA,MACnC;AAAA,MACA,kCAAkC,SAAS,4BAA4B,GAAG,GAAGI,UAAS;AACpF,YAAIA,aAAY,OAAO;AACrB,iBAAO,iBAAiB,GAAG,GAAG,GAAG;AAAA,QACnC,WAAWA,aAAY,QAAQ;AAC7B,iBAAO,iBAAiB,GAAG,GAAG,IAAI;AAAA,QACpC,OAAO;AACL,gBAAM,IAAI,MAAM,wCAAwC;AAAA,QAC1D;AAAA,MACF;AAAA,MACA,oCAAoC;AAAA,IACtC,CAAC;AACD,aAAS,iBAAiB,GAAG,GAAGA,UAAS;AACvC,UAAI,CAAC,UAAU,CAAC,KAAK,IAAI,GAAG;AAC1B,cAAM,IAAI,MAAM,kCAAkC;AAAA,MACpD;AACA,UAAI,SAAS,CAAC,GAAG;AACf,YAAIC,QAAO,EAAE,KAAK;AAClB,YAAIA,MAAK,SAAS,GAAG;AACnB,gBAAM,IAAI,MAAM,yCAAyC;AAAA,QAC3D;AACA,eAAO,YAAY,EAAE,QAAQ,GAAG,GAAGD,QAAO;AAAA,MAC5C;AACA,UAAI,MAAM,QAAQ,CAAC,GAAG;AACpB,eAAO,YAAY,GAAG,GAAGA,QAAO;AAAA,MAClC;AAAA,IACF;AAYA,aAAS,YAAY,KAAK,GAAGA,UAAS;AACpC,UAAI,KAAK,IAAI,QAAQ;AACnB,cAAM,IAAI,MAAM,iBAAiB;AAAA,MACnC;AAGA,eAASE,KAAI,GAAGA,KAAI,IAAI,QAAQA,MAAK;AACnC,YAAIH,WAAU,IAAIG,EAAC,CAAC,KAAK,UAAU,IAAIA,EAAC,CAAC,GAAG;AAC1C,iBAAO,IAAIA,EAAC;AAAA,QACd;AAAA,MACF;AACA,UAAI,OAAO;AACX,UAAIC,MAAK,IAAI,SAAS;AAGtB,aAAO,OAAOA,KAAI;AAChB,YAAI,IAAI;AACR,YAAI,IAAIA;AACR,YAAI,QAAQ,IAAI,KAAK,MAAM,KAAK,OAAO,KAAKA,MAAK,OAAO,EAAE,IAAI,IAAI;AAGlE,eAAO,IAAI,GAAG;AAEZ,cAAIH,SAAQ,IAAI,CAAC,GAAG,KAAK,KAAK,GAAG;AAE/B,gBAAI,MAAM,IAAI,CAAC;AACf,gBAAI,CAAC,IAAI,IAAI,CAAC;AACd,gBAAI,CAAC,IAAI;AACT,cAAE;AAAA,UACJ,OAAO;AAEL,cAAE;AAAA,UACJ;AAAA,QACF;AAGA,YAAIA,SAAQ,IAAI,CAAC,GAAG,KAAK,IAAI,GAAG;AAC9B,YAAE;AAAA,QACJ;AAGA,YAAI,KAAK,GAAG;AACV,UAAAG,MAAK;AAAA,QACP,OAAO;AACL,iBAAO,IAAI;AAAA,QACb;AAAA,MACF;AACA,aAAO,IAAI,CAAC;AAAA,IACd;AAAA,EACF,CAAC;;;AC5ID,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,WAAW,gBAAgB;AAC3D,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,MACA,gBAAAC;AAAA,IACF,IAAI;AACJ,QAAI,aAAaD;AACjB,QAAI,cAAc,CAAC,GAAG,MAAM,CAACA,SAAQ,GAAG,CAAC;AAiCzC,WAAOF,OAAMF,SAAM;AAAA,MACjB,OAAO,SAASM,OAAM,GAAG;AACvB,uBAAe,CAAC;AAChB,eAAO,EAAE,KAAK,UAAU;AAAA,MAC1B;AAAA,MACA,QAAQ,SAASC,QAAO,GAAG;AACzB,wBAAgB,CAAC;AACjB,eAAOJ,QAAO,EAAE,QAAQ,EAAE,KAAK,UAAU,GAAG,EAAE,QAAQ,CAAC;AAAA,MACzD;AAAA,MACA,mBAAmB,SAAS,eAAe,GAAGK,cAAa;AACzD,uBAAe,CAAC;AAChB,eAAO,EAAE,KAAKA,YAAW;AAAA,MAC3B;AAAA,MACA,oBAAoB,SAAS,gBAAgB,GAAGA,cAAa;AAC3D,wBAAgB,CAAC;AACjB,eAAOL,QAAO,EAAE,QAAQ,EAAE,KAAKK,YAAW,GAAG,EAAE,QAAQ,CAAC;AAAA,MAC1D;AAAA,MACA,iBAAiB,SAAS,aAAa,GAAG,OAAO;AAC/C,uBAAe,CAAC;AAChB,eAAO,EAAE,KAAK,YAAY,KAAK,CAAC;AAAA,MAClC;AAAA,MACA,kBAAkB,SAAS,cAAc,GAAG,OAAO;AACjD,wBAAgB,CAAC;AACjB,eAAOL,QAAO,EAAE,QAAQ,EAAE,KAAK,YAAY,KAAK,CAAC,GAAG,EAAE,QAAQ,CAAC;AAAA,MACjE;AAAA,IACF,CAAC;AAOD,aAAS,YAAY,OAAO;AAC1B,UAAI,UAAU,OAAO;AACnB,eAAO;AAAA,MACT,WAAW,UAAU,QAAQ;AAC3B,eAAO;AAAA,MACT,WAAW,UAAU,WAAW;AAC9B,eAAOE;AAAA,MACT,OAAO;AACL,cAAM,IAAI,MAAM,6CAA6C;AAAA,MAC/D;AAAA,IACF;AAQA,aAAS,eAAe,OAAO;AAC7B,UAAI,UAAK,KAAK,EAAE,WAAW,GAAG;AAC5B,cAAM,IAAI,MAAM,gCAAgC;AAAA,MAClD;AAAA,IACF;AAQA,aAAS,gBAAgBF,SAAQ;AAC/B,UAAIA,QAAO,KAAK,EAAE,WAAW,GAAG;AAC9B,cAAM,IAAI,MAAM,iCAAiC;AAAA,MACnD;AAAA,IACF;AAAA,EACF,CAAC;;;AC5GD,MAAIM,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,WAAW,UAAU,OAAO;AAC5D,MAAI,YAA2B,wBAAQD,SAAMC,iBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,MACA,QAAAC;AAAA,MACA,OAAO;AAAA,IACT,IAAI;AAgCJ,WAAOH,OAAMF,SAAM;AAAA;AAAA,MAEjB,kBAAkB;AAAA;AAAA,MAElB,sCAAsC,SAAS,gCAAgC,OAAO,KAAK;AACzF,eAAO,OAAO,OAAO,IAAI,QAAQ,GAAG,QAAQ;AAAA,MAC9C;AAAA;AAAA,MAEA,OAAO,SAAS,EAAE,MAAM;AACtB,YAAI,oBAAoB,IAAI,GAAG;AAC7B,gBAAM,IAAI,UAAU,wCAAwC;AAAA,QAC9D;AACA,eAAO,KAAK,IAAI;AAAA,MAClB;AAAA,IACF,CAAC;AASD,aAAS,SAAS,GAAG,GAAG;AACtB,UAAI;AACF,eAAOK,QAAO,GAAG,CAAC,IAAI,IAAI;AAAA,MAC5B,SAAS,KAAK;AACZ,cAAM,oBAAoB,KAAK,OAAO,CAAC;AAAA,MACzC;AAAA,IACF;AAQA,aAAS,KAAK,OAAO;AACnB,UAAI;AACJ,MAAAC,aAAY,OAAO,SAAU,OAAO;AAClC,YAAI;AACF,cAAI,UAAU,KAAK,GAAG;AACpB,kBAAM;AAAA,UACR,WAAW,QAAQ,UAAaD,QAAO,OAAO,GAAG,GAAG;AAClD,kBAAM;AAAA,UACR;AAAA,QACF,SAAS,KAAK;AACZ,gBAAM,oBAAoB,KAAK,OAAO,KAAK;AAAA,QAC7C;AAAA,MACF,CAAC;AACD,UAAI,QAAQ,QAAW;AACrB,cAAM,IAAI,MAAM,wCAAwC;AAAA,MAC1D;AAGA,UAAI,OAAO,QAAQ,UAAU;AAC3B,cAAMD,SAAQ,KAAK,eAAe,KAAKD,OAAM,CAAC;AAAA,MAChD;AACA,aAAO;AAAA,IACT;AAAA,EACF,CAAC;;;ACrGD,MAAII,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,WAAW,WAAW,OAAO;AAC7D,MAAI,YAA2B,wBAAQD,SAAMC,iBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,MACA,SAAAC;AAAA,MACA,OAAO;AAAA,IACT,IAAI;AAgCJ,WAAOH,OAAMF,SAAM;AAAA;AAAA,MAEjB,kBAAkB;AAAA;AAAA,MAElB,sCAAsC,SAAS,gCAAgC,OAAO,KAAK;AACzF,eAAO,OAAO,OAAO,IAAI,QAAQ,GAAG,SAAS;AAAA,MAC/C;AAAA;AAAA,MAEA,OAAO,SAAS,EAAE,MAAM;AACtB,YAAI,oBAAoB,IAAI,GAAG;AAC7B,gBAAM,IAAI,UAAU,wCAAwC;AAAA,QAC9D;AACA,eAAO,KAAK,IAAI;AAAA,MAClB;AAAA,IACF,CAAC;AASD,aAAS,UAAU,GAAG,GAAG;AACvB,UAAI;AACF,eAAOK,SAAQ,GAAG,CAAC,IAAI,IAAI;AAAA,MAC7B,SAAS,KAAK;AACZ,cAAM,oBAAoB,KAAK,OAAO,CAAC;AAAA,MACzC;AAAA,IACF;AAQA,aAAS,KAAK,OAAO;AACnB,UAAIC;AACJ,MAAAC,aAAY,OAAO,SAAU,OAAO;AAClC,YAAI;AACF,cAAI,UAAU,KAAK,GAAG;AACpB,YAAAD,OAAM;AAAA,UACR,WAAWA,SAAQ,UAAaD,SAAQ,OAAOC,IAAG,GAAG;AACnD,YAAAA,OAAM;AAAA,UACR;AAAA,QACF,SAAS,KAAK;AACZ,gBAAM,oBAAoB,KAAK,OAAO,KAAK;AAAA,QAC7C;AAAA,MACF,CAAC;AACD,UAAIA,SAAQ,QAAW;AACrB,cAAM,IAAI,MAAM,wCAAwC;AAAA,MAC1D;AAGA,UAAI,OAAOA,SAAQ,UAAU;AAC3B,QAAAA,OAAMF,SAAQE,MAAK,eAAeA,MAAKH,OAAM,CAAC;AAAA,MAChD;AACA,aAAOG;AAAA,IACT;AAAA,EACF,CAAC;;;ACtGD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,WAAW,aAAa;AACrC,MAAI,kCAAiD,wBAAQD,SAAMC,iBAAc,UAAQ;AAC9F,QAAI;AAAA,MACF,SAAAC;AAAA,MACA,aAAAC;AAAA,IACF,IAAI;AACJ,aAASC,sBAAqB,MAAM,UAAU;AAC5C,UAAI,EAAE,gBAAgBA,wBAAuB;AAC3C,cAAM,IAAI,YAAY,kDAAkD;AAAA,MAC1E;AACA,UAAI,YAAY,CAAC,SAAS,QAAQ,GAAG;AACnC,cAAM,IAAI,MAAM,uBAAuB,QAAQ;AAAA,MACjD;AACA,UAAI,SAAS,IAAI,KAAK,QAAQ,IAAI,GAAG;AAEnC,YAAIC,UAAS,IAAIF,aAAY,MAAM,QAAQ;AAE3C,aAAK,QAAQE,QAAO;AACpB,aAAK,QAAQA,QAAO;AACpB,aAAK,YAAYA,QAAO;AACxB,aAAK,OAAO;AACZ,aAAK,OAAO;AAAA,MACd,WAAW,QAAQ,QAAQ,KAAK,IAAI,KAAK,QAAQ,KAAK,IAAI,GAAG;AAE3D,aAAK,QAAQ,KAAK;AAClB,aAAK,QAAQ,KAAK;AAClB,aAAK,YAAY,KAAK;AACtB,aAAK,OAAO,OAAO,KAAK,QAAQ,cAAc,KAAK,MAAM;AACzD,aAAK,OAAO,OAAO,KAAK,QAAQ,cAAc,KAAK,MAAM;AAAA,MAC3D,WAAW,MAAM;AAEf,cAAM,IAAI,UAAU,+BAA+B,OAAO,IAAI,IAAI,GAAG;AAAA,MACvE,OAAO;AAEL,aAAK,QAAQ,CAAC;AACd,aAAK,QAAQ,CAAC,CAAC;AACf,aAAK,YAAY;AACjB,aAAK,OAAO;AACZ,aAAK,OAAO;AAAA,MACd;AAAA,IACF;AACA,IAAAD,sBAAqB,YAAY,IAAID,aAAY;AAKjD,IAAAC,sBAAqB,UAAU,OAAO;AACtC,IAAAA,sBAAqB,UAAU,yBAAyB;AAexD,IAAAA,sBAAqB,UAAU,SAAS,SAAUE,QAAO;AACvD,cAAQ,UAAU,QAAQ;AAAA,QACxB,KAAK,GACH;AAEE,cAAI,IAAIH,aAAY,UAAU,OAAO,KAAK,MAAMG,MAAK;AAErD,cAAI,SAAS,CAAC,GAAG;AAEf,mBAAO,IAAIF,sBAAqB;AAAA,cAC9B,MAAM,EAAE;AAAA,cACR,MAAM,EAAE;AAAA,cACR,UAAU,EAAE;AAAA,YACd,CAAC;AAAA,UACH;AACA,iBAAO;AAAA,QACT;AAAA;AAAA,QAEF,KAAK;AAAA,QACL,KAAK;AACH,gBAAM,IAAI,MAAM,0DAA0D;AAAA,QAC5E;AACE,gBAAM,IAAI,YAAY,2BAA2B;AAAA,MACrD;AAAA,IACF;AAWA,IAAAA,sBAAqB,UAAU,MAAM,WAAY;AAC/C,YAAM,IAAI,MAAM,mDAAmD;AAAA,IACrE;AAcA,IAAAA,sBAAqB,UAAU,SAAS,WAAY;AAClD,YAAM,IAAI,MAAM,sDAAsD;AAAA,IACxE;AAOA,IAAAA,sBAAqB,UAAU,UAAU,WAAY;AACnD,YAAM,IAAI,MAAM,uDAAuD;AAAA,IACzE;AAMA,IAAAA,sBAAqB,UAAU,QAAQ,WAAY;AACjD,aAAO,IAAIA,sBAAqB;AAAA,QAC9B,MAAMG,OAAM,KAAK,KAAK;AAAA,QACtB,MAAMA,OAAM,KAAK,KAAK;AAAA,QACtB,UAAU,KAAK;AAAA,MACjB,CAAC;AAAA,IACH;AAMA,IAAAH,sBAAqB,UAAU,SAAS,WAAY;AAClD,aAAO;AAAA,QACL,QAAQ;AAAA,QACR,MAAM,KAAK;AAAA,QACX,MAAM,KAAK;AAAA,QACX,UAAU,KAAK;AAAA,MACjB;AAAA,IACF;AASA,IAAAA,sBAAqB,WAAW,SAAU,MAAM;AAC9C,aAAO,IAAIA,sBAAqB,IAAI;AAAA,IACtC;AAUA,IAAAA,sBAAqB,UAAU,WAAW,WAAY;AACpD,YAAM,IAAI,MAAM,wDAAwD;AAAA,IAC1E;AAMA,IAAAA,sBAAqB,UAAU,MAAM,WAAY;AAE/C,UAAI,KAAK,SAAS,MAAM;AAEtB,YAAI,IAAI;AAER,aAAK,QAAQ,SAAU,GAAG;AACxB,cAAI,MAAM,QAAQF,SAAQ,GAAG,CAAC,GAAG;AAC/B,gBAAI;AAAA,UACN;AAAA,QACF,CAAC;AACD,aAAK,OAAO,MAAM,OAAO,IAAI;AAAA,MAC/B;AACA,aAAO,KAAK;AAAA,IACd;AAMA,IAAAE,sBAAqB,UAAU,MAAM,WAAY;AAE/C,UAAI,KAAK,SAAS,MAAM;AAEtB,YAAI,IAAI;AAER,aAAK,QAAQ,SAAU,GAAG;AACxB,cAAI,MAAM,QAAQF,SAAQ,GAAG,CAAC,GAAG;AAC/B,gBAAI;AAAA,UACN;AAAA,QACF,CAAC;AACD,aAAK,OAAO,MAAM,OAAO,IAAI;AAAA,MAC/B;AACA,aAAO,KAAK;AAAA,IACd;AACA,WAAOE;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,EACX,CAAC;;;ACxND,MAAII,UAAO;AACX,MAAIC,kBAAe,CAAC,wBAAwB,mBAAmB;AACxD,MAAI,mBAAkC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC/E,QAAI;AAAA,MACF,sBAAAC;AAAA,MACA,mBAAAC;AAAA,IACF,IAAI;AAuBJ,aAASC,SAAQ;AACf,UAAI,EAAE,gBAAgBA,SAAQ;AAC5B,cAAM,IAAI,YAAY,kDAAkD;AAAA,MAC1E;AACA,WAAK,cAAc,CAAC;AACpB,WAAK,cAAc,CAAC;AACpB,WAAK,YAAY;AACjB,eAASC,KAAI,GAAG,KAAK,UAAU,QAAQA,KAAI,IAAIA,MAAK;AAClD,YAAIC,OAAMD,KAAI,KAAK,UAAU,UAAUA,KAAI,SAAY,UAAUA,EAAC;AAClE,YAAI,aAAa,QAAQC,IAAG;AAC5B,YAAI,cAAc,SAASA,IAAG;AAC9B,YAAI,UAAU,OAAOA;AACrB,YAAI,aAAa;AACjB,YAAI,QAAQA,IAAG,GAAG;AAChB,eAAK,YAAY,KAAKA,IAAG;AACzB,eAAK,YAAY;AAAA,QACnB,WAAW,cAAc,aAAa;AAEpC,cAAI,IAAI;AACR,eAAK,YAAY;AACjB,cAAIH,mBAAkBG,IAAG,MAAM,WAAW;AACxC,gBAAI,WAAY,KAAI,uBAAuB,gCAAgCA,IAAG,EAAE,QAAQ,CAAC;AACzF,gBAAI,YAAa,KAAI,uBAAuB,gCAAgCA,KAAI,KAAK,EAAE,QAAQ,CAAC;AAChG,yBAAaA,KAAI,QAAQ,EAAE;AAAA,UAC7B,OAAO;AACL,gBAAI,uBAAuBA,KAAI,QAAQ,CAAC;AAAA,UAC1C;AACA,eAAK,YAAY,KAAK,CAAC;AAAA,QACzB,WAAW,YAAY,UAAU;AAC/B,eAAK,YAAY,KAAKA,IAAG;AAAA,QAC3B,WAAW,YAAY,UAAU;AAC/B,eAAK,YAAY,KAAK,OAAOA,IAAG,CAAC;AAAA,QACnC,WAAW,YAAY,UAAU;AAE/B,eAAK,YAAY,KAAKA,IAAG;AAAA,QAC3B,OAAO;AACL,gBAAM,IAAI,UAAU,sEAAsE;AAAA,QAC5F;AACA,aAAK,YAAY,KAAK,UAAU;AAAA,MAElC;AAAA,IACF;AAKA,IAAAF,OAAM,UAAU,OAAO;AACvB,IAAAA,OAAM,UAAU,UAAU;AAC1B,aAAS,uBAAuBE,MAAK;AAEnC,eAASD,KAAI,GAAG,IAAIC,KAAI,QAAQD,KAAI,GAAGA,MAAK;AAC1C,YAAI,CAAC,SAASC,KAAID,EAAC,CAAC,KAAK,CAAC,UAAUC,KAAID,EAAC,CAAC,GAAG;AAC3C,gBAAM,IAAI,UAAU,mDAAmD;AAAA,QACzE;AAAA,MACF;AAEA,UAAIE,UAAS,IAAIL,sBAAqB;AACtC,MAAAK,QAAO,QAAQD;AACf,MAAAC,QAAO,QAAQ,CAACD,KAAI,MAAM;AAC1B,aAAOC;AAAA,IACT;AAOA,IAAAH,OAAM,UAAU,QAAQ,WAAY;AAClC,UAAII,SAAQ,IAAIJ,OAAM;AACtB,MAAAI,OAAM,cAAcC,OAAM,KAAK,WAAW;AAC1C,MAAAD,OAAM,YAAY,KAAK;AACvB,MAAAA,OAAM,cAAc,KAAK;AACzB,aAAOA;AAAA,IACT;AASA,IAAAJ,OAAM,SAAS,SAAU,QAAQ;AAC/B,UAAII,SAAQ,IAAIJ,OAAM;AACtB,MAAAA,OAAM,MAAMI,QAAO,MAAM;AACzB,aAAOA;AAAA,IACT;AAOA,IAAAJ,OAAM,UAAU,OAAO,WAAY;AACjC,UAAIM,QAAO,CAAC;AACZ,eAASL,KAAI,GAAG,KAAK,KAAK,YAAY,QAAQA,KAAI,IAAIA,MAAK;AACzD,YAAI,IAAI,KAAK,YAAYA,EAAC;AAC1B,QAAAK,MAAKL,EAAC,IAAI,SAAS,CAAC,KAAK,SAAS,CAAC,IAAI,IAAI,EAAE,KAAK,EAAE,CAAC;AAAA,MACvD;AACA,aAAOK;AAAA,IACT;AAOA,IAAAN,OAAM,UAAU,MAAM,WAAY;AAChC,UAAI,SAAS,CAAC;AACd,eAASC,KAAI,GAAG,KAAK,KAAK,YAAY,QAAQA,KAAI,IAAIA,MAAK;AACzD,YAAIM,SAAQ,KAAK,YAAYN,EAAC;AAC9B,eAAOA,EAAC,IAAI,SAASM,MAAK,KAAK,SAASA,MAAK,IAAIA,SAAQA,OAAM,IAAI;AAAA,MACrE;AACA,aAAO;AAAA,IACT;AAOA,IAAAP,OAAM,UAAU,MAAM,WAAY;AAChC,UAAI,SAAS,CAAC;AACd,eAASC,KAAI,GAAG,KAAK,KAAK,YAAY,QAAQA,KAAI,IAAIA,MAAK;AACzD,YAAIM,SAAQ,KAAK,YAAYN,EAAC;AAC9B,eAAOA,EAAC,IAAI,SAASM,MAAK,KAAK,SAASA,MAAK,IAAIA,SAAQA,OAAM,IAAI;AAAA,MACrE;AACA,aAAO;AAAA,IACT;AASA,IAAAP,OAAM,UAAU,UAAU,SAAU,UAAU;AAC5C,eAASC,KAAI,GAAG,KAAK,KAAK,YAAY,QAAQA,KAAI,IAAIA,MAAK;AACzD,iBAAS,KAAK,YAAYA,EAAC,GAAGA,IAAG,IAAI;AAAA,MACvC;AAAA,IACF;AAQA,IAAAD,OAAM,UAAU,YAAY,SAAU,KAAK;AACzC,UAAI;AACJ,UAAI,CAAC,SAAS,GAAG,GAAG;AAClB,eAAO;AAAA,MACT;AACA,cAAQ,wBAAwB,KAAK,YAAY,GAAG,OAAO,QAAQ,0BAA0B,SAAS,wBAAwB;AAAA,IAChI;AAMA,IAAAA,OAAM,UAAU,mBAAmB,WAAY;AAC7C,aAAO,KAAK,YAAY,WAAW,KAAK,SAAS,KAAK,YAAY,CAAC,CAAC;AAAA,IACtE;AAOA,IAAAA,OAAM,UAAU,oBAAoB,WAAY;AAC9C,aAAO,KAAK,iBAAiB,IAAI,KAAK,YAAY,CAAC,IAAI;AAAA,IACzD;AAUA,IAAAA,OAAM,UAAU,WAAW,WAAY;AACrC,aAAO,KAAK;AAAA,IACd;AAQA,IAAAA,OAAM,UAAU,UAAU,WAAY;AACpC,UAAI,QAAQ,CAAC;AACb,eAASC,KAAI,GAAG,KAAK,KAAK,YAAY,QAAQA,KAAI,IAAIA,MAAK;AACzD,YAAI,YAAY,KAAK,YAAYA,EAAC;AAClC,cAAM,KAAK,SAAS,SAAS,KAAK,SAAS,SAAS,IAAI,YAAY,UAAU,QAAQ,CAAC;AAAA,MACzF;AACA,aAAO;AAAA,IACT;AAQA,IAAAD,OAAM,UAAU,UAAUA,OAAM,UAAU;AAO1C,IAAAA,OAAM,UAAU,WAAW,WAAY;AACrC,UAAI,UAAU,CAAC;AACf,eAASC,KAAI,GAAG,KAAK,KAAK,YAAY,QAAQA,KAAI,IAAIA,MAAK;AACzD,YAAI,YAAY,KAAK,YAAYA,EAAC;AAClC,YAAI,SAAS,SAAS,GAAG;AACvB,kBAAQ,KAAK,KAAK,UAAU,SAAS,CAAC;AAAA,QACxC,OAAO;AACL,kBAAQ,KAAK,UAAU,SAAS,CAAC;AAAA,QACnC;AAAA,MACF;AACA,aAAO,MAAM,QAAQ,KAAK,IAAI,IAAI;AAAA,IACpC;AAQA,IAAAD,OAAM,UAAU,SAAS,WAAY;AACnC,aAAO;AAAA,QACL,QAAQ;AAAA,QACR,YAAY,KAAK;AAAA,MACnB;AAAA,IACF;AASA,IAAAA,OAAM,WAAW,SAAU,MAAM;AAC/B,aAAOA,OAAM,OAAO,KAAK,UAAU;AAAA,IACrC;AACA,WAAOA;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,EACX,CAAC;AAOD,WAAS,gCAAgC,mBAAmB;AAE1D,QAAI,iBAAiB,CAAC;AACtB,sBAAkB,QAAQ,CAAC,MAAM,QAAQ;AACvC,UAAI,MAAM;AACR,uBAAe,KAAK,GAAG;AAAA,MACzB;AAAA,IACF,CAAC;AACD,WAAO;AAAA,EACT;;;AC7SA,MAAIQ,UAAO;AACX,MAAIC,kBAAe,CAAC,WAAW,QAAQ;AAChC,MAAI,2BAA0C,wBAAQD,SAAMC,iBAAc,UAAQ;AACvF,QAAI;AAAA,MACF,SAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,IAAM,KAAK,KAAK,IAAM,KAAK,KAAK,CAAG,KAAK,CAAG;AAO/D,aAASC,iBAAgB;AACvB,UAAI,EAAE,gBAAgBA,iBAAgB;AACpC,cAAM,IAAI,YAAY,kDAAkD;AAAA,MAC1E;AAGA,WAAK,WAAW;AAChB,WAAK,QAAQ;AAAA,IACf;AAKA,IAAAA,eAAc,UAAU,OAAO;AAC/B,IAAAA,eAAc,UAAU,kBAAkB;AAQ1C,IAAAA,eAAc,UAAU,SAAS,SAAU,KAAK,OAAO;AAErD,UAAI,OAAO;AAAA,QACT;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,MACV;AAEA,UAAI,KAAK,UAAU;AAEjB,YAAI,UAAU,KAAK;AAEnB,aAAK,OAAO;AACZ,aAAK,QAAQ,QAAQ;AACrB,gBAAQ,QAAQ;AAChB,aAAK,MAAM,OAAO;AAElB,YAAIF,SAAQ,KAAK,QAAQ,GAAG,GAAG;AAE7B,eAAK,WAAW;AAAA,QAClB;AAAA,MACF,OAAO;AAEL,aAAK,OAAO;AACZ,aAAK,QAAQ;AAEb,aAAK,WAAW;AAAA,MAClB;AAEA,WAAK;AAEL,aAAO;AAAA,IACT;AAMA,IAAAE,eAAc,UAAU,OAAO,WAAY;AACzC,aAAO,KAAK;AAAA,IACd;AAMA,IAAAA,eAAc,UAAU,QAAQ,WAAY;AAC1C,WAAK,WAAW;AAChB,WAAK,QAAQ;AAAA,IACf;AAMA,IAAAA,eAAc,UAAU,UAAU,WAAY;AAC5C,aAAO,KAAK,UAAU;AAAA,IACxB;AAOA,IAAAA,eAAc,UAAU,iBAAiB,WAAY;AAEnD,UAAI,OAAO,KAAK;AAEhB,UAAI,SAAS,MAAM;AACjB,eAAO;AAAA,MACT;AAEA,UAAI,UAAU,KAAK;AAEnB,UAAI,mBAAmB,KAAK;AAE5B,UAAI,IAAI,KAAK;AAEb,aAAO,mBAAmB,GAAG;AAE3B,YAAI,YAAY,EAAE;AAElB,UAAE,KAAK,QAAQ,EAAE;AACjB,UAAE,MAAM,OAAO,EAAE;AAEjB,UAAE,OAAO;AACT,UAAE,QAAQ,QAAQ;AAClB,gBAAQ,QAAQ;AAChB,UAAE,MAAM,OAAO;AAEf,UAAE,SAAS;AACX,YAAI;AACJ;AAAA,MACF;AAEA,WAAK,KAAK,QAAQ,KAAK;AACvB,WAAK,MAAM,OAAO,KAAK;AAEvB,UAAI,SAAS,KAAK,OAAO;AAEvB,kBAAU;AAAA,MACZ,OAAO;AAEL,kBAAU,KAAK;AAEf,kBAAU,iBAAiB,SAAS,KAAK,KAAK;AAAA,MAChD;AAEA,WAAK;AAEL,WAAK,WAAW;AAEhB,aAAO;AAAA,IACT;AASA,IAAAA,eAAc,UAAU,SAAS,SAAU,MAAM;AAE/C,WAAK,WAAW,aAAa,KAAK,UAAU,MAAM,EAAE;AAEpD,WAAK,eAAe;AAAA,IACtB;AAQA,aAAS,aAAa,SAAS,MAAM,KAAK;AAExC,WAAK,MAAM;AAEX,UAAI,SAAS,KAAK;AAClB,UAAI,UAAUF,SAAQ,KAAK,KAAK,OAAO,GAAG,GAAG;AAE3C,aAAK,SAAS,MAAM,MAAM;AAE1B,sBAAc,SAAS,MAAM;AAAA,MAC/B;AAEA,UAAIA,SAAQ,KAAK,KAAK,QAAQ,GAAG,GAAG;AAClC,kBAAU;AAAA,MACZ;AAEA,aAAO;AAAA,IACT;AAOA,aAAS,KAAK,SAAS,MAAM,QAAQ;AAEnC,WAAK,KAAK,QAAQ,KAAK;AACvB,WAAK,MAAM,OAAO,KAAK;AACvB,aAAO;AAEP,UAAI,OAAO,UAAU,MAAM;AACzB,eAAO,QAAQ,KAAK;AAAA,MACtB;AAEA,UAAI,OAAO,WAAW,GAAG;AACvB,eAAO,QAAQ;AAAA,MACjB;AAEA,WAAK,OAAO;AACZ,WAAK,QAAQ,QAAQ;AACrB,cAAQ,QAAQ;AAChB,WAAK,MAAM,OAAO;AAElB,WAAK,SAAS;AAEd,WAAK,OAAO;AAAA,IACd;AAQA,aAAS,cAAc,SAAS,MAAM;AAEpC,UAAI,SAAS,KAAK;AAElB,UAAI,CAAC,QAAQ;AACX;AAAA,MACF;AAEA,UAAI,CAAC,KAAK,MAAM;AACd,aAAK,OAAO;AAAA,MACd,OAAO;AAEL,aAAK,SAAS,MAAM,MAAM;AAE1B,sBAAc,MAAM;AAAA,MACtB;AAAA,IACF;AAMA,QAAI,aAAa,SAASG,YAAW,MAAM,QAAQ;AAEjD,WAAK,KAAK,QAAQ,KAAK;AACvB,WAAK,MAAM,OAAO,KAAK;AAEvB,WAAK,SAAS;AACd,UAAI,CAAC,OAAO,OAAO;AACjB,eAAO,QAAQ;AACf,aAAK,QAAQ;AACb,aAAK,OAAO;AAAA,MACd,OAAO;AACL,aAAK,OAAO,OAAO;AACnB,aAAK,QAAQ,OAAO,MAAM;AAC1B,eAAO,MAAM,QAAQ;AACrB,aAAK,MAAM,OAAO;AAAA,MACpB;AAEA,aAAO;AAEP,WAAK,OAAO;AAAA,IACd;AACA,aAAS,iBAAiB,SAASC,OAAM;AAEvC,UAAIC,aAAY,KAAK,MAAM,KAAK,IAAID,KAAI,IAAI,aAAa,IAAI;AAE7D,UAAI,QAAQ,IAAI,MAAMC,UAAS;AAE/B,UAAI,WAAW;AACf,UAAI,IAAI;AACR,UAAI,GAAG;AACL;AACA,YAAI,EAAE;AACN,eAAO,MAAM,SAAS;AACpB;AACA,cAAI,EAAE;AAAA,QACR;AAAA,MACF;AAEA,UAAI;AAEJ,aAAO,WAAW,GAAG;AAEnB,YAAI,IAAI,EAAE;AAEV,YAAI,OAAO,EAAE;AAEb,eAAO,MAAM;AAEX,cAAI,MAAM,CAAC;AACX,cAAI,CAAC,GAAG;AACN;AAAA,UACF;AAEA,cAAIJ,QAAO,EAAE,KAAK,EAAE,GAAG,GAAG;AACxB,gBAAI,OAAO;AACX,gBAAI;AACJ,gBAAI;AAAA,UACN;AAEA,qBAAW,GAAG,CAAC;AAEf,gBAAM,CAAC,IAAI;AACX;AAAA,QACF;AAEA,cAAM,CAAC,IAAI;AAEX,YAAI;AACJ;AAAA,MACF;AAEA,gBAAU;AAEV,eAASK,KAAI,GAAGA,KAAID,YAAWC,MAAK;AAElC,YAAI,MAAMA,EAAC;AACX,YAAI,CAAC,GAAG;AACN;AAAA,QACF;AAEA,YAAI,SAAS;AAEX,YAAE,KAAK,QAAQ,EAAE;AACjB,YAAE,MAAM,OAAO,EAAE;AAEjB,YAAE,OAAO;AACT,YAAE,QAAQ,QAAQ;AAClB,kBAAQ,QAAQ;AAChB,YAAE,MAAM,OAAO;AAEf,cAAIN,SAAQ,EAAE,KAAK,QAAQ,GAAG,GAAG;AAC/B,sBAAU;AAAA,UACZ;AAAA,QACF,OAAO;AACL,oBAAU;AAAA,QACZ;AAAA,MACF;AACA,aAAO;AAAA,IACT;AACA,WAAOE;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,EACX,CAAC;;;AC7VD,MAAIK,UAAO;AACX,MAAIC,kBAAe,CAAC,aAAa,eAAe,eAAe;AACxD,MAAI,iBAAgC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC7E,QAAI;AAAA,MACF,WAAAC;AAAA,MACA,aAAAC;AAAA,MACA,eAAAC;AAAA,IACF,IAAI;AAKJ,aAASC,OAAM;AACb,UAAI,EAAE,gBAAgBA,OAAM;AAC1B,cAAM,IAAI,YAAY,kDAAkD;AAAA,MAC1E;AAGA,WAAK,UAAU,CAAC;AAChB,WAAK,QAAQ,IAAID,eAAc;AAAA,IACjC;AAKA,IAAAC,KAAI,UAAU,OAAO;AACrB,IAAAA,KAAI,UAAU,QAAQ;AAQtB,IAAAA,KAAI,UAAU,MAAM,SAAUC,IAAG,GAAG;AAElC,UAAI,CAAC,KAAK,QAAQA,EAAC,GAAG;AAEpB,YAAI,OAAO,KAAK,MAAM,OAAOA,IAAG,CAAC;AAEjC,aAAK,QAAQA,EAAC,IAAI;AAAA,MACpB,OAAO;AAEL,aAAK,QAAQA,EAAC,EAAE,QAAQ;AAAA,MAC1B;AAAA,IACF;AACA,IAAAD,KAAI,UAAU,MAAM,SAAUC,IAAG;AAC/B,UAAI,OAAO,KAAK,QAAQA,EAAC;AACzB,UAAI,MAAM;AACR,eAAO,KAAK;AAAA,MACd;AACA,aAAO;AAAA,IACT;AACA,IAAAD,KAAI,UAAU,aAAa,SAAUC,IAAG,GAAG;AAEzC,UAAI,OAAO,KAAK,QAAQA,EAAC;AACzB,UAAI,CAAC,MAAM;AAET,eAAO,KAAK,MAAM,OAAOA,IAAG,CAAC;AAE7B,aAAK,QAAQA,EAAC,IAAI;AAAA,MACpB,OAAO;AAEL,aAAK,QAAQJ,WAAU,KAAK,OAAO,CAAC;AAAA,MACtC;AAAA,IACF;AACA,IAAAG,KAAI,UAAU,UAAU,SAAU,MAAME,KAAI,UAAU;AAEpD,UAAI,OAAO,KAAK;AAChB,UAAI,SAAS,KAAK;AAElB,UAAI,QAAQ,CAAC;AAEb,UAAI,OAAO,KAAK,eAAe;AAC/B,UAAI,MAAM;AACR,cAAM,KAAK,IAAI;AAAA,MACjB;AAEA,aAAO,QAAQ,KAAK,OAAOA,KAAI;AAE7B,YAAI,KAAK,OAAO,MAAM;AAEpB,cAAI,CAACJ,aAAY,KAAK,OAAO,CAAC,GAAG;AAE/B,qBAAS,KAAK,KAAK,KAAK,OAAO,IAAI;AAAA,UACrC;AAAA,QACF;AAEA,eAAO,KAAK,eAAe;AAC3B,YAAI,MAAM;AACR,gBAAM,KAAK,IAAI;AAAA,QACjB;AAAA,MACF;AAEA,eAASG,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AAErC,YAAI,IAAI,MAAMA,EAAC;AAEf,eAAO,KAAK,OAAO,EAAE,KAAK,EAAE,KAAK;AAEjC,eAAO,KAAK,GAAG,IAAI;AAAA,MACrB;AAAA,IACF;AACA,IAAAD,KAAI,UAAU,OAAO,SAAUC,IAAG,GAAG;AAEnC,UAAI,QAAQ,KAAK,QAAQA,EAAC;AAC1B,UAAI,QAAQ,KAAK,QAAQ,CAAC;AAE1B,UAAI,CAAC,SAAS,OAAO;AAEnB,gBAAQ,KAAK,MAAM,OAAOA,IAAG,MAAM,KAAK;AAExC,aAAK,MAAM,OAAO,KAAK;AAEvB,aAAK,QAAQA,EAAC,IAAI;AAClB,aAAK,QAAQ,CAAC,IAAI;AAAA,MACpB,WAAW,SAAS,CAAC,OAAO;AAE1B,gBAAQ,KAAK,MAAM,OAAO,GAAG,MAAM,KAAK;AAExC,aAAK,MAAM,OAAO,KAAK;AAEvB,aAAK,QAAQ,CAAC,IAAI;AAClB,aAAK,QAAQA,EAAC,IAAI;AAAA,MACpB,WAAW,SAAS,OAAO;AAEzB,YAAI,IAAI,MAAM;AACd,cAAM,QAAQ,MAAM;AACpB,cAAM,QAAQ;AAAA,MAChB;AAAA,IACF;AACA,WAAOD;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,EACX,CAAC;;;ACpIM,WAAS,SAAS,OAAO;AAC9B,QAAIG,QAAO;AACX,QAAI,OAAO;AACX,QAAI,QAAQ,uBAAO,OAAO,IAAI;AAC9B,QAAIC,OAAM,uBAAO,OAAO,IAAI;AAC5B,QAAIC,SAAQ;AACZ,QAAIC,OAAM,SAASA,KAAI,IAAI;AACzB,UAAIC,YAAWH,KAAI,EAAE;AACrB,UAAI,CAACG,UAAU;AACf,aAAO,MAAMA,SAAQ;AACrB,aAAOH,KAAI,EAAE;AACb,QAAED;AACF,UAAI,SAASI,UAAU;AACvB,UAAI,CAACJ,OAAM;AACT,QAAAE,SAAQ;AACR,eAAO;AACP;AAAA,MACF;AACA,aAAO,CAAC,OAAO,UAAU,eAAe,KAAK,OAAO,EAAE,IAAI,GAAG;AAAA,MAAY;AAAA,IAC3E;AACA,YAAQ,KAAK,IAAI,KAAK;AACtB,WAAO;AAAA,MACL,KAAK,SAAS,IAAI,IAAI;AACpB,YAAIE,YAAWH,KAAI,EAAE;AACrB,YAAI,UAAU,EAAEC;AAChB,cAAM,OAAO,IAAI;AACjB,QAAAD,KAAI,EAAE,IAAI;AACV,YAAI,CAACG,WAAU;AACb,YAAEJ;AACF,cAAIA,SAAQ,MAAO,QAAO;AAC1B,eAAK,MAAM,IAAI;AACf,UAAAG,KAAI,EAAE;AACN,iBAAO;AAAA,QACT;AACA,eAAO,MAAMC,SAAQ;AACrB,YAAI,SAASA,UAAU,QAAO;AAC9B,eAAO,CAAC,OAAO,UAAU,eAAe,KAAK,OAAO,EAAE,IAAI,GAAG;AAAA,QAAY;AACzE,eAAO;AAAA,MACT;AAAA,MACA,QAAQD;AAAA,MACR,OAAO,SAAS,QAAQ;AACtB,QAAAH,QAAOE,SAAQ;AACf,eAAO;AACP,gBAAQ,uBAAO,OAAO,IAAI;AAC1B,QAAAD,OAAM,uBAAO,OAAO,IAAI;AAAA,MAC1B;AAAA,IACF;AAAA,EACF;;;AC/BO,WAAS,QAAQ,IAAI;AAC1B,QAAI;AAAA,MACF,QAAAI;AAAA,MACA;AAAA,IACF,IAAI,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAC;AACzE,YAAQ,SAAS,OAAO,OAAO,oBAAoB;AACnD,IAAAA,UAASA,WAAU,OAAO,KAAK,YAAYA;AAC3C,WAAO,SAASC,WAAU;AACxB,UAAI,OAAOA,SAAQ,UAAU,UAAU;AACrC,QAAAA,SAAQ,QAAQ;AAAA,UACd,QAAQ,oBAAI,IAAI;AAAA,UAChB,KAAK,SAAS,SAAS,OAAO,iBAAiB;AAAA,QACjD;AAAA,MACF;AACA,UAAI,OAAO,CAAC;AACZ,eAASC,KAAI,GAAGA,KAAI,UAAU,QAAQA,MAAK;AACzC,aAAKA,EAAC,IAAI,UAAUA,EAAC;AAAA,MACvB;AACA,UAAI,OAAOF,QAAO,IAAI;AACtB,UAAIC,SAAQ,MAAM,OAAO,IAAI,IAAI,GAAG;AAClC,QAAAA,SAAQ,MAAM,IAAI,IAAI,IAAI;AAC1B,eAAOA,SAAQ,MAAM,OAAO,IAAI,IAAI;AAAA,MACtC;AACA,UAAI,SAAS,GAAG,MAAM,IAAI,IAAI;AAC9B,MAAAA,SAAQ,MAAM,OAAO,IAAI,MAAM,MAAM;AACrC,MAAAA,SAAQ,MAAM,OAAO,OAAOA,SAAQ,MAAM,IAAI,IAAI,IAAI,CAAC;AACvD,aAAO;AAAA,IACT;AAAA,EACF;;;ACxCO,MAAI,mBAAmB,QAAQ,SAAUE,YAAW;AACzD,WAAO,IAAIA,WAAU,CAAC,EAAE,IAAI;AAAA,EAC9B,GAAG;AAAA,IACD;AAAA,EACF,CAAC;AAOM,MAAI,qBAAqB,QAAQ,SAAUA,YAAW;AAC3D,WAAO,IAAIA,WAAU,CAAC,EAAE,KAAK,IAAIA,WAAU,CAAC,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC;AAAA,EAC7D,GAAG;AAAA,IACD;AAAA,EACF,CAAC;AAOM,MAAI,oBAAoB,QAAQ,SAAUA,YAAW;AAC1D,WAAOA,WAAU,KAAK,EAAE;AAAA,EAC1B,GAAG;AAAA,IACD;AAAA,EACF,CAAC;AAOM,MAAI,qBAAqB,QAAQ,SAAUA,YAAW;AAC3D,WAAO,kBAAkBA,UAAS,EAAE,MAAM,CAAC;AAAA,EAC7C,GAAG;AAAA,IACD;AAAA,EACF,CAAC;AAUD,WAAS,OAAO,MAAM;AACpB,WAAO,KAAK,CAAC,EAAE;AAAA,EACjB;;;ACtDA,WAASC,SAAQC,IAAG,GAAG;AAAE,QAAI,IAAI,OAAO,KAAKA,EAAC;AAAG,QAAI,OAAO,uBAAuB;AAAE,UAAI,IAAI,OAAO,sBAAsBA,EAAC;AAAG,YAAM,IAAI,EAAE,OAAO,SAAUC,IAAG;AAAE,eAAO,OAAO,yBAAyBD,IAAGC,EAAC,EAAE;AAAA,MAAY,CAAC,IAAI,EAAE,KAAK,MAAM,GAAG,CAAC;AAAA,IAAG;AAAE,WAAO;AAAA,EAAG;AAC9P,WAASC,eAAcF,IAAG;AAAE,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AAAE,UAAI,IAAI,QAAQ,UAAU,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC;AAAG,UAAI,IAAID,SAAQ,OAAO,CAAC,GAAG,IAAE,EAAE,QAAQ,SAAUE,IAAG;AAAE,QAAAE,iBAAgBH,IAAGC,IAAG,EAAEA,EAAC,CAAC;AAAA,MAAG,CAAC,IAAI,OAAO,4BAA4B,OAAO,iBAAiBD,IAAG,OAAO,0BAA0B,CAAC,CAAC,IAAID,SAAQ,OAAO,CAAC,CAAC,EAAE,QAAQ,SAAUE,IAAG;AAAE,eAAO,eAAeD,IAAGC,IAAG,OAAO,yBAAyB,GAAGA,EAAC,CAAC;AAAA,MAAG,CAAC;AAAA,IAAG;AAAE,WAAOD;AAAA,EAAG;AAOtb,MAAII,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO,UAAU,aAAa,kBAAkB,kBAAkB,gBAAgB,OAAO,OAAO,OAAO,SAAS,SAAS,aAAa,UAAU,UAAU,WAAW,aAAa,UAAU;AACzM,MAAI,kBAAiC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,IAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,cAAAC;AAAA,MACA,KAAAC;AAAA,MACA,KAAAC;AAAA,MACA,KAAAC;AAAA,MACA,OAAAC;AAAA,MACA,OAAAC;AAAA,MACA,WAAAC;AAAA,MACA,QAAAC;AAAA,MACA,QAAQ;AAAA,MACR,SAAAC;AAAA,MACA,WAAW;AAAA,MACX,UAAU;AAAA,IACZ,IAAI;AACJ,QAAI,WAAW;AACf,QAAI,mBAAmB;AACvB,QAAI,qCAAqC;AAqBzC,aAASC,MAAK,OAAO,eAAe;AAClC,UAAI,EAAE,gBAAgBA,QAAO;AAC3B,cAAM,IAAI,MAAM,kDAAkD;AAAA,MACpE;AACA,UAAI,EAAE,UAAU,QAAQ,UAAU,UAAaH,WAAU,KAAK,KAAK,UAAU,KAAK,IAAI;AACpF,cAAM,IAAI,UAAU,gGAAgG;AAAA,MACtH;AACA,WAAK,YAAY;AAMjB,WAAK,8BAA8B;AACnC,UAAI,kBAAkB,QAAW;AAC/B,aAAK,QAAQ,CAAC;AACd,aAAK,aAAa,gBAAgB,IAAI,OAAK,CAAC;AAAA,MAC9C,WAAW,OAAO,kBAAkB,UAAU;AAC5C,YAAI,IAAIG,MAAK,MAAM,aAAa;AAChC,aAAK,QAAQ,EAAE;AACf,aAAK,aAAa,EAAE;AAAA,MACtB,WAAW,OAAO,aAAa,KAAK,cAAc,UAAU,MAAM;AAEhE,aAAK,YAAY,cAAc;AAC/B,aAAK,8BAA8B,cAAc;AACjD,aAAK,aAAa,cAAc,WAAW,MAAM,CAAC;AAClD,aAAK,QAAQ,cAAc,MAAM,IAAI,CAAAC,OAAKC,UAAS,CAAC,GAAGD,EAAC,CAAC;AAAA,MAC3D,OAAO;AACL,cAAM,IAAI,UAAU,yEAAyE;AAAA,MAC/F;AACA,WAAK,QAAQ,KAAK,WAAW,KAAK;AAAA,IACpC;AAKA,WAAO,eAAeD,OAAM,QAAQ;AAAA,MAClC,OAAO;AAAA,IACT,CAAC;AACD,IAAAA,MAAK,UAAU,cAAcA;AAC7B,IAAAA,MAAK,UAAU,OAAO;AACtB,IAAAA,MAAK,UAAU,SAAS;AAGxB,QAAI,MAAMG,QAAO;AACjB,aAAS,iBAAiB;AACxB,aAAO,MAAM,OAAO,MAAM,KAAM;AAC9B,aAAK;AAAA,MACP;AAAA,IACF;AACA,aAAS,WAAWC,IAAG;AACrB,aAAOA,MAAK,OAAOA,MAAK,OAAOA,OAAM;AAAA,IACvC;AACA,aAAS,QAAQA,IAAG;AAClB,aAAOA,MAAK,OAAOA,MAAK;AAAA,IAC1B;AACA,aAAS,OAAO;AACd,MAAAD;AACA,UAAI,KAAK,OAAOA,MAAK;AAAA,IACvB;AACA,aAAS,OAAOE,WAAU;AACxB,MAAAF,SAAQE;AACR,UAAI,KAAK,OAAOF,MAAK;AAAA,IACvB;AACA,aAAS,cAAc;AACrB,UAAIG,UAAS;AACb,UAAID,YAAWF;AACf,UAAI,MAAM,KAAK;AACb,aAAK;AAAA,MACP,WAAW,MAAM,KAAK;AACpB,QAAAG,WAAU;AACV,aAAK;AAAA,MACP;AACA,UAAI,CAAC,WAAW,CAAC,GAAG;AAElB,eAAOD,SAAQ;AACf,eAAO;AAAA,MACT;AAGA,UAAI,MAAM,KAAK;AACb,QAAAC,WAAU;AACV,aAAK;AACL,YAAI,CAAC,QAAQ,CAAC,GAAG;AAEf,iBAAOD,SAAQ;AACf,iBAAO;AAAA,QACT;AAAA,MACF,OAAO;AACL,eAAO,QAAQ,CAAC,GAAG;AACjB,UAAAC,WAAU;AACV,eAAK;AAAA,QACP;AACA,YAAI,MAAM,KAAK;AACb,UAAAA,WAAU;AACV,eAAK;AAAA,QACP;AAAA,MACF;AACA,aAAO,QAAQ,CAAC,GAAG;AACjB,QAAAA,WAAU;AACV,aAAK;AAAA,MACP;AAGA,UAAI,MAAM,OAAO,MAAM,KAAK;AAG1B,YAAI,kBAAkB;AACtB,YAAI,iBAAiBH;AACrB,2BAAmB;AACnB,aAAK;AACL,YAAI,MAAM,OAAO,MAAM,KAAK;AAC1B,6BAAmB;AACnB,eAAK;AAAA,QACP;AAGA,YAAI,CAAC,QAAQ,CAAC,GAAG;AAEf,iBAAO,cAAc;AACrB,iBAAOG;AAAA,QACT;AAGA,QAAAA,UAASA,UAAS;AAClB,eAAO,QAAQ,CAAC,GAAG;AACjB,UAAAA,WAAU;AACV,eAAK;AAAA,QACP;AAAA,MACF;AACA,aAAOA;AAAA,IACT;AACA,aAAS,YAAY;AACnB,UAAI,WAAW;AAGf,aAAO,QAAQ,CAAC,KAAKN,MAAK,aAAa,CAAC,GAAG;AACzC,oBAAY;AACZ,aAAK;AAAA,MACP;AAGA,UAAI,SAAS,SAAS,OAAO,CAAC;AAC9B,UAAIA,MAAK,aAAa,MAAM,GAAG;AAC7B,eAAO;AAAA,MACT,OAAO;AACL,eAAO;AAAA,MACT;AAAA,IACF;AACA,aAAS,eAAe,QAAQ;AAC9B,UAAI,MAAM,QAAQ;AAChB,aAAK;AACL,eAAO;AAAA,MACT,OAAO;AACL,eAAO;AAAA,MACT;AAAA,IACF;AAYA,IAAAA,MAAK,QAAQ,SAAU,KAAK,SAAS;AACnC,gBAAU,WAAW,CAAC;AACtB,aAAO;AACP,MAAAG,SAAQ;AACR,UAAI;AACJ,UAAI,OAAO,SAAS,UAAU;AAC5B,cAAM,IAAI,UAAU,iDAAiD;AAAA,MACvE;AACA,UAAII,QAAO,IAAIP,MAAK;AACpB,MAAAO,MAAK,QAAQ,CAAC;AACd,UAAI,yBAAyB;AAC7B,UAAI,gBAAgB;AAgBpB,WAAK;AACL,qBAAe;AAGf,UAAI,WAAW,YAAY;AAC3B,UAAI,QAAQ;AACZ,UAAI,UAAU;AACZ,YAAIpB,QAAO,WAAW,aAAa;AACjC,kBAAQ,IAAI,WAAW,QAAQ;AAAA,QACjC,WAAWA,QAAO,WAAW,YAAY;AACvC,cAAI;AAEF,oBAAQ,IAAI,UAAU,QAAQ;AAAA,UAChC,SAAS,KAAK;AACZ,oBAAQ,WAAW,QAAQ;AAAA,UAC7B;AAAA,QACF,OAAO;AAEL,kBAAQ,WAAW,QAAQ;AAAA,QAC7B;AACA,uBAAe;AAGf,YAAI,eAAe,GAAG,GAAG;AACvB,mCAAyB;AACzB,0BAAgB;AAAA,QAClB,WAAW,eAAe,GAAG,GAAG;AAC9B,mCAAyB;AACzB,0BAAgB;AAAA,QAClB;AAAA,MACF;AAGA,UAAI,uBAAuB,CAAC;AAG5B,UAAI,8BAA8B;AAClC,aAAO,MAAM;AACX,uBAAe;AAIf,eAAO,MAAM,KAAK;AAChB,+BAAqB,KAAK,sBAAsB;AAChD,yCAA+B;AAC/B,mCAAyB;AACzB,eAAK;AACL,yBAAe;AAAA,QACjB;AAGA,YAAI,OAAO;AACX,YAAI,GAAG;AACL,cAAI,OAAO;AACX,iBAAO,UAAU;AACjB,cAAI,SAAS,MAAM;AACjB,kBAAM,IAAI,YAAY,iBAAiB,OAAO,WAAW,OAAO,gBAAgBgB,OAAM,SAAS,CAAC;AAAA,UAClG;AAAA,QACF,OAAO;AAEL;AAAA,QACF;AAGA,YAAI,MAAM,UAAU,IAAI;AACxB,YAAI,QAAQ,MAAM;AAEhB,gBAAM,IAAI,YAAY,WAAW,OAAO,cAAc;AAAA,QACxD;AACA,YAAI,QAAQ,yBAAyB;AAErC,uBAAe;AACf,YAAI,eAAe,GAAG,GAAG;AACvB,yBAAe;AACf,cAAI,IAAI,YAAY;AACpB,cAAI,MAAM,MAAM;AAEd,kBAAM,IAAI,YAAY,SAAS,MAAM,oDAAoD;AAAA,UAC3F;AACA,mBAAS;AAAA,QACX;AAGA,QAAAI,MAAK,MAAM,KAAK;AAAA,UACd,MAAM,IAAI;AAAA,UACV,QAAQ,IAAI;AAAA,UACZ;AAAA,QACF,CAAC;AACD,iBAASC,KAAI,GAAGA,KAAI,gBAAgB,QAAQA,MAAK;AAC/C,UAAAD,MAAK,WAAWC,EAAC,MAAM,IAAI,KAAK,WAAWA,EAAC,KAAK,KAAK;AAAA,QACxD;AAIA,uBAAe;AACf,eAAO,MAAM,KAAK;AAChB,cAAI,qBAAqB,WAAW,GAAG;AACrC,kBAAM,IAAI,YAAY,uBAAuB,OAAO,gBAAgBL,OAAM,SAAS,CAAC;AAAA,UACtF;AACA,yCAA+B,qBAAqB,IAAI;AACxD,eAAK;AACL,yBAAe;AAAA,QACjB;AAIA,wBAAgB;AAChB,YAAI,eAAe,GAAG,GAAG;AAEvB,mCAAyB;AACzB,0BAAgB;AAAA,QAClB,WAAW,eAAe,GAAG,GAAG;AAE9B,mCAAyB;AACzB,0BAAgB;AAAA,QAClB,OAAO;AAEL,mCAAyB;AAAA,QAC3B;AAGA,YAAI,IAAI,KAAK,MAAM;AACjB,cAAI,UAAU,IAAI,KAAK,KAAK;AAC5B,uBAAa,KAAK,OAAO,IAAI;AAAA,YAC3B,MAAM,IAAI;AAAA,YACV,QAAQ,IAAI;AAAA,UACd;AAAA,QACF;AAAA,MACF;AAGA,qBAAe;AACf,UAAI,GAAG;AACL,cAAM,IAAI,YAAY,uBAAuB,MAAM,GAAG;AAAA,MACxD;AAGA,UAAI,eAAe;AACjB,cAAM,IAAI,YAAY,2BAA2B,MAAM,GAAG;AAAA,MAC5D;AAGA,UAAI,qBAAqB,WAAW,GAAG;AACrC,cAAM,IAAI,YAAY,uBAAuB,OAAO,GAAG;AAAA,MACzD;AAGA,UAAII,MAAK,MAAM,WAAW,KAAK,CAAC,QAAQ,cAAc;AACpD,cAAM,IAAI,YAAY,MAAM,MAAM,qBAAqB;AAAA,MACzD;AACA,MAAAA,MAAK,QAAQ,UAAU,SAAYA,MAAK,WAAW,KAAK,IAAI;AAC5D,aAAOA;AAAA,IACT;AAOA,IAAAP,MAAK,UAAU,QAAQ,WAAY;AACjC,UAAIO,QAAO,IAAIP,MAAK;AACpB,MAAAO,MAAK,YAAY,KAAK;AACtB,MAAAA,MAAK,8BAA8B,KAAK;AACxC,MAAAA,MAAK,QAAQE,OAAM,KAAK,KAAK;AAC7B,MAAAF,MAAK,aAAa,KAAK,WAAW,MAAM,CAAC;AACzC,MAAAA,MAAK,QAAQ,CAAC;AACd,eAASC,KAAI,GAAGA,KAAI,KAAK,MAAM,QAAQA,MAAK;AAC1C,QAAAD,MAAK,MAAMC,EAAC,IAAI,CAAC;AACjB,iBAAS,KAAK,KAAK,MAAMA,EAAC,GAAG;AAC3B,cAAI,eAAe,KAAK,MAAMA,EAAC,GAAG,CAAC,GAAG;AACpC,YAAAD,MAAK,MAAMC,EAAC,EAAE,CAAC,IAAI,KAAK,MAAMA,EAAC,EAAE,CAAC;AAAA,UACpC;AAAA,QACF;AAAA,MACF;AACA,aAAOD;AAAA,IACT;AAQA,IAAAP,MAAK,UAAU,YAAY,WAAY;AACrC,aAAO,OAAO,KAAK,KAAK;AAAA,IAC1B;AAQA,IAAAA,MAAK,UAAU,aAAa,WAAY;AACtC,UAAI,KAAK,MAAM,WAAW,GAAG;AAC3B,eAAO;AAAA,MACT;AACA,aAAO,KAAK,MAAM,SAAS,KAAK,KAAK,IAAI,KAAK,MAAM,CAAC,EAAE,QAAQ,CAAG,IAAI;AAAA,IACxE;AASA,IAAAA,MAAK,UAAU,aAAa,SAAU,OAAO;AAC3C,UAAI,UAAU,QAAQ,UAAU,UAAa,KAAK,MAAM,WAAW,GAAG;AACpE,eAAO;AAAA,MACT;AACA,UAAI,MAAM;AACV,UAAI,UAAUA,MAAK,oBAAoB,OAAO,KAAK,CAAC;AAEpD,eAASQ,KAAI,GAAGA,KAAI,KAAK,MAAM,QAAQA,MAAK;AAC1C,YAAI,YAAY,QAAQ,KAAK,MAAMA,EAAC,EAAE,KAAK,KAAK;AAChD,YAAI,kBAAkB,QAAQ,KAAK,MAAMA,EAAC,EAAE,OAAO,KAAK;AACxD,YAAI,YAAY,QAAQ,KAAK,MAAMA,EAAC,EAAE,KAAK;AAC3C,cAAMlB,gBAAe,KAAKE,KAAIF,gBAAe,WAAW,eAAe,GAAG,SAAS,CAAC;AAAA,MACtF;AACA,aAAO;AAAA,IACT;AAUA,IAAAU,MAAK,UAAU,eAAe,SAAU,OAAO,aAAa;AAC1D,UAAI,UAAU,QAAQ,UAAU,UAAa,KAAK,MAAM,WAAW,GAAG;AACpE,eAAO;AAAA,MACT;AACA,UAAI,MAAM;AACV,UAAI,UAAUA,MAAK,oBAAoB,OAAO,KAAK,CAAC;AAEpD,eAASQ,KAAI,GAAGA,KAAI,KAAK,MAAM,QAAQA,MAAK;AAC1C,YAAI,YAAY,QAAQ,KAAK,MAAMA,EAAC,EAAE,KAAK,KAAK;AAChD,YAAI,kBAAkB,QAAQ,KAAK,MAAMA,EAAC,EAAE,OAAO,KAAK;AACxD,YAAI,YAAY,QAAQ,KAAK,MAAMA,EAAC,EAAE,KAAK;AAC3C,cAAMjB,cAAa,KAAKC,KAAIF,gBAAe,WAAW,eAAe,GAAG,SAAS,CAAC;AAAA,MACpF;AACA,aAAO;AAAA,IACT;AAUA,QAAI,YAAY,QAAQ,SAAO;AAE7B,UAAI,eAAe,OAAO,GAAG,GAAG;AAC9B,YAAIiB,QAAO,MAAM,GAAG;AACpB,YAAI,SAASA,MAAK,SAAS,EAAE;AAC7B,eAAO;AAAA,UACL,MAAAA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AACA,eAAS,SAAS,OAAO;AACvB,YAAI,eAAe,OAAO,KAAK,GAAG;AAChC,cAAI,SAAS,KAAK,KAAK,GAAG;AACxB,gBAAI,QAAQ,MAAM,KAAK;AACvB,gBAAI,YAAY,IAAI,SAAS,MAAM;AACnC,gBAAI,aAAa,IAAI,UAAU,GAAG,SAAS;AAC3C,gBAAI,UAAU,eAAe,MAAM,UAAU,UAAU,IAAI,MAAM,SAAS,UAAU,IAAI;AACxF,gBAAI,YAAY,QAAW;AAEzB,qBAAO;AAAA,gBACL,MAAM;AAAA,gBACN,QAAQ;AAAA,cACV;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT,GAAG;AAAA,MACD,QAAQ,UAAQ,KAAK,CAAC;AAAA,MACtB,OAAO;AAAA,IACT,CAAC;AAUD,IAAAP,MAAK,kBAAkB,SAAUhB,SAAM;AACrC,aAAO,UAAUA,OAAI,MAAM;AAAA,IAC7B;AAQA,IAAAgB,MAAK,UAAU,UAAU,SAAU,MAAM;AACvC,UAAI,OAAO,SAAS,UAAU;AAC5B,eAAO,WAAW,IAAI;AAAA,MACxB;AACA,UAAI,CAAC,MAAM;AACT,eAAO;AAAA,MACT;AAGA,eAASQ,KAAI,GAAGA,KAAI,gBAAgB,QAAQA,MAAK;AAC/C,YAAI,KAAK,KAAK,KAAK,WAAWA,EAAC,KAAK,MAAM,KAAK,WAAWA,EAAC,KAAK,EAAE,IAAI,OAAO;AAC3E,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO;AAAA,IACT;AASA,IAAAR,MAAK,UAAU,YAAY,SAAU,OAAO;AAE1C,eAASQ,KAAI,GAAGA,KAAI,gBAAgB,QAAQA,MAAK;AAC/C,YAAI,KAAK,KAAK,KAAK,WAAWA,EAAC,KAAK,MAAM,MAAM,WAAWA,EAAC,KAAK,EAAE,IAAI,OAAO;AAC5E,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAQA,IAAAR,MAAK,UAAU,SAAS,SAAU,OAAO;AACvC,aAAO,KAAK,UAAU,KAAK,KAAKJ,OAAM,KAAK,OAAO,MAAM,KAAK;AAAA,IAC/D;AAQA,IAAAI,MAAK,UAAU,WAAW,SAAU,QAAQ;AAC1C,UAAI,MAAM,KAAK,MAAM;AACrB,UAAI,QAAQ,OAAO,MAAM,IAAI,SAAS,IAAIA,MAAK,MAAM;AACrD,eAASQ,KAAI,GAAGA,KAAI,gBAAgB,QAAQA,MAAK;AAE/C,YAAI,WAAWA,EAAC,KAAK,KAAK,WAAWA,EAAC,KAAK,MAAM,MAAM,WAAWA,EAAC,KAAK;AAAA,MAC1E;AAGA,eAAS,KAAK,GAAG,KAAK,MAAM,MAAM,QAAQ,MAAM;AAE9C,YAAI,WAAW1B,eAAc,CAAC,GAAG,MAAM,MAAM,EAAE,CAAC;AAChD,YAAI,MAAM,KAAK,QAAQ;AAAA,MACzB;AAGA,UAAI,KAAK,UAAU,QAAQ,MAAM,UAAU,MAAM;AAC/C,YAAI,UAAU,KAAK,UAAU,OAAO,KAAK,WAAW,IAAI,MAAM,KAAK,CAAC,IAAI,KAAK;AAC7E,YAAI,WAAW,MAAM,UAAU,OAAO,MAAM,WAAW,IAAI,KAAK,KAAK,CAAC,IAAI,MAAM;AAChF,YAAI,QAAQQ,gBAAe,SAAS,QAAQ;AAAA,MAC9C,OAAO;AACL,YAAI,QAAQ;AAAA,MACd;AACA,UAAI,OAAO,MAAM,GAAG;AAClB,YAAI,8BAA8B;AAAA,MACpC;AACA,aAAO,qBAAqB,GAAG;AAAA,IACjC;AASA,IAAAU,MAAK,UAAU,aAAa,SAAU,WAAW;AAC/C,aAAO,IAAIA,MAAK,SAAS,EAAE,OAAO,IAAI;AAAA,IACxC;AAQA,IAAAA,MAAK,UAAU,SAAS,SAAU,QAAQ;AACxC,UAAI,MAAM,KAAK,MAAM;AACrB,UAAI,QAAQ,OAAO,MAAM,IAAI,SAAS,IAAIA,MAAK,MAAM;AACrD,eAASQ,KAAI,GAAGA,KAAI,gBAAgB,QAAQA,MAAK;AAE/C,YAAI,WAAWA,EAAC,KAAK,KAAK,WAAWA,EAAC,KAAK,MAAM,MAAM,WAAWA,EAAC,KAAK;AAAA,MAC1E;AAGA,eAAS,MAAM,GAAG,MAAM,MAAM,MAAM,QAAQ,OAAO;AAEjD,YAAI,WAAW1B,eAAcA,eAAc,CAAC,GAAG,MAAM,MAAM,GAAG,CAAC,GAAG,CAAC,GAAG;AAAA,UACpE,OAAO,CAAC,MAAM,MAAM,GAAG,EAAE;AAAA,QAC3B,CAAC;AACD,YAAI,MAAM,KAAK,QAAQ;AAAA,MACzB;AAGA,UAAI,KAAK,UAAU,QAAQ,MAAM,UAAU,MAAM;AAC/C,YAAI,UAAU,KAAK,UAAU,OAAO,KAAK,WAAW,IAAI,MAAM,KAAK,CAAC,IAAI,KAAK;AAC7E,YAAI,WAAW,MAAM,UAAU,OAAO,MAAM,WAAW,IAAI,KAAK,KAAK,CAAC,IAAI,MAAM;AAChF,YAAI,QAAQS,cAAa,SAAS,QAAQ;AAAA,MAC5C,OAAO;AACL,YAAI,QAAQ;AAAA,MACd;AACA,UAAI,OAAO,MAAM,GAAG;AAClB,YAAI,8BAA8B;AAAA,MACpC;AACA,aAAO,qBAAqB,GAAG;AAAA,IACjC;AAQA,IAAAS,MAAK,UAAU,MAAM,SAAU,GAAG;AAChC,UAAI,MAAM,KAAK,MAAM;AACrB,eAASQ,KAAI,GAAGA,KAAI,gBAAgB,QAAQA,MAAK;AAE/C,YAAI,WAAWA,EAAC,KAAK,KAAK,WAAWA,EAAC,KAAK,KAAK;AAAA,MAClD;AAGA,eAAS,MAAM,GAAG,MAAM,IAAI,MAAM,QAAQ,OAAO;AAC/C,YAAI,MAAM,GAAG,EAAE,SAAS;AAAA,MAC1B;AACA,UAAI,IAAI,UAAU,MAAM;AACtB,YAAI,QAAQhB,KAAI,IAAI,OAAO,CAAC;AAAA,MAO9B,OAAO;AACL,YAAI,QAAQ;AAAA,MACd;AACA,UAAI,8BAA8B;AAClC,aAAO,qBAAqB,GAAG;AAAA,IACjC;AAOA,aAAS,qBAAqBe,OAAM;AAClC,UAAIA,MAAK,UAAU,WAAW,IAAI,KAAKA,MAAK,UAAU,QAAQ,CAACpB,QAAO,aAAa;AACjF,eAAOoB,MAAK;AAAA,MACd,OAAO;AACL,eAAOA;AAAA,MACT;AAAA,IACF;AAQA,aAAS,IAAI,aAAa;AAKxB,UAAI,UAAUP,MAAK,oBAAoB,OAAO,WAAW,CAAC;AAC1D,aAAO,QAAQ,CAAC;AAAA,IAClB;AAQA,IAAAA,MAAK,UAAU,MAAM,WAAY;AAC/B,UAAI,MAAM,KAAK,MAAM;AACrB,UAAI,IAAI,UAAU,MAAM;AACtB,YAAI,IAAI,WAAW,KAAK,IAAI,MAAM,WAAW,KAAK,IAAI,MAAM,CAAC,EAAE,KAAK,WAAW,GAAG;AAChF,cAAI,QAAQP,KAAI,IAAI,KAAK;AAAA,QAC3B,OAAO;AAIL,cAAI,UAAU,IAAI,iBAAiB;AACnC,cAAI,YAAY,QAAQ,IAAI,MAAM,CAAC,EAAE,KAAK,KAAK;AAC/C,cAAI,gBAAgB,QAAQ,IAAI,MAAM,CAAC,EAAE,KAAK,MAAM;AACpD,cAAI,aAAaH,gBAAe,WAAW,aAAa;AACxD,cAAI,QAAQD,gBAAeI,KAAIL,WAAU,IAAI,OAAO,UAAU,CAAC,GAAG,UAAU;AAAA,QAC9E;AAAA,MACF;AACA,eAASoB,MAAK,IAAI,OAAO;AACvB,YAAI,IAAI,MAAMA,EAAC,EAAE,KAAK,SAAS,QAAQ,IAAI,MAAMA,EAAC,EAAE,KAAK,SAAS,OAAO;AACvE,cAAI,MAAMA,EAAC,EAAE,OAAO,MAAM;AAAA,QAC5B;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAQA,IAAAR,MAAK,UAAU,KAAK,SAAU,eAAe;AAC3C,UAAI,QAAQ,KAAK,UAAU,OAAO,KAAK,WAAW,CAAC,IAAI,KAAK;AAC5D,UAAI;AACJ,UAAI,OAAO,kBAAkB,UAAU;AACrC,gBAAQA,MAAK,MAAM,aAAa;AAAA,MAClC,WAAW,OAAO,aAAa,GAAG;AAChC,gBAAQ,cAAc,MAAM;AAAA,MAC9B,OAAO;AACL,cAAM,IAAI,MAAM,sCAAsC;AAAA,MACxD;AACA,UAAI,CAAC,KAAK,UAAU,KAAK,GAAG;AAC1B,cAAM,IAAI,MAAM,wBAAwB,OAAO,MAAM,SAAS,GAAG,QAAQ,EAAE,OAAO,KAAK,SAAS,GAAG,IAAI,CAAC;AAAA,MAC1G;AACA,UAAI,MAAM,UAAU,MAAM;AACxB,cAAM,IAAI,MAAM,uCAAuC;AAAA,MACzD;AACA,UAAI,KAAK,UAAU,QAAQ,KAAK,WAAW,KAAK,KAAK,MAAM,WAAW,KAAK,MAAM,MAAM,WAAW,KAAK,KAAK,MAAM,CAAC,EAAE,KAAK,WAAW,MAAM,MAAM,CAAC,EAAE,KAAK,QAAQ;AAC/J,cAAM,QAAQS,OAAM,KAAK;AAAA,MAC3B,OAAO;AAEL,YAAI,UAAUT,MAAK,oBAAoB,OAAO,KAAK,CAAC;AAEpD,YAAI,gBAAgB,KAAK,MAAM,CAAC,EAAE,KAAK;AACvC,YAAI,oBAAoB,KAAK,MAAM,CAAC,EAAE,KAAK;AAC3C,YAAI,iBAAiBV,gBAAe,eAAe,iBAAiB;AACpE,YAAI,iBAAiB,MAAM,MAAM,CAAC,EAAE,KAAK;AACzC,YAAI,qBAAqB,MAAM,MAAM,CAAC,EAAE,KAAK;AAC7C,YAAI,kBAAkBA,gBAAe,gBAAgB,kBAAkB;AACvE,cAAM,QAAQF,WAAU,OAAO,QAAQC,gBAAe,gBAAgB,eAAe,CAAC,CAAC;AAAA,MACzF;AACA,YAAM,YAAY;AAClB,YAAM,8BAA8B;AACpC,aAAO;AAAA,IACT;AASA,IAAAW,MAAK,UAAU,WAAW,SAAU,eAAe;AACjD,aAAO,SAAS,KAAK,UAAU,aAAa,CAAC;AAAA,IAC/C;AAQA,IAAAA,MAAK,UAAU,YAAY,SAAU,eAAe;AAClD,UAAI;AACJ,UAAI,eAAe;AAEjB,gBAAQ,KAAK,GAAG,aAAa;AAAA,MAC/B,OAAO;AACL,gBAAQ,KAAK,MAAM;AAAA,MACrB;AACA,UAAI,MAAM,WAAW,KAAK,MAAM,MAAM,WAAW,GAAG;AAClD,eAAO,MAAM,aAAa,MAAM,KAAK;AAAA,MACvC,OAAO;AACL,eAAO,MAAM,aAAa,MAAM,OAAO,MAAM,MAAM,CAAC,EAAE,OAAO,KAAK;AAAA,MACpE;AAAA,IACF;AAOA,IAAAA,MAAK,UAAU,WAAW,WAAY;AACpC,aAAO,KAAK,OAAO;AAAA,IACrB;AAQA,IAAAA,MAAK,UAAU,SAAS,WAAY;AAClC,aAAO;AAAA,QACL,QAAQ;AAAA,QACR,OAAO,KAAK,aAAa,KAAK,KAAK;AAAA,QACnC,MAAM,KAAK,MAAM,SAAS,IAAI,KAAK,YAAY,IAAI;AAAA,QACnD,WAAW,KAAK;AAAA,QAChB,UAAU,KAAK;AAAA,MACjB;AAAA,IACF;AASA,IAAAA,MAAK,WAAW,SAAU,MAAM;AAC9B,UAAI,YAAY,iBAAiB;AACjC,UAAIO,QAAO,IAAIP,MAAK,KAAK,QAAQ,aAAa,KAAK,UAAU,QAAQ,eAAe,SAAS,aAAa,MAAS;AACnH,MAAAO,MAAK,aAAa,kBAAkB,KAAK,eAAe,QAAQ,oBAAoB,SAAS,kBAAkB;AAC/G,MAAAA,MAAK,+BAA+B,iBAAiB,KAAK,cAAc,QAAQ,mBAAmB,SAAS,iBAAiB;AAC7H,aAAOA;AAAA,IACT;AAOA,IAAAP,MAAK,UAAU,UAAUA,MAAK,UAAU;AAMxC,IAAAA,MAAK,UAAU,WAAW,WAAY;AACpC,UAAI,MAAM,KAAK,MAAM;AACrB,UAAI,mBAAmB,CAAC;AAGxB,UAAI;AACJ,eAASU,QAAO,mBAAmB;AACjC,YAAI,eAAe,mBAAmBA,IAAG,GAAG;AAC1C,cAAI,IAAI,QAAQ,WAAWA,IAAG,CAAC,GAAG;AAChC,2BAAeA;AACf;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,UAAI,iBAAiB,QAAQ;AAC3B,YAAI,QAAQ,CAAC;AAAA,MACf,OAAO;AACL,YAAI;AACJ,YAAI,cAAc;AAEhB,cAAI,eAAe,mBAAmB,YAAY,GAAG;AACnD,2BAAe,kBAAkB,YAAY;AAAA,UAC/C;AAAA,QACF;AACA,YAAI,cAAc;AAChB,cAAI,QAAQ,CAAC;AAAA,YACX,MAAM,aAAa;AAAA,YACnB,QAAQ,aAAa;AAAA,YACrB,OAAO;AAAA,UACT,CAAC;AAAA,QACH,OAAO;AAIL,cAAI,iBAAiB;AACrB,mBAASF,KAAI,GAAGA,KAAI,gBAAgB,QAAQA,MAAK;AAC/C,gBAAI,UAAU,gBAAgBA,EAAC;AAC/B,gBAAI,KAAK,IAAI,IAAI,WAAWA,EAAC,KAAK,CAAC,IAAI,OAAO;AAC5C,kBAAI,eAAe,mBAAmB,OAAO,GAAG;AAC9C,iCAAiB,KAAK;AAAA,kBACpB,MAAM,kBAAkB,OAAO,EAAE;AAAA,kBACjC,QAAQ,kBAAkB,OAAO,EAAE;AAAA,kBACnC,OAAO,IAAI,WAAWA,EAAC,KAAK;AAAA,gBAC9B,CAAC;AAAA,cACH,OAAO;AACL,iCAAiB;AAAA,cACnB;AAAA,YACF;AAAA,UACF;AAGA,cAAI,iBAAiB,SAAS,IAAI,MAAM,UAAU,CAAC,gBAAgB;AAEjE,gBAAI,QAAQ;AAAA,UACd;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAKA,IAAAR,MAAK,UAAU,OAAO,WAAY;AAChC,UAAI,MAAM,KAAK,MAAM;AACrB,UAAI,mBAAmB,CAAC;AAKxB,eAASQ,KAAI,GAAGA,KAAI,gBAAgB,QAAQA,MAAK;AAC/C,YAAI,UAAU,gBAAgBA,EAAC;AAC/B,YAAI,KAAK,IAAI,IAAI,WAAWA,EAAC,KAAK,CAAC,IAAI,OAAO;AAC5C,cAAI,eAAe,aAAa,IAAI,OAAO,GAAG;AAC5C,6BAAiB,KAAK;AAAA,cACpB,MAAM,aAAa,GAAG,OAAO,EAAE;AAAA,cAC/B,QAAQ,aAAa,GAAG,OAAO,EAAE;AAAA,cACjC,OAAO,IAAI,WAAWA,EAAC,KAAK;AAAA,YAC9B,CAAC;AAAA,UACH,OAAO;AACL,kBAAM,IAAI,MAAM,gCAAgC,UAAU,cAAc;AAAA,UAC1E;AAAA,QACF;AAAA,MACF;AAGA,UAAI,QAAQ;AACZ,UAAI,YAAY;AAChB,UAAI,8BAA8B;AAClC,UAAI,KAAK,UAAU,MAAM;AACvB,YAAI,QAAQ;AACZ,eAAO,KAAK,GAAG,GAAG;AAAA,MACpB;AACA,aAAO;AAAA,IACT;AAOA,IAAAR,MAAK,UAAU,cAAc,WAAY;AACvC,UAAI,SAAS;AACb,UAAI,SAAS;AACb,UAAI,OAAO;AACX,UAAI,OAAO;AACX,eAASQ,KAAI,GAAGA,KAAI,KAAK,MAAM,QAAQA,MAAK;AAC1C,YAAI,KAAK,MAAMA,EAAC,EAAE,QAAQ,GAAG;AAC3B;AACA,oBAAU,MAAM,KAAK,MAAMA,EAAC,EAAE,OAAO,OAAO,KAAK,MAAMA,EAAC,EAAE,KAAK;AAC/D,cAAI,KAAK,IAAI,KAAK,MAAMA,EAAC,EAAE,QAAQ,CAAG,IAAI,OAAO;AAC/C,sBAAU,MAAM,KAAK,MAAMA,EAAC,EAAE;AAAA,UAChC;AAAA,QACF,WAAW,KAAK,MAAMA,EAAC,EAAE,QAAQ,GAAG;AAClC;AAAA,QACF;AAAA,MACF;AACA,UAAI,OAAO,GAAG;AACZ,iBAAS,MAAM,GAAG,MAAM,KAAK,MAAM,QAAQ,OAAO;AAChD,cAAI,KAAK,MAAM,GAAG,EAAE,QAAQ,GAAG;AAC7B,gBAAI,OAAO,GAAG;AACZ,wBAAU,MAAM,KAAK,MAAM,GAAG,EAAE,OAAO,OAAO,KAAK,MAAM,GAAG,EAAE,KAAK;AACnE,kBAAI,KAAK,IAAI,KAAK,MAAM,GAAG,EAAE,QAAQ,CAAG,IAAI,OAAO;AACjD,0BAAU,MAAM,CAAC,KAAK,MAAM,GAAG,EAAE;AAAA,cACnC;AAAA,YACF,OAAO;AACL,wBAAU,MAAM,KAAK,MAAM,GAAG,EAAE,OAAO,OAAO,KAAK,MAAM,GAAG,EAAE,KAAK;AACnE,wBAAU,MAAM,KAAK,MAAM,GAAG,EAAE;AAAA,YAClC;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,eAAS,OAAO,OAAO,CAAC;AACxB,eAAS,OAAO,OAAO,CAAC;AAGxB,UAAI,OAAO,KAAK,OAAO,GAAG;AACxB,iBAAS,MAAM,SAAS;AAAA,MAC1B;AACA,UAAI,OAAO,KAAK,OAAO,GAAG;AACxB,iBAAS,MAAM,SAAS;AAAA,MAC1B;AACA,UAAI,MAAM;AACV,UAAI,OAAO,KAAK,OAAO,GAAG;AACxB,eAAO;AAAA,MACT;AACA,aAAO;AACP,aAAO;AAAA,IACT;AAUA,IAAAR,MAAK,UAAU,SAAS,WAAY;AAClC,UAAI,WAAW,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAC;AACpF,UAAI,UAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAC;AACnF,UAAI,YAAY,CAAC,MAAM,QAAQ,QAAQ,GAAG;AACxC,cAAM,IAAI,MAAM,6CAA6C;AAAA,MAC/D;AACA,UAAI,gBAAgB,KAAK,MAAM,CAAC,EAAE,KAAK;AACvC,UAAI,YAAY,SAAS,SAAS,GAAG;AACnC,YAAI,cAAc,SAAS,IAAI,OAAK;AAClC,cAAIO,QAAO;AACX,cAAI,OAAO,MAAM,UAAU;AACzB,YAAAA,QAAOP,MAAK,MAAM,CAAC;AACnB,gBAAI,CAACO,OAAM;AACT,oBAAM,IAAI,MAAM,wDAAwD;AAAA,YAC1E;AAAA,UACF,WAAW,CAAC,OAAO,CAAC,GAAG;AACrB,kBAAM,IAAI,MAAM,wDAAwD;AAAA,UAC1E;AACA,cAAIA,UAAS,MAAM;AACjB,YAAAA,QAAO,EAAE,MAAM;AAAA,UACjB;AACA,cAAI;AACF,iBAAK,GAAGA,MAAK,YAAY,CAAC;AAC1B,mBAAOA;AAAA,UACT,SAAS3B,IAAG;AACV,kBAAM,IAAI,MAAM,wDAAwD;AAAA,UAC1E;AAAA,QACF,CAAC;AACD,YAAI,WAAW,YAAY,IAAI,QAAM,GAAG,MAAM,CAAC,EAAE,MAAM;AACvD,aAAK,MAAM,CAAC,EAAE,KAAK,WAAW,SAAS,OAAO,CAAC,KAAK,WAAW;AAC7D,cAAI,OAAO,IAAI,IAAI;AACnB,iBAAO;AAAA,QACT,GAAG,CAAC,CAAC;AACL,aAAK,MAAM,CAAC,EAAE,SAAS,SAAS,CAAC;AAAA,MACnC;AACA,UAAI,SAAS,WAAW,MAAM,OAAO,EAAE;AACvC,WAAK,MAAM,CAAC,EAAE,KAAK,WAAW;AAC9B,aAAO,YAAY;AACnB,aAAO;AAAA,IACT;AAUA,IAAAoB,MAAK,UAAU,SAAS,SAAU,SAAS;AACzC,UAAI;AAAA,QACF;AAAA,QACA;AAAA,QACA;AAAA,MACF,IAAI,WAAW,MAAM,OAAO;AAC5B,UAAI,MAAM;AACV,UAAI,KAAK,SAAS,UAAU,KAAK,KAAK,GAAG;AACvC,cAAM,MAAM,MAAM;AAAA,MACpB;AACA,UAAI,QAAQ,SAAS,KAAK,IAAI,SAAS,GAAG;AACxC,eAAO;AAAA,MACT;AACA,aAAO;AACP,aAAO;AAAA,IACT;AAQA,aAAS,WAAWO,OAAM;AACxB,UAAI,UAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAC;AAGnF,UAAI,OAAOA,MAAK,+BAA+BA,MAAK,UAAU,OAAOA,MAAK,MAAM,IAAIA,MAAK,SAAS;AAGlG,0BAAoB,IAAI;AAGxB,8BAAwB,MAAM,QAAQ,MAAM;AAC5C,UAAI,QAAQ,KAAK,aAAa,KAAK,KAAK;AACxC,UAAI,WAAW,KAAK,UAAU,OAAOT,QAAO,OAAO,WAAW,CAAC,CAAC,IAAI;AACpE,UAAI,UAAU,KAAK,YAAY;AAC/B,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAMA,aAAS,oBAAoB,MAAM;AACjC,UAAI,cAAc;AAClB,UAAI,OAAO,KAAK,UAAU,eAAe,KAAK,UAAU,QAAQ,UAAU,KAAK,KAAK,GAAG;AAErF,sBAAc,KAAK,IAAI,KAAK,MAAM,EAAE,IAAI;AAAA,MAC1C;AACA,eAASU,MAAK,KAAK,OAAO;AACxB,YAAI,eAAe,KAAK,OAAOA,EAAC,GAAG;AACjC,cAAI,KAAK,MAAMA,EAAC,EAAE,MAAM;AACtB,gBAAI,KAAK,MAAMA,EAAC,EAAE,KAAK,SAAS,QAAQ,aAAa;AACnD,mBAAK,MAAMA,EAAC,EAAE,OAAO,MAAM;AAAA,YAC7B,WAAW,KAAK,MAAMA,EAAC,EAAE,KAAK,SAAS,SAAS,CAAC,aAAa;AAC5D,mBAAK,MAAMA,EAAC,EAAE,OAAO,MAAM;AAAA,YAC7B;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAMA,aAAS,wBAAwB,MAAM,QAAQ;AAC7C,UAAI,KAAK,MAAM,WAAW,KAAK,CAAC,KAAK,WAAW;AAG9C,YAAI,KAAK,IAAI,KAAK,MAAM,CAAC,EAAE,QAAQ,KAAK,MAAM,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC,IAAI,OAAO;AAE3E,eAAK,MAAM,CAAC,EAAE,SAAS,KAAK,YAAY,MAAM;AAAA,QAChD;AAAA,MACF;AAAA,IACF;AASA,IAAAR,MAAK,UAAU,cAAc,WAAY;AACvC,UAAI,SAAS,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACjF,UAAI,KAAK,MAAM,WAAW,GAAG;AAC3B,cAAM,IAAI,MAAM,0GAA0G;AAAA,MAC5H;AACA,UAAI,KAAK,IAAI,KAAK,MAAM,CAAC,EAAE,QAAQ,KAAK,MAAM,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC,KAAK,OAAO;AAC5E,cAAM,IAAI,MAAM,0GAA0G;AAAA,MAC5H;AAUA,UAAI,WAAW,KAAK,UAAU,OAAOP,KAAI,KAAK,KAAK,IAAI;AACvD,UAAI,eAAeA,KAAI,KAAK,MAAM,CAAC,EAAE,KAAK,KAAK;AAC/C,UAAI,aAAa,KAAK,MAAM,CAAC,EAAE;AAC/B,UAAI,aAAa,GAAG;AAClB,eAAO;AAAA,MACT;AACA,UAAI,QAAQ,KAAK,MAAM,CAAC,EAAE;AAC1B,UAAI,WAAW,KAAK,IAAI,WAAW,KAAK,IAAI,WAAW,QAAQ,cAAc,KAAK,CAAC,IAAI,KAAK,OAAO;AACnG,UAAI,WAAW,aAAa,WAAW,SAAU,QAAO;AACxD,iBAAW,KAAK,IAAI,QAAQ;AAC5B,UAAI,WAAW,KAAK,MAAM,CAAC,EAAE,KAAK;AAClC,eAAS,KAAK,UAAU;AACtB,YAAI,eAAe,UAAU,CAAC,GAAG;AAC/B,cAAI,SAAS,SAAS,CAAC;AACvB,cAAI,OAAO,YAAY;AACrB,gBAAIkB,QAAO,KAAK,IAAI,KAAK,IAAI,WAAW,KAAK,IAAI,OAAO,QAAQ,cAAc,KAAK,CAAC,IAAI,KAAK,OAAO,MAAM;AAC1G,gBAAIA,QAAO,YAAYA,UAAS,YAAY,OAAO,KAAK,SAAS,WAAW,KAAK,QAAQ;AAGvF,2BAAa;AACb,yBAAWA;AAAA,YACb;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAeA,IAAAX,MAAK,UAAU,YAAY,SAAU,OAAO;AAC1C,UAAI,IAAI,KAAK,MAAM;AACnB,UAAI,MAAM,CAAC;AACX,eAASQ,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AAErC,YAAI,EAAE,GAAG,MAAMA,EAAC,CAAC;AACjB,YAAIA,OAAM,MAAM,SAAS,EAAG;AAG5B,YAAI,WAAW,EAAE,UAAU;AAI3B,YAAI,WAAWb,OAAM,QAAQ;AAC7B,YAAI,SAAS;AACb,YAAI,gBAAgBC,OAAM,UAAU,QAAQ;AAC5C,YAAI,eAAe;AACjB,mBAAS;AAAA,QACX,OAAO;AACL,mBAASF,KAAI,EAAE,UAAU,CAAC;AAAA,QAC5B;AACA,YAAI,IAAI,IAAIM,MAAK,QAAQ,MAAMQ,EAAC,EAAE,SAAS,CAAC;AAC5C,YAAI,KAAK,CAAC;AACV,YAAInB,gBAAe,GAAG,CAAC;AAAA,MACzB;AAMA,UAAI,UAAU;AACd,eAAS,MAAM,GAAG,MAAM,IAAI,QAAQ,OAAO;AACzC,kBAAUD,WAAU,SAAS,IAAI,GAAG,EAAE,KAAK;AAAA,MAC7C;AACA,UAAIQ,OAAM,SAAS,KAAK,KAAK,GAAG;AAC9B,UAAE,QAAQ;AAAA,MACZ;AACA,UAAI,KAAK,CAAC;AACV,aAAO;AAAA,IACT;AACA,QAAI,WAAW;AAAA,MACb,MAAM;AAAA,QACJ,IAAI;AAAA,UACF,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,MACF;AAAA,MACA,OAAO;AAAA,QACL,IAAI;AAAA,UACF,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,IAAI;AAAA,UACF,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,MACF;AAAA,MACA,MAAM;AAAA,QACJ,IAAI;AAAA,UACF,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,OAAO;AAAA,UACL,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,KAAK;AAAA,UACH,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,OAAO;AAAA,UACL,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,OAAO;AAAA,UACL,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,OAAO;AAAA,UACL,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,QAAQ;AAAA,UACN,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,OAAO;AAAA,UACL,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,OAAO;AAAA,UACL,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,OAAO;AAAA,UACL,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,OAAO;AAAA,UACL,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,OAAO;AAAA,UACL,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,OAAO;AAAA,UACL,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,OAAO;AAAA,UACL,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,QAAQ;AAAA,UACN,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,MACF;AAAA,MACA,SAAS;AAAA,QACP,IAAI;AAAA,UACF,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,IAAI;AAAA,UACF,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,MACF;AAAA,MACA,OAAO;AAAA,QACL,IAAI;AAAA,UACF,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,IAAI;AAAA,UACF,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,MACF;AAAA,MACA,iBAAiB;AAAA,QACf,IAAI;AAAA,UACF,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,GAAG;AAAA,UACD,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,MACF;AAAA,MACA,kBAAkB;AAAA,QAChB,IAAI;AAAA,UACF,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,IAAI;AAAA,UACF,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,IAAI;AAAA,UACF,MAAM;AAAA,UACN,OAAO,KAAK,IAAI,MAAM,CAAC;AAAA,UACvB,YAAY;AAAA,QACd;AAAA,QACA,IAAI;AAAA,UACF,MAAM;AAAA,UACN,OAAO,KAAK,IAAI,MAAM,CAAC;AAAA,UACvB,YAAY;AAAA,QACd;AAAA,QACA,IAAI;AAAA,UACF,MAAM;AAAA,UACN,OAAO,KAAK,IAAI,MAAM,CAAC;AAAA,UACvB,YAAY;AAAA,QACd;AAAA,QACA,IAAI;AAAA,UACF,MAAM;AAAA,UACN,OAAO,KAAK,IAAI,MAAM,CAAC;AAAA,UACvB,YAAY;AAAA,QACd;AAAA,QACA,IAAI;AAAA,UACF,MAAM;AAAA,UACN,OAAO,KAAK,IAAI,MAAM,CAAC;AAAA,UACvB,YAAY;AAAA,QACd;AAAA,QACA,IAAI;AAAA,UACF,MAAM;AAAA,UACN,OAAO,KAAK,IAAI,MAAM,CAAC;AAAA,UACvB,YAAY;AAAA,QACd;AAAA,QACA,IAAI;AAAA,UACF,MAAM;AAAA,UACN,OAAO,KAAK,IAAI,MAAM,CAAC;AAAA,UACvB,YAAY;AAAA,QACd;AAAA,MACF;AAAA,MACA,gBAAgB;AAAA,QACd,IAAI;AAAA,UACF,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,KAAK;AAAA,UACH,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,OAAO;AAAA,UACL,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,OAAO;AAAA,UACL,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,MACF;AAAA,MACA,iBAAiB;AAAA,QACf,IAAI;AAAA,UACF,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO,KAAK,IAAI,MAAM,CAAC;AAAA,UACvB,YAAY;AAAA,QACd;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO,KAAK,IAAI,MAAM,CAAC;AAAA,UACvB,YAAY;AAAA,QACd;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO,KAAK,IAAI,MAAM,CAAC;AAAA,UACvB,YAAY;AAAA,QACd;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO,KAAK,IAAI,MAAM,CAAC;AAAA,UACvB,YAAY;AAAA,QACd;AAAA,QACA,KAAK;AAAA,UACH,MAAM;AAAA,UACN,OAAO,KAAK,IAAI,MAAM,CAAC;AAAA,UACvB,YAAY;AAAA,QACd;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO,KAAK,IAAI,MAAM,CAAC;AAAA,UACvB,YAAY;AAAA,QACd;AAAA,QACA,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,OAAO,KAAK,IAAI,MAAM,CAAC;AAAA,UACvB,YAAY;AAAA,QACd;AAAA,MACF;AAAA,MACA,KAAK;AAAA,QACH,IAAI;AAAA,UACF,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,QACA,IAAI;AAAA,UACF,MAAM;AAAA,UACN,OAAO;AAAA,UACP,YAAY;AAAA,QACd;AAAA,MACF;AAAA,IACF;AACA,aAAS,YAAYM,UAAS,CAAC,GAAG,SAAS,OAAO,SAAS,IAAI;AAC/D,aAAS,eAAeA,UAAS,CAAC,GAAG,SAAS,iBAAiB,SAAS,gBAAgB;AACxF,aAAS,cAAcA,UAAS,CAAC,GAAG,SAAS,gBAAgB,SAAS,eAAe;AAkBrF,QAAI,kBAAkB,CAAC,QAAQ,UAAU,QAAQ,WAAW,eAAe,sBAAsB,uBAAuB,SAAS,KAAK;AACtI,QAAI,aAAa;AAAA,MACf,MAAM;AAAA,QACJ,YAAY,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MACxC;AAAA,MACA,MAAM;AAAA,QACJ,YAAY,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MACxC;AAAA,MACA,QAAQ;AAAA,QACN,YAAY,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MACxC;AAAA,MACA,MAAM;AAAA,QACJ,YAAY,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MACxC;AAAA,MACA,SAAS;AAAA,QACP,YAAY,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MACxC;AAAA,MACA,aAAa;AAAA,QACX,YAAY,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MACxC;AAAA,MACA,oBAAoB;AAAA,QAClB,YAAY,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MACxC;AAAA,MACA,qBAAqB;AAAA,QACnB,YAAY,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MACxC;AAAA,MACA,OAAO;AAAA,QACL,YAAY,CAAC,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MACzC;AAAA,MACA,SAAS;AAAA,QACP,YAAY,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MACxC;AAAA,MACA,QAAQ;AAAA,QACN,YAAY,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MACxC;AAAA,MACA,QAAQ;AAAA,QACN,YAAY,CAAC,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MACzC;AAAA,MACA,OAAO;AAAA,QACL,YAAY,CAAC,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MACzC;AAAA,MACA,UAAU;AAAA,QACR,YAAY,CAAC,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MAC1C;AAAA,MACA,iBAAiB;AAAA,QACf,YAAY,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MACxC;AAAA,MACA,sBAAsB;AAAA,QACpB,YAAY,CAAC,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MAC1C;AAAA,MACA,oBAAoB;AAAA,QAClB,YAAY,CAAC,GAAG,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MAC1C;AAAA,MACA,qBAAqB;AAAA,QACnB,YAAY,CAAC,GAAG,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MAC1C;AAAA,MACA,qBAAqB;AAAA,QACnB,YAAY,CAAC,GAAG,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MAC1C;AAAA,MACA,sBAAsB;AAAA,QACpB,YAAY,CAAC,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MAC1C;AAAA,MACA,eAAe;AAAA,QACb,YAAY,CAAC,GAAG,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MAC1C;AAAA,MACA,uBAAuB;AAAA,QACrB,YAAY,CAAC,GAAG,GAAG,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MAC1C;AAAA,MACA,WAAW;AAAA,QACT,YAAY,CAAC,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MACzC;AAAA,MACA,OAAO;AAAA,QACL,YAAY,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MACxC;AAAA,MACA,KAAK;AAAA,QACH,YAAY,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAAA,MACxC;AAAA,IACF;AACA,aAAS,OAAO,YAAY;AAC1B,UAAI,eAAe,YAAY,GAAG,GAAG;AACnC,mBAAW,GAAG,EAAE,MAAM;AAAA,MACxB;AAAA,IACF;AACA,QAAI,iBAAiB,CAAC;AACtB,QAAI,YAAY;AAAA,MACd,MAAM;AAAA,MACN,MAAM;AAAA,MACN,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,YAAY,gBAAgB,IAAI,OAAK,CAAC;AAAA,IACxC;AACA,QAAI,QAAQ;AAAA;AAAA,MAEV,OAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,OAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,UAAU;AAAA,QACR,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,GAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,IAAI;AAAA,QACF,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,IAAI;AAAA,QACF,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,IAAI;AAAA,QACF,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,IAAI;AAAA,QACF,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,IAAI;AAAA,QACF,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,IAAI;AAAA,QACF,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,IAAI;AAAA,QACF,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA;AAAA,MAIA,IAAI;AAAA,QACF,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,OAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,SAAS;AAAA,QACP,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA;AAAA,MAIA,IAAI;AAAA,QACF,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,GAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,GAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,OAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,UAAU;AAAA,QACR,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,YAAY;AAAA,QACV,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA;AAAA,MAGA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA;AAAA,MAIA,OAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,WAAW;AAAA,QACT,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,YAAY;AAAA,QACV,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,IAAI;AAAA,QACF,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,OAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,QAAQ;AAAA,QACN,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,YAAY;AAAA,QACV,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,WAAW;AAAA,QACT,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,UAAU;AAAA,QACR,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA;AAAA,MAIA,GAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,GAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,OAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,OAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,OAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,WAAW;AAAA,QACT,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,eAAe;AAAA,QACb,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,OAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,OAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,IAAI;AAAA,QACF,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,IAAI;AAAA,QACF,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,IAAI;AAAA,QACF,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,GAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,GAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,QAAQ;AAAA,QACN,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,QAAQ;AAAA,QACN,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO,IAAI;AAAA,QACX,QAAQ;AAAA,MACV;AAAA,MACA,OAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA;AAAA,QAEP,QAAQ;AAAA,MACV;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA;AAAA,QAEP,QAAQ;AAAA,MACV;AAAA,MACA,QAAQ;AAAA,QACN,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA;AAAA,QAEP,QAAQ;AAAA,MACV;AAAA,MACA,SAAS;AAAA,QACP,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA;AAAA,QAEP,QAAQ;AAAA,MACV;AAAA,MACA,YAAY;AAAA,QACV,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA;AAAA,QAEP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,OAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,QACR,YAAY;AAAA,MACd;AAAA,MACA,IAAI;AAAA,QACF,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,QACR,YAAY;AAAA,MACd;AAAA;AAAA,MAEA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,QAAQ;AAAA,QACN,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA;AAAA,QAEP,QAAQ;AAAA,MACV;AAAA,MACA,QAAQ;AAAA,QACN,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA;AAAA,QAEP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA;AAAA,QAEP,QAAQ;AAAA,MACV;AAAA,MACA,SAAS;AAAA,QACP,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA;AAAA,QAEP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,OAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA;AAAA,QAEP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,QAAQ;AAAA,QACN,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA;AAAA,QAEP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,QAAQ;AAAA,QACN,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA;AAAA,QAEP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,GAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,QAAQ;AAAA,QACN,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA;AAAA;AAAA;AAAA,MAKA,GAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO,IAAI,UAAU,GAAG,CAAC;AAAA,QACzB,QAAQ;AAAA,MACV;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO,IAAI,UAAU,GAAG,CAAC;AAAA,QACzB,QAAQ;AAAA,MACV;AAAA,MACA,QAAQ;AAAA,QACN,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,SAAS;AAAA,QACP,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,YAAY;AAAA,QACV,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO,IAAI,UAAU,GAAG,CAAC;AAAA,QACzB,QAAQ;AAAA,MACV;AAAA,MACA,SAAS;AAAA,QACP,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO,IAAI,UAAU,GAAG,CAAC;AAAA,QACzB,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,IAAI;AAAA,QACF,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,SAAS;AAAA,QACP,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,GAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,QAAQ;AAAA,QACN,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,YAAY;AAAA,QACV,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,eAAe;AAAA,QACb,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,GAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,OAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA;AAAA,QAEnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,IAAI;AAAA,QACF,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,IAAI;AAAA,QACF,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,cAAc;AAAA,QACZ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,GAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,IAAI;AAAA,QACF,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAOH,SAAQ;AAAA,QACf,QAAQ;AAAA,MACV;AAAA,MACA,IAAI;AAAA,QACF,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,IAAI;AAAA,QACF,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,OAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,OAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,SAAS;AAAA,QACP,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,GAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,OAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,GAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,GAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,KAAK;AAAA,QACH,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA;AAAA,QAEnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAYA,OAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,GAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,SAAS;AAAA,QACP,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,GAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,OAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,IAAI;AAAA,QACF,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,OAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,GAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA,GAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,MAAM;AAAA,QACJ,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,GAAG;AAAA,QACD,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,MACA,OAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM,WAAW;AAAA,QACjB,UAAU,SAAS;AAAA,QACnB,OAAO;AAAA,QACP,QAAQ;AAAA,MACV;AAAA,IACF;AAIA,QAAI,UAAU;AAAA,MACZ,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,WAAW;AAAA,MACX,IAAI;AAAA,MACJ,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,WAAW;AAAA,MACX,aAAa;AAAA,MACb,QAAQ;AAAA,MACR,MAAM;AAAA,MACN,YAAY;AAAA,MACZ,MAAM;AAAA,MACN,aAAa;AAAA,MACb,IAAI;AAAA,MACJ,OAAO;AAAA,MACP,IAAI;AAAA,MACJ,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,OAAO;AAAA,MACP,IAAI;AAAA,MACJ,QAAQ;AAAA,MACR,KAAK;AAAA,MACL,SAAS;AAAA,MACT,KAAK;AAAA,MACL,aAAa;AAAA,MACb,KAAK;AAAA,MACL,YAAY;AAAA,MACZ,WAAW;AAAA,MACX,MAAM;AAAA,MACN,OAAO;AAAA,MACP,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,aAAa;AAAA,MACb,gBAAgB;AAAA,MAChB,QAAQ;AAAA,MACR,IAAI;AAAA,MACJ,KAAK;AAAA,MACL,MAAM;AAAA,MACN,KAAK;AAAA,MACL,OAAO;AAAA,MACP,UAAU;AAAA,MACV,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,SAAS;AAAA,MACT,MAAM;AAAA,MACN,OAAO;AAAA,MACP,OAAO;AAAA,MACP,SAAS;AAAA,MACT,MAAM;AAAA,MACN,SAAS;AAAA,MACT,MAAM;AAAA,MACN,OAAO;AAAA,MACP,IAAI;AAAA,MACJ,KAAK;AAAA,MACL,MAAM;AAAA,MACN,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,SAAS;AAAA,MACT,WAAW;AAAA,MACX,WAAW;AAAA,MACX,OAAO;AAAA,MACP,SAAS;AAAA,MACT,SAAS;AAAA,MACT,UAAU;AAAA,MACV,QAAQ;AAAA,MACR,WAAW;AAAA,MACX,YAAY;AAAA,MACZ,WAAW;AAAA,MACX,YAAY;AAAA,MACZ,MAAM;AAAA,MACN,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,SAAS;AAAA,MACT,MAAM;AAAA,MACN,KAAK;AAAA,MACL,UAAU;AAAA,MACV,OAAO;AAAA,MACP,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,eAAe;AAAA,MACf,OAAO;AAAA,MACP,KAAK;AAAA,MACL,MAAM;AAAA,IACR;AAOA,aAAS,qBAAqBZ,SAAQ;AACpC,UAAIA,QAAO,WAAW,aAAa;AACjC,YAAIyB,MAAK,kBAAS,UAAU;AAC5B,cAAM,IAAI,QAAQ,IAAI,WAAW,CAAC;AAClC,cAAM,IAAI,QAAQA,IAAG,IAAI,GAAG;AAC5B,cAAM,KAAK,QAAQA,IAAG,IAAI,GAAG;AAC7B,cAAM,MAAM,QAAQA,IAAG,MAAM,CAAC;AAC9B,cAAM,OAAO,QAAQA,IAAG,IAAI,KAAM;AAClC,cAAM,OAAO,QAAQA,IAAG,IAAI,KAAK;AAAA,MACnC,OAAO;AAEL,cAAM,IAAI,QAAQ;AAClB,cAAM,IAAI,QAAQ,KAAK,KAAK;AAC5B,cAAM,KAAK,QAAQ,KAAK,KAAK;AAC7B,cAAM,MAAM,QAAQ,KAAK,KAAK;AAC9B,cAAM,OAAO,QAAQ,KAAK,KAAK;AAC/B,cAAM,OAAO,QAAQ,KAAK,KAAK;AAAA,MACjC;AAGA,YAAM,OAAO,QAAQ,MAAM,IAAI;AAC/B,YAAM,OAAO,QAAQ,MAAM,IAAI;AAC/B,YAAM,QAAQ,QAAQ,MAAM,KAAK;AAAA,IACnC;AAGA,yBAAqBzB,OAAM;AAC3B,QAAID,KAAI;AAEN,MAAAA,IAAG,UAAU,SAAU,MAAM,MAAM;AACjC,YAAI,KAAK,WAAW,KAAK,QAAQ;AAC/B,+BAAqB,IAAI;AAAA,QAC3B;AAAA,MACF,CAAC;AAAA,IACH;AAOA,QAAI,eAAe;AAAA,MACjB,IAAI;AAAA;AAAA,QAEF,MAAM;AAAA,UACJ,MAAM;AAAA,UACN,QAAQ,SAAS,KAAK,EAAE;AAAA,QAC1B;AAAA,QACA,QAAQ;AAAA,UACN,MAAM,MAAM;AAAA,UACZ,QAAQ,SAAS,MAAM,EAAE;AAAA,QAC3B;AAAA,QACA,MAAM;AAAA,UACJ,MAAM,MAAM;AAAA,UACZ,QAAQ,SAAS,MAAM;AAAA,QACzB;AAAA,QACA,MAAM;AAAA,UACJ,MAAM,MAAM;AAAA,UACZ,QAAQ,SAAS,MAAM,EAAE;AAAA,QAC3B;AAAA,QACA,SAAS;AAAA,UACP,MAAM,MAAM;AAAA,UACZ,QAAQ,SAAS,MAAM,EAAE;AAAA,QAC3B;AAAA,QACA,aAAa;AAAA,UACX,MAAM,MAAM;AAAA,UACZ,QAAQ,SAAS,MAAM,EAAE;AAAA,QAC3B;AAAA,QACA,oBAAoB;AAAA,UAClB,MAAM,MAAM;AAAA,UACZ,QAAQ,SAAS,MAAM,EAAE;AAAA,QAC3B;AAAA,QACA,qBAAqB;AAAA,UACnB,MAAM,MAAM;AAAA,UACZ,QAAQ,SAAS,MAAM,EAAE;AAAA,QAC3B;AAAA,QACA,OAAO;AAAA,UACL,MAAM,MAAM;AAAA,UACZ,QAAQ,SAAS,MAAM,EAAE;AAAA,QAC3B;AAAA,QACA,KAAK;AAAA,UACH,MAAM,MAAM;AAAA,UACZ,QAAQ,SAAS,MAAM,EAAE;AAAA,QAC3B;AAAA;AAAA,QAEA,OAAO;AAAA,UACL,MAAM,MAAM;AAAA,UACZ,QAAQ,SAAS,MAAM,EAAE;AAAA,QAC3B;AAAA,QACA,QAAQ;AAAA,UACN,MAAM,MAAM;AAAA,UACZ,QAAQ,SAAS,MAAM,EAAE;AAAA,QAC3B;AAAA,QACA,OAAO;AAAA,UACL,MAAM,MAAM;AAAA,UACZ,QAAQ,SAAS,MAAM,EAAE;AAAA,QAC3B;AAAA,QACA,UAAU;AAAA,UACR,MAAM,MAAM;AAAA,UACZ,QAAQ,SAAS,MAAM,EAAE;AAAA,QAC3B;AAAA,QACA,iBAAiB;AAAA,UACf,MAAM,MAAM;AAAA,UACZ,QAAQ,SAAS,MAAM,EAAE;AAAA,QAC3B;AAAA,QACA,sBAAsB;AAAA,UACpB,MAAM,MAAM;AAAA,UACZ,QAAQ,SAAS,MAAM,EAAE;AAAA,QAC3B;AAAA,QACA,oBAAoB;AAAA,UAClB,MAAM,MAAM;AAAA,UACZ,QAAQ,SAAS,MAAM,EAAE;AAAA,QAC3B;AAAA,QACA,qBAAqB;AAAA,UACnB,MAAM,MAAM;AAAA,UACZ,QAAQ,SAAS,MAAM,EAAE;AAAA,QAC3B;AAAA,QACA,qBAAqB;AAAA,UACnB,MAAM,MAAM;AAAA,UACZ,QAAQ,SAAS,MAAM,EAAE;AAAA,QAC3B;AAAA,QACA,sBAAsB;AAAA,UACpB,MAAM,MAAM;AAAA,UACZ,QAAQ,SAAS,MAAM,EAAE;AAAA,QAC3B;AAAA,QACA,eAAe;AAAA,UACb,MAAM,MAAM;AAAA,UACZ,QAAQ,SAAS,MAAM,EAAE;AAAA,QAC3B;AAAA,QACA,uBAAuB;AAAA,UACrB,MAAM,MAAM;AAAA,UACZ,QAAQ,SAAS,MAAM,EAAE;AAAA,QAC3B;AAAA,QACA,WAAW;AAAA,UACT,MAAM,MAAM;AAAA,UACZ,QAAQ,SAAS,MAAM,EAAE;AAAA,QAC3B;AAAA,MACF;AAAA,IACF;AAGA,iBAAa,MAAM,KAAK,MAAM,KAAK,UAAU,aAAa,EAAE,CAAC;AAC7D,iBAAa,IAAI,SAAS;AAAA,MACxB,MAAM,MAAM;AAAA,MACZ,QAAQ,SAAS,MAAM;AAAA,IACzB;AACA,iBAAa,IAAI,OAAO;AAAA,MACtB,MAAM,MAAM;AAAA,MACZ,QAAQ,SAAS,MAAM,EAAE;AAAA,IAC3B;AACA,iBAAa,IAAI,QAAQ;AAAA,MACvB,MAAM,MAAM;AAAA,MACZ,QAAQ,SAAS,MAAM,EAAE;AAAA,IAC3B;AACA,iBAAa,IAAI,SAAS;AAAA,MACxB,MAAM,MAAM;AAAA,MACZ,QAAQ,SAAS,KAAK,EAAE;AAAA,IAC1B;AAIA,iBAAa,KAAK,KAAK,MAAM,KAAK,UAAU,aAAa,EAAE,CAAC;AAC5D,iBAAa,GAAG,SAAS;AAAA,MACvB,MAAM,MAAM;AAAA,MACZ,QAAQ,SAAS,KAAK,EAAE;AAAA,IAC1B;AACA,iBAAa,GAAG,OAAO;AAAA,MACrB,MAAM,MAAM;AAAA,MACZ,QAAQ,SAAS,KAAK,EAAE;AAAA,IAC1B;AACA,iBAAa,GAAG,cAAc;AAAA,MAC5B,MAAM,MAAM;AAAA,MACZ,QAAQ,SAAS,KAAK,EAAE;AAAA,IAC1B;AACA,iBAAa,GAAG,QAAQ;AAAA,MACtB,MAAM,MAAM;AAAA,MACZ,QAAQ,SAAS,KAAK,EAAE;AAAA,IAC1B;AACA,iBAAa,GAAG,SAAS;AAAA,MACvB,MAAM,MAAM;AAAA,MACZ,QAAQ,SAAS,IAAI,EAAE;AAAA,IACzB;AACA,iBAAa,GAAG,QAAQ;AAAA,MACtB,MAAM,MAAM;AAAA,MACZ,QAAQ,SAAS,KAAK,EAAE;AAAA,IAC1B;AACA,iBAAa,GAAG,WAAW;AAAA,MACzB,MAAM,MAAM;AAAA,MACZ,QAAQ,SAAS,KAAK,EAAE;AAAA,IAC1B;AAKA,iBAAa,OAAO,KAAK,MAAM,KAAK,UAAU,aAAa,EAAE,CAAC;AAG9D,QAAI,oBAAoB,aAAa;AAOrC,IAAAc,MAAK,gBAAgB,SAAUhB,SAAM;AACnC,UAAI,eAAe,cAAcA,OAAI,GAAG;AACtC,4BAAoB,aAAaA,OAAI;AAAA,MACvC,OAAO;AACL,cAAM,IAAI,MAAM,iBAAiBA,UAAO,mCAAmC,OAAO,KAAK,YAAY,EAAE,KAAK,IAAI,CAAC;AAAA,MACjH;AAAA,IACF;AAOA,IAAAgB,MAAK,gBAAgB,WAAY;AAC/B,eAAS,QAAQ,cAAc;AAC7B,YAAI,eAAe,cAAc,IAAI,GAAG;AACtC,cAAI,aAAa,IAAI,MAAM,mBAAmB;AAC5C,mBAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAMA,IAAAA,MAAK,iBAAiB;AAAA,MACpB,WAAW,SAASa,WAAU,GAAG;AAC/B,YAAI,MAAM,QAAQ,MAAM,UAAU,EAAE,WAAY,QAAO,IAAI,WAAW,OAAO,EAAE,CAAC,CAAC,EAAE,IAAI,OAAO,EAAE,CAAC,CAAC,EAAE,MAAM,OAAO,EAAE,CAAC,CAAC;AACrH,eAAO,IAAI,WAAW,IAAI,EAAE;AAAA,MAC9B;AAAA,MACA,UAAU,SAASC,UAAS,GAAG;AAC7B,eAAO,IAAI,UAAU,CAAC;AAAA,MACxB;AAAA,MACA,SAAS,SAASf,SAAQ,GAAG;AAC3B,eAAO;AAAA,MACT;AAAA,MACA,QAAQ,SAASO,QAAO,GAAG;AACzB,YAAI,MAAM,QAAQ,MAAM,UAAU,EAAE,WAAY,QAAO,QAAQ,CAAC;AAChE,eAAO;AAAA,MACT;AAAA,IACF;AASA,IAAAN,MAAK,UAAU,mBAAmB,WAAY;AAC5C,UAAI,UAAUA,MAAK,eAAe,KAAK,UAAU,CAAC;AAClD,UAAI,SAAS;AACX,eAAO;AAAA,MACT;AACA,YAAM,IAAI,UAAU,kCAAkC,KAAK,UAAU,IAAI,GAAG;AAAA,IAC9E;AAUA,IAAAA,MAAK,sBAAsB,SAAU,MAAM;AACzC,UAAI,CAACA,MAAK,eAAe,IAAI,GAAG;AAC9B,cAAM,IAAI,UAAU,uBAAuB,OAAO,GAAG;AAAA,MACvD;AACA,aAAOA,MAAK,eAAe,IAAI;AAAA,IACjC;AAGA,aAAS,SAAS,OAAO;AACvB,UAAI,eAAe,OAAO,KAAK,GAAG;AAChC,YAAIO,QAAO,MAAM,KAAK;AACtB,QAAAA,MAAK,aAAaA,MAAK,KAAK;AAAA,MAC9B;AAAA,IACF;AAGA,aAAS,UAAU,SAAS;AAC1B,UAAI,eAAe,SAAS,MAAM,GAAG;AACnC,YAAI,SAAS,MAAM,QAAQ,MAAM,CAAC;AAClC,YAAI,QAAQ,CAAC;AACb,iBAAS,SAAS,QAAQ;AACxB,cAAI,eAAe,QAAQ,KAAK,GAAG;AACjC,kBAAM,KAAK,IAAI,OAAO,KAAK;AAAA,UAC7B;AAAA,QACF;AACA,cAAM,OAAO;AACb,cAAM,MAAM,IAAI;AAAA,MAClB;AAAA,IACF;AASA,IAAAP,MAAK,eAAe,SAAS,aAAaI,IAAG;AAC3C,aAAO,aAAa,KAAKA,EAAC;AAAA,IAC5B;AACA,aAAS,sBAAsBpB,SAAM;AACnC,eAASwB,KAAI,GAAGA,KAAIxB,QAAK,QAAQwB,MAAK;AACpC,YAAIxB,QAAK,OAAOwB,EAAC;AACjB,YAAIA,OAAM,KAAK,CAACR,MAAK,aAAa,CAAC,GAAG;AACpC,gBAAM,IAAI,MAAM,2DAA2DhB,UAAO,GAAG;AAAA,QACvF;AACA,YAAIwB,KAAI,KAAK,EAAER,MAAK,aAAa,CAAC,KAAK,QAAQ,CAAC,IAAI;AAClD,gBAAM,IAAI,MAAM,oEAAoEhB,UAAO,GAAG;AAAA,QAChG;AAAA,MACF;AAAA,IACF;AAwBA,IAAAgB,MAAK,aAAa,SAAU,KAAK,SAAS;AACxC,UAAI,OAAO,QAAQ,UAAU;AAC3B,cAAM,IAAI,UAAU,2DAA2D;AAAA,MACjF;AAGA,UAAI,WAAW,QAAQ,UAAU;AAC/B,iBAAS,SAAS,KAAK;AACrB,cAAI,eAAe,KAAK,KAAK,GAAG;AAC9B,YAAAA,MAAK,WAAW,KAAK;AAAA,UACvB;AACA,cAAI,IAAI,KAAK,EAAE,SAAS;AACtB,qBAASQ,KAAI,GAAGA,KAAI,IAAI,KAAK,EAAE,QAAQ,QAAQA,MAAK;AAClD,cAAAR,MAAK,WAAW,IAAI,KAAK,EAAE,QAAQQ,EAAC,CAAC;AAAA,YACvC;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAGA,UAAI;AACJ,eAAS,SAAS,KAAK;AACrB,YAAI,eAAe,KAAK,KAAK,GAAG;AAC9B,qBAAWR,MAAK,iBAAiB,OAAO,IAAI,KAAK,CAAC;AAAA,QACpD;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAyBA,IAAAA,MAAK,mBAAmB,SAAUhB,SAAM,KAAK;AAC3C,UAAI,OAAO,QAAQ,eAAe,QAAQ,MAAM;AAC9C,cAAM,CAAC;AAAA,MACT;AACA,UAAI,OAAOA,YAAS,UAAU;AAC5B,cAAM,IAAI,UAAU,iEAAiE;AAAA,MACvF;AAGA,UAAI,eAAe,OAAOA,OAAI,GAAG;AAC/B,cAAM,IAAI,MAAM,yBAAyBA,UAAO,yCAAyC;AAAA,MAC3F;AAIA,4BAAsBA,OAAI;AAC1B,UAAI,UAAU;AACd,UAAI,UAAU,CAAC;AACf,UAAI,SAAS;AACb,UAAI;AACJ,UAAI;AACJ,UAAI;AACJ,UAAI,OAAO,IAAI,SAAS,QAAQ;AAC9B,kBAAU,IAAI,MAAM;AAAA,MACtB,WAAW,OAAO,QAAQ,UAAU;AAClC,YAAI,QAAQ,IAAI;AACd,uBAAa;AAAA,QACf;AAAA,MACF,WAAW,OAAO,QAAQ,UAAU;AAClC,qBAAa,IAAI;AACjB,mBAAW,IAAI;AACf,iBAAS,IAAI;AACb,mBAAW,IAAI;AACf,YAAI,IAAI,SAAS;AACf,oBAAU,IAAI,QAAQ,QAAQ;AAAA,QAChC;AAAA,MACF,OAAO;AACL,cAAM,IAAI,UAAU,yBAAyBA,UAAO,aAAa,IAAI,SAAS,IAAI,6CAA6C;AAAA,MACjI;AACA,UAAI,SAAS;AACX,iBAASwB,KAAI,GAAGA,KAAI,QAAQ,QAAQA,MAAK;AACvC,cAAI,eAAe,OAAO,QAAQA,EAAC,CAAC,GAAG;AACrC,kBAAM,IAAI,MAAM,0BAA0B,QAAQA,EAAC,IAAI,yCAAyC;AAAA,UAClG;AAAA,QACF;AAAA,MACF;AACA,UAAI,cAAc,OAAO,eAAe,YAAY,CAAC,SAAS;AAC5D,YAAI;AACF,oBAAUR,MAAK,MAAM,YAAY;AAAA,YAC/B,cAAc;AAAA,UAChB,CAAC;AAAA,QACH,SAAS,IAAI;AACX,aAAG,UAAU,4BAA4BhB,UAAO,aAAa,aAAa,QAAQ,GAAG;AACrF,gBAAM;AAAA,QACR;AAAA,MACF,WAAW,cAAc,WAAW,SAAS,QAAQ;AACnD,kBAAU,WAAW,MAAM;AAAA,MAC7B;AACA,gBAAU,WAAW,CAAC;AACtB,eAAS,UAAU;AACnB,UAAI,YAAY,SAAS,aAAa;AACpC,mBAAW,SAAS,SAAS,YAAY,CAAC,KAAK,SAAS;AAAA,MAC1D,OAAO;AACL,mBAAW,SAAS;AAAA,MACtB;AAIA,UAAI,UAAU,CAAC;AACf,UAAI,CAAC,SAAS;AAEZ,mBAAW,YAAYA,UAAO;AAC9B,YAAI,gBAAgB,QAAQ,QAAQ,KAAK,GAAG;AAC1C,gBAAM,IAAI,MAAM,kCAAkCA,UAAO,yEAAyE;AAAA,QACpI;AACA,wBAAgB,KAAK,QAAQ;AAG7B,iBAAS,KAAK,YAAY;AACxB,cAAI,eAAe,YAAY,CAAC,GAAG;AACjC,uBAAW,CAAC,EAAE,WAAW,gBAAgB,SAAS,CAAC,IAAI;AAAA,UACzD;AAAA,QACF;AAGA,YAAI,cAAc;AAAA,UAChB,YAAY,CAAC;AAAA,QACf;AACA,iBAAS,MAAM,GAAG,MAAM,gBAAgB,QAAQ,OAAO;AACrD,sBAAY,WAAW,GAAG,IAAI;AAAA,QAChC;AACA,oBAAY,WAAW,gBAAgB,SAAS,CAAC,IAAI;AACrD,oBAAY,MAAM;AAClB,mBAAW,QAAQ,IAAI;AACvB,kBAAU;AAAA,UACR,MAAAA;AAAA,UACA,OAAO;AAAA,UACP,YAAY,WAAW,QAAQ,EAAE,WAAW,MAAM,CAAC;AAAA,UACnD;AAAA,UACA;AAAA,UACA,MAAM,WAAW,QAAQ;AAAA,QAC3B;AACA,0BAAkB,QAAQ,IAAI;AAAA,UAC5B,MAAM;AAAA,UACN,QAAQ,SAAS,KAAK,EAAE;AAAA,QAC1B;AAAA,MACF,OAAO;AACL,kBAAU;AAAA,UACR,MAAAA;AAAA,UACA,OAAO,QAAQ;AAAA,UACf,YAAY,QAAQ,WAAW,MAAM,CAAC;AAAA,UACtC;AAAA,UACA;AAAA,QACF;AAGA,YAAI,WAAW;AACf,iBAAS,OAAO,YAAY;AAC1B,cAAI,eAAe,YAAY,GAAG,GAAG;AACnC,gBAAI,QAAQ;AACZ,qBAAS,IAAI,GAAG,IAAI,gBAAgB,QAAQ,KAAK;AAC/C,kBAAI,KAAK,KAAK,QAAQ,WAAW,CAAC,KAAK,MAAM,WAAW,GAAG,EAAE,WAAW,CAAC,KAAK,EAAE,IAAI,OAAO;AACzF,wBAAQ;AACR;AAAA,cACF;AAAA,YACF;AACA,gBAAI,OAAO;AACT,yBAAW;AACX,sBAAQ,OAAO,WAAW,GAAG;AAC7B;AAAA,YACF;AAAA,UACF;AAAA,QACF;AACA,YAAI,CAAC,UAAU;AACb,qBAAW,YAAYA,UAAO;AAE9B,cAAI,eAAe;AAAA,YACjB,YAAY,QAAQ,WAAW,MAAM,CAAC;AAAA,UACxC;AACA,uBAAa,MAAM;AACnB,qBAAW,QAAQ,IAAI;AACvB,4BAAkB,QAAQ,IAAI;AAAA,YAC5B,MAAM;AAAA,YACN,QAAQ,SAAS,KAAK,EAAE;AAAA,UAC1B;AACA,kBAAQ,OAAO,WAAW,QAAQ;AAAA,QACpC;AAAA,MACF;AACA,MAAAgB,MAAK,MAAMhB,OAAI,IAAI;AACnB,eAAS,MAAM,GAAG,MAAM,QAAQ,QAAQ,OAAO;AAC7C,YAAI,YAAY,QAAQ,GAAG;AAC3B,YAAI,SAAS,CAAC;AACd,iBAAS,SAAS,SAAS;AACzB,cAAI,eAAe,SAAS,KAAK,GAAG;AAClC,mBAAO,KAAK,IAAI,QAAQ,KAAK;AAAA,UAC/B;AAAA,QACF;AACA,eAAO,OAAO;AACd,QAAAgB,MAAK,MAAM,SAAS,IAAI;AAAA,MAC1B;AAGA,aAAO,UAAU;AACjB,aAAO,IAAIA,MAAK,MAAMhB,OAAI;AAAA,IAC5B;AACA,IAAAgB,MAAK,aAAa,SAAUhB,SAAM;AAChC,aAAOgB,MAAK,MAAMhB,OAAI;AAGtB,aAAO,UAAU;AAAA,IACnB;AAGA,IAAAgB,MAAK,WAAW;AAChB,IAAAA,MAAK,kBAAkB;AACvB,IAAAA,MAAK,aAAa;AAClB,IAAAA,MAAK,eAAe;AACpB,IAAAA,MAAK,QAAQ;AACb,WAAOA;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,EACX,CAAC;;;ACh5HD,MAAIe,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,MAAM;AAG5B,MAAI,qBAAoC,wBAAQD,SAAMC,iBAAc,UAAQ;AACjF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,MAAAC;AAAA,IACF,IAAI;AAoCJ,WAAOD,OAAMF,SAAM;AAAA,MACjB,MAAM,SAASG,MAAK,GAAG;AACrB,eAAO,EAAE,MAAM;AAAA,MACjB;AAAA,MACA,QAAQ,SAASC,QAAO,GAAG;AACzB,YAAID,MAAK,gBAAgB,CAAC,GAAG;AAC3B,iBAAO,IAAIA,MAAK,MAAM,CAAC;AAAA,QACzB;AACA,eAAOA,MAAK,MAAM,GAAG;AAAA,UACnB,cAAc;AAAA,QAChB,CAAC;AAAA,MACH;AAAA,MACA,0DAA0D,SAAS,kDAAkD,OAAOE,OAAM;AAChI,eAAO,IAAIF,MAAK,OAAOE,KAAI;AAAA,MAC7B;AAAA,MACA,iCAAiC,SAAS,4BAA4B,OAAO;AAE3E,eAAO,IAAIF,MAAK,KAAK;AAAA,MACvB;AAAA,MACA,kBAAkBD,OAAM,YAAY,CAAAI,UAAQ,OAAKC,SAAQ,GAAGD,KAAI,CAAC;AAAA,IACnE,CAAC;AAAA,EACH,CAAC;;;AClED,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,cAAc;AACpC,MAAI,eAA8B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,cAAAC;AAAA,IACF,IAAI;AAsCJ,WAAOD,OAAMF,SAAM;AAAA,MACjB,IAAI,SAAS,IAAI;AACf,eAAO,IAAIG,cAAa,CAAC,CAAC;AAAA,MAC5B;AAAA,MACA,QAAQ,SAASC,QAAO,UAAU;AAChC,eAAO,IAAID,cAAa,CAAC,GAAG,QAAQ;AAAA,MACtC;AAAA,MACA,kBAAkB,SAAS,cAAc,MAAM;AAC7C,eAAO,IAAIA,cAAa,IAAI;AAAA,MAC9B;AAAA,MACA,0BAA0B,SAAS,qBAAqB,MAAM,UAAU;AACtE,eAAO,IAAIA,cAAa,MAAM,QAAQ;AAAA,MACxC;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC1DD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,MAAM;AAC5B,MAAI,mBAAkC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC/E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,MAAAC;AAAA,IACF,IAAI;AA2CJ,WAAOD,OAAMF,SAAM;AAAA;AAAA,MAEjB,kBAAkB,SAAS,cAAc,KAAK,SAAS;AACrD,eAAOG,MAAK,WAAW,KAAK,OAAO;AAAA,MACrC;AAAA;AAAA,MAEA,QAAQ,SAASC,QAAO,KAAK;AAC3B,eAAOD,MAAK,WAAW,KAAK,CAAC,CAAC;AAAA,MAChC;AAAA;AAAA,MAEA,0CAA0C,SAAS,mCAAmCH,SAAM,KAAK,SAAS;AACxG,YAAI,MAAM,CAAC;AACX,YAAIA,OAAI,IAAI;AACZ,eAAOG,MAAK,WAAW,KAAK,OAAO;AAAA,MACrC;AAAA;AAAA,MAEA,kCAAkC,SAAS,4BAA4BH,SAAM,KAAK;AAChF,YAAI,MAAM,CAAC;AACX,YAAIA,OAAI,IAAI;AACZ,eAAOG,MAAK,WAAW,KAAK,CAAC,CAAC;AAAA,MAChC;AAAA;AAAA,MAEA,QAAQ,SAASE,QAAOL,SAAM;AAC5B,YAAI,MAAM,CAAC;AACX,YAAIA,OAAI,IAAI,CAAC;AACb,eAAOG,MAAK,WAAW,KAAK,CAAC,CAAC;AAAA,MAChC;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC7ED,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,SAAS;AACzC,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,IACF,IAAI;AAyBJ,WAAOF,OAAMF,SAAM;AAAA,MACjB,QAAQ,SAASK,QAAO,GAAG;AACzB,YAAI,KAAK,MAAM,KAAK,KAAKF,QAAO,aAAa;AAC3C,iBAAO,KAAK,KAAK,CAAC;AAAA,QACpB,OAAO;AACL,iBAAO,IAAIC,SAAQ,GAAG,CAAC,EAAE,KAAK;AAAA,QAChC;AAAA,MACF;AAAA,MACA,SAAS,SAASA,SAAQ,GAAG;AAC3B,eAAO,EAAE,KAAK;AAAA,MAChB;AAAA,MACA,WAAW,SAASE,WAAU,GAAG;AAC/B,eAAO,EAAE,KAAK;AAAA,MAChB;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC9CD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,SAAS;AACzC,MAAI,cAA6B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,IACF,IAAI;AAsBJ,WAAOF,OAAMF,SAAM;AAAA,MACjB,QAAQ,SAASK,QAAO,GAAG;AACzB,YAAI,KAAK,KAAKF,QAAO,aAAa;AAChC,iBAAO,YAAY,CAAC;AAAA,QACtB;AACA,YAAI,KAAK,IAAI;AACX,iBAAO,IAAIC,SAAQ,KAAK,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,EAAE;AAAA,QAChE;AACA,eAAO,IAAIA,SAAQ,GAAG,CAAC,EAAE,MAAM;AAAA,MACjC;AAAA,MACA,SAAS,SAASA,SAAQ,GAAG;AAC3B,eAAO,EAAE,MAAM;AAAA,MACjB;AAAA,MACA,WAAW,SAASE,WAAU,GAAG;AAC/B,eAAO,EAAE,MAAM;AAAA,MACjB;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC9CD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,WAAW;AACjC,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAW;AAAA,IACb,IAAI;AAwBJ,WAAOA,OAAMF,SAAM;AAAA,MACjB,QAAQ;AAAA,MACR,SAAS,SAASG,SAAQ,GAAG;AAC3B,eAAO,EAAE,KAAK;AAAA,MAChB;AAAA,MACA,WAAW,SAASC,WAAU,GAAG;AAC/B,eAAO,IAAI,WAAW,CAAC,EAAE,IAAI,CAAC,EAAE,KAAK;AAAA,MACvC;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACvCD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,WAAW,WAAW;AACtD,MAAI,cAA6B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,MACA,WAAW;AAAA,IACb,IAAI;AAuBJ,WAAOF,OAAMF,SAAM;AAAA,MACjB,QAAQ,SAASK,QAAO,GAAG;AACzB,YAAI,KAAK,KAAK,KAAK,MAAMF,QAAO,aAAa;AAC3C,iBAAO,YAAY,CAAC;AAAA,QACtB;AACA,eAAO,IAAIC,SAAQ,GAAG,CAAC,EAAE,MAAM;AAAA,MACjC;AAAA,MACA,SAAS,SAASA,SAAQ,GAAG;AAC3B,eAAO,EAAE,MAAM;AAAA,MACjB;AAAA,MACA,WAAW,SAASE,WAAU,GAAG;AAC/B,eAAO,IAAI,WAAW,CAAC,EAAE,IAAI,CAAC,EAAE,MAAM;AAAA,MACxC;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC7CD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,WAAW,WAAW;AACtD,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,MACA,WAAW;AAAA,IACb,IAAI;AAwBJ,WAAOF,OAAMF,SAAM;AAAA,MACjB,QAAQ,SAASK,QAAO,GAAG;AACzB,YAAI,KAAK,MAAM,KAAK,KAAKF,QAAO,aAAa;AAC3C,iBAAO,WAAW,CAAC;AAAA,QACrB;AACA,eAAO,IAAIC,SAAQ,GAAG,CAAC,EAAE,KAAK;AAAA,MAChC;AAAA,MACA,SAAS,SAASA,SAAQ,GAAG;AAC3B,eAAO,EAAE,KAAK;AAAA,MAChB;AAAA,MACA,WAAW,SAASE,WAAU,GAAG;AAC/B,eAAO,IAAI,WAAW,CAAC,EAAE,IAAI,CAAC,EAAE,KAAK;AAAA,MACvC;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC9CD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,WAAW;AACjC,MAAI,cAA6B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAW;AAAA,IACb,IAAI;AAuBJ,WAAOA,OAAMF,SAAM;AAAA,MACjB,QAAQ;AAAA,MACR,SAAS,SAASG,SAAQ,GAAG;AAC3B,eAAO,EAAE,MAAM;AAAA,MACjB;AAAA,MACA,WAAW,SAASC,WAAU,GAAG;AAC/B,eAAO,IAAI,WAAW,CAAC,EAAE,IAAI,CAAC,EAAE,MAAM;AAAA,MACxC;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACtCD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,WAAW,WAAW;AACtD,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,MACA,WAAW;AAAA,IACb,IAAI;AAyBJ,WAAOF,OAAMF,SAAM;AAAA,MACjB,QAAQ,SAASK,QAAO,GAAG;AACzB,YAAI,KAAK,MAAM,KAAK,KAAKF,QAAO,aAAa;AAC3C,iBAAO,WAAW,CAAC;AAAA,QACrB;AACA,eAAO,IAAIC,SAAQ,GAAG,CAAC,EAAE,KAAK;AAAA,MAChC;AAAA,MACA,SAAS,SAASA,SAAQ,GAAG;AAC3B,eAAO,EAAE,KAAK;AAAA,MAChB;AAAA,MACA,WAAW,SAASE,WAAU,GAAG;AAC/B,eAAO,IAAI,WAAW,CAAC,EAAE,IAAI,CAAC,EAAE,KAAK;AAAA,MACvC;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC/CD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,WAAW,WAAW;AACtD,MAAI,cAA6B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,MACA,WAAW;AAAA,IACb,IAAI;AAuBJ,WAAOF,OAAMF,SAAM;AAAA,MACjB,QAAQ,SAASK,QAAO,GAAG;AACzB,YAAI,KAAK,KAAK,KAAK,MAAMF,QAAO,aAAa;AAC3C,cAAI,OAAO,IAAI;AACf,cAAI,OAAO,KAAKA,QAAO,aAAa;AAClC,mBAAO,YAAY,CAAC;AAAA,UACtB;AACA,cAAI,MAAM,KAAK,KAAK,OAAO,OAAO,CAAC;AACnC,iBAAO,IAAIC,SAAQ,KAAK,IAAI,MAAM,IAAI,GAAG,KAAK,EAAE;AAAA,QAClD;AACA,eAAO,IAAIA,SAAQ,GAAG,CAAC,EAAE,MAAM;AAAA,MACjC;AAAA,MACA,SAAS,SAASA,SAAQ,GAAG;AAC3B,eAAO,EAAE,MAAM;AAAA,MACjB;AAAA,MACA,WAAW,SAASE,WAAU,GAAG;AAC/B,eAAO,IAAI,WAAW,CAAC,EAAE,IAAI,CAAC,EAAE,MAAM;AAAA,MACxC;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACnDD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,SAAS;AACzC,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,IACF,IAAI;AAyBJ,WAAOF,OAAMF,SAAM;AAAA,MACjB,QAAQ,SAASK,QAAO,GAAG;AACzB,YAAI,KAAK,MAAM,KAAK,KAAKF,QAAO,aAAa;AAC3C,iBAAO,KAAK,KAAK,CAAC;AAAA,QACpB,OAAO;AACL,iBAAO,IAAIC,SAAQ,GAAG,CAAC,EAAE,KAAK;AAAA,QAChC;AAAA,MACF;AAAA,MACA,SAAS,SAASA,SAAQ,GAAG;AAC3B,eAAO,EAAE,KAAK;AAAA,MAChB;AAAA,MACA,WAAW,SAASE,WAAU,GAAG;AAC/B,eAAO,EAAE,KAAK;AAAA,MAChB;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC9CD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO;AACpB,MAAI,cAA6B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAuBJ,WAAOA,OAAM,SAAS;AAAA,MACpB,QAAQ;AAAA,MACR,SAAS,SAASC,SAAQ,GAAG;AAC3B,eAAO,EAAE,MAAM;AAAA,MACjB;AAAA,MACA,WAAW,SAASC,WAAU,GAAG;AAC/B,eAAO,EAAE,MAAM;AAAA,MACjB;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACtCD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO;AACpB,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAwBJ,WAAOA,OAAM,QAAQ;AAAA,MACnB,QAAQ,SAASC,QAAO,GAAG;AACzB,eAAO,KAAK,KAAK,CAAC;AAAA,MACpB;AAAA,MACA,SAAS,SAASC,SAAQ,GAAG;AAC3B,eAAO,EAAE,KAAK;AAAA,MAChB;AAAA,MACA,WAAW,SAASC,WAAU,GAAG;AAC/B,eAAO,EAAE,KAAK;AAAA,MAChB;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AClCD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,eAAe,aAAa,eAAe,QAAQ;AACnF,MAAI,cAA6B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,WAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAL;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAF;AAAA,IACF,CAAC;AACD,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAA;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAF;AAAA,MACA,aAAAE;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAF;AAAA,MACA,aAAAI;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAJ;AAAA,MACA,QAAAC;AAAA,MACA,QAAAI;AAAA,IACF,CAAC;AAgCD,WAAOL,OAAMF,SAAM;AAAA,MACjB,kBAAkB,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA,MAMvB,wBAAwB,CAAC,GAAG,MAAMK,WAAU,MAAM,GAAG,CAAC;AAAA,IACxD,GAAG,qBAAqB;AAAA,MACtB,QAAQ;AAAA,MACR,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,CAAC;AAAA,EACJ,CAAC;;;ACvFD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,SAAS;AACzC,MAAI,cAA6B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,IACF,IAAI;AAuBJ,WAAOF,OAAMF,SAAM;AAAA,MACjB,QAAQ,SAASK,QAAO,GAAG;AACzB,YAAI,KAAK,KAAK,KAAK,MAAMF,QAAO,aAAa;AAC3C,iBAAO,YAAY,CAAC;AAAA,QACtB;AACA,eAAO,IAAIC,SAAQ,GAAG,CAAC,EAAE,MAAM;AAAA,MACjC;AAAA,MACA,SAAS,SAASA,SAAQ,GAAG;AAC3B,eAAO,EAAE,MAAM;AAAA,MACjB;AAAA,MACA,WAAW,SAASE,WAAU,GAAG;AAC/B,eAAO,EAAE,MAAM;AAAA,MACjB;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC7CM,MAAI,iBAAgC,wBAAQ,YAAY,CAAC,OAAO,GAAG,UAAQ;AAChF,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AACJ,WAAO;AAAA,MACL,MAAMA,OAAM,YAAY,CAAAC,UAAQ,OAAK;AACnC,YAAI,CAAC,EAAE,QAAQ,EAAE,YAAY,WAAW,KAAK,GAAG;AAC9C,gBAAM,IAAI,UAAU,kCAAkC;AAAA,QACxD;AACA,eAAOD,OAAM,KAAKC,OAAM,EAAE,UAAU,CAAC,EAAE,EAAE,KAAK;AAAA,MAChD,CAAC;AAAA,IACH;AAAA,EACF,CAAC;;;ACXD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO;AACpB,MAAI,YAA2B,wBAAQD,SAAMC,iBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AACJ,QAAI,WAAW,eAAe;AAAA,MAC5B,OAAAA;AAAA,IACF,CAAC;AA6BD,WAAOA,OAAMF,SAAM;AAAA,MACjB,QAAQ,KAAK;AAAA,MACb,uBAAuB,OAAK,EAAE,IAAI;AAAA,IACpC,GAAG,QAAQ;AAAA,EACb,CAAC;;;ACzCD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO;AACpB,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAuBJ,WAAOA,OAAMF,SAAM;AAAA,MACjB,QAAQ;AAAA,MACR,uBAAuB,OAAK,EAAE,KAAK;AAAA,IACrC,CAAC;AAAA,EACH,CAAC;;;AC/BD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,WAAW;AACjC,MAAI,YAA2B,wBAAQD,SAAMC,iBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAW;AAAA,IACb,IAAI;AACJ,QAAI,WAAW,eAAe;AAAA,MAC5B,OAAAA;AAAA,IACF,CAAC;AAwBD,WAAOA,OAAMF,SAAM;AAAA,MACjB,QAAQ;AAAA,MACR,SAAS,OAAK,EAAE,IAAI;AAAA,MACpB,WAAW,OAAK,IAAI,WAAW,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC;AAAA,IAC/C,GAAG,QAAQ;AAAA,EACb,CAAC;;;ACvCD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,WAAW;AACjC,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAW;AAAA,IACb,IAAI;AAyBJ,WAAOA,OAAMF,SAAM;AAAA,MACjB,QAAQ;AAAA,MACR,SAAS,OAAK,EAAE,KAAK;AAAA,MACrB,WAAW,OAAK,IAAI,WAAW,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC;AAAA,IAChD,CAAC;AAAA,EACH,CAAC;;;ACnCD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,WAAW;AACjC,MAAI,YAA2B,wBAAQD,SAAMC,iBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAW;AAAA,IACb,IAAI;AACJ,QAAI,WAAW,eAAe;AAAA,MAC5B,OAAAA;AAAA,IACF,CAAC;AAwBD,WAAOA,OAAMF,SAAM;AAAA,MACjB,QAAQ;AAAA,MACR,SAAS,OAAK,EAAE,IAAI;AAAA,MACpB,WAAW,OAAK,IAAI,WAAW,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC;AAAA,IAC/C,GAAG,QAAQ;AAAA,EACb,CAAC;;;ACvCD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,WAAW;AACjC,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAW;AAAA,IACb,IAAI;AAyBJ,WAAOA,OAAMF,SAAM;AAAA,MACjB,QAAQ;AAAA,MACR,SAAS,OAAK,EAAE,KAAK;AAAA,MACrB,WAAW,OAAK,IAAI,WAAW,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC;AAAA,IAChD,CAAC;AAAA,EACH,CAAC;;;ACnCD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,WAAW;AACjC,MAAI,YAA2B,wBAAQD,SAAMC,iBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAW;AAAA,IACb,IAAI;AACJ,QAAI,WAAW,eAAe;AAAA,MAC5B,OAAAA;AAAA,IACF,CAAC;AAwBD,WAAOA,OAAMF,SAAM;AAAA,MACjB,QAAQ;AAAA,MACR,SAAS,OAAK,EAAE,IAAI;AAAA,MACpB,WAAW,OAAK,IAAI,WAAW,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC;AAAA,IAC/C,GAAG,QAAQ;AAAA,EACb,CAAC;;;ACvCD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,WAAW;AACjC,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAW;AAAA,IACb,IAAI;AAyBJ,WAAOA,OAAMF,SAAM;AAAA,MACjB,QAAQ;AAAA,MACR,SAAS,OAAK,EAAE,KAAK;AAAA,MACrB,WAAW,OAAK,IAAI,WAAW,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC;AAAA,IAChD,CAAC;AAAA,EACH,CAAC;;;ACpCD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO;AACpB,MAAI,YAA2B,wBAAQD,SAAMC,iBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AACJ,QAAI,WAAW,eAAe;AAAA,MAC5B,OAAAA;AAAA,IACF,CAAC;AA6BD,WAAOA,OAAMF,SAAM;AAAA,MACjB,QAAQ,KAAK;AAAA,MACb,uBAAuB,OAAK,EAAE,IAAI;AAAA,IACpC,GAAG,QAAQ;AAAA,EACb,CAAC;;;ACzCD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO;AACpB,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAuBJ,WAAOA,OAAMF,SAAM;AAAA,MACjB,QAAQ;AAAA,MACR,uBAAuB,OAAK,EAAE,KAAK;AAAA,IACrC,CAAC;AAAA,EACH,CAAC;;;AChCD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO;AACpB,MAAI,YAA2B,wBAAQD,SAAMC,iBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AACJ,QAAI,WAAW,eAAe;AAAA,MAC5B,OAAAA;AAAA,IACF,CAAC;AA0BD,WAAOA,OAAMF,SAAM;AAAA,MACjB,QAAQ,KAAK;AAAA,MACb,uBAAuB,OAAK,EAAE,IAAI;AAAA,IACpC,GAAG,QAAQ;AAAA,EACb,CAAC;;;ACtCD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO;AACpB,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AA0BJ,WAAOA,OAAM,QAAQ;AAAA,MACnB,QAAQ;AAAA,MACR,uBAAuB,OAAK,EAAE,KAAK;AAAA,IACrC,CAAC;AAAA,EACH,CAAC;;;ACnCD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,QAAQ,UAAU,kBAAkB,SAAS,aAAa;AAChF,MAAI,qBAAoC,wBAAQD,SAAMC,iBAAc,UAAQ;AACjF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,MAAAC;AAAA,MACA,QAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,OAAAC;AAAA,MACA,aAAAC;AAAA,IACF,IAAI;AAuBJ,WAAOL,OAAMF,SAAM;AAAA,MACjB,kCAAkC,SAAS,4BAA4B,IAAI,IAAI;AAC7E,YAAI,SAAS,CAAC;AACd,YAAII,QAAOD,MAAK,EAAE,GAAG,IAAIG,OAAM,CAAC,CAAC,MAAM,KAAKF,QAAOD,MAAK,EAAE,GAAG,IAAIG,OAAM,CAAC,CAAC,MAAM,GAAG;AAEhF,cAAI,KAAK,QAAQ,MAAM,QAAQ,EAAE,IAAI,KAAK,GAAG,QAAQ,CAAC,EAAE,KAAKD,eAAc;AAC3E,cAAI,KAAK,QAAQ,MAAM,QAAQ,EAAE,IAAI,KAAK,GAAG,QAAQ,CAAC,EAAE,KAAKA,eAAc;AAC3E,mBAAS,CAAC;AACV,mBAASG,KAAI,GAAGA,KAAI,GAAG,QAAQA,MAAK;AAClC,qBAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAClC,qBAAO,KAAK,CAAC,GAAGA,EAAC,GAAG,GAAG,CAAC,CAAC,CAAC;AAAA,YAC5B;AAAA,UACF;AAAA,QACF;AAEA,YAAI,MAAM,QAAQ,EAAE,KAAK,MAAM,QAAQ,EAAE,GAAG;AAC1C,iBAAO;AAAA,QACT;AAEA,eAAO,IAAID,aAAY,MAAM;AAAA,MAC/B;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACvDD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,QAAQ,UAAU,kBAAkB,SAAS,aAAa;AAChF,MAAI,sBAAqC,wBAAQD,SAAMC,iBAAc,UAAQ;AAClF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,MAAAC;AAAA,MACA,QAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,OAAAC;AAAA,MACA,aAAAC;AAAA,IACF,IAAI;AAsBJ,WAAOL,OAAMF,SAAM;AAAA,MACjB,kCAAkC,SAAS,4BAA4B,IAAI,IAAI;AAC7E,YAAI;AACJ,YAAII,QAAOD,MAAK,EAAE,GAAG,IAAIG,OAAM,CAAC,CAAC,MAAM,GAAG;AAExC,mBAAS,CAAC;AAAA,QACZ,WAAWF,QAAOD,MAAK,EAAE,GAAG,IAAIG,OAAM,CAAC,CAAC,MAAM,GAAG;AAE/C,iBAAO,QAAQ,GAAG,QAAQ,CAAC;AAAA,QAC7B,OAAO;AACL,cAAI,KAAK,SAAS,QAAQ,MAAM,QAAQ,EAAE,IAAI,KAAK,GAAG,QAAQ,CAAC,EAAE,KAAKD,eAAc,CAAC;AACrF,cAAI,KAAK,SAAS,QAAQ,MAAM,QAAQ,EAAE,IAAI,KAAK,GAAG,QAAQ,CAAC,EAAE,KAAKA,eAAc,CAAC;AACrF,mBAAS,CAAC;AACV,cAAI;AACJ,mBAASG,KAAI,GAAGA,KAAI,GAAG,QAAQA,MAAK;AAClC,mBAAO;AACP,qBAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAClC,kBAAIH,gBAAe,GAAGG,EAAC,EAAE,OAAO,GAAG,CAAC,EAAE,KAAK,MAAM,KAAK,GAAGA,EAAC,EAAE,eAAe,GAAG,CAAC,EAAE,YAAY;AAE3F,uBAAO;AACP;AAAA,cACF;AAAA,YACF;AACA,gBAAI,CAAC,MAAM;AACT,qBAAO,KAAK,GAAGA,EAAC,CAAC;AAAA,YACnB;AAAA,UACF;AAAA,QACF;AAEA,YAAI,MAAM,QAAQ,EAAE,KAAK,MAAM,QAAQ,EAAE,GAAG;AAC1C,iBAAO,WAAW,MAAM;AAAA,QAC1B;AAEA,eAAO,IAAID,aAAY,WAAW,MAAM,CAAC;AAAA,MAC3C;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACpED,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,QAAQ,UAAU,kBAAkB,SAAS,aAAa;AAChF,MAAI,oBAAmC,wBAAQD,SAAMC,iBAAc,UAAQ;AAChF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,MAAAC;AAAA,MACA,QAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,OAAAC;AAAA,MACA,aAAAC;AAAA,IACF,IAAI;AAqBJ,WAAOL,OAAMF,SAAM;AAAA,MACjB,kBAAkB,SAAS,cAAc,GAAG;AAC1C,YAAI;AACJ,YAAII,QAAOD,MAAK,CAAC,GAAG,IAAIG,OAAM,CAAC,CAAC,MAAM,GAAG;AAEvC,mBAAS,CAAC;AAAA,QACZ,OAAO;AACL,cAAI,IAAI,QAAQ,MAAM,QAAQ,CAAC,IAAI,IAAI,EAAE,QAAQ,CAAC,EAAE,KAAKD,eAAc;AACvE,mBAAS,CAAC;AACV,iBAAO,KAAK,EAAE,CAAC,CAAC;AAChB,mBAASG,KAAI,GAAGA,KAAI,EAAE,QAAQA,MAAK;AACjC,gBAAIH,gBAAe,EAAEG,EAAC,GAAG,EAAEA,KAAI,CAAC,CAAC,MAAM,GAAG;AACxC,qBAAO,KAAK,EAAEA,EAAC,CAAC;AAAA,YAClB;AAAA,UACF;AAAA,QACF;AAEA,YAAI,MAAM,QAAQ,CAAC,GAAG;AACpB,iBAAO;AAAA,QACT;AAEA,eAAO,IAAID,aAAY,MAAM;AAAA,MAC/B;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACvDD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,QAAQ,UAAU,kBAAkB,SAAS,aAAa;AAChF,MAAI,qBAAoC,wBAAQD,SAAMC,iBAAc,UAAQ;AACjF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,MAAAC;AAAA,MACA,QAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,OAAAC;AAAA,MACA,aAAAC;AAAA,IACF,IAAI;AAsBJ,WAAOL,OAAMF,SAAM;AAAA,MACjB,kCAAkC,SAAS,4BAA4B,IAAI,IAAI;AAC7E,YAAI;AACJ,YAAII,QAAOD,MAAK,EAAE,GAAG,IAAIG,OAAM,CAAC,CAAC,MAAM,KAAKF,QAAOD,MAAK,EAAE,GAAG,IAAIG,OAAM,CAAC,CAAC,MAAM,GAAG;AAEhF,mBAAS,CAAC;AAAA,QACZ,OAAO;AACL,cAAI,KAAK,SAAS,QAAQ,MAAM,QAAQ,EAAE,IAAI,KAAK,GAAG,QAAQ,CAAC,EAAE,KAAKD,eAAc,CAAC;AACrF,cAAI,KAAK,SAAS,QAAQ,MAAM,QAAQ,EAAE,IAAI,KAAK,GAAG,QAAQ,CAAC,EAAE,KAAKA,eAAc,CAAC;AACrF,mBAAS,CAAC;AACV,mBAASG,KAAI,GAAGA,KAAI,GAAG,QAAQA,MAAK;AAClC,qBAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAClC,kBAAIH,gBAAe,GAAGG,EAAC,EAAE,OAAO,GAAG,CAAC,EAAE,KAAK,MAAM,KAAK,GAAGA,EAAC,EAAE,eAAe,GAAG,CAAC,EAAE,YAAY;AAE3F,uBAAO,KAAK,GAAGA,EAAC,CAAC;AACjB;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAEA,YAAI,MAAM,QAAQ,EAAE,KAAK,MAAM,QAAQ,EAAE,GAAG;AAC1C,iBAAO,WAAW,MAAM;AAAA,QAC1B;AAEA,eAAO,IAAID,aAAY,WAAW,MAAM,CAAC;AAAA,MAC3C;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC5DD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,QAAQ,UAAU,kBAAkB,OAAO;AACjE,MAAI,oBAAmC,wBAAQD,SAAMC,iBAAc,UAAQ;AAChF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,MAAAC;AAAA,MACA,QAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,OAAAC;AAAA,IACF,IAAI;AAsBJ,WAAOJ,OAAMF,SAAM;AAAA,MACjB,kCAAkC,SAAS,4BAA4B,IAAI,IAAI;AAC7E,YAAII,QAAOD,MAAK,EAAE,GAAG,IAAIG,OAAM,CAAC,CAAC,MAAM,GAAG;AAExC,iBAAO;AAAA,QACT,WAAWF,QAAOD,MAAK,EAAE,GAAG,IAAIG,OAAM,CAAC,CAAC,MAAM,GAAG;AAE/C,iBAAO;AAAA,QACT;AACA,YAAI,KAAK,SAAS,QAAQ,MAAM,QAAQ,EAAE,IAAI,KAAK,GAAG,QAAQ,CAAC,EAAE,KAAKD,eAAc,CAAC;AACrF,YAAI,KAAK,SAAS,QAAQ,MAAM,QAAQ,EAAE,IAAI,KAAK,GAAG,QAAQ,CAAC,EAAE,KAAKA,eAAc,CAAC;AACrF,YAAI;AACJ,iBAASE,KAAI,GAAGA,KAAI,GAAG,QAAQA,MAAK;AAClC,iBAAO;AACP,mBAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAClC,gBAAIF,gBAAe,GAAGE,EAAC,EAAE,OAAO,GAAG,CAAC,EAAE,KAAK,MAAM,KAAK,GAAGA,EAAC,EAAE,eAAe,GAAG,CAAC,EAAE,YAAY;AAE3F,qBAAO;AACP;AAAA,YACF;AAAA,UACF;AACA,cAAI,SAAS,OAAO;AAClB,mBAAO;AAAA,UACT;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC3DD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,QAAQ,UAAU,kBAAkB,OAAO;AACjE,MAAI,wBAAuC,wBAAQD,SAAMC,iBAAc,UAAQ;AACpF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,MAAAC;AAAA,MACA,QAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,OAAAC;AAAA,IACF,IAAI;AAsBJ,WAAOJ,OAAMF,SAAM;AAAA,MACjB,2DAA2D,SAAS,mDAAmDO,IAAG,GAAG;AAC3H,YAAIH,QAAOD,MAAK,CAAC,GAAG,IAAIG,OAAM,CAAC,CAAC,MAAM,GAAG;AAEvC,iBAAO;AAAA,QACT;AACA,YAAI,IAAI,QAAQ,MAAM,QAAQ,CAAC,IAAI,IAAI,EAAE,QAAQ,CAAC;AAClD,YAAIE,SAAQ;AACZ,iBAASC,KAAI,GAAGA,KAAI,EAAE,QAAQA,MAAK;AACjC,cAAIJ,gBAAe,EAAEI,EAAC,GAAGF,EAAC,MAAM,GAAG;AACjC,YAAAC;AAAA,UACF;AAAA,QACF;AACA,eAAOA;AAAA,MACT;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC/CD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,QAAQ,UAAU,kBAAkB,OAAO;AACjE,MAAI,oBAAmC,wBAAQD,SAAMC,iBAAc,UAAQ;AAChF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,MAAAC;AAAA,MACA,QAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,OAAAC;AAAA,IACF,IAAI;AAoBJ,WAAOJ,OAAMF,SAAM;AAAA,MACjB,kBAAkB,SAAS,cAAc,GAAG;AAC1C,YAAII,QAAOD,MAAK,CAAC,GAAG,IAAIG,OAAM,CAAC,CAAC,MAAM,GAAG;AAEvC,iBAAO,CAAC;AAAA,QACV;AACA,YAAI,IAAI,QAAQ,MAAM,QAAQ,CAAC,IAAI,IAAI,EAAE,QAAQ,CAAC,EAAE,KAAKD,eAAc;AACvE,YAAI,SAAS,CAAC;AACd,YAAIE,UAAS;AACb,eAAOA,QAAO,SAAS,CAAC,EAAE,UAAU,EAAE,QAAQ;AAC5C,iBAAO,KAAK,QAAQ,GAAGA,QAAO,SAAS,CAAC,EAAE,MAAM,EAAE,EAAE,QAAQ,CAAC,CAAC;AAC9D,UAAAA;AAAA,QACF;AAEA,eAAO,MAAM,MAAM;AAAA,MACrB;AAAA,IACF,CAAC;AAGD,aAAS,QAAQ,OAAO,UAAU;AAChC,UAAI,SAAS,CAAC;AACd,eAASC,KAAI,GAAGA,KAAI,SAAS,QAAQA,MAAK;AACxC,YAAI,SAASA,EAAC,MAAM,KAAK;AACvB,iBAAO,KAAK,MAAMA,EAAC,CAAC;AAAA,QACtB;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAGA,aAAS,MAAM,OAAO;AACpB,UAAI,OAAO,CAAC;AACZ,eAASA,KAAI,MAAM,SAAS,GAAGA,KAAI,GAAGA,MAAK;AACzC,iBAAS,IAAI,GAAG,IAAIA,IAAG,KAAK;AAC1B,cAAI,MAAM,CAAC,EAAE,SAAS,MAAM,IAAI,CAAC,EAAE,QAAQ;AACzC,mBAAO,MAAM,CAAC;AACd,kBAAM,CAAC,IAAI,MAAM,IAAI,CAAC;AACtB,kBAAM,IAAI,CAAC,IAAI;AAAA,UACjB;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,EACF,CAAC;;;ACxED,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,gBAAgB;AACtC,MAAI,gBAA+B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC5E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,gBAAAC;AAAA,IACF,IAAI;AAuBJ,WAAOD,OAAMF,SAAM;AAAA,MACjB,kBAAkB,SAAS,cAAc,GAAG;AAC1C,eAAO,MAAM,QAAQ,CAAC,IAAI,QAAQ,CAAC,EAAE,SAAS,QAAQ,EAAE,QAAQ,CAAC,EAAE;AAAA,MACrE;AAAA,MACA,2BAA2B,SAAS,sBAAsB,GAAG,QAAQ;AACnE,YAAI,WAAW,SAAS,EAAE,WAAW,GAAG;AACtC,iBAAO,MAAM,QAAQ,CAAC,IAAI,QAAQ,CAAC,EAAE,SAAS,QAAQ,EAAE,QAAQ,CAAC,EAAE;AAAA,QACrE,OAAO;AACL,cAAI,IAAI,QAAQ,MAAM,QAAQ,CAAC,IAAI,IAAI,EAAE,QAAQ,CAAC,EAAE,KAAKG,eAAc;AACvE,cAAIC,SAAQ;AACZ,mBAASC,KAAI,GAAGA,KAAI,EAAE,QAAQA,MAAK;AACjC,gBAAIF,gBAAe,EAAEE,EAAC,GAAG,EAAEA,KAAI,CAAC,CAAC,MAAM,GAAG;AACxC,cAAAD;AAAA,YACF;AAAA,UACF;AACA,iBAAOA;AAAA,QACT;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AChDD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,QAAQ,UAAU,UAAU,iBAAiB,OAAO;AAC1E,MAAI,yBAAwC,wBAAQD,SAAMC,iBAAc,UAAQ;AACrF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,MAAAC;AAAA,MACA,QAAAC;AAAA,MACA,QAAAC;AAAA,MACA,eAAAC;AAAA,MACA,OAAAC;AAAA,IACF,IAAI;AAsBJ,WAAOL,OAAMF,SAAM;AAAA,MACjB,kCAAkC,SAAS,4BAA4B,IAAI,IAAI;AAC7E,YAAIK,QAAOF,MAAK,EAAE,GAAG,IAAII,OAAM,CAAC,CAAC,MAAM,GAAG;AAExC,iBAAO,QAAQ,EAAE;AAAA,QACnB,WAAWF,QAAOF,MAAK,EAAE,GAAG,IAAII,OAAM,CAAC,CAAC,MAAM,GAAG;AAC/C,iBAAO,QAAQ,EAAE;AAAA,QACnB;AACA,YAAI,KAAK,QAAQ,EAAE;AACnB,YAAI,KAAK,QAAQ,EAAE;AACnB,eAAOH,QAAOE,eAAc,IAAI,EAAE,GAAGA,eAAc,IAAI,EAAE,CAAC;AAAA,MAC5D;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC7CD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,QAAQ,UAAU,UAAU,gBAAgB,oBAAoB,OAAO;AAC7F,MAAI,iBAAgC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC7E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,MAAAC;AAAA,MACA,QAAAC;AAAA,MACA,QAAAC;AAAA,MACA,cAAAC;AAAA,MACA,kBAAAC;AAAA,MACA,OAAAC;AAAA,IACF,IAAI;AAsBJ,WAAON,OAAMF,SAAM;AAAA,MACjB,kCAAkC,SAAS,4BAA4B,IAAI,IAAI;AAC7E,YAAIK,QAAOF,MAAK,EAAE,GAAG,IAAIK,OAAM,CAAC,CAAC,MAAM,GAAG;AAExC,iBAAO,QAAQ,EAAE;AAAA,QACnB,WAAWH,QAAOF,MAAK,EAAE,GAAG,IAAIK,OAAM,CAAC,CAAC,MAAM,GAAG;AAC/C,iBAAO,QAAQ,EAAE;AAAA,QACnB;AACA,YAAI,KAAK,QAAQ,EAAE;AACnB,YAAI,KAAK,QAAQ,EAAE;AACnB,eAAOJ,QAAOG,kBAAiB,IAAI,EAAE,GAAGD,cAAa,IAAI,EAAE,CAAC;AAAA,MAC9D;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC3CD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,aAAa,eAAe,eAAe,gBAAgB,QAAQ;AACnG,MAAI,YAA2B,wBAAQD,SAAMC,iBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,aAAAC;AAAA,MACA,aAAAC;AAAA,MACA,cAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAN;AAAA,IACF,CAAC;AACD,QAAI,mBAAmB,uBAAuB;AAAA,MAC5C,OAAAA;AAAA,MACA,aAAAG;AAAA,IACF,CAAC;AACD,QAAI,iBAAiB,qBAAqB;AAAA,MACxC,OAAAH;AAAA,MACA,aAAAI;AAAA,IACF,CAAC;AACD,QAAI,uBAAuB,2BAA2B;AAAA,MACpD,OAAAJ;AAAA,MACA,QAAAC;AAAA,MACA,QAAAK;AAAA,IACF,CAAC;AA0CD,WAAON,OAAMF,SAAM;AAAA,MACjB,YAAYI;AAAA,MACZ,oBAAoBF,OAAM,YAAY,CAAAO,UAAQ,CAAC,GAAG,GAAG,SAAS;AAC5D,YAAI,SAASA,MAAK,GAAG,CAAC;AACtB,iBAASC,KAAI,GAAGA,KAAI,KAAK,QAAQA,MAAK;AACpC,mBAASD,MAAK,QAAQ,KAAKC,EAAC,CAAC;AAAA,QAC/B;AACA,eAAO;AAAA,MACT,CAAC;AAAA,IACH,GAAG,qBAAqB;AAAA,MACtB,MAAMN;AAAA,MACN,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN,CAAC,CAAC;AAAA,EACJ,CAAC;;;ACtFD,MAAIO,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO,aAAa,gBAAgB,kBAAkB,QAAQ,WAAW,YAAY;AAC3G,MAAI,cAA6B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,WAAAC;AAAA,MACA,cAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,MAAAC;AAAA,MACA,SAAAC;AAAA,MACA,YAAAC;AAAA,IACF,IAAI;AA6BJ,WAAOP,OAAMF,SAAM;AAAA,MACjB,0BAA0B;AAAA,MAC1B,OAAO;AAAA,MACP,QAAQ,OAAK,OAAO,QAAQ,EAAE,QAAQ,GAAG,IAAI,CAAC;AAAA,IAChD,CAAC;AAQD,aAAS,OAAO,MAAM;AAGpB,UAAI,SAAS;AACb,UAAI,UAAU;AACd,eAASU,KAAI,GAAGA,KAAI,KAAK,QAAQA,MAAK;AACpC,YAAI,UAAU,KAAKA,EAAC,CAAC,GAAG;AACtB,gBAAM,IAAI,UAAU,sCAAsC;AAAA,QAC5D;AACA,YAAI,QAAQP,KAAI,KAAKO,EAAC,CAAC;AACvB,YAAIF,SAAQ,SAAS,KAAK,GAAG;AAC3B,mBAASF,gBAAe,QAAQA,gBAAeD,cAAa,SAAS,KAAK,GAAGA,cAAa,SAAS,KAAK,CAAC,CAAC;AAC1G,mBAASD,WAAU,QAAQ,CAAC;AAC5B,oBAAU;AAAA,QACZ,OAAO;AACL,mBAASA,WAAU,QAAQK,YAAW,KAAK,IAAIH,gBAAeD,cAAa,OAAO,OAAO,GAAGA,cAAa,OAAO,OAAO,CAAC,IAAI,KAAK;AAAA,QACnI;AAAA,MACF;AACA,aAAOC,gBAAe,SAASC,MAAK,MAAM,CAAC;AAAA,IAC7C;AAAA,EACF,CAAC;;;AC3ED,MAAII,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO,OAAO,OAAO,QAAQ,QAAQ,YAAY,eAAe,UAAU,WAAW,UAAU,cAAc,MAAM;AACzI,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,KAAAC;AAAA,MACA,KAAAC;AAAA,MACA,MAAAC;AAAA,MACA,MAAAC;AAAA,MACA,UAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,MACA,QAAAC;AAAA,MACA,YAAAC;AAAA,MACA,MAAAC;AAAA,IACF,IAAI;AAuCJ,WAAOZ,OAAMF,SAAM;AAAA,MACjB,QAAQ,KAAK;AAAA,MACb,SAAS,SAASe,SAAQ,GAAG;AAC3B,eAAO,EAAE,IAAI;AAAA,MACf;AAAA,MACA,WAAW,SAASC,WAAU,GAAG;AAE/B,eAAO,EAAE,IAAI;AAAA,MACf;AAAA,MACA,SAAS,SAASC,SAAQ,GAAG;AAE3B,eAAO,KAAK,IAAI,CAAC;AAAA,MACnB;AAAA,MACA,OAAO,SAASC,OAAM,GAAG;AACvB,eAAO,MAAMN,QAAO,CAAC,GAAG,CAAC;AAAA,MAC3B;AAAA,MACA,QAAQ,SAASO,QAAO,GAAG;AACzB,eAAO,MAAM,GAAG,CAAC;AAAA,MACnB;AAAA,MACA,sCAAsC,SAAS,gCAAgC,GAAG,GAAG;AACnF,eAAO,MAAMP,QAAO,CAAC,GAAG,CAAC;AAAA,MAC3B;AAAA,MACA,uCAAuC,SAAS,iCAAiC,GAAG,GAAG;AACrF,eAAO,MAAM,GAAG,CAAC;AAAA,MACnB;AAAA,IACF,CAAC;AAQD,aAAS,wBAAwB,GAAG;AAElC,UAAI,OAAO;AAEX,QAAE,QAAQ,SAAU,OAAO;AACzB,YAAI,IAAIT,KAAI,KAAK;AACjB,YAAIO,QAAO,GAAG,IAAI,GAAG;AACnB,iBAAO;AAAA,QACT;AAAA,MACF,GAAG,IAAI;AACP,aAAO;AAAA,IACT;AAQA,aAAS,yBAAyB,GAAG;AAEnC,UAAI;AAEJ,QAAE,QAAQ,SAAU,OAAO;AACzB,YAAI,IAAIP,KAAI,KAAK;AACjB,YAAI,CAAC,QAAQQ,SAAQ,GAAG,IAAI,GAAG;AAC7B,iBAAO;AAAA,QACT;AAAA,MACF,GAAG,IAAI;AACP,aAAO,QAAQ;AAAA,IACjB;AASA,aAAS,YAAY,GAAG,GAAG;AAEzB,UAAI,MAAM,OAAO,qBAAqB,MAAM,OAAO;AACjD,eAAO,wBAAwB,CAAC;AAAA,MAClC;AACA,UAAI,MAAM,OAAO,qBAAqB,MAAM,QAAQ;AAClD,eAAO,yBAAyB,CAAC;AAAA,MACnC;AACA,UAAI,MAAM,OAAO;AACf,eAAO,MAAM,GAAG,CAAC;AAAA,MACnB;AACA,UAAI,OAAO,MAAM,YAAY,CAAC,MAAM,CAAC,GAAG;AAEtC,YAAI,CAACF,aAAY,GAAG,CAAC,GAAG;AAEtB,cAAI,IAAI;AAER,YAAE,QAAQ,SAAU,OAAO;AACzB,gBAAIL,KAAIC,KAAIF,KAAI,KAAK,GAAG,CAAC,GAAG,CAAC;AAAA,UAC/B,GAAG,IAAI;AACP,iBAAOE,KAAI,GAAG,IAAI,CAAC;AAAA,QACrB;AACA,eAAO,OAAO;AAAA,MAChB;AAEA,YAAM,IAAI,MAAM,6BAA6B;AAAA,IAC/C;AAQA,aAAS,qBAAqB,GAAG;AAE/B,UAAI,MAAM;AACV,QAAE,QAAQ,SAAU,OAAOe,QAAO;AAChC,cAAMhB,KAAI,KAAKI,UAAS,OAAOF,MAAK,KAAK,CAAC,CAAC;AAAA,MAC7C,CAAC;AACD,aAAOH,KAAII,MAAK,GAAG,CAAC;AAAA,IACtB;AAQA,aAAS,eAAe,GAAG;AAEzB,UAAI,IAAI,CAAC;AAET,UAAI,OAAO;AAEX,QAAE,QAAQ,SAAU,OAAOa,QAAO;AAChC,YAAI,IAAIA,OAAM,CAAC;AACf,YAAI,KAAKhB,KAAI,EAAE,CAAC,KAAK,GAAGD,KAAI,KAAK,CAAC;AAClC,YAAIO,QAAO,IAAI,IAAI,GAAG;AACpB,iBAAO;AAAA,QACT;AACA,UAAE,CAAC,IAAI;AAAA,MACT,GAAG,IAAI;AACP,aAAO;AAAA,IACT;AAQA,aAAS,eAAe,GAAG;AAEzB,UAAI,QAAQ,EAAE,KAAK;AACnB,UAAI,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AACzB,cAAM,IAAI,WAAW,2BAA2B;AAAA,MAClD;AACA,UAAI,KAAKG,YAAW,CAAC;AACrB,UAAI,WAAWL,UAAS,IAAI,CAAC;AAC7B,UAAI,YAAYM,MAAK,QAAQ,EAAE,OAAO,QAAQ;AAC9C,UAAI,MAAM,UAAU,UAAU,SAAS,CAAC;AACxC,aAAOX,KAAII,MAAK,GAAG,CAAC;AAAA,IACtB;AAQA,aAAS,oBAAoB,GAAG;AAE9B,UAAI,IAAI,CAAC;AAET,UAAI,OAAO;AAEX,QAAE,QAAQ,SAAU,OAAOa,QAAO;AAChC,YAAIC,KAAID,OAAM,CAAC;AACf,YAAI,KAAKhB,KAAI,EAAEiB,EAAC,KAAK,GAAGlB,KAAI,KAAK,CAAC;AAClC,YAAIO,QAAO,IAAI,IAAI,GAAG;AACpB,iBAAO;AAAA,QACT;AACA,UAAEW,EAAC,IAAI;AAAA,MACT,GAAG,IAAI;AACP,aAAO;AAAA,IACT;AASA,aAAS,YAAY,GAAG,GAAG;AAEzB,UAAI,MAAM,GAAG;AACX,eAAO,eAAe,CAAC;AAAA,MACzB;AACA,UAAI,MAAM,OAAO,qBAAqB,MAAM,OAAO;AACjD,eAAO,oBAAoB,CAAC;AAAA,MAC9B;AACA,UAAI,MAAM,OAAO;AACf,eAAO,qBAAqB,CAAC;AAAA,MAC/B;AACA,UAAI,MAAM,GAAG;AACX,eAAO,eAAe,CAAC;AAAA,MACzB;AAEA,YAAM,IAAI,MAAM,iCAAiC,CAAC;AAAA,IACpD;AASA,aAAS,MAAM,GAAG,GAAG;AAEnB,UAAI,QAAQ,EAAE,KAAK;AAGnB,UAAI,MAAM,WAAW,GAAG;AACtB,eAAO,YAAY,GAAG,CAAC;AAAA,MACzB;AAEA,UAAI,MAAM,WAAW,GAAG;AACtB,YAAI,MAAM,CAAC,KAAK,MAAM,CAAC,GAAG;AACxB,iBAAO,YAAY,GAAG,CAAC;AAAA,QACzB,OAAO;AACL,gBAAM,IAAI,WAAW,2BAA2B;AAAA,QAClD;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAC;;;AC5RD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,aAAa,kBAAkB,QAAQ,MAAM;AACnE,MAAI,YAA2B,wBAAQD,SAAMC,iBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,MAAAC;AAAA,MACA,MAAAC;AAAA,IACF,IAAI;AAwBJ,WAAOJ,OAAMF,SAAM;AAAA,MACjB,4CAA4C;AAAA,MAC5C,8BAA8B;AAAA,IAChC,CAAC;AACD,aAAS,aAAa,GAAG,GAAG;AAC1B,UAAI,QAAQM,MAAK,CAAC;AAClB,UAAI,QAAQA,MAAK,CAAC;AAClB,UAAI,MAAM;AACV,UAAI,MAAM,WAAW,GAAG;AACtB,eAAO,MAAM,CAAC;AAAA,MAChB,WAAW,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,GAAG;AAC/C,eAAO,MAAM,CAAC;AAAA,MAChB,OAAO;AACL,cAAM,IAAI,WAAW,6DAA6D,MAAM,KAAK,IAAI,IAAI,GAAG;AAAA,MAC1G;AACA,UAAI,MAAM,WAAW,GAAG;AACtB,eAAO,MAAM,CAAC;AAAA,MAChB,WAAW,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,GAAG;AAC/C,eAAO,MAAM,CAAC;AAAA,MAChB,OAAO;AACL,cAAM,IAAI,WAAW,6DAA6D,MAAM,KAAK,IAAI,IAAI,GAAG;AAAA,MAC1G;AACA,UAAI,SAAS,KAAM,OAAM,IAAI,WAAW,qCAAqC,OAAO,SAAS,OAAO,GAAG;AACvG,UAAI,SAAS,EAAG,OAAM,IAAI,WAAW,mDAAmD;AACxF,aAAO;AAAA,IACT;AACA,aAAS,UAAU,GAAG,GAAG;AACvB,UAAI,IAAI,aAAa,GAAG,CAAC;AACzB,UAAI,QAAQ,SAAS,CAAC,IAAI,EAAE,QAAQ;AACpC,UAAI,MAAM,SAAS,CAAC,IAAI,EAAE,aAAa,EAAE,YAAY,IAAI;AACzD,UAAI,QAAQ,SAAS,CAAC,IAAI,EAAE,QAAQ;AACpC,UAAI,MAAM,SAAS,CAAC,IAAI,EAAE,aAAa,EAAE,YAAY,IAAI;AAGzD,UAAI,YAAYA,MAAK,CAAC,EAAE,WAAW;AACnC,UAAI,YAAYA,MAAK,CAAC,EAAE,WAAW;AACnC,UAAIC,OAAMJ;AACV,UAAIK,OAAMJ;AAGV,UAAI,OAAO,OAAO,QAAQ,OAAO,OAAO,QAAQ,YAAY,QAAQ,SAAS;AAC3E,YAAI,KAAK;AAET,QAAAG,OAAML,OAAM,KAAKC,YAAW,CAAC,IAAI,EAAE,CAAC;AACpC,QAAAK,OAAMN,OAAM,KAAKE,iBAAgB,CAAC,IAAI,EAAE,CAAC;AAAA,MAC3C;AAGA,UAAI,CAAC,aAAa,CAAC,WAAW;AAC5B,YAAI,IAAII,KAAIH,MAAK,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;AACpC,iBAASI,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,cAAIF,KAAI,GAAGC,KAAIH,MAAK,MAAMI,EAAC,CAAC,GAAG,MAAMA,EAAC,CAAC,CAAC;AAAA,QAC1C;AACA,eAAO;AAAA,MACT;AAGA,UAAI,CAAC,aAAa,WAAW;AAC3B,YAAI,KAAKD,KAAIH,MAAK,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;AACxC,iBAAS,KAAK,GAAG,KAAK,GAAG,MAAM;AAC7B,eAAKE,KAAI,IAAIC,KAAIH,MAAK,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC;AAAA,QACjD;AACA,eAAO;AAAA,MACT;AAGA,UAAI,aAAa,CAAC,WAAW;AAC3B,YAAI,MAAMG,KAAIH,MAAK,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;AACzC,iBAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,gBAAME,KAAI,KAAKC,KAAIH,MAAK,MAAM,GAAG,EAAE,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;AAAA,QACrD;AACA,eAAO;AAAA,MACT;AAGA,UAAI,aAAa,WAAW;AAC1B,YAAI,MAAMG,KAAIH,MAAK,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;AAC5C,iBAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,gBAAME,KAAI,KAAKC,KAAIH,MAAK,MAAM,GAAG,EAAE,CAAC,CAAC,GAAG,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC;AAAA,QACxD;AACA,eAAO;AAAA,MACT;AAAA,IACF;AACA,aAAS,WAAW,GAAG,GAAG;AACxB,mBAAa,GAAG,CAAC;AACjB,UAAI,SAAS,EAAE;AACf,UAAI,UAAU,EAAE;AAChB,UAAI,SAAS,EAAE;AACf,UAAI,UAAU,EAAE;AAGhB,UAAI,IAAI;AACR,UAAIE,OAAMJ;AACV,UAAIK,OAAMJ;AACV,UAAIK,KAAI;AACR,UAAI,IAAI;AACR,aAAOA,KAAI,OAAO,UAAU,IAAI,OAAO,QAAQ;AAC7C,YAAI,IAAI,OAAOA,EAAC;AAChB,YAAI,IAAI,OAAO,CAAC;AAChB,YAAI,IAAI,GAAG;AACT,UAAAA;AACA;AAAA,QACF;AACA,YAAI,IAAI,GAAG;AACT;AACA;AAAA,QACF;AACA,YAAI,MAAM,GAAG;AACX,cAAIF,KAAI,GAAGC,KAAI,QAAQC,EAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;AACtC,UAAAA;AACA;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,EACF,CAAC;;;ACnJD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,KAAK;AACrC,MAAI,cAA6B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,KAAAC;AAAA,IACF,IAAI;AA4BJ,WAAOF,OAAM,SAAS;AAAA,MACpB,OAAO,SAAS,YAAY,GAAG;AAE7B,eAAO,YAAYC,QAAO,CAAC,CAAC;AAAA,MAC9B;AAAA,MACA,cAAc;AAAA,MACd,aAAa;AAAA,MACb,KAAKE;AAAA,IACP,CAAC;AACD,aAAS,YAAY,GAAG;AAEtB,UAAIC,QAAO,EAAE;AACb,UAAI,OAAO,EAAE;AAGb,cAAQA,MAAK,QAAQ;AAAA,QACnB,KAAK;AAEH,cAAIA,MAAK,CAAC,MAAM,GAAG;AAEjB,mBAAOD,OAAM,KAAK,CAAC,CAAC;AAAA,UACtB;AACA,gBAAM,IAAI,WAAW,kCAAkCE,QAAOD,KAAI,IAAI,GAAG;AAAA,QAC3E,KAAK,GACH;AAEE,cAAI,OAAOA,MAAK,CAAC;AACjB,cAAI,OAAOA,MAAK,CAAC;AACjB,cAAI,SAAS,MAAM;AAEjB,gBAAIE,OAAM;AAEV,qBAASC,KAAI,GAAGA,KAAI,MAAMA,MAAK;AAC7B,cAAAD,OAAMJ,KAAII,MAAK,KAAKC,EAAC,EAAEA,EAAC,CAAC;AAAA,YAC3B;AAEA,mBAAOD;AAAA,UACT,OAAO;AACL,kBAAM,IAAI,WAAW,kCAAkCD,QAAOD,KAAI,IAAI,GAAG;AAAA,UAC3E;AAAA,QACF;AAAA,QACF;AAEE,gBAAM,IAAI,WAAW,2CAA2CC,QAAOD,KAAI,IAAI,GAAG;AAAA,MACtF;AAAA,IACF;AACA,aAAS,aAAa,GAAG;AAEvB,UAAI,SAAS,EAAE;AACf,UAAII,SAAQ,EAAE;AACd,UAAI,MAAM,EAAE;AACZ,UAAIJ,QAAO,EAAE;AAEb,UAAI,OAAOA,MAAK,CAAC;AACjB,UAAI,UAAUA,MAAK,CAAC;AAEpB,UAAI,SAAS,SAAS;AAEpB,YAAIE,OAAM;AAEV,YAAI,OAAO,SAAS,GAAG;AAErB,mBAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAEhC,gBAAI,KAAK,IAAI,CAAC;AACd,gBAAI,KAAK,IAAI,IAAI,CAAC;AAElB,qBAAS,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5B,kBAAIC,KAAIC,OAAM,CAAC;AAEf,kBAAID,OAAM,GAAG;AAEX,gBAAAD,OAAMJ,KAAII,MAAK,OAAO,CAAC,CAAC;AAExB;AAAA,cACF;AACA,kBAAIC,KAAI,GAAG;AAET;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAEA,eAAOD;AAAA,MACT;AACA,YAAM,IAAI,WAAW,kCAAkCD,QAAOD,KAAI,IAAI,GAAG;AAAA,IAC3E;AAAA,EACF,CAAC;;;AC7HD,MAAIK,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO;AAC7B,MAAI,cAA6B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,OAAAC;AAAA,IACF,IAAI;AA4CJ,WAAOD,OAAMF,SAAM;AAAA,MACjB,2DAA2D,SAAS,gDAAgD,MAAM;AACxH,YAAI,SAAS,KAAK,IAAI,SAAUI,MAAK;AACnC,cAAI,YAAYA,IAAG,GAAG;AACpB,mBAAOA,KAAI,SAAS;AAAA,UACtB,WAAW,QAAQA,IAAG,KAAK,SAASA,IAAG,GAAG;AACxC,mBAAOA,KAAI,IAAI,SAAU,MAAM;AAE7B,qBAAO,YAAY,IAAI,IAAI,KAAK,SAAS,IAAI;AAAA,YAC/C,CAAC;AAAA,UACH,OAAO;AACL,mBAAOA;AAAA,UACT;AAAA,QACF,CAAC;AACD,YAAI,MAAM,IAAID,OAAM;AACpB,QAAAA,OAAM,MAAM,KAAK,MAAM;AACvB,eAAO;AAAA,MACT;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACtEM,MAAI,WAAW,oBAAI,IAAI,CAAC,KAAK,CAAC;;;ACIrC,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,mBAAmB;AAChC,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,mBAAAC;AAAA,IACF,IAAI;AAMJ,aAAS,eAAe,OAAO;AAC7B,eAAS,UAAU,CAAC,GAAG,QAAQ,GAAG;AAChC,YAAI,MAAM,IAAI,MAAM,GAAG;AACrB,gBAAM,IAAI,MAAM,wCAAwC,SAAS,yBAAyB;AAAA,QAC5F;AAAA,MACF;AAAA,IACF;AAAA,IACA,MAAMC,MAAK;AAAA,MACT,IAAI,OAAO;AACT,eAAO;AAAA,MACT;AAAA,MACA,IAAI,SAAS;AACX,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,SAAS,OAAO;AACd,eAAO,KAAK,QAAQ,EAAE,SAAS,KAAK;AAAA,MACtC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAUA,UAAU;AACR,YAAI,OAAO,KAAK,SAASD,oBAAmB,CAAC,CAAC;AAC9C,YAAI,OAAO,CAAC;AACZ,YAAI,UAAU;AACd,iBAASE,UAAS,OAAO;AACvB,cAAI,IAAI,UAAU,KAAK;AACvB,yBAAe,CAAC;AAChB,iBAAO,KAAK,GAAG,MAAM,OAAO;AAAA,QAC9B;AACA,eAAO;AAAA,UACL,UAAAA;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAeA,SAASC,OAAM,UAAU;AACvB,cAAM,IAAI,MAAM,iDAAiD,KAAK,IAAI;AAAA,MAC5E;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ,UAAU;AAEhB,cAAM,IAAI,MAAM,wCAAwC;AAAA,MAC1D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,IAAI,UAAU;AAEZ,cAAM,IAAI,MAAM,oCAAoC;AAAA,MACtD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,QAAQ,MAAM;AACZ,YAAI,CAAC,OAAO,IAAI,GAAG;AACjB,gBAAM,IAAI,UAAU,sCAAsC;AAAA,QAC5D;AACA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,SAAS,UAAU;AAGjB,iBAAS,MAAM,MAAM,IAAI;AAGzB,iBAAS,UAAU,MAAMC,WAAU;AACjC,eAAK,QAAQ,SAAU,OAAO,MAAM,QAAQ;AAC1C,YAAAA,UAAS,OAAO,MAAM,MAAM;AAC5B,sBAAU,OAAOA,SAAQ;AAAA,UAC3B,CAAC;AAAA,QACH;AACA,kBAAU,MAAM,QAAQ;AAAA,MAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAwBA,UAAU,UAAU;AAClB,iBAAS,WAAW,OAAO,MAAM,QAAQ;AACvC,cAAI,cAAc,SAAS,OAAO,MAAM,MAAM;AAC9C,cAAI,gBAAgB,OAAO;AAEzB,mBAAO;AAAA,UACT;AACA,iBAAO,MAAM,IAAI,UAAU;AAAA,QAC7B;AACA,eAAO,WAAW,MAAM,MAAM,IAAI;AAAA,MACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAiBA,OAAO,UAAU;AACf,YAAI,QAAQ,CAAC;AACb,aAAK,SAAS,SAAU,MAAM,MAAM,QAAQ;AAC1C,cAAI,SAAS,MAAM,MAAM,MAAM,GAAG;AAChC,kBAAM,KAAK,IAAI;AAAA,UACjB;AAAA,QACF,CAAC;AACD,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ;AAEN,cAAM,IAAI,MAAM,+BAA+B;AAAA,MACjD;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,YAAY;AACV,eAAO,KAAK,IAAI,SAAU,MAAM;AAC9B,iBAAO,KAAK,UAAU;AAAA,QACxB,CAAC;AAAA,MACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,OAAO,OAAO;AACZ,eAAO,QAAQ,KAAK,SAAS,MAAM,QAAQ,gBAAgB,MAAM,KAAK,IAAI;AAAA,MAC5E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAiBA,SAAS,SAAS;AAChB,YAAI,eAAe,KAAK,iBAAiB,OAAO;AAChD,YAAI,OAAO,iBAAiB,aAAa;AACvC,iBAAO;AAAA,QACT;AACA,eAAO,KAAK,UAAU,OAAO;AAAA,MAC/B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,YAAY;AAEV,cAAM,IAAI,MAAM,mCAAmC,KAAK,IAAI;AAAA,MAC9D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,SAAS;AACP,cAAM,IAAI,MAAM,wDAAwD,KAAK,IAAI;AAAA,MACnF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAiBA,OAAO,SAAS;AACd,YAAI,eAAe,KAAK,iBAAiB,OAAO;AAChD,YAAI,OAAO,iBAAiB,aAAa;AACvC,iBAAO;AAAA,QACT;AACA,eAAO,KAAK,QAAQ,OAAO;AAAA,MAC7B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,UAAU;AAER,cAAM,IAAI,MAAM,iCAAiC,KAAK,IAAI;AAAA,MAC5D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAiBA,MAAM,SAAS;AACb,YAAI,eAAe,KAAK,iBAAiB,OAAO;AAChD,YAAI,OAAO,iBAAiB,aAAa;AACvC,iBAAO;AAAA,QACT;AACA,eAAO,KAAK,OAAO,OAAO;AAAA,MAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,OAAO,SAAS;AAEd,cAAM,IAAI,MAAM,gCAAgC,KAAK,IAAI;AAAA,MAC3D;AAAA;AAAA;AAAA;AAAA,MAKA,iBAAiB,SAAS;AACxB,YAAI,WAAW,OAAO,YAAY,UAAU;AAC1C,kBAAQ,OAAO,QAAQ,SAAS;AAAA,YAC9B,KAAK;AAAA,YACL,KAAK;AACH;AAAA,YACF,KAAK;AACH,qBAAO,QAAQ,QAAQ,MAAM,OAAO;AAAA,YACtC;AACE,oBAAM,IAAI,UAAU,yCAAyC;AAAA,UACjE;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,gBAAgB;AACd,eAAO,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,aAAa;AACX,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAOH;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,IACT,QAAQ;AAAA,EACV,CAAC;;;AC5WM,WAAS,eAAe,KAAK;AAClC,QAAI,OAAO,IAAI,cAAc;AAC3B,aAAO,IAAI,WAAW,IAAI,QAAQ,GAAG,IAAI,MAAM,GAAG,IAAI,QAAQ,SAAY,IAAI,MAAM,IAAI,MAAS;AAAA,IACnG;AACA,WAAO;AAAA,EACT;;;ACVO,WAAS,cAAc,MAAM;AAClC,QAAI;AAAA,MACF,QAAAI;AAAA,IACF,IAAI;AAYJ,WAAO,SAAS,OAAO,QAAQC,QAAO;AACpC,UAAI;AACF,YAAI,MAAM,QAAQ,MAAM,GAAG;AACzB,iBAAOD,QAAO,QAAQC,MAAK;AAAA,QAC7B,WAAW,UAAU,OAAO,OAAO,WAAW,YAAY;AAExD,iBAAO,OAAO,OAAOA,MAAK;AAAA,QAC5B,WAAW,OAAO,WAAW,UAAU;AAErC,iBAAOD,QAAO,QAAQC,MAAK;AAAA,QAC7B,WAAW,OAAO,WAAW,UAAU;AACrC,cAAI,CAACA,OAAM,iBAAiB,GAAG;AAC7B,kBAAM,IAAI,UAAU,iDAAiD;AAAA,UACvE;AACA,iBAAO,gBAAgB,QAAQA,OAAM,kBAAkB,CAAC;AAAA,QAC1D,OAAO;AACL,gBAAM,IAAI,UAAU,gDAAgD;AAAA,QACtE;AAAA,MACF,SAAS,KAAK;AACZ,cAAM,eAAe,GAAG;AAAA,MAC1B;AAAA,IACF;AAAA,EACF;;;AClCA,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,UAAU,MAAM;AAC7B,MAAI,qBAAoC,wBAAQD,SAAMC,iBAAc,UAAQ;AACjF,QAAI;AAAA,MACF,QAAAC;AAAA,MACA,MAAAC;AAAA,IACF,IAAI;AACJ,QAAI,SAAS,cAAc;AAAA,MACzB,QAAAD;AAAA,IACF,CAAC;AAMD,aAAS,gBAAgB,MAAM;AAE7B,aAAO,EAAE,eAAe,IAAI,KAAK,YAAY,IAAI,KAAK,eAAe,IAAI,KAAK,eAAe,IAAI,KAAK,aAAa,IAAI,KAAK,kBAAkB,IAAI,KAAK,aAAa,IAAI;AAAA,IAC1K;AAAA,IACA,MAAME,sBAAqBD,MAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAc9B,YAAY,QAAQE,QAAO;AACzB,YAAI,mBAAmB,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAC3F,cAAM;AACN,YAAI,CAAC,OAAO,MAAM,GAAG;AACnB,gBAAM,IAAI,UAAU,sCAAsC;AAAA,QAC5D;AACA,YAAI,CAAC,YAAYA,MAAK,GAAG;AACvB,gBAAM,IAAI,UAAU,0CAA0C;AAAA,QAChE;AACA,aAAK,SAAS;AACd,aAAK,QAAQA;AACb,aAAK,mBAAmB;AAAA,MAC1B;AAAA;AAAA,MAGA,IAAI,OAAO;AACT,YAAI,KAAK,OAAO;AACd,iBAAO,KAAK,MAAM,iBAAiB,IAAI,KAAK,MAAM,kBAAkB,IAAI;AAAA,QAC1E,OAAO;AACL,iBAAO,KAAK,OAAO,QAAQ;AAAA,QAC7B;AAAA,MACF;AAAA,MACA,IAAI,OAAO;AACT,eAAOL;AAAA,MACT;AAAA,MACA,IAAI,iBAAiB;AACnB,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAeA,SAASM,OAAM,UAAU;AACvB,YAAI,aAAa,KAAK,OAAO,SAASA,OAAM,QAAQ;AACpD,YAAI,YAAY,KAAK,MAAM,SAASA,OAAM,QAAQ;AAClD,YAAI,mBAAmB,KAAK;AAC5B,YAAI,uBAAuB,eAAe,KAAK,MAAM,KAAK,KAAK,OAAO;AACtE,YAAI,KAAK,MAAM,iBAAiB,GAAG;AACjC,cAAI,OAAO,KAAK,MAAM,kBAAkB;AACxC,iBAAO,SAAS,iBAAiB,OAAO,MAAM,SAAS;AACrD,gBAAI,MAAM,WAAW,CAAC;AACtB,gBAAI,SAAS,WAAW,OAAO,MAAM,GAAG;AACxC,gBAAI,oBAAoB,UAAU,MAAM;AACtC,kBAAI,uBAAuB;AAC3B,qBAAO;AAAA,YACT;AACA,gBAAI,wBAAwB,QAAQ,QAAQ,QAAQ,UAAU,IAAI,sBAAsB;AACtF,qBAAO;AAAA,YACT;AAGA,mBAAO,gBAAgB,QAAQ,IAAI;AAAA,UACrC;AAAA,QACF,OAAO;AACL,iBAAO,SAAS,iBAAiB,OAAO,MAAM,SAAS;AACrD,gBAAI,MAAM,WAAW,CAAC;AACtB,gBAAI,SAAS,WAAW,OAAO,MAAM,GAAG;AACxC,gBAAI,oBAAoB,UAAU,MAAM;AACtC,kBAAI,uBAAuB;AAC3B,qBAAO;AAAA,YACT;AACA,gBAAI,wBAAwB,QAAQ,QAAQ,QAAQ,UAAU,IAAI,sBAAsB;AACtF,qBAAO;AAAA,YACT;AAGA,gBAAID,SAAQ,UAAU,OAAO,MAAM,MAAM;AACzC,mBAAO,OAAO,QAAQA,MAAK;AAAA,UAC7B;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ,UAAU;AAChB,iBAAS,KAAK,QAAQ,UAAU,IAAI;AACpC,iBAAS,KAAK,OAAO,SAAS,IAAI;AAAA,MACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,IAAI,UAAU;AACZ,eAAO,IAAID,cAAa,KAAK,QAAQ,SAAS,KAAK,QAAQ,UAAU,IAAI,CAAC,GAAG,KAAK,QAAQ,SAAS,KAAK,OAAO,SAAS,IAAI,CAAC,GAAG,KAAK,gBAAgB;AAAA,MACvJ;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ;AACN,eAAO,IAAIA,cAAa,KAAK,QAAQ,KAAK,OAAO,KAAK,gBAAgB;AAAA,MACxE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,UAAU,SAAS;AACjB,YAAI,SAAS,KAAK,OAAO,SAAS,OAAO;AACzC,YAAI,gBAAgB,KAAK,MAAM,GAAG;AAChC,mBAAS,MAAM,SAAS;AAAA,QAC1B;AACA,YAAI,mBAAmB,KAAK,mBAAmB,KAAK,MAAM,cAAc,MAAM,OAAO;AACrF,eAAO,SAAS,mBAAmB,KAAK,MAAM,SAAS,OAAO;AAAA,MAChE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,QAAQ,SAAS;AACf,YAAI,SAAS,KAAK,OAAO,OAAO,OAAO;AACvC,YAAI,gBAAgB,KAAK,MAAM,GAAG;AAChC,mBAAS,mEAAmE,SAAS;AAAA,QACvF;AACA,eAAO,SAAS,KAAK,MAAM,OAAO,OAAO;AAAA,MAC3C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,OAAO,SAAS;AACd,YAAI,SAAS,KAAK,OAAO,MAAM,OAAO;AACtC,YAAI,gBAAgB,KAAK,MAAM,GAAG;AAChC,mBAAS;AAAA,QACX;AACA,eAAO,SAAS,KAAK,MAAM,MAAM,OAAO;AAAA,MAC1C;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,SAAS;AACP,eAAO;AAAA,UACL,QAAQJ;AAAA,UACR,QAAQ,KAAK;AAAA,UACb,OAAO,KAAK;AAAA,UACZ,kBAAkB,KAAK;AAAA,QACzB;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAUA,OAAO,SAAS,MAAM;AACpB,eAAO,IAAII,cAAa,KAAK,QAAQ,KAAK,OAAO,KAAK,gBAAgB;AAAA,MACxE;AAAA,IACF;AACA,IAAAG,iBAAgBH,eAAc,QAAQJ,OAAI;AAC1C,WAAOI;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,IACT,QAAQ;AAAA,EACV,CAAC;;;ACrND,MAAII,UAAO;AACX,MAAIC,kBAAe,CAAC,MAAM;AACnB,MAAI,kBAAiC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,MAAAC;AAAA,IACF,IAAI;AAAA,IACJ,MAAMC,mBAAkBD,MAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAO3B,YAAY,OAAO;AACjB,cAAM;AACN,aAAK,QAAQ,SAAS,CAAC;AAGvB,YAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,KAAK,CAAC,KAAK,MAAM,MAAM,MAAM,GAAG;AAC3D,gBAAM,IAAI,UAAU,iCAAiC;AAAA,QACvD;AAAA,MACF;AAAA,MACA,IAAI,OAAO;AACT,eAAOF;AAAA,MACT;AAAA,MACA,IAAI,cAAc;AAChB,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAeA,SAASI,OAAM,UAAU;AACvB,YAAI,YAAY,IAAI,KAAK,OAAO,SAAU,MAAM;AAC9C,iBAAO,KAAK,SAASA,OAAM,QAAQ;AAAA,QACrC,CAAC;AACD,YAAI,WAAWA,MAAK,OAAO,WAAW;AACtC,YAAI,UAAU;AACZ,cAAIC,UAASD,MAAK;AAClB,iBAAO,SAAS,cAAc,OAAO,MAAM,SAAS;AAClD,mBAAOC,QAAO,IAAI,WAAW,SAAU,UAAU;AAC/C,qBAAO,SAAS,OAAO,MAAM,OAAO;AAAA,YACtC,CAAC,CAAC;AAAA,UACJ;AAAA,QACF,OAAO;AACL,iBAAO,SAAS,cAAc,OAAO,MAAM,SAAS;AAClD,mBAAO,IAAI,WAAW,SAAU,UAAU;AACxC,qBAAO,SAAS,OAAO,MAAM,OAAO;AAAA,YACtC,CAAC;AAAA,UACH;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ,UAAU;AAChB,iBAASC,KAAI,GAAGA,KAAI,KAAK,MAAM,QAAQA,MAAK;AAC1C,cAAI,OAAO,KAAK,MAAMA,EAAC;AACvB,mBAAS,MAAM,WAAWA,KAAI,KAAK,IAAI;AAAA,QACzC;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,IAAI,UAAU;AACZ,YAAI,QAAQ,CAAC;AACb,iBAASA,KAAI,GAAGA,KAAI,KAAK,MAAM,QAAQA,MAAK;AAC1C,gBAAMA,EAAC,IAAI,KAAK,QAAQ,SAAS,KAAK,MAAMA,EAAC,GAAG,WAAWA,KAAI,KAAK,IAAI,CAAC;AAAA,QAC3E;AACA,eAAO,IAAIH,WAAU,KAAK;AAAA,MAC5B;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ;AACN,eAAO,IAAIA,WAAU,KAAK,MAAM,MAAM,CAAC,CAAC;AAAA,MAC1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,UAAU,SAAS;AACjB,YAAI,QAAQ,KAAK,MAAM,IAAI,SAAU,MAAM;AACzC,iBAAO,KAAK,SAAS,OAAO;AAAA,QAC9B,CAAC;AACD,eAAO,MAAM,MAAM,KAAK,IAAI,IAAI;AAAA,MAClC;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,SAAS;AACP,eAAO;AAAA,UACL,QAAQH;AAAA,UACR,OAAO,KAAK;AAAA,QACd;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,OAAO,SAAS,MAAM;AACpB,eAAO,IAAIG,WAAU,KAAK,KAAK;AAAA,MACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,QAAQ,SAAS;AACf,YAAI,QAAQ,KAAK,MAAM,IAAI,SAAU,MAAM;AACzC,iBAAO,KAAK,OAAO,OAAO;AAAA,QAC5B,CAAC;AACD,eAAO,oEAAoE,MAAM,KAAK,uCAAuC,IAAI;AAAA,MACnI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,OAAO,SAAS;AACd,iBAAS,WAAW,OAAO,QAAQ;AACjC,cAAI,aAAa,MAAM,KAAK,WAAW,KAAK,CAAC,MAAM,MAAM,WAAW;AACpE,cAAI,eAAe,UAAU;AAC7B,cAAI,UAAU,eAAe,MAAM;AACnC,cAAI,WAAW,MAAM,IAAI,SAAU,MAAM;AACvC,gBAAI,KAAK,OAAO;AACd,qBAAO,WAAW,KAAK,OAAO,CAAC,MAAM;AAAA,YACvC,OAAO;AACL,qBAAO,KAAK,MAAM,OAAO;AAAA,YAC3B;AAAA,UACF,CAAC,EAAE,KAAK,OAAO;AACf,iBAAO,cAAc,CAAC,gBAAgB,gBAAgB,CAAC,SAAS,qBAAqB,WAAW,mBAAmB;AAAA,QACrH;AACA,eAAO,WAAW,KAAK,OAAO,KAAK;AAAA,MACrC;AAAA,IACF;AACA,IAAAI,iBAAgBJ,YAAW,QAAQH,OAAI;AACvC,WAAOG;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,IACT,QAAQ;AAAA,EACV,CAAC;;;AC7KM,WAAS,cAAc,MAAM;AAClC,QAAI;AAAA,MACF,QAAAK;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AAeJ,WAAO,SAASC,QAAO,QAAQC,QAAO,OAAO;AAC3C,UAAI;AACF,YAAI,MAAM,QAAQ,MAAM,GAAG;AACzB,cAAI,SAASF,QAAO,MAAM,EAAE,OAAOE,QAAO,KAAK,EAAE,QAAQ;AAGzD,iBAAO,QAAQ,CAAC,MAAMA,WAAU;AAC9B,mBAAOA,MAAK,IAAI;AAAA,UAClB,CAAC;AACD,iBAAO;AAAA,QACT,WAAW,UAAU,OAAO,OAAO,WAAW,YAAY;AAExD,iBAAO,OAAO,OAAOA,QAAO,KAAK;AAAA,QACnC,WAAW,OAAO,WAAW,UAAU;AAErC,iBAAOH,QAAO,QAAQG,QAAO,KAAK;AAAA,QACpC,WAAW,OAAO,WAAW,UAAU;AACrC,cAAI,CAACA,OAAM,iBAAiB,GAAG;AAC7B,kBAAM,UAAU,iDAAiD;AAAA,UACnE;AACA,0BAAgB,QAAQA,OAAM,kBAAkB,GAAG,KAAK;AACxD,iBAAO;AAAA,QACT,OAAO;AACL,gBAAM,IAAI,UAAU,gDAAgD;AAAA,QACtE;AAAA,MACF,SAAS,KAAK;AACZ,cAAM,eAAe,GAAG;AAAA,MAC1B;AAAA,IACF;AAAA,EACF;;;AC9BO,MAAI,aAAa,CAAC;AAAA;AAAA,IAEvB,gBAAgB,CAAC;AAAA,IACjB,wBAAwB,CAAC;AAAA,EAC3B,GAAG;AAAA;AAAA,IAED,iBAAiB;AAAA,MACf,iBAAiB;AAAA,MACjB,kBAAkB;AAAA,MAClB,aAAa;AAAA;AAAA;AAAA,IAGf;AAAA,EACF,GAAG;AAAA;AAAA,IAED,mBAAmB;AAAA,MACjB,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC;AAAA,IACpB;AAAA,EACF,GAAG;AAAA;AAAA,IAED,oBAAoB;AAAA,MAClB,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC;AAAA,IACpB;AAAA,EACF,GAAG;AAAA;AAAA,IAED,oBAAoB;AAAA,MAClB,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC;AAAA,IACpB;AAAA,EACF,GAAG;AAAA;AAAA,IAED,sBAAsB;AAAA,MACpB,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC;AAAA,IACpB;AAAA,EACF,GAAG;AAAA;AAAA,IAED,uBAAuB;AAAA,MACrB,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC;AAAA,IACpB;AAAA,EACF,GAAG;AAAA;AAAA,IAED,uBAAuB;AAAA,MACrB,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC;AAAA,IACpB;AAAA,EACF,GAAG;AAAA;AAAA,IAED,sBAAsB;AAAA,MACpB,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC;AAAA,IACpB;AAAA,IACA,wBAAwB;AAAA,MACtB,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC;AAAA,IACpB;AAAA,IACA,wBAAwB;AAAA,MACtB,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC;AAAA,IACpB;AAAA,IACA,uBAAuB;AAAA,MACrB,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC;AAAA,IACpB;AAAA,IACA,0BAA0B;AAAA,MACxB,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC;AAAA,IACpB;AAAA,IACA,yBAAyB;AAAA,MACvB,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC;AAAA,IACpB;AAAA,IACA,gBAAgB;AAAA,MACd,eAAe;AAAA,MACf,iBAAiB,CAAC;AAAA,IACpB;AAAA,EACF,GAAG;AAAA;AAAA,IAED,0BAA0B;AAAA,MACxB,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC;AAAA,IACpB;AAAA,IACA,gCAAgC;AAAA,MAC9B,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC;AAAA,IACpB;AAAA,IACA,8BAA8B;AAAA,MAC5B,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC;AAAA,IACpB;AAAA,EACF,GAAG;AAAA;AAAA,IAED,mBAAmB;AAAA,MACjB,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC;AAAA,IACpB;AAAA,EACF,GAAG;AAAA;AAAA,IAED,WAAW,CAAC;AAAA,EACd,GAAG;AAAA;AAAA,IAED,oBAAoB;AAAA,MAClB,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC,oBAAoB,uBAAuB;AAAA,IAC/D;AAAA,IACA,yBAAyB;AAAA,MACvB,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC;AAAA,IACpB;AAAA,EACF,GAAG;AAAA;AAAA,IAED,yBAAyB;AAAA,MACvB,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC,yBAAyB,uBAAuB,wBAAwB,oBAAoB;AAAA,IAChH;AAAA,IACA,uBAAuB;AAAA,MACrB,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC;AAAA,MAClB,iBAAiB;AAAA,MACjB,kBAAkB;AAAA,MAClB,aAAa;AAAA;AAAA;AAAA;AAAA,IAIf;AAAA,IACA,4BAA4B;AAAA,MAC1B,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC,yBAAyB,uBAAuB,4BAA4B,uBAAuB;AAAA,IACvH;AAAA,IACA,0BAA0B;AAAA,MACxB,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC;AAAA,IACpB;AAAA,IACA,oBAAoB;AAAA,MAClB,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC;AAAA,IACpB;AAAA,EACF,GAAG;AAAA;AAAA,IAED,yBAAyB;AAAA,MACvB,eAAe;AAAA,MACf,iBAAiB,CAAC,yBAAyB,uBAAuB,wBAAwB,oBAAoB;AAAA,IAChH;AAAA,EACF,GAAG;AAAA;AAAA,IAED,0BAA0B;AAAA,MACxB,IAAI;AAAA,MACJ,eAAe;AAAA,IACjB;AAAA,IACA,2BAA2B;AAAA,MACzB,IAAI;AAAA,MACJ,eAAe;AAAA,IACjB;AAAA,IACA,uBAAuB;AAAA,MACrB,IAAI;AAAA,MACJ,eAAe;AAAA,IACjB;AAAA,IACA,oBAAoB;AAAA,MAClB,IAAI;AAAA,MACJ,eAAe;AAAA,IACjB;AAAA,EACF,GAAG;AAAA;AAAA,IAED,oBAAoB;AAAA,MAClB,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC;AAAA,MAClB,kBAAkB;AAAA;AAAA;AAAA;AAAA,IAIpB;AAAA,IACA,uBAAuB;AAAA,MACrB,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC;AAAA,IACpB;AAAA,EACF,GAAG;AAAA;AAAA,IAED,wBAAwB;AAAA,MACtB,IAAI;AAAA,MACJ,eAAe;AAAA,MACf,iBAAiB,CAAC;AAAA,IACpB;AAAA,EACF,GAAG;AAAA;AAAA,IAED,0BAA0B;AAAA,MACxB,IAAI;AAAA,MACJ,eAAe;AAAA,IACjB;AAAA,EACF,GAAG;AAAA;AAAA,IAED,2BAA2B;AAAA,MACzB,IAAI;AAAA,MACJ,eAAe;AAAA,IACjB;AAAA,EACF,CAAC;AASD,WAAS,YAAY,OAAO,aAAa;AACvC,QAAI,CAAC,eAAe,gBAAgB,OAAQ,QAAO;AACnD,QAAI,OAAO;AACX,WAAO,kBAAkB,IAAI,EAAG,QAAO,KAAK;AAC5C,WAAO;AAAA,EACT;AAaO,WAAS,cAAc,OAAO,aAAa,UAAU,QAAQ;AAClE,QAAI,OAAO;AACX,QAAI,gBAAgB,QAAQ;AAE1B,aAAO,MAAM,WAAW;AAAA,IAC1B;AACA,QAAI,aAAa,KAAK,cAAc;AACpC,QAAI,aAAa;AACjB,aAASC,KAAI,GAAGA,KAAI,WAAW,QAAQA,MAAK;AAC1C,UAAI,cAAc,WAAWA,EAAC,GAAG;AAC/B,qBAAaA;AACb;AAAA,MACF;AAAA,IACF;AAGA,QAAI,eAAe,2BAA2B,KAAK,YAAY,aAAa,QAAQ;AAClF,UAAI,UAAU,YAAY,KAAK,KAAK,CAAC,GAAG,WAAW;AACnD,UAAI,EAAE,eAAe,OAAO,KAAK,UAAU,OAAO,cAAc,MAAM,yBAAyB,UAAU,YAAY,OAAO,KAAK,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,QAAQ,cAAc,MAAM,yBAAyB,UAAU,YAAY,QAAQ,KAAK,CAAC,GAAG,WAAW,CAAC,KAAK,eAAe,YAAY,QAAQ,KAAK,CAAC,CAAC,CAAC,IAAI;AACnT,sBAAc;AAAA,MAChB;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAYO,WAAS,iBAAiB,OAAO,aAAa;AACnD,QAAI,OAAO;AACX,QAAI,gBAAgB,QAAQ;AAE1B,aAAO,MAAM,WAAW;AAAA,IAC1B;AACA,QAAI,aAAa,KAAK,cAAc;AACpC,QAAIC,SAAQ,cAAc,MAAM,WAAW;AAC3C,QAAIA,WAAU,MAAM;AAElB,aAAO;AAAA,IACT;AACA,QAAI,WAAW,WAAWA,MAAK,EAAE,UAAU;AAC3C,QAAI,eAAe,UAAU,eAAe,GAAG;AAC7C,UAAI,SAAS,kBAAkB,QAAQ;AACrC,eAAO;AAAA,MACT;AACA,UAAI,SAAS,kBAAkB,SAAS;AACtC,eAAO;AAAA,MACT;AAEA,YAAM,MAAM,MAAO,aAAa,sCAAwC,SAAS,gBAAgB,IAAK;AAAA,IACxG;AAGA,WAAO;AAAA,EACT;AAWO,WAAS,kBAAkB,OAAO,OAAO,aAAa;AAE3D,QAAI,IAAI,gBAAgB,SAAS,MAAM,WAAW,IAAI;AACtD,QAAI,IAAI,gBAAgB,SAAS,MAAM,WAAW,IAAI;AACtD,QAAI,cAAc,EAAE,cAAc;AAClC,QAAI,cAAc,EAAE,cAAc;AAClC,QAAIA,SAAQ,cAAc,GAAG,WAAW;AACxC,QAAIA,WAAU,MAAM;AAElB,aAAO;AAAA,IACT;AACA,QAAI,WAAW,WAAWA,MAAK,EAAE,WAAW;AAC5C,QAAI,eAAe,UAAU,iBAAiB,KAAK,SAAS,2BAA2B,OAAO;AAC5F,eAASD,KAAI,GAAGA,KAAI,SAAS,gBAAgB,QAAQA,MAAK;AACxD,YAAI,SAAS,gBAAgBA,EAAC,MAAM,aAAa;AAC/C,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAGA,WAAO;AAAA,EACT;AAWO,WAAS,YAAY,IAAI;AAC9B,QAAI,aAAa,kBAAkB;AACnC,aAAS,SAAS,YAAY;AAC5B,UAAI,cAAc,OAAO;AACvB,eAAO,MAAM,UAAU,EAAE;AAAA,MAC3B;AAAA,IACF;AACA,WAAO;AAAA,EACT;;;ACxXA,MAAIE,UAAO;AACX,MAAIC,kBAAe;AAAA,IAAC;AAAA,IAAU;AAAA;AAAA,IAE9B;AAAA,EAAM;AACC,MAAI,uBAAsC,wBAAQD,SAAMC,iBAAc,UAAQ;AACnF,QAAI;AAAA,MACF,QAAAC;AAAA,MACA,QAAAC;AAAA,MACA,MAAAC;AAAA,IACF,IAAI;AACJ,QAAI,SAAS,cAAc;AAAA,MACzB,QAAAF;AAAA,IACF,CAAC;AACD,QAAIG,UAAS,cAAc;AAAA,MACzB,QAAAH;AAAA,MACA,QAAAC;AAAA,IACF,CAAC;AASD,aAAS,gBAAgB,MAAM,aAAa,UAAU;AACpD,UAAI,CAAC,aAAa;AAChB,sBAAc;AAAA,MAChB;AACA,UAAI,aAAa,cAAc,MAAM,aAAa,QAAQ;AAC1D,UAAI,iBAAiB,cAAc,KAAK,OAAO,aAAa,QAAQ;AACpE,aAAO,gBAAgB,SAAS,mBAAmB,QAAQ,kBAAkB;AAAA,IAC/E;AAAA,IACA,MAAMG,wBAAuBF,MAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAgChC,YAAY,QAAQG,QAAO,OAAO;AAChC,cAAM;AACN,aAAK,SAAS;AACd,aAAK,QAAQ,QAAQA,SAAQ;AAC7B,aAAK,QAAQ,SAASA;AAGtB,YAAI,CAAC,aAAa,MAAM,KAAK,CAAC,eAAe,MAAM,GAAG;AACpD,gBAAM,IAAI,UAAU,iDAAiD;AAAA,QACvE;AACA,YAAI,aAAa,MAAM,KAAK,OAAO,SAAS,OAAO;AACjD,gBAAM,IAAI,MAAM,+BAA+B;AAAA,QACjD;AACA,YAAI,KAAK,SAAS,CAAC,YAAY,KAAK,KAAK,GAAG;AAE1C,gBAAM,IAAI,UAAU,+BAA+B;AAAA,QACrD;AACA,YAAI,CAAC,OAAO,KAAK,KAAK,GAAG;AACvB,gBAAM,IAAI,UAAU,0BAA0B;AAAA,QAChD;AAAA,MACF;AAAA;AAAA;AAAA,MAKA,IAAI,OAAO;AACT,YAAI,KAAK,OAAO;AACd,iBAAO,KAAK,MAAM,iBAAiB,IAAI,KAAK,MAAM,kBAAkB,IAAI;AAAA,QAC1E,OAAO;AACL,iBAAO,KAAK,OAAO,QAAQ;AAAA,QAC7B;AAAA,MACF;AAAA,MACA,IAAI,OAAO;AACT,eAAOP;AAAA,MACT;AAAA,MACA,IAAI,mBAAmB;AACrB,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAeA,SAASQ,OAAM,UAAU;AACvB,YAAI,aAAa,KAAK,OAAO,SAASA,OAAM,QAAQ;AACpD,YAAI,YAAY,KAAK,QAAQ,KAAK,MAAM,SAASA,OAAM,QAAQ,IAAI;AACnE,YAAI,YAAY,KAAK,MAAM,SAASA,OAAM,QAAQ;AAClD,YAAIR,UAAO,KAAK,OAAO;AACvB,YAAI,CAAC,KAAK,OAAO;AAEf,cAAI,CAAC,aAAa,KAAK,MAAM,GAAG;AAC9B,kBAAM,IAAI,UAAU,+BAA+B;AAAA,UACrD;AACA,iBAAO,SAAS,mBAAmB,OAAO,MAAM,SAAS;AACvD,gBAAI,QAAQ,UAAU,OAAO,MAAM,OAAO;AAC1C,kBAAM,IAAIA,SAAM,KAAK;AACrB,mBAAO;AAAA,UACT;AAAA,QACF,WAAW,KAAK,MAAM,iBAAiB,GAAG;AAExC,cAAI,OAAO,KAAK,MAAM,kBAAkB;AACxC,iBAAO,SAAS,mBAAmB,OAAO,MAAM,SAAS;AACvD,gBAAI,SAAS,WAAW,OAAO,MAAM,OAAO;AAC5C,gBAAI,QAAQ,UAAU,OAAO,MAAM,OAAO;AAC1C,4BAAgB,QAAQ,MAAM,KAAK;AACnC,mBAAO;AAAA,UACT;AAAA,QACF,WAAW,aAAa,KAAK,MAAM,GAAG;AAEpC,iBAAO,SAAS,mBAAmB,OAAO,MAAM,SAAS;AACvD,gBAAI,cAAc,WAAW,OAAO,MAAM,OAAO;AACjD,gBAAI,QAAQ,UAAU,OAAO,MAAM,OAAO;AAE1C,gBAAIO,SAAQ,UAAU,OAAO,MAAM,WAAW;AAC9C,kBAAM,IAAIP,SAAMK,QAAO,aAAaE,QAAO,KAAK,CAAC;AACjD,mBAAO;AAAA,UACT;AAAA,QACF,OAAO;AAQL,cAAI,mBAAmB,KAAK,OAAO,OAAO,SAASC,OAAM,QAAQ;AACjE,cAAI,KAAK,OAAO,MAAM,iBAAiB,GAAG;AACxC,gBAAI,aAAa,KAAK,OAAO,MAAM,kBAAkB;AACrD,mBAAO,SAAS,mBAAmB,OAAO,MAAM,SAAS;AACvD,kBAAI,SAAS,iBAAiB,OAAO,MAAM,OAAO;AAClD,kBAAI,cAAc,gBAAgB,QAAQ,UAAU;AAEpD,kBAAID,SAAQ,UAAU,OAAO,MAAM,WAAW;AAC9C,kBAAI,QAAQ,UAAU,OAAO,MAAM,OAAO;AAC1C,8BAAgB,QAAQ,YAAYF,QAAO,aAAaE,QAAO,KAAK,CAAC;AACrE,qBAAO;AAAA,YACT;AAAA,UACF,OAAO;AAGL,gBAAI,kBAAkB,KAAK,OAAO,MAAM,SAASC,OAAM,QAAQ;AAC/D,mBAAO,SAAS,mBAAmB,OAAO,MAAM,SAAS;AACvD,kBAAI,SAAS,iBAAiB,OAAO,MAAM,OAAO;AAElD,kBAAI,cAAc,gBAAgB,OAAO,MAAM,MAAM;AACrD,kBAAI,cAAc,OAAO,QAAQ,WAAW;AAE5C,kBAAID,SAAQ,UAAU,OAAO,MAAM,WAAW;AAC9C,kBAAI,QAAQ,UAAU,OAAO,MAAM,OAAO;AAC1C,cAAAF,QAAO,QAAQ,aAAaA,QAAO,aAAaE,QAAO,KAAK,CAAC;AAC7D,qBAAO;AAAA,YACT;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ,UAAU;AAChB,iBAAS,KAAK,QAAQ,UAAU,IAAI;AACpC,YAAI,KAAK,OAAO;AACd,mBAAS,KAAK,OAAO,SAAS,IAAI;AAAA,QACpC;AACA,iBAAS,KAAK,OAAO,SAAS,IAAI;AAAA,MACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,IAAI,UAAU;AACZ,YAAI,SAAS,KAAK,QAAQ,SAAS,KAAK,QAAQ,UAAU,IAAI,CAAC;AAC/D,YAAIA,SAAQ,KAAK,QAAQ,KAAK,QAAQ,SAAS,KAAK,OAAO,SAAS,IAAI,CAAC,IAAI;AAC7E,YAAI,QAAQ,KAAK,QAAQ,SAAS,KAAK,OAAO,SAAS,IAAI,CAAC;AAC5D,eAAO,IAAID,gBAAe,QAAQC,QAAO,KAAK;AAAA,MAChD;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ;AACN,eAAO,IAAID,gBAAe,KAAK,QAAQ,KAAK,OAAO,KAAK,KAAK;AAAA,MAC/D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,UAAU,SAAS;AACjB,YAAI,SAAS,KAAK,OAAO,SAAS,OAAO;AACzC,YAAIC,SAAQ,KAAK,QAAQ,KAAK,MAAM,SAAS,OAAO,IAAI;AACxD,YAAI,QAAQ,KAAK,MAAM,SAAS,OAAO;AACvC,YAAI,gBAAgB,MAAM,WAAW,QAAQ,aAAa,WAAW,QAAQ,QAAQ,GAAG;AACtF,kBAAQ,MAAM,QAAQ;AAAA,QACxB;AACA,eAAO,SAASA,SAAQ,QAAQ;AAAA,MAClC;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,SAAS;AACP,eAAO;AAAA,UACL,QAAQP;AAAA,UACR,QAAQ,KAAK;AAAA,UACb,OAAO,KAAK;AAAA,UACZ,OAAO,KAAK;AAAA,QACd;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAUA,OAAO,SAAS,MAAM;AACpB,eAAO,IAAIM,gBAAe,KAAK,QAAQ,KAAK,OAAO,KAAK,KAAK;AAAA,MAC/D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,QAAQ,SAAS;AACf,YAAI,SAAS,KAAK,OAAO,OAAO,OAAO;AACvC,YAAIC,SAAQ,KAAK,QAAQ,KAAK,MAAM,OAAO,OAAO,IAAI;AACtD,YAAI,QAAQ,KAAK,MAAM,OAAO,OAAO;AACrC,YAAI,gBAAgB,MAAM,WAAW,QAAQ,aAAa,WAAW,QAAQ,QAAQ,GAAG;AACtF,kBAAQ,mEAAmE,QAAQ;AAAA,QACrF;AACA,eAAO,SAASA,SAAQ,yHAA8H;AAAA,MACxJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,OAAO,SAAS;AACd,YAAI,SAAS,KAAK,OAAO,MAAM,OAAO;AACtC,YAAIA,SAAQ,KAAK,QAAQ,KAAK,MAAM,MAAM,OAAO,IAAI;AACrD,YAAI,QAAQ,KAAK,MAAM,MAAM,OAAO;AACpC,YAAI,gBAAgB,MAAM,WAAW,QAAQ,aAAa,WAAW,QAAQ,QAAQ,GAAG;AACtF,kBAAQ,UAAU,OAAO,OAAO,UAAU;AAAA,QAC5C;AACA,eAAO,SAASA,SAAQ,MAAM;AAAA,MAChC;AAAA,IACF;AACA,IAAAE,iBAAgBH,iBAAgB,QAAQN,OAAI;AAC5C,WAAOM;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,IACT,QAAQ;AAAA,EACV,CAAC;;;AC7SD,MAAII,UAAO;AACX,MAAIC,kBAAe,CAAC,aAAa,MAAM;AAChC,MAAI,kBAAiC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,WAAAC;AAAA,MACA,MAAAC;AAAA,IACF,IAAI;AAAA,IACJ,MAAMC,mBAAkBD,MAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAW3B,YAAY,QAAQ;AAClB,cAAM;AAEN,YAAI,CAAC,MAAM,QAAQ,MAAM,EAAG,OAAM,IAAI,MAAM,gBAAgB;AAC5D,aAAK,SAAS,OAAO,IAAI,SAAU,OAAO;AACxC,cAAI,OAAO,SAAS,MAAM;AAC1B,cAAI,UAAU,SAAS,MAAM,YAAY,SAAY,MAAM,UAAU;AACrE,cAAI,CAAC,OAAO,IAAI,EAAG,OAAM,IAAI,UAAU,gCAAgC;AACvE,cAAI,OAAO,YAAY,WAAW;AAChC,kBAAM,IAAI,UAAU,sCAAsC;AAAA,UAC5D;AACA,iBAAO;AAAA,YACL;AAAA,YACA;AAAA,UACF;AAAA,QACF,CAAC;AAAA,MACH;AAAA,MACA,IAAI,OAAO;AACT,eAAOH;AAAA,MACT;AAAA,MACA,IAAI,cAAc;AAChB,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAeA,SAASK,OAAM,UAAU;AACvB,YAAI,aAAa,IAAI,KAAK,QAAQ,SAAU,OAAO;AACjD,iBAAO;AAAA,YACL,UAAU,MAAM,KAAK,SAASA,OAAM,QAAQ;AAAA,YAC5C,SAAS,MAAM;AAAA,UACjB;AAAA,QACF,CAAC;AACD,eAAO,SAAS,eAAe,OAAO,MAAM,SAAS;AACnD,cAAI,UAAU,CAAC;AACf,kBAAQ,YAAY,SAAS,cAAc,OAAO;AAChD,gBAAI,SAAS,MAAM,SAAS,OAAO,MAAM,OAAO;AAChD,gBAAI,MAAM,SAAS;AACjB,sBAAQ,KAAK,MAAM;AAAA,YACrB;AAAA,UACF,CAAC;AACD,iBAAO,IAAIH,WAAU,OAAO;AAAA,QAC9B;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ,UAAU;AAChB,iBAASI,KAAI,GAAGA,KAAI,KAAK,OAAO,QAAQA,MAAK;AAC3C,mBAAS,KAAK,OAAOA,EAAC,EAAE,MAAM,YAAYA,KAAI,UAAU,IAAI;AAAA,QAC9D;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,IAAI,UAAU;AACZ,YAAI,SAAS,CAAC;AACd,iBAASA,KAAI,GAAGA,KAAI,KAAK,OAAO,QAAQA,MAAK;AAC3C,cAAI,QAAQ,KAAK,OAAOA,EAAC;AACzB,cAAI,OAAO,KAAK,QAAQ,SAAS,MAAM,MAAM,YAAYA,KAAI,UAAU,IAAI,CAAC;AAC5E,iBAAOA,EAAC,IAAI;AAAA,YACV;AAAA,YACA,SAAS,MAAM;AAAA,UACjB;AAAA,QACF;AACA,eAAO,IAAIF,WAAU,MAAM;AAAA,MAC7B;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ;AACN,YAAI,SAAS,KAAK,OAAO,IAAI,SAAU,OAAO;AAC5C,iBAAO;AAAA,YACL,MAAM,MAAM;AAAA,YACZ,SAAS,MAAM;AAAA,UACjB;AAAA,QACF,CAAC;AACD,eAAO,IAAIA,WAAU,MAAM;AAAA,MAC7B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,UAAU,SAAS;AACjB,eAAO,KAAK,OAAO,IAAI,SAAU,OAAO;AACtC,iBAAO,MAAM,KAAK,SAAS,OAAO,KAAK,MAAM,UAAU,KAAK;AAAA,QAC9D,CAAC,EAAE,KAAK,IAAI;AAAA,MACd;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,SAAS;AACP,eAAO;AAAA,UACL,QAAQJ;AAAA,UACR,QAAQ,KAAK;AAAA,QACf;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAUA,OAAO,SAAS,MAAM;AACpB,eAAO,IAAII,WAAU,KAAK,MAAM;AAAA,MAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,QAAQ,SAAS;AACf,eAAO,KAAK,OAAO,IAAI,SAAU,OAAO;AACtC,iBAAO,MAAM,KAAK,OAAO,OAAO,KAAK,MAAM,UAAU,KAAK;AAAA,QAC5D,CAAC,EAAE,KAAK,4CAA4C;AAAA,MACtD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,OAAO,SAAS;AACd,eAAO,KAAK,OAAO,IAAI,SAAU,OAAO;AACtC,iBAAO,MAAM,KAAK,MAAM,OAAO,KAAK,MAAM,UAAU,KAAK;AAAA,QAC3D,CAAC,EAAE,KAAK,UAAU;AAAA,MACpB;AAAA,IACF;AACA,IAAAG,iBAAgBH,YAAW,QAAQJ,OAAI;AACvC,WAAOI;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,IACT,QAAQ;AAAA,EACV,CAAC;;;ACpLD,MAAII,UAAO;AACX,MAAIC,kBAAe,CAAC,MAAM;AACnB,MAAI,wBAAuC,wBAAQD,SAAMC,iBAAc,UAAQ;AACpF,QAAI;AAAA,MACF,MAAAC;AAAA,IACF,IAAI;AAMJ,aAAS,cAAc,WAAW;AAChC,UAAI,OAAO,cAAc,YAAY,OAAO,cAAc,aAAa,OAAO,cAAc,UAAU;AACpG,eAAO,CAAC,CAAC;AAAA,MACX;AACA,UAAI,WAAW;AACb,YAAI,YAAY,SAAS,GAAG;AAC1B,iBAAO,CAAC,UAAU,OAAO;AAAA,QAC3B;AACA,YAAI,UAAU,SAAS,GAAG;AACxB,iBAAO,CAAC,EAAE,UAAU,MAAM,UAAU;AAAA,QACtC;AACA,YAAI,OAAO,SAAS,GAAG;AACrB,iBAAO,CAAC,CAAC,UAAU;AAAA,QACrB;AAAA,MACF;AACA,UAAI,cAAc,QAAQ,cAAc,QAAW;AACjD,eAAO;AAAA,MACT;AACA,YAAM,IAAI,UAAU,oCAAoC,OAAO,SAAS,IAAI,GAAG;AAAA,IACjF;AAAA,IACA,MAAMC,yBAAwBD,MAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAWjC,YAAY,WAAW,UAAU,WAAW;AAC1C,cAAM;AACN,YAAI,CAAC,OAAO,SAAS,GAAG;AACtB,gBAAM,IAAI,UAAU,oCAAoC;AAAA,QAC1D;AACA,YAAI,CAAC,OAAO,QAAQ,GAAG;AACrB,gBAAM,IAAI,UAAU,mCAAmC;AAAA,QACzD;AACA,YAAI,CAAC,OAAO,SAAS,GAAG;AACtB,gBAAM,IAAI,UAAU,oCAAoC;AAAA,QAC1D;AACA,aAAK,YAAY;AACjB,aAAK,WAAW;AAChB,aAAK,YAAY;AAAA,MACnB;AAAA,MACA,IAAI,OAAO;AACT,eAAOF;AAAA,MACT;AAAA,MACA,IAAI,oBAAoB;AACtB,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAeA,SAASI,OAAM,UAAU;AACvB,YAAI,gBAAgB,KAAK,UAAU,SAASA,OAAM,QAAQ;AAC1D,YAAI,eAAe,KAAK,SAAS,SAASA,OAAM,QAAQ;AACxD,YAAI,gBAAgB,KAAK,UAAU,SAASA,OAAM,QAAQ;AAC1D,eAAO,SAAS,oBAAoB,OAAO,MAAM,SAAS;AACxD,iBAAO,cAAc,cAAc,OAAO,MAAM,OAAO,CAAC,IAAI,aAAa,OAAO,MAAM,OAAO,IAAI,cAAc,OAAO,MAAM,OAAO;AAAA,QACrI;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ,UAAU;AAChB,iBAAS,KAAK,WAAW,aAAa,IAAI;AAC1C,iBAAS,KAAK,UAAU,YAAY,IAAI;AACxC,iBAAS,KAAK,WAAW,aAAa,IAAI;AAAA,MAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,IAAI,UAAU;AACZ,eAAO,IAAID,iBAAgB,KAAK,QAAQ,SAAS,KAAK,WAAW,aAAa,IAAI,CAAC,GAAG,KAAK,QAAQ,SAAS,KAAK,UAAU,YAAY,IAAI,CAAC,GAAG,KAAK,QAAQ,SAAS,KAAK,WAAW,aAAa,IAAI,CAAC,CAAC;AAAA,MAC1M;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ;AACN,eAAO,IAAIA,iBAAgB,KAAK,WAAW,KAAK,UAAU,KAAK,SAAS;AAAA,MAC1E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,UAAU,SAAS;AACjB,YAAI,cAAc,WAAW,QAAQ,cAAc,QAAQ,cAAc;AACzE,YAAI,aAAa,cAAc,MAAM,aAAa,WAAW,QAAQ,QAAQ;AAM7E,YAAI,YAAY,KAAK,UAAU,SAAS,OAAO;AAC/C,YAAI,sBAAsB,cAAc,KAAK,WAAW,aAAa,WAAW,QAAQ,QAAQ;AAChG,YAAI,gBAAgB,SAAS,KAAK,UAAU,SAAS,kBAAkB,wBAAwB,QAAQ,uBAAuB,YAAY;AACxI,sBAAY,MAAM,YAAY;AAAA,QAChC;AACA,YAAI,WAAW,KAAK,SAAS,SAAS,OAAO;AAC7C,YAAI,iBAAiB,cAAc,KAAK,UAAU,aAAa,WAAW,QAAQ,QAAQ;AAC1F,YAAI,gBAAgB,SAAS,KAAK,SAAS,SAAS,kBAAkB,mBAAmB,QAAQ,kBAAkB,YAAY;AAC7H,qBAAW,MAAM,WAAW;AAAA,QAC9B;AACA,YAAI,YAAY,KAAK,UAAU,SAAS,OAAO;AAC/C,YAAI,kBAAkB,cAAc,KAAK,WAAW,aAAa,WAAW,QAAQ,QAAQ;AAC5F,YAAI,gBAAgB,SAAS,KAAK,UAAU,SAAS,kBAAkB,oBAAoB,QAAQ,mBAAmB,YAAY;AAChI,sBAAY,MAAM,YAAY;AAAA,QAChC;AACA,eAAO,YAAY,QAAQ,WAAW,QAAQ;AAAA,MAChD;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,SAAS;AACP,eAAO;AAAA,UACL,QAAQH;AAAA,UACR,WAAW,KAAK;AAAA,UAChB,UAAU,KAAK;AAAA,UACf,WAAW,KAAK;AAAA,QAClB;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAeA,OAAO,SAAS,MAAM;AACpB,eAAO,IAAIG,iBAAgB,KAAK,WAAW,KAAK,UAAU,KAAK,SAAS;AAAA,MAC1E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,QAAQ,SAAS;AACf,YAAI,cAAc,WAAW,QAAQ,cAAc,QAAQ,cAAc;AACzE,YAAI,aAAa,cAAc,MAAM,aAAa,WAAW,QAAQ,QAAQ;AAM7E,YAAI,YAAY,KAAK,UAAU,OAAO,OAAO;AAC7C,YAAI,sBAAsB,cAAc,KAAK,WAAW,aAAa,WAAW,QAAQ,QAAQ;AAChG,YAAI,gBAAgB,SAAS,KAAK,UAAU,SAAS,kBAAkB,wBAAwB,QAAQ,uBAAuB,YAAY;AACxI,sBAAY,mEAAmE,YAAY;AAAA,QAC7F;AACA,YAAI,WAAW,KAAK,SAAS,OAAO,OAAO;AAC3C,YAAI,iBAAiB,cAAc,KAAK,UAAU,aAAa,WAAW,QAAQ,QAAQ;AAC1F,YAAI,gBAAgB,SAAS,KAAK,SAAS,SAAS,kBAAkB,mBAAmB,QAAQ,kBAAkB,YAAY;AAC7H,qBAAW,mEAAmE,WAAW;AAAA,QAC3F;AACA,YAAI,YAAY,KAAK,UAAU,OAAO,OAAO;AAC7C,YAAI,kBAAkB,cAAc,KAAK,WAAW,aAAa,WAAW,QAAQ,QAAQ;AAC5F,YAAI,gBAAgB,SAAS,KAAK,UAAU,SAAS,kBAAkB,oBAAoB,QAAQ,mBAAmB,YAAY;AAChI,sBAAY,mEAAmE,YAAY;AAAA,QAC7F;AACA,eAAO,YAAY,mEAAmE,WAAW,mEAAmE;AAAA,MACtK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,OAAO,SAAS;AACd,eAAO,qBAAqB,KAAK,SAAS,MAAM,OAAO,IAAI,8BAA8B,KAAK,UAAU,MAAM,OAAO,IAAI,WAAW,KAAK,UAAU,MAAM,OAAO,IAAI;AAAA,MACtK;AAAA,IACF;AACA,IAAAE,iBAAgBF,kBAAiB,QAAQH,OAAI;AAC7C,WAAOG;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,IACT,QAAQ;AAAA,EACV,CAAC;;;AC9ND,4BAA2B;AAEpB,MAAI,eAAe;AAAA;AAAA,IAExB,OAAO;AAAA,IACP,OAAO;AAAA,IACP,MAAM;AAAA,IACN,MAAM;AAAA,IACN,OAAO;AAAA,IACP,OAAO;AAAA,IACP,OAAO;AAAA,IACP,OAAO;AAAA,IACP,SAAS;AAAA,IACT,SAAS;AAAA,IACT,YAAY;AAAA,IACZ,MAAM;AAAA,IACN,MAAM;AAAA,IACN,KAAK;AAAA,IACL,KAAK;AAAA,IACL,OAAO;AAAA,IACP,OAAO;AAAA,IACP,UAAU;AAAA,IACV,MAAM;AAAA,IACN,MAAM;AAAA,IACN,OAAO;AAAA,IACP,OAAO;AAAA,IACP,UAAU;AAAA,IACV,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,SAAS;AAAA,IACT,SAAS;AAAA,IACT,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,OAAO;AAAA,IACP,KAAK;AAAA,IACL,KAAK;AAAA,IACL,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,OAAO;AAAA,IACP,UAAU;AAAA,IACV,KAAK;AAAA,IACL,KAAK;AAAA,IACL,SAAS;AAAA,IACT,SAAS;AAAA,IACT,KAAK;AAAA,IACL,KAAK;AAAA,IACL,QAAQ;AAAA,IACR,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,OAAO;AAAA,IACP,OAAO;AAAA;AAAA,IAEP,MAAM;AAAA,IACN,OAAO;AAAA;AAAA,IAEP,GAAG;AAAA;AAAA,IAEH,KAAK;AAAA,IACL,KAAK;AAAA,IACL,UAAU;AAAA,IACV,UAAU;AAAA,IACV,IAAI;AAAA,IACJ,KAAK;AAAA,IACL,WAAW;AAAA,EACb;AACO,MAAI,iBAAiB;AAAA,IAC1B,WAAW;AAAA,IACX,YAAY;AAAA,IACZ,WAAW;AAAA,IACX,KAAK;AAAA,IACL,QAAQ;AAAA;AAAA,IAER,WAAW;AAAA,IACX,YAAY;AAAA,IACZ,QAAQ;AAAA;AAAA,IAER,KAAK;AAAA,IACL,UAAU;AAAA,IACV,QAAQ;AAAA;AAAA,IAER,aAAa;AAAA;AAAA,IAEb,WAAW;AAAA;AAAA,IAEX,KAAK;AAAA,IACL,KAAK;AAAA,IACL,UAAU;AAAA,IACV,IAAI;AAAA,IACJ,WAAW;AAAA,IACX,iBAAiB;AAAA,IACjB,eAAe;AAAA,IACf,OAAO;AAAA,IACP,SAAS;AAAA,IACT,SAAS;AAAA,IACT,QAAQ;AAAA,IACR,WAAW;AAAA,IACX,UAAU;AAAA,IACV,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,KAAK;AAAA,IACL,KAAK;AAAA,IACL,IAAI;AAAA,EACN;AACO,MAAI,iBAAiB;AAAA;AAAA,IAE1B,KAAK;AAAA,MACH,GAAG;AAAA,IACL;AAAA,IACA,KAAK;AAAA,MACH,GAAG,oBAAoB,OAAO,eAAe,KAAK,oBAAoB;AAAA,IACxE;AAAA,IACA,MAAM;AAAA,MACJ,GAAG;AAAA,IACL;AAAA,IACA,MAAM;AAAA,MACJ,GAAG;AAAA,IACL;AAAA,IACA,MAAM;AAAA,MACJ,GAAG;AAAA,IACL;AAAA,IACA,QAAQ;AAAA,MACN,GAAG;AAAA,IACL;AAAA,IACA,WAAW;AAAA,MACT,GAAG,oBAAoB,OAAO,eAAe,WAAW,oBAAoB;AAAA,IAC9E;AAAA,IACA,aAAa;AAAA,MACX,GAAG,oBAAoB,OAAO,eAAe,aAAa,oBAAoB;AAAA,IAChF;AAAA,IACA,QAAQ;AAAA,MACN,GAAG,oBAAoB,OAAO,eAAe,QAAQ,oBAAoB;AAAA,IAC3E;AAAA,IACA,KAAK;AAAA,MACH,GAAG;AAAA,IACL;AAAA,IACA,OAAO,WAAW,OAAO,eAAe,KAAK,wBAAwB;AAAA,IACrE,KAAK;AAAA,MACH,GAAG;AAAA,IACL;AAAA,IACA,OAAO;AAAA,MACL,GAAG;AAAA,IACL;AAAA,IACA,UAAU;AAAA,MACR,GAAG;AAAA,IACL;AAAA,IACA,KAAK;AAAA,IACL,OAAO;AAAA,IACP,KAAK;AAAA,MACH,GAAG;AAAA,MACH,GAAG;AAAA,IACL;AAAA,IACA,OAAO;AAAA,MACL,GAAG;AAAA,IACL;AAAA,IACA,OAAO;AAAA,MACL,GAAG;AAAA,MACH,GAAG;AAAA,IACL;AAAA,IACA,MAAM;AAAA,IACN,KAAK;AAAA,MACH,GAAG,oBAAoB,OAAO,eAAe,KAAK,oBAAoB;AAAA,IACxE;AAAA,IACA,UAAU;AAAA,MACR,GAAG,oBAAoB,OAAO,eAAe,UAAU,oBAAoB;AAAA,IAC7E;AAAA,IACA,MAAM;AAAA,MACJ,GAAG;AAAA,MACH,GAAG;AAAA;AAAA,IACL;AAAA,IACA,SAAS;AAAA,MACP,GAAG;AAAA,IACL;AAAA,IACA,UAAU;AAAA,MACR,GAAG;AAAA,IACL;AAAA,IACA,KAAK;AAAA,MACH,GAAG,4BAA4B,OAAO,eAAe,KAAK,cAAc;AAAA,IAC1E;AAAA,IACA,OAAO;AAAA,MACL,GAAG;AAAA,MACH,GAAG;AAAA;AAAA,IACL;AAAA,IACA,MAAM;AAAA,MACJ,GAAG;AAAA,IACL;AAAA,IACA,MAAM;AAAA,MACJ,GAAG;AAAA,IACL;AAAA,IACA,QAAQ;AAAA,MACN,GAAG;AAAA,IACL;AAAA,IACA,UAAU;AAAA,MACR,GAAG,oBAAoB,OAAO,eAAe,UAAU,oBAAoB;AAAA,IAC7E;AAAA,IACA,YAAY;AAAA,MACV,GAAG,GAAG,OAAO,eAAe,YAAY,2BAA2B;AAAA,IACrE;AAAA,IACA,WAAW;AAAA,MACT,GAAG,GAAG,OAAO,eAAe,WAAW,2BAA2B;AAAA,IACpE;AAAA;AAAA,IAEA,QAAQ;AAAA,MACN,GAAG,oBAAoB,OAAO,eAAe,QAAQ,oBAAoB;AAAA,IAC3E;AAAA,IACA,QAAQ;AAAA,MACN,GAAG,eAAe,SAAS;AAAA,IAC7B;AAAA,IACA,OAAO;AAAA,MACL,GAAG,oBAAoB,OAAO,eAAe,OAAO,oBAAoB;AAAA,IAC1E;AAAA,IACA,QAAQ;AAAA,MACN,GAAG,oBAAoB,OAAO,eAAe,QAAQ,oBAAoB;AAAA,IAC3E;AAAA,IACA,WAAW;AAAA,MACT,GAAG,oBAAoB,OAAO,eAAe,WAAW,oBAAoB;AAAA,IAC9E;AAAA,IACA,iBAAiB;AAAA,MACf,GAAG,oBAAoB,OAAO,eAAe,iBAAiB,oBAAoB;AAAA,IACpF;AAAA,IACA,eAAe;AAAA,MACb,GAAG,oBAAoB,OAAO,eAAe,eAAe,oBAAoB;AAAA,IAClF;AAAA;AAAA,IAEA,aAAa;AAAA,MACX,GAAG;AAAA,IACL;AAAA,IACA,SAAS;AAAA,MACP,GAAG;AAAA,IACL;AAAA,IACA,YAAY;AAAA,MACV,GAAG;AAAA,IACL;AAAA;AAAA,IAEA,KAAK;AAAA,MACH,GAAG;AAAA,IACL;AAAA,IACA,MAAM;AAAA,MACJ,GAAG;AAAA,IACL;AAAA,IACA,IAAI;AAAA,MACF,GAAG;AAAA,IACL;AAAA,IACA,IAAI;AAAA,MACF,GAAG;AAAA,IACL;AAAA;AAAA,IAEA,KAAK;AAAA,MACH,GAAG,oBAAoB,OAAO,eAAe,KAAK,oBAAoB;AAAA,IACxE;AAAA,IACA,KAAK;AAAA,MACH,GAAG,eAAe,MAAM;AAAA,IAC1B;AAAA,IACA,IAAI;AAAA,MACF,GAAG,oBAAoB,OAAO,eAAe,IAAI,oBAAoB;AAAA,IACvE;AAAA,IACA,KAAK;AAAA,MACH,GAAG,oBAAoB,OAAO,eAAe,KAAK,oBAAoB;AAAA,IACxE;AAAA;AAAA,IAEA,OAAO;AAAA,MACL,GAAG;AAAA,IACL;AAAA,IACA,YAAY;AAAA,MACV,GAAG,4BAA4B,OAAO,eAAe,UAAU;AAAA,IACjE;AAAA,IACA,KAAK;AAAA,MACH,GAAG;AAAA,IACL;AAAA,IACA,KAAK;AAAA,MACH,GAAG;AAAA,IACL;AAAA,IACA,MAAM;AAAA,MACJ,GAAG;AAAA,IACL;AAAA,IACA,KAAK;AAAA,MACH,GAAG;AAAA,IACL;AAAA,IACA,MAAM;AAAA,MACJ,GAAG;AAAA,IACL;AAAA,IACA,OAAO;AAAA,MACL,GAAG,eAAe,OAAO,eAAe,KAAK,gBAAgB;AAAA,IAC/D;AAAA,IACA,OAAO;AAAA,MACL,GAAG;AAAA,IACL;AAAA,IACA,WAAW;AAAA,MACT,GAAG,4BAA4B,OAAO,eAAe,SAAS;AAAA,IAChE;AAAA;AAAA,IAEA,cAAc;AAAA,MACZ,GAAG;AAAA,IACL;AAAA,IACA,qBAAqB;AAAA,MACnB,GAAG;AAAA,IACL;AAAA,IACA,WAAW;AAAA,MACT,GAAG,4BAA4B,OAAO,eAAe,SAAS;AAAA,IAChE;AAAA,IACA,OAAO;AAAA,MACL,GAAG;AAAA,IACL;AAAA,IACA,QAAQ;AAAA,MACN,GAAG;AAAA,IACL;AAAA;AAAA,IAEA,OAAO;AAAA,MACL,GAAG,oBAAoB,OAAO,eAAe,OAAO,oBAAoB;AAAA,IAC1E;AAAA,IACA,QAAQ;AAAA,MACN,GAAG,oBAAoB,OAAO,eAAe,QAAQ,oBAAoB;AAAA,IAC3E;AAAA,IACA,UAAU;AAAA,MACR,GAAG,oBAAoB,OAAO,eAAe,UAAU,oBAAoB;AAAA,IAC7E;AAAA,IACA,SAAS;AAAA,MACP,GAAG,oBAAoB,OAAO,eAAe,SAAS,oBAAoB;AAAA,IAC5E;AAAA,IACA,WAAW;AAAA,MACT,GAAG,oBAAoB,OAAO,eAAe,WAAW,oBAAoB;AAAA,IAC9E;AAAA,IACA,SAAS;AAAA,MACP,GAAG,oBAAoB,OAAO,eAAe,SAAS,oBAAoB;AAAA,IAC5E;AAAA;AAAA,IAEA,KAAK;AAAA,MACH,GAAG;AAAA,IACL;AAAA;AAAA,IAEA,KAAK;AAAA,IACL,KAAK;AAAA,IACL,UAAU;AAAA;AAAA,IAEV,MAAM;AAAA,MACJ,GAAG;AAAA,IACL;AAAA,IACA,OAAO;AAAA,MACL,GAAG;AAAA,IACL;AAAA,IACA,MAAM;AAAA,MACJ,GAAG;AAAA,IACL;AAAA,IACA,OAAO;AAAA,MACL,GAAG;AAAA,IACL;AAAA,IACA,MAAM;AAAA,MACJ,GAAG;AAAA,IACL;AAAA,IACA,OAAO;AAAA,MACL,GAAG;AAAA,IACL;AAAA,IACA,MAAM;AAAA,MACJ,GAAG;AAAA,IACL;AAAA,IACA,OAAO;AAAA,MACL,GAAG;AAAA,IACL;AAAA,IACA,MAAM;AAAA,MACJ,GAAG;AAAA,IACL;AAAA,IACA,OAAO;AAAA,MACL,GAAG;AAAA,IACL;AAAA,IACA,MAAM;AAAA,MACJ,GAAG;AAAA,IACL;AAAA,IACA,OAAO;AAAA,MACL,GAAG;AAAA,IACL;AAAA,IACA,OAAO;AAAA,MACL,GAAG;AAAA,IACL;AAAA,IACA,KAAK;AAAA,MACH,GAAG;AAAA,IACL;AAAA,IACA,MAAM;AAAA,MACJ,GAAG;AAAA,IACL;AAAA,IACA,KAAK;AAAA,MACH,GAAG;AAAA,IACL;AAAA,IACA,MAAM;AAAA,MACJ,GAAG;AAAA,IACL;AAAA,IACA,KAAK;AAAA,MACH,GAAG;AAAA,IACL;AAAA,IACA,MAAM;AAAA,MACJ,GAAG;AAAA,IACL;AAAA,IACA,KAAK;AAAA,MACH,GAAG;AAAA,IACL;AAAA,IACA,MAAM;AAAA,MACJ,GAAG;AAAA,IACL;AAAA,IACA,KAAK;AAAA,MACH,GAAG;AAAA,IACL;AAAA,IACA,MAAM;AAAA,MACJ,GAAG;AAAA,IACL;AAAA,IACA,KAAK;AAAA,MACH,GAAG;AAAA,IACL;AAAA,IACA,MAAM;AAAA,MACJ,GAAG;AAAA,IACL;AAAA;AAAA,IAEA,IAAI;AAAA,MACF,GAAG,oBAAoB,OAAO,eAAe,IAAI,oBAAoB;AAAA,IACvE;AAAA;AAAA,IAEA,SAAS,SAAS,QAAQ,MAAM,SAAS;AAEvC,aAAO,KAAK,KAAK,CAAC,EAAE,MAAM;AAAA,IAC5B;AAAA;AAAA,IAEA,QAAQ;AAAA,MACN,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAG;AAAA,IACL;AAAA,IACA,QAAQ;AAAA,MACN,GAAG;AAAA,MACH,GAAG;AAAA,IACL;AAAA,IACA,WAAW;AAAA,MACT,GAAG;AAAA,MACH,GAAG;AAAA,IACL;AAAA,IACA,QAAQ;AAAA,MACN,GAAG;AAAA,MACH,GAAG;AAAA,IACL;AAAA,IACA,SAAS;AAAA,MACP,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAG,oCAAoC,OAAO,aAAa,GAAG,yCAAyC;AAAA,IACzG;AAAA,IACA,QAAQ;AAAA,MACN,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAG;AAAA,IACL;AAAA,IACA,QAAQ;AAAA,MACN,GAAG;AAAA,MACH,GAAG;AAAA,IACL;AAAA,IACA,MAAM;AAAA,MACJ,GAAG;AAAA,MACH,GAAG;AAAA,IACL;AAAA,EACF;AACO,MAAI,kBAAkB;AAC7B,MAAI,aAAa;AAAA,IACf,KAAK;AAAA,EACP;AACO,WAAS,YAAYG,SAAQ;AAClC,eAAO,oBAAAC,SAAeD,SAAQ;AAAA,MAC5B,oBAAoB;AAAA,IACtB,CAAC;AAAA,EACH;AAIO,WAAS,SAASE,SAAMC,SAAQ;AACrC,IAAAA,UAAS,OAAOA,YAAW,cAAc,QAAQA;AACjD,QAAIA,SAAQ;AACV,UAAI,eAAe,YAAYD,OAAI,GAAG;AACpC,eAAO,WAAWA,OAAI;AAAA,MACxB;AACA,aAAO,cAAc,YAAYA,OAAI,IAAI;AAAA,IAC3C;AACA,QAAI,eAAe,cAAcA,OAAI,GAAG;AACtC,aAAO,aAAaA,OAAI;AAAA,IAC1B;AACA,WAAO,YAAYA,OAAI;AAAA,EACzB;;;ACpeA,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,QAAQ,WAAW;AAChC,MAAI,qBAAoC,wBAAQD,SAAMC,iBAAc,UAAQ;AACjF,QAAI;AAAA,MACF,MAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AAAA,IACJ,MAAMC,sBAAqBF,MAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAa9B,YAAY,OAAO;AACjB,cAAM;AACN,aAAK,QAAQ;AAAA,MACf;AAAA,MACA,IAAI,OAAO;AACT,eAAOF;AAAA,MACT;AAAA,MACA,IAAI,iBAAiB;AACnB,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAeA,SAASK,OAAM,UAAU;AACvB,YAAI,QAAQ,KAAK;AACjB,eAAO,SAAS,mBAAmB;AACjC,iBAAO;AAAA,QACT;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ,UAAU;AAAA,MAElB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,IAAI,UAAU;AACZ,eAAO,KAAK,MAAM;AAAA,MACpB;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ;AACN,eAAO,IAAID,cAAa,KAAK,KAAK;AAAA,MACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,UAAU,SAAS;AACjB,eAAOE,QAAO,KAAK,OAAO,OAAO;AAAA,MACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,QAAQ,SAAS;AACf,YAAI,QAAQ,KAAK,UAAU,OAAO;AAClC,gBAAQ,OAAO,KAAK,KAAK,GAAG;AAAA,UAC1B,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,mBAAO,+BAA+B,QAAQ;AAAA,UAChD,KAAK;AACH,mBAAO,+BAA+B,QAAQ;AAAA,UAChD,KAAK;AACH,mBAAO,gCAAgC,QAAQ;AAAA,UACjD,KAAK;AACH,mBAAO,oCAAoC,QAAQ;AAAA,UACrD,KAAK;AACH,mBAAO,kCAAkC,QAAQ;AAAA,UACnD;AACE,mBAAO,+BAA+B,QAAQ;AAAA,QAClD;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,SAAS;AACP,eAAO;AAAA,UACL,QAAQN;AAAA,UACR,OAAO,KAAK;AAAA,QACd;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,OAAO,SAAS,MAAM;AACpB,eAAO,IAAII,cAAa,KAAK,KAAK;AAAA,MACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,OAAO,SAAS;AACd,YAAI,QAAQ,KAAK,UAAU,OAAO;AAClC,YAAI,OAAO,OAAO,KAAK,KAAK;AAC5B,gBAAQ,MAAM;AAAA,UACZ,KAAK;AACH,mBAAO,cAAc,YAAY,KAAK,IAAI;AAAA,UAC5C,KAAK;AAAA,UACL,KAAK,aACH;AACE,gBAAI,CAACD,WAAU,KAAK,KAAK,GAAG;AAC1B,qBAAO,KAAK,MAAM,QAAQ,IAAI,IAAI,aAAa;AAAA,YACjD;AACA,gBAAII,SAAQ,MAAM,YAAY,EAAE,QAAQ,GAAG;AAC3C,gBAAIA,WAAU,IAAI;AAChB,qBAAO,MAAM,UAAU,GAAGA,MAAK,IAAI,eAAe,MAAM,UAAUA,SAAQ,CAAC,IAAI;AAAA,YACjF;AACA,mBAAO;AAAA,UACT;AAAA,UACF,KAAK,UACH;AACE,mBAAO,MAAM,SAAS;AAAA,UACxB;AAAA,UACF,KAAK;AACH,mBAAO,KAAK,MAAM,QAAQ;AAAA,UAC5B;AACE,mBAAO;AAAA,QACX;AAAA,MACF;AAAA,IACF;AACA,IAAAC,iBAAgBJ,eAAc,QAAQJ,OAAI;AAC1C,WAAOI;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,IACT,QAAQ;AAAA,EACV,CAAC;;;AC1KD,MAAIK,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,MAAM;AAC5B,MAAI,+BAA8C,wBAAQD,SAAMC,iBAAc,UAAQ;AAC3F,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,MAAAC;AAAA,IACF,IAAI;AAQJ,aAAS,gBAAgB,MAAM,aAAa,UAAU;AACpD,UAAI,aAAa,cAAc,MAAM,aAAa,QAAQ;AAC1D,UAAI,iBAAiB,cAAc,KAAK,MAAM,aAAa,QAAQ;AACnE,aAAO,gBAAgB,SAAS,mBAAmB,QAAQ,kBAAkB;AAAA,IAC/E;AAAA,IACA,MAAMC,gCAA+BD,MAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAaxC,YAAYH,SAAM,QAAQ,MAAM;AAC9B,cAAM;AAEN,YAAI,OAAOA,YAAS,UAAU;AAC5B,gBAAM,IAAI,UAAU,sCAAsC;AAAA,QAC5D;AACA,YAAI,CAAC,MAAM,QAAQ,MAAM,GAAG;AAC1B,gBAAM,IAAI,UAAU,qEAAqE;AAAA,QAC3F;AACA,YAAI,CAAC,OAAO,IAAI,GAAG;AACjB,gBAAM,IAAI,UAAU,oCAAoC;AAAA,QAC1D;AACA,YAAI,SAAS,IAAIA,OAAI,GAAG;AACtB,gBAAM,IAAI,MAAM,6BAA6BA,UAAO,yBAAyB;AAAA,QAC/E;AACA,YAAI,aAAa,oBAAI,IAAI;AACzB,iBAAS,SAAS,QAAQ;AACxB,cAAI,QAAQ,OAAO,UAAU,WAAW,QAAQ,MAAM;AACtD,cAAI,WAAW,IAAI,KAAK,GAAG;AACzB,kBAAM,IAAI,MAAM,6BAA8B,OAAO,OAAO,GAAI,CAAC;AAAA,UACnE,OAAO;AACL,uBAAW,IAAI,KAAK;AAAA,UACtB;AAAA,QACF;AACA,aAAK,OAAOA;AACZ,aAAK,SAAS,OAAO,IAAI,SAAUK,QAAO;AACxC,iBAAOA,UAASA,OAAM,QAAQA;AAAA,QAChC,CAAC;AACD,aAAK,QAAQ,OAAO,IAAI,SAAUA,QAAO;AACvC,iBAAOA,UAASA,OAAM,QAAQ;AAAA,QAChC,CAAC;AACD,aAAK,OAAO;AAAA,MACd;AAAA,MACA,IAAI,OAAO;AACT,eAAOL;AAAA,MACT;AAAA,MACA,IAAI,2BAA2B;AAC7B,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAeA,SAASM,OAAM,UAAU;AACvB,YAAI,gBAAgB,OAAO,OAAO,QAAQ;AAC1C,gBAAQ,KAAK,QAAQ,SAAU,OAAO;AACpC,wBAAc,KAAK,IAAI;AAAA,QACzB,CAAC;AAGD,YAAI,OAAO,KAAK;AAChB,YAAI,WAAW,KAAK,SAASA,OAAM,aAAa;AAChD,YAAIN,UAAO,KAAK;AAChB,YAAI,SAAS,KAAK;AAClB,YAAI,YAAY,KAAK,KAAK,OAAO,GAAG;AACpC,YAAI,SAASA,UAAO,MAAM,KAAK,KAAK,QAAQ,IAAI,IAAI;AACpD,eAAO,SAAS,2BAA2B,OAAO,MAAM,SAAS;AAC/D,cAAI,aAAa,CAAC;AAClB,qBAAW,SAAS,IAAI,WAAY;AAClC,gBAAI,YAAY,OAAO,OAAO,IAAI;AAClC,qBAASO,KAAI,GAAGA,KAAI,OAAO,QAAQA,MAAK;AACtC,wBAAU,OAAOA,EAAC,CAAC,IAAI,UAAUA,EAAC;AAAA,YACpC;AACA,mBAAO,SAAS,OAAO,WAAW,OAAO;AAAA,UAC3C;AACA,cAAI,KAAKL,OAAMF,SAAM,UAAU;AAC/B,aAAG,SAAS;AACZ,aAAG,OAAO,KAAK,SAAS;AACxB,gBAAM,IAAIA,SAAM,EAAE;AAClB,iBAAO;AAAA,QACT;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ,UAAU;AAChB,iBAAS,KAAK,MAAM,QAAQ,IAAI;AAAA,MAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,IAAI,UAAU;AACZ,YAAI,OAAO,KAAK,QAAQ,SAAS,KAAK,MAAM,QAAQ,IAAI,CAAC;AACzD,eAAO,IAAII,wBAAuB,KAAK,MAAM,KAAK,OAAO,MAAM,CAAC,GAAG,IAAI;AAAA,MACzE;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ;AACN,eAAO,IAAIA,wBAAuB,KAAK,MAAM,KAAK,OAAO,MAAM,CAAC,GAAG,KAAK,IAAI;AAAA,MAC9E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,UAAU,SAAS;AACjB,YAAI,cAAc,WAAW,QAAQ,cAAc,QAAQ,cAAc;AACzE,YAAI,OAAO,KAAK,KAAK,SAAS,OAAO;AACrC,YAAI,gBAAgB,MAAM,aAAa,WAAW,QAAQ,QAAQ,GAAG;AACnE,iBAAO,MAAM,OAAO;AAAA,QACtB;AACA,eAAO,KAAK,OAAO,MAAM,KAAK,OAAO,KAAK,IAAI,IAAI,SAAS;AAAA,MAC7D;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,SAAS;AACP,YAAI,QAAQ,KAAK;AACjB,eAAO;AAAA,UACL,QAAQJ;AAAA,UACR,MAAM,KAAK;AAAA,UACX,QAAQ,KAAK,OAAO,IAAI,SAAU,OAAOQ,QAAO;AAC9C,mBAAO;AAAA,cACL,MAAM;AAAA,cACN,MAAM,MAAMA,MAAK;AAAA,YACnB;AAAA,UACF,CAAC;AAAA,UACD,MAAM,KAAK;AAAA,QACb;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAaA,OAAO,SAAS,MAAM;AACpB,eAAO,IAAIJ,wBAAuB,KAAK,MAAM,KAAK,QAAQ,KAAK,IAAI;AAAA,MACrE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,QAAQ,SAAS;AACf,YAAI,cAAc,WAAW,QAAQ,cAAc,QAAQ,cAAc;AACzE,YAAI,SAAS,CAAC;AACd,iBAASG,KAAI,GAAGA,KAAI,KAAK,OAAO,QAAQA,MAAK;AAC3C,iBAAO,KAAK,8CAA8C,OAAO,KAAK,OAAOA,EAAC,CAAC,IAAI,SAAS;AAAA,QAC9F;AACA,YAAI,OAAO,KAAK,KAAK,OAAO,OAAO;AACnC,YAAI,gBAAgB,MAAM,aAAa,WAAW,QAAQ,QAAQ,GAAG;AACnE,iBAAO,mEAAmE,OAAO;AAAA,QACnF;AACA,eAAO,iCAAiC,OAAO,KAAK,IAAI,IAAI,0EAA+E,OAAO,KAAK,uCAAuC,IAAI,uLAAiM;AAAA,MACrY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,OAAO,SAAS;AACd,YAAI,cAAc,WAAW,QAAQ,cAAc,QAAQ,cAAc;AACzE,YAAI,OAAO,KAAK,KAAK,MAAM,OAAO;AAClC,YAAI,gBAAgB,MAAM,aAAa,WAAW,QAAQ,QAAQ,GAAG;AACnE,iBAAO,UAAU,OAAO,MAAM,UAAU;AAAA,QAC1C;AACA,eAAO,cAAc,KAAK,OAAO,aAAa,KAAK,OAAO,IAAI,QAAQ,EAAE,KAAK,GAAG,IAAI,cAAc;AAAA,MACpG;AAAA,IACF;AACA,IAAAE,iBAAgBL,yBAAwB,QAAQJ,OAAI;AACpD,WAAOI;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,IACT,QAAQ;AAAA,EACV,CAAC;;;ACtOD,MAAIM,UAAO;AACX,MAAIC,kBAAe,CAAC,QAAQ,MAAM;AAC3B,MAAI,kBAAiC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,MAAAC;AAAA,MACA,MAAAC;AAAA,IACF,IAAI;AAAA,IACJ,MAAMC,mBAAkBF,MAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAe3B,YAAY,YAAY,aAAa;AACnC,cAAM;AACN,aAAK,aAAa;AAClB,aAAK,cAAc,eAAe;AAGlC,YAAI,CAAC,MAAM,QAAQ,UAAU,KAAK,CAAC,WAAW,MAAM,MAAM,GAAG;AAC3D,gBAAM,IAAI,UAAU,4DAA4D;AAAA,QAClF;AACA,YAAI,KAAK,eAAe,CAAC,KAAK,iBAAiB,GAAG;AAChD,gBAAM,IAAI,MAAM,mDAAmD;AAAA,QACrE;AAAA,MACF;AAAA,MACA,IAAI,OAAO;AACT,eAAOF;AAAA,MACT;AAAA,MACA,IAAI,cAAc;AAChB,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAeA,SAASK,OAAM,UAAU;AAQvB,YAAI,iBAAiB,IAAI,KAAK,YAAY,SAAU,WAAWC,IAAG;AAChE,cAAI,WAAW,UAAU,OAAO,UAAQ,KAAK,gBAAgB,KAAK,SAAS,KAAK,EAAE,SAAS;AAC3F,cAAI,UAAU;AAGZ,gBAAI,gBAAgB,OAAO,OAAO,QAAQ;AAC1C,0BAAc,MAAM;AACpB,gBAAI,iBAAiB,UAAU,SAASD,OAAM,aAAa;AAC3D,mBAAO,SAAS,cAAc,OAAO,MAAM,SAAS;AAClD,kBAAI,CAAC,SAAS,OAAO,KAAK,CAAC,QAAQ,OAAO,KAAK,CAAC,SAAS,OAAO,GAAG;AACjE,sBAAM,IAAI,UAAU,6EAAkF,OAAO,OAAO,CAAC;AAAA,cACvH;AACA,kBAAI,IAAIF,MAAK,OAAO;AACpB,kBAAI,YAAY,OAAO,OAAO,IAAI;AAClC,wBAAU,MAAM,EAAEG,EAAC;AACnB,qBAAO,eAAe,OAAO,WAAW,OAAO;AAAA,YACjD;AAAA,UACF,OAAO;AAEL,mBAAO,UAAU,SAASD,OAAM,QAAQ;AAAA,UAC1C;AAAA,QACF,CAAC;AACD,YAAIE,SAAQ,gBAAgBF,OAAM,OAAO;AACzC,eAAO,SAAS,cAAc,OAAO,MAAM,SAAS;AAClD,cAAI,aAAa,IAAI,gBAAgB,SAAU,eAAe;AAC5D,mBAAO,cAAc,OAAO,MAAM,OAAO;AAAA,UAC3C,CAAC;AACD,iBAAOE,OAAM,GAAG,UAAU;AAAA,QAC5B;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ,UAAU;AAChB,iBAASD,KAAI,GAAGA,KAAI,KAAK,WAAW,QAAQA,MAAK;AAC/C,mBAAS,KAAK,WAAWA,EAAC,GAAG,gBAAgBA,KAAI,KAAK,IAAI;AAAA,QAC5D;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,IAAI,UAAU;AACZ,YAAI,aAAa,CAAC;AAClB,iBAASA,KAAI,GAAGA,KAAI,KAAK,WAAW,QAAQA,MAAK;AAC/C,qBAAWA,EAAC,IAAI,KAAK,QAAQ,SAAS,KAAK,WAAWA,EAAC,GAAG,gBAAgBA,KAAI,KAAK,IAAI,CAAC;AAAA,QAC1F;AACA,eAAO,IAAIF,WAAU,YAAY,KAAK,WAAW;AAAA,MACnD;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ;AACN,eAAO,IAAIA,WAAU,KAAK,WAAW,MAAM,CAAC,GAAG,KAAK,WAAW;AAAA,MACjE;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,mBAAmB;AACjB,eAAO,KAAK,WAAW,WAAW,KAAK,eAAe,KAAK,WAAW,CAAC,CAAC,KAAK,OAAO,KAAK,WAAW,CAAC,EAAE,UAAU;AAAA,MACnH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,oBAAoB;AAClB,eAAO,KAAK,iBAAiB,IAAI,KAAK,WAAW,CAAC,EAAE,QAAQ;AAAA,MAC9D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,UAAU,SAAS;AAEjB,eAAO,KAAK,cAAc,MAAM,KAAK,kBAAkB,IAAI,MAAM,KAAK,WAAW,KAAK,IAAI,IAAI;AAAA,MAChG;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,SAAS;AACP,eAAO;AAAA,UACL,QAAQJ;AAAA,UACR,YAAY,KAAK;AAAA,UACjB,aAAa,KAAK;AAAA,QACpB;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAUA,OAAO,SAAS,MAAM;AACpB,eAAO,IAAII,WAAU,KAAK,YAAY,KAAK,WAAW;AAAA,MACxD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,QAAQ,SAAS;AAEf,YAAI,aAAa,CAAC;AAClB,iBAASE,KAAI,GAAGA,KAAI,KAAK,WAAW,QAAQA,MAAK;AAC/C,qBAAWA,EAAC,IAAI,KAAK,WAAWA,EAAC,EAAE,OAAO;AAAA,QAC5C;AACA,YAAI,KAAK,aAAa;AACpB,iBAAO,wGAA6G,OAAO,KAAK,kBAAkB,CAAC,IAAI;AAAA,QACzJ,OAAO;AACL,iBAAO,oEAAoE,WAAW,KAAK,uCAAuC,IAAI;AAAA,QACxI;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,OAAO,SAAS;AACd,YAAI,aAAa,KAAK,WAAW,IAAI,SAAUE,QAAO;AACpD,iBAAOA,OAAM,MAAM,OAAO;AAAA,QAC5B,CAAC;AACD,eAAO,KAAK,cAAc,MAAM,KAAK,kBAAkB,IAAS,OAAO,WAAW,KAAK,GAAG,IAAI;AAAA,MAChG;AAAA,IACF;AACA,IAAAC,iBAAgBL,YAAW,QAAQJ,OAAI;AACvC,WAAOI;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,IACT,QAAQ;AAAA,EACV,CAAC;;;ACpND,MAAIM,UAAO;AACX,MAAIC,kBAAe,CAAC,MAAM;AACnB,MAAI,mBAAkC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC/E,QAAI;AAAA,MACF,MAAAC;AAAA,IACF,IAAI;AAAA,IACJ,MAAMC,oBAAmBD,MAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAO5B,YAAYE,aAAY;AACtB,cAAM;AACN,aAAK,aAAaA,eAAc,CAAC;AAGjC,YAAIA,aAAY;AACd,cAAI,EAAE,OAAOA,gBAAe,aAAa,CAAC,OAAO,KAAKA,WAAU,EAAE,MAAM,SAAU,KAAK;AACrF,mBAAO,OAAOA,YAAW,GAAG,CAAC;AAAA,UAC/B,CAAC,GAAG;AACF,kBAAM,IAAI,UAAU,kCAAkC;AAAA,UACxD;AAAA,QACF;AAAA,MACF;AAAA,MACA,IAAI,OAAO;AACT,eAAOJ;AAAA,MACT;AAAA,MACA,IAAI,eAAe;AACjB,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAeA,SAASK,OAAM,UAAU;AACvB,YAAI,cAAc,CAAC;AACnB,iBAAS,OAAO,KAAK,YAAY;AAC/B,cAAI,eAAe,KAAK,YAAY,GAAG,GAAG;AAGxC,gBAAI,iBAAiB,UAAU,GAAG;AAClC,gBAAI,YAAY,KAAK,MAAM,cAAc;AACzC,gBAAI,OAAO,gBAAgB,KAAK,YAAY,GAAG;AAC/C,wBAAY,SAAS,IAAI,KAAK,SAASA,OAAM,QAAQ;AAAA,UACvD;AAAA,QACF;AACA,eAAO,SAAS,eAAe,OAAO,MAAM,SAAS;AACnD,cAAI,MAAM,CAAC;AACX,mBAAS,QAAQ,aAAa;AAC5B,gBAAI,eAAe,aAAa,IAAI,GAAG;AACrC,kBAAI,IAAI,IAAI,YAAY,IAAI,EAAE,OAAO,MAAM,OAAO;AAAA,YACpD;AAAA,UACF;AACA,iBAAO;AAAA,QACT;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ,UAAU;AAChB,iBAAS,OAAO,KAAK,YAAY;AAC/B,cAAI,eAAe,KAAK,YAAY,GAAG,GAAG;AACxC,qBAAS,KAAK,WAAW,GAAG,GAAG,gBAAgB,UAAU,GAAG,IAAI,KAAK,IAAI;AAAA,UAC3E;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,IAAI,UAAU;AACZ,YAAID,cAAa,CAAC;AAClB,iBAAS,OAAO,KAAK,YAAY;AAC/B,cAAI,eAAe,KAAK,YAAY,GAAG,GAAG;AACxC,YAAAA,YAAW,GAAG,IAAI,KAAK,QAAQ,SAAS,KAAK,WAAW,GAAG,GAAG,gBAAgB,UAAU,GAAG,IAAI,KAAK,IAAI,CAAC;AAAA,UAC3G;AAAA,QACF;AACA,eAAO,IAAID,YAAWC,WAAU;AAAA,MAClC;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ;AACN,YAAIA,cAAa,CAAC;AAClB,iBAAS,OAAO,KAAK,YAAY;AAC/B,cAAI,eAAe,KAAK,YAAY,GAAG,GAAG;AACxC,YAAAA,YAAW,GAAG,IAAI,KAAK,WAAW,GAAG;AAAA,UACvC;AAAA,QACF;AACA,eAAO,IAAID,YAAWC,WAAU;AAAA,MAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,UAAU,SAAS;AACjB,YAAI,UAAU,CAAC;AACf,iBAAS,OAAO,KAAK,YAAY;AAC/B,cAAI,eAAe,KAAK,YAAY,GAAG,GAAG;AACxC,oBAAQ,KAAK,UAAU,GAAG,IAAI,OAAO,KAAK,WAAW,GAAG,EAAE,SAAS,OAAO,CAAC;AAAA,UAC7E;AAAA,QACF;AACA,eAAO,MAAM,QAAQ,KAAK,IAAI,IAAI;AAAA,MACpC;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,SAAS;AACP,eAAO;AAAA,UACL,QAAQJ;AAAA,UACR,YAAY,KAAK;AAAA,QACnB;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,OAAO,SAAS,MAAM;AACpB,eAAO,IAAIG,YAAW,KAAK,UAAU;AAAA,MACvC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,QAAQ,SAAS;AACf,YAAI,UAAU,CAAC;AACf,iBAAS,OAAO,KAAK,YAAY;AAC/B,cAAI,eAAe,KAAK,YAAY,GAAG,GAAG;AACxC,oBAAQ,KAAK,6CAA6C,OAAO,GAAG,IAAI,gIAA+I,KAAK,WAAW,GAAG,EAAE,OAAO,OAAO,CAAC;AAAA,UAC7P;AAAA,QACF;AACA,eAAO,mEAAmE,QAAQ,KAAK,uCAAuC,IAAI;AAAA,MACpI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,OAAO,SAAS;AACd,YAAI,UAAU,CAAC;AACf,iBAAS,OAAO,KAAK,YAAY;AAC/B,cAAI,eAAe,KAAK,YAAY,GAAG,GAAG;AACxC,oBAAQ,KAAK,cAAc,MAAM,UAAU,KAAK,WAAW,GAAG,EAAE,MAAM,OAAO,IAAI,MAAM;AAAA,UACzF;AAAA,QACF;AACA,YAAI,MAAM,gCAAgC,QAAQ,KAAK,IAAI,IAAI;AAC/D,eAAO;AAAA,MACT;AAAA,IACF;AACA,IAAAG,iBAAgBH,aAAY,QAAQH,OAAI;AACxC,WAAOG;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,IACT,QAAQ;AAAA,EACV,CAAC;;;ACjLM,WAAS,eAAe,aAAa,MAAM;AAChD,WAAO,IAAI,eAAe,aAAa,IAAI,kBAAkB,IAAI,GAAG,IAAI,IAAI,OAAO,KAAK,IAAI,CAAC,CAAC;AAAA,EAChG;;;ACRA,MAAII,UAAO;AACX,MAAIC,kBAAe,CAAC,MAAM;AACnB,MAAI,qBAAoC,wBAAQD,SAAMC,iBAAc,UAAQ;AACjF,QAAI;AAAA,MACF,MAAAC;AAAA,IACF,IAAI;AAQJ,aAAS,mBAAmB,MAAM,aAAa;AAC7C,UAAI,UAAU;AACd,UAAI,gBAAgB,QAAQ;AAC1B,eAAO,kBAAkB,OAAO,EAAG,WAAU,QAAQ;AAAA,MACvD;AACA,UAAI,eAAe,OAAO,EAAG,QAAO;AACpC,UAAI,eAAe,OAAO,GAAG;AAC3B,eAAO,mBAAmB,QAAQ,KAAK,CAAC,GAAG,WAAW;AAAA,MACxD;AACA,aAAO;AAAA,IACT;AAeA,aAAS,8BAA8B,MAAM,aAAa,UAAU,MAAM,OAAO;AAE/E,UAAI,aAAa,cAAc,MAAM,aAAa,QAAQ;AAC1D,UAAI,gBAAgB,iBAAiB,MAAM,WAAW;AACtD,UAAI,gBAAgB,SAAS,KAAK,SAAS,KAAK,KAAK,cAAc,MAAM,sBAAsB,KAAK,cAAc,MAAM,yBAAyB;AAC/I,eAAO,KAAK,IAAI,SAAUC,MAAK;AAC7B,kBAAQA,KAAI,WAAW,EAAE,MAAM;AAAA;AAAA,YAE7B,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AAAA,YACL,KAAK;AACH,qBAAO;AAAA,YACT;AACE,qBAAO;AAAA,UACX;AAAA,QACF,CAAC;AAAA,MACH;AACA,UAAI;AACJ,cAAQ,KAAK,QAAQ;AAAA,QACnB,KAAK;AACH,mBAAS,CAAC;AACV;AAAA,QACF,KAAK;AAEH;AAEE,gBAAI,oBAAoB,cAAc,KAAK,CAAC,GAAG,aAAa,UAAU,IAAI;AAG1E,gBAAI,SAAS,sBAAsB,MAAM;AACvC,kBAAI;AACJ,kBAAI;AACJ,kBAAI,gBAAgB,QAAQ;AAC1B,oCAAoB,KAAK,CAAC,EAAE,cAAc;AAC1C,iCAAiB,KAAK,cAAc;AAAA,cACtC,OAAO;AAEL,oCAAoB,KAAK,CAAC,EAAE,WAAW,EAAE,cAAc;AACvD,iCAAiB,KAAK,WAAW,EAAE,cAAc;AAAA,cACnD;AACA,kBAAI,WAAW,UAAU,EAAE,cAAc,EAAE,oBAAoB,OAAO;AACpE,yBAAS,CAAC,KAAK;AACf;AAAA,cACF;AACA,kBAAI,WAAW,iBAAiB,EAAE,iBAAiB,EAAE,gBAAgB,OAAO;AAC1E,yBAAS,CAAC,KAAK;AACf;AAAA,cACF;AAAA,YACF;AACA,gBAAI,sBAAsB,MAAM;AAE9B,uBAAS,CAAC,KAAK;AACf;AAAA,YACF;AACA,gBAAI,qBAAqB,YAAY;AAEnC,uBAAS,CAAC,IAAI;AACd;AAAA,YACF;AAGA,qBAAS,CAAC,KAAK;AAAA,UACjB;AACA;AAAA,QACF,KAAK;AAEH;AACE,gBAAI;AAEJ,gBAAI,gBAAgB,cAAc,KAAK,CAAC,GAAG,aAAa,UAAU,IAAI;AAEtE,gBAAI,eAAe,kBAAkB,MAAM,KAAK,CAAC,GAAG,WAAW;AAC/D,gBAAI,kBAAkB,MAAM;AAG1B,0BAAY;AAAA,YACd,WAAW,kBAAkB,cAAc,kBAAkB,WAAW,CAAC,cAAc;AAKrF,0BAAY;AAAA,YACd,WAAW,gBAAgB,YAAY;AACrC,0BAAY;AAAA,YACd,OAAO;AACL,0BAAY;AAAA,YACd;AACA,gBAAI;AAEJ,gBAAI,gBAAgB,cAAc,KAAK,CAAC,GAAG,aAAa,UAAU,IAAI;AAEtE,gBAAI,eAAe,kBAAkB,MAAM,KAAK,CAAC,GAAG,WAAW;AAC/D,gBAAI,kBAAkB,MAAM;AAG1B,0BAAY;AAAA,YACd,WAAW,kBAAkB,cAAc,kBAAkB,UAAU,CAAC,cAAc;AAKpF,0BAAY;AAAA,YACd,WAAW,gBAAgB,YAAY;AACrC,0BAAY;AAAA,YACd,OAAO;AACL,0BAAY;AAAA,YACd;AAGA,gBAAI,OAAO;AACT,kBAAI;AACJ,kBAAI;AACJ,kBAAI;AACJ,kBAAI,gBAAgB,QAAQ;AAC1B,kCAAkB,KAAK,cAAc;AACrC,gCAAgB,KAAK,KAAK,CAAC,EAAE,cAAc;AAC3C,gCAAgB,KAAK,KAAK,CAAC,EAAE,cAAc;AAAA,cAC7C,OAAO;AAEL,kCAAkB,KAAK,WAAW,EAAE,cAAc;AAClD,gCAAgB,KAAK,KAAK,CAAC,EAAE,WAAW,EAAE,cAAc;AACxD,gCAAgB,KAAK,KAAK,CAAC,EAAE,WAAW,EAAE,cAAc;AAAA,cAC1D;AACA,kBAAI,kBAAkB,MAAM;AAC1B,oBAAI,WAAW,UAAU,EAAE,eAAe,EAAE,oBAAoB,OAAO;AACrE,8BAAY;AAAA,gBACd;AACA,oBAAI,WAAW,aAAa,EAAE,aAAa,EAAE,gBAAgB,OAAO;AAClE,8BAAY;AAAA,gBACd;AAAA,cACF;AACA,kBAAI,kBAAkB,MAAM;AAC1B,oBAAI,WAAW,UAAU,EAAE,eAAe,EAAE,qBAAqB,OAAO;AACtE,8BAAY;AAAA,gBACd;AACA,oBAAI,WAAW,aAAa,EAAE,aAAa,EAAE,gBAAgB,OAAO;AAClE,8BAAY;AAAA,gBACd;AAAA,cACF;AAAA,YACF;AACA,qBAAS,CAAC,WAAW,SAAS;AAAA,UAChC;AACA;AAAA,QACF;AACE,cAAI,KAAK,cAAc,MAAM,sBAAsB,KAAK,cAAc,MAAM,yBAAyB;AACnG,qBAAS,KAAK,IAAI,SAAUA,MAAK;AAC/B,kBAAI,gBAAgB,cAAcA,MAAK,aAAa,UAAU,IAAI;AAClE,kBAAI,eAAe,kBAAkB,MAAMA,MAAK,WAAW;AAC3D,kBAAI,mBAAmB,iBAAiBA,MAAK,WAAW;AACxD,kBAAI,kBAAkB,MAAM;AAE1B,uBAAO;AAAA,cACT,WAAW,eAAe,iBAAiB,kBAAkB,oBAAoB,CAAC,cAAc;AAC9F,uBAAO;AAAA,cACT,WAAW,gBAAgB,YAAY;AACrC,uBAAO;AAAA,cACT;AACA,qBAAO;AAAA,YACT,CAAC;AAAA,UACH;AACA;AAAA,MACJ;AAMA,UAAI,KAAK,UAAU,KAAK,KAAK,cAAc,MAAM,2BAA2B,KAAK,YAAY,gBAAgB,SAAS,aAAa,QAAQ;AACzI,iBAASC,KAAI,GAAGA,KAAI,OAAO,QAAQ,EAAEA,IAAG;AACtC,cAAI,mBAAmB,KAAKA,EAAC,GAAG,WAAW,KAAK,CAAC,OAAOA,KAAI,CAAC,MAAM,gBAAgB,UAAU,CAAC,kBAAkB,KAAKA,KAAI,CAAC,CAAC,IAAI;AAC7H,mBAAOA,EAAC,IAAI;AAAA,UACd;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,IACA,MAAMC,sBAAqBH,MAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAY9B,YAAY,IAAI,IAAI,MAAM,UAAU,cAAc;AAChD,cAAM;AAEN,YAAI,OAAO,OAAO,UAAU;AAC1B,gBAAM,IAAI,UAAU,oCAAoC;AAAA,QAC1D;AACA,YAAI,OAAO,OAAO,UAAU;AAC1B,gBAAM,IAAI,UAAU,oCAAoC;AAAA,QAC1D;AACA,YAAI,CAAC,MAAM,QAAQ,IAAI,KAAK,CAAC,KAAK,MAAM,MAAM,GAAG;AAC/C,gBAAM,IAAI,UAAU,sDAAsD;AAAA,QAC5E;AACA,aAAK,WAAW,aAAa;AAC7B,aAAK,eAAe,iBAAiB;AACrC,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,OAAO,QAAQ,CAAC;AAAA,MACvB;AAAA,MACA,IAAI,OAAO;AACT,eAAOF;AAAA,MACT;AAAA,MACA,IAAI,iBAAiB;AACnB,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAeA,SAASM,OAAM,UAAU;AAEvB,YAAI,OAAO,KAAK,OAAO,YAAY,CAAC,aAAaA,OAAM,KAAK,EAAE,GAAG;AAC/D,cAAI,CAACA,MAAK,KAAK,EAAE,GAAG;AAClB,kBAAM,IAAI,MAAM,cAAc,KAAK,KAAK,uCAAuC;AAAA,UACjF,OAAO;AACL,kBAAM,IAAI,MAAM,4BAA4B,KAAK,KAAK,GAAG;AAAA,UAC3D;AAAA,QACF;AACA,YAAI,KAAK,gBAAgBA,OAAM,KAAK,EAAE;AACtC,YAAI,WAAW,IAAI,KAAK,MAAM,SAAUH,MAAK;AAC3C,iBAAOA,KAAI,SAASG,OAAM,QAAQ;AAAA,QACpC,CAAC;AACD,YAAI,OAAO,OAAO,cAAc,GAAG,YAAY,MAAM;AAGnD,cAAI,UAAU,KAAK;AACnB,iBAAO,SAAS,iBAAiB,OAAO,MAAM,SAAS;AACrD,mBAAO,GAAG,SAASA,OAAM,eAAe,OAAO,IAAI,CAAC;AAAA,UACtD;AAAA,QACF,WAAW,SAAS,WAAW,GAAG;AAChC,cAAI,WAAW,SAAS,CAAC;AACzB,iBAAO,SAAS,iBAAiB,OAAO,MAAM,SAAS;AACrD,mBAAO,GAAG,SAAS,OAAO,MAAM,OAAO,CAAC;AAAA,UAC1C;AAAA,QACF,WAAW,SAAS,WAAW,GAAG;AAChC,cAAI,WAAW,SAAS,CAAC;AACzB,cAAI,WAAW,SAAS,CAAC;AACzB,iBAAO,SAAS,iBAAiB,OAAO,MAAM,SAAS;AACrD,mBAAO,GAAG,SAAS,OAAO,MAAM,OAAO,GAAG,SAAS,OAAO,MAAM,OAAO,CAAC;AAAA,UAC1E;AAAA,QACF,OAAO;AACL,iBAAO,SAAS,iBAAiB,OAAO,MAAM,SAAS;AACrD,mBAAO,GAAG,MAAM,MAAM,IAAI,UAAU,SAAU,SAAS;AACrD,qBAAO,QAAQ,OAAO,MAAM,OAAO;AAAA,YACrC,CAAC,CAAC;AAAA,UACJ;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ,UAAU;AAChB,iBAASF,KAAI,GAAGA,KAAI,KAAK,KAAK,QAAQA,MAAK;AACzC,mBAAS,KAAK,KAAKA,EAAC,GAAG,UAAUA,KAAI,KAAK,IAAI;AAAA,QAChD;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,IAAI,UAAU;AACZ,YAAI,OAAO,CAAC;AACZ,iBAASA,KAAI,GAAGA,KAAI,KAAK,KAAK,QAAQA,MAAK;AACzC,eAAKA,EAAC,IAAI,KAAK,QAAQ,SAAS,KAAK,KAAKA,EAAC,GAAG,UAAUA,KAAI,KAAK,IAAI,CAAC;AAAA,QACxE;AACA,eAAO,IAAIC,cAAa,KAAK,IAAI,KAAK,IAAI,MAAM,KAAK,UAAU,KAAK,YAAY;AAAA,MAClF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ;AACN,eAAO,IAAIA,cAAa,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,MAAM,CAAC,GAAG,KAAK,UAAU,KAAK,YAAY;AAAA,MAChG;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,UAAU;AACR,eAAO,KAAK,KAAK,WAAW;AAAA,MAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,WAAW;AACT,eAAO,KAAK,KAAK,WAAW;AAAA,MAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,UAAU,SAAS;AACjB,YAAI,cAAc,WAAW,QAAQ,cAAc,QAAQ,cAAc;AACzE,YAAI,WAAW,WAAW,QAAQ,WAAW,QAAQ,WAAW;AAChE,YAAI,OAAO,KAAK;AAChB,YAAI,SAAS,8BAA8B,MAAM,aAAa,UAAU,MAAM,KAAK;AACnF,YAAI,KAAK,WAAW,GAAG;AAErB,cAAI,QAAQ,iBAAiB,MAAM,WAAW;AAC9C,cAAI,UAAU,KAAK,CAAC,EAAE,SAAS,OAAO;AACtC,cAAI,OAAO,CAAC,GAAG;AACb,sBAAU,MAAM,UAAU;AAAA,UAC5B;AAGA,cAAI,YAAY,YAAY,KAAK,KAAK,EAAE;AACxC,cAAI,UAAU,SAAS;AAErB,mBAAO,KAAK,MAAM,YAAY,MAAM,MAAM;AAAA,UAC5C,WAAW,UAAU,QAAQ;AAE3B,mBAAO,WAAW,YAAY,MAAM,MAAM,KAAK;AAAA,UACjD;AAGA,iBAAO,UAAU,KAAK;AAAA,QACxB,WAAW,KAAK,WAAW,GAAG;AAC5B,cAAI,MAAM,KAAK,CAAC,EAAE,SAAS,OAAO;AAClC,cAAI,MAAM,KAAK,CAAC,EAAE,SAAS,OAAO;AAClC,cAAI,OAAO,CAAC,GAAG;AAEb,kBAAM,MAAM,MAAM;AAAA,UACpB;AACA,cAAI,OAAO,CAAC,GAAG;AAEb,kBAAM,MAAM,MAAM;AAAA,UACpB;AACA,cAAI,KAAK,YAAY,KAAK,cAAc,MAAM,2BAA2B,aAAa,QAAQ;AAC5F,mBAAO,MAAM,MAAM;AAAA,UACrB;AACA,iBAAO,MAAM,MAAM,KAAK,KAAK,MAAM;AAAA,QACrC,WAAW,KAAK,SAAS,MAAM,KAAK,cAAc,MAAM,sBAAsB,KAAK,cAAc,MAAM,0BAA0B;AAC/H,cAAI,kBAAkB,KAAK,IAAI,SAAUF,MAAKI,QAAO;AACnD,YAAAJ,OAAMA,KAAI,SAAS,OAAO;AAC1B,gBAAI,OAAOI,MAAK,GAAG;AAEjB,cAAAJ,OAAM,MAAMA,OAAM;AAAA,YACpB;AACA,mBAAOA;AAAA,UACT,CAAC;AACD,cAAI,KAAK,YAAY,KAAK,cAAc,MAAM,2BAA2B,aAAa,QAAQ;AAC5F,mBAAO,gBAAgB,KAAK,GAAG;AAAA,UACjC;AACA,iBAAO,gBAAgB,KAAK,MAAM,KAAK,KAAK,GAAG;AAAA,QACjD,OAAO;AAEL,iBAAO,KAAK,KAAK,MAAM,KAAK,KAAK,KAAK,IAAI,IAAI;AAAA,QAChD;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,SAAS;AACP,eAAO;AAAA,UACL,QAAQH;AAAA,UACR,IAAI,KAAK;AAAA,UACT,IAAI,KAAK;AAAA,UACT,MAAM,KAAK;AAAA,UACX,UAAU,KAAK;AAAA,UACf,cAAc,KAAK;AAAA,QACrB;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAeA,OAAO,SAAS,MAAM;AACpB,eAAO,IAAIK,cAAa,KAAK,IAAI,KAAK,IAAI,KAAK,MAAM,KAAK,UAAU,KAAK,YAAY;AAAA,MACvF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,QAAQ,SAAS;AACf,YAAI,cAAc,WAAW,QAAQ,cAAc,QAAQ,cAAc;AACzE,YAAI,WAAW,WAAW,QAAQ,WAAW,QAAQ,WAAW;AAChE,YAAI,OAAO,KAAK;AAChB,YAAI,SAAS,8BAA8B,MAAM,aAAa,UAAU,MAAM,KAAK;AACnF,YAAI,KAAK,WAAW,GAAG;AAErB,cAAI,QAAQ,iBAAiB,MAAM,WAAW;AAC9C,cAAI,UAAU,KAAK,CAAC,EAAE,OAAO,OAAO;AACpC,cAAI,OAAO,CAAC,GAAG;AACb,sBAAU,mEAAmE,UAAU;AAAA,UACzF;AACA,cAAI,UAAU,SAAS;AAErB,mBAAO,kFAAuF,OAAO,KAAK,EAAE,IAAI,YAAY;AAAA,UAC9H,OAAO;AAEL,mBAAO,UAAU,mFAAwF,OAAO,KAAK,EAAE,IAAI;AAAA,UAC7H;AAAA,QACF,WAAW,KAAK,WAAW,GAAG;AAE5B,cAAI,MAAM,KAAK,CAAC,EAAE,OAAO,OAAO;AAChC,cAAI,MAAM,KAAK,CAAC,EAAE,OAAO,OAAO;AAChC,cAAI,OAAO,CAAC,GAAG;AAEb,kBAAM,mEAAmE,MAAM;AAAA,UACjF;AACA,cAAI,OAAO,CAAC,GAAG;AAEb,kBAAM,mEAAmE,MAAM;AAAA,UACjF;AACA,cAAI,KAAK,YAAY,KAAK,cAAc,MAAM,2BAA2B,aAAa,QAAQ;AAC5F,mBAAO,MAAM,2FAAgG;AAAA,UAC/G;AACA,iBAAO,MAAM,oFAAyF,OAAO,KAAK,EAAE,IAAI,YAAY;AAAA,QACtI,OAAO;AACL,cAAI,kBAAkB,KAAK,IAAI,SAAUF,MAAKI,QAAO;AACnD,YAAAJ,OAAMA,KAAI,OAAO,OAAO;AACxB,gBAAI,OAAOI,MAAK,GAAG;AAEjB,cAAAJ,OAAM,mEAAmEA,OAAM;AAAA,YACjF;AACA,mBAAOA;AAAA,UACT,CAAC;AACD,cAAI,KAAK,SAAS,MAAM,KAAK,cAAc,MAAM,sBAAsB,KAAK,cAAc,MAAM,0BAA0B;AACxH,gBAAI,KAAK,YAAY,KAAK,cAAc,MAAM,2BAA2B,aAAa,QAAQ;AAC5F,qBAAO,gBAAgB,KAAK,wFAA6F;AAAA,YAC3H;AACA,mBAAO,gBAAgB,KAAK,oFAAyF,OAAO,KAAK,EAAE,IAAI,SAAS;AAAA,UAClJ,OAAO;AAEL,mBAAO,iCAAiC,OAAO,KAAK,EAAE,IAAI,0EAA+E,gBAAgB,KAAK,uCAAuC,IAAI;AAAA,UAC3M;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,OAAO,SAAS;AACd,YAAI,cAAc,WAAW,QAAQ,cAAc,QAAQ,cAAc;AACzE,YAAI,WAAW,WAAW,QAAQ,WAAW,QAAQ,WAAW;AAChE,YAAI,OAAO,KAAK;AAChB,YAAI,SAAS,8BAA8B,MAAM,aAAa,UAAU,MAAM,IAAI;AAClF,YAAI,KAAK,eAAe,KAAK,EAAE;AAC/B,aAAK,OAAO,OAAO,cAAc,KAAK,KAAK;AAE3C,YAAI,KAAK,WAAW,GAAG;AAErB,cAAI,QAAQ,iBAAiB,MAAM,WAAW;AAC9C,cAAI,UAAU,KAAK,CAAC,EAAE,MAAM,OAAO;AACnC,cAAI,OAAO,CAAC,GAAG;AACb,sBAAU,UAAU,OAAO,SAAS,UAAU;AAAA,UAChD;AACA,cAAI,UAAU,SAAS;AAErB,mBAAO,KAAK;AAAA,UACd,WAAW,UAAU,QAAQ;AAE3B,mBAAO,UAAU;AAAA,UACnB;AAGA,iBAAO,UAAU;AAAA,QACnB,WAAW,KAAK,WAAW,GAAG;AAE5B,cAAI,MAAM,KAAK,CAAC;AAChB,cAAI,SAAS,IAAI,MAAM,OAAO;AAC9B,cAAI,OAAO,CAAC,GAAG;AACb,qBAAS,UAAU,OAAO,QAAQ,UAAU;AAAA,UAC9C;AACA,cAAI,MAAM,KAAK,CAAC;AAChB,cAAI,SAAS,IAAI,MAAM,OAAO;AAC9B,cAAI,OAAO,CAAC,GAAG;AACb,qBAAS,UAAU,OAAO,QAAQ,UAAU;AAAA,UAC9C;AAGA,cAAI;AACJ,cAAI,gBAAgB,QAAQ;AAC1B,4BAAgB,IAAI,cAAc;AAAA,UACpC,OAAO;AAEL,4BAAgB,IAAI,WAAW,EAAE,cAAc;AAAA,UACjD;AACA,kBAAQ,KAAK,cAAc,GAAG;AAAA,YAC5B,KAAK;AAEH,qBAAO,KAAK,MAAM,SAAS,OAAY,SAAS;AAAA,YAClD,KAAK;AACH,uBAAS,MAAM,SAAS;AACxB,uBAAS,MAAM,SAAS;AACxB,sBAAQ,eAAe;AAAA,gBACrB,KAAK;AAAA;AAAA,gBACL,KAAK;AACH,2BAAS,UAAU,OAAO,QAAQ,UAAU;AAAA,cAChD;AACA;AAAA,YACF,KAAK;AACH,kBAAI,KAAK,YAAY,aAAa,QAAQ;AACxC,uBAAO,SAAS,MAAM;AAAA,cACxB;AAAA,UACJ;AACA,iBAAO,SAAS,KAAK;AAAA,QACvB,WAAW,KAAK,SAAS,MAAM,KAAK,cAAc,MAAM,sBAAsB,KAAK,cAAc,MAAM,0BAA0B;AAC/H,cAAI,eAAe,KAAK,IAAI,SAAUA,MAAKI,QAAO;AAChD,YAAAJ,OAAMA,KAAI,MAAM,OAAO;AACvB,gBAAI,OAAOI,MAAK,GAAG;AACjB,cAAAJ,OAAM,UAAU,OAAOA,MAAK,UAAU;AAAA,YACxC;AACA,mBAAOA;AAAA,UACT,CAAC;AACD,cAAI,KAAK,cAAc,MAAM,2BAA2B,KAAK,YAAY,aAAa,QAAQ;AAC5F,mBAAO,aAAa,KAAK,GAAG;AAAA,UAC9B;AACA,iBAAO,aAAa,KAAK,EAAE;AAAA,QAC7B,OAAO;AAIL,iBAAO,cAAc,KAAK,KAAK,aAAa,KAAK,IAAI,SAAUA,MAAK;AAClE,mBAAOA,KAAI,MAAM,OAAO;AAAA,UAC1B,CAAC,EAAE,KAAK,GAAG,IAAI;AAAA,QACjB;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,gBAAgB;AACd,eAAO,KAAK,OAAO,MAAM,KAAK;AAAA,MAChC;AAAA,IACF;AACA,IAAAK,iBAAgBH,eAAc,QAAQL,OAAI;AAC1C,WAAOK;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,IACT,QAAQ;AAAA,EACV,CAAC;;;ACjnBD,MAAII,UAAO;AACX,MAAIC,kBAAe,CAAC,MAAM;AACnB,MAAI,wBAAuC,wBAAQD,SAAMC,iBAAc,UAAQ;AACpF,QAAI;AAAA,MACF,MAAAC;AAAA,IACF,IAAI;AAAA,IACJ,MAAMC,yBAAwBD,MAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQjC,YAAY,SAAS;AACnB,cAAM;AAEN,YAAI,CAAC,OAAO,OAAO,GAAG;AACpB,gBAAM,IAAI,UAAU,uCAAuC;AAAA,QAC7D;AACA,aAAK,UAAU;AAAA,MACjB;AAAA,MACA,IAAI,OAAO;AACT,eAAOF;AAAA,MACT;AAAA,MACA,IAAI,oBAAoB;AACtB,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAeA,SAASI,OAAM,UAAU;AACvB,eAAO,KAAK,QAAQ,SAASA,OAAM,QAAQ;AAAA,MAC7C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,aAAa;AACX,eAAO,KAAK,QAAQ,WAAW;AAAA,MACjC;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ,UAAU;AAChB,iBAAS,KAAK,SAAS,WAAW,IAAI;AAAA,MACxC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,IAAI,UAAU;AACZ,YAAI,UAAU,SAAS,KAAK,SAAS,WAAW,IAAI;AACpD,eAAO,IAAID,iBAAgB,OAAO;AAAA,MACpC;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ;AACN,eAAO,IAAIA,iBAAgB,KAAK,OAAO;AAAA,MACzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,UAAU,SAAS;AACjB,YAAI,CAAC,WAAW,WAAW,CAAC,QAAQ,eAAe,WAAW,QAAQ,gBAAgB,QAAQ;AAC5F,iBAAO,MAAM,KAAK,QAAQ,SAAS,OAAO,IAAI;AAAA,QAChD;AACA,eAAO,KAAK,QAAQ,SAAS,OAAO;AAAA,MACtC;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,SAAS;AACP,eAAO;AAAA,UACL,QAAQH;AAAA,UACR,SAAS,KAAK;AAAA,QAChB;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,OAAO,SAAS,MAAM;AACpB,eAAO,IAAIG,iBAAgB,KAAK,OAAO;AAAA,MACzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,QAAQ,SAAS;AACf,YAAI,CAAC,WAAW,WAAW,CAAC,QAAQ,eAAe,WAAW,QAAQ,gBAAgB,QAAQ;AAC5F,iBAAO,mEAAmE,KAAK,QAAQ,OAAO,OAAO,IAAI;AAAA,QAC3G;AACA,eAAO,KAAK,QAAQ,OAAO,OAAO;AAAA,MACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,OAAO,SAAS;AACd,YAAI,CAAC,WAAW,WAAW,CAAC,QAAQ,eAAe,WAAW,QAAQ,gBAAgB,QAAQ;AAC5F,iBAAO,UAAU,OAAO,KAAK,QAAQ,MAAM,OAAO,GAAG,UAAU;AAAA,QACjE;AACA,eAAO,KAAK,QAAQ,MAAM,OAAO;AAAA,MACnC;AAAA,IACF;AACA,IAAAE,iBAAgBF,kBAAiB,QAAQH,OAAI;AAC7C,WAAOG;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,IACT,QAAQ;AAAA,EACV,CAAC;;;ACnJD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,MAAM;AACnB,MAAI,kBAAiC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,MAAAC;AAAA,IACF,IAAI;AASJ,aAAS,8BAA8B,MAAM,aAAa,UAAU;AAClE,UAAI,aAAa,cAAc,MAAM,aAAa,QAAQ;AAC1D,UAAI,SAAS,CAAC;AACd,UAAI,kBAAkB,cAAc,KAAK,OAAO,aAAa,QAAQ;AACrE,aAAO,QAAQ,oBAAoB,QAAQ,mBAAmB,cAAc,gBAAgB;AAC5F,UAAI,KAAK,MAAM;AACb,YAAI,iBAAiB,cAAc,KAAK,MAAM,aAAa,QAAQ;AACnE,eAAO,OAAO,mBAAmB,QAAQ,kBAAkB,cAAc,gBAAgB;AAAA,MAC3F;AACA,UAAI,gBAAgB,cAAc,KAAK,KAAK,aAAa,QAAQ;AACjE,aAAO,MAAM,kBAAkB,QAAQ,iBAAiB,cAAc,gBAAgB;AACtF,aAAO;AAAA,IACT;AAAA,IACA,MAAMC,mBAAkBD,MAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAS3B,YAAYE,QAAO,KAAK,MAAM;AAC5B,cAAM;AAEN,YAAI,CAAC,OAAOA,MAAK,EAAG,OAAM,IAAI,UAAU,eAAe;AACvD,YAAI,CAAC,OAAO,GAAG,EAAG,OAAM,IAAI,UAAU,eAAe;AACrD,YAAI,QAAQ,CAAC,OAAO,IAAI,EAAG,OAAM,IAAI,UAAU,eAAe;AAC9D,YAAI,UAAU,SAAS,EAAG,OAAM,IAAI,MAAM,oBAAoB;AAC9D,aAAK,QAAQA;AACb,aAAK,MAAM;AACX,aAAK,OAAO,QAAQ;AAAA,MACtB;AAAA,MACA,IAAI,OAAO;AACT,eAAOJ;AAAA,MACT;AAAA,MACA,IAAI,cAAc;AAChB,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,WAAW;AAET,YAAI,aAAa,KAAK,OAAO,SAAU,MAAM;AAC3C,iBAAO,aAAa,IAAI,KAAK,KAAK,SAAS;AAAA,QAC7C,CAAC;AACD,eAAO,WAAW,SAAS;AAAA,MAC7B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAeA,SAASK,OAAM,UAAU;AACvB,YAAIC,SAAQD,MAAK;AACjB,YAAI,YAAY,KAAK,MAAM,SAASA,OAAM,QAAQ;AAClD,YAAI,UAAU,KAAK,IAAI,SAASA,OAAM,QAAQ;AAC9C,YAAI,KAAK,MAAM;AACb,cAAI,WAAW,KAAK,KAAK,SAASA,OAAM,QAAQ;AAChD,iBAAO,SAAS,cAAc,OAAO,MAAM,SAAS;AAClD,mBAAOC,OAAM,UAAU,OAAO,MAAM,OAAO,GAAG,QAAQ,OAAO,MAAM,OAAO,GAAG,SAAS,OAAO,MAAM,OAAO,CAAC;AAAA,UAC7G;AAAA,QACF,OAAO;AACL,iBAAO,SAAS,cAAc,OAAO,MAAM,SAAS;AAClD,mBAAOA,OAAM,UAAU,OAAO,MAAM,OAAO,GAAG,QAAQ,OAAO,MAAM,OAAO,CAAC;AAAA,UAC7E;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ,UAAU;AAChB,iBAAS,KAAK,OAAO,SAAS,IAAI;AAClC,iBAAS,KAAK,KAAK,OAAO,IAAI;AAC9B,YAAI,KAAK,MAAM;AACb,mBAAS,KAAK,MAAM,QAAQ,IAAI;AAAA,QAClC;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,IAAI,UAAU;AACZ,eAAO,IAAIH,WAAU,KAAK,QAAQ,SAAS,KAAK,OAAO,SAAS,IAAI,CAAC,GAAG,KAAK,QAAQ,SAAS,KAAK,KAAK,OAAO,IAAI,CAAC,GAAG,KAAK,QAAQ,KAAK,QAAQ,SAAS,KAAK,MAAM,QAAQ,IAAI,CAAC,CAAC;AAAA,MACrL;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ;AACN,eAAO,IAAIA,WAAU,KAAK,OAAO,KAAK,KAAK,KAAK,QAAQ,KAAK,IAAI;AAAA,MACnE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,UAAU,SAAS;AACjB,YAAI,cAAc,WAAW,QAAQ,cAAc,QAAQ,cAAc;AACzE,YAAI,SAAS,8BAA8B,MAAM,aAAa,WAAW,QAAQ,QAAQ;AAGzF,YAAI;AACJ,YAAIC,SAAQ,KAAK,MAAM,SAAS,OAAO;AACvC,YAAI,OAAO,OAAO;AAChB,UAAAA,SAAQ,MAAMA,SAAQ;AAAA,QACxB;AACA,cAAMA;AACN,YAAI,KAAK,MAAM;AACb,cAAI,OAAO,KAAK,KAAK,SAAS,OAAO;AACrC,cAAI,OAAO,MAAM;AACf,mBAAO,MAAM,OAAO;AAAA,UACtB;AACA,iBAAO,MAAM;AAAA,QACf;AACA,YAAI,MAAM,KAAK,IAAI,SAAS,OAAO;AACnC,YAAI,OAAO,KAAK;AACd,gBAAM,MAAM,MAAM;AAAA,QACpB;AACA,eAAO,MAAM;AACb,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,SAAS;AACP,eAAO;AAAA,UACL,QAAQJ;AAAA,UACR,OAAO,KAAK;AAAA,UACZ,KAAK,KAAK;AAAA,UACV,MAAM,KAAK;AAAA,QACb;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAUA,OAAO,SAAS,MAAM;AACpB,eAAO,IAAIG,WAAU,KAAK,OAAO,KAAK,KAAK,KAAK,IAAI;AAAA,MACtD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,QAAQ,SAAS;AACf,YAAI,cAAc,WAAW,QAAQ,cAAc,QAAQ,cAAc;AACzE,YAAI,SAAS,8BAA8B,MAAM,aAAa,WAAW,QAAQ,QAAQ;AAGzF,YAAI;AACJ,YAAIC,SAAQ,KAAK,MAAM,OAAO,OAAO;AACrC,YAAI,OAAO,OAAO;AAChB,UAAAA,SAAQ,mEAAmEA,SAAQ;AAAA,QACrF;AACA,cAAMA;AACN,YAAI,KAAK,MAAM;AACb,cAAI,OAAO,KAAK,KAAK,OAAO,OAAO;AACnC,cAAI,OAAO,MAAM;AACf,mBAAO,mEAAmE,OAAO;AAAA,UACnF;AACA,iBAAO,6DAA6D;AAAA,QACtE;AACA,YAAI,MAAM,KAAK,IAAI,OAAO,OAAO;AACjC,YAAI,OAAO,KAAK;AACd,gBAAM,mEAAmE,MAAM;AAAA,QACjF;AACA,eAAO,6DAA6D;AACpE,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,OAAO,SAAS;AACd,YAAI,cAAc,WAAW,QAAQ,cAAc,QAAQ,cAAc;AACzE,YAAI,SAAS,8BAA8B,MAAM,aAAa,WAAW,QAAQ,QAAQ;AACzF,YAAI,MAAM,KAAK,MAAM,MAAM,OAAO;AAClC,YAAI,OAAO,OAAO;AAChB,gBAAM,UAAU,OAAO,KAAK,UAAU;AAAA,QACxC;AACA,YAAI,KAAK,MAAM;AACb,cAAI,OAAO,KAAK,KAAK,MAAM,OAAO;AAClC,cAAI,OAAO,MAAM;AACf,mBAAO,UAAU,OAAO,MAAM,UAAU;AAAA,UAC1C;AACA,iBAAO,MAAM;AAAA,QACf;AACA,YAAI,MAAM,KAAK,IAAI,MAAM,OAAO;AAChC,YAAI,OAAO,KAAK;AACd,gBAAM,UAAU,OAAO,KAAK,UAAU;AAAA,QACxC;AACA,eAAO,MAAM;AACb,eAAO;AAAA,MACT;AAAA,IACF;AACA,IAAAG,iBAAgBJ,YAAW,QAAQH,OAAI;AACvC,WAAOG;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,IACT,QAAQ;AAAA,EACV,CAAC;;;ACnPD,MAAIK,UAAO;AACX,MAAIC,kBAAe,CAAC,MAAM;AACnB,MAAI,uBAAsC,wBAAQD,SAAMC,iBAAc,UAAQ;AACnF,QAAI;AAAA,MACF,MAAAC;AAAA,IACF,IAAI;AACJ,QAAI,cAAc;AAAA,MAChB,OAAO;AAAA,MACP,SAAS;AAAA,MACT,SAAS;AAAA,MACT,QAAQ;AAAA,MACR,WAAW;AAAA,MACX,UAAU;AAAA,IACZ;AAAA,IACA,MAAMC,wBAAuBD,MAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAYhC,YAAY,cAAc,QAAQ;AAChC,cAAM;AACN,YAAI,CAAC,MAAM,QAAQ,YAAY,GAAG;AAChC,gBAAM,IAAI,UAAU,yCAAyC;AAAA,QAC/D;AACA,YAAI,CAAC,MAAM,QAAQ,MAAM,GAAG;AAC1B,gBAAM,IAAI,UAAU,mCAAmC;AAAA,QACzD;AACA,YAAI,aAAa,WAAW,OAAO,SAAS,GAAG;AAC7C,gBAAM,IAAI,UAAU,oFAAyF;AAAA,QAC/G;AACA,aAAK,eAAe;AACpB,aAAK,SAAS;AAAA,MAChB;AAAA,MACA,IAAI,OAAO;AACT,eAAOF;AAAA,MACT;AAAA,MACA,IAAI,mBAAmB;AACrB,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAeA,SAASI,OAAM,UAAU;AACvB,YAAIC,QAAO;AACX,YAAI,WAAW,KAAK,OAAO,IAAI,OAAK,EAAE,SAASD,OAAM,QAAQ,CAAC;AAC9D,eAAO,SAAS,mBAAmB,OAAO,MAAM,SAAS;AACvD,cAAI;AACJ,cAAI,UAAU,SAAS,CAAC,EAAE,OAAO,MAAM,OAAO;AAC9C,mBAASE,KAAI,GAAGA,KAAID,MAAK,aAAa,QAAQC,MAAK;AACjD,sBAAU;AACV,sBAAU,SAASA,KAAI,CAAC,EAAE,OAAO,MAAM,OAAO;AAC9C,gBAAI,SAAS,gBAAgBF,OAAMC,MAAK,aAAaC,EAAC,CAAC;AACvD,gBAAI,CAAC,OAAO,SAAS,OAAO,GAAG;AAC7B,qBAAO;AAAA,YACT;AAAA,UACF;AACA,iBAAO;AAAA,QACT;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ,UAAU;AAChB,aAAK,OAAO,QAAQ,CAAC,GAAGA,OAAM,SAAS,GAAG,YAAYA,KAAI,KAAK,IAAI,GAAG,IAAI;AAAA,MAC5E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,IAAI,UAAU;AACZ,eAAO,IAAIH,gBAAe,KAAK,aAAa,MAAM,GAAG,KAAK,OAAO,IAAI,CAAC,GAAGG,OAAM,KAAK,QAAQ,SAAS,GAAG,YAAYA,KAAI,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC;AAAA,MAC5I;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ;AACN,eAAO,IAAIH,gBAAe,KAAK,cAAc,KAAK,MAAM;AAAA,MAC1D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,UAAU,SAAS;AACjB,YAAI,cAAc,WAAW,QAAQ,cAAc,QAAQ,cAAc;AACzE,YAAI,aAAa,cAAc,MAAM,aAAa,WAAW,QAAQ,QAAQ;AAC7E,YAAI,eAAe,KAAK,OAAO,IAAI,SAAU,GAAGI,QAAO;AACrD,cAAI,kBAAkB,cAAc,GAAG,aAAa,WAAW,QAAQ,QAAQ;AAC/E,iBAAO,gBAAgB,SAAS,oBAAoB,QAAQ,mBAAmB,aAAa,MAAM,EAAE,SAAS,OAAO,IAAI,MAAM,EAAE,SAAS,OAAO;AAAA,QAClJ,CAAC;AACD,YAAI,MAAM,aAAa,CAAC;AACxB,iBAASD,KAAI,GAAGA,KAAI,KAAK,aAAa,QAAQA,MAAK;AACjD,iBAAO,MAAM,YAAY,KAAK,aAAaA,EAAC,CAAC;AAC7C,iBAAO,MAAM,aAAaA,KAAI,CAAC;AAAA,QACjC;AACA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,SAAS;AACP,eAAO;AAAA,UACL,QAAQN;AAAA,UACR,cAAc,KAAK;AAAA,UACnB,QAAQ,KAAK;AAAA,QACf;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAUA,OAAO,SAAS,MAAM;AACpB,eAAO,IAAIG,gBAAe,KAAK,cAAc,KAAK,MAAM;AAAA,MAC1D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,QAAQ,SAAS;AACf,YAAI,cAAc,WAAW,QAAQ,cAAc,QAAQ,cAAc;AACzE,YAAI,aAAa,cAAc,MAAM,aAAa,WAAW,QAAQ,QAAQ;AAC7E,YAAI,eAAe,KAAK,OAAO,IAAI,SAAU,GAAGI,QAAO;AACrD,cAAI,kBAAkB,cAAc,GAAG,aAAa,WAAW,QAAQ,QAAQ;AAC/E,iBAAO,gBAAgB,SAAS,oBAAoB,QAAQ,mBAAmB,aAAa,mEAAmE,EAAE,OAAO,OAAO,IAAI,mEAAmE,EAAE,OAAO,OAAO;AAAA,QACxQ,CAAC;AACD,YAAI,MAAM,aAAa,CAAC;AACxB,iBAASD,KAAI,GAAGA,KAAI,KAAK,aAAa,QAAQA,MAAK;AACjD,iBAAO,oFAAyF,OAAO,YAAY,KAAK,aAAaA,EAAC,CAAC,CAAC,IAAI,YAAY,aAAaA,KAAI,CAAC;AAAA,QAC5K;AACA,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,OAAO,SAAS;AACd,YAAI,cAAc,WAAW,QAAQ,cAAc,QAAQ,cAAc;AACzE,YAAI,aAAa,cAAc,MAAM,aAAa,WAAW,QAAQ,QAAQ;AAC7E,YAAI,eAAe,KAAK,OAAO,IAAI,SAAU,GAAGC,QAAO;AACrD,cAAI,kBAAkB,cAAc,GAAG,aAAa,WAAW,QAAQ,QAAQ;AAC/E,iBAAO,gBAAgB,SAAS,oBAAoB,QAAQ,mBAAmB,aAAa,YAAY,EAAE,MAAM,OAAO,IAAI,YAAY,EAAE,MAAM,OAAO;AAAA,QACxJ,CAAC;AACD,YAAI,MAAM,aAAa,CAAC;AACxB,iBAASD,KAAI,GAAGA,KAAI,KAAK,aAAa,QAAQA,MAAK;AACjD,iBAAO,eAAe,KAAK,aAAaA,EAAC,CAAC,IAAI,aAAaA,KAAI,CAAC;AAAA,QAClE;AACA,eAAO;AAAA,MACT;AAAA,IACF;AACA,IAAAE,iBAAgBL,iBAAgB,QAAQH,OAAI;AAC5C,WAAOG;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,IACT,QAAQ;AAAA,EACV,CAAC;;;ACjMD,MAAIM,UAAO;AACX,MAAIC,kBAAe,CAAC,QAAQ,SAAS,MAAM;AACpC,MAAI,mBAAkC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC/E,QAAI;AAAA,MACF,MAAAC;AAAA,MACA,MAAAC;AAAA,MACA,MAAAC;AAAA,IACF,IAAI;AAMJ,aAAS,gBAAgBJ,SAAM;AAC7B,aAAOG,QAAOA,MAAK,gBAAgBH,OAAI,IAAI;AAAA,IAC7C;AAAA,IACA,MAAMK,oBAAmBD,MAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQ5B,YAAYJ,SAAM;AAChB,cAAM;AAEN,YAAI,OAAOA,YAAS,UAAU;AAC5B,gBAAM,IAAI,UAAU,sCAAsC;AAAA,QAC5D;AACA,aAAK,OAAOA;AAAA,MACd;AAAA,MACA,IAAI,OAAO;AACT,eAAO;AAAA,MACT;AAAA,MACA,IAAI,eAAe;AACjB,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAeA,SAASE,OAAM,UAAU;AACvB,YAAIF,UAAO,KAAK;AAChB,YAAI,SAASA,OAAI,MAAM,MAAM;AAI3B,iBAAO,SAAU,OAAO,MAAM,SAAS;AACrC,mBAAO,gBAAgB,MAAMA,OAAI;AAAA,UACnC;AAAA,QACF,WAAWA,WAAQE,OAAM;AACvB,iBAAO,SAAU,OAAO,MAAM,SAAS;AACrC,mBAAO,MAAM,IAAIF,OAAI,IAAI,MAAM,IAAIA,OAAI,IAAI,gBAAgBE,OAAMF,OAAI;AAAA,UACvE;AAAA,QACF,OAAO;AACL,cAAIM,UAAS,gBAAgBN,OAAI;AACjC,iBAAO,SAAU,OAAO,MAAM,SAAS;AACrC,mBAAO,MAAM,IAAIA,OAAI,IAAI,MAAM,IAAIA,OAAI,IAAIM,UAAS,IAAIH,MAAK,MAAMH,OAAI,IAAIK,YAAW,kBAAkBL,OAAI;AAAA,UAC9G;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ,UAAU;AAAA,MAElB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,IAAI,UAAU;AACZ,eAAO,KAAK,MAAM;AAAA,MACpB;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,OAAO,kBAAkBA,SAAM;AAC7B,cAAM,IAAI,MAAM,sBAAsBA,OAAI;AAAA,MAC5C;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ;AACN,eAAO,IAAIK,YAAW,KAAK,IAAI;AAAA,MACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,UAAU,SAAS;AACjB,eAAO,KAAK;AAAA,MACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,QAAQ,SAAS;AACf,YAAIL,UAAO,OAAO,KAAK,IAAI;AAC3B,YAAIA,YAAS,UAAUA,YAAS,SAAS;AACvC,iBAAO,4CAA4CA,UAAO;AAAA,QAC5D,WAAWA,YAAS,KAAK;AACvB,iBAAO,qDAAqDA,UAAO;AAAA,QACrE,WAAWA,YAAS,YAAY;AAC9B,iBAAO,oDAAoDA,UAAO;AAAA,QACpE,WAAWA,YAAS,OAAO;AACzB,iBAAO,+CAA+CA,UAAO;AAAA,QAC/D,WAAWA,YAAS,QAAQ;AAC1B,iBAAO,gDAAgDA,UAAO;AAAA,QAChE,WAAWA,YAAS,aAAa;AAC/B,iBAAO,qDAAqDA,UAAO;AAAA,QACrE;AACA,eAAO,+BAA+BA,UAAO;AAAA,MAC/C;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,SAAS;AACP,eAAO;AAAA,UACL,QAAQ;AAAA,UACR,MAAM,KAAK;AAAA,QACb;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MASA,OAAO,SAAS,MAAM;AACpB,eAAO,IAAIK,YAAW,KAAK,IAAI;AAAA,MACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,OAAO,SAAS;AACd,YAAIC,UAAS;AACb,YAAI,OAAOJ,MAAK,KAAK,IAAI,MAAM,eAAe,gBAAgB,KAAK,IAAI,GAAG;AACxE,UAAAI,UAAS;AAAA,QACX;AACA,YAAI,SAAS,SAAS,KAAK,MAAMA,OAAM;AACvC,YAAI,OAAO,CAAC,MAAM,MAAM;AAEtB,iBAAO;AAAA,QACT;AAGA,eAAO,MAAM;AAAA,MACf;AAAA,IACF;AACA,WAAOD;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,IACT,QAAQ;AAAA,EACV,CAAC;;;ACxLD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,QAAQ,QAAQ,YAAY;AACzC,MAAI,qBAAoC,wBAAQD,SAAMC,iBAAc,UAAQ;AACjF,QAAI;AACJ,QAAI;AAAA,MACF,MAAAC;AAAA,MACA,MAAAC;AAAA,MACA,YAAAC;AAAA,IACF,IAAI;AAEJ,QAAI,QAAQ,YAAUC,QAAO,QAAQ;AAAA,MACnC,UAAU;AAAA,IACZ,CAAC;AAUD,aAAS,eAAe,UAAU,MAAM,SAAS;AAC/C,UAAI,QAAQ;AAIZ,UAAI,QAAQ;AACZ,UAAI,WAAW;AACf,UAAI;AACJ,cAAQ,QAAQ,MAAM,KAAK,QAAQ,OAAO,MAAM;AAG9C,iBAAS,SAAS,UAAU,UAAU,MAAM,KAAK;AACjD,mBAAW,MAAM;AACjB,YAAI,MAAM,CAAC,MAAM,MAAM;AAErB,mBAAS;AACT;AAAA,QACF,OAAO;AAEL,sBAAY,MAAM,CAAC,EAAE;AACrB,cAAI,WAAW,KAAK,MAAM,CAAC,CAAC;AAC5B,cAAI,CAAC,UAAU;AACb,kBAAM,IAAI,eAAe,wBAAwB,MAAM,CAAC,IAAI,kBAAkB;AAAA,UAChF;AACA,cAAI,MAAM,CAAC,MAAM,QAAW;AAE1B,oBAAQ,OAAO,UAAU;AAAA,cACvB,KAAK;AACH,yBAAS;AACT;AAAA,cACF,KAAK;AACH,oBAAI,OAAO,QAAQ,GAAG;AACpB,2BAAS,SAAS,MAAM,OAAO;AAAA,gBACjC,WAAW,MAAM,QAAQ,QAAQ,GAAG;AAElC,2BAAS,SAAS,IAAI,SAAUC,MAAKC,QAAO;AAC1C,wBAAI,OAAOD,IAAG,GAAG;AACf,6BAAOA,KAAI,MAAM,OAAO;AAAA,oBAC1B;AACA,0BAAM,IAAI,UAAU,eAAe,MAAM,CAAC,IAAI,MAAMC,SAAQ,kBAAkB;AAAA,kBAChF,CAAC,EAAE,KAAK,GAAG;AAAA,gBACb,OAAO;AACL,wBAAM,IAAI,UAAU,eAAe,MAAM,CAAC,IAAI,6CAA6C;AAAA,gBAC7F;AACA;AAAA,cACF;AACE,sBAAM,IAAI,UAAU,eAAe,MAAM,CAAC,IAAI,6CAA6C;AAAA,YAC/F;AAAA,UACF,OAAO;AAEL,gBAAI,OAAO,SAAS,MAAM,CAAC,CAAC,KAAK,SAAS,MAAM,CAAC,CAAC,CAAC,GAAG;AACpD,uBAAS,SAAS,MAAM,CAAC,CAAC,EAAE,MAAM,OAAO;AAAA,YAC3C,OAAO;AACL,oBAAM,IAAI,UAAU,eAAe,MAAM,CAAC,IAAI,MAAM,MAAM,CAAC,IAAI,kBAAkB;AAAA,YACnF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,eAAS,SAAS,MAAM,QAAQ;AAEhC,aAAO;AAAA,IACT;AAAA,IACA,MAAMC,sBAAqBL,MAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAU9B,YAAY,IAAI,MAAM,UAAU;AAC9B,cAAM;AACN,YAAI,OAAO,OAAO,UAAU;AAC1B,eAAK,IAAIC,YAAW,EAAE;AAAA,QACxB;AAGA,YAAI,CAAC,OAAO,EAAE,EAAG,OAAM,IAAI,UAAU,iCAAiC;AACtE,YAAI,CAAC,MAAM,QAAQ,IAAI,KAAK,CAAC,KAAK,MAAM,MAAM,GAAG;AAC/C,gBAAM,IAAI,UAAU,sDAAsD;AAAA,QAC5E;AACA,YAAI,eAAe,OAAO;AAC1B,YAAI,EAAE,iBAAiB,eAAe,iBAAiB,YAAY;AACjE,gBAAM,IAAI,UAAU,8CAA8C;AAAA,QACpE;AACA,aAAK,KAAK;AACV,aAAK,OAAO,QAAQ,CAAC;AACrB,aAAK,WAAW,CAAC,CAAC;AAAA,MACpB;AAAA;AAAA,MAGA,IAAI,OAAO;AACT,eAAO,KAAK,GAAG,QAAQ;AAAA,MACzB;AAAA,MACA,IAAI,OAAO;AACT,eAAOJ;AAAA,MACT;AAAA,MACA,IAAI,iBAAiB;AACnB,eAAO;AAAA,MACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAeA,SAASE,OAAM,UAAU;AAEvB,YAAI,WAAW,KAAK,KAAK,IAAI,CAAAI,SAAOA,KAAI,SAASJ,OAAM,QAAQ,CAAC;AAChE,YAAI,uBAAuB,KAAK,YAAY,eAAe,KAAK,EAAE,KAAK,KAAK,GAAG;AAC/E,YAAI,aAAa,KAAK,EAAE,GAAG;AACzB,cAAI,QAAQ,KAAK,GAAG;AACpB,cAAI,CAAC,SAAS,KAAK,GAAG;AAGpB,gBAAI,KAAK,SAASA,QAAO,gBAAgBA,OAAM,KAAK,IAAI;AACxD,gBAAI,QAAQ,OAAO,OAAO,cAAc,GAAG,YAAY;AACvD,gBAAI,YAAY,WAAS;AACvB,kBAAI;AACJ,kBAAI,MAAM,IAAI,KAAK,GAAG;AACpB,wBAAQ,MAAM,IAAI,KAAK;AAAA,cACzB,WAAW,SAASA,OAAM;AACxB,wBAAQ,gBAAgBA,OAAM,KAAK;AAAA,cACrC,WAAW,qBAAsB,SAAQ;AAAA,kBAAe,QAAOM,cAAa,oBAAoB,KAAK;AACrG,kBAAI,OAAO,UAAU,cAAc,wBAAwB,UAAU,QAAW;AAC9E,uBAAO;AAAA,cACT;AACA,oBAAM,IAAI,UAAU,IAAI,OAAO,OAAO,wCAAwC,EAAE,OAAO,MAAM,KAAK,CAAC,CAAC;AAAA,YACtG;AACA,gBAAI,OAAO;AAGT,kBAAI,UAAU,KAAK;AACnB,qBAAO,SAAS,iBAAiB,OAAO,MAAM,SAAS;AACrD,oBAAIC,MAAK,UAAU,KAAK;AAGxB,oBAAIA,IAAG,YAAY,MAAM;AACvB,yBAAOA,IAAG,SAASP,OAAM,eAAe,OAAO,IAAI,CAAC;AAAA,gBACtD,OAAO;AAEL,sBAAI,SAAS,SAAS,IAAI,aAAW,QAAQ,OAAO,MAAM,OAAO,CAAC;AAClE,yBAAOO,IAAG,GAAG,MAAM;AAAA,gBACrB;AAAA,cACF;AAAA,YACF,OAAO;AAEL,sBAAQ,SAAS,QAAQ;AAAA,gBACvB,KAAK;AACH,yBAAO,SAAS,iBAAiB,OAAO,MAAM,SAAS;AACrD,wBAAIA,MAAK,UAAU,KAAK;AACxB,wBAAI,wBAAwBA,QAAO,OAAW,QAAO;AACrD,2BAAOA,IAAG;AAAA,kBACZ;AAAA,gBACF,KAAK;AACH,yBAAO,SAAS,iBAAiB,OAAO,MAAM,SAAS;AACrD,wBAAIA,MAAK,UAAU,KAAK;AACxB,wBAAI,wBAAwBA,QAAO,OAAW,QAAO;AACrD,wBAAI,WAAW,SAAS,CAAC;AACzB,2BAAOA,IAAG,SAAS,OAAO,MAAM,OAAO,CAAC;AAAA,kBAC1C;AAAA,gBACF,KAAK;AACH,yBAAO,SAAS,iBAAiB,OAAO,MAAM,SAAS;AACrD,wBAAIA,MAAK,UAAU,KAAK;AACxB,wBAAI,wBAAwBA,QAAO,OAAW,QAAO;AACrD,wBAAI,WAAW,SAAS,CAAC;AACzB,wBAAI,WAAW,SAAS,CAAC;AACzB,2BAAOA,IAAG,SAAS,OAAO,MAAM,OAAO,GAAG,SAAS,OAAO,MAAM,OAAO,CAAC;AAAA,kBAC1E;AAAA,gBACF;AACE,yBAAO,SAAS,iBAAiB,OAAO,MAAM,SAAS;AACrD,wBAAIA,MAAK,UAAU,KAAK;AACxB,wBAAI,wBAAwBA,QAAO,OAAW,QAAO;AACrD,wBAAI,SAAS,SAAS,IAAI,aAAW,QAAQ,OAAO,MAAM,OAAO,CAAC;AAClE,2BAAOA,IAAG,GAAG,MAAM;AAAA,kBACrB;AAAA,cACJ;AAAA,YACF;AAAA,UACF,OAAO;AAEL,gBAAI,WAAW,KAAK;AACpB,mBAAO,SAAS,iBAAiB,OAAO,MAAM,SAAS;AACrD,kBAAIA,MAAK,gBAAgB,MAAM,KAAK;AACpC,kBAAI,wBAAwBA,QAAO,OAAW,QAAO;AACrD,kBAAI,OAAOA,QAAO,YAAY;AAC5B,sBAAM,IAAI,UAAU,aAAa,OAAO,OAAO,kCAAkC,EAAE,OAAO,MAAMA,GAAE,CAAC,CAAC;AAAA,cACtG;AACA,kBAAIA,IAAG,SAAS;AAEd,uBAAOA,IAAG,UAAUP,OAAM,eAAe,OAAO,IAAI,CAAC;AAAA,cACvD,OAAO;AACL,oBAAI,SAAS,SAAS,IAAI,aAAW,QAAQ,OAAO,MAAM,OAAO,CAAC;AAClE,uBAAOO,IAAG,MAAMA,KAAI,MAAM;AAAA,cAC5B;AAAA,YACF;AAAA,UACF;AAAA,QACF,WAAW,eAAe,KAAK,EAAE,KAAK,YAAY,KAAK,GAAG,KAAK,KAAK,KAAK,GAAG,MAAM,iBAAiB,GAAG;AAIpG,cAAI,aAAa,KAAK,GAAG,OAAO,SAASP,OAAM,QAAQ;AACvD,cAAI,OAAO,KAAK,GAAG,MAAM,kBAAkB;AAC3C,cAAI,YAAY,KAAK;AACrB,iBAAO,SAAS,iBAAiB,OAAO,MAAM,SAAS;AACrD,gBAAI,SAAS,WAAW,OAAO,MAAM,OAAO;AAG5C,gBAAI,yBAAyB,UAAU,QAAQ,OAAO,IAAI,MAAM,SAAY;AAC1E,qBAAO;AAAA,YACT;AACA,gBAAIO,MAAK,cAAc,QAAQ,IAAI;AACnC,gBAAIA,QAAO,QAAQA,QAAO,UAAUA,IAAG,SAAS;AAE9C,qBAAOA,IAAG,WAAWP,OAAM,eAAe,OAAO,IAAI,CAAC;AAAA,YACxD,OAAO;AAEL,kBAAI,SAAS,SAAS,IAAI,aAAW,QAAQ,OAAO,MAAM,OAAO,CAAC;AAClE,qBAAOO,IAAG,MAAM,QAAQ,MAAM;AAAA,YAChC;AAAA,UACF;AAAA,QACF,OAAO;AAIL,cAAI,SAAS,KAAK,GAAG,SAAS;AAC9B,cAAI,SAAS,KAAK,GAAG,SAASP,OAAM,QAAQ;AAC5C,cAAI,YAAY,KAAK;AACrB,iBAAO,SAAS,iBAAiB,OAAO,MAAM,SAAS;AACrD,gBAAIO,MAAK,OAAO,OAAO,MAAM,OAAO;AACpC,gBAAI,wBAAwBA,QAAO,OAAW,QAAO;AACrD,gBAAI,OAAOA,QAAO,YAAY;AAC5B,oBAAM,IAAI,UAAU,eAAe,OAAO,QAAQ,6CAA6C,IAAI,OAAO,OAAO,MAAMA,GAAE,CAAC,CAAC;AAAA,YAC7H;AACA,gBAAIA,IAAG,SAAS;AAEd,qBAAOA,IAAG,WAAWP,OAAM,eAAe,OAAO,IAAI,CAAC;AAAA,YACxD,OAAO;AAEL,kBAAI,SAAS,SAAS,IAAI,aAAW,QAAQ,OAAO,MAAM,OAAO,CAAC;AAClE,qBAAOO,IAAG,MAAMA,KAAI,MAAM;AAAA,YAC5B;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ,UAAU;AAChB,iBAAS,KAAK,IAAI,MAAM,IAAI;AAC5B,iBAASC,KAAI,GAAGA,KAAI,KAAK,KAAK,QAAQA,MAAK;AACzC,mBAAS,KAAK,KAAKA,EAAC,GAAG,UAAUA,KAAI,KAAK,IAAI;AAAA,QAChD;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQA,IAAI,UAAU;AACZ,YAAI,KAAK,KAAK,QAAQ,SAAS,KAAK,IAAI,MAAM,IAAI,CAAC;AACnD,YAAI,OAAO,CAAC;AACZ,iBAASA,KAAI,GAAGA,KAAI,KAAK,KAAK,QAAQA,MAAK;AACzC,eAAKA,EAAC,IAAI,KAAK,QAAQ,SAAS,KAAK,KAAKA,EAAC,GAAG,UAAUA,KAAI,KAAK,IAAI,CAAC;AAAA,QACxE;AACA,eAAO,IAAIF,cAAa,IAAI,IAAI;AAAA,MAClC;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,QAAQ;AACN,eAAO,IAAIA,cAAa,KAAK,IAAI,KAAK,KAAK,MAAM,CAAC,CAAC;AAAA,MACrD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAmBA,SAAS,SAAS;AAChB,YAAI;AACJ,YAAIR,UAAO,KAAK,GAAG,SAAS,OAAO;AACnC,YAAI,WAAW,OAAO,QAAQ,YAAY,YAAY,eAAe,QAAQ,SAASA,OAAI,GAAG;AAE3F,yBAAe,QAAQ,QAAQA,OAAI,EAAE,MAAM,OAAO;AAAA,QACpD;AACA,YAAI,OAAO,iBAAiB,aAAa;AACvC,iBAAO;AAAA,QACT;AAGA,eAAO,MAAM,SAAS,OAAO;AAAA,MAC/B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,UAAU,SAAS;AACjB,YAAI,OAAO,KAAK,KAAK,IAAI,SAAUM,MAAK;AACtC,iBAAOA,KAAI,SAAS,OAAO;AAAA,QAC7B,CAAC;AACD,YAAI,KAAK,yBAAyB,KAAK,EAAE,IAAI,MAAM,KAAK,GAAG,SAAS,OAAO,IAAI,MAAM,KAAK,GAAG,SAAS,OAAO;AAG7G,eAAO,KAAK,MAAM,KAAK,KAAK,IAAI,IAAI;AAAA,MACtC;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,SAAS;AACP,eAAO;AAAA,UACL,QAAQN;AAAA,UACR,IAAI,KAAK;AAAA,UACT,MAAM,KAAK;AAAA,QACb;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAeA,QAAQ,SAAS;AACf,YAAI,OAAO,KAAK,KAAK,IAAI,SAAUM,MAAK;AACtC,iBAAOA,KAAI,OAAO,OAAO;AAAA,QAC3B,CAAC;AAGD,eAAO,iCAAiC,OAAO,KAAK,EAAE,IAAI,0EAA0E,KAAK,KAAK,uCAAuC,IAAI;AAAA,MAC3L;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAaA,MAAM,SAAS;AACb,YAAI;AACJ,YAAI,WAAW,OAAO,QAAQ,YAAY,YAAY,eAAe,QAAQ,SAAS,KAAK,IAAI,GAAG;AAEhG,sBAAY,QAAQ,QAAQ,KAAK,IAAI,EAAE,MAAM,OAAO;AAAA,QACtD;AACA,YAAI,OAAO,cAAc,aAAa;AACpC,iBAAO;AAAA,QACT;AAGA,eAAO,MAAM,MAAM,OAAO;AAAA,MAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOA,OAAO,SAAS;AACd,YAAI,OAAO,KAAK,KAAK,IAAI,SAAUA,MAAK;AAEtC,iBAAOA,KAAI,MAAM,OAAO;AAAA,QAC1B,CAAC;AACD,YAAI;AACJ,YAAI,eAAe,KAAK,IAAI,GAAG;AAC7B,2BAAiB,eAAe,KAAK,IAAI;AAAA,QAC3C;AAGA,YAAIJ,MAAK,KAAK,IAAI,MAAM,OAAOA,MAAK,KAAK,IAAI,EAAE,UAAU,cAAc,OAAOA,MAAK,KAAK,IAAI,EAAE,UAAU,YAAY,OAAOA,MAAK,KAAK,IAAI,EAAE,UAAU,WAAW;AAE9J,2BAAiBA,MAAK,KAAK,IAAI,EAAE;AAAA,QACnC;AACA,YAAI;AACJ,gBAAQ,OAAO,gBAAgB;AAAA,UAC7B,KAAK;AAEH,0BAAc,eAAe,MAAM,OAAO;AAC1C;AAAA,UACF,KAAK;AAEH,0BAAc,eAAe,gBAAgB,MAAM,OAAO;AAC1D;AAAA,UACF,KAAK;AAGH,oBAAQ,OAAO,eAAe,KAAK,MAAM,GAAG;AAAA,cAC1C,KAAK;AACH,8BAAc,eAAe,KAAK,MAAM,EAAE,MAAM,OAAO;AACvD;AAAA,cACF,KAAK;AACH,8BAAc,eAAe,eAAe,KAAK,MAAM,GAAG,MAAM,OAAO;AACvE;AAAA,YACJ;AAAA,QACJ;AACA,YAAI,OAAO,gBAAgB,aAAa;AACtC,iBAAO;AAAA,QACT;AACA,eAAO,eAAe,iBAAiB,MAAM,OAAO;AAAA,MACtD;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA,gBAAgB;AACd,eAAO,KAAK,OAAO,MAAM,KAAK;AAAA,MAChC;AAAA,IACF;AACA,oBAAgBM;AAChB,IAAAG,iBAAgBH,eAAc,QAAQR,OAAI;AAC1C,IAAAW,iBAAgBH,eAAc,uBAAuB,SAAUR,SAAM;AACnE,YAAM,IAAI,MAAM,wBAAwBA,OAAI;AAAA,IAC9C,CAAC;AACD,IAAAW,iBAAgBH,eAAc,YAAY,SAAU,MAAM;AACxD,aAAO,IAAI,cAAc,KAAK,IAAI,KAAK,IAAI;AAAA,IAC7C,CAAC;AACD,WAAOA;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,IACT,QAAQ;AAAA,EACV,CAAC;;;ACveD,MAAII,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,WAAW,UAAU,gBAAgB,aAAa,kBAAkB,aAAa,mBAAmB,gBAAgB,0BAA0B,gBAAgB,aAAa,cAAc,gBAAgB,mBAAmB,aAAa,kBAAkB,YAAY;AAC7R,MAAI,cAA6B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,SAAAC;AAAA,MACA,QAAAC;AAAA,MACA,cAAAC;AAAA,MACA,WAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,WAAAC;AAAA,MACA,iBAAAC;AAAA,MACA,cAAAC;AAAA,MACA,wBAAAC;AAAA,MACA,cAAAC;AAAA,MACA,WAAAC;AAAA,MACA,YAAAC;AAAA,MACA,cAAAC;AAAA,MACA,iBAAAC;AAAA,MACA,WAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,YAAAC;AAAA,IACF,IAAI;AA0DJ,QAAIC,SAAQlB,OAAMF,SAAM;AAAA,MACtB,QAAQ,SAASqB,QAAO,YAAY;AAClC,eAAO,WAAW,YAAY,CAAC,CAAC;AAAA,MAClC;AAAA,MACA,kBAAkB,SAAS,cAAc,aAAa;AACpD,eAAO,cAAc,aAAa,CAAC,CAAC;AAAA,MACtC;AAAA,MACA,kBAAkB,SAAS,cAAc,YAAY,SAAS;AAC5D,YAAI,aAAa,QAAQ,UAAU,SAAY,QAAQ,QAAQ,CAAC;AAChE,eAAO,WAAW,YAAY,UAAU;AAAA,MAC1C;AAAA,MACA,0BAA0B;AAAA,IAC5B,CAAC;AACD,aAAS,cAAc,aAAa;AAClC,UAAI,UAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAC;AACnF,UAAI,aAAa,QAAQ,UAAU,SAAY,QAAQ,QAAQ,CAAC;AAGhE,aAAOC,SAAQ,aAAa,SAAU,MAAM;AAC1C,YAAI,OAAO,SAAS,SAAU,OAAM,IAAI,UAAU,iBAAiB;AACnE,eAAO,WAAW,MAAM,UAAU;AAAA,MACpC,CAAC;AAAA,IACH;AAGA,QAAI,YAAY;AAAA,MACd,MAAM;AAAA,MACN,WAAW;AAAA,MACX,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,SAAS;AAAA,IACX;AAGA,QAAI,aAAa;AAAA,MACf,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAM;AAAA,MACN,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,MAAM;AAAA,MACN,KAAK;AAAA,MACL,MAAM;AAAA,MACN,KAAK;AAAA,MACL,KAAK;AAAA,MACL,MAAM;AAAA,MACN,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,MAAM;AAAA,MACN,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM;AAAA,MACN,KAAK;AAAA,MACL,KAAK;AAAA,MACL,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM;AAAA,MACN,OAAO;AAAA,IACT;AAGA,QAAI,mBAAmB;AAAA,MACrB,KAAK;AAAA,MACL,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,KAAK;AAAA,MACL,KAAK;AAAA,MACL,IAAI;AAAA,MACJ,KAAK;AAAA,IACP;AACA,QAAI,YAAY;AAAA,MACd,MAAM;AAAA,MACN,OAAO;AAAA,MACP,MAAM;AAAA,MACN;AAAA,IACF;AACA,QAAI,oBAAoB,CAAC,OAAO,UAAU;AAC1C,QAAI,oBAAoB;AAAA,MACtB,KAAK;AAAA,MACL,KAAK;AAAA,MACL,MAAM;AAAA,MACN,KAAK;AAAA,MACL,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAG;AAAA;AAAA,IAEL;AACA,aAAS,eAAe;AACtB,aAAO;AAAA,QACL,YAAY,CAAC;AAAA;AAAA,QAEb,YAAY;AAAA;AAAA,QAEZ,SAAS;AAAA;AAAA,QAET,OAAO;AAAA;AAAA,QAEP,OAAO;AAAA;AAAA,QAEP,WAAW,UAAU;AAAA;AAAA,QAErB,cAAc;AAAA;AAAA,QAEd,kBAAkB;AAAA;AAAA,MACpB;AAAA,IACF;AAUA,aAAS,cAAc,OAAO,QAAQ;AACpC,aAAO,MAAM,WAAW,OAAO,MAAM,OAAO,MAAM;AAAA,IACpD;AASA,aAAS,iBAAiB,OAAO;AAC/B,aAAO,cAAc,OAAO,CAAC;AAAA,IAC/B;AAQA,aAAS,KAAK,OAAO;AACnB,YAAM;AAAA,IACR;AAOA,aAAS,cAAc,OAAO;AAC5B,aAAO,MAAM,WAAW,OAAO,MAAM,QAAQ,CAAC;AAAA,IAChD;AAOA,aAAS,cAAc,OAAO;AAC5B,aAAO,MAAM,WAAW,OAAO,MAAM,QAAQ,CAAC;AAAA,IAChD;AAOA,aAAS,SAAS,OAAO;AACvB,YAAM,YAAY,UAAU;AAC5B,YAAM,QAAQ;AACd,YAAM,UAAU;AAGhB,aAAO,MAAM;AAEX,YAAI,iBAAiB,KAAK,MAAM,KAAK;AACnC,iBAAO,iBAAiB,KAAK,MAAM,QAAQ,iBAAiB,KAAK,MAAM,IAAI;AACzE,kBAAM,WAAW,iBAAiB,KAAK;AACvC,iBAAK,KAAK;AAAA,UACZ;AAAA,QACF;AAEA,YAAIF,OAAM,aAAa,iBAAiB,KAAK,GAAG,MAAM,YAAY,GAAG;AACnE,eAAK,KAAK;AAAA,QACZ,OAAO;AACL;AAAA,QACF;AAAA,MACF;AAGA,UAAI,iBAAiB,KAAK,MAAM,IAAI;AAElC,cAAM,YAAY,UAAU;AAC5B;AAAA,MACF;AAGA,UAAI,iBAAiB,KAAK,MAAM,QAAQ,CAAC,MAAM,cAAc;AAC3D,cAAM,YAAY,UAAU;AAC5B,cAAM,QAAQ,iBAAiB,KAAK;AACpC,aAAK,KAAK;AACV;AAAA,MACF;AACA,UAAI,KAAK,iBAAiB,KAAK;AAC/B,UAAI,KAAK,cAAc,OAAO,CAAC;AAC/B,UAAI,KAAK,cAAc,OAAO,CAAC;AAC/B,UAAI,GAAG,WAAW,KAAK,WAAW,EAAE,GAAG;AACrC,cAAM,YAAY,UAAU;AAC5B,cAAM,QAAQ;AACd,aAAK,KAAK;AACV,aAAK,KAAK;AACV,aAAK,KAAK;AACV;AAAA,MACF;AAKA,UAAI,GAAG,WAAW,KAAK,WAAW,EAAE,MAAM,OAAO,QAAQ,CAACA,OAAM,QAAQ,MAAM,WAAW,OAAO,MAAM,QAAQ,CAAC,CAAC,IAAI;AAClH,cAAM,YAAY,UAAU;AAC5B,cAAM,QAAQ;AACd,aAAK,KAAK;AACV,aAAK,KAAK;AACV;AAAA,MACF;AAGA,UAAI,WAAW,EAAE,GAAG;AAClB,cAAM,YAAY,UAAU;AAC5B,cAAM,QAAQ;AACd,aAAK,KAAK;AACV;AAAA,MACF;AAGA,UAAIA,OAAM,WAAW,EAAE,GAAG;AACxB,cAAM,YAAY,UAAU;AAG5B,YAAI,KAAK,cAAc,OAAO,CAAC;AAC/B,YAAI,OAAO,QAAQ,OAAO,QAAQ,OAAO,MAAM;AAC7C,gBAAM,SAAS,iBAAiB,KAAK;AACrC,eAAK,KAAK;AACV,gBAAM,SAAS,iBAAiB,KAAK;AACrC,eAAK,KAAK;AACV,iBAAOA,OAAM,QAAQ,iBAAiB,KAAK,GAAG,cAAc,KAAK,GAAG,cAAc,KAAK,CAAC,KAAKA,OAAM,QAAQ,iBAAiB,KAAK,CAAC,GAAG;AACnI,kBAAM,SAAS,iBAAiB,KAAK;AACrC,iBAAK,KAAK;AAAA,UACZ;AACA,cAAI,iBAAiB,KAAK,MAAM,KAAK;AAEnC,kBAAM,SAAS;AACf,iBAAK,KAAK;AAEV,mBAAOA,OAAM,QAAQ,iBAAiB,KAAK,GAAG,cAAc,KAAK,GAAG,cAAc,KAAK,CAAC,KAAKA,OAAM,QAAQ,iBAAiB,KAAK,CAAC,GAAG;AACnI,oBAAM,SAAS,iBAAiB,KAAK;AACrC,mBAAK,KAAK;AAAA,YACZ;AAAA,UACF,WAAW,iBAAiB,KAAK,MAAM,KAAK;AAE1C,kBAAM,SAAS;AACf,iBAAK,KAAK;AAEV,mBAAOA,OAAM,QAAQ,iBAAiB,KAAK,CAAC,GAAG;AAC7C,oBAAM,SAAS,iBAAiB,KAAK;AACrC,mBAAK,KAAK;AAAA,YACZ;AAAA,UACF;AACA;AAAA,QACF;AAGA,YAAI,iBAAiB,KAAK,MAAM,KAAK;AACnC,gBAAM,SAAS,iBAAiB,KAAK;AACrC,eAAK,KAAK;AACV,cAAI,CAACA,OAAM,QAAQ,iBAAiB,KAAK,CAAC,GAAG;AAE3C,kBAAM,YAAY,UAAU;AAC5B;AAAA,UACF;AAAA,QACF,OAAO;AACL,iBAAOA,OAAM,QAAQ,iBAAiB,KAAK,CAAC,GAAG;AAC7C,kBAAM,SAAS,iBAAiB,KAAK;AACrC,iBAAK,KAAK;AAAA,UACZ;AACA,cAAIA,OAAM,cAAc,iBAAiB,KAAK,GAAG,cAAc,KAAK,CAAC,GAAG;AACtE,kBAAM,SAAS,iBAAiB,KAAK;AACrC,iBAAK,KAAK;AAAA,UACZ;AAAA,QACF;AACA,eAAOA,OAAM,QAAQ,iBAAiB,KAAK,CAAC,GAAG;AAC7C,gBAAM,SAAS,iBAAiB,KAAK;AACrC,eAAK,KAAK;AAAA,QACZ;AAEA,YAAI,iBAAiB,KAAK,MAAM,OAAO,iBAAiB,KAAK,MAAM,KAAK;AACtE,cAAIA,OAAM,QAAQ,cAAc,KAAK,CAAC,KAAK,cAAc,KAAK,MAAM,OAAO,cAAc,KAAK,MAAM,KAAK;AACvG,kBAAM,SAAS,iBAAiB,KAAK;AACrC,iBAAK,KAAK;AACV,gBAAI,iBAAiB,KAAK,MAAM,OAAO,iBAAiB,KAAK,MAAM,KAAK;AACtE,oBAAM,SAAS,iBAAiB,KAAK;AACrC,mBAAK,KAAK;AAAA,YACZ;AAEA,gBAAI,CAACA,OAAM,QAAQ,iBAAiB,KAAK,CAAC,GAAG;AAC3C,oBAAM,kBAAkB,OAAO,0BAA0B,iBAAiB,KAAK,IAAI,GAAG;AAAA,YACxF;AACA,mBAAOA,OAAM,QAAQ,iBAAiB,KAAK,CAAC,GAAG;AAC7C,oBAAM,SAAS,iBAAiB,KAAK;AACrC,mBAAK,KAAK;AAAA,YACZ;AACA,gBAAIA,OAAM,cAAc,iBAAiB,KAAK,GAAG,cAAc,KAAK,CAAC,GAAG;AACtE,oBAAM,kBAAkB,OAAO,0BAA0B,iBAAiB,KAAK,IAAI,GAAG;AAAA,YACxF;AAAA,UACF,WAAWA,OAAM,cAAc,cAAc,KAAK,GAAG,MAAM,WAAW,OAAO,MAAM,QAAQ,CAAC,CAAC,GAAG;AAC9F,iBAAK,KAAK;AACV,kBAAM,kBAAkB,OAAO,0BAA0B,iBAAiB,KAAK,IAAI,GAAG;AAAA,UACxF;AAAA,QACF;AACA;AAAA,MACF;AAGA,UAAIA,OAAM,QAAQ,iBAAiB,KAAK,GAAG,cAAc,KAAK,GAAG,cAAc,KAAK,CAAC,GAAG;AACtF,eAAOA,OAAM,QAAQ,iBAAiB,KAAK,GAAG,cAAc,KAAK,GAAG,cAAc,KAAK,CAAC,KAAKA,OAAM,QAAQ,iBAAiB,KAAK,CAAC,GAAG;AACnI,gBAAM,SAAS,iBAAiB,KAAK;AACrC,eAAK,KAAK;AAAA,QACZ;AACA,YAAI,eAAe,kBAAkB,MAAM,KAAK,GAAG;AACjD,gBAAM,YAAY,UAAU;AAAA,QAC9B,OAAO;AACL,gBAAM,YAAY,UAAU;AAAA,QAC9B;AACA;AAAA,MACF;AAGA,YAAM,YAAY,UAAU;AAC5B,aAAO,iBAAiB,KAAK,MAAM,IAAI;AACrC,cAAM,SAAS,iBAAiB,KAAK;AACrC,aAAK,KAAK;AAAA,MACZ;AACA,YAAM,kBAAkB,OAAO,2BAA2B,MAAM,QAAQ,GAAG;AAAA,IAC7E;AAKA,aAAS,oBAAoB,OAAO;AAClC,SAAG;AACD,iBAAS,KAAK;AAAA,MAChB,SAAS,MAAM,UAAU;AAAA,IAC3B;AAMA,aAAS,WAAW,OAAO;AACzB,YAAM;AAAA,IACR;AAMA,aAAS,YAAY,OAAO;AAC1B,YAAM;AAAA,IACR;AAoBA,IAAAA,OAAM,UAAU,SAAS,QAAQ,GAAG,OAAO,OAAO;AAChD,aAAOA,OAAM,oBAAoB,CAAC,KAAKA,OAAM,kBAAkB,GAAG,KAAK,KAAKA,OAAM,kBAAkB,OAAO,CAAC;AAAA,IAC9G;AAOA,IAAAA,OAAM,sBAAsB,SAAS,oBAAoB,GAAG;AAC1D,aAAO,sDAAsD,KAAK,CAAC;AAAA,IACrE;AAiBA,IAAAA,OAAM,oBAAoB,SAAS,kBAAkB,MAAM,KAAK;AAC9D,aAAO,aAAa,KAAK,IAAI,KAAK,oBAAoB,KAAK,GAAG,KAAK,2KAA2K,KAAK,GAAG;AAAA,IACxP;AAQA,IAAAA,OAAM,eAAe,SAAS,aAAa,GAAG,cAAc;AAE1D,aAAO,MAAM,OAAO,MAAM,OAAQ,MAAM,UAAY,MAAM,QAAQ,eAAe;AAAA,IACnF;AASA,IAAAA,OAAM,gBAAgB,SAAS,cAAc,GAAG,OAAO;AACrD,aAAO,MAAM,OAAO,UAAU,OAAO,UAAU,OAAO,UAAU;AAAA,IAClE;AAOA,IAAAA,OAAM,aAAa,SAAS,WAAW,GAAG;AACxC,aAAO,KAAK,OAAO,KAAK,OAAO,MAAM;AAAA,IACvC;AAOA,IAAAA,OAAM,UAAU,SAAS,QAAQ,GAAG;AAClC,aAAO,KAAK,OAAO,KAAK;AAAA,IAC1B;AAOA,aAAS,WAAW,YAAY,YAAY;AAC1C,UAAI,QAAQ,aAAa;AACzB,MAAAG,UAAS,OAAO;AAAA,QACd;AAAA,QACA;AAAA,MACF,CAAC;AACD,eAAS,KAAK;AACd,UAAI,OAAO,WAAW,KAAK;AAI3B,UAAI,MAAM,UAAU,IAAI;AACtB,YAAI,MAAM,cAAc,UAAU,WAAW;AAI3C,gBAAM,YAAY,OAAO,yBAAyB,MAAM,KAAK;AAAA,QAC/D,OAAO;AACL,gBAAM,kBAAkB,OAAO,sBAAsB,MAAM,QAAQ,GAAG;AAAA,QACxE;AAAA,MACF;AACA,aAAO;AAAA,IACT;AASA,aAAS,WAAW,OAAO;AACzB,UAAI;AACJ,UAAI,SAAS,CAAC;AACd,UAAI;AACJ,UAAI,MAAM,UAAU,MAAM,MAAM,UAAU,QAAQ,MAAM,UAAU,KAAK;AACrE,eAAO,gBAAgB,KAAK;AAC5B,YAAI,MAAM,SAAS;AACjB,eAAK,UAAU,MAAM;AAAA,QACvB;AAAA,MACF;AAGA,aAAO,MAAM,UAAU,QAAQ,MAAM,UAAU,KAAK;AAElD,YAAI,OAAO,WAAW,KAAK,MAAM;AAC/B,oBAAU,MAAM,UAAU;AAC1B,iBAAO,KAAK;AAAA,YACV;AAAA,YACA;AAAA,UACF,CAAC;AAAA,QACH;AACA,iBAAS,KAAK;AACd,YAAI,MAAM,UAAU,QAAQ,MAAM,UAAU,OAAO,MAAM,UAAU,IAAI;AACrE,iBAAO,gBAAgB,KAAK;AAC5B,cAAI,MAAM,SAAS;AACjB,iBAAK,UAAU,MAAM;AAAA,UACvB;AACA,oBAAU,MAAM,UAAU;AAC1B,iBAAO,KAAK;AAAA,YACV;AAAA,YACA;AAAA,UACF,CAAC;AAAA,QACH;AAAA,MACF;AACA,UAAI,OAAO,SAAS,GAAG;AACrB,eAAO,IAAIf,WAAU,MAAM;AAAA,MAC7B,OAAO;AACL,YAAI,CAAC,MAAM;AACT,iBAAO,IAAIE,cAAa,MAAS;AACjC,cAAI,MAAM,SAAS;AACjB,iBAAK,UAAU,MAAM;AAAA,UACvB;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAUA,aAAS,gBAAgB,OAAO;AAC9B,UAAIV,SAAM,MAAM,OAAO;AACvB,UAAI,OAAO,iBAAiB,KAAK;AACjC,UAAI,MAAM,UAAU,KAAK;AACvB,YAAI,aAAa,IAAI,GAAG;AAEtB,UAAAA,UAAO,KAAK;AACZ,8BAAoB,KAAK;AACzB,kBAAQ,gBAAgB,KAAK;AAC7B,iBAAO,IAAIO,gBAAe,IAAIY,YAAWnB,OAAI,GAAG,KAAK;AAAA,QACvD,WAAW,eAAe,IAAI,GAAG;AAE/B,cAAI,KAAK,kBAAkB;AACzB,kBAAM,kBAAkB,OAAO,iCAAiC;AAAA,UAClE;AACA,8BAAoB,KAAK;AACzB,kBAAQ,gBAAgB,KAAK;AAC7B,iBAAO,IAAIO,gBAAe,KAAK,QAAQ,KAAK,OAAO,KAAK;AAAA,QAC1D,WAAW,eAAe,IAAI,KAAK,aAAa,KAAK,EAAE,GAAG;AAExD,kBAAQ;AACR,iBAAO,CAAC;AACR,UAAAP,UAAO,KAAK;AACZ,eAAK,KAAK,QAAQ,SAAUwB,MAAKC,QAAO;AACtC,gBAAI,aAAaD,IAAG,GAAG;AACrB,mBAAKC,MAAK,IAAID,KAAI;AAAA,YACpB,OAAO;AACL,sBAAQ;AAAA,YACV;AAAA,UACF,CAAC;AACD,cAAI,OAAO;AACT,gCAAoB,KAAK;AACzB,oBAAQ,gBAAgB,KAAK;AAC7B,mBAAO,IAAIb,wBAAuBX,SAAM,MAAM,KAAK;AAAA,UACrD;AAAA,QACF;AACA,cAAM,kBAAkB,OAAO,iDAAiD;AAAA,MAClF;AACA,aAAO;AAAA,IACT;AAYA,aAAS,iBAAiB,OAAO;AAC/B,UAAI,OAAO,eAAe,KAAK;AAC/B,aAAO,MAAM,UAAU,KAAK;AAI1B,YAAI,OAAO,MAAM;AACjB,cAAM,mBAAmB,MAAM;AAC/B,4BAAoB,KAAK;AACzB,YAAI,YAAY;AAChB,YAAI,WAAW,gBAAgB,KAAK;AACpC,YAAI,MAAM,UAAU,IAAK,OAAM,kBAAkB,OAAO,+CAA+C;AACvG,cAAM,mBAAmB;AACzB,4BAAoB,KAAK;AACzB,YAAI,YAAY,gBAAgB,KAAK;AAErC,eAAO,IAAIS,iBAAgB,WAAW,UAAU,SAAS;AAGzD,cAAM,mBAAmB;AAAA,MAC3B;AACA,aAAO;AAAA,IACT;AAOA,aAAS,eAAe,OAAO;AAC7B,UAAI,OAAO,gBAAgB,KAAK;AAChC,aAAO,MAAM,UAAU,MAAM;AAE3B,4BAAoB,KAAK;AACzB,eAAO,IAAIM,cAAa,MAAM,MAAM,CAAC,MAAM,gBAAgB,KAAK,CAAC,CAAC;AAAA,MACpE;AACA,aAAO;AAAA,IACT;AAOA,aAAS,gBAAgB,OAAO;AAC9B,UAAI,OAAO,gBAAgB,KAAK;AAChC,aAAO,MAAM,UAAU,OAAO;AAE5B,4BAAoB,KAAK;AACzB,eAAO,IAAIA,cAAa,OAAO,OAAO,CAAC,MAAM,gBAAgB,KAAK,CAAC,CAAC;AAAA,MACtE;AACA,aAAO;AAAA,IACT;AAOA,aAAS,gBAAgB,OAAO;AAC9B,UAAI,OAAO,eAAe,KAAK;AAC/B,aAAO,MAAM,UAAU,OAAO;AAE5B,4BAAoB,KAAK;AACzB,eAAO,IAAIA,cAAa,OAAO,OAAO,CAAC,MAAM,eAAe,KAAK,CAAC,CAAC;AAAA,MACrE;AACA,aAAO;AAAA,IACT;AAOA,aAAS,eAAe,OAAO;AAC7B,UAAI,OAAO,gBAAgB,KAAK;AAChC,aAAO,MAAM,UAAU,KAAK;AAE1B,4BAAoB,KAAK;AACzB,eAAO,IAAIA,cAAa,KAAK,SAAS,CAAC,MAAM,gBAAgB,KAAK,CAAC,CAAC;AAAA,MACtE;AACA,aAAO;AAAA,IACT;AAOA,aAAS,gBAAgB,OAAO;AAC9B,UAAI,OAAO,gBAAgB,KAAK;AAChC,aAAO,MAAM,UAAU,MAAM;AAE3B,4BAAoB,KAAK;AACzB,eAAO,IAAIA,cAAa,MAAM,UAAU,CAAC,MAAM,gBAAgB,KAAK,CAAC,CAAC;AAAA,MACxE;AACA,aAAO;AAAA,IACT;AAOA,aAAS,gBAAgB,OAAO;AAC9B,UAAI,OAAO,gBAAgB,KAAK;AAChC,aAAO,MAAM,UAAU,KAAK;AAE1B,4BAAoB,KAAK;AACzB,eAAO,IAAIA,cAAa,KAAK,UAAU,CAAC,MAAM,gBAAgB,KAAK,CAAC,CAAC;AAAA,MACvE;AACA,aAAO;AAAA,IACT;AAMA,aAAS,gBAAgB,OAAO;AAC9B,UAAI,SAAS,CAAC,WAAW,KAAK,CAAC;AAC/B,UAAI,eAAe,CAAC;AACpB,UAAI,YAAY;AAAA,QACd,MAAM;AAAA,QACN,MAAM;AAAA,QACN,KAAK;AAAA,QACL,KAAK;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,MACR;AACA,aAAO,eAAe,WAAW,MAAM,KAAK,GAAG;AAE7C,YAAI,OAAO;AAAA,UACT,MAAM,MAAM;AAAA,UACZ,IAAI,UAAU,MAAM,KAAK;AAAA,QAC3B;AACA,qBAAa,KAAK,IAAI;AACtB,4BAAoB,KAAK;AACzB,eAAO,KAAK,WAAW,KAAK,CAAC;AAAA,MAC/B;AACA,UAAI,OAAO,WAAW,GAAG;AACvB,eAAO,OAAO,CAAC;AAAA,MACjB,WAAW,OAAO,WAAW,GAAG;AAC9B,eAAO,IAAIA,cAAa,aAAa,CAAC,EAAE,MAAM,aAAa,CAAC,EAAE,IAAI,MAAM;AAAA,MAC1E,OAAO;AACL,eAAO,IAAIG,gBAAe,aAAa,IAAI,OAAK,EAAE,EAAE,GAAG,MAAM;AAAA,MAC/D;AAAA,IACF;AAOA,aAAS,WAAW,OAAO;AACzB,UAAI,MAAMlB,SAAM,IAAI;AACpB,aAAO,gBAAgB,KAAK;AAC5B,UAAI,YAAY;AAAA,QACd,MAAM;AAAA,QACN,MAAM;AAAA,QACN,OAAO;AAAA,MACT;AACA,aAAO,eAAe,WAAW,MAAM,KAAK,GAAG;AAC7C,QAAAA,UAAO,MAAM;AACb,aAAK,UAAUA,OAAI;AACnB,4BAAoB,KAAK;AACzB,iBAAS,CAAC,MAAM,gBAAgB,KAAK,CAAC;AACtC,eAAO,IAAIe,cAAaf,SAAM,IAAI,MAAM;AAAA,MAC1C;AACA,aAAO;AAAA,IACT;AAOA,aAAS,gBAAgB,OAAO;AAC9B,UAAI,MAAMA,SAAM,IAAI;AACpB,aAAO,WAAW,KAAK;AACvB,UAAI,YAAY;AAAA,QACd,IAAI;AAAA,QACJ,IAAI;AAAA;AAAA,MACN;AACA,aAAO,eAAe,WAAW,MAAM,KAAK,GAAG;AAC7C,QAAAA,UAAO,MAAM;AACb,aAAK,UAAUA,OAAI;AACnB,4BAAoB,KAAK;AACzB,YAAIA,YAAS,QAAQ,QAAQ,SAAS,MAAM,KAAK,GAAG;AAElD,iBAAO,IAAIe,cAAa,KAAK,YAAY,CAAC,MAAM,IAAII,YAAW,IAAI,CAAC,GAAG,IAAI;AAAA,QAC7E,OAAO;AAEL,mBAAS,CAAC,MAAM,WAAW,KAAK,CAAC;AACjC,iBAAO,IAAIJ,cAAaf,SAAM,IAAI,MAAM;AAAA,QAC1C;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAOA,aAAS,WAAW,OAAO;AACzB,UAAI;AACJ,UAAI,SAAS,CAAC;AACd,UAAI,MAAM,UAAU,KAAK;AACvB,YAAI,MAAM,qBAAqB,MAAM,cAAc;AAIjD,gBAAM,kBAAkB,OAAO,gEAAgE;AAAA,QACjG,OAAO;AAEL,iBAAO,IAAIU,cAAa,CAAC;AAAA,QAC3B;AAAA,MACF,OAAO;AAEL,eAAO,iBAAiB,KAAK;AAAA,MAC/B;AACA,UAAI,MAAM,UAAU,OAAO,MAAM,qBAAqB,MAAM,cAAc;AAExE,eAAO,KAAK,IAAI;AAGhB,eAAO,MAAM,UAAU,OAAO,OAAO,SAAS,GAAG;AAE/C,8BAAoB,KAAK;AACzB,cAAI,MAAM,UAAU,OAAO,MAAM,UAAU,OAAO,MAAM,UAAU,OAAO,MAAM,UAAU,IAAI;AAE3F,mBAAO,KAAK,IAAIS,YAAW,KAAK,CAAC;AAAA,UACnC,OAAO;AAEL,mBAAO,KAAK,iBAAiB,KAAK,CAAC;AAAA,UACrC;AAAA,QACF;AACA,YAAI,OAAO,WAAW,GAAG;AAEvB,iBAAO,IAAIF,WAAU,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AAAA,QACtD,OAAO;AAGL,iBAAO,IAAIA,WAAU,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AAAA,QAC3C;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAOA,aAAS,iBAAiB,OAAO;AAC/B,UAAI,MAAMjB,SAAM,IAAI;AACpB,aAAO,2BAA2B,KAAK;AACvC,UAAI,YAAY;AAAA,QACd,KAAK;AAAA,QACL,KAAK;AAAA,MACP;AACA,aAAO,eAAe,WAAW,MAAM,KAAK,GAAG;AAC7C,QAAAA,UAAO,MAAM;AACb,aAAK,UAAUA,OAAI;AACnB,4BAAoB,KAAK;AACzB,YAAI,YAAY,2BAA2B,KAAK;AAChD,YAAI,UAAU,cAAc;AAC1B,mBAAS,CAAC,MAAM,IAAIe,cAAa,KAAK,YAAY,CAAC,MAAM,SAAS,CAAC,CAAC;AAAA,QACtE,OAAO;AACL,mBAAS,CAAC,MAAM,SAAS;AAAA,QAC3B;AACA,eAAO,IAAIA,cAAaf,SAAM,IAAI,MAAM;AAAA,MAC1C;AACA,aAAO;AAAA,IACT;AAOA,aAAS,2BAA2B,OAAO;AACzC,UAAI,MAAM,MAAMA,SAAM;AACtB,aAAO,4BAA4B,KAAK;AACxC,aAAO;AACP,UAAI,YAAY;AAAA,QACd,KAAK;AAAA,QACL,MAAM;AAAA,QACN,KAAK;AAAA,QACL,MAAM;AAAA,QACN,KAAK;AAAA,QACL,KAAK;AAAA,MACP;AACA,aAAO,MAAM;AACX,YAAI,eAAe,WAAW,MAAM,KAAK,GAAG;AAE1C,UAAAA,UAAO,MAAM;AACb,eAAK,UAAUA,OAAI;AACnB,8BAAoB,KAAK;AACzB,iBAAO,4BAA4B,KAAK;AACxC,iBAAO,IAAIe,cAAaf,SAAM,IAAI,CAAC,MAAM,IAAI,CAAC;AAAA,QAChD,OAAO;AACL;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAOA,aAAS,4BAA4B,OAAO;AAC1C,UAAI,MAAM;AACV,aAAO,WAAW,KAAK;AACvB,aAAO;AACP,aAAO,MAAM;AACX,YAAI,MAAM,cAAc,UAAU,UAAU,MAAM,UAAU,QAAQ,eAAe,IAAI,KAAK,MAAM,UAAU,QAAQ,eAAe,IAAI,KAAK,KAAK,OAAO,gBAAgB,eAAe,KAAK,KAAK,CAAC,CAAC,KAAK,MAAM,cAAc,UAAU,UAAU,CAAC,eAAe,IAAI,MAAM,CAAC,eAAe,IAAI,KAAK,KAAK,OAAO,QAAQ,MAAM,UAAU,KAAK;AAM1U,iBAAO,WAAW,KAAK;AACvB,iBAAO,IAAIe;AAAA,YAAa;AAAA,YAAK;AAAA,YAAY,CAAC,MAAM,IAAI;AAAA,YAAG;AAAA;AAAA,UAAmB;AAAA,QAC5E,OAAO;AACL;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAWA,aAAS,WAAW,OAAO;AACzB,UAAI,OAAO,qBAAqB,KAAK;AACrC,UAAI,OAAO;AACX,UAAI,cAAc,CAAC;AACnB,aAAO,MAAM;AAEX,YAAI,MAAM,UAAU,OAAO,UAAU,IAAI,GAAG;AAE1C,sBAAY,KAAKQ,UAAS,CAAC,GAAG,KAAK,CAAC;AACpC,8BAAoB,KAAK;AAGzB,cAAI,MAAM,cAAc,UAAU,QAAQ;AAExC,wBAAY,KAAKA,UAAS,CAAC,GAAG,KAAK,CAAC;AACpC,gCAAoB,KAAK;AAGzB,gBAAI,MAAM,cAAc,UAAU,UAAU,MAAM,UAAU,OAAO,MAAM,UAAU,MAAM;AAGvF,cAAAA,UAAS,OAAO,YAAY,IAAI,CAAC;AACjC,0BAAY,IAAI;AAChB,qBAAO,qBAAqB,KAAK;AACjC,qBAAO,IAAIR,cAAa,KAAK,UAAU,CAAC,MAAM,IAAI,CAAC;AAAA,YACrD,OAAO;AAEL,0BAAY,IAAI;AAChB,cAAAQ,UAAS,OAAO,YAAY,IAAI,CAAC;AACjC;AAAA,YACF;AAAA,UACF,OAAO;AAEL,YAAAA,UAAS,OAAO,YAAY,IAAI,CAAC;AACjC;AAAA,UACF;AAAA,QACF,OAAO;AACL;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAOA,aAAS,qBAAqB,OAAO;AACnC,UAAI,OAAO,WAAW,KAAK;AAC3B,UAAI,MAAM,UAAU,KAAK;AACvB,YAAI,gBAAgBA,UAAS,CAAC,GAAG,KAAK;AACtC,4BAAoB,KAAK;AAMzB,YAAI;AACF,qBAAW,KAAK;AAGhB,UAAAA,UAAS,OAAO,aAAa;AAAA,QAC/B,SAAS,SAAS;AAEhB,iBAAO,IAAIR,cAAa,KAAK,UAAU,CAAC,MAAM,IAAIL,cAAa,GAAG,CAAC,GAAG,OAAO,IAAI;AAAA,QACnF;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAOA,aAAS,WAAW,OAAO;AACzB,UAAIV,SAAM,QAAQ;AAClB,UAAI,YAAY;AAAA,QACd,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,MACP;AACA,UAAI,eAAe,WAAW,MAAM,KAAK,GAAG;AAC1C,aAAK,UAAU,MAAM,KAAK;AAC1B,QAAAA,UAAO,MAAM;AACb,4BAAoB,KAAK;AACzB,iBAAS,CAAC,WAAW,KAAK,CAAC;AAC3B,eAAO,IAAIe,cAAaf,SAAM,IAAI,MAAM;AAAA,MAC1C;AACA,aAAO,SAAS,KAAK;AAAA,IACvB;AAQA,aAAS,SAAS,OAAO;AACvB,UAAI,MAAMA,SAAM,IAAI;AACpB,aAAO,uBAAuB,KAAK;AACnC,UAAI,MAAM,UAAU,OAAO,MAAM,UAAU,MAAM;AAC/C,QAAAA,UAAO,MAAM;AACb,aAAKA,YAAS,MAAM,QAAQ;AAC5B,4BAAoB,KAAK;AACzB,iBAAS,CAAC,MAAM,WAAW,KAAK,CAAC;AACjC,eAAO,IAAIe,cAAaf,SAAM,IAAI,MAAM;AAAA,MAC1C;AACA,aAAO;AAAA,IACT;AAOA,aAAS,uBAAuB,OAAO;AACrC,UAAI,OAAO,uBAAuB,KAAK;AACvC,aAAO,MAAM,UAAU,MAAM;AAE3B,4BAAoB,KAAK;AACzB,eAAO,IAAIe,cAAa,MAAM,WAAW,CAAC,MAAM,uBAAuB,KAAK,CAAC,CAAC;AAAA,MAChF;AACA,aAAO;AAAA,IACT;AAOA,aAAS,uBAAuB,OAAO;AACrC,UAAI,MAAMf,SAAM,IAAI;AACpB,aAAO,iBAAiB,KAAK;AAC7B,UAAI,YAAY;AAAA,QACd,KAAK;AAAA,QACL,KAAM;AAAA,MACR;AACA,aAAO,eAAe,WAAW,MAAM,KAAK,GAAG;AAC7C,QAAAA,UAAO,MAAM;AACb,aAAK,UAAUA,OAAI;AACnB,iBAAS,KAAK;AACd,iBAAS,CAAC,IAAI;AACd,eAAO,IAAIe,cAAaf,SAAM,IAAI,MAAM;AACxC,eAAO,eAAe,OAAO,IAAI;AAAA,MACnC;AACA,aAAO;AAAA,IACT;AA8BA,aAAS,iBAAiB,OAAO;AAC/B,UAAI,SAAS,CAAC;AACd,UAAI,MAAM,cAAc,UAAU,UAAU,eAAe,MAAM,YAAY,MAAM,KAAK,GAAG;AACzF,YAAI,aAAa,MAAM,WAAW,MAAM,KAAK;AAC7C,iBAAS,KAAK;AAGd,YAAI,MAAM,UAAU,KAAK;AACvB,mBAAS,CAAC;AACV,qBAAW,KAAK;AAChB,mBAAS,KAAK;AACd,cAAI,MAAM,UAAU,KAAK;AACvB,mBAAO,KAAK,gBAAgB,KAAK,CAAC;AAGlC,mBAAO,MAAM,UAAU,KAAK;AAE1B,uBAAS,KAAK;AACd,qBAAO,KAAK,gBAAgB,KAAK,CAAC;AAAA,YACpC;AAAA,UACF;AACA,cAAI,MAAM,UAAU,KAAK;AACvB,kBAAM,kBAAkB,OAAO,wBAAwB;AAAA,UACzD;AACA,sBAAY,KAAK;AACjB,mBAAS,KAAK;AAAA,QAChB;AAIA,eAAO,IAAI,WAAW,MAAM;AAAA,MAC9B;AACA,aAAO,YAAY,KAAK;AAAA,IAC1B;AAOA,aAAS,YAAY,OAAO;AAC1B,UAAI,MAAMA;AACV,UAAI,MAAM,cAAc,UAAU,UAAU,MAAM,cAAc,UAAU,aAAa,MAAM,SAAS,kBAAkB;AACtH,QAAAA,UAAO,MAAM;AACb,iBAAS,KAAK;AACd,YAAI,eAAe,WAAWA,OAAI,GAAG;AAEnC,iBAAO,IAAIU,cAAa,UAAUV,OAAI,CAAC;AAAA,QACzC,WAAW,kBAAkB,SAASA,OAAI,GAAG;AAE3C,iBAAO,IAAIU,cAAaP,SAAQH,SAAM,QAAQ,CAAC;AAAA,QACjD,OAAO;AACL,iBAAO,IAAImB,YAAWnB,OAAI;AAAA,QAC5B;AAGA,eAAO,eAAe,OAAO,IAAI;AACjC,eAAO;AAAA,MACT;AACA,aAAO,YAAY,KAAK;AAAA,IAC1B;AAgBA,aAAS,eAAe,OAAO,MAAM,OAAO;AAC1C,UAAI;AAGJ,aAAO,MAAM;AAGX,YAAI,WAAW;AAGf,YAAI,MAAM,UAAU,MAAM;AACxB,qBAAW;AAEX,mBAAS,KAAK;AAAA,QAChB;AACA,YAAI,mBAAmB,MAAM,UAAU,OAAO,MAAM,UAAU,OAAO,MAAM,UAAU,SAAS,CAAC,SAAS,MAAM,SAAS,MAAM,KAAK;AAClI,YAAI,EAAE,YAAY,kBAAkB;AAClC;AAAA,QACF;AACA,iBAAS,CAAC;AACV,YAAI,MAAM,UAAU,KAAK;AACvB,cAAI,YAAY,aAAa,IAAI,KAAK,eAAe,IAAI,GAAG;AAE1D,uBAAW,KAAK;AAChB,qBAAS,KAAK;AACd,gBAAI,MAAM,UAAU,KAAK;AACvB,qBAAO,KAAK,gBAAgB,KAAK,CAAC;AAGlC,qBAAO,MAAM,UAAU,KAAK;AAE1B,yBAAS,KAAK;AACd,uBAAO,KAAK,gBAAgB,KAAK,CAAC;AAAA,cACpC;AAAA,YACF;AACA,gBAAI,MAAM,UAAU,KAAK;AACvB,oBAAM,kBAAkB,OAAO,wBAAwB;AAAA,YACzD;AACA,wBAAY,KAAK;AACjB,qBAAS,KAAK;AACd,mBAAO,IAAIY,cAAa,MAAM,QAAQ,QAAQ;AAAA,UAChD,OAAO;AAIL,mBAAO;AAAA,UACT;AAAA,QACF,WAAW,MAAM,UAAU,KAAK;AAE9B,qBAAW,KAAK;AAChB,mBAAS,KAAK;AACd,cAAI,MAAM,UAAU,KAAK;AACvB,mBAAO,KAAK,gBAAgB,KAAK,CAAC;AAGlC,mBAAO,MAAM,UAAU,KAAK;AAE1B,uBAAS,KAAK;AACd,qBAAO,KAAK,gBAAgB,KAAK,CAAC;AAAA,YACpC;AAAA,UACF;AACA,cAAI,MAAM,UAAU,KAAK;AACvB,kBAAM,kBAAkB,OAAO,wBAAwB;AAAA,UACzD;AACA,sBAAY,KAAK;AACjB,mBAAS,KAAK;AACd,iBAAO,IAAIP,cAAa,MAAM,IAAIQ,WAAU,MAAM,GAAG,QAAQ;AAAA,QAC/D,OAAO;AAGL,cAAI,CAAC,SAAU,UAAS,KAAK;AAC7B,cAAI,iBAAiB,MAAM,cAAc,UAAU,UAAU,MAAM,cAAc,UAAU,aAAa,MAAM,SAAS;AACvH,cAAI,CAAC,gBAAgB;AACnB,gBAAI,UAAU;AACd,uBAAW,WAAW,mBAAmB;AACzC,kBAAM,kBAAkB,OAAO,OAAO;AAAA,UACxC;AACA,iBAAO,KAAK,IAAIH,cAAa,MAAM,KAAK,CAAC;AACzC,mBAAS,KAAK;AACd,cAAI,cAAc;AAClB,iBAAO,IAAIL,cAAa,MAAM,IAAIQ,WAAU,QAAQ,WAAW,GAAG,QAAQ;AAAA,QAC5E;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAOA,aAAS,YAAY,OAAO;AAC1B,UAAI,MAAM;AACV,UAAI,MAAM,UAAU,OAAO,MAAM,UAAU,KAAK;AAC9C,cAAM,iBAAiB,OAAO,MAAM,KAAK;AAGzC,eAAO,IAAIH,cAAa,GAAG;AAG3B,eAAO,eAAe,OAAO,IAAI;AACjC,eAAO;AAAA,MACT;AACA,aAAO,YAAY,KAAK;AAAA,IAC1B;AAQA,aAAS,iBAAiB,OAAO,OAAO;AACtC,UAAI,MAAM;AACV,aAAO,iBAAiB,KAAK,MAAM,MAAM,iBAAiB,KAAK,MAAM,OAAO;AAC1E,YAAI,iBAAiB,KAAK,MAAM,MAAM;AACpC,eAAK,KAAK;AACV,cAAI,OAAO,iBAAiB,KAAK;AACjC,cAAI,aAAa,kBAAkB,IAAI;AACvC,cAAI,eAAe,QAAW;AAE5B,mBAAO;AACP,kBAAM,SAAS;AAAA,UACjB,WAAW,SAAS,KAAK;AAEvB,gBAAI,UAAU,MAAM,WAAW,MAAM,MAAM,QAAQ,GAAG,MAAM,QAAQ,CAAC;AACrE,gBAAI,mBAAmB,KAAK,OAAO,GAAG;AAEpC,qBAAO,OAAO,aAAa,SAAS,SAAS,EAAE,CAAC;AAChD,oBAAM,SAAS;AAAA,YACjB,OAAO;AACL,oBAAM,kBAAkB,OAAO,gCAAgC,OAAO,OAAO,CAAC;AAAA,YAChF;AAAA,UACF,OAAO;AACL,kBAAM,kBAAkB,OAAO,0BAA0B,OAAO,IAAI,CAAC;AAAA,UACvE;AAAA,QACF,OAAO;AAEL,iBAAO,iBAAiB,KAAK;AAC7B,eAAK,KAAK;AAAA,QACZ;AAAA,MACF;AACA,eAAS,KAAK;AACd,UAAI,MAAM,UAAU,OAAO;AACzB,cAAM,kBAAkB,OAAO,iBAAiB,OAAO,OAAO,WAAW,CAAC;AAAA,MAC5E;AACA,eAAS,KAAK;AACd,aAAO;AAAA,IACT;AAOA,aAAS,YAAY,OAAO;AAC1B,UAAI,OAAO,QAAQ,MAAM;AACzB,UAAI,MAAM,UAAU,KAAK;AAEvB,mBAAW,KAAK;AAChB,iBAAS,KAAK;AACd,YAAI,MAAM,UAAU,KAAK;AAEvB,cAAIgB,OAAM,SAAS,KAAK;AACxB,cAAI,MAAM,UAAU,KAAK;AAEvB,mBAAO;AACP,qBAAS,CAACA,IAAG;AAGb,mBAAO,MAAM,UAAU,KAAK;AAE1B,uBAAS,KAAK;AACd,kBAAI,MAAM,UAAU,KAAK;AACvB,uBAAO,IAAI,IAAI,SAAS,KAAK;AAC7B;AAAA,cACF;AAAA,YACF;AACA,gBAAI,MAAM,UAAU,KAAK;AACvB,oBAAM,kBAAkB,OAAO,0BAA0B;AAAA,YAC3D;AACA,wBAAY,KAAK;AACjB,qBAAS,KAAK;AAGd,mBAAO,OAAO,CAAC,EAAE,MAAM;AACvB,qBAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC7B,kBAAI,OAAO,CAAC,EAAE,MAAM,WAAW,MAAM;AACnC,sBAAM,YAAY,OAAO,iCAAsC,OAAO,CAAC,EAAE,MAAM,SAAS,UAAU,OAAO,GAAG;AAAA,cAC9G;AAAA,YACF;AACA,oBAAQ,IAAIpB,WAAU,MAAM;AAAA,UAC9B,OAAO;AAEL,gBAAI,MAAM,UAAU,KAAK;AACvB,oBAAM,kBAAkB,OAAO,0BAA0B;AAAA,YAC3D;AACA,wBAAY,KAAK;AACjB,qBAAS,KAAK;AACd,oBAAQoB;AAAA,UACV;AAAA,QACF,OAAO;AAEL,sBAAY,KAAK;AACjB,mBAAS,KAAK;AACd,kBAAQ,IAAIpB,WAAU,CAAC,CAAC;AAAA,QAC1B;AACA,eAAO,eAAe,OAAO,KAAK;AAAA,MACpC;AACA,aAAO,YAAY,KAAK;AAAA,IAC1B;AAMA,aAAS,SAAS,OAAO;AACvB,UAAI,SAAS,CAAC,gBAAgB,KAAK,CAAC;AACpC,UAAI,MAAM;AACV,aAAO,MAAM,UAAU,KAAK;AAE1B,iBAAS,KAAK;AAGd,YAAI,MAAM,UAAU,OAAO,MAAM,UAAU,KAAK;AAC9C,iBAAO,GAAG,IAAI,gBAAgB,KAAK;AACnC;AAAA,QACF;AAAA,MACF;AACA,aAAO,IAAIA,WAAU,MAAM;AAAA,IAC7B;AAOA,aAAS,YAAY,OAAO;AAC1B,UAAI,MAAM,UAAU,KAAK;AACvB,mBAAW,KAAK;AAChB,YAAI;AACJ,YAAIqB,cAAa,CAAC;AAClB,WAAG;AACD,mBAAS,KAAK;AACd,cAAI,MAAM,UAAU,KAAK;AAEvB,gBAAI,MAAM,UAAU,OAAO,MAAM,UAAU,KAAK;AAC9C,oBAAM,iBAAiB,OAAO,MAAM,KAAK;AAAA,YAC3C,WAAW,MAAM,cAAc,UAAU,UAAU,MAAM,cAAc,UAAU,aAAa,MAAM,SAAS,kBAAkB;AAC7H,oBAAM,MAAM;AACZ,uBAAS,KAAK;AAAA,YAChB,OAAO;AACL,oBAAM,kBAAkB,OAAO,yCAAyC;AAAA,YAC1E;AAGA,gBAAI,MAAM,UAAU,KAAK;AACvB,oBAAM,kBAAkB,OAAO,mCAAmC;AAAA,YACpE;AACA,qBAAS,KAAK;AAGd,YAAAA,YAAW,GAAG,IAAI,gBAAgB,KAAK;AAAA,UACzC;AAAA,QACF,SAAS,MAAM,UAAU;AAEzB,YAAI,MAAM,UAAU,KAAK;AACvB,gBAAM,kBAAkB,OAAO,kDAAkD;AAAA,QACnF;AACA,oBAAY,KAAK;AACjB,iBAAS,KAAK;AACd,YAAI,OAAO,IAAIb,YAAWa,WAAU;AAGpC,eAAO,eAAe,OAAO,IAAI;AACjC,eAAO;AAAA,MACT;AACA,aAAO,YAAY,KAAK;AAAA,IAC1B;AAOA,aAAS,YAAY,OAAO;AAC1B,UAAI;AACJ,UAAI,MAAM,cAAc,UAAU,QAAQ;AAExC,oBAAY,MAAM;AAClB,iBAAS,KAAK;AACd,YAAI,cAAc,eAAe,WAAWvB,OAAM;AAClD,YAAI,QAAQD,SAAQ,WAAW,WAAW;AAC1C,eAAO,IAAIO,cAAa,KAAK;AAAA,MAC/B;AACA,aAAO,iBAAiB,KAAK;AAAA,IAC/B;AAOA,aAAS,iBAAiB,OAAO;AAC/B,UAAI;AAGJ,UAAI,MAAM,UAAU,KAAK;AAEvB,mBAAW,KAAK;AAChB,iBAAS,KAAK;AACd,eAAO,gBAAgB,KAAK;AAE5B,YAAI,MAAM,UAAU,KAAK;AACvB,gBAAM,kBAAkB,OAAO,wBAAwB;AAAA,QACzD;AACA,oBAAY,KAAK;AACjB,iBAAS,KAAK;AACd,eAAO,IAAIM,iBAAgB,IAAI;AAC/B,eAAO,eAAe,OAAO,IAAI;AACjC,eAAO;AAAA,MACT;AACA,aAAO,SAAS,KAAK;AAAA,IACvB;AAOA,aAAS,SAAS,OAAO;AACvB,UAAI,MAAM,UAAU,IAAI;AAEtB,cAAM,kBAAkB,OAAO,8BAA8B;AAAA,MAC/D,OAAO;AACL,cAAM,kBAAkB,OAAO,gBAAgB;AAAA,MACjD;AAAA,IACF;AAkBA,aAAS,IAAI,OAAO;AAClB,aAAO,MAAM,QAAQ,MAAM,MAAM,SAAS;AAAA,IAC5C;AASA,aAAS,kBAAkB,OAAO,SAAS;AACzC,UAAI,IAAI,IAAI,KAAK;AACjB,UAAIY,SAAQ,IAAI,YAAY,UAAU,YAAY,IAAI,GAAG;AACzD,MAAAA,OAAM,OAAO;AACb,aAAOA;AAAA,IACT;AASA,aAAS,YAAY,OAAO,SAAS;AACnC,UAAI,IAAI,IAAI,KAAK;AACjB,UAAIA,SAAQ,IAAI,YAAY,UAAU,YAAY,IAAI,GAAG;AACzD,MAAAA,OAAM,OAAO;AACb,aAAOA;AAAA,IACT;AAGA,IAAA1B,OAAM,cAAc;AAAA,MAClB,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,SAASkB;AAAA,IACX,CAAC;AACD,WAAOA;AAAA,EACT,CAAC;;;AC1pDD,MAAIS,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO;AAC7B,MAAI,gBAA+B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC5E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,OAAAC;AAAA,IACF,IAAI;AAmCJ,WAAOD,OAAMF,SAAM;AAAA,MACjB,QAAQ,SAASI,QAAO,MAAM;AAC5B,eAAOD,OAAM,IAAI,EAAE,QAAQ;AAAA,MAC7B;AAAA,MACA,kBAAkB,SAAS,cAAc,MAAM;AAC7C,eAAOE,SAAQ,MAAM,SAAU,OAAO;AACpC,iBAAOF,OAAM,KAAK,EAAE,QAAQ;AAAA,QAC9B,CAAC;AAAA,MACH;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AClDD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO;AAC7B,MAAI,iBAAgC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC7E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,OAAAC;AAAA,IACF,IAAI;AAsCJ,WAAOD,OAAMF,SAAM;AAAA,MACjB,QAAQ,SAASI,QAAO,MAAM;AAC5B,YAAI,QAAQ,eAAe;AAC3B,eAAOD,OAAM,IAAI,EAAE,QAAQ,EAAE,SAAS,KAAK;AAAA,MAC7C;AAAA,MACA,wBAAwB,SAAS,mBAAmB,MAAM,OAAO;AAC/D,eAAOA,OAAM,IAAI,EAAE,QAAQ,EAAE,SAAS,KAAK;AAAA,MAC7C;AAAA,MACA,kBAAkB,SAAS,cAAc,MAAM;AAC7C,YAAI,QAAQ,eAAe;AAC3B,eAAOE,SAAQ,MAAM,SAAU,OAAO;AACpC,iBAAOF,OAAM,KAAK,EAAE,QAAQ,EAAE,SAAS,KAAK;AAAA,QAC9C,CAAC;AAAA,MACH;AAAA,MACA,gCAAgC,SAAS,0BAA0B,MAAM,OAAO;AAC9E,eAAOE,SAAQ,MAAM,SAAU,OAAO;AACpC,iBAAOF,OAAM,KAAK,EAAE,QAAQ,EAAE,SAAS,KAAK;AAAA,QAC9C,CAAC;AAAA,MACH;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AChED,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,YAAY,OAAO;AAChC,MAAI,oBAAmC,wBAAQD,SAAMC,iBAAc,UAAQ;AAChF,QAAI;AAAA,MACF,UAAAC;AAAA,MACA,OAAAC;AAAA,IACF,IAAI;AAiDJ,aAASC,UAAS;AAChB,UAAI,EAAE,gBAAgBA,UAAS;AAC7B,cAAM,IAAI,YAAY,kDAAkD;AAAA,MAC1E;AACA,aAAO,eAAe,MAAM,SAAS;AAAA,QACnC,OAAO,eAAe;AAAA,QACtB,UAAU;AAAA,MACZ,CAAC;AAAA,IACH;AAKA,IAAAA,QAAO,UAAU,OAAO;AACxB,IAAAA,QAAO,UAAU,WAAW;AAS5B,IAAAA,QAAO,UAAU,WAAW,SAAU,MAAM;AAE1C,aAAOF,UAAS,MAAM,KAAK,KAAK;AAAA,IAClC;AAQA,IAAAE,QAAO,UAAU,MAAM,SAAUJ,SAAM;AAErC,UAAI,KAAK,MAAM,IAAIA,OAAI,GAAG;AACxB,eAAO,KAAK,MAAM,IAAIA,OAAI;AAAA,MAC5B;AAAA,IACF;AAMA,IAAAI,QAAO,UAAU,SAAS,WAAY;AACpC,aAAO,SAAS,KAAK,KAAK;AAAA,IAC5B;AAMA,IAAAA,QAAO,UAAU,cAAc,WAAY;AACzC,aAAO,KAAK;AAAA,IACd;AACA,aAAS,oBAAoBJ,SAAM;AACjC,UAAIA,QAAK,WAAW,GAAG;AACrB,eAAO;AAAA,MACT;AACA,eAASK,KAAI,GAAGA,KAAIL,QAAK,QAAQK,MAAK;AACpC,YAAI,QAAQL,QAAK,OAAOK,KAAI,CAAC;AAC7B,YAAI,IAAIL,QAAK,OAAOK,EAAC;AACrB,YAAI,QAAQL,QAAK,OAAOK,KAAI,CAAC;AAC7B,YAAI,QAAQF,OAAM,QAAQ,GAAG,OAAO,KAAK,KAAKE,KAAI,KAAKF,OAAM,QAAQ,CAAC;AACtE,YAAI,CAAC,OAAO;AACV,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAOA,IAAAC,QAAO,UAAU,MAAM,SAAUJ,SAAM,OAAO;AAC5C,UAAI,CAAC,oBAAoBA,OAAI,GAAG;AAC9B,cAAM,IAAI,MAAM,2BAA2B,OAAOA,SAAM,oDAAoD,CAAC;AAAA,MAC/G;AACA,WAAK,MAAM,IAAIA,SAAM,KAAK;AAC1B,aAAO;AAAA,IACT;AAMA,IAAAI,QAAO,UAAU,SAAS,SAAUJ,SAAM;AACxC,WAAK,MAAM,OAAOA,OAAI;AAAA,IACxB;AAKA,IAAAI,QAAO,UAAU,QAAQ,WAAY;AACnC,WAAK,MAAM,MAAM;AAAA,IACnB;AACA,IAAAA,QAAO,UAAU,SAAS,WAAY;AACpC,UAAI,OAAO;AAAA,QACT,QAAQ;AAAA,QACR,WAAW,CAAC;AAAA,QACZ,WAAW,CAAC;AAAA,MACd;AACA,eAAS,CAAC,QAAQ,KAAK,KAAK,KAAK,OAAO;AACtC,YAAI,WAAW,KAAK,GAAG;AACrB,cAAI,CAAC,qBAAqB,KAAK,GAAG;AAChC,kBAAM,IAAI,MAAM,sCAAsC,OAAO,MAAM,CAAC;AAAA,UACtE;AACA,eAAK,UAAU,MAAM,IAAI,GAAG,OAAO,MAAM,QAAQ,KAAK,EAAE,OAAO,MAAM,IAAI;AAAA,QAC3E,OAAO;AACL,eAAK,UAAU,MAAM,IAAI;AAAA,QAC3B;AAAA,MACF;AACA,aAAO;AAAA,IACT;AACA,IAAAA,QAAO,WAAW,SAAU,MAAM;AAChC,UAAIE,UAAS,IAAIF,QAAO;AACxB,aAAO,QAAQ,KAAK,SAAS,EAAE,QAAQ,WAAS;AAC9C,YAAI,CAACJ,SAAM,KAAK,IAAI;AACpB,eAAOM,QAAO,IAAIN,SAAM,KAAK;AAAA,MAC/B,CAAC;AACD,aAAO,QAAQ,KAAK,SAAS,EAAE,QAAQ,WAAS;AAC9C,YAAI,CAAC,OAAO,EAAE,IAAI;AAClB,eAAOM,QAAO,SAAS,EAAE;AAAA,MAC3B,CAAC;AACD,aAAOA;AAAA,IACT;AACA,WAAOF;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,EACX,CAAC;AACD,WAAS,qBAAqB,OAAO;AACnC,WAAO,OAAO,UAAU,cAAc,OAAO,MAAM,WAAW,YAAY,OAAO,MAAM,SAAS;AAAA,EAClG;;;AChMA,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,QAAQ;AAC9B,MAAI,eAA8B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AA4CJ,WAAOD,OAAMF,SAAM;AAAA,MACjB,IAAI,SAAS,IAAI;AACf,eAAO,IAAIG,QAAO;AAAA,MACpB;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACtDD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,OAAO,aAAa,gBAAgB,kBAAkB,kBAAkB,UAAU,eAAe,cAAc,eAAe,gBAAgB,KAAK;AACnL,MAAI,YAA2B,wBAAQD,SAAMC,iBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,KAAAC;AAAA,MACA,WAAAC;AAAA,MACA,cAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,YAAAC;AAAA,MACA,aAAAC;AAAA,MACA,cAAAC;AAAA,MACA,KAAAC;AAAA,IACF,IAAI;AA2BJ,WAAOZ,OAAMF,SAAM;AAAA,MACjB,aAAa,SAASY,aAAY,GAAG;AACnC,eAAO,UAAU,CAAC;AAAA,MACpB;AAAA,MACA,cAAc,SAASC,cAAa,GAAG;AACrC,eAAO,WAAW,CAAC;AAAA,MACrB;AAAA,MACA,OAAO,SAASE,OAAM,GAAG;AAEvB,YAAI,IAAIZ,QAAO,CAAC;AAEhB,YAAI,IAAI,UAAU,CAAC;AAEnB,eAAO;AAAA,UACL,GAAG,EAAE,EAAE,QAAQ;AAAA,UACf,GAAG,EAAE,EAAE,QAAQ;AAAA,UACf,GAAG,EAAE;AAAA,QACP;AAAA,MACF;AAAA,IACF,CAAC;AACD,aAAS,UAAU,GAAG;AAEpB,UAAI,OAAO,EAAE,MAAM,CAAC;AACpB,UAAI,UAAU,EAAE,MAAM,CAAC;AAEvB,UAAI,IAAI,KAAK,IAAI,MAAM,OAAO;AAE9B,UAAI,OAAOa,OAAM,EAAE,KAAK;AAExB,UAAI,QAAQ,CAAC;AACb,UAAI,QAAQ,CAAC,MAAM,CAAC;AAEpB,UAAI,QAAQ,CAAC;AACb,UAAI,QAAQ,CAAC,GAAG,OAAO;AAEvB,UAAIC,IAAG,GAAG;AAEV,UAAI,IAAI,CAAC;AACT,WAAKA,KAAI,GAAGA,KAAI,MAAMA,MAAK;AACzB,UAAEA,EAAC,IAAIA;AAAA,MACT;AAEA,WAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAE5B,YAAI,IAAI,GAAG;AAET,eAAKA,KAAI,GAAGA,KAAI,MAAMA,MAAK;AAEzB,gBAAIC,OAAM,KAAK,IAAID,IAAG,CAAC;AAEvB,gBAAI,IAAI;AAER,iBAAK,IAAI,GAAG,IAAIC,MAAK,KAAK;AAExB,kBAAIb,WAAU,GAAGE,gBAAe,KAAKU,EAAC,EAAE,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;AAAA,YACzD;AACA,iBAAKA,EAAC,EAAE,CAAC,IAAIT,gBAAe,KAAKS,EAAC,EAAE,CAAC,GAAG,CAAC;AAAA,UAC3C;AAAA,QACF;AAEA,YAAIE,MAAK;AACT,YAAI,QAAQ;AACZ,YAAI,MAAM;AAEV,aAAKF,KAAI,GAAGA,KAAI,MAAMA,MAAK;AAEzB,cAAI,IAAI,KAAKA,EAAC,EAAE,CAAC;AAEjB,cAAI,OAAOb,KAAI,CAAC;AAEhB,cAAIK,QAAO,MAAM,KAAK,GAAG;AAEvB,YAAAU,MAAKF;AAEL,oBAAQ;AAER,kBAAM;AAAA,UACR;AAAA,QACF;AAEA,YAAI,MAAME,KAAI;AAEZ,YAAE,CAAC,IAAI,CAAC,EAAEA,GAAE,GAAG,EAAEA,GAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;AAE9B,UAAAP,aAAY,UAAU,GAAGO,KAAI,IAAI;AAAA,QACnC;AAEA,YAAI,IAAI,MAAM;AAEZ,eAAKF,KAAI,IAAI,GAAGA,KAAI,MAAMA,MAAK;AAE7B,gBAAI,MAAM,KAAKA,EAAC,EAAE,CAAC;AACnB,gBAAI,CAACP,aAAY,KAAK,CAAC,GAAG;AAExB,mBAAKO,EAAC,EAAE,CAAC,IAAIX,cAAa,KAAKW,EAAC,EAAE,CAAC,GAAG,GAAG;AAAA,YAC3C;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,WAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAE5B,aAAKA,KAAI,GAAGA,KAAI,MAAMA,MAAK;AAEzB,cAAI,MAAM,GAAG;AAEX,gBAAIA,KAAI,SAAS;AAEf,oBAAMA,EAAC,IAAI,CAAC;AAAA,YACd;AAEA,kBAAMA,EAAC,IAAI,CAAC;AAAA,UACd;AAEA,cAAIA,KAAI,GAAG;AAET,gBAAIA,KAAI,SAAS;AAEf,oBAAMA,EAAC,EAAE,CAAC,IAAI,KAAKA,EAAC,EAAE,CAAC;AAAA,YACzB;AAEA,gBAAI,IAAI,MAAM;AAEZ,oBAAMA,EAAC,EAAE,CAAC,IAAI;AAAA,YAChB;AACA;AAAA,UACF;AAEA,cAAIA,OAAM,GAAG;AAEX,gBAAIA,KAAI,SAAS;AAEf,oBAAMA,EAAC,EAAE,CAAC,IAAI,KAAKA,EAAC,EAAE,CAAC;AAAA,YACzB;AAEA,gBAAI,IAAI,MAAM;AAEZ,oBAAMA,EAAC,EAAE,CAAC,IAAI;AAAA,YAChB;AACA;AAAA,UACF;AAEA,cAAIA,KAAI,SAAS;AAEf,kBAAMA,EAAC,EAAE,CAAC,IAAI;AAAA,UAChB;AAEA,cAAI,IAAI,MAAM;AAEZ,kBAAMA,EAAC,EAAE,CAAC,IAAI,KAAKA,EAAC,EAAE,CAAC;AAAA,UACzB;AAAA,QACF;AAAA,MACF;AAEA,UAAI,IAAI,IAAIL,aAAY;AAAA,QACtB,MAAM;AAAA,QACN,MAAM;AAAA,MACR,CAAC;AAED,UAAI,IAAI,IAAIA,aAAY;AAAA,QACtB,MAAM;AAAA,QACN,MAAM;AAAA,MACR,CAAC;AAED,UAAI,KAAK,CAAC;AACV,WAAKK,KAAI,GAAG,IAAI,EAAE,QAAQA,KAAI,GAAGA,MAAK;AACpC,WAAG,EAAEA,EAAC,CAAC,IAAIA;AAAA,MACb;AAEA,aAAO;AAAA,QACL,GAAG;AAAA,QACH,GAAG;AAAA,QACH,GAAG;AAAA,QACH,UAAU,SAAS,WAAW;AAC5B,iBAAO,QAAQ,KAAK,EAAE,SAAS,IAAI,UAAU,KAAK,EAAE,SAAS,IAAI,UAAU,KAAK;AAAA,QAClF;AAAA,MACF;AAAA,IACF;AACA,aAAS,WAAW,GAAG;AAErB,UAAI,OAAO,EAAE,MAAM,CAAC;AACpB,UAAI,UAAU,EAAE,MAAM,CAAC;AAEvB,UAAI,IAAI,KAAK,IAAI,MAAM,OAAO;AAE9B,UAAI,SAAS,EAAE;AACf,UAAIG,SAAQ,EAAE;AACd,UAAI,MAAM,EAAE;AAEZ,UAAI,UAAU,CAAC;AACf,UAAI,SAAS,CAAC;AACd,UAAI,OAAO,CAAC;AACZ,UAAI,QAAQ,CAAC,MAAM,CAAC;AAEpB,UAAI,UAAU,CAAC;AACf,UAAI,SAAS,CAAC;AACd,UAAI,OAAO,CAAC;AACZ,UAAI,QAAQ,CAAC,GAAG,OAAO;AAEvB,UAAIH,IAAG,GAAG;AAEV,UAAI,OAAO,CAAC;AACZ,UAAI,OAAO,CAAC;AACZ,WAAKA,KAAI,GAAGA,KAAI,MAAMA,MAAK;AACzB,aAAKA,EAAC,IAAIA;AACV,aAAKA,EAAC,IAAIA;AAAA,MACZ;AAEA,UAAI,cAAc,SAASI,aAAY,GAAG,GAAG;AAE3C,YAAI,KAAK,KAAK,CAAC;AACf,YAAI,KAAK,KAAK,CAAC;AAEf,aAAK,EAAE,IAAI;AACX,aAAK,EAAE,IAAI;AAEX,aAAK,CAAC,IAAI;AACV,aAAK,CAAC,IAAI;AAAA,MACZ;AAEA,UAAI,QAAQ,SAASC,SAAQ;AAE3B,YAAI,MAAM,IAAIR,KAAI;AAElB,YAAI,IAAI,MAAM;AAEZ,eAAK,KAAK,QAAQ,MAAM;AAExB,kBAAQ,KAAK,CAAC;AACd,iBAAO,KAAK,CAAC;AAAA,QACf;AAEA,aAAK,KAAK,QAAQ,MAAM;AAExB,YAAI,KAAK,IAAI,CAAC;AACd,YAAI,KAAK,IAAI,IAAI,CAAC;AAElB,aAAK,IAAI,IAAI,IAAI,IAAI,KAAK;AAExB,UAAAG,KAAIG,OAAM,CAAC;AAEX,cAAI,IAAI,KAAKH,EAAC,GAAG,OAAO,CAAC,CAAC;AAAA,QAC5B;AAEA,YAAI,IAAI,GAAG;AAET,cAAI,QAAQ,GAAG,IAAI,GAAG,SAAUM,IAAG,KAAK;AAEtC,YAAAV,cAAa,YAAYU,IAAG,SAAS,QAAQ,MAAM,SAAUN,IAAG,KAAK;AAEnE,kBAAIA,KAAIM,IAAG;AAET,oBAAI,WAAWN,IAAGN,YAAWJ,gBAAe,KAAK,GAAG,CAAC,CAAC;AAAA,cACxD;AAAA,YACF,CAAC;AAAA,UACH,CAAC;AAAA,QACH;AAEA,YAAIY,MAAK;AACT,YAAI,MAAM,IAAI,IAAI,CAAC;AACnB,YAAI,QAAQf,KAAI,GAAG;AAEnB,YAAI,QAAQ,IAAI,GAAG,OAAO,GAAG,SAAU,GAAG,GAAG;AAE3C,cAAI,OAAOA,KAAI,CAAC;AAEhB,cAAIK,QAAO,MAAM,KAAK,GAAG;AAEvB,YAAAU,MAAK;AAEL,oBAAQ;AAER,kBAAM;AAAA,UACR;AAAA,QACF,CAAC;AAED,YAAI,MAAMA,KAAI;AAEZ,UAAAN,cAAa,UAAU,GAAGM,KAAI,MAAM,CAAC,GAAG,SAAS,QAAQ,IAAI;AAE7D,UAAAN,cAAa,UAAU,GAAGM,KAAI,MAAM,CAAC,GAAG,SAAS,QAAQ,IAAI;AAE7D,cAAI,KAAK,GAAGA,GAAE;AAEd,sBAAY,GAAGA,GAAE;AAAA,QACnB;AAEA,YAAI,QAAQ,GAAG,OAAO,GAAG,SAAU,GAAG,GAAG;AAEvC,cAAI,KAAK,GAAG;AAEV,oBAAQ,KAAK,CAAC;AACd,mBAAO,KAAK,CAAC;AAAA,UACf,OAAO;AAEL,gBAAIb,cAAa,GAAG,GAAG;AAEvB,gBAAI,CAACI,aAAY,GAAG,CAAC,GAAG;AAEtB,sBAAQ,KAAK,CAAC;AACd,qBAAO,KAAK,CAAC;AAAA,YACf;AAAA,UACF;AAAA,QACF,CAAC;AAAA,MACH;AACA,WAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAC5B,cAAM;AAAA,MACR;AAEA,WAAK,KAAK,QAAQ,MAAM;AACxB,WAAK,KAAK,QAAQ,MAAM;AAGxB,aAAO;AAAA,QACL,GAAG,IAAIG,cAAa;AAAA,UAClB,QAAQ;AAAA,UACR,OAAO;AAAA,UACP,KAAK;AAAA,UACL,MAAM;AAAA,QACR,CAAC;AAAA,QACD,GAAG,IAAIA,cAAa;AAAA,UAClB,QAAQ;AAAA,UACR,OAAO;AAAA,UACP,KAAK;AAAA,UACL,MAAM;AAAA,QACR,CAAC;AAAA,QACD,GAAG;AAAA,QACH,UAAU,SAAS,WAAW;AAC5B,iBAAO,QAAQ,KAAK,EAAE,SAAS,IAAI,UAAU,KAAK,EAAE,SAAS,IAAI,UAAU,KAAK;AAAA,QAClF;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAC;;;ACxXD,MAAIW,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,SAAS,YAAY,UAAU,SAAS,QAAQ,QAAQ,QAAQ,cAAc,aAAa,gBAAgB,kBAAkB,kBAAkB,SAAS;AACxL,MAAI,WAA0B,wBAAQD,SAAMC,iBAAc,UAAQ;AACvE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,OAAAC;AAAA,MACA,UAAAC;AAAA,MACA,QAAAC;AAAA,MACA,OAAAC;AAAA,MACA,MAAAC;AAAA,MACA,MAAAC;AAAA,MACA,MAAAC;AAAA,MACA,YAAAC;AAAA,MACA,WAAAC;AAAA,MACA,cAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,SAAAC;AAAA,IACF,IAAI;AA4CJ,WAAOC,UAASf,OAAMF,SAAM;AAAA,MAC1B,aAAa,SAASkB,aAAY,GAAG;AACnC,eAAO,SAAS,CAAC;AAAA,MACnB;AAAA,MACA,cAAc,SAASC,cAAa,GAAG;AACrC,eAAO,UAAU,CAAC;AAAA,MACpB;AAAA,MACA,OAAO,SAASC,OAAM,GAAG;AAEvB,YAAI,IAAIjB,QAAO,CAAC;AAEhB,YAAI,IAAI,SAAS,CAAC;AAElB,eAAO;AAAA,UACL,GAAG,EAAE,EAAE,QAAQ;AAAA,UACf,GAAG,EAAE,EAAE,QAAQ;AAAA,QACjB;AAAA,MACF;AAAA,IACF,CAAC,GAAG;AAAA,MACF;AAAA,IACF,CAAC;AACD,aAAS,aAAa,GAAG;AAEvB,UAAI,OAAO,EAAE,MAAM,CAAC;AACpB,UAAI,OAAO,EAAE,MAAM,CAAC;AAEpB,UAAIkB,KAAIhB,UAAS,CAAC,IAAI,GAAG,OAAO;AAChC,UAAI,QAAQgB,GAAE;AACd,UAAI,IAAI,EAAE,MAAM;AAChB,UAAI,QAAQ,EAAE;AAGd,UAAIC,IAAG,GAAG;AACV,UAAI,IAAIlB,OAAM,CAAC,IAAI,GAAG,EAAE;AACxB,WAAK,IAAI,GAAG,IAAI,KAAK,IAAI,MAAM,IAAI,GAAG,EAAE,GAAG;AAyBzC,YAAI,QAAQ,MAAM,CAAC,EAAE,CAAC;AACtB,YAAI,MAAMO,YAAWJ,OAAM,OAAO,CAAC,IAAI,IAAIC,MAAK,KAAK,CAAC;AACtD,YAAI,UAAUE,MAAK,GAAG;AACtB,YAAI,eAAe;AACnB,aAAKY,KAAI,GAAGA,KAAI,MAAMA,MAAK;AACzB,yBAAeV,WAAU,cAAcE,gBAAe,MAAMQ,EAAC,EAAE,CAAC,GAAGZ,MAAK,MAAMY,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAAA,QACvF;AACA,YAAI,QAAQR,gBAAe,KAAKL,MAAK,YAAY,CAAC;AAClD,YAAI,CAACH,QAAO,KAAK,GAAG;AAElB,cAAI,KAAKS,gBAAe,OAAO,KAAK;AAGpC,YAAE,CAAC,IAAI;AACP,eAAKO,KAAI,IAAI,GAAGA,KAAI,MAAMA,MAAK;AAC7B,cAAEA,EAAC,IAAIT,cAAa,MAAMS,EAAC,EAAE,CAAC,GAAG,EAAE;AAAA,UACrC;AAGA,cAAIC,OAAMZ,YAAWD,MAAKG,cAAa,IAAI,KAAK,CAAC,CAAC;AAClD,cAAI,IAAI;AAcR,eAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AACzB,gBAAI;AAGJ,iBAAKS,KAAI,GAAGA,KAAI,MAAMA,MAAK;AACzB,kBAAIV,WAAU,GAAGE,gBAAeJ,MAAK,EAAEY,EAAC,CAAC,GAAG,MAAMA,EAAC,EAAE,CAAC,CAAC,CAAC;AAAA,YAC1D;AAGA,gBAAIR,gBAAe,GAAGS,IAAG;AACzB,iBAAKD,KAAI,GAAGA,KAAI,MAAMA,MAAK;AACzB,oBAAMA,EAAC,EAAE,CAAC,IAAIR,gBAAeC,gBAAe,MAAMO,EAAC,EAAE,CAAC,GAAGR,gBAAe,EAAEQ,EAAC,GAAG,CAAC,CAAC,GAAG,OAAO;AAAA,YAC5F;AAAA,UACF;AAQA,eAAKA,KAAI,GAAGA,KAAI,MAAMA,MAAK;AACzB,gBAAI;AAGJ,iBAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AACzB,kBAAIV,WAAU,GAAGE,gBAAe,MAAMQ,EAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AAAA,YACpD;AAGA,gBAAIR,gBAAe,GAAGS,IAAG;AACzB,iBAAK,IAAI,GAAG,IAAI,MAAM,EAAE,GAAG;AACzB,oBAAMD,EAAC,EAAE,CAAC,IAAIT,cAAaE,gBAAe,MAAMO,EAAC,EAAE,CAAC,GAAGR,gBAAe,GAAGJ,MAAK,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO;AAAA,YAChG;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAGA,aAAO;AAAA,QACL,GAAAW;AAAA,QACA;AAAA,QACA,UAAU,SAAS,WAAW;AAC5B,iBAAO,QAAQ,KAAK,EAAE,SAAS,IAAI,UAAU,KAAK,EAAE,SAAS;AAAA,QAC/D;AAAA,MACF;AAAA,IACF;AACA,aAAS,SAAS,GAAG;AACnB,UAAI,MAAM,aAAa,CAAC;AACxB,UAAI,QAAQ,IAAI,EAAE;AAClB,UAAI,EAAE,MAAM,SAAS,GAAG;AACtB,YAAI,OAAO,MAAM,CAAC,EAAE,CAAC,EAAE,SAAS,YAAYL,SAAQ,CAAC,IAAI;AACzD,iBAASM,KAAI,GAAGA,KAAI,MAAM,QAAQ,EAAEA,IAAG;AACrC,mBAAS,IAAI,GAAG,IAAIA,MAAK,KAAK,MAAM,CAAC,KAAK,CAAC,GAAG,QAAQ,EAAE,GAAG;AACzD,kBAAMA,EAAC,EAAE,CAAC,IAAI;AAAA,UAChB;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT;AACA,aAAS,UAAU,GAAG;AACpB,YAAM,IAAI,MAAM,4CAA4C;AAAA,IAC9D;AAAA,EACF,CAAC;;;AC/MM,WAAS,UAAU,GAAGE,OAAM,GAAG,QAAQ;AAE5C,QAAI,UAAU,EAAE;AAChB,QAAI,SAAS,EAAE;AACf,QAAI,OAAO,EAAE;AACb,QAAI,QAAQ,EAAE;AACd,QAAI,MAAM,EAAE;AAEZ,QAAI,IAAI,MAAM,CAAC;AACf,QAAI,IAAI,MAAM,CAAC;AAEf,QAAI,UAAU,UAAU,EAAE,UAAU,CAAC,IAAI;AACzC,QAAI,SAAS,CAAC;AACd,QAAI,OAAO,CAAC;AAEZ,QAAI,KAAK;AAET,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAE1B,WAAK,CAAC,IAAI;AAEV,UAAI,IAAI,IAAI,EAAE,CAAC,IAAI;AAEnB,eAAS,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5D,YAAI,IAAIA,QAAOA,MAAK,OAAO,CAAC,CAAC,IAAI,OAAO,CAAC;AAEzC,eAAO,EAAE,IAAI;AAEb,YAAI,SAAS;AACX,kBAAQ,EAAE,IAAI,QAAQ,CAAC;AAAA,QACzB;AAEA;AAAA,MACF;AAAA,IACF;AAEA,SAAK,CAAC,IAAI;AAEV,WAAO,EAAE,mBAAmB;AAAA,MAC1B,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,KAAK;AAAA,MACL,MAAM,CAAC,GAAG,CAAC;AAAA,MACX,UAAU;AAAA,IACZ,CAAC;AAAA,EACH;;;AC7CO,WAAS,OAAO,GAAG,GAAG,GAAG,MAAM,MAAM,MAAM,OAAO;AAEvD,QAAI,MAAM;AAEV,MAAE,KAAK,IAAI;AAEX,WAAO,OAAO,GAAG;AAEf,UAAI,IAAI,EAAE,QAAQ,GAAG;AAErB,UAAIC,KAAI,EAAE,OAAO,CAAC;AAClB,UAAIA,OAAM,IAAI;AAEZ;AAEA,aAAK,GAAG,IAAI;AAAA,MACd,OAAO;AAEL,UAAE,OAAO,CAAC,IAAI,EAAE,OAAOA,EAAC;AAExB,UAAE;AAEF,UAAE,QAAQ,GAAG,IAAIA;AAAA,MACnB;AAAA,IACF;AACA,WAAO;AAAA,EACT;;;AC9BO,WAAS,OAAO,QAAQ,GAAG;AAEhC,QAAI,CAAC,QAAQ;AACX,aAAO;AAAA,IACT;AAEA,QAAI,IAAI;AACR,QAAI;AAEJ,QAAI,OAAO,CAAC;AAEZ,QAAI,IAAI,CAAC;AACT,QAAI,OAAO;AACX,QAAI,OAAO;AACX,QAAI,QAAQ,IAAI;AAEhB,SAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AAEtB,QAAE,OAAO,CAAC,IAAI;AAAA,IAChB;AAEA,SAAK,IAAI,IAAI,GAAG,KAAK,GAAG,KAAK;AAE3B,UAAI,OAAO,CAAC,MAAM,IAAI;AACpB;AAAA,MACF;AAEA,QAAE,OAAO,CAAC,IAAI,EAAE,OAAO,OAAO,CAAC,CAAC;AAChC,QAAE,OAAO,OAAO,CAAC,CAAC,IAAI;AAAA,IACxB;AAEA,SAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AAEtB,UAAI,OAAO,CAAC,MAAM,IAAI;AACpB;AAAA,MACF;AAEA,UAAI,OAAO,GAAG,GAAG,GAAG,MAAM,MAAM,MAAM,KAAK;AAAA,IAC7C;AACA,WAAO;AAAA,EACT;;;ACxCO,WAAS,QAAQ,GAAG,KAAK;AAE9B,QAAI,CAAC,GAAG;AACN,aAAO;AAAA,IACT;AAEA,QAAI,SAAS,EAAE;AACf,QAAI,OAAO,EAAE;AACb,QAAI,QAAQ,EAAE;AAEd,QAAI,IAAI,MAAM,CAAC;AACf,QAAI,IAAI,MAAM,CAAC;AAGf,QAAI,SAAS,CAAC;AAGd,QAAI,IAAI,CAAC;AACT,QAAI,WAAW;AACf,QAAI,OAAO;AAEX,QAAIC,IAAG;AAGP,QAAI,KAAK;AAEP,WAAKA,KAAI,GAAGA,KAAI,GAAGA,MAAK;AACtB,UAAE,OAAOA,EAAC,IAAI;AAAA,MAChB;AAAA,IACF;AAEA,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAE1B,aAAO,CAAC,IAAI;AAEZ,QAAE,WAAW,CAAC,IAAI;AAElB,eAAS,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAE5D,YAAI,IAAI,OAAO,CAAC;AAEhB,QAAAA,KAAI,MAAM,EAAE,OAAO,CAAC,IAAI;AAExB,eAAOA,OAAM,MAAMA,KAAI,GAAGA,KAAI,OAAO;AAEnC,kBAAQ,EAAE,WAAWA,EAAC;AAEtB,YAAE,WAAWA,EAAC,IAAI;AAElB,cAAI,UAAU,IAAI;AAChB,mBAAOA,EAAC,IAAI;AAAA,UACd;AAAA,QACF;AACA,YAAI,KAAK;AACP,YAAE,OAAO,CAAC,IAAI;AAAA,QAChB;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;;;ACrDO,WAAS,QAAQ,GAAG,UAAU,OAAO;AAE1C,QAAI,UAAU,EAAE;AAChB,QAAI,SAAS,EAAE;AACf,QAAI,OAAO,EAAE;AACb,QAAI,QAAQ,EAAE;AAEd,QAAI,IAAI,MAAM,CAAC;AAEf,QAAI,KAAK;AAET,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAE1B,UAAI,IAAI,KAAK,CAAC;AAEd,WAAK,CAAC,IAAI;AACV,aAAO,IAAI,KAAK,IAAI,CAAC,GAAG,KAAK;AAE3B,YAAI,SAAS,OAAO,CAAC,GAAG,GAAG,UAAU,QAAQ,CAAC,IAAI,GAAG,KAAK,GAAG;AAE3D,iBAAO,EAAE,IAAI,OAAO,CAAC;AAErB,cAAI,SAAS;AACX,oBAAQ,EAAE,IAAI,QAAQ,CAAC;AAAA,UACzB;AAEA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,SAAK,CAAC,IAAI;AAEV,WAAO,OAAO,IAAI,OAAO,SAAS,EAAE;AAEpC,QAAI,SAAS;AACX,cAAQ,OAAO,IAAI,QAAQ,SAAS,EAAE;AAAA,IACxC;AAEA,WAAO;AAAA,EACT;;;AChDO,WAAS,OAAOC,IAAG;AAExB,WAAO,CAACA,KAAI;AAAA,EACd;;;ACLA,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO,YAAY,WAAW;AAC3C,MAAI,cAA6B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,KAAAC;AAAA,MACA,UAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AAUJ,WAAO,SAAS,MAAM,OAAO,GAAG;AAE9B,UAAI,CAAC,KAAK,SAAS,KAAK,QAAQ,GAAG;AACjC,eAAO;AAAA,MACT;AAEA,UAAI,QAAQ,EAAE;AAEd,UAAI,IAAI,MAAM,CAAC;AACf,UAAI,IAAI,MAAM,CAAC;AAEf,UAAI,QAAQ;AAEZ,UAAI,QAAQ,KAAK,IAAI,IAAI,KAAK,KAAK,KAAK,CAAC,CAAC;AAC1C,cAAQ,KAAK,IAAI,IAAI,GAAG,KAAK;AAE7B,UAAI,KAAK,oBAAoB,OAAO,GAAG,GAAG,GAAG,KAAK;AAElD,cAAQ,IAAI,OAAO,IAAI;AAEvB,UAAI,SAAS,GAAG;AAChB,UAAI,OAAO,GAAG;AAGd,UAAI,MAAM,KAAK,CAAC;AAGhB,UAAIC,KAAI,CAAC;AAGT,UAAI,IAAI,CAAC;AACT,UAAI,MAAM;AACV,UAAI,KAAK,IAAI;AACb,UAAI,OAAO,KAAK,IAAI;AACpB,UAAI,OAAO,KAAK,IAAI;AACpB,UAAI,OAAO,KAAK,IAAI;AACpB,UAAI,SAAS,KAAK,IAAI;AACtB,UAAI,IAAI,KAAK,IAAI;AACjB,UAAI,QAAQ,KAAK,IAAI;AAGrB,UAAI,OAAOA;AAGX,UAAI,OAAO,yBAAyB,GAAG,MAAM,GAAG,KAAK,MAAM,MAAM,MAAM,OAAO,IAAI,GAAG,MAAM,MAAM;AAGjG,UAAI,MAAM,uBAAuB,GAAG,MAAM,GAAG,QAAQ,MAAM,GAAG,OAAO,IAAI,MAAM,MAAM,IAAI;AAGzF,UAAI,SAAS;AAGb,UAAIC,IAAG,GAAG,GAAG,IAAI,IAAIC,IAAG,IAAIC,KAAI,KAAK,IAAI,KAAK,IAAI,IAAI,IAAI,GAAG;AAG7D,aAAO,MAAM,GAAG;AAId,aAAK,IAAI,IAAI,SAAS,MAAM,IAAI,EAAE,OAAO,MAAM,OAAO,IAAI,SAAS;AACnE,YAAI,EAAE,OAAO,CAAC,MAAM,IAAI;AACtB,eAAK,EAAE,OAAO,CAAC,CAAC,IAAI;AAAA,QACtB;AAEA,UAAE,OAAO,MAAM,IAAI,EAAE,OAAO,CAAC;AAE7B,YAAI,QAAQ,EAAE,OAAO,CAAC;AAEtB,YAAI,MAAM,EAAE,KAAK,CAAC;AAElB,eAAO;AAKP,YAAI,KAAK;AAET,UAAE,KAAK,CAAC,IAAI,CAAC;AACb,YAAI,IAAI,KAAK,CAAC;AAEd,YAAI,MAAM,UAAU,IAAI,IAAI;AAC5B,YAAI,MAAM;AACV,aAAK,KAAK,GAAG,MAAM,QAAQ,GAAG,MAAM;AAClC,cAAI,KAAK,OAAO;AAEd,YAAAD,KAAI;AAEJ,iBAAK;AAEL,YAAAC,MAAK,EAAE,MAAM,CAAC,IAAI;AAAA,UACpB,OAAO;AAEL,YAAAD,KAAI,OAAO,GAAG;AACd,iBAAK,KAAKA,EAAC;AAEX,YAAAC,MAAK,EAAE,MAAMD,EAAC;AAAA,UAChB;AACA,eAAK,KAAK,GAAG,MAAMC,KAAI,MAAM;AAC3B,YAAAF,KAAI,OAAO,IAAI;AAEf,iBAAK,MAAM,EAAE,KAAKA,EAAC,MAAM,GAAG;AAC1B;AAAA,YACF;AAEA,kBAAM;AAEN,cAAE,KAAKA,EAAC,IAAI,CAAC;AAEb,mBAAO,KAAK,IAAIA;AAChB,gBAAI,EAAE,OAAOA,EAAC,MAAM,IAAI;AACtB,mBAAK,EAAE,OAAOA,EAAC,CAAC,IAAI,KAAKA,EAAC;AAAA,YAC5B;AAEA,gBAAI,KAAKA,EAAC,MAAM,IAAI;AAClB,gBAAE,OAAO,KAAKA,EAAC,CAAC,IAAI,EAAE,OAAOA,EAAC;AAAA,YAChC,OAAO;AACL,gBAAE,OAAO,EAAE,SAASA,EAAC,CAAC,IAAI,EAAE,OAAOA,EAAC;AAAA,YACtC;AAAA,UACF;AACA,cAAIC,OAAM,GAAG;AAEX,iBAAKA,EAAC,IAAI,OAAO,CAAC;AAElB,cAAE,IAAIA,EAAC,IAAI;AAAA,UACb;AAAA,QACF;AAEA,YAAI,UAAU,GAAG;AACf,gBAAM;AAAA,QACR;AAEA,UAAE,SAAS,CAAC,IAAI;AAEhB,aAAK,CAAC,IAAI;AACV,UAAE,MAAM,CAAC,IAAI,MAAM;AAEnB,UAAE,OAAO,CAAC,IAAI;AAMd,eAAO,QAAQ,MAAM,OAAO,GAAG,GAAG,CAAC;AAEnC,aAAK,KAAK,KAAK,KAAK,KAAK,MAAM;AAC7B,UAAAD,KAAI,OAAO,EAAE;AAEb,eAAK,MAAM,EAAE,OAAOA,EAAC,MAAM,GAAG;AAC5B;AAAA,UACF;AAEA,gBAAM,CAAC,EAAE,KAAKA,EAAC;AACf,cAAI,OAAO,OAAO;AAElB,eAAK,IAAI,KAAKA,EAAC,GAAG,KAAK,KAAKA,EAAC,IAAI,MAAM,GAAG,KAAK,IAAI,KAAK;AACtD,YAAAC,KAAI,OAAO,CAAC;AACZ,gBAAI,EAAE,IAAIA,EAAC,KAAK,MAAM;AAEpB,gBAAE,IAAIA,EAAC,KAAK;AAAA,YACd,WAAW,EAAE,IAAIA,EAAC,MAAM,GAAG;AAEzB,gBAAE,IAAIA,EAAC,IAAI,EAAE,SAASA,EAAC,IAAI;AAAA,YAC7B;AAAA,UACF;AAAA,QACF;AAOA,aAAK,KAAK,KAAK,KAAK,KAAK,MAAM;AAE7B,UAAAD,KAAI,OAAO,EAAE;AACb,eAAK,KAAKA,EAAC;AACX,eAAK,KAAK,EAAE,OAAOA,EAAC,IAAI;AACxB,eAAK;AAEL,eAAK,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI,KAAK,IAAI,KAAK;AACvC,YAAAC,KAAI,OAAO,CAAC;AAEZ,gBAAI,EAAE,IAAIA,EAAC,MAAM,GAAG;AAElB,kBAAI,OAAO,EAAE,IAAIA,EAAC,IAAI;AACtB,kBAAI,OAAO,GAAG;AAEZ,qBAAK;AAEL,uBAAO,IAAI,IAAIA;AAEf,qBAAKA;AAAA,cACP,OAAO;AAEL,qBAAKA,EAAC,IAAI,OAAO,CAAC;AAElB,kBAAE,IAAIA,EAAC,IAAI;AAAA,cACb;AAAA,YACF;AAAA,UACF;AAEA,YAAE,OAAOD,EAAC,IAAI,KAAK,KAAK;AACxB,cAAI,KAAK;AACT,cAAI,KAAK,KAAK,EAAE,MAAMA,EAAC;AAEvB,eAAK,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK;AAC5B,gBAAI,OAAO,CAAC;AAEZ,gBAAI,MAAM,EAAE,KAAK,CAAC;AAClB,gBAAI,OAAO,GAAG;AACZ;AAAA,YACF;AAEA,iBAAK;AAEL,mBAAO,IAAI,IAAI;AAEf,iBAAK;AAAA,UACP;AAEA,cAAI,MAAM,GAAG;AAEX,iBAAKA,EAAC,IAAI,OAAO,CAAC;AAClB,kBAAM,CAAC,EAAE,KAAKA,EAAC;AAEf,kBAAM;AAEN,mBAAO;AACP,mBAAO;AACP,cAAE,KAAKA,EAAC,IAAI;AAEZ,cAAE,OAAOA,EAAC,IAAI;AAAA,UAChB,OAAO;AAEL,cAAE,SAASA,EAAC,IAAI,KAAK,IAAI,EAAE,SAASA,EAAC,GAAG,CAAC;AAEzC,mBAAO,EAAE,IAAI,OAAO,EAAE;AAEtB,mBAAO,EAAE,IAAI,OAAO,EAAE;AAEtB,mBAAO,EAAE,IAAI;AAEb,cAAE,MAAMA,EAAC,IAAI,KAAK,KAAK;AAEvB,iBAAK,IAAI,IAAI,CAAC,IAAI,KAAK;AAEvB,cAAE,OAAOA,EAAC,IAAI,EAAE,QAAQ,CAAC;AACzB,cAAE,QAAQ,CAAC,IAAIA;AAEf,iBAAKA,EAAC,IAAI;AAAA,UACZ;AAAA,QACF;AAEA,UAAE,SAAS,CAAC,IAAI;AAChB,gBAAQ,KAAK,IAAI,OAAO,EAAE;AAE1B,eAAO,QAAQ,OAAO,OAAO,OAAO,GAAG,GAAG,CAAC;AAI3C,aAAK,KAAK,KAAK,KAAK,KAAK,MAAM;AAC7B,UAAAA,KAAI,OAAO,EAAE;AAEb,cAAI,EAAE,KAAKA,EAAC,KAAK,GAAG;AAClB;AAAA,UACF;AAEA,cAAI,KAAKA,EAAC;AACV,UAAAA,KAAI,EAAE,QAAQ,CAAC;AAEf,YAAE,QAAQ,CAAC,IAAI;AACf,iBAAOA,OAAM,MAAM,EAAE,OAAOA,EAAC,MAAM,IAAIA,KAAI,EAAE,OAAOA,EAAC,GAAG,QAAQ;AAC9D,YAAAE,MAAK,EAAE,MAAMF,EAAC;AACd,kBAAM,EAAE,OAAOA,EAAC;AAChB,iBAAK,IAAI,KAAKA,EAAC,IAAI,GAAG,KAAK,KAAKA,EAAC,IAAIE,MAAK,GAAG,KAAK;AAChD,gBAAE,IAAI,OAAO,CAAC,CAAC,IAAI;AAAA,YACrB;AACA,gBAAI,QAAQF;AAEZ,iBAAK,IAAI,EAAE,OAAOA,EAAC,GAAG,MAAM,MAAK;AAC/B,kBAAI,KAAK,EAAE,MAAM,CAAC,MAAME,OAAM,EAAE,OAAO,CAAC,MAAM;AAC9C,mBAAK,IAAI,KAAK,CAAC,IAAI,GAAG,MAAM,KAAK,KAAK,CAAC,IAAIA,MAAK,GAAG,KAAK;AAEtD,oBAAI,EAAE,IAAI,OAAO,CAAC,CAAC,MAAM,MAAM;AAC7B,uBAAK;AAAA,gBACP;AAAA,cACF;AAEA,kBAAI,IAAI;AAEN,qBAAK,CAAC,IAAI,OAAOF,EAAC;AAClB,kBAAE,KAAKA,EAAC,KAAK,EAAE,KAAK,CAAC;AACrB,kBAAE,KAAK,CAAC,IAAI;AAEZ,kBAAE,OAAO,CAAC,IAAI;AAEd,oBAAI,EAAE,OAAO,CAAC;AACd,kBAAE,OAAO,KAAK,IAAI;AAAA,cACpB,OAAO;AAEL,wBAAQ;AACR,oBAAI,EAAE,OAAO,CAAC;AAAA,cAChB;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAIA,aAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,MAAM;AACtC,UAAAA,KAAI,OAAO,EAAE;AAEb,eAAK,MAAM,CAAC,EAAE,KAAKA,EAAC,MAAM,GAAG;AAC3B;AAAA,UACF;AAEA,YAAE,KAAKA,EAAC,IAAI;AAEZ,cAAI,EAAE,SAASA,EAAC,IAAI,KAAK;AACzB,cAAI,KAAK,IAAI,GAAG,IAAI,MAAM,GAAG;AAC7B,cAAI,EAAE,OAAO,CAAC,MAAM,IAAI;AACtB,iBAAK,EAAE,OAAO,CAAC,CAAC,IAAIA;AAAA,UACtB;AAEA,YAAE,OAAOA,EAAC,IAAI,EAAE,OAAO,CAAC;AACxB,eAAKA,EAAC,IAAI;AACV,YAAE,OAAO,CAAC,IAAIA;AAEd,mBAAS,KAAK,IAAI,QAAQ,CAAC;AAC3B,YAAE,SAASA,EAAC,IAAI;AAEhB,iBAAO,GAAG,IAAIA;AAAA,QAChB;AAEA,UAAE,KAAK,CAAC,IAAI;AAEZ,aAAK,EAAE,MAAM,CAAC,IAAI,IAAI,SAAS,GAAG;AAEhC,eAAK,CAAC,IAAI;AAEV,YAAE,IAAI,CAAC,IAAI;AAAA,QACb;AACA,YAAI,UAAU,GAAG;AAEf,gBAAM;AAAA,QACR;AAAA,MACF;AAQA,WAAKA,KAAI,GAAGA,KAAI,GAAGA,MAAK;AACtB,aAAKA,EAAC,IAAI,OAAO,KAAKA,EAAC,CAAC;AAAA,MAC1B;AACA,WAAK,IAAI,GAAG,KAAK,GAAG,KAAK;AACvB,UAAE,OAAO,CAAC,IAAI;AAAA,MAChB;AAEA,WAAK,IAAI,GAAG,KAAK,GAAG,KAAK;AAEvB,YAAI,EAAE,KAAK,CAAC,IAAI,GAAG;AACjB;AAAA,QACF;AAEA,UAAE,OAAO,CAAC,IAAI,EAAE,OAAO,KAAK,CAAC,CAAC;AAC9B,UAAE,OAAO,KAAK,CAAC,CAAC,IAAI;AAAA,MACtB;AAEA,WAAKC,KAAI,GAAGA,MAAK,GAAGA,MAAK;AAEvB,YAAI,EAAE,KAAKA,EAAC,KAAK,GAAG;AAClB;AAAA,QACF;AACA,YAAI,KAAKA,EAAC,MAAM,IAAI;AAElB,YAAE,OAAOA,EAAC,IAAI,EAAE,OAAO,KAAKA,EAAC,CAAC;AAC9B,YAAE,OAAO,KAAKA,EAAC,CAAC,IAAIA;AAAA,QACtB;AAAA,MACF;AAEA,WAAK,IAAI,GAAGD,KAAI,GAAGA,MAAK,GAAGA,MAAK;AAC9B,YAAI,KAAKA,EAAC,MAAM,IAAI;AAClB,cAAI,OAAOA,IAAG,GAAG,GAAG,MAAM,MAAMD,IAAG,CAAC;AAAA,QACtC;AAAA,MACF;AAEA,MAAAA,GAAE,OAAOA,GAAE,SAAS,GAAG,CAAC;AAExB,aAAOA;AAAA,IACT;AAqBA,aAAS,oBAAoB,OAAO,GAAG,GAAG,GAAG,OAAO;AAElD,UAAI,KAAKD,WAAU,CAAC;AAGpB,UAAI,UAAU,KAAK,MAAM,GAAG;AAE1B,eAAOF,KAAI,GAAG,EAAE;AAAA,MAClB;AAGA,UAAI,UAAU,GAAG;AAEf,YAAI,SAAS,GAAG;AAChB,YAAI,OAAO,GAAG;AAEd,YAAI,KAAK;AAET,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAE1B,cAAI,IAAI,KAAK,CAAC;AAEd,eAAK,CAAC,IAAI;AAEV,cAAI,KAAK,IAAI,CAAC,IAAI,IAAI,OAAO;AAC3B;AAAA,UACF;AAEA,mBAAS,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,KAAK;AACtC,mBAAO,IAAI,IAAI,OAAO,CAAC;AAAA,UACzB;AAAA,QACF;AAEA,aAAK,CAAC,IAAI;AAEV,YAAIE,WAAU,EAAE;AAEhB,eAAOD,UAAS,IAAI,CAAC;AAAA,MACvB;AAGA,aAAOA,UAAS,IAAI,CAAC;AAAA,IACvB;AAUA,aAAS,yBAAyB,GAAG,MAAM,GAAG,KAAK,MAAM,MAAM,MAAM,OAAO,IAAI,GAAG,MAAM,QAAQ;AAE/F,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAE,MAAM,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,CAAC;AAAA,MACnC;AACA,QAAE,MAAM,CAAC,IAAI;AAEb,eAASG,KAAI,GAAGA,MAAK,GAAGA,MAAK;AAE3B,UAAE,OAAOA,EAAC,IAAI;AACd,aAAKA,EAAC,IAAI;AACV,UAAE,OAAOA,EAAC,IAAI;AAEd,UAAE,QAAQA,EAAC,IAAI;AAEf,UAAE,KAAKA,EAAC,IAAI;AAEZ,UAAE,IAAIA,EAAC,IAAI;AAEX,UAAE,OAAOA,EAAC,IAAI;AAEd,UAAE,SAASA,EAAC,IAAI,EAAE,MAAMA,EAAC;AAAA,MAC3B;AAEA,UAAI,OAAO,QAAQ,GAAG,GAAG,GAAG,GAAG,CAAC;AAEhC,QAAE,OAAO,CAAC,IAAI;AAEd,WAAK,CAAC,IAAI;AAEV,QAAE,IAAI,CAAC,IAAI;AAEX,aAAO;AAAA,IACT;AAOA,aAAS,uBAAuB,GAAG,MAAM,GAAG,QAAQ,MAAM,GAAG,OAAO,IAAI,MAAM,MAAM,MAAM;AAExF,UAAI,MAAM;AAEV,eAASA,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAE1B,YAAI,IAAI,EAAE,SAASA,EAAC;AAEpB,YAAI,MAAM,GAAG;AAEX,YAAE,OAAOA,EAAC,IAAI;AACd;AAEA,eAAKA,EAAC,IAAI;AACV,YAAE,IAAIA,EAAC,IAAI;AAAA,QACb,WAAW,IAAI,OAAO;AAEpB,YAAE,KAAKA,EAAC,IAAI;AAEZ,YAAE,OAAOA,EAAC,IAAI;AACd;AACA,eAAKA,EAAC,IAAI,OAAO,CAAC;AAClB,YAAE,KAAK,CAAC;AAAA,QACV,OAAO;AACL,cAAI,IAAI,EAAE,OAAO,CAAC;AAClB,cAAI,MAAM,IAAI;AACZ,iBAAK,CAAC,IAAIA;AAAA,UACZ;AAEA,YAAE,OAAOA,EAAC,IAAI,EAAE,OAAO,CAAC;AACxB,YAAE,OAAO,CAAC,IAAIA;AAAA,QAChB;AAAA,MACF;AACA,aAAO;AAAA,IACT;AACA,aAAS,QAAQ,MAAM,OAAO,GAAG,GAAG,GAAG;AACrC,UAAI,OAAO,KAAK,OAAO,QAAQ,GAAG;AAChC,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,cAAI,EAAE,IAAI,CAAC,MAAM,GAAG;AAClB,cAAE,IAAI,CAAC,IAAI;AAAA,UACb;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAEA,aAAO;AAAA,IACT;AACA,aAAS,MAAMA,IAAG,GAAG;AACnB,aAAOA,OAAM;AAAA,IACf;AAAA,EACF,CAAC;;;ACjjBM,WAAS,OAAOG,IAAG,GAAG,GAAG,OAAO,UAAU,UAAU,UAAU;AACnE,QAAI,GAAG;AAGP,QAAI,QAAQ;AACZ,QAAI;AAGJ,QAAIA,MAAK,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,WAAWA,EAAC,GAAG;AAC7C,aAAO;AAAA,IACT;AAEA,MAAE,WAAWA,EAAC,IAAI,EAAE,QAAQ,CAAC;AAE7B,QAAI,QAAQ,EAAE,WAAWA,EAAC;AAC1B,MAAE,WAAWA,EAAC,IAAI;AAGlB,QAAI,UAAU,IAAI;AAEhB,cAAQ;AACR,UAAIA;AAAA,IACN,OAAO;AAEL,cAAQ;AAER,WAAK,IAAI,OAAO,MAAM,EAAE,WAAW,CAAC,GAAG,IAAI,EAAE,WAAW,CAAC,EAAE;AAC3D,WAAK,IAAI,OAAO,MAAM,GAAG,IAAI,SAAS;AAEpC,kBAAU,EAAE,WAAW,CAAC;AACxB,UAAE,WAAW,CAAC,IAAI;AAAA,MACpB;AAAA,IACF;AACA,WAAO;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA,EACF;;;AClDA,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,WAAW;AACxB,MAAI,iBAAgC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC7E,QAAI;AAAA,MACF,WAAAC;AAAA,IACF,IAAI;AAWJ,WAAO,SAAU,GAAG,QAAQ,MAAM,KAAK;AAErC,UAAI,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM;AAC1B,eAAO;AAAA,MACT;AAEA,UAAI,QAAQ,EAAE;AAEd,UAAI,IAAI,MAAM,CAAC;AACf,UAAI,IAAI,MAAM,CAAC;AAEf,UAAIC,IAAG,GAAG,GAAG,GAAG,GAAG,IAAI;AAGvB,UAAI,IAAI,IAAI,KAAK,MAAM,IAAI,IAAI,IAAI;AAEnC,UAAI,IAAI,CAAC;AACT,UAAI,WAAW;AACf,UAAI,WAAW;AACf,UAAI,WAAW,IAAI;AACnB,UAAI,QAAQ,IAAI;AAChB,UAAI,OAAO,IAAI;AACf,UAAI,OAAO,IAAI,IAAI;AAEnB,WAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AACtB,UAAE,CAAC,IAAI;AAAA,MACT;AAGA,UAAI,WAAW,CAAC;AAGhB,UAAI,KAAKD,WAAU,CAAC;AAEpB,UAAI,SAAS,GAAG;AAChB,UAAI,OAAO,GAAG;AAGd,WAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AACtB,YAAI,KAAK,CAAC;AAEV,iBAAS,CAAC,IAAI,EAAE,QAAQ,CAAC,MAAM,KAAK,IAAI;AACxC,eAAO,MAAM,MAAM,EAAE,QAAQ,CAAC,MAAM,IAAI,IAAI,OAAO,CAAC,GAAG;AACrD,YAAE,QAAQ,CAAC,IAAI;AAAA,QACjB;AAAA,MACF;AAGA,UAAI,KAAK;AAEP,aAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AACtB,YAAE,KAAK,CAAC,CAAC,IAAI;AAAA,QACf;AAEA,aAAKC,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAEtB,eAAK,IAAI,GAAG,KAAK,KAAKA,EAAC,GAAG,KAAK,KAAKA,KAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAC/D,gBAAI,KAAK,IAAI,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC;AAAA,UAC9B;AAEA,YAAE,OAAOA,EAAC,IAAI,EAAE,OAAO,CAAC;AACxB,YAAE,OAAO,CAAC,IAAIA;AAAA,QAChB;AAAA,MACF;AAGA,WAAKA,KAAI,GAAGA,KAAI,GAAGA,MAAK;AACtB,UAAE,WAAWA,EAAC,IAAIA;AAAA,MACpB;AACA,WAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AAEtB,YAAI,KAAK,CAAC;AAEV,YAAI,OAAO,CAAC,MAAM,IAAI;AACpB,mBAAS,OAAO,CAAC,CAAC;AAAA,QACpB;AAGA,aAAK,IAAI,MAAM,EAAE,OAAO,CAAC,IAAI,GAAG,MAAM,IAAI,IAAI,MAAM,EAAE,OAAO,CAAC,IAAI,IAAI;AACpE,eAAK,IAAI,KAAK,CAAC,GAAG,IAAI,KAAK,IAAI,CAAC,GAAG,KAAK;AACtC,YAAAA,KAAI,OAAO,CAAC;AACZ,gBAAI,IAAI,OAAOA,IAAG,GAAG,GAAG,OAAO,UAAU,UAAU,QAAQ;AAE3D,gBAAI,EAAE,SAAS,GAAG;AAChB,uBAAS,CAAC;AAAA,YACZ;AAEA,gBAAI,EAAE,UAAU,GAAG;AACjB,uBAAS,EAAE,CAAC;AAAA,YACd;AAAA,UACF;AAAA,QACF;AACA,YAAI,OAAO,CAAC,MAAM,IAAI;AACpB,YAAE,WAAW,CAAC,IAAI,OAAO,CAAC;AAAA,QAC5B;AAAA,MACF;AAEA,WAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AACtB,YAAI,OAAO,CAAC,MAAM,IAAI;AACpB,mBAAS,OAAO,CAAC,CAAC,KAAK,SAAS,CAAC;AAAA,QACnC;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,EACF,CAAC;;;ACpHD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO,YAAY,WAAW;AAC3C,MAAI,cAA6B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,KAAAC;AAAA,MACA,UAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AACJ,QAAI,QAAQ,YAAY;AAAA,MACtB,KAAAF;AAAA,MACA,UAAAC;AAAA,MACA,WAAAC;AAAA,IACF,CAAC;AACD,QAAI,WAAW,eAAe;AAAA,MAC5B,WAAAA;AAAA,IACF,CAAC;AAYD,WAAO,SAAS,MAAM,OAAO,GAAGC,KAAI;AAElC,UAAI,OAAO,EAAE;AACb,UAAI,QAAQ,EAAE;AAEd,UAAI,IAAI,MAAM,CAAC;AAEf,UAAI;AAEJ,UAAI,IAAI,CAAC;AAET,QAAE,IAAI,MAAM,OAAO,CAAC;AAEpB,UAAI,SAAS,CAAC,EAAE,GAAG;AACjB,eAAO;AAAA,MACT;AAEA,UAAIA,KAAI;AAEN,YAAI,IAAI,QAAQ,UAAU,GAAG,MAAM,EAAE,GAAG,CAAC,IAAI;AAE7C,UAAE,SAAS,QAAQ,GAAG,CAAC;AAEvB,YAAI,OAAO,OAAO,EAAE,QAAQ,CAAC;AAE7B,UAAE,KAAK,SAAS,GAAG,EAAE,QAAQ,MAAM,CAAC;AAEpC,YAAI,KAAK,EAAE,UAAU,EAAE,MAAM,QAAQ,GAAG,CAAC,GAAG;AAE1C,eAAK,EAAE,MAAM,GAAG,IAAI,GAAG,IAAI,GAAG,KAAK;AACjC,cAAE,OAAO,EAAE,GAAG,CAAC;AAAA,UACjB;AAAA,QACF;AAAA,MACF,OAAO;AAEL,UAAE,MAAM,IAAI,KAAK,CAAC,IAAI;AACtB,UAAE,MAAM,EAAE;AAAA,MACZ;AAEA,aAAO;AAAA,IACT;AAKA,aAAS,QAAQ,GAAG,GAAG;AAErB,UAAI,OAAO,EAAE;AACb,UAAI,SAAS,EAAE;AACf,UAAI,QAAQ,EAAE;AAEd,UAAI,IAAI,MAAM,CAAC;AACf,UAAI,IAAI,MAAM,CAAC;AAEf,QAAE,OAAO,CAAC;AACV,QAAE,WAAW,CAAC;AAEd,UAAI,SAAS,EAAE;AACf,UAAIC,QAAO,EAAE;AACb,UAAI,WAAW,EAAE;AAEjB,UAAI,IAAI,CAAC;AACT,UAAI,OAAO;AACX,UAAI,OAAO;AACX,UAAI,OAAO,IAAI;AACf,UAAI,OAAO,IAAI,IAAI;AAEnB,UAAIC,IAAG,GAAG,GAAG,IAAI;AAEjB,WAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AAEtB,UAAE,OAAO,CAAC,IAAI;AACd,UAAE,OAAO,CAAC,IAAI;AACd,UAAE,OAAO,CAAC,IAAI;AAAA,MAChB;AAEA,WAAKA,KAAI,GAAGA,KAAI,GAAGA,MAAK;AACtB,iBAASA,EAAC,IAAI;AAAA,MAChB;AAEA,WAAK,IAAI,IAAI,GAAG,KAAK,GAAG,KAAK;AAE3B,aAAK,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAExD,mBAAS,OAAO,CAAC,CAAC,IAAI;AAAA,QACxB;AAAA,MACF;AAEA,WAAKA,KAAI,IAAI,GAAGA,MAAK,GAAGA,MAAK;AAE3B,QAAAD,MAAKC,EAAC,IAAI;AACV,YAAI,SAASA,EAAC;AAEd,YAAI,MAAM,IAAI;AACZ;AAAA,QACF;AAEA,YAAI,EAAE,OAAO,CAAC,QAAQ,GAAG;AACvB,YAAE,OAAO,CAAC,IAAIA;AAAA,QAChB;AAEA,UAAE,OAAOA,EAAC,IAAI,EAAE,OAAO,CAAC;AACxB,UAAE,OAAO,CAAC,IAAIA;AAAA,MAChB;AACA,QAAE,MAAM;AACR,QAAE,KAAK;AAEP,WAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AAEtB,QAAAA,KAAI,EAAE,OAAO,CAAC;AAEd,UAAE;AAEF,YAAIA,KAAI,GAAG;AACT,UAAAA,KAAI,EAAE;AAAA,QACR;AAEA,QAAAD,MAAKC,EAAC,IAAI;AAEV,YAAI,EAAE,KAAK,CAAC,KAAK,GAAG;AAClB;AAAA,QACF;AAEA,UAAE,OAAO,EAAE,OAAO,CAAC;AAEnB,YAAI,KAAK,OAAO,CAAC;AACjB,YAAI,OAAO,IAAI;AACb,cAAI,EAAE,OAAO,EAAE,MAAM,GAAG;AACtB,cAAE,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC;AAAA,UAC3B;AACA,YAAE,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE;AACnC,YAAE,OAAO,EAAE,IAAI,EAAE,OAAOA,EAAC;AACzB,YAAE,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC;AAAA,QAC5B;AAAA,MACF;AACA,WAAKA,KAAI,GAAGA,KAAI,GAAGA,MAAK;AACtB,YAAID,MAAKC,EAAC,IAAI,GAAG;AACf,UAAAD,MAAKC,EAAC,IAAI;AAAA,QACZ;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,EACF,CAAC;;;ACxKM,WAAS,SAAS,GAAG,GAAG;AAE7B,WAAO,EAAE,CAAC,IAAI;AAAA,EAChB;;;ACDO,WAAS,OAAO,GAAG,GAAG;AAE3B,MAAE,CAAC,IAAI,OAAO,EAAE,CAAC,CAAC;AAAA,EACpB;;;ACLO,WAAS,SAASC,IAAG;AAE1B,WAAOA,KAAI,IAAI,OAAOA,EAAC,IAAIA;AAAA,EAC7B;;;ACQO,WAAS,MAAM,GAAG,GAAG,KAAK,IAAIC,OAAM;AAEzC,QAAIC,SAAQ,EAAE;AACd,QAAI,MAAM,EAAE;AACZ,QAAIC,QAAO,EAAE;AAEb,QAAI,IAAIA,MAAK,CAAC;AAEd,QAAIC,IAAG,GAAG;AAEV,QAAI,OAAO;AAEX,OAAG,CAAC,IAAI;AAER,WAAO,QAAQ,GAAG;AAEhB,UAAI,GAAG,IAAI;AAEX,UAAI,OAAOH,QAAOA,MAAK,CAAC,IAAI;AAE5B,UAAI,CAAC,SAAS,KAAK,CAAC,GAAG;AAErB,eAAO,KAAK,CAAC;AAEb,WAAG,IAAI,IAAI,IAAI,OAAO,IAAI,IAAI,SAAS,IAAI,IAAI,CAAC;AAAA,MAClD;AAEA,UAAI,OAAO;AAEX,WAAK,IAAI,GAAG,IAAI,IAAI,GAAG,KAAK,OAAO,IAAI,IAAI,SAAS,IAAI,OAAO,CAAC,CAAC,GAAG,IAAI,IAAI,KAAK;AAE/E,QAAAG,KAAIF,OAAM,CAAC;AAEX,YAAI,SAAS,KAAKE,EAAC,GAAG;AACpB;AAAA,QACF;AAEA,WAAG,IAAI,IAAI,IAAI;AAEf,WAAG,EAAE,IAAI,IAAIA;AAEb,eAAO;AAEP;AAAA,MACF;AAEA,UAAI,MAAM;AAER;AAEA,WAAG,EAAE,GAAG,IAAI;AAAA,MACd;AAAA,IACF;AACA,WAAO;AAAA,EACT;;;ACrDO,WAAS,QAAQ,GAAG,GAAG,GAAG,IAAIC,OAAM;AAEzC,QAAI,OAAO,EAAE;AACb,QAAI,QAAQ,EAAE;AAEd,QAAI,SAAS,EAAE;AACf,QAAI,OAAO,EAAE;AAEb,QAAI,IAAI,MAAM,CAAC;AAEf,QAAI,GAAG,IAAI;AAEX,QAAI,MAAM;AAEV,SAAK,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AAExD,UAAIC,KAAI,OAAO,CAAC;AAEhB,UAAI,CAAC,SAAS,MAAMA,EAAC,GAAG;AAEtB,cAAM,MAAMA,IAAG,GAAG,KAAK,IAAID,KAAI;AAAA,MACjC;AAAA,IACF;AAEA,SAAK,IAAI,KAAK,IAAI,GAAG,KAAK;AAExB,aAAO,MAAM,GAAG,CAAC,CAAC;AAAA,IACpB;AACA,WAAO;AAAA,EACT;;;AC9CA,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,gBAAgB,YAAY,UAAU;AACnD,MAAI,kBAAiC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,cAAAC;AAAA,MACA,UAAAC;AAAA,MACA,UAAAC;AAAA,IACF,IAAI;AAkBJ,WAAO,SAAS,UAAU,GAAG,GAAG,GAAG,IAAI,GAAGC,OAAM,IAAI;AAElD,UAAI,UAAU,EAAE;AAChB,UAAI,SAAS,EAAE;AACf,UAAI,OAAO,EAAE;AACb,UAAI,QAAQ,EAAE;AAEd,UAAI,IAAI,MAAM,CAAC;AAEf,UAAI,UAAU,EAAE;AAChB,UAAI,SAAS,EAAE;AACf,UAAI,OAAO,EAAE;AAEb,UAAI,GAAG,IAAI,IAAI;AAEf,UAAI,MAAM,QAAQ,GAAG,GAAG,GAAG,IAAIA,KAAI;AAEnC,WAAK,IAAI,KAAK,IAAI,GAAG,KAAK;AACxB,UAAE,GAAG,CAAC,CAAC,IAAI;AAAA,MACb;AAEA,WAAK,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,KAAK;AACxD,UAAE,OAAO,CAAC,CAAC,IAAI,QAAQ,CAAC;AAAA,MAC1B;AAEA,eAAS,KAAK,KAAK,KAAK,GAAG,MAAM;AAE/B,YAAI,IAAI,GAAG,EAAE;AAEb,YAAI,IAAIA,QAAOA,MAAK,CAAC,IAAI;AAEzB,YAAI,IAAI,GAAG;AACT;AAAA,QACF;AAEA,aAAK,KAAK,CAAC;AACX,aAAK,KAAK,IAAI,CAAC;AAEf,UAAE,CAAC,IAAIH,cAAa,EAAE,CAAC,GAAG,QAAQ,KAAK,KAAK,KAAK,CAAC,CAAC;AAEnD,YAAI,KAAK,KAAK,IAAI;AAClB,YAAI,KAAK,KAAK,KAAK;AAEnB,eAAO,IAAI,GAAG,KAAK;AAEjB,cAAII,KAAI,OAAO,CAAC;AAEhB,YAAEA,EAAC,IAAIF,UAAS,EAAEE,EAAC,GAAGH,UAAS,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AAAA,QAClD;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAAA,EACF,CAAC;;;AC7ED,MAAII,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO,gBAAgB,YAAY,YAAY,UAAU,YAAY,cAAc;AAChG,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,KAAAC;AAAA,MACA,cAAAC;AAAA,MACA,UAAAC;AAAA,MACA,UAAAC;AAAA,MACA,QAAAC;AAAA,MACA,UAAAC;AAAA,MACA,cAAAC;AAAA,IACF,IAAI;AACJ,QAAI,YAAY,gBAAgB;AAAA,MAC9B,cAAAL;AAAA,MACA,UAAAC;AAAA,MACA,UAAAC;AAAA,IACF,CAAC;AAeD,WAAO,SAAS,KAAK,GAAG,GAAG,KAAK;AAE9B,UAAI,CAAC,GAAG;AACN,eAAO;AAAA,MACT;AAEA,UAAII,QAAO,EAAE;AAEb,UAAI,IAAIA,MAAK,CAAC;AAEd,UAAI;AACJ,UAAI,MAAM;AACV,UAAI,MAAM;AAEV,UAAI,GAAG;AACL,YAAI,EAAE;AACN,cAAM,EAAE,OAAO;AACf,cAAM,EAAE,OAAO;AAAA,MACjB;AAEA,UAAI,UAAU,CAAC;AACf,UAAI,SAAS,CAAC;AACd,UAAI,OAAO,CAAC;AAEZ,UAAI,IAAI,IAAID,cAAa;AAAA,QACvB,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,KAAK;AAAA,QACL,MAAM,CAAC,GAAG,CAAC;AAAA,MACb,CAAC;AAED,UAAI,UAAU,CAAC;AACf,UAAI,SAAS,CAAC;AACd,UAAI,OAAO,CAAC;AAEZ,UAAI,IAAI,IAAIA,cAAa;AAAA,QACvB,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,KAAK;AAAA,QACL,MAAM,CAAC,GAAG,CAAC;AAAA,MACb,CAAC;AAED,UAAIE,QAAO,CAAC;AAEZ,UAAIC,IAAG;AAEP,UAAI,IAAI,CAAC;AACT,UAAI,KAAK,CAAC;AAEV,WAAKA,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAEtB,UAAEA,EAAC,IAAI;AAEP,QAAAD,MAAKC,EAAC,IAAI;AAEV,aAAKA,KAAI,CAAC,IAAI;AAAA,MAChB;AAEA,YAAM;AACN,YAAM;AAEN,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAE1B,aAAK,CAAC,IAAI;AACV,aAAK,CAAC,IAAI;AAEV,YAAI,MAAM,IAAI,EAAE,CAAC,IAAI;AAErB,YAAI,MAAM,UAAU,GAAG,GAAG,KAAK,IAAI,GAAGD,OAAM,CAAC;AAE7C,YAAI,OAAO;AACX,YAAI,IAAI;AAER,aAAK,IAAI,KAAK,IAAI,GAAG,KAAK;AAExB,UAAAC,KAAI,GAAG,CAAC;AAER,cAAID,MAAKC,EAAC,IAAI,GAAG;AAEf,gBAAI,OAAOT,KAAI,EAAES,EAAC,CAAC;AAEnB,gBAAIL,QAAO,MAAM,CAAC,GAAG;AAEnB,kBAAI;AACJ,qBAAOK;AAAA,YACT;AAAA,UACF,OAAO;AAEL,mBAAO,GAAG,IAAID,MAAKC,EAAC;AACpB,oBAAQ,KAAK,IAAI,EAAEA,EAAC;AAAA,UACtB;AAAA,QACF;AAEA,YAAI,SAAS,MAAM,KAAK,GAAG;AACzB,iBAAO;AAAA,QACT;AAEA,YAAID,MAAK,GAAG,IAAI,KAAKH,UAASL,KAAI,EAAE,GAAG,CAAC,GAAGE,UAAS,GAAG,GAAG,CAAC,GAAG;AAC5D,iBAAO;AAAA,QACT;AAEA,YAAI,QAAQ,EAAE,IAAI;AAElB,eAAO,GAAG,IAAI;AACd,gBAAQ,KAAK,IAAI;AAEjB,QAAAM,MAAK,IAAI,IAAI;AAEb,eAAO,GAAG,IAAI;AACd,gBAAQ,KAAK,IAAI;AAEjB,aAAK,IAAI,KAAK,IAAI,GAAG,KAAK;AAExB,UAAAC,KAAI,GAAG,CAAC;AAER,cAAID,MAAKC,EAAC,IAAI,GAAG;AAEf,mBAAO,GAAG,IAAIA;AAEd,oBAAQ,KAAK,IAAIR,cAAa,EAAEQ,EAAC,GAAG,KAAK;AAAA,UAC3C;AAEA,YAAEA,EAAC,IAAI;AAAA,QACT;AAAA,MACF;AAEA,WAAK,CAAC,IAAI;AACV,WAAK,CAAC,IAAI;AAEV,WAAK,IAAI,GAAG,IAAI,KAAK,KAAK;AACxB,eAAO,CAAC,IAAID,MAAK,OAAO,CAAC,CAAC;AAAA,MAC5B;AAEA,cAAQ,OAAO,KAAK,QAAQ,SAAS,GAAG;AACxC,aAAO,OAAO,KAAK,OAAO,SAAS,GAAG;AACtC,cAAQ,OAAO,KAAK,QAAQ,SAAS,GAAG;AACxC,aAAO,OAAO,KAAK,OAAO,SAAS,GAAG;AAEtC,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA,MAAAA;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAC;;;ACjLD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO,OAAO,YAAY,aAAa,gBAAgB,YAAY,UAAU,YAAY,cAAc;AAC7H,MAAI,YAA2B,wBAAQD,SAAMC,iBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,KAAAC;AAAA,MACA,UAAAC;AAAA,MACA,WAAAC;AAAA,MACA,cAAAC;AAAA,MACA,UAAAC;AAAA,MACA,QAAAC;AAAA,MACA,UAAAC;AAAA,MACA,cAAAC;AAAA,IACF,IAAI;AACJ,QAAI,QAAQ,YAAY;AAAA,MACtB,KAAAP;AAAA,MACA,UAAAC;AAAA,MACA,WAAAC;AAAA,IACF,CAAC;AACD,QAAI,OAAO,WAAW;AAAA,MACpB,KAAAH;AAAA,MACA,cAAAI;AAAA,MACA,UAAAF;AAAA,MACA,UAAAG;AAAA,MACA,QAAAC;AAAA,MACA,UAAAC;AAAA,MACA,cAAAC;AAAA,IACF,CAAC;AAuCD,WAAOT,OAAMF,SAAM;AAAA,MACjB,gCAAgC,SAAS,2BAA2B,GAAG,OAAO,WAAW;AAEvF,YAAI,CAAC,UAAU,KAAK,KAAK,QAAQ,KAAK,QAAQ,GAAG;AAC/C,gBAAM,IAAI,MAAM,uFAAuF;AAAA,QACzG;AAEA,YAAI,YAAY,KAAK,YAAY,GAAG;AAClC,gBAAM,IAAI,MAAM,yDAAyD;AAAA,QAC3E;AAGA,YAAI,IAAI,MAAM,OAAO,GAAG,KAAK;AAG7B,YAAI,IAAI,KAAK,GAAG,GAAG,SAAS;AAG5B,eAAO;AAAA,UACL,GAAG,EAAE;AAAA,UACL,GAAG,EAAE;AAAA,UACL,GAAG,EAAE;AAAA,UACL,GAAG,EAAE;AAAA,UACL,UAAU,SAAS,WAAW;AAC5B,mBAAO,QAAQ,KAAK,EAAE,SAAS,IAAI,UAAU,KAAK,EAAE,SAAS,IAAI,UAAU,KAAK,EAAE,SAAS,KAAK,KAAK,IAAI,UAAU,KAAK,EAAE,SAAS,IAAI,MAAM;AAAA,UAC/I;AAAA,QACF;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACxFM,WAAS,QAAQ,GAAG,GAAG;AAE5B,QAAI;AACJ,QAAI,IAAI,EAAE;AACV,QAAI,IAAI,CAAC;AAET,QAAI,GAAG;AAEL,WAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AAEtB,UAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;AAAA,MACf;AAAA,IACF,OAAO;AAEL,WAAK,IAAI,GAAG,IAAI,GAAG,KAAK;AAEtB,UAAE,CAAC,IAAI,EAAE,CAAC;AAAA,MACZ;AAAA,IACF;AACA,WAAO;AAAA,EACT;;;AC5BA,MAAIY,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,OAAO,OAAO,UAAU,UAAU,aAAa;AAC/E,MAAI,gBAA+B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC5E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,KAAAC;AAAA,MACA,KAAAC;AAAA,MACA,QAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,IACF,IAAI;AACJ,QAAI,kBAAkB,sBAAsB;AAAA,MAC1C,aAAAA;AAAA,IACF,CAAC;AAmCD,WAAON,OAAMF,SAAM;AAAA,MACjB,yBAAyB,SAAS,oBAAoB,GAAG,GAAG;AAC1D,YAAIG,QAAO,CAAC;AACZ,YAAI,IAAIC,KAAI,CAAC;AACb,YAAI,IAAI,SAAS,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,MAAM,CAAC;AACvC,eAAO,EAAE,QAAQ;AAAA,MACnB;AAAA,MACA,+BAA+B,SAAS,0BAA0B,GAAG,GAAG;AACtE,YAAI,IAAIA,KAAI,CAAC;AACb,eAAO,SAAS,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,MAAM,CAAC;AAAA,MACxC;AAAA,MACA,gCAAgC,SAAS,2BAA2B,GAAG,GAAG;AACxE,YAAI,IAAIA,KAAI,CAAC;AACb,eAAO,SAAS,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,MAAM,CAAC;AAAA,MACxC;AAAA,MACA,gDAAgD,SAAS,yCAAyC,GAAG,GAAG,OAAO,WAAW;AACxH,YAAI,IAAIC,KAAI,GAAG,OAAO,SAAS;AAC/B,eAAO,SAAS,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;AAAA,MACvC;AAAA,MACA,0BAA0B,SAAS,qBAAqB,GAAG,GAAG;AAC5D,eAAO,SAAS,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;AAAA,MACvC;AAAA,IACF,CAAC;AACD,aAAS,UAAU,GAAG;AACpB,UAAI,SAAS,CAAC,GAAG;AACf,eAAO;AAAA,MACT;AACA,UAAI,QAAQ,CAAC,GAAG;AACd,eAAOF,QAAO,CAAC;AAAA,MACjB;AACA,YAAM,IAAI,UAAU,iCAAiC;AAAA,IACvD;AACA,aAAS,SAAS,GAAG,GAAG,GAAG,GAAG,GAAG;AAE/B,UAAI,UAAU,CAAC;AACf,UAAI,UAAU,CAAC;AAGf,UAAI,GAAG;AACL,YAAI,gBAAgB,GAAG,GAAG,IAAI;AAC9B,UAAE,QAAQ,QAAQ,GAAG,EAAE,KAAK;AAAA,MAC9B;AAGA,UAAI,IAAII,QAAO,GAAG,CAAC;AAEnB,UAAI,IAAID,QAAO,GAAG,CAAC;AAGnB,UAAI,GAAG;AACL,UAAE,QAAQ,QAAQ,GAAG,EAAE,KAAK;AAAA,MAC9B;AACA,aAAO;AAAA,IACT;AAAA,EACF,CAAC;;;AC1GD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,eAAe,OAAO,YAAY,YAAY,UAAU,QAAQ,cAAc,QAAQ,UAAU,MAAM,IAAI;AAC1I,MAAI,uBAAsC,wBAAQD,SAAMC,iBAAc,UAAQ;AACnF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,KAAAC;AAAA,MACA,UAAAC;AAAA,MACA,UAAAC;AAAA,MACA,QAAAC;AAAA,MACA,MAAAC;AAAA,MACA,YAAAC;AAAA,MACA,MAAAC;AAAA,MACA,QAAAC;AAAA,MACA,IAAAC;AAAA,MACA,IAAAC;AAAA,IACF,IAAI;AAwCJ,WAAOZ,OAAMF,SAAM;AAAA,MACjB,qCAAqC,CAAC,UAAU,eAAe;AAC7D,YAAI,SAAS,CAAC,UAAU,GAAG,UAAU;AACrC,eAAO,OAAO,SAAS,KAAKG,QAAO,OAAO,OAAO,SAAS,CAAC,CAAC,GAAG;AAC7D,iBAAO,IAAI;AAAA,QACb;AACA,YAAI,OAAO,SAAS,GAAG;AACrB,gBAAM,IAAI,WAAW,eAAe,OAAO,UAAU,IAAI,EAAE,OAAO,YAAY,iDAAiD,CAAC;AAAA,QAClI;AACA,gBAAQ,OAAO,QAAQ;AAAA,UACrB,KAAK;AAEH,mBAAO,CAACO,YAAWF,QAAO,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;AAAA,UAClD,KAAK,GACH;AAEE,gBAAI,CAAC,GAAG,GAAG,CAAC,IAAI;AAChB,gBAAI,QAAQD,UAAS,GAAG,CAAC;AACzB,gBAAI,KAAKA,UAAS,GAAG,CAAC;AACtB,gBAAI,KAAKA,UAAS,GAAG,GAAG,CAAC;AACzB,gBAAIH,aAAY,IAAI,EAAE,EAAG,QAAO,CAACI,QAAOE,YAAW,CAAC,GAAG,KAAK,CAAC;AAC7D,gBAAI,eAAeD,MAAKH,UAAS,IAAI,EAAE,CAAC;AACxC,mBAAO,CAACE,QAAOF,UAAS,cAAc,CAAC,GAAG,KAAK,GAAGE,QAAOF,UAASI,YAAW,YAAY,GAAG,CAAC,GAAG,KAAK,CAAC;AAAA,UACxG;AAAA,UACF,KAAK,GACH;AAEE,gBAAI,CAAC,GAAG,IAAI,IAAI,EAAE,IAAI;AACtB,gBAAI,SAASA,YAAWH,UAAS,GAAG,EAAE,CAAC;AACvC,gBAAI,OAAOA,UAAS,IAAI,EAAE;AAC1B,gBAAI,OAAOA,UAAS,GAAG,IAAI,EAAE;AAC7B,gBAAI,OAAOF,KAAIE,UAAS,GAAG,IAAI,IAAI,EAAE,GAAGA,UAAS,IAAI,IAAI,IAAI,CAAC,CAAC;AAC/D,gBAAI,OAAOA,UAAS,GAAG,IAAI,IAAI,EAAE;AACjC,gBAAIH,aAAY,MAAM,IAAI,KAAKA,aAAY,MAAM,IAAI,GAAG;AACtD,qBAAO,CAACI,QAAO,IAAI,MAAM,CAAC;AAAA,YAC5B;AACA,gBAAI,SAASF,UAAS,MAAM,IAAI;AAChC,gBAAI,SAASA,UAAS,MAAM,IAAI;AAChC,gBAAI,gBAAgBD,KAAIE,UAAS,IAAI,IAAI,IAAI,IAAI,CAAC,GAAGA,UAAS,IAAI,IAAI,IAAI,EAAE,CAAC;AAC7E,gBAAI,gBAAgBF,KAAIE,UAAS,GAAG,IAAI,IAAI,IAAI,CAAC,GAAGA,UAAS,GAAG,IAAI,IAAI,IAAI,EAAE,GAAGA,UAAS,IAAI,IAAI,IAAI,GAAG,CAAC,CAAC;AAC3G,gBAAIH,aAAY,eAAe,aAAa,GAAG;AAC7C,qBAAO;AAAA,gBAACI,QAAOF,UAASC,UAAS,GAAG,IAAI,IAAI,EAAE,GAAGF,KAAIE,UAAS,GAAG,IAAI,IAAI,CAAC,GAAGA,UAAS,IAAI,IAAI,EAAE,CAAC,CAAC,GAAGA,UAAS,IAAI,MAAM,CAAC;AAAA;AAAA,gBAEzHC,QAAOF,UAASC,UAAS,GAAG,IAAI,CAAC,GAAGA,UAAS,IAAI,EAAE,CAAC,GAAGA,UAAS,GAAG,MAAM,CAAC;AAAA;AAAA,cAC1E;AAAA,YACF;AAEA,gBAAI;AACJ,gBAAIH,aAAY,MAAM,IAAI,GAAG;AAC3B,uBAAS;AAAA,YACX,OAAO;AACL,uBAASI,QAAOH,KAAI,QAAQI,MAAKH,UAASC,UAAS,QAAQ,MAAM,GAAGA,UAAS,GAAG,QAAQ,QAAQ,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC;AAAA,YAC/G;AACA,gBAAI,WAAW;AACf,gBAAI,WAAWI,MAAK,QAAQ,QAAQ,EAAE,QAAQ,EAAE,IAAI,OAAKH,QAAOH,KAAI,IAAI,GAAGG,QAAO,QAAQ,CAAC,CAAC,GAAG,MAAM,CAAC;AACtG,mBAAO,SAAS,IAAI,OAAK;AACvB,kBAAII,QAAO,CAAC,MAAM,aAAaR,aAAYU,IAAG,CAAC,GAAGA,IAAG,CAAC,IAAID,IAAG,CAAC,CAAC,GAAG;AAChE,uBAAOC,IAAG,CAAC;AAAA,cACb;AACA,qBAAO;AAAA,YACT,CAAC;AAAA,UACH;AAAA,UACF;AACE,kBAAM,IAAI,WAAW,8DAA8D,OAAO,MAAM,CAAC;AAAA,QACrG;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACzHD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,UAAU;AACvB,MAAI,kBAAiC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,UAAAC;AAAA,IACF,IAAI;AAYJ,aAASC,MAAK,KAAK;AACjB,UAAI,EAAE,gBAAgBA,QAAO;AAC3B,cAAM,IAAI,YAAY,kDAAkD;AAAA,MAC1E;AACA,UAAI,CAAC,IAAK,OAAM,IAAI,MAAM,wBAAwB;AAClD,WAAK,MAAM;AAAA,IACb;AAKA,IAAAA,MAAK,UAAU,OAAO;AACtB,IAAAA,MAAK,UAAU,SAAS;AAOxB,IAAAA,MAAK,UAAU,WAAW,WAAY;AACpC,UAAI,MAAM,KAAK,OAAO,CAAC;AACvB,UAAI,OAAO;AACX,UAAI,IAAI,MAAM;AACZ,gBAAQ,WAAW,IAAI,OAAO;AAAA,MAChC;AACA,UAAI,IAAI,UAAU;AAChB,gBAAQ,eAAe,IAAI,WAAW;AAAA,MACxC;AACA,UAAI,IAAI,aAAa;AACnB,gBAAQ,uBAAuB,IAAI,cAAc;AAAA,MACnD;AACA,UAAI,IAAI,QAAQ;AACd,gBAAQ,kBAAkB,IAAI,OAAO,KAAK,QAAQ,IAAI;AAAA,MACxD;AACA,UAAI,IAAI,UAAU;AAChB,gBAAQ;AAIR,YAAI,gBAAgB;AACpB,YAAI,iBAAiBD,UAAS,UAAU;AACxC,YAAI,QAAQ;AAAA,UACV,QAAQ,eAAa;AACnB,4BAAgB;AAChB,mBAAOA,UAAS,qBAAqB;AAAA,cACnC;AAAA,YACF,CAAC;AAAA,UACH;AAAA,QACF;AACA,iBAASE,KAAI,GAAGA,KAAI,IAAI,SAAS,QAAQA,MAAK;AAC5C,cAAI,OAAO,IAAI,SAASA,EAAC;AACzB,kBAAQ,SAAS,OAAO;AACxB,cAAI,MAAM;AACV,cAAI;AAEF,kBAAMF,UAAS,MAAM,KAAK;AAAA,UAC5B,SAASG,IAAG;AACV,kBAAMA;AAAA,UACR;AACA,cAAI,QAAQ,UAAa,CAAC,OAAO,GAAG,GAAG;AACrC,oBAAQ,aAAaC,QAAO,KAAK;AAAA,cAC/B,WAAW;AAAA,YACb,CAAC,IAAI;AAAA,UACP;AAAA,QACF;AACA,gBAAQ;AACR,YAAI,eAAe;AACjB,UAAAJ,UAAS,0BAA0B;AAAA,YACjC;AAAA,UACF,CAAC;AAAA,QACH;AAAA,MACF;AACA,UAAI,IAAI,YAAY,IAAI,SAAS,QAAQ;AACvC,gBAAQ,aAAa,IAAI,SAAS,KAAK,IAAI,IAAI;AAAA,MACjD;AACA,UAAI,IAAI,WAAW,IAAI,QAAQ,QAAQ;AACrC,gBAAQ,eAAe,IAAI,QAAQ,KAAK,IAAI,IAAI;AAAA,MAClD;AACA,aAAO;AAAA,IACT;AAKA,IAAAC,MAAK,UAAU,SAAS,WAAY;AAClC,UAAI,MAAMI,OAAM,KAAK,GAAG;AACxB,UAAI,SAAS;AACb,aAAO;AAAA,IACT;AAOA,IAAAJ,MAAK,WAAW,SAAU,MAAM;AAC9B,UAAI,MAAM,CAAC;AACX,aAAO,KAAK,IAAI,EAAE,OAAO,UAAQ,SAAS,QAAQ,EAAE,QAAQ,UAAQ;AAClE,YAAI,IAAI,IAAI,KAAK,IAAI;AAAA,MACvB,CAAC;AACD,aAAO,IAAIA,MAAK,GAAG;AAAA,IACrB;AAKA,IAAAA,MAAK,UAAU,UAAUA,MAAK,UAAU;AACxC,WAAOA;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,EACX,CAAC;;;AC/HD,MAAIK,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO,QAAQ,OAAO;AACnC,MAAI,mBAAkC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC/E,QAAI;AAAA,MACF,IAAAC;AAAA,MACA,MAAAC;AAAA,MACA,OAAAC;AAAA,IACF,IAAI;AAmBJ,aAASC,OAAM,OAAO;AACpB,UAAI,EAAE,gBAAgBA,SAAQ;AAC5B,cAAM,IAAI,YAAY,kDAAkD;AAAA,MAC1E;AACA,UAAI,QAAQ,KAAK,GAAG;AAClB,aAAK,QAAQ,MAAM;AAAA,MACrB,OAAO;AACL,aAAK,QAAQ;AAAA,MACf;AAAA,IACF;AAKA,IAAAA,OAAM,UAAU,OAAO;AACvB,IAAAA,OAAM,UAAU,UAAU;AAO1B,IAAAA,OAAM,UAAU,OAAO,WAAY;AACjC,aAAO,KAAK;AAAA,IACd;AAOA,IAAAA,OAAM,UAAU,UAAU,WAAY;AACpC,aAAO,KAAK;AAAA,IACd;AAMA,IAAAA,OAAM,UAAU,WAAW,WAAY;AACrC,aAAOC,QAAO,KAAK,KAAK;AAAA,IAC1B;AAMA,IAAAD,OAAM,UAAU,SAAS,WAAY;AACnC,aAAO;AAAA,QACL,QAAQ;AAAA,QACR,OAAO,KAAK;AAAA,MACd;AAAA,IACF;AASA,IAAAA,OAAM,WAAW,SAAU,MAAM;AAC/B,aAAO,IAAIA,OAAM,KAAK,KAAK;AAAA,IAC7B;AASA,aAAS,YAAYL,SAAM,IAAI;AAC7B,UAAI,OAAO,OAAO,YAAY;AAC5B,QAAAK,OAAM,UAAUL,OAAI,IAAI,SAAS,EAAE;AAAA,MACrC;AAAA,IACF;AASA,aAAS,gBAAgBA,SAAM,UAAU;AACvC,WAAKK,OAAM,WAAWL,SAAM,SAAS,gBAAgB;AACnD,YAAI,KAAK,SAAS;AAClB,YAAI,OAAO,OAAO,YAAY;AAC5B,iBAAO,SAAS,EAAE;AAAA,QACpB;AACA,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAQA,aAAS,SAAS,IAAI;AACpB,aAAO,WAAY;AAEjB,YAAI,UAAU,WAAW,GAAG;AAC1B,iBAAO,IAAIK,OAAM,GAAG,KAAK,KAAK,CAAC;AAAA,QACjC;AACA,YAAI,OAAO,CAAC,KAAK,KAAK;AACtB,iBAASE,KAAI,GAAGA,KAAI,UAAU,QAAQA,MAAK;AACzC,eAAKA,KAAI,CAAC,IAAI,UAAUA,EAAC;AAAA,QAC3B;AACA,YAAIH,OAAM,gBAAgB,EAAE,GAAG;AAC7B,cAAI,YAAYA,OAAM,QAAQ,IAAI,IAAI;AAMtC,cAAI,UAAU,OAAO,WAAW,GAAG;AACjC,kBAAM,IAAI,MAAM,oBAAoB,GAAG,OAAO,4EAA4E;AAAA,UAC5H;AACA,iBAAO,IAAIC,OAAM,UAAU,eAAe,MAAM,IAAI,IAAI,CAAC;AAAA,QAC3D;AACA,eAAO,IAAIA,OAAM,GAAG,MAAM,IAAI,IAAI,CAAC;AAAA,MACrC;AAAA,IACF;AAgBA,IAAAA,OAAM,cAAc,SAAU,MAAM,MAAM;AACxC,UAAI,OAAO,SAAS,UAAU;AAE5B,oBAAY,MAAM,IAAI;AAAA,MACxB,OAAO;AACL,YAAI,QAAQ,SAASG,OAAMC,QAAO;AAChC,cAAI,eAAe,MAAMA,MAAK,KAAK,cAAcA,MAAK,MAAM,QAAW;AACrE,4BAAgBA,QAAO,MAAM,KAAKA,MAAK,CAAC;AAAA,UAC1C;AAAA,QACF;AAEA,iBAAS,SAAS,MAAM;AACtB,gBAAM,KAAK;AAAA,QACb;AAAA,MACF;AAAA,IACF;AACA,QAAI,gBAAgB;AAAA,MAClB,YAAY;AAAA,MACZ,MAAM;AAAA,MACN,MAAM;AAAA,MACN,SAAS;AAAA,MACT,MAAM;AAAA,MACN,OAAO;AAAA,MACP,SAAS;AAAA;AAAA,IACX;AAGA,IAAAJ,OAAM,YAAYF,KAAI;AAGtB,QAAID,KAAI;AACN,MAAAA,IAAG,UAAU,SAAUF,SAAM,UAAU,MAAM;AAC3C,YAAI,CAAC,MAAM;AAET,0BAAgBA,SAAM,QAAQ;AAAA,QAChC;AAAA,MACF,CAAC;AAAA,IACH;AACA,WAAOK;AAAA,EACT,GAAG;AAAA,IACD,SAAS;AAAA,EACX,CAAC;;;ACpNM,MAAI,QAAQ;AAAA,IACjB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,GAAG;AAAA,IACZ,aAAa;AAAA,IACb,UAAU,CAAC,KAAK,SAAS,UAAU,QAAQ;AAAA,IAC3C,SAAS,CAAC,KAAK;AAAA,EACjB;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,OAAO;AAAA,IAChB,aAAa;AAAA,IACb,UAAU,CAAC,OAAO;AAAA,IAClB,SAAS,CAAC,MAAM;AAAA,EAClB;;;ACPO,MAAI,QAAQ;AAAA,IACjB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,GAAG;AAAA,IACZ,aAAa;AAAA,IACb,UAAU,CAAC,KAAK,SAAS,UAAU;AAAA,IACnC,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,eAAe;AAAA,IACxB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU;AAAA,IACnB,aAAa;AAAA,IACb,UAAU,CAAC,YAAY,OAAO;AAAA,IAC9B,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,MAAM;AAAA,IACf,aAAa;AAAA,IACb,UAAU,CAAC,QAAQ,SAAS;AAAA,IAC5B,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,KAAK;AAAA,IACd,aAAa;AAAA,IACb,UAAU,CAAC,OAAO,QAAQ;AAAA,IAC1B,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,QAAQ;AAAA,IACjB,aAAa;AAAA,IACb,UAAU,CAAC,UAAU,YAAY;AAAA,IACjC,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,OAAO;AAAA,IAChB,aAAa;AAAA,IACb,UAAU,CAAC,SAAS,WAAW;AAAA,IAC/B,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,KAAK;AAAA,IACd,aAAa;AAAA,IACb,UAAU,CAAC,OAAO,OAAO;AAAA,IACzB,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,MAAM;AAAA,IACf,aAAa;AAAA,IACb,UAAU,CAAC,MAAM;AAAA,IACjB,SAAS,CAAC,QAAQ,OAAO;AAAA,EAC3B;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,KAAK;AAAA,IACd,aAAa;AAAA,IACb,UAAU,CAAC,KAAK;AAAA,IAChB,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,SAAS;AAAA,IAClB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,IAAI;AAAA,IACb,aAAa;AAAA,IACb,UAAU,CAAC,MAAM,WAAW;AAAA,IAC5B,SAAS,CAAC,KAAK;AAAA,EACjB;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS;AAAA,IAClB,aAAa;AAAA,IACb,UAAU,CAAC,WAAW,WAAW;AAAA,IACjC,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,OAAO;AAAA,IAChB,aAAa;AAAA,IACb,UAAU,CAAC,SAAS,SAAS;AAAA,IAC7B,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,KAAK;AAAA,IACd,aAAa;AAAA,IACb,UAAU,CAAC,OAAO,QAAQ;AAAA,IAC1B,SAAS,CAAC,IAAI;AAAA,EAChB;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,MAAM;AAAA,IACf,aAAa;AAAA,IACb,UAAU,CAAC,MAAM;AAAA,IACjB,SAAS,CAAC,OAAO;AAAA,EACnB;;;ACPO,MAAI,cAAc;AAAA,IACvB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS;AAAA,IAClB,aAAa;AAAA,IACb,UAAU,CAAC,SAAS;AAAA,IACpB,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,gBAAgB;AAAA,IACzB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,cAAc;AAAA,IACvB,aAAa;AAAA,IACb,UAAU,CAAC,aAAa,mCAAmC,oBAAoB,wBAAwB,4BAA4B;AAAA,IACnI,SAAS,CAAC,WAAW,UAAU,WAAW,YAAY,SAAS,UAAU,UAAU,MAAM;AAAA,EAC3F;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,WAAW;AAAA,IACpB,aAAa;AAAA,IACb,UAAU,CAAC,wDAAwD,gCAAgC,4BAA4B;AAAA,IAC/H,SAAS,CAAC,WAAW,aAAa,UAAU,WAAW,YAAY,SAAS,UAAU,UAAU,MAAM;AAAA,EACxG;;;ACPO,MAAI,cAAc;AAAA,IACvB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,KAAK,YAAY;AAAA,IAC1B,aAAa;AAAA,IACb,UAAU,CAAC,cAAc,cAAc,cAAc,mBAAmB,oBAAoB,uBAAuB;AAAA,IACnH,SAAS,CAAC,aAAa,WAAW,SAAS,UAAU,UAAU,UAAU,MAAM;AAAA,EACjF;;;ACPO,MAAI,cAAc;AAAA,IACvB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,aAAa,mBAAmB,iBAAiB;AAAA,IAC1D,aAAa;AAAA,IACb,UAAU,CAAC,aAAa,iBAAiB,mBAAmB;AAAA,IAC5D,SAAS,CAAC,aAAa,WAAW,SAAS,UAAU,UAAU,UAAU,MAAM;AAAA,EACjF;;;ACPO,MAAI,iBAAiB;AAAA,IAC1B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,2BAA2B,8BAA8B;AAAA,IAClE,aAAa;AAAA,IACb,UAAU,CAAC,qBAAqB,wFAAwF,kCAAkC;AAAA,IAC1J,SAAS,CAAC,QAAQ,WAAW;AAAA,EAC/B;;;ACPO,MAAI,eAAe;AAAA,IACxB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,iBAAiB,oBAAoB,qBAAqB,4BAA4B;AAAA,IAC/F,aAAa;AAAA,IACb,UAAU,CAAC,mBAAmB,mCAAmC,6BAA6B,yCAAyC;AAAA,IACvI,SAAS,CAAC,aAAa,WAAW,WAAW,SAAS,UAAU,UAAU,MAAM;AAAA,EAClF;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,WAAW,eAAe,oBAAoB,0BAA0B,mCAAmC,6CAA6C;AAAA,IACjK,aAAa;AAAA,IACb,UAAU,CAAC,0BAA0B,WAAW,gBAAgB,mBAAmB,iBAAiB,gBAAgB;AAAA,IACpH,SAAS,CAAC,aAAa,WAAW,WAAW,UAAU,UAAU,SAAS,UAAU,MAAM;AAAA,EAC5F;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,MAAM,8BAA8B,YAAY,mBAAmB,eAAe;AAAA,IAC3F,aAAa;AAAA,IACb,UAAU,CAAC,MAAM,aAAa,sBAAsB,YAAY,kBAAkB,kCAAkC,0CAA0C;AAAA,IAC9J,SAAS,CAAC,aAAa,WAAW,WAAW,SAAS,UAAU,UAAU,QAAQ,QAAQ;AAAA,EAC5F;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,KAAK,aAAa,6BAA6B;AAAA,IACxD,aAAa;AAAA,IACb,UAAU,CAAC,KAAK,OAAO,QAAQ,aAAa,iBAAiB,gBAAgB,qCAAqC,2BAA2B;AAAA,IAC7I,SAAS,CAAC,aAAa,UAAU,WAAW,WAAW,YAAY,SAAS,UAAU,UAAU,MAAM;AAAA,EACxG;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,YAAY,sCAAsC,8CAA8C;AAAA,IACzG,aAAa;AAAA,IACb,UAAU,CAAC,YAAY,wBAAwB,gCAAgC;AAAA,IAC/E,SAAS,CAAC,aAAa,WAAW,WAAW,SAAS,UAAU,UAAU,QAAQ,QAAQ;AAAA,EAC5F;;;ACPO,MAAI,gBAAgB;AAAA,IACzB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,sCAAsC;AAAA,IAC/C,aAAa;AAAA,IACb,UAAU,CAAC,kCAAkC;AAAA,IAC7C,SAAS,CAAC,QAAQ,YAAY;AAAA,EAChC;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU,WAAW;AAAA,IAC9B,aAAa;AAAA,IACb,UAAU,CAAC,kBAAkB,eAAe,gBAAgB;AAAA,IAC5D,SAAS,CAAC,aAAa,WAAW,WAAW,SAAS,UAAU,UAAU,MAAM;AAAA,EAClF;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,cAAc,qBAAqB,cAAc;AAAA,IAC1D,aAAa;AAAA,IACb,UAAU,CAAC,UAAU,UAAU,yBAAyB,gBAAgB;AAAA,IACxE,SAAS,CAAC,aAAa,WAAW,WAAW,SAAS,UAAU,UAAU,QAAQ;AAAA,EACpF;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,YAAY,iBAAiB;AAAA,IACtC,aAAa;AAAA,IACb,UAAU,CAAC,YAAY,aAAa,gCAAgC,WAAW;AAAA,IAC/E,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,qBAAqB,4BAA4B;AAAA,IAC1D,aAAa;AAAA,IACb,UAAU,CAAC,6CAA6C,WAAW,YAAY;AAAA,IAC/E,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,qBAAqB,yBAAyB;AAAA,IACvD,aAAa;AAAA,IACb,UAAU,CAAC,sEAAsE,aAAa,iBAAiB;AAAA,IAC/G,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,iBAAiB;AAAA,IAC1B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,8BAA8B,iDAAiD;AAAA,IACxF,aAAa;AAAA,IACb,UAAU,CAAC,2BAA2B,8CAA8C,oCAAoC,8BAA8B,wBAAwB,kBAAkB,yBAAyB,qBAAqB;AAAA,IAC9O,SAAS,CAAC,YAAY,SAAS,UAAU;AAAA,EAC3C;;;ACPO,MAAI,gBAAgB;AAAA,IACzB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,iBAAiB;AAAA,IAC1B,aAAa;AAAA,IACb,UAAU,CAAC,2BAA2B,4CAA4C;AAAA,IAClF,SAAS,CAAC,UAAU;AAAA,EACtB;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,gBAAgB;AAAA,IACzB,aAAa;AAAA,IACb,UAAU,CAAC,qBAAqB,eAAe,kBAAkB;AAAA,IACjE,SAAS,CAAC,aAAa,OAAO,WAAW,UAAU,UAAU,QAAQ;AAAA,EACvE;;;ACPO,MAAI,gBAAgB;AAAA,IACzB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,mBAAmB;AAAA,IAC5B,aAAa;AAAA,IACb,UAAU,CAAC,qBAAqB,eAAe,kBAAkB;AAAA,IACjE,SAAS,CAAC,UAAU,OAAO,WAAW,UAAU,UAAU,QAAQ;AAAA,EACpE;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,QAAQ;AAAA,IACjB,aAAa;AAAA,IACb,UAAU,CAAC,yBAAyB,iCAAiC,+BAA+B;AAAA,IACpG,SAAS,CAAC,WAAW,UAAU,UAAU,UAAU,UAAU,OAAO,IAAI;AAAA,EAC1E;;;ACPO,MAAI,cAAc;AAAA,IACvB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,mBAAmB,kBAAkB;AAAA,IAC9C,aAAa;AAAA,IACb,UAAU,CAAC,qBAAqB,eAAe,mBAAmB;AAAA,IAClE,SAAS,CAAC,OAAO,OAAO,UAAU,UAAU,UAAU,QAAQ;AAAA,EAChE;;;ACPO,MAAI,qBAAqB;AAAA,IAC9B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,2BAA2B,8BAA8B,iCAAiC;AAAA,IACnG,aAAa;AAAA,IACb,UAAU,CAAC,mCAAmC;AAAA,IAC9C,SAAS,CAAC,QAAQ,MAAM;AAAA,EAC1B;;;ACPO,MAAI,SAAS;AAAA,IAClB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,OAAO;AAAA,IAChB,aAAa;AAAA,IACb,UAAU,CAAC,0DAA0D;AAAA,IACrE,SAAS,CAAC,OAAO,OAAO,QAAQ;AAAA,EAClC;;;ACPO,MAAI,kBAAkB;AAAA,IAC3B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,qBAAqB,4BAA4B,oCAAoC;AAAA,IAC9F,aAAa;AAAA,IACb,UAAU,CAAC,iCAAiC,qCAAqC;AAAA,IACjF,SAAS,CAAC,UAAU;AAAA,EACtB;;;ACPO,MAAI,cAAc;AAAA,IACvB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,sBAAsB;AAAA,IAC/B,aAAa;AAAA,IACb,UAAU,CAAC,qCAAqC,yDAAyD,+CAA+C,4DAA4D;AAAA,IACpN,SAAS,CAAC,YAAY,UAAU;AAAA,IAChC,UAAU,CAAC,gBAAgB;AAAA,EAC7B;;;ACRO,MAAI,eAAe;AAAA,IACxB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,kBAAkB,uBAAuB;AAAA,IAClD,aAAa;AAAA,IACb,UAAU,CAAC,yBAAyB,sBAAsB,gCAAgC,4BAA4B,6BAA6B;AAAA,IACnJ,SAAS,CAAC,gBAAgB,cAAc,YAAY,SAAS,eAAe,SAAS;AAAA,EACvF;;;ACPO,MAAI,uBAAuB;AAAA,IAChC,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,0BAA0B,iCAAiC;AAAA,IACpE,aAAa;AAAA,IACb,UAAU,CAAC,+BAA+B,yCAAyC;AAAA,IACnF,SAAS,CAAC,YAAY,gBAAgB,UAAU;AAAA,EAClD;;;ACPO,MAAI,mBAAmB;AAAA,IAC5B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,oBAAoB;AAAA,IAC7B,aAAa;AAAA,IACb,UAAU,CAAC,8BAA8B,gCAAgC;AAAA,IACzE,SAAS,CAAC,YAAY,oBAAoB,UAAU;AAAA,EACtD;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,0BAA0B;AAAA,IACnC,aAAa;AAAA,IACb,UAAU,CAAC,yFAAyF;AAAA,IACpG,SAAS,CAAC,WAAW,UAAU,UAAU,UAAU,UAAU,OAAO,IAAI;AAAA,EAC1E;;;ACPO,MAAI,oBAAoB;AAAA,IAC7B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,+BAA+B,sCAAsC;AAAA,IAC9E,aAAa;AAAA,IACb,UAAU,CAAC,8BAA8B,oCAAoC,iEAAiE;AAAA,IAC9I,SAAS,CAAC,YAAY,UAAU;AAAA,EAClC;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,gBAAgB;AAAA,IACzB,aAAa;AAAA,IACb,UAAU,CAAC,kFAAkF;AAAA,IAC7F,SAAS,CAAC,aAAa,OAAO,WAAW,UAAU,UAAU,QAAQ;AAAA,EACvE;;;ACPO,MAAI,gBAAgB;AAAA,IACzB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,gBAAgB;AAAA,IACzB,aAAa;AAAA,IACb,UAAU,CAAC,kFAAkF;AAAA,IAC7F,SAAS,CAAC,UAAU,OAAO,WAAW,UAAU,UAAU,QAAQ;AAAA,EACpE;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,QAAQ;AAAA,IACjB,aAAa;AAAA,IACb,UAAU,CAAC,YAAY,WAAW;AAAA,IAClC,SAAS,CAAC,MAAM;AAAA,EAClB;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS,WAAW;AAAA,IAC7B,aAAa;AAAA,IACb,UAAU,CAAC,iBAAiB,WAAW,UAAU,iBAAiB,aAAa;AAAA,IAC/E,SAAS,CAAC,UAAU;AAAA,EACtB;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,WAAW,mBAAmB;AAAA,IACvC,aAAa;AAAA,IACb,UAAU,CAAC,YAAY,WAAW,YAAY,gBAAgB,YAAY,kBAAkB,cAAc;AAAA,IAC1G,SAAS,CAAC,UAAU,QAAQ,QAAQ,UAAU;AAAA,EAChD;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,WAAW,cAAc,6BAA6B,8BAA8B;AAAA,IAC7F,aAAa;AAAA,IACb,UAAU,CAAC,aAAa,aAAa,cAAc,qBAAqB,sBAAsB;AAAA,IAC9F,SAAS,CAAC,SAAS,OAAO,OAAO;AAAA,EACnC;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS;AAAA,IAClB,aAAa;AAAA,IACb,UAAU,CAAC,WAAW,OAAO,WAAW;AAAA,IACxC,SAAS,CAAC,YAAY,UAAU,KAAK;AAAA,EACvC;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS,cAAc;AAAA,IAChC,aAAa;AAAA,IACb,UAAU,CAAC,aAAa,SAAS,WAAW,aAAa,eAAe,aAAa;AAAA,IACrF,SAAS,CAAC,UAAU;AAAA,EACtB;;;ACPO,MAAI,gBAAgB;AAAA,IACzB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU,iBAAiB;AAAA,IACpC,aAAa;AAAA,IACb,UAAU,CAAC,0BAA0B,0BAA0B,QAAQ;AAAA,IACvE,SAAS,CAAC,YAAY,eAAe,QAAQ;AAAA,EAC/C;;;ACPO,MAAI,kBAAkB;AAAA,IAC3B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU,mBAAmB;AAAA,IACtC,aAAa;AAAA,IACb,UAAU,CAAC,0BAA0B,0BAA0B,QAAQ;AAAA,IACvE,SAAS,CAAC,YAAY,UAAU,WAAW;AAAA,EAC7C;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU,cAAc;AAAA,IACjC,aAAa;AAAA,IACb,UAAU,CAAC,0BAA0B,QAAQ;AAAA,IAC7C,SAAS,CAAC,KAAK;AAAA,EACjB;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,QAAQ;AAAA,IACjB,aAAa;AAAA,IACb,UAAU,CAAC,YAAY,WAAW,iBAAiB,WAAW,qDAAsD;AAAA,IACpH,SAAS,CAAC,QAAQ,SAAS,OAAO,KAAK;AAAA,EACzC;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,QAAQ;AAAA,IACjB,aAAa;AAAA,IACb,UAAU,CAAC,qBAAqB;AAAA,IAChC,SAAS,CAAC,KAAK;AAAA,EACjB;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU;AAAA,IACnB,aAAa;AAAA,IACb,UAAU,CAAC,YAAY,iBAAiB,mBAAmB;AAAA,IAC3D,SAAS,CAAC,OAAO,OAAO,KAAK;AAAA,EAC/B;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU,aAAa,4BAA4B,6BAA6B;AAAA,IACzF,aAAa;AAAA,IACb,UAAU,CAAC,YAAY,YAAY,aAAa,aAAa,oBAAoB,qBAAqB;AAAA,IACtG,SAAS,CAAC,QAAQ,SAAS,OAAO;AAAA,EACpC;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,YAAY,eAAe,8BAA8B,+BAA+B;AAAA,IACjG,aAAa;AAAA,IACb,UAAU,CAAC,cAAc,cAAc,eAAe,sBAAsB,uBAAuB;AAAA,IACnG,SAAS,CAAC,QAAQ,OAAO,OAAO;AAAA,EAClC;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,aAAa,mBAAmB;AAAA,IACzC,aAAa;AAAA,IACb,UAAU,CAAC,cAAc,cAAc,kBAAkB;AAAA,IACzD,SAAS,CAAC,OAAO,MAAM;AAAA,EACzB;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,uBAAuB,uBAAuB;AAAA,IACvD,aAAa;AAAA,IACb,UAAU,CAAC,eAAe,mBAAmB,aAAa,kBAAkB;AAAA,IAC5E,SAAS,CAAC,OAAO,MAAM;AAAA,EACzB;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,cAAc;AAAA,IACvB,aAAa;AAAA,IACb,UAAU,CAAC,iBAAiB,iBAAiB,sBAAsB;AAAA,IACnE,SAAS,CAAC,OAAO,MAAM;AAAA,EACzB;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,WAAW;AAAA,IACpB,aAAa;AAAA,IACb,UAAU,CAAC,aAAa,cAAc,eAAe;AAAA,IACrD,SAAS,CAAC,KAAK;AAAA,EACjB;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU,cAAc;AAAA,IACjC,aAAa;AAAA,IACb,UAAU,CAAC,YAAY,gBAAgB,UAAU,UAAU,kBAAkB,wBAAwB,oBAAoB,OAAO;AAAA,IAChI,SAAS,CAAC,OAAO,SAAS,QAAQ,OAAO;AAAA,EAC3C;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU;AAAA,IACnB,aAAa;AAAA,IACb,UAAU,CAAC,kBAAkB,gBAAgB,UAAU,wBAAwB,gBAAgB;AAAA,IAC/F,SAAS,CAAC,OAAO,KAAK;AAAA,EACxB;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,YAAY,gBAAgB;AAAA,IACrC,aAAa;AAAA,IACb,UAAU,CAAC,cAAc,mBAAmB,cAAc,mBAAmB,uBAAuB;AAAA,IACpG,SAAS,CAAC,OAAO,OAAO,QAAQ,OAAO;AAAA,EACzC;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS;AAAA,IAClB,aAAa;AAAA,IACb,UAAU,CAAC,iBAAiB,YAAY,sBAAsB,WAAW;AAAA,IACzE,SAAS,CAAC,OAAO,SAAS,OAAO,OAAO;AAAA,EAC1C;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS,WAAW,WAAW;AAAA,IACxC,aAAa;AAAA,IACb,UAAU,CAAC,SAAS,UAAU,YAAY,oBAAoB,YAAY,UAAU;AAAA,IACpF,SAAS,CAAC,QAAQ;AAAA,EACpB;;;ACPO,MAAI,eAAe;AAAA,IACxB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS,gBAAgB;AAAA,IAClC,aAAa;AAAA,IACb,UAAU,CAAC,iBAAiB,WAAW,aAAa,eAAe,YAAY;AAAA,IAC/E,SAAS,CAAC,QAAQ;AAAA,EACpB;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,WAAW,YAAY;AAAA,IAChC,aAAa;AAAA,IACb,UAAU,CAAC,aAAa,cAAc,gBAAgB,8BAA8B,+BAA+B,mBAAmB,6BAA6B,iCAAiC,+BAA+B;AAAA,EACrO;;;ACNO,MAAI,cAAc;AAAA,IACvB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,cAAc,kBAAkB;AAAA,IACzC,aAAa;AAAA,IACb,UAAU,CAAC,SAAS,kBAAkB,iBAAiB,SAAS;AAAA,IAChE,SAAS,CAAC,YAAY,OAAO,MAAM;AAAA,EACrC;;;ACPO,MAAI,eAAe;AAAA,IACxB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,eAAe,mBAAmB;AAAA,IAC3C,aAAa;AAAA,IACb,UAAU,CAAC,eAAe,gBAAgB;AAAA,IAC1C,SAAS,CAAC,QAAQ,OAAO,SAAS;AAAA,EACpC;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS,WAAW;AAAA,IAC7B,aAAa;AAAA,IACb,UAAU,CAAC,OAAO,SAAS,oBAAoB,4BAA4B,2BAA2B;AAAA,IACtG,SAAS,CAAC,YAAY,WAAW,YAAY,MAAM;AAAA,EACrD;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,YAAY,eAAe,8BAA8B,+BAA+B;AAAA,IACjG,aAAa;AAAA,IACb,UAAU,CAAC,cAAc,cAAc,eAAe,eAAe,gBAAgB,uBAAuB,yBAAyB,yBAAyB;AAAA,IAC9J,SAAS,CAAC,QAAQ,SAAS,KAAK;AAAA,EAClC;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS;AAAA,IAClB,aAAa;AAAA,IACb,UAAU,CAAC,aAAa,cAAc,SAAS;AAAA,IAC/C,SAAS,CAAC,KAAK;AAAA,EACjB;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS;AAAA,IAClB,aAAa;AAAA,IACb,UAAU,CAAC,YAAY,SAAS,UAAU;AAAA,IAC1C,SAAS,CAAC,UAAU,SAAS,YAAY,WAAW,YAAY,KAAK;AAAA,EACvE;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU;AAAA,IACnB,aAAa;AAAA,IACb,UAAU,CAAC,6BAA6B;AAAA,IACxC,SAAS,CAAC,QAAQ,OAAO,UAAU,UAAU;AAAA,EAC/C;;;ACPO,MAAI,gBAAgB;AAAA,IACzB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,kBAAkB;AAAA,IAC3B,aAAa;AAAA,IACb,UAAU,CAAC,wEAAwE,yEAAyE,oBAAoB;AAAA,IAChL,SAAS,CAAC,SAAS,MAAM;AAAA,EAC3B;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU;AAAA,IACnB,aAAa;AAAA,IACb,UAAU,CAAC,4BAA4B,yBAAyB,UAAU;AAAA,IAC1E,SAAS,CAAC,QAAQ,WAAW;AAAA,EAC/B;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,WAAW;AAAA,IACpB,aAAa;AAAA,IACb,UAAU,CAAC,8CAA8C,0BAA0B,wBAAwB,WAAW;AAAA,IACtH,SAAS,CAAC,SAAS,WAAW;AAAA,EAChC;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,WAAW;AAAA,IACpB,aAAa;AAAA,IACb,UAAU,CAAC,aAAa,WAAW,OAAO,OAAO;AAAA,IACjD,SAAS,CAAC,YAAY,OAAO,QAAQ,MAAM;AAAA,EAC7C;;;ACPO,MAAI,eAAe;AAAA,IACxB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS,gBAAgB;AAAA,IAClC,aAAa;AAAA,IACb,UAAU,CAAC,eAAe,SAAS,aAAa,aAAa,eAAe;AAAA,IAC5E,SAAS,CAAC,KAAK;AAAA,EACjB;;;ACPO,MAAI,iBAAiB;AAAA,IAC1B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,MAAM,eAAe;AAAA,IAC9B,aAAa;AAAA,IACb,UAAU,CAAC,QAAQ,WAAW,OAAO;AAAA,IACrC,SAAS,CAAC,OAAO,YAAY,WAAW;AAAA,EAC1C;;;ACPO,MAAI,gBAAgB;AAAA,IACzB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,MAAM,cAAc;AAAA,IAC7B,aAAa;AAAA,IACb,UAAU,CAAC,SAAS,MAAM;AAAA,IAC1B,SAAS,CAAC,OAAO,YAAY,YAAY;AAAA,EAC3C;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,YAAY;AAAA,IACrB,aAAa;AAAA,IACb,UAAU,CAAC,eAAe,cAAc,oBAAoB;AAAA,IAC5D,SAAS,CAAC,OAAO,KAAK;AAAA,EACxB;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS,cAAc;AAAA,IAChC,aAAa;AAAA,IACb,UAAU,CAAC,SAAS,mBAAmB,kBAAkB;AAAA,IACzD,SAAS,CAAC,UAAU,SAAS,UAAU,aAAa,mBAAmB,eAAe;AAAA,EACxF;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,MAAM,WAAW;AAAA,IAC1B,aAAa;AAAA,IACb,UAAU,CAAC,MAAM,MAAM,oBAAoB;AAAA,IAC3C,SAAS,CAAC,UAAU,SAAS,UAAU,aAAa,mBAAmB,eAAe;AAAA,EACxF;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS,aAAa;AAAA,IAC/B,aAAa;AAAA,IACb,UAAU,CAAC,SAAS,qBAAqB;AAAA,IACzC,SAAS,CAAC,UAAU,UAAU,UAAU,aAAa,mBAAmB,eAAe;AAAA,EACzF;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,cAAc;AAAA,IACvB,aAAa;AAAA,IACb,UAAU,CAAC,eAAe,sBAAsB;AAAA,IAChD,SAAS,CAAC,UAAU,UAAU,SAAS,aAAa,mBAAmB,eAAe;AAAA,EACxF;;;ACPO,MAAI,gBAAgB;AAAA,IACzB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU,iBAAiB;AAAA,IACpC,aAAa;AAAA,IACb,UAAU,CAAC,UAAU,QAAQ;AAAA,IAC7B,SAAS,CAAC,UAAU,UAAU,SAAS,UAAU,mBAAmB,eAAe;AAAA,EACrF;;;ACPO,MAAI,sBAAsB;AAAA,IAC/B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU,uBAAuB;AAAA,IAC1C,aAAa;AAAA,IACb,UAAU,CAAC,UAAU,UAAU,UAAU;AAAA,IACzC,SAAS,CAAC,UAAU,UAAU,SAAS,UAAU,aAAa,eAAe;AAAA,EAC/E;;;ACPO,MAAI,oBAAoB;AAAA,IAC7B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,WAAW,qBAAqB;AAAA,IACzC,aAAa;AAAA,IACb,UAAU,CAAC,WAAW,UAAU,WAAW;AAAA,IAC3C,SAAS,CAAC,UAAU,UAAU,SAAS,UAAU,aAAa,iBAAiB;AAAA,EACjF;;;ACPO,MAAI,kBAAkB;AAAA,IAC3B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,gBAAgB;AAAA,IACzB,aAAa;AAAA,IACb,UAAU,CAAC,kBAAkB,gBAAgB;AAAA,IAC7C,SAAS,CAAC,YAAY;AAAA,EACxB;;;ACPO,MAAI,cAAc;AAAA,IACvB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,YAAY;AAAA,IACrB,aAAa;AAAA,IACb,UAAU,CAAC,cAAc,YAAY;AAAA,IACrC,SAAS,CAAC,aAAa;AAAA,EACzB;;;ACPO,MAAI,kBAAkB;AAAA,IAC3B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,mBAAmB;AAAA,IAC5B,aAAa;AAAA,IACb,UAAU,CAAC,mBAAmB;AAAA,IAC9B,SAAS,CAAC,cAAc;AAAA,EAC1B;;;ACPO,MAAI,iBAAiB;AAAA,IAC1B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,kBAAkB;AAAA,IAC3B,aAAa;AAAA,IACb,UAAU,CAAC,kBAAkB;AAAA,IAC7B,SAAS,CAAC,eAAe,WAAW;AAAA,EACtC;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,QAAQ;AAAA,IACjB,aAAa;AAAA,IACb,UAAU,CAAC,eAAe,eAAe,aAAa;AAAA,IACtD,SAAS,CAAC,MAAM,MAAM,QAAQ,KAAK;AAAA,EACrC;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS;AAAA,IAClB,aAAa;AAAA,IACb,UAAU,CAAC,gBAAgB,gBAAgB,aAAa;AAAA,IACxD,SAAS,CAAC,MAAM,MAAM,OAAO,KAAK;AAAA,EACpC;;;ACPO,MAAI,SAAS;AAAA,IAClB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,OAAO;AAAA,IAChB,aAAa;AAAA,IACb,UAAU,CAAC,cAAc,cAAc,aAAa,SAAS;AAAA,IAC7D,SAAS,CAAC,MAAM,QAAQ,OAAO,KAAK;AAAA,EACtC;;;ACPO,MAAI,SAAS;AAAA,IAClB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,OAAO;AAAA,IAChB,aAAa;AAAA,IACb,UAAU,CAAC,cAAc,cAAc,aAAa,SAAS;AAAA,IAC7D,SAAS,CAAC,MAAM,QAAQ,OAAO,KAAK;AAAA,EACtC;;;ACPO,MAAI,eAAe;AAAA,IACxB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,wBAAwB,+BAA+B,wCAAwC,6CAA6C;AAAA,IACrJ,aAAa;AAAA,IACb,UAAU,CAAC,qBAAqB,wBAAwB,4BAA4B,yCAAyC,kDAAkD;AAAA,IAC/K,SAAS,CAAC,UAAU,SAAS,SAAS;AAAA,EACxC;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU;AAAA,IACnB,aAAa;AAAA,IACb,UAAU,CAAC,uBAAuB,wCAAwC,wBAAwB,kCAAkC,iDAAiD,mBAAmB;AAAA,IACxM,SAAS,CAAC,YAAY,SAAS,SAAS;AAAA,EAC1C;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,eAAe,wBAAwB,qCAAqC,4CAA4C;AAAA,IACjI,aAAa;AAAA,IACb,UAAU,CAAC,oCAAoC,oBAAoB,2BAA2B,oBAAoB,wBAAwB,0BAA0B,yBAAyB,2BAA2B,uBAAuB;AAAA,IAC/O,SAAS,CAAC,UAAU,YAAY,SAAS;AAAA,EAC3C;;;ACPO,MAAI,cAAc;AAAA,IACvB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,kBAAkB,qCAAqC;AAAA,IAChE,aAAa;AAAA,IACb,UAAU,CAAC,sCAAsC,qBAAqB,4BAA4B,8BAA8B;AAAA,IAChI,SAAS,CAAC,UAAU,SAAS,UAAU;AAAA,EACzC;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,gBAAgB,cAAc;AAAA,IACvC,aAAa;AAAA,IACb,UAAU,CAAC,cAAc,iBAAiB;AAAA,IAC1C,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,eAAe;AAAA,IACxB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,gCAAgC,gCAAgC;AAAA,IACzE,aAAa;AAAA,IACb,UAAU,CAAC,0BAA0B,0BAA0B;AAAA,IAC/D,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,gBAAgB;AAAA,IACzB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,yCAAyC,gCAAgC;AAAA,IAClF,aAAa;AAAA,IACb,UAAU,CAAC,iDAAiD,iDAAiD;AAAA,IAC7G,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,WAAW,WAAW;AAAA,IAC/B,aAAa;AAAA,IACb,UAAU,CAAC,kBAAkB,iBAAiB,SAAS;AAAA,IACvD,SAAS,CAAC,OAAO,MAAM,KAAK;AAAA,EAC9B;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS,QAAQ;AAAA,IAC1B,aAAa;AAAA,IACb,UAAU,CAAC,YAAY,aAAa,SAAS,OAAO;AAAA,IACpD,SAAS,CAAC,OAAO,MAAM,KAAK;AAAA,EAC9B;;;ACPO,MAAI,cAAc;AAAA,IACvB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU,eAAe;AAAA,IAClC,aAAa;AAAA,IACb,UAAU,CAAC,cAAc,mBAAmB,WAAW,eAAe,yBAAyB;AAAA,IAC/F,SAAS,CAAC,OAAO,MAAM,KAAK;AAAA,EAC9B;;;ACPO,MAAI,SAAS;AAAA,IAClB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU,UAAU;AAAA,IAC7B,aAAa;AAAA,IACb,UAAU,CAAC,iBAAiB,kBAAkB,QAAQ;AAAA,IACtD,SAAS,CAAC,OAAO,OAAO,KAAK;AAAA,EAC/B;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,WAAW,WAAW;AAAA,IAC/B,aAAa;AAAA,IACb,UAAU,CAAC,kBAAkB,mBAAmB,iBAAiB,SAAS;AAAA,IAC1E,SAAS,CAAC,OAAO,OAAO,IAAI;AAAA,EAC9B;;;ACPO,MAAI,gBAAgB;AAAA,IACzB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,6BAA6B;AAAA,IACtC,aAAa;AAAA,IACb,UAAU;AAAA,MAAC;AAAA,MAAwB;AAAA;AAAA,MAEnC;AAAA;AAAA,IACA;AAAA,IACA,SAAS,CAAC,OAAO,SAAS;AAAA,EAC5B;;;ACVO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,kBAAkB;AAAA,IAC3B,aAAa;AAAA,IACb,UAAU,CAAC,wBAAwB,gBAAgB,cAAc;AAAA,IACjE,SAAS,CAAC,OAAO,mBAAmB;AAAA,EACtC;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,wBAAwB,2BAA2B;AAAA,IAC5D,aAAa;AAAA,IACb,UAAU,CAAC,oBAAoB,oBAAoB,gBAAgB,mBAAmB,iBAAiB;AAAA,IACvG,SAAS,CAAC,OAAO,QAAQ,YAAY,OAAO,QAAQ,SAAS,QAAQ,WAAW,UAAU,SAAS,aAAa,OAAO;AAAA,EACzH;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU;AAAA,IACnB,aAAa;AAAA,IACb,UAAU,CAAC,0BAA0B,YAAY,WAAW,sBAAsB;AAAA,IAClF,SAAS,CAAC,MAAM;AAAA,EAClB;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,aAAa;AAAA,IACtB,aAAa;AAAA,IACb,UAAU,CAAC,gCAAgC,gCAAgC,8BAA8B;AAAA,IACzG,SAAS,CAAC,YAAY,KAAK;AAAA,EAC7B;;;ACPO,MAAI,iBAAiB;AAAA,IAC1B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,MAAO,eAAe;AAAA,IAC/B,aAAa;AAAA,IACb,UAAU,CAAC,0BAA0B,MAAO,eAAe;AAAA,IAC3D,SAAS,CAAC,UAAU,OAAO,QAAQ,YAAY,OAAO,QAAQ,SAAS,QAAQ,WAAW,UAAU,SAAS,OAAO;AAAA,EACtH;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,QAAQ;AAAA,IACjB,aAAa;AAAA,IACb,UAAU,CAAC,qBAAqB,qCAAqC;AAAA,IACrE,SAAS,CAAC,UAAU,QAAQ,YAAY,OAAO,QAAQ,SAAS,QAAQ,WAAW,UAAU,SAAS,aAAa,OAAO;AAAA,EAC5H;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,WAAW,YAAY;AAAA,IAChC,aAAa;AAAA,IACb,UAAU,CAAC,aAAa,gBAAgB,mCAAmC,SAAS;AAAA,IACpF,SAAS,CAAC,UAAU,OAAO,YAAY,OAAO,QAAQ,SAAS,QAAQ,WAAW,UAAU,SAAS,aAAa,OAAO;AAAA,EAC3H;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,aAAa,gBAAgB;AAAA,IACtC,aAAa,CAAC,mFAAmF,4GAA4G,oEAAoE,qEAAqE,2DAA6D,6HAA6H;AAAA,IAChhB,UAAU,CAAC,uBAAuB,WAAW,cAAc,wBAAwB,WAAW,cAAc,cAAc,yBAAyB,mCAAmC;AAAA,IACtL,SAAS,CAAC,YAAY,iBAAiB;AAAA,EACzC;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,aAAa,OAAO;AAAA,IAC7B,aAAa;AAAA,IACb,UAAU,CAAC,6BAA6B,uBAAuB;AAAA,IAC/D,SAAS,CAAC,YAAY,OAAO;AAAA,EAC/B;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS;AAAA,IAClB,aAAa;AAAA,IACb,UAAU,CAAC,8BAA8B,mFAAmF;AAAA,IAC5H,SAAS,CAAC,KAAK;AAAA,EACjB;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,iBAAiB;AAAA,IAC1B,aAAa;AAAA,IACb,UAAU,CAAC,yBAAyB,yCAAyC,kCAAkC;AAAA,IAC/G,SAAS,CAAC,QAAQ,OAAO,SAAS;AAAA,EACpC;;;ACPO,MAAI,cAAc;AAAA,IACvB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,YAAY;AAAA,IACrB,aAAa;AAAA,IACb,UAAU,CAAC,0BAA0B,WAAW,kBAAkB,SAAS;AAAA,IAC3E,SAAS,CAAC,UAAU,UAAU,QAAQ,SAAS;AAAA,EACjD;;;ACPO,MAAI,cAAc;AAAA,IACvB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,sBAAsB;AAAA,IAC/B,aAAa;AAAA,IACb,UAAU,CAAC,qBAAqB,6EAA6E,wCAAwC,cAAc;AAAA,IACnK,SAAS,CAAC,OAAO,QAAQ,QAAQ;AAAA,EACnC;;;ACPO,MAAI,wBAAwB;AAAA,IACjC,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,sBAAsB;AAAA,IAC/B,aAAa;AAAA,IACb,UAAU,CAAC,gCAAgC,yCAAyC,kCAAkC,sCAAsC;AAAA,IAC5J,SAAS,CAAC,UAAU,UAAU,QAAQ;AAAA,EACxC;;;ACPO,MAAI,eAAe;AAAA,IACxB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,eAAe,kBAAkB,kBAAkB;AAAA,IAC5D,aAAa;AAAA,IACb,UAAU,CAAC,eAAe,kBAAkB,0BAA0B,mBAAmB;AAAA,IACzF,SAAS,CAAC,UAAU,OAAO,QAAQ,OAAO,QAAQ,SAAS,QAAQ,WAAW,UAAU,SAAS,aAAa,OAAO;AAAA,EACvH;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,QAAQ;AAAA,IACjB,aAAa;AAAA,IACb,UAAU,CAAC,qBAAqB,UAAU,OAAO;AAAA,IACjD,SAAS,CAAC,UAAU,OAAO,QAAQ,YAAY,QAAQ,SAAS,QAAQ,WAAW,UAAU,SAAS,aAAa,OAAO;AAAA,EAC5H;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS;AAAA,IAClB,aAAa;AAAA,IACb,UAAU,CAAC,sBAAsB,kCAAkC,SAAS;AAAA,IAC5E,SAAS,CAAC,KAAK;AAAA,EACjB;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,YAAY;AAAA,IACrB,aAAa;AAAA,IACb,UAAU,CAAC,4CAA4C,sBAAsB;AAAA,IAC7E,SAAS,CAAC,YAAY,OAAO,OAAO;AAAA,EACtC;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,oBAAoB,0BAA0B;AAAA,IACvD,aAAa;AAAA,IACb,UAAU,CAAC,0BAA0B,qCAAqC;AAAA,IAC1E,SAAS,CAAC,UAAU,SAAS;AAAA,EAC/B;;;ACPO,MAAI,wBAAwB;AAAA,IACjC,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,6BAA6B,iCAAiC,qCAAqC;AAAA,IAC5G,aAAa;AAAA,IACb,UAAU,CAAC,6CAA6C;AAAA,IACxD,SAAS,CAAC,UAAU,kBAAkB,sBAAsB,OAAO;AAAA,EACrE;;;ACPO,MAAI,yBAAyB;AAAA,IAClC,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,gCAAgC,wCAAwC,kDAAkD,wCAAwC,gDAAgD;AAAA,IAC3N,aAAa;AAAA,IACb,UAAU,CAAC,sBAAsB,gCAAgC,mCAAmC,+CAA+C,iCAAiC;AAAA,IACpL,SAAS,CAAC,UAAU,kBAAkB,qBAAqB,OAAO;AAAA,EACpE;;;ACPO,MAAI,qBAAqB;AAAA,IAC9B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,0BAA0B,8BAA8B,kCAAkC;AAAA,IACnG,aAAa;AAAA,IACb,UAAU,CAAC,0CAA0C;AAAA,IACrD,SAAS,CAAC,UAAU,qBAAqB,sBAAsB,OAAO;AAAA,EACxE;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,WAAW,cAAc,sBAAsB,aAAa,gBAAgB,sBAAsB;AAAA,IAC3G,aAAa;AAAA,IACb,UAAU,CAAC,WAAW,cAAc,qBAAqB,0BAA0B,eAAe;AAAA,IAClG,SAAS,CAAC,UAAU,OAAO,QAAQ,YAAY,OAAO,SAAS,QAAQ,WAAW,UAAU,SAAS,aAAa,OAAO;AAAA,EAC3H;;;ACPO,MAAI,sBAAsB;AAAA,IAC/B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,yBAAyB,gCAAgC;AAAA,IAClE,aAAa;AAAA,IACb,UAAU,CAAC,kCAAkC,yDAAyD,mBAAmB,8DAA8D,OAAO,sEAAwE,KAAK;AAAA,IAC3Q,SAAS,CAAC,MAAM;AAAA,EAClB;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,aAAa,kBAAkB,qBAAqB,2BAA2B,eAAe;AAAA,IACvG,aAAa;AAAA,IACb,UAAU,CAAC,OAAO,WAAW,eAAe,mBAAmB,iBAAiB,qBAAqB,gCAAgC,aAAa;AAAA,IAClJ,SAAS,CAAC,UAAU,OAAO,QAAQ,YAAY,OAAO,QAAQ,QAAQ,WAAW,UAAU,SAAS,aAAa,OAAO;AAAA,EAC1H;;;ACPO,MAAI,cAAc;AAAA,IACvB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,mBAAmB;AAAA,IAC5B,aAAa;AAAA,IACb,UAAU,CAAC,uCAAuC,qCAAqC,kCAAkC,gCAAgC;AAAA,IACzJ,SAAS,CAAC,QAAQ,WAAW,QAAQ;AAAA,EACvC;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,mBAAmB,+BAA+B;AAAA,IAC3D,aAAa;AAAA,IACb,UAAU,CAAC,4BAA4B,wBAAwB,4BAA4B,qBAAqB,2BAA2B;AAAA,IAC3I,SAAS,CAAC,QAAQ,UAAU,WAAW,SAAS;AAAA,EAClD;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,oBAAoB,qBAAqB;AAAA,IAClD,aAAa;AAAA,IACb,UAAU,CAAC,0BAA0B,yCAAyC,+CAA+C,6DAA6D;AAAA,IAC1L,SAAS,CAAC,UAAU,gBAAgB;AAAA,EACtC;;;ACPO,MAAI,qBAAqB;AAAA,IAC9B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,yBAAyB,4BAA4B,kCAAkC;AAAA,IAChG,aAAa;AAAA,IACb,UAAU,CAAC,0BAA0B,4CAA4C,gDAAgD;AAAA,IACjI,SAAS,CAAC,OAAO,KAAK;AAAA,EACxB;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,eAAe;AAAA,IACxB,aAAa;AAAA,IACb,UAAU,CAAC,wBAAwB,aAAa,WAAW;AAAA,IAC3D,SAAS,CAAC,UAAU,gBAAgB;AAAA,EACtC;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS;AAAA,IAClB,aAAa;AAAA,IACb,UAAU,CAAC,aAAa,uBAAuB,0BAA0B,WAAW,WAAW;AAAA,IAC/F,SAAS,CAAC,UAAU,SAAS,OAAO,QAAQ,YAAY,OAAO,QAAQ,SAAS,WAAW,UAAU,SAAS,aAAa,OAAO;AAAA,EACpI;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,WAAW,kBAAkB;AAAA,IACtC,aAAa;AAAA,IACb,UAAU,CAAC,oBAAoB,yCAAyC,gDAAgD,kDAAkD,mCAAmC;AAAA,IAC7M,SAAS,CAAC,OAAO,UAAU,SAAS;AAAA,EACtC;;;ACPO,MAAI,cAAc;AAAA,IACvB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,YAAY;AAAA,IACrB,aAAa;AAAA,IACb,UAAU,CAAC,oBAAoB,oBAAoB,oBAAoB,kBAAkB;AAAA,IACzF,SAAS,CAAC,UAAU,OAAO,QAAQ,YAAY,OAAO,QAAQ,SAAS,QAAQ,UAAU,SAAS,aAAa,OAAO;AAAA,EACxH;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,gBAAgB,8BAA8B,0BAA0B,qCAAqC;AAAA,IACtH,aAAa;AAAA,IACb,UAAU,CAAC,oBAAoB,UAAU,sBAAsB,oBAAoB,aAAa,WAAW,WAAW,qCAAqC,GAAG;AAAA,IAC9J,SAAS,CAAC,UAAU,OAAO,QAAQ,YAAY,OAAO,QAAQ,SAAS,QAAQ,WAAW,SAAS,aAAa,OAAO;AAAA,EACzH;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU;AAAA,IACnB,aAAa;AAAA,IACb,UAAU,CAAC,oCAAoC,UAAU;AAAA,IACzD,SAAS,CAAC,UAAU,OAAO,QAAQ,YAAY,OAAO,QAAQ,SAAS,QAAQ,WAAW,UAAU,aAAa,OAAO;AAAA,EAC1H;;;ACPO,MAAI,gBAAgB;AAAA,IACzB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,MAAO,cAAc;AAAA,IAC9B,aAAa;AAAA,IACb,UAAU,CAAC,0BAA0B,MAAO,cAAc;AAAA,IAC1D,SAAS,CAAC,UAAU,OAAO,QAAQ,YAAY,OAAO,QAAQ,SAAS,QAAQ,WAAW,UAAU,SAAS,OAAO;AAAA,EACtH;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,YAAY,eAAe,uBAAuB,cAAc,iBAAiB,uBAAuB;AAAA,IACjH,aAAa;AAAA,IACb,UAAU,CAAC,YAAY,eAAe,0BAA0B,gBAAgB;AAAA,IAChF,SAAS,CAAC,UAAU,OAAO,QAAQ,YAAY,OAAO,QAAQ,SAAS,QAAQ,WAAW,UAAU,SAAS,WAAW;AAAA,EAC1H;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,QAAQ;AAAA,IACjB,aAAa;AAAA,IACb,UAAU,CAAC,uBAAuB;AAAA,IAClC,SAAS,CAAC,MAAM;AAAA,EAClB;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS;AAAA,IAClB,aAAa;AAAA,IACb,UAAU,CAAC,wBAAwB;AAAA,IACnC,SAAS,CAAC,KAAK;AAAA,EACjB;;;ACPO,MAAI,gBAAgB;AAAA,IACzB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,cAAc;AAAA,IACvB,aAAa;AAAA,IACb,UAAU,CAAC,gBAAgB,yBAAyB;AAAA,IACpD,SAAS,CAAC,gBAAgB,SAAS,YAAY;AAAA,EACjD;;;ACPO,MAAI,mBAAmB;AAAA,IAC5B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,oBAAoB;AAAA,IAC7B,aAAa;AAAA,IACb,UAAU,CAAC,oBAAoB;AAAA,IAC/B,SAAS,CAAC,uBAAuB,gBAAgB,WAAW;AAAA,EAC9D;;;ACPO,MAAI,0BAA0B;AAAA,IACnC,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,2BAA2B;AAAA,IACpC,aAAa;AAAA,IACb,UAAU,CAAC,2BAA2B;AAAA,IACtC,SAAS,CAAC,gBAAgB,gBAAgB,WAAW;AAAA,EACvD;;;ACPO,MAAI,gBAAgB;AAAA,IACzB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,MAAM,cAAc;AAAA,IAC7B,aAAa;AAAA,IACb,UAAU,CAAC,MAAM,qBAAqB,IAAI;AAAA,IAC1C,SAAS,CAAC,gBAAgB,uBAAuB,gBAAgB,OAAO;AAAA,EAC1E;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU;AAAA,IACnB,aAAa;AAAA,IACb,UAAU,CAAC,YAAY,MAAM,cAAc,UAAU;AAAA,IACrD,SAAS,CAAC,WAAW;AAAA,EACvB;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,WAAW;AAAA,IACpB,aAAa;AAAA,IACb,UAAU,CAAC,aAAa,eAAe,aAAa,yBAAyB;AAAA,IAC7E,SAAS,CAAC,OAAO;AAAA,EACnB;;;ACPO,MAAI,mBAAmB;AAAA,IAC5B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,oBAAoB;AAAA,IAC7B,aAAa;AAAA,IACb,UAAU,CAAC,4CAA4C;AAAA,IACvD,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,kBAAkB;AAAA,IAC3B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,gBAAgB;AAAA,IACzB,aAAa;AAAA,IACb,UAAU,CAAC,wBAAwB;AAAA,IACnC,SAAS,CAAC,gBAAgB,WAAW;AAAA,EACvC;;;ACPO,MAAI,mBAAmB;AAAA,IAC5B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,mBAAmB,oBAAoB;AAAA,IAChD,aAAa;AAAA,IACb,UAAU,CAAC,mBAAmB,oBAAoB;AAAA,IAClD,SAAS,CAAC,gBAAgB,uBAAuB,WAAW;AAAA,EAC9D;;;ACPO,MAAI,iBAAiB;AAAA,IAC1B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,qBAAqB,6BAA6B,8BAA8B,sCAAsC,oCAAoC;AAAA,IACnK,aAAa;AAAA,IACb,UAAU,CAAC,oBAAoB,4BAA4B,+BAA+B,0CAA0C,6CAA6C,2CAA2C;AAAA,IAC5N,SAAS,CAAC,UAAU,WAAW;AAAA,EACjC;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,YAAY,eAAe,oBAAoB,gBAAgB,qBAAqB,wBAAwB;AAAA,IACrH,aAAa;AAAA,IACb,UAAU,CAAC,YAAY,kBAAkB,gBAAgB;AAAA,IACzD,SAAS,CAAC,cAAc,WAAW;AAAA,EACrC;;;ACPO,MAAI,gBAAgB;AAAA,IACzB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,kBAAkB,uBAAuB,mBAAmB,wBAAwB,2BAA2B;AAAA,IACxH,aAAa;AAAA,IACb,UAAU,CAAC,qBAAqB,uBAAuB;AAAA,IACvD,SAAS,CAAC,cAAc,QAAQ;AAAA,EAClC;;;ACPO,MAAI,cAAc;AAAA,IACvB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,eAAe;AAAA,IACxB,aAAa;AAAA,IACb,UAAU,CAAC,iBAAiB,iBAAiB,iBAAiB,sBAAsB,uBAAuB;AAAA,IAC3G,SAAS,CAAC,SAAS,WAAW,WAAW,aAAa,YAAY,kBAAkB,aAAa;AAAA,EACnG;;;ACPO,MAAI,qBAAqB;AAAA,IAC9B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,sBAAsB;AAAA,IAC/B,aAAa;AAAA,IACb,UAAU,CAAC,wBAAwB,wBAAwB,wBAAwB,6BAA6B,6BAA6B,kCAAkC,wCAAwC,qCAAqC,kCAAkC,gCAAgC;AAAA,IAC9T,SAAS,CAAC,SAAS,WAAW,WAAW,aAAa,YAAY,WAAW,aAAa;AAAA,EAC5F;;;ACPO,MAAI,kBAAkB;AAAA,IAC3B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,mBAAmB;AAAA,IAC5B,aAAa;AAAA,IACb,UAAU,CAAC,yBAAyB,yBAAyB,yBAAyB,0BAA0B,sBAAsB,kBAAkB,6BAA6B,mCAAmC;AAAA,IACxN,SAAS,CAAC,WAAW,gBAAgB;AAAA,EACvC;;;ACPO,MAAI,gBAAgB;AAAA,IACzB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,iBAAiB;AAAA,IAC1B,aAAa;AAAA,IACb,UAAU,CAAC,+BAA+B,2BAA2B;AAAA,IACrE,SAAS,CAAC,SAAS,WAAW,WAAW,UAAU,aAAa,YAAY,SAAS;AAAA,EACvF;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU,aAAa;AAAA,IAChC,aAAa;AAAA,IACb,UAAU,CAAC,YAAY,YAAY,WAAW,aAAa,UAAU,cAAc;AAAA,IACnF,SAAS,CAAC,WAAW,WAAW,UAAU,aAAa,YAAY,WAAW,aAAa,WAAW;AAAA,EACxG;;;ACPO,MAAI,gBAAgB;AAAA,IACzB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,iBAAiB;AAAA,IAC1B,aAAa;AAAA,IACb,UAAU,CAAC,+BAA+B,uBAAuB,wBAAwB,4BAA4B,iCAAiC;AAAA,IACtJ,SAAS,CAAC,WAAW,kBAAkB,eAAe,OAAO;AAAA,EAC/D;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS,cAAc;AAAA,IAChC,aAAa;AAAA,IACb,UAAU,CAAC,SAAS,WAAW,WAAW,aAAa,WAAW,WAAW,eAAe;AAAA,IAC5F,SAAS,CAAC,SAAS,WAAW,WAAW,aAAa,YAAY,SAAS;AAAA,EAC7E;;;ACPO,MAAI,eAAe;AAAA,IACxB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU,gBAAgB;AAAA,IACnC,aAAa;AAAA,IACb,UAAU,CAAC,YAAY,WAAW,WAAW,aAAa,UAAU;AAAA,IACpE,SAAS,CAAC,SAAS,WAAW,aAAa,WAAW,SAAS;AAAA,EACjE;;;ACPO,MAAI,cAAc;AAAA,IACvB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS,eAAe;AAAA,IACjC,aAAa;AAAA,IACb,UAAU,CAAC,SAAS,WAAW,WAAW,aAAa,WAAW,eAAe;AAAA,IACjF,SAAS,CAAC,SAAS,WAAW,UAAU,aAAa,YAAY,SAAS;AAAA,EAC5E;;;ACPO,MAAI,gBAAgB;AAAA,IACzB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU,iBAAiB;AAAA,IACpC,aAAa;AAAA,IACb,UAAU,CAAC,YAAY,WAAW,WAAW,aAAa,UAAU;AAAA,IACpE,SAAS,CAAC,SAAS,WAAW,UAAU,WAAW,YAAY,SAAS;AAAA,EAC1E;;;ACPO,MAAI,cAAc;AAAA,IACvB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU,eAAe;AAAA,IAClC,aAAa;AAAA,IACb,UAAU,CAAC,YAAY,YAAY,WAAW,aAAa,UAAU,gBAAgB,gBAAgB;AAAA,IACrG,SAAS,CAAC,SAAS,WAAW,UAAU,aAAa,YAAY,WAAW,WAAW;AAAA,EACzF;;;ACPO,MAAI,mBAAmB;AAAA,IAC5B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,0BAA0B;AAAA,IACnC,aAAa;AAAA,IACb,UAAU,CAAC,8BAA8B;AAAA,IACzC,SAAS,CAAC,YAAY,gBAAgB,iBAAiB,aAAa;AAAA,EACtE;;;ACPO,MAAI,oBAAoB;AAAA,IAC7B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,2BAA2B;AAAA,IACpC,aAAa;AAAA,IACb,UAAU,CAAC,6CAA6C,mDAAmD;AAAA,IAC3G,SAAS,CAAC,YAAY,gBAAgB,kBAAkB;AAAA,EAC1D;;;ACPO,MAAI,kBAAkB;AAAA,IAC3B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,kBAAkB;AAAA,IAC3B,aAAa;AAAA,IACb,UAAU,CAAC,iCAAiC;AAAA,IAC5C,SAAS,CAAC,iBAAiB;AAAA,EAC7B;;;ACPO,MAAI,mBAAmB;AAAA,IAC5B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,0BAA0B;AAAA,IACnC,aAAa;AAAA,IACb,UAAU,CAAC,4CAA4C,kDAAkD;AAAA,IACzG,SAAS,CAAC,YAAY,eAAe;AAAA,EACvC;;;ACPO,MAAI,kBAAkB;AAAA,IAC3B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,yBAAyB;AAAA,IAClC,aAAa;AAAA,IACb,UAAU,CAAC,qCAAqC,mCAAmC;AAAA,IACnF,SAAS,CAAC,YAAY,gBAAgB,eAAe;AAAA,EACvD;;;ACPO,MAAI,sBAAsB;AAAA,IAC/B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,+BAA+B;AAAA,IACxC,aAAa;AAAA,IACb,UAAU,CAAC,oCAAoC,kCAAkC;AAAA,IACjF,SAAS,CAAC,eAAe,SAAS;AAAA,EACpC;;;ACPO,MAAI,kBAAkB;AAAA,IAC3B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,kBAAkB;AAAA,IAC3B,aAAa;AAAA,IACb,UAAU,CAAC,wBAAwB;AAAA,IACnC,SAAS,CAAC,cAAc;AAAA,EAC1B;;;ACPO,MAAI,cAAc;AAAA,IACvB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,gBAAgB,sBAAsB;AAAA,IAC/C,aAAa;AAAA,IACb,UAAU,CAAC,yBAAyB,6BAA6B;AAAA,IACjE,SAAS,CAAC,YAAY,gBAAgB,eAAe;AAAA,EACvD;;;ACPO,MAAI,uBAAuB;AAAA,IAChC,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,8BAA8B;AAAA,IACvC,aAAa;AAAA,IACb,UAAU,CAAC,gDAAgD,sDAAsD;AAAA,IACjH,SAAS,CAAC,YAAY,gBAAgB,eAAe;AAAA,EACvD;;;ACPO,MAAI,eAAe;AAAA,IACxB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,sBAAsB;AAAA,IAC/B,aAAa;AAAA,IACb,UAAU,CAAC,wCAAwC,8CAA8C;AAAA,IACjG,SAAS,CAAC,gBAAgB,eAAe;AAAA,EAC3C;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,iBAAiB;AAAA,IAC1B,aAAa;AAAA,IACb,UAAU,CAAC,+BAA+B,4BAA4B,oCAAoC;AAAA,IAC1G,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,eAAe,gBAAgB;AAAA,IACxC,aAAa;AAAA,IACb,UAAU,CAAC,4BAA4B,oCAAoC,+BAA+B;AAAA,IAC1G,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,QAAQ;AAAA,IACjB,aAAa;AAAA,IACb,UAAU,CAAC,YAAY,aAAa,QAAQ;AAAA,IAC5C,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS;AAAA,IAClB,aAAa;AAAA,IACb,UAAU,CAAC,aAAa,cAAc,SAAS;AAAA,IAC/C,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,qBAAqB,QAAQ;AAAA,IACtC,aAAa;AAAA,IACb,UAAU,CAAC,mBAAmB,gBAAgB;AAAA,IAC9C,SAAS,CAAC,QAAQ,UAAU,OAAO,KAAK;AAAA,EAC1C;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,qBAAqB,UAAU,mBAAmB;AAAA,IAC3D,aAAa;AAAA,IACb,UAAU,CAAC,mBAAmB,qBAAqB,qBAAqB,wBAAwB,wBAAwB,iCAAiC,+BAA+B;AAAA,IACxL,SAAS,CAAC,QAAQ,UAAU,OAAO,QAAQ,OAAO,OAAO,UAAU;AAAA,EACrE;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,sBAAsB,WAAW,oBAAoB;AAAA,IAC9D,aAAa;AAAA,IACb,UAAU,CAAC,oBAAoB,sBAAsB,sBAAsB,yBAAyB,yBAAyB,4BAA4B;AAAA,IACzJ,SAAS,CAAC,OAAO,UAAU,OAAO,QAAQ,OAAO,OAAO,UAAU;AAAA,EACpE;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,wBAAwB,WAAW;AAAA,IAC5C,aAAa;AAAA,IACb,UAAU,CAAC,mBAAmB,uBAAuB;AAAA,IACrD,SAAS,CAAC,OAAO,QAAQ,OAAO,QAAQ,OAAO,OAAO,YAAY,aAAa;AAAA,EACjF;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,qBAAqB,UAAU,mBAAmB;AAAA,IAC3D,aAAa;AAAA,IACb,UAAU,CAAC,mBAAmB,qBAAqB,qBAAqB,wBAAwB,wBAAwB,iCAAiC,+BAA+B;AAAA,IACxL,SAAS,CAAC,OAAO,QAAQ,UAAU,QAAQ,OAAO,OAAO,UAAU;AAAA,EACrE;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,sBAAsB,WAAW,0BAA0B;AAAA,IACpE,aAAa;AAAA,IACb,UAAU,CAAC,uBAAuB,+BAA+B,qBAAqB;AAAA,IACtF,SAAS,CAAC,OAAO,QAAQ,OAAO,UAAU,QAAQ,OAAO,OAAO,UAAU;AAAA,EAC5E;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,sBAAsB,SAAS;AAAA,IACxC,aAAa;AAAA,IACb,UAAU,CAAC,iBAAiB,mBAAmB,oBAAoB;AAAA,IACnE,SAAS,CAAC,OAAO,QAAQ,OAAO,UAAU,OAAO,OAAO,OAAO,UAAU;AAAA,EAC3E;;;ACPO,MAAI,kBAAkB;AAAA,IAC3B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,kCAAkC,iDAAiD,6BAA6B;AAAA,IACzH,aAAa;AAAA,IACb,UAAU,CAAC,mCAAmC,0CAA0C,iCAAiC,uCAAuC;AAAA,IAChK,SAAS,CAAC,QAAQ,UAAU,OAAO,OAAO,QAAQ,OAAO,OAAO,UAAU;AAAA,EAC5E;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,qBAAqB,UAAU,qBAAqB,yBAAyB,kCAAkC;AAAA,IACxH,aAAa;AAAA,IACb,UAAU,CAAC,gBAAgB,qBAAqB,oCAAoC,+BAA+B,yBAAyB;AAAA,IAC5I,SAAS,CAAC,OAAO,QAAQ,OAAO,UAAU,QAAQ,OAAO,UAAU;AAAA,EACrE;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,wBAAwB,WAAW;AAAA,IAC5C,aAAa;AAAA,IACb,UAAU,CAAC,sBAAsB,wBAAwB,wBAAwB,2BAA2B,yBAAyB;AAAA,IACrI,SAAS,CAAC,OAAO,QAAQ,UAAU,OAAO,QAAQ,OAAO,OAAO,UAAU;AAAA,EAC5E;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,qBAAqB,UAAU,mBAAmB;AAAA,IAC3D,aAAa;AAAA,IACb,UAAU,CAAC,mBAAmB,qBAAqB,mBAAmB;AAAA,IACtE,SAAS,CAAC,OAAO,QAAQ,UAAU,OAAO,QAAQ,OAAO,UAAU;AAAA,EACrE;;;ACPO,MAAI,eAAe;AAAA,IACxB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,0BAA0B,eAAe,0BAA0B,8BAA8B,uCAAuC;AAAA,IACjJ,aAAa;AAAA,IACb,UAAU,CAAC,qBAAqB,0BAA0B,yCAAyC,oCAAoC,8BAA8B;AAAA,IACrK,SAAS,CAAC,OAAO,QAAQ,OAAO,UAAU,OAAO,QAAQ,OAAO,KAAK;AAAA,EACvE;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,WAAW;AAAA,IACpB,aAAa;AAAA,IACb,UAAU,CAAC,mCAAmC,sGAAsG;AAAA,IACpJ,SAAS,CAAC,OAAO,QAAQ,OAAO,UAAU,OAAO,QAAQ,OAAO,KAAK;AAAA,EACvE;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS;AAAA,IAClB,aAAa;AAAA,IACb,UAAU,CAAC,aAAa,gBAAgB;AAAA,IACxC,SAAS,CAAC,OAAO,QAAQ,MAAM;AAAA,EACjC;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU;AAAA,IACnB,aAAa;AAAA,IACb,UAAU,CAAC,YAAY;AAAA,IACvB,SAAS,CAAC,QAAQ,SAAS,OAAO;AAAA,EACpC;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS;AAAA,IAClB,aAAa;AAAA,IACb,UAAU,CAAC,aAAa,kBAAkB,SAAS;AAAA,IACnD,SAAS,CAAC,OAAO,MAAM;AAAA,EACzB;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU;AAAA,IACnB,aAAa;AAAA,IACb,UAAU,CAAC,YAAY,YAAY;AAAA,IACnC,SAAS,CAAC,SAAS,OAAO;AAAA,EAC5B;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS;AAAA,IAClB,aAAa;AAAA,IACb,UAAU,CAAC,WAAW,kBAAkB,WAAW;AAAA,IACnD,SAAS,CAAC,OAAO,QAAQ,MAAM;AAAA,EACjC;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU;AAAA,IACnB,aAAa;AAAA,IACb,UAAU,CAAC,YAAY;AAAA,IACvB,SAAS,CAAC,SAAS,OAAO;AAAA,EAC5B;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS;AAAA,IAClB,aAAa;AAAA,IACb,UAAU,CAAC,aAAa,kBAAkB,SAAS;AAAA,IACnD,SAAS,CAAC,QAAQ,QAAQ,MAAM;AAAA,EAClC;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU;AAAA,IACnB,aAAa;AAAA,IACb,UAAU,CAAC,YAAY;AAAA,IACvB,SAAS,CAAC,SAAS,OAAO;AAAA,EAC5B;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS;AAAA,IAClB,aAAa;AAAA,IACb,UAAU,CAAC,aAAa,gBAAgB;AAAA,IACxC,SAAS,CAAC,OAAO,QAAQ,MAAM;AAAA,EACjC;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU;AAAA,IACnB,aAAa;AAAA,IACb,UAAU,CAAC,YAAY;AAAA,IACvB,SAAS,CAAC,SAAS,OAAO;AAAA,EAC5B;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS;AAAA,IAClB,aAAa;AAAA,IACb,UAAU,CAAC,aAAa,gBAAgB;AAAA,IACxC,SAAS,CAAC,OAAO,QAAQ,MAAM;AAAA,EACjC;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,aAAa;AAAA,IACtB,aAAa;AAAA,IACb,UAAU,CAAC,oBAAoB,yBAAyB,kBAAkB,kBAAkB,aAAa;AAAA,IACzG,SAAS,CAAC,OAAO,OAAO,KAAK;AAAA,EAC/B;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU;AAAA,IACnB,aAAa;AAAA,IACb,UAAU,CAAC,YAAY;AAAA,IACvB,SAAS,CAAC,SAAS,OAAO;AAAA,EAC5B;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,QAAQ;AAAA,IACjB,aAAa;AAAA,IACb,UAAU,CAAC,UAAU,mBAAmB,gBAAgB,eAAe,yBAAyB;AAAA,IAChG,SAAS,CAAC,QAAQ,OAAO,KAAK;AAAA,EAChC;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS;AAAA,IAClB,aAAa;AAAA,IACb,UAAU,CAAC,WAAW;AAAA,IACtB,SAAS,CAAC,QAAQ,QAAQ,MAAM;AAAA,EAClC;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,QAAQ;AAAA,IACjB,aAAa;AAAA,IACb,UAAU,CAAC,UAAU,YAAY;AAAA,IACjC,SAAS,CAAC,OAAO,OAAO,KAAK;AAAA,EAC/B;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS;AAAA,IAClB,aAAa;AAAA,IACb,UAAU,CAAC,WAAW,aAAa;AAAA,IACnC,SAAS,CAAC,QAAQ,QAAQ,MAAM;AAAA,EAClC;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,QAAQ;AAAA,IACjB,aAAa;AAAA,IACb,UAAU,CAAC,UAAU,YAAY;AAAA,IACjC,SAAS,CAAC,OAAO,OAAO,KAAK;AAAA,EAC/B;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS;AAAA,IAClB,aAAa;AAAA,IACb,UAAU,CAAC,WAAW,aAAa;AAAA,IACnC,SAAS,CAAC,QAAQ,QAAQ,MAAM;AAAA,EAClC;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,QAAQ;AAAA,IACjB,aAAa;AAAA,IACb,UAAU,CAAC,UAAU,YAAY;AAAA,IACjC,SAAS,CAAC,OAAO,OAAO,KAAK;AAAA,EAC/B;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS;AAAA,IAClB,aAAa;AAAA,IACb,UAAU,CAAC,WAAW,aAAa;AAAA,IACnC,SAAS,CAAC,QAAQ,QAAQ,MAAM;AAAA,EAClC;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,QAAQ;AAAA,IACjB,aAAa;AAAA,IACb,UAAU,CAAC,UAAU,mBAAmB,eAAe,eAAe,yBAAyB;AAAA,IAC/F,SAAS,CAAC,QAAQ,OAAO,KAAK;AAAA,EAChC;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS;AAAA,IAClB,aAAa;AAAA,IACb,UAAU,CAAC,WAAW;AAAA,IACtB,SAAS,CAAC,QAAQ,MAAM;AAAA,EAC1B;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,QAAQ;AAAA,IACjB,aAAa;AAAA,IACb,UAAU,CAAC,YAAY,uBAAuB,eAAe,aAAa;AAAA,IAC1E,SAAS,CAAC,QAAQ,OAAO,KAAK;AAAA,EAChC;;;ACPO,MAAI,WAAW;AAAA,IACpB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,SAAS;AAAA,IAClB,aAAa;AAAA,IACb,UAAU,CAAC,aAAa,uBAAuB;AAAA,IAC/C,SAAS,CAAC,QAAQ,MAAM;AAAA,EAC1B;;;ACPO,MAAI,SAAS;AAAA,IAClB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,aAAa,aAAa;AAAA,IACnC,aAAa;AAAA,IACb,UAAU,CAAC,gBAAgB,cAAc,kBAAkB;AAAA,IAC3D,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,aAAa,uBAAuB,8BAA8B;AAAA,IAC3E,aAAa;AAAA,IACb,UAAU,CAAC,2BAA2B,8BAA8B,kCAAkC,+BAA+B,+CAA+C;AAAA,IACpL,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,YAAY;AAAA,IACrB,aAAa;AAAA,IACb,UAAU,CAAC,QAAQ;AAAA,IACnB,SAAS,CAAC,OAAO,KAAK;AAAA,EACxB;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU;AAAA,IACnB,aAAa;AAAA,IACb,UAAU,CAAC,cAAc,iBAAiB,iBAAiB,uBAAuB,sBAAsB;AAAA,IACxG,SAAS,CAAC;AAAA,EACZ;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,iBAAiB,0BAA0B;AAAA,IACpD,aAAa;AAAA,IACb,UAAU,CAAC,eAAe,kBAAkB,cAAc,eAAe;AAAA,IACzE,SAAS,CAAC,OAAO;AAAA,EACnB;;;ACPO,MAAI,sBAAsB;AAAA,IAC/B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,oBAAoB;AAAA,IAC7B,aAAa;AAAA,IACb,UAAU,CAAC,sBAAsB,wBAAwB,kBAAkB,sBAAsB,mCAAmC,oCAAoC,2BAA2B,sCAAsC;AAAA,IACzO,SAAS,CAAC,aAAa,UAAU,cAAc,cAAc,SAAS,WAAW;AAAA,EACnF;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,YAAY;AAAA,IACrB,aAAa;AAAA,IACb,UAAU,CAAC,UAAU;AAAA,IACrB,SAAS,CAAC,OAAO,KAAK;AAAA,EACxB;;;ACPO,MAAI,gBAAgB;AAAA,IACzB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,cAAc;AAAA,IACvB,aAAa;AAAA,IACb,UAAU,CAAC,gBAAgB,kBAAkB,yBAAyB;AAAA,IACtE,SAAS,CAAC,cAAc,aAAa,cAAc,QAAQ;AAAA,EAC7D;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,UAAU;AAAA,IACnB,aAAa;AAAA,IACb,UAAU,CAAC,YAAY,gBAAgB,cAAc,iBAAiB;AAAA,IACtE,SAAS,CAAC,cAAc,aAAa,cAAc,UAAU,YAAY,WAAW;AAAA,EACtF;;;ACPO,MAAI,gBAAgB;AAAA,IACzB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,cAAc;AAAA,IACvB,aAAa;AAAA,IACb,UAAU,CAAC,uBAAuB,wBAAwB,+BAA+B;AAAA,IACzF,SAAS,CAAC,YAAY,aAAa,SAAS,cAAc,YAAY;AAAA,EACxE;;;ACPO,MAAI,eAAe;AAAA,IACxB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,aAAa;AAAA,IACtB,aAAa;AAAA,IACb,UAAU,CAAC,sBAAsB,uBAAuB,8BAA8B;AAAA,IACtF,SAAS,CAAC,aAAa,aAAa,SAAS,cAAc,YAAY;AAAA,EACzE;;;ACPO,MAAI,iBAAiB;AAAA,IAC1B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,eAAe;AAAA,IACxB,aAAa;AAAA,IACb,UAAU,CAAC,iBAAiB,iBAAiB,kBAAkB,0BAA0B;AAAA,IACzF,SAAS,CAAC,aAAa,aAAa,cAAc,QAAQ;AAAA,EAC5D;;;ACPO,MAAI,gBAAgB;AAAA,IACzB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,cAAc;AAAA,IACvB,aAAa;AAAA,IACb,UAAU,CAAC,gBAAgB,kBAAkB,wBAAwB,gBAAgB,6BAA6B,8BAA8B,qBAAqB,gCAAgC;AAAA,IACrM,SAAS,CAAC,aAAa,UAAU,cAAc,cAAc,SAAS,mBAAmB,YAAY,WAAW;AAAA,EAClH;;;ACPO,MAAI,iBAAiB;AAAA,IAC1B,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,eAAe;AAAA,IACxB,aAAa;AAAA,IACb,UAAU,CAAC,iBAAiB,iBAAiB,kBAAkB,0BAA0B;AAAA,IACzF,SAAS,CAAC,aAAa,aAAa,cAAc,QAAQ;AAAA,EAC5D;;;ACPO,MAAI,cAAc;AAAA,IACvB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,YAAY;AAAA,IACrB,aAAa;AAAA,IACb,UAAU,CAAC,cAAc,eAAe,uBAAuB;AAAA,IAC/D,SAAS,CAAC,aAAa,aAAa,cAAc,QAAQ;AAAA,EAC5D;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,WAAW;AAAA,IACpB,aAAa;AAAA,IACb,UAAU,CAAC,aAAa,aAAa,cAAc,uBAAuB;AAAA,IAC1E,SAAS,CAAC,aAAa,aAAa,cAAc,YAAY;AAAA,EAChE;;;ACPO,MAAI,cAAc;AAAA,IACvB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,YAAY;AAAA,IACrB,aAAa;AAAA,IACb,UAAU,CAAC,gBAAgB,0BAA0B,0BAA0B,6BAA6B,4BAA4B,0BAA0B,mCAAmC;AAAA,IACrM,SAAS,CAAC,UAAU,UAAU,YAAY,aAAa,UAAU,QAAQ;AAAA,EAC3E;;;ACPO,MAAI,UAAU;AAAA,IACnB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,YAAY;AAAA,IACrB,aAAa;AAAA,IACb,UAAU,CAAC,SAAS;AAAA,IACpB,SAAS,CAAC,OAAO,KAAK;AAAA,EACxB;;;ACPO,MAAI,YAAY;AAAA,IACrB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,2BAA2B,oCAAoC;AAAA,IACxE,aAAa;AAAA,IACb,UAAU,CAAC,6CAA6C,gDAAgD,uDAAuD,wCAAwC;AAAA,IACvM,SAAS,CAAC,QAAQ;AAAA,EACpB;;;ACPO,MAAI,aAAa;AAAA,IACtB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,WAAW;AAAA,IACpB,aAAa;AAAA,IACb,UAAU,CAAC,eAAe,kBAAkB,kBAAkB,uBAAuB;AAAA,IACrF,SAAS,CAAC,mBAAmB;AAAA,EAC/B;;;ACPO,MAAI,eAAe;AAAA,IACxB,MAAM;AAAA,IACN,UAAU;AAAA,IACV,QAAQ,CAAC,6BAA6B,oCAAoC;AAAA,IAC1E,aAAa;AAAA,IACb,UAAU,CAAC,cAAc,kBAAkB,yBAAyB,8BAA8B,uDAAuD;AAAA,IACzJ,SAAS,CAAC,cAAc,cAAc;AAAA,EACxC;;;ACsPO,MAAI,eAAe;AAAA;AAAA,IAExB,WAAW;AAAA,IACX,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,SAAS;AAAA,IACT,YAAY;AAAA,IACZ,UAAU;AAAA,IACV,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,WAAW;AAAA,IACX,QAAQ;AAAA,IACR,MAAM;AAAA;AAAA,IAEN,GAAG;AAAA,IACH,GAAG;AAAA,IACH,OAAO;AAAA,IACP,GAAG;AAAA,IACH,UAAU;AAAA,IACV,KAAK;AAAA,IACL,MAAM;AAAA,IACN,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,KAAK;AAAA,IACL,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,KAAK;AAAA,IACL,SAAS;AAAA,IACT,OAAO;AAAA,IACP,KAAK;AAAA,IACL,MAAM;AAAA,IACN,SAAS;AAAA;AAAA;AAAA,IAGT,cAAc;AAAA,MACZ,aAAa;AAAA,MACb,UAAU,CAAC,cAAc;AAAA,IAC3B;AAAA,IACA,qBAAqB;AAAA,MACnB,aAAa;AAAA,MACb,UAAU,CAAC,qBAAqB;AAAA,IAClC;AAAA,IACA,gBAAgB;AAAA,MACd,aAAa;AAAA,MACb,UAAU,CAAC,gBAAgB;AAAA,IAC7B;AAAA,IACA,uBAAuB;AAAA,MACrB,aAAa;AAAA,MACb,UAAU,CAAC,uBAAuB;AAAA,IACpC;AAAA,IACA,kBAAkB;AAAA,MAChB,aAAa;AAAA,MACb,UAAU,CAAC,kBAAkB;AAAA,IAC/B;AAAA,IACA,kBAAkB;AAAA,MAChB,aAAa;AAAA,MACb,UAAU,CAAC,kBAAkB;AAAA,IAC/B;AAAA,IACA,iBAAiB;AAAA,MACf,aAAa;AAAA,MACb,UAAU,CAAC,iBAAiB;AAAA,IAC9B;AAAA,IACA,SAAS;AAAA,MACP,aAAa;AAAA,MACb,UAAU,CAAC,iBAAiB;AAAA,IAC9B;AAAA,IACA,iBAAiB;AAAA,MACf,aAAa;AAAA,MACb,UAAU,CAAC,iBAAiB;AAAA,IAC9B;AAAA,IACA,kBAAkB;AAAA,MAChB,aAAa;AAAA,MACb,UAAU,CAAC,kBAAkB;AAAA,IAC/B;AAAA,IACA,cAAc;AAAA,MACZ,aAAa;AAAA,MACb,UAAU,CAAC,cAAc;AAAA,IAC3B;AAAA,IACA,oBAAoB;AAAA,MAClB,aAAa;AAAA,MACb,UAAU,CAAC,oBAAoB;AAAA,IACjC;AAAA,IACA,2BAA2B;AAAA,MACzB,aAAa;AAAA,MACb,UAAU,CAAC,2BAA2B;AAAA,IACxC;AAAA;AAAA,IAEA,qBAAqB;AAAA,MACnB,aAAa;AAAA,MACb,UAAU,CAAC,qBAAqB;AAAA,IAClC;AAAA,IACA,iBAAiB;AAAA,MACf,aAAa;AAAA,MACb,UAAU,CAAC,iBAAiB;AAAA,IAC9B;AAAA,IACA,UAAU;AAAA,MACR,aAAa;AAAA,MACb,UAAU,CAAC,UAAU;AAAA,IACvB;AAAA,IACA,YAAY;AAAA,MACV,aAAa;AAAA,MACb,UAAU,CAAC,YAAY;AAAA,IACzB;AAAA,IACA,yBAAyB;AAAA,MACvB,aAAa;AAAA,MACb,UAAU,CAAC,yBAAyB;AAAA,IACtC;AAAA,IACA,cAAc;AAAA,MACZ,aAAa;AAAA,MACb,UAAU,CAAC,cAAc;AAAA,IAC3B;AAAA,IACA,eAAe;AAAA,MACb,aAAa;AAAA,MACb,UAAU,CAAC,eAAe;AAAA,IAC5B;AAAA,IACA,eAAe;AAAA,MACb,aAAa;AAAA,MACb,UAAU,CAAC,eAAe;AAAA,IAC5B;AAAA,IACA,eAAe;AAAA,MACb,aAAa;AAAA,MACb,UAAU,CAAC,eAAe;AAAA,IAC5B;AAAA,IACA,YAAY;AAAA,MACV,aAAa;AAAA,MACb,UAAU,CAAC,YAAY;AAAA,IACzB;AAAA,IACA,cAAc;AAAA,MACZ,aAAa;AAAA,MACb,UAAU,CAAC,cAAc;AAAA,IAC3B;AAAA,IACA,aAAa;AAAA,MACX,aAAa;AAAA,MACb,UAAU,CAAC,aAAa;AAAA,IAC1B;AAAA,IACA,sBAAsB;AAAA,MACpB,aAAa;AAAA,MACb,UAAU,CAAC,sBAAsB;AAAA,IACnC;AAAA,IACA,SAAS;AAAA,MACP,aAAa;AAAA,MACb,UAAU,CAAC,SAAS;AAAA,IACtB;AAAA,IACA,qBAAqB;AAAA,MACnB,aAAa;AAAA,MACb,UAAU,CAAC,qBAAqB;AAAA,IAClC;AAAA,IACA,iBAAiB;AAAA,MACf,aAAa;AAAA,MACb,UAAU,CAAC,iBAAiB;AAAA,IAC9B;AAAA,IACA,cAAc;AAAA,MACZ,aAAa;AAAA,MACb,UAAU,CAAC,cAAc;AAAA,IAC3B;AAAA,IACA,YAAY;AAAA,MACV,aAAa;AAAA,MACb,UAAU,CAAC,YAAY;AAAA,IACzB;AAAA,IACA,UAAU;AAAA,MACR,aAAa;AAAA,MACb,UAAU,CAAC,UAAU;AAAA,IACvB;AAAA,IACA,WAAW;AAAA,MACT,aAAa;AAAA,MACb,UAAU,CAAC,WAAW;AAAA,IACxB;AAAA,IACA,SAAS;AAAA,MACP,aAAa;AAAA,MACb,UAAU,CAAC,SAAS;AAAA,IACtB;AAAA,IACA,gBAAgB;AAAA,MACd,aAAa;AAAA,MACb,UAAU,CAAC,gBAAgB;AAAA,IAC7B;AAAA,IACA,WAAW;AAAA,MACT,aAAa;AAAA,MACb,UAAU,CAAC,WAAW;AAAA,IACxB;AAAA,IACA,aAAa;AAAA,MACX,aAAa;AAAA,MACb,UAAU,CAAC,aAAa;AAAA,IAC1B;AAAA,IACA,qBAAqB;AAAA,MACnB,aAAa;AAAA,MACb,UAAU,CAAC,qBAAqB;AAAA,IAClC;AAAA,IACA,aAAa;AAAA,MACX,aAAa;AAAA,MACb,UAAU,CAAC,aAAa;AAAA,IAC1B;AAAA,IACA,eAAe;AAAA,MACb,aAAa;AAAA,MACb,UAAU,CAAC,eAAe;AAAA,IAC5B;AAAA,IACA,iBAAiB;AAAA,MACf,aAAa;AAAA,MACb,UAAU,CAAC,iBAAiB;AAAA,IAC9B;AAAA,IACA,iBAAiB;AAAA,MACf,aAAa;AAAA,MACb,UAAU,CAAC,iBAAiB;AAAA,IAC9B;AAAA,IACA,kBAAkB;AAAA,MAChB,aAAa;AAAA,MACb,UAAU,CAAC,kBAAkB;AAAA,IAC/B;AAAA;AAAA,IAGA,WAAW;AAAA,MACT,aAAa;AAAA,MACb,UAAU,CAAC,WAAW;AAAA,IACxB;AAAA,IACA,cAAc;AAAA,MACZ,aAAa;AAAA,MACb,UAAU,CAAC,cAAc;AAAA,IAC3B;AAAA,IACA,SAAS;AAAA,MACP,aAAa;AAAA,MACb,UAAU,CAAC,SAAS;AAAA,IACtB;AAAA,IACA,cAAc;AAAA,MACZ,aAAa;AAAA,MACb,UAAU,CAAC,cAAc;AAAA,IAC3B;AAAA,IACA,YAAY;AAAA,MACV,aAAa;AAAA,MACb,UAAU,CAAC,YAAY;AAAA,IACzB;AAAA,IACA,YAAY;AAAA,MACV,aAAa;AAAA,MACb,UAAU,CAAC,YAAY;AAAA,IACzB;AAAA,IACA,cAAc;AAAA,MACZ,aAAa;AAAA,MACb,UAAU,CAAC,cAAc;AAAA,IAC3B;AAAA,IACA,mBAAmB;AAAA,MACjB,aAAa;AAAA,MACb,UAAU,CAAC,mBAAmB;AAAA,IAChC;AAAA;AAAA,IAEA,YAAY;AAAA,IACZ,QAAQ;AAAA,IACR,WAAW;AAAA,IACX,KAAK;AAAA,IACL,SAAS;AAAA,IACT,WAAW;AAAA,IACX,gBAAgB;AAAA,IAChB,SAAS;AAAA,IACT,UAAU;AAAA,IACV,kBAAkB;AAAA,IAClB,cAAc;AAAA,IACd,eAAe;AAAA,IACf,aAAa;AAAA,IACb,KAAK;AAAA,IACL,QAAQ;AAAA,IACR,WAAW;AAAA,IACX,IAAI;AAAA;AAAA,IAEJ,KAAK;AAAA,IACL,KAAK;AAAA,IACL,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,QAAQ;AAAA,IACR,WAAW;AAAA,IACX,aAAa;AAAA,IACb,QAAQ;AAAA,IACR,KAAK;AAAA,IACL,MAAM;AAAA,IACN,OAAO;AAAA,IACP,KAAK;AAAA,IACL,OAAO;AAAA,IACP,KAAK;AAAA,IACL,OAAO;AAAA,IACP,KAAK;AAAA,IACL,KAAK;AAAA,IACL,MAAM;AAAA,IACN,OAAO;AAAA,IACP,OAAO;AAAA,IACP,KAAK;AAAA,IACL,UAAU;AAAA,IACV,MAAM;AAAA,IACN,SAAS;AAAA,IACT,UAAU;AAAA,IACV,KAAK;AAAA,IACL,OAAO;AAAA,IACP,MAAM;AAAA,IACN,MAAM;AAAA,IACN,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,UAAU;AAAA,IACV,YAAY;AAAA,IACZ,WAAW;AAAA,IACX,MAAM;AAAA,IACN,QAAQ;AAAA;AAAA,IAER,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,WAAW;AAAA,IACX,iBAAiB;AAAA,IACjB,eAAe;AAAA;AAAA,IAEf,aAAa;AAAA,IACb,SAAS;AAAA,IACT,aAAa;AAAA,IACb,YAAY;AAAA;AAAA,IAEZ,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,OAAO;AAAA;AAAA,IAEP,KAAK;AAAA,IACL,MAAM;AAAA,IACN,IAAI;AAAA,IACJ,IAAI;AAAA;AAAA,IAEJ,UAAU;AAAA,IACV,MAAM;AAAA,IACN,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,SAAS;AAAA;AAAA,IAET,UAAU;AAAA,IACV,WAAW;AAAA;AAAA,IAEX,KAAK;AAAA,IACL,KAAK;AAAA,IACL,SAAS;AAAA,IACT,IAAI;AAAA,IACJ,KAAK;AAAA;AAAA,IAEL,WAAW;AAAA,IACX,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,YAAY;AAAA,IACZ,KAAK;AAAA,IACL,MAAM;AAAA,IACN,MAAM;AAAA,IACN,KAAK;AAAA,IACL,mBAAmB;AAAA,IACnB,UAAU;AAAA,IACV,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,SAAS;AAAA,IACT,KAAK;AAAA,IACL,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,oBAAoB;AAAA,IACpB,gBAAgB;AAAA,IAChB,mBAAmB;AAAA,IACnB,KAAK;AAAA,IACL,MAAM;AAAA,IACN,iBAAiB;AAAA,IACjB,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,QAAQ;AAAA,IACR,gBAAgB;AAAA,IAChB,KAAK;AAAA,IACL,MAAM;AAAA,IACN,MAAM;AAAA,IACN,SAAS;AAAA,IACT,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,WAAW;AAAA,IACX,OAAO;AAAA,IACP,KAAK;AAAA,IACL,MAAM;AAAA,IACN,WAAW;AAAA,IACX,OAAO;AAAA,IACP,MAAM;AAAA;AAAA,IAEN,UAAU;AAAA;AAAA,IAEV,WAAW;AAAA,IACX,cAAc;AAAA,IACd,qBAAqB;AAAA;AAAA,IAErB,WAAW;AAAA,IACX,OAAO;AAAA,IACP,cAAc;AAAA,IACd,QAAQ;AAAA,IACR,aAAa;AAAA,IACb,cAAc;AAAA,IACd,YAAY;AAAA,IACZ,QAAQ;AAAA,IACR,WAAW;AAAA;AAAA,IAEX,SAAS;AAAA,IACT,gBAAgB;AAAA,IAChB,aAAa;AAAA,IACb,WAAW;AAAA,IACX,OAAO;AAAA,IACP,WAAW;AAAA,IACX,QAAQ;AAAA,IACR,UAAU;AAAA,IACV,SAAS;AAAA,IACT,WAAW;AAAA,IACX,SAAS;AAAA;AAAA,IAET,cAAc;AAAA,IACd,eAAe;AAAA,IACf,aAAa;AAAA,IACb,cAAc;AAAA,IACd,aAAa;AAAA,IACb,iBAAiB;AAAA,IACjB,aAAa;AAAA,IACb,SAAS;AAAA,IACT,kBAAkB;AAAA,IAClB,UAAU;AAAA;AAAA,IAEV,QAAQ;AAAA,IACR,OAAO;AAAA;AAAA,IAEP,KAAK;AAAA,IACL,MAAM;AAAA;AAAA,IAEN,QAAQ;AAAA,IACR,KAAK;AAAA,IACL,KAAK;AAAA,IACL,MAAM;AAAA,IACN,QAAQ;AAAA,IACR,KAAK;AAAA,IACL,MAAM;AAAA,IACN,MAAM;AAAA,IACN,aAAa;AAAA,IACb,KAAK;AAAA,IACL,KAAK;AAAA,IACL,UAAU;AAAA,IACV,MAAM;AAAA;AAAA,IAEN,MAAM;AAAA,IACN,OAAO;AAAA,IACP,MAAM;AAAA,IACN,OAAO;AAAA,IACP,MAAM;AAAA,IACN,OAAO;AAAA,IACP,MAAM;AAAA,IACN,OAAO;AAAA,IACP,MAAM;AAAA,IACN,OAAO;AAAA,IACP,MAAM;AAAA,IACN,OAAO;AAAA,IACP,OAAO;AAAA,IACP,KAAK;AAAA,IACL,MAAM;AAAA,IACN,KAAK;AAAA,IACL,MAAM;AAAA,IACN,KAAK;AAAA,IACL,MAAM;AAAA,IACN,KAAK;AAAA,IACL,MAAM;AAAA,IACN,KAAK;AAAA,IACL,MAAM;AAAA,IACN,KAAK;AAAA,IACL,MAAM;AAAA;AAAA,IAEN,IAAI;AAAA,IACJ,QAAQ;AAAA;AAAA,IAER,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,OAAO;AAAA,IACP,WAAW;AAAA,IACX,UAAU;AAAA,IACV,WAAW;AAAA,IACX,YAAY;AAAA,IACZ,WAAW;AAAA,IACX,iBAAiB;AAAA,IACjB,YAAY;AAAA,IACZ,SAAS;AAAA,IACT,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,SAAS;AAAA,EACX;;;ACjuBA,MAAIK,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,qBAAqB,MAAM;AACjD,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,mBAAAC;AAAA,MACA,MAAAC;AAAA,IACF,IAAI;AAmBJ,WAAOF,OAAMF,SAAM;AAAA,MACjB,KAAK,SAAS,IAAI,QAAQ;AACxB,YAAI;AACJ,YAAI,aAAa;AACjB,YAAI,OAAO,WAAW,UAAU;AAC9B,eAAK,QAAQG,oBAAmB;AAE9B,gBAAI,eAAeA,oBAAmB,IAAI,KAAK,WAAWA,mBAAkB,IAAI,GAAG;AACjF,2BAAa;AACb;AAAA,YACF;AAAA,UACF;AAAA,QAeF;AACA,YAAI,MAAM,gBAAgB,cAAc,UAAU;AAClD,YAAI,CAAC,KAAK;AACR,cAAI,aAAa,OAAO,eAAe,aAAa,WAAW,OAAO;AACtE,gBAAM,IAAI,MAAM,gCAAgC,aAAa,GAAG;AAAA,QAClE;AACA,eAAO,IAAIC,MAAK,GAAG;AAAA,MACrB;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AChED,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO;AAC7B,MAAI,cAA6B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,OAAAC;AAAA,IACF,IAAI;AAoCJ,WAAOD,OAAMF,SAAM;AAAA,MACjB,IAAI,SAAS,IAAI;AACf,eAAO,IAAIG,OAAM;AAAA,MACnB;AAAA,MACA,KAAK,SAAS,IAAI,OAAO;AACvB,eAAO,IAAIA,OAAM,KAAK;AAAA,MACxB;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC/CD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,kBAAkB,YAAY,gBAAgB,UAAU,YAAY;AACpG,MAAI,YAA2B,wBAAQD,SAAMC,iBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,UAAAC;AAAA,MACA,cAAAC;AAAA,MACA,QAAAC;AAAA,MACA,YAAAC;AAAA,IACF,IAAI;AA0BJ,WAAON,OAAMF,SAAM;AAAA,MACjB,KAAK,SAAS,IAAI,GAAG;AACnB,eAAOS,OAAM,CAAC;AAAA,MAChB;AAAA,MACA,kBAAkB,SAASC,KAAI,GAAG;AAChC,YAAIC;AACJ,YAAI,SAAS,CAAC,GAAG;AACf,UAAAA,QAAO,EAAE,KAAK;AAAA,QAChB,WAAW,MAAM,QAAQ,CAAC,GAAG;AAC3B,cAAIR,QAAO,CAAC;AACZ,UAAAQ,QAAO,EAAE,KAAK;AAAA,QAChB,OAAO;AAEL,UAAAA,QAAO,CAAC;AAAA,QACV;AACA,gBAAQA,MAAK,QAAQ;AAAA,UACnB,KAAK;AAEH,mBAAOF,OAAM,CAAC;AAAA,UAChB,KAAK;AAEH,gBAAIE,MAAK,CAAC,MAAM,GAAG;AACjB,qBAAOF,OAAM,EAAE,QAAQ,EAAE,CAAC,CAAC;AAAA,YAC7B;AACA,gBAAIE,MAAK,CAAC,MAAM,GAAG;AACjB,qBAAO;AAAA,YACT,OAAO;AACL,oBAAM,IAAI,WAAW,kCAAuCC,QAAOD,KAAI,IAAI,GAAG;AAAA,YAChF;AAAA,UACF,KAAK,GACH;AAEE,gBAAI,OAAOA,MAAK,CAAC;AACjB,gBAAI,OAAOA,MAAK,CAAC;AACjB,gBAAI,SAAS,MAAM;AACjB,qBAAO,KAAK,EAAE,MAAM,EAAE,QAAQ,GAAG,MAAM,IAAI;AAAA,YAC7C;AACA,gBAAI,SAAS,GAAG;AACd,qBAAO;AAAA,YACT,OAAO;AACL,oBAAM,IAAI,WAAW,kCAAuCC,QAAOD,KAAI,IAAI,GAAG;AAAA,YAChF;AAAA,UACF;AAAA,UACF;AAEE,kBAAM,IAAI,WAAW,2CAAgDC,QAAOD,KAAI,IAAI,GAAG;AAAA,QAC3F;AAAA,MACF;AAAA,IACF,CAAC;AAUD,aAAS,KAAKR,SAAQ,MAAM,MAAM;AAChC,UAAI,SAAS,GAAG;AAEd,eAAOM,OAAMN,QAAO,CAAC,EAAE,CAAC,CAAC;AAAA,MAC3B,WAAW,SAAS,GAAG;AAGrB,eAAOC,gBAAeC,UAASF,QAAO,CAAC,EAAE,CAAC,GAAGA,QAAO,CAAC,EAAE,CAAC,CAAC,GAAGE,UAASF,QAAO,CAAC,EAAE,CAAC,GAAGA,QAAO,CAAC,EAAE,CAAC,CAAC,CAAC;AAAA,MAClG,OAAO;AAIL,YAAI,UAAU;AACd,YAAI,aAAa,IAAI,MAAM,IAAI,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,GAAGU,OAAMA,EAAC;AACxD,iBAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC7B,cAAI,KAAK,WAAW,CAAC;AACrB,cAAIN,QAAOJ,QAAO,EAAE,EAAE,CAAC,CAAC,GAAG;AACzB,gBAAI,KAAK;AACT,iBAAK,KAAK,IAAI,GAAG,KAAK,MAAM,MAAM;AAChC,kBAAI,CAACI,QAAOJ,QAAO,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG;AACtC,qBAAK,WAAW,EAAE;AAClB,2BAAW,EAAE,IAAI,WAAW,CAAC;AAC7B,2BAAW,CAAC,IAAI;AAChB,0BAAU,CAAC;AACX;AAAA,cACF;AAAA,YACF;AACA,gBAAI,OAAO,KAAM,QAAOA,QAAO,EAAE,EAAE,CAAC;AAAA,UACtC;AACA,cAAI,MAAMA,QAAO,EAAE,EAAE,CAAC;AACtB,cAAI,OAAO,MAAM,IAAI,IAAIA,QAAO,WAAW,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC;AACxD,mBAASU,KAAI,IAAI,GAAGA,KAAI,MAAMA,MAAK;AACjC,gBAAI,KAAK,WAAWA,EAAC;AACrB,qBAAS,IAAI,IAAI,GAAG,IAAI,MAAM,KAAK;AACjC,cAAAV,QAAO,EAAE,EAAE,CAAC,IAAIG,cAAaF,gBAAeC,UAASF,QAAO,EAAE,EAAE,CAAC,GAAG,GAAG,GAAGE,UAASF,QAAO,EAAE,EAAE,CAAC,GAAGA,QAAO,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI;AAAA,YACzH;AAAA,UACF;AAAA,QACF;AACA,YAAIO,OAAMP,QAAO,WAAW,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC;AAC/C,eAAO,UAAUK,YAAWE,IAAG,IAAIA;AAAA,MACrC;AAAA,IACF;AAAA,EACF,CAAC;;;ACzID,MAAII,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,gBAAgB,aAAa,YAAY,cAAc,OAAO,YAAY,KAAK;AAC/G,MAAI,YAA2B,wBAAQD,SAAMC,iBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,cAAAC;AAAA,MACA,WAAAC;AAAA,MACA,UAAAC;AAAA,MACA,YAAAC;AAAA,MACA,KAAAC;AAAA,MACA,UAAAC;AAAA,MACA,KAAAC;AAAA,IACF,IAAI;AAqBJ,WAAOR,OAAMF,SAAM;AAAA,MACjB,kBAAkB,SAAS,cAAc,GAAG;AAC1C,YAAIW,QAAO,SAAS,CAAC,IAAI,EAAE,KAAK,IAAI,UAAU,CAAC;AAC/C,gBAAQA,MAAK,QAAQ;AAAA,UACnB,KAAK;AAEH,gBAAIA,MAAK,CAAC,MAAM,GAAG;AACjB,kBAAI,SAAS,CAAC,GAAG;AACf,uBAAOR,QAAO,CAACC,cAAa,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC;AAAA,cACjD,OAAO;AACL,uBAAO,CAACA,cAAa,GAAG,EAAE,CAAC,CAAC,CAAC;AAAA,cAC/B;AAAA,YACF,OAAO;AACL,oBAAM,IAAI,WAAW,kCAAuCQ,QAAOD,KAAI,IAAI,GAAG;AAAA,YAChF;AAAA,UACF,KAAK,GAEH;AACE,gBAAI,OAAOA,MAAK,CAAC;AACjB,gBAAI,OAAOA,MAAK,CAAC;AACjB,gBAAI,SAAS,MAAM;AACjB,kBAAI,SAAS,CAAC,GAAG;AACf,uBAAOR,QAAO,KAAK,EAAE,QAAQ,GAAG,MAAM,IAAI,GAAG,EAAE,QAAQ,CAAC;AAAA,cAC1D,OAAO;AAEL,uBAAO,KAAK,GAAG,MAAM,IAAI;AAAA,cAC3B;AAAA,YACF,OAAO;AACL,oBAAM,IAAI,WAAW,kCAAuCS,QAAOD,KAAI,IAAI,GAAG;AAAA,YAChF;AAAA,UACF;AAAA,UACF;AAEE,kBAAM,IAAI,WAAW,2CAAgDC,QAAOD,KAAI,IAAI,GAAG;AAAA,QAC3F;AAAA,MACF;AAAA,MACA,KAAK,SAAS,IAAI,GAAG;AAEnB,eAAOP,cAAa,GAAG,CAAC;AAAA,MAC1B;AAAA,IACF,CAAC;AAUD,aAAS,KAAK,KAAK,MAAM,MAAM;AAC7B,UAAI,GAAG,GAAG,GAAG,OAAO;AACpB,UAAI,SAAS,GAAG;AAEd,gBAAQ,IAAI,CAAC,EAAE,CAAC;AAChB,YAAI,UAAU,GAAG;AACf,gBAAM,MAAM,+CAA+C;AAAA,QAC7D;AACA,eAAO,CAAC,CAACA,cAAa,GAAG,KAAK,CAAC,CAAC;AAAA,MAClC,WAAW,SAAS,GAAG;AAErB,YAAI,IAAII,KAAI,GAAG;AACf,YAAI,MAAM,GAAG;AACX,gBAAM,MAAM,+CAA+C;AAAA,QAC7D;AACA,eAAO,CAAC,CAACJ,cAAa,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAGA,cAAaG,YAAW,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAACH,cAAaG,YAAW,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAGH,cAAa,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;AAAA,MACpJ,OAAO;AAQL,YAAI,IAAI,IAAI,OAAO;AACnB,aAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AACzB,YAAE,CAAC,IAAI,EAAE,CAAC,EAAE,OAAO;AAAA,QACrB;AAIA,YAAI,IAAIK,UAAS,IAAI,EAAE,QAAQ;AAG/B,iBAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAE7B,cAAI,OAAOC,KAAI,EAAE,CAAC,EAAE,CAAC,CAAC;AACtB,cAAI,OAAO;AACX,cAAI,IAAI;AACR,iBAAO,IAAI,MAAM;AACf,gBAAIA,KAAI,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM;AACvB,qBAAOA,KAAI,EAAE,CAAC,EAAE,CAAC,CAAC;AAClB,qBAAO;AAAA,YACT;AACA;AAAA,UACF;AACA,cAAI,SAAS,GAAG;AACd,kBAAM,MAAM,+CAA+C;AAAA,UAC7D;AACA,cAAI;AACJ,cAAI,MAAM,GAAG;AACX,mBAAO,EAAE,CAAC;AACV,cAAE,CAAC,IAAI,EAAE,CAAC;AACV,cAAE,CAAC,IAAI;AACP,mBAAO,EAAE,CAAC;AACV,cAAE,CAAC,IAAI,EAAE,CAAC;AACV,cAAE,CAAC,IAAI;AAAA,UACT;AAGA,cAAI,KAAK,EAAE,CAAC;AACZ,cAAI,KAAK,EAAE,CAAC;AACZ,eAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AACzB,gBAAI,KAAK,EAAE,CAAC;AACZ,gBAAI,KAAK,EAAE,CAAC;AACZ,gBAAI,MAAM,GAAG;AAEX,kBAAI,GAAG,CAAC,MAAM,GAAG;AACf,oBAAIN,cAAaG,YAAW,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;AAIzC,qBAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AACzB,qBAAG,CAAC,IAAIF,WAAU,GAAG,CAAC,GAAGC,UAAS,GAAG,GAAG,CAAC,CAAC,CAAC;AAAA,gBAC7C;AACA,qBAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AACzB,qBAAG,CAAC,IAAID,WAAU,GAAG,CAAC,GAAGC,UAAS,GAAG,GAAG,CAAC,CAAC,CAAC;AAAA,gBAC7C;AAAA,cACF;AAAA,YACF,OAAO;AAGL,kBAAI,GAAG,CAAC;AACR,mBAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AACzB,mBAAG,CAAC,IAAIF,cAAa,GAAG,CAAC,GAAG,CAAC;AAAA,cAC/B;AACA,mBAAK,IAAI,GAAG,IAAI,MAAM,KAAK;AACzB,mBAAG,CAAC,IAAIA,cAAa,GAAG,CAAC,GAAG,CAAC;AAAA,cAC/B;AAAA,YACF;AAAA,UACF;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF,CAAC;;;AClLD,MAAIS,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,OAAO,aAAa,SAAS,aAAa,OAAO,cAAc,gBAAgB,YAAY,OAAO,SAAS;AAC3I,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,KAAAC;AAAA,MACA,WAAAC;AAAA,MACA,OAAAC;AAAA,MACA,WAAAC;AAAA,MACA,KAAAC;AAAA,MACA,YAAAC;AAAA,MACA,cAAAC;AAAA,MACA,UAAAC;AAAA,MACA,KAAAC;AAAA,MACA,SAAAC;AAAA,IACF,IAAI;AAqBJ,WAAOX,OAAMF,SAAM;AAAA,MACjB,kBAAkB,SAAS,cAAc,GAAG;AAC1C,YAAIc,QAAO,SAAS,CAAC,IAAI,EAAE,KAAK,IAAI,UAAU,CAAC;AAC/C,gBAAQA,MAAK,QAAQ;AAAA,UACnB,KAAK;AAEH,gBAAI,SAAS,CAAC,EAAG,QAAOL,YAAW,CAAC;AACpC,gBAAIK,MAAK,CAAC,MAAM,GAAG;AACjB,qBAAOV,KAAI,CAAC;AAAA,YACd,OAAO;AACL,qBAAOG,WAAUE,YAAW,CAAC,GAAGD,KAAI,GAAG,CAAC,CAAC;AAAA,YAC3C;AAAA,UACF,KAAK,GAEH;AACE,gBAAI,SAAS,CAAC,EAAG,QAAOC,YAAW,CAAC;AACpC,gBAAI,OAAOK,MAAK,CAAC;AACjB,gBAAI,OAAOA,MAAK,CAAC;AACjB,gBAAI,SAAS,MAAM;AACjB,kBAAI;AACF,uBAAOV,KAAI,CAAC;AAAA,cACd,SAAS,KAAK;AACZ,oBAAI,eAAe,SAAS,IAAI,QAAQ,MAAM,+CAA+C,GAAG;AAAA,gBAEhG,OAAO;AACL,wBAAM;AAAA,gBACR;AAAA,cACF;AAAA,YACF;AACA,gBAAI,SAAS,CAAC,GAAG;AACf,qBAAOD,QAAO,MAAM,EAAE,QAAQ,GAAG,MAAM,IAAI,GAAG,EAAE,QAAQ,CAAC;AAAA,YAC3D,OAAO;AAEL,qBAAO,MAAM,GAAG,MAAM,IAAI;AAAA,YAC5B;AAAA,UACF;AAAA,UACF;AAEE,kBAAM,IAAI,WAAW,2CAAgDY,QAAOD,KAAI,IAAI,GAAG;AAAA,QAC3F;AAAA,MACF;AAAA,MACA,KAAK,SAAS,IAAI,GAAG;AAEnB,YAAIR,OAAM,GAAG,CAAC,EAAG,QAAOU,OAAM,CAAC;AAC/B,eAAON,cAAa,GAAG,CAAC;AAAA,MAC1B;AAAA,IACF,CAAC;AAUD,aAAS,MAAM,KAAK,MAAM,MAAM;AAC9B,UAAI;AAAA,QACF;AAAA,QACA;AAAA,MACF,IAAI,UAAU,KAAK,MAAM,IAAI;AAC7B,UAAI,QAAQC,UAASP,KAAIO,UAASF,YAAW,CAAC,GAAG,CAAC,CAAC,GAAGA,YAAW,CAAC,CAAC;AACnE,UAAI,QAAQE,UAASF,YAAW,CAAC,GAAGL,KAAIO,UAAS,GAAGF,YAAW,CAAC,CAAC,CAAC,CAAC;AACnE,aAAOE,UAAS,OAAO,KAAK;AAAA,IAC9B;AAaA,aAAS,MAAM,KAAK,MAAM,MAAM;AAC9B,UAAI,IAAIK,OAAM,GAAG;AACjB,UAAI,OAAO;AACX,eAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC7B,YAAI,QAAQ,MAAM;AAChB,iBAAO;AAAA,QACT;AACA,YAAIC,KAAI;AACR,eAAO,QAAQ,EAAEA,EAAC,EAAE,IAAI,CAAC,GAAG;AAC1B,UAAAA;AACA,cAAI,SAASA,IAAG;AACd,YAAAA,KAAI;AACJ;AACA,gBAAI,SAAS,MAAM;AACjB,qBAAO;AAAA,YACT;AAAA,UACF;AAAA,QACF;AACA,SAAC,EAAEA,EAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,EAAEA,EAAC,CAAC;AAC1B,YAAI,MAAM,EAAE,CAAC,EAAE,IAAI;AACnB,iBAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC7B,YAAE,CAAC,EAAE,CAAC,IAAIV,WAAU,EAAE,CAAC,EAAE,CAAC,GAAG,GAAG;AAAA,QAClC;AACA,iBAAS,KAAK,GAAG,KAAK,MAAM,MAAM;AAChC,cAAI,OAAO,EAAG;AACd,gBAAM,EAAE,EAAE,EAAE,IAAI;AAChB,mBAAS,KAAK,GAAG,KAAK,MAAM,MAAM;AAChC,cAAE,EAAE,EAAE,EAAE,IAAIK,KAAI,EAAE,EAAE,EAAE,EAAE,GAAGD,UAAS,IAAIA,UAAS,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;AAAA,UAClE;AAAA,QACF;AACA;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAWA,aAAS,UAAU,KAAK,MAAM,MAAM;AAClC,UAAI,OAAO,MAAM,KAAK,MAAM,IAAI;AAChC,UAAI,IAAI,IAAI,IAAI,CAAC,GAAGM,OAAM,EAAE,OAAO,CAACC,IAAG,MAAM,IAAI,QAAQ,CAAC,QAAQV,KAAI,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACzF,UAAI,IAAI,KAAK,OAAO,CAAC,GAAGS,OAAM,CAAC,QAAQT,KAAI,KAAKS,EAAC,GAAG,KAAKA,EAAC,CAAC,CAAC,CAAC;AAC7D,aAAO;AAAA,QACL;AAAA,QACA;AAAA,MACF;AAAA,IACF;AACA,aAAS,QAAQ,GAAG;AAClB,aAAOX,OAAMM,KAAI,GAAGC,SAAQ,GAAG,CAAC,CAAC,GAAGD,KAAI,GAAGC,SAAQ,GAAG,CAAC,CAAC,CAAC;AAAA,IAC3D;AACA,aAAS,SAAS,KAAK;AACrB,aAAOR,WAAUO,KAAI,KAAKC,SAAQ,GAAG,CAAC,CAAC,GAAGD,KAAID,UAAS,KAAK,CAAC,GAAGE,SAAQ,GAAG,CAAC,CAAC,CAAC;AAAA,IAChF;AAAA,EACF,CAAC;;;ACjLM,WAAS,kBAAkB,MAAM;AACtC,QAAI;AAAA,MACF,WAAAM;AAAA,MACA,UAAAC;AAAA,MACA,SAAAC;AAAA,MACA,UAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,cAAAC;AAAA,MACA,MAAAC;AAAA,MACA,KAAAC;AAAA,MACA,WAAAC;AAAA,MACA,MAAAC;AAAA,MACA,MAAAC;AAAA,MACA,SAAAC;AAAA,MACA,KAAAC;AAAA,MACA,IAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,OAAAC;AAAA,MACA,SAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,MACA,mBAAAC;AAAA,MACA,KAAAC;AAAA,IACF,IAAI;AAUJ,aAAS,YAAY,KAAK,GAAG,MAAM,MAAM;AACvC,UAAI,cAAc,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAMtF,UAAI,IAAI,QAAQ,KAAK,GAAG,MAAM,MAAM,WAAW;AAc/C,yBAAmB,KAAK,GAAG,MAAM,MAAM,aAAa,CAAC;AAIrD,UAAI;AAAA,QACF;AAAA,QACA;AAAA,MACF,IAAI,uBAAuB,KAAK,GAAG,MAAM,MAAM,WAAW;AAQ1D,UAAI,aAAa;AACf,YAAI,eAAe,iBAAiB,KAAK,GAAG,GAAG,GAAG,QAAQ,MAAM,IAAI;AACpE,eAAO;AAAA,UACL;AAAA,UACA;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,QACL;AAAA,MACF;AAAA,IACF;AASA,aAAS,QAAQ,KAAK,GAAG,MAAM,MAAM,aAAa;AAChD,UAAI,MAAM,SAAS;AACnB,UAAI,OAAO,SAAS;AACpB,UAAI,WAAW,MAAMb,WAAU,CAAC,IAAI;AACpC,UAAI,MAAM,MAAMA,WAAU,CAAC,IAAI,OAAOS,SAAQ,CAAC,IAAI;AACnD,UAAI,UAAU,MAAMT,WAAU,CAAC,IAAI;AAGnC,UAAI,QAAQ,MAAMA,WAAU,EAAE,IAAI;AAClC,UAAI,UAAUJ,gBAAe,OAAO,KAAK;AAGzC,UAAI;AACJ,UAAI,aAAa;AACf,gBAAQ,MAAM,CAAC,EAAE,KAAK,GAAG;AAAA,MAC3B;AAGA,UAAI,OAAO;AACX,aAAO,CAAC,MAAM;AAEZ,eAAO;AACP,iBAASkB,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAG1B,cAAI,UAAU;AACd,cAAI,UAAU;AACd,mBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,gBAAIA,OAAM,EAAG;AACb,sBAAUtB,WAAU,SAASO,KAAI,IAAI,CAAC,EAAEe,EAAC,CAAC,CAAC;AAC3C,sBAAUtB,WAAU,SAASO,KAAI,IAAIe,EAAC,EAAE,CAAC,CAAC,CAAC;AAAA,UAC7C;AACA,cAAI,CAACN,OAAM,SAAS,CAAC,KAAK,CAACA,OAAM,SAAS,CAAC,GAAG;AAK5C,gBAAI,IAAI;AACR,gBAAI,IAAI;AACR,gBAAI,cAAcX,cAAa,SAAS,KAAK;AAC7C,gBAAI,cAAcD,gBAAe,SAAS,KAAK;AAC/C,mBAAOe,SAAQ,GAAG,WAAW,GAAG;AAC9B,kBAAIf,gBAAe,GAAG,OAAO;AAC7B,kBAAIA,gBAAe,GAAG,KAAK;AAAA,YAC7B;AACA,mBAAOc,QAAO,GAAG,WAAW,GAAG;AAC7B,kBAAIb,cAAa,GAAG,OAAO;AAC3B,kBAAIA,cAAa,GAAG,KAAK;AAAA,YAC3B;AAIA,gBAAI,YAAYc,SAAQd,cAAaL,WAAU,GAAG,OAAO,GAAG,CAAC,GAAGI,gBAAeJ,WAAU,SAAS,OAAO,GAAG,IAAI,CAAC;AAGjH,gBAAI,WAAW;AAGb,qBAAO;AACP,kBAAI,IAAIK,cAAa,GAAG,CAAC;AACzB,uBAAS,KAAK,GAAG,KAAK,GAAG,MAAM;AAC7B,oBAAIiB,OAAM,IAAI;AACZ;AAAA,gBACF;AACA,oBAAIA,EAAC,EAAE,EAAE,IAAIlB,gBAAe,IAAIkB,EAAC,EAAE,EAAE,GAAG,CAAC;AACzC,oBAAI,EAAE,EAAEA,EAAC,IAAIlB,gBAAe,IAAI,EAAE,EAAEkB,EAAC,GAAG,CAAC;AAAA,cAC3C;AAGA,kBAAI,aAAa;AACf,sBAAMA,EAAC,IAAIlB,gBAAe,MAAMkB,EAAC,GAAG,CAAC;AAAA,cACvC;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAGA,aAAO,cAAcb,MAAK,KAAK,IAAI;AAAA,IACrC;AAUA,aAAS,mBAAmB,KAAK,GAAG,MAAM,MAAM,aAAa,GAAG;AAC9D,UAAI,MAAM,SAAS;AACnB,UAAI,OAAO,SAAS;AACpB,UAAI,OAAO,MAAMD,WAAU,CAAC,IAAI,OAAOS,SAAQ,CAAC,IAAI;AACpD,UAAI,KAAK;AACP,eAAOT,WAAU,IAAI;AAAA,MACvB;AACA,eAASc,KAAI,GAAGA,KAAI,IAAI,GAAGA,MAAK;AAG9B,YAAI,WAAW;AACf,YAAIC,OAAM;AACV,iBAAS,IAAID,KAAI,GAAG,IAAI,GAAG,KAAK;AAC9B,cAAI,KAAK,IAAI,CAAC,EAAEA,EAAC;AACjB,cAAIH,SAAQZ,KAAIgB,IAAG,GAAGhB,KAAI,EAAE,CAAC,GAAG;AAC9B,YAAAgB,OAAM;AACN,uBAAW;AAAA,UACb;AAAA,QACF;AAGA,YAAIJ,SAAQZ,KAAIgB,IAAG,GAAG,IAAI,GAAG;AAC3B;AAAA,QACF;AACA,YAAI,aAAaD,KAAI,GAAG;AAEtB,cAAI,OAAO,IAAI,QAAQ;AACvB,cAAI,QAAQ,IAAI,IAAIA,KAAI,CAAC;AACzB,cAAIA,KAAI,CAAC,IAAI;AAGb,mBAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,gBAAI,OAAO,IAAI,GAAG,EAAE,QAAQ;AAC5B,gBAAI,GAAG,EAAE,QAAQ,IAAI,IAAI,GAAG,EAAEA,KAAI,CAAC;AACnC,gBAAI,GAAG,EAAEA,KAAI,CAAC,IAAI;AAAA,UACpB;AAGA,cAAI,aAAa;AACf,gBAAI,OAAO,EAAE,QAAQ;AACrB,cAAE,QAAQ,IAAI,EAAEA,KAAI,CAAC;AACrB,cAAEA,KAAI,CAAC,IAAI;AAAA,UACb;AAAA,QACF;AAGA,iBAAS,MAAMA,KAAI,GAAG,MAAM,GAAG,OAAO;AACpC,cAAI,IAAIjB,cAAa,IAAI,GAAG,EAAEiB,EAAC,GAAGC,IAAG;AACrC,cAAI,MAAM,GAAG;AACX;AAAA,UACF;AAGA,mBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,gBAAI,GAAG,EAAE,CAAC,IAAItB,UAAS,IAAI,GAAG,EAAE,CAAC,GAAGG,gBAAe,GAAG,IAAIkB,KAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AAAA,UACtE;AAGA,mBAAS,KAAK,GAAG,KAAK,GAAG,MAAM;AAC7B,gBAAI,EAAE,EAAEA,KAAI,CAAC,IAAItB,WAAU,IAAI,EAAE,EAAEsB,KAAI,CAAC,GAAGlB,gBAAe,GAAG,IAAI,EAAE,EAAE,GAAG,CAAC,CAAC;AAAA,UAC5E;AAGA,cAAI,aAAa;AACf,qBAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,gBAAE,GAAG,EAAE,GAAG,IAAIH,UAAS,EAAE,GAAG,EAAE,GAAG,GAAGG,gBAAe,GAAG,EAAEkB,KAAI,CAAC,EAAE,GAAG,CAAC,CAAC;AAAA,YACtE;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAOA,aAAS,uBAAuB,GAAG,GAAG,MAAM,MAAM,aAAa;AAC7D,UAAI,MAAM,SAAS;AACnB,UAAI,OAAO,SAAS;AACpB,UAAI,MAAM,MAAMd,WAAU,CAAC,IAAI,OAAOS,SAAQ,CAAC,IAAI;AACnD,UAAI,KAAK;AACP,eAAOT,WAAU,IAAI;AAAA,MACvB;AAWA,UAAI,MAAMgB,OAAM,CAAC;AAGjB,UAAI,UAAU,CAAC;AAGf,UAAI,IAAI;AAIR,UAAI,QAAQ,CAAC;AAGb,UAAI,SAAS,cAAcf,MAAK,MAAM,CAAC,EAAE,KAAK,GAAG,CAAC,IAAI;AAGtD,UAAI,WAAW,cAAcA,MAAK,MAAM,CAAC,EAAE,KAAK,GAAG,CAAC,IAAI;AAGxD,UAAI,wBAAwB;AAC5B,aAAO,yBAAyB,KAAK;AACnC,iCAAyB;AAMzB,YAAI,IAAI,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC;AAOxB,iBAASa,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,cAAIA,EAAC,EAAEA,EAAC,IAAIrB,UAAS,IAAIqB,EAAC,EAAEA,EAAC,GAAG,CAAC;AAAA,QACnC;AAGA,YAAI;AAAA,UACF,GAAAG;AAAA,UACA;AAAA,QACF,IAAIZ,IAAG,GAAG;AACV,cAAMV,UAAS,GAAGsB,EAAC;AACnB,iBAAS,KAAK,GAAG,KAAK,GAAG,MAAM;AAC7B,cAAI,EAAE,EAAE,EAAE,IAAIzB,WAAU,IAAI,EAAE,EAAE,EAAE,GAAG,CAAC;AAAA,QACxC;AAGA,YAAI,aAAa;AACf,qBAAWG,UAAS,UAAUsB,EAAC;AAAA,QACjC;AAGA,YAAI,MAAM,KAAKN,SAAQZ,KAAI,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG;AACpD,kCAAwB;AACxB,kBAAQ,KAAK,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;AAG9B,cAAI,aAAa;AACf,kBAAM,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;AACnB,0BAAc,UAAU,CAAC;AACzB,qBAASJ,UAAS,QAAQ,QAAQ;AAClC,gBAAI,IAAI,GAAG;AACT,yBAAWM,MAAK,MAAM,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC;AAAA,YACxC;AAAA,UACF;AAGA,eAAK;AACL,cAAI,IAAI;AACR,mBAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,gBAAI,GAAG,EAAE,IAAI;AAAA,UACf;AAAA,QAGF,WAAW,MAAM,KAAKU,SAAQZ,KAAI,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG;AAC3D,kCAAwB;AACxB,cAAI,KAAK,eAAe,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;AAClG,kBAAQ,KAAK,GAAG,EAAE;AAGlB,cAAI,aAAa;AACf,kBAAM,QAAQ,cAAc,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,MAAM,IAAI,CAAC;AACjI,0BAAc,UAAU,CAAC;AACzB,qBAASJ,UAAS,QAAQ,QAAQ;AAClC,gBAAI,IAAI,GAAG;AACT,yBAAWM,MAAK,MAAM,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC;AAAA,YACxC;AAAA,UACF;AAGA,eAAK;AACL,cAAI,IAAI;AACR,cAAI,IAAI;AACR,mBAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,gBAAI,GAAG,EAAE,IAAI;AACb,gBAAI,GAAG,EAAE,IAAI;AAAA,UACf;AAAA,QACF;AACA,YAAI,MAAM,GAAG;AACX;AAAA,QACF;AAAA,MACF;AAGA,cAAQ,KAAK,CAAC,GAAG,MAAM,CAACR,UAASM,KAAI,CAAC,GAAGA,KAAI,CAAC,CAAC,CAAC;AAGhD,UAAI,wBAAwB,KAAK;AAC/B,YAAI,MAAM,MAAM,uEAAuE,QAAQ,KAAK,IAAI,CAAC;AACzG,YAAI,SAAS;AACb,YAAI,UAAU,CAAC;AACf,cAAM;AAAA,MACR;AAIA,UAAI,IAAI,cAAcJ,UAAS,QAAQ,UAAU,OAAO,CAAC,CAAC,IAAI;AAC9D,aAAO;AAAA,QACL,QAAQ;AAAA,QACR;AAAA,MACF;AAAA,IACF;AAWA,aAAS,iBAAiB,GAAG,GAAG,GAAG,GAAG,QAAQ,MAAM,MAAM;AACxD,UAAI,OAAOS,KAAI,CAAC;AAChB,UAAI,IAAIT,UAAS,MAAM,GAAG,CAAC;AAC3B,UAAI,MAAM,SAAS;AACnB,UAAI,OAAO,SAAS;AACpB,UAAI,OAAO,MAAMK,WAAU,CAAC,IAAI,OAAOS,SAAQ,CAAC,IAAI;AACpD,UAAI,MAAM,MAAMT,WAAU,CAAC,IAAI,OAAOS,SAAQ,CAAC,IAAI;AAInD,UAAI,eAAe,CAAC;AACpB,UAAI,iBAAiB,CAAC;AACtB,eAAS,UAAU,QAAQ;AACzB,YAAIK,KAAII,SAAQ,cAAc,QAAQV,MAAK;AAC3C,YAAIM,OAAM,IAAI;AACZ,uBAAa,KAAK,MAAM;AACxB,yBAAe,KAAK,CAAC;AAAA,QACvB,OAAO;AACL,yBAAeA,EAAC,KAAK;AAAA,QACvB;AAAA,MACF;AAMA,UAAI,UAAU,CAAC;AACf,UAAI,MAAM,aAAa;AACvB,UAAI,IAAI,MAAM,CAAC,EAAE,KAAK,IAAI;AAC1B,UAAI,IAAIb,MAAK,MAAM,CAAC,EAAE,KAAK,GAAG,CAAC;AAC/B,UAAI,QAAQ,SAASkB,SAAQ;AAC3B,YAAIC,UAAS,aAAa,GAAG;AAC7B,YAAI,IAAI3B,UAAS,GAAGE,UAASyB,SAAQ,CAAC,CAAC;AAEvC,YAAI,YAAYb,WAAU,GAAG,CAAC;AAC9B,kBAAU,MAAM;AAKhB,eAAO,UAAU,SAAS,eAAe,GAAG,GAAG;AAC7C,cAAI,YAAY,eAAe,GAAG,GAAG,WAAW,MAAM,IAAI;AAC1D,cAAI,cAAc,MAAM;AACtB;AAAA,UACF;AACA,oBAAU,KAAK,SAAS;AAAA,QAC1B;AAGA,YAAI,aAAaZ,UAASS,KAAI,CAAC,GAAG,CAAC;AACnC,oBAAY,UAAU,IAAI,OAAKT,UAAS,YAAY,CAAC,CAAC;AACtD,gBAAQ,KAAK,GAAG,UAAU,IAAI,QAAM;AAAA,UAClC,OAAOyB;AAAA,UACP,QAAQ1B,SAAQ,CAAC;AAAA,QACnB,EAAE,CAAC;AAAA,MACL;AACA,eAAS,MAAM,GAAG,MAAM,KAAK,OAAO;AAClC,cAAM;AAAA,MACR;AACA,aAAO;AAAA,IACT;AAMA,aAAS,eAAe,GAAG,GAAG,GAAG,GAAG;AAElC,UAAI,MAAMF,WAAU,GAAG,CAAC;AACxB,UAAI,OAAOC,UAASG,gBAAe,GAAG,CAAC,GAAGA,gBAAe,GAAG,CAAC,CAAC;AAC9D,UAAI,IAAIA,gBAAe,KAAK,GAAG;AAC/B,UAAI,IAAIA,gBAAeE,MAAKL,UAASG,gBAAe,KAAK,GAAG,GAAGA,gBAAe,GAAG,IAAI,CAAC,CAAC,GAAG,GAAG;AAC7F,aAAO,CAACJ,WAAU,GAAG,CAAC,GAAGC,UAAS,GAAG,CAAC,CAAC;AAAA,IACzC;AASA,aAAS,cAAc,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,MAAM,MAAM;AACrD,UAAI,MAAM,SAAS;AACnB,UAAI,OAAO,SAAS;AACpB,UAAI,OAAO,MAAMO,WAAU,CAAC,IAAI,OAAOS,SAAQ,CAAC,IAAI;AACpD,UAAI,MAAM,MAAMT,WAAU,CAAC,IAAI,OAAOS,SAAQ,CAAC,IAAI;AAInD,UAAIE,SAAQZ,KAAI,CAAC,GAAG,IAAI,GAAG;AACzB,eAAO,CAAC,CAAC,KAAK,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC;AAAA,MAClC;AAIA,UAAIW,QAAOX,KAAIN,UAAS,IAAI,EAAE,CAAC,GAAG,IAAI,GAAG;AACvC,eAAO,CAAC,CAACA,UAAS,IAAI,CAAC,GAAGA,UAAS,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAAA,MACpD;AAIA,UAAI,KAAKA,UAAS,GAAG,EAAE;AACvB,UAAI,KAAKA,UAAS,GAAG,EAAE;AAKvB,UAAIkB,SAAQZ,KAAI,CAAC,GAAG,IAAI,KAAKY,SAAQZ,KAAI,EAAE,GAAG,IAAI,GAAG;AACnD,eAAO,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC;AAAA,MAC9B,OAAO;AACL,eAAO,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC;AAAA,MAC9B;AAAA,IACF;AAMA,aAAS,cAAc,KAAK,GAAG;AAE7B,eAASe,KAAI,GAAGA,KAAI,IAAI,QAAQA,MAAK;AACnC,YAAIA,EAAC,EAAE,KAAK,GAAG,MAAM,IAAI,IAAIA,EAAC,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;AAAA,MACjD;AAGA,eAAS,MAAM,IAAI,QAAQ,MAAM,GAAG,OAAO;AACzC,YAAI,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC;AACzB,YAAI,GAAG,EAAE,GAAG,IAAI;AAAA,MAClB;AACA,aAAO;AAAA,IACT;AAOA,aAAS,UAAU,KAAK,GAAG;AACzB,UAAI,IAAI,CAAC;AACT,eAASA,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,UAAEA,EAAC,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC;AAAA,MACxB;AACA,UAAI,IAAI;AACR,eAASO,QAAO,KAAK;AACnB,YAAI,IAAIA,KAAI;AACZ,iBAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,mBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,cAAE,IAAI,GAAG,EAAE,IAAI,CAAC,IAAIA,KAAI,GAAG,EAAE,CAAC;AAAA,UAChC;AAAA,QACF;AACA,aAAK;AAAA,MACP;AACA,aAAO;AAAA,IACT;AAUA,aAASH,SAAQ,KAAK,IAAI,IAAI;AAC5B,eAASJ,KAAI,GAAGA,KAAI,IAAI,QAAQA,MAAK;AACnC,YAAI,GAAG,IAAIA,EAAC,GAAG,EAAE,GAAG;AAClB,iBAAOA;AAAA,QACT;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAgBA,aAAS,eAAe,GAAG,GAAG,QAAQ,MAAM,MAAM;AAChD,UAAI,WAAW,SAAS,cAAcd,WAAU,GAAI,IAAI;AACxD,UAAI;AAGJ,UAAIc,KAAI;AACR,aAAOA,KAAI,GAAG,EAAEA,IAAG;AACjB,YAAI,uBAAuB,GAAG,QAAQ,IAAI;AAC1C,YAAI;AACF,cAAIR,QAAO,GAAG,CAAC;AAAA,QACjB,SAAS,SAAS;AAGhB;AAAA,QACF;AACA,YAAII,QAAOY,MAAK,CAAC,GAAG,QAAQ,GAAG;AAC7B;AAAA,QACF;AAAA,MACF;AACA,UAAIR,MAAK,GAAG;AACV,eAAO;AAAA,MACT;AAGA,MAAAA,KAAI;AACJ,aAAO,MAAM;AACX,YAAI,IAAIR,QAAO,GAAG,CAAC;AACnB,YAAIK,SAAQW,MAAK,qBAAqB,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG;AACrD;AAAA,QACF;AACA,YAAI,EAAER,MAAK,IAAI;AACb,iBAAO;AAAA,QACT;AACA,YAAI,UAAU,CAAC;AAAA,MACjB;AACA,aAAO;AAAA,IACT;AAUA,aAAS,uBAAuB,GAAG,QAAQ,MAAM;AAC/C,UAAI,MAAM,SAAS;AACnB,UAAI,OAAO,SAAS;AAGpB,UAAI,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC,EAAE,IAAI,OAAK,IAAI,KAAK,OAAO,IAAI,CAAC;AACvD,UAAI,KAAK;AACP,YAAI,EAAE,IAAI,OAAKd,WAAU,CAAC,CAAC;AAAA,MAC7B;AACA,UAAI,MAAM;AACR,YAAI,EAAE,IAAI,OAAKS,SAAQ,CAAC,CAAC;AAAA,MAC3B;AAGA,UAAI,qBAAqB,GAAG,MAAM;AAGlC,aAAO,UAAU,GAAG,IAAI;AAAA,IAC1B;AAKA,aAAS,qBAAqB,GAAG,QAAQ;AACvC,UAAI,cAAcP,MAAK,CAAC;AACxB,eAAS,KAAK,QAAQ;AACpB,YAAIC,SAAQ,GAAG,WAAW;AAE1B,YAAIV,UAAS,GAAGE,UAASE,cAAagB,KAAI,GAAG,CAAC,GAAGA,KAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;AAAA,MACjE;AACA,aAAO;AAAA,IACT;AAOA,aAASS,MAAK,GAAG;AACf,aAAOvB,KAAID,MAAKe,KAAI,GAAG,CAAC,CAAC,CAAC;AAAA,IAC5B;AASA,aAAS,UAAU,GAAG,MAAM;AAC1B,UAAI,MAAM,SAAS;AACnB,UAAI,OAAO,SAAS;AACpB,UAAI,MAAM,MAAMb,WAAU,CAAC,IAAI,OAAOS,SAAQ,CAAC,IAAI;AACnD,aAAOd,UAASE,cAAa,KAAKyB,MAAK,CAAC,CAAC,GAAG,CAAC;AAAA,IAC/C;AACA,WAAO;AAAA,EACT;;;ACxrBO,WAAS,oBAAoB,MAAM;AACxC,QAAI;AAAA,MACF,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,UAAAC;AAAA,MACA,KAAAC;AAAA,MACA,MAAAC;AAAA,MACA,KAAAC;AAAA,MACA,KAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,KAAAC;AAAA,MACA,WAAAC;AAAA,MACA,UAAAC;AAAA,MACA,KAAAC;AAAA,IACF,IAAI;AAOJ,aAAS,KAAK,KAAK,GAAG;AACpB,UAAI,OAAO,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAIX,QAAO;AACtF,UAAI,OAAO,UAAU,SAAS,IAAI,UAAU,CAAC,IAAI;AACjD,UAAI,iBAAiB,UAAU,SAAS,IAAI,UAAU,CAAC,IAAI;AAC3D,UAAI,SAAS,UAAU;AACrB,eAAOY,MAAK,KAAK,MAAM,cAAc;AAAA,MACvC;AACA,UAAI,SAAS,aAAa;AACxB,eAAO,QAAQ,KAAK,MAAM,cAAc;AAAA,MAC1C;AACA,YAAM,UAAU,4BAA4B,IAAI;AAAA,IAClD;AAGA,aAASA,MAAK,GAAG,WAAW,gBAAgB;AAC1C,UAAI,IAAI,EAAE;AACV,UAAI,KAAK,KAAK,IAAI,YAAY,CAAC;AAC/B,UAAI;AACJ,UAAI;AACJ,UAAI,gBAAgB;AAClB,cAAM,IAAI,MAAM,CAAC;AAEjB,iBAASC,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,cAAIA,EAAC,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC;AACxB,cAAIA,EAAC,EAAEA,EAAC,IAAI;AAAA,QACd;AAAA,MACF;AAEA,UAAI,MAAM,OAAO,CAAC;AAClB,aAAO,KAAK,IAAI,IAAI,CAAC,CAAC,KAAK,KAAK,IAAI,EAAE,GAAG;AACvC,YAAI,KAAK,IAAI,CAAC,EAAE,CAAC;AACjB,YAAI,IAAI,IAAI,CAAC,EAAE,CAAC;AAChB,cAAM,SAAS,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;AAC3C,YAAI,GAAG,GAAG,KAAK,IAAI,CAAC;AACpB,YAAI,eAAgB,OAAM,KAAK,KAAK,KAAK,IAAI,CAAC;AAC9C,cAAM,OAAO,CAAC;AAAA,MAChB;AACA,UAAI,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC;AACxB,eAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,WAAG,GAAG,IAAI,EAAE,GAAG,EAAE,GAAG;AAAA,MACtB;AACA,aAAO,QAAQC,OAAM,EAAE,GAAG,KAAK,cAAc;AAAA,IAC/C;AAGA,aAAS,QAAQ,GAAG,WAAW,gBAAgB;AAC7C,UAAI,IAAI,EAAE;AACV,UAAI,KAAKX,KAAI,YAAY,CAAC;AAC1B,UAAI;AACJ,UAAI;AACJ,UAAI,gBAAgB;AAClB,cAAM,IAAI,MAAM,CAAC;AAEjB,iBAASU,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,cAAIA,EAAC,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC;AACxB,cAAIA,EAAC,EAAEA,EAAC,IAAI;AAAA,QACd;AAAA,MACF;AAEA,UAAI,MAAM,UAAU,CAAC;AACrB,aAAOV,KAAI,IAAI,CAAC,CAAC,KAAKA,KAAI,EAAE,GAAG;AAC7B,YAAI,MAAM,IAAI,CAAC,EAAE,CAAC;AAClB,YAAI,IAAI,IAAI,CAAC,EAAE,CAAC;AAChB,cAAM,YAAY,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;AACjD,YAAI,MAAM,GAAG,KAAK,KAAK,CAAC;AACxB,YAAI,eAAgB,OAAM,QAAQ,KAAK,KAAK,KAAK,CAAC;AAClD,cAAM,UAAU,CAAC;AAAA,MACnB;AACA,UAAI,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC;AACxB,eAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,WAAG,GAAG,IAAI,EAAE,GAAG,EAAE,GAAG;AAAA,MACtB;AAEA,aAAO,QAAQW,OAAM,EAAE,GAAG,KAAK,cAAc;AAAA,IAC/C;AAGA,aAAS,SAAS,KAAK,KAAK,KAAK;AAC/B,UAAI,QAAQ,MAAM;AAClB,UAAI,KAAK,IAAI,KAAK,KAAKd,QAAO,QAAQ;AACpC,eAAO,KAAK,KAAK;AAAA,MACnB,OAAO;AACL,eAAO,MAAM,KAAK,KAAK,IAAM,OAAO,MAAM,IAAI;AAAA,MAChD;AAAA,IACF;AAGA,aAAS,YAAY,KAAK,KAAK,KAAK;AAClC,UAAI,QAAQE,UAAS,KAAK,GAAG;AAC7B,UAAIC,KAAI,KAAK,KAAKH,QAAO,QAAQ;AAC/B,eAAOS,WAAU,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC;AAAA,MACnC,OAAO;AACL,eAAOF,gBAAe,KAAKH,MAAKM,UAAS,GAAK,KAAKF,KAAI,KAAK,CAAC,CAAC,CAAC;AAAA,MACjE;AAAA,IACF;AAGA,aAAS,KAAK,KAAK,OAAOK,IAAG,GAAG;AAC9B,UAAI,IAAI,IAAI;AACZ,UAAI,IAAI,KAAK,IAAI,KAAK;AACtB,UAAI,IAAI,KAAK,IAAI,KAAK;AACtB,UAAI,MAAM,MAAM,CAAC,EAAE,KAAK,CAAC;AACzB,UAAI,MAAM,MAAM,CAAC,EAAE,KAAK,CAAC;AACzB,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAEA,EAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;AACrC,YAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAEA,EAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;AAAA,MACvC;AACA,eAAS,KAAK,GAAG,KAAK,GAAG,MAAM;AAC7B,YAAI,EAAE,EAAEA,EAAC,IAAI,IAAI,EAAE;AACnB,YAAI,EAAE,EAAE,CAAC,IAAI,IAAI,EAAE;AAAA,MACrB;AACA,aAAO;AAAA,IACT;AAEA,aAAS,QAAQ,KAAK,OAAOA,IAAG,GAAG;AACjC,UAAI,IAAI,IAAI;AACZ,UAAI,IAAIR,KAAI,KAAK;AACjB,UAAI,IAAIC,KAAI,KAAK;AACjB,UAAI,MAAM,MAAM,CAAC,EAAE,KAAKG,WAAU,CAAC,CAAC;AACpC,UAAI,MAAM,MAAM,CAAC,EAAE,KAAKA,WAAU,CAAC,CAAC;AACpC,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAI,CAAC,IAAIP,UAASK,gBAAe,GAAG,IAAI,CAAC,EAAEM,EAAC,CAAC,GAAGN,gBAAe,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AAC5E,YAAI,CAAC,IAAIN,WAAUM,gBAAe,GAAG,IAAI,CAAC,EAAEM,EAAC,CAAC,GAAGN,gBAAe,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AAAA,MAC/E;AACA,eAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,YAAI,GAAG,EAAEM,EAAC,IAAI,IAAI,GAAG;AACrB,YAAI,GAAG,EAAE,CAAC,IAAI,IAAI,GAAG;AAAA,MACvB;AACA,aAAO;AAAA,IACT;AAGA,aAAS,MAAM,KAAK,OAAOA,IAAG,GAAG;AAC/B,UAAI,IAAI,IAAI;AACZ,UAAI,IAAIJ,WAAUJ,KAAI,KAAK,CAAC;AAC5B,UAAI,IAAII,WAAUH,KAAI,KAAK,CAAC;AAC5B,UAAI,KAAKC,gBAAe,GAAG,CAAC;AAC5B,UAAI,KAAKA,gBAAe,GAAG,CAAC;AAC5B,UAAI,MAAM,MAAM,CAAC,EAAE,KAAKE,WAAU,CAAC,CAAC;AACpC,UAAI,MAAM,MAAM,CAAC,EAAE,KAAKA,WAAU,CAAC,CAAC;AAEpC,UAAI,QAAQC,UAASD,WAAU,CAAC,GAAG,GAAG,GAAG,IAAII,EAAC,EAAE,CAAC,CAAC;AAElD,UAAI,MAAMZ,WAAUC,UAASK,gBAAe,IAAI,IAAIM,EAAC,EAAEA,EAAC,CAAC,GAAG,KAAK,GAAGN,gBAAe,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AACjG,UAAI,MAAMI,KAAIJ,gBAAe,IAAI,IAAIM,EAAC,EAAEA,EAAC,CAAC,GAAG,OAAON,gBAAe,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AAEjF,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAI,CAAC,IAAIL,UAASK,gBAAe,GAAG,IAAIM,EAAC,EAAE,CAAC,CAAC,GAAGN,gBAAe,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AAC5E,YAAI,CAAC,IAAIN,WAAUM,gBAAe,GAAG,IAAIM,EAAC,EAAE,CAAC,CAAC,GAAGN,gBAAe,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AAAA,MAC/E;AAEA,UAAIM,EAAC,EAAEA,EAAC,IAAI;AACZ,UAAI,CAAC,EAAE,CAAC,IAAI;AACZ,UAAIA,EAAC,EAAE,CAAC,IAAIJ,WAAU,CAAC;AACvB,UAAI,CAAC,EAAEI,EAAC,IAAIJ,WAAU,CAAC;AAEvB,eAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,YAAI,QAAQI,MAAK,QAAQ,GAAG;AAC1B,cAAIA,EAAC,EAAE,GAAG,IAAI,IAAI,GAAG;AACrB,cAAI,GAAG,EAAEA,EAAC,IAAI,IAAI,GAAG;AACrB,cAAI,CAAC,EAAE,GAAG,IAAI,IAAI,GAAG;AACrB,cAAI,GAAG,EAAE,CAAC,IAAI,IAAI,GAAG;AAAA,QACvB;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAGA,aAAS,GAAG,KAAK,OAAOA,IAAG,GAAG;AAC5B,UAAI,IAAI,IAAI;AACZ,UAAI,IAAI,KAAK,IAAI,KAAK;AACtB,UAAI,IAAI,KAAK,IAAI,KAAK;AACtB,UAAI,KAAK,IAAI;AACb,UAAI,KAAK,IAAI;AACb,UAAI,MAAM,MAAM,CAAC,EAAE,KAAK,CAAC;AACzB,UAAI,MAAM,MAAM,CAAC,EAAE,KAAK,CAAC;AAEzB,UAAI,MAAM,KAAK,IAAIA,EAAC,EAAEA,EAAC,IAAI,IAAI,IAAI,IAAI,IAAIA,EAAC,EAAE,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;AAChE,UAAI,MAAM,KAAK,IAAIA,EAAC,EAAEA,EAAC,IAAI,IAAI,IAAI,IAAI,IAAIA,EAAC,EAAE,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;AAEhE,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAI,CAAC,IAAI,IAAI,IAAIA,EAAC,EAAE,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;AACrC,YAAI,CAAC,IAAI,IAAI,IAAIA,EAAC,EAAE,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;AAAA,MACvC;AAEA,UAAIA,EAAC,EAAEA,EAAC,IAAI;AACZ,UAAI,CAAC,EAAE,CAAC,IAAI;AACZ,UAAIA,EAAC,EAAE,CAAC,IAAI;AACZ,UAAI,CAAC,EAAEA,EAAC,IAAI;AAEZ,eAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,YAAI,QAAQA,MAAK,QAAQ,GAAG;AAC1B,cAAIA,EAAC,EAAE,GAAG,IAAI,IAAI,GAAG;AACrB,cAAI,GAAG,EAAEA,EAAC,IAAI,IAAI,GAAG;AACrB,cAAI,CAAC,EAAE,GAAG,IAAI,IAAI,GAAG;AACrB,cAAI,GAAG,EAAE,CAAC,IAAI,IAAI,GAAG;AAAA,QACvB;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAGA,aAAS,OAAO,KAAK;AACnB,UAAI,IAAI,IAAI;AACZ,UAAI,SAAS;AACb,UAAI,QAAQ,CAAC,GAAG,CAAC;AACjB,eAASA,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,iBAAS,IAAIA,KAAI,GAAG,IAAI,GAAG,KAAK;AAC9B,cAAI,KAAK,IAAI,MAAM,IAAI,KAAK,IAAI,IAAIA,EAAC,EAAE,CAAC,CAAC,GAAG;AAC1C,qBAAS,KAAK,IAAI,IAAIA,EAAC,EAAE,CAAC,CAAC;AAC3B,oBAAQ,CAACA,IAAG,CAAC;AAAA,UACf;AAAA,QACF;AAAA,MACF;AACA,aAAO,CAAC,OAAO,MAAM;AAAA,IACvB;AAGA,aAAS,UAAU,KAAK;AACtB,UAAI,IAAI,IAAI;AACZ,UAAI,SAAS;AACb,UAAI,QAAQ,CAAC,GAAG,CAAC;AACjB,eAASA,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,iBAAS,IAAIA,KAAI,GAAG,IAAI,GAAG,KAAK;AAC9B,cAAIV,KAAI,MAAM,IAAIA,KAAI,IAAIU,EAAC,EAAE,CAAC,CAAC,GAAG;AAChC,qBAASV,KAAI,IAAIU,EAAC,EAAE,CAAC,CAAC;AACtB,oBAAQ,CAACA,IAAG,CAAC;AAAA,UACf;AAAA,QACF;AAAA,MACF;AACA,aAAO,CAAC,OAAO,MAAM;AAAA,IACvB;AAGA,aAAS,QAAQ,GAAG,GAAG,gBAAgB;AACrC,UAAI,IAAI,EAAE;AACV,UAAI,SAAS,MAAM,CAAC;AACpB,UAAI;AACJ,UAAI,gBAAgB;AAClB,eAAO,MAAM,CAAC;AACd,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,eAAK,CAAC,IAAI,MAAM,CAAC;AAAA,QACnB;AAAA,MACF;AACA,eAASA,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,YAAI,QAAQ;AACZ,YAAI,OAAO,EAAE,CAAC;AACd,iBAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,cAAIV,KAAI,EAAE,CAAC,CAAC,IAAIA,KAAI,IAAI,GAAG;AACzB,oBAAQ;AACR,mBAAO,EAAE,KAAK;AAAA,UAChB;AAAA,QACF;AACA,eAAOU,EAAC,IAAI,EAAE,OAAO,OAAO,CAAC,EAAE,CAAC;AAChC,YAAI,gBAAgB;AAClB,mBAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,iBAAKA,EAAC,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK;AAC3B,cAAE,GAAG,EAAE,OAAO,OAAO,CAAC;AAAA,UACxB;AAAA,QACF;AAAA,MACF;AACA,UAAI,CAAC,eAAgB,QAAO;AAAA,QAC1B;AAAA,MACF;AACA,UAAI,eAAe,KAAK,IAAI,CAAC,QAAQA,QAAO;AAAA,QAC1C,OAAO,OAAOA,EAAC;AAAA,QACf;AAAA,MACF,EAAE;AACF,aAAO;AAAA,QACL;AAAA,QACA;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;;;AClSA,MAAIE,UAAO;AAGX,MAAIC,kBAAe,CAAC,UAAU,SAAS,UAAU,aAAa,SAAS,YAAY,OAAO,QAAQ,OAAO,OAAO,kBAAkB,gBAAgB,OAAO,aAAa,YAAY,OAAO,UAAU,UAAU,WAAW,UAAU,WAAW,QAAQ,QAAQ,QAAQ,WAAW,MAAM,UAAU,aAAa,MAAM,MAAM,WAAW,qBAAqB,KAAK;AACvV,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,QAAAC;AAAA,MACA,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,UAAAC;AAAA,MACA,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,MAAAC;AAAA,MACA,KAAAC;AAAA,MACA,KAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,cAAAC;AAAA,MACA,KAAAC;AAAA,MACA,WAAAC;AAAA,MACA,UAAAC;AAAA,MACA,KAAAC;AAAA,MACA,QAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,MACA,MAAAC;AAAA,MACA,MAAAC;AAAA,MACA,MAAAC;AAAA,MACA,SAAAC;AAAA,MACA,IAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,IAAAC;AAAA,MACA,IAAAC;AAAA,MACA,SAAAC;AAAA,MACA,mBAAAC;AAAA,MACA,KAAAC;AAAA,IACF,IAAI;AACJ,QAAI,kBAAkB,oBAAoB;AAAA,MACxC,QAAAhC;AAAA,MACA,WAAAG;AAAA,MACA,UAAAC;AAAA,MACA,QAAAa;AAAA,MACA,SAAAC;AAAA,MACA,OAAAb;AAAA,MACA,KAAAC;AAAA,MACA,MAAAC;AAAA,MACA,KAAAC;AAAA,MACA,KAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,KAAAE;AAAA,MACA,WAAAC;AAAA,MACA,SAAAO;AAAA,MACA,UAAAN;AAAA,MACA,KAAAC;AAAA,IACF,CAAC;AACD,QAAI,gBAAgB,kBAAkB;AAAA,MACpC,QAAAf;AAAA,MACA,WAAAG;AAAA,MACA,UAAAC;AAAA,MACA,UAAAU;AAAA,MACA,gBAAAJ;AAAA,MACA,SAAAQ;AAAA,MACA,cAAAP;AAAA,MACA,MAAAU;AAAA,MACA,KAAAf;AAAA,MACA,WAAAO;AAAA,MACA,MAAAS;AAAA,MACA,MAAAC;AAAA,MACA,SAAAC;AAAA,MACA,IAAAC;AAAA,MACA,KAAAb;AAAA,MACA,QAAAc;AAAA,MACA,WAAAC;AAAA,MACA,OAAAtB;AAAA,MACA,SAAAe;AAAA,MACA,QAAAJ;AAAA,MACA,SAAAc;AAAA,MACA,mBAAAC;AAAA,MACA,KAAAC;AAAA,IACF,CAAC;AA8DD,WAAO/B,OAAM,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAOnB,OAAO,SAASgC,OAAM,GAAG;AACvB,eAAO,OAAO/B,QAAO,CAAC,CAAC;AAAA,MACzB;AAAA,MACA,2BAA2B,SAAS,sBAAsB,GAAG,MAAM;AACjE,eAAO,OAAOA,QAAO,CAAC,GAAG;AAAA,UACvB,WAAW;AAAA,QACb,CAAC;AAAA,MACH;AAAA,MACA,gBAAgB,GAAG,MAAM;AACvB,eAAO,OAAOA,QAAO,CAAC,GAAG,IAAI;AAAA,MAC/B;AAAA,MACA,QAAQ,SAASgC,QAAO,KAAK;AAC3B,eAAO,OAAO,KAAK;AAAA,UACjB,WAAW;AAAA,QACb,CAAC;AAAA,MACH;AAAA,MACA,4BAA4B,SAAS,uBAAuB,KAAK,MAAM;AACrE,eAAO,OAAO,KAAK;AAAA,UACjB,WAAW;AAAA,UACX,WAAW;AAAA,QACb,CAAC;AAAA,MACH;AAAA,MACA,kBAAkB,SAAS,cAAc,KAAK,MAAM;AAClD,YAAI,UAAU;AAAA,UACZ,WAAW;AAAA,QACb;AACA,QAAAC,UAAS,SAAS,IAAI;AACtB,eAAO,OAAO,KAAK,OAAO;AAAA,MAC5B;AAAA,IACF,CAAC;AACD,aAAS,OAAO,KAAK;AACnB,UAAI;AACJ,UAAI,OAAO,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAC;AAChF,UAAI,iBAAiB,kBAAkB,OAAO,KAAK,eAAe;AAClE,UAAI,QAAQ,kBAAkB,KAAK,eAAe,QAAQ,oBAAoB,SAAS,kBAAkBnC,QAAO;AAChH,UAAI,SAAS,wBAAwB,KAAK,MAAM,cAAc;AAC9D,UAAI,KAAK,WAAW;AAClB,eAAO,SAASE,QAAO,OAAO,MAAM;AACpC,YAAI,gBAAgB;AAClB,iBAAO,eAAe,OAAO,aAAa,IAAI,WAAS;AACrD,gBAAI;AAAA,cACF;AAAA,cACA;AAAA,YACF,IAAI;AACJ,mBAAO;AAAA,cACL;AAAA,cACA,QAAQA,QAAO,MAAM;AAAA,YACvB;AAAA,UACF,CAAC;AAAA,QACH;AAAA,MACF;AACA,UAAI,gBAAgB;AAClB,eAAO,eAAe,QAAQ,WAAW;AAAA,UACvC,YAAY;AAAA;AAAA;AAAA,UAGZ,KAAK,MAAM;AACT,kBAAM,IAAI,MAAM,oDAAoD;AAAA,UACtE;AAAA,QACF,CAAC;AAAA,MACH;AACA,aAAO;AAAA,IACT;AACA,aAAS,wBAAwB,KAAK,MAAM,gBAAgB;AAC1D,UAAI,MAAM,IAAI,QAAQ;AAEtB,UAAI,QAAQ,IAAI,KAAK;AACrB,UAAI,MAAM,WAAW,KAAK,MAAM,CAAC,MAAM,MAAM,CAAC,GAAG;AAC/C,cAAM,IAAI,WAAW,gCAAgC,OAAOkC,QAAO,KAAK,GAAG,GAAG,CAAC;AAAA,MACjF;AACA,UAAI,IAAI,MAAM,CAAC;AACf,UAAI,OAAO,KAAK,GAAG,IAAI,GAAG;AACxB,mBAAW,KAAK,CAAC;AAEjB,YAAI,YAAY,KAAK,GAAG,IAAI,GAAG;AAC7B,cAAI,QAAQ,YAAY,KAAK,KAAK,CAAC;AACnC,iBAAO,gBAAgB,KAAK,GAAG,MAAM,OAAO,cAAc;AAAA,QAC5D;AAAA,MACF;AACA,UAAI,OAAO,YAAY,KAAK,KAAK,CAAC;AAClC,aAAO,cAAc,KAAK,GAAG,MAAM,MAAM,cAAc;AAAA,IACzD;AAGA,aAAS,YAAY,KAAK,GAAG,MAAM;AACjC,eAASC,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,iBAAS,IAAIA,IAAG,IAAI,GAAG,KAAK;AAE1B,cAAIrB,QAAOH,WAAUP,KAAIF,UAAS,IAAIiC,EAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAEA,EAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG;AAChE,mBAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAGA,aAAS,OAAO,KAAK,GAAG,MAAM;AAC5B,eAASA,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAE1B,cAAIrB,QAAOH,WAAUP,KAAIsB,IAAG,IAAIS,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG;AAC/C,mBAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT;AACA,aAAS,WAAW,KAAK,GAAG;AAC1B,eAASA,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,cAAIA,EAAC,EAAE,CAAC,IAAIR,IAAG,IAAIQ,EAAC,EAAE,CAAC,CAAC;AAAA,QAC1B;AAAA,MACF;AAAA,IACF;AAGA,aAAS,YAAY,KAAK,KAAK,GAAG;AAEhC,UAAI,OAAO,IAAI,SAAS;AACxB,UAAI,SAAS,YAAY,SAAS,eAAe,SAAS,WAAW;AACnE,eAAO;AAAA,MACT;AACA,UAAI,YAAY;AAChB,UAAI,SAAS;AACb,UAAI,aAAa;AACjB,eAASA,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,cAAI,KAAK,IAAIA,EAAC,EAAE,CAAC;AACjB,cAAI,SAAS,EAAE,KAAK,WAAW,EAAE,GAAG;AAClC,wBAAY;AAAA,UACd,WAAW,YAAY,EAAE,GAAG;AAC1B,qBAAS;AAAA,UACX,WAAW,UAAU,EAAE,GAAG;AACxB,yBAAa;AAAA,UACf,OAAO;AACL,kBAAM,UAAU,iCAAiC,OAAO,EAAE,CAAC;AAAA,UAC7D;AAAA,QACF;AAAA,MACF;AACA,UAAI,UAAU,YAAY;AACxB,gBAAQ,KAAK,wEAAwE;AAAA,MACvF;AACA,UAAI,YAAY;AACd,iBAAS,KAAK,GAAG,KAAK,GAAG,MAAM;AAC7B,mBAAS,KAAK,GAAG,KAAK,GAAG,MAAM;AAC7B,gBAAI,EAAE,EAAE,EAAE,IAAIjB,SAAQ,IAAI,EAAE,EAAE,EAAE,CAAC;AAAA,UACnC;AAAA,QACF;AACA,eAAO;AAAA,MACT;AACA,UAAI,QAAQ;AACV,iBAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,mBAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,gBAAI,GAAG,EAAE,GAAG,IAAIP,WAAU,IAAI,GAAG,EAAE,GAAG,CAAC;AAAA,UACzC;AAAA,QACF;AACA,eAAO;AAAA,MACT;AACA,UAAI,WAAW;AACb,iBAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,mBAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,gBAAI,GAAG,EAAE,GAAG,IAAIM,QAAO,IAAI,GAAG,EAAE,GAAG,CAAC;AAAA,UACtC;AAAA,QACF;AACA,eAAO;AAAA,MACT,OAAO;AACL,cAAM,UAAU,yCAAyC;AAAA,MAC3D;AAAA,IACF;AAAA,EACF,CAAC;;;ACpUD,MAAImB,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO,OAAO,YAAY,OAAO,UAAU;AACjE,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,KAAAC;AAAA,MACA,UAAAC;AAAA,MACA,KAAAC;AAAA,MACA,UAAAC;AAAA,IACF,IAAI;AA0BJ,WAAOL,OAAMF,SAAM;AAAA,MACjB,QAAQ,SAASQ,QAAO,GAAG;AAEzB,YAAIC,QAAO,EAAE,KAAK;AAClB,YAAIA,MAAK,WAAW,KAAKA,MAAK,CAAC,MAAMA,MAAK,CAAC,GAAG;AAC5C,gBAAM,IAAI,WAAW,kCAAuCC,QAAOD,KAAI,IAAI,GAAG;AAAA,QAChF;AACA,YAAI,IAAIA,MAAK,CAAC;AAId,YAAI,MAAM;AAQV,YAAI,UAAU,aAAa,CAAC;AAI5B,YAAI,SAAS,WAAW,SAAS,GAAG;AACpC,YAAI,IAAI,OAAO;AACf,YAAI,IAAI,OAAO;AASf,YAAI,OAAOF,UAAS,GAAG,KAAK,IAAI,GAAG,CAAC,CAAC,CAAC;AAGtC,YAAI,IAAIF,UAAS,CAAC;AAClB,YAAI,IAAIA,UAAS,CAAC;AAGlB,YAAI,SAAS;AAGb,YAAI,UAAU;AACd,YAAI,YAAY;AAChB,iBAASM,KAAI,GAAGA,MAAK,GAAGA,MAAK;AAC3B,cAAIA,KAAI,GAAG;AACT,sBAAUJ,UAAS,SAAS,IAAI;AAChC,wBAAY,CAAC;AAAA,UACf;AACA,mBAAS,UAAU,IAAII,KAAI,OAAO,IAAI,IAAIA,KAAI,KAAKA;AACnD,cAAIP,KAAI,GAAGG,UAAS,QAAQ,OAAO,CAAC;AACpC,cAAIH,KAAI,GAAGG,UAAS,SAAS,WAAW,OAAO,CAAC;AAAA,QAClD;AACA,YAAI,IAAIA,UAASD,KAAI,CAAC,GAAG,CAAC;AAG1B,iBAAS,KAAK,GAAG,KAAK,GAAG,MAAM;AAC7B,cAAIC,UAAS,GAAG,CAAC;AAAA,QACnB;AACA,eAAO,eAAe,CAAC,IAAI,EAAE,mBAAmB,CAAC,IAAI;AAAA,MACvD;AAAA,IACF,CAAC;AACD,aAAS,aAAa,GAAG;AACvB,UAAI,IAAI,EAAE,KAAK,EAAE,CAAC;AAClB,UAAI,UAAU;AACd,eAASI,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,YAAI,SAAS;AACb,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,oBAAUR,KAAI,EAAE,IAAI,CAACQ,IAAG,CAAC,CAAC,CAAC;AAAA,QAC7B;AACA,kBAAU,KAAK,IAAI,QAAQ,OAAO;AAAA,MACpC;AACA,aAAO;AAAA,IACT;AAOA,aAAS,WAAW,SAAS,KAAK;AAChC,UAAI,gBAAgB;AACpB,eAAS,IAAI,GAAG,IAAI,eAAe,KAAK;AACtC,iBAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC3B,cAAI,IAAI,IAAI;AACZ,cAAI,cAAc,SAAS,GAAG,CAAC,IAAI,KAAK;AACtC,mBAAO;AAAA,cACL;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,YAAM,IAAI,MAAM,kHAAkH;AAAA,IACpI;AAMA,aAAS,cAAc,SAAS,GAAG,GAAG;AACpC,UAAI,OAAO;AACX,eAASA,KAAI,GAAGA,MAAK,GAAGA,MAAK;AAC3B,gBAAQA;AAAA,MACV;AACA,UAAI,UAAU;AACd,eAAS,MAAM,IAAI,GAAG,OAAO,IAAI,GAAG,OAAO;AACzC,mBAAW;AAAA,MACb;AACA,UAAI,YAAY,WAAW,IAAI,IAAI;AACnC,aAAO,IAAM,KAAK,IAAI,UAAU,KAAK,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,OAAO,QAAQ,UAAU;AAAA,IACpF;AAAA,EACF,CAAC;;;ACrJD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO,OAAO,YAAY,OAAO,QAAQ,YAAY,OAAO,QAAQ,OAAO,UAAU;AAC3G,MAAI,cAA6B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,KAAAC;AAAA,MACA,UAAAC;AAAA,MACA,KAAAC;AAAA,MACA,MAAAC;AAAA,MACA,UAAAC;AAAA,MACA,KAAAC;AAAA,MACA,MAAAC;AAAA,MACA,KAAAC;AAAA,MACA,UAAAC;AAAA,IACF,IAAI;AACJ,QAAI,iBAAiB;AACrB,QAAI,aAAa;AAWjB,aAAS,eAAe,GAAG;AACzB,UAAIC;AACJ,UAAI,aAAa;AACjB,UAAI,IAAI;AACR,UAAI,IAAID,UAASF,MAAK,CAAC,CAAC;AACxB,SAAG;AACD,YAAI,KAAK;AACT,YAAIL,UAAS,KAAKD,KAAI,IAAIK,KAAI,CAAC,CAAC,CAAC;AACjC,YAAIJ,UAAS,KAAKD,KAAI,GAAGK,KAAI,EAAE,CAAC,CAAC;AACjC,QAAAI,SAAQF,KAAIR,KAAIK,UAAS,GAAG,EAAE,CAAC,CAAC;AAChC,YAAIK,SAAQ,cAAc,EAAE,aAAa,gBAAgB;AACvD,gBAAM,IAAI,MAAM,sEAAsE;AAAA,QACxF;AAAA,MACF,SAASA,SAAQ;AACjB,aAAO;AAAA,IACT;AAuBA,WAAOX,OAAMF,SAAM;AAAA,MACjB,kBAAkB,SAAS,cAAc,GAAG;AAC1C,YAAIU,QAAO,SAAS,CAAC,IAAI,EAAE,KAAK,IAAI,UAAU,CAAC;AAC/C,gBAAQA,MAAK,QAAQ;AAAA,UACnB,KAAK;AAEH,gBAAIA,MAAK,CAAC,MAAM,GAAG;AACjB,qBAAOJ,KAAI,GAAGC,KAAI;AAAA,YACpB,OAAO;AACL,oBAAM,IAAI,WAAW,kCAAuCO,QAAOJ,KAAI,IAAI,GAAG;AAAA,YAChF;AAAA,UACF,KAAK,GACH;AAEE,gBAAI,OAAOA,MAAK,CAAC;AACjB,gBAAI,OAAOA,MAAK,CAAC;AACjB,gBAAI,SAAS,MAAM;AACjB,qBAAO,eAAe,CAAC;AAAA,YACzB,OAAO;AACL,oBAAM,IAAI,WAAW,kCAAuCI,QAAOJ,KAAI,IAAI,GAAG;AAAA,YAChF;AAAA,UACF;AAAA,UACF;AAEE,kBAAM,IAAI,WAAW,mDAAwDI,QAAOJ,KAAI,IAAI,GAAG;AAAA,QACnG;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACjGD,MAAIK,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,SAAS,qBAAqB,UAAU,YAAY,SAAS,UAAU,aAAa,SAAS,UAAU,OAAO,YAAY,YAAY,WAAW,KAAK;AAC5K,MAAI,kBAAiC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,OAAAC;AAAA,MACA,mBAAAC;AAAA,MACA,QAAAC;AAAA,MACA,UAAAC;AAAA,MACA,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,KAAAC;AAAA,MACA,UAAAC;AAAA,MACA,UAAAC;AAAA,MACA,SAAAC;AAAA,MACA,KAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AA8BJ,WAAOf,OAAMF,SAAM;AAAA,MACjB,0BAA0B;AAAA,MAC1B,yBAAyB,SAAS,oBAAoB,GAAG,GAAG,GAAG;AAC7D,eAAO,WAAWK,QAAO,CAAC,GAAG,GAAG,CAAC;AAAA,MACnC;AAAA,MACA,wBAAwB,SAAS,mBAAmB,GAAG,GAAG,GAAG;AAC3D,eAAO,WAAWA,QAAO,CAAC,GAAGA,QAAO,CAAC,GAAG,CAAC;AAAA,MAC3C;AAAA,MACA,wBAAwB,SAAS,mBAAmB,GAAG,GAAG,GAAG;AAC3D,eAAO,WAAWA,QAAO,CAAC,GAAG,GAAGA,QAAO,CAAC,CAAC;AAAA,MAC3C;AAAA,MACA,yBAAyB,SAAS,oBAAoB,GAAG,GAAG,GAAG;AAC7D,eAAO,WAAW,GAAGA,QAAO,CAAC,GAAG,CAAC;AAAA,MACnC;AAAA,MACA,wBAAwB,SAAS,mBAAmB,GAAG,GAAG,GAAG;AAC3D,eAAO,WAAW,GAAGA,QAAO,CAAC,GAAGA,QAAO,CAAC,CAAC;AAAA,MAC3C;AAAA,MACA,yBAAyB,SAAS,oBAAoB,GAAG,GAAG,GAAG;AAC7D,eAAO,WAAW,GAAG,GAAGA,QAAO,CAAC,CAAC;AAAA,MACnC;AAAA,MACA,uBAAuB,SAAS,kBAAkB,GAAG,GAAG,GAAG;AACzD,eAAO,WAAWA,QAAO,CAAC,GAAGA,QAAO,CAAC,GAAGA,QAAO,CAAC,CAAC,EAAE,QAAQ;AAAA,MAC7D;AAAA,IACF,CAAC;AACD,aAAS,WAAW,GAAG,GAAG,GAAG;AAC3B,UAAI,IAAI,EAAE,KAAK,EAAE,CAAC;AAClB,UAAI,IAAI,EAAE,KAAK,EAAE,CAAC;AAClB,UAAI,KAAKF,OAAM,CAAC;AAChB,UAAI,IAAI,GAAG;AACX,UAAI,IAAI,GAAG;AACX,UAAI,KAAKA,OAAMG,UAAS,IAAI,CAAC,CAAC;AAC9B,UAAI,IAAI,GAAG;AACX,UAAI,IAAI,GAAG;AACX,UAAI,IAAIA,UAASA,UAASG,WAAU,CAAC,GAAG,CAAC,GAAG,CAAC;AAC7C,UAAI,MAAMF,OAAM,GAAG,CAAC;AACpB,UAAI,IAAI,CAAC;AACT,UAAI,KAAK,CAAC,GAAG,MAAMC,QAAO,GAAG,GAAG,CAAC;AACjC,UAAI,KAAK,CAAC,GAAG,MAAMA,QAAO,GAAG,GAAG,CAAC;AACjC,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAI,IAAI,IAAI,KAAKQ,KAAIL,QAAO,GAAGD,OAAM,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,MAAM;AACvD,cAAI,MAAM,GAAGC,QAAO,GAAGD,OAAM,KAAK,CAAC,CAAC,CAAC,CAAC,GAAGC,QAAO,GAAGD,OAAM,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACvE,mBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,kBAAME,KAAI,KAAK,GAAGN,UAAS,EAAE,CAAC,GAAGK,QAAO,GAAGD,OAAM,GAAG,CAAC,CAAC,CAAC,GAAGJ,UAAS,EAAE,CAAC,GAAGK,QAAO,GAAGD,OAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAAA,UACvG;AACA,cAAI,MAAMJ,UAASQ,UAAS,CAAC,GAAGR,UAAS,IAAIK,QAAO,GAAGD,OAAM,GAAG,CAAC,CAAC,CAAC,CAAC;AACpE,cAAI,MAAMJ,UAASQ,UAAS,CAAC,GAAGR,UAAS,IAAIK,QAAO,GAAGD,OAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;AACxE,cAAI,MAAMJ,UAASQ,UAAS,CAAC,GAAGR,UAAS,IAAIK,QAAO,GAAGD,OAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AACxE,cAAI,MAAMJ,UAASQ,UAAS,CAAC,GAAGR,UAAS,IAAIK,QAAO,GAAGD,OAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AAC5E,cAAI,MAAM,GAAG,GAAGE,KAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,KAAKA,KAAI,GAAG,GAAG,CAAC,CAAC;AACvD,cAAI,OAAOG,SAAQ,KAAK,GAAG;AAC3B,YAAE,CAAC,IAAI,KAAK,OAAOL,OAAMH,OAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAC1C,YAAE,IAAI,CAAC,IAAI,KAAK,OAAOG,OAAMH,OAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAClD;AAAA,QACF,OAAO;AACL,cAAI,OAAOI,QAAO,GAAGD,OAAM,KAAK,CAAC,CAAC,CAAC,CAAC;AACpC,mBAAS,KAAK,GAAG,KAAK,GAAG,MAAM;AAC7B,mBAAOE,KAAI,MAAMN,UAAS,EAAE,EAAE,GAAGK,QAAO,GAAGD,OAAM,IAAI,CAAC,CAAC,CAAC,CAAC;AAAA,UAC3D;AACA,cAAI,OAAOC,QAAO,GAAGD,OAAM,GAAG,CAAC,CAAC;AAChC,cAAI,OAAOG,UAAS,GAAGP,UAAS,MAAMQ,UAAS,CAAC,CAAC,CAAC;AAClD,YAAE,CAAC,IAAIC,SAAQ,MAAM,IAAI;AAAA,QAC3B;AAAA,MACF;AACA,UAAI,IAAIV,QAAOD,mBAAkB,GAAG,CAAC,CAAC;AACtC,UAAI,IAAIE,UAAS,GAAGA,UAAS,GAAGG,WAAU,CAAC,CAAC,CAAC;AAC7C,aAAO;AAAA,IACT;AAAA,EACF,CAAC;;;ACrHD,MAAIS,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,YAAY,YAAY,MAAM,QAAQ,UAAU;AAChF,MAAI,cAA6B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,UAAAC;AAAA,MACA,UAAAC;AAAA,MACA,IAAAC;AAAA,MACA,MAAAC;AAAA,MACA,UAAAC;AAAA,IACF,IAAI;AAuBJ,WAAON,OAAMF,SAAM;AAAA,MACjB,OAAO,SAASS,OAAM,GAAG;AACvB,YAAI,IAAI,OAAON,QAAO,CAAC,CAAC;AACxB,eAAO;AAAA,UACL,GAAG,EAAE,EAAE,QAAQ;AAAA,UACf,GAAG,EAAE,EAAE,QAAQ;AAAA,QACjB;AAAA,MACF;AAAA,MACA,QAAQ,SAASO,QAAO,GAAG;AACzB,eAAO,OAAO,CAAC;AAAA,MACjB;AAAA,IACF,CAAC;AACD,aAAS,OAAO,GAAG;AACjB,UAAI,IAAI,EAAE,KAAK,EAAE,CAAC;AAClB,UAAI,IAAI;AACR,UAAI,IAAIN,UAAS,CAAC;AAClB,UAAI,IAAI;AACR,UAAI;AACJ,SAAG;AACD,aAAK;AACL,YAAI,KAAKE,IAAG,CAAC;AACb,YAAIK,KAAI,GAAG;AACX,YAAI,IAAI,GAAG;AACX,YAAIN,UAAS,GAAGM,EAAC;AACjB,YAAIN,UAAS,GAAGM,EAAC;AACjB,YAAI,MAAM,KAAK;AACb;AAAA,QACF;AAAA,MACF,SAASJ,MAAKC,UAAS,GAAG,EAAE,CAAC,IAAI;AACjC,aAAO;AAAA,QACL;AAAA,QACA,GAAG;AAAA,MACL;AAAA,IACF;AAAA,EACF,CAAC;;;ACpED,MAAII,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,aAAa,YAAY,WAAW;AACpE,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,UAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AA2BJ,WAAOJ,OAAMF,SAAM;AAAA,MACjB,kBAAkB,SAAS,cAAc,GAAGO,IAAG;AAC7C,eAAOH,WAAU,GAAGE,WAAU,CAAC,GAAGD,UAAS,IAAIE,EAAC,CAAC;AAAA,MACnD;AAAA,MACA,iBAAiB,SAAS,aAAa,GAAGA,IAAG;AAC3C,eAAOH,WAAUD,QAAO,CAAC,GAAGG,WAAUH,QAAO,CAAC,CAAC,GAAGE,UAAS,IAAIE,EAAC,CAAC;AAAA,MACnE;AAAA,MACA,iBAAiB,SAAS,aAAa,GAAGA,IAAG;AAC3C,eAAOH,WAAU,GAAGE,WAAUH,QAAO,CAAC,CAAC,GAAGA,QAAOE,UAAS,IAAIE,EAAC,CAAC,CAAC;AAAA,MACnE;AAAA,MACA,gBAAgB,SAAS,YAAY,GAAGA,IAAG;AACzC,eAAOH,WAAUD,QAAO,CAAC,GAAGG,WAAUH,QAAO,CAAC,CAAC,GAAGA,QAAOE,UAAS,IAAIE,EAAC,CAAC,CAAC,EAAE,QAAQ;AAAA,MACrF;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC/CD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,YAAY,eAAe,gBAAgB,KAAK;AAChF,MAAI,eAA8B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,UAAAC;AAAA,MACA,aAAAC;AAAA,MACA,cAAAC;AAAA,MACA,KAAAC;AAAA,IACF,IAAI;AACJ,QAAI,gBAAgB,oBAAoB;AAAA,MACtC,OAAAL;AAAA,MACA,aAAAG;AAAA,IACF,CAAC;AACD,QAAI,eAAe,mBAAmB;AAAA,MACpC,OAAAH;AAAA,IACF,CAAC;AAiCD,WAAOA,OAAM,UAAUM,QAAO;AAAA;AAAA,MAG5B,kCAAkC,SAAS,4BAA4B,GAAG,GAAG;AAK3E,eAAOJ,UAAS,GAAGG,KAAI,CAAC,CAAC;AAAA,MAC3B;AAAA,MACA,oBAAoB,SAAS,gBAAgB,GAAG,GAAG;AACjD,eAAO,aAAa,GAAG,GAAGD,eAAc,KAAK;AAAA,MAC/C;AAAA,MACA,qBAAqB,SAAS,iBAAiB,GAAG,GAAG;AACnD,eAAO,cAAc,GAAG,GAAGA,eAAc,KAAK;AAAA,MAChD;AAAA,MACA,cAAc,SAAS,UAAU,GAAG,GAAG;AAErC,eAAO,aAAaH,QAAO,CAAC,GAAG,GAAGG,eAAc,KAAK,EAAE,QAAQ;AAAA,MACjE;AAAA,MACA,uBAAuB,SAAS,kBAAkB,GAAG,GAAG;AACtD,eAAOF,UAAS,GAAGG,KAAI,CAAC,CAAC;AAAA,MAC3B;AAAA,IACF,GAAGD,cAAa,UAAU,CAAC;AAAA,EAC7B,CAAC;;;AC5ED,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,aAAa,kBAAkB,gBAAgB,kBAAkB,aAAa,QAAQ,KAAK;AACjH,MAAI,iBAAgC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC7E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,cAAAC;AAAA,MACA,WAAAC;AAAA,MACA,MAAAC;AAAA,MACA,KAAAC;AAAA,IACF,IAAI;AAoDJ,WAAOP,OAAMF,SAAM;AAAA,MACjB,uBAAuB,SAAS,kBAAkB,GAAG,GAAG,GAAG;AAEzD,YAAI,EAAE,WAAW,KAAK,EAAE,WAAW,KAAK,EAAE,WAAW,GAAG;AACtD,cAAI,CAAC,IAAI,CAAC,GAAG;AACX,kBAAM,IAAI,UAAU,gEAAgE;AAAA,UACtF;AACA,cAAI,CAAC,IAAI,CAAC,GAAG;AACX,kBAAM,IAAI,UAAU,iEAAiE;AAAA,UACvF;AACA,cAAI,CAAC,IAAI,CAAC,GAAG;AACX,kBAAM,IAAI,UAAU,gEAAgE;AAAA,UACtF;AACA,cAAIO,WAAU,GAAG,CAAC,GAAG;AACnB,kBAAM,IAAI,UAAU,+CAA+C;AAAA,UACrE;AACA,cAAI,SAASH,gBAAe,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AACtC,cAAI,SAASA,gBAAe,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AACtC,cAAI,WAAWA,gBAAeC,gBAAe,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,GAAGA,gBAAe,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AACpF,iBAAO,qBAAqB,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,QAAQ,QAAQ,QAAQ;AAAA,QAClE,OAAO;AACL,gBAAM,IAAI,UAAU,8BAA8B;AAAA,QACpD;AAAA,MACF;AAAA,MACA,0BAA0B,SAAS,qBAAqB,GAAG,GAAG,GAAG;AAC/D,YAAI,OAAO,KAAK,CAAC,EAAE,WAAW,KAAK,OAAO,KAAK,CAAC,EAAE,WAAW,KAAK,OAAO,KAAK,CAAC,EAAE,WAAW,GAAG;AAC7F,cAAI,CAAC,IAAI,CAAC,GAAG;AACX,kBAAM,IAAI,UAAU,6DAA6D;AAAA,UACnF;AACA,cAAI,CAAC,IAAI,CAAC,GAAG;AACX,kBAAM,IAAI,UAAU,qEAAqE;AAAA,UAC3F;AACA,cAAI,CAAC,IAAI,CAAC,GAAG;AACX,kBAAM,IAAI,UAAU,qEAAqE;AAAA,UAC3F;AACA,cAAIE,WAAU,eAAe,CAAC,GAAG,eAAe,CAAC,CAAC,GAAG;AACnD,kBAAM,IAAI,UAAU,+CAA+C;AAAA,UACrE;AACA,cAAI,YAAY,KAAK,YAAY,KAAK,gBAAgB,KAAK,gBAAgB,KAAK,gBAAgB,KAAK,gBAAgB,GAAG;AACtH,gBAAI,SAASH,gBAAe,EAAE,YAAY,EAAE,UAAU;AACtD,gBAAI,SAASA,gBAAe,EAAE,YAAY,EAAE,UAAU;AACtD,gBAAI,WAAWA,gBAAeC,gBAAe,EAAE,YAAY,EAAE,UAAU,GAAGA,gBAAe,EAAE,YAAY,EAAE,UAAU,CAAC;AACpH,mBAAO,qBAAqB,EAAE,QAAQ,EAAE,QAAQ,QAAQ,QAAQ,QAAQ;AAAA,UAC1E,OAAO;AACL,kBAAM,IAAI,UAAU,wBAAwB;AAAA,UAC9C;AAAA,QACF,OAAO;AACL,gBAAM,IAAI,UAAU,8BAA8B;AAAA,QACpD;AAAA,MACF;AAAA,MACA,gBAAgB,SAAS,YAAY,GAAG,GAAG;AAEzC,YAAI,EAAE,WAAW,KAAK,EAAE,WAAW,GAAG;AACpC,cAAI,CAAC,IAAI,CAAC,GAAG;AACX,kBAAM,IAAI,UAAU,gEAAgE;AAAA,UACtF;AACA,cAAI,CAAC,IAAI,CAAC,GAAG;AACX,kBAAM,IAAI,UAAU,iEAAiE;AAAA,UACvF;AACA,iBAAO,qBAAqB,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AAAA,QAC1D,WAAW,EAAE,WAAW,KAAK,EAAE,WAAW,GAAG;AAE3C,cAAI,CAAC,IAAI,CAAC,GAAG;AACX,kBAAM,IAAI,UAAU,gEAAgE;AAAA,UACtF;AACA,cAAI,CAAC,gBAAgB,CAAC,GAAG;AACvB,kBAAM,IAAI,UAAU,iEAAiE;AAAA,UACvF;AACA,iBAAO,qBAAqB,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AAAA,QAClF,WAAW,EAAE,WAAW,EAAE,UAAU,EAAE,SAAS,GAAG;AAEhD,cAAI,CAAC,qBAAqB,CAAC,GAAG;AAC5B,kBAAM,IAAI,UAAU,wDAAwD;AAAA,UAC9E;AACA,cAAI,CAAC,qBAAqB,CAAC,GAAG;AAC5B,kBAAM,IAAI,UAAU,wDAAwD;AAAA,UAC9E;AACA,iBAAO,mBAAmB,GAAG,CAAC;AAAA,QAChC,OAAO;AACL,gBAAM,IAAI,UAAU,8BAA8B;AAAA,QACpD;AAAA,MACF;AAAA,MACA,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,YAAI,OAAO,KAAK,CAAC,EAAE,WAAW,KAAK,OAAO,KAAK,CAAC,EAAE,WAAW,GAAG;AAC9D,cAAI,CAAC,IAAI,CAAC,GAAG;AACX,kBAAM,IAAI,UAAU,6DAA6D;AAAA,UACnF;AACA,cAAI,CAAC,IAAI,CAAC,GAAG;AACX,kBAAM,IAAI,UAAU,+EAA+E;AAAA,UACrG;AACA,cAAI,YAAY,KAAK,YAAY,KAAK,gBAAgB,KAAK,gBAAgB,KAAK,cAAc,GAAG;AAC/F,mBAAO,qBAAqB,EAAE,QAAQ,EAAE,QAAQ,EAAE,YAAY,EAAE,YAAY,EAAE,QAAQ;AAAA,UACxF,OAAO;AACL,kBAAM,IAAI,UAAU,wBAAwB;AAAA,UAC9C;AAAA,QACF,WAAW,OAAO,KAAK,CAAC,EAAE,WAAW,KAAK,OAAO,KAAK,CAAC,EAAE,WAAW,GAAG;AAErE,cAAI,CAAC,IAAI,CAAC,GAAG;AACX,kBAAM,IAAI,UAAU,qEAAqE;AAAA,UAC3F;AACA,cAAI,CAAC,gBAAgB,CAAC,GAAG;AACvB,kBAAM,IAAI,UAAU,kEAAkE;AAAA,UACxF;AACA,cAAI,YAAY,KAAK,YAAY,KAAK,QAAQ,KAAK,QAAQ,KAAK,QAAQ,KAAK,OAAO,KAAK,OAAO,KAAK,OAAO,GAAG;AAC7G,mBAAO,qBAAqB,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AAAA,UAC3F,OAAO;AACL,kBAAM,IAAI,UAAU,wBAAwB;AAAA,UAC9C;AAAA,QACF,WAAW,OAAO,KAAK,CAAC,EAAE,WAAW,KAAK,OAAO,KAAK,CAAC,EAAE,WAAW,GAAG;AAErE,cAAI,CAAC,IAAI,CAAC,GAAG;AACX,kBAAM,IAAI,UAAU,mEAAmE;AAAA,UACzF;AACA,cAAI,CAAC,IAAI,CAAC,GAAG;AACX,kBAAM,IAAI,UAAU,mEAAmE;AAAA,UACzF;AACA,cAAI,eAAe,KAAK,eAAe,KAAK,eAAe,KAAK,eAAe,GAAG;AAChF,mBAAO,mBAAmB,CAAC,EAAE,WAAW,EAAE,SAAS,GAAG,CAAC,EAAE,WAAW,EAAE,SAAS,CAAC;AAAA,UAClF,OAAO;AACL,kBAAM,IAAI,UAAU,wBAAwB;AAAA,UAC9C;AAAA,QACF,WAAW,OAAO,KAAK,CAAC,EAAE,WAAW,KAAK,OAAO,KAAK,CAAC,EAAE,WAAW,GAAG;AAErE,cAAI,CAAC,IAAI,CAAC,GAAG;AACX,kBAAM,IAAI,UAAU,8EAA8E;AAAA,UACpG;AACA,cAAI,CAAC,IAAI,CAAC,GAAG;AACX,kBAAM,IAAI,UAAU,8EAA8E;AAAA,UACpG;AACA,cAAI,eAAe,KAAK,eAAe,KAAK,eAAe,KAAK,eAAe,KAAK,eAAe,KAAK,eAAe,GAAG;AACxH,mBAAO,mBAAmB,CAAC,EAAE,WAAW,EAAE,WAAW,EAAE,SAAS,GAAG,CAAC,EAAE,WAAW,EAAE,WAAW,EAAE,SAAS,CAAC;AAAA,UAC5G,OAAO;AACL,kBAAM,IAAI,UAAU,wBAAwB;AAAA,UAC9C;AAAA,QACF,OAAO;AACL,gBAAM,IAAI,UAAU,8BAA8B;AAAA,QACpD;AAAA,MACF;AAAA,MACA,OAAO,SAASK,OAAM,KAAK;AACzB,YAAI,CAAC,UAAU,GAAG,GAAG;AACnB,gBAAM,IAAI,UAAU,kEAAkE;AAAA,QACxF;AACA,eAAO,kBAAkB,GAAG;AAAA,MAC9B;AAAA,IACF,CAAC;AACD,aAAS,UAAU,GAAG;AAEpB,aAAO,OAAO,MAAM,YAAY,YAAY,CAAC;AAAA,IAC/C;AACA,aAAS,IAAI,GAAG;AAEd,UAAI,EAAE,gBAAgB,OAAO;AAC3B,YAAI,eAAe,CAAC;AAAA,MACtB;AACA,aAAO,UAAU,EAAE,CAAC,CAAC,KAAK,UAAU,EAAE,CAAC,CAAC;AAAA,IAC1C;AACA,aAAS,IAAI,GAAG;AAEd,UAAI,EAAE,gBAAgB,OAAO;AAC3B,YAAI,eAAe,CAAC;AAAA,MACtB;AACA,aAAO,UAAU,EAAE,CAAC,CAAC,KAAK,UAAU,EAAE,CAAC,CAAC,KAAK,UAAU,EAAE,CAAC,CAAC;AAAA,IAC7D;AACA,aAAS,qBAAqB,GAAG;AAE/B,UAAI,CAAC,MAAM,QAAQ,CAAC,GAAG;AACrB,YAAI,eAAe,CAAC;AAAA,MACtB;AACA,aAAO,EAAE,MAAM,SAAS;AAAA,IAC1B;AACA,aAAS,gBAAgB,GAAG;AAC1B,UAAI,EAAE,gBAAgB,OAAO;AAC3B,YAAI,eAAe,CAAC;AAAA,MACtB;AACA,aAAO,UAAU,EAAE,CAAC,CAAC,KAAK,UAAU,EAAE,CAAC,CAAC,KAAK,UAAU,EAAE,CAAC,CAAC,KAAK,UAAU,EAAE,CAAC,CAAC,KAAK,UAAU,EAAE,CAAC,CAAC,KAAK,UAAU,EAAE,CAAC,CAAC;AAAA,IACtH;AACA,aAAS,eAAe,GAAG;AACzB,UAAI,OAAO,OAAO,KAAK,CAAC;AACxB,UAAI,IAAI,CAAC;AACT,eAASC,KAAI,GAAGA,KAAI,KAAK,QAAQA,MAAK;AACpC,UAAE,KAAK,EAAE,KAAKA,EAAC,CAAC,CAAC;AAAA,MACnB;AACA,aAAO;AAAA,IACT;AACA,aAAS,UAAU,GAAG;AAEpB,UAAI,EAAE,CAAC,EAAE,WAAW,KAAK,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG;AACjE,YAAI,EAAE,KAAK,QAAM,GAAG,WAAW,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,GAAG;AAC3E,iBAAO;AAAA,QACT;AAAA,MACF,WAAW,EAAE,CAAC,EAAE,WAAW,KAAK,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG;AAC9F,YAAI,EAAE,KAAK,QAAM,GAAG,WAAW,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,GAAG;AAChG,iBAAO;AAAA,QACT;AAAA,MACF,OAAO;AACL,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AACA,aAAS,qBAAqB,GAAG,GAAG,GAAG,GAAG,GAAG;AAC3C,UAAI,MAAMF,KAAIN,WAAUA,WAAUE,gBAAe,GAAG,CAAC,GAAGA,gBAAe,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;AACjF,UAAI,MAAMG,MAAKL,WAAUE,gBAAe,GAAG,CAAC,GAAGA,gBAAe,GAAG,CAAC,CAAC,CAAC;AACpE,aAAOC,cAAa,KAAK,GAAG;AAAA,IAC9B;AACA,aAAS,qBAAqB,GAAG,GAAG,GAAG,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG;AAC1D,UAAI,MAAM,CAACF,gBAAeC,gBAAeD,gBAAe,IAAI,CAAC,GAAG,CAAC,GAAGC,gBAAeD,gBAAe,IAAI,CAAC,GAAG,CAAC,CAAC,GAAGA,gBAAeC,gBAAeD,gBAAe,IAAI,CAAC,GAAG,CAAC,GAAGC,gBAAeD,gBAAe,IAAI,CAAC,GAAG,CAAC,CAAC,GAAGA,gBAAeC,gBAAeD,gBAAe,IAAI,CAAC,GAAG,CAAC,GAAGC,gBAAeD,gBAAe,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;AACrT,YAAMI,MAAKL,WAAUA,WAAUE,gBAAe,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,GAAGA,gBAAe,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAGA,gBAAe,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AAC/H,UAAI,MAAMG,MAAKL,WAAUA,WAAUE,gBAAe,GAAG,CAAC,GAAGA,gBAAe,GAAG,CAAC,CAAC,GAAGA,gBAAe,GAAG,CAAC,CAAC,CAAC;AACrG,aAAOC,cAAa,KAAK,GAAG;AAAA,IAC9B;AACA,aAAS,mBAAmB,GAAG,GAAG;AAChC,UAAI,aAAa,EAAE;AACnB,UAAI,SAAS;AACb,UAAIM,QAAO;AACX,eAASD,KAAI,GAAGA,KAAI,YAAYA,MAAK;AACnC,QAAAC,QAAOR,gBAAe,EAAEO,EAAC,GAAG,EAAEA,EAAC,CAAC;AAChC,iBAASR,WAAUE,gBAAeO,OAAMA,KAAI,GAAG,MAAM;AAAA,MACvD;AACA,aAAOJ,MAAK,MAAM;AAAA,IACpB;AACA,aAAS,kBAAkB,GAAG;AAC5B,UAAI,SAAS,CAAC;AACd,UAAI,SAAS,CAAC;AACd,UAAI,SAAS,CAAC;AACd,eAASG,KAAI,GAAGA,KAAI,EAAE,SAAS,GAAGA,MAAK;AACrC,iBAAS,IAAIA,KAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACrC,cAAI,EAAE,CAAC,EAAE,WAAW,GAAG;AACrB,qBAAS,CAAC,EAAEA,EAAC,EAAE,CAAC,GAAG,EAAEA,EAAC,EAAE,CAAC,CAAC;AAC1B,qBAAS,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;AAAA,UAC5B,WAAW,EAAE,CAAC,EAAE,WAAW,GAAG;AAC5B,qBAAS,CAAC,EAAEA,EAAC,EAAE,CAAC,GAAG,EAAEA,EAAC,EAAE,CAAC,GAAG,EAAEA,EAAC,EAAE,CAAC,CAAC;AACnC,qBAAS,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;AAAA,UACrC;AACA,iBAAO,KAAK,mBAAmB,QAAQ,MAAM,CAAC;AAAA,QAChD;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,EACF,CAAC;;;AC/SD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,OAAO,OAAO,aAAa,UAAU,YAAY,kBAAkB,gBAAgB,YAAY,WAAW,eAAe,WAAW,UAAU,WAAW;AACzL,MAAI,kBAAiC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,KAAAC;AAAA,MACA,KAAAC;AAAA,MACA,WAAAC;AAAA,MACA,QAAAC;AAAA,MACA,UAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,cAAAC;AAAA,MACA,UAAAC;AAAA,MACA,SAAAC;AAAA,MACA,aAAAC;AAAA,MACA,SAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AA4BJ,WAAOd,OAAM,aAAa;AAAA,MACxB,uBAAuB;AAAA,MACvB,8BAA8B;AAAA,MAC9B,0BAA0B,SAAS,qBAAqB,GAAG,GAAG,OAAO;AACnE,YAAI,MAAM,KAAK,EAAE,QAAQ,GAAG,EAAE,QAAQ,GAAG,MAAM,QAAQ,CAAC;AACxD,eAAO,QAAQ,OAAO,OAAOK,QAAO,GAAG;AAAA,MACzC;AAAA,MACA,kCAAkC,SAAS,4BAA4B,GAAG,GAAG,GAAG,GAAG;AAEjF,YAAI,MAAM,MAAM,EAAE,QAAQ,GAAG,EAAE,QAAQ,GAAG,EAAE,QAAQ,GAAG,EAAE,QAAQ,CAAC;AAClE,eAAO,QAAQ,OAAO,OAAOA,QAAO,GAAG;AAAA,MACzC;AAAA,IACF,CAAC;AACD,aAAS,KAAK,GAAG,GAAG,OAAO;AACzB,UAAI,WAAW,CAAC;AAChB,UAAI,WAAW,CAAC;AAChB,cAAQ,WAAW,KAAK;AACxB,UAAI,CAAC,IAAI,CAAC,GAAG;AACX,cAAM,IAAI,UAAU,gEAAgE;AAAA,MACtF;AACA,UAAI,CAAC,IAAI,CAAC,GAAG;AACX,cAAM,IAAI,UAAU,iEAAiE;AAAA,MACvF;AACA,UAAI,CAAC,IAAI,KAAK,GAAG;AACf,cAAM,IAAI,UAAU,iDAAiD;AAAA,MACvE;AACA,aAAO,oBAAoB,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;AAAA,IACvG;AACA,aAAS,MAAM,GAAG,GAAG,GAAG,GAAG;AACzB,UAAI,WAAW,CAAC;AAChB,UAAI,WAAW,CAAC;AAChB,UAAI,WAAW,CAAC;AAChB,UAAI,WAAW,CAAC;AAChB,UAAI,EAAE,WAAW,GAAG;AAClB,YAAI,CAAC,IAAI,CAAC,GAAG;AACX,gBAAM,IAAI,UAAU,gEAAgE;AAAA,QACtF;AACA,YAAI,CAAC,IAAI,CAAC,GAAG;AACX,gBAAM,IAAI,UAAU,iEAAiE;AAAA,QACvF;AACA,YAAI,CAAC,IAAI,CAAC,GAAG;AACX,gBAAM,IAAI,UAAU,gEAAgE;AAAA,QACtF;AACA,YAAI,CAAC,IAAI,CAAC,GAAG;AACX,gBAAM,IAAI,UAAU,iEAAiE;AAAA,QACvF;AACA,eAAO,aAAa,GAAG,GAAG,GAAG,CAAC;AAAA,MAChC,WAAW,EAAE,WAAW,GAAG;AACzB,YAAI,CAAC,IAAI,CAAC,GAAG;AACX,gBAAM,IAAI,UAAU,gEAAgE;AAAA,QACtF;AACA,YAAI,CAAC,IAAI,CAAC,GAAG;AACX,gBAAM,IAAI,UAAU,iEAAiE;AAAA,QACvF;AACA,YAAI,CAAC,IAAI,CAAC,GAAG;AACX,gBAAM,IAAI,UAAU,gEAAgE;AAAA,QACtF;AACA,YAAI,CAAC,IAAI,CAAC,GAAG;AACX,gBAAM,IAAI,UAAU,iEAAiE;AAAA,QACvF;AACA,eAAO,aAAa,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AAAA,MAC5F,OAAO;AACL,cAAM,IAAI,UAAU,qDAAqD;AAAA,MAC3E;AAAA,IACF;AAGA,aAAS,WAAW,KAAK;AAEvB,UAAI,IAAI,WAAW,EAAG,QAAO,IAAI,CAAC;AAGlC,UAAI,IAAI,SAAS,KAAK,MAAM,QAAQ,IAAI,CAAC,CAAC,GAAG;AAC3C,YAAI,IAAI,MAAM,QAAM,MAAM,QAAQ,EAAE,KAAK,GAAG,WAAW,CAAC,EAAG,QAAOO,SAAQ,GAAG;AAAA,MAC/E;AACA,aAAO;AAAA,IACT;AACA,aAAS,IAAI,GAAG;AACd,aAAO,EAAE,WAAW,KAAKE,WAAU,EAAE,CAAC,CAAC,KAAKA,WAAU,EAAE,CAAC,CAAC;AAAA,IAC5D;AACA,aAAS,IAAI,GAAG;AACd,aAAO,EAAE,WAAW,KAAKA,WAAU,EAAE,CAAC,CAAC,KAAKA,WAAU,EAAE,CAAC,CAAC,KAAKA,WAAU,EAAE,CAAC,CAAC;AAAA,IAC/E;AACA,aAAS,IAAI,GAAG;AACd,aAAO,EAAE,WAAW,KAAKA,WAAU,EAAE,CAAC,CAAC,KAAKA,WAAU,EAAE,CAAC,CAAC,KAAKA,WAAU,EAAE,CAAC,CAAC,KAAKA,WAAU,EAAE,CAAC,CAAC;AAAA,IAClG;AACA,aAAS,aAAa,KAAK,KAAK,KAAK,KAAK;AACxC,UAAI,KAAK;AACT,UAAI,KAAK;AACT,UAAI,KAAKL,UAAS,IAAI,GAAG;AACzB,UAAI,KAAKA,UAAS,IAAI,GAAG;AACzB,UAAIM,OAAMN,UAASF,gBAAe,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,GAAGA,gBAAe,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;AAC7E,UAAIM,QAAOE,IAAG,EAAG,QAAO;AACxB,UAAIL,SAAQR,KAAIa,IAAG,GAAGd,QAAO,MAAM,GAAG;AACpC,eAAO;AAAA,MACT;AACA,UAAI,SAASM,gBAAe,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AACxC,UAAI,SAASA,gBAAe,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AACxC,UAAI,SAASA,gBAAe,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AACxC,UAAI,SAASA,gBAAe,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AACxC,UAAI,IAAIC,cAAaJ,WAAUK,UAASA,UAAS,QAAQ,MAAM,GAAG,MAAM,GAAG,MAAM,GAAGM,IAAG;AACvF,aAAOZ,KAAIG,UAAS,IAAI,CAAC,GAAG,EAAE;AAAA,IAChC;AACA,aAAS,mBAAmB,GAAG,GAAG,GAAG,GAAGU,IAAG,GAAG,GAAG,GAAGC,IAAG,GAAG,GAAG,GAAG;AAE9D,UAAI,OAAOV,gBAAeE,UAAS,GAAG,CAAC,GAAGA,UAAS,GAAG,CAAC,CAAC;AACxD,UAAIS,QAAOX,gBAAeE,UAASO,IAAG,CAAC,GAAGP,UAAS,GAAG,CAAC,CAAC;AACxD,UAAIU,QAAOZ,gBAAeE,UAASQ,IAAG,CAAC,GAAGR,UAAS,GAAG,CAAC,CAAC;AACxD,aAAOL,WAAUA,WAAU,MAAMc,KAAI,GAAGC,KAAI;AAAA,IAC9C;AACA,aAAS,aAAa,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;AACpE,UAAI,QAAQ,mBAAmB,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAC7E,UAAI,QAAQ,mBAAmB,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAC7E,UAAI,QAAQ,mBAAmB,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAC7E,UAAI,QAAQ,mBAAmB,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAC7E,UAAI,QAAQ,mBAAmB,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AAC7E,UAAI,YAAYV,UAASF,gBAAe,OAAO,KAAK,GAAGA,gBAAe,OAAO,KAAK,CAAC;AACnF,UAAI,cAAcE,UAASF,gBAAe,OAAO,KAAK,GAAGA,gBAAe,OAAO,KAAK,CAAC;AACrF,UAAIM,QAAO,WAAW,EAAG,QAAO;AAChC,UAAI,KAAKL,cAAa,WAAW,WAAW;AAC5C,UAAI,KAAKA,cAAaJ,WAAU,OAAOG,gBAAe,IAAI,KAAK,CAAC,GAAG,KAAK;AACxE,UAAI,MAAMH,WAAU,IAAIG,gBAAe,IAAIE,UAAS,IAAI,EAAE,CAAC,CAAC;AAC5D,UAAI,MAAML,WAAU,IAAIG,gBAAe,IAAIE,UAAS,IAAI,EAAE,CAAC,CAAC;AAC5D,UAAI,MAAML,WAAU,IAAIG,gBAAe,IAAIE,UAAS,IAAI,EAAE,CAAC,CAAC;AAC5D,UAAI,MAAML,WAAU,IAAIG,gBAAe,IAAIE,UAAS,IAAI,EAAE,CAAC,CAAC;AAC5D,UAAI,MAAML,WAAU,IAAIG,gBAAe,IAAIE,UAAS,IAAI,EAAE,CAAC,CAAC;AAC5D,UAAI,MAAML,WAAU,IAAIG,gBAAe,IAAIE,UAAS,IAAI,EAAE,CAAC,CAAC;AAC5D,UAAIE,aAAY,KAAK,GAAG,KAAKA,aAAY,KAAK,GAAG,KAAKA,aAAY,KAAK,GAAG,GAAG;AAC3E,eAAO,CAAC,KAAK,KAAK,GAAG;AAAA,MACvB,OAAO;AACL,eAAO;AAAA,MACT;AAAA,IACF;AACA,aAAS,oBAAoB,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG;AAC/D,UAAI,MAAMJ,gBAAe,IAAI,CAAC;AAC9B,UAAI,MAAMA,gBAAe,IAAI,CAAC;AAC9B,UAAI,MAAMA,gBAAe,IAAI,CAAC;AAC9B,UAAI,MAAMA,gBAAe,IAAI,CAAC;AAC9B,UAAI,MAAMA,gBAAe,IAAI,CAAC;AAC9B,UAAI,MAAMA,gBAAe,IAAI,CAAC;AAC9B,UAAI,YAAYE,UAASA,UAASA,UAAS,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAC7D,UAAI,cAAcA,UAASA,UAASA,UAASL,WAAUA,WAAU,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AACjG,UAAI,IAAII,cAAa,WAAW,WAAW;AAC3C,UAAI,KAAKJ,WAAU,IAAIG,gBAAe,GAAGE,UAAS,IAAI,EAAE,CAAC,CAAC;AAC1D,UAAI,KAAKL,WAAU,IAAIG,gBAAe,GAAGE,UAAS,IAAI,EAAE,CAAC,CAAC;AAC1D,UAAI,KAAKL,WAAU,IAAIG,gBAAe,GAAGE,UAAS,IAAI,EAAE,CAAC,CAAC;AAC1D,aAAO,CAAC,IAAI,IAAI,EAAE;AAAA,IAIpB;AAAA,EACF,CAAC;;;ACnMD,MAAIW,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,OAAO,SAAS;AAChD,MAAI,YAA2B,wBAAQD,SAAMC,iBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,KAAAC;AAAA,MACA,SAAAC;AAAA,IACF,IAAI;AAyBJ,WAAOH,OAAMF,SAAM;AAAA;AAAA,MAEjB,kBAAkB;AAAA;AAAA,MAElB,sCAAsC;AAAA;AAAA,MAEtC,OAAO,SAAS,EAAE,MAAM;AACtB,YAAI,oBAAoB,IAAI,GAAG;AAC7B,gBAAM,IAAI,UAAU,wCAAwC;AAAA,QAC9D;AACA,eAAO,KAAK,IAAI;AAAA,MAClB;AAAA,IACF,CAAC;AAQD,aAAS,KAAK,OAAO;AACnB,UAAIM;AACJ,MAAAC,aAAY,OAAO,SAAU,OAAO;AAClC,YAAI;AACF,UAAAD,OAAMA,SAAQ,SAAY,QAAQF,KAAIE,MAAK,KAAK;AAAA,QAClD,SAAS,KAAK;AACZ,gBAAM,oBAAoB,KAAK,OAAO,KAAK;AAAA,QAC7C;AAAA,MACF,CAAC;AAGD,UAAIA,SAAQ,QAAW;AACrB,QAAAA,OAAMD,SAAQ,GAAGF,QAAO,MAAM;AAAA,MAChC;AACA,UAAI,OAAOG,SAAQ,UAAU;AAC3B,QAAAA,OAAMD,SAAQC,MAAK,eAAeA,MAAKH,OAAM,CAAC;AAAA,MAChD;AACA,aAAOG;AAAA,IACT;AACA,aAAS,SAAS,OAAO,KAAK;AAC5B,UAAI;AACF,YAAIA,OAAM,OAAO,OAAO,KAAKF,IAAG;AAChC,eAAOE;AAAA,MACT,SAAS,KAAK;AACZ,cAAM,oBAAoB,KAAK,KAAK;AAAA,MACtC;AAAA,IACF;AAAA,EACF,CAAC;;;AC9ED,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO,WAAW;AACxC,MAAI,eAA8B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AA2BJ,WAAOF,OAAMF,SAAM;AAAA;AAAA,MAEjB,OAAO;AAAA,MACP,QAAQ,SAASK,QAAOC,SAAQ;AAC9B,eAAOA,QAAO,OAAO,QAAQA,QAAO,QAAQ,GAAGA,QAAO,SAAS,CAAC,CAAC;AAAA,MACnE;AAAA;AAAA,MAEA,6BAA6B;AAAA,MAC7B,8BAA8B,SAAS,yBAAyBA,SAAQ,KAAK;AAC3E,eAAOA,QAAO,OAAO,YAAYA,QAAO,QAAQ,GAAG,GAAG,GAAGA,QAAO,SAAS,CAAC;AAAA,MAC5E;AAAA;AAAA,MAEA,OAAO,SAAS,EAAE,MAAM;AACtB,YAAI,oBAAoB,IAAI,GAAG;AAC7B,gBAAM,IAAI,UAAU,qDAAqD;AAAA,QAC3E;AACA,eAAO,QAAQ,IAAI;AAAA,MACrB;AAAA,IACF,CAAC;AAQD,aAAS,QAAQ,OAAO;AACtB,UAAI;AACF,eAAO,WAAW,KAAK;AAAA,MACzB,SAAS,KAAK;AACZ,cAAM,oBAAoB,KAAKN,OAAI;AAAA,MACrC;AAAA,IACF;AACA,aAAS,WAAW,OAAO;AACzB,UAAI,MAAM,WAAW,GAAG;AACtB,eAAO,CAAC;AAAA,MACV;AACA,UAAI,OAAO,CAACI,WAAU,MAAM,CAAC,CAAC,CAAC;AAC/B,eAASG,KAAI,GAAGA,KAAI,MAAM,QAAQ,EAAEA,IAAG;AAIrC,aAAK,KAAKJ,KAAI,KAAKI,KAAI,CAAC,GAAG,MAAMA,EAAC,CAAC,CAAC;AAAA,MACtC;AACA,aAAO;AAAA,IACT;AACA,aAAS,YAAY,OAAO,KAAK;AAC/B,UAAIC,QAAO,UAAU,KAAK;AAC1B,UAAI,MAAM,KAAK,OAAOA,MAAK,QAAQ;AAEjC,cAAM,IAAI,WAAW,KAAKA,MAAK,MAAM;AAAA,MACvC;AACA,UAAI;AACF,eAAO,mBAAmB,OAAO,GAAG;AAAA,MACtC,SAAS,KAAK;AACZ,cAAM,oBAAoB,KAAKR,OAAI;AAAA,MACrC;AAAA,IACF;AAGA,aAAS,mBAAmB,KAAK,KAAK;AACpC,UAAIO,IAAG,KAAK;AACZ,UAAI,OAAO,GAAG;AACZ,YAAI,eAAe,IAAI,CAAC,EAAE,CAAC;AAC3B,YAAI,CAAC,MAAM,QAAQ,YAAY,GAAG;AAChC,iBAAO,WAAW,GAAG;AAAA,QACvB,OAAO;AACL,iBAAO,QAAQ,GAAG;AAClB,gBAAM,CAAC;AACP,eAAKA,KAAI,GAAGA,KAAI,KAAK,QAAQA,MAAK;AAChC,gBAAIA,EAAC,IAAI,mBAAmB,KAAKA,EAAC,GAAG,MAAM,CAAC;AAAA,UAC9C;AACA,iBAAO;AAAA,QACT;AAAA,MACF,OAAO;AACL,cAAM,CAAC;AACP,aAAKA,KAAI,GAAGA,KAAI,IAAI,QAAQA,MAAK;AAC/B,cAAIA,EAAC,IAAI,mBAAmB,IAAIA,EAAC,GAAG,MAAM,CAAC;AAAA,QAC7C;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF,CAAC;;;ACtHD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO,QAAQ;AACrC,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AA4BJ,WAAOF,OAAMF,SAAM;AAAA;AAAA,MAEjB,kBAAkB;AAAA;AAAA,MAElB,sCAAsC;AAAA;AAAA,MAEtC,OAAO,SAAS,EAAE,MAAM;AACtB,YAAI,oBAAoB,IAAI,GAAG;AAC7B,gBAAM,IAAI,UAAU,yCAAyC;AAAA,QAC/D;AACA,eAAO,MAAM,IAAI;AAAA,MACnB;AAAA,IACF,CAAC;AAUD,aAAS,UAAU,OAAO,KAAK;AAC7B,UAAI;AACF,YAAIK,OAAM,OAAO,OAAO,KAAKF,IAAG;AAChC,YAAI,IAAI,MAAM,QAAQ,KAAK,IAAI,UAAU,KAAK,IAAI,MAAM,KAAK;AAC7D,eAAOC,QAAOC,MAAK,EAAE,GAAG,CAAC;AAAA,MAC3B,SAAS,KAAK;AACZ,cAAM,oBAAoB,KAAK,MAAM;AAAA,MACvC;AAAA,IACF;AAQA,aAAS,MAAM,OAAO;AACpB,UAAIA;AACJ,UAAI,MAAM;AACV,MAAAC,aAAY,OAAO,SAAU,OAAO;AAClC,YAAI;AACF,UAAAD,OAAMA,SAAQ,SAAY,QAAQF,KAAIE,MAAK,KAAK;AAChD;AAAA,QACF,SAAS,KAAK;AACZ,gBAAM,oBAAoB,KAAK,QAAQ,KAAK;AAAA,QAC9C;AAAA,MACF,CAAC;AACD,UAAI,QAAQ,GAAG;AACb,cAAM,IAAI,MAAM,6CAA6C;AAAA,MAC/D;AACA,aAAOD,QAAOC,MAAK,GAAG;AAAA,IACxB;AAAA,EACF,CAAC;;;ACzFD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO,UAAU,WAAW,iBAAiB;AACnE,MAAI,eAA8B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,MACA,iBAAAC;AAAA,IACF,IAAI;AAOJ,aAAS,QAAQ,OAAO;AACtB,UAAI;AACF,gBAAQ,QAAQ,MAAM,QAAQ,CAAC;AAC/B,YAAI,MAAM,MAAM;AAChB,YAAI,QAAQ,GAAG;AACb,gBAAM,IAAI,MAAM,2CAA2C;AAAA,QAC7D;AACA,YAAI,MAAM,MAAM,GAAG;AAEjB,cAAI,MAAM,MAAM,IAAI;AACpB,cAAI,QAAQA,iBAAgB,OAAO,MAAM,CAAC;AAG1C,cAAI,OAAO,MAAM,GAAG;AACpB,mBAASC,KAAI,GAAGA,KAAI,KAAK,EAAEA,IAAG;AAC5B,gBAAIF,SAAQ,MAAME,EAAC,GAAG,IAAI,IAAI,GAAG;AAC/B,qBAAO,MAAMA,EAAC;AAAA,YAChB;AAAA,UACF;AACA,iBAAO,QAAQ,MAAM,KAAK;AAAA,QAC5B,OAAO;AAEL,cAAI,IAAID,iBAAgB,QAAQ,MAAM,KAAK,CAAC;AAC5C,iBAAO,OAAO,CAAC;AAAA,QACjB;AAAA,MACF,SAAS,KAAK;AACZ,cAAM,oBAAoB,KAAK,QAAQ;AAAA,MACzC;AAAA,IACF;AAGA,QAAI,SAASJ,OAAM;AAAA,MACjB,uCAAuC,SAAS,iCAAiC,OAAO;AACtF,eAAO;AAAA,MACT;AAAA,IACF,CAAC;AAGD,QAAI,UAAUA,OAAM;AAAA,MAClB,4EAA4E,SAAS,kEAAkE,MAAM,OAAO;AAClK,eAAOE,QAAOD,KAAI,MAAM,KAAK,GAAG,CAAC;AAAA,MACnC;AAAA,IACF,CAAC;AA4BD,WAAOD,OAAMF,SAAM;AAAA;AAAA,MAEjB,kBAAkB;AAAA;AAAA,MAElB,sCAAsC,SAAS,gCAAgC,OAAO,KAAK;AAEzF,cAAM,IAAI,MAAM,qCAAqC;AAAA,MAEvD;AAAA;AAAA,MAEA,OAAO,SAAS,EAAE,MAAM;AACtB,YAAI,oBAAoB,IAAI,GAAG;AAC7B,gBAAM,IAAI,UAAU,2CAA2C;AAAA,QACjE;AACA,eAAO,QAAQ,IAAI;AAAA,MACrB;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACxGD,MAAIQ,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO,OAAO,UAAU,UAAU;AACxD,MAAI,YAA2B,wBAAQD,SAAMC,iBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,KAAAC;AAAA,MACA,QAAAC;AAAA,MACA,UAAAC;AAAA,IACF,IAAI;AAyBJ,WAAOJ,OAAMF,SAAM;AAAA;AAAA,MAEjB,kBAAkB;AAAA;AAAA,MAElB,OAAO,SAAS,EAAE,MAAM;AACtB,eAAO,KAAK,IAAI;AAAA,MAClB;AAAA,IACF,CAAC;AACD,aAAS,KAAK,OAAO;AACnB,cAAQ,QAAQ,MAAM,QAAQ,CAAC;AAC/B,UAAI,MAAM,WAAW,GAAG;AACtB,cAAM,IAAI,MAAM,oEAAoE;AAAA,MACtF;AACA,UAAI;AACF,YAAI,MAAMK,QAAO,KAAK;AACtB,eAAOA,QAAOD,KAAI,OAAO,SAAU,OAAO;AACxC,iBAAOD,KAAIG,UAAS,OAAO,GAAG,CAAC;AAAA,QACjC,CAAC,CAAC;AAAA,MACJ,SAAS,KAAK;AACZ,YAAI,eAAe,aAAa,IAAI,QAAQ,SAAS,QAAQ,GAAG;AAC9D,gBAAM,IAAI,UAAU,IAAI,QAAQ,QAAQ,UAAU,KAAK,CAAC;AAAA,QAC1D,OAAO;AACL,gBAAM,oBAAoB,KAAK,KAAK;AAAA,QACtC;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAC;;;AC3DD,MAAI,wBAAwB;AAC5B,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO,YAAY,YAAY,UAAU,aAAa,OAAO;AACnF,MAAI,iBAAgC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC7E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,UAAAC;AAAA,MACA,UAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,OAAO;AAAA,IACT,IAAI;AAsDJ,WAAOL,OAAMF,SAAM;AAAA;AAAA,MAEjB,kBAAkB,SAAS,cAAc,OAAO;AAC9C,eAAO,KAAK,OAAO,qBAAqB;AAAA,MAC1C;AAAA;AAAA,MAEA,0BAA0B;AAAA;AAAA,MAE1B,sCAAsC,SAAS,gCAAgC,OAAO,KAAK;AACzF,eAAO,QAAQ,OAAO,KAAK,qBAAqB;AAAA,MAClD;AAAA;AAAA,MAEA,8CAA8C;AAAA;AAAA,MAE9C,OAAO,SAAS,EAAE,MAAM;AACtB,eAAO,KAAK,MAAM,qBAAqB;AAAA,MACzC;AAAA,IACF,CAAC;AAaD,aAAS,KAAK,OAAO,eAAe;AAClC,UAAIQ;AACJ,UAAI,MAAM;AACV,UAAI,MAAM,WAAW,GAAG;AACtB,cAAM,IAAI,YAAY,gEAAgE;AAAA,MACxF;AAGA,MAAAC,aAAY,OAAO,SAAU,OAAO;AAClC,YAAI;AACF,UAAAD,OAAMA,SAAQ,SAAY,QAAQL,KAAIK,MAAK,KAAK;AAChD;AAAA,QACF,SAAS,KAAK;AACZ,gBAAM,oBAAoB,KAAK,YAAY,KAAK;AAAA,QAClD;AAAA,MACF,CAAC;AACD,UAAI,QAAQ,EAAG,OAAM,IAAI,MAAM,6CAA6C;AAC5E,UAAIE,QAAOJ,QAAOE,MAAK,GAAG;AAG1B,MAAAA,OAAM;AACN,MAAAC,aAAY,OAAO,SAAU,OAAO;AAClC,YAAIE,QAAOP,UAAS,OAAOM,KAAI;AAC/B,QAAAF,OAAMA,SAAQ,SAAYH,UAASM,OAAMA,KAAI,IAAIR,KAAIK,MAAKH,UAASM,OAAMA,KAAI,CAAC;AAAA,MAChF,CAAC;AACD,UAAI,UAAUH,IAAG,GAAG;AAClB,eAAOA;AAAA,MACT;AACA,cAAQ,eAAe;AAAA,QACrB,KAAK;AACH,iBAAOF,QAAOE,MAAK,GAAG;AAAA,QACxB,KAAK;AACH,iBAAOF,QAAOE,MAAK,MAAM,CAAC;AAAA,QAC5B,KAAK,YACH;AACE,cAAI,OAAO,YAAYA,IAAG,IAAIA,KAAI,IAAI,CAAC,IAAI;AAC3C,iBAAO,QAAQ,IAAI,OAAOF,QAAOE,MAAK,MAAM,CAAC;AAAA,QAC/C;AAAA,QACF;AACE,gBAAM,IAAI,MAAM,4BAA4B,gBAAgB,6DAAkE;AAAA,MAClI;AAAA,IACF;AACA,aAAS,QAAQ,OAAO,KAAK,eAAe;AAC1C,UAAI;AACF,YAAI,MAAM,WAAW,GAAG;AACtB,gBAAM,IAAI,YAAY,gEAAgE;AAAA,QACxF;AACA,eAAOD,WAAU,OAAO,KAAK,OAAK,KAAK,GAAG,aAAa,CAAC;AAAA,MAC1D,SAAS,KAAK;AACZ,cAAM,oBAAoB,KAAK,UAAU;AAAA,MAC3C;AAAA,IACF;AAAA,EACF,CAAC;;;ACrJD,MAAIK,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,cAAc,OAAO,YAAY,UAAU,YAAY,mBAAmB,WAAW,aAAa,WAAW,aAAa,UAAU,WAAW;AACrK,MAAI,oBAAmC,wBAAQD,SAAMC,iBAAc,UAAQ;AAChF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAAC;AAAA,MACA,KAAAC;AAAA,MACA,UAAAC;AAAA,MACA,QAAAC;AAAA,MACA,UAAAC;AAAA,MACA,iBAAAC;AAAA,MACA,SAAAC;AAAA,MACA,WAAAC;AAAA,MACA,SAAAC;AAAA,MACA,WAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AAmCJ,WAAOZ,OAAMF,SAAM;AAAA,MACjB,sCAAsC,CAAC,MAAM,MAAM,uBAAuB,MAAM,GAAG,KAAK;AAAA,MACxF,8CAA8C,CAAC,MAAM,MAAM,QAAQ,gBAAgB,MAAM,MAAM,OAAO,KAAK,sBAAsB;AAAA,MACjI,+CAA+C;AAAA,MAC/C,uDAAuD,CAAC,MAAM,MAAM,QAAQ,QAAQ,gBAAgB,MAAM,MAAM,QAAQ,KAAK,sBAAsB;AAAA,MACnJ,kCAAkC,CAAC,MAAM,MAAM,2BAA2B,MAAM,GAAG,KAAK;AAAA,MACxF,0CAA0C,CAAC,MAAM,MAAM,QAAQ,gBAAgB,MAAM,MAAM,OAAO,KAAK,0BAA0B;AAAA,MACjI,2CAA2C;AAAA,MAC3C,mDAAmD,CAAC,MAAM,MAAM,QAAQ,QAAQ,gBAAgB,MAAM,MAAM,QAAQ,KAAK,0BAA0B;AAAA,IACrJ,CAAC;AACD,aAAS,gBAAgB,MAAM,MAAM,QAAQ,KAAK,IAAI;AACpD,aAAOc,WAAU,MAAM,KAAK,OAAK,GAAG,GAAG,MAAM,MAAM,CAAC;AAAA,IACtD;AACA,aAAS,uBAAuB,MAAM,SAAS,QAAQ;AACrD,UAAI;AACJ,UAAI,UAAU,KAAK,QAAQ;AAC3B,UAAIH,SAAQ,SAAS,CAAC,GAAG;AACvB,cAAM,IAAI,MAAM,6BAA6B;AAAA,MAC/C;AACA,UAAIC,WAAU,SAAS,CAAC,GAAG;AAEzB,eAAO,SAAS,OAAO,IAAI,aAAa,SAAS,SAAS,MAAM,IAAIT,WAAU,aAAa,SAAS,SAAS,MAAM,CAAC;AAAA,MACtH;AACA,UAAIU,QAAO,SAAS,CAAC,GAAG;AAEtB,YAAI,CAACH,WAAU,OAAO,GAAG;AACvB,gBAAM,IAAI,MAAM,8BAA8B;AAAA,QAChD;AAIA,YAAIG,QAAO,SAAS,UAAU,GAAG;AAC/B,gBAAM,IAAI,MAAM,mFAAmF;AAAA,QACrG;AACA,YAAI,WAAWT,KAAI,SAAS,CAAC;AAC7B,kBAAU,CAAC;AACX,iBAASW,KAAI,GAAGJ,SAAQI,IAAG,OAAO,GAAGA,MAAK;AACxC,cAAI,OAAOT,QAAOS,KAAI,GAAG,QAAQ;AACjC,kBAAQ,KAAK,aAAa,SAAS,MAAM,MAAM,CAAC;AAAA,QAClD;AACA,eAAO,SAAS,OAAO,IAAI,UAAUZ,WAAU,OAAO;AAAA,MACxD;AAAA,IACF;AAYA,aAAS,2BAA2B,MAAM,SAAS,QAAQ;AACzD,UAAI,UAAU,KAAK,QAAQ;AAE3B,UAAI,aAAa,QAAQ,QAAQ;AACjC,UAAI,UAAU,CAAC;AACf,eAASY,KAAI,GAAGA,KAAI,WAAW,QAAQ,EAAEA,IAAG;AAC1C,gBAAQ,KAAK,aAAa,SAAS,WAAWA,EAAC,GAAG,MAAM,CAAC;AAAA,MAC3D;AACA,aAAO;AAAA,IACT;AAWA,aAAS,aAAa,OAAO,MAAM,QAAQ;AACzC,UAAI,OAAO,QAAQ,KAAK;AACxB,UAAI,MAAM,KAAK;AACf,UAAI,QAAQ,GAAG;AACb,cAAM,IAAI,MAAM,gDAAgD;AAAA,MAClE;AACA,UAAIC,SAAQ,SAAS,IAAI,IAAI,QAAQ,MAAM,KAAK,KAAK,MAAM,MAAM,CAAC;AAClE,UAAI,cAAc,SAAS,IAAI,IAAI,KAAK,MAAMA,MAAK,IAAIA,OAAM,MAAM,EAAE,SAAS;AAC9E,UAAI,WAAW,SAAS,IAAI,IAAIA,SAAQ,IAAIA,OAAM,MAAM,WAAW;AACnE,UAAIN,WAAUM,MAAK,GAAG;AACpB,eAAO,SAAS,KAAKA,MAAK,IAAIR,iBAAgB,MAAM,SAAS,IAAI,IAAIQ,SAAQA,OAAM,QAAQ,CAAC;AAAA,MAC9F;AACA,UAAI;AACJ,UAAI;AACJ,UAAI,QAAQ;AACV,eAAO,KAAK,WAAW;AACvB,gBAAQ,KAAK,cAAc,CAAC;AAAA,MAC9B,OAAO;AACL,gBAAQR,iBAAgB,MAAM,cAAc,CAAC;AAG7C,eAAO,KAAK,WAAW;AACvB,iBAASO,KAAI,GAAGA,KAAI,aAAa,EAAEA,IAAG;AACpC,cAAIN,SAAQ,KAAKM,EAAC,GAAG,IAAI,IAAI,GAAG;AAC9B,mBAAO,KAAKA,EAAC;AAAA,UACf;AAAA,QACF;AAAA,MACF;AAEA,aAAOX,KAAIG,UAAS,MAAMF,UAAS,GAAG,QAAQ,CAAC,GAAGE,UAAS,OAAO,QAAQ,CAAC;AAAA,IAC7E;AAAA,EACF,CAAC;;;AC9JD,MAAIU,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO,QAAQ,UAAU;AAC/C,MAAI,YAA2B,wBAAQD,SAAMC,iBAAc,UAAQ;AACxE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,MAAAC;AAAA,MACA,UAAAC;AAAA,IACF,IAAI;AAqDJ,WAAOH,OAAMF,SAAM;AAAA;AAAA,MAEjB,kBAAkB;AAAA;AAAA,MAElB,0BAA0B;AAAA;AAAA,MAE1B,sCAAsC;AAAA;AAAA,MAEtC,8CAA8C;AAAA;AAAA,MAE9C,OAAO,SAAS,EAAE,MAAM;AACtB,eAAO,KAAK,IAAI;AAAA,MAClB;AAAA,IACF,CAAC;AACD,aAAS,KAAK,OAAO,eAAe;AAClC,UAAI,MAAM,WAAW,GAAG;AACtB,cAAM,IAAI,YAAY,2DAA2D;AAAA,MACnF;AACA,UAAI;AACF,YAAI,IAAIK,UAAS,MAAM,MAAM,SAAS;AACtC,YAAI,aAAa,CAAC,GAAG;AACnB,iBAAOF,KAAI,GAAGC,KAAI;AAAA,QACpB,OAAO;AACL,iBAAOA,MAAK,CAAC;AAAA,QACf;AAAA,MACF,SAAS,KAAK;AACZ,YAAI,eAAe,aAAa,IAAI,QAAQ,SAAS,WAAW,GAAG;AACjE,gBAAM,IAAI,UAAU,IAAI,QAAQ,QAAQ,aAAa,MAAM,CAAC;AAAA,QAC9D,OAAO;AACL,gBAAM;AAAA,QACR;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAC;;;AC/FD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,QAAQ,QAAQ,OAAO,OAAO,YAAY,YAAY,OAAO,QAAQ;AACrG,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,MAAAC;AAAA,MACA,KAAAC;AAAA,MACA,KAAAC;AAAA,MACA,UAAAC;AAAA,MACA,UAAAC;AAAA,MACA,KAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AAsBJ,WAAOR,OAAMF,SAAM;AAAA,MACjB,gBAAgB,SAAS,YAAY,GAAG,GAAG;AACzC,eAAO,MAAM,GAAG,CAAC;AAAA,MACnB;AAAA,MACA,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,YAAI,MAAM,MAAM,EAAE,QAAQ,GAAG,EAAE,QAAQ,CAAC;AACxC,eAAO,MAAM,QAAQ,GAAG,IAAIG,QAAO,GAAG,IAAI;AAAA,MAC5C;AAAA,IACF,CAAC;AAQD,aAAS,MAAM,GAAG,GAAG;AACnB,UAAI,eAAe,CAAC;AACpB,UAAI,MAAM,QAAQ,EAAE,CAAC,CAAC,KAAK,MAAM,QAAQ,EAAE,CAAC,CAAC,GAAG;AAC9C,YAAI,EAAE,WAAW,EAAE,QAAQ;AACzB,gBAAM,IAAI,YAAY,8DAA8D;AAAA,QACtF;AACA,iBAASQ,KAAI,GAAGA,KAAI,EAAE,QAAQA,MAAK;AACjC,cAAI,EAAEA,EAAC,EAAE,WAAW,EAAEA,EAAC,EAAE,QAAQ;AAC/B,kBAAM,IAAI,YAAY,0EAA0E;AAAA,UAClG;AACA,uBAAa,KAAK,YAAY,EAAEA,EAAC,GAAG,EAAEA,EAAC,CAAC,CAAC;AAAA,QAC3C;AACA,eAAO;AAAA,MACT,OAAO;AACL,YAAI,EAAE,WAAW,EAAE,QAAQ;AACzB,gBAAM,IAAI,YAAY,0EAA0E;AAAA,QAClG;AACA,eAAO,YAAY,GAAG,CAAC;AAAA,MACzB;AAAA,IACF;AACA,aAAS,YAAY,GAAG,GAAG;AACzB,UAAI,IAAI,EAAE;AACV,UAAI,OAAON,KAAI,CAAC;AAChB,UAAI,OAAOA,KAAI,CAAC;AAChB,UAAI,QAAQ,EAAE,OAAO,CAAC,KAAK,GAAGO,WAAUN,KAAI,KAAKE,UAAS,GAAG,EAAEI,MAAK,CAAC,CAAC,GAAG,CAAC;AAC1E,UAAI,aAAaP,KAAI,EAAE,IAAI,OAAKI,KAAI,GAAG,CAAC,CAAC,CAAC;AAC1C,UAAI,aAAaJ,KAAI,EAAE,IAAI,OAAKI,KAAI,GAAG,CAAC,CAAC,CAAC;AAC1C,UAAI,YAAYF,UAASC,UAAS,GAAG,KAAK,GAAGA,UAAS,MAAM,IAAI,CAAC;AACjE,UAAI,cAAcJ,MAAKI,UAASD,UAASC,UAAS,GAAG,UAAU,GAAGC,KAAI,MAAM,CAAC,CAAC,GAAGF,UAASC,UAAS,GAAG,UAAU,GAAGC,KAAI,MAAM,CAAC,CAAC,CAAC,CAAC;AACjI,aAAOC,QAAO,WAAW,WAAW;AAAA,IACtC;AAAA,EACF,CAAC;;;ACjFD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,aAAa,UAAU,cAAc,WAAW;AAChF,MAAI,kBAAiC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAW;AAAA,MACX,UAAAC;AAAA,IACF,IAAI;AA4BJ,QAAI,cAAc,CAAC,MAAS;AAC5B,QAAI,gBAAgB,CAAC,MAAS;AAC9B,QAAI,WAAW,CAAC,MAAS;AACzB,QAAI,kBAAkB;AACtB,WAAOH,OAAMF,SAAM;AAAA,MACjB,QAAQ,CAAAM,WAAS,WAAWA,QAAO,OAAK,GAAG,aAAa,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,GAAG,MAAM,IAAI,CAAC;AAAA,MACzG,qBAAqB,CAAAA,WAAS,WAAWF,QAAOE,MAAK,GAAG,OAAK,IAAID,UAAS,CAAC,GAAG,eAAe,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,CAAC;AAAA,MACvJ,WAAW,CAAAC,WAAS;AAClB,YAAIH,QAAO,cAAc,iBAAiB;AACxC,qBAAW,CAAC,MAAS;AACrB,4BAAkBA,QAAO;AAAA,QAC3B;AACA,eAAO,WAAWC,QAAOE,MAAK,GAAG,OAAK,IAAI,WAAW,CAAC,GAAG,UAAU,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,CAAC;AAAA,MAC/H;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AAeD,WAAS,WAAWA,QAAO,SAAS,GAAG,MAAM,OAAOC,SAAQ;AAC1D,QAAID,SAAQ,KAAK,CAAC,UAAUA,MAAK,GAAG;AAClC,YAAM,IAAI,WAAW,6CAA6C;AAAA,IACpE;AACA,QAAIA,WAAU,EAAG,QAAO,QAAQ,CAAC;AACjC,QAAIA,WAAU,EAAG,QAAOC,QAAO,QAAQ,EAAE,GAAG,QAAQ,CAAC,CAAC;AACtD,QAAID,SAAQ,MAAM,EAAG,QAAO,QAAQ,CAAC;AAKrC,QAAI,MAAM,QAAQ,CAAC;AACnB,QAAI,EAAE,WAAW,GAAG;AAClB,QAAE,KAAK,CAACC,QAAO,KAAK,QAAQ,EAAE,CAAC,GAAGA,QAAO,KAAK,QAAQ,EAAE,CAAC,GAAGA,QAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC;AAAA,IACtF;AACA,QAAI,OAAOD,SAAQ;AACnB,QAAI,OAAO,QAAQ,CAAC;AACpB,QAAI,MAAM,QAAQ,CAAC;AACnB,WAAO,EAAE,UAAU,MAAM;AACvB,UAAIE,KAAI,EAAE;AACV,UAAI,MAAM,KAAK,OAAOA,KAAI,KAAK,CAAC;AAChC,UAAI,IAAI;AACR,eAAS,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;AAC5B,YAAI,KAAK,GAAG,MAAM,EAAE,CAAC,EAAE,CAAC,GAAG,EAAEA,KAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AAAA,MACzC;AACA,UAAI,MAAM,GAAG,GAAG;AAChB,UAAIA,KAAI,MAAM,EAAG,KAAI,KAAK,GAAG,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;AACxD,UAAID,QAAO,GAAG,QAAQ,EAAE,IAAIC,KAAI,EAAE,CAAC;AACnC,UAAI,YAAYD,QAAO,MAAM,EAAEC,KAAI,CAAC,EAAE,CAAC,GAAG,QAAQ,CAACA,MAAK,IAAIA,KAAI,EAAE,CAAC,GAAG,GAAG;AACzE,QAAE,KAAK,CAAC,GAAG,WAAW,MAAM,WAAW,CAAC,CAAC,CAAC;AAAA,IAC5C;AACA,WAAO,EAAE,IAAI,EAAE,CAAC;AAAA,EAClB;;;ACnGA,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO;AACpB,MAAI,qBAAoC,wBAAQD,SAAMC,iBAAc,UAAQ;AACjF,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAwBJ,WAAOA,OAAMF,SAAM;AAAA,MACjB,kBAAkB;AAAA,MAClB,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,YAAIG,aAAY,EAAE;AAClB,YAAI,QAAQC;AACZ,YAAI,UAAU,EAAE,MAAM,CAAC;AACvB,YAAI,MAAM,IAAID,WAAU,CAAC;AACzB,YAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,kBAAkB,CAAC,GAAG;AAClD,gBAAM,IAAI,UAAU,0DAA0D;AAAA,QAChF;AACA,YAAI,EAAE,GAAG,CAAC,GAAG;AACX,gBAAM,IAAI,UAAU,gDAAgD;AAAA,QACtE;AACA,iBAAS;AACT,YAAI,EAAE,GAAG,OAAO,GAAG;AACjB,eAAKC,KAAI,KAAKA,GAAE,IAAI,OAAO,GAAGA,KAAIA,GAAE,KAAK,GAAG,GAAG;AAC7C,qBAAS,OAAO,MAAM,EAAE,KAAKA,EAAC,CAAC,EAAE,UAAUA,EAAC;AAAA,UAC9C;AAAA,QACF,OAAO;AACL,eAAKA,KAAI,KAAKA,GAAE,IAAI,CAAC,GAAGA,KAAIA,GAAE,KAAK,GAAG,GAAG;AACvC,qBAAS,OAAO,MAAM,QAAQ,KAAKA,EAAC,CAAC,EAAE,UAAUA,EAAC;AAAA,UACpD;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAAA;AAAA,IAGF,CAAC;AAAA,EACH,CAAC;AAOD,WAAS,kBAAkB,GAAG;AAC5B,WAAO,EAAE,UAAU,KAAK,EAAE,IAAI,CAAC;AAAA,EACjC;;;ACjEA,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO;AACpB,MAAI,4BAA2C,wBAAQD,SAAMC,iBAAc,UAAQ;AACxF,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAwBJ,WAAOA,OAAMF,SAAM;AAAA,MACjB,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,YAAI,CAAC,UAAU,CAAC,KAAK,IAAI,GAAG;AAC1B,gBAAM,IAAI,UAAU,iEAAiE;AAAA,QACvF;AACA,YAAI,CAAC,UAAU,CAAC,KAAK,IAAI,GAAG;AAC1B,gBAAM,IAAI,UAAU,iEAAiE;AAAA,QACvF;AACA,YAAI,IAAI,GAAG;AACT,gBAAM,IAAI,UAAU,2CAA2C;AAAA,QACjE;AACA,YAAI,IAAI,IAAI,GAAG;AACb,cAAI,aAAaG,SAAQ,GAAG,IAAI,IAAI,CAAC;AACrC,iBAAO,aAAaA,SAAQ,GAAG,CAAC;AAAA,QAClC;AACA,YAAI,YAAYA,SAAQ,IAAI,GAAG,IAAI,IAAI,CAAC;AACxC,eAAO,YAAYA,SAAQ,GAAG,IAAI,CAAC;AAAA,MACrC;AAAA,MACA,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,YAAIC,aAAY,EAAE;AAClB,YAAI,QAAQC;AACZ,YAAI,MAAM,IAAID,WAAU,CAAC;AACzB,YAAI,YAAY,EAAE,MAAM,GAAG;AAC3B,YAAI,CAACE,mBAAkB,CAAC,KAAK,CAACA,mBAAkB,CAAC,GAAG;AAClD,gBAAM,IAAI,UAAU,iEAAiE;AAAA,QACvF;AACA,YAAI,EAAE,GAAG,GAAG,GAAG;AACb,gBAAM,IAAI,UAAU,2EAA2E;AAAA,QACjG;AACA,iBAAS;AACT,YAAI,EAAE,GAAG,SAAS,GAAG;AACnB,eAAKD,KAAI,KAAKA,GAAE,IAAI,SAAS,GAAGA,KAAIA,GAAE,KAAK,GAAG,GAAG;AAC/C,qBAAS,OAAO,MAAM,EAAE,KAAKA,EAAC,CAAC,EAAE,UAAUA,EAAC;AAAA,UAC9C;AAAA,QACF,OAAO;AACL,eAAKA,KAAI,KAAKA,GAAE,IAAI,CAAC,GAAGA,KAAIA,GAAE,KAAK,GAAG,GAAG;AACvC,qBAAS,OAAO,MAAM,UAAU,KAAKA,EAAC,CAAC,EAAE,UAAUA,EAAC;AAAA,UACtD;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AAOD,WAASC,mBAAkB,GAAG;AAC5B,WAAO,EAAE,UAAU,KAAK,EAAE,IAAI,CAAC;AAAA,EACjC;;;ACjFA,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,kBAAkB,OAAO,aAAa,SAAS;AAC/E,MAAI,cAA6B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,KAAAC;AAAA,MACA,WAAW;AAAA,MACX,SAAAC;AAAA,IACF,IAAI;AA0BJ,aAAS,aAAa,GAAG;AACvB,UAAI,EAAE,OAAO,GAAG;AACd,eAAO,YAAY,EAAE,EAAE;AAAA,MACzB;AAIA,UAAI,EAAE,KAAK,KAAK;AAMd,YAAI,KAAK,IAAIA,SAAQ,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE;AACpC,YAAI,IAAI,IAAIA,SAAQ,KAAK,KAAK,EAAE,IAAI,KAAK,KAAK,EAAE,EAAE;AAClD,eAAO,IAAIA,SAAQ,KAAK,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI,aAAa,EAAE,CAAC;AAAA,MAC/D;AAIA,UAAI,IAAIA,SAAQ,EAAE,KAAK,GAAG,EAAE,EAAE;AAG9B,UAAI,IAAI,IAAIA,SAAQ,OAAO,CAAC,GAAG,CAAC;AAEhC,eAASC,KAAI,GAAGA,KAAI,OAAO,QAAQ,EAAEA,IAAG;AAEtC,YAAI,YAAY,IAAID,SAAQ,OAAOC,EAAC,GAAG,CAAC;AACxC,YAAI,EAAE,IAAI,UAAU,IAAI,EAAE,IAAIA,EAAC,CAAC,CAAC;AAAA,MACnC;AAEA,UAAI,IAAI,IAAID,SAAQ,EAAE,KAAK,SAAS,KAAK,EAAE,EAAE;AAG7C,UAAI,YAAY,KAAK,KAAK,IAAI,KAAK,EAAE;AACrC,UAAI,OAAO,EAAE,IAAI,EAAE,IAAI,GAAG,CAAC;AAC3B,UAAI,OAAO,EAAE,IAAI,EAAE,IAAI;AAGvB,aAAO,EAAE,IAAI,SAAS,EAAE,IAAI,IAAI,EAAE,IAAI,IAAI;AAAA,IAC5C;AACA,WAAOJ,OAAMF,SAAM;AAAA,MACjB,QAAQ;AAAA,MACR,SAAS;AAAA,MACT,WAAW,SAASQ,WAAU,GAAG;AAC/B,YAAI,EAAE,UAAU,GAAG;AACjB,iBAAO,EAAE,WAAW,KAAK,EAAE,OAAO,IAAI,IAAI,WAAW,QAAQ,IAAI,aAAa,EAAE,MAAM,CAAC,CAAC;AAAA,QAC1F;AACA,YAAI,CAAC,EAAE,SAAS,GAAG;AACjB,iBAAO,IAAI,WAAW,EAAE,WAAW,IAAI,MAAM,QAAQ;AAAA,QACvD;AACA,cAAM,IAAI,MAAM,4BAA4B;AAAA,MAC9C;AAAA,IACF,CAAC;AAOD,aAAS,aAAa,GAAG;AACvB,UAAI,IAAI,GAAG;AACT,eAAO,IAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC,CAAC;AAAA,MAC3D;AACA,UAAI,YAAYL,QAAO,aAAa,KAAK,IAAI,EAAE,SAAS,CAAC,IAAI;AAC7D,UAAI,MAAM,WAAW,MAAM;AAAA,QACzB;AAAA,MACF,CAAC;AACD,UAAI,IAAI,MAAM,GAAG;AACf,eAAO,EAAE,MAAM,aAAa,IAAI,WAAW,IAAI,CAAC,CAAC,CAAC;AAAA,MACpD;AACA,UAAI,IAAI;AACR,UAAIM,QAAO,IAAI,IAAI,CAAC;AACpB,UAAIC,OAAM,EAAE,SAAS;AACrB,aAAO,IAAI,GAAG;AACZ,aAAK;AACL,QAAAA,QAAO;AACP,QAAAD,QAAOA,MAAK,MAAMC,IAAG;AAAA,MACvB;AACA,aAAO,IAAI,WAAWD,MAAK,YAAY,WAAW,SAAS,CAAC;AAAA,IAC9D;AAAA,EACF,CAAC;;;AC7GD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,WAAW,OAAO;AAC/B,MAAI,eAA8B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,SAAAC;AAAA,MACA,OAAAC;AAAA,IACF,IAAI;AAMJ,QAAI,WAAW;AACf,QAAI,WAAW;AAYf,QAAI,SAAS,CAAC,uBAA0B,qBAA0B,wBAA2B,sBAA0B,uBAA0B,sBAA0B,uBAA2B,mBAAwB;AAwB9N,WAAOA,OAAMH,SAAM;AAAA,MACjB,QAAQ;AAAA,MACR,SAAS;AAAA,MACT,WAAW,SAASI,aAAY;AAC9B,cAAM,IAAI,MAAM,oFAAoF;AAAA,MACtG;AAAA,IACF,CAAC;AACD,aAAS,cAAc,GAAG;AACxB,UAAI,QAAQ;AACZ,UAAI,QAAQ;AAEZ,UAAI,aAAa;AACjB,UAAI,EAAE,MAAM,GAAG;AACb,eAAO,IAAIF,SAAQ,KAAK,GAAG;AAAA,MAC7B,WAAW,EAAE,OAAO,GAAG;AACrB,eAAO,IAAIA,SAAQ,aAAa,EAAE,EAAE,GAAG,CAAC;AAAA,MAC1C,WAAW,EAAE,MAAM,YAAY,KAAK,IAAI,EAAE,EAAE,KAAK,UAAU;AACzD,eAAO,eAAe,CAAC;AAAA,MACzB,WAAW,EAAE,MAAM,YAAY;AAE7B,YAAI,MAAM,SAAS,OAAO,EAAE,EAAE,IAAI,KAAK,MAAM,MAAM,EAAE,KAAK,IAAI;AAC9D,YAAI,IAAI,EAAE,IAAI,KAAK,EAAE,EAAE,IAAI,EAAE,IAAI;AACjC,YAAI,IAAI,cAAc,IAAIA,SAAQ,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC;AAClD,eAAO,IAAIA,SAAQ,OAAO,GAAG,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC;AAAA,MAC7C,WAAW,EAAE,MAAM,GAAG;AACpB,eAAO,iBAAiB,CAAC;AAAA,MAC3B,OAAO;AACL,eAAO,iBAAiB,EAAE,UAAU,CAAC,EAAE,UAAU;AAAA,MACnD;AAAA,IACF;AACA,aAAS,eAAe,GAAG;AASzB,UAAI,WAAW,EAAE,IAAI,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,IAAI,SAAS;AAI3D,UAAI,KAAK,IAAIA,SAAQ,GAAG,CAAC,EAAE,IAAI,CAAC;AAChC,UAAI,MAAM,GAAG,IAAI,CAAC;AAClB,UAAI,IAAI,OAAO,CAAC;AAChB,UAAI,IAAI,OAAO,CAAC;AAChB,UAAI,IAAI,IAAI,IAAI;AAChB,UAAI,IAAI,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI;AACvC,eAASG,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,YAAI,MAAM;AACV,YAAI,CAAC,IAAI,IAAI,OAAOA,EAAC;AACrB,YAAI,IAAI,IAAI;AAAA,MACd;AACA,UAAI,YAAY,GAAG,IAAI,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;AAIxC,aAAO,SAAS,IAAI,SAAS;AAAA,IAC/B;AACA,aAAS,iBAAiB,GAAG;AAI3B,UAAI,YAAY;AAChB,UAAI,KAAK;AACT,UAAI,YAAY;AAChB,UAAI,EAAE,IAAI,CAAC;AACX,aAAO,EAAE,MAAM,UAAU;AACvB,oBAAY,UAAU,IAAI,CAAC;AAC3B,YAAI,MAAM,UAAU,KAAK,IAAI,IAAI;AACjC,YAAI,QAAQ,KAAK,OAAO,EAAG;AAC3B,aAAK;AACL,YAAI,EAAE,IAAI,CAAC;AAAA,MACb;AACA,aAAO,eAAe,CAAC,EAAE,IAAI,UAAU,IAAI,CAAC,EAAE,IAAI,IAAIH,SAAQ,GAAG,YAAY,IAAI,KAAK,KAAK,CAAC,CAAC;AAAA,IAC/F;AAAA,EACF,CAAC;;;ACtID,MAAII,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO;AAC7B,MAAI,kBAAiC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,OAAAC;AAAA,IACF,IAAI;AAuBJ,WAAOD,OAAMF,SAAM;AAAA,MACjB,QAAQ,SAASI,QAAO,GAAG;AACzB,YAAI,IAAI,GAAG;AACT,gBAAM,IAAI,MAAM,4BAA4B;AAAA,QAC9C;AACA,eAAOD,OAAM,IAAI,CAAC;AAAA,MACpB;AAAA,MACA,WAAW,SAASE,WAAU,GAAG;AAC/B,YAAI,EAAE,WAAW,GAAG;AAClB,gBAAM,IAAI,MAAM,4BAA4B;AAAA,QAC9C;AACA,eAAOF,OAAM,EAAE,KAAK,CAAC,CAAC;AAAA,MACxB;AAAA,MACA,kBAAkBD,OAAM,YAAY,CAAAI,UAAQ,OAAKC,SAAQ,GAAGD,KAAI,CAAC;AAAA,IACnE,CAAC;AAAA,EACH,CAAC;;;AC7CD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,UAAU,OAAO,YAAY,OAAO,aAAa,OAAO,WAAW;AACnG,MAAI,qBAAoC,wBAAQD,SAAMC,iBAAc,UAAQ;AACjF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,QAAAC;AAAA,MACA,KAAAC;AAAA,MACA,UAAAC;AAAA,MACA,KAAAC;AAAA,MACA,WAAAC;AAAA,MACA,KAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AAiBJ,WAAOR,OAAMF,SAAM;AAAA,MACjB,gBAAgB,SAAS,YAAY,GAAG,GAAG;AACzC,eAAO,OAAOG,QAAO,CAAC,GAAGA,QAAO,CAAC,CAAC;AAAA,MACpC;AAAA,MACA,iBAAiB,SAAS,aAAa,GAAG,GAAG;AAC3C,eAAO,OAAO,GAAGA,QAAO,CAAC,CAAC;AAAA,MAC5B;AAAA,MACA,iBAAiB,SAAS,aAAa,GAAG,GAAG;AAC3C,eAAO,OAAOA,QAAO,CAAC,GAAG,CAAC;AAAA,MAC5B;AAAA,MACA,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,eAAO,OAAO,GAAG,CAAC;AAAA,MACpB;AAAA,IACF,CAAC;AACD,aAAS,OAAO,GAAG,GAAG;AACpB,UAAI,UAAU,EAAE,KAAK,EAAE;AACvB,UAAI,UAAU,EAAE,KAAK,EAAE;AACvB,UAAI,UAAU,GAAG;AACf,cAAM,IAAI,MAAM,sCAAsC;AAAA,MACxD;AACA,UAAI,UAAU,GAAG;AACf,cAAM,IAAI,MAAM,uCAAuC;AAAA,MACzD;AACA,UAAI,YAAY,SAAS;AACvB,cAAM,IAAI,MAAM,qCAAqC;AAAA,MACvD;AAGA,UAAI,OAAOE,KAAI,CAAC;AAChB,UAAI,SAAS,GAAG;AACd,cAAM,IAAI,MAAM,kDAAkD;AAAA,MACpE;AACA,UAAI,OAAOA,KAAI,CAAC;AAChB,UAAI,SAAS,GAAG;AACd,cAAM,IAAI,MAAM,mDAAmD;AAAA,MACrE;AACA,UAAI,QAAQD,QAAO,GAAGC,KAAI,CAAC,CAAC;AAC5B,UAAI,QAAQD,QAAO,GAAGC,KAAI,CAAC,CAAC;AAC5B,UAAI,SAASA,KAAIC,UAAS,OAAOC,KAAIC,WAAU,OAAO,KAAK,GAAG,OAAKC,KAAI,CAAC,CAAC,CAAC,CAAC;AAC3E,UAAIC,WAAU,MAAM,GAAG;AACrB,eAAO;AAAA,MACT,OAAO;AACL,eAAO,OAAO;AAAA,MAChB;AAAA,IACF;AAAA,EACF,CAAC;;;AC1ED,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO,UAAU,YAAY,aAAa,aAAa,YAAY;AACzF,MAAI,oBAAmC,wBAAQD,SAAMC,iBAAc,UAAQ;AAChF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,QAAAC;AAAA,MACA,UAAAC;AAAA,MACA,WAAAC;AAAA,MACA,WAAAC;AAAA,MACA,YAAAC;AAAA,IACF,IAAI;AAsBJ,WAAON,OAAMF,SAAM;AAAA,MACjB,kBAAkB,SAAS,cAAc,GAAG;AAC1C,YAAIS,OAAM;AACV,YAAI,QAAQ;AACZ,QAAAC,aAAY,GAAG,SAAU,IAAI;AAC3B,cAAI,CAACH,WAAU,EAAE,KAAK,CAACC,YAAW,EAAE,GAAG;AACrC,kBAAM,IAAI,UAAU,yDAAyD;AAAA,UAC/E;AACA,UAAAC,OAAMN,KAAIM,MAAK,EAAE;AACjB,kBAAQJ,UAAS,OAAOC,WAAU,EAAE,CAAC;AAAA,QACvC,CAAC;AACD,eAAOF,QAAOE,WAAUG,IAAG,GAAG,KAAK;AAAA,MACrC;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC9CD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,WAAW;AACjC,MAAI,qBAAoC,wBAAQD,SAAMC,iBAAc,UAAQ;AACjF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AA0BJ,WAAOD,OAAMF,SAAM;AAAA,MACjB,sBAAsBG;AAAA,MACtB,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAC7C,YAAI,CAAC,UAAU,CAAC,KAAK,IAAI,GAAG;AAC1B,gBAAM,IAAI,UAAU,0DAA0D;AAAA,QAChF;AACA,YAAI,CAAC,UAAU,CAAC,KAAK,IAAI,GAAG;AAC1B,gBAAM,IAAI,UAAU,0DAA0D;AAAA,QAChF;AACA,YAAI,IAAI,GAAG;AACT,gBAAM,IAAI,UAAU,kEAAkE;AAAA,QACxF;AAEA,eAAOC,SAAQ,IAAI,IAAI,GAAG,CAAC;AAAA,MAC7B;AAAA,MACA,wBAAwB,SAAS,oBAAoB,GAAG,GAAG;AACzD,YAAI,QAAQC;AACZ,YAAI,CAACC,mBAAkB,CAAC,KAAK,CAACA,mBAAkB,CAAC,GAAG;AAClD,gBAAM,IAAI,UAAU,0DAA0D;AAAA,QAChF;AACA,YAAI,EAAE,GAAG,CAAC,GAAG;AACX,gBAAM,IAAI,UAAU,kEAAkE;AAAA,QACxF;AACA,YAAI,MAAM,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC;AACxB,iBAAS;AACT,aAAKD,KAAI,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC,GAAGA,GAAE,IAAI,CAAC,GAAGA,KAAIA,GAAE,KAAK,CAAC,GAAG;AACpD,mBAAS,OAAO,MAAMA,EAAC;AAAA,QACzB;AACA,eAAO;AAAA,MACT;AAAA;AAAA,IAGF,CAAC;AAAA,EACH,CAAC;AAOD,WAASC,mBAAkB,GAAG;AAC5B,WAAO,EAAE,UAAU,KAAK,EAAE,IAAI,CAAC;AAAA,EACjC;;;AC7EA,0BAAuB;AACvB,MAAI,kBAAiC,sCAAAC,SAAW,KAAK,IAAI,CAAC;AACnD,WAAS,UAAU,YAAY;AACpC,QAAIC;AAGJ,aAAS,QAAQ,MAAM;AACrB,MAAAA,UAAS,SAAS,OAAO,sBAAkB,kBAAAD,SAAW,OAAO,IAAI,CAAC;AAAA,IACpE;AAGA,YAAQ,UAAU;AAGlB,aAAS,MAAM;AACb,aAAOC,QAAO;AAAA,IAChB;AACA,WAAO;AAAA,EACT;;;ACdA,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,KAAK;AACrC,MAAI,mBAAkC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC/E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,IAAAC;AAAA,IACF,IAAI;AAEJ,QAAI,MAAM,UAAUD,QAAO,UAAU;AACrC,QAAIC,KAAI;AACN,MAAAA,IAAG,UAAU,SAAU,MAAM,MAAM;AACjC,YAAI,KAAK,eAAe,KAAK,YAAY;AACvC,gBAAM,UAAU,KAAK,UAAU;AAAA,QACjC;AAAA,MACF,CAAC;AAAA,IACH;AAqCA,WAAOF,OAAMF,SAAM;AAAA,MACjB,kBAAkB,SAAS,cAAc,WAAW;AAClD,eAAO,YAAY,WAAW,CAAC,CAAC;AAAA,MAClC;AAAA,MACA,0BAA0B,SAAS,qBAAqB,WAAW,SAAS;AAC1E,eAAO,YAAY,WAAW,OAAO;AAAA,MACvC;AAAA,MACA,0BAA0B,SAAS,qBAAqB,WAAWK,SAAQ;AACzE,eAAO,YAAY,WAAW;AAAA,UAC5B,QAAAA;AAAA,QACF,CAAC;AAAA,MACH;AAAA,MACA,kCAAkC,SAAS,4BAA4B,WAAW,SAAS;AACzF,eAAO,YAAY,WAAW;AAAA,UAC5B;AAAA,QACF,CAAC;AAAA,MACH;AAAA,MACA,0CAA0C,SAAS,mCAAmC,WAAW,SAASA,SAAQ;AAChH,eAAO,YAAY,WAAW;AAAA,UAC5B,QAAAA;AAAA,UACA;AAAA,QACF,CAAC;AAAA,MACH;AAAA,MACA,0CAA0C,SAAS,mCAAmC,WAAWA,SAAQ,SAAS;AAChH,eAAO,YAAY,WAAW;AAAA,UAC5B,QAAAA;AAAA,UACA;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF,CAAC;AAYD,aAAS,YAAY,WAAW,OAAO;AACrC,UAAI;AAAA,QACF,QAAAA;AAAA,QACA;AAAA,QACA,cAAc;AAAA,MAChB,IAAI;AACJ,UAAI,SAAS,OAAOA,YAAW;AAC/B,UAAI,QAAQ;AACV,QAAAA,UAAS;AAAA,MACX;AACA,UAAIC,gBAAe,SAAS,SAAS,IAAI,UAAU,SAAS,SAAS,OAAO,IAAI,QAAQ,SAAS;AACjG,kBAAY,UAAU,QAAQ;AAC9B,UAAI,SAAS;AACX,kBAAU,QAAQ,QAAQ;AAAA,MAC5B;AACA,UAAI,gBAAgB,MAAM;AACxB,oBAAY,QAAQ,SAAS;AAC7B,kBAAU,QAAQ,OAAO;AAAA,MAC3B;AACA,UAAI,eAAe;AACnB,UAAI,OAAO,YAAY,aAAa;AAClC,YAAI,QAAQ,WAAW,UAAU,QAAQ;AACvC,gBAAM,IAAI,MAAM,gDAAgD;AAAA,QAClE;AACA,iBAASC,KAAI,GAAG,MAAM,QAAQ,QAAQA,KAAI,KAAKA,MAAK;AAClD,cAAI,CAAC,SAAS,QAAQA,EAAC,CAAC,KAAK,QAAQA,EAAC,IAAI,GAAG;AAC3C,kBAAM,IAAI,MAAM,8CAA8C;AAAA,UAChE;AACA,0BAAgB,QAAQA,EAAC;AAAA,QAC3B;AAAA,MACF;AACA,UAAI,SAAS,UAAU;AACvB,UAAI,SAAS,CAAC;AACd,UAAI;AACJ,aAAO,OAAO,SAASF,SAAQ;AAC7B,YAAI,OAAO,YAAY,aAAa;AAClC,iBAAO,UAAU,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC;AAAA,QAC7C,OAAO;AACL,cAAI,UAAU,IAAI,IAAI;AACtB,mBAAS,KAAK,GAAG,OAAO,UAAU,QAAQ,KAAK,MAAM,MAAM;AACzD,uBAAW,QAAQ,EAAE;AACrB,gBAAI,UAAU,GAAG;AACf,qBAAO,UAAU,EAAE;AACnB;AAAA,YACF;AAAA,UACF;AAAA,QACF;AACA,eAAO,KAAK,IAAI;AAAA,MAClB;AACA,aAAO,SAAS,OAAO,CAAC,IAAIC,gBAAeA,cAAa,MAAM,IAAI;AAAA,IACpE;AAAA,EACF,CAAC;;;AC/IM,WAAS,aAAaE,OAAMC,SAAQ;AACzC,QAAI,OAAO,CAAC;AACZ,IAAAD,QAAOA,MAAK,MAAM,CAAC;AACnB,QAAIA,MAAK,SAAS,GAAG;AACnB,eAASE,KAAI,GAAG,SAASF,MAAK,MAAM,GAAGE,KAAI,QAAQA,MAAK;AACtD,aAAK,KAAK,aAAaF,OAAMC,OAAM,CAAC;AAAA,MACtC;AAAA,IACF,OAAO;AACL,eAAS,KAAK,GAAG,UAAUD,MAAK,MAAM,GAAG,KAAK,SAAS,MAAM;AAC3D,aAAK,KAAKC,QAAO,CAAC;AAAA,MACpB;AAAA,IACF;AACA,WAAO;AAAA,EACT;;;ACfA,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,KAAK;AACrC,MAAI,eAA8B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,IAAAC;AAAA,IACF,IAAI;AAEJ,QAAI,MAAM,UAAUD,QAAO,UAAU;AACrC,QAAIC,KAAI;AACN,MAAAA,IAAG,UAAU,SAAU,MAAM,MAAM;AACjC,YAAI,KAAK,eAAe,KAAK,YAAY;AACvC,gBAAM,UAAU,KAAK,UAAU;AAAA,QACjC;AAAA,MACF,CAAC;AAAA,IACH;AAgCA,WAAOF,OAAMF,SAAM;AAAA,MACjB,IAAI,MAAM,QAAQ,GAAG,CAAC;AAAA,MACtB,QAAQ,CAAAK,SAAO,QAAQ,GAAGA,IAAG;AAAA,MAC7B,kBAAkB,CAACC,MAAKD,SAAQ,QAAQC,MAAKD,IAAG;AAAA,MAChD,kBAAkB,CAAAE,UAAQ,cAAcA,OAAM,GAAG,CAAC;AAAA,MAClD,0BAA0B,CAACA,OAAMF,SAAQ,cAAcE,OAAM,GAAGF,IAAG;AAAA,MACnE,kCAAkC,CAACE,OAAMD,MAAKD,SAAQ,cAAcE,OAAMD,MAAKD,IAAG;AAAA,IACpF,CAAC;AACD,aAAS,cAAcE,OAAMD,MAAKD,MAAK;AACrC,UAAI,MAAM,aAAaE,MAAK,QAAQ,GAAG,MAAM,QAAQD,MAAKD,IAAG,CAAC;AAC9D,aAAO,SAASE,KAAI,IAAIA,MAAK,OAAO,KAAK,QAAQ,IAAI;AAAA,IACvD;AACA,aAAS,QAAQD,MAAKD,MAAK;AACzB,aAAOC,OAAM,IAAI,KAAKD,OAAMC;AAAA,IAC9B;AAAA,EACF,CAAC;;;AC/DD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,QAAQ,KAAK;AAC7C,MAAI,kBAAiC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,MAAAC;AAAA,MACA,IAAAC;AAAA,IACF,IAAI;AAEJ,QAAI,MAAM,UAAUF,QAAO,UAAU;AACrC,QAAIE,KAAI;AACN,MAAAA,IAAG,UAAU,SAAU,MAAM,MAAM;AACjC,YAAI,KAAK,eAAe,KAAK,YAAY;AACvC,gBAAM,UAAU,KAAK,UAAU;AAAA,QACjC;AAAA,MACF,CAAC;AAAA,IACH;AA+BA,WAAOH,OAAMF,SAAM;AAAA,MACjB,IAAI,MAAM,WAAW,GAAG,CAAC;AAAA,MACzB,QAAQ,CAAAM,SAAO,WAAW,GAAGA,IAAG;AAAA,MAChC,kBAAkB,CAACC,MAAKD,SAAQ,WAAWC,MAAKD,IAAG;AAAA,MACnD,QAAQ,CAAAA,SAAO,cAAc,IAAIA,IAAG;AAAA,MACpC,kBAAkB;AAAA,MAClB,kBAAkB,CAAAE,UAAQ,iBAAiBA,OAAM,GAAG,CAAC;AAAA,MACrD,0BAA0B,CAACA,OAAMF,SAAQ,iBAAiBE,OAAM,GAAGF,IAAG;AAAA,MACtE,kCAAkC,CAACE,OAAMD,MAAKD,SAAQ,iBAAiBE,OAAMD,MAAKD,IAAG;AAAA,IACvF,CAAC;AACD,aAAS,iBAAiBE,OAAMD,MAAKD,MAAK;AACxC,UAAI,MAAM,aAAaE,MAAK,QAAQ,GAAG,MAAM,WAAWD,MAAKD,IAAG,CAAC;AACjE,aAAO,SAASE,KAAI,IAAIA,MAAK,OAAO,KAAK,QAAQ,IAAI;AAAA,IACvD;AACA,aAAS,WAAWD,MAAKD,MAAK;AAC5B,aAAO,KAAK,MAAMC,OAAM,IAAI,KAAKD,OAAMC,KAAI;AAAA,IAC7C;AACA,aAAS,cAAcA,MAAKD,MAAK;AAC/B,UAAI,eAAe,MAAM;AACzB,UAAI,QAAQA,OAAMC;AAClB,UAAI,SAAS,cAAc;AAEzB,eAAOA,OAAM,OAAO,WAAW,GAAG,OAAO,KAAK,CAAC,CAAC;AAAA,MAClD;AAIA,UAAI,OAAOH,MAAK,KAAK;AACrB,UAAI,SAAS;AACb,aAAO,UAAU,OAAO;AACtB,iBAAS;AACT,iBAASK,KAAI,GAAGA,KAAI,MAAM,EAAEA,IAAG;AAC7B,mBAAS,KAAK,UAAU,IAAI,IAAI,MAAM,KAAK;AAAA,QAC7C;AAAA,MACF;AACA,aAAOF,OAAM;AAAA,IACf;AAAA,EACF,CAAC;;;ACvFD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,aAAa,kBAAkB,kBAAkB,gBAAgB,OAAO,aAAa,gBAAgB,cAAc,aAAa,UAAU,cAAc,QAAQ;AACtL,MAAI,mBAAkC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC/E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,cAAAC;AAAA,MACA,KAAAC;AAAA,MACA,WAAAC;AAAA,MACA,cAAAC;AAAA,MACA,YAAAC;AAAA,MACA,WAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAI,aAAa,CAAC;AAClB,QAAI,WAAW,CAAC;AA6BhB,WAAOZ,OAAMF,SAAM;AAAA,MACjB,0CAA0C,SAAS,oCAAoC,GAAG,GAAG;AAC3F,YAAI,CAACW,WAAU,CAAC,KAAKD,YAAW,CAAC,KAAK,CAACC,WAAU,CAAC,KAAKD,YAAW,CAAC,GAAG;AACpE,gBAAM,IAAI,UAAU,4DAA4D;AAAA,QAClF,WAAWI,QAAO,GAAG,CAAC,GAAG;AACvB,gBAAM,IAAI,UAAU,0DAA0D;AAAA,QAChF;AACA,YAAI,MAAM,EAAE,SAAS,CAAC,KAAK,SAAS,CAAC;AACrC,YAAIC,SAAQ,MAAM,WAAW;AAC7B,YAAI,OAAO,MAAMF,aAAYD;AAC7B,YAAI,KAAKA,QAAO,CAAC;AACjB,YAAI,KAAKA,QAAO,CAAC;AAEjB,YAAIG,OAAM,EAAE,KAAKA,OAAM,EAAE,EAAE,SAAS,IAAI;AACtC,iBAAOA,OAAM,EAAE,EAAE,EAAE;AAAA,QACrB;AAEA,iBAAS,IAAI,GAAG,KAAK,IAAI,EAAE,GAAG;AAC5B,cAAI,CAACA,OAAM,CAAC,GAAG;AACb,YAAAA,OAAM,CAAC,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC;AAAA,UACzC;AACA,cAAI,MAAM,EAAG;AACb,cAAIC,OAAMD,OAAM,CAAC;AACjB,cAAI,OAAOA,OAAM,IAAI,CAAC;AACtB,mBAASE,KAAID,KAAI,QAAQC,MAAK,KAAKA,MAAK,IAAI,EAAEA,IAAG;AAC/C,gBAAIA,OAAM,GAAG;AACX,cAAAD,KAAIC,EAAC,IAAI;AAAA,YACX,OAAO;AACL,cAAAD,KAAIC,EAAC,IAAId,WAAUE,gBAAe,KAAKY,EAAC,GAAG,KAAKA,EAAC,CAAC,GAAG,KAAKA,KAAI,CAAC,CAAC;AAAA,YAClE;AAAA,UACF;AAAA,QACF;AACA,eAAOF,OAAM,EAAE,EAAE,EAAE;AAAA,MACrB;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACpFD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,aAAa,cAAc,aAAa,YAAY;AAC1E,MAAI,oBAAmC,wBAAQD,SAAMC,iBAAc,UAAQ;AAChF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAAC;AAAA,MACA,YAAAC;AAAA,MACA,WAAAC;AAAA,MACA,YAAAC;AAAA,IACF,IAAI;AAsBJ,WAAOJ,OAAMF,SAAM;AAAA,MACjB,sBAAsB,SAAS,kBAAkB,GAAG;AAClD,YAAI,CAACK,WAAU,CAAC,KAAKD,YAAW,CAAC,GAAG;AAClC,gBAAM,IAAI,UAAU,6DAA6D;AAAA,QACnF;AAGA,YAAI,SAAS;AACb,iBAASG,KAAI,GAAGA,MAAK,GAAGA,MAAK;AAC3B,mBAASJ,WAAU,QAAQG,YAAW,GAAGC,EAAC,CAAC;AAAA,QAC7C;AACA,eAAO;AAAA,MACT;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC7CD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,aAAa,gBAAgB,kBAAkB,gBAAgB,cAAc,WAAW;AAC9G,MAAI,gBAA+B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC5E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAAC;AAAA,MACA,cAAAC;AAAA,MACA,gBAAAC;AAAA,MACA,cAAAC;AAAA,MACA,YAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AAsBJ,WAAON,OAAMF,SAAM;AAAA,MACjB,sBAAsB,SAAS,kBAAkB,GAAG;AAClD,YAAI,CAACQ,WAAU,CAAC,KAAKD,YAAW,CAAC,GAAG;AAClC,gBAAM,IAAI,UAAU,yDAAyD;AAAA,QAC/E;AACA,eAAOH,cAAaE,cAAaD,gBAAe,GAAG,CAAC,GAAG,CAAC,GAAGF,WAAU,GAAG,CAAC,CAAC;AAAA,MAC5E;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACzCD,MAAIM,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,aAAa,gBAAgB,cAAc,cAAc,aAAa,QAAQ;AACpG,MAAI,oBAAmC,wBAAQD,SAAMC,iBAAc,UAAQ;AAChF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAAC;AAAA,MACA,cAAAC;AAAA,MACA,YAAAC;AAAA,MACA,YAAAC;AAAA,MACA,WAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AAuBJ,WAAON,OAAMF,SAAM;AAAA,MACjB,0CAA0C,SAAS,oCAAoC,GAAG,GAAG;AAC3F,YAAI,CAACO,WAAU,CAAC,KAAK,CAACF,YAAW,CAAC,KAAK,CAACE,WAAU,CAAC,KAAK,CAACF,YAAW,CAAC,GAAG;AACtE,gBAAM,IAAI,UAAU,yDAAyD;AAAA,QAC/E,WAAWG,QAAO,GAAG,CAAC,GAAG;AACvB,gBAAM,IAAI,UAAU,2DAA2D;AAAA,QACjF;AACA,eAAOJ,cAAaD,WAAU,GAAG,EAAE,GAAGA,WAAU,GAAG,EAAE,CAAC;AAAA,MACxD;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;AC5CD,MAAIM,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO;AAC7B,MAAI,kBAAiC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC9E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,OAAAC;AAAA,IACF,IAAI;AAGJ,aAAS,YAAY,MAAM;AACzB,UAAIC,SAAQ;AACZ,WAAK,QAAQ,OAAK;AAChB,QAAAA,UAAS,YAAY,CAAC;AAAA,MACxB,CAAC;AACD,aAAOA,UAAS;AAAA,IAClB;AAgCA,WAAOD,OAAMH,SAAM;AAAA,MACjB,MAAM,SAASK,MAAK,MAAM;AACxB,eAAO,YAAY,IAAI;AAAA,MACzB;AAAA,IACF,CAAC;AAAA,EACH,CAAC;;;ACnDM,WAAS,cAAc,GAAG;AAC/B,WAAO,eAAe,CAAC,KAAK,eAAe,CAAC,KAAK,EAAE,QAAQ,KAAK,eAAe,EAAE,KAAK,CAAC,CAAC;AAAA,EAC1F;AACO,WAAS,qBAAqB,GAAG;AACtC,QAAI,eAAe,CAAC,GAAG;AAErB,aAAO;AAAA,IACT;AACA,SAAK,eAAe,CAAC,KAAK,eAAe,CAAC,MAAM,EAAE,KAAK,MAAM,oBAAoB,GAAG;AAElF,aAAO;AAAA,IACT;AACA,QAAI,kBAAkB,CAAC,KAAK,qBAAqB,EAAE,OAAO,GAAG;AAE3D,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;;;AClBA,WAASC,SAAQC,IAAG,GAAG;AAAE,QAAI,IAAI,OAAO,KAAKA,EAAC;AAAG,QAAI,OAAO,uBAAuB;AAAE,UAAI,IAAI,OAAO,sBAAsBA,EAAC;AAAG,YAAM,IAAI,EAAE,OAAO,SAAUC,IAAG;AAAE,eAAO,OAAO,yBAAyBD,IAAGC,EAAC,EAAE;AAAA,MAAY,CAAC,IAAI,EAAE,KAAK,MAAM,GAAG,CAAC;AAAA,IAAG;AAAE,WAAO;AAAA,EAAG;AAC9P,WAASC,eAAcF,IAAG;AAAE,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AAAE,UAAI,IAAI,QAAQ,UAAU,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC;AAAG,UAAI,IAAID,SAAQ,OAAO,CAAC,GAAG,IAAE,EAAE,QAAQ,SAAUE,IAAG;AAAE,QAAAE,iBAAgBH,IAAGC,IAAG,EAAEA,EAAC,CAAC;AAAA,MAAG,CAAC,IAAI,OAAO,4BAA4B,OAAO,iBAAiBD,IAAG,OAAO,0BAA0B,CAAC,CAAC,IAAID,SAAQ,OAAO,CAAC,CAAC,EAAE,QAAQ,SAAUE,IAAG;AAAE,eAAO,eAAeD,IAAGC,IAAG,OAAO,yBAAyB,GAAGA,EAAC,CAAC;AAAA,MAAG,CAAC;AAAA,IAAG;AAAE,WAAOD;AAAA,EAAG;AAItb,MAAII,UAAO;AACX,MAAIC,kBAAe,CAAC,gBAAgB,gBAAgB,YAAY;AACzD,MAAI,aAA4B,wBAAQD,SAAMC,iBAAc,UAAQ;AACzE,QAAI;AAAA,MACF,cAAAC;AAAA,MACA,cAAAC;AAAA,MACA,YAAAC;AAAA,IACF,IAAI;AAOJ,QAAI,IAAI;AACR,QAAI,IAAI;AACR,QAAI,cAAc;AAClB,QAAI,iBAAiB;AAAA;AAAA,MACT,KAAK;AAAA,QACb,SAAS;AAAA,QACT,OAAO;AAAA,QACP,aAAa;AAAA,QACb,aAAa;AAAA,MACf;AAAA;AAAA,MACI,WAAW;AAAA,QACb,SAAS;AAAA,QACT,OAAO;AAAA,QACP,aAAa;AAAA,QACb,aAAa;AAAA,MACf;AAAA;AAAA,MACK,UAAU;AAAA,QACb,SAAS;AAAA,QACT,OAAO;AAAA,QACP,aAAa;AAAA,QACb,aAAa;AAAA,MACf;AAAA;AAAA,MACK,UAAU;AAAA,QACb,SAAS;AAAA,QACT,OAAO;AAAA,QACP,aAAa;AAAA,QACb,aAAa;AAAA,MACf;AAAA;AAAA,MACO,QAAQ;AAAA,QACb,SAAS;AAAA,QACT,OAAO;AAAA,QACP,aAAa;AAAA,QACb,aAAa;AAAA,MACf;AAAA;AAAA,MACQ,OAAO;AAAA,QACb,SAAS;AAAA,QACT,OAAO;AAAA,QACP,aAAa;AAAA,QACb,aAAa;AAAA,MACf;AAAA;AAAA,MACK,UAAU;AAAA,QACb,SAAS;AAAA,QACT,OAAO;AAAA,QACP,aAAa;AAAA,QACb,aAAa;AAAA,MACf;AAAA,IACF;AACA,QAAI,cAAc;AAAA,MAChB,QAAQ;AAAA,QACN,OAAO;AAAA,MACT;AAAA,MACA,KAAK;AAAA,QACH,OAAO;AAAA,MACT;AAAA,IACF;AACA,QAAI,kBAAkB;AAAA,MACpB,UAAU;AAAA,QACR,OAAO;AAAA,MACT;AAAA,MACA,KAAK;AAAA,QACH,SAAS;AAAA,MACX;AAAA,MACA,KAAK;AAAA,QACH,OAAO;AAAA,MACT;AAAA,IACF;AACA,aAASC,aAAY,YAAY,UAAU;AACzC,UAAI,UAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAClF,UAAIL,UAAO;AACX,UAAI,OAAO,eAAe,UAAU;AAClC,QAAAA,UAAO;AAAA,MACT,WAAW,eAAe,UAAU,GAAG;AACrC,QAAAA,UAAO,WAAW,GAAG,SAAS;AAAA,MAChC,WAAW,eAAe,UAAU,GAAG;AACrC,QAAAA,UAAO,WAAW;AAAA,MACpB,WAAW,kBAAkB,UAAU,GAAG;AACxC,QAAAA,UAAO;AAAA,MACT;AACA,UAAI,eAAe,SAASA,OAAI,GAAG;AACjC,YAAIM,cAAa,QAAQN,OAAI;AAC7B,YAAI,eAAeM,aAAY,QAAQ,GAAG;AACxC,iBAAOA,YAAW,QAAQ;AAAA,QAC5B;AACA,YAAI,eAAe,gBAAgBN,OAAI,GAAG;AACxC,iBAAO,eAAeA,OAAI,EAAE,QAAQ;AAAA,QACtC;AAAA,MACF;AACA,UAAI,eAAe,SAAS,WAAW,GAAG;AACxC,YAAI,cAAc,QAAQ,WAAW;AACrC,YAAI,eAAe,aAAa,QAAQ,GAAG;AACzC,iBAAO,YAAY,QAAQ;AAAA,QAC7B;AACA,eAAO,eAAe,WAAW,EAAE,QAAQ;AAAA,MAC7C;AAGA,UAAI,eAAe,gBAAgBA,OAAI,GAAG;AACxC,YAAI,eAAe,eAAeA,OAAI;AACtC,YAAI,eAAe,cAAc,QAAQ,GAAG;AAC1C,iBAAO,aAAa,QAAQ;AAAA,QAC9B;AAAA,MACF;AACA,aAAO,eAAe,WAAW,EAAE,QAAQ;AAAA,IAC7C;AACA,aAAS,cAAc,MAAM;AAC3B,UAAI,UAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAClF,aAAOK,aAAY,MAAM,eAAe,OAAO;AAAA,IACjD;AACA,aAAS,cAAc,MAAM;AAC3B,UAAI,UAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAClF,aAAOA,aAAY,MAAM,eAAe,OAAO;AAAA,IACjD;AAMA,aAAS,aAAa,SAAS,WAAW;AACxC,UAAI,SAASP,eAAc,CAAC,GAAG,OAAO;AACtC,eAAS,QAAQ,WAAW;AAC1B,YAAI,eAAe,SAAS,IAAI,GAAG;AACjC,iBAAO,IAAI,IAAIA,eAAcA,eAAc,CAAC,GAAG,UAAU,IAAI,CAAC,GAAG,QAAQ,IAAI,CAAC;AAAA,QAChF,OAAO;AACL,iBAAO,IAAI,IAAI,UAAU,IAAI;AAAA,QAC/B;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAMA,aAASS,SAAQ,MAAM,SAAS;AAC9B,UAAI,CAAC,KAAK,QAAQ,KAAK,KAAK,WAAW,GAAG;AACxC,eAAO;AAAA,MACT;AACA,WAAK,OAAO,YAAY,MAAM,OAAO;AACrC,eAASC,KAAI,GAAGA,KAAI,KAAK,KAAK,QAAQA,MAAK;AACzC,QAAAD,SAAQ,KAAK,KAAKC,EAAC,GAAG,OAAO;AAAA,MAC/B;AAAA,IACF;AAMA,aAAS,YAAY,MAAM,SAAS;AAClC,UAAI;AACJ,UAAI,WAAW,CAAC;AAChB,UAAI,gBAAgB,SAAS,aAAaC,OAAM;AAC9C,iBAASD,KAAI,GAAGA,KAAIC,MAAK,KAAK,QAAQD,MAAK;AACzC,cAAI,QAAQC,MAAK,KAAKD,EAAC;AACvB,cAAI,eAAe,KAAK,KAAK,OAAO,MAAM,IAAI;AAC5C,0BAAc,KAAK;AAAA,UACrB,OAAO;AACL,qBAAS,KAAK,KAAK;AAAA,UACrB;AAAA,QACF;AAAA,MACF;AACA,UAAI,cAAc,MAAM,OAAO,GAAG;AAChC,aAAK,KAAK;AACV,sBAAc,IAAI;AAClB,eAAO;AAAA,MACT,OAAO;AACL,eAAO,KAAK;AAAA,MACd;AAAA,IACF;AAKA,aAAS,WAAW,MAAM,SAAS;AACjC,UAAI,CAAC,KAAK,QAAQ,KAAK,KAAK,WAAW,GAAG;AACxC;AAAA,MACF;AACA,UAAI,WAAW,uBAAuB,IAAI;AAC1C,UAAI,IAAI,KAAK,KAAK;AAClB,eAASA,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,mBAAW,KAAK,KAAKA,EAAC,GAAG,OAAO;AAAA,MAClC;AACA,UAAI,IAAI,KAAK,cAAc,MAAM,OAAO,GAAG;AACzC,YAAI,UAAU,KAAK,KAAK,IAAI;AAC5B,eAAO,KAAK,KAAK,SAAS,GAAG;AAC3B,oBAAU,SAAS,CAAC,KAAK,KAAK,IAAI,GAAG,OAAO,CAAC;AAAA,QAC/C;AACA,aAAK,OAAO,QAAQ;AAAA,MACtB;AAAA,IACF;AAKA,aAAS,WAAW,MAAM,SAAS;AACjC,UAAI,CAAC,KAAK,QAAQ,KAAK,KAAK,WAAW,GAAG;AACxC;AAAA,MACF;AACA,UAAI,WAAW,uBAAuB,IAAI;AAC1C,UAAI,IAAI,KAAK,KAAK;AAClB,eAASA,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,mBAAW,KAAK,KAAKA,EAAC,GAAG,OAAO;AAAA,MAClC;AACA,UAAI,IAAI,KAAK,cAAc,MAAM,OAAO,GAAG;AACzC,YAAI,UAAU,KAAK,KAAK,MAAM;AAC9B,eAAO,KAAK,KAAK,SAAS,GAAG;AAC3B,oBAAU,SAAS,CAAC,SAAS,KAAK,KAAK,MAAM,CAAC,CAAC;AAAA,QACjD;AACA,aAAK,OAAO,QAAQ;AAAA,MACtB;AAAA,IACF;AACA,aAAS,uBAAuB,MAAM;AACpC,UAAI,eAAe,IAAI,GAAG;AACxB,eAAO,SAAU,MAAM;AACrB,cAAI;AACF,mBAAO,IAAIL,cAAa,KAAK,IAAI,KAAK,IAAI,MAAM,KAAK,QAAQ;AAAA,UAC/D,SAAS,KAAK;AACZ,oBAAQ,MAAM,GAAG;AACjB,mBAAO,CAAC;AAAA,UACV;AAAA,QACF;AAAA,MACF,OAAO;AACL,eAAO,SAAU,MAAM;AACrB,iBAAO,IAAID,cAAa,IAAIE,YAAW,KAAK,IAAI,GAAG,IAAI;AAAA,QACzD;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,MACL;AAAA,MACA,aAAAC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,SAAAE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF,CAAC;;;AC9PD,MAAIG,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,SAAS,SAAS,WAAW,oBAAoB,gBAAgB,gBAAgB,aAAa,gBAAgB,gBAAgB,aAAa,cAAc,gBAAgB,mBAAmB,cAAc,UAAU;AAC1O,MAAI,iBAAgC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC7E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,OAAAC;AAAA,MACA,OAAAC;AAAA,MACA,SAAAC;AAAA,MACA,kBAAAC;AAAA,MACA,cAAAC;AAAA,MACA,cAAAC;AAAA,MACA,WAAAC;AAAA,MACA,cAAAC;AAAA,MACA,cAAAC;AAAA,MACA,WAAAC;AAAA,MACA,YAAAC;AAAA,MACA,cAAAC;AAAA,MACA,iBAAAC;AAAA,MACA,YAAAC;AAAA,MACA,UAAAC;AAAA,IACF,IAAI;AACJ,QAAI;AAAA,MACF,aAAAC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,SAAAC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,IAAI,WAAW;AAAA,MACb,cAAAR;AAAA,MACA,cAAAG;AAAA,MACA,YAAAE;AAAA,IACF,CAAC;AAoHD,IAAAd,OAAM,cAAc;AAAA,MAClB,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,SAAS;AAAA,IACX,CAAC;AACD,QAAIkB,YAAWlB,OAAM,YAAY;AAAA,MAC/B,MAAM;AAAA,MACN,aAAa,CAAC,MAAM,UAAU,UAAU,MAAM,OAAO,KAAK;AAAA,MAC1D,qBAAqB,CAAC,MAAM,OAAO,YAAY,UAAU,MAAM,OAAO,OAAO,OAAO;AAAA,MACpF,eAAe;AAAA,MACf,oBAAoB;AAAA,MACpB,4BAA4B;AAAA,IAC9B,CAAC;AACD,IAAAA,OAAM,iBAAiB;AAAA,MACrB,MAAM;AAAA,MACN,IAAI;AAAA,MACJ,SAAS;AAAA,IACX,CAAC;AACD,IAAAkB,UAAS,iBAAiB;AAC1B,IAAAA,UAAS,cAAc;AACvB,IAAAA,UAAS,kBAAkB;AAC3B,aAAS,aAAa,MAAM;AAC1B,aAAO,KAAK,UAAU,SAAUC,OAAM;AACpC,eAAO,kBAAkBA,KAAI,IAAI,aAAaA,MAAK,OAAO,IAAIA;AAAA,MAChE,CAAC;AAAA,IACH;AAGA,QAAI,sBAAsB;AAAA,MACxB,MAAM;AAAA,MACN,OAAO;AAAA,MACP,GAAG;AAAA,MACH,GAAG;AAAA,MACH,UAAU;AAAA,MACV,KAAK;AAAA,MACL,MAAM;AAAA,MACN,OAAO;AAAA,MACP,QAAQ;AAAA,MACR,KAAK;AAAA,MACL,KAAK;AAAA,MACL,IAAI;AAAA,MACJ,SAAS;AAAA,MACT,OAAO;AAAA,MACP,KAAK;AAAA;AAAA;AAAA;AAAA,IAIP;AAWA,IAAAD,UAAS,QAAQ;AAAA,MAACb;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQlB;AAAA,QACE,GAAG;AAAA,QACH,GAAG;AAAA,MACL;AAAA;AAAA;AAAA;AAAA,MAIA;AAAA,QACE,GAAG;AAAA;AAAA,QAEH,UAAU;AAAA,UACR,UAAU;AAAA,YACR,OAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA;AAAA,QAEH,UAAU;AAAA,UACR,UAAU;AAAA,YACR,OAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA;AAAA,QAEH,UAAU;AAAA,UACR,UAAU;AAAA,YACR,aAAa;AAAA,UACf;AAAA,UACA,UAAU;AAAA,YACR,OAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA;AAAA,QAEH,UAAU;AAAA,UACR,UAAU;AAAA,YACR,aAAa;AAAA,UACf;AAAA,UACA,UAAU;AAAA,YACR,OAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA;AAAA,QAEH,UAAU;AAAA,UACR,UAAU;AAAA,YACR,aAAa;AAAA,UACf;AAAA,UACA,UAAU;AAAA,YACR,OAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,GAAG;AAAA,MACL;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,GAAG;AAAA,MACL;AAAA;AAAA,MAEA;AAAA,QACE,GAAG;AAAA,QACH,GAAG;AAAA,QACH,QAAQ;AAAA,MACV;AAAA;AAAA,MAEA;AAAA,QACE,GAAG;AAAA,QACH,GAAG;AAAA,MACL;AAAA;AAAA,MAEA;AAAA,QACE,GAAG;AAAA,QACH,GAAG;AAAA,MACL;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,UAAU;AAAA,UACR,UAAU;AAAA,YACR,aAAa;AAAA,UACf;AAAA,QACF;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,UAAU;AAAA,UACR,UAAU;AAAA,YACR,aAAa;AAAA,UACf;AAAA,QACF;AAAA,MACF;AAAA;AAAA,MAEA;AAAA,QACE,GAAG;AAAA,QACH,UAAU;AAAA,UACR,QAAQ;AAAA,YACN,OAAO;AAAA,UACT;AAAA,QACF;AAAA;AAAA,MACF;AAAA;AAAA,MAEA;AAAA,QACE,GAAG;AAAA,QACH,GAAG;AAAA,MACL;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,UAAU;AAAA,UACR,QAAQ;AAAA,YACN,OAAO;AAAA,UACT;AAAA,QACF;AAAA;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,UAAU;AAAA,UACR,QAAQ;AAAA,YACN,OAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,UAAU;AAAA,UACR,QAAQ;AAAA,YACN,OAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,GAAG;AAAA,MACL;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,UAAU;AAAA,UACR,QAAQ;AAAA,YACN,OAAO;AAAA,UACT;AAAA,QACF;AAAA;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,UAAU;AAAA,UACR,QAAQ;AAAA,YACN,OAAO;AAAA,UACT;AAAA,QACF;AAAA;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAKAD;AAAA;AAAA;AAAA,MAIA;AAAA,QACE,GAAG;AAAA,QACH,UAAU;AAAA,UACR,KAAK;AAAA,YACH,OAAO;AAAA,UACT;AAAA,QACF;AAAA;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,GAAG;AAAA,MACL;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,GAAG;AAAA,MACL;AAAA;AAAA,MAEA;AAAA,QACE,GAAG;AAAA,QACH,GAAG;AAAA,MACL;AAAA;AAAA,MAEA;AAAA,QACE,GAAG;AAAA,QACH,GAAG;AAAA,MACL;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,GAAG;AAAA,MACL;AAAA;AAAA,MAEA;AAAA,QACE,GAAG;AAAA,QACH,UAAU;AAAA,UACR,UAAU;AAAA,YACR,aAAa;AAAA,UACf;AAAA,QACF;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,UAAU;AAAA,UACR,UAAU;AAAA,YACR,aAAa;AAAA,UACf;AAAA,QACF;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,UAAU;AAAA,UACR,UAAU;AAAA,YACR,aAAa;AAAA,UACf;AAAA,QACF;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,UAAU;AAAA,UACR,QAAQ;AAAA,YACN,OAAO;AAAA,UACT;AAAA,UACA,UAAU;AAAA,YACR,aAAa;AAAA,UACf;AAAA,QACF;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,UAAU;AAAA,UACR,UAAU;AAAA,YACR,aAAa;AAAA,UACf;AAAA,QACF;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,UAAU;AAAA,UACR,UAAU;AAAA,YACR,aAAa;AAAA,UACf;AAAA,QACF;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,GAAG;AAAA,MACL;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,UAAU;AAAA,UACR,UAAU;AAAA,YACR,aAAa;AAAA,UACf;AAAA,QACF;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,UAAU;AAAA,UACR,UAAU;AAAA,YACR,aAAa;AAAA,UACf;AAAA,QACF;AAAA,MACF;AAAA,MAAGA;AAAA;AAAA;AAAA,MAIH;AAAA,QACE,GAAG;AAAA,QACH,UAAU;AAAA,UACR,UAAU;AAAA,YACR,OAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA;AAAA,QAEH,UAAU;AAAA,UACR,UAAU;AAAA,YACR,OAAO;AAAA,UACT;AAAA,UACA,UAAU;AAAA,YACR,aAAa;AAAA,UACf;AAAA,QACF;AAAA,MACF;AAAA;AAAA,MAEA;AAAA,QACE,GAAG;AAAA,QACH,UAAU;AAAA,UACR,KAAK;AAAA,YACH,aAAa;AAAA,UACf;AAAA,QACF;AAAA,QACA,eAAe;AAAA,UACb,KAAK;AAAA,YACH,aAAa;AAAA,UACf;AAAA,QACF;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,UAAU;AAAA,UACR,UAAU;AAAA,YACR,aAAa;AAAA,UACf;AAAA,QACF;AAAA,QACA,eAAe;AAAA,UACb,UAAU;AAAA,YACR,aAAa;AAAA,UACf;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA,MAGA;AAAA,QACE,GAAG;AAAA,QACH,GAAG;AAAA,MACL;AAAA;AAAA,MAEA;AAAA,QACE,GAAG;AAAA,QACH,GAAG;AAAA,MACL;AAAA,MAAG;AAAA,QACD,GAAG;AAAA;AAAA,QAEH,UAAU;AAAA,UACR,UAAU;AAAA,YACR,aAAa;AAAA,UACf;AAAA,QACF;AAAA;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,UAAU;AAAA,UACR,UAAU;AAAA,YACR,aAAa;AAAA,UACf;AAAA,QACF;AAAA;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,UAAU;AAAA,UACR,UAAU;AAAA,YACR,aAAa;AAAA,UACf;AAAA,QACF;AAAA;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,GAAG;AAAA,MACL;AAAA;AAAA,MAEA;AAAA,QACE,GAAG;AAAA;AAAA,QAEH,UAAU;AAAA,UACR,UAAU;AAAA,YACR,aAAa;AAAA,UACf;AAAA,QACF;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA;AAAA,QAEH,UAAU;AAAA,UACR,UAAU;AAAA,YACR,aAAa;AAAA,YACb,aAAa;AAAA,UACf;AAAA,QACF;AAAA,MACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMA;AAAA,QACE,GAAG;AAAA,QACH,GAAG;AAAA,QACH,eAAe;AAAA,UACb,UAAU;AAAA,YACR,aAAa;AAAA,UACf;AAAA,QACF;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,UAAU;AAAA,UACR,UAAU;AAAA,YACR,aAAa;AAAA,UACf;AAAA,QACF;AAAA,MACF;AAAA,MAAG;AAAA,QACD,GAAG;AAAA,QACH,GAAG;AAAA,MACL;AAAA,IAAC;AAMD,aAAS,kBAAkB,YAAY,SAAS;AAC9C,UAAI,UAAU,CAAC;AACf,UAAI,WAAW,GAAG;AAChB,YAAI,KAAK,WAAW,EAAE,MAAM,IAAI;AAChC,YAAI,GAAG,WAAW,GAAG;AACnB,kBAAQ,IAAI,GAAG,CAAC;AAChB,kBAAQ,IAAI,GAAG,CAAC;AAAA,QAClB,OAAO;AACL,gBAAM,YAAY,2BAA2B,WAAW,CAAC;AAAA,QAC3D;AAAA,MACF,OAAO;AACL,gBAAQ,IAAI,WAAW;AACvB,gBAAQ,IAAI,WAAW;AAAA,MACzB;AACA,cAAQ,IAAI,aAAaH,OAAM,QAAQ,CAAC,CAAC;AACzC,cAAQ,IAAI,aAAaA,OAAM,QAAQ,CAAC,CAAC;AACzC,eAAS,QAAQ,CAAC,iBAAiB,UAAU,UAAU,GAAG;AACxD,YAAI,QAAQ,YAAY;AACtB,kBAAQ,IAAI,IAAI,WAAW,IAAI;AAAA,QACjC;AAAA,MACF;AACA,UAAI,WAAW,UAAU;AACvB,gBAAQ,WAAWA,OAAM,WAAW,QAAQ;AAAA,MAC9C;AACA,UAAI,cAAc,QAAQ,GAAG,OAAO,GAAG;AACrC,YAAI,iBAAiB,CAAC,cAAc,QAAQ,GAAG,OAAO;AACtD,YAAI;AAEJ,YAAI,eAAgB,iBAAgB,4BAA4B;AAChE,YAAI,WAAW,uBAAuB,QAAQ,CAAC;AAC/C,YAAI,YAAY,4BAA4B;AAC5C,gBAAQ,WAAW,CAAC;AACpB,gBAAQ,SAAS,IAAI,SAAS,CAAC,QAAQ,GAAG,SAAS,CAAC;AAGpD,QAAAgB,SAAQ,QAAQ,SAAS,GAAG,OAAO;AACnC,mBAAW,QAAQ,SAAS,GAAG,OAAO;AACtC,gBAAQ,SAAS,IAAI,SAAS,CAAC,QAAQ,GAAG,SAAS,CAAC;AAKpD,YAAI,gBAAgB;AAElB,kBAAQ,cAAc,CAAC;AACvB,kBAAQ,YAAY,IAAI,SAAS,CAAC,eAAe,QAAQ,CAAC,CAAC;AAC3D,kBAAQ,YAAY,IAAI,SAAS,CAAC,eAAe,QAAQ,CAAC,CAAC;AAE3D,kBAAQ,cAAc,CAAC;AACvB,kBAAQ,YAAY,IAAI,SAAS,CAAC,eAAe,QAAQ,SAAS,CAAC,CAAC;AACpE,kBAAQ,YAAY,IAAI,SAAS,CAAC,eAAe,QAAQ,SAAS,CAAC,CAAC;AAAA,QACtE;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAkBA,aAAS,YAAY,OAAO,SAAS;AAEnC,UAAI,UAAU,CAAC;AACf,eAASG,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AACrC,YAAI,OAAO,MAAMA,EAAC;AAClB,YAAI,UAAU;AACd,YAAI,WAAW,OAAO;AACtB,gBAAQ,UAAU;AAAA,UAChB,KAAK;AACH,mBAAO;AAAA,cACL,GAAG;AAAA,YACL;AAAA;AAAA,UAEF,KAAK;AACH,sBAAU,kBAAkB,MAAM,OAAO;AACzC;AAAA,UACF,KAAK;AACH,sBAAU;AACV;AAAA,UACF;AACE,kBAAM,UAAU,+BAA+B,QAAQ;AAAA,QAC3D;AAGA,gBAAQ,KAAK,OAAO;AAAA,MACtB;AACA,aAAO;AAAA,IACT;AACA,QAAI,WAAW;AACf,aAAS,8BAA8B;AACrC,aAAO,IAAIN,YAAW,OAAO,UAAU;AAAA,IACzC;AACA,aAAS,UAAU,MAAM,OAAO;AAC9B,UAAI,QAAQ,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,eAAe;AAC/F,UAAI,UAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAC;AACnF,UAAI,QAAQ,QAAQ;AACpB,cAAQ,YAAY,SAASI,UAAS,OAAO,QAAQ,OAAO;AAC5D,UAAI,MAAMf,SAAQ,MAAM,KAAK;AAC7B,YAAM,aAAa,GAAG;AACtB,UAAI,UAAU,CAAC;AACf,UAAI,MAAM,IAAI,SAAS;AAAA,QACrB,aAAa;AAAA,MACf,CAAC;AACD,aAAO,CAAC,QAAQ,GAAG,GAAG;AACpB,gBAAQ,GAAG,IAAI;AACf,mBAAW;AACX,YAAI,UAAU;AACd,YAAI,MAAO,SAAQ,IAAI,gBAAgB,GAAG;AAC1C,iBAASiB,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AACrC,cAAI,UAAU;AACd,cAAI,OAAO,MAAMA,EAAC,MAAM,YAAY;AAClC,kBAAM,MAAMA,EAAC,EAAE,KAAK,OAAO;AAC3B,gBAAI,MAAO,WAAU,MAAMA,EAAC,EAAE;AAAA,UAChC,OAAO;AACL,YAAAH,SAAQ,KAAK,QAAQ,OAAO;AAC5B,kBAAM,UAAU,KAAK,MAAMG,EAAC,GAAG,QAAQ,OAAO;AAC9C,gBAAI,OAAO;AACT,wBAAU,GAAG,OAAO,MAAMA,EAAC,EAAE,EAAE,SAAS,GAAG,MAAM,EAAE,OAAO,MAAMA,EAAC,EAAE,EAAE,SAAS,CAAC;AAAA,YACjF;AAAA,UACF;AACA,cAAI,OAAO;AACT,gBAAI,SAAS,IAAI,SAAS;AAAA,cACxB,aAAa;AAAA,YACf,CAAC;AACD,gBAAI,WAAW,SAAS;AACtB,sBAAQ,IAAI,YAAY,SAAS,YAAY,MAAM;AACnD,wBAAU;AAAA,YACZ;AAAA,UACF;AAIA,qBAAW,KAAK,QAAQ,OAAO;AAAA,QACjC;AACA,cAAM,IAAI,SAAS;AAAA,UACjB,aAAa;AAAA,QACf,CAAC;AAAA,MACH;AACA,aAAO;AAAA,IACT;AACA,aAAS,QAAQ,OAAO,MAAM,SAAS;AACrC,UAAI,WAAW;AACf,UAAI,OAAO;AACT,iBAASA,KAAI,GAAGA,KAAI,MAAM,QAAQ,EAAEA,IAAG;AACrC,cAAI,UAAU,UAAU,MAAMA,EAAC,GAAG,MAAM,OAAO;AAC/C,cAAI,YAAY,MAAMA,EAAC,GAAG;AACxB,gBAAI,aAAa,OAAO;AACtB,yBAAW,MAAM,MAAM;AAAA,YACzB;AACA,qBAASA,EAAC,IAAI;AAAA,UAChB;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAUA,aAAS,UAAU,MAAM,MAAM,SAAS;AAKtC,UAAI,KAAK,UAAU;AACjB,iBAAS,UAAU,KAAK,UAAU;AAChC,mBAAS,YAAY,KAAK,SAAS,MAAM,GAAG;AAC1C,gBAAIJ,aAAY,QAAQ,UAAU,OAAO,MAAM,KAAK,SAAS,MAAM,EAAE,QAAQ,GAAG;AAC9E,qBAAO;AAAA,YACT;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,UAAI,gBAAgB,aAAa,KAAK,eAAe,OAAO;AAG5D,UAAI,MAAM;AAKV,UAAI,eAAeJ,iBAAgB,eAAeH,eAAc;AAC9D,YAAI,UAAU,QAAQ,IAAI,MAAM,MAAM,OAAO;AAC7C,YAAI,YAAY,IAAI,MAAM;AACxB,gBAAM,IAAI,MAAM;AAChB,cAAI,OAAO;AAAA,QACb;AAAA,MACF,WAAW,eAAeI,kBAAiB;AACzC,YAAI,IAAI,SAAS;AACf,cAAI,aAAa,UAAU,IAAI,SAAS,MAAM,OAAO;AACrD,cAAI,eAAe,IAAI,SAAS;AAC9B,kBAAM,IAAIA,iBAAgB,UAAU;AAAA,UACtC;AAAA,QACF;AAAA,MACF,WAAW,eAAeN,YAAW;AACnC,YAAI,WAAW,QAAQ,IAAI,OAAO,MAAM,OAAO;AAC/C,YAAI,aAAa,IAAI,OAAO;AAC1B,gBAAM,IAAIA,WAAU,QAAQ;AAAA,QAC9B;AAAA,MACF,WAAW,eAAeD,eAAc;AACtC,YAAI,SAAS,IAAI;AACjB,YAAI,IAAI,QAAQ;AACd,mBAAS,UAAU,IAAI,QAAQ,MAAM,OAAO;AAAA,QAC9C;AACA,YAAIe,YAAW,IAAI;AACnB,YAAI,IAAI,OAAO;AACb,UAAAA,YAAW,UAAU,IAAI,OAAO,MAAM,OAAO;AAAA,QAC/C;AACA,YAAI,WAAW,IAAI,UAAUA,cAAa,IAAI,OAAO;AACnD,gBAAM,IAAIf,cAAa,QAAQe,SAAQ;AAAA,QACzC;AAAA,MACF,WAAW,eAAeX,YAAW;AACnC,YAAI,UAAU,QAAQ,IAAI,YAAY,MAAM,OAAO;AACnD,YAAI,YAAY,IAAI,YAAY;AAC9B,gBAAM,IAAIA,WAAU,OAAO;AAAA,QAC7B;AAAA,MACF,WAAW,eAAeC,aAAY;AACpC,YAAI,UAAU;AACd,YAAI,WAAW,CAAC;AAChB,iBAAS,QAAQ,IAAI,YAAY;AAC/B,mBAAS,IAAI,IAAI,UAAU,IAAI,WAAW,IAAI,GAAG,MAAM,OAAO;AAC9D,cAAI,SAAS,IAAI,MAAM,IAAI,WAAW,IAAI,GAAG;AAC3C,sBAAU;AAAA,UACZ;AAAA,QACF;AACA,YAAI,SAAS;AACX,gBAAM,IAAIA,YAAW,QAAQ;AAAA,QAC/B;AAAA,MACF;AAGA,UAAI,OAAO,KAAK;AAChB,UAAIW,WAAU,WAAW,KAAK,GAAG,KAAK,aAAa,EAAE,CAAC;AAItD,UAAI,CAACA,YAAW,KAAK,UAAU;AAC7B,eAAO,KAAK,SAAS;AACrB,QAAAA,WAAU,WAAW,KAAK,SAAS,GAAG,KAAK,aAAa,EAAE,CAAC;AAAA,MAC7D;AAEA,UAAI,CAACA,YAAW,KAAK,aAAa;AAChC,eAAO,KAAK,YAAY;AACxB,QAAAA,WAAU,WAAW,KAAK,YAAY,GAAG,KAAK,aAAa,EAAE,CAAC;AAC9D,YAAI,CAACA,UAAS;AAEZ,iBAAO,KAAK,YAAY;AACxB,UAAAA,WAAU,WAAW,KAAK,YAAY,GAAG,KAAK,aAAa,EAAE,CAAC;AAAA,QAChE;AAAA,MACF;AACA,UAAIA,UAAS;AAKX,YAAI,WAAW,IAAI;AACnB,cAAM,KAAK,MAAM;AACjB,YAAI,YAAY,cAAc,MAAM;AAClC,cAAI,WAAW;AAAA,QACjB;AAGA,cAAM,IAAI,UAAU,SAAUH,OAAM;AAClC,cAAIA,MAAK,gBAAgB,eAAeG,SAAQ,cAAcH,MAAK,IAAI,GAAG;AACxE,mBAAOG,SAAQ,aAAaH,MAAK,IAAI,EAAE,MAAM;AAAA,UAC/C,OAAO;AACL,mBAAOA;AAAA,UACT;AAAA,QACF,CAAC;AAAA,MAIH;AACA,UAAI,KAAK,UAAU,QAAQ,MAAM;AAC/B,cAAM,UAAU,KAAK,MAAM,OAAO;AAAA,MACpC;AACA,aAAO;AAAA,IACT;AAUA,aAAS,UAAU,MAAM,SAAS;AAChC,UAAI,MAAM,CAAC;AACX,UAAI,OAAO;AACX,UAAI,WAAW,uBAAuB,IAAI;AAC1C,UAAI,cAAc,MAAM,OAAO,GAAG;AAChC,iBAASC,KAAI,GAAGA,KAAI,KAAK,KAAK,QAAQA,MAAK;AACzC,sBAAY,KAAK,KAAK,MAAM,CAAC;AAC7B,oBAAU,OAAOA,IAAG,CAAC;AACrB,kBAAQ,UAAU,WAAW,IAAI,UAAU,CAAC,IAAI,SAAS,SAAS;AAClE,cAAI,KAAK,SAAS,CAAC,KAAK,KAAKA,EAAC,GAAG,KAAK,CAAC,CAAC;AAAA,QAC1C;AAAA,MACF,OAAO;AAEL,iBAAS,KAAK,GAAG,KAAK,KAAK,KAAK,QAAQ,MAAM;AAC5C,cAAI,OAAO,KAAK,KAAK,CAAC;AACtB,cAAI,KAAK,GAAG;AACV,mBAAO,SAAS,KAAK,KAAK,MAAM,GAAG,EAAE,CAAC;AAAA,UACxC;AACA,sBAAY,KAAK,KAAK,MAAM,EAAE;AAC9B,kBAAQ,UAAU,WAAW,IAAI,UAAU,CAAC,IAAI,SAAS,SAAS;AAClE,cAAI,KAAK,SAAS,CAAC,MAAM,KAAK,CAAC,CAAC;AAAA,QAClC;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAKA,aAAS,WAAW,QAAQ,QAAQ;AAClC,UAAI,MAAM;AAAA,QACR,cAAc,CAAC;AAAA,MACjB;AAGA,UAAI,CAAC,OAAO,gBAAgB,CAAC,OAAO,cAAc;AAChD,eAAO;AAAA,MACT,WAAW,CAAC,OAAO,cAAc;AAC/B,eAAO;AAAA,MACT,WAAW,CAAC,OAAO,cAAc;AAC/B,eAAO;AAAA,MACT;AAGA,eAAS,OAAO,OAAO,cAAc;AACnC,YAAI,eAAe,OAAO,cAAc,GAAG,GAAG;AAC5C,cAAI,aAAa,GAAG,IAAI,OAAO,aAAa,GAAG;AAC/C,cAAI,eAAe,OAAO,cAAc,GAAG,GAAG;AAC5C,gBAAI,CAAC,YAAY,OAAO,aAAa,GAAG,GAAG,OAAO,aAAa,GAAG,CAAC,GAAG;AACpE,qBAAO;AAAA,YACT;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,eAAS,QAAQ,OAAO,cAAc;AACpC,YAAI,eAAe,OAAO,cAAc,IAAI,GAAG;AAC7C,cAAI,aAAa,IAAI,IAAI,OAAO,aAAa,IAAI;AAAA,QACnD;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAMA,aAAS,oBAAoB,OAAO,OAAO;AACzC,UAAI,MAAM,CAAC;AACX,UAAI,MAAM,WAAW,KAAK,MAAM,WAAW,GAAG;AAC5C,eAAO;AAAA,MACT;AACA,UAAI;AACJ,eAAS,KAAK,GAAG,KAAK,MAAM,QAAQ,MAAM;AACxC,iBAAS,KAAK,GAAG,KAAK,MAAM,QAAQ,MAAM;AACxC,mBAAS,WAAW,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC;AACxC,cAAI,QAAQ;AACV,gBAAI,KAAK,MAAM;AAAA,UACjB;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAOA,aAAS,kBAAkB,cAAc;AACvC,UAAI,aAAa,WAAW,GAAG;AAC7B,eAAO;AAAA,MACT;AACA,UAAI,OAAO,aAAa,OAAO,mBAAmB;AAClD,UAAI,aAAa,CAAC;AAClB,UAAI,SAAS,CAAC;AACd,eAASA,KAAI,GAAGA,KAAI,KAAK,QAAQA,MAAK;AACpC,YAAI,IAAI,KAAK,UAAU,KAAKA,EAAC,GAAGL,SAAQ;AACxC,YAAI,CAAC,OAAO,CAAC,GAAG;AACd,iBAAO,CAAC,IAAI;AACZ,qBAAW,KAAK,KAAKK,EAAC,CAAC;AAAA,QACzB;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAaA,aAAS,WAAW,MAAM,MAAM,SAAS,SAAS;AAMhD,UAAI,MAAM,CAAC;AAAA,QACT,cAAc,CAAC;AAAA,MACjB,CAAC;AACD,UAAI,gBAAgBR,iBAAgB,gBAAgBA,iBAAgB,gBAAgBH,iBAAgB,gBAAgBA,eAAc;AAEhI,YAAI,gBAAgBG,eAAc;AAChC,cAAI,KAAK,OAAO,KAAK,MAAM,KAAK,OAAO,KAAK,IAAI;AAC9C,mBAAO,CAAC;AAAA,UACV;AAAA,QACF,WAAW,gBAAgBH,eAAc;AACvC,cAAI,KAAK,SAAS,KAAK,MAAM;AAC3B,mBAAO,CAAC;AAAA,UACV;AAAA,QACF;AAGA,YAAI,KAAK,KAAK,WAAW,KAAK,KAAK,KAAK,WAAW,KAAK,CAAC,cAAc,MAAM,OAAO,KAAK,KAAK,KAAK,WAAW,KAAK,KAAK,UAAU,SAAS;AAGzI,cAAI,eAAe,CAAC;AACpB,mBAASW,KAAI,GAAGA,KAAI,KAAK,KAAK,QAAQA,MAAK;AACzC,gBAAI,aAAa,WAAW,KAAK,KAAKA,EAAC,GAAG,KAAK,KAAKA,EAAC,GAAG,OAAO;AAC/D,gBAAI,WAAW,WAAW,GAAG;AAE3B;AAAA,YACF;AAEA,yBAAa,KAAK,UAAU;AAAA,UAC9B;AACA,cAAI,aAAa,WAAW,KAAK,KAAK,QAAQ;AAC5C,gBAAI,CAAC,cAAc,MAAM,OAAO;AAAA,YAEhC,KAAK,KAAK,WAAW,GAAG;AAEtB,qBAAO,CAAC;AAAA,YACV;AACA,gBAAI,KAAK,KAAK,SAAS,GAAG;AAKxB,oBAAM,IAAI,MAAM,6EAA6E;AAAA,YAC/F;AAEA,gBAAI,YAAY,WAAW,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,OAAO;AAC9D,gBAAI,UAAU,WAAW,GAAG;AAC1B,qBAAO,CAAC;AAAA,YACV;AACA,gBAAI,aAAa,WAAW,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,OAAO;AAC/D,gBAAI,WAAW,WAAW,GAAG;AAC3B,qBAAO,CAAC;AAAA,YACV;AACA,2BAAe,CAAC,WAAW,UAAU;AAAA,UACvC;AACA,gBAAM,kBAAkB,YAAY;AAAA,QACtC,WAAW,KAAK,KAAK,UAAU,KAAK,KAAK,KAAK,WAAW,GAAG;AAI1D,cAAI,SAAS,UAAU,MAAM,OAAO;AACpC,cAAI,eAAe,CAAC;AACpB,mBAAS,MAAM,GAAG,MAAM,OAAO,QAAQ,OAAO;AAC5C,gBAAI,WAAW,WAAW,MAAM,OAAO,GAAG,GAAG,SAAS,IAAI;AAC1D,2BAAe,aAAa,OAAO,QAAQ;AAAA,UAC7C;AACA,iBAAO;AAAA,QACT,WAAW,KAAK,KAAK,SAAS,GAAG;AAC/B,gBAAM,MAAM,iDAAiD,KAAK,SAAS,CAAC;AAAA,QAC9E,OAAO;AAEL,iBAAO,CAAC;AAAA,QACV;AAAA,MACF,WAAW,gBAAgBN,aAAY;AAIrC,YAAI,KAAK,KAAK,WAAW,GAAG;AAC1B,gBAAM,IAAI,MAAM,kCAAkC;AAAA,QACpD;AACA,YAAI,oBAAoB,KAAK,IAAI,GAAG;AAElC,cAAI,KAAK,SAAS,KAAK,MAAM;AAC3B,mBAAO,CAAC;AAAA,UACV;AAAA,QACF,OAAO;AAEL,kBAAQ,KAAK,KAAK,CAAC,KAAK,OAAO,KAAK,KAAK,CAAC,KAAK,MAAM,KAAK,KAAK,UAAU,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC,GAAG;AAAA,YAC7F,KAAK;AAAA,YACL,KAAK;AAIH,kBAAI,CAAC,EAAE,aAAa,KAAK,IAAI,IAAI;AACjC;AAAA,YACF,KAAK;AAAA,YACL,KAAK;AAEH,kBAAI,eAAe,IAAI,GAAG;AACxB,oBAAI,CAAC,EAAE,aAAa,KAAK,IAAI,IAAI;AAAA,cACnC,OAAO;AAEL,uBAAO,CAAC;AAAA,cACV;AACA;AAAA,YACF,KAAK;AAEH,kBAAI,CAAC,eAAe,IAAI,GAAG;AACzB,oBAAI,CAAC,EAAE,aAAa,KAAK,IAAI,IAAI;AAAA,cACnC,OAAO;AAEL,uBAAO,CAAC;AAAA,cACV;AACA;AAAA,YACF,KAAK;AAEH,kBAAI,aAAe,IAAI,GAAG;AACxB,oBAAI,CAAC,EAAE,aAAa,KAAK,IAAI,IAAI;AAAA,cACnC,OAAO;AAEL,uBAAO,CAAC;AAAA,cACV;AACA;AAAA,YACF,KAAK;AAEH,kBAAI,cAAc,IAAI,GAAG;AACvB,oBAAI,CAAC,EAAE,aAAa,KAAK,IAAI,IAAI;AAAA,cACnC,OAAO;AAEL,uBAAO,CAAC;AAAA,cACV;AACA;AAAA,YACF,KAAK;AAEH,kBAAI,CAAC,cAAc,IAAI,GAAG;AACxB,oBAAI,CAAC,EAAE,aAAa,KAAK,IAAI,IAAI;AAAA,cACnC,OAAO;AAEL,uBAAO,CAAC;AAAA,cACV;AACA;AAAA,YACF,KAAK;AAEH,kBAAI,qBAAqB,IAAI,GAAG;AAC9B,oBAAI,CAAC,EAAE,aAAa,KAAK,IAAI,IAAI;AAAA,cACnC,OAAO;AAEL,uBAAO,CAAC;AAAA,cACV;AACA;AAAA,YACF,KAAK;AAEH,kBAAI,CAAC,qBAAqB,IAAI,GAAG;AAC/B,oBAAI,CAAC,EAAE,aAAa,KAAK,IAAI,IAAI;AAAA,cACnC,OAAO;AAEL,uBAAO,CAAC;AAAA,cACV;AACA;AAAA,YACF;AACE,oBAAM,IAAI,MAAM,6BAA6B,KAAK,IAAI;AAAA,UAC1D;AAAA,QACF;AAAA,MACF,WAAW,gBAAgBN,eAAc;AAEvC,YAAI,CAACN,OAAM,KAAK,OAAO,KAAK,KAAK,GAAG;AAClC,iBAAO,CAAC;AAAA,QACV;AAAA,MACF,OAAO;AAEL,eAAO,CAAC;AAAA,MACV;AAKA,aAAO;AAAA,IACT;AASA,aAAS,YAAY,GAAG,GAAG;AACzB,UAAI,aAAaM,iBAAgB,aAAaA,eAAc;AAC1D,YAAI,CAACN,OAAM,EAAE,OAAO,EAAE,KAAK,GAAG;AAC5B,iBAAO;AAAA,QACT;AAAA,MACF,WAAW,aAAaY,eAAc,aAAaA,aAAY;AAC7D,YAAI,EAAE,SAAS,EAAE,MAAM;AACrB,iBAAO;AAAA,QACT;AAAA,MACF,WAAW,aAAaF,iBAAgB,aAAaA,iBAAgB,aAAaH,iBAAgB,aAAaA,eAAc;AAC3H,YAAI,aAAaG,eAAc;AAC7B,cAAI,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI;AAClC,mBAAO;AAAA,UACT;AAAA,QACF,WAAW,aAAaH,eAAc;AACpC,cAAI,EAAE,SAAS,EAAE,MAAM;AACrB,mBAAO;AAAA,UACT;AAAA,QACF;AACA,YAAI,EAAE,KAAK,WAAW,EAAE,KAAK,QAAQ;AACnC,iBAAO;AAAA,QACT;AACA,iBAASW,KAAI,GAAGA,KAAI,EAAE,KAAK,QAAQA,MAAK;AACtC,cAAI,CAAC,YAAY,EAAE,KAAKA,EAAC,GAAG,EAAE,KAAKA,EAAC,CAAC,GAAG;AACtC,mBAAO;AAAA,UACT;AAAA,QACF;AAAA,MACF,OAAO;AACL,eAAO;AAAA,MACT;AACA,aAAO;AAAA,IACT;AACA,WAAOF;AAAA,EACT,CAAC;;;ACxtCD,MAAIK,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,qBAAqB,UAAU,aAAa,aAAa,cAAc,gBAAgB,aAAa,gBAAgB,gBAAgB,aAAa,cAAc,gBAAgB,YAAY;AAC3N,MAAI,yBAAwC,wBAAQD,SAAMC,iBAAc,UAAQ;AACrF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,mBAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,UAAAC;AAAA,MACA,WAAAC;AAAA,MACA,cAAAC;AAAA,MACA,WAAAC;AAAA,MACA,cAAAC;AAAA,MACA,cAAAC;AAAA,MACA,WAAAC;AAAA,MACA,YAAAC;AAAA,MACA,cAAAC;AAAA,MACA,YAAAC;AAAA,IACF,IAAI;AACJ,QAAI;AAAA,MACF;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,IAAI,WAAW;AAAA,MACb,cAAAJ;AAAA,MACA,cAAAG;AAAA,MACA,YAAAC;AAAA,IACF,CAAC;AA6BD,QAAIC,oBAAmBf,OAAM,oBAAoB;AAAA,MAC/C,MAAM,UAAQ,YAAY,aAAa,MAAM,CAAC,CAAC,CAAC;AAAA,MAChD,gBAAgB,SAAS,YAAY,MAAM,SAAS;AAClD,eAAO,YAAY,aAAa,MAAM,OAAO,CAAC;AAAA,MAChD;AAAA,IACF,CAAC;AACD,aAAS,iBAAiB,OAAO;AAC/B,UAAI,WAAW,KAAK,GAAG;AACrB,eAAO,MAAM,QAAQ;AAAA,MACvB;AACA,UAAI,iBAAiB,OAAO;AAC1B,eAAO,MAAM,IAAI,gBAAgB;AAAA,MACnC;AACA,UAAI,SAAS,KAAK,GAAG;AACnB,eAAOG,QAAO,iBAAiB,MAAM,QAAQ,CAAC,CAAC;AAAA,MACjD;AACA,aAAO;AAAA,IACT;AACA,aAAS,MAAM,QAAQ,MAAM,SAAS;AACpC,UAAI;AACF,eAAOD,mBAAkB,MAAM,EAAE,MAAM,MAAM,IAAI;AAAA,MACnD,SAAS,QAAQ;AAEf,eAAO,KAAK,IAAI,gBAAgB;AAChC,eAAO,UAAUA,mBAAkB,MAAM,EAAE,MAAM,MAAM,IAAI,GAAG,OAAO;AAAA,MACvE;AAAA,IACF;AACA,QAAI,UAAUF,OAAM;AAAA,MAClB,UAAU;AAAA,MACV,QAAQ,SAASgB,QAAO,GAAG;AACzB,YAAI,IAAI,GAAG;AACT,iBAAO,eAAe,IAAIP,cAAa,CAAC,CAAC,CAAC;AAAA,QAC5C;AACA,eAAO,IAAIA,cAAa,CAAC;AAAA,MAC3B;AAAA,MACA,WAAW,SAASQ,WAAU,GAAG;AAC/B,YAAI,IAAI,GAAG;AACT,iBAAO,eAAe,IAAIR,cAAa,CAAC,CAAC,CAAC;AAAA,QAC5C;AACA,eAAO,IAAIA,cAAa,CAAC;AAAA,MAC3B;AAAA,MACA,QAAQ,SAASS,QAAO,GAAG;AACzB,YAAI,IAAI,IAAI;AACV,iBAAO,eAAe,IAAIT,cAAa,CAAC,CAAC,CAAC;AAAA,QAC5C;AACA,eAAO,IAAIA,cAAa,CAAC;AAAA,MAC3B;AAAA,MACA,SAAS,SAASU,SAAQ,GAAG;AAC3B,cAAM,IAAI,MAAM,uCAAuC;AAAA,MACzD;AAAA,MACA,QAAQ,SAASC,QAAO,GAAG;AACzB,eAAO,IAAIX,cAAa,CAAC;AAAA,MAC3B;AAAA,MACA,QAAQ,SAASY,QAAO,GAAG;AACzB,eAAO,IAAIb,WAAU,EAAE,QAAQ,EAAE,IAAI,CAAAc,OAAK,QAAQA,EAAC,CAAC,CAAC;AAAA,MACvD;AAAA,IACF,CAAC;AACD,aAAS,YAAY,OAAO;AAC1B,UAAI,OAAO,KAAK,GAAG;AACjB,eAAO;AAAA,MACT;AACA,aAAO,QAAQ,KAAK;AAAA,IACtB;AAIA,aAAS,eAAe,GAAG,SAAS;AAClC,UAAI,iBAAiB,WAAW,QAAQ,mBAAmB;AAC3D,UAAI,kBAAkBlB,WAAU,CAAC,KAAKC,WAAU;AAC9C,YAAI,IAAIA,UAAS,CAAC;AAClB,YAAI,iBAAiB,WAAW,OAAO,QAAQ,mBAAmB,WAAW,QAAQ,iBAAiB;AAEtG,YAAI,EAAE,QAAQ,MAAM,KAAK,EAAE,IAAI,kBAAkB,EAAE,IAAI,gBAAgB;AACrE,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAIA,QAAI,YAAYL,OAAM;AAAA,MACpB,kBAAkB,SAAS,cAAc,GAAG,SAAS;AACnD,YAAI,cAAc,eAAe,GAAGC,OAAM;AAC1C,YAAI,gBAAgB,aAAa;AAC/B,cAAIK,eAAc,QAAW;AAC3B,wBAAY;AAAA,UACd;AACA,iBAAOA,WAAU,CAAC;AAAA,QACpB,WAAW,gBAAgB,UAAU;AACnC,iBAAO,OAAO,CAAC;AAAA,QACjB,WAAW,gBAAgB,YAAY;AACrC,cAAID,cAAa,QAAW;AAC1B,uBAAW;AAAA,UACb;AACA,iBAAOA,UAAS,CAAC;AAAA,QACnB,OAAO;AACL,cAAI,IAAI,WAAW,CAAC;AACpB,iBAAO,eAAe,GAAG,OAAO;AAAA,QAClC;AAAA,MACF;AAAA,MACA,oBAAoB,SAAS,gBAAgB,GAAG,SAAS;AACvD,eAAO;AAAA,MACT;AAAA;AAAA,MAGA,qBAAqB,SAAS,iBAAiB,GAAG,SAAS;AACzD,eAAO;AAAA,MACT;AAAA;AAAA,MAGA,kBAAkB,SAAS,cAAc,GAAG,SAAS;AACnD,eAAO,eAAe,GAAG,OAAO;AAAA,MAClC;AAAA,MACA,kBAAkB,SAAS,cAAc,GAAG,SAAS;AACnD,eAAO;AAAA,MACT;AAAA,MACA,mBAAmB,SAAS,eAAe,GAAG,SAAS;AACrD,YAAI,EAAE,OAAO,GAAG;AACd,iBAAO;AAAA,QACT;AACA,eAAO,eAAe,EAAE,IAAI,OAAO;AAAA,MACrC;AAAA,MACA,kBAAkB,SAAS,cAAc,GAAG,SAAS;AACnD,eAAOF,QAAO,eAAe,EAAE,QAAQ,CAAC,CAAC;AAAA,MAC3C;AAAA,MACA,iBAAiB,SAAS,aAAa,GAAG,SAAS;AACjD,eAAO,EAAE,IAAI,cAAc;AAAA,MAC7B;AAAA,IACF,CAAC;AACD,aAAS,eAAe,GAAG;AACzB,aAAO,IAAIU,cAAa,KAAK,cAAc,CAAC,CAAC,CAAC;AAAA,IAChD;AACA,aAAS,gBAAgB,GAAG;AAE1B,UAAI,aAAa,WAASZ,QAAO,WAAW,eAAeK,aAAYA,WAAU,KAAK,IAAI,OAAO,KAAK;AACtG,UAAI,iBAAiB,EAAE,IAAI,EAAE;AAC7B,UAAI,gBAAgB,iBAAiB,KAAK,IAAIO,cAAa,KAAK,cAAc,CAAC,IAAIJ,cAAa,CAAC,WAAW,cAAc,CAAC,CAAC,CAAC,IAAI,IAAIA,cAAa,WAAW,cAAc,CAAC;AAC5K,aAAO,EAAE,MAAM,KAAK,gBAAgB,IAAII,cAAa,KAAK,UAAU,CAAC,eAAe,IAAIJ,cAAa,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC;AAAA,IACxH;AAGA,aAAS,cAAc,KAAKc,QAAO,SAAS;AAC1C,UAAI,CAAC,YAAYA,MAAK,GAAG;AAEvB,eAAO,IAAIhB,cAAa,YAAY,GAAG,GAAG,YAAYgB,MAAK,CAAC;AAAA,MAC9D;AACA,UAAI,YAAY,GAAG,KAAK,SAAS,GAAG,GAAG;AACrC,YAAI,gBAAgB,MAAM,KAAKA,OAAM,UAAU;AAO/C,eAAO,cAAc,SAAS,GAAG;AAC/B,cAAI,eAAe,cAAc,CAAC,CAAC,KAAK,OAAO,cAAc,CAAC,EAAE,UAAU,UAAU;AAClF,gBAAI,QAAQ,UAAU,cAAc,MAAM,EAAE,OAAO,OAAO;AAC1D,gBAAI,YAAY,GAAG,GAAG;AACpB,oBAAM,IAAI,MAAM,QAAQ,CAAC;AAAA,YAC3B,OAAO;AAEL,oBAAM,IAAI,QAAQ,EAAE,QAAQ,CAAC;AAC7B,kBAAI,eAAe,OAAO;AACxB,sBAAMpB,QAAO,GAAG;AAAA,cAClB;AAAA,YACF;AAAA,UACF,WAAW,cAAc,SAAS,KAAK,eAAe,cAAc,CAAC,CAAC,KAAK,OAAO,cAAc,CAAC,EAAE,UAAU,UAAU;AACrH,gBAAI,SAAS,UAAU,cAAc,CAAC,EAAE,OAAO,OAAO;AACtD,gBAAI,WAAW,CAAC;AAChB,gBAAI,YAAY,YAAY,GAAG,IAAI,IAAI,QAAQ,IAAI,QAAQ;AAC3D,qBAAS,QAAQ,WAAW;AAC1B,kBAAI,YAAY,IAAI,GAAG;AACrB,yBAAS,KAAK,KAAK,MAAM,SAAS,CAAC,CAAC;AAAA,cACtC,WAAW,SAAS,GAAG,GAAG;AACxB,yBAAS,KAAK,KAAK,SAAS,CAAC,CAAC;AAAA,cAChC,OAAO;AACL;AAAA,cACF;AAAA,YACF;AACA,gBAAI,SAAS,WAAW,UAAU,QAAQ;AACxC,kBAAI,YAAY,GAAG,GAAG;AACpB,sBAAM,IAAIK,WAAU,QAAQ;AAAA,cAC9B,OAAO;AAEL,sBAAML,QAAO,QAAQ;AAAA,cACvB;AACA,4BAAc,OAAO,GAAG,CAAC;AAAA,YAC3B,OAAO;AAEL;AAAA,YACF;AAAA,UACF,OAAO;AAEL;AAAA,UACF;AAAA,QACF;AACA,YAAI,cAAc,WAAWoB,OAAM,WAAW,QAAQ;AAEpD,iBAAO,IAAIhB,cAAa,YAAY,GAAG,GAAGgB,MAAK;AAAA,QACjD;AACA,YAAI,cAAc,SAAS,GAAG;AAE5B,UAAAA,SAAQ,IAAIZ,WAAU,aAAa;AACnC,iBAAO,IAAIJ,cAAa,YAAY,GAAG,GAAGgB,MAAK;AAAA,QACjD;AAEA,eAAO;AAAA,MACT;AACA,UAAI,aAAa,GAAG,KAAKA,OAAM,WAAW,WAAW,KAAK,eAAeA,OAAM,WAAW,CAAC,CAAC,GAAG;AAC7F,YAAI,MAAMA,OAAM,WAAW,CAAC,EAAE;AAC9B,YAAI,OAAO,IAAI,YAAY;AACzB,iBAAO,IAAI,WAAW,GAAG;AAAA,QAC3B;AACA,eAAO,IAAId,cAAa;AAAA,MAC1B;AAEA,aAAO,IAAIF,cAAa,YAAY,GAAG,GAAGgB,MAAK;AAAA,IACjD;AAYA,aAAS,OAAO,IAAI,MAAM,UAAU,SAAS;AAC3C,UAAI,QAAQ,KAAK,MAAM;AAIvB,UAAI,YAAY,KAAK,OAAO,CAAC,OAAO,SAAS;AAC3C,YAAI,CAAC,OAAO,IAAI,GAAG;AACjB,cAAI,OAAO,MAAM,IAAI;AACrB,cAAI,OAAO,IAAI,GAAG;AAChB,mBAAO,CAAC,MAAM,IAAI;AAAA,UACpB;AAEA,cAAI;AACF,kBAAM,KAAK,MAAM,IAAI,CAAC,MAAM,IAAI,GAAG,OAAO,CAAC;AAC3C,mBAAO;AAAA,UACT,SAAS,mBAAmB;AAC1B,kBAAM,KAAK,IAAI;AAAA,UAEjB;AAAA,QACF;AAIA,cAAM,KAAK,YAAY,MAAM,IAAI,CAAC,CAAC;AACnC,YAAI,UAAU,MAAM,WAAW,IAAI,MAAM,CAAC,IAAI,SAAS,KAAK;AAC5D,eAAO,CAAC,SAAS,CAAC,SAAS,YAAY,IAAI,CAAC,CAAC,CAAC;AAAA,MAChD,GAAG,CAAC,KAAK,CAAC;AACV,UAAI,UAAU,WAAW,GAAG;AAC1B,eAAO,UAAU,CAAC;AAAA,MACpB;AAEA,aAAO,SAAS,CAAC,UAAU,CAAC,GAAG,QAAQ,UAAU,CAAC,CAAC,CAAC,CAAC;AAAA,IACvD;AAGA,aAAS,aAAa,MAAM,SAAS;AACnC,cAAQ,KAAK,MAAM;AAAA,QACjB,KAAK;AACH,iBAAO;AAAA,QACT,KAAK;AACH,kBAAQ,OAAO,KAAK,OAAO;AAAA,YACzB,KAAK;AACH,qBAAO,UAAU,KAAK,OAAO,OAAO;AAAA,YACtC,KAAK;AACH,qBAAO,UAAU,KAAK,OAAO,OAAO;AAAA,YACtC,KAAK;AACH,qBAAO,KAAK;AAAA,YACd;AACE,kBAAI,CAAC,MAAM,KAAK,KAAK,EAAG,QAAO,UAAU,KAAK,OAAO,OAAO;AAAA,UAChE;AACA,iBAAO;AAAA,QACT,KAAK;AACH,cAAIrB,mBAAkB,KAAK,IAAI,KAAKA,mBAAkB,KAAK,IAAI,EAAE,SAAS;AACxE,mBAAO;AAAA,UACT;AACA;AAEE,gBAAI,oBAAoB,CAAC,OAAO,UAAU;AAC1C,gBAAI,CAAC,kBAAkB,SAAS,KAAK,IAAI,GAAG;AAC1C,kBAAI,OAAO,KAAK,KAAK,IAAI,CAAAsB,SAAO,aAAaA,MAAK,OAAO,CAAC;AAG1D,kBAAI,CAAC,KAAK,KAAK,MAAM,GAAG;AACtB,oBAAI;AACF,yBAAO,MAAM,KAAK,MAAM,MAAM,OAAO;AAAA,gBACvC,SAAS,mBAAmB;AAAA,gBAAC;AAAA,cAC/B;AAGA,kBAAI,KAAK,SAAS,UAAU,KAAK,WAAW,KAAK,YAAY,KAAK,CAAC,CAAC,GAAG;AACrE,oBAAI,KAAK,CAAC;AACV,oBAAI,UAAU,KAAK,CAAC;AACpB,uBAAO,YAAY,OAAO,GAAG;AAC3B,qBAAG,KAAK,QAAQ,MAAM,MAAM;AAC5B,4BAAU,QAAQ,MAAM,CAAC;AAAA,gBAC3B;AACA,uBAAOrB,QAAO,EAAE;AAAA,cAClB;AAGA,qBAAO,IAAIO,cAAa,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC;AAAA,YAC1D,OAAO;AAAA,YAEP;AAAA,UACF;AAAA;AAAA,QAEF,KAAK,gBACH;AACE,cAAI,KAAK,KAAK,GAAG,SAAS;AAC1B,cAAI;AACJ,cAAI;AACJ,cAAI,WAAW,uBAAuB,IAAI;AAC1C,cAAI,eAAe,IAAI,KAAK,KAAK,QAAQ,GAAG;AAC1C,oBAAQ,CAAC,aAAa,KAAK,KAAK,CAAC,GAAG,OAAO,CAAC;AAC5C,gBAAI,CAAC,OAAO,MAAM,CAAC,CAAC,GAAG;AACrB,oBAAM,MAAM,IAAI,OAAO,OAAO;AAAA,YAChC,OAAO;AACL,oBAAM,SAAS,KAAK;AAAA,YACtB;AAAA,UACF,WAAW,cAAc,MAAM,QAAQ,OAAO,GAAG;AAC/C,oBAAQ,YAAY,MAAM,QAAQ,OAAO;AACzC,oBAAQ,MAAM,IAAI,CAAAc,SAAO,aAAaA,MAAK,OAAO,CAAC;AACnD,gBAAI,cAAc,IAAI,QAAQ,OAAO,GAAG;AAEtC,kBAAI,SAAS,CAAC;AACd,kBAAI,OAAO,CAAC;AACZ,uBAASC,KAAI,GAAGA,KAAI,MAAM,QAAQA,MAAK;AACrC,oBAAI,CAAC,OAAO,MAAMA,EAAC,CAAC,GAAG;AACrB,yBAAO,KAAK,MAAMA,EAAC,CAAC;AAAA,gBACtB,OAAO;AACL,uBAAK,KAAK,MAAMA,EAAC,CAAC;AAAA,gBACpB;AAAA,cACF;AACA,kBAAI,OAAO,SAAS,GAAG;AACrB,sBAAM,OAAO,IAAI,QAAQ,UAAU,OAAO;AAC1C,qBAAK,QAAQ,GAAG;AAChB,sBAAM,OAAO,IAAI,MAAM,UAAU,OAAO;AAAA,cAC1C,OAAO;AAEL,sBAAM,OAAO,IAAI,OAAO,UAAU,OAAO;AAAA,cAC3C;AAAA,YACF,OAAO;AAEL,oBAAM,OAAO,IAAI,OAAO,UAAU,OAAO;AAAA,YAC3C;AAAA,UACF,OAAO;AAEL,oBAAQ,KAAK,KAAK,IAAI,CAAAD,SAAO,aAAaA,MAAK,OAAO,CAAC;AACvD,kBAAM,OAAO,IAAI,OAAO,UAAU,OAAO;AAAA,UAC3C;AACA,iBAAO;AAAA,QACT;AAAA,QACF,KAAK;AAEH,iBAAO,aAAa,KAAK,SAAS,OAAO;AAAA,QAC3C,KAAK;AACH,iBAAO,cAAc,aAAa,KAAK,QAAQ,OAAO,GAAG,aAAa,KAAK,OAAO,OAAO,GAAG,OAAO;AAAA,QACrG,KAAK,aACH;AACE,cAAI,YAAY,KAAK,MAAM,IAAI,UAAQ,aAAa,MAAM,OAAO,CAAC;AAClE,cAAI,UAAU,KAAK,MAAM,GAAG;AAC1B,mBAAO,IAAIhB,WAAU,UAAU,IAAI,WAAW,CAAC;AAAA,UACjD;AAEA,iBAAOL,QAAO,SAAS;AAAA,QACzB;AAAA,QACF,KAAK,aACH;AACE,iBAAO,IAAIQ,WAAU,KAAK,WAAW,IAAI,OAAKI,kBAAiB,GAAG,OAAO,CAAC,CAAC;AAAA,QAC7E;AAAA,QACF,KAAK,cACH;AACE,cAAI,YAAY,CAAC;AACjB,mBAAS,QAAQ,KAAK,YAAY;AAChC,sBAAU,IAAI,IAAIA,kBAAiB,KAAK,WAAW,IAAI,GAAG,OAAO;AAAA,UACnE;AACA,iBAAO,IAAIH,YAAW,SAAS;AAAA,QACjC;AAAA,QACF,KAAK;AAAA;AAAA,QAEL,KAAK;AAAA;AAAA,QAEL,KAAK;AAAA;AAAA,QAEL,KAAK;AAAA;AAAA,QAEL,KAAK;AAAA;AAAA,QAEL;AACE,gBAAM,IAAI,MAAM,gDAAgD,OAAO,KAAK,IAAI,CAAC;AAAA,MACrF;AAAA,IACF;AACA,WAAOG;AAAA,EACT,CAAC;;;AC9cD,MAAIW,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,SAAS,SAAS,UAAU,OAAO,YAAY,YAAY,UAAU,OAAO,gBAAgB,aAAa,gBAAgB,gBAAgB,aAAa,cAAc,gBAAgB,mBAAmB,YAAY;AACzO,MAAI,qBAAoC,wBAAQD,SAAMC,iBAAc,UAAQ;AACjF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,OAAAC;AAAA,MACA,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,KAAAC;AAAA,MACA,UAAAC;AAAA,MACA,UAAAC;AAAA,MACA,QAAAC;AAAA,MACA,KAAAC;AAAA,MACA,cAAAC;AAAA,MACA,WAAAC;AAAA,MACA,cAAAC;AAAA,MACA,cAAAC;AAAA,MACA,WAAAC;AAAA,MACA,YAAAC;AAAA,MACA,cAAAC;AAAA,MACA,iBAAAC;AAAA,MACA,YAAAC;AAAA,IACF,IAAI;AACJ,QAAI,QAAQ,IAAIN,cAAa,CAAC;AAC9B,QAAI,QAAQ,IAAIA,cAAa,CAAC;AAC9B,QAAI,QAAQ,IAAIA,cAAa,IAAI;AACjC,QAAI,QAAQ,IAAIA,cAAa,KAAK;AAGlC,aAAS,gBAAgB,MAAM;AAC7B,aAAO,eAAe,IAAI,KAAK,CAAC,OAAO,OAAO,IAAI,EAAE,SAAS,KAAK,EAAE;AAAA,IACtE;AACA,QAAI;AAAA,MACF,aAAAO;AAAA,MACA;AAAA,IACF,IAAI,WAAW;AAAA,MACb,cAAAN;AAAA,MACA,cAAAG;AAAA,MACA,YAAAE;AAAA,IACF,CAAC;AA6CD,aAAS,cAAc,gBAAgB;AACrC,UAAI,UAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAC;AACnF,UAAI,UAAU,UAAU,QAAQ,UAAU;AAC1C,UAAIC,aAAY,gBAAgB,WAAW,OAAO,GAAG;AAGnD,YAAI,eAAe,cAAc,KAAK,eAAe,KAAK,WAAW,GAAG;AACtE,iBAAO,cAAc,eAAe,KAAK,CAAC,GAAG,OAAO;AAAA,QACtD;AAEA,YAAI,YAAY;AAChB,YAAI,aAAa;AACjB,uBAAe,QAAQ,OAAK;AAC1B,YAAE;AACF,cAAI,eAAe,GAAG;AACpB,wBAAY,cAAc,GAAG,OAAO;AAAA,UACtC;AAAA,QACF,CAAC;AACD,YAAI,eAAe,GAAG;AACpB,iBAAO;AAAA,QACT;AAAA,MACF;AACA,UAAI,OAAO;AACX,UAAI,eAAe,IAAI,GAAG;AACxB,YAAI,KAAK,YAAY,KAAK,IAAI;AAC9B,YAAI,IAAI;AAEN,cAAI,KAAK,KAAK,SAAS,KAAKA,aAAY,MAAM,eAAe,OAAO,GAAG;AAErE,mBAAO,KAAK,KAAK,SAAS,GAAG;AAC3B,kBAAI,OAAO,KAAK,KAAK,IAAI;AACzB,kBAAI,UAAU,KAAK,KAAK,IAAI;AAC5B,mBAAK,KAAK,KAAK,IAAIH,cAAa,IAAI,KAAK,MAAM,CAAC,MAAM,OAAO,CAAC,CAAC;AAAA,YACjE;AAAA,UACF;AACA,iBAAO,IAAIA,cAAa,IAAI,KAAK,MAAM,KAAK,IAAI;AAAA,QAClD,OAAO;AACL,iBAAO,IAAIH,cAAa,cAAc,KAAK,EAAE,GAAG,KAAK,KAAK,IAAI,OAAK,cAAc,GAAG,OAAO,CAAC,CAAC;AAAA,QAC/F;AAAA,MACF;AACA,UAAI,eAAe,IAAI,KAAK,KAAK,QAAQ,GAAG;AAC1C,YAAI,KAAK,cAAc,KAAK,KAAK,CAAC,GAAG,OAAO;AAC5C,YAAI,KAAK,OAAO,KAAK;AAEnB,cAAI,eAAe,EAAE,KAAK,GAAG,QAAQ,KAAK,GAAG,OAAO,KAAK;AACvD,mBAAO,GAAG,KAAK,CAAC;AAAA,UAClB;AAAA,QACF;AACA,YAAI,KAAK,OAAO,OAAO;AAErB,cAAI,eAAe,EAAE,KAAK,GAAG,QAAQ,KAAK,GAAG,OAAO,OAAO;AAIzD,gBAAI,gBAAgB,GAAG,KAAK,CAAC,CAAC,GAAG;AAC/B,qBAAO,GAAG,KAAK,CAAC;AAAA,YAClB;AAAA,UACF;AAAA,QACF;AACA,YAAI,SAAS;AACb,YAAI,KAAK,OAAO,KAAK;AAEnB,cAAI,eAAe,EAAE,GAAG;AACtB,gBAAI,GAAG,SAAS,KAAK,GAAG,OAAO,YAAY;AACzC,qBAAO,IAAIG,cAAa,KAAK,YAAY,CAAC,GAAG,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC;AACjE,uBAAS;AAAA,YACX;AACA,gBAAI,GAAG,QAAQ,KAAK,GAAG,OAAO,KAAK;AACjC,qBAAO,GAAG,KAAK,CAAC;AAAA,YAClB;AAAA,UACF;AAAA,QACF;AACA,YAAI,OAAQ,QAAO,IAAIA,cAAa,KAAK,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;AAAA,MAC5D;AACA,UAAI,eAAe,IAAI,KAAK,KAAK,SAAS,GAAG;AAC3C,YAAI,KAAK,cAAc,KAAK,KAAK,CAAC,GAAG,OAAO;AAC5C,YAAI,KAAK,cAAc,KAAK,KAAK,CAAC,GAAG,OAAO;AAC5C,YAAI,KAAK,OAAO,KAAK;AACnB,cAAI,eAAe,EAAE,KAAKZ,QAAO,GAAG,KAAK,GAAG;AAC1C,mBAAO;AAAA,UACT;AACA,cAAI,eAAe,EAAE,KAAKA,QAAO,GAAG,KAAK,GAAG;AAC1C,mBAAO;AAAA,UACT;AACA,cAAI,eAAe,EAAE,KAAK,GAAG,QAAQ,KAAK,GAAG,OAAO,KAAK;AACvD,iBAAK,GAAG,KAAK,CAAC;AACd,mBAAO,IAAIY,cAAa,KAAK,YAAY,CAAC,IAAI,EAAE,CAAC;AAAA,UACnD;AAAA,QACF;AACA,YAAI,KAAK,OAAO,KAAK;AACnB,cAAI,eAAe,EAAE,KAAK,GAAG,QAAQ,KAAK,GAAG,OAAO,KAAK;AACvD,mBAAO,cAAc,IAAIA,cAAa,KAAK,OAAO,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,OAAO;AAAA,UAC9E;AACA,cAAI,eAAe,EAAE,KAAKZ,QAAO,GAAG,KAAK,GAAG;AAC1C,mBAAO,cAAc,IAAIY,cAAa,KAAK,cAAc,CAAC,EAAE,CAAC,CAAC;AAAA,UAChE;AACA,cAAI,eAAe,EAAE,KAAKZ,QAAO,GAAG,KAAK,GAAG;AAC1C,mBAAO;AAAA,UACT;AACA,iBAAO,IAAIY,cAAa,KAAK,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;AAAA,QACpD;AACA,YAAI,KAAK,OAAO,KAAK;AACnB,cAAI,eAAe,EAAE,GAAG;AACtB,gBAAIZ,QAAO,GAAG,KAAK,GAAG;AACpB,qBAAO;AAAA,YACT,WAAWD,OAAM,GAAG,OAAO,CAAC,GAAG;AAC7B,qBAAO;AAAA,YACT;AAAA,UACF;AACA,cAAI,eAAe,EAAE,GAAG;AACtB,gBAAIC,QAAO,GAAG,KAAK,GAAG;AACpB,qBAAO;AAAA,YACT,WAAWD,OAAM,GAAG,OAAO,CAAC,GAAG;AAC7B,qBAAO;AAAA,YACT;AACA,gBAAI,cAAc,MAAM,OAAO,GAAG;AAChC,qBAAO,IAAIa,cAAa,KAAK,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE,GAAG,KAAK,QAAQ;AAAA,YACnE;AAAA,UACF;AACA,iBAAO,IAAIA,cAAa,KAAK,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE,GAAG,KAAK,QAAQ;AAAA,QACnE;AACA,YAAI,KAAK,OAAO,KAAK;AACnB,cAAI,eAAe,EAAE,KAAKZ,QAAO,GAAG,KAAK,GAAG;AAC1C,mBAAO;AAAA,UACT;AACA,cAAI,eAAe,EAAE,KAAKD,OAAM,GAAG,OAAO,CAAC,GAAG;AAC5C,mBAAO;AAAA,UACT;AACA,iBAAO,IAAIa,cAAa,KAAK,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;AAAA,QACpD;AACA,YAAI,KAAK,OAAO,KAAK;AACnB,cAAI,eAAe,EAAE,GAAG;AACtB,gBAAIZ,QAAO,GAAG,KAAK,GAAG;AACpB,qBAAO;AAAA,YACT,WAAWD,OAAM,GAAG,OAAO,CAAC,GAAG;AAC7B,qBAAO;AAAA,YACT;AAAA,UACF;AAAA,QACF;AACA,YAAI,KAAK,OAAO,OAAO;AACrB,cAAI,eAAe,EAAE,GAAG;AACtB,gBAAI,GAAG,OAAO;AACZ,kBAAI,gBAAgB,EAAE,EAAG,QAAO;AAChC,kBAAI,eAAe,EAAE,GAAG;AACtB,uBAAO,GAAG,QAAQ,QAAQ;AAAA,cAC5B;AAAA,YACF,OAAO;AACL,qBAAO;AAAA,YACT;AAAA,UACF;AACA,cAAI,eAAe,EAAE,GAAG;AACtB,gBAAI,GAAG,OAAO;AACZ,kBAAI,gBAAgB,EAAE,EAAG,QAAO;AAAA,YAClC,OAAO;AACL,qBAAO;AAAA,YACT;AAAA,UACF;AAAA,QACF;AACA,YAAI,KAAK,OAAO,MAAM;AACpB,cAAI,eAAe,EAAE,GAAG;AACtB,gBAAI,GAAG,OAAO;AACZ,qBAAO;AAAA,YACT,OAAO;AACL,kBAAI,gBAAgB,EAAE,EAAG,QAAO;AAAA,YAClC;AAAA,UACF;AACA,cAAI,eAAe,EAAE,GAAG;AACtB,gBAAI,GAAG,OAAO;AACZ,qBAAO;AAAA,YACT,OAAO;AACL,kBAAI,gBAAgB,EAAE,EAAG,QAAO;AAAA,YAClC;AAAA,UACF;AAAA,QACF;AACA,eAAO,IAAIa,cAAa,KAAK,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;AAAA,MACpD;AACA,UAAI,eAAe,IAAI,GAAG;AACxB,eAAO,IAAIA,cAAa,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,OAAK,cAAc,GAAG,OAAO,CAAC,CAAC;AAAA,MACzF;AACA,UAAI,YAAY,IAAI,GAAG;AACrB,eAAO,IAAIL,WAAU,KAAK,MAAM,IAAI,OAAK,cAAc,GAAG,OAAO,CAAC,CAAC;AAAA,MACrE;AACA,UAAI,eAAe,IAAI,GAAG;AACxB,eAAO,IAAID,cAAa,cAAc,KAAK,QAAQ,OAAO,GAAG,cAAc,KAAK,OAAO,OAAO,CAAC;AAAA,MACjG;AACA,UAAI,YAAY,IAAI,GAAG;AACrB,eAAO,IAAII,WAAU,KAAK,WAAW,IAAI,OAAK,cAAc,GAAG,OAAO,CAAC,CAAC;AAAA,MAC1E;AACA,UAAI,aAAa,IAAI,GAAG;AACtB,YAAI,WAAW,CAAC;AAChB,iBAAS,QAAQ,KAAK,YAAY;AAChC,mBAAS,IAAI,IAAI,cAAc,KAAK,WAAW,IAAI,GAAG,OAAO;AAAA,QAC/D;AACA,eAAO,IAAIC,YAAW,QAAQ;AAAA,MAChC;AAEA,aAAO;AAAA,IACT;AACA,WAAOd,OAAMF,SAAM;AAAA,MACjB,MAAM;AAAA,MACN,eAAe;AAAA,IACjB,CAAC;AAAA,EACH,CAAC;;;AC/RD,MAAIqB,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,SAAS,gBAAgB,gBAAgB,gBAAgB,iBAAiB;AAChG,MAAI,gBAA+B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC5E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,OAAAC;AAAA,MACA,cAAAC;AAAA,MACA,cAAAC;AAAA,MACA,cAAAC;AAAA,MACA,iBAAAC;AAAA,IACF,IAAI;AA2BJ,aAAS,SAAS,MAAM,OAAO;AAC7B,UAAI,SAAS,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,oBAAI,IAAI;AAIzF,UAAI,CAAC,OAAO;AACV,eAAO;AAAA,MACT;AACA,UAAI,aAAa,IAAI,GAAG;AACtB,YAAI,OAAO,IAAI,KAAK,IAAI,GAAG;AACzB,cAAI,YAAY,MAAM,KAAK,MAAM,EAAE,KAAK,IAAI;AAC5C,gBAAM,IAAI,eAAe,iDAAiD,OAAO,WAAW,GAAG,CAAC;AAAA,QAClG;AACA,YAAI,QAAQ,MAAM,IAAI,KAAK,IAAI;AAC/B,YAAI,OAAO,KAAK,GAAG;AACjB,cAAI,aAAa,IAAI,IAAI,MAAM;AAC/B,qBAAW,IAAI,KAAK,IAAI;AACxB,iBAAO,SAAS,OAAO,OAAO,UAAU;AAAA,QAC1C,WAAW,OAAO,UAAU,UAAU;AACpC,iBAAOJ,OAAM,OAAO,KAAK,CAAC;AAAA,QAC5B,WAAW,UAAU,QAAW;AAC9B,iBAAO,IAAIC,cAAa,KAAK;AAAA,QAC/B,OAAO;AACL,iBAAO;AAAA,QACT;AAAA,MACF,WAAW,eAAe,IAAI,GAAG;AAC/B,YAAI,OAAO,KAAK,KAAK,IAAI,SAAUI,MAAK;AACtC,iBAAO,SAASA,MAAK,OAAO,MAAM;AAAA,QACpC,CAAC;AACD,eAAO,IAAIF,cAAa,KAAK,IAAI,KAAK,IAAI,MAAM,KAAK,QAAQ;AAAA,MAC/D,WAAW,kBAAkB,IAAI,GAAG;AAClC,eAAO,IAAIC,iBAAgB,SAAS,KAAK,SAAS,OAAO,MAAM,CAAC;AAAA,MAClE,WAAW,eAAe,IAAI,GAAG;AAC/B,YAAI,QAAQ,KAAK,KAAK,IAAI,SAAUC,MAAK;AACvC,iBAAO,SAASA,MAAK,OAAO,MAAM;AAAA,QACpC,CAAC;AACD,eAAO,IAAIH,cAAa,KAAK,MAAM,KAAK;AAAA,MAC1C;AAIA,aAAO,KAAK,IAAI,WAAS,SAAS,OAAO,OAAO,MAAM,CAAC;AAAA,IACzD;AACA,WAAOH,OAAM,WAAW;AAAA,MACtB,MAAM;AAAA,MACN,gCAAgC;AAAA,MAChC,gBAAgB,CAAC,GAAG,UAAU,SAAS,GAAG,UAAU,KAAK,CAAC;AAAA;AAAA;AAAA;AAAA,MAI1D,kBAAkBA,OAAM,YAAY,CAAAO,UAAQ,OAAK,EAAE,IAAI,OAAKA,MAAK,CAAC,CAAC,CAAC;AAAA,MACpE,oCAAoCP,OAAM,YAAY,CAAAO,UAAQ,OAAK,EAAE,IAAI,OAAKA,MAAK,CAAC,CAAC,CAAC;AAAA,MACtF,iBAAiBP,OAAM,QAAQ,aAAa,YAAU,CAAC,GAAG,UAAU,OAAO,GAAG,UAAU,KAAK,CAAC,CAAC;AAAA,MAC/F,kBAAkBA,OAAM,QAAQ,cAAc,YAAU,CAAC,GAAG,UAAU,OAAO,GAAG,UAAU,KAAK,CAAC,CAAC;AAAA,MACjG,uBAAuBA,OAAM,YAAY,CAAAO,UAAQ,CAAC,GAAG,UAAU,EAAE,IAAI,OAAKA,MAAK,GAAG,KAAK,CAAC,CAAC;AAAA,IAC3F,CAAC;AAAA,EACH,CAAC;;;AC9FD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,YAAY,SAAS,cAAc;AACzD,MAAI,sBAAqC,wBAAQD,SAAMC,iBAAc,UAAQ;AAClF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,UAAAC;AAAA,MACA,OAAAC;AAAA,MACA,cAAAC;AAAA,IACF,IAAI;AAuCJ,aAAS,eAAe,IAAIC,KAAI;AAC9B,UAAI,UAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAC;AACnF,UAAIC,QAAO,IAAIF,cAAa,KAAK,YAAY,CAAC,IAAIC,GAAE,CAAC;AACrD,UAAI,aAAaH,UAASI,OAAM,CAAC,GAAG,OAAO;AAC3C,aAAO,eAAe,UAAU,KAAK,CAAC,WAAW;AAAA,IACnD;AACA,WAAOH,OAAMJ,SAAM;AAAA,MACjB,cAAc;AAAA,MACd,sBAAsB;AAAA,IACxB,CAAC;AAAA,EACH,CAAC;;;ACxDD,MAAIQ,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,SAAS,YAAY,SAAS,UAAU,WAAW,gBAAgB,gBAAgB,gBAAgB,mBAAmB,YAAY;AAClK,MAAI,mBAAkC,wBAAQD,SAAMC,iBAAc,UAAQ;AAC/E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,OAAAC;AAAA,MACA,UAAAC;AAAA,MACA,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,MACA,cAAAC;AAAA,MACA,cAAAC;AAAA,MACA,cAAAC;AAAA,MACA,iBAAAC;AAAA,MACA,YAAAC;AAAA,IACF,IAAI;AAuCJ,aAAS,gBAAgB,MAAM,UAAU;AACvC,UAAI,UAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAAA,QAChF,UAAU;AAAA,MACZ;AACA,UAAIC,SAAQ,oBAAI,IAAI;AACpB,UAAI,eAAe,SAAS;AAC5B,eAAS,cAAc,MAAM;AAC3B,YAAI,SAASA,OAAM,IAAI,IAAI;AAC3B,YAAI,WAAW,QAAW;AACxB,iBAAO;AAAA,QACT;AACA,YAAIC,OAAM,SAAS,eAAe,MAAM,YAAY;AACpD,QAAAD,OAAM,IAAI,MAAMC,IAAG;AACnB,eAAOA;AAAA,MACT;AACA,UAAI,MAAM,YAAY,MAAM,aAAa;AACzC,aAAO,QAAQ,WAAWV,UAAS,GAAG,IAAI;AAAA,IAC5C;AACA,aAAS,gBAAgBW,SAAQ;AAC/B,UAAI,SAASZ,OAAMY,OAAM;AACzB,UAAI,CAAC,OAAO,cAAc;AACxB,cAAM,IAAI,UAAU,uBAAuB,gBAAgB,OAAO,KAAK,UAAUA,OAAM,GAAG,yCAAyC,CAAC;AAAA,MACtI;AACA,aAAO;AAAA,IACT;AACA,QAAIC,cAAaf,OAAMF,SAAM;AAAA,MAC3B,oBAAoB;AAAA,MACpB,4BAA4B;AAAA,MAC5B,gBAAgB,CAAC,MAAM,WAAW,gBAAgB,MAAM,gBAAgB,MAAM,CAAC;AAAA,MAC/E,wBAAwB,CAAC,MAAM,QAAQ,YAAY,gBAAgB,MAAM,gBAAgB,MAAM,GAAG,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAY3G,CAAC;AACD,IAAAiB,YAAW,YAAY;AACvB,IAAAA,YAAW,QAAQ,SAAU,OAAO;AAClC,aAAO,UAAU,MAAM,MAAM,MAAM,IAAI;AAAA,IACzC;AAIA,QAAI,YAAYf,OAAM,aAAa;AAAA,MACjC,oBAAoB,SAAS,gBAAgB,MAAM,GAAG;AACpD,YAAI,eAAe,IAAI,KAAK,OAAO,KAAK,KAAK,MAAM,UAAU;AAC3D,iBAAO,UAAUE,OAAM,KAAK,KAAK,EAAE,SAAS,GAAG,EAAE,SAAS,GAAG,CAAC;AAAA,QAChE,OAAO;AACL,iBAAO,UAAU,KAAK,MAAM,GAAG,EAAE,SAAS,GAAG,CAAC;AAAA,QAChD;AAAA,MACF;AAAA,MACA,sBAAsB,SAAS,kBAAkB,MAAM,GAAG;AACxD,YAAI,OAAO,EAAE,KAAK,MAAM,UAAU;AAChC,iBAAO,UAAU,MAAMA,OAAM,EAAE,KAAK,CAAC;AAAA,QACvC,OAAO;AACL,gBAAM,IAAI,MAAM,+DAA+D;AAAA,QACjF;AAAA,MACF;AAAA,MACA,kCAAkC,SAAS,6BAA6B,MAAM,GAAG,OAAO;AACtF,eAAO,UAAU,KAAK,SAAS,GAAG,EAAE,MAAM,MAAM,KAAK;AAAA,MACvD;AAAA,MACA,0BAA0B,SAAS,qBAAqB,MAAM,GAAG,OAAO;AACtE,YAAI;AACJ,YAAI,UAAU,GAAG;AACf,cAAI,eAAe,IAAI;AAAA,QACzB,OAAO;AACL,cAAI,SAAS,QAAQ,cAAc,IAAI,OAAO,QAAQ;AAAA,QACxD;AACA,eAAO,IAAI,UAAU,OAAO,MAAM,UAAU;AAAA,MAC9C;AAAA,IACF,CAAC;AAgBD,QAAI,WAAWF,OAAM,YAAY;AAAA,MAC/B,kCAAkC,SAAS,+BAA+B;AACxE,eAAO;AAAA,MACT;AAAA,MACA,gCAAgC,SAAS,2BAA2B,SAAS,MAAM,SAAS;AAG1F,eAAO,KAAK,SAAS;AAAA,MACvB;AAAA,MACA,qCAAqC,SAAS,gCAAgC,SAAS,MAAM,SAAS;AACpG,eAAO,QAAQ,KAAK,SAAS,OAAO;AAAA,MACtC;AAAA,MACA,4CAA4C,SAAS,uCAAuC,SAAS,MAAM,SAAS;AAClH,YAAI,CAAC,KAAK,OAAO,SAAS,OAAO,GAAG;AAClC,iBAAO;AAAA,QACT;AACA,eAAO,QAAQ,KAAK,MAAM,OAAO;AAAA,MACnC;AAAA,MACA,iDAAiD,SAAS,2CAA2C,SAAS,MAAM,SAAS;AAC3H,eAAO,KAAK,KAAK,MAAM,CAAAgB,SAAO,QAAQA,MAAK,OAAO,CAAC;AAAA,MACrD;AAAA,IACF,CAAC;AASD,QAAI,cAAchB,OAAM,eAAe;AAAA,MACrC,0BAA0B,SAAS,wBAAwB;AACzD,eAAOiB,oBAAmB,CAAC;AAAA,MAC7B;AAAA,MACA,wBAAwB,SAAS,oBAAoB,MAAM,SAAS;AAClE,YAAI,QAAQ,IAAI,GAAG;AACjB,iBAAOA,oBAAmB,CAAC;AAAA,QAC7B;AACA,eAAOA,oBAAmB,CAAC;AAAA,MAC7B;AAAA,MACA,6BAA6B,SAAS,yBAAyB,MAAM,SAAS;AAC5E,eAAO,IAAIP,iBAAgB,YAAY,KAAK,SAAS,OAAO,CAAC;AAAA,MAC/D;AAAA,MACA,oCAAoC,SAAS,gCAAgC,MAAM,SAAS;AAC1F,YAAI,QAAQ,IAAI,GAAG;AACjB,iBAAOO,oBAAmB,CAAC;AAAA,QAC7B;AACA,eAAO,YAAY,KAAK,MAAM,OAAO;AAAA,MACvC;AAAA,MACA,0BAA0B,SAAS,sBAAsB,MAAM,SAAS;AACtE,YAAI,QAAQ,IAAI,GAAG;AACjB,iBAAOA,oBAAmB,CAAC;AAAA,QAC7B;AACA,YAAI,OAAO,KAAK,KAAK,CAAC;AACtB,YAAI;AACJ,YAAIC,OAAM;AACV,YAAI,WAAW;AAEf,YAAI;AACJ,gBAAQ,KAAK,MAAM;AAAA,UACjB,KAAK;AAEH,YAAAA,OAAM;AACN,6BAAiB,IAAIT,cAAa,KAAK,YAAY,CAACQ,oBAAmB,CAAC,GAAG,IAAIR,cAAa,KAAK,OAAO,CAAC,MAAM,IAAIA,cAAa,KAAK,UAAU,CAACQ,oBAAmB,CAAC,GAAGA,oBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACjM;AAAA,UACF,KAAK;AAAA,UACL,KAAK;AAEH,gBAAI,KAAK,KAAK,WAAW,GAAG;AAC1B,cAAAC,OAAM;AACN,+BAAiB,IAAIT,cAAa,KAAK,YAAY,CAACQ,oBAAmB,CAAC,GAAG,IAAIT,cAAa,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;AAAA,YAC9G,WAAW,KAAK,KAAK,WAAW,GAAG;AAEjC,qBAAO,IAAIC,cAAa,KAAK,UAAU,CAACQ,oBAAmB,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC;AAC5E,qBAAO,YAAY,IAAIR,cAAa,KAAK,OAAO,CAAC,MAAM,IAAI,CAAC,GAAG,OAAO;AAAA,YACxE;AACA;AAAA,UACF,KAAK;AACH,mBAAOQ,oBAAmB,EAAE;AAAA;AAAA,UAE9B,KAAK;AACH,gBAAI,CAAC,QAAQ,KAAK,KAAK,WAAW,GAAG;AAEnC,+BAAiB,KAAK,MAAM;AAC5B,cAAAC,OAAM;AAAA,YACR,WAAW,KAAK,KAAK,WAAW,KAAK,QAAQ,KAAK,KAAK,WAAW,KAAK,QAAQ,KAAK,KAAK,CAAC,CAAC,GAAG;AAE5F,+BAAiB,IAAIT,cAAa,KAAK,YAAY,CAAC,KAAK,MAAM,GAAG,IAAID,cAAa,OAAO,CAAC,QAAQ,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AAClH,cAAAU,OAAM;AAAA,YACR,WAAW,KAAK,KAAK,WAAW,GAAG;AAEjC,qBAAO,YAAY,IAAIT,cAAa,KAAK,UAAU,CAAC,IAAID,cAAa,OAAO,CAAC,IAAI,CAAC,GAAG,IAAIA,cAAa,OAAO,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO;AAAA,YACzI;AACA;AAAA,UACF,KAAK;AACH,gBAAI,KAAK,KAAK,WAAW,GAAG;AAE1B,qBAAO,YAAY,IAAIC,cAAa,KAAK,OAAO,CAAC,MAAM,KAAK,KAAK,CAAC,CAAC,CAAC,GAAG,OAAO;AAAA,YAChF;AACA;AAAA,UACF,KAAK;AAEH,6BAAiB,IAAID,cAAa,OAAO,CAAC,KAAK,MAAM,CAAC,CAAC;AACvD;AAAA,UACF,KAAK;AAEH,6BAAiB,IAAIA,cAAa,OAAO,CAAC,KAAK,MAAM,CAAC,CAAC;AACvD;AAAA,UACF,KAAK;AAEH,6BAAiB,IAAIC,cAAa,KAAK,cAAc,CAAC,IAAID,cAAa,OAAO,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC;AAC9F;AAAA,UACF,KAAK;AAEH,6BAAiB,IAAIC,cAAa,KAAK,OAAO,CAAC,IAAID,cAAa,OAAO,CAAC,KAAK,MAAM,CAAC,CAAC,GAAGS,oBAAmB,CAAC,CAAC,CAAC;AAC9G;AAAA,UACF,KAAK;AAEH,6BAAiB,IAAIR,cAAa,KAAK,YAAY,CAAC,MAAM,IAAID,cAAa,OAAO,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC;AAClG;AAAA,UACF,KAAK;AAEH,uBAAW;AACX,6BAAiB,IAAIC,cAAa,KAAK,YAAY,CAAC,MAAM,IAAID,cAAa,OAAO,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC;AAClG;AAAA,UACF,KAAK;AAEH,uBAAW;AACX,6BAAiB,IAAIC,cAAa,KAAK,OAAO,CAAC,IAAID,cAAa,OAAO,CAAC,KAAK,MAAM,CAAC,CAAC,GAAGS,oBAAmB,CAAC,CAAC,CAAC;AAC9G;AAAA,UACF,KAAK;AAEH,YAAAC,OAAM;AACN,6BAAiB,IAAIV,cAAa,QAAQ,CAAC,IAAIC,cAAa,KAAK,YAAY,CAACQ,oBAAmB,CAAC,GAAG,IAAIR,cAAa,KAAK,OAAO,CAAC,KAAK,MAAM,GAAGQ,oBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3K;AAAA,UACF,KAAK;AAEH,YAAAC,OAAM;AACN,uBAAW;AACX,6BAAiB,IAAIV,cAAa,QAAQ,CAAC,IAAIC,cAAa,KAAK,YAAY,CAACQ,oBAAmB,CAAC,GAAG,IAAIR,cAAa,KAAK,OAAO,CAAC,KAAK,MAAM,GAAGQ,oBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3K;AAAA,UACF,KAAK;AAEH,YAAAC,OAAM;AACN,6BAAiB,IAAIT,cAAa,KAAK,OAAO,CAAC,IAAIA,cAAa,KAAK,OAAO,CAAC,KAAK,MAAM,GAAGQ,oBAAmB,CAAC,CAAC,CAAC,GAAGA,oBAAmB,CAAC,CAAC,CAAC;AAC1I;AAAA,UACF,KAAK;AAEH,YAAAC,OAAM;AACN,6BAAiB,IAAIT,cAAa,KAAK,YAAY,CAAC,IAAID,cAAa,OAAO,CAAC,KAAK,MAAM,CAAC,CAAC,GAAG,IAAIA,cAAa,QAAQ,CAAC,IAAIC,cAAa,KAAK,YAAY,CAAC,IAAIA,cAAa,KAAK,OAAO,CAAC,KAAK,MAAM,GAAGQ,oBAAmB,CAAC,CAAC,CAAC,GAAGA,oBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACzP;AAAA,UACF,KAAK;AAEH,YAAAC,OAAM;AACN,uBAAW;AACX,6BAAiB,IAAIT,cAAa,KAAK,YAAY,CAAC,IAAID,cAAa,OAAO,CAAC,KAAK,MAAM,CAAC,CAAC,GAAG,IAAIA,cAAa,QAAQ,CAAC,IAAIC,cAAa,KAAK,YAAY,CAAC,IAAIA,cAAa,KAAK,OAAO,CAAC,KAAK,MAAM,GAAGQ,oBAAmB,CAAC,CAAC,CAAC,GAAGA,oBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACzP;AAAA,UACF,KAAK;AAEH,YAAAC,OAAM;AACN,uBAAW;AACX,6BAAiB,IAAIT,cAAa,KAAK,OAAO,CAAC,IAAIA,cAAa,KAAK,OAAO,CAAC,KAAK,MAAM,GAAGQ,oBAAmB,CAAC,CAAC,CAAC,GAAGA,oBAAmB,CAAC,CAAC,CAAC;AAC1I;AAAA,UACF,KAAK;AAEH,6BAAiB,IAAIT,cAAa,QAAQ,CAAC,KAAK,MAAM,CAAC,CAAC;AACxD;AAAA,UACF,KAAK;AAEH,6BAAiB,IAAIA,cAAa,QAAQ,CAAC,KAAK,MAAM,CAAC,CAAC;AACxD;AAAA,UACF,KAAK;AAEH,6BAAiB,IAAIC,cAAa,KAAK,OAAO,CAAC,IAAID,cAAa,QAAQ,CAAC,KAAK,MAAM,CAAC,CAAC,GAAGS,oBAAmB,CAAC,CAAC,CAAC;AAC/G;AAAA,UACF,KAAK;AAEH,uBAAW;AACX,6BAAiB,IAAIR,cAAa,KAAK,YAAY,CAAC,MAAM,IAAID,cAAa,QAAQ,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC;AACnG;AAAA,UACF,KAAK;AAEH,uBAAW;AACX,6BAAiB,IAAIC,cAAa,KAAK,YAAY,CAAC,MAAM,IAAID,cAAa,QAAQ,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC;AACnG;AAAA,UACF,KAAK;AAEH,uBAAW;AACX,6BAAiB,IAAIC,cAAa,KAAK,OAAO,CAAC,IAAID,cAAa,QAAQ,CAAC,KAAK,MAAM,CAAC,CAAC,GAAGS,oBAAmB,CAAC,CAAC,CAAC;AAC/G;AAAA,UACF,KAAK;AAEH,YAAAC,OAAM;AACN,6BAAiB,IAAIV,cAAa,QAAQ,CAAC,IAAIC,cAAa,KAAK,OAAO,CAAC,IAAIA,cAAa,KAAK,OAAO,CAAC,KAAK,MAAM,GAAGQ,oBAAmB,CAAC,CAAC,CAAC,GAAGA,oBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC;AACtK;AAAA,UACF,KAAK;AAEH,YAAAC,OAAM;AACN,6BAAiB,IAAIV,cAAa,QAAQ,CAAC,IAAIC,cAAa,KAAK,YAAY,CAAC,IAAIA,cAAa,KAAK,OAAO,CAAC,KAAK,MAAM,GAAGQ,oBAAmB,CAAC,CAAC,CAAC,GAAGA,oBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3K;AAAA,UACF,KAAK;AAEH,YAAAC,OAAM;AACN,6BAAiB,IAAIT,cAAa,KAAK,YAAY,CAACQ,oBAAmB,CAAC,GAAG,IAAIR,cAAa,KAAK,OAAO,CAAC,KAAK,MAAM,GAAGQ,oBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC;AAC/I;AAAA,UACF,KAAK;AAEH,YAAAC,OAAM;AACN,uBAAW;AACX,6BAAiB,IAAIT,cAAa,KAAK,YAAY,CAAC,KAAK,MAAM,GAAG,IAAID,cAAa,QAAQ,CAAC,IAAIC,cAAa,KAAK,YAAY,CAACQ,oBAAmB,CAAC,GAAG,IAAIR,cAAa,KAAK,OAAO,CAAC,KAAK,MAAM,GAAGQ,oBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC9N;AAAA,UACF,KAAK;AAEH,YAAAC,OAAM;AACN,uBAAW;AACX,6BAAiB,IAAIT,cAAa,KAAK,YAAY,CAAC,IAAID,cAAa,OAAO,CAAC,KAAK,MAAM,CAAC,CAAC,GAAG,IAAIA,cAAa,QAAQ,CAAC,IAAIC,cAAa,KAAK,OAAO,CAAC,IAAIA,cAAa,KAAK,OAAO,CAAC,KAAK,MAAM,GAAGQ,oBAAmB,CAAC,CAAC,CAAC,GAAGA,oBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpP;AAAA,UACF,KAAK;AAEH,YAAAC,OAAM;AACN,uBAAW;AACX,6BAAiB,IAAIT,cAAa,KAAK,YAAY,CAACQ,oBAAmB,CAAC,GAAG,IAAIR,cAAa,KAAK,OAAO,CAAC,KAAK,MAAM,GAAGQ,oBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC;AAC/I;AAAA,UACF,KAAK;AAEH,6BAAiB,IAAIR,cAAa,KAAK,UAAU,CAAC,IAAID,cAAa,IAAIG,YAAW,KAAK,GAAG,CAAC,KAAK,MAAM,CAAC,CAAC,GAAG,KAAK,MAAM,CAAC,CAAC;AACxH;AAAA,UACF,KAAK;AAAA;AAAA,UACL;AACE,kBAAM,IAAI,MAAM,8BAA8B,KAAK,OAAO,sHAA2H;AAAA,QACzL;AACA,YAAI,IAAI;AACR,YAAIO,MAAK;AACP,eAAK;AACL,iBAAO;AAAA,QACT,OAAO;AACL,eAAK;AACL,iBAAO;AAAA,QACT;AAKA,YAAI,kBAAkB,YAAY,MAAM,OAAO;AAC/C,YAAI,UAAU;AACZ,4BAAkB,IAAIT,cAAa,KAAK,cAAc,CAAC,eAAe,CAAC;AAAA,QACzE;AACA,eAAO,IAAIA,cAAa,IAAI,MAAM,CAAC,iBAAiB,cAAc,CAAC;AAAA,MACrE;AAAA,MACA,0BAA0B,SAAS,sBAAsB,MAAM,SAAS;AACtE,YAAI,QAAQ,IAAI,GAAG;AACjB,iBAAOQ,oBAAmB,CAAC;AAAA,QAC7B;AACA,YAAI,KAAK,OAAO,KAAK;AAEnB,iBAAO,IAAIR,cAAa,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,SAAUO,MAAK;AACrE,mBAAO,YAAYA,MAAK,OAAO;AAAA,UACjC,CAAC,CAAC;AAAA,QACJ;AACA,YAAI,KAAK,OAAO,KAAK;AAEnB,cAAI,KAAK,QAAQ,GAAG;AAClB,mBAAO,IAAIP,cAAa,KAAK,IAAI,KAAK,IAAI,CAAC,YAAY,KAAK,KAAK,CAAC,GAAG,OAAO,CAAC,CAAC;AAAA,UAChF;AAGA,cAAI,KAAK,SAAS,GAAG;AACnB,mBAAO,IAAIA,cAAa,KAAK,IAAI,KAAK,IAAI,CAAC,YAAY,KAAK,KAAK,CAAC,GAAG,OAAO,GAAG,YAAY,KAAK,KAAK,CAAC,GAAG,OAAO,CAAC,CAAC;AAAA,UACpH;AAAA,QACF;AACA,YAAI,KAAK,OAAO,KAAK;AAEnB,cAAI,gBAAgB,KAAK,KAAK,OAAO,SAAUO,MAAK;AAClD,mBAAO,QAAQA,IAAG;AAAA,UACpB,CAAC;AACD,cAAI,cAAc,SAAS,GAAG;AAC5B,gBAAI,mBAAmB,KAAK,KAAK,OAAO,SAAUA,MAAK;AACrD,qBAAO,CAAC,QAAQA,IAAG;AAAA,YACrB,CAAC;AACD,gBAAI,kBAAkB,iBAAiB,WAAW,IAAI,iBAAiB,CAAC,IAAI,IAAIP,cAAa,KAAK,YAAY,gBAAgB;AAC9H,gBAAI,UAAU,cAAc,OAAO,YAAY,iBAAiB,OAAO,CAAC;AACxE,mBAAO,IAAIA,cAAa,KAAK,YAAY,OAAO;AAAA,UAClD;AAGA,iBAAO,IAAIA,cAAa,KAAK,OAAO,KAAK,KAAK,IAAI,SAAU,UAAU;AACpE,mBAAO,IAAIA,cAAa,KAAK,YAAY,KAAK,KAAK,IAAI,SAAU,UAAU;AACzE,qBAAO,aAAa,WAAW,YAAY,UAAU,OAAO,IAAI,SAAS,MAAM;AAAA,YACjF,CAAC,CAAC;AAAA,UACJ,CAAC,CAAC;AAAA,QACJ;AACA,YAAI,KAAK,OAAO,OAAO,KAAK,SAAS,GAAG;AACtC,cAAI,OAAO,KAAK,KAAK,CAAC;AACtB,cAAI,OAAO,KAAK,KAAK,CAAC;AAGtB,cAAI,QAAQ,IAAI,GAAG;AACjB,mBAAO,IAAIA,cAAa,KAAK,UAAU,CAAC,YAAY,MAAM,OAAO,GAAG,IAAI,CAAC;AAAA,UAC3E;AAGA,cAAI,QAAQ,IAAI,GAAG;AACjB,mBAAO,IAAIA,cAAa,KAAK,YAAY,CAAC,IAAIA,cAAa,KAAK,cAAc,CAAC,IAAI,CAAC,GAAG,IAAIA,cAAa,KAAK,UAAU,CAAC,YAAY,MAAM,OAAO,GAAG,IAAIA,cAAa,KAAK,OAAO,CAAC,KAAK,MAAM,GAAGQ,oBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAAA,UAC5N;AAGA,iBAAO,IAAIR,cAAa,KAAK,UAAU,CAAC,IAAIA,cAAa,KAAK,YAAY,CAAC,IAAIA,cAAa,KAAK,YAAY,CAAC,YAAY,MAAM,OAAO,GAAG,KAAK,MAAM,CAAC,CAAC,GAAG,IAAIA,cAAa,KAAK,YAAY,CAAC,KAAK,MAAM,GAAG,YAAY,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,IAAIA,cAAa,KAAK,OAAO,CAAC,KAAK,MAAM,GAAGQ,oBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC;AAAA,QACjT;AACA,YAAI,KAAK,OAAO,OAAO,KAAK,SAAS,GAAG;AACtC,cAAI,OAAO,KAAK,KAAK,CAAC;AACtB,cAAI,QAAQ,KAAK,KAAK,CAAC;AACvB,cAAI,QAAQ,IAAI,GAAG;AAEjB,gBAAI,eAAe,IAAI,MAAMZ,QAAO,KAAK,KAAK,KAAKD,OAAM,KAAK,OAAO,CAAC,IAAI;AACxE,qBAAOa,oBAAmB,CAAC;AAAA,YAC7B;AAGA,mBAAO,IAAIR,cAAa,KAAK,YAAY,CAAC,MAAM,IAAIA,cAAa,KAAK,YAAY,CAAC,IAAID,cAAa,OAAO,CAAC,KAAK,MAAM,CAAC,CAAC,GAAG,YAAY,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;AAAA,UACpK;AACA,cAAI,QAAQ,KAAK,GAAG;AAClB,gBAAI,eAAe,KAAK,GAAG;AAEzB,kBAAIH,QAAO,MAAM,KAAK,GAAG;AACvB,uBAAOY,oBAAmB,CAAC;AAAA,cAC7B;AAEA,kBAAIb,OAAM,MAAM,OAAO,CAAC,GAAG;AACzB,uBAAO,YAAY,MAAM,OAAO;AAAA,cAClC;AAAA,YACF;AAGA,gBAAI,cAAc,IAAIK,cAAa,KAAK,OAAO,CAAC,KAAK,MAAM,GAAG,IAAIA,cAAa,KAAK,YAAY,CAAC,OAAOQ,oBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC;AAChI,mBAAO,IAAIR,cAAa,KAAK,YAAY,CAAC,MAAM,MAAM,GAAG,IAAIA,cAAa,KAAK,YAAY,CAAC,YAAY,MAAM,OAAO,GAAG,WAAW,CAAC,CAAC,CAAC;AAAA,UACxI;AAGA,iBAAO,IAAIA,cAAa,KAAK,YAAY,CAAC,IAAIA,cAAa,KAAK,OAAO,CAAC,KAAK,MAAM,GAAG,MAAM,MAAM,CAAC,CAAC,GAAG,IAAIA,cAAa,KAAK,OAAO,CAAC,IAAIA,cAAa,KAAK,YAAY,CAAC,YAAY,MAAM,OAAO,GAAG,IAAIA,cAAa,KAAK,UAAU,CAAC,MAAM,MAAM,GAAG,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,IAAIA,cAAa,KAAK,YAAY,CAAC,YAAY,OAAO,OAAO,GAAG,IAAID,cAAa,OAAO,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAAA,QACpX;AACA,cAAM,IAAI,MAAM,8BAA8B,KAAK,KAAK,sHAA2H;AAAA,MACrL;AAAA,IACF,CAAC;AASD,aAASS,oBAAmB,OAAO,WAAW;AAC5C,aAAO,IAAIV,cAAaD,SAAQ,OAAO,aAAa,eAAe,OAAO,KAAK,GAAGL,OAAM,CAAC,CAAC;AAAA,IAC5F;AACA,WAAOc;AAAA,EACT,CAAC;;;ACvfD,MAAII,UAAO;AACX,MAAIC,kBAAe,CAAC,UAAU,SAAS,SAAS,UAAU,OAAO,YAAY,YAAY,UAAU,OAAO,SAAS,oBAAoB,gBAAgB,YAAY,cAAc,aAAa,qBAAqB,UAAU,gBAAgB,aAAa,gBAAgB,gBAAgB,aAAa,cAAc,gBAAgB,cAAc,iBAAiB;AAC7V,MAAI,oBAAmC,wBAAQD,SAAMC,iBAAc,UAAQ;AAChF,QAAI;AAAA,MACF,QAAAC;AAAA,MACA,OAAAC;AAAA,MACA,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,KAAAC;AAAA,MACA,UAAAC;AAAA,MACA,UAAAC;AAAA,MACA,QAAAC;AAAA,MACA,KAAAC;AAAA,MACA,OAAAC;AAAA,MACA,kBAAAC;AAAA,MACA,cAAAC;AAAA,MACA,UAAAC;AAAA,MACA,UAAAC;AAAA,MACA,WAAAC;AAAA,MACA,mBAAAC;AAAA,MACA,QAAAC;AAAA,MACA,cAAAC;AAAA,MACA,WAAAC;AAAA,MACA,cAAAC;AAAA,MACA,cAAAC;AAAA,MACA,WAAAC;AAAA,MACA,YAAAC;AAAA,MACA,cAAAC;AAAA,MACA,YAAAC;AAAA,MACA,iBAAAC;AAAA,IACF,IAAI;AAsDJ,aAAS,aAAa,MAAM;AAC1B,UAAI,QAAQ,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAC;AACjF,UAAI,WAAW,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACnF,UAAI,WAAW,iBAAiB;AAChC,UAAI,UAAU,WAAW,MAAM,OAAO,MAAM,SAAS,UAAU;AAC/D,UAAI,QAAQ,QAAQ,UAAU;AAC9B,UAAI,mBAAmB;AAAA,QACrB,gBAAgB;AAAA,MAClB;AACA,UAAI,qBAAqB;AAAA,QACvB,gBAAgB;AAAA,MAClB;AACA,aAAO,QAAQ;AACf,UAAI,SAAS,GAAG;AAEd,eAAO,YAAY,IAAI;AACvB,YAAI;AACJ,YAAI;AACJ,YAAI,YAAY;AAChB,YAAI,WAAW;AAEf,eAAOb,UAAS,MAAM,SAAS,YAAY,CAAC,GAAG,gBAAgB;AAC/D,YAAI;AACJ,eAAO,MAAM;AAGX,kBAAQ,YAAY,SAAS,gBAAgB,SAAS;AACtD,iBAAOA,UAAS,MAAM,OAAO,CAAC,GAAG,kBAAkB;AACnD,sBAAY,CAAC;AAEb,cAAI,KAAK,SAAS;AAClB,cAAI,MAAM,SAAS;AACjB;AAAA,UACF;AACA,qBAAW;AACX,oBAAU;AAAA,QACZ;AACA,YAAI,UAAU;AAEZ,iBAAOA,UAAS,MAAM,SAAS,iBAAiB,CAAC,GAAG,gBAAgB;AAAA,QACtE;AAEA,eAAOA,UAAS,MAAM,SAAS,YAAY,CAAC,GAAG,gBAAgB;AAAA,MACjE;AAEA,UAAI,eAAe,CAAC;AACpB,UAAI,iBAAiB,CAAC;AACtB,UAAI,KAAK,SAAS,kBAAkB,KAAK,SAAS,KAAK,KAAK,OAAO,KAAK;AAEtE,YAAI,UAAU,GAAG;AACf,eAAK,KAAK,CAAC,IAAI,gBAAgB,KAAK,KAAK,CAAC,GAAG,YAAY;AACzD,eAAK,KAAK,CAAC,IAAI,gBAAgB,KAAK,KAAK,CAAC,CAAC;AAAA,QAC7C;AACA,YAAI,UAAU;AACZ,yBAAe,YAAY,KAAK,KAAK,CAAC;AACtC,yBAAe,cAAc,KAAK,KAAK,CAAC;AAAA,QAC1C;AAAA,MACF,OAAO;AACL,YAAI,UAAU,GAAG;AACf,iBAAO,gBAAgB,MAAM,YAAY;AAAA,QAC3C;AACA,YAAI,UAAU;AACZ,yBAAe,YAAY;AAC3B,yBAAe,cAAc;AAAA,QAC/B;AAAA,MACF;AAGA,UAAI,CAAC,SAAU,QAAO;AACtB,qBAAe,eAAe;AAC9B,qBAAe,YAAY,QAAQ;AACnC,qBAAe,aAAa;AAC5B,aAAO;AAAA,IACT;AACA,WAAOX,OAAMH,SAAM;AAAA,MACjB,MAAM;AAAA,MACN,iBAAiB,CAAC,MAAM,aAAa,aAAa,MAAM,CAAC,GAAG,QAAQ;AAAA,MACpE,gBAAgB;AAAA,MAChB,yBAAyB;AAAA,IAC3B,CAAC;AAsBD,aAAS,WAAW,MAAM,OAAO,UAAU,OAAO;AAChD,UAAI,YAAY,CAAC;AACjB,UAAI,OAAOc,UAAS,MAAM,OAAO,OAAO;AAAA,QACtC,gBAAgB;AAAA,MAClB,CAAC;AACD,iBAAW,CAAC,CAAC;AACb,UAAI,OAAO,SAAS,WAAW,MAAM;AACrC,cAAQ,IAAI;AACZ,UAAI,UAAU,CAAC;AACf,cAAQ,aAAa;AACrB,cAAQ,YAAY;AACpB,aAAO;AAmBP,eAAS,QAAQc,OAAM;AACrB,YAAI,KAAKA,MAAK;AACd,YAAI,OAAO,gBAAgB;AAEzB,gBAAM,IAAI,MAAM,oCAAoC;AAAA,QACtD,WAAW,OAAO,gBAAgB;AAChC,cAAIA,MAAK,OAAO,KAAK;AAEnB,gBAAIA,MAAK,KAAK,CAAC,EAAE,SAAS,kBAAkB,CAAC,UAAU,WAAWA,MAAK,KAAK,CAAC,EAAE,KAAK,CAAC,GAAG;AACtF,oBAAM,IAAI,MAAM,iCAAiC;AAAA,YACnD,OAAO;AACL,sBAAQA,MAAK,KAAK,CAAC,CAAC;AAAA,YACtB;AAAA,UACF,OAAO;AACL,gBAAI,CAAC,KAAK,SAASA,MAAK,EAAE,GAAG;AAC3B,oBAAM,IAAI,MAAM,cAAcA,MAAK,KAAK,mCAAmC;AAAA,YAC7E;AACA,qBAASC,KAAI,GAAGA,KAAID,MAAK,KAAK,QAAQC,MAAK;AACzC,sBAAQD,MAAK,KAAKC,EAAC,CAAC;AAAA,YACtB;AAAA,UACF;AAAA,QACF,WAAW,OAAO,cAAc;AAC9B,cAAI,QAAQD,MAAK;AACjB,cAAI,MAAM,UAAU,QAAQ,KAAK;AACjC,cAAI,QAAQ,IAAI;AAEd,sBAAU,KAAK,KAAK;AAAA,UACtB;AAAA,QACF,WAAW,OAAO,mBAAmB;AACnC,kBAAQA,MAAK,OAAO;AAAA,QACtB,WAAW,OAAO,gBAAgB;AAChC,gBAAM,IAAI,MAAM,UAAU,KAAK,0CAA0C;AAAA,QAC3E;AAAA,MACF;AAAA,IACF;AAYA,aAAS,mBAAmB;AAC1B,UAAI,WAAW;AAAA,QAACf;AAAA;AAAA,QAEhB;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA,QAAG;AAAA,UACD,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA,QAAGD;AAAA;AAAA,QAEH;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA,QAAG;AAAA,UACD,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA,QAAG;AAAA,UACD,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA,QAAG;AAAA,UACD,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA,QAAG;AAAA,UACD,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA,MAAC;AACD,UAAI,aAAa;AAAA,QAAC;AAAA,UAChB,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA,MAAC;AAED,UAAI,gBAAgB;AAAA,QAAC;AAAA,UACnB,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA,MAAC;AAED,UAAI,cAAc;AAAA,QAAC;AAAA,UACjB,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA,MAAC;AACD,UAAI,WAAW,CAAC;AAKhB,eAAS,aAAa,SAAS,OAAO,YAAY,WAAW;AAC7D,eAAS,gBAAgB;AACzB,eAAS,cAAc;AACvB,eAAS,kBAAkB,SAAS,OAAO,UAAU;AAMrD,eAAS,aAAa;AAAA,QAACC;AAAA;AAAA,QAEvB;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEAD;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,QAEA;AAAA,UACE,GAAG;AAAA,UACH,GAAG;AAAA,QACL;AAAA;AAAA,MACA;AACA,aAAO;AAAA,IACT;AAkBA,aAAS,YAAY,MAAM,QAAQ,WAAW;AAC5C,UAAI,KAAK,KAAK;AACd,UAAI,WAAW,UAAU,SAAS;AAElC,UAAI,OAAO,kBAAkB,KAAK,SAAS,GAAG;AAC5C,YAAI,OAAO;AACX,YAAI;AACJ,YAAI,KAAK,OAAO,KAAK;AAEnB,eAAK,KAAK,KAAK,CAAC,EAAE,SAAS,qBAAqB,KAAK,KAAK,CAAC,EAAE,SAAS,mBAAmB,KAAK,KAAK,CAAC,EAAE,SAAS,gBAAgB;AAE7H,kBAAM,WAAW,KAAK,KAAK,CAAC,EAAE,KAAK;AACnC,mBAAO,OAAO,KAAK,UAAU,GAAG;AAAA,UAClC;AAAA,QACF;AACA,YAAI,MAAM;AAOR,cAAI,MAAM,GAAG;AASX,gBAAI,WAAW,KAAK,KAAK,CAAC;AAC1B,gBAAI,WAAW,IAAIa,cAAa,KAAK,OAAO,CAAC,KAAK,KAAK,CAAC,EAAE,UAAU,GAAG,IAAIJ,cAAa,MAAM,CAAC,CAAC,CAAC;AACjG,mBAAO,IAAII,cAAa,KAAK,YAAY,CAAC,UAAU,QAAQ,CAAC;AAAA,UAC/D,OAAO;AAOL,mBAAO,IAAIA,cAAa,KAAK,YAAY,CAAC,KAAK,KAAK,CAAC,GAAG,KAAK,KAAK,CAAC,EAAE,UAAU,CAAC,CAAC;AAAA,UACnF;AACA,cAAI,UAAU;AAEZ,gBAAI,cAAc,WAAW;AAC3B,qBAAO,UAAU;AAAA,YACnB,OAAO;AACL,qBAAO,KAAK,SAAS,IAAI;AAAA,YAC3B;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,UAAI,OAAO,mBAAmB;AAE5B,oBAAY,KAAK,SAAS,MAAM,SAAS;AAAA,MAC3C,WAAW,OAAO,kBAAkB,OAAO,cAAc;AACvD,iBAASI,KAAI,GAAGA,KAAI,KAAK,KAAK,QAAQA,MAAK;AACzC,sBAAY,KAAK,KAAKA,EAAC,GAAG,MAAMA,EAAC;AAAA,QACnC;AAAA,MACF;AACA,UAAI,CAAC,UAAU;AAEb,eAAO;AAAA,MACT;AAAA,IACF;AAyBA,aAAS,gBAAgB,MAAM,cAAc;AAC3C,UAAI,iBAAiB,QAAW;AAC9B,uBAAe,CAAC;AAAA,MAClB;AAEA,mBAAa,CAAC,IAAI;AAClB,UAAI,IAAI,CAAC;AACT,QAAE,MAAM;AACR,QAAE,OAAO;AAIT,QAAE,OAAO;AACT,UAAI,UAAU;AACd,UAAI,UAAU;AAEd,eAAS,MAAM,MAAM,CAAC;AACtB,gBAAU,aAAa,SAAS;AAChC,UAAI,QAAQ;AACZ,UAAI;AACJ,eAASA,KAAI,SAASA,MAAK,GAAGA,MAAK;AACjC,YAAI,aAAaA,EAAC,MAAM,EAAG;AAC3B,YAAIC,MAAK,IAAIT,cAAa,QAAQ,aAAaQ,EAAC,IAAI,KAAK,IAAI,aAAaA,EAAC,CAAC,CAAC;AAC7E,YAAI,KAAK,aAAaA,EAAC,IAAI,IAAI,MAAM;AACrC,YAAIA,KAAI,GAAG;AAET,cAAIE,MAAK,IAAIL,YAAW,OAAO;AAC/B,cAAIG,KAAI,GAAG;AACT,gBAAI,KAAK,IAAIR,cAAaQ,EAAC;AAC3B,YAAAE,MAAK,IAAIN,cAAa,KAAK,OAAO,CAACM,KAAI,EAAE,CAAC;AAAA,UAC5C;AACA,cAAI,aAAaF,EAAC,MAAM,MAAM,OAAO;AACnC,YAAAC,MAAK,IAAIL,cAAa,KAAK,cAAc,CAACM,GAAE,CAAC;AAAA,UAC/C,WAAW,KAAK,IAAI,aAAaF,EAAC,CAAC,MAAM,GAAG;AAC1C,YAAAC,MAAKC;AAAA,UACP,OAAO;AACL,YAAAD,MAAK,IAAIL,cAAa,KAAK,YAAY,CAACK,KAAIC,GAAE,CAAC;AAAA,UACjD;AAAA,QACF;AACA,YAAI,OAAO;AACT,eAAKD;AAAA,QACP,WAAW,OAAO,KAAK;AACrB,eAAK,IAAIL,cAAa,KAAK,OAAO,CAAC,IAAIK,GAAE,CAAC;AAAA,QAC5C,OAAO;AACL,eAAK,IAAIL,cAAa,KAAK,YAAY,CAAC,IAAIK,GAAE,CAAC;AAAA,QACjD;AACA,gBAAQ;AAAA,MACV;AAEA,UAAI,OAAO;AACT,eAAO,IAAIT,cAAa,CAAC;AAAA,MAC3B,OAAO;AACL,eAAO;AAAA,MACT;AAgBA,eAAS,SAASO,OAAM,OAAOI,IAAG;AAChC,YAAI,KAAKJ,MAAK;AACd,YAAI,OAAO,gBAAgB;AAGzB,gBAAM,IAAI,MAAM,oCAAoC;AAAA,QACtD,WAAW,OAAO,gBAAgB;AAEhC,cAAI,CAAC,OAAO,SAASA,MAAK,EAAE,EAAG,OAAM,IAAI,MAAM,cAAcA,MAAK,KAAK,UAAU;AACjF,cAAI,UAAU,MAAM;AAElB,iBAAKA,MAAK,OAAO,gBAAgBA,MAAK,OAAO,UAAU,MAAM,OAAO,SAAS,MAAM,OAAO,cAAc,MAAM,OAAO,YAAY;AAC/H,oBAAM,IAAI,MAAM,aAAaA,MAAK,KAAK,UAAU;AAAA,YACnD;AAGA,iBAAKA,MAAK,OAAO,cAAcA,MAAK,OAAO,SAASA,MAAK,OAAO,eAAe,MAAM,OAAO,SAAS,MAAM,OAAO,YAAY;AAC5H,oBAAM,IAAI,MAAM,aAAaA,MAAK,KAAK,UAAU;AAAA,YACnD;AAGA,iBAAKA,MAAK,OAAO,cAAcA,MAAK,OAAO,SAASA,MAAK,OAAO,iBAAiBI,GAAE,UAAU,GAAG;AAC9F,oBAAM,IAAI,MAAM,aAAaJ,MAAK,KAAK,UAAU;AAAA,YACnD;AAAA,UACF;AAGA,cAAIA,MAAK,OAAO,OAAOA,MAAK,OAAO,KAAK;AACtC,YAAAI,GAAE,OAAOJ,MAAK;AAAA,UAChB;AACA,mBAAS,KAAK,GAAG,KAAKA,MAAK,KAAK,QAAQ,MAAM;AAE5C,gBAAIA,MAAK,OAAO,aAAc,CAAAI,GAAE,OAAO;AACvC,gBAAIJ,MAAK,OAAO,OAAOA,MAAK,OAAO,YAAY;AAC7C,cAAAI,GAAE,OAAO;AACT,cAAAA,GAAE,MAAM;AACR,cAAAA,GAAE,OAAO,OAAO,IAAI,MAAMJ,MAAK;AAAA,YACjC;AACA,YAAAI,GAAE,QAAQ;AACV,qBAASJ,MAAK,KAAK,EAAE,GAAGA,OAAMI,EAAC;AAAA,UACjC;AAAA,QACF,WAAW,OAAO,cAAc;AAE9B,cAAIJ,MAAK,SAAS,WAAW,YAAY,IAAI;AAC3C,kBAAM,IAAI,MAAM,iCAAiC;AAAA,UACnD;AACA,oBAAUA,MAAK;AACf,cAAI,UAAU,MAAM;AAClB,yBAAa,CAAC,IAAI;AAClB;AAAA,UACF;AAGA,cAAI,MAAM,OAAO,OAAOI,GAAE,UAAU,GAAG;AACrC,kBAAM,IAAI,MAAM,qDAAqD;AAAA,UACvE;AAGA,cAAI,MAAM,OAAO,OAAOA,GAAE,UAAU,GAAG;AACrC,kBAAM,IAAI,MAAM,yDAAyD;AAAA,UAC3E;AAGA,cAAIA,GAAE,SAAS,MAAMA,GAAE,SAAS,KAAK;AACnC,gBAAI,UAAU,EAAG,cAAa,CAAC,IAAI;AACnC,yBAAa,CAAC,KAAKA,GAAE,OAAOA,GAAE,SAAS,MAAM,IAAI;AACjD,sBAAU,KAAK,IAAI,GAAG,OAAO;AAAA,UAC/B;AAAA,QACF,WAAW,OAAO,gBAAgB;AAChC,cAAI,QAAQ,WAAWJ,MAAK,KAAK;AACjC,cAAI,UAAU,MAAM;AAClB,yBAAa,CAAC,IAAI;AAClB;AAAA,UACF;AACA,cAAI,MAAM,OAAO,KAAK;AAEpB,gBAAII,GAAE,UAAU,EAAG,OAAM,IAAI,MAAM,4BAA4B;AAC/D,gBAAI,CAAC,UAAU,KAAK,KAAK,SAAS,GAAG;AACnC,oBAAM,IAAI,MAAM,qCAAqC;AAAA,YACvD;AACA,qBAAS,MAAM,UAAU,GAAG,MAAM,OAAO,MAAO,cAAa,GAAG,IAAI;AACpE,gBAAI,QAAQ,QAAS,cAAa,KAAK,IAAI;AAC3C,yBAAa,KAAK,KAAKA,GAAE,OAAOA,GAAE,SAAS,MAAM,IAAI;AACrD,sBAAU,KAAK,IAAI,OAAO,OAAO;AACjC;AAAA,UACF;AACA,UAAAA,GAAE,MAAM;AAGR,cAAIA,GAAE,SAAS,IAAI;AACjB,yBAAa,CAAC,KAAKA,GAAE,OAAOA,GAAE,SAAS,MAAM,IAAI;AAAA,UACnD;AAAA,QACF,OAAO;AACL,gBAAM,IAAI,MAAM,UAAU,KAAK,iBAAiB;AAAA,QAClD;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAC;;;ACjzBD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO,YAAY,WAAW,QAAQ;AAC5D,MAAI,eAA8B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC3E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,UAAAC;AAAA,MACA,SAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AAmBJ,WAAOJ,OAAMF,SAAM;AAAA,MACjB,sBAAsB,SAAS,iBAAiB,GAAG,GAAG,GAAG;AACvD,eAAO,QAAQ,GAAG,GAAG,CAAC;AAAA,MACxB;AAAA,MACA,eAAe,SAAS,WAAW,GAAG,GAAG;AACvC,eAAO,QAAQ,GAAG,GAAG,CAAC;AAAA,MACxB;AAAA,MACA,wBAAwB,SAAS,mBAAmB,GAAG,GAAG,GAAG;AAC3D,eAAO,QAAQ,EAAE,QAAQ,GAAG,EAAE,QAAQ,GAAG,CAAC;AAAA,MAC5C;AAAA,MACA,iBAAiB,SAAS,aAAa,GAAG,GAAG;AAC3C,eAAO,QAAQ,EAAE,QAAQ,GAAG,EAAE,QAAQ,GAAG,CAAC;AAAA,MAC5C;AAAA,IACF,CAAC;AACD,aAAS,QAAQ,GAAG,GAAG,GAAG;AAExB,UAAI,EAAE,KAAK,QAAM,GAAG,SAAS,WAAW,GAAG;AACzC,YAAI,EAAE,IAAI,QAAMM,QAAO,EAAE,CAAC;AAAA,MAC5B;AAEA,UAAI,EAAE,KAAK,QAAM,GAAG,SAAS,WAAW,GAAG;AACzC,YAAI,EAAE,IAAI,QAAMA,QAAO,EAAE,CAAC;AAAA,MAC5B;AACA,UAAI,MAAM,CAACD,SAAQ,GAAG,CAAC,CAAC;AACxB,UAAI,MAAM,CAACA,SAAQ,GAAG,CAAC,CAAC;AACxB,eAASE,KAAI,GAAGA,KAAI,EAAE,QAAQA,MAAK;AACjC,YAAI,OAAO,EAAEA,EAAC;AACd,YAAI,OAAO,SAAS,SAAU,QAAOF,SAAQ,MAAM,CAAC;AACpD,cAAM,UAAU,KAAK,CAACA,SAAQ,GAAG,CAAC,GAAGA,SAAQ,CAAC,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;AAAA,MACnE;AACA,eAAS,KAAK,GAAG,KAAK,EAAE,QAAQ,MAAM;AACpC,YAAI,OAAO,EAAE,EAAE;AACf,YAAI,OAAO,SAAS,SAAU,QAAOA,SAAQ,MAAM,CAAC;AACpD,cAAM,UAAU,KAAK,CAACA,SAAQ,GAAG,CAAC,GAAGA,SAAQ,CAAC,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;AAAA,MACnE;AACA,eAAS,MAAM,GAAG,MAAM,IAAI,QAAQ,OAAO;AACzC,YAAI,GAAG,IAAID,UAAS,IAAI,GAAG,GAAG,CAAC;AAAA,MACjC;AACA,aAAO,CAAC,KAAK,GAAG;AAAA,IAClB;AACA,aAAS,UAAU,GAAG,GAAG;AACvB,UAAI,IAAI,CAAC;AACT,eAASG,KAAI,GAAGA,KAAI,EAAE,SAAS,EAAE,SAAS,GAAGA,MAAK;AAChD,UAAEA,EAAC,IAAIF,SAAQ,GAAG,CAAC;AACnB,iBAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,cAAIE,KAAI,KAAK,KAAKA,KAAI,IAAI,EAAE,QAAQ;AAClC,cAAEA,EAAC,IAAIJ,KAAI,EAAEI,EAAC,GAAGH,UAAS,EAAE,CAAC,GAAG,EAAEG,KAAI,CAAC,CAAC,CAAC;AAAA,UAC3C;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,EACF,CAAC;;;AChFD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO,YAAY,WAAW,UAAU,QAAQ;AACtE,MAAI,cAA6B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC1E,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,UAAAC;AAAA,MACA,SAAAC;AAAA,MACA,QAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AAsBJ,WAAOL,OAAMF,SAAM;AAAA,MACjB,gBAAgB,SAAS,YAAY,GAAG,GAAG;AACzC,YAAI,IAAI,WAAW,GAAG;AACtB,eAAO,OAAO,GAAG,GAAG,CAAC;AAAA,MACvB;AAAA,MACA,uBAAuB,SAAS,kBAAkB,GAAG,GAAG,GAAG;AACzD,eAAO,OAAO,GAAG,GAAG,CAAC;AAAA,MACvB;AAAA,MACA,wBAAwB,SAAS,mBAAmB,GAAG,GAAG,GAAG;AAC3D,YAAI,IAAI,GAAG;AACT,gBAAM,IAAI,MAAM,6BAA6B;AAAA,QAC/C;AACA,YAAI,KAAK,WAAW,CAAC;AACrB,eAAO,OAAO,GAAG,GAAG,EAAE;AAAA,MACxB;AAAA,MACA,kBAAkB,SAAS,cAAc,GAAG,GAAG;AAE7C,YAAI,KAAK,WAAW,GAAG;AACvB,YAAI;AAAA,UACF;AAAA,UACA;AAAA,QACF,IAAI,OAAO,EAAE,QAAQ,GAAG,EAAE,QAAQ,GAAG,EAAE;AACvC,eAAO;AAAA,UACL,GAAGO,QAAO,CAAC;AAAA,UACX,GAAGA,QAAO,CAAC;AAAA,QACb;AAAA,MACF;AAAA,MACA,0BAA0B,SAAS,qBAAqB,GAAG,GAAG,GAAG;AAC/D,YAAI;AAAA,UACF;AAAA,QACF,IAAI,OAAO,EAAE,QAAQ,GAAG,EAAE,QAAQ,GAAG,EAAE,QAAQ,CAAC;AAChD,eAAO;AAAA,UACL,GAAGA,QAAO,CAAC;AAAA,UACX,GAAGA,QAAO,CAAC;AAAA,QACb;AAAA,MACF;AAAA,MACA,0BAA0B,SAAS,qBAAqB,GAAG,GAAG,GAAG;AAC/D,YAAI,IAAI,GAAG;AACT,gBAAM,IAAI,MAAM,6BAA6B;AAAA,QAC/C;AACA,YAAI,KAAK,WAAW,CAAC;AACrB,YAAI;AAAA,UACF;AAAA,QACF,IAAI,OAAO,EAAE,QAAQ,GAAG,EAAE,QAAQ,GAAG,EAAE;AACvC,eAAO;AAAA,UACL,GAAGA,QAAO,CAAC;AAAA,UACX,GAAGA,QAAO,EAAE;AAAA,QACd;AAAA,MACF;AAAA,IACF,CAAC;AACD,aAAS,OAAO,GAAG,GAAG,GAAG;AACvB,UAAI,MAAM,CAAC;AACX,UAAI,MAAM,CAAC;AACX,eAASC,KAAI,GAAGA,KAAI,EAAE,QAAQA,MAAK;AACjC,YAAI,SAASH,SAAQ,GAAG,CAAC;AACzB,YAAI,SAASA,SAAQ,GAAG,CAAC;AACzB,iBAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,mBAASF,KAAI,QAAQC,UAAS,EAAE,CAAC,GAAGC,SAAQ,KAAK,IAAI,CAAC,IAAI,EAAEG,EAAC,CAAC,GAAG,KAAK,IAAI,CAAC,IAAI,EAAEA,EAAC,CAAC,CAAC,CAAC,CAAC;AAAA,QACxF;AACA,iBAAS,KAAK,GAAG,KAAK,EAAE,QAAQ,MAAM;AACpC,mBAASL,KAAI,QAAQC,UAAS,EAAE,EAAE,GAAGC,SAAQ,KAAK,IAAI,CAAC,KAAK,EAAEG,EAAC,CAAC,GAAG,KAAK,IAAI,CAAC,KAAK,EAAEA,EAAC,CAAC,CAAC,CAAC,CAAC;AAAA,QAC3F;AACA,YAAI,KAAK,MAAM;AACf,YAAI,KAAK,MAAM;AAAA,MACjB;AACA,UAAI,IAAI,CAAC;AACT,eAAS,KAAK,GAAG,KAAK,IAAI,QAAQ,MAAM;AACtC,UAAE,KAAKF,QAAO,IAAI,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC;AAAA,MACjC;AACA,aAAO;AAAA,QACL;AAAA,QACA;AAAA,MACF;AAAA,IACF;AACA,aAAS,WAAW,GAAG;AACrB,UAAI,OAAO,CAAC;AACZ,eAASE,KAAI,GAAGA,KAAI,GAAGA,MAAK;AAC1B,aAAK,KAAKA,KAAI,IAAI,KAAK,EAAE;AAAA,MAC3B;AACA,aAAO;AAAA,IACT;AAAA,EACF,CAAC;;;ACjHD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS;AACtB,MAAI,gBAA+B,wBAAQD,SAAMC,iBAAc,UAAQ;AAC5E,QAAI;AAAA,MACF,SAAAC;AAAA,IACF,IAAI;AAOJ,WAAO,SAASC,SAAQ,KAAK,OAAO;AAClC,UAAI,cAAcD,SAAQ,SAAS,MAAM,MAAM;AAC/C,UAAI,eAAe,OAAO,YAAY,aAAa,YAAY;AAC7D,eAAO,YAAY,SAAS,KAAK;AAAA,MACnC;AACA,aAAO;AAAA,IACT;AAAA,EACF,CAAC;;;ACnBD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC;AACb,MAAI,iBAAgC,wBAAQD,SAAMC,iBAAc,MAAM;AAa3E,WAAO,SAASC,UAAS,KAAK,OAAO;AAEnC,UAAI,OAAO,UAAU,aAAa,CAAC,OAAO,SAAS,KAAK,KAAK,MAAM,KAAK,IAAI;AAC1E,eAAO;AAAA,UACL,QAAQ;AAAA,UACR,OAAO,OAAO,KAAK;AAAA,QACrB;AAAA,MACF;AACA,UAAI,OAAO,UAAU,UAAU;AAC7B,eAAO;AAAA,UACL,QAAQ;AAAA,UACR,OAAO,OAAO,KAAK;AAAA,QACrB;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,EACF,CAAC;;;AChCM,MAAIC,WAAU;;;ACId,MAAI,aAA4B,wBAAQ,QAAQ,CAAC,GAAG,MAAM,IAAI;AAC9D,MAAI,cAA6B,wBAAQ,SAAS,CAAC,GAAG,MAAM,KAAK;AACjE,MAAI,aAA4B,wBAAQ,QAAQ,CAAC,GAAG,MAAM,IAAI;AAC9D,MAAI,iBAAgC,gCAAgB,YAAY,CAAC,UAAU,YAAY,GAAG,UAAQ;AACvG,QAAI;AAAA,MACF,QAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AACJ,WAAOD,QAAO,WAAW,cAAc,IAAIC,WAAU,QAAQ,IAAI;AAAA,EACnE,CAAC;AACM,MAAI,YAA2B,gCAAgB,OAAO,CAAC,UAAU,YAAY,GAAG,WAAS;AAC9F,QAAI;AAAA,MACF,QAAAD;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AACJ,WAAOD,QAAO,WAAW,cAAc,IAAIC,WAAU,GAAG,IAAI;AAAA,EAC9D,CAAC;AACM,MAAI,WAA0B,gCAAgB,MAAM,CAAC,UAAU,YAAY,GAAG,WAAS;AAC5F,QAAI;AAAA,MACF,QAAAD;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AACJ,WAAOD,QAAO,WAAW,cAAc,kBAAkBC,UAAS,IAAI;AAAA,EACxE,CAAC;AACM,MAAI,YAA2B,gCAAgB,OAAO,CAAC,UAAU,YAAY,GAAG,WAAS;AAC9F,QAAI;AAAA,MACF,QAAAD;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AACJ,WAAOD,QAAO,WAAW,cAAc,mBAAmBC,UAAS,IAAI;AAAA,EACzE,CAAC;AACM,MAAI,UAAyB,gCAAgB,KAAK,CAAC,UAAU,YAAY,GAAG,WAAS;AAC1F,QAAI;AAAA,MACF,QAAAD;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AACJ,WAAOD,QAAO,WAAW,cAAc,iBAAiBC,UAAS,IAAI;AAAA,EACvE,CAAC;AAGM,MAAI,YAA2B,gCAAgB,OAAO,CAAC,UAAU,YAAY,GAAG,WAAS;AAC9F,QAAI;AAAA,MACF,QAAAD;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AACJ,WAAOD,QAAO,WAAW,cAAc,mBAAmBC,UAAS,IAAI;AAAA,EACzE,CAAC;AACM,MAAI,YAA2B,gCAAgB,OAAO,CAAC,UAAU,YAAY,GAAG,WAAS;AAC9F,QAAI;AAAA,MACF,QAAAD;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AACJ,WAAOD,QAAO,WAAW,cAAc,IAAIC,WAAU,CAAC,EAAE,GAAG,IAAI,KAAK;AAAA,EACtE,CAAC;AACM,MAAI,aAA4B,gCAAgB,QAAQ,CAAC,UAAU,YAAY,GAAG,WAAS;AAChG,QAAI;AAAA,MACF,QAAAD;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AACJ,WAAOD,QAAO,WAAW,cAAc,IAAIC,WAAU,EAAE,EAAE,GAAG,IAAI,KAAK;AAAA,EACvE,CAAC;AACM,MAAI,cAA6B,gCAAgB,SAAS,CAAC,UAAU,YAAY,GAAG,WAAS;AAClG,QAAI;AAAA,MACF,QAAAD;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AACJ,WAAOD,QAAO,WAAW,cAAc,IAAIC,WAAU,CAAC,EAAE,IAAI,IAAIA,WAAU,CAAC,EAAE,GAAG,CAAC,IAAI,KAAK;AAAA,EAC5F,CAAC;AACM,MAAI,eAA8B,gCAAgB,UAAU,CAAC,UAAU,YAAY,GAAG,WAAS;AACpG,QAAI;AAAA,MACF,QAAAD;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AACJ,WAAOD,QAAO,WAAW,cAAc,IAAIC,WAAU,CAAC,EAAE,IAAI,IAAIA,WAAU,EAAE,EAAE,GAAG,CAAC,IAAI,KAAK;AAAA,EAC7F,CAAC;AACM,MAAI,gBAA+B;AAAA;AAAA,IAE1C;AAAA,IAAW,CAAC,UAAU,YAAY;AAAA,IAAG,WAAS;AAC5C,UAAI;AAAA,QACF,QAAAD;AAAA,QACA,WAAAC;AAAA,MACF,IAAI;AACJ,aAAOD,QAAO,WAAW,cAAc,IAAIC,WAAU,KAAK,EAAE,KAAK,IAAI,KAAK;AAAA,IAC5E;AAAA,EAAC;AACM,MAAI,cAA6B,gCAAgB,SAAS,CAAC,UAAU,YAAY,GAAG,YAAU;AACnG,QAAI;AAAA,MACF,QAAAD;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AACJ,WAAOD,QAAO,WAAW,cAAc,IAAIC,WAAU,CAAC,EAAE,KAAK,IAAI,KAAK;AAAA,EACxE,CAAC;AACM,MAAI,UAAyB,gCAAgB,KAAK,CAAC,SAAS,GAAG,YAAU;AAC9E,QAAI;AAAA,MACF,SAAAC;AAAA,IACF,IAAI;AACJ,WAAOA,SAAQ;AAAA,EACjB,CAAC;AAeM,MAAI,gBAA+B,wBAAQ,WAAW,CAAC,GAAG,MAAMC,QAAO;AAI9E,WAAS,gBAAgBC,SAAMC,iBAAc,QAAQ;AACnD,WAAO,QAAQD,SAAMC,iBAAc,QAAQ;AAAA,MACzC,wBAAwB;AAAA,IAC1B,CAAC;AAAA,EACH;;;ACtHO,MAAI,qBAAoC,4BAAY,gBAAgB,aAAa,QAAQ;AACzF,MAAI,4BAA2C,4BAAY,uBAAuB,eAAe,gBAAgB;AACjH,MAAI,uBAAsC,4BAAY,kBAAkB,kBAAkB,KAAK;AAC/F,MAAI,8BAA6C,4BAAY,yBAAyB,0BAA0B,KAAK;AAGrH,MAAI,yBAAwC,4BAAY,oBAAoB,oBAAoB,QAAQ;AACxG,MAAI,yBAAwC,4BAAY,oBAAoB,oBAAoB,QAAQ;AACxG,MAAI,wBAAuC,4BAAY,mBAAmB,iBAAiB,KAAK;AAChG,MAAI,gBAA+B,4BAAY,WAAW,uBAAuB,YAAY;AAC7F,MAAI,wBAAuC,4BAAY,mBAAmB,uBAAuB,YAAY;AAC7G,MAAI,yBAAwC,4BAAY,oBAAoB,mBAAmB,GAAG;AAClG,MAAI,qBAAoC,4BAAY,gBAAgB,oBAAoB,QAAQ;AAChG,MAAI,2BAA0C,4BAAY,sBAAsB,wBAAwB,GAAG;AAC3G,MAAI,kCAAiD,4BAAY,6BAA6B,sBAAsB,KAAK;AACzH,MAAI,4BAA2C,4BAAY,uBAAuB,0BAA0B,IAAI;AAChH,MAAI,wBAAuC,4BAAY,mBAAmB,oBAAoB,QAAQ;AACtG,MAAI,iBAAgC,4BAAY,YAAY,sBAAsB,KAAK;AAIvF,MAAI,mBAAkC,4BAAY,cAAc,qBAAqB,GAAG;AACxF,MAAI,gCAA+C,4BAAY,2BAA2B,oBAAoB,GAAG;AACjH,MAAI,qBAAoC,4BAAY,gBAAgB,oBAAoB,IAAI;AAC5F,MAAI,sBAAqC,4BAAY,iBAAiB,gBAAgB,QAAQ;AAC9F,MAAI,sBAAsB,cAAc,iBAAiB,eAAe;AACxE,MAAI,sBAAqC,4BAAY,iBAAiB,uBAAuB,GAAG;AAChG,MAAI,mBAAkC,4BAAY,cAAc,qBAAqB,IAAI;AACzF,MAAI,qBAAoC,4BAAY,gBAAgB,oBAAoB,IAAI;AAC5F,MAAI,oBAAmC,4BAAY,eAAe,oBAAoB,IAAI;AAC1F,MAAI,6BAA4C,4BAAY,wBAAwB,mBAAmB,UAAU;AACjH,MAAI,gBAA+B,4BAAY,WAAW,mBAAmB,MAAM;AACnF,MAAI,4BAA2C,4BAAY,uBAAuB,oBAAoB,KAAK;AAC3G,MAAI,wBAAwB,cAAc,mBAAmB,MAAO;AACpE,MAAI,qBAAqB,cAAc,gBAAgB,IAAI;AAG3D,MAAI,mBAAkC,4BAAY,cAAc,qBAAqB,IAAI;AACzF,MAAI,iBAAgC,4BAAY,YAAY,iBAAiB,QAAQ;AACrF,MAAI,kBAAiC,4BAAY,aAAa,gBAAgB,QAAQ;AACtF,MAAI,gBAA+B,4BAAY,WAAW,qBAAqB,UAAU;AACzF,MAAI,uBAAsC,4BAAY,kBAAkB,0BAA0B,OAAO;AAEzG,MAAI,kBAAiC,4BAAY,aAAa,wBAAwB,MAAM;AAC5F,MAAI,oBAAmC,4BAAY,eAAe,oBAAoB,eAAe;AACrG,MAAI,4BAA2C,4BAAY,uBAAuB,yBAAyB,YAAY;AACvH,MAAI,oBAAmC,4BAAY,eAAe,wBAAwB,YAAY;AACtG,MAAI,sBAAsB,cAAc,iBAAiB,cAAc;AACvE,MAAI,wBAAuC,4BAAY,mBAAmB,wBAAwB,KAAK;AACvG,MAAI,wBAAuC,4BAAY,mBAAmB,uBAAuB,aAAa;AAC9G,MAAI,yBAAwC,4BAAY,oBAAoB,kBAAkB,KAAK;AAGnG,MAAI,kBAAiC,4BAAY,aAAa,oBAAoB,WAAW;AAC7F,MAAI,qBAAoC,4BAAY,gBAAgB,oBAAoB,WAAW;AACnG,MAAI,gBAA+B,4BAAY,WAAW,WAAW,QAAQ;AAI7E,MAAI,qBAAoC,4BAAY,gBAAgB,gBAAgB,GAAG;AACvF,MAAI,mBAAkC,4BAAY,cAAc,eAAe,IAAI;AACnF,MAAI,mBAAkC,4BAAY,cAAc,gBAAgB,GAAG;AACnF,MAAI,qBAAoC,4BAAY,gBAAgB,qBAAqB,GAAG;AAC5F,MAAI,0BAAyC,4BAAY,qBAAqB,gBAAgB,GAAG;AAIxG,WAAS,YAAYC,SAAM,UAAU,SAAS;AAC5C,QAAIC,kBAAe,CAAC,UAAU,QAAQ,WAAW;AACjD,WAAO,QAAQD,SAAMC,iBAAc,UAAQ;AACzC,UAAI;AAAA,QACF,QAAAC;AAAA,QACA,MAAAC;AAAA,QACA,WAAAC;AAAA,MACF,IAAI;AAIJ,UAAI,QAAQF,QAAO,WAAW,cAAc,IAAIE,WAAU,QAAQ,IAAI,WAAW,QAAQ;AACzF,UAAIC,QAAO,IAAIF,MAAK,OAAO,OAAO;AAClC,MAAAE,MAAK,YAAY;AACjB,aAAOA;AAAA,IACT,CAAC;AAAA,EACH;AAIA,WAAS,cAAcL,SAAM,OAAO;AAClC,QAAIC,kBAAe,CAAC,UAAU,WAAW;AACzC,WAAO,QAAQD,SAAMC,iBAAc,WAAS;AAC1C,UAAI;AAAA,QACF,QAAAC;AAAA,QACA,WAAAE;AAAA,MACF,IAAI;AACJ,aAAOF,QAAO,WAAW,cAAc,IAAIE,WAAU,KAAK,IAAI;AAAA,IAChE,CAAC;AAAA,EACH;;;ACpGA,WAASE,SAAQC,IAAG,GAAG;AAAE,QAAI,IAAI,OAAO,KAAKA,EAAC;AAAG,QAAI,OAAO,uBAAuB;AAAE,UAAI,IAAI,OAAO,sBAAsBA,EAAC;AAAG,YAAM,IAAI,EAAE,OAAO,SAAUC,IAAG;AAAE,eAAO,OAAO,yBAAyBD,IAAGC,EAAC,EAAE;AAAA,MAAY,CAAC,IAAI,EAAE,KAAK,MAAM,GAAG,CAAC;AAAA,IAAG;AAAE,WAAO;AAAA,EAAG;AAC9P,WAASC,eAAcF,IAAG;AAAE,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AAAE,UAAI,IAAI,QAAQ,UAAU,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC;AAAG,UAAI,IAAID,SAAQ,OAAO,CAAC,GAAG,IAAE,EAAE,QAAQ,SAAUE,IAAG;AAAE,QAAAE,iBAAgBH,IAAGC,IAAG,EAAEA,EAAC,CAAC;AAAA,MAAG,CAAC,IAAI,OAAO,4BAA4B,OAAO,iBAAiBD,IAAG,OAAO,0BAA0B,CAAC,CAAC,IAAID,SAAQ,OAAO,CAAC,CAAC,EAAE,QAAQ,SAAUE,IAAG;AAAE,eAAO,eAAeD,IAAGC,IAAG,OAAO,yBAAyB,GAAGA,EAAC,CAAC;AAAA,MAAG,CAAC;AAAA,IAAG;AAAE,WAAOD;AAAA,EAAG;AAKtb,MAAII,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,WAAW;AASjC,MAAI,2BAA0C,wBAAQD,SAAMC,iBAAc,UAAQ;AACvF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AACJ,QAAIC,aAAY,gBAAgB;AAAA,MAC9B,OAAAF;AAAA,MACA,WAAAC;AAAA,IACF,CAAC;AAGD,WAAOD,OAAM,aAAa;AAAA,MACxB,UAAU,SAAS,IAAI,MAAM;AAE3B,YAAI,MAAM,KAAK,CAAC;AAChB,YAAI,SAAS,GAAG,GAAG;AACjB,eAAK,CAAC,IAAI,MAAM;AAAA,QAClB,WAAW,YAAY,GAAG,GAAG;AAC3B,eAAK,CAAC,IAAI,IAAI,MAAM,CAAC;AAAA,QACvB;AACA,YAAI;AACF,iBAAOE,WAAU,MAAM,MAAM,IAAI;AAAA,QACnC,SAAS,KAAK;AACZ,gBAAM,eAAe,GAAG;AAAA,QAC1B;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,GAAGN,eAAc;AAAA,IACf,qBAAqB;AAAA,EACvB,GAAG,gBAAgB,IAAI,CAAC;;;AC1CxB,MAAIO,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,SAAS,UAAU,OAAO;AAShD,MAAI,wBAAuC,wBAAQD,SAAMC,iBAAc,UAAQ;AACpF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,OAAAC;AAAA,IACF,IAAI;AACJ,QAAIC,UAAS,aAAa;AAAA,MACxB,OAAAJ;AAAA,MACA,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,OAAAC;AAAA,IACF,CAAC;AAGD,WAAOH,OAAM,UAAU;AAAA,MACrB,UAAU,SAAS,IAAI,MAAM;AAE3B,YAAI,YAAY,KAAK,SAAS;AAC9B,YAAI,OAAO,KAAK,SAAS;AACzB,YAAI,SAAS,IAAI,GAAG;AAClB,eAAK,SAAS,IAAI,OAAO;AAAA,QAC3B;AACA,YAAI;AACF,iBAAOI,QAAO,MAAM,MAAM,IAAI;AAAA,QAChC,SAAS,KAAK;AACZ,gBAAM,eAAe,GAAG;AAAA,QAC1B;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,GAAG;AAAA,IACD,qBAAqB;AAAA,EACvB,CAAC;;;ACnCM,WAAS,wBAAwB,YAAYC,OAAM,OAAO;AAE/D,QAAI,SAAS,WAAW,OAAO,SAAU,MAAM;AAC7C,aAAO,aAAa,IAAI,KAAK,EAAE,KAAK,QAAQA,UAAS,CAAC,MAAM,IAAI,KAAK,IAAI;AAAA,IAC3E,CAAC,EAAE,CAAC;AACJ,QAAI,CAAC,QAAQ;AACX,YAAM,IAAI,MAAM,uDAAuD,aAAa,GAAG;AAAA,IACzF;AAGA,QAAIC,UAAO,OAAO;AAClB,QAAI,YAAY,oBAAI,IAAI;AACxB,QAAI,WAAW,IAAI,eAAe,OAAO,WAAW,oBAAI,IAAI,CAACA,OAAI,CAAC,CAAC;AACnE,QAAI,KAAK,WAAW,QAAQ;AAC5B,WAAO,SAAS,iBAAiB,GAAG;AAClC,gBAAU,IAAIA,SAAM,CAAC;AACrB,aAAO,GAAG,SAAS,QAAQ;AAAA,IAC7B;AAAA,EACF;;;AC5BA,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO;AACpB,MAAI,0BAAyC,wBAAQD,SAAMC,iBAAc,UAAQ;AACtF,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAQJ,WAAO,SAAU,UAAU,gBAAgB;AACzC,UAAIA,OAAM,gBAAgB,QAAQ,GAAG;AACnC,eAAO,gCAAgC,UAAU,cAAc;AAAA,MACjE,OAAO;AACL,eAAO,2BAA2B,UAAU,SAAS,QAAQ,cAAc;AAAA,MAC7E;AAAA,IACF;AASA,aAAS,gCAAgCC,gBAAe,gBAAgB;AACtE,UAAI,aAAa,OAAO,YAAY,OAAO,QAAQA,eAAc,UAAU,EAAE,IAAI,WAAS;AACxF,YAAI,CAAC,WAAW,gBAAgB,IAAI;AACpC,YAAI,yBAAyB,UAAU,MAAM,GAAG,EAAE;AAClD,YAAID,OAAM,gBAAgB,gBAAgB,GAAG;AAC3C,iBAAO,CAAC,WAAW,gCAAgC,kBAAkB,cAAc,CAAC;AAAA,QACtF,OAAO;AACL,iBAAO,CAAC,WAAW,2BAA2B,kBAAkB,wBAAwB,cAAc,CAAC;AAAA,QACzG;AAAA,MACF,CAAC,CAAC;AACF,UAAI,OAAOC,eAAc,SAAS,UAAU;AAC1C,eAAOD,OAAMC,eAAc,MAAM,UAAU;AAAA,MAC7C,OAAO;AACL,eAAOD,OAAM,UAAU;AAAA,MACzB;AAAA,IACF;AAAA,EACF,CAAC;AAcD,WAAS,2BAA2B,kBAAkB,wBAAwB,gBAAgB;AAC5F,QAAI,2BAA2B,gBAAgB;AAC7C,aAAO;AAAA,IACT,WAAW,2BAA2B,iBAAiB,GAAG;AACxD,aAAO,WAAY;AACjB,iBAAS,OAAO,UAAU,QAAQ,OAAO,IAAI,MAAM,IAAI,GAAG,OAAO,GAAG,OAAO,MAAM,QAAQ;AACvF,eAAK,IAAI,IAAI,UAAU,IAAI;AAAA,QAC7B;AACA,YAAI,OAAO,KAAK,MAAM,GAAG,cAAc;AACvC,YAAI,MAAM,eAAe,KAAK,cAAc,CAAC;AAC7C,eAAO,iBAAiB,GAAG,MAAM,GAAG;AAAA,MACtC;AAAA,IACF,WAAW,yBAAyB,iBAAiB,GAAG;AACtD,aAAO,WAAY;AACjB,iBAAS,QAAQ,UAAU,QAAQ,OAAO,IAAI,MAAM,KAAK,GAAG,QAAQ,GAAG,QAAQ,OAAO,SAAS;AAC7F,eAAK,KAAK,IAAI,UAAU,KAAK;AAAA,QAC/B;AACA,YAAI,OAAO,KAAK,MAAM,GAAG,cAAc;AACvC,YAAI,MAAM,eAAe,KAAK,cAAc,CAAC;AAC7C,YAAI,OAAO,KAAK,MAAM,iBAAiB,CAAC;AACxC,eAAO,iBAAiB,GAAG,MAAM,KAAK,GAAG,IAAI;AAAA,MAC/C;AAAA,IACF,OAAO;AACL,aAAO;AAAA,IACT;AAAA,EACF;AAQA,WAAS,eAAe,MAAM;AAC5B,WAAO,KAAK,IAAI,SAAO,MAAM,CAAC;AAAA,EAChC;;;ACzFA,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO;AACpB,MAAI,wBAAuC,wBAAQD,SAAMC,iBAAc,UAAQ;AACpF,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAQJ,aAAS,gBAAgB,MAAMC,OAAM,OAAO;AAC1C,UAAIC,UAAS,aAAa;AAAA,QACxB,OAAAF;AAAA,MACF,CAAC;AACD,UAAI,oBAAoB,wBAAwB;AAAA,QAC9C,OAAAA;AAAA,MACF,CAAC;AACD,UAAI,KAAK,WAAW,GAAG;AACrB,eAAOE,QAAO;AAAA,MAChB;AACA,UAAI,IAAI,KAAK,CAAC;AACd,UAAI,KAAK,WAAW,GAAG;AACrB,eAAOA,QAAO,CAAC;AAAA,MACjB;AACA,UAAI,IAAI,KAAK,SAAS;AACtB,UAAI,WAAW,KAAK,CAAC;AACrB,UAAI,GAAG;AACL,YAAI,oBAAoB,GAAG,KAAK;AAAA,MAClC;AACA,UAAI,UAAU;AACZ,YAAI,aAAa,QAAQ,KAAK,yBAAyB,QAAQ,GAAG;AAEhE,qBAAW,oBAAoB,UAAU,KAAK;AAAA,QAChD,OAAO;AAEL,qBAAW,wBAAwB,UAAUD,OAAM,KAAK;AAAA,QAC1D;AAAA,MACF;AACA,aAAOC,QAAO,GAAG,kBAAkB,UAAU,CAAC,CAAC;AAAA,IACjD;AACA,oBAAgB,UAAU;AAC1B,aAAS,oBAAoBC,MAAK,OAAO;AACvC,aAAOA,KAAI,QAAQ,EAAE,SAAS,KAAK;AAAA,IACrC;AACA,WAAO;AAAA,EACT,GAAG;AAAA,IACD,qBAAqB;AAAA,EACvB,CAAC;;;AClDD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO;AACpB,MAAI,yBAAwC,wBAAQD,SAAMC,iBAAc,UAAQ;AACrF,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAOJ,QAAIC,WAAU,cAAc;AAAA,MAC1B,OAAAD;AAAA,IACF,CAAC;AACD,QAAI,oBAAoB,wBAAwB;AAAA,MAC9C,OAAAA;AAAA,IACF,CAAC;AACD,aAAS,iBAAiB,MAAME,OAAM,OAAO;AAC3C,UAAI,KAAK,WAAW,GAAG;AACrB,eAAOD,SAAQ;AAAA,MACjB;AACA,UAAI,IAAI,KAAK,CAAC;AACd,UAAI,KAAK,WAAW,GAAG;AACrB,eAAOA,SAAQ,CAAC;AAAA,MAClB;AACA,UAAI,IAAI,KAAK,SAAS;AACtB,UAAI,WAAW,KAAK,CAAC;AACrB,UAAI,GAAG;AACL,YAAI,oBAAoB,GAAG,KAAK;AAAA,MAClC;AACA,UAAI,UAAU;AACZ,YAAI,aAAa,QAAQ,KAAK,yBAAyB,QAAQ,GAAG;AAEhE,qBAAW,oBAAoB,UAAU,KAAK;AAAA,QAChD,OAAO;AAEL,qBAAW,wBAAwB,UAAUC,OAAM,KAAK;AAAA,QAC1D;AAAA,MACF;AACA,aAAOD,SAAQ,GAAG,kBAAkB,UAAU,CAAC,CAAC;AAAA,IAClD;AACA,qBAAiB,UAAU;AAC3B,aAAS,oBAAoBE,MAAK,OAAO;AACvC,aAAOA,KAAI,QAAQ,EAAE,SAAS,KAAK;AAAA,IACrC;AACA,WAAO;AAAA,EACT,GAAG;AAAA,IACD,qBAAqB;AAAA,EACvB,CAAC;;;ACpDD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,mBAAmB;AACzC,MAAI,uBAAsC,wBAAQD,SAAMC,iBAAc,UAAQ;AACnF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,mBAAAC;AAAA,IACF,IAAI;AAOJ,WAAO,SAAS,iBAAiB;AAC/B,UAAI,OAAO,CAAC;AACZ,eAASC,KAAI,GAAG,KAAK,UAAU,QAAQA,KAAI,IAAIA,MAAK;AAClD,YAAIC,OAAM,UAAUD,EAAC;AAGrB,YAAI,QAAQC,IAAG,GAAG;AAChB,UAAAA,KAAI;AACJ,UAAAA,KAAI,OAAOA,KAAI,OAAO,IAAI,IAAI;AAAA,QAChC,WAAWA,QAAOA,KAAI,UAAU,MAAM;AACpC,UAAAA,OAAMA,KAAI,IAAI,SAAU,GAAG;AACzB,mBAAO,IAAI;AAAA,UACb,CAAC;AAAA,QACH,WAAW,QAAQA,IAAG,KAAK,SAASA,IAAG,GAAG;AACxC,cAAIF,mBAAkBE,IAAG,MAAM,WAAW;AACxC,YAAAA,OAAMA,KAAI,IAAI,SAAU,GAAG;AACzB,qBAAO,IAAI;AAAA,YACb,CAAC;AAAA,UACH;AAAA,QACF,WAAW,SAASA,IAAG,KAAK,SAASA,IAAG,GAAG;AACzC,UAAAA;AAAA,QACF,WAAW,YAAYA,IAAG,GAAG;AAC3B,UAAAA,OAAMA,KAAI,SAAS,IAAI;AAAA,QACzB,WAAW,OAAOA,SAAQ,UAAU;AAAA,QAEpC,OAAO;AACL,gBAAM,IAAI,UAAU,sEAAsE;AAAA,QAC5F;AACA,aAAKD,EAAC,IAAIC;AAAA,MACZ;AACA,UAAI,MAAM,IAAIH,OAAM;AACpB,MAAAA,OAAM,MAAM,KAAK,IAAI;AACrB,aAAO;AAAA,IACT;AAAA,EACF,GAAG;AAAA,IACD,qBAAqB;AAAA,EACvB,CAAC;;;AC9CD,MAAII,UAAO;AACX,MAAIC,kBAAe,CAAC,OAAO;AACpB,MAAI,qBAAoC,wBAAQD,SAAMC,iBAAc,UAAQ;AACjF,QAAI;AAAA,MACF,OAAAC;AAAA,IACF,IAAI;AAOJ,QAAIC,OAAMC,WAAU;AAAA,MAClB,OAAAF;AAAA,IACF,CAAC;AACD,QAAI,oBAAoB,wBAAwB;AAAA,MAC9C,OAAAA;AAAA,IACF,CAAC;AACD,aAAS,aAAa,MAAMG,OAAM,OAAO;AACvC,UAAI,KAAK,WAAW,GAAG;AACrB,eAAOF,KAAI;AAAA,MACb;AACA,UAAI,KAAK,WAAW,GAAG;AACrB,eAAOA,KAAI,KAAK,CAAC,CAAC;AAAA,MACpB;AACA,UAAI,IAAI,KAAK,SAAS;AACtB,UAAI,IAAI,KAAK,MAAM,GAAG,CAAC;AACvB,UAAI,WAAW,KAAK,CAAC;AACrB,UAAI,EAAE,IAAI,CAAAG,SAAO,oBAAoBA,MAAK,KAAK,CAAC;AAChD,UAAI,UAAU;AACZ,YAAI,aAAa,QAAQ,KAAK,yBAAyB,QAAQ,GAAG;AAEhE,qBAAW,oBAAoB,UAAU,KAAK;AAAA,QAChD,OAAO;AAEL,qBAAW,wBAAwB,UAAUD,OAAM,KAAK;AAAA,QAC1D;AAAA,MACF;AACA,aAAOF,KAAI,GAAG,GAAG,kBAAkB,UAAU,CAAC,CAAC;AAC/C,eAAS,oBAAoBG,MAAKC,QAAO;AACvC,eAAOD,KAAI,QAAQ,EAAE,SAASC,MAAK;AAAA,MACrC;AAAA,IACF;AACA,iBAAa,UAAU;AACvB,WAAO;AAAA,EACT,GAAG;AAAA,IACD,qBAAqB;AAAA,EACvB,CAAC;;;AChDM,WAAS,cAAc,KAAK;AACjC,QAAI,SAAS,GAAG,GAAG;AACjB,aAAO,MAAM;AAAA,IACf,WAAW,YAAY,GAAG,GAAG;AAC3B,aAAO,IAAI,MAAM,CAAC;AAAA,IACpB,OAAO;AACL,aAAO;AAAA,IACT;AAAA,EACF;AACO,WAAS,oBAAoB,GAAG;AACrC,WAAO,SAAS,CAAC,KAAK,YAAY,CAAC;AAAA,EACrC;;;ACVO,WAAS,kBAAkB,MAAM;AACtC,QAAI,KAAK,WAAW,KAAK,aAAa,KAAK,CAAC,CAAC,GAAG;AAC9C,aAAO,KAAK,MAAM;AAClB,UAAI,MAAM,KAAK,CAAC;AAChB,UAAI,oBAAoB,GAAG,GAAG;AAC5B,aAAK,CAAC,IAAI,cAAc,GAAG;AAAA,MAC7B;AAAA,IACF;AACA,WAAO;AAAA,EACT;;;ACVA,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,WAAW,UAAU,OAAO;AAC5D,MAAI,qBAAoC,wBAAQD,SAAMC,iBAAc,UAAQ;AACjF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,MACA,QAAAC;AAAA,MACA,OAAO;AAAA,IACT,IAAI;AACJ,QAAIC,OAAM,UAAU;AAAA,MAClB,OAAAJ;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,MACA,QAAAC;AAAA,MACA,OAAO;AAAA,IACT,CAAC;AASD,WAAOH,OAAM,OAAO;AAAA,MAClB,UAAU,SAAS,IAAI,MAAM;AAC3B,eAAO,kBAAkB,IAAI;AAC7B,YAAI;AACF,iBAAOI,KAAI,MAAM,MAAM,IAAI;AAAA,QAC7B,SAAS,KAAK;AACZ,gBAAM,eAAe,GAAG;AAAA,QAC1B;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,GAAG;AAAA,IACD,qBAAqB;AAAA,EACvB,CAAC;;;ACrCD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO,QAAQ;AACrC,MAAI,sBAAqC,wBAAQD,SAAMC,iBAAc,UAAQ;AAClF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAIC,QAAO,WAAW;AAAA,MACpB,OAAAH;AAAA,MACA,KAAAC;AAAA,MACA,QAAAC;AAAA,IACF,CAAC;AASD,WAAOF,OAAM,QAAQ;AAAA,MACnB,UAAU,SAAS,IAAI,MAAM;AAC3B,eAAO,kBAAkB,IAAI;AAC7B,YAAI;AACF,iBAAOG,MAAK,MAAM,MAAM,IAAI;AAAA,QAC9B,SAAS,KAAK;AACZ,gBAAM,eAAe,GAAG;AAAA,QAC1B;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,GAAG;AAAA,IACD,qBAAqB;AAAA,EACvB,CAAC;;;ACjCD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,WAAW,WAAW,OAAO;AAC7D,MAAI,qBAAoC,wBAAQD,SAAMC,iBAAc,UAAQ;AACjF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,MACA,SAAAC;AAAA,MACA,OAAO;AAAA,IACT,IAAI;AACJ,QAAIC,OAAM,UAAU;AAAA,MAClB,OAAAJ;AAAA,MACA,QAAAC;AAAA,MACA,SAAAC;AAAA,MACA,SAAAC;AAAA,MACA,OAAO;AAAA,IACT,CAAC;AASD,WAAOH,OAAM,OAAO;AAAA,MAClB,UAAU,SAAS,IAAI,MAAM;AAC3B,eAAO,kBAAkB,IAAI;AAC7B,YAAI;AACF,iBAAOI,KAAI,MAAM,MAAM,IAAI;AAAA,QAC7B,SAAS,KAAK;AACZ,gBAAM,eAAe,GAAG;AAAA,QAC1B;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,GAAG;AAAA,IACD,qBAAqB;AAAA,EACvB,CAAC;;;ACvCD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,WAAW,cAAc,SAAS,WAAW,aAAa,UAAU,YAAY,OAAO,UAAU,YAAY;AAC7I,MAAI,uBAAsC,wBAAQD,SAAMC,iBAAc,UAAQ;AACnF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,OAAAC;AAAA,MACA,SAAAC;AAAA,MACA,WAAAC;AAAA,MACA,QAAAC;AAAA,MACA,UAAAC;AAAA,MACA,KAAAC;AAAA,MACA,QAAAC;AAAA,MACA,YAAAC;AAAA,IACF,IAAI;AACJ,QAAIC,SAAQ,YAAY;AAAA,MACtB,OAAAZ;AAAA,MACA,QAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,OAAAC;AAAA,MACA,SAAAC;AAAA,MACA,WAAAC;AAAA,MACA,QAAAC;AAAA,MACA,UAAAC;AAAA,MACA,KAAAC;AAAA,MACA,QAAAC;AAAA,MACA,YAAAC;AAAA,IACF,CAAC;AAQD,WAAOX,OAAM,SAAS;AAAA,MACpB,UAAU,SAAS,IAAI,MAAM;AAC3B,YAAI,YAAY,KAAK,SAAS;AAC9B,YAAI,OAAO,KAAK,SAAS;AACzB,YAAI,OAAO,SAAS,WAAW;AAE7B,eAAK,KAAK,IAAI;AAAA,QAChB;AACA,eAAOY,OAAM,MAAM,MAAM,IAAI;AAAA,MAC/B;AAAA,IACF,CAAC;AAAA,EACH,GAAG;AAAA,IACD,qBAAqB;AAAA,EACvB,CAAC;;;ACjDD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,SAAS,UAAU,OAAO;AAShD,MAAI,qBAAoC,wBAAQD,SAAMC,iBAAc,UAAQ;AACjF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,OAAAC;AAAA,IACF,IAAI;AACJ,QAAIC,OAAM,UAAU;AAAA,MAClB,OAAAJ;AAAA,MACA,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,OAAAC;AAAA,IACF,CAAC;AAGD,WAAOH,OAAM,OAAO;AAAA,MAClB,UAAU,SAAS,IAAI,MAAM;AAE3B,YAAI,YAAY,KAAK,SAAS;AAC9B,YAAI,OAAO,KAAK,SAAS;AACzB,YAAI,SAAS,IAAI,GAAG;AAClB,eAAK,SAAS,IAAI,OAAO;AAAA,QAC3B;AACA,YAAI;AACF,iBAAOI,KAAI,MAAM,MAAM,IAAI;AAAA,QAC7B,SAAS,KAAK;AACZ,gBAAM,eAAe,GAAG;AAAA,QAC1B;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,GAAG;AAAA,IACD,qBAAqB;AAAA,EACvB,CAAC;;;AC3CD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,SAAS,KAAK;AAC9C,MAAI,wBAAuC,wBAAQD,SAAMC,iBAAc,UAAQ;AACpF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,OAAAC;AAAA,MACA,KAAAC;AAAA,IACF,IAAI;AACJ,QAAIC,UAAS,aAAa;AAAA,MACxB,OAAAJ;AAAA,MACA,QAAAC;AAAA,MACA,OAAAC;AAAA,MACA,KAAAC;AAAA,IACF,CAAC;AAQD,WAAOH,OAAM,UAAU;AAAA,MACrB,UAAU,SAAS,IAAI,MAAM;AAC3B,YAAI;AACF,iBAAOI,QAAO,MAAM,MAAM,IAAI;AAAA,QAChC,SAAS,KAAK;AACZ,gBAAM,eAAe,GAAG;AAAA,QAC1B;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,GAAG;AAAA,IACD,qBAAqB;AAAA,EACvB,CAAC;;;AChCD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,WAAW;AAC3C,MAAI,wBAAuC,wBAAQD,SAAMC,iBAAc,UAAQ;AACpF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AACJ,QAAIC,UAAS,aAAa;AAAA,MACxB,OAAAH;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,IACF,CAAC;AASD,WAAOF,OAAM,UAAU;AAAA,MACrB,UAAU,SAAS,IAAI,MAAM;AAE3B,YAAI,YAAY,KAAK,SAAS;AAC9B,YAAI,OAAO,KAAK,SAAS;AACzB,YAAI,SAAS,IAAI,GAAG;AAClB,eAAK,SAAS,IAAI,OAAO;AAAA,QAC3B,WAAW,YAAY,IAAI,GAAG;AAC5B,eAAK,SAAS,IAAI,KAAK,MAAM,CAAC;AAAA,QAChC;AACA,YAAI;AACF,iBAAOG,QAAO,MAAM,MAAM,IAAI;AAAA,QAChC,SAAS,KAAK;AACZ,gBAAM,eAAe,GAAG;AAAA,QAC1B;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,GAAG;AAAA,IACD,qBAAqB;AAAA,EACvB,CAAC;;;ACxCD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,YAAY,UAAU,WAAW;AACjE,MAAI,sBAAqC,wBAAQD,SAAMC,iBAAc,UAAQ;AAClF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,UAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AACJ,QAAIC,QAAO,WAAW;AAAA,MACpB,OAAAL;AAAA,MACA,QAAAC;AAAA,MACA,UAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,IACF,CAAC;AAQD,WAAOJ,OAAMF,SAAM;AAAA,MACjB,UAAU,SAAS,IAAI,MAAM;AAC3B,eAAO,kBAAkB,IAAI;AAC7B,YAAI;AACF,iBAAOO,MAAK,MAAM,MAAM,IAAI;AAAA,QAC9B,SAAS,KAAK;AACZ,gBAAM,eAAe,GAAG;AAAA,QAC1B;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,GAAG;AAAA,IACD,qBAAqB;AAAA,EACvB,CAAC;;;ACpCD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO,QAAQ,UAAU;AAS/C,MAAI,qBAAoC,wBAAQD,SAAMC,iBAAc,UAAQ;AACjF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,MAAAC;AAAA,MACA,UAAAC;AAAA,IACF,IAAI;AACJ,QAAIC,OAAM,UAAU;AAAA,MAClB,OAAAJ;AAAA,MACA,KAAAC;AAAA,MACA,MAAAC;AAAA,MACA,UAAAC;AAAA,IACF,CAAC;AACD,WAAOH,OAAM,OAAO;AAAA,MAClB,UAAU,SAAS,IAAI,MAAM;AAC3B,eAAO,kBAAkB,IAAI;AAC7B,YAAI;AACF,iBAAOI,KAAI,MAAM,MAAM,IAAI;AAAA,QAC7B,SAAS,KAAK;AACZ,gBAAM,eAAe,GAAG;AAAA,QAC1B;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,GAAG;AAAA,IACD,qBAAqB;AAAA,EACvB,CAAC;;;AC3BD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,OAAO,SAAS;AAChD,MAAI,qBAAoC,wBAAQD,SAAMC,iBAAc,UAAQ;AACjF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,KAAAC;AAAA,MACA,SAAAC;AAAA,IACF,IAAI;AACJ,QAAIC,OAAM,UAAU;AAAA,MAClB,OAAAJ;AAAA,MACA,QAAAC;AAAA,MACA,KAAAC;AAAA,MACA,SAAAC;AAAA,IACF,CAAC;AACD,WAAOH,OAAMF,SAAM;AAAA,MACjB,UAAU,SAAS,IAAI,MAAM;AAC3B,eAAO,kBAAkB,IAAI;AAC7B,YAAI;AACF,iBAAOM,KAAI,MAAM,MAAM,IAAI;AAAA,QAC7B,SAAS,KAAK;AACZ,gBAAM,eAAe,GAAG;AAAA,QAC1B;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,GAAG;AAAA,IACD,qBAAqB;AAAA,EACvB,CAAC;;;ACpCD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,aAAa,OAAO,YAAY,UAAU,YAAY,mBAAmB,WAAW,aAAa,WAAW,aAAa,UAAU,WAAW;AASpK,MAAI,6BAA4C,wBAAQD,SAAMC,iBAAc,UAAQ;AACzF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,WAAAC;AAAA,MACA,KAAAC;AAAA,MACA,UAAAC;AAAA,MACA,QAAAC;AAAA,MACA,UAAAC;AAAA,MACA,iBAAAC;AAAA,MACA,SAAAC;AAAA,MACA,WAAAC;AAAA,MACA,SAAAC;AAAA,MACA,WAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AACJ,QAAIC,eAAc,kBAAkB;AAAA,MAClC,OAAAb;AAAA,MACA,WAAAC;AAAA,MACA,KAAAC;AAAA,MACA,UAAAC;AAAA,MACA,QAAAC;AAAA,MACA,UAAAC;AAAA,MACA,iBAAAC;AAAA,MACA,SAAAC;AAAA,MACA,WAAAC;AAAA,MACA,SAAAC;AAAA,MACA,WAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,IACF,CAAC;AACD,WAAOZ,OAAM,eAAe;AAAA,MAC1B,sCAAsCa;AAAA,MACtC,8CAA8C,CAAC,KAAK,MAAM,QAAQA,aAAY,KAAK,MAAMC,eAAc,GAAG,CAAC;AAAA,MAC3G,+CAA+CD;AAAA,MAC/C,uDAAuD,CAAC,KAAK,MAAM,QAAQ,QAAQA,aAAY,KAAK,MAAM,QAAQC,eAAc,GAAG,CAAC;AAAA,MACpI,kCAAkCD;AAAA,MAClC,0CAA0C,CAAC,MAAM,MAAM,QAAQA,aAAY,MAAM,MAAMC,eAAc,GAAG,CAAC;AAAA,MACzG,2CAA2CD;AAAA,MAC3C,mDAAmD,CAAC,MAAM,MAAM,QAAQ,QAAQA,aAAY,MAAM,MAAM,QAAQC,eAAc,GAAG,CAAC;AAAA,IACpI,CAAC;AACD,aAASA,eAAc,KAAK;AAE1B,aAAO,kBAAkB,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC;AAAA,IACvC;AAAA,EACF,GAAG;AAAA,IACD,qBAAqB;AAAA,EACvB,CAAC;;;AChDD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO,WAAW;AACxC,MAAI,wBAAuC,wBAAQD,SAAMC,iBAAc,UAAQ;AACpF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AACJ,QAAIC,UAAS,aAAa;AAAA,MACxB,OAAAH;AAAA,MACA,KAAAC;AAAA,MACA,WAAAC;AAAA,IACF,CAAC;AACD,WAAOF,OAAMF,SAAM;AAAA,MACjB,UAAU,SAAS,IAAI,MAAM;AAE3B,YAAI,KAAK,WAAW,KAAK,aAAa,KAAK,CAAC,CAAC,GAAG;AAC9C,cAAI,MAAM,KAAK,CAAC;AAChB,cAAI,SAAS,GAAG,GAAG;AACjB,iBAAK,CAAC,IAAI,MAAM;AAAA,UAClB,WAAW,YAAY,GAAG,GAAG;AAC3B,iBAAK,CAAC,IAAI,IAAI,MAAM,CAAC;AAAA,UACvB;AAAA,QACF;AACA,YAAI;AACF,iBAAOK,QAAO,MAAM,MAAM,IAAI;AAAA,QAChC,SAAS,KAAK;AACZ,gBAAM,eAAe,GAAG;AAAA,QAC1B;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,GAAG;AAAA,IACD,qBAAqB;AAAA,EACvB,CAAC;;;ACzCD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,OAAO,YAAY,YAAY,UAAU,aAAa,OAAO;AASnF,MAAI,0BAAyC,wBAAQD,SAAMC,iBAAc,UAAQ;AACtF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,UAAAC;AAAA,MACA,UAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,OAAO;AAAA,IACT,IAAI;AACJ,QAAIC,YAAW,eAAe;AAAA,MAC5B,OAAAN;AAAA,MACA,KAAAC;AAAA,MACA,UAAAC;AAAA,MACA,UAAAC;AAAA,MACA,QAAAC;AAAA,MACA,WAAAC;AAAA,MACA,OAAO;AAAA,IACT,CAAC;AACD,WAAOL,OAAMF,SAAM;AAAA,MACjB,UAAU,SAAS,IAAI,MAAM;AAC3B,eAAO,kBAAkB,IAAI;AAC7B,YAAI;AACF,iBAAOQ,UAAS,MAAM,MAAM,IAAI;AAAA,QAClC,SAAS,KAAK;AACZ,gBAAM,eAAe,GAAG;AAAA,QAC1B;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH,GAAG;AAAA,IACD,qBAAqB;AAAA,EACvB,CAAC;;;AC1CD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,SAAS,KAAK;AAC9C,MAAI,uBAAsC,wBAAQD,SAAMC,iBAAc,UAAQ;AACnF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,OAAAC;AAAA,MACA,KAAAC;AAAA,IACF,IAAI;AACJ,QAAIC,SAAQ,YAAY;AAAA,MACtB,OAAAJ;AAAA,MACA,QAAAC;AAAA,MACA,OAAAC;AAAA,MACA,KAAAC;AAAA,IACF,CAAC;AACD,WAAOH,OAAMF,SAAM;AAAA,MACjB,0BAA0B,SAAS,qBAAqB,UAAU,QAAQ;AACxE,eAAOM,OAAM,iCAAiC,QAAQ,GAAG,MAAM;AAAA,MACjE;AAAA,MACA,2CAA2C,SAAS,oCAAoC,UAAU,QAAQ,SAAS;AACjH,eAAOA,OAAM,iCAAiC,QAAQ,GAAG,QAAQ,OAAO;AAAA,MAC1E;AAAA,IACF,CAAC;AACD,aAAS,iCAAiC,UAAU;AAClD,aAAO,SAAS,QAAQ,eAAe,OAAK;AAC1C,YAAI,QAAQ,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG;AAChC,YAAI,SAAS,MAAM,IAAI,SAAU,MAAM;AACrC,cAAI,CAAC,MAAM,IAAI,KAAK,KAAK,SAAS,GAAG;AACnC,mBAAO,SAAS,IAAI,IAAI;AAAA,UAC1B,OAAO;AACL,mBAAO;AAAA,UACT;AAAA,QACF,CAAC;AACD,eAAO,MAAM,OAAO,KAAK,GAAG;AAAA,MAC9B,CAAC;AAAA,IACH;AAAA,EACF,GAAG;AAAA,IACD,qBAAqB;AAAA,EACvB,CAAC;;;ACtCD,MAAIC,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,SAAS,OAAO,eAAe,OAAO,QAAQ;AAC9E,MAAI,qBAAoC,wBAAQD,SAAMC,iBAAc,UAAQ;AACjF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAIC,OAAM,UAAU;AAAA,MAClB,OAAAN;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,QAAAC;AAAA,IACF,CAAC;AACD,aAAS,aAAa,MAAME,OAAM,OAAO;AACvC,UAAI,aAAa,KAAK,CAAC,EAAE,QAAQ,EAAE,SAAS,KAAK;AACjD,UAAI,CAAC,aAAa,UAAU,KAAK,CAACD,KAAI,YAAY,IAAI,GAAG;AACvD,eAAO;AAAA,MACT;AACA,UAAI,aAAa,KAAK,CAAC,EAAE,QAAQ,EAAE,SAAS,KAAK;AACjD,aAAOA,KAAI,YAAY,UAAU;AAAA,IACnC;AACA,iBAAa,UAAU;AACvB,WAAO;AAAA,EACT,GAAG;AAAA,IACD,qBAAqB;AAAA,EACvB,CAAC;;;AC/BD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,eAAe,eAAe,QAAQ;AACtE,MAAI,oBAAmC,wBAAQD,SAAMC,iBAAc,UAAQ;AAChF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAIC,MAAK,SAAS;AAAA,MAChB,OAAAL;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,IACF,CAAC;AACD,aAAS,YAAY,MAAME,OAAM,OAAO;AACtC,UAAI,aAAa,KAAK,CAAC,EAAE,QAAQ,EAAE,SAAS,KAAK;AACjD,UAAI,CAAC,aAAa,UAAU,KAAKD,IAAG,YAAY,KAAK,GAAG;AACtD,eAAO;AAAA,MACT;AACA,UAAI,aAAa,KAAK,CAAC,EAAE,QAAQ,EAAE,SAAS,KAAK;AACjD,aAAOA,IAAG,YAAY,UAAU;AAAA,IAClC;AACA,gBAAY,UAAU;AACtB,WAAO;AAAA,EACT,GAAG;AAAA,IACD,qBAAqB;AAAA,EACvB,CAAC;;;AC7BD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,QAAQ,WAAW,WAAW;AAC9D,MAAI,yBAAwC,wBAAQD,SAAMC,iBAAc,UAAQ;AACrF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,MAAAC;AAAA,MACA,SAAAC;AAAA,MACA,WAAAC;AAAA,IACF,IAAI;AACJ,QAAIC,WAAU,cAAc;AAAA,MAC1B,OAAAL;AAAA,MACA,QAAAC;AAAA,MACA,MAAAC;AAAA,MACA,SAAAC;AAAA,MACA,WAAAC;AAAA,IACF,CAAC;AACD,aAAS,iBAAiB,MAAME,OAAM,OAAO;AAC3C,UAAI,OAAO,KAAK,CAAC,EAAE,QAAQ,EAAE,SAAS,KAAK;AAG3C,UAAI,CAAC,aAAa,IAAI,KAAK,QAAQ,QAAQ,SAAS,QAAW;AAC7D,eAAO;AAAA,MACT;AAGA,UAAI,QAAQ,KAAK,CAAC,EAAE,QAAQ,EAAE,SAAS,KAAK;AAC5C,aAAOD,SAAQ,MAAM,KAAK;AAAA,IAC5B;AACA,qBAAiB,UAAU;AAC3B,WAAO;AAAA,EACT,GAAG;AAAA,IACD,qBAAqB;AAAA,EACvB,CAAC;;;ACjCD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,SAAS,OAAO,eAAe,OAAO,QAAQ;AAC9E,MAAI,wBAAuC,wBAAQD,SAAMC,iBAAc,UAAQ;AACpF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAIC,UAAS,aAAa;AAAA,MACxB,OAAAN;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,OAAAC;AAAA,MACA,KAAAC;AAAA,MACA,QAAAC;AAAA,IACF,CAAC;AACD,aAAS,gBAAgB,MAAME,OAAM,OAAO;AAC1C,UAAI,aAAa,KAAK,CAAC,EAAE,QAAQ,EAAE,SAAS,KAAK;AACjD,UAAI,CAAC,aAAa,UAAU,GAAG;AAC7B,YAAI,MAAM,UAAU,GAAG;AACrB,iBAAO;AAAA,QACT;AACA,YAAI,eAAe,KAAK,eAAe,OAAO;AAC5C,iBAAO;AAAA,QACT;AAAA,MACF;AACA,UAAI,aAAa,KAAK,CAAC,EAAE,QAAQ,EAAE,SAAS,KAAK;AACjD,aAAOD,QAAO,YAAY,UAAU;AAAA,IACtC;AACA,oBAAgB,UAAU;AAC1B,WAAO;AAAA,EACT,GAAG;AAAA,IACD,qBAAqB;AAAA,EACvB,CAAC;;;ACpCD,MAAIE,UAAO;AACX,MAAIC,kBAAe,CAAC,SAAS,UAAU,eAAe,eAAe,QAAQ;AACtE,MAAI,uBAAsC,wBAAQD,SAAMC,iBAAc,UAAQ;AACnF,QAAI;AAAA,MACF,OAAAC;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,IACF,IAAI;AACJ,QAAIC,SAAQ,YAAY;AAAA,MACtB,OAAAL;AAAA,MACA,QAAAC;AAAA,MACA,aAAAC;AAAA,MACA,aAAAC;AAAA,MACA,QAAAC;AAAA,IACF,CAAC;AACD,aAAS,eAAe,MAAME,OAAM,OAAO;AACzC,UAAI,aAAa,KAAK,CAAC,EAAE,QAAQ,EAAE,SAAS,KAAK;AACjD,UAAI,CAAC,aAAa,UAAU,GAAG;AAC7B,YAAI,MAAM,UAAU,GAAG;AACrB,iBAAO;AAAA,QACT;AACA,YAAI,eAAe,IAAI;AACrB,iBAAO;AAAA,QACT;AACA,YAAI,eAAe,MAAM;AACvB,iBAAO;AAAA,QACT;AAAA,MACF;AACA,UAAI,aAAa,KAAK,CAAC,EAAE,QAAQ,EAAE,SAAS,KAAK;AACjD,aAAOD,OAAM,YAAY,UAAU;AAAA,IACrC;AACA,mBAAe,UAAU;AACzB,WAAO;AAAA,EACT,GAAG;AAAA,IACD,qBAAqB;AAAA,EACvB,CAAC;;;AChCM,MAAI,YAA2B,qCAAqB;AAAA,IACzD,QAAAE;AAAA,EACF,CAAC;AACM,MAAIC,WAAyB,mCAAmB,CAAC,CAAC;AAClD,MAAIC,KAAmB,wBAAQ;AAAA,IACpC;AAAA,IACA,QAAAF;AAAA,EACF,CAAC;AACM,MAAI,SAAwB,4BAAY,CAAC,CAAC;AAC1C,MAAI,gBAA+B,oCAAoB;AAAA,IAC5D;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAIG,YAA0B,oCAAoB,CAAC,CAAC;AACpD,MAAI,IAAmB,wBAAQ;AAAA,IACpC,SAAAF;AAAA,EACF,CAAC;AACM,MAAI,YAA2B,+BAAe;AAAA,IACnD;AAAA,IACA,QAAAD;AAAA,EACF,CAAC;AACM,MAAII,QAAsB,2BAAW;AAAA,IAC1C;AAAA,IACA,QAAAJ;AAAA,EACF,CAAC;AACM,MAAI,SAAwB,6BAAa;AAAA,IAC9C;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,SAAwB,kCAAkB,CAAC,CAAC;AAChD,MAAI,OAAsB,0BAAU;AAAA,IACzC;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,QAAuB,2BAAW,CAAC,CAAC;AACxC,MAAIK,OAAqB,0BAAU;AAAA,IACxC;AAAA,IACA,QAAAL;AAAA,EACF,CAAC;AACM,MAAI,QAAuB,iCAAiB,CAAC,CAAC;AAC9C,MAAI,YAA2B,gCAAgB,CAAC,CAAC;AACjD,MAAI,UAAyB,8BAAc;AAAA,IAChD;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,gBAA+B,oCAAoB;AAAA,IAC5D;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAIM,OAAqB,0BAAU;AAAA,IACxC;AAAA,IACA,QAAAN;AAAA,EACF,CAAC;AACM,MAAI,QAAuB,2BAAW,CAAC,CAAC;AACxC,MAAIO,WAAyB,8BAAc,CAAC,CAAC;AAC7C,MAAI,cAA6B,uCAAuB;AAAA,IAC7D;AAAA,IACA,QAAAP;AAAA,EACF,CAAC;AACM,MAAI,eAA8B,mCAAmB;AAAA,IAC1D;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,MAAqB,0BAAU;AAAA,IACxC;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAIQ,MAAoB,yBAAS;AAAA,IACtC;AAAA,IACA,QAAAR;AAAA,EACF,CAAC;AACM,MAAI,WAA0B,+BAAe,CAAC,CAAC;AAC/C,MAAI,QAAuB,4BAAY;AAAA,IAC5C;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAIS,SAAuB,4BAAY;AAAA,IAC5C;AAAA,IACA,SAAAR;AAAA,IACA;AAAA,IACA,UAAAE;AAAA,EACF,CAAC;AACM,MAAI,kBAAiC,sCAAsB;AAAA,IAChE;AAAA,IACA,QAAAH;AAAA,EACF,CAAC;AACM,MAAIU,OAAqB,0BAAU;AAAA,IACxC,OAAAD;AAAA,EACF,CAAC;AACM,MAAIE,QAAsB,2BAAW;AAAA,IAC1C,SAAAV;AAAA,IACA,QAAAD;AAAA,IACA,OAAAS;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C;AAAA,IACA,SAAAR;AAAA,IACA,QAAAD;AAAA,IACA,OAAAS;AAAA,EACF,CAAC;AACM,MAAI,YAA2B,gCAAgB;AAAA,IACpD,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,MAAqB,0BAAU;AAAA,IACxC,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,QAAuB,4BAAY;AAAA,IAC5C;AAAA,IACA,SAAAR;AAAA,IACA,QAAAD;AAAA,IACA,OAAAS;AAAA,EACF,CAAC;AACM,MAAIG,SAAuB,4BAAY;AAAA,IAC5C,OAAAH;AAAA,EACF,CAAC;AACM,MAAII,QAAsB,2BAAW;AAAA,IAC1C,OAAAJ;AAAA,EACF,CAAC;AACM,MAAIK,SAAuB,4BAAY;AAAA,IAC5C,SAAAb;AAAA,IACA,QAAAD;AAAA,IACA,OAAAS;AAAA,EACF,CAAC;AACM,MAAI,SAAwB,6BAAa;AAAA,IAC9C,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,SAAwB,6BAAa;AAAA,IAC9C,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,UAAyB,8BAAc;AAAA,IAChD,OAAAA;AAAA,EACF,CAAC;AACM,MAAIM,SAAuB,4BAAY;AAAA,IAC5C,OAAAN;AAAA,EACF,CAAC;AACM,MAAI,eAA8B,mCAAmB;AAAA,IAC1D,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,UAAyB,8BAAc;AAAA,IAChD,SAAAR;AAAA,IACA,OAAAQ;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C,OAAAA;AAAA,EACF,CAAC;AACM,MAAIO,OAAqB,0BAAU;AAAA,IACxC,OAAAP;AAAA,EACF,CAAC;AACM,MAAI,MAAqB,0BAAU;AAAA,IACxC;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,MAAqB,0BAAU;AAAA,IACxC;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,cAA6B,kCAAkB;AAAA,IACxD,QAAAT;AAAA,IACA,OAAAS;AAAA,EACF,CAAC;AACM,MAAI,MAAqB,0BAAU;AAAA,IACxC,OAAAA;AAAA,EACF,CAAC;AACM,MAAIQ,OAAqB,0BAAU;AAAA,IACxC,OAAAR;AAAA,EACF,CAAC;AACM,MAAIS,SAAuB,4BAAY;AAAA,IAC5C,SAAAjB;AAAA,IACA,OAAAQ;AAAA,EACF,CAAC;AACM,MAAIU,UAAwB,6BAAa;AAAA,IAC9C,OAAAV;AAAA,EACF,CAAC;AACM,MAAIW,WAAyB,8BAAc;AAAA,IAChD,OAAAX;AAAA,EACF,CAAC;AACM,MAAIY,WAAyB,8BAAc;AAAA,IAChD,OAAAZ;AAAA,EACF,CAAC;AACM,MAAIa,UAAwB,6BAAa;AAAA,IAC9C,OAAAb;AAAA,EACF,CAAC;AACM,MAAI,oBAAmC,wCAAwB;AAAA,IACpE,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,MAAqB,0BAAU;AAAA,IACxC,QAAAa;AAAA,IACA,OAAAb;AAAA,EACF,CAAC;AACM,MAAI,KAAoB,yBAAS;AAAA,IACtC,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,YAA2B,gCAAgB;AAAA,IACpD,OAAAA;AAAA,EACF,CAAC;AACM,MAAIc,SAAuB,4BAAY;AAAA,IAC5C,OAAAd;AAAA,EACF,CAAC;AACM,MAAI,YAA2B,gCAAgB;AAAA,IACpD,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,UAAyB,8BAAc;AAAA,IAChD,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,QAAuB,4BAAY;AAAA,IAC5C;AAAA,IACA,QAAAT;AAAA,EACF,CAAC;AACM,MAAI,SAAwB,6BAAa;AAAA,IAC9C,SAAAC;AAAA,IACA,OAAAQ;AAAA,EACF,CAAC;AACM,MAAIe,SAAuB,4BAAY;AAAA,IAC5C,SAAAvB;AAAA,IACA,QAAAD;AAAA,IACA,OAAAS;AAAA,EACF,CAAC;AACM,MAAIgB,QAAsB,2BAAW;AAAA,IAC1C,SAAAxB;AAAA,IACA,QAAAD;AAAA,IACA,OAAAS;AAAA,EACF,CAAC;AACM,MAAIiB,OAAqB,gBAAAC,WAAU;AAAA,IACxC,OAAAlB;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C,OAAAc;AAAA,IACA;AAAA,IACA,OAAAd;AAAA,EACF,CAAC;AACM,MAAI,iBAAgC,qCAAqB;AAAA,IAC9D,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,MAAqB,0BAAU;AAAA,IACxC,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,SAAwB,6BAAa;AAAA,IAC9C,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,MAAqB,0BAAU;AAAA,IACxC,QAAAa;AAAA,IACA,OAAAb;AAAA,EACF,CAAC;AACM,MAAI,aAA4B,iCAAiB;AAAA,IACtD,QAAAT;AAAA,IACA,OAAAS;AAAA,EACF,CAAC;AACM,MAAI,QAAuB,4BAAY;AAAA,IAC5C,OAAAA;AAAA,EACF,CAAC;AACM,MAAImB,UAAwB,6BAAa;AAAA,IAC9C,QAAA5B;AAAA,IACA,OAAAS;AAAA,EACF,CAAC;AACM,MAAI,KAAoB,yBAAS;AAAA,IACtC,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,MAAqB,0BAAU;AAAA,IACxC;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAIoB,QAAsB,2BAAW;AAAA,IAC1C;AAAA,IACA,UAAA1B;AAAA,IACA;AAAA,IACA,OAAAM;AAAA,EACF,CAAC;AACM,MAAIqB,OAAqB,0BAAU;AAAA,IACxC,OAAArB;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,eAA8B,wCAAwB;AAAA,IAC/D;AAAA,IACA;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,YAA2B,gCAAgB;AAAA,IACpD,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,SAAwB,6BAAa;AAAA,IAC9C,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,SAAwB,6BAAa;AAAA,IAC9C,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,iBAAgC,qCAAqB;AAAA,IAC9D,OAAAA;AAAA,EACF,CAAC;AACM,MAAIsB,OAAqB,0BAAU;AAAA,IACxC,OAAAtB;AAAA,EACF,CAAC;AACM,MAAI,SAAwB,6BAAa;AAAA,IAC9C,OAAAA;AAAA,EACF,CAAC;AACM,MAAIuB,UAAwB,6BAAa;AAAA,IAC9C,OAAAvB;AAAA,EACF,CAAC;AACM,MAAIwB,SAAuB,4BAAY;AAAA,IAC5C,SAAAhC;AAAA,IACA,QAAAD;AAAA,IACA,OAAAS;AAAA,EACF,CAAC;AACM,MAAI,QAAuB,4BAAY;AAAA,IAC5C;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C;AAAA,IACA,SAAAR;AAAA,IACA,QAAAD;AAAA,IACA,OAAAS;AAAA,EACF,CAAC;AACM,MAAI,YAA2B,gCAAgB;AAAA,IACpD;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,sBAAqC,0CAA0B;AAAA,IACxE,OAAAA;AAAA,EACF,CAAC;AACM,MAAIyB,QAAsB,2BAAW;AAAA,IAC1C,OAAAzB;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,MAAqB,0BAAU;AAAA,IACxC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,kBAAiC,sCAAsB;AAAA,IAChE;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI0B,YAA0B,+BAAe;AAAA,IAClD;AAAA,IACA,KAAAT;AAAA,IACA,OAAAjB;AAAA,EACF,CAAC;AACM,MAAI,aAA4B,iCAAiB;AAAA,IACtD,QAAAT;AAAA,IACA,OAAAS;AAAA,EACF,CAAC;AACM,MAAI,SAAwB,6BAAa;AAAA,IAC9C;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI2B,UAAwB,6BAAa;AAAA,IAC9C;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAA3B;AAAA,EACF,CAAC;AACM,MAAI,qBAAoC,yCAAyB;AAAA,IACtE;AAAA,IACA,QAAA2B;AAAA,IACA,OAAA3B;AAAA,EACF,CAAC;AACM,MAAI,WAA0B,+BAAe;AAAA,IAClD;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAA2B;AAAA,IACA;AAAA,IACA,OAAA3B;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C;AAAA,IACA,QAAAT;AAAA,IACA,QAAAoC;AAAA,IACA,OAAA3B;AAAA,EACF,CAAC;AACM,MAAI,YAA2B,gCAAgB;AAAA,IACpD,QAAAT;AAAA,IACA,MAAAyB;AAAA,IACA,OAAAhB;AAAA,EACF,CAAC;AACM,MAAI4B,UAAwB,6BAAa;AAAA,IAC9C,QAAArC;AAAA,IACA,QAAAoC;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C;AAAA,IACA,OAAA3B;AAAA,EACF,CAAC;AACM,MAAI6B,QAAsB,2BAAW;AAAA,IAC1C,OAAA7B;AAAA,EACF,CAAC;AACM,MAAI,SAAwB,6BAAa;AAAA,IAC9C;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI8B,QAAsB,2BAAW;AAAA,IAC1C,SAAAtC;AAAA,IACA,QAAAD;AAAA,IACA,OAAAS;AAAA,EACF,CAAC;AACM,MAAI+B,WAAyB,8BAAc;AAAA,IAChD,OAAA/B;AAAA,EACF,CAAC;AACM,MAAIgC,QAAsB,2BAAW;AAAA,IAC1C,OAAAhC;AAAA,EACF,CAAC;AACM,MAAI,YAA2B,gCAAgB;AAAA,IACpD,QAAA2B;AAAA,IACA,OAAA3B;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C;AAAA,IACA,QAAAT;AAAA,IACA,QAAAoC;AAAA,IACA,OAAA3B;AAAA,EACF,CAAC;AACM,MAAIiC,SAAuB,4BAAY;AAAA,IAC5C;AAAA,IACA,QAAA1C;AAAA,IACA,QAAAoC;AAAA,IACA,OAAA3B;AAAA,EACF,CAAC;AACM,MAAI,QAAuB,4BAAY;AAAA,IAC5C;AAAA,IACA,SAAAR;AAAA,IACA,QAAAD;AAAA,IACA,OAAAS;AAAA,EACF,CAAC;AACM,MAAIkC,QAAsB,2BAAW;AAAA,IAC1C,SAAA1C;AAAA,IACA,QAAAD;AAAA,IACA,OAAAS;AAAA,EACF,CAAC;AACM,MAAI,MAAqB,0BAAU;AAAA,IACxC,QAAAa;AAAA,IACA,OAAAb;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,aAA4B,iCAAiB;AAAA,IACtD;AAAA,IACA;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C;AAAA,IACA;AAAA,IACA,QAAA2B;AAAA,IACA,OAAA3B;AAAA,EACF,CAAC;AACM,MAAI,QAAuB,4BAAY;AAAA,IAC5C;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAA2B;AAAA,IACA,OAAA3B;AAAA,EACF,CAAC;AACM,MAAI,WAA0B,+BAAe;AAAA,IAClD,UAAAN;AAAA,IACA,OAAAM;AAAA,EACF,CAAC;AACM,MAAI,WAA0B,+BAAe;AAAA,IAClD;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAT;AAAA,IACA,QAAAoC;AAAA,IACA,OAAA3B;AAAA,EACF,CAAC;AACM,MAAImC,aAA2B,gCAAgB;AAAA,IACpD;AAAA,IACA,OAAAnC;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C,QAAA2B;AAAA,IACA;AAAA,IACA,OAAA3B;AAAA,EACF,CAAC;AACM,MAAI,YAA2B,gCAAgB;AAAA,IACpD,WAAAmC;AAAA,IACA,OAAAnC;AAAA,EACF,CAAC;AAEM,MAAI,oBAAmC,wCAAwB;AAAA,IACpE,SAAAoC;AAAA,IACA,QAAAC;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAIC,WAAyB,8BAAc;AAAA,IAChD;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C,QAAAC;AAAA,IACA;AAAA,IACA,SAAAD;AAAA,IACA,OAAAD;AAAA,EACF,CAAC;AACM,MAAIG,WAAyB,8BAAc;AAAA,IAChD,WAAAC;AAAA,IACA,QAAAL;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAIK,SAAuB,4BAAY;AAAA,IAC5C;AAAA,IACA;AAAA,IACA,QAAAH;AAAA,IACA;AAAA,IACA,QAAAH;AAAA,IACA,OAAAC;AAAA,IACA,OAAAM;AAAA,EACF,CAAC;AACM,MAAI,aAA4B,iCAAiB;AAAA,IACtD,OAAAN;AAAA,EACF,CAAC;AACM,MAAI,YAA2B,gCAAgB;AAAA,IACpD;AAAA,IACA,UAAAO;AAAA,IACA,QAAAL;AAAA,IACA,WAAAE;AAAA,IACA;AAAA,IACA,OAAAJ;AAAA,EACF,CAAC;AACM,MAAIQ,QAAsB,2BAAW;AAAA,IAC1C;AAAA,IACA,SAAAC;AAAA,IACA,UAAAF;AAAA,IACA,QAAAL;AAAA,IACA;AAAA,IACA,QAAAH;AAAA,IACA,OAAAC;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAIU,UAAwB,6BAAa;AAAA,IAC9C,WAAAN;AAAA,IACA,QAAAL;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,QAAuB,4BAAY;AAAA,IAC5C;AAAA,IACA;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,YAA2B,gCAAgB;AAAA,IACpD;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,eAA8B,mCAAmB;AAAA,IAC1D,SAAAC;AAAA,IACA,OAAAD;AAAA,EACF,CAAC;AACM,MAAI,cAA6B,kCAAkB;AAAA,IACxD,QAAAU;AAAA,IACA;AAAA,IACA,QAAAX;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAIW,SAAuB,4BAAY;AAAA,IAC5C;AAAA,IACA,QAAAT;AAAA,IACA;AAAA,IACA,QAAAH;AAAA,IACA,OAAAM;AAAA,IACA,OAAAL;AAAA,IACA,OAAAM;AAAA,EACF,CAAC;AACM,MAAIM,OAAqB,0BAAU;AAAA,IACxC;AAAA,IACA;AAAA,IACA,QAAAF;AAAA,IACA,QAAAR;AAAA,IACA;AAAA,IACA,QAAAH;AAAA,IACA,OAAAM;AAAA,IACA,OAAAL;AAAA,IACA,OAAAM;AAAA,EACF,CAAC;AACM,MAAI,aAA4B,iCAAiB;AAAA,IACtD,QAAAJ;AAAA,IACA,OAAAF;AAAA,EACF,CAAC;AACM,MAAI,SAAwB,6BAAa;AAAA,IAC9C;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAU;AAAA,IACA,QAAAR;AAAA,IACA,QAAAH;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,MAAqB,0BAAU;AAAA,IACxC,QAAAU;AAAA,IACA;AAAA,IACA,QAAAX;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,YAA2B,gCAAgB;AAAA,IACpD;AAAA,IACA,QAAAU;AAAA,IACA;AAAA,IACA,QAAAX;AAAA,IACA,OAAAC;AAAA,IACA,OAAAM;AAAA,EACF,CAAC;AACM,MAAI,SAAwB,6BAAa;AAAA,IAC9C;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAP;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAIa,OAAqB,0BAAU;AAAA,IACxC,QAAAX;AAAA,IACA,OAAAY;AAAA,IACA;AAAA,IACA,SAAAb;AAAA,IACA,OAAAD;AAAA,EACF,CAAC;AACM,MAAIe,OAAqB,0BAAU;AAAA,IACxC;AAAA,IACA,QAAAL;AAAA,IACA,QAAAR;AAAA,IACA;AAAA,IACA,QAAAH;AAAA,IACA,OAAAM;AAAA,IACA,OAAAL;AAAA,IACA,OAAAM;AAAA,EACF,CAAC;AACM,MAAI,UAAyB,8BAAc;AAAA,IAChD;AAAA,IACA,QAAAI;AAAA,IACA;AAAA,IACA,QAAAX;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,UAAyB,8BAAc;AAAA,IAChD;AAAA,IACA,SAAAF;AAAA,IACA,QAAAC;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,KAAoB,yBAAS;AAAA,IACtC;AAAA,IACA,QAAAU;AAAA,IACA;AAAA,IACA,QAAAX;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,KAAoB,yBAAS;AAAA,IACtC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAD;AAAA,IACA;AAAA,IACA,MAAAiB;AAAA,IACA,MAAAC;AAAA,IACA;AAAA,IACA,OAAAjB;AAAA,IACA;AAAA,IACA,OAAAM;AAAA,EACF,CAAC;AACM,MAAI,kBAAiC,sCAAsB;AAAA,IAChE;AAAA,IACA,QAAAI;AAAA,IACA;AAAA,IACA,QAAAX;AAAA,IACA,OAAAC;AAAA,IACA,OAAAM;AAAA,EACF,CAAC;AACM,MAAI,UAAyB,8BAAc;AAAA,IAChD;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAI;AAAA,IACA,QAAAR;AAAA,IACA,QAAAH;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,WAA0B,+BAAe;AAAA,IAClD;AAAA,IACA,QAAAU;AAAA,IACA;AAAA,IACA,QAAAX;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAI,KAAoB,yBAAS;AAAA,IACtC,QAAAU;AAAA,IACA,QAAAX;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,YAA2B,gCAAgB;AAAA,IACpD,QAAAE;AAAA,IACA,SAAAD;AAAA,IACA,OAAAD;AAAA,EACF,CAAC;AACM,MAAI,SAAwB,6BAAa;AAAA,IAC9C;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAD;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,MAAqB,0BAAU;AAAA,IACxC;AAAA,IACA;AAAA,IACA,QAAAU;AAAA,IACA,QAAAX;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAIkB,OAAqB,0BAAU;AAAA,IACxC;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAR;AAAA,IACA;AAAA,IACA,QAAAX;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAImB,SAAuB,4BAAY;AAAA,IAC5C;AAAA,IACA;AAAA,IACA,QAAAT;AAAA,IACA;AAAA,IACA,QAAAX;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,SAAwB,6BAAa;AAAA,IAC9C,QAAAU;AAAA,IACA;AAAA,IACA,QAAAX;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,QAAuB,4BAAY;AAAA,IAC5C;AAAA,IACA,QAAAU;AAAA,IACA;AAAA,IACA,QAAAX;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAIoB,UAAwB,6BAAa;AAAA,IAC9C;AAAA,IACA;AAAA,IACA,QAAAV;AAAA,IACA,QAAAX;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,UAAyB,8BAAc;AAAA,IAChD;AAAA,IACA;AAAA,IACA;AAAA,IACA,WAAAI;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAJ;AAAA,EACF,CAAC;AACM,MAAI,UAAyB,8BAAc;AAAA,IAChD;AAAA,IACA;AAAA,IACA,UAAAO;AAAA,IACA,QAAAG;AAAA,IACA,QAAAR;AAAA,IACA;AAAA,IACA,QAAAH;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAIqB,eAA6B,kCAAkB;AAAA,IACxD,QAAAX;AAAA,IACA,QAAAX;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,cAA6B,kCAAkB;AAAA,IACxD;AAAA,IACA;AAAA,IACA,WAAAI;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAJ;AAAA,EACF,CAAC;AACM,MAAI,QAAuB,4BAAY;AAAA,IAC5C,QAAAD;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,MAAqB,0BAAU;AAAA,IACxC;AAAA,IACA;AAAA,IACA,QAAAD;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C,QAAAD;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,WAA0B,+BAAe;AAAA,IAClD,KAAAsB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,MAAAL;AAAA,IACA;AAAA,IACA,OAAAjB;AAAA,EACF,CAAC;AACM,MAAI,YAA2B,gCAAgB;AAAA,IACpD;AAAA,IACA;AAAA,IACA,QAAAU;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAX;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,YAA2B,gCAAgB;AAAA,IACpD,aAAAqB;AAAA,IACA;AAAA,IACA,OAAArB;AAAA,EACF,CAAC;AACM,MAAI,gBAA+B,yCAAyB;AAAA,IACjE;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAIuB,SAAuB,4BAAY;AAAA,IAC5C,KAAAD;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,MAAAL;AAAA,IACA,OAAAjB;AAAA,EACF,CAAC;AACM,MAAI,uBAAsC,gDAAgC;AAAA,IAC/E;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAI,QAAuB,iCAAiB;AAAA,IACjD;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAI,YAA2B,gCAAgB;AAAA,IACpD,KAAAsB;AAAA,IACA,KAAAJ;AAAA,IACA;AAAA,IACA,QAAAhB;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAAJ;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,SAAwB,6BAAa;AAAA,IAC9C;AAAA,IACA,KAAAkB;AAAA,IACA,QAAAhB;AAAA,IACA;AAAA,IACA,WAAAE;AAAA,IACA,KAAAW;AAAA,IACA;AAAA,IACA,OAAAf;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAI,WAA0B,+BAAe;AAAA,IAClD;AAAA,IACA;AAAA,IACA,QAAAU;AAAA,IACA,QAAAR;AAAA,IACA,QAAAH;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAIwB,OAAqB,0BAAU;AAAA,IACxC,SAAAf;AAAA,IACA,QAAAP;AAAA,IACA;AAAA,IACA,QAAAuB;AAAA,IACA,OAAAzB;AAAA,EACF,CAAC;AACM,MAAI,YAA2B,gCAAgB;AAAA,IACpD;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAD;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,iBAAgC,qCAAqB;AAAA,IAC9D,SAAAF;AAAA,IACA,QAAAC;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI0B,OAAqB,0BAAU;AAAA,IACxC,QAAAxB;AAAA,IACA,OAAAY;AAAA,IACA,SAAAb;AAAA,IACA;AAAA,IACA,OAAAD;AAAA,EACF,CAAC;AACM,MAAI,WAA0B,+BAAe;AAAA,IAClD,SAAAS;AAAA,IACA,QAAAP;AAAA,IACA;AAAA,IACA,OAAAF;AAAA,EACF,CAAC;AACM,MAAI,kBAAiC,sCAAsB;AAAA,IAChE;AAAA,IACA,OAAAc;AAAA,IACA;AAAA,IACA,OAAAd;AAAA,EACF,CAAC;AACM,MAAI,gBAA+B,oCAAoB;AAAA,IAC5D;AAAA,IACA,QAAAU;AAAA,IACA;AAAA,IACA,QAAAX;AAAA,IACA,OAAAC;AAAA,IACA,OAAAM;AAAA,EACF,CAAC;AACM,MAAI,MAAqB,0BAAU;AAAA,IACxC;AAAA,IACA,KAAAgB;AAAA,IACA,KAAAJ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAlB;AAAA,EACF,CAAC;AACM,MAAI,MAAqB,+BAAe;AAAA,IAC7C;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAI,SAAwB,6BAAa;AAAA,IAC9C,KAAAkB;AAAA,IACA,QAAAnB;AAAA,IACA,OAAAC;AAAA,IACA,OAAAM;AAAA,EACF,CAAC;AACM,MAAIqB,OAAqB,0BAAU;AAAA,IACxC,KAAAT;AAAA,IACA,QAAAhB;AAAA,IACA,SAAAD;AAAA,IACA,OAAAD;AAAA,EACF,CAAC;AACM,MAAI,QAAuB,4BAAY;AAAA,IAC5C,KAAAkB;AAAA,IACA,QAAAnB;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,YAA2B,gCAAgB;AAAA,IACpD;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAD;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,SAAwB,6BAAa;AAAA,IAC9C,SAAAS;AAAA,IACA,KAAAS;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAlB;AAAA,EACF,CAAC;AACM,MAAI4B,QAAsB,2BAAW;AAAA,IAC1C;AAAA,IACA,QAAA1B;AAAA,IACA;AAAA,IACA,QAAAH;AAAA,IACA,OAAAM;AAAA,IACA,OAAAL;AAAA,IACA,OAAAM;AAAA,EACF,CAAC;AACM,MAAI,iBAAgC,qCAAqB;AAAA,IAC9D;AAAA,IACA,OAAAN;AAAA,EACF,CAAC;AACM,MAAI,SAAwB,6BAAa;AAAA,IAC9C,KAAAkB;AAAA,IACA,OAAAlB;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAI,MAAqB,0BAAU;AAAA,IACxC,SAAAS;AAAA,IACA;AAAA,IACA,MAAAmB;AAAA,IACA;AAAA,IACA,OAAAjB;AAAA,IACA,QAAAZ;AAAA,IACA,OAAAC;AAAA,IACA,OAAAM;AAAA,EACF,CAAC;AACM,MAAIuB,SAAuB,4BAAY;AAAA,IAC5C;AAAA,IACA,OAAA7B;AAAA,EACF,CAAC;AACM,MAAI,MAAqB,0BAAU;AAAA,IACxC,KAAAsB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAvB;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAI8B,SAAuB,4BAAY;AAAA,IAC5C,SAAArB;AAAA,IACA,QAAAP;AAAA,IACA;AAAA,IACA,KAAAsB;AAAA,IACA,OAAAxB;AAAA,EACF,CAAC;AACM,MAAI,MAAqB,0BAAU;AAAA,IACxC;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAAsB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAvB;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C,SAAAS;AAAA,IACA,KAAAS;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAnB;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI+B,OAAqB,0BAAU;AAAA,IACxC,SAAAtB;AAAA,IACA,QAAAP;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAH;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,eAA8B,mCAAmB;AAAA,IAC1D;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,cAA6B,kCAAkB;AAAA,IACxD;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,cAA6B,kCAAkB;AAAA,IACxD;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,cAA6B,kCAAkB;AAAA,IACxD;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,YAA2B,gCAAgB;AAAA,IACpD;AAAA,IACA;AAAA,IACA,QAAAU;AAAA,IACA,QAAAR;AAAA,IACA,QAAAH;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAIgC,QAAsB,2BAAW;AAAA,IAC1C;AAAA,IACA;AAAA,IACA,QAAAjC;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,QAAuB,4BAAY;AAAA,IAC5C,KAAAsB;AAAA,IACA,KAAAJ;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAAe;AAAA,IACA,KAAApB;AAAA,IACA;AAAA,IACA;AAAA,IACA,MAAAI;AAAA,IACA;AAAA,IACA,OAAAjB;AAAA,EACF,CAAC;AACM,MAAI,UAAyB,8BAAc;AAAA,IAChD;AAAA,IACA;AAAA,IACA,QAAAU;AAAA,IACA,QAAAR;AAAA,IACA;AAAA,IACA,QAAAH;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,MAAqB,0BAAU;AAAA,IACxC,QAAAU;AAAA,IACA;AAAA,IACA,QAAAX;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,IACA,OAAAM;AAAA,EACF,CAAC;AACM,MAAI4B,UAAwB,6BAAa;AAAA,IAC9C;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAnC;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C,KAAAsB;AAAA,IACA,KAAAJ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAlB;AAAA,EACF,CAAC;AACM,MAAI,MAAqB,0BAAU;AAAA,IACxC;AAAA,IACA,MAAA4B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAAO;AAAA,IACA;AAAA,IACA,MAAAC;AAAA,IACA,QAAArC;AAAA,IACA;AAAA,IACA,KAAAgC;AAAA,IACA,KAAAM;AAAA,IACA,OAAArC;AAAA,EACF,CAAC;AACM,MAAI,QAAuB,4BAAY;AAAA,IAC5C,SAAAS;AAAA,IACA,KAAAS;AAAA,IACA,QAAAgB;AAAA,IACA,QAAAnC;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,QAAuB,4BAAY;AAAA,IAC5C;AAAA,IACA,SAAAS;AAAA,IACA,QAAAP;AAAA,IACA;AAAA,IACA,KAAA6B;AAAA,IACA,OAAA/B;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,eAA8B,mCAAmB;AAAA,IAC1D,QAAAkC;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAAV;AAAA,IACA,KAAAS;AAAA,IACA,QAAAlC;AAAA,IACA;AAAA,IACA,KAAA4B;AAAA,IACA,OAAA3B;AAAA,EACF,CAAC;AACM,MAAI,UAAyB,8BAAc;AAAA,IAChD;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAD;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C,KAAAkB;AAAA,IACA,QAAAgB;AAAA,IACA,OAAAlC;AAAA,EACF,CAAC;AACM,MAAI,SAAwB,6BAAa;AAAA,IAC9C,KAAAkB;AAAA,IACA;AAAA,IACA,QAAAgB;AAAA,IACA;AAAA,IACA,OAAAlC;AAAA,EACF,CAAC;AACM,MAAI,iBAAgC,qCAAqB;AAAA,IAC9D,KAAAkB;AAAA,IACA,MAAAV;AAAA,IACA,QAAA0B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,MAAAjB;AAAA,IACA;AAAA,IACA,QAAAQ;AAAA,IACA,OAAAzB;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAI,cAA6B,kCAAkB;AAAA,IACxD;AAAA,IACA,KAAAkB;AAAA,IACA;AAAA,IACA,QAAAgB;AAAA,IACA,WAAA9B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAJ;AAAA,EACF,CAAC;AACM,MAAI,QAAuB,4BAAY;AAAA,IAC5C;AAAA,IACA,QAAAD;AAAA,IACA,KAAAmB;AAAA,IACA,QAAAhB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAF;AAAA,EACF,CAAC;AACM,MAAI,MAAqB,0BAAU;AAAA,IACxC;AAAA,IACA,QAAAD;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,gBAA+B,oCAAoB;AAAA,IAC5D;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,kBAAiC,sCAAsB;AAAA,IAChE;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,mBAAkC,uCAAuB;AAAA,IAClE;AAAA,IACA,QAAAU;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAV;AAAA,EACF,CAAC;AACM,MAAI,WAA0B,+BAAe;AAAA,IAClD,KAAAsB;AAAA,IACA,KAAAJ;AAAA,IACA;AAAA,IACA,QAAAgB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAAD;AAAA,IACA,QAAAlC;AAAA,IACA,KAAAc;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAb;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,gCAAgB;AAAA,IAC/C;AAAA,IACA,SAAAS;AAAA,IACA,UAAAF;AAAA,IACA,KAAAe;AAAA,IACA;AAAA,IACA,QAAApB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAoC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAAP;AAAA,IACA,OAAA1B;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAI,kBAAiC,sCAAsB;AAAA,IAChE;AAAA,IACA;AAAA,IACA,QAAAH;AAAA,EACF,CAAC;AACM,MAAI,aAA4B,iCAAiB;AAAA,IACtD;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,eAA8B,mCAAmB;AAAA,IAC1D;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,YAA2B,gCAAgB;AAAA,IACpD;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,SAAwB,6BAAa;AAAA,IAC9C;AAAA,IACA,QAAAH;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,qBAAoC,yCAAyB;AAAA,IACtE;AAAA,IACA;AAAA,IACA,QAAAE;AAAA,EACF,CAAC;AACM,MAAI,UAAyB,8BAAc;AAAA,IAChD;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,aAA4B,iCAAiB;AAAA,IACtD;AAAA,IACA,OAAAF;AAAA,EACF,CAAC;AACM,MAAI,eAA8B,mCAAmB;AAAA,IAC1D;AAAA,IACA;AAAA,IACA,QAAAE;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C,KAAAoB;AAAA,IACA,KAAAJ;AAAA,IACA;AAAA,IACA,MAAAqB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAArC;AAAA,IACA,KAAAsC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAA1C;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAAI;AAAA,IACA,KAAAsC;AAAA,IACA;AAAA,IACA;AAAA,IACA,MAAAxB;AAAA,IACA;AAAA,IACA,OAAAjB;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAI,eAA8B,mCAAmB;AAAA,IAC1D;AAAA,IACA;AAAA,IACA,QAAAE;AAAA,EACF,CAAC;AACM,MAAI,YAA2B,gCAAgB;AAAA,IACpD;AAAA,IACA,OAAAF;AAAA,EACF,CAAC;AACM,MAAI,gBAA+B,oCAAoB;AAAA,IAC5D;AAAA,IACA;AAAA,IACA,QAAAE;AAAA,EACF,CAAC;AACM,MAAI,cAA6B,kCAAkB;AAAA,IACxD;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,UAAyB,8BAAc;AAAA,IAChD;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,WAA0B,+BAAe;AAAA,IAClD;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,YAA2B,gCAAgB;AAAA,IACpD;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,MAAqB,0BAAU;AAAA,IACxC,KAAAoB;AAAA,IACA,KAAAW;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAjC;AAAA,EACF,CAAC;AACM,MAAI,sBAAqC,0CAA0B;AAAA,IACxE;AAAA,IACA;AAAA,IACA,QAAAE;AAAA,EACF,CAAC;AACM,MAAI,YAA2B,gCAAgB;AAAA,IACpD;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,sBAAqC,0CAA0B;AAAA,IACxE;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,cAA6B,kCAAkB;AAAA,IACxD,KAAAgB;AAAA,IACA,QAAAgB;AAAA,IACA;AAAA,IACA,WAAA9B;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAJ;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C,KAAAsB;AAAA,IACA,KAAAJ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAnB;AAAA,IACA;AAAA,IACA,KAAAgC;AAAA,IACA;AAAA,IACA,MAAAd;AAAA,IACA,OAAAjB;AAAA,EACF,CAAC;AACM,MAAI,eAA8B,mCAAmB;AAAA,IAC1D;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,iBAAgC,qCAAqB;AAAA,IAC9D;AAAA,IACA;AAAA,IACA,QAAAE;AAAA,EACF,CAAC;AACM,MAAI,aAA4B,iCAAiB;AAAA,IACtD;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,aAA4B,iCAAiB;AAAA,IACtD;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,wBAAuC,4CAA4B;AAAA,IAC5E;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,iBAAgC,qCAAqB;AAAA,IAC9D;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,IACA,KAAAsC;AAAA,IACA,QAAAzC;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAA0C;AAAA,IACA,OAAAzC;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAI,UAAyB,8BAAc;AAAA,IAChD;AAAA,IACA;AAAA,IACA,QAAAE;AAAA,EACF,CAAC;AACM,MAAI,kBAAiC,sCAAsB;AAAA,IAChE;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,UAAyB,8BAAc;AAAA,IAChD;AAAA,IACA,OAAAF;AAAA,EACF,CAAC;AACM,MAAI,eAA8B,mCAAmB;AAAA,IAC1D;AAAA,IACA;AAAA,IACA,QAAAE;AAAA,EACF,CAAC;AACM,MAAI,kBAAiC,sCAAsB;AAAA,IAChE;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,sBAAqC,0CAA0B;AAAA,IACxE;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,WAA0B,+BAAe;AAAA,IAClD,KAAAgB;AAAA,IACA,QAAAgB;AAAA,IACA,OAAApB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAd;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C;AAAA,IACA,SAAAS;AAAA,IACA,KAAAS;AAAA,IACA,QAAAhB;AAAA,IACA,QAAAgC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,IAAAQ;AAAA,IACA,KAAAX;AAAA,IACA,KAAAU;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAzC;AAAA,EACF,CAAC;AACM,MAAI,WAA0B,+BAAe;AAAA,IAClD;AAAA,IACA;AAAA,IACA,QAAAE;AAAA,EACF,CAAC;AACM,MAAI,aAA4B,iCAAiB;AAAA,IACtD;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C,KAAAgB;AAAA,IACA,QAAAgB;AAAA,IACA,QAAAnC;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAAgC;AAAA,IACA,MAAAd;AAAA,IACA;AAAA,IACA,KAAAU;AAAA,IACA,OAAA3B;AAAA,EACF,CAAC;AACM,MAAI,SAAwB,6BAAa;AAAA,IAC9C;AAAA,IACA;AAAA,IACA,QAAAU;AAAA,IACA;AAAA,IACA,QAAAX;AAAA,IACA,KAAAgC;AAAA,IACA,OAAA/B;AAAA,EACF,CAAC;AACM,MAAI,mBAAkC,uCAAuB;AAAA,IAClE;AAAA,IACA;AAAA,IACA,QAAAE;AAAA,EACF,CAAC;AACM,MAAI,UAAyB,8BAAc;AAAA,IAChD;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,gBAA+B,oCAAoB;AAAA,IAC5D;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,4BAA2C,gDAAgC;AAAA,IACpF;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,mBAAkC,uCAAuB;AAAA,IAClE;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,eAA8B,mCAAmB;AAAA,IAC1D;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,cAA6B,kCAAkB;AAAA,IACxD;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,eAA8B,mCAAmB;AAAA,IAC1D;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,oBAAmC,wCAAwB;AAAA,IACpE;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,uBAAsC,2CAA2B;AAAA,IAC1E;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,eAA8B,mCAAmB;AAAA,IAC1D;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAF;AAAA,EACF,CAAC;AACM,MAAI,MAAqB,0BAAU;AAAA,IACxC,KAAAiC;AAAA,IACA,MAAAhB;AAAA,IACA,OAAAjB;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAI,aAA4B,iCAAiB;AAAA,IACtD;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,WAAAI;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAA2B;AAAA,IACA;AAAA,IACA,OAAA/B;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,mCAAmB;AAAA,IAClD;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,cAA6B,kCAAkB;AAAA,IACxD;AAAA,IACA,WAAAI;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAJ;AAAA,EACF,CAAC;AACM,MAAI,mBAAkC,uCAAuB;AAAA,IAClE;AAAA,IACA;AAAA,IACA,QAAAE;AAAA,EACF,CAAC;AACM,MAAI,iBAAgC,qCAAqB;AAAA,IAC9D;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,kBAAiC,sCAAsB;AAAA,IAChE;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,eAA8B,mCAAmB;AAAA,IAC1D;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,SAAwB,6BAAa;AAAA,IAC9C;AAAA,IACA;AAAA,IACA,OAAAF;AAAA,EACF,CAAC;AACM,MAAI,WAA0B,+BAAe;AAAA,IAClD;AAAA,IACA,QAAAU;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAV;AAAA,EACF,CAAC;AACM,MAAI,mBAAkC,uCAAuB;AAAA,IAClE;AAAA,IACA;AAAA,IACA,QAAAE;AAAA,EACF,CAAC;AACM,MAAI,0BAAyC,8CAA8B;AAAA,IAChF;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,cAA6B,kCAAkB;AAAA,IACxD;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,QAAuB,4BAAY;AAAA,IAC5C;AAAA,IACA,QAAAH;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,kBAAiC,sCAAsB;AAAA,IAChE;AAAA,IACA;AAAA,IACA,QAAAE;AAAA,EACF,CAAC;AACM,MAAI,sBAAqC,0CAA0B;AAAA,IACxE;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,aAA4B,iCAAiB;AAAA,IACtD;AAAA,IACA;AAAA,IACA,QAAAA;AAAA,EACF,CAAC;AACM,MAAI,YAA2B,gCAAgB;AAAA,IACpD,KAAAoB;AAAA,IACA,KAAAJ;AAAA,IACA,QAAAR;AAAA,IACA;AAAA,IACA,OAAAmB;AAAA,IACA;AAAA,IACA,QAAA9B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,OAAsB,2BAAW;AAAA,IAC1C,QAAAD;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;;;ACzyDD,MAAI,OAAO,CAAC;AACZ,MAAI,oBAAoB,CAAC;AACzB,MAAI,UAAU,CAAC;AAER,MAAI2C,QAAO,WAAW;AAAA,IAC3B;AAAA,EACF,CAAC;AACM,MAAI,aAAa,iBAAiB;AAAA,IACvC,MAAAA;AAAA,EACF,CAAC;AACM,MAAI,eAAe,mBAAmB;AAAA,IAC3C,MAAAA;AAAA,EACF,CAAC;AACM,MAAI,kBAAkB,sBAAsB;AAAA,IACjD,MAAAA;AAAA,EACF,CAAC;AACM,MAAI,iBAAiB,qBAAqB;AAAA,IAC/C,MAAAA;AAAA,EACF,CAAC;AACM,MAAI,YAAY,gBAAgB;AAAA,IACrC,MAAAA;AAAA,EACF,CAAC;AACM,MAAI,YAAY,gBAAgB;AAAA,IACrC,MAAAA;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAI,kBAAkB,sBAAsB;AAAA,IACjD,MAAAA;AAAA,EACF,CAAC;AACM,MAAI,YAAY,gBAAgB;AAAA,IACrC,MAAAA;AAAA,EACF,CAAC;AACM,MAAI,UAAU,cAAc;AAAA,IACjC;AAAA,EACF,CAAC;AACM,MAAI,QAAQ,iBAAiB;AAAA,IAClC;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,yBAAyB,6BAA6B;AAAA,IAC/D,MAAAD;AAAA,IACA,OAAAC;AAAA,EACF,CAAC;AACM,MAAI,QAAQ,YAAY;AAAA,IAC7B;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,eAAe,mBAAmB;AAAA,IAC3C,MAAAD;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAI,YAAY,gBAAgB;AAAA,IACrC,MAAAA;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAI,eAAe,mBAAmB;AAAA,IAC3C,MAAAA;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAI,iBAAiB,qBAAqB;AAAA,IAC/C,QAAAE;AAAA,IACA,MAAAF;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAI,aAAa,iBAAiB;AAAA,IACvC;AAAA,IACA,MAAAA;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAI,eAAe,mBAAmB;AAAA,IAC3C,MAAAA;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AACM,MAAIG,SAAQ,YAAY;AAAA,IAC7B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAC;AAAA,IACA,SAAAC;AAAA,IACA,OAAAJ;AAAA,EACF,CAAC;AACM,MAAI,UAAU,cAAc;AAAA,IACjC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAE;AAAA,IACA,OAAAF;AAAA,EACF,CAAC;AACM,MAAI,mBAAmB,uBAAuB;AAAA,IACnD;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAG;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAF;AAAA,IACA,OAAAD;AAAA,EACF,CAAC;AACM,MAAI,UAAU,cAAc;AAAA,IACjC,OAAAE;AAAA,IACA,OAAAF;AAAA,EACF,CAAC;AACM,MAAI,YAAY,gBAAgB;AAAA,IACrC,OAAAE;AAAA,IACA,OAAAF;AAAA,EACF,CAAC;AACM,MAAI,eAAe,mBAAmB;AAAA,IAC3C;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAAK;AAAA,IACA,QAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAJ;AAAA,IACA,KAAAK;AAAA,IACA;AAAA,IACA,OAAAP;AAAA,EACF,CAAC;AACM,MAAI,WAAW,eAAe;AAAA,IACnC,OAAAE;AAAA,IACA,OAAAF;AAAA,EACF,CAAC;AACM,MAAI,OAAO,gBAAgB;AAAA,IAChC;AAAA,EACF,CAAC;AACM,MAAI,SAAS,kBAAkB;AAAA,IACpC;AAAA,IACA,OAAAE;AAAA,EACF,CAAC;AACM,MAAI,SAAS,aAAa;AAAA,IAC/B;AAAA,IACA,OAAAF;AAAA,EACF,CAAC;AACM,MAAI,WAAW,eAAe;AAAA,IACnC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAE;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAF;AAAA,EACF,CAAC;AACM,MAAI,gBAAgB,oBAAoB;AAAA,IAC7C;AAAA,IACA,OAAAE;AAAA,IACA;AAAA,IACA,OAAAF;AAAA,EACF,CAAC;AACM,MAAI,aAAa,iBAAiB;AAAA,IACvC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAG;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAAC;AAAA,IACA,OAAAF;AAAA,IACA;AAAA,IACA,OAAAF;AAAA,EACF,CAAC;AACM,MAAI,OAAO,WAAW;AAAA,IAC3B;AAAA,IACA;AAAA,IACA,OAAAA;AAAA,EACF,CAAC;AACM,MAAI,cAAc,kBAAkB;AAAA,IACzC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAAK;AAAA,IACA,QAAAF;AAAA,IACA,QAAAG;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAL;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,IACA,KAAAK;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAP;AAAA,EACF,CAAC;AACD,EAAAQ,UAAS,MAAM;AAAA,IACb,GAAAC;AAAA,IACA,OAAO;AAAA,IACP;AAAA,IACA;AAAA,IACA,UAAU;AAAA,IACV,MAAAC;AAAA,IACA;AAAA,IACA,KAAK;AAAA,IACL,MAAM;AAAA,IACN,KAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAAC;AAAA,IACA,MAAM;AAAA,IACN,KAAKH;AAAA,IACL,SAAAI;AAAA,IACA;AAAA,IACA;AAAA,IACA,IAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAd;AAAA,IACA,MAAMc;AAAA,IACN;AAAA,IACA,KAAAC;AAAA,IACA,MAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,IACA,MAAAC;AAAA,IACA,OAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAAC;AAAA,IACA,OAAAC;AAAA,IACA,QAAAC;AAAA,IACA,SAAAC;AAAA,IACA,SAAAC;AAAA,IACA,QAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,IACA,MAAAC;AAAA,IACA,KAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA,MAAAC;AAAA,IACA,KAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAAC;AAAA,IACA;AAAA,IACA,QAAAC;AAAA,IACA,OAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,MAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAtC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAuC;AAAA,IACA;AAAA,IACA,MAAAC;AAAA,IACA;AAAA,IACA,MAAAC;AAAA,IACA,SAAAC;AAAA,IACA,MAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,IACA;AAAA,IACA,MAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,WAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAA3C;AAAA,IACA;AAAA,IACA,SAAA4C;AAAA,IACA,OAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA,MAAAC;AAAA,IACA,QAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,IACA,KAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAAC;AAAA,IACA,KAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAAlD;AAAA,IACA,OAAAmD;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA,aAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,MAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,IACA;AAAA,IACA,OAAAC;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAA1D;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,MAAA2D;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAA5D;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAAJ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAAC;AAAA,EACF,CAAC;AACD,EAAAK,UAAS,mBAAmB,MAAM;AAAA,IAChC,KAAK,mBAAmB;AAAA,MACtB,OAAAR;AAAA,IACF,CAAC;AAAA,IACD,QAAQ,sBAAsB;AAAA,MAC5B,OAAAA;AAAA,IACF,CAAC;AAAA,IACD,SAAS,uBAAuB;AAAA,MAC9B,OAAAA;AAAA,IACF,CAAC;AAAA,IACD,WAAW,yBAAyB;AAAA,MAClC,WAAA+C;AAAA,MACA,OAAA/C;AAAA,IACF,CAAC;AAAA,IACD,KAAK,mBAAmB;AAAA,MACtB,KAAAK;AAAA,MACA,QAAA8C;AAAA,MACA;AAAA,MACA,QAAAlD;AAAA,MACA;AAAA,MACA,OAAAD;AAAA,MACA,OAAA6C;AAAA,IACF,CAAC;AAAA,IACD,QAAQ,sBAAsB;AAAA,MAC5B,KAAAxC;AAAA,MACA,OAAAL;AAAA,MACA;AAAA,IACF,CAAC;AAAA,IACD,SAAS,uBAAuB;AAAA,MAC9B;AAAA,MACA,SAAAyB;AAAA,MACA,QAAAxB;AAAA,MACA;AAAA,MACA,OAAAD;AAAA,IACF,CAAC;AAAA,IACD,OAAO,qBAAqB;AAAA,MAC1B,KAAAK;AAAA,MACA,QAAAJ;AAAA,MACA,OAAAD;AAAA,MACA,OAAA6C;AAAA,IACF,CAAC;AAAA,IACD,QAAQ,sBAAsB;AAAA,MAC5B,KAAAxC;AAAA,MACA,QAAA8C;AAAA,MACA;AAAA,MACA,QAAAlD;AAAA,MACA;AAAA,MACA,OAAAD;AAAA,MACA,OAAA6C;AAAA,IACF,CAAC;AAAA,IACD,QAAQ,sBAAsB;AAAA,MAC5B,WAAAE;AAAA,MACA,QAAA9C;AAAA,MACA,OAAAD;AAAA,IACF,CAAC;AAAA,IACD,MAAM,oBAAoB;AAAA,MACxB;AAAA,MACA,QAAAC;AAAA,MACA;AAAA,MACA;AAAA,MACA,OAAAD;AAAA,IACF,CAAC;AAAA,IACD,KAAK,mBAAmB;AAAA,MACtB,QAAAG;AAAA,MACA,OAAAyB;AAAA,MACA;AAAA,MACA,SAAAxB;AAAA,MACA,OAAAJ;AAAA,IACF,CAAC;AAAA,IACD,KAAK,mBAAmB;AAAA,MACtB,QAAAG;AAAA,MACA,OAAAyB;AAAA,MACA,SAAAxB;AAAA,MACA;AAAA,MACA,OAAAJ;AAAA,IACF,CAAC;AAAA,IACD,IAAI,kBAAkB;AAAA,MACpB;AAAA,MACA,QAAAmD;AAAA,MACA;AAAA,MACA,QAAAlD;AAAA,MACA,OAAAD;AAAA,IACF,CAAC;AAAA,IACD,QAAQ,sBAAsB;AAAA,MAC5B,KAAAK;AAAA,MACA,QAAAJ;AAAA,MACA,OAAAD;AAAA,MACA,OAAA6C;AAAA,IACF,CAAC;AAAA,IACD,OAAO,qBAAqB;AAAA,MAC1B;AAAA,MACA,QAAAM;AAAA,MACA;AAAA,MACA,QAAAlD;AAAA,MACA,OAAAD;AAAA,IACF,CAAC;AAAA,IACD,KAAK,mBAAmB;AAAA,MACtB,KAAAK;AAAA,MACA,QAAAF;AAAA,MACA,SAAAC;AAAA,MACA,OAAAJ;AAAA,IACF,CAAC;AAAA,IACD,UAAU,wBAAwB;AAAA,MAChC,KAAAK;AAAA,MACA,QAAAC;AAAA,MACA,OAAAsB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,OAAA5B;AAAA,IACF,CAAC;AAAA,IACD,OAAO,qBAAqB;AAAA,MAC1B;AAAA,MACA;AAAA,IACF,CAAC;AAAA,IACD,aAAa,2BAA2B;AAAA,MACtC,KAAAK;AAAA,MACA;AAAA,MACA;AAAA,MACA,QAAAC;AAAA,MACA,WAAAyC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,OAAA/C;AAAA,IACF,CAAC;AAAA,IACD,OAAO,qBAAqB;AAAA,MAC1B;AAAA,MACA,QAAAC;AAAA,MACA,KAAAI;AAAA,MACA,QAAAF;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,OAAAH;AAAA,IACF,CAAC;AAAA,IACD,QAAQ,sBAAsB;AAAA,MAC5B;AAAA,MACA,QAAAC;AAAA,MACA;AAAA,MACA,OAAAD;AAAA,IACF,CAAC;AAAA,IACD,KAAK,mBAAmB;AAAA,MACtB;AAAA,MACA,QAAAC;AAAA,MACA;AAAA,MACA,OAAAD;AAAA,IACF,CAAC;AAAA,IACD,MAAM,oBAAoB;AAAA,MACxB,KAAAK;AAAA,MACA,QAAAC;AAAA,MACA,OAAAN;AAAA,IACF,CAAC;AAAA,IACD,KAAK,mBAAmB;AAAA,MACtB,KAAA+B;AAAA,MACA,MAAAW;AAAA,MACA,OAAA1C;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AACD,EAAAQ,UAAS,SAAS;AAAA,IAChB;AAAA,IACA,SAAA2D;AAAA,IACA,UAAAC;AAAA,IACA;AAAA,IACA,MAAArE;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AACD,QAAM,YAAY,IAAI;;;ACrvBtB,MAAO,uCAAP,cAA6B,WAAW;AAAA,IACtC,OAAO,UAAU,CAAC,WAAW,cAAc,QAAQ;AAAA,IACnD,OAAO,SAAS,EAAE,SAAS,OAAO;AAAA,IAElC,UAAU;AACR,WAAK,uBAAuB,KAAK,qBAAqB,KAAK,IAAI;AAAA,IACjE;AAAA,IAEA,aAAa;AACX,eAAS,oBAAoB,SAAS,KAAK,oBAAoB;AAAA,IACjE;AAAA,IAEA,OAAO,OAAO;AACZ,YAAM,gBAAgB;AACtB,UAAI,KAAK,cAAc,UAAU,SAAS,QAAQ,GAAG;AACnD,aAAK,MAAM;AAAA,MACb,OAAO;AACL,aAAK,OAAO;AAAA,MACd;AAAA,IACF;AAAA,IAEA,QAAQ;AACN,eAAS,iBAAiB,yCAAyC,EAAE,QAAQ,QAAM;AACjF,WAAG,UAAU,IAAI,QAAQ;AAAA,MAC3B,CAAC;AACD,WAAK,cAAc,UAAU,OAAO,QAAQ;AAC5C,WAAK,iBAAiB,QAAQ;AAC9B,WAAK,aAAa,cAAc;AAChC,WAAK,aAAa,UAAU,OAAO,aAAa;AAChD,WAAK,iBAAiB,MAAM;AAC5B,iBAAW,MAAM;AACf,iBAAS,iBAAiB,SAAS,KAAK,oBAAoB;AAAA,MAC9D,GAAG,CAAC;AAAA,IACN;AAAA,IAEA,SAAS;AACP,WAAK,cAAc,UAAU,IAAI,QAAQ;AACzC,eAAS,oBAAoB,SAAS,KAAK,oBAAoB;AAAA,IACjE;AAAA,IAEA,qBAAqB,OAAO;AAC1B,UAAI,CAAC,KAAK,QAAQ,SAAS,MAAM,MAAM,GAAG;AACxC,aAAK,OAAO;AAAA,MACd;AAAA,IACF;AAAA,IAEA,WAAW;AACT,YAAM,OAAO,KAAK,iBAAiB;AACnC,YAAM,SAAS,KAAK,UAAU,IAAI;AAClC,UAAI,WAAW,MAAM;AACnB,aAAK,aAAa,cAAc,OAAO,QAAQ,CAAC;AAChD,aAAK,aAAa,UAAU,OAAO,aAAa;AAAA,MAClD,OAAO;AACL,aAAK,aAAa,cAAc,KAAK,KAAK,IAAI,UAAU;AACxD,aAAK,aAAa,UAAU,OAAO,eAAe,KAAK,KAAK,EAAE,SAAS,CAAC;AAAA,MAC1E;AAAA,IACF;AAAA,IAEA,QAAQ;AACN,YAAM,OAAO,KAAK,iBAAiB;AACnC,YAAM,SAAS,KAAK,UAAU,IAAI;AAClC,UAAI,WAAW,QAAQ,KAAK,cAAc;AACxC,cAAM,QAAQ,SAAS,eAAe,KAAK,YAAY;AACvD,YAAI,SAAS,CAAC,MAAM,YAAY,CAAC,MAAM,UAAU;AAC/C,gBAAM,QAAQ,OAAO,QAAQ,CAAC;AAC9B,gBAAM,cAAc,IAAI,MAAM,UAAU,EAAE,SAAS,KAAK,CAAC,CAAC;AAC1D,gBAAM,cAAc,IAAI,MAAM,SAAS,EAAE,SAAS,KAAK,CAAC,CAAC;AAAA,QAC3D;AACA,aAAK,OAAO;AAAA,MACd;AAAA,IACF;AAAA,IAEA,cAAc,OAAO;AACnB,UAAI,MAAM,QAAQ,SAAS;AACzB,cAAM,eAAe;AACrB,aAAK,MAAM;AAAA,MACb,WAAW,MAAM,QAAQ,UAAU;AACjC,aAAK,OAAO;AAAA,MACd;AAAA,IACF;AAAA,IAEA,UAAU,MAAM;AACd,YAAM,UAAU,KAAK,QAAQ,MAAM,GAAG;AACtC,UAAI,CAAC,QAAQ,KAAK,EAAG,QAAO;AAC5B,UAAI;AACF,cAAM,SAAS,SAAS,OAAO;AAC/B,YAAI,OAAO,WAAW,YAAY,CAAC,SAAS,MAAM,EAAG,QAAO;AAC5D,eAAO;AAAA,MACT,QAAQ;AACN,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;;;ACtEA,cAAY,SAAS,aAAa,4BAAkB;AACpD,cAAY,SAAS,cAAc,6BAAoB;AACvD,cAAY,SAAS,mBAAmB,kCAAwB;AAChE,cAAY,SAAS,uBAAuB,sCAA4B;AACxE,cAAY,SAAS,YAAY,2BAAkB;AACnD,cAAY,SAAS,aAAa,4BAAkB;AACpD,cAAY,SAAS,mBAAmB,kCAAwB;AAChE,cAAY,SAAS,yBAAyB,wCAA6B;AAC3E,cAAY,SAAS,uBAAuB,sCAA4B;AACxE,cAAY,SAAS,YAAY,2BAAkB;AACnD,cAAY,SAAS,wBAAwB,uCAA4B;AACzE,cAAY,SAAS,+BAA+B,8CAAkC;AACtF,cAAY,SAAS,wBAAwB,wCAA4B;AACzE,cAAY,SAAS,6BAA6B,4CAAiC;AACnF,cAAY,SAAS,eAAe,8BAAoB;AACxD,cAAY,SAAS,kBAAkB,iCAAuB;AAC9D,cAAY,SAAS,+BAA+B,8CAAkC;AACtF,cAAY,SAAS,qBAAqB,oCAA0B;;;ACnCpE,MAAI,OAAO,OAAO;AAChB,YAAQ,IAAI,+BAA+B;AAAA,EAC7C,OAAO;AACL,YAAQ,MAAM,sBAAsB;AAAA,EACtC;",
  "names": ["consumer", "error", "properties", "consumer", "consumer", "subscription", "name", "e", "i", "t", "n", "a", "r", "o", "l", "s", "f", "c", "u", "d", "h", "v", "m", "g", "y", "P", "p", "k", "w", "S", "b", "x", "isPlainObject", "typed", "name", "i", "matches", "find", "or", "index", "min", "last", "arg", "params", "self", "s", "generic", "start", "to", "typedFunction", "naturalSort", "re", "i", "_extends", "i", "defaultEscapeMapFn", "defaultEscapes", "formatEscapes", "_loop", "index", "module", "define", "i", "module", "define", "module", "define", "module", "define", "i", "me", "seed", "module", "define", "i", "me", "seed", "module", "define", "math", "digits", "seedrandom", "flatten", "prng", "seed", "i", "count", "t", "j", "s", "e", "plugins", "require_seedrandom", "submitter", "name", "resolve", "string", "i", "config", "location", "error", "cookie", "clone", "defaults", "ctx", "morphChildren", "index", "createNode", "findBestMatch", "e", "morphNode", "createMorphContext", "normalizeElement", "normalizeParent", "parser", "option", "session", "visit", "size", "recentRequests", "mode", "Turbo", "document", "createConsumer", "submitter", "application", "map", "error", "matches", "index", "name", "e", "filter", "fetch", "size", "matches", "match", "oldValue", "index", "error", "name", "constructor", "dependencies", "properties", "extend", "application", "element", "filter", "resolve", "classes", "unit", "count", "e", "name", "i", "classes", "re", "matches", "format", "Inputmask", "filename", "index", "checkbox", "response", "error", "row", "e", "i", "obj", "name", "i", "index", "extend", "$", "ghostEl", "option", "defaults", "name", "dispatchEvent", "rootEl", "cloneEl", "oldIndex", "newIndex", "oldDraggableIndex", "newDraggableIndex", "putSortable", "pluginEvent", "_detectDirection", "_dragElInRowColumn", "_detectNearestEmptySortable", "_prepareGroup", "to", "dragEl", "_hideGhostForTarget", "_unhideGhostForTarget", "nearestEmptyInsertDetectEvent", "i", "_checkOutsideTargetEl", "filter", "dragStartFn", "e", "target", "after", "el", "sum", "extend", "plugins", "drop", "autoScroll", "onSpill", "index", "e", "error", "option", "resolve", "blob", "e", "IDB_NAME", "IDB_STORE", "PENDING_PDF_KEY", "e", "resolve", "_extends", "e", "map", "clone", "extend", "i", "get", "properties", "i", "config", "_extends", "name", "dependencies", "name", "dependencies", "config", "log2", "log10", "cbrt", "expm1", "size", "sign", "digits", "e", "dot", "zeros", "i", "typedFunction", "createTyped", "BigNumber", "Complex", "DenseMatrix", "Fraction", "typed", "matrix", "name", "dependencies", "ResultSet", "min", "max", "i", "e", "arg", "n1", "compare", "subtract", "prod", "sign", "digits", "pow", "sum", "pi", "acosh", "add", "asinh", "atanh", "cbrt", "config", "cosh", "clone", "Decimal", "log10", "log2", "sinh", "tanh", "name", "dependencies", "on", "config", "BigNumber", "cosh", "sinh", "hypot", "P", "i", "abs", "arg", "re", "im", "t", "inv", "name", "dependencies", "im", "re", "arg", "phi", "P", "e", "add", "parse", "i", "name", "dependencies", "name", "dependencies", "Range", "start", "arg", "diff", "size", "i", "index", "name", "dependencies", "Matrix", "index", "size", "size", "format", "toFixed", "toExponential", "toEngineering", "_toNumberOrDefault", "exp", "digits", "e", "BigNumber", "start", "format", "i", "index", "min", "max", "size", "i", "index", "format", "e", "array", "count", "typeOf", "i", "size", "clone", "index", "size", "i", "clone", "_extends", "import_typed_function", "name", "typed", "size", "index", "i", "name", "dependencies", "Matrix", "config", "DenseMatrix", "clone", "index", "i", "size", "matrix", "min", "max", "data", "error", "submatrix", "range", "_resize", "result", "count", "row", "_loop", "format", "_value", "name", "dependencies", "typed", "clone", "i", "i", "deepForEach", "deepMap", "size", "name", "dependencies", "typed", "equal", "self", "deepMap", "prod", "inv", "n1", "n2", "product", "i", "product", "n1", "n2", "product", "i", "sum", "n1", "n2", "e", "n1", "nearlyEqual", "name", "dependencies", "typed", "config", "nearlyEqual", "self", "deepMap", "name", "dependencies", "typed", "self", "deepMap", "name", "dependencies", "typed", "isNumeric", "string", "name", "dependencies", "typed", "config", "nearlyEqual", "self", "deepMap", "name", "dependencies", "typed", "equalScalar", "self", "deepMap", "name", "dependencies", "typed", "BigNumber", "bigint", "Fraction", "Complex", "Unit", "self", "deepMap", "name", "dependencies", "typed", "self", "name", "dependencies", "typed", "isBounded", "map", "name", "dependencies", "typed", "typed", "self", "name", "dependencies", "typed", "config", "nearlyEqual", "name", "dependencies", "typed", "equalScalar", "Matrix", "SparseMatrix", "matrix", "clone", "i", "row", "index", "size", "min", "max", "range", "_resize", "format", "invoke", "value", "_value", "name", "dependencies", "i", "typed", "number", "string", "size", "BigNumber", "bigint", "Fraction", "self", "clone", "_null", "unit", "deepMap", "name", "dependencies", "typed", "bigint", "number", "BigNumber", "Fraction", "_null", "self", "deepMap", "name", "dependencies", "typed", "_null", "boolean", "string", "self", "deepMap", "name", "dependencies", "typed", "boolean", "number", "_null", "BigNumber", "string", "self", "deepMap", "name", "dependencies", "typed", "BigNumber", "number", "string", "size", "bigint", "self", "clone", "Fraction", "_null", "deepMap", "name", "dependencies", "typed", "Complex", "number", "re", "im", "Fraction", "string", "_null", "Object", "self", "deepMap", "name", "dependencies", "typed", "Fraction", "number", "string", "_null", "BigNumber", "bigint", "self", "clone", "Object", "deepMap", "name", "dependencies", "typed", "Matrix", "DenseMatrix", "SparseMatrix", "string", "format", "Array", "name", "dependencies", "typed", "matrix", "isZero", "size", "format", "index", "name", "dependencies", "typed", "matrix", "flatten", "size", "Array", "Matrix", "row", "name", "dependencies", "typed", "matrix", "flatten", "size", "Array", "Matrix", "i", "name", "dependencies", "typed", "unit", "name", "dependencies", "typed", "self", "deepMap", "name", "dependencies", "typed", "config", "numeric", "Complex", "BigNumber", "bigint", "Fraction", "Unit", "self", "deepMap", "boolean", "string", "name", "dependencies", "typed", "self", "deepMap", "name", "dependencies", "typed", "isInteger", "size", "i", "_switch", "name", "dependencies", "typed", "self", "name", "dependencies", "typed", "self", "name", "dependencies", "config", "typed", "isNegative", "unaryMinus", "matrix", "Complex", "BigNumber", "Fraction", "abs", "name", "dependencies", "typed", "equalScalar", "i", "name", "dependencies", "typed", "DenseMatrix", "i", "name", "dependencies", "typed", "clone", "i", "name", "dependencies", "typed", "config", "round", "matrix", "equalScalar", "zeros", "DenseMatrix", "nearlyEqual", "Complex", "Fraction", "self", "unit", "deepMap", "i", "name", "dependencies", "typed", "Complex", "BigNumber", "bigint", "Fraction", "Unit", "name", "dependencies", "typed", "Complex", "BigNumber", "name", "dependencies", "typed", "Complex", "BigNumber", "name", "dependencies", "typed", "ceil", "floor", "number", "matrix", "equalScalar", "zeros", "DenseMatrix", "Complex", "BigNumber", "Fraction", "self", "unit", "deepMap", "i", "name", "dependencies", "bigTen", "typed", "config", "round", "matrix", "equalScalar", "zeros", "DenseMatrix", "nearlyEqual", "Complex", "Fraction", "self", "unit", "deepMap", "i", "name", "dependencies", "typed", "equalScalar", "i", "name", "dependencies", "typed", "i", "name", "dependencies", "typed", "equalScalar", "i", "name", "dependencies", "typed", "i", "size", "name", "dependencies", "typed", "matrix", "self", "extend", "name", "dependencies", "typed", "config", "round", "matrix", "equalScalar", "zeros", "DenseMatrix", "concat", "floor", "name", "dependencies", "typed", "i", "name", "dependencies", "typed", "equalScalar", "i", "name", "dependencies", "typed", "DenseMatrix", "i", "count", "min", "max", "name", "dependencies", "typed", "matrix", "config", "round", "equalScalar", "zeros", "BigNumber", "DenseMatrix", "concat", "mod", "self", "i", "name", "dependencies", "typed", "equalScalar", "i", "name", "dependencies", "typed", "matrix", "equalScalar", "concat", "self", "i", "prod", "log16", "config", "name", "dependencies", "typed", "config", "Complex", "number", "BigNumber", "self", "deepMap", "name", "dependencies", "typed", "config", "Complex", "number", "BigNumber", "self", "deepMap", "name", "dependencies", "typed", "name", "dependencies", "typed", "matrix", "addScalar", "multiplyScalar", "equalScalar", "dot", "sum", "i", "row", "self", "name", "dependencies", "typed", "matrix", "equalScalar", "concat", "self", "inv", "name", "dependencies", "typed", "complex", "Complex", "BigNumber", "bigint", "Fraction", "self", "deepMap", "name", "dependencies", "config", "typed", "Complex", "BigNumber", "Unit", "name", "dependencies", "typed", "Complex", "BigNumber", "bigint", "Fraction", "Unit", "name", "dependencies", "typed", "matrix", "equalScalar", "subtractScalar", "unaryMinus", "DenseMatrix", "concat", "name", "dependencies", "typed", "config", "matrix", "BigNumber", "name", "dependencies", "typed", "config", "BigNumber", "xgcd", "equal", "smaller", "mod", "add", "isInteger", "invmod", "gcd", "inv", "name", "dependencies", "typed", "equalScalar", "i", "name", "dependencies", "typed", "matrix", "equalScalar", "multiplyScalar", "concat", "BigNumber", "i", "name", "dependencies", "typed", "matrix", "equalScalar", "concat", "name", "dependencies", "typed", "self", "deepMap", "name", "dependencies", "typed", "matrix", "equalScalar", "DenseMatrix", "concat", "name", "dependencies", "typed", "SparseMatrix", "i", "index", "name", "dependencies", "typed", "matrix", "DenseMatrix", "concat", "SparseMatrix", "name", "dependencies", "typed", "number", "BigNumber", "Complex", "self", "deepMap", "name", "dependencies", "typed", "self", "deepMap", "name", "dependencies", "typed", "self", "deepMap", "name", "dependencies", "typed", "self", "deepMap", "name", "dependencies", "typed", "Complex", "BigNumber", "self", "deepMap", "name", "dependencies", "typed", "matrix", "size", "flatten", "deepEqual", "self", "name", "dependencies", "typed", "matrix", "equalScalar", "DenseMatrix", "concat", "self", "name", "dependencies", "typed", "matrix", "DenseMatrix", "concat", "SparseMatrix", "self", "name", "dependencies", "typed", "matrix", "isInteger", "i", "arg", "clone", "size", "string", "name", "dependencies", "typed", "Index", "matrix", "range", "column", "clone", "index", "name", "dependencies", "typed", "size", "prod", "string", "name", "dependencies", "typed", "matrix", "subtract", "multiply", "product", "name", "dependencies", "typed", "matrix", "DenseMatrix", "SparseMatrix", "Array", "format", "Matrix", "size", "i", "name", "dependencies", "typed", "index", "name", "dependencies", "typed", "Array", "DenseMatrix", "SparseMatrix", "name", "dependencies", "typed", "name", "dependencies", "typed", "Array", "Matrix", "name", "dependencies", "typed", "config", "matrix", "BigNumber", "DenseMatrix", "SparseMatrix", "string", "format", "Array", "size", "Matrix", "name", "dependencies", "typed", "matrix", "multiplyScalar", "name", "dependencies", "createMap", "typed", "matrix", "i", "size", "index", "arrays", "_loop", "_loop2", "_i", "name", "dependencies", "typed", "matrix", "subtract", "number", "size", "i", "name", "dependencies", "typed", "config", "matrix", "BigNumber", "size", "format", "Matrix", "_validate", "index", "name", "dependencies", "typed", "config", "matrix", "bignumber", "smaller", "smallerEq", "larger", "largerEq", "add", "isZero", "isPositive", "number", "boolean", "start", "BigNumber", "arg", "name", "dependencies", "typed", "isInteger", "size", "name", "dependencies", "config", "matrix", "resize", "size", "clone", "format", "i", "name", "dependencies", "typed", "multiply", "rotationMatrix", "name", "dependencies", "typed", "config", "multiplyScalar", "addScalar", "unaryMinus", "norm", "BigNumber", "matrix", "DenseMatrix", "SparseMatrix", "cos", "sin", "string", "format", "size", "name", "dependencies", "typed", "Index", "matrix", "range", "row", "clone", "index", "name", "dependencies", "typed", "name", "dependencies", "typed", "Array", "clone", "Matrix", "name", "dependencies", "typed", "matrix", "zeros", "add", "index", "error", "range", "i", "clone", "name", "dependencies", "typed", "matrix", "clone", "size", "format", "i", "index", "sum", "name", "dependencies", "typed", "transpose", "conj", "name", "dependencies", "typed", "config", "matrix", "BigNumber", "size", "format", "Matrix", "_validate", "index", "name", "dependencies", "typed", "matrix", "addScalar", "multiplyScalar", "divideScalar", "exp", "tau", "dotDivide", "conj", "pow", "ceil", "log2", "Matrix", "size", "i", "arr", "_", "name", "dependencies", "typed", "fft", "dotDivide", "conj", "size", "_typeof", "o", "_typeof", "e", "i", "i", "_typeof", "_defineProperty", "e", "ownKeys", "e", "r", "_defineProperty", "name", "dependencies", "typed", "add", "subtract", "multiply", "divide", "max", "map", "abs", "isPositive", "isNegative", "larger", "smaller", "matrix", "bignumber", "unaryMinus", "i", "name", "dependencies", "typed", "number", "self", "deepMap", "P", "i", "del", "name", "dependencies", "typed", "config", "multiply", "pow", "divide", "factorial", "equal", "smallerEq", "isBounded", "isNegative", "gamma", "sin", "subtract", "add", "Complex", "pi", "zeta", "s", "name", "dependencies", "typed", "isNumeric", "count", "mode", "max", "i", "name", "dependencies", "typed", "config", "multiplyScalar", "numeric", "prod", "deepForEach", "name", "dependencies", "typed", "format", "name", "dependencies", "typed", "format", "name", "dependencies", "typed", "format", "name", "dependencies", "typed", "format", "name", "dependencies", "typed", "format", "name", "dependencies", "typed", "matrix", "concat", "unit", "name", "dependencies", "typed", "name", "dependencies", "typed", "number", "i", "bigint", "BigNumber", "Decimal", "x", "max", "self", "deepMap", "name", "dependencies", "bignumber", "fraction", "numeric", "name", "dependencies", "typed", "numeric", "name", "dependencies", "typed", "config", "identity", "multiply", "matrix", "inv", "number", "fraction", "Complex", "error", "name", "dependencies", "typed", "config", "matrix", "equalScalar", "zeros", "DenseMatrix", "number", "Complex", "BigNumber", "nearlyEqual", "Fraction", "self", "unit", "deepMap", "name", "dependencies", "typed", "typeOf", "config", "divideScalar", "Complex", "number", "BigNumber", "self", "name", "dependencies", "typed", "config", "divideScalar", "log", "Complex", "number", "BigNumber", "self", "deepMap", "name", "dependencies", "typed", "config", "divideScalar", "Complex", "arg", "abs", "name", "dependencies", "typed", "equalScalar", "matrix", "pow", "DenseMatrix", "concat", "SparseMatrix", "name", "dependencies", "typed", "matrix", "equalScalar", "divideScalar", "DenseMatrix", "concat", "SparseMatrix", "DenseMatrix", "format", "i", "index", "name", "dependencies", "typed", "matrix", "divideScalar", "multiplyScalar", "subtractScalar", "equalScalar", "DenseMatrix", "i", "index", "name", "dependencies", "typed", "matrix", "divideScalar", "multiplyScalar", "subtractScalar", "equalScalar", "DenseMatrix", "i", "index", "name", "dependencies", "typed", "matrix", "divideScalar", "multiplyScalar", "subtractScalar", "equalScalar", "DenseMatrix", "e", "i", "index", "name", "dependencies", "typed", "matrix", "divideScalar", "multiplyScalar", "subtractScalar", "equalScalar", "DenseMatrix", "e", "i", "index", "name", "dependencies", "typed", "equalScalar", "i", "typed", "matrix", "name", "dependencies", "typed", "matrix", "equalScalar", "zeros", "DenseMatrix", "concat", "self", "name", "dependencies", "typed", "matrix", "equalScalar", "zeros", "DenseMatrix", "concat", "self", "name", "dependencies", "typed", "matrix", "equalScalar", "zeros", "DenseMatrix", "concat", "self", "name", "dependencies", "typed", "matrix", "equalScalar", "zeros", "not", "concat", "self", "name", "dependencies", "typed", "config", "equalScalar", "matrix", "BigNumber", "Fraction", "DenseMatrix", "concat", "nearlyEqual", "name", "dependencies", "typed", "compare", "naturalSort", "compareNatural", "i", "name", "dependencies", "typed", "matrix", "concat", "name", "dependencies", "typed", "matrix", "equalScalar", "DenseMatrix", "concat", "SparseMatrix", "name", "dependencies", "typed", "compareText", "isZero", "name", "dependencies", "typed", "config", "bignumber", "matrix", "DenseMatrix", "concat", "SparseMatrix", "nearlyEqual", "name", "dependencies", "typed", "config", "matrix", "DenseMatrix", "concat", "SparseMatrix", "nearlyEqual", "name", "dependencies", "typed", "config", "bignumber", "matrix", "DenseMatrix", "concat", "SparseMatrix", "nearlyEqual", "name", "dependencies", "typed", "config", "matrix", "DenseMatrix", "concat", "SparseMatrix", "nearlyEqual", "name", "dependencies", "typed", "equal", "i", "name", "dependencies", "typed", "config", "equalScalar", "matrix", "DenseMatrix", "concat", "SparseMatrix", "name", "dependencies", "typed", "isNumeric", "compare", "size", "i", "to", "name", "dependencies", "typed", "matrix", "compare", "compareNatural", "Array", "Matrix", "_comparator", "name", "dependencies", "typed", "config", "numeric", "larger", "deepForEach", "name", "dependencies", "typed", "config", "numeric", "smaller", "min", "deepForEach", "name", "dependencies", "smaller", "DenseMatrix", "ImmutableDenseMatrix", "matrix", "index", "clone", "name", "dependencies", "ImmutableDenseMatrix", "getMatrixDataType", "Index", "i", "arg", "matrix", "index", "clone", "size", "range", "name", "dependencies", "smaller", "larger", "FibonacciHeap", "_linkNodes", "size", "arraySize", "i", "name", "dependencies", "addScalar", "equalScalar", "FibonacciHeap", "Spa", "i", "to", "size", "map", "index", "del", "oldIndex", "hasher", "memoize", "i", "BigNumber", "ownKeys", "e", "r", "_objectSpread", "_defineProperty", "name", "dependencies", "on", "config", "addScalar", "subtractScalar", "multiplyScalar", "divideScalar", "pow", "abs", "fix", "round", "equal", "isNumeric", "format", "Complex", "Unit", "u", "_extends", "index", "c", "oldIndex", "number", "unit", "i", "clone", "key", "diff", "pi", "BigNumber", "Fraction", "name", "dependencies", "typed", "Unit", "string", "unit", "self", "deepMap", "name", "dependencies", "typed", "SparseMatrix", "string", "name", "dependencies", "typed", "Unit", "Object", "string", "name", "dependencies", "typed", "config", "Complex", "number", "BigNumber", "name", "dependencies", "typed", "config", "Complex", "number", "BigNumber", "name", "dependencies", "typed", "Complex", "BigNumber", "name", "dependencies", "typed", "config", "Complex", "number", "BigNumber", "name", "dependencies", "typed", "config", "Complex", "number", "BigNumber", "name", "dependencies", "typed", "Complex", "BigNumber", "name", "dependencies", "typed", "config", "Complex", "number", "BigNumber", "name", "dependencies", "typed", "config", "Complex", "number", "BigNumber", "name", "dependencies", "typed", "config", "Complex", "number", "BigNumber", "name", "dependencies", "typed", "Complex", "BigNumber", "name", "dependencies", "typed", "number", "Complex", "BigNumber", "name", "dependencies", "typed", "matrix", "equalScalar", "BigNumber", "DenseMatrix", "concat", "name", "dependencies", "typed", "config", "Complex", "number", "BigNumber", "typed", "self", "name", "dependencies", "typed", "name", "dependencies", "typed", "name", "dependencies", "typed", "name", "dependencies", "typed", "name", "dependencies", "typed", "name", "dependencies", "typed", "name", "dependencies", "typed", "name", "dependencies", "typed", "name", "dependencies", "typed", "name", "dependencies", "typed", "name", "dependencies", "typed", "name", "dependencies", "typed", "name", "dependencies", "typed", "size", "subset", "compareNatural", "Index", "DenseMatrix", "i", "name", "dependencies", "typed", "size", "subset", "compareNatural", "Index", "DenseMatrix", "i", "name", "dependencies", "typed", "size", "subset", "compareNatural", "Index", "DenseMatrix", "i", "name", "dependencies", "typed", "size", "subset", "compareNatural", "Index", "DenseMatrix", "i", "name", "dependencies", "typed", "size", "subset", "compareNatural", "Index", "i", "name", "dependencies", "typed", "size", "subset", "compareNatural", "Index", "e", "count", "i", "name", "dependencies", "typed", "size", "subset", "compareNatural", "Index", "number", "i", "name", "dependencies", "typed", "compareNatural", "count", "i", "name", "dependencies", "typed", "size", "concat", "subset", "setDifference", "Index", "name", "dependencies", "typed", "size", "concat", "subset", "setIntersect", "setSymDifference", "Index", "name", "dependencies", "typed", "matrix", "addScalar", "equalScalar", "DenseMatrix", "SparseMatrix", "concat", "self", "i", "name", "dependencies", "typed", "abs", "addScalar", "divideScalar", "multiplyScalar", "sqrt", "smaller", "isPositive", "i", "name", "dependencies", "typed", "abs", "add", "pow", "conj", "sqrt", "multiply", "equalScalar", "larger", "smaller", "matrix", "ctranspose", "eigs", "Complex", "BigNumber", "boolean", "Array", "Matrix", "index", "i", "name", "dependencies", "typed", "addScalar", "multiplyScalar", "conj", "size", "add", "mul", "i", "name", "dependencies", "typed", "matrix", "add", "clone", "size", "format", "sum", "i", "index", "name", "dependencies", "typed", "Index", "arg", "name", "dependencies", "mathWithTransform", "Node", "evaluate", "math", "callback", "subset", "index", "name", "dependencies", "subset", "Node", "AccessorNode", "index", "math", "_defineProperty", "name", "dependencies", "Node", "ArrayNode", "math", "matrix", "i", "_defineProperty", "subset", "matrix", "assign", "index", "i", "index", "name", "dependencies", "subset", "matrix", "Node", "assign", "AssignmentNode", "index", "math", "_defineProperty", "name", "dependencies", "ResultSet", "Node", "BlockNode", "math", "i", "_defineProperty", "name", "dependencies", "Node", "ConditionalNode", "math", "_defineProperty", "string", "escapeLatexLib", "name", "isUnit", "name", "dependencies", "Node", "isBounded", "ConstantNode", "math", "format", "index", "_defineProperty", "name", "dependencies", "typed", "Node", "FunctionAssignmentNode", "param", "math", "i", "index", "_defineProperty", "name", "dependencies", "Node", "size", "IndexNode", "math", "i", "index", "range", "_defineProperty", "name", "dependencies", "Node", "ObjectNode", "properties", "math", "_defineProperty", "name", "dependencies", "Node", "arg", "i", "OperatorNode", "math", "index", "_defineProperty", "name", "dependencies", "Node", "ParenthesisNode", "math", "_defineProperty", "name", "dependencies", "Node", "RangeNode", "start", "math", "range", "_defineProperty", "name", "dependencies", "Node", "RelationalNode", "math", "self", "i", "index", "_defineProperty", "name", "dependencies", "math", "Unit", "Node", "SymbolNode", "isUnit", "name", "dependencies", "math", "Node", "SymbolNode", "format", "arg", "index", "FunctionNode", "fn", "i", "_defineProperty", "name", "dependencies", "typed", "numeric", "config", "AccessorNode", "ArrayNode", "AssignmentNode", "BlockNode", "ConditionalNode", "ConstantNode", "FunctionAssignmentNode", "FunctionNode", "IndexNode", "ObjectNode", "OperatorNode", "ParenthesisNode", "RangeNode", "RelationalNode", "SymbolNode", "parse", "string", "deepMap", "_extends", "arg", "index", "row", "properties", "error", "name", "dependencies", "typed", "parse", "string", "deepMap", "name", "dependencies", "typed", "parse", "string", "deepMap", "name", "dependencies", "evaluate", "parse", "Parser", "i", "parser", "name", "dependencies", "typed", "Parser", "name", "dependencies", "typed", "matrix", "abs", "addScalar", "divideScalar", "multiplyScalar", "subtractScalar", "larger", "equalScalar", "unaryMinus", "DenseMatrix", "SparseMatrix", "Spa", "Array", "clone", "i", "min", "pi", "index", "swapIndeces", "_loop", "k", "name", "dependencies", "typed", "matrix", "zeros", "identity", "isZero", "equal", "sign", "sqrt", "conj", "unaryMinus", "addScalar", "divideScalar", "multiplyScalar", "subtractScalar", "complex", "_extends", "DenseMatrix", "SparseMatrix", "Array", "Q", "i", "tau", "pinv", "i", "i", "i", "name", "dependencies", "add", "multiply", "transpose", "P", "i", "e", "ln", "i", "name", "dependencies", "transpose", "i", "name", "dependencies", "add", "multiply", "transpose", "qr", "pinv", "i", "i", "pinv", "index", "size", "i", "pinv", "i", "name", "dependencies", "divideScalar", "multiply", "subtract", "pinv", "i", "name", "dependencies", "abs", "divideScalar", "multiply", "subtract", "larger", "largerEq", "SparseMatrix", "size", "pinv", "i", "name", "dependencies", "typed", "abs", "add", "multiply", "transpose", "divideScalar", "subtract", "larger", "largerEq", "SparseMatrix", "name", "dependencies", "typed", "matrix", "lup", "slu", "usolve", "lsolve", "DenseMatrix", "name", "dependencies", "typed", "isZero", "equalScalar", "add", "subtract", "multiply", "divide", "sqrt", "unaryMinus", "cbrt", "typeOf", "im", "re", "name", "dependencies", "evaluate", "Help", "i", "e", "format", "clone", "name", "dependencies", "on", "math", "typed", "Chain", "format", "i", "_loop", "_name", "name", "dependencies", "typed", "mathWithTransform", "Help", "name", "dependencies", "typed", "Chain", "name", "dependencies", "typed", "matrix", "subtractScalar", "multiply", "divideScalar", "isZero", "unaryMinus", "clone", "det", "size", "format", "i", "name", "dependencies", "typed", "matrix", "divideScalar", "addScalar", "multiply", "unaryMinus", "det", "identity", "abs", "size", "format", "name", "dependencies", "typed", "matrix", "inv", "deepEqual", "equal", "dotDivide", "dot", "ctranspose", "divideScalar", "multiply", "add", "Complex", "size", "format", "clone", "i", "_", "addScalar", "subtract", "flatten", "multiply", "multiplyScalar", "divideScalar", "sqrt", "abs", "bignumber", "diag", "size", "reshape", "inv", "qr", "usolve", "usolveAll", "equal", "complex", "larger", "smaller", "matrixFromColumns", "dot", "i", "max", "clone", "Q", "indexOf", "_loop", "lambda", "sub", "norm", "config", "addScalar", "subtract", "abs", "atan", "cos", "sin", "multiplyScalar", "inv", "bignumber", "multiply", "add", "diag", "i", "clone", "name", "dependencies", "config", "typed", "matrix", "addScalar", "subtract", "equal", "abs", "atan", "cos", "sin", "multiplyScalar", "divideScalar", "inv", "bignumber", "multiply", "add", "larger", "column", "flatten", "number", "complex", "sqrt", "diag", "size", "reshape", "qr", "usolve", "usolveAll", "im", "re", "smaller", "matrixFromColumns", "dot", "Array", "Matrix", "_extends", "format", "i", "name", "dependencies", "typed", "abs", "add", "identity", "inv", "multiply", "Matrix", "size", "format", "i", "name", "dependencies", "typed", "abs", "add", "multiply", "map", "sqrt", "subtract", "inv", "size", "max", "identity", "error", "format", "name", "dependencies", "typed", "schur", "matrixFromColumns", "matrix", "multiply", "range", "concat", "transpose", "index", "subset", "add", "subtract", "identity", "lusolve", "abs", "config", "name", "dependencies", "typed", "matrix", "identity", "multiply", "qr", "norm", "subtract", "Array", "Matrix", "Q", "name", "dependencies", "typed", "matrix", "sylvester", "multiply", "transpose", "Q", "name", "dependencies", "typed", "matrix", "multiply", "equalScalar", "divideScalar", "inv", "extend", "name", "dependencies", "typed", "addScalar", "subtractScalar", "multiplyScalar", "divideScalar", "deepEqual", "sqrt", "abs", "Array", "i", "diff", "name", "dependencies", "typed", "config", "abs", "add", "addScalar", "matrix", "multiply", "multiplyScalar", "divideScalar", "subtract", "smaller", "equalScalar", "flatten", "isZero", "isNumeric", "det", "e", "i", "add2", "add3", "name", "dependencies", "typed", "config", "add", "numeric", "sum", "deepForEach", "name", "dependencies", "typed", "add", "unaryPlus", "Matrix", "matrix", "i", "size", "name", "dependencies", "typed", "add", "divide", "sum", "deepForEach", "name", "dependencies", "typed", "add", "divide", "compare", "partitionSelect", "i", "name", "dependencies", "typed", "abs", "map", "median", "subtract", "name", "dependencies", "typed", "add", "subtract", "multiply", "divide", "mapSlices", "sum", "deepForEach", "mean", "diff", "name", "dependencies", "typed", "bignumber", "add", "subtract", "divide", "multiply", "partitionSelect", "compare", "isInteger", "smaller", "smallerEq", "larger", "mapSlices", "i", "index", "name", "dependencies", "typed", "map", "sqrt", "variance", "name", "dependencies", "typed", "matrix", "sqrt", "sum", "add", "subtract", "multiply", "pow", "divide", "i", "index", "name", "dependencies", "typed", "config", "number", "Fraction", "index", "divide", "i", "name", "dependencies", "typed", "BigNumber", "i", "name", "dependencies", "typed", "product", "BigNumber", "i", "isPositiveInteger", "name", "dependencies", "typed", "config", "multiplyScalar", "pow", "Complex", "i", "BigNumber", "prod", "sum", "name", "dependencies", "Complex", "typed", "BigNumber", "i", "name", "dependencies", "typed", "gamma", "number", "BigNumber", "self", "deepMap", "name", "dependencies", "typed", "matrix", "divide", "sum", "multiply", "map", "dotDivide", "log", "isNumeric", "name", "dependencies", "typed", "add", "divide", "multiply", "factorial", "isInteger", "isPositive", "sum", "deepForEach", "name", "dependencies", "typed", "factorial", "product", "i", "isPositiveInteger", "seedrandom", "random", "name", "dependencies", "typed", "config", "on", "number", "createMatrix", "i", "size", "random", "i", "name", "dependencies", "typed", "config", "on", "max", "min", "size", "name", "dependencies", "typed", "config", "log2", "on", "max", "min", "size", "i", "name", "dependencies", "typed", "addScalar", "subtractScalar", "multiplyScalar", "divideScalar", "pow", "factorial", "combinations", "isNegative", "isInteger", "number", "bignumber", "larger", "cache", "row", "i", "name", "dependencies", "typed", "addScalar", "isNegative", "isInteger", "stirlingS2", "i", "name", "dependencies", "typed", "addScalar", "divideScalar", "multiplyScalar", "combinations", "isNegative", "isInteger", "name", "dependencies", "typed", "addScalar", "combinations", "isPositive", "isNegative", "isInteger", "larger", "name", "dependencies", "parse", "typed", "count", "Node", "ownKeys", "e", "r", "_objectSpread", "_defineProperty", "name", "dependencies", "FunctionNode", "OperatorNode", "SymbolNode", "hasProperty", "properties", "flatten", "i", "node", "name", "dependencies", "typed", "parse", "equal", "resolve", "simplifyConstant", "simplifyCore", "AccessorNode", "ArrayNode", "ConstantNode", "FunctionNode", "IndexNode", "ObjectNode", "OperatorNode", "ParenthesisNode", "SymbolNode", "replacer", "hasProperty", "flatten", "simplify", "node", "i", "newIndex", "matches", "name", "dependencies", "typed", "config", "mathWithTransform", "matrix", "isBounded", "fraction", "bignumber", "AccessorNode", "ArrayNode", "ConstantNode", "FunctionNode", "IndexNode", "ObjectNode", "OperatorNode", "SymbolNode", "simplifyConstant", "number", "BigNumber", "bigint", "Complex", "string", "Matrix", "e", "index", "arg", "i", "name", "dependencies", "typed", "parse", "equal", "isZero", "add", "subtract", "multiply", "divide", "pow", "AccessorNode", "ArrayNode", "ConstantNode", "FunctionNode", "IndexNode", "ObjectNode", "OperatorNode", "ParenthesisNode", "SymbolNode", "hasProperty", "name", "dependencies", "typed", "parse", "ConstantNode", "FunctionNode", "OperatorNode", "ParenthesisNode", "arg", "self", "name", "dependencies", "parse", "simplify", "typed", "OperatorNode", "e2", "diff", "name", "dependencies", "typed", "config", "parse", "simplify", "equal", "isZero", "numeric", "ConstantNode", "FunctionNode", "OperatorNode", "ParenthesisNode", "SymbolNode", "cache", "res", "string", "derivative", "arg", "createConstantNode", "div", "name", "dependencies", "config", "typed", "equal", "isZero", "add", "subtract", "multiply", "divide", "pow", "parse", "simplifyConstant", "simplifyCore", "simplify", "fraction", "bignumber", "mathWithTransform", "matrix", "AccessorNode", "ArrayNode", "ConstantNode", "FunctionNode", "IndexNode", "ObjectNode", "OperatorNode", "SymbolNode", "ParenthesisNode", "node", "i", "n1", "n2", "o", "name", "dependencies", "typed", "add", "multiply", "Complex", "number", "i", "name", "dependencies", "typed", "add", "multiply", "Complex", "divide", "matrix", "i", "name", "dependencies", "classes", "reviver", "name", "dependencies", "replacer", "version", "config", "BigNumber", "Complex", "version", "name", "dependencies", "name", "dependencies", "config", "Unit", "BigNumber", "unit", "ownKeys", "e", "r", "_objectSpread", "_defineProperty", "name", "dependencies", "typed", "isInteger", "mapSlices", "name", "dependencies", "typed", "Index", "matrix", "range", "column", "math", "name", "name", "dependencies", "typed", "typedFunction", "name", "dependencies", "typed", "math", "filter", "arg", "name", "dependencies", "typed", "forEach", "math", "arg", "name", "dependencies", "Index", "getMatrixDataType", "i", "arg", "name", "dependencies", "typed", "map", "createMap", "math", "arg", "scope", "name", "dependencies", "typed", "config", "numeric", "larger", "max", "name", "dependencies", "typed", "add", "divide", "mean", "name", "dependencies", "typed", "config", "numeric", "smaller", "min", "name", "dependencies", "typed", "config", "matrix", "bignumber", "equal", "smaller", "smallerEq", "larger", "largerEq", "add", "isZero", "isPositive", "range", "name", "dependencies", "typed", "Index", "matrix", "range", "row", "name", "dependencies", "typed", "matrix", "zeros", "add", "subset", "name", "dependencies", "typed", "matrix", "isInteger", "concat", "name", "dependencies", "typed", "matrix", "subtract", "number", "bignumber", "diff", "name", "dependencies", "typed", "map", "sqrt", "variance", "std", "name", "dependencies", "typed", "config", "add", "numeric", "sum", "name", "dependencies", "typed", "bignumber", "add", "subtract", "divide", "multiply", "partitionSelect", "compare", "isInteger", "smaller", "smallerEq", "larger", "mapSlices", "quantileSeq", "dimToZeroBase", "name", "dependencies", "typed", "add", "unaryPlus", "cumsum", "name", "dependencies", "typed", "add", "subtract", "multiply", "divide", "mapSlices", "variance", "name", "dependencies", "typed", "matrix", "zeros", "add", "print", "name", "dependencies", "typed", "matrix", "equalScalar", "zeros", "not", "concat", "and", "math", "name", "dependencies", "typed", "matrix", "equalScalar", "DenseMatrix", "concat", "or", "math", "name", "dependencies", "typed", "matrix", "size", "flatten", "deepEqual", "nullish", "math", "name", "dependencies", "typed", "matrix", "equalScalar", "zeros", "not", "concat", "bitAnd", "math", "name", "dependencies", "typed", "matrix", "equalScalar", "DenseMatrix", "concat", "bitOr", "math", "config", "Complex", "e", "Fraction", "LN10", "phi", "tau", "version", "pi", "typed", "abs", "acos", "asinh", "atan", "atanh", "clone", "cos", "exp", "expm1", "filter", "flatten", "forEach", "format", "isNaN", "log10", "log2", "map", "createMap", "random", "sign", "sin", "tan", "typeOf", "acosh", "cosh", "isFinite", "matrix", "resize", "sinh", "sqrt", "squeeze", "tanh", "zeros", "asin", "isInteger", "flatten", "matrix", "typed", "numeric", "config", "reshape", "isInteger", "round", "zeros", "Fraction", "cbrt", "Complex", "concat", "floor", "gcd", "max", "isNaN", "mod", "sign", "sqrt", "add", "atan2", "bitXor", "compareText", "abs", "hypot", "log", "typeOf", "min", "sum", "ceil", "index", "log1p", "pow", "sort", "map", "divide", "exp", "log2", "tau", "format", "atan", "cos", "sin", "pi", "Node", "typed", "matrix", "parse", "config", "numeric", "add", "divide", "pow", "_extends", "e", "LN10", "phi", "tau", "version", "pi", "abs", "acos", "asinh", "atan", "atanh", "clone", "cos", "exp", "expm1", "filter", "flatten", "forEach", "format", "isNaN", "log10", "log2", "map", "random", "sign", "sin", "tan", "typeOf", "acosh", "cosh", "isFinite", "resize", "sinh", "sqrt", "squeeze", "tanh", "zeros", "asin", "isInteger", "reshape", "round", "cbrt", "concat", "floor", "gcd", "max", "mod", "atan2", "bitXor", "compareText", "hypot", "log", "min", "sum", "ceil", "index", "log1p", "sort", "Complex", "Fraction"]
}